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