get_packed_ref(): return a ref_entry
[git/mjg.git] / refs.c
blobfbcc044eecb163d44f445b2d48b9752a2b6140d7
1 #include "cache.h"
2 #include "refs.h"
3 #include "object.h"
4 #include "tag.h"
5 #include "dir.h"
7 /*
8 * Make sure "ref" is something reasonable to have under ".git/refs/";
9 * We do not like it if:
11 * - any path component of it begins with ".", or
12 * - it has double dots "..", or
13 * - it has ASCII control character, "~", "^", ":" or SP, anywhere, or
14 * - it ends with a "/".
15 * - it ends with ".lock"
16 * - it contains a "\" (backslash)
19 /* Return true iff ch is not allowed in reference names. */
20 static inline int bad_ref_char(int ch)
22 if (((unsigned) ch) <= ' ' || ch == 0x7f ||
23 ch == '~' || ch == '^' || ch == ':' || ch == '\\')
24 return 1;
25 /* 2.13 Pattern Matching Notation */
26 if (ch == '*' || ch == '?' || ch == '[') /* Unsupported */
27 return 1;
28 return 0;
32 * Try to read one refname component from the front of refname. Return
33 * the length of the component found, or -1 if the component is not
34 * legal.
36 static int check_refname_component(const char *refname, int flags)
38 const char *cp;
39 char last = '\0';
41 for (cp = refname; ; cp++) {
42 char ch = *cp;
43 if (ch == '\0' || ch == '/')
44 break;
45 if (bad_ref_char(ch))
46 return -1; /* Illegal character in refname. */
47 if (last == '.' && ch == '.')
48 return -1; /* Refname contains "..". */
49 if (last == '@' && ch == '{')
50 return -1; /* Refname contains "@{". */
51 last = ch;
53 if (cp == refname)
54 return 0; /* Component has zero length. */
55 if (refname[0] == '.') {
56 if (!(flags & REFNAME_DOT_COMPONENT))
57 return -1; /* Component starts with '.'. */
59 * Even if leading dots are allowed, don't allow "."
60 * as a component (".." is prevented by a rule above).
62 if (refname[1] == '\0')
63 return -1; /* Component equals ".". */
65 if (cp - refname >= 5 && !memcmp(cp - 5, ".lock", 5))
66 return -1; /* Refname ends with ".lock". */
67 return cp - refname;
70 int check_refname_format(const char *refname, int flags)
72 int component_len, component_count = 0;
74 while (1) {
75 /* We are at the start of a path component. */
76 component_len = check_refname_component(refname, flags);
77 if (component_len <= 0) {
78 if ((flags & REFNAME_REFSPEC_PATTERN) &&
79 refname[0] == '*' &&
80 (refname[1] == '\0' || refname[1] == '/')) {
81 /* Accept one wildcard as a full refname component. */
82 flags &= ~REFNAME_REFSPEC_PATTERN;
83 component_len = 1;
84 } else {
85 return -1;
88 component_count++;
89 if (refname[component_len] == '\0')
90 break;
91 /* Skip to next component. */
92 refname += component_len + 1;
95 if (refname[component_len - 1] == '.')
96 return -1; /* Refname ends with '.'. */
97 if (!(flags & REFNAME_ALLOW_ONELEVEL) && component_count < 2)
98 return -1; /* Refname has only one component. */
99 return 0;
102 struct ref_entry;
105 * Information used (along with the information in ref_entry) to
106 * describe a single cached reference. This data structure only
107 * occurs embedded in a union in struct ref_entry, and only when
108 * (ref_entry->flag & REF_DIR) is zero.
110 struct ref_value {
112 * The name of the object to which this reference resolves
113 * (which may be a tag object). If REF_ISBROKEN, this is
114 * null. If REF_ISSYMREF, then this is the name of the object
115 * referred to by the last reference in the symlink chain.
117 unsigned char sha1[20];
120 * If REF_KNOWS_PEELED, then this field holds the peeled value
121 * of this reference, or null if the reference is known not to
122 * be peelable.
124 unsigned char peeled[20];
127 struct ref_cache;
130 * Information used (along with the information in ref_entry) to
131 * describe a level in the hierarchy of references. This data
132 * structure only occurs embedded in a union in struct ref_entry, and
133 * only when (ref_entry.flag & REF_DIR) is set. In that case,
134 * (ref_entry.flag & REF_INCOMPLETE) determines whether the references
135 * in the directory have already been read:
137 * (ref_entry.flag & REF_INCOMPLETE) unset -- a directory of loose
138 * or packed references, already read.
140 * (ref_entry.flag & REF_INCOMPLETE) set -- a directory of loose
141 * references that hasn't been read yet (nor has any of its
142 * subdirectories).
144 * Entries within a directory are stored within a growable array of
145 * pointers to ref_entries (entries, nr, alloc). Entries 0 <= i <
146 * sorted are sorted by their component name in strcmp() order and the
147 * remaining entries are unsorted.
149 * Loose references are read lazily, one directory at a time. When a
150 * directory of loose references is read, then all of the references
151 * in that directory are stored, and REF_INCOMPLETE stubs are created
152 * for any subdirectories, but the subdirectories themselves are not
153 * read. The reading is triggered by get_ref_dir().
155 struct ref_dir {
156 int nr, alloc;
159 * Entries with index 0 <= i < sorted are sorted by name. New
160 * entries are appended to the list unsorted, and are sorted
161 * only when required; thus we avoid the need to sort the list
162 * after the addition of every reference.
164 int sorted;
166 /* A pointer to the ref_cache that contains this ref_dir. */
167 struct ref_cache *ref_cache;
169 struct ref_entry **entries;
173 * Bit values for ref_entry::flag. REF_ISSYMREF=0x01,
174 * REF_ISPACKED=0x02, and REF_ISBROKEN=0x04 are public values; see
175 * refs.h.
179 * The field ref_entry->u.value.peeled of this value entry contains
180 * the correct peeled value for the reference, which might be
181 * null_sha1 if the reference is not a tag or if it is broken.
183 #define REF_KNOWS_PEELED 0x08
185 /* ref_entry represents a directory of references */
186 #define REF_DIR 0x10
189 * Entry has not yet been read from disk (used only for REF_DIR
190 * entries representing loose references)
192 #define REF_INCOMPLETE 0x20
195 * A ref_entry represents either a reference or a "subdirectory" of
196 * references.
198 * Each directory in the reference namespace is represented by a
199 * ref_entry with (flags & REF_DIR) set and containing a subdir member
200 * that holds the entries in that directory that have been read so
201 * far. If (flags & REF_INCOMPLETE) is set, then the directory and
202 * its subdirectories haven't been read yet. REF_INCOMPLETE is only
203 * used for loose reference directories.
205 * References are represented by a ref_entry with (flags & REF_DIR)
206 * unset and a value member that describes the reference's value. The
207 * flag member is at the ref_entry level, but it is also needed to
208 * interpret the contents of the value field (in other words, a
209 * ref_value object is not very much use without the enclosing
210 * ref_entry).
212 * Reference names cannot end with slash and directories' names are
213 * always stored with a trailing slash (except for the top-level
214 * directory, which is always denoted by ""). This has two nice
215 * consequences: (1) when the entries in each subdir are sorted
216 * lexicographically by name (as they usually are), the references in
217 * a whole tree can be generated in lexicographic order by traversing
218 * the tree in left-to-right, depth-first order; (2) the names of
219 * references and subdirectories cannot conflict, and therefore the
220 * presence of an empty subdirectory does not block the creation of a
221 * similarly-named reference. (The fact that reference names with the
222 * same leading components can conflict *with each other* is a
223 * separate issue that is regulated by is_refname_available().)
225 * Please note that the name field contains the fully-qualified
226 * reference (or subdirectory) name. Space could be saved by only
227 * storing the relative names. But that would require the full names
228 * to be generated on the fly when iterating in do_for_each_ref(), and
229 * would break callback functions, who have always been able to assume
230 * that the name strings that they are passed will not be freed during
231 * the iteration.
233 struct ref_entry {
234 unsigned char flag; /* ISSYMREF? ISPACKED? */
235 union {
236 struct ref_value value; /* if not (flags&REF_DIR) */
237 struct ref_dir subdir; /* if (flags&REF_DIR) */
238 } u;
240 * The full name of the reference (e.g., "refs/heads/master")
241 * or the full name of the directory with a trailing slash
242 * (e.g., "refs/heads/"):
244 char name[FLEX_ARRAY];
247 static void read_loose_refs(const char *dirname, struct ref_dir *dir);
249 static struct ref_dir *get_ref_dir(struct ref_entry *entry)
251 struct ref_dir *dir;
252 assert(entry->flag & REF_DIR);
253 dir = &entry->u.subdir;
254 if (entry->flag & REF_INCOMPLETE) {
255 read_loose_refs(entry->name, dir);
256 entry->flag &= ~REF_INCOMPLETE;
258 return dir;
261 static struct ref_entry *create_ref_entry(const char *refname,
262 const unsigned char *sha1, int flag,
263 int check_name)
265 int len;
266 struct ref_entry *ref;
268 if (check_name &&
269 check_refname_format(refname, REFNAME_ALLOW_ONELEVEL|REFNAME_DOT_COMPONENT))
270 die("Reference has invalid format: '%s'", refname);
271 len = strlen(refname) + 1;
272 ref = xmalloc(sizeof(struct ref_entry) + len);
273 hashcpy(ref->u.value.sha1, sha1);
274 hashclr(ref->u.value.peeled);
275 memcpy(ref->name, refname, len);
276 ref->flag = flag;
277 return ref;
280 static void clear_ref_dir(struct ref_dir *dir);
282 static void free_ref_entry(struct ref_entry *entry)
284 if (entry->flag & REF_DIR) {
286 * Do not use get_ref_dir() here, as that might
287 * trigger the reading of loose refs.
289 clear_ref_dir(&entry->u.subdir);
291 free(entry);
295 * Add a ref_entry to the end of dir (unsorted). Entry is always
296 * stored directly in dir; no recursion into subdirectories is
297 * done.
299 static void add_entry_to_dir(struct ref_dir *dir, struct ref_entry *entry)
301 ALLOC_GROW(dir->entries, dir->nr + 1, dir->alloc);
302 dir->entries[dir->nr++] = entry;
303 /* optimize for the case that entries are added in order */
304 if (dir->nr == 1 ||
305 (dir->nr == dir->sorted + 1 &&
306 strcmp(dir->entries[dir->nr - 2]->name,
307 dir->entries[dir->nr - 1]->name) < 0))
308 dir->sorted = dir->nr;
312 * Clear and free all entries in dir, recursively.
314 static void clear_ref_dir(struct ref_dir *dir)
316 int i;
317 for (i = 0; i < dir->nr; i++)
318 free_ref_entry(dir->entries[i]);
319 free(dir->entries);
320 dir->sorted = dir->nr = dir->alloc = 0;
321 dir->entries = NULL;
325 * Create a struct ref_entry object for the specified dirname.
326 * dirname is the name of the directory with a trailing slash (e.g.,
327 * "refs/heads/") or "" for the top-level directory.
329 static struct ref_entry *create_dir_entry(struct ref_cache *ref_cache,
330 const char *dirname, size_t len,
331 int incomplete)
333 struct ref_entry *direntry;
334 direntry = xcalloc(1, sizeof(struct ref_entry) + len + 1);
335 memcpy(direntry->name, dirname, len);
336 direntry->name[len] = '\0';
337 direntry->u.subdir.ref_cache = ref_cache;
338 direntry->flag = REF_DIR | (incomplete ? REF_INCOMPLETE : 0);
339 return direntry;
342 static int ref_entry_cmp(const void *a, const void *b)
344 struct ref_entry *one = *(struct ref_entry **)a;
345 struct ref_entry *two = *(struct ref_entry **)b;
346 return strcmp(one->name, two->name);
349 static void sort_ref_dir(struct ref_dir *dir);
351 struct string_slice {
352 size_t len;
353 const char *str;
356 static int ref_entry_cmp_sslice(const void *key_, const void *ent_)
358 struct string_slice *key = (struct string_slice *)key_;
359 struct ref_entry *ent = *(struct ref_entry **)ent_;
360 int entlen = strlen(ent->name);
361 int cmplen = key->len < entlen ? key->len : entlen;
362 int cmp = memcmp(key->str, ent->name, cmplen);
363 if (cmp)
364 return cmp;
365 return key->len - entlen;
369 * Return the entry with the given refname from the ref_dir
370 * (non-recursively), sorting dir if necessary. Return NULL if no
371 * such entry is found. dir must already be complete.
373 static struct ref_entry *search_ref_dir(struct ref_dir *dir,
374 const char *refname, size_t len)
376 struct ref_entry **r;
377 struct string_slice key;
379 if (refname == NULL || !dir->nr)
380 return NULL;
382 sort_ref_dir(dir);
383 key.len = len;
384 key.str = refname;
385 r = bsearch(&key, dir->entries, dir->nr, sizeof(*dir->entries),
386 ref_entry_cmp_sslice);
388 if (r == NULL)
389 return NULL;
391 return *r;
395 * Search for a directory entry directly within dir (without
396 * recursing). Sort dir if necessary. subdirname must be a directory
397 * name (i.e., end in '/'). If mkdir is set, then create the
398 * directory if it is missing; otherwise, return NULL if the desired
399 * directory cannot be found. dir must already be complete.
401 static struct ref_dir *search_for_subdir(struct ref_dir *dir,
402 const char *subdirname, size_t len,
403 int mkdir)
405 struct ref_entry *entry = search_ref_dir(dir, subdirname, len);
406 if (!entry) {
407 if (!mkdir)
408 return NULL;
410 * Since dir is complete, the absence of a subdir
411 * means that the subdir really doesn't exist;
412 * therefore, create an empty record for it but mark
413 * the record complete.
415 entry = create_dir_entry(dir->ref_cache, subdirname, len, 0);
416 add_entry_to_dir(dir, entry);
418 return get_ref_dir(entry);
422 * If refname is a reference name, find the ref_dir within the dir
423 * tree that should hold refname. If refname is a directory name
424 * (i.e., ends in '/'), then return that ref_dir itself. dir must
425 * represent the top-level directory and must already be complete.
426 * Sort ref_dirs and recurse into subdirectories as necessary. If
427 * mkdir is set, then create any missing directories; otherwise,
428 * return NULL if the desired directory cannot be found.
430 static struct ref_dir *find_containing_dir(struct ref_dir *dir,
431 const char *refname, int mkdir)
433 const char *slash;
434 for (slash = strchr(refname, '/'); slash; slash = strchr(slash + 1, '/')) {
435 size_t dirnamelen = slash - refname + 1;
436 struct ref_dir *subdir;
437 subdir = search_for_subdir(dir, refname, dirnamelen, mkdir);
438 if (!subdir) {
439 dir = NULL;
440 break;
442 dir = subdir;
445 return dir;
449 * Find the value entry with the given name in dir, sorting ref_dirs
450 * and recursing into subdirectories as necessary. If the name is not
451 * found or it corresponds to a directory entry, return NULL.
453 static struct ref_entry *find_ref(struct ref_dir *dir, const char *refname)
455 struct ref_entry *entry;
456 dir = find_containing_dir(dir, refname, 0);
457 if (!dir)
458 return NULL;
459 entry = search_ref_dir(dir, refname, strlen(refname));
460 return (entry && !(entry->flag & REF_DIR)) ? entry : NULL;
464 * Add a ref_entry to the ref_dir (unsorted), recursing into
465 * subdirectories as necessary. dir must represent the top-level
466 * directory. Return 0 on success.
468 static int add_ref(struct ref_dir *dir, struct ref_entry *ref)
470 dir = find_containing_dir(dir, ref->name, 1);
471 if (!dir)
472 return -1;
473 add_entry_to_dir(dir, ref);
474 return 0;
478 * Emit a warning and return true iff ref1 and ref2 have the same name
479 * and the same sha1. Die if they have the same name but different
480 * sha1s.
482 static int is_dup_ref(const struct ref_entry *ref1, const struct ref_entry *ref2)
484 if (strcmp(ref1->name, ref2->name))
485 return 0;
487 /* Duplicate name; make sure that they don't conflict: */
489 if ((ref1->flag & REF_DIR) || (ref2->flag & REF_DIR))
490 /* This is impossible by construction */
491 die("Reference directory conflict: %s", ref1->name);
493 if (hashcmp(ref1->u.value.sha1, ref2->u.value.sha1))
494 die("Duplicated ref, and SHA1s don't match: %s", ref1->name);
496 warning("Duplicated ref: %s", ref1->name);
497 return 1;
501 * Sort the entries in dir non-recursively (if they are not already
502 * sorted) and remove any duplicate entries.
504 static void sort_ref_dir(struct ref_dir *dir)
506 int i, j;
507 struct ref_entry *last = NULL;
510 * This check also prevents passing a zero-length array to qsort(),
511 * which is a problem on some platforms.
513 if (dir->sorted == dir->nr)
514 return;
516 qsort(dir->entries, dir->nr, sizeof(*dir->entries), ref_entry_cmp);
518 /* Remove any duplicates: */
519 for (i = 0, j = 0; j < dir->nr; j++) {
520 struct ref_entry *entry = dir->entries[j];
521 if (last && is_dup_ref(last, entry))
522 free_ref_entry(entry);
523 else
524 last = dir->entries[i++] = entry;
526 dir->sorted = dir->nr = i;
529 /* Include broken references in a do_for_each_ref*() iteration: */
530 #define DO_FOR_EACH_INCLUDE_BROKEN 0x01
533 * current_ref is a performance hack: when iterating over references
534 * using the for_each_ref*() functions, current_ref is set to the
535 * current reference's entry before calling the callback function. If
536 * the callback function calls peel_ref(), then peel_ref() first
537 * checks whether the reference to be peeled is the current reference
538 * (it usually is) and if so, returns that reference's peeled version
539 * if it is available. This avoids a refname lookup in a common case.
541 static struct ref_entry *current_ref;
544 * Handle one reference in a do_for_each_ref*()-style iteration.
546 static int do_one_ref(const char *base, each_ref_fn fn, int trim,
547 int flags, void *cb_data, struct ref_entry *entry)
549 int retval;
550 if (prefixcmp(entry->name, base))
551 return 0;
553 if (!(flags & DO_FOR_EACH_INCLUDE_BROKEN)) {
554 if (entry->flag & REF_ISBROKEN)
555 return 0; /* ignore broken refs e.g. dangling symref */
556 if (!has_sha1_file(entry->u.value.sha1)) {
557 error("%s does not point to a valid object!", entry->name);
558 return 0;
561 current_ref = entry;
562 retval = fn(entry->name + trim, entry->u.value.sha1, entry->flag, cb_data);
563 current_ref = NULL;
564 return retval;
568 * Call fn for each reference in dir that has index in the range
569 * offset <= index < dir->nr. Recurse into subdirectories that are in
570 * that index range, sorting them before iterating. This function
571 * does not sort dir itself; it should be sorted beforehand.
573 static int do_for_each_ref_in_dir(struct ref_dir *dir, int offset,
574 const char *base,
575 each_ref_fn fn, int trim, int flags, void *cb_data)
577 int i;
578 assert(dir->sorted == dir->nr);
579 for (i = offset; i < dir->nr; i++) {
580 struct ref_entry *entry = dir->entries[i];
581 int retval;
582 if (entry->flag & REF_DIR) {
583 struct ref_dir *subdir = get_ref_dir(entry);
584 sort_ref_dir(subdir);
585 retval = do_for_each_ref_in_dir(subdir, 0,
586 base, fn, trim, flags, cb_data);
587 } else {
588 retval = do_one_ref(base, fn, trim, flags, cb_data, entry);
590 if (retval)
591 return retval;
593 return 0;
597 * Call fn for each reference in the union of dir1 and dir2, in order
598 * by refname. Recurse into subdirectories. If a value entry appears
599 * in both dir1 and dir2, then only process the version that is in
600 * dir2. The input dirs must already be sorted, but subdirs will be
601 * sorted as needed.
603 static int do_for_each_ref_in_dirs(struct ref_dir *dir1,
604 struct ref_dir *dir2,
605 const char *base, each_ref_fn fn, int trim,
606 int flags, void *cb_data)
608 int retval;
609 int i1 = 0, i2 = 0;
611 assert(dir1->sorted == dir1->nr);
612 assert(dir2->sorted == dir2->nr);
613 while (1) {
614 struct ref_entry *e1, *e2;
615 int cmp;
616 if (i1 == dir1->nr) {
617 return do_for_each_ref_in_dir(dir2, i2,
618 base, fn, trim, flags, cb_data);
620 if (i2 == dir2->nr) {
621 return do_for_each_ref_in_dir(dir1, i1,
622 base, fn, trim, flags, cb_data);
624 e1 = dir1->entries[i1];
625 e2 = dir2->entries[i2];
626 cmp = strcmp(e1->name, e2->name);
627 if (cmp == 0) {
628 if ((e1->flag & REF_DIR) && (e2->flag & REF_DIR)) {
629 /* Both are directories; descend them in parallel. */
630 struct ref_dir *subdir1 = get_ref_dir(e1);
631 struct ref_dir *subdir2 = get_ref_dir(e2);
632 sort_ref_dir(subdir1);
633 sort_ref_dir(subdir2);
634 retval = do_for_each_ref_in_dirs(
635 subdir1, subdir2,
636 base, fn, trim, flags, cb_data);
637 i1++;
638 i2++;
639 } else if (!(e1->flag & REF_DIR) && !(e2->flag & REF_DIR)) {
640 /* Both are references; ignore the one from dir1. */
641 retval = do_one_ref(base, fn, trim, flags, cb_data, e2);
642 i1++;
643 i2++;
644 } else {
645 die("conflict between reference and directory: %s",
646 e1->name);
648 } else {
649 struct ref_entry *e;
650 if (cmp < 0) {
651 e = e1;
652 i1++;
653 } else {
654 e = e2;
655 i2++;
657 if (e->flag & REF_DIR) {
658 struct ref_dir *subdir = get_ref_dir(e);
659 sort_ref_dir(subdir);
660 retval = do_for_each_ref_in_dir(
661 subdir, 0,
662 base, fn, trim, flags, cb_data);
663 } else {
664 retval = do_one_ref(base, fn, trim, flags, cb_data, e);
667 if (retval)
668 return retval;
673 * Return true iff refname1 and refname2 conflict with each other.
674 * Two reference names conflict if one of them exactly matches the
675 * leading components of the other; e.g., "foo/bar" conflicts with
676 * both "foo" and with "foo/bar/baz" but not with "foo/bar" or
677 * "foo/barbados".
679 static int names_conflict(const char *refname1, const char *refname2)
681 for (; *refname1 && *refname1 == *refname2; refname1++, refname2++)
683 return (*refname1 == '\0' && *refname2 == '/')
684 || (*refname1 == '/' && *refname2 == '\0');
687 struct name_conflict_cb {
688 const char *refname;
689 const char *oldrefname;
690 const char *conflicting_refname;
693 static int name_conflict_fn(const char *existingrefname, const unsigned char *sha1,
694 int flags, void *cb_data)
696 struct name_conflict_cb *data = (struct name_conflict_cb *)cb_data;
697 if (data->oldrefname && !strcmp(data->oldrefname, existingrefname))
698 return 0;
699 if (names_conflict(data->refname, existingrefname)) {
700 data->conflicting_refname = existingrefname;
701 return 1;
703 return 0;
707 * Return true iff a reference named refname could be created without
708 * conflicting with the name of an existing reference in array. If
709 * oldrefname is non-NULL, ignore potential conflicts with oldrefname
710 * (e.g., because oldrefname is scheduled for deletion in the same
711 * operation).
713 static int is_refname_available(const char *refname, const char *oldrefname,
714 struct ref_dir *dir)
716 struct name_conflict_cb data;
717 data.refname = refname;
718 data.oldrefname = oldrefname;
719 data.conflicting_refname = NULL;
721 sort_ref_dir(dir);
722 if (do_for_each_ref_in_dir(dir, 0, "", name_conflict_fn,
723 0, DO_FOR_EACH_INCLUDE_BROKEN,
724 &data)) {
725 error("'%s' exists; cannot create '%s'",
726 data.conflicting_refname, refname);
727 return 0;
729 return 1;
733 * Future: need to be in "struct repository"
734 * when doing a full libification.
736 static struct ref_cache {
737 struct ref_cache *next;
738 struct ref_entry *loose;
739 struct ref_entry *packed;
740 /* The submodule name, or "" for the main repo. */
741 char name[FLEX_ARRAY];
742 } *ref_cache;
744 static void clear_packed_ref_cache(struct ref_cache *refs)
746 if (refs->packed) {
747 free_ref_entry(refs->packed);
748 refs->packed = NULL;
752 static void clear_loose_ref_cache(struct ref_cache *refs)
754 if (refs->loose) {
755 free_ref_entry(refs->loose);
756 refs->loose = NULL;
760 static struct ref_cache *create_ref_cache(const char *submodule)
762 int len;
763 struct ref_cache *refs;
764 if (!submodule)
765 submodule = "";
766 len = strlen(submodule) + 1;
767 refs = xcalloc(1, sizeof(struct ref_cache) + len);
768 memcpy(refs->name, submodule, len);
769 return refs;
773 * Return a pointer to a ref_cache for the specified submodule. For
774 * the main repository, use submodule==NULL. The returned structure
775 * will be allocated and initialized but not necessarily populated; it
776 * should not be freed.
778 static struct ref_cache *get_ref_cache(const char *submodule)
780 struct ref_cache *refs = ref_cache;
781 if (!submodule)
782 submodule = "";
783 while (refs) {
784 if (!strcmp(submodule, refs->name))
785 return refs;
786 refs = refs->next;
789 refs = create_ref_cache(submodule);
790 refs->next = ref_cache;
791 ref_cache = refs;
792 return refs;
795 void invalidate_ref_cache(const char *submodule)
797 struct ref_cache *refs = get_ref_cache(submodule);
798 clear_packed_ref_cache(refs);
799 clear_loose_ref_cache(refs);
802 /* The length of a peeled reference line in packed-refs, including EOL: */
803 #define PEELED_LINE_LENGTH 42
806 * Parse one line from a packed-refs file. Write the SHA1 to sha1.
807 * Return a pointer to the refname within the line (null-terminated),
808 * or NULL if there was a problem.
810 static const char *parse_ref_line(char *line, unsigned char *sha1)
813 * 42: the answer to everything.
815 * In this case, it happens to be the answer to
816 * 40 (length of sha1 hex representation)
817 * +1 (space in between hex and name)
818 * +1 (newline at the end of the line)
820 int len = strlen(line) - 42;
822 if (len <= 0)
823 return NULL;
824 if (get_sha1_hex(line, sha1) < 0)
825 return NULL;
826 if (!isspace(line[40]))
827 return NULL;
828 line += 41;
829 if (isspace(*line))
830 return NULL;
831 if (line[len] != '\n')
832 return NULL;
833 line[len] = 0;
835 return line;
839 * Read f, which is a packed-refs file, into dir.
841 * A comment line of the form "# pack-refs with: " may contain zero or
842 * more traits. We interpret the traits as follows:
844 * No traits:
846 * Probably no references are peeled. But if the file contains a
847 * peeled value for a reference, we will use it.
849 * peeled:
851 * References under "refs/tags/", if they *can* be peeled, *are*
852 * peeled in this file. References outside of "refs/tags/" are
853 * probably not peeled even if they could have been, but if we find
854 * a peeled value for such a reference we will use it.
856 * fully-peeled:
858 * All references in the file that can be peeled are peeled.
859 * Inversely (and this is more important), any references in the
860 * file for which no peeled value is recorded is not peelable. This
861 * trait should typically be written alongside "peeled" for
862 * compatibility with older clients, but we do not require it
863 * (i.e., "peeled" is a no-op if "fully-peeled" is set).
865 static void read_packed_refs(FILE *f, struct ref_dir *dir)
867 struct ref_entry *last = NULL;
868 char refline[PATH_MAX];
869 enum { PEELED_NONE, PEELED_TAGS, PEELED_FULLY } peeled = PEELED_NONE;
871 while (fgets(refline, sizeof(refline), f)) {
872 unsigned char sha1[20];
873 const char *refname;
874 static const char header[] = "# pack-refs with:";
876 if (!strncmp(refline, header, sizeof(header)-1)) {
877 const char *traits = refline + sizeof(header) - 1;
878 if (strstr(traits, " fully-peeled "))
879 peeled = PEELED_FULLY;
880 else if (strstr(traits, " peeled "))
881 peeled = PEELED_TAGS;
882 /* perhaps other traits later as well */
883 continue;
886 refname = parse_ref_line(refline, sha1);
887 if (refname) {
888 last = create_ref_entry(refname, sha1, REF_ISPACKED, 1);
889 if (peeled == PEELED_FULLY ||
890 (peeled == PEELED_TAGS && !prefixcmp(refname, "refs/tags/")))
891 last->flag |= REF_KNOWS_PEELED;
892 add_ref(dir, last);
893 continue;
895 if (last &&
896 refline[0] == '^' &&
897 strlen(refline) == PEELED_LINE_LENGTH &&
898 refline[PEELED_LINE_LENGTH - 1] == '\n' &&
899 !get_sha1_hex(refline + 1, sha1)) {
900 hashcpy(last->u.value.peeled, sha1);
902 * Regardless of what the file header said,
903 * we definitely know the value of *this*
904 * reference:
906 last->flag |= REF_KNOWS_PEELED;
911 static struct ref_dir *get_packed_refs(struct ref_cache *refs)
913 if (!refs->packed) {
914 const char *packed_refs_file;
915 FILE *f;
917 refs->packed = create_dir_entry(refs, "", 0, 0);
918 if (*refs->name)
919 packed_refs_file = git_path_submodule(refs->name, "packed-refs");
920 else
921 packed_refs_file = git_path("packed-refs");
922 f = fopen(packed_refs_file, "r");
923 if (f) {
924 read_packed_refs(f, get_ref_dir(refs->packed));
925 fclose(f);
928 return get_ref_dir(refs->packed);
931 void add_packed_ref(const char *refname, const unsigned char *sha1)
933 add_ref(get_packed_refs(get_ref_cache(NULL)),
934 create_ref_entry(refname, sha1, REF_ISPACKED, 1));
938 * Read the loose references from the namespace dirname into dir
939 * (without recursing). dirname must end with '/'. dir must be the
940 * directory entry corresponding to dirname.
942 static void read_loose_refs(const char *dirname, struct ref_dir *dir)
944 struct ref_cache *refs = dir->ref_cache;
945 DIR *d;
946 const char *path;
947 struct dirent *de;
948 int dirnamelen = strlen(dirname);
949 struct strbuf refname;
951 if (*refs->name)
952 path = git_path_submodule(refs->name, "%s", dirname);
953 else
954 path = git_path("%s", dirname);
956 d = opendir(path);
957 if (!d)
958 return;
960 strbuf_init(&refname, dirnamelen + 257);
961 strbuf_add(&refname, dirname, dirnamelen);
963 while ((de = readdir(d)) != NULL) {
964 unsigned char sha1[20];
965 struct stat st;
966 int flag;
967 const char *refdir;
969 if (de->d_name[0] == '.')
970 continue;
971 if (has_extension(de->d_name, ".lock"))
972 continue;
973 strbuf_addstr(&refname, de->d_name);
974 refdir = *refs->name
975 ? git_path_submodule(refs->name, "%s", refname.buf)
976 : git_path("%s", refname.buf);
977 if (stat(refdir, &st) < 0) {
978 ; /* silently ignore */
979 } else if (S_ISDIR(st.st_mode)) {
980 strbuf_addch(&refname, '/');
981 add_entry_to_dir(dir,
982 create_dir_entry(refs, refname.buf,
983 refname.len, 1));
984 } else {
985 if (*refs->name) {
986 hashclr(sha1);
987 flag = 0;
988 if (resolve_gitlink_ref(refs->name, refname.buf, sha1) < 0) {
989 hashclr(sha1);
990 flag |= REF_ISBROKEN;
992 } else if (read_ref_full(refname.buf, sha1, 1, &flag)) {
993 hashclr(sha1);
994 flag |= REF_ISBROKEN;
996 add_entry_to_dir(dir,
997 create_ref_entry(refname.buf, sha1, flag, 1));
999 strbuf_setlen(&refname, dirnamelen);
1001 strbuf_release(&refname);
1002 closedir(d);
1005 static struct ref_dir *get_loose_refs(struct ref_cache *refs)
1007 if (!refs->loose) {
1009 * Mark the top-level directory complete because we
1010 * are about to read the only subdirectory that can
1011 * hold references:
1013 refs->loose = create_dir_entry(refs, "", 0, 0);
1015 * Create an incomplete entry for "refs/":
1017 add_entry_to_dir(get_ref_dir(refs->loose),
1018 create_dir_entry(refs, "refs/", 5, 1));
1020 return get_ref_dir(refs->loose);
1023 /* We allow "recursive" symbolic refs. Only within reason, though */
1024 #define MAXDEPTH 5
1025 #define MAXREFLEN (1024)
1028 * Called by resolve_gitlink_ref_recursive() after it failed to read
1029 * from the loose refs in ref_cache refs. Find <refname> in the
1030 * packed-refs file for the submodule.
1032 static int resolve_gitlink_packed_ref(struct ref_cache *refs,
1033 const char *refname, unsigned char *sha1)
1035 struct ref_entry *ref;
1036 struct ref_dir *dir = get_packed_refs(refs);
1038 ref = find_ref(dir, refname);
1039 if (ref == NULL)
1040 return -1;
1042 memcpy(sha1, ref->u.value.sha1, 20);
1043 return 0;
1046 static int resolve_gitlink_ref_recursive(struct ref_cache *refs,
1047 const char *refname, unsigned char *sha1,
1048 int recursion)
1050 int fd, len;
1051 char buffer[128], *p;
1052 char *path;
1054 if (recursion > MAXDEPTH || strlen(refname) > MAXREFLEN)
1055 return -1;
1056 path = *refs->name
1057 ? git_path_submodule(refs->name, "%s", refname)
1058 : git_path("%s", refname);
1059 fd = open(path, O_RDONLY);
1060 if (fd < 0)
1061 return resolve_gitlink_packed_ref(refs, refname, sha1);
1063 len = read(fd, buffer, sizeof(buffer)-1);
1064 close(fd);
1065 if (len < 0)
1066 return -1;
1067 while (len && isspace(buffer[len-1]))
1068 len--;
1069 buffer[len] = 0;
1071 /* Was it a detached head or an old-fashioned symlink? */
1072 if (!get_sha1_hex(buffer, sha1))
1073 return 0;
1075 /* Symref? */
1076 if (strncmp(buffer, "ref:", 4))
1077 return -1;
1078 p = buffer + 4;
1079 while (isspace(*p))
1080 p++;
1082 return resolve_gitlink_ref_recursive(refs, p, sha1, recursion+1);
1085 int resolve_gitlink_ref(const char *path, const char *refname, unsigned char *sha1)
1087 int len = strlen(path), retval;
1088 char *submodule;
1089 struct ref_cache *refs;
1091 while (len && path[len-1] == '/')
1092 len--;
1093 if (!len)
1094 return -1;
1095 submodule = xstrndup(path, len);
1096 refs = get_ref_cache(submodule);
1097 free(submodule);
1099 retval = resolve_gitlink_ref_recursive(refs, refname, sha1, 0);
1100 return retval;
1104 * Return the ref_entry for the given refname from the packed
1105 * references. If it does not exist, return NULL.
1107 static struct ref_entry *get_packed_ref(const char *refname)
1109 return find_ref(get_packed_refs(get_ref_cache(NULL)), refname);
1112 const char *resolve_ref_unsafe(const char *refname, unsigned char *sha1, int reading, int *flag)
1114 int depth = MAXDEPTH;
1115 ssize_t len;
1116 char buffer[256];
1117 static char refname_buffer[256];
1119 if (flag)
1120 *flag = 0;
1122 if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL))
1123 return NULL;
1125 for (;;) {
1126 char path[PATH_MAX];
1127 struct stat st;
1128 char *buf;
1129 int fd;
1131 if (--depth < 0)
1132 return NULL;
1134 git_snpath(path, sizeof(path), "%s", refname);
1136 if (lstat(path, &st) < 0) {
1137 struct ref_entry *entry;
1139 if (errno != ENOENT)
1140 return NULL;
1142 * The loose reference file does not exist;
1143 * check for a packed reference.
1145 entry = get_packed_ref(refname);
1146 if (entry) {
1147 hashcpy(sha1, entry->u.value.sha1);
1148 if (flag)
1149 *flag |= REF_ISPACKED;
1150 return refname;
1152 /* The reference is not a packed reference, either. */
1153 if (reading) {
1154 return NULL;
1155 } else {
1156 hashclr(sha1);
1157 return refname;
1161 /* Follow "normalized" - ie "refs/.." symlinks by hand */
1162 if (S_ISLNK(st.st_mode)) {
1163 len = readlink(path, buffer, sizeof(buffer)-1);
1164 if (len < 0)
1165 return NULL;
1166 buffer[len] = 0;
1167 if (!prefixcmp(buffer, "refs/") &&
1168 !check_refname_format(buffer, 0)) {
1169 strcpy(refname_buffer, buffer);
1170 refname = refname_buffer;
1171 if (flag)
1172 *flag |= REF_ISSYMREF;
1173 continue;
1177 /* Is it a directory? */
1178 if (S_ISDIR(st.st_mode)) {
1179 errno = EISDIR;
1180 return NULL;
1184 * Anything else, just open it and try to use it as
1185 * a ref
1187 fd = open(path, O_RDONLY);
1188 if (fd < 0)
1189 return NULL;
1190 len = read_in_full(fd, buffer, sizeof(buffer)-1);
1191 close(fd);
1192 if (len < 0)
1193 return NULL;
1194 while (len && isspace(buffer[len-1]))
1195 len--;
1196 buffer[len] = '\0';
1199 * Is it a symbolic ref?
1201 if (prefixcmp(buffer, "ref:"))
1202 break;
1203 if (flag)
1204 *flag |= REF_ISSYMREF;
1205 buf = buffer + 4;
1206 while (isspace(*buf))
1207 buf++;
1208 if (check_refname_format(buf, REFNAME_ALLOW_ONELEVEL)) {
1209 if (flag)
1210 *flag |= REF_ISBROKEN;
1211 return NULL;
1213 refname = strcpy(refname_buffer, buf);
1215 /* Please note that FETCH_HEAD has a second line containing other data. */
1216 if (get_sha1_hex(buffer, sha1) || (buffer[40] != '\0' && !isspace(buffer[40]))) {
1217 if (flag)
1218 *flag |= REF_ISBROKEN;
1219 return NULL;
1221 return refname;
1224 char *resolve_refdup(const char *ref, unsigned char *sha1, int reading, int *flag)
1226 const char *ret = resolve_ref_unsafe(ref, sha1, reading, flag);
1227 return ret ? xstrdup(ret) : NULL;
1230 /* The argument to filter_refs */
1231 struct ref_filter {
1232 const char *pattern;
1233 each_ref_fn *fn;
1234 void *cb_data;
1237 int read_ref_full(const char *refname, unsigned char *sha1, int reading, int *flags)
1239 if (resolve_ref_unsafe(refname, sha1, reading, flags))
1240 return 0;
1241 return -1;
1244 int read_ref(const char *refname, unsigned char *sha1)
1246 return read_ref_full(refname, sha1, 1, NULL);
1249 int ref_exists(const char *refname)
1251 unsigned char sha1[20];
1252 return !!resolve_ref_unsafe(refname, sha1, 1, NULL);
1255 static int filter_refs(const char *refname, const unsigned char *sha1, int flags,
1256 void *data)
1258 struct ref_filter *filter = (struct ref_filter *)data;
1259 if (fnmatch(filter->pattern, refname, 0))
1260 return 0;
1261 return filter->fn(refname, sha1, flags, filter->cb_data);
1264 int peel_ref(const char *refname, unsigned char *sha1)
1266 int flag;
1267 unsigned char base[20];
1268 struct object *o;
1270 if (current_ref && (current_ref->name == refname
1271 || !strcmp(current_ref->name, refname))) {
1272 if (current_ref->flag & REF_KNOWS_PEELED) {
1273 if (is_null_sha1(current_ref->u.value.peeled))
1274 return -1;
1275 hashcpy(sha1, current_ref->u.value.peeled);
1276 return 0;
1278 hashcpy(base, current_ref->u.value.sha1);
1279 goto fallback;
1282 if (read_ref_full(refname, base, 1, &flag))
1283 return -1;
1285 if ((flag & REF_ISPACKED)) {
1286 struct ref_dir *dir = get_packed_refs(get_ref_cache(NULL));
1287 struct ref_entry *r = find_ref(dir, refname);
1289 if (r != NULL && r->flag & REF_KNOWS_PEELED) {
1290 hashcpy(sha1, r->u.value.peeled);
1291 return 0;
1295 fallback:
1296 o = lookup_unknown_object(base);
1297 if (o->type == OBJ_NONE) {
1298 int type = sha1_object_info(base, NULL);
1299 if (type < 0)
1300 return -1;
1301 o->type = type;
1304 if (o->type == OBJ_TAG) {
1305 o = deref_tag_noverify(o);
1306 if (o) {
1307 hashcpy(sha1, o->sha1);
1308 return 0;
1311 return -1;
1314 struct warn_if_dangling_data {
1315 FILE *fp;
1316 const char *refname;
1317 const char *msg_fmt;
1320 static int warn_if_dangling_symref(const char *refname, const unsigned char *sha1,
1321 int flags, void *cb_data)
1323 struct warn_if_dangling_data *d = cb_data;
1324 const char *resolves_to;
1325 unsigned char junk[20];
1327 if (!(flags & REF_ISSYMREF))
1328 return 0;
1330 resolves_to = resolve_ref_unsafe(refname, junk, 0, NULL);
1331 if (!resolves_to || strcmp(resolves_to, d->refname))
1332 return 0;
1334 fprintf(d->fp, d->msg_fmt, refname);
1335 fputc('\n', d->fp);
1336 return 0;
1339 void warn_dangling_symref(FILE *fp, const char *msg_fmt, const char *refname)
1341 struct warn_if_dangling_data data;
1343 data.fp = fp;
1344 data.refname = refname;
1345 data.msg_fmt = msg_fmt;
1346 for_each_rawref(warn_if_dangling_symref, &data);
1350 * Call fn for each reference in the specified submodule for which the
1351 * refname begins with base. If trim is non-zero, then trim that many
1352 * characters off the beginning of each refname before passing the
1353 * refname to fn. flags can be DO_FOR_EACH_INCLUDE_BROKEN to include
1354 * broken references in the iteration. If fn ever returns a non-zero
1355 * value, stop the iteration and return that value; otherwise, return
1356 * 0.
1358 static int do_for_each_ref(const char *submodule, const char *base, each_ref_fn fn,
1359 int trim, int flags, void *cb_data)
1361 struct ref_cache *refs = get_ref_cache(submodule);
1362 struct ref_dir *packed_dir = get_packed_refs(refs);
1363 struct ref_dir *loose_dir = get_loose_refs(refs);
1364 int retval = 0;
1366 if (base && *base) {
1367 packed_dir = find_containing_dir(packed_dir, base, 0);
1368 loose_dir = find_containing_dir(loose_dir, base, 0);
1371 if (packed_dir && loose_dir) {
1372 sort_ref_dir(packed_dir);
1373 sort_ref_dir(loose_dir);
1374 retval = do_for_each_ref_in_dirs(
1375 packed_dir, loose_dir,
1376 base, fn, trim, flags, cb_data);
1377 } else if (packed_dir) {
1378 sort_ref_dir(packed_dir);
1379 retval = do_for_each_ref_in_dir(
1380 packed_dir, 0,
1381 base, fn, trim, flags, cb_data);
1382 } else if (loose_dir) {
1383 sort_ref_dir(loose_dir);
1384 retval = do_for_each_ref_in_dir(
1385 loose_dir, 0,
1386 base, fn, trim, flags, cb_data);
1389 return retval;
1392 static int do_head_ref(const char *submodule, each_ref_fn fn, void *cb_data)
1394 unsigned char sha1[20];
1395 int flag;
1397 if (submodule) {
1398 if (resolve_gitlink_ref(submodule, "HEAD", sha1) == 0)
1399 return fn("HEAD", sha1, 0, cb_data);
1401 return 0;
1404 if (!read_ref_full("HEAD", sha1, 1, &flag))
1405 return fn("HEAD", sha1, flag, cb_data);
1407 return 0;
1410 int head_ref(each_ref_fn fn, void *cb_data)
1412 return do_head_ref(NULL, fn, cb_data);
1415 int head_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
1417 return do_head_ref(submodule, fn, cb_data);
1420 int for_each_ref(each_ref_fn fn, void *cb_data)
1422 return do_for_each_ref(NULL, "", fn, 0, 0, cb_data);
1425 int for_each_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
1427 return do_for_each_ref(submodule, "", fn, 0, 0, cb_data);
1430 int for_each_ref_in(const char *prefix, each_ref_fn fn, void *cb_data)
1432 return do_for_each_ref(NULL, prefix, fn, strlen(prefix), 0, cb_data);
1435 int for_each_ref_in_submodule(const char *submodule, const char *prefix,
1436 each_ref_fn fn, void *cb_data)
1438 return do_for_each_ref(submodule, prefix, fn, strlen(prefix), 0, cb_data);
1441 int for_each_tag_ref(each_ref_fn fn, void *cb_data)
1443 return for_each_ref_in("refs/tags/", fn, cb_data);
1446 int for_each_tag_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
1448 return for_each_ref_in_submodule(submodule, "refs/tags/", fn, cb_data);
1451 int for_each_branch_ref(each_ref_fn fn, void *cb_data)
1453 return for_each_ref_in("refs/heads/", fn, cb_data);
1456 int for_each_branch_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
1458 return for_each_ref_in_submodule(submodule, "refs/heads/", fn, cb_data);
1461 int for_each_remote_ref(each_ref_fn fn, void *cb_data)
1463 return for_each_ref_in("refs/remotes/", fn, cb_data);
1466 int for_each_remote_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
1468 return for_each_ref_in_submodule(submodule, "refs/remotes/", fn, cb_data);
1471 int for_each_replace_ref(each_ref_fn fn, void *cb_data)
1473 return do_for_each_ref(NULL, "refs/replace/", fn, 13, 0, cb_data);
1476 int head_ref_namespaced(each_ref_fn fn, void *cb_data)
1478 struct strbuf buf = STRBUF_INIT;
1479 int ret = 0;
1480 unsigned char sha1[20];
1481 int flag;
1483 strbuf_addf(&buf, "%sHEAD", get_git_namespace());
1484 if (!read_ref_full(buf.buf, sha1, 1, &flag))
1485 ret = fn(buf.buf, sha1, flag, cb_data);
1486 strbuf_release(&buf);
1488 return ret;
1491 int for_each_namespaced_ref(each_ref_fn fn, void *cb_data)
1493 struct strbuf buf = STRBUF_INIT;
1494 int ret;
1495 strbuf_addf(&buf, "%srefs/", get_git_namespace());
1496 ret = do_for_each_ref(NULL, buf.buf, fn, 0, 0, cb_data);
1497 strbuf_release(&buf);
1498 return ret;
1501 int for_each_glob_ref_in(each_ref_fn fn, const char *pattern,
1502 const char *prefix, void *cb_data)
1504 struct strbuf real_pattern = STRBUF_INIT;
1505 struct ref_filter filter;
1506 int ret;
1508 if (!prefix && prefixcmp(pattern, "refs/"))
1509 strbuf_addstr(&real_pattern, "refs/");
1510 else if (prefix)
1511 strbuf_addstr(&real_pattern, prefix);
1512 strbuf_addstr(&real_pattern, pattern);
1514 if (!has_glob_specials(pattern)) {
1515 /* Append implied '/' '*' if not present. */
1516 if (real_pattern.buf[real_pattern.len - 1] != '/')
1517 strbuf_addch(&real_pattern, '/');
1518 /* No need to check for '*', there is none. */
1519 strbuf_addch(&real_pattern, '*');
1522 filter.pattern = real_pattern.buf;
1523 filter.fn = fn;
1524 filter.cb_data = cb_data;
1525 ret = for_each_ref(filter_refs, &filter);
1527 strbuf_release(&real_pattern);
1528 return ret;
1531 int for_each_glob_ref(each_ref_fn fn, const char *pattern, void *cb_data)
1533 return for_each_glob_ref_in(fn, pattern, NULL, cb_data);
1536 int for_each_rawref(each_ref_fn fn, void *cb_data)
1538 return do_for_each_ref(NULL, "", fn, 0,
1539 DO_FOR_EACH_INCLUDE_BROKEN, cb_data);
1542 const char *prettify_refname(const char *name)
1544 return name + (
1545 !prefixcmp(name, "refs/heads/") ? 11 :
1546 !prefixcmp(name, "refs/tags/") ? 10 :
1547 !prefixcmp(name, "refs/remotes/") ? 13 :
1551 const char *ref_rev_parse_rules[] = {
1552 "%.*s",
1553 "refs/%.*s",
1554 "refs/tags/%.*s",
1555 "refs/heads/%.*s",
1556 "refs/remotes/%.*s",
1557 "refs/remotes/%.*s/HEAD",
1558 NULL
1561 int refname_match(const char *abbrev_name, const char *full_name, const char **rules)
1563 const char **p;
1564 const int abbrev_name_len = strlen(abbrev_name);
1566 for (p = rules; *p; p++) {
1567 if (!strcmp(full_name, mkpath(*p, abbrev_name_len, abbrev_name))) {
1568 return 1;
1572 return 0;
1575 static struct ref_lock *verify_lock(struct ref_lock *lock,
1576 const unsigned char *old_sha1, int mustexist)
1578 if (read_ref_full(lock->ref_name, lock->old_sha1, mustexist, NULL)) {
1579 error("Can't verify ref %s", lock->ref_name);
1580 unlock_ref(lock);
1581 return NULL;
1583 if (hashcmp(lock->old_sha1, old_sha1)) {
1584 error("Ref %s is at %s but expected %s", lock->ref_name,
1585 sha1_to_hex(lock->old_sha1), sha1_to_hex(old_sha1));
1586 unlock_ref(lock);
1587 return NULL;
1589 return lock;
1592 static int remove_empty_directories(const char *file)
1594 /* we want to create a file but there is a directory there;
1595 * if that is an empty directory (or a directory that contains
1596 * only empty directories), remove them.
1598 struct strbuf path;
1599 int result;
1601 strbuf_init(&path, 20);
1602 strbuf_addstr(&path, file);
1604 result = remove_dir_recursively(&path, REMOVE_DIR_EMPTY_ONLY);
1606 strbuf_release(&path);
1608 return result;
1612 * *string and *len will only be substituted, and *string returned (for
1613 * later free()ing) if the string passed in is a magic short-hand form
1614 * to name a branch.
1616 static char *substitute_branch_name(const char **string, int *len)
1618 struct strbuf buf = STRBUF_INIT;
1619 int ret = interpret_branch_name(*string, &buf);
1621 if (ret == *len) {
1622 size_t size;
1623 *string = strbuf_detach(&buf, &size);
1624 *len = size;
1625 return (char *)*string;
1628 return NULL;
1631 int dwim_ref(const char *str, int len, unsigned char *sha1, char **ref)
1633 char *last_branch = substitute_branch_name(&str, &len);
1634 const char **p, *r;
1635 int refs_found = 0;
1637 *ref = NULL;
1638 for (p = ref_rev_parse_rules; *p; p++) {
1639 char fullref[PATH_MAX];
1640 unsigned char sha1_from_ref[20];
1641 unsigned char *this_result;
1642 int flag;
1644 this_result = refs_found ? sha1_from_ref : sha1;
1645 mksnpath(fullref, sizeof(fullref), *p, len, str);
1646 r = resolve_ref_unsafe(fullref, this_result, 1, &flag);
1647 if (r) {
1648 if (!refs_found++)
1649 *ref = xstrdup(r);
1650 if (!warn_ambiguous_refs)
1651 break;
1652 } else if ((flag & REF_ISSYMREF) && strcmp(fullref, "HEAD")) {
1653 warning("ignoring dangling symref %s.", fullref);
1654 } else if ((flag & REF_ISBROKEN) && strchr(fullref, '/')) {
1655 warning("ignoring broken ref %s.", fullref);
1658 free(last_branch);
1659 return refs_found;
1662 int dwim_log(const char *str, int len, unsigned char *sha1, char **log)
1664 char *last_branch = substitute_branch_name(&str, &len);
1665 const char **p;
1666 int logs_found = 0;
1668 *log = NULL;
1669 for (p = ref_rev_parse_rules; *p; p++) {
1670 struct stat st;
1671 unsigned char hash[20];
1672 char path[PATH_MAX];
1673 const char *ref, *it;
1675 mksnpath(path, sizeof(path), *p, len, str);
1676 ref = resolve_ref_unsafe(path, hash, 1, NULL);
1677 if (!ref)
1678 continue;
1679 if (!stat(git_path("logs/%s", path), &st) &&
1680 S_ISREG(st.st_mode))
1681 it = path;
1682 else if (strcmp(ref, path) &&
1683 !stat(git_path("logs/%s", ref), &st) &&
1684 S_ISREG(st.st_mode))
1685 it = ref;
1686 else
1687 continue;
1688 if (!logs_found++) {
1689 *log = xstrdup(it);
1690 hashcpy(sha1, hash);
1692 if (!warn_ambiguous_refs)
1693 break;
1695 free(last_branch);
1696 return logs_found;
1699 static struct ref_lock *lock_ref_sha1_basic(const char *refname,
1700 const unsigned char *old_sha1,
1701 int flags, int *type_p)
1703 char *ref_file;
1704 const char *orig_refname = refname;
1705 struct ref_lock *lock;
1706 int last_errno = 0;
1707 int type, lflags;
1708 int mustexist = (old_sha1 && !is_null_sha1(old_sha1));
1709 int missing = 0;
1711 lock = xcalloc(1, sizeof(struct ref_lock));
1712 lock->lock_fd = -1;
1714 refname = resolve_ref_unsafe(refname, lock->old_sha1, mustexist, &type);
1715 if (!refname && errno == EISDIR) {
1716 /* we are trying to lock foo but we used to
1717 * have foo/bar which now does not exist;
1718 * it is normal for the empty directory 'foo'
1719 * to remain.
1721 ref_file = git_path("%s", orig_refname);
1722 if (remove_empty_directories(ref_file)) {
1723 last_errno = errno;
1724 error("there are still refs under '%s'", orig_refname);
1725 goto error_return;
1727 refname = resolve_ref_unsafe(orig_refname, lock->old_sha1, mustexist, &type);
1729 if (type_p)
1730 *type_p = type;
1731 if (!refname) {
1732 last_errno = errno;
1733 error("unable to resolve reference %s: %s",
1734 orig_refname, strerror(errno));
1735 goto error_return;
1737 missing = is_null_sha1(lock->old_sha1);
1738 /* When the ref did not exist and we are creating it,
1739 * make sure there is no existing ref that is packed
1740 * whose name begins with our refname, nor a ref whose
1741 * name is a proper prefix of our refname.
1743 if (missing &&
1744 !is_refname_available(refname, NULL, get_packed_refs(get_ref_cache(NULL)))) {
1745 last_errno = ENOTDIR;
1746 goto error_return;
1749 lock->lk = xcalloc(1, sizeof(struct lock_file));
1751 lflags = LOCK_DIE_ON_ERROR;
1752 if (flags & REF_NODEREF) {
1753 refname = orig_refname;
1754 lflags |= LOCK_NODEREF;
1756 lock->ref_name = xstrdup(refname);
1757 lock->orig_ref_name = xstrdup(orig_refname);
1758 ref_file = git_path("%s", refname);
1759 if (missing)
1760 lock->force_write = 1;
1761 if ((flags & REF_NODEREF) && (type & REF_ISSYMREF))
1762 lock->force_write = 1;
1764 if (safe_create_leading_directories(ref_file)) {
1765 last_errno = errno;
1766 error("unable to create directory for %s", ref_file);
1767 goto error_return;
1770 lock->lock_fd = hold_lock_file_for_update(lock->lk, ref_file, lflags);
1771 return old_sha1 ? verify_lock(lock, old_sha1, mustexist) : lock;
1773 error_return:
1774 unlock_ref(lock);
1775 errno = last_errno;
1776 return NULL;
1779 struct ref_lock *lock_ref_sha1(const char *refname, const unsigned char *old_sha1)
1781 char refpath[PATH_MAX];
1782 if (check_refname_format(refname, 0))
1783 return NULL;
1784 strcpy(refpath, mkpath("refs/%s", refname));
1785 return lock_ref_sha1_basic(refpath, old_sha1, 0, NULL);
1788 struct ref_lock *lock_any_ref_for_update(const char *refname,
1789 const unsigned char *old_sha1, int flags)
1791 if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL))
1792 return NULL;
1793 return lock_ref_sha1_basic(refname, old_sha1, flags, NULL);
1796 struct repack_without_ref_sb {
1797 const char *refname;
1798 int fd;
1801 static int repack_without_ref_fn(const char *refname, const unsigned char *sha1,
1802 int flags, void *cb_data)
1804 struct repack_without_ref_sb *data = cb_data;
1805 char line[PATH_MAX + 100];
1806 int len;
1808 if (!strcmp(data->refname, refname))
1809 return 0;
1810 len = snprintf(line, sizeof(line), "%s %s\n",
1811 sha1_to_hex(sha1), refname);
1812 /* this should not happen but just being defensive */
1813 if (len > sizeof(line))
1814 die("too long a refname '%s'", refname);
1815 write_or_die(data->fd, line, len);
1816 return 0;
1819 static struct lock_file packlock;
1821 static int repack_without_ref(const char *refname)
1823 struct repack_without_ref_sb data;
1824 struct ref_cache *refs = get_ref_cache(NULL);
1825 struct ref_dir *packed = get_packed_refs(refs);
1826 if (find_ref(packed, refname) == NULL)
1827 return 0;
1828 data.refname = refname;
1829 data.fd = hold_lock_file_for_update(&packlock, git_path("packed-refs"), 0);
1830 if (data.fd < 0) {
1831 unable_to_lock_error(git_path("packed-refs"), errno);
1832 return error("cannot delete '%s' from packed refs", refname);
1834 clear_packed_ref_cache(refs);
1835 packed = get_packed_refs(refs);
1836 do_for_each_ref_in_dir(packed, 0, "", repack_without_ref_fn, 0, 0, &data);
1837 return commit_lock_file(&packlock);
1840 int delete_ref(const char *refname, const unsigned char *sha1, int delopt)
1842 struct ref_lock *lock;
1843 int err, i = 0, ret = 0, flag = 0;
1845 lock = lock_ref_sha1_basic(refname, sha1, delopt, &flag);
1846 if (!lock)
1847 return 1;
1848 if (!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) {
1849 /* loose */
1850 i = strlen(lock->lk->filename) - 5; /* .lock */
1851 lock->lk->filename[i] = 0;
1852 err = unlink_or_warn(lock->lk->filename);
1853 if (err && errno != ENOENT)
1854 ret = 1;
1856 lock->lk->filename[i] = '.';
1858 /* removing the loose one could have resurrected an earlier
1859 * packed one. Also, if it was not loose we need to repack
1860 * without it.
1862 ret |= repack_without_ref(lock->ref_name);
1864 unlink_or_warn(git_path("logs/%s", lock->ref_name));
1865 invalidate_ref_cache(NULL);
1866 unlock_ref(lock);
1867 return ret;
1871 * People using contrib's git-new-workdir have .git/logs/refs ->
1872 * /some/other/path/.git/logs/refs, and that may live on another device.
1874 * IOW, to avoid cross device rename errors, the temporary renamed log must
1875 * live into logs/refs.
1877 #define TMP_RENAMED_LOG "logs/refs/.tmp-renamed-log"
1879 int rename_ref(const char *oldrefname, const char *newrefname, const char *logmsg)
1881 unsigned char sha1[20], orig_sha1[20];
1882 int flag = 0, logmoved = 0;
1883 struct ref_lock *lock;
1884 struct stat loginfo;
1885 int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);
1886 const char *symref = NULL;
1887 struct ref_cache *refs = get_ref_cache(NULL);
1889 if (log && S_ISLNK(loginfo.st_mode))
1890 return error("reflog for %s is a symlink", oldrefname);
1892 symref = resolve_ref_unsafe(oldrefname, orig_sha1, 1, &flag);
1893 if (flag & REF_ISSYMREF)
1894 return error("refname %s is a symbolic ref, renaming it is not supported",
1895 oldrefname);
1896 if (!symref)
1897 return error("refname %s not found", oldrefname);
1899 if (!is_refname_available(newrefname, oldrefname, get_packed_refs(refs)))
1900 return 1;
1902 if (!is_refname_available(newrefname, oldrefname, get_loose_refs(refs)))
1903 return 1;
1905 if (log && rename(git_path("logs/%s", oldrefname), git_path(TMP_RENAMED_LOG)))
1906 return error("unable to move logfile logs/%s to "TMP_RENAMED_LOG": %s",
1907 oldrefname, strerror(errno));
1909 if (delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {
1910 error("unable to delete old %s", oldrefname);
1911 goto rollback;
1914 if (!read_ref_full(newrefname, sha1, 1, &flag) &&
1915 delete_ref(newrefname, sha1, REF_NODEREF)) {
1916 if (errno==EISDIR) {
1917 if (remove_empty_directories(git_path("%s", newrefname))) {
1918 error("Directory not empty: %s", newrefname);
1919 goto rollback;
1921 } else {
1922 error("unable to delete existing %s", newrefname);
1923 goto rollback;
1927 if (log && safe_create_leading_directories(git_path("logs/%s", newrefname))) {
1928 error("unable to create directory for %s", newrefname);
1929 goto rollback;
1932 retry:
1933 if (log && rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", newrefname))) {
1934 if (errno==EISDIR || errno==ENOTDIR) {
1936 * rename(a, b) when b is an existing
1937 * directory ought to result in ISDIR, but
1938 * Solaris 5.8 gives ENOTDIR. Sheesh.
1940 if (remove_empty_directories(git_path("logs/%s", newrefname))) {
1941 error("Directory not empty: logs/%s", newrefname);
1942 goto rollback;
1944 goto retry;
1945 } else {
1946 error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s: %s",
1947 newrefname, strerror(errno));
1948 goto rollback;
1951 logmoved = log;
1953 lock = lock_ref_sha1_basic(newrefname, NULL, 0, NULL);
1954 if (!lock) {
1955 error("unable to lock %s for update", newrefname);
1956 goto rollback;
1958 lock->force_write = 1;
1959 hashcpy(lock->old_sha1, orig_sha1);
1960 if (write_ref_sha1(lock, orig_sha1, logmsg)) {
1961 error("unable to write current sha1 into %s", newrefname);
1962 goto rollback;
1965 return 0;
1967 rollback:
1968 lock = lock_ref_sha1_basic(oldrefname, NULL, 0, NULL);
1969 if (!lock) {
1970 error("unable to lock %s for rollback", oldrefname);
1971 goto rollbacklog;
1974 lock->force_write = 1;
1975 flag = log_all_ref_updates;
1976 log_all_ref_updates = 0;
1977 if (write_ref_sha1(lock, orig_sha1, NULL))
1978 error("unable to write current sha1 into %s", oldrefname);
1979 log_all_ref_updates = flag;
1981 rollbacklog:
1982 if (logmoved && rename(git_path("logs/%s", newrefname), git_path("logs/%s", oldrefname)))
1983 error("unable to restore logfile %s from %s: %s",
1984 oldrefname, newrefname, strerror(errno));
1985 if (!logmoved && log &&
1986 rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", oldrefname)))
1987 error("unable to restore logfile %s from "TMP_RENAMED_LOG": %s",
1988 oldrefname, strerror(errno));
1990 return 1;
1993 int close_ref(struct ref_lock *lock)
1995 if (close_lock_file(lock->lk))
1996 return -1;
1997 lock->lock_fd = -1;
1998 return 0;
2001 int commit_ref(struct ref_lock *lock)
2003 if (commit_lock_file(lock->lk))
2004 return -1;
2005 lock->lock_fd = -1;
2006 return 0;
2009 void unlock_ref(struct ref_lock *lock)
2011 /* Do not free lock->lk -- atexit() still looks at them */
2012 if (lock->lk)
2013 rollback_lock_file(lock->lk);
2014 free(lock->ref_name);
2015 free(lock->orig_ref_name);
2016 free(lock);
2020 * copy the reflog message msg to buf, which has been allocated sufficiently
2021 * large, while cleaning up the whitespaces. Especially, convert LF to space,
2022 * because reflog file is one line per entry.
2024 static int copy_msg(char *buf, const char *msg)
2026 char *cp = buf;
2027 char c;
2028 int wasspace = 1;
2030 *cp++ = '\t';
2031 while ((c = *msg++)) {
2032 if (wasspace && isspace(c))
2033 continue;
2034 wasspace = isspace(c);
2035 if (wasspace)
2036 c = ' ';
2037 *cp++ = c;
2039 while (buf < cp && isspace(cp[-1]))
2040 cp--;
2041 *cp++ = '\n';
2042 return cp - buf;
2045 int log_ref_setup(const char *refname, char *logfile, int bufsize)
2047 int logfd, oflags = O_APPEND | O_WRONLY;
2049 git_snpath(logfile, bufsize, "logs/%s", refname);
2050 if (log_all_ref_updates &&
2051 (!prefixcmp(refname, "refs/heads/") ||
2052 !prefixcmp(refname, "refs/remotes/") ||
2053 !prefixcmp(refname, "refs/notes/") ||
2054 !strcmp(refname, "HEAD"))) {
2055 if (safe_create_leading_directories(logfile) < 0)
2056 return error("unable to create directory for %s",
2057 logfile);
2058 oflags |= O_CREAT;
2061 logfd = open(logfile, oflags, 0666);
2062 if (logfd < 0) {
2063 if (!(oflags & O_CREAT) && errno == ENOENT)
2064 return 0;
2066 if ((oflags & O_CREAT) && errno == EISDIR) {
2067 if (remove_empty_directories(logfile)) {
2068 return error("There are still logs under '%s'",
2069 logfile);
2071 logfd = open(logfile, oflags, 0666);
2074 if (logfd < 0)
2075 return error("Unable to append to %s: %s",
2076 logfile, strerror(errno));
2079 adjust_shared_perm(logfile);
2080 close(logfd);
2081 return 0;
2084 static int log_ref_write(const char *refname, const unsigned char *old_sha1,
2085 const unsigned char *new_sha1, const char *msg)
2087 int logfd, result, written, oflags = O_APPEND | O_WRONLY;
2088 unsigned maxlen, len;
2089 int msglen;
2090 char log_file[PATH_MAX];
2091 char *logrec;
2092 const char *committer;
2094 if (log_all_ref_updates < 0)
2095 log_all_ref_updates = !is_bare_repository();
2097 result = log_ref_setup(refname, log_file, sizeof(log_file));
2098 if (result)
2099 return result;
2101 logfd = open(log_file, oflags);
2102 if (logfd < 0)
2103 return 0;
2104 msglen = msg ? strlen(msg) : 0;
2105 committer = git_committer_info(0);
2106 maxlen = strlen(committer) + msglen + 100;
2107 logrec = xmalloc(maxlen);
2108 len = sprintf(logrec, "%s %s %s\n",
2109 sha1_to_hex(old_sha1),
2110 sha1_to_hex(new_sha1),
2111 committer);
2112 if (msglen)
2113 len += copy_msg(logrec + len - 1, msg) - 1;
2114 written = len <= maxlen ? write_in_full(logfd, logrec, len) : -1;
2115 free(logrec);
2116 if (close(logfd) != 0 || written != len)
2117 return error("Unable to append to %s", log_file);
2118 return 0;
2121 static int is_branch(const char *refname)
2123 return !strcmp(refname, "HEAD") || !prefixcmp(refname, "refs/heads/");
2126 int write_ref_sha1(struct ref_lock *lock,
2127 const unsigned char *sha1, const char *logmsg)
2129 static char term = '\n';
2130 struct object *o;
2132 if (!lock)
2133 return -1;
2134 if (!lock->force_write && !hashcmp(lock->old_sha1, sha1)) {
2135 unlock_ref(lock);
2136 return 0;
2138 o = parse_object(sha1);
2139 if (!o) {
2140 error("Trying to write ref %s with nonexistent object %s",
2141 lock->ref_name, sha1_to_hex(sha1));
2142 unlock_ref(lock);
2143 return -1;
2145 if (o->type != OBJ_COMMIT && is_branch(lock->ref_name)) {
2146 error("Trying to write non-commit object %s to branch %s",
2147 sha1_to_hex(sha1), lock->ref_name);
2148 unlock_ref(lock);
2149 return -1;
2151 if (write_in_full(lock->lock_fd, sha1_to_hex(sha1), 40) != 40 ||
2152 write_in_full(lock->lock_fd, &term, 1) != 1
2153 || close_ref(lock) < 0) {
2154 error("Couldn't write %s", lock->lk->filename);
2155 unlock_ref(lock);
2156 return -1;
2158 clear_loose_ref_cache(get_ref_cache(NULL));
2159 if (log_ref_write(lock->ref_name, lock->old_sha1, sha1, logmsg) < 0 ||
2160 (strcmp(lock->ref_name, lock->orig_ref_name) &&
2161 log_ref_write(lock->orig_ref_name, lock->old_sha1, sha1, logmsg) < 0)) {
2162 unlock_ref(lock);
2163 return -1;
2165 if (strcmp(lock->orig_ref_name, "HEAD") != 0) {
2167 * Special hack: If a branch is updated directly and HEAD
2168 * points to it (may happen on the remote side of a push
2169 * for example) then logically the HEAD reflog should be
2170 * updated too.
2171 * A generic solution implies reverse symref information,
2172 * but finding all symrefs pointing to the given branch
2173 * would be rather costly for this rare event (the direct
2174 * update of a branch) to be worth it. So let's cheat and
2175 * check with HEAD only which should cover 99% of all usage
2176 * scenarios (even 100% of the default ones).
2178 unsigned char head_sha1[20];
2179 int head_flag;
2180 const char *head_ref;
2181 head_ref = resolve_ref_unsafe("HEAD", head_sha1, 1, &head_flag);
2182 if (head_ref && (head_flag & REF_ISSYMREF) &&
2183 !strcmp(head_ref, lock->ref_name))
2184 log_ref_write("HEAD", lock->old_sha1, sha1, logmsg);
2186 if (commit_ref(lock)) {
2187 error("Couldn't set %s", lock->ref_name);
2188 unlock_ref(lock);
2189 return -1;
2191 unlock_ref(lock);
2192 return 0;
2195 int create_symref(const char *ref_target, const char *refs_heads_master,
2196 const char *logmsg)
2198 const char *lockpath;
2199 char ref[1000];
2200 int fd, len, written;
2201 char *git_HEAD = git_pathdup("%s", ref_target);
2202 unsigned char old_sha1[20], new_sha1[20];
2204 if (logmsg && read_ref(ref_target, old_sha1))
2205 hashclr(old_sha1);
2207 if (safe_create_leading_directories(git_HEAD) < 0)
2208 return error("unable to create directory for %s", git_HEAD);
2210 #ifndef NO_SYMLINK_HEAD
2211 if (prefer_symlink_refs) {
2212 unlink(git_HEAD);
2213 if (!symlink(refs_heads_master, git_HEAD))
2214 goto done;
2215 fprintf(stderr, "no symlink - falling back to symbolic ref\n");
2217 #endif
2219 len = snprintf(ref, sizeof(ref), "ref: %s\n", refs_heads_master);
2220 if (sizeof(ref) <= len) {
2221 error("refname too long: %s", refs_heads_master);
2222 goto error_free_return;
2224 lockpath = mkpath("%s.lock", git_HEAD);
2225 fd = open(lockpath, O_CREAT | O_EXCL | O_WRONLY, 0666);
2226 if (fd < 0) {
2227 error("Unable to open %s for writing", lockpath);
2228 goto error_free_return;
2230 written = write_in_full(fd, ref, len);
2231 if (close(fd) != 0 || written != len) {
2232 error("Unable to write to %s", lockpath);
2233 goto error_unlink_return;
2235 if (rename(lockpath, git_HEAD) < 0) {
2236 error("Unable to create %s", git_HEAD);
2237 goto error_unlink_return;
2239 if (adjust_shared_perm(git_HEAD)) {
2240 error("Unable to fix permissions on %s", lockpath);
2241 error_unlink_return:
2242 unlink_or_warn(lockpath);
2243 error_free_return:
2244 free(git_HEAD);
2245 return -1;
2248 #ifndef NO_SYMLINK_HEAD
2249 done:
2250 #endif
2251 if (logmsg && !read_ref(refs_heads_master, new_sha1))
2252 log_ref_write(ref_target, old_sha1, new_sha1, logmsg);
2254 free(git_HEAD);
2255 return 0;
2258 static char *ref_msg(const char *line, const char *endp)
2260 const char *ep;
2261 line += 82;
2262 ep = memchr(line, '\n', endp - line);
2263 if (!ep)
2264 ep = endp;
2265 return xmemdupz(line, ep - line);
2268 int read_ref_at(const char *refname, unsigned long at_time, int cnt,
2269 unsigned char *sha1, char **msg,
2270 unsigned long *cutoff_time, int *cutoff_tz, int *cutoff_cnt)
2272 const char *logfile, *logdata, *logend, *rec, *lastgt, *lastrec;
2273 char *tz_c;
2274 int logfd, tz, reccnt = 0;
2275 struct stat st;
2276 unsigned long date;
2277 unsigned char logged_sha1[20];
2278 void *log_mapped;
2279 size_t mapsz;
2281 logfile = git_path("logs/%s", refname);
2282 logfd = open(logfile, O_RDONLY, 0);
2283 if (logfd < 0)
2284 die_errno("Unable to read log '%s'", logfile);
2285 fstat(logfd, &st);
2286 if (!st.st_size)
2287 die("Log %s is empty.", logfile);
2288 mapsz = xsize_t(st.st_size);
2289 log_mapped = xmmap(NULL, mapsz, PROT_READ, MAP_PRIVATE, logfd, 0);
2290 logdata = log_mapped;
2291 close(logfd);
2293 lastrec = NULL;
2294 rec = logend = logdata + st.st_size;
2295 while (logdata < rec) {
2296 reccnt++;
2297 if (logdata < rec && *(rec-1) == '\n')
2298 rec--;
2299 lastgt = NULL;
2300 while (logdata < rec && *(rec-1) != '\n') {
2301 rec--;
2302 if (*rec == '>')
2303 lastgt = rec;
2305 if (!lastgt)
2306 die("Log %s is corrupt.", logfile);
2307 date = strtoul(lastgt + 1, &tz_c, 10);
2308 if (date <= at_time || cnt == 0) {
2309 tz = strtoul(tz_c, NULL, 10);
2310 if (msg)
2311 *msg = ref_msg(rec, logend);
2312 if (cutoff_time)
2313 *cutoff_time = date;
2314 if (cutoff_tz)
2315 *cutoff_tz = tz;
2316 if (cutoff_cnt)
2317 *cutoff_cnt = reccnt - 1;
2318 if (lastrec) {
2319 if (get_sha1_hex(lastrec, logged_sha1))
2320 die("Log %s is corrupt.", logfile);
2321 if (get_sha1_hex(rec + 41, sha1))
2322 die("Log %s is corrupt.", logfile);
2323 if (hashcmp(logged_sha1, sha1)) {
2324 warning("Log %s has gap after %s.",
2325 logfile, show_date(date, tz, DATE_RFC2822));
2328 else if (date == at_time) {
2329 if (get_sha1_hex(rec + 41, sha1))
2330 die("Log %s is corrupt.", logfile);
2332 else {
2333 if (get_sha1_hex(rec + 41, logged_sha1))
2334 die("Log %s is corrupt.", logfile);
2335 if (hashcmp(logged_sha1, sha1)) {
2336 warning("Log %s unexpectedly ended on %s.",
2337 logfile, show_date(date, tz, DATE_RFC2822));
2340 munmap(log_mapped, mapsz);
2341 return 0;
2343 lastrec = rec;
2344 if (cnt > 0)
2345 cnt--;
2348 rec = logdata;
2349 while (rec < logend && *rec != '>' && *rec != '\n')
2350 rec++;
2351 if (rec == logend || *rec == '\n')
2352 die("Log %s is corrupt.", logfile);
2353 date = strtoul(rec + 1, &tz_c, 10);
2354 tz = strtoul(tz_c, NULL, 10);
2355 if (get_sha1_hex(logdata, sha1))
2356 die("Log %s is corrupt.", logfile);
2357 if (is_null_sha1(sha1)) {
2358 if (get_sha1_hex(logdata + 41, sha1))
2359 die("Log %s is corrupt.", logfile);
2361 if (msg)
2362 *msg = ref_msg(logdata, logend);
2363 munmap(log_mapped, mapsz);
2365 if (cutoff_time)
2366 *cutoff_time = date;
2367 if (cutoff_tz)
2368 *cutoff_tz = tz;
2369 if (cutoff_cnt)
2370 *cutoff_cnt = reccnt;
2371 return 1;
2374 int for_each_recent_reflog_ent(const char *refname, each_reflog_ent_fn fn, long ofs, void *cb_data)
2376 const char *logfile;
2377 FILE *logfp;
2378 struct strbuf sb = STRBUF_INIT;
2379 int ret = 0;
2381 logfile = git_path("logs/%s", refname);
2382 logfp = fopen(logfile, "r");
2383 if (!logfp)
2384 return -1;
2386 if (ofs) {
2387 struct stat statbuf;
2388 if (fstat(fileno(logfp), &statbuf) ||
2389 statbuf.st_size < ofs ||
2390 fseek(logfp, -ofs, SEEK_END) ||
2391 strbuf_getwholeline(&sb, logfp, '\n')) {
2392 fclose(logfp);
2393 strbuf_release(&sb);
2394 return -1;
2398 while (!strbuf_getwholeline(&sb, logfp, '\n')) {
2399 unsigned char osha1[20], nsha1[20];
2400 char *email_end, *message;
2401 unsigned long timestamp;
2402 int tz;
2404 /* old SP new SP name <email> SP time TAB msg LF */
2405 if (sb.len < 83 || sb.buf[sb.len - 1] != '\n' ||
2406 get_sha1_hex(sb.buf, osha1) || sb.buf[40] != ' ' ||
2407 get_sha1_hex(sb.buf + 41, nsha1) || sb.buf[81] != ' ' ||
2408 !(email_end = strchr(sb.buf + 82, '>')) ||
2409 email_end[1] != ' ' ||
2410 !(timestamp = strtoul(email_end + 2, &message, 10)) ||
2411 !message || message[0] != ' ' ||
2412 (message[1] != '+' && message[1] != '-') ||
2413 !isdigit(message[2]) || !isdigit(message[3]) ||
2414 !isdigit(message[4]) || !isdigit(message[5]))
2415 continue; /* corrupt? */
2416 email_end[1] = '\0';
2417 tz = strtol(message + 1, NULL, 10);
2418 if (message[6] != '\t')
2419 message += 6;
2420 else
2421 message += 7;
2422 ret = fn(osha1, nsha1, sb.buf + 82, timestamp, tz, message,
2423 cb_data);
2424 if (ret)
2425 break;
2427 fclose(logfp);
2428 strbuf_release(&sb);
2429 return ret;
2432 int for_each_reflog_ent(const char *refname, each_reflog_ent_fn fn, void *cb_data)
2434 return for_each_recent_reflog_ent(refname, fn, 0, cb_data);
2438 * Call fn for each reflog in the namespace indicated by name. name
2439 * must be empty or end with '/'. Name will be used as a scratch
2440 * space, but its contents will be restored before return.
2442 static int do_for_each_reflog(struct strbuf *name, each_ref_fn fn, void *cb_data)
2444 DIR *d = opendir(git_path("logs/%s", name->buf));
2445 int retval = 0;
2446 struct dirent *de;
2447 int oldlen = name->len;
2449 if (!d)
2450 return name->len ? errno : 0;
2452 while ((de = readdir(d)) != NULL) {
2453 struct stat st;
2455 if (de->d_name[0] == '.')
2456 continue;
2457 if (has_extension(de->d_name, ".lock"))
2458 continue;
2459 strbuf_addstr(name, de->d_name);
2460 if (stat(git_path("logs/%s", name->buf), &st) < 0) {
2461 ; /* silently ignore */
2462 } else {
2463 if (S_ISDIR(st.st_mode)) {
2464 strbuf_addch(name, '/');
2465 retval = do_for_each_reflog(name, fn, cb_data);
2466 } else {
2467 unsigned char sha1[20];
2468 if (read_ref_full(name->buf, sha1, 0, NULL))
2469 retval = error("bad ref for %s", name->buf);
2470 else
2471 retval = fn(name->buf, sha1, 0, cb_data);
2473 if (retval)
2474 break;
2476 strbuf_setlen(name, oldlen);
2478 closedir(d);
2479 return retval;
2482 int for_each_reflog(each_ref_fn fn, void *cb_data)
2484 int retval;
2485 struct strbuf name;
2486 strbuf_init(&name, PATH_MAX);
2487 retval = do_for_each_reflog(&name, fn, cb_data);
2488 strbuf_release(&name);
2489 return retval;
2492 int update_ref(const char *action, const char *refname,
2493 const unsigned char *sha1, const unsigned char *oldval,
2494 int flags, enum action_on_err onerr)
2496 static struct ref_lock *lock;
2497 lock = lock_any_ref_for_update(refname, oldval, flags);
2498 if (!lock) {
2499 const char *str = "Cannot lock the ref '%s'.";
2500 switch (onerr) {
2501 case MSG_ON_ERR: error(str, refname); break;
2502 case DIE_ON_ERR: die(str, refname); break;
2503 case QUIET_ON_ERR: break;
2505 return 1;
2507 if (write_ref_sha1(lock, sha1, action) < 0) {
2508 const char *str = "Cannot update the ref '%s'.";
2509 switch (onerr) {
2510 case MSG_ON_ERR: error(str, refname); break;
2511 case DIE_ON_ERR: die(str, refname); break;
2512 case QUIET_ON_ERR: break;
2514 return 1;
2516 return 0;
2519 struct ref *find_ref_by_name(const struct ref *list, const char *name)
2521 for ( ; list; list = list->next)
2522 if (!strcmp(list->name, name))
2523 return (struct ref *)list;
2524 return NULL;
2528 * generate a format suitable for scanf from a ref_rev_parse_rules
2529 * rule, that is replace the "%.*s" spec with a "%s" spec
2531 static void gen_scanf_fmt(char *scanf_fmt, const char *rule)
2533 char *spec;
2535 spec = strstr(rule, "%.*s");
2536 if (!spec || strstr(spec + 4, "%.*s"))
2537 die("invalid rule in ref_rev_parse_rules: %s", rule);
2539 /* copy all until spec */
2540 strncpy(scanf_fmt, rule, spec - rule);
2541 scanf_fmt[spec - rule] = '\0';
2542 /* copy new spec */
2543 strcat(scanf_fmt, "%s");
2544 /* copy remaining rule */
2545 strcat(scanf_fmt, spec + 4);
2547 return;
2550 char *shorten_unambiguous_ref(const char *refname, int strict)
2552 int i;
2553 static char **scanf_fmts;
2554 static int nr_rules;
2555 char *short_name;
2557 /* pre generate scanf formats from ref_rev_parse_rules[] */
2558 if (!nr_rules) {
2559 size_t total_len = 0;
2561 /* the rule list is NULL terminated, count them first */
2562 for (; ref_rev_parse_rules[nr_rules]; nr_rules++)
2563 /* no +1 because strlen("%s") < strlen("%.*s") */
2564 total_len += strlen(ref_rev_parse_rules[nr_rules]);
2566 scanf_fmts = xmalloc(nr_rules * sizeof(char *) + total_len);
2568 total_len = 0;
2569 for (i = 0; i < nr_rules; i++) {
2570 scanf_fmts[i] = (char *)&scanf_fmts[nr_rules]
2571 + total_len;
2572 gen_scanf_fmt(scanf_fmts[i], ref_rev_parse_rules[i]);
2573 total_len += strlen(ref_rev_parse_rules[i]);
2577 /* bail out if there are no rules */
2578 if (!nr_rules)
2579 return xstrdup(refname);
2581 /* buffer for scanf result, at most refname must fit */
2582 short_name = xstrdup(refname);
2584 /* skip first rule, it will always match */
2585 for (i = nr_rules - 1; i > 0 ; --i) {
2586 int j;
2587 int rules_to_fail = i;
2588 int short_name_len;
2590 if (1 != sscanf(refname, scanf_fmts[i], short_name))
2591 continue;
2593 short_name_len = strlen(short_name);
2596 * in strict mode, all (except the matched one) rules
2597 * must fail to resolve to a valid non-ambiguous ref
2599 if (strict)
2600 rules_to_fail = nr_rules;
2603 * check if the short name resolves to a valid ref,
2604 * but use only rules prior to the matched one
2606 for (j = 0; j < rules_to_fail; j++) {
2607 const char *rule = ref_rev_parse_rules[j];
2608 char refname[PATH_MAX];
2610 /* skip matched rule */
2611 if (i == j)
2612 continue;
2615 * the short name is ambiguous, if it resolves
2616 * (with this previous rule) to a valid ref
2617 * read_ref() returns 0 on success
2619 mksnpath(refname, sizeof(refname),
2620 rule, short_name_len, short_name);
2621 if (ref_exists(refname))
2622 break;
2626 * short name is non-ambiguous if all previous rules
2627 * haven't resolved to a valid ref
2629 if (j == rules_to_fail)
2630 return short_name;
2633 free(short_name);
2634 return xstrdup(refname);