refs / files-backend.con commit refs: make peel_ref() virtual (bd427cf)
   1#include "../cache.h"
   2#include "../refs.h"
   3#include "refs-internal.h"
   4#include "../iterator.h"
   5#include "../dir-iterator.h"
   6#include "../lockfile.h"
   7#include "../object.h"
   8#include "../dir.h"
   9
  10struct ref_lock {
  11        char *ref_name;
  12        struct lock_file *lk;
  13        struct object_id old_oid;
  14};
  15
  16struct ref_entry;
  17
  18/*
  19 * Information used (along with the information in ref_entry) to
  20 * describe a single cached reference.  This data structure only
  21 * occurs embedded in a union in struct ref_entry, and only when
  22 * (ref_entry->flag & REF_DIR) is zero.
  23 */
  24struct ref_value {
  25        /*
  26         * The name of the object to which this reference resolves
  27         * (which may be a tag object).  If REF_ISBROKEN, this is
  28         * null.  If REF_ISSYMREF, then this is the name of the object
  29         * referred to by the last reference in the symlink chain.
  30         */
  31        struct object_id oid;
  32
  33        /*
  34         * If REF_KNOWS_PEELED, then this field holds the peeled value
  35         * of this reference, or null if the reference is known not to
  36         * be peelable.  See the documentation for peel_ref() for an
  37         * exact definition of "peelable".
  38         */
  39        struct object_id peeled;
  40};
  41
  42struct files_ref_store;
  43
  44/*
  45 * Information used (along with the information in ref_entry) to
  46 * describe a level in the hierarchy of references.  This data
  47 * structure only occurs embedded in a union in struct ref_entry, and
  48 * only when (ref_entry.flag & REF_DIR) is set.  In that case,
  49 * (ref_entry.flag & REF_INCOMPLETE) determines whether the references
  50 * in the directory have already been read:
  51 *
  52 *     (ref_entry.flag & REF_INCOMPLETE) unset -- a directory of loose
  53 *         or packed references, already read.
  54 *
  55 *     (ref_entry.flag & REF_INCOMPLETE) set -- a directory of loose
  56 *         references that hasn't been read yet (nor has any of its
  57 *         subdirectories).
  58 *
  59 * Entries within a directory are stored within a growable array of
  60 * pointers to ref_entries (entries, nr, alloc).  Entries 0 <= i <
  61 * sorted are sorted by their component name in strcmp() order and the
  62 * remaining entries are unsorted.
  63 *
  64 * Loose references are read lazily, one directory at a time.  When a
  65 * directory of loose references is read, then all of the references
  66 * in that directory are stored, and REF_INCOMPLETE stubs are created
  67 * for any subdirectories, but the subdirectories themselves are not
  68 * read.  The reading is triggered by get_ref_dir().
  69 */
  70struct ref_dir {
  71        int nr, alloc;
  72
  73        /*
  74         * Entries with index 0 <= i < sorted are sorted by name.  New
  75         * entries are appended to the list unsorted, and are sorted
  76         * only when required; thus we avoid the need to sort the list
  77         * after the addition of every reference.
  78         */
  79        int sorted;
  80
  81        /* A pointer to the files_ref_store that contains this ref_dir. */
  82        struct files_ref_store *ref_store;
  83
  84        struct ref_entry **entries;
  85};
  86
  87/*
  88 * Bit values for ref_entry::flag.  REF_ISSYMREF=0x01,
  89 * REF_ISPACKED=0x02, REF_ISBROKEN=0x04 and REF_BAD_NAME=0x08 are
  90 * public values; see refs.h.
  91 */
  92
  93/*
  94 * The field ref_entry->u.value.peeled of this value entry contains
  95 * the correct peeled value for the reference, which might be
  96 * null_sha1 if the reference is not a tag or if it is broken.
  97 */
  98#define REF_KNOWS_PEELED 0x10
  99
 100/* ref_entry represents a directory of references */
 101#define REF_DIR 0x20
 102
 103/*
 104 * Entry has not yet been read from disk (used only for REF_DIR
 105 * entries representing loose references)
 106 */
 107#define REF_INCOMPLETE 0x40
 108
 109/*
 110 * A ref_entry represents either a reference or a "subdirectory" of
 111 * references.
 112 *
 113 * Each directory in the reference namespace is represented by a
 114 * ref_entry with (flags & REF_DIR) set and containing a subdir member
 115 * that holds the entries in that directory that have been read so
 116 * far.  If (flags & REF_INCOMPLETE) is set, then the directory and
 117 * its subdirectories haven't been read yet.  REF_INCOMPLETE is only
 118 * used for loose reference directories.
 119 *
 120 * References are represented by a ref_entry with (flags & REF_DIR)
 121 * unset and a value member that describes the reference's value.  The
 122 * flag member is at the ref_entry level, but it is also needed to
 123 * interpret the contents of the value field (in other words, a
 124 * ref_value object is not very much use without the enclosing
 125 * ref_entry).
 126 *
 127 * Reference names cannot end with slash and directories' names are
 128 * always stored with a trailing slash (except for the top-level
 129 * directory, which is always denoted by "").  This has two nice
 130 * consequences: (1) when the entries in each subdir are sorted
 131 * lexicographically by name (as they usually are), the references in
 132 * a whole tree can be generated in lexicographic order by traversing
 133 * the tree in left-to-right, depth-first order; (2) the names of
 134 * references and subdirectories cannot conflict, and therefore the
 135 * presence of an empty subdirectory does not block the creation of a
 136 * similarly-named reference.  (The fact that reference names with the
 137 * same leading components can conflict *with each other* is a
 138 * separate issue that is regulated by verify_refname_available().)
 139 *
 140 * Please note that the name field contains the fully-qualified
 141 * reference (or subdirectory) name.  Space could be saved by only
 142 * storing the relative names.  But that would require the full names
 143 * to be generated on the fly when iterating in do_for_each_ref(), and
 144 * would break callback functions, who have always been able to assume
 145 * that the name strings that they are passed will not be freed during
 146 * the iteration.
 147 */
 148struct ref_entry {
 149        unsigned char flag; /* ISSYMREF? ISPACKED? */
 150        union {
 151                struct ref_value value; /* if not (flags&REF_DIR) */
 152                struct ref_dir subdir; /* if (flags&REF_DIR) */
 153        } u;
 154        /*
 155         * The full name of the reference (e.g., "refs/heads/master")
 156         * or the full name of the directory with a trailing slash
 157         * (e.g., "refs/heads/"):
 158         */
 159        char name[FLEX_ARRAY];
 160};
 161
 162static void read_loose_refs(const char *dirname, struct ref_dir *dir);
 163static int search_ref_dir(struct ref_dir *dir, const char *refname, size_t len);
 164static struct ref_entry *create_dir_entry(struct files_ref_store *ref_store,
 165                                          const char *dirname, size_t len,
 166                                          int incomplete);
 167static void add_entry_to_dir(struct ref_dir *dir, struct ref_entry *entry);
 168
 169static struct ref_dir *get_ref_dir(struct ref_entry *entry)
 170{
 171        struct ref_dir *dir;
 172        assert(entry->flag & REF_DIR);
 173        dir = &entry->u.subdir;
 174        if (entry->flag & REF_INCOMPLETE) {
 175                read_loose_refs(entry->name, dir);
 176
 177                /*
 178                 * Manually add refs/bisect, which, being
 179                 * per-worktree, might not appear in the directory
 180                 * listing for refs/ in the main repo.
 181                 */
 182                if (!strcmp(entry->name, "refs/")) {
 183                        int pos = search_ref_dir(dir, "refs/bisect/", 12);
 184                        if (pos < 0) {
 185                                struct ref_entry *child_entry;
 186                                child_entry = create_dir_entry(dir->ref_store,
 187                                                               "refs/bisect/",
 188                                                               12, 1);
 189                                add_entry_to_dir(dir, child_entry);
 190                                read_loose_refs("refs/bisect",
 191                                                &child_entry->u.subdir);
 192                        }
 193                }
 194                entry->flag &= ~REF_INCOMPLETE;
 195        }
 196        return dir;
 197}
 198
 199static struct ref_entry *create_ref_entry(const char *refname,
 200                                          const unsigned char *sha1, int flag,
 201                                          int check_name)
 202{
 203        struct ref_entry *ref;
 204
 205        if (check_name &&
 206            check_refname_format(refname, REFNAME_ALLOW_ONELEVEL))
 207                die("Reference has invalid format: '%s'", refname);
 208        FLEX_ALLOC_STR(ref, name, refname);
 209        hashcpy(ref->u.value.oid.hash, sha1);
 210        oidclr(&ref->u.value.peeled);
 211        ref->flag = flag;
 212        return ref;
 213}
 214
 215static void clear_ref_dir(struct ref_dir *dir);
 216
 217static void free_ref_entry(struct ref_entry *entry)
 218{
 219        if (entry->flag & REF_DIR) {
 220                /*
 221                 * Do not use get_ref_dir() here, as that might
 222                 * trigger the reading of loose refs.
 223                 */
 224                clear_ref_dir(&entry->u.subdir);
 225        }
 226        free(entry);
 227}
 228
 229/*
 230 * Add a ref_entry to the end of dir (unsorted).  Entry is always
 231 * stored directly in dir; no recursion into subdirectories is
 232 * done.
 233 */
 234static void add_entry_to_dir(struct ref_dir *dir, struct ref_entry *entry)
 235{
 236        ALLOC_GROW(dir->entries, dir->nr + 1, dir->alloc);
 237        dir->entries[dir->nr++] = entry;
 238        /* optimize for the case that entries are added in order */
 239        if (dir->nr == 1 ||
 240            (dir->nr == dir->sorted + 1 &&
 241             strcmp(dir->entries[dir->nr - 2]->name,
 242                    dir->entries[dir->nr - 1]->name) < 0))
 243                dir->sorted = dir->nr;
 244}
 245
 246/*
 247 * Clear and free all entries in dir, recursively.
 248 */
 249static void clear_ref_dir(struct ref_dir *dir)
 250{
 251        int i;
 252        for (i = 0; i < dir->nr; i++)
 253                free_ref_entry(dir->entries[i]);
 254        free(dir->entries);
 255        dir->sorted = dir->nr = dir->alloc = 0;
 256        dir->entries = NULL;
 257}
 258
 259/*
 260 * Create a struct ref_entry object for the specified dirname.
 261 * dirname is the name of the directory with a trailing slash (e.g.,
 262 * "refs/heads/") or "" for the top-level directory.
 263 */
 264static struct ref_entry *create_dir_entry(struct files_ref_store *ref_store,
 265                                          const char *dirname, size_t len,
 266                                          int incomplete)
 267{
 268        struct ref_entry *direntry;
 269        FLEX_ALLOC_MEM(direntry, name, dirname, len);
 270        direntry->u.subdir.ref_store = ref_store;
 271        direntry->flag = REF_DIR | (incomplete ? REF_INCOMPLETE : 0);
 272        return direntry;
 273}
 274
 275static int ref_entry_cmp(const void *a, const void *b)
 276{
 277        struct ref_entry *one = *(struct ref_entry **)a;
 278        struct ref_entry *two = *(struct ref_entry **)b;
 279        return strcmp(one->name, two->name);
 280}
 281
 282static void sort_ref_dir(struct ref_dir *dir);
 283
 284struct string_slice {
 285        size_t len;
 286        const char *str;
 287};
 288
 289static int ref_entry_cmp_sslice(const void *key_, const void *ent_)
 290{
 291        const struct string_slice *key = key_;
 292        const struct ref_entry *ent = *(const struct ref_entry * const *)ent_;
 293        int cmp = strncmp(key->str, ent->name, key->len);
 294        if (cmp)
 295                return cmp;
 296        return '\0' - (unsigned char)ent->name[key->len];
 297}
 298
 299/*
 300 * Return the index of the entry with the given refname from the
 301 * ref_dir (non-recursively), sorting dir if necessary.  Return -1 if
 302 * no such entry is found.  dir must already be complete.
 303 */
 304static int search_ref_dir(struct ref_dir *dir, const char *refname, size_t len)
 305{
 306        struct ref_entry **r;
 307        struct string_slice key;
 308
 309        if (refname == NULL || !dir->nr)
 310                return -1;
 311
 312        sort_ref_dir(dir);
 313        key.len = len;
 314        key.str = refname;
 315        r = bsearch(&key, dir->entries, dir->nr, sizeof(*dir->entries),
 316                    ref_entry_cmp_sslice);
 317
 318        if (r == NULL)
 319                return -1;
 320
 321        return r - dir->entries;
 322}
 323
 324/*
 325 * Search for a directory entry directly within dir (without
 326 * recursing).  Sort dir if necessary.  subdirname must be a directory
 327 * name (i.e., end in '/').  If mkdir is set, then create the
 328 * directory if it is missing; otherwise, return NULL if the desired
 329 * directory cannot be found.  dir must already be complete.
 330 */
 331static struct ref_dir *search_for_subdir(struct ref_dir *dir,
 332                                         const char *subdirname, size_t len,
 333                                         int mkdir)
 334{
 335        int entry_index = search_ref_dir(dir, subdirname, len);
 336        struct ref_entry *entry;
 337        if (entry_index == -1) {
 338                if (!mkdir)
 339                        return NULL;
 340                /*
 341                 * Since dir is complete, the absence of a subdir
 342                 * means that the subdir really doesn't exist;
 343                 * therefore, create an empty record for it but mark
 344                 * the record complete.
 345                 */
 346                entry = create_dir_entry(dir->ref_store, subdirname, len, 0);
 347                add_entry_to_dir(dir, entry);
 348        } else {
 349                entry = dir->entries[entry_index];
 350        }
 351        return get_ref_dir(entry);
 352}
 353
 354/*
 355 * If refname is a reference name, find the ref_dir within the dir
 356 * tree that should hold refname.  If refname is a directory name
 357 * (i.e., ends in '/'), then return that ref_dir itself.  dir must
 358 * represent the top-level directory and must already be complete.
 359 * Sort ref_dirs and recurse into subdirectories as necessary.  If
 360 * mkdir is set, then create any missing directories; otherwise,
 361 * return NULL if the desired directory cannot be found.
 362 */
 363static struct ref_dir *find_containing_dir(struct ref_dir *dir,
 364                                           const char *refname, int mkdir)
 365{
 366        const char *slash;
 367        for (slash = strchr(refname, '/'); slash; slash = strchr(slash + 1, '/')) {
 368                size_t dirnamelen = slash - refname + 1;
 369                struct ref_dir *subdir;
 370                subdir = search_for_subdir(dir, refname, dirnamelen, mkdir);
 371                if (!subdir) {
 372                        dir = NULL;
 373                        break;
 374                }
 375                dir = subdir;
 376        }
 377
 378        return dir;
 379}
 380
 381/*
 382 * Find the value entry with the given name in dir, sorting ref_dirs
 383 * and recursing into subdirectories as necessary.  If the name is not
 384 * found or it corresponds to a directory entry, return NULL.
 385 */
 386static struct ref_entry *find_ref(struct ref_dir *dir, const char *refname)
 387{
 388        int entry_index;
 389        struct ref_entry *entry;
 390        dir = find_containing_dir(dir, refname, 0);
 391        if (!dir)
 392                return NULL;
 393        entry_index = search_ref_dir(dir, refname, strlen(refname));
 394        if (entry_index == -1)
 395                return NULL;
 396        entry = dir->entries[entry_index];
 397        return (entry->flag & REF_DIR) ? NULL : entry;
 398}
 399
 400/*
 401 * Remove the entry with the given name from dir, recursing into
 402 * subdirectories as necessary.  If refname is the name of a directory
 403 * (i.e., ends with '/'), then remove the directory and its contents.
 404 * If the removal was successful, return the number of entries
 405 * remaining in the directory entry that contained the deleted entry.
 406 * If the name was not found, return -1.  Please note that this
 407 * function only deletes the entry from the cache; it does not delete
 408 * it from the filesystem or ensure that other cache entries (which
 409 * might be symbolic references to the removed entry) are updated.
 410 * Nor does it remove any containing dir entries that might be made
 411 * empty by the removal.  dir must represent the top-level directory
 412 * and must already be complete.
 413 */
 414static int remove_entry(struct ref_dir *dir, const char *refname)
 415{
 416        int refname_len = strlen(refname);
 417        int entry_index;
 418        struct ref_entry *entry;
 419        int is_dir = refname[refname_len - 1] == '/';
 420        if (is_dir) {
 421                /*
 422                 * refname represents a reference directory.  Remove
 423                 * the trailing slash; otherwise we will get the
 424                 * directory *representing* refname rather than the
 425                 * one *containing* it.
 426                 */
 427                char *dirname = xmemdupz(refname, refname_len - 1);
 428                dir = find_containing_dir(dir, dirname, 0);
 429                free(dirname);
 430        } else {
 431                dir = find_containing_dir(dir, refname, 0);
 432        }
 433        if (!dir)
 434                return -1;
 435        entry_index = search_ref_dir(dir, refname, refname_len);
 436        if (entry_index == -1)
 437                return -1;
 438        entry = dir->entries[entry_index];
 439
 440        memmove(&dir->entries[entry_index],
 441                &dir->entries[entry_index + 1],
 442                (dir->nr - entry_index - 1) * sizeof(*dir->entries)
 443                );
 444        dir->nr--;
 445        if (dir->sorted > entry_index)
 446                dir->sorted--;
 447        free_ref_entry(entry);
 448        return dir->nr;
 449}
 450
 451/*
 452 * Add a ref_entry to the ref_dir (unsorted), recursing into
 453 * subdirectories as necessary.  dir must represent the top-level
 454 * directory.  Return 0 on success.
 455 */
 456static int add_ref(struct ref_dir *dir, struct ref_entry *ref)
 457{
 458        dir = find_containing_dir(dir, ref->name, 1);
 459        if (!dir)
 460                return -1;
 461        add_entry_to_dir(dir, ref);
 462        return 0;
 463}
 464
 465/*
 466 * Emit a warning and return true iff ref1 and ref2 have the same name
 467 * and the same sha1.  Die if they have the same name but different
 468 * sha1s.
 469 */
 470static int is_dup_ref(const struct ref_entry *ref1, const struct ref_entry *ref2)
 471{
 472        if (strcmp(ref1->name, ref2->name))
 473                return 0;
 474
 475        /* Duplicate name; make sure that they don't conflict: */
 476
 477        if ((ref1->flag & REF_DIR) || (ref2->flag & REF_DIR))
 478                /* This is impossible by construction */
 479                die("Reference directory conflict: %s", ref1->name);
 480
 481        if (oidcmp(&ref1->u.value.oid, &ref2->u.value.oid))
 482                die("Duplicated ref, and SHA1s don't match: %s", ref1->name);
 483
 484        warning("Duplicated ref: %s", ref1->name);
 485        return 1;
 486}
 487
 488/*
 489 * Sort the entries in dir non-recursively (if they are not already
 490 * sorted) and remove any duplicate entries.
 491 */
 492static void sort_ref_dir(struct ref_dir *dir)
 493{
 494        int i, j;
 495        struct ref_entry *last = NULL;
 496
 497        /*
 498         * This check also prevents passing a zero-length array to qsort(),
 499         * which is a problem on some platforms.
 500         */
 501        if (dir->sorted == dir->nr)
 502                return;
 503
 504        qsort(dir->entries, dir->nr, sizeof(*dir->entries), ref_entry_cmp);
 505
 506        /* Remove any duplicates: */
 507        for (i = 0, j = 0; j < dir->nr; j++) {
 508                struct ref_entry *entry = dir->entries[j];
 509                if (last && is_dup_ref(last, entry))
 510                        free_ref_entry(entry);
 511                else
 512                        last = dir->entries[i++] = entry;
 513        }
 514        dir->sorted = dir->nr = i;
 515}
 516
 517/*
 518 * Return true if refname, which has the specified oid and flags, can
 519 * be resolved to an object in the database. If the referred-to object
 520 * does not exist, emit a warning and return false.
 521 */
 522static int ref_resolves_to_object(const char *refname,
 523                                  const struct object_id *oid,
 524                                  unsigned int flags)
 525{
 526        if (flags & REF_ISBROKEN)
 527                return 0;
 528        if (!has_sha1_file(oid->hash)) {
 529                error("%s does not point to a valid object!", refname);
 530                return 0;
 531        }
 532        return 1;
 533}
 534
 535/*
 536 * Return true if the reference described by entry can be resolved to
 537 * an object in the database; otherwise, emit a warning and return
 538 * false.
 539 */
 540static int entry_resolves_to_object(struct ref_entry *entry)
 541{
 542        return ref_resolves_to_object(entry->name,
 543                                      &entry->u.value.oid, entry->flag);
 544}
 545
 546typedef int each_ref_entry_fn(struct ref_entry *entry, void *cb_data);
 547
 548/*
 549 * Call fn for each reference in dir that has index in the range
 550 * offset <= index < dir->nr.  Recurse into subdirectories that are in
 551 * that index range, sorting them before iterating.  This function
 552 * does not sort dir itself; it should be sorted beforehand.  fn is
 553 * called for all references, including broken ones.
 554 */
 555static int do_for_each_entry_in_dir(struct ref_dir *dir, int offset,
 556                                    each_ref_entry_fn fn, void *cb_data)
 557{
 558        int i;
 559        assert(dir->sorted == dir->nr);
 560        for (i = offset; i < dir->nr; i++) {
 561                struct ref_entry *entry = dir->entries[i];
 562                int retval;
 563                if (entry->flag & REF_DIR) {
 564                        struct ref_dir *subdir = get_ref_dir(entry);
 565                        sort_ref_dir(subdir);
 566                        retval = do_for_each_entry_in_dir(subdir, 0, fn, cb_data);
 567                } else {
 568                        retval = fn(entry, cb_data);
 569                }
 570                if (retval)
 571                        return retval;
 572        }
 573        return 0;
 574}
 575
 576/*
 577 * Load all of the refs from the dir into our in-memory cache. The hard work
 578 * of loading loose refs is done by get_ref_dir(), so we just need to recurse
 579 * through all of the sub-directories. We do not even need to care about
 580 * sorting, as traversal order does not matter to us.
 581 */
 582static void prime_ref_dir(struct ref_dir *dir)
 583{
 584        int i;
 585        for (i = 0; i < dir->nr; i++) {
 586                struct ref_entry *entry = dir->entries[i];
 587                if (entry->flag & REF_DIR)
 588                        prime_ref_dir(get_ref_dir(entry));
 589        }
 590}
 591
 592/*
 593 * A level in the reference hierarchy that is currently being iterated
 594 * through.
 595 */
 596struct cache_ref_iterator_level {
 597        /*
 598         * The ref_dir being iterated over at this level. The ref_dir
 599         * is sorted before being stored here.
 600         */
 601        struct ref_dir *dir;
 602
 603        /*
 604         * The index of the current entry within dir (which might
 605         * itself be a directory). If index == -1, then the iteration
 606         * hasn't yet begun. If index == dir->nr, then the iteration
 607         * through this level is over.
 608         */
 609        int index;
 610};
 611
 612/*
 613 * Represent an iteration through a ref_dir in the memory cache. The
 614 * iteration recurses through subdirectories.
 615 */
 616struct cache_ref_iterator {
 617        struct ref_iterator base;
 618
 619        /*
 620         * The number of levels currently on the stack. This is always
 621         * at least 1, because when it becomes zero the iteration is
 622         * ended and this struct is freed.
 623         */
 624        size_t levels_nr;
 625
 626        /* The number of levels that have been allocated on the stack */
 627        size_t levels_alloc;
 628
 629        /*
 630         * A stack of levels. levels[0] is the uppermost level that is
 631         * being iterated over in this iteration. (This is not
 632         * necessary the top level in the references hierarchy. If we
 633         * are iterating through a subtree, then levels[0] will hold
 634         * the ref_dir for that subtree, and subsequent levels will go
 635         * on from there.)
 636         */
 637        struct cache_ref_iterator_level *levels;
 638};
 639
 640static int cache_ref_iterator_advance(struct ref_iterator *ref_iterator)
 641{
 642        struct cache_ref_iterator *iter =
 643                (struct cache_ref_iterator *)ref_iterator;
 644
 645        while (1) {
 646                struct cache_ref_iterator_level *level =
 647                        &iter->levels[iter->levels_nr - 1];
 648                struct ref_dir *dir = level->dir;
 649                struct ref_entry *entry;
 650
 651                if (level->index == -1)
 652                        sort_ref_dir(dir);
 653
 654                if (++level->index == level->dir->nr) {
 655                        /* This level is exhausted; pop up a level */
 656                        if (--iter->levels_nr == 0)
 657                                return ref_iterator_abort(ref_iterator);
 658
 659                        continue;
 660                }
 661
 662                entry = dir->entries[level->index];
 663
 664                if (entry->flag & REF_DIR) {
 665                        /* push down a level */
 666                        ALLOC_GROW(iter->levels, iter->levels_nr + 1,
 667                                   iter->levels_alloc);
 668
 669                        level = &iter->levels[iter->levels_nr++];
 670                        level->dir = get_ref_dir(entry);
 671                        level->index = -1;
 672                } else {
 673                        iter->base.refname = entry->name;
 674                        iter->base.oid = &entry->u.value.oid;
 675                        iter->base.flags = entry->flag;
 676                        return ITER_OK;
 677                }
 678        }
 679}
 680
 681static enum peel_status peel_entry(struct ref_entry *entry, int repeel);
 682
 683static int cache_ref_iterator_peel(struct ref_iterator *ref_iterator,
 684                                   struct object_id *peeled)
 685{
 686        struct cache_ref_iterator *iter =
 687                (struct cache_ref_iterator *)ref_iterator;
 688        struct cache_ref_iterator_level *level;
 689        struct ref_entry *entry;
 690
 691        level = &iter->levels[iter->levels_nr - 1];
 692
 693        if (level->index == -1)
 694                die("BUG: peel called before advance for cache iterator");
 695
 696        entry = level->dir->entries[level->index];
 697
 698        if (peel_entry(entry, 0))
 699                return -1;
 700        hashcpy(peeled->hash, entry->u.value.peeled.hash);
 701        return 0;
 702}
 703
 704static int cache_ref_iterator_abort(struct ref_iterator *ref_iterator)
 705{
 706        struct cache_ref_iterator *iter =
 707                (struct cache_ref_iterator *)ref_iterator;
 708
 709        free(iter->levels);
 710        base_ref_iterator_free(ref_iterator);
 711        return ITER_DONE;
 712}
 713
 714static struct ref_iterator_vtable cache_ref_iterator_vtable = {
 715        cache_ref_iterator_advance,
 716        cache_ref_iterator_peel,
 717        cache_ref_iterator_abort
 718};
 719
 720static struct ref_iterator *cache_ref_iterator_begin(struct ref_dir *dir)
 721{
 722        struct cache_ref_iterator *iter;
 723        struct ref_iterator *ref_iterator;
 724        struct cache_ref_iterator_level *level;
 725
 726        iter = xcalloc(1, sizeof(*iter));
 727        ref_iterator = &iter->base;
 728        base_ref_iterator_init(ref_iterator, &cache_ref_iterator_vtable);
 729        ALLOC_GROW(iter->levels, 10, iter->levels_alloc);
 730
 731        iter->levels_nr = 1;
 732        level = &iter->levels[0];
 733        level->index = -1;
 734        level->dir = dir;
 735
 736        return ref_iterator;
 737}
 738
 739struct nonmatching_ref_data {
 740        const struct string_list *skip;
 741        const char *conflicting_refname;
 742};
 743
 744static int nonmatching_ref_fn(struct ref_entry *entry, void *vdata)
 745{
 746        struct nonmatching_ref_data *data = vdata;
 747
 748        if (data->skip && string_list_has_string(data->skip, entry->name))
 749                return 0;
 750
 751        data->conflicting_refname = entry->name;
 752        return 1;
 753}
 754
 755/*
 756 * Return 0 if a reference named refname could be created without
 757 * conflicting with the name of an existing reference in dir.
 758 * See verify_refname_available for more information.
 759 */
 760static int verify_refname_available_dir(const char *refname,
 761                                        const struct string_list *extras,
 762                                        const struct string_list *skip,
 763                                        struct ref_dir *dir,
 764                                        struct strbuf *err)
 765{
 766        const char *slash;
 767        const char *extra_refname;
 768        int pos;
 769        struct strbuf dirname = STRBUF_INIT;
 770        int ret = -1;
 771
 772        /*
 773         * For the sake of comments in this function, suppose that
 774         * refname is "refs/foo/bar".
 775         */
 776
 777        assert(err);
 778
 779        strbuf_grow(&dirname, strlen(refname) + 1);
 780        for (slash = strchr(refname, '/'); slash; slash = strchr(slash + 1, '/')) {
 781                /* Expand dirname to the new prefix, not including the trailing slash: */
 782                strbuf_add(&dirname, refname + dirname.len, slash - refname - dirname.len);
 783
 784                /*
 785                 * We are still at a leading dir of the refname (e.g.,
 786                 * "refs/foo"; if there is a reference with that name,
 787                 * it is a conflict, *unless* it is in skip.
 788                 */
 789                if (dir) {
 790                        pos = search_ref_dir(dir, dirname.buf, dirname.len);
 791                        if (pos >= 0 &&
 792                            (!skip || !string_list_has_string(skip, dirname.buf))) {
 793                                /*
 794                                 * We found a reference whose name is
 795                                 * a proper prefix of refname; e.g.,
 796                                 * "refs/foo", and is not in skip.
 797                                 */
 798                                strbuf_addf(err, "'%s' exists; cannot create '%s'",
 799                                            dirname.buf, refname);
 800                                goto cleanup;
 801                        }
 802                }
 803
 804                if (extras && string_list_has_string(extras, dirname.buf) &&
 805                    (!skip || !string_list_has_string(skip, dirname.buf))) {
 806                        strbuf_addf(err, "cannot process '%s' and '%s' at the same time",
 807                                    refname, dirname.buf);
 808                        goto cleanup;
 809                }
 810
 811                /*
 812                 * Otherwise, we can try to continue our search with
 813                 * the next component. So try to look up the
 814                 * directory, e.g., "refs/foo/". If we come up empty,
 815                 * we know there is nothing under this whole prefix,
 816                 * but even in that case we still have to continue the
 817                 * search for conflicts with extras.
 818                 */
 819                strbuf_addch(&dirname, '/');
 820                if (dir) {
 821                        pos = search_ref_dir(dir, dirname.buf, dirname.len);
 822                        if (pos < 0) {
 823                                /*
 824                                 * There was no directory "refs/foo/",
 825                                 * so there is nothing under this
 826                                 * whole prefix. So there is no need
 827                                 * to continue looking for conflicting
 828                                 * references. But we need to continue
 829                                 * looking for conflicting extras.
 830                                 */
 831                                dir = NULL;
 832                        } else {
 833                                dir = get_ref_dir(dir->entries[pos]);
 834                        }
 835                }
 836        }
 837
 838        /*
 839         * We are at the leaf of our refname (e.g., "refs/foo/bar").
 840         * There is no point in searching for a reference with that
 841         * name, because a refname isn't considered to conflict with
 842         * itself. But we still need to check for references whose
 843         * names are in the "refs/foo/bar/" namespace, because they
 844         * *do* conflict.
 845         */
 846        strbuf_addstr(&dirname, refname + dirname.len);
 847        strbuf_addch(&dirname, '/');
 848
 849        if (dir) {
 850                pos = search_ref_dir(dir, dirname.buf, dirname.len);
 851
 852                if (pos >= 0) {
 853                        /*
 854                         * We found a directory named "$refname/"
 855                         * (e.g., "refs/foo/bar/"). It is a problem
 856                         * iff it contains any ref that is not in
 857                         * "skip".
 858                         */
 859                        struct nonmatching_ref_data data;
 860
 861                        data.skip = skip;
 862                        data.conflicting_refname = NULL;
 863                        dir = get_ref_dir(dir->entries[pos]);
 864                        sort_ref_dir(dir);
 865                        if (do_for_each_entry_in_dir(dir, 0, nonmatching_ref_fn, &data)) {
 866                                strbuf_addf(err, "'%s' exists; cannot create '%s'",
 867                                            data.conflicting_refname, refname);
 868                                goto cleanup;
 869                        }
 870                }
 871        }
 872
 873        extra_refname = find_descendant_ref(dirname.buf, extras, skip);
 874        if (extra_refname)
 875                strbuf_addf(err, "cannot process '%s' and '%s' at the same time",
 876                            refname, extra_refname);
 877        else
 878                ret = 0;
 879
 880cleanup:
 881        strbuf_release(&dirname);
 882        return ret;
 883}
 884
 885struct packed_ref_cache {
 886        struct ref_entry *root;
 887
 888        /*
 889         * Count of references to the data structure in this instance,
 890         * including the pointer from files_ref_store::packed if any.
 891         * The data will not be freed as long as the reference count
 892         * is nonzero.
 893         */
 894        unsigned int referrers;
 895
 896        /*
 897         * Iff the packed-refs file associated with this instance is
 898         * currently locked for writing, this points at the associated
 899         * lock (which is owned by somebody else).  The referrer count
 900         * is also incremented when the file is locked and decremented
 901         * when it is unlocked.
 902         */
 903        struct lock_file *lock;
 904
 905        /* The metadata from when this packed-refs cache was read */
 906        struct stat_validity validity;
 907};
 908
 909/*
 910 * Future: need to be in "struct repository"
 911 * when doing a full libification.
 912 */
 913struct files_ref_store {
 914        struct ref_store base;
 915        struct ref_entry *loose;
 916        struct packed_ref_cache *packed;
 917};
 918
 919/* Lock used for the main packed-refs file: */
 920static struct lock_file packlock;
 921
 922/*
 923 * Increment the reference count of *packed_refs.
 924 */
 925static void acquire_packed_ref_cache(struct packed_ref_cache *packed_refs)
 926{
 927        packed_refs->referrers++;
 928}
 929
 930/*
 931 * Decrease the reference count of *packed_refs.  If it goes to zero,
 932 * free *packed_refs and return true; otherwise return false.
 933 */
 934static int release_packed_ref_cache(struct packed_ref_cache *packed_refs)
 935{
 936        if (!--packed_refs->referrers) {
 937                free_ref_entry(packed_refs->root);
 938                stat_validity_clear(&packed_refs->validity);
 939                free(packed_refs);
 940                return 1;
 941        } else {
 942                return 0;
 943        }
 944}
 945
 946static void clear_packed_ref_cache(struct files_ref_store *refs)
 947{
 948        if (refs->packed) {
 949                struct packed_ref_cache *packed_refs = refs->packed;
 950
 951                if (packed_refs->lock)
 952                        die("internal error: packed-ref cache cleared while locked");
 953                refs->packed = NULL;
 954                release_packed_ref_cache(packed_refs);
 955        }
 956}
 957
 958static void clear_loose_ref_cache(struct files_ref_store *refs)
 959{
 960        if (refs->loose) {
 961                free_ref_entry(refs->loose);
 962                refs->loose = NULL;
 963        }
 964}
 965
 966/*
 967 * Create a new submodule ref cache and add it to the internal
 968 * set of caches.
 969 */
 970static struct ref_store *files_ref_store_create(const char *submodule)
 971{
 972        struct files_ref_store *refs = xcalloc(1, sizeof(*refs));
 973        struct ref_store *ref_store = (struct ref_store *)refs;
 974
 975        base_ref_store_init(ref_store, &refs_be_files, submodule);
 976
 977        return ref_store;
 978}
 979
 980/*
 981 * Downcast ref_store to files_ref_store. Die if ref_store is not a
 982 * files_ref_store. If submodule_allowed is not true, then also die if
 983 * files_ref_store is for a submodule (i.e., not for the main
 984 * repository). caller is used in any necessary error messages.
 985 */
 986static struct files_ref_store *files_downcast(
 987                struct ref_store *ref_store, int submodule_allowed,
 988                const char *caller)
 989{
 990        if (ref_store->be != &refs_be_files)
 991                die("BUG: ref_store is type \"%s\" not \"files\" in %s",
 992                    ref_store->be->name, caller);
 993
 994        if (!submodule_allowed)
 995                assert_main_repository(ref_store, caller);
 996
 997        return (struct files_ref_store *)ref_store;
 998}
 999
1000/*
1001 * Return a pointer to the reference store for the specified
1002 * submodule. For the main repository, use submodule==NULL; such a
1003 * call cannot fail. For a submodule, the submodule must exist and be
1004 * a nonbare repository, otherwise return NULL. Verify that the
1005 * reference store is a files_ref_store, and cast it to that type
1006 * before returning it.
1007 */
1008static struct files_ref_store *get_files_ref_store(const char *submodule,
1009                                                   const char *caller)
1010{
1011        struct ref_store *refs = get_ref_store(submodule);
1012
1013        return refs ? files_downcast(refs, 1, caller) : NULL;
1014}
1015
1016/* The length of a peeled reference line in packed-refs, including EOL: */
1017#define PEELED_LINE_LENGTH 42
1018
1019/*
1020 * The packed-refs header line that we write out.  Perhaps other
1021 * traits will be added later.  The trailing space is required.
1022 */
1023static const char PACKED_REFS_HEADER[] =
1024        "# pack-refs with: peeled fully-peeled \n";
1025
1026/*
1027 * Parse one line from a packed-refs file.  Write the SHA1 to sha1.
1028 * Return a pointer to the refname within the line (null-terminated),
1029 * or NULL if there was a problem.
1030 */
1031static const char *parse_ref_line(struct strbuf *line, unsigned char *sha1)
1032{
1033        const char *ref;
1034
1035        /*
1036         * 42: the answer to everything.
1037         *
1038         * In this case, it happens to be the answer to
1039         *  40 (length of sha1 hex representation)
1040         *  +1 (space in between hex and name)
1041         *  +1 (newline at the end of the line)
1042         */
1043        if (line->len <= 42)
1044                return NULL;
1045
1046        if (get_sha1_hex(line->buf, sha1) < 0)
1047                return NULL;
1048        if (!isspace(line->buf[40]))
1049                return NULL;
1050
1051        ref = line->buf + 41;
1052        if (isspace(*ref))
1053                return NULL;
1054
1055        if (line->buf[line->len - 1] != '\n')
1056                return NULL;
1057        line->buf[--line->len] = 0;
1058
1059        return ref;
1060}
1061
1062/*
1063 * Read f, which is a packed-refs file, into dir.
1064 *
1065 * A comment line of the form "# pack-refs with: " may contain zero or
1066 * more traits. We interpret the traits as follows:
1067 *
1068 *   No traits:
1069 *
1070 *      Probably no references are peeled. But if the file contains a
1071 *      peeled value for a reference, we will use it.
1072 *
1073 *   peeled:
1074 *
1075 *      References under "refs/tags/", if they *can* be peeled, *are*
1076 *      peeled in this file. References outside of "refs/tags/" are
1077 *      probably not peeled even if they could have been, but if we find
1078 *      a peeled value for such a reference we will use it.
1079 *
1080 *   fully-peeled:
1081 *
1082 *      All references in the file that can be peeled are peeled.
1083 *      Inversely (and this is more important), any references in the
1084 *      file for which no peeled value is recorded is not peelable. This
1085 *      trait should typically be written alongside "peeled" for
1086 *      compatibility with older clients, but we do not require it
1087 *      (i.e., "peeled" is a no-op if "fully-peeled" is set).
1088 */
1089static void read_packed_refs(FILE *f, struct ref_dir *dir)
1090{
1091        struct ref_entry *last = NULL;
1092        struct strbuf line = STRBUF_INIT;
1093        enum { PEELED_NONE, PEELED_TAGS, PEELED_FULLY } peeled = PEELED_NONE;
1094
1095        while (strbuf_getwholeline(&line, f, '\n') != EOF) {
1096                unsigned char sha1[20];
1097                const char *refname;
1098                const char *traits;
1099
1100                if (skip_prefix(line.buf, "# pack-refs with:", &traits)) {
1101                        if (strstr(traits, " fully-peeled "))
1102                                peeled = PEELED_FULLY;
1103                        else if (strstr(traits, " peeled "))
1104                                peeled = PEELED_TAGS;
1105                        /* perhaps other traits later as well */
1106                        continue;
1107                }
1108
1109                refname = parse_ref_line(&line, sha1);
1110                if (refname) {
1111                        int flag = REF_ISPACKED;
1112
1113                        if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {
1114                                if (!refname_is_safe(refname))
1115                                        die("packed refname is dangerous: %s", refname);
1116                                hashclr(sha1);
1117                                flag |= REF_BAD_NAME | REF_ISBROKEN;
1118                        }
1119                        last = create_ref_entry(refname, sha1, flag, 0);
1120                        if (peeled == PEELED_FULLY ||
1121                            (peeled == PEELED_TAGS && starts_with(refname, "refs/tags/")))
1122                                last->flag |= REF_KNOWS_PEELED;
1123                        add_ref(dir, last);
1124                        continue;
1125                }
1126                if (last &&
1127                    line.buf[0] == '^' &&
1128                    line.len == PEELED_LINE_LENGTH &&
1129                    line.buf[PEELED_LINE_LENGTH - 1] == '\n' &&
1130                    !get_sha1_hex(line.buf + 1, sha1)) {
1131                        hashcpy(last->u.value.peeled.hash, sha1);
1132                        /*
1133                         * Regardless of what the file header said,
1134                         * we definitely know the value of *this*
1135                         * reference:
1136                         */
1137                        last->flag |= REF_KNOWS_PEELED;
1138                }
1139        }
1140
1141        strbuf_release(&line);
1142}
1143
1144/*
1145 * Get the packed_ref_cache for the specified files_ref_store,
1146 * creating it if necessary.
1147 */
1148static struct packed_ref_cache *get_packed_ref_cache(struct files_ref_store *refs)
1149{
1150        char *packed_refs_file;
1151
1152        if (*refs->base.submodule)
1153                packed_refs_file = git_pathdup_submodule(refs->base.submodule,
1154                                                         "packed-refs");
1155        else
1156                packed_refs_file = git_pathdup("packed-refs");
1157
1158        if (refs->packed &&
1159            !stat_validity_check(&refs->packed->validity, packed_refs_file))
1160                clear_packed_ref_cache(refs);
1161
1162        if (!refs->packed) {
1163                FILE *f;
1164
1165                refs->packed = xcalloc(1, sizeof(*refs->packed));
1166                acquire_packed_ref_cache(refs->packed);
1167                refs->packed->root = create_dir_entry(refs, "", 0, 0);
1168                f = fopen(packed_refs_file, "r");
1169                if (f) {
1170                        stat_validity_update(&refs->packed->validity, fileno(f));
1171                        read_packed_refs(f, get_ref_dir(refs->packed->root));
1172                        fclose(f);
1173                }
1174        }
1175        free(packed_refs_file);
1176        return refs->packed;
1177}
1178
1179static struct ref_dir *get_packed_ref_dir(struct packed_ref_cache *packed_ref_cache)
1180{
1181        return get_ref_dir(packed_ref_cache->root);
1182}
1183
1184static struct ref_dir *get_packed_refs(struct files_ref_store *refs)
1185{
1186        return get_packed_ref_dir(get_packed_ref_cache(refs));
1187}
1188
1189/*
1190 * Add a reference to the in-memory packed reference cache.  This may
1191 * only be called while the packed-refs file is locked (see
1192 * lock_packed_refs()).  To actually write the packed-refs file, call
1193 * commit_packed_refs().
1194 */
1195static void add_packed_ref(struct files_ref_store *refs,
1196                           const char *refname, const unsigned char *sha1)
1197{
1198        struct packed_ref_cache *packed_ref_cache = get_packed_ref_cache(refs);
1199
1200        if (!packed_ref_cache->lock)
1201                die("internal error: packed refs not locked");
1202        add_ref(get_packed_ref_dir(packed_ref_cache),
1203                create_ref_entry(refname, sha1, REF_ISPACKED, 1));
1204}
1205
1206/*
1207 * Read the loose references from the namespace dirname into dir
1208 * (without recursing).  dirname must end with '/'.  dir must be the
1209 * directory entry corresponding to dirname.
1210 */
1211static void read_loose_refs(const char *dirname, struct ref_dir *dir)
1212{
1213        struct files_ref_store *refs = dir->ref_store;
1214        DIR *d;
1215        struct dirent *de;
1216        int dirnamelen = strlen(dirname);
1217        struct strbuf refname;
1218        struct strbuf path = STRBUF_INIT;
1219        size_t path_baselen;
1220
1221        if (*refs->base.submodule)
1222                strbuf_git_path_submodule(&path, refs->base.submodule, "%s", dirname);
1223        else
1224                strbuf_git_path(&path, "%s", dirname);
1225        path_baselen = path.len;
1226
1227        d = opendir(path.buf);
1228        if (!d) {
1229                strbuf_release(&path);
1230                return;
1231        }
1232
1233        strbuf_init(&refname, dirnamelen + 257);
1234        strbuf_add(&refname, dirname, dirnamelen);
1235
1236        while ((de = readdir(d)) != NULL) {
1237                unsigned char sha1[20];
1238                struct stat st;
1239                int flag;
1240
1241                if (de->d_name[0] == '.')
1242                        continue;
1243                if (ends_with(de->d_name, ".lock"))
1244                        continue;
1245                strbuf_addstr(&refname, de->d_name);
1246                strbuf_addstr(&path, de->d_name);
1247                if (stat(path.buf, &st) < 0) {
1248                        ; /* silently ignore */
1249                } else if (S_ISDIR(st.st_mode)) {
1250                        strbuf_addch(&refname, '/');
1251                        add_entry_to_dir(dir,
1252                                         create_dir_entry(refs, refname.buf,
1253                                                          refname.len, 1));
1254                } else {
1255                        int read_ok;
1256
1257                        if (*refs->base.submodule) {
1258                                hashclr(sha1);
1259                                flag = 0;
1260                                read_ok = !resolve_gitlink_ref(refs->base.submodule,
1261                                                               refname.buf, sha1);
1262                        } else {
1263                                read_ok = !read_ref_full(refname.buf,
1264                                                         RESOLVE_REF_READING,
1265                                                         sha1, &flag);
1266                        }
1267
1268                        if (!read_ok) {
1269                                hashclr(sha1);
1270                                flag |= REF_ISBROKEN;
1271                        } else if (is_null_sha1(sha1)) {
1272                                /*
1273                                 * It is so astronomically unlikely
1274                                 * that NULL_SHA1 is the SHA-1 of an
1275                                 * actual object that we consider its
1276                                 * appearance in a loose reference
1277                                 * file to be repo corruption
1278                                 * (probably due to a software bug).
1279                                 */
1280                                flag |= REF_ISBROKEN;
1281                        }
1282
1283                        if (check_refname_format(refname.buf,
1284                                                 REFNAME_ALLOW_ONELEVEL)) {
1285                                if (!refname_is_safe(refname.buf))
1286                                        die("loose refname is dangerous: %s", refname.buf);
1287                                hashclr(sha1);
1288                                flag |= REF_BAD_NAME | REF_ISBROKEN;
1289                        }
1290                        add_entry_to_dir(dir,
1291                                         create_ref_entry(refname.buf, sha1, flag, 0));
1292                }
1293                strbuf_setlen(&refname, dirnamelen);
1294                strbuf_setlen(&path, path_baselen);
1295        }
1296        strbuf_release(&refname);
1297        strbuf_release(&path);
1298        closedir(d);
1299}
1300
1301static struct ref_dir *get_loose_refs(struct files_ref_store *refs)
1302{
1303        if (!refs->loose) {
1304                /*
1305                 * Mark the top-level directory complete because we
1306                 * are about to read the only subdirectory that can
1307                 * hold references:
1308                 */
1309                refs->loose = create_dir_entry(refs, "", 0, 0);
1310                /*
1311                 * Create an incomplete entry for "refs/":
1312                 */
1313                add_entry_to_dir(get_ref_dir(refs->loose),
1314                                 create_dir_entry(refs, "refs/", 5, 1));
1315        }
1316        return get_ref_dir(refs->loose);
1317}
1318
1319/*
1320 * Return the ref_entry for the given refname from the packed
1321 * references.  If it does not exist, return NULL.
1322 */
1323static struct ref_entry *get_packed_ref(struct files_ref_store *refs,
1324                                        const char *refname)
1325{
1326        return find_ref(get_packed_refs(refs), refname);
1327}
1328
1329/*
1330 * A loose ref file doesn't exist; check for a packed ref.
1331 */
1332static int resolve_packed_ref(struct files_ref_store *refs,
1333                              const char *refname,
1334                              unsigned char *sha1, unsigned int *flags)
1335{
1336        struct ref_entry *entry;
1337
1338        /*
1339         * The loose reference file does not exist; check for a packed
1340         * reference.
1341         */
1342        entry = get_packed_ref(refs, refname);
1343        if (entry) {
1344                hashcpy(sha1, entry->u.value.oid.hash);
1345                *flags |= REF_ISPACKED;
1346                return 0;
1347        }
1348        /* refname is not a packed reference. */
1349        return -1;
1350}
1351
1352static int files_read_raw_ref(struct ref_store *ref_store,
1353                              const char *refname, unsigned char *sha1,
1354                              struct strbuf *referent, unsigned int *type)
1355{
1356        struct files_ref_store *refs =
1357                files_downcast(ref_store, 1, "read_raw_ref");
1358        struct strbuf sb_contents = STRBUF_INIT;
1359        struct strbuf sb_path = STRBUF_INIT;
1360        const char *path;
1361        const char *buf;
1362        struct stat st;
1363        int fd;
1364        int ret = -1;
1365        int save_errno;
1366
1367        *type = 0;
1368        strbuf_reset(&sb_path);
1369
1370        if (*refs->base.submodule)
1371                strbuf_git_path_submodule(&sb_path, refs->base.submodule, "%s", refname);
1372        else
1373                strbuf_git_path(&sb_path, "%s", refname);
1374
1375        path = sb_path.buf;
1376
1377stat_ref:
1378        /*
1379         * We might have to loop back here to avoid a race
1380         * condition: first we lstat() the file, then we try
1381         * to read it as a link or as a file.  But if somebody
1382         * changes the type of the file (file <-> directory
1383         * <-> symlink) between the lstat() and reading, then
1384         * we don't want to report that as an error but rather
1385         * try again starting with the lstat().
1386         */
1387
1388        if (lstat(path, &st) < 0) {
1389                if (errno != ENOENT)
1390                        goto out;
1391                if (resolve_packed_ref(refs, refname, sha1, type)) {
1392                        errno = ENOENT;
1393                        goto out;
1394                }
1395                ret = 0;
1396                goto out;
1397        }
1398
1399        /* Follow "normalized" - ie "refs/.." symlinks by hand */
1400        if (S_ISLNK(st.st_mode)) {
1401                strbuf_reset(&sb_contents);
1402                if (strbuf_readlink(&sb_contents, path, 0) < 0) {
1403                        if (errno == ENOENT || errno == EINVAL)
1404                                /* inconsistent with lstat; retry */
1405                                goto stat_ref;
1406                        else
1407                                goto out;
1408                }
1409                if (starts_with(sb_contents.buf, "refs/") &&
1410                    !check_refname_format(sb_contents.buf, 0)) {
1411                        strbuf_swap(&sb_contents, referent);
1412                        *type |= REF_ISSYMREF;
1413                        ret = 0;
1414                        goto out;
1415                }
1416        }
1417
1418        /* Is it a directory? */
1419        if (S_ISDIR(st.st_mode)) {
1420                /*
1421                 * Even though there is a directory where the loose
1422                 * ref is supposed to be, there could still be a
1423                 * packed ref:
1424                 */
1425                if (resolve_packed_ref(refs, refname, sha1, type)) {
1426                        errno = EISDIR;
1427                        goto out;
1428                }
1429                ret = 0;
1430                goto out;
1431        }
1432
1433        /*
1434         * Anything else, just open it and try to use it as
1435         * a ref
1436         */
1437        fd = open(path, O_RDONLY);
1438        if (fd < 0) {
1439                if (errno == ENOENT)
1440                        /* inconsistent with lstat; retry */
1441                        goto stat_ref;
1442                else
1443                        goto out;
1444        }
1445        strbuf_reset(&sb_contents);
1446        if (strbuf_read(&sb_contents, fd, 256) < 0) {
1447                int save_errno = errno;
1448                close(fd);
1449                errno = save_errno;
1450                goto out;
1451        }
1452        close(fd);
1453        strbuf_rtrim(&sb_contents);
1454        buf = sb_contents.buf;
1455        if (starts_with(buf, "ref:")) {
1456                buf += 4;
1457                while (isspace(*buf))
1458                        buf++;
1459
1460                strbuf_reset(referent);
1461                strbuf_addstr(referent, buf);
1462                *type |= REF_ISSYMREF;
1463                ret = 0;
1464                goto out;
1465        }
1466
1467        /*
1468         * Please note that FETCH_HEAD has additional
1469         * data after the sha.
1470         */
1471        if (get_sha1_hex(buf, sha1) ||
1472            (buf[40] != '\0' && !isspace(buf[40]))) {
1473                *type |= REF_ISBROKEN;
1474                errno = EINVAL;
1475                goto out;
1476        }
1477
1478        ret = 0;
1479
1480out:
1481        save_errno = errno;
1482        strbuf_release(&sb_path);
1483        strbuf_release(&sb_contents);
1484        errno = save_errno;
1485        return ret;
1486}
1487
1488static void unlock_ref(struct ref_lock *lock)
1489{
1490        /* Do not free lock->lk -- atexit() still looks at them */
1491        if (lock->lk)
1492                rollback_lock_file(lock->lk);
1493        free(lock->ref_name);
1494        free(lock);
1495}
1496
1497/*
1498 * Lock refname, without following symrefs, and set *lock_p to point
1499 * at a newly-allocated lock object. Fill in lock->old_oid, referent,
1500 * and type similarly to read_raw_ref().
1501 *
1502 * The caller must verify that refname is a "safe" reference name (in
1503 * the sense of refname_is_safe()) before calling this function.
1504 *
1505 * If the reference doesn't already exist, verify that refname doesn't
1506 * have a D/F conflict with any existing references. extras and skip
1507 * are passed to verify_refname_available_dir() for this check.
1508 *
1509 * If mustexist is not set and the reference is not found or is
1510 * broken, lock the reference anyway but clear sha1.
1511 *
1512 * Return 0 on success. On failure, write an error message to err and
1513 * return TRANSACTION_NAME_CONFLICT or TRANSACTION_GENERIC_ERROR.
1514 *
1515 * Implementation note: This function is basically
1516 *
1517 *     lock reference
1518 *     read_raw_ref()
1519 *
1520 * but it includes a lot more code to
1521 * - Deal with possible races with other processes
1522 * - Avoid calling verify_refname_available_dir() when it can be
1523 *   avoided, namely if we were successfully able to read the ref
1524 * - Generate informative error messages in the case of failure
1525 */
1526static int lock_raw_ref(const char *refname, int mustexist,
1527                        const struct string_list *extras,
1528                        const struct string_list *skip,
1529                        struct ref_lock **lock_p,
1530                        struct strbuf *referent,
1531                        unsigned int *type,
1532                        struct strbuf *err)
1533{
1534        struct ref_store *ref_store = get_ref_store(NULL);
1535        struct files_ref_store *refs =
1536                files_downcast(ref_store, 0, "lock_raw_ref");
1537        struct ref_lock *lock;
1538        struct strbuf ref_file = STRBUF_INIT;
1539        int attempts_remaining = 3;
1540        int ret = TRANSACTION_GENERIC_ERROR;
1541
1542        assert(err);
1543        *type = 0;
1544
1545        /* First lock the file so it can't change out from under us. */
1546
1547        *lock_p = lock = xcalloc(1, sizeof(*lock));
1548
1549        lock->ref_name = xstrdup(refname);
1550        strbuf_git_path(&ref_file, "%s", refname);
1551
1552retry:
1553        switch (safe_create_leading_directories(ref_file.buf)) {
1554        case SCLD_OK:
1555                break; /* success */
1556        case SCLD_EXISTS:
1557                /*
1558                 * Suppose refname is "refs/foo/bar". We just failed
1559                 * to create the containing directory, "refs/foo",
1560                 * because there was a non-directory in the way. This
1561                 * indicates a D/F conflict, probably because of
1562                 * another reference such as "refs/foo". There is no
1563                 * reason to expect this error to be transitory.
1564                 */
1565                if (verify_refname_available(refname, extras, skip, err)) {
1566                        if (mustexist) {
1567                                /*
1568                                 * To the user the relevant error is
1569                                 * that the "mustexist" reference is
1570                                 * missing:
1571                                 */
1572                                strbuf_reset(err);
1573                                strbuf_addf(err, "unable to resolve reference '%s'",
1574                                            refname);
1575                        } else {
1576                                /*
1577                                 * The error message set by
1578                                 * verify_refname_available_dir() is OK.
1579                                 */
1580                                ret = TRANSACTION_NAME_CONFLICT;
1581                        }
1582                } else {
1583                        /*
1584                         * The file that is in the way isn't a loose
1585                         * reference. Report it as a low-level
1586                         * failure.
1587                         */
1588                        strbuf_addf(err, "unable to create lock file %s.lock; "
1589                                    "non-directory in the way",
1590                                    ref_file.buf);
1591                }
1592                goto error_return;
1593        case SCLD_VANISHED:
1594                /* Maybe another process was tidying up. Try again. */
1595                if (--attempts_remaining > 0)
1596                        goto retry;
1597                /* fall through */
1598        default:
1599                strbuf_addf(err, "unable to create directory for %s",
1600                            ref_file.buf);
1601                goto error_return;
1602        }
1603
1604        if (!lock->lk)
1605                lock->lk = xcalloc(1, sizeof(struct lock_file));
1606
1607        if (hold_lock_file_for_update(lock->lk, ref_file.buf, LOCK_NO_DEREF) < 0) {
1608                if (errno == ENOENT && --attempts_remaining > 0) {
1609                        /*
1610                         * Maybe somebody just deleted one of the
1611                         * directories leading to ref_file.  Try
1612                         * again:
1613                         */
1614                        goto retry;
1615                } else {
1616                        unable_to_lock_message(ref_file.buf, errno, err);
1617                        goto error_return;
1618                }
1619        }
1620
1621        /*
1622         * Now we hold the lock and can read the reference without
1623         * fear that its value will change.
1624         */
1625
1626        if (files_read_raw_ref(ref_store, refname,
1627                               lock->old_oid.hash, referent, type)) {
1628                if (errno == ENOENT) {
1629                        if (mustexist) {
1630                                /* Garden variety missing reference. */
1631                                strbuf_addf(err, "unable to resolve reference '%s'",
1632                                            refname);
1633                                goto error_return;
1634                        } else {
1635                                /*
1636                                 * Reference is missing, but that's OK. We
1637                                 * know that there is not a conflict with
1638                                 * another loose reference because
1639                                 * (supposing that we are trying to lock
1640                                 * reference "refs/foo/bar"):
1641                                 *
1642                                 * - We were successfully able to create
1643                                 *   the lockfile refs/foo/bar.lock, so we
1644                                 *   know there cannot be a loose reference
1645                                 *   named "refs/foo".
1646                                 *
1647                                 * - We got ENOENT and not EISDIR, so we
1648                                 *   know that there cannot be a loose
1649                                 *   reference named "refs/foo/bar/baz".
1650                                 */
1651                        }
1652                } else if (errno == EISDIR) {
1653                        /*
1654                         * There is a directory in the way. It might have
1655                         * contained references that have been deleted. If
1656                         * we don't require that the reference already
1657                         * exists, try to remove the directory so that it
1658                         * doesn't cause trouble when we want to rename the
1659                         * lockfile into place later.
1660                         */
1661                        if (mustexist) {
1662                                /* Garden variety missing reference. */
1663                                strbuf_addf(err, "unable to resolve reference '%s'",
1664                                            refname);
1665                                goto error_return;
1666                        } else if (remove_dir_recursively(&ref_file,
1667                                                          REMOVE_DIR_EMPTY_ONLY)) {
1668                                if (verify_refname_available_dir(
1669                                                    refname, extras, skip,
1670                                                    get_loose_refs(refs),
1671                                                    err)) {
1672                                        /*
1673                                         * The error message set by
1674                                         * verify_refname_available() is OK.
1675                                         */
1676                                        ret = TRANSACTION_NAME_CONFLICT;
1677                                        goto error_return;
1678                                } else {
1679                                        /*
1680                                         * We can't delete the directory,
1681                                         * but we also don't know of any
1682                                         * references that it should
1683                                         * contain.
1684                                         */
1685                                        strbuf_addf(err, "there is a non-empty directory '%s' "
1686                                                    "blocking reference '%s'",
1687                                                    ref_file.buf, refname);
1688                                        goto error_return;
1689                                }
1690                        }
1691                } else if (errno == EINVAL && (*type & REF_ISBROKEN)) {
1692                        strbuf_addf(err, "unable to resolve reference '%s': "
1693                                    "reference broken", refname);
1694                        goto error_return;
1695                } else {
1696                        strbuf_addf(err, "unable to resolve reference '%s': %s",
1697                                    refname, strerror(errno));
1698                        goto error_return;
1699                }
1700
1701                /*
1702                 * If the ref did not exist and we are creating it,
1703                 * make sure there is no existing packed ref whose
1704                 * name begins with our refname, nor a packed ref
1705                 * whose name is a proper prefix of our refname.
1706                 */
1707                if (verify_refname_available_dir(
1708                                    refname, extras, skip,
1709                                    get_packed_refs(refs),
1710                                    err)) {
1711                        goto error_return;
1712                }
1713        }
1714
1715        ret = 0;
1716        goto out;
1717
1718error_return:
1719        unlock_ref(lock);
1720        *lock_p = NULL;
1721
1722out:
1723        strbuf_release(&ref_file);
1724        return ret;
1725}
1726
1727/*
1728 * Peel the entry (if possible) and return its new peel_status.  If
1729 * repeel is true, re-peel the entry even if there is an old peeled
1730 * value that is already stored in it.
1731 *
1732 * It is OK to call this function with a packed reference entry that
1733 * might be stale and might even refer to an object that has since
1734 * been garbage-collected.  In such a case, if the entry has
1735 * REF_KNOWS_PEELED then leave the status unchanged and return
1736 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.
1737 */
1738static enum peel_status peel_entry(struct ref_entry *entry, int repeel)
1739{
1740        enum peel_status status;
1741
1742        if (entry->flag & REF_KNOWS_PEELED) {
1743                if (repeel) {
1744                        entry->flag &= ~REF_KNOWS_PEELED;
1745                        oidclr(&entry->u.value.peeled);
1746                } else {
1747                        return is_null_oid(&entry->u.value.peeled) ?
1748                                PEEL_NON_TAG : PEEL_PEELED;
1749                }
1750        }
1751        if (entry->flag & REF_ISBROKEN)
1752                return PEEL_BROKEN;
1753        if (entry->flag & REF_ISSYMREF)
1754                return PEEL_IS_SYMREF;
1755
1756        status = peel_object(entry->u.value.oid.hash, entry->u.value.peeled.hash);
1757        if (status == PEEL_PEELED || status == PEEL_NON_TAG)
1758                entry->flag |= REF_KNOWS_PEELED;
1759        return status;
1760}
1761
1762static int files_peel_ref(struct ref_store *ref_store,
1763                          const char *refname, unsigned char *sha1)
1764{
1765        struct files_ref_store *refs = files_downcast(ref_store, 0, "peel_ref");
1766        int flag;
1767        unsigned char base[20];
1768
1769        if (current_ref_iter && current_ref_iter->refname == refname) {
1770                struct object_id peeled;
1771
1772                if (ref_iterator_peel(current_ref_iter, &peeled))
1773                        return -1;
1774                hashcpy(sha1, peeled.hash);
1775                return 0;
1776        }
1777
1778        if (read_ref_full(refname, RESOLVE_REF_READING, base, &flag))
1779                return -1;
1780
1781        /*
1782         * If the reference is packed, read its ref_entry from the
1783         * cache in the hope that we already know its peeled value.
1784         * We only try this optimization on packed references because
1785         * (a) forcing the filling of the loose reference cache could
1786         * be expensive and (b) loose references anyway usually do not
1787         * have REF_KNOWS_PEELED.
1788         */
1789        if (flag & REF_ISPACKED) {
1790                struct ref_entry *r = get_packed_ref(refs, refname);
1791                if (r) {
1792                        if (peel_entry(r, 0))
1793                                return -1;
1794                        hashcpy(sha1, r->u.value.peeled.hash);
1795                        return 0;
1796                }
1797        }
1798
1799        return peel_object(base, sha1);
1800}
1801
1802struct files_ref_iterator {
1803        struct ref_iterator base;
1804
1805        struct packed_ref_cache *packed_ref_cache;
1806        struct ref_iterator *iter0;
1807        unsigned int flags;
1808};
1809
1810static int files_ref_iterator_advance(struct ref_iterator *ref_iterator)
1811{
1812        struct files_ref_iterator *iter =
1813                (struct files_ref_iterator *)ref_iterator;
1814        int ok;
1815
1816        while ((ok = ref_iterator_advance(iter->iter0)) == ITER_OK) {
1817                if (!(iter->flags & DO_FOR_EACH_INCLUDE_BROKEN) &&
1818                    !ref_resolves_to_object(iter->iter0->refname,
1819                                            iter->iter0->oid,
1820                                            iter->iter0->flags))
1821                        continue;
1822
1823                iter->base.refname = iter->iter0->refname;
1824                iter->base.oid = iter->iter0->oid;
1825                iter->base.flags = iter->iter0->flags;
1826                return ITER_OK;
1827        }
1828
1829        iter->iter0 = NULL;
1830        if (ref_iterator_abort(ref_iterator) != ITER_DONE)
1831                ok = ITER_ERROR;
1832
1833        return ok;
1834}
1835
1836static int files_ref_iterator_peel(struct ref_iterator *ref_iterator,
1837                                   struct object_id *peeled)
1838{
1839        struct files_ref_iterator *iter =
1840                (struct files_ref_iterator *)ref_iterator;
1841
1842        return ref_iterator_peel(iter->iter0, peeled);
1843}
1844
1845static int files_ref_iterator_abort(struct ref_iterator *ref_iterator)
1846{
1847        struct files_ref_iterator *iter =
1848                (struct files_ref_iterator *)ref_iterator;
1849        int ok = ITER_DONE;
1850
1851        if (iter->iter0)
1852                ok = ref_iterator_abort(iter->iter0);
1853
1854        release_packed_ref_cache(iter->packed_ref_cache);
1855        base_ref_iterator_free(ref_iterator);
1856        return ok;
1857}
1858
1859static struct ref_iterator_vtable files_ref_iterator_vtable = {
1860        files_ref_iterator_advance,
1861        files_ref_iterator_peel,
1862        files_ref_iterator_abort
1863};
1864
1865struct ref_iterator *files_ref_iterator_begin(
1866                const char *submodule,
1867                const char *prefix, unsigned int flags)
1868{
1869        struct files_ref_store *refs =
1870                get_files_ref_store(submodule, "ref_iterator_begin");
1871        struct ref_dir *loose_dir, *packed_dir;
1872        struct ref_iterator *loose_iter, *packed_iter;
1873        struct files_ref_iterator *iter;
1874        struct ref_iterator *ref_iterator;
1875
1876        if (!refs)
1877                return empty_ref_iterator_begin();
1878
1879        if (ref_paranoia < 0)
1880                ref_paranoia = git_env_bool("GIT_REF_PARANOIA", 0);
1881        if (ref_paranoia)
1882                flags |= DO_FOR_EACH_INCLUDE_BROKEN;
1883
1884        iter = xcalloc(1, sizeof(*iter));
1885        ref_iterator = &iter->base;
1886        base_ref_iterator_init(ref_iterator, &files_ref_iterator_vtable);
1887
1888        /*
1889         * We must make sure that all loose refs are read before
1890         * accessing the packed-refs file; this avoids a race
1891         * condition if loose refs are migrated to the packed-refs
1892         * file by a simultaneous process, but our in-memory view is
1893         * from before the migration. We ensure this as follows:
1894         * First, we call prime_ref_dir(), which pre-reads the loose
1895         * references for the subtree into the cache. (If they've
1896         * already been read, that's OK; we only need to guarantee
1897         * that they're read before the packed refs, not *how much*
1898         * before.) After that, we call get_packed_ref_cache(), which
1899         * internally checks whether the packed-ref cache is up to
1900         * date with what is on disk, and re-reads it if not.
1901         */
1902
1903        loose_dir = get_loose_refs(refs);
1904
1905        if (prefix && *prefix)
1906                loose_dir = find_containing_dir(loose_dir, prefix, 0);
1907
1908        if (loose_dir) {
1909                prime_ref_dir(loose_dir);
1910                loose_iter = cache_ref_iterator_begin(loose_dir);
1911        } else {
1912                /* There's nothing to iterate over. */
1913                loose_iter = empty_ref_iterator_begin();
1914        }
1915
1916        iter->packed_ref_cache = get_packed_ref_cache(refs);
1917        acquire_packed_ref_cache(iter->packed_ref_cache);
1918        packed_dir = get_packed_ref_dir(iter->packed_ref_cache);
1919
1920        if (prefix && *prefix)
1921                packed_dir = find_containing_dir(packed_dir, prefix, 0);
1922
1923        if (packed_dir) {
1924                packed_iter = cache_ref_iterator_begin(packed_dir);
1925        } else {
1926                /* There's nothing to iterate over. */
1927                packed_iter = empty_ref_iterator_begin();
1928        }
1929
1930        iter->iter0 = overlay_ref_iterator_begin(loose_iter, packed_iter);
1931        iter->flags = flags;
1932
1933        return ref_iterator;
1934}
1935
1936/*
1937 * Verify that the reference locked by lock has the value old_sha1.
1938 * Fail if the reference doesn't exist and mustexist is set. Return 0
1939 * on success. On error, write an error message to err, set errno, and
1940 * return a negative value.
1941 */
1942static int verify_lock(struct ref_lock *lock,
1943                       const unsigned char *old_sha1, int mustexist,
1944                       struct strbuf *err)
1945{
1946        assert(err);
1947
1948        if (read_ref_full(lock->ref_name,
1949                          mustexist ? RESOLVE_REF_READING : 0,
1950                          lock->old_oid.hash, NULL)) {
1951                if (old_sha1) {
1952                        int save_errno = errno;
1953                        strbuf_addf(err, "can't verify ref '%s'", lock->ref_name);
1954                        errno = save_errno;
1955                        return -1;
1956                } else {
1957                        hashclr(lock->old_oid.hash);
1958                        return 0;
1959                }
1960        }
1961        if (old_sha1 && hashcmp(lock->old_oid.hash, old_sha1)) {
1962                strbuf_addf(err, "ref '%s' is at %s but expected %s",
1963                            lock->ref_name,
1964                            sha1_to_hex(lock->old_oid.hash),
1965                            sha1_to_hex(old_sha1));
1966                errno = EBUSY;
1967                return -1;
1968        }
1969        return 0;
1970}
1971
1972static int remove_empty_directories(struct strbuf *path)
1973{
1974        /*
1975         * we want to create a file but there is a directory there;
1976         * if that is an empty directory (or a directory that contains
1977         * only empty directories), remove them.
1978         */
1979        return remove_dir_recursively(path, REMOVE_DIR_EMPTY_ONLY);
1980}
1981
1982/*
1983 * Locks a ref returning the lock on success and NULL on failure.
1984 * On failure errno is set to something meaningful.
1985 */
1986static struct ref_lock *lock_ref_sha1_basic(const char *refname,
1987                                            const unsigned char *old_sha1,
1988                                            const struct string_list *extras,
1989                                            const struct string_list *skip,
1990                                            unsigned int flags, int *type,
1991                                            struct strbuf *err)
1992{
1993        struct files_ref_store *refs =
1994                get_files_ref_store(NULL, "lock_ref_sha1_basic");
1995        struct strbuf ref_file = STRBUF_INIT;
1996        struct ref_lock *lock;
1997        int last_errno = 0;
1998        int lflags = LOCK_NO_DEREF;
1999        int mustexist = (old_sha1 && !is_null_sha1(old_sha1));
2000        int resolve_flags = RESOLVE_REF_NO_RECURSE;
2001        int attempts_remaining = 3;
2002        int resolved;
2003
2004        assert(err);
2005
2006        lock = xcalloc(1, sizeof(struct ref_lock));
2007
2008        if (mustexist)
2009                resolve_flags |= RESOLVE_REF_READING;
2010        if (flags & REF_DELETING)
2011                resolve_flags |= RESOLVE_REF_ALLOW_BAD_NAME;
2012
2013        strbuf_git_path(&ref_file, "%s", refname);
2014        resolved = !!resolve_ref_unsafe(refname, resolve_flags,
2015                                        lock->old_oid.hash, type);
2016        if (!resolved && errno == EISDIR) {
2017                /*
2018                 * we are trying to lock foo but we used to
2019                 * have foo/bar which now does not exist;
2020                 * it is normal for the empty directory 'foo'
2021                 * to remain.
2022                 */
2023                if (remove_empty_directories(&ref_file)) {
2024                        last_errno = errno;
2025                        if (!verify_refname_available_dir(
2026                                            refname, extras, skip,
2027                                            get_loose_refs(refs), err))
2028                                strbuf_addf(err, "there are still refs under '%s'",
2029                                            refname);
2030                        goto error_return;
2031                }
2032                resolved = !!resolve_ref_unsafe(refname, resolve_flags,
2033                                                lock->old_oid.hash, type);
2034        }
2035        if (!resolved) {
2036                last_errno = errno;
2037                if (last_errno != ENOTDIR ||
2038                    !verify_refname_available_dir(
2039                                    refname, extras, skip,
2040                                    get_loose_refs(refs), err))
2041                        strbuf_addf(err, "unable to resolve reference '%s': %s",
2042                                    refname, strerror(last_errno));
2043
2044                goto error_return;
2045        }
2046
2047        /*
2048         * If the ref did not exist and we are creating it, make sure
2049         * there is no existing packed ref whose name begins with our
2050         * refname, nor a packed ref whose name is a proper prefix of
2051         * our refname.
2052         */
2053        if (is_null_oid(&lock->old_oid) &&
2054            verify_refname_available_dir(refname, extras, skip,
2055                                         get_packed_refs(refs),
2056                                         err)) {
2057                last_errno = ENOTDIR;
2058                goto error_return;
2059        }
2060
2061        lock->lk = xcalloc(1, sizeof(struct lock_file));
2062
2063        lock->ref_name = xstrdup(refname);
2064
2065 retry:
2066        switch (safe_create_leading_directories_const(ref_file.buf)) {
2067        case SCLD_OK:
2068                break; /* success */
2069        case SCLD_VANISHED:
2070                if (--attempts_remaining > 0)
2071                        goto retry;
2072                /* fall through */
2073        default:
2074                last_errno = errno;
2075                strbuf_addf(err, "unable to create directory for '%s'",
2076                            ref_file.buf);
2077                goto error_return;
2078        }
2079
2080        if (hold_lock_file_for_update(lock->lk, ref_file.buf, lflags) < 0) {
2081                last_errno = errno;
2082                if (errno == ENOENT && --attempts_remaining > 0)
2083                        /*
2084                         * Maybe somebody just deleted one of the
2085                         * directories leading to ref_file.  Try
2086                         * again:
2087                         */
2088                        goto retry;
2089                else {
2090                        unable_to_lock_message(ref_file.buf, errno, err);
2091                        goto error_return;
2092                }
2093        }
2094        if (verify_lock(lock, old_sha1, mustexist, err)) {
2095                last_errno = errno;
2096                goto error_return;
2097        }
2098        goto out;
2099
2100 error_return:
2101        unlock_ref(lock);
2102        lock = NULL;
2103
2104 out:
2105        strbuf_release(&ref_file);
2106        errno = last_errno;
2107        return lock;
2108}
2109
2110/*
2111 * Write an entry to the packed-refs file for the specified refname.
2112 * If peeled is non-NULL, write it as the entry's peeled value.
2113 */
2114static void write_packed_entry(FILE *fh, char *refname, unsigned char *sha1,
2115                               unsigned char *peeled)
2116{
2117        fprintf_or_die(fh, "%s %s\n", sha1_to_hex(sha1), refname);
2118        if (peeled)
2119                fprintf_or_die(fh, "^%s\n", sha1_to_hex(peeled));
2120}
2121
2122/*
2123 * An each_ref_entry_fn that writes the entry to a packed-refs file.
2124 */
2125static int write_packed_entry_fn(struct ref_entry *entry, void *cb_data)
2126{
2127        enum peel_status peel_status = peel_entry(entry, 0);
2128
2129        if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)
2130                error("internal error: %s is not a valid packed reference!",
2131                      entry->name);
2132        write_packed_entry(cb_data, entry->name, entry->u.value.oid.hash,
2133                           peel_status == PEEL_PEELED ?
2134                           entry->u.value.peeled.hash : NULL);
2135        return 0;
2136}
2137
2138/*
2139 * Lock the packed-refs file for writing. Flags is passed to
2140 * hold_lock_file_for_update(). Return 0 on success. On errors, set
2141 * errno appropriately and return a nonzero value.
2142 */
2143static int lock_packed_refs(struct files_ref_store *refs, int flags)
2144{
2145        static int timeout_configured = 0;
2146        static int timeout_value = 1000;
2147        struct packed_ref_cache *packed_ref_cache;
2148
2149        assert_main_repository(&refs->base, "lock_packed_refs");
2150
2151        if (!timeout_configured) {
2152                git_config_get_int("core.packedrefstimeout", &timeout_value);
2153                timeout_configured = 1;
2154        }
2155
2156        if (hold_lock_file_for_update_timeout(
2157                            &packlock, git_path("packed-refs"),
2158                            flags, timeout_value) < 0)
2159                return -1;
2160        /*
2161         * Get the current packed-refs while holding the lock.  If the
2162         * packed-refs file has been modified since we last read it,
2163         * this will automatically invalidate the cache and re-read
2164         * the packed-refs file.
2165         */
2166        packed_ref_cache = get_packed_ref_cache(refs);
2167        packed_ref_cache->lock = &packlock;
2168        /* Increment the reference count to prevent it from being freed: */
2169        acquire_packed_ref_cache(packed_ref_cache);
2170        return 0;
2171}
2172
2173/*
2174 * Write the current version of the packed refs cache from memory to
2175 * disk. The packed-refs file must already be locked for writing (see
2176 * lock_packed_refs()). Return zero on success. On errors, set errno
2177 * and return a nonzero value
2178 */
2179static int commit_packed_refs(struct files_ref_store *refs)
2180{
2181        struct packed_ref_cache *packed_ref_cache =
2182                get_packed_ref_cache(refs);
2183        int error = 0;
2184        int save_errno = 0;
2185        FILE *out;
2186
2187        assert_main_repository(&refs->base, "commit_packed_refs");
2188
2189        if (!packed_ref_cache->lock)
2190                die("internal error: packed-refs not locked");
2191
2192        out = fdopen_lock_file(packed_ref_cache->lock, "w");
2193        if (!out)
2194                die_errno("unable to fdopen packed-refs descriptor");
2195
2196        fprintf_or_die(out, "%s", PACKED_REFS_HEADER);
2197        do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache),
2198                                 0, write_packed_entry_fn, out);
2199
2200        if (commit_lock_file(packed_ref_cache->lock)) {
2201                save_errno = errno;
2202                error = -1;
2203        }
2204        packed_ref_cache->lock = NULL;
2205        release_packed_ref_cache(packed_ref_cache);
2206        errno = save_errno;
2207        return error;
2208}
2209
2210/*
2211 * Rollback the lockfile for the packed-refs file, and discard the
2212 * in-memory packed reference cache.  (The packed-refs file will be
2213 * read anew if it is needed again after this function is called.)
2214 */
2215static void rollback_packed_refs(struct files_ref_store *refs)
2216{
2217        struct packed_ref_cache *packed_ref_cache =
2218                get_packed_ref_cache(refs);
2219
2220        assert_main_repository(&refs->base, "rollback_packed_refs");
2221
2222        if (!packed_ref_cache->lock)
2223                die("internal error: packed-refs not locked");
2224        rollback_lock_file(packed_ref_cache->lock);
2225        packed_ref_cache->lock = NULL;
2226        release_packed_ref_cache(packed_ref_cache);
2227        clear_packed_ref_cache(refs);
2228}
2229
2230struct ref_to_prune {
2231        struct ref_to_prune *next;
2232        unsigned char sha1[20];
2233        char name[FLEX_ARRAY];
2234};
2235
2236struct pack_refs_cb_data {
2237        unsigned int flags;
2238        struct ref_dir *packed_refs;
2239        struct ref_to_prune *ref_to_prune;
2240};
2241
2242/*
2243 * An each_ref_entry_fn that is run over loose references only.  If
2244 * the loose reference can be packed, add an entry in the packed ref
2245 * cache.  If the reference should be pruned, also add it to
2246 * ref_to_prune in the pack_refs_cb_data.
2247 */
2248static int pack_if_possible_fn(struct ref_entry *entry, void *cb_data)
2249{
2250        struct pack_refs_cb_data *cb = cb_data;
2251        enum peel_status peel_status;
2252        struct ref_entry *packed_entry;
2253        int is_tag_ref = starts_with(entry->name, "refs/tags/");
2254
2255        /* Do not pack per-worktree refs: */
2256        if (ref_type(entry->name) != REF_TYPE_NORMAL)
2257                return 0;
2258
2259        /* ALWAYS pack tags */
2260        if (!(cb->flags & PACK_REFS_ALL) && !is_tag_ref)
2261                return 0;
2262
2263        /* Do not pack symbolic or broken refs: */
2264        if ((entry->flag & REF_ISSYMREF) || !entry_resolves_to_object(entry))
2265                return 0;
2266
2267        /* Add a packed ref cache entry equivalent to the loose entry. */
2268        peel_status = peel_entry(entry, 1);
2269        if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)
2270                die("internal error peeling reference %s (%s)",
2271                    entry->name, oid_to_hex(&entry->u.value.oid));
2272        packed_entry = find_ref(cb->packed_refs, entry->name);
2273        if (packed_entry) {
2274                /* Overwrite existing packed entry with info from loose entry */
2275                packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED;
2276                oidcpy(&packed_entry->u.value.oid, &entry->u.value.oid);
2277        } else {
2278                packed_entry = create_ref_entry(entry->name, entry->u.value.oid.hash,
2279                                                REF_ISPACKED | REF_KNOWS_PEELED, 0);
2280                add_ref(cb->packed_refs, packed_entry);
2281        }
2282        oidcpy(&packed_entry->u.value.peeled, &entry->u.value.peeled);
2283
2284        /* Schedule the loose reference for pruning if requested. */
2285        if ((cb->flags & PACK_REFS_PRUNE)) {
2286                struct ref_to_prune *n;
2287                FLEX_ALLOC_STR(n, name, entry->name);
2288                hashcpy(n->sha1, entry->u.value.oid.hash);
2289                n->next = cb->ref_to_prune;
2290                cb->ref_to_prune = n;
2291        }
2292        return 0;
2293}
2294
2295/*
2296 * Remove empty parents, but spare refs/ and immediate subdirs.
2297 * Note: munges *name.
2298 */
2299static void try_remove_empty_parents(char *name)
2300{
2301        char *p, *q;
2302        int i;
2303        p = name;
2304        for (i = 0; i < 2; i++) { /* refs/{heads,tags,...}/ */
2305                while (*p && *p != '/')
2306                        p++;
2307                /* tolerate duplicate slashes; see check_refname_format() */
2308                while (*p == '/')
2309                        p++;
2310        }
2311        for (q = p; *q; q++)
2312                ;
2313        while (1) {
2314                while (q > p && *q != '/')
2315                        q--;
2316                while (q > p && *(q-1) == '/')
2317                        q--;
2318                if (q == p)
2319                        break;
2320                *q = '\0';
2321                if (rmdir(git_path("%s", name)))
2322                        break;
2323        }
2324}
2325
2326/* make sure nobody touched the ref, and unlink */
2327static void prune_ref(struct ref_to_prune *r)
2328{
2329        struct ref_transaction *transaction;
2330        struct strbuf err = STRBUF_INIT;
2331
2332        if (check_refname_format(r->name, 0))
2333                return;
2334
2335        transaction = ref_transaction_begin(&err);
2336        if (!transaction ||
2337            ref_transaction_delete(transaction, r->name, r->sha1,
2338                                   REF_ISPRUNING | REF_NODEREF, NULL, &err) ||
2339            ref_transaction_commit(transaction, &err)) {
2340                ref_transaction_free(transaction);
2341                error("%s", err.buf);
2342                strbuf_release(&err);
2343                return;
2344        }
2345        ref_transaction_free(transaction);
2346        strbuf_release(&err);
2347        try_remove_empty_parents(r->name);
2348}
2349
2350static void prune_refs(struct ref_to_prune *r)
2351{
2352        while (r) {
2353                prune_ref(r);
2354                r = r->next;
2355        }
2356}
2357
2358static int files_pack_refs(struct ref_store *ref_store, unsigned int flags)
2359{
2360        struct files_ref_store *refs =
2361                files_downcast(ref_store, 0, "pack_refs");
2362        struct pack_refs_cb_data cbdata;
2363
2364        memset(&cbdata, 0, sizeof(cbdata));
2365        cbdata.flags = flags;
2366
2367        lock_packed_refs(refs, LOCK_DIE_ON_ERROR);
2368        cbdata.packed_refs = get_packed_refs(refs);
2369
2370        do_for_each_entry_in_dir(get_loose_refs(refs), 0,
2371                                 pack_if_possible_fn, &cbdata);
2372
2373        if (commit_packed_refs(refs))
2374                die_errno("unable to overwrite old ref-pack file");
2375
2376        prune_refs(cbdata.ref_to_prune);
2377        return 0;
2378}
2379
2380/*
2381 * Rewrite the packed-refs file, omitting any refs listed in
2382 * 'refnames'. On error, leave packed-refs unchanged, write an error
2383 * message to 'err', and return a nonzero value.
2384 *
2385 * The refs in 'refnames' needn't be sorted. `err` must not be NULL.
2386 */
2387static int repack_without_refs(struct string_list *refnames, struct strbuf *err)
2388{
2389        struct files_ref_store *refs =
2390                get_files_ref_store(NULL, "repack_without_refs");
2391        struct ref_dir *packed;
2392        struct string_list_item *refname;
2393        int ret, needs_repacking = 0, removed = 0;
2394
2395        assert(err);
2396
2397        /* Look for a packed ref */
2398        for_each_string_list_item(refname, refnames) {
2399                if (get_packed_ref(refs, refname->string)) {
2400                        needs_repacking = 1;
2401                        break;
2402                }
2403        }
2404
2405        /* Avoid locking if we have nothing to do */
2406        if (!needs_repacking)
2407                return 0; /* no refname exists in packed refs */
2408
2409        if (lock_packed_refs(refs, 0)) {
2410                unable_to_lock_message(git_path("packed-refs"), errno, err);
2411                return -1;
2412        }
2413        packed = get_packed_refs(refs);
2414
2415        /* Remove refnames from the cache */
2416        for_each_string_list_item(refname, refnames)
2417                if (remove_entry(packed, refname->string) != -1)
2418                        removed = 1;
2419        if (!removed) {
2420                /*
2421                 * All packed entries disappeared while we were
2422                 * acquiring the lock.
2423                 */
2424                rollback_packed_refs(refs);
2425                return 0;
2426        }
2427
2428        /* Write what remains */
2429        ret = commit_packed_refs(refs);
2430        if (ret)
2431                strbuf_addf(err, "unable to overwrite old ref-pack file: %s",
2432                            strerror(errno));
2433        return ret;
2434}
2435
2436static int delete_ref_loose(struct ref_lock *lock, int flag, struct strbuf *err)
2437{
2438        assert(err);
2439
2440        if (!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) {
2441                /*
2442                 * loose.  The loose file name is the same as the
2443                 * lockfile name, minus ".lock":
2444                 */
2445                char *loose_filename = get_locked_file_path(lock->lk);
2446                int res = unlink_or_msg(loose_filename, err);
2447                free(loose_filename);
2448                if (res)
2449                        return 1;
2450        }
2451        return 0;
2452}
2453
2454int delete_refs(struct string_list *refnames, unsigned int flags)
2455{
2456        struct strbuf err = STRBUF_INIT;
2457        int i, result = 0;
2458
2459        if (!refnames->nr)
2460                return 0;
2461
2462        result = repack_without_refs(refnames, &err);
2463        if (result) {
2464                /*
2465                 * If we failed to rewrite the packed-refs file, then
2466                 * it is unsafe to try to remove loose refs, because
2467                 * doing so might expose an obsolete packed value for
2468                 * a reference that might even point at an object that
2469                 * has been garbage collected.
2470                 */
2471                if (refnames->nr == 1)
2472                        error(_("could not delete reference %s: %s"),
2473                              refnames->items[0].string, err.buf);
2474                else
2475                        error(_("could not delete references: %s"), err.buf);
2476
2477                goto out;
2478        }
2479
2480        for (i = 0; i < refnames->nr; i++) {
2481                const char *refname = refnames->items[i].string;
2482
2483                if (delete_ref(refname, NULL, flags))
2484                        result |= error(_("could not remove reference %s"), refname);
2485        }
2486
2487out:
2488        strbuf_release(&err);
2489        return result;
2490}
2491
2492/*
2493 * People using contrib's git-new-workdir have .git/logs/refs ->
2494 * /some/other/path/.git/logs/refs, and that may live on another device.
2495 *
2496 * IOW, to avoid cross device rename errors, the temporary renamed log must
2497 * live into logs/refs.
2498 */
2499#define TMP_RENAMED_LOG  "logs/refs/.tmp-renamed-log"
2500
2501static int rename_tmp_log(const char *newrefname)
2502{
2503        int attempts_remaining = 4;
2504        struct strbuf path = STRBUF_INIT;
2505        int ret = -1;
2506
2507 retry:
2508        strbuf_reset(&path);
2509        strbuf_git_path(&path, "logs/%s", newrefname);
2510        switch (safe_create_leading_directories_const(path.buf)) {
2511        case SCLD_OK:
2512                break; /* success */
2513        case SCLD_VANISHED:
2514                if (--attempts_remaining > 0)
2515                        goto retry;
2516                /* fall through */
2517        default:
2518                error("unable to create directory for %s", newrefname);
2519                goto out;
2520        }
2521
2522        if (rename(git_path(TMP_RENAMED_LOG), path.buf)) {
2523                if ((errno==EISDIR || errno==ENOTDIR) && --attempts_remaining > 0) {
2524                        /*
2525                         * rename(a, b) when b is an existing
2526                         * directory ought to result in ISDIR, but
2527                         * Solaris 5.8 gives ENOTDIR.  Sheesh.
2528                         */
2529                        if (remove_empty_directories(&path)) {
2530                                error("Directory not empty: logs/%s", newrefname);
2531                                goto out;
2532                        }
2533                        goto retry;
2534                } else if (errno == ENOENT && --attempts_remaining > 0) {
2535                        /*
2536                         * Maybe another process just deleted one of
2537                         * the directories in the path to newrefname.
2538                         * Try again from the beginning.
2539                         */
2540                        goto retry;
2541                } else {
2542                        error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s: %s",
2543                                newrefname, strerror(errno));
2544                        goto out;
2545                }
2546        }
2547        ret = 0;
2548out:
2549        strbuf_release(&path);
2550        return ret;
2551}
2552
2553static int files_verify_refname_available(struct ref_store *ref_store,
2554                                          const char *newname,
2555                                          const struct string_list *extras,
2556                                          const struct string_list *skip,
2557                                          struct strbuf *err)
2558{
2559        struct files_ref_store *refs =
2560                files_downcast(ref_store, 1, "verify_refname_available");
2561        struct ref_dir *packed_refs = get_packed_refs(refs);
2562        struct ref_dir *loose_refs = get_loose_refs(refs);
2563
2564        if (verify_refname_available_dir(newname, extras, skip,
2565                                         packed_refs, err) ||
2566            verify_refname_available_dir(newname, extras, skip,
2567                                         loose_refs, err))
2568                return -1;
2569
2570        return 0;
2571}
2572
2573static int write_ref_to_lockfile(struct ref_lock *lock,
2574                                 const unsigned char *sha1, struct strbuf *err);
2575static int commit_ref_update(struct ref_lock *lock,
2576                             const unsigned char *sha1, const char *logmsg,
2577                             struct strbuf *err);
2578
2579int rename_ref(const char *oldrefname, const char *newrefname, const char *logmsg)
2580{
2581        unsigned char sha1[20], orig_sha1[20];
2582        int flag = 0, logmoved = 0;
2583        struct ref_lock *lock;
2584        struct stat loginfo;
2585        int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);
2586        struct strbuf err = STRBUF_INIT;
2587
2588        if (log && S_ISLNK(loginfo.st_mode))
2589                return error("reflog for %s is a symlink", oldrefname);
2590
2591        if (!resolve_ref_unsafe(oldrefname, RESOLVE_REF_READING | RESOLVE_REF_NO_RECURSE,
2592                                orig_sha1, &flag))
2593                return error("refname %s not found", oldrefname);
2594
2595        if (flag & REF_ISSYMREF)
2596                return error("refname %s is a symbolic ref, renaming it is not supported",
2597                        oldrefname);
2598        if (!rename_ref_available(oldrefname, newrefname))
2599                return 1;
2600
2601        if (log && rename(git_path("logs/%s", oldrefname), git_path(TMP_RENAMED_LOG)))
2602                return error("unable to move logfile logs/%s to "TMP_RENAMED_LOG": %s",
2603                        oldrefname, strerror(errno));
2604
2605        if (delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {
2606                error("unable to delete old %s", oldrefname);
2607                goto rollback;
2608        }
2609
2610        /*
2611         * Since we are doing a shallow lookup, sha1 is not the
2612         * correct value to pass to delete_ref as old_sha1. But that
2613         * doesn't matter, because an old_sha1 check wouldn't add to
2614         * the safety anyway; we want to delete the reference whatever
2615         * its current value.
2616         */
2617        if (!read_ref_full(newrefname, RESOLVE_REF_READING | RESOLVE_REF_NO_RECURSE,
2618                           sha1, NULL) &&
2619            delete_ref(newrefname, NULL, REF_NODEREF)) {
2620                if (errno==EISDIR) {
2621                        struct strbuf path = STRBUF_INIT;
2622                        int result;
2623
2624                        strbuf_git_path(&path, "%s", newrefname);
2625                        result = remove_empty_directories(&path);
2626                        strbuf_release(&path);
2627
2628                        if (result) {
2629                                error("Directory not empty: %s", newrefname);
2630                                goto rollback;
2631                        }
2632                } else {
2633                        error("unable to delete existing %s", newrefname);
2634                        goto rollback;
2635                }
2636        }
2637
2638        if (log && rename_tmp_log(newrefname))
2639                goto rollback;
2640
2641        logmoved = log;
2642
2643        lock = lock_ref_sha1_basic(newrefname, NULL, NULL, NULL, REF_NODEREF,
2644                                   NULL, &err);
2645        if (!lock) {
2646                error("unable to rename '%s' to '%s': %s", oldrefname, newrefname, err.buf);
2647                strbuf_release(&err);
2648                goto rollback;
2649        }
2650        hashcpy(lock->old_oid.hash, orig_sha1);
2651
2652        if (write_ref_to_lockfile(lock, orig_sha1, &err) ||
2653            commit_ref_update(lock, orig_sha1, logmsg, &err)) {
2654                error("unable to write current sha1 into %s: %s", newrefname, err.buf);
2655                strbuf_release(&err);
2656                goto rollback;
2657        }
2658
2659        return 0;
2660
2661 rollback:
2662        lock = lock_ref_sha1_basic(oldrefname, NULL, NULL, NULL, REF_NODEREF,
2663                                   NULL, &err);
2664        if (!lock) {
2665                error("unable to lock %s for rollback: %s", oldrefname, err.buf);
2666                strbuf_release(&err);
2667                goto rollbacklog;
2668        }
2669
2670        flag = log_all_ref_updates;
2671        log_all_ref_updates = 0;
2672        if (write_ref_to_lockfile(lock, orig_sha1, &err) ||
2673            commit_ref_update(lock, orig_sha1, NULL, &err)) {
2674                error("unable to write current sha1 into %s: %s", oldrefname, err.buf);
2675                strbuf_release(&err);
2676        }
2677        log_all_ref_updates = flag;
2678
2679 rollbacklog:
2680        if (logmoved && rename(git_path("logs/%s", newrefname), git_path("logs/%s", oldrefname)))
2681                error("unable to restore logfile %s from %s: %s",
2682                        oldrefname, newrefname, strerror(errno));
2683        if (!logmoved && log &&
2684            rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", oldrefname)))
2685                error("unable to restore logfile %s from "TMP_RENAMED_LOG": %s",
2686                        oldrefname, strerror(errno));
2687
2688        return 1;
2689}
2690
2691static int close_ref(struct ref_lock *lock)
2692{
2693        if (close_lock_file(lock->lk))
2694                return -1;
2695        return 0;
2696}
2697
2698static int commit_ref(struct ref_lock *lock)
2699{
2700        char *path = get_locked_file_path(lock->lk);
2701        struct stat st;
2702
2703        if (!lstat(path, &st) && S_ISDIR(st.st_mode)) {
2704                /*
2705                 * There is a directory at the path we want to rename
2706                 * the lockfile to. Hopefully it is empty; try to
2707                 * delete it.
2708                 */
2709                size_t len = strlen(path);
2710                struct strbuf sb_path = STRBUF_INIT;
2711
2712                strbuf_attach(&sb_path, path, len, len);
2713
2714                /*
2715                 * If this fails, commit_lock_file() will also fail
2716                 * and will report the problem.
2717                 */
2718                remove_empty_directories(&sb_path);
2719                strbuf_release(&sb_path);
2720        } else {
2721                free(path);
2722        }
2723
2724        if (commit_lock_file(lock->lk))
2725                return -1;
2726        return 0;
2727}
2728
2729/*
2730 * Create a reflog for a ref.  If force_create = 0, the reflog will
2731 * only be created for certain refs (those for which
2732 * should_autocreate_reflog returns non-zero.  Otherwise, create it
2733 * regardless of the ref name.  Fill in *err and return -1 on failure.
2734 */
2735static int log_ref_setup(const char *refname, struct strbuf *logfile, struct strbuf *err, int force_create)
2736{
2737        int logfd, oflags = O_APPEND | O_WRONLY;
2738
2739        strbuf_git_path(logfile, "logs/%s", refname);
2740        if (force_create || should_autocreate_reflog(refname)) {
2741                if (safe_create_leading_directories(logfile->buf) < 0) {
2742                        strbuf_addf(err, "unable to create directory for '%s': "
2743                                    "%s", logfile->buf, strerror(errno));
2744                        return -1;
2745                }
2746                oflags |= O_CREAT;
2747        }
2748
2749        logfd = open(logfile->buf, oflags, 0666);
2750        if (logfd < 0) {
2751                if (!(oflags & O_CREAT) && (errno == ENOENT || errno == EISDIR))
2752                        return 0;
2753
2754                if (errno == EISDIR) {
2755                        if (remove_empty_directories(logfile)) {
2756                                strbuf_addf(err, "there are still logs under "
2757                                            "'%s'", logfile->buf);
2758                                return -1;
2759                        }
2760                        logfd = open(logfile->buf, oflags, 0666);
2761                }
2762
2763                if (logfd < 0) {
2764                        strbuf_addf(err, "unable to append to '%s': %s",
2765                                    logfile->buf, strerror(errno));
2766                        return -1;
2767                }
2768        }
2769
2770        adjust_shared_perm(logfile->buf);
2771        close(logfd);
2772        return 0;
2773}
2774
2775
2776int safe_create_reflog(const char *refname, int force_create, struct strbuf *err)
2777{
2778        int ret;
2779        struct strbuf sb = STRBUF_INIT;
2780
2781        ret = log_ref_setup(refname, &sb, err, force_create);
2782        strbuf_release(&sb);
2783        return ret;
2784}
2785
2786static int log_ref_write_fd(int fd, const unsigned char *old_sha1,
2787                            const unsigned char *new_sha1,
2788                            const char *committer, const char *msg)
2789{
2790        int msglen, written;
2791        unsigned maxlen, len;
2792        char *logrec;
2793
2794        msglen = msg ? strlen(msg) : 0;
2795        maxlen = strlen(committer) + msglen + 100;
2796        logrec = xmalloc(maxlen);
2797        len = xsnprintf(logrec, maxlen, "%s %s %s\n",
2798                        sha1_to_hex(old_sha1),
2799                        sha1_to_hex(new_sha1),
2800                        committer);
2801        if (msglen)
2802                len += copy_reflog_msg(logrec + len - 1, msg) - 1;
2803
2804        written = len <= maxlen ? write_in_full(fd, logrec, len) : -1;
2805        free(logrec);
2806        if (written != len)
2807                return -1;
2808
2809        return 0;
2810}
2811
2812static int log_ref_write_1(const char *refname, const unsigned char *old_sha1,
2813                           const unsigned char *new_sha1, const char *msg,
2814                           struct strbuf *logfile, int flags,
2815                           struct strbuf *err)
2816{
2817        int logfd, result, oflags = O_APPEND | O_WRONLY;
2818
2819        if (log_all_ref_updates < 0)
2820                log_all_ref_updates = !is_bare_repository();
2821
2822        result = log_ref_setup(refname, logfile, err, flags & REF_FORCE_CREATE_REFLOG);
2823
2824        if (result)
2825                return result;
2826
2827        logfd = open(logfile->buf, oflags);
2828        if (logfd < 0)
2829                return 0;
2830        result = log_ref_write_fd(logfd, old_sha1, new_sha1,
2831                                  git_committer_info(0), msg);
2832        if (result) {
2833                strbuf_addf(err, "unable to append to '%s': %s", logfile->buf,
2834                            strerror(errno));
2835                close(logfd);
2836                return -1;
2837        }
2838        if (close(logfd)) {
2839                strbuf_addf(err, "unable to append to '%s': %s", logfile->buf,
2840                            strerror(errno));
2841                return -1;
2842        }
2843        return 0;
2844}
2845
2846static int log_ref_write(const char *refname, const unsigned char *old_sha1,
2847                         const unsigned char *new_sha1, const char *msg,
2848                         int flags, struct strbuf *err)
2849{
2850        return files_log_ref_write(refname, old_sha1, new_sha1, msg, flags,
2851                                   err);
2852}
2853
2854int files_log_ref_write(const char *refname, const unsigned char *old_sha1,
2855                        const unsigned char *new_sha1, const char *msg,
2856                        int flags, struct strbuf *err)
2857{
2858        struct strbuf sb = STRBUF_INIT;
2859        int ret = log_ref_write_1(refname, old_sha1, new_sha1, msg, &sb, flags,
2860                                  err);
2861        strbuf_release(&sb);
2862        return ret;
2863}
2864
2865/*
2866 * Write sha1 into the open lockfile, then close the lockfile. On
2867 * errors, rollback the lockfile, fill in *err and
2868 * return -1.
2869 */
2870static int write_ref_to_lockfile(struct ref_lock *lock,
2871                                 const unsigned char *sha1, struct strbuf *err)
2872{
2873        static char term = '\n';
2874        struct object *o;
2875        int fd;
2876
2877        o = parse_object(sha1);
2878        if (!o) {
2879                strbuf_addf(err,
2880                            "trying to write ref '%s' with nonexistent object %s",
2881                            lock->ref_name, sha1_to_hex(sha1));
2882                unlock_ref(lock);
2883                return -1;
2884        }
2885        if (o->type != OBJ_COMMIT && is_branch(lock->ref_name)) {
2886                strbuf_addf(err,
2887                            "trying to write non-commit object %s to branch '%s'",
2888                            sha1_to_hex(sha1), lock->ref_name);
2889                unlock_ref(lock);
2890                return -1;
2891        }
2892        fd = get_lock_file_fd(lock->lk);
2893        if (write_in_full(fd, sha1_to_hex(sha1), 40) != 40 ||
2894            write_in_full(fd, &term, 1) != 1 ||
2895            close_ref(lock) < 0) {
2896                strbuf_addf(err,
2897                            "couldn't write '%s'", get_lock_file_path(lock->lk));
2898                unlock_ref(lock);
2899                return -1;
2900        }
2901        return 0;
2902}
2903
2904/*
2905 * Commit a change to a loose reference that has already been written
2906 * to the loose reference lockfile. Also update the reflogs if
2907 * necessary, using the specified lockmsg (which can be NULL).
2908 */
2909static int commit_ref_update(struct ref_lock *lock,
2910                             const unsigned char *sha1, const char *logmsg,
2911                             struct strbuf *err)
2912{
2913        struct files_ref_store *refs =
2914                get_files_ref_store(NULL, "commit_ref_update");
2915
2916        clear_loose_ref_cache(refs);
2917        if (log_ref_write(lock->ref_name, lock->old_oid.hash, sha1, logmsg, 0, err)) {
2918                char *old_msg = strbuf_detach(err, NULL);
2919                strbuf_addf(err, "cannot update the ref '%s': %s",
2920                            lock->ref_name, old_msg);
2921                free(old_msg);
2922                unlock_ref(lock);
2923                return -1;
2924        }
2925
2926        if (strcmp(lock->ref_name, "HEAD") != 0) {
2927                /*
2928                 * Special hack: If a branch is updated directly and HEAD
2929                 * points to it (may happen on the remote side of a push
2930                 * for example) then logically the HEAD reflog should be
2931                 * updated too.
2932                 * A generic solution implies reverse symref information,
2933                 * but finding all symrefs pointing to the given branch
2934                 * would be rather costly for this rare event (the direct
2935                 * update of a branch) to be worth it.  So let's cheat and
2936                 * check with HEAD only which should cover 99% of all usage
2937                 * scenarios (even 100% of the default ones).
2938                 */
2939                unsigned char head_sha1[20];
2940                int head_flag;
2941                const char *head_ref;
2942
2943                head_ref = resolve_ref_unsafe("HEAD", RESOLVE_REF_READING,
2944                                              head_sha1, &head_flag);
2945                if (head_ref && (head_flag & REF_ISSYMREF) &&
2946                    !strcmp(head_ref, lock->ref_name)) {
2947                        struct strbuf log_err = STRBUF_INIT;
2948                        if (log_ref_write("HEAD", lock->old_oid.hash, sha1,
2949                                          logmsg, 0, &log_err)) {
2950                                error("%s", log_err.buf);
2951                                strbuf_release(&log_err);
2952                        }
2953                }
2954        }
2955
2956        if (commit_ref(lock)) {
2957                strbuf_addf(err, "couldn't set '%s'", lock->ref_name);
2958                unlock_ref(lock);
2959                return -1;
2960        }
2961
2962        unlock_ref(lock);
2963        return 0;
2964}
2965
2966static int create_ref_symlink(struct ref_lock *lock, const char *target)
2967{
2968        int ret = -1;
2969#ifndef NO_SYMLINK_HEAD
2970        char *ref_path = get_locked_file_path(lock->lk);
2971        unlink(ref_path);
2972        ret = symlink(target, ref_path);
2973        free(ref_path);
2974
2975        if (ret)
2976                fprintf(stderr, "no symlink - falling back to symbolic ref\n");
2977#endif
2978        return ret;
2979}
2980
2981static void update_symref_reflog(struct ref_lock *lock, const char *refname,
2982                                 const char *target, const char *logmsg)
2983{
2984        struct strbuf err = STRBUF_INIT;
2985        unsigned char new_sha1[20];
2986        if (logmsg && !read_ref(target, new_sha1) &&
2987            log_ref_write(refname, lock->old_oid.hash, new_sha1, logmsg, 0, &err)) {
2988                error("%s", err.buf);
2989                strbuf_release(&err);
2990        }
2991}
2992
2993static int create_symref_locked(struct ref_lock *lock, const char *refname,
2994                                const char *target, const char *logmsg)
2995{
2996        if (prefer_symlink_refs && !create_ref_symlink(lock, target)) {
2997                update_symref_reflog(lock, refname, target, logmsg);
2998                return 0;
2999        }
3000
3001        if (!fdopen_lock_file(lock->lk, "w"))
3002                return error("unable to fdopen %s: %s",
3003                             lock->lk->tempfile.filename.buf, strerror(errno));
3004
3005        update_symref_reflog(lock, refname, target, logmsg);
3006
3007        /* no error check; commit_ref will check ferror */
3008        fprintf(lock->lk->tempfile.fp, "ref: %s\n", target);
3009        if (commit_ref(lock) < 0)
3010                return error("unable to write symref for %s: %s", refname,
3011                             strerror(errno));
3012        return 0;
3013}
3014
3015static int files_create_symref(struct ref_store *ref_store,
3016                               const char *refname, const char *target,
3017                               const char *logmsg)
3018{
3019        struct strbuf err = STRBUF_INIT;
3020        struct ref_lock *lock;
3021        int ret;
3022
3023        files_downcast(ref_store, 0, "create_symref");
3024
3025        lock = lock_ref_sha1_basic(refname, NULL, NULL, NULL, REF_NODEREF, NULL,
3026                                   &err);
3027        if (!lock) {
3028                error("%s", err.buf);
3029                strbuf_release(&err);
3030                return -1;
3031        }
3032
3033        ret = create_symref_locked(lock, refname, target, logmsg);
3034        unlock_ref(lock);
3035        return ret;
3036}
3037
3038int set_worktree_head_symref(const char *gitdir, const char *target)
3039{
3040        static struct lock_file head_lock;
3041        struct ref_lock *lock;
3042        struct strbuf head_path = STRBUF_INIT;
3043        const char *head_rel;
3044        int ret;
3045
3046        strbuf_addf(&head_path, "%s/HEAD", absolute_path(gitdir));
3047        if (hold_lock_file_for_update(&head_lock, head_path.buf,
3048                                      LOCK_NO_DEREF) < 0) {
3049                struct strbuf err = STRBUF_INIT;
3050                unable_to_lock_message(head_path.buf, errno, &err);
3051                error("%s", err.buf);
3052                strbuf_release(&err);
3053                strbuf_release(&head_path);
3054                return -1;
3055        }
3056
3057        /* head_rel will be "HEAD" for the main tree, "worktrees/wt/HEAD" for
3058           linked trees */
3059        head_rel = remove_leading_path(head_path.buf,
3060                                       absolute_path(get_git_common_dir()));
3061        /* to make use of create_symref_locked(), initialize ref_lock */
3062        lock = xcalloc(1, sizeof(struct ref_lock));
3063        lock->lk = &head_lock;
3064        lock->ref_name = xstrdup(head_rel);
3065
3066        ret = create_symref_locked(lock, head_rel, target, NULL);
3067
3068        unlock_ref(lock); /* will free lock */
3069        strbuf_release(&head_path);
3070        return ret;
3071}
3072
3073int reflog_exists(const char *refname)
3074{
3075        struct stat st;
3076
3077        return !lstat(git_path("logs/%s", refname), &st) &&
3078                S_ISREG(st.st_mode);
3079}
3080
3081int delete_reflog(const char *refname)
3082{
3083        return remove_path(git_path("logs/%s", refname));
3084}
3085
3086static int show_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn, void *cb_data)
3087{
3088        unsigned char osha1[20], nsha1[20];
3089        char *email_end, *message;
3090        unsigned long timestamp;
3091        int tz;
3092
3093        /* old SP new SP name <email> SP time TAB msg LF */
3094        if (sb->len < 83 || sb->buf[sb->len - 1] != '\n' ||
3095            get_sha1_hex(sb->buf, osha1) || sb->buf[40] != ' ' ||
3096            get_sha1_hex(sb->buf + 41, nsha1) || sb->buf[81] != ' ' ||
3097            !(email_end = strchr(sb->buf + 82, '>')) ||
3098            email_end[1] != ' ' ||
3099            !(timestamp = strtoul(email_end + 2, &message, 10)) ||
3100            !message || message[0] != ' ' ||
3101            (message[1] != '+' && message[1] != '-') ||
3102            !isdigit(message[2]) || !isdigit(message[3]) ||
3103            !isdigit(message[4]) || !isdigit(message[5]))
3104                return 0; /* corrupt? */
3105        email_end[1] = '\0';
3106        tz = strtol(message + 1, NULL, 10);
3107        if (message[6] != '\t')
3108                message += 6;
3109        else
3110                message += 7;
3111        return fn(osha1, nsha1, sb->buf + 82, timestamp, tz, message, cb_data);
3112}
3113
3114static char *find_beginning_of_line(char *bob, char *scan)
3115{
3116        while (bob < scan && *(--scan) != '\n')
3117                ; /* keep scanning backwards */
3118        /*
3119         * Return either beginning of the buffer, or LF at the end of
3120         * the previous line.
3121         */
3122        return scan;
3123}
3124
3125int for_each_reflog_ent_reverse(const char *refname, each_reflog_ent_fn fn, void *cb_data)
3126{
3127        struct strbuf sb = STRBUF_INIT;
3128        FILE *logfp;
3129        long pos;
3130        int ret = 0, at_tail = 1;
3131
3132        logfp = fopen(git_path("logs/%s", refname), "r");
3133        if (!logfp)
3134                return -1;
3135
3136        /* Jump to the end */
3137        if (fseek(logfp, 0, SEEK_END) < 0)
3138                return error("cannot seek back reflog for %s: %s",
3139                             refname, strerror(errno));
3140        pos = ftell(logfp);
3141        while (!ret && 0 < pos) {
3142                int cnt;
3143                size_t nread;
3144                char buf[BUFSIZ];
3145                char *endp, *scanp;
3146
3147                /* Fill next block from the end */
3148                cnt = (sizeof(buf) < pos) ? sizeof(buf) : pos;
3149                if (fseek(logfp, pos - cnt, SEEK_SET))
3150                        return error("cannot seek back reflog for %s: %s",
3151                                     refname, strerror(errno));
3152                nread = fread(buf, cnt, 1, logfp);
3153                if (nread != 1)
3154                        return error("cannot read %d bytes from reflog for %s: %s",
3155                                     cnt, refname, strerror(errno));
3156                pos -= cnt;
3157
3158                scanp = endp = buf + cnt;
3159                if (at_tail && scanp[-1] == '\n')
3160                        /* Looking at the final LF at the end of the file */
3161                        scanp--;
3162                at_tail = 0;
3163
3164                while (buf < scanp) {
3165                        /*
3166                         * terminating LF of the previous line, or the beginning
3167                         * of the buffer.
3168                         */
3169                        char *bp;
3170
3171                        bp = find_beginning_of_line(buf, scanp);
3172
3173                        if (*bp == '\n') {
3174                                /*
3175                                 * The newline is the end of the previous line,
3176                                 * so we know we have complete line starting
3177                                 * at (bp + 1). Prefix it onto any prior data
3178                                 * we collected for the line and process it.
3179                                 */
3180                                strbuf_splice(&sb, 0, 0, bp + 1, endp - (bp + 1));
3181                                scanp = bp;
3182                                endp = bp + 1;
3183                                ret = show_one_reflog_ent(&sb, fn, cb_data);
3184                                strbuf_reset(&sb);
3185                                if (ret)
3186                                        break;
3187                        } else if (!pos) {
3188                                /*
3189                                 * We are at the start of the buffer, and the
3190                                 * start of the file; there is no previous
3191                                 * line, and we have everything for this one.
3192                                 * Process it, and we can end the loop.
3193                                 */
3194                                strbuf_splice(&sb, 0, 0, buf, endp - buf);
3195                                ret = show_one_reflog_ent(&sb, fn, cb_data);
3196                                strbuf_reset(&sb);
3197                                break;
3198                        }
3199
3200                        if (bp == buf) {
3201                                /*
3202                                 * We are at the start of the buffer, and there
3203                                 * is more file to read backwards. Which means
3204                                 * we are in the middle of a line. Note that we
3205                                 * may get here even if *bp was a newline; that
3206                                 * just means we are at the exact end of the
3207                                 * previous line, rather than some spot in the
3208                                 * middle.
3209                                 *
3210                                 * Save away what we have to be combined with
3211                                 * the data from the next read.
3212                                 */
3213                                strbuf_splice(&sb, 0, 0, buf, endp - buf);
3214                                break;
3215                        }
3216                }
3217
3218        }
3219        if (!ret && sb.len)
3220                die("BUG: reverse reflog parser had leftover data");
3221
3222        fclose(logfp);
3223        strbuf_release(&sb);
3224        return ret;
3225}
3226
3227int for_each_reflog_ent(const char *refname, each_reflog_ent_fn fn, void *cb_data)
3228{
3229        FILE *logfp;
3230        struct strbuf sb = STRBUF_INIT;
3231        int ret = 0;
3232
3233        logfp = fopen(git_path("logs/%s", refname), "r");
3234        if (!logfp)
3235                return -1;
3236
3237        while (!ret && !strbuf_getwholeline(&sb, logfp, '\n'))
3238                ret = show_one_reflog_ent(&sb, fn, cb_data);
3239        fclose(logfp);
3240        strbuf_release(&sb);
3241        return ret;
3242}
3243
3244struct files_reflog_iterator {
3245        struct ref_iterator base;
3246
3247        struct dir_iterator *dir_iterator;
3248        struct object_id oid;
3249};
3250
3251static int files_reflog_iterator_advance(struct ref_iterator *ref_iterator)
3252{
3253        struct files_reflog_iterator *iter =
3254                (struct files_reflog_iterator *)ref_iterator;
3255        struct dir_iterator *diter = iter->dir_iterator;
3256        int ok;
3257
3258        while ((ok = dir_iterator_advance(diter)) == ITER_OK) {
3259                int flags;
3260
3261                if (!S_ISREG(diter->st.st_mode))
3262                        continue;
3263                if (diter->basename[0] == '.')
3264                        continue;
3265                if (ends_with(diter->basename, ".lock"))
3266                        continue;
3267
3268                if (read_ref_full(diter->relative_path, 0,
3269                                  iter->oid.hash, &flags)) {
3270                        error("bad ref for %s", diter->path.buf);
3271                        continue;
3272                }
3273
3274                iter->base.refname = diter->relative_path;
3275                iter->base.oid = &iter->oid;
3276                iter->base.flags = flags;
3277                return ITER_OK;
3278        }
3279
3280        iter->dir_iterator = NULL;
3281        if (ref_iterator_abort(ref_iterator) == ITER_ERROR)
3282                ok = ITER_ERROR;
3283        return ok;
3284}
3285
3286static int files_reflog_iterator_peel(struct ref_iterator *ref_iterator,
3287                                   struct object_id *peeled)
3288{
3289        die("BUG: ref_iterator_peel() called for reflog_iterator");
3290}
3291
3292static int files_reflog_iterator_abort(struct ref_iterator *ref_iterator)
3293{
3294        struct files_reflog_iterator *iter =
3295                (struct files_reflog_iterator *)ref_iterator;
3296        int ok = ITER_DONE;
3297
3298        if (iter->dir_iterator)
3299                ok = dir_iterator_abort(iter->dir_iterator);
3300
3301        base_ref_iterator_free(ref_iterator);
3302        return ok;
3303}
3304
3305static struct ref_iterator_vtable files_reflog_iterator_vtable = {
3306        files_reflog_iterator_advance,
3307        files_reflog_iterator_peel,
3308        files_reflog_iterator_abort
3309};
3310
3311struct ref_iterator *files_reflog_iterator_begin(void)
3312{
3313        struct files_reflog_iterator *iter = xcalloc(1, sizeof(*iter));
3314        struct ref_iterator *ref_iterator = &iter->base;
3315
3316        base_ref_iterator_init(ref_iterator, &files_reflog_iterator_vtable);
3317        iter->dir_iterator = dir_iterator_begin(git_path("logs"));
3318        return ref_iterator;
3319}
3320
3321int for_each_reflog(each_ref_fn fn, void *cb_data)
3322{
3323        return do_for_each_ref_iterator(files_reflog_iterator_begin(),
3324                                        fn, cb_data);
3325}
3326
3327static int ref_update_reject_duplicates(struct string_list *refnames,
3328                                        struct strbuf *err)
3329{
3330        int i, n = refnames->nr;
3331
3332        assert(err);
3333
3334        for (i = 1; i < n; i++)
3335                if (!strcmp(refnames->items[i - 1].string, refnames->items[i].string)) {
3336                        strbuf_addf(err,
3337                                    "multiple updates for ref '%s' not allowed.",
3338                                    refnames->items[i].string);
3339                        return 1;
3340                }
3341        return 0;
3342}
3343
3344/*
3345 * If update is a direct update of head_ref (the reference pointed to
3346 * by HEAD), then add an extra REF_LOG_ONLY update for HEAD.
3347 */
3348static int split_head_update(struct ref_update *update,
3349                             struct ref_transaction *transaction,
3350                             const char *head_ref,
3351                             struct string_list *affected_refnames,
3352                             struct strbuf *err)
3353{
3354        struct string_list_item *item;
3355        struct ref_update *new_update;
3356
3357        if ((update->flags & REF_LOG_ONLY) ||
3358            (update->flags & REF_ISPRUNING) ||
3359            (update->flags & REF_UPDATE_VIA_HEAD))
3360                return 0;
3361
3362        if (strcmp(update->refname, head_ref))
3363                return 0;
3364
3365        /*
3366         * First make sure that HEAD is not already in the
3367         * transaction. This insertion is O(N) in the transaction
3368         * size, but it happens at most once per transaction.
3369         */
3370        item = string_list_insert(affected_refnames, "HEAD");
3371        if (item->util) {
3372                /* An entry already existed */
3373                strbuf_addf(err,
3374                            "multiple updates for 'HEAD' (including one "
3375                            "via its referent '%s') are not allowed",
3376                            update->refname);
3377                return TRANSACTION_NAME_CONFLICT;
3378        }
3379
3380        new_update = ref_transaction_add_update(
3381                        transaction, "HEAD",
3382                        update->flags | REF_LOG_ONLY | REF_NODEREF,
3383                        update->new_sha1, update->old_sha1,
3384                        update->msg);
3385
3386        item->util = new_update;
3387
3388        return 0;
3389}
3390
3391/*
3392 * update is for a symref that points at referent and doesn't have
3393 * REF_NODEREF set. Split it into two updates:
3394 * - The original update, but with REF_LOG_ONLY and REF_NODEREF set
3395 * - A new, separate update for the referent reference
3396 * Note that the new update will itself be subject to splitting when
3397 * the iteration gets to it.
3398 */
3399static int split_symref_update(struct ref_update *update,
3400                               const char *referent,
3401                               struct ref_transaction *transaction,
3402                               struct string_list *affected_refnames,
3403                               struct strbuf *err)
3404{
3405        struct string_list_item *item;
3406        struct ref_update *new_update;
3407        unsigned int new_flags;
3408
3409        /*
3410         * First make sure that referent is not already in the
3411         * transaction. This insertion is O(N) in the transaction
3412         * size, but it happens at most once per symref in a
3413         * transaction.
3414         */
3415        item = string_list_insert(affected_refnames, referent);
3416        if (item->util) {
3417                /* An entry already existed */
3418                strbuf_addf(err,
3419                            "multiple updates for '%s' (including one "
3420                            "via symref '%s') are not allowed",
3421                            referent, update->refname);
3422                return TRANSACTION_NAME_CONFLICT;
3423        }
3424
3425        new_flags = update->flags;
3426        if (!strcmp(update->refname, "HEAD")) {
3427                /*
3428                 * Record that the new update came via HEAD, so that
3429                 * when we process it, split_head_update() doesn't try
3430                 * to add another reflog update for HEAD. Note that
3431                 * this bit will be propagated if the new_update
3432                 * itself needs to be split.
3433                 */
3434                new_flags |= REF_UPDATE_VIA_HEAD;
3435        }
3436
3437        new_update = ref_transaction_add_update(
3438                        transaction, referent, new_flags,
3439                        update->new_sha1, update->old_sha1,
3440                        update->msg);
3441
3442        new_update->parent_update = update;
3443
3444        /*
3445         * Change the symbolic ref update to log only. Also, it
3446         * doesn't need to check its old SHA-1 value, as that will be
3447         * done when new_update is processed.
3448         */
3449        update->flags |= REF_LOG_ONLY | REF_NODEREF;
3450        update->flags &= ~REF_HAVE_OLD;
3451
3452        item->util = new_update;
3453
3454        return 0;
3455}
3456
3457/*
3458 * Return the refname under which update was originally requested.
3459 */
3460static const char *original_update_refname(struct ref_update *update)
3461{
3462        while (update->parent_update)
3463                update = update->parent_update;
3464
3465        return update->refname;
3466}
3467
3468/*
3469 * Prepare for carrying out update:
3470 * - Lock the reference referred to by update.
3471 * - Read the reference under lock.
3472 * - Check that its old SHA-1 value (if specified) is correct, and in
3473 *   any case record it in update->lock->old_oid for later use when
3474 *   writing the reflog.
3475 * - If it is a symref update without REF_NODEREF, split it up into a
3476 *   REF_LOG_ONLY update of the symref and add a separate update for
3477 *   the referent to transaction.
3478 * - If it is an update of head_ref, add a corresponding REF_LOG_ONLY
3479 *   update of HEAD.
3480 */
3481static int lock_ref_for_update(struct ref_update *update,
3482                               struct ref_transaction *transaction,
3483                               const char *head_ref,
3484                               struct string_list *affected_refnames,
3485                               struct strbuf *err)
3486{
3487        struct strbuf referent = STRBUF_INIT;
3488        int mustexist = (update->flags & REF_HAVE_OLD) &&
3489                !is_null_sha1(update->old_sha1);
3490        int ret;
3491        struct ref_lock *lock;
3492
3493        if ((update->flags & REF_HAVE_NEW) && is_null_sha1(update->new_sha1))
3494                update->flags |= REF_DELETING;
3495
3496        if (head_ref) {
3497                ret = split_head_update(update, transaction, head_ref,
3498                                        affected_refnames, err);
3499                if (ret)
3500                        return ret;
3501        }
3502
3503        ret = lock_raw_ref(update->refname, mustexist,
3504                           affected_refnames, NULL,
3505                           &update->lock, &referent,
3506                           &update->type, err);
3507
3508        if (ret) {
3509                char *reason;
3510
3511                reason = strbuf_detach(err, NULL);
3512                strbuf_addf(err, "cannot lock ref '%s': %s",
3513                            update->refname, reason);
3514                free(reason);
3515                return ret;
3516        }
3517
3518        lock = update->lock;
3519
3520        if (update->type & REF_ISSYMREF) {
3521                if (update->flags & REF_NODEREF) {
3522                        /*
3523                         * We won't be reading the referent as part of
3524                         * the transaction, so we have to read it here
3525                         * to record and possibly check old_sha1:
3526                         */
3527                        if (read_ref_full(update->refname,
3528                                          mustexist ? RESOLVE_REF_READING : 0,
3529                                          lock->old_oid.hash, NULL)) {
3530                                if (update->flags & REF_HAVE_OLD) {
3531                                        strbuf_addf(err, "cannot lock ref '%s': "
3532                                                    "can't resolve old value",
3533                                                    update->refname);
3534                                        return TRANSACTION_GENERIC_ERROR;
3535                                } else {
3536                                        hashclr(lock->old_oid.hash);
3537                                }
3538                        }
3539                        if ((update->flags & REF_HAVE_OLD) &&
3540                            hashcmp(lock->old_oid.hash, update->old_sha1)) {
3541                                strbuf_addf(err, "cannot lock ref '%s': "
3542                                            "is at %s but expected %s",
3543                                            update->refname,
3544                                            sha1_to_hex(lock->old_oid.hash),
3545                                            sha1_to_hex(update->old_sha1));
3546                                return TRANSACTION_GENERIC_ERROR;
3547                        }
3548
3549                } else {
3550                        /*
3551                         * Create a new update for the reference this
3552                         * symref is pointing at. Also, we will record
3553                         * and verify old_sha1 for this update as part
3554                         * of processing the split-off update, so we
3555                         * don't have to do it here.
3556                         */
3557                        ret = split_symref_update(update, referent.buf, transaction,
3558                                                  affected_refnames, err);
3559                        if (ret)
3560                                return ret;
3561                }
3562        } else {
3563                struct ref_update *parent_update;
3564
3565                /*
3566                 * If this update is happening indirectly because of a
3567                 * symref update, record the old SHA-1 in the parent
3568                 * update:
3569                 */
3570                for (parent_update = update->parent_update;
3571                     parent_update;
3572                     parent_update = parent_update->parent_update) {
3573                        oidcpy(&parent_update->lock->old_oid, &lock->old_oid);
3574                }
3575
3576                if ((update->flags & REF_HAVE_OLD) &&
3577                    hashcmp(lock->old_oid.hash, update->old_sha1)) {
3578                        if (is_null_sha1(update->old_sha1))
3579                                strbuf_addf(err, "cannot lock ref '%s': reference already exists",
3580                                            original_update_refname(update));
3581                        else
3582                                strbuf_addf(err, "cannot lock ref '%s': is at %s but expected %s",
3583                                            original_update_refname(update),
3584                                            sha1_to_hex(lock->old_oid.hash),
3585                                            sha1_to_hex(update->old_sha1));
3586
3587                        return TRANSACTION_GENERIC_ERROR;
3588                }
3589        }
3590
3591        if ((update->flags & REF_HAVE_NEW) &&
3592            !(update->flags & REF_DELETING) &&
3593            !(update->flags & REF_LOG_ONLY)) {
3594                if (!(update->type & REF_ISSYMREF) &&
3595                    !hashcmp(lock->old_oid.hash, update->new_sha1)) {
3596                        /*
3597                         * The reference already has the desired
3598                         * value, so we don't need to write it.
3599                         */
3600                } else if (write_ref_to_lockfile(lock, update->new_sha1,
3601                                                 err)) {
3602                        char *write_err = strbuf_detach(err, NULL);
3603
3604                        /*
3605                         * The lock was freed upon failure of
3606                         * write_ref_to_lockfile():
3607                         */
3608                        update->lock = NULL;
3609                        strbuf_addf(err,
3610                                    "cannot update the ref '%s': %s",
3611                                    update->refname, write_err);
3612                        free(write_err);
3613                        return TRANSACTION_GENERIC_ERROR;
3614                } else {
3615                        update->flags |= REF_NEEDS_COMMIT;
3616                }
3617        }
3618        if (!(update->flags & REF_NEEDS_COMMIT)) {
3619                /*
3620                 * We didn't call write_ref_to_lockfile(), so
3621                 * the lockfile is still open. Close it to
3622                 * free up the file descriptor:
3623                 */
3624                if (close_ref(lock)) {
3625                        strbuf_addf(err, "couldn't close '%s.lock'",
3626                                    update->refname);
3627                        return TRANSACTION_GENERIC_ERROR;
3628                }
3629        }
3630        return 0;
3631}
3632
3633static int files_transaction_commit(struct ref_store *ref_store,
3634                                    struct ref_transaction *transaction,
3635                                    struct strbuf *err)
3636{
3637        struct files_ref_store *refs =
3638                files_downcast(ref_store, 0, "ref_transaction_commit");
3639        int ret = 0, i;
3640        struct string_list refs_to_delete = STRING_LIST_INIT_NODUP;
3641        struct string_list_item *ref_to_delete;
3642        struct string_list affected_refnames = STRING_LIST_INIT_NODUP;
3643        char *head_ref = NULL;
3644        int head_type;
3645        struct object_id head_oid;
3646
3647        assert(err);
3648
3649        if (transaction->state != REF_TRANSACTION_OPEN)
3650                die("BUG: commit called for transaction that is not open");
3651
3652        if (!transaction->nr) {
3653                transaction->state = REF_TRANSACTION_CLOSED;
3654                return 0;
3655        }
3656
3657        /*
3658         * Fail if a refname appears more than once in the
3659         * transaction. (If we end up splitting up any updates using
3660         * split_symref_update() or split_head_update(), those
3661         * functions will check that the new updates don't have the
3662         * same refname as any existing ones.)
3663         */
3664        for (i = 0; i < transaction->nr; i++) {
3665                struct ref_update *update = transaction->updates[i];
3666                struct string_list_item *item =
3667                        string_list_append(&affected_refnames, update->refname);
3668
3669                /*
3670                 * We store a pointer to update in item->util, but at
3671                 * the moment we never use the value of this field
3672                 * except to check whether it is non-NULL.
3673                 */
3674                item->util = update;
3675        }
3676        string_list_sort(&affected_refnames);
3677        if (ref_update_reject_duplicates(&affected_refnames, err)) {
3678                ret = TRANSACTION_GENERIC_ERROR;
3679                goto cleanup;
3680        }
3681
3682        /*
3683         * Special hack: If a branch is updated directly and HEAD
3684         * points to it (may happen on the remote side of a push
3685         * for example) then logically the HEAD reflog should be
3686         * updated too.
3687         *
3688         * A generic solution would require reverse symref lookups,
3689         * but finding all symrefs pointing to a given branch would be
3690         * rather costly for this rare event (the direct update of a
3691         * branch) to be worth it. So let's cheat and check with HEAD
3692         * only, which should cover 99% of all usage scenarios (even
3693         * 100% of the default ones).
3694         *
3695         * So if HEAD is a symbolic reference, then record the name of
3696         * the reference that it points to. If we see an update of
3697         * head_ref within the transaction, then split_head_update()
3698         * arranges for the reflog of HEAD to be updated, too.
3699         */
3700        head_ref = resolve_refdup("HEAD", RESOLVE_REF_NO_RECURSE,
3701                                  head_oid.hash, &head_type);
3702
3703        if (head_ref && !(head_type & REF_ISSYMREF)) {
3704                free(head_ref);
3705                head_ref = NULL;
3706        }
3707
3708        /*
3709         * Acquire all locks, verify old values if provided, check
3710         * that new values are valid, and write new values to the
3711         * lockfiles, ready to be activated. Only keep one lockfile
3712         * open at a time to avoid running out of file descriptors.
3713         */
3714        for (i = 0; i < transaction->nr; i++) {
3715                struct ref_update *update = transaction->updates[i];
3716
3717                ret = lock_ref_for_update(update, transaction, head_ref,
3718                                          &affected_refnames, err);
3719                if (ret)
3720                        goto cleanup;
3721        }
3722
3723        /* Perform updates first so live commits remain referenced */
3724        for (i = 0; i < transaction->nr; i++) {
3725                struct ref_update *update = transaction->updates[i];
3726                struct ref_lock *lock = update->lock;
3727
3728                if (update->flags & REF_NEEDS_COMMIT ||
3729                    update->flags & REF_LOG_ONLY) {
3730                        if (log_ref_write(lock->ref_name, lock->old_oid.hash,
3731                                          update->new_sha1,
3732                                          update->msg, update->flags, err)) {
3733                                char *old_msg = strbuf_detach(err, NULL);
3734
3735                                strbuf_addf(err, "cannot update the ref '%s': %s",
3736                                            lock->ref_name, old_msg);
3737                                free(old_msg);
3738                                unlock_ref(lock);
3739                                update->lock = NULL;
3740                                ret = TRANSACTION_GENERIC_ERROR;
3741                                goto cleanup;
3742                        }
3743                }
3744                if (update->flags & REF_NEEDS_COMMIT) {
3745                        clear_loose_ref_cache(refs);
3746                        if (commit_ref(lock)) {
3747                                strbuf_addf(err, "couldn't set '%s'", lock->ref_name);
3748                                unlock_ref(lock);
3749                                update->lock = NULL;
3750                                ret = TRANSACTION_GENERIC_ERROR;
3751                                goto cleanup;
3752                        }
3753                }
3754        }
3755        /* Perform deletes now that updates are safely completed */
3756        for (i = 0; i < transaction->nr; i++) {
3757                struct ref_update *update = transaction->updates[i];
3758
3759                if (update->flags & REF_DELETING &&
3760                    !(update->flags & REF_LOG_ONLY)) {
3761                        if (delete_ref_loose(update->lock, update->type, err)) {
3762                                ret = TRANSACTION_GENERIC_ERROR;
3763                                goto cleanup;
3764                        }
3765
3766                        if (!(update->flags & REF_ISPRUNING))
3767                                string_list_append(&refs_to_delete,
3768                                                   update->lock->ref_name);
3769                }
3770        }
3771
3772        if (repack_without_refs(&refs_to_delete, err)) {
3773                ret = TRANSACTION_GENERIC_ERROR;
3774                goto cleanup;
3775        }
3776        for_each_string_list_item(ref_to_delete, &refs_to_delete)
3777                unlink_or_warn(git_path("logs/%s", ref_to_delete->string));
3778        clear_loose_ref_cache(refs);
3779
3780cleanup:
3781        transaction->state = REF_TRANSACTION_CLOSED;
3782
3783        for (i = 0; i < transaction->nr; i++)
3784                if (transaction->updates[i]->lock)
3785                        unlock_ref(transaction->updates[i]->lock);
3786        string_list_clear(&refs_to_delete, 0);
3787        free(head_ref);
3788        string_list_clear(&affected_refnames, 0);
3789
3790        return ret;
3791}
3792
3793static int ref_present(const char *refname,
3794                       const struct object_id *oid, int flags, void *cb_data)
3795{
3796        struct string_list *affected_refnames = cb_data;
3797
3798        return string_list_has_string(affected_refnames, refname);
3799}
3800
3801int initial_ref_transaction_commit(struct ref_transaction *transaction,
3802                                   struct strbuf *err)
3803{
3804        struct files_ref_store *refs =
3805                get_files_ref_store(NULL, "initial_ref_transaction_commit");
3806        int ret = 0, i;
3807        struct string_list affected_refnames = STRING_LIST_INIT_NODUP;
3808
3809        assert(err);
3810
3811        if (transaction->state != REF_TRANSACTION_OPEN)
3812                die("BUG: commit called for transaction that is not open");
3813
3814        /* Fail if a refname appears more than once in the transaction: */
3815        for (i = 0; i < transaction->nr; i++)
3816                string_list_append(&affected_refnames,
3817                                   transaction->updates[i]->refname);
3818        string_list_sort(&affected_refnames);
3819        if (ref_update_reject_duplicates(&affected_refnames, err)) {
3820                ret = TRANSACTION_GENERIC_ERROR;
3821                goto cleanup;
3822        }
3823
3824        /*
3825         * It's really undefined to call this function in an active
3826         * repository or when there are existing references: we are
3827         * only locking and changing packed-refs, so (1) any
3828         * simultaneous processes might try to change a reference at
3829         * the same time we do, and (2) any existing loose versions of
3830         * the references that we are setting would have precedence
3831         * over our values. But some remote helpers create the remote
3832         * "HEAD" and "master" branches before calling this function,
3833         * so here we really only check that none of the references
3834         * that we are creating already exists.
3835         */
3836        if (for_each_rawref(ref_present, &affected_refnames))
3837                die("BUG: initial ref transaction called with existing refs");
3838
3839        for (i = 0; i < transaction->nr; i++) {
3840                struct ref_update *update = transaction->updates[i];
3841
3842                if ((update->flags & REF_HAVE_OLD) &&
3843                    !is_null_sha1(update->old_sha1))
3844                        die("BUG: initial ref transaction with old_sha1 set");
3845                if (verify_refname_available(update->refname,
3846                                             &affected_refnames, NULL,
3847                                             err)) {
3848                        ret = TRANSACTION_NAME_CONFLICT;
3849                        goto cleanup;
3850                }
3851        }
3852
3853        if (lock_packed_refs(refs, 0)) {
3854                strbuf_addf(err, "unable to lock packed-refs file: %s",
3855                            strerror(errno));
3856                ret = TRANSACTION_GENERIC_ERROR;
3857                goto cleanup;
3858        }
3859
3860        for (i = 0; i < transaction->nr; i++) {
3861                struct ref_update *update = transaction->updates[i];
3862
3863                if ((update->flags & REF_HAVE_NEW) &&
3864                    !is_null_sha1(update->new_sha1))
3865                        add_packed_ref(refs, update->refname, update->new_sha1);
3866        }
3867
3868        if (commit_packed_refs(refs)) {
3869                strbuf_addf(err, "unable to commit packed-refs file: %s",
3870                            strerror(errno));
3871                ret = TRANSACTION_GENERIC_ERROR;
3872                goto cleanup;
3873        }
3874
3875cleanup:
3876        transaction->state = REF_TRANSACTION_CLOSED;
3877        string_list_clear(&affected_refnames, 0);
3878        return ret;
3879}
3880
3881struct expire_reflog_cb {
3882        unsigned int flags;
3883        reflog_expiry_should_prune_fn *should_prune_fn;
3884        void *policy_cb;
3885        FILE *newlog;
3886        unsigned char last_kept_sha1[20];
3887};
3888
3889static int expire_reflog_ent(unsigned char *osha1, unsigned char *nsha1,
3890                             const char *email, unsigned long timestamp, int tz,
3891                             const char *message, void *cb_data)
3892{
3893        struct expire_reflog_cb *cb = cb_data;
3894        struct expire_reflog_policy_cb *policy_cb = cb->policy_cb;
3895
3896        if (cb->flags & EXPIRE_REFLOGS_REWRITE)
3897                osha1 = cb->last_kept_sha1;
3898
3899        if ((*cb->should_prune_fn)(osha1, nsha1, email, timestamp, tz,
3900                                   message, policy_cb)) {
3901                if (!cb->newlog)
3902                        printf("would prune %s", message);
3903                else if (cb->flags & EXPIRE_REFLOGS_VERBOSE)
3904                        printf("prune %s", message);
3905        } else {
3906                if (cb->newlog) {
3907                        fprintf(cb->newlog, "%s %s %s %lu %+05d\t%s",
3908                                sha1_to_hex(osha1), sha1_to_hex(nsha1),
3909                                email, timestamp, tz, message);
3910                        hashcpy(cb->last_kept_sha1, nsha1);
3911                }
3912                if (cb->flags & EXPIRE_REFLOGS_VERBOSE)
3913                        printf("keep %s", message);
3914        }
3915        return 0;
3916}
3917
3918int reflog_expire(const char *refname, const unsigned char *sha1,
3919                 unsigned int flags,
3920                 reflog_expiry_prepare_fn prepare_fn,
3921                 reflog_expiry_should_prune_fn should_prune_fn,
3922                 reflog_expiry_cleanup_fn cleanup_fn,
3923                 void *policy_cb_data)
3924{
3925        static struct lock_file reflog_lock;
3926        struct expire_reflog_cb cb;
3927        struct ref_lock *lock;
3928        char *log_file;
3929        int status = 0;
3930        int type;
3931        struct strbuf err = STRBUF_INIT;
3932
3933        memset(&cb, 0, sizeof(cb));
3934        cb.flags = flags;
3935        cb.policy_cb = policy_cb_data;
3936        cb.should_prune_fn = should_prune_fn;
3937
3938        /*
3939         * The reflog file is locked by holding the lock on the
3940         * reference itself, plus we might need to update the
3941         * reference if --updateref was specified:
3942         */
3943        lock = lock_ref_sha1_basic(refname, sha1, NULL, NULL, REF_NODEREF,
3944                                   &type, &err);
3945        if (!lock) {
3946                error("cannot lock ref '%s': %s", refname, err.buf);
3947                strbuf_release(&err);
3948                return -1;
3949        }
3950        if (!reflog_exists(refname)) {
3951                unlock_ref(lock);
3952                return 0;
3953        }
3954
3955        log_file = git_pathdup("logs/%s", refname);
3956        if (!(flags & EXPIRE_REFLOGS_DRY_RUN)) {
3957                /*
3958                 * Even though holding $GIT_DIR/logs/$reflog.lock has
3959                 * no locking implications, we use the lock_file
3960                 * machinery here anyway because it does a lot of the
3961                 * work we need, including cleaning up if the program
3962                 * exits unexpectedly.
3963                 */
3964                if (hold_lock_file_for_update(&reflog_lock, log_file, 0) < 0) {
3965                        struct strbuf err = STRBUF_INIT;
3966                        unable_to_lock_message(log_file, errno, &err);
3967                        error("%s", err.buf);
3968                        strbuf_release(&err);
3969                        goto failure;
3970                }
3971                cb.newlog = fdopen_lock_file(&reflog_lock, "w");
3972                if (!cb.newlog) {
3973                        error("cannot fdopen %s (%s)",
3974                              get_lock_file_path(&reflog_lock), strerror(errno));
3975                        goto failure;
3976                }
3977        }
3978
3979        (*prepare_fn)(refname, sha1, cb.policy_cb);
3980        for_each_reflog_ent(refname, expire_reflog_ent, &cb);
3981        (*cleanup_fn)(cb.policy_cb);
3982
3983        if (!(flags & EXPIRE_REFLOGS_DRY_RUN)) {
3984                /*
3985                 * It doesn't make sense to adjust a reference pointed
3986                 * to by a symbolic ref based on expiring entries in
3987                 * the symbolic reference's reflog. Nor can we update
3988                 * a reference if there are no remaining reflog
3989                 * entries.
3990                 */
3991                int update = (flags & EXPIRE_REFLOGS_UPDATE_REF) &&
3992                        !(type & REF_ISSYMREF) &&
3993                        !is_null_sha1(cb.last_kept_sha1);
3994
3995                if (close_lock_file(&reflog_lock)) {
3996                        status |= error("couldn't write %s: %s", log_file,
3997                                        strerror(errno));
3998                } else if (update &&
3999                           (write_in_full(get_lock_file_fd(lock->lk),
4000                                sha1_to_hex(cb.last_kept_sha1), 40) != 40 ||
4001                            write_str_in_full(get_lock_file_fd(lock->lk), "\n") != 1 ||
4002                            close_ref(lock) < 0)) {
4003                        status |= error("couldn't write %s",
4004                                        get_lock_file_path(lock->lk));
4005                        rollback_lock_file(&reflog_lock);
4006                } else if (commit_lock_file(&reflog_lock)) {
4007                        status |= error("unable to write reflog '%s' (%s)",
4008                                        log_file, strerror(errno));
4009                } else if (update && commit_ref(lock)) {
4010                        status |= error("couldn't set %s", lock->ref_name);
4011                }
4012        }
4013        free(log_file);
4014        unlock_ref(lock);
4015        return status;
4016
4017 failure:
4018        rollback_lock_file(&reflog_lock);
4019        free(log_file);
4020        unlock_ref(lock);
4021        return -1;
4022}
4023
4024struct ref_storage_be refs_be_files = {
4025        NULL,
4026        "files",
4027        files_ref_store_create,
4028        files_transaction_commit,
4029
4030        files_pack_refs,
4031        files_peel_ref,
4032        files_create_symref,
4033
4034        files_read_raw_ref,
4035        files_verify_refname_available
4036};