3 #include "refs-internal.h"
4 #include "../iterator.h"
5 #include "../dir-iterator.h"
6 #include "../lockfile.h"
13 struct object_id old_oid;
19 * Information used (along with the information in ref_entry) to
20 * describe a single cached reference. This data structure only
21 * occurs embedded in a union in struct ref_entry, and only when
22 * (ref_entry->flag & REF_DIR) is zero.
26 * The name of the object to which this reference resolves
27 * (which may be a tag object). If REF_ISBROKEN, this is
28 * null. If REF_ISSYMREF, then this is the name of the object
29 * referred to by the last reference in the symlink chain.
34 * If REF_KNOWS_PEELED, then this field holds the peeled value
35 * of this reference, or null if the reference is known not to
36 * be peelable. See the documentation for peel_ref() for an
37 * exact definition of "peelable".
39 struct object_id peeled;
42 struct files_ref_store;
45 * Information used (along with the information in ref_entry) to
46 * describe a level in the hierarchy of references. This data
47 * structure only occurs embedded in a union in struct ref_entry, and
48 * only when (ref_entry.flag & REF_DIR) is set. In that case,
49 * (ref_entry.flag & REF_INCOMPLETE) determines whether the references
50 * in the directory have already been read:
52 * (ref_entry.flag & REF_INCOMPLETE) unset -- a directory of loose
53 * or packed references, already read.
55 * (ref_entry.flag & REF_INCOMPLETE) set -- a directory of loose
56 * references that hasn't been read yet (nor has any of its
59 * Entries within a directory are stored within a growable array of
60 * pointers to ref_entries (entries, nr, alloc). Entries 0 <= i <
61 * sorted are sorted by their component name in strcmp() order and the
62 * remaining entries are unsorted.
64 * Loose references are read lazily, one directory at a time. When a
65 * directory of loose references is read, then all of the references
66 * in that directory are stored, and REF_INCOMPLETE stubs are created
67 * for any subdirectories, but the subdirectories themselves are not
68 * read. The reading is triggered by get_ref_dir().
74 * Entries with index 0 <= i < sorted are sorted by name. New
75 * entries are appended to the list unsorted, and are sorted
76 * only when required; thus we avoid the need to sort the list
77 * after the addition of every reference.
81 /* A pointer to the files_ref_store that contains this ref_dir. */
82 struct files_ref_store *ref_store;
84 struct ref_entry **entries;
88 * Bit values for ref_entry::flag. REF_ISSYMREF=0x01,
89 * REF_ISPACKED=0x02, REF_ISBROKEN=0x04 and REF_BAD_NAME=0x08 are
90 * public values; see refs.h.
94 * The field ref_entry->u.value.peeled of this value entry contains
95 * the correct peeled value for the reference, which might be
96 * null_sha1 if the reference is not a tag or if it is broken.
98 #define REF_KNOWS_PEELED 0x10
100 /* ref_entry represents a directory of references */
104 * Entry has not yet been read from disk (used only for REF_DIR
105 * entries representing loose references)
107 #define REF_INCOMPLETE 0x40
110 * A ref_entry represents either a reference or a "subdirectory" of
113 * Each directory in the reference namespace is represented by a
114 * ref_entry with (flags & REF_DIR) set and containing a subdir member
115 * that holds the entries in that directory that have been read so
116 * far. If (flags & REF_INCOMPLETE) is set, then the directory and
117 * its subdirectories haven't been read yet. REF_INCOMPLETE is only
118 * used for loose reference directories.
120 * References are represented by a ref_entry with (flags & REF_DIR)
121 * unset and a value member that describes the reference's value. The
122 * flag member is at the ref_entry level, but it is also needed to
123 * interpret the contents of the value field (in other words, a
124 * ref_value object is not very much use without the enclosing
127 * Reference names cannot end with slash and directories' names are
128 * always stored with a trailing slash (except for the top-level
129 * directory, which is always denoted by ""). This has two nice
130 * consequences: (1) when the entries in each subdir are sorted
131 * lexicographically by name (as they usually are), the references in
132 * a whole tree can be generated in lexicographic order by traversing
133 * the tree in left-to-right, depth-first order; (2) the names of
134 * references and subdirectories cannot conflict, and therefore the
135 * presence of an empty subdirectory does not block the creation of a
136 * similarly-named reference. (The fact that reference names with the
137 * same leading components can conflict *with each other* is a
138 * separate issue that is regulated by verify_refname_available().)
140 * Please note that the name field contains the fully-qualified
141 * reference (or subdirectory) name. Space could be saved by only
142 * storing the relative names. But that would require the full names
143 * to be generated on the fly when iterating in do_for_each_ref(), and
144 * would break callback functions, who have always been able to assume
145 * that the name strings that they are passed will not be freed during
149 unsigned char flag; /* ISSYMREF? ISPACKED? */
151 struct ref_value value; /* if not (flags&REF_DIR) */
152 struct ref_dir subdir; /* if (flags&REF_DIR) */
155 * The full name of the reference (e.g., "refs/heads/master")
156 * or the full name of the directory with a trailing slash
157 * (e.g., "refs/heads/"):
159 char name[FLEX_ARRAY];
162 static void read_loose_refs(const char *dirname, struct ref_dir *dir);
163 static int search_ref_dir(struct ref_dir *dir, const char *refname, size_t len);
164 static struct ref_entry *create_dir_entry(struct files_ref_store *ref_store,
165 const char *dirname, size_t len,
167 static void add_entry_to_dir(struct ref_dir *dir, struct ref_entry *entry);
169 static struct ref_dir *get_ref_dir(struct ref_entry *entry)
172 assert(entry->flag & REF_DIR);
173 dir = &entry->u.subdir;
174 if (entry->flag & REF_INCOMPLETE) {
175 read_loose_refs(entry->name, dir);
178 * Manually add refs/bisect, which, being
179 * per-worktree, might not appear in the directory
180 * listing for refs/ in the main repo.
182 if (!strcmp(entry->name, "refs/")) {
183 int pos = search_ref_dir(dir, "refs/bisect/", 12);
185 struct ref_entry *child_entry;
186 child_entry = create_dir_entry(dir->ref_store,
189 add_entry_to_dir(dir, child_entry);
190 read_loose_refs("refs/bisect",
191 &child_entry->u.subdir);
194 entry->flag &= ~REF_INCOMPLETE;
199 static struct ref_entry *create_ref_entry(const char *refname,
200 const unsigned char *sha1, int flag,
203 struct ref_entry *ref;
206 check_refname_format(refname, REFNAME_ALLOW_ONELEVEL))
207 die("Reference has invalid format: '%s'", refname);
208 FLEX_ALLOC_STR(ref, name, refname);
209 hashcpy(ref->u.value.oid.hash, sha1);
210 oidclr(&ref->u.value.peeled);
215 static void clear_ref_dir(struct ref_dir *dir);
217 static void free_ref_entry(struct ref_entry *entry)
219 if (entry->flag & REF_DIR) {
221 * Do not use get_ref_dir() here, as that might
222 * trigger the reading of loose refs.
224 clear_ref_dir(&entry->u.subdir);
230 * Add a ref_entry to the end of dir (unsorted). Entry is always
231 * stored directly in dir; no recursion into subdirectories is
234 static void add_entry_to_dir(struct ref_dir *dir, struct ref_entry *entry)
236 ALLOC_GROW(dir->entries, dir->nr + 1, dir->alloc);
237 dir->entries[dir->nr++] = entry;
238 /* optimize for the case that entries are added in order */
240 (dir->nr == dir->sorted + 1 &&
241 strcmp(dir->entries[dir->nr - 2]->name,
242 dir->entries[dir->nr - 1]->name) < 0))
243 dir->sorted = dir->nr;
247 * Clear and free all entries in dir, recursively.
249 static void clear_ref_dir(struct ref_dir *dir)
252 for (i = 0; i < dir->nr; i++)
253 free_ref_entry(dir->entries[i]);
255 dir->sorted = dir->nr = dir->alloc = 0;
260 * Create a struct ref_entry object for the specified dirname.
261 * dirname is the name of the directory with a trailing slash (e.g.,
262 * "refs/heads/") or "" for the top-level directory.
264 static struct ref_entry *create_dir_entry(struct files_ref_store *ref_store,
265 const char *dirname, size_t len,
268 struct ref_entry *direntry;
269 FLEX_ALLOC_MEM(direntry, name, dirname, len);
270 direntry->u.subdir.ref_store = ref_store;
271 direntry->flag = REF_DIR | (incomplete ? REF_INCOMPLETE : 0);
275 static int ref_entry_cmp(const void *a, const void *b)
277 struct ref_entry *one = *(struct ref_entry **)a;
278 struct ref_entry *two = *(struct ref_entry **)b;
279 return strcmp(one->name, two->name);
282 static void sort_ref_dir(struct ref_dir *dir);
284 struct string_slice {
289 static int ref_entry_cmp_sslice(const void *key_, const void *ent_)
291 const struct string_slice *key = key_;
292 const struct ref_entry *ent = *(const struct ref_entry * const *)ent_;
293 int cmp = strncmp(key->str, ent->name, key->len);
296 return '\0' - (unsigned char)ent->name[key->len];
300 * Return the index of the entry with the given refname from the
301 * ref_dir (non-recursively), sorting dir if necessary. Return -1 if
302 * no such entry is found. dir must already be complete.
304 static int search_ref_dir(struct ref_dir *dir, const char *refname, size_t len)
306 struct ref_entry **r;
307 struct string_slice key;
309 if (refname == NULL || !dir->nr)
315 r = bsearch(&key, dir->entries, dir->nr, sizeof(*dir->entries),
316 ref_entry_cmp_sslice);
321 return r - dir->entries;
325 * Search for a directory entry directly within dir (without
326 * recursing). Sort dir if necessary. subdirname must be a directory
327 * name (i.e., end in '/'). If mkdir is set, then create the
328 * directory if it is missing; otherwise, return NULL if the desired
329 * directory cannot be found. dir must already be complete.
331 static struct ref_dir *search_for_subdir(struct ref_dir *dir,
332 const char *subdirname, size_t len,
335 int entry_index = search_ref_dir(dir, subdirname, len);
336 struct ref_entry *entry;
337 if (entry_index == -1) {
341 * Since dir is complete, the absence of a subdir
342 * means that the subdir really doesn't exist;
343 * therefore, create an empty record for it but mark
344 * the record complete.
346 entry = create_dir_entry(dir->ref_store, subdirname, len, 0);
347 add_entry_to_dir(dir, entry);
349 entry = dir->entries[entry_index];
351 return get_ref_dir(entry);
355 * If refname is a reference name, find the ref_dir within the dir
356 * tree that should hold refname. If refname is a directory name
357 * (i.e., ends in '/'), then return that ref_dir itself. dir must
358 * represent the top-level directory and must already be complete.
359 * Sort ref_dirs and recurse into subdirectories as necessary. If
360 * mkdir is set, then create any missing directories; otherwise,
361 * return NULL if the desired directory cannot be found.
363 static struct ref_dir *find_containing_dir(struct ref_dir *dir,
364 const char *refname, int mkdir)
367 for (slash = strchr(refname, '/'); slash; slash = strchr(slash + 1, '/')) {
368 size_t dirnamelen = slash - refname + 1;
369 struct ref_dir *subdir;
370 subdir = search_for_subdir(dir, refname, dirnamelen, mkdir);
382 * Find the value entry with the given name in dir, sorting ref_dirs
383 * and recursing into subdirectories as necessary. If the name is not
384 * found or it corresponds to a directory entry, return NULL.
386 static struct ref_entry *find_ref(struct ref_dir *dir, const char *refname)
389 struct ref_entry *entry;
390 dir = find_containing_dir(dir, refname, 0);
393 entry_index = search_ref_dir(dir, refname, strlen(refname));
394 if (entry_index == -1)
396 entry = dir->entries[entry_index];
397 return (entry->flag & REF_DIR) ? NULL : entry;
401 * Remove the entry with the given name from dir, recursing into
402 * subdirectories as necessary. If refname is the name of a directory
403 * (i.e., ends with '/'), then remove the directory and its contents.
404 * If the removal was successful, return the number of entries
405 * remaining in the directory entry that contained the deleted entry.
406 * If the name was not found, return -1. Please note that this
407 * function only deletes the entry from the cache; it does not delete
408 * it from the filesystem or ensure that other cache entries (which
409 * might be symbolic references to the removed entry) are updated.
410 * Nor does it remove any containing dir entries that might be made
411 * empty by the removal. dir must represent the top-level directory
412 * and must already be complete.
414 static int remove_entry(struct ref_dir *dir, const char *refname)
416 int refname_len = strlen(refname);
418 struct ref_entry *entry;
419 int is_dir = refname[refname_len - 1] == '/';
422 * refname represents a reference directory. Remove
423 * the trailing slash; otherwise we will get the
424 * directory *representing* refname rather than the
425 * one *containing* it.
427 char *dirname = xmemdupz(refname, refname_len - 1);
428 dir = find_containing_dir(dir, dirname, 0);
431 dir = find_containing_dir(dir, refname, 0);
435 entry_index = search_ref_dir(dir, refname, refname_len);
436 if (entry_index == -1)
438 entry = dir->entries[entry_index];
440 memmove(&dir->entries[entry_index],
441 &dir->entries[entry_index + 1],
442 (dir->nr - entry_index - 1) * sizeof(*dir->entries)
445 if (dir->sorted > entry_index)
447 free_ref_entry(entry);
452 * Add a ref_entry to the ref_dir (unsorted), recursing into
453 * subdirectories as necessary. dir must represent the top-level
454 * directory. Return 0 on success.
456 static int add_ref(struct ref_dir *dir, struct ref_entry *ref)
458 dir = find_containing_dir(dir, ref->name, 1);
461 add_entry_to_dir(dir, ref);
466 * Emit a warning and return true iff ref1 and ref2 have the same name
467 * and the same sha1. Die if they have the same name but different
470 static int is_dup_ref(const struct ref_entry *ref1, const struct ref_entry *ref2)
472 if (strcmp(ref1->name, ref2->name))
475 /* Duplicate name; make sure that they don't conflict: */
477 if ((ref1->flag & REF_DIR) || (ref2->flag & REF_DIR))
478 /* This is impossible by construction */
479 die("Reference directory conflict: %s", ref1->name);
481 if (oidcmp(&ref1->u.value.oid, &ref2->u.value.oid))
482 die("Duplicated ref, and SHA1s don't match: %s", ref1->name);
484 warning("Duplicated ref: %s", ref1->name);
489 * Sort the entries in dir non-recursively (if they are not already
490 * sorted) and remove any duplicate entries.
492 static void sort_ref_dir(struct ref_dir *dir)
495 struct ref_entry *last = NULL;
498 * This check also prevents passing a zero-length array to qsort(),
499 * which is a problem on some platforms.
501 if (dir->sorted == dir->nr)
504 qsort(dir->entries, dir->nr, sizeof(*dir->entries), ref_entry_cmp);
506 /* Remove any duplicates: */
507 for (i = 0, j = 0; j < dir->nr; j++) {
508 struct ref_entry *entry = dir->entries[j];
509 if (last && is_dup_ref(last, entry))
510 free_ref_entry(entry);
512 last = dir->entries[i++] = entry;
514 dir->sorted = dir->nr = i;
518 * Return true if refname, which has the specified oid and flags, can
519 * be resolved to an object in the database. If the referred-to object
520 * does not exist, emit a warning and return false.
522 static int ref_resolves_to_object(const char *refname,
523 const struct object_id *oid,
526 if (flags & REF_ISBROKEN)
528 if (!has_sha1_file(oid->hash)) {
529 error("%s does not point to a valid object!", refname);
536 * Return true if the reference described by entry can be resolved to
537 * an object in the database; otherwise, emit a warning and return
540 static int entry_resolves_to_object(struct ref_entry *entry)
542 return ref_resolves_to_object(entry->name,
543 &entry->u.value.oid, entry->flag);
546 typedef int each_ref_entry_fn(struct ref_entry *entry, void *cb_data);
549 * Call fn for each reference in dir that has index in the range
550 * offset <= index < dir->nr. Recurse into subdirectories that are in
551 * that index range, sorting them before iterating. This function
552 * does not sort dir itself; it should be sorted beforehand. fn is
553 * called for all references, including broken ones.
555 static int do_for_each_entry_in_dir(struct ref_dir *dir, int offset,
556 each_ref_entry_fn fn, void *cb_data)
559 assert(dir->sorted == dir->nr);
560 for (i = offset; i < dir->nr; i++) {
561 struct ref_entry *entry = dir->entries[i];
563 if (entry->flag & REF_DIR) {
564 struct ref_dir *subdir = get_ref_dir(entry);
565 sort_ref_dir(subdir);
566 retval = do_for_each_entry_in_dir(subdir, 0, fn, cb_data);
568 retval = fn(entry, cb_data);
577 * Load all of the refs from the dir into our in-memory cache. The hard work
578 * of loading loose refs is done by get_ref_dir(), so we just need to recurse
579 * through all of the sub-directories. We do not even need to care about
580 * sorting, as traversal order does not matter to us.
582 static void prime_ref_dir(struct ref_dir *dir)
585 for (i = 0; i < dir->nr; i++) {
586 struct ref_entry *entry = dir->entries[i];
587 if (entry->flag & REF_DIR)
588 prime_ref_dir(get_ref_dir(entry));
593 * A level in the reference hierarchy that is currently being iterated
596 struct cache_ref_iterator_level {
598 * The ref_dir being iterated over at this level. The ref_dir
599 * is sorted before being stored here.
604 * The index of the current entry within dir (which might
605 * itself be a directory). If index == -1, then the iteration
606 * hasn't yet begun. If index == dir->nr, then the iteration
607 * through this level is over.
613 * Represent an iteration through a ref_dir in the memory cache. The
614 * iteration recurses through subdirectories.
616 struct cache_ref_iterator {
617 struct ref_iterator base;
620 * The number of levels currently on the stack. This is always
621 * at least 1, because when it becomes zero the iteration is
622 * ended and this struct is freed.
626 /* The number of levels that have been allocated on the stack */
630 * A stack of levels. levels[0] is the uppermost level that is
631 * being iterated over in this iteration. (This is not
632 * necessary the top level in the references hierarchy. If we
633 * are iterating through a subtree, then levels[0] will hold
634 * the ref_dir for that subtree, and subsequent levels will go
637 struct cache_ref_iterator_level *levels;
640 static int cache_ref_iterator_advance(struct ref_iterator *ref_iterator)
642 struct cache_ref_iterator *iter =
643 (struct cache_ref_iterator *)ref_iterator;
646 struct cache_ref_iterator_level *level =
647 &iter->levels[iter->levels_nr - 1];
648 struct ref_dir *dir = level->dir;
649 struct ref_entry *entry;
651 if (level->index == -1)
654 if (++level->index == level->dir->nr) {
655 /* This level is exhausted; pop up a level */
656 if (--iter->levels_nr == 0)
657 return ref_iterator_abort(ref_iterator);
662 entry = dir->entries[level->index];
664 if (entry->flag & REF_DIR) {
665 /* push down a level */
666 ALLOC_GROW(iter->levels, iter->levels_nr + 1,
669 level = &iter->levels[iter->levels_nr++];
670 level->dir = get_ref_dir(entry);
673 iter->base.refname = entry->name;
674 iter->base.oid = &entry->u.value.oid;
675 iter->base.flags = entry->flag;
681 static enum peel_status peel_entry(struct ref_entry *entry, int repeel);
683 static int cache_ref_iterator_peel(struct ref_iterator *ref_iterator,
684 struct object_id *peeled)
686 struct cache_ref_iterator *iter =
687 (struct cache_ref_iterator *)ref_iterator;
688 struct cache_ref_iterator_level *level;
689 struct ref_entry *entry;
691 level = &iter->levels[iter->levels_nr - 1];
693 if (level->index == -1)
694 die("BUG: peel called before advance for cache iterator");
696 entry = level->dir->entries[level->index];
698 if (peel_entry(entry, 0))
700 hashcpy(peeled->hash, entry->u.value.peeled.hash);
704 static int cache_ref_iterator_abort(struct ref_iterator *ref_iterator)
706 struct cache_ref_iterator *iter =
707 (struct cache_ref_iterator *)ref_iterator;
710 base_ref_iterator_free(ref_iterator);
714 static struct ref_iterator_vtable cache_ref_iterator_vtable = {
715 cache_ref_iterator_advance,
716 cache_ref_iterator_peel,
717 cache_ref_iterator_abort
720 static struct ref_iterator *cache_ref_iterator_begin(struct ref_dir *dir)
722 struct cache_ref_iterator *iter;
723 struct ref_iterator *ref_iterator;
724 struct cache_ref_iterator_level *level;
726 iter = xcalloc(1, sizeof(*iter));
727 ref_iterator = &iter->base;
728 base_ref_iterator_init(ref_iterator, &cache_ref_iterator_vtable);
729 ALLOC_GROW(iter->levels, 10, iter->levels_alloc);
732 level = &iter->levels[0];
739 struct nonmatching_ref_data {
740 const struct string_list *skip;
741 const char *conflicting_refname;
744 static int nonmatching_ref_fn(struct ref_entry *entry, void *vdata)
746 struct nonmatching_ref_data *data = vdata;
748 if (data->skip && string_list_has_string(data->skip, entry->name))
751 data->conflicting_refname = entry->name;
756 * Return 0 if a reference named refname could be created without
757 * conflicting with the name of an existing reference in dir.
758 * See verify_refname_available for more information.
760 static int verify_refname_available_dir(const char *refname,
761 const struct string_list *extras,
762 const struct string_list *skip,
767 const char *extra_refname;
769 struct strbuf dirname = STRBUF_INIT;
773 * For the sake of comments in this function, suppose that
774 * refname is "refs/foo/bar".
779 strbuf_grow(&dirname, strlen(refname) + 1);
780 for (slash = strchr(refname, '/'); slash; slash = strchr(slash + 1, '/')) {
781 /* Expand dirname to the new prefix, not including the trailing slash: */
782 strbuf_add(&dirname, refname + dirname.len, slash - refname - dirname.len);
785 * We are still at a leading dir of the refname (e.g.,
786 * "refs/foo"; if there is a reference with that name,
787 * it is a conflict, *unless* it is in skip.
790 pos = search_ref_dir(dir, dirname.buf, dirname.len);
792 (!skip || !string_list_has_string(skip, dirname.buf))) {
794 * We found a reference whose name is
795 * a proper prefix of refname; e.g.,
796 * "refs/foo", and is not in skip.
798 strbuf_addf(err, "'%s' exists; cannot create '%s'",
799 dirname.buf, refname);
804 if (extras && string_list_has_string(extras, dirname.buf) &&
805 (!skip || !string_list_has_string(skip, dirname.buf))) {
806 strbuf_addf(err, "cannot process '%s' and '%s' at the same time",
807 refname, dirname.buf);
812 * Otherwise, we can try to continue our search with
813 * the next component. So try to look up the
814 * directory, e.g., "refs/foo/". If we come up empty,
815 * we know there is nothing under this whole prefix,
816 * but even in that case we still have to continue the
817 * search for conflicts with extras.
819 strbuf_addch(&dirname, '/');
821 pos = search_ref_dir(dir, dirname.buf, dirname.len);
824 * There was no directory "refs/foo/",
825 * so there is nothing under this
826 * whole prefix. So there is no need
827 * to continue looking for conflicting
828 * references. But we need to continue
829 * looking for conflicting extras.
833 dir = get_ref_dir(dir->entries[pos]);
839 * We are at the leaf of our refname (e.g., "refs/foo/bar").
840 * There is no point in searching for a reference with that
841 * name, because a refname isn't considered to conflict with
842 * itself. But we still need to check for references whose
843 * names are in the "refs/foo/bar/" namespace, because they
846 strbuf_addstr(&dirname, refname + dirname.len);
847 strbuf_addch(&dirname, '/');
850 pos = search_ref_dir(dir, dirname.buf, dirname.len);
854 * We found a directory named "$refname/"
855 * (e.g., "refs/foo/bar/"). It is a problem
856 * iff it contains any ref that is not in
859 struct nonmatching_ref_data data;
862 data.conflicting_refname = NULL;
863 dir = get_ref_dir(dir->entries[pos]);
865 if (do_for_each_entry_in_dir(dir, 0, nonmatching_ref_fn, &data)) {
866 strbuf_addf(err, "'%s' exists; cannot create '%s'",
867 data.conflicting_refname, refname);
873 extra_refname = find_descendant_ref(dirname.buf, extras, skip);
875 strbuf_addf(err, "cannot process '%s' and '%s' at the same time",
876 refname, extra_refname);
881 strbuf_release(&dirname);
885 struct packed_ref_cache {
886 struct ref_entry *root;
889 * Count of references to the data structure in this instance,
890 * including the pointer from files_ref_store::packed if any.
891 * The data will not be freed as long as the reference count
894 unsigned int referrers;
897 * Iff the packed-refs file associated with this instance is
898 * currently locked for writing, this points at the associated
899 * lock (which is owned by somebody else). The referrer count
900 * is also incremented when the file is locked and decremented
901 * when it is unlocked.
903 struct lock_file *lock;
905 /* The metadata from when this packed-refs cache was read */
906 struct stat_validity validity;
910 * Future: need to be in "struct repository"
911 * when doing a full libification.
913 struct files_ref_store {
914 struct ref_store base;
915 struct ref_entry *loose;
916 struct packed_ref_cache *packed;
919 /* Lock used for the main packed-refs file: */
920 static struct lock_file packlock;
923 * Increment the reference count of *packed_refs.
925 static void acquire_packed_ref_cache(struct packed_ref_cache *packed_refs)
927 packed_refs->referrers++;
931 * Decrease the reference count of *packed_refs. If it goes to zero,
932 * free *packed_refs and return true; otherwise return false.
934 static int release_packed_ref_cache(struct packed_ref_cache *packed_refs)
936 if (!--packed_refs->referrers) {
937 free_ref_entry(packed_refs->root);
938 stat_validity_clear(&packed_refs->validity);
946 static void clear_packed_ref_cache(struct files_ref_store *refs)
949 struct packed_ref_cache *packed_refs = refs->packed;
951 if (packed_refs->lock)
952 die("internal error: packed-ref cache cleared while locked");
954 release_packed_ref_cache(packed_refs);
958 static void clear_loose_ref_cache(struct files_ref_store *refs)
961 free_ref_entry(refs->loose);
967 * Create a new submodule ref cache and add it to the internal
970 static struct ref_store *files_ref_store_create(const char *submodule)
972 struct files_ref_store *refs = xcalloc(1, sizeof(*refs));
973 struct ref_store *ref_store = (struct ref_store *)refs;
975 base_ref_store_init(ref_store, &refs_be_files, submodule);
981 * Downcast ref_store to files_ref_store. Die if ref_store is not a
982 * files_ref_store. If submodule_allowed is not true, then also die if
983 * files_ref_store is for a submodule (i.e., not for the main
984 * repository). caller is used in any necessary error messages.
986 static struct files_ref_store *files_downcast(
987 struct ref_store *ref_store, int submodule_allowed,
990 if (ref_store->be != &refs_be_files)
991 die("BUG: ref_store is type \"%s\" not \"files\" in %s",
992 ref_store->be->name, caller);
994 if (!submodule_allowed)
995 assert_main_repository(ref_store, caller);
997 return (struct files_ref_store *)ref_store;
1001 * Return a pointer to the reference store for the specified
1002 * submodule. For the main repository, use submodule==NULL; such a
1003 * call cannot fail. For a submodule, the submodule must exist and be
1004 * a nonbare repository, otherwise return NULL. Verify that the
1005 * reference store is a files_ref_store, and cast it to that type
1006 * before returning it.
1008 static struct files_ref_store *get_files_ref_store(const char *submodule,
1011 struct ref_store *refs = get_ref_store(submodule);
1013 return refs ? files_downcast(refs, 1, caller) : NULL;
1016 /* The length of a peeled reference line in packed-refs, including EOL: */
1017 #define PEELED_LINE_LENGTH 42
1020 * The packed-refs header line that we write out. Perhaps other
1021 * traits will be added later. The trailing space is required.
1023 static const char PACKED_REFS_HEADER[] =
1024 "# pack-refs with: peeled fully-peeled \n";
1027 * Parse one line from a packed-refs file. Write the SHA1 to sha1.
1028 * Return a pointer to the refname within the line (null-terminated),
1029 * or NULL if there was a problem.
1031 static const char *parse_ref_line(struct strbuf *line, unsigned char *sha1)
1036 * 42: the answer to everything.
1038 * In this case, it happens to be the answer to
1039 * 40 (length of sha1 hex representation)
1040 * +1 (space in between hex and name)
1041 * +1 (newline at the end of the line)
1043 if (line->len <= 42)
1046 if (get_sha1_hex(line->buf, sha1) < 0)
1048 if (!isspace(line->buf[40]))
1051 ref = line->buf + 41;
1055 if (line->buf[line->len - 1] != '\n')
1057 line->buf[--line->len] = 0;
1063 * Read f, which is a packed-refs file, into dir.
1065 * A comment line of the form "# pack-refs with: " may contain zero or
1066 * more traits. We interpret the traits as follows:
1070 * Probably no references are peeled. But if the file contains a
1071 * peeled value for a reference, we will use it.
1075 * References under "refs/tags/", if they *can* be peeled, *are*
1076 * peeled in this file. References outside of "refs/tags/" are
1077 * probably not peeled even if they could have been, but if we find
1078 * a peeled value for such a reference we will use it.
1082 * All references in the file that can be peeled are peeled.
1083 * Inversely (and this is more important), any references in the
1084 * file for which no peeled value is recorded is not peelable. This
1085 * trait should typically be written alongside "peeled" for
1086 * compatibility with older clients, but we do not require it
1087 * (i.e., "peeled" is a no-op if "fully-peeled" is set).
1089 static void read_packed_refs(FILE *f, struct ref_dir *dir)
1091 struct ref_entry *last = NULL;
1092 struct strbuf line = STRBUF_INIT;
1093 enum { PEELED_NONE, PEELED_TAGS, PEELED_FULLY } peeled = PEELED_NONE;
1095 while (strbuf_getwholeline(&line, f, '\n') != EOF) {
1096 unsigned char sha1[20];
1097 const char *refname;
1100 if (skip_prefix(line.buf, "# pack-refs with:", &traits)) {
1101 if (strstr(traits, " fully-peeled "))
1102 peeled = PEELED_FULLY;
1103 else if (strstr(traits, " peeled "))
1104 peeled = PEELED_TAGS;
1105 /* perhaps other traits later as well */
1109 refname = parse_ref_line(&line, sha1);
1111 int flag = REF_ISPACKED;
1113 if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {
1114 if (!refname_is_safe(refname))
1115 die("packed refname is dangerous: %s", refname);
1117 flag |= REF_BAD_NAME | REF_ISBROKEN;
1119 last = create_ref_entry(refname, sha1, flag, 0);
1120 if (peeled == PEELED_FULLY ||
1121 (peeled == PEELED_TAGS && starts_with(refname, "refs/tags/")))
1122 last->flag |= REF_KNOWS_PEELED;
1127 line.buf[0] == '^' &&
1128 line.len == PEELED_LINE_LENGTH &&
1129 line.buf[PEELED_LINE_LENGTH - 1] == '\n' &&
1130 !get_sha1_hex(line.buf + 1, sha1)) {
1131 hashcpy(last->u.value.peeled.hash, sha1);
1133 * Regardless of what the file header said,
1134 * we definitely know the value of *this*
1137 last->flag |= REF_KNOWS_PEELED;
1141 strbuf_release(&line);
1145 * Get the packed_ref_cache for the specified files_ref_store,
1146 * creating it if necessary.
1148 static struct packed_ref_cache *get_packed_ref_cache(struct files_ref_store *refs)
1150 char *packed_refs_file;
1152 if (*refs->base.submodule)
1153 packed_refs_file = git_pathdup_submodule(refs->base.submodule,
1156 packed_refs_file = git_pathdup("packed-refs");
1159 !stat_validity_check(&refs->packed->validity, packed_refs_file))
1160 clear_packed_ref_cache(refs);
1162 if (!refs->packed) {
1165 refs->packed = xcalloc(1, sizeof(*refs->packed));
1166 acquire_packed_ref_cache(refs->packed);
1167 refs->packed->root = create_dir_entry(refs, "", 0, 0);
1168 f = fopen(packed_refs_file, "r");
1170 stat_validity_update(&refs->packed->validity, fileno(f));
1171 read_packed_refs(f, get_ref_dir(refs->packed->root));
1175 free(packed_refs_file);
1176 return refs->packed;
1179 static struct ref_dir *get_packed_ref_dir(struct packed_ref_cache *packed_ref_cache)
1181 return get_ref_dir(packed_ref_cache->root);
1184 static struct ref_dir *get_packed_refs(struct files_ref_store *refs)
1186 return get_packed_ref_dir(get_packed_ref_cache(refs));
1190 * Add a reference to the in-memory packed reference cache. This may
1191 * only be called while the packed-refs file is locked (see
1192 * lock_packed_refs()). To actually write the packed-refs file, call
1193 * commit_packed_refs().
1195 static void add_packed_ref(struct files_ref_store *refs,
1196 const char *refname, const unsigned char *sha1)
1198 struct packed_ref_cache *packed_ref_cache = get_packed_ref_cache(refs);
1200 if (!packed_ref_cache->lock)
1201 die("internal error: packed refs not locked");
1202 add_ref(get_packed_ref_dir(packed_ref_cache),
1203 create_ref_entry(refname, sha1, REF_ISPACKED, 1));
1207 * Read the loose references from the namespace dirname into dir
1208 * (without recursing). dirname must end with '/'. dir must be the
1209 * directory entry corresponding to dirname.
1211 static void read_loose_refs(const char *dirname, struct ref_dir *dir)
1213 struct files_ref_store *refs = dir->ref_store;
1216 int dirnamelen = strlen(dirname);
1217 struct strbuf refname;
1218 struct strbuf path = STRBUF_INIT;
1219 size_t path_baselen;
1221 if (*refs->base.submodule)
1222 strbuf_git_path_submodule(&path, refs->base.submodule, "%s", dirname);
1224 strbuf_git_path(&path, "%s", dirname);
1225 path_baselen = path.len;
1227 d = opendir(path.buf);
1229 strbuf_release(&path);
1233 strbuf_init(&refname, dirnamelen + 257);
1234 strbuf_add(&refname, dirname, dirnamelen);
1236 while ((de = readdir(d)) != NULL) {
1237 unsigned char sha1[20];
1241 if (de->d_name[0] == '.')
1243 if (ends_with(de->d_name, ".lock"))
1245 strbuf_addstr(&refname, de->d_name);
1246 strbuf_addstr(&path, de->d_name);
1247 if (stat(path.buf, &st) < 0) {
1248 ; /* silently ignore */
1249 } else if (S_ISDIR(st.st_mode)) {
1250 strbuf_addch(&refname, '/');
1251 add_entry_to_dir(dir,
1252 create_dir_entry(refs, refname.buf,
1257 if (*refs->base.submodule) {
1260 read_ok = !resolve_gitlink_ref(refs->base.submodule,
1263 read_ok = !read_ref_full(refname.buf,
1264 RESOLVE_REF_READING,
1270 flag |= REF_ISBROKEN;
1271 } else if (is_null_sha1(sha1)) {
1273 * It is so astronomically unlikely
1274 * that NULL_SHA1 is the SHA-1 of an
1275 * actual object that we consider its
1276 * appearance in a loose reference
1277 * file to be repo corruption
1278 * (probably due to a software bug).
1280 flag |= REF_ISBROKEN;
1283 if (check_refname_format(refname.buf,
1284 REFNAME_ALLOW_ONELEVEL)) {
1285 if (!refname_is_safe(refname.buf))
1286 die("loose refname is dangerous: %s", refname.buf);
1288 flag |= REF_BAD_NAME | REF_ISBROKEN;
1290 add_entry_to_dir(dir,
1291 create_ref_entry(refname.buf, sha1, flag, 0));
1293 strbuf_setlen(&refname, dirnamelen);
1294 strbuf_setlen(&path, path_baselen);
1296 strbuf_release(&refname);
1297 strbuf_release(&path);
1301 static struct ref_dir *get_loose_refs(struct files_ref_store *refs)
1305 * Mark the top-level directory complete because we
1306 * are about to read the only subdirectory that can
1309 refs->loose = create_dir_entry(refs, "", 0, 0);
1311 * Create an incomplete entry for "refs/":
1313 add_entry_to_dir(get_ref_dir(refs->loose),
1314 create_dir_entry(refs, "refs/", 5, 1));
1316 return get_ref_dir(refs->loose);
1320 * Return the ref_entry for the given refname from the packed
1321 * references. If it does not exist, return NULL.
1323 static struct ref_entry *get_packed_ref(struct files_ref_store *refs,
1324 const char *refname)
1326 return find_ref(get_packed_refs(refs), refname);
1330 * A loose ref file doesn't exist; check for a packed ref.
1332 static int resolve_packed_ref(struct files_ref_store *refs,
1333 const char *refname,
1334 unsigned char *sha1, unsigned int *flags)
1336 struct ref_entry *entry;
1339 * The loose reference file does not exist; check for a packed
1342 entry = get_packed_ref(refs, refname);
1344 hashcpy(sha1, entry->u.value.oid.hash);
1345 *flags |= REF_ISPACKED;
1348 /* refname is not a packed reference. */
1352 int read_raw_ref(const char *refname, unsigned char *sha1,
1353 struct strbuf *referent, unsigned int *type)
1355 struct files_ref_store *refs =
1356 get_files_ref_store(NULL, "read_raw_ref");
1357 struct strbuf sb_contents = STRBUF_INIT;
1358 struct strbuf sb_path = STRBUF_INIT;
1367 strbuf_reset(&sb_path);
1368 strbuf_git_path(&sb_path, "%s", refname);
1373 * We might have to loop back here to avoid a race
1374 * condition: first we lstat() the file, then we try
1375 * to read it as a link or as a file. But if somebody
1376 * changes the type of the file (file <-> directory
1377 * <-> symlink) between the lstat() and reading, then
1378 * we don't want to report that as an error but rather
1379 * try again starting with the lstat().
1382 if (lstat(path, &st) < 0) {
1383 if (errno != ENOENT)
1385 if (resolve_packed_ref(refs, refname, sha1, type)) {
1393 /* Follow "normalized" - ie "refs/.." symlinks by hand */
1394 if (S_ISLNK(st.st_mode)) {
1395 strbuf_reset(&sb_contents);
1396 if (strbuf_readlink(&sb_contents, path, 0) < 0) {
1397 if (errno == ENOENT || errno == EINVAL)
1398 /* inconsistent with lstat; retry */
1403 if (starts_with(sb_contents.buf, "refs/") &&
1404 !check_refname_format(sb_contents.buf, 0)) {
1405 strbuf_swap(&sb_contents, referent);
1406 *type |= REF_ISSYMREF;
1412 /* Is it a directory? */
1413 if (S_ISDIR(st.st_mode)) {
1415 * Even though there is a directory where the loose
1416 * ref is supposed to be, there could still be a
1419 if (resolve_packed_ref(refs, refname, sha1, type)) {
1428 * Anything else, just open it and try to use it as
1431 fd = open(path, O_RDONLY);
1433 if (errno == ENOENT)
1434 /* inconsistent with lstat; retry */
1439 strbuf_reset(&sb_contents);
1440 if (strbuf_read(&sb_contents, fd, 256) < 0) {
1441 int save_errno = errno;
1447 strbuf_rtrim(&sb_contents);
1448 buf = sb_contents.buf;
1449 if (starts_with(buf, "ref:")) {
1451 while (isspace(*buf))
1454 strbuf_reset(referent);
1455 strbuf_addstr(referent, buf);
1456 *type |= REF_ISSYMREF;
1462 * Please note that FETCH_HEAD has additional
1463 * data after the sha.
1465 if (get_sha1_hex(buf, sha1) ||
1466 (buf[40] != '\0' && !isspace(buf[40]))) {
1467 *type |= REF_ISBROKEN;
1476 strbuf_release(&sb_path);
1477 strbuf_release(&sb_contents);
1482 static void unlock_ref(struct ref_lock *lock)
1484 /* Do not free lock->lk -- atexit() still looks at them */
1486 rollback_lock_file(lock->lk);
1487 free(lock->ref_name);
1491 #define MAXREFLEN (1024)
1493 static int resolve_gitlink_ref_recursive(struct files_ref_store *refs,
1494 const char *refname, unsigned char *sha1,
1498 char buffer[128], *p;
1501 if (recursion > SYMREF_MAXDEPTH || strlen(refname) > MAXREFLEN)
1503 path = *refs->base.submodule
1504 ? git_pathdup_submodule(refs->base.submodule, "%s", refname)
1505 : git_pathdup("%s", refname);
1506 fd = open(path, O_RDONLY);
1511 return resolve_packed_ref(refs, refname, sha1, &flags);
1514 len = read(fd, buffer, sizeof(buffer)-1);
1518 while (len && isspace(buffer[len-1]))
1522 /* Was it a detached head or an old-fashioned symlink? */
1523 if (!get_sha1_hex(buffer, sha1))
1527 if (strncmp(buffer, "ref:", 4))
1533 return resolve_gitlink_ref_recursive(refs, p, sha1, recursion+1);
1536 int resolve_gitlink_ref(const char *path, const char *refname, unsigned char *sha1)
1538 int len = strlen(path);
1539 struct strbuf submodule = STRBUF_INIT;
1540 struct files_ref_store *refs;
1542 while (len && path[len-1] == '/')
1547 strbuf_add(&submodule, path, len);
1548 refs = get_files_ref_store(submodule.buf, "resolve_gitlink_ref");
1550 strbuf_release(&submodule);
1553 strbuf_release(&submodule);
1555 return resolve_gitlink_ref_recursive(refs, refname, sha1, 0);
1559 * Lock refname, without following symrefs, and set *lock_p to point
1560 * at a newly-allocated lock object. Fill in lock->old_oid, referent,
1561 * and type similarly to read_raw_ref().
1563 * The caller must verify that refname is a "safe" reference name (in
1564 * the sense of refname_is_safe()) before calling this function.
1566 * If the reference doesn't already exist, verify that refname doesn't
1567 * have a D/F conflict with any existing references. extras and skip
1568 * are passed to verify_refname_available_dir() for this check.
1570 * If mustexist is not set and the reference is not found or is
1571 * broken, lock the reference anyway but clear sha1.
1573 * Return 0 on success. On failure, write an error message to err and
1574 * return TRANSACTION_NAME_CONFLICT or TRANSACTION_GENERIC_ERROR.
1576 * Implementation note: This function is basically
1581 * but it includes a lot more code to
1582 * - Deal with possible races with other processes
1583 * - Avoid calling verify_refname_available_dir() when it can be
1584 * avoided, namely if we were successfully able to read the ref
1585 * - Generate informative error messages in the case of failure
1587 static int lock_raw_ref(const char *refname, int mustexist,
1588 const struct string_list *extras,
1589 const struct string_list *skip,
1590 struct ref_lock **lock_p,
1591 struct strbuf *referent,
1595 struct files_ref_store *refs =
1596 get_files_ref_store(NULL, "lock_raw_ref");
1597 struct ref_lock *lock;
1598 struct strbuf ref_file = STRBUF_INIT;
1599 int attempts_remaining = 3;
1600 int ret = TRANSACTION_GENERIC_ERROR;
1605 /* First lock the file so it can't change out from under us. */
1607 *lock_p = lock = xcalloc(1, sizeof(*lock));
1609 lock->ref_name = xstrdup(refname);
1610 strbuf_git_path(&ref_file, "%s", refname);
1613 switch (safe_create_leading_directories(ref_file.buf)) {
1615 break; /* success */
1618 * Suppose refname is "refs/foo/bar". We just failed
1619 * to create the containing directory, "refs/foo",
1620 * because there was a non-directory in the way. This
1621 * indicates a D/F conflict, probably because of
1622 * another reference such as "refs/foo". There is no
1623 * reason to expect this error to be transitory.
1625 if (verify_refname_available(refname, extras, skip, err)) {
1628 * To the user the relevant error is
1629 * that the "mustexist" reference is
1633 strbuf_addf(err, "unable to resolve reference '%s'",
1637 * The error message set by
1638 * verify_refname_available_dir() is OK.
1640 ret = TRANSACTION_NAME_CONFLICT;
1644 * The file that is in the way isn't a loose
1645 * reference. Report it as a low-level
1648 strbuf_addf(err, "unable to create lock file %s.lock; "
1649 "non-directory in the way",
1654 /* Maybe another process was tidying up. Try again. */
1655 if (--attempts_remaining > 0)
1659 strbuf_addf(err, "unable to create directory for %s",
1665 lock->lk = xcalloc(1, sizeof(struct lock_file));
1667 if (hold_lock_file_for_update(lock->lk, ref_file.buf, LOCK_NO_DEREF) < 0) {
1668 if (errno == ENOENT && --attempts_remaining > 0) {
1670 * Maybe somebody just deleted one of the
1671 * directories leading to ref_file. Try
1676 unable_to_lock_message(ref_file.buf, errno, err);
1682 * Now we hold the lock and can read the reference without
1683 * fear that its value will change.
1686 if (read_raw_ref(refname, lock->old_oid.hash, referent, type)) {
1687 if (errno == ENOENT) {
1689 /* Garden variety missing reference. */
1690 strbuf_addf(err, "unable to resolve reference '%s'",
1695 * Reference is missing, but that's OK. We
1696 * know that there is not a conflict with
1697 * another loose reference because
1698 * (supposing that we are trying to lock
1699 * reference "refs/foo/bar"):
1701 * - We were successfully able to create
1702 * the lockfile refs/foo/bar.lock, so we
1703 * know there cannot be a loose reference
1706 * - We got ENOENT and not EISDIR, so we
1707 * know that there cannot be a loose
1708 * reference named "refs/foo/bar/baz".
1711 } else if (errno == EISDIR) {
1713 * There is a directory in the way. It might have
1714 * contained references that have been deleted. If
1715 * we don't require that the reference already
1716 * exists, try to remove the directory so that it
1717 * doesn't cause trouble when we want to rename the
1718 * lockfile into place later.
1721 /* Garden variety missing reference. */
1722 strbuf_addf(err, "unable to resolve reference '%s'",
1725 } else if (remove_dir_recursively(&ref_file,
1726 REMOVE_DIR_EMPTY_ONLY)) {
1727 if (verify_refname_available_dir(
1728 refname, extras, skip,
1729 get_loose_refs(refs),
1732 * The error message set by
1733 * verify_refname_available() is OK.
1735 ret = TRANSACTION_NAME_CONFLICT;
1739 * We can't delete the directory,
1740 * but we also don't know of any
1741 * references that it should
1744 strbuf_addf(err, "there is a non-empty directory '%s' "
1745 "blocking reference '%s'",
1746 ref_file.buf, refname);
1750 } else if (errno == EINVAL && (*type & REF_ISBROKEN)) {
1751 strbuf_addf(err, "unable to resolve reference '%s': "
1752 "reference broken", refname);
1755 strbuf_addf(err, "unable to resolve reference '%s': %s",
1756 refname, strerror(errno));
1761 * If the ref did not exist and we are creating it,
1762 * make sure there is no existing packed ref whose
1763 * name begins with our refname, nor a packed ref
1764 * whose name is a proper prefix of our refname.
1766 if (verify_refname_available_dir(
1767 refname, extras, skip,
1768 get_packed_refs(refs),
1782 strbuf_release(&ref_file);
1787 * Peel the entry (if possible) and return its new peel_status. If
1788 * repeel is true, re-peel the entry even if there is an old peeled
1789 * value that is already stored in it.
1791 * It is OK to call this function with a packed reference entry that
1792 * might be stale and might even refer to an object that has since
1793 * been garbage-collected. In such a case, if the entry has
1794 * REF_KNOWS_PEELED then leave the status unchanged and return
1795 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.
1797 static enum peel_status peel_entry(struct ref_entry *entry, int repeel)
1799 enum peel_status status;
1801 if (entry->flag & REF_KNOWS_PEELED) {
1803 entry->flag &= ~REF_KNOWS_PEELED;
1804 oidclr(&entry->u.value.peeled);
1806 return is_null_oid(&entry->u.value.peeled) ?
1807 PEEL_NON_TAG : PEEL_PEELED;
1810 if (entry->flag & REF_ISBROKEN)
1812 if (entry->flag & REF_ISSYMREF)
1813 return PEEL_IS_SYMREF;
1815 status = peel_object(entry->u.value.oid.hash, entry->u.value.peeled.hash);
1816 if (status == PEEL_PEELED || status == PEEL_NON_TAG)
1817 entry->flag |= REF_KNOWS_PEELED;
1821 int peel_ref(const char *refname, unsigned char *sha1)
1823 struct files_ref_store *refs = get_files_ref_store(NULL, "peel_ref");
1825 unsigned char base[20];
1827 if (current_ref_iter && current_ref_iter->refname == refname) {
1828 struct object_id peeled;
1830 if (ref_iterator_peel(current_ref_iter, &peeled))
1832 hashcpy(sha1, peeled.hash);
1836 if (read_ref_full(refname, RESOLVE_REF_READING, base, &flag))
1840 * If the reference is packed, read its ref_entry from the
1841 * cache in the hope that we already know its peeled value.
1842 * We only try this optimization on packed references because
1843 * (a) forcing the filling of the loose reference cache could
1844 * be expensive and (b) loose references anyway usually do not
1845 * have REF_KNOWS_PEELED.
1847 if (flag & REF_ISPACKED) {
1848 struct ref_entry *r = get_packed_ref(refs, refname);
1850 if (peel_entry(r, 0))
1852 hashcpy(sha1, r->u.value.peeled.hash);
1857 return peel_object(base, sha1);
1860 struct files_ref_iterator {
1861 struct ref_iterator base;
1863 struct packed_ref_cache *packed_ref_cache;
1864 struct ref_iterator *iter0;
1868 static int files_ref_iterator_advance(struct ref_iterator *ref_iterator)
1870 struct files_ref_iterator *iter =
1871 (struct files_ref_iterator *)ref_iterator;
1874 while ((ok = ref_iterator_advance(iter->iter0)) == ITER_OK) {
1875 if (!(iter->flags & DO_FOR_EACH_INCLUDE_BROKEN) &&
1876 !ref_resolves_to_object(iter->iter0->refname,
1878 iter->iter0->flags))
1881 iter->base.refname = iter->iter0->refname;
1882 iter->base.oid = iter->iter0->oid;
1883 iter->base.flags = iter->iter0->flags;
1888 if (ref_iterator_abort(ref_iterator) != ITER_DONE)
1894 static int files_ref_iterator_peel(struct ref_iterator *ref_iterator,
1895 struct object_id *peeled)
1897 struct files_ref_iterator *iter =
1898 (struct files_ref_iterator *)ref_iterator;
1900 return ref_iterator_peel(iter->iter0, peeled);
1903 static int files_ref_iterator_abort(struct ref_iterator *ref_iterator)
1905 struct files_ref_iterator *iter =
1906 (struct files_ref_iterator *)ref_iterator;
1910 ok = ref_iterator_abort(iter->iter0);
1912 release_packed_ref_cache(iter->packed_ref_cache);
1913 base_ref_iterator_free(ref_iterator);
1917 static struct ref_iterator_vtable files_ref_iterator_vtable = {
1918 files_ref_iterator_advance,
1919 files_ref_iterator_peel,
1920 files_ref_iterator_abort
1923 struct ref_iterator *files_ref_iterator_begin(
1924 const char *submodule,
1925 const char *prefix, unsigned int flags)
1927 struct files_ref_store *refs =
1928 get_files_ref_store(submodule, "ref_iterator_begin");
1929 struct ref_dir *loose_dir, *packed_dir;
1930 struct ref_iterator *loose_iter, *packed_iter;
1931 struct files_ref_iterator *iter;
1932 struct ref_iterator *ref_iterator;
1935 return empty_ref_iterator_begin();
1937 if (ref_paranoia < 0)
1938 ref_paranoia = git_env_bool("GIT_REF_PARANOIA", 0);
1940 flags |= DO_FOR_EACH_INCLUDE_BROKEN;
1942 iter = xcalloc(1, sizeof(*iter));
1943 ref_iterator = &iter->base;
1944 base_ref_iterator_init(ref_iterator, &files_ref_iterator_vtable);
1947 * We must make sure that all loose refs are read before
1948 * accessing the packed-refs file; this avoids a race
1949 * condition if loose refs are migrated to the packed-refs
1950 * file by a simultaneous process, but our in-memory view is
1951 * from before the migration. We ensure this as follows:
1952 * First, we call prime_ref_dir(), which pre-reads the loose
1953 * references for the subtree into the cache. (If they've
1954 * already been read, that's OK; we only need to guarantee
1955 * that they're read before the packed refs, not *how much*
1956 * before.) After that, we call get_packed_ref_cache(), which
1957 * internally checks whether the packed-ref cache is up to
1958 * date with what is on disk, and re-reads it if not.
1961 loose_dir = get_loose_refs(refs);
1963 if (prefix && *prefix)
1964 loose_dir = find_containing_dir(loose_dir, prefix, 0);
1967 prime_ref_dir(loose_dir);
1968 loose_iter = cache_ref_iterator_begin(loose_dir);
1970 /* There's nothing to iterate over. */
1971 loose_iter = empty_ref_iterator_begin();
1974 iter->packed_ref_cache = get_packed_ref_cache(refs);
1975 acquire_packed_ref_cache(iter->packed_ref_cache);
1976 packed_dir = get_packed_ref_dir(iter->packed_ref_cache);
1978 if (prefix && *prefix)
1979 packed_dir = find_containing_dir(packed_dir, prefix, 0);
1982 packed_iter = cache_ref_iterator_begin(packed_dir);
1984 /* There's nothing to iterate over. */
1985 packed_iter = empty_ref_iterator_begin();
1988 iter->iter0 = overlay_ref_iterator_begin(loose_iter, packed_iter);
1989 iter->flags = flags;
1991 return ref_iterator;
1995 * Verify that the reference locked by lock has the value old_sha1.
1996 * Fail if the reference doesn't exist and mustexist is set. Return 0
1997 * on success. On error, write an error message to err, set errno, and
1998 * return a negative value.
2000 static int verify_lock(struct ref_lock *lock,
2001 const unsigned char *old_sha1, int mustexist,
2006 if (read_ref_full(lock->ref_name,
2007 mustexist ? RESOLVE_REF_READING : 0,
2008 lock->old_oid.hash, NULL)) {
2010 int save_errno = errno;
2011 strbuf_addf(err, "can't verify ref '%s'", lock->ref_name);
2015 hashclr(lock->old_oid.hash);
2019 if (old_sha1 && hashcmp(lock->old_oid.hash, old_sha1)) {
2020 strbuf_addf(err, "ref '%s' is at %s but expected %s",
2022 sha1_to_hex(lock->old_oid.hash),
2023 sha1_to_hex(old_sha1));
2030 static int remove_empty_directories(struct strbuf *path)
2033 * we want to create a file but there is a directory there;
2034 * if that is an empty directory (or a directory that contains
2035 * only empty directories), remove them.
2037 return remove_dir_recursively(path, REMOVE_DIR_EMPTY_ONLY);
2041 * Locks a ref returning the lock on success and NULL on failure.
2042 * On failure errno is set to something meaningful.
2044 static struct ref_lock *lock_ref_sha1_basic(const char *refname,
2045 const unsigned char *old_sha1,
2046 const struct string_list *extras,
2047 const struct string_list *skip,
2048 unsigned int flags, int *type,
2051 struct files_ref_store *refs =
2052 get_files_ref_store(NULL, "lock_ref_sha1_basic");
2053 struct strbuf ref_file = STRBUF_INIT;
2054 struct ref_lock *lock;
2056 int lflags = LOCK_NO_DEREF;
2057 int mustexist = (old_sha1 && !is_null_sha1(old_sha1));
2058 int resolve_flags = RESOLVE_REF_NO_RECURSE;
2059 int attempts_remaining = 3;
2064 lock = xcalloc(1, sizeof(struct ref_lock));
2067 resolve_flags |= RESOLVE_REF_READING;
2068 if (flags & REF_DELETING)
2069 resolve_flags |= RESOLVE_REF_ALLOW_BAD_NAME;
2071 strbuf_git_path(&ref_file, "%s", refname);
2072 resolved = !!resolve_ref_unsafe(refname, resolve_flags,
2073 lock->old_oid.hash, type);
2074 if (!resolved && errno == EISDIR) {
2076 * we are trying to lock foo but we used to
2077 * have foo/bar which now does not exist;
2078 * it is normal for the empty directory 'foo'
2081 if (remove_empty_directories(&ref_file)) {
2083 if (!verify_refname_available_dir(
2084 refname, extras, skip,
2085 get_loose_refs(refs), err))
2086 strbuf_addf(err, "there are still refs under '%s'",
2090 resolved = !!resolve_ref_unsafe(refname, resolve_flags,
2091 lock->old_oid.hash, type);
2095 if (last_errno != ENOTDIR ||
2096 !verify_refname_available_dir(
2097 refname, extras, skip,
2098 get_loose_refs(refs), err))
2099 strbuf_addf(err, "unable to resolve reference '%s': %s",
2100 refname, strerror(last_errno));
2106 * If the ref did not exist and we are creating it, make sure
2107 * there is no existing packed ref whose name begins with our
2108 * refname, nor a packed ref whose name is a proper prefix of
2111 if (is_null_oid(&lock->old_oid) &&
2112 verify_refname_available_dir(refname, extras, skip,
2113 get_packed_refs(refs),
2115 last_errno = ENOTDIR;
2119 lock->lk = xcalloc(1, sizeof(struct lock_file));
2121 lock->ref_name = xstrdup(refname);
2124 switch (safe_create_leading_directories_const(ref_file.buf)) {
2126 break; /* success */
2128 if (--attempts_remaining > 0)
2133 strbuf_addf(err, "unable to create directory for '%s'",
2138 if (hold_lock_file_for_update(lock->lk, ref_file.buf, lflags) < 0) {
2140 if (errno == ENOENT && --attempts_remaining > 0)
2142 * Maybe somebody just deleted one of the
2143 * directories leading to ref_file. Try
2148 unable_to_lock_message(ref_file.buf, errno, err);
2152 if (verify_lock(lock, old_sha1, mustexist, err)) {
2163 strbuf_release(&ref_file);
2169 * Write an entry to the packed-refs file for the specified refname.
2170 * If peeled is non-NULL, write it as the entry's peeled value.
2172 static void write_packed_entry(FILE *fh, char *refname, unsigned char *sha1,
2173 unsigned char *peeled)
2175 fprintf_or_die(fh, "%s %s\n", sha1_to_hex(sha1), refname);
2177 fprintf_or_die(fh, "^%s\n", sha1_to_hex(peeled));
2181 * An each_ref_entry_fn that writes the entry to a packed-refs file.
2183 static int write_packed_entry_fn(struct ref_entry *entry, void *cb_data)
2185 enum peel_status peel_status = peel_entry(entry, 0);
2187 if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)
2188 error("internal error: %s is not a valid packed reference!",
2190 write_packed_entry(cb_data, entry->name, entry->u.value.oid.hash,
2191 peel_status == PEEL_PEELED ?
2192 entry->u.value.peeled.hash : NULL);
2197 * Lock the packed-refs file for writing. Flags is passed to
2198 * hold_lock_file_for_update(). Return 0 on success. On errors, set
2199 * errno appropriately and return a nonzero value.
2201 static int lock_packed_refs(struct files_ref_store *refs, int flags)
2203 static int timeout_configured = 0;
2204 static int timeout_value = 1000;
2205 struct packed_ref_cache *packed_ref_cache;
2207 assert_main_repository(&refs->base, "lock_packed_refs");
2209 if (!timeout_configured) {
2210 git_config_get_int("core.packedrefstimeout", &timeout_value);
2211 timeout_configured = 1;
2214 if (hold_lock_file_for_update_timeout(
2215 &packlock, git_path("packed-refs"),
2216 flags, timeout_value) < 0)
2219 * Get the current packed-refs while holding the lock. If the
2220 * packed-refs file has been modified since we last read it,
2221 * this will automatically invalidate the cache and re-read
2222 * the packed-refs file.
2224 packed_ref_cache = get_packed_ref_cache(refs);
2225 packed_ref_cache->lock = &packlock;
2226 /* Increment the reference count to prevent it from being freed: */
2227 acquire_packed_ref_cache(packed_ref_cache);
2232 * Write the current version of the packed refs cache from memory to
2233 * disk. The packed-refs file must already be locked for writing (see
2234 * lock_packed_refs()). Return zero on success. On errors, set errno
2235 * and return a nonzero value
2237 static int commit_packed_refs(struct files_ref_store *refs)
2239 struct packed_ref_cache *packed_ref_cache =
2240 get_packed_ref_cache(refs);
2245 assert_main_repository(&refs->base, "commit_packed_refs");
2247 if (!packed_ref_cache->lock)
2248 die("internal error: packed-refs not locked");
2250 out = fdopen_lock_file(packed_ref_cache->lock, "w");
2252 die_errno("unable to fdopen packed-refs descriptor");
2254 fprintf_or_die(out, "%s", PACKED_REFS_HEADER);
2255 do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache),
2256 0, write_packed_entry_fn, out);
2258 if (commit_lock_file(packed_ref_cache->lock)) {
2262 packed_ref_cache->lock = NULL;
2263 release_packed_ref_cache(packed_ref_cache);
2269 * Rollback the lockfile for the packed-refs file, and discard the
2270 * in-memory packed reference cache. (The packed-refs file will be
2271 * read anew if it is needed again after this function is called.)
2273 static void rollback_packed_refs(struct files_ref_store *refs)
2275 struct packed_ref_cache *packed_ref_cache =
2276 get_packed_ref_cache(refs);
2278 assert_main_repository(&refs->base, "rollback_packed_refs");
2280 if (!packed_ref_cache->lock)
2281 die("internal error: packed-refs not locked");
2282 rollback_lock_file(packed_ref_cache->lock);
2283 packed_ref_cache->lock = NULL;
2284 release_packed_ref_cache(packed_ref_cache);
2285 clear_packed_ref_cache(refs);
2288 struct ref_to_prune {
2289 struct ref_to_prune *next;
2290 unsigned char sha1[20];
2291 char name[FLEX_ARRAY];
2294 struct pack_refs_cb_data {
2296 struct ref_dir *packed_refs;
2297 struct ref_to_prune *ref_to_prune;
2301 * An each_ref_entry_fn that is run over loose references only. If
2302 * the loose reference can be packed, add an entry in the packed ref
2303 * cache. If the reference should be pruned, also add it to
2304 * ref_to_prune in the pack_refs_cb_data.
2306 static int pack_if_possible_fn(struct ref_entry *entry, void *cb_data)
2308 struct pack_refs_cb_data *cb = cb_data;
2309 enum peel_status peel_status;
2310 struct ref_entry *packed_entry;
2311 int is_tag_ref = starts_with(entry->name, "refs/tags/");
2313 /* Do not pack per-worktree refs: */
2314 if (ref_type(entry->name) != REF_TYPE_NORMAL)
2317 /* ALWAYS pack tags */
2318 if (!(cb->flags & PACK_REFS_ALL) && !is_tag_ref)
2321 /* Do not pack symbolic or broken refs: */
2322 if ((entry->flag & REF_ISSYMREF) || !entry_resolves_to_object(entry))
2325 /* Add a packed ref cache entry equivalent to the loose entry. */
2326 peel_status = peel_entry(entry, 1);
2327 if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)
2328 die("internal error peeling reference %s (%s)",
2329 entry->name, oid_to_hex(&entry->u.value.oid));
2330 packed_entry = find_ref(cb->packed_refs, entry->name);
2332 /* Overwrite existing packed entry with info from loose entry */
2333 packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED;
2334 oidcpy(&packed_entry->u.value.oid, &entry->u.value.oid);
2336 packed_entry = create_ref_entry(entry->name, entry->u.value.oid.hash,
2337 REF_ISPACKED | REF_KNOWS_PEELED, 0);
2338 add_ref(cb->packed_refs, packed_entry);
2340 oidcpy(&packed_entry->u.value.peeled, &entry->u.value.peeled);
2342 /* Schedule the loose reference for pruning if requested. */
2343 if ((cb->flags & PACK_REFS_PRUNE)) {
2344 struct ref_to_prune *n;
2345 FLEX_ALLOC_STR(n, name, entry->name);
2346 hashcpy(n->sha1, entry->u.value.oid.hash);
2347 n->next = cb->ref_to_prune;
2348 cb->ref_to_prune = n;
2354 * Remove empty parents, but spare refs/ and immediate subdirs.
2355 * Note: munges *name.
2357 static void try_remove_empty_parents(char *name)
2362 for (i = 0; i < 2; i++) { /* refs/{heads,tags,...}/ */
2363 while (*p && *p != '/')
2365 /* tolerate duplicate slashes; see check_refname_format() */
2369 for (q = p; *q; q++)
2372 while (q > p && *q != '/')
2374 while (q > p && *(q-1) == '/')
2379 if (rmdir(git_path("%s", name)))
2384 /* make sure nobody touched the ref, and unlink */
2385 static void prune_ref(struct ref_to_prune *r)
2387 struct ref_transaction *transaction;
2388 struct strbuf err = STRBUF_INIT;
2390 if (check_refname_format(r->name, 0))
2393 transaction = ref_transaction_begin(&err);
2395 ref_transaction_delete(transaction, r->name, r->sha1,
2396 REF_ISPRUNING | REF_NODEREF, NULL, &err) ||
2397 ref_transaction_commit(transaction, &err)) {
2398 ref_transaction_free(transaction);
2399 error("%s", err.buf);
2400 strbuf_release(&err);
2403 ref_transaction_free(transaction);
2404 strbuf_release(&err);
2405 try_remove_empty_parents(r->name);
2408 static void prune_refs(struct ref_to_prune *r)
2416 int pack_refs(unsigned int flags)
2418 struct files_ref_store *refs =
2419 get_files_ref_store(NULL, "pack_refs");
2420 struct pack_refs_cb_data cbdata;
2422 memset(&cbdata, 0, sizeof(cbdata));
2423 cbdata.flags = flags;
2425 lock_packed_refs(refs, LOCK_DIE_ON_ERROR);
2426 cbdata.packed_refs = get_packed_refs(refs);
2428 do_for_each_entry_in_dir(get_loose_refs(refs), 0,
2429 pack_if_possible_fn, &cbdata);
2431 if (commit_packed_refs(refs))
2432 die_errno("unable to overwrite old ref-pack file");
2434 prune_refs(cbdata.ref_to_prune);
2439 * Rewrite the packed-refs file, omitting any refs listed in
2440 * 'refnames'. On error, leave packed-refs unchanged, write an error
2441 * message to 'err', and return a nonzero value.
2443 * The refs in 'refnames' needn't be sorted. `err` must not be NULL.
2445 static int repack_without_refs(struct string_list *refnames, struct strbuf *err)
2447 struct files_ref_store *refs =
2448 get_files_ref_store(NULL, "repack_without_refs");
2449 struct ref_dir *packed;
2450 struct string_list_item *refname;
2451 int ret, needs_repacking = 0, removed = 0;
2455 /* Look for a packed ref */
2456 for_each_string_list_item(refname, refnames) {
2457 if (get_packed_ref(refs, refname->string)) {
2458 needs_repacking = 1;
2463 /* Avoid locking if we have nothing to do */
2464 if (!needs_repacking)
2465 return 0; /* no refname exists in packed refs */
2467 if (lock_packed_refs(refs, 0)) {
2468 unable_to_lock_message(git_path("packed-refs"), errno, err);
2471 packed = get_packed_refs(refs);
2473 /* Remove refnames from the cache */
2474 for_each_string_list_item(refname, refnames)
2475 if (remove_entry(packed, refname->string) != -1)
2479 * All packed entries disappeared while we were
2480 * acquiring the lock.
2482 rollback_packed_refs(refs);
2486 /* Write what remains */
2487 ret = commit_packed_refs(refs);
2489 strbuf_addf(err, "unable to overwrite old ref-pack file: %s",
2494 static int delete_ref_loose(struct ref_lock *lock, int flag, struct strbuf *err)
2498 if (!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) {
2500 * loose. The loose file name is the same as the
2501 * lockfile name, minus ".lock":
2503 char *loose_filename = get_locked_file_path(lock->lk);
2504 int res = unlink_or_msg(loose_filename, err);
2505 free(loose_filename);
2512 int delete_refs(struct string_list *refnames, unsigned int flags)
2514 struct strbuf err = STRBUF_INIT;
2520 result = repack_without_refs(refnames, &err);
2523 * If we failed to rewrite the packed-refs file, then
2524 * it is unsafe to try to remove loose refs, because
2525 * doing so might expose an obsolete packed value for
2526 * a reference that might even point at an object that
2527 * has been garbage collected.
2529 if (refnames->nr == 1)
2530 error(_("could not delete reference %s: %s"),
2531 refnames->items[0].string, err.buf);
2533 error(_("could not delete references: %s"), err.buf);
2538 for (i = 0; i < refnames->nr; i++) {
2539 const char *refname = refnames->items[i].string;
2541 if (delete_ref(refname, NULL, flags))
2542 result |= error(_("could not remove reference %s"), refname);
2546 strbuf_release(&err);
2551 * People using contrib's git-new-workdir have .git/logs/refs ->
2552 * /some/other/path/.git/logs/refs, and that may live on another device.
2554 * IOW, to avoid cross device rename errors, the temporary renamed log must
2555 * live into logs/refs.
2557 #define TMP_RENAMED_LOG "logs/refs/.tmp-renamed-log"
2559 static int rename_tmp_log(const char *newrefname)
2561 int attempts_remaining = 4;
2562 struct strbuf path = STRBUF_INIT;
2566 strbuf_reset(&path);
2567 strbuf_git_path(&path, "logs/%s", newrefname);
2568 switch (safe_create_leading_directories_const(path.buf)) {
2570 break; /* success */
2572 if (--attempts_remaining > 0)
2576 error("unable to create directory for %s", newrefname);
2580 if (rename(git_path(TMP_RENAMED_LOG), path.buf)) {
2581 if ((errno==EISDIR || errno==ENOTDIR) && --attempts_remaining > 0) {
2583 * rename(a, b) when b is an existing
2584 * directory ought to result in ISDIR, but
2585 * Solaris 5.8 gives ENOTDIR. Sheesh.
2587 if (remove_empty_directories(&path)) {
2588 error("Directory not empty: logs/%s", newrefname);
2592 } else if (errno == ENOENT && --attempts_remaining > 0) {
2594 * Maybe another process just deleted one of
2595 * the directories in the path to newrefname.
2596 * Try again from the beginning.
2600 error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s: %s",
2601 newrefname, strerror(errno));
2607 strbuf_release(&path);
2611 int verify_refname_available(const char *newname,
2612 const struct string_list *extras,
2613 const struct string_list *skip,
2616 struct files_ref_store *refs =
2617 get_files_ref_store(NULL, "verify_refname_available");
2618 struct ref_dir *packed_refs = get_packed_refs(refs);
2619 struct ref_dir *loose_refs = get_loose_refs(refs);
2621 if (verify_refname_available_dir(newname, extras, skip,
2622 packed_refs, err) ||
2623 verify_refname_available_dir(newname, extras, skip,
2630 static int write_ref_to_lockfile(struct ref_lock *lock,
2631 const unsigned char *sha1, struct strbuf *err);
2632 static int commit_ref_update(struct ref_lock *lock,
2633 const unsigned char *sha1, const char *logmsg,
2634 struct strbuf *err);
2636 int rename_ref(const char *oldrefname, const char *newrefname, const char *logmsg)
2638 unsigned char sha1[20], orig_sha1[20];
2639 int flag = 0, logmoved = 0;
2640 struct ref_lock *lock;
2641 struct stat loginfo;
2642 int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);
2643 struct strbuf err = STRBUF_INIT;
2645 if (log && S_ISLNK(loginfo.st_mode))
2646 return error("reflog for %s is a symlink", oldrefname);
2648 if (!resolve_ref_unsafe(oldrefname, RESOLVE_REF_READING | RESOLVE_REF_NO_RECURSE,
2650 return error("refname %s not found", oldrefname);
2652 if (flag & REF_ISSYMREF)
2653 return error("refname %s is a symbolic ref, renaming it is not supported",
2655 if (!rename_ref_available(oldrefname, newrefname))
2658 if (log && rename(git_path("logs/%s", oldrefname), git_path(TMP_RENAMED_LOG)))
2659 return error("unable to move logfile logs/%s to "TMP_RENAMED_LOG": %s",
2660 oldrefname, strerror(errno));
2662 if (delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {
2663 error("unable to delete old %s", oldrefname);
2668 * Since we are doing a shallow lookup, sha1 is not the
2669 * correct value to pass to delete_ref as old_sha1. But that
2670 * doesn't matter, because an old_sha1 check wouldn't add to
2671 * the safety anyway; we want to delete the reference whatever
2672 * its current value.
2674 if (!read_ref_full(newrefname, RESOLVE_REF_READING | RESOLVE_REF_NO_RECURSE,
2676 delete_ref(newrefname, NULL, REF_NODEREF)) {
2677 if (errno==EISDIR) {
2678 struct strbuf path = STRBUF_INIT;
2681 strbuf_git_path(&path, "%s", newrefname);
2682 result = remove_empty_directories(&path);
2683 strbuf_release(&path);
2686 error("Directory not empty: %s", newrefname);
2690 error("unable to delete existing %s", newrefname);
2695 if (log && rename_tmp_log(newrefname))
2700 lock = lock_ref_sha1_basic(newrefname, NULL, NULL, NULL, REF_NODEREF,
2703 error("unable to rename '%s' to '%s': %s", oldrefname, newrefname, err.buf);
2704 strbuf_release(&err);
2707 hashcpy(lock->old_oid.hash, orig_sha1);
2709 if (write_ref_to_lockfile(lock, orig_sha1, &err) ||
2710 commit_ref_update(lock, orig_sha1, logmsg, &err)) {
2711 error("unable to write current sha1 into %s: %s", newrefname, err.buf);
2712 strbuf_release(&err);
2719 lock = lock_ref_sha1_basic(oldrefname, NULL, NULL, NULL, REF_NODEREF,
2722 error("unable to lock %s for rollback: %s", oldrefname, err.buf);
2723 strbuf_release(&err);
2727 flag = log_all_ref_updates;
2728 log_all_ref_updates = 0;
2729 if (write_ref_to_lockfile(lock, orig_sha1, &err) ||
2730 commit_ref_update(lock, orig_sha1, NULL, &err)) {
2731 error("unable to write current sha1 into %s: %s", oldrefname, err.buf);
2732 strbuf_release(&err);
2734 log_all_ref_updates = flag;
2737 if (logmoved && rename(git_path("logs/%s", newrefname), git_path("logs/%s", oldrefname)))
2738 error("unable to restore logfile %s from %s: %s",
2739 oldrefname, newrefname, strerror(errno));
2740 if (!logmoved && log &&
2741 rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", oldrefname)))
2742 error("unable to restore logfile %s from "TMP_RENAMED_LOG": %s",
2743 oldrefname, strerror(errno));
2748 static int close_ref(struct ref_lock *lock)
2750 if (close_lock_file(lock->lk))
2755 static int commit_ref(struct ref_lock *lock)
2757 char *path = get_locked_file_path(lock->lk);
2760 if (!lstat(path, &st) && S_ISDIR(st.st_mode)) {
2762 * There is a directory at the path we want to rename
2763 * the lockfile to. Hopefully it is empty; try to
2766 size_t len = strlen(path);
2767 struct strbuf sb_path = STRBUF_INIT;
2769 strbuf_attach(&sb_path, path, len, len);
2772 * If this fails, commit_lock_file() will also fail
2773 * and will report the problem.
2775 remove_empty_directories(&sb_path);
2776 strbuf_release(&sb_path);
2781 if (commit_lock_file(lock->lk))
2787 * Create a reflog for a ref. If force_create = 0, the reflog will
2788 * only be created for certain refs (those for which
2789 * should_autocreate_reflog returns non-zero. Otherwise, create it
2790 * regardless of the ref name. Fill in *err and return -1 on failure.
2792 static int log_ref_setup(const char *refname, struct strbuf *logfile, struct strbuf *err, int force_create)
2794 int logfd, oflags = O_APPEND | O_WRONLY;
2796 strbuf_git_path(logfile, "logs/%s", refname);
2797 if (force_create || should_autocreate_reflog(refname)) {
2798 if (safe_create_leading_directories(logfile->buf) < 0) {
2799 strbuf_addf(err, "unable to create directory for '%s': "
2800 "%s", logfile->buf, strerror(errno));
2806 logfd = open(logfile->buf, oflags, 0666);
2808 if (!(oflags & O_CREAT) && (errno == ENOENT || errno == EISDIR))
2811 if (errno == EISDIR) {
2812 if (remove_empty_directories(logfile)) {
2813 strbuf_addf(err, "there are still logs under "
2814 "'%s'", logfile->buf);
2817 logfd = open(logfile->buf, oflags, 0666);
2821 strbuf_addf(err, "unable to append to '%s': %s",
2822 logfile->buf, strerror(errno));
2827 adjust_shared_perm(logfile->buf);
2833 int safe_create_reflog(const char *refname, int force_create, struct strbuf *err)
2836 struct strbuf sb = STRBUF_INIT;
2838 ret = log_ref_setup(refname, &sb, err, force_create);
2839 strbuf_release(&sb);
2843 static int log_ref_write_fd(int fd, const unsigned char *old_sha1,
2844 const unsigned char *new_sha1,
2845 const char *committer, const char *msg)
2847 int msglen, written;
2848 unsigned maxlen, len;
2851 msglen = msg ? strlen(msg) : 0;
2852 maxlen = strlen(committer) + msglen + 100;
2853 logrec = xmalloc(maxlen);
2854 len = xsnprintf(logrec, maxlen, "%s %s %s\n",
2855 sha1_to_hex(old_sha1),
2856 sha1_to_hex(new_sha1),
2859 len += copy_reflog_msg(logrec + len - 1, msg) - 1;
2861 written = len <= maxlen ? write_in_full(fd, logrec, len) : -1;
2869 static int log_ref_write_1(const char *refname, const unsigned char *old_sha1,
2870 const unsigned char *new_sha1, const char *msg,
2871 struct strbuf *logfile, int flags,
2874 int logfd, result, oflags = O_APPEND | O_WRONLY;
2876 if (log_all_ref_updates < 0)
2877 log_all_ref_updates = !is_bare_repository();
2879 result = log_ref_setup(refname, logfile, err, flags & REF_FORCE_CREATE_REFLOG);
2884 logfd = open(logfile->buf, oflags);
2887 result = log_ref_write_fd(logfd, old_sha1, new_sha1,
2888 git_committer_info(0), msg);
2890 strbuf_addf(err, "unable to append to '%s': %s", logfile->buf,
2896 strbuf_addf(err, "unable to append to '%s': %s", logfile->buf,
2903 static int log_ref_write(const char *refname, const unsigned char *old_sha1,
2904 const unsigned char *new_sha1, const char *msg,
2905 int flags, struct strbuf *err)
2907 return files_log_ref_write(refname, old_sha1, new_sha1, msg, flags,
2911 int files_log_ref_write(const char *refname, const unsigned char *old_sha1,
2912 const unsigned char *new_sha1, const char *msg,
2913 int flags, struct strbuf *err)
2915 struct strbuf sb = STRBUF_INIT;
2916 int ret = log_ref_write_1(refname, old_sha1, new_sha1, msg, &sb, flags,
2918 strbuf_release(&sb);
2923 * Write sha1 into the open lockfile, then close the lockfile. On
2924 * errors, rollback the lockfile, fill in *err and
2927 static int write_ref_to_lockfile(struct ref_lock *lock,
2928 const unsigned char *sha1, struct strbuf *err)
2930 static char term = '\n';
2934 o = parse_object(sha1);
2937 "trying to write ref '%s' with nonexistent object %s",
2938 lock->ref_name, sha1_to_hex(sha1));
2942 if (o->type != OBJ_COMMIT && is_branch(lock->ref_name)) {
2944 "trying to write non-commit object %s to branch '%s'",
2945 sha1_to_hex(sha1), lock->ref_name);
2949 fd = get_lock_file_fd(lock->lk);
2950 if (write_in_full(fd, sha1_to_hex(sha1), 40) != 40 ||
2951 write_in_full(fd, &term, 1) != 1 ||
2952 close_ref(lock) < 0) {
2954 "couldn't write '%s'", get_lock_file_path(lock->lk));
2962 * Commit a change to a loose reference that has already been written
2963 * to the loose reference lockfile. Also update the reflogs if
2964 * necessary, using the specified lockmsg (which can be NULL).
2966 static int commit_ref_update(struct ref_lock *lock,
2967 const unsigned char *sha1, const char *logmsg,
2970 struct files_ref_store *refs =
2971 get_files_ref_store(NULL, "commit_ref_update");
2973 clear_loose_ref_cache(refs);
2974 if (log_ref_write(lock->ref_name, lock->old_oid.hash, sha1, logmsg, 0, err)) {
2975 char *old_msg = strbuf_detach(err, NULL);
2976 strbuf_addf(err, "cannot update the ref '%s': %s",
2977 lock->ref_name, old_msg);
2983 if (strcmp(lock->ref_name, "HEAD") != 0) {
2985 * Special hack: If a branch is updated directly and HEAD
2986 * points to it (may happen on the remote side of a push
2987 * for example) then logically the HEAD reflog should be
2989 * A generic solution implies reverse symref information,
2990 * but finding all symrefs pointing to the given branch
2991 * would be rather costly for this rare event (the direct
2992 * update of a branch) to be worth it. So let's cheat and
2993 * check with HEAD only which should cover 99% of all usage
2994 * scenarios (even 100% of the default ones).
2996 unsigned char head_sha1[20];
2998 const char *head_ref;
3000 head_ref = resolve_ref_unsafe("HEAD", RESOLVE_REF_READING,
3001 head_sha1, &head_flag);
3002 if (head_ref && (head_flag & REF_ISSYMREF) &&
3003 !strcmp(head_ref, lock->ref_name)) {
3004 struct strbuf log_err = STRBUF_INIT;
3005 if (log_ref_write("HEAD", lock->old_oid.hash, sha1,
3006 logmsg, 0, &log_err)) {
3007 error("%s", log_err.buf);
3008 strbuf_release(&log_err);
3013 if (commit_ref(lock)) {
3014 strbuf_addf(err, "couldn't set '%s'", lock->ref_name);
3023 static int create_ref_symlink(struct ref_lock *lock, const char *target)
3026 #ifndef NO_SYMLINK_HEAD
3027 char *ref_path = get_locked_file_path(lock->lk);
3029 ret = symlink(target, ref_path);
3033 fprintf(stderr, "no symlink - falling back to symbolic ref\n");
3038 static void update_symref_reflog(struct ref_lock *lock, const char *refname,
3039 const char *target, const char *logmsg)
3041 struct strbuf err = STRBUF_INIT;
3042 unsigned char new_sha1[20];
3043 if (logmsg && !read_ref(target, new_sha1) &&
3044 log_ref_write(refname, lock->old_oid.hash, new_sha1, logmsg, 0, &err)) {
3045 error("%s", err.buf);
3046 strbuf_release(&err);
3050 static int create_symref_locked(struct ref_lock *lock, const char *refname,
3051 const char *target, const char *logmsg)
3053 if (prefer_symlink_refs && !create_ref_symlink(lock, target)) {
3054 update_symref_reflog(lock, refname, target, logmsg);
3058 if (!fdopen_lock_file(lock->lk, "w"))
3059 return error("unable to fdopen %s: %s",
3060 lock->lk->tempfile.filename.buf, strerror(errno));
3062 update_symref_reflog(lock, refname, target, logmsg);
3064 /* no error check; commit_ref will check ferror */
3065 fprintf(lock->lk->tempfile.fp, "ref: %s\n", target);
3066 if (commit_ref(lock) < 0)
3067 return error("unable to write symref for %s: %s", refname,
3072 int create_symref(const char *refname, const char *target, const char *logmsg)
3074 struct strbuf err = STRBUF_INIT;
3075 struct ref_lock *lock;
3078 lock = lock_ref_sha1_basic(refname, NULL, NULL, NULL, REF_NODEREF, NULL,
3081 error("%s", err.buf);
3082 strbuf_release(&err);
3086 ret = create_symref_locked(lock, refname, target, logmsg);
3091 int set_worktree_head_symref(const char *gitdir, const char *target)
3093 static struct lock_file head_lock;
3094 struct ref_lock *lock;
3095 struct strbuf head_path = STRBUF_INIT;
3096 const char *head_rel;
3099 strbuf_addf(&head_path, "%s/HEAD", absolute_path(gitdir));
3100 if (hold_lock_file_for_update(&head_lock, head_path.buf,
3101 LOCK_NO_DEREF) < 0) {
3102 struct strbuf err = STRBUF_INIT;
3103 unable_to_lock_message(head_path.buf, errno, &err);
3104 error("%s", err.buf);
3105 strbuf_release(&err);
3106 strbuf_release(&head_path);
3110 /* head_rel will be "HEAD" for the main tree, "worktrees/wt/HEAD" for
3112 head_rel = remove_leading_path(head_path.buf,
3113 absolute_path(get_git_common_dir()));
3114 /* to make use of create_symref_locked(), initialize ref_lock */
3115 lock = xcalloc(1, sizeof(struct ref_lock));
3116 lock->lk = &head_lock;
3117 lock->ref_name = xstrdup(head_rel);
3119 ret = create_symref_locked(lock, head_rel, target, NULL);
3121 unlock_ref(lock); /* will free lock */
3122 strbuf_release(&head_path);
3126 int reflog_exists(const char *refname)
3130 return !lstat(git_path("logs/%s", refname), &st) &&
3131 S_ISREG(st.st_mode);
3134 int delete_reflog(const char *refname)
3136 return remove_path(git_path("logs/%s", refname));
3139 static int show_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn, void *cb_data)
3141 unsigned char osha1[20], nsha1[20];
3142 char *email_end, *message;
3143 unsigned long timestamp;
3146 /* old SP new SP name <email> SP time TAB msg LF */
3147 if (sb->len < 83 || sb->buf[sb->len - 1] != '\n' ||
3148 get_sha1_hex(sb->buf, osha1) || sb->buf[40] != ' ' ||
3149 get_sha1_hex(sb->buf + 41, nsha1) || sb->buf[81] != ' ' ||
3150 !(email_end = strchr(sb->buf + 82, '>')) ||
3151 email_end[1] != ' ' ||
3152 !(timestamp = strtoul(email_end + 2, &message, 10)) ||
3153 !message || message[0] != ' ' ||
3154 (message[1] != '+' && message[1] != '-') ||
3155 !isdigit(message[2]) || !isdigit(message[3]) ||
3156 !isdigit(message[4]) || !isdigit(message[5]))
3157 return 0; /* corrupt? */
3158 email_end[1] = '\0';
3159 tz = strtol(message + 1, NULL, 10);
3160 if (message[6] != '\t')
3164 return fn(osha1, nsha1, sb->buf + 82, timestamp, tz, message, cb_data);
3167 static char *find_beginning_of_line(char *bob, char *scan)
3169 while (bob < scan && *(--scan) != '\n')
3170 ; /* keep scanning backwards */
3172 * Return either beginning of the buffer, or LF at the end of
3173 * the previous line.
3178 int for_each_reflog_ent_reverse(const char *refname, each_reflog_ent_fn fn, void *cb_data)
3180 struct strbuf sb = STRBUF_INIT;
3183 int ret = 0, at_tail = 1;
3185 logfp = fopen(git_path("logs/%s", refname), "r");
3189 /* Jump to the end */
3190 if (fseek(logfp, 0, SEEK_END) < 0)
3191 return error("cannot seek back reflog for %s: %s",
3192 refname, strerror(errno));
3194 while (!ret && 0 < pos) {
3200 /* Fill next block from the end */
3201 cnt = (sizeof(buf) < pos) ? sizeof(buf) : pos;
3202 if (fseek(logfp, pos - cnt, SEEK_SET))
3203 return error("cannot seek back reflog for %s: %s",
3204 refname, strerror(errno));
3205 nread = fread(buf, cnt, 1, logfp);
3207 return error("cannot read %d bytes from reflog for %s: %s",
3208 cnt, refname, strerror(errno));
3211 scanp = endp = buf + cnt;
3212 if (at_tail && scanp[-1] == '\n')
3213 /* Looking at the final LF at the end of the file */
3217 while (buf < scanp) {
3219 * terminating LF of the previous line, or the beginning
3224 bp = find_beginning_of_line(buf, scanp);
3228 * The newline is the end of the previous line,
3229 * so we know we have complete line starting
3230 * at (bp + 1). Prefix it onto any prior data
3231 * we collected for the line and process it.
3233 strbuf_splice(&sb, 0, 0, bp + 1, endp - (bp + 1));
3236 ret = show_one_reflog_ent(&sb, fn, cb_data);
3242 * We are at the start of the buffer, and the
3243 * start of the file; there is no previous
3244 * line, and we have everything for this one.
3245 * Process it, and we can end the loop.
3247 strbuf_splice(&sb, 0, 0, buf, endp - buf);
3248 ret = show_one_reflog_ent(&sb, fn, cb_data);
3255 * We are at the start of the buffer, and there
3256 * is more file to read backwards. Which means
3257 * we are in the middle of a line. Note that we
3258 * may get here even if *bp was a newline; that
3259 * just means we are at the exact end of the
3260 * previous line, rather than some spot in the
3263 * Save away what we have to be combined with
3264 * the data from the next read.
3266 strbuf_splice(&sb, 0, 0, buf, endp - buf);
3273 die("BUG: reverse reflog parser had leftover data");
3276 strbuf_release(&sb);
3280 int for_each_reflog_ent(const char *refname, each_reflog_ent_fn fn, void *cb_data)
3283 struct strbuf sb = STRBUF_INIT;
3286 logfp = fopen(git_path("logs/%s", refname), "r");
3290 while (!ret && !strbuf_getwholeline(&sb, logfp, '\n'))
3291 ret = show_one_reflog_ent(&sb, fn, cb_data);
3293 strbuf_release(&sb);
3297 struct files_reflog_iterator {
3298 struct ref_iterator base;
3300 struct dir_iterator *dir_iterator;
3301 struct object_id oid;
3304 static int files_reflog_iterator_advance(struct ref_iterator *ref_iterator)
3306 struct files_reflog_iterator *iter =
3307 (struct files_reflog_iterator *)ref_iterator;
3308 struct dir_iterator *diter = iter->dir_iterator;
3311 while ((ok = dir_iterator_advance(diter)) == ITER_OK) {
3314 if (!S_ISREG(diter->st.st_mode))
3316 if (diter->basename[0] == '.')
3318 if (ends_with(diter->basename, ".lock"))
3321 if (read_ref_full(diter->relative_path, 0,
3322 iter->oid.hash, &flags)) {
3323 error("bad ref for %s", diter->path.buf);
3327 iter->base.refname = diter->relative_path;
3328 iter->base.oid = &iter->oid;
3329 iter->base.flags = flags;
3333 iter->dir_iterator = NULL;
3334 if (ref_iterator_abort(ref_iterator) == ITER_ERROR)
3339 static int files_reflog_iterator_peel(struct ref_iterator *ref_iterator,
3340 struct object_id *peeled)
3342 die("BUG: ref_iterator_peel() called for reflog_iterator");
3345 static int files_reflog_iterator_abort(struct ref_iterator *ref_iterator)
3347 struct files_reflog_iterator *iter =
3348 (struct files_reflog_iterator *)ref_iterator;
3351 if (iter->dir_iterator)
3352 ok = dir_iterator_abort(iter->dir_iterator);
3354 base_ref_iterator_free(ref_iterator);
3358 static struct ref_iterator_vtable files_reflog_iterator_vtable = {
3359 files_reflog_iterator_advance,
3360 files_reflog_iterator_peel,
3361 files_reflog_iterator_abort
3364 struct ref_iterator *files_reflog_iterator_begin(void)
3366 struct files_reflog_iterator *iter = xcalloc(1, sizeof(*iter));
3367 struct ref_iterator *ref_iterator = &iter->base;
3369 base_ref_iterator_init(ref_iterator, &files_reflog_iterator_vtable);
3370 iter->dir_iterator = dir_iterator_begin(git_path("logs"));
3371 return ref_iterator;
3374 int for_each_reflog(each_ref_fn fn, void *cb_data)
3376 return do_for_each_ref_iterator(files_reflog_iterator_begin(),
3380 static int ref_update_reject_duplicates(struct string_list *refnames,
3383 int i, n = refnames->nr;
3387 for (i = 1; i < n; i++)
3388 if (!strcmp(refnames->items[i - 1].string, refnames->items[i].string)) {
3390 "multiple updates for ref '%s' not allowed.",
3391 refnames->items[i].string);
3398 * If update is a direct update of head_ref (the reference pointed to
3399 * by HEAD), then add an extra REF_LOG_ONLY update for HEAD.
3401 static int split_head_update(struct ref_update *update,
3402 struct ref_transaction *transaction,
3403 const char *head_ref,
3404 struct string_list *affected_refnames,
3407 struct string_list_item *item;
3408 struct ref_update *new_update;
3410 if ((update->flags & REF_LOG_ONLY) ||
3411 (update->flags & REF_ISPRUNING) ||
3412 (update->flags & REF_UPDATE_VIA_HEAD))
3415 if (strcmp(update->refname, head_ref))
3419 * First make sure that HEAD is not already in the
3420 * transaction. This insertion is O(N) in the transaction
3421 * size, but it happens at most once per transaction.
3423 item = string_list_insert(affected_refnames, "HEAD");
3425 /* An entry already existed */
3427 "multiple updates for 'HEAD' (including one "
3428 "via its referent '%s') are not allowed",
3430 return TRANSACTION_NAME_CONFLICT;
3433 new_update = ref_transaction_add_update(
3434 transaction, "HEAD",
3435 update->flags | REF_LOG_ONLY | REF_NODEREF,
3436 update->new_sha1, update->old_sha1,
3439 item->util = new_update;
3445 * update is for a symref that points at referent and doesn't have
3446 * REF_NODEREF set. Split it into two updates:
3447 * - The original update, but with REF_LOG_ONLY and REF_NODEREF set
3448 * - A new, separate update for the referent reference
3449 * Note that the new update will itself be subject to splitting when
3450 * the iteration gets to it.
3452 static int split_symref_update(struct ref_update *update,
3453 const char *referent,
3454 struct ref_transaction *transaction,
3455 struct string_list *affected_refnames,
3458 struct string_list_item *item;
3459 struct ref_update *new_update;
3460 unsigned int new_flags;
3463 * First make sure that referent is not already in the
3464 * transaction. This insertion is O(N) in the transaction
3465 * size, but it happens at most once per symref in a
3468 item = string_list_insert(affected_refnames, referent);
3470 /* An entry already existed */
3472 "multiple updates for '%s' (including one "
3473 "via symref '%s') are not allowed",
3474 referent, update->refname);
3475 return TRANSACTION_NAME_CONFLICT;
3478 new_flags = update->flags;
3479 if (!strcmp(update->refname, "HEAD")) {
3481 * Record that the new update came via HEAD, so that
3482 * when we process it, split_head_update() doesn't try
3483 * to add another reflog update for HEAD. Note that
3484 * this bit will be propagated if the new_update
3485 * itself needs to be split.
3487 new_flags |= REF_UPDATE_VIA_HEAD;
3490 new_update = ref_transaction_add_update(
3491 transaction, referent, new_flags,
3492 update->new_sha1, update->old_sha1,
3495 new_update->parent_update = update;
3498 * Change the symbolic ref update to log only. Also, it
3499 * doesn't need to check its old SHA-1 value, as that will be
3500 * done when new_update is processed.
3502 update->flags |= REF_LOG_ONLY | REF_NODEREF;
3503 update->flags &= ~REF_HAVE_OLD;
3505 item->util = new_update;
3511 * Return the refname under which update was originally requested.
3513 static const char *original_update_refname(struct ref_update *update)
3515 while (update->parent_update)
3516 update = update->parent_update;
3518 return update->refname;
3522 * Prepare for carrying out update:
3523 * - Lock the reference referred to by update.
3524 * - Read the reference under lock.
3525 * - Check that its old SHA-1 value (if specified) is correct, and in
3526 * any case record it in update->lock->old_oid for later use when
3527 * writing the reflog.
3528 * - If it is a symref update without REF_NODEREF, split it up into a
3529 * REF_LOG_ONLY update of the symref and add a separate update for
3530 * the referent to transaction.
3531 * - If it is an update of head_ref, add a corresponding REF_LOG_ONLY
3534 static int lock_ref_for_update(struct ref_update *update,
3535 struct ref_transaction *transaction,
3536 const char *head_ref,
3537 struct string_list *affected_refnames,
3540 struct strbuf referent = STRBUF_INIT;
3541 int mustexist = (update->flags & REF_HAVE_OLD) &&
3542 !is_null_sha1(update->old_sha1);
3544 struct ref_lock *lock;
3546 if ((update->flags & REF_HAVE_NEW) && is_null_sha1(update->new_sha1))
3547 update->flags |= REF_DELETING;
3550 ret = split_head_update(update, transaction, head_ref,
3551 affected_refnames, err);
3556 ret = lock_raw_ref(update->refname, mustexist,
3557 affected_refnames, NULL,
3558 &update->lock, &referent,
3559 &update->type, err);
3564 reason = strbuf_detach(err, NULL);
3565 strbuf_addf(err, "cannot lock ref '%s': %s",
3566 update->refname, reason);
3571 lock = update->lock;
3573 if (update->type & REF_ISSYMREF) {
3574 if (update->flags & REF_NODEREF) {
3576 * We won't be reading the referent as part of
3577 * the transaction, so we have to read it here
3578 * to record and possibly check old_sha1:
3580 if (read_ref_full(update->refname,
3581 mustexist ? RESOLVE_REF_READING : 0,
3582 lock->old_oid.hash, NULL)) {
3583 if (update->flags & REF_HAVE_OLD) {
3584 strbuf_addf(err, "cannot lock ref '%s': "
3585 "can't resolve old value",
3587 return TRANSACTION_GENERIC_ERROR;
3589 hashclr(lock->old_oid.hash);
3592 if ((update->flags & REF_HAVE_OLD) &&
3593 hashcmp(lock->old_oid.hash, update->old_sha1)) {
3594 strbuf_addf(err, "cannot lock ref '%s': "
3595 "is at %s but expected %s",
3597 sha1_to_hex(lock->old_oid.hash),
3598 sha1_to_hex(update->old_sha1));
3599 return TRANSACTION_GENERIC_ERROR;
3604 * Create a new update for the reference this
3605 * symref is pointing at. Also, we will record
3606 * and verify old_sha1 for this update as part
3607 * of processing the split-off update, so we
3608 * don't have to do it here.
3610 ret = split_symref_update(update, referent.buf, transaction,
3611 affected_refnames, err);
3616 struct ref_update *parent_update;
3619 * If this update is happening indirectly because of a
3620 * symref update, record the old SHA-1 in the parent
3623 for (parent_update = update->parent_update;
3625 parent_update = parent_update->parent_update) {
3626 oidcpy(&parent_update->lock->old_oid, &lock->old_oid);
3629 if ((update->flags & REF_HAVE_OLD) &&
3630 hashcmp(lock->old_oid.hash, update->old_sha1)) {
3631 if (is_null_sha1(update->old_sha1))
3632 strbuf_addf(err, "cannot lock ref '%s': reference already exists",
3633 original_update_refname(update));
3635 strbuf_addf(err, "cannot lock ref '%s': is at %s but expected %s",
3636 original_update_refname(update),
3637 sha1_to_hex(lock->old_oid.hash),
3638 sha1_to_hex(update->old_sha1));
3640 return TRANSACTION_GENERIC_ERROR;
3644 if ((update->flags & REF_HAVE_NEW) &&
3645 !(update->flags & REF_DELETING) &&
3646 !(update->flags & REF_LOG_ONLY)) {
3647 if (!(update->type & REF_ISSYMREF) &&
3648 !hashcmp(lock->old_oid.hash, update->new_sha1)) {
3650 * The reference already has the desired
3651 * value, so we don't need to write it.
3653 } else if (write_ref_to_lockfile(lock, update->new_sha1,
3655 char *write_err = strbuf_detach(err, NULL);
3658 * The lock was freed upon failure of
3659 * write_ref_to_lockfile():
3661 update->lock = NULL;
3663 "cannot update the ref '%s': %s",
3664 update->refname, write_err);
3666 return TRANSACTION_GENERIC_ERROR;
3668 update->flags |= REF_NEEDS_COMMIT;
3671 if (!(update->flags & REF_NEEDS_COMMIT)) {
3673 * We didn't call write_ref_to_lockfile(), so
3674 * the lockfile is still open. Close it to
3675 * free up the file descriptor:
3677 if (close_ref(lock)) {
3678 strbuf_addf(err, "couldn't close '%s.lock'",
3680 return TRANSACTION_GENERIC_ERROR;
3686 static int files_transaction_commit(struct ref_store *ref_store,
3687 struct ref_transaction *transaction,
3690 struct files_ref_store *refs =
3691 files_downcast(ref_store, 0, "ref_transaction_commit");
3693 struct string_list refs_to_delete = STRING_LIST_INIT_NODUP;
3694 struct string_list_item *ref_to_delete;
3695 struct string_list affected_refnames = STRING_LIST_INIT_NODUP;
3696 char *head_ref = NULL;
3698 struct object_id head_oid;
3702 if (transaction->state != REF_TRANSACTION_OPEN)
3703 die("BUG: commit called for transaction that is not open");
3705 if (!transaction->nr) {
3706 transaction->state = REF_TRANSACTION_CLOSED;
3711 * Fail if a refname appears more than once in the
3712 * transaction. (If we end up splitting up any updates using
3713 * split_symref_update() or split_head_update(), those
3714 * functions will check that the new updates don't have the
3715 * same refname as any existing ones.)
3717 for (i = 0; i < transaction->nr; i++) {
3718 struct ref_update *update = transaction->updates[i];
3719 struct string_list_item *item =
3720 string_list_append(&affected_refnames, update->refname);
3723 * We store a pointer to update in item->util, but at
3724 * the moment we never use the value of this field
3725 * except to check whether it is non-NULL.
3727 item->util = update;
3729 string_list_sort(&affected_refnames);
3730 if (ref_update_reject_duplicates(&affected_refnames, err)) {
3731 ret = TRANSACTION_GENERIC_ERROR;
3736 * Special hack: If a branch is updated directly and HEAD
3737 * points to it (may happen on the remote side of a push
3738 * for example) then logically the HEAD reflog should be
3741 * A generic solution would require reverse symref lookups,
3742 * but finding all symrefs pointing to a given branch would be
3743 * rather costly for this rare event (the direct update of a
3744 * branch) to be worth it. So let's cheat and check with HEAD
3745 * only, which should cover 99% of all usage scenarios (even
3746 * 100% of the default ones).
3748 * So if HEAD is a symbolic reference, then record the name of
3749 * the reference that it points to. If we see an update of
3750 * head_ref within the transaction, then split_head_update()
3751 * arranges for the reflog of HEAD to be updated, too.
3753 head_ref = resolve_refdup("HEAD", RESOLVE_REF_NO_RECURSE,
3754 head_oid.hash, &head_type);
3756 if (head_ref && !(head_type & REF_ISSYMREF)) {
3762 * Acquire all locks, verify old values if provided, check
3763 * that new values are valid, and write new values to the
3764 * lockfiles, ready to be activated. Only keep one lockfile
3765 * open at a time to avoid running out of file descriptors.
3767 for (i = 0; i < transaction->nr; i++) {
3768 struct ref_update *update = transaction->updates[i];
3770 ret = lock_ref_for_update(update, transaction, head_ref,
3771 &affected_refnames, err);
3776 /* Perform updates first so live commits remain referenced */
3777 for (i = 0; i < transaction->nr; i++) {
3778 struct ref_update *update = transaction->updates[i];
3779 struct ref_lock *lock = update->lock;
3781 if (update->flags & REF_NEEDS_COMMIT ||
3782 update->flags & REF_LOG_ONLY) {
3783 if (log_ref_write(lock->ref_name, lock->old_oid.hash,
3785 update->msg, update->flags, err)) {
3786 char *old_msg = strbuf_detach(err, NULL);
3788 strbuf_addf(err, "cannot update the ref '%s': %s",
3789 lock->ref_name, old_msg);
3792 update->lock = NULL;
3793 ret = TRANSACTION_GENERIC_ERROR;
3797 if (update->flags & REF_NEEDS_COMMIT) {
3798 clear_loose_ref_cache(refs);
3799 if (commit_ref(lock)) {
3800 strbuf_addf(err, "couldn't set '%s'", lock->ref_name);
3802 update->lock = NULL;
3803 ret = TRANSACTION_GENERIC_ERROR;
3808 /* Perform deletes now that updates are safely completed */
3809 for (i = 0; i < transaction->nr; i++) {
3810 struct ref_update *update = transaction->updates[i];
3812 if (update->flags & REF_DELETING &&
3813 !(update->flags & REF_LOG_ONLY)) {
3814 if (delete_ref_loose(update->lock, update->type, err)) {
3815 ret = TRANSACTION_GENERIC_ERROR;
3819 if (!(update->flags & REF_ISPRUNING))
3820 string_list_append(&refs_to_delete,
3821 update->lock->ref_name);
3825 if (repack_without_refs(&refs_to_delete, err)) {
3826 ret = TRANSACTION_GENERIC_ERROR;
3829 for_each_string_list_item(ref_to_delete, &refs_to_delete)
3830 unlink_or_warn(git_path("logs/%s", ref_to_delete->string));
3831 clear_loose_ref_cache(refs);
3834 transaction->state = REF_TRANSACTION_CLOSED;
3836 for (i = 0; i < transaction->nr; i++)
3837 if (transaction->updates[i]->lock)
3838 unlock_ref(transaction->updates[i]->lock);
3839 string_list_clear(&refs_to_delete, 0);
3841 string_list_clear(&affected_refnames, 0);
3846 static int ref_present(const char *refname,
3847 const struct object_id *oid, int flags, void *cb_data)
3849 struct string_list *affected_refnames = cb_data;
3851 return string_list_has_string(affected_refnames, refname);
3854 int initial_ref_transaction_commit(struct ref_transaction *transaction,
3857 struct files_ref_store *refs =
3858 get_files_ref_store(NULL, "initial_ref_transaction_commit");
3860 struct string_list affected_refnames = STRING_LIST_INIT_NODUP;
3864 if (transaction->state != REF_TRANSACTION_OPEN)
3865 die("BUG: commit called for transaction that is not open");
3867 /* Fail if a refname appears more than once in the transaction: */
3868 for (i = 0; i < transaction->nr; i++)
3869 string_list_append(&affected_refnames,
3870 transaction->updates[i]->refname);
3871 string_list_sort(&affected_refnames);
3872 if (ref_update_reject_duplicates(&affected_refnames, err)) {
3873 ret = TRANSACTION_GENERIC_ERROR;
3878 * It's really undefined to call this function in an active
3879 * repository or when there are existing references: we are
3880 * only locking and changing packed-refs, so (1) any
3881 * simultaneous processes might try to change a reference at
3882 * the same time we do, and (2) any existing loose versions of
3883 * the references that we are setting would have precedence
3884 * over our values. But some remote helpers create the remote
3885 * "HEAD" and "master" branches before calling this function,
3886 * so here we really only check that none of the references
3887 * that we are creating already exists.
3889 if (for_each_rawref(ref_present, &affected_refnames))
3890 die("BUG: initial ref transaction called with existing refs");
3892 for (i = 0; i < transaction->nr; i++) {
3893 struct ref_update *update = transaction->updates[i];
3895 if ((update->flags & REF_HAVE_OLD) &&
3896 !is_null_sha1(update->old_sha1))
3897 die("BUG: initial ref transaction with old_sha1 set");
3898 if (verify_refname_available(update->refname,
3899 &affected_refnames, NULL,
3901 ret = TRANSACTION_NAME_CONFLICT;
3906 if (lock_packed_refs(refs, 0)) {
3907 strbuf_addf(err, "unable to lock packed-refs file: %s",
3909 ret = TRANSACTION_GENERIC_ERROR;
3913 for (i = 0; i < transaction->nr; i++) {
3914 struct ref_update *update = transaction->updates[i];
3916 if ((update->flags & REF_HAVE_NEW) &&
3917 !is_null_sha1(update->new_sha1))
3918 add_packed_ref(refs, update->refname, update->new_sha1);
3921 if (commit_packed_refs(refs)) {
3922 strbuf_addf(err, "unable to commit packed-refs file: %s",
3924 ret = TRANSACTION_GENERIC_ERROR;
3929 transaction->state = REF_TRANSACTION_CLOSED;
3930 string_list_clear(&affected_refnames, 0);
3934 struct expire_reflog_cb {
3936 reflog_expiry_should_prune_fn *should_prune_fn;
3939 unsigned char last_kept_sha1[20];
3942 static int expire_reflog_ent(unsigned char *osha1, unsigned char *nsha1,
3943 const char *email, unsigned long timestamp, int tz,
3944 const char *message, void *cb_data)
3946 struct expire_reflog_cb *cb = cb_data;
3947 struct expire_reflog_policy_cb *policy_cb = cb->policy_cb;
3949 if (cb->flags & EXPIRE_REFLOGS_REWRITE)
3950 osha1 = cb->last_kept_sha1;
3952 if ((*cb->should_prune_fn)(osha1, nsha1, email, timestamp, tz,
3953 message, policy_cb)) {
3955 printf("would prune %s", message);
3956 else if (cb->flags & EXPIRE_REFLOGS_VERBOSE)
3957 printf("prune %s", message);
3960 fprintf(cb->newlog, "%s %s %s %lu %+05d\t%s",
3961 sha1_to_hex(osha1), sha1_to_hex(nsha1),
3962 email, timestamp, tz, message);
3963 hashcpy(cb->last_kept_sha1, nsha1);
3965 if (cb->flags & EXPIRE_REFLOGS_VERBOSE)
3966 printf("keep %s", message);
3971 int reflog_expire(const char *refname, const unsigned char *sha1,
3973 reflog_expiry_prepare_fn prepare_fn,
3974 reflog_expiry_should_prune_fn should_prune_fn,
3975 reflog_expiry_cleanup_fn cleanup_fn,
3976 void *policy_cb_data)
3978 static struct lock_file reflog_lock;
3979 struct expire_reflog_cb cb;
3980 struct ref_lock *lock;
3984 struct strbuf err = STRBUF_INIT;
3986 memset(&cb, 0, sizeof(cb));
3988 cb.policy_cb = policy_cb_data;
3989 cb.should_prune_fn = should_prune_fn;
3992 * The reflog file is locked by holding the lock on the
3993 * reference itself, plus we might need to update the
3994 * reference if --updateref was specified:
3996 lock = lock_ref_sha1_basic(refname, sha1, NULL, NULL, REF_NODEREF,
3999 error("cannot lock ref '%s': %s", refname, err.buf);
4000 strbuf_release(&err);
4003 if (!reflog_exists(refname)) {
4008 log_file = git_pathdup("logs/%s", refname);
4009 if (!(flags & EXPIRE_REFLOGS_DRY_RUN)) {
4011 * Even though holding $GIT_DIR/logs/$reflog.lock has
4012 * no locking implications, we use the lock_file
4013 * machinery here anyway because it does a lot of the
4014 * work we need, including cleaning up if the program
4015 * exits unexpectedly.
4017 if (hold_lock_file_for_update(&reflog_lock, log_file, 0) < 0) {
4018 struct strbuf err = STRBUF_INIT;
4019 unable_to_lock_message(log_file, errno, &err);
4020 error("%s", err.buf);
4021 strbuf_release(&err);
4024 cb.newlog = fdopen_lock_file(&reflog_lock, "w");
4026 error("cannot fdopen %s (%s)",
4027 get_lock_file_path(&reflog_lock), strerror(errno));
4032 (*prepare_fn)(refname, sha1, cb.policy_cb);
4033 for_each_reflog_ent(refname, expire_reflog_ent, &cb);
4034 (*cleanup_fn)(cb.policy_cb);
4036 if (!(flags & EXPIRE_REFLOGS_DRY_RUN)) {
4038 * It doesn't make sense to adjust a reference pointed
4039 * to by a symbolic ref based on expiring entries in
4040 * the symbolic reference's reflog. Nor can we update
4041 * a reference if there are no remaining reflog
4044 int update = (flags & EXPIRE_REFLOGS_UPDATE_REF) &&
4045 !(type & REF_ISSYMREF) &&
4046 !is_null_sha1(cb.last_kept_sha1);
4048 if (close_lock_file(&reflog_lock)) {
4049 status |= error("couldn't write %s: %s", log_file,
4051 } else if (update &&
4052 (write_in_full(get_lock_file_fd(lock->lk),
4053 sha1_to_hex(cb.last_kept_sha1), 40) != 40 ||
4054 write_str_in_full(get_lock_file_fd(lock->lk), "\n") != 1 ||
4055 close_ref(lock) < 0)) {
4056 status |= error("couldn't write %s",
4057 get_lock_file_path(lock->lk));
4058 rollback_lock_file(&reflog_lock);
4059 } else if (commit_lock_file(&reflog_lock)) {
4060 status |= error("unable to write reflog '%s' (%s)",
4061 log_file, strerror(errno));
4062 } else if (update && commit_ref(lock)) {
4063 status |= error("couldn't set %s", lock->ref_name);
4071 rollback_lock_file(&reflog_lock);
4077 struct ref_storage_be refs_be_files = {
4080 files_ref_store_create,
4081 files_transaction_commit