refs: define constant PEELED_LINE_LENGTH
[git/mjg.git] / refs.c
blob390251476c3108b217c62563fc66b926710bc1c2
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;
670 if (i1 < dir1->nr)
671 return do_for_each_ref_in_dir(dir1, i1,
672 base, fn, trim, flags, cb_data);
673 if (i2 < dir2->nr)
674 return do_for_each_ref_in_dir(dir2, i2,
675 base, fn, trim, flags, cb_data);
676 return 0;
680 * Return true iff refname1 and refname2 conflict with each other.
681 * Two reference names conflict if one of them exactly matches the
682 * leading components of the other; e.g., "foo/bar" conflicts with
683 * both "foo" and with "foo/bar/baz" but not with "foo/bar" or
684 * "foo/barbados".
686 static int names_conflict(const char *refname1, const char *refname2)
688 for (; *refname1 && *refname1 == *refname2; refname1++, refname2++)
690 return (*refname1 == '\0' && *refname2 == '/')
691 || (*refname1 == '/' && *refname2 == '\0');
694 struct name_conflict_cb {
695 const char *refname;
696 const char *oldrefname;
697 const char *conflicting_refname;
700 static int name_conflict_fn(const char *existingrefname, const unsigned char *sha1,
701 int flags, void *cb_data)
703 struct name_conflict_cb *data = (struct name_conflict_cb *)cb_data;
704 if (data->oldrefname && !strcmp(data->oldrefname, existingrefname))
705 return 0;
706 if (names_conflict(data->refname, existingrefname)) {
707 data->conflicting_refname = existingrefname;
708 return 1;
710 return 0;
714 * Return true iff a reference named refname could be created without
715 * conflicting with the name of an existing reference in array. If
716 * oldrefname is non-NULL, ignore potential conflicts with oldrefname
717 * (e.g., because oldrefname is scheduled for deletion in the same
718 * operation).
720 static int is_refname_available(const char *refname, const char *oldrefname,
721 struct ref_dir *dir)
723 struct name_conflict_cb data;
724 data.refname = refname;
725 data.oldrefname = oldrefname;
726 data.conflicting_refname = NULL;
728 sort_ref_dir(dir);
729 if (do_for_each_ref_in_dir(dir, 0, "", name_conflict_fn,
730 0, DO_FOR_EACH_INCLUDE_BROKEN,
731 &data)) {
732 error("'%s' exists; cannot create '%s'",
733 data.conflicting_refname, refname);
734 return 0;
736 return 1;
740 * Future: need to be in "struct repository"
741 * when doing a full libification.
743 static struct ref_cache {
744 struct ref_cache *next;
745 struct ref_entry *loose;
746 struct ref_entry *packed;
747 /* The submodule name, or "" for the main repo. */
748 char name[FLEX_ARRAY];
749 } *ref_cache;
751 static void clear_packed_ref_cache(struct ref_cache *refs)
753 if (refs->packed) {
754 free_ref_entry(refs->packed);
755 refs->packed = NULL;
759 static void clear_loose_ref_cache(struct ref_cache *refs)
761 if (refs->loose) {
762 free_ref_entry(refs->loose);
763 refs->loose = NULL;
767 static struct ref_cache *create_ref_cache(const char *submodule)
769 int len;
770 struct ref_cache *refs;
771 if (!submodule)
772 submodule = "";
773 len = strlen(submodule) + 1;
774 refs = xcalloc(1, sizeof(struct ref_cache) + len);
775 memcpy(refs->name, submodule, len);
776 return refs;
780 * Return a pointer to a ref_cache for the specified submodule. For
781 * the main repository, use submodule==NULL. The returned structure
782 * will be allocated and initialized but not necessarily populated; it
783 * should not be freed.
785 static struct ref_cache *get_ref_cache(const char *submodule)
787 struct ref_cache *refs = ref_cache;
788 if (!submodule)
789 submodule = "";
790 while (refs) {
791 if (!strcmp(submodule, refs->name))
792 return refs;
793 refs = refs->next;
796 refs = create_ref_cache(submodule);
797 refs->next = ref_cache;
798 ref_cache = refs;
799 return refs;
802 void invalidate_ref_cache(const char *submodule)
804 struct ref_cache *refs = get_ref_cache(submodule);
805 clear_packed_ref_cache(refs);
806 clear_loose_ref_cache(refs);
809 /* The length of a peeled reference line in packed-refs, including EOL: */
810 #define PEELED_LINE_LENGTH 42
813 * Parse one line from a packed-refs file. Write the SHA1 to sha1.
814 * Return a pointer to the refname within the line (null-terminated),
815 * or NULL if there was a problem.
817 static const char *parse_ref_line(char *line, unsigned char *sha1)
820 * 42: the answer to everything.
822 * In this case, it happens to be the answer to
823 * 40 (length of sha1 hex representation)
824 * +1 (space in between hex and name)
825 * +1 (newline at the end of the line)
827 int len = strlen(line) - 42;
829 if (len <= 0)
830 return NULL;
831 if (get_sha1_hex(line, sha1) < 0)
832 return NULL;
833 if (!isspace(line[40]))
834 return NULL;
835 line += 41;
836 if (isspace(*line))
837 return NULL;
838 if (line[len] != '\n')
839 return NULL;
840 line[len] = 0;
842 return line;
846 * Read f, which is a packed-refs file, into dir.
848 * A comment line of the form "# pack-refs with: " may contain zero or
849 * more traits. We interpret the traits as follows:
851 * No traits:
853 * Probably no references are peeled. But if the file contains a
854 * peeled value for a reference, we will use it.
856 * peeled:
858 * References under "refs/tags/", if they *can* be peeled, *are*
859 * peeled in this file. References outside of "refs/tags/" are
860 * probably not peeled even if they could have been, but if we find
861 * a peeled value for such a reference we will use it.
863 * fully-peeled:
865 * All references in the file that can be peeled are peeled.
866 * Inversely (and this is more important), any references in the
867 * file for which no peeled value is recorded is not peelable. This
868 * trait should typically be written alongside "peeled" for
869 * compatibility with older clients, but we do not require it
870 * (i.e., "peeled" is a no-op if "fully-peeled" is set).
872 static void read_packed_refs(FILE *f, struct ref_dir *dir)
874 struct ref_entry *last = NULL;
875 char refline[PATH_MAX];
876 enum { PEELED_NONE, PEELED_TAGS, PEELED_FULLY } peeled = PEELED_NONE;
878 while (fgets(refline, sizeof(refline), f)) {
879 unsigned char sha1[20];
880 const char *refname;
881 static const char header[] = "# pack-refs with:";
883 if (!strncmp(refline, header, sizeof(header)-1)) {
884 const char *traits = refline + sizeof(header) - 1;
885 if (strstr(traits, " fully-peeled "))
886 peeled = PEELED_FULLY;
887 else if (strstr(traits, " peeled "))
888 peeled = PEELED_TAGS;
889 /* perhaps other traits later as well */
890 continue;
893 refname = parse_ref_line(refline, sha1);
894 if (refname) {
895 last = create_ref_entry(refname, sha1, REF_ISPACKED, 1);
896 if (peeled == PEELED_FULLY ||
897 (peeled == PEELED_TAGS && !prefixcmp(refname, "refs/tags/")))
898 last->flag |= REF_KNOWS_PEELED;
899 add_ref(dir, last);
900 continue;
902 if (last &&
903 refline[0] == '^' &&
904 strlen(refline) == PEELED_LINE_LENGTH &&
905 refline[PEELED_LINE_LENGTH - 1] == '\n' &&
906 !get_sha1_hex(refline + 1, sha1)) {
907 hashcpy(last->u.value.peeled, sha1);
909 * Regardless of what the file header said,
910 * we definitely know the value of *this*
911 * reference:
913 last->flag |= REF_KNOWS_PEELED;
918 static struct ref_dir *get_packed_refs(struct ref_cache *refs)
920 if (!refs->packed) {
921 const char *packed_refs_file;
922 FILE *f;
924 refs->packed = create_dir_entry(refs, "", 0, 0);
925 if (*refs->name)
926 packed_refs_file = git_path_submodule(refs->name, "packed-refs");
927 else
928 packed_refs_file = git_path("packed-refs");
929 f = fopen(packed_refs_file, "r");
930 if (f) {
931 read_packed_refs(f, get_ref_dir(refs->packed));
932 fclose(f);
935 return get_ref_dir(refs->packed);
938 void add_packed_ref(const char *refname, const unsigned char *sha1)
940 add_ref(get_packed_refs(get_ref_cache(NULL)),
941 create_ref_entry(refname, sha1, REF_ISPACKED, 1));
945 * Read the loose references from the namespace dirname into dir
946 * (without recursing). dirname must end with '/'. dir must be the
947 * directory entry corresponding to dirname.
949 static void read_loose_refs(const char *dirname, struct ref_dir *dir)
951 struct ref_cache *refs = dir->ref_cache;
952 DIR *d;
953 const char *path;
954 struct dirent *de;
955 int dirnamelen = strlen(dirname);
956 struct strbuf refname;
958 if (*refs->name)
959 path = git_path_submodule(refs->name, "%s", dirname);
960 else
961 path = git_path("%s", dirname);
963 d = opendir(path);
964 if (!d)
965 return;
967 strbuf_init(&refname, dirnamelen + 257);
968 strbuf_add(&refname, dirname, dirnamelen);
970 while ((de = readdir(d)) != NULL) {
971 unsigned char sha1[20];
972 struct stat st;
973 int flag;
974 const char *refdir;
976 if (de->d_name[0] == '.')
977 continue;
978 if (has_extension(de->d_name, ".lock"))
979 continue;
980 strbuf_addstr(&refname, de->d_name);
981 refdir = *refs->name
982 ? git_path_submodule(refs->name, "%s", refname.buf)
983 : git_path("%s", refname.buf);
984 if (stat(refdir, &st) < 0) {
985 ; /* silently ignore */
986 } else if (S_ISDIR(st.st_mode)) {
987 strbuf_addch(&refname, '/');
988 add_entry_to_dir(dir,
989 create_dir_entry(refs, refname.buf,
990 refname.len, 1));
991 } else {
992 if (*refs->name) {
993 hashclr(sha1);
994 flag = 0;
995 if (resolve_gitlink_ref(refs->name, refname.buf, sha1) < 0) {
996 hashclr(sha1);
997 flag |= REF_ISBROKEN;
999 } else if (read_ref_full(refname.buf, sha1, 1, &flag)) {
1000 hashclr(sha1);
1001 flag |= REF_ISBROKEN;
1003 add_entry_to_dir(dir,
1004 create_ref_entry(refname.buf, sha1, flag, 1));
1006 strbuf_setlen(&refname, dirnamelen);
1008 strbuf_release(&refname);
1009 closedir(d);
1012 static struct ref_dir *get_loose_refs(struct ref_cache *refs)
1014 if (!refs->loose) {
1016 * Mark the top-level directory complete because we
1017 * are about to read the only subdirectory that can
1018 * hold references:
1020 refs->loose = create_dir_entry(refs, "", 0, 0);
1022 * Create an incomplete entry for "refs/":
1024 add_entry_to_dir(get_ref_dir(refs->loose),
1025 create_dir_entry(refs, "refs/", 5, 1));
1027 return get_ref_dir(refs->loose);
1030 /* We allow "recursive" symbolic refs. Only within reason, though */
1031 #define MAXDEPTH 5
1032 #define MAXREFLEN (1024)
1035 * Called by resolve_gitlink_ref_recursive() after it failed to read
1036 * from the loose refs in ref_cache refs. Find <refname> in the
1037 * packed-refs file for the submodule.
1039 static int resolve_gitlink_packed_ref(struct ref_cache *refs,
1040 const char *refname, unsigned char *sha1)
1042 struct ref_entry *ref;
1043 struct ref_dir *dir = get_packed_refs(refs);
1045 ref = find_ref(dir, refname);
1046 if (ref == NULL)
1047 return -1;
1049 memcpy(sha1, ref->u.value.sha1, 20);
1050 return 0;
1053 static int resolve_gitlink_ref_recursive(struct ref_cache *refs,
1054 const char *refname, unsigned char *sha1,
1055 int recursion)
1057 int fd, len;
1058 char buffer[128], *p;
1059 char *path;
1061 if (recursion > MAXDEPTH || strlen(refname) > MAXREFLEN)
1062 return -1;
1063 path = *refs->name
1064 ? git_path_submodule(refs->name, "%s", refname)
1065 : git_path("%s", refname);
1066 fd = open(path, O_RDONLY);
1067 if (fd < 0)
1068 return resolve_gitlink_packed_ref(refs, refname, sha1);
1070 len = read(fd, buffer, sizeof(buffer)-1);
1071 close(fd);
1072 if (len < 0)
1073 return -1;
1074 while (len && isspace(buffer[len-1]))
1075 len--;
1076 buffer[len] = 0;
1078 /* Was it a detached head or an old-fashioned symlink? */
1079 if (!get_sha1_hex(buffer, sha1))
1080 return 0;
1082 /* Symref? */
1083 if (strncmp(buffer, "ref:", 4))
1084 return -1;
1085 p = buffer + 4;
1086 while (isspace(*p))
1087 p++;
1089 return resolve_gitlink_ref_recursive(refs, p, sha1, recursion+1);
1092 int resolve_gitlink_ref(const char *path, const char *refname, unsigned char *sha1)
1094 int len = strlen(path), retval;
1095 char *submodule;
1096 struct ref_cache *refs;
1098 while (len && path[len-1] == '/')
1099 len--;
1100 if (!len)
1101 return -1;
1102 submodule = xstrndup(path, len);
1103 refs = get_ref_cache(submodule);
1104 free(submodule);
1106 retval = resolve_gitlink_ref_recursive(refs, refname, sha1, 0);
1107 return retval;
1111 * Try to read ref from the packed references. On success, set sha1
1112 * and return 0; otherwise, return -1.
1114 static int get_packed_ref(const char *refname, unsigned char *sha1)
1116 struct ref_dir *packed = get_packed_refs(get_ref_cache(NULL));
1117 struct ref_entry *entry = find_ref(packed, refname);
1118 if (entry) {
1119 hashcpy(sha1, entry->u.value.sha1);
1120 return 0;
1122 return -1;
1125 const char *resolve_ref_unsafe(const char *refname, unsigned char *sha1, int reading, int *flag)
1127 int depth = MAXDEPTH;
1128 ssize_t len;
1129 char buffer[256];
1130 static char refname_buffer[256];
1132 if (flag)
1133 *flag = 0;
1135 if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL))
1136 return NULL;
1138 for (;;) {
1139 char path[PATH_MAX];
1140 struct stat st;
1141 char *buf;
1142 int fd;
1144 if (--depth < 0)
1145 return NULL;
1147 git_snpath(path, sizeof(path), "%s", refname);
1149 if (lstat(path, &st) < 0) {
1150 if (errno != ENOENT)
1151 return NULL;
1153 * The loose reference file does not exist;
1154 * check for a packed reference.
1156 if (!get_packed_ref(refname, sha1)) {
1157 if (flag)
1158 *flag |= REF_ISPACKED;
1159 return refname;
1161 /* The reference is not a packed reference, either. */
1162 if (reading) {
1163 return NULL;
1164 } else {
1165 hashclr(sha1);
1166 return refname;
1170 /* Follow "normalized" - ie "refs/.." symlinks by hand */
1171 if (S_ISLNK(st.st_mode)) {
1172 len = readlink(path, buffer, sizeof(buffer)-1);
1173 if (len < 0)
1174 return NULL;
1175 buffer[len] = 0;
1176 if (!prefixcmp(buffer, "refs/") &&
1177 !check_refname_format(buffer, 0)) {
1178 strcpy(refname_buffer, buffer);
1179 refname = refname_buffer;
1180 if (flag)
1181 *flag |= REF_ISSYMREF;
1182 continue;
1186 /* Is it a directory? */
1187 if (S_ISDIR(st.st_mode)) {
1188 errno = EISDIR;
1189 return NULL;
1193 * Anything else, just open it and try to use it as
1194 * a ref
1196 fd = open(path, O_RDONLY);
1197 if (fd < 0)
1198 return NULL;
1199 len = read_in_full(fd, buffer, sizeof(buffer)-1);
1200 close(fd);
1201 if (len < 0)
1202 return NULL;
1203 while (len && isspace(buffer[len-1]))
1204 len--;
1205 buffer[len] = '\0';
1208 * Is it a symbolic ref?
1210 if (prefixcmp(buffer, "ref:"))
1211 break;
1212 if (flag)
1213 *flag |= REF_ISSYMREF;
1214 buf = buffer + 4;
1215 while (isspace(*buf))
1216 buf++;
1217 if (check_refname_format(buf, REFNAME_ALLOW_ONELEVEL)) {
1218 if (flag)
1219 *flag |= REF_ISBROKEN;
1220 return NULL;
1222 refname = strcpy(refname_buffer, buf);
1224 /* Please note that FETCH_HEAD has a second line containing other data. */
1225 if (get_sha1_hex(buffer, sha1) || (buffer[40] != '\0' && !isspace(buffer[40]))) {
1226 if (flag)
1227 *flag |= REF_ISBROKEN;
1228 return NULL;
1230 return refname;
1233 char *resolve_refdup(const char *ref, unsigned char *sha1, int reading, int *flag)
1235 const char *ret = resolve_ref_unsafe(ref, sha1, reading, flag);
1236 return ret ? xstrdup(ret) : NULL;
1239 /* The argument to filter_refs */
1240 struct ref_filter {
1241 const char *pattern;
1242 each_ref_fn *fn;
1243 void *cb_data;
1246 int read_ref_full(const char *refname, unsigned char *sha1, int reading, int *flags)
1248 if (resolve_ref_unsafe(refname, sha1, reading, flags))
1249 return 0;
1250 return -1;
1253 int read_ref(const char *refname, unsigned char *sha1)
1255 return read_ref_full(refname, sha1, 1, NULL);
1258 int ref_exists(const char *refname)
1260 unsigned char sha1[20];
1261 return !!resolve_ref_unsafe(refname, sha1, 1, NULL);
1264 static int filter_refs(const char *refname, const unsigned char *sha1, int flags,
1265 void *data)
1267 struct ref_filter *filter = (struct ref_filter *)data;
1268 if (fnmatch(filter->pattern, refname, 0))
1269 return 0;
1270 return filter->fn(refname, sha1, flags, filter->cb_data);
1273 int peel_ref(const char *refname, unsigned char *sha1)
1275 int flag;
1276 unsigned char base[20];
1277 struct object *o;
1279 if (current_ref && (current_ref->name == refname
1280 || !strcmp(current_ref->name, refname))) {
1281 if (current_ref->flag & REF_KNOWS_PEELED) {
1282 if (is_null_sha1(current_ref->u.value.peeled))
1283 return -1;
1284 hashcpy(sha1, current_ref->u.value.peeled);
1285 return 0;
1287 hashcpy(base, current_ref->u.value.sha1);
1288 goto fallback;
1291 if (read_ref_full(refname, base, 1, &flag))
1292 return -1;
1294 if ((flag & REF_ISPACKED)) {
1295 struct ref_dir *dir = get_packed_refs(get_ref_cache(NULL));
1296 struct ref_entry *r = find_ref(dir, refname);
1298 if (r != NULL && r->flag & REF_KNOWS_PEELED) {
1299 hashcpy(sha1, r->u.value.peeled);
1300 return 0;
1304 fallback:
1305 o = lookup_unknown_object(base);
1306 if (o->type == OBJ_NONE) {
1307 int type = sha1_object_info(base, NULL);
1308 if (type < 0)
1309 return -1;
1310 o->type = type;
1313 if (o->type == OBJ_TAG) {
1314 o = deref_tag_noverify(o);
1315 if (o) {
1316 hashcpy(sha1, o->sha1);
1317 return 0;
1320 return -1;
1323 struct warn_if_dangling_data {
1324 FILE *fp;
1325 const char *refname;
1326 const char *msg_fmt;
1329 static int warn_if_dangling_symref(const char *refname, const unsigned char *sha1,
1330 int flags, void *cb_data)
1332 struct warn_if_dangling_data *d = cb_data;
1333 const char *resolves_to;
1334 unsigned char junk[20];
1336 if (!(flags & REF_ISSYMREF))
1337 return 0;
1339 resolves_to = resolve_ref_unsafe(refname, junk, 0, NULL);
1340 if (!resolves_to || strcmp(resolves_to, d->refname))
1341 return 0;
1343 fprintf(d->fp, d->msg_fmt, refname);
1344 fputc('\n', d->fp);
1345 return 0;
1348 void warn_dangling_symref(FILE *fp, const char *msg_fmt, const char *refname)
1350 struct warn_if_dangling_data data;
1352 data.fp = fp;
1353 data.refname = refname;
1354 data.msg_fmt = msg_fmt;
1355 for_each_rawref(warn_if_dangling_symref, &data);
1359 * Call fn for each reference in the specified submodule for which the
1360 * refname begins with base. If trim is non-zero, then trim that many
1361 * characters off the beginning of each refname before passing the
1362 * refname to fn. flags can be DO_FOR_EACH_INCLUDE_BROKEN to include
1363 * broken references in the iteration. If fn ever returns a non-zero
1364 * value, stop the iteration and return that value; otherwise, return
1365 * 0.
1367 static int do_for_each_ref(const char *submodule, const char *base, each_ref_fn fn,
1368 int trim, int flags, void *cb_data)
1370 struct ref_cache *refs = get_ref_cache(submodule);
1371 struct ref_dir *packed_dir = get_packed_refs(refs);
1372 struct ref_dir *loose_dir = get_loose_refs(refs);
1373 int retval = 0;
1375 if (base && *base) {
1376 packed_dir = find_containing_dir(packed_dir, base, 0);
1377 loose_dir = find_containing_dir(loose_dir, base, 0);
1380 if (packed_dir && loose_dir) {
1381 sort_ref_dir(packed_dir);
1382 sort_ref_dir(loose_dir);
1383 retval = do_for_each_ref_in_dirs(
1384 packed_dir, loose_dir,
1385 base, fn, trim, flags, cb_data);
1386 } else if (packed_dir) {
1387 sort_ref_dir(packed_dir);
1388 retval = do_for_each_ref_in_dir(
1389 packed_dir, 0,
1390 base, fn, trim, flags, cb_data);
1391 } else if (loose_dir) {
1392 sort_ref_dir(loose_dir);
1393 retval = do_for_each_ref_in_dir(
1394 loose_dir, 0,
1395 base, fn, trim, flags, cb_data);
1398 return retval;
1401 static int do_head_ref(const char *submodule, each_ref_fn fn, void *cb_data)
1403 unsigned char sha1[20];
1404 int flag;
1406 if (submodule) {
1407 if (resolve_gitlink_ref(submodule, "HEAD", sha1) == 0)
1408 return fn("HEAD", sha1, 0, cb_data);
1410 return 0;
1413 if (!read_ref_full("HEAD", sha1, 1, &flag))
1414 return fn("HEAD", sha1, flag, cb_data);
1416 return 0;
1419 int head_ref(each_ref_fn fn, void *cb_data)
1421 return do_head_ref(NULL, fn, cb_data);
1424 int head_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
1426 return do_head_ref(submodule, fn, cb_data);
1429 int for_each_ref(each_ref_fn fn, void *cb_data)
1431 return do_for_each_ref(NULL, "", fn, 0, 0, cb_data);
1434 int for_each_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
1436 return do_for_each_ref(submodule, "", fn, 0, 0, cb_data);
1439 int for_each_ref_in(const char *prefix, each_ref_fn fn, void *cb_data)
1441 return do_for_each_ref(NULL, prefix, fn, strlen(prefix), 0, cb_data);
1444 int for_each_ref_in_submodule(const char *submodule, const char *prefix,
1445 each_ref_fn fn, void *cb_data)
1447 return do_for_each_ref(submodule, prefix, fn, strlen(prefix), 0, cb_data);
1450 int for_each_tag_ref(each_ref_fn fn, void *cb_data)
1452 return for_each_ref_in("refs/tags/", fn, cb_data);
1455 int for_each_tag_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
1457 return for_each_ref_in_submodule(submodule, "refs/tags/", fn, cb_data);
1460 int for_each_branch_ref(each_ref_fn fn, void *cb_data)
1462 return for_each_ref_in("refs/heads/", fn, cb_data);
1465 int for_each_branch_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
1467 return for_each_ref_in_submodule(submodule, "refs/heads/", fn, cb_data);
1470 int for_each_remote_ref(each_ref_fn fn, void *cb_data)
1472 return for_each_ref_in("refs/remotes/", fn, cb_data);
1475 int for_each_remote_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
1477 return for_each_ref_in_submodule(submodule, "refs/remotes/", fn, cb_data);
1480 int for_each_replace_ref(each_ref_fn fn, void *cb_data)
1482 return do_for_each_ref(NULL, "refs/replace/", fn, 13, 0, cb_data);
1485 int head_ref_namespaced(each_ref_fn fn, void *cb_data)
1487 struct strbuf buf = STRBUF_INIT;
1488 int ret = 0;
1489 unsigned char sha1[20];
1490 int flag;
1492 strbuf_addf(&buf, "%sHEAD", get_git_namespace());
1493 if (!read_ref_full(buf.buf, sha1, 1, &flag))
1494 ret = fn(buf.buf, sha1, flag, cb_data);
1495 strbuf_release(&buf);
1497 return ret;
1500 int for_each_namespaced_ref(each_ref_fn fn, void *cb_data)
1502 struct strbuf buf = STRBUF_INIT;
1503 int ret;
1504 strbuf_addf(&buf, "%srefs/", get_git_namespace());
1505 ret = do_for_each_ref(NULL, buf.buf, fn, 0, 0, cb_data);
1506 strbuf_release(&buf);
1507 return ret;
1510 int for_each_glob_ref_in(each_ref_fn fn, const char *pattern,
1511 const char *prefix, void *cb_data)
1513 struct strbuf real_pattern = STRBUF_INIT;
1514 struct ref_filter filter;
1515 int ret;
1517 if (!prefix && prefixcmp(pattern, "refs/"))
1518 strbuf_addstr(&real_pattern, "refs/");
1519 else if (prefix)
1520 strbuf_addstr(&real_pattern, prefix);
1521 strbuf_addstr(&real_pattern, pattern);
1523 if (!has_glob_specials(pattern)) {
1524 /* Append implied '/' '*' if not present. */
1525 if (real_pattern.buf[real_pattern.len - 1] != '/')
1526 strbuf_addch(&real_pattern, '/');
1527 /* No need to check for '*', there is none. */
1528 strbuf_addch(&real_pattern, '*');
1531 filter.pattern = real_pattern.buf;
1532 filter.fn = fn;
1533 filter.cb_data = cb_data;
1534 ret = for_each_ref(filter_refs, &filter);
1536 strbuf_release(&real_pattern);
1537 return ret;
1540 int for_each_glob_ref(each_ref_fn fn, const char *pattern, void *cb_data)
1542 return for_each_glob_ref_in(fn, pattern, NULL, cb_data);
1545 int for_each_rawref(each_ref_fn fn, void *cb_data)
1547 return do_for_each_ref(NULL, "", fn, 0,
1548 DO_FOR_EACH_INCLUDE_BROKEN, cb_data);
1551 const char *prettify_refname(const char *name)
1553 return name + (
1554 !prefixcmp(name, "refs/heads/") ? 11 :
1555 !prefixcmp(name, "refs/tags/") ? 10 :
1556 !prefixcmp(name, "refs/remotes/") ? 13 :
1560 const char *ref_rev_parse_rules[] = {
1561 "%.*s",
1562 "refs/%.*s",
1563 "refs/tags/%.*s",
1564 "refs/heads/%.*s",
1565 "refs/remotes/%.*s",
1566 "refs/remotes/%.*s/HEAD",
1567 NULL
1570 int refname_match(const char *abbrev_name, const char *full_name, const char **rules)
1572 const char **p;
1573 const int abbrev_name_len = strlen(abbrev_name);
1575 for (p = rules; *p; p++) {
1576 if (!strcmp(full_name, mkpath(*p, abbrev_name_len, abbrev_name))) {
1577 return 1;
1581 return 0;
1584 static struct ref_lock *verify_lock(struct ref_lock *lock,
1585 const unsigned char *old_sha1, int mustexist)
1587 if (read_ref_full(lock->ref_name, lock->old_sha1, mustexist, NULL)) {
1588 error("Can't verify ref %s", lock->ref_name);
1589 unlock_ref(lock);
1590 return NULL;
1592 if (hashcmp(lock->old_sha1, old_sha1)) {
1593 error("Ref %s is at %s but expected %s", lock->ref_name,
1594 sha1_to_hex(lock->old_sha1), sha1_to_hex(old_sha1));
1595 unlock_ref(lock);
1596 return NULL;
1598 return lock;
1601 static int remove_empty_directories(const char *file)
1603 /* we want to create a file but there is a directory there;
1604 * if that is an empty directory (or a directory that contains
1605 * only empty directories), remove them.
1607 struct strbuf path;
1608 int result;
1610 strbuf_init(&path, 20);
1611 strbuf_addstr(&path, file);
1613 result = remove_dir_recursively(&path, REMOVE_DIR_EMPTY_ONLY);
1615 strbuf_release(&path);
1617 return result;
1621 * *string and *len will only be substituted, and *string returned (for
1622 * later free()ing) if the string passed in is a magic short-hand form
1623 * to name a branch.
1625 static char *substitute_branch_name(const char **string, int *len)
1627 struct strbuf buf = STRBUF_INIT;
1628 int ret = interpret_branch_name(*string, &buf);
1630 if (ret == *len) {
1631 size_t size;
1632 *string = strbuf_detach(&buf, &size);
1633 *len = size;
1634 return (char *)*string;
1637 return NULL;
1640 int dwim_ref(const char *str, int len, unsigned char *sha1, char **ref)
1642 char *last_branch = substitute_branch_name(&str, &len);
1643 const char **p, *r;
1644 int refs_found = 0;
1646 *ref = NULL;
1647 for (p = ref_rev_parse_rules; *p; p++) {
1648 char fullref[PATH_MAX];
1649 unsigned char sha1_from_ref[20];
1650 unsigned char *this_result;
1651 int flag;
1653 this_result = refs_found ? sha1_from_ref : sha1;
1654 mksnpath(fullref, sizeof(fullref), *p, len, str);
1655 r = resolve_ref_unsafe(fullref, this_result, 1, &flag);
1656 if (r) {
1657 if (!refs_found++)
1658 *ref = xstrdup(r);
1659 if (!warn_ambiguous_refs)
1660 break;
1661 } else if ((flag & REF_ISSYMREF) && strcmp(fullref, "HEAD")) {
1662 warning("ignoring dangling symref %s.", fullref);
1663 } else if ((flag & REF_ISBROKEN) && strchr(fullref, '/')) {
1664 warning("ignoring broken ref %s.", fullref);
1667 free(last_branch);
1668 return refs_found;
1671 int dwim_log(const char *str, int len, unsigned char *sha1, char **log)
1673 char *last_branch = substitute_branch_name(&str, &len);
1674 const char **p;
1675 int logs_found = 0;
1677 *log = NULL;
1678 for (p = ref_rev_parse_rules; *p; p++) {
1679 struct stat st;
1680 unsigned char hash[20];
1681 char path[PATH_MAX];
1682 const char *ref, *it;
1684 mksnpath(path, sizeof(path), *p, len, str);
1685 ref = resolve_ref_unsafe(path, hash, 1, NULL);
1686 if (!ref)
1687 continue;
1688 if (!stat(git_path("logs/%s", path), &st) &&
1689 S_ISREG(st.st_mode))
1690 it = path;
1691 else if (strcmp(ref, path) &&
1692 !stat(git_path("logs/%s", ref), &st) &&
1693 S_ISREG(st.st_mode))
1694 it = ref;
1695 else
1696 continue;
1697 if (!logs_found++) {
1698 *log = xstrdup(it);
1699 hashcpy(sha1, hash);
1701 if (!warn_ambiguous_refs)
1702 break;
1704 free(last_branch);
1705 return logs_found;
1708 static struct ref_lock *lock_ref_sha1_basic(const char *refname,
1709 const unsigned char *old_sha1,
1710 int flags, int *type_p)
1712 char *ref_file;
1713 const char *orig_refname = refname;
1714 struct ref_lock *lock;
1715 int last_errno = 0;
1716 int type, lflags;
1717 int mustexist = (old_sha1 && !is_null_sha1(old_sha1));
1718 int missing = 0;
1720 lock = xcalloc(1, sizeof(struct ref_lock));
1721 lock->lock_fd = -1;
1723 refname = resolve_ref_unsafe(refname, lock->old_sha1, mustexist, &type);
1724 if (!refname && errno == EISDIR) {
1725 /* we are trying to lock foo but we used to
1726 * have foo/bar which now does not exist;
1727 * it is normal for the empty directory 'foo'
1728 * to remain.
1730 ref_file = git_path("%s", orig_refname);
1731 if (remove_empty_directories(ref_file)) {
1732 last_errno = errno;
1733 error("there are still refs under '%s'", orig_refname);
1734 goto error_return;
1736 refname = resolve_ref_unsafe(orig_refname, lock->old_sha1, mustexist, &type);
1738 if (type_p)
1739 *type_p = type;
1740 if (!refname) {
1741 last_errno = errno;
1742 error("unable to resolve reference %s: %s",
1743 orig_refname, strerror(errno));
1744 goto error_return;
1746 missing = is_null_sha1(lock->old_sha1);
1747 /* When the ref did not exist and we are creating it,
1748 * make sure there is no existing ref that is packed
1749 * whose name begins with our refname, nor a ref whose
1750 * name is a proper prefix of our refname.
1752 if (missing &&
1753 !is_refname_available(refname, NULL, get_packed_refs(get_ref_cache(NULL)))) {
1754 last_errno = ENOTDIR;
1755 goto error_return;
1758 lock->lk = xcalloc(1, sizeof(struct lock_file));
1760 lflags = LOCK_DIE_ON_ERROR;
1761 if (flags & REF_NODEREF) {
1762 refname = orig_refname;
1763 lflags |= LOCK_NODEREF;
1765 lock->ref_name = xstrdup(refname);
1766 lock->orig_ref_name = xstrdup(orig_refname);
1767 ref_file = git_path("%s", refname);
1768 if (missing)
1769 lock->force_write = 1;
1770 if ((flags & REF_NODEREF) && (type & REF_ISSYMREF))
1771 lock->force_write = 1;
1773 if (safe_create_leading_directories(ref_file)) {
1774 last_errno = errno;
1775 error("unable to create directory for %s", ref_file);
1776 goto error_return;
1779 lock->lock_fd = hold_lock_file_for_update(lock->lk, ref_file, lflags);
1780 return old_sha1 ? verify_lock(lock, old_sha1, mustexist) : lock;
1782 error_return:
1783 unlock_ref(lock);
1784 errno = last_errno;
1785 return NULL;
1788 struct ref_lock *lock_ref_sha1(const char *refname, const unsigned char *old_sha1)
1790 char refpath[PATH_MAX];
1791 if (check_refname_format(refname, 0))
1792 return NULL;
1793 strcpy(refpath, mkpath("refs/%s", refname));
1794 return lock_ref_sha1_basic(refpath, old_sha1, 0, NULL);
1797 struct ref_lock *lock_any_ref_for_update(const char *refname,
1798 const unsigned char *old_sha1, int flags)
1800 if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL))
1801 return NULL;
1802 return lock_ref_sha1_basic(refname, old_sha1, flags, NULL);
1805 struct repack_without_ref_sb {
1806 const char *refname;
1807 int fd;
1810 static int repack_without_ref_fn(const char *refname, const unsigned char *sha1,
1811 int flags, void *cb_data)
1813 struct repack_without_ref_sb *data = cb_data;
1814 char line[PATH_MAX + 100];
1815 int len;
1817 if (!strcmp(data->refname, refname))
1818 return 0;
1819 len = snprintf(line, sizeof(line), "%s %s\n",
1820 sha1_to_hex(sha1), refname);
1821 /* this should not happen but just being defensive */
1822 if (len > sizeof(line))
1823 die("too long a refname '%s'", refname);
1824 write_or_die(data->fd, line, len);
1825 return 0;
1828 static struct lock_file packlock;
1830 static int repack_without_ref(const char *refname)
1832 struct repack_without_ref_sb data;
1833 struct ref_cache *refs = get_ref_cache(NULL);
1834 struct ref_dir *packed = get_packed_refs(refs);
1835 if (find_ref(packed, refname) == NULL)
1836 return 0;
1837 data.refname = refname;
1838 data.fd = hold_lock_file_for_update(&packlock, git_path("packed-refs"), 0);
1839 if (data.fd < 0) {
1840 unable_to_lock_error(git_path("packed-refs"), errno);
1841 return error("cannot delete '%s' from packed refs", refname);
1843 clear_packed_ref_cache(refs);
1844 packed = get_packed_refs(refs);
1845 do_for_each_ref_in_dir(packed, 0, "", repack_without_ref_fn, 0, 0, &data);
1846 return commit_lock_file(&packlock);
1849 int delete_ref(const char *refname, const unsigned char *sha1, int delopt)
1851 struct ref_lock *lock;
1852 int err, i = 0, ret = 0, flag = 0;
1854 lock = lock_ref_sha1_basic(refname, sha1, delopt, &flag);
1855 if (!lock)
1856 return 1;
1857 if (!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) {
1858 /* loose */
1859 i = strlen(lock->lk->filename) - 5; /* .lock */
1860 lock->lk->filename[i] = 0;
1861 err = unlink_or_warn(lock->lk->filename);
1862 if (err && errno != ENOENT)
1863 ret = 1;
1865 lock->lk->filename[i] = '.';
1867 /* removing the loose one could have resurrected an earlier
1868 * packed one. Also, if it was not loose we need to repack
1869 * without it.
1871 ret |= repack_without_ref(lock->ref_name);
1873 unlink_or_warn(git_path("logs/%s", lock->ref_name));
1874 invalidate_ref_cache(NULL);
1875 unlock_ref(lock);
1876 return ret;
1880 * People using contrib's git-new-workdir have .git/logs/refs ->
1881 * /some/other/path/.git/logs/refs, and that may live on another device.
1883 * IOW, to avoid cross device rename errors, the temporary renamed log must
1884 * live into logs/refs.
1886 #define TMP_RENAMED_LOG "logs/refs/.tmp-renamed-log"
1888 int rename_ref(const char *oldrefname, const char *newrefname, const char *logmsg)
1890 unsigned char sha1[20], orig_sha1[20];
1891 int flag = 0, logmoved = 0;
1892 struct ref_lock *lock;
1893 struct stat loginfo;
1894 int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);
1895 const char *symref = NULL;
1896 struct ref_cache *refs = get_ref_cache(NULL);
1898 if (log && S_ISLNK(loginfo.st_mode))
1899 return error("reflog for %s is a symlink", oldrefname);
1901 symref = resolve_ref_unsafe(oldrefname, orig_sha1, 1, &flag);
1902 if (flag & REF_ISSYMREF)
1903 return error("refname %s is a symbolic ref, renaming it is not supported",
1904 oldrefname);
1905 if (!symref)
1906 return error("refname %s not found", oldrefname);
1908 if (!is_refname_available(newrefname, oldrefname, get_packed_refs(refs)))
1909 return 1;
1911 if (!is_refname_available(newrefname, oldrefname, get_loose_refs(refs)))
1912 return 1;
1914 if (log && rename(git_path("logs/%s", oldrefname), git_path(TMP_RENAMED_LOG)))
1915 return error("unable to move logfile logs/%s to "TMP_RENAMED_LOG": %s",
1916 oldrefname, strerror(errno));
1918 if (delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {
1919 error("unable to delete old %s", oldrefname);
1920 goto rollback;
1923 if (!read_ref_full(newrefname, sha1, 1, &flag) &&
1924 delete_ref(newrefname, sha1, REF_NODEREF)) {
1925 if (errno==EISDIR) {
1926 if (remove_empty_directories(git_path("%s", newrefname))) {
1927 error("Directory not empty: %s", newrefname);
1928 goto rollback;
1930 } else {
1931 error("unable to delete existing %s", newrefname);
1932 goto rollback;
1936 if (log && safe_create_leading_directories(git_path("logs/%s", newrefname))) {
1937 error("unable to create directory for %s", newrefname);
1938 goto rollback;
1941 retry:
1942 if (log && rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", newrefname))) {
1943 if (errno==EISDIR || errno==ENOTDIR) {
1945 * rename(a, b) when b is an existing
1946 * directory ought to result in ISDIR, but
1947 * Solaris 5.8 gives ENOTDIR. Sheesh.
1949 if (remove_empty_directories(git_path("logs/%s", newrefname))) {
1950 error("Directory not empty: logs/%s", newrefname);
1951 goto rollback;
1953 goto retry;
1954 } else {
1955 error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s: %s",
1956 newrefname, strerror(errno));
1957 goto rollback;
1960 logmoved = log;
1962 lock = lock_ref_sha1_basic(newrefname, NULL, 0, NULL);
1963 if (!lock) {
1964 error("unable to lock %s for update", newrefname);
1965 goto rollback;
1967 lock->force_write = 1;
1968 hashcpy(lock->old_sha1, orig_sha1);
1969 if (write_ref_sha1(lock, orig_sha1, logmsg)) {
1970 error("unable to write current sha1 into %s", newrefname);
1971 goto rollback;
1974 return 0;
1976 rollback:
1977 lock = lock_ref_sha1_basic(oldrefname, NULL, 0, NULL);
1978 if (!lock) {
1979 error("unable to lock %s for rollback", oldrefname);
1980 goto rollbacklog;
1983 lock->force_write = 1;
1984 flag = log_all_ref_updates;
1985 log_all_ref_updates = 0;
1986 if (write_ref_sha1(lock, orig_sha1, NULL))
1987 error("unable to write current sha1 into %s", oldrefname);
1988 log_all_ref_updates = flag;
1990 rollbacklog:
1991 if (logmoved && rename(git_path("logs/%s", newrefname), git_path("logs/%s", oldrefname)))
1992 error("unable to restore logfile %s from %s: %s",
1993 oldrefname, newrefname, strerror(errno));
1994 if (!logmoved && log &&
1995 rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", oldrefname)))
1996 error("unable to restore logfile %s from "TMP_RENAMED_LOG": %s",
1997 oldrefname, strerror(errno));
1999 return 1;
2002 int close_ref(struct ref_lock *lock)
2004 if (close_lock_file(lock->lk))
2005 return -1;
2006 lock->lock_fd = -1;
2007 return 0;
2010 int commit_ref(struct ref_lock *lock)
2012 if (commit_lock_file(lock->lk))
2013 return -1;
2014 lock->lock_fd = -1;
2015 return 0;
2018 void unlock_ref(struct ref_lock *lock)
2020 /* Do not free lock->lk -- atexit() still looks at them */
2021 if (lock->lk)
2022 rollback_lock_file(lock->lk);
2023 free(lock->ref_name);
2024 free(lock->orig_ref_name);
2025 free(lock);
2029 * copy the reflog message msg to buf, which has been allocated sufficiently
2030 * large, while cleaning up the whitespaces. Especially, convert LF to space,
2031 * because reflog file is one line per entry.
2033 static int copy_msg(char *buf, const char *msg)
2035 char *cp = buf;
2036 char c;
2037 int wasspace = 1;
2039 *cp++ = '\t';
2040 while ((c = *msg++)) {
2041 if (wasspace && isspace(c))
2042 continue;
2043 wasspace = isspace(c);
2044 if (wasspace)
2045 c = ' ';
2046 *cp++ = c;
2048 while (buf < cp && isspace(cp[-1]))
2049 cp--;
2050 *cp++ = '\n';
2051 return cp - buf;
2054 int log_ref_setup(const char *refname, char *logfile, int bufsize)
2056 int logfd, oflags = O_APPEND | O_WRONLY;
2058 git_snpath(logfile, bufsize, "logs/%s", refname);
2059 if (log_all_ref_updates &&
2060 (!prefixcmp(refname, "refs/heads/") ||
2061 !prefixcmp(refname, "refs/remotes/") ||
2062 !prefixcmp(refname, "refs/notes/") ||
2063 !strcmp(refname, "HEAD"))) {
2064 if (safe_create_leading_directories(logfile) < 0)
2065 return error("unable to create directory for %s",
2066 logfile);
2067 oflags |= O_CREAT;
2070 logfd = open(logfile, oflags, 0666);
2071 if (logfd < 0) {
2072 if (!(oflags & O_CREAT) && errno == ENOENT)
2073 return 0;
2075 if ((oflags & O_CREAT) && errno == EISDIR) {
2076 if (remove_empty_directories(logfile)) {
2077 return error("There are still logs under '%s'",
2078 logfile);
2080 logfd = open(logfile, oflags, 0666);
2083 if (logfd < 0)
2084 return error("Unable to append to %s: %s",
2085 logfile, strerror(errno));
2088 adjust_shared_perm(logfile);
2089 close(logfd);
2090 return 0;
2093 static int log_ref_write(const char *refname, const unsigned char *old_sha1,
2094 const unsigned char *new_sha1, const char *msg)
2096 int logfd, result, written, oflags = O_APPEND | O_WRONLY;
2097 unsigned maxlen, len;
2098 int msglen;
2099 char log_file[PATH_MAX];
2100 char *logrec;
2101 const char *committer;
2103 if (log_all_ref_updates < 0)
2104 log_all_ref_updates = !is_bare_repository();
2106 result = log_ref_setup(refname, log_file, sizeof(log_file));
2107 if (result)
2108 return result;
2110 logfd = open(log_file, oflags);
2111 if (logfd < 0)
2112 return 0;
2113 msglen = msg ? strlen(msg) : 0;
2114 committer = git_committer_info(0);
2115 maxlen = strlen(committer) + msglen + 100;
2116 logrec = xmalloc(maxlen);
2117 len = sprintf(logrec, "%s %s %s\n",
2118 sha1_to_hex(old_sha1),
2119 sha1_to_hex(new_sha1),
2120 committer);
2121 if (msglen)
2122 len += copy_msg(logrec + len - 1, msg) - 1;
2123 written = len <= maxlen ? write_in_full(logfd, logrec, len) : -1;
2124 free(logrec);
2125 if (close(logfd) != 0 || written != len)
2126 return error("Unable to append to %s", log_file);
2127 return 0;
2130 static int is_branch(const char *refname)
2132 return !strcmp(refname, "HEAD") || !prefixcmp(refname, "refs/heads/");
2135 int write_ref_sha1(struct ref_lock *lock,
2136 const unsigned char *sha1, const char *logmsg)
2138 static char term = '\n';
2139 struct object *o;
2141 if (!lock)
2142 return -1;
2143 if (!lock->force_write && !hashcmp(lock->old_sha1, sha1)) {
2144 unlock_ref(lock);
2145 return 0;
2147 o = parse_object(sha1);
2148 if (!o) {
2149 error("Trying to write ref %s with nonexistent object %s",
2150 lock->ref_name, sha1_to_hex(sha1));
2151 unlock_ref(lock);
2152 return -1;
2154 if (o->type != OBJ_COMMIT && is_branch(lock->ref_name)) {
2155 error("Trying to write non-commit object %s to branch %s",
2156 sha1_to_hex(sha1), lock->ref_name);
2157 unlock_ref(lock);
2158 return -1;
2160 if (write_in_full(lock->lock_fd, sha1_to_hex(sha1), 40) != 40 ||
2161 write_in_full(lock->lock_fd, &term, 1) != 1
2162 || close_ref(lock) < 0) {
2163 error("Couldn't write %s", lock->lk->filename);
2164 unlock_ref(lock);
2165 return -1;
2167 clear_loose_ref_cache(get_ref_cache(NULL));
2168 if (log_ref_write(lock->ref_name, lock->old_sha1, sha1, logmsg) < 0 ||
2169 (strcmp(lock->ref_name, lock->orig_ref_name) &&
2170 log_ref_write(lock->orig_ref_name, lock->old_sha1, sha1, logmsg) < 0)) {
2171 unlock_ref(lock);
2172 return -1;
2174 if (strcmp(lock->orig_ref_name, "HEAD") != 0) {
2176 * Special hack: If a branch is updated directly and HEAD
2177 * points to it (may happen on the remote side of a push
2178 * for example) then logically the HEAD reflog should be
2179 * updated too.
2180 * A generic solution implies reverse symref information,
2181 * but finding all symrefs pointing to the given branch
2182 * would be rather costly for this rare event (the direct
2183 * update of a branch) to be worth it. So let's cheat and
2184 * check with HEAD only which should cover 99% of all usage
2185 * scenarios (even 100% of the default ones).
2187 unsigned char head_sha1[20];
2188 int head_flag;
2189 const char *head_ref;
2190 head_ref = resolve_ref_unsafe("HEAD", head_sha1, 1, &head_flag);
2191 if (head_ref && (head_flag & REF_ISSYMREF) &&
2192 !strcmp(head_ref, lock->ref_name))
2193 log_ref_write("HEAD", lock->old_sha1, sha1, logmsg);
2195 if (commit_ref(lock)) {
2196 error("Couldn't set %s", lock->ref_name);
2197 unlock_ref(lock);
2198 return -1;
2200 unlock_ref(lock);
2201 return 0;
2204 int create_symref(const char *ref_target, const char *refs_heads_master,
2205 const char *logmsg)
2207 const char *lockpath;
2208 char ref[1000];
2209 int fd, len, written;
2210 char *git_HEAD = git_pathdup("%s", ref_target);
2211 unsigned char old_sha1[20], new_sha1[20];
2213 if (logmsg && read_ref(ref_target, old_sha1))
2214 hashclr(old_sha1);
2216 if (safe_create_leading_directories(git_HEAD) < 0)
2217 return error("unable to create directory for %s", git_HEAD);
2219 #ifndef NO_SYMLINK_HEAD
2220 if (prefer_symlink_refs) {
2221 unlink(git_HEAD);
2222 if (!symlink(refs_heads_master, git_HEAD))
2223 goto done;
2224 fprintf(stderr, "no symlink - falling back to symbolic ref\n");
2226 #endif
2228 len = snprintf(ref, sizeof(ref), "ref: %s\n", refs_heads_master);
2229 if (sizeof(ref) <= len) {
2230 error("refname too long: %s", refs_heads_master);
2231 goto error_free_return;
2233 lockpath = mkpath("%s.lock", git_HEAD);
2234 fd = open(lockpath, O_CREAT | O_EXCL | O_WRONLY, 0666);
2235 if (fd < 0) {
2236 error("Unable to open %s for writing", lockpath);
2237 goto error_free_return;
2239 written = write_in_full(fd, ref, len);
2240 if (close(fd) != 0 || written != len) {
2241 error("Unable to write to %s", lockpath);
2242 goto error_unlink_return;
2244 if (rename(lockpath, git_HEAD) < 0) {
2245 error("Unable to create %s", git_HEAD);
2246 goto error_unlink_return;
2248 if (adjust_shared_perm(git_HEAD)) {
2249 error("Unable to fix permissions on %s", lockpath);
2250 error_unlink_return:
2251 unlink_or_warn(lockpath);
2252 error_free_return:
2253 free(git_HEAD);
2254 return -1;
2257 #ifndef NO_SYMLINK_HEAD
2258 done:
2259 #endif
2260 if (logmsg && !read_ref(refs_heads_master, new_sha1))
2261 log_ref_write(ref_target, old_sha1, new_sha1, logmsg);
2263 free(git_HEAD);
2264 return 0;
2267 static char *ref_msg(const char *line, const char *endp)
2269 const char *ep;
2270 line += 82;
2271 ep = memchr(line, '\n', endp - line);
2272 if (!ep)
2273 ep = endp;
2274 return xmemdupz(line, ep - line);
2277 int read_ref_at(const char *refname, unsigned long at_time, int cnt,
2278 unsigned char *sha1, char **msg,
2279 unsigned long *cutoff_time, int *cutoff_tz, int *cutoff_cnt)
2281 const char *logfile, *logdata, *logend, *rec, *lastgt, *lastrec;
2282 char *tz_c;
2283 int logfd, tz, reccnt = 0;
2284 struct stat st;
2285 unsigned long date;
2286 unsigned char logged_sha1[20];
2287 void *log_mapped;
2288 size_t mapsz;
2290 logfile = git_path("logs/%s", refname);
2291 logfd = open(logfile, O_RDONLY, 0);
2292 if (logfd < 0)
2293 die_errno("Unable to read log '%s'", logfile);
2294 fstat(logfd, &st);
2295 if (!st.st_size)
2296 die("Log %s is empty.", logfile);
2297 mapsz = xsize_t(st.st_size);
2298 log_mapped = xmmap(NULL, mapsz, PROT_READ, MAP_PRIVATE, logfd, 0);
2299 logdata = log_mapped;
2300 close(logfd);
2302 lastrec = NULL;
2303 rec = logend = logdata + st.st_size;
2304 while (logdata < rec) {
2305 reccnt++;
2306 if (logdata < rec && *(rec-1) == '\n')
2307 rec--;
2308 lastgt = NULL;
2309 while (logdata < rec && *(rec-1) != '\n') {
2310 rec--;
2311 if (*rec == '>')
2312 lastgt = rec;
2314 if (!lastgt)
2315 die("Log %s is corrupt.", logfile);
2316 date = strtoul(lastgt + 1, &tz_c, 10);
2317 if (date <= at_time || cnt == 0) {
2318 tz = strtoul(tz_c, NULL, 10);
2319 if (msg)
2320 *msg = ref_msg(rec, logend);
2321 if (cutoff_time)
2322 *cutoff_time = date;
2323 if (cutoff_tz)
2324 *cutoff_tz = tz;
2325 if (cutoff_cnt)
2326 *cutoff_cnt = reccnt - 1;
2327 if (lastrec) {
2328 if (get_sha1_hex(lastrec, logged_sha1))
2329 die("Log %s is corrupt.", logfile);
2330 if (get_sha1_hex(rec + 41, sha1))
2331 die("Log %s is corrupt.", logfile);
2332 if (hashcmp(logged_sha1, sha1)) {
2333 warning("Log %s has gap after %s.",
2334 logfile, show_date(date, tz, DATE_RFC2822));
2337 else if (date == at_time) {
2338 if (get_sha1_hex(rec + 41, sha1))
2339 die("Log %s is corrupt.", logfile);
2341 else {
2342 if (get_sha1_hex(rec + 41, logged_sha1))
2343 die("Log %s is corrupt.", logfile);
2344 if (hashcmp(logged_sha1, sha1)) {
2345 warning("Log %s unexpectedly ended on %s.",
2346 logfile, show_date(date, tz, DATE_RFC2822));
2349 munmap(log_mapped, mapsz);
2350 return 0;
2352 lastrec = rec;
2353 if (cnt > 0)
2354 cnt--;
2357 rec = logdata;
2358 while (rec < logend && *rec != '>' && *rec != '\n')
2359 rec++;
2360 if (rec == logend || *rec == '\n')
2361 die("Log %s is corrupt.", logfile);
2362 date = strtoul(rec + 1, &tz_c, 10);
2363 tz = strtoul(tz_c, NULL, 10);
2364 if (get_sha1_hex(logdata, sha1))
2365 die("Log %s is corrupt.", logfile);
2366 if (is_null_sha1(sha1)) {
2367 if (get_sha1_hex(logdata + 41, sha1))
2368 die("Log %s is corrupt.", logfile);
2370 if (msg)
2371 *msg = ref_msg(logdata, logend);
2372 munmap(log_mapped, mapsz);
2374 if (cutoff_time)
2375 *cutoff_time = date;
2376 if (cutoff_tz)
2377 *cutoff_tz = tz;
2378 if (cutoff_cnt)
2379 *cutoff_cnt = reccnt;
2380 return 1;
2383 int for_each_recent_reflog_ent(const char *refname, each_reflog_ent_fn fn, long ofs, void *cb_data)
2385 const char *logfile;
2386 FILE *logfp;
2387 struct strbuf sb = STRBUF_INIT;
2388 int ret = 0;
2390 logfile = git_path("logs/%s", refname);
2391 logfp = fopen(logfile, "r");
2392 if (!logfp)
2393 return -1;
2395 if (ofs) {
2396 struct stat statbuf;
2397 if (fstat(fileno(logfp), &statbuf) ||
2398 statbuf.st_size < ofs ||
2399 fseek(logfp, -ofs, SEEK_END) ||
2400 strbuf_getwholeline(&sb, logfp, '\n')) {
2401 fclose(logfp);
2402 strbuf_release(&sb);
2403 return -1;
2407 while (!strbuf_getwholeline(&sb, logfp, '\n')) {
2408 unsigned char osha1[20], nsha1[20];
2409 char *email_end, *message;
2410 unsigned long timestamp;
2411 int tz;
2413 /* old SP new SP name <email> SP time TAB msg LF */
2414 if (sb.len < 83 || sb.buf[sb.len - 1] != '\n' ||
2415 get_sha1_hex(sb.buf, osha1) || sb.buf[40] != ' ' ||
2416 get_sha1_hex(sb.buf + 41, nsha1) || sb.buf[81] != ' ' ||
2417 !(email_end = strchr(sb.buf + 82, '>')) ||
2418 email_end[1] != ' ' ||
2419 !(timestamp = strtoul(email_end + 2, &message, 10)) ||
2420 !message || message[0] != ' ' ||
2421 (message[1] != '+' && message[1] != '-') ||
2422 !isdigit(message[2]) || !isdigit(message[3]) ||
2423 !isdigit(message[4]) || !isdigit(message[5]))
2424 continue; /* corrupt? */
2425 email_end[1] = '\0';
2426 tz = strtol(message + 1, NULL, 10);
2427 if (message[6] != '\t')
2428 message += 6;
2429 else
2430 message += 7;
2431 ret = fn(osha1, nsha1, sb.buf + 82, timestamp, tz, message,
2432 cb_data);
2433 if (ret)
2434 break;
2436 fclose(logfp);
2437 strbuf_release(&sb);
2438 return ret;
2441 int for_each_reflog_ent(const char *refname, each_reflog_ent_fn fn, void *cb_data)
2443 return for_each_recent_reflog_ent(refname, fn, 0, cb_data);
2447 * Call fn for each reflog in the namespace indicated by name. name
2448 * must be empty or end with '/'. Name will be used as a scratch
2449 * space, but its contents will be restored before return.
2451 static int do_for_each_reflog(struct strbuf *name, each_ref_fn fn, void *cb_data)
2453 DIR *d = opendir(git_path("logs/%s", name->buf));
2454 int retval = 0;
2455 struct dirent *de;
2456 int oldlen = name->len;
2458 if (!d)
2459 return name->len ? errno : 0;
2461 while ((de = readdir(d)) != NULL) {
2462 struct stat st;
2464 if (de->d_name[0] == '.')
2465 continue;
2466 if (has_extension(de->d_name, ".lock"))
2467 continue;
2468 strbuf_addstr(name, de->d_name);
2469 if (stat(git_path("logs/%s", name->buf), &st) < 0) {
2470 ; /* silently ignore */
2471 } else {
2472 if (S_ISDIR(st.st_mode)) {
2473 strbuf_addch(name, '/');
2474 retval = do_for_each_reflog(name, fn, cb_data);
2475 } else {
2476 unsigned char sha1[20];
2477 if (read_ref_full(name->buf, sha1, 0, NULL))
2478 retval = error("bad ref for %s", name->buf);
2479 else
2480 retval = fn(name->buf, sha1, 0, cb_data);
2482 if (retval)
2483 break;
2485 strbuf_setlen(name, oldlen);
2487 closedir(d);
2488 return retval;
2491 int for_each_reflog(each_ref_fn fn, void *cb_data)
2493 int retval;
2494 struct strbuf name;
2495 strbuf_init(&name, PATH_MAX);
2496 retval = do_for_each_reflog(&name, fn, cb_data);
2497 strbuf_release(&name);
2498 return retval;
2501 int update_ref(const char *action, const char *refname,
2502 const unsigned char *sha1, const unsigned char *oldval,
2503 int flags, enum action_on_err onerr)
2505 static struct ref_lock *lock;
2506 lock = lock_any_ref_for_update(refname, oldval, flags);
2507 if (!lock) {
2508 const char *str = "Cannot lock 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 if (write_ref_sha1(lock, sha1, action) < 0) {
2517 const char *str = "Cannot update the ref '%s'.";
2518 switch (onerr) {
2519 case MSG_ON_ERR: error(str, refname); break;
2520 case DIE_ON_ERR: die(str, refname); break;
2521 case QUIET_ON_ERR: break;
2523 return 1;
2525 return 0;
2528 struct ref *find_ref_by_name(const struct ref *list, const char *name)
2530 for ( ; list; list = list->next)
2531 if (!strcmp(list->name, name))
2532 return (struct ref *)list;
2533 return NULL;
2537 * generate a format suitable for scanf from a ref_rev_parse_rules
2538 * rule, that is replace the "%.*s" spec with a "%s" spec
2540 static void gen_scanf_fmt(char *scanf_fmt, const char *rule)
2542 char *spec;
2544 spec = strstr(rule, "%.*s");
2545 if (!spec || strstr(spec + 4, "%.*s"))
2546 die("invalid rule in ref_rev_parse_rules: %s", rule);
2548 /* copy all until spec */
2549 strncpy(scanf_fmt, rule, spec - rule);
2550 scanf_fmt[spec - rule] = '\0';
2551 /* copy new spec */
2552 strcat(scanf_fmt, "%s");
2553 /* copy remaining rule */
2554 strcat(scanf_fmt, spec + 4);
2556 return;
2559 char *shorten_unambiguous_ref(const char *refname, int strict)
2561 int i;
2562 static char **scanf_fmts;
2563 static int nr_rules;
2564 char *short_name;
2566 /* pre generate scanf formats from ref_rev_parse_rules[] */
2567 if (!nr_rules) {
2568 size_t total_len = 0;
2570 /* the rule list is NULL terminated, count them first */
2571 for (; ref_rev_parse_rules[nr_rules]; nr_rules++)
2572 /* no +1 because strlen("%s") < strlen("%.*s") */
2573 total_len += strlen(ref_rev_parse_rules[nr_rules]);
2575 scanf_fmts = xmalloc(nr_rules * sizeof(char *) + total_len);
2577 total_len = 0;
2578 for (i = 0; i < nr_rules; i++) {
2579 scanf_fmts[i] = (char *)&scanf_fmts[nr_rules]
2580 + total_len;
2581 gen_scanf_fmt(scanf_fmts[i], ref_rev_parse_rules[i]);
2582 total_len += strlen(ref_rev_parse_rules[i]);
2586 /* bail out if there are no rules */
2587 if (!nr_rules)
2588 return xstrdup(refname);
2590 /* buffer for scanf result, at most refname must fit */
2591 short_name = xstrdup(refname);
2593 /* skip first rule, it will always match */
2594 for (i = nr_rules - 1; i > 0 ; --i) {
2595 int j;
2596 int rules_to_fail = i;
2597 int short_name_len;
2599 if (1 != sscanf(refname, scanf_fmts[i], short_name))
2600 continue;
2602 short_name_len = strlen(short_name);
2605 * in strict mode, all (except the matched one) rules
2606 * must fail to resolve to a valid non-ambiguous ref
2608 if (strict)
2609 rules_to_fail = nr_rules;
2612 * check if the short name resolves to a valid ref,
2613 * but use only rules prior to the matched one
2615 for (j = 0; j < rules_to_fail; j++) {
2616 const char *rule = ref_rev_parse_rules[j];
2617 char refname[PATH_MAX];
2619 /* skip matched rule */
2620 if (i == j)
2621 continue;
2624 * the short name is ambiguous, if it resolves
2625 * (with this previous rule) to a valid ref
2626 * read_ref() returns 0 on success
2628 mksnpath(refname, sizeof(refname),
2629 rule, short_name_len, short_name);
2630 if (ref_exists(refname))
2631 break;
2635 * short name is non-ambiguous if all previous rules
2636 * haven't resolved to a valid ref
2638 if (j == rules_to_fail)
2639 return short_name;
2642 free(short_name);
2643 return xstrdup(refname);