3 #include "refs-internal.h"
4 #include "../iterator.h"
5 #include "../dir-iterator.h"
6 #include "../lockfile.h"
13 struct object_id old_oid
;
19 * Information used (along with the information in ref_entry) to
20 * describe a single cached reference. This data structure only
21 * occurs embedded in a union in struct ref_entry, and only when
22 * (ref_entry->flag & REF_DIR) is zero.
26 * The name of the object to which this reference resolves
27 * (which may be a tag object). If REF_ISBROKEN, this is
28 * null. If REF_ISSYMREF, then this is the name of the object
29 * referred to by the last reference in the symlink chain.
34 * If REF_KNOWS_PEELED, then this field holds the peeled value
35 * of this reference, or null if the reference is known not to
36 * be peelable. See the documentation for peel_ref() for an
37 * exact definition of "peelable".
39 struct object_id peeled
;
42 struct files_ref_store
;
45 * Information used (along with the information in ref_entry) to
46 * describe a level in the hierarchy of references. This data
47 * structure only occurs embedded in a union in struct ref_entry, and
48 * only when (ref_entry.flag & REF_DIR) is set. In that case,
49 * (ref_entry.flag & REF_INCOMPLETE) determines whether the references
50 * in the directory have already been read:
52 * (ref_entry.flag & REF_INCOMPLETE) unset -- a directory of loose
53 * or packed references, already read.
55 * (ref_entry.flag & REF_INCOMPLETE) set -- a directory of loose
56 * references that hasn't been read yet (nor has any of its
59 * Entries within a directory are stored within a growable array of
60 * pointers to ref_entries (entries, nr, alloc). Entries 0 <= i <
61 * sorted are sorted by their component name in strcmp() order and the
62 * remaining entries are unsorted.
64 * Loose references are read lazily, one directory at a time. When a
65 * directory of loose references is read, then all of the references
66 * in that directory are stored, and REF_INCOMPLETE stubs are created
67 * for any subdirectories, but the subdirectories themselves are not
68 * read. The reading is triggered by get_ref_dir().
74 * Entries with index 0 <= i < sorted are sorted by name. New
75 * entries are appended to the list unsorted, and are sorted
76 * only when required; thus we avoid the need to sort the list
77 * after the addition of every reference.
81 /* A pointer to the files_ref_store that contains this ref_dir. */
82 struct files_ref_store
*ref_store
;
84 struct ref_entry
**entries
;
88 * Bit values for ref_entry::flag. REF_ISSYMREF=0x01,
89 * REF_ISPACKED=0x02, REF_ISBROKEN=0x04 and REF_BAD_NAME=0x08 are
90 * public values; see refs.h.
94 * The field ref_entry->u.value.peeled of this value entry contains
95 * the correct peeled value for the reference, which might be
96 * null_sha1 if the reference is not a tag or if it is broken.
98 #define REF_KNOWS_PEELED 0x10
100 /* ref_entry represents a directory of references */
104 * Entry has not yet been read from disk (used only for REF_DIR
105 * entries representing loose references)
107 #define REF_INCOMPLETE 0x40
110 * A ref_entry represents either a reference or a "subdirectory" of
113 * Each directory in the reference namespace is represented by a
114 * ref_entry with (flags & REF_DIR) set and containing a subdir member
115 * that holds the entries in that directory that have been read so
116 * far. If (flags & REF_INCOMPLETE) is set, then the directory and
117 * its subdirectories haven't been read yet. REF_INCOMPLETE is only
118 * used for loose reference directories.
120 * References are represented by a ref_entry with (flags & REF_DIR)
121 * unset and a value member that describes the reference's value. The
122 * flag member is at the ref_entry level, but it is also needed to
123 * interpret the contents of the value field (in other words, a
124 * ref_value object is not very much use without the enclosing
127 * Reference names cannot end with slash and directories' names are
128 * always stored with a trailing slash (except for the top-level
129 * directory, which is always denoted by ""). This has two nice
130 * consequences: (1) when the entries in each subdir are sorted
131 * lexicographically by name (as they usually are), the references in
132 * a whole tree can be generated in lexicographic order by traversing
133 * the tree in left-to-right, depth-first order; (2) the names of
134 * references and subdirectories cannot conflict, and therefore the
135 * presence of an empty subdirectory does not block the creation of a
136 * similarly-named reference. (The fact that reference names with the
137 * same leading components can conflict *with each other* is a
138 * separate issue that is regulated by verify_refname_available().)
140 * Please note that the name field contains the fully-qualified
141 * reference (or subdirectory) name. Space could be saved by only
142 * storing the relative names. But that would require the full names
143 * to be generated on the fly when iterating in do_for_each_ref(), and
144 * would break callback functions, who have always been able to assume
145 * that the name strings that they are passed will not be freed during
149 unsigned char flag
; /* ISSYMREF? ISPACKED? */
151 struct ref_value value
; /* if not (flags&REF_DIR) */
152 struct ref_dir subdir
; /* if (flags&REF_DIR) */
155 * The full name of the reference (e.g., "refs/heads/master")
156 * or the full name of the directory with a trailing slash
157 * (e.g., "refs/heads/"):
159 char name
[FLEX_ARRAY
];
162 static void read_loose_refs(const char *dirname
, struct ref_dir
*dir
);
163 static int search_ref_dir(struct ref_dir
*dir
, const char *refname
, size_t len
);
164 static struct ref_entry
*create_dir_entry(struct files_ref_store
*ref_store
,
165 const char *dirname
, size_t len
,
167 static void add_entry_to_dir(struct ref_dir
*dir
, struct ref_entry
*entry
);
169 static struct ref_dir
*get_ref_dir(struct ref_entry
*entry
)
172 assert(entry
->flag
& REF_DIR
);
173 dir
= &entry
->u
.subdir
;
174 if (entry
->flag
& REF_INCOMPLETE
) {
175 read_loose_refs(entry
->name
, dir
);
178 * Manually add refs/bisect, which, being
179 * per-worktree, might not appear in the directory
180 * listing for refs/ in the main repo.
182 if (!strcmp(entry
->name
, "refs/")) {
183 int pos
= search_ref_dir(dir
, "refs/bisect/", 12);
185 struct ref_entry
*child_entry
;
186 child_entry
= create_dir_entry(dir
->ref_store
,
189 add_entry_to_dir(dir
, child_entry
);
190 read_loose_refs("refs/bisect",
191 &child_entry
->u
.subdir
);
194 entry
->flag
&= ~REF_INCOMPLETE
;
199 static struct ref_entry
*create_ref_entry(const char *refname
,
200 const unsigned char *sha1
, int flag
,
203 struct ref_entry
*ref
;
206 check_refname_format(refname
, REFNAME_ALLOW_ONELEVEL
))
207 die("Reference has invalid format: '%s'", refname
);
208 FLEX_ALLOC_STR(ref
, name
, refname
);
209 hashcpy(ref
->u
.value
.oid
.hash
, sha1
);
210 oidclr(&ref
->u
.value
.peeled
);
215 static void clear_ref_dir(struct ref_dir
*dir
);
217 static void free_ref_entry(struct ref_entry
*entry
)
219 if (entry
->flag
& REF_DIR
) {
221 * Do not use get_ref_dir() here, as that might
222 * trigger the reading of loose refs.
224 clear_ref_dir(&entry
->u
.subdir
);
230 * Add a ref_entry to the end of dir (unsorted). Entry is always
231 * stored directly in dir; no recursion into subdirectories is
234 static void add_entry_to_dir(struct ref_dir
*dir
, struct ref_entry
*entry
)
236 ALLOC_GROW(dir
->entries
, dir
->nr
+ 1, dir
->alloc
);
237 dir
->entries
[dir
->nr
++] = entry
;
238 /* optimize for the case that entries are added in order */
240 (dir
->nr
== dir
->sorted
+ 1 &&
241 strcmp(dir
->entries
[dir
->nr
- 2]->name
,
242 dir
->entries
[dir
->nr
- 1]->name
) < 0))
243 dir
->sorted
= dir
->nr
;
247 * Clear and free all entries in dir, recursively.
249 static void clear_ref_dir(struct ref_dir
*dir
)
252 for (i
= 0; i
< dir
->nr
; i
++)
253 free_ref_entry(dir
->entries
[i
]);
255 dir
->sorted
= dir
->nr
= dir
->alloc
= 0;
260 * Create a struct ref_entry object for the specified dirname.
261 * dirname is the name of the directory with a trailing slash (e.g.,
262 * "refs/heads/") or "" for the top-level directory.
264 static struct ref_entry
*create_dir_entry(struct files_ref_store
*ref_store
,
265 const char *dirname
, size_t len
,
268 struct ref_entry
*direntry
;
269 FLEX_ALLOC_MEM(direntry
, name
, dirname
, len
);
270 direntry
->u
.subdir
.ref_store
= ref_store
;
271 direntry
->flag
= REF_DIR
| (incomplete
? REF_INCOMPLETE
: 0);
275 static int ref_entry_cmp(const void *a
, const void *b
)
277 struct ref_entry
*one
= *(struct ref_entry
**)a
;
278 struct ref_entry
*two
= *(struct ref_entry
**)b
;
279 return strcmp(one
->name
, two
->name
);
282 static void sort_ref_dir(struct ref_dir
*dir
);
284 struct string_slice
{
289 static int ref_entry_cmp_sslice(const void *key_
, const void *ent_
)
291 const struct string_slice
*key
= key_
;
292 const struct ref_entry
*ent
= *(const struct ref_entry
* const *)ent_
;
293 int cmp
= strncmp(key
->str
, ent
->name
, key
->len
);
296 return '\0' - (unsigned char)ent
->name
[key
->len
];
300 * Return the index of the entry with the given refname from the
301 * ref_dir (non-recursively), sorting dir if necessary. Return -1 if
302 * no such entry is found. dir must already be complete.
304 static int search_ref_dir(struct ref_dir
*dir
, const char *refname
, size_t len
)
306 struct ref_entry
**r
;
307 struct string_slice key
;
309 if (refname
== NULL
|| !dir
->nr
)
315 r
= bsearch(&key
, dir
->entries
, dir
->nr
, sizeof(*dir
->entries
),
316 ref_entry_cmp_sslice
);
321 return r
- dir
->entries
;
325 * Search for a directory entry directly within dir (without
326 * recursing). Sort dir if necessary. subdirname must be a directory
327 * name (i.e., end in '/'). If mkdir is set, then create the
328 * directory if it is missing; otherwise, return NULL if the desired
329 * directory cannot be found. dir must already be complete.
331 static struct ref_dir
*search_for_subdir(struct ref_dir
*dir
,
332 const char *subdirname
, size_t len
,
335 int entry_index
= search_ref_dir(dir
, subdirname
, len
);
336 struct ref_entry
*entry
;
337 if (entry_index
== -1) {
341 * Since dir is complete, the absence of a subdir
342 * means that the subdir really doesn't exist;
343 * therefore, create an empty record for it but mark
344 * the record complete.
346 entry
= create_dir_entry(dir
->ref_store
, subdirname
, len
, 0);
347 add_entry_to_dir(dir
, entry
);
349 entry
= dir
->entries
[entry_index
];
351 return get_ref_dir(entry
);
355 * If refname is a reference name, find the ref_dir within the dir
356 * tree that should hold refname. If refname is a directory name
357 * (i.e., ends in '/'), then return that ref_dir itself. dir must
358 * represent the top-level directory and must already be complete.
359 * Sort ref_dirs and recurse into subdirectories as necessary. If
360 * mkdir is set, then create any missing directories; otherwise,
361 * return NULL if the desired directory cannot be found.
363 static struct ref_dir
*find_containing_dir(struct ref_dir
*dir
,
364 const char *refname
, int mkdir
)
367 for (slash
= strchr(refname
, '/'); slash
; slash
= strchr(slash
+ 1, '/')) {
368 size_t dirnamelen
= slash
- refname
+ 1;
369 struct ref_dir
*subdir
;
370 subdir
= search_for_subdir(dir
, refname
, dirnamelen
, mkdir
);
382 * Find the value entry with the given name in dir, sorting ref_dirs
383 * and recursing into subdirectories as necessary. If the name is not
384 * found or it corresponds to a directory entry, return NULL.
386 static struct ref_entry
*find_ref(struct ref_dir
*dir
, const char *refname
)
389 struct ref_entry
*entry
;
390 dir
= find_containing_dir(dir
, refname
, 0);
393 entry_index
= search_ref_dir(dir
, refname
, strlen(refname
));
394 if (entry_index
== -1)
396 entry
= dir
->entries
[entry_index
];
397 return (entry
->flag
& REF_DIR
) ? NULL
: entry
;
401 * Remove the entry with the given name from dir, recursing into
402 * subdirectories as necessary. If refname is the name of a directory
403 * (i.e., ends with '/'), then remove the directory and its contents.
404 * If the removal was successful, return the number of entries
405 * remaining in the directory entry that contained the deleted entry.
406 * If the name was not found, return -1. Please note that this
407 * function only deletes the entry from the cache; it does not delete
408 * it from the filesystem or ensure that other cache entries (which
409 * might be symbolic references to the removed entry) are updated.
410 * Nor does it remove any containing dir entries that might be made
411 * empty by the removal. dir must represent the top-level directory
412 * and must already be complete.
414 static int remove_entry(struct ref_dir
*dir
, const char *refname
)
416 int refname_len
= strlen(refname
);
418 struct ref_entry
*entry
;
419 int is_dir
= refname
[refname_len
- 1] == '/';
422 * refname represents a reference directory. Remove
423 * the trailing slash; otherwise we will get the
424 * directory *representing* refname rather than the
425 * one *containing* it.
427 char *dirname
= xmemdupz(refname
, refname_len
- 1);
428 dir
= find_containing_dir(dir
, dirname
, 0);
431 dir
= find_containing_dir(dir
, refname
, 0);
435 entry_index
= search_ref_dir(dir
, refname
, refname_len
);
436 if (entry_index
== -1)
438 entry
= dir
->entries
[entry_index
];
440 memmove(&dir
->entries
[entry_index
],
441 &dir
->entries
[entry_index
+ 1],
442 (dir
->nr
- entry_index
- 1) * sizeof(*dir
->entries
)
445 if (dir
->sorted
> entry_index
)
447 free_ref_entry(entry
);
452 * Add a ref_entry to the ref_dir (unsorted), recursing into
453 * subdirectories as necessary. dir must represent the top-level
454 * directory. Return 0 on success.
456 static int add_ref(struct ref_dir
*dir
, struct ref_entry
*ref
)
458 dir
= find_containing_dir(dir
, ref
->name
, 1);
461 add_entry_to_dir(dir
, ref
);
466 * Emit a warning and return true iff ref1 and ref2 have the same name
467 * and the same sha1. Die if they have the same name but different
470 static int is_dup_ref(const struct ref_entry
*ref1
, const struct ref_entry
*ref2
)
472 if (strcmp(ref1
->name
, ref2
->name
))
475 /* Duplicate name; make sure that they don't conflict: */
477 if ((ref1
->flag
& REF_DIR
) || (ref2
->flag
& REF_DIR
))
478 /* This is impossible by construction */
479 die("Reference directory conflict: %s", ref1
->name
);
481 if (oidcmp(&ref1
->u
.value
.oid
, &ref2
->u
.value
.oid
))
482 die("Duplicated ref, and SHA1s don't match: %s", ref1
->name
);
484 warning("Duplicated ref: %s", ref1
->name
);
489 * Sort the entries in dir non-recursively (if they are not already
490 * sorted) and remove any duplicate entries.
492 static void sort_ref_dir(struct ref_dir
*dir
)
495 struct ref_entry
*last
= NULL
;
498 * This check also prevents passing a zero-length array to qsort(),
499 * which is a problem on some platforms.
501 if (dir
->sorted
== dir
->nr
)
504 QSORT(dir
->entries
, dir
->nr
, ref_entry_cmp
);
506 /* Remove any duplicates: */
507 for (i
= 0, j
= 0; j
< dir
->nr
; j
++) {
508 struct ref_entry
*entry
= dir
->entries
[j
];
509 if (last
&& is_dup_ref(last
, entry
))
510 free_ref_entry(entry
);
512 last
= dir
->entries
[i
++] = entry
;
514 dir
->sorted
= dir
->nr
= i
;
518 * Return true if refname, which has the specified oid and flags, can
519 * be resolved to an object in the database. If the referred-to object
520 * does not exist, emit a warning and return false.
522 static int ref_resolves_to_object(const char *refname
,
523 const struct object_id
*oid
,
526 if (flags
& REF_ISBROKEN
)
528 if (!has_sha1_file(oid
->hash
)) {
529 error("%s does not point to a valid object!", refname
);
536 * Return true if the reference described by entry can be resolved to
537 * an object in the database; otherwise, emit a warning and return
540 static int entry_resolves_to_object(struct ref_entry
*entry
)
542 return ref_resolves_to_object(entry
->name
,
543 &entry
->u
.value
.oid
, entry
->flag
);
546 typedef int each_ref_entry_fn(struct ref_entry
*entry
, void *cb_data
);
549 * Call fn for each reference in dir that has index in the range
550 * offset <= index < dir->nr. Recurse into subdirectories that are in
551 * that index range, sorting them before iterating. This function
552 * does not sort dir itself; it should be sorted beforehand. fn is
553 * called for all references, including broken ones.
555 static int do_for_each_entry_in_dir(struct ref_dir
*dir
, int offset
,
556 each_ref_entry_fn fn
, void *cb_data
)
559 assert(dir
->sorted
== dir
->nr
);
560 for (i
= offset
; i
< dir
->nr
; i
++) {
561 struct ref_entry
*entry
= dir
->entries
[i
];
563 if (entry
->flag
& REF_DIR
) {
564 struct ref_dir
*subdir
= get_ref_dir(entry
);
565 sort_ref_dir(subdir
);
566 retval
= do_for_each_entry_in_dir(subdir
, 0, fn
, cb_data
);
568 retval
= fn(entry
, cb_data
);
577 * Load all of the refs from the dir into our in-memory cache. The hard work
578 * of loading loose refs is done by get_ref_dir(), so we just need to recurse
579 * through all of the sub-directories. We do not even need to care about
580 * sorting, as traversal order does not matter to us.
582 static void prime_ref_dir(struct ref_dir
*dir
)
585 for (i
= 0; i
< dir
->nr
; i
++) {
586 struct ref_entry
*entry
= dir
->entries
[i
];
587 if (entry
->flag
& REF_DIR
)
588 prime_ref_dir(get_ref_dir(entry
));
593 * A level in the reference hierarchy that is currently being iterated
596 struct cache_ref_iterator_level
{
598 * The ref_dir being iterated over at this level. The ref_dir
599 * is sorted before being stored here.
604 * The index of the current entry within dir (which might
605 * itself be a directory). If index == -1, then the iteration
606 * hasn't yet begun. If index == dir->nr, then the iteration
607 * through this level is over.
613 * Represent an iteration through a ref_dir in the memory cache. The
614 * iteration recurses through subdirectories.
616 struct cache_ref_iterator
{
617 struct ref_iterator base
;
620 * The number of levels currently on the stack. This is always
621 * at least 1, because when it becomes zero the iteration is
622 * ended and this struct is freed.
626 /* The number of levels that have been allocated on the stack */
630 * A stack of levels. levels[0] is the uppermost level that is
631 * being iterated over in this iteration. (This is not
632 * necessary the top level in the references hierarchy. If we
633 * are iterating through a subtree, then levels[0] will hold
634 * the ref_dir for that subtree, and subsequent levels will go
637 struct cache_ref_iterator_level
*levels
;
640 static int cache_ref_iterator_advance(struct ref_iterator
*ref_iterator
)
642 struct cache_ref_iterator
*iter
=
643 (struct cache_ref_iterator
*)ref_iterator
;
646 struct cache_ref_iterator_level
*level
=
647 &iter
->levels
[iter
->levels_nr
- 1];
648 struct ref_dir
*dir
= level
->dir
;
649 struct ref_entry
*entry
;
651 if (level
->index
== -1)
654 if (++level
->index
== level
->dir
->nr
) {
655 /* This level is exhausted; pop up a level */
656 if (--iter
->levels_nr
== 0)
657 return ref_iterator_abort(ref_iterator
);
662 entry
= dir
->entries
[level
->index
];
664 if (entry
->flag
& REF_DIR
) {
665 /* push down a level */
666 ALLOC_GROW(iter
->levels
, iter
->levels_nr
+ 1,
669 level
= &iter
->levels
[iter
->levels_nr
++];
670 level
->dir
= get_ref_dir(entry
);
673 iter
->base
.refname
= entry
->name
;
674 iter
->base
.oid
= &entry
->u
.value
.oid
;
675 iter
->base
.flags
= entry
->flag
;
681 static enum peel_status
peel_entry(struct ref_entry
*entry
, int repeel
);
683 static int cache_ref_iterator_peel(struct ref_iterator
*ref_iterator
,
684 struct object_id
*peeled
)
686 struct cache_ref_iterator
*iter
=
687 (struct cache_ref_iterator
*)ref_iterator
;
688 struct cache_ref_iterator_level
*level
;
689 struct ref_entry
*entry
;
691 level
= &iter
->levels
[iter
->levels_nr
- 1];
693 if (level
->index
== -1)
694 die("BUG: peel called before advance for cache iterator");
696 entry
= level
->dir
->entries
[level
->index
];
698 if (peel_entry(entry
, 0))
700 oidcpy(peeled
, &entry
->u
.value
.peeled
);
704 static int cache_ref_iterator_abort(struct ref_iterator
*ref_iterator
)
706 struct cache_ref_iterator
*iter
=
707 (struct cache_ref_iterator
*)ref_iterator
;
710 base_ref_iterator_free(ref_iterator
);
714 static struct ref_iterator_vtable cache_ref_iterator_vtable
= {
715 cache_ref_iterator_advance
,
716 cache_ref_iterator_peel
,
717 cache_ref_iterator_abort
720 static struct ref_iterator
*cache_ref_iterator_begin(struct ref_dir
*dir
)
722 struct cache_ref_iterator
*iter
;
723 struct ref_iterator
*ref_iterator
;
724 struct cache_ref_iterator_level
*level
;
726 iter
= xcalloc(1, sizeof(*iter
));
727 ref_iterator
= &iter
->base
;
728 base_ref_iterator_init(ref_iterator
, &cache_ref_iterator_vtable
);
729 ALLOC_GROW(iter
->levels
, 10, iter
->levels_alloc
);
732 level
= &iter
->levels
[0];
739 struct nonmatching_ref_data
{
740 const struct string_list
*skip
;
741 const char *conflicting_refname
;
744 static int nonmatching_ref_fn(struct ref_entry
*entry
, void *vdata
)
746 struct nonmatching_ref_data
*data
= vdata
;
748 if (data
->skip
&& string_list_has_string(data
->skip
, entry
->name
))
751 data
->conflicting_refname
= entry
->name
;
756 * Return 0 if a reference named refname could be created without
757 * conflicting with the name of an existing reference in dir.
758 * See verify_refname_available for more information.
760 static int verify_refname_available_dir(const char *refname
,
761 const struct string_list
*extras
,
762 const struct string_list
*skip
,
767 const char *extra_refname
;
769 struct strbuf dirname
= STRBUF_INIT
;
773 * For the sake of comments in this function, suppose that
774 * refname is "refs/foo/bar".
779 strbuf_grow(&dirname
, strlen(refname
) + 1);
780 for (slash
= strchr(refname
, '/'); slash
; slash
= strchr(slash
+ 1, '/')) {
781 /* Expand dirname to the new prefix, not including the trailing slash: */
782 strbuf_add(&dirname
, refname
+ dirname
.len
, slash
- refname
- dirname
.len
);
785 * We are still at a leading dir of the refname (e.g.,
786 * "refs/foo"; if there is a reference with that name,
787 * it is a conflict, *unless* it is in skip.
790 pos
= search_ref_dir(dir
, dirname
.buf
, dirname
.len
);
792 (!skip
|| !string_list_has_string(skip
, dirname
.buf
))) {
794 * We found a reference whose name is
795 * a proper prefix of refname; e.g.,
796 * "refs/foo", and is not in skip.
798 strbuf_addf(err
, "'%s' exists; cannot create '%s'",
799 dirname
.buf
, refname
);
804 if (extras
&& string_list_has_string(extras
, dirname
.buf
) &&
805 (!skip
|| !string_list_has_string(skip
, dirname
.buf
))) {
806 strbuf_addf(err
, "cannot process '%s' and '%s' at the same time",
807 refname
, dirname
.buf
);
812 * Otherwise, we can try to continue our search with
813 * the next component. So try to look up the
814 * directory, e.g., "refs/foo/". If we come up empty,
815 * we know there is nothing under this whole prefix,
816 * but even in that case we still have to continue the
817 * search for conflicts with extras.
819 strbuf_addch(&dirname
, '/');
821 pos
= search_ref_dir(dir
, dirname
.buf
, dirname
.len
);
824 * There was no directory "refs/foo/",
825 * so there is nothing under this
826 * whole prefix. So there is no need
827 * to continue looking for conflicting
828 * references. But we need to continue
829 * looking for conflicting extras.
833 dir
= get_ref_dir(dir
->entries
[pos
]);
839 * We are at the leaf of our refname (e.g., "refs/foo/bar").
840 * There is no point in searching for a reference with that
841 * name, because a refname isn't considered to conflict with
842 * itself. But we still need to check for references whose
843 * names are in the "refs/foo/bar/" namespace, because they
846 strbuf_addstr(&dirname
, refname
+ dirname
.len
);
847 strbuf_addch(&dirname
, '/');
850 pos
= search_ref_dir(dir
, dirname
.buf
, dirname
.len
);
854 * We found a directory named "$refname/"
855 * (e.g., "refs/foo/bar/"). It is a problem
856 * iff it contains any ref that is not in
859 struct nonmatching_ref_data data
;
862 data
.conflicting_refname
= NULL
;
863 dir
= get_ref_dir(dir
->entries
[pos
]);
865 if (do_for_each_entry_in_dir(dir
, 0, nonmatching_ref_fn
, &data
)) {
866 strbuf_addf(err
, "'%s' exists; cannot create '%s'",
867 data
.conflicting_refname
, refname
);
873 extra_refname
= find_descendant_ref(dirname
.buf
, extras
, skip
);
875 strbuf_addf(err
, "cannot process '%s' and '%s' at the same time",
876 refname
, extra_refname
);
881 strbuf_release(&dirname
);
885 struct packed_ref_cache
{
886 struct ref_entry
*root
;
889 * Count of references to the data structure in this instance,
890 * including the pointer from files_ref_store::packed if any.
891 * The data will not be freed as long as the reference count
894 unsigned int referrers
;
897 * Iff the packed-refs file associated with this instance is
898 * currently locked for writing, this points at the associated
899 * lock (which is owned by somebody else). The referrer count
900 * is also incremented when the file is locked and decremented
901 * when it is unlocked.
903 struct lock_file
*lock
;
905 /* The metadata from when this packed-refs cache was read */
906 struct stat_validity validity
;
910 * Future: need to be in "struct repository"
911 * when doing a full libification.
913 struct files_ref_store
{
914 struct ref_store base
;
915 struct ref_entry
*loose
;
916 struct packed_ref_cache
*packed
;
919 /* Lock used for the main packed-refs file: */
920 static struct lock_file packlock
;
923 * Increment the reference count of *packed_refs.
925 static void acquire_packed_ref_cache(struct packed_ref_cache
*packed_refs
)
927 packed_refs
->referrers
++;
931 * Decrease the reference count of *packed_refs. If it goes to zero,
932 * free *packed_refs and return true; otherwise return false.
934 static int release_packed_ref_cache(struct packed_ref_cache
*packed_refs
)
936 if (!--packed_refs
->referrers
) {
937 free_ref_entry(packed_refs
->root
);
938 stat_validity_clear(&packed_refs
->validity
);
946 static void clear_packed_ref_cache(struct files_ref_store
*refs
)
949 struct packed_ref_cache
*packed_refs
= refs
->packed
;
951 if (packed_refs
->lock
)
952 die("internal error: packed-ref cache cleared while locked");
954 release_packed_ref_cache(packed_refs
);
958 static void clear_loose_ref_cache(struct files_ref_store
*refs
)
961 free_ref_entry(refs
->loose
);
967 * Create a new submodule ref cache and add it to the internal
970 static struct ref_store
*files_ref_store_create(const char *submodule
)
972 struct files_ref_store
*refs
= xcalloc(1, sizeof(*refs
));
973 struct ref_store
*ref_store
= (struct ref_store
*)refs
;
975 base_ref_store_init(ref_store
, &refs_be_files
, submodule
);
981 * Downcast ref_store to files_ref_store. Die if ref_store is not a
982 * files_ref_store. If submodule_allowed is not true, then also die if
983 * files_ref_store is for a submodule (i.e., not for the main
984 * repository). caller is used in any necessary error messages.
986 static struct files_ref_store
*files_downcast(
987 struct ref_store
*ref_store
, int submodule_allowed
,
990 if (ref_store
->be
!= &refs_be_files
)
991 die("BUG: ref_store is type \"%s\" not \"files\" in %s",
992 ref_store
->be
->name
, caller
);
994 if (!submodule_allowed
)
995 assert_main_repository(ref_store
, caller
);
997 return (struct files_ref_store
*)ref_store
;
1000 /* The length of a peeled reference line in packed-refs, including EOL: */
1001 #define PEELED_LINE_LENGTH 42
1004 * The packed-refs header line that we write out. Perhaps other
1005 * traits will be added later. The trailing space is required.
1007 static const char PACKED_REFS_HEADER
[] =
1008 "# pack-refs with: peeled fully-peeled \n";
1011 * Parse one line from a packed-refs file. Write the SHA1 to sha1.
1012 * Return a pointer to the refname within the line (null-terminated),
1013 * or NULL if there was a problem.
1015 static const char *parse_ref_line(struct strbuf
*line
, unsigned char *sha1
)
1020 * 42: the answer to everything.
1022 * In this case, it happens to be the answer to
1023 * 40 (length of sha1 hex representation)
1024 * +1 (space in between hex and name)
1025 * +1 (newline at the end of the line)
1027 if (line
->len
<= 42)
1030 if (get_sha1_hex(line
->buf
, sha1
) < 0)
1032 if (!isspace(line
->buf
[40]))
1035 ref
= line
->buf
+ 41;
1039 if (line
->buf
[line
->len
- 1] != '\n')
1041 line
->buf
[--line
->len
] = 0;
1047 * Read f, which is a packed-refs file, into dir.
1049 * A comment line of the form "# pack-refs with: " may contain zero or
1050 * more traits. We interpret the traits as follows:
1054 * Probably no references are peeled. But if the file contains a
1055 * peeled value for a reference, we will use it.
1059 * References under "refs/tags/", if they *can* be peeled, *are*
1060 * peeled in this file. References outside of "refs/tags/" are
1061 * probably not peeled even if they could have been, but if we find
1062 * a peeled value for such a reference we will use it.
1066 * All references in the file that can be peeled are peeled.
1067 * Inversely (and this is more important), any references in the
1068 * file for which no peeled value is recorded is not peelable. This
1069 * trait should typically be written alongside "peeled" for
1070 * compatibility with older clients, but we do not require it
1071 * (i.e., "peeled" is a no-op if "fully-peeled" is set).
1073 static void read_packed_refs(FILE *f
, struct ref_dir
*dir
)
1075 struct ref_entry
*last
= NULL
;
1076 struct strbuf line
= STRBUF_INIT
;
1077 enum { PEELED_NONE
, PEELED_TAGS
, PEELED_FULLY
} peeled
= PEELED_NONE
;
1079 while (strbuf_getwholeline(&line
, f
, '\n') != EOF
) {
1080 unsigned char sha1
[20];
1081 const char *refname
;
1084 if (skip_prefix(line
.buf
, "# pack-refs with:", &traits
)) {
1085 if (strstr(traits
, " fully-peeled "))
1086 peeled
= PEELED_FULLY
;
1087 else if (strstr(traits
, " peeled "))
1088 peeled
= PEELED_TAGS
;
1089 /* perhaps other traits later as well */
1093 refname
= parse_ref_line(&line
, sha1
);
1095 int flag
= REF_ISPACKED
;
1097 if (check_refname_format(refname
, REFNAME_ALLOW_ONELEVEL
)) {
1098 if (!refname_is_safe(refname
))
1099 die("packed refname is dangerous: %s", refname
);
1101 flag
|= REF_BAD_NAME
| REF_ISBROKEN
;
1103 last
= create_ref_entry(refname
, sha1
, flag
, 0);
1104 if (peeled
== PEELED_FULLY
||
1105 (peeled
== PEELED_TAGS
&& starts_with(refname
, "refs/tags/")))
1106 last
->flag
|= REF_KNOWS_PEELED
;
1111 line
.buf
[0] == '^' &&
1112 line
.len
== PEELED_LINE_LENGTH
&&
1113 line
.buf
[PEELED_LINE_LENGTH
- 1] == '\n' &&
1114 !get_sha1_hex(line
.buf
+ 1, sha1
)) {
1115 hashcpy(last
->u
.value
.peeled
.hash
, sha1
);
1117 * Regardless of what the file header said,
1118 * we definitely know the value of *this*
1121 last
->flag
|= REF_KNOWS_PEELED
;
1125 strbuf_release(&line
);
1129 * Get the packed_ref_cache for the specified files_ref_store,
1130 * creating it if necessary.
1132 static struct packed_ref_cache
*get_packed_ref_cache(struct files_ref_store
*refs
)
1134 char *packed_refs_file
;
1136 if (*refs
->base
.submodule
)
1137 packed_refs_file
= git_pathdup_submodule(refs
->base
.submodule
,
1140 packed_refs_file
= git_pathdup("packed-refs");
1143 !stat_validity_check(&refs
->packed
->validity
, packed_refs_file
))
1144 clear_packed_ref_cache(refs
);
1146 if (!refs
->packed
) {
1149 refs
->packed
= xcalloc(1, sizeof(*refs
->packed
));
1150 acquire_packed_ref_cache(refs
->packed
);
1151 refs
->packed
->root
= create_dir_entry(refs
, "", 0, 0);
1152 f
= fopen(packed_refs_file
, "r");
1154 stat_validity_update(&refs
->packed
->validity
, fileno(f
));
1155 read_packed_refs(f
, get_ref_dir(refs
->packed
->root
));
1159 free(packed_refs_file
);
1160 return refs
->packed
;
1163 static struct ref_dir
*get_packed_ref_dir(struct packed_ref_cache
*packed_ref_cache
)
1165 return get_ref_dir(packed_ref_cache
->root
);
1168 static struct ref_dir
*get_packed_refs(struct files_ref_store
*refs
)
1170 return get_packed_ref_dir(get_packed_ref_cache(refs
));
1174 * Add a reference to the in-memory packed reference cache. This may
1175 * only be called while the packed-refs file is locked (see
1176 * lock_packed_refs()). To actually write the packed-refs file, call
1177 * commit_packed_refs().
1179 static void add_packed_ref(struct files_ref_store
*refs
,
1180 const char *refname
, const unsigned char *sha1
)
1182 struct packed_ref_cache
*packed_ref_cache
= get_packed_ref_cache(refs
);
1184 if (!packed_ref_cache
->lock
)
1185 die("internal error: packed refs not locked");
1186 add_ref(get_packed_ref_dir(packed_ref_cache
),
1187 create_ref_entry(refname
, sha1
, REF_ISPACKED
, 1));
1191 * Read the loose references from the namespace dirname into dir
1192 * (without recursing). dirname must end with '/'. dir must be the
1193 * directory entry corresponding to dirname.
1195 static void read_loose_refs(const char *dirname
, struct ref_dir
*dir
)
1197 struct files_ref_store
*refs
= dir
->ref_store
;
1200 int dirnamelen
= strlen(dirname
);
1201 struct strbuf refname
;
1202 struct strbuf path
= STRBUF_INIT
;
1203 size_t path_baselen
;
1206 if (*refs
->base
.submodule
)
1207 err
= strbuf_git_path_submodule(&path
, refs
->base
.submodule
, "%s", dirname
);
1209 strbuf_git_path(&path
, "%s", dirname
);
1210 path_baselen
= path
.len
;
1213 strbuf_release(&path
);
1217 d
= opendir(path
.buf
);
1219 strbuf_release(&path
);
1223 strbuf_init(&refname
, dirnamelen
+ 257);
1224 strbuf_add(&refname
, dirname
, dirnamelen
);
1226 while ((de
= readdir(d
)) != NULL
) {
1227 unsigned char sha1
[20];
1231 if (de
->d_name
[0] == '.')
1233 if (ends_with(de
->d_name
, ".lock"))
1235 strbuf_addstr(&refname
, de
->d_name
);
1236 strbuf_addstr(&path
, de
->d_name
);
1237 if (stat(path
.buf
, &st
) < 0) {
1238 ; /* silently ignore */
1239 } else if (S_ISDIR(st
.st_mode
)) {
1240 strbuf_addch(&refname
, '/');
1241 add_entry_to_dir(dir
,
1242 create_dir_entry(refs
, refname
.buf
,
1247 if (*refs
->base
.submodule
) {
1250 read_ok
= !resolve_gitlink_ref(refs
->base
.submodule
,
1253 read_ok
= !read_ref_full(refname
.buf
,
1254 RESOLVE_REF_READING
,
1260 flag
|= REF_ISBROKEN
;
1261 } else if (is_null_sha1(sha1
)) {
1263 * It is so astronomically unlikely
1264 * that NULL_SHA1 is the SHA-1 of an
1265 * actual object that we consider its
1266 * appearance in a loose reference
1267 * file to be repo corruption
1268 * (probably due to a software bug).
1270 flag
|= REF_ISBROKEN
;
1273 if (check_refname_format(refname
.buf
,
1274 REFNAME_ALLOW_ONELEVEL
)) {
1275 if (!refname_is_safe(refname
.buf
))
1276 die("loose refname is dangerous: %s", refname
.buf
);
1278 flag
|= REF_BAD_NAME
| REF_ISBROKEN
;
1280 add_entry_to_dir(dir
,
1281 create_ref_entry(refname
.buf
, sha1
, flag
, 0));
1283 strbuf_setlen(&refname
, dirnamelen
);
1284 strbuf_setlen(&path
, path_baselen
);
1286 strbuf_release(&refname
);
1287 strbuf_release(&path
);
1291 static struct ref_dir
*get_loose_refs(struct files_ref_store
*refs
)
1295 * Mark the top-level directory complete because we
1296 * are about to read the only subdirectory that can
1299 refs
->loose
= create_dir_entry(refs
, "", 0, 0);
1301 * Create an incomplete entry for "refs/":
1303 add_entry_to_dir(get_ref_dir(refs
->loose
),
1304 create_dir_entry(refs
, "refs/", 5, 1));
1306 return get_ref_dir(refs
->loose
);
1310 * Return the ref_entry for the given refname from the packed
1311 * references. If it does not exist, return NULL.
1313 static struct ref_entry
*get_packed_ref(struct files_ref_store
*refs
,
1314 const char *refname
)
1316 return find_ref(get_packed_refs(refs
), refname
);
1320 * A loose ref file doesn't exist; check for a packed ref.
1322 static int resolve_packed_ref(struct files_ref_store
*refs
,
1323 const char *refname
,
1324 unsigned char *sha1
, unsigned int *flags
)
1326 struct ref_entry
*entry
;
1329 * The loose reference file does not exist; check for a packed
1332 entry
= get_packed_ref(refs
, refname
);
1334 hashcpy(sha1
, entry
->u
.value
.oid
.hash
);
1335 *flags
|= REF_ISPACKED
;
1338 /* refname is not a packed reference. */
1342 static int files_read_raw_ref(struct ref_store
*ref_store
,
1343 const char *refname
, unsigned char *sha1
,
1344 struct strbuf
*referent
, unsigned int *type
)
1346 struct files_ref_store
*refs
=
1347 files_downcast(ref_store
, 1, "read_raw_ref");
1348 struct strbuf sb_contents
= STRBUF_INIT
;
1349 struct strbuf sb_path
= STRBUF_INIT
;
1356 int remaining_retries
= 3;
1359 strbuf_reset(&sb_path
);
1361 if (*refs
->base
.submodule
)
1362 strbuf_git_path_submodule(&sb_path
, refs
->base
.submodule
, "%s", refname
);
1364 strbuf_git_path(&sb_path
, "%s", refname
);
1370 * We might have to loop back here to avoid a race
1371 * condition: first we lstat() the file, then we try
1372 * to read it as a link or as a file. But if somebody
1373 * changes the type of the file (file <-> directory
1374 * <-> symlink) between the lstat() and reading, then
1375 * we don't want to report that as an error but rather
1376 * try again starting with the lstat().
1378 * We'll keep a count of the retries, though, just to avoid
1379 * any confusing situation sending us into an infinite loop.
1382 if (remaining_retries
-- <= 0)
1385 if (lstat(path
, &st
) < 0) {
1386 if (errno
!= ENOENT
)
1388 if (resolve_packed_ref(refs
, refname
, sha1
, type
)) {
1396 /* Follow "normalized" - ie "refs/.." symlinks by hand */
1397 if (S_ISLNK(st
.st_mode
)) {
1398 strbuf_reset(&sb_contents
);
1399 if (strbuf_readlink(&sb_contents
, path
, 0) < 0) {
1400 if (errno
== ENOENT
|| errno
== EINVAL
)
1401 /* inconsistent with lstat; retry */
1406 if (starts_with(sb_contents
.buf
, "refs/") &&
1407 !check_refname_format(sb_contents
.buf
, 0)) {
1408 strbuf_swap(&sb_contents
, referent
);
1409 *type
|= REF_ISSYMREF
;
1414 * It doesn't look like a refname; fall through to just
1415 * treating it like a non-symlink, and reading whatever it
1420 /* Is it a directory? */
1421 if (S_ISDIR(st
.st_mode
)) {
1423 * Even though there is a directory where the loose
1424 * ref is supposed to be, there could still be a
1427 if (resolve_packed_ref(refs
, refname
, sha1
, type
)) {
1436 * Anything else, just open it and try to use it as
1439 fd
= open(path
, O_RDONLY
);
1441 if (errno
== ENOENT
&& !S_ISLNK(st
.st_mode
))
1442 /* inconsistent with lstat; retry */
1447 strbuf_reset(&sb_contents
);
1448 if (strbuf_read(&sb_contents
, fd
, 256) < 0) {
1449 int save_errno
= errno
;
1455 strbuf_rtrim(&sb_contents
);
1456 buf
= sb_contents
.buf
;
1457 if (starts_with(buf
, "ref:")) {
1459 while (isspace(*buf
))
1462 strbuf_reset(referent
);
1463 strbuf_addstr(referent
, buf
);
1464 *type
|= REF_ISSYMREF
;
1470 * Please note that FETCH_HEAD has additional
1471 * data after the sha.
1473 if (get_sha1_hex(buf
, sha1
) ||
1474 (buf
[40] != '\0' && !isspace(buf
[40]))) {
1475 *type
|= REF_ISBROKEN
;
1484 strbuf_release(&sb_path
);
1485 strbuf_release(&sb_contents
);
1490 static void unlock_ref(struct ref_lock
*lock
)
1492 /* Do not free lock->lk -- atexit() still looks at them */
1494 rollback_lock_file(lock
->lk
);
1495 free(lock
->ref_name
);
1500 * Lock refname, without following symrefs, and set *lock_p to point
1501 * at a newly-allocated lock object. Fill in lock->old_oid, referent,
1502 * and type similarly to read_raw_ref().
1504 * The caller must verify that refname is a "safe" reference name (in
1505 * the sense of refname_is_safe()) before calling this function.
1507 * If the reference doesn't already exist, verify that refname doesn't
1508 * have a D/F conflict with any existing references. extras and skip
1509 * are passed to verify_refname_available_dir() for this check.
1511 * If mustexist is not set and the reference is not found or is
1512 * broken, lock the reference anyway but clear sha1.
1514 * Return 0 on success. On failure, write an error message to err and
1515 * return TRANSACTION_NAME_CONFLICT or TRANSACTION_GENERIC_ERROR.
1517 * Implementation note: This function is basically
1522 * but it includes a lot more code to
1523 * - Deal with possible races with other processes
1524 * - Avoid calling verify_refname_available_dir() when it can be
1525 * avoided, namely if we were successfully able to read the ref
1526 * - Generate informative error messages in the case of failure
1528 static int lock_raw_ref(struct files_ref_store
*refs
,
1529 const char *refname
, int mustexist
,
1530 const struct string_list
*extras
,
1531 const struct string_list
*skip
,
1532 struct ref_lock
**lock_p
,
1533 struct strbuf
*referent
,
1537 struct ref_lock
*lock
;
1538 struct strbuf ref_file
= STRBUF_INIT
;
1539 int attempts_remaining
= 3;
1540 int ret
= TRANSACTION_GENERIC_ERROR
;
1543 assert_main_repository(&refs
->base
, "lock_raw_ref");
1547 /* First lock the file so it can't change out from under us. */
1549 *lock_p
= lock
= xcalloc(1, sizeof(*lock
));
1551 lock
->ref_name
= xstrdup(refname
);
1552 strbuf_git_path(&ref_file
, "%s", refname
);
1555 switch (safe_create_leading_directories(ref_file
.buf
)) {
1557 break; /* success */
1560 * Suppose refname is "refs/foo/bar". We just failed
1561 * to create the containing directory, "refs/foo",
1562 * because there was a non-directory in the way. This
1563 * indicates a D/F conflict, probably because of
1564 * another reference such as "refs/foo". There is no
1565 * reason to expect this error to be transitory.
1567 if (verify_refname_available(refname
, extras
, skip
, err
)) {
1570 * To the user the relevant error is
1571 * that the "mustexist" reference is
1575 strbuf_addf(err
, "unable to resolve reference '%s'",
1579 * The error message set by
1580 * verify_refname_available_dir() is OK.
1582 ret
= TRANSACTION_NAME_CONFLICT
;
1586 * The file that is in the way isn't a loose
1587 * reference. Report it as a low-level
1590 strbuf_addf(err
, "unable to create lock file %s.lock; "
1591 "non-directory in the way",
1596 /* Maybe another process was tidying up. Try again. */
1597 if (--attempts_remaining
> 0)
1601 strbuf_addf(err
, "unable to create directory for %s",
1607 lock
->lk
= xcalloc(1, sizeof(struct lock_file
));
1609 if (hold_lock_file_for_update(lock
->lk
, ref_file
.buf
, LOCK_NO_DEREF
) < 0) {
1610 if (errno
== ENOENT
&& --attempts_remaining
> 0) {
1612 * Maybe somebody just deleted one of the
1613 * directories leading to ref_file. Try
1618 unable_to_lock_message(ref_file
.buf
, errno
, err
);
1624 * Now we hold the lock and can read the reference without
1625 * fear that its value will change.
1628 if (files_read_raw_ref(&refs
->base
, refname
,
1629 lock
->old_oid
.hash
, referent
, type
)) {
1630 if (errno
== ENOENT
) {
1632 /* Garden variety missing reference. */
1633 strbuf_addf(err
, "unable to resolve reference '%s'",
1638 * Reference is missing, but that's OK. We
1639 * know that there is not a conflict with
1640 * another loose reference because
1641 * (supposing that we are trying to lock
1642 * reference "refs/foo/bar"):
1644 * - We were successfully able to create
1645 * the lockfile refs/foo/bar.lock, so we
1646 * know there cannot be a loose reference
1649 * - We got ENOENT and not EISDIR, so we
1650 * know that there cannot be a loose
1651 * reference named "refs/foo/bar/baz".
1654 } else if (errno
== EISDIR
) {
1656 * There is a directory in the way. It might have
1657 * contained references that have been deleted. If
1658 * we don't require that the reference already
1659 * exists, try to remove the directory so that it
1660 * doesn't cause trouble when we want to rename the
1661 * lockfile into place later.
1664 /* Garden variety missing reference. */
1665 strbuf_addf(err
, "unable to resolve reference '%s'",
1668 } else if (remove_dir_recursively(&ref_file
,
1669 REMOVE_DIR_EMPTY_ONLY
)) {
1670 if (verify_refname_available_dir(
1671 refname
, extras
, skip
,
1672 get_loose_refs(refs
),
1675 * The error message set by
1676 * verify_refname_available() is OK.
1678 ret
= TRANSACTION_NAME_CONFLICT
;
1682 * We can't delete the directory,
1683 * but we also don't know of any
1684 * references that it should
1687 strbuf_addf(err
, "there is a non-empty directory '%s' "
1688 "blocking reference '%s'",
1689 ref_file
.buf
, refname
);
1693 } else if (errno
== EINVAL
&& (*type
& REF_ISBROKEN
)) {
1694 strbuf_addf(err
, "unable to resolve reference '%s': "
1695 "reference broken", refname
);
1698 strbuf_addf(err
, "unable to resolve reference '%s': %s",
1699 refname
, strerror(errno
));
1704 * If the ref did not exist and we are creating it,
1705 * make sure there is no existing packed ref whose
1706 * name begins with our refname, nor a packed ref
1707 * whose name is a proper prefix of our refname.
1709 if (verify_refname_available_dir(
1710 refname
, extras
, skip
,
1711 get_packed_refs(refs
),
1725 strbuf_release(&ref_file
);
1730 * Peel the entry (if possible) and return its new peel_status. If
1731 * repeel is true, re-peel the entry even if there is an old peeled
1732 * value that is already stored in it.
1734 * It is OK to call this function with a packed reference entry that
1735 * might be stale and might even refer to an object that has since
1736 * been garbage-collected. In such a case, if the entry has
1737 * REF_KNOWS_PEELED then leave the status unchanged and return
1738 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.
1740 static enum peel_status
peel_entry(struct ref_entry
*entry
, int repeel
)
1742 enum peel_status status
;
1744 if (entry
->flag
& REF_KNOWS_PEELED
) {
1746 entry
->flag
&= ~REF_KNOWS_PEELED
;
1747 oidclr(&entry
->u
.value
.peeled
);
1749 return is_null_oid(&entry
->u
.value
.peeled
) ?
1750 PEEL_NON_TAG
: PEEL_PEELED
;
1753 if (entry
->flag
& REF_ISBROKEN
)
1755 if (entry
->flag
& REF_ISSYMREF
)
1756 return PEEL_IS_SYMREF
;
1758 status
= peel_object(entry
->u
.value
.oid
.hash
, entry
->u
.value
.peeled
.hash
);
1759 if (status
== PEEL_PEELED
|| status
== PEEL_NON_TAG
)
1760 entry
->flag
|= REF_KNOWS_PEELED
;
1764 static int files_peel_ref(struct ref_store
*ref_store
,
1765 const char *refname
, unsigned char *sha1
)
1767 struct files_ref_store
*refs
= files_downcast(ref_store
, 0, "peel_ref");
1769 unsigned char base
[20];
1771 if (current_ref_iter
&& current_ref_iter
->refname
== refname
) {
1772 struct object_id peeled
;
1774 if (ref_iterator_peel(current_ref_iter
, &peeled
))
1776 hashcpy(sha1
, peeled
.hash
);
1780 if (read_ref_full(refname
, RESOLVE_REF_READING
, base
, &flag
))
1784 * If the reference is packed, read its ref_entry from the
1785 * cache in the hope that we already know its peeled value.
1786 * We only try this optimization on packed references because
1787 * (a) forcing the filling of the loose reference cache could
1788 * be expensive and (b) loose references anyway usually do not
1789 * have REF_KNOWS_PEELED.
1791 if (flag
& REF_ISPACKED
) {
1792 struct ref_entry
*r
= get_packed_ref(refs
, refname
);
1794 if (peel_entry(r
, 0))
1796 hashcpy(sha1
, r
->u
.value
.peeled
.hash
);
1801 return peel_object(base
, sha1
);
1804 struct files_ref_iterator
{
1805 struct ref_iterator base
;
1807 struct packed_ref_cache
*packed_ref_cache
;
1808 struct ref_iterator
*iter0
;
1812 static int files_ref_iterator_advance(struct ref_iterator
*ref_iterator
)
1814 struct files_ref_iterator
*iter
=
1815 (struct files_ref_iterator
*)ref_iterator
;
1818 while ((ok
= ref_iterator_advance(iter
->iter0
)) == ITER_OK
) {
1819 if (iter
->flags
& DO_FOR_EACH_PER_WORKTREE_ONLY
&&
1820 ref_type(iter
->iter0
->refname
) != REF_TYPE_PER_WORKTREE
)
1823 if (!(iter
->flags
& DO_FOR_EACH_INCLUDE_BROKEN
) &&
1824 !ref_resolves_to_object(iter
->iter0
->refname
,
1826 iter
->iter0
->flags
))
1829 iter
->base
.refname
= iter
->iter0
->refname
;
1830 iter
->base
.oid
= iter
->iter0
->oid
;
1831 iter
->base
.flags
= iter
->iter0
->flags
;
1836 if (ref_iterator_abort(ref_iterator
) != ITER_DONE
)
1842 static int files_ref_iterator_peel(struct ref_iterator
*ref_iterator
,
1843 struct object_id
*peeled
)
1845 struct files_ref_iterator
*iter
=
1846 (struct files_ref_iterator
*)ref_iterator
;
1848 return ref_iterator_peel(iter
->iter0
, peeled
);
1851 static int files_ref_iterator_abort(struct ref_iterator
*ref_iterator
)
1853 struct files_ref_iterator
*iter
=
1854 (struct files_ref_iterator
*)ref_iterator
;
1858 ok
= ref_iterator_abort(iter
->iter0
);
1860 release_packed_ref_cache(iter
->packed_ref_cache
);
1861 base_ref_iterator_free(ref_iterator
);
1865 static struct ref_iterator_vtable files_ref_iterator_vtable
= {
1866 files_ref_iterator_advance
,
1867 files_ref_iterator_peel
,
1868 files_ref_iterator_abort
1871 static struct ref_iterator
*files_ref_iterator_begin(
1872 struct ref_store
*ref_store
,
1873 const char *prefix
, unsigned int flags
)
1875 struct files_ref_store
*refs
=
1876 files_downcast(ref_store
, 1, "ref_iterator_begin");
1877 struct ref_dir
*loose_dir
, *packed_dir
;
1878 struct ref_iterator
*loose_iter
, *packed_iter
;
1879 struct files_ref_iterator
*iter
;
1880 struct ref_iterator
*ref_iterator
;
1883 return empty_ref_iterator_begin();
1885 if (ref_paranoia
< 0)
1886 ref_paranoia
= git_env_bool("GIT_REF_PARANOIA", 0);
1888 flags
|= DO_FOR_EACH_INCLUDE_BROKEN
;
1890 iter
= xcalloc(1, sizeof(*iter
));
1891 ref_iterator
= &iter
->base
;
1892 base_ref_iterator_init(ref_iterator
, &files_ref_iterator_vtable
);
1895 * We must make sure that all loose refs are read before
1896 * accessing the packed-refs file; this avoids a race
1897 * condition if loose refs are migrated to the packed-refs
1898 * file by a simultaneous process, but our in-memory view is
1899 * from before the migration. We ensure this as follows:
1900 * First, we call prime_ref_dir(), which pre-reads the loose
1901 * references for the subtree into the cache. (If they've
1902 * already been read, that's OK; we only need to guarantee
1903 * that they're read before the packed refs, not *how much*
1904 * before.) After that, we call get_packed_ref_cache(), which
1905 * internally checks whether the packed-ref cache is up to
1906 * date with what is on disk, and re-reads it if not.
1909 loose_dir
= get_loose_refs(refs
);
1911 if (prefix
&& *prefix
)
1912 loose_dir
= find_containing_dir(loose_dir
, prefix
, 0);
1915 prime_ref_dir(loose_dir
);
1916 loose_iter
= cache_ref_iterator_begin(loose_dir
);
1918 /* There's nothing to iterate over. */
1919 loose_iter
= empty_ref_iterator_begin();
1922 iter
->packed_ref_cache
= get_packed_ref_cache(refs
);
1923 acquire_packed_ref_cache(iter
->packed_ref_cache
);
1924 packed_dir
= get_packed_ref_dir(iter
->packed_ref_cache
);
1926 if (prefix
&& *prefix
)
1927 packed_dir
= find_containing_dir(packed_dir
, prefix
, 0);
1930 packed_iter
= cache_ref_iterator_begin(packed_dir
);
1932 /* There's nothing to iterate over. */
1933 packed_iter
= empty_ref_iterator_begin();
1936 iter
->iter0
= overlay_ref_iterator_begin(loose_iter
, packed_iter
);
1937 iter
->flags
= flags
;
1939 return ref_iterator
;
1943 * Verify that the reference locked by lock has the value old_sha1.
1944 * Fail if the reference doesn't exist and mustexist is set. Return 0
1945 * on success. On error, write an error message to err, set errno, and
1946 * return a negative value.
1948 static int verify_lock(struct ref_lock
*lock
,
1949 const unsigned char *old_sha1
, int mustexist
,
1954 if (read_ref_full(lock
->ref_name
,
1955 mustexist
? RESOLVE_REF_READING
: 0,
1956 lock
->old_oid
.hash
, NULL
)) {
1958 int save_errno
= errno
;
1959 strbuf_addf(err
, "can't verify ref '%s'", lock
->ref_name
);
1963 oidclr(&lock
->old_oid
);
1967 if (old_sha1
&& hashcmp(lock
->old_oid
.hash
, old_sha1
)) {
1968 strbuf_addf(err
, "ref '%s' is at %s but expected %s",
1970 oid_to_hex(&lock
->old_oid
),
1971 sha1_to_hex(old_sha1
));
1978 static int remove_empty_directories(struct strbuf
*path
)
1981 * we want to create a file but there is a directory there;
1982 * if that is an empty directory (or a directory that contains
1983 * only empty directories), remove them.
1985 return remove_dir_recursively(path
, REMOVE_DIR_EMPTY_ONLY
);
1989 * Locks a ref returning the lock on success and NULL on failure.
1990 * On failure errno is set to something meaningful.
1992 static struct ref_lock
*lock_ref_sha1_basic(struct files_ref_store
*refs
,
1993 const char *refname
,
1994 const unsigned char *old_sha1
,
1995 const struct string_list
*extras
,
1996 const struct string_list
*skip
,
1997 unsigned int flags
, int *type
,
2000 struct strbuf ref_file
= STRBUF_INIT
;
2001 struct ref_lock
*lock
;
2003 int lflags
= LOCK_NO_DEREF
;
2004 int mustexist
= (old_sha1
&& !is_null_sha1(old_sha1
));
2005 int resolve_flags
= RESOLVE_REF_NO_RECURSE
;
2006 int attempts_remaining
= 3;
2009 assert_main_repository(&refs
->base
, "lock_ref_sha1_basic");
2012 lock
= xcalloc(1, sizeof(struct ref_lock
));
2015 resolve_flags
|= RESOLVE_REF_READING
;
2016 if (flags
& REF_DELETING
)
2017 resolve_flags
|= RESOLVE_REF_ALLOW_BAD_NAME
;
2019 strbuf_git_path(&ref_file
, "%s", refname
);
2020 resolved
= !!resolve_ref_unsafe(refname
, resolve_flags
,
2021 lock
->old_oid
.hash
, type
);
2022 if (!resolved
&& errno
== EISDIR
) {
2024 * we are trying to lock foo but we used to
2025 * have foo/bar which now does not exist;
2026 * it is normal for the empty directory 'foo'
2029 if (remove_empty_directories(&ref_file
)) {
2031 if (!verify_refname_available_dir(
2032 refname
, extras
, skip
,
2033 get_loose_refs(refs
), err
))
2034 strbuf_addf(err
, "there are still refs under '%s'",
2038 resolved
= !!resolve_ref_unsafe(refname
, resolve_flags
,
2039 lock
->old_oid
.hash
, type
);
2043 if (last_errno
!= ENOTDIR
||
2044 !verify_refname_available_dir(
2045 refname
, extras
, skip
,
2046 get_loose_refs(refs
), err
))
2047 strbuf_addf(err
, "unable to resolve reference '%s': %s",
2048 refname
, strerror(last_errno
));
2054 * If the ref did not exist and we are creating it, make sure
2055 * there is no existing packed ref whose name begins with our
2056 * refname, nor a packed ref whose name is a proper prefix of
2059 if (is_null_oid(&lock
->old_oid
) &&
2060 verify_refname_available_dir(refname
, extras
, skip
,
2061 get_packed_refs(refs
),
2063 last_errno
= ENOTDIR
;
2067 lock
->lk
= xcalloc(1, sizeof(struct lock_file
));
2069 lock
->ref_name
= xstrdup(refname
);
2072 switch (safe_create_leading_directories_const(ref_file
.buf
)) {
2074 break; /* success */
2076 if (--attempts_remaining
> 0)
2081 strbuf_addf(err
, "unable to create directory for '%s'",
2086 if (hold_lock_file_for_update(lock
->lk
, ref_file
.buf
, lflags
) < 0) {
2088 if (errno
== ENOENT
&& --attempts_remaining
> 0)
2090 * Maybe somebody just deleted one of the
2091 * directories leading to ref_file. Try
2096 unable_to_lock_message(ref_file
.buf
, errno
, err
);
2100 if (verify_lock(lock
, old_sha1
, mustexist
, err
)) {
2111 strbuf_release(&ref_file
);
2117 * Write an entry to the packed-refs file for the specified refname.
2118 * If peeled is non-NULL, write it as the entry's peeled value.
2120 static void write_packed_entry(FILE *fh
, char *refname
, unsigned char *sha1
,
2121 unsigned char *peeled
)
2123 fprintf_or_die(fh
, "%s %s\n", sha1_to_hex(sha1
), refname
);
2125 fprintf_or_die(fh
, "^%s\n", sha1_to_hex(peeled
));
2129 * An each_ref_entry_fn that writes the entry to a packed-refs file.
2131 static int write_packed_entry_fn(struct ref_entry
*entry
, void *cb_data
)
2133 enum peel_status peel_status
= peel_entry(entry
, 0);
2135 if (peel_status
!= PEEL_PEELED
&& peel_status
!= PEEL_NON_TAG
)
2136 error("internal error: %s is not a valid packed reference!",
2138 write_packed_entry(cb_data
, entry
->name
, entry
->u
.value
.oid
.hash
,
2139 peel_status
== PEEL_PEELED
?
2140 entry
->u
.value
.peeled
.hash
: NULL
);
2145 * Lock the packed-refs file for writing. Flags is passed to
2146 * hold_lock_file_for_update(). Return 0 on success. On errors, set
2147 * errno appropriately and return a nonzero value.
2149 static int lock_packed_refs(struct files_ref_store
*refs
, int flags
)
2151 static int timeout_configured
= 0;
2152 static int timeout_value
= 1000;
2153 struct packed_ref_cache
*packed_ref_cache
;
2155 assert_main_repository(&refs
->base
, "lock_packed_refs");
2157 if (!timeout_configured
) {
2158 git_config_get_int("core.packedrefstimeout", &timeout_value
);
2159 timeout_configured
= 1;
2162 if (hold_lock_file_for_update_timeout(
2163 &packlock
, git_path("packed-refs"),
2164 flags
, timeout_value
) < 0)
2167 * Get the current packed-refs while holding the lock. If the
2168 * packed-refs file has been modified since we last read it,
2169 * this will automatically invalidate the cache and re-read
2170 * the packed-refs file.
2172 packed_ref_cache
= get_packed_ref_cache(refs
);
2173 packed_ref_cache
->lock
= &packlock
;
2174 /* Increment the reference count to prevent it from being freed: */
2175 acquire_packed_ref_cache(packed_ref_cache
);
2180 * Write the current version of the packed refs cache from memory to
2181 * disk. The packed-refs file must already be locked for writing (see
2182 * lock_packed_refs()). Return zero on success. On errors, set errno
2183 * and return a nonzero value
2185 static int commit_packed_refs(struct files_ref_store
*refs
)
2187 struct packed_ref_cache
*packed_ref_cache
=
2188 get_packed_ref_cache(refs
);
2193 assert_main_repository(&refs
->base
, "commit_packed_refs");
2195 if (!packed_ref_cache
->lock
)
2196 die("internal error: packed-refs not locked");
2198 out
= fdopen_lock_file(packed_ref_cache
->lock
, "w");
2200 die_errno("unable to fdopen packed-refs descriptor");
2202 fprintf_or_die(out
, "%s", PACKED_REFS_HEADER
);
2203 do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache
),
2204 0, write_packed_entry_fn
, out
);
2206 if (commit_lock_file(packed_ref_cache
->lock
)) {
2210 packed_ref_cache
->lock
= NULL
;
2211 release_packed_ref_cache(packed_ref_cache
);
2217 * Rollback the lockfile for the packed-refs file, and discard the
2218 * in-memory packed reference cache. (The packed-refs file will be
2219 * read anew if it is needed again after this function is called.)
2221 static void rollback_packed_refs(struct files_ref_store
*refs
)
2223 struct packed_ref_cache
*packed_ref_cache
=
2224 get_packed_ref_cache(refs
);
2226 assert_main_repository(&refs
->base
, "rollback_packed_refs");
2228 if (!packed_ref_cache
->lock
)
2229 die("internal error: packed-refs not locked");
2230 rollback_lock_file(packed_ref_cache
->lock
);
2231 packed_ref_cache
->lock
= NULL
;
2232 release_packed_ref_cache(packed_ref_cache
);
2233 clear_packed_ref_cache(refs
);
2236 struct ref_to_prune
{
2237 struct ref_to_prune
*next
;
2238 unsigned char sha1
[20];
2239 char name
[FLEX_ARRAY
];
2242 struct pack_refs_cb_data
{
2244 struct ref_dir
*packed_refs
;
2245 struct ref_to_prune
*ref_to_prune
;
2249 * An each_ref_entry_fn that is run over loose references only. If
2250 * the loose reference can be packed, add an entry in the packed ref
2251 * cache. If the reference should be pruned, also add it to
2252 * ref_to_prune in the pack_refs_cb_data.
2254 static int pack_if_possible_fn(struct ref_entry
*entry
, void *cb_data
)
2256 struct pack_refs_cb_data
*cb
= cb_data
;
2257 enum peel_status peel_status
;
2258 struct ref_entry
*packed_entry
;
2259 int is_tag_ref
= starts_with(entry
->name
, "refs/tags/");
2261 /* Do not pack per-worktree refs: */
2262 if (ref_type(entry
->name
) != REF_TYPE_NORMAL
)
2265 /* ALWAYS pack tags */
2266 if (!(cb
->flags
& PACK_REFS_ALL
) && !is_tag_ref
)
2269 /* Do not pack symbolic or broken refs: */
2270 if ((entry
->flag
& REF_ISSYMREF
) || !entry_resolves_to_object(entry
))
2273 /* Add a packed ref cache entry equivalent to the loose entry. */
2274 peel_status
= peel_entry(entry
, 1);
2275 if (peel_status
!= PEEL_PEELED
&& peel_status
!= PEEL_NON_TAG
)
2276 die("internal error peeling reference %s (%s)",
2277 entry
->name
, oid_to_hex(&entry
->u
.value
.oid
));
2278 packed_entry
= find_ref(cb
->packed_refs
, entry
->name
);
2280 /* Overwrite existing packed entry with info from loose entry */
2281 packed_entry
->flag
= REF_ISPACKED
| REF_KNOWS_PEELED
;
2282 oidcpy(&packed_entry
->u
.value
.oid
, &entry
->u
.value
.oid
);
2284 packed_entry
= create_ref_entry(entry
->name
, entry
->u
.value
.oid
.hash
,
2285 REF_ISPACKED
| REF_KNOWS_PEELED
, 0);
2286 add_ref(cb
->packed_refs
, packed_entry
);
2288 oidcpy(&packed_entry
->u
.value
.peeled
, &entry
->u
.value
.peeled
);
2290 /* Schedule the loose reference for pruning if requested. */
2291 if ((cb
->flags
& PACK_REFS_PRUNE
)) {
2292 struct ref_to_prune
*n
;
2293 FLEX_ALLOC_STR(n
, name
, entry
->name
);
2294 hashcpy(n
->sha1
, entry
->u
.value
.oid
.hash
);
2295 n
->next
= cb
->ref_to_prune
;
2296 cb
->ref_to_prune
= n
;
2302 * Remove empty parents, but spare refs/ and immediate subdirs.
2303 * Note: munges *name.
2305 static void try_remove_empty_parents(char *name
)
2310 for (i
= 0; i
< 2; i
++) { /* refs/{heads,tags,...}/ */
2311 while (*p
&& *p
!= '/')
2313 /* tolerate duplicate slashes; see check_refname_format() */
2317 for (q
= p
; *q
; q
++)
2320 while (q
> p
&& *q
!= '/')
2322 while (q
> p
&& *(q
-1) == '/')
2327 if (rmdir(git_path("%s", name
)))
2332 /* make sure nobody touched the ref, and unlink */
2333 static void prune_ref(struct ref_to_prune
*r
)
2335 struct ref_transaction
*transaction
;
2336 struct strbuf err
= STRBUF_INIT
;
2338 if (check_refname_format(r
->name
, 0))
2341 transaction
= ref_transaction_begin(&err
);
2343 ref_transaction_delete(transaction
, r
->name
, r
->sha1
,
2344 REF_ISPRUNING
| REF_NODEREF
, NULL
, &err
) ||
2345 ref_transaction_commit(transaction
, &err
)) {
2346 ref_transaction_free(transaction
);
2347 error("%s", err
.buf
);
2348 strbuf_release(&err
);
2351 ref_transaction_free(transaction
);
2352 strbuf_release(&err
);
2353 try_remove_empty_parents(r
->name
);
2356 static void prune_refs(struct ref_to_prune
*r
)
2364 static int files_pack_refs(struct ref_store
*ref_store
, unsigned int flags
)
2366 struct files_ref_store
*refs
=
2367 files_downcast(ref_store
, 0, "pack_refs");
2368 struct pack_refs_cb_data cbdata
;
2370 memset(&cbdata
, 0, sizeof(cbdata
));
2371 cbdata
.flags
= flags
;
2373 lock_packed_refs(refs
, LOCK_DIE_ON_ERROR
);
2374 cbdata
.packed_refs
= get_packed_refs(refs
);
2376 do_for_each_entry_in_dir(get_loose_refs(refs
), 0,
2377 pack_if_possible_fn
, &cbdata
);
2379 if (commit_packed_refs(refs
))
2380 die_errno("unable to overwrite old ref-pack file");
2382 prune_refs(cbdata
.ref_to_prune
);
2387 * Rewrite the packed-refs file, omitting any refs listed in
2388 * 'refnames'. On error, leave packed-refs unchanged, write an error
2389 * message to 'err', and return a nonzero value.
2391 * The refs in 'refnames' needn't be sorted. `err` must not be NULL.
2393 static int repack_without_refs(struct files_ref_store
*refs
,
2394 struct string_list
*refnames
, struct strbuf
*err
)
2396 struct ref_dir
*packed
;
2397 struct string_list_item
*refname
;
2398 int ret
, needs_repacking
= 0, removed
= 0;
2400 assert_main_repository(&refs
->base
, "repack_without_refs");
2403 /* Look for a packed ref */
2404 for_each_string_list_item(refname
, refnames
) {
2405 if (get_packed_ref(refs
, refname
->string
)) {
2406 needs_repacking
= 1;
2411 /* Avoid locking if we have nothing to do */
2412 if (!needs_repacking
)
2413 return 0; /* no refname exists in packed refs */
2415 if (lock_packed_refs(refs
, 0)) {
2416 unable_to_lock_message(git_path("packed-refs"), errno
, err
);
2419 packed
= get_packed_refs(refs
);
2421 /* Remove refnames from the cache */
2422 for_each_string_list_item(refname
, refnames
)
2423 if (remove_entry(packed
, refname
->string
) != -1)
2427 * All packed entries disappeared while we were
2428 * acquiring the lock.
2430 rollback_packed_refs(refs
);
2434 /* Write what remains */
2435 ret
= commit_packed_refs(refs
);
2437 strbuf_addf(err
, "unable to overwrite old ref-pack file: %s",
2442 static int delete_ref_loose(struct ref_lock
*lock
, int flag
, struct strbuf
*err
)
2446 if (!(flag
& REF_ISPACKED
) || flag
& REF_ISSYMREF
) {
2448 * loose. The loose file name is the same as the
2449 * lockfile name, minus ".lock":
2451 char *loose_filename
= get_locked_file_path(lock
->lk
);
2452 int res
= unlink_or_msg(loose_filename
, err
);
2453 free(loose_filename
);
2460 static int files_delete_refs(struct ref_store
*ref_store
,
2461 struct string_list
*refnames
, unsigned int flags
)
2463 struct files_ref_store
*refs
=
2464 files_downcast(ref_store
, 0, "delete_refs");
2465 struct strbuf err
= STRBUF_INIT
;
2471 result
= repack_without_refs(refs
, refnames
, &err
);
2474 * If we failed to rewrite the packed-refs file, then
2475 * it is unsafe to try to remove loose refs, because
2476 * doing so might expose an obsolete packed value for
2477 * a reference that might even point at an object that
2478 * has been garbage collected.
2480 if (refnames
->nr
== 1)
2481 error(_("could not delete reference %s: %s"),
2482 refnames
->items
[0].string
, err
.buf
);
2484 error(_("could not delete references: %s"), err
.buf
);
2489 for (i
= 0; i
< refnames
->nr
; i
++) {
2490 const char *refname
= refnames
->items
[i
].string
;
2492 if (delete_ref(refname
, NULL
, flags
))
2493 result
|= error(_("could not remove reference %s"), refname
);
2497 strbuf_release(&err
);
2502 * People using contrib's git-new-workdir have .git/logs/refs ->
2503 * /some/other/path/.git/logs/refs, and that may live on another device.
2505 * IOW, to avoid cross device rename errors, the temporary renamed log must
2506 * live into logs/refs.
2508 #define TMP_RENAMED_LOG "logs/refs/.tmp-renamed-log"
2510 static int rename_tmp_log(const char *newrefname
)
2512 int attempts_remaining
= 4;
2513 struct strbuf path
= STRBUF_INIT
;
2517 strbuf_reset(&path
);
2518 strbuf_git_path(&path
, "logs/%s", newrefname
);
2519 switch (safe_create_leading_directories_const(path
.buf
)) {
2521 break; /* success */
2523 if (--attempts_remaining
> 0)
2527 error("unable to create directory for %s", newrefname
);
2531 if (rename(git_path(TMP_RENAMED_LOG
), path
.buf
)) {
2532 if ((errno
==EISDIR
|| errno
==ENOTDIR
) && --attempts_remaining
> 0) {
2534 * rename(a, b) when b is an existing
2535 * directory ought to result in ISDIR, but
2536 * Solaris 5.8 gives ENOTDIR. Sheesh.
2538 if (remove_empty_directories(&path
)) {
2539 error("Directory not empty: logs/%s", newrefname
);
2543 } else if (errno
== ENOENT
&& --attempts_remaining
> 0) {
2545 * Maybe another process just deleted one of
2546 * the directories in the path to newrefname.
2547 * Try again from the beginning.
2551 error("unable to move logfile "TMP_RENAMED_LOG
" to logs/%s: %s",
2552 newrefname
, strerror(errno
));
2558 strbuf_release(&path
);
2562 static int files_verify_refname_available(struct ref_store
*ref_store
,
2563 const char *newname
,
2564 const struct string_list
*extras
,
2565 const struct string_list
*skip
,
2568 struct files_ref_store
*refs
=
2569 files_downcast(ref_store
, 1, "verify_refname_available");
2570 struct ref_dir
*packed_refs
= get_packed_refs(refs
);
2571 struct ref_dir
*loose_refs
= get_loose_refs(refs
);
2573 if (verify_refname_available_dir(newname
, extras
, skip
,
2574 packed_refs
, err
) ||
2575 verify_refname_available_dir(newname
, extras
, skip
,
2582 static int write_ref_to_lockfile(struct ref_lock
*lock
,
2583 const unsigned char *sha1
, struct strbuf
*err
);
2584 static int commit_ref_update(struct files_ref_store
*refs
,
2585 struct ref_lock
*lock
,
2586 const unsigned char *sha1
, const char *logmsg
,
2587 struct strbuf
*err
);
2589 static int files_rename_ref(struct ref_store
*ref_store
,
2590 const char *oldrefname
, const char *newrefname
,
2593 struct files_ref_store
*refs
=
2594 files_downcast(ref_store
, 0, "rename_ref");
2595 unsigned char sha1
[20], orig_sha1
[20];
2596 int flag
= 0, logmoved
= 0;
2597 struct ref_lock
*lock
;
2598 struct stat loginfo
;
2599 int log
= !lstat(git_path("logs/%s", oldrefname
), &loginfo
);
2600 struct strbuf err
= STRBUF_INIT
;
2602 if (log
&& S_ISLNK(loginfo
.st_mode
))
2603 return error("reflog for %s is a symlink", oldrefname
);
2605 if (!resolve_ref_unsafe(oldrefname
, RESOLVE_REF_READING
| RESOLVE_REF_NO_RECURSE
,
2607 return error("refname %s not found", oldrefname
);
2609 if (flag
& REF_ISSYMREF
)
2610 return error("refname %s is a symbolic ref, renaming it is not supported",
2612 if (!rename_ref_available(oldrefname
, newrefname
))
2615 if (log
&& rename(git_path("logs/%s", oldrefname
), git_path(TMP_RENAMED_LOG
)))
2616 return error("unable to move logfile logs/%s to "TMP_RENAMED_LOG
": %s",
2617 oldrefname
, strerror(errno
));
2619 if (delete_ref(oldrefname
, orig_sha1
, REF_NODEREF
)) {
2620 error("unable to delete old %s", oldrefname
);
2625 * Since we are doing a shallow lookup, sha1 is not the
2626 * correct value to pass to delete_ref as old_sha1. But that
2627 * doesn't matter, because an old_sha1 check wouldn't add to
2628 * the safety anyway; we want to delete the reference whatever
2629 * its current value.
2631 if (!read_ref_full(newrefname
, RESOLVE_REF_READING
| RESOLVE_REF_NO_RECURSE
,
2633 delete_ref(newrefname
, NULL
, REF_NODEREF
)) {
2634 if (errno
==EISDIR
) {
2635 struct strbuf path
= STRBUF_INIT
;
2638 strbuf_git_path(&path
, "%s", newrefname
);
2639 result
= remove_empty_directories(&path
);
2640 strbuf_release(&path
);
2643 error("Directory not empty: %s", newrefname
);
2647 error("unable to delete existing %s", newrefname
);
2652 if (log
&& rename_tmp_log(newrefname
))
2657 lock
= lock_ref_sha1_basic(refs
, newrefname
, NULL
, NULL
, NULL
,
2658 REF_NODEREF
, NULL
, &err
);
2660 error("unable to rename '%s' to '%s': %s", oldrefname
, newrefname
, err
.buf
);
2661 strbuf_release(&err
);
2664 hashcpy(lock
->old_oid
.hash
, orig_sha1
);
2666 if (write_ref_to_lockfile(lock
, orig_sha1
, &err
) ||
2667 commit_ref_update(refs
, lock
, orig_sha1
, logmsg
, &err
)) {
2668 error("unable to write current sha1 into %s: %s", newrefname
, err
.buf
);
2669 strbuf_release(&err
);
2676 lock
= lock_ref_sha1_basic(refs
, oldrefname
, NULL
, NULL
, NULL
,
2677 REF_NODEREF
, NULL
, &err
);
2679 error("unable to lock %s for rollback: %s", oldrefname
, err
.buf
);
2680 strbuf_release(&err
);
2684 flag
= log_all_ref_updates
;
2685 log_all_ref_updates
= LOG_REFS_NONE
;
2686 if (write_ref_to_lockfile(lock
, orig_sha1
, &err
) ||
2687 commit_ref_update(refs
, lock
, orig_sha1
, NULL
, &err
)) {
2688 error("unable to write current sha1 into %s: %s", oldrefname
, err
.buf
);
2689 strbuf_release(&err
);
2691 log_all_ref_updates
= flag
;
2694 if (logmoved
&& rename(git_path("logs/%s", newrefname
), git_path("logs/%s", oldrefname
)))
2695 error("unable to restore logfile %s from %s: %s",
2696 oldrefname
, newrefname
, strerror(errno
));
2697 if (!logmoved
&& log
&&
2698 rename(git_path(TMP_RENAMED_LOG
), git_path("logs/%s", oldrefname
)))
2699 error("unable to restore logfile %s from "TMP_RENAMED_LOG
": %s",
2700 oldrefname
, strerror(errno
));
2705 static int close_ref(struct ref_lock
*lock
)
2707 if (close_lock_file(lock
->lk
))
2712 static int commit_ref(struct ref_lock
*lock
)
2714 char *path
= get_locked_file_path(lock
->lk
);
2717 if (!lstat(path
, &st
) && S_ISDIR(st
.st_mode
)) {
2719 * There is a directory at the path we want to rename
2720 * the lockfile to. Hopefully it is empty; try to
2723 size_t len
= strlen(path
);
2724 struct strbuf sb_path
= STRBUF_INIT
;
2726 strbuf_attach(&sb_path
, path
, len
, len
);
2729 * If this fails, commit_lock_file() will also fail
2730 * and will report the problem.
2732 remove_empty_directories(&sb_path
);
2733 strbuf_release(&sb_path
);
2738 if (commit_lock_file(lock
->lk
))
2744 * Create a reflog for a ref. If force_create = 0, the reflog will
2745 * only be created for certain refs (those for which
2746 * should_autocreate_reflog returns non-zero. Otherwise, create it
2747 * regardless of the ref name. Fill in *err and return -1 on failure.
2749 static int log_ref_setup(const char *refname
, struct strbuf
*logfile
, struct strbuf
*err
, int force_create
)
2751 int logfd
, oflags
= O_APPEND
| O_WRONLY
;
2753 strbuf_git_path(logfile
, "logs/%s", refname
);
2754 if (force_create
|| should_autocreate_reflog(refname
)) {
2755 if (safe_create_leading_directories(logfile
->buf
) < 0) {
2756 strbuf_addf(err
, "unable to create directory for '%s': "
2757 "%s", logfile
->buf
, strerror(errno
));
2763 logfd
= open(logfile
->buf
, oflags
, 0666);
2765 if (!(oflags
& O_CREAT
) && (errno
== ENOENT
|| errno
== EISDIR
))
2768 if (errno
== EISDIR
) {
2769 if (remove_empty_directories(logfile
)) {
2770 strbuf_addf(err
, "there are still logs under "
2771 "'%s'", logfile
->buf
);
2774 logfd
= open(logfile
->buf
, oflags
, 0666);
2778 strbuf_addf(err
, "unable to append to '%s': %s",
2779 logfile
->buf
, strerror(errno
));
2784 adjust_shared_perm(logfile
->buf
);
2790 static int files_create_reflog(struct ref_store
*ref_store
,
2791 const char *refname
, int force_create
,
2795 struct strbuf sb
= STRBUF_INIT
;
2797 /* Check validity (but we don't need the result): */
2798 files_downcast(ref_store
, 0, "create_reflog");
2800 ret
= log_ref_setup(refname
, &sb
, err
, force_create
);
2801 strbuf_release(&sb
);
2805 static int log_ref_write_fd(int fd
, const unsigned char *old_sha1
,
2806 const unsigned char *new_sha1
,
2807 const char *committer
, const char *msg
)
2809 int msglen
, written
;
2810 unsigned maxlen
, len
;
2813 msglen
= msg
? strlen(msg
) : 0;
2814 maxlen
= strlen(committer
) + msglen
+ 100;
2815 logrec
= xmalloc(maxlen
);
2816 len
= xsnprintf(logrec
, maxlen
, "%s %s %s\n",
2817 sha1_to_hex(old_sha1
),
2818 sha1_to_hex(new_sha1
),
2821 len
+= copy_reflog_msg(logrec
+ len
- 1, msg
) - 1;
2823 written
= len
<= maxlen
? write_in_full(fd
, logrec
, len
) : -1;
2831 static int log_ref_write_1(const char *refname
, const unsigned char *old_sha1
,
2832 const unsigned char *new_sha1
, const char *msg
,
2833 struct strbuf
*logfile
, int flags
,
2836 int logfd
, result
, oflags
= O_APPEND
| O_WRONLY
;
2838 if (log_all_ref_updates
== LOG_REFS_UNSET
)
2839 log_all_ref_updates
= is_bare_repository() ? LOG_REFS_NONE
: LOG_REFS_NORMAL
;
2841 result
= log_ref_setup(refname
, logfile
, err
, flags
& REF_FORCE_CREATE_REFLOG
);
2846 logfd
= open(logfile
->buf
, oflags
);
2849 result
= log_ref_write_fd(logfd
, old_sha1
, new_sha1
,
2850 git_committer_info(0), msg
);
2852 strbuf_addf(err
, "unable to append to '%s': %s", logfile
->buf
,
2858 strbuf_addf(err
, "unable to append to '%s': %s", logfile
->buf
,
2865 static int log_ref_write(const char *refname
, const unsigned char *old_sha1
,
2866 const unsigned char *new_sha1
, const char *msg
,
2867 int flags
, struct strbuf
*err
)
2869 return files_log_ref_write(refname
, old_sha1
, new_sha1
, msg
, flags
,
2873 int files_log_ref_write(const char *refname
, const unsigned char *old_sha1
,
2874 const unsigned char *new_sha1
, const char *msg
,
2875 int flags
, struct strbuf
*err
)
2877 struct strbuf sb
= STRBUF_INIT
;
2878 int ret
= log_ref_write_1(refname
, old_sha1
, new_sha1
, msg
, &sb
, flags
,
2880 strbuf_release(&sb
);
2885 * Write sha1 into the open lockfile, then close the lockfile. On
2886 * errors, rollback the lockfile, fill in *err and
2889 static int write_ref_to_lockfile(struct ref_lock
*lock
,
2890 const unsigned char *sha1
, struct strbuf
*err
)
2892 static char term
= '\n';
2896 o
= parse_object(sha1
);
2899 "trying to write ref '%s' with nonexistent object %s",
2900 lock
->ref_name
, sha1_to_hex(sha1
));
2904 if (o
->type
!= OBJ_COMMIT
&& is_branch(lock
->ref_name
)) {
2906 "trying to write non-commit object %s to branch '%s'",
2907 sha1_to_hex(sha1
), lock
->ref_name
);
2911 fd
= get_lock_file_fd(lock
->lk
);
2912 if (write_in_full(fd
, sha1_to_hex(sha1
), 40) != 40 ||
2913 write_in_full(fd
, &term
, 1) != 1 ||
2914 close_ref(lock
) < 0) {
2916 "couldn't write '%s'", get_lock_file_path(lock
->lk
));
2924 * Commit a change to a loose reference that has already been written
2925 * to the loose reference lockfile. Also update the reflogs if
2926 * necessary, using the specified lockmsg (which can be NULL).
2928 static int commit_ref_update(struct files_ref_store
*refs
,
2929 struct ref_lock
*lock
,
2930 const unsigned char *sha1
, const char *logmsg
,
2933 assert_main_repository(&refs
->base
, "commit_ref_update");
2935 clear_loose_ref_cache(refs
);
2936 if (log_ref_write(lock
->ref_name
, lock
->old_oid
.hash
, sha1
, logmsg
, 0, err
)) {
2937 char *old_msg
= strbuf_detach(err
, NULL
);
2938 strbuf_addf(err
, "cannot update the ref '%s': %s",
2939 lock
->ref_name
, old_msg
);
2945 if (strcmp(lock
->ref_name
, "HEAD") != 0) {
2947 * Special hack: If a branch is updated directly and HEAD
2948 * points to it (may happen on the remote side of a push
2949 * for example) then logically the HEAD reflog should be
2951 * A generic solution implies reverse symref information,
2952 * but finding all symrefs pointing to the given branch
2953 * would be rather costly for this rare event (the direct
2954 * update of a branch) to be worth it. So let's cheat and
2955 * check with HEAD only which should cover 99% of all usage
2956 * scenarios (even 100% of the default ones).
2958 unsigned char head_sha1
[20];
2960 const char *head_ref
;
2962 head_ref
= resolve_ref_unsafe("HEAD", RESOLVE_REF_READING
,
2963 head_sha1
, &head_flag
);
2964 if (head_ref
&& (head_flag
& REF_ISSYMREF
) &&
2965 !strcmp(head_ref
, lock
->ref_name
)) {
2966 struct strbuf log_err
= STRBUF_INIT
;
2967 if (log_ref_write("HEAD", lock
->old_oid
.hash
, sha1
,
2968 logmsg
, 0, &log_err
)) {
2969 error("%s", log_err
.buf
);
2970 strbuf_release(&log_err
);
2975 if (commit_ref(lock
)) {
2976 strbuf_addf(err
, "couldn't set '%s'", lock
->ref_name
);
2985 static int create_ref_symlink(struct ref_lock
*lock
, const char *target
)
2988 #ifndef NO_SYMLINK_HEAD
2989 char *ref_path
= get_locked_file_path(lock
->lk
);
2991 ret
= symlink(target
, ref_path
);
2995 fprintf(stderr
, "no symlink - falling back to symbolic ref\n");
3000 static void update_symref_reflog(struct ref_lock
*lock
, const char *refname
,
3001 const char *target
, const char *logmsg
)
3003 struct strbuf err
= STRBUF_INIT
;
3004 unsigned char new_sha1
[20];
3005 if (logmsg
&& !read_ref(target
, new_sha1
) &&
3006 log_ref_write(refname
, lock
->old_oid
.hash
, new_sha1
, logmsg
, 0, &err
)) {
3007 error("%s", err
.buf
);
3008 strbuf_release(&err
);
3012 static int create_symref_locked(struct ref_lock
*lock
, const char *refname
,
3013 const char *target
, const char *logmsg
)
3015 if (prefer_symlink_refs
&& !create_ref_symlink(lock
, target
)) {
3016 update_symref_reflog(lock
, refname
, target
, logmsg
);
3020 if (!fdopen_lock_file(lock
->lk
, "w"))
3021 return error("unable to fdopen %s: %s",
3022 lock
->lk
->tempfile
.filename
.buf
, strerror(errno
));
3024 update_symref_reflog(lock
, refname
, target
, logmsg
);
3026 /* no error check; commit_ref will check ferror */
3027 fprintf(lock
->lk
->tempfile
.fp
, "ref: %s\n", target
);
3028 if (commit_ref(lock
) < 0)
3029 return error("unable to write symref for %s: %s", refname
,
3034 static int files_create_symref(struct ref_store
*ref_store
,
3035 const char *refname
, const char *target
,
3038 struct files_ref_store
*refs
=
3039 files_downcast(ref_store
, 0, "create_symref");
3040 struct strbuf err
= STRBUF_INIT
;
3041 struct ref_lock
*lock
;
3044 lock
= lock_ref_sha1_basic(refs
, refname
, NULL
,
3045 NULL
, NULL
, REF_NODEREF
, NULL
,
3048 error("%s", err
.buf
);
3049 strbuf_release(&err
);
3053 ret
= create_symref_locked(lock
, refname
, target
, logmsg
);
3058 int set_worktree_head_symref(const char *gitdir
, const char *target
)
3060 static struct lock_file head_lock
;
3061 struct ref_lock
*lock
;
3062 struct strbuf head_path
= STRBUF_INIT
;
3063 const char *head_rel
;
3066 strbuf_addf(&head_path
, "%s/HEAD", absolute_path(gitdir
));
3067 if (hold_lock_file_for_update(&head_lock
, head_path
.buf
,
3068 LOCK_NO_DEREF
) < 0) {
3069 struct strbuf err
= STRBUF_INIT
;
3070 unable_to_lock_message(head_path
.buf
, errno
, &err
);
3071 error("%s", err
.buf
);
3072 strbuf_release(&err
);
3073 strbuf_release(&head_path
);
3077 /* head_rel will be "HEAD" for the main tree, "worktrees/wt/HEAD" for
3079 head_rel
= remove_leading_path(head_path
.buf
,
3080 absolute_path(get_git_common_dir()));
3081 /* to make use of create_symref_locked(), initialize ref_lock */
3082 lock
= xcalloc(1, sizeof(struct ref_lock
));
3083 lock
->lk
= &head_lock
;
3084 lock
->ref_name
= xstrdup(head_rel
);
3086 ret
= create_symref_locked(lock
, head_rel
, target
, NULL
);
3088 unlock_ref(lock
); /* will free lock */
3089 strbuf_release(&head_path
);
3093 static int files_reflog_exists(struct ref_store
*ref_store
,
3094 const char *refname
)
3098 /* Check validity (but we don't need the result): */
3099 files_downcast(ref_store
, 0, "reflog_exists");
3101 return !lstat(git_path("logs/%s", refname
), &st
) &&
3102 S_ISREG(st
.st_mode
);
3105 static int files_delete_reflog(struct ref_store
*ref_store
,
3106 const char *refname
)
3108 /* Check validity (but we don't need the result): */
3109 files_downcast(ref_store
, 0, "delete_reflog");
3111 return remove_path(git_path("logs/%s", refname
));
3114 static int show_one_reflog_ent(struct strbuf
*sb
, each_reflog_ent_fn fn
, void *cb_data
)
3116 struct object_id ooid
, noid
;
3117 char *email_end
, *message
;
3118 unsigned long timestamp
;
3121 /* old SP new SP name <email> SP time TAB msg LF */
3122 if (sb
->len
< 83 || sb
->buf
[sb
->len
- 1] != '\n' ||
3123 get_oid_hex(sb
->buf
, &ooid
) || sb
->buf
[40] != ' ' ||
3124 get_oid_hex(sb
->buf
+ 41, &noid
) || sb
->buf
[81] != ' ' ||
3125 !(email_end
= strchr(sb
->buf
+ 82, '>')) ||
3126 email_end
[1] != ' ' ||
3127 !(timestamp
= strtoul(email_end
+ 2, &message
, 10)) ||
3128 !message
|| message
[0] != ' ' ||
3129 (message
[1] != '+' && message
[1] != '-') ||
3130 !isdigit(message
[2]) || !isdigit(message
[3]) ||
3131 !isdigit(message
[4]) || !isdigit(message
[5]))
3132 return 0; /* corrupt? */
3133 email_end
[1] = '\0';
3134 tz
= strtol(message
+ 1, NULL
, 10);
3135 if (message
[6] != '\t')
3139 return fn(&ooid
, &noid
, sb
->buf
+ 82, timestamp
, tz
, message
, cb_data
);
3142 static char *find_beginning_of_line(char *bob
, char *scan
)
3144 while (bob
< scan
&& *(--scan
) != '\n')
3145 ; /* keep scanning backwards */
3147 * Return either beginning of the buffer, or LF at the end of
3148 * the previous line.
3153 static int files_for_each_reflog_ent_reverse(struct ref_store
*ref_store
,
3154 const char *refname
,
3155 each_reflog_ent_fn fn
,
3158 struct strbuf sb
= STRBUF_INIT
;
3161 int ret
= 0, at_tail
= 1;
3163 /* Check validity (but we don't need the result): */
3164 files_downcast(ref_store
, 0, "for_each_reflog_ent_reverse");
3166 logfp
= fopen(git_path("logs/%s", refname
), "r");
3170 /* Jump to the end */
3171 if (fseek(logfp
, 0, SEEK_END
) < 0)
3172 return error("cannot seek back reflog for %s: %s",
3173 refname
, strerror(errno
));
3175 while (!ret
&& 0 < pos
) {
3181 /* Fill next block from the end */
3182 cnt
= (sizeof(buf
) < pos
) ? sizeof(buf
) : pos
;
3183 if (fseek(logfp
, pos
- cnt
, SEEK_SET
))
3184 return error("cannot seek back reflog for %s: %s",
3185 refname
, strerror(errno
));
3186 nread
= fread(buf
, cnt
, 1, logfp
);
3188 return error("cannot read %d bytes from reflog for %s: %s",
3189 cnt
, refname
, strerror(errno
));
3192 scanp
= endp
= buf
+ cnt
;
3193 if (at_tail
&& scanp
[-1] == '\n')
3194 /* Looking at the final LF at the end of the file */
3198 while (buf
< scanp
) {
3200 * terminating LF of the previous line, or the beginning
3205 bp
= find_beginning_of_line(buf
, scanp
);
3209 * The newline is the end of the previous line,
3210 * so we know we have complete line starting
3211 * at (bp + 1). Prefix it onto any prior data
3212 * we collected for the line and process it.
3214 strbuf_splice(&sb
, 0, 0, bp
+ 1, endp
- (bp
+ 1));
3217 ret
= show_one_reflog_ent(&sb
, fn
, cb_data
);
3223 * We are at the start of the buffer, and the
3224 * start of the file; there is no previous
3225 * line, and we have everything for this one.
3226 * Process it, and we can end the loop.
3228 strbuf_splice(&sb
, 0, 0, buf
, endp
- buf
);
3229 ret
= show_one_reflog_ent(&sb
, fn
, cb_data
);
3236 * We are at the start of the buffer, and there
3237 * is more file to read backwards. Which means
3238 * we are in the middle of a line. Note that we
3239 * may get here even if *bp was a newline; that
3240 * just means we are at the exact end of the
3241 * previous line, rather than some spot in the
3244 * Save away what we have to be combined with
3245 * the data from the next read.
3247 strbuf_splice(&sb
, 0, 0, buf
, endp
- buf
);
3254 die("BUG: reverse reflog parser had leftover data");
3257 strbuf_release(&sb
);
3261 static int files_for_each_reflog_ent(struct ref_store
*ref_store
,
3262 const char *refname
,
3263 each_reflog_ent_fn fn
, void *cb_data
)
3266 struct strbuf sb
= STRBUF_INIT
;
3269 /* Check validity (but we don't need the result): */
3270 files_downcast(ref_store
, 0, "for_each_reflog_ent");
3272 logfp
= fopen(git_path("logs/%s", refname
), "r");
3276 while (!ret
&& !strbuf_getwholeline(&sb
, logfp
, '\n'))
3277 ret
= show_one_reflog_ent(&sb
, fn
, cb_data
);
3279 strbuf_release(&sb
);
3283 struct files_reflog_iterator
{
3284 struct ref_iterator base
;
3286 struct dir_iterator
*dir_iterator
;
3287 struct object_id oid
;
3290 static int files_reflog_iterator_advance(struct ref_iterator
*ref_iterator
)
3292 struct files_reflog_iterator
*iter
=
3293 (struct files_reflog_iterator
*)ref_iterator
;
3294 struct dir_iterator
*diter
= iter
->dir_iterator
;
3297 while ((ok
= dir_iterator_advance(diter
)) == ITER_OK
) {
3300 if (!S_ISREG(diter
->st
.st_mode
))
3302 if (diter
->basename
[0] == '.')
3304 if (ends_with(diter
->basename
, ".lock"))
3307 if (read_ref_full(diter
->relative_path
, 0,
3308 iter
->oid
.hash
, &flags
)) {
3309 error("bad ref for %s", diter
->path
.buf
);
3313 iter
->base
.refname
= diter
->relative_path
;
3314 iter
->base
.oid
= &iter
->oid
;
3315 iter
->base
.flags
= flags
;
3319 iter
->dir_iterator
= NULL
;
3320 if (ref_iterator_abort(ref_iterator
) == ITER_ERROR
)
3325 static int files_reflog_iterator_peel(struct ref_iterator
*ref_iterator
,
3326 struct object_id
*peeled
)
3328 die("BUG: ref_iterator_peel() called for reflog_iterator");
3331 static int files_reflog_iterator_abort(struct ref_iterator
*ref_iterator
)
3333 struct files_reflog_iterator
*iter
=
3334 (struct files_reflog_iterator
*)ref_iterator
;
3337 if (iter
->dir_iterator
)
3338 ok
= dir_iterator_abort(iter
->dir_iterator
);
3340 base_ref_iterator_free(ref_iterator
);
3344 static struct ref_iterator_vtable files_reflog_iterator_vtable
= {
3345 files_reflog_iterator_advance
,
3346 files_reflog_iterator_peel
,
3347 files_reflog_iterator_abort
3350 static struct ref_iterator
*files_reflog_iterator_begin(struct ref_store
*ref_store
)
3352 struct files_reflog_iterator
*iter
= xcalloc(1, sizeof(*iter
));
3353 struct ref_iterator
*ref_iterator
= &iter
->base
;
3355 /* Check validity (but we don't need the result): */
3356 files_downcast(ref_store
, 0, "reflog_iterator_begin");
3358 base_ref_iterator_init(ref_iterator
, &files_reflog_iterator_vtable
);
3359 iter
->dir_iterator
= dir_iterator_begin(git_path("logs"));
3360 return ref_iterator
;
3363 static int ref_update_reject_duplicates(struct string_list
*refnames
,
3366 int i
, n
= refnames
->nr
;
3370 for (i
= 1; i
< n
; i
++)
3371 if (!strcmp(refnames
->items
[i
- 1].string
, refnames
->items
[i
].string
)) {
3373 "multiple updates for ref '%s' not allowed.",
3374 refnames
->items
[i
].string
);
3381 * If update is a direct update of head_ref (the reference pointed to
3382 * by HEAD), then add an extra REF_LOG_ONLY update for HEAD.
3384 static int split_head_update(struct ref_update
*update
,
3385 struct ref_transaction
*transaction
,
3386 const char *head_ref
,
3387 struct string_list
*affected_refnames
,
3390 struct string_list_item
*item
;
3391 struct ref_update
*new_update
;
3393 if ((update
->flags
& REF_LOG_ONLY
) ||
3394 (update
->flags
& REF_ISPRUNING
) ||
3395 (update
->flags
& REF_UPDATE_VIA_HEAD
))
3398 if (strcmp(update
->refname
, head_ref
))
3402 * First make sure that HEAD is not already in the
3403 * transaction. This insertion is O(N) in the transaction
3404 * size, but it happens at most once per transaction.
3406 item
= string_list_insert(affected_refnames
, "HEAD");
3408 /* An entry already existed */
3410 "multiple updates for 'HEAD' (including one "
3411 "via its referent '%s') are not allowed",
3413 return TRANSACTION_NAME_CONFLICT
;
3416 new_update
= ref_transaction_add_update(
3417 transaction
, "HEAD",
3418 update
->flags
| REF_LOG_ONLY
| REF_NODEREF
,
3419 update
->new_sha1
, update
->old_sha1
,
3422 item
->util
= new_update
;
3428 * update is for a symref that points at referent and doesn't have
3429 * REF_NODEREF set. Split it into two updates:
3430 * - The original update, but with REF_LOG_ONLY and REF_NODEREF set
3431 * - A new, separate update for the referent reference
3432 * Note that the new update will itself be subject to splitting when
3433 * the iteration gets to it.
3435 static int split_symref_update(struct files_ref_store
*refs
,
3436 struct ref_update
*update
,
3437 const char *referent
,
3438 struct ref_transaction
*transaction
,
3439 struct string_list
*affected_refnames
,
3442 struct string_list_item
*item
;
3443 struct ref_update
*new_update
;
3444 unsigned int new_flags
;
3447 * First make sure that referent is not already in the
3448 * transaction. This insertion is O(N) in the transaction
3449 * size, but it happens at most once per symref in a
3452 item
= string_list_insert(affected_refnames
, referent
);
3454 /* An entry already existed */
3456 "multiple updates for '%s' (including one "
3457 "via symref '%s') are not allowed",
3458 referent
, update
->refname
);
3459 return TRANSACTION_NAME_CONFLICT
;
3462 new_flags
= update
->flags
;
3463 if (!strcmp(update
->refname
, "HEAD")) {
3465 * Record that the new update came via HEAD, so that
3466 * when we process it, split_head_update() doesn't try
3467 * to add another reflog update for HEAD. Note that
3468 * this bit will be propagated if the new_update
3469 * itself needs to be split.
3471 new_flags
|= REF_UPDATE_VIA_HEAD
;
3474 new_update
= ref_transaction_add_update(
3475 transaction
, referent
, new_flags
,
3476 update
->new_sha1
, update
->old_sha1
,
3479 new_update
->parent_update
= update
;
3482 * Change the symbolic ref update to log only. Also, it
3483 * doesn't need to check its old SHA-1 value, as that will be
3484 * done when new_update is processed.
3486 update
->flags
|= REF_LOG_ONLY
| REF_NODEREF
;
3487 update
->flags
&= ~REF_HAVE_OLD
;
3489 item
->util
= new_update
;
3495 * Return the refname under which update was originally requested.
3497 static const char *original_update_refname(struct ref_update
*update
)
3499 while (update
->parent_update
)
3500 update
= update
->parent_update
;
3502 return update
->refname
;
3506 * Check whether the REF_HAVE_OLD and old_oid values stored in update
3507 * are consistent with oid, which is the reference's current value. If
3508 * everything is OK, return 0; otherwise, write an error message to
3509 * err and return -1.
3511 static int check_old_oid(struct ref_update
*update
, struct object_id
*oid
,
3514 if (!(update
->flags
& REF_HAVE_OLD
) ||
3515 !hashcmp(oid
->hash
, update
->old_sha1
))
3518 if (is_null_sha1(update
->old_sha1
))
3519 strbuf_addf(err
, "cannot lock ref '%s': "
3520 "reference already exists",
3521 original_update_refname(update
));
3522 else if (is_null_oid(oid
))
3523 strbuf_addf(err
, "cannot lock ref '%s': "
3524 "reference is missing but expected %s",
3525 original_update_refname(update
),
3526 sha1_to_hex(update
->old_sha1
));
3528 strbuf_addf(err
, "cannot lock ref '%s': "
3529 "is at %s but expected %s",
3530 original_update_refname(update
),
3532 sha1_to_hex(update
->old_sha1
));
3538 * Prepare for carrying out update:
3539 * - Lock the reference referred to by update.
3540 * - Read the reference under lock.
3541 * - Check that its old SHA-1 value (if specified) is correct, and in
3542 * any case record it in update->lock->old_oid for later use when
3543 * writing the reflog.
3544 * - If it is a symref update without REF_NODEREF, split it up into a
3545 * REF_LOG_ONLY update of the symref and add a separate update for
3546 * the referent to transaction.
3547 * - If it is an update of head_ref, add a corresponding REF_LOG_ONLY
3550 static int lock_ref_for_update(struct files_ref_store
*refs
,
3551 struct ref_update
*update
,
3552 struct ref_transaction
*transaction
,
3553 const char *head_ref
,
3554 struct string_list
*affected_refnames
,
3557 struct strbuf referent
= STRBUF_INIT
;
3558 int mustexist
= (update
->flags
& REF_HAVE_OLD
) &&
3559 !is_null_sha1(update
->old_sha1
);
3561 struct ref_lock
*lock
;
3563 assert_main_repository(&refs
->base
, "lock_ref_for_update");
3565 if ((update
->flags
& REF_HAVE_NEW
) && is_null_sha1(update
->new_sha1
))
3566 update
->flags
|= REF_DELETING
;
3569 ret
= split_head_update(update
, transaction
, head_ref
,
3570 affected_refnames
, err
);
3575 ret
= lock_raw_ref(refs
, update
->refname
, mustexist
,
3576 affected_refnames
, NULL
,
3578 &update
->type
, err
);
3582 reason
= strbuf_detach(err
, NULL
);
3583 strbuf_addf(err
, "cannot lock ref '%s': %s",
3584 original_update_refname(update
), reason
);
3589 update
->backend_data
= lock
;
3591 if (update
->type
& REF_ISSYMREF
) {
3592 if (update
->flags
& REF_NODEREF
) {
3594 * We won't be reading the referent as part of
3595 * the transaction, so we have to read it here
3596 * to record and possibly check old_sha1:
3598 if (read_ref_full(referent
.buf
, 0,
3599 lock
->old_oid
.hash
, NULL
)) {
3600 if (update
->flags
& REF_HAVE_OLD
) {
3601 strbuf_addf(err
, "cannot lock ref '%s': "
3602 "error reading reference",
3603 original_update_refname(update
));
3606 } else if (check_old_oid(update
, &lock
->old_oid
, err
)) {
3607 return TRANSACTION_GENERIC_ERROR
;
3611 * Create a new update for the reference this
3612 * symref is pointing at. Also, we will record
3613 * and verify old_sha1 for this update as part
3614 * of processing the split-off update, so we
3615 * don't have to do it here.
3617 ret
= split_symref_update(refs
, update
,
3618 referent
.buf
, transaction
,
3619 affected_refnames
, err
);
3624 struct ref_update
*parent_update
;
3626 if (check_old_oid(update
, &lock
->old_oid
, err
))
3627 return TRANSACTION_GENERIC_ERROR
;
3630 * If this update is happening indirectly because of a
3631 * symref update, record the old SHA-1 in the parent
3634 for (parent_update
= update
->parent_update
;
3636 parent_update
= parent_update
->parent_update
) {
3637 struct ref_lock
*parent_lock
= parent_update
->backend_data
;
3638 oidcpy(&parent_lock
->old_oid
, &lock
->old_oid
);
3642 if ((update
->flags
& REF_HAVE_NEW
) &&
3643 !(update
->flags
& REF_DELETING
) &&
3644 !(update
->flags
& REF_LOG_ONLY
)) {
3645 if (!(update
->type
& REF_ISSYMREF
) &&
3646 !hashcmp(lock
->old_oid
.hash
, update
->new_sha1
)) {
3648 * The reference already has the desired
3649 * value, so we don't need to write it.
3651 } else if (write_ref_to_lockfile(lock
, update
->new_sha1
,
3653 char *write_err
= strbuf_detach(err
, NULL
);
3656 * The lock was freed upon failure of
3657 * write_ref_to_lockfile():
3659 update
->backend_data
= NULL
;
3661 "cannot update ref '%s': %s",
3662 update
->refname
, write_err
);
3664 return TRANSACTION_GENERIC_ERROR
;
3666 update
->flags
|= REF_NEEDS_COMMIT
;
3669 if (!(update
->flags
& REF_NEEDS_COMMIT
)) {
3671 * We didn't call write_ref_to_lockfile(), so
3672 * the lockfile is still open. Close it to
3673 * free up the file descriptor:
3675 if (close_ref(lock
)) {
3676 strbuf_addf(err
, "couldn't close '%s.lock'",
3678 return TRANSACTION_GENERIC_ERROR
;
3684 static int files_transaction_commit(struct ref_store
*ref_store
,
3685 struct ref_transaction
*transaction
,
3688 struct files_ref_store
*refs
=
3689 files_downcast(ref_store
, 0, "ref_transaction_commit");
3691 struct string_list refs_to_delete
= STRING_LIST_INIT_NODUP
;
3692 struct string_list_item
*ref_to_delete
;
3693 struct string_list affected_refnames
= STRING_LIST_INIT_NODUP
;
3694 char *head_ref
= NULL
;
3696 struct object_id head_oid
;
3700 if (transaction
->state
!= REF_TRANSACTION_OPEN
)
3701 die("BUG: commit called for transaction that is not open");
3703 if (!transaction
->nr
) {
3704 transaction
->state
= REF_TRANSACTION_CLOSED
;
3709 * Fail if a refname appears more than once in the
3710 * transaction. (If we end up splitting up any updates using
3711 * split_symref_update() or split_head_update(), those
3712 * functions will check that the new updates don't have the
3713 * same refname as any existing ones.)
3715 for (i
= 0; i
< transaction
->nr
; i
++) {
3716 struct ref_update
*update
= transaction
->updates
[i
];
3717 struct string_list_item
*item
=
3718 string_list_append(&affected_refnames
, update
->refname
);
3721 * We store a pointer to update in item->util, but at
3722 * the moment we never use the value of this field
3723 * except to check whether it is non-NULL.
3725 item
->util
= update
;
3727 string_list_sort(&affected_refnames
);
3728 if (ref_update_reject_duplicates(&affected_refnames
, err
)) {
3729 ret
= TRANSACTION_GENERIC_ERROR
;
3734 * Special hack: If a branch is updated directly and HEAD
3735 * points to it (may happen on the remote side of a push
3736 * for example) then logically the HEAD reflog should be
3739 * A generic solution would require reverse symref lookups,
3740 * but finding all symrefs pointing to a given branch would be
3741 * rather costly for this rare event (the direct update of a
3742 * branch) to be worth it. So let's cheat and check with HEAD
3743 * only, which should cover 99% of all usage scenarios (even
3744 * 100% of the default ones).
3746 * So if HEAD is a symbolic reference, then record the name of
3747 * the reference that it points to. If we see an update of
3748 * head_ref within the transaction, then split_head_update()
3749 * arranges for the reflog of HEAD to be updated, too.
3751 head_ref
= resolve_refdup("HEAD", RESOLVE_REF_NO_RECURSE
,
3752 head_oid
.hash
, &head_type
);
3754 if (head_ref
&& !(head_type
& REF_ISSYMREF
)) {
3760 * Acquire all locks, verify old values if provided, check
3761 * that new values are valid, and write new values to the
3762 * lockfiles, ready to be activated. Only keep one lockfile
3763 * open at a time to avoid running out of file descriptors.
3765 for (i
= 0; i
< transaction
->nr
; i
++) {
3766 struct ref_update
*update
= transaction
->updates
[i
];
3768 ret
= lock_ref_for_update(refs
, update
, transaction
,
3769 head_ref
, &affected_refnames
, err
);
3774 /* Perform updates first so live commits remain referenced */
3775 for (i
= 0; i
< transaction
->nr
; i
++) {
3776 struct ref_update
*update
= transaction
->updates
[i
];
3777 struct ref_lock
*lock
= update
->backend_data
;
3779 if (update
->flags
& REF_NEEDS_COMMIT
||
3780 update
->flags
& REF_LOG_ONLY
) {
3781 if (log_ref_write(lock
->ref_name
, lock
->old_oid
.hash
,
3783 update
->msg
, update
->flags
, err
)) {
3784 char *old_msg
= strbuf_detach(err
, NULL
);
3786 strbuf_addf(err
, "cannot update the ref '%s': %s",
3787 lock
->ref_name
, old_msg
);
3790 update
->backend_data
= NULL
;
3791 ret
= TRANSACTION_GENERIC_ERROR
;
3795 if (update
->flags
& REF_NEEDS_COMMIT
) {
3796 clear_loose_ref_cache(refs
);
3797 if (commit_ref(lock
)) {
3798 strbuf_addf(err
, "couldn't set '%s'", lock
->ref_name
);
3800 update
->backend_data
= NULL
;
3801 ret
= TRANSACTION_GENERIC_ERROR
;
3806 /* Perform deletes now that updates are safely completed */
3807 for (i
= 0; i
< transaction
->nr
; i
++) {
3808 struct ref_update
*update
= transaction
->updates
[i
];
3809 struct ref_lock
*lock
= update
->backend_data
;
3811 if (update
->flags
& REF_DELETING
&&
3812 !(update
->flags
& REF_LOG_ONLY
)) {
3813 if (delete_ref_loose(lock
, update
->type
, err
)) {
3814 ret
= TRANSACTION_GENERIC_ERROR
;
3818 if (!(update
->flags
& REF_ISPRUNING
))
3819 string_list_append(&refs_to_delete
,
3824 if (repack_without_refs(refs
, &refs_to_delete
, err
)) {
3825 ret
= TRANSACTION_GENERIC_ERROR
;
3828 for_each_string_list_item(ref_to_delete
, &refs_to_delete
)
3829 unlink_or_warn(git_path("logs/%s", ref_to_delete
->string
));
3830 clear_loose_ref_cache(refs
);
3833 transaction
->state
= REF_TRANSACTION_CLOSED
;
3835 for (i
= 0; i
< transaction
->nr
; i
++)
3836 if (transaction
->updates
[i
]->backend_data
)
3837 unlock_ref(transaction
->updates
[i
]->backend_data
);
3838 string_list_clear(&refs_to_delete
, 0);
3840 string_list_clear(&affected_refnames
, 0);
3845 static int ref_present(const char *refname
,
3846 const struct object_id
*oid
, int flags
, void *cb_data
)
3848 struct string_list
*affected_refnames
= cb_data
;
3850 return string_list_has_string(affected_refnames
, refname
);
3853 static int files_initial_transaction_commit(struct ref_store
*ref_store
,
3854 struct ref_transaction
*transaction
,
3857 struct files_ref_store
*refs
=
3858 files_downcast(ref_store
, 0, "initial_ref_transaction_commit");
3860 struct string_list affected_refnames
= STRING_LIST_INIT_NODUP
;
3864 if (transaction
->state
!= REF_TRANSACTION_OPEN
)
3865 die("BUG: commit called for transaction that is not open");
3867 /* Fail if a refname appears more than once in the transaction: */
3868 for (i
= 0; i
< transaction
->nr
; i
++)
3869 string_list_append(&affected_refnames
,
3870 transaction
->updates
[i
]->refname
);
3871 string_list_sort(&affected_refnames
);
3872 if (ref_update_reject_duplicates(&affected_refnames
, err
)) {
3873 ret
= TRANSACTION_GENERIC_ERROR
;
3878 * It's really undefined to call this function in an active
3879 * repository or when there are existing references: we are
3880 * only locking and changing packed-refs, so (1) any
3881 * simultaneous processes might try to change a reference at
3882 * the same time we do, and (2) any existing loose versions of
3883 * the references that we are setting would have precedence
3884 * over our values. But some remote helpers create the remote
3885 * "HEAD" and "master" branches before calling this function,
3886 * so here we really only check that none of the references
3887 * that we are creating already exists.
3889 if (for_each_rawref(ref_present
, &affected_refnames
))
3890 die("BUG: initial ref transaction called with existing refs");
3892 for (i
= 0; i
< transaction
->nr
; i
++) {
3893 struct ref_update
*update
= transaction
->updates
[i
];
3895 if ((update
->flags
& REF_HAVE_OLD
) &&
3896 !is_null_sha1(update
->old_sha1
))
3897 die("BUG: initial ref transaction with old_sha1 set");
3898 if (verify_refname_available(update
->refname
,
3899 &affected_refnames
, NULL
,
3901 ret
= TRANSACTION_NAME_CONFLICT
;
3906 if (lock_packed_refs(refs
, 0)) {
3907 strbuf_addf(err
, "unable to lock packed-refs file: %s",
3909 ret
= TRANSACTION_GENERIC_ERROR
;
3913 for (i
= 0; i
< transaction
->nr
; i
++) {
3914 struct ref_update
*update
= transaction
->updates
[i
];
3916 if ((update
->flags
& REF_HAVE_NEW
) &&
3917 !is_null_sha1(update
->new_sha1
))
3918 add_packed_ref(refs
, update
->refname
, update
->new_sha1
);
3921 if (commit_packed_refs(refs
)) {
3922 strbuf_addf(err
, "unable to commit packed-refs file: %s",
3924 ret
= TRANSACTION_GENERIC_ERROR
;
3929 transaction
->state
= REF_TRANSACTION_CLOSED
;
3930 string_list_clear(&affected_refnames
, 0);
3934 struct expire_reflog_cb
{
3936 reflog_expiry_should_prune_fn
*should_prune_fn
;
3939 struct object_id last_kept_oid
;
3942 static int expire_reflog_ent(struct object_id
*ooid
, struct object_id
*noid
,
3943 const char *email
, unsigned long timestamp
, int tz
,
3944 const char *message
, void *cb_data
)
3946 struct expire_reflog_cb
*cb
= cb_data
;
3947 struct expire_reflog_policy_cb
*policy_cb
= cb
->policy_cb
;
3949 if (cb
->flags
& EXPIRE_REFLOGS_REWRITE
)
3950 ooid
= &cb
->last_kept_oid
;
3952 if ((*cb
->should_prune_fn
)(ooid
->hash
, noid
->hash
, email
, timestamp
, tz
,
3953 message
, policy_cb
)) {
3955 printf("would prune %s", message
);
3956 else if (cb
->flags
& EXPIRE_REFLOGS_VERBOSE
)
3957 printf("prune %s", message
);
3960 fprintf(cb
->newlog
, "%s %s %s %lu %+05d\t%s",
3961 oid_to_hex(ooid
), oid_to_hex(noid
),
3962 email
, timestamp
, tz
, message
);
3963 oidcpy(&cb
->last_kept_oid
, noid
);
3965 if (cb
->flags
& EXPIRE_REFLOGS_VERBOSE
)
3966 printf("keep %s", message
);
3971 static int files_reflog_expire(struct ref_store
*ref_store
,
3972 const char *refname
, const unsigned char *sha1
,
3974 reflog_expiry_prepare_fn prepare_fn
,
3975 reflog_expiry_should_prune_fn should_prune_fn
,
3976 reflog_expiry_cleanup_fn cleanup_fn
,
3977 void *policy_cb_data
)
3979 struct files_ref_store
*refs
=
3980 files_downcast(ref_store
, 0, "reflog_expire");
3981 static struct lock_file reflog_lock
;
3982 struct expire_reflog_cb cb
;
3983 struct ref_lock
*lock
;
3987 struct strbuf err
= STRBUF_INIT
;
3989 memset(&cb
, 0, sizeof(cb
));
3991 cb
.policy_cb
= policy_cb_data
;
3992 cb
.should_prune_fn
= should_prune_fn
;
3995 * The reflog file is locked by holding the lock on the
3996 * reference itself, plus we might need to update the
3997 * reference if --updateref was specified:
3999 lock
= lock_ref_sha1_basic(refs
, refname
, sha1
,
4000 NULL
, NULL
, REF_NODEREF
,
4003 error("cannot lock ref '%s': %s", refname
, err
.buf
);
4004 strbuf_release(&err
);
4007 if (!reflog_exists(refname
)) {
4012 log_file
= git_pathdup("logs/%s", refname
);
4013 if (!(flags
& EXPIRE_REFLOGS_DRY_RUN
)) {
4015 * Even though holding $GIT_DIR/logs/$reflog.lock has
4016 * no locking implications, we use the lock_file
4017 * machinery here anyway because it does a lot of the
4018 * work we need, including cleaning up if the program
4019 * exits unexpectedly.
4021 if (hold_lock_file_for_update(&reflog_lock
, log_file
, 0) < 0) {
4022 struct strbuf err
= STRBUF_INIT
;
4023 unable_to_lock_message(log_file
, errno
, &err
);
4024 error("%s", err
.buf
);
4025 strbuf_release(&err
);
4028 cb
.newlog
= fdopen_lock_file(&reflog_lock
, "w");
4030 error("cannot fdopen %s (%s)",
4031 get_lock_file_path(&reflog_lock
), strerror(errno
));
4036 (*prepare_fn
)(refname
, sha1
, cb
.policy_cb
);
4037 for_each_reflog_ent(refname
, expire_reflog_ent
, &cb
);
4038 (*cleanup_fn
)(cb
.policy_cb
);
4040 if (!(flags
& EXPIRE_REFLOGS_DRY_RUN
)) {
4042 * It doesn't make sense to adjust a reference pointed
4043 * to by a symbolic ref based on expiring entries in
4044 * the symbolic reference's reflog. Nor can we update
4045 * a reference if there are no remaining reflog
4048 int update
= (flags
& EXPIRE_REFLOGS_UPDATE_REF
) &&
4049 !(type
& REF_ISSYMREF
) &&
4050 !is_null_oid(&cb
.last_kept_oid
);
4052 if (close_lock_file(&reflog_lock
)) {
4053 status
|= error("couldn't write %s: %s", log_file
,
4055 } else if (update
&&
4056 (write_in_full(get_lock_file_fd(lock
->lk
),
4057 oid_to_hex(&cb
.last_kept_oid
), GIT_SHA1_HEXSZ
) != GIT_SHA1_HEXSZ
||
4058 write_str_in_full(get_lock_file_fd(lock
->lk
), "\n") != 1 ||
4059 close_ref(lock
) < 0)) {
4060 status
|= error("couldn't write %s",
4061 get_lock_file_path(lock
->lk
));
4062 rollback_lock_file(&reflog_lock
);
4063 } else if (commit_lock_file(&reflog_lock
)) {
4064 status
|= error("unable to write reflog '%s' (%s)",
4065 log_file
, strerror(errno
));
4066 } else if (update
&& commit_ref(lock
)) {
4067 status
|= error("couldn't set %s", lock
->ref_name
);
4075 rollback_lock_file(&reflog_lock
);
4081 static int files_init_db(struct ref_store
*ref_store
, struct strbuf
*err
)
4083 /* Check validity (but we don't need the result): */
4084 files_downcast(ref_store
, 0, "init_db");
4087 * Create .git/refs/{heads,tags}
4089 safe_create_dir(git_path("refs/heads"), 1);
4090 safe_create_dir(git_path("refs/tags"), 1);
4091 if (get_shared_repository()) {
4092 adjust_shared_perm(git_path("refs/heads"));
4093 adjust_shared_perm(git_path("refs/tags"));
4098 struct ref_storage_be refs_be_files
= {
4101 files_ref_store_create
,
4103 files_transaction_commit
,
4104 files_initial_transaction_commit
,
4108 files_create_symref
,
4112 files_ref_iterator_begin
,
4114 files_verify_refname_available
,
4116 files_reflog_iterator_begin
,
4117 files_for_each_reflog_ent
,
4118 files_for_each_reflog_ent_reverse
,
4119 files_reflog_exists
,
4120 files_create_reflog
,
4121 files_delete_reflog
,