3 #include "refs-internal.h"
4 #include "../lockfile.h"
11 struct object_id old_oid;
17 * Information used (along with the information in ref_entry) to
18 * describe a single cached reference. This data structure only
19 * occurs embedded in a union in struct ref_entry, and only when
20 * (ref_entry->flag & REF_DIR) is zero.
24 * The name of the object to which this reference resolves
25 * (which may be a tag object). If REF_ISBROKEN, this is
26 * null. If REF_ISSYMREF, then this is the name of the object
27 * referred to by the last reference in the symlink chain.
32 * If REF_KNOWS_PEELED, then this field holds the peeled value
33 * of this reference, or null if the reference is known not to
34 * be peelable. See the documentation for peel_ref() for an
35 * exact definition of "peelable".
37 struct object_id peeled;
43 * Information used (along with the information in ref_entry) to
44 * describe a level in the hierarchy of references. This data
45 * structure only occurs embedded in a union in struct ref_entry, and
46 * only when (ref_entry.flag & REF_DIR) is set. In that case,
47 * (ref_entry.flag & REF_INCOMPLETE) determines whether the references
48 * in the directory have already been read:
50 * (ref_entry.flag & REF_INCOMPLETE) unset -- a directory of loose
51 * or packed references, already read.
53 * (ref_entry.flag & REF_INCOMPLETE) set -- a directory of loose
54 * references that hasn't been read yet (nor has any of its
57 * Entries within a directory are stored within a growable array of
58 * pointers to ref_entries (entries, nr, alloc). Entries 0 <= i <
59 * sorted are sorted by their component name in strcmp() order and the
60 * remaining entries are unsorted.
62 * Loose references are read lazily, one directory at a time. When a
63 * directory of loose references is read, then all of the references
64 * in that directory are stored, and REF_INCOMPLETE stubs are created
65 * for any subdirectories, but the subdirectories themselves are not
66 * read. The reading is triggered by get_ref_dir().
72 * Entries with index 0 <= i < sorted are sorted by name. New
73 * entries are appended to the list unsorted, and are sorted
74 * only when required; thus we avoid the need to sort the list
75 * after the addition of every reference.
79 /* A pointer to the ref_cache that contains this ref_dir. */
80 struct ref_cache *ref_cache;
82 struct ref_entry **entries;
86 * Bit values for ref_entry::flag. REF_ISSYMREF=0x01,
87 * REF_ISPACKED=0x02, REF_ISBROKEN=0x04 and REF_BAD_NAME=0x08 are
88 * public values; see refs.h.
92 * The field ref_entry->u.value.peeled of this value entry contains
93 * the correct peeled value for the reference, which might be
94 * null_sha1 if the reference is not a tag or if it is broken.
96 #define REF_KNOWS_PEELED 0x10
98 /* ref_entry represents a directory of references */
102 * Entry has not yet been read from disk (used only for REF_DIR
103 * entries representing loose references)
105 #define REF_INCOMPLETE 0x40
108 * A ref_entry represents either a reference or a "subdirectory" of
111 * Each directory in the reference namespace is represented by a
112 * ref_entry with (flags & REF_DIR) set and containing a subdir member
113 * that holds the entries in that directory that have been read so
114 * far. If (flags & REF_INCOMPLETE) is set, then the directory and
115 * its subdirectories haven't been read yet. REF_INCOMPLETE is only
116 * used for loose reference directories.
118 * References are represented by a ref_entry with (flags & REF_DIR)
119 * unset and a value member that describes the reference's value. The
120 * flag member is at the ref_entry level, but it is also needed to
121 * interpret the contents of the value field (in other words, a
122 * ref_value object is not very much use without the enclosing
125 * Reference names cannot end with slash and directories' names are
126 * always stored with a trailing slash (except for the top-level
127 * directory, which is always denoted by ""). This has two nice
128 * consequences: (1) when the entries in each subdir are sorted
129 * lexicographically by name (as they usually are), the references in
130 * a whole tree can be generated in lexicographic order by traversing
131 * the tree in left-to-right, depth-first order; (2) the names of
132 * references and subdirectories cannot conflict, and therefore the
133 * presence of an empty subdirectory does not block the creation of a
134 * similarly-named reference. (The fact that reference names with the
135 * same leading components can conflict *with each other* is a
136 * separate issue that is regulated by verify_refname_available().)
138 * Please note that the name field contains the fully-qualified
139 * reference (or subdirectory) name. Space could be saved by only
140 * storing the relative names. But that would require the full names
141 * to be generated on the fly when iterating in do_for_each_ref(), and
142 * would break callback functions, who have always been able to assume
143 * that the name strings that they are passed will not be freed during
147 unsigned char flag; /* ISSYMREF? ISPACKED? */
149 struct ref_value value; /* if not (flags&REF_DIR) */
150 struct ref_dir subdir; /* if (flags&REF_DIR) */
153 * The full name of the reference (e.g., "refs/heads/master")
154 * or the full name of the directory with a trailing slash
155 * (e.g., "refs/heads/"):
157 char name[FLEX_ARRAY];
160 static void read_loose_refs(const char *dirname, struct ref_dir *dir);
161 static int search_ref_dir(struct ref_dir *dir, const char *refname, size_t len);
162 static struct ref_entry *create_dir_entry(struct ref_cache *ref_cache,
163 const char *dirname, size_t len,
165 static void add_entry_to_dir(struct ref_dir *dir, struct ref_entry *entry);
167 static struct ref_dir *get_ref_dir(struct ref_entry *entry)
170 assert(entry->flag & REF_DIR);
171 dir = &entry->u.subdir;
172 if (entry->flag & REF_INCOMPLETE) {
173 read_loose_refs(entry->name, dir);
176 * Manually add refs/bisect, which, being
177 * per-worktree, might not appear in the directory
178 * listing for refs/ in the main repo.
180 if (!strcmp(entry->name, "refs/")) {
181 int pos = search_ref_dir(dir, "refs/bisect/", 12);
183 struct ref_entry *child_entry;
184 child_entry = create_dir_entry(dir->ref_cache,
187 add_entry_to_dir(dir, child_entry);
188 read_loose_refs("refs/bisect",
189 &child_entry->u.subdir);
192 entry->flag &= ~REF_INCOMPLETE;
197 static struct ref_entry *create_ref_entry(const char *refname,
198 const unsigned char *sha1, int flag,
201 struct ref_entry *ref;
204 check_refname_format(refname, REFNAME_ALLOW_ONELEVEL))
205 die("Reference has invalid format: '%s'", refname);
206 FLEX_ALLOC_STR(ref, name, refname);
207 hashcpy(ref->u.value.oid.hash, sha1);
208 oidclr(&ref->u.value.peeled);
213 static void clear_ref_dir(struct ref_dir *dir);
215 static void free_ref_entry(struct ref_entry *entry)
217 if (entry->flag & REF_DIR) {
219 * Do not use get_ref_dir() here, as that might
220 * trigger the reading of loose refs.
222 clear_ref_dir(&entry->u.subdir);
228 * Add a ref_entry to the end of dir (unsorted). Entry is always
229 * stored directly in dir; no recursion into subdirectories is
232 static void add_entry_to_dir(struct ref_dir *dir, struct ref_entry *entry)
234 ALLOC_GROW(dir->entries, dir->nr + 1, dir->alloc);
235 dir->entries[dir->nr++] = entry;
236 /* optimize for the case that entries are added in order */
238 (dir->nr == dir->sorted + 1 &&
239 strcmp(dir->entries[dir->nr - 2]->name,
240 dir->entries[dir->nr - 1]->name) < 0))
241 dir->sorted = dir->nr;
245 * Clear and free all entries in dir, recursively.
247 static void clear_ref_dir(struct ref_dir *dir)
250 for (i = 0; i < dir->nr; i++)
251 free_ref_entry(dir->entries[i]);
253 dir->sorted = dir->nr = dir->alloc = 0;
258 * Create a struct ref_entry object for the specified dirname.
259 * dirname is the name of the directory with a trailing slash (e.g.,
260 * "refs/heads/") or "" for the top-level directory.
262 static struct ref_entry *create_dir_entry(struct ref_cache *ref_cache,
263 const char *dirname, size_t len,
266 struct ref_entry *direntry;
267 FLEX_ALLOC_MEM(direntry, name, dirname, len);
268 direntry->u.subdir.ref_cache = ref_cache;
269 direntry->flag = REF_DIR | (incomplete ? REF_INCOMPLETE : 0);
273 static int ref_entry_cmp(const void *a, const void *b)
275 struct ref_entry *one = *(struct ref_entry **)a;
276 struct ref_entry *two = *(struct ref_entry **)b;
277 return strcmp(one->name, two->name);
280 static void sort_ref_dir(struct ref_dir *dir);
282 struct string_slice {
287 static int ref_entry_cmp_sslice(const void *key_, const void *ent_)
289 const struct string_slice *key = key_;
290 const struct ref_entry *ent = *(const struct ref_entry * const *)ent_;
291 int cmp = strncmp(key->str, ent->name, key->len);
294 return '\0' - (unsigned char)ent->name[key->len];
298 * Return the index of the entry with the given refname from the
299 * ref_dir (non-recursively), sorting dir if necessary. Return -1 if
300 * no such entry is found. dir must already be complete.
302 static int search_ref_dir(struct ref_dir *dir, const char *refname, size_t len)
304 struct ref_entry **r;
305 struct string_slice key;
307 if (refname == NULL || !dir->nr)
313 r = bsearch(&key, dir->entries, dir->nr, sizeof(*dir->entries),
314 ref_entry_cmp_sslice);
319 return r - dir->entries;
323 * Search for a directory entry directly within dir (without
324 * recursing). Sort dir if necessary. subdirname must be a directory
325 * name (i.e., end in '/'). If mkdir is set, then create the
326 * directory if it is missing; otherwise, return NULL if the desired
327 * directory cannot be found. dir must already be complete.
329 static struct ref_dir *search_for_subdir(struct ref_dir *dir,
330 const char *subdirname, size_t len,
333 int entry_index = search_ref_dir(dir, subdirname, len);
334 struct ref_entry *entry;
335 if (entry_index == -1) {
339 * Since dir is complete, the absence of a subdir
340 * means that the subdir really doesn't exist;
341 * therefore, create an empty record for it but mark
342 * the record complete.
344 entry = create_dir_entry(dir->ref_cache, subdirname, len, 0);
345 add_entry_to_dir(dir, entry);
347 entry = dir->entries[entry_index];
349 return get_ref_dir(entry);
353 * If refname is a reference name, find the ref_dir within the dir
354 * tree that should hold refname. If refname is a directory name
355 * (i.e., ends in '/'), then return that ref_dir itself. dir must
356 * represent the top-level directory and must already be complete.
357 * Sort ref_dirs and recurse into subdirectories as necessary. If
358 * mkdir is set, then create any missing directories; otherwise,
359 * return NULL if the desired directory cannot be found.
361 static struct ref_dir *find_containing_dir(struct ref_dir *dir,
362 const char *refname, int mkdir)
365 for (slash = strchr(refname, '/'); slash; slash = strchr(slash + 1, '/')) {
366 size_t dirnamelen = slash - refname + 1;
367 struct ref_dir *subdir;
368 subdir = search_for_subdir(dir, refname, dirnamelen, mkdir);
380 * Find the value entry with the given name in dir, sorting ref_dirs
381 * and recursing into subdirectories as necessary. If the name is not
382 * found or it corresponds to a directory entry, return NULL.
384 static struct ref_entry *find_ref(struct ref_dir *dir, const char *refname)
387 struct ref_entry *entry;
388 dir = find_containing_dir(dir, refname, 0);
391 entry_index = search_ref_dir(dir, refname, strlen(refname));
392 if (entry_index == -1)
394 entry = dir->entries[entry_index];
395 return (entry->flag & REF_DIR) ? NULL : entry;
399 * Remove the entry with the given name from dir, recursing into
400 * subdirectories as necessary. If refname is the name of a directory
401 * (i.e., ends with '/'), then remove the directory and its contents.
402 * If the removal was successful, return the number of entries
403 * remaining in the directory entry that contained the deleted entry.
404 * If the name was not found, return -1. Please note that this
405 * function only deletes the entry from the cache; it does not delete
406 * it from the filesystem or ensure that other cache entries (which
407 * might be symbolic references to the removed entry) are updated.
408 * Nor does it remove any containing dir entries that might be made
409 * empty by the removal. dir must represent the top-level directory
410 * and must already be complete.
412 static int remove_entry(struct ref_dir *dir, const char *refname)
414 int refname_len = strlen(refname);
416 struct ref_entry *entry;
417 int is_dir = refname[refname_len - 1] == '/';
420 * refname represents a reference directory. Remove
421 * the trailing slash; otherwise we will get the
422 * directory *representing* refname rather than the
423 * one *containing* it.
425 char *dirname = xmemdupz(refname, refname_len - 1);
426 dir = find_containing_dir(dir, dirname, 0);
429 dir = find_containing_dir(dir, refname, 0);
433 entry_index = search_ref_dir(dir, refname, refname_len);
434 if (entry_index == -1)
436 entry = dir->entries[entry_index];
438 memmove(&dir->entries[entry_index],
439 &dir->entries[entry_index + 1],
440 (dir->nr - entry_index - 1) * sizeof(*dir->entries)
443 if (dir->sorted > entry_index)
445 free_ref_entry(entry);
450 * Add a ref_entry to the ref_dir (unsorted), recursing into
451 * subdirectories as necessary. dir must represent the top-level
452 * directory. Return 0 on success.
454 static int add_ref(struct ref_dir *dir, struct ref_entry *ref)
456 dir = find_containing_dir(dir, ref->name, 1);
459 add_entry_to_dir(dir, ref);
464 * Emit a warning and return true iff ref1 and ref2 have the same name
465 * and the same sha1. Die if they have the same name but different
468 static int is_dup_ref(const struct ref_entry *ref1, const struct ref_entry *ref2)
470 if (strcmp(ref1->name, ref2->name))
473 /* Duplicate name; make sure that they don't conflict: */
475 if ((ref1->flag & REF_DIR) || (ref2->flag & REF_DIR))
476 /* This is impossible by construction */
477 die("Reference directory conflict: %s", ref1->name);
479 if (oidcmp(&ref1->u.value.oid, &ref2->u.value.oid))
480 die("Duplicated ref, and SHA1s don't match: %s", ref1->name);
482 warning("Duplicated ref: %s", ref1->name);
487 * Sort the entries in dir non-recursively (if they are not already
488 * sorted) and remove any duplicate entries.
490 static void sort_ref_dir(struct ref_dir *dir)
493 struct ref_entry *last = NULL;
496 * This check also prevents passing a zero-length array to qsort(),
497 * which is a problem on some platforms.
499 if (dir->sorted == dir->nr)
502 qsort(dir->entries, dir->nr, sizeof(*dir->entries), ref_entry_cmp);
504 /* Remove any duplicates: */
505 for (i = 0, j = 0; j < dir->nr; j++) {
506 struct ref_entry *entry = dir->entries[j];
507 if (last && is_dup_ref(last, entry))
508 free_ref_entry(entry);
510 last = dir->entries[i++] = entry;
512 dir->sorted = dir->nr = i;
516 * Return true iff the reference described by entry can be resolved to
517 * an object in the database. Emit a warning if the referred-to
518 * object does not exist.
520 static int ref_resolves_to_object(struct ref_entry *entry)
522 if (entry->flag & REF_ISBROKEN)
524 if (!has_sha1_file(entry->u.value.oid.hash)) {
525 error("%s does not point to a valid object!", entry->name);
532 * current_ref is a performance hack: when iterating over references
533 * using the for_each_ref*() functions, current_ref is set to the
534 * current reference's entry before calling the callback function. If
535 * the callback function calls peel_ref(), then peel_ref() first
536 * checks whether the reference to be peeled is the current reference
537 * (it usually is) and if so, returns that reference's peeled version
538 * if it is available. This avoids a refname lookup in a common case.
540 static struct ref_entry *current_ref;
542 typedef int each_ref_entry_fn(struct ref_entry *entry, void *cb_data);
544 struct ref_entry_cb {
553 * Handle one reference in a do_for_each_ref*()-style iteration,
554 * calling an each_ref_fn for each entry.
556 static int do_one_ref(struct ref_entry *entry, void *cb_data)
558 struct ref_entry_cb *data = cb_data;
559 struct ref_entry *old_current_ref;
562 if (!starts_with(entry->name, data->base))
565 if (!(data->flags & DO_FOR_EACH_INCLUDE_BROKEN) &&
566 !ref_resolves_to_object(entry))
569 /* Store the old value, in case this is a recursive call: */
570 old_current_ref = current_ref;
572 retval = data->fn(entry->name + data->trim, &entry->u.value.oid,
573 entry->flag, data->cb_data);
574 current_ref = old_current_ref;
579 * Call fn for each reference in dir that has index in the range
580 * offset <= index < dir->nr. Recurse into subdirectories that are in
581 * that index range, sorting them before iterating. This function
582 * does not sort dir itself; it should be sorted beforehand. fn is
583 * called for all references, including broken ones.
585 static int do_for_each_entry_in_dir(struct ref_dir *dir, int offset,
586 each_ref_entry_fn fn, void *cb_data)
589 assert(dir->sorted == dir->nr);
590 for (i = offset; i < dir->nr; i++) {
591 struct ref_entry *entry = dir->entries[i];
593 if (entry->flag & REF_DIR) {
594 struct ref_dir *subdir = get_ref_dir(entry);
595 sort_ref_dir(subdir);
596 retval = do_for_each_entry_in_dir(subdir, 0, fn, cb_data);
598 retval = fn(entry, cb_data);
607 * Call fn for each reference in the union of dir1 and dir2, in order
608 * by refname. Recurse into subdirectories. If a value entry appears
609 * in both dir1 and dir2, then only process the version that is in
610 * dir2. The input dirs must already be sorted, but subdirs will be
611 * sorted as needed. fn is called for all references, including
614 static int do_for_each_entry_in_dirs(struct ref_dir *dir1,
615 struct ref_dir *dir2,
616 each_ref_entry_fn fn, void *cb_data)
621 assert(dir1->sorted == dir1->nr);
622 assert(dir2->sorted == dir2->nr);
624 struct ref_entry *e1, *e2;
626 if (i1 == dir1->nr) {
627 return do_for_each_entry_in_dir(dir2, i2, fn, cb_data);
629 if (i2 == dir2->nr) {
630 return do_for_each_entry_in_dir(dir1, i1, fn, cb_data);
632 e1 = dir1->entries[i1];
633 e2 = dir2->entries[i2];
634 cmp = strcmp(e1->name, e2->name);
636 if ((e1->flag & REF_DIR) && (e2->flag & REF_DIR)) {
637 /* Both are directories; descend them in parallel. */
638 struct ref_dir *subdir1 = get_ref_dir(e1);
639 struct ref_dir *subdir2 = get_ref_dir(e2);
640 sort_ref_dir(subdir1);
641 sort_ref_dir(subdir2);
642 retval = do_for_each_entry_in_dirs(
643 subdir1, subdir2, fn, cb_data);
646 } else if (!(e1->flag & REF_DIR) && !(e2->flag & REF_DIR)) {
647 /* Both are references; ignore the one from dir1. */
648 retval = fn(e2, cb_data);
652 die("conflict between reference and directory: %s",
664 if (e->flag & REF_DIR) {
665 struct ref_dir *subdir = get_ref_dir(e);
666 sort_ref_dir(subdir);
667 retval = do_for_each_entry_in_dir(
668 subdir, 0, fn, cb_data);
670 retval = fn(e, cb_data);
679 * Load all of the refs from the dir into our in-memory cache. The hard work
680 * of loading loose refs is done by get_ref_dir(), so we just need to recurse
681 * through all of the sub-directories. We do not even need to care about
682 * sorting, as traversal order does not matter to us.
684 static void prime_ref_dir(struct ref_dir *dir)
687 for (i = 0; i < dir->nr; i++) {
688 struct ref_entry *entry = dir->entries[i];
689 if (entry->flag & REF_DIR)
690 prime_ref_dir(get_ref_dir(entry));
694 struct nonmatching_ref_data {
695 const struct string_list *skip;
696 const char *conflicting_refname;
699 static int nonmatching_ref_fn(struct ref_entry *entry, void *vdata)
701 struct nonmatching_ref_data *data = vdata;
703 if (data->skip && string_list_has_string(data->skip, entry->name))
706 data->conflicting_refname = entry->name;
711 * Return 0 if a reference named refname could be created without
712 * conflicting with the name of an existing reference in dir.
713 * See verify_refname_available for more information.
715 static int verify_refname_available_dir(const char *refname,
716 const struct string_list *extras,
717 const struct string_list *skip,
722 const char *extra_refname;
724 struct strbuf dirname = STRBUF_INIT;
728 * For the sake of comments in this function, suppose that
729 * refname is "refs/foo/bar".
734 strbuf_grow(&dirname, strlen(refname) + 1);
735 for (slash = strchr(refname, '/'); slash; slash = strchr(slash + 1, '/')) {
736 /* Expand dirname to the new prefix, not including the trailing slash: */
737 strbuf_add(&dirname, refname + dirname.len, slash - refname - dirname.len);
740 * We are still at a leading dir of the refname (e.g.,
741 * "refs/foo"; if there is a reference with that name,
742 * it is a conflict, *unless* it is in skip.
745 pos = search_ref_dir(dir, dirname.buf, dirname.len);
747 (!skip || !string_list_has_string(skip, dirname.buf))) {
749 * We found a reference whose name is
750 * a proper prefix of refname; e.g.,
751 * "refs/foo", and is not in skip.
753 strbuf_addf(err, "'%s' exists; cannot create '%s'",
754 dirname.buf, refname);
759 if (extras && string_list_has_string(extras, dirname.buf) &&
760 (!skip || !string_list_has_string(skip, dirname.buf))) {
761 strbuf_addf(err, "cannot process '%s' and '%s' at the same time",
762 refname, dirname.buf);
767 * Otherwise, we can try to continue our search with
768 * the next component. So try to look up the
769 * directory, e.g., "refs/foo/". If we come up empty,
770 * we know there is nothing under this whole prefix,
771 * but even in that case we still have to continue the
772 * search for conflicts with extras.
774 strbuf_addch(&dirname, '/');
776 pos = search_ref_dir(dir, dirname.buf, dirname.len);
779 * There was no directory "refs/foo/",
780 * so there is nothing under this
781 * whole prefix. So there is no need
782 * to continue looking for conflicting
783 * references. But we need to continue
784 * looking for conflicting extras.
788 dir = get_ref_dir(dir->entries[pos]);
794 * We are at the leaf of our refname (e.g., "refs/foo/bar").
795 * There is no point in searching for a reference with that
796 * name, because a refname isn't considered to conflict with
797 * itself. But we still need to check for references whose
798 * names are in the "refs/foo/bar/" namespace, because they
801 strbuf_addstr(&dirname, refname + dirname.len);
802 strbuf_addch(&dirname, '/');
805 pos = search_ref_dir(dir, dirname.buf, dirname.len);
809 * We found a directory named "$refname/"
810 * (e.g., "refs/foo/bar/"). It is a problem
811 * iff it contains any ref that is not in
814 struct nonmatching_ref_data data;
817 data.conflicting_refname = NULL;
818 dir = get_ref_dir(dir->entries[pos]);
820 if (do_for_each_entry_in_dir(dir, 0, nonmatching_ref_fn, &data)) {
821 strbuf_addf(err, "'%s' exists; cannot create '%s'",
822 data.conflicting_refname, refname);
828 extra_refname = find_descendant_ref(dirname.buf, extras, skip);
830 strbuf_addf(err, "cannot process '%s' and '%s' at the same time",
831 refname, extra_refname);
836 strbuf_release(&dirname);
840 struct packed_ref_cache {
841 struct ref_entry *root;
844 * Count of references to the data structure in this instance,
845 * including the pointer from ref_cache::packed if any. The
846 * data will not be freed as long as the reference count is
849 unsigned int referrers;
852 * Iff the packed-refs file associated with this instance is
853 * currently locked for writing, this points at the associated
854 * lock (which is owned by somebody else). The referrer count
855 * is also incremented when the file is locked and decremented
856 * when it is unlocked.
858 struct lock_file *lock;
860 /* The metadata from when this packed-refs cache was read */
861 struct stat_validity validity;
865 * Future: need to be in "struct repository"
866 * when doing a full libification.
868 static struct ref_cache {
869 struct ref_cache *next;
870 struct ref_entry *loose;
871 struct packed_ref_cache *packed;
873 * The submodule name, or "" for the main repo. We allocate
874 * length 1 rather than FLEX_ARRAY so that the main ref_cache
875 * is initialized correctly.
878 } ref_cache, *submodule_ref_caches;
880 /* Lock used for the main packed-refs file: */
881 static struct lock_file packlock;
884 * Increment the reference count of *packed_refs.
886 static void acquire_packed_ref_cache(struct packed_ref_cache *packed_refs)
888 packed_refs->referrers++;
892 * Decrease the reference count of *packed_refs. If it goes to zero,
893 * free *packed_refs and return true; otherwise return false.
895 static int release_packed_ref_cache(struct packed_ref_cache *packed_refs)
897 if (!--packed_refs->referrers) {
898 free_ref_entry(packed_refs->root);
899 stat_validity_clear(&packed_refs->validity);
907 static void clear_packed_ref_cache(struct ref_cache *refs)
910 struct packed_ref_cache *packed_refs = refs->packed;
912 if (packed_refs->lock)
913 die("internal error: packed-ref cache cleared while locked");
915 release_packed_ref_cache(packed_refs);
919 static void clear_loose_ref_cache(struct ref_cache *refs)
922 free_ref_entry(refs->loose);
928 * Create a new submodule ref cache and add it to the internal
931 static struct ref_cache *create_ref_cache(const char *submodule)
933 struct ref_cache *refs;
936 FLEX_ALLOC_STR(refs, name, submodule);
937 refs->next = submodule_ref_caches;
938 submodule_ref_caches = refs;
942 static struct ref_cache *lookup_ref_cache(const char *submodule)
944 struct ref_cache *refs;
946 if (!submodule || !*submodule)
949 for (refs = submodule_ref_caches; refs; refs = refs->next)
950 if (!strcmp(submodule, refs->name))
956 * Return a pointer to a ref_cache for the specified submodule. For
957 * the main repository, use submodule==NULL. The returned structure
958 * will be allocated and initialized but not necessarily populated; it
959 * should not be freed.
961 static struct ref_cache *get_ref_cache(const char *submodule)
963 struct ref_cache *refs = lookup_ref_cache(submodule);
965 refs = create_ref_cache(submodule);
969 /* The length of a peeled reference line in packed-refs, including EOL: */
970 #define PEELED_LINE_LENGTH 42
973 * The packed-refs header line that we write out. Perhaps other
974 * traits will be added later. The trailing space is required.
976 static const char PACKED_REFS_HEADER[] =
977 "# pack-refs with: peeled fully-peeled \n";
980 * Parse one line from a packed-refs file. Write the SHA1 to sha1.
981 * Return a pointer to the refname within the line (null-terminated),
982 * or NULL if there was a problem.
984 static const char *parse_ref_line(struct strbuf *line, unsigned char *sha1)
989 * 42: the answer to everything.
991 * In this case, it happens to be the answer to
992 * 40 (length of sha1 hex representation)
993 * +1 (space in between hex and name)
994 * +1 (newline at the end of the line)
999 if (get_sha1_hex(line->buf, sha1) < 0)
1001 if (!isspace(line->buf[40]))
1004 ref = line->buf + 41;
1008 if (line->buf[line->len - 1] != '\n')
1010 line->buf[--line->len] = 0;
1016 * Read f, which is a packed-refs file, into dir.
1018 * A comment line of the form "# pack-refs with: " may contain zero or
1019 * more traits. We interpret the traits as follows:
1023 * Probably no references are peeled. But if the file contains a
1024 * peeled value for a reference, we will use it.
1028 * References under "refs/tags/", if they *can* be peeled, *are*
1029 * peeled in this file. References outside of "refs/tags/" are
1030 * probably not peeled even if they could have been, but if we find
1031 * a peeled value for such a reference we will use it.
1035 * All references in the file that can be peeled are peeled.
1036 * Inversely (and this is more important), any references in the
1037 * file for which no peeled value is recorded is not peelable. This
1038 * trait should typically be written alongside "peeled" for
1039 * compatibility with older clients, but we do not require it
1040 * (i.e., "peeled" is a no-op if "fully-peeled" is set).
1042 static void read_packed_refs(FILE *f, struct ref_dir *dir)
1044 struct ref_entry *last = NULL;
1045 struct strbuf line = STRBUF_INIT;
1046 enum { PEELED_NONE, PEELED_TAGS, PEELED_FULLY } peeled = PEELED_NONE;
1048 while (strbuf_getwholeline(&line, f, '\n') != EOF) {
1049 unsigned char sha1[20];
1050 const char *refname;
1053 if (skip_prefix(line.buf, "# pack-refs with:", &traits)) {
1054 if (strstr(traits, " fully-peeled "))
1055 peeled = PEELED_FULLY;
1056 else if (strstr(traits, " peeled "))
1057 peeled = PEELED_TAGS;
1058 /* perhaps other traits later as well */
1062 refname = parse_ref_line(&line, sha1);
1064 int flag = REF_ISPACKED;
1066 if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {
1067 if (!refname_is_safe(refname))
1068 die("packed refname is dangerous: %s", refname);
1070 flag |= REF_BAD_NAME | REF_ISBROKEN;
1072 last = create_ref_entry(refname, sha1, flag, 0);
1073 if (peeled == PEELED_FULLY ||
1074 (peeled == PEELED_TAGS && starts_with(refname, "refs/tags/")))
1075 last->flag |= REF_KNOWS_PEELED;
1080 line.buf[0] == '^' &&
1081 line.len == PEELED_LINE_LENGTH &&
1082 line.buf[PEELED_LINE_LENGTH - 1] == '\n' &&
1083 !get_sha1_hex(line.buf + 1, sha1)) {
1084 hashcpy(last->u.value.peeled.hash, sha1);
1086 * Regardless of what the file header said,
1087 * we definitely know the value of *this*
1090 last->flag |= REF_KNOWS_PEELED;
1094 strbuf_release(&line);
1098 * Get the packed_ref_cache for the specified ref_cache, creating it
1101 static struct packed_ref_cache *get_packed_ref_cache(struct ref_cache *refs)
1103 char *packed_refs_file;
1106 packed_refs_file = git_pathdup_submodule(refs->name, "packed-refs");
1108 packed_refs_file = git_pathdup("packed-refs");
1111 !stat_validity_check(&refs->packed->validity, packed_refs_file))
1112 clear_packed_ref_cache(refs);
1114 if (!refs->packed) {
1117 refs->packed = xcalloc(1, sizeof(*refs->packed));
1118 acquire_packed_ref_cache(refs->packed);
1119 refs->packed->root = create_dir_entry(refs, "", 0, 0);
1120 f = fopen(packed_refs_file, "r");
1122 stat_validity_update(&refs->packed->validity, fileno(f));
1123 read_packed_refs(f, get_ref_dir(refs->packed->root));
1127 free(packed_refs_file);
1128 return refs->packed;
1131 static struct ref_dir *get_packed_ref_dir(struct packed_ref_cache *packed_ref_cache)
1133 return get_ref_dir(packed_ref_cache->root);
1136 static struct ref_dir *get_packed_refs(struct ref_cache *refs)
1138 return get_packed_ref_dir(get_packed_ref_cache(refs));
1142 * Add a reference to the in-memory packed reference cache. This may
1143 * only be called while the packed-refs file is locked (see
1144 * lock_packed_refs()). To actually write the packed-refs file, call
1145 * commit_packed_refs().
1147 static void add_packed_ref(const char *refname, const unsigned char *sha1)
1149 struct packed_ref_cache *packed_ref_cache =
1150 get_packed_ref_cache(&ref_cache);
1152 if (!packed_ref_cache->lock)
1153 die("internal error: packed refs not locked");
1154 add_ref(get_packed_ref_dir(packed_ref_cache),
1155 create_ref_entry(refname, sha1, REF_ISPACKED, 1));
1159 * Read the loose references from the namespace dirname into dir
1160 * (without recursing). dirname must end with '/'. dir must be the
1161 * directory entry corresponding to dirname.
1163 static void read_loose_refs(const char *dirname, struct ref_dir *dir)
1165 struct ref_cache *refs = dir->ref_cache;
1168 int dirnamelen = strlen(dirname);
1169 struct strbuf refname;
1170 struct strbuf path = STRBUF_INIT;
1171 size_t path_baselen;
1174 strbuf_git_path_submodule(&path, refs->name, "%s", dirname);
1176 strbuf_git_path(&path, "%s", dirname);
1177 path_baselen = path.len;
1179 d = opendir(path.buf);
1181 strbuf_release(&path);
1185 strbuf_init(&refname, dirnamelen + 257);
1186 strbuf_add(&refname, dirname, dirnamelen);
1188 while ((de = readdir(d)) != NULL) {
1189 unsigned char sha1[20];
1193 if (de->d_name[0] == '.')
1195 if (ends_with(de->d_name, ".lock"))
1197 strbuf_addstr(&refname, de->d_name);
1198 strbuf_addstr(&path, de->d_name);
1199 if (stat(path.buf, &st) < 0) {
1200 ; /* silently ignore */
1201 } else if (S_ISDIR(st.st_mode)) {
1202 strbuf_addch(&refname, '/');
1203 add_entry_to_dir(dir,
1204 create_dir_entry(refs, refname.buf,
1212 read_ok = !resolve_gitlink_ref(refs->name,
1215 read_ok = !read_ref_full(refname.buf,
1216 RESOLVE_REF_READING,
1222 flag |= REF_ISBROKEN;
1223 } else if (is_null_sha1(sha1)) {
1225 * It is so astronomically unlikely
1226 * that NULL_SHA1 is the SHA-1 of an
1227 * actual object that we consider its
1228 * appearance in a loose reference
1229 * file to be repo corruption
1230 * (probably due to a software bug).
1232 flag |= REF_ISBROKEN;
1235 if (check_refname_format(refname.buf,
1236 REFNAME_ALLOW_ONELEVEL)) {
1237 if (!refname_is_safe(refname.buf))
1238 die("loose refname is dangerous: %s", refname.buf);
1240 flag |= REF_BAD_NAME | REF_ISBROKEN;
1242 add_entry_to_dir(dir,
1243 create_ref_entry(refname.buf, sha1, flag, 0));
1245 strbuf_setlen(&refname, dirnamelen);
1246 strbuf_setlen(&path, path_baselen);
1248 strbuf_release(&refname);
1249 strbuf_release(&path);
1253 static struct ref_dir *get_loose_refs(struct ref_cache *refs)
1257 * Mark the top-level directory complete because we
1258 * are about to read the only subdirectory that can
1261 refs->loose = create_dir_entry(refs, "", 0, 0);
1263 * Create an incomplete entry for "refs/":
1265 add_entry_to_dir(get_ref_dir(refs->loose),
1266 create_dir_entry(refs, "refs/", 5, 1));
1268 return get_ref_dir(refs->loose);
1271 #define MAXREFLEN (1024)
1274 * Called by resolve_gitlink_ref_recursive() after it failed to read
1275 * from the loose refs in ref_cache refs. Find <refname> in the
1276 * packed-refs file for the submodule.
1278 static int resolve_gitlink_packed_ref(struct ref_cache *refs,
1279 const char *refname, unsigned char *sha1)
1281 struct ref_entry *ref;
1282 struct ref_dir *dir = get_packed_refs(refs);
1284 ref = find_ref(dir, refname);
1288 hashcpy(sha1, ref->u.value.oid.hash);
1292 static int resolve_gitlink_ref_recursive(struct ref_cache *refs,
1293 const char *refname, unsigned char *sha1,
1297 char buffer[128], *p;
1300 if (recursion > SYMREF_MAXDEPTH || strlen(refname) > MAXREFLEN)
1303 ? git_pathdup_submodule(refs->name, "%s", refname)
1304 : git_pathdup("%s", refname);
1305 fd = open(path, O_RDONLY);
1308 return resolve_gitlink_packed_ref(refs, refname, sha1);
1310 len = read(fd, buffer, sizeof(buffer)-1);
1314 while (len && isspace(buffer[len-1]))
1318 /* Was it a detached head or an old-fashioned symlink? */
1319 if (!get_sha1_hex(buffer, sha1))
1323 if (strncmp(buffer, "ref:", 4))
1329 return resolve_gitlink_ref_recursive(refs, p, sha1, recursion+1);
1332 int resolve_gitlink_ref(const char *path, const char *refname, unsigned char *sha1)
1334 int len = strlen(path), retval;
1335 struct strbuf submodule = STRBUF_INIT;
1336 struct ref_cache *refs;
1338 while (len && path[len-1] == '/')
1343 strbuf_add(&submodule, path, len);
1344 refs = lookup_ref_cache(submodule.buf);
1346 if (!is_nonbare_repository_dir(&submodule)) {
1347 strbuf_release(&submodule);
1350 refs = create_ref_cache(submodule.buf);
1352 strbuf_release(&submodule);
1354 retval = resolve_gitlink_ref_recursive(refs, refname, sha1, 0);
1359 * Return the ref_entry for the given refname from the packed
1360 * references. If it does not exist, return NULL.
1362 static struct ref_entry *get_packed_ref(const char *refname)
1364 return find_ref(get_packed_refs(&ref_cache), refname);
1368 * A loose ref file doesn't exist; check for a packed ref.
1370 static int resolve_missing_loose_ref(const char *refname,
1371 unsigned char *sha1,
1372 unsigned int *flags)
1374 struct ref_entry *entry;
1377 * The loose reference file does not exist; check for a packed
1380 entry = get_packed_ref(refname);
1382 hashcpy(sha1, entry->u.value.oid.hash);
1383 *flags |= REF_ISPACKED;
1386 /* refname is not a packed reference. */
1390 int read_raw_ref(const char *refname, unsigned char *sha1,
1391 struct strbuf *referent, unsigned int *type)
1393 struct strbuf sb_contents = STRBUF_INIT;
1394 struct strbuf sb_path = STRBUF_INIT;
1403 strbuf_reset(&sb_path);
1404 strbuf_git_path(&sb_path, "%s", refname);
1409 * We might have to loop back here to avoid a race
1410 * condition: first we lstat() the file, then we try
1411 * to read it as a link or as a file. But if somebody
1412 * changes the type of the file (file <-> directory
1413 * <-> symlink) between the lstat() and reading, then
1414 * we don't want to report that as an error but rather
1415 * try again starting with the lstat().
1418 if (lstat(path, &st) < 0) {
1419 if (errno != ENOENT)
1421 if (resolve_missing_loose_ref(refname, sha1, type)) {
1429 /* Follow "normalized" - ie "refs/.." symlinks by hand */
1430 if (S_ISLNK(st.st_mode)) {
1431 strbuf_reset(&sb_contents);
1432 if (strbuf_readlink(&sb_contents, path, 0) < 0) {
1433 if (errno == ENOENT || errno == EINVAL)
1434 /* inconsistent with lstat; retry */
1439 if (starts_with(sb_contents.buf, "refs/") &&
1440 !check_refname_format(sb_contents.buf, 0)) {
1441 strbuf_swap(&sb_contents, referent);
1442 *type |= REF_ISSYMREF;
1448 /* Is it a directory? */
1449 if (S_ISDIR(st.st_mode)) {
1451 * Even though there is a directory where the loose
1452 * ref is supposed to be, there could still be a
1455 if (resolve_missing_loose_ref(refname, sha1, type)) {
1464 * Anything else, just open it and try to use it as
1467 fd = open(path, O_RDONLY);
1469 if (errno == ENOENT)
1470 /* inconsistent with lstat; retry */
1475 strbuf_reset(&sb_contents);
1476 if (strbuf_read(&sb_contents, fd, 256) < 0) {
1477 int save_errno = errno;
1483 strbuf_rtrim(&sb_contents);
1484 buf = sb_contents.buf;
1485 if (starts_with(buf, "ref:")) {
1487 while (isspace(*buf))
1490 strbuf_reset(referent);
1491 strbuf_addstr(referent, buf);
1492 *type |= REF_ISSYMREF;
1498 * Please note that FETCH_HEAD has additional
1499 * data after the sha.
1501 if (get_sha1_hex(buf, sha1) ||
1502 (buf[40] != '\0' && !isspace(buf[40]))) {
1503 *type |= REF_ISBROKEN;
1512 strbuf_release(&sb_path);
1513 strbuf_release(&sb_contents);
1518 static void unlock_ref(struct ref_lock *lock)
1520 /* Do not free lock->lk -- atexit() still looks at them */
1522 rollback_lock_file(lock->lk);
1523 free(lock->ref_name);
1528 * Lock refname, without following symrefs, and set *lock_p to point
1529 * at a newly-allocated lock object. Fill in lock->old_oid, referent,
1530 * and type similarly to read_raw_ref().
1532 * The caller must verify that refname is a "safe" reference name (in
1533 * the sense of refname_is_safe()) before calling this function.
1535 * If the reference doesn't already exist, verify that refname doesn't
1536 * have a D/F conflict with any existing references. extras and skip
1537 * are passed to verify_refname_available_dir() for this check.
1539 * If mustexist is not set and the reference is not found or is
1540 * broken, lock the reference anyway but clear sha1.
1542 * Return 0 on success. On failure, write an error message to err and
1543 * return TRANSACTION_NAME_CONFLICT or TRANSACTION_GENERIC_ERROR.
1545 * Implementation note: This function is basically
1550 * but it includes a lot more code to
1551 * - Deal with possible races with other processes
1552 * - Avoid calling verify_refname_available_dir() when it can be
1553 * avoided, namely if we were successfully able to read the ref
1554 * - Generate informative error messages in the case of failure
1556 static int lock_raw_ref(const char *refname, int mustexist,
1557 const struct string_list *extras,
1558 const struct string_list *skip,
1559 struct ref_lock **lock_p,
1560 struct strbuf *referent,
1564 struct ref_lock *lock;
1565 struct strbuf ref_file = STRBUF_INIT;
1566 int attempts_remaining = 3;
1567 int ret = TRANSACTION_GENERIC_ERROR;
1572 /* First lock the file so it can't change out from under us. */
1574 *lock_p = lock = xcalloc(1, sizeof(*lock));
1576 lock->ref_name = xstrdup(refname);
1577 strbuf_git_path(&ref_file, "%s", refname);
1580 switch (safe_create_leading_directories(ref_file.buf)) {
1582 break; /* success */
1585 * Suppose refname is "refs/foo/bar". We just failed
1586 * to create the containing directory, "refs/foo",
1587 * because there was a non-directory in the way. This
1588 * indicates a D/F conflict, probably because of
1589 * another reference such as "refs/foo". There is no
1590 * reason to expect this error to be transitory.
1592 if (verify_refname_available(refname, extras, skip, err)) {
1595 * To the user the relevant error is
1596 * that the "mustexist" reference is
1600 strbuf_addf(err, "unable to resolve reference '%s'",
1604 * The error message set by
1605 * verify_refname_available_dir() is OK.
1607 ret = TRANSACTION_NAME_CONFLICT;
1611 * The file that is in the way isn't a loose
1612 * reference. Report it as a low-level
1615 strbuf_addf(err, "unable to create lock file %s.lock; "
1616 "non-directory in the way",
1621 /* Maybe another process was tidying up. Try again. */
1622 if (--attempts_remaining > 0)
1626 strbuf_addf(err, "unable to create directory for %s",
1632 lock->lk = xcalloc(1, sizeof(struct lock_file));
1634 if (hold_lock_file_for_update(lock->lk, ref_file.buf, LOCK_NO_DEREF) < 0) {
1635 if (errno == ENOENT && --attempts_remaining > 0) {
1637 * Maybe somebody just deleted one of the
1638 * directories leading to ref_file. Try
1643 unable_to_lock_message(ref_file.buf, errno, err);
1649 * Now we hold the lock and can read the reference without
1650 * fear that its value will change.
1653 if (read_raw_ref(refname, lock->old_oid.hash, referent, type)) {
1654 if (errno == ENOENT) {
1656 /* Garden variety missing reference. */
1657 strbuf_addf(err, "unable to resolve reference '%s'",
1662 * Reference is missing, but that's OK. We
1663 * know that there is not a conflict with
1664 * another loose reference because
1665 * (supposing that we are trying to lock
1666 * reference "refs/foo/bar"):
1668 * - We were successfully able to create
1669 * the lockfile refs/foo/bar.lock, so we
1670 * know there cannot be a loose reference
1673 * - We got ENOENT and not EISDIR, so we
1674 * know that there cannot be a loose
1675 * reference named "refs/foo/bar/baz".
1678 } else if (errno == EISDIR) {
1680 * There is a directory in the way. It might have
1681 * contained references that have been deleted. If
1682 * we don't require that the reference already
1683 * exists, try to remove the directory so that it
1684 * doesn't cause trouble when we want to rename the
1685 * lockfile into place later.
1688 /* Garden variety missing reference. */
1689 strbuf_addf(err, "unable to resolve reference '%s'",
1692 } else if (remove_dir_recursively(&ref_file,
1693 REMOVE_DIR_EMPTY_ONLY)) {
1694 if (verify_refname_available_dir(
1695 refname, extras, skip,
1696 get_loose_refs(&ref_cache),
1699 * The error message set by
1700 * verify_refname_available() is OK.
1702 ret = TRANSACTION_NAME_CONFLICT;
1706 * We can't delete the directory,
1707 * but we also don't know of any
1708 * references that it should
1711 strbuf_addf(err, "there is a non-empty directory '%s' "
1712 "blocking reference '%s'",
1713 ref_file.buf, refname);
1717 } else if (errno == EINVAL && (*type & REF_ISBROKEN)) {
1718 strbuf_addf(err, "unable to resolve reference '%s': "
1719 "reference broken", refname);
1722 strbuf_addf(err, "unable to resolve reference '%s': %s",
1723 refname, strerror(errno));
1728 * If the ref did not exist and we are creating it,
1729 * make sure there is no existing packed ref whose
1730 * name begins with our refname, nor a packed ref
1731 * whose name is a proper prefix of our refname.
1733 if (verify_refname_available_dir(
1734 refname, extras, skip,
1735 get_packed_refs(&ref_cache),
1749 strbuf_release(&ref_file);
1754 * Peel the entry (if possible) and return its new peel_status. If
1755 * repeel is true, re-peel the entry even if there is an old peeled
1756 * value that is already stored in it.
1758 * It is OK to call this function with a packed reference entry that
1759 * might be stale and might even refer to an object that has since
1760 * been garbage-collected. In such a case, if the entry has
1761 * REF_KNOWS_PEELED then leave the status unchanged and return
1762 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.
1764 static enum peel_status peel_entry(struct ref_entry *entry, int repeel)
1766 enum peel_status status;
1768 if (entry->flag & REF_KNOWS_PEELED) {
1770 entry->flag &= ~REF_KNOWS_PEELED;
1771 oidclr(&entry->u.value.peeled);
1773 return is_null_oid(&entry->u.value.peeled) ?
1774 PEEL_NON_TAG : PEEL_PEELED;
1777 if (entry->flag & REF_ISBROKEN)
1779 if (entry->flag & REF_ISSYMREF)
1780 return PEEL_IS_SYMREF;
1782 status = peel_object(entry->u.value.oid.hash, entry->u.value.peeled.hash);
1783 if (status == PEEL_PEELED || status == PEEL_NON_TAG)
1784 entry->flag |= REF_KNOWS_PEELED;
1788 int peel_ref(const char *refname, unsigned char *sha1)
1791 unsigned char base[20];
1793 if (current_ref && (current_ref->name == refname
1794 || !strcmp(current_ref->name, refname))) {
1795 if (peel_entry(current_ref, 0))
1797 hashcpy(sha1, current_ref->u.value.peeled.hash);
1801 if (read_ref_full(refname, RESOLVE_REF_READING, base, &flag))
1805 * If the reference is packed, read its ref_entry from the
1806 * cache in the hope that we already know its peeled value.
1807 * We only try this optimization on packed references because
1808 * (a) forcing the filling of the loose reference cache could
1809 * be expensive and (b) loose references anyway usually do not
1810 * have REF_KNOWS_PEELED.
1812 if (flag & REF_ISPACKED) {
1813 struct ref_entry *r = get_packed_ref(refname);
1815 if (peel_entry(r, 0))
1817 hashcpy(sha1, r->u.value.peeled.hash);
1822 return peel_object(base, sha1);
1826 * Call fn for each reference in the specified ref_cache, omitting
1827 * references not in the containing_dir of base. fn is called for all
1828 * references, including broken ones. If fn ever returns a non-zero
1829 * value, stop the iteration and return that value; otherwise, return
1832 static int do_for_each_entry(struct ref_cache *refs, const char *base,
1833 each_ref_entry_fn fn, void *cb_data)
1835 struct packed_ref_cache *packed_ref_cache;
1836 struct ref_dir *loose_dir;
1837 struct ref_dir *packed_dir;
1841 * We must make sure that all loose refs are read before accessing the
1842 * packed-refs file; this avoids a race condition in which loose refs
1843 * are migrated to the packed-refs file by a simultaneous process, but
1844 * our in-memory view is from before the migration. get_packed_ref_cache()
1845 * takes care of making sure our view is up to date with what is on
1848 loose_dir = get_loose_refs(refs);
1849 if (base && *base) {
1850 loose_dir = find_containing_dir(loose_dir, base, 0);
1853 prime_ref_dir(loose_dir);
1855 packed_ref_cache = get_packed_ref_cache(refs);
1856 acquire_packed_ref_cache(packed_ref_cache);
1857 packed_dir = get_packed_ref_dir(packed_ref_cache);
1858 if (base && *base) {
1859 packed_dir = find_containing_dir(packed_dir, base, 0);
1862 if (packed_dir && loose_dir) {
1863 sort_ref_dir(packed_dir);
1864 sort_ref_dir(loose_dir);
1865 retval = do_for_each_entry_in_dirs(
1866 packed_dir, loose_dir, fn, cb_data);
1867 } else if (packed_dir) {
1868 sort_ref_dir(packed_dir);
1869 retval = do_for_each_entry_in_dir(
1870 packed_dir, 0, fn, cb_data);
1871 } else if (loose_dir) {
1872 sort_ref_dir(loose_dir);
1873 retval = do_for_each_entry_in_dir(
1874 loose_dir, 0, fn, cb_data);
1877 release_packed_ref_cache(packed_ref_cache);
1882 * Call fn for each reference in the specified ref_cache for which the
1883 * refname begins with base. If trim is non-zero, then trim that many
1884 * characters off the beginning of each refname before passing the
1885 * refname to fn. flags can be DO_FOR_EACH_INCLUDE_BROKEN to include
1886 * broken references in the iteration. If fn ever returns a non-zero
1887 * value, stop the iteration and return that value; otherwise, return
1890 int do_for_each_ref(const char *submodule, const char *base,
1891 each_ref_fn fn, int trim, int flags, void *cb_data)
1893 struct ref_entry_cb data;
1894 struct ref_cache *refs;
1896 refs = get_ref_cache(submodule);
1901 data.cb_data = cb_data;
1903 if (ref_paranoia < 0)
1904 ref_paranoia = git_env_bool("GIT_REF_PARANOIA", 0);
1906 data.flags |= DO_FOR_EACH_INCLUDE_BROKEN;
1908 return do_for_each_entry(refs, base, do_one_ref, &data);
1912 * Verify that the reference locked by lock has the value old_sha1.
1913 * Fail if the reference doesn't exist and mustexist is set. Return 0
1914 * on success. On error, write an error message to err, set errno, and
1915 * return a negative value.
1917 static int verify_lock(struct ref_lock *lock,
1918 const unsigned char *old_sha1, int mustexist,
1923 if (read_ref_full(lock->ref_name,
1924 mustexist ? RESOLVE_REF_READING : 0,
1925 lock->old_oid.hash, NULL)) {
1927 int save_errno = errno;
1928 strbuf_addf(err, "can't verify ref '%s'", lock->ref_name);
1932 hashclr(lock->old_oid.hash);
1936 if (old_sha1 && hashcmp(lock->old_oid.hash, old_sha1)) {
1937 strbuf_addf(err, "ref '%s' is at %s but expected %s",
1939 sha1_to_hex(lock->old_oid.hash),
1940 sha1_to_hex(old_sha1));
1947 static int remove_empty_directories(struct strbuf *path)
1950 * we want to create a file but there is a directory there;
1951 * if that is an empty directory (or a directory that contains
1952 * only empty directories), remove them.
1954 return remove_dir_recursively(path, REMOVE_DIR_EMPTY_ONLY);
1958 * Locks a ref returning the lock on success and NULL on failure.
1959 * On failure errno is set to something meaningful.
1961 static struct ref_lock *lock_ref_sha1_basic(const char *refname,
1962 const unsigned char *old_sha1,
1963 const struct string_list *extras,
1964 const struct string_list *skip,
1965 unsigned int flags, int *type,
1968 struct strbuf ref_file = STRBUF_INIT;
1969 struct ref_lock *lock;
1971 int lflags = LOCK_NO_DEREF;
1972 int mustexist = (old_sha1 && !is_null_sha1(old_sha1));
1973 int resolve_flags = RESOLVE_REF_NO_RECURSE;
1974 int attempts_remaining = 3;
1979 lock = xcalloc(1, sizeof(struct ref_lock));
1982 resolve_flags |= RESOLVE_REF_READING;
1983 if (flags & REF_DELETING)
1984 resolve_flags |= RESOLVE_REF_ALLOW_BAD_NAME;
1986 strbuf_git_path(&ref_file, "%s", refname);
1987 resolved = !!resolve_ref_unsafe(refname, resolve_flags,
1988 lock->old_oid.hash, type);
1989 if (!resolved && errno == EISDIR) {
1991 * we are trying to lock foo but we used to
1992 * have foo/bar which now does not exist;
1993 * it is normal for the empty directory 'foo'
1996 if (remove_empty_directories(&ref_file)) {
1998 if (!verify_refname_available_dir(refname, extras, skip,
1999 get_loose_refs(&ref_cache), err))
2000 strbuf_addf(err, "there are still refs under '%s'",
2004 resolved = !!resolve_ref_unsafe(refname, resolve_flags,
2005 lock->old_oid.hash, type);
2009 if (last_errno != ENOTDIR ||
2010 !verify_refname_available_dir(refname, extras, skip,
2011 get_loose_refs(&ref_cache), err))
2012 strbuf_addf(err, "unable to resolve reference '%s': %s",
2013 refname, strerror(last_errno));
2019 * If the ref did not exist and we are creating it, make sure
2020 * there is no existing packed ref whose name begins with our
2021 * refname, nor a packed ref whose name is a proper prefix of
2024 if (is_null_oid(&lock->old_oid) &&
2025 verify_refname_available_dir(refname, extras, skip,
2026 get_packed_refs(&ref_cache), err)) {
2027 last_errno = ENOTDIR;
2031 lock->lk = xcalloc(1, sizeof(struct lock_file));
2033 lock->ref_name = xstrdup(refname);
2036 switch (safe_create_leading_directories_const(ref_file.buf)) {
2038 break; /* success */
2040 if (--attempts_remaining > 0)
2045 strbuf_addf(err, "unable to create directory for '%s'",
2050 if (hold_lock_file_for_update(lock->lk, ref_file.buf, lflags) < 0) {
2052 if (errno == ENOENT && --attempts_remaining > 0)
2054 * Maybe somebody just deleted one of the
2055 * directories leading to ref_file. Try
2060 unable_to_lock_message(ref_file.buf, errno, err);
2064 if (verify_lock(lock, old_sha1, mustexist, err)) {
2075 strbuf_release(&ref_file);
2081 * Write an entry to the packed-refs file for the specified refname.
2082 * If peeled is non-NULL, write it as the entry's peeled value.
2084 static void write_packed_entry(FILE *fh, char *refname, unsigned char *sha1,
2085 unsigned char *peeled)
2087 fprintf_or_die(fh, "%s %s\n", sha1_to_hex(sha1), refname);
2089 fprintf_or_die(fh, "^%s\n", sha1_to_hex(peeled));
2093 * An each_ref_entry_fn that writes the entry to a packed-refs file.
2095 static int write_packed_entry_fn(struct ref_entry *entry, void *cb_data)
2097 enum peel_status peel_status = peel_entry(entry, 0);
2099 if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)
2100 error("internal error: %s is not a valid packed reference!",
2102 write_packed_entry(cb_data, entry->name, entry->u.value.oid.hash,
2103 peel_status == PEEL_PEELED ?
2104 entry->u.value.peeled.hash : NULL);
2109 * Lock the packed-refs file for writing. Flags is passed to
2110 * hold_lock_file_for_update(). Return 0 on success. On errors, set
2111 * errno appropriately and return a nonzero value.
2113 static int lock_packed_refs(int flags)
2115 static int timeout_configured = 0;
2116 static int timeout_value = 1000;
2118 struct packed_ref_cache *packed_ref_cache;
2120 if (!timeout_configured) {
2121 git_config_get_int("core.packedrefstimeout", &timeout_value);
2122 timeout_configured = 1;
2125 if (hold_lock_file_for_update_timeout(
2126 &packlock, git_path("packed-refs"),
2127 flags, timeout_value) < 0)
2130 * Get the current packed-refs while holding the lock. If the
2131 * packed-refs file has been modified since we last read it,
2132 * this will automatically invalidate the cache and re-read
2133 * the packed-refs file.
2135 packed_ref_cache = get_packed_ref_cache(&ref_cache);
2136 packed_ref_cache->lock = &packlock;
2137 /* Increment the reference count to prevent it from being freed: */
2138 acquire_packed_ref_cache(packed_ref_cache);
2143 * Write the current version of the packed refs cache from memory to
2144 * disk. The packed-refs file must already be locked for writing (see
2145 * lock_packed_refs()). Return zero on success. On errors, set errno
2146 * and return a nonzero value
2148 static int commit_packed_refs(void)
2150 struct packed_ref_cache *packed_ref_cache =
2151 get_packed_ref_cache(&ref_cache);
2156 if (!packed_ref_cache->lock)
2157 die("internal error: packed-refs not locked");
2159 out = fdopen_lock_file(packed_ref_cache->lock, "w");
2161 die_errno("unable to fdopen packed-refs descriptor");
2163 fprintf_or_die(out, "%s", PACKED_REFS_HEADER);
2164 do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache),
2165 0, write_packed_entry_fn, out);
2167 if (commit_lock_file(packed_ref_cache->lock)) {
2171 packed_ref_cache->lock = NULL;
2172 release_packed_ref_cache(packed_ref_cache);
2178 * Rollback the lockfile for the packed-refs file, and discard the
2179 * in-memory packed reference cache. (The packed-refs file will be
2180 * read anew if it is needed again after this function is called.)
2182 static void rollback_packed_refs(void)
2184 struct packed_ref_cache *packed_ref_cache =
2185 get_packed_ref_cache(&ref_cache);
2187 if (!packed_ref_cache->lock)
2188 die("internal error: packed-refs not locked");
2189 rollback_lock_file(packed_ref_cache->lock);
2190 packed_ref_cache->lock = NULL;
2191 release_packed_ref_cache(packed_ref_cache);
2192 clear_packed_ref_cache(&ref_cache);
2195 struct ref_to_prune {
2196 struct ref_to_prune *next;
2197 unsigned char sha1[20];
2198 char name[FLEX_ARRAY];
2201 struct pack_refs_cb_data {
2203 struct ref_dir *packed_refs;
2204 struct ref_to_prune *ref_to_prune;
2208 * An each_ref_entry_fn that is run over loose references only. If
2209 * the loose reference can be packed, add an entry in the packed ref
2210 * cache. If the reference should be pruned, also add it to
2211 * ref_to_prune in the pack_refs_cb_data.
2213 static int pack_if_possible_fn(struct ref_entry *entry, void *cb_data)
2215 struct pack_refs_cb_data *cb = cb_data;
2216 enum peel_status peel_status;
2217 struct ref_entry *packed_entry;
2218 int is_tag_ref = starts_with(entry->name, "refs/tags/");
2220 /* Do not pack per-worktree refs: */
2221 if (ref_type(entry->name) != REF_TYPE_NORMAL)
2224 /* ALWAYS pack tags */
2225 if (!(cb->flags & PACK_REFS_ALL) && !is_tag_ref)
2228 /* Do not pack symbolic or broken refs: */
2229 if ((entry->flag & REF_ISSYMREF) || !ref_resolves_to_object(entry))
2232 /* Add a packed ref cache entry equivalent to the loose entry. */
2233 peel_status = peel_entry(entry, 1);
2234 if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)
2235 die("internal error peeling reference %s (%s)",
2236 entry->name, oid_to_hex(&entry->u.value.oid));
2237 packed_entry = find_ref(cb->packed_refs, entry->name);
2239 /* Overwrite existing packed entry with info from loose entry */
2240 packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED;
2241 oidcpy(&packed_entry->u.value.oid, &entry->u.value.oid);
2243 packed_entry = create_ref_entry(entry->name, entry->u.value.oid.hash,
2244 REF_ISPACKED | REF_KNOWS_PEELED, 0);
2245 add_ref(cb->packed_refs, packed_entry);
2247 oidcpy(&packed_entry->u.value.peeled, &entry->u.value.peeled);
2249 /* Schedule the loose reference for pruning if requested. */
2250 if ((cb->flags & PACK_REFS_PRUNE)) {
2251 struct ref_to_prune *n;
2252 FLEX_ALLOC_STR(n, name, entry->name);
2253 hashcpy(n->sha1, entry->u.value.oid.hash);
2254 n->next = cb->ref_to_prune;
2255 cb->ref_to_prune = n;
2261 * Remove empty parents, but spare refs/ and immediate subdirs.
2262 * Note: munges *name.
2264 static void try_remove_empty_parents(char *name)
2269 for (i = 0; i < 2; i++) { /* refs/{heads,tags,...}/ */
2270 while (*p && *p != '/')
2272 /* tolerate duplicate slashes; see check_refname_format() */
2276 for (q = p; *q; q++)
2279 while (q > p && *q != '/')
2281 while (q > p && *(q-1) == '/')
2286 if (rmdir(git_path("%s", name)))
2291 /* make sure nobody touched the ref, and unlink */
2292 static void prune_ref(struct ref_to_prune *r)
2294 struct ref_transaction *transaction;
2295 struct strbuf err = STRBUF_INIT;
2297 if (check_refname_format(r->name, 0))
2300 transaction = ref_transaction_begin(&err);
2302 ref_transaction_delete(transaction, r->name, r->sha1,
2303 REF_ISPRUNING | REF_NODEREF, NULL, &err) ||
2304 ref_transaction_commit(transaction, &err)) {
2305 ref_transaction_free(transaction);
2306 error("%s", err.buf);
2307 strbuf_release(&err);
2310 ref_transaction_free(transaction);
2311 strbuf_release(&err);
2312 try_remove_empty_parents(r->name);
2315 static void prune_refs(struct ref_to_prune *r)
2323 int pack_refs(unsigned int flags)
2325 struct pack_refs_cb_data cbdata;
2327 memset(&cbdata, 0, sizeof(cbdata));
2328 cbdata.flags = flags;
2330 lock_packed_refs(LOCK_DIE_ON_ERROR);
2331 cbdata.packed_refs = get_packed_refs(&ref_cache);
2333 do_for_each_entry_in_dir(get_loose_refs(&ref_cache), 0,
2334 pack_if_possible_fn, &cbdata);
2336 if (commit_packed_refs())
2337 die_errno("unable to overwrite old ref-pack file");
2339 prune_refs(cbdata.ref_to_prune);
2344 * Rewrite the packed-refs file, omitting any refs listed in
2345 * 'refnames'. On error, leave packed-refs unchanged, write an error
2346 * message to 'err', and return a nonzero value.
2348 * The refs in 'refnames' needn't be sorted. `err` must not be NULL.
2350 static int repack_without_refs(struct string_list *refnames, struct strbuf *err)
2352 struct ref_dir *packed;
2353 struct string_list_item *refname;
2354 int ret, needs_repacking = 0, removed = 0;
2358 /* Look for a packed ref */
2359 for_each_string_list_item(refname, refnames) {
2360 if (get_packed_ref(refname->string)) {
2361 needs_repacking = 1;
2366 /* Avoid locking if we have nothing to do */
2367 if (!needs_repacking)
2368 return 0; /* no refname exists in packed refs */
2370 if (lock_packed_refs(0)) {
2371 unable_to_lock_message(git_path("packed-refs"), errno, err);
2374 packed = get_packed_refs(&ref_cache);
2376 /* Remove refnames from the cache */
2377 for_each_string_list_item(refname, refnames)
2378 if (remove_entry(packed, refname->string) != -1)
2382 * All packed entries disappeared while we were
2383 * acquiring the lock.
2385 rollback_packed_refs();
2389 /* Write what remains */
2390 ret = commit_packed_refs();
2392 strbuf_addf(err, "unable to overwrite old ref-pack file: %s",
2397 static int delete_ref_loose(struct ref_lock *lock, int flag, struct strbuf *err)
2401 if (!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) {
2403 * loose. The loose file name is the same as the
2404 * lockfile name, minus ".lock":
2406 char *loose_filename = get_locked_file_path(lock->lk);
2407 int res = unlink_or_msg(loose_filename, err);
2408 free(loose_filename);
2415 int delete_refs(struct string_list *refnames)
2417 struct strbuf err = STRBUF_INIT;
2423 result = repack_without_refs(refnames, &err);
2426 * If we failed to rewrite the packed-refs file, then
2427 * it is unsafe to try to remove loose refs, because
2428 * doing so might expose an obsolete packed value for
2429 * a reference that might even point at an object that
2430 * has been garbage collected.
2432 if (refnames->nr == 1)
2433 error(_("could not delete reference %s: %s"),
2434 refnames->items[0].string, err.buf);
2436 error(_("could not delete references: %s"), err.buf);
2441 for (i = 0; i < refnames->nr; i++) {
2442 const char *refname = refnames->items[i].string;
2444 if (delete_ref(refname, NULL, 0))
2445 result |= error(_("could not remove reference %s"), refname);
2449 strbuf_release(&err);
2454 * People using contrib's git-new-workdir have .git/logs/refs ->
2455 * /some/other/path/.git/logs/refs, and that may live on another device.
2457 * IOW, to avoid cross device rename errors, the temporary renamed log must
2458 * live into logs/refs.
2460 #define TMP_RENAMED_LOG "logs/refs/.tmp-renamed-log"
2462 static int rename_tmp_log(const char *newrefname)
2464 int attempts_remaining = 4;
2465 struct strbuf path = STRBUF_INIT;
2469 strbuf_reset(&path);
2470 strbuf_git_path(&path, "logs/%s", newrefname);
2471 switch (safe_create_leading_directories_const(path.buf)) {
2473 break; /* success */
2475 if (--attempts_remaining > 0)
2479 error("unable to create directory for %s", newrefname);
2483 if (rename(git_path(TMP_RENAMED_LOG), path.buf)) {
2484 if ((errno==EISDIR || errno==ENOTDIR) && --attempts_remaining > 0) {
2486 * rename(a, b) when b is an existing
2487 * directory ought to result in ISDIR, but
2488 * Solaris 5.8 gives ENOTDIR. Sheesh.
2490 if (remove_empty_directories(&path)) {
2491 error("Directory not empty: logs/%s", newrefname);
2495 } else if (errno == ENOENT && --attempts_remaining > 0) {
2497 * Maybe another process just deleted one of
2498 * the directories in the path to newrefname.
2499 * Try again from the beginning.
2503 error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s: %s",
2504 newrefname, strerror(errno));
2510 strbuf_release(&path);
2514 int verify_refname_available(const char *newname,
2515 const struct string_list *extras,
2516 const struct string_list *skip,
2519 struct ref_dir *packed_refs = get_packed_refs(&ref_cache);
2520 struct ref_dir *loose_refs = get_loose_refs(&ref_cache);
2522 if (verify_refname_available_dir(newname, extras, skip,
2523 packed_refs, err) ||
2524 verify_refname_available_dir(newname, extras, skip,
2531 static int write_ref_to_lockfile(struct ref_lock *lock,
2532 const unsigned char *sha1, struct strbuf *err);
2533 static int commit_ref_update(struct ref_lock *lock,
2534 const unsigned char *sha1, const char *logmsg,
2535 struct strbuf *err);
2537 int rename_ref(const char *oldrefname, const char *newrefname, const char *logmsg)
2539 unsigned char sha1[20], orig_sha1[20];
2540 int flag = 0, logmoved = 0;
2541 struct ref_lock *lock;
2542 struct stat loginfo;
2543 int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);
2544 struct strbuf err = STRBUF_INIT;
2546 if (log && S_ISLNK(loginfo.st_mode))
2547 return error("reflog for %s is a symlink", oldrefname);
2549 if (!resolve_ref_unsafe(oldrefname, RESOLVE_REF_READING | RESOLVE_REF_NO_RECURSE,
2551 return error("refname %s not found", oldrefname);
2553 if (flag & REF_ISSYMREF)
2554 return error("refname %s is a symbolic ref, renaming it is not supported",
2556 if (!rename_ref_available(oldrefname, newrefname))
2559 if (log && rename(git_path("logs/%s", oldrefname), git_path(TMP_RENAMED_LOG)))
2560 return error("unable to move logfile logs/%s to "TMP_RENAMED_LOG": %s",
2561 oldrefname, strerror(errno));
2563 if (delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {
2564 error("unable to delete old %s", oldrefname);
2569 * Since we are doing a shallow lookup, sha1 is not the
2570 * correct value to pass to delete_ref as old_sha1. But that
2571 * doesn't matter, because an old_sha1 check wouldn't add to
2572 * the safety anyway; we want to delete the reference whatever
2573 * its current value.
2575 if (!read_ref_full(newrefname, RESOLVE_REF_READING | RESOLVE_REF_NO_RECURSE,
2577 delete_ref(newrefname, NULL, REF_NODEREF)) {
2578 if (errno==EISDIR) {
2579 struct strbuf path = STRBUF_INIT;
2582 strbuf_git_path(&path, "%s", newrefname);
2583 result = remove_empty_directories(&path);
2584 strbuf_release(&path);
2587 error("Directory not empty: %s", newrefname);
2591 error("unable to delete existing %s", newrefname);
2596 if (log && rename_tmp_log(newrefname))
2601 lock = lock_ref_sha1_basic(newrefname, NULL, NULL, NULL, REF_NODEREF,
2604 error("unable to rename '%s' to '%s': %s", oldrefname, newrefname, err.buf);
2605 strbuf_release(&err);
2608 hashcpy(lock->old_oid.hash, orig_sha1);
2610 if (write_ref_to_lockfile(lock, orig_sha1, &err) ||
2611 commit_ref_update(lock, orig_sha1, logmsg, &err)) {
2612 error("unable to write current sha1 into %s: %s", newrefname, err.buf);
2613 strbuf_release(&err);
2620 lock = lock_ref_sha1_basic(oldrefname, NULL, NULL, NULL, REF_NODEREF,
2623 error("unable to lock %s for rollback: %s", oldrefname, err.buf);
2624 strbuf_release(&err);
2628 flag = log_all_ref_updates;
2629 log_all_ref_updates = 0;
2630 if (write_ref_to_lockfile(lock, orig_sha1, &err) ||
2631 commit_ref_update(lock, orig_sha1, NULL, &err)) {
2632 error("unable to write current sha1 into %s: %s", oldrefname, err.buf);
2633 strbuf_release(&err);
2635 log_all_ref_updates = flag;
2638 if (logmoved && rename(git_path("logs/%s", newrefname), git_path("logs/%s", oldrefname)))
2639 error("unable to restore logfile %s from %s: %s",
2640 oldrefname, newrefname, strerror(errno));
2641 if (!logmoved && log &&
2642 rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", oldrefname)))
2643 error("unable to restore logfile %s from "TMP_RENAMED_LOG": %s",
2644 oldrefname, strerror(errno));
2649 static int close_ref(struct ref_lock *lock)
2651 if (close_lock_file(lock->lk))
2656 static int commit_ref(struct ref_lock *lock)
2658 char *path = get_locked_file_path(lock->lk);
2661 if (!lstat(path, &st) && S_ISDIR(st.st_mode)) {
2663 * There is a directory at the path we want to rename
2664 * the lockfile to. Hopefully it is empty; try to
2667 size_t len = strlen(path);
2668 struct strbuf sb_path = STRBUF_INIT;
2670 strbuf_attach(&sb_path, path, len, len);
2673 * If this fails, commit_lock_file() will also fail
2674 * and will report the problem.
2676 remove_empty_directories(&sb_path);
2677 strbuf_release(&sb_path);
2682 if (commit_lock_file(lock->lk))
2688 * Create a reflog for a ref. If force_create = 0, the reflog will
2689 * only be created for certain refs (those for which
2690 * should_autocreate_reflog returns non-zero. Otherwise, create it
2691 * regardless of the ref name. Fill in *err and return -1 on failure.
2693 static int log_ref_setup(const char *refname, struct strbuf *logfile, struct strbuf *err, int force_create)
2695 int logfd, oflags = O_APPEND | O_WRONLY;
2697 strbuf_git_path(logfile, "logs/%s", refname);
2698 if (force_create || should_autocreate_reflog(refname)) {
2699 if (safe_create_leading_directories(logfile->buf) < 0) {
2700 strbuf_addf(err, "unable to create directory for '%s': "
2701 "%s", logfile->buf, strerror(errno));
2707 logfd = open(logfile->buf, oflags, 0666);
2709 if (!(oflags & O_CREAT) && (errno == ENOENT || errno == EISDIR))
2712 if (errno == EISDIR) {
2713 if (remove_empty_directories(logfile)) {
2714 strbuf_addf(err, "there are still logs under "
2715 "'%s'", logfile->buf);
2718 logfd = open(logfile->buf, oflags, 0666);
2722 strbuf_addf(err, "unable to append to '%s': %s",
2723 logfile->buf, strerror(errno));
2728 adjust_shared_perm(logfile->buf);
2734 int safe_create_reflog(const char *refname, int force_create, struct strbuf *err)
2737 struct strbuf sb = STRBUF_INIT;
2739 ret = log_ref_setup(refname, &sb, err, force_create);
2740 strbuf_release(&sb);
2744 static int log_ref_write_fd(int fd, const unsigned char *old_sha1,
2745 const unsigned char *new_sha1,
2746 const char *committer, const char *msg)
2748 int msglen, written;
2749 unsigned maxlen, len;
2752 msglen = msg ? strlen(msg) : 0;
2753 maxlen = strlen(committer) + msglen + 100;
2754 logrec = xmalloc(maxlen);
2755 len = xsnprintf(logrec, maxlen, "%s %s %s\n",
2756 sha1_to_hex(old_sha1),
2757 sha1_to_hex(new_sha1),
2760 len += copy_reflog_msg(logrec + len - 1, msg) - 1;
2762 written = len <= maxlen ? write_in_full(fd, logrec, len) : -1;
2770 static int log_ref_write_1(const char *refname, const unsigned char *old_sha1,
2771 const unsigned char *new_sha1, const char *msg,
2772 struct strbuf *logfile, int flags,
2775 int logfd, result, oflags = O_APPEND | O_WRONLY;
2777 if (log_all_ref_updates < 0)
2778 log_all_ref_updates = !is_bare_repository();
2780 result = log_ref_setup(refname, logfile, err, flags & REF_FORCE_CREATE_REFLOG);
2785 logfd = open(logfile->buf, oflags);
2788 result = log_ref_write_fd(logfd, old_sha1, new_sha1,
2789 git_committer_info(0), msg);
2791 strbuf_addf(err, "unable to append to '%s': %s", logfile->buf,
2797 strbuf_addf(err, "unable to append to '%s': %s", logfile->buf,
2804 static int log_ref_write(const char *refname, const unsigned char *old_sha1,
2805 const unsigned char *new_sha1, const char *msg,
2806 int flags, struct strbuf *err)
2808 return files_log_ref_write(refname, old_sha1, new_sha1, msg, flags,
2812 int files_log_ref_write(const char *refname, const unsigned char *old_sha1,
2813 const unsigned char *new_sha1, const char *msg,
2814 int flags, struct strbuf *err)
2816 struct strbuf sb = STRBUF_INIT;
2817 int ret = log_ref_write_1(refname, old_sha1, new_sha1, msg, &sb, flags,
2819 strbuf_release(&sb);
2824 * Write sha1 into the open lockfile, then close the lockfile. On
2825 * errors, rollback the lockfile, fill in *err and
2828 static int write_ref_to_lockfile(struct ref_lock *lock,
2829 const unsigned char *sha1, struct strbuf *err)
2831 static char term = '\n';
2835 o = parse_object(sha1);
2838 "trying to write ref '%s' with nonexistent object %s",
2839 lock->ref_name, sha1_to_hex(sha1));
2843 if (o->type != OBJ_COMMIT && is_branch(lock->ref_name)) {
2845 "trying to write non-commit object %s to branch '%s'",
2846 sha1_to_hex(sha1), lock->ref_name);
2850 fd = get_lock_file_fd(lock->lk);
2851 if (write_in_full(fd, sha1_to_hex(sha1), 40) != 40 ||
2852 write_in_full(fd, &term, 1) != 1 ||
2853 close_ref(lock) < 0) {
2855 "couldn't write '%s'", get_lock_file_path(lock->lk));
2863 * Commit a change to a loose reference that has already been written
2864 * to the loose reference lockfile. Also update the reflogs if
2865 * necessary, using the specified lockmsg (which can be NULL).
2867 static int commit_ref_update(struct ref_lock *lock,
2868 const unsigned char *sha1, const char *logmsg,
2871 clear_loose_ref_cache(&ref_cache);
2872 if (log_ref_write(lock->ref_name, lock->old_oid.hash, sha1, logmsg, 0, err)) {
2873 char *old_msg = strbuf_detach(err, NULL);
2874 strbuf_addf(err, "cannot update the ref '%s': %s",
2875 lock->ref_name, old_msg);
2881 if (strcmp(lock->ref_name, "HEAD") != 0) {
2883 * Special hack: If a branch is updated directly and HEAD
2884 * points to it (may happen on the remote side of a push
2885 * for example) then logically the HEAD reflog should be
2887 * A generic solution implies reverse symref information,
2888 * but finding all symrefs pointing to the given branch
2889 * would be rather costly for this rare event (the direct
2890 * update of a branch) to be worth it. So let's cheat and
2891 * check with HEAD only which should cover 99% of all usage
2892 * scenarios (even 100% of the default ones).
2894 unsigned char head_sha1[20];
2896 const char *head_ref;
2898 head_ref = resolve_ref_unsafe("HEAD", RESOLVE_REF_READING,
2899 head_sha1, &head_flag);
2900 if (head_ref && (head_flag & REF_ISSYMREF) &&
2901 !strcmp(head_ref, lock->ref_name)) {
2902 struct strbuf log_err = STRBUF_INIT;
2903 if (log_ref_write("HEAD", lock->old_oid.hash, sha1,
2904 logmsg, 0, &log_err)) {
2905 error("%s", log_err.buf);
2906 strbuf_release(&log_err);
2911 if (commit_ref(lock)) {
2912 strbuf_addf(err, "couldn't set '%s'", lock->ref_name);
2921 static int create_ref_symlink(struct ref_lock *lock, const char *target)
2924 #ifndef NO_SYMLINK_HEAD
2925 char *ref_path = get_locked_file_path(lock->lk);
2927 ret = symlink(target, ref_path);
2931 fprintf(stderr, "no symlink - falling back to symbolic ref\n");
2936 static void update_symref_reflog(struct ref_lock *lock, const char *refname,
2937 const char *target, const char *logmsg)
2939 struct strbuf err = STRBUF_INIT;
2940 unsigned char new_sha1[20];
2941 if (logmsg && !read_ref(target, new_sha1) &&
2942 log_ref_write(refname, lock->old_oid.hash, new_sha1, logmsg, 0, &err)) {
2943 error("%s", err.buf);
2944 strbuf_release(&err);
2948 static int create_symref_locked(struct ref_lock *lock, const char *refname,
2949 const char *target, const char *logmsg)
2951 if (prefer_symlink_refs && !create_ref_symlink(lock, target)) {
2952 update_symref_reflog(lock, refname, target, logmsg);
2956 if (!fdopen_lock_file(lock->lk, "w"))
2957 return error("unable to fdopen %s: %s",
2958 lock->lk->tempfile.filename.buf, strerror(errno));
2960 update_symref_reflog(lock, refname, target, logmsg);
2962 /* no error check; commit_ref will check ferror */
2963 fprintf(lock->lk->tempfile.fp, "ref: %s\n", target);
2964 if (commit_ref(lock) < 0)
2965 return error("unable to write symref for %s: %s", refname,
2970 int create_symref(const char *refname, const char *target, const char *logmsg)
2972 struct strbuf err = STRBUF_INIT;
2973 struct ref_lock *lock;
2976 lock = lock_ref_sha1_basic(refname, NULL, NULL, NULL, REF_NODEREF, NULL,
2979 error("%s", err.buf);
2980 strbuf_release(&err);
2984 ret = create_symref_locked(lock, refname, target, logmsg);
2989 int set_worktree_head_symref(const char *gitdir, const char *target)
2991 static struct lock_file head_lock;
2992 struct ref_lock *lock;
2993 struct strbuf head_path = STRBUF_INIT;
2994 const char *head_rel;
2997 strbuf_addf(&head_path, "%s/HEAD", absolute_path(gitdir));
2998 if (hold_lock_file_for_update(&head_lock, head_path.buf,
2999 LOCK_NO_DEREF) < 0) {
3000 struct strbuf err = STRBUF_INIT;
3001 unable_to_lock_message(head_path.buf, errno, &err);
3002 error("%s", err.buf);
3003 strbuf_release(&err);
3004 strbuf_release(&head_path);
3008 /* head_rel will be "HEAD" for the main tree, "worktrees/wt/HEAD" for
3010 head_rel = remove_leading_path(head_path.buf,
3011 absolute_path(get_git_common_dir()));
3012 /* to make use of create_symref_locked(), initialize ref_lock */
3013 lock = xcalloc(1, sizeof(struct ref_lock));
3014 lock->lk = &head_lock;
3015 lock->ref_name = xstrdup(head_rel);
3017 ret = create_symref_locked(lock, head_rel, target, NULL);
3019 unlock_ref(lock); /* will free lock */
3020 strbuf_release(&head_path);
3024 int reflog_exists(const char *refname)
3028 return !lstat(git_path("logs/%s", refname), &st) &&
3029 S_ISREG(st.st_mode);
3032 int delete_reflog(const char *refname)
3034 return remove_path(git_path("logs/%s", refname));
3037 static int show_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn, void *cb_data)
3039 unsigned char osha1[20], nsha1[20];
3040 char *email_end, *message;
3041 unsigned long timestamp;
3044 /* old SP new SP name <email> SP time TAB msg LF */
3045 if (sb->len < 83 || sb->buf[sb->len - 1] != '\n' ||
3046 get_sha1_hex(sb->buf, osha1) || sb->buf[40] != ' ' ||
3047 get_sha1_hex(sb->buf + 41, nsha1) || sb->buf[81] != ' ' ||
3048 !(email_end = strchr(sb->buf + 82, '>')) ||
3049 email_end[1] != ' ' ||
3050 !(timestamp = strtoul(email_end + 2, &message, 10)) ||
3051 !message || message[0] != ' ' ||
3052 (message[1] != '+' && message[1] != '-') ||
3053 !isdigit(message[2]) || !isdigit(message[3]) ||
3054 !isdigit(message[4]) || !isdigit(message[5]))
3055 return 0; /* corrupt? */
3056 email_end[1] = '\0';
3057 tz = strtol(message + 1, NULL, 10);
3058 if (message[6] != '\t')
3062 return fn(osha1, nsha1, sb->buf + 82, timestamp, tz, message, cb_data);
3065 static char *find_beginning_of_line(char *bob, char *scan)
3067 while (bob < scan && *(--scan) != '\n')
3068 ; /* keep scanning backwards */
3070 * Return either beginning of the buffer, or LF at the end of
3071 * the previous line.
3076 int for_each_reflog_ent_reverse(const char *refname, each_reflog_ent_fn fn, void *cb_data)
3078 struct strbuf sb = STRBUF_INIT;
3081 int ret = 0, at_tail = 1;
3083 logfp = fopen(git_path("logs/%s", refname), "r");
3087 /* Jump to the end */
3088 if (fseek(logfp, 0, SEEK_END) < 0)
3089 return error("cannot seek back reflog for %s: %s",
3090 refname, strerror(errno));
3092 while (!ret && 0 < pos) {
3098 /* Fill next block from the end */
3099 cnt = (sizeof(buf) < pos) ? sizeof(buf) : pos;
3100 if (fseek(logfp, pos - cnt, SEEK_SET))
3101 return error("cannot seek back reflog for %s: %s",
3102 refname, strerror(errno));
3103 nread = fread(buf, cnt, 1, logfp);
3105 return error("cannot read %d bytes from reflog for %s: %s",
3106 cnt, refname, strerror(errno));
3109 scanp = endp = buf + cnt;
3110 if (at_tail && scanp[-1] == '\n')
3111 /* Looking at the final LF at the end of the file */
3115 while (buf < scanp) {
3117 * terminating LF of the previous line, or the beginning
3122 bp = find_beginning_of_line(buf, scanp);
3126 * The newline is the end of the previous line,
3127 * so we know we have complete line starting
3128 * at (bp + 1). Prefix it onto any prior data
3129 * we collected for the line and process it.
3131 strbuf_splice(&sb, 0, 0, bp + 1, endp - (bp + 1));
3134 ret = show_one_reflog_ent(&sb, fn, cb_data);
3140 * We are at the start of the buffer, and the
3141 * start of the file; there is no previous
3142 * line, and we have everything for this one.
3143 * Process it, and we can end the loop.
3145 strbuf_splice(&sb, 0, 0, buf, endp - buf);
3146 ret = show_one_reflog_ent(&sb, fn, cb_data);
3153 * We are at the start of the buffer, and there
3154 * is more file to read backwards. Which means
3155 * we are in the middle of a line. Note that we
3156 * may get here even if *bp was a newline; that
3157 * just means we are at the exact end of the
3158 * previous line, rather than some spot in the
3161 * Save away what we have to be combined with
3162 * the data from the next read.
3164 strbuf_splice(&sb, 0, 0, buf, endp - buf);
3171 die("BUG: reverse reflog parser had leftover data");
3174 strbuf_release(&sb);
3178 int for_each_reflog_ent(const char *refname, each_reflog_ent_fn fn, void *cb_data)
3181 struct strbuf sb = STRBUF_INIT;
3184 logfp = fopen(git_path("logs/%s", refname), "r");
3188 while (!ret && !strbuf_getwholeline(&sb, logfp, '\n'))
3189 ret = show_one_reflog_ent(&sb, fn, cb_data);
3191 strbuf_release(&sb);
3195 * Call fn for each reflog in the namespace indicated by name. name
3196 * must be empty or end with '/'. Name will be used as a scratch
3197 * space, but its contents will be restored before return.
3199 static int do_for_each_reflog(struct strbuf *name, each_ref_fn fn, void *cb_data)
3201 DIR *d = opendir(git_path("logs/%s", name->buf));
3204 int oldlen = name->len;
3207 return name->len ? errno : 0;
3209 while ((de = readdir(d)) != NULL) {
3212 if (de->d_name[0] == '.')
3214 if (ends_with(de->d_name, ".lock"))
3216 strbuf_addstr(name, de->d_name);
3217 if (stat(git_path("logs/%s", name->buf), &st) < 0) {
3218 ; /* silently ignore */
3220 if (S_ISDIR(st.st_mode)) {
3221 strbuf_addch(name, '/');
3222 retval = do_for_each_reflog(name, fn, cb_data);
3224 struct object_id oid;
3226 if (read_ref_full(name->buf, 0, oid.hash, NULL))
3227 retval = error("bad ref for %s", name->buf);
3229 retval = fn(name->buf, &oid, 0, cb_data);
3234 strbuf_setlen(name, oldlen);
3240 int for_each_reflog(each_ref_fn fn, void *cb_data)
3244 strbuf_init(&name, PATH_MAX);
3245 retval = do_for_each_reflog(&name, fn, cb_data);
3246 strbuf_release(&name);
3250 static int ref_update_reject_duplicates(struct string_list *refnames,
3253 int i, n = refnames->nr;
3257 for (i = 1; i < n; i++)
3258 if (!strcmp(refnames->items[i - 1].string, refnames->items[i].string)) {
3260 "multiple updates for ref '%s' not allowed.",
3261 refnames->items[i].string);
3268 * If update is a direct update of head_ref (the reference pointed to
3269 * by HEAD), then add an extra REF_LOG_ONLY update for HEAD.
3271 static int split_head_update(struct ref_update *update,
3272 struct ref_transaction *transaction,
3273 const char *head_ref,
3274 struct string_list *affected_refnames,
3277 struct string_list_item *item;
3278 struct ref_update *new_update;
3280 if ((update->flags & REF_LOG_ONLY) ||
3281 (update->flags & REF_ISPRUNING) ||
3282 (update->flags & REF_UPDATE_VIA_HEAD))
3285 if (strcmp(update->refname, head_ref))
3289 * First make sure that HEAD is not already in the
3290 * transaction. This insertion is O(N) in the transaction
3291 * size, but it happens at most once per transaction.
3293 item = string_list_insert(affected_refnames, "HEAD");
3295 /* An entry already existed */
3297 "multiple updates for 'HEAD' (including one "
3298 "via its referent '%s') are not allowed",
3300 return TRANSACTION_NAME_CONFLICT;
3303 new_update = ref_transaction_add_update(
3304 transaction, "HEAD",
3305 update->flags | REF_LOG_ONLY | REF_NODEREF,
3306 update->new_sha1, update->old_sha1,
3309 item->util = new_update;
3315 * update is for a symref that points at referent and doesn't have
3316 * REF_NODEREF set. Split it into two updates:
3317 * - The original update, but with REF_LOG_ONLY and REF_NODEREF set
3318 * - A new, separate update for the referent reference
3319 * Note that the new update will itself be subject to splitting when
3320 * the iteration gets to it.
3322 static int split_symref_update(struct ref_update *update,
3323 const char *referent,
3324 struct ref_transaction *transaction,
3325 struct string_list *affected_refnames,
3328 struct string_list_item *item;
3329 struct ref_update *new_update;
3330 unsigned int new_flags;
3333 * First make sure that referent is not already in the
3334 * transaction. This insertion is O(N) in the transaction
3335 * size, but it happens at most once per symref in a
3338 item = string_list_insert(affected_refnames, referent);
3340 /* An entry already existed */
3342 "multiple updates for '%s' (including one "
3343 "via symref '%s') are not allowed",
3344 referent, update->refname);
3345 return TRANSACTION_NAME_CONFLICT;
3348 new_flags = update->flags;
3349 if (!strcmp(update->refname, "HEAD")) {
3351 * Record that the new update came via HEAD, so that
3352 * when we process it, split_head_update() doesn't try
3353 * to add another reflog update for HEAD. Note that
3354 * this bit will be propagated if the new_update
3355 * itself needs to be split.
3357 new_flags |= REF_UPDATE_VIA_HEAD;
3360 new_update = ref_transaction_add_update(
3361 transaction, referent, new_flags,
3362 update->new_sha1, update->old_sha1,
3365 new_update->parent_update = update;
3368 * Change the symbolic ref update to log only. Also, it
3369 * doesn't need to check its old SHA-1 value, as that will be
3370 * done when new_update is processed.
3372 update->flags |= REF_LOG_ONLY | REF_NODEREF;
3373 update->flags &= ~REF_HAVE_OLD;
3375 item->util = new_update;
3381 * Return the refname under which update was originally requested.
3383 static const char *original_update_refname(struct ref_update *update)
3385 while (update->parent_update)
3386 update = update->parent_update;
3388 return update->refname;
3392 * Check whether the REF_HAVE_OLD and old_oid values stored in update
3393 * are consistent with oid, which is the reference's current value. If
3394 * everything is OK, return 0; otherwise, write an error message to
3395 * err and return -1.
3397 static int check_old_oid(struct ref_update *update, struct object_id *oid,
3400 if (!(update->flags & REF_HAVE_OLD) ||
3401 !hashcmp(oid->hash, update->old_sha1))
3404 if (is_null_sha1(update->old_sha1))
3405 strbuf_addf(err, "cannot lock ref '%s': "
3406 "reference already exists",
3407 original_update_refname(update));
3408 else if (is_null_oid(oid))
3409 strbuf_addf(err, "cannot lock ref '%s': "
3410 "reference is missing but expected %s",
3411 original_update_refname(update),
3412 sha1_to_hex(update->old_sha1));
3414 strbuf_addf(err, "cannot lock ref '%s': "
3415 "is at %s but expected %s",
3416 original_update_refname(update),
3418 sha1_to_hex(update->old_sha1));
3424 * Prepare for carrying out update:
3425 * - Lock the reference referred to by update.
3426 * - Read the reference under lock.
3427 * - Check that its old SHA-1 value (if specified) is correct, and in
3428 * any case record it in update->lock->old_oid for later use when
3429 * writing the reflog.
3430 * - If it is a symref update without REF_NODEREF, split it up into a
3431 * REF_LOG_ONLY update of the symref and add a separate update for
3432 * the referent to transaction.
3433 * - If it is an update of head_ref, add a corresponding REF_LOG_ONLY
3436 static int lock_ref_for_update(struct ref_update *update,
3437 struct ref_transaction *transaction,
3438 const char *head_ref,
3439 struct string_list *affected_refnames,
3442 struct strbuf referent = STRBUF_INIT;
3443 int mustexist = (update->flags & REF_HAVE_OLD) &&
3444 !is_null_sha1(update->old_sha1);
3446 struct ref_lock *lock;
3448 if ((update->flags & REF_HAVE_NEW) && is_null_sha1(update->new_sha1))
3449 update->flags |= REF_DELETING;
3452 ret = split_head_update(update, transaction, head_ref,
3453 affected_refnames, err);
3458 ret = lock_raw_ref(update->refname, mustexist,
3459 affected_refnames, NULL,
3460 &update->lock, &referent,
3461 &update->type, err);
3466 reason = strbuf_detach(err, NULL);
3467 strbuf_addf(err, "cannot lock ref '%s': %s",
3468 original_update_refname(update), reason);
3473 lock = update->lock;
3475 if (update->type & REF_ISSYMREF) {
3476 if (update->flags & REF_NODEREF) {
3478 * We won't be reading the referent as part of
3479 * the transaction, so we have to read it here
3480 * to record and possibly check old_sha1:
3482 if (read_ref_full(update->refname, 0,
3483 lock->old_oid.hash, NULL)) {
3484 if (update->flags & REF_HAVE_OLD) {
3485 strbuf_addf(err, "cannot lock ref '%s': "
3486 "error reading reference",
3487 original_update_refname(update));
3490 } else if (check_old_oid(update, &lock->old_oid, err)) {
3491 return TRANSACTION_GENERIC_ERROR;
3495 * Create a new update for the reference this
3496 * symref is pointing at. Also, we will record
3497 * and verify old_sha1 for this update as part
3498 * of processing the split-off update, so we
3499 * don't have to do it here.
3501 ret = split_symref_update(update, referent.buf, transaction,
3502 affected_refnames, err);
3507 struct ref_update *parent_update;
3509 if (check_old_oid(update, &lock->old_oid, err))
3510 return TRANSACTION_GENERIC_ERROR;
3513 * If this update is happening indirectly because of a
3514 * symref update, record the old SHA-1 in the parent
3517 for (parent_update = update->parent_update;
3519 parent_update = parent_update->parent_update) {
3520 oidcpy(&parent_update->lock->old_oid, &lock->old_oid);
3524 if ((update->flags & REF_HAVE_NEW) &&
3525 !(update->flags & REF_DELETING) &&
3526 !(update->flags & REF_LOG_ONLY)) {
3527 if (!(update->type & REF_ISSYMREF) &&
3528 !hashcmp(lock->old_oid.hash, update->new_sha1)) {
3530 * The reference already has the desired
3531 * value, so we don't need to write it.
3533 } else if (write_ref_to_lockfile(lock, update->new_sha1,
3535 char *write_err = strbuf_detach(err, NULL);
3538 * The lock was freed upon failure of
3539 * write_ref_to_lockfile():
3541 update->lock = NULL;
3543 "cannot update ref '%s': %s",
3544 update->refname, write_err);
3546 return TRANSACTION_GENERIC_ERROR;
3548 update->flags |= REF_NEEDS_COMMIT;
3551 if (!(update->flags & REF_NEEDS_COMMIT)) {
3553 * We didn't call write_ref_to_lockfile(), so
3554 * the lockfile is still open. Close it to
3555 * free up the file descriptor:
3557 if (close_ref(lock)) {
3558 strbuf_addf(err, "couldn't close '%s.lock'",
3560 return TRANSACTION_GENERIC_ERROR;
3566 int ref_transaction_commit(struct ref_transaction *transaction,
3570 struct string_list refs_to_delete = STRING_LIST_INIT_NODUP;
3571 struct string_list_item *ref_to_delete;
3572 struct string_list affected_refnames = STRING_LIST_INIT_NODUP;
3573 char *head_ref = NULL;
3575 struct object_id head_oid;
3579 if (transaction->state != REF_TRANSACTION_OPEN)
3580 die("BUG: commit called for transaction that is not open");
3582 if (!transaction->nr) {
3583 transaction->state = REF_TRANSACTION_CLOSED;
3588 * Fail if a refname appears more than once in the
3589 * transaction. (If we end up splitting up any updates using
3590 * split_symref_update() or split_head_update(), those
3591 * functions will check that the new updates don't have the
3592 * same refname as any existing ones.)
3594 for (i = 0; i < transaction->nr; i++) {
3595 struct ref_update *update = transaction->updates[i];
3596 struct string_list_item *item =
3597 string_list_append(&affected_refnames, update->refname);
3600 * We store a pointer to update in item->util, but at
3601 * the moment we never use the value of this field
3602 * except to check whether it is non-NULL.
3604 item->util = update;
3606 string_list_sort(&affected_refnames);
3607 if (ref_update_reject_duplicates(&affected_refnames, err)) {
3608 ret = TRANSACTION_GENERIC_ERROR;
3613 * Special hack: If a branch is updated directly and HEAD
3614 * points to it (may happen on the remote side of a push
3615 * for example) then logically the HEAD reflog should be
3618 * A generic solution would require reverse symref lookups,
3619 * but finding all symrefs pointing to a given branch would be
3620 * rather costly for this rare event (the direct update of a
3621 * branch) to be worth it. So let's cheat and check with HEAD
3622 * only, which should cover 99% of all usage scenarios (even
3623 * 100% of the default ones).
3625 * So if HEAD is a symbolic reference, then record the name of
3626 * the reference that it points to. If we see an update of
3627 * head_ref within the transaction, then split_head_update()
3628 * arranges for the reflog of HEAD to be updated, too.
3630 head_ref = resolve_refdup("HEAD", RESOLVE_REF_NO_RECURSE,
3631 head_oid.hash, &head_type);
3633 if (head_ref && !(head_type & REF_ISSYMREF)) {
3639 * Acquire all locks, verify old values if provided, check
3640 * that new values are valid, and write new values to the
3641 * lockfiles, ready to be activated. Only keep one lockfile
3642 * open at a time to avoid running out of file descriptors.
3644 for (i = 0; i < transaction->nr; i++) {
3645 struct ref_update *update = transaction->updates[i];
3647 ret = lock_ref_for_update(update, transaction, head_ref,
3648 &affected_refnames, err);
3653 /* Perform updates first so live commits remain referenced */
3654 for (i = 0; i < transaction->nr; i++) {
3655 struct ref_update *update = transaction->updates[i];
3656 struct ref_lock *lock = update->lock;
3658 if (update->flags & REF_NEEDS_COMMIT ||
3659 update->flags & REF_LOG_ONLY) {
3660 if (log_ref_write(lock->ref_name, lock->old_oid.hash,
3662 update->msg, update->flags, err)) {
3663 char *old_msg = strbuf_detach(err, NULL);
3665 strbuf_addf(err, "cannot update the ref '%s': %s",
3666 lock->ref_name, old_msg);
3669 update->lock = NULL;
3670 ret = TRANSACTION_GENERIC_ERROR;
3674 if (update->flags & REF_NEEDS_COMMIT) {
3675 clear_loose_ref_cache(&ref_cache);
3676 if (commit_ref(lock)) {
3677 strbuf_addf(err, "couldn't set '%s'", lock->ref_name);
3679 update->lock = NULL;
3680 ret = TRANSACTION_GENERIC_ERROR;
3685 /* Perform deletes now that updates are safely completed */
3686 for (i = 0; i < transaction->nr; i++) {
3687 struct ref_update *update = transaction->updates[i];
3689 if (update->flags & REF_DELETING &&
3690 !(update->flags & REF_LOG_ONLY)) {
3691 if (delete_ref_loose(update->lock, update->type, err)) {
3692 ret = TRANSACTION_GENERIC_ERROR;
3696 if (!(update->flags & REF_ISPRUNING))
3697 string_list_append(&refs_to_delete,
3698 update->lock->ref_name);
3702 if (repack_without_refs(&refs_to_delete, err)) {
3703 ret = TRANSACTION_GENERIC_ERROR;
3706 for_each_string_list_item(ref_to_delete, &refs_to_delete)
3707 unlink_or_warn(git_path("logs/%s", ref_to_delete->string));
3708 clear_loose_ref_cache(&ref_cache);
3711 transaction->state = REF_TRANSACTION_CLOSED;
3713 for (i = 0; i < transaction->nr; i++)
3714 if (transaction->updates[i]->lock)
3715 unlock_ref(transaction->updates[i]->lock);
3716 string_list_clear(&refs_to_delete, 0);
3718 string_list_clear(&affected_refnames, 0);
3723 static int ref_present(const char *refname,
3724 const struct object_id *oid, int flags, void *cb_data)
3726 struct string_list *affected_refnames = cb_data;
3728 return string_list_has_string(affected_refnames, refname);
3731 int initial_ref_transaction_commit(struct ref_transaction *transaction,
3735 struct string_list affected_refnames = STRING_LIST_INIT_NODUP;
3739 if (transaction->state != REF_TRANSACTION_OPEN)
3740 die("BUG: commit called for transaction that is not open");
3742 /* Fail if a refname appears more than once in the transaction: */
3743 for (i = 0; i < transaction->nr; i++)
3744 string_list_append(&affected_refnames,
3745 transaction->updates[i]->refname);
3746 string_list_sort(&affected_refnames);
3747 if (ref_update_reject_duplicates(&affected_refnames, err)) {
3748 ret = TRANSACTION_GENERIC_ERROR;
3753 * It's really undefined to call this function in an active
3754 * repository or when there are existing references: we are
3755 * only locking and changing packed-refs, so (1) any
3756 * simultaneous processes might try to change a reference at
3757 * the same time we do, and (2) any existing loose versions of
3758 * the references that we are setting would have precedence
3759 * over our values. But some remote helpers create the remote
3760 * "HEAD" and "master" branches before calling this function,
3761 * so here we really only check that none of the references
3762 * that we are creating already exists.
3764 if (for_each_rawref(ref_present, &affected_refnames))
3765 die("BUG: initial ref transaction called with existing refs");
3767 for (i = 0; i < transaction->nr; i++) {
3768 struct ref_update *update = transaction->updates[i];
3770 if ((update->flags & REF_HAVE_OLD) &&
3771 !is_null_sha1(update->old_sha1))
3772 die("BUG: initial ref transaction with old_sha1 set");
3773 if (verify_refname_available(update->refname,
3774 &affected_refnames, NULL,
3776 ret = TRANSACTION_NAME_CONFLICT;
3781 if (lock_packed_refs(0)) {
3782 strbuf_addf(err, "unable to lock packed-refs file: %s",
3784 ret = TRANSACTION_GENERIC_ERROR;
3788 for (i = 0; i < transaction->nr; i++) {
3789 struct ref_update *update = transaction->updates[i];
3791 if ((update->flags & REF_HAVE_NEW) &&
3792 !is_null_sha1(update->new_sha1))
3793 add_packed_ref(update->refname, update->new_sha1);
3796 if (commit_packed_refs()) {
3797 strbuf_addf(err, "unable to commit packed-refs file: %s",
3799 ret = TRANSACTION_GENERIC_ERROR;
3804 transaction->state = REF_TRANSACTION_CLOSED;
3805 string_list_clear(&affected_refnames, 0);
3809 struct expire_reflog_cb {
3811 reflog_expiry_should_prune_fn *should_prune_fn;
3814 unsigned char last_kept_sha1[20];
3817 static int expire_reflog_ent(unsigned char *osha1, unsigned char *nsha1,
3818 const char *email, unsigned long timestamp, int tz,
3819 const char *message, void *cb_data)
3821 struct expire_reflog_cb *cb = cb_data;
3822 struct expire_reflog_policy_cb *policy_cb = cb->policy_cb;
3824 if (cb->flags & EXPIRE_REFLOGS_REWRITE)
3825 osha1 = cb->last_kept_sha1;
3827 if ((*cb->should_prune_fn)(osha1, nsha1, email, timestamp, tz,
3828 message, policy_cb)) {
3830 printf("would prune %s", message);
3831 else if (cb->flags & EXPIRE_REFLOGS_VERBOSE)
3832 printf("prune %s", message);
3835 fprintf(cb->newlog, "%s %s %s %lu %+05d\t%s",
3836 sha1_to_hex(osha1), sha1_to_hex(nsha1),
3837 email, timestamp, tz, message);
3838 hashcpy(cb->last_kept_sha1, nsha1);
3840 if (cb->flags & EXPIRE_REFLOGS_VERBOSE)
3841 printf("keep %s", message);
3846 int reflog_expire(const char *refname, const unsigned char *sha1,
3848 reflog_expiry_prepare_fn prepare_fn,
3849 reflog_expiry_should_prune_fn should_prune_fn,
3850 reflog_expiry_cleanup_fn cleanup_fn,
3851 void *policy_cb_data)
3853 static struct lock_file reflog_lock;
3854 struct expire_reflog_cb cb;
3855 struct ref_lock *lock;
3859 struct strbuf err = STRBUF_INIT;
3861 memset(&cb, 0, sizeof(cb));
3863 cb.policy_cb = policy_cb_data;
3864 cb.should_prune_fn = should_prune_fn;
3867 * The reflog file is locked by holding the lock on the
3868 * reference itself, plus we might need to update the
3869 * reference if --updateref was specified:
3871 lock = lock_ref_sha1_basic(refname, sha1, NULL, NULL, REF_NODEREF,
3874 error("cannot lock ref '%s': %s", refname, err.buf);
3875 strbuf_release(&err);
3878 if (!reflog_exists(refname)) {
3883 log_file = git_pathdup("logs/%s", refname);
3884 if (!(flags & EXPIRE_REFLOGS_DRY_RUN)) {
3886 * Even though holding $GIT_DIR/logs/$reflog.lock has
3887 * no locking implications, we use the lock_file
3888 * machinery here anyway because it does a lot of the
3889 * work we need, including cleaning up if the program
3890 * exits unexpectedly.
3892 if (hold_lock_file_for_update(&reflog_lock, log_file, 0) < 0) {
3893 struct strbuf err = STRBUF_INIT;
3894 unable_to_lock_message(log_file, errno, &err);
3895 error("%s", err.buf);
3896 strbuf_release(&err);
3899 cb.newlog = fdopen_lock_file(&reflog_lock, "w");
3901 error("cannot fdopen %s (%s)",
3902 get_lock_file_path(&reflog_lock), strerror(errno));
3907 (*prepare_fn)(refname, sha1, cb.policy_cb);
3908 for_each_reflog_ent(refname, expire_reflog_ent, &cb);
3909 (*cleanup_fn)(cb.policy_cb);
3911 if (!(flags & EXPIRE_REFLOGS_DRY_RUN)) {
3913 * It doesn't make sense to adjust a reference pointed
3914 * to by a symbolic ref based on expiring entries in
3915 * the symbolic reference's reflog. Nor can we update
3916 * a reference if there are no remaining reflog
3919 int update = (flags & EXPIRE_REFLOGS_UPDATE_REF) &&
3920 !(type & REF_ISSYMREF) &&
3921 !is_null_sha1(cb.last_kept_sha1);
3923 if (close_lock_file(&reflog_lock)) {
3924 status |= error("couldn't write %s: %s", log_file,
3926 } else if (update &&
3927 (write_in_full(get_lock_file_fd(lock->lk),
3928 sha1_to_hex(cb.last_kept_sha1), 40) != 40 ||
3929 write_str_in_full(get_lock_file_fd(lock->lk), "\n") != 1 ||
3930 close_ref(lock) < 0)) {
3931 status |= error("couldn't write %s",
3932 get_lock_file_path(lock->lk));
3933 rollback_lock_file(&reflog_lock);
3934 } else if (commit_lock_file(&reflog_lock)) {
3935 status |= error("unable to write reflog '%s' (%s)",
3936 log_file, strerror(errno));
3937 } else if (update && commit_ref(lock)) {
3938 status |= error("couldn't set %s", lock->ref_name);
3946 rollback_lock_file(&reflog_lock);