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
== '\\')
25 /* 2.13 Pattern Matching Notation */
26 if (ch
== '*' || ch
== '?' || ch
== '[') /* Unsupported */
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
36 static int check_refname_component(const char *refname
, int flags
)
41 for (cp
= refname
; ; cp
++) {
43 if (ch
== '\0' || 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 "@{". */
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". */
70 int check_refname_format(const char *refname
, int flags
)
72 int component_len
, component_count
= 0;
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
) &&
80 (refname
[1] == '\0' || refname
[1] == '/')) {
81 /* Accept one wildcard as a full refname component. */
82 flags
&= ~REFNAME_REFSPEC_PATTERN
;
89 if (refname
[component_len
] == '\0')
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. */
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.
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
124 unsigned char peeled
[20];
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
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().
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.
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
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 */
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
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
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
234 unsigned char flag
; /* ISSYMREF? ISPACKED? */
236 struct ref_value value
; /* if not (flags&REF_DIR) */
237 struct ref_dir subdir
; /* if (flags&REF_DIR) */
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
)
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
;
261 static struct ref_entry
*create_ref_entry(const char *refname
,
262 const unsigned char *sha1
, int flag
,
266 struct ref_entry
*ref
;
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
);
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
);
295 * Add a ref_entry to the end of dir (unsorted). Entry is always
296 * stored directly in dir; no recursion into subdirectories is
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 */
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
)
317 for (i
= 0; i
< dir
->nr
; i
++)
318 free_ref_entry(dir
->entries
[i
]);
320 dir
->sorted
= dir
->nr
= dir
->alloc
= 0;
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
,
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);
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
{
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
);
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
)
385 r
= bsearch(&key
, dir
->entries
, dir
->nr
, sizeof(*dir
->entries
),
386 ref_entry_cmp_sslice
);
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
,
405 struct ref_entry
*entry
= search_ref_dir(dir
, subdirname
, len
);
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
)
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
);
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);
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);
473 add_entry_to_dir(dir
, ref
);
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
482 static int is_dup_ref(const struct ref_entry
*ref1
, const struct ref_entry
*ref2
)
484 if (strcmp(ref1
->name
, ref2
->name
))
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
);
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
)
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
)
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
);
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 * Return true iff the reference described by entry can be resolved to
534 * an object in the database. Emit a warning if the referred-to
535 * object does not exist.
537 static int ref_resolves_to_object(struct ref_entry
*entry
)
539 if (entry
->flag
& REF_ISBROKEN
)
541 if (!has_sha1_file(entry
->u
.value
.sha1
)) {
542 error("%s does not point to a valid object!", entry
->name
);
549 * current_ref is a performance hack: when iterating over references
550 * using the for_each_ref*() functions, current_ref is set to the
551 * current reference's entry before calling the callback function. If
552 * the callback function calls peel_ref(), then peel_ref() first
553 * checks whether the reference to be peeled is the current reference
554 * (it usually is) and if so, returns that reference's peeled version
555 * if it is available. This avoids a refname lookup in a common case.
557 static struct ref_entry
*current_ref
;
560 * Handle one reference in a do_for_each_ref*()-style iteration.
562 static int do_one_ref(const char *base
, each_ref_fn fn
, int trim
,
563 int flags
, void *cb_data
, struct ref_entry
*entry
)
566 if (prefixcmp(entry
->name
, base
))
569 if (!(flags
& DO_FOR_EACH_INCLUDE_BROKEN
) &&
570 !ref_resolves_to_object(entry
))
574 retval
= fn(entry
->name
+ trim
, entry
->u
.value
.sha1
, entry
->flag
, cb_data
);
580 * Call fn for each reference in dir that has index in the range
581 * offset <= index < dir->nr. Recurse into subdirectories that are in
582 * that index range, sorting them before iterating. This function
583 * does not sort dir itself; it should be sorted beforehand.
585 static int do_for_each_ref_in_dir(struct ref_dir
*dir
, int offset
,
587 each_ref_fn fn
, int trim
, int flags
, void *cb_data
)
590 assert(dir
->sorted
== dir
->nr
);
591 for (i
= offset
; i
< dir
->nr
; i
++) {
592 struct ref_entry
*entry
= dir
->entries
[i
];
594 if (entry
->flag
& REF_DIR
) {
595 struct ref_dir
*subdir
= get_ref_dir(entry
);
596 sort_ref_dir(subdir
);
597 retval
= do_for_each_ref_in_dir(subdir
, 0,
598 base
, fn
, trim
, flags
, cb_data
);
600 retval
= do_one_ref(base
, fn
, trim
, flags
, cb_data
, entry
);
609 * Call fn for each reference in the union of dir1 and dir2, in order
610 * by refname. Recurse into subdirectories. If a value entry appears
611 * in both dir1 and dir2, then only process the version that is in
612 * dir2. The input dirs must already be sorted, but subdirs will be
615 static int do_for_each_ref_in_dirs(struct ref_dir
*dir1
,
616 struct ref_dir
*dir2
,
617 const char *base
, each_ref_fn fn
, int trim
,
618 int flags
, void *cb_data
)
623 assert(dir1
->sorted
== dir1
->nr
);
624 assert(dir2
->sorted
== dir2
->nr
);
626 struct ref_entry
*e1
, *e2
;
628 if (i1
== dir1
->nr
) {
629 return do_for_each_ref_in_dir(dir2
, i2
,
630 base
, fn
, trim
, flags
, cb_data
);
632 if (i2
== dir2
->nr
) {
633 return do_for_each_ref_in_dir(dir1
, i1
,
634 base
, fn
, trim
, flags
, cb_data
);
636 e1
= dir1
->entries
[i1
];
637 e2
= dir2
->entries
[i2
];
638 cmp
= strcmp(e1
->name
, e2
->name
);
640 if ((e1
->flag
& REF_DIR
) && (e2
->flag
& REF_DIR
)) {
641 /* Both are directories; descend them in parallel. */
642 struct ref_dir
*subdir1
= get_ref_dir(e1
);
643 struct ref_dir
*subdir2
= get_ref_dir(e2
);
644 sort_ref_dir(subdir1
);
645 sort_ref_dir(subdir2
);
646 retval
= do_for_each_ref_in_dirs(
648 base
, fn
, trim
, flags
, cb_data
);
651 } else if (!(e1
->flag
& REF_DIR
) && !(e2
->flag
& REF_DIR
)) {
652 /* Both are references; ignore the one from dir1. */
653 retval
= do_one_ref(base
, fn
, trim
, flags
, cb_data
, e2
);
657 die("conflict between reference and directory: %s",
669 if (e
->flag
& REF_DIR
) {
670 struct ref_dir
*subdir
= get_ref_dir(e
);
671 sort_ref_dir(subdir
);
672 retval
= do_for_each_ref_in_dir(
674 base
, fn
, trim
, flags
, cb_data
);
676 retval
= do_one_ref(base
, fn
, trim
, flags
, cb_data
, e
);
685 * Return true iff refname1 and refname2 conflict with each other.
686 * Two reference names conflict if one of them exactly matches the
687 * leading components of the other; e.g., "foo/bar" conflicts with
688 * both "foo" and with "foo/bar/baz" but not with "foo/bar" or
691 static int names_conflict(const char *refname1
, const char *refname2
)
693 for (; *refname1
&& *refname1
== *refname2
; refname1
++, refname2
++)
695 return (*refname1
== '\0' && *refname2
== '/')
696 || (*refname1
== '/' && *refname2
== '\0');
699 struct name_conflict_cb
{
701 const char *oldrefname
;
702 const char *conflicting_refname
;
705 static int name_conflict_fn(const char *existingrefname
, const unsigned char *sha1
,
706 int flags
, void *cb_data
)
708 struct name_conflict_cb
*data
= (struct name_conflict_cb
*)cb_data
;
709 if (data
->oldrefname
&& !strcmp(data
->oldrefname
, existingrefname
))
711 if (names_conflict(data
->refname
, existingrefname
)) {
712 data
->conflicting_refname
= existingrefname
;
719 * Return true iff a reference named refname could be created without
720 * conflicting with the name of an existing reference in array. If
721 * oldrefname is non-NULL, ignore potential conflicts with oldrefname
722 * (e.g., because oldrefname is scheduled for deletion in the same
725 static int is_refname_available(const char *refname
, const char *oldrefname
,
728 struct name_conflict_cb data
;
729 data
.refname
= refname
;
730 data
.oldrefname
= oldrefname
;
731 data
.conflicting_refname
= NULL
;
734 if (do_for_each_ref_in_dir(dir
, 0, "", name_conflict_fn
,
735 0, DO_FOR_EACH_INCLUDE_BROKEN
,
737 error("'%s' exists; cannot create '%s'",
738 data
.conflicting_refname
, refname
);
745 * Future: need to be in "struct repository"
746 * when doing a full libification.
748 static struct ref_cache
{
749 struct ref_cache
*next
;
750 struct ref_entry
*loose
;
751 struct ref_entry
*packed
;
752 /* The submodule name, or "" for the main repo. */
753 char name
[FLEX_ARRAY
];
756 static void clear_packed_ref_cache(struct ref_cache
*refs
)
759 free_ref_entry(refs
->packed
);
764 static void clear_loose_ref_cache(struct ref_cache
*refs
)
767 free_ref_entry(refs
->loose
);
772 static struct ref_cache
*create_ref_cache(const char *submodule
)
775 struct ref_cache
*refs
;
778 len
= strlen(submodule
) + 1;
779 refs
= xcalloc(1, sizeof(struct ref_cache
) + len
);
780 memcpy(refs
->name
, submodule
, len
);
785 * Return a pointer to a ref_cache for the specified submodule. For
786 * the main repository, use submodule==NULL. The returned structure
787 * will be allocated and initialized but not necessarily populated; it
788 * should not be freed.
790 static struct ref_cache
*get_ref_cache(const char *submodule
)
792 struct ref_cache
*refs
= ref_cache
;
796 if (!strcmp(submodule
, refs
->name
))
801 refs
= create_ref_cache(submodule
);
802 refs
->next
= ref_cache
;
807 void invalidate_ref_cache(const char *submodule
)
809 struct ref_cache
*refs
= get_ref_cache(submodule
);
810 clear_packed_ref_cache(refs
);
811 clear_loose_ref_cache(refs
);
814 /* The length of a peeled reference line in packed-refs, including EOL: */
815 #define PEELED_LINE_LENGTH 42
818 * Parse one line from a packed-refs file. Write the SHA1 to sha1.
819 * Return a pointer to the refname within the line (null-terminated),
820 * or NULL if there was a problem.
822 static const char *parse_ref_line(char *line
, unsigned char *sha1
)
825 * 42: the answer to everything.
827 * In this case, it happens to be the answer to
828 * 40 (length of sha1 hex representation)
829 * +1 (space in between hex and name)
830 * +1 (newline at the end of the line)
832 int len
= strlen(line
) - 42;
836 if (get_sha1_hex(line
, sha1
) < 0)
838 if (!isspace(line
[40]))
843 if (line
[len
] != '\n')
851 * Read f, which is a packed-refs file, into dir.
853 * A comment line of the form "# pack-refs with: " may contain zero or
854 * more traits. We interpret the traits as follows:
858 * Probably no references are peeled. But if the file contains a
859 * peeled value for a reference, we will use it.
863 * References under "refs/tags/", if they *can* be peeled, *are*
864 * peeled in this file. References outside of "refs/tags/" are
865 * probably not peeled even if they could have been, but if we find
866 * a peeled value for such a reference we will use it.
870 * All references in the file that can be peeled are peeled.
871 * Inversely (and this is more important), any references in the
872 * file for which no peeled value is recorded is not peelable. This
873 * trait should typically be written alongside "peeled" for
874 * compatibility with older clients, but we do not require it
875 * (i.e., "peeled" is a no-op if "fully-peeled" is set).
877 static void read_packed_refs(FILE *f
, struct ref_dir
*dir
)
879 struct ref_entry
*last
= NULL
;
880 char refline
[PATH_MAX
];
881 enum { PEELED_NONE
, PEELED_TAGS
, PEELED_FULLY
} peeled
= PEELED_NONE
;
883 while (fgets(refline
, sizeof(refline
), f
)) {
884 unsigned char sha1
[20];
886 static const char header
[] = "# pack-refs with:";
888 if (!strncmp(refline
, header
, sizeof(header
)-1)) {
889 const char *traits
= refline
+ sizeof(header
) - 1;
890 if (strstr(traits
, " fully-peeled "))
891 peeled
= PEELED_FULLY
;
892 else if (strstr(traits
, " peeled "))
893 peeled
= PEELED_TAGS
;
894 /* perhaps other traits later as well */
898 refname
= parse_ref_line(refline
, sha1
);
900 last
= create_ref_entry(refname
, sha1
, REF_ISPACKED
, 1);
901 if (peeled
== PEELED_FULLY
||
902 (peeled
== PEELED_TAGS
&& !prefixcmp(refname
, "refs/tags/")))
903 last
->flag
|= REF_KNOWS_PEELED
;
909 strlen(refline
) == PEELED_LINE_LENGTH
&&
910 refline
[PEELED_LINE_LENGTH
- 1] == '\n' &&
911 !get_sha1_hex(refline
+ 1, sha1
)) {
912 hashcpy(last
->u
.value
.peeled
, sha1
);
914 * Regardless of what the file header said,
915 * we definitely know the value of *this*
918 last
->flag
|= REF_KNOWS_PEELED
;
923 static struct ref_dir
*get_packed_refs(struct ref_cache
*refs
)
926 const char *packed_refs_file
;
929 refs
->packed
= create_dir_entry(refs
, "", 0, 0);
931 packed_refs_file
= git_path_submodule(refs
->name
, "packed-refs");
933 packed_refs_file
= git_path("packed-refs");
934 f
= fopen(packed_refs_file
, "r");
936 read_packed_refs(f
, get_ref_dir(refs
->packed
));
940 return get_ref_dir(refs
->packed
);
943 void add_packed_ref(const char *refname
, const unsigned char *sha1
)
945 add_ref(get_packed_refs(get_ref_cache(NULL
)),
946 create_ref_entry(refname
, sha1
, REF_ISPACKED
, 1));
950 * Read the loose references from the namespace dirname into dir
951 * (without recursing). dirname must end with '/'. dir must be the
952 * directory entry corresponding to dirname.
954 static void read_loose_refs(const char *dirname
, struct ref_dir
*dir
)
956 struct ref_cache
*refs
= dir
->ref_cache
;
960 int dirnamelen
= strlen(dirname
);
961 struct strbuf refname
;
964 path
= git_path_submodule(refs
->name
, "%s", dirname
);
966 path
= git_path("%s", dirname
);
972 strbuf_init(&refname
, dirnamelen
+ 257);
973 strbuf_add(&refname
, dirname
, dirnamelen
);
975 while ((de
= readdir(d
)) != NULL
) {
976 unsigned char sha1
[20];
981 if (de
->d_name
[0] == '.')
983 if (has_extension(de
->d_name
, ".lock"))
985 strbuf_addstr(&refname
, de
->d_name
);
987 ? git_path_submodule(refs
->name
, "%s", refname
.buf
)
988 : git_path("%s", refname
.buf
);
989 if (stat(refdir
, &st
) < 0) {
990 ; /* silently ignore */
991 } else if (S_ISDIR(st
.st_mode
)) {
992 strbuf_addch(&refname
, '/');
993 add_entry_to_dir(dir
,
994 create_dir_entry(refs
, refname
.buf
,
1000 if (resolve_gitlink_ref(refs
->name
, refname
.buf
, sha1
) < 0) {
1002 flag
|= REF_ISBROKEN
;
1004 } else if (read_ref_full(refname
.buf
, sha1
, 1, &flag
)) {
1006 flag
|= REF_ISBROKEN
;
1008 add_entry_to_dir(dir
,
1009 create_ref_entry(refname
.buf
, sha1
, flag
, 1));
1011 strbuf_setlen(&refname
, dirnamelen
);
1013 strbuf_release(&refname
);
1017 static struct ref_dir
*get_loose_refs(struct ref_cache
*refs
)
1021 * Mark the top-level directory complete because we
1022 * are about to read the only subdirectory that can
1025 refs
->loose
= create_dir_entry(refs
, "", 0, 0);
1027 * Create an incomplete entry for "refs/":
1029 add_entry_to_dir(get_ref_dir(refs
->loose
),
1030 create_dir_entry(refs
, "refs/", 5, 1));
1032 return get_ref_dir(refs
->loose
);
1035 /* We allow "recursive" symbolic refs. Only within reason, though */
1037 #define MAXREFLEN (1024)
1040 * Called by resolve_gitlink_ref_recursive() after it failed to read
1041 * from the loose refs in ref_cache refs. Find <refname> in the
1042 * packed-refs file for the submodule.
1044 static int resolve_gitlink_packed_ref(struct ref_cache
*refs
,
1045 const char *refname
, unsigned char *sha1
)
1047 struct ref_entry
*ref
;
1048 struct ref_dir
*dir
= get_packed_refs(refs
);
1050 ref
= find_ref(dir
, refname
);
1054 memcpy(sha1
, ref
->u
.value
.sha1
, 20);
1058 static int resolve_gitlink_ref_recursive(struct ref_cache
*refs
,
1059 const char *refname
, unsigned char *sha1
,
1063 char buffer
[128], *p
;
1066 if (recursion
> MAXDEPTH
|| strlen(refname
) > MAXREFLEN
)
1069 ? git_path_submodule(refs
->name
, "%s", refname
)
1070 : git_path("%s", refname
);
1071 fd
= open(path
, O_RDONLY
);
1073 return resolve_gitlink_packed_ref(refs
, refname
, sha1
);
1075 len
= read(fd
, buffer
, sizeof(buffer
)-1);
1079 while (len
&& isspace(buffer
[len
-1]))
1083 /* Was it a detached head or an old-fashioned symlink? */
1084 if (!get_sha1_hex(buffer
, sha1
))
1088 if (strncmp(buffer
, "ref:", 4))
1094 return resolve_gitlink_ref_recursive(refs
, p
, sha1
, recursion
+1);
1097 int resolve_gitlink_ref(const char *path
, const char *refname
, unsigned char *sha1
)
1099 int len
= strlen(path
), retval
;
1101 struct ref_cache
*refs
;
1103 while (len
&& path
[len
-1] == '/')
1107 submodule
= xstrndup(path
, len
);
1108 refs
= get_ref_cache(submodule
);
1111 retval
= resolve_gitlink_ref_recursive(refs
, refname
, sha1
, 0);
1116 * Return the ref_entry for the given refname from the packed
1117 * references. If it does not exist, return NULL.
1119 static struct ref_entry
*get_packed_ref(const char *refname
)
1121 return find_ref(get_packed_refs(get_ref_cache(NULL
)), refname
);
1124 const char *resolve_ref_unsafe(const char *refname
, unsigned char *sha1
, int reading
, int *flag
)
1126 int depth
= MAXDEPTH
;
1129 static char refname_buffer
[256];
1134 if (check_refname_format(refname
, REFNAME_ALLOW_ONELEVEL
))
1138 char path
[PATH_MAX
];
1146 git_snpath(path
, sizeof(path
), "%s", refname
);
1148 if (lstat(path
, &st
) < 0) {
1149 struct ref_entry
*entry
;
1151 if (errno
!= ENOENT
)
1154 * The loose reference file does not exist;
1155 * check for a packed reference.
1157 entry
= get_packed_ref(refname
);
1159 hashcpy(sha1
, entry
->u
.value
.sha1
);
1161 *flag
|= REF_ISPACKED
;
1164 /* The reference is not a packed reference, either. */
1173 /* Follow "normalized" - ie "refs/.." symlinks by hand */
1174 if (S_ISLNK(st
.st_mode
)) {
1175 len
= readlink(path
, buffer
, sizeof(buffer
)-1);
1179 if (!prefixcmp(buffer
, "refs/") &&
1180 !check_refname_format(buffer
, 0)) {
1181 strcpy(refname_buffer
, buffer
);
1182 refname
= refname_buffer
;
1184 *flag
|= REF_ISSYMREF
;
1189 /* Is it a directory? */
1190 if (S_ISDIR(st
.st_mode
)) {
1196 * Anything else, just open it and try to use it as
1199 fd
= open(path
, O_RDONLY
);
1202 len
= read_in_full(fd
, buffer
, sizeof(buffer
)-1);
1206 while (len
&& isspace(buffer
[len
-1]))
1211 * Is it a symbolic ref?
1213 if (prefixcmp(buffer
, "ref:"))
1216 *flag
|= REF_ISSYMREF
;
1218 while (isspace(*buf
))
1220 if (check_refname_format(buf
, REFNAME_ALLOW_ONELEVEL
)) {
1222 *flag
|= REF_ISBROKEN
;
1225 refname
= strcpy(refname_buffer
, buf
);
1227 /* Please note that FETCH_HEAD has a second line containing other data. */
1228 if (get_sha1_hex(buffer
, sha1
) || (buffer
[40] != '\0' && !isspace(buffer
[40]))) {
1230 *flag
|= REF_ISBROKEN
;
1236 char *resolve_refdup(const char *ref
, unsigned char *sha1
, int reading
, int *flag
)
1238 const char *ret
= resolve_ref_unsafe(ref
, sha1
, reading
, flag
);
1239 return ret
? xstrdup(ret
) : NULL
;
1242 /* The argument to filter_refs */
1244 const char *pattern
;
1249 int read_ref_full(const char *refname
, unsigned char *sha1
, int reading
, int *flags
)
1251 if (resolve_ref_unsafe(refname
, sha1
, reading
, flags
))
1256 int read_ref(const char *refname
, unsigned char *sha1
)
1258 return read_ref_full(refname
, sha1
, 1, NULL
);
1261 int ref_exists(const char *refname
)
1263 unsigned char sha1
[20];
1264 return !!resolve_ref_unsafe(refname
, sha1
, 1, NULL
);
1267 static int filter_refs(const char *refname
, const unsigned char *sha1
, int flags
,
1270 struct ref_filter
*filter
= (struct ref_filter
*)data
;
1271 if (fnmatch(filter
->pattern
, refname
, 0))
1273 return filter
->fn(refname
, sha1
, flags
, filter
->cb_data
);
1276 int peel_ref(const char *refname
, unsigned char *sha1
)
1279 unsigned char base
[20];
1282 if (current_ref
&& (current_ref
->name
== refname
1283 || !strcmp(current_ref
->name
, refname
))) {
1284 if (current_ref
->flag
& REF_KNOWS_PEELED
) {
1285 if (is_null_sha1(current_ref
->u
.value
.peeled
))
1287 hashcpy(sha1
, current_ref
->u
.value
.peeled
);
1290 hashcpy(base
, current_ref
->u
.value
.sha1
);
1294 if (read_ref_full(refname
, base
, 1, &flag
))
1297 if ((flag
& REF_ISPACKED
)) {
1298 struct ref_entry
*r
= get_packed_ref(refname
);
1300 if (r
&& (r
->flag
& REF_KNOWS_PEELED
)) {
1301 hashcpy(sha1
, r
->u
.value
.peeled
);
1307 o
= lookup_unknown_object(base
);
1308 if (o
->type
== OBJ_NONE
) {
1309 int type
= sha1_object_info(base
, NULL
);
1315 if (o
->type
== OBJ_TAG
) {
1316 o
= deref_tag_noverify(o
);
1318 hashcpy(sha1
, o
->sha1
);
1325 struct warn_if_dangling_data
{
1327 const char *refname
;
1328 const char *msg_fmt
;
1331 static int warn_if_dangling_symref(const char *refname
, const unsigned char *sha1
,
1332 int flags
, void *cb_data
)
1334 struct warn_if_dangling_data
*d
= cb_data
;
1335 const char *resolves_to
;
1336 unsigned char junk
[20];
1338 if (!(flags
& REF_ISSYMREF
))
1341 resolves_to
= resolve_ref_unsafe(refname
, junk
, 0, NULL
);
1342 if (!resolves_to
|| strcmp(resolves_to
, d
->refname
))
1345 fprintf(d
->fp
, d
->msg_fmt
, refname
);
1350 void warn_dangling_symref(FILE *fp
, const char *msg_fmt
, const char *refname
)
1352 struct warn_if_dangling_data data
;
1355 data
.refname
= refname
;
1356 data
.msg_fmt
= msg_fmt
;
1357 for_each_rawref(warn_if_dangling_symref
, &data
);
1361 * Call fn for each reference in the specified submodule for which the
1362 * refname begins with base. If trim is non-zero, then trim that many
1363 * characters off the beginning of each refname before passing the
1364 * refname to fn. flags can be DO_FOR_EACH_INCLUDE_BROKEN to include
1365 * broken references in the iteration. If fn ever returns a non-zero
1366 * value, stop the iteration and return that value; otherwise, return
1369 static int do_for_each_ref(const char *submodule
, const char *base
, each_ref_fn fn
,
1370 int trim
, int flags
, void *cb_data
)
1372 struct ref_cache
*refs
= get_ref_cache(submodule
);
1373 struct ref_dir
*packed_dir
= get_packed_refs(refs
);
1374 struct ref_dir
*loose_dir
= get_loose_refs(refs
);
1377 if (base
&& *base
) {
1378 packed_dir
= find_containing_dir(packed_dir
, base
, 0);
1379 loose_dir
= find_containing_dir(loose_dir
, base
, 0);
1382 if (packed_dir
&& loose_dir
) {
1383 sort_ref_dir(packed_dir
);
1384 sort_ref_dir(loose_dir
);
1385 retval
= do_for_each_ref_in_dirs(
1386 packed_dir
, loose_dir
,
1387 base
, fn
, trim
, flags
, cb_data
);
1388 } else if (packed_dir
) {
1389 sort_ref_dir(packed_dir
);
1390 retval
= do_for_each_ref_in_dir(
1392 base
, fn
, trim
, flags
, cb_data
);
1393 } else if (loose_dir
) {
1394 sort_ref_dir(loose_dir
);
1395 retval
= do_for_each_ref_in_dir(
1397 base
, fn
, trim
, flags
, cb_data
);
1403 static int do_head_ref(const char *submodule
, each_ref_fn fn
, void *cb_data
)
1405 unsigned char sha1
[20];
1409 if (resolve_gitlink_ref(submodule
, "HEAD", sha1
) == 0)
1410 return fn("HEAD", sha1
, 0, cb_data
);
1415 if (!read_ref_full("HEAD", sha1
, 1, &flag
))
1416 return fn("HEAD", sha1
, flag
, cb_data
);
1421 int head_ref(each_ref_fn fn
, void *cb_data
)
1423 return do_head_ref(NULL
, fn
, cb_data
);
1426 int head_ref_submodule(const char *submodule
, each_ref_fn fn
, void *cb_data
)
1428 return do_head_ref(submodule
, fn
, cb_data
);
1431 int for_each_ref(each_ref_fn fn
, void *cb_data
)
1433 return do_for_each_ref(NULL
, "", fn
, 0, 0, cb_data
);
1436 int for_each_ref_submodule(const char *submodule
, each_ref_fn fn
, void *cb_data
)
1438 return do_for_each_ref(submodule
, "", fn
, 0, 0, cb_data
);
1441 int for_each_ref_in(const char *prefix
, each_ref_fn fn
, void *cb_data
)
1443 return do_for_each_ref(NULL
, prefix
, fn
, strlen(prefix
), 0, cb_data
);
1446 int for_each_ref_in_submodule(const char *submodule
, const char *prefix
,
1447 each_ref_fn fn
, void *cb_data
)
1449 return do_for_each_ref(submodule
, prefix
, fn
, strlen(prefix
), 0, cb_data
);
1452 int for_each_tag_ref(each_ref_fn fn
, void *cb_data
)
1454 return for_each_ref_in("refs/tags/", fn
, cb_data
);
1457 int for_each_tag_ref_submodule(const char *submodule
, each_ref_fn fn
, void *cb_data
)
1459 return for_each_ref_in_submodule(submodule
, "refs/tags/", fn
, cb_data
);
1462 int for_each_branch_ref(each_ref_fn fn
, void *cb_data
)
1464 return for_each_ref_in("refs/heads/", fn
, cb_data
);
1467 int for_each_branch_ref_submodule(const char *submodule
, each_ref_fn fn
, void *cb_data
)
1469 return for_each_ref_in_submodule(submodule
, "refs/heads/", fn
, cb_data
);
1472 int for_each_remote_ref(each_ref_fn fn
, void *cb_data
)
1474 return for_each_ref_in("refs/remotes/", fn
, cb_data
);
1477 int for_each_remote_ref_submodule(const char *submodule
, each_ref_fn fn
, void *cb_data
)
1479 return for_each_ref_in_submodule(submodule
, "refs/remotes/", fn
, cb_data
);
1482 int for_each_replace_ref(each_ref_fn fn
, void *cb_data
)
1484 return do_for_each_ref(NULL
, "refs/replace/", fn
, 13, 0, cb_data
);
1487 int head_ref_namespaced(each_ref_fn fn
, void *cb_data
)
1489 struct strbuf buf
= STRBUF_INIT
;
1491 unsigned char sha1
[20];
1494 strbuf_addf(&buf
, "%sHEAD", get_git_namespace());
1495 if (!read_ref_full(buf
.buf
, sha1
, 1, &flag
))
1496 ret
= fn(buf
.buf
, sha1
, flag
, cb_data
);
1497 strbuf_release(&buf
);
1502 int for_each_namespaced_ref(each_ref_fn fn
, void *cb_data
)
1504 struct strbuf buf
= STRBUF_INIT
;
1506 strbuf_addf(&buf
, "%srefs/", get_git_namespace());
1507 ret
= do_for_each_ref(NULL
, buf
.buf
, fn
, 0, 0, cb_data
);
1508 strbuf_release(&buf
);
1512 int for_each_glob_ref_in(each_ref_fn fn
, const char *pattern
,
1513 const char *prefix
, void *cb_data
)
1515 struct strbuf real_pattern
= STRBUF_INIT
;
1516 struct ref_filter filter
;
1519 if (!prefix
&& prefixcmp(pattern
, "refs/"))
1520 strbuf_addstr(&real_pattern
, "refs/");
1522 strbuf_addstr(&real_pattern
, prefix
);
1523 strbuf_addstr(&real_pattern
, pattern
);
1525 if (!has_glob_specials(pattern
)) {
1526 /* Append implied '/' '*' if not present. */
1527 if (real_pattern
.buf
[real_pattern
.len
- 1] != '/')
1528 strbuf_addch(&real_pattern
, '/');
1529 /* No need to check for '*', there is none. */
1530 strbuf_addch(&real_pattern
, '*');
1533 filter
.pattern
= real_pattern
.buf
;
1535 filter
.cb_data
= cb_data
;
1536 ret
= for_each_ref(filter_refs
, &filter
);
1538 strbuf_release(&real_pattern
);
1542 int for_each_glob_ref(each_ref_fn fn
, const char *pattern
, void *cb_data
)
1544 return for_each_glob_ref_in(fn
, pattern
, NULL
, cb_data
);
1547 int for_each_rawref(each_ref_fn fn
, void *cb_data
)
1549 return do_for_each_ref(NULL
, "", fn
, 0,
1550 DO_FOR_EACH_INCLUDE_BROKEN
, cb_data
);
1553 const char *prettify_refname(const char *name
)
1556 !prefixcmp(name
, "refs/heads/") ? 11 :
1557 !prefixcmp(name
, "refs/tags/") ? 10 :
1558 !prefixcmp(name
, "refs/remotes/") ? 13 :
1562 const char *ref_rev_parse_rules
[] = {
1567 "refs/remotes/%.*s",
1568 "refs/remotes/%.*s/HEAD",
1572 int refname_match(const char *abbrev_name
, const char *full_name
, const char **rules
)
1575 const int abbrev_name_len
= strlen(abbrev_name
);
1577 for (p
= rules
; *p
; p
++) {
1578 if (!strcmp(full_name
, mkpath(*p
, abbrev_name_len
, abbrev_name
))) {
1586 static struct ref_lock
*verify_lock(struct ref_lock
*lock
,
1587 const unsigned char *old_sha1
, int mustexist
)
1589 if (read_ref_full(lock
->ref_name
, lock
->old_sha1
, mustexist
, NULL
)) {
1590 error("Can't verify ref %s", lock
->ref_name
);
1594 if (hashcmp(lock
->old_sha1
, old_sha1
)) {
1595 error("Ref %s is at %s but expected %s", lock
->ref_name
,
1596 sha1_to_hex(lock
->old_sha1
), sha1_to_hex(old_sha1
));
1603 static int remove_empty_directories(const char *file
)
1605 /* we want to create a file but there is a directory there;
1606 * if that is an empty directory (or a directory that contains
1607 * only empty directories), remove them.
1612 strbuf_init(&path
, 20);
1613 strbuf_addstr(&path
, file
);
1615 result
= remove_dir_recursively(&path
, REMOVE_DIR_EMPTY_ONLY
);
1617 strbuf_release(&path
);
1623 * *string and *len will only be substituted, and *string returned (for
1624 * later free()ing) if the string passed in is a magic short-hand form
1627 static char *substitute_branch_name(const char **string
, int *len
)
1629 struct strbuf buf
= STRBUF_INIT
;
1630 int ret
= interpret_branch_name(*string
, &buf
);
1634 *string
= strbuf_detach(&buf
, &size
);
1636 return (char *)*string
;
1642 int dwim_ref(const char *str
, int len
, unsigned char *sha1
, char **ref
)
1644 char *last_branch
= substitute_branch_name(&str
, &len
);
1649 for (p
= ref_rev_parse_rules
; *p
; p
++) {
1650 char fullref
[PATH_MAX
];
1651 unsigned char sha1_from_ref
[20];
1652 unsigned char *this_result
;
1655 this_result
= refs_found
? sha1_from_ref
: sha1
;
1656 mksnpath(fullref
, sizeof(fullref
), *p
, len
, str
);
1657 r
= resolve_ref_unsafe(fullref
, this_result
, 1, &flag
);
1661 if (!warn_ambiguous_refs
)
1663 } else if ((flag
& REF_ISSYMREF
) && strcmp(fullref
, "HEAD")) {
1664 warning("ignoring dangling symref %s.", fullref
);
1665 } else if ((flag
& REF_ISBROKEN
) && strchr(fullref
, '/')) {
1666 warning("ignoring broken ref %s.", fullref
);
1673 int dwim_log(const char *str
, int len
, unsigned char *sha1
, char **log
)
1675 char *last_branch
= substitute_branch_name(&str
, &len
);
1680 for (p
= ref_rev_parse_rules
; *p
; p
++) {
1682 unsigned char hash
[20];
1683 char path
[PATH_MAX
];
1684 const char *ref
, *it
;
1686 mksnpath(path
, sizeof(path
), *p
, len
, str
);
1687 ref
= resolve_ref_unsafe(path
, hash
, 1, NULL
);
1690 if (!stat(git_path("logs/%s", path
), &st
) &&
1691 S_ISREG(st
.st_mode
))
1693 else if (strcmp(ref
, path
) &&
1694 !stat(git_path("logs/%s", ref
), &st
) &&
1695 S_ISREG(st
.st_mode
))
1699 if (!logs_found
++) {
1701 hashcpy(sha1
, hash
);
1703 if (!warn_ambiguous_refs
)
1710 static struct ref_lock
*lock_ref_sha1_basic(const char *refname
,
1711 const unsigned char *old_sha1
,
1712 int flags
, int *type_p
)
1715 const char *orig_refname
= refname
;
1716 struct ref_lock
*lock
;
1719 int mustexist
= (old_sha1
&& !is_null_sha1(old_sha1
));
1722 lock
= xcalloc(1, sizeof(struct ref_lock
));
1725 refname
= resolve_ref_unsafe(refname
, lock
->old_sha1
, mustexist
, &type
);
1726 if (!refname
&& errno
== EISDIR
) {
1727 /* we are trying to lock foo but we used to
1728 * have foo/bar which now does not exist;
1729 * it is normal for the empty directory 'foo'
1732 ref_file
= git_path("%s", orig_refname
);
1733 if (remove_empty_directories(ref_file
)) {
1735 error("there are still refs under '%s'", orig_refname
);
1738 refname
= resolve_ref_unsafe(orig_refname
, lock
->old_sha1
, mustexist
, &type
);
1744 error("unable to resolve reference %s: %s",
1745 orig_refname
, strerror(errno
));
1748 missing
= is_null_sha1(lock
->old_sha1
);
1749 /* When the ref did not exist and we are creating it,
1750 * make sure there is no existing ref that is packed
1751 * whose name begins with our refname, nor a ref whose
1752 * name is a proper prefix of our refname.
1755 !is_refname_available(refname
, NULL
, get_packed_refs(get_ref_cache(NULL
)))) {
1756 last_errno
= ENOTDIR
;
1760 lock
->lk
= xcalloc(1, sizeof(struct lock_file
));
1762 lflags
= LOCK_DIE_ON_ERROR
;
1763 if (flags
& REF_NODEREF
) {
1764 refname
= orig_refname
;
1765 lflags
|= LOCK_NODEREF
;
1767 lock
->ref_name
= xstrdup(refname
);
1768 lock
->orig_ref_name
= xstrdup(orig_refname
);
1769 ref_file
= git_path("%s", refname
);
1771 lock
->force_write
= 1;
1772 if ((flags
& REF_NODEREF
) && (type
& REF_ISSYMREF
))
1773 lock
->force_write
= 1;
1775 if (safe_create_leading_directories(ref_file
)) {
1777 error("unable to create directory for %s", ref_file
);
1781 lock
->lock_fd
= hold_lock_file_for_update(lock
->lk
, ref_file
, lflags
);
1782 return old_sha1
? verify_lock(lock
, old_sha1
, mustexist
) : lock
;
1790 struct ref_lock
*lock_ref_sha1(const char *refname
, const unsigned char *old_sha1
)
1792 char refpath
[PATH_MAX
];
1793 if (check_refname_format(refname
, 0))
1795 strcpy(refpath
, mkpath("refs/%s", refname
));
1796 return lock_ref_sha1_basic(refpath
, old_sha1
, 0, NULL
);
1799 struct ref_lock
*lock_any_ref_for_update(const char *refname
,
1800 const unsigned char *old_sha1
, int flags
)
1802 if (check_refname_format(refname
, REFNAME_ALLOW_ONELEVEL
))
1804 return lock_ref_sha1_basic(refname
, old_sha1
, flags
, NULL
);
1807 struct repack_without_ref_sb
{
1808 const char *refname
;
1812 static int repack_without_ref_fn(const char *refname
, const unsigned char *sha1
,
1813 int flags
, void *cb_data
)
1815 struct repack_without_ref_sb
*data
= cb_data
;
1816 char line
[PATH_MAX
+ 100];
1819 if (!strcmp(data
->refname
, refname
))
1821 len
= snprintf(line
, sizeof(line
), "%s %s\n",
1822 sha1_to_hex(sha1
), refname
);
1823 /* this should not happen but just being defensive */
1824 if (len
> sizeof(line
))
1825 die("too long a refname '%s'", refname
);
1826 write_or_die(data
->fd
, line
, len
);
1830 static struct lock_file packlock
;
1832 static int repack_without_ref(const char *refname
)
1834 struct repack_without_ref_sb data
;
1835 struct ref_cache
*refs
= get_ref_cache(NULL
);
1836 struct ref_dir
*packed
;
1838 if (!get_packed_ref(refname
))
1839 return 0; /* refname does not exist in packed refs */
1841 data
.refname
= refname
;
1842 data
.fd
= hold_lock_file_for_update(&packlock
, git_path("packed-refs"), 0);
1844 unable_to_lock_error(git_path("packed-refs"), errno
);
1845 return error("cannot delete '%s' from packed refs", refname
);
1847 clear_packed_ref_cache(refs
);
1848 packed
= get_packed_refs(refs
);
1849 do_for_each_ref_in_dir(packed
, 0, "", repack_without_ref_fn
, 0, 0, &data
);
1850 return commit_lock_file(&packlock
);
1853 int delete_ref(const char *refname
, const unsigned char *sha1
, int delopt
)
1855 struct ref_lock
*lock
;
1856 int err
, i
= 0, ret
= 0, flag
= 0;
1858 lock
= lock_ref_sha1_basic(refname
, sha1
, delopt
, &flag
);
1861 if (!(flag
& REF_ISPACKED
) || flag
& REF_ISSYMREF
) {
1863 i
= strlen(lock
->lk
->filename
) - 5; /* .lock */
1864 lock
->lk
->filename
[i
] = 0;
1865 err
= unlink_or_warn(lock
->lk
->filename
);
1866 if (err
&& errno
!= ENOENT
)
1869 lock
->lk
->filename
[i
] = '.';
1871 /* removing the loose one could have resurrected an earlier
1872 * packed one. Also, if it was not loose we need to repack
1875 ret
|= repack_without_ref(lock
->ref_name
);
1877 unlink_or_warn(git_path("logs/%s", lock
->ref_name
));
1878 invalidate_ref_cache(NULL
);
1884 * People using contrib's git-new-workdir have .git/logs/refs ->
1885 * /some/other/path/.git/logs/refs, and that may live on another device.
1887 * IOW, to avoid cross device rename errors, the temporary renamed log must
1888 * live into logs/refs.
1890 #define TMP_RENAMED_LOG "logs/refs/.tmp-renamed-log"
1892 int rename_ref(const char *oldrefname
, const char *newrefname
, const char *logmsg
)
1894 unsigned char sha1
[20], orig_sha1
[20];
1895 int flag
= 0, logmoved
= 0;
1896 struct ref_lock
*lock
;
1897 struct stat loginfo
;
1898 int log
= !lstat(git_path("logs/%s", oldrefname
), &loginfo
);
1899 const char *symref
= NULL
;
1900 struct ref_cache
*refs
= get_ref_cache(NULL
);
1902 if (log
&& S_ISLNK(loginfo
.st_mode
))
1903 return error("reflog for %s is a symlink", oldrefname
);
1905 symref
= resolve_ref_unsafe(oldrefname
, orig_sha1
, 1, &flag
);
1906 if (flag
& REF_ISSYMREF
)
1907 return error("refname %s is a symbolic ref, renaming it is not supported",
1910 return error("refname %s not found", oldrefname
);
1912 if (!is_refname_available(newrefname
, oldrefname
, get_packed_refs(refs
)))
1915 if (!is_refname_available(newrefname
, oldrefname
, get_loose_refs(refs
)))
1918 if (log
&& rename(git_path("logs/%s", oldrefname
), git_path(TMP_RENAMED_LOG
)))
1919 return error("unable to move logfile logs/%s to "TMP_RENAMED_LOG
": %s",
1920 oldrefname
, strerror(errno
));
1922 if (delete_ref(oldrefname
, orig_sha1
, REF_NODEREF
)) {
1923 error("unable to delete old %s", oldrefname
);
1927 if (!read_ref_full(newrefname
, sha1
, 1, &flag
) &&
1928 delete_ref(newrefname
, sha1
, REF_NODEREF
)) {
1929 if (errno
==EISDIR
) {
1930 if (remove_empty_directories(git_path("%s", newrefname
))) {
1931 error("Directory not empty: %s", newrefname
);
1935 error("unable to delete existing %s", newrefname
);
1940 if (log
&& safe_create_leading_directories(git_path("logs/%s", newrefname
))) {
1941 error("unable to create directory for %s", newrefname
);
1946 if (log
&& rename(git_path(TMP_RENAMED_LOG
), git_path("logs/%s", newrefname
))) {
1947 if (errno
==EISDIR
|| errno
==ENOTDIR
) {
1949 * rename(a, b) when b is an existing
1950 * directory ought to result in ISDIR, but
1951 * Solaris 5.8 gives ENOTDIR. Sheesh.
1953 if (remove_empty_directories(git_path("logs/%s", newrefname
))) {
1954 error("Directory not empty: logs/%s", newrefname
);
1959 error("unable to move logfile "TMP_RENAMED_LOG
" to logs/%s: %s",
1960 newrefname
, strerror(errno
));
1966 lock
= lock_ref_sha1_basic(newrefname
, NULL
, 0, NULL
);
1968 error("unable to lock %s for update", newrefname
);
1971 lock
->force_write
= 1;
1972 hashcpy(lock
->old_sha1
, orig_sha1
);
1973 if (write_ref_sha1(lock
, orig_sha1
, logmsg
)) {
1974 error("unable to write current sha1 into %s", newrefname
);
1981 lock
= lock_ref_sha1_basic(oldrefname
, NULL
, 0, NULL
);
1983 error("unable to lock %s for rollback", oldrefname
);
1987 lock
->force_write
= 1;
1988 flag
= log_all_ref_updates
;
1989 log_all_ref_updates
= 0;
1990 if (write_ref_sha1(lock
, orig_sha1
, NULL
))
1991 error("unable to write current sha1 into %s", oldrefname
);
1992 log_all_ref_updates
= flag
;
1995 if (logmoved
&& rename(git_path("logs/%s", newrefname
), git_path("logs/%s", oldrefname
)))
1996 error("unable to restore logfile %s from %s: %s",
1997 oldrefname
, newrefname
, strerror(errno
));
1998 if (!logmoved
&& log
&&
1999 rename(git_path(TMP_RENAMED_LOG
), git_path("logs/%s", oldrefname
)))
2000 error("unable to restore logfile %s from "TMP_RENAMED_LOG
": %s",
2001 oldrefname
, strerror(errno
));
2006 int close_ref(struct ref_lock
*lock
)
2008 if (close_lock_file(lock
->lk
))
2014 int commit_ref(struct ref_lock
*lock
)
2016 if (commit_lock_file(lock
->lk
))
2022 void unlock_ref(struct ref_lock
*lock
)
2024 /* Do not free lock->lk -- atexit() still looks at them */
2026 rollback_lock_file(lock
->lk
);
2027 free(lock
->ref_name
);
2028 free(lock
->orig_ref_name
);
2033 * copy the reflog message msg to buf, which has been allocated sufficiently
2034 * large, while cleaning up the whitespaces. Especially, convert LF to space,
2035 * because reflog file is one line per entry.
2037 static int copy_msg(char *buf
, const char *msg
)
2044 while ((c
= *msg
++)) {
2045 if (wasspace
&& isspace(c
))
2047 wasspace
= isspace(c
);
2052 while (buf
< cp
&& isspace(cp
[-1]))
2058 int log_ref_setup(const char *refname
, char *logfile
, int bufsize
)
2060 int logfd
, oflags
= O_APPEND
| O_WRONLY
;
2062 git_snpath(logfile
, bufsize
, "logs/%s", refname
);
2063 if (log_all_ref_updates
&&
2064 (!prefixcmp(refname
, "refs/heads/") ||
2065 !prefixcmp(refname
, "refs/remotes/") ||
2066 !prefixcmp(refname
, "refs/notes/") ||
2067 !strcmp(refname
, "HEAD"))) {
2068 if (safe_create_leading_directories(logfile
) < 0)
2069 return error("unable to create directory for %s",
2074 logfd
= open(logfile
, oflags
, 0666);
2076 if (!(oflags
& O_CREAT
) && errno
== ENOENT
)
2079 if ((oflags
& O_CREAT
) && errno
== EISDIR
) {
2080 if (remove_empty_directories(logfile
)) {
2081 return error("There are still logs under '%s'",
2084 logfd
= open(logfile
, oflags
, 0666);
2088 return error("Unable to append to %s: %s",
2089 logfile
, strerror(errno
));
2092 adjust_shared_perm(logfile
);
2097 static int log_ref_write(const char *refname
, const unsigned char *old_sha1
,
2098 const unsigned char *new_sha1
, const char *msg
)
2100 int logfd
, result
, written
, oflags
= O_APPEND
| O_WRONLY
;
2101 unsigned maxlen
, len
;
2103 char log_file
[PATH_MAX
];
2105 const char *committer
;
2107 if (log_all_ref_updates
< 0)
2108 log_all_ref_updates
= !is_bare_repository();
2110 result
= log_ref_setup(refname
, log_file
, sizeof(log_file
));
2114 logfd
= open(log_file
, oflags
);
2117 msglen
= msg
? strlen(msg
) : 0;
2118 committer
= git_committer_info(0);
2119 maxlen
= strlen(committer
) + msglen
+ 100;
2120 logrec
= xmalloc(maxlen
);
2121 len
= sprintf(logrec
, "%s %s %s\n",
2122 sha1_to_hex(old_sha1
),
2123 sha1_to_hex(new_sha1
),
2126 len
+= copy_msg(logrec
+ len
- 1, msg
) - 1;
2127 written
= len
<= maxlen
? write_in_full(logfd
, logrec
, len
) : -1;
2129 if (close(logfd
) != 0 || written
!= len
)
2130 return error("Unable to append to %s", log_file
);
2134 static int is_branch(const char *refname
)
2136 return !strcmp(refname
, "HEAD") || !prefixcmp(refname
, "refs/heads/");
2139 int write_ref_sha1(struct ref_lock
*lock
,
2140 const unsigned char *sha1
, const char *logmsg
)
2142 static char term
= '\n';
2147 if (!lock
->force_write
&& !hashcmp(lock
->old_sha1
, sha1
)) {
2151 o
= parse_object(sha1
);
2153 error("Trying to write ref %s with nonexistent object %s",
2154 lock
->ref_name
, sha1_to_hex(sha1
));
2158 if (o
->type
!= OBJ_COMMIT
&& is_branch(lock
->ref_name
)) {
2159 error("Trying to write non-commit object %s to branch %s",
2160 sha1_to_hex(sha1
), lock
->ref_name
);
2164 if (write_in_full(lock
->lock_fd
, sha1_to_hex(sha1
), 40) != 40 ||
2165 write_in_full(lock
->lock_fd
, &term
, 1) != 1
2166 || close_ref(lock
) < 0) {
2167 error("Couldn't write %s", lock
->lk
->filename
);
2171 clear_loose_ref_cache(get_ref_cache(NULL
));
2172 if (log_ref_write(lock
->ref_name
, lock
->old_sha1
, sha1
, logmsg
) < 0 ||
2173 (strcmp(lock
->ref_name
, lock
->orig_ref_name
) &&
2174 log_ref_write(lock
->orig_ref_name
, lock
->old_sha1
, sha1
, logmsg
) < 0)) {
2178 if (strcmp(lock
->orig_ref_name
, "HEAD") != 0) {
2180 * Special hack: If a branch is updated directly and HEAD
2181 * points to it (may happen on the remote side of a push
2182 * for example) then logically the HEAD reflog should be
2184 * A generic solution implies reverse symref information,
2185 * but finding all symrefs pointing to the given branch
2186 * would be rather costly for this rare event (the direct
2187 * update of a branch) to be worth it. So let's cheat and
2188 * check with HEAD only which should cover 99% of all usage
2189 * scenarios (even 100% of the default ones).
2191 unsigned char head_sha1
[20];
2193 const char *head_ref
;
2194 head_ref
= resolve_ref_unsafe("HEAD", head_sha1
, 1, &head_flag
);
2195 if (head_ref
&& (head_flag
& REF_ISSYMREF
) &&
2196 !strcmp(head_ref
, lock
->ref_name
))
2197 log_ref_write("HEAD", lock
->old_sha1
, sha1
, logmsg
);
2199 if (commit_ref(lock
)) {
2200 error("Couldn't set %s", lock
->ref_name
);
2208 int create_symref(const char *ref_target
, const char *refs_heads_master
,
2211 const char *lockpath
;
2213 int fd
, len
, written
;
2214 char *git_HEAD
= git_pathdup("%s", ref_target
);
2215 unsigned char old_sha1
[20], new_sha1
[20];
2217 if (logmsg
&& read_ref(ref_target
, old_sha1
))
2220 if (safe_create_leading_directories(git_HEAD
) < 0)
2221 return error("unable to create directory for %s", git_HEAD
);
2223 #ifndef NO_SYMLINK_HEAD
2224 if (prefer_symlink_refs
) {
2226 if (!symlink(refs_heads_master
, git_HEAD
))
2228 fprintf(stderr
, "no symlink - falling back to symbolic ref\n");
2232 len
= snprintf(ref
, sizeof(ref
), "ref: %s\n", refs_heads_master
);
2233 if (sizeof(ref
) <= len
) {
2234 error("refname too long: %s", refs_heads_master
);
2235 goto error_free_return
;
2237 lockpath
= mkpath("%s.lock", git_HEAD
);
2238 fd
= open(lockpath
, O_CREAT
| O_EXCL
| O_WRONLY
, 0666);
2240 error("Unable to open %s for writing", lockpath
);
2241 goto error_free_return
;
2243 written
= write_in_full(fd
, ref
, len
);
2244 if (close(fd
) != 0 || written
!= len
) {
2245 error("Unable to write to %s", lockpath
);
2246 goto error_unlink_return
;
2248 if (rename(lockpath
, git_HEAD
) < 0) {
2249 error("Unable to create %s", git_HEAD
);
2250 goto error_unlink_return
;
2252 if (adjust_shared_perm(git_HEAD
)) {
2253 error("Unable to fix permissions on %s", lockpath
);
2254 error_unlink_return
:
2255 unlink_or_warn(lockpath
);
2261 #ifndef NO_SYMLINK_HEAD
2264 if (logmsg
&& !read_ref(refs_heads_master
, new_sha1
))
2265 log_ref_write(ref_target
, old_sha1
, new_sha1
, logmsg
);
2271 static char *ref_msg(const char *line
, const char *endp
)
2275 ep
= memchr(line
, '\n', endp
- line
);
2278 return xmemdupz(line
, ep
- line
);
2281 int read_ref_at(const char *refname
, unsigned long at_time
, int cnt
,
2282 unsigned char *sha1
, char **msg
,
2283 unsigned long *cutoff_time
, int *cutoff_tz
, int *cutoff_cnt
)
2285 const char *logfile
, *logdata
, *logend
, *rec
, *lastgt
, *lastrec
;
2287 int logfd
, tz
, reccnt
= 0;
2290 unsigned char logged_sha1
[20];
2294 logfile
= git_path("logs/%s", refname
);
2295 logfd
= open(logfile
, O_RDONLY
, 0);
2297 die_errno("Unable to read log '%s'", logfile
);
2300 die("Log %s is empty.", logfile
);
2301 mapsz
= xsize_t(st
.st_size
);
2302 log_mapped
= xmmap(NULL
, mapsz
, PROT_READ
, MAP_PRIVATE
, logfd
, 0);
2303 logdata
= log_mapped
;
2307 rec
= logend
= logdata
+ st
.st_size
;
2308 while (logdata
< rec
) {
2310 if (logdata
< rec
&& *(rec
-1) == '\n')
2313 while (logdata
< rec
&& *(rec
-1) != '\n') {
2319 die("Log %s is corrupt.", logfile
);
2320 date
= strtoul(lastgt
+ 1, &tz_c
, 10);
2321 if (date
<= at_time
|| cnt
== 0) {
2322 tz
= strtoul(tz_c
, NULL
, 10);
2324 *msg
= ref_msg(rec
, logend
);
2326 *cutoff_time
= date
;
2330 *cutoff_cnt
= reccnt
- 1;
2332 if (get_sha1_hex(lastrec
, logged_sha1
))
2333 die("Log %s is corrupt.", logfile
);
2334 if (get_sha1_hex(rec
+ 41, sha1
))
2335 die("Log %s is corrupt.", logfile
);
2336 if (hashcmp(logged_sha1
, sha1
)) {
2337 warning("Log %s has gap after %s.",
2338 logfile
, show_date(date
, tz
, DATE_RFC2822
));
2341 else if (date
== at_time
) {
2342 if (get_sha1_hex(rec
+ 41, sha1
))
2343 die("Log %s is corrupt.", logfile
);
2346 if (get_sha1_hex(rec
+ 41, logged_sha1
))
2347 die("Log %s is corrupt.", logfile
);
2348 if (hashcmp(logged_sha1
, sha1
)) {
2349 warning("Log %s unexpectedly ended on %s.",
2350 logfile
, show_date(date
, tz
, DATE_RFC2822
));
2353 munmap(log_mapped
, mapsz
);
2362 while (rec
< logend
&& *rec
!= '>' && *rec
!= '\n')
2364 if (rec
== logend
|| *rec
== '\n')
2365 die("Log %s is corrupt.", logfile
);
2366 date
= strtoul(rec
+ 1, &tz_c
, 10);
2367 tz
= strtoul(tz_c
, NULL
, 10);
2368 if (get_sha1_hex(logdata
, sha1
))
2369 die("Log %s is corrupt.", logfile
);
2370 if (is_null_sha1(sha1
)) {
2371 if (get_sha1_hex(logdata
+ 41, sha1
))
2372 die("Log %s is corrupt.", logfile
);
2375 *msg
= ref_msg(logdata
, logend
);
2376 munmap(log_mapped
, mapsz
);
2379 *cutoff_time
= date
;
2383 *cutoff_cnt
= reccnt
;
2387 int for_each_recent_reflog_ent(const char *refname
, each_reflog_ent_fn fn
, long ofs
, void *cb_data
)
2389 const char *logfile
;
2391 struct strbuf sb
= STRBUF_INIT
;
2394 logfile
= git_path("logs/%s", refname
);
2395 logfp
= fopen(logfile
, "r");
2400 struct stat statbuf
;
2401 if (fstat(fileno(logfp
), &statbuf
) ||
2402 statbuf
.st_size
< ofs
||
2403 fseek(logfp
, -ofs
, SEEK_END
) ||
2404 strbuf_getwholeline(&sb
, logfp
, '\n')) {
2406 strbuf_release(&sb
);
2411 while (!strbuf_getwholeline(&sb
, logfp
, '\n')) {
2412 unsigned char osha1
[20], nsha1
[20];
2413 char *email_end
, *message
;
2414 unsigned long timestamp
;
2417 /* old SP new SP name <email> SP time TAB msg LF */
2418 if (sb
.len
< 83 || sb
.buf
[sb
.len
- 1] != '\n' ||
2419 get_sha1_hex(sb
.buf
, osha1
) || sb
.buf
[40] != ' ' ||
2420 get_sha1_hex(sb
.buf
+ 41, nsha1
) || sb
.buf
[81] != ' ' ||
2421 !(email_end
= strchr(sb
.buf
+ 82, '>')) ||
2422 email_end
[1] != ' ' ||
2423 !(timestamp
= strtoul(email_end
+ 2, &message
, 10)) ||
2424 !message
|| message
[0] != ' ' ||
2425 (message
[1] != '+' && message
[1] != '-') ||
2426 !isdigit(message
[2]) || !isdigit(message
[3]) ||
2427 !isdigit(message
[4]) || !isdigit(message
[5]))
2428 continue; /* corrupt? */
2429 email_end
[1] = '\0';
2430 tz
= strtol(message
+ 1, NULL
, 10);
2431 if (message
[6] != '\t')
2435 ret
= fn(osha1
, nsha1
, sb
.buf
+ 82, timestamp
, tz
, message
,
2441 strbuf_release(&sb
);
2445 int for_each_reflog_ent(const char *refname
, each_reflog_ent_fn fn
, void *cb_data
)
2447 return for_each_recent_reflog_ent(refname
, fn
, 0, cb_data
);
2451 * Call fn for each reflog in the namespace indicated by name. name
2452 * must be empty or end with '/'. Name will be used as a scratch
2453 * space, but its contents will be restored before return.
2455 static int do_for_each_reflog(struct strbuf
*name
, each_ref_fn fn
, void *cb_data
)
2457 DIR *d
= opendir(git_path("logs/%s", name
->buf
));
2460 int oldlen
= name
->len
;
2463 return name
->len
? errno
: 0;
2465 while ((de
= readdir(d
)) != NULL
) {
2468 if (de
->d_name
[0] == '.')
2470 if (has_extension(de
->d_name
, ".lock"))
2472 strbuf_addstr(name
, de
->d_name
);
2473 if (stat(git_path("logs/%s", name
->buf
), &st
) < 0) {
2474 ; /* silently ignore */
2476 if (S_ISDIR(st
.st_mode
)) {
2477 strbuf_addch(name
, '/');
2478 retval
= do_for_each_reflog(name
, fn
, cb_data
);
2480 unsigned char sha1
[20];
2481 if (read_ref_full(name
->buf
, sha1
, 0, NULL
))
2482 retval
= error("bad ref for %s", name
->buf
);
2484 retval
= fn(name
->buf
, sha1
, 0, cb_data
);
2489 strbuf_setlen(name
, oldlen
);
2495 int for_each_reflog(each_ref_fn fn
, void *cb_data
)
2499 strbuf_init(&name
, PATH_MAX
);
2500 retval
= do_for_each_reflog(&name
, fn
, cb_data
);
2501 strbuf_release(&name
);
2505 int update_ref(const char *action
, const char *refname
,
2506 const unsigned char *sha1
, const unsigned char *oldval
,
2507 int flags
, enum action_on_err onerr
)
2509 static struct ref_lock
*lock
;
2510 lock
= lock_any_ref_for_update(refname
, oldval
, flags
);
2512 const char *str
= "Cannot lock the ref '%s'.";
2514 case MSG_ON_ERR
: error(str
, refname
); break;
2515 case DIE_ON_ERR
: die(str
, refname
); break;
2516 case QUIET_ON_ERR
: break;
2520 if (write_ref_sha1(lock
, sha1
, action
) < 0) {
2521 const char *str
= "Cannot update the ref '%s'.";
2523 case MSG_ON_ERR
: error(str
, refname
); break;
2524 case DIE_ON_ERR
: die(str
, refname
); break;
2525 case QUIET_ON_ERR
: break;
2532 struct ref
*find_ref_by_name(const struct ref
*list
, const char *name
)
2534 for ( ; list
; list
= list
->next
)
2535 if (!strcmp(list
->name
, name
))
2536 return (struct ref
*)list
;
2541 * generate a format suitable for scanf from a ref_rev_parse_rules
2542 * rule, that is replace the "%.*s" spec with a "%s" spec
2544 static void gen_scanf_fmt(char *scanf_fmt
, const char *rule
)
2548 spec
= strstr(rule
, "%.*s");
2549 if (!spec
|| strstr(spec
+ 4, "%.*s"))
2550 die("invalid rule in ref_rev_parse_rules: %s", rule
);
2552 /* copy all until spec */
2553 strncpy(scanf_fmt
, rule
, spec
- rule
);
2554 scanf_fmt
[spec
- rule
] = '\0';
2556 strcat(scanf_fmt
, "%s");
2557 /* copy remaining rule */
2558 strcat(scanf_fmt
, spec
+ 4);
2563 char *shorten_unambiguous_ref(const char *refname
, int strict
)
2566 static char **scanf_fmts
;
2567 static int nr_rules
;
2570 /* pre generate scanf formats from ref_rev_parse_rules[] */
2572 size_t total_len
= 0;
2574 /* the rule list is NULL terminated, count them first */
2575 for (; ref_rev_parse_rules
[nr_rules
]; nr_rules
++)
2576 /* no +1 because strlen("%s") < strlen("%.*s") */
2577 total_len
+= strlen(ref_rev_parse_rules
[nr_rules
]);
2579 scanf_fmts
= xmalloc(nr_rules
* sizeof(char *) + total_len
);
2582 for (i
= 0; i
< nr_rules
; i
++) {
2583 scanf_fmts
[i
] = (char *)&scanf_fmts
[nr_rules
]
2585 gen_scanf_fmt(scanf_fmts
[i
], ref_rev_parse_rules
[i
]);
2586 total_len
+= strlen(ref_rev_parse_rules
[i
]);
2590 /* bail out if there are no rules */
2592 return xstrdup(refname
);
2594 /* buffer for scanf result, at most refname must fit */
2595 short_name
= xstrdup(refname
);
2597 /* skip first rule, it will always match */
2598 for (i
= nr_rules
- 1; i
> 0 ; --i
) {
2600 int rules_to_fail
= i
;
2603 if (1 != sscanf(refname
, scanf_fmts
[i
], short_name
))
2606 short_name_len
= strlen(short_name
);
2609 * in strict mode, all (except the matched one) rules
2610 * must fail to resolve to a valid non-ambiguous ref
2613 rules_to_fail
= nr_rules
;
2616 * check if the short name resolves to a valid ref,
2617 * but use only rules prior to the matched one
2619 for (j
= 0; j
< rules_to_fail
; j
++) {
2620 const char *rule
= ref_rev_parse_rules
[j
];
2621 char refname
[PATH_MAX
];
2623 /* skip matched rule */
2628 * the short name is ambiguous, if it resolves
2629 * (with this previous rule) to a valid ref
2630 * read_ref() returns 0 on success
2632 mksnpath(refname
, sizeof(refname
),
2633 rule
, short_name_len
, short_name
);
2634 if (ref_exists(refname
))
2639 * short name is non-ambiguous if all previous rules
2640 * haven't resolved to a valid ref
2642 if (j
== rules_to_fail
)
2647 return xstrdup(refname
);