3 #include "refs-internal.h"
4 #include "../lockfile.h"
12 struct object_id old_oid;
18 * Information used (along with the information in ref_entry) to
19 * describe a single cached reference. This data structure only
20 * occurs embedded in a union in struct ref_entry, and only when
21 * (ref_entry->flag & REF_DIR) is zero.
25 * The name of the object to which this reference resolves
26 * (which may be a tag object). If REF_ISBROKEN, this is
27 * null. If REF_ISSYMREF, then this is the name of the object
28 * referred to by the last reference in the symlink chain.
33 * If REF_KNOWS_PEELED, then this field holds the peeled value
34 * of this reference, or null if the reference is known not to
35 * be peelable. See the documentation for peel_ref() for an
36 * exact definition of "peelable".
38 struct object_id peeled;
44 * Information used (along with the information in ref_entry) to
45 * describe a level in the hierarchy of references. This data
46 * structure only occurs embedded in a union in struct ref_entry, and
47 * only when (ref_entry.flag & REF_DIR) is set. In that case,
48 * (ref_entry.flag & REF_INCOMPLETE) determines whether the references
49 * in the directory have already been read:
51 * (ref_entry.flag & REF_INCOMPLETE) unset -- a directory of loose
52 * or packed references, already read.
54 * (ref_entry.flag & REF_INCOMPLETE) set -- a directory of loose
55 * references that hasn't been read yet (nor has any of its
58 * Entries within a directory are stored within a growable array of
59 * pointers to ref_entries (entries, nr, alloc). Entries 0 <= i <
60 * sorted are sorted by their component name in strcmp() order and the
61 * remaining entries are unsorted.
63 * Loose references are read lazily, one directory at a time. When a
64 * directory of loose references is read, then all of the references
65 * in that directory are stored, and REF_INCOMPLETE stubs are created
66 * for any subdirectories, but the subdirectories themselves are not
67 * read. The reading is triggered by get_ref_dir().
73 * Entries with index 0 <= i < sorted are sorted by name. New
74 * entries are appended to the list unsorted, and are sorted
75 * only when required; thus we avoid the need to sort the list
76 * after the addition of every reference.
80 /* A pointer to the ref_cache that contains this ref_dir. */
81 struct ref_cache *ref_cache;
83 struct ref_entry **entries;
87 * Bit values for ref_entry::flag. REF_ISSYMREF=0x01,
88 * REF_ISPACKED=0x02, REF_ISBROKEN=0x04 and REF_BAD_NAME=0x08 are
89 * public values; see refs.h.
93 * The field ref_entry->u.value.peeled of this value entry contains
94 * the correct peeled value for the reference, which might be
95 * null_sha1 if the reference is not a tag or if it is broken.
97 #define REF_KNOWS_PEELED 0x10
99 /* ref_entry represents a directory of references */
103 * Entry has not yet been read from disk (used only for REF_DIR
104 * entries representing loose references)
106 #define REF_INCOMPLETE 0x40
109 * A ref_entry represents either a reference or a "subdirectory" of
112 * Each directory in the reference namespace is represented by a
113 * ref_entry with (flags & REF_DIR) set and containing a subdir member
114 * that holds the entries in that directory that have been read so
115 * far. If (flags & REF_INCOMPLETE) is set, then the directory and
116 * its subdirectories haven't been read yet. REF_INCOMPLETE is only
117 * used for loose reference directories.
119 * References are represented by a ref_entry with (flags & REF_DIR)
120 * unset and a value member that describes the reference's value. The
121 * flag member is at the ref_entry level, but it is also needed to
122 * interpret the contents of the value field (in other words, a
123 * ref_value object is not very much use without the enclosing
126 * Reference names cannot end with slash and directories' names are
127 * always stored with a trailing slash (except for the top-level
128 * directory, which is always denoted by ""). This has two nice
129 * consequences: (1) when the entries in each subdir are sorted
130 * lexicographically by name (as they usually are), the references in
131 * a whole tree can be generated in lexicographic order by traversing
132 * the tree in left-to-right, depth-first order; (2) the names of
133 * references and subdirectories cannot conflict, and therefore the
134 * presence of an empty subdirectory does not block the creation of a
135 * similarly-named reference. (The fact that reference names with the
136 * same leading components can conflict *with each other* is a
137 * separate issue that is regulated by verify_refname_available().)
139 * Please note that the name field contains the fully-qualified
140 * reference (or subdirectory) name. Space could be saved by only
141 * storing the relative names. But that would require the full names
142 * to be generated on the fly when iterating in do_for_each_ref(), and
143 * would break callback functions, who have always been able to assume
144 * that the name strings that they are passed will not be freed during
148 unsigned char flag; /* ISSYMREF? ISPACKED? */
150 struct ref_value value; /* if not (flags&REF_DIR) */
151 struct ref_dir subdir; /* if (flags&REF_DIR) */
154 * The full name of the reference (e.g., "refs/heads/master")
155 * or the full name of the directory with a trailing slash
156 * (e.g., "refs/heads/"):
158 char name[FLEX_ARRAY];
161 static void read_loose_refs(const char *dirname, struct ref_dir *dir);
162 static int search_ref_dir(struct ref_dir *dir, const char *refname, size_t len);
163 static struct ref_entry *create_dir_entry(struct ref_cache *ref_cache,
164 const char *dirname, size_t len,
166 static void add_entry_to_dir(struct ref_dir *dir, struct ref_entry *entry);
168 static struct ref_dir *get_ref_dir(struct ref_entry *entry)
171 assert(entry->flag & REF_DIR);
172 dir = &entry->u.subdir;
173 if (entry->flag & REF_INCOMPLETE) {
174 read_loose_refs(entry->name, dir);
177 * Manually add refs/bisect, which, being
178 * per-worktree, might not appear in the directory
179 * listing for refs/ in the main repo.
181 if (!strcmp(entry->name, "refs/")) {
182 int pos = search_ref_dir(dir, "refs/bisect/", 12);
184 struct ref_entry *child_entry;
185 child_entry = create_dir_entry(dir->ref_cache,
188 add_entry_to_dir(dir, child_entry);
189 read_loose_refs("refs/bisect",
190 &child_entry->u.subdir);
193 entry->flag &= ~REF_INCOMPLETE;
198 static struct ref_entry *create_ref_entry(const char *refname,
199 const unsigned char *sha1, int flag,
202 struct ref_entry *ref;
205 check_refname_format(refname, REFNAME_ALLOW_ONELEVEL))
206 die("Reference has invalid format: '%s'", refname);
207 FLEX_ALLOC_STR(ref, name, refname);
208 hashcpy(ref->u.value.oid.hash, sha1);
209 oidclr(&ref->u.value.peeled);
214 static void clear_ref_dir(struct ref_dir *dir);
216 static void free_ref_entry(struct ref_entry *entry)
218 if (entry->flag & REF_DIR) {
220 * Do not use get_ref_dir() here, as that might
221 * trigger the reading of loose refs.
223 clear_ref_dir(&entry->u.subdir);
229 * Add a ref_entry to the end of dir (unsorted). Entry is always
230 * stored directly in dir; no recursion into subdirectories is
233 static void add_entry_to_dir(struct ref_dir *dir, struct ref_entry *entry)
235 ALLOC_GROW(dir->entries, dir->nr + 1, dir->alloc);
236 dir->entries[dir->nr++] = entry;
237 /* optimize for the case that entries are added in order */
239 (dir->nr == dir->sorted + 1 &&
240 strcmp(dir->entries[dir->nr - 2]->name,
241 dir->entries[dir->nr - 1]->name) < 0))
242 dir->sorted = dir->nr;
246 * Clear and free all entries in dir, recursively.
248 static void clear_ref_dir(struct ref_dir *dir)
251 for (i = 0; i < dir->nr; i++)
252 free_ref_entry(dir->entries[i]);
254 dir->sorted = dir->nr = dir->alloc = 0;
259 * Create a struct ref_entry object for the specified dirname.
260 * dirname is the name of the directory with a trailing slash (e.g.,
261 * "refs/heads/") or "" for the top-level directory.
263 static struct ref_entry *create_dir_entry(struct ref_cache *ref_cache,
264 const char *dirname, size_t len,
267 struct ref_entry *direntry;
268 FLEX_ALLOC_MEM(direntry, name, dirname, len);
269 direntry->u.subdir.ref_cache = ref_cache;
270 direntry->flag = REF_DIR | (incomplete ? REF_INCOMPLETE : 0);
274 static int ref_entry_cmp(const void *a, const void *b)
276 struct ref_entry *one = *(struct ref_entry **)a;
277 struct ref_entry *two = *(struct ref_entry **)b;
278 return strcmp(one->name, two->name);
281 static void sort_ref_dir(struct ref_dir *dir);
283 struct string_slice {
288 static int ref_entry_cmp_sslice(const void *key_, const void *ent_)
290 const struct string_slice *key = key_;
291 const struct ref_entry *ent = *(const struct ref_entry * const *)ent_;
292 int cmp = strncmp(key->str, ent->name, key->len);
295 return '\0' - (unsigned char)ent->name[key->len];
299 * Return the index of the entry with the given refname from the
300 * ref_dir (non-recursively), sorting dir if necessary. Return -1 if
301 * no such entry is found. dir must already be complete.
303 static int search_ref_dir(struct ref_dir *dir, const char *refname, size_t len)
305 struct ref_entry **r;
306 struct string_slice key;
308 if (refname == NULL || !dir->nr)
314 r = bsearch(&key, dir->entries, dir->nr, sizeof(*dir->entries),
315 ref_entry_cmp_sslice);
320 return r - dir->entries;
324 * Search for a directory entry directly within dir (without
325 * recursing). Sort dir if necessary. subdirname must be a directory
326 * name (i.e., end in '/'). If mkdir is set, then create the
327 * directory if it is missing; otherwise, return NULL if the desired
328 * directory cannot be found. dir must already be complete.
330 static struct ref_dir *search_for_subdir(struct ref_dir *dir,
331 const char *subdirname, size_t len,
334 int entry_index = search_ref_dir(dir, subdirname, len);
335 struct ref_entry *entry;
336 if (entry_index == -1) {
340 * Since dir is complete, the absence of a subdir
341 * means that the subdir really doesn't exist;
342 * therefore, create an empty record for it but mark
343 * the record complete.
345 entry = create_dir_entry(dir->ref_cache, subdirname, len, 0);
346 add_entry_to_dir(dir, entry);
348 entry = dir->entries[entry_index];
350 return get_ref_dir(entry);
354 * If refname is a reference name, find the ref_dir within the dir
355 * tree that should hold refname. If refname is a directory name
356 * (i.e., ends in '/'), then return that ref_dir itself. dir must
357 * represent the top-level directory and must already be complete.
358 * Sort ref_dirs and recurse into subdirectories as necessary. If
359 * mkdir is set, then create any missing directories; otherwise,
360 * return NULL if the desired directory cannot be found.
362 static struct ref_dir *find_containing_dir(struct ref_dir *dir,
363 const char *refname, int mkdir)
366 for (slash = strchr(refname, '/'); slash; slash = strchr(slash + 1, '/')) {
367 size_t dirnamelen = slash - refname + 1;
368 struct ref_dir *subdir;
369 subdir = search_for_subdir(dir, refname, dirnamelen, mkdir);
381 * Find the value entry with the given name in dir, sorting ref_dirs
382 * and recursing into subdirectories as necessary. If the name is not
383 * found or it corresponds to a directory entry, return NULL.
385 static struct ref_entry *find_ref(struct ref_dir *dir, const char *refname)
388 struct ref_entry *entry;
389 dir = find_containing_dir(dir, refname, 0);
392 entry_index = search_ref_dir(dir, refname, strlen(refname));
393 if (entry_index == -1)
395 entry = dir->entries[entry_index];
396 return (entry->flag & REF_DIR) ? NULL : entry;
400 * Remove the entry with the given name from dir, recursing into
401 * subdirectories as necessary. If refname is the name of a directory
402 * (i.e., ends with '/'), then remove the directory and its contents.
403 * If the removal was successful, return the number of entries
404 * remaining in the directory entry that contained the deleted entry.
405 * If the name was not found, return -1. Please note that this
406 * function only deletes the entry from the cache; it does not delete
407 * it from the filesystem or ensure that other cache entries (which
408 * might be symbolic references to the removed entry) are updated.
409 * Nor does it remove any containing dir entries that might be made
410 * empty by the removal. dir must represent the top-level directory
411 * and must already be complete.
413 static int remove_entry(struct ref_dir *dir, const char *refname)
415 int refname_len = strlen(refname);
417 struct ref_entry *entry;
418 int is_dir = refname[refname_len - 1] == '/';
421 * refname represents a reference directory. Remove
422 * the trailing slash; otherwise we will get the
423 * directory *representing* refname rather than the
424 * one *containing* it.
426 char *dirname = xmemdupz(refname, refname_len - 1);
427 dir = find_containing_dir(dir, dirname, 0);
430 dir = find_containing_dir(dir, refname, 0);
434 entry_index = search_ref_dir(dir, refname, refname_len);
435 if (entry_index == -1)
437 entry = dir->entries[entry_index];
439 memmove(&dir->entries[entry_index],
440 &dir->entries[entry_index + 1],
441 (dir->nr - entry_index - 1) * sizeof(*dir->entries)
444 if (dir->sorted > entry_index)
446 free_ref_entry(entry);
451 * Add a ref_entry to the ref_dir (unsorted), recursing into
452 * subdirectories as necessary. dir must represent the top-level
453 * directory. Return 0 on success.
455 static int add_ref(struct ref_dir *dir, struct ref_entry *ref)
457 dir = find_containing_dir(dir, ref->name, 1);
460 add_entry_to_dir(dir, ref);
465 * Emit a warning and return true iff ref1 and ref2 have the same name
466 * and the same sha1. Die if they have the same name but different
469 static int is_dup_ref(const struct ref_entry *ref1, const struct ref_entry *ref2)
471 if (strcmp(ref1->name, ref2->name))
474 /* Duplicate name; make sure that they don't conflict: */
476 if ((ref1->flag & REF_DIR) || (ref2->flag & REF_DIR))
477 /* This is impossible by construction */
478 die("Reference directory conflict: %s", ref1->name);
480 if (oidcmp(&ref1->u.value.oid, &ref2->u.value.oid))
481 die("Duplicated ref, and SHA1s don't match: %s", ref1->name);
483 warning("Duplicated ref: %s", ref1->name);
488 * Sort the entries in dir non-recursively (if they are not already
489 * sorted) and remove any duplicate entries.
491 static void sort_ref_dir(struct ref_dir *dir)
494 struct ref_entry *last = NULL;
497 * This check also prevents passing a zero-length array to qsort(),
498 * which is a problem on some platforms.
500 if (dir->sorted == dir->nr)
503 qsort(dir->entries, dir->nr, sizeof(*dir->entries), ref_entry_cmp);
505 /* Remove any duplicates: */
506 for (i = 0, j = 0; j < dir->nr; j++) {
507 struct ref_entry *entry = dir->entries[j];
508 if (last && is_dup_ref(last, entry))
509 free_ref_entry(entry);
511 last = dir->entries[i++] = entry;
513 dir->sorted = dir->nr = i;
517 * Return true iff the reference described by entry can be resolved to
518 * an object in the database. Emit a warning if the referred-to
519 * object does not exist.
521 static int ref_resolves_to_object(struct ref_entry *entry)
523 if (entry->flag & REF_ISBROKEN)
525 if (!has_sha1_file(entry->u.value.oid.hash)) {
526 error("%s does not point to a valid object!", entry->name);
533 * current_ref is a performance hack: when iterating over references
534 * using the for_each_ref*() functions, current_ref is set to the
535 * current reference's entry before calling the callback function. If
536 * the callback function calls peel_ref(), then peel_ref() first
537 * checks whether the reference to be peeled is the current reference
538 * (it usually is) and if so, returns that reference's peeled version
539 * if it is available. This avoids a refname lookup in a common case.
541 static struct ref_entry *current_ref;
543 typedef int each_ref_entry_fn(struct ref_entry *entry, void *cb_data);
545 struct ref_entry_cb {
554 * Handle one reference in a do_for_each_ref*()-style iteration,
555 * calling an each_ref_fn for each entry.
557 static int do_one_ref(struct ref_entry *entry, void *cb_data)
559 struct ref_entry_cb *data = cb_data;
560 struct ref_entry *old_current_ref;
563 if (!starts_with(entry->name, data->base))
566 if (!(data->flags & DO_FOR_EACH_INCLUDE_BROKEN) &&
567 !ref_resolves_to_object(entry))
570 /* Store the old value, in case this is a recursive call: */
571 old_current_ref = current_ref;
573 retval = data->fn(entry->name + data->trim, &entry->u.value.oid,
574 entry->flag, data->cb_data);
575 current_ref = old_current_ref;
580 * Call fn for each reference in dir that has index in the range
581 * offset <= index < dir->nr. Recurse into subdirectories that are in
582 * that index range, sorting them before iterating. This function
583 * does not sort dir itself; it should be sorted beforehand. fn is
584 * called for all references, including broken ones.
586 static int do_for_each_entry_in_dir(struct ref_dir *dir, int offset,
587 each_ref_entry_fn fn, void *cb_data)
590 assert(dir->sorted == dir->nr);
591 for (i = offset; i < dir->nr; i++) {
592 struct ref_entry *entry = dir->entries[i];
594 if (entry->flag & REF_DIR) {
595 struct ref_dir *subdir = get_ref_dir(entry);
596 sort_ref_dir(subdir);
597 retval = do_for_each_entry_in_dir(subdir, 0, fn, cb_data);
599 retval = fn(entry, cb_data);
608 * Call fn for each reference in the union of dir1 and dir2, in order
609 * by refname. Recurse into subdirectories. If a value entry appears
610 * in both dir1 and dir2, then only process the version that is in
611 * dir2. The input dirs must already be sorted, but subdirs will be
612 * sorted as needed. fn is called for all references, including
615 static int do_for_each_entry_in_dirs(struct ref_dir *dir1,
616 struct ref_dir *dir2,
617 each_ref_entry_fn fn, void *cb_data)
622 assert(dir1->sorted == dir1->nr);
623 assert(dir2->sorted == dir2->nr);
625 struct ref_entry *e1, *e2;
627 if (i1 == dir1->nr) {
628 return do_for_each_entry_in_dir(dir2, i2, fn, cb_data);
630 if (i2 == dir2->nr) {
631 return do_for_each_entry_in_dir(dir1, i1, fn, cb_data);
633 e1 = dir1->entries[i1];
634 e2 = dir2->entries[i2];
635 cmp = strcmp(e1->name, e2->name);
637 if ((e1->flag & REF_DIR) && (e2->flag & REF_DIR)) {
638 /* Both are directories; descend them in parallel. */
639 struct ref_dir *subdir1 = get_ref_dir(e1);
640 struct ref_dir *subdir2 = get_ref_dir(e2);
641 sort_ref_dir(subdir1);
642 sort_ref_dir(subdir2);
643 retval = do_for_each_entry_in_dirs(
644 subdir1, subdir2, fn, cb_data);
647 } else if (!(e1->flag & REF_DIR) && !(e2->flag & REF_DIR)) {
648 /* Both are references; ignore the one from dir1. */
649 retval = fn(e2, cb_data);
653 die("conflict between reference and directory: %s",
665 if (e->flag & REF_DIR) {
666 struct ref_dir *subdir = get_ref_dir(e);
667 sort_ref_dir(subdir);
668 retval = do_for_each_entry_in_dir(
669 subdir, 0, fn, cb_data);
671 retval = fn(e, cb_data);
680 * Load all of the refs from the dir into our in-memory cache. The hard work
681 * of loading loose refs is done by get_ref_dir(), so we just need to recurse
682 * through all of the sub-directories. We do not even need to care about
683 * sorting, as traversal order does not matter to us.
685 static void prime_ref_dir(struct ref_dir *dir)
688 for (i = 0; i < dir->nr; i++) {
689 struct ref_entry *entry = dir->entries[i];
690 if (entry->flag & REF_DIR)
691 prime_ref_dir(get_ref_dir(entry));
695 struct nonmatching_ref_data {
696 const struct string_list *skip;
697 const char *conflicting_refname;
700 static int nonmatching_ref_fn(struct ref_entry *entry, void *vdata)
702 struct nonmatching_ref_data *data = vdata;
704 if (data->skip && string_list_has_string(data->skip, entry->name))
707 data->conflicting_refname = entry->name;
712 * Return 0 if a reference named refname could be created without
713 * conflicting with the name of an existing reference in dir.
714 * See verify_refname_available for more information.
716 static int verify_refname_available_dir(const char *refname,
717 const struct string_list *extras,
718 const struct string_list *skip,
723 const char *extra_refname;
725 struct strbuf dirname = STRBUF_INIT;
729 * For the sake of comments in this function, suppose that
730 * refname is "refs/foo/bar".
735 strbuf_grow(&dirname, strlen(refname) + 1);
736 for (slash = strchr(refname, '/'); slash; slash = strchr(slash + 1, '/')) {
737 /* Expand dirname to the new prefix, not including the trailing slash: */
738 strbuf_add(&dirname, refname + dirname.len, slash - refname - dirname.len);
741 * We are still at a leading dir of the refname (e.g.,
742 * "refs/foo"; if there is a reference with that name,
743 * it is a conflict, *unless* it is in skip.
746 pos = search_ref_dir(dir, dirname.buf, dirname.len);
748 (!skip || !string_list_has_string(skip, dirname.buf))) {
750 * We found a reference whose name is
751 * a proper prefix of refname; e.g.,
752 * "refs/foo", and is not in skip.
754 strbuf_addf(err, "'%s' exists; cannot create '%s'",
755 dirname.buf, refname);
760 if (extras && string_list_has_string(extras, dirname.buf) &&
761 (!skip || !string_list_has_string(skip, dirname.buf))) {
762 strbuf_addf(err, "cannot process '%s' and '%s' at the same time",
763 refname, dirname.buf);
768 * Otherwise, we can try to continue our search with
769 * the next component. So try to look up the
770 * directory, e.g., "refs/foo/". If we come up empty,
771 * we know there is nothing under this whole prefix,
772 * but even in that case we still have to continue the
773 * search for conflicts with extras.
775 strbuf_addch(&dirname, '/');
777 pos = search_ref_dir(dir, dirname.buf, dirname.len);
780 * There was no directory "refs/foo/",
781 * so there is nothing under this
782 * whole prefix. So there is no need
783 * to continue looking for conflicting
784 * references. But we need to continue
785 * looking for conflicting extras.
789 dir = get_ref_dir(dir->entries[pos]);
795 * We are at the leaf of our refname (e.g., "refs/foo/bar").
796 * There is no point in searching for a reference with that
797 * name, because a refname isn't considered to conflict with
798 * itself. But we still need to check for references whose
799 * names are in the "refs/foo/bar/" namespace, because they
802 strbuf_addstr(&dirname, refname + dirname.len);
803 strbuf_addch(&dirname, '/');
806 pos = search_ref_dir(dir, dirname.buf, dirname.len);
810 * We found a directory named "$refname/"
811 * (e.g., "refs/foo/bar/"). It is a problem
812 * iff it contains any ref that is not in
815 struct nonmatching_ref_data data;
818 data.conflicting_refname = NULL;
819 dir = get_ref_dir(dir->entries[pos]);
821 if (do_for_each_entry_in_dir(dir, 0, nonmatching_ref_fn, &data)) {
822 strbuf_addf(err, "'%s' exists; cannot create '%s'",
823 data.conflicting_refname, refname);
829 extra_refname = find_descendant_ref(dirname.buf, extras, skip);
831 strbuf_addf(err, "cannot process '%s' and '%s' at the same time",
832 refname, extra_refname);
837 strbuf_release(&dirname);
841 struct packed_ref_cache {
842 struct ref_entry *root;
845 * Count of references to the data structure in this instance,
846 * including the pointer from ref_cache::packed if any. The
847 * data will not be freed as long as the reference count is
850 unsigned int referrers;
853 * Iff the packed-refs file associated with this instance is
854 * currently locked for writing, this points at the associated
855 * lock (which is owned by somebody else). The referrer count
856 * is also incremented when the file is locked and decremented
857 * when it is unlocked.
859 struct lock_file *lock;
861 /* The metadata from when this packed-refs cache was read */
862 struct stat_validity validity;
866 * Future: need to be in "struct repository"
867 * when doing a full libification.
869 static struct ref_cache {
870 struct ref_cache *next;
871 struct ref_entry *loose;
872 struct packed_ref_cache *packed;
874 * The submodule name, or "" for the main repo. We allocate
875 * length 1 rather than FLEX_ARRAY so that the main ref_cache
876 * is initialized correctly.
879 } ref_cache, *submodule_ref_caches;
881 /* Lock used for the main packed-refs file: */
882 static struct lock_file packlock;
885 * Increment the reference count of *packed_refs.
887 static void acquire_packed_ref_cache(struct packed_ref_cache *packed_refs)
889 packed_refs->referrers++;
893 * Decrease the reference count of *packed_refs. If it goes to zero,
894 * free *packed_refs and return true; otherwise return false.
896 static int release_packed_ref_cache(struct packed_ref_cache *packed_refs)
898 if (!--packed_refs->referrers) {
899 free_ref_entry(packed_refs->root);
900 stat_validity_clear(&packed_refs->validity);
908 static void clear_packed_ref_cache(struct ref_cache *refs)
911 struct packed_ref_cache *packed_refs = refs->packed;
913 if (packed_refs->lock)
914 die("internal error: packed-ref cache cleared while locked");
916 release_packed_ref_cache(packed_refs);
920 static void clear_loose_ref_cache(struct ref_cache *refs)
923 free_ref_entry(refs->loose);
929 * Create a new submodule ref cache and add it to the internal
932 static struct ref_cache *create_ref_cache(const char *submodule)
934 struct ref_cache *refs;
937 FLEX_ALLOC_STR(refs, name, submodule);
938 refs->next = submodule_ref_caches;
939 submodule_ref_caches = refs;
943 static struct ref_cache *lookup_ref_cache(const char *submodule)
945 struct ref_cache *refs;
947 if (!submodule || !*submodule)
950 for (refs = submodule_ref_caches; refs; refs = refs->next)
951 if (!strcmp(submodule, refs->name))
957 * Return a pointer to a ref_cache for the specified submodule. For
958 * the main repository, use submodule==NULL. The returned structure
959 * will be allocated and initialized but not necessarily populated; it
960 * should not be freed.
962 static struct ref_cache *get_ref_cache(const char *submodule)
964 struct ref_cache *refs = lookup_ref_cache(submodule);
966 refs = create_ref_cache(submodule);
970 /* The length of a peeled reference line in packed-refs, including EOL: */
971 #define PEELED_LINE_LENGTH 42
974 * The packed-refs header line that we write out. Perhaps other
975 * traits will be added later. The trailing space is required.
977 static const char PACKED_REFS_HEADER[] =
978 "# pack-refs with: peeled fully-peeled \n";
981 * Parse one line from a packed-refs file. Write the SHA1 to sha1.
982 * Return a pointer to the refname within the line (null-terminated),
983 * or NULL if there was a problem.
985 static const char *parse_ref_line(struct strbuf *line, unsigned char *sha1)
990 * 42: the answer to everything.
992 * In this case, it happens to be the answer to
993 * 40 (length of sha1 hex representation)
994 * +1 (space in between hex and name)
995 * +1 (newline at the end of the line)
1000 if (get_sha1_hex(line->buf, sha1) < 0)
1002 if (!isspace(line->buf[40]))
1005 ref = line->buf + 41;
1009 if (line->buf[line->len - 1] != '\n')
1011 line->buf[--line->len] = 0;
1017 * Read f, which is a packed-refs file, into dir.
1019 * A comment line of the form "# pack-refs with: " may contain zero or
1020 * more traits. We interpret the traits as follows:
1024 * Probably no references are peeled. But if the file contains a
1025 * peeled value for a reference, we will use it.
1029 * References under "refs/tags/", if they *can* be peeled, *are*
1030 * peeled in this file. References outside of "refs/tags/" are
1031 * probably not peeled even if they could have been, but if we find
1032 * a peeled value for such a reference we will use it.
1036 * All references in the file that can be peeled are peeled.
1037 * Inversely (and this is more important), any references in the
1038 * file for which no peeled value is recorded is not peelable. This
1039 * trait should typically be written alongside "peeled" for
1040 * compatibility with older clients, but we do not require it
1041 * (i.e., "peeled" is a no-op if "fully-peeled" is set).
1043 static void read_packed_refs(FILE *f, struct ref_dir *dir)
1045 struct ref_entry *last = NULL;
1046 struct strbuf line = STRBUF_INIT;
1047 enum { PEELED_NONE, PEELED_TAGS, PEELED_FULLY } peeled = PEELED_NONE;
1049 while (strbuf_getwholeline(&line, f, '\n') != EOF) {
1050 unsigned char sha1[20];
1051 const char *refname;
1054 if (skip_prefix(line.buf, "# pack-refs with:", &traits)) {
1055 if (strstr(traits, " fully-peeled "))
1056 peeled = PEELED_FULLY;
1057 else if (strstr(traits, " peeled "))
1058 peeled = PEELED_TAGS;
1059 /* perhaps other traits later as well */
1063 refname = parse_ref_line(&line, sha1);
1065 int flag = REF_ISPACKED;
1067 if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {
1068 if (!refname_is_safe(refname))
1069 die("packed refname is dangerous: %s", refname);
1071 flag |= REF_BAD_NAME | REF_ISBROKEN;
1073 last = create_ref_entry(refname, sha1, flag, 0);
1074 if (peeled == PEELED_FULLY ||
1075 (peeled == PEELED_TAGS && starts_with(refname, "refs/tags/")))
1076 last->flag |= REF_KNOWS_PEELED;
1081 line.buf[0] == '^' &&
1082 line.len == PEELED_LINE_LENGTH &&
1083 line.buf[PEELED_LINE_LENGTH - 1] == '\n' &&
1084 !get_sha1_hex(line.buf + 1, sha1)) {
1085 hashcpy(last->u.value.peeled.hash, sha1);
1087 * Regardless of what the file header said,
1088 * we definitely know the value of *this*
1091 last->flag |= REF_KNOWS_PEELED;
1095 strbuf_release(&line);
1099 * Get the packed_ref_cache for the specified ref_cache, creating it
1102 static struct packed_ref_cache *get_packed_ref_cache(struct ref_cache *refs)
1104 char *packed_refs_file;
1107 packed_refs_file = git_pathdup_submodule(refs->name, "packed-refs");
1109 packed_refs_file = git_pathdup("packed-refs");
1112 !stat_validity_check(&refs->packed->validity, packed_refs_file))
1113 clear_packed_ref_cache(refs);
1115 if (!refs->packed) {
1118 refs->packed = xcalloc(1, sizeof(*refs->packed));
1119 acquire_packed_ref_cache(refs->packed);
1120 refs->packed->root = create_dir_entry(refs, "", 0, 0);
1121 f = fopen(packed_refs_file, "r");
1123 stat_validity_update(&refs->packed->validity, fileno(f));
1124 read_packed_refs(f, get_ref_dir(refs->packed->root));
1128 free(packed_refs_file);
1129 return refs->packed;
1132 static struct ref_dir *get_packed_ref_dir(struct packed_ref_cache *packed_ref_cache)
1134 return get_ref_dir(packed_ref_cache->root);
1137 static struct ref_dir *get_packed_refs(struct ref_cache *refs)
1139 return get_packed_ref_dir(get_packed_ref_cache(refs));
1143 * Add a reference to the in-memory packed reference cache. This may
1144 * only be called while the packed-refs file is locked (see
1145 * lock_packed_refs()). To actually write the packed-refs file, call
1146 * commit_packed_refs().
1148 static void add_packed_ref(const char *refname, const unsigned char *sha1)
1150 struct packed_ref_cache *packed_ref_cache =
1151 get_packed_ref_cache(&ref_cache);
1153 if (!packed_ref_cache->lock)
1154 die("internal error: packed refs not locked");
1155 add_ref(get_packed_ref_dir(packed_ref_cache),
1156 create_ref_entry(refname, sha1, REF_ISPACKED, 1));
1160 * Read the loose references from the namespace dirname into dir
1161 * (without recursing). dirname must end with '/'. dir must be the
1162 * directory entry corresponding to dirname.
1164 static void read_loose_refs(const char *dirname, struct ref_dir *dir)
1166 struct ref_cache *refs = dir->ref_cache;
1169 int dirnamelen = strlen(dirname);
1170 struct strbuf refname;
1171 struct strbuf path = STRBUF_INIT;
1172 size_t path_baselen;
1175 strbuf_git_path_submodule(&path, refs->name, "%s", dirname);
1177 strbuf_git_path(&path, "%s", dirname);
1178 path_baselen = path.len;
1180 d = opendir(path.buf);
1182 strbuf_release(&path);
1186 strbuf_init(&refname, dirnamelen + 257);
1187 strbuf_add(&refname, dirname, dirnamelen);
1189 while ((de = readdir(d)) != NULL) {
1190 unsigned char sha1[20];
1194 if (de->d_name[0] == '.')
1196 if (ends_with(de->d_name, ".lock"))
1198 strbuf_addstr(&refname, de->d_name);
1199 strbuf_addstr(&path, de->d_name);
1200 if (stat(path.buf, &st) < 0) {
1201 ; /* silently ignore */
1202 } else if (S_ISDIR(st.st_mode)) {
1203 strbuf_addch(&refname, '/');
1204 add_entry_to_dir(dir,
1205 create_dir_entry(refs, refname.buf,
1213 read_ok = !resolve_gitlink_ref(refs->name,
1216 read_ok = !read_ref_full(refname.buf,
1217 RESOLVE_REF_READING,
1223 flag |= REF_ISBROKEN;
1224 } else if (is_null_sha1(sha1)) {
1226 * It is so astronomically unlikely
1227 * that NULL_SHA1 is the SHA-1 of an
1228 * actual object that we consider its
1229 * appearance in a loose reference
1230 * file to be repo corruption
1231 * (probably due to a software bug).
1233 flag |= REF_ISBROKEN;
1236 if (check_refname_format(refname.buf,
1237 REFNAME_ALLOW_ONELEVEL)) {
1238 if (!refname_is_safe(refname.buf))
1239 die("loose refname is dangerous: %s", refname.buf);
1241 flag |= REF_BAD_NAME | REF_ISBROKEN;
1243 add_entry_to_dir(dir,
1244 create_ref_entry(refname.buf, sha1, flag, 0));
1246 strbuf_setlen(&refname, dirnamelen);
1247 strbuf_setlen(&path, path_baselen);
1249 strbuf_release(&refname);
1250 strbuf_release(&path);
1254 static struct ref_dir *get_loose_refs(struct ref_cache *refs)
1258 * Mark the top-level directory complete because we
1259 * are about to read the only subdirectory that can
1262 refs->loose = create_dir_entry(refs, "", 0, 0);
1264 * Create an incomplete entry for "refs/":
1266 add_entry_to_dir(get_ref_dir(refs->loose),
1267 create_dir_entry(refs, "refs/", 5, 1));
1269 return get_ref_dir(refs->loose);
1272 /* We allow "recursive" symbolic refs. Only within reason, though */
1274 #define MAXREFLEN (1024)
1277 * Called by resolve_gitlink_ref_recursive() after it failed to read
1278 * from the loose refs in ref_cache refs. Find <refname> in the
1279 * packed-refs file for the submodule.
1281 static int resolve_gitlink_packed_ref(struct ref_cache *refs,
1282 const char *refname, unsigned char *sha1)
1284 struct ref_entry *ref;
1285 struct ref_dir *dir = get_packed_refs(refs);
1287 ref = find_ref(dir, refname);
1291 hashcpy(sha1, ref->u.value.oid.hash);
1295 static int resolve_gitlink_ref_recursive(struct ref_cache *refs,
1296 const char *refname, unsigned char *sha1,
1300 char buffer[128], *p;
1303 if (recursion > MAXDEPTH || strlen(refname) > MAXREFLEN)
1306 ? git_pathdup_submodule(refs->name, "%s", refname)
1307 : git_pathdup("%s", refname);
1308 fd = open(path, O_RDONLY);
1311 return resolve_gitlink_packed_ref(refs, refname, sha1);
1313 len = read(fd, buffer, sizeof(buffer)-1);
1317 while (len && isspace(buffer[len-1]))
1321 /* Was it a detached head or an old-fashioned symlink? */
1322 if (!get_sha1_hex(buffer, sha1))
1326 if (strncmp(buffer, "ref:", 4))
1332 return resolve_gitlink_ref_recursive(refs, p, sha1, recursion+1);
1335 int resolve_gitlink_ref(const char *path, const char *refname, unsigned char *sha1)
1337 int len = strlen(path), retval;
1338 struct strbuf submodule = STRBUF_INIT;
1339 struct ref_cache *refs;
1341 while (len && path[len-1] == '/')
1346 strbuf_add(&submodule, path, len);
1347 refs = lookup_ref_cache(submodule.buf);
1349 if (!is_nonbare_repository_dir(&submodule)) {
1350 strbuf_release(&submodule);
1353 refs = create_ref_cache(submodule.buf);
1355 strbuf_release(&submodule);
1357 retval = resolve_gitlink_ref_recursive(refs, refname, sha1, 0);
1362 * Return the ref_entry for the given refname from the packed
1363 * references. If it does not exist, return NULL.
1365 static struct ref_entry *get_packed_ref(const char *refname)
1367 return find_ref(get_packed_refs(&ref_cache), refname);
1371 * A loose ref file doesn't exist; check for a packed ref.
1373 static int resolve_missing_loose_ref(const char *refname,
1374 unsigned char *sha1,
1377 struct ref_entry *entry;
1380 * The loose reference file does not exist; check for a packed
1383 entry = get_packed_ref(refname);
1385 hashcpy(sha1, entry->u.value.oid.hash);
1387 *flags |= REF_ISPACKED;
1390 /* refname is not a packed reference. */
1394 /* This function needs to return a meaningful errno on failure */
1395 static const char *resolve_ref_1(const char *refname,
1397 unsigned char *sha1,
1399 struct strbuf *sb_refname,
1400 struct strbuf *sb_path,
1401 struct strbuf *sb_contents)
1403 int depth = MAXDEPTH;
1409 if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {
1411 *flags |= REF_BAD_NAME;
1413 if (!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||
1414 !refname_is_safe(refname)) {
1419 * dwim_ref() uses REF_ISBROKEN to distinguish between
1420 * missing refs and refs that were present but invalid,
1421 * to complain about the latter to stderr.
1423 * We don't know whether the ref exists, so don't set
1439 strbuf_reset(sb_path);
1440 strbuf_git_path(sb_path, "%s", refname);
1441 path = sb_path->buf;
1444 * We might have to loop back here to avoid a race
1445 * condition: first we lstat() the file, then we try
1446 * to read it as a link or as a file. But if somebody
1447 * changes the type of the file (file <-> directory
1448 * <-> symlink) between the lstat() and reading, then
1449 * we don't want to report that as an error but rather
1450 * try again starting with the lstat().
1453 if (lstat(path, &st) < 0) {
1454 if (errno != ENOENT)
1456 if (resolve_missing_loose_ref(refname, sha1, flags)) {
1457 if (resolve_flags & RESOLVE_REF_READING) {
1466 *flags |= REF_ISBROKEN;
1471 /* Follow "normalized" - ie "refs/.." symlinks by hand */
1472 if (S_ISLNK(st.st_mode)) {
1473 strbuf_reset(sb_contents);
1474 if (strbuf_readlink(sb_contents, path, 0) < 0) {
1475 if (errno == ENOENT || errno == EINVAL)
1476 /* inconsistent with lstat; retry */
1481 if (starts_with(sb_contents->buf, "refs/") &&
1482 !check_refname_format(sb_contents->buf, 0)) {
1483 strbuf_swap(sb_refname, sb_contents);
1484 refname = sb_refname->buf;
1486 *flags |= REF_ISSYMREF;
1487 if (resolve_flags & RESOLVE_REF_NO_RECURSE) {
1495 /* Is it a directory? */
1496 if (S_ISDIR(st.st_mode)) {
1502 * Anything else, just open it and try to use it as
1505 fd = open(path, O_RDONLY);
1507 if (errno == ENOENT)
1508 /* inconsistent with lstat; retry */
1513 strbuf_reset(sb_contents);
1514 if (strbuf_read(sb_contents, fd, 256) < 0) {
1515 int save_errno = errno;
1521 strbuf_rtrim(sb_contents);
1524 * Is it a symbolic ref?
1526 if (!starts_with(sb_contents->buf, "ref:")) {
1528 * Please note that FETCH_HEAD has a second
1529 * line containing other data.
1531 if (get_sha1_hex(sb_contents->buf, sha1) ||
1532 (sb_contents->buf[40] != '\0' && !isspace(sb_contents->buf[40]))) {
1534 *flags |= REF_ISBROKEN;
1541 *flags |= REF_ISBROKEN;
1546 *flags |= REF_ISSYMREF;
1547 buf = sb_contents->buf + 4;
1548 while (isspace(*buf))
1550 strbuf_reset(sb_refname);
1551 strbuf_addstr(sb_refname, buf);
1552 refname = sb_refname->buf;
1553 if (resolve_flags & RESOLVE_REF_NO_RECURSE) {
1557 if (check_refname_format(buf, REFNAME_ALLOW_ONELEVEL)) {
1559 *flags |= REF_ISBROKEN;
1561 if (!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||
1562 !refname_is_safe(buf)) {
1571 const char *resolve_ref_unsafe(const char *refname, int resolve_flags,
1572 unsigned char *sha1, int *flags)
1574 static struct strbuf sb_refname = STRBUF_INIT;
1575 struct strbuf sb_contents = STRBUF_INIT;
1576 struct strbuf sb_path = STRBUF_INIT;
1579 ret = resolve_ref_1(refname, resolve_flags, sha1, flags,
1580 &sb_refname, &sb_path, &sb_contents);
1581 strbuf_release(&sb_path);
1582 strbuf_release(&sb_contents);
1587 * Peel the entry (if possible) and return its new peel_status. If
1588 * repeel is true, re-peel the entry even if there is an old peeled
1589 * value that is already stored in it.
1591 * It is OK to call this function with a packed reference entry that
1592 * might be stale and might even refer to an object that has since
1593 * been garbage-collected. In such a case, if the entry has
1594 * REF_KNOWS_PEELED then leave the status unchanged and return
1595 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.
1597 static enum peel_status peel_entry(struct ref_entry *entry, int repeel)
1599 enum peel_status status;
1601 if (entry->flag & REF_KNOWS_PEELED) {
1603 entry->flag &= ~REF_KNOWS_PEELED;
1604 oidclr(&entry->u.value.peeled);
1606 return is_null_oid(&entry->u.value.peeled) ?
1607 PEEL_NON_TAG : PEEL_PEELED;
1610 if (entry->flag & REF_ISBROKEN)
1612 if (entry->flag & REF_ISSYMREF)
1613 return PEEL_IS_SYMREF;
1615 status = peel_object(entry->u.value.oid.hash, entry->u.value.peeled.hash);
1616 if (status == PEEL_PEELED || status == PEEL_NON_TAG)
1617 entry->flag |= REF_KNOWS_PEELED;
1621 int peel_ref(const char *refname, unsigned char *sha1)
1624 unsigned char base[20];
1626 if (current_ref && (current_ref->name == refname
1627 || !strcmp(current_ref->name, refname))) {
1628 if (peel_entry(current_ref, 0))
1630 hashcpy(sha1, current_ref->u.value.peeled.hash);
1634 if (read_ref_full(refname, RESOLVE_REF_READING, base, &flag))
1638 * If the reference is packed, read its ref_entry from the
1639 * cache in the hope that we already know its peeled value.
1640 * We only try this optimization on packed references because
1641 * (a) forcing the filling of the loose reference cache could
1642 * be expensive and (b) loose references anyway usually do not
1643 * have REF_KNOWS_PEELED.
1645 if (flag & REF_ISPACKED) {
1646 struct ref_entry *r = get_packed_ref(refname);
1648 if (peel_entry(r, 0))
1650 hashcpy(sha1, r->u.value.peeled.hash);
1655 return peel_object(base, sha1);
1659 * Call fn for each reference in the specified ref_cache, omitting
1660 * references not in the containing_dir of base. fn is called for all
1661 * references, including broken ones. If fn ever returns a non-zero
1662 * value, stop the iteration and return that value; otherwise, return
1665 static int do_for_each_entry(struct ref_cache *refs, const char *base,
1666 each_ref_entry_fn fn, void *cb_data)
1668 struct packed_ref_cache *packed_ref_cache;
1669 struct ref_dir *loose_dir;
1670 struct ref_dir *packed_dir;
1674 * We must make sure that all loose refs are read before accessing the
1675 * packed-refs file; this avoids a race condition in which loose refs
1676 * are migrated to the packed-refs file by a simultaneous process, but
1677 * our in-memory view is from before the migration. get_packed_ref_cache()
1678 * takes care of making sure our view is up to date with what is on
1681 loose_dir = get_loose_refs(refs);
1682 if (base && *base) {
1683 loose_dir = find_containing_dir(loose_dir, base, 0);
1686 prime_ref_dir(loose_dir);
1688 packed_ref_cache = get_packed_ref_cache(refs);
1689 acquire_packed_ref_cache(packed_ref_cache);
1690 packed_dir = get_packed_ref_dir(packed_ref_cache);
1691 if (base && *base) {
1692 packed_dir = find_containing_dir(packed_dir, base, 0);
1695 if (packed_dir && loose_dir) {
1696 sort_ref_dir(packed_dir);
1697 sort_ref_dir(loose_dir);
1698 retval = do_for_each_entry_in_dirs(
1699 packed_dir, loose_dir, fn, cb_data);
1700 } else if (packed_dir) {
1701 sort_ref_dir(packed_dir);
1702 retval = do_for_each_entry_in_dir(
1703 packed_dir, 0, fn, cb_data);
1704 } else if (loose_dir) {
1705 sort_ref_dir(loose_dir);
1706 retval = do_for_each_entry_in_dir(
1707 loose_dir, 0, fn, cb_data);
1710 release_packed_ref_cache(packed_ref_cache);
1715 * Call fn for each reference in the specified ref_cache for which the
1716 * refname begins with base. If trim is non-zero, then trim that many
1717 * characters off the beginning of each refname before passing the
1718 * refname to fn. flags can be DO_FOR_EACH_INCLUDE_BROKEN to include
1719 * broken references in the iteration. If fn ever returns a non-zero
1720 * value, stop the iteration and return that value; otherwise, return
1723 int do_for_each_ref(const char *submodule, const char *base,
1724 each_ref_fn fn, int trim, int flags, void *cb_data)
1726 struct ref_entry_cb data;
1727 struct ref_cache *refs;
1729 refs = get_ref_cache(submodule);
1734 data.cb_data = cb_data;
1736 if (ref_paranoia < 0)
1737 ref_paranoia = git_env_bool("GIT_REF_PARANOIA", 0);
1739 data.flags |= DO_FOR_EACH_INCLUDE_BROKEN;
1741 return do_for_each_entry(refs, base, do_one_ref, &data);
1744 static void unlock_ref(struct ref_lock *lock)
1746 /* Do not free lock->lk -- atexit() still looks at them */
1748 rollback_lock_file(lock->lk);
1749 free(lock->ref_name);
1750 free(lock->orig_ref_name);
1755 * Verify that the reference locked by lock has the value old_sha1.
1756 * Fail if the reference doesn't exist and mustexist is set. Return 0
1757 * on success. On error, write an error message to err, set errno, and
1758 * return a negative value.
1760 static int verify_lock(struct ref_lock *lock,
1761 const unsigned char *old_sha1, int mustexist,
1766 if (read_ref_full(lock->ref_name,
1767 mustexist ? RESOLVE_REF_READING : 0,
1768 lock->old_oid.hash, NULL)) {
1770 int save_errno = errno;
1771 strbuf_addf(err, "can't verify ref %s", lock->ref_name);
1775 hashclr(lock->old_oid.hash);
1779 if (old_sha1 && hashcmp(lock->old_oid.hash, old_sha1)) {
1780 strbuf_addf(err, "ref %s is at %s but expected %s",
1782 sha1_to_hex(lock->old_oid.hash),
1783 sha1_to_hex(old_sha1));
1790 static int remove_empty_directories(struct strbuf *path)
1793 * we want to create a file but there is a directory there;
1794 * if that is an empty directory (or a directory that contains
1795 * only empty directories), remove them.
1797 return remove_dir_recursively(path, REMOVE_DIR_EMPTY_ONLY);
1801 * Locks a ref returning the lock on success and NULL on failure.
1802 * On failure errno is set to something meaningful.
1804 static struct ref_lock *lock_ref_sha1_basic(const char *refname,
1805 const unsigned char *old_sha1,
1806 const struct string_list *extras,
1807 const struct string_list *skip,
1808 unsigned int flags, int *type_p,
1811 struct strbuf ref_file = STRBUF_INIT;
1812 struct strbuf orig_ref_file = STRBUF_INIT;
1813 const char *orig_refname = refname;
1814 struct ref_lock *lock;
1818 int mustexist = (old_sha1 && !is_null_sha1(old_sha1));
1819 int resolve_flags = 0;
1820 int attempts_remaining = 3;
1824 lock = xcalloc(1, sizeof(struct ref_lock));
1827 resolve_flags |= RESOLVE_REF_READING;
1828 if (flags & REF_DELETING)
1829 resolve_flags |= RESOLVE_REF_ALLOW_BAD_NAME;
1830 if (flags & REF_NODEREF) {
1831 resolve_flags |= RESOLVE_REF_NO_RECURSE;
1832 lflags |= LOCK_NO_DEREF;
1835 refname = resolve_ref_unsafe(refname, resolve_flags,
1836 lock->old_oid.hash, &type);
1837 if (!refname && errno == EISDIR) {
1839 * we are trying to lock foo but we used to
1840 * have foo/bar which now does not exist;
1841 * it is normal for the empty directory 'foo'
1844 strbuf_git_path(&orig_ref_file, "%s", orig_refname);
1845 if (remove_empty_directories(&orig_ref_file)) {
1847 if (!verify_refname_available_dir(orig_refname, extras, skip,
1848 get_loose_refs(&ref_cache), err))
1849 strbuf_addf(err, "there are still refs under '%s'",
1853 refname = resolve_ref_unsafe(orig_refname, resolve_flags,
1854 lock->old_oid.hash, &type);
1860 if (last_errno != ENOTDIR ||
1861 !verify_refname_available_dir(orig_refname, extras, skip,
1862 get_loose_refs(&ref_cache), err))
1863 strbuf_addf(err, "unable to resolve reference %s: %s",
1864 orig_refname, strerror(last_errno));
1869 if (flags & REF_NODEREF)
1870 refname = orig_refname;
1873 * If the ref did not exist and we are creating it, make sure
1874 * there is no existing packed ref whose name begins with our
1875 * refname, nor a packed ref whose name is a proper prefix of
1878 if (is_null_oid(&lock->old_oid) &&
1879 verify_refname_available_dir(refname, extras, skip,
1880 get_packed_refs(&ref_cache), err)) {
1881 last_errno = ENOTDIR;
1885 lock->lk = xcalloc(1, sizeof(struct lock_file));
1887 lock->ref_name = xstrdup(refname);
1888 lock->orig_ref_name = xstrdup(orig_refname);
1889 strbuf_git_path(&ref_file, "%s", refname);
1892 switch (safe_create_leading_directories_const(ref_file.buf)) {
1894 break; /* success */
1896 if (--attempts_remaining > 0)
1901 strbuf_addf(err, "unable to create directory for %s",
1906 if (hold_lock_file_for_update(lock->lk, ref_file.buf, lflags) < 0) {
1908 if (errno == ENOENT && --attempts_remaining > 0)
1910 * Maybe somebody just deleted one of the
1911 * directories leading to ref_file. Try
1916 unable_to_lock_message(ref_file.buf, errno, err);
1920 if (verify_lock(lock, old_sha1, mustexist, err)) {
1931 strbuf_release(&ref_file);
1932 strbuf_release(&orig_ref_file);
1938 * Write an entry to the packed-refs file for the specified refname.
1939 * If peeled is non-NULL, write it as the entry's peeled value.
1941 static void write_packed_entry(FILE *fh, char *refname, unsigned char *sha1,
1942 unsigned char *peeled)
1944 fprintf_or_die(fh, "%s %s\n", sha1_to_hex(sha1), refname);
1946 fprintf_or_die(fh, "^%s\n", sha1_to_hex(peeled));
1950 * An each_ref_entry_fn that writes the entry to a packed-refs file.
1952 static int write_packed_entry_fn(struct ref_entry *entry, void *cb_data)
1954 enum peel_status peel_status = peel_entry(entry, 0);
1956 if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)
1957 error("internal error: %s is not a valid packed reference!",
1959 write_packed_entry(cb_data, entry->name, entry->u.value.oid.hash,
1960 peel_status == PEEL_PEELED ?
1961 entry->u.value.peeled.hash : NULL);
1966 * Lock the packed-refs file for writing. Flags is passed to
1967 * hold_lock_file_for_update(). Return 0 on success. On errors, set
1968 * errno appropriately and return a nonzero value.
1970 static int lock_packed_refs(int flags)
1972 static int timeout_configured = 0;
1973 static int timeout_value = 1000;
1975 struct packed_ref_cache *packed_ref_cache;
1977 if (!timeout_configured) {
1978 git_config_get_int("core.packedrefstimeout", &timeout_value);
1979 timeout_configured = 1;
1982 if (hold_lock_file_for_update_timeout(
1983 &packlock, git_path("packed-refs"),
1984 flags, timeout_value) < 0)
1987 * Get the current packed-refs while holding the lock. If the
1988 * packed-refs file has been modified since we last read it,
1989 * this will automatically invalidate the cache and re-read
1990 * the packed-refs file.
1992 packed_ref_cache = get_packed_ref_cache(&ref_cache);
1993 packed_ref_cache->lock = &packlock;
1994 /* Increment the reference count to prevent it from being freed: */
1995 acquire_packed_ref_cache(packed_ref_cache);
2000 * Write the current version of the packed refs cache from memory to
2001 * disk. The packed-refs file must already be locked for writing (see
2002 * lock_packed_refs()). Return zero on success. On errors, set errno
2003 * and return a nonzero value
2005 static int commit_packed_refs(void)
2007 struct packed_ref_cache *packed_ref_cache =
2008 get_packed_ref_cache(&ref_cache);
2013 if (!packed_ref_cache->lock)
2014 die("internal error: packed-refs not locked");
2016 out = fdopen_lock_file(packed_ref_cache->lock, "w");
2018 die_errno("unable to fdopen packed-refs descriptor");
2020 fprintf_or_die(out, "%s", PACKED_REFS_HEADER);
2021 do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache),
2022 0, write_packed_entry_fn, out);
2024 if (commit_lock_file(packed_ref_cache->lock)) {
2028 packed_ref_cache->lock = NULL;
2029 release_packed_ref_cache(packed_ref_cache);
2035 * Rollback the lockfile for the packed-refs file, and discard the
2036 * in-memory packed reference cache. (The packed-refs file will be
2037 * read anew if it is needed again after this function is called.)
2039 static void rollback_packed_refs(void)
2041 struct packed_ref_cache *packed_ref_cache =
2042 get_packed_ref_cache(&ref_cache);
2044 if (!packed_ref_cache->lock)
2045 die("internal error: packed-refs not locked");
2046 rollback_lock_file(packed_ref_cache->lock);
2047 packed_ref_cache->lock = NULL;
2048 release_packed_ref_cache(packed_ref_cache);
2049 clear_packed_ref_cache(&ref_cache);
2052 struct ref_to_prune {
2053 struct ref_to_prune *next;
2054 unsigned char sha1[20];
2055 char name[FLEX_ARRAY];
2058 struct pack_refs_cb_data {
2060 struct ref_dir *packed_refs;
2061 struct ref_to_prune *ref_to_prune;
2065 * An each_ref_entry_fn that is run over loose references only. If
2066 * the loose reference can be packed, add an entry in the packed ref
2067 * cache. If the reference should be pruned, also add it to
2068 * ref_to_prune in the pack_refs_cb_data.
2070 static int pack_if_possible_fn(struct ref_entry *entry, void *cb_data)
2072 struct pack_refs_cb_data *cb = cb_data;
2073 enum peel_status peel_status;
2074 struct ref_entry *packed_entry;
2075 int is_tag_ref = starts_with(entry->name, "refs/tags/");
2077 /* Do not pack per-worktree refs: */
2078 if (ref_type(entry->name) != REF_TYPE_NORMAL)
2081 /* ALWAYS pack tags */
2082 if (!(cb->flags & PACK_REFS_ALL) && !is_tag_ref)
2085 /* Do not pack symbolic or broken refs: */
2086 if ((entry->flag & REF_ISSYMREF) || !ref_resolves_to_object(entry))
2089 /* Add a packed ref cache entry equivalent to the loose entry. */
2090 peel_status = peel_entry(entry, 1);
2091 if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)
2092 die("internal error peeling reference %s (%s)",
2093 entry->name, oid_to_hex(&entry->u.value.oid));
2094 packed_entry = find_ref(cb->packed_refs, entry->name);
2096 /* Overwrite existing packed entry with info from loose entry */
2097 packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED;
2098 oidcpy(&packed_entry->u.value.oid, &entry->u.value.oid);
2100 packed_entry = create_ref_entry(entry->name, entry->u.value.oid.hash,
2101 REF_ISPACKED | REF_KNOWS_PEELED, 0);
2102 add_ref(cb->packed_refs, packed_entry);
2104 oidcpy(&packed_entry->u.value.peeled, &entry->u.value.peeled);
2106 /* Schedule the loose reference for pruning if requested. */
2107 if ((cb->flags & PACK_REFS_PRUNE)) {
2108 struct ref_to_prune *n;
2109 FLEX_ALLOC_STR(n, name, entry->name);
2110 hashcpy(n->sha1, entry->u.value.oid.hash);
2111 n->next = cb->ref_to_prune;
2112 cb->ref_to_prune = n;
2118 * Remove empty parents, but spare refs/ and immediate subdirs.
2119 * Note: munges *name.
2121 static void try_remove_empty_parents(char *name)
2126 for (i = 0; i < 2; i++) { /* refs/{heads,tags,...}/ */
2127 while (*p && *p != '/')
2129 /* tolerate duplicate slashes; see check_refname_format() */
2133 for (q = p; *q; q++)
2136 while (q > p && *q != '/')
2138 while (q > p && *(q-1) == '/')
2143 if (rmdir(git_path("%s", name)))
2148 /* make sure nobody touched the ref, and unlink */
2149 static void prune_ref(struct ref_to_prune *r)
2151 struct ref_transaction *transaction;
2152 struct strbuf err = STRBUF_INIT;
2154 if (check_refname_format(r->name, 0))
2157 transaction = ref_transaction_begin(&err);
2159 ref_transaction_delete(transaction, r->name, r->sha1,
2160 REF_ISPRUNING, NULL, &err) ||
2161 ref_transaction_commit(transaction, &err)) {
2162 ref_transaction_free(transaction);
2163 error("%s", err.buf);
2164 strbuf_release(&err);
2167 ref_transaction_free(transaction);
2168 strbuf_release(&err);
2169 try_remove_empty_parents(r->name);
2172 static void prune_refs(struct ref_to_prune *r)
2180 int pack_refs(unsigned int flags)
2182 struct pack_refs_cb_data cbdata;
2184 memset(&cbdata, 0, sizeof(cbdata));
2185 cbdata.flags = flags;
2187 lock_packed_refs(LOCK_DIE_ON_ERROR);
2188 cbdata.packed_refs = get_packed_refs(&ref_cache);
2190 do_for_each_entry_in_dir(get_loose_refs(&ref_cache), 0,
2191 pack_if_possible_fn, &cbdata);
2193 if (commit_packed_refs())
2194 die_errno("unable to overwrite old ref-pack file");
2196 prune_refs(cbdata.ref_to_prune);
2201 * Rewrite the packed-refs file, omitting any refs listed in
2202 * 'refnames'. On error, leave packed-refs unchanged, write an error
2203 * message to 'err', and return a nonzero value.
2205 * The refs in 'refnames' needn't be sorted. `err` must not be NULL.
2207 static int repack_without_refs(struct string_list *refnames, struct strbuf *err)
2209 struct ref_dir *packed;
2210 struct string_list_item *refname;
2211 int ret, needs_repacking = 0, removed = 0;
2215 /* Look for a packed ref */
2216 for_each_string_list_item(refname, refnames) {
2217 if (get_packed_ref(refname->string)) {
2218 needs_repacking = 1;
2223 /* Avoid locking if we have nothing to do */
2224 if (!needs_repacking)
2225 return 0; /* no refname exists in packed refs */
2227 if (lock_packed_refs(0)) {
2228 unable_to_lock_message(git_path("packed-refs"), errno, err);
2231 packed = get_packed_refs(&ref_cache);
2233 /* Remove refnames from the cache */
2234 for_each_string_list_item(refname, refnames)
2235 if (remove_entry(packed, refname->string) != -1)
2239 * All packed entries disappeared while we were
2240 * acquiring the lock.
2242 rollback_packed_refs();
2246 /* Write what remains */
2247 ret = commit_packed_refs();
2249 strbuf_addf(err, "unable to overwrite old ref-pack file: %s",
2254 static int delete_ref_loose(struct ref_lock *lock, int flag, struct strbuf *err)
2258 if (!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) {
2260 * loose. The loose file name is the same as the
2261 * lockfile name, minus ".lock":
2263 char *loose_filename = get_locked_file_path(lock->lk);
2264 int res = unlink_or_msg(loose_filename, err);
2265 free(loose_filename);
2272 int delete_refs(struct string_list *refnames)
2274 struct strbuf err = STRBUF_INIT;
2280 result = repack_without_refs(refnames, &err);
2283 * If we failed to rewrite the packed-refs file, then
2284 * it is unsafe to try to remove loose refs, because
2285 * doing so might expose an obsolete packed value for
2286 * a reference that might even point at an object that
2287 * has been garbage collected.
2289 if (refnames->nr == 1)
2290 error(_("could not delete reference %s: %s"),
2291 refnames->items[0].string, err.buf);
2293 error(_("could not delete references: %s"), err.buf);
2298 for (i = 0; i < refnames->nr; i++) {
2299 const char *refname = refnames->items[i].string;
2301 if (delete_ref(refname, NULL, 0))
2302 result |= error(_("could not remove reference %s"), refname);
2306 strbuf_release(&err);
2311 * People using contrib's git-new-workdir have .git/logs/refs ->
2312 * /some/other/path/.git/logs/refs, and that may live on another device.
2314 * IOW, to avoid cross device rename errors, the temporary renamed log must
2315 * live into logs/refs.
2317 #define TMP_RENAMED_LOG "logs/refs/.tmp-renamed-log"
2319 static int rename_tmp_log(const char *newrefname)
2321 int attempts_remaining = 4;
2322 struct strbuf path = STRBUF_INIT;
2326 strbuf_reset(&path);
2327 strbuf_git_path(&path, "logs/%s", newrefname);
2328 switch (safe_create_leading_directories_const(path.buf)) {
2330 break; /* success */
2332 if (--attempts_remaining > 0)
2336 error("unable to create directory for %s", newrefname);
2340 if (rename(git_path(TMP_RENAMED_LOG), path.buf)) {
2341 if ((errno==EISDIR || errno==ENOTDIR) && --attempts_remaining > 0) {
2343 * rename(a, b) when b is an existing
2344 * directory ought to result in ISDIR, but
2345 * Solaris 5.8 gives ENOTDIR. Sheesh.
2347 if (remove_empty_directories(&path)) {
2348 error("Directory not empty: logs/%s", newrefname);
2352 } else if (errno == ENOENT && --attempts_remaining > 0) {
2354 * Maybe another process just deleted one of
2355 * the directories in the path to newrefname.
2356 * Try again from the beginning.
2360 error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s: %s",
2361 newrefname, strerror(errno));
2367 strbuf_release(&path);
2371 int verify_refname_available(const char *newname,
2372 struct string_list *extras,
2373 struct string_list *skip,
2376 struct ref_dir *packed_refs = get_packed_refs(&ref_cache);
2377 struct ref_dir *loose_refs = get_loose_refs(&ref_cache);
2379 if (verify_refname_available_dir(newname, extras, skip,
2380 packed_refs, err) ||
2381 verify_refname_available_dir(newname, extras, skip,
2388 static int write_ref_to_lockfile(struct ref_lock *lock,
2389 const unsigned char *sha1, struct strbuf *err);
2390 static int commit_ref_update(struct ref_lock *lock,
2391 const unsigned char *sha1, const char *logmsg,
2392 int flags, struct strbuf *err);
2394 int rename_ref(const char *oldrefname, const char *newrefname, const char *logmsg)
2396 unsigned char sha1[20], orig_sha1[20];
2397 int flag = 0, logmoved = 0;
2398 struct ref_lock *lock;
2399 struct stat loginfo;
2400 int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);
2401 const char *symref = NULL;
2402 struct strbuf err = STRBUF_INIT;
2404 if (log && S_ISLNK(loginfo.st_mode))
2405 return error("reflog for %s is a symlink", oldrefname);
2407 symref = resolve_ref_unsafe(oldrefname, RESOLVE_REF_READING,
2409 if (flag & REF_ISSYMREF)
2410 return error("refname %s is a symbolic ref, renaming it is not supported",
2413 return error("refname %s not found", oldrefname);
2415 if (!rename_ref_available(oldrefname, newrefname))
2418 if (log && rename(git_path("logs/%s", oldrefname), git_path(TMP_RENAMED_LOG)))
2419 return error("unable to move logfile logs/%s to "TMP_RENAMED_LOG": %s",
2420 oldrefname, strerror(errno));
2422 if (delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {
2423 error("unable to delete old %s", oldrefname);
2427 if (!read_ref_full(newrefname, RESOLVE_REF_READING, sha1, NULL) &&
2428 delete_ref(newrefname, sha1, REF_NODEREF)) {
2429 if (errno==EISDIR) {
2430 struct strbuf path = STRBUF_INIT;
2433 strbuf_git_path(&path, "%s", newrefname);
2434 result = remove_empty_directories(&path);
2435 strbuf_release(&path);
2438 error("Directory not empty: %s", newrefname);
2442 error("unable to delete existing %s", newrefname);
2447 if (log && rename_tmp_log(newrefname))
2452 lock = lock_ref_sha1_basic(newrefname, NULL, NULL, NULL, 0, NULL, &err);
2454 error("unable to rename '%s' to '%s': %s", oldrefname, newrefname, err.buf);
2455 strbuf_release(&err);
2458 hashcpy(lock->old_oid.hash, orig_sha1);
2460 if (write_ref_to_lockfile(lock, orig_sha1, &err) ||
2461 commit_ref_update(lock, orig_sha1, logmsg, 0, &err)) {
2462 error("unable to write current sha1 into %s: %s", newrefname, err.buf);
2463 strbuf_release(&err);
2470 lock = lock_ref_sha1_basic(oldrefname, NULL, NULL, NULL, 0, NULL, &err);
2472 error("unable to lock %s for rollback: %s", oldrefname, err.buf);
2473 strbuf_release(&err);
2477 flag = log_all_ref_updates;
2478 log_all_ref_updates = 0;
2479 if (write_ref_to_lockfile(lock, orig_sha1, &err) ||
2480 commit_ref_update(lock, orig_sha1, NULL, 0, &err)) {
2481 error("unable to write current sha1 into %s: %s", oldrefname, err.buf);
2482 strbuf_release(&err);
2484 log_all_ref_updates = flag;
2487 if (logmoved && rename(git_path("logs/%s", newrefname), git_path("logs/%s", oldrefname)))
2488 error("unable to restore logfile %s from %s: %s",
2489 oldrefname, newrefname, strerror(errno));
2490 if (!logmoved && log &&
2491 rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", oldrefname)))
2492 error("unable to restore logfile %s from "TMP_RENAMED_LOG": %s",
2493 oldrefname, strerror(errno));
2498 static int close_ref(struct ref_lock *lock)
2500 if (close_lock_file(lock->lk))
2505 static int commit_ref(struct ref_lock *lock)
2507 if (commit_lock_file(lock->lk))
2513 * Create a reflog for a ref. If force_create = 0, the reflog will
2514 * only be created for certain refs (those for which
2515 * should_autocreate_reflog returns non-zero. Otherwise, create it
2516 * regardless of the ref name. Fill in *err and return -1 on failure.
2518 static int log_ref_setup(const char *refname, struct strbuf *logfile, struct strbuf *err, int force_create)
2520 int logfd, oflags = O_APPEND | O_WRONLY;
2522 strbuf_git_path(logfile, "logs/%s", refname);
2523 if (force_create || should_autocreate_reflog(refname)) {
2524 if (safe_create_leading_directories(logfile->buf) < 0) {
2525 strbuf_addf(err, "unable to create directory for %s: "
2526 "%s", logfile->buf, strerror(errno));
2532 logfd = open(logfile->buf, oflags, 0666);
2534 if (!(oflags & O_CREAT) && (errno == ENOENT || errno == EISDIR))
2537 if (errno == EISDIR) {
2538 if (remove_empty_directories(logfile)) {
2539 strbuf_addf(err, "There are still logs under "
2540 "'%s'", logfile->buf);
2543 logfd = open(logfile->buf, oflags, 0666);
2547 strbuf_addf(err, "unable to append to %s: %s",
2548 logfile->buf, strerror(errno));
2553 adjust_shared_perm(logfile->buf);
2559 int safe_create_reflog(const char *refname, int force_create, struct strbuf *err)
2562 struct strbuf sb = STRBUF_INIT;
2564 ret = log_ref_setup(refname, &sb, err, force_create);
2565 strbuf_release(&sb);
2569 static int log_ref_write_fd(int fd, const unsigned char *old_sha1,
2570 const unsigned char *new_sha1,
2571 const char *committer, const char *msg)
2573 int msglen, written;
2574 unsigned maxlen, len;
2577 msglen = msg ? strlen(msg) : 0;
2578 maxlen = strlen(committer) + msglen + 100;
2579 logrec = xmalloc(maxlen);
2580 len = xsnprintf(logrec, maxlen, "%s %s %s\n",
2581 sha1_to_hex(old_sha1),
2582 sha1_to_hex(new_sha1),
2585 len += copy_reflog_msg(logrec + len - 1, msg) - 1;
2587 written = len <= maxlen ? write_in_full(fd, logrec, len) : -1;
2595 static int log_ref_write_1(const char *refname, const unsigned char *old_sha1,
2596 const unsigned char *new_sha1, const char *msg,
2597 struct strbuf *logfile, int flags,
2600 int logfd, result, oflags = O_APPEND | O_WRONLY;
2602 if (log_all_ref_updates < 0)
2603 log_all_ref_updates = !is_bare_repository();
2605 result = log_ref_setup(refname, logfile, err, flags & REF_FORCE_CREATE_REFLOG);
2610 logfd = open(logfile->buf, oflags);
2613 result = log_ref_write_fd(logfd, old_sha1, new_sha1,
2614 git_committer_info(0), msg);
2616 strbuf_addf(err, "unable to append to %s: %s", logfile->buf,
2622 strbuf_addf(err, "unable to append to %s: %s", logfile->buf,
2629 static int log_ref_write(const char *refname, const unsigned char *old_sha1,
2630 const unsigned char *new_sha1, const char *msg,
2631 int flags, struct strbuf *err)
2633 return files_log_ref_write(refname, old_sha1, new_sha1, msg, flags,
2637 int files_log_ref_write(const char *refname, const unsigned char *old_sha1,
2638 const unsigned char *new_sha1, const char *msg,
2639 int flags, struct strbuf *err)
2641 struct strbuf sb = STRBUF_INIT;
2642 int ret = log_ref_write_1(refname, old_sha1, new_sha1, msg, &sb, flags,
2644 strbuf_release(&sb);
2649 * Write sha1 into the open lockfile, then close the lockfile. On
2650 * errors, rollback the lockfile, fill in *err and
2653 static int write_ref_to_lockfile(struct ref_lock *lock,
2654 const unsigned char *sha1, struct strbuf *err)
2656 static char term = '\n';
2660 o = parse_object(sha1);
2663 "Trying to write ref %s with nonexistent object %s",
2664 lock->ref_name, sha1_to_hex(sha1));
2668 if (o->type != OBJ_COMMIT && is_branch(lock->ref_name)) {
2670 "Trying to write non-commit object %s to branch %s",
2671 sha1_to_hex(sha1), lock->ref_name);
2675 fd = get_lock_file_fd(lock->lk);
2676 if (write_in_full(fd, sha1_to_hex(sha1), 40) != 40 ||
2677 write_in_full(fd, &term, 1) != 1 ||
2678 close_ref(lock) < 0) {
2680 "Couldn't write %s", get_lock_file_path(lock->lk));
2688 * Commit a change to a loose reference that has already been written
2689 * to the loose reference lockfile. Also update the reflogs if
2690 * necessary, using the specified lockmsg (which can be NULL).
2692 static int commit_ref_update(struct ref_lock *lock,
2693 const unsigned char *sha1, const char *logmsg,
2694 int flags, struct strbuf *err)
2696 clear_loose_ref_cache(&ref_cache);
2697 if (log_ref_write(lock->ref_name, lock->old_oid.hash, sha1, logmsg, flags, err) < 0 ||
2698 (strcmp(lock->ref_name, lock->orig_ref_name) &&
2699 log_ref_write(lock->orig_ref_name, lock->old_oid.hash, sha1, logmsg, flags, err) < 0)) {
2700 char *old_msg = strbuf_detach(err, NULL);
2701 strbuf_addf(err, "Cannot update the ref '%s': %s",
2702 lock->ref_name, old_msg);
2707 if (strcmp(lock->orig_ref_name, "HEAD") != 0) {
2709 * Special hack: If a branch is updated directly and HEAD
2710 * points to it (may happen on the remote side of a push
2711 * for example) then logically the HEAD reflog should be
2713 * A generic solution implies reverse symref information,
2714 * but finding all symrefs pointing to the given branch
2715 * would be rather costly for this rare event (the direct
2716 * update of a branch) to be worth it. So let's cheat and
2717 * check with HEAD only which should cover 99% of all usage
2718 * scenarios (even 100% of the default ones).
2720 unsigned char head_sha1[20];
2722 const char *head_ref;
2723 head_ref = resolve_ref_unsafe("HEAD", RESOLVE_REF_READING,
2724 head_sha1, &head_flag);
2725 if (head_ref && (head_flag & REF_ISSYMREF) &&
2726 !strcmp(head_ref, lock->ref_name)) {
2727 struct strbuf log_err = STRBUF_INIT;
2728 if (log_ref_write("HEAD", lock->old_oid.hash, sha1,
2729 logmsg, 0, &log_err)) {
2730 error("%s", log_err.buf);
2731 strbuf_release(&log_err);
2735 if (commit_ref(lock)) {
2736 error("Couldn't set %s", lock->ref_name);
2745 static int create_ref_symlink(struct ref_lock *lock, const char *target)
2748 #ifndef NO_SYMLINK_HEAD
2749 char *ref_path = get_locked_file_path(lock->lk);
2751 ret = symlink(target, ref_path);
2755 fprintf(stderr, "no symlink - falling back to symbolic ref\n");
2760 static void update_symref_reflog(struct ref_lock *lock, const char *refname,
2761 const char *target, const char *logmsg)
2763 struct strbuf err = STRBUF_INIT;
2764 unsigned char new_sha1[20];
2765 if (logmsg && !read_ref(target, new_sha1) &&
2766 log_ref_write(refname, lock->old_oid.hash, new_sha1, logmsg, 0, &err)) {
2767 error("%s", err.buf);
2768 strbuf_release(&err);
2772 static int create_symref_locked(struct ref_lock *lock, const char *refname,
2773 const char *target, const char *logmsg)
2775 if (prefer_symlink_refs && !create_ref_symlink(lock, target)) {
2776 update_symref_reflog(lock, refname, target, logmsg);
2780 if (!fdopen_lock_file(lock->lk, "w"))
2781 return error("unable to fdopen %s: %s",
2782 lock->lk->tempfile.filename.buf, strerror(errno));
2784 update_symref_reflog(lock, refname, target, logmsg);
2786 /* no error check; commit_ref will check ferror */
2787 fprintf(lock->lk->tempfile.fp, "ref: %s\n", target);
2788 if (commit_ref(lock) < 0)
2789 return error("unable to write symref for %s: %s", refname,
2794 int create_symref(const char *refname, const char *target, const char *logmsg)
2796 struct strbuf err = STRBUF_INIT;
2797 struct ref_lock *lock;
2800 lock = lock_ref_sha1_basic(refname, NULL, NULL, NULL, REF_NODEREF, NULL,
2803 error("%s", err.buf);
2804 strbuf_release(&err);
2808 ret = create_symref_locked(lock, refname, target, logmsg);
2813 int reflog_exists(const char *refname)
2817 return !lstat(git_path("logs/%s", refname), &st) &&
2818 S_ISREG(st.st_mode);
2821 int delete_reflog(const char *refname)
2823 return remove_path(git_path("logs/%s", refname));
2826 static int show_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn, void *cb_data)
2828 unsigned char osha1[20], nsha1[20];
2829 char *email_end, *message;
2830 unsigned long timestamp;
2833 /* old SP new SP name <email> SP time TAB msg LF */
2834 if (sb->len < 83 || sb->buf[sb->len - 1] != '\n' ||
2835 get_sha1_hex(sb->buf, osha1) || sb->buf[40] != ' ' ||
2836 get_sha1_hex(sb->buf + 41, nsha1) || sb->buf[81] != ' ' ||
2837 !(email_end = strchr(sb->buf + 82, '>')) ||
2838 email_end[1] != ' ' ||
2839 !(timestamp = strtoul(email_end + 2, &message, 10)) ||
2840 !message || message[0] != ' ' ||
2841 (message[1] != '+' && message[1] != '-') ||
2842 !isdigit(message[2]) || !isdigit(message[3]) ||
2843 !isdigit(message[4]) || !isdigit(message[5]))
2844 return 0; /* corrupt? */
2845 email_end[1] = '\0';
2846 tz = strtol(message + 1, NULL, 10);
2847 if (message[6] != '\t')
2851 return fn(osha1, nsha1, sb->buf + 82, timestamp, tz, message, cb_data);
2854 static char *find_beginning_of_line(char *bob, char *scan)
2856 while (bob < scan && *(--scan) != '\n')
2857 ; /* keep scanning backwards */
2859 * Return either beginning of the buffer, or LF at the end of
2860 * the previous line.
2865 int for_each_reflog_ent_reverse(const char *refname, each_reflog_ent_fn fn, void *cb_data)
2867 struct strbuf sb = STRBUF_INIT;
2870 int ret = 0, at_tail = 1;
2872 logfp = fopen(git_path("logs/%s", refname), "r");
2876 /* Jump to the end */
2877 if (fseek(logfp, 0, SEEK_END) < 0)
2878 return error("cannot seek back reflog for %s: %s",
2879 refname, strerror(errno));
2881 while (!ret && 0 < pos) {
2887 /* Fill next block from the end */
2888 cnt = (sizeof(buf) < pos) ? sizeof(buf) : pos;
2889 if (fseek(logfp, pos - cnt, SEEK_SET))
2890 return error("cannot seek back reflog for %s: %s",
2891 refname, strerror(errno));
2892 nread = fread(buf, cnt, 1, logfp);
2894 return error("cannot read %d bytes from reflog for %s: %s",
2895 cnt, refname, strerror(errno));
2898 scanp = endp = buf + cnt;
2899 if (at_tail && scanp[-1] == '\n')
2900 /* Looking at the final LF at the end of the file */
2904 while (buf < scanp) {
2906 * terminating LF of the previous line, or the beginning
2911 bp = find_beginning_of_line(buf, scanp);
2915 * The newline is the end of the previous line,
2916 * so we know we have complete line starting
2917 * at (bp + 1). Prefix it onto any prior data
2918 * we collected for the line and process it.
2920 strbuf_splice(&sb, 0, 0, bp + 1, endp - (bp + 1));
2923 ret = show_one_reflog_ent(&sb, fn, cb_data);
2929 * We are at the start of the buffer, and the
2930 * start of the file; there is no previous
2931 * line, and we have everything for this one.
2932 * Process it, and we can end the loop.
2934 strbuf_splice(&sb, 0, 0, buf, endp - buf);
2935 ret = show_one_reflog_ent(&sb, fn, cb_data);
2942 * We are at the start of the buffer, and there
2943 * is more file to read backwards. Which means
2944 * we are in the middle of a line. Note that we
2945 * may get here even if *bp was a newline; that
2946 * just means we are at the exact end of the
2947 * previous line, rather than some spot in the
2950 * Save away what we have to be combined with
2951 * the data from the next read.
2953 strbuf_splice(&sb, 0, 0, buf, endp - buf);
2960 die("BUG: reverse reflog parser had leftover data");
2963 strbuf_release(&sb);
2967 int for_each_reflog_ent(const char *refname, each_reflog_ent_fn fn, void *cb_data)
2970 struct strbuf sb = STRBUF_INIT;
2973 logfp = fopen(git_path("logs/%s", refname), "r");
2977 while (!ret && !strbuf_getwholeline(&sb, logfp, '\n'))
2978 ret = show_one_reflog_ent(&sb, fn, cb_data);
2980 strbuf_release(&sb);
2984 * Call fn for each reflog in the namespace indicated by name. name
2985 * must be empty or end with '/'. Name will be used as a scratch
2986 * space, but its contents will be restored before return.
2988 static int do_for_each_reflog(struct strbuf *name, each_ref_fn fn, void *cb_data)
2990 DIR *d = opendir(git_path("logs/%s", name->buf));
2993 int oldlen = name->len;
2996 return name->len ? errno : 0;
2998 while ((de = readdir(d)) != NULL) {
3001 if (de->d_name[0] == '.')
3003 if (ends_with(de->d_name, ".lock"))
3005 strbuf_addstr(name, de->d_name);
3006 if (stat(git_path("logs/%s", name->buf), &st) < 0) {
3007 ; /* silently ignore */
3009 if (S_ISDIR(st.st_mode)) {
3010 strbuf_addch(name, '/');
3011 retval = do_for_each_reflog(name, fn, cb_data);
3013 struct object_id oid;
3015 if (read_ref_full(name->buf, 0, oid.hash, NULL))
3016 retval = error("bad ref for %s", name->buf);
3018 retval = fn(name->buf, &oid, 0, cb_data);
3023 strbuf_setlen(name, oldlen);
3029 int for_each_reflog(each_ref_fn fn, void *cb_data)
3033 strbuf_init(&name, PATH_MAX);
3034 retval = do_for_each_reflog(&name, fn, cb_data);
3035 strbuf_release(&name);
3039 static int ref_update_reject_duplicates(struct string_list *refnames,
3042 int i, n = refnames->nr;
3046 for (i = 1; i < n; i++)
3047 if (!strcmp(refnames->items[i - 1].string, refnames->items[i].string)) {
3049 "Multiple updates for ref '%s' not allowed.",
3050 refnames->items[i].string);
3056 int ref_transaction_commit(struct ref_transaction *transaction,
3060 int n = transaction->nr;
3061 struct ref_update **updates = transaction->updates;
3062 struct string_list refs_to_delete = STRING_LIST_INIT_NODUP;
3063 struct string_list_item *ref_to_delete;
3064 struct string_list affected_refnames = STRING_LIST_INIT_NODUP;
3068 if (transaction->state != REF_TRANSACTION_OPEN)
3069 die("BUG: commit called for transaction that is not open");
3072 transaction->state = REF_TRANSACTION_CLOSED;
3076 /* Fail if a refname appears more than once in the transaction: */
3077 for (i = 0; i < n; i++)
3078 string_list_append(&affected_refnames, updates[i]->refname);
3079 string_list_sort(&affected_refnames);
3080 if (ref_update_reject_duplicates(&affected_refnames, err)) {
3081 ret = TRANSACTION_GENERIC_ERROR;
3086 * Acquire all locks, verify old values if provided, check
3087 * that new values are valid, and write new values to the
3088 * lockfiles, ready to be activated. Only keep one lockfile
3089 * open at a time to avoid running out of file descriptors.
3091 for (i = 0; i < n; i++) {
3092 struct ref_update *update = updates[i];
3094 if ((update->flags & REF_HAVE_NEW) &&
3095 is_null_sha1(update->new_sha1))
3096 update->flags |= REF_DELETING;
3097 update->lock = lock_ref_sha1_basic(
3099 ((update->flags & REF_HAVE_OLD) ?
3100 update->old_sha1 : NULL),
3101 &affected_refnames, NULL,
3105 if (!update->lock) {
3108 ret = (errno == ENOTDIR)
3109 ? TRANSACTION_NAME_CONFLICT
3110 : TRANSACTION_GENERIC_ERROR;
3111 reason = strbuf_detach(err, NULL);
3112 strbuf_addf(err, "cannot lock ref '%s': %s",
3113 update->refname, reason);
3117 if ((update->flags & REF_HAVE_NEW) &&
3118 !(update->flags & REF_DELETING)) {
3119 int overwriting_symref = ((update->type & REF_ISSYMREF) &&
3120 (update->flags & REF_NODEREF));
3122 if (!overwriting_symref &&
3123 !hashcmp(update->lock->old_oid.hash, update->new_sha1)) {
3125 * The reference already has the desired
3126 * value, so we don't need to write it.
3128 } else if (write_ref_to_lockfile(update->lock,
3131 char *write_err = strbuf_detach(err, NULL);
3134 * The lock was freed upon failure of
3135 * write_ref_to_lockfile():
3137 update->lock = NULL;
3139 "cannot update the ref '%s': %s",
3140 update->refname, write_err);
3142 ret = TRANSACTION_GENERIC_ERROR;
3145 update->flags |= REF_NEEDS_COMMIT;
3148 if (!(update->flags & REF_NEEDS_COMMIT)) {
3150 * We didn't have to write anything to the lockfile.
3151 * Close it to free up the file descriptor:
3153 if (close_ref(update->lock)) {
3154 strbuf_addf(err, "Couldn't close %s.lock",
3161 /* Perform updates first so live commits remain referenced */
3162 for (i = 0; i < n; i++) {
3163 struct ref_update *update = updates[i];
3165 if (update->flags & REF_NEEDS_COMMIT) {
3166 if (commit_ref_update(update->lock,
3167 update->new_sha1, update->msg,
3168 update->flags, err)) {
3169 /* freed by commit_ref_update(): */
3170 update->lock = NULL;
3171 ret = TRANSACTION_GENERIC_ERROR;
3174 /* freed by commit_ref_update(): */
3175 update->lock = NULL;
3180 /* Perform deletes now that updates are safely completed */
3181 for (i = 0; i < n; i++) {
3182 struct ref_update *update = updates[i];
3184 if (update->flags & REF_DELETING) {
3185 if (delete_ref_loose(update->lock, update->type, err)) {
3186 ret = TRANSACTION_GENERIC_ERROR;
3190 if (!(update->flags & REF_ISPRUNING))
3191 string_list_append(&refs_to_delete,
3192 update->lock->ref_name);
3196 if (repack_without_refs(&refs_to_delete, err)) {
3197 ret = TRANSACTION_GENERIC_ERROR;
3200 for_each_string_list_item(ref_to_delete, &refs_to_delete)
3201 unlink_or_warn(git_path("logs/%s", ref_to_delete->string));
3202 clear_loose_ref_cache(&ref_cache);
3205 transaction->state = REF_TRANSACTION_CLOSED;
3207 for (i = 0; i < n; i++)
3208 if (updates[i]->lock)
3209 unlock_ref(updates[i]->lock);
3210 string_list_clear(&refs_to_delete, 0);
3211 string_list_clear(&affected_refnames, 0);
3215 static int ref_present(const char *refname,
3216 const struct object_id *oid, int flags, void *cb_data)
3218 struct string_list *affected_refnames = cb_data;
3220 return string_list_has_string(affected_refnames, refname);
3223 int initial_ref_transaction_commit(struct ref_transaction *transaction,
3227 int n = transaction->nr;
3228 struct ref_update **updates = transaction->updates;
3229 struct string_list affected_refnames = STRING_LIST_INIT_NODUP;
3233 if (transaction->state != REF_TRANSACTION_OPEN)
3234 die("BUG: commit called for transaction that is not open");
3236 /* Fail if a refname appears more than once in the transaction: */
3237 for (i = 0; i < n; i++)
3238 string_list_append(&affected_refnames, updates[i]->refname);
3239 string_list_sort(&affected_refnames);
3240 if (ref_update_reject_duplicates(&affected_refnames, err)) {
3241 ret = TRANSACTION_GENERIC_ERROR;
3246 * It's really undefined to call this function in an active
3247 * repository or when there are existing references: we are
3248 * only locking and changing packed-refs, so (1) any
3249 * simultaneous processes might try to change a reference at
3250 * the same time we do, and (2) any existing loose versions of
3251 * the references that we are setting would have precedence
3252 * over our values. But some remote helpers create the remote
3253 * "HEAD" and "master" branches before calling this function,
3254 * so here we really only check that none of the references
3255 * that we are creating already exists.
3257 if (for_each_rawref(ref_present, &affected_refnames))
3258 die("BUG: initial ref transaction called with existing refs");
3260 for (i = 0; i < n; i++) {
3261 struct ref_update *update = updates[i];
3263 if ((update->flags & REF_HAVE_OLD) &&
3264 !is_null_sha1(update->old_sha1))
3265 die("BUG: initial ref transaction with old_sha1 set");
3266 if (verify_refname_available(update->refname,
3267 &affected_refnames, NULL,
3269 ret = TRANSACTION_NAME_CONFLICT;
3274 if (lock_packed_refs(0)) {
3275 strbuf_addf(err, "unable to lock packed-refs file: %s",
3277 ret = TRANSACTION_GENERIC_ERROR;
3281 for (i = 0; i < n; i++) {
3282 struct ref_update *update = updates[i];
3284 if ((update->flags & REF_HAVE_NEW) &&
3285 !is_null_sha1(update->new_sha1))
3286 add_packed_ref(update->refname, update->new_sha1);
3289 if (commit_packed_refs()) {
3290 strbuf_addf(err, "unable to commit packed-refs file: %s",
3292 ret = TRANSACTION_GENERIC_ERROR;
3297 transaction->state = REF_TRANSACTION_CLOSED;
3298 string_list_clear(&affected_refnames, 0);
3302 struct expire_reflog_cb {
3304 reflog_expiry_should_prune_fn *should_prune_fn;
3307 unsigned char last_kept_sha1[20];
3310 static int expire_reflog_ent(unsigned char *osha1, unsigned char *nsha1,
3311 const char *email, unsigned long timestamp, int tz,
3312 const char *message, void *cb_data)
3314 struct expire_reflog_cb *cb = cb_data;
3315 struct expire_reflog_policy_cb *policy_cb = cb->policy_cb;
3317 if (cb->flags & EXPIRE_REFLOGS_REWRITE)
3318 osha1 = cb->last_kept_sha1;
3320 if ((*cb->should_prune_fn)(osha1, nsha1, email, timestamp, tz,
3321 message, policy_cb)) {
3323 printf("would prune %s", message);
3324 else if (cb->flags & EXPIRE_REFLOGS_VERBOSE)
3325 printf("prune %s", message);
3328 fprintf(cb->newlog, "%s %s %s %lu %+05d\t%s",
3329 sha1_to_hex(osha1), sha1_to_hex(nsha1),
3330 email, timestamp, tz, message);
3331 hashcpy(cb->last_kept_sha1, nsha1);
3333 if (cb->flags & EXPIRE_REFLOGS_VERBOSE)
3334 printf("keep %s", message);
3339 int reflog_expire(const char *refname, const unsigned char *sha1,
3341 reflog_expiry_prepare_fn prepare_fn,
3342 reflog_expiry_should_prune_fn should_prune_fn,
3343 reflog_expiry_cleanup_fn cleanup_fn,
3344 void *policy_cb_data)
3346 static struct lock_file reflog_lock;
3347 struct expire_reflog_cb cb;
3348 struct ref_lock *lock;
3352 struct strbuf err = STRBUF_INIT;
3354 memset(&cb, 0, sizeof(cb));
3356 cb.policy_cb = policy_cb_data;
3357 cb.should_prune_fn = should_prune_fn;
3360 * The reflog file is locked by holding the lock on the
3361 * reference itself, plus we might need to update the
3362 * reference if --updateref was specified:
3364 lock = lock_ref_sha1_basic(refname, sha1, NULL, NULL, 0, &type, &err);
3366 error("cannot lock ref '%s': %s", refname, err.buf);
3367 strbuf_release(&err);
3370 if (!reflog_exists(refname)) {
3375 log_file = git_pathdup("logs/%s", refname);
3376 if (!(flags & EXPIRE_REFLOGS_DRY_RUN)) {
3378 * Even though holding $GIT_DIR/logs/$reflog.lock has
3379 * no locking implications, we use the lock_file
3380 * machinery here anyway because it does a lot of the
3381 * work we need, including cleaning up if the program
3382 * exits unexpectedly.
3384 if (hold_lock_file_for_update(&reflog_lock, log_file, 0) < 0) {
3385 struct strbuf err = STRBUF_INIT;
3386 unable_to_lock_message(log_file, errno, &err);
3387 error("%s", err.buf);
3388 strbuf_release(&err);
3391 cb.newlog = fdopen_lock_file(&reflog_lock, "w");
3393 error("cannot fdopen %s (%s)",
3394 get_lock_file_path(&reflog_lock), strerror(errno));
3399 (*prepare_fn)(refname, sha1, cb.policy_cb);
3400 for_each_reflog_ent(refname, expire_reflog_ent, &cb);
3401 (*cleanup_fn)(cb.policy_cb);
3403 if (!(flags & EXPIRE_REFLOGS_DRY_RUN)) {
3405 * It doesn't make sense to adjust a reference pointed
3406 * to by a symbolic ref based on expiring entries in
3407 * the symbolic reference's reflog. Nor can we update
3408 * a reference if there are no remaining reflog
3411 int update = (flags & EXPIRE_REFLOGS_UPDATE_REF) &&
3412 !(type & REF_ISSYMREF) &&
3413 !is_null_sha1(cb.last_kept_sha1);
3415 if (close_lock_file(&reflog_lock)) {
3416 status |= error("couldn't write %s: %s", log_file,
3418 } else if (update &&
3419 (write_in_full(get_lock_file_fd(lock->lk),
3420 sha1_to_hex(cb.last_kept_sha1), 40) != 40 ||
3421 write_str_in_full(get_lock_file_fd(lock->lk), "\n") != 1 ||
3422 close_ref(lock) < 0)) {
3423 status |= error("couldn't write %s",
3424 get_lock_file_path(lock->lk));
3425 rollback_lock_file(&reflog_lock);
3426 } else if (commit_lock_file(&reflog_lock)) {
3427 status |= error("unable to write reflog '%s' (%s)",
3428 log_file, strerror(errno));
3429 } else if (update && commit_ref(lock)) {
3430 status |= error("couldn't set %s", lock->ref_name);
3438 rollback_lock_file(&reflog_lock);