Merge branch 'mc/doc-submodule-sync-recurse'
[git.git] / refs.c
blobdc457742eade241ec6b0001580d1ce1a880fee31
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 * How to handle various characters in refnames:
10 * 0: An acceptable character for refs
11 * 1: End-of-component
12 * 2: ., look for a preceding . to reject .. in refs
13 * 3: {, look for a preceding @ to reject @{ in refs
14 * 4: A bad character: ASCII control characters, "~", "^", ":" or SP
16 static unsigned char refname_disposition[256] = {
17 1, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
18 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
19 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 2, 1,
20 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 4,
21 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
22 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 4, 0, 4, 0,
23 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
24 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 4, 4
28 * Try to read one refname component from the front of refname.
29 * Return the length of the component found, or -1 if the component is
30 * not legal. It is legal if it is something reasonable to have under
31 * ".git/refs/"; We do not like it if:
33 * - any path component of it begins with ".", or
34 * - it has double dots "..", or
35 * - it has ASCII control character, "~", "^", ":" or SP, anywhere, or
36 * - it ends with a "/".
37 * - it ends with ".lock"
38 * - it contains a "\" (backslash)
40 static int check_refname_component(const char *refname, int flags)
42 const char *cp;
43 char last = '\0';
45 for (cp = refname; ; cp++) {
46 int ch = *cp & 255;
47 unsigned char disp = refname_disposition[ch];
48 switch (disp) {
49 case 1:
50 goto out;
51 case 2:
52 if (last == '.')
53 return -1; /* Refname contains "..". */
54 break;
55 case 3:
56 if (last == '@')
57 return -1; /* Refname contains "@{". */
58 break;
59 case 4:
60 return -1;
62 last = ch;
64 out:
65 if (cp == refname)
66 return 0; /* Component has zero length. */
67 if (refname[0] == '.') {
68 if (!(flags & REFNAME_DOT_COMPONENT))
69 return -1; /* Component starts with '.'. */
71 * Even if leading dots are allowed, don't allow "."
72 * as a component (".." is prevented by a rule above).
74 if (refname[1] == '\0')
75 return -1; /* Component equals ".". */
77 if (cp - refname >= 5 && !memcmp(cp - 5, ".lock", 5))
78 return -1; /* Refname ends with ".lock". */
79 return cp - refname;
82 int check_refname_format(const char *refname, int flags)
84 int component_len, component_count = 0;
86 if (!strcmp(refname, "@"))
87 /* Refname is a single character '@'. */
88 return -1;
90 while (1) {
91 /* We are at the start of a path component. */
92 component_len = check_refname_component(refname, flags);
93 if (component_len <= 0) {
94 if ((flags & REFNAME_REFSPEC_PATTERN) &&
95 refname[0] == '*' &&
96 (refname[1] == '\0' || refname[1] == '/')) {
97 /* Accept one wildcard as a full refname component. */
98 flags &= ~REFNAME_REFSPEC_PATTERN;
99 component_len = 1;
100 } else {
101 return -1;
104 component_count++;
105 if (refname[component_len] == '\0')
106 break;
107 /* Skip to next component. */
108 refname += component_len + 1;
111 if (refname[component_len - 1] == '.')
112 return -1; /* Refname ends with '.'. */
113 if (!(flags & REFNAME_ALLOW_ONELEVEL) && component_count < 2)
114 return -1; /* Refname has only one component. */
115 return 0;
118 struct ref_entry;
121 * Information used (along with the information in ref_entry) to
122 * describe a single cached reference. This data structure only
123 * occurs embedded in a union in struct ref_entry, and only when
124 * (ref_entry->flag & REF_DIR) is zero.
126 struct ref_value {
128 * The name of the object to which this reference resolves
129 * (which may be a tag object). If REF_ISBROKEN, this is
130 * null. If REF_ISSYMREF, then this is the name of the object
131 * referred to by the last reference in the symlink chain.
133 unsigned char sha1[20];
136 * If REF_KNOWS_PEELED, then this field holds the peeled value
137 * of this reference, or null if the reference is known not to
138 * be peelable. See the documentation for peel_ref() for an
139 * exact definition of "peelable".
141 unsigned char peeled[20];
144 struct ref_cache;
147 * Information used (along with the information in ref_entry) to
148 * describe a level in the hierarchy of references. This data
149 * structure only occurs embedded in a union in struct ref_entry, and
150 * only when (ref_entry.flag & REF_DIR) is set. In that case,
151 * (ref_entry.flag & REF_INCOMPLETE) determines whether the references
152 * in the directory have already been read:
154 * (ref_entry.flag & REF_INCOMPLETE) unset -- a directory of loose
155 * or packed references, already read.
157 * (ref_entry.flag & REF_INCOMPLETE) set -- a directory of loose
158 * references that hasn't been read yet (nor has any of its
159 * subdirectories).
161 * Entries within a directory are stored within a growable array of
162 * pointers to ref_entries (entries, nr, alloc). Entries 0 <= i <
163 * sorted are sorted by their component name in strcmp() order and the
164 * remaining entries are unsorted.
166 * Loose references are read lazily, one directory at a time. When a
167 * directory of loose references is read, then all of the references
168 * in that directory are stored, and REF_INCOMPLETE stubs are created
169 * for any subdirectories, but the subdirectories themselves are not
170 * read. The reading is triggered by get_ref_dir().
172 struct ref_dir {
173 int nr, alloc;
176 * Entries with index 0 <= i < sorted are sorted by name. New
177 * entries are appended to the list unsorted, and are sorted
178 * only when required; thus we avoid the need to sort the list
179 * after the addition of every reference.
181 int sorted;
183 /* A pointer to the ref_cache that contains this ref_dir. */
184 struct ref_cache *ref_cache;
186 struct ref_entry **entries;
190 * Bit values for ref_entry::flag. REF_ISSYMREF=0x01,
191 * REF_ISPACKED=0x02, and REF_ISBROKEN=0x04 are public values; see
192 * refs.h.
196 * The field ref_entry->u.value.peeled of this value entry contains
197 * the correct peeled value for the reference, which might be
198 * null_sha1 if the reference is not a tag or if it is broken.
200 #define REF_KNOWS_PEELED 0x08
202 /* ref_entry represents a directory of references */
203 #define REF_DIR 0x10
206 * Entry has not yet been read from disk (used only for REF_DIR
207 * entries representing loose references)
209 #define REF_INCOMPLETE 0x20
212 * A ref_entry represents either a reference or a "subdirectory" of
213 * references.
215 * Each directory in the reference namespace is represented by a
216 * ref_entry with (flags & REF_DIR) set and containing a subdir member
217 * that holds the entries in that directory that have been read so
218 * far. If (flags & REF_INCOMPLETE) is set, then the directory and
219 * its subdirectories haven't been read yet. REF_INCOMPLETE is only
220 * used for loose reference directories.
222 * References are represented by a ref_entry with (flags & REF_DIR)
223 * unset and a value member that describes the reference's value. The
224 * flag member is at the ref_entry level, but it is also needed to
225 * interpret the contents of the value field (in other words, a
226 * ref_value object is not very much use without the enclosing
227 * ref_entry).
229 * Reference names cannot end with slash and directories' names are
230 * always stored with a trailing slash (except for the top-level
231 * directory, which is always denoted by ""). This has two nice
232 * consequences: (1) when the entries in each subdir are sorted
233 * lexicographically by name (as they usually are), the references in
234 * a whole tree can be generated in lexicographic order by traversing
235 * the tree in left-to-right, depth-first order; (2) the names of
236 * references and subdirectories cannot conflict, and therefore the
237 * presence of an empty subdirectory does not block the creation of a
238 * similarly-named reference. (The fact that reference names with the
239 * same leading components can conflict *with each other* is a
240 * separate issue that is regulated by is_refname_available().)
242 * Please note that the name field contains the fully-qualified
243 * reference (or subdirectory) name. Space could be saved by only
244 * storing the relative names. But that would require the full names
245 * to be generated on the fly when iterating in do_for_each_ref(), and
246 * would break callback functions, who have always been able to assume
247 * that the name strings that they are passed will not be freed during
248 * the iteration.
250 struct ref_entry {
251 unsigned char flag; /* ISSYMREF? ISPACKED? */
252 union {
253 struct ref_value value; /* if not (flags&REF_DIR) */
254 struct ref_dir subdir; /* if (flags&REF_DIR) */
255 } u;
257 * The full name of the reference (e.g., "refs/heads/master")
258 * or the full name of the directory with a trailing slash
259 * (e.g., "refs/heads/"):
261 char name[FLEX_ARRAY];
264 static void read_loose_refs(const char *dirname, struct ref_dir *dir);
266 static struct ref_dir *get_ref_dir(struct ref_entry *entry)
268 struct ref_dir *dir;
269 assert(entry->flag & REF_DIR);
270 dir = &entry->u.subdir;
271 if (entry->flag & REF_INCOMPLETE) {
272 read_loose_refs(entry->name, dir);
273 entry->flag &= ~REF_INCOMPLETE;
275 return dir;
278 static struct ref_entry *create_ref_entry(const char *refname,
279 const unsigned char *sha1, int flag,
280 int check_name)
282 int len;
283 struct ref_entry *ref;
285 if (check_name &&
286 check_refname_format(refname, REFNAME_ALLOW_ONELEVEL|REFNAME_DOT_COMPONENT))
287 die("Reference has invalid format: '%s'", refname);
288 len = strlen(refname) + 1;
289 ref = xmalloc(sizeof(struct ref_entry) + len);
290 hashcpy(ref->u.value.sha1, sha1);
291 hashclr(ref->u.value.peeled);
292 memcpy(ref->name, refname, len);
293 ref->flag = flag;
294 return ref;
297 static void clear_ref_dir(struct ref_dir *dir);
299 static void free_ref_entry(struct ref_entry *entry)
301 if (entry->flag & REF_DIR) {
303 * Do not use get_ref_dir() here, as that might
304 * trigger the reading of loose refs.
306 clear_ref_dir(&entry->u.subdir);
308 free(entry);
312 * Add a ref_entry to the end of dir (unsorted). Entry is always
313 * stored directly in dir; no recursion into subdirectories is
314 * done.
316 static void add_entry_to_dir(struct ref_dir *dir, struct ref_entry *entry)
318 ALLOC_GROW(dir->entries, dir->nr + 1, dir->alloc);
319 dir->entries[dir->nr++] = entry;
320 /* optimize for the case that entries are added in order */
321 if (dir->nr == 1 ||
322 (dir->nr == dir->sorted + 1 &&
323 strcmp(dir->entries[dir->nr - 2]->name,
324 dir->entries[dir->nr - 1]->name) < 0))
325 dir->sorted = dir->nr;
329 * Clear and free all entries in dir, recursively.
331 static void clear_ref_dir(struct ref_dir *dir)
333 int i;
334 for (i = 0; i < dir->nr; i++)
335 free_ref_entry(dir->entries[i]);
336 free(dir->entries);
337 dir->sorted = dir->nr = dir->alloc = 0;
338 dir->entries = NULL;
342 * Create a struct ref_entry object for the specified dirname.
343 * dirname is the name of the directory with a trailing slash (e.g.,
344 * "refs/heads/") or "" for the top-level directory.
346 static struct ref_entry *create_dir_entry(struct ref_cache *ref_cache,
347 const char *dirname, size_t len,
348 int incomplete)
350 struct ref_entry *direntry;
351 direntry = xcalloc(1, sizeof(struct ref_entry) + len + 1);
352 memcpy(direntry->name, dirname, len);
353 direntry->name[len] = '\0';
354 direntry->u.subdir.ref_cache = ref_cache;
355 direntry->flag = REF_DIR | (incomplete ? REF_INCOMPLETE : 0);
356 return direntry;
359 static int ref_entry_cmp(const void *a, const void *b)
361 struct ref_entry *one = *(struct ref_entry **)a;
362 struct ref_entry *two = *(struct ref_entry **)b;
363 return strcmp(one->name, two->name);
366 static void sort_ref_dir(struct ref_dir *dir);
368 struct string_slice {
369 size_t len;
370 const char *str;
373 static int ref_entry_cmp_sslice(const void *key_, const void *ent_)
375 const struct string_slice *key = key_;
376 const struct ref_entry *ent = *(const struct ref_entry * const *)ent_;
377 int cmp = strncmp(key->str, ent->name, key->len);
378 if (cmp)
379 return cmp;
380 return '\0' - (unsigned char)ent->name[key->len];
384 * Return the index of the entry with the given refname from the
385 * ref_dir (non-recursively), sorting dir if necessary. Return -1 if
386 * no such entry is found. dir must already be complete.
388 static int search_ref_dir(struct ref_dir *dir, const char *refname, size_t len)
390 struct ref_entry **r;
391 struct string_slice key;
393 if (refname == NULL || !dir->nr)
394 return -1;
396 sort_ref_dir(dir);
397 key.len = len;
398 key.str = refname;
399 r = bsearch(&key, dir->entries, dir->nr, sizeof(*dir->entries),
400 ref_entry_cmp_sslice);
402 if (r == NULL)
403 return -1;
405 return r - dir->entries;
409 * Search for a directory entry directly within dir (without
410 * recursing). Sort dir if necessary. subdirname must be a directory
411 * name (i.e., end in '/'). If mkdir is set, then create the
412 * directory if it is missing; otherwise, return NULL if the desired
413 * directory cannot be found. dir must already be complete.
415 static struct ref_dir *search_for_subdir(struct ref_dir *dir,
416 const char *subdirname, size_t len,
417 int mkdir)
419 int entry_index = search_ref_dir(dir, subdirname, len);
420 struct ref_entry *entry;
421 if (entry_index == -1) {
422 if (!mkdir)
423 return NULL;
425 * Since dir is complete, the absence of a subdir
426 * means that the subdir really doesn't exist;
427 * therefore, create an empty record for it but mark
428 * the record complete.
430 entry = create_dir_entry(dir->ref_cache, subdirname, len, 0);
431 add_entry_to_dir(dir, entry);
432 } else {
433 entry = dir->entries[entry_index];
435 return get_ref_dir(entry);
439 * If refname is a reference name, find the ref_dir within the dir
440 * tree that should hold refname. If refname is a directory name
441 * (i.e., ends in '/'), then return that ref_dir itself. dir must
442 * represent the top-level directory and must already be complete.
443 * Sort ref_dirs and recurse into subdirectories as necessary. If
444 * mkdir is set, then create any missing directories; otherwise,
445 * return NULL if the desired directory cannot be found.
447 static struct ref_dir *find_containing_dir(struct ref_dir *dir,
448 const char *refname, int mkdir)
450 const char *slash;
451 for (slash = strchr(refname, '/'); slash; slash = strchr(slash + 1, '/')) {
452 size_t dirnamelen = slash - refname + 1;
453 struct ref_dir *subdir;
454 subdir = search_for_subdir(dir, refname, dirnamelen, mkdir);
455 if (!subdir) {
456 dir = NULL;
457 break;
459 dir = subdir;
462 return dir;
466 * Find the value entry with the given name in dir, sorting ref_dirs
467 * and recursing into subdirectories as necessary. If the name is not
468 * found or it corresponds to a directory entry, return NULL.
470 static struct ref_entry *find_ref(struct ref_dir *dir, const char *refname)
472 int entry_index;
473 struct ref_entry *entry;
474 dir = find_containing_dir(dir, refname, 0);
475 if (!dir)
476 return NULL;
477 entry_index = search_ref_dir(dir, refname, strlen(refname));
478 if (entry_index == -1)
479 return NULL;
480 entry = dir->entries[entry_index];
481 return (entry->flag & REF_DIR) ? NULL : entry;
485 * Remove the entry with the given name from dir, recursing into
486 * subdirectories as necessary. If refname is the name of a directory
487 * (i.e., ends with '/'), then remove the directory and its contents.
488 * If the removal was successful, return the number of entries
489 * remaining in the directory entry that contained the deleted entry.
490 * If the name was not found, return -1. Please note that this
491 * function only deletes the entry from the cache; it does not delete
492 * it from the filesystem or ensure that other cache entries (which
493 * might be symbolic references to the removed entry) are updated.
494 * Nor does it remove any containing dir entries that might be made
495 * empty by the removal. dir must represent the top-level directory
496 * and must already be complete.
498 static int remove_entry(struct ref_dir *dir, const char *refname)
500 int refname_len = strlen(refname);
501 int entry_index;
502 struct ref_entry *entry;
503 int is_dir = refname[refname_len - 1] == '/';
504 if (is_dir) {
506 * refname represents a reference directory. Remove
507 * the trailing slash; otherwise we will get the
508 * directory *representing* refname rather than the
509 * one *containing* it.
511 char *dirname = xmemdupz(refname, refname_len - 1);
512 dir = find_containing_dir(dir, dirname, 0);
513 free(dirname);
514 } else {
515 dir = find_containing_dir(dir, refname, 0);
517 if (!dir)
518 return -1;
519 entry_index = search_ref_dir(dir, refname, refname_len);
520 if (entry_index == -1)
521 return -1;
522 entry = dir->entries[entry_index];
524 memmove(&dir->entries[entry_index],
525 &dir->entries[entry_index + 1],
526 (dir->nr - entry_index - 1) * sizeof(*dir->entries)
528 dir->nr--;
529 if (dir->sorted > entry_index)
530 dir->sorted--;
531 free_ref_entry(entry);
532 return dir->nr;
536 * Add a ref_entry to the ref_dir (unsorted), recursing into
537 * subdirectories as necessary. dir must represent the top-level
538 * directory. Return 0 on success.
540 static int add_ref(struct ref_dir *dir, struct ref_entry *ref)
542 dir = find_containing_dir(dir, ref->name, 1);
543 if (!dir)
544 return -1;
545 add_entry_to_dir(dir, ref);
546 return 0;
550 * Emit a warning and return true iff ref1 and ref2 have the same name
551 * and the same sha1. Die if they have the same name but different
552 * sha1s.
554 static int is_dup_ref(const struct ref_entry *ref1, const struct ref_entry *ref2)
556 if (strcmp(ref1->name, ref2->name))
557 return 0;
559 /* Duplicate name; make sure that they don't conflict: */
561 if ((ref1->flag & REF_DIR) || (ref2->flag & REF_DIR))
562 /* This is impossible by construction */
563 die("Reference directory conflict: %s", ref1->name);
565 if (hashcmp(ref1->u.value.sha1, ref2->u.value.sha1))
566 die("Duplicated ref, and SHA1s don't match: %s", ref1->name);
568 warning("Duplicated ref: %s", ref1->name);
569 return 1;
573 * Sort the entries in dir non-recursively (if they are not already
574 * sorted) and remove any duplicate entries.
576 static void sort_ref_dir(struct ref_dir *dir)
578 int i, j;
579 struct ref_entry *last = NULL;
582 * This check also prevents passing a zero-length array to qsort(),
583 * which is a problem on some platforms.
585 if (dir->sorted == dir->nr)
586 return;
588 qsort(dir->entries, dir->nr, sizeof(*dir->entries), ref_entry_cmp);
590 /* Remove any duplicates: */
591 for (i = 0, j = 0; j < dir->nr; j++) {
592 struct ref_entry *entry = dir->entries[j];
593 if (last && is_dup_ref(last, entry))
594 free_ref_entry(entry);
595 else
596 last = dir->entries[i++] = entry;
598 dir->sorted = dir->nr = i;
601 /* Include broken references in a do_for_each_ref*() iteration: */
602 #define DO_FOR_EACH_INCLUDE_BROKEN 0x01
605 * Return true iff the reference described by entry can be resolved to
606 * an object in the database. Emit a warning if the referred-to
607 * object does not exist.
609 static int ref_resolves_to_object(struct ref_entry *entry)
611 if (entry->flag & REF_ISBROKEN)
612 return 0;
613 if (!has_sha1_file(entry->u.value.sha1)) {
614 error("%s does not point to a valid object!", entry->name);
615 return 0;
617 return 1;
621 * current_ref is a performance hack: when iterating over references
622 * using the for_each_ref*() functions, current_ref is set to the
623 * current reference's entry before calling the callback function. If
624 * the callback function calls peel_ref(), then peel_ref() first
625 * checks whether the reference to be peeled is the current reference
626 * (it usually is) and if so, returns that reference's peeled version
627 * if it is available. This avoids a refname lookup in a common case.
629 static struct ref_entry *current_ref;
631 typedef int each_ref_entry_fn(struct ref_entry *entry, void *cb_data);
633 struct ref_entry_cb {
634 const char *base;
635 int trim;
636 int flags;
637 each_ref_fn *fn;
638 void *cb_data;
642 * Handle one reference in a do_for_each_ref*()-style iteration,
643 * calling an each_ref_fn for each entry.
645 static int do_one_ref(struct ref_entry *entry, void *cb_data)
647 struct ref_entry_cb *data = cb_data;
648 struct ref_entry *old_current_ref;
649 int retval;
651 if (!starts_with(entry->name, data->base))
652 return 0;
654 if (!(data->flags & DO_FOR_EACH_INCLUDE_BROKEN) &&
655 !ref_resolves_to_object(entry))
656 return 0;
658 /* Store the old value, in case this is a recursive call: */
659 old_current_ref = current_ref;
660 current_ref = entry;
661 retval = data->fn(entry->name + data->trim, entry->u.value.sha1,
662 entry->flag, data->cb_data);
663 current_ref = old_current_ref;
664 return retval;
668 * Call fn for each reference in dir that has index in the range
669 * offset <= index < dir->nr. Recurse into subdirectories that are in
670 * that index range, sorting them before iterating. This function
671 * does not sort dir itself; it should be sorted beforehand. fn is
672 * called for all references, including broken ones.
674 static int do_for_each_entry_in_dir(struct ref_dir *dir, int offset,
675 each_ref_entry_fn fn, void *cb_data)
677 int i;
678 assert(dir->sorted == dir->nr);
679 for (i = offset; i < dir->nr; i++) {
680 struct ref_entry *entry = dir->entries[i];
681 int retval;
682 if (entry->flag & REF_DIR) {
683 struct ref_dir *subdir = get_ref_dir(entry);
684 sort_ref_dir(subdir);
685 retval = do_for_each_entry_in_dir(subdir, 0, fn, cb_data);
686 } else {
687 retval = fn(entry, cb_data);
689 if (retval)
690 return retval;
692 return 0;
696 * Call fn for each reference in the union of dir1 and dir2, in order
697 * by refname. Recurse into subdirectories. If a value entry appears
698 * in both dir1 and dir2, then only process the version that is in
699 * dir2. The input dirs must already be sorted, but subdirs will be
700 * sorted as needed. fn is called for all references, including
701 * broken ones.
703 static int do_for_each_entry_in_dirs(struct ref_dir *dir1,
704 struct ref_dir *dir2,
705 each_ref_entry_fn fn, void *cb_data)
707 int retval;
708 int i1 = 0, i2 = 0;
710 assert(dir1->sorted == dir1->nr);
711 assert(dir2->sorted == dir2->nr);
712 while (1) {
713 struct ref_entry *e1, *e2;
714 int cmp;
715 if (i1 == dir1->nr) {
716 return do_for_each_entry_in_dir(dir2, i2, fn, cb_data);
718 if (i2 == dir2->nr) {
719 return do_for_each_entry_in_dir(dir1, i1, fn, cb_data);
721 e1 = dir1->entries[i1];
722 e2 = dir2->entries[i2];
723 cmp = strcmp(e1->name, e2->name);
724 if (cmp == 0) {
725 if ((e1->flag & REF_DIR) && (e2->flag & REF_DIR)) {
726 /* Both are directories; descend them in parallel. */
727 struct ref_dir *subdir1 = get_ref_dir(e1);
728 struct ref_dir *subdir2 = get_ref_dir(e2);
729 sort_ref_dir(subdir1);
730 sort_ref_dir(subdir2);
731 retval = do_for_each_entry_in_dirs(
732 subdir1, subdir2, fn, cb_data);
733 i1++;
734 i2++;
735 } else if (!(e1->flag & REF_DIR) && !(e2->flag & REF_DIR)) {
736 /* Both are references; ignore the one from dir1. */
737 retval = fn(e2, cb_data);
738 i1++;
739 i2++;
740 } else {
741 die("conflict between reference and directory: %s",
742 e1->name);
744 } else {
745 struct ref_entry *e;
746 if (cmp < 0) {
747 e = e1;
748 i1++;
749 } else {
750 e = e2;
751 i2++;
753 if (e->flag & REF_DIR) {
754 struct ref_dir *subdir = get_ref_dir(e);
755 sort_ref_dir(subdir);
756 retval = do_for_each_entry_in_dir(
757 subdir, 0, fn, cb_data);
758 } else {
759 retval = fn(e, cb_data);
762 if (retval)
763 return retval;
768 * Load all of the refs from the dir into our in-memory cache. The hard work
769 * of loading loose refs is done by get_ref_dir(), so we just need to recurse
770 * through all of the sub-directories. We do not even need to care about
771 * sorting, as traversal order does not matter to us.
773 static void prime_ref_dir(struct ref_dir *dir)
775 int i;
776 for (i = 0; i < dir->nr; i++) {
777 struct ref_entry *entry = dir->entries[i];
778 if (entry->flag & REF_DIR)
779 prime_ref_dir(get_ref_dir(entry));
783 * Return true iff refname1 and refname2 conflict with each other.
784 * Two reference names conflict if one of them exactly matches the
785 * leading components of the other; e.g., "foo/bar" conflicts with
786 * both "foo" and with "foo/bar/baz" but not with "foo/bar" or
787 * "foo/barbados".
789 static int names_conflict(const char *refname1, const char *refname2)
791 for (; *refname1 && *refname1 == *refname2; refname1++, refname2++)
793 return (*refname1 == '\0' && *refname2 == '/')
794 || (*refname1 == '/' && *refname2 == '\0');
797 struct name_conflict_cb {
798 const char *refname;
799 const char *oldrefname;
800 const char *conflicting_refname;
803 static int name_conflict_fn(struct ref_entry *entry, void *cb_data)
805 struct name_conflict_cb *data = (struct name_conflict_cb *)cb_data;
806 if (data->oldrefname && !strcmp(data->oldrefname, entry->name))
807 return 0;
808 if (names_conflict(data->refname, entry->name)) {
809 data->conflicting_refname = entry->name;
810 return 1;
812 return 0;
816 * Return true iff a reference named refname could be created without
817 * conflicting with the name of an existing reference in dir. If
818 * oldrefname is non-NULL, ignore potential conflicts with oldrefname
819 * (e.g., because oldrefname is scheduled for deletion in the same
820 * operation).
822 static int is_refname_available(const char *refname, const char *oldrefname,
823 struct ref_dir *dir)
825 struct name_conflict_cb data;
826 data.refname = refname;
827 data.oldrefname = oldrefname;
828 data.conflicting_refname = NULL;
830 sort_ref_dir(dir);
831 if (do_for_each_entry_in_dir(dir, 0, name_conflict_fn, &data)) {
832 error("'%s' exists; cannot create '%s'",
833 data.conflicting_refname, refname);
834 return 0;
836 return 1;
839 struct packed_ref_cache {
840 struct ref_entry *root;
843 * Count of references to the data structure in this instance,
844 * including the pointer from ref_cache::packed if any. The
845 * data will not be freed as long as the reference count is
846 * nonzero.
848 unsigned int referrers;
851 * Iff the packed-refs file associated with this instance is
852 * currently locked for writing, this points at the associated
853 * lock (which is owned by somebody else). The referrer count
854 * is also incremented when the file is locked and decremented
855 * when it is unlocked.
857 struct lock_file *lock;
859 /* The metadata from when this packed-refs cache was read */
860 struct stat_validity validity;
864 * Future: need to be in "struct repository"
865 * when doing a full libification.
867 static struct ref_cache {
868 struct ref_cache *next;
869 struct ref_entry *loose;
870 struct packed_ref_cache *packed;
872 * The submodule name, or "" for the main repo. We allocate
873 * length 1 rather than FLEX_ARRAY so that the main ref_cache
874 * is initialized correctly.
876 char name[1];
877 } ref_cache, *submodule_ref_caches;
879 /* Lock used for the main packed-refs file: */
880 static struct lock_file packlock;
883 * Increment the reference count of *packed_refs.
885 static void acquire_packed_ref_cache(struct packed_ref_cache *packed_refs)
887 packed_refs->referrers++;
891 * Decrease the reference count of *packed_refs. If it goes to zero,
892 * free *packed_refs and return true; otherwise return false.
894 static int release_packed_ref_cache(struct packed_ref_cache *packed_refs)
896 if (!--packed_refs->referrers) {
897 free_ref_entry(packed_refs->root);
898 stat_validity_clear(&packed_refs->validity);
899 free(packed_refs);
900 return 1;
901 } else {
902 return 0;
906 static void clear_packed_ref_cache(struct ref_cache *refs)
908 if (refs->packed) {
909 struct packed_ref_cache *packed_refs = refs->packed;
911 if (packed_refs->lock)
912 die("internal error: packed-ref cache cleared while locked");
913 refs->packed = NULL;
914 release_packed_ref_cache(packed_refs);
918 static void clear_loose_ref_cache(struct ref_cache *refs)
920 if (refs->loose) {
921 free_ref_entry(refs->loose);
922 refs->loose = NULL;
926 static struct ref_cache *create_ref_cache(const char *submodule)
928 int len;
929 struct ref_cache *refs;
930 if (!submodule)
931 submodule = "";
932 len = strlen(submodule) + 1;
933 refs = xcalloc(1, sizeof(struct ref_cache) + len);
934 memcpy(refs->name, submodule, len);
935 return refs;
939 * Return a pointer to a ref_cache for the specified submodule. For
940 * the main repository, use submodule==NULL. The returned structure
941 * will be allocated and initialized but not necessarily populated; it
942 * should not be freed.
944 static struct ref_cache *get_ref_cache(const char *submodule)
946 struct ref_cache *refs;
948 if (!submodule || !*submodule)
949 return &ref_cache;
951 for (refs = submodule_ref_caches; refs; refs = refs->next)
952 if (!strcmp(submodule, refs->name))
953 return refs;
955 refs = create_ref_cache(submodule);
956 refs->next = submodule_ref_caches;
957 submodule_ref_caches = refs;
958 return refs;
961 /* The length of a peeled reference line in packed-refs, including EOL: */
962 #define PEELED_LINE_LENGTH 42
965 * The packed-refs header line that we write out. Perhaps other
966 * traits will be added later. The trailing space is required.
968 static const char PACKED_REFS_HEADER[] =
969 "# pack-refs with: peeled fully-peeled \n";
972 * Parse one line from a packed-refs file. Write the SHA1 to sha1.
973 * Return a pointer to the refname within the line (null-terminated),
974 * or NULL if there was a problem.
976 static const char *parse_ref_line(char *line, unsigned char *sha1)
979 * 42: the answer to everything.
981 * In this case, it happens to be the answer to
982 * 40 (length of sha1 hex representation)
983 * +1 (space in between hex and name)
984 * +1 (newline at the end of the line)
986 int len = strlen(line) - 42;
988 if (len <= 0)
989 return NULL;
990 if (get_sha1_hex(line, sha1) < 0)
991 return NULL;
992 if (!isspace(line[40]))
993 return NULL;
994 line += 41;
995 if (isspace(*line))
996 return NULL;
997 if (line[len] != '\n')
998 return NULL;
999 line[len] = 0;
1001 return line;
1005 * Read f, which is a packed-refs file, into dir.
1007 * A comment line of the form "# pack-refs with: " may contain zero or
1008 * more traits. We interpret the traits as follows:
1010 * No traits:
1012 * Probably no references are peeled. But if the file contains a
1013 * peeled value for a reference, we will use it.
1015 * peeled:
1017 * References under "refs/tags/", if they *can* be peeled, *are*
1018 * peeled in this file. References outside of "refs/tags/" are
1019 * probably not peeled even if they could have been, but if we find
1020 * a peeled value for such a reference we will use it.
1022 * fully-peeled:
1024 * All references in the file that can be peeled are peeled.
1025 * Inversely (and this is more important), any references in the
1026 * file for which no peeled value is recorded is not peelable. This
1027 * trait should typically be written alongside "peeled" for
1028 * compatibility with older clients, but we do not require it
1029 * (i.e., "peeled" is a no-op if "fully-peeled" is set).
1031 static void read_packed_refs(FILE *f, struct ref_dir *dir)
1033 struct ref_entry *last = NULL;
1034 char refline[PATH_MAX];
1035 enum { PEELED_NONE, PEELED_TAGS, PEELED_FULLY } peeled = PEELED_NONE;
1037 while (fgets(refline, sizeof(refline), f)) {
1038 unsigned char sha1[20];
1039 const char *refname;
1040 static const char header[] = "# pack-refs with:";
1042 if (!strncmp(refline, header, sizeof(header)-1)) {
1043 const char *traits = refline + sizeof(header) - 1;
1044 if (strstr(traits, " fully-peeled "))
1045 peeled = PEELED_FULLY;
1046 else if (strstr(traits, " peeled "))
1047 peeled = PEELED_TAGS;
1048 /* perhaps other traits later as well */
1049 continue;
1052 refname = parse_ref_line(refline, sha1);
1053 if (refname) {
1054 last = create_ref_entry(refname, sha1, REF_ISPACKED, 1);
1055 if (peeled == PEELED_FULLY ||
1056 (peeled == PEELED_TAGS && starts_with(refname, "refs/tags/")))
1057 last->flag |= REF_KNOWS_PEELED;
1058 add_ref(dir, last);
1059 continue;
1061 if (last &&
1062 refline[0] == '^' &&
1063 strlen(refline) == PEELED_LINE_LENGTH &&
1064 refline[PEELED_LINE_LENGTH - 1] == '\n' &&
1065 !get_sha1_hex(refline + 1, sha1)) {
1066 hashcpy(last->u.value.peeled, sha1);
1068 * Regardless of what the file header said,
1069 * we definitely know the value of *this*
1070 * reference:
1072 last->flag |= REF_KNOWS_PEELED;
1078 * Get the packed_ref_cache for the specified ref_cache, creating it
1079 * if necessary.
1081 static struct packed_ref_cache *get_packed_ref_cache(struct ref_cache *refs)
1083 const char *packed_refs_file;
1085 if (*refs->name)
1086 packed_refs_file = git_path_submodule(refs->name, "packed-refs");
1087 else
1088 packed_refs_file = git_path("packed-refs");
1090 if (refs->packed &&
1091 !stat_validity_check(&refs->packed->validity, packed_refs_file))
1092 clear_packed_ref_cache(refs);
1094 if (!refs->packed) {
1095 FILE *f;
1097 refs->packed = xcalloc(1, sizeof(*refs->packed));
1098 acquire_packed_ref_cache(refs->packed);
1099 refs->packed->root = create_dir_entry(refs, "", 0, 0);
1100 f = fopen(packed_refs_file, "r");
1101 if (f) {
1102 stat_validity_update(&refs->packed->validity, fileno(f));
1103 read_packed_refs(f, get_ref_dir(refs->packed->root));
1104 fclose(f);
1107 return refs->packed;
1110 static struct ref_dir *get_packed_ref_dir(struct packed_ref_cache *packed_ref_cache)
1112 return get_ref_dir(packed_ref_cache->root);
1115 static struct ref_dir *get_packed_refs(struct ref_cache *refs)
1117 return get_packed_ref_dir(get_packed_ref_cache(refs));
1120 void add_packed_ref(const char *refname, const unsigned char *sha1)
1122 struct packed_ref_cache *packed_ref_cache =
1123 get_packed_ref_cache(&ref_cache);
1125 if (!packed_ref_cache->lock)
1126 die("internal error: packed refs not locked");
1127 add_ref(get_packed_ref_dir(packed_ref_cache),
1128 create_ref_entry(refname, sha1, REF_ISPACKED, 1));
1132 * Read the loose references from the namespace dirname into dir
1133 * (without recursing). dirname must end with '/'. dir must be the
1134 * directory entry corresponding to dirname.
1136 static void read_loose_refs(const char *dirname, struct ref_dir *dir)
1138 struct ref_cache *refs = dir->ref_cache;
1139 DIR *d;
1140 const char *path;
1141 struct dirent *de;
1142 int dirnamelen = strlen(dirname);
1143 struct strbuf refname;
1145 if (*refs->name)
1146 path = git_path_submodule(refs->name, "%s", dirname);
1147 else
1148 path = git_path("%s", dirname);
1150 d = opendir(path);
1151 if (!d)
1152 return;
1154 strbuf_init(&refname, dirnamelen + 257);
1155 strbuf_add(&refname, dirname, dirnamelen);
1157 while ((de = readdir(d)) != NULL) {
1158 unsigned char sha1[20];
1159 struct stat st;
1160 int flag;
1161 const char *refdir;
1163 if (de->d_name[0] == '.')
1164 continue;
1165 if (has_extension(de->d_name, ".lock"))
1166 continue;
1167 strbuf_addstr(&refname, de->d_name);
1168 refdir = *refs->name
1169 ? git_path_submodule(refs->name, "%s", refname.buf)
1170 : git_path("%s", refname.buf);
1171 if (stat(refdir, &st) < 0) {
1172 ; /* silently ignore */
1173 } else if (S_ISDIR(st.st_mode)) {
1174 strbuf_addch(&refname, '/');
1175 add_entry_to_dir(dir,
1176 create_dir_entry(refs, refname.buf,
1177 refname.len, 1));
1178 } else {
1179 if (*refs->name) {
1180 hashclr(sha1);
1181 flag = 0;
1182 if (resolve_gitlink_ref(refs->name, refname.buf, sha1) < 0) {
1183 hashclr(sha1);
1184 flag |= REF_ISBROKEN;
1186 } else if (read_ref_full(refname.buf, sha1, 1, &flag)) {
1187 hashclr(sha1);
1188 flag |= REF_ISBROKEN;
1190 add_entry_to_dir(dir,
1191 create_ref_entry(refname.buf, sha1, flag, 1));
1193 strbuf_setlen(&refname, dirnamelen);
1195 strbuf_release(&refname);
1196 closedir(d);
1199 static struct ref_dir *get_loose_refs(struct ref_cache *refs)
1201 if (!refs->loose) {
1203 * Mark the top-level directory complete because we
1204 * are about to read the only subdirectory that can
1205 * hold references:
1207 refs->loose = create_dir_entry(refs, "", 0, 0);
1209 * Create an incomplete entry for "refs/":
1211 add_entry_to_dir(get_ref_dir(refs->loose),
1212 create_dir_entry(refs, "refs/", 5, 1));
1214 return get_ref_dir(refs->loose);
1217 /* We allow "recursive" symbolic refs. Only within reason, though */
1218 #define MAXDEPTH 5
1219 #define MAXREFLEN (1024)
1222 * Called by resolve_gitlink_ref_recursive() after it failed to read
1223 * from the loose refs in ref_cache refs. Find <refname> in the
1224 * packed-refs file for the submodule.
1226 static int resolve_gitlink_packed_ref(struct ref_cache *refs,
1227 const char *refname, unsigned char *sha1)
1229 struct ref_entry *ref;
1230 struct ref_dir *dir = get_packed_refs(refs);
1232 ref = find_ref(dir, refname);
1233 if (ref == NULL)
1234 return -1;
1236 hashcpy(sha1, ref->u.value.sha1);
1237 return 0;
1240 static int resolve_gitlink_ref_recursive(struct ref_cache *refs,
1241 const char *refname, unsigned char *sha1,
1242 int recursion)
1244 int fd, len;
1245 char buffer[128], *p;
1246 char *path;
1248 if (recursion > MAXDEPTH || strlen(refname) > MAXREFLEN)
1249 return -1;
1250 path = *refs->name
1251 ? git_path_submodule(refs->name, "%s", refname)
1252 : git_path("%s", refname);
1253 fd = open(path, O_RDONLY);
1254 if (fd < 0)
1255 return resolve_gitlink_packed_ref(refs, refname, sha1);
1257 len = read(fd, buffer, sizeof(buffer)-1);
1258 close(fd);
1259 if (len < 0)
1260 return -1;
1261 while (len && isspace(buffer[len-1]))
1262 len--;
1263 buffer[len] = 0;
1265 /* Was it a detached head or an old-fashioned symlink? */
1266 if (!get_sha1_hex(buffer, sha1))
1267 return 0;
1269 /* Symref? */
1270 if (strncmp(buffer, "ref:", 4))
1271 return -1;
1272 p = buffer + 4;
1273 while (isspace(*p))
1274 p++;
1276 return resolve_gitlink_ref_recursive(refs, p, sha1, recursion+1);
1279 int resolve_gitlink_ref(const char *path, const char *refname, unsigned char *sha1)
1281 int len = strlen(path), retval;
1282 char *submodule;
1283 struct ref_cache *refs;
1285 while (len && path[len-1] == '/')
1286 len--;
1287 if (!len)
1288 return -1;
1289 submodule = xstrndup(path, len);
1290 refs = get_ref_cache(submodule);
1291 free(submodule);
1293 retval = resolve_gitlink_ref_recursive(refs, refname, sha1, 0);
1294 return retval;
1298 * Return the ref_entry for the given refname from the packed
1299 * references. If it does not exist, return NULL.
1301 static struct ref_entry *get_packed_ref(const char *refname)
1303 return find_ref(get_packed_refs(&ref_cache), refname);
1307 * A loose ref file doesn't exist; check for a packed ref. The
1308 * options are forwarded from resolve_safe_unsafe().
1310 static const char *handle_missing_loose_ref(const char *refname,
1311 unsigned char *sha1,
1312 int reading,
1313 int *flag)
1315 struct ref_entry *entry;
1318 * The loose reference file does not exist; check for a packed
1319 * reference.
1321 entry = get_packed_ref(refname);
1322 if (entry) {
1323 hashcpy(sha1, entry->u.value.sha1);
1324 if (flag)
1325 *flag |= REF_ISPACKED;
1326 return refname;
1328 /* The reference is not a packed reference, either. */
1329 if (reading) {
1330 return NULL;
1331 } else {
1332 hashclr(sha1);
1333 return refname;
1337 const char *resolve_ref_unsafe(const char *refname, unsigned char *sha1, int reading, int *flag)
1339 int depth = MAXDEPTH;
1340 ssize_t len;
1341 char buffer[256];
1342 static char refname_buffer[256];
1344 if (flag)
1345 *flag = 0;
1347 if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL))
1348 return NULL;
1350 for (;;) {
1351 char path[PATH_MAX];
1352 struct stat st;
1353 char *buf;
1354 int fd;
1356 if (--depth < 0)
1357 return NULL;
1359 git_snpath(path, sizeof(path), "%s", refname);
1362 * We might have to loop back here to avoid a race
1363 * condition: first we lstat() the file, then we try
1364 * to read it as a link or as a file. But if somebody
1365 * changes the type of the file (file <-> directory
1366 * <-> symlink) between the lstat() and reading, then
1367 * we don't want to report that as an error but rather
1368 * try again starting with the lstat().
1370 stat_ref:
1371 if (lstat(path, &st) < 0) {
1372 if (errno == ENOENT)
1373 return handle_missing_loose_ref(refname, sha1,
1374 reading, flag);
1375 else
1376 return NULL;
1379 /* Follow "normalized" - ie "refs/.." symlinks by hand */
1380 if (S_ISLNK(st.st_mode)) {
1381 len = readlink(path, buffer, sizeof(buffer)-1);
1382 if (len < 0) {
1383 if (errno == ENOENT || errno == EINVAL)
1384 /* inconsistent with lstat; retry */
1385 goto stat_ref;
1386 else
1387 return NULL;
1389 buffer[len] = 0;
1390 if (starts_with(buffer, "refs/") &&
1391 !check_refname_format(buffer, 0)) {
1392 strcpy(refname_buffer, buffer);
1393 refname = refname_buffer;
1394 if (flag)
1395 *flag |= REF_ISSYMREF;
1396 continue;
1400 /* Is it a directory? */
1401 if (S_ISDIR(st.st_mode)) {
1402 errno = EISDIR;
1403 return NULL;
1407 * Anything else, just open it and try to use it as
1408 * a ref
1410 fd = open(path, O_RDONLY);
1411 if (fd < 0) {
1412 if (errno == ENOENT)
1413 /* inconsistent with lstat; retry */
1414 goto stat_ref;
1415 else
1416 return NULL;
1418 len = read_in_full(fd, buffer, sizeof(buffer)-1);
1419 close(fd);
1420 if (len < 0)
1421 return NULL;
1422 while (len && isspace(buffer[len-1]))
1423 len--;
1424 buffer[len] = '\0';
1427 * Is it a symbolic ref?
1429 if (!starts_with(buffer, "ref:")) {
1431 * Please note that FETCH_HEAD has a second
1432 * line containing other data.
1434 if (get_sha1_hex(buffer, sha1) ||
1435 (buffer[40] != '\0' && !isspace(buffer[40]))) {
1436 if (flag)
1437 *flag |= REF_ISBROKEN;
1438 return NULL;
1440 return refname;
1442 if (flag)
1443 *flag |= REF_ISSYMREF;
1444 buf = buffer + 4;
1445 while (isspace(*buf))
1446 buf++;
1447 if (check_refname_format(buf, REFNAME_ALLOW_ONELEVEL)) {
1448 if (flag)
1449 *flag |= REF_ISBROKEN;
1450 return NULL;
1452 refname = strcpy(refname_buffer, buf);
1456 char *resolve_refdup(const char *ref, unsigned char *sha1, int reading, int *flag)
1458 const char *ret = resolve_ref_unsafe(ref, sha1, reading, flag);
1459 return ret ? xstrdup(ret) : NULL;
1462 /* The argument to filter_refs */
1463 struct ref_filter {
1464 const char *pattern;
1465 each_ref_fn *fn;
1466 void *cb_data;
1469 int read_ref_full(const char *refname, unsigned char *sha1, int reading, int *flags)
1471 if (resolve_ref_unsafe(refname, sha1, reading, flags))
1472 return 0;
1473 return -1;
1476 int read_ref(const char *refname, unsigned char *sha1)
1478 return read_ref_full(refname, sha1, 1, NULL);
1481 int ref_exists(const char *refname)
1483 unsigned char sha1[20];
1484 return !!resolve_ref_unsafe(refname, sha1, 1, NULL);
1487 static int filter_refs(const char *refname, const unsigned char *sha1, int flags,
1488 void *data)
1490 struct ref_filter *filter = (struct ref_filter *)data;
1491 if (wildmatch(filter->pattern, refname, 0, NULL))
1492 return 0;
1493 return filter->fn(refname, sha1, flags, filter->cb_data);
1496 enum peel_status {
1497 /* object was peeled successfully: */
1498 PEEL_PEELED = 0,
1501 * object cannot be peeled because the named object (or an
1502 * object referred to by a tag in the peel chain), does not
1503 * exist.
1505 PEEL_INVALID = -1,
1507 /* object cannot be peeled because it is not a tag: */
1508 PEEL_NON_TAG = -2,
1510 /* ref_entry contains no peeled value because it is a symref: */
1511 PEEL_IS_SYMREF = -3,
1514 * ref_entry cannot be peeled because it is broken (i.e., the
1515 * symbolic reference cannot even be resolved to an object
1516 * name):
1518 PEEL_BROKEN = -4
1522 * Peel the named object; i.e., if the object is a tag, resolve the
1523 * tag recursively until a non-tag is found. If successful, store the
1524 * result to sha1 and return PEEL_PEELED. If the object is not a tag
1525 * or is not valid, return PEEL_NON_TAG or PEEL_INVALID, respectively,
1526 * and leave sha1 unchanged.
1528 static enum peel_status peel_object(const unsigned char *name, unsigned char *sha1)
1530 struct object *o = lookup_unknown_object(name);
1532 if (o->type == OBJ_NONE) {
1533 int type = sha1_object_info(name, NULL);
1534 if (type < 0)
1535 return PEEL_INVALID;
1536 o->type = type;
1539 if (o->type != OBJ_TAG)
1540 return PEEL_NON_TAG;
1542 o = deref_tag_noverify(o);
1543 if (!o)
1544 return PEEL_INVALID;
1546 hashcpy(sha1, o->sha1);
1547 return PEEL_PEELED;
1551 * Peel the entry (if possible) and return its new peel_status. If
1552 * repeel is true, re-peel the entry even if there is an old peeled
1553 * value that is already stored in it.
1555 * It is OK to call this function with a packed reference entry that
1556 * might be stale and might even refer to an object that has since
1557 * been garbage-collected. In such a case, if the entry has
1558 * REF_KNOWS_PEELED then leave the status unchanged and return
1559 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.
1561 static enum peel_status peel_entry(struct ref_entry *entry, int repeel)
1563 enum peel_status status;
1565 if (entry->flag & REF_KNOWS_PEELED) {
1566 if (repeel) {
1567 entry->flag &= ~REF_KNOWS_PEELED;
1568 hashclr(entry->u.value.peeled);
1569 } else {
1570 return is_null_sha1(entry->u.value.peeled) ?
1571 PEEL_NON_TAG : PEEL_PEELED;
1574 if (entry->flag & REF_ISBROKEN)
1575 return PEEL_BROKEN;
1576 if (entry->flag & REF_ISSYMREF)
1577 return PEEL_IS_SYMREF;
1579 status = peel_object(entry->u.value.sha1, entry->u.value.peeled);
1580 if (status == PEEL_PEELED || status == PEEL_NON_TAG)
1581 entry->flag |= REF_KNOWS_PEELED;
1582 return status;
1585 int peel_ref(const char *refname, unsigned char *sha1)
1587 int flag;
1588 unsigned char base[20];
1590 if (current_ref && (current_ref->name == refname
1591 || !strcmp(current_ref->name, refname))) {
1592 if (peel_entry(current_ref, 0))
1593 return -1;
1594 hashcpy(sha1, current_ref->u.value.peeled);
1595 return 0;
1598 if (read_ref_full(refname, base, 1, &flag))
1599 return -1;
1602 * If the reference is packed, read its ref_entry from the
1603 * cache in the hope that we already know its peeled value.
1604 * We only try this optimization on packed references because
1605 * (a) forcing the filling of the loose reference cache could
1606 * be expensive and (b) loose references anyway usually do not
1607 * have REF_KNOWS_PEELED.
1609 if (flag & REF_ISPACKED) {
1610 struct ref_entry *r = get_packed_ref(refname);
1611 if (r) {
1612 if (peel_entry(r, 0))
1613 return -1;
1614 hashcpy(sha1, r->u.value.peeled);
1615 return 0;
1619 return peel_object(base, sha1);
1622 struct warn_if_dangling_data {
1623 FILE *fp;
1624 const char *refname;
1625 const struct string_list *refnames;
1626 const char *msg_fmt;
1629 static int warn_if_dangling_symref(const char *refname, const unsigned char *sha1,
1630 int flags, void *cb_data)
1632 struct warn_if_dangling_data *d = cb_data;
1633 const char *resolves_to;
1634 unsigned char junk[20];
1636 if (!(flags & REF_ISSYMREF))
1637 return 0;
1639 resolves_to = resolve_ref_unsafe(refname, junk, 0, NULL);
1640 if (!resolves_to
1641 || (d->refname
1642 ? strcmp(resolves_to, d->refname)
1643 : !string_list_has_string(d->refnames, resolves_to))) {
1644 return 0;
1647 fprintf(d->fp, d->msg_fmt, refname);
1648 fputc('\n', d->fp);
1649 return 0;
1652 void warn_dangling_symref(FILE *fp, const char *msg_fmt, const char *refname)
1654 struct warn_if_dangling_data data;
1656 data.fp = fp;
1657 data.refname = refname;
1658 data.refnames = NULL;
1659 data.msg_fmt = msg_fmt;
1660 for_each_rawref(warn_if_dangling_symref, &data);
1663 void warn_dangling_symrefs(FILE *fp, const char *msg_fmt, const struct string_list *refnames)
1665 struct warn_if_dangling_data data;
1667 data.fp = fp;
1668 data.refname = NULL;
1669 data.refnames = refnames;
1670 data.msg_fmt = msg_fmt;
1671 for_each_rawref(warn_if_dangling_symref, &data);
1675 * Call fn for each reference in the specified ref_cache, omitting
1676 * references not in the containing_dir of base. fn is called for all
1677 * references, including broken ones. If fn ever returns a non-zero
1678 * value, stop the iteration and return that value; otherwise, return
1679 * 0.
1681 static int do_for_each_entry(struct ref_cache *refs, const char *base,
1682 each_ref_entry_fn fn, void *cb_data)
1684 struct packed_ref_cache *packed_ref_cache;
1685 struct ref_dir *loose_dir;
1686 struct ref_dir *packed_dir;
1687 int retval = 0;
1690 * We must make sure that all loose refs are read before accessing the
1691 * packed-refs file; this avoids a race condition in which loose refs
1692 * are migrated to the packed-refs file by a simultaneous process, but
1693 * our in-memory view is from before the migration. get_packed_ref_cache()
1694 * takes care of making sure our view is up to date with what is on
1695 * disk.
1697 loose_dir = get_loose_refs(refs);
1698 if (base && *base) {
1699 loose_dir = find_containing_dir(loose_dir, base, 0);
1701 if (loose_dir)
1702 prime_ref_dir(loose_dir);
1704 packed_ref_cache = get_packed_ref_cache(refs);
1705 acquire_packed_ref_cache(packed_ref_cache);
1706 packed_dir = get_packed_ref_dir(packed_ref_cache);
1707 if (base && *base) {
1708 packed_dir = find_containing_dir(packed_dir, base, 0);
1711 if (packed_dir && loose_dir) {
1712 sort_ref_dir(packed_dir);
1713 sort_ref_dir(loose_dir);
1714 retval = do_for_each_entry_in_dirs(
1715 packed_dir, loose_dir, fn, cb_data);
1716 } else if (packed_dir) {
1717 sort_ref_dir(packed_dir);
1718 retval = do_for_each_entry_in_dir(
1719 packed_dir, 0, fn, cb_data);
1720 } else if (loose_dir) {
1721 sort_ref_dir(loose_dir);
1722 retval = do_for_each_entry_in_dir(
1723 loose_dir, 0, fn, cb_data);
1726 release_packed_ref_cache(packed_ref_cache);
1727 return retval;
1731 * Call fn for each reference in the specified ref_cache for which the
1732 * refname begins with base. If trim is non-zero, then trim that many
1733 * characters off the beginning of each refname before passing the
1734 * refname to fn. flags can be DO_FOR_EACH_INCLUDE_BROKEN to include
1735 * broken references in the iteration. If fn ever returns a non-zero
1736 * value, stop the iteration and return that value; otherwise, return
1737 * 0.
1739 static int do_for_each_ref(struct ref_cache *refs, const char *base,
1740 each_ref_fn fn, int trim, int flags, void *cb_data)
1742 struct ref_entry_cb data;
1743 data.base = base;
1744 data.trim = trim;
1745 data.flags = flags;
1746 data.fn = fn;
1747 data.cb_data = cb_data;
1749 return do_for_each_entry(refs, base, do_one_ref, &data);
1752 static int do_head_ref(const char *submodule, each_ref_fn fn, void *cb_data)
1754 unsigned char sha1[20];
1755 int flag;
1757 if (submodule) {
1758 if (resolve_gitlink_ref(submodule, "HEAD", sha1) == 0)
1759 return fn("HEAD", sha1, 0, cb_data);
1761 return 0;
1764 if (!read_ref_full("HEAD", sha1, 1, &flag))
1765 return fn("HEAD", sha1, flag, cb_data);
1767 return 0;
1770 int head_ref(each_ref_fn fn, void *cb_data)
1772 return do_head_ref(NULL, fn, cb_data);
1775 int head_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
1777 return do_head_ref(submodule, fn, cb_data);
1780 int for_each_ref(each_ref_fn fn, void *cb_data)
1782 return do_for_each_ref(&ref_cache, "", fn, 0, 0, cb_data);
1785 int for_each_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
1787 return do_for_each_ref(get_ref_cache(submodule), "", fn, 0, 0, cb_data);
1790 int for_each_ref_in(const char *prefix, each_ref_fn fn, void *cb_data)
1792 return do_for_each_ref(&ref_cache, prefix, fn, strlen(prefix), 0, cb_data);
1795 int for_each_ref_in_submodule(const char *submodule, const char *prefix,
1796 each_ref_fn fn, void *cb_data)
1798 return do_for_each_ref(get_ref_cache(submodule), prefix, fn, strlen(prefix), 0, cb_data);
1801 int for_each_tag_ref(each_ref_fn fn, void *cb_data)
1803 return for_each_ref_in("refs/tags/", fn, cb_data);
1806 int for_each_tag_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
1808 return for_each_ref_in_submodule(submodule, "refs/tags/", fn, cb_data);
1811 int for_each_branch_ref(each_ref_fn fn, void *cb_data)
1813 return for_each_ref_in("refs/heads/", fn, cb_data);
1816 int for_each_branch_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
1818 return for_each_ref_in_submodule(submodule, "refs/heads/", fn, cb_data);
1821 int for_each_remote_ref(each_ref_fn fn, void *cb_data)
1823 return for_each_ref_in("refs/remotes/", fn, cb_data);
1826 int for_each_remote_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
1828 return for_each_ref_in_submodule(submodule, "refs/remotes/", fn, cb_data);
1831 int for_each_replace_ref(each_ref_fn fn, void *cb_data)
1833 return do_for_each_ref(&ref_cache, "refs/replace/", fn, 13, 0, cb_data);
1836 int head_ref_namespaced(each_ref_fn fn, void *cb_data)
1838 struct strbuf buf = STRBUF_INIT;
1839 int ret = 0;
1840 unsigned char sha1[20];
1841 int flag;
1843 strbuf_addf(&buf, "%sHEAD", get_git_namespace());
1844 if (!read_ref_full(buf.buf, sha1, 1, &flag))
1845 ret = fn(buf.buf, sha1, flag, cb_data);
1846 strbuf_release(&buf);
1848 return ret;
1851 int for_each_namespaced_ref(each_ref_fn fn, void *cb_data)
1853 struct strbuf buf = STRBUF_INIT;
1854 int ret;
1855 strbuf_addf(&buf, "%srefs/", get_git_namespace());
1856 ret = do_for_each_ref(&ref_cache, buf.buf, fn, 0, 0, cb_data);
1857 strbuf_release(&buf);
1858 return ret;
1861 int for_each_glob_ref_in(each_ref_fn fn, const char *pattern,
1862 const char *prefix, void *cb_data)
1864 struct strbuf real_pattern = STRBUF_INIT;
1865 struct ref_filter filter;
1866 int ret;
1868 if (!prefix && !starts_with(pattern, "refs/"))
1869 strbuf_addstr(&real_pattern, "refs/");
1870 else if (prefix)
1871 strbuf_addstr(&real_pattern, prefix);
1872 strbuf_addstr(&real_pattern, pattern);
1874 if (!has_glob_specials(pattern)) {
1875 /* Append implied '/' '*' if not present. */
1876 if (real_pattern.buf[real_pattern.len - 1] != '/')
1877 strbuf_addch(&real_pattern, '/');
1878 /* No need to check for '*', there is none. */
1879 strbuf_addch(&real_pattern, '*');
1882 filter.pattern = real_pattern.buf;
1883 filter.fn = fn;
1884 filter.cb_data = cb_data;
1885 ret = for_each_ref(filter_refs, &filter);
1887 strbuf_release(&real_pattern);
1888 return ret;
1891 int for_each_glob_ref(each_ref_fn fn, const char *pattern, void *cb_data)
1893 return for_each_glob_ref_in(fn, pattern, NULL, cb_data);
1896 int for_each_rawref(each_ref_fn fn, void *cb_data)
1898 return do_for_each_ref(&ref_cache, "", fn, 0,
1899 DO_FOR_EACH_INCLUDE_BROKEN, cb_data);
1902 const char *prettify_refname(const char *name)
1904 return name + (
1905 starts_with(name, "refs/heads/") ? 11 :
1906 starts_with(name, "refs/tags/") ? 10 :
1907 starts_with(name, "refs/remotes/") ? 13 :
1911 static const char *ref_rev_parse_rules[] = {
1912 "%.*s",
1913 "refs/%.*s",
1914 "refs/tags/%.*s",
1915 "refs/heads/%.*s",
1916 "refs/remotes/%.*s",
1917 "refs/remotes/%.*s/HEAD",
1918 NULL
1921 int refname_match(const char *abbrev_name, const char *full_name)
1923 const char **p;
1924 const int abbrev_name_len = strlen(abbrev_name);
1926 for (p = ref_rev_parse_rules; *p; p++) {
1927 if (!strcmp(full_name, mkpath(*p, abbrev_name_len, abbrev_name))) {
1928 return 1;
1932 return 0;
1935 static struct ref_lock *verify_lock(struct ref_lock *lock,
1936 const unsigned char *old_sha1, int mustexist)
1938 if (read_ref_full(lock->ref_name, lock->old_sha1, mustexist, NULL)) {
1939 error("Can't verify ref %s", lock->ref_name);
1940 unlock_ref(lock);
1941 return NULL;
1943 if (hashcmp(lock->old_sha1, old_sha1)) {
1944 error("Ref %s is at %s but expected %s", lock->ref_name,
1945 sha1_to_hex(lock->old_sha1), sha1_to_hex(old_sha1));
1946 unlock_ref(lock);
1947 return NULL;
1949 return lock;
1952 static int remove_empty_directories(const char *file)
1954 /* we want to create a file but there is a directory there;
1955 * if that is an empty directory (or a directory that contains
1956 * only empty directories), remove them.
1958 struct strbuf path;
1959 int result;
1961 strbuf_init(&path, 20);
1962 strbuf_addstr(&path, file);
1964 result = remove_dir_recursively(&path, REMOVE_DIR_EMPTY_ONLY);
1966 strbuf_release(&path);
1968 return result;
1972 * *string and *len will only be substituted, and *string returned (for
1973 * later free()ing) if the string passed in is a magic short-hand form
1974 * to name a branch.
1976 static char *substitute_branch_name(const char **string, int *len)
1978 struct strbuf buf = STRBUF_INIT;
1979 int ret = interpret_branch_name(*string, *len, &buf);
1981 if (ret == *len) {
1982 size_t size;
1983 *string = strbuf_detach(&buf, &size);
1984 *len = size;
1985 return (char *)*string;
1988 return NULL;
1991 int dwim_ref(const char *str, int len, unsigned char *sha1, char **ref)
1993 char *last_branch = substitute_branch_name(&str, &len);
1994 const char **p, *r;
1995 int refs_found = 0;
1997 *ref = NULL;
1998 for (p = ref_rev_parse_rules; *p; p++) {
1999 char fullref[PATH_MAX];
2000 unsigned char sha1_from_ref[20];
2001 unsigned char *this_result;
2002 int flag;
2004 this_result = refs_found ? sha1_from_ref : sha1;
2005 mksnpath(fullref, sizeof(fullref), *p, len, str);
2006 r = resolve_ref_unsafe(fullref, this_result, 1, &flag);
2007 if (r) {
2008 if (!refs_found++)
2009 *ref = xstrdup(r);
2010 if (!warn_ambiguous_refs)
2011 break;
2012 } else if ((flag & REF_ISSYMREF) && strcmp(fullref, "HEAD")) {
2013 warning("ignoring dangling symref %s.", fullref);
2014 } else if ((flag & REF_ISBROKEN) && strchr(fullref, '/')) {
2015 warning("ignoring broken ref %s.", fullref);
2018 free(last_branch);
2019 return refs_found;
2022 int dwim_log(const char *str, int len, unsigned char *sha1, char **log)
2024 char *last_branch = substitute_branch_name(&str, &len);
2025 const char **p;
2026 int logs_found = 0;
2028 *log = NULL;
2029 for (p = ref_rev_parse_rules; *p; p++) {
2030 unsigned char hash[20];
2031 char path[PATH_MAX];
2032 const char *ref, *it;
2034 mksnpath(path, sizeof(path), *p, len, str);
2035 ref = resolve_ref_unsafe(path, hash, 1, NULL);
2036 if (!ref)
2037 continue;
2038 if (reflog_exists(path))
2039 it = path;
2040 else if (strcmp(ref, path) && reflog_exists(ref))
2041 it = ref;
2042 else
2043 continue;
2044 if (!logs_found++) {
2045 *log = xstrdup(it);
2046 hashcpy(sha1, hash);
2048 if (!warn_ambiguous_refs)
2049 break;
2051 free(last_branch);
2052 return logs_found;
2055 static struct ref_lock *lock_ref_sha1_basic(const char *refname,
2056 const unsigned char *old_sha1,
2057 int flags, int *type_p)
2059 char *ref_file;
2060 const char *orig_refname = refname;
2061 struct ref_lock *lock;
2062 int last_errno = 0;
2063 int type, lflags;
2064 int mustexist = (old_sha1 && !is_null_sha1(old_sha1));
2065 int missing = 0;
2066 int attempts_remaining = 3;
2068 lock = xcalloc(1, sizeof(struct ref_lock));
2069 lock->lock_fd = -1;
2071 refname = resolve_ref_unsafe(refname, lock->old_sha1, mustexist, &type);
2072 if (!refname && errno == EISDIR) {
2073 /* we are trying to lock foo but we used to
2074 * have foo/bar which now does not exist;
2075 * it is normal for the empty directory 'foo'
2076 * to remain.
2078 ref_file = git_path("%s", orig_refname);
2079 if (remove_empty_directories(ref_file)) {
2080 last_errno = errno;
2081 error("there are still refs under '%s'", orig_refname);
2082 goto error_return;
2084 refname = resolve_ref_unsafe(orig_refname, lock->old_sha1, mustexist, &type);
2086 if (type_p)
2087 *type_p = type;
2088 if (!refname) {
2089 last_errno = errno;
2090 error("unable to resolve reference %s: %s",
2091 orig_refname, strerror(errno));
2092 goto error_return;
2094 missing = is_null_sha1(lock->old_sha1);
2095 /* When the ref did not exist and we are creating it,
2096 * make sure there is no existing ref that is packed
2097 * whose name begins with our refname, nor a ref whose
2098 * name is a proper prefix of our refname.
2100 if (missing &&
2101 !is_refname_available(refname, NULL, get_packed_refs(&ref_cache))) {
2102 last_errno = ENOTDIR;
2103 goto error_return;
2106 lock->lk = xcalloc(1, sizeof(struct lock_file));
2108 lflags = 0;
2109 if (flags & REF_NODEREF) {
2110 refname = orig_refname;
2111 lflags |= LOCK_NODEREF;
2113 lock->ref_name = xstrdup(refname);
2114 lock->orig_ref_name = xstrdup(orig_refname);
2115 ref_file = git_path("%s", refname);
2116 if (missing)
2117 lock->force_write = 1;
2118 if ((flags & REF_NODEREF) && (type & REF_ISSYMREF))
2119 lock->force_write = 1;
2121 retry:
2122 switch (safe_create_leading_directories(ref_file)) {
2123 case SCLD_OK:
2124 break; /* success */
2125 case SCLD_VANISHED:
2126 if (--attempts_remaining > 0)
2127 goto retry;
2128 /* fall through */
2129 default:
2130 last_errno = errno;
2131 error("unable to create directory for %s", ref_file);
2132 goto error_return;
2135 lock->lock_fd = hold_lock_file_for_update(lock->lk, ref_file, lflags);
2136 if (lock->lock_fd < 0) {
2137 if (errno == ENOENT && --attempts_remaining > 0)
2139 * Maybe somebody just deleted one of the
2140 * directories leading to ref_file. Try
2141 * again:
2143 goto retry;
2144 else
2145 unable_to_lock_index_die(ref_file, errno);
2147 return old_sha1 ? verify_lock(lock, old_sha1, mustexist) : lock;
2149 error_return:
2150 unlock_ref(lock);
2151 errno = last_errno;
2152 return NULL;
2155 struct ref_lock *lock_ref_sha1(const char *refname, const unsigned char *old_sha1)
2157 char refpath[PATH_MAX];
2158 if (check_refname_format(refname, 0))
2159 return NULL;
2160 strcpy(refpath, mkpath("refs/%s", refname));
2161 return lock_ref_sha1_basic(refpath, old_sha1, 0, NULL);
2164 struct ref_lock *lock_any_ref_for_update(const char *refname,
2165 const unsigned char *old_sha1,
2166 int flags, int *type_p)
2168 if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL))
2169 return NULL;
2170 return lock_ref_sha1_basic(refname, old_sha1, flags, type_p);
2174 * Write an entry to the packed-refs file for the specified refname.
2175 * If peeled is non-NULL, write it as the entry's peeled value.
2177 static void write_packed_entry(int fd, char *refname, unsigned char *sha1,
2178 unsigned char *peeled)
2180 char line[PATH_MAX + 100];
2181 int len;
2183 len = snprintf(line, sizeof(line), "%s %s\n",
2184 sha1_to_hex(sha1), refname);
2185 /* this should not happen but just being defensive */
2186 if (len > sizeof(line))
2187 die("too long a refname '%s'", refname);
2188 write_or_die(fd, line, len);
2190 if (peeled) {
2191 if (snprintf(line, sizeof(line), "^%s\n",
2192 sha1_to_hex(peeled)) != PEELED_LINE_LENGTH)
2193 die("internal error");
2194 write_or_die(fd, line, PEELED_LINE_LENGTH);
2199 * An each_ref_entry_fn that writes the entry to a packed-refs file.
2201 static int write_packed_entry_fn(struct ref_entry *entry, void *cb_data)
2203 int *fd = cb_data;
2204 enum peel_status peel_status = peel_entry(entry, 0);
2206 if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)
2207 error("internal error: %s is not a valid packed reference!",
2208 entry->name);
2209 write_packed_entry(*fd, entry->name, entry->u.value.sha1,
2210 peel_status == PEEL_PEELED ?
2211 entry->u.value.peeled : NULL);
2212 return 0;
2215 int lock_packed_refs(int flags)
2217 struct packed_ref_cache *packed_ref_cache;
2219 if (hold_lock_file_for_update(&packlock, git_path("packed-refs"), flags) < 0)
2220 return -1;
2222 * Get the current packed-refs while holding the lock. If the
2223 * packed-refs file has been modified since we last read it,
2224 * this will automatically invalidate the cache and re-read
2225 * the packed-refs file.
2227 packed_ref_cache = get_packed_ref_cache(&ref_cache);
2228 packed_ref_cache->lock = &packlock;
2229 /* Increment the reference count to prevent it from being freed: */
2230 acquire_packed_ref_cache(packed_ref_cache);
2231 return 0;
2234 int commit_packed_refs(void)
2236 struct packed_ref_cache *packed_ref_cache =
2237 get_packed_ref_cache(&ref_cache);
2238 int error = 0;
2240 if (!packed_ref_cache->lock)
2241 die("internal error: packed-refs not locked");
2242 write_or_die(packed_ref_cache->lock->fd,
2243 PACKED_REFS_HEADER, strlen(PACKED_REFS_HEADER));
2245 do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache),
2246 0, write_packed_entry_fn,
2247 &packed_ref_cache->lock->fd);
2248 if (commit_lock_file(packed_ref_cache->lock))
2249 error = -1;
2250 packed_ref_cache->lock = NULL;
2251 release_packed_ref_cache(packed_ref_cache);
2252 return error;
2255 void rollback_packed_refs(void)
2257 struct packed_ref_cache *packed_ref_cache =
2258 get_packed_ref_cache(&ref_cache);
2260 if (!packed_ref_cache->lock)
2261 die("internal error: packed-refs not locked");
2262 rollback_lock_file(packed_ref_cache->lock);
2263 packed_ref_cache->lock = NULL;
2264 release_packed_ref_cache(packed_ref_cache);
2265 clear_packed_ref_cache(&ref_cache);
2268 struct ref_to_prune {
2269 struct ref_to_prune *next;
2270 unsigned char sha1[20];
2271 char name[FLEX_ARRAY];
2274 struct pack_refs_cb_data {
2275 unsigned int flags;
2276 struct ref_dir *packed_refs;
2277 struct ref_to_prune *ref_to_prune;
2281 * An each_ref_entry_fn that is run over loose references only. If
2282 * the loose reference can be packed, add an entry in the packed ref
2283 * cache. If the reference should be pruned, also add it to
2284 * ref_to_prune in the pack_refs_cb_data.
2286 static int pack_if_possible_fn(struct ref_entry *entry, void *cb_data)
2288 struct pack_refs_cb_data *cb = cb_data;
2289 enum peel_status peel_status;
2290 struct ref_entry *packed_entry;
2291 int is_tag_ref = starts_with(entry->name, "refs/tags/");
2293 /* ALWAYS pack tags */
2294 if (!(cb->flags & PACK_REFS_ALL) && !is_tag_ref)
2295 return 0;
2297 /* Do not pack symbolic or broken refs: */
2298 if ((entry->flag & REF_ISSYMREF) || !ref_resolves_to_object(entry))
2299 return 0;
2301 /* Add a packed ref cache entry equivalent to the loose entry. */
2302 peel_status = peel_entry(entry, 1);
2303 if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)
2304 die("internal error peeling reference %s (%s)",
2305 entry->name, sha1_to_hex(entry->u.value.sha1));
2306 packed_entry = find_ref(cb->packed_refs, entry->name);
2307 if (packed_entry) {
2308 /* Overwrite existing packed entry with info from loose entry */
2309 packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED;
2310 hashcpy(packed_entry->u.value.sha1, entry->u.value.sha1);
2311 } else {
2312 packed_entry = create_ref_entry(entry->name, entry->u.value.sha1,
2313 REF_ISPACKED | REF_KNOWS_PEELED, 0);
2314 add_ref(cb->packed_refs, packed_entry);
2316 hashcpy(packed_entry->u.value.peeled, entry->u.value.peeled);
2318 /* Schedule the loose reference for pruning if requested. */
2319 if ((cb->flags & PACK_REFS_PRUNE)) {
2320 int namelen = strlen(entry->name) + 1;
2321 struct ref_to_prune *n = xcalloc(1, sizeof(*n) + namelen);
2322 hashcpy(n->sha1, entry->u.value.sha1);
2323 strcpy(n->name, entry->name);
2324 n->next = cb->ref_to_prune;
2325 cb->ref_to_prune = n;
2327 return 0;
2331 * Remove empty parents, but spare refs/ and immediate subdirs.
2332 * Note: munges *name.
2334 static void try_remove_empty_parents(char *name)
2336 char *p, *q;
2337 int i;
2338 p = name;
2339 for (i = 0; i < 2; i++) { /* refs/{heads,tags,...}/ */
2340 while (*p && *p != '/')
2341 p++;
2342 /* tolerate duplicate slashes; see check_refname_format() */
2343 while (*p == '/')
2344 p++;
2346 for (q = p; *q; q++)
2348 while (1) {
2349 while (q > p && *q != '/')
2350 q--;
2351 while (q > p && *(q-1) == '/')
2352 q--;
2353 if (q == p)
2354 break;
2355 *q = '\0';
2356 if (rmdir(git_path("%s", name)))
2357 break;
2361 /* make sure nobody touched the ref, and unlink */
2362 static void prune_ref(struct ref_to_prune *r)
2364 struct ref_lock *lock = lock_ref_sha1(r->name + 5, r->sha1);
2366 if (lock) {
2367 unlink_or_warn(git_path("%s", r->name));
2368 unlock_ref(lock);
2369 try_remove_empty_parents(r->name);
2373 static void prune_refs(struct ref_to_prune *r)
2375 while (r) {
2376 prune_ref(r);
2377 r = r->next;
2381 int pack_refs(unsigned int flags)
2383 struct pack_refs_cb_data cbdata;
2385 memset(&cbdata, 0, sizeof(cbdata));
2386 cbdata.flags = flags;
2388 lock_packed_refs(LOCK_DIE_ON_ERROR);
2389 cbdata.packed_refs = get_packed_refs(&ref_cache);
2391 do_for_each_entry_in_dir(get_loose_refs(&ref_cache), 0,
2392 pack_if_possible_fn, &cbdata);
2394 if (commit_packed_refs())
2395 die_errno("unable to overwrite old ref-pack file");
2397 prune_refs(cbdata.ref_to_prune);
2398 return 0;
2402 * If entry is no longer needed in packed-refs, add it to the string
2403 * list pointed to by cb_data. Reasons for deleting entries:
2405 * - Entry is broken.
2406 * - Entry is overridden by a loose ref.
2407 * - Entry does not point at a valid object.
2409 * In the first and third cases, also emit an error message because these
2410 * are indications of repository corruption.
2412 static int curate_packed_ref_fn(struct ref_entry *entry, void *cb_data)
2414 struct string_list *refs_to_delete = cb_data;
2416 if (entry->flag & REF_ISBROKEN) {
2417 /* This shouldn't happen to packed refs. */
2418 error("%s is broken!", entry->name);
2419 string_list_append(refs_to_delete, entry->name);
2420 return 0;
2422 if (!has_sha1_file(entry->u.value.sha1)) {
2423 unsigned char sha1[20];
2424 int flags;
2426 if (read_ref_full(entry->name, sha1, 0, &flags))
2427 /* We should at least have found the packed ref. */
2428 die("Internal error");
2429 if ((flags & REF_ISSYMREF) || !(flags & REF_ISPACKED)) {
2431 * This packed reference is overridden by a
2432 * loose reference, so it is OK that its value
2433 * is no longer valid; for example, it might
2434 * refer to an object that has been garbage
2435 * collected. For this purpose we don't even
2436 * care whether the loose reference itself is
2437 * invalid, broken, symbolic, etc. Silently
2438 * remove the packed reference.
2440 string_list_append(refs_to_delete, entry->name);
2441 return 0;
2444 * There is no overriding loose reference, so the fact
2445 * that this reference doesn't refer to a valid object
2446 * indicates some kind of repository corruption.
2447 * Report the problem, then omit the reference from
2448 * the output.
2450 error("%s does not point to a valid object!", entry->name);
2451 string_list_append(refs_to_delete, entry->name);
2452 return 0;
2455 return 0;
2458 int repack_without_refs(const char **refnames, int n)
2460 struct ref_dir *packed;
2461 struct string_list refs_to_delete = STRING_LIST_INIT_DUP;
2462 struct string_list_item *ref_to_delete;
2463 int i, removed = 0;
2465 /* Look for a packed ref */
2466 for (i = 0; i < n; i++)
2467 if (get_packed_ref(refnames[i]))
2468 break;
2470 /* Avoid locking if we have nothing to do */
2471 if (i == n)
2472 return 0; /* no refname exists in packed refs */
2474 if (lock_packed_refs(0)) {
2475 unable_to_lock_error(git_path("packed-refs"), errno);
2476 return error("cannot delete '%s' from packed refs", refnames[i]);
2478 packed = get_packed_refs(&ref_cache);
2480 /* Remove refnames from the cache */
2481 for (i = 0; i < n; i++)
2482 if (remove_entry(packed, refnames[i]) != -1)
2483 removed = 1;
2484 if (!removed) {
2486 * All packed entries disappeared while we were
2487 * acquiring the lock.
2489 rollback_packed_refs();
2490 return 0;
2493 /* Remove any other accumulated cruft */
2494 do_for_each_entry_in_dir(packed, 0, curate_packed_ref_fn, &refs_to_delete);
2495 for_each_string_list_item(ref_to_delete, &refs_to_delete) {
2496 if (remove_entry(packed, ref_to_delete->string) == -1)
2497 die("internal error");
2500 /* Write what remains */
2501 return commit_packed_refs();
2504 static int repack_without_ref(const char *refname)
2506 return repack_without_refs(&refname, 1);
2509 static int delete_ref_loose(struct ref_lock *lock, int flag)
2511 if (!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) {
2512 /* loose */
2513 int err, i = strlen(lock->lk->filename) - 5; /* .lock */
2515 lock->lk->filename[i] = 0;
2516 err = unlink_or_warn(lock->lk->filename);
2517 lock->lk->filename[i] = '.';
2518 if (err && errno != ENOENT)
2519 return 1;
2521 return 0;
2524 int delete_ref(const char *refname, const unsigned char *sha1, int delopt)
2526 struct ref_lock *lock;
2527 int ret = 0, flag = 0;
2529 lock = lock_ref_sha1_basic(refname, sha1, delopt, &flag);
2530 if (!lock)
2531 return 1;
2532 ret |= delete_ref_loose(lock, flag);
2534 /* removing the loose one could have resurrected an earlier
2535 * packed one. Also, if it was not loose we need to repack
2536 * without it.
2538 ret |= repack_without_ref(lock->ref_name);
2540 unlink_or_warn(git_path("logs/%s", lock->ref_name));
2541 clear_loose_ref_cache(&ref_cache);
2542 unlock_ref(lock);
2543 return ret;
2547 * People using contrib's git-new-workdir have .git/logs/refs ->
2548 * /some/other/path/.git/logs/refs, and that may live on another device.
2550 * IOW, to avoid cross device rename errors, the temporary renamed log must
2551 * live into logs/refs.
2553 #define TMP_RENAMED_LOG "logs/refs/.tmp-renamed-log"
2555 static int rename_tmp_log(const char *newrefname)
2557 int attempts_remaining = 4;
2559 retry:
2560 switch (safe_create_leading_directories(git_path("logs/%s", newrefname))) {
2561 case SCLD_OK:
2562 break; /* success */
2563 case SCLD_VANISHED:
2564 if (--attempts_remaining > 0)
2565 goto retry;
2566 /* fall through */
2567 default:
2568 error("unable to create directory for %s", newrefname);
2569 return -1;
2572 if (rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", newrefname))) {
2573 if ((errno==EISDIR || errno==ENOTDIR) && --attempts_remaining > 0) {
2575 * rename(a, b) when b is an existing
2576 * directory ought to result in ISDIR, but
2577 * Solaris 5.8 gives ENOTDIR. Sheesh.
2579 if (remove_empty_directories(git_path("logs/%s", newrefname))) {
2580 error("Directory not empty: logs/%s", newrefname);
2581 return -1;
2583 goto retry;
2584 } else if (errno == ENOENT && --attempts_remaining > 0) {
2586 * Maybe another process just deleted one of
2587 * the directories in the path to newrefname.
2588 * Try again from the beginning.
2590 goto retry;
2591 } else {
2592 error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s: %s",
2593 newrefname, strerror(errno));
2594 return -1;
2597 return 0;
2600 int rename_ref(const char *oldrefname, const char *newrefname, const char *logmsg)
2602 unsigned char sha1[20], orig_sha1[20];
2603 int flag = 0, logmoved = 0;
2604 struct ref_lock *lock;
2605 struct stat loginfo;
2606 int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);
2607 const char *symref = NULL;
2609 if (log && S_ISLNK(loginfo.st_mode))
2610 return error("reflog for %s is a symlink", oldrefname);
2612 symref = resolve_ref_unsafe(oldrefname, orig_sha1, 1, &flag);
2613 if (flag & REF_ISSYMREF)
2614 return error("refname %s is a symbolic ref, renaming it is not supported",
2615 oldrefname);
2616 if (!symref)
2617 return error("refname %s not found", oldrefname);
2619 if (!is_refname_available(newrefname, oldrefname, get_packed_refs(&ref_cache)))
2620 return 1;
2622 if (!is_refname_available(newrefname, oldrefname, get_loose_refs(&ref_cache)))
2623 return 1;
2625 if (log && rename(git_path("logs/%s", oldrefname), git_path(TMP_RENAMED_LOG)))
2626 return error("unable to move logfile logs/%s to "TMP_RENAMED_LOG": %s",
2627 oldrefname, strerror(errno));
2629 if (delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {
2630 error("unable to delete old %s", oldrefname);
2631 goto rollback;
2634 if (!read_ref_full(newrefname, sha1, 1, &flag) &&
2635 delete_ref(newrefname, sha1, REF_NODEREF)) {
2636 if (errno==EISDIR) {
2637 if (remove_empty_directories(git_path("%s", newrefname))) {
2638 error("Directory not empty: %s", newrefname);
2639 goto rollback;
2641 } else {
2642 error("unable to delete existing %s", newrefname);
2643 goto rollback;
2647 if (log && rename_tmp_log(newrefname))
2648 goto rollback;
2650 logmoved = log;
2652 lock = lock_ref_sha1_basic(newrefname, NULL, 0, NULL);
2653 if (!lock) {
2654 error("unable to lock %s for update", newrefname);
2655 goto rollback;
2657 lock->force_write = 1;
2658 hashcpy(lock->old_sha1, orig_sha1);
2659 if (write_ref_sha1(lock, orig_sha1, logmsg)) {
2660 error("unable to write current sha1 into %s", newrefname);
2661 goto rollback;
2664 return 0;
2666 rollback:
2667 lock = lock_ref_sha1_basic(oldrefname, NULL, 0, NULL);
2668 if (!lock) {
2669 error("unable to lock %s for rollback", oldrefname);
2670 goto rollbacklog;
2673 lock->force_write = 1;
2674 flag = log_all_ref_updates;
2675 log_all_ref_updates = 0;
2676 if (write_ref_sha1(lock, orig_sha1, NULL))
2677 error("unable to write current sha1 into %s", oldrefname);
2678 log_all_ref_updates = flag;
2680 rollbacklog:
2681 if (logmoved && rename(git_path("logs/%s", newrefname), git_path("logs/%s", oldrefname)))
2682 error("unable to restore logfile %s from %s: %s",
2683 oldrefname, newrefname, strerror(errno));
2684 if (!logmoved && log &&
2685 rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", oldrefname)))
2686 error("unable to restore logfile %s from "TMP_RENAMED_LOG": %s",
2687 oldrefname, strerror(errno));
2689 return 1;
2692 int close_ref(struct ref_lock *lock)
2694 if (close_lock_file(lock->lk))
2695 return -1;
2696 lock->lock_fd = -1;
2697 return 0;
2700 int commit_ref(struct ref_lock *lock)
2702 if (commit_lock_file(lock->lk))
2703 return -1;
2704 lock->lock_fd = -1;
2705 return 0;
2708 void unlock_ref(struct ref_lock *lock)
2710 /* Do not free lock->lk -- atexit() still looks at them */
2711 if (lock->lk)
2712 rollback_lock_file(lock->lk);
2713 free(lock->ref_name);
2714 free(lock->orig_ref_name);
2715 free(lock);
2719 * copy the reflog message msg to buf, which has been allocated sufficiently
2720 * large, while cleaning up the whitespaces. Especially, convert LF to space,
2721 * because reflog file is one line per entry.
2723 static int copy_msg(char *buf, const char *msg)
2725 char *cp = buf;
2726 char c;
2727 int wasspace = 1;
2729 *cp++ = '\t';
2730 while ((c = *msg++)) {
2731 if (wasspace && isspace(c))
2732 continue;
2733 wasspace = isspace(c);
2734 if (wasspace)
2735 c = ' ';
2736 *cp++ = c;
2738 while (buf < cp && isspace(cp[-1]))
2739 cp--;
2740 *cp++ = '\n';
2741 return cp - buf;
2744 int log_ref_setup(const char *refname, char *logfile, int bufsize)
2746 int logfd, oflags = O_APPEND | O_WRONLY;
2748 git_snpath(logfile, bufsize, "logs/%s", refname);
2749 if (log_all_ref_updates &&
2750 (starts_with(refname, "refs/heads/") ||
2751 starts_with(refname, "refs/remotes/") ||
2752 starts_with(refname, "refs/notes/") ||
2753 !strcmp(refname, "HEAD"))) {
2754 if (safe_create_leading_directories(logfile) < 0)
2755 return error("unable to create directory for %s",
2756 logfile);
2757 oflags |= O_CREAT;
2760 logfd = open(logfile, oflags, 0666);
2761 if (logfd < 0) {
2762 if (!(oflags & O_CREAT) && errno == ENOENT)
2763 return 0;
2765 if ((oflags & O_CREAT) && errno == EISDIR) {
2766 if (remove_empty_directories(logfile)) {
2767 return error("There are still logs under '%s'",
2768 logfile);
2770 logfd = open(logfile, oflags, 0666);
2773 if (logfd < 0)
2774 return error("Unable to append to %s: %s",
2775 logfile, strerror(errno));
2778 adjust_shared_perm(logfile);
2779 close(logfd);
2780 return 0;
2783 static int log_ref_write(const char *refname, const unsigned char *old_sha1,
2784 const unsigned char *new_sha1, const char *msg)
2786 int logfd, result, written, oflags = O_APPEND | O_WRONLY;
2787 unsigned maxlen, len;
2788 int msglen;
2789 char log_file[PATH_MAX];
2790 char *logrec;
2791 const char *committer;
2793 if (log_all_ref_updates < 0)
2794 log_all_ref_updates = !is_bare_repository();
2796 result = log_ref_setup(refname, log_file, sizeof(log_file));
2797 if (result)
2798 return result;
2800 logfd = open(log_file, oflags);
2801 if (logfd < 0)
2802 return 0;
2803 msglen = msg ? strlen(msg) : 0;
2804 committer = git_committer_info(0);
2805 maxlen = strlen(committer) + msglen + 100;
2806 logrec = xmalloc(maxlen);
2807 len = sprintf(logrec, "%s %s %s\n",
2808 sha1_to_hex(old_sha1),
2809 sha1_to_hex(new_sha1),
2810 committer);
2811 if (msglen)
2812 len += copy_msg(logrec + len - 1, msg) - 1;
2813 written = len <= maxlen ? write_in_full(logfd, logrec, len) : -1;
2814 free(logrec);
2815 if (close(logfd) != 0 || written != len)
2816 return error("Unable to append to %s", log_file);
2817 return 0;
2820 static int is_branch(const char *refname)
2822 return !strcmp(refname, "HEAD") || starts_with(refname, "refs/heads/");
2825 int write_ref_sha1(struct ref_lock *lock,
2826 const unsigned char *sha1, const char *logmsg)
2828 static char term = '\n';
2829 struct object *o;
2831 if (!lock)
2832 return -1;
2833 if (!lock->force_write && !hashcmp(lock->old_sha1, sha1)) {
2834 unlock_ref(lock);
2835 return 0;
2837 o = parse_object(sha1);
2838 if (!o) {
2839 error("Trying to write ref %s with nonexistent object %s",
2840 lock->ref_name, sha1_to_hex(sha1));
2841 unlock_ref(lock);
2842 return -1;
2844 if (o->type != OBJ_COMMIT && is_branch(lock->ref_name)) {
2845 error("Trying to write non-commit object %s to branch %s",
2846 sha1_to_hex(sha1), lock->ref_name);
2847 unlock_ref(lock);
2848 return -1;
2850 if (write_in_full(lock->lock_fd, sha1_to_hex(sha1), 40) != 40 ||
2851 write_in_full(lock->lock_fd, &term, 1) != 1
2852 || close_ref(lock) < 0) {
2853 error("Couldn't write %s", lock->lk->filename);
2854 unlock_ref(lock);
2855 return -1;
2857 clear_loose_ref_cache(&ref_cache);
2858 if (log_ref_write(lock->ref_name, lock->old_sha1, sha1, logmsg) < 0 ||
2859 (strcmp(lock->ref_name, lock->orig_ref_name) &&
2860 log_ref_write(lock->orig_ref_name, lock->old_sha1, sha1, logmsg) < 0)) {
2861 unlock_ref(lock);
2862 return -1;
2864 if (strcmp(lock->orig_ref_name, "HEAD") != 0) {
2866 * Special hack: If a branch is updated directly and HEAD
2867 * points to it (may happen on the remote side of a push
2868 * for example) then logically the HEAD reflog should be
2869 * updated too.
2870 * A generic solution implies reverse symref information,
2871 * but finding all symrefs pointing to the given branch
2872 * would be rather costly for this rare event (the direct
2873 * update of a branch) to be worth it. So let's cheat and
2874 * check with HEAD only which should cover 99% of all usage
2875 * scenarios (even 100% of the default ones).
2877 unsigned char head_sha1[20];
2878 int head_flag;
2879 const char *head_ref;
2880 head_ref = resolve_ref_unsafe("HEAD", head_sha1, 1, &head_flag);
2881 if (head_ref && (head_flag & REF_ISSYMREF) &&
2882 !strcmp(head_ref, lock->ref_name))
2883 log_ref_write("HEAD", lock->old_sha1, sha1, logmsg);
2885 if (commit_ref(lock)) {
2886 error("Couldn't set %s", lock->ref_name);
2887 unlock_ref(lock);
2888 return -1;
2890 unlock_ref(lock);
2891 return 0;
2894 int create_symref(const char *ref_target, const char *refs_heads_master,
2895 const char *logmsg)
2897 const char *lockpath;
2898 char ref[1000];
2899 int fd, len, written;
2900 char *git_HEAD = git_pathdup("%s", ref_target);
2901 unsigned char old_sha1[20], new_sha1[20];
2903 if (logmsg && read_ref(ref_target, old_sha1))
2904 hashclr(old_sha1);
2906 if (safe_create_leading_directories(git_HEAD) < 0)
2907 return error("unable to create directory for %s", git_HEAD);
2909 #ifndef NO_SYMLINK_HEAD
2910 if (prefer_symlink_refs) {
2911 unlink(git_HEAD);
2912 if (!symlink(refs_heads_master, git_HEAD))
2913 goto done;
2914 fprintf(stderr, "no symlink - falling back to symbolic ref\n");
2916 #endif
2918 len = snprintf(ref, sizeof(ref), "ref: %s\n", refs_heads_master);
2919 if (sizeof(ref) <= len) {
2920 error("refname too long: %s", refs_heads_master);
2921 goto error_free_return;
2923 lockpath = mkpath("%s.lock", git_HEAD);
2924 fd = open(lockpath, O_CREAT | O_EXCL | O_WRONLY, 0666);
2925 if (fd < 0) {
2926 error("Unable to open %s for writing", lockpath);
2927 goto error_free_return;
2929 written = write_in_full(fd, ref, len);
2930 if (close(fd) != 0 || written != len) {
2931 error("Unable to write to %s", lockpath);
2932 goto error_unlink_return;
2934 if (rename(lockpath, git_HEAD) < 0) {
2935 error("Unable to create %s", git_HEAD);
2936 goto error_unlink_return;
2938 if (adjust_shared_perm(git_HEAD)) {
2939 error("Unable to fix permissions on %s", lockpath);
2940 error_unlink_return:
2941 unlink_or_warn(lockpath);
2942 error_free_return:
2943 free(git_HEAD);
2944 return -1;
2947 #ifndef NO_SYMLINK_HEAD
2948 done:
2949 #endif
2950 if (logmsg && !read_ref(refs_heads_master, new_sha1))
2951 log_ref_write(ref_target, old_sha1, new_sha1, logmsg);
2953 free(git_HEAD);
2954 return 0;
2957 struct read_ref_at_cb {
2958 const char *refname;
2959 unsigned long at_time;
2960 int cnt;
2961 int reccnt;
2962 unsigned char *sha1;
2963 int found_it;
2965 unsigned char osha1[20];
2966 unsigned char nsha1[20];
2967 int tz;
2968 unsigned long date;
2969 char **msg;
2970 unsigned long *cutoff_time;
2971 int *cutoff_tz;
2972 int *cutoff_cnt;
2975 static int read_ref_at_ent(unsigned char *osha1, unsigned char *nsha1,
2976 const char *email, unsigned long timestamp, int tz,
2977 const char *message, void *cb_data)
2979 struct read_ref_at_cb *cb = cb_data;
2981 cb->reccnt++;
2982 cb->tz = tz;
2983 cb->date = timestamp;
2985 if (timestamp <= cb->at_time || cb->cnt == 0) {
2986 if (cb->msg)
2987 *cb->msg = xstrdup(message);
2988 if (cb->cutoff_time)
2989 *cb->cutoff_time = timestamp;
2990 if (cb->cutoff_tz)
2991 *cb->cutoff_tz = tz;
2992 if (cb->cutoff_cnt)
2993 *cb->cutoff_cnt = cb->reccnt - 1;
2995 * we have not yet updated cb->[n|o]sha1 so they still
2996 * hold the values for the previous record.
2998 if (!is_null_sha1(cb->osha1)) {
2999 hashcpy(cb->sha1, nsha1);
3000 if (hashcmp(cb->osha1, nsha1))
3001 warning("Log for ref %s has gap after %s.",
3002 cb->refname, show_date(cb->date, cb->tz, DATE_RFC2822));
3004 else if (cb->date == cb->at_time)
3005 hashcpy(cb->sha1, nsha1);
3006 else if (hashcmp(nsha1, cb->sha1))
3007 warning("Log for ref %s unexpectedly ended on %s.",
3008 cb->refname, show_date(cb->date, cb->tz,
3009 DATE_RFC2822));
3010 hashcpy(cb->osha1, osha1);
3011 hashcpy(cb->nsha1, nsha1);
3012 cb->found_it = 1;
3013 return 1;
3015 hashcpy(cb->osha1, osha1);
3016 hashcpy(cb->nsha1, nsha1);
3017 if (cb->cnt > 0)
3018 cb->cnt--;
3019 return 0;
3022 static int read_ref_at_ent_oldest(unsigned char *osha1, unsigned char *nsha1,
3023 const char *email, unsigned long timestamp,
3024 int tz, const char *message, void *cb_data)
3026 struct read_ref_at_cb *cb = cb_data;
3028 if (cb->msg)
3029 *cb->msg = xstrdup(message);
3030 if (cb->cutoff_time)
3031 *cb->cutoff_time = timestamp;
3032 if (cb->cutoff_tz)
3033 *cb->cutoff_tz = tz;
3034 if (cb->cutoff_cnt)
3035 *cb->cutoff_cnt = cb->reccnt;
3036 hashcpy(cb->sha1, osha1);
3037 if (is_null_sha1(cb->sha1))
3038 hashcpy(cb->sha1, nsha1);
3039 /* We just want the first entry */
3040 return 1;
3043 int read_ref_at(const char *refname, unsigned long at_time, int cnt,
3044 unsigned char *sha1, char **msg,
3045 unsigned long *cutoff_time, int *cutoff_tz, int *cutoff_cnt)
3047 struct read_ref_at_cb cb;
3049 memset(&cb, 0, sizeof(cb));
3050 cb.refname = refname;
3051 cb.at_time = at_time;
3052 cb.cnt = cnt;
3053 cb.msg = msg;
3054 cb.cutoff_time = cutoff_time;
3055 cb.cutoff_tz = cutoff_tz;
3056 cb.cutoff_cnt = cutoff_cnt;
3057 cb.sha1 = sha1;
3059 for_each_reflog_ent_reverse(refname, read_ref_at_ent, &cb);
3061 if (!cb.reccnt)
3062 die("Log for %s is empty.", refname);
3063 if (cb.found_it)
3064 return 0;
3066 for_each_reflog_ent(refname, read_ref_at_ent_oldest, &cb);
3068 return 1;
3071 int reflog_exists(const char *refname)
3073 struct stat st;
3075 return !lstat(git_path("logs/%s", refname), &st) &&
3076 S_ISREG(st.st_mode);
3079 int delete_reflog(const char *refname)
3081 return remove_path(git_path("logs/%s", refname));
3084 static int show_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn, void *cb_data)
3086 unsigned char osha1[20], nsha1[20];
3087 char *email_end, *message;
3088 unsigned long timestamp;
3089 int tz;
3091 /* old SP new SP name <email> SP time TAB msg LF */
3092 if (sb->len < 83 || sb->buf[sb->len - 1] != '\n' ||
3093 get_sha1_hex(sb->buf, osha1) || sb->buf[40] != ' ' ||
3094 get_sha1_hex(sb->buf + 41, nsha1) || sb->buf[81] != ' ' ||
3095 !(email_end = strchr(sb->buf + 82, '>')) ||
3096 email_end[1] != ' ' ||
3097 !(timestamp = strtoul(email_end + 2, &message, 10)) ||
3098 !message || message[0] != ' ' ||
3099 (message[1] != '+' && message[1] != '-') ||
3100 !isdigit(message[2]) || !isdigit(message[3]) ||
3101 !isdigit(message[4]) || !isdigit(message[5]))
3102 return 0; /* corrupt? */
3103 email_end[1] = '\0';
3104 tz = strtol(message + 1, NULL, 10);
3105 if (message[6] != '\t')
3106 message += 6;
3107 else
3108 message += 7;
3109 return fn(osha1, nsha1, sb->buf + 82, timestamp, tz, message, cb_data);
3112 static char *find_beginning_of_line(char *bob, char *scan)
3114 while (bob < scan && *(--scan) != '\n')
3115 ; /* keep scanning backwards */
3117 * Return either beginning of the buffer, or LF at the end of
3118 * the previous line.
3120 return scan;
3123 int for_each_reflog_ent_reverse(const char *refname, each_reflog_ent_fn fn, void *cb_data)
3125 struct strbuf sb = STRBUF_INIT;
3126 FILE *logfp;
3127 long pos;
3128 int ret = 0, at_tail = 1;
3130 logfp = fopen(git_path("logs/%s", refname), "r");
3131 if (!logfp)
3132 return -1;
3134 /* Jump to the end */
3135 if (fseek(logfp, 0, SEEK_END) < 0)
3136 return error("cannot seek back reflog for %s: %s",
3137 refname, strerror(errno));
3138 pos = ftell(logfp);
3139 while (!ret && 0 < pos) {
3140 int cnt;
3141 size_t nread;
3142 char buf[BUFSIZ];
3143 char *endp, *scanp;
3145 /* Fill next block from the end */
3146 cnt = (sizeof(buf) < pos) ? sizeof(buf) : pos;
3147 if (fseek(logfp, pos - cnt, SEEK_SET))
3148 return error("cannot seek back reflog for %s: %s",
3149 refname, strerror(errno));
3150 nread = fread(buf, cnt, 1, logfp);
3151 if (nread != 1)
3152 return error("cannot read %d bytes from reflog for %s: %s",
3153 cnt, refname, strerror(errno));
3154 pos -= cnt;
3156 scanp = endp = buf + cnt;
3157 if (at_tail && scanp[-1] == '\n')
3158 /* Looking at the final LF at the end of the file */
3159 scanp--;
3160 at_tail = 0;
3162 while (buf < scanp) {
3164 * terminating LF of the previous line, or the beginning
3165 * of the buffer.
3167 char *bp;
3169 bp = find_beginning_of_line(buf, scanp);
3171 if (*bp != '\n') {
3172 strbuf_splice(&sb, 0, 0, buf, endp - buf);
3173 if (pos)
3174 break; /* need to fill another block */
3175 scanp = buf - 1; /* leave loop */
3176 } else {
3178 * (bp + 1) thru endp is the beginning of the
3179 * current line we have in sb
3181 strbuf_splice(&sb, 0, 0, bp + 1, endp - (bp + 1));
3182 scanp = bp;
3183 endp = bp + 1;
3185 ret = show_one_reflog_ent(&sb, fn, cb_data);
3186 strbuf_reset(&sb);
3187 if (ret)
3188 break;
3192 if (!ret && sb.len)
3193 ret = show_one_reflog_ent(&sb, fn, cb_data);
3195 fclose(logfp);
3196 strbuf_release(&sb);
3197 return ret;
3200 int for_each_reflog_ent(const char *refname, each_reflog_ent_fn fn, void *cb_data)
3202 FILE *logfp;
3203 struct strbuf sb = STRBUF_INIT;
3204 int ret = 0;
3206 logfp = fopen(git_path("logs/%s", refname), "r");
3207 if (!logfp)
3208 return -1;
3210 while (!ret && !strbuf_getwholeline(&sb, logfp, '\n'))
3211 ret = show_one_reflog_ent(&sb, fn, cb_data);
3212 fclose(logfp);
3213 strbuf_release(&sb);
3214 return ret;
3217 * Call fn for each reflog in the namespace indicated by name. name
3218 * must be empty or end with '/'. Name will be used as a scratch
3219 * space, but its contents will be restored before return.
3221 static int do_for_each_reflog(struct strbuf *name, each_ref_fn fn, void *cb_data)
3223 DIR *d = opendir(git_path("logs/%s", name->buf));
3224 int retval = 0;
3225 struct dirent *de;
3226 int oldlen = name->len;
3228 if (!d)
3229 return name->len ? errno : 0;
3231 while ((de = readdir(d)) != NULL) {
3232 struct stat st;
3234 if (de->d_name[0] == '.')
3235 continue;
3236 if (has_extension(de->d_name, ".lock"))
3237 continue;
3238 strbuf_addstr(name, de->d_name);
3239 if (stat(git_path("logs/%s", name->buf), &st) < 0) {
3240 ; /* silently ignore */
3241 } else {
3242 if (S_ISDIR(st.st_mode)) {
3243 strbuf_addch(name, '/');
3244 retval = do_for_each_reflog(name, fn, cb_data);
3245 } else {
3246 unsigned char sha1[20];
3247 if (read_ref_full(name->buf, sha1, 0, NULL))
3248 retval = error("bad ref for %s", name->buf);
3249 else
3250 retval = fn(name->buf, sha1, 0, cb_data);
3252 if (retval)
3253 break;
3255 strbuf_setlen(name, oldlen);
3257 closedir(d);
3258 return retval;
3261 int for_each_reflog(each_ref_fn fn, void *cb_data)
3263 int retval;
3264 struct strbuf name;
3265 strbuf_init(&name, PATH_MAX);
3266 retval = do_for_each_reflog(&name, fn, cb_data);
3267 strbuf_release(&name);
3268 return retval;
3271 static struct ref_lock *update_ref_lock(const char *refname,
3272 const unsigned char *oldval,
3273 int flags, int *type_p,
3274 enum action_on_err onerr)
3276 struct ref_lock *lock;
3277 lock = lock_any_ref_for_update(refname, oldval, flags, type_p);
3278 if (!lock) {
3279 const char *str = "Cannot lock the ref '%s'.";
3280 switch (onerr) {
3281 case UPDATE_REFS_MSG_ON_ERR: error(str, refname); break;
3282 case UPDATE_REFS_DIE_ON_ERR: die(str, refname); break;
3283 case UPDATE_REFS_QUIET_ON_ERR: break;
3286 return lock;
3289 static int update_ref_write(const char *action, const char *refname,
3290 const unsigned char *sha1, struct ref_lock *lock,
3291 enum action_on_err onerr)
3293 if (write_ref_sha1(lock, sha1, action) < 0) {
3294 const char *str = "Cannot update the ref '%s'.";
3295 switch (onerr) {
3296 case UPDATE_REFS_MSG_ON_ERR: error(str, refname); break;
3297 case UPDATE_REFS_DIE_ON_ERR: die(str, refname); break;
3298 case UPDATE_REFS_QUIET_ON_ERR: break;
3300 return 1;
3302 return 0;
3306 * Information needed for a single ref update. Set new_sha1 to the
3307 * new value or to zero to delete the ref. To check the old value
3308 * while locking the ref, set have_old to 1 and set old_sha1 to the
3309 * value or to zero to ensure the ref does not exist before update.
3311 struct ref_update {
3312 unsigned char new_sha1[20];
3313 unsigned char old_sha1[20];
3314 int flags; /* REF_NODEREF? */
3315 int have_old; /* 1 if old_sha1 is valid, 0 otherwise */
3316 struct ref_lock *lock;
3317 int type;
3318 const char refname[FLEX_ARRAY];
3322 * Data structure for holding a reference transaction, which can
3323 * consist of checks and updates to multiple references, carried out
3324 * as atomically as possible. This structure is opaque to callers.
3326 struct ref_transaction {
3327 struct ref_update **updates;
3328 size_t alloc;
3329 size_t nr;
3332 struct ref_transaction *ref_transaction_begin(void)
3334 return xcalloc(1, sizeof(struct ref_transaction));
3337 static void ref_transaction_free(struct ref_transaction *transaction)
3339 int i;
3341 for (i = 0; i < transaction->nr; i++)
3342 free(transaction->updates[i]);
3344 free(transaction->updates);
3345 free(transaction);
3348 void ref_transaction_rollback(struct ref_transaction *transaction)
3350 ref_transaction_free(transaction);
3353 static struct ref_update *add_update(struct ref_transaction *transaction,
3354 const char *refname)
3356 size_t len = strlen(refname);
3357 struct ref_update *update = xcalloc(1, sizeof(*update) + len + 1);
3359 strcpy((char *)update->refname, refname);
3360 ALLOC_GROW(transaction->updates, transaction->nr + 1, transaction->alloc);
3361 transaction->updates[transaction->nr++] = update;
3362 return update;
3365 void ref_transaction_update(struct ref_transaction *transaction,
3366 const char *refname,
3367 unsigned char *new_sha1, unsigned char *old_sha1,
3368 int flags, int have_old)
3370 struct ref_update *update = add_update(transaction, refname);
3372 hashcpy(update->new_sha1, new_sha1);
3373 update->flags = flags;
3374 update->have_old = have_old;
3375 if (have_old)
3376 hashcpy(update->old_sha1, old_sha1);
3379 void ref_transaction_create(struct ref_transaction *transaction,
3380 const char *refname,
3381 unsigned char *new_sha1,
3382 int flags)
3384 struct ref_update *update = add_update(transaction, refname);
3386 assert(!is_null_sha1(new_sha1));
3387 hashcpy(update->new_sha1, new_sha1);
3388 hashclr(update->old_sha1);
3389 update->flags = flags;
3390 update->have_old = 1;
3393 void ref_transaction_delete(struct ref_transaction *transaction,
3394 const char *refname,
3395 unsigned char *old_sha1,
3396 int flags, int have_old)
3398 struct ref_update *update = add_update(transaction, refname);
3400 update->flags = flags;
3401 update->have_old = have_old;
3402 if (have_old) {
3403 assert(!is_null_sha1(old_sha1));
3404 hashcpy(update->old_sha1, old_sha1);
3408 int update_ref(const char *action, const char *refname,
3409 const unsigned char *sha1, const unsigned char *oldval,
3410 int flags, enum action_on_err onerr)
3412 struct ref_lock *lock;
3413 lock = update_ref_lock(refname, oldval, flags, NULL, onerr);
3414 if (!lock)
3415 return 1;
3416 return update_ref_write(action, refname, sha1, lock, onerr);
3419 static int ref_update_compare(const void *r1, const void *r2)
3421 const struct ref_update * const *u1 = r1;
3422 const struct ref_update * const *u2 = r2;
3423 return strcmp((*u1)->refname, (*u2)->refname);
3426 static int ref_update_reject_duplicates(struct ref_update **updates, int n,
3427 enum action_on_err onerr)
3429 int i;
3430 for (i = 1; i < n; i++)
3431 if (!strcmp(updates[i - 1]->refname, updates[i]->refname)) {
3432 const char *str =
3433 "Multiple updates for ref '%s' not allowed.";
3434 switch (onerr) {
3435 case UPDATE_REFS_MSG_ON_ERR:
3436 error(str, updates[i]->refname); break;
3437 case UPDATE_REFS_DIE_ON_ERR:
3438 die(str, updates[i]->refname); break;
3439 case UPDATE_REFS_QUIET_ON_ERR:
3440 break;
3442 return 1;
3444 return 0;
3447 int ref_transaction_commit(struct ref_transaction *transaction,
3448 const char *msg, enum action_on_err onerr)
3450 int ret = 0, delnum = 0, i;
3451 const char **delnames;
3452 int n = transaction->nr;
3453 struct ref_update **updates = transaction->updates;
3455 if (!n)
3456 return 0;
3458 /* Allocate work space */
3459 delnames = xmalloc(sizeof(*delnames) * n);
3461 /* Copy, sort, and reject duplicate refs */
3462 qsort(updates, n, sizeof(*updates), ref_update_compare);
3463 ret = ref_update_reject_duplicates(updates, n, onerr);
3464 if (ret)
3465 goto cleanup;
3467 /* Acquire all locks while verifying old values */
3468 for (i = 0; i < n; i++) {
3469 struct ref_update *update = updates[i];
3471 update->lock = update_ref_lock(update->refname,
3472 (update->have_old ?
3473 update->old_sha1 : NULL),
3474 update->flags,
3475 &update->type, onerr);
3476 if (!update->lock) {
3477 ret = 1;
3478 goto cleanup;
3482 /* Perform updates first so live commits remain referenced */
3483 for (i = 0; i < n; i++) {
3484 struct ref_update *update = updates[i];
3486 if (!is_null_sha1(update->new_sha1)) {
3487 ret = update_ref_write(msg,
3488 update->refname,
3489 update->new_sha1,
3490 update->lock, onerr);
3491 update->lock = NULL; /* freed by update_ref_write */
3492 if (ret)
3493 goto cleanup;
3497 /* Perform deletes now that updates are safely completed */
3498 for (i = 0; i < n; i++) {
3499 struct ref_update *update = updates[i];
3501 if (update->lock) {
3502 delnames[delnum++] = update->lock->ref_name;
3503 ret |= delete_ref_loose(update->lock, update->type);
3507 ret |= repack_without_refs(delnames, delnum);
3508 for (i = 0; i < delnum; i++)
3509 unlink_or_warn(git_path("logs/%s", delnames[i]));
3510 clear_loose_ref_cache(&ref_cache);
3512 cleanup:
3513 for (i = 0; i < n; i++)
3514 if (updates[i]->lock)
3515 unlock_ref(updates[i]->lock);
3516 free(delnames);
3517 ref_transaction_free(transaction);
3518 return ret;
3521 char *shorten_unambiguous_ref(const char *refname, int strict)
3523 int i;
3524 static char **scanf_fmts;
3525 static int nr_rules;
3526 char *short_name;
3528 if (!nr_rules) {
3530 * Pre-generate scanf formats from ref_rev_parse_rules[].
3531 * Generate a format suitable for scanf from a
3532 * ref_rev_parse_rules rule by interpolating "%s" at the
3533 * location of the "%.*s".
3535 size_t total_len = 0;
3536 size_t offset = 0;
3538 /* the rule list is NULL terminated, count them first */
3539 for (nr_rules = 0; ref_rev_parse_rules[nr_rules]; nr_rules++)
3540 /* -2 for strlen("%.*s") - strlen("%s"); +1 for NUL */
3541 total_len += strlen(ref_rev_parse_rules[nr_rules]) - 2 + 1;
3543 scanf_fmts = xmalloc(nr_rules * sizeof(char *) + total_len);
3545 offset = 0;
3546 for (i = 0; i < nr_rules; i++) {
3547 assert(offset < total_len);
3548 scanf_fmts[i] = (char *)&scanf_fmts[nr_rules] + offset;
3549 offset += snprintf(scanf_fmts[i], total_len - offset,
3550 ref_rev_parse_rules[i], 2, "%s") + 1;
3554 /* bail out if there are no rules */
3555 if (!nr_rules)
3556 return xstrdup(refname);
3558 /* buffer for scanf result, at most refname must fit */
3559 short_name = xstrdup(refname);
3561 /* skip first rule, it will always match */
3562 for (i = nr_rules - 1; i > 0 ; --i) {
3563 int j;
3564 int rules_to_fail = i;
3565 int short_name_len;
3567 if (1 != sscanf(refname, scanf_fmts[i], short_name))
3568 continue;
3570 short_name_len = strlen(short_name);
3573 * in strict mode, all (except the matched one) rules
3574 * must fail to resolve to a valid non-ambiguous ref
3576 if (strict)
3577 rules_to_fail = nr_rules;
3580 * check if the short name resolves to a valid ref,
3581 * but use only rules prior to the matched one
3583 for (j = 0; j < rules_to_fail; j++) {
3584 const char *rule = ref_rev_parse_rules[j];
3585 char refname[PATH_MAX];
3587 /* skip matched rule */
3588 if (i == j)
3589 continue;
3592 * the short name is ambiguous, if it resolves
3593 * (with this previous rule) to a valid ref
3594 * read_ref() returns 0 on success
3596 mksnpath(refname, sizeof(refname),
3597 rule, short_name_len, short_name);
3598 if (ref_exists(refname))
3599 break;
3603 * short name is non-ambiguous if all previous rules
3604 * haven't resolved to a valid ref
3606 if (j == rules_to_fail)
3607 return short_name;
3610 free(short_name);
3611 return xstrdup(refname);
3614 static struct string_list *hide_refs;
3616 int parse_hide_refs_config(const char *var, const char *value, const char *section)
3618 if (!strcmp("transfer.hiderefs", var) ||
3619 /* NEEDSWORK: use parse_config_key() once both are merged */
3620 (starts_with(var, section) && var[strlen(section)] == '.' &&
3621 !strcmp(var + strlen(section), ".hiderefs"))) {
3622 char *ref;
3623 int len;
3625 if (!value)
3626 return config_error_nonbool(var);
3627 ref = xstrdup(value);
3628 len = strlen(ref);
3629 while (len && ref[len - 1] == '/')
3630 ref[--len] = '\0';
3631 if (!hide_refs) {
3632 hide_refs = xcalloc(1, sizeof(*hide_refs));
3633 hide_refs->strdup_strings = 1;
3635 string_list_append(hide_refs, ref);
3637 return 0;
3640 int ref_is_hidden(const char *refname)
3642 struct string_list_item *item;
3644 if (!hide_refs)
3645 return 0;
3646 for_each_string_list_item(item, hide_refs) {
3647 int len;
3648 if (!starts_with(refname, item->string))
3649 continue;
3650 len = strlen(item->string);
3651 if (!refname[len] || refname[len] == '/')
3652 return 1;
3654 return 0;