Merge branch 'mh/ref-directory-file'
[git.git] / refs.c
blobf704ee285cdff46e94d9bd47de5f39a7cc6927ee
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 unsigned char old_sha1[20];
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, "~", "^", ":" or SP
24 static unsigned char refname_disposition[256] = {
25 1, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
26 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
27 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 2, 1,
28 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 4,
29 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
30 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 4, 0, 4, 0,
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, 3, 0, 0, 4, 4
36 * Flag passed to lock_ref_sha1_basic() telling it to tolerate broken
37 * refs (i.e., because the reference is about to be deleted anyway).
39 #define REF_DELETING 0x02
42 * Used as a flag in ref_update::flags when a loose ref is being
43 * pruned.
45 #define REF_ISPRUNING 0x04
48 * Used as a flag in ref_update::flags when the reference should be
49 * updated to new_sha1.
51 #define REF_HAVE_NEW 0x08
54 * Used as a flag in ref_update::flags when old_sha1 should be
55 * checked.
57 #define REF_HAVE_OLD 0x10
60 * Used as a flag in ref_update::flags when the lockfile needs to be
61 * committed.
63 #define REF_NEEDS_COMMIT 0x20
66 * Try to read one refname component from the front of refname.
67 * Return the length of the component found, or -1 if the component is
68 * not legal. It is legal if it is something reasonable to have under
69 * ".git/refs/"; We do not like it if:
71 * - any path component of it begins with ".", or
72 * - it has double dots "..", or
73 * - it has ASCII control character, "~", "^", ":" or SP, anywhere, or
74 * - it ends with a "/".
75 * - it ends with ".lock"
76 * - it contains a "\" (backslash)
78 static int check_refname_component(const char *refname, int flags)
80 const char *cp;
81 char last = '\0';
83 for (cp = refname; ; cp++) {
84 int ch = *cp & 255;
85 unsigned char disp = refname_disposition[ch];
86 switch (disp) {
87 case 1:
88 goto out;
89 case 2:
90 if (last == '.')
91 return -1; /* Refname contains "..". */
92 break;
93 case 3:
94 if (last == '@')
95 return -1; /* Refname contains "@{". */
96 break;
97 case 4:
98 return -1;
100 last = ch;
102 out:
103 if (cp == refname)
104 return 0; /* Component has zero length. */
105 if (refname[0] == '.')
106 return -1; /* Component starts with '.'. */
107 if (cp - refname >= LOCK_SUFFIX_LEN &&
108 !memcmp(cp - LOCK_SUFFIX_LEN, LOCK_SUFFIX, LOCK_SUFFIX_LEN))
109 return -1; /* Refname ends with ".lock". */
110 return cp - refname;
113 int check_refname_format(const char *refname, int flags)
115 int component_len, component_count = 0;
117 if (!strcmp(refname, "@"))
118 /* Refname is a single character '@'. */
119 return -1;
121 while (1) {
122 /* We are at the start of a path component. */
123 component_len = check_refname_component(refname, flags);
124 if (component_len <= 0) {
125 if ((flags & REFNAME_REFSPEC_PATTERN) &&
126 refname[0] == '*' &&
127 (refname[1] == '\0' || refname[1] == '/')) {
128 /* Accept one wildcard as a full refname component. */
129 flags &= ~REFNAME_REFSPEC_PATTERN;
130 component_len = 1;
131 } else {
132 return -1;
135 component_count++;
136 if (refname[component_len] == '\0')
137 break;
138 /* Skip to next component. */
139 refname += component_len + 1;
142 if (refname[component_len - 1] == '.')
143 return -1; /* Refname ends with '.'. */
144 if (!(flags & REFNAME_ALLOW_ONELEVEL) && component_count < 2)
145 return -1; /* Refname has only one component. */
146 return 0;
149 struct ref_entry;
152 * Information used (along with the information in ref_entry) to
153 * describe a single cached reference. This data structure only
154 * occurs embedded in a union in struct ref_entry, and only when
155 * (ref_entry->flag & REF_DIR) is zero.
157 struct ref_value {
159 * The name of the object to which this reference resolves
160 * (which may be a tag object). If REF_ISBROKEN, this is
161 * null. If REF_ISSYMREF, then this is the name of the object
162 * referred to by the last reference in the symlink chain.
164 unsigned char sha1[20];
167 * If REF_KNOWS_PEELED, then this field holds the peeled value
168 * of this reference, or null if the reference is known not to
169 * be peelable. See the documentation for peel_ref() for an
170 * exact definition of "peelable".
172 unsigned char peeled[20];
175 struct ref_cache;
178 * Information used (along with the information in ref_entry) to
179 * describe a level in the hierarchy of references. This data
180 * structure only occurs embedded in a union in struct ref_entry, and
181 * only when (ref_entry.flag & REF_DIR) is set. In that case,
182 * (ref_entry.flag & REF_INCOMPLETE) determines whether the references
183 * in the directory have already been read:
185 * (ref_entry.flag & REF_INCOMPLETE) unset -- a directory of loose
186 * or packed references, already read.
188 * (ref_entry.flag & REF_INCOMPLETE) set -- a directory of loose
189 * references that hasn't been read yet (nor has any of its
190 * subdirectories).
192 * Entries within a directory are stored within a growable array of
193 * pointers to ref_entries (entries, nr, alloc). Entries 0 <= i <
194 * sorted are sorted by their component name in strcmp() order and the
195 * remaining entries are unsorted.
197 * Loose references are read lazily, one directory at a time. When a
198 * directory of loose references is read, then all of the references
199 * in that directory are stored, and REF_INCOMPLETE stubs are created
200 * for any subdirectories, but the subdirectories themselves are not
201 * read. The reading is triggered by get_ref_dir().
203 struct ref_dir {
204 int nr, alloc;
207 * Entries with index 0 <= i < sorted are sorted by name. New
208 * entries are appended to the list unsorted, and are sorted
209 * only when required; thus we avoid the need to sort the list
210 * after the addition of every reference.
212 int sorted;
214 /* A pointer to the ref_cache that contains this ref_dir. */
215 struct ref_cache *ref_cache;
217 struct ref_entry **entries;
221 * Bit values for ref_entry::flag. REF_ISSYMREF=0x01,
222 * REF_ISPACKED=0x02, REF_ISBROKEN=0x04 and REF_BAD_NAME=0x08 are
223 * public values; see refs.h.
227 * The field ref_entry->u.value.peeled of this value entry contains
228 * the correct peeled value for the reference, which might be
229 * null_sha1 if the reference is not a tag or if it is broken.
231 #define REF_KNOWS_PEELED 0x10
233 /* ref_entry represents a directory of references */
234 #define REF_DIR 0x20
237 * Entry has not yet been read from disk (used only for REF_DIR
238 * entries representing loose references)
240 #define REF_INCOMPLETE 0x40
243 * A ref_entry represents either a reference or a "subdirectory" of
244 * references.
246 * Each directory in the reference namespace is represented by a
247 * ref_entry with (flags & REF_DIR) set and containing a subdir member
248 * that holds the entries in that directory that have been read so
249 * far. If (flags & REF_INCOMPLETE) is set, then the directory and
250 * its subdirectories haven't been read yet. REF_INCOMPLETE is only
251 * used for loose reference directories.
253 * References are represented by a ref_entry with (flags & REF_DIR)
254 * unset and a value member that describes the reference's value. The
255 * flag member is at the ref_entry level, but it is also needed to
256 * interpret the contents of the value field (in other words, a
257 * ref_value object is not very much use without the enclosing
258 * ref_entry).
260 * Reference names cannot end with slash and directories' names are
261 * always stored with a trailing slash (except for the top-level
262 * directory, which is always denoted by ""). This has two nice
263 * consequences: (1) when the entries in each subdir are sorted
264 * lexicographically by name (as they usually are), the references in
265 * a whole tree can be generated in lexicographic order by traversing
266 * the tree in left-to-right, depth-first order; (2) the names of
267 * references and subdirectories cannot conflict, and therefore the
268 * presence of an empty subdirectory does not block the creation of a
269 * similarly-named reference. (The fact that reference names with the
270 * same leading components can conflict *with each other* is a
271 * separate issue that is regulated by verify_refname_available().)
273 * Please note that the name field contains the fully-qualified
274 * reference (or subdirectory) name. Space could be saved by only
275 * storing the relative names. But that would require the full names
276 * to be generated on the fly when iterating in do_for_each_ref(), and
277 * would break callback functions, who have always been able to assume
278 * that the name strings that they are passed will not be freed during
279 * the iteration.
281 struct ref_entry {
282 unsigned char flag; /* ISSYMREF? ISPACKED? */
283 union {
284 struct ref_value value; /* if not (flags&REF_DIR) */
285 struct ref_dir subdir; /* if (flags&REF_DIR) */
286 } u;
288 * The full name of the reference (e.g., "refs/heads/master")
289 * or the full name of the directory with a trailing slash
290 * (e.g., "refs/heads/"):
292 char name[FLEX_ARRAY];
295 static void read_loose_refs(const char *dirname, struct ref_dir *dir);
297 static struct ref_dir *get_ref_dir(struct ref_entry *entry)
299 struct ref_dir *dir;
300 assert(entry->flag & REF_DIR);
301 dir = &entry->u.subdir;
302 if (entry->flag & REF_INCOMPLETE) {
303 read_loose_refs(entry->name, dir);
304 entry->flag &= ~REF_INCOMPLETE;
306 return dir;
310 * Check if a refname is safe.
311 * For refs that start with "refs/" we consider it safe as long they do
312 * not try to resolve to outside of refs/.
314 * For all other refs we only consider them safe iff they only contain
315 * upper case characters and '_' (like "HEAD" AND "MERGE_HEAD", and not like
316 * "config").
318 static int refname_is_safe(const char *refname)
320 if (starts_with(refname, "refs/")) {
321 char *buf;
322 int result;
324 buf = xmalloc(strlen(refname) + 1);
326 * Does the refname try to escape refs/?
327 * For example: refs/foo/../bar is safe but refs/foo/../../bar
328 * is not.
330 result = !normalize_path_copy(buf, refname + strlen("refs/"));
331 free(buf);
332 return result;
334 while (*refname) {
335 if (!isupper(*refname) && *refname != '_')
336 return 0;
337 refname++;
339 return 1;
342 static struct ref_entry *create_ref_entry(const char *refname,
343 const unsigned char *sha1, int flag,
344 int check_name)
346 int len;
347 struct ref_entry *ref;
349 if (check_name &&
350 check_refname_format(refname, REFNAME_ALLOW_ONELEVEL))
351 die("Reference has invalid format: '%s'", refname);
352 len = strlen(refname) + 1;
353 ref = xmalloc(sizeof(struct ref_entry) + len);
354 hashcpy(ref->u.value.sha1, sha1);
355 hashclr(ref->u.value.peeled);
356 memcpy(ref->name, refname, len);
357 ref->flag = flag;
358 return ref;
361 static void clear_ref_dir(struct ref_dir *dir);
363 static void free_ref_entry(struct ref_entry *entry)
365 if (entry->flag & REF_DIR) {
367 * Do not use get_ref_dir() here, as that might
368 * trigger the reading of loose refs.
370 clear_ref_dir(&entry->u.subdir);
372 free(entry);
376 * Add a ref_entry to the end of dir (unsorted). Entry is always
377 * stored directly in dir; no recursion into subdirectories is
378 * done.
380 static void add_entry_to_dir(struct ref_dir *dir, struct ref_entry *entry)
382 ALLOC_GROW(dir->entries, dir->nr + 1, dir->alloc);
383 dir->entries[dir->nr++] = entry;
384 /* optimize for the case that entries are added in order */
385 if (dir->nr == 1 ||
386 (dir->nr == dir->sorted + 1 &&
387 strcmp(dir->entries[dir->nr - 2]->name,
388 dir->entries[dir->nr - 1]->name) < 0))
389 dir->sorted = dir->nr;
393 * Clear and free all entries in dir, recursively.
395 static void clear_ref_dir(struct ref_dir *dir)
397 int i;
398 for (i = 0; i < dir->nr; i++)
399 free_ref_entry(dir->entries[i]);
400 free(dir->entries);
401 dir->sorted = dir->nr = dir->alloc = 0;
402 dir->entries = NULL;
406 * Create a struct ref_entry object for the specified dirname.
407 * dirname is the name of the directory with a trailing slash (e.g.,
408 * "refs/heads/") or "" for the top-level directory.
410 static struct ref_entry *create_dir_entry(struct ref_cache *ref_cache,
411 const char *dirname, size_t len,
412 int incomplete)
414 struct ref_entry *direntry;
415 direntry = xcalloc(1, sizeof(struct ref_entry) + len + 1);
416 memcpy(direntry->name, dirname, len);
417 direntry->name[len] = '\0';
418 direntry->u.subdir.ref_cache = ref_cache;
419 direntry->flag = REF_DIR | (incomplete ? REF_INCOMPLETE : 0);
420 return direntry;
423 static int ref_entry_cmp(const void *a, const void *b)
425 struct ref_entry *one = *(struct ref_entry **)a;
426 struct ref_entry *two = *(struct ref_entry **)b;
427 return strcmp(one->name, two->name);
430 static void sort_ref_dir(struct ref_dir *dir);
432 struct string_slice {
433 size_t len;
434 const char *str;
437 static int ref_entry_cmp_sslice(const void *key_, const void *ent_)
439 const struct string_slice *key = key_;
440 const struct ref_entry *ent = *(const struct ref_entry * const *)ent_;
441 int cmp = strncmp(key->str, ent->name, key->len);
442 if (cmp)
443 return cmp;
444 return '\0' - (unsigned char)ent->name[key->len];
448 * Return the index of the entry with the given refname from the
449 * ref_dir (non-recursively), sorting dir if necessary. Return -1 if
450 * no such entry is found. dir must already be complete.
452 static int search_ref_dir(struct ref_dir *dir, const char *refname, size_t len)
454 struct ref_entry **r;
455 struct string_slice key;
457 if (refname == NULL || !dir->nr)
458 return -1;
460 sort_ref_dir(dir);
461 key.len = len;
462 key.str = refname;
463 r = bsearch(&key, dir->entries, dir->nr, sizeof(*dir->entries),
464 ref_entry_cmp_sslice);
466 if (r == NULL)
467 return -1;
469 return r - dir->entries;
473 * Search for a directory entry directly within dir (without
474 * recursing). Sort dir if necessary. subdirname must be a directory
475 * name (i.e., end in '/'). If mkdir is set, then create the
476 * directory if it is missing; otherwise, return NULL if the desired
477 * directory cannot be found. dir must already be complete.
479 static struct ref_dir *search_for_subdir(struct ref_dir *dir,
480 const char *subdirname, size_t len,
481 int mkdir)
483 int entry_index = search_ref_dir(dir, subdirname, len);
484 struct ref_entry *entry;
485 if (entry_index == -1) {
486 if (!mkdir)
487 return NULL;
489 * Since dir is complete, the absence of a subdir
490 * means that the subdir really doesn't exist;
491 * therefore, create an empty record for it but mark
492 * the record complete.
494 entry = create_dir_entry(dir->ref_cache, subdirname, len, 0);
495 add_entry_to_dir(dir, entry);
496 } else {
497 entry = dir->entries[entry_index];
499 return get_ref_dir(entry);
503 * If refname is a reference name, find the ref_dir within the dir
504 * tree that should hold refname. If refname is a directory name
505 * (i.e., ends in '/'), then return that ref_dir itself. dir must
506 * represent the top-level directory and must already be complete.
507 * Sort ref_dirs and recurse into subdirectories as necessary. If
508 * mkdir is set, then create any missing directories; otherwise,
509 * return NULL if the desired directory cannot be found.
511 static struct ref_dir *find_containing_dir(struct ref_dir *dir,
512 const char *refname, int mkdir)
514 const char *slash;
515 for (slash = strchr(refname, '/'); slash; slash = strchr(slash + 1, '/')) {
516 size_t dirnamelen = slash - refname + 1;
517 struct ref_dir *subdir;
518 subdir = search_for_subdir(dir, refname, dirnamelen, mkdir);
519 if (!subdir) {
520 dir = NULL;
521 break;
523 dir = subdir;
526 return dir;
530 * Find the value entry with the given name in dir, sorting ref_dirs
531 * and recursing into subdirectories as necessary. If the name is not
532 * found or it corresponds to a directory entry, return NULL.
534 static struct ref_entry *find_ref(struct ref_dir *dir, const char *refname)
536 int entry_index;
537 struct ref_entry *entry;
538 dir = find_containing_dir(dir, refname, 0);
539 if (!dir)
540 return NULL;
541 entry_index = search_ref_dir(dir, refname, strlen(refname));
542 if (entry_index == -1)
543 return NULL;
544 entry = dir->entries[entry_index];
545 return (entry->flag & REF_DIR) ? NULL : entry;
549 * Remove the entry with the given name from dir, recursing into
550 * subdirectories as necessary. If refname is the name of a directory
551 * (i.e., ends with '/'), then remove the directory and its contents.
552 * If the removal was successful, return the number of entries
553 * remaining in the directory entry that contained the deleted entry.
554 * If the name was not found, return -1. Please note that this
555 * function only deletes the entry from the cache; it does not delete
556 * it from the filesystem or ensure that other cache entries (which
557 * might be symbolic references to the removed entry) are updated.
558 * Nor does it remove any containing dir entries that might be made
559 * empty by the removal. dir must represent the top-level directory
560 * and must already be complete.
562 static int remove_entry(struct ref_dir *dir, const char *refname)
564 int refname_len = strlen(refname);
565 int entry_index;
566 struct ref_entry *entry;
567 int is_dir = refname[refname_len - 1] == '/';
568 if (is_dir) {
570 * refname represents a reference directory. Remove
571 * the trailing slash; otherwise we will get the
572 * directory *representing* refname rather than the
573 * one *containing* it.
575 char *dirname = xmemdupz(refname, refname_len - 1);
576 dir = find_containing_dir(dir, dirname, 0);
577 free(dirname);
578 } else {
579 dir = find_containing_dir(dir, refname, 0);
581 if (!dir)
582 return -1;
583 entry_index = search_ref_dir(dir, refname, refname_len);
584 if (entry_index == -1)
585 return -1;
586 entry = dir->entries[entry_index];
588 memmove(&dir->entries[entry_index],
589 &dir->entries[entry_index + 1],
590 (dir->nr - entry_index - 1) * sizeof(*dir->entries)
592 dir->nr--;
593 if (dir->sorted > entry_index)
594 dir->sorted--;
595 free_ref_entry(entry);
596 return dir->nr;
600 * Add a ref_entry to the ref_dir (unsorted), recursing into
601 * subdirectories as necessary. dir must represent the top-level
602 * directory. Return 0 on success.
604 static int add_ref(struct ref_dir *dir, struct ref_entry *ref)
606 dir = find_containing_dir(dir, ref->name, 1);
607 if (!dir)
608 return -1;
609 add_entry_to_dir(dir, ref);
610 return 0;
614 * Emit a warning and return true iff ref1 and ref2 have the same name
615 * and the same sha1. Die if they have the same name but different
616 * sha1s.
618 static int is_dup_ref(const struct ref_entry *ref1, const struct ref_entry *ref2)
620 if (strcmp(ref1->name, ref2->name))
621 return 0;
623 /* Duplicate name; make sure that they don't conflict: */
625 if ((ref1->flag & REF_DIR) || (ref2->flag & REF_DIR))
626 /* This is impossible by construction */
627 die("Reference directory conflict: %s", ref1->name);
629 if (hashcmp(ref1->u.value.sha1, ref2->u.value.sha1))
630 die("Duplicated ref, and SHA1s don't match: %s", ref1->name);
632 warning("Duplicated ref: %s", ref1->name);
633 return 1;
637 * Sort the entries in dir non-recursively (if they are not already
638 * sorted) and remove any duplicate entries.
640 static void sort_ref_dir(struct ref_dir *dir)
642 int i, j;
643 struct ref_entry *last = NULL;
646 * This check also prevents passing a zero-length array to qsort(),
647 * which is a problem on some platforms.
649 if (dir->sorted == dir->nr)
650 return;
652 qsort(dir->entries, dir->nr, sizeof(*dir->entries), ref_entry_cmp);
654 /* Remove any duplicates: */
655 for (i = 0, j = 0; j < dir->nr; j++) {
656 struct ref_entry *entry = dir->entries[j];
657 if (last && is_dup_ref(last, entry))
658 free_ref_entry(entry);
659 else
660 last = dir->entries[i++] = entry;
662 dir->sorted = dir->nr = i;
665 /* Include broken references in a do_for_each_ref*() iteration: */
666 #define DO_FOR_EACH_INCLUDE_BROKEN 0x01
669 * Return true iff the reference described by entry can be resolved to
670 * an object in the database. Emit a warning if the referred-to
671 * object does not exist.
673 static int ref_resolves_to_object(struct ref_entry *entry)
675 if (entry->flag & REF_ISBROKEN)
676 return 0;
677 if (!has_sha1_file(entry->u.value.sha1)) {
678 error("%s does not point to a valid object!", entry->name);
679 return 0;
681 return 1;
685 * current_ref is a performance hack: when iterating over references
686 * using the for_each_ref*() functions, current_ref is set to the
687 * current reference's entry before calling the callback function. If
688 * the callback function calls peel_ref(), then peel_ref() first
689 * checks whether the reference to be peeled is the current reference
690 * (it usually is) and if so, returns that reference's peeled version
691 * if it is available. This avoids a refname lookup in a common case.
693 static struct ref_entry *current_ref;
695 typedef int each_ref_entry_fn(struct ref_entry *entry, void *cb_data);
697 struct ref_entry_cb {
698 const char *base;
699 int trim;
700 int flags;
701 each_ref_fn *fn;
702 void *cb_data;
706 * Handle one reference in a do_for_each_ref*()-style iteration,
707 * calling an each_ref_fn for each entry.
709 static int do_one_ref(struct ref_entry *entry, void *cb_data)
711 struct ref_entry_cb *data = cb_data;
712 struct ref_entry *old_current_ref;
713 int retval;
715 if (!starts_with(entry->name, data->base))
716 return 0;
718 if (!(data->flags & DO_FOR_EACH_INCLUDE_BROKEN) &&
719 !ref_resolves_to_object(entry))
720 return 0;
722 /* Store the old value, in case this is a recursive call: */
723 old_current_ref = current_ref;
724 current_ref = entry;
725 retval = data->fn(entry->name + data->trim, entry->u.value.sha1,
726 entry->flag, data->cb_data);
727 current_ref = old_current_ref;
728 return retval;
732 * Call fn for each reference in dir that has index in the range
733 * offset <= index < dir->nr. Recurse into subdirectories that are in
734 * that index range, sorting them before iterating. This function
735 * does not sort dir itself; it should be sorted beforehand. fn is
736 * called for all references, including broken ones.
738 static int do_for_each_entry_in_dir(struct ref_dir *dir, int offset,
739 each_ref_entry_fn fn, void *cb_data)
741 int i;
742 assert(dir->sorted == dir->nr);
743 for (i = offset; i < dir->nr; i++) {
744 struct ref_entry *entry = dir->entries[i];
745 int retval;
746 if (entry->flag & REF_DIR) {
747 struct ref_dir *subdir = get_ref_dir(entry);
748 sort_ref_dir(subdir);
749 retval = do_for_each_entry_in_dir(subdir, 0, fn, cb_data);
750 } else {
751 retval = fn(entry, cb_data);
753 if (retval)
754 return retval;
756 return 0;
760 * Call fn for each reference in the union of dir1 and dir2, in order
761 * by refname. Recurse into subdirectories. If a value entry appears
762 * in both dir1 and dir2, then only process the version that is in
763 * dir2. The input dirs must already be sorted, but subdirs will be
764 * sorted as needed. fn is called for all references, including
765 * broken ones.
767 static int do_for_each_entry_in_dirs(struct ref_dir *dir1,
768 struct ref_dir *dir2,
769 each_ref_entry_fn fn, void *cb_data)
771 int retval;
772 int i1 = 0, i2 = 0;
774 assert(dir1->sorted == dir1->nr);
775 assert(dir2->sorted == dir2->nr);
776 while (1) {
777 struct ref_entry *e1, *e2;
778 int cmp;
779 if (i1 == dir1->nr) {
780 return do_for_each_entry_in_dir(dir2, i2, fn, cb_data);
782 if (i2 == dir2->nr) {
783 return do_for_each_entry_in_dir(dir1, i1, fn, cb_data);
785 e1 = dir1->entries[i1];
786 e2 = dir2->entries[i2];
787 cmp = strcmp(e1->name, e2->name);
788 if (cmp == 0) {
789 if ((e1->flag & REF_DIR) && (e2->flag & REF_DIR)) {
790 /* Both are directories; descend them in parallel. */
791 struct ref_dir *subdir1 = get_ref_dir(e1);
792 struct ref_dir *subdir2 = get_ref_dir(e2);
793 sort_ref_dir(subdir1);
794 sort_ref_dir(subdir2);
795 retval = do_for_each_entry_in_dirs(
796 subdir1, subdir2, fn, cb_data);
797 i1++;
798 i2++;
799 } else if (!(e1->flag & REF_DIR) && !(e2->flag & REF_DIR)) {
800 /* Both are references; ignore the one from dir1. */
801 retval = fn(e2, cb_data);
802 i1++;
803 i2++;
804 } else {
805 die("conflict between reference and directory: %s",
806 e1->name);
808 } else {
809 struct ref_entry *e;
810 if (cmp < 0) {
811 e = e1;
812 i1++;
813 } else {
814 e = e2;
815 i2++;
817 if (e->flag & REF_DIR) {
818 struct ref_dir *subdir = get_ref_dir(e);
819 sort_ref_dir(subdir);
820 retval = do_for_each_entry_in_dir(
821 subdir, 0, fn, cb_data);
822 } else {
823 retval = fn(e, cb_data);
826 if (retval)
827 return retval;
832 * Load all of the refs from the dir into our in-memory cache. The hard work
833 * of loading loose refs is done by get_ref_dir(), so we just need to recurse
834 * through all of the sub-directories. We do not even need to care about
835 * sorting, as traversal order does not matter to us.
837 static void prime_ref_dir(struct ref_dir *dir)
839 int i;
840 for (i = 0; i < dir->nr; i++) {
841 struct ref_entry *entry = dir->entries[i];
842 if (entry->flag & REF_DIR)
843 prime_ref_dir(get_ref_dir(entry));
847 struct nonmatching_ref_data {
848 const struct string_list *skip;
849 const char *conflicting_refname;
852 static int nonmatching_ref_fn(struct ref_entry *entry, void *vdata)
854 struct nonmatching_ref_data *data = vdata;
856 if (data->skip && string_list_has_string(data->skip, entry->name))
857 return 0;
859 data->conflicting_refname = entry->name;
860 return 1;
864 * Return 0 if a reference named refname could be created without
865 * conflicting with the name of an existing reference in dir.
866 * Otherwise, return a negative value and write an explanation to err.
867 * If extras is non-NULL, it is a list of additional refnames with
868 * which refname is not allowed to conflict. If skip is non-NULL,
869 * ignore potential conflicts with refs in skip (e.g., because they
870 * are scheduled for deletion in the same operation). Behavior is
871 * undefined if the same name is listed in both extras and skip.
873 * Two reference names conflict if one of them exactly matches the
874 * leading components of the other; e.g., "refs/foo/bar" conflicts
875 * with both "refs/foo" and with "refs/foo/bar/baz" but not with
876 * "refs/foo/bar" or "refs/foo/barbados".
878 * extras and skip must be sorted.
880 static int verify_refname_available(const char *refname,
881 const struct string_list *extras,
882 const struct string_list *skip,
883 struct ref_dir *dir,
884 struct strbuf *err)
886 const char *slash;
887 int pos;
888 struct strbuf dirname = STRBUF_INIT;
889 int ret = -1;
892 * For the sake of comments in this function, suppose that
893 * refname is "refs/foo/bar".
896 assert(err);
898 strbuf_grow(&dirname, strlen(refname) + 1);
899 for (slash = strchr(refname, '/'); slash; slash = strchr(slash + 1, '/')) {
900 /* Expand dirname to the new prefix, not including the trailing slash: */
901 strbuf_add(&dirname, refname + dirname.len, slash - refname - dirname.len);
904 * We are still at a leading dir of the refname (e.g.,
905 * "refs/foo"; if there is a reference with that name,
906 * it is a conflict, *unless* it is in skip.
908 if (dir) {
909 pos = search_ref_dir(dir, dirname.buf, dirname.len);
910 if (pos >= 0 &&
911 (!skip || !string_list_has_string(skip, dirname.buf))) {
913 * We found a reference whose name is
914 * a proper prefix of refname; e.g.,
915 * "refs/foo", and is not in skip.
917 strbuf_addf(err, "'%s' exists; cannot create '%s'",
918 dirname.buf, refname);
919 goto cleanup;
923 if (extras && string_list_has_string(extras, dirname.buf) &&
924 (!skip || !string_list_has_string(skip, dirname.buf))) {
925 strbuf_addf(err, "cannot process '%s' and '%s' at the same time",
926 refname, dirname.buf);
927 goto cleanup;
931 * Otherwise, we can try to continue our search with
932 * the next component. So try to look up the
933 * directory, e.g., "refs/foo/". If we come up empty,
934 * we know there is nothing under this whole prefix,
935 * but even in that case we still have to continue the
936 * search for conflicts with extras.
938 strbuf_addch(&dirname, '/');
939 if (dir) {
940 pos = search_ref_dir(dir, dirname.buf, dirname.len);
941 if (pos < 0) {
943 * There was no directory "refs/foo/",
944 * so there is nothing under this
945 * whole prefix. So there is no need
946 * to continue looking for conflicting
947 * references. But we need to continue
948 * looking for conflicting extras.
950 dir = NULL;
951 } else {
952 dir = get_ref_dir(dir->entries[pos]);
958 * We are at the leaf of our refname (e.g., "refs/foo/bar").
959 * There is no point in searching for a reference with that
960 * name, because a refname isn't considered to conflict with
961 * itself. But we still need to check for references whose
962 * names are in the "refs/foo/bar/" namespace, because they
963 * *do* conflict.
965 strbuf_addstr(&dirname, refname + dirname.len);
966 strbuf_addch(&dirname, '/');
968 if (dir) {
969 pos = search_ref_dir(dir, dirname.buf, dirname.len);
971 if (pos >= 0) {
973 * We found a directory named "$refname/"
974 * (e.g., "refs/foo/bar/"). It is a problem
975 * iff it contains any ref that is not in
976 * "skip".
978 struct nonmatching_ref_data data;
980 data.skip = skip;
981 data.conflicting_refname = NULL;
982 dir = get_ref_dir(dir->entries[pos]);
983 sort_ref_dir(dir);
984 if (do_for_each_entry_in_dir(dir, 0, nonmatching_ref_fn, &data)) {
985 strbuf_addf(err, "'%s' exists; cannot create '%s'",
986 data.conflicting_refname, refname);
987 goto cleanup;
992 if (extras) {
994 * Check for entries in extras that start with
995 * "$refname/". We do that by looking for the place
996 * where "$refname/" would be inserted in extras. If
997 * there is an entry at that position that starts with
998 * "$refname/" and is not in skip, then we have a
999 * conflict.
1001 for (pos = string_list_find_insert_index(extras, dirname.buf, 0);
1002 pos < extras->nr; pos++) {
1003 const char *extra_refname = extras->items[pos].string;
1005 if (!starts_with(extra_refname, dirname.buf))
1006 break;
1008 if (!skip || !string_list_has_string(skip, extra_refname)) {
1009 strbuf_addf(err, "cannot process '%s' and '%s' at the same time",
1010 refname, extra_refname);
1011 goto cleanup;
1016 /* No conflicts were found */
1017 ret = 0;
1019 cleanup:
1020 strbuf_release(&dirname);
1021 return ret;
1024 struct packed_ref_cache {
1025 struct ref_entry *root;
1028 * Count of references to the data structure in this instance,
1029 * including the pointer from ref_cache::packed if any. The
1030 * data will not be freed as long as the reference count is
1031 * nonzero.
1033 unsigned int referrers;
1036 * Iff the packed-refs file associated with this instance is
1037 * currently locked for writing, this points at the associated
1038 * lock (which is owned by somebody else). The referrer count
1039 * is also incremented when the file is locked and decremented
1040 * when it is unlocked.
1042 struct lock_file *lock;
1044 /* The metadata from when this packed-refs cache was read */
1045 struct stat_validity validity;
1049 * Future: need to be in "struct repository"
1050 * when doing a full libification.
1052 static struct ref_cache {
1053 struct ref_cache *next;
1054 struct ref_entry *loose;
1055 struct packed_ref_cache *packed;
1057 * The submodule name, or "" for the main repo. We allocate
1058 * length 1 rather than FLEX_ARRAY so that the main ref_cache
1059 * is initialized correctly.
1061 char name[1];
1062 } ref_cache, *submodule_ref_caches;
1064 /* Lock used for the main packed-refs file: */
1065 static struct lock_file packlock;
1068 * Increment the reference count of *packed_refs.
1070 static void acquire_packed_ref_cache(struct packed_ref_cache *packed_refs)
1072 packed_refs->referrers++;
1076 * Decrease the reference count of *packed_refs. If it goes to zero,
1077 * free *packed_refs and return true; otherwise return false.
1079 static int release_packed_ref_cache(struct packed_ref_cache *packed_refs)
1081 if (!--packed_refs->referrers) {
1082 free_ref_entry(packed_refs->root);
1083 stat_validity_clear(&packed_refs->validity);
1084 free(packed_refs);
1085 return 1;
1086 } else {
1087 return 0;
1091 static void clear_packed_ref_cache(struct ref_cache *refs)
1093 if (refs->packed) {
1094 struct packed_ref_cache *packed_refs = refs->packed;
1096 if (packed_refs->lock)
1097 die("internal error: packed-ref cache cleared while locked");
1098 refs->packed = NULL;
1099 release_packed_ref_cache(packed_refs);
1103 static void clear_loose_ref_cache(struct ref_cache *refs)
1105 if (refs->loose) {
1106 free_ref_entry(refs->loose);
1107 refs->loose = NULL;
1111 static struct ref_cache *create_ref_cache(const char *submodule)
1113 int len;
1114 struct ref_cache *refs;
1115 if (!submodule)
1116 submodule = "";
1117 len = strlen(submodule) + 1;
1118 refs = xcalloc(1, sizeof(struct ref_cache) + len);
1119 memcpy(refs->name, submodule, len);
1120 return refs;
1124 * Return a pointer to a ref_cache for the specified submodule. For
1125 * the main repository, use submodule==NULL. The returned structure
1126 * will be allocated and initialized but not necessarily populated; it
1127 * should not be freed.
1129 static struct ref_cache *get_ref_cache(const char *submodule)
1131 struct ref_cache *refs;
1133 if (!submodule || !*submodule)
1134 return &ref_cache;
1136 for (refs = submodule_ref_caches; refs; refs = refs->next)
1137 if (!strcmp(submodule, refs->name))
1138 return refs;
1140 refs = create_ref_cache(submodule);
1141 refs->next = submodule_ref_caches;
1142 submodule_ref_caches = refs;
1143 return refs;
1146 /* The length of a peeled reference line in packed-refs, including EOL: */
1147 #define PEELED_LINE_LENGTH 42
1150 * The packed-refs header line that we write out. Perhaps other
1151 * traits will be added later. The trailing space is required.
1153 static const char PACKED_REFS_HEADER[] =
1154 "# pack-refs with: peeled fully-peeled \n";
1157 * Parse one line from a packed-refs file. Write the SHA1 to sha1.
1158 * Return a pointer to the refname within the line (null-terminated),
1159 * or NULL if there was a problem.
1161 static const char *parse_ref_line(struct strbuf *line, unsigned char *sha1)
1163 const char *ref;
1166 * 42: the answer to everything.
1168 * In this case, it happens to be the answer to
1169 * 40 (length of sha1 hex representation)
1170 * +1 (space in between hex and name)
1171 * +1 (newline at the end of the line)
1173 if (line->len <= 42)
1174 return NULL;
1176 if (get_sha1_hex(line->buf, sha1) < 0)
1177 return NULL;
1178 if (!isspace(line->buf[40]))
1179 return NULL;
1181 ref = line->buf + 41;
1182 if (isspace(*ref))
1183 return NULL;
1185 if (line->buf[line->len - 1] != '\n')
1186 return NULL;
1187 line->buf[--line->len] = 0;
1189 return ref;
1193 * Read f, which is a packed-refs file, into dir.
1195 * A comment line of the form "# pack-refs with: " may contain zero or
1196 * more traits. We interpret the traits as follows:
1198 * No traits:
1200 * Probably no references are peeled. But if the file contains a
1201 * peeled value for a reference, we will use it.
1203 * peeled:
1205 * References under "refs/tags/", if they *can* be peeled, *are*
1206 * peeled in this file. References outside of "refs/tags/" are
1207 * probably not peeled even if they could have been, but if we find
1208 * a peeled value for such a reference we will use it.
1210 * fully-peeled:
1212 * All references in the file that can be peeled are peeled.
1213 * Inversely (and this is more important), any references in the
1214 * file for which no peeled value is recorded is not peelable. This
1215 * trait should typically be written alongside "peeled" for
1216 * compatibility with older clients, but we do not require it
1217 * (i.e., "peeled" is a no-op if "fully-peeled" is set).
1219 static void read_packed_refs(FILE *f, struct ref_dir *dir)
1221 struct ref_entry *last = NULL;
1222 struct strbuf line = STRBUF_INIT;
1223 enum { PEELED_NONE, PEELED_TAGS, PEELED_FULLY } peeled = PEELED_NONE;
1225 while (strbuf_getwholeline(&line, f, '\n') != EOF) {
1226 unsigned char sha1[20];
1227 const char *refname;
1228 const char *traits;
1230 if (skip_prefix(line.buf, "# pack-refs with:", &traits)) {
1231 if (strstr(traits, " fully-peeled "))
1232 peeled = PEELED_FULLY;
1233 else if (strstr(traits, " peeled "))
1234 peeled = PEELED_TAGS;
1235 /* perhaps other traits later as well */
1236 continue;
1239 refname = parse_ref_line(&line, sha1);
1240 if (refname) {
1241 int flag = REF_ISPACKED;
1243 if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {
1244 if (!refname_is_safe(refname))
1245 die("packed refname is dangerous: %s", refname);
1246 hashclr(sha1);
1247 flag |= REF_BAD_NAME | REF_ISBROKEN;
1249 last = create_ref_entry(refname, sha1, flag, 0);
1250 if (peeled == PEELED_FULLY ||
1251 (peeled == PEELED_TAGS && starts_with(refname, "refs/tags/")))
1252 last->flag |= REF_KNOWS_PEELED;
1253 add_ref(dir, last);
1254 continue;
1256 if (last &&
1257 line.buf[0] == '^' &&
1258 line.len == PEELED_LINE_LENGTH &&
1259 line.buf[PEELED_LINE_LENGTH - 1] == '\n' &&
1260 !get_sha1_hex(line.buf + 1, sha1)) {
1261 hashcpy(last->u.value.peeled, sha1);
1263 * Regardless of what the file header said,
1264 * we definitely know the value of *this*
1265 * reference:
1267 last->flag |= REF_KNOWS_PEELED;
1271 strbuf_release(&line);
1275 * Get the packed_ref_cache for the specified ref_cache, creating it
1276 * if necessary.
1278 static struct packed_ref_cache *get_packed_ref_cache(struct ref_cache *refs)
1280 const char *packed_refs_file;
1282 if (*refs->name)
1283 packed_refs_file = git_path_submodule(refs->name, "packed-refs");
1284 else
1285 packed_refs_file = git_path("packed-refs");
1287 if (refs->packed &&
1288 !stat_validity_check(&refs->packed->validity, packed_refs_file))
1289 clear_packed_ref_cache(refs);
1291 if (!refs->packed) {
1292 FILE *f;
1294 refs->packed = xcalloc(1, sizeof(*refs->packed));
1295 acquire_packed_ref_cache(refs->packed);
1296 refs->packed->root = create_dir_entry(refs, "", 0, 0);
1297 f = fopen(packed_refs_file, "r");
1298 if (f) {
1299 stat_validity_update(&refs->packed->validity, fileno(f));
1300 read_packed_refs(f, get_ref_dir(refs->packed->root));
1301 fclose(f);
1304 return refs->packed;
1307 static struct ref_dir *get_packed_ref_dir(struct packed_ref_cache *packed_ref_cache)
1309 return get_ref_dir(packed_ref_cache->root);
1312 static struct ref_dir *get_packed_refs(struct ref_cache *refs)
1314 return get_packed_ref_dir(get_packed_ref_cache(refs));
1317 void add_packed_ref(const char *refname, const unsigned char *sha1)
1319 struct packed_ref_cache *packed_ref_cache =
1320 get_packed_ref_cache(&ref_cache);
1322 if (!packed_ref_cache->lock)
1323 die("internal error: packed refs not locked");
1324 add_ref(get_packed_ref_dir(packed_ref_cache),
1325 create_ref_entry(refname, sha1, REF_ISPACKED, 1));
1329 * Read the loose references from the namespace dirname into dir
1330 * (without recursing). dirname must end with '/'. dir must be the
1331 * directory entry corresponding to dirname.
1333 static void read_loose_refs(const char *dirname, struct ref_dir *dir)
1335 struct ref_cache *refs = dir->ref_cache;
1336 DIR *d;
1337 const char *path;
1338 struct dirent *de;
1339 int dirnamelen = strlen(dirname);
1340 struct strbuf refname;
1342 if (*refs->name)
1343 path = git_path_submodule(refs->name, "%s", dirname);
1344 else
1345 path = git_path("%s", dirname);
1347 d = opendir(path);
1348 if (!d)
1349 return;
1351 strbuf_init(&refname, dirnamelen + 257);
1352 strbuf_add(&refname, dirname, dirnamelen);
1354 while ((de = readdir(d)) != NULL) {
1355 unsigned char sha1[20];
1356 struct stat st;
1357 int flag;
1358 const char *refdir;
1360 if (de->d_name[0] == '.')
1361 continue;
1362 if (ends_with(de->d_name, ".lock"))
1363 continue;
1364 strbuf_addstr(&refname, de->d_name);
1365 refdir = *refs->name
1366 ? git_path_submodule(refs->name, "%s", refname.buf)
1367 : git_path("%s", refname.buf);
1368 if (stat(refdir, &st) < 0) {
1369 ; /* silently ignore */
1370 } else if (S_ISDIR(st.st_mode)) {
1371 strbuf_addch(&refname, '/');
1372 add_entry_to_dir(dir,
1373 create_dir_entry(refs, refname.buf,
1374 refname.len, 1));
1375 } else {
1376 if (*refs->name) {
1377 hashclr(sha1);
1378 flag = 0;
1379 if (resolve_gitlink_ref(refs->name, refname.buf, sha1) < 0) {
1380 hashclr(sha1);
1381 flag |= REF_ISBROKEN;
1383 } else if (read_ref_full(refname.buf,
1384 RESOLVE_REF_READING,
1385 sha1, &flag)) {
1386 hashclr(sha1);
1387 flag |= REF_ISBROKEN;
1389 if (check_refname_format(refname.buf,
1390 REFNAME_ALLOW_ONELEVEL)) {
1391 if (!refname_is_safe(refname.buf))
1392 die("loose refname is dangerous: %s", refname.buf);
1393 hashclr(sha1);
1394 flag |= REF_BAD_NAME | REF_ISBROKEN;
1396 add_entry_to_dir(dir,
1397 create_ref_entry(refname.buf, sha1, flag, 0));
1399 strbuf_setlen(&refname, dirnamelen);
1401 strbuf_release(&refname);
1402 closedir(d);
1405 static struct ref_dir *get_loose_refs(struct ref_cache *refs)
1407 if (!refs->loose) {
1409 * Mark the top-level directory complete because we
1410 * are about to read the only subdirectory that can
1411 * hold references:
1413 refs->loose = create_dir_entry(refs, "", 0, 0);
1415 * Create an incomplete entry for "refs/":
1417 add_entry_to_dir(get_ref_dir(refs->loose),
1418 create_dir_entry(refs, "refs/", 5, 1));
1420 return get_ref_dir(refs->loose);
1423 /* We allow "recursive" symbolic refs. Only within reason, though */
1424 #define MAXDEPTH 5
1425 #define MAXREFLEN (1024)
1428 * Called by resolve_gitlink_ref_recursive() after it failed to read
1429 * from the loose refs in ref_cache refs. Find <refname> in the
1430 * packed-refs file for the submodule.
1432 static int resolve_gitlink_packed_ref(struct ref_cache *refs,
1433 const char *refname, unsigned char *sha1)
1435 struct ref_entry *ref;
1436 struct ref_dir *dir = get_packed_refs(refs);
1438 ref = find_ref(dir, refname);
1439 if (ref == NULL)
1440 return -1;
1442 hashcpy(sha1, ref->u.value.sha1);
1443 return 0;
1446 static int resolve_gitlink_ref_recursive(struct ref_cache *refs,
1447 const char *refname, unsigned char *sha1,
1448 int recursion)
1450 int fd, len;
1451 char buffer[128], *p;
1452 const char *path;
1454 if (recursion > MAXDEPTH || strlen(refname) > MAXREFLEN)
1455 return -1;
1456 path = *refs->name
1457 ? git_path_submodule(refs->name, "%s", refname)
1458 : git_path("%s", refname);
1459 fd = open(path, O_RDONLY);
1460 if (fd < 0)
1461 return resolve_gitlink_packed_ref(refs, refname, sha1);
1463 len = read(fd, buffer, sizeof(buffer)-1);
1464 close(fd);
1465 if (len < 0)
1466 return -1;
1467 while (len && isspace(buffer[len-1]))
1468 len--;
1469 buffer[len] = 0;
1471 /* Was it a detached head or an old-fashioned symlink? */
1472 if (!get_sha1_hex(buffer, sha1))
1473 return 0;
1475 /* Symref? */
1476 if (strncmp(buffer, "ref:", 4))
1477 return -1;
1478 p = buffer + 4;
1479 while (isspace(*p))
1480 p++;
1482 return resolve_gitlink_ref_recursive(refs, p, sha1, recursion+1);
1485 int resolve_gitlink_ref(const char *path, const char *refname, unsigned char *sha1)
1487 int len = strlen(path), retval;
1488 char *submodule;
1489 struct ref_cache *refs;
1491 while (len && path[len-1] == '/')
1492 len--;
1493 if (!len)
1494 return -1;
1495 submodule = xstrndup(path, len);
1496 refs = get_ref_cache(submodule);
1497 free(submodule);
1499 retval = resolve_gitlink_ref_recursive(refs, refname, sha1, 0);
1500 return retval;
1504 * Return the ref_entry for the given refname from the packed
1505 * references. If it does not exist, return NULL.
1507 static struct ref_entry *get_packed_ref(const char *refname)
1509 return find_ref(get_packed_refs(&ref_cache), refname);
1513 * A loose ref file doesn't exist; check for a packed ref. The
1514 * options are forwarded from resolve_safe_unsafe().
1516 static int resolve_missing_loose_ref(const char *refname,
1517 int resolve_flags,
1518 unsigned char *sha1,
1519 int *flags)
1521 struct ref_entry *entry;
1524 * The loose reference file does not exist; check for a packed
1525 * reference.
1527 entry = get_packed_ref(refname);
1528 if (entry) {
1529 hashcpy(sha1, entry->u.value.sha1);
1530 if (flags)
1531 *flags |= REF_ISPACKED;
1532 return 0;
1534 /* The reference is not a packed reference, either. */
1535 if (resolve_flags & RESOLVE_REF_READING) {
1536 errno = ENOENT;
1537 return -1;
1538 } else {
1539 hashclr(sha1);
1540 return 0;
1544 /* This function needs to return a meaningful errno on failure */
1545 static const char *resolve_ref_unsafe_1(const char *refname,
1546 int resolve_flags,
1547 unsigned char *sha1,
1548 int *flags,
1549 struct strbuf *sb_path)
1551 int depth = MAXDEPTH;
1552 ssize_t len;
1553 char buffer[256];
1554 static char refname_buffer[256];
1555 int bad_name = 0;
1557 if (flags)
1558 *flags = 0;
1560 if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {
1561 if (flags)
1562 *flags |= REF_BAD_NAME;
1564 if (!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||
1565 !refname_is_safe(refname)) {
1566 errno = EINVAL;
1567 return NULL;
1570 * dwim_ref() uses REF_ISBROKEN to distinguish between
1571 * missing refs and refs that were present but invalid,
1572 * to complain about the latter to stderr.
1574 * We don't know whether the ref exists, so don't set
1575 * REF_ISBROKEN yet.
1577 bad_name = 1;
1579 for (;;) {
1580 const char *path;
1581 struct stat st;
1582 char *buf;
1583 int fd;
1585 if (--depth < 0) {
1586 errno = ELOOP;
1587 return NULL;
1590 strbuf_reset(sb_path);
1591 strbuf_git_path(sb_path, "%s", refname);
1592 path = sb_path->buf;
1595 * We might have to loop back here to avoid a race
1596 * condition: first we lstat() the file, then we try
1597 * to read it as a link or as a file. But if somebody
1598 * changes the type of the file (file <-> directory
1599 * <-> symlink) between the lstat() and reading, then
1600 * we don't want to report that as an error but rather
1601 * try again starting with the lstat().
1603 stat_ref:
1604 if (lstat(path, &st) < 0) {
1605 if (errno != ENOENT)
1606 return NULL;
1607 if (resolve_missing_loose_ref(refname, resolve_flags,
1608 sha1, flags))
1609 return NULL;
1610 if (bad_name) {
1611 hashclr(sha1);
1612 if (flags)
1613 *flags |= REF_ISBROKEN;
1615 return refname;
1618 /* Follow "normalized" - ie "refs/.." symlinks by hand */
1619 if (S_ISLNK(st.st_mode)) {
1620 len = readlink(path, buffer, sizeof(buffer)-1);
1621 if (len < 0) {
1622 if (errno == ENOENT || errno == EINVAL)
1623 /* inconsistent with lstat; retry */
1624 goto stat_ref;
1625 else
1626 return NULL;
1628 buffer[len] = 0;
1629 if (starts_with(buffer, "refs/") &&
1630 !check_refname_format(buffer, 0)) {
1631 strcpy(refname_buffer, buffer);
1632 refname = refname_buffer;
1633 if (flags)
1634 *flags |= REF_ISSYMREF;
1635 if (resolve_flags & RESOLVE_REF_NO_RECURSE) {
1636 hashclr(sha1);
1637 return refname;
1639 continue;
1643 /* Is it a directory? */
1644 if (S_ISDIR(st.st_mode)) {
1645 errno = EISDIR;
1646 return NULL;
1650 * Anything else, just open it and try to use it as
1651 * a ref
1653 fd = open(path, O_RDONLY);
1654 if (fd < 0) {
1655 if (errno == ENOENT)
1656 /* inconsistent with lstat; retry */
1657 goto stat_ref;
1658 else
1659 return NULL;
1661 len = read_in_full(fd, buffer, sizeof(buffer)-1);
1662 if (len < 0) {
1663 int save_errno = errno;
1664 close(fd);
1665 errno = save_errno;
1666 return NULL;
1668 close(fd);
1669 while (len && isspace(buffer[len-1]))
1670 len--;
1671 buffer[len] = '\0';
1674 * Is it a symbolic ref?
1676 if (!starts_with(buffer, "ref:")) {
1678 * Please note that FETCH_HEAD has a second
1679 * line containing other data.
1681 if (get_sha1_hex(buffer, sha1) ||
1682 (buffer[40] != '\0' && !isspace(buffer[40]))) {
1683 if (flags)
1684 *flags |= REF_ISBROKEN;
1685 errno = EINVAL;
1686 return NULL;
1688 if (bad_name) {
1689 hashclr(sha1);
1690 if (flags)
1691 *flags |= REF_ISBROKEN;
1693 return refname;
1695 if (flags)
1696 *flags |= REF_ISSYMREF;
1697 buf = buffer + 4;
1698 while (isspace(*buf))
1699 buf++;
1700 refname = strcpy(refname_buffer, buf);
1701 if (resolve_flags & RESOLVE_REF_NO_RECURSE) {
1702 hashclr(sha1);
1703 return refname;
1705 if (check_refname_format(buf, REFNAME_ALLOW_ONELEVEL)) {
1706 if (flags)
1707 *flags |= REF_ISBROKEN;
1709 if (!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||
1710 !refname_is_safe(buf)) {
1711 errno = EINVAL;
1712 return NULL;
1714 bad_name = 1;
1719 const char *resolve_ref_unsafe(const char *refname, int resolve_flags,
1720 unsigned char *sha1, int *flags)
1722 struct strbuf sb_path = STRBUF_INIT;
1723 const char *ret = resolve_ref_unsafe_1(refname, resolve_flags,
1724 sha1, flags, &sb_path);
1725 strbuf_release(&sb_path);
1726 return ret;
1729 char *resolve_refdup(const char *ref, int resolve_flags, unsigned char *sha1, int *flags)
1731 return xstrdup_or_null(resolve_ref_unsafe(ref, resolve_flags, sha1, flags));
1734 /* The argument to filter_refs */
1735 struct ref_filter {
1736 const char *pattern;
1737 each_ref_fn *fn;
1738 void *cb_data;
1741 int read_ref_full(const char *refname, int resolve_flags, unsigned char *sha1, int *flags)
1743 if (resolve_ref_unsafe(refname, resolve_flags, sha1, flags))
1744 return 0;
1745 return -1;
1748 int read_ref(const char *refname, unsigned char *sha1)
1750 return read_ref_full(refname, RESOLVE_REF_READING, sha1, NULL);
1753 int ref_exists(const char *refname)
1755 unsigned char sha1[20];
1756 return !!resolve_ref_unsafe(refname, RESOLVE_REF_READING, sha1, NULL);
1759 static int filter_refs(const char *refname, const unsigned char *sha1, int flags,
1760 void *data)
1762 struct ref_filter *filter = (struct ref_filter *)data;
1763 if (wildmatch(filter->pattern, refname, 0, NULL))
1764 return 0;
1765 return filter->fn(refname, sha1, flags, filter->cb_data);
1768 enum peel_status {
1769 /* object was peeled successfully: */
1770 PEEL_PEELED = 0,
1773 * object cannot be peeled because the named object (or an
1774 * object referred to by a tag in the peel chain), does not
1775 * exist.
1777 PEEL_INVALID = -1,
1779 /* object cannot be peeled because it is not a tag: */
1780 PEEL_NON_TAG = -2,
1782 /* ref_entry contains no peeled value because it is a symref: */
1783 PEEL_IS_SYMREF = -3,
1786 * ref_entry cannot be peeled because it is broken (i.e., the
1787 * symbolic reference cannot even be resolved to an object
1788 * name):
1790 PEEL_BROKEN = -4
1794 * Peel the named object; i.e., if the object is a tag, resolve the
1795 * tag recursively until a non-tag is found. If successful, store the
1796 * result to sha1 and return PEEL_PEELED. If the object is not a tag
1797 * or is not valid, return PEEL_NON_TAG or PEEL_INVALID, respectively,
1798 * and leave sha1 unchanged.
1800 static enum peel_status peel_object(const unsigned char *name, unsigned char *sha1)
1802 struct object *o = lookup_unknown_object(name);
1804 if (o->type == OBJ_NONE) {
1805 int type = sha1_object_info(name, NULL);
1806 if (type < 0 || !object_as_type(o, type, 0))
1807 return PEEL_INVALID;
1810 if (o->type != OBJ_TAG)
1811 return PEEL_NON_TAG;
1813 o = deref_tag_noverify(o);
1814 if (!o)
1815 return PEEL_INVALID;
1817 hashcpy(sha1, o->sha1);
1818 return PEEL_PEELED;
1822 * Peel the entry (if possible) and return its new peel_status. If
1823 * repeel is true, re-peel the entry even if there is an old peeled
1824 * value that is already stored in it.
1826 * It is OK to call this function with a packed reference entry that
1827 * might be stale and might even refer to an object that has since
1828 * been garbage-collected. In such a case, if the entry has
1829 * REF_KNOWS_PEELED then leave the status unchanged and return
1830 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.
1832 static enum peel_status peel_entry(struct ref_entry *entry, int repeel)
1834 enum peel_status status;
1836 if (entry->flag & REF_KNOWS_PEELED) {
1837 if (repeel) {
1838 entry->flag &= ~REF_KNOWS_PEELED;
1839 hashclr(entry->u.value.peeled);
1840 } else {
1841 return is_null_sha1(entry->u.value.peeled) ?
1842 PEEL_NON_TAG : PEEL_PEELED;
1845 if (entry->flag & REF_ISBROKEN)
1846 return PEEL_BROKEN;
1847 if (entry->flag & REF_ISSYMREF)
1848 return PEEL_IS_SYMREF;
1850 status = peel_object(entry->u.value.sha1, entry->u.value.peeled);
1851 if (status == PEEL_PEELED || status == PEEL_NON_TAG)
1852 entry->flag |= REF_KNOWS_PEELED;
1853 return status;
1856 int peel_ref(const char *refname, unsigned char *sha1)
1858 int flag;
1859 unsigned char base[20];
1861 if (current_ref && (current_ref->name == refname
1862 || !strcmp(current_ref->name, refname))) {
1863 if (peel_entry(current_ref, 0))
1864 return -1;
1865 hashcpy(sha1, current_ref->u.value.peeled);
1866 return 0;
1869 if (read_ref_full(refname, RESOLVE_REF_READING, base, &flag))
1870 return -1;
1873 * If the reference is packed, read its ref_entry from the
1874 * cache in the hope that we already know its peeled value.
1875 * We only try this optimization on packed references because
1876 * (a) forcing the filling of the loose reference cache could
1877 * be expensive and (b) loose references anyway usually do not
1878 * have REF_KNOWS_PEELED.
1880 if (flag & REF_ISPACKED) {
1881 struct ref_entry *r = get_packed_ref(refname);
1882 if (r) {
1883 if (peel_entry(r, 0))
1884 return -1;
1885 hashcpy(sha1, r->u.value.peeled);
1886 return 0;
1890 return peel_object(base, sha1);
1893 struct warn_if_dangling_data {
1894 FILE *fp;
1895 const char *refname;
1896 const struct string_list *refnames;
1897 const char *msg_fmt;
1900 static int warn_if_dangling_symref(const char *refname, const unsigned char *sha1,
1901 int flags, void *cb_data)
1903 struct warn_if_dangling_data *d = cb_data;
1904 const char *resolves_to;
1905 unsigned char junk[20];
1907 if (!(flags & REF_ISSYMREF))
1908 return 0;
1910 resolves_to = resolve_ref_unsafe(refname, 0, junk, NULL);
1911 if (!resolves_to
1912 || (d->refname
1913 ? strcmp(resolves_to, d->refname)
1914 : !string_list_has_string(d->refnames, resolves_to))) {
1915 return 0;
1918 fprintf(d->fp, d->msg_fmt, refname);
1919 fputc('\n', d->fp);
1920 return 0;
1923 void warn_dangling_symref(FILE *fp, const char *msg_fmt, const char *refname)
1925 struct warn_if_dangling_data data;
1927 data.fp = fp;
1928 data.refname = refname;
1929 data.refnames = NULL;
1930 data.msg_fmt = msg_fmt;
1931 for_each_rawref(warn_if_dangling_symref, &data);
1934 void warn_dangling_symrefs(FILE *fp, const char *msg_fmt, const struct string_list *refnames)
1936 struct warn_if_dangling_data data;
1938 data.fp = fp;
1939 data.refname = NULL;
1940 data.refnames = refnames;
1941 data.msg_fmt = msg_fmt;
1942 for_each_rawref(warn_if_dangling_symref, &data);
1946 * Call fn for each reference in the specified ref_cache, omitting
1947 * references not in the containing_dir of base. fn is called for all
1948 * references, including broken ones. If fn ever returns a non-zero
1949 * value, stop the iteration and return that value; otherwise, return
1950 * 0.
1952 static int do_for_each_entry(struct ref_cache *refs, const char *base,
1953 each_ref_entry_fn fn, void *cb_data)
1955 struct packed_ref_cache *packed_ref_cache;
1956 struct ref_dir *loose_dir;
1957 struct ref_dir *packed_dir;
1958 int retval = 0;
1961 * We must make sure that all loose refs are read before accessing the
1962 * packed-refs file; this avoids a race condition in which loose refs
1963 * are migrated to the packed-refs file by a simultaneous process, but
1964 * our in-memory view is from before the migration. get_packed_ref_cache()
1965 * takes care of making sure our view is up to date with what is on
1966 * disk.
1968 loose_dir = get_loose_refs(refs);
1969 if (base && *base) {
1970 loose_dir = find_containing_dir(loose_dir, base, 0);
1972 if (loose_dir)
1973 prime_ref_dir(loose_dir);
1975 packed_ref_cache = get_packed_ref_cache(refs);
1976 acquire_packed_ref_cache(packed_ref_cache);
1977 packed_dir = get_packed_ref_dir(packed_ref_cache);
1978 if (base && *base) {
1979 packed_dir = find_containing_dir(packed_dir, base, 0);
1982 if (packed_dir && loose_dir) {
1983 sort_ref_dir(packed_dir);
1984 sort_ref_dir(loose_dir);
1985 retval = do_for_each_entry_in_dirs(
1986 packed_dir, loose_dir, fn, cb_data);
1987 } else if (packed_dir) {
1988 sort_ref_dir(packed_dir);
1989 retval = do_for_each_entry_in_dir(
1990 packed_dir, 0, fn, cb_data);
1991 } else if (loose_dir) {
1992 sort_ref_dir(loose_dir);
1993 retval = do_for_each_entry_in_dir(
1994 loose_dir, 0, fn, cb_data);
1997 release_packed_ref_cache(packed_ref_cache);
1998 return retval;
2002 * Call fn for each reference in the specified ref_cache for which the
2003 * refname begins with base. If trim is non-zero, then trim that many
2004 * characters off the beginning of each refname before passing the
2005 * refname to fn. flags can be DO_FOR_EACH_INCLUDE_BROKEN to include
2006 * broken references in the iteration. If fn ever returns a non-zero
2007 * value, stop the iteration and return that value; otherwise, return
2008 * 0.
2010 static int do_for_each_ref(struct ref_cache *refs, const char *base,
2011 each_ref_fn fn, int trim, int flags, void *cb_data)
2013 struct ref_entry_cb data;
2014 data.base = base;
2015 data.trim = trim;
2016 data.flags = flags;
2017 data.fn = fn;
2018 data.cb_data = cb_data;
2020 if (ref_paranoia < 0)
2021 ref_paranoia = git_env_bool("GIT_REF_PARANOIA", 0);
2022 if (ref_paranoia)
2023 data.flags |= DO_FOR_EACH_INCLUDE_BROKEN;
2025 return do_for_each_entry(refs, base, do_one_ref, &data);
2028 static int do_head_ref(const char *submodule, each_ref_fn fn, void *cb_data)
2030 unsigned char sha1[20];
2031 int flag;
2033 if (submodule) {
2034 if (resolve_gitlink_ref(submodule, "HEAD", sha1) == 0)
2035 return fn("HEAD", sha1, 0, cb_data);
2037 return 0;
2040 if (!read_ref_full("HEAD", RESOLVE_REF_READING, sha1, &flag))
2041 return fn("HEAD", sha1, flag, cb_data);
2043 return 0;
2046 int head_ref(each_ref_fn fn, void *cb_data)
2048 return do_head_ref(NULL, fn, cb_data);
2051 int head_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
2053 return do_head_ref(submodule, fn, cb_data);
2056 int for_each_ref(each_ref_fn fn, void *cb_data)
2058 return do_for_each_ref(&ref_cache, "", fn, 0, 0, cb_data);
2061 int for_each_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
2063 return do_for_each_ref(get_ref_cache(submodule), "", fn, 0, 0, cb_data);
2066 int for_each_ref_in(const char *prefix, each_ref_fn fn, void *cb_data)
2068 return do_for_each_ref(&ref_cache, prefix, fn, strlen(prefix), 0, cb_data);
2071 int for_each_ref_in_submodule(const char *submodule, const char *prefix,
2072 each_ref_fn fn, void *cb_data)
2074 return do_for_each_ref(get_ref_cache(submodule), prefix, fn, strlen(prefix), 0, cb_data);
2077 int for_each_tag_ref(each_ref_fn fn, void *cb_data)
2079 return for_each_ref_in("refs/tags/", fn, cb_data);
2082 int for_each_tag_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
2084 return for_each_ref_in_submodule(submodule, "refs/tags/", fn, cb_data);
2087 int for_each_branch_ref(each_ref_fn fn, void *cb_data)
2089 return for_each_ref_in("refs/heads/", fn, cb_data);
2092 int for_each_branch_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
2094 return for_each_ref_in_submodule(submodule, "refs/heads/", fn, cb_data);
2097 int for_each_remote_ref(each_ref_fn fn, void *cb_data)
2099 return for_each_ref_in("refs/remotes/", fn, cb_data);
2102 int for_each_remote_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
2104 return for_each_ref_in_submodule(submodule, "refs/remotes/", fn, cb_data);
2107 int for_each_replace_ref(each_ref_fn fn, void *cb_data)
2109 return do_for_each_ref(&ref_cache, "refs/replace/", fn, 13, 0, cb_data);
2112 int head_ref_namespaced(each_ref_fn fn, void *cb_data)
2114 struct strbuf buf = STRBUF_INIT;
2115 int ret = 0;
2116 unsigned char sha1[20];
2117 int flag;
2119 strbuf_addf(&buf, "%sHEAD", get_git_namespace());
2120 if (!read_ref_full(buf.buf, RESOLVE_REF_READING, sha1, &flag))
2121 ret = fn(buf.buf, sha1, flag, cb_data);
2122 strbuf_release(&buf);
2124 return ret;
2127 int for_each_namespaced_ref(each_ref_fn fn, void *cb_data)
2129 struct strbuf buf = STRBUF_INIT;
2130 int ret;
2131 strbuf_addf(&buf, "%srefs/", get_git_namespace());
2132 ret = do_for_each_ref(&ref_cache, buf.buf, fn, 0, 0, cb_data);
2133 strbuf_release(&buf);
2134 return ret;
2137 int for_each_glob_ref_in(each_ref_fn fn, const char *pattern,
2138 const char *prefix, void *cb_data)
2140 struct strbuf real_pattern = STRBUF_INIT;
2141 struct ref_filter filter;
2142 int ret;
2144 if (!prefix && !starts_with(pattern, "refs/"))
2145 strbuf_addstr(&real_pattern, "refs/");
2146 else if (prefix)
2147 strbuf_addstr(&real_pattern, prefix);
2148 strbuf_addstr(&real_pattern, pattern);
2150 if (!has_glob_specials(pattern)) {
2151 /* Append implied '/' '*' if not present. */
2152 if (real_pattern.buf[real_pattern.len - 1] != '/')
2153 strbuf_addch(&real_pattern, '/');
2154 /* No need to check for '*', there is none. */
2155 strbuf_addch(&real_pattern, '*');
2158 filter.pattern = real_pattern.buf;
2159 filter.fn = fn;
2160 filter.cb_data = cb_data;
2161 ret = for_each_ref(filter_refs, &filter);
2163 strbuf_release(&real_pattern);
2164 return ret;
2167 int for_each_glob_ref(each_ref_fn fn, const char *pattern, void *cb_data)
2169 return for_each_glob_ref_in(fn, pattern, NULL, cb_data);
2172 int for_each_rawref(each_ref_fn fn, void *cb_data)
2174 return do_for_each_ref(&ref_cache, "", fn, 0,
2175 DO_FOR_EACH_INCLUDE_BROKEN, cb_data);
2178 const char *prettify_refname(const char *name)
2180 return name + (
2181 starts_with(name, "refs/heads/") ? 11 :
2182 starts_with(name, "refs/tags/") ? 10 :
2183 starts_with(name, "refs/remotes/") ? 13 :
2187 static const char *ref_rev_parse_rules[] = {
2188 "%.*s",
2189 "refs/%.*s",
2190 "refs/tags/%.*s",
2191 "refs/heads/%.*s",
2192 "refs/remotes/%.*s",
2193 "refs/remotes/%.*s/HEAD",
2194 NULL
2197 int refname_match(const char *abbrev_name, const char *full_name)
2199 const char **p;
2200 const int abbrev_name_len = strlen(abbrev_name);
2202 for (p = ref_rev_parse_rules; *p; p++) {
2203 if (!strcmp(full_name, mkpath(*p, abbrev_name_len, abbrev_name))) {
2204 return 1;
2208 return 0;
2211 static void unlock_ref(struct ref_lock *lock)
2213 /* Do not free lock->lk -- atexit() still looks at them */
2214 if (lock->lk)
2215 rollback_lock_file(lock->lk);
2216 free(lock->ref_name);
2217 free(lock->orig_ref_name);
2218 free(lock);
2221 /* This function should make sure errno is meaningful on error */
2222 static struct ref_lock *verify_lock(struct ref_lock *lock,
2223 const unsigned char *old_sha1, int mustexist)
2225 if (read_ref_full(lock->ref_name,
2226 mustexist ? RESOLVE_REF_READING : 0,
2227 lock->old_sha1, NULL)) {
2228 int save_errno = errno;
2229 error("Can't verify ref %s", lock->ref_name);
2230 unlock_ref(lock);
2231 errno = save_errno;
2232 return NULL;
2234 if (hashcmp(lock->old_sha1, old_sha1)) {
2235 error("Ref %s is at %s but expected %s", lock->ref_name,
2236 sha1_to_hex(lock->old_sha1), sha1_to_hex(old_sha1));
2237 unlock_ref(lock);
2238 errno = EBUSY;
2239 return NULL;
2241 return lock;
2244 static int remove_empty_directories(const char *file)
2246 /* we want to create a file but there is a directory there;
2247 * if that is an empty directory (or a directory that contains
2248 * only empty directories), remove them.
2250 struct strbuf path;
2251 int result, save_errno;
2253 strbuf_init(&path, 20);
2254 strbuf_addstr(&path, file);
2256 result = remove_dir_recursively(&path, REMOVE_DIR_EMPTY_ONLY);
2257 save_errno = errno;
2259 strbuf_release(&path);
2260 errno = save_errno;
2262 return result;
2266 * *string and *len will only be substituted, and *string returned (for
2267 * later free()ing) if the string passed in is a magic short-hand form
2268 * to name a branch.
2270 static char *substitute_branch_name(const char **string, int *len)
2272 struct strbuf buf = STRBUF_INIT;
2273 int ret = interpret_branch_name(*string, *len, &buf);
2275 if (ret == *len) {
2276 size_t size;
2277 *string = strbuf_detach(&buf, &size);
2278 *len = size;
2279 return (char *)*string;
2282 return NULL;
2285 int dwim_ref(const char *str, int len, unsigned char *sha1, char **ref)
2287 char *last_branch = substitute_branch_name(&str, &len);
2288 const char **p, *r;
2289 int refs_found = 0;
2291 *ref = NULL;
2292 for (p = ref_rev_parse_rules; *p; p++) {
2293 char fullref[PATH_MAX];
2294 unsigned char sha1_from_ref[20];
2295 unsigned char *this_result;
2296 int flag;
2298 this_result = refs_found ? sha1_from_ref : sha1;
2299 mksnpath(fullref, sizeof(fullref), *p, len, str);
2300 r = resolve_ref_unsafe(fullref, RESOLVE_REF_READING,
2301 this_result, &flag);
2302 if (r) {
2303 if (!refs_found++)
2304 *ref = xstrdup(r);
2305 if (!warn_ambiguous_refs)
2306 break;
2307 } else if ((flag & REF_ISSYMREF) && strcmp(fullref, "HEAD")) {
2308 warning("ignoring dangling symref %s.", fullref);
2309 } else if ((flag & REF_ISBROKEN) && strchr(fullref, '/')) {
2310 warning("ignoring broken ref %s.", fullref);
2313 free(last_branch);
2314 return refs_found;
2317 int dwim_log(const char *str, int len, unsigned char *sha1, char **log)
2319 char *last_branch = substitute_branch_name(&str, &len);
2320 const char **p;
2321 int logs_found = 0;
2323 *log = NULL;
2324 for (p = ref_rev_parse_rules; *p; p++) {
2325 unsigned char hash[20];
2326 char path[PATH_MAX];
2327 const char *ref, *it;
2329 mksnpath(path, sizeof(path), *p, len, str);
2330 ref = resolve_ref_unsafe(path, RESOLVE_REF_READING,
2331 hash, NULL);
2332 if (!ref)
2333 continue;
2334 if (reflog_exists(path))
2335 it = path;
2336 else if (strcmp(ref, path) && reflog_exists(ref))
2337 it = ref;
2338 else
2339 continue;
2340 if (!logs_found++) {
2341 *log = xstrdup(it);
2342 hashcpy(sha1, hash);
2344 if (!warn_ambiguous_refs)
2345 break;
2347 free(last_branch);
2348 return logs_found;
2352 * Locks a ref returning the lock on success and NULL on failure.
2353 * On failure errno is set to something meaningful.
2355 static struct ref_lock *lock_ref_sha1_basic(const char *refname,
2356 const unsigned char *old_sha1,
2357 const struct string_list *extras,
2358 const struct string_list *skip,
2359 unsigned int flags, int *type_p,
2360 struct strbuf *err)
2362 const char *ref_file;
2363 const char *orig_refname = refname;
2364 struct ref_lock *lock;
2365 int last_errno = 0;
2366 int type, lflags;
2367 int mustexist = (old_sha1 && !is_null_sha1(old_sha1));
2368 int resolve_flags = 0;
2369 int attempts_remaining = 3;
2371 assert(err);
2373 lock = xcalloc(1, sizeof(struct ref_lock));
2375 if (mustexist)
2376 resolve_flags |= RESOLVE_REF_READING;
2377 if (flags & REF_DELETING) {
2378 resolve_flags |= RESOLVE_REF_ALLOW_BAD_NAME;
2379 if (flags & REF_NODEREF)
2380 resolve_flags |= RESOLVE_REF_NO_RECURSE;
2383 refname = resolve_ref_unsafe(refname, resolve_flags,
2384 lock->old_sha1, &type);
2385 if (!refname && errno == EISDIR) {
2386 /* we are trying to lock foo but we used to
2387 * have foo/bar which now does not exist;
2388 * it is normal for the empty directory 'foo'
2389 * to remain.
2391 ref_file = git_path("%s", orig_refname);
2392 if (remove_empty_directories(ref_file)) {
2393 last_errno = errno;
2395 if (!verify_refname_available(orig_refname, extras, skip,
2396 get_loose_refs(&ref_cache), err))
2397 strbuf_addf(err, "there are still refs under '%s'",
2398 orig_refname);
2400 goto error_return;
2402 refname = resolve_ref_unsafe(orig_refname, resolve_flags,
2403 lock->old_sha1, &type);
2405 if (type_p)
2406 *type_p = type;
2407 if (!refname) {
2408 last_errno = errno;
2409 if (last_errno != ENOTDIR ||
2410 !verify_refname_available(orig_refname, extras, skip,
2411 get_loose_refs(&ref_cache), err))
2412 strbuf_addf(err, "unable to resolve reference %s: %s",
2413 orig_refname, strerror(last_errno));
2415 goto error_return;
2418 * If the ref did not exist and we are creating it, make sure
2419 * there is no existing packed ref whose name begins with our
2420 * refname, nor a packed ref whose name is a proper prefix of
2421 * our refname.
2423 if (is_null_sha1(lock->old_sha1) &&
2424 verify_refname_available(refname, extras, skip,
2425 get_packed_refs(&ref_cache), err)) {
2426 last_errno = ENOTDIR;
2427 goto error_return;
2430 lock->lk = xcalloc(1, sizeof(struct lock_file));
2432 lflags = 0;
2433 if (flags & REF_NODEREF) {
2434 refname = orig_refname;
2435 lflags |= LOCK_NO_DEREF;
2437 lock->ref_name = xstrdup(refname);
2438 lock->orig_ref_name = xstrdup(orig_refname);
2439 ref_file = git_path("%s", refname);
2441 retry:
2442 switch (safe_create_leading_directories_const(ref_file)) {
2443 case SCLD_OK:
2444 break; /* success */
2445 case SCLD_VANISHED:
2446 if (--attempts_remaining > 0)
2447 goto retry;
2448 /* fall through */
2449 default:
2450 last_errno = errno;
2451 strbuf_addf(err, "unable to create directory for %s", ref_file);
2452 goto error_return;
2455 if (hold_lock_file_for_update(lock->lk, ref_file, lflags) < 0) {
2456 last_errno = errno;
2457 if (errno == ENOENT && --attempts_remaining > 0)
2459 * Maybe somebody just deleted one of the
2460 * directories leading to ref_file. Try
2461 * again:
2463 goto retry;
2464 else {
2465 unable_to_lock_message(ref_file, errno, err);
2466 goto error_return;
2469 return old_sha1 ? verify_lock(lock, old_sha1, mustexist) : lock;
2471 error_return:
2472 unlock_ref(lock);
2473 errno = last_errno;
2474 return NULL;
2478 * Write an entry to the packed-refs file for the specified refname.
2479 * If peeled is non-NULL, write it as the entry's peeled value.
2481 static void write_packed_entry(FILE *fh, char *refname, unsigned char *sha1,
2482 unsigned char *peeled)
2484 fprintf_or_die(fh, "%s %s\n", sha1_to_hex(sha1), refname);
2485 if (peeled)
2486 fprintf_or_die(fh, "^%s\n", sha1_to_hex(peeled));
2490 * An each_ref_entry_fn that writes the entry to a packed-refs file.
2492 static int write_packed_entry_fn(struct ref_entry *entry, void *cb_data)
2494 enum peel_status peel_status = peel_entry(entry, 0);
2496 if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)
2497 error("internal error: %s is not a valid packed reference!",
2498 entry->name);
2499 write_packed_entry(cb_data, entry->name, entry->u.value.sha1,
2500 peel_status == PEEL_PEELED ?
2501 entry->u.value.peeled : NULL);
2502 return 0;
2505 /* This should return a meaningful errno on failure */
2506 int lock_packed_refs(int flags)
2508 struct packed_ref_cache *packed_ref_cache;
2510 if (hold_lock_file_for_update(&packlock, git_path("packed-refs"), flags) < 0)
2511 return -1;
2513 * Get the current packed-refs while holding the lock. If the
2514 * packed-refs file has been modified since we last read it,
2515 * this will automatically invalidate the cache and re-read
2516 * the packed-refs file.
2518 packed_ref_cache = get_packed_ref_cache(&ref_cache);
2519 packed_ref_cache->lock = &packlock;
2520 /* Increment the reference count to prevent it from being freed: */
2521 acquire_packed_ref_cache(packed_ref_cache);
2522 return 0;
2526 * Commit the packed refs changes.
2527 * On error we must make sure that errno contains a meaningful value.
2529 int commit_packed_refs(void)
2531 struct packed_ref_cache *packed_ref_cache =
2532 get_packed_ref_cache(&ref_cache);
2533 int error = 0;
2534 int save_errno = 0;
2535 FILE *out;
2537 if (!packed_ref_cache->lock)
2538 die("internal error: packed-refs not locked");
2540 out = fdopen_lock_file(packed_ref_cache->lock, "w");
2541 if (!out)
2542 die_errno("unable to fdopen packed-refs descriptor");
2544 fprintf_or_die(out, "%s", PACKED_REFS_HEADER);
2545 do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache),
2546 0, write_packed_entry_fn, out);
2548 if (commit_lock_file(packed_ref_cache->lock)) {
2549 save_errno = errno;
2550 error = -1;
2552 packed_ref_cache->lock = NULL;
2553 release_packed_ref_cache(packed_ref_cache);
2554 errno = save_errno;
2555 return error;
2558 void rollback_packed_refs(void)
2560 struct packed_ref_cache *packed_ref_cache =
2561 get_packed_ref_cache(&ref_cache);
2563 if (!packed_ref_cache->lock)
2564 die("internal error: packed-refs not locked");
2565 rollback_lock_file(packed_ref_cache->lock);
2566 packed_ref_cache->lock = NULL;
2567 release_packed_ref_cache(packed_ref_cache);
2568 clear_packed_ref_cache(&ref_cache);
2571 struct ref_to_prune {
2572 struct ref_to_prune *next;
2573 unsigned char sha1[20];
2574 char name[FLEX_ARRAY];
2577 struct pack_refs_cb_data {
2578 unsigned int flags;
2579 struct ref_dir *packed_refs;
2580 struct ref_to_prune *ref_to_prune;
2584 * An each_ref_entry_fn that is run over loose references only. If
2585 * the loose reference can be packed, add an entry in the packed ref
2586 * cache. If the reference should be pruned, also add it to
2587 * ref_to_prune in the pack_refs_cb_data.
2589 static int pack_if_possible_fn(struct ref_entry *entry, void *cb_data)
2591 struct pack_refs_cb_data *cb = cb_data;
2592 enum peel_status peel_status;
2593 struct ref_entry *packed_entry;
2594 int is_tag_ref = starts_with(entry->name, "refs/tags/");
2596 /* ALWAYS pack tags */
2597 if (!(cb->flags & PACK_REFS_ALL) && !is_tag_ref)
2598 return 0;
2600 /* Do not pack symbolic or broken refs: */
2601 if ((entry->flag & REF_ISSYMREF) || !ref_resolves_to_object(entry))
2602 return 0;
2604 /* Add a packed ref cache entry equivalent to the loose entry. */
2605 peel_status = peel_entry(entry, 1);
2606 if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)
2607 die("internal error peeling reference %s (%s)",
2608 entry->name, sha1_to_hex(entry->u.value.sha1));
2609 packed_entry = find_ref(cb->packed_refs, entry->name);
2610 if (packed_entry) {
2611 /* Overwrite existing packed entry with info from loose entry */
2612 packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED;
2613 hashcpy(packed_entry->u.value.sha1, entry->u.value.sha1);
2614 } else {
2615 packed_entry = create_ref_entry(entry->name, entry->u.value.sha1,
2616 REF_ISPACKED | REF_KNOWS_PEELED, 0);
2617 add_ref(cb->packed_refs, packed_entry);
2619 hashcpy(packed_entry->u.value.peeled, entry->u.value.peeled);
2621 /* Schedule the loose reference for pruning if requested. */
2622 if ((cb->flags & PACK_REFS_PRUNE)) {
2623 int namelen = strlen(entry->name) + 1;
2624 struct ref_to_prune *n = xcalloc(1, sizeof(*n) + namelen);
2625 hashcpy(n->sha1, entry->u.value.sha1);
2626 strcpy(n->name, entry->name);
2627 n->next = cb->ref_to_prune;
2628 cb->ref_to_prune = n;
2630 return 0;
2634 * Remove empty parents, but spare refs/ and immediate subdirs.
2635 * Note: munges *name.
2637 static void try_remove_empty_parents(char *name)
2639 char *p, *q;
2640 int i;
2641 p = name;
2642 for (i = 0; i < 2; i++) { /* refs/{heads,tags,...}/ */
2643 while (*p && *p != '/')
2644 p++;
2645 /* tolerate duplicate slashes; see check_refname_format() */
2646 while (*p == '/')
2647 p++;
2649 for (q = p; *q; q++)
2651 while (1) {
2652 while (q > p && *q != '/')
2653 q--;
2654 while (q > p && *(q-1) == '/')
2655 q--;
2656 if (q == p)
2657 break;
2658 *q = '\0';
2659 if (rmdir(git_path("%s", name)))
2660 break;
2664 /* make sure nobody touched the ref, and unlink */
2665 static void prune_ref(struct ref_to_prune *r)
2667 struct ref_transaction *transaction;
2668 struct strbuf err = STRBUF_INIT;
2670 if (check_refname_format(r->name, 0))
2671 return;
2673 transaction = ref_transaction_begin(&err);
2674 if (!transaction ||
2675 ref_transaction_delete(transaction, r->name, r->sha1,
2676 REF_ISPRUNING, NULL, &err) ||
2677 ref_transaction_commit(transaction, &err)) {
2678 ref_transaction_free(transaction);
2679 error("%s", err.buf);
2680 strbuf_release(&err);
2681 return;
2683 ref_transaction_free(transaction);
2684 strbuf_release(&err);
2685 try_remove_empty_parents(r->name);
2688 static void prune_refs(struct ref_to_prune *r)
2690 while (r) {
2691 prune_ref(r);
2692 r = r->next;
2696 int pack_refs(unsigned int flags)
2698 struct pack_refs_cb_data cbdata;
2700 memset(&cbdata, 0, sizeof(cbdata));
2701 cbdata.flags = flags;
2703 lock_packed_refs(LOCK_DIE_ON_ERROR);
2704 cbdata.packed_refs = get_packed_refs(&ref_cache);
2706 do_for_each_entry_in_dir(get_loose_refs(&ref_cache), 0,
2707 pack_if_possible_fn, &cbdata);
2709 if (commit_packed_refs())
2710 die_errno("unable to overwrite old ref-pack file");
2712 prune_refs(cbdata.ref_to_prune);
2713 return 0;
2716 int repack_without_refs(struct string_list *refnames, struct strbuf *err)
2718 struct ref_dir *packed;
2719 struct string_list_item *refname;
2720 int ret, needs_repacking = 0, removed = 0;
2722 assert(err);
2724 /* Look for a packed ref */
2725 for_each_string_list_item(refname, refnames) {
2726 if (get_packed_ref(refname->string)) {
2727 needs_repacking = 1;
2728 break;
2732 /* Avoid locking if we have nothing to do */
2733 if (!needs_repacking)
2734 return 0; /* no refname exists in packed refs */
2736 if (lock_packed_refs(0)) {
2737 unable_to_lock_message(git_path("packed-refs"), errno, err);
2738 return -1;
2740 packed = get_packed_refs(&ref_cache);
2742 /* Remove refnames from the cache */
2743 for_each_string_list_item(refname, refnames)
2744 if (remove_entry(packed, refname->string) != -1)
2745 removed = 1;
2746 if (!removed) {
2748 * All packed entries disappeared while we were
2749 * acquiring the lock.
2751 rollback_packed_refs();
2752 return 0;
2755 /* Write what remains */
2756 ret = commit_packed_refs();
2757 if (ret)
2758 strbuf_addf(err, "unable to overwrite old ref-pack file: %s",
2759 strerror(errno));
2760 return ret;
2763 static int delete_ref_loose(struct ref_lock *lock, int flag, struct strbuf *err)
2765 assert(err);
2767 if (!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) {
2769 * loose. The loose file name is the same as the
2770 * lockfile name, minus ".lock":
2772 char *loose_filename = get_locked_file_path(lock->lk);
2773 int res = unlink_or_msg(loose_filename, err);
2774 free(loose_filename);
2775 if (res)
2776 return 1;
2778 return 0;
2781 int delete_ref(const char *refname, const unsigned char *sha1, unsigned int flags)
2783 struct ref_transaction *transaction;
2784 struct strbuf err = STRBUF_INIT;
2786 transaction = ref_transaction_begin(&err);
2787 if (!transaction ||
2788 ref_transaction_delete(transaction, refname,
2789 (sha1 && !is_null_sha1(sha1)) ? sha1 : NULL,
2790 flags, NULL, &err) ||
2791 ref_transaction_commit(transaction, &err)) {
2792 error("%s", err.buf);
2793 ref_transaction_free(transaction);
2794 strbuf_release(&err);
2795 return 1;
2797 ref_transaction_free(transaction);
2798 strbuf_release(&err);
2799 return 0;
2803 * People using contrib's git-new-workdir have .git/logs/refs ->
2804 * /some/other/path/.git/logs/refs, and that may live on another device.
2806 * IOW, to avoid cross device rename errors, the temporary renamed log must
2807 * live into logs/refs.
2809 #define TMP_RENAMED_LOG "logs/refs/.tmp-renamed-log"
2811 static int rename_tmp_log(const char *newrefname)
2813 int attempts_remaining = 4;
2815 retry:
2816 switch (safe_create_leading_directories_const(git_path("logs/%s", newrefname))) {
2817 case SCLD_OK:
2818 break; /* success */
2819 case SCLD_VANISHED:
2820 if (--attempts_remaining > 0)
2821 goto retry;
2822 /* fall through */
2823 default:
2824 error("unable to create directory for %s", newrefname);
2825 return -1;
2828 if (rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", newrefname))) {
2829 if ((errno==EISDIR || errno==ENOTDIR) && --attempts_remaining > 0) {
2831 * rename(a, b) when b is an existing
2832 * directory ought to result in ISDIR, but
2833 * Solaris 5.8 gives ENOTDIR. Sheesh.
2835 if (remove_empty_directories(git_path("logs/%s", newrefname))) {
2836 error("Directory not empty: logs/%s", newrefname);
2837 return -1;
2839 goto retry;
2840 } else if (errno == ENOENT && --attempts_remaining > 0) {
2842 * Maybe another process just deleted one of
2843 * the directories in the path to newrefname.
2844 * Try again from the beginning.
2846 goto retry;
2847 } else {
2848 error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s: %s",
2849 newrefname, strerror(errno));
2850 return -1;
2853 return 0;
2856 static int rename_ref_available(const char *oldname, const char *newname)
2858 struct string_list skip = STRING_LIST_INIT_NODUP;
2859 struct strbuf err = STRBUF_INIT;
2860 int ret;
2862 string_list_insert(&skip, oldname);
2863 ret = !verify_refname_available(newname, NULL, &skip,
2864 get_packed_refs(&ref_cache), &err)
2865 && !verify_refname_available(newname, NULL, &skip,
2866 get_loose_refs(&ref_cache), &err);
2867 if (!ret)
2868 error("%s", err.buf);
2870 string_list_clear(&skip, 0);
2871 strbuf_release(&err);
2872 return ret;
2875 static int write_ref_to_lockfile(struct ref_lock *lock, const unsigned char *sha1);
2876 static int commit_ref_update(struct ref_lock *lock,
2877 const unsigned char *sha1, const char *logmsg);
2879 int rename_ref(const char *oldrefname, const char *newrefname, const char *logmsg)
2881 unsigned char sha1[20], orig_sha1[20];
2882 int flag = 0, logmoved = 0;
2883 struct ref_lock *lock;
2884 struct stat loginfo;
2885 int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);
2886 const char *symref = NULL;
2887 struct strbuf err = STRBUF_INIT;
2889 if (log && S_ISLNK(loginfo.st_mode))
2890 return error("reflog for %s is a symlink", oldrefname);
2892 symref = resolve_ref_unsafe(oldrefname, RESOLVE_REF_READING,
2893 orig_sha1, &flag);
2894 if (flag & REF_ISSYMREF)
2895 return error("refname %s is a symbolic ref, renaming it is not supported",
2896 oldrefname);
2897 if (!symref)
2898 return error("refname %s not found", oldrefname);
2900 if (!rename_ref_available(oldrefname, newrefname))
2901 return 1;
2903 if (log && rename(git_path("logs/%s", oldrefname), git_path(TMP_RENAMED_LOG)))
2904 return error("unable to move logfile logs/%s to "TMP_RENAMED_LOG": %s",
2905 oldrefname, strerror(errno));
2907 if (delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {
2908 error("unable to delete old %s", oldrefname);
2909 goto rollback;
2912 if (!read_ref_full(newrefname, RESOLVE_REF_READING, sha1, NULL) &&
2913 delete_ref(newrefname, sha1, REF_NODEREF)) {
2914 if (errno==EISDIR) {
2915 if (remove_empty_directories(git_path("%s", newrefname))) {
2916 error("Directory not empty: %s", newrefname);
2917 goto rollback;
2919 } else {
2920 error("unable to delete existing %s", newrefname);
2921 goto rollback;
2925 if (log && rename_tmp_log(newrefname))
2926 goto rollback;
2928 logmoved = log;
2930 lock = lock_ref_sha1_basic(newrefname, NULL, NULL, NULL, 0, NULL, &err);
2931 if (!lock) {
2932 error("unable to rename '%s' to '%s': %s", oldrefname, newrefname, err.buf);
2933 strbuf_release(&err);
2934 goto rollback;
2936 hashcpy(lock->old_sha1, orig_sha1);
2938 if (write_ref_to_lockfile(lock, orig_sha1) ||
2939 commit_ref_update(lock, orig_sha1, logmsg)) {
2940 error("unable to write current sha1 into %s", newrefname);
2941 goto rollback;
2944 return 0;
2946 rollback:
2947 lock = lock_ref_sha1_basic(oldrefname, NULL, NULL, NULL, 0, NULL, &err);
2948 if (!lock) {
2949 error("unable to lock %s for rollback: %s", oldrefname, err.buf);
2950 strbuf_release(&err);
2951 goto rollbacklog;
2954 flag = log_all_ref_updates;
2955 log_all_ref_updates = 0;
2956 if (write_ref_to_lockfile(lock, orig_sha1) ||
2957 commit_ref_update(lock, orig_sha1, NULL))
2958 error("unable to write current sha1 into %s", oldrefname);
2959 log_all_ref_updates = flag;
2961 rollbacklog:
2962 if (logmoved && rename(git_path("logs/%s", newrefname), git_path("logs/%s", oldrefname)))
2963 error("unable to restore logfile %s from %s: %s",
2964 oldrefname, newrefname, strerror(errno));
2965 if (!logmoved && log &&
2966 rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", oldrefname)))
2967 error("unable to restore logfile %s from "TMP_RENAMED_LOG": %s",
2968 oldrefname, strerror(errno));
2970 return 1;
2973 static int close_ref(struct ref_lock *lock)
2975 if (close_lock_file(lock->lk))
2976 return -1;
2977 return 0;
2980 static int commit_ref(struct ref_lock *lock)
2982 if (commit_lock_file(lock->lk))
2983 return -1;
2984 return 0;
2988 * copy the reflog message msg to buf, which has been allocated sufficiently
2989 * large, while cleaning up the whitespaces. Especially, convert LF to space,
2990 * because reflog file is one line per entry.
2992 static int copy_msg(char *buf, const char *msg)
2994 char *cp = buf;
2995 char c;
2996 int wasspace = 1;
2998 *cp++ = '\t';
2999 while ((c = *msg++)) {
3000 if (wasspace && isspace(c))
3001 continue;
3002 wasspace = isspace(c);
3003 if (wasspace)
3004 c = ' ';
3005 *cp++ = c;
3007 while (buf < cp && isspace(cp[-1]))
3008 cp--;
3009 *cp++ = '\n';
3010 return cp - buf;
3013 /* This function must set a meaningful errno on failure */
3014 int log_ref_setup(const char *refname, struct strbuf *sb_logfile)
3016 int logfd, oflags = O_APPEND | O_WRONLY;
3017 char *logfile;
3019 strbuf_git_path(sb_logfile, "logs/%s", refname);
3020 logfile = sb_logfile->buf;
3021 /* make sure the rest of the function can't change "logfile" */
3022 sb_logfile = NULL;
3023 if (log_all_ref_updates &&
3024 (starts_with(refname, "refs/heads/") ||
3025 starts_with(refname, "refs/remotes/") ||
3026 starts_with(refname, "refs/notes/") ||
3027 !strcmp(refname, "HEAD"))) {
3028 if (safe_create_leading_directories(logfile) < 0) {
3029 int save_errno = errno;
3030 error("unable to create directory for %s", logfile);
3031 errno = save_errno;
3032 return -1;
3034 oflags |= O_CREAT;
3037 logfd = open(logfile, oflags, 0666);
3038 if (logfd < 0) {
3039 if (!(oflags & O_CREAT) && (errno == ENOENT || errno == EISDIR))
3040 return 0;
3042 if (errno == EISDIR) {
3043 if (remove_empty_directories(logfile)) {
3044 int save_errno = errno;
3045 error("There are still logs under '%s'",
3046 logfile);
3047 errno = save_errno;
3048 return -1;
3050 logfd = open(logfile, oflags, 0666);
3053 if (logfd < 0) {
3054 int save_errno = errno;
3055 error("Unable to append to %s: %s", logfile,
3056 strerror(errno));
3057 errno = save_errno;
3058 return -1;
3062 adjust_shared_perm(logfile);
3063 close(logfd);
3064 return 0;
3067 static int log_ref_write_fd(int fd, const unsigned char *old_sha1,
3068 const unsigned char *new_sha1,
3069 const char *committer, const char *msg)
3071 int msglen, written;
3072 unsigned maxlen, len;
3073 char *logrec;
3075 msglen = msg ? strlen(msg) : 0;
3076 maxlen = strlen(committer) + msglen + 100;
3077 logrec = xmalloc(maxlen);
3078 len = sprintf(logrec, "%s %s %s\n",
3079 sha1_to_hex(old_sha1),
3080 sha1_to_hex(new_sha1),
3081 committer);
3082 if (msglen)
3083 len += copy_msg(logrec + len - 1, msg) - 1;
3085 written = len <= maxlen ? write_in_full(fd, logrec, len) : -1;
3086 free(logrec);
3087 if (written != len)
3088 return -1;
3090 return 0;
3093 static int log_ref_write_1(const char *refname, const unsigned char *old_sha1,
3094 const unsigned char *new_sha1, const char *msg,
3095 struct strbuf *sb_log_file)
3097 int logfd, result, oflags = O_APPEND | O_WRONLY;
3098 char *log_file;
3100 if (log_all_ref_updates < 0)
3101 log_all_ref_updates = !is_bare_repository();
3103 result = log_ref_setup(refname, sb_log_file);
3104 if (result)
3105 return result;
3106 log_file = sb_log_file->buf;
3107 /* make sure the rest of the function can't change "log_file" */
3108 sb_log_file = NULL;
3110 logfd = open(log_file, oflags);
3111 if (logfd < 0)
3112 return 0;
3113 result = log_ref_write_fd(logfd, old_sha1, new_sha1,
3114 git_committer_info(0), msg);
3115 if (result) {
3116 int save_errno = errno;
3117 close(logfd);
3118 error("Unable to append to %s", log_file);
3119 errno = save_errno;
3120 return -1;
3122 if (close(logfd)) {
3123 int save_errno = errno;
3124 error("Unable to append to %s", log_file);
3125 errno = save_errno;
3126 return -1;
3128 return 0;
3131 static int log_ref_write(const char *refname, const unsigned char *old_sha1,
3132 const unsigned char *new_sha1, const char *msg)
3134 struct strbuf sb = STRBUF_INIT;
3135 int ret = log_ref_write_1(refname, old_sha1, new_sha1, msg, &sb);
3136 strbuf_release(&sb);
3137 return ret;
3140 int is_branch(const char *refname)
3142 return !strcmp(refname, "HEAD") || starts_with(refname, "refs/heads/");
3146 * Write sha1 into the open lockfile, then close the lockfile. On
3147 * errors, rollback the lockfile and set errno to reflect the problem.
3149 static int write_ref_to_lockfile(struct ref_lock *lock,
3150 const unsigned char *sha1)
3152 static char term = '\n';
3153 struct object *o;
3155 o = parse_object(sha1);
3156 if (!o) {
3157 error("Trying to write ref %s with nonexistent object %s",
3158 lock->ref_name, sha1_to_hex(sha1));
3159 unlock_ref(lock);
3160 errno = EINVAL;
3161 return -1;
3163 if (o->type != OBJ_COMMIT && is_branch(lock->ref_name)) {
3164 error("Trying to write non-commit object %s to branch %s",
3165 sha1_to_hex(sha1), lock->ref_name);
3166 unlock_ref(lock);
3167 errno = EINVAL;
3168 return -1;
3170 if (write_in_full(lock->lk->fd, sha1_to_hex(sha1), 40) != 40 ||
3171 write_in_full(lock->lk->fd, &term, 1) != 1 ||
3172 close_ref(lock) < 0) {
3173 int save_errno = errno;
3174 error("Couldn't write %s", lock->lk->filename.buf);
3175 unlock_ref(lock);
3176 errno = save_errno;
3177 return -1;
3179 return 0;
3183 * Commit a change to a loose reference that has already been written
3184 * to the loose reference lockfile. Also update the reflogs if
3185 * necessary, using the specified lockmsg (which can be NULL).
3187 static int commit_ref_update(struct ref_lock *lock,
3188 const unsigned char *sha1, const char *logmsg)
3190 clear_loose_ref_cache(&ref_cache);
3191 if (log_ref_write(lock->ref_name, lock->old_sha1, sha1, logmsg) < 0 ||
3192 (strcmp(lock->ref_name, lock->orig_ref_name) &&
3193 log_ref_write(lock->orig_ref_name, lock->old_sha1, sha1, logmsg) < 0)) {
3194 unlock_ref(lock);
3195 return -1;
3197 if (strcmp(lock->orig_ref_name, "HEAD") != 0) {
3199 * Special hack: If a branch is updated directly and HEAD
3200 * points to it (may happen on the remote side of a push
3201 * for example) then logically the HEAD reflog should be
3202 * updated too.
3203 * A generic solution implies reverse symref information,
3204 * but finding all symrefs pointing to the given branch
3205 * would be rather costly for this rare event (the direct
3206 * update of a branch) to be worth it. So let's cheat and
3207 * check with HEAD only which should cover 99% of all usage
3208 * scenarios (even 100% of the default ones).
3210 unsigned char head_sha1[20];
3211 int head_flag;
3212 const char *head_ref;
3213 head_ref = resolve_ref_unsafe("HEAD", RESOLVE_REF_READING,
3214 head_sha1, &head_flag);
3215 if (head_ref && (head_flag & REF_ISSYMREF) &&
3216 !strcmp(head_ref, lock->ref_name))
3217 log_ref_write("HEAD", lock->old_sha1, sha1, logmsg);
3219 if (commit_ref(lock)) {
3220 error("Couldn't set %s", lock->ref_name);
3221 unlock_ref(lock);
3222 return -1;
3224 unlock_ref(lock);
3225 return 0;
3228 int create_symref(const char *ref_target, const char *refs_heads_master,
3229 const char *logmsg)
3231 const char *lockpath;
3232 char ref[1000];
3233 int fd, len, written;
3234 char *git_HEAD = git_pathdup("%s", ref_target);
3235 unsigned char old_sha1[20], new_sha1[20];
3237 if (logmsg && read_ref(ref_target, old_sha1))
3238 hashclr(old_sha1);
3240 if (safe_create_leading_directories(git_HEAD) < 0)
3241 return error("unable to create directory for %s", git_HEAD);
3243 #ifndef NO_SYMLINK_HEAD
3244 if (prefer_symlink_refs) {
3245 unlink(git_HEAD);
3246 if (!symlink(refs_heads_master, git_HEAD))
3247 goto done;
3248 fprintf(stderr, "no symlink - falling back to symbolic ref\n");
3250 #endif
3252 len = snprintf(ref, sizeof(ref), "ref: %s\n", refs_heads_master);
3253 if (sizeof(ref) <= len) {
3254 error("refname too long: %s", refs_heads_master);
3255 goto error_free_return;
3257 lockpath = mkpath("%s.lock", git_HEAD);
3258 fd = open(lockpath, O_CREAT | O_EXCL | O_WRONLY, 0666);
3259 if (fd < 0) {
3260 error("Unable to open %s for writing", lockpath);
3261 goto error_free_return;
3263 written = write_in_full(fd, ref, len);
3264 if (close(fd) != 0 || written != len) {
3265 error("Unable to write to %s", lockpath);
3266 goto error_unlink_return;
3268 if (rename(lockpath, git_HEAD) < 0) {
3269 error("Unable to create %s", git_HEAD);
3270 goto error_unlink_return;
3272 if (adjust_shared_perm(git_HEAD)) {
3273 error("Unable to fix permissions on %s", lockpath);
3274 error_unlink_return:
3275 unlink_or_warn(lockpath);
3276 error_free_return:
3277 free(git_HEAD);
3278 return -1;
3281 #ifndef NO_SYMLINK_HEAD
3282 done:
3283 #endif
3284 if (logmsg && !read_ref(refs_heads_master, new_sha1))
3285 log_ref_write(ref_target, old_sha1, new_sha1, logmsg);
3287 free(git_HEAD);
3288 return 0;
3291 struct read_ref_at_cb {
3292 const char *refname;
3293 unsigned long at_time;
3294 int cnt;
3295 int reccnt;
3296 unsigned char *sha1;
3297 int found_it;
3299 unsigned char osha1[20];
3300 unsigned char nsha1[20];
3301 int tz;
3302 unsigned long date;
3303 char **msg;
3304 unsigned long *cutoff_time;
3305 int *cutoff_tz;
3306 int *cutoff_cnt;
3309 static int read_ref_at_ent(unsigned char *osha1, unsigned char *nsha1,
3310 const char *email, unsigned long timestamp, int tz,
3311 const char *message, void *cb_data)
3313 struct read_ref_at_cb *cb = cb_data;
3315 cb->reccnt++;
3316 cb->tz = tz;
3317 cb->date = timestamp;
3319 if (timestamp <= cb->at_time || cb->cnt == 0) {
3320 if (cb->msg)
3321 *cb->msg = xstrdup(message);
3322 if (cb->cutoff_time)
3323 *cb->cutoff_time = timestamp;
3324 if (cb->cutoff_tz)
3325 *cb->cutoff_tz = tz;
3326 if (cb->cutoff_cnt)
3327 *cb->cutoff_cnt = cb->reccnt - 1;
3329 * we have not yet updated cb->[n|o]sha1 so they still
3330 * hold the values for the previous record.
3332 if (!is_null_sha1(cb->osha1)) {
3333 hashcpy(cb->sha1, nsha1);
3334 if (hashcmp(cb->osha1, nsha1))
3335 warning("Log for ref %s has gap after %s.",
3336 cb->refname, show_date(cb->date, cb->tz, DATE_RFC2822));
3338 else if (cb->date == cb->at_time)
3339 hashcpy(cb->sha1, nsha1);
3340 else if (hashcmp(nsha1, cb->sha1))
3341 warning("Log for ref %s unexpectedly ended on %s.",
3342 cb->refname, show_date(cb->date, cb->tz,
3343 DATE_RFC2822));
3344 hashcpy(cb->osha1, osha1);
3345 hashcpy(cb->nsha1, nsha1);
3346 cb->found_it = 1;
3347 return 1;
3349 hashcpy(cb->osha1, osha1);
3350 hashcpy(cb->nsha1, nsha1);
3351 if (cb->cnt > 0)
3352 cb->cnt--;
3353 return 0;
3356 static int read_ref_at_ent_oldest(unsigned char *osha1, unsigned char *nsha1,
3357 const char *email, unsigned long timestamp,
3358 int tz, const char *message, void *cb_data)
3360 struct read_ref_at_cb *cb = cb_data;
3362 if (cb->msg)
3363 *cb->msg = xstrdup(message);
3364 if (cb->cutoff_time)
3365 *cb->cutoff_time = timestamp;
3366 if (cb->cutoff_tz)
3367 *cb->cutoff_tz = tz;
3368 if (cb->cutoff_cnt)
3369 *cb->cutoff_cnt = cb->reccnt;
3370 hashcpy(cb->sha1, osha1);
3371 if (is_null_sha1(cb->sha1))
3372 hashcpy(cb->sha1, nsha1);
3373 /* We just want the first entry */
3374 return 1;
3377 int read_ref_at(const char *refname, unsigned int flags, unsigned long at_time, int cnt,
3378 unsigned char *sha1, char **msg,
3379 unsigned long *cutoff_time, int *cutoff_tz, int *cutoff_cnt)
3381 struct read_ref_at_cb cb;
3383 memset(&cb, 0, sizeof(cb));
3384 cb.refname = refname;
3385 cb.at_time = at_time;
3386 cb.cnt = cnt;
3387 cb.msg = msg;
3388 cb.cutoff_time = cutoff_time;
3389 cb.cutoff_tz = cutoff_tz;
3390 cb.cutoff_cnt = cutoff_cnt;
3391 cb.sha1 = sha1;
3393 for_each_reflog_ent_reverse(refname, read_ref_at_ent, &cb);
3395 if (!cb.reccnt) {
3396 if (flags & GET_SHA1_QUIETLY)
3397 exit(128);
3398 else
3399 die("Log for %s is empty.", refname);
3401 if (cb.found_it)
3402 return 0;
3404 for_each_reflog_ent(refname, read_ref_at_ent_oldest, &cb);
3406 return 1;
3409 int reflog_exists(const char *refname)
3411 struct stat st;
3413 return !lstat(git_path("logs/%s", refname), &st) &&
3414 S_ISREG(st.st_mode);
3417 int delete_reflog(const char *refname)
3419 return remove_path(git_path("logs/%s", refname));
3422 static int show_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn, void *cb_data)
3424 unsigned char osha1[20], nsha1[20];
3425 char *email_end, *message;
3426 unsigned long timestamp;
3427 int tz;
3429 /* old SP new SP name <email> SP time TAB msg LF */
3430 if (sb->len < 83 || sb->buf[sb->len - 1] != '\n' ||
3431 get_sha1_hex(sb->buf, osha1) || sb->buf[40] != ' ' ||
3432 get_sha1_hex(sb->buf + 41, nsha1) || sb->buf[81] != ' ' ||
3433 !(email_end = strchr(sb->buf + 82, '>')) ||
3434 email_end[1] != ' ' ||
3435 !(timestamp = strtoul(email_end + 2, &message, 10)) ||
3436 !message || message[0] != ' ' ||
3437 (message[1] != '+' && message[1] != '-') ||
3438 !isdigit(message[2]) || !isdigit(message[3]) ||
3439 !isdigit(message[4]) || !isdigit(message[5]))
3440 return 0; /* corrupt? */
3441 email_end[1] = '\0';
3442 tz = strtol(message + 1, NULL, 10);
3443 if (message[6] != '\t')
3444 message += 6;
3445 else
3446 message += 7;
3447 return fn(osha1, nsha1, sb->buf + 82, timestamp, tz, message, cb_data);
3450 static char *find_beginning_of_line(char *bob, char *scan)
3452 while (bob < scan && *(--scan) != '\n')
3453 ; /* keep scanning backwards */
3455 * Return either beginning of the buffer, or LF at the end of
3456 * the previous line.
3458 return scan;
3461 int for_each_reflog_ent_reverse(const char *refname, each_reflog_ent_fn fn, void *cb_data)
3463 struct strbuf sb = STRBUF_INIT;
3464 FILE *logfp;
3465 long pos;
3466 int ret = 0, at_tail = 1;
3468 logfp = fopen(git_path("logs/%s", refname), "r");
3469 if (!logfp)
3470 return -1;
3472 /* Jump to the end */
3473 if (fseek(logfp, 0, SEEK_END) < 0)
3474 return error("cannot seek back reflog for %s: %s",
3475 refname, strerror(errno));
3476 pos = ftell(logfp);
3477 while (!ret && 0 < pos) {
3478 int cnt;
3479 size_t nread;
3480 char buf[BUFSIZ];
3481 char *endp, *scanp;
3483 /* Fill next block from the end */
3484 cnt = (sizeof(buf) < pos) ? sizeof(buf) : pos;
3485 if (fseek(logfp, pos - cnt, SEEK_SET))
3486 return error("cannot seek back reflog for %s: %s",
3487 refname, strerror(errno));
3488 nread = fread(buf, cnt, 1, logfp);
3489 if (nread != 1)
3490 return error("cannot read %d bytes from reflog for %s: %s",
3491 cnt, refname, strerror(errno));
3492 pos -= cnt;
3494 scanp = endp = buf + cnt;
3495 if (at_tail && scanp[-1] == '\n')
3496 /* Looking at the final LF at the end of the file */
3497 scanp--;
3498 at_tail = 0;
3500 while (buf < scanp) {
3502 * terminating LF of the previous line, or the beginning
3503 * of the buffer.
3505 char *bp;
3507 bp = find_beginning_of_line(buf, scanp);
3509 if (*bp == '\n') {
3511 * The newline is the end of the previous line,
3512 * so we know we have complete line starting
3513 * at (bp + 1). Prefix it onto any prior data
3514 * we collected for the line and process it.
3516 strbuf_splice(&sb, 0, 0, bp + 1, endp - (bp + 1));
3517 scanp = bp;
3518 endp = bp + 1;
3519 ret = show_one_reflog_ent(&sb, fn, cb_data);
3520 strbuf_reset(&sb);
3521 if (ret)
3522 break;
3523 } else if (!pos) {
3525 * We are at the start of the buffer, and the
3526 * start of the file; there is no previous
3527 * line, and we have everything for this one.
3528 * Process it, and we can end the loop.
3530 strbuf_splice(&sb, 0, 0, buf, endp - buf);
3531 ret = show_one_reflog_ent(&sb, fn, cb_data);
3532 strbuf_reset(&sb);
3533 break;
3536 if (bp == buf) {
3538 * We are at the start of the buffer, and there
3539 * is more file to read backwards. Which means
3540 * we are in the middle of a line. Note that we
3541 * may get here even if *bp was a newline; that
3542 * just means we are at the exact end of the
3543 * previous line, rather than some spot in the
3544 * middle.
3546 * Save away what we have to be combined with
3547 * the data from the next read.
3549 strbuf_splice(&sb, 0, 0, buf, endp - buf);
3550 break;
3555 if (!ret && sb.len)
3556 die("BUG: reverse reflog parser had leftover data");
3558 fclose(logfp);
3559 strbuf_release(&sb);
3560 return ret;
3563 int for_each_reflog_ent(const char *refname, each_reflog_ent_fn fn, void *cb_data)
3565 FILE *logfp;
3566 struct strbuf sb = STRBUF_INIT;
3567 int ret = 0;
3569 logfp = fopen(git_path("logs/%s", refname), "r");
3570 if (!logfp)
3571 return -1;
3573 while (!ret && !strbuf_getwholeline(&sb, logfp, '\n'))
3574 ret = show_one_reflog_ent(&sb, fn, cb_data);
3575 fclose(logfp);
3576 strbuf_release(&sb);
3577 return ret;
3580 * Call fn for each reflog in the namespace indicated by name. name
3581 * must be empty or end with '/'. Name will be used as a scratch
3582 * space, but its contents will be restored before return.
3584 static int do_for_each_reflog(struct strbuf *name, each_ref_fn fn, void *cb_data)
3586 DIR *d = opendir(git_path("logs/%s", name->buf));
3587 int retval = 0;
3588 struct dirent *de;
3589 int oldlen = name->len;
3591 if (!d)
3592 return name->len ? errno : 0;
3594 while ((de = readdir(d)) != NULL) {
3595 struct stat st;
3597 if (de->d_name[0] == '.')
3598 continue;
3599 if (ends_with(de->d_name, ".lock"))
3600 continue;
3601 strbuf_addstr(name, de->d_name);
3602 if (stat(git_path("logs/%s", name->buf), &st) < 0) {
3603 ; /* silently ignore */
3604 } else {
3605 if (S_ISDIR(st.st_mode)) {
3606 strbuf_addch(name, '/');
3607 retval = do_for_each_reflog(name, fn, cb_data);
3608 } else {
3609 unsigned char sha1[20];
3610 if (read_ref_full(name->buf, 0, sha1, NULL))
3611 retval = error("bad ref for %s", name->buf);
3612 else
3613 retval = fn(name->buf, sha1, 0, cb_data);
3615 if (retval)
3616 break;
3618 strbuf_setlen(name, oldlen);
3620 closedir(d);
3621 return retval;
3624 int for_each_reflog(each_ref_fn fn, void *cb_data)
3626 int retval;
3627 struct strbuf name;
3628 strbuf_init(&name, PATH_MAX);
3629 retval = do_for_each_reflog(&name, fn, cb_data);
3630 strbuf_release(&name);
3631 return retval;
3635 * Information needed for a single ref update. Set new_sha1 to the new
3636 * value or to null_sha1 to delete the ref. To check the old value
3637 * while the ref is locked, set (flags & REF_HAVE_OLD) and set
3638 * old_sha1 to the old value, or to null_sha1 to ensure the ref does
3639 * not exist before update.
3641 struct ref_update {
3643 * If (flags & REF_HAVE_NEW), set the reference to this value:
3645 unsigned char new_sha1[20];
3647 * If (flags & REF_HAVE_OLD), check that the reference
3648 * previously had this value:
3650 unsigned char old_sha1[20];
3652 * One or more of REF_HAVE_NEW, REF_HAVE_OLD, REF_NODEREF,
3653 * REF_DELETING, and REF_ISPRUNING:
3655 unsigned int flags;
3656 struct ref_lock *lock;
3657 int type;
3658 char *msg;
3659 const char refname[FLEX_ARRAY];
3663 * Transaction states.
3664 * OPEN: The transaction is in a valid state and can accept new updates.
3665 * An OPEN transaction can be committed.
3666 * CLOSED: A closed transaction is no longer active and no other operations
3667 * than free can be used on it in this state.
3668 * A transaction can either become closed by successfully committing
3669 * an active transaction or if there is a failure while building
3670 * the transaction thus rendering it failed/inactive.
3672 enum ref_transaction_state {
3673 REF_TRANSACTION_OPEN = 0,
3674 REF_TRANSACTION_CLOSED = 1
3678 * Data structure for holding a reference transaction, which can
3679 * consist of checks and updates to multiple references, carried out
3680 * as atomically as possible. This structure is opaque to callers.
3682 struct ref_transaction {
3683 struct ref_update **updates;
3684 size_t alloc;
3685 size_t nr;
3686 enum ref_transaction_state state;
3689 struct ref_transaction *ref_transaction_begin(struct strbuf *err)
3691 assert(err);
3693 return xcalloc(1, sizeof(struct ref_transaction));
3696 void ref_transaction_free(struct ref_transaction *transaction)
3698 int i;
3700 if (!transaction)
3701 return;
3703 for (i = 0; i < transaction->nr; i++) {
3704 free(transaction->updates[i]->msg);
3705 free(transaction->updates[i]);
3707 free(transaction->updates);
3708 free(transaction);
3711 static struct ref_update *add_update(struct ref_transaction *transaction,
3712 const char *refname)
3714 size_t len = strlen(refname);
3715 struct ref_update *update = xcalloc(1, sizeof(*update) + len + 1);
3717 strcpy((char *)update->refname, refname);
3718 ALLOC_GROW(transaction->updates, transaction->nr + 1, transaction->alloc);
3719 transaction->updates[transaction->nr++] = update;
3720 return update;
3723 int ref_transaction_update(struct ref_transaction *transaction,
3724 const char *refname,
3725 const unsigned char *new_sha1,
3726 const unsigned char *old_sha1,
3727 unsigned int flags, const char *msg,
3728 struct strbuf *err)
3730 struct ref_update *update;
3732 assert(err);
3734 if (transaction->state != REF_TRANSACTION_OPEN)
3735 die("BUG: update called for transaction that is not open");
3737 if (new_sha1 && !is_null_sha1(new_sha1) &&
3738 check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {
3739 strbuf_addf(err, "refusing to update ref with bad name %s",
3740 refname);
3741 return -1;
3744 update = add_update(transaction, refname);
3745 if (new_sha1) {
3746 hashcpy(update->new_sha1, new_sha1);
3747 flags |= REF_HAVE_NEW;
3749 if (old_sha1) {
3750 hashcpy(update->old_sha1, old_sha1);
3751 flags |= REF_HAVE_OLD;
3753 update->flags = flags;
3754 if (msg)
3755 update->msg = xstrdup(msg);
3756 return 0;
3759 int ref_transaction_create(struct ref_transaction *transaction,
3760 const char *refname,
3761 const unsigned char *new_sha1,
3762 unsigned int flags, const char *msg,
3763 struct strbuf *err)
3765 if (!new_sha1 || is_null_sha1(new_sha1))
3766 die("BUG: create called without valid new_sha1");
3767 return ref_transaction_update(transaction, refname, new_sha1,
3768 null_sha1, flags, msg, err);
3771 int ref_transaction_delete(struct ref_transaction *transaction,
3772 const char *refname,
3773 const unsigned char *old_sha1,
3774 unsigned int flags, const char *msg,
3775 struct strbuf *err)
3777 if (old_sha1 && is_null_sha1(old_sha1))
3778 die("BUG: delete called with old_sha1 set to zeros");
3779 return ref_transaction_update(transaction, refname,
3780 null_sha1, old_sha1,
3781 flags, msg, err);
3784 int ref_transaction_verify(struct ref_transaction *transaction,
3785 const char *refname,
3786 const unsigned char *old_sha1,
3787 unsigned int flags,
3788 struct strbuf *err)
3790 if (!old_sha1)
3791 die("BUG: verify called with old_sha1 set to NULL");
3792 return ref_transaction_update(transaction, refname,
3793 NULL, old_sha1,
3794 flags, NULL, err);
3797 int update_ref(const char *msg, const char *refname,
3798 const unsigned char *new_sha1, const unsigned char *old_sha1,
3799 unsigned int flags, enum action_on_err onerr)
3801 struct ref_transaction *t;
3802 struct strbuf err = STRBUF_INIT;
3804 t = ref_transaction_begin(&err);
3805 if (!t ||
3806 ref_transaction_update(t, refname, new_sha1, old_sha1,
3807 flags, msg, &err) ||
3808 ref_transaction_commit(t, &err)) {
3809 const char *str = "update_ref failed for ref '%s': %s";
3811 ref_transaction_free(t);
3812 switch (onerr) {
3813 case UPDATE_REFS_MSG_ON_ERR:
3814 error(str, refname, err.buf);
3815 break;
3816 case UPDATE_REFS_DIE_ON_ERR:
3817 die(str, refname, err.buf);
3818 break;
3819 case UPDATE_REFS_QUIET_ON_ERR:
3820 break;
3822 strbuf_release(&err);
3823 return 1;
3825 strbuf_release(&err);
3826 ref_transaction_free(t);
3827 return 0;
3830 static int ref_update_reject_duplicates(struct string_list *refnames,
3831 struct strbuf *err)
3833 int i, n = refnames->nr;
3835 assert(err);
3837 for (i = 1; i < n; i++)
3838 if (!strcmp(refnames->items[i - 1].string, refnames->items[i].string)) {
3839 strbuf_addf(err,
3840 "Multiple updates for ref '%s' not allowed.",
3841 refnames->items[i].string);
3842 return 1;
3844 return 0;
3847 int ref_transaction_commit(struct ref_transaction *transaction,
3848 struct strbuf *err)
3850 int ret = 0, i;
3851 int n = transaction->nr;
3852 struct ref_update **updates = transaction->updates;
3853 struct string_list refs_to_delete = STRING_LIST_INIT_NODUP;
3854 struct string_list_item *ref_to_delete;
3855 struct string_list affected_refnames = STRING_LIST_INIT_NODUP;
3857 assert(err);
3859 if (transaction->state != REF_TRANSACTION_OPEN)
3860 die("BUG: commit called for transaction that is not open");
3862 if (!n) {
3863 transaction->state = REF_TRANSACTION_CLOSED;
3864 return 0;
3867 /* Fail if a refname appears more than once in the transaction: */
3868 for (i = 0; i < n; i++)
3869 string_list_append(&affected_refnames, updates[i]->refname);
3870 string_list_sort(&affected_refnames);
3871 if (ref_update_reject_duplicates(&affected_refnames, err)) {
3872 ret = TRANSACTION_GENERIC_ERROR;
3873 goto cleanup;
3877 * Acquire all locks, verify old values if provided, check
3878 * that new values are valid, and write new values to the
3879 * lockfiles, ready to be activated. Only keep one lockfile
3880 * open at a time to avoid running out of file descriptors.
3882 for (i = 0; i < n; i++) {
3883 struct ref_update *update = updates[i];
3885 if ((update->flags & REF_HAVE_NEW) &&
3886 is_null_sha1(update->new_sha1))
3887 update->flags |= REF_DELETING;
3888 update->lock = lock_ref_sha1_basic(
3889 update->refname,
3890 ((update->flags & REF_HAVE_OLD) ?
3891 update->old_sha1 : NULL),
3892 &affected_refnames, NULL,
3893 update->flags,
3894 &update->type,
3895 err);
3896 if (!update->lock) {
3897 char *reason;
3899 ret = (errno == ENOTDIR)
3900 ? TRANSACTION_NAME_CONFLICT
3901 : TRANSACTION_GENERIC_ERROR;
3902 reason = strbuf_detach(err, NULL);
3903 strbuf_addf(err, "Cannot lock ref '%s': %s",
3904 update->refname, reason);
3905 free(reason);
3906 goto cleanup;
3908 if ((update->flags & REF_HAVE_NEW) &&
3909 !(update->flags & REF_DELETING)) {
3910 int overwriting_symref = ((update->type & REF_ISSYMREF) &&
3911 (update->flags & REF_NODEREF));
3913 if (!overwriting_symref &&
3914 !hashcmp(update->lock->old_sha1, update->new_sha1)) {
3916 * The reference already has the desired
3917 * value, so we don't need to write it.
3919 } else if (write_ref_to_lockfile(update->lock,
3920 update->new_sha1)) {
3922 * The lock was freed upon failure of
3923 * write_ref_to_lockfile():
3925 update->lock = NULL;
3926 strbuf_addf(err, "Cannot update the ref '%s'.",
3927 update->refname);
3928 ret = TRANSACTION_GENERIC_ERROR;
3929 goto cleanup;
3930 } else {
3931 update->flags |= REF_NEEDS_COMMIT;
3934 if (!(update->flags & REF_NEEDS_COMMIT)) {
3936 * We didn't have to write anything to the lockfile.
3937 * Close it to free up the file descriptor:
3939 if (close_ref(update->lock)) {
3940 strbuf_addf(err, "Couldn't close %s.lock",
3941 update->refname);
3942 goto cleanup;
3947 /* Perform updates first so live commits remain referenced */
3948 for (i = 0; i < n; i++) {
3949 struct ref_update *update = updates[i];
3951 if (update->flags & REF_NEEDS_COMMIT) {
3952 if (commit_ref_update(update->lock,
3953 update->new_sha1, update->msg)) {
3954 /* freed by commit_ref_update(): */
3955 update->lock = NULL;
3956 strbuf_addf(err, "Cannot update the ref '%s'.",
3957 update->refname);
3958 ret = TRANSACTION_GENERIC_ERROR;
3959 goto cleanup;
3960 } else {
3961 /* freed by commit_ref_update(): */
3962 update->lock = NULL;
3967 /* Perform deletes now that updates are safely completed */
3968 for (i = 0; i < n; i++) {
3969 struct ref_update *update = updates[i];
3971 if (update->flags & REF_DELETING) {
3972 if (delete_ref_loose(update->lock, update->type, err)) {
3973 ret = TRANSACTION_GENERIC_ERROR;
3974 goto cleanup;
3977 if (!(update->flags & REF_ISPRUNING))
3978 string_list_append(&refs_to_delete,
3979 update->lock->ref_name);
3983 if (repack_without_refs(&refs_to_delete, err)) {
3984 ret = TRANSACTION_GENERIC_ERROR;
3985 goto cleanup;
3987 for_each_string_list_item(ref_to_delete, &refs_to_delete)
3988 unlink_or_warn(git_path("logs/%s", ref_to_delete->string));
3989 clear_loose_ref_cache(&ref_cache);
3991 cleanup:
3992 transaction->state = REF_TRANSACTION_CLOSED;
3994 for (i = 0; i < n; i++)
3995 if (updates[i]->lock)
3996 unlock_ref(updates[i]->lock);
3997 string_list_clear(&refs_to_delete, 0);
3998 string_list_clear(&affected_refnames, 0);
3999 return ret;
4002 char *shorten_unambiguous_ref(const char *refname, int strict)
4004 int i;
4005 static char **scanf_fmts;
4006 static int nr_rules;
4007 char *short_name;
4009 if (!nr_rules) {
4011 * Pre-generate scanf formats from ref_rev_parse_rules[].
4012 * Generate a format suitable for scanf from a
4013 * ref_rev_parse_rules rule by interpolating "%s" at the
4014 * location of the "%.*s".
4016 size_t total_len = 0;
4017 size_t offset = 0;
4019 /* the rule list is NULL terminated, count them first */
4020 for (nr_rules = 0; ref_rev_parse_rules[nr_rules]; nr_rules++)
4021 /* -2 for strlen("%.*s") - strlen("%s"); +1 for NUL */
4022 total_len += strlen(ref_rev_parse_rules[nr_rules]) - 2 + 1;
4024 scanf_fmts = xmalloc(nr_rules * sizeof(char *) + total_len);
4026 offset = 0;
4027 for (i = 0; i < nr_rules; i++) {
4028 assert(offset < total_len);
4029 scanf_fmts[i] = (char *)&scanf_fmts[nr_rules] + offset;
4030 offset += snprintf(scanf_fmts[i], total_len - offset,
4031 ref_rev_parse_rules[i], 2, "%s") + 1;
4035 /* bail out if there are no rules */
4036 if (!nr_rules)
4037 return xstrdup(refname);
4039 /* buffer for scanf result, at most refname must fit */
4040 short_name = xstrdup(refname);
4042 /* skip first rule, it will always match */
4043 for (i = nr_rules - 1; i > 0 ; --i) {
4044 int j;
4045 int rules_to_fail = i;
4046 int short_name_len;
4048 if (1 != sscanf(refname, scanf_fmts[i], short_name))
4049 continue;
4051 short_name_len = strlen(short_name);
4054 * in strict mode, all (except the matched one) rules
4055 * must fail to resolve to a valid non-ambiguous ref
4057 if (strict)
4058 rules_to_fail = nr_rules;
4061 * check if the short name resolves to a valid ref,
4062 * but use only rules prior to the matched one
4064 for (j = 0; j < rules_to_fail; j++) {
4065 const char *rule = ref_rev_parse_rules[j];
4066 char refname[PATH_MAX];
4068 /* skip matched rule */
4069 if (i == j)
4070 continue;
4073 * the short name is ambiguous, if it resolves
4074 * (with this previous rule) to a valid ref
4075 * read_ref() returns 0 on success
4077 mksnpath(refname, sizeof(refname),
4078 rule, short_name_len, short_name);
4079 if (ref_exists(refname))
4080 break;
4084 * short name is non-ambiguous if all previous rules
4085 * haven't resolved to a valid ref
4087 if (j == rules_to_fail)
4088 return short_name;
4091 free(short_name);
4092 return xstrdup(refname);
4095 static struct string_list *hide_refs;
4097 int parse_hide_refs_config(const char *var, const char *value, const char *section)
4099 if (!strcmp("transfer.hiderefs", var) ||
4100 /* NEEDSWORK: use parse_config_key() once both are merged */
4101 (starts_with(var, section) && var[strlen(section)] == '.' &&
4102 !strcmp(var + strlen(section), ".hiderefs"))) {
4103 char *ref;
4104 int len;
4106 if (!value)
4107 return config_error_nonbool(var);
4108 ref = xstrdup(value);
4109 len = strlen(ref);
4110 while (len && ref[len - 1] == '/')
4111 ref[--len] = '\0';
4112 if (!hide_refs) {
4113 hide_refs = xcalloc(1, sizeof(*hide_refs));
4114 hide_refs->strdup_strings = 1;
4116 string_list_append(hide_refs, ref);
4118 return 0;
4121 int ref_is_hidden(const char *refname)
4123 struct string_list_item *item;
4125 if (!hide_refs)
4126 return 0;
4127 for_each_string_list_item(item, hide_refs) {
4128 int len;
4129 if (!starts_with(refname, item->string))
4130 continue;
4131 len = strlen(item->string);
4132 if (!refname[len] || refname[len] == '/')
4133 return 1;
4135 return 0;
4138 struct expire_reflog_cb {
4139 unsigned int flags;
4140 reflog_expiry_should_prune_fn *should_prune_fn;
4141 void *policy_cb;
4142 FILE *newlog;
4143 unsigned char last_kept_sha1[20];
4146 static int expire_reflog_ent(unsigned char *osha1, unsigned char *nsha1,
4147 const char *email, unsigned long timestamp, int tz,
4148 const char *message, void *cb_data)
4150 struct expire_reflog_cb *cb = cb_data;
4151 struct expire_reflog_policy_cb *policy_cb = cb->policy_cb;
4153 if (cb->flags & EXPIRE_REFLOGS_REWRITE)
4154 osha1 = cb->last_kept_sha1;
4156 if ((*cb->should_prune_fn)(osha1, nsha1, email, timestamp, tz,
4157 message, policy_cb)) {
4158 if (!cb->newlog)
4159 printf("would prune %s", message);
4160 else if (cb->flags & EXPIRE_REFLOGS_VERBOSE)
4161 printf("prune %s", message);
4162 } else {
4163 if (cb->newlog) {
4164 fprintf(cb->newlog, "%s %s %s %lu %+05d\t%s",
4165 sha1_to_hex(osha1), sha1_to_hex(nsha1),
4166 email, timestamp, tz, message);
4167 hashcpy(cb->last_kept_sha1, nsha1);
4169 if (cb->flags & EXPIRE_REFLOGS_VERBOSE)
4170 printf("keep %s", message);
4172 return 0;
4175 int reflog_expire(const char *refname, const unsigned char *sha1,
4176 unsigned int flags,
4177 reflog_expiry_prepare_fn prepare_fn,
4178 reflog_expiry_should_prune_fn should_prune_fn,
4179 reflog_expiry_cleanup_fn cleanup_fn,
4180 void *policy_cb_data)
4182 static struct lock_file reflog_lock;
4183 struct expire_reflog_cb cb;
4184 struct ref_lock *lock;
4185 char *log_file;
4186 int status = 0;
4187 int type;
4188 struct strbuf err = STRBUF_INIT;
4190 memset(&cb, 0, sizeof(cb));
4191 cb.flags = flags;
4192 cb.policy_cb = policy_cb_data;
4193 cb.should_prune_fn = should_prune_fn;
4196 * The reflog file is locked by holding the lock on the
4197 * reference itself, plus we might need to update the
4198 * reference if --updateref was specified:
4200 lock = lock_ref_sha1_basic(refname, sha1, NULL, NULL, 0, &type, &err);
4201 if (!lock) {
4202 error("cannot lock ref '%s': %s", refname, err.buf);
4203 strbuf_release(&err);
4204 return -1;
4206 if (!reflog_exists(refname)) {
4207 unlock_ref(lock);
4208 return 0;
4211 log_file = git_pathdup("logs/%s", refname);
4212 if (!(flags & EXPIRE_REFLOGS_DRY_RUN)) {
4214 * Even though holding $GIT_DIR/logs/$reflog.lock has
4215 * no locking implications, we use the lock_file
4216 * machinery here anyway because it does a lot of the
4217 * work we need, including cleaning up if the program
4218 * exits unexpectedly.
4220 if (hold_lock_file_for_update(&reflog_lock, log_file, 0) < 0) {
4221 struct strbuf err = STRBUF_INIT;
4222 unable_to_lock_message(log_file, errno, &err);
4223 error("%s", err.buf);
4224 strbuf_release(&err);
4225 goto failure;
4227 cb.newlog = fdopen_lock_file(&reflog_lock, "w");
4228 if (!cb.newlog) {
4229 error("cannot fdopen %s (%s)",
4230 reflog_lock.filename.buf, strerror(errno));
4231 goto failure;
4235 (*prepare_fn)(refname, sha1, cb.policy_cb);
4236 for_each_reflog_ent(refname, expire_reflog_ent, &cb);
4237 (*cleanup_fn)(cb.policy_cb);
4239 if (!(flags & EXPIRE_REFLOGS_DRY_RUN)) {
4241 * It doesn't make sense to adjust a reference pointed
4242 * to by a symbolic ref based on expiring entries in
4243 * the symbolic reference's reflog. Nor can we update
4244 * a reference if there are no remaining reflog
4245 * entries.
4247 int update = (flags & EXPIRE_REFLOGS_UPDATE_REF) &&
4248 !(type & REF_ISSYMREF) &&
4249 !is_null_sha1(cb.last_kept_sha1);
4251 if (close_lock_file(&reflog_lock)) {
4252 status |= error("couldn't write %s: %s", log_file,
4253 strerror(errno));
4254 } else if (update &&
4255 (write_in_full(lock->lk->fd,
4256 sha1_to_hex(cb.last_kept_sha1), 40) != 40 ||
4257 write_str_in_full(lock->lk->fd, "\n") != 1 ||
4258 close_ref(lock) < 0)) {
4259 status |= error("couldn't write %s",
4260 lock->lk->filename.buf);
4261 rollback_lock_file(&reflog_lock);
4262 } else if (commit_lock_file(&reflog_lock)) {
4263 status |= error("unable to commit reflog '%s' (%s)",
4264 log_file, strerror(errno));
4265 } else if (update && commit_ref(lock)) {
4266 status |= error("couldn't set %s", lock->ref_name);
4269 free(log_file);
4270 unlock_ref(lock);
4271 return status;
4273 failure:
4274 rollback_lock_file(&reflog_lock);
4275 free(log_file);
4276 unlock_ref(lock);
4277 return -1;