refs.con commit git-remote-testpy: fix path hashing on Python 3 (3ac221a)
   1#include "cache.h"
   2#include "refs.h"
   3#include "object.h"
   4#include "tag.h"
   5#include "dir.h"
   6
   7/*
   8 * Make sure "ref" is something reasonable to have under ".git/refs/";
   9 * We do not like it if:
  10 *
  11 * - any path component of it begins with ".", or
  12 * - it has double dots "..", or
  13 * - it has ASCII control character, "~", "^", ":" or SP, anywhere, or
  14 * - it ends with a "/".
  15 * - it ends with ".lock"
  16 * - it contains a "\" (backslash)
  17 */
  18
  19/* Return true iff ch is not allowed in reference names. */
  20static inline int bad_ref_char(int ch)
  21{
  22        if (((unsigned) ch) <= ' ' || ch == 0x7f ||
  23            ch == '~' || ch == '^' || ch == ':' || ch == '\\')
  24                return 1;
  25        /* 2.13 Pattern Matching Notation */
  26        if (ch == '*' || ch == '?' || ch == '[') /* Unsupported */
  27                return 1;
  28        return 0;
  29}
  30
  31/*
  32 * Try to read one refname component from the front of refname.  Return
  33 * the length of the component found, or -1 if the component is not
  34 * legal.
  35 */
  36static int check_refname_component(const char *refname, int flags)
  37{
  38        const char *cp;
  39        char last = '\0';
  40
  41        for (cp = refname; ; cp++) {
  42                char ch = *cp;
  43                if (ch == '\0' || ch == '/')
  44                        break;
  45                if (bad_ref_char(ch))
  46                        return -1; /* Illegal character in refname. */
  47                if (last == '.' && ch == '.')
  48                        return -1; /* Refname contains "..". */
  49                if (last == '@' && ch == '{')
  50                        return -1; /* Refname contains "@{". */
  51                last = ch;
  52        }
  53        if (cp == refname)
  54                return 0; /* Component has zero length. */
  55        if (refname[0] == '.') {
  56                if (!(flags & REFNAME_DOT_COMPONENT))
  57                        return -1; /* Component starts with '.'. */
  58                /*
  59                 * Even if leading dots are allowed, don't allow "."
  60                 * as a component (".." is prevented by a rule above).
  61                 */
  62                if (refname[1] == '\0')
  63                        return -1; /* Component equals ".". */
  64        }
  65        if (cp - refname >= 5 && !memcmp(cp - 5, ".lock", 5))
  66                return -1; /* Refname ends with ".lock". */
  67        return cp - refname;
  68}
  69
  70int check_refname_format(const char *refname, int flags)
  71{
  72        int component_len, component_count = 0;
  73
  74        while (1) {
  75                /* We are at the start of a path component. */
  76                component_len = check_refname_component(refname, flags);
  77                if (component_len <= 0) {
  78                        if ((flags & REFNAME_REFSPEC_PATTERN) &&
  79                                        refname[0] == '*' &&
  80                                        (refname[1] == '\0' || refname[1] == '/')) {
  81                                /* Accept one wildcard as a full refname component. */
  82                                flags &= ~REFNAME_REFSPEC_PATTERN;
  83                                component_len = 1;
  84                        } else {
  85                                return -1;
  86                        }
  87                }
  88                component_count++;
  89                if (refname[component_len] == '\0')
  90                        break;
  91                /* Skip to next component. */
  92                refname += component_len + 1;
  93        }
  94
  95        if (refname[component_len - 1] == '.')
  96                return -1; /* Refname ends with '.'. */
  97        if (!(flags & REFNAME_ALLOW_ONELEVEL) && component_count < 2)
  98                return -1; /* Refname has only one component. */
  99        return 0;
 100}
 101
 102struct ref_entry;
 103
 104/*
 105 * Information used (along with the information in ref_entry) to
 106 * describe a single cached reference.  This data structure only
 107 * occurs embedded in a union in struct ref_entry, and only when
 108 * (ref_entry->flag & REF_DIR) is zero.
 109 */
 110struct ref_value {
 111        unsigned char sha1[20];
 112        unsigned char peeled[20];
 113};
 114
 115struct ref_cache;
 116
 117/*
 118 * Information used (along with the information in ref_entry) to
 119 * describe a level in the hierarchy of references.  This data
 120 * structure only occurs embedded in a union in struct ref_entry, and
 121 * only when (ref_entry.flag & REF_DIR) is set.  In that case,
 122 * (ref_entry.flag & REF_INCOMPLETE) determines whether the references
 123 * in the directory have already been read:
 124 *
 125 *     (ref_entry.flag & REF_INCOMPLETE) unset -- a directory of loose
 126 *         or packed references, already read.
 127 *
 128 *     (ref_entry.flag & REF_INCOMPLETE) set -- a directory of loose
 129 *         references that hasn't been read yet (nor has any of its
 130 *         subdirectories).
 131 *
 132 * Entries within a directory are stored within a growable array of
 133 * pointers to ref_entries (entries, nr, alloc).  Entries 0 <= i <
 134 * sorted are sorted by their component name in strcmp() order and the
 135 * remaining entries are unsorted.
 136 *
 137 * Loose references are read lazily, one directory at a time.  When a
 138 * directory of loose references is read, then all of the references
 139 * in that directory are stored, and REF_INCOMPLETE stubs are created
 140 * for any subdirectories, but the subdirectories themselves are not
 141 * read.  The reading is triggered by get_ref_dir().
 142 */
 143struct ref_dir {
 144        int nr, alloc;
 145
 146        /*
 147         * Entries with index 0 <= i < sorted are sorted by name.  New
 148         * entries are appended to the list unsorted, and are sorted
 149         * only when required; thus we avoid the need to sort the list
 150         * after the addition of every reference.
 151         */
 152        int sorted;
 153
 154        /* A pointer to the ref_cache that contains this ref_dir. */
 155        struct ref_cache *ref_cache;
 156
 157        struct ref_entry **entries;
 158};
 159
 160/* ISSYMREF=0x01, ISPACKED=0x02, and ISBROKEN=0x04 are public interfaces */
 161#define REF_KNOWS_PEELED 0x08
 162
 163/* ref_entry represents a directory of references */
 164#define REF_DIR 0x10
 165
 166/*
 167 * Entry has not yet been read from disk (used only for REF_DIR
 168 * entries representing loose references)
 169 */
 170#define REF_INCOMPLETE 0x20
 171
 172/*
 173 * A ref_entry represents either a reference or a "subdirectory" of
 174 * references.
 175 *
 176 * Each directory in the reference namespace is represented by a
 177 * ref_entry with (flags & REF_DIR) set and containing a subdir member
 178 * that holds the entries in that directory that have been read so
 179 * far.  If (flags & REF_INCOMPLETE) is set, then the directory and
 180 * its subdirectories haven't been read yet.  REF_INCOMPLETE is only
 181 * used for loose reference directories.
 182 *
 183 * References are represented by a ref_entry with (flags & REF_DIR)
 184 * unset and a value member that describes the reference's value.  The
 185 * flag member is at the ref_entry level, but it is also needed to
 186 * interpret the contents of the value field (in other words, a
 187 * ref_value object is not very much use without the enclosing
 188 * ref_entry).
 189 *
 190 * Reference names cannot end with slash and directories' names are
 191 * always stored with a trailing slash (except for the top-level
 192 * directory, which is always denoted by "").  This has two nice
 193 * consequences: (1) when the entries in each subdir are sorted
 194 * lexicographically by name (as they usually are), the references in
 195 * a whole tree can be generated in lexicographic order by traversing
 196 * the tree in left-to-right, depth-first order; (2) the names of
 197 * references and subdirectories cannot conflict, and therefore the
 198 * presence of an empty subdirectory does not block the creation of a
 199 * similarly-named reference.  (The fact that reference names with the
 200 * same leading components can conflict *with each other* is a
 201 * separate issue that is regulated by is_refname_available().)
 202 *
 203 * Please note that the name field contains the fully-qualified
 204 * reference (or subdirectory) name.  Space could be saved by only
 205 * storing the relative names.  But that would require the full names
 206 * to be generated on the fly when iterating in do_for_each_ref(), and
 207 * would break callback functions, who have always been able to assume
 208 * that the name strings that they are passed will not be freed during
 209 * the iteration.
 210 */
 211struct ref_entry {
 212        unsigned char flag; /* ISSYMREF? ISPACKED? */
 213        union {
 214                struct ref_value value; /* if not (flags&REF_DIR) */
 215                struct ref_dir subdir; /* if (flags&REF_DIR) */
 216        } u;
 217        /*
 218         * The full name of the reference (e.g., "refs/heads/master")
 219         * or the full name of the directory with a trailing slash
 220         * (e.g., "refs/heads/"):
 221         */
 222        char name[FLEX_ARRAY];
 223};
 224
 225static void read_loose_refs(const char *dirname, struct ref_dir *dir);
 226
 227static struct ref_dir *get_ref_dir(struct ref_entry *entry)
 228{
 229        struct ref_dir *dir;
 230        assert(entry->flag & REF_DIR);
 231        dir = &entry->u.subdir;
 232        if (entry->flag & REF_INCOMPLETE) {
 233                read_loose_refs(entry->name, dir);
 234                entry->flag &= ~REF_INCOMPLETE;
 235        }
 236        return dir;
 237}
 238
 239static struct ref_entry *create_ref_entry(const char *refname,
 240                                          const unsigned char *sha1, int flag,
 241                                          int check_name)
 242{
 243        int len;
 244        struct ref_entry *ref;
 245
 246        if (check_name &&
 247            check_refname_format(refname, REFNAME_ALLOW_ONELEVEL|REFNAME_DOT_COMPONENT))
 248                die("Reference has invalid format: '%s'", refname);
 249        len = strlen(refname) + 1;
 250        ref = xmalloc(sizeof(struct ref_entry) + len);
 251        hashcpy(ref->u.value.sha1, sha1);
 252        hashclr(ref->u.value.peeled);
 253        memcpy(ref->name, refname, len);
 254        ref->flag = flag;
 255        return ref;
 256}
 257
 258static void clear_ref_dir(struct ref_dir *dir);
 259
 260static void free_ref_entry(struct ref_entry *entry)
 261{
 262        if (entry->flag & REF_DIR) {
 263                /*
 264                 * Do not use get_ref_dir() here, as that might
 265                 * trigger the reading of loose refs.
 266                 */
 267                clear_ref_dir(&entry->u.subdir);
 268        }
 269        free(entry);
 270}
 271
 272/*
 273 * Add a ref_entry to the end of dir (unsorted).  Entry is always
 274 * stored directly in dir; no recursion into subdirectories is
 275 * done.
 276 */
 277static void add_entry_to_dir(struct ref_dir *dir, struct ref_entry *entry)
 278{
 279        ALLOC_GROW(dir->entries, dir->nr + 1, dir->alloc);
 280        dir->entries[dir->nr++] = entry;
 281        /* optimize for the case that entries are added in order */
 282        if (dir->nr == 1 ||
 283            (dir->nr == dir->sorted + 1 &&
 284             strcmp(dir->entries[dir->nr - 2]->name,
 285                    dir->entries[dir->nr - 1]->name) < 0))
 286                dir->sorted = dir->nr;
 287}
 288
 289/*
 290 * Clear and free all entries in dir, recursively.
 291 */
 292static void clear_ref_dir(struct ref_dir *dir)
 293{
 294        int i;
 295        for (i = 0; i < dir->nr; i++)
 296                free_ref_entry(dir->entries[i]);
 297        free(dir->entries);
 298        dir->sorted = dir->nr = dir->alloc = 0;
 299        dir->entries = NULL;
 300}
 301
 302/*
 303 * Create a struct ref_entry object for the specified dirname.
 304 * dirname is the name of the directory with a trailing slash (e.g.,
 305 * "refs/heads/") or "" for the top-level directory.
 306 */
 307static struct ref_entry *create_dir_entry(struct ref_cache *ref_cache,
 308                                          const char *dirname, size_t len,
 309                                          int incomplete)
 310{
 311        struct ref_entry *direntry;
 312        direntry = xcalloc(1, sizeof(struct ref_entry) + len + 1);
 313        memcpy(direntry->name, dirname, len);
 314        direntry->name[len] = '\0';
 315        direntry->u.subdir.ref_cache = ref_cache;
 316        direntry->flag = REF_DIR | (incomplete ? REF_INCOMPLETE : 0);
 317        return direntry;
 318}
 319
 320static int ref_entry_cmp(const void *a, const void *b)
 321{
 322        struct ref_entry *one = *(struct ref_entry **)a;
 323        struct ref_entry *two = *(struct ref_entry **)b;
 324        return strcmp(one->name, two->name);
 325}
 326
 327static void sort_ref_dir(struct ref_dir *dir);
 328
 329struct string_slice {
 330        size_t len;
 331        const char *str;
 332};
 333
 334static int ref_entry_cmp_sslice(const void *key_, const void *ent_)
 335{
 336        struct string_slice *key = (struct string_slice *)key_;
 337        struct ref_entry *ent = *(struct ref_entry **)ent_;
 338        int entlen = strlen(ent->name);
 339        int cmplen = key->len < entlen ? key->len : entlen;
 340        int cmp = memcmp(key->str, ent->name, cmplen);
 341        if (cmp)
 342                return cmp;
 343        return key->len - entlen;
 344}
 345
 346/*
 347 * Return the entry with the given refname from the ref_dir
 348 * (non-recursively), sorting dir if necessary.  Return NULL if no
 349 * such entry is found.  dir must already be complete.
 350 */
 351static struct ref_entry *search_ref_dir(struct ref_dir *dir,
 352                                        const char *refname, size_t len)
 353{
 354        struct ref_entry **r;
 355        struct string_slice key;
 356
 357        if (refname == NULL || !dir->nr)
 358                return NULL;
 359
 360        sort_ref_dir(dir);
 361        key.len = len;
 362        key.str = refname;
 363        r = bsearch(&key, dir->entries, dir->nr, sizeof(*dir->entries),
 364                    ref_entry_cmp_sslice);
 365
 366        if (r == NULL)
 367                return NULL;
 368
 369        return *r;
 370}
 371
 372/*
 373 * Search for a directory entry directly within dir (without
 374 * recursing).  Sort dir if necessary.  subdirname must be a directory
 375 * name (i.e., end in '/').  If mkdir is set, then create the
 376 * directory if it is missing; otherwise, return NULL if the desired
 377 * directory cannot be found.  dir must already be complete.
 378 */
 379static struct ref_dir *search_for_subdir(struct ref_dir *dir,
 380                                         const char *subdirname, size_t len,
 381                                         int mkdir)
 382{
 383        struct ref_entry *entry = search_ref_dir(dir, subdirname, len);
 384        if (!entry) {
 385                if (!mkdir)
 386                        return NULL;
 387                /*
 388                 * Since dir is complete, the absence of a subdir
 389                 * means that the subdir really doesn't exist;
 390                 * therefore, create an empty record for it but mark
 391                 * the record complete.
 392                 */
 393                entry = create_dir_entry(dir->ref_cache, subdirname, len, 0);
 394                add_entry_to_dir(dir, entry);
 395        }
 396        return get_ref_dir(entry);
 397}
 398
 399/*
 400 * If refname is a reference name, find the ref_dir within the dir
 401 * tree that should hold refname.  If refname is a directory name
 402 * (i.e., ends in '/'), then return that ref_dir itself.  dir must
 403 * represent the top-level directory and must already be complete.
 404 * Sort ref_dirs and recurse into subdirectories as necessary.  If
 405 * mkdir is set, then create any missing directories; otherwise,
 406 * return NULL if the desired directory cannot be found.
 407 */
 408static struct ref_dir *find_containing_dir(struct ref_dir *dir,
 409                                           const char *refname, int mkdir)
 410{
 411        const char *slash;
 412        for (slash = strchr(refname, '/'); slash; slash = strchr(slash + 1, '/')) {
 413                size_t dirnamelen = slash - refname + 1;
 414                struct ref_dir *subdir;
 415                subdir = search_for_subdir(dir, refname, dirnamelen, mkdir);
 416                if (!subdir) {
 417                        dir = NULL;
 418                        break;
 419                }
 420                dir = subdir;
 421        }
 422
 423        return dir;
 424}
 425
 426/*
 427 * Find the value entry with the given name in dir, sorting ref_dirs
 428 * and recursing into subdirectories as necessary.  If the name is not
 429 * found or it corresponds to a directory entry, return NULL.
 430 */
 431static struct ref_entry *find_ref(struct ref_dir *dir, const char *refname)
 432{
 433        struct ref_entry *entry;
 434        dir = find_containing_dir(dir, refname, 0);
 435        if (!dir)
 436                return NULL;
 437        entry = search_ref_dir(dir, refname, strlen(refname));
 438        return (entry && !(entry->flag & REF_DIR)) ? entry : NULL;
 439}
 440
 441/*
 442 * Add a ref_entry to the ref_dir (unsorted), recursing into
 443 * subdirectories as necessary.  dir must represent the top-level
 444 * directory.  Return 0 on success.
 445 */
 446static int add_ref(struct ref_dir *dir, struct ref_entry *ref)
 447{
 448        dir = find_containing_dir(dir, ref->name, 1);
 449        if (!dir)
 450                return -1;
 451        add_entry_to_dir(dir, ref);
 452        return 0;
 453}
 454
 455/*
 456 * Emit a warning and return true iff ref1 and ref2 have the same name
 457 * and the same sha1.  Die if they have the same name but different
 458 * sha1s.
 459 */
 460static int is_dup_ref(const struct ref_entry *ref1, const struct ref_entry *ref2)
 461{
 462        if (strcmp(ref1->name, ref2->name))
 463                return 0;
 464
 465        /* Duplicate name; make sure that they don't conflict: */
 466
 467        if ((ref1->flag & REF_DIR) || (ref2->flag & REF_DIR))
 468                /* This is impossible by construction */
 469                die("Reference directory conflict: %s", ref1->name);
 470
 471        if (hashcmp(ref1->u.value.sha1, ref2->u.value.sha1))
 472                die("Duplicated ref, and SHA1s don't match: %s", ref1->name);
 473
 474        warning("Duplicated ref: %s", ref1->name);
 475        return 1;
 476}
 477
 478/*
 479 * Sort the entries in dir non-recursively (if they are not already
 480 * sorted) and remove any duplicate entries.
 481 */
 482static void sort_ref_dir(struct ref_dir *dir)
 483{
 484        int i, j;
 485        struct ref_entry *last = NULL;
 486
 487        /*
 488         * This check also prevents passing a zero-length array to qsort(),
 489         * which is a problem on some platforms.
 490         */
 491        if (dir->sorted == dir->nr)
 492                return;
 493
 494        qsort(dir->entries, dir->nr, sizeof(*dir->entries), ref_entry_cmp);
 495
 496        /* Remove any duplicates: */
 497        for (i = 0, j = 0; j < dir->nr; j++) {
 498                struct ref_entry *entry = dir->entries[j];
 499                if (last && is_dup_ref(last, entry))
 500                        free_ref_entry(entry);
 501                else
 502                        last = dir->entries[i++] = entry;
 503        }
 504        dir->sorted = dir->nr = i;
 505}
 506
 507#define DO_FOR_EACH_INCLUDE_BROKEN 01
 508
 509static struct ref_entry *current_ref;
 510
 511static int do_one_ref(const char *base, each_ref_fn fn, int trim,
 512                      int flags, void *cb_data, struct ref_entry *entry)
 513{
 514        int retval;
 515        if (prefixcmp(entry->name, base))
 516                return 0;
 517
 518        if (!(flags & DO_FOR_EACH_INCLUDE_BROKEN)) {
 519                if (entry->flag & REF_ISBROKEN)
 520                        return 0; /* ignore broken refs e.g. dangling symref */
 521                if (!has_sha1_file(entry->u.value.sha1)) {
 522                        error("%s does not point to a valid object!", entry->name);
 523                        return 0;
 524                }
 525        }
 526        current_ref = entry;
 527        retval = fn(entry->name + trim, entry->u.value.sha1, entry->flag, cb_data);
 528        current_ref = NULL;
 529        return retval;
 530}
 531
 532/*
 533 * Call fn for each reference in dir that has index in the range
 534 * offset <= index < dir->nr.  Recurse into subdirectories that are in
 535 * that index range, sorting them before iterating.  This function
 536 * does not sort dir itself; it should be sorted beforehand.
 537 */
 538static int do_for_each_ref_in_dir(struct ref_dir *dir, int offset,
 539                                  const char *base,
 540                                  each_ref_fn fn, int trim, int flags, void *cb_data)
 541{
 542        int i;
 543        assert(dir->sorted == dir->nr);
 544        for (i = offset; i < dir->nr; i++) {
 545                struct ref_entry *entry = dir->entries[i];
 546                int retval;
 547                if (entry->flag & REF_DIR) {
 548                        struct ref_dir *subdir = get_ref_dir(entry);
 549                        sort_ref_dir(subdir);
 550                        retval = do_for_each_ref_in_dir(subdir, 0,
 551                                                        base, fn, trim, flags, cb_data);
 552                } else {
 553                        retval = do_one_ref(base, fn, trim, flags, cb_data, entry);
 554                }
 555                if (retval)
 556                        return retval;
 557        }
 558        return 0;
 559}
 560
 561/*
 562 * Call fn for each reference in the union of dir1 and dir2, in order
 563 * by refname.  Recurse into subdirectories.  If a value entry appears
 564 * in both dir1 and dir2, then only process the version that is in
 565 * dir2.  The input dirs must already be sorted, but subdirs will be
 566 * sorted as needed.
 567 */
 568static int do_for_each_ref_in_dirs(struct ref_dir *dir1,
 569                                   struct ref_dir *dir2,
 570                                   const char *base, each_ref_fn fn, int trim,
 571                                   int flags, void *cb_data)
 572{
 573        int retval;
 574        int i1 = 0, i2 = 0;
 575
 576        assert(dir1->sorted == dir1->nr);
 577        assert(dir2->sorted == dir2->nr);
 578        while (1) {
 579                struct ref_entry *e1, *e2;
 580                int cmp;
 581                if (i1 == dir1->nr) {
 582                        return do_for_each_ref_in_dir(dir2, i2,
 583                                                      base, fn, trim, flags, cb_data);
 584                }
 585                if (i2 == dir2->nr) {
 586                        return do_for_each_ref_in_dir(dir1, i1,
 587                                                      base, fn, trim, flags, cb_data);
 588                }
 589                e1 = dir1->entries[i1];
 590                e2 = dir2->entries[i2];
 591                cmp = strcmp(e1->name, e2->name);
 592                if (cmp == 0) {
 593                        if ((e1->flag & REF_DIR) && (e2->flag & REF_DIR)) {
 594                                /* Both are directories; descend them in parallel. */
 595                                struct ref_dir *subdir1 = get_ref_dir(e1);
 596                                struct ref_dir *subdir2 = get_ref_dir(e2);
 597                                sort_ref_dir(subdir1);
 598                                sort_ref_dir(subdir2);
 599                                retval = do_for_each_ref_in_dirs(
 600                                                subdir1, subdir2,
 601                                                base, fn, trim, flags, cb_data);
 602                                i1++;
 603                                i2++;
 604                        } else if (!(e1->flag & REF_DIR) && !(e2->flag & REF_DIR)) {
 605                                /* Both are references; ignore the one from dir1. */
 606                                retval = do_one_ref(base, fn, trim, flags, cb_data, e2);
 607                                i1++;
 608                                i2++;
 609                        } else {
 610                                die("conflict between reference and directory: %s",
 611                                    e1->name);
 612                        }
 613                } else {
 614                        struct ref_entry *e;
 615                        if (cmp < 0) {
 616                                e = e1;
 617                                i1++;
 618                        } else {
 619                                e = e2;
 620                                i2++;
 621                        }
 622                        if (e->flag & REF_DIR) {
 623                                struct ref_dir *subdir = get_ref_dir(e);
 624                                sort_ref_dir(subdir);
 625                                retval = do_for_each_ref_in_dir(
 626                                                subdir, 0,
 627                                                base, fn, trim, flags, cb_data);
 628                        } else {
 629                                retval = do_one_ref(base, fn, trim, flags, cb_data, e);
 630                        }
 631                }
 632                if (retval)
 633                        return retval;
 634        }
 635        if (i1 < dir1->nr)
 636                return do_for_each_ref_in_dir(dir1, i1,
 637                                              base, fn, trim, flags, cb_data);
 638        if (i2 < dir2->nr)
 639                return do_for_each_ref_in_dir(dir2, i2,
 640                                              base, fn, trim, flags, cb_data);
 641        return 0;
 642}
 643
 644/*
 645 * Return true iff refname1 and refname2 conflict with each other.
 646 * Two reference names conflict if one of them exactly matches the
 647 * leading components of the other; e.g., "foo/bar" conflicts with
 648 * both "foo" and with "foo/bar/baz" but not with "foo/bar" or
 649 * "foo/barbados".
 650 */
 651static int names_conflict(const char *refname1, const char *refname2)
 652{
 653        for (; *refname1 && *refname1 == *refname2; refname1++, refname2++)
 654                ;
 655        return (*refname1 == '\0' && *refname2 == '/')
 656                || (*refname1 == '/' && *refname2 == '\0');
 657}
 658
 659struct name_conflict_cb {
 660        const char *refname;
 661        const char *oldrefname;
 662        const char *conflicting_refname;
 663};
 664
 665static int name_conflict_fn(const char *existingrefname, const unsigned char *sha1,
 666                            int flags, void *cb_data)
 667{
 668        struct name_conflict_cb *data = (struct name_conflict_cb *)cb_data;
 669        if (data->oldrefname && !strcmp(data->oldrefname, existingrefname))
 670                return 0;
 671        if (names_conflict(data->refname, existingrefname)) {
 672                data->conflicting_refname = existingrefname;
 673                return 1;
 674        }
 675        return 0;
 676}
 677
 678/*
 679 * Return true iff a reference named refname could be created without
 680 * conflicting with the name of an existing reference in array.  If
 681 * oldrefname is non-NULL, ignore potential conflicts with oldrefname
 682 * (e.g., because oldrefname is scheduled for deletion in the same
 683 * operation).
 684 */
 685static int is_refname_available(const char *refname, const char *oldrefname,
 686                                struct ref_dir *dir)
 687{
 688        struct name_conflict_cb data;
 689        data.refname = refname;
 690        data.oldrefname = oldrefname;
 691        data.conflicting_refname = NULL;
 692
 693        sort_ref_dir(dir);
 694        if (do_for_each_ref_in_dir(dir, 0, "", name_conflict_fn,
 695                                   0, DO_FOR_EACH_INCLUDE_BROKEN,
 696                                   &data)) {
 697                error("'%s' exists; cannot create '%s'",
 698                      data.conflicting_refname, refname);
 699                return 0;
 700        }
 701        return 1;
 702}
 703
 704/*
 705 * Future: need to be in "struct repository"
 706 * when doing a full libification.
 707 */
 708static struct ref_cache {
 709        struct ref_cache *next;
 710        struct ref_entry *loose;
 711        struct ref_entry *packed;
 712        /* The submodule name, or "" for the main repo. */
 713        char name[FLEX_ARRAY];
 714} *ref_cache;
 715
 716static void clear_packed_ref_cache(struct ref_cache *refs)
 717{
 718        if (refs->packed) {
 719                free_ref_entry(refs->packed);
 720                refs->packed = NULL;
 721        }
 722}
 723
 724static void clear_loose_ref_cache(struct ref_cache *refs)
 725{
 726        if (refs->loose) {
 727                free_ref_entry(refs->loose);
 728                refs->loose = NULL;
 729        }
 730}
 731
 732static struct ref_cache *create_ref_cache(const char *submodule)
 733{
 734        int len;
 735        struct ref_cache *refs;
 736        if (!submodule)
 737                submodule = "";
 738        len = strlen(submodule) + 1;
 739        refs = xcalloc(1, sizeof(struct ref_cache) + len);
 740        memcpy(refs->name, submodule, len);
 741        return refs;
 742}
 743
 744/*
 745 * Return a pointer to a ref_cache for the specified submodule. For
 746 * the main repository, use submodule==NULL. The returned structure
 747 * will be allocated and initialized but not necessarily populated; it
 748 * should not be freed.
 749 */
 750static struct ref_cache *get_ref_cache(const char *submodule)
 751{
 752        struct ref_cache *refs = ref_cache;
 753        if (!submodule)
 754                submodule = "";
 755        while (refs) {
 756                if (!strcmp(submodule, refs->name))
 757                        return refs;
 758                refs = refs->next;
 759        }
 760
 761        refs = create_ref_cache(submodule);
 762        refs->next = ref_cache;
 763        ref_cache = refs;
 764        return refs;
 765}
 766
 767void invalidate_ref_cache(const char *submodule)
 768{
 769        struct ref_cache *refs = get_ref_cache(submodule);
 770        clear_packed_ref_cache(refs);
 771        clear_loose_ref_cache(refs);
 772}
 773
 774/*
 775 * Parse one line from a packed-refs file.  Write the SHA1 to sha1.
 776 * Return a pointer to the refname within the line (null-terminated),
 777 * or NULL if there was a problem.
 778 */
 779static const char *parse_ref_line(char *line, unsigned char *sha1)
 780{
 781        /*
 782         * 42: the answer to everything.
 783         *
 784         * In this case, it happens to be the answer to
 785         *  40 (length of sha1 hex representation)
 786         *  +1 (space in between hex and name)
 787         *  +1 (newline at the end of the line)
 788         */
 789        int len = strlen(line) - 42;
 790
 791        if (len <= 0)
 792                return NULL;
 793        if (get_sha1_hex(line, sha1) < 0)
 794                return NULL;
 795        if (!isspace(line[40]))
 796                return NULL;
 797        line += 41;
 798        if (isspace(*line))
 799                return NULL;
 800        if (line[len] != '\n')
 801                return NULL;
 802        line[len] = 0;
 803
 804        return line;
 805}
 806
 807static void read_packed_refs(FILE *f, struct ref_dir *dir)
 808{
 809        struct ref_entry *last = NULL;
 810        char refline[PATH_MAX];
 811        int flag = REF_ISPACKED;
 812
 813        while (fgets(refline, sizeof(refline), f)) {
 814                unsigned char sha1[20];
 815                const char *refname;
 816                static const char header[] = "# pack-refs with:";
 817
 818                if (!strncmp(refline, header, sizeof(header)-1)) {
 819                        const char *traits = refline + sizeof(header) - 1;
 820                        if (strstr(traits, " peeled "))
 821                                flag |= REF_KNOWS_PEELED;
 822                        /* perhaps other traits later as well */
 823                        continue;
 824                }
 825
 826                refname = parse_ref_line(refline, sha1);
 827                if (refname) {
 828                        last = create_ref_entry(refname, sha1, flag, 1);
 829                        add_ref(dir, last);
 830                        continue;
 831                }
 832                if (last &&
 833                    refline[0] == '^' &&
 834                    strlen(refline) == 42 &&
 835                    refline[41] == '\n' &&
 836                    !get_sha1_hex(refline + 1, sha1))
 837                        hashcpy(last->u.value.peeled, sha1);
 838        }
 839}
 840
 841static struct ref_dir *get_packed_refs(struct ref_cache *refs)
 842{
 843        if (!refs->packed) {
 844                const char *packed_refs_file;
 845                FILE *f;
 846
 847                refs->packed = create_dir_entry(refs, "", 0, 0);
 848                if (*refs->name)
 849                        packed_refs_file = git_path_submodule(refs->name, "packed-refs");
 850                else
 851                        packed_refs_file = git_path("packed-refs");
 852                f = fopen(packed_refs_file, "r");
 853                if (f) {
 854                        read_packed_refs(f, get_ref_dir(refs->packed));
 855                        fclose(f);
 856                }
 857        }
 858        return get_ref_dir(refs->packed);
 859}
 860
 861void add_packed_ref(const char *refname, const unsigned char *sha1)
 862{
 863        add_ref(get_packed_refs(get_ref_cache(NULL)),
 864                        create_ref_entry(refname, sha1, REF_ISPACKED, 1));
 865}
 866
 867/*
 868 * Read the loose references from the namespace dirname into dir
 869 * (without recursing).  dirname must end with '/'.  dir must be the
 870 * directory entry corresponding to dirname.
 871 */
 872static void read_loose_refs(const char *dirname, struct ref_dir *dir)
 873{
 874        struct ref_cache *refs = dir->ref_cache;
 875        DIR *d;
 876        const char *path;
 877        struct dirent *de;
 878        int dirnamelen = strlen(dirname);
 879        struct strbuf refname;
 880
 881        if (*refs->name)
 882                path = git_path_submodule(refs->name, "%s", dirname);
 883        else
 884                path = git_path("%s", dirname);
 885
 886        d = opendir(path);
 887        if (!d)
 888                return;
 889
 890        strbuf_init(&refname, dirnamelen + 257);
 891        strbuf_add(&refname, dirname, dirnamelen);
 892
 893        while ((de = readdir(d)) != NULL) {
 894                unsigned char sha1[20];
 895                struct stat st;
 896                int flag;
 897                const char *refdir;
 898
 899                if (de->d_name[0] == '.')
 900                        continue;
 901                if (has_extension(de->d_name, ".lock"))
 902                        continue;
 903                strbuf_addstr(&refname, de->d_name);
 904                refdir = *refs->name
 905                        ? git_path_submodule(refs->name, "%s", refname.buf)
 906                        : git_path("%s", refname.buf);
 907                if (stat(refdir, &st) < 0) {
 908                        ; /* silently ignore */
 909                } else if (S_ISDIR(st.st_mode)) {
 910                        strbuf_addch(&refname, '/');
 911                        add_entry_to_dir(dir,
 912                                         create_dir_entry(refs, refname.buf,
 913                                                          refname.len, 1));
 914                } else {
 915                        if (*refs->name) {
 916                                hashclr(sha1);
 917                                flag = 0;
 918                                if (resolve_gitlink_ref(refs->name, refname.buf, sha1) < 0) {
 919                                        hashclr(sha1);
 920                                        flag |= REF_ISBROKEN;
 921                                }
 922                        } else if (read_ref_full(refname.buf, sha1, 1, &flag)) {
 923                                hashclr(sha1);
 924                                flag |= REF_ISBROKEN;
 925                        }
 926                        add_entry_to_dir(dir,
 927                                         create_ref_entry(refname.buf, sha1, flag, 1));
 928                }
 929                strbuf_setlen(&refname, dirnamelen);
 930        }
 931        strbuf_release(&refname);
 932        closedir(d);
 933}
 934
 935static struct ref_dir *get_loose_refs(struct ref_cache *refs)
 936{
 937        if (!refs->loose) {
 938                /*
 939                 * Mark the top-level directory complete because we
 940                 * are about to read the only subdirectory that can
 941                 * hold references:
 942                 */
 943                refs->loose = create_dir_entry(refs, "", 0, 0);
 944                /*
 945                 * Create an incomplete entry for "refs/":
 946                 */
 947                add_entry_to_dir(get_ref_dir(refs->loose),
 948                                 create_dir_entry(refs, "refs/", 5, 1));
 949        }
 950        return get_ref_dir(refs->loose);
 951}
 952
 953/* We allow "recursive" symbolic refs. Only within reason, though */
 954#define MAXDEPTH 5
 955#define MAXREFLEN (1024)
 956
 957/*
 958 * Called by resolve_gitlink_ref_recursive() after it failed to read
 959 * from the loose refs in ref_cache refs. Find <refname> in the
 960 * packed-refs file for the submodule.
 961 */
 962static int resolve_gitlink_packed_ref(struct ref_cache *refs,
 963                                      const char *refname, unsigned char *sha1)
 964{
 965        struct ref_entry *ref;
 966        struct ref_dir *dir = get_packed_refs(refs);
 967
 968        ref = find_ref(dir, refname);
 969        if (ref == NULL)
 970                return -1;
 971
 972        memcpy(sha1, ref->u.value.sha1, 20);
 973        return 0;
 974}
 975
 976static int resolve_gitlink_ref_recursive(struct ref_cache *refs,
 977                                         const char *refname, unsigned char *sha1,
 978                                         int recursion)
 979{
 980        int fd, len;
 981        char buffer[128], *p;
 982        char *path;
 983
 984        if (recursion > MAXDEPTH || strlen(refname) > MAXREFLEN)
 985                return -1;
 986        path = *refs->name
 987                ? git_path_submodule(refs->name, "%s", refname)
 988                : git_path("%s", refname);
 989        fd = open(path, O_RDONLY);
 990        if (fd < 0)
 991                return resolve_gitlink_packed_ref(refs, refname, sha1);
 992
 993        len = read(fd, buffer, sizeof(buffer)-1);
 994        close(fd);
 995        if (len < 0)
 996                return -1;
 997        while (len && isspace(buffer[len-1]))
 998                len--;
 999        buffer[len] = 0;
1000
1001        /* Was it a detached head or an old-fashioned symlink? */
1002        if (!get_sha1_hex(buffer, sha1))
1003                return 0;
1004
1005        /* Symref? */
1006        if (strncmp(buffer, "ref:", 4))
1007                return -1;
1008        p = buffer + 4;
1009        while (isspace(*p))
1010                p++;
1011
1012        return resolve_gitlink_ref_recursive(refs, p, sha1, recursion+1);
1013}
1014
1015int resolve_gitlink_ref(const char *path, const char *refname, unsigned char *sha1)
1016{
1017        int len = strlen(path), retval;
1018        char *submodule;
1019        struct ref_cache *refs;
1020
1021        while (len && path[len-1] == '/')
1022                len--;
1023        if (!len)
1024                return -1;
1025        submodule = xstrndup(path, len);
1026        refs = get_ref_cache(submodule);
1027        free(submodule);
1028
1029        retval = resolve_gitlink_ref_recursive(refs, refname, sha1, 0);
1030        return retval;
1031}
1032
1033/*
1034 * Try to read ref from the packed references.  On success, set sha1
1035 * and return 0; otherwise, return -1.
1036 */
1037static int get_packed_ref(const char *refname, unsigned char *sha1)
1038{
1039        struct ref_dir *packed = get_packed_refs(get_ref_cache(NULL));
1040        struct ref_entry *entry = find_ref(packed, refname);
1041        if (entry) {
1042                hashcpy(sha1, entry->u.value.sha1);
1043                return 0;
1044        }
1045        return -1;
1046}
1047
1048const char *resolve_ref_unsafe(const char *refname, unsigned char *sha1, int reading, int *flag)
1049{
1050        int depth = MAXDEPTH;
1051        ssize_t len;
1052        char buffer[256];
1053        static char refname_buffer[256];
1054
1055        if (flag)
1056                *flag = 0;
1057
1058        if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL))
1059                return NULL;
1060
1061        for (;;) {
1062                char path[PATH_MAX];
1063                struct stat st;
1064                char *buf;
1065                int fd;
1066
1067                if (--depth < 0)
1068                        return NULL;
1069
1070                git_snpath(path, sizeof(path), "%s", refname);
1071
1072                if (lstat(path, &st) < 0) {
1073                        if (errno != ENOENT)
1074                                return NULL;
1075                        /*
1076                         * The loose reference file does not exist;
1077                         * check for a packed reference.
1078                         */
1079                        if (!get_packed_ref(refname, sha1)) {
1080                                if (flag)
1081                                        *flag |= REF_ISPACKED;
1082                                return refname;
1083                        }
1084                        /* The reference is not a packed reference, either. */
1085                        if (reading) {
1086                                return NULL;
1087                        } else {
1088                                hashclr(sha1);
1089                                return refname;
1090                        }
1091                }
1092
1093                /* Follow "normalized" - ie "refs/.." symlinks by hand */
1094                if (S_ISLNK(st.st_mode)) {
1095                        len = readlink(path, buffer, sizeof(buffer)-1);
1096                        if (len < 0)
1097                                return NULL;
1098                        buffer[len] = 0;
1099                        if (!prefixcmp(buffer, "refs/") &&
1100                                        !check_refname_format(buffer, 0)) {
1101                                strcpy(refname_buffer, buffer);
1102                                refname = refname_buffer;
1103                                if (flag)
1104                                        *flag |= REF_ISSYMREF;
1105                                continue;
1106                        }
1107                }
1108
1109                /* Is it a directory? */
1110                if (S_ISDIR(st.st_mode)) {
1111                        errno = EISDIR;
1112                        return NULL;
1113                }
1114
1115                /*
1116                 * Anything else, just open it and try to use it as
1117                 * a ref
1118                 */
1119                fd = open(path, O_RDONLY);
1120                if (fd < 0)
1121                        return NULL;
1122                len = read_in_full(fd, buffer, sizeof(buffer)-1);
1123                close(fd);
1124                if (len < 0)
1125                        return NULL;
1126                while (len && isspace(buffer[len-1]))
1127                        len--;
1128                buffer[len] = '\0';
1129
1130                /*
1131                 * Is it a symbolic ref?
1132                 */
1133                if (prefixcmp(buffer, "ref:"))
1134                        break;
1135                if (flag)
1136                        *flag |= REF_ISSYMREF;
1137                buf = buffer + 4;
1138                while (isspace(*buf))
1139                        buf++;
1140                if (check_refname_format(buf, REFNAME_ALLOW_ONELEVEL)) {
1141                        if (flag)
1142                                *flag |= REF_ISBROKEN;
1143                        return NULL;
1144                }
1145                refname = strcpy(refname_buffer, buf);
1146        }
1147        /* Please note that FETCH_HEAD has a second line containing other data. */
1148        if (get_sha1_hex(buffer, sha1) || (buffer[40] != '\0' && !isspace(buffer[40]))) {
1149                if (flag)
1150                        *flag |= REF_ISBROKEN;
1151                return NULL;
1152        }
1153        return refname;
1154}
1155
1156char *resolve_refdup(const char *ref, unsigned char *sha1, int reading, int *flag)
1157{
1158        const char *ret = resolve_ref_unsafe(ref, sha1, reading, flag);
1159        return ret ? xstrdup(ret) : NULL;
1160}
1161
1162/* The argument to filter_refs */
1163struct ref_filter {
1164        const char *pattern;
1165        each_ref_fn *fn;
1166        void *cb_data;
1167};
1168
1169int read_ref_full(const char *refname, unsigned char *sha1, int reading, int *flags)
1170{
1171        if (resolve_ref_unsafe(refname, sha1, reading, flags))
1172                return 0;
1173        return -1;
1174}
1175
1176int read_ref(const char *refname, unsigned char *sha1)
1177{
1178        return read_ref_full(refname, sha1, 1, NULL);
1179}
1180
1181int ref_exists(const char *refname)
1182{
1183        unsigned char sha1[20];
1184        return !!resolve_ref_unsafe(refname, sha1, 1, NULL);
1185}
1186
1187static int filter_refs(const char *refname, const unsigned char *sha1, int flags,
1188                       void *data)
1189{
1190        struct ref_filter *filter = (struct ref_filter *)data;
1191        if (fnmatch(filter->pattern, refname, 0))
1192                return 0;
1193        return filter->fn(refname, sha1, flags, filter->cb_data);
1194}
1195
1196int peel_ref(const char *refname, unsigned char *sha1)
1197{
1198        int flag;
1199        unsigned char base[20];
1200        struct object *o;
1201
1202        if (current_ref && (current_ref->name == refname
1203                || !strcmp(current_ref->name, refname))) {
1204                if (current_ref->flag & REF_KNOWS_PEELED) {
1205                        if (is_null_sha1(current_ref->u.value.peeled))
1206                            return -1;
1207                        hashcpy(sha1, current_ref->u.value.peeled);
1208                        return 0;
1209                }
1210                hashcpy(base, current_ref->u.value.sha1);
1211                goto fallback;
1212        }
1213
1214        if (read_ref_full(refname, base, 1, &flag))
1215                return -1;
1216
1217        if ((flag & REF_ISPACKED)) {
1218                struct ref_dir *dir = get_packed_refs(get_ref_cache(NULL));
1219                struct ref_entry *r = find_ref(dir, refname);
1220
1221                if (r != NULL && r->flag & REF_KNOWS_PEELED) {
1222                        hashcpy(sha1, r->u.value.peeled);
1223                        return 0;
1224                }
1225        }
1226
1227fallback:
1228        o = lookup_unknown_object(base);
1229        if (o->type == OBJ_NONE) {
1230                int type = sha1_object_info(base, NULL);
1231                if (type < 0)
1232                        return -1;
1233                o->type = type;
1234        }
1235
1236        if (o->type == OBJ_TAG) {
1237                o = deref_tag_noverify(o);
1238                if (o) {
1239                        hashcpy(sha1, o->sha1);
1240                        return 0;
1241                }
1242        }
1243        return -1;
1244}
1245
1246struct warn_if_dangling_data {
1247        FILE *fp;
1248        const char *refname;
1249        const char *msg_fmt;
1250};
1251
1252static int warn_if_dangling_symref(const char *refname, const unsigned char *sha1,
1253                                   int flags, void *cb_data)
1254{
1255        struct warn_if_dangling_data *d = cb_data;
1256        const char *resolves_to;
1257        unsigned char junk[20];
1258
1259        if (!(flags & REF_ISSYMREF))
1260                return 0;
1261
1262        resolves_to = resolve_ref_unsafe(refname, junk, 0, NULL);
1263        if (!resolves_to || strcmp(resolves_to, d->refname))
1264                return 0;
1265
1266        fprintf(d->fp, d->msg_fmt, refname);
1267        fputc('\n', d->fp);
1268        return 0;
1269}
1270
1271void warn_dangling_symref(FILE *fp, const char *msg_fmt, const char *refname)
1272{
1273        struct warn_if_dangling_data data;
1274
1275        data.fp = fp;
1276        data.refname = refname;
1277        data.msg_fmt = msg_fmt;
1278        for_each_rawref(warn_if_dangling_symref, &data);
1279}
1280
1281static int do_for_each_ref(const char *submodule, const char *base, each_ref_fn fn,
1282                           int trim, int flags, void *cb_data)
1283{
1284        struct ref_cache *refs = get_ref_cache(submodule);
1285        struct ref_dir *packed_dir = get_packed_refs(refs);
1286        struct ref_dir *loose_dir = get_loose_refs(refs);
1287        int retval = 0;
1288
1289        if (base && *base) {
1290                packed_dir = find_containing_dir(packed_dir, base, 0);
1291                loose_dir = find_containing_dir(loose_dir, base, 0);
1292        }
1293
1294        if (packed_dir && loose_dir) {
1295                sort_ref_dir(packed_dir);
1296                sort_ref_dir(loose_dir);
1297                retval = do_for_each_ref_in_dirs(
1298                                packed_dir, loose_dir,
1299                                base, fn, trim, flags, cb_data);
1300        } else if (packed_dir) {
1301                sort_ref_dir(packed_dir);
1302                retval = do_for_each_ref_in_dir(
1303                                packed_dir, 0,
1304                                base, fn, trim, flags, cb_data);
1305        } else if (loose_dir) {
1306                sort_ref_dir(loose_dir);
1307                retval = do_for_each_ref_in_dir(
1308                                loose_dir, 0,
1309                                base, fn, trim, flags, cb_data);
1310        }
1311
1312        return retval;
1313}
1314
1315static int do_head_ref(const char *submodule, each_ref_fn fn, void *cb_data)
1316{
1317        unsigned char sha1[20];
1318        int flag;
1319
1320        if (submodule) {
1321                if (resolve_gitlink_ref(submodule, "HEAD", sha1) == 0)
1322                        return fn("HEAD", sha1, 0, cb_data);
1323
1324                return 0;
1325        }
1326
1327        if (!read_ref_full("HEAD", sha1, 1, &flag))
1328                return fn("HEAD", sha1, flag, cb_data);
1329
1330        return 0;
1331}
1332
1333int head_ref(each_ref_fn fn, void *cb_data)
1334{
1335        return do_head_ref(NULL, fn, cb_data);
1336}
1337
1338int head_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
1339{
1340        return do_head_ref(submodule, fn, cb_data);
1341}
1342
1343int for_each_ref(each_ref_fn fn, void *cb_data)
1344{
1345        return do_for_each_ref(NULL, "", fn, 0, 0, cb_data);
1346}
1347
1348int for_each_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
1349{
1350        return do_for_each_ref(submodule, "", fn, 0, 0, cb_data);
1351}
1352
1353int for_each_ref_in(const char *prefix, each_ref_fn fn, void *cb_data)
1354{
1355        return do_for_each_ref(NULL, prefix, fn, strlen(prefix), 0, cb_data);
1356}
1357
1358int for_each_ref_in_submodule(const char *submodule, const char *prefix,
1359                each_ref_fn fn, void *cb_data)
1360{
1361        return do_for_each_ref(submodule, prefix, fn, strlen(prefix), 0, cb_data);
1362}
1363
1364int for_each_tag_ref(each_ref_fn fn, void *cb_data)
1365{
1366        return for_each_ref_in("refs/tags/", fn, cb_data);
1367}
1368
1369int for_each_tag_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
1370{
1371        return for_each_ref_in_submodule(submodule, "refs/tags/", fn, cb_data);
1372}
1373
1374int for_each_branch_ref(each_ref_fn fn, void *cb_data)
1375{
1376        return for_each_ref_in("refs/heads/", fn, cb_data);
1377}
1378
1379int for_each_branch_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
1380{
1381        return for_each_ref_in_submodule(submodule, "refs/heads/", fn, cb_data);
1382}
1383
1384int for_each_remote_ref(each_ref_fn fn, void *cb_data)
1385{
1386        return for_each_ref_in("refs/remotes/", fn, cb_data);
1387}
1388
1389int for_each_remote_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
1390{
1391        return for_each_ref_in_submodule(submodule, "refs/remotes/", fn, cb_data);
1392}
1393
1394int for_each_replace_ref(each_ref_fn fn, void *cb_data)
1395{
1396        return do_for_each_ref(NULL, "refs/replace/", fn, 13, 0, cb_data);
1397}
1398
1399int head_ref_namespaced(each_ref_fn fn, void *cb_data)
1400{
1401        struct strbuf buf = STRBUF_INIT;
1402        int ret = 0;
1403        unsigned char sha1[20];
1404        int flag;
1405
1406        strbuf_addf(&buf, "%sHEAD", get_git_namespace());
1407        if (!read_ref_full(buf.buf, sha1, 1, &flag))
1408                ret = fn(buf.buf, sha1, flag, cb_data);
1409        strbuf_release(&buf);
1410
1411        return ret;
1412}
1413
1414int for_each_namespaced_ref(each_ref_fn fn, void *cb_data)
1415{
1416        struct strbuf buf = STRBUF_INIT;
1417        int ret;
1418        strbuf_addf(&buf, "%srefs/", get_git_namespace());
1419        ret = do_for_each_ref(NULL, buf.buf, fn, 0, 0, cb_data);
1420        strbuf_release(&buf);
1421        return ret;
1422}
1423
1424int for_each_glob_ref_in(each_ref_fn fn, const char *pattern,
1425        const char *prefix, void *cb_data)
1426{
1427        struct strbuf real_pattern = STRBUF_INIT;
1428        struct ref_filter filter;
1429        int ret;
1430
1431        if (!prefix && prefixcmp(pattern, "refs/"))
1432                strbuf_addstr(&real_pattern, "refs/");
1433        else if (prefix)
1434                strbuf_addstr(&real_pattern, prefix);
1435        strbuf_addstr(&real_pattern, pattern);
1436
1437        if (!has_glob_specials(pattern)) {
1438                /* Append implied '/' '*' if not present. */
1439                if (real_pattern.buf[real_pattern.len - 1] != '/')
1440                        strbuf_addch(&real_pattern, '/');
1441                /* No need to check for '*', there is none. */
1442                strbuf_addch(&real_pattern, '*');
1443        }
1444
1445        filter.pattern = real_pattern.buf;
1446        filter.fn = fn;
1447        filter.cb_data = cb_data;
1448        ret = for_each_ref(filter_refs, &filter);
1449
1450        strbuf_release(&real_pattern);
1451        return ret;
1452}
1453
1454int for_each_glob_ref(each_ref_fn fn, const char *pattern, void *cb_data)
1455{
1456        return for_each_glob_ref_in(fn, pattern, NULL, cb_data);
1457}
1458
1459int for_each_rawref(each_ref_fn fn, void *cb_data)
1460{
1461        return do_for_each_ref(NULL, "", fn, 0,
1462                               DO_FOR_EACH_INCLUDE_BROKEN, cb_data);
1463}
1464
1465const char *prettify_refname(const char *name)
1466{
1467        return name + (
1468                !prefixcmp(name, "refs/heads/") ? 11 :
1469                !prefixcmp(name, "refs/tags/") ? 10 :
1470                !prefixcmp(name, "refs/remotes/") ? 13 :
1471                0);
1472}
1473
1474const char *ref_rev_parse_rules[] = {
1475        "%.*s",
1476        "refs/%.*s",
1477        "refs/tags/%.*s",
1478        "refs/heads/%.*s",
1479        "refs/remotes/%.*s",
1480        "refs/remotes/%.*s/HEAD",
1481        NULL
1482};
1483
1484int refname_match(const char *abbrev_name, const char *full_name, const char **rules)
1485{
1486        const char **p;
1487        const int abbrev_name_len = strlen(abbrev_name);
1488
1489        for (p = rules; *p; p++) {
1490                if (!strcmp(full_name, mkpath(*p, abbrev_name_len, abbrev_name))) {
1491                        return 1;
1492                }
1493        }
1494
1495        return 0;
1496}
1497
1498static struct ref_lock *verify_lock(struct ref_lock *lock,
1499        const unsigned char *old_sha1, int mustexist)
1500{
1501        if (read_ref_full(lock->ref_name, lock->old_sha1, mustexist, NULL)) {
1502                error("Can't verify ref %s", lock->ref_name);
1503                unlock_ref(lock);
1504                return NULL;
1505        }
1506        if (hashcmp(lock->old_sha1, old_sha1)) {
1507                error("Ref %s is at %s but expected %s", lock->ref_name,
1508                        sha1_to_hex(lock->old_sha1), sha1_to_hex(old_sha1));
1509                unlock_ref(lock);
1510                return NULL;
1511        }
1512        return lock;
1513}
1514
1515static int remove_empty_directories(const char *file)
1516{
1517        /* we want to create a file but there is a directory there;
1518         * if that is an empty directory (or a directory that contains
1519         * only empty directories), remove them.
1520         */
1521        struct strbuf path;
1522        int result;
1523
1524        strbuf_init(&path, 20);
1525        strbuf_addstr(&path, file);
1526
1527        result = remove_dir_recursively(&path, REMOVE_DIR_EMPTY_ONLY);
1528
1529        strbuf_release(&path);
1530
1531        return result;
1532}
1533
1534/*
1535 * *string and *len will only be substituted, and *string returned (for
1536 * later free()ing) if the string passed in is a magic short-hand form
1537 * to name a branch.
1538 */
1539static char *substitute_branch_name(const char **string, int *len)
1540{
1541        struct strbuf buf = STRBUF_INIT;
1542        int ret = interpret_branch_name(*string, &buf);
1543
1544        if (ret == *len) {
1545                size_t size;
1546                *string = strbuf_detach(&buf, &size);
1547                *len = size;
1548                return (char *)*string;
1549        }
1550
1551        return NULL;
1552}
1553
1554int dwim_ref(const char *str, int len, unsigned char *sha1, char **ref)
1555{
1556        char *last_branch = substitute_branch_name(&str, &len);
1557        const char **p, *r;
1558        int refs_found = 0;
1559
1560        *ref = NULL;
1561        for (p = ref_rev_parse_rules; *p; p++) {
1562                char fullref[PATH_MAX];
1563                unsigned char sha1_from_ref[20];
1564                unsigned char *this_result;
1565                int flag;
1566
1567                this_result = refs_found ? sha1_from_ref : sha1;
1568                mksnpath(fullref, sizeof(fullref), *p, len, str);
1569                r = resolve_ref_unsafe(fullref, this_result, 1, &flag);
1570                if (r) {
1571                        if (!refs_found++)
1572                                *ref = xstrdup(r);
1573                        if (!warn_ambiguous_refs)
1574                                break;
1575                } else if ((flag & REF_ISSYMREF) && strcmp(fullref, "HEAD")) {
1576                        warning("ignoring dangling symref %s.", fullref);
1577                } else if ((flag & REF_ISBROKEN) && strchr(fullref, '/')) {
1578                        warning("ignoring broken ref %s.", fullref);
1579                }
1580        }
1581        free(last_branch);
1582        return refs_found;
1583}
1584
1585int dwim_log(const char *str, int len, unsigned char *sha1, char **log)
1586{
1587        char *last_branch = substitute_branch_name(&str, &len);
1588        const char **p;
1589        int logs_found = 0;
1590
1591        *log = NULL;
1592        for (p = ref_rev_parse_rules; *p; p++) {
1593                struct stat st;
1594                unsigned char hash[20];
1595                char path[PATH_MAX];
1596                const char *ref, *it;
1597
1598                mksnpath(path, sizeof(path), *p, len, str);
1599                ref = resolve_ref_unsafe(path, hash, 1, NULL);
1600                if (!ref)
1601                        continue;
1602                if (!stat(git_path("logs/%s", path), &st) &&
1603                    S_ISREG(st.st_mode))
1604                        it = path;
1605                else if (strcmp(ref, path) &&
1606                         !stat(git_path("logs/%s", ref), &st) &&
1607                         S_ISREG(st.st_mode))
1608                        it = ref;
1609                else
1610                        continue;
1611                if (!logs_found++) {
1612                        *log = xstrdup(it);
1613                        hashcpy(sha1, hash);
1614                }
1615                if (!warn_ambiguous_refs)
1616                        break;
1617        }
1618        free(last_branch);
1619        return logs_found;
1620}
1621
1622static struct ref_lock *lock_ref_sha1_basic(const char *refname,
1623                                            const unsigned char *old_sha1,
1624                                            int flags, int *type_p)
1625{
1626        char *ref_file;
1627        const char *orig_refname = refname;
1628        struct ref_lock *lock;
1629        int last_errno = 0;
1630        int type, lflags;
1631        int mustexist = (old_sha1 && !is_null_sha1(old_sha1));
1632        int missing = 0;
1633
1634        lock = xcalloc(1, sizeof(struct ref_lock));
1635        lock->lock_fd = -1;
1636
1637        refname = resolve_ref_unsafe(refname, lock->old_sha1, mustexist, &type);
1638        if (!refname && errno == EISDIR) {
1639                /* we are trying to lock foo but we used to
1640                 * have foo/bar which now does not exist;
1641                 * it is normal for the empty directory 'foo'
1642                 * to remain.
1643                 */
1644                ref_file = git_path("%s", orig_refname);
1645                if (remove_empty_directories(ref_file)) {
1646                        last_errno = errno;
1647                        error("there are still refs under '%s'", orig_refname);
1648                        goto error_return;
1649                }
1650                refname = resolve_ref_unsafe(orig_refname, lock->old_sha1, mustexist, &type);
1651        }
1652        if (type_p)
1653            *type_p = type;
1654        if (!refname) {
1655                last_errno = errno;
1656                error("unable to resolve reference %s: %s",
1657                        orig_refname, strerror(errno));
1658                goto error_return;
1659        }
1660        missing = is_null_sha1(lock->old_sha1);
1661        /* When the ref did not exist and we are creating it,
1662         * make sure there is no existing ref that is packed
1663         * whose name begins with our refname, nor a ref whose
1664         * name is a proper prefix of our refname.
1665         */
1666        if (missing &&
1667             !is_refname_available(refname, NULL, get_packed_refs(get_ref_cache(NULL)))) {
1668                last_errno = ENOTDIR;
1669                goto error_return;
1670        }
1671
1672        lock->lk = xcalloc(1, sizeof(struct lock_file));
1673
1674        lflags = LOCK_DIE_ON_ERROR;
1675        if (flags & REF_NODEREF) {
1676                refname = orig_refname;
1677                lflags |= LOCK_NODEREF;
1678        }
1679        lock->ref_name = xstrdup(refname);
1680        lock->orig_ref_name = xstrdup(orig_refname);
1681        ref_file = git_path("%s", refname);
1682        if (missing)
1683                lock->force_write = 1;
1684        if ((flags & REF_NODEREF) && (type & REF_ISSYMREF))
1685                lock->force_write = 1;
1686
1687        if (safe_create_leading_directories(ref_file)) {
1688                last_errno = errno;
1689                error("unable to create directory for %s", ref_file);
1690                goto error_return;
1691        }
1692
1693        lock->lock_fd = hold_lock_file_for_update(lock->lk, ref_file, lflags);
1694        return old_sha1 ? verify_lock(lock, old_sha1, mustexist) : lock;
1695
1696 error_return:
1697        unlock_ref(lock);
1698        errno = last_errno;
1699        return NULL;
1700}
1701
1702struct ref_lock *lock_ref_sha1(const char *refname, const unsigned char *old_sha1)
1703{
1704        char refpath[PATH_MAX];
1705        if (check_refname_format(refname, 0))
1706                return NULL;
1707        strcpy(refpath, mkpath("refs/%s", refname));
1708        return lock_ref_sha1_basic(refpath, old_sha1, 0, NULL);
1709}
1710
1711struct ref_lock *lock_any_ref_for_update(const char *refname,
1712                                         const unsigned char *old_sha1, int flags)
1713{
1714        if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL))
1715                return NULL;
1716        return lock_ref_sha1_basic(refname, old_sha1, flags, NULL);
1717}
1718
1719struct repack_without_ref_sb {
1720        const char *refname;
1721        int fd;
1722};
1723
1724static int repack_without_ref_fn(const char *refname, const unsigned char *sha1,
1725                                 int flags, void *cb_data)
1726{
1727        struct repack_without_ref_sb *data = cb_data;
1728        char line[PATH_MAX + 100];
1729        int len;
1730
1731        if (!strcmp(data->refname, refname))
1732                return 0;
1733        len = snprintf(line, sizeof(line), "%s %s\n",
1734                       sha1_to_hex(sha1), refname);
1735        /* this should not happen but just being defensive */
1736        if (len > sizeof(line))
1737                die("too long a refname '%s'", refname);
1738        write_or_die(data->fd, line, len);
1739        return 0;
1740}
1741
1742static struct lock_file packlock;
1743
1744static int repack_without_ref(const char *refname)
1745{
1746        struct repack_without_ref_sb data;
1747        struct ref_cache *refs = get_ref_cache(NULL);
1748        struct ref_dir *packed = get_packed_refs(refs);
1749        if (find_ref(packed, refname) == NULL)
1750                return 0;
1751        data.refname = refname;
1752        data.fd = hold_lock_file_for_update(&packlock, git_path("packed-refs"), 0);
1753        if (data.fd < 0) {
1754                unable_to_lock_error(git_path("packed-refs"), errno);
1755                return error("cannot delete '%s' from packed refs", refname);
1756        }
1757        clear_packed_ref_cache(refs);
1758        packed = get_packed_refs(refs);
1759        do_for_each_ref_in_dir(packed, 0, "", repack_without_ref_fn, 0, 0, &data);
1760        return commit_lock_file(&packlock);
1761}
1762
1763int delete_ref(const char *refname, const unsigned char *sha1, int delopt)
1764{
1765        struct ref_lock *lock;
1766        int err, i = 0, ret = 0, flag = 0;
1767
1768        lock = lock_ref_sha1_basic(refname, sha1, delopt, &flag);
1769        if (!lock)
1770                return 1;
1771        if (!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) {
1772                /* loose */
1773                i = strlen(lock->lk->filename) - 5; /* .lock */
1774                lock->lk->filename[i] = 0;
1775                err = unlink_or_warn(lock->lk->filename);
1776                if (err && errno != ENOENT)
1777                        ret = 1;
1778
1779                lock->lk->filename[i] = '.';
1780        }
1781        /* removing the loose one could have resurrected an earlier
1782         * packed one.  Also, if it was not loose we need to repack
1783         * without it.
1784         */
1785        ret |= repack_without_ref(lock->ref_name);
1786
1787        unlink_or_warn(git_path("logs/%s", lock->ref_name));
1788        invalidate_ref_cache(NULL);
1789        unlock_ref(lock);
1790        return ret;
1791}
1792
1793/*
1794 * People using contrib's git-new-workdir have .git/logs/refs ->
1795 * /some/other/path/.git/logs/refs, and that may live on another device.
1796 *
1797 * IOW, to avoid cross device rename errors, the temporary renamed log must
1798 * live into logs/refs.
1799 */
1800#define TMP_RENAMED_LOG  "logs/refs/.tmp-renamed-log"
1801
1802int rename_ref(const char *oldrefname, const char *newrefname, const char *logmsg)
1803{
1804        unsigned char sha1[20], orig_sha1[20];
1805        int flag = 0, logmoved = 0;
1806        struct ref_lock *lock;
1807        struct stat loginfo;
1808        int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);
1809        const char *symref = NULL;
1810        struct ref_cache *refs = get_ref_cache(NULL);
1811
1812        if (log && S_ISLNK(loginfo.st_mode))
1813                return error("reflog for %s is a symlink", oldrefname);
1814
1815        symref = resolve_ref_unsafe(oldrefname, orig_sha1, 1, &flag);
1816        if (flag & REF_ISSYMREF)
1817                return error("refname %s is a symbolic ref, renaming it is not supported",
1818                        oldrefname);
1819        if (!symref)
1820                return error("refname %s not found", oldrefname);
1821
1822        if (!is_refname_available(newrefname, oldrefname, get_packed_refs(refs)))
1823                return 1;
1824
1825        if (!is_refname_available(newrefname, oldrefname, get_loose_refs(refs)))
1826                return 1;
1827
1828        if (log && rename(git_path("logs/%s", oldrefname), git_path(TMP_RENAMED_LOG)))
1829                return error("unable to move logfile logs/%s to "TMP_RENAMED_LOG": %s",
1830                        oldrefname, strerror(errno));
1831
1832        if (delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {
1833                error("unable to delete old %s", oldrefname);
1834                goto rollback;
1835        }
1836
1837        if (!read_ref_full(newrefname, sha1, 1, &flag) &&
1838            delete_ref(newrefname, sha1, REF_NODEREF)) {
1839                if (errno==EISDIR) {
1840                        if (remove_empty_directories(git_path("%s", newrefname))) {
1841                                error("Directory not empty: %s", newrefname);
1842                                goto rollback;
1843                        }
1844                } else {
1845                        error("unable to delete existing %s", newrefname);
1846                        goto rollback;
1847                }
1848        }
1849
1850        if (log && safe_create_leading_directories(git_path("logs/%s", newrefname))) {
1851                error("unable to create directory for %s", newrefname);
1852                goto rollback;
1853        }
1854
1855 retry:
1856        if (log && rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", newrefname))) {
1857                if (errno==EISDIR || errno==ENOTDIR) {
1858                        /*
1859                         * rename(a, b) when b is an existing
1860                         * directory ought to result in ISDIR, but
1861                         * Solaris 5.8 gives ENOTDIR.  Sheesh.
1862                         */
1863                        if (remove_empty_directories(git_path("logs/%s", newrefname))) {
1864                                error("Directory not empty: logs/%s", newrefname);
1865                                goto rollback;
1866                        }
1867                        goto retry;
1868                } else {
1869                        error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s: %s",
1870                                newrefname, strerror(errno));
1871                        goto rollback;
1872                }
1873        }
1874        logmoved = log;
1875
1876        lock = lock_ref_sha1_basic(newrefname, NULL, 0, NULL);
1877        if (!lock) {
1878                error("unable to lock %s for update", newrefname);
1879                goto rollback;
1880        }
1881        lock->force_write = 1;
1882        hashcpy(lock->old_sha1, orig_sha1);
1883        if (write_ref_sha1(lock, orig_sha1, logmsg)) {
1884                error("unable to write current sha1 into %s", newrefname);
1885                goto rollback;
1886        }
1887
1888        return 0;
1889
1890 rollback:
1891        lock = lock_ref_sha1_basic(oldrefname, NULL, 0, NULL);
1892        if (!lock) {
1893                error("unable to lock %s for rollback", oldrefname);
1894                goto rollbacklog;
1895        }
1896
1897        lock->force_write = 1;
1898        flag = log_all_ref_updates;
1899        log_all_ref_updates = 0;
1900        if (write_ref_sha1(lock, orig_sha1, NULL))
1901                error("unable to write current sha1 into %s", oldrefname);
1902        log_all_ref_updates = flag;
1903
1904 rollbacklog:
1905        if (logmoved && rename(git_path("logs/%s", newrefname), git_path("logs/%s", oldrefname)))
1906                error("unable to restore logfile %s from %s: %s",
1907                        oldrefname, newrefname, strerror(errno));
1908        if (!logmoved && log &&
1909            rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", oldrefname)))
1910                error("unable to restore logfile %s from "TMP_RENAMED_LOG": %s",
1911                        oldrefname, strerror(errno));
1912
1913        return 1;
1914}
1915
1916int close_ref(struct ref_lock *lock)
1917{
1918        if (close_lock_file(lock->lk))
1919                return -1;
1920        lock->lock_fd = -1;
1921        return 0;
1922}
1923
1924int commit_ref(struct ref_lock *lock)
1925{
1926        if (commit_lock_file(lock->lk))
1927                return -1;
1928        lock->lock_fd = -1;
1929        return 0;
1930}
1931
1932void unlock_ref(struct ref_lock *lock)
1933{
1934        /* Do not free lock->lk -- atexit() still looks at them */
1935        if (lock->lk)
1936                rollback_lock_file(lock->lk);
1937        free(lock->ref_name);
1938        free(lock->orig_ref_name);
1939        free(lock);
1940}
1941
1942/*
1943 * copy the reflog message msg to buf, which has been allocated sufficiently
1944 * large, while cleaning up the whitespaces.  Especially, convert LF to space,
1945 * because reflog file is one line per entry.
1946 */
1947static int copy_msg(char *buf, const char *msg)
1948{
1949        char *cp = buf;
1950        char c;
1951        int wasspace = 1;
1952
1953        *cp++ = '\t';
1954        while ((c = *msg++)) {
1955                if (wasspace && isspace(c))
1956                        continue;
1957                wasspace = isspace(c);
1958                if (wasspace)
1959                        c = ' ';
1960                *cp++ = c;
1961        }
1962        while (buf < cp && isspace(cp[-1]))
1963                cp--;
1964        *cp++ = '\n';
1965        return cp - buf;
1966}
1967
1968int log_ref_setup(const char *refname, char *logfile, int bufsize)
1969{
1970        int logfd, oflags = O_APPEND | O_WRONLY;
1971
1972        git_snpath(logfile, bufsize, "logs/%s", refname);
1973        if (log_all_ref_updates &&
1974            (!prefixcmp(refname, "refs/heads/") ||
1975             !prefixcmp(refname, "refs/remotes/") ||
1976             !prefixcmp(refname, "refs/notes/") ||
1977             !strcmp(refname, "HEAD"))) {
1978                if (safe_create_leading_directories(logfile) < 0)
1979                        return error("unable to create directory for %s",
1980                                     logfile);
1981                oflags |= O_CREAT;
1982        }
1983
1984        logfd = open(logfile, oflags, 0666);
1985        if (logfd < 0) {
1986                if (!(oflags & O_CREAT) && errno == ENOENT)
1987                        return 0;
1988
1989                if ((oflags & O_CREAT) && errno == EISDIR) {
1990                        if (remove_empty_directories(logfile)) {
1991                                return error("There are still logs under '%s'",
1992                                             logfile);
1993                        }
1994                        logfd = open(logfile, oflags, 0666);
1995                }
1996
1997                if (logfd < 0)
1998                        return error("Unable to append to %s: %s",
1999                                     logfile, strerror(errno));
2000        }
2001
2002        adjust_shared_perm(logfile);
2003        close(logfd);
2004        return 0;
2005}
2006
2007static int log_ref_write(const char *refname, const unsigned char *old_sha1,
2008                         const unsigned char *new_sha1, const char *msg)
2009{
2010        int logfd, result, written, oflags = O_APPEND | O_WRONLY;
2011        unsigned maxlen, len;
2012        int msglen;
2013        char log_file[PATH_MAX];
2014        char *logrec;
2015        const char *committer;
2016
2017        if (log_all_ref_updates < 0)
2018                log_all_ref_updates = !is_bare_repository();
2019
2020        result = log_ref_setup(refname, log_file, sizeof(log_file));
2021        if (result)
2022                return result;
2023
2024        logfd = open(log_file, oflags);
2025        if (logfd < 0)
2026                return 0;
2027        msglen = msg ? strlen(msg) : 0;
2028        committer = git_committer_info(0);
2029        maxlen = strlen(committer) + msglen + 100;
2030        logrec = xmalloc(maxlen);
2031        len = sprintf(logrec, "%s %s %s\n",
2032                      sha1_to_hex(old_sha1),
2033                      sha1_to_hex(new_sha1),
2034                      committer);
2035        if (msglen)
2036                len += copy_msg(logrec + len - 1, msg) - 1;
2037        written = len <= maxlen ? write_in_full(logfd, logrec, len) : -1;
2038        free(logrec);
2039        if (close(logfd) != 0 || written != len)
2040                return error("Unable to append to %s", log_file);
2041        return 0;
2042}
2043
2044static int is_branch(const char *refname)
2045{
2046        return !strcmp(refname, "HEAD") || !prefixcmp(refname, "refs/heads/");
2047}
2048
2049int write_ref_sha1(struct ref_lock *lock,
2050        const unsigned char *sha1, const char *logmsg)
2051{
2052        static char term = '\n';
2053        struct object *o;
2054
2055        if (!lock)
2056                return -1;
2057        if (!lock->force_write && !hashcmp(lock->old_sha1, sha1)) {
2058                unlock_ref(lock);
2059                return 0;
2060        }
2061        o = parse_object(sha1);
2062        if (!o) {
2063                error("Trying to write ref %s with nonexistent object %s",
2064                        lock->ref_name, sha1_to_hex(sha1));
2065                unlock_ref(lock);
2066                return -1;
2067        }
2068        if (o->type != OBJ_COMMIT && is_branch(lock->ref_name)) {
2069                error("Trying to write non-commit object %s to branch %s",
2070                        sha1_to_hex(sha1), lock->ref_name);
2071                unlock_ref(lock);
2072                return -1;
2073        }
2074        if (write_in_full(lock->lock_fd, sha1_to_hex(sha1), 40) != 40 ||
2075            write_in_full(lock->lock_fd, &term, 1) != 1
2076                || close_ref(lock) < 0) {
2077                error("Couldn't write %s", lock->lk->filename);
2078                unlock_ref(lock);
2079                return -1;
2080        }
2081        clear_loose_ref_cache(get_ref_cache(NULL));
2082        if (log_ref_write(lock->ref_name, lock->old_sha1, sha1, logmsg) < 0 ||
2083            (strcmp(lock->ref_name, lock->orig_ref_name) &&
2084             log_ref_write(lock->orig_ref_name, lock->old_sha1, sha1, logmsg) < 0)) {
2085                unlock_ref(lock);
2086                return -1;
2087        }
2088        if (strcmp(lock->orig_ref_name, "HEAD") != 0) {
2089                /*
2090                 * Special hack: If a branch is updated directly and HEAD
2091                 * points to it (may happen on the remote side of a push
2092                 * for example) then logically the HEAD reflog should be
2093                 * updated too.
2094                 * A generic solution implies reverse symref information,
2095                 * but finding all symrefs pointing to the given branch
2096                 * would be rather costly for this rare event (the direct
2097                 * update of a branch) to be worth it.  So let's cheat and
2098                 * check with HEAD only which should cover 99% of all usage
2099                 * scenarios (even 100% of the default ones).
2100                 */
2101                unsigned char head_sha1[20];
2102                int head_flag;
2103                const char *head_ref;
2104                head_ref = resolve_ref_unsafe("HEAD", head_sha1, 1, &head_flag);
2105                if (head_ref && (head_flag & REF_ISSYMREF) &&
2106                    !strcmp(head_ref, lock->ref_name))
2107                        log_ref_write("HEAD", lock->old_sha1, sha1, logmsg);
2108        }
2109        if (commit_ref(lock)) {
2110                error("Couldn't set %s", lock->ref_name);
2111                unlock_ref(lock);
2112                return -1;
2113        }
2114        unlock_ref(lock);
2115        return 0;
2116}
2117
2118int create_symref(const char *ref_target, const char *refs_heads_master,
2119                  const char *logmsg)
2120{
2121        const char *lockpath;
2122        char ref[1000];
2123        int fd, len, written;
2124        char *git_HEAD = git_pathdup("%s", ref_target);
2125        unsigned char old_sha1[20], new_sha1[20];
2126
2127        if (logmsg && read_ref(ref_target, old_sha1))
2128                hashclr(old_sha1);
2129
2130        if (safe_create_leading_directories(git_HEAD) < 0)
2131                return error("unable to create directory for %s", git_HEAD);
2132
2133#ifndef NO_SYMLINK_HEAD
2134        if (prefer_symlink_refs) {
2135                unlink(git_HEAD);
2136                if (!symlink(refs_heads_master, git_HEAD))
2137                        goto done;
2138                fprintf(stderr, "no symlink - falling back to symbolic ref\n");
2139        }
2140#endif
2141
2142        len = snprintf(ref, sizeof(ref), "ref: %s\n", refs_heads_master);
2143        if (sizeof(ref) <= len) {
2144                error("refname too long: %s", refs_heads_master);
2145                goto error_free_return;
2146        }
2147        lockpath = mkpath("%s.lock", git_HEAD);
2148        fd = open(lockpath, O_CREAT | O_EXCL | O_WRONLY, 0666);
2149        if (fd < 0) {
2150                error("Unable to open %s for writing", lockpath);
2151                goto error_free_return;
2152        }
2153        written = write_in_full(fd, ref, len);
2154        if (close(fd) != 0 || written != len) {
2155                error("Unable to write to %s", lockpath);
2156                goto error_unlink_return;
2157        }
2158        if (rename(lockpath, git_HEAD) < 0) {
2159                error("Unable to create %s", git_HEAD);
2160                goto error_unlink_return;
2161        }
2162        if (adjust_shared_perm(git_HEAD)) {
2163                error("Unable to fix permissions on %s", lockpath);
2164        error_unlink_return:
2165                unlink_or_warn(lockpath);
2166        error_free_return:
2167                free(git_HEAD);
2168                return -1;
2169        }
2170
2171#ifndef NO_SYMLINK_HEAD
2172        done:
2173#endif
2174        if (logmsg && !read_ref(refs_heads_master, new_sha1))
2175                log_ref_write(ref_target, old_sha1, new_sha1, logmsg);
2176
2177        free(git_HEAD);
2178        return 0;
2179}
2180
2181static char *ref_msg(const char *line, const char *endp)
2182{
2183        const char *ep;
2184        line += 82;
2185        ep = memchr(line, '\n', endp - line);
2186        if (!ep)
2187                ep = endp;
2188        return xmemdupz(line, ep - line);
2189}
2190
2191int read_ref_at(const char *refname, unsigned long at_time, int cnt,
2192                unsigned char *sha1, char **msg,
2193                unsigned long *cutoff_time, int *cutoff_tz, int *cutoff_cnt)
2194{
2195        const char *logfile, *logdata, *logend, *rec, *lastgt, *lastrec;
2196        char *tz_c;
2197        int logfd, tz, reccnt = 0;
2198        struct stat st;
2199        unsigned long date;
2200        unsigned char logged_sha1[20];
2201        void *log_mapped;
2202        size_t mapsz;
2203
2204        logfile = git_path("logs/%s", refname);
2205        logfd = open(logfile, O_RDONLY, 0);
2206        if (logfd < 0)
2207                die_errno("Unable to read log '%s'", logfile);
2208        fstat(logfd, &st);
2209        if (!st.st_size)
2210                die("Log %s is empty.", logfile);
2211        mapsz = xsize_t(st.st_size);
2212        log_mapped = xmmap(NULL, mapsz, PROT_READ, MAP_PRIVATE, logfd, 0);
2213        logdata = log_mapped;
2214        close(logfd);
2215
2216        lastrec = NULL;
2217        rec = logend = logdata + st.st_size;
2218        while (logdata < rec) {
2219                reccnt++;
2220                if (logdata < rec && *(rec-1) == '\n')
2221                        rec--;
2222                lastgt = NULL;
2223                while (logdata < rec && *(rec-1) != '\n') {
2224                        rec--;
2225                        if (*rec == '>')
2226                                lastgt = rec;
2227                }
2228                if (!lastgt)
2229                        die("Log %s is corrupt.", logfile);
2230                date = strtoul(lastgt + 1, &tz_c, 10);
2231                if (date <= at_time || cnt == 0) {
2232                        tz = strtoul(tz_c, NULL, 10);
2233                        if (msg)
2234                                *msg = ref_msg(rec, logend);
2235                        if (cutoff_time)
2236                                *cutoff_time = date;
2237                        if (cutoff_tz)
2238                                *cutoff_tz = tz;
2239                        if (cutoff_cnt)
2240                                *cutoff_cnt = reccnt - 1;
2241                        if (lastrec) {
2242                                if (get_sha1_hex(lastrec, logged_sha1))
2243                                        die("Log %s is corrupt.", logfile);
2244                                if (get_sha1_hex(rec + 41, sha1))
2245                                        die("Log %s is corrupt.", logfile);
2246                                if (hashcmp(logged_sha1, sha1)) {
2247                                        warning("Log %s has gap after %s.",
2248                                                logfile, show_date(date, tz, DATE_RFC2822));
2249                                }
2250                        }
2251                        else if (date == at_time) {
2252                                if (get_sha1_hex(rec + 41, sha1))
2253                                        die("Log %s is corrupt.", logfile);
2254                        }
2255                        else {
2256                                if (get_sha1_hex(rec + 41, logged_sha1))
2257                                        die("Log %s is corrupt.", logfile);
2258                                if (hashcmp(logged_sha1, sha1)) {
2259                                        warning("Log %s unexpectedly ended on %s.",
2260                                                logfile, show_date(date, tz, DATE_RFC2822));
2261                                }
2262                        }
2263                        munmap(log_mapped, mapsz);
2264                        return 0;
2265                }
2266                lastrec = rec;
2267                if (cnt > 0)
2268                        cnt--;
2269        }
2270
2271        rec = logdata;
2272        while (rec < logend && *rec != '>' && *rec != '\n')
2273                rec++;
2274        if (rec == logend || *rec == '\n')
2275                die("Log %s is corrupt.", logfile);
2276        date = strtoul(rec + 1, &tz_c, 10);
2277        tz = strtoul(tz_c, NULL, 10);
2278        if (get_sha1_hex(logdata, sha1))
2279                die("Log %s is corrupt.", logfile);
2280        if (is_null_sha1(sha1)) {
2281                if (get_sha1_hex(logdata + 41, sha1))
2282                        die("Log %s is corrupt.", logfile);
2283        }
2284        if (msg)
2285                *msg = ref_msg(logdata, logend);
2286        munmap(log_mapped, mapsz);
2287
2288        if (cutoff_time)
2289                *cutoff_time = date;
2290        if (cutoff_tz)
2291                *cutoff_tz = tz;
2292        if (cutoff_cnt)
2293                *cutoff_cnt = reccnt;
2294        return 1;
2295}
2296
2297int for_each_recent_reflog_ent(const char *refname, each_reflog_ent_fn fn, long ofs, void *cb_data)
2298{
2299        const char *logfile;
2300        FILE *logfp;
2301        struct strbuf sb = STRBUF_INIT;
2302        int ret = 0;
2303
2304        logfile = git_path("logs/%s", refname);
2305        logfp = fopen(logfile, "r");
2306        if (!logfp)
2307                return -1;
2308
2309        if (ofs) {
2310                struct stat statbuf;
2311                if (fstat(fileno(logfp), &statbuf) ||
2312                    statbuf.st_size < ofs ||
2313                    fseek(logfp, -ofs, SEEK_END) ||
2314                    strbuf_getwholeline(&sb, logfp, '\n')) {
2315                        fclose(logfp);
2316                        strbuf_release(&sb);
2317                        return -1;
2318                }
2319        }
2320
2321        while (!strbuf_getwholeline(&sb, logfp, '\n')) {
2322                unsigned char osha1[20], nsha1[20];
2323                char *email_end, *message;
2324                unsigned long timestamp;
2325                int tz;
2326
2327                /* old SP new SP name <email> SP time TAB msg LF */
2328                if (sb.len < 83 || sb.buf[sb.len - 1] != '\n' ||
2329                    get_sha1_hex(sb.buf, osha1) || sb.buf[40] != ' ' ||
2330                    get_sha1_hex(sb.buf + 41, nsha1) || sb.buf[81] != ' ' ||
2331                    !(email_end = strchr(sb.buf + 82, '>')) ||
2332                    email_end[1] != ' ' ||
2333                    !(timestamp = strtoul(email_end + 2, &message, 10)) ||
2334                    !message || message[0] != ' ' ||
2335                    (message[1] != '+' && message[1] != '-') ||
2336                    !isdigit(message[2]) || !isdigit(message[3]) ||
2337                    !isdigit(message[4]) || !isdigit(message[5]))
2338                        continue; /* corrupt? */
2339                email_end[1] = '\0';
2340                tz = strtol(message + 1, NULL, 10);
2341                if (message[6] != '\t')
2342                        message += 6;
2343                else
2344                        message += 7;
2345                ret = fn(osha1, nsha1, sb.buf + 82, timestamp, tz, message,
2346                         cb_data);
2347                if (ret)
2348                        break;
2349        }
2350        fclose(logfp);
2351        strbuf_release(&sb);
2352        return ret;
2353}
2354
2355int for_each_reflog_ent(const char *refname, each_reflog_ent_fn fn, void *cb_data)
2356{
2357        return for_each_recent_reflog_ent(refname, fn, 0, cb_data);
2358}
2359
2360/*
2361 * Call fn for each reflog in the namespace indicated by name.  name
2362 * must be empty or end with '/'.  Name will be used as a scratch
2363 * space, but its contents will be restored before return.
2364 */
2365static int do_for_each_reflog(struct strbuf *name, each_ref_fn fn, void *cb_data)
2366{
2367        DIR *d = opendir(git_path("logs/%s", name->buf));
2368        int retval = 0;
2369        struct dirent *de;
2370        int oldlen = name->len;
2371
2372        if (!d)
2373                return name->len ? errno : 0;
2374
2375        while ((de = readdir(d)) != NULL) {
2376                struct stat st;
2377
2378                if (de->d_name[0] == '.')
2379                        continue;
2380                if (has_extension(de->d_name, ".lock"))
2381                        continue;
2382                strbuf_addstr(name, de->d_name);
2383                if (stat(git_path("logs/%s", name->buf), &st) < 0) {
2384                        ; /* silently ignore */
2385                } else {
2386                        if (S_ISDIR(st.st_mode)) {
2387                                strbuf_addch(name, '/');
2388                                retval = do_for_each_reflog(name, fn, cb_data);
2389                        } else {
2390                                unsigned char sha1[20];
2391                                if (read_ref_full(name->buf, sha1, 0, NULL))
2392                                        retval = error("bad ref for %s", name->buf);
2393                                else
2394                                        retval = fn(name->buf, sha1, 0, cb_data);
2395                        }
2396                        if (retval)
2397                                break;
2398                }
2399                strbuf_setlen(name, oldlen);
2400        }
2401        closedir(d);
2402        return retval;
2403}
2404
2405int for_each_reflog(each_ref_fn fn, void *cb_data)
2406{
2407        int retval;
2408        struct strbuf name;
2409        strbuf_init(&name, PATH_MAX);
2410        retval = do_for_each_reflog(&name, fn, cb_data);
2411        strbuf_release(&name);
2412        return retval;
2413}
2414
2415int update_ref(const char *action, const char *refname,
2416                const unsigned char *sha1, const unsigned char *oldval,
2417                int flags, enum action_on_err onerr)
2418{
2419        static struct ref_lock *lock;
2420        lock = lock_any_ref_for_update(refname, oldval, flags);
2421        if (!lock) {
2422                const char *str = "Cannot lock the ref '%s'.";
2423                switch (onerr) {
2424                case MSG_ON_ERR: error(str, refname); break;
2425                case DIE_ON_ERR: die(str, refname); break;
2426                case QUIET_ON_ERR: break;
2427                }
2428                return 1;
2429        }
2430        if (write_ref_sha1(lock, sha1, action) < 0) {
2431                const char *str = "Cannot update the ref '%s'.";
2432                switch (onerr) {
2433                case MSG_ON_ERR: error(str, refname); break;
2434                case DIE_ON_ERR: die(str, refname); break;
2435                case QUIET_ON_ERR: break;
2436                }
2437                return 1;
2438        }
2439        return 0;
2440}
2441
2442struct ref *find_ref_by_name(const struct ref *list, const char *name)
2443{
2444        for ( ; list; list = list->next)
2445                if (!strcmp(list->name, name))
2446                        return (struct ref *)list;
2447        return NULL;
2448}
2449
2450/*
2451 * generate a format suitable for scanf from a ref_rev_parse_rules
2452 * rule, that is replace the "%.*s" spec with a "%s" spec
2453 */
2454static void gen_scanf_fmt(char *scanf_fmt, const char *rule)
2455{
2456        char *spec;
2457
2458        spec = strstr(rule, "%.*s");
2459        if (!spec || strstr(spec + 4, "%.*s"))
2460                die("invalid rule in ref_rev_parse_rules: %s", rule);
2461
2462        /* copy all until spec */
2463        strncpy(scanf_fmt, rule, spec - rule);
2464        scanf_fmt[spec - rule] = '\0';
2465        /* copy new spec */
2466        strcat(scanf_fmt, "%s");
2467        /* copy remaining rule */
2468        strcat(scanf_fmt, spec + 4);
2469
2470        return;
2471}
2472
2473char *shorten_unambiguous_ref(const char *refname, int strict)
2474{
2475        int i;
2476        static char **scanf_fmts;
2477        static int nr_rules;
2478        char *short_name;
2479
2480        /* pre generate scanf formats from ref_rev_parse_rules[] */
2481        if (!nr_rules) {
2482                size_t total_len = 0;
2483
2484                /* the rule list is NULL terminated, count them first */
2485                for (; ref_rev_parse_rules[nr_rules]; nr_rules++)
2486                        /* no +1 because strlen("%s") < strlen("%.*s") */
2487                        total_len += strlen(ref_rev_parse_rules[nr_rules]);
2488
2489                scanf_fmts = xmalloc(nr_rules * sizeof(char *) + total_len);
2490
2491                total_len = 0;
2492                for (i = 0; i < nr_rules; i++) {
2493                        scanf_fmts[i] = (char *)&scanf_fmts[nr_rules]
2494                                        + total_len;
2495                        gen_scanf_fmt(scanf_fmts[i], ref_rev_parse_rules[i]);
2496                        total_len += strlen(ref_rev_parse_rules[i]);
2497                }
2498        }
2499
2500        /* bail out if there are no rules */
2501        if (!nr_rules)
2502                return xstrdup(refname);
2503
2504        /* buffer for scanf result, at most refname must fit */
2505        short_name = xstrdup(refname);
2506
2507        /* skip first rule, it will always match */
2508        for (i = nr_rules - 1; i > 0 ; --i) {
2509                int j;
2510                int rules_to_fail = i;
2511                int short_name_len;
2512
2513                if (1 != sscanf(refname, scanf_fmts[i], short_name))
2514                        continue;
2515
2516                short_name_len = strlen(short_name);
2517
2518                /*
2519                 * in strict mode, all (except the matched one) rules
2520                 * must fail to resolve to a valid non-ambiguous ref
2521                 */
2522                if (strict)
2523                        rules_to_fail = nr_rules;
2524
2525                /*
2526                 * check if the short name resolves to a valid ref,
2527                 * but use only rules prior to the matched one
2528                 */
2529                for (j = 0; j < rules_to_fail; j++) {
2530                        const char *rule = ref_rev_parse_rules[j];
2531                        char refname[PATH_MAX];
2532
2533                        /* skip matched rule */
2534                        if (i == j)
2535                                continue;
2536
2537                        /*
2538                         * the short name is ambiguous, if it resolves
2539                         * (with this previous rule) to a valid ref
2540                         * read_ref() returns 0 on success
2541                         */
2542                        mksnpath(refname, sizeof(refname),
2543                                 rule, short_name_len, short_name);
2544                        if (ref_exists(refname))
2545                                break;
2546                }
2547
2548                /*
2549                 * short name is non-ambiguous if all previous rules
2550                 * haven't resolved to a valid ref
2551                 */
2552                if (j == rules_to_fail)
2553                        return short_name;
2554        }
2555
2556        free(short_name);
2557        return xstrdup(refname);
2558}