branch: roll show_detached HEAD into regular ref_list
[alt-git.git] / refs.c
blob943ac5ef519538368ac5eb49316c34ce3e36ba07
1 #include "cache.h"
2 #include "lockfile.h"
3 #include "refs.h"
4 #include "object.h"
5 #include "tag.h"
6 #include "dir.h"
7 #include "string-list.h"
9 struct ref_lock {
10 char *ref_name;
11 char *orig_ref_name;
12 struct lock_file *lk;
13 struct object_id old_oid;
17 * How to handle various characters in refnames:
18 * 0: An acceptable character for refs
19 * 1: End-of-component
20 * 2: ., look for a preceding . to reject .. in refs
21 * 3: {, look for a preceding @ to reject @{ in refs
22 * 4: A bad character: ASCII control characters, and
23 * ":", "?", "[", "\", "^", "~", SP, or TAB
24 * 5: *, reject unless REFNAME_REFSPEC_PATTERN is set
26 static unsigned char refname_disposition[256] = {
27 1, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
28 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
29 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 2, 1,
30 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 4,
31 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
32 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 4, 0, 4, 0,
33 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
34 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 4, 4
38 * Flag passed to lock_ref_sha1_basic() telling it to tolerate broken
39 * refs (i.e., because the reference is about to be deleted anyway).
41 #define REF_DELETING 0x02
44 * Used as a flag in ref_update::flags when a loose ref is being
45 * pruned.
47 #define REF_ISPRUNING 0x04
50 * Used as a flag in ref_update::flags when the reference should be
51 * updated to new_sha1.
53 #define REF_HAVE_NEW 0x08
56 * Used as a flag in ref_update::flags when old_sha1 should be
57 * checked.
59 #define REF_HAVE_OLD 0x10
62 * Used as a flag in ref_update::flags when the lockfile needs to be
63 * committed.
65 #define REF_NEEDS_COMMIT 0x20
68 * 0x40 is REF_FORCE_CREATE_REFLOG, so skip it if you're adding a
69 * value to ref_update::flags
73 * Try to read one refname component from the front of refname.
74 * Return the length of the component found, or -1 if the component is
75 * not legal. It is legal if it is something reasonable to have under
76 * ".git/refs/"; We do not like it if:
78 * - any path component of it begins with ".", or
79 * - it has double dots "..", or
80 * - it has ASCII control characters, or
81 * - it has ":", "?", "[", "\", "^", "~", SP, or TAB anywhere, or
82 * - it has "*" anywhere unless REFNAME_REFSPEC_PATTERN is set, or
83 * - it ends with a "/", or
84 * - it ends with ".lock", or
85 * - it contains a "@{" portion
87 static int check_refname_component(const char *refname, int *flags)
89 const char *cp;
90 char last = '\0';
92 for (cp = refname; ; cp++) {
93 int ch = *cp & 255;
94 unsigned char disp = refname_disposition[ch];
95 switch (disp) {
96 case 1:
97 goto out;
98 case 2:
99 if (last == '.')
100 return -1; /* Refname contains "..". */
101 break;
102 case 3:
103 if (last == '@')
104 return -1; /* Refname contains "@{". */
105 break;
106 case 4:
107 return -1;
108 case 5:
109 if (!(*flags & REFNAME_REFSPEC_PATTERN))
110 return -1; /* refspec can't be a pattern */
113 * Unset the pattern flag so that we only accept
114 * a single asterisk for one side of refspec.
116 *flags &= ~ REFNAME_REFSPEC_PATTERN;
117 break;
119 last = ch;
121 out:
122 if (cp == refname)
123 return 0; /* Component has zero length. */
124 if (refname[0] == '.')
125 return -1; /* Component starts with '.'. */
126 if (cp - refname >= LOCK_SUFFIX_LEN &&
127 !memcmp(cp - LOCK_SUFFIX_LEN, LOCK_SUFFIX, LOCK_SUFFIX_LEN))
128 return -1; /* Refname ends with ".lock". */
129 return cp - refname;
132 int check_refname_format(const char *refname, int flags)
134 int component_len, component_count = 0;
136 if (!strcmp(refname, "@"))
137 /* Refname is a single character '@'. */
138 return -1;
140 while (1) {
141 /* We are at the start of a path component. */
142 component_len = check_refname_component(refname, &flags);
143 if (component_len <= 0)
144 return -1;
146 component_count++;
147 if (refname[component_len] == '\0')
148 break;
149 /* Skip to next component. */
150 refname += component_len + 1;
153 if (refname[component_len - 1] == '.')
154 return -1; /* Refname ends with '.'. */
155 if (!(flags & REFNAME_ALLOW_ONELEVEL) && component_count < 2)
156 return -1; /* Refname has only one component. */
157 return 0;
160 struct ref_entry;
163 * Information used (along with the information in ref_entry) to
164 * describe a single cached reference. This data structure only
165 * occurs embedded in a union in struct ref_entry, and only when
166 * (ref_entry->flag & REF_DIR) is zero.
168 struct ref_value {
170 * The name of the object to which this reference resolves
171 * (which may be a tag object). If REF_ISBROKEN, this is
172 * null. If REF_ISSYMREF, then this is the name of the object
173 * referred to by the last reference in the symlink chain.
175 struct object_id oid;
178 * If REF_KNOWS_PEELED, then this field holds the peeled value
179 * of this reference, or null if the reference is known not to
180 * be peelable. See the documentation for peel_ref() for an
181 * exact definition of "peelable".
183 struct object_id peeled;
186 struct ref_cache;
189 * Information used (along with the information in ref_entry) to
190 * describe a level in the hierarchy of references. This data
191 * structure only occurs embedded in a union in struct ref_entry, and
192 * only when (ref_entry.flag & REF_DIR) is set. In that case,
193 * (ref_entry.flag & REF_INCOMPLETE) determines whether the references
194 * in the directory have already been read:
196 * (ref_entry.flag & REF_INCOMPLETE) unset -- a directory of loose
197 * or packed references, already read.
199 * (ref_entry.flag & REF_INCOMPLETE) set -- a directory of loose
200 * references that hasn't been read yet (nor has any of its
201 * subdirectories).
203 * Entries within a directory are stored within a growable array of
204 * pointers to ref_entries (entries, nr, alloc). Entries 0 <= i <
205 * sorted are sorted by their component name in strcmp() order and the
206 * remaining entries are unsorted.
208 * Loose references are read lazily, one directory at a time. When a
209 * directory of loose references is read, then all of the references
210 * in that directory are stored, and REF_INCOMPLETE stubs are created
211 * for any subdirectories, but the subdirectories themselves are not
212 * read. The reading is triggered by get_ref_dir().
214 struct ref_dir {
215 int nr, alloc;
218 * Entries with index 0 <= i < sorted are sorted by name. New
219 * entries are appended to the list unsorted, and are sorted
220 * only when required; thus we avoid the need to sort the list
221 * after the addition of every reference.
223 int sorted;
225 /* A pointer to the ref_cache that contains this ref_dir. */
226 struct ref_cache *ref_cache;
228 struct ref_entry **entries;
232 * Bit values for ref_entry::flag. REF_ISSYMREF=0x01,
233 * REF_ISPACKED=0x02, REF_ISBROKEN=0x04 and REF_BAD_NAME=0x08 are
234 * public values; see refs.h.
238 * The field ref_entry->u.value.peeled of this value entry contains
239 * the correct peeled value for the reference, which might be
240 * null_sha1 if the reference is not a tag or if it is broken.
242 #define REF_KNOWS_PEELED 0x10
244 /* ref_entry represents a directory of references */
245 #define REF_DIR 0x20
248 * Entry has not yet been read from disk (used only for REF_DIR
249 * entries representing loose references)
251 #define REF_INCOMPLETE 0x40
254 * A ref_entry represents either a reference or a "subdirectory" of
255 * references.
257 * Each directory in the reference namespace is represented by a
258 * ref_entry with (flags & REF_DIR) set and containing a subdir member
259 * that holds the entries in that directory that have been read so
260 * far. If (flags & REF_INCOMPLETE) is set, then the directory and
261 * its subdirectories haven't been read yet. REF_INCOMPLETE is only
262 * used for loose reference directories.
264 * References are represented by a ref_entry with (flags & REF_DIR)
265 * unset and a value member that describes the reference's value. The
266 * flag member is at the ref_entry level, but it is also needed to
267 * interpret the contents of the value field (in other words, a
268 * ref_value object is not very much use without the enclosing
269 * ref_entry).
271 * Reference names cannot end with slash and directories' names are
272 * always stored with a trailing slash (except for the top-level
273 * directory, which is always denoted by ""). This has two nice
274 * consequences: (1) when the entries in each subdir are sorted
275 * lexicographically by name (as they usually are), the references in
276 * a whole tree can be generated in lexicographic order by traversing
277 * the tree in left-to-right, depth-first order; (2) the names of
278 * references and subdirectories cannot conflict, and therefore the
279 * presence of an empty subdirectory does not block the creation of a
280 * similarly-named reference. (The fact that reference names with the
281 * same leading components can conflict *with each other* is a
282 * separate issue that is regulated by verify_refname_available().)
284 * Please note that the name field contains the fully-qualified
285 * reference (or subdirectory) name. Space could be saved by only
286 * storing the relative names. But that would require the full names
287 * to be generated on the fly when iterating in do_for_each_ref(), and
288 * would break callback functions, who have always been able to assume
289 * that the name strings that they are passed will not be freed during
290 * the iteration.
292 struct ref_entry {
293 unsigned char flag; /* ISSYMREF? ISPACKED? */
294 union {
295 struct ref_value value; /* if not (flags&REF_DIR) */
296 struct ref_dir subdir; /* if (flags&REF_DIR) */
297 } u;
299 * The full name of the reference (e.g., "refs/heads/master")
300 * or the full name of the directory with a trailing slash
301 * (e.g., "refs/heads/"):
303 char name[FLEX_ARRAY];
306 static void read_loose_refs(const char *dirname, struct ref_dir *dir);
308 static struct ref_dir *get_ref_dir(struct ref_entry *entry)
310 struct ref_dir *dir;
311 assert(entry->flag & REF_DIR);
312 dir = &entry->u.subdir;
313 if (entry->flag & REF_INCOMPLETE) {
314 read_loose_refs(entry->name, dir);
315 entry->flag &= ~REF_INCOMPLETE;
317 return dir;
321 * Check if a refname is safe.
322 * For refs that start with "refs/" we consider it safe as long they do
323 * not try to resolve to outside of refs/.
325 * For all other refs we only consider them safe iff they only contain
326 * upper case characters and '_' (like "HEAD" AND "MERGE_HEAD", and not like
327 * "config").
329 static int refname_is_safe(const char *refname)
331 if (starts_with(refname, "refs/")) {
332 char *buf;
333 int result;
335 buf = xmalloc(strlen(refname) + 1);
337 * Does the refname try to escape refs/?
338 * For example: refs/foo/../bar is safe but refs/foo/../../bar
339 * is not.
341 result = !normalize_path_copy(buf, refname + strlen("refs/"));
342 free(buf);
343 return result;
345 while (*refname) {
346 if (!isupper(*refname) && *refname != '_')
347 return 0;
348 refname++;
350 return 1;
353 static struct ref_entry *create_ref_entry(const char *refname,
354 const unsigned char *sha1, int flag,
355 int check_name)
357 int len;
358 struct ref_entry *ref;
360 if (check_name &&
361 check_refname_format(refname, REFNAME_ALLOW_ONELEVEL))
362 die("Reference has invalid format: '%s'", refname);
363 len = strlen(refname) + 1;
364 ref = xmalloc(sizeof(struct ref_entry) + len);
365 hashcpy(ref->u.value.oid.hash, sha1);
366 oidclr(&ref->u.value.peeled);
367 memcpy(ref->name, refname, len);
368 ref->flag = flag;
369 return ref;
372 static void clear_ref_dir(struct ref_dir *dir);
374 static void free_ref_entry(struct ref_entry *entry)
376 if (entry->flag & REF_DIR) {
378 * Do not use get_ref_dir() here, as that might
379 * trigger the reading of loose refs.
381 clear_ref_dir(&entry->u.subdir);
383 free(entry);
387 * Add a ref_entry to the end of dir (unsorted). Entry is always
388 * stored directly in dir; no recursion into subdirectories is
389 * done.
391 static void add_entry_to_dir(struct ref_dir *dir, struct ref_entry *entry)
393 ALLOC_GROW(dir->entries, dir->nr + 1, dir->alloc);
394 dir->entries[dir->nr++] = entry;
395 /* optimize for the case that entries are added in order */
396 if (dir->nr == 1 ||
397 (dir->nr == dir->sorted + 1 &&
398 strcmp(dir->entries[dir->nr - 2]->name,
399 dir->entries[dir->nr - 1]->name) < 0))
400 dir->sorted = dir->nr;
404 * Clear and free all entries in dir, recursively.
406 static void clear_ref_dir(struct ref_dir *dir)
408 int i;
409 for (i = 0; i < dir->nr; i++)
410 free_ref_entry(dir->entries[i]);
411 free(dir->entries);
412 dir->sorted = dir->nr = dir->alloc = 0;
413 dir->entries = NULL;
417 * Create a struct ref_entry object for the specified dirname.
418 * dirname is the name of the directory with a trailing slash (e.g.,
419 * "refs/heads/") or "" for the top-level directory.
421 static struct ref_entry *create_dir_entry(struct ref_cache *ref_cache,
422 const char *dirname, size_t len,
423 int incomplete)
425 struct ref_entry *direntry;
426 direntry = xcalloc(1, sizeof(struct ref_entry) + len + 1);
427 memcpy(direntry->name, dirname, len);
428 direntry->name[len] = '\0';
429 direntry->u.subdir.ref_cache = ref_cache;
430 direntry->flag = REF_DIR | (incomplete ? REF_INCOMPLETE : 0);
431 return direntry;
434 static int ref_entry_cmp(const void *a, const void *b)
436 struct ref_entry *one = *(struct ref_entry **)a;
437 struct ref_entry *two = *(struct ref_entry **)b;
438 return strcmp(one->name, two->name);
441 static void sort_ref_dir(struct ref_dir *dir);
443 struct string_slice {
444 size_t len;
445 const char *str;
448 static int ref_entry_cmp_sslice(const void *key_, const void *ent_)
450 const struct string_slice *key = key_;
451 const struct ref_entry *ent = *(const struct ref_entry * const *)ent_;
452 int cmp = strncmp(key->str, ent->name, key->len);
453 if (cmp)
454 return cmp;
455 return '\0' - (unsigned char)ent->name[key->len];
459 * Return the index of the entry with the given refname from the
460 * ref_dir (non-recursively), sorting dir if necessary. Return -1 if
461 * no such entry is found. dir must already be complete.
463 static int search_ref_dir(struct ref_dir *dir, const char *refname, size_t len)
465 struct ref_entry **r;
466 struct string_slice key;
468 if (refname == NULL || !dir->nr)
469 return -1;
471 sort_ref_dir(dir);
472 key.len = len;
473 key.str = refname;
474 r = bsearch(&key, dir->entries, dir->nr, sizeof(*dir->entries),
475 ref_entry_cmp_sslice);
477 if (r == NULL)
478 return -1;
480 return r - dir->entries;
484 * Search for a directory entry directly within dir (without
485 * recursing). Sort dir if necessary. subdirname must be a directory
486 * name (i.e., end in '/'). If mkdir is set, then create the
487 * directory if it is missing; otherwise, return NULL if the desired
488 * directory cannot be found. dir must already be complete.
490 static struct ref_dir *search_for_subdir(struct ref_dir *dir,
491 const char *subdirname, size_t len,
492 int mkdir)
494 int entry_index = search_ref_dir(dir, subdirname, len);
495 struct ref_entry *entry;
496 if (entry_index == -1) {
497 if (!mkdir)
498 return NULL;
500 * Since dir is complete, the absence of a subdir
501 * means that the subdir really doesn't exist;
502 * therefore, create an empty record for it but mark
503 * the record complete.
505 entry = create_dir_entry(dir->ref_cache, subdirname, len, 0);
506 add_entry_to_dir(dir, entry);
507 } else {
508 entry = dir->entries[entry_index];
510 return get_ref_dir(entry);
514 * If refname is a reference name, find the ref_dir within the dir
515 * tree that should hold refname. If refname is a directory name
516 * (i.e., ends in '/'), then return that ref_dir itself. dir must
517 * represent the top-level directory and must already be complete.
518 * Sort ref_dirs and recurse into subdirectories as necessary. If
519 * mkdir is set, then create any missing directories; otherwise,
520 * return NULL if the desired directory cannot be found.
522 static struct ref_dir *find_containing_dir(struct ref_dir *dir,
523 const char *refname, int mkdir)
525 const char *slash;
526 for (slash = strchr(refname, '/'); slash; slash = strchr(slash + 1, '/')) {
527 size_t dirnamelen = slash - refname + 1;
528 struct ref_dir *subdir;
529 subdir = search_for_subdir(dir, refname, dirnamelen, mkdir);
530 if (!subdir) {
531 dir = NULL;
532 break;
534 dir = subdir;
537 return dir;
541 * Find the value entry with the given name in dir, sorting ref_dirs
542 * and recursing into subdirectories as necessary. If the name is not
543 * found or it corresponds to a directory entry, return NULL.
545 static struct ref_entry *find_ref(struct ref_dir *dir, const char *refname)
547 int entry_index;
548 struct ref_entry *entry;
549 dir = find_containing_dir(dir, refname, 0);
550 if (!dir)
551 return NULL;
552 entry_index = search_ref_dir(dir, refname, strlen(refname));
553 if (entry_index == -1)
554 return NULL;
555 entry = dir->entries[entry_index];
556 return (entry->flag & REF_DIR) ? NULL : entry;
560 * Remove the entry with the given name from dir, recursing into
561 * subdirectories as necessary. If refname is the name of a directory
562 * (i.e., ends with '/'), then remove the directory and its contents.
563 * If the removal was successful, return the number of entries
564 * remaining in the directory entry that contained the deleted entry.
565 * If the name was not found, return -1. Please note that this
566 * function only deletes the entry from the cache; it does not delete
567 * it from the filesystem or ensure that other cache entries (which
568 * might be symbolic references to the removed entry) are updated.
569 * Nor does it remove any containing dir entries that might be made
570 * empty by the removal. dir must represent the top-level directory
571 * and must already be complete.
573 static int remove_entry(struct ref_dir *dir, const char *refname)
575 int refname_len = strlen(refname);
576 int entry_index;
577 struct ref_entry *entry;
578 int is_dir = refname[refname_len - 1] == '/';
579 if (is_dir) {
581 * refname represents a reference directory. Remove
582 * the trailing slash; otherwise we will get the
583 * directory *representing* refname rather than the
584 * one *containing* it.
586 char *dirname = xmemdupz(refname, refname_len - 1);
587 dir = find_containing_dir(dir, dirname, 0);
588 free(dirname);
589 } else {
590 dir = find_containing_dir(dir, refname, 0);
592 if (!dir)
593 return -1;
594 entry_index = search_ref_dir(dir, refname, refname_len);
595 if (entry_index == -1)
596 return -1;
597 entry = dir->entries[entry_index];
599 memmove(&dir->entries[entry_index],
600 &dir->entries[entry_index + 1],
601 (dir->nr - entry_index - 1) * sizeof(*dir->entries)
603 dir->nr--;
604 if (dir->sorted > entry_index)
605 dir->sorted--;
606 free_ref_entry(entry);
607 return dir->nr;
611 * Add a ref_entry to the ref_dir (unsorted), recursing into
612 * subdirectories as necessary. dir must represent the top-level
613 * directory. Return 0 on success.
615 static int add_ref(struct ref_dir *dir, struct ref_entry *ref)
617 dir = find_containing_dir(dir, ref->name, 1);
618 if (!dir)
619 return -1;
620 add_entry_to_dir(dir, ref);
621 return 0;
625 * Emit a warning and return true iff ref1 and ref2 have the same name
626 * and the same sha1. Die if they have the same name but different
627 * sha1s.
629 static int is_dup_ref(const struct ref_entry *ref1, const struct ref_entry *ref2)
631 if (strcmp(ref1->name, ref2->name))
632 return 0;
634 /* Duplicate name; make sure that they don't conflict: */
636 if ((ref1->flag & REF_DIR) || (ref2->flag & REF_DIR))
637 /* This is impossible by construction */
638 die("Reference directory conflict: %s", ref1->name);
640 if (oidcmp(&ref1->u.value.oid, &ref2->u.value.oid))
641 die("Duplicated ref, and SHA1s don't match: %s", ref1->name);
643 warning("Duplicated ref: %s", ref1->name);
644 return 1;
648 * Sort the entries in dir non-recursively (if they are not already
649 * sorted) and remove any duplicate entries.
651 static void sort_ref_dir(struct ref_dir *dir)
653 int i, j;
654 struct ref_entry *last = NULL;
657 * This check also prevents passing a zero-length array to qsort(),
658 * which is a problem on some platforms.
660 if (dir->sorted == dir->nr)
661 return;
663 qsort(dir->entries, dir->nr, sizeof(*dir->entries), ref_entry_cmp);
665 /* Remove any duplicates: */
666 for (i = 0, j = 0; j < dir->nr; j++) {
667 struct ref_entry *entry = dir->entries[j];
668 if (last && is_dup_ref(last, entry))
669 free_ref_entry(entry);
670 else
671 last = dir->entries[i++] = entry;
673 dir->sorted = dir->nr = i;
676 /* Include broken references in a do_for_each_ref*() iteration: */
677 #define DO_FOR_EACH_INCLUDE_BROKEN 0x01
680 * Return true iff the reference described by entry can be resolved to
681 * an object in the database. Emit a warning if the referred-to
682 * object does not exist.
684 static int ref_resolves_to_object(struct ref_entry *entry)
686 if (entry->flag & REF_ISBROKEN)
687 return 0;
688 if (!has_sha1_file(entry->u.value.oid.hash)) {
689 error("%s does not point to a valid object!", entry->name);
690 return 0;
692 return 1;
696 * current_ref is a performance hack: when iterating over references
697 * using the for_each_ref*() functions, current_ref is set to the
698 * current reference's entry before calling the callback function. If
699 * the callback function calls peel_ref(), then peel_ref() first
700 * checks whether the reference to be peeled is the current reference
701 * (it usually is) and if so, returns that reference's peeled version
702 * if it is available. This avoids a refname lookup in a common case.
704 static struct ref_entry *current_ref;
706 typedef int each_ref_entry_fn(struct ref_entry *entry, void *cb_data);
708 struct ref_entry_cb {
709 const char *base;
710 int trim;
711 int flags;
712 each_ref_fn *fn;
713 void *cb_data;
717 * Handle one reference in a do_for_each_ref*()-style iteration,
718 * calling an each_ref_fn for each entry.
720 static int do_one_ref(struct ref_entry *entry, void *cb_data)
722 struct ref_entry_cb *data = cb_data;
723 struct ref_entry *old_current_ref;
724 int retval;
726 if (!starts_with(entry->name, data->base))
727 return 0;
729 if (!(data->flags & DO_FOR_EACH_INCLUDE_BROKEN) &&
730 !ref_resolves_to_object(entry))
731 return 0;
733 /* Store the old value, in case this is a recursive call: */
734 old_current_ref = current_ref;
735 current_ref = entry;
736 retval = data->fn(entry->name + data->trim, &entry->u.value.oid,
737 entry->flag, data->cb_data);
738 current_ref = old_current_ref;
739 return retval;
743 * Call fn for each reference in dir that has index in the range
744 * offset <= index < dir->nr. Recurse into subdirectories that are in
745 * that index range, sorting them before iterating. This function
746 * does not sort dir itself; it should be sorted beforehand. fn is
747 * called for all references, including broken ones.
749 static int do_for_each_entry_in_dir(struct ref_dir *dir, int offset,
750 each_ref_entry_fn fn, void *cb_data)
752 int i;
753 assert(dir->sorted == dir->nr);
754 for (i = offset; i < dir->nr; i++) {
755 struct ref_entry *entry = dir->entries[i];
756 int retval;
757 if (entry->flag & REF_DIR) {
758 struct ref_dir *subdir = get_ref_dir(entry);
759 sort_ref_dir(subdir);
760 retval = do_for_each_entry_in_dir(subdir, 0, fn, cb_data);
761 } else {
762 retval = fn(entry, cb_data);
764 if (retval)
765 return retval;
767 return 0;
771 * Call fn for each reference in the union of dir1 and dir2, in order
772 * by refname. Recurse into subdirectories. If a value entry appears
773 * in both dir1 and dir2, then only process the version that is in
774 * dir2. The input dirs must already be sorted, but subdirs will be
775 * sorted as needed. fn is called for all references, including
776 * broken ones.
778 static int do_for_each_entry_in_dirs(struct ref_dir *dir1,
779 struct ref_dir *dir2,
780 each_ref_entry_fn fn, void *cb_data)
782 int retval;
783 int i1 = 0, i2 = 0;
785 assert(dir1->sorted == dir1->nr);
786 assert(dir2->sorted == dir2->nr);
787 while (1) {
788 struct ref_entry *e1, *e2;
789 int cmp;
790 if (i1 == dir1->nr) {
791 return do_for_each_entry_in_dir(dir2, i2, fn, cb_data);
793 if (i2 == dir2->nr) {
794 return do_for_each_entry_in_dir(dir1, i1, fn, cb_data);
796 e1 = dir1->entries[i1];
797 e2 = dir2->entries[i2];
798 cmp = strcmp(e1->name, e2->name);
799 if (cmp == 0) {
800 if ((e1->flag & REF_DIR) && (e2->flag & REF_DIR)) {
801 /* Both are directories; descend them in parallel. */
802 struct ref_dir *subdir1 = get_ref_dir(e1);
803 struct ref_dir *subdir2 = get_ref_dir(e2);
804 sort_ref_dir(subdir1);
805 sort_ref_dir(subdir2);
806 retval = do_for_each_entry_in_dirs(
807 subdir1, subdir2, fn, cb_data);
808 i1++;
809 i2++;
810 } else if (!(e1->flag & REF_DIR) && !(e2->flag & REF_DIR)) {
811 /* Both are references; ignore the one from dir1. */
812 retval = fn(e2, cb_data);
813 i1++;
814 i2++;
815 } else {
816 die("conflict between reference and directory: %s",
817 e1->name);
819 } else {
820 struct ref_entry *e;
821 if (cmp < 0) {
822 e = e1;
823 i1++;
824 } else {
825 e = e2;
826 i2++;
828 if (e->flag & REF_DIR) {
829 struct ref_dir *subdir = get_ref_dir(e);
830 sort_ref_dir(subdir);
831 retval = do_for_each_entry_in_dir(
832 subdir, 0, fn, cb_data);
833 } else {
834 retval = fn(e, cb_data);
837 if (retval)
838 return retval;
843 * Load all of the refs from the dir into our in-memory cache. The hard work
844 * of loading loose refs is done by get_ref_dir(), so we just need to recurse
845 * through all of the sub-directories. We do not even need to care about
846 * sorting, as traversal order does not matter to us.
848 static void prime_ref_dir(struct ref_dir *dir)
850 int i;
851 for (i = 0; i < dir->nr; i++) {
852 struct ref_entry *entry = dir->entries[i];
853 if (entry->flag & REF_DIR)
854 prime_ref_dir(get_ref_dir(entry));
858 struct nonmatching_ref_data {
859 const struct string_list *skip;
860 const char *conflicting_refname;
863 static int nonmatching_ref_fn(struct ref_entry *entry, void *vdata)
865 struct nonmatching_ref_data *data = vdata;
867 if (data->skip && string_list_has_string(data->skip, entry->name))
868 return 0;
870 data->conflicting_refname = entry->name;
871 return 1;
875 * Return 0 if a reference named refname could be created without
876 * conflicting with the name of an existing reference in dir.
877 * Otherwise, return a negative value and write an explanation to err.
878 * If extras is non-NULL, it is a list of additional refnames with
879 * which refname is not allowed to conflict. If skip is non-NULL,
880 * ignore potential conflicts with refs in skip (e.g., because they
881 * are scheduled for deletion in the same operation). Behavior is
882 * undefined if the same name is listed in both extras and skip.
884 * Two reference names conflict if one of them exactly matches the
885 * leading components of the other; e.g., "refs/foo/bar" conflicts
886 * with both "refs/foo" and with "refs/foo/bar/baz" but not with
887 * "refs/foo/bar" or "refs/foo/barbados".
889 * extras and skip must be sorted.
891 static int verify_refname_available(const char *refname,
892 const struct string_list *extras,
893 const struct string_list *skip,
894 struct ref_dir *dir,
895 struct strbuf *err)
897 const char *slash;
898 int pos;
899 struct strbuf dirname = STRBUF_INIT;
900 int ret = -1;
903 * For the sake of comments in this function, suppose that
904 * refname is "refs/foo/bar".
907 assert(err);
909 strbuf_grow(&dirname, strlen(refname) + 1);
910 for (slash = strchr(refname, '/'); slash; slash = strchr(slash + 1, '/')) {
911 /* Expand dirname to the new prefix, not including the trailing slash: */
912 strbuf_add(&dirname, refname + dirname.len, slash - refname - dirname.len);
915 * We are still at a leading dir of the refname (e.g.,
916 * "refs/foo"; if there is a reference with that name,
917 * it is a conflict, *unless* it is in skip.
919 if (dir) {
920 pos = search_ref_dir(dir, dirname.buf, dirname.len);
921 if (pos >= 0 &&
922 (!skip || !string_list_has_string(skip, dirname.buf))) {
924 * We found a reference whose name is
925 * a proper prefix of refname; e.g.,
926 * "refs/foo", and is not in skip.
928 strbuf_addf(err, "'%s' exists; cannot create '%s'",
929 dirname.buf, refname);
930 goto cleanup;
934 if (extras && string_list_has_string(extras, dirname.buf) &&
935 (!skip || !string_list_has_string(skip, dirname.buf))) {
936 strbuf_addf(err, "cannot process '%s' and '%s' at the same time",
937 refname, dirname.buf);
938 goto cleanup;
942 * Otherwise, we can try to continue our search with
943 * the next component. So try to look up the
944 * directory, e.g., "refs/foo/". If we come up empty,
945 * we know there is nothing under this whole prefix,
946 * but even in that case we still have to continue the
947 * search for conflicts with extras.
949 strbuf_addch(&dirname, '/');
950 if (dir) {
951 pos = search_ref_dir(dir, dirname.buf, dirname.len);
952 if (pos < 0) {
954 * There was no directory "refs/foo/",
955 * so there is nothing under this
956 * whole prefix. So there is no need
957 * to continue looking for conflicting
958 * references. But we need to continue
959 * looking for conflicting extras.
961 dir = NULL;
962 } else {
963 dir = get_ref_dir(dir->entries[pos]);
969 * We are at the leaf of our refname (e.g., "refs/foo/bar").
970 * There is no point in searching for a reference with that
971 * name, because a refname isn't considered to conflict with
972 * itself. But we still need to check for references whose
973 * names are in the "refs/foo/bar/" namespace, because they
974 * *do* conflict.
976 strbuf_addstr(&dirname, refname + dirname.len);
977 strbuf_addch(&dirname, '/');
979 if (dir) {
980 pos = search_ref_dir(dir, dirname.buf, dirname.len);
982 if (pos >= 0) {
984 * We found a directory named "$refname/"
985 * (e.g., "refs/foo/bar/"). It is a problem
986 * iff it contains any ref that is not in
987 * "skip".
989 struct nonmatching_ref_data data;
991 data.skip = skip;
992 data.conflicting_refname = NULL;
993 dir = get_ref_dir(dir->entries[pos]);
994 sort_ref_dir(dir);
995 if (do_for_each_entry_in_dir(dir, 0, nonmatching_ref_fn, &data)) {
996 strbuf_addf(err, "'%s' exists; cannot create '%s'",
997 data.conflicting_refname, refname);
998 goto cleanup;
1003 if (extras) {
1005 * Check for entries in extras that start with
1006 * "$refname/". We do that by looking for the place
1007 * where "$refname/" would be inserted in extras. If
1008 * there is an entry at that position that starts with
1009 * "$refname/" and is not in skip, then we have a
1010 * conflict.
1012 for (pos = string_list_find_insert_index(extras, dirname.buf, 0);
1013 pos < extras->nr; pos++) {
1014 const char *extra_refname = extras->items[pos].string;
1016 if (!starts_with(extra_refname, dirname.buf))
1017 break;
1019 if (!skip || !string_list_has_string(skip, extra_refname)) {
1020 strbuf_addf(err, "cannot process '%s' and '%s' at the same time",
1021 refname, extra_refname);
1022 goto cleanup;
1027 /* No conflicts were found */
1028 ret = 0;
1030 cleanup:
1031 strbuf_release(&dirname);
1032 return ret;
1035 struct packed_ref_cache {
1036 struct ref_entry *root;
1039 * Count of references to the data structure in this instance,
1040 * including the pointer from ref_cache::packed if any. The
1041 * data will not be freed as long as the reference count is
1042 * nonzero.
1044 unsigned int referrers;
1047 * Iff the packed-refs file associated with this instance is
1048 * currently locked for writing, this points at the associated
1049 * lock (which is owned by somebody else). The referrer count
1050 * is also incremented when the file is locked and decremented
1051 * when it is unlocked.
1053 struct lock_file *lock;
1055 /* The metadata from when this packed-refs cache was read */
1056 struct stat_validity validity;
1060 * Future: need to be in "struct repository"
1061 * when doing a full libification.
1063 static struct ref_cache {
1064 struct ref_cache *next;
1065 struct ref_entry *loose;
1066 struct packed_ref_cache *packed;
1068 * The submodule name, or "" for the main repo. We allocate
1069 * length 1 rather than FLEX_ARRAY so that the main ref_cache
1070 * is initialized correctly.
1072 char name[1];
1073 } ref_cache, *submodule_ref_caches;
1075 /* Lock used for the main packed-refs file: */
1076 static struct lock_file packlock;
1079 * Increment the reference count of *packed_refs.
1081 static void acquire_packed_ref_cache(struct packed_ref_cache *packed_refs)
1083 packed_refs->referrers++;
1087 * Decrease the reference count of *packed_refs. If it goes to zero,
1088 * free *packed_refs and return true; otherwise return false.
1090 static int release_packed_ref_cache(struct packed_ref_cache *packed_refs)
1092 if (!--packed_refs->referrers) {
1093 free_ref_entry(packed_refs->root);
1094 stat_validity_clear(&packed_refs->validity);
1095 free(packed_refs);
1096 return 1;
1097 } else {
1098 return 0;
1102 static void clear_packed_ref_cache(struct ref_cache *refs)
1104 if (refs->packed) {
1105 struct packed_ref_cache *packed_refs = refs->packed;
1107 if (packed_refs->lock)
1108 die("internal error: packed-ref cache cleared while locked");
1109 refs->packed = NULL;
1110 release_packed_ref_cache(packed_refs);
1114 static void clear_loose_ref_cache(struct ref_cache *refs)
1116 if (refs->loose) {
1117 free_ref_entry(refs->loose);
1118 refs->loose = NULL;
1122 static struct ref_cache *create_ref_cache(const char *submodule)
1124 int len;
1125 struct ref_cache *refs;
1126 if (!submodule)
1127 submodule = "";
1128 len = strlen(submodule) + 1;
1129 refs = xcalloc(1, sizeof(struct ref_cache) + len);
1130 memcpy(refs->name, submodule, len);
1131 return refs;
1135 * Return a pointer to a ref_cache for the specified submodule. For
1136 * the main repository, use submodule==NULL. The returned structure
1137 * will be allocated and initialized but not necessarily populated; it
1138 * should not be freed.
1140 static struct ref_cache *get_ref_cache(const char *submodule)
1142 struct ref_cache *refs;
1144 if (!submodule || !*submodule)
1145 return &ref_cache;
1147 for (refs = submodule_ref_caches; refs; refs = refs->next)
1148 if (!strcmp(submodule, refs->name))
1149 return refs;
1151 refs = create_ref_cache(submodule);
1152 refs->next = submodule_ref_caches;
1153 submodule_ref_caches = refs;
1154 return refs;
1157 /* The length of a peeled reference line in packed-refs, including EOL: */
1158 #define PEELED_LINE_LENGTH 42
1161 * The packed-refs header line that we write out. Perhaps other
1162 * traits will be added later. The trailing space is required.
1164 static const char PACKED_REFS_HEADER[] =
1165 "# pack-refs with: peeled fully-peeled \n";
1168 * Parse one line from a packed-refs file. Write the SHA1 to sha1.
1169 * Return a pointer to the refname within the line (null-terminated),
1170 * or NULL if there was a problem.
1172 static const char *parse_ref_line(struct strbuf *line, unsigned char *sha1)
1174 const char *ref;
1177 * 42: the answer to everything.
1179 * In this case, it happens to be the answer to
1180 * 40 (length of sha1 hex representation)
1181 * +1 (space in between hex and name)
1182 * +1 (newline at the end of the line)
1184 if (line->len <= 42)
1185 return NULL;
1187 if (get_sha1_hex(line->buf, sha1) < 0)
1188 return NULL;
1189 if (!isspace(line->buf[40]))
1190 return NULL;
1192 ref = line->buf + 41;
1193 if (isspace(*ref))
1194 return NULL;
1196 if (line->buf[line->len - 1] != '\n')
1197 return NULL;
1198 line->buf[--line->len] = 0;
1200 return ref;
1204 * Read f, which is a packed-refs file, into dir.
1206 * A comment line of the form "# pack-refs with: " may contain zero or
1207 * more traits. We interpret the traits as follows:
1209 * No traits:
1211 * Probably no references are peeled. But if the file contains a
1212 * peeled value for a reference, we will use it.
1214 * peeled:
1216 * References under "refs/tags/", if they *can* be peeled, *are*
1217 * peeled in this file. References outside of "refs/tags/" are
1218 * probably not peeled even if they could have been, but if we find
1219 * a peeled value for such a reference we will use it.
1221 * fully-peeled:
1223 * All references in the file that can be peeled are peeled.
1224 * Inversely (and this is more important), any references in the
1225 * file for which no peeled value is recorded is not peelable. This
1226 * trait should typically be written alongside "peeled" for
1227 * compatibility with older clients, but we do not require it
1228 * (i.e., "peeled" is a no-op if "fully-peeled" is set).
1230 static void read_packed_refs(FILE *f, struct ref_dir *dir)
1232 struct ref_entry *last = NULL;
1233 struct strbuf line = STRBUF_INIT;
1234 enum { PEELED_NONE, PEELED_TAGS, PEELED_FULLY } peeled = PEELED_NONE;
1236 while (strbuf_getwholeline(&line, f, '\n') != EOF) {
1237 unsigned char sha1[20];
1238 const char *refname;
1239 const char *traits;
1241 if (skip_prefix(line.buf, "# pack-refs with:", &traits)) {
1242 if (strstr(traits, " fully-peeled "))
1243 peeled = PEELED_FULLY;
1244 else if (strstr(traits, " peeled "))
1245 peeled = PEELED_TAGS;
1246 /* perhaps other traits later as well */
1247 continue;
1250 refname = parse_ref_line(&line, sha1);
1251 if (refname) {
1252 int flag = REF_ISPACKED;
1254 if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {
1255 if (!refname_is_safe(refname))
1256 die("packed refname is dangerous: %s", refname);
1257 hashclr(sha1);
1258 flag |= REF_BAD_NAME | REF_ISBROKEN;
1260 last = create_ref_entry(refname, sha1, flag, 0);
1261 if (peeled == PEELED_FULLY ||
1262 (peeled == PEELED_TAGS && starts_with(refname, "refs/tags/")))
1263 last->flag |= REF_KNOWS_PEELED;
1264 add_ref(dir, last);
1265 continue;
1267 if (last &&
1268 line.buf[0] == '^' &&
1269 line.len == PEELED_LINE_LENGTH &&
1270 line.buf[PEELED_LINE_LENGTH - 1] == '\n' &&
1271 !get_sha1_hex(line.buf + 1, sha1)) {
1272 hashcpy(last->u.value.peeled.hash, sha1);
1274 * Regardless of what the file header said,
1275 * we definitely know the value of *this*
1276 * reference:
1278 last->flag |= REF_KNOWS_PEELED;
1282 strbuf_release(&line);
1286 * Get the packed_ref_cache for the specified ref_cache, creating it
1287 * if necessary.
1289 static struct packed_ref_cache *get_packed_ref_cache(struct ref_cache *refs)
1291 char *packed_refs_file;
1293 if (*refs->name)
1294 packed_refs_file = git_pathdup_submodule(refs->name, "packed-refs");
1295 else
1296 packed_refs_file = git_pathdup("packed-refs");
1298 if (refs->packed &&
1299 !stat_validity_check(&refs->packed->validity, packed_refs_file))
1300 clear_packed_ref_cache(refs);
1302 if (!refs->packed) {
1303 FILE *f;
1305 refs->packed = xcalloc(1, sizeof(*refs->packed));
1306 acquire_packed_ref_cache(refs->packed);
1307 refs->packed->root = create_dir_entry(refs, "", 0, 0);
1308 f = fopen(packed_refs_file, "r");
1309 if (f) {
1310 stat_validity_update(&refs->packed->validity, fileno(f));
1311 read_packed_refs(f, get_ref_dir(refs->packed->root));
1312 fclose(f);
1315 free(packed_refs_file);
1316 return refs->packed;
1319 static struct ref_dir *get_packed_ref_dir(struct packed_ref_cache *packed_ref_cache)
1321 return get_ref_dir(packed_ref_cache->root);
1324 static struct ref_dir *get_packed_refs(struct ref_cache *refs)
1326 return get_packed_ref_dir(get_packed_ref_cache(refs));
1330 * Add a reference to the in-memory packed reference cache. This may
1331 * only be called while the packed-refs file is locked (see
1332 * lock_packed_refs()). To actually write the packed-refs file, call
1333 * commit_packed_refs().
1335 static void add_packed_ref(const char *refname, const unsigned char *sha1)
1337 struct packed_ref_cache *packed_ref_cache =
1338 get_packed_ref_cache(&ref_cache);
1340 if (!packed_ref_cache->lock)
1341 die("internal error: packed refs not locked");
1342 add_ref(get_packed_ref_dir(packed_ref_cache),
1343 create_ref_entry(refname, sha1, REF_ISPACKED, 1));
1347 * Read the loose references from the namespace dirname into dir
1348 * (without recursing). dirname must end with '/'. dir must be the
1349 * directory entry corresponding to dirname.
1351 static void read_loose_refs(const char *dirname, struct ref_dir *dir)
1353 struct ref_cache *refs = dir->ref_cache;
1354 DIR *d;
1355 struct dirent *de;
1356 int dirnamelen = strlen(dirname);
1357 struct strbuf refname;
1358 struct strbuf path = STRBUF_INIT;
1359 size_t path_baselen;
1361 if (*refs->name)
1362 strbuf_git_path_submodule(&path, refs->name, "%s", dirname);
1363 else
1364 strbuf_git_path(&path, "%s", dirname);
1365 path_baselen = path.len;
1367 d = opendir(path.buf);
1368 if (!d) {
1369 strbuf_release(&path);
1370 return;
1373 strbuf_init(&refname, dirnamelen + 257);
1374 strbuf_add(&refname, dirname, dirnamelen);
1376 while ((de = readdir(d)) != NULL) {
1377 unsigned char sha1[20];
1378 struct stat st;
1379 int flag;
1381 if (de->d_name[0] == '.')
1382 continue;
1383 if (ends_with(de->d_name, ".lock"))
1384 continue;
1385 strbuf_addstr(&refname, de->d_name);
1386 strbuf_addstr(&path, de->d_name);
1387 if (stat(path.buf, &st) < 0) {
1388 ; /* silently ignore */
1389 } else if (S_ISDIR(st.st_mode)) {
1390 strbuf_addch(&refname, '/');
1391 add_entry_to_dir(dir,
1392 create_dir_entry(refs, refname.buf,
1393 refname.len, 1));
1394 } else {
1395 int read_ok;
1397 if (*refs->name) {
1398 hashclr(sha1);
1399 flag = 0;
1400 read_ok = !resolve_gitlink_ref(refs->name,
1401 refname.buf, sha1);
1402 } else {
1403 read_ok = !read_ref_full(refname.buf,
1404 RESOLVE_REF_READING,
1405 sha1, &flag);
1408 if (!read_ok) {
1409 hashclr(sha1);
1410 flag |= REF_ISBROKEN;
1411 } else if (is_null_sha1(sha1)) {
1413 * It is so astronomically unlikely
1414 * that NULL_SHA1 is the SHA-1 of an
1415 * actual object that we consider its
1416 * appearance in a loose reference
1417 * file to be repo corruption
1418 * (probably due to a software bug).
1420 flag |= REF_ISBROKEN;
1423 if (check_refname_format(refname.buf,
1424 REFNAME_ALLOW_ONELEVEL)) {
1425 if (!refname_is_safe(refname.buf))
1426 die("loose refname is dangerous: %s", refname.buf);
1427 hashclr(sha1);
1428 flag |= REF_BAD_NAME | REF_ISBROKEN;
1430 add_entry_to_dir(dir,
1431 create_ref_entry(refname.buf, sha1, flag, 0));
1433 strbuf_setlen(&refname, dirnamelen);
1434 strbuf_setlen(&path, path_baselen);
1436 strbuf_release(&refname);
1437 strbuf_release(&path);
1438 closedir(d);
1441 static struct ref_dir *get_loose_refs(struct ref_cache *refs)
1443 if (!refs->loose) {
1445 * Mark the top-level directory complete because we
1446 * are about to read the only subdirectory that can
1447 * hold references:
1449 refs->loose = create_dir_entry(refs, "", 0, 0);
1451 * Create an incomplete entry for "refs/":
1453 add_entry_to_dir(get_ref_dir(refs->loose),
1454 create_dir_entry(refs, "refs/", 5, 1));
1456 return get_ref_dir(refs->loose);
1459 /* We allow "recursive" symbolic refs. Only within reason, though */
1460 #define MAXDEPTH 5
1461 #define MAXREFLEN (1024)
1464 * Called by resolve_gitlink_ref_recursive() after it failed to read
1465 * from the loose refs in ref_cache refs. Find <refname> in the
1466 * packed-refs file for the submodule.
1468 static int resolve_gitlink_packed_ref(struct ref_cache *refs,
1469 const char *refname, unsigned char *sha1)
1471 struct ref_entry *ref;
1472 struct ref_dir *dir = get_packed_refs(refs);
1474 ref = find_ref(dir, refname);
1475 if (ref == NULL)
1476 return -1;
1478 hashcpy(sha1, ref->u.value.oid.hash);
1479 return 0;
1482 static int resolve_gitlink_ref_recursive(struct ref_cache *refs,
1483 const char *refname, unsigned char *sha1,
1484 int recursion)
1486 int fd, len;
1487 char buffer[128], *p;
1488 char *path;
1490 if (recursion > MAXDEPTH || strlen(refname) > MAXREFLEN)
1491 return -1;
1492 path = *refs->name
1493 ? git_pathdup_submodule(refs->name, "%s", refname)
1494 : git_pathdup("%s", refname);
1495 fd = open(path, O_RDONLY);
1496 free(path);
1497 if (fd < 0)
1498 return resolve_gitlink_packed_ref(refs, refname, sha1);
1500 len = read(fd, buffer, sizeof(buffer)-1);
1501 close(fd);
1502 if (len < 0)
1503 return -1;
1504 while (len && isspace(buffer[len-1]))
1505 len--;
1506 buffer[len] = 0;
1508 /* Was it a detached head or an old-fashioned symlink? */
1509 if (!get_sha1_hex(buffer, sha1))
1510 return 0;
1512 /* Symref? */
1513 if (strncmp(buffer, "ref:", 4))
1514 return -1;
1515 p = buffer + 4;
1516 while (isspace(*p))
1517 p++;
1519 return resolve_gitlink_ref_recursive(refs, p, sha1, recursion+1);
1522 int resolve_gitlink_ref(const char *path, const char *refname, unsigned char *sha1)
1524 int len = strlen(path), retval;
1525 char *submodule;
1526 struct ref_cache *refs;
1528 while (len && path[len-1] == '/')
1529 len--;
1530 if (!len)
1531 return -1;
1532 submodule = xstrndup(path, len);
1533 refs = get_ref_cache(submodule);
1534 free(submodule);
1536 retval = resolve_gitlink_ref_recursive(refs, refname, sha1, 0);
1537 return retval;
1541 * Return the ref_entry for the given refname from the packed
1542 * references. If it does not exist, return NULL.
1544 static struct ref_entry *get_packed_ref(const char *refname)
1546 return find_ref(get_packed_refs(&ref_cache), refname);
1550 * A loose ref file doesn't exist; check for a packed ref. The
1551 * options are forwarded from resolve_safe_unsafe().
1553 static int resolve_missing_loose_ref(const char *refname,
1554 int resolve_flags,
1555 unsigned char *sha1,
1556 int *flags)
1558 struct ref_entry *entry;
1561 * The loose reference file does not exist; check for a packed
1562 * reference.
1564 entry = get_packed_ref(refname);
1565 if (entry) {
1566 hashcpy(sha1, entry->u.value.oid.hash);
1567 if (flags)
1568 *flags |= REF_ISPACKED;
1569 return 0;
1571 /* The reference is not a packed reference, either. */
1572 if (resolve_flags & RESOLVE_REF_READING) {
1573 errno = ENOENT;
1574 return -1;
1575 } else {
1576 hashclr(sha1);
1577 return 0;
1581 /* This function needs to return a meaningful errno on failure */
1582 static const char *resolve_ref_unsafe_1(const char *refname,
1583 int resolve_flags,
1584 unsigned char *sha1,
1585 int *flags,
1586 struct strbuf *sb_path)
1588 int depth = MAXDEPTH;
1589 ssize_t len;
1590 char buffer[256];
1591 static char refname_buffer[256];
1592 int bad_name = 0;
1594 if (flags)
1595 *flags = 0;
1597 if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {
1598 if (flags)
1599 *flags |= REF_BAD_NAME;
1601 if (!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||
1602 !refname_is_safe(refname)) {
1603 errno = EINVAL;
1604 return NULL;
1607 * dwim_ref() uses REF_ISBROKEN to distinguish between
1608 * missing refs and refs that were present but invalid,
1609 * to complain about the latter to stderr.
1611 * We don't know whether the ref exists, so don't set
1612 * REF_ISBROKEN yet.
1614 bad_name = 1;
1616 for (;;) {
1617 const char *path;
1618 struct stat st;
1619 char *buf;
1620 int fd;
1622 if (--depth < 0) {
1623 errno = ELOOP;
1624 return NULL;
1627 strbuf_reset(sb_path);
1628 strbuf_git_path(sb_path, "%s", refname);
1629 path = sb_path->buf;
1632 * We might have to loop back here to avoid a race
1633 * condition: first we lstat() the file, then we try
1634 * to read it as a link or as a file. But if somebody
1635 * changes the type of the file (file <-> directory
1636 * <-> symlink) between the lstat() and reading, then
1637 * we don't want to report that as an error but rather
1638 * try again starting with the lstat().
1640 stat_ref:
1641 if (lstat(path, &st) < 0) {
1642 if (errno != ENOENT)
1643 return NULL;
1644 if (resolve_missing_loose_ref(refname, resolve_flags,
1645 sha1, flags))
1646 return NULL;
1647 if (bad_name) {
1648 hashclr(sha1);
1649 if (flags)
1650 *flags |= REF_ISBROKEN;
1652 return refname;
1655 /* Follow "normalized" - ie "refs/.." symlinks by hand */
1656 if (S_ISLNK(st.st_mode)) {
1657 len = readlink(path, buffer, sizeof(buffer)-1);
1658 if (len < 0) {
1659 if (errno == ENOENT || errno == EINVAL)
1660 /* inconsistent with lstat; retry */
1661 goto stat_ref;
1662 else
1663 return NULL;
1665 buffer[len] = 0;
1666 if (starts_with(buffer, "refs/") &&
1667 !check_refname_format(buffer, 0)) {
1668 strcpy(refname_buffer, buffer);
1669 refname = refname_buffer;
1670 if (flags)
1671 *flags |= REF_ISSYMREF;
1672 if (resolve_flags & RESOLVE_REF_NO_RECURSE) {
1673 hashclr(sha1);
1674 return refname;
1676 continue;
1680 /* Is it a directory? */
1681 if (S_ISDIR(st.st_mode)) {
1682 errno = EISDIR;
1683 return NULL;
1687 * Anything else, just open it and try to use it as
1688 * a ref
1690 fd = open(path, O_RDONLY);
1691 if (fd < 0) {
1692 if (errno == ENOENT)
1693 /* inconsistent with lstat; retry */
1694 goto stat_ref;
1695 else
1696 return NULL;
1698 len = read_in_full(fd, buffer, sizeof(buffer)-1);
1699 if (len < 0) {
1700 int save_errno = errno;
1701 close(fd);
1702 errno = save_errno;
1703 return NULL;
1705 close(fd);
1706 while (len && isspace(buffer[len-1]))
1707 len--;
1708 buffer[len] = '\0';
1711 * Is it a symbolic ref?
1713 if (!starts_with(buffer, "ref:")) {
1715 * Please note that FETCH_HEAD has a second
1716 * line containing other data.
1718 if (get_sha1_hex(buffer, sha1) ||
1719 (buffer[40] != '\0' && !isspace(buffer[40]))) {
1720 if (flags)
1721 *flags |= REF_ISBROKEN;
1722 errno = EINVAL;
1723 return NULL;
1725 if (bad_name) {
1726 hashclr(sha1);
1727 if (flags)
1728 *flags |= REF_ISBROKEN;
1730 return refname;
1732 if (flags)
1733 *flags |= REF_ISSYMREF;
1734 buf = buffer + 4;
1735 while (isspace(*buf))
1736 buf++;
1737 refname = strcpy(refname_buffer, buf);
1738 if (resolve_flags & RESOLVE_REF_NO_RECURSE) {
1739 hashclr(sha1);
1740 return refname;
1742 if (check_refname_format(buf, REFNAME_ALLOW_ONELEVEL)) {
1743 if (flags)
1744 *flags |= REF_ISBROKEN;
1746 if (!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||
1747 !refname_is_safe(buf)) {
1748 errno = EINVAL;
1749 return NULL;
1751 bad_name = 1;
1756 const char *resolve_ref_unsafe(const char *refname, int resolve_flags,
1757 unsigned char *sha1, int *flags)
1759 struct strbuf sb_path = STRBUF_INIT;
1760 const char *ret = resolve_ref_unsafe_1(refname, resolve_flags,
1761 sha1, flags, &sb_path);
1762 strbuf_release(&sb_path);
1763 return ret;
1766 char *resolve_refdup(const char *refname, int resolve_flags,
1767 unsigned char *sha1, int *flags)
1769 return xstrdup_or_null(resolve_ref_unsafe(refname, resolve_flags,
1770 sha1, flags));
1773 /* The argument to filter_refs */
1774 struct ref_filter {
1775 const char *pattern;
1776 each_ref_fn *fn;
1777 void *cb_data;
1780 int read_ref_full(const char *refname, int resolve_flags, unsigned char *sha1, int *flags)
1782 if (resolve_ref_unsafe(refname, resolve_flags, sha1, flags))
1783 return 0;
1784 return -1;
1787 int read_ref(const char *refname, unsigned char *sha1)
1789 return read_ref_full(refname, RESOLVE_REF_READING, sha1, NULL);
1792 int ref_exists(const char *refname)
1794 unsigned char sha1[20];
1795 return !!resolve_ref_unsafe(refname, RESOLVE_REF_READING, sha1, NULL);
1798 static int filter_refs(const char *refname, const struct object_id *oid,
1799 int flags, void *data)
1801 struct ref_filter *filter = (struct ref_filter *)data;
1803 if (wildmatch(filter->pattern, refname, 0, NULL))
1804 return 0;
1805 return filter->fn(refname, oid, flags, filter->cb_data);
1808 enum peel_status {
1809 /* object was peeled successfully: */
1810 PEEL_PEELED = 0,
1813 * object cannot be peeled because the named object (or an
1814 * object referred to by a tag in the peel chain), does not
1815 * exist.
1817 PEEL_INVALID = -1,
1819 /* object cannot be peeled because it is not a tag: */
1820 PEEL_NON_TAG = -2,
1822 /* ref_entry contains no peeled value because it is a symref: */
1823 PEEL_IS_SYMREF = -3,
1826 * ref_entry cannot be peeled because it is broken (i.e., the
1827 * symbolic reference cannot even be resolved to an object
1828 * name):
1830 PEEL_BROKEN = -4
1834 * Peel the named object; i.e., if the object is a tag, resolve the
1835 * tag recursively until a non-tag is found. If successful, store the
1836 * result to sha1 and return PEEL_PEELED. If the object is not a tag
1837 * or is not valid, return PEEL_NON_TAG or PEEL_INVALID, respectively,
1838 * and leave sha1 unchanged.
1840 static enum peel_status peel_object(const unsigned char *name, unsigned char *sha1)
1842 struct object *o = lookup_unknown_object(name);
1844 if (o->type == OBJ_NONE) {
1845 int type = sha1_object_info(name, NULL);
1846 if (type < 0 || !object_as_type(o, type, 0))
1847 return PEEL_INVALID;
1850 if (o->type != OBJ_TAG)
1851 return PEEL_NON_TAG;
1853 o = deref_tag_noverify(o);
1854 if (!o)
1855 return PEEL_INVALID;
1857 hashcpy(sha1, o->sha1);
1858 return PEEL_PEELED;
1862 * Peel the entry (if possible) and return its new peel_status. If
1863 * repeel is true, re-peel the entry even if there is an old peeled
1864 * value that is already stored in it.
1866 * It is OK to call this function with a packed reference entry that
1867 * might be stale and might even refer to an object that has since
1868 * been garbage-collected. In such a case, if the entry has
1869 * REF_KNOWS_PEELED then leave the status unchanged and return
1870 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.
1872 static enum peel_status peel_entry(struct ref_entry *entry, int repeel)
1874 enum peel_status status;
1876 if (entry->flag & REF_KNOWS_PEELED) {
1877 if (repeel) {
1878 entry->flag &= ~REF_KNOWS_PEELED;
1879 oidclr(&entry->u.value.peeled);
1880 } else {
1881 return is_null_oid(&entry->u.value.peeled) ?
1882 PEEL_NON_TAG : PEEL_PEELED;
1885 if (entry->flag & REF_ISBROKEN)
1886 return PEEL_BROKEN;
1887 if (entry->flag & REF_ISSYMREF)
1888 return PEEL_IS_SYMREF;
1890 status = peel_object(entry->u.value.oid.hash, entry->u.value.peeled.hash);
1891 if (status == PEEL_PEELED || status == PEEL_NON_TAG)
1892 entry->flag |= REF_KNOWS_PEELED;
1893 return status;
1896 int peel_ref(const char *refname, unsigned char *sha1)
1898 int flag;
1899 unsigned char base[20];
1901 if (current_ref && (current_ref->name == refname
1902 || !strcmp(current_ref->name, refname))) {
1903 if (peel_entry(current_ref, 0))
1904 return -1;
1905 hashcpy(sha1, current_ref->u.value.peeled.hash);
1906 return 0;
1909 if (read_ref_full(refname, RESOLVE_REF_READING, base, &flag))
1910 return -1;
1913 * If the reference is packed, read its ref_entry from the
1914 * cache in the hope that we already know its peeled value.
1915 * We only try this optimization on packed references because
1916 * (a) forcing the filling of the loose reference cache could
1917 * be expensive and (b) loose references anyway usually do not
1918 * have REF_KNOWS_PEELED.
1920 if (flag & REF_ISPACKED) {
1921 struct ref_entry *r = get_packed_ref(refname);
1922 if (r) {
1923 if (peel_entry(r, 0))
1924 return -1;
1925 hashcpy(sha1, r->u.value.peeled.hash);
1926 return 0;
1930 return peel_object(base, sha1);
1933 struct warn_if_dangling_data {
1934 FILE *fp;
1935 const char *refname;
1936 const struct string_list *refnames;
1937 const char *msg_fmt;
1940 static int warn_if_dangling_symref(const char *refname, const struct object_id *oid,
1941 int flags, void *cb_data)
1943 struct warn_if_dangling_data *d = cb_data;
1944 const char *resolves_to;
1945 struct object_id junk;
1947 if (!(flags & REF_ISSYMREF))
1948 return 0;
1950 resolves_to = resolve_ref_unsafe(refname, 0, junk.hash, NULL);
1951 if (!resolves_to
1952 || (d->refname
1953 ? strcmp(resolves_to, d->refname)
1954 : !string_list_has_string(d->refnames, resolves_to))) {
1955 return 0;
1958 fprintf(d->fp, d->msg_fmt, refname);
1959 fputc('\n', d->fp);
1960 return 0;
1963 void warn_dangling_symref(FILE *fp, const char *msg_fmt, const char *refname)
1965 struct warn_if_dangling_data data;
1967 data.fp = fp;
1968 data.refname = refname;
1969 data.refnames = NULL;
1970 data.msg_fmt = msg_fmt;
1971 for_each_rawref(warn_if_dangling_symref, &data);
1974 void warn_dangling_symrefs(FILE *fp, const char *msg_fmt, const struct string_list *refnames)
1976 struct warn_if_dangling_data data;
1978 data.fp = fp;
1979 data.refname = NULL;
1980 data.refnames = refnames;
1981 data.msg_fmt = msg_fmt;
1982 for_each_rawref(warn_if_dangling_symref, &data);
1986 * Call fn for each reference in the specified ref_cache, omitting
1987 * references not in the containing_dir of base. fn is called for all
1988 * references, including broken ones. If fn ever returns a non-zero
1989 * value, stop the iteration and return that value; otherwise, return
1990 * 0.
1992 static int do_for_each_entry(struct ref_cache *refs, const char *base,
1993 each_ref_entry_fn fn, void *cb_data)
1995 struct packed_ref_cache *packed_ref_cache;
1996 struct ref_dir *loose_dir;
1997 struct ref_dir *packed_dir;
1998 int retval = 0;
2001 * We must make sure that all loose refs are read before accessing the
2002 * packed-refs file; this avoids a race condition in which loose refs
2003 * are migrated to the packed-refs file by a simultaneous process, but
2004 * our in-memory view is from before the migration. get_packed_ref_cache()
2005 * takes care of making sure our view is up to date with what is on
2006 * disk.
2008 loose_dir = get_loose_refs(refs);
2009 if (base && *base) {
2010 loose_dir = find_containing_dir(loose_dir, base, 0);
2012 if (loose_dir)
2013 prime_ref_dir(loose_dir);
2015 packed_ref_cache = get_packed_ref_cache(refs);
2016 acquire_packed_ref_cache(packed_ref_cache);
2017 packed_dir = get_packed_ref_dir(packed_ref_cache);
2018 if (base && *base) {
2019 packed_dir = find_containing_dir(packed_dir, base, 0);
2022 if (packed_dir && loose_dir) {
2023 sort_ref_dir(packed_dir);
2024 sort_ref_dir(loose_dir);
2025 retval = do_for_each_entry_in_dirs(
2026 packed_dir, loose_dir, fn, cb_data);
2027 } else if (packed_dir) {
2028 sort_ref_dir(packed_dir);
2029 retval = do_for_each_entry_in_dir(
2030 packed_dir, 0, fn, cb_data);
2031 } else if (loose_dir) {
2032 sort_ref_dir(loose_dir);
2033 retval = do_for_each_entry_in_dir(
2034 loose_dir, 0, fn, cb_data);
2037 release_packed_ref_cache(packed_ref_cache);
2038 return retval;
2042 * Call fn for each reference in the specified ref_cache for which the
2043 * refname begins with base. If trim is non-zero, then trim that many
2044 * characters off the beginning of each refname before passing the
2045 * refname to fn. flags can be DO_FOR_EACH_INCLUDE_BROKEN to include
2046 * broken references in the iteration. If fn ever returns a non-zero
2047 * value, stop the iteration and return that value; otherwise, return
2048 * 0.
2050 static int do_for_each_ref(struct ref_cache *refs, const char *base,
2051 each_ref_fn fn, int trim, int flags, void *cb_data)
2053 struct ref_entry_cb data;
2054 data.base = base;
2055 data.trim = trim;
2056 data.flags = flags;
2057 data.fn = fn;
2058 data.cb_data = cb_data;
2060 if (ref_paranoia < 0)
2061 ref_paranoia = git_env_bool("GIT_REF_PARANOIA", 0);
2062 if (ref_paranoia)
2063 data.flags |= DO_FOR_EACH_INCLUDE_BROKEN;
2065 return do_for_each_entry(refs, base, do_one_ref, &data);
2068 static int do_head_ref(const char *submodule, each_ref_fn fn, void *cb_data)
2070 struct object_id oid;
2071 int flag;
2073 if (submodule) {
2074 if (resolve_gitlink_ref(submodule, "HEAD", oid.hash) == 0)
2075 return fn("HEAD", &oid, 0, cb_data);
2077 return 0;
2080 if (!read_ref_full("HEAD", RESOLVE_REF_READING, oid.hash, &flag))
2081 return fn("HEAD", &oid, flag, cb_data);
2083 return 0;
2086 int head_ref(each_ref_fn fn, void *cb_data)
2088 return do_head_ref(NULL, fn, cb_data);
2091 int head_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
2093 return do_head_ref(submodule, fn, cb_data);
2096 int for_each_ref(each_ref_fn fn, void *cb_data)
2098 return do_for_each_ref(&ref_cache, "", fn, 0, 0, cb_data);
2101 int for_each_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
2103 return do_for_each_ref(get_ref_cache(submodule), "", fn, 0, 0, cb_data);
2106 int for_each_ref_in(const char *prefix, each_ref_fn fn, void *cb_data)
2108 return do_for_each_ref(&ref_cache, prefix, fn, strlen(prefix), 0, cb_data);
2111 int for_each_fullref_in(const char *prefix, each_ref_fn fn, void *cb_data, unsigned int broken)
2113 unsigned int flag = 0;
2115 if (broken)
2116 flag = DO_FOR_EACH_INCLUDE_BROKEN;
2117 return do_for_each_ref(&ref_cache, prefix, fn, 0, flag, cb_data);
2120 int for_each_ref_in_submodule(const char *submodule, const char *prefix,
2121 each_ref_fn fn, void *cb_data)
2123 return do_for_each_ref(get_ref_cache(submodule), prefix, fn, strlen(prefix), 0, cb_data);
2126 int for_each_tag_ref(each_ref_fn fn, void *cb_data)
2128 return for_each_ref_in("refs/tags/", fn, cb_data);
2131 int for_each_tag_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
2133 return for_each_ref_in_submodule(submodule, "refs/tags/", fn, cb_data);
2136 int for_each_branch_ref(each_ref_fn fn, void *cb_data)
2138 return for_each_ref_in("refs/heads/", fn, cb_data);
2141 int for_each_branch_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
2143 return for_each_ref_in_submodule(submodule, "refs/heads/", fn, cb_data);
2146 int for_each_remote_ref(each_ref_fn fn, void *cb_data)
2148 return for_each_ref_in("refs/remotes/", fn, cb_data);
2151 int for_each_remote_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
2153 return for_each_ref_in_submodule(submodule, "refs/remotes/", fn, cb_data);
2156 int for_each_replace_ref(each_ref_fn fn, void *cb_data)
2158 return do_for_each_ref(&ref_cache, git_replace_ref_base, fn,
2159 strlen(git_replace_ref_base), 0, cb_data);
2162 int head_ref_namespaced(each_ref_fn fn, void *cb_data)
2164 struct strbuf buf = STRBUF_INIT;
2165 int ret = 0;
2166 struct object_id oid;
2167 int flag;
2169 strbuf_addf(&buf, "%sHEAD", get_git_namespace());
2170 if (!read_ref_full(buf.buf, RESOLVE_REF_READING, oid.hash, &flag))
2171 ret = fn(buf.buf, &oid, flag, cb_data);
2172 strbuf_release(&buf);
2174 return ret;
2177 int for_each_namespaced_ref(each_ref_fn fn, void *cb_data)
2179 struct strbuf buf = STRBUF_INIT;
2180 int ret;
2181 strbuf_addf(&buf, "%srefs/", get_git_namespace());
2182 ret = do_for_each_ref(&ref_cache, buf.buf, fn, 0, 0, cb_data);
2183 strbuf_release(&buf);
2184 return ret;
2187 int for_each_glob_ref_in(each_ref_fn fn, const char *pattern,
2188 const char *prefix, void *cb_data)
2190 struct strbuf real_pattern = STRBUF_INIT;
2191 struct ref_filter filter;
2192 int ret;
2194 if (!prefix && !starts_with(pattern, "refs/"))
2195 strbuf_addstr(&real_pattern, "refs/");
2196 else if (prefix)
2197 strbuf_addstr(&real_pattern, prefix);
2198 strbuf_addstr(&real_pattern, pattern);
2200 if (!has_glob_specials(pattern)) {
2201 /* Append implied '/' '*' if not present. */
2202 if (real_pattern.buf[real_pattern.len - 1] != '/')
2203 strbuf_addch(&real_pattern, '/');
2204 /* No need to check for '*', there is none. */
2205 strbuf_addch(&real_pattern, '*');
2208 filter.pattern = real_pattern.buf;
2209 filter.fn = fn;
2210 filter.cb_data = cb_data;
2211 ret = for_each_ref(filter_refs, &filter);
2213 strbuf_release(&real_pattern);
2214 return ret;
2217 int for_each_glob_ref(each_ref_fn fn, const char *pattern, void *cb_data)
2219 return for_each_glob_ref_in(fn, pattern, NULL, cb_data);
2222 int for_each_rawref(each_ref_fn fn, void *cb_data)
2224 return do_for_each_ref(&ref_cache, "", fn, 0,
2225 DO_FOR_EACH_INCLUDE_BROKEN, cb_data);
2228 const char *prettify_refname(const char *name)
2230 return name + (
2231 starts_with(name, "refs/heads/") ? 11 :
2232 starts_with(name, "refs/tags/") ? 10 :
2233 starts_with(name, "refs/remotes/") ? 13 :
2237 static const char *ref_rev_parse_rules[] = {
2238 "%.*s",
2239 "refs/%.*s",
2240 "refs/tags/%.*s",
2241 "refs/heads/%.*s",
2242 "refs/remotes/%.*s",
2243 "refs/remotes/%.*s/HEAD",
2244 NULL
2247 int refname_match(const char *abbrev_name, const char *full_name)
2249 const char **p;
2250 const int abbrev_name_len = strlen(abbrev_name);
2252 for (p = ref_rev_parse_rules; *p; p++) {
2253 if (!strcmp(full_name, mkpath(*p, abbrev_name_len, abbrev_name))) {
2254 return 1;
2258 return 0;
2261 static void unlock_ref(struct ref_lock *lock)
2263 /* Do not free lock->lk -- atexit() still looks at them */
2264 if (lock->lk)
2265 rollback_lock_file(lock->lk);
2266 free(lock->ref_name);
2267 free(lock->orig_ref_name);
2268 free(lock);
2272 * Verify that the reference locked by lock has the value old_sha1.
2273 * Fail if the reference doesn't exist and mustexist is set. Return 0
2274 * on success. On error, write an error message to err, set errno, and
2275 * return a negative value.
2277 static int verify_lock(struct ref_lock *lock,
2278 const unsigned char *old_sha1, int mustexist,
2279 struct strbuf *err)
2281 assert(err);
2283 if (read_ref_full(lock->ref_name,
2284 mustexist ? RESOLVE_REF_READING : 0,
2285 lock->old_oid.hash, NULL)) {
2286 int save_errno = errno;
2287 strbuf_addf(err, "can't verify ref %s", lock->ref_name);
2288 errno = save_errno;
2289 return -1;
2291 if (hashcmp(lock->old_oid.hash, old_sha1)) {
2292 strbuf_addf(err, "ref %s is at %s but expected %s",
2293 lock->ref_name,
2294 sha1_to_hex(lock->old_oid.hash),
2295 sha1_to_hex(old_sha1));
2296 errno = EBUSY;
2297 return -1;
2299 return 0;
2302 static int remove_empty_directories(struct strbuf *path)
2305 * we want to create a file but there is a directory there;
2306 * if that is an empty directory (or a directory that contains
2307 * only empty directories), remove them.
2309 return remove_dir_recursively(path, REMOVE_DIR_EMPTY_ONLY);
2313 * *string and *len will only be substituted, and *string returned (for
2314 * later free()ing) if the string passed in is a magic short-hand form
2315 * to name a branch.
2317 static char *substitute_branch_name(const char **string, int *len)
2319 struct strbuf buf = STRBUF_INIT;
2320 int ret = interpret_branch_name(*string, *len, &buf);
2322 if (ret == *len) {
2323 size_t size;
2324 *string = strbuf_detach(&buf, &size);
2325 *len = size;
2326 return (char *)*string;
2329 return NULL;
2332 int dwim_ref(const char *str, int len, unsigned char *sha1, char **ref)
2334 char *last_branch = substitute_branch_name(&str, &len);
2335 const char **p, *r;
2336 int refs_found = 0;
2338 *ref = NULL;
2339 for (p = ref_rev_parse_rules; *p; p++) {
2340 char fullref[PATH_MAX];
2341 unsigned char sha1_from_ref[20];
2342 unsigned char *this_result;
2343 int flag;
2345 this_result = refs_found ? sha1_from_ref : sha1;
2346 mksnpath(fullref, sizeof(fullref), *p, len, str);
2347 r = resolve_ref_unsafe(fullref, RESOLVE_REF_READING,
2348 this_result, &flag);
2349 if (r) {
2350 if (!refs_found++)
2351 *ref = xstrdup(r);
2352 if (!warn_ambiguous_refs)
2353 break;
2354 } else if ((flag & REF_ISSYMREF) && strcmp(fullref, "HEAD")) {
2355 warning("ignoring dangling symref %s.", fullref);
2356 } else if ((flag & REF_ISBROKEN) && strchr(fullref, '/')) {
2357 warning("ignoring broken ref %s.", fullref);
2360 free(last_branch);
2361 return refs_found;
2364 int dwim_log(const char *str, int len, unsigned char *sha1, char **log)
2366 char *last_branch = substitute_branch_name(&str, &len);
2367 const char **p;
2368 int logs_found = 0;
2370 *log = NULL;
2371 for (p = ref_rev_parse_rules; *p; p++) {
2372 unsigned char hash[20];
2373 char path[PATH_MAX];
2374 const char *ref, *it;
2376 mksnpath(path, sizeof(path), *p, len, str);
2377 ref = resolve_ref_unsafe(path, RESOLVE_REF_READING,
2378 hash, NULL);
2379 if (!ref)
2380 continue;
2381 if (reflog_exists(path))
2382 it = path;
2383 else if (strcmp(ref, path) && reflog_exists(ref))
2384 it = ref;
2385 else
2386 continue;
2387 if (!logs_found++) {
2388 *log = xstrdup(it);
2389 hashcpy(sha1, hash);
2391 if (!warn_ambiguous_refs)
2392 break;
2394 free(last_branch);
2395 return logs_found;
2399 * Locks a ref returning the lock on success and NULL on failure.
2400 * On failure errno is set to something meaningful.
2402 static struct ref_lock *lock_ref_sha1_basic(const char *refname,
2403 const unsigned char *old_sha1,
2404 const struct string_list *extras,
2405 const struct string_list *skip,
2406 unsigned int flags, int *type_p,
2407 struct strbuf *err)
2409 struct strbuf ref_file = STRBUF_INIT;
2410 struct strbuf orig_ref_file = STRBUF_INIT;
2411 const char *orig_refname = refname;
2412 struct ref_lock *lock;
2413 int last_errno = 0;
2414 int type, lflags;
2415 int mustexist = (old_sha1 && !is_null_sha1(old_sha1));
2416 int resolve_flags = 0;
2417 int attempts_remaining = 3;
2419 assert(err);
2421 lock = xcalloc(1, sizeof(struct ref_lock));
2423 if (mustexist)
2424 resolve_flags |= RESOLVE_REF_READING;
2425 if (flags & REF_DELETING) {
2426 resolve_flags |= RESOLVE_REF_ALLOW_BAD_NAME;
2427 if (flags & REF_NODEREF)
2428 resolve_flags |= RESOLVE_REF_NO_RECURSE;
2431 refname = resolve_ref_unsafe(refname, resolve_flags,
2432 lock->old_oid.hash, &type);
2433 if (!refname && errno == EISDIR) {
2435 * we are trying to lock foo but we used to
2436 * have foo/bar which now does not exist;
2437 * it is normal for the empty directory 'foo'
2438 * to remain.
2440 strbuf_git_path(&orig_ref_file, "%s", orig_refname);
2441 if (remove_empty_directories(&orig_ref_file)) {
2442 last_errno = errno;
2443 if (!verify_refname_available(orig_refname, extras, skip,
2444 get_loose_refs(&ref_cache), err))
2445 strbuf_addf(err, "there are still refs under '%s'",
2446 orig_refname);
2447 goto error_return;
2449 refname = resolve_ref_unsafe(orig_refname, resolve_flags,
2450 lock->old_oid.hash, &type);
2452 if (type_p)
2453 *type_p = type;
2454 if (!refname) {
2455 last_errno = errno;
2456 if (last_errno != ENOTDIR ||
2457 !verify_refname_available(orig_refname, extras, skip,
2458 get_loose_refs(&ref_cache), err))
2459 strbuf_addf(err, "unable to resolve reference %s: %s",
2460 orig_refname, strerror(last_errno));
2462 goto error_return;
2465 * If the ref did not exist and we are creating it, make sure
2466 * there is no existing packed ref whose name begins with our
2467 * refname, nor a packed ref whose name is a proper prefix of
2468 * our refname.
2470 if (is_null_oid(&lock->old_oid) &&
2471 verify_refname_available(refname, extras, skip,
2472 get_packed_refs(&ref_cache), err)) {
2473 last_errno = ENOTDIR;
2474 goto error_return;
2477 lock->lk = xcalloc(1, sizeof(struct lock_file));
2479 lflags = 0;
2480 if (flags & REF_NODEREF) {
2481 refname = orig_refname;
2482 lflags |= LOCK_NO_DEREF;
2484 lock->ref_name = xstrdup(refname);
2485 lock->orig_ref_name = xstrdup(orig_refname);
2486 strbuf_git_path(&ref_file, "%s", refname);
2488 retry:
2489 switch (safe_create_leading_directories_const(ref_file.buf)) {
2490 case SCLD_OK:
2491 break; /* success */
2492 case SCLD_VANISHED:
2493 if (--attempts_remaining > 0)
2494 goto retry;
2495 /* fall through */
2496 default:
2497 last_errno = errno;
2498 strbuf_addf(err, "unable to create directory for %s",
2499 ref_file.buf);
2500 goto error_return;
2503 if (hold_lock_file_for_update(lock->lk, ref_file.buf, lflags) < 0) {
2504 last_errno = errno;
2505 if (errno == ENOENT && --attempts_remaining > 0)
2507 * Maybe somebody just deleted one of the
2508 * directories leading to ref_file. Try
2509 * again:
2511 goto retry;
2512 else {
2513 unable_to_lock_message(ref_file.buf, errno, err);
2514 goto error_return;
2517 if (old_sha1 && verify_lock(lock, old_sha1, mustexist, err)) {
2518 last_errno = errno;
2519 goto error_return;
2521 goto out;
2523 error_return:
2524 unlock_ref(lock);
2525 lock = NULL;
2527 out:
2528 strbuf_release(&ref_file);
2529 strbuf_release(&orig_ref_file);
2530 errno = last_errno;
2531 return lock;
2535 * Write an entry to the packed-refs file for the specified refname.
2536 * If peeled is non-NULL, write it as the entry's peeled value.
2538 static void write_packed_entry(FILE *fh, char *refname, unsigned char *sha1,
2539 unsigned char *peeled)
2541 fprintf_or_die(fh, "%s %s\n", sha1_to_hex(sha1), refname);
2542 if (peeled)
2543 fprintf_or_die(fh, "^%s\n", sha1_to_hex(peeled));
2547 * An each_ref_entry_fn that writes the entry to a packed-refs file.
2549 static int write_packed_entry_fn(struct ref_entry *entry, void *cb_data)
2551 enum peel_status peel_status = peel_entry(entry, 0);
2553 if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)
2554 error("internal error: %s is not a valid packed reference!",
2555 entry->name);
2556 write_packed_entry(cb_data, entry->name, entry->u.value.oid.hash,
2557 peel_status == PEEL_PEELED ?
2558 entry->u.value.peeled.hash : NULL);
2559 return 0;
2563 * Lock the packed-refs file for writing. Flags is passed to
2564 * hold_lock_file_for_update(). Return 0 on success. On errors, set
2565 * errno appropriately and return a nonzero value.
2567 static int lock_packed_refs(int flags)
2569 static int timeout_configured = 0;
2570 static int timeout_value = 1000;
2572 struct packed_ref_cache *packed_ref_cache;
2574 if (!timeout_configured) {
2575 git_config_get_int("core.packedrefstimeout", &timeout_value);
2576 timeout_configured = 1;
2579 if (hold_lock_file_for_update_timeout(
2580 &packlock, git_path("packed-refs"),
2581 flags, timeout_value) < 0)
2582 return -1;
2584 * Get the current packed-refs while holding the lock. If the
2585 * packed-refs file has been modified since we last read it,
2586 * this will automatically invalidate the cache and re-read
2587 * the packed-refs file.
2589 packed_ref_cache = get_packed_ref_cache(&ref_cache);
2590 packed_ref_cache->lock = &packlock;
2591 /* Increment the reference count to prevent it from being freed: */
2592 acquire_packed_ref_cache(packed_ref_cache);
2593 return 0;
2597 * Write the current version of the packed refs cache from memory to
2598 * disk. The packed-refs file must already be locked for writing (see
2599 * lock_packed_refs()). Return zero on success. On errors, set errno
2600 * and return a nonzero value
2602 static int commit_packed_refs(void)
2604 struct packed_ref_cache *packed_ref_cache =
2605 get_packed_ref_cache(&ref_cache);
2606 int error = 0;
2607 int save_errno = 0;
2608 FILE *out;
2610 if (!packed_ref_cache->lock)
2611 die("internal error: packed-refs not locked");
2613 out = fdopen_lock_file(packed_ref_cache->lock, "w");
2614 if (!out)
2615 die_errno("unable to fdopen packed-refs descriptor");
2617 fprintf_or_die(out, "%s", PACKED_REFS_HEADER);
2618 do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache),
2619 0, write_packed_entry_fn, out);
2621 if (commit_lock_file(packed_ref_cache->lock)) {
2622 save_errno = errno;
2623 error = -1;
2625 packed_ref_cache->lock = NULL;
2626 release_packed_ref_cache(packed_ref_cache);
2627 errno = save_errno;
2628 return error;
2632 * Rollback the lockfile for the packed-refs file, and discard the
2633 * in-memory packed reference cache. (The packed-refs file will be
2634 * read anew if it is needed again after this function is called.)
2636 static void rollback_packed_refs(void)
2638 struct packed_ref_cache *packed_ref_cache =
2639 get_packed_ref_cache(&ref_cache);
2641 if (!packed_ref_cache->lock)
2642 die("internal error: packed-refs not locked");
2643 rollback_lock_file(packed_ref_cache->lock);
2644 packed_ref_cache->lock = NULL;
2645 release_packed_ref_cache(packed_ref_cache);
2646 clear_packed_ref_cache(&ref_cache);
2649 struct ref_to_prune {
2650 struct ref_to_prune *next;
2651 unsigned char sha1[20];
2652 char name[FLEX_ARRAY];
2655 struct pack_refs_cb_data {
2656 unsigned int flags;
2657 struct ref_dir *packed_refs;
2658 struct ref_to_prune *ref_to_prune;
2662 * An each_ref_entry_fn that is run over loose references only. If
2663 * the loose reference can be packed, add an entry in the packed ref
2664 * cache. If the reference should be pruned, also add it to
2665 * ref_to_prune in the pack_refs_cb_data.
2667 static int pack_if_possible_fn(struct ref_entry *entry, void *cb_data)
2669 struct pack_refs_cb_data *cb = cb_data;
2670 enum peel_status peel_status;
2671 struct ref_entry *packed_entry;
2672 int is_tag_ref = starts_with(entry->name, "refs/tags/");
2674 /* ALWAYS pack tags */
2675 if (!(cb->flags & PACK_REFS_ALL) && !is_tag_ref)
2676 return 0;
2678 /* Do not pack symbolic or broken refs: */
2679 if ((entry->flag & REF_ISSYMREF) || !ref_resolves_to_object(entry))
2680 return 0;
2682 /* Add a packed ref cache entry equivalent to the loose entry. */
2683 peel_status = peel_entry(entry, 1);
2684 if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)
2685 die("internal error peeling reference %s (%s)",
2686 entry->name, oid_to_hex(&entry->u.value.oid));
2687 packed_entry = find_ref(cb->packed_refs, entry->name);
2688 if (packed_entry) {
2689 /* Overwrite existing packed entry with info from loose entry */
2690 packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED;
2691 oidcpy(&packed_entry->u.value.oid, &entry->u.value.oid);
2692 } else {
2693 packed_entry = create_ref_entry(entry->name, entry->u.value.oid.hash,
2694 REF_ISPACKED | REF_KNOWS_PEELED, 0);
2695 add_ref(cb->packed_refs, packed_entry);
2697 oidcpy(&packed_entry->u.value.peeled, &entry->u.value.peeled);
2699 /* Schedule the loose reference for pruning if requested. */
2700 if ((cb->flags & PACK_REFS_PRUNE)) {
2701 int namelen = strlen(entry->name) + 1;
2702 struct ref_to_prune *n = xcalloc(1, sizeof(*n) + namelen);
2703 hashcpy(n->sha1, entry->u.value.oid.hash);
2704 strcpy(n->name, entry->name);
2705 n->next = cb->ref_to_prune;
2706 cb->ref_to_prune = n;
2708 return 0;
2712 * Remove empty parents, but spare refs/ and immediate subdirs.
2713 * Note: munges *name.
2715 static void try_remove_empty_parents(char *name)
2717 char *p, *q;
2718 int i;
2719 p = name;
2720 for (i = 0; i < 2; i++) { /* refs/{heads,tags,...}/ */
2721 while (*p && *p != '/')
2722 p++;
2723 /* tolerate duplicate slashes; see check_refname_format() */
2724 while (*p == '/')
2725 p++;
2727 for (q = p; *q; q++)
2729 while (1) {
2730 while (q > p && *q != '/')
2731 q--;
2732 while (q > p && *(q-1) == '/')
2733 q--;
2734 if (q == p)
2735 break;
2736 *q = '\0';
2737 if (rmdir(git_path("%s", name)))
2738 break;
2742 /* make sure nobody touched the ref, and unlink */
2743 static void prune_ref(struct ref_to_prune *r)
2745 struct ref_transaction *transaction;
2746 struct strbuf err = STRBUF_INIT;
2748 if (check_refname_format(r->name, 0))
2749 return;
2751 transaction = ref_transaction_begin(&err);
2752 if (!transaction ||
2753 ref_transaction_delete(transaction, r->name, r->sha1,
2754 REF_ISPRUNING, NULL, &err) ||
2755 ref_transaction_commit(transaction, &err)) {
2756 ref_transaction_free(transaction);
2757 error("%s", err.buf);
2758 strbuf_release(&err);
2759 return;
2761 ref_transaction_free(transaction);
2762 strbuf_release(&err);
2763 try_remove_empty_parents(r->name);
2766 static void prune_refs(struct ref_to_prune *r)
2768 while (r) {
2769 prune_ref(r);
2770 r = r->next;
2774 int pack_refs(unsigned int flags)
2776 struct pack_refs_cb_data cbdata;
2778 memset(&cbdata, 0, sizeof(cbdata));
2779 cbdata.flags = flags;
2781 lock_packed_refs(LOCK_DIE_ON_ERROR);
2782 cbdata.packed_refs = get_packed_refs(&ref_cache);
2784 do_for_each_entry_in_dir(get_loose_refs(&ref_cache), 0,
2785 pack_if_possible_fn, &cbdata);
2787 if (commit_packed_refs())
2788 die_errno("unable to overwrite old ref-pack file");
2790 prune_refs(cbdata.ref_to_prune);
2791 return 0;
2795 * Rewrite the packed-refs file, omitting any refs listed in
2796 * 'refnames'. On error, leave packed-refs unchanged, write an error
2797 * message to 'err', and return a nonzero value.
2799 * The refs in 'refnames' needn't be sorted. `err` must not be NULL.
2801 static int repack_without_refs(struct string_list *refnames, struct strbuf *err)
2803 struct ref_dir *packed;
2804 struct string_list_item *refname;
2805 int ret, needs_repacking = 0, removed = 0;
2807 assert(err);
2809 /* Look for a packed ref */
2810 for_each_string_list_item(refname, refnames) {
2811 if (get_packed_ref(refname->string)) {
2812 needs_repacking = 1;
2813 break;
2817 /* Avoid locking if we have nothing to do */
2818 if (!needs_repacking)
2819 return 0; /* no refname exists in packed refs */
2821 if (lock_packed_refs(0)) {
2822 unable_to_lock_message(git_path("packed-refs"), errno, err);
2823 return -1;
2825 packed = get_packed_refs(&ref_cache);
2827 /* Remove refnames from the cache */
2828 for_each_string_list_item(refname, refnames)
2829 if (remove_entry(packed, refname->string) != -1)
2830 removed = 1;
2831 if (!removed) {
2833 * All packed entries disappeared while we were
2834 * acquiring the lock.
2836 rollback_packed_refs();
2837 return 0;
2840 /* Write what remains */
2841 ret = commit_packed_refs();
2842 if (ret)
2843 strbuf_addf(err, "unable to overwrite old ref-pack file: %s",
2844 strerror(errno));
2845 return ret;
2848 static int delete_ref_loose(struct ref_lock *lock, int flag, struct strbuf *err)
2850 assert(err);
2852 if (!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) {
2854 * loose. The loose file name is the same as the
2855 * lockfile name, minus ".lock":
2857 char *loose_filename = get_locked_file_path(lock->lk);
2858 int res = unlink_or_msg(loose_filename, err);
2859 free(loose_filename);
2860 if (res)
2861 return 1;
2863 return 0;
2866 int delete_ref(const char *refname, const unsigned char *old_sha1,
2867 unsigned int flags)
2869 struct ref_transaction *transaction;
2870 struct strbuf err = STRBUF_INIT;
2872 transaction = ref_transaction_begin(&err);
2873 if (!transaction ||
2874 ref_transaction_delete(transaction, refname, old_sha1,
2875 flags, NULL, &err) ||
2876 ref_transaction_commit(transaction, &err)) {
2877 error("%s", err.buf);
2878 ref_transaction_free(transaction);
2879 strbuf_release(&err);
2880 return 1;
2882 ref_transaction_free(transaction);
2883 strbuf_release(&err);
2884 return 0;
2887 int delete_refs(struct string_list *refnames)
2889 struct strbuf err = STRBUF_INIT;
2890 int i, result = 0;
2892 if (!refnames->nr)
2893 return 0;
2895 result = repack_without_refs(refnames, &err);
2896 if (result) {
2898 * If we failed to rewrite the packed-refs file, then
2899 * it is unsafe to try to remove loose refs, because
2900 * doing so might expose an obsolete packed value for
2901 * a reference that might even point at an object that
2902 * has been garbage collected.
2904 if (refnames->nr == 1)
2905 error(_("could not delete reference %s: %s"),
2906 refnames->items[0].string, err.buf);
2907 else
2908 error(_("could not delete references: %s"), err.buf);
2910 goto out;
2913 for (i = 0; i < refnames->nr; i++) {
2914 const char *refname = refnames->items[i].string;
2916 if (delete_ref(refname, NULL, 0))
2917 result |= error(_("could not remove reference %s"), refname);
2920 out:
2921 strbuf_release(&err);
2922 return result;
2926 * People using contrib's git-new-workdir have .git/logs/refs ->
2927 * /some/other/path/.git/logs/refs, and that may live on another device.
2929 * IOW, to avoid cross device rename errors, the temporary renamed log must
2930 * live into logs/refs.
2932 #define TMP_RENAMED_LOG "logs/refs/.tmp-renamed-log"
2934 static int rename_tmp_log(const char *newrefname)
2936 int attempts_remaining = 4;
2937 struct strbuf path = STRBUF_INIT;
2938 int ret = -1;
2940 retry:
2941 strbuf_reset(&path);
2942 strbuf_git_path(&path, "logs/%s", newrefname);
2943 switch (safe_create_leading_directories_const(path.buf)) {
2944 case SCLD_OK:
2945 break; /* success */
2946 case SCLD_VANISHED:
2947 if (--attempts_remaining > 0)
2948 goto retry;
2949 /* fall through */
2950 default:
2951 error("unable to create directory for %s", newrefname);
2952 goto out;
2955 if (rename(git_path(TMP_RENAMED_LOG), path.buf)) {
2956 if ((errno==EISDIR || errno==ENOTDIR) && --attempts_remaining > 0) {
2958 * rename(a, b) when b is an existing
2959 * directory ought to result in ISDIR, but
2960 * Solaris 5.8 gives ENOTDIR. Sheesh.
2962 if (remove_empty_directories(&path)) {
2963 error("Directory not empty: logs/%s", newrefname);
2964 goto out;
2966 goto retry;
2967 } else if (errno == ENOENT && --attempts_remaining > 0) {
2969 * Maybe another process just deleted one of
2970 * the directories in the path to newrefname.
2971 * Try again from the beginning.
2973 goto retry;
2974 } else {
2975 error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s: %s",
2976 newrefname, strerror(errno));
2977 goto out;
2980 ret = 0;
2981 out:
2982 strbuf_release(&path);
2983 return ret;
2986 static int rename_ref_available(const char *oldname, const char *newname)
2988 struct string_list skip = STRING_LIST_INIT_NODUP;
2989 struct strbuf err = STRBUF_INIT;
2990 int ret;
2992 string_list_insert(&skip, oldname);
2993 ret = !verify_refname_available(newname, NULL, &skip,
2994 get_packed_refs(&ref_cache), &err)
2995 && !verify_refname_available(newname, NULL, &skip,
2996 get_loose_refs(&ref_cache), &err);
2997 if (!ret)
2998 error("%s", err.buf);
3000 string_list_clear(&skip, 0);
3001 strbuf_release(&err);
3002 return ret;
3005 static int write_ref_to_lockfile(struct ref_lock *lock,
3006 const unsigned char *sha1, struct strbuf *err);
3007 static int commit_ref_update(struct ref_lock *lock,
3008 const unsigned char *sha1, const char *logmsg,
3009 int flags, struct strbuf *err);
3011 int rename_ref(const char *oldrefname, const char *newrefname, const char *logmsg)
3013 unsigned char sha1[20], orig_sha1[20];
3014 int flag = 0, logmoved = 0;
3015 struct ref_lock *lock;
3016 struct stat loginfo;
3017 int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);
3018 const char *symref = NULL;
3019 struct strbuf err = STRBUF_INIT;
3021 if (log && S_ISLNK(loginfo.st_mode))
3022 return error("reflog for %s is a symlink", oldrefname);
3024 symref = resolve_ref_unsafe(oldrefname, RESOLVE_REF_READING,
3025 orig_sha1, &flag);
3026 if (flag & REF_ISSYMREF)
3027 return error("refname %s is a symbolic ref, renaming it is not supported",
3028 oldrefname);
3029 if (!symref)
3030 return error("refname %s not found", oldrefname);
3032 if (!rename_ref_available(oldrefname, newrefname))
3033 return 1;
3035 if (log && rename(git_path("logs/%s", oldrefname), git_path(TMP_RENAMED_LOG)))
3036 return error("unable to move logfile logs/%s to "TMP_RENAMED_LOG": %s",
3037 oldrefname, strerror(errno));
3039 if (delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {
3040 error("unable to delete old %s", oldrefname);
3041 goto rollback;
3044 if (!read_ref_full(newrefname, RESOLVE_REF_READING, sha1, NULL) &&
3045 delete_ref(newrefname, sha1, REF_NODEREF)) {
3046 if (errno==EISDIR) {
3047 struct strbuf path = STRBUF_INIT;
3048 int result;
3050 strbuf_git_path(&path, "%s", newrefname);
3051 result = remove_empty_directories(&path);
3052 strbuf_release(&path);
3054 if (result) {
3055 error("Directory not empty: %s", newrefname);
3056 goto rollback;
3058 } else {
3059 error("unable to delete existing %s", newrefname);
3060 goto rollback;
3064 if (log && rename_tmp_log(newrefname))
3065 goto rollback;
3067 logmoved = log;
3069 lock = lock_ref_sha1_basic(newrefname, NULL, NULL, NULL, 0, NULL, &err);
3070 if (!lock) {
3071 error("unable to rename '%s' to '%s': %s", oldrefname, newrefname, err.buf);
3072 strbuf_release(&err);
3073 goto rollback;
3075 hashcpy(lock->old_oid.hash, orig_sha1);
3077 if (write_ref_to_lockfile(lock, orig_sha1, &err) ||
3078 commit_ref_update(lock, orig_sha1, logmsg, 0, &err)) {
3079 error("unable to write current sha1 into %s: %s", newrefname, err.buf);
3080 strbuf_release(&err);
3081 goto rollback;
3084 return 0;
3086 rollback:
3087 lock = lock_ref_sha1_basic(oldrefname, NULL, NULL, NULL, 0, NULL, &err);
3088 if (!lock) {
3089 error("unable to lock %s for rollback: %s", oldrefname, err.buf);
3090 strbuf_release(&err);
3091 goto rollbacklog;
3094 flag = log_all_ref_updates;
3095 log_all_ref_updates = 0;
3096 if (write_ref_to_lockfile(lock, orig_sha1, &err) ||
3097 commit_ref_update(lock, orig_sha1, NULL, 0, &err)) {
3098 error("unable to write current sha1 into %s: %s", oldrefname, err.buf);
3099 strbuf_release(&err);
3101 log_all_ref_updates = flag;
3103 rollbacklog:
3104 if (logmoved && rename(git_path("logs/%s", newrefname), git_path("logs/%s", oldrefname)))
3105 error("unable to restore logfile %s from %s: %s",
3106 oldrefname, newrefname, strerror(errno));
3107 if (!logmoved && log &&
3108 rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", oldrefname)))
3109 error("unable to restore logfile %s from "TMP_RENAMED_LOG": %s",
3110 oldrefname, strerror(errno));
3112 return 1;
3115 static int close_ref(struct ref_lock *lock)
3117 if (close_lock_file(lock->lk))
3118 return -1;
3119 return 0;
3122 static int commit_ref(struct ref_lock *lock)
3124 if (commit_lock_file(lock->lk))
3125 return -1;
3126 return 0;
3130 * copy the reflog message msg to buf, which has been allocated sufficiently
3131 * large, while cleaning up the whitespaces. Especially, convert LF to space,
3132 * because reflog file is one line per entry.
3134 static int copy_msg(char *buf, const char *msg)
3136 char *cp = buf;
3137 char c;
3138 int wasspace = 1;
3140 *cp++ = '\t';
3141 while ((c = *msg++)) {
3142 if (wasspace && isspace(c))
3143 continue;
3144 wasspace = isspace(c);
3145 if (wasspace)
3146 c = ' ';
3147 *cp++ = c;
3149 while (buf < cp && isspace(cp[-1]))
3150 cp--;
3151 *cp++ = '\n';
3152 return cp - buf;
3155 static int should_autocreate_reflog(const char *refname)
3157 if (!log_all_ref_updates)
3158 return 0;
3159 return starts_with(refname, "refs/heads/") ||
3160 starts_with(refname, "refs/remotes/") ||
3161 starts_with(refname, "refs/notes/") ||
3162 !strcmp(refname, "HEAD");
3166 * Create a reflog for a ref. If force_create = 0, the reflog will
3167 * only be created for certain refs (those for which
3168 * should_autocreate_reflog returns non-zero. Otherwise, create it
3169 * regardless of the ref name. Fill in *err and return -1 on failure.
3171 static int log_ref_setup(const char *refname, struct strbuf *logfile, struct strbuf *err, int force_create)
3173 int logfd, oflags = O_APPEND | O_WRONLY;
3175 strbuf_git_path(logfile, "logs/%s", refname);
3176 if (force_create || should_autocreate_reflog(refname)) {
3177 if (safe_create_leading_directories(logfile->buf) < 0) {
3178 strbuf_addf(err, "unable to create directory for %s: "
3179 "%s", logfile->buf, strerror(errno));
3180 return -1;
3182 oflags |= O_CREAT;
3185 logfd = open(logfile->buf, oflags, 0666);
3186 if (logfd < 0) {
3187 if (!(oflags & O_CREAT) && (errno == ENOENT || errno == EISDIR))
3188 return 0;
3190 if (errno == EISDIR) {
3191 if (remove_empty_directories(logfile)) {
3192 strbuf_addf(err, "There are still logs under "
3193 "'%s'", logfile->buf);
3194 return -1;
3196 logfd = open(logfile->buf, oflags, 0666);
3199 if (logfd < 0) {
3200 strbuf_addf(err, "unable to append to %s: %s",
3201 logfile->buf, strerror(errno));
3202 return -1;
3206 adjust_shared_perm(logfile->buf);
3207 close(logfd);
3208 return 0;
3212 int safe_create_reflog(const char *refname, int force_create, struct strbuf *err)
3214 int ret;
3215 struct strbuf sb = STRBUF_INIT;
3217 ret = log_ref_setup(refname, &sb, err, force_create);
3218 strbuf_release(&sb);
3219 return ret;
3222 static int log_ref_write_fd(int fd, const unsigned char *old_sha1,
3223 const unsigned char *new_sha1,
3224 const char *committer, const char *msg)
3226 int msglen, written;
3227 unsigned maxlen, len;
3228 char *logrec;
3230 msglen = msg ? strlen(msg) : 0;
3231 maxlen = strlen(committer) + msglen + 100;
3232 logrec = xmalloc(maxlen);
3233 len = sprintf(logrec, "%s %s %s\n",
3234 sha1_to_hex(old_sha1),
3235 sha1_to_hex(new_sha1),
3236 committer);
3237 if (msglen)
3238 len += copy_msg(logrec + len - 1, msg) - 1;
3240 written = len <= maxlen ? write_in_full(fd, logrec, len) : -1;
3241 free(logrec);
3242 if (written != len)
3243 return -1;
3245 return 0;
3248 static int log_ref_write_1(const char *refname, const unsigned char *old_sha1,
3249 const unsigned char *new_sha1, const char *msg,
3250 struct strbuf *logfile, int flags,
3251 struct strbuf *err)
3253 int logfd, result, oflags = O_APPEND | O_WRONLY;
3255 if (log_all_ref_updates < 0)
3256 log_all_ref_updates = !is_bare_repository();
3258 result = log_ref_setup(refname, logfile, err, flags & REF_FORCE_CREATE_REFLOG);
3260 if (result)
3261 return result;
3263 logfd = open(logfile->buf, oflags);
3264 if (logfd < 0)
3265 return 0;
3266 result = log_ref_write_fd(logfd, old_sha1, new_sha1,
3267 git_committer_info(0), msg);
3268 if (result) {
3269 strbuf_addf(err, "unable to append to %s: %s", logfile->buf,
3270 strerror(errno));
3271 close(logfd);
3272 return -1;
3274 if (close(logfd)) {
3275 strbuf_addf(err, "unable to append to %s: %s", logfile->buf,
3276 strerror(errno));
3277 return -1;
3279 return 0;
3282 static int log_ref_write(const char *refname, const unsigned char *old_sha1,
3283 const unsigned char *new_sha1, const char *msg,
3284 int flags, struct strbuf *err)
3286 struct strbuf sb = STRBUF_INIT;
3287 int ret = log_ref_write_1(refname, old_sha1, new_sha1, msg, &sb, flags,
3288 err);
3289 strbuf_release(&sb);
3290 return ret;
3293 int is_branch(const char *refname)
3295 return !strcmp(refname, "HEAD") || starts_with(refname, "refs/heads/");
3299 * Write sha1 into the open lockfile, then close the lockfile. On
3300 * errors, rollback the lockfile, fill in *err and
3301 * return -1.
3303 static int write_ref_to_lockfile(struct ref_lock *lock,
3304 const unsigned char *sha1, struct strbuf *err)
3306 static char term = '\n';
3307 struct object *o;
3309 o = parse_object(sha1);
3310 if (!o) {
3311 strbuf_addf(err,
3312 "Trying to write ref %s with nonexistent object %s",
3313 lock->ref_name, sha1_to_hex(sha1));
3314 unlock_ref(lock);
3315 return -1;
3317 if (o->type != OBJ_COMMIT && is_branch(lock->ref_name)) {
3318 strbuf_addf(err,
3319 "Trying to write non-commit object %s to branch %s",
3320 sha1_to_hex(sha1), lock->ref_name);
3321 unlock_ref(lock);
3322 return -1;
3324 if (write_in_full(lock->lk->fd, sha1_to_hex(sha1), 40) != 40 ||
3325 write_in_full(lock->lk->fd, &term, 1) != 1 ||
3326 close_ref(lock) < 0) {
3327 strbuf_addf(err,
3328 "Couldn't write %s", lock->lk->filename.buf);
3329 unlock_ref(lock);
3330 return -1;
3332 return 0;
3336 * Commit a change to a loose reference that has already been written
3337 * to the loose reference lockfile. Also update the reflogs if
3338 * necessary, using the specified lockmsg (which can be NULL).
3340 static int commit_ref_update(struct ref_lock *lock,
3341 const unsigned char *sha1, const char *logmsg,
3342 int flags, struct strbuf *err)
3344 clear_loose_ref_cache(&ref_cache);
3345 if (log_ref_write(lock->ref_name, lock->old_oid.hash, sha1, logmsg, flags, err) < 0 ||
3346 (strcmp(lock->ref_name, lock->orig_ref_name) &&
3347 log_ref_write(lock->orig_ref_name, lock->old_oid.hash, sha1, logmsg, flags, err) < 0)) {
3348 char *old_msg = strbuf_detach(err, NULL);
3349 strbuf_addf(err, "Cannot update the ref '%s': %s",
3350 lock->ref_name, old_msg);
3351 free(old_msg);
3352 unlock_ref(lock);
3353 return -1;
3355 if (strcmp(lock->orig_ref_name, "HEAD") != 0) {
3357 * Special hack: If a branch is updated directly and HEAD
3358 * points to it (may happen on the remote side of a push
3359 * for example) then logically the HEAD reflog should be
3360 * updated too.
3361 * A generic solution implies reverse symref information,
3362 * but finding all symrefs pointing to the given branch
3363 * would be rather costly for this rare event (the direct
3364 * update of a branch) to be worth it. So let's cheat and
3365 * check with HEAD only which should cover 99% of all usage
3366 * scenarios (even 100% of the default ones).
3368 unsigned char head_sha1[20];
3369 int head_flag;
3370 const char *head_ref;
3371 head_ref = resolve_ref_unsafe("HEAD", RESOLVE_REF_READING,
3372 head_sha1, &head_flag);
3373 if (head_ref && (head_flag & REF_ISSYMREF) &&
3374 !strcmp(head_ref, lock->ref_name)) {
3375 struct strbuf log_err = STRBUF_INIT;
3376 if (log_ref_write("HEAD", lock->old_oid.hash, sha1,
3377 logmsg, 0, &log_err)) {
3378 error("%s", log_err.buf);
3379 strbuf_release(&log_err);
3383 if (commit_ref(lock)) {
3384 error("Couldn't set %s", lock->ref_name);
3385 unlock_ref(lock);
3386 return -1;
3389 unlock_ref(lock);
3390 return 0;
3393 int create_symref(const char *ref_target, const char *refs_heads_master,
3394 const char *logmsg)
3396 char *lockpath = NULL;
3397 char ref[1000];
3398 int fd, len, written;
3399 char *git_HEAD = git_pathdup("%s", ref_target);
3400 unsigned char old_sha1[20], new_sha1[20];
3401 struct strbuf err = STRBUF_INIT;
3403 if (logmsg && read_ref(ref_target, old_sha1))
3404 hashclr(old_sha1);
3406 if (safe_create_leading_directories(git_HEAD) < 0)
3407 return error("unable to create directory for %s", git_HEAD);
3409 #ifndef NO_SYMLINK_HEAD
3410 if (prefer_symlink_refs) {
3411 unlink(git_HEAD);
3412 if (!symlink(refs_heads_master, git_HEAD))
3413 goto done;
3414 fprintf(stderr, "no symlink - falling back to symbolic ref\n");
3416 #endif
3418 len = snprintf(ref, sizeof(ref), "ref: %s\n", refs_heads_master);
3419 if (sizeof(ref) <= len) {
3420 error("refname too long: %s", refs_heads_master);
3421 goto error_free_return;
3423 lockpath = mkpathdup("%s.lock", git_HEAD);
3424 fd = open(lockpath, O_CREAT | O_EXCL | O_WRONLY, 0666);
3425 if (fd < 0) {
3426 error("Unable to open %s for writing", lockpath);
3427 goto error_free_return;
3429 written = write_in_full(fd, ref, len);
3430 if (close(fd) != 0 || written != len) {
3431 error("Unable to write to %s", lockpath);
3432 goto error_unlink_return;
3434 if (rename(lockpath, git_HEAD) < 0) {
3435 error("Unable to create %s", git_HEAD);
3436 goto error_unlink_return;
3438 if (adjust_shared_perm(git_HEAD)) {
3439 error("Unable to fix permissions on %s", lockpath);
3440 error_unlink_return:
3441 unlink_or_warn(lockpath);
3442 error_free_return:
3443 free(lockpath);
3444 free(git_HEAD);
3445 return -1;
3447 free(lockpath);
3449 #ifndef NO_SYMLINK_HEAD
3450 done:
3451 #endif
3452 if (logmsg && !read_ref(refs_heads_master, new_sha1) &&
3453 log_ref_write(ref_target, old_sha1, new_sha1, logmsg, 0, &err)) {
3454 error("%s", err.buf);
3455 strbuf_release(&err);
3458 free(git_HEAD);
3459 return 0;
3462 struct read_ref_at_cb {
3463 const char *refname;
3464 unsigned long at_time;
3465 int cnt;
3466 int reccnt;
3467 unsigned char *sha1;
3468 int found_it;
3470 unsigned char osha1[20];
3471 unsigned char nsha1[20];
3472 int tz;
3473 unsigned long date;
3474 char **msg;
3475 unsigned long *cutoff_time;
3476 int *cutoff_tz;
3477 int *cutoff_cnt;
3480 static int read_ref_at_ent(unsigned char *osha1, unsigned char *nsha1,
3481 const char *email, unsigned long timestamp, int tz,
3482 const char *message, void *cb_data)
3484 struct read_ref_at_cb *cb = cb_data;
3486 cb->reccnt++;
3487 cb->tz = tz;
3488 cb->date = timestamp;
3490 if (timestamp <= cb->at_time || cb->cnt == 0) {
3491 if (cb->msg)
3492 *cb->msg = xstrdup(message);
3493 if (cb->cutoff_time)
3494 *cb->cutoff_time = timestamp;
3495 if (cb->cutoff_tz)
3496 *cb->cutoff_tz = tz;
3497 if (cb->cutoff_cnt)
3498 *cb->cutoff_cnt = cb->reccnt - 1;
3500 * we have not yet updated cb->[n|o]sha1 so they still
3501 * hold the values for the previous record.
3503 if (!is_null_sha1(cb->osha1)) {
3504 hashcpy(cb->sha1, nsha1);
3505 if (hashcmp(cb->osha1, nsha1))
3506 warning("Log for ref %s has gap after %s.",
3507 cb->refname, show_date(cb->date, cb->tz, DATE_MODE(RFC2822)));
3509 else if (cb->date == cb->at_time)
3510 hashcpy(cb->sha1, nsha1);
3511 else if (hashcmp(nsha1, cb->sha1))
3512 warning("Log for ref %s unexpectedly ended on %s.",
3513 cb->refname, show_date(cb->date, cb->tz,
3514 DATE_MODE(RFC2822)));
3515 hashcpy(cb->osha1, osha1);
3516 hashcpy(cb->nsha1, nsha1);
3517 cb->found_it = 1;
3518 return 1;
3520 hashcpy(cb->osha1, osha1);
3521 hashcpy(cb->nsha1, nsha1);
3522 if (cb->cnt > 0)
3523 cb->cnt--;
3524 return 0;
3527 static int read_ref_at_ent_oldest(unsigned char *osha1, unsigned char *nsha1,
3528 const char *email, unsigned long timestamp,
3529 int tz, const char *message, void *cb_data)
3531 struct read_ref_at_cb *cb = cb_data;
3533 if (cb->msg)
3534 *cb->msg = xstrdup(message);
3535 if (cb->cutoff_time)
3536 *cb->cutoff_time = timestamp;
3537 if (cb->cutoff_tz)
3538 *cb->cutoff_tz = tz;
3539 if (cb->cutoff_cnt)
3540 *cb->cutoff_cnt = cb->reccnt;
3541 hashcpy(cb->sha1, osha1);
3542 if (is_null_sha1(cb->sha1))
3543 hashcpy(cb->sha1, nsha1);
3544 /* We just want the first entry */
3545 return 1;
3548 int read_ref_at(const char *refname, unsigned int flags, unsigned long at_time, int cnt,
3549 unsigned char *sha1, char **msg,
3550 unsigned long *cutoff_time, int *cutoff_tz, int *cutoff_cnt)
3552 struct read_ref_at_cb cb;
3554 memset(&cb, 0, sizeof(cb));
3555 cb.refname = refname;
3556 cb.at_time = at_time;
3557 cb.cnt = cnt;
3558 cb.msg = msg;
3559 cb.cutoff_time = cutoff_time;
3560 cb.cutoff_tz = cutoff_tz;
3561 cb.cutoff_cnt = cutoff_cnt;
3562 cb.sha1 = sha1;
3564 for_each_reflog_ent_reverse(refname, read_ref_at_ent, &cb);
3566 if (!cb.reccnt) {
3567 if (flags & GET_SHA1_QUIETLY)
3568 exit(128);
3569 else
3570 die("Log for %s is empty.", refname);
3572 if (cb.found_it)
3573 return 0;
3575 for_each_reflog_ent(refname, read_ref_at_ent_oldest, &cb);
3577 return 1;
3580 int reflog_exists(const char *refname)
3582 struct stat st;
3584 return !lstat(git_path("logs/%s", refname), &st) &&
3585 S_ISREG(st.st_mode);
3588 int delete_reflog(const char *refname)
3590 return remove_path(git_path("logs/%s", refname));
3593 static int show_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn, void *cb_data)
3595 unsigned char osha1[20], nsha1[20];
3596 char *email_end, *message;
3597 unsigned long timestamp;
3598 int tz;
3600 /* old SP new SP name <email> SP time TAB msg LF */
3601 if (sb->len < 83 || sb->buf[sb->len - 1] != '\n' ||
3602 get_sha1_hex(sb->buf, osha1) || sb->buf[40] != ' ' ||
3603 get_sha1_hex(sb->buf + 41, nsha1) || sb->buf[81] != ' ' ||
3604 !(email_end = strchr(sb->buf + 82, '>')) ||
3605 email_end[1] != ' ' ||
3606 !(timestamp = strtoul(email_end + 2, &message, 10)) ||
3607 !message || message[0] != ' ' ||
3608 (message[1] != '+' && message[1] != '-') ||
3609 !isdigit(message[2]) || !isdigit(message[3]) ||
3610 !isdigit(message[4]) || !isdigit(message[5]))
3611 return 0; /* corrupt? */
3612 email_end[1] = '\0';
3613 tz = strtol(message + 1, NULL, 10);
3614 if (message[6] != '\t')
3615 message += 6;
3616 else
3617 message += 7;
3618 return fn(osha1, nsha1, sb->buf + 82, timestamp, tz, message, cb_data);
3621 static char *find_beginning_of_line(char *bob, char *scan)
3623 while (bob < scan && *(--scan) != '\n')
3624 ; /* keep scanning backwards */
3626 * Return either beginning of the buffer, or LF at the end of
3627 * the previous line.
3629 return scan;
3632 int for_each_reflog_ent_reverse(const char *refname, each_reflog_ent_fn fn, void *cb_data)
3634 struct strbuf sb = STRBUF_INIT;
3635 FILE *logfp;
3636 long pos;
3637 int ret = 0, at_tail = 1;
3639 logfp = fopen(git_path("logs/%s", refname), "r");
3640 if (!logfp)
3641 return -1;
3643 /* Jump to the end */
3644 if (fseek(logfp, 0, SEEK_END) < 0)
3645 return error("cannot seek back reflog for %s: %s",
3646 refname, strerror(errno));
3647 pos = ftell(logfp);
3648 while (!ret && 0 < pos) {
3649 int cnt;
3650 size_t nread;
3651 char buf[BUFSIZ];
3652 char *endp, *scanp;
3654 /* Fill next block from the end */
3655 cnt = (sizeof(buf) < pos) ? sizeof(buf) : pos;
3656 if (fseek(logfp, pos - cnt, SEEK_SET))
3657 return error("cannot seek back reflog for %s: %s",
3658 refname, strerror(errno));
3659 nread = fread(buf, cnt, 1, logfp);
3660 if (nread != 1)
3661 return error("cannot read %d bytes from reflog for %s: %s",
3662 cnt, refname, strerror(errno));
3663 pos -= cnt;
3665 scanp = endp = buf + cnt;
3666 if (at_tail && scanp[-1] == '\n')
3667 /* Looking at the final LF at the end of the file */
3668 scanp--;
3669 at_tail = 0;
3671 while (buf < scanp) {
3673 * terminating LF of the previous line, or the beginning
3674 * of the buffer.
3676 char *bp;
3678 bp = find_beginning_of_line(buf, scanp);
3680 if (*bp == '\n') {
3682 * The newline is the end of the previous line,
3683 * so we know we have complete line starting
3684 * at (bp + 1). Prefix it onto any prior data
3685 * we collected for the line and process it.
3687 strbuf_splice(&sb, 0, 0, bp + 1, endp - (bp + 1));
3688 scanp = bp;
3689 endp = bp + 1;
3690 ret = show_one_reflog_ent(&sb, fn, cb_data);
3691 strbuf_reset(&sb);
3692 if (ret)
3693 break;
3694 } else if (!pos) {
3696 * We are at the start of the buffer, and the
3697 * start of the file; there is no previous
3698 * line, and we have everything for this one.
3699 * Process it, and we can end the loop.
3701 strbuf_splice(&sb, 0, 0, buf, endp - buf);
3702 ret = show_one_reflog_ent(&sb, fn, cb_data);
3703 strbuf_reset(&sb);
3704 break;
3707 if (bp == buf) {
3709 * We are at the start of the buffer, and there
3710 * is more file to read backwards. Which means
3711 * we are in the middle of a line. Note that we
3712 * may get here even if *bp was a newline; that
3713 * just means we are at the exact end of the
3714 * previous line, rather than some spot in the
3715 * middle.
3717 * Save away what we have to be combined with
3718 * the data from the next read.
3720 strbuf_splice(&sb, 0, 0, buf, endp - buf);
3721 break;
3726 if (!ret && sb.len)
3727 die("BUG: reverse reflog parser had leftover data");
3729 fclose(logfp);
3730 strbuf_release(&sb);
3731 return ret;
3734 int for_each_reflog_ent(const char *refname, each_reflog_ent_fn fn, void *cb_data)
3736 FILE *logfp;
3737 struct strbuf sb = STRBUF_INIT;
3738 int ret = 0;
3740 logfp = fopen(git_path("logs/%s", refname), "r");
3741 if (!logfp)
3742 return -1;
3744 while (!ret && !strbuf_getwholeline(&sb, logfp, '\n'))
3745 ret = show_one_reflog_ent(&sb, fn, cb_data);
3746 fclose(logfp);
3747 strbuf_release(&sb);
3748 return ret;
3751 * Call fn for each reflog in the namespace indicated by name. name
3752 * must be empty or end with '/'. Name will be used as a scratch
3753 * space, but its contents will be restored before return.
3755 static int do_for_each_reflog(struct strbuf *name, each_ref_fn fn, void *cb_data)
3757 DIR *d = opendir(git_path("logs/%s", name->buf));
3758 int retval = 0;
3759 struct dirent *de;
3760 int oldlen = name->len;
3762 if (!d)
3763 return name->len ? errno : 0;
3765 while ((de = readdir(d)) != NULL) {
3766 struct stat st;
3768 if (de->d_name[0] == '.')
3769 continue;
3770 if (ends_with(de->d_name, ".lock"))
3771 continue;
3772 strbuf_addstr(name, de->d_name);
3773 if (stat(git_path("logs/%s", name->buf), &st) < 0) {
3774 ; /* silently ignore */
3775 } else {
3776 if (S_ISDIR(st.st_mode)) {
3777 strbuf_addch(name, '/');
3778 retval = do_for_each_reflog(name, fn, cb_data);
3779 } else {
3780 struct object_id oid;
3782 if (read_ref_full(name->buf, 0, oid.hash, NULL))
3783 retval = error("bad ref for %s", name->buf);
3784 else
3785 retval = fn(name->buf, &oid, 0, cb_data);
3787 if (retval)
3788 break;
3790 strbuf_setlen(name, oldlen);
3792 closedir(d);
3793 return retval;
3796 int for_each_reflog(each_ref_fn fn, void *cb_data)
3798 int retval;
3799 struct strbuf name;
3800 strbuf_init(&name, PATH_MAX);
3801 retval = do_for_each_reflog(&name, fn, cb_data);
3802 strbuf_release(&name);
3803 return retval;
3807 * Information needed for a single ref update. Set new_sha1 to the new
3808 * value or to null_sha1 to delete the ref. To check the old value
3809 * while the ref is locked, set (flags & REF_HAVE_OLD) and set
3810 * old_sha1 to the old value, or to null_sha1 to ensure the ref does
3811 * not exist before update.
3813 struct ref_update {
3815 * If (flags & REF_HAVE_NEW), set the reference to this value:
3817 unsigned char new_sha1[20];
3819 * If (flags & REF_HAVE_OLD), check that the reference
3820 * previously had this value:
3822 unsigned char old_sha1[20];
3824 * One or more of REF_HAVE_NEW, REF_HAVE_OLD, REF_NODEREF,
3825 * REF_DELETING, and REF_ISPRUNING:
3827 unsigned int flags;
3828 struct ref_lock *lock;
3829 int type;
3830 char *msg;
3831 const char refname[FLEX_ARRAY];
3835 * Transaction states.
3836 * OPEN: The transaction is in a valid state and can accept new updates.
3837 * An OPEN transaction can be committed.
3838 * CLOSED: A closed transaction is no longer active and no other operations
3839 * than free can be used on it in this state.
3840 * A transaction can either become closed by successfully committing
3841 * an active transaction or if there is a failure while building
3842 * the transaction thus rendering it failed/inactive.
3844 enum ref_transaction_state {
3845 REF_TRANSACTION_OPEN = 0,
3846 REF_TRANSACTION_CLOSED = 1
3850 * Data structure for holding a reference transaction, which can
3851 * consist of checks and updates to multiple references, carried out
3852 * as atomically as possible. This structure is opaque to callers.
3854 struct ref_transaction {
3855 struct ref_update **updates;
3856 size_t alloc;
3857 size_t nr;
3858 enum ref_transaction_state state;
3861 struct ref_transaction *ref_transaction_begin(struct strbuf *err)
3863 assert(err);
3865 return xcalloc(1, sizeof(struct ref_transaction));
3868 void ref_transaction_free(struct ref_transaction *transaction)
3870 int i;
3872 if (!transaction)
3873 return;
3875 for (i = 0; i < transaction->nr; i++) {
3876 free(transaction->updates[i]->msg);
3877 free(transaction->updates[i]);
3879 free(transaction->updates);
3880 free(transaction);
3883 static struct ref_update *add_update(struct ref_transaction *transaction,
3884 const char *refname)
3886 size_t len = strlen(refname);
3887 struct ref_update *update = xcalloc(1, sizeof(*update) + len + 1);
3889 strcpy((char *)update->refname, refname);
3890 ALLOC_GROW(transaction->updates, transaction->nr + 1, transaction->alloc);
3891 transaction->updates[transaction->nr++] = update;
3892 return update;
3895 int ref_transaction_update(struct ref_transaction *transaction,
3896 const char *refname,
3897 const unsigned char *new_sha1,
3898 const unsigned char *old_sha1,
3899 unsigned int flags, const char *msg,
3900 struct strbuf *err)
3902 struct ref_update *update;
3904 assert(err);
3906 if (transaction->state != REF_TRANSACTION_OPEN)
3907 die("BUG: update called for transaction that is not open");
3909 if (new_sha1 && !is_null_sha1(new_sha1) &&
3910 check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {
3911 strbuf_addf(err, "refusing to update ref with bad name %s",
3912 refname);
3913 return -1;
3916 update = add_update(transaction, refname);
3917 if (new_sha1) {
3918 hashcpy(update->new_sha1, new_sha1);
3919 flags |= REF_HAVE_NEW;
3921 if (old_sha1) {
3922 hashcpy(update->old_sha1, old_sha1);
3923 flags |= REF_HAVE_OLD;
3925 update->flags = flags;
3926 if (msg)
3927 update->msg = xstrdup(msg);
3928 return 0;
3931 int ref_transaction_create(struct ref_transaction *transaction,
3932 const char *refname,
3933 const unsigned char *new_sha1,
3934 unsigned int flags, const char *msg,
3935 struct strbuf *err)
3937 if (!new_sha1 || is_null_sha1(new_sha1))
3938 die("BUG: create called without valid new_sha1");
3939 return ref_transaction_update(transaction, refname, new_sha1,
3940 null_sha1, flags, msg, err);
3943 int ref_transaction_delete(struct ref_transaction *transaction,
3944 const char *refname,
3945 const unsigned char *old_sha1,
3946 unsigned int flags, const char *msg,
3947 struct strbuf *err)
3949 if (old_sha1 && is_null_sha1(old_sha1))
3950 die("BUG: delete called with old_sha1 set to zeros");
3951 return ref_transaction_update(transaction, refname,
3952 null_sha1, old_sha1,
3953 flags, msg, err);
3956 int ref_transaction_verify(struct ref_transaction *transaction,
3957 const char *refname,
3958 const unsigned char *old_sha1,
3959 unsigned int flags,
3960 struct strbuf *err)
3962 if (!old_sha1)
3963 die("BUG: verify called with old_sha1 set to NULL");
3964 return ref_transaction_update(transaction, refname,
3965 NULL, old_sha1,
3966 flags, NULL, err);
3969 int update_ref(const char *msg, const char *refname,
3970 const unsigned char *new_sha1, const unsigned char *old_sha1,
3971 unsigned int flags, enum action_on_err onerr)
3973 struct ref_transaction *t;
3974 struct strbuf err = STRBUF_INIT;
3976 t = ref_transaction_begin(&err);
3977 if (!t ||
3978 ref_transaction_update(t, refname, new_sha1, old_sha1,
3979 flags, msg, &err) ||
3980 ref_transaction_commit(t, &err)) {
3981 const char *str = "update_ref failed for ref '%s': %s";
3983 ref_transaction_free(t);
3984 switch (onerr) {
3985 case UPDATE_REFS_MSG_ON_ERR:
3986 error(str, refname, err.buf);
3987 break;
3988 case UPDATE_REFS_DIE_ON_ERR:
3989 die(str, refname, err.buf);
3990 break;
3991 case UPDATE_REFS_QUIET_ON_ERR:
3992 break;
3994 strbuf_release(&err);
3995 return 1;
3997 strbuf_release(&err);
3998 ref_transaction_free(t);
3999 return 0;
4002 static int ref_update_reject_duplicates(struct string_list *refnames,
4003 struct strbuf *err)
4005 int i, n = refnames->nr;
4007 assert(err);
4009 for (i = 1; i < n; i++)
4010 if (!strcmp(refnames->items[i - 1].string, refnames->items[i].string)) {
4011 strbuf_addf(err,
4012 "Multiple updates for ref '%s' not allowed.",
4013 refnames->items[i].string);
4014 return 1;
4016 return 0;
4019 int ref_transaction_commit(struct ref_transaction *transaction,
4020 struct strbuf *err)
4022 int ret = 0, i;
4023 int n = transaction->nr;
4024 struct ref_update **updates = transaction->updates;
4025 struct string_list refs_to_delete = STRING_LIST_INIT_NODUP;
4026 struct string_list_item *ref_to_delete;
4027 struct string_list affected_refnames = STRING_LIST_INIT_NODUP;
4029 assert(err);
4031 if (transaction->state != REF_TRANSACTION_OPEN)
4032 die("BUG: commit called for transaction that is not open");
4034 if (!n) {
4035 transaction->state = REF_TRANSACTION_CLOSED;
4036 return 0;
4039 /* Fail if a refname appears more than once in the transaction: */
4040 for (i = 0; i < n; i++)
4041 string_list_append(&affected_refnames, updates[i]->refname);
4042 string_list_sort(&affected_refnames);
4043 if (ref_update_reject_duplicates(&affected_refnames, err)) {
4044 ret = TRANSACTION_GENERIC_ERROR;
4045 goto cleanup;
4049 * Acquire all locks, verify old values if provided, check
4050 * that new values are valid, and write new values to the
4051 * lockfiles, ready to be activated. Only keep one lockfile
4052 * open at a time to avoid running out of file descriptors.
4054 for (i = 0; i < n; i++) {
4055 struct ref_update *update = updates[i];
4057 if ((update->flags & REF_HAVE_NEW) &&
4058 is_null_sha1(update->new_sha1))
4059 update->flags |= REF_DELETING;
4060 update->lock = lock_ref_sha1_basic(
4061 update->refname,
4062 ((update->flags & REF_HAVE_OLD) ?
4063 update->old_sha1 : NULL),
4064 &affected_refnames, NULL,
4065 update->flags,
4066 &update->type,
4067 err);
4068 if (!update->lock) {
4069 char *reason;
4071 ret = (errno == ENOTDIR)
4072 ? TRANSACTION_NAME_CONFLICT
4073 : TRANSACTION_GENERIC_ERROR;
4074 reason = strbuf_detach(err, NULL);
4075 strbuf_addf(err, "cannot lock ref '%s': %s",
4076 update->refname, reason);
4077 free(reason);
4078 goto cleanup;
4080 if ((update->flags & REF_HAVE_NEW) &&
4081 !(update->flags & REF_DELETING)) {
4082 int overwriting_symref = ((update->type & REF_ISSYMREF) &&
4083 (update->flags & REF_NODEREF));
4085 if (!overwriting_symref &&
4086 !hashcmp(update->lock->old_oid.hash, update->new_sha1)) {
4088 * The reference already has the desired
4089 * value, so we don't need to write it.
4091 } else if (write_ref_to_lockfile(update->lock,
4092 update->new_sha1,
4093 err)) {
4094 char *write_err = strbuf_detach(err, NULL);
4097 * The lock was freed upon failure of
4098 * write_ref_to_lockfile():
4100 update->lock = NULL;
4101 strbuf_addf(err,
4102 "cannot update the ref '%s': %s",
4103 update->refname, write_err);
4104 free(write_err);
4105 ret = TRANSACTION_GENERIC_ERROR;
4106 goto cleanup;
4107 } else {
4108 update->flags |= REF_NEEDS_COMMIT;
4111 if (!(update->flags & REF_NEEDS_COMMIT)) {
4113 * We didn't have to write anything to the lockfile.
4114 * Close it to free up the file descriptor:
4116 if (close_ref(update->lock)) {
4117 strbuf_addf(err, "Couldn't close %s.lock",
4118 update->refname);
4119 goto cleanup;
4124 /* Perform updates first so live commits remain referenced */
4125 for (i = 0; i < n; i++) {
4126 struct ref_update *update = updates[i];
4128 if (update->flags & REF_NEEDS_COMMIT) {
4129 if (commit_ref_update(update->lock,
4130 update->new_sha1, update->msg,
4131 update->flags, err)) {
4132 /* freed by commit_ref_update(): */
4133 update->lock = NULL;
4134 ret = TRANSACTION_GENERIC_ERROR;
4135 goto cleanup;
4136 } else {
4137 /* freed by commit_ref_update(): */
4138 update->lock = NULL;
4143 /* Perform deletes now that updates are safely completed */
4144 for (i = 0; i < n; i++) {
4145 struct ref_update *update = updates[i];
4147 if (update->flags & REF_DELETING) {
4148 if (delete_ref_loose(update->lock, update->type, err)) {
4149 ret = TRANSACTION_GENERIC_ERROR;
4150 goto cleanup;
4153 if (!(update->flags & REF_ISPRUNING))
4154 string_list_append(&refs_to_delete,
4155 update->lock->ref_name);
4159 if (repack_without_refs(&refs_to_delete, err)) {
4160 ret = TRANSACTION_GENERIC_ERROR;
4161 goto cleanup;
4163 for_each_string_list_item(ref_to_delete, &refs_to_delete)
4164 unlink_or_warn(git_path("logs/%s", ref_to_delete->string));
4165 clear_loose_ref_cache(&ref_cache);
4167 cleanup:
4168 transaction->state = REF_TRANSACTION_CLOSED;
4170 for (i = 0; i < n; i++)
4171 if (updates[i]->lock)
4172 unlock_ref(updates[i]->lock);
4173 string_list_clear(&refs_to_delete, 0);
4174 string_list_clear(&affected_refnames, 0);
4175 return ret;
4178 static int ref_present(const char *refname,
4179 const struct object_id *oid, int flags, void *cb_data)
4181 struct string_list *affected_refnames = cb_data;
4183 return string_list_has_string(affected_refnames, refname);
4186 int initial_ref_transaction_commit(struct ref_transaction *transaction,
4187 struct strbuf *err)
4189 struct ref_dir *loose_refs = get_loose_refs(&ref_cache);
4190 struct ref_dir *packed_refs = get_packed_refs(&ref_cache);
4191 int ret = 0, i;
4192 int n = transaction->nr;
4193 struct ref_update **updates = transaction->updates;
4194 struct string_list affected_refnames = STRING_LIST_INIT_NODUP;
4196 assert(err);
4198 if (transaction->state != REF_TRANSACTION_OPEN)
4199 die("BUG: commit called for transaction that is not open");
4201 /* Fail if a refname appears more than once in the transaction: */
4202 for (i = 0; i < n; i++)
4203 string_list_append(&affected_refnames, updates[i]->refname);
4204 string_list_sort(&affected_refnames);
4205 if (ref_update_reject_duplicates(&affected_refnames, err)) {
4206 ret = TRANSACTION_GENERIC_ERROR;
4207 goto cleanup;
4211 * It's really undefined to call this function in an active
4212 * repository or when there are existing references: we are
4213 * only locking and changing packed-refs, so (1) any
4214 * simultaneous processes might try to change a reference at
4215 * the same time we do, and (2) any existing loose versions of
4216 * the references that we are setting would have precedence
4217 * over our values. But some remote helpers create the remote
4218 * "HEAD" and "master" branches before calling this function,
4219 * so here we really only check that none of the references
4220 * that we are creating already exists.
4222 if (for_each_rawref(ref_present, &affected_refnames))
4223 die("BUG: initial ref transaction called with existing refs");
4225 for (i = 0; i < n; i++) {
4226 struct ref_update *update = updates[i];
4228 if ((update->flags & REF_HAVE_OLD) &&
4229 !is_null_sha1(update->old_sha1))
4230 die("BUG: initial ref transaction with old_sha1 set");
4231 if (verify_refname_available(update->refname,
4232 &affected_refnames, NULL,
4233 loose_refs, err) ||
4234 verify_refname_available(update->refname,
4235 &affected_refnames, NULL,
4236 packed_refs, err)) {
4237 ret = TRANSACTION_NAME_CONFLICT;
4238 goto cleanup;
4242 if (lock_packed_refs(0)) {
4243 strbuf_addf(err, "unable to lock packed-refs file: %s",
4244 strerror(errno));
4245 ret = TRANSACTION_GENERIC_ERROR;
4246 goto cleanup;
4249 for (i = 0; i < n; i++) {
4250 struct ref_update *update = updates[i];
4252 if ((update->flags & REF_HAVE_NEW) &&
4253 !is_null_sha1(update->new_sha1))
4254 add_packed_ref(update->refname, update->new_sha1);
4257 if (commit_packed_refs()) {
4258 strbuf_addf(err, "unable to commit packed-refs file: %s",
4259 strerror(errno));
4260 ret = TRANSACTION_GENERIC_ERROR;
4261 goto cleanup;
4264 cleanup:
4265 transaction->state = REF_TRANSACTION_CLOSED;
4266 string_list_clear(&affected_refnames, 0);
4267 return ret;
4270 char *shorten_unambiguous_ref(const char *refname, int strict)
4272 int i;
4273 static char **scanf_fmts;
4274 static int nr_rules;
4275 char *short_name;
4277 if (!nr_rules) {
4279 * Pre-generate scanf formats from ref_rev_parse_rules[].
4280 * Generate a format suitable for scanf from a
4281 * ref_rev_parse_rules rule by interpolating "%s" at the
4282 * location of the "%.*s".
4284 size_t total_len = 0;
4285 size_t offset = 0;
4287 /* the rule list is NULL terminated, count them first */
4288 for (nr_rules = 0; ref_rev_parse_rules[nr_rules]; nr_rules++)
4289 /* -2 for strlen("%.*s") - strlen("%s"); +1 for NUL */
4290 total_len += strlen(ref_rev_parse_rules[nr_rules]) - 2 + 1;
4292 scanf_fmts = xmalloc(nr_rules * sizeof(char *) + total_len);
4294 offset = 0;
4295 for (i = 0; i < nr_rules; i++) {
4296 assert(offset < total_len);
4297 scanf_fmts[i] = (char *)&scanf_fmts[nr_rules] + offset;
4298 offset += snprintf(scanf_fmts[i], total_len - offset,
4299 ref_rev_parse_rules[i], 2, "%s") + 1;
4303 /* bail out if there are no rules */
4304 if (!nr_rules)
4305 return xstrdup(refname);
4307 /* buffer for scanf result, at most refname must fit */
4308 short_name = xstrdup(refname);
4310 /* skip first rule, it will always match */
4311 for (i = nr_rules - 1; i > 0 ; --i) {
4312 int j;
4313 int rules_to_fail = i;
4314 int short_name_len;
4316 if (1 != sscanf(refname, scanf_fmts[i], short_name))
4317 continue;
4319 short_name_len = strlen(short_name);
4322 * in strict mode, all (except the matched one) rules
4323 * must fail to resolve to a valid non-ambiguous ref
4325 if (strict)
4326 rules_to_fail = nr_rules;
4329 * check if the short name resolves to a valid ref,
4330 * but use only rules prior to the matched one
4332 for (j = 0; j < rules_to_fail; j++) {
4333 const char *rule = ref_rev_parse_rules[j];
4334 char refname[PATH_MAX];
4336 /* skip matched rule */
4337 if (i == j)
4338 continue;
4341 * the short name is ambiguous, if it resolves
4342 * (with this previous rule) to a valid ref
4343 * read_ref() returns 0 on success
4345 mksnpath(refname, sizeof(refname),
4346 rule, short_name_len, short_name);
4347 if (ref_exists(refname))
4348 break;
4352 * short name is non-ambiguous if all previous rules
4353 * haven't resolved to a valid ref
4355 if (j == rules_to_fail)
4356 return short_name;
4359 free(short_name);
4360 return xstrdup(refname);
4363 static struct string_list *hide_refs;
4365 int parse_hide_refs_config(const char *var, const char *value, const char *section)
4367 if (!strcmp("transfer.hiderefs", var) ||
4368 /* NEEDSWORK: use parse_config_key() once both are merged */
4369 (starts_with(var, section) && var[strlen(section)] == '.' &&
4370 !strcmp(var + strlen(section), ".hiderefs"))) {
4371 char *ref;
4372 int len;
4374 if (!value)
4375 return config_error_nonbool(var);
4376 ref = xstrdup(value);
4377 len = strlen(ref);
4378 while (len && ref[len - 1] == '/')
4379 ref[--len] = '\0';
4380 if (!hide_refs) {
4381 hide_refs = xcalloc(1, sizeof(*hide_refs));
4382 hide_refs->strdup_strings = 1;
4384 string_list_append(hide_refs, ref);
4386 return 0;
4389 int ref_is_hidden(const char *refname)
4391 struct string_list_item *item;
4393 if (!hide_refs)
4394 return 0;
4395 for_each_string_list_item(item, hide_refs) {
4396 int len;
4397 if (!starts_with(refname, item->string))
4398 continue;
4399 len = strlen(item->string);
4400 if (!refname[len] || refname[len] == '/')
4401 return 1;
4403 return 0;
4406 struct expire_reflog_cb {
4407 unsigned int flags;
4408 reflog_expiry_should_prune_fn *should_prune_fn;
4409 void *policy_cb;
4410 FILE *newlog;
4411 unsigned char last_kept_sha1[20];
4414 static int expire_reflog_ent(unsigned char *osha1, unsigned char *nsha1,
4415 const char *email, unsigned long timestamp, int tz,
4416 const char *message, void *cb_data)
4418 struct expire_reflog_cb *cb = cb_data;
4419 struct expire_reflog_policy_cb *policy_cb = cb->policy_cb;
4421 if (cb->flags & EXPIRE_REFLOGS_REWRITE)
4422 osha1 = cb->last_kept_sha1;
4424 if ((*cb->should_prune_fn)(osha1, nsha1, email, timestamp, tz,
4425 message, policy_cb)) {
4426 if (!cb->newlog)
4427 printf("would prune %s", message);
4428 else if (cb->flags & EXPIRE_REFLOGS_VERBOSE)
4429 printf("prune %s", message);
4430 } else {
4431 if (cb->newlog) {
4432 fprintf(cb->newlog, "%s %s %s %lu %+05d\t%s",
4433 sha1_to_hex(osha1), sha1_to_hex(nsha1),
4434 email, timestamp, tz, message);
4435 hashcpy(cb->last_kept_sha1, nsha1);
4437 if (cb->flags & EXPIRE_REFLOGS_VERBOSE)
4438 printf("keep %s", message);
4440 return 0;
4443 int reflog_expire(const char *refname, const unsigned char *sha1,
4444 unsigned int flags,
4445 reflog_expiry_prepare_fn prepare_fn,
4446 reflog_expiry_should_prune_fn should_prune_fn,
4447 reflog_expiry_cleanup_fn cleanup_fn,
4448 void *policy_cb_data)
4450 static struct lock_file reflog_lock;
4451 struct expire_reflog_cb cb;
4452 struct ref_lock *lock;
4453 char *log_file;
4454 int status = 0;
4455 int type;
4456 struct strbuf err = STRBUF_INIT;
4458 memset(&cb, 0, sizeof(cb));
4459 cb.flags = flags;
4460 cb.policy_cb = policy_cb_data;
4461 cb.should_prune_fn = should_prune_fn;
4464 * The reflog file is locked by holding the lock on the
4465 * reference itself, plus we might need to update the
4466 * reference if --updateref was specified:
4468 lock = lock_ref_sha1_basic(refname, sha1, NULL, NULL, 0, &type, &err);
4469 if (!lock) {
4470 error("cannot lock ref '%s': %s", refname, err.buf);
4471 strbuf_release(&err);
4472 return -1;
4474 if (!reflog_exists(refname)) {
4475 unlock_ref(lock);
4476 return 0;
4479 log_file = git_pathdup("logs/%s", refname);
4480 if (!(flags & EXPIRE_REFLOGS_DRY_RUN)) {
4482 * Even though holding $GIT_DIR/logs/$reflog.lock has
4483 * no locking implications, we use the lock_file
4484 * machinery here anyway because it does a lot of the
4485 * work we need, including cleaning up if the program
4486 * exits unexpectedly.
4488 if (hold_lock_file_for_update(&reflog_lock, log_file, 0) < 0) {
4489 struct strbuf err = STRBUF_INIT;
4490 unable_to_lock_message(log_file, errno, &err);
4491 error("%s", err.buf);
4492 strbuf_release(&err);
4493 goto failure;
4495 cb.newlog = fdopen_lock_file(&reflog_lock, "w");
4496 if (!cb.newlog) {
4497 error("cannot fdopen %s (%s)",
4498 reflog_lock.filename.buf, strerror(errno));
4499 goto failure;
4503 (*prepare_fn)(refname, sha1, cb.policy_cb);
4504 for_each_reflog_ent(refname, expire_reflog_ent, &cb);
4505 (*cleanup_fn)(cb.policy_cb);
4507 if (!(flags & EXPIRE_REFLOGS_DRY_RUN)) {
4509 * It doesn't make sense to adjust a reference pointed
4510 * to by a symbolic ref based on expiring entries in
4511 * the symbolic reference's reflog. Nor can we update
4512 * a reference if there are no remaining reflog
4513 * entries.
4515 int update = (flags & EXPIRE_REFLOGS_UPDATE_REF) &&
4516 !(type & REF_ISSYMREF) &&
4517 !is_null_sha1(cb.last_kept_sha1);
4519 if (close_lock_file(&reflog_lock)) {
4520 status |= error("couldn't write %s: %s", log_file,
4521 strerror(errno));
4522 } else if (update &&
4523 (write_in_full(lock->lk->fd,
4524 sha1_to_hex(cb.last_kept_sha1), 40) != 40 ||
4525 write_str_in_full(lock->lk->fd, "\n") != 1 ||
4526 close_ref(lock) < 0)) {
4527 status |= error("couldn't write %s",
4528 lock->lk->filename.buf);
4529 rollback_lock_file(&reflog_lock);
4530 } else if (commit_lock_file(&reflog_lock)) {
4531 status |= error("unable to commit reflog '%s' (%s)",
4532 log_file, strerror(errno));
4533 } else if (update && commit_ref(lock)) {
4534 status |= error("couldn't set %s", lock->ref_name);
4537 free(log_file);
4538 unlock_ref(lock);
4539 return status;
4541 failure:
4542 rollback_lock_file(&reflog_lock);
4543 free(log_file);
4544 unlock_ref(lock);
4545 return -1;