dumb-http: do not pass NULL path to parse_pack_index
[git.git] / refs.c
blobf0bd7ac0e94653ffed45b6e3418a60c3031a65c3
1 #include "cache.h"
2 #include "refs.h"
3 #include "object.h"
4 #include "tag.h"
5 #include "dir.h"
6 #include "string-list.h"
8 /*
9 * Make sure "ref" is something reasonable to have under ".git/refs/";
10 * We do not like it if:
12 * - any path component of it begins with ".", or
13 * - it has double dots "..", or
14 * - it has ASCII control character, "~", "^", ":" or SP, anywhere, or
15 * - it ends with a "/".
16 * - it ends with ".lock"
17 * - it contains a "\" (backslash)
20 /* Return true iff ch is not allowed in reference names. */
21 static inline int bad_ref_char(int ch)
23 if (((unsigned) ch) <= ' ' || ch == 0x7f ||
24 ch == '~' || ch == '^' || ch == ':' || ch == '\\')
25 return 1;
26 /* 2.13 Pattern Matching Notation */
27 if (ch == '*' || ch == '?' || ch == '[') /* Unsupported */
28 return 1;
29 return 0;
33 * Try to read one refname component from the front of refname. Return
34 * the length of the component found, or -1 if the component is not
35 * legal.
37 static int check_refname_component(const char *refname, int flags)
39 const char *cp;
40 char last = '\0';
42 for (cp = refname; ; cp++) {
43 char ch = *cp;
44 if (ch == '\0' || ch == '/')
45 break;
46 if (bad_ref_char(ch))
47 return -1; /* Illegal character in refname. */
48 if (last == '.' && ch == '.')
49 return -1; /* Refname contains "..". */
50 if (last == '@' && ch == '{')
51 return -1; /* Refname contains "@{". */
52 last = ch;
54 if (cp == refname)
55 return 0; /* Component has zero length. */
56 if (refname[0] == '.') {
57 if (!(flags & REFNAME_DOT_COMPONENT))
58 return -1; /* Component starts with '.'. */
60 * Even if leading dots are allowed, don't allow "."
61 * as a component (".." is prevented by a rule above).
63 if (refname[1] == '\0')
64 return -1; /* Component equals ".". */
66 if (cp - refname >= 5 && !memcmp(cp - 5, ".lock", 5))
67 return -1; /* Refname ends with ".lock". */
68 return cp - refname;
71 int check_refname_format(const char *refname, int flags)
73 int component_len, component_count = 0;
75 if (!strcmp(refname, "@"))
76 /* Refname is a single character '@'. */
77 return -1;
79 while (1) {
80 /* We are at the start of a path component. */
81 component_len = check_refname_component(refname, flags);
82 if (component_len <= 0) {
83 if ((flags & REFNAME_REFSPEC_PATTERN) &&
84 refname[0] == '*' &&
85 (refname[1] == '\0' || refname[1] == '/')) {
86 /* Accept one wildcard as a full refname component. */
87 flags &= ~REFNAME_REFSPEC_PATTERN;
88 component_len = 1;
89 } else {
90 return -1;
93 component_count++;
94 if (refname[component_len] == '\0')
95 break;
96 /* Skip to next component. */
97 refname += component_len + 1;
100 if (refname[component_len - 1] == '.')
101 return -1; /* Refname ends with '.'. */
102 if (!(flags & REFNAME_ALLOW_ONELEVEL) && component_count < 2)
103 return -1; /* Refname has only one component. */
104 return 0;
107 struct ref_entry;
110 * Information used (along with the information in ref_entry) to
111 * describe a single cached reference. This data structure only
112 * occurs embedded in a union in struct ref_entry, and only when
113 * (ref_entry->flag & REF_DIR) is zero.
115 struct ref_value {
117 * The name of the object to which this reference resolves
118 * (which may be a tag object). If REF_ISBROKEN, this is
119 * null. If REF_ISSYMREF, then this is the name of the object
120 * referred to by the last reference in the symlink chain.
122 unsigned char sha1[20];
125 * If REF_KNOWS_PEELED, then this field holds the peeled value
126 * of this reference, or null if the reference is known not to
127 * be peelable. See the documentation for peel_ref() for an
128 * exact definition of "peelable".
130 unsigned char peeled[20];
133 struct ref_cache;
136 * Information used (along with the information in ref_entry) to
137 * describe a level in the hierarchy of references. This data
138 * structure only occurs embedded in a union in struct ref_entry, and
139 * only when (ref_entry.flag & REF_DIR) is set. In that case,
140 * (ref_entry.flag & REF_INCOMPLETE) determines whether the references
141 * in the directory have already been read:
143 * (ref_entry.flag & REF_INCOMPLETE) unset -- a directory of loose
144 * or packed references, already read.
146 * (ref_entry.flag & REF_INCOMPLETE) set -- a directory of loose
147 * references that hasn't been read yet (nor has any of its
148 * subdirectories).
150 * Entries within a directory are stored within a growable array of
151 * pointers to ref_entries (entries, nr, alloc). Entries 0 <= i <
152 * sorted are sorted by their component name in strcmp() order and the
153 * remaining entries are unsorted.
155 * Loose references are read lazily, one directory at a time. When a
156 * directory of loose references is read, then all of the references
157 * in that directory are stored, and REF_INCOMPLETE stubs are created
158 * for any subdirectories, but the subdirectories themselves are not
159 * read. The reading is triggered by get_ref_dir().
161 struct ref_dir {
162 int nr, alloc;
165 * Entries with index 0 <= i < sorted are sorted by name. New
166 * entries are appended to the list unsorted, and are sorted
167 * only when required; thus we avoid the need to sort the list
168 * after the addition of every reference.
170 int sorted;
172 /* A pointer to the ref_cache that contains this ref_dir. */
173 struct ref_cache *ref_cache;
175 struct ref_entry **entries;
179 * Bit values for ref_entry::flag. REF_ISSYMREF=0x01,
180 * REF_ISPACKED=0x02, and REF_ISBROKEN=0x04 are public values; see
181 * refs.h.
185 * The field ref_entry->u.value.peeled of this value entry contains
186 * the correct peeled value for the reference, which might be
187 * null_sha1 if the reference is not a tag or if it is broken.
189 #define REF_KNOWS_PEELED 0x08
191 /* ref_entry represents a directory of references */
192 #define REF_DIR 0x10
195 * Entry has not yet been read from disk (used only for REF_DIR
196 * entries representing loose references)
198 #define REF_INCOMPLETE 0x20
201 * A ref_entry represents either a reference or a "subdirectory" of
202 * references.
204 * Each directory in the reference namespace is represented by a
205 * ref_entry with (flags & REF_DIR) set and containing a subdir member
206 * that holds the entries in that directory that have been read so
207 * far. If (flags & REF_INCOMPLETE) is set, then the directory and
208 * its subdirectories haven't been read yet. REF_INCOMPLETE is only
209 * used for loose reference directories.
211 * References are represented by a ref_entry with (flags & REF_DIR)
212 * unset and a value member that describes the reference's value. The
213 * flag member is at the ref_entry level, but it is also needed to
214 * interpret the contents of the value field (in other words, a
215 * ref_value object is not very much use without the enclosing
216 * ref_entry).
218 * Reference names cannot end with slash and directories' names are
219 * always stored with a trailing slash (except for the top-level
220 * directory, which is always denoted by ""). This has two nice
221 * consequences: (1) when the entries in each subdir are sorted
222 * lexicographically by name (as they usually are), the references in
223 * a whole tree can be generated in lexicographic order by traversing
224 * the tree in left-to-right, depth-first order; (2) the names of
225 * references and subdirectories cannot conflict, and therefore the
226 * presence of an empty subdirectory does not block the creation of a
227 * similarly-named reference. (The fact that reference names with the
228 * same leading components can conflict *with each other* is a
229 * separate issue that is regulated by is_refname_available().)
231 * Please note that the name field contains the fully-qualified
232 * reference (or subdirectory) name. Space could be saved by only
233 * storing the relative names. But that would require the full names
234 * to be generated on the fly when iterating in do_for_each_ref(), and
235 * would break callback functions, who have always been able to assume
236 * that the name strings that they are passed will not be freed during
237 * the iteration.
239 struct ref_entry {
240 unsigned char flag; /* ISSYMREF? ISPACKED? */
241 union {
242 struct ref_value value; /* if not (flags&REF_DIR) */
243 struct ref_dir subdir; /* if (flags&REF_DIR) */
244 } u;
246 * The full name of the reference (e.g., "refs/heads/master")
247 * or the full name of the directory with a trailing slash
248 * (e.g., "refs/heads/"):
250 char name[FLEX_ARRAY];
253 static void read_loose_refs(const char *dirname, struct ref_dir *dir);
255 static struct ref_dir *get_ref_dir(struct ref_entry *entry)
257 struct ref_dir *dir;
258 assert(entry->flag & REF_DIR);
259 dir = &entry->u.subdir;
260 if (entry->flag & REF_INCOMPLETE) {
261 read_loose_refs(entry->name, dir);
262 entry->flag &= ~REF_INCOMPLETE;
264 return dir;
267 static struct ref_entry *create_ref_entry(const char *refname,
268 const unsigned char *sha1, int flag,
269 int check_name)
271 int len;
272 struct ref_entry *ref;
274 if (check_name &&
275 check_refname_format(refname, REFNAME_ALLOW_ONELEVEL|REFNAME_DOT_COMPONENT))
276 die("Reference has invalid format: '%s'", refname);
277 len = strlen(refname) + 1;
278 ref = xmalloc(sizeof(struct ref_entry) + len);
279 hashcpy(ref->u.value.sha1, sha1);
280 hashclr(ref->u.value.peeled);
281 memcpy(ref->name, refname, len);
282 ref->flag = flag;
283 return ref;
286 static void clear_ref_dir(struct ref_dir *dir);
288 static void free_ref_entry(struct ref_entry *entry)
290 if (entry->flag & REF_DIR) {
292 * Do not use get_ref_dir() here, as that might
293 * trigger the reading of loose refs.
295 clear_ref_dir(&entry->u.subdir);
297 free(entry);
301 * Add a ref_entry to the end of dir (unsorted). Entry is always
302 * stored directly in dir; no recursion into subdirectories is
303 * done.
305 static void add_entry_to_dir(struct ref_dir *dir, struct ref_entry *entry)
307 ALLOC_GROW(dir->entries, dir->nr + 1, dir->alloc);
308 dir->entries[dir->nr++] = entry;
309 /* optimize for the case that entries are added in order */
310 if (dir->nr == 1 ||
311 (dir->nr == dir->sorted + 1 &&
312 strcmp(dir->entries[dir->nr - 2]->name,
313 dir->entries[dir->nr - 1]->name) < 0))
314 dir->sorted = dir->nr;
318 * Clear and free all entries in dir, recursively.
320 static void clear_ref_dir(struct ref_dir *dir)
322 int i;
323 for (i = 0; i < dir->nr; i++)
324 free_ref_entry(dir->entries[i]);
325 free(dir->entries);
326 dir->sorted = dir->nr = dir->alloc = 0;
327 dir->entries = NULL;
331 * Create a struct ref_entry object for the specified dirname.
332 * dirname is the name of the directory with a trailing slash (e.g.,
333 * "refs/heads/") or "" for the top-level directory.
335 static struct ref_entry *create_dir_entry(struct ref_cache *ref_cache,
336 const char *dirname, size_t len,
337 int incomplete)
339 struct ref_entry *direntry;
340 direntry = xcalloc(1, sizeof(struct ref_entry) + len + 1);
341 memcpy(direntry->name, dirname, len);
342 direntry->name[len] = '\0';
343 direntry->u.subdir.ref_cache = ref_cache;
344 direntry->flag = REF_DIR | (incomplete ? REF_INCOMPLETE : 0);
345 return direntry;
348 static int ref_entry_cmp(const void *a, const void *b)
350 struct ref_entry *one = *(struct ref_entry **)a;
351 struct ref_entry *two = *(struct ref_entry **)b;
352 return strcmp(one->name, two->name);
355 static void sort_ref_dir(struct ref_dir *dir);
357 struct string_slice {
358 size_t len;
359 const char *str;
362 static int ref_entry_cmp_sslice(const void *key_, const void *ent_)
364 const struct string_slice *key = key_;
365 const struct ref_entry *ent = *(const struct ref_entry * const *)ent_;
366 int cmp = strncmp(key->str, ent->name, key->len);
367 if (cmp)
368 return cmp;
369 return '\0' - (unsigned char)ent->name[key->len];
373 * Return the index of the entry with the given refname from the
374 * ref_dir (non-recursively), sorting dir if necessary. Return -1 if
375 * no such entry is found. dir must already be complete.
377 static int search_ref_dir(struct ref_dir *dir, const char *refname, size_t len)
379 struct ref_entry **r;
380 struct string_slice key;
382 if (refname == NULL || !dir->nr)
383 return -1;
385 sort_ref_dir(dir);
386 key.len = len;
387 key.str = refname;
388 r = bsearch(&key, dir->entries, dir->nr, sizeof(*dir->entries),
389 ref_entry_cmp_sslice);
391 if (r == NULL)
392 return -1;
394 return r - dir->entries;
398 * Search for a directory entry directly within dir (without
399 * recursing). Sort dir if necessary. subdirname must be a directory
400 * name (i.e., end in '/'). If mkdir is set, then create the
401 * directory if it is missing; otherwise, return NULL if the desired
402 * directory cannot be found. dir must already be complete.
404 static struct ref_dir *search_for_subdir(struct ref_dir *dir,
405 const char *subdirname, size_t len,
406 int mkdir)
408 int entry_index = search_ref_dir(dir, subdirname, len);
409 struct ref_entry *entry;
410 if (entry_index == -1) {
411 if (!mkdir)
412 return NULL;
414 * Since dir is complete, the absence of a subdir
415 * means that the subdir really doesn't exist;
416 * therefore, create an empty record for it but mark
417 * the record complete.
419 entry = create_dir_entry(dir->ref_cache, subdirname, len, 0);
420 add_entry_to_dir(dir, entry);
421 } else {
422 entry = dir->entries[entry_index];
424 return get_ref_dir(entry);
428 * If refname is a reference name, find the ref_dir within the dir
429 * tree that should hold refname. If refname is a directory name
430 * (i.e., ends in '/'), then return that ref_dir itself. dir must
431 * represent the top-level directory and must already be complete.
432 * Sort ref_dirs and recurse into subdirectories as necessary. If
433 * mkdir is set, then create any missing directories; otherwise,
434 * return NULL if the desired directory cannot be found.
436 static struct ref_dir *find_containing_dir(struct ref_dir *dir,
437 const char *refname, int mkdir)
439 const char *slash;
440 for (slash = strchr(refname, '/'); slash; slash = strchr(slash + 1, '/')) {
441 size_t dirnamelen = slash - refname + 1;
442 struct ref_dir *subdir;
443 subdir = search_for_subdir(dir, refname, dirnamelen, mkdir);
444 if (!subdir) {
445 dir = NULL;
446 break;
448 dir = subdir;
451 return dir;
455 * Find the value entry with the given name in dir, sorting ref_dirs
456 * and recursing into subdirectories as necessary. If the name is not
457 * found or it corresponds to a directory entry, return NULL.
459 static struct ref_entry *find_ref(struct ref_dir *dir, const char *refname)
461 int entry_index;
462 struct ref_entry *entry;
463 dir = find_containing_dir(dir, refname, 0);
464 if (!dir)
465 return NULL;
466 entry_index = search_ref_dir(dir, refname, strlen(refname));
467 if (entry_index == -1)
468 return NULL;
469 entry = dir->entries[entry_index];
470 return (entry->flag & REF_DIR) ? NULL : entry;
474 * Remove the entry with the given name from dir, recursing into
475 * subdirectories as necessary. If refname is the name of a directory
476 * (i.e., ends with '/'), then remove the directory and its contents.
477 * If the removal was successful, return the number of entries
478 * remaining in the directory entry that contained the deleted entry.
479 * If the name was not found, return -1. Please note that this
480 * function only deletes the entry from the cache; it does not delete
481 * it from the filesystem or ensure that other cache entries (which
482 * might be symbolic references to the removed entry) are updated.
483 * Nor does it remove any containing dir entries that might be made
484 * empty by the removal. dir must represent the top-level directory
485 * and must already be complete.
487 static int remove_entry(struct ref_dir *dir, const char *refname)
489 int refname_len = strlen(refname);
490 int entry_index;
491 struct ref_entry *entry;
492 int is_dir = refname[refname_len - 1] == '/';
493 if (is_dir) {
495 * refname represents a reference directory. Remove
496 * the trailing slash; otherwise we will get the
497 * directory *representing* refname rather than the
498 * one *containing* it.
500 char *dirname = xmemdupz(refname, refname_len - 1);
501 dir = find_containing_dir(dir, dirname, 0);
502 free(dirname);
503 } else {
504 dir = find_containing_dir(dir, refname, 0);
506 if (!dir)
507 return -1;
508 entry_index = search_ref_dir(dir, refname, refname_len);
509 if (entry_index == -1)
510 return -1;
511 entry = dir->entries[entry_index];
513 memmove(&dir->entries[entry_index],
514 &dir->entries[entry_index + 1],
515 (dir->nr - entry_index - 1) * sizeof(*dir->entries)
517 dir->nr--;
518 if (dir->sorted > entry_index)
519 dir->sorted--;
520 free_ref_entry(entry);
521 return dir->nr;
525 * Add a ref_entry to the ref_dir (unsorted), recursing into
526 * subdirectories as necessary. dir must represent the top-level
527 * directory. Return 0 on success.
529 static int add_ref(struct ref_dir *dir, struct ref_entry *ref)
531 dir = find_containing_dir(dir, ref->name, 1);
532 if (!dir)
533 return -1;
534 add_entry_to_dir(dir, ref);
535 return 0;
539 * Emit a warning and return true iff ref1 and ref2 have the same name
540 * and the same sha1. Die if they have the same name but different
541 * sha1s.
543 static int is_dup_ref(const struct ref_entry *ref1, const struct ref_entry *ref2)
545 if (strcmp(ref1->name, ref2->name))
546 return 0;
548 /* Duplicate name; make sure that they don't conflict: */
550 if ((ref1->flag & REF_DIR) || (ref2->flag & REF_DIR))
551 /* This is impossible by construction */
552 die("Reference directory conflict: %s", ref1->name);
554 if (hashcmp(ref1->u.value.sha1, ref2->u.value.sha1))
555 die("Duplicated ref, and SHA1s don't match: %s", ref1->name);
557 warning("Duplicated ref: %s", ref1->name);
558 return 1;
562 * Sort the entries in dir non-recursively (if they are not already
563 * sorted) and remove any duplicate entries.
565 static void sort_ref_dir(struct ref_dir *dir)
567 int i, j;
568 struct ref_entry *last = NULL;
571 * This check also prevents passing a zero-length array to qsort(),
572 * which is a problem on some platforms.
574 if (dir->sorted == dir->nr)
575 return;
577 qsort(dir->entries, dir->nr, sizeof(*dir->entries), ref_entry_cmp);
579 /* Remove any duplicates: */
580 for (i = 0, j = 0; j < dir->nr; j++) {
581 struct ref_entry *entry = dir->entries[j];
582 if (last && is_dup_ref(last, entry))
583 free_ref_entry(entry);
584 else
585 last = dir->entries[i++] = entry;
587 dir->sorted = dir->nr = i;
590 /* Include broken references in a do_for_each_ref*() iteration: */
591 #define DO_FOR_EACH_INCLUDE_BROKEN 0x01
594 * Return true iff the reference described by entry can be resolved to
595 * an object in the database. Emit a warning if the referred-to
596 * object does not exist.
598 static int ref_resolves_to_object(struct ref_entry *entry)
600 if (entry->flag & REF_ISBROKEN)
601 return 0;
602 if (!has_sha1_file(entry->u.value.sha1)) {
603 error("%s does not point to a valid object!", entry->name);
604 return 0;
606 return 1;
610 * current_ref is a performance hack: when iterating over references
611 * using the for_each_ref*() functions, current_ref is set to the
612 * current reference's entry before calling the callback function. If
613 * the callback function calls peel_ref(), then peel_ref() first
614 * checks whether the reference to be peeled is the current reference
615 * (it usually is) and if so, returns that reference's peeled version
616 * if it is available. This avoids a refname lookup in a common case.
618 static struct ref_entry *current_ref;
620 typedef int each_ref_entry_fn(struct ref_entry *entry, void *cb_data);
622 struct ref_entry_cb {
623 const char *base;
624 int trim;
625 int flags;
626 each_ref_fn *fn;
627 void *cb_data;
631 * Handle one reference in a do_for_each_ref*()-style iteration,
632 * calling an each_ref_fn for each entry.
634 static int do_one_ref(struct ref_entry *entry, void *cb_data)
636 struct ref_entry_cb *data = cb_data;
637 struct ref_entry *old_current_ref;
638 int retval;
640 if (!starts_with(entry->name, data->base))
641 return 0;
643 if (!(data->flags & DO_FOR_EACH_INCLUDE_BROKEN) &&
644 !ref_resolves_to_object(entry))
645 return 0;
647 /* Store the old value, in case this is a recursive call: */
648 old_current_ref = current_ref;
649 current_ref = entry;
650 retval = data->fn(entry->name + data->trim, entry->u.value.sha1,
651 entry->flag, data->cb_data);
652 current_ref = old_current_ref;
653 return retval;
657 * Call fn for each reference in dir that has index in the range
658 * offset <= index < dir->nr. Recurse into subdirectories that are in
659 * that index range, sorting them before iterating. This function
660 * does not sort dir itself; it should be sorted beforehand. fn is
661 * called for all references, including broken ones.
663 static int do_for_each_entry_in_dir(struct ref_dir *dir, int offset,
664 each_ref_entry_fn fn, void *cb_data)
666 int i;
667 assert(dir->sorted == dir->nr);
668 for (i = offset; i < dir->nr; i++) {
669 struct ref_entry *entry = dir->entries[i];
670 int retval;
671 if (entry->flag & REF_DIR) {
672 struct ref_dir *subdir = get_ref_dir(entry);
673 sort_ref_dir(subdir);
674 retval = do_for_each_entry_in_dir(subdir, 0, fn, cb_data);
675 } else {
676 retval = fn(entry, cb_data);
678 if (retval)
679 return retval;
681 return 0;
685 * Call fn for each reference in the union of dir1 and dir2, in order
686 * by refname. Recurse into subdirectories. If a value entry appears
687 * in both dir1 and dir2, then only process the version that is in
688 * dir2. The input dirs must already be sorted, but subdirs will be
689 * sorted as needed. fn is called for all references, including
690 * broken ones.
692 static int do_for_each_entry_in_dirs(struct ref_dir *dir1,
693 struct ref_dir *dir2,
694 each_ref_entry_fn fn, void *cb_data)
696 int retval;
697 int i1 = 0, i2 = 0;
699 assert(dir1->sorted == dir1->nr);
700 assert(dir2->sorted == dir2->nr);
701 while (1) {
702 struct ref_entry *e1, *e2;
703 int cmp;
704 if (i1 == dir1->nr) {
705 return do_for_each_entry_in_dir(dir2, i2, fn, cb_data);
707 if (i2 == dir2->nr) {
708 return do_for_each_entry_in_dir(dir1, i1, fn, cb_data);
710 e1 = dir1->entries[i1];
711 e2 = dir2->entries[i2];
712 cmp = strcmp(e1->name, e2->name);
713 if (cmp == 0) {
714 if ((e1->flag & REF_DIR) && (e2->flag & REF_DIR)) {
715 /* Both are directories; descend them in parallel. */
716 struct ref_dir *subdir1 = get_ref_dir(e1);
717 struct ref_dir *subdir2 = get_ref_dir(e2);
718 sort_ref_dir(subdir1);
719 sort_ref_dir(subdir2);
720 retval = do_for_each_entry_in_dirs(
721 subdir1, subdir2, fn, cb_data);
722 i1++;
723 i2++;
724 } else if (!(e1->flag & REF_DIR) && !(e2->flag & REF_DIR)) {
725 /* Both are references; ignore the one from dir1. */
726 retval = fn(e2, cb_data);
727 i1++;
728 i2++;
729 } else {
730 die("conflict between reference and directory: %s",
731 e1->name);
733 } else {
734 struct ref_entry *e;
735 if (cmp < 0) {
736 e = e1;
737 i1++;
738 } else {
739 e = e2;
740 i2++;
742 if (e->flag & REF_DIR) {
743 struct ref_dir *subdir = get_ref_dir(e);
744 sort_ref_dir(subdir);
745 retval = do_for_each_entry_in_dir(
746 subdir, 0, fn, cb_data);
747 } else {
748 retval = fn(e, cb_data);
751 if (retval)
752 return retval;
757 * Load all of the refs from the dir into our in-memory cache. The hard work
758 * of loading loose refs is done by get_ref_dir(), so we just need to recurse
759 * through all of the sub-directories. We do not even need to care about
760 * sorting, as traversal order does not matter to us.
762 static void prime_ref_dir(struct ref_dir *dir)
764 int i;
765 for (i = 0; i < dir->nr; i++) {
766 struct ref_entry *entry = dir->entries[i];
767 if (entry->flag & REF_DIR)
768 prime_ref_dir(get_ref_dir(entry));
772 * Return true iff refname1 and refname2 conflict with each other.
773 * Two reference names conflict if one of them exactly matches the
774 * leading components of the other; e.g., "foo/bar" conflicts with
775 * both "foo" and with "foo/bar/baz" but not with "foo/bar" or
776 * "foo/barbados".
778 static int names_conflict(const char *refname1, const char *refname2)
780 for (; *refname1 && *refname1 == *refname2; refname1++, refname2++)
782 return (*refname1 == '\0' && *refname2 == '/')
783 || (*refname1 == '/' && *refname2 == '\0');
786 struct name_conflict_cb {
787 const char *refname;
788 const char *oldrefname;
789 const char *conflicting_refname;
792 static int name_conflict_fn(struct ref_entry *entry, void *cb_data)
794 struct name_conflict_cb *data = (struct name_conflict_cb *)cb_data;
795 if (data->oldrefname && !strcmp(data->oldrefname, entry->name))
796 return 0;
797 if (names_conflict(data->refname, entry->name)) {
798 data->conflicting_refname = entry->name;
799 return 1;
801 return 0;
805 * Return true iff a reference named refname could be created without
806 * conflicting with the name of an existing reference in dir. If
807 * oldrefname is non-NULL, ignore potential conflicts with oldrefname
808 * (e.g., because oldrefname is scheduled for deletion in the same
809 * operation).
811 static int is_refname_available(const char *refname, const char *oldrefname,
812 struct ref_dir *dir)
814 struct name_conflict_cb data;
815 data.refname = refname;
816 data.oldrefname = oldrefname;
817 data.conflicting_refname = NULL;
819 sort_ref_dir(dir);
820 if (do_for_each_entry_in_dir(dir, 0, name_conflict_fn, &data)) {
821 error("'%s' exists; cannot create '%s'",
822 data.conflicting_refname, refname);
823 return 0;
825 return 1;
828 struct packed_ref_cache {
829 struct ref_entry *root;
832 * Count of references to the data structure in this instance,
833 * including the pointer from ref_cache::packed if any. The
834 * data will not be freed as long as the reference count is
835 * nonzero.
837 unsigned int referrers;
840 * Iff the packed-refs file associated with this instance is
841 * currently locked for writing, this points at the associated
842 * lock (which is owned by somebody else). The referrer count
843 * is also incremented when the file is locked and decremented
844 * when it is unlocked.
846 struct lock_file *lock;
848 /* The metadata from when this packed-refs cache was read */
849 struct stat_validity validity;
853 * Future: need to be in "struct repository"
854 * when doing a full libification.
856 static struct ref_cache {
857 struct ref_cache *next;
858 struct ref_entry *loose;
859 struct packed_ref_cache *packed;
861 * The submodule name, or "" for the main repo. We allocate
862 * length 1 rather than FLEX_ARRAY so that the main ref_cache
863 * is initialized correctly.
865 char name[1];
866 } ref_cache, *submodule_ref_caches;
868 /* Lock used for the main packed-refs file: */
869 static struct lock_file packlock;
872 * Increment the reference count of *packed_refs.
874 static void acquire_packed_ref_cache(struct packed_ref_cache *packed_refs)
876 packed_refs->referrers++;
880 * Decrease the reference count of *packed_refs. If it goes to zero,
881 * free *packed_refs and return true; otherwise return false.
883 static int release_packed_ref_cache(struct packed_ref_cache *packed_refs)
885 if (!--packed_refs->referrers) {
886 free_ref_entry(packed_refs->root);
887 stat_validity_clear(&packed_refs->validity);
888 free(packed_refs);
889 return 1;
890 } else {
891 return 0;
895 static void clear_packed_ref_cache(struct ref_cache *refs)
897 if (refs->packed) {
898 struct packed_ref_cache *packed_refs = refs->packed;
900 if (packed_refs->lock)
901 die("internal error: packed-ref cache cleared while locked");
902 refs->packed = NULL;
903 release_packed_ref_cache(packed_refs);
907 static void clear_loose_ref_cache(struct ref_cache *refs)
909 if (refs->loose) {
910 free_ref_entry(refs->loose);
911 refs->loose = NULL;
915 static struct ref_cache *create_ref_cache(const char *submodule)
917 int len;
918 struct ref_cache *refs;
919 if (!submodule)
920 submodule = "";
921 len = strlen(submodule) + 1;
922 refs = xcalloc(1, sizeof(struct ref_cache) + len);
923 memcpy(refs->name, submodule, len);
924 return refs;
928 * Return a pointer to a ref_cache for the specified submodule. For
929 * the main repository, use submodule==NULL. The returned structure
930 * will be allocated and initialized but not necessarily populated; it
931 * should not be freed.
933 static struct ref_cache *get_ref_cache(const char *submodule)
935 struct ref_cache *refs;
937 if (!submodule || !*submodule)
938 return &ref_cache;
940 for (refs = submodule_ref_caches; refs; refs = refs->next)
941 if (!strcmp(submodule, refs->name))
942 return refs;
944 refs = create_ref_cache(submodule);
945 refs->next = submodule_ref_caches;
946 submodule_ref_caches = refs;
947 return refs;
950 /* The length of a peeled reference line in packed-refs, including EOL: */
951 #define PEELED_LINE_LENGTH 42
954 * The packed-refs header line that we write out. Perhaps other
955 * traits will be added later. The trailing space is required.
957 static const char PACKED_REFS_HEADER[] =
958 "# pack-refs with: peeled fully-peeled \n";
961 * Parse one line from a packed-refs file. Write the SHA1 to sha1.
962 * Return a pointer to the refname within the line (null-terminated),
963 * or NULL if there was a problem.
965 static const char *parse_ref_line(char *line, unsigned char *sha1)
968 * 42: the answer to everything.
970 * In this case, it happens to be the answer to
971 * 40 (length of sha1 hex representation)
972 * +1 (space in between hex and name)
973 * +1 (newline at the end of the line)
975 int len = strlen(line) - 42;
977 if (len <= 0)
978 return NULL;
979 if (get_sha1_hex(line, sha1) < 0)
980 return NULL;
981 if (!isspace(line[40]))
982 return NULL;
983 line += 41;
984 if (isspace(*line))
985 return NULL;
986 if (line[len] != '\n')
987 return NULL;
988 line[len] = 0;
990 return line;
994 * Read f, which is a packed-refs file, into dir.
996 * A comment line of the form "# pack-refs with: " may contain zero or
997 * more traits. We interpret the traits as follows:
999 * No traits:
1001 * Probably no references are peeled. But if the file contains a
1002 * peeled value for a reference, we will use it.
1004 * peeled:
1006 * References under "refs/tags/", if they *can* be peeled, *are*
1007 * peeled in this file. References outside of "refs/tags/" are
1008 * probably not peeled even if they could have been, but if we find
1009 * a peeled value for such a reference we will use it.
1011 * fully-peeled:
1013 * All references in the file that can be peeled are peeled.
1014 * Inversely (and this is more important), any references in the
1015 * file for which no peeled value is recorded is not peelable. This
1016 * trait should typically be written alongside "peeled" for
1017 * compatibility with older clients, but we do not require it
1018 * (i.e., "peeled" is a no-op if "fully-peeled" is set).
1020 static void read_packed_refs(FILE *f, struct ref_dir *dir)
1022 struct ref_entry *last = NULL;
1023 char refline[PATH_MAX];
1024 enum { PEELED_NONE, PEELED_TAGS, PEELED_FULLY } peeled = PEELED_NONE;
1026 while (fgets(refline, sizeof(refline), f)) {
1027 unsigned char sha1[20];
1028 const char *refname;
1029 static const char header[] = "# pack-refs with:";
1031 if (!strncmp(refline, header, sizeof(header)-1)) {
1032 const char *traits = refline + sizeof(header) - 1;
1033 if (strstr(traits, " fully-peeled "))
1034 peeled = PEELED_FULLY;
1035 else if (strstr(traits, " peeled "))
1036 peeled = PEELED_TAGS;
1037 /* perhaps other traits later as well */
1038 continue;
1041 refname = parse_ref_line(refline, sha1);
1042 if (refname) {
1043 last = create_ref_entry(refname, sha1, REF_ISPACKED, 1);
1044 if (peeled == PEELED_FULLY ||
1045 (peeled == PEELED_TAGS && starts_with(refname, "refs/tags/")))
1046 last->flag |= REF_KNOWS_PEELED;
1047 add_ref(dir, last);
1048 continue;
1050 if (last &&
1051 refline[0] == '^' &&
1052 strlen(refline) == PEELED_LINE_LENGTH &&
1053 refline[PEELED_LINE_LENGTH - 1] == '\n' &&
1054 !get_sha1_hex(refline + 1, sha1)) {
1055 hashcpy(last->u.value.peeled, sha1);
1057 * Regardless of what the file header said,
1058 * we definitely know the value of *this*
1059 * reference:
1061 last->flag |= REF_KNOWS_PEELED;
1067 * Get the packed_ref_cache for the specified ref_cache, creating it
1068 * if necessary.
1070 static struct packed_ref_cache *get_packed_ref_cache(struct ref_cache *refs)
1072 const char *packed_refs_file;
1074 if (*refs->name)
1075 packed_refs_file = git_path_submodule(refs->name, "packed-refs");
1076 else
1077 packed_refs_file = git_path("packed-refs");
1079 if (refs->packed &&
1080 !stat_validity_check(&refs->packed->validity, packed_refs_file))
1081 clear_packed_ref_cache(refs);
1083 if (!refs->packed) {
1084 FILE *f;
1086 refs->packed = xcalloc(1, sizeof(*refs->packed));
1087 acquire_packed_ref_cache(refs->packed);
1088 refs->packed->root = create_dir_entry(refs, "", 0, 0);
1089 f = fopen(packed_refs_file, "r");
1090 if (f) {
1091 stat_validity_update(&refs->packed->validity, fileno(f));
1092 read_packed_refs(f, get_ref_dir(refs->packed->root));
1093 fclose(f);
1096 return refs->packed;
1099 static struct ref_dir *get_packed_ref_dir(struct packed_ref_cache *packed_ref_cache)
1101 return get_ref_dir(packed_ref_cache->root);
1104 static struct ref_dir *get_packed_refs(struct ref_cache *refs)
1106 return get_packed_ref_dir(get_packed_ref_cache(refs));
1109 void add_packed_ref(const char *refname, const unsigned char *sha1)
1111 struct packed_ref_cache *packed_ref_cache =
1112 get_packed_ref_cache(&ref_cache);
1114 if (!packed_ref_cache->lock)
1115 die("internal error: packed refs not locked");
1116 add_ref(get_packed_ref_dir(packed_ref_cache),
1117 create_ref_entry(refname, sha1, REF_ISPACKED, 1));
1121 * Read the loose references from the namespace dirname into dir
1122 * (without recursing). dirname must end with '/'. dir must be the
1123 * directory entry corresponding to dirname.
1125 static void read_loose_refs(const char *dirname, struct ref_dir *dir)
1127 struct ref_cache *refs = dir->ref_cache;
1128 DIR *d;
1129 const char *path;
1130 struct dirent *de;
1131 int dirnamelen = strlen(dirname);
1132 struct strbuf refname;
1134 if (*refs->name)
1135 path = git_path_submodule(refs->name, "%s", dirname);
1136 else
1137 path = git_path("%s", dirname);
1139 d = opendir(path);
1140 if (!d)
1141 return;
1143 strbuf_init(&refname, dirnamelen + 257);
1144 strbuf_add(&refname, dirname, dirnamelen);
1146 while ((de = readdir(d)) != NULL) {
1147 unsigned char sha1[20];
1148 struct stat st;
1149 int flag;
1150 const char *refdir;
1152 if (de->d_name[0] == '.')
1153 continue;
1154 if (has_extension(de->d_name, ".lock"))
1155 continue;
1156 strbuf_addstr(&refname, de->d_name);
1157 refdir = *refs->name
1158 ? git_path_submodule(refs->name, "%s", refname.buf)
1159 : git_path("%s", refname.buf);
1160 if (stat(refdir, &st) < 0) {
1161 ; /* silently ignore */
1162 } else if (S_ISDIR(st.st_mode)) {
1163 strbuf_addch(&refname, '/');
1164 add_entry_to_dir(dir,
1165 create_dir_entry(refs, refname.buf,
1166 refname.len, 1));
1167 } else {
1168 if (*refs->name) {
1169 hashclr(sha1);
1170 flag = 0;
1171 if (resolve_gitlink_ref(refs->name, refname.buf, sha1) < 0) {
1172 hashclr(sha1);
1173 flag |= REF_ISBROKEN;
1175 } else if (read_ref_full(refname.buf, sha1, 1, &flag)) {
1176 hashclr(sha1);
1177 flag |= REF_ISBROKEN;
1179 add_entry_to_dir(dir,
1180 create_ref_entry(refname.buf, sha1, flag, 1));
1182 strbuf_setlen(&refname, dirnamelen);
1184 strbuf_release(&refname);
1185 closedir(d);
1188 static struct ref_dir *get_loose_refs(struct ref_cache *refs)
1190 if (!refs->loose) {
1192 * Mark the top-level directory complete because we
1193 * are about to read the only subdirectory that can
1194 * hold references:
1196 refs->loose = create_dir_entry(refs, "", 0, 0);
1198 * Create an incomplete entry for "refs/":
1200 add_entry_to_dir(get_ref_dir(refs->loose),
1201 create_dir_entry(refs, "refs/", 5, 1));
1203 return get_ref_dir(refs->loose);
1206 /* We allow "recursive" symbolic refs. Only within reason, though */
1207 #define MAXDEPTH 5
1208 #define MAXREFLEN (1024)
1211 * Called by resolve_gitlink_ref_recursive() after it failed to read
1212 * from the loose refs in ref_cache refs. Find <refname> in the
1213 * packed-refs file for the submodule.
1215 static int resolve_gitlink_packed_ref(struct ref_cache *refs,
1216 const char *refname, unsigned char *sha1)
1218 struct ref_entry *ref;
1219 struct ref_dir *dir = get_packed_refs(refs);
1221 ref = find_ref(dir, refname);
1222 if (ref == NULL)
1223 return -1;
1225 hashcpy(sha1, ref->u.value.sha1);
1226 return 0;
1229 static int resolve_gitlink_ref_recursive(struct ref_cache *refs,
1230 const char *refname, unsigned char *sha1,
1231 int recursion)
1233 int fd, len;
1234 char buffer[128], *p;
1235 char *path;
1237 if (recursion > MAXDEPTH || strlen(refname) > MAXREFLEN)
1238 return -1;
1239 path = *refs->name
1240 ? git_path_submodule(refs->name, "%s", refname)
1241 : git_path("%s", refname);
1242 fd = open(path, O_RDONLY);
1243 if (fd < 0)
1244 return resolve_gitlink_packed_ref(refs, refname, sha1);
1246 len = read(fd, buffer, sizeof(buffer)-1);
1247 close(fd);
1248 if (len < 0)
1249 return -1;
1250 while (len && isspace(buffer[len-1]))
1251 len--;
1252 buffer[len] = 0;
1254 /* Was it a detached head or an old-fashioned symlink? */
1255 if (!get_sha1_hex(buffer, sha1))
1256 return 0;
1258 /* Symref? */
1259 if (strncmp(buffer, "ref:", 4))
1260 return -1;
1261 p = buffer + 4;
1262 while (isspace(*p))
1263 p++;
1265 return resolve_gitlink_ref_recursive(refs, p, sha1, recursion+1);
1268 int resolve_gitlink_ref(const char *path, const char *refname, unsigned char *sha1)
1270 int len = strlen(path), retval;
1271 char *submodule;
1272 struct ref_cache *refs;
1274 while (len && path[len-1] == '/')
1275 len--;
1276 if (!len)
1277 return -1;
1278 submodule = xstrndup(path, len);
1279 refs = get_ref_cache(submodule);
1280 free(submodule);
1282 retval = resolve_gitlink_ref_recursive(refs, refname, sha1, 0);
1283 return retval;
1287 * Return the ref_entry for the given refname from the packed
1288 * references. If it does not exist, return NULL.
1290 static struct ref_entry *get_packed_ref(const char *refname)
1292 return find_ref(get_packed_refs(&ref_cache), refname);
1296 * A loose ref file doesn't exist; check for a packed ref. The
1297 * options are forwarded from resolve_safe_unsafe().
1299 static const char *handle_missing_loose_ref(const char *refname,
1300 unsigned char *sha1,
1301 int reading,
1302 int *flag)
1304 struct ref_entry *entry;
1307 * The loose reference file does not exist; check for a packed
1308 * reference.
1310 entry = get_packed_ref(refname);
1311 if (entry) {
1312 hashcpy(sha1, entry->u.value.sha1);
1313 if (flag)
1314 *flag |= REF_ISPACKED;
1315 return refname;
1317 /* The reference is not a packed reference, either. */
1318 if (reading) {
1319 return NULL;
1320 } else {
1321 hashclr(sha1);
1322 return refname;
1326 const char *resolve_ref_unsafe(const char *refname, unsigned char *sha1, int reading, int *flag)
1328 int depth = MAXDEPTH;
1329 ssize_t len;
1330 char buffer[256];
1331 static char refname_buffer[256];
1333 if (flag)
1334 *flag = 0;
1336 if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL))
1337 return NULL;
1339 for (;;) {
1340 char path[PATH_MAX];
1341 struct stat st;
1342 char *buf;
1343 int fd;
1345 if (--depth < 0)
1346 return NULL;
1348 git_snpath(path, sizeof(path), "%s", refname);
1351 * We might have to loop back here to avoid a race
1352 * condition: first we lstat() the file, then we try
1353 * to read it as a link or as a file. But if somebody
1354 * changes the type of the file (file <-> directory
1355 * <-> symlink) between the lstat() and reading, then
1356 * we don't want to report that as an error but rather
1357 * try again starting with the lstat().
1359 stat_ref:
1360 if (lstat(path, &st) < 0) {
1361 if (errno == ENOENT)
1362 return handle_missing_loose_ref(refname, sha1,
1363 reading, flag);
1364 else
1365 return NULL;
1368 /* Follow "normalized" - ie "refs/.." symlinks by hand */
1369 if (S_ISLNK(st.st_mode)) {
1370 len = readlink(path, buffer, sizeof(buffer)-1);
1371 if (len < 0) {
1372 if (errno == ENOENT || errno == EINVAL)
1373 /* inconsistent with lstat; retry */
1374 goto stat_ref;
1375 else
1376 return NULL;
1378 buffer[len] = 0;
1379 if (starts_with(buffer, "refs/") &&
1380 !check_refname_format(buffer, 0)) {
1381 strcpy(refname_buffer, buffer);
1382 refname = refname_buffer;
1383 if (flag)
1384 *flag |= REF_ISSYMREF;
1385 continue;
1389 /* Is it a directory? */
1390 if (S_ISDIR(st.st_mode)) {
1391 errno = EISDIR;
1392 return NULL;
1396 * Anything else, just open it and try to use it as
1397 * a ref
1399 fd = open(path, O_RDONLY);
1400 if (fd < 0) {
1401 if (errno == ENOENT)
1402 /* inconsistent with lstat; retry */
1403 goto stat_ref;
1404 else
1405 return NULL;
1407 len = read_in_full(fd, buffer, sizeof(buffer)-1);
1408 close(fd);
1409 if (len < 0)
1410 return NULL;
1411 while (len && isspace(buffer[len-1]))
1412 len--;
1413 buffer[len] = '\0';
1416 * Is it a symbolic ref?
1418 if (!starts_with(buffer, "ref:")) {
1420 * Please note that FETCH_HEAD has a second
1421 * line containing other data.
1423 if (get_sha1_hex(buffer, sha1) ||
1424 (buffer[40] != '\0' && !isspace(buffer[40]))) {
1425 if (flag)
1426 *flag |= REF_ISBROKEN;
1427 return NULL;
1429 return refname;
1431 if (flag)
1432 *flag |= REF_ISSYMREF;
1433 buf = buffer + 4;
1434 while (isspace(*buf))
1435 buf++;
1436 if (check_refname_format(buf, REFNAME_ALLOW_ONELEVEL)) {
1437 if (flag)
1438 *flag |= REF_ISBROKEN;
1439 return NULL;
1441 refname = strcpy(refname_buffer, buf);
1445 char *resolve_refdup(const char *ref, unsigned char *sha1, int reading, int *flag)
1447 const char *ret = resolve_ref_unsafe(ref, sha1, reading, flag);
1448 return ret ? xstrdup(ret) : NULL;
1451 /* The argument to filter_refs */
1452 struct ref_filter {
1453 const char *pattern;
1454 each_ref_fn *fn;
1455 void *cb_data;
1458 int read_ref_full(const char *refname, unsigned char *sha1, int reading, int *flags)
1460 if (resolve_ref_unsafe(refname, sha1, reading, flags))
1461 return 0;
1462 return -1;
1465 int read_ref(const char *refname, unsigned char *sha1)
1467 return read_ref_full(refname, sha1, 1, NULL);
1470 int ref_exists(const char *refname)
1472 unsigned char sha1[20];
1473 return !!resolve_ref_unsafe(refname, sha1, 1, NULL);
1476 static int filter_refs(const char *refname, const unsigned char *sha1, int flags,
1477 void *data)
1479 struct ref_filter *filter = (struct ref_filter *)data;
1480 if (wildmatch(filter->pattern, refname, 0, NULL))
1481 return 0;
1482 return filter->fn(refname, sha1, flags, filter->cb_data);
1485 enum peel_status {
1486 /* object was peeled successfully: */
1487 PEEL_PEELED = 0,
1490 * object cannot be peeled because the named object (or an
1491 * object referred to by a tag in the peel chain), does not
1492 * exist.
1494 PEEL_INVALID = -1,
1496 /* object cannot be peeled because it is not a tag: */
1497 PEEL_NON_TAG = -2,
1499 /* ref_entry contains no peeled value because it is a symref: */
1500 PEEL_IS_SYMREF = -3,
1503 * ref_entry cannot be peeled because it is broken (i.e., the
1504 * symbolic reference cannot even be resolved to an object
1505 * name):
1507 PEEL_BROKEN = -4
1511 * Peel the named object; i.e., if the object is a tag, resolve the
1512 * tag recursively until a non-tag is found. If successful, store the
1513 * result to sha1 and return PEEL_PEELED. If the object is not a tag
1514 * or is not valid, return PEEL_NON_TAG or PEEL_INVALID, respectively,
1515 * and leave sha1 unchanged.
1517 static enum peel_status peel_object(const unsigned char *name, unsigned char *sha1)
1519 struct object *o = lookup_unknown_object(name);
1521 if (o->type == OBJ_NONE) {
1522 int type = sha1_object_info(name, NULL);
1523 if (type < 0 || !object_as_type(o, type, 0))
1524 return PEEL_INVALID;
1527 if (o->type != OBJ_TAG)
1528 return PEEL_NON_TAG;
1530 o = deref_tag_noverify(o);
1531 if (!o)
1532 return PEEL_INVALID;
1534 hashcpy(sha1, o->sha1);
1535 return PEEL_PEELED;
1539 * Peel the entry (if possible) and return its new peel_status. If
1540 * repeel is true, re-peel the entry even if there is an old peeled
1541 * value that is already stored in it.
1543 * It is OK to call this function with a packed reference entry that
1544 * might be stale and might even refer to an object that has since
1545 * been garbage-collected. In such a case, if the entry has
1546 * REF_KNOWS_PEELED then leave the status unchanged and return
1547 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.
1549 static enum peel_status peel_entry(struct ref_entry *entry, int repeel)
1551 enum peel_status status;
1553 if (entry->flag & REF_KNOWS_PEELED) {
1554 if (repeel) {
1555 entry->flag &= ~REF_KNOWS_PEELED;
1556 hashclr(entry->u.value.peeled);
1557 } else {
1558 return is_null_sha1(entry->u.value.peeled) ?
1559 PEEL_NON_TAG : PEEL_PEELED;
1562 if (entry->flag & REF_ISBROKEN)
1563 return PEEL_BROKEN;
1564 if (entry->flag & REF_ISSYMREF)
1565 return PEEL_IS_SYMREF;
1567 status = peel_object(entry->u.value.sha1, entry->u.value.peeled);
1568 if (status == PEEL_PEELED || status == PEEL_NON_TAG)
1569 entry->flag |= REF_KNOWS_PEELED;
1570 return status;
1573 int peel_ref(const char *refname, unsigned char *sha1)
1575 int flag;
1576 unsigned char base[20];
1578 if (current_ref && (current_ref->name == refname
1579 || !strcmp(current_ref->name, refname))) {
1580 if (peel_entry(current_ref, 0))
1581 return -1;
1582 hashcpy(sha1, current_ref->u.value.peeled);
1583 return 0;
1586 if (read_ref_full(refname, base, 1, &flag))
1587 return -1;
1590 * If the reference is packed, read its ref_entry from the
1591 * cache in the hope that we already know its peeled value.
1592 * We only try this optimization on packed references because
1593 * (a) forcing the filling of the loose reference cache could
1594 * be expensive and (b) loose references anyway usually do not
1595 * have REF_KNOWS_PEELED.
1597 if (flag & REF_ISPACKED) {
1598 struct ref_entry *r = get_packed_ref(refname);
1599 if (r) {
1600 if (peel_entry(r, 0))
1601 return -1;
1602 hashcpy(sha1, r->u.value.peeled);
1603 return 0;
1607 return peel_object(base, sha1);
1610 struct warn_if_dangling_data {
1611 FILE *fp;
1612 const char *refname;
1613 const struct string_list *refnames;
1614 const char *msg_fmt;
1617 static int warn_if_dangling_symref(const char *refname, const unsigned char *sha1,
1618 int flags, void *cb_data)
1620 struct warn_if_dangling_data *d = cb_data;
1621 const char *resolves_to;
1622 unsigned char junk[20];
1624 if (!(flags & REF_ISSYMREF))
1625 return 0;
1627 resolves_to = resolve_ref_unsafe(refname, junk, 0, NULL);
1628 if (!resolves_to
1629 || (d->refname
1630 ? strcmp(resolves_to, d->refname)
1631 : !string_list_has_string(d->refnames, resolves_to))) {
1632 return 0;
1635 fprintf(d->fp, d->msg_fmt, refname);
1636 fputc('\n', d->fp);
1637 return 0;
1640 void warn_dangling_symref(FILE *fp, const char *msg_fmt, const char *refname)
1642 struct warn_if_dangling_data data;
1644 data.fp = fp;
1645 data.refname = refname;
1646 data.refnames = NULL;
1647 data.msg_fmt = msg_fmt;
1648 for_each_rawref(warn_if_dangling_symref, &data);
1651 void warn_dangling_symrefs(FILE *fp, const char *msg_fmt, const struct string_list *refnames)
1653 struct warn_if_dangling_data data;
1655 data.fp = fp;
1656 data.refname = NULL;
1657 data.refnames = refnames;
1658 data.msg_fmt = msg_fmt;
1659 for_each_rawref(warn_if_dangling_symref, &data);
1663 * Call fn for each reference in the specified ref_cache, omitting
1664 * references not in the containing_dir of base. fn is called for all
1665 * references, including broken ones. If fn ever returns a non-zero
1666 * value, stop the iteration and return that value; otherwise, return
1667 * 0.
1669 static int do_for_each_entry(struct ref_cache *refs, const char *base,
1670 each_ref_entry_fn fn, void *cb_data)
1672 struct packed_ref_cache *packed_ref_cache;
1673 struct ref_dir *loose_dir;
1674 struct ref_dir *packed_dir;
1675 int retval = 0;
1678 * We must make sure that all loose refs are read before accessing the
1679 * packed-refs file; this avoids a race condition in which loose refs
1680 * are migrated to the packed-refs file by a simultaneous process, but
1681 * our in-memory view is from before the migration. get_packed_ref_cache()
1682 * takes care of making sure our view is up to date with what is on
1683 * disk.
1685 loose_dir = get_loose_refs(refs);
1686 if (base && *base) {
1687 loose_dir = find_containing_dir(loose_dir, base, 0);
1689 if (loose_dir)
1690 prime_ref_dir(loose_dir);
1692 packed_ref_cache = get_packed_ref_cache(refs);
1693 acquire_packed_ref_cache(packed_ref_cache);
1694 packed_dir = get_packed_ref_dir(packed_ref_cache);
1695 if (base && *base) {
1696 packed_dir = find_containing_dir(packed_dir, base, 0);
1699 if (packed_dir && loose_dir) {
1700 sort_ref_dir(packed_dir);
1701 sort_ref_dir(loose_dir);
1702 retval = do_for_each_entry_in_dirs(
1703 packed_dir, loose_dir, fn, cb_data);
1704 } else if (packed_dir) {
1705 sort_ref_dir(packed_dir);
1706 retval = do_for_each_entry_in_dir(
1707 packed_dir, 0, fn, cb_data);
1708 } else if (loose_dir) {
1709 sort_ref_dir(loose_dir);
1710 retval = do_for_each_entry_in_dir(
1711 loose_dir, 0, fn, cb_data);
1714 release_packed_ref_cache(packed_ref_cache);
1715 return retval;
1719 * Call fn for each reference in the specified ref_cache for which the
1720 * refname begins with base. If trim is non-zero, then trim that many
1721 * characters off the beginning of each refname before passing the
1722 * refname to fn. flags can be DO_FOR_EACH_INCLUDE_BROKEN to include
1723 * broken references in the iteration. If fn ever returns a non-zero
1724 * value, stop the iteration and return that value; otherwise, return
1725 * 0.
1727 static int do_for_each_ref(struct ref_cache *refs, const char *base,
1728 each_ref_fn fn, int trim, int flags, void *cb_data)
1730 struct ref_entry_cb data;
1731 data.base = base;
1732 data.trim = trim;
1733 data.flags = flags;
1734 data.fn = fn;
1735 data.cb_data = cb_data;
1737 return do_for_each_entry(refs, base, do_one_ref, &data);
1740 static int do_head_ref(const char *submodule, each_ref_fn fn, void *cb_data)
1742 unsigned char sha1[20];
1743 int flag;
1745 if (submodule) {
1746 if (resolve_gitlink_ref(submodule, "HEAD", sha1) == 0)
1747 return fn("HEAD", sha1, 0, cb_data);
1749 return 0;
1752 if (!read_ref_full("HEAD", sha1, 1, &flag))
1753 return fn("HEAD", sha1, flag, cb_data);
1755 return 0;
1758 int head_ref(each_ref_fn fn, void *cb_data)
1760 return do_head_ref(NULL, fn, cb_data);
1763 int head_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
1765 return do_head_ref(submodule, fn, cb_data);
1768 int for_each_ref(each_ref_fn fn, void *cb_data)
1770 return do_for_each_ref(&ref_cache, "", fn, 0, 0, cb_data);
1773 int for_each_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
1775 return do_for_each_ref(get_ref_cache(submodule), "", fn, 0, 0, cb_data);
1778 int for_each_ref_in(const char *prefix, each_ref_fn fn, void *cb_data)
1780 return do_for_each_ref(&ref_cache, prefix, fn, strlen(prefix), 0, cb_data);
1783 int for_each_ref_in_submodule(const char *submodule, const char *prefix,
1784 each_ref_fn fn, void *cb_data)
1786 return do_for_each_ref(get_ref_cache(submodule), prefix, fn, strlen(prefix), 0, cb_data);
1789 int for_each_tag_ref(each_ref_fn fn, void *cb_data)
1791 return for_each_ref_in("refs/tags/", fn, cb_data);
1794 int for_each_tag_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
1796 return for_each_ref_in_submodule(submodule, "refs/tags/", fn, cb_data);
1799 int for_each_branch_ref(each_ref_fn fn, void *cb_data)
1801 return for_each_ref_in("refs/heads/", fn, cb_data);
1804 int for_each_branch_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
1806 return for_each_ref_in_submodule(submodule, "refs/heads/", fn, cb_data);
1809 int for_each_remote_ref(each_ref_fn fn, void *cb_data)
1811 return for_each_ref_in("refs/remotes/", fn, cb_data);
1814 int for_each_remote_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
1816 return for_each_ref_in_submodule(submodule, "refs/remotes/", fn, cb_data);
1819 int for_each_replace_ref(each_ref_fn fn, void *cb_data)
1821 return do_for_each_ref(&ref_cache, "refs/replace/", fn, 13, 0, cb_data);
1824 int head_ref_namespaced(each_ref_fn fn, void *cb_data)
1826 struct strbuf buf = STRBUF_INIT;
1827 int ret = 0;
1828 unsigned char sha1[20];
1829 int flag;
1831 strbuf_addf(&buf, "%sHEAD", get_git_namespace());
1832 if (!read_ref_full(buf.buf, sha1, 1, &flag))
1833 ret = fn(buf.buf, sha1, flag, cb_data);
1834 strbuf_release(&buf);
1836 return ret;
1839 int for_each_namespaced_ref(each_ref_fn fn, void *cb_data)
1841 struct strbuf buf = STRBUF_INIT;
1842 int ret;
1843 strbuf_addf(&buf, "%srefs/", get_git_namespace());
1844 ret = do_for_each_ref(&ref_cache, buf.buf, fn, 0, 0, cb_data);
1845 strbuf_release(&buf);
1846 return ret;
1849 int for_each_glob_ref_in(each_ref_fn fn, const char *pattern,
1850 const char *prefix, void *cb_data)
1852 struct strbuf real_pattern = STRBUF_INIT;
1853 struct ref_filter filter;
1854 int ret;
1856 if (!prefix && !starts_with(pattern, "refs/"))
1857 strbuf_addstr(&real_pattern, "refs/");
1858 else if (prefix)
1859 strbuf_addstr(&real_pattern, prefix);
1860 strbuf_addstr(&real_pattern, pattern);
1862 if (!has_glob_specials(pattern)) {
1863 /* Append implied '/' '*' if not present. */
1864 if (real_pattern.buf[real_pattern.len - 1] != '/')
1865 strbuf_addch(&real_pattern, '/');
1866 /* No need to check for '*', there is none. */
1867 strbuf_addch(&real_pattern, '*');
1870 filter.pattern = real_pattern.buf;
1871 filter.fn = fn;
1872 filter.cb_data = cb_data;
1873 ret = for_each_ref(filter_refs, &filter);
1875 strbuf_release(&real_pattern);
1876 return ret;
1879 int for_each_glob_ref(each_ref_fn fn, const char *pattern, void *cb_data)
1881 return for_each_glob_ref_in(fn, pattern, NULL, cb_data);
1884 int for_each_rawref(each_ref_fn fn, void *cb_data)
1886 return do_for_each_ref(&ref_cache, "", fn, 0,
1887 DO_FOR_EACH_INCLUDE_BROKEN, cb_data);
1890 const char *prettify_refname(const char *name)
1892 return name + (
1893 starts_with(name, "refs/heads/") ? 11 :
1894 starts_with(name, "refs/tags/") ? 10 :
1895 starts_with(name, "refs/remotes/") ? 13 :
1899 static const char *ref_rev_parse_rules[] = {
1900 "%.*s",
1901 "refs/%.*s",
1902 "refs/tags/%.*s",
1903 "refs/heads/%.*s",
1904 "refs/remotes/%.*s",
1905 "refs/remotes/%.*s/HEAD",
1906 NULL
1909 int refname_match(const char *abbrev_name, const char *full_name)
1911 const char **p;
1912 const int abbrev_name_len = strlen(abbrev_name);
1914 for (p = ref_rev_parse_rules; *p; p++) {
1915 if (!strcmp(full_name, mkpath(*p, abbrev_name_len, abbrev_name))) {
1916 return 1;
1920 return 0;
1923 static struct ref_lock *verify_lock(struct ref_lock *lock,
1924 const unsigned char *old_sha1, int mustexist)
1926 if (read_ref_full(lock->ref_name, lock->old_sha1, mustexist, NULL)) {
1927 error("Can't verify ref %s", lock->ref_name);
1928 unlock_ref(lock);
1929 return NULL;
1931 if (hashcmp(lock->old_sha1, old_sha1)) {
1932 error("Ref %s is at %s but expected %s", lock->ref_name,
1933 sha1_to_hex(lock->old_sha1), sha1_to_hex(old_sha1));
1934 unlock_ref(lock);
1935 return NULL;
1937 return lock;
1940 static int remove_empty_directories(const char *file)
1942 /* we want to create a file but there is a directory there;
1943 * if that is an empty directory (or a directory that contains
1944 * only empty directories), remove them.
1946 struct strbuf path;
1947 int result;
1949 strbuf_init(&path, 20);
1950 strbuf_addstr(&path, file);
1952 result = remove_dir_recursively(&path, REMOVE_DIR_EMPTY_ONLY);
1954 strbuf_release(&path);
1956 return result;
1960 * *string and *len will only be substituted, and *string returned (for
1961 * later free()ing) if the string passed in is a magic short-hand form
1962 * to name a branch.
1964 static char *substitute_branch_name(const char **string, int *len)
1966 struct strbuf buf = STRBUF_INIT;
1967 int ret = interpret_branch_name(*string, *len, &buf);
1969 if (ret == *len) {
1970 size_t size;
1971 *string = strbuf_detach(&buf, &size);
1972 *len = size;
1973 return (char *)*string;
1976 return NULL;
1979 int dwim_ref(const char *str, int len, unsigned char *sha1, char **ref)
1981 char *last_branch = substitute_branch_name(&str, &len);
1982 const char **p, *r;
1983 int refs_found = 0;
1985 *ref = NULL;
1986 for (p = ref_rev_parse_rules; *p; p++) {
1987 char fullref[PATH_MAX];
1988 unsigned char sha1_from_ref[20];
1989 unsigned char *this_result;
1990 int flag;
1992 this_result = refs_found ? sha1_from_ref : sha1;
1993 mksnpath(fullref, sizeof(fullref), *p, len, str);
1994 r = resolve_ref_unsafe(fullref, this_result, 1, &flag);
1995 if (r) {
1996 if (!refs_found++)
1997 *ref = xstrdup(r);
1998 if (!warn_ambiguous_refs)
1999 break;
2000 } else if ((flag & REF_ISSYMREF) && strcmp(fullref, "HEAD")) {
2001 warning("ignoring dangling symref %s.", fullref);
2002 } else if ((flag & REF_ISBROKEN) && strchr(fullref, '/')) {
2003 warning("ignoring broken ref %s.", fullref);
2006 free(last_branch);
2007 return refs_found;
2010 int dwim_log(const char *str, int len, unsigned char *sha1, char **log)
2012 char *last_branch = substitute_branch_name(&str, &len);
2013 const char **p;
2014 int logs_found = 0;
2016 *log = NULL;
2017 for (p = ref_rev_parse_rules; *p; p++) {
2018 struct stat st;
2019 unsigned char hash[20];
2020 char path[PATH_MAX];
2021 const char *ref, *it;
2023 mksnpath(path, sizeof(path), *p, len, str);
2024 ref = resolve_ref_unsafe(path, hash, 1, NULL);
2025 if (!ref)
2026 continue;
2027 if (!stat(git_path("logs/%s", path), &st) &&
2028 S_ISREG(st.st_mode))
2029 it = path;
2030 else if (strcmp(ref, path) &&
2031 !stat(git_path("logs/%s", ref), &st) &&
2032 S_ISREG(st.st_mode))
2033 it = ref;
2034 else
2035 continue;
2036 if (!logs_found++) {
2037 *log = xstrdup(it);
2038 hashcpy(sha1, hash);
2040 if (!warn_ambiguous_refs)
2041 break;
2043 free(last_branch);
2044 return logs_found;
2047 static struct ref_lock *lock_ref_sha1_basic(const char *refname,
2048 const unsigned char *old_sha1,
2049 int flags, int *type_p)
2051 char *ref_file;
2052 const char *orig_refname = refname;
2053 struct ref_lock *lock;
2054 int last_errno = 0;
2055 int type, lflags;
2056 int mustexist = (old_sha1 && !is_null_sha1(old_sha1));
2057 int missing = 0;
2058 int attempts_remaining = 3;
2060 lock = xcalloc(1, sizeof(struct ref_lock));
2061 lock->lock_fd = -1;
2063 refname = resolve_ref_unsafe(refname, lock->old_sha1, mustexist, &type);
2064 if (!refname && errno == EISDIR) {
2065 /* we are trying to lock foo but we used to
2066 * have foo/bar which now does not exist;
2067 * it is normal for the empty directory 'foo'
2068 * to remain.
2070 ref_file = git_path("%s", orig_refname);
2071 if (remove_empty_directories(ref_file)) {
2072 last_errno = errno;
2073 error("there are still refs under '%s'", orig_refname);
2074 goto error_return;
2076 refname = resolve_ref_unsafe(orig_refname, lock->old_sha1, mustexist, &type);
2078 if (type_p)
2079 *type_p = type;
2080 if (!refname) {
2081 last_errno = errno;
2082 error("unable to resolve reference %s: %s",
2083 orig_refname, strerror(errno));
2084 goto error_return;
2086 missing = is_null_sha1(lock->old_sha1);
2087 /* When the ref did not exist and we are creating it,
2088 * make sure there is no existing ref that is packed
2089 * whose name begins with our refname, nor a ref whose
2090 * name is a proper prefix of our refname.
2092 if (missing &&
2093 !is_refname_available(refname, NULL, get_packed_refs(&ref_cache))) {
2094 last_errno = ENOTDIR;
2095 goto error_return;
2098 lock->lk = xcalloc(1, sizeof(struct lock_file));
2100 lflags = 0;
2101 if (flags & REF_NODEREF) {
2102 refname = orig_refname;
2103 lflags |= LOCK_NODEREF;
2105 lock->ref_name = xstrdup(refname);
2106 lock->orig_ref_name = xstrdup(orig_refname);
2107 ref_file = git_path("%s", refname);
2108 if (missing)
2109 lock->force_write = 1;
2110 if ((flags & REF_NODEREF) && (type & REF_ISSYMREF))
2111 lock->force_write = 1;
2113 retry:
2114 switch (safe_create_leading_directories(ref_file)) {
2115 case SCLD_OK:
2116 break; /* success */
2117 case SCLD_VANISHED:
2118 if (--attempts_remaining > 0)
2119 goto retry;
2120 /* fall through */
2121 default:
2122 last_errno = errno;
2123 error("unable to create directory for %s", ref_file);
2124 goto error_return;
2127 lock->lock_fd = hold_lock_file_for_update(lock->lk, ref_file, lflags);
2128 if (lock->lock_fd < 0) {
2129 if (errno == ENOENT && --attempts_remaining > 0)
2131 * Maybe somebody just deleted one of the
2132 * directories leading to ref_file. Try
2133 * again:
2135 goto retry;
2136 else
2137 unable_to_lock_index_die(ref_file, errno);
2139 return old_sha1 ? verify_lock(lock, old_sha1, mustexist) : lock;
2141 error_return:
2142 unlock_ref(lock);
2143 errno = last_errno;
2144 return NULL;
2147 struct ref_lock *lock_ref_sha1(const char *refname, const unsigned char *old_sha1)
2149 char refpath[PATH_MAX];
2150 if (check_refname_format(refname, 0))
2151 return NULL;
2152 strcpy(refpath, mkpath("refs/%s", refname));
2153 return lock_ref_sha1_basic(refpath, old_sha1, 0, NULL);
2156 struct ref_lock *lock_any_ref_for_update(const char *refname,
2157 const unsigned char *old_sha1,
2158 int flags, int *type_p)
2160 if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL))
2161 return NULL;
2162 return lock_ref_sha1_basic(refname, old_sha1, flags, type_p);
2166 * Write an entry to the packed-refs file for the specified refname.
2167 * If peeled is non-NULL, write it as the entry's peeled value.
2169 static void write_packed_entry(int fd, char *refname, unsigned char *sha1,
2170 unsigned char *peeled)
2172 char line[PATH_MAX + 100];
2173 int len;
2175 len = snprintf(line, sizeof(line), "%s %s\n",
2176 sha1_to_hex(sha1), refname);
2177 /* this should not happen but just being defensive */
2178 if (len > sizeof(line))
2179 die("too long a refname '%s'", refname);
2180 write_or_die(fd, line, len);
2182 if (peeled) {
2183 if (snprintf(line, sizeof(line), "^%s\n",
2184 sha1_to_hex(peeled)) != PEELED_LINE_LENGTH)
2185 die("internal error");
2186 write_or_die(fd, line, PEELED_LINE_LENGTH);
2191 * An each_ref_entry_fn that writes the entry to a packed-refs file.
2193 static int write_packed_entry_fn(struct ref_entry *entry, void *cb_data)
2195 int *fd = cb_data;
2196 enum peel_status peel_status = peel_entry(entry, 0);
2198 if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)
2199 error("internal error: %s is not a valid packed reference!",
2200 entry->name);
2201 write_packed_entry(*fd, entry->name, entry->u.value.sha1,
2202 peel_status == PEEL_PEELED ?
2203 entry->u.value.peeled : NULL);
2204 return 0;
2207 int lock_packed_refs(int flags)
2209 struct packed_ref_cache *packed_ref_cache;
2211 if (hold_lock_file_for_update(&packlock, git_path("packed-refs"), flags) < 0)
2212 return -1;
2214 * Get the current packed-refs while holding the lock. If the
2215 * packed-refs file has been modified since we last read it,
2216 * this will automatically invalidate the cache and re-read
2217 * the packed-refs file.
2219 packed_ref_cache = get_packed_ref_cache(&ref_cache);
2220 packed_ref_cache->lock = &packlock;
2221 /* Increment the reference count to prevent it from being freed: */
2222 acquire_packed_ref_cache(packed_ref_cache);
2223 return 0;
2226 int commit_packed_refs(void)
2228 struct packed_ref_cache *packed_ref_cache =
2229 get_packed_ref_cache(&ref_cache);
2230 int error = 0;
2232 if (!packed_ref_cache->lock)
2233 die("internal error: packed-refs not locked");
2234 write_or_die(packed_ref_cache->lock->fd,
2235 PACKED_REFS_HEADER, strlen(PACKED_REFS_HEADER));
2237 do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache),
2238 0, write_packed_entry_fn,
2239 &packed_ref_cache->lock->fd);
2240 if (commit_lock_file(packed_ref_cache->lock))
2241 error = -1;
2242 packed_ref_cache->lock = NULL;
2243 release_packed_ref_cache(packed_ref_cache);
2244 return error;
2247 void rollback_packed_refs(void)
2249 struct packed_ref_cache *packed_ref_cache =
2250 get_packed_ref_cache(&ref_cache);
2252 if (!packed_ref_cache->lock)
2253 die("internal error: packed-refs not locked");
2254 rollback_lock_file(packed_ref_cache->lock);
2255 packed_ref_cache->lock = NULL;
2256 release_packed_ref_cache(packed_ref_cache);
2257 clear_packed_ref_cache(&ref_cache);
2260 struct ref_to_prune {
2261 struct ref_to_prune *next;
2262 unsigned char sha1[20];
2263 char name[FLEX_ARRAY];
2266 struct pack_refs_cb_data {
2267 unsigned int flags;
2268 struct ref_dir *packed_refs;
2269 struct ref_to_prune *ref_to_prune;
2273 * An each_ref_entry_fn that is run over loose references only. If
2274 * the loose reference can be packed, add an entry in the packed ref
2275 * cache. If the reference should be pruned, also add it to
2276 * ref_to_prune in the pack_refs_cb_data.
2278 static int pack_if_possible_fn(struct ref_entry *entry, void *cb_data)
2280 struct pack_refs_cb_data *cb = cb_data;
2281 enum peel_status peel_status;
2282 struct ref_entry *packed_entry;
2283 int is_tag_ref = starts_with(entry->name, "refs/tags/");
2285 /* ALWAYS pack tags */
2286 if (!(cb->flags & PACK_REFS_ALL) && !is_tag_ref)
2287 return 0;
2289 /* Do not pack symbolic or broken refs: */
2290 if ((entry->flag & REF_ISSYMREF) || !ref_resolves_to_object(entry))
2291 return 0;
2293 /* Add a packed ref cache entry equivalent to the loose entry. */
2294 peel_status = peel_entry(entry, 1);
2295 if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)
2296 die("internal error peeling reference %s (%s)",
2297 entry->name, sha1_to_hex(entry->u.value.sha1));
2298 packed_entry = find_ref(cb->packed_refs, entry->name);
2299 if (packed_entry) {
2300 /* Overwrite existing packed entry with info from loose entry */
2301 packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED;
2302 hashcpy(packed_entry->u.value.sha1, entry->u.value.sha1);
2303 } else {
2304 packed_entry = create_ref_entry(entry->name, entry->u.value.sha1,
2305 REF_ISPACKED | REF_KNOWS_PEELED, 0);
2306 add_ref(cb->packed_refs, packed_entry);
2308 hashcpy(packed_entry->u.value.peeled, entry->u.value.peeled);
2310 /* Schedule the loose reference for pruning if requested. */
2311 if ((cb->flags & PACK_REFS_PRUNE)) {
2312 int namelen = strlen(entry->name) + 1;
2313 struct ref_to_prune *n = xcalloc(1, sizeof(*n) + namelen);
2314 hashcpy(n->sha1, entry->u.value.sha1);
2315 strcpy(n->name, entry->name);
2316 n->next = cb->ref_to_prune;
2317 cb->ref_to_prune = n;
2319 return 0;
2323 * Remove empty parents, but spare refs/ and immediate subdirs.
2324 * Note: munges *name.
2326 static void try_remove_empty_parents(char *name)
2328 char *p, *q;
2329 int i;
2330 p = name;
2331 for (i = 0; i < 2; i++) { /* refs/{heads,tags,...}/ */
2332 while (*p && *p != '/')
2333 p++;
2334 /* tolerate duplicate slashes; see check_refname_format() */
2335 while (*p == '/')
2336 p++;
2338 for (q = p; *q; q++)
2340 while (1) {
2341 while (q > p && *q != '/')
2342 q--;
2343 while (q > p && *(q-1) == '/')
2344 q--;
2345 if (q == p)
2346 break;
2347 *q = '\0';
2348 if (rmdir(git_path("%s", name)))
2349 break;
2353 /* make sure nobody touched the ref, and unlink */
2354 static void prune_ref(struct ref_to_prune *r)
2356 struct ref_lock *lock = lock_ref_sha1(r->name + 5, r->sha1);
2358 if (lock) {
2359 unlink_or_warn(git_path("%s", r->name));
2360 unlock_ref(lock);
2361 try_remove_empty_parents(r->name);
2365 static void prune_refs(struct ref_to_prune *r)
2367 while (r) {
2368 prune_ref(r);
2369 r = r->next;
2373 int pack_refs(unsigned int flags)
2375 struct pack_refs_cb_data cbdata;
2377 memset(&cbdata, 0, sizeof(cbdata));
2378 cbdata.flags = flags;
2380 lock_packed_refs(LOCK_DIE_ON_ERROR);
2381 cbdata.packed_refs = get_packed_refs(&ref_cache);
2383 do_for_each_entry_in_dir(get_loose_refs(&ref_cache), 0,
2384 pack_if_possible_fn, &cbdata);
2386 if (commit_packed_refs())
2387 die_errno("unable to overwrite old ref-pack file");
2389 prune_refs(cbdata.ref_to_prune);
2390 return 0;
2394 * If entry is no longer needed in packed-refs, add it to the string
2395 * list pointed to by cb_data. Reasons for deleting entries:
2397 * - Entry is broken.
2398 * - Entry is overridden by a loose ref.
2399 * - Entry does not point at a valid object.
2401 * In the first and third cases, also emit an error message because these
2402 * are indications of repository corruption.
2404 static int curate_packed_ref_fn(struct ref_entry *entry, void *cb_data)
2406 struct string_list *refs_to_delete = cb_data;
2408 if (entry->flag & REF_ISBROKEN) {
2409 /* This shouldn't happen to packed refs. */
2410 error("%s is broken!", entry->name);
2411 string_list_append(refs_to_delete, entry->name);
2412 return 0;
2414 if (!has_sha1_file(entry->u.value.sha1)) {
2415 unsigned char sha1[20];
2416 int flags;
2418 if (read_ref_full(entry->name, sha1, 0, &flags))
2419 /* We should at least have found the packed ref. */
2420 die("Internal error");
2421 if ((flags & REF_ISSYMREF) || !(flags & REF_ISPACKED)) {
2423 * This packed reference is overridden by a
2424 * loose reference, so it is OK that its value
2425 * is no longer valid; for example, it might
2426 * refer to an object that has been garbage
2427 * collected. For this purpose we don't even
2428 * care whether the loose reference itself is
2429 * invalid, broken, symbolic, etc. Silently
2430 * remove the packed reference.
2432 string_list_append(refs_to_delete, entry->name);
2433 return 0;
2436 * There is no overriding loose reference, so the fact
2437 * that this reference doesn't refer to a valid object
2438 * indicates some kind of repository corruption.
2439 * Report the problem, then omit the reference from
2440 * the output.
2442 error("%s does not point to a valid object!", entry->name);
2443 string_list_append(refs_to_delete, entry->name);
2444 return 0;
2447 return 0;
2450 int repack_without_refs(const char **refnames, int n)
2452 struct ref_dir *packed;
2453 struct string_list refs_to_delete = STRING_LIST_INIT_DUP;
2454 struct string_list_item *ref_to_delete;
2455 int i, removed = 0;
2457 /* Look for a packed ref */
2458 for (i = 0; i < n; i++)
2459 if (get_packed_ref(refnames[i]))
2460 break;
2462 /* Avoid locking if we have nothing to do */
2463 if (i == n)
2464 return 0; /* no refname exists in packed refs */
2466 if (lock_packed_refs(0)) {
2467 unable_to_lock_error(git_path("packed-refs"), errno);
2468 return error("cannot delete '%s' from packed refs", refnames[i]);
2470 packed = get_packed_refs(&ref_cache);
2472 /* Remove refnames from the cache */
2473 for (i = 0; i < n; i++)
2474 if (remove_entry(packed, refnames[i]) != -1)
2475 removed = 1;
2476 if (!removed) {
2478 * All packed entries disappeared while we were
2479 * acquiring the lock.
2481 rollback_packed_refs();
2482 return 0;
2485 /* Remove any other accumulated cruft */
2486 do_for_each_entry_in_dir(packed, 0, curate_packed_ref_fn, &refs_to_delete);
2487 for_each_string_list_item(ref_to_delete, &refs_to_delete) {
2488 if (remove_entry(packed, ref_to_delete->string) == -1)
2489 die("internal error");
2492 /* Write what remains */
2493 return commit_packed_refs();
2496 static int repack_without_ref(const char *refname)
2498 return repack_without_refs(&refname, 1);
2501 static int delete_ref_loose(struct ref_lock *lock, int flag)
2503 if (!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) {
2504 /* loose */
2505 int err, i = strlen(lock->lk->filename) - 5; /* .lock */
2507 lock->lk->filename[i] = 0;
2508 err = unlink_or_warn(lock->lk->filename);
2509 lock->lk->filename[i] = '.';
2510 if (err && errno != ENOENT)
2511 return 1;
2513 return 0;
2516 int delete_ref(const char *refname, const unsigned char *sha1, int delopt)
2518 struct ref_lock *lock;
2519 int ret = 0, flag = 0;
2521 lock = lock_ref_sha1_basic(refname, sha1, delopt, &flag);
2522 if (!lock)
2523 return 1;
2524 ret |= delete_ref_loose(lock, flag);
2526 /* removing the loose one could have resurrected an earlier
2527 * packed one. Also, if it was not loose we need to repack
2528 * without it.
2530 ret |= repack_without_ref(lock->ref_name);
2532 unlink_or_warn(git_path("logs/%s", lock->ref_name));
2533 clear_loose_ref_cache(&ref_cache);
2534 unlock_ref(lock);
2535 return ret;
2539 * People using contrib's git-new-workdir have .git/logs/refs ->
2540 * /some/other/path/.git/logs/refs, and that may live on another device.
2542 * IOW, to avoid cross device rename errors, the temporary renamed log must
2543 * live into logs/refs.
2545 #define TMP_RENAMED_LOG "logs/refs/.tmp-renamed-log"
2547 static int rename_tmp_log(const char *newrefname)
2549 int attempts_remaining = 4;
2551 retry:
2552 switch (safe_create_leading_directories(git_path("logs/%s", newrefname))) {
2553 case SCLD_OK:
2554 break; /* success */
2555 case SCLD_VANISHED:
2556 if (--attempts_remaining > 0)
2557 goto retry;
2558 /* fall through */
2559 default:
2560 error("unable to create directory for %s", newrefname);
2561 return -1;
2564 if (rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", newrefname))) {
2565 if ((errno==EISDIR || errno==ENOTDIR) && --attempts_remaining > 0) {
2567 * rename(a, b) when b is an existing
2568 * directory ought to result in ISDIR, but
2569 * Solaris 5.8 gives ENOTDIR. Sheesh.
2571 if (remove_empty_directories(git_path("logs/%s", newrefname))) {
2572 error("Directory not empty: logs/%s", newrefname);
2573 return -1;
2575 goto retry;
2576 } else if (errno == ENOENT && --attempts_remaining > 0) {
2578 * Maybe another process just deleted one of
2579 * the directories in the path to newrefname.
2580 * Try again from the beginning.
2582 goto retry;
2583 } else {
2584 error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s: %s",
2585 newrefname, strerror(errno));
2586 return -1;
2589 return 0;
2592 int rename_ref(const char *oldrefname, const char *newrefname, const char *logmsg)
2594 unsigned char sha1[20], orig_sha1[20];
2595 int flag = 0, logmoved = 0;
2596 struct ref_lock *lock;
2597 struct stat loginfo;
2598 int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);
2599 const char *symref = NULL;
2601 if (log && S_ISLNK(loginfo.st_mode))
2602 return error("reflog for %s is a symlink", oldrefname);
2604 symref = resolve_ref_unsafe(oldrefname, orig_sha1, 1, &flag);
2605 if (flag & REF_ISSYMREF)
2606 return error("refname %s is a symbolic ref, renaming it is not supported",
2607 oldrefname);
2608 if (!symref)
2609 return error("refname %s not found", oldrefname);
2611 if (!is_refname_available(newrefname, oldrefname, get_packed_refs(&ref_cache)))
2612 return 1;
2614 if (!is_refname_available(newrefname, oldrefname, get_loose_refs(&ref_cache)))
2615 return 1;
2617 if (log && rename(git_path("logs/%s", oldrefname), git_path(TMP_RENAMED_LOG)))
2618 return error("unable to move logfile logs/%s to "TMP_RENAMED_LOG": %s",
2619 oldrefname, strerror(errno));
2621 if (delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {
2622 error("unable to delete old %s", oldrefname);
2623 goto rollback;
2626 if (!read_ref_full(newrefname, sha1, 1, &flag) &&
2627 delete_ref(newrefname, sha1, REF_NODEREF)) {
2628 if (errno==EISDIR) {
2629 if (remove_empty_directories(git_path("%s", newrefname))) {
2630 error("Directory not empty: %s", newrefname);
2631 goto rollback;
2633 } else {
2634 error("unable to delete existing %s", newrefname);
2635 goto rollback;
2639 if (log && rename_tmp_log(newrefname))
2640 goto rollback;
2642 logmoved = log;
2644 lock = lock_ref_sha1_basic(newrefname, NULL, 0, NULL);
2645 if (!lock) {
2646 error("unable to lock %s for update", newrefname);
2647 goto rollback;
2649 lock->force_write = 1;
2650 hashcpy(lock->old_sha1, orig_sha1);
2651 if (write_ref_sha1(lock, orig_sha1, logmsg)) {
2652 error("unable to write current sha1 into %s", newrefname);
2653 goto rollback;
2656 return 0;
2658 rollback:
2659 lock = lock_ref_sha1_basic(oldrefname, NULL, 0, NULL);
2660 if (!lock) {
2661 error("unable to lock %s for rollback", oldrefname);
2662 goto rollbacklog;
2665 lock->force_write = 1;
2666 flag = log_all_ref_updates;
2667 log_all_ref_updates = 0;
2668 if (write_ref_sha1(lock, orig_sha1, NULL))
2669 error("unable to write current sha1 into %s", oldrefname);
2670 log_all_ref_updates = flag;
2672 rollbacklog:
2673 if (logmoved && rename(git_path("logs/%s", newrefname), git_path("logs/%s", oldrefname)))
2674 error("unable to restore logfile %s from %s: %s",
2675 oldrefname, newrefname, strerror(errno));
2676 if (!logmoved && log &&
2677 rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", oldrefname)))
2678 error("unable to restore logfile %s from "TMP_RENAMED_LOG": %s",
2679 oldrefname, strerror(errno));
2681 return 1;
2684 int close_ref(struct ref_lock *lock)
2686 if (close_lock_file(lock->lk))
2687 return -1;
2688 lock->lock_fd = -1;
2689 return 0;
2692 int commit_ref(struct ref_lock *lock)
2694 if (commit_lock_file(lock->lk))
2695 return -1;
2696 lock->lock_fd = -1;
2697 return 0;
2700 void unlock_ref(struct ref_lock *lock)
2702 /* Do not free lock->lk -- atexit() still looks at them */
2703 if (lock->lk)
2704 rollback_lock_file(lock->lk);
2705 free(lock->ref_name);
2706 free(lock->orig_ref_name);
2707 free(lock);
2711 * copy the reflog message msg to buf, which has been allocated sufficiently
2712 * large, while cleaning up the whitespaces. Especially, convert LF to space,
2713 * because reflog file is one line per entry.
2715 static int copy_msg(char *buf, const char *msg)
2717 char *cp = buf;
2718 char c;
2719 int wasspace = 1;
2721 *cp++ = '\t';
2722 while ((c = *msg++)) {
2723 if (wasspace && isspace(c))
2724 continue;
2725 wasspace = isspace(c);
2726 if (wasspace)
2727 c = ' ';
2728 *cp++ = c;
2730 while (buf < cp && isspace(cp[-1]))
2731 cp--;
2732 *cp++ = '\n';
2733 return cp - buf;
2736 int log_ref_setup(const char *refname, char *logfile, int bufsize)
2738 int logfd, oflags = O_APPEND | O_WRONLY;
2740 git_snpath(logfile, bufsize, "logs/%s", refname);
2741 if (log_all_ref_updates &&
2742 (starts_with(refname, "refs/heads/") ||
2743 starts_with(refname, "refs/remotes/") ||
2744 starts_with(refname, "refs/notes/") ||
2745 !strcmp(refname, "HEAD"))) {
2746 if (safe_create_leading_directories(logfile) < 0)
2747 return error("unable to create directory for %s",
2748 logfile);
2749 oflags |= O_CREAT;
2752 logfd = open(logfile, oflags, 0666);
2753 if (logfd < 0) {
2754 if (!(oflags & O_CREAT) && errno == ENOENT)
2755 return 0;
2757 if ((oflags & O_CREAT) && errno == EISDIR) {
2758 if (remove_empty_directories(logfile)) {
2759 return error("There are still logs under '%s'",
2760 logfile);
2762 logfd = open(logfile, oflags, 0666);
2765 if (logfd < 0)
2766 return error("Unable to append to %s: %s",
2767 logfile, strerror(errno));
2770 adjust_shared_perm(logfile);
2771 close(logfd);
2772 return 0;
2775 static int log_ref_write(const char *refname, const unsigned char *old_sha1,
2776 const unsigned char *new_sha1, const char *msg)
2778 int logfd, result, written, oflags = O_APPEND | O_WRONLY;
2779 unsigned maxlen, len;
2780 int msglen;
2781 char log_file[PATH_MAX];
2782 char *logrec;
2783 const char *committer;
2785 if (log_all_ref_updates < 0)
2786 log_all_ref_updates = !is_bare_repository();
2788 result = log_ref_setup(refname, log_file, sizeof(log_file));
2789 if (result)
2790 return result;
2792 logfd = open(log_file, oflags);
2793 if (logfd < 0)
2794 return 0;
2795 msglen = msg ? strlen(msg) : 0;
2796 committer = git_committer_info(0);
2797 maxlen = strlen(committer) + msglen + 100;
2798 logrec = xmalloc(maxlen);
2799 len = sprintf(logrec, "%s %s %s\n",
2800 sha1_to_hex(old_sha1),
2801 sha1_to_hex(new_sha1),
2802 committer);
2803 if (msglen)
2804 len += copy_msg(logrec + len - 1, msg) - 1;
2805 written = len <= maxlen ? write_in_full(logfd, logrec, len) : -1;
2806 free(logrec);
2807 if (close(logfd) != 0 || written != len)
2808 return error("Unable to append to %s", log_file);
2809 return 0;
2812 static int is_branch(const char *refname)
2814 return !strcmp(refname, "HEAD") || starts_with(refname, "refs/heads/");
2817 int write_ref_sha1(struct ref_lock *lock,
2818 const unsigned char *sha1, const char *logmsg)
2820 static char term = '\n';
2821 struct object *o;
2823 if (!lock)
2824 return -1;
2825 if (!lock->force_write && !hashcmp(lock->old_sha1, sha1)) {
2826 unlock_ref(lock);
2827 return 0;
2829 o = parse_object(sha1);
2830 if (!o) {
2831 error("Trying to write ref %s with nonexistent object %s",
2832 lock->ref_name, sha1_to_hex(sha1));
2833 unlock_ref(lock);
2834 return -1;
2836 if (o->type != OBJ_COMMIT && is_branch(lock->ref_name)) {
2837 error("Trying to write non-commit object %s to branch %s",
2838 sha1_to_hex(sha1), lock->ref_name);
2839 unlock_ref(lock);
2840 return -1;
2842 if (write_in_full(lock->lock_fd, sha1_to_hex(sha1), 40) != 40 ||
2843 write_in_full(lock->lock_fd, &term, 1) != 1
2844 || close_ref(lock) < 0) {
2845 error("Couldn't write %s", lock->lk->filename);
2846 unlock_ref(lock);
2847 return -1;
2849 clear_loose_ref_cache(&ref_cache);
2850 if (log_ref_write(lock->ref_name, lock->old_sha1, sha1, logmsg) < 0 ||
2851 (strcmp(lock->ref_name, lock->orig_ref_name) &&
2852 log_ref_write(lock->orig_ref_name, lock->old_sha1, sha1, logmsg) < 0)) {
2853 unlock_ref(lock);
2854 return -1;
2856 if (strcmp(lock->orig_ref_name, "HEAD") != 0) {
2858 * Special hack: If a branch is updated directly and HEAD
2859 * points to it (may happen on the remote side of a push
2860 * for example) then logically the HEAD reflog should be
2861 * updated too.
2862 * A generic solution implies reverse symref information,
2863 * but finding all symrefs pointing to the given branch
2864 * would be rather costly for this rare event (the direct
2865 * update of a branch) to be worth it. So let's cheat and
2866 * check with HEAD only which should cover 99% of all usage
2867 * scenarios (even 100% of the default ones).
2869 unsigned char head_sha1[20];
2870 int head_flag;
2871 const char *head_ref;
2872 head_ref = resolve_ref_unsafe("HEAD", head_sha1, 1, &head_flag);
2873 if (head_ref && (head_flag & REF_ISSYMREF) &&
2874 !strcmp(head_ref, lock->ref_name))
2875 log_ref_write("HEAD", lock->old_sha1, sha1, logmsg);
2877 if (commit_ref(lock)) {
2878 error("Couldn't set %s", lock->ref_name);
2879 unlock_ref(lock);
2880 return -1;
2882 unlock_ref(lock);
2883 return 0;
2886 int create_symref(const char *ref_target, const char *refs_heads_master,
2887 const char *logmsg)
2889 const char *lockpath;
2890 char ref[1000];
2891 int fd, len, written;
2892 char *git_HEAD = git_pathdup("%s", ref_target);
2893 unsigned char old_sha1[20], new_sha1[20];
2895 if (logmsg && read_ref(ref_target, old_sha1))
2896 hashclr(old_sha1);
2898 if (safe_create_leading_directories(git_HEAD) < 0)
2899 return error("unable to create directory for %s", git_HEAD);
2901 #ifndef NO_SYMLINK_HEAD
2902 if (prefer_symlink_refs) {
2903 unlink(git_HEAD);
2904 if (!symlink(refs_heads_master, git_HEAD))
2905 goto done;
2906 fprintf(stderr, "no symlink - falling back to symbolic ref\n");
2908 #endif
2910 len = snprintf(ref, sizeof(ref), "ref: %s\n", refs_heads_master);
2911 if (sizeof(ref) <= len) {
2912 error("refname too long: %s", refs_heads_master);
2913 goto error_free_return;
2915 lockpath = mkpath("%s.lock", git_HEAD);
2916 fd = open(lockpath, O_CREAT | O_EXCL | O_WRONLY, 0666);
2917 if (fd < 0) {
2918 error("Unable to open %s for writing", lockpath);
2919 goto error_free_return;
2921 written = write_in_full(fd, ref, len);
2922 if (close(fd) != 0 || written != len) {
2923 error("Unable to write to %s", lockpath);
2924 goto error_unlink_return;
2926 if (rename(lockpath, git_HEAD) < 0) {
2927 error("Unable to create %s", git_HEAD);
2928 goto error_unlink_return;
2930 if (adjust_shared_perm(git_HEAD)) {
2931 error("Unable to fix permissions on %s", lockpath);
2932 error_unlink_return:
2933 unlink_or_warn(lockpath);
2934 error_free_return:
2935 free(git_HEAD);
2936 return -1;
2939 #ifndef NO_SYMLINK_HEAD
2940 done:
2941 #endif
2942 if (logmsg && !read_ref(refs_heads_master, new_sha1))
2943 log_ref_write(ref_target, old_sha1, new_sha1, logmsg);
2945 free(git_HEAD);
2946 return 0;
2949 static char *ref_msg(const char *line, const char *endp)
2951 const char *ep;
2952 line += 82;
2953 ep = memchr(line, '\n', endp - line);
2954 if (!ep)
2955 ep = endp;
2956 return xmemdupz(line, ep - line);
2959 int read_ref_at(const char *refname, unsigned long at_time, int cnt,
2960 unsigned char *sha1, char **msg,
2961 unsigned long *cutoff_time, int *cutoff_tz, int *cutoff_cnt)
2963 const char *logfile, *logdata, *logend, *rec, *lastgt, *lastrec;
2964 char *tz_c;
2965 int logfd, tz, reccnt = 0;
2966 struct stat st;
2967 unsigned long date;
2968 unsigned char logged_sha1[20];
2969 void *log_mapped;
2970 size_t mapsz;
2972 logfile = git_path("logs/%s", refname);
2973 logfd = open(logfile, O_RDONLY, 0);
2974 if (logfd < 0)
2975 die_errno("Unable to read log '%s'", logfile);
2976 fstat(logfd, &st);
2977 if (!st.st_size)
2978 die("Log %s is empty.", logfile);
2979 mapsz = xsize_t(st.st_size);
2980 log_mapped = xmmap(NULL, mapsz, PROT_READ, MAP_PRIVATE, logfd, 0);
2981 logdata = log_mapped;
2982 close(logfd);
2984 lastrec = NULL;
2985 rec = logend = logdata + st.st_size;
2986 while (logdata < rec) {
2987 reccnt++;
2988 if (logdata < rec && *(rec-1) == '\n')
2989 rec--;
2990 lastgt = NULL;
2991 while (logdata < rec && *(rec-1) != '\n') {
2992 rec--;
2993 if (*rec == '>')
2994 lastgt = rec;
2996 if (!lastgt)
2997 die("Log %s is corrupt.", logfile);
2998 date = strtoul(lastgt + 1, &tz_c, 10);
2999 if (date <= at_time || cnt == 0) {
3000 tz = strtoul(tz_c, NULL, 10);
3001 if (msg)
3002 *msg = ref_msg(rec, logend);
3003 if (cutoff_time)
3004 *cutoff_time = date;
3005 if (cutoff_tz)
3006 *cutoff_tz = tz;
3007 if (cutoff_cnt)
3008 *cutoff_cnt = reccnt - 1;
3009 if (lastrec) {
3010 if (get_sha1_hex(lastrec, logged_sha1))
3011 die("Log %s is corrupt.", logfile);
3012 if (get_sha1_hex(rec + 41, sha1))
3013 die("Log %s is corrupt.", logfile);
3014 if (hashcmp(logged_sha1, sha1)) {
3015 warning("Log %s has gap after %s.",
3016 logfile, show_date(date, tz, DATE_RFC2822));
3019 else if (date == at_time) {
3020 if (get_sha1_hex(rec + 41, sha1))
3021 die("Log %s is corrupt.", logfile);
3023 else {
3024 if (get_sha1_hex(rec + 41, logged_sha1))
3025 die("Log %s is corrupt.", logfile);
3026 if (hashcmp(logged_sha1, sha1)) {
3027 warning("Log %s unexpectedly ended on %s.",
3028 logfile, show_date(date, tz, DATE_RFC2822));
3031 munmap(log_mapped, mapsz);
3032 return 0;
3034 lastrec = rec;
3035 if (cnt > 0)
3036 cnt--;
3039 rec = logdata;
3040 while (rec < logend && *rec != '>' && *rec != '\n')
3041 rec++;
3042 if (rec == logend || *rec == '\n')
3043 die("Log %s is corrupt.", logfile);
3044 date = strtoul(rec + 1, &tz_c, 10);
3045 tz = strtoul(tz_c, NULL, 10);
3046 if (get_sha1_hex(logdata, sha1))
3047 die("Log %s is corrupt.", logfile);
3048 if (is_null_sha1(sha1)) {
3049 if (get_sha1_hex(logdata + 41, sha1))
3050 die("Log %s is corrupt.", logfile);
3052 if (msg)
3053 *msg = ref_msg(logdata, logend);
3054 munmap(log_mapped, mapsz);
3056 if (cutoff_time)
3057 *cutoff_time = date;
3058 if (cutoff_tz)
3059 *cutoff_tz = tz;
3060 if (cutoff_cnt)
3061 *cutoff_cnt = reccnt;
3062 return 1;
3065 static int show_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn, void *cb_data)
3067 unsigned char osha1[20], nsha1[20];
3068 char *email_end, *message;
3069 unsigned long timestamp;
3070 int tz;
3072 /* old SP new SP name <email> SP time TAB msg LF */
3073 if (sb->len < 83 || sb->buf[sb->len - 1] != '\n' ||
3074 get_sha1_hex(sb->buf, osha1) || sb->buf[40] != ' ' ||
3075 get_sha1_hex(sb->buf + 41, nsha1) || sb->buf[81] != ' ' ||
3076 !(email_end = strchr(sb->buf + 82, '>')) ||
3077 email_end[1] != ' ' ||
3078 !(timestamp = strtoul(email_end + 2, &message, 10)) ||
3079 !message || message[0] != ' ' ||
3080 (message[1] != '+' && message[1] != '-') ||
3081 !isdigit(message[2]) || !isdigit(message[3]) ||
3082 !isdigit(message[4]) || !isdigit(message[5]))
3083 return 0; /* corrupt? */
3084 email_end[1] = '\0';
3085 tz = strtol(message + 1, NULL, 10);
3086 if (message[6] != '\t')
3087 message += 6;
3088 else
3089 message += 7;
3090 return fn(osha1, nsha1, sb->buf + 82, timestamp, tz, message, cb_data);
3093 static char *find_beginning_of_line(char *bob, char *scan)
3095 while (bob < scan && *(--scan) != '\n')
3096 ; /* keep scanning backwards */
3098 * Return either beginning of the buffer, or LF at the end of
3099 * the previous line.
3101 return scan;
3104 int for_each_reflog_ent_reverse(const char *refname, each_reflog_ent_fn fn, void *cb_data)
3106 struct strbuf sb = STRBUF_INIT;
3107 FILE *logfp;
3108 long pos;
3109 int ret = 0, at_tail = 1;
3111 logfp = fopen(git_path("logs/%s", refname), "r");
3112 if (!logfp)
3113 return -1;
3115 /* Jump to the end */
3116 if (fseek(logfp, 0, SEEK_END) < 0)
3117 return error("cannot seek back reflog for %s: %s",
3118 refname, strerror(errno));
3119 pos = ftell(logfp);
3120 while (!ret && 0 < pos) {
3121 int cnt;
3122 size_t nread;
3123 char buf[BUFSIZ];
3124 char *endp, *scanp;
3126 /* Fill next block from the end */
3127 cnt = (sizeof(buf) < pos) ? sizeof(buf) : pos;
3128 if (fseek(logfp, pos - cnt, SEEK_SET))
3129 return error("cannot seek back reflog for %s: %s",
3130 refname, strerror(errno));
3131 nread = fread(buf, cnt, 1, logfp);
3132 if (nread != 1)
3133 return error("cannot read %d bytes from reflog for %s: %s",
3134 cnt, refname, strerror(errno));
3135 pos -= cnt;
3137 scanp = endp = buf + cnt;
3138 if (at_tail && scanp[-1] == '\n')
3139 /* Looking at the final LF at the end of the file */
3140 scanp--;
3141 at_tail = 0;
3143 while (buf < scanp) {
3145 * terminating LF of the previous line, or the beginning
3146 * of the buffer.
3148 char *bp;
3150 bp = find_beginning_of_line(buf, scanp);
3152 if (*bp != '\n') {
3153 strbuf_splice(&sb, 0, 0, buf, endp - buf);
3154 if (pos)
3155 break; /* need to fill another block */
3156 scanp = buf - 1; /* leave loop */
3157 } else {
3159 * (bp + 1) thru endp is the beginning of the
3160 * current line we have in sb
3162 strbuf_splice(&sb, 0, 0, bp + 1, endp - (bp + 1));
3163 scanp = bp;
3164 endp = bp + 1;
3166 ret = show_one_reflog_ent(&sb, fn, cb_data);
3167 strbuf_reset(&sb);
3168 if (ret)
3169 break;
3173 if (!ret && sb.len)
3174 ret = show_one_reflog_ent(&sb, fn, cb_data);
3176 fclose(logfp);
3177 strbuf_release(&sb);
3178 return ret;
3181 int for_each_reflog_ent(const char *refname, each_reflog_ent_fn fn, void *cb_data)
3183 FILE *logfp;
3184 struct strbuf sb = STRBUF_INIT;
3185 int ret = 0;
3187 logfp = fopen(git_path("logs/%s", refname), "r");
3188 if (!logfp)
3189 return -1;
3191 while (!ret && !strbuf_getwholeline(&sb, logfp, '\n'))
3192 ret = show_one_reflog_ent(&sb, fn, cb_data);
3193 fclose(logfp);
3194 strbuf_release(&sb);
3195 return ret;
3198 * Call fn for each reflog in the namespace indicated by name. name
3199 * must be empty or end with '/'. Name will be used as a scratch
3200 * space, but its contents will be restored before return.
3202 static int do_for_each_reflog(struct strbuf *name, each_ref_fn fn, void *cb_data)
3204 DIR *d = opendir(git_path("logs/%s", name->buf));
3205 int retval = 0;
3206 struct dirent *de;
3207 int oldlen = name->len;
3209 if (!d)
3210 return name->len ? errno : 0;
3212 while ((de = readdir(d)) != NULL) {
3213 struct stat st;
3215 if (de->d_name[0] == '.')
3216 continue;
3217 if (has_extension(de->d_name, ".lock"))
3218 continue;
3219 strbuf_addstr(name, de->d_name);
3220 if (stat(git_path("logs/%s", name->buf), &st) < 0) {
3221 ; /* silently ignore */
3222 } else {
3223 if (S_ISDIR(st.st_mode)) {
3224 strbuf_addch(name, '/');
3225 retval = do_for_each_reflog(name, fn, cb_data);
3226 } else {
3227 unsigned char sha1[20];
3228 if (read_ref_full(name->buf, sha1, 0, NULL))
3229 retval = error("bad ref for %s", name->buf);
3230 else
3231 retval = fn(name->buf, sha1, 0, cb_data);
3233 if (retval)
3234 break;
3236 strbuf_setlen(name, oldlen);
3238 closedir(d);
3239 return retval;
3242 int for_each_reflog(each_ref_fn fn, void *cb_data)
3244 int retval;
3245 struct strbuf name;
3246 strbuf_init(&name, PATH_MAX);
3247 retval = do_for_each_reflog(&name, fn, cb_data);
3248 strbuf_release(&name);
3249 return retval;
3252 static struct ref_lock *update_ref_lock(const char *refname,
3253 const unsigned char *oldval,
3254 int flags, int *type_p,
3255 enum action_on_err onerr)
3257 struct ref_lock *lock;
3258 lock = lock_any_ref_for_update(refname, oldval, flags, type_p);
3259 if (!lock) {
3260 const char *str = "Cannot lock the ref '%s'.";
3261 switch (onerr) {
3262 case MSG_ON_ERR: error(str, refname); break;
3263 case DIE_ON_ERR: die(str, refname); break;
3264 case QUIET_ON_ERR: break;
3267 return lock;
3270 static int update_ref_write(const char *action, const char *refname,
3271 const unsigned char *sha1, struct ref_lock *lock,
3272 enum action_on_err onerr)
3274 if (write_ref_sha1(lock, sha1, action) < 0) {
3275 const char *str = "Cannot update the ref '%s'.";
3276 switch (onerr) {
3277 case MSG_ON_ERR: error(str, refname); break;
3278 case DIE_ON_ERR: die(str, refname); break;
3279 case QUIET_ON_ERR: break;
3281 return 1;
3283 return 0;
3286 int update_ref(const char *action, const char *refname,
3287 const unsigned char *sha1, const unsigned char *oldval,
3288 int flags, enum action_on_err onerr)
3290 struct ref_lock *lock;
3291 lock = update_ref_lock(refname, oldval, flags, NULL, onerr);
3292 if (!lock)
3293 return 1;
3294 return update_ref_write(action, refname, sha1, lock, onerr);
3297 static int ref_update_compare(const void *r1, const void *r2)
3299 const struct ref_update * const *u1 = r1;
3300 const struct ref_update * const *u2 = r2;
3301 return strcmp((*u1)->ref_name, (*u2)->ref_name);
3304 static int ref_update_reject_duplicates(struct ref_update **updates, int n,
3305 enum action_on_err onerr)
3307 int i;
3308 for (i = 1; i < n; i++)
3309 if (!strcmp(updates[i - 1]->ref_name, updates[i]->ref_name)) {
3310 const char *str =
3311 "Multiple updates for ref '%s' not allowed.";
3312 switch (onerr) {
3313 case MSG_ON_ERR:
3314 error(str, updates[i]->ref_name); break;
3315 case DIE_ON_ERR:
3316 die(str, updates[i]->ref_name); break;
3317 case QUIET_ON_ERR:
3318 break;
3320 return 1;
3322 return 0;
3325 int update_refs(const char *action, const struct ref_update **updates_orig,
3326 int n, enum action_on_err onerr)
3328 int ret = 0, delnum = 0, i;
3329 struct ref_update **updates;
3330 int *types;
3331 struct ref_lock **locks;
3332 const char **delnames;
3334 if (!updates_orig || !n)
3335 return 0;
3337 /* Allocate work space */
3338 updates = xmalloc(sizeof(*updates) * n);
3339 types = xmalloc(sizeof(*types) * n);
3340 locks = xcalloc(n, sizeof(*locks));
3341 delnames = xmalloc(sizeof(*delnames) * n);
3343 /* Copy, sort, and reject duplicate refs */
3344 memcpy(updates, updates_orig, sizeof(*updates) * n);
3345 qsort(updates, n, sizeof(*updates), ref_update_compare);
3346 ret = ref_update_reject_duplicates(updates, n, onerr);
3347 if (ret)
3348 goto cleanup;
3350 /* Acquire all locks while verifying old values */
3351 for (i = 0; i < n; i++) {
3352 locks[i] = update_ref_lock(updates[i]->ref_name,
3353 (updates[i]->have_old ?
3354 updates[i]->old_sha1 : NULL),
3355 updates[i]->flags,
3356 &types[i], onerr);
3357 if (!locks[i]) {
3358 ret = 1;
3359 goto cleanup;
3363 /* Perform updates first so live commits remain referenced */
3364 for (i = 0; i < n; i++)
3365 if (!is_null_sha1(updates[i]->new_sha1)) {
3366 ret = update_ref_write(action,
3367 updates[i]->ref_name,
3368 updates[i]->new_sha1,
3369 locks[i], onerr);
3370 locks[i] = NULL; /* freed by update_ref_write */
3371 if (ret)
3372 goto cleanup;
3375 /* Perform deletes now that updates are safely completed */
3376 for (i = 0; i < n; i++)
3377 if (locks[i]) {
3378 delnames[delnum++] = locks[i]->ref_name;
3379 ret |= delete_ref_loose(locks[i], types[i]);
3381 ret |= repack_without_refs(delnames, delnum);
3382 for (i = 0; i < delnum; i++)
3383 unlink_or_warn(git_path("logs/%s", delnames[i]));
3384 clear_loose_ref_cache(&ref_cache);
3386 cleanup:
3387 for (i = 0; i < n; i++)
3388 if (locks[i])
3389 unlock_ref(locks[i]);
3390 free(updates);
3391 free(types);
3392 free(locks);
3393 free(delnames);
3394 return ret;
3397 char *shorten_unambiguous_ref(const char *refname, int strict)
3399 int i;
3400 static char **scanf_fmts;
3401 static int nr_rules;
3402 char *short_name;
3404 if (!nr_rules) {
3406 * Pre-generate scanf formats from ref_rev_parse_rules[].
3407 * Generate a format suitable for scanf from a
3408 * ref_rev_parse_rules rule by interpolating "%s" at the
3409 * location of the "%.*s".
3411 size_t total_len = 0;
3412 size_t offset = 0;
3414 /* the rule list is NULL terminated, count them first */
3415 for (nr_rules = 0; ref_rev_parse_rules[nr_rules]; nr_rules++)
3416 /* -2 for strlen("%.*s") - strlen("%s"); +1 for NUL */
3417 total_len += strlen(ref_rev_parse_rules[nr_rules]) - 2 + 1;
3419 scanf_fmts = xmalloc(nr_rules * sizeof(char *) + total_len);
3421 offset = 0;
3422 for (i = 0; i < nr_rules; i++) {
3423 assert(offset < total_len);
3424 scanf_fmts[i] = (char *)&scanf_fmts[nr_rules] + offset;
3425 offset += snprintf(scanf_fmts[i], total_len - offset,
3426 ref_rev_parse_rules[i], 2, "%s") + 1;
3430 /* bail out if there are no rules */
3431 if (!nr_rules)
3432 return xstrdup(refname);
3434 /* buffer for scanf result, at most refname must fit */
3435 short_name = xstrdup(refname);
3437 /* skip first rule, it will always match */
3438 for (i = nr_rules - 1; i > 0 ; --i) {
3439 int j;
3440 int rules_to_fail = i;
3441 int short_name_len;
3443 if (1 != sscanf(refname, scanf_fmts[i], short_name))
3444 continue;
3446 short_name_len = strlen(short_name);
3449 * in strict mode, all (except the matched one) rules
3450 * must fail to resolve to a valid non-ambiguous ref
3452 if (strict)
3453 rules_to_fail = nr_rules;
3456 * check if the short name resolves to a valid ref,
3457 * but use only rules prior to the matched one
3459 for (j = 0; j < rules_to_fail; j++) {
3460 const char *rule = ref_rev_parse_rules[j];
3461 char refname[PATH_MAX];
3463 /* skip matched rule */
3464 if (i == j)
3465 continue;
3468 * the short name is ambiguous, if it resolves
3469 * (with this previous rule) to a valid ref
3470 * read_ref() returns 0 on success
3472 mksnpath(refname, sizeof(refname),
3473 rule, short_name_len, short_name);
3474 if (ref_exists(refname))
3475 break;
3479 * short name is non-ambiguous if all previous rules
3480 * haven't resolved to a valid ref
3482 if (j == rules_to_fail)
3483 return short_name;
3486 free(short_name);
3487 return xstrdup(refname);
3490 static struct string_list *hide_refs;
3492 int parse_hide_refs_config(const char *var, const char *value, const char *section)
3494 if (!strcmp("transfer.hiderefs", var) ||
3495 /* NEEDSWORK: use parse_config_key() once both are merged */
3496 (starts_with(var, section) && var[strlen(section)] == '.' &&
3497 !strcmp(var + strlen(section), ".hiderefs"))) {
3498 char *ref;
3499 int len;
3501 if (!value)
3502 return config_error_nonbool(var);
3503 ref = xstrdup(value);
3504 len = strlen(ref);
3505 while (len && ref[len - 1] == '/')
3506 ref[--len] = '\0';
3507 if (!hide_refs) {
3508 hide_refs = xcalloc(1, sizeof(*hide_refs));
3509 hide_refs->strdup_strings = 1;
3511 string_list_append(hide_refs, ref);
3513 return 0;
3516 int ref_is_hidden(const char *refname)
3518 struct string_list_item *item;
3520 if (!hide_refs)
3521 return 0;
3522 for_each_string_list_item(item, hide_refs) {
3523 int len;
3524 if (!starts_with(refname, item->string))
3525 continue;
3526 len = strlen(item->string);
3527 if (!refname[len] || refname[len] == '/')
3528 return 1;
3530 return 0;