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
122 * be peelable. See the documentation for peel_ref() for an
123 * exact definition of "peelable".
125 unsigned char peeled
[20];
131 * Information used (along with the information in ref_entry) to
132 * describe a level in the hierarchy of references. This data
133 * structure only occurs embedded in a union in struct ref_entry, and
134 * only when (ref_entry.flag & REF_DIR) is set. In that case,
135 * (ref_entry.flag & REF_INCOMPLETE) determines whether the references
136 * in the directory have already been read:
138 * (ref_entry.flag & REF_INCOMPLETE) unset -- a directory of loose
139 * or packed references, already read.
141 * (ref_entry.flag & REF_INCOMPLETE) set -- a directory of loose
142 * references that hasn't been read yet (nor has any of its
145 * Entries within a directory are stored within a growable array of
146 * pointers to ref_entries (entries, nr, alloc). Entries 0 <= i <
147 * sorted are sorted by their component name in strcmp() order and the
148 * remaining entries are unsorted.
150 * Loose references are read lazily, one directory at a time. When a
151 * directory of loose references is read, then all of the references
152 * in that directory are stored, and REF_INCOMPLETE stubs are created
153 * for any subdirectories, but the subdirectories themselves are not
154 * read. The reading is triggered by get_ref_dir().
160 * Entries with index 0 <= i < sorted are sorted by name. New
161 * entries are appended to the list unsorted, and are sorted
162 * only when required; thus we avoid the need to sort the list
163 * after the addition of every reference.
167 /* A pointer to the ref_cache that contains this ref_dir. */
168 struct ref_cache
*ref_cache
;
170 struct ref_entry
**entries
;
174 * Bit values for ref_entry::flag. REF_ISSYMREF=0x01,
175 * REF_ISPACKED=0x02, and REF_ISBROKEN=0x04 are public values; see
180 * The field ref_entry->u.value.peeled of this value entry contains
181 * the correct peeled value for the reference, which might be
182 * null_sha1 if the reference is not a tag or if it is broken.
184 #define REF_KNOWS_PEELED 0x08
186 /* ref_entry represents a directory of references */
190 * Entry has not yet been read from disk (used only for REF_DIR
191 * entries representing loose references)
193 #define REF_INCOMPLETE 0x20
196 * A ref_entry represents either a reference or a "subdirectory" of
199 * Each directory in the reference namespace is represented by a
200 * ref_entry with (flags & REF_DIR) set and containing a subdir member
201 * that holds the entries in that directory that have been read so
202 * far. If (flags & REF_INCOMPLETE) is set, then the directory and
203 * its subdirectories haven't been read yet. REF_INCOMPLETE is only
204 * used for loose reference directories.
206 * References are represented by a ref_entry with (flags & REF_DIR)
207 * unset and a value member that describes the reference's value. The
208 * flag member is at the ref_entry level, but it is also needed to
209 * interpret the contents of the value field (in other words, a
210 * ref_value object is not very much use without the enclosing
213 * Reference names cannot end with slash and directories' names are
214 * always stored with a trailing slash (except for the top-level
215 * directory, which is always denoted by ""). This has two nice
216 * consequences: (1) when the entries in each subdir are sorted
217 * lexicographically by name (as they usually are), the references in
218 * a whole tree can be generated in lexicographic order by traversing
219 * the tree in left-to-right, depth-first order; (2) the names of
220 * references and subdirectories cannot conflict, and therefore the
221 * presence of an empty subdirectory does not block the creation of a
222 * similarly-named reference. (The fact that reference names with the
223 * same leading components can conflict *with each other* is a
224 * separate issue that is regulated by is_refname_available().)
226 * Please note that the name field contains the fully-qualified
227 * reference (or subdirectory) name. Space could be saved by only
228 * storing the relative names. But that would require the full names
229 * to be generated on the fly when iterating in do_for_each_ref(), and
230 * would break callback functions, who have always been able to assume
231 * that the name strings that they are passed will not be freed during
235 unsigned char flag
; /* ISSYMREF? ISPACKED? */
237 struct ref_value value
; /* if not (flags&REF_DIR) */
238 struct ref_dir subdir
; /* if (flags&REF_DIR) */
241 * The full name of the reference (e.g., "refs/heads/master")
242 * or the full name of the directory with a trailing slash
243 * (e.g., "refs/heads/"):
245 char name
[FLEX_ARRAY
];
248 static void read_loose_refs(const char *dirname
, struct ref_dir
*dir
);
250 static struct ref_dir
*get_ref_dir(struct ref_entry
*entry
)
253 assert(entry
->flag
& REF_DIR
);
254 dir
= &entry
->u
.subdir
;
255 if (entry
->flag
& REF_INCOMPLETE
) {
256 read_loose_refs(entry
->name
, dir
);
257 entry
->flag
&= ~REF_INCOMPLETE
;
262 static struct ref_entry
*create_ref_entry(const char *refname
,
263 const unsigned char *sha1
, int flag
,
267 struct ref_entry
*ref
;
270 check_refname_format(refname
, REFNAME_ALLOW_ONELEVEL
|REFNAME_DOT_COMPONENT
))
271 die("Reference has invalid format: '%s'", refname
);
272 len
= strlen(refname
) + 1;
273 ref
= xmalloc(sizeof(struct ref_entry
) + len
);
274 hashcpy(ref
->u
.value
.sha1
, sha1
);
275 hashclr(ref
->u
.value
.peeled
);
276 memcpy(ref
->name
, refname
, len
);
281 static void clear_ref_dir(struct ref_dir
*dir
);
283 static void free_ref_entry(struct ref_entry
*entry
)
285 if (entry
->flag
& REF_DIR
) {
287 * Do not use get_ref_dir() here, as that might
288 * trigger the reading of loose refs.
290 clear_ref_dir(&entry
->u
.subdir
);
296 * Add a ref_entry to the end of dir (unsorted). Entry is always
297 * stored directly in dir; no recursion into subdirectories is
300 static void add_entry_to_dir(struct ref_dir
*dir
, struct ref_entry
*entry
)
302 ALLOC_GROW(dir
->entries
, dir
->nr
+ 1, dir
->alloc
);
303 dir
->entries
[dir
->nr
++] = entry
;
304 /* optimize for the case that entries are added in order */
306 (dir
->nr
== dir
->sorted
+ 1 &&
307 strcmp(dir
->entries
[dir
->nr
- 2]->name
,
308 dir
->entries
[dir
->nr
- 1]->name
) < 0))
309 dir
->sorted
= dir
->nr
;
313 * Clear and free all entries in dir, recursively.
315 static void clear_ref_dir(struct ref_dir
*dir
)
318 for (i
= 0; i
< dir
->nr
; i
++)
319 free_ref_entry(dir
->entries
[i
]);
321 dir
->sorted
= dir
->nr
= dir
->alloc
= 0;
326 * Create a struct ref_entry object for the specified dirname.
327 * dirname is the name of the directory with a trailing slash (e.g.,
328 * "refs/heads/") or "" for the top-level directory.
330 static struct ref_entry
*create_dir_entry(struct ref_cache
*ref_cache
,
331 const char *dirname
, size_t len
,
334 struct ref_entry
*direntry
;
335 direntry
= xcalloc(1, sizeof(struct ref_entry
) + len
+ 1);
336 memcpy(direntry
->name
, dirname
, len
);
337 direntry
->name
[len
] = '\0';
338 direntry
->u
.subdir
.ref_cache
= ref_cache
;
339 direntry
->flag
= REF_DIR
| (incomplete
? REF_INCOMPLETE
: 0);
343 static int ref_entry_cmp(const void *a
, const void *b
)
345 struct ref_entry
*one
= *(struct ref_entry
**)a
;
346 struct ref_entry
*two
= *(struct ref_entry
**)b
;
347 return strcmp(one
->name
, two
->name
);
350 static void sort_ref_dir(struct ref_dir
*dir
);
352 struct string_slice
{
357 static int ref_entry_cmp_sslice(const void *key_
, const void *ent_
)
359 struct string_slice
*key
= (struct string_slice
*)key_
;
360 struct ref_entry
*ent
= *(struct ref_entry
**)ent_
;
361 int entlen
= strlen(ent
->name
);
362 int cmplen
= key
->len
< entlen
? key
->len
: entlen
;
363 int cmp
= memcmp(key
->str
, ent
->name
, cmplen
);
366 return key
->len
- entlen
;
370 * Return the index of the entry with the given refname from the
371 * ref_dir (non-recursively), sorting dir if necessary. Return -1 if
372 * no such entry is found. dir must already be complete.
374 static int search_ref_dir(struct ref_dir
*dir
, 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
);
391 return r
- dir
->entries
;
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 int entry_index
= search_ref_dir(dir
, subdirname
, len
);
406 struct ref_entry
*entry
;
407 if (entry_index
== -1) {
411 * Since dir is complete, the absence of a subdir
412 * means that the subdir really doesn't exist;
413 * therefore, create an empty record for it but mark
414 * the record complete.
416 entry
= create_dir_entry(dir
->ref_cache
, subdirname
, len
, 0);
417 add_entry_to_dir(dir
, entry
);
419 entry
= dir
->entries
[entry_index
];
421 return get_ref_dir(entry
);
425 * If refname is a reference name, find the ref_dir within the dir
426 * tree that should hold refname. If refname is a directory name
427 * (i.e., ends in '/'), then return that ref_dir itself. dir must
428 * represent the top-level directory and must already be complete.
429 * Sort ref_dirs and recurse into subdirectories as necessary. If
430 * mkdir is set, then create any missing directories; otherwise,
431 * return NULL if the desired directory cannot be found.
433 static struct ref_dir
*find_containing_dir(struct ref_dir
*dir
,
434 const char *refname
, int mkdir
)
437 for (slash
= strchr(refname
, '/'); slash
; slash
= strchr(slash
+ 1, '/')) {
438 size_t dirnamelen
= slash
- refname
+ 1;
439 struct ref_dir
*subdir
;
440 subdir
= search_for_subdir(dir
, refname
, dirnamelen
, mkdir
);
452 * Find the value entry with the given name in dir, sorting ref_dirs
453 * and recursing into subdirectories as necessary. If the name is not
454 * found or it corresponds to a directory entry, return NULL.
456 static struct ref_entry
*find_ref(struct ref_dir
*dir
, const char *refname
)
459 struct ref_entry
*entry
;
460 dir
= find_containing_dir(dir
, refname
, 0);
463 entry_index
= search_ref_dir(dir
, refname
, strlen(refname
));
464 if (entry_index
== -1)
466 entry
= dir
->entries
[entry_index
];
467 return (entry
->flag
& REF_DIR
) ? NULL
: entry
;
471 * Add a ref_entry to the ref_dir (unsorted), recursing into
472 * subdirectories as necessary. dir must represent the top-level
473 * directory. Return 0 on success.
475 static int add_ref(struct ref_dir
*dir
, struct ref_entry
*ref
)
477 dir
= find_containing_dir(dir
, ref
->name
, 1);
480 add_entry_to_dir(dir
, ref
);
485 * Emit a warning and return true iff ref1 and ref2 have the same name
486 * and the same sha1. Die if they have the same name but different
489 static int is_dup_ref(const struct ref_entry
*ref1
, const struct ref_entry
*ref2
)
491 if (strcmp(ref1
->name
, ref2
->name
))
494 /* Duplicate name; make sure that they don't conflict: */
496 if ((ref1
->flag
& REF_DIR
) || (ref2
->flag
& REF_DIR
))
497 /* This is impossible by construction */
498 die("Reference directory conflict: %s", ref1
->name
);
500 if (hashcmp(ref1
->u
.value
.sha1
, ref2
->u
.value
.sha1
))
501 die("Duplicated ref, and SHA1s don't match: %s", ref1
->name
);
503 warning("Duplicated ref: %s", ref1
->name
);
508 * Sort the entries in dir non-recursively (if they are not already
509 * sorted) and remove any duplicate entries.
511 static void sort_ref_dir(struct ref_dir
*dir
)
514 struct ref_entry
*last
= NULL
;
517 * This check also prevents passing a zero-length array to qsort(),
518 * which is a problem on some platforms.
520 if (dir
->sorted
== dir
->nr
)
523 qsort(dir
->entries
, dir
->nr
, sizeof(*dir
->entries
), ref_entry_cmp
);
525 /* Remove any duplicates: */
526 for (i
= 0, j
= 0; j
< dir
->nr
; j
++) {
527 struct ref_entry
*entry
= dir
->entries
[j
];
528 if (last
&& is_dup_ref(last
, entry
))
529 free_ref_entry(entry
);
531 last
= dir
->entries
[i
++] = entry
;
533 dir
->sorted
= dir
->nr
= i
;
536 /* Include broken references in a do_for_each_ref*() iteration: */
537 #define DO_FOR_EACH_INCLUDE_BROKEN 0x01
540 * Return true iff the reference described by entry can be resolved to
541 * an object in the database. Emit a warning if the referred-to
542 * object does not exist.
544 static int ref_resolves_to_object(struct ref_entry
*entry
)
546 if (entry
->flag
& REF_ISBROKEN
)
548 if (!has_sha1_file(entry
->u
.value
.sha1
)) {
549 error("%s does not point to a valid object!", entry
->name
);
556 * current_ref is a performance hack: when iterating over references
557 * using the for_each_ref*() functions, current_ref is set to the
558 * current reference's entry before calling the callback function. If
559 * the callback function calls peel_ref(), then peel_ref() first
560 * checks whether the reference to be peeled is the current reference
561 * (it usually is) and if so, returns that reference's peeled version
562 * if it is available. This avoids a refname lookup in a common case.
564 static struct ref_entry
*current_ref
;
566 typedef int each_ref_entry_fn(struct ref_entry
*entry
, void *cb_data
);
568 struct ref_entry_cb
{
577 * Handle one reference in a do_for_each_ref*()-style iteration,
578 * calling an each_ref_fn for each entry.
580 static int do_one_ref(struct ref_entry
*entry
, void *cb_data
)
582 struct ref_entry_cb
*data
= cb_data
;
584 if (prefixcmp(entry
->name
, data
->base
))
587 if (!(data
->flags
& DO_FOR_EACH_INCLUDE_BROKEN
) &&
588 !ref_resolves_to_object(entry
))
592 retval
= data
->fn(entry
->name
+ data
->trim
, entry
->u
.value
.sha1
,
593 entry
->flag
, data
->cb_data
);
599 * Call fn for each reference in dir that has index in the range
600 * offset <= index < dir->nr. Recurse into subdirectories that are in
601 * that index range, sorting them before iterating. This function
602 * does not sort dir itself; it should be sorted beforehand. fn is
603 * called for all references, including broken ones.
605 static int do_for_each_entry_in_dir(struct ref_dir
*dir
, int offset
,
606 each_ref_entry_fn fn
, void *cb_data
)
609 assert(dir
->sorted
== dir
->nr
);
610 for (i
= offset
; i
< dir
->nr
; i
++) {
611 struct ref_entry
*entry
= dir
->entries
[i
];
613 if (entry
->flag
& REF_DIR
) {
614 struct ref_dir
*subdir
= get_ref_dir(entry
);
615 sort_ref_dir(subdir
);
616 retval
= do_for_each_entry_in_dir(subdir
, 0, fn
, cb_data
);
618 retval
= fn(entry
, cb_data
);
627 * Call fn for each reference in the union of dir1 and dir2, in order
628 * by refname. Recurse into subdirectories. If a value entry appears
629 * in both dir1 and dir2, then only process the version that is in
630 * dir2. The input dirs must already be sorted, but subdirs will be
631 * sorted as needed. fn is called for all references, including
634 static int do_for_each_entry_in_dirs(struct ref_dir
*dir1
,
635 struct ref_dir
*dir2
,
636 each_ref_entry_fn fn
, void *cb_data
)
641 assert(dir1
->sorted
== dir1
->nr
);
642 assert(dir2
->sorted
== dir2
->nr
);
644 struct ref_entry
*e1
, *e2
;
646 if (i1
== dir1
->nr
) {
647 return do_for_each_entry_in_dir(dir2
, i2
, fn
, cb_data
);
649 if (i2
== dir2
->nr
) {
650 return do_for_each_entry_in_dir(dir1
, i1
, fn
, cb_data
);
652 e1
= dir1
->entries
[i1
];
653 e2
= dir2
->entries
[i2
];
654 cmp
= strcmp(e1
->name
, e2
->name
);
656 if ((e1
->flag
& REF_DIR
) && (e2
->flag
& REF_DIR
)) {
657 /* Both are directories; descend them in parallel. */
658 struct ref_dir
*subdir1
= get_ref_dir(e1
);
659 struct ref_dir
*subdir2
= get_ref_dir(e2
);
660 sort_ref_dir(subdir1
);
661 sort_ref_dir(subdir2
);
662 retval
= do_for_each_entry_in_dirs(
663 subdir1
, subdir2
, fn
, cb_data
);
666 } else if (!(e1
->flag
& REF_DIR
) && !(e2
->flag
& REF_DIR
)) {
667 /* Both are references; ignore the one from dir1. */
668 retval
= fn(e2
, cb_data
);
672 die("conflict between reference and directory: %s",
684 if (e
->flag
& REF_DIR
) {
685 struct ref_dir
*subdir
= get_ref_dir(e
);
686 sort_ref_dir(subdir
);
687 retval
= do_for_each_entry_in_dir(
688 subdir
, 0, fn
, cb_data
);
690 retval
= fn(e
, cb_data
);
699 * Return true iff refname1 and refname2 conflict with each other.
700 * Two reference names conflict if one of them exactly matches the
701 * leading components of the other; e.g., "foo/bar" conflicts with
702 * both "foo" and with "foo/bar/baz" but not with "foo/bar" or
705 static int names_conflict(const char *refname1
, const char *refname2
)
707 for (; *refname1
&& *refname1
== *refname2
; refname1
++, refname2
++)
709 return (*refname1
== '\0' && *refname2
== '/')
710 || (*refname1
== '/' && *refname2
== '\0');
713 struct name_conflict_cb
{
715 const char *oldrefname
;
716 const char *conflicting_refname
;
719 static int name_conflict_fn(struct ref_entry
*entry
, void *cb_data
)
721 struct name_conflict_cb
*data
= (struct name_conflict_cb
*)cb_data
;
722 if (data
->oldrefname
&& !strcmp(data
->oldrefname
, entry
->name
))
724 if (names_conflict(data
->refname
, entry
->name
)) {
725 data
->conflicting_refname
= entry
->name
;
732 * Return true iff a reference named refname could be created without
733 * conflicting with the name of an existing reference in dir. If
734 * oldrefname is non-NULL, ignore potential conflicts with oldrefname
735 * (e.g., because oldrefname is scheduled for deletion in the same
738 static int is_refname_available(const char *refname
, const char *oldrefname
,
741 struct name_conflict_cb data
;
742 data
.refname
= refname
;
743 data
.oldrefname
= oldrefname
;
744 data
.conflicting_refname
= NULL
;
747 if (do_for_each_entry_in_dir(dir
, 0, name_conflict_fn
, &data
)) {
748 error("'%s' exists; cannot create '%s'",
749 data
.conflicting_refname
, refname
);
756 * Future: need to be in "struct repository"
757 * when doing a full libification.
759 static struct ref_cache
{
760 struct ref_cache
*next
;
761 struct ref_entry
*loose
;
762 struct ref_entry
*packed
;
763 /* The submodule name, or "" for the main repo. */
764 char name
[FLEX_ARRAY
];
767 static void clear_packed_ref_cache(struct ref_cache
*refs
)
770 free_ref_entry(refs
->packed
);
775 static void clear_loose_ref_cache(struct ref_cache
*refs
)
778 free_ref_entry(refs
->loose
);
783 static struct ref_cache
*create_ref_cache(const char *submodule
)
786 struct ref_cache
*refs
;
789 len
= strlen(submodule
) + 1;
790 refs
= xcalloc(1, sizeof(struct ref_cache
) + len
);
791 memcpy(refs
->name
, submodule
, len
);
796 * Return a pointer to a ref_cache for the specified submodule. For
797 * the main repository, use submodule==NULL. The returned structure
798 * will be allocated and initialized but not necessarily populated; it
799 * should not be freed.
801 static struct ref_cache
*get_ref_cache(const char *submodule
)
803 struct ref_cache
*refs
= ref_cache
;
807 if (!strcmp(submodule
, refs
->name
))
812 refs
= create_ref_cache(submodule
);
813 refs
->next
= ref_cache
;
818 void invalidate_ref_cache(const char *submodule
)
820 struct ref_cache
*refs
= get_ref_cache(submodule
);
821 clear_packed_ref_cache(refs
);
822 clear_loose_ref_cache(refs
);
825 /* The length of a peeled reference line in packed-refs, including EOL: */
826 #define PEELED_LINE_LENGTH 42
829 * Parse one line from a packed-refs file. Write the SHA1 to sha1.
830 * Return a pointer to the refname within the line (null-terminated),
831 * or NULL if there was a problem.
833 static const char *parse_ref_line(char *line
, unsigned char *sha1
)
836 * 42: the answer to everything.
838 * In this case, it happens to be the answer to
839 * 40 (length of sha1 hex representation)
840 * +1 (space in between hex and name)
841 * +1 (newline at the end of the line)
843 int len
= strlen(line
) - 42;
847 if (get_sha1_hex(line
, sha1
) < 0)
849 if (!isspace(line
[40]))
854 if (line
[len
] != '\n')
862 * Read f, which is a packed-refs file, into dir.
864 * A comment line of the form "# pack-refs with: " may contain zero or
865 * more traits. We interpret the traits as follows:
869 * Probably no references are peeled. But if the file contains a
870 * peeled value for a reference, we will use it.
874 * References under "refs/tags/", if they *can* be peeled, *are*
875 * peeled in this file. References outside of "refs/tags/" are
876 * probably not peeled even if they could have been, but if we find
877 * a peeled value for such a reference we will use it.
881 * All references in the file that can be peeled are peeled.
882 * Inversely (and this is more important), any references in the
883 * file for which no peeled value is recorded is not peelable. This
884 * trait should typically be written alongside "peeled" for
885 * compatibility with older clients, but we do not require it
886 * (i.e., "peeled" is a no-op if "fully-peeled" is set).
888 static void read_packed_refs(FILE *f
, struct ref_dir
*dir
)
890 struct ref_entry
*last
= NULL
;
891 char refline
[PATH_MAX
];
892 enum { PEELED_NONE
, PEELED_TAGS
, PEELED_FULLY
} peeled
= PEELED_NONE
;
894 while (fgets(refline
, sizeof(refline
), f
)) {
895 unsigned char sha1
[20];
897 static const char header
[] = "# pack-refs with:";
899 if (!strncmp(refline
, header
, sizeof(header
)-1)) {
900 const char *traits
= refline
+ sizeof(header
) - 1;
901 if (strstr(traits
, " fully-peeled "))
902 peeled
= PEELED_FULLY
;
903 else if (strstr(traits
, " peeled "))
904 peeled
= PEELED_TAGS
;
905 /* perhaps other traits later as well */
909 refname
= parse_ref_line(refline
, sha1
);
911 last
= create_ref_entry(refname
, sha1
, REF_ISPACKED
, 1);
912 if (peeled
== PEELED_FULLY
||
913 (peeled
== PEELED_TAGS
&& !prefixcmp(refname
, "refs/tags/")))
914 last
->flag
|= REF_KNOWS_PEELED
;
920 strlen(refline
) == PEELED_LINE_LENGTH
&&
921 refline
[PEELED_LINE_LENGTH
- 1] == '\n' &&
922 !get_sha1_hex(refline
+ 1, sha1
)) {
923 hashcpy(last
->u
.value
.peeled
, sha1
);
925 * Regardless of what the file header said,
926 * we definitely know the value of *this*
929 last
->flag
|= REF_KNOWS_PEELED
;
934 static struct ref_dir
*get_packed_refs(struct ref_cache
*refs
)
937 const char *packed_refs_file
;
940 refs
->packed
= create_dir_entry(refs
, "", 0, 0);
942 packed_refs_file
= git_path_submodule(refs
->name
, "packed-refs");
944 packed_refs_file
= git_path("packed-refs");
945 f
= fopen(packed_refs_file
, "r");
947 read_packed_refs(f
, get_ref_dir(refs
->packed
));
951 return get_ref_dir(refs
->packed
);
954 void add_packed_ref(const char *refname
, const unsigned char *sha1
)
956 add_ref(get_packed_refs(get_ref_cache(NULL
)),
957 create_ref_entry(refname
, sha1
, REF_ISPACKED
, 1));
961 * Read the loose references from the namespace dirname into dir
962 * (without recursing). dirname must end with '/'. dir must be the
963 * directory entry corresponding to dirname.
965 static void read_loose_refs(const char *dirname
, struct ref_dir
*dir
)
967 struct ref_cache
*refs
= dir
->ref_cache
;
971 int dirnamelen
= strlen(dirname
);
972 struct strbuf refname
;
975 path
= git_path_submodule(refs
->name
, "%s", dirname
);
977 path
= git_path("%s", dirname
);
983 strbuf_init(&refname
, dirnamelen
+ 257);
984 strbuf_add(&refname
, dirname
, dirnamelen
);
986 while ((de
= readdir(d
)) != NULL
) {
987 unsigned char sha1
[20];
992 if (de
->d_name
[0] == '.')
994 if (has_extension(de
->d_name
, ".lock"))
996 strbuf_addstr(&refname
, de
->d_name
);
998 ? git_path_submodule(refs
->name
, "%s", refname
.buf
)
999 : git_path("%s", refname
.buf
);
1000 if (stat(refdir
, &st
) < 0) {
1001 ; /* silently ignore */
1002 } else if (S_ISDIR(st
.st_mode
)) {
1003 strbuf_addch(&refname
, '/');
1004 add_entry_to_dir(dir
,
1005 create_dir_entry(refs
, refname
.buf
,
1011 if (resolve_gitlink_ref(refs
->name
, refname
.buf
, sha1
) < 0) {
1013 flag
|= REF_ISBROKEN
;
1015 } else if (read_ref_full(refname
.buf
, sha1
, 1, &flag
)) {
1017 flag
|= REF_ISBROKEN
;
1019 add_entry_to_dir(dir
,
1020 create_ref_entry(refname
.buf
, sha1
, flag
, 1));
1022 strbuf_setlen(&refname
, dirnamelen
);
1024 strbuf_release(&refname
);
1028 static struct ref_dir
*get_loose_refs(struct ref_cache
*refs
)
1032 * Mark the top-level directory complete because we
1033 * are about to read the only subdirectory that can
1036 refs
->loose
= create_dir_entry(refs
, "", 0, 0);
1038 * Create an incomplete entry for "refs/":
1040 add_entry_to_dir(get_ref_dir(refs
->loose
),
1041 create_dir_entry(refs
, "refs/", 5, 1));
1043 return get_ref_dir(refs
->loose
);
1046 /* We allow "recursive" symbolic refs. Only within reason, though */
1048 #define MAXREFLEN (1024)
1051 * Called by resolve_gitlink_ref_recursive() after it failed to read
1052 * from the loose refs in ref_cache refs. Find <refname> in the
1053 * packed-refs file for the submodule.
1055 static int resolve_gitlink_packed_ref(struct ref_cache
*refs
,
1056 const char *refname
, unsigned char *sha1
)
1058 struct ref_entry
*ref
;
1059 struct ref_dir
*dir
= get_packed_refs(refs
);
1061 ref
= find_ref(dir
, refname
);
1065 memcpy(sha1
, ref
->u
.value
.sha1
, 20);
1069 static int resolve_gitlink_ref_recursive(struct ref_cache
*refs
,
1070 const char *refname
, unsigned char *sha1
,
1074 char buffer
[128], *p
;
1077 if (recursion
> MAXDEPTH
|| strlen(refname
) > MAXREFLEN
)
1080 ? git_path_submodule(refs
->name
, "%s", refname
)
1081 : git_path("%s", refname
);
1082 fd
= open(path
, O_RDONLY
);
1084 return resolve_gitlink_packed_ref(refs
, refname
, sha1
);
1086 len
= read(fd
, buffer
, sizeof(buffer
)-1);
1090 while (len
&& isspace(buffer
[len
-1]))
1094 /* Was it a detached head or an old-fashioned symlink? */
1095 if (!get_sha1_hex(buffer
, sha1
))
1099 if (strncmp(buffer
, "ref:", 4))
1105 return resolve_gitlink_ref_recursive(refs
, p
, sha1
, recursion
+1);
1108 int resolve_gitlink_ref(const char *path
, const char *refname
, unsigned char *sha1
)
1110 int len
= strlen(path
), retval
;
1112 struct ref_cache
*refs
;
1114 while (len
&& path
[len
-1] == '/')
1118 submodule
= xstrndup(path
, len
);
1119 refs
= get_ref_cache(submodule
);
1122 retval
= resolve_gitlink_ref_recursive(refs
, refname
, sha1
, 0);
1127 * Return the ref_entry for the given refname from the packed
1128 * references. If it does not exist, return NULL.
1130 static struct ref_entry
*get_packed_ref(const char *refname
)
1132 return find_ref(get_packed_refs(get_ref_cache(NULL
)), refname
);
1135 const char *resolve_ref_unsafe(const char *refname
, unsigned char *sha1
, int reading
, int *flag
)
1137 int depth
= MAXDEPTH
;
1140 static char refname_buffer
[256];
1145 if (check_refname_format(refname
, REFNAME_ALLOW_ONELEVEL
))
1149 char path
[PATH_MAX
];
1157 git_snpath(path
, sizeof(path
), "%s", refname
);
1159 if (lstat(path
, &st
) < 0) {
1160 struct ref_entry
*entry
;
1162 if (errno
!= ENOENT
)
1165 * The loose reference file does not exist;
1166 * check for a packed reference.
1168 entry
= get_packed_ref(refname
);
1170 hashcpy(sha1
, entry
->u
.value
.sha1
);
1172 *flag
|= REF_ISPACKED
;
1175 /* The reference is not a packed reference, either. */
1184 /* Follow "normalized" - ie "refs/.." symlinks by hand */
1185 if (S_ISLNK(st
.st_mode
)) {
1186 len
= readlink(path
, buffer
, sizeof(buffer
)-1);
1190 if (!prefixcmp(buffer
, "refs/") &&
1191 !check_refname_format(buffer
, 0)) {
1192 strcpy(refname_buffer
, buffer
);
1193 refname
= refname_buffer
;
1195 *flag
|= REF_ISSYMREF
;
1200 /* Is it a directory? */
1201 if (S_ISDIR(st
.st_mode
)) {
1207 * Anything else, just open it and try to use it as
1210 fd
= open(path
, O_RDONLY
);
1213 len
= read_in_full(fd
, buffer
, sizeof(buffer
)-1);
1217 while (len
&& isspace(buffer
[len
-1]))
1222 * Is it a symbolic ref?
1224 if (prefixcmp(buffer
, "ref:"))
1227 *flag
|= REF_ISSYMREF
;
1229 while (isspace(*buf
))
1231 if (check_refname_format(buf
, REFNAME_ALLOW_ONELEVEL
)) {
1233 *flag
|= REF_ISBROKEN
;
1236 refname
= strcpy(refname_buffer
, buf
);
1238 /* Please note that FETCH_HEAD has a second line containing other data. */
1239 if (get_sha1_hex(buffer
, sha1
) || (buffer
[40] != '\0' && !isspace(buffer
[40]))) {
1241 *flag
|= REF_ISBROKEN
;
1247 char *resolve_refdup(const char *ref
, unsigned char *sha1
, int reading
, int *flag
)
1249 const char *ret
= resolve_ref_unsafe(ref
, sha1
, reading
, flag
);
1250 return ret
? xstrdup(ret
) : NULL
;
1253 /* The argument to filter_refs */
1255 const char *pattern
;
1260 int read_ref_full(const char *refname
, unsigned char *sha1
, int reading
, int *flags
)
1262 if (resolve_ref_unsafe(refname
, sha1
, reading
, flags
))
1267 int read_ref(const char *refname
, unsigned char *sha1
)
1269 return read_ref_full(refname
, sha1
, 1, NULL
);
1272 int ref_exists(const char *refname
)
1274 unsigned char sha1
[20];
1275 return !!resolve_ref_unsafe(refname
, sha1
, 1, NULL
);
1278 static int filter_refs(const char *refname
, const unsigned char *sha1
, int flags
,
1281 struct ref_filter
*filter
= (struct ref_filter
*)data
;
1282 if (fnmatch(filter
->pattern
, refname
, 0))
1284 return filter
->fn(refname
, sha1
, flags
, filter
->cb_data
);
1288 /* object was peeled successfully: */
1292 * object cannot be peeled because the named object (or an
1293 * object referred to by a tag in the peel chain), does not
1298 /* object cannot be peeled because it is not a tag: */
1301 /* ref_entry contains no peeled value because it is a symref: */
1302 PEEL_IS_SYMREF
= -3,
1305 * ref_entry cannot be peeled because it is broken (i.e., the
1306 * symbolic reference cannot even be resolved to an object
1313 * Peel the named object; i.e., if the object is a tag, resolve the
1314 * tag recursively until a non-tag is found. If successful, store the
1315 * result to sha1 and return PEEL_PEELED. If the object is not a tag
1316 * or is not valid, return PEEL_NON_TAG or PEEL_INVALID, respectively,
1317 * and leave sha1 unchanged.
1319 static enum peel_status
peel_object(const unsigned char *name
, unsigned char *sha1
)
1321 struct object
*o
= lookup_unknown_object(name
);
1323 if (o
->type
== OBJ_NONE
) {
1324 int type
= sha1_object_info(name
, NULL
);
1326 return PEEL_INVALID
;
1330 if (o
->type
!= OBJ_TAG
)
1331 return PEEL_NON_TAG
;
1333 o
= deref_tag_noverify(o
);
1335 return PEEL_INVALID
;
1337 hashcpy(sha1
, o
->sha1
);
1342 * Peel the entry (if possible) and return its new peel_status.
1344 static enum peel_status
peel_entry(struct ref_entry
*entry
)
1346 enum peel_status status
;
1348 if (entry
->flag
& REF_KNOWS_PEELED
)
1349 return is_null_sha1(entry
->u
.value
.peeled
) ?
1350 PEEL_NON_TAG
: PEEL_PEELED
;
1351 if (entry
->flag
& REF_ISBROKEN
)
1353 if (entry
->flag
& REF_ISSYMREF
)
1354 return PEEL_IS_SYMREF
;
1356 status
= peel_object(entry
->u
.value
.sha1
, entry
->u
.value
.peeled
);
1357 if (status
== PEEL_PEELED
|| status
== PEEL_NON_TAG
)
1358 entry
->flag
|= REF_KNOWS_PEELED
;
1362 int peel_ref(const char *refname
, unsigned char *sha1
)
1365 unsigned char base
[20];
1367 if (current_ref
&& (current_ref
->name
== refname
1368 || !strcmp(current_ref
->name
, refname
))) {
1369 if (peel_entry(current_ref
))
1371 hashcpy(sha1
, current_ref
->u
.value
.peeled
);
1375 if (read_ref_full(refname
, base
, 1, &flag
))
1379 * If the reference is packed, read its ref_entry from the
1380 * cache in the hope that we already know its peeled value.
1381 * We only try this optimization on packed references because
1382 * (a) forcing the filling of the loose reference cache could
1383 * be expensive and (b) loose references anyway usually do not
1384 * have REF_KNOWS_PEELED.
1386 if (flag
& REF_ISPACKED
) {
1387 struct ref_entry
*r
= get_packed_ref(refname
);
1391 hashcpy(sha1
, r
->u
.value
.peeled
);
1396 return peel_object(base
, sha1
);
1399 struct warn_if_dangling_data
{
1401 const char *refname
;
1402 const char *msg_fmt
;
1405 static int warn_if_dangling_symref(const char *refname
, const unsigned char *sha1
,
1406 int flags
, void *cb_data
)
1408 struct warn_if_dangling_data
*d
= cb_data
;
1409 const char *resolves_to
;
1410 unsigned char junk
[20];
1412 if (!(flags
& REF_ISSYMREF
))
1415 resolves_to
= resolve_ref_unsafe(refname
, junk
, 0, NULL
);
1416 if (!resolves_to
|| strcmp(resolves_to
, d
->refname
))
1419 fprintf(d
->fp
, d
->msg_fmt
, refname
);
1424 void warn_dangling_symref(FILE *fp
, const char *msg_fmt
, const char *refname
)
1426 struct warn_if_dangling_data data
;
1429 data
.refname
= refname
;
1430 data
.msg_fmt
= msg_fmt
;
1431 for_each_rawref(warn_if_dangling_symref
, &data
);
1435 * Call fn for each reference in the specified submodule, omitting
1436 * references not in the containing_dir of base. fn is called for all
1437 * references, including broken ones. If fn ever returns a non-zero
1438 * value, stop the iteration and return that value; otherwise, return
1441 static int do_for_each_entry(const char *submodule
, const char *base
,
1442 each_ref_entry_fn fn
, void *cb_data
)
1444 struct ref_cache
*refs
= get_ref_cache(submodule
);
1445 struct ref_dir
*packed_dir
= get_packed_refs(refs
);
1446 struct ref_dir
*loose_dir
= get_loose_refs(refs
);
1449 if (base
&& *base
) {
1450 packed_dir
= find_containing_dir(packed_dir
, base
, 0);
1451 loose_dir
= find_containing_dir(loose_dir
, base
, 0);
1454 if (packed_dir
&& loose_dir
) {
1455 sort_ref_dir(packed_dir
);
1456 sort_ref_dir(loose_dir
);
1457 retval
= do_for_each_entry_in_dirs(
1458 packed_dir
, loose_dir
, fn
, cb_data
);
1459 } else if (packed_dir
) {
1460 sort_ref_dir(packed_dir
);
1461 retval
= do_for_each_entry_in_dir(
1462 packed_dir
, 0, fn
, cb_data
);
1463 } else if (loose_dir
) {
1464 sort_ref_dir(loose_dir
);
1465 retval
= do_for_each_entry_in_dir(
1466 loose_dir
, 0, fn
, cb_data
);
1473 * Call fn for each reference in the specified submodule for which the
1474 * refname begins with base. If trim is non-zero, then trim that many
1475 * characters off the beginning of each refname before passing the
1476 * refname to fn. flags can be DO_FOR_EACH_INCLUDE_BROKEN to include
1477 * broken references in the iteration. If fn ever returns a non-zero
1478 * value, stop the iteration and return that value; otherwise, return
1481 static int do_for_each_ref(const char *submodule
, const char *base
, each_ref_fn fn
,
1482 int trim
, int flags
, void *cb_data
)
1484 struct ref_entry_cb data
;
1489 data
.cb_data
= cb_data
;
1491 return do_for_each_entry(submodule
, base
, do_one_ref
, &data
);
1494 static int do_head_ref(const char *submodule
, each_ref_fn fn
, void *cb_data
)
1496 unsigned char sha1
[20];
1500 if (resolve_gitlink_ref(submodule
, "HEAD", sha1
) == 0)
1501 return fn("HEAD", sha1
, 0, cb_data
);
1506 if (!read_ref_full("HEAD", sha1
, 1, &flag
))
1507 return fn("HEAD", sha1
, flag
, cb_data
);
1512 int head_ref(each_ref_fn fn
, void *cb_data
)
1514 return do_head_ref(NULL
, fn
, cb_data
);
1517 int head_ref_submodule(const char *submodule
, each_ref_fn fn
, void *cb_data
)
1519 return do_head_ref(submodule
, fn
, cb_data
);
1522 int for_each_ref(each_ref_fn fn
, void *cb_data
)
1524 return do_for_each_ref(NULL
, "", fn
, 0, 0, cb_data
);
1527 int for_each_ref_submodule(const char *submodule
, each_ref_fn fn
, void *cb_data
)
1529 return do_for_each_ref(submodule
, "", fn
, 0, 0, cb_data
);
1532 int for_each_ref_in(const char *prefix
, each_ref_fn fn
, void *cb_data
)
1534 return do_for_each_ref(NULL
, prefix
, fn
, strlen(prefix
), 0, cb_data
);
1537 int for_each_ref_in_submodule(const char *submodule
, const char *prefix
,
1538 each_ref_fn fn
, void *cb_data
)
1540 return do_for_each_ref(submodule
, prefix
, fn
, strlen(prefix
), 0, cb_data
);
1543 int for_each_tag_ref(each_ref_fn fn
, void *cb_data
)
1545 return for_each_ref_in("refs/tags/", fn
, cb_data
);
1548 int for_each_tag_ref_submodule(const char *submodule
, each_ref_fn fn
, void *cb_data
)
1550 return for_each_ref_in_submodule(submodule
, "refs/tags/", fn
, cb_data
);
1553 int for_each_branch_ref(each_ref_fn fn
, void *cb_data
)
1555 return for_each_ref_in("refs/heads/", fn
, cb_data
);
1558 int for_each_branch_ref_submodule(const char *submodule
, each_ref_fn fn
, void *cb_data
)
1560 return for_each_ref_in_submodule(submodule
, "refs/heads/", fn
, cb_data
);
1563 int for_each_remote_ref(each_ref_fn fn
, void *cb_data
)
1565 return for_each_ref_in("refs/remotes/", fn
, cb_data
);
1568 int for_each_remote_ref_submodule(const char *submodule
, each_ref_fn fn
, void *cb_data
)
1570 return for_each_ref_in_submodule(submodule
, "refs/remotes/", fn
, cb_data
);
1573 int for_each_replace_ref(each_ref_fn fn
, void *cb_data
)
1575 return do_for_each_ref(NULL
, "refs/replace/", fn
, 13, 0, cb_data
);
1578 int head_ref_namespaced(each_ref_fn fn
, void *cb_data
)
1580 struct strbuf buf
= STRBUF_INIT
;
1582 unsigned char sha1
[20];
1585 strbuf_addf(&buf
, "%sHEAD", get_git_namespace());
1586 if (!read_ref_full(buf
.buf
, sha1
, 1, &flag
))
1587 ret
= fn(buf
.buf
, sha1
, flag
, cb_data
);
1588 strbuf_release(&buf
);
1593 int for_each_namespaced_ref(each_ref_fn fn
, void *cb_data
)
1595 struct strbuf buf
= STRBUF_INIT
;
1597 strbuf_addf(&buf
, "%srefs/", get_git_namespace());
1598 ret
= do_for_each_ref(NULL
, buf
.buf
, fn
, 0, 0, cb_data
);
1599 strbuf_release(&buf
);
1603 int for_each_glob_ref_in(each_ref_fn fn
, const char *pattern
,
1604 const char *prefix
, void *cb_data
)
1606 struct strbuf real_pattern
= STRBUF_INIT
;
1607 struct ref_filter filter
;
1610 if (!prefix
&& prefixcmp(pattern
, "refs/"))
1611 strbuf_addstr(&real_pattern
, "refs/");
1613 strbuf_addstr(&real_pattern
, prefix
);
1614 strbuf_addstr(&real_pattern
, pattern
);
1616 if (!has_glob_specials(pattern
)) {
1617 /* Append implied '/' '*' if not present. */
1618 if (real_pattern
.buf
[real_pattern
.len
- 1] != '/')
1619 strbuf_addch(&real_pattern
, '/');
1620 /* No need to check for '*', there is none. */
1621 strbuf_addch(&real_pattern
, '*');
1624 filter
.pattern
= real_pattern
.buf
;
1626 filter
.cb_data
= cb_data
;
1627 ret
= for_each_ref(filter_refs
, &filter
);
1629 strbuf_release(&real_pattern
);
1633 int for_each_glob_ref(each_ref_fn fn
, const char *pattern
, void *cb_data
)
1635 return for_each_glob_ref_in(fn
, pattern
, NULL
, cb_data
);
1638 int for_each_rawref(each_ref_fn fn
, void *cb_data
)
1640 return do_for_each_ref(NULL
, "", fn
, 0,
1641 DO_FOR_EACH_INCLUDE_BROKEN
, cb_data
);
1644 const char *prettify_refname(const char *name
)
1647 !prefixcmp(name
, "refs/heads/") ? 11 :
1648 !prefixcmp(name
, "refs/tags/") ? 10 :
1649 !prefixcmp(name
, "refs/remotes/") ? 13 :
1653 const char *ref_rev_parse_rules
[] = {
1658 "refs/remotes/%.*s",
1659 "refs/remotes/%.*s/HEAD",
1663 int refname_match(const char *abbrev_name
, const char *full_name
, const char **rules
)
1666 const int abbrev_name_len
= strlen(abbrev_name
);
1668 for (p
= rules
; *p
; p
++) {
1669 if (!strcmp(full_name
, mkpath(*p
, abbrev_name_len
, abbrev_name
))) {
1677 static struct ref_lock
*verify_lock(struct ref_lock
*lock
,
1678 const unsigned char *old_sha1
, int mustexist
)
1680 if (read_ref_full(lock
->ref_name
, lock
->old_sha1
, mustexist
, NULL
)) {
1681 error("Can't verify ref %s", lock
->ref_name
);
1685 if (hashcmp(lock
->old_sha1
, old_sha1
)) {
1686 error("Ref %s is at %s but expected %s", lock
->ref_name
,
1687 sha1_to_hex(lock
->old_sha1
), sha1_to_hex(old_sha1
));
1694 static int remove_empty_directories(const char *file
)
1696 /* we want to create a file but there is a directory there;
1697 * if that is an empty directory (or a directory that contains
1698 * only empty directories), remove them.
1703 strbuf_init(&path
, 20);
1704 strbuf_addstr(&path
, file
);
1706 result
= remove_dir_recursively(&path
, REMOVE_DIR_EMPTY_ONLY
);
1708 strbuf_release(&path
);
1714 * *string and *len will only be substituted, and *string returned (for
1715 * later free()ing) if the string passed in is a magic short-hand form
1718 static char *substitute_branch_name(const char **string
, int *len
)
1720 struct strbuf buf
= STRBUF_INIT
;
1721 int ret
= interpret_branch_name(*string
, &buf
);
1725 *string
= strbuf_detach(&buf
, &size
);
1727 return (char *)*string
;
1733 int dwim_ref(const char *str
, int len
, unsigned char *sha1
, char **ref
)
1735 char *last_branch
= substitute_branch_name(&str
, &len
);
1740 for (p
= ref_rev_parse_rules
; *p
; p
++) {
1741 char fullref
[PATH_MAX
];
1742 unsigned char sha1_from_ref
[20];
1743 unsigned char *this_result
;
1746 this_result
= refs_found
? sha1_from_ref
: sha1
;
1747 mksnpath(fullref
, sizeof(fullref
), *p
, len
, str
);
1748 r
= resolve_ref_unsafe(fullref
, this_result
, 1, &flag
);
1752 if (!warn_ambiguous_refs
)
1754 } else if ((flag
& REF_ISSYMREF
) && strcmp(fullref
, "HEAD")) {
1755 warning("ignoring dangling symref %s.", fullref
);
1756 } else if ((flag
& REF_ISBROKEN
) && strchr(fullref
, '/')) {
1757 warning("ignoring broken ref %s.", fullref
);
1764 int dwim_log(const char *str
, int len
, unsigned char *sha1
, char **log
)
1766 char *last_branch
= substitute_branch_name(&str
, &len
);
1771 for (p
= ref_rev_parse_rules
; *p
; p
++) {
1773 unsigned char hash
[20];
1774 char path
[PATH_MAX
];
1775 const char *ref
, *it
;
1777 mksnpath(path
, sizeof(path
), *p
, len
, str
);
1778 ref
= resolve_ref_unsafe(path
, hash
, 1, NULL
);
1781 if (!stat(git_path("logs/%s", path
), &st
) &&
1782 S_ISREG(st
.st_mode
))
1784 else if (strcmp(ref
, path
) &&
1785 !stat(git_path("logs/%s", ref
), &st
) &&
1786 S_ISREG(st
.st_mode
))
1790 if (!logs_found
++) {
1792 hashcpy(sha1
, hash
);
1794 if (!warn_ambiguous_refs
)
1801 static struct ref_lock
*lock_ref_sha1_basic(const char *refname
,
1802 const unsigned char *old_sha1
,
1803 int flags
, int *type_p
)
1806 const char *orig_refname
= refname
;
1807 struct ref_lock
*lock
;
1810 int mustexist
= (old_sha1
&& !is_null_sha1(old_sha1
));
1813 lock
= xcalloc(1, sizeof(struct ref_lock
));
1816 refname
= resolve_ref_unsafe(refname
, lock
->old_sha1
, mustexist
, &type
);
1817 if (!refname
&& errno
== EISDIR
) {
1818 /* we are trying to lock foo but we used to
1819 * have foo/bar which now does not exist;
1820 * it is normal for the empty directory 'foo'
1823 ref_file
= git_path("%s", orig_refname
);
1824 if (remove_empty_directories(ref_file
)) {
1826 error("there are still refs under '%s'", orig_refname
);
1829 refname
= resolve_ref_unsafe(orig_refname
, lock
->old_sha1
, mustexist
, &type
);
1835 error("unable to resolve reference %s: %s",
1836 orig_refname
, strerror(errno
));
1839 missing
= is_null_sha1(lock
->old_sha1
);
1840 /* When the ref did not exist and we are creating it,
1841 * make sure there is no existing ref that is packed
1842 * whose name begins with our refname, nor a ref whose
1843 * name is a proper prefix of our refname.
1846 !is_refname_available(refname
, NULL
, get_packed_refs(get_ref_cache(NULL
)))) {
1847 last_errno
= ENOTDIR
;
1851 lock
->lk
= xcalloc(1, sizeof(struct lock_file
));
1853 lflags
= LOCK_DIE_ON_ERROR
;
1854 if (flags
& REF_NODEREF
) {
1855 refname
= orig_refname
;
1856 lflags
|= LOCK_NODEREF
;
1858 lock
->ref_name
= xstrdup(refname
);
1859 lock
->orig_ref_name
= xstrdup(orig_refname
);
1860 ref_file
= git_path("%s", refname
);
1862 lock
->force_write
= 1;
1863 if ((flags
& REF_NODEREF
) && (type
& REF_ISSYMREF
))
1864 lock
->force_write
= 1;
1866 if (safe_create_leading_directories(ref_file
)) {
1868 error("unable to create directory for %s", ref_file
);
1872 lock
->lock_fd
= hold_lock_file_for_update(lock
->lk
, ref_file
, lflags
);
1873 return old_sha1
? verify_lock(lock
, old_sha1
, mustexist
) : lock
;
1881 struct ref_lock
*lock_ref_sha1(const char *refname
, const unsigned char *old_sha1
)
1883 char refpath
[PATH_MAX
];
1884 if (check_refname_format(refname
, 0))
1886 strcpy(refpath
, mkpath("refs/%s", refname
));
1887 return lock_ref_sha1_basic(refpath
, old_sha1
, 0, NULL
);
1890 struct ref_lock
*lock_any_ref_for_update(const char *refname
,
1891 const unsigned char *old_sha1
, int flags
)
1893 if (check_refname_format(refname
, REFNAME_ALLOW_ONELEVEL
))
1895 return lock_ref_sha1_basic(refname
, old_sha1
, flags
, NULL
);
1898 struct repack_without_ref_sb
{
1899 const char *refname
;
1903 static int repack_without_ref_fn(struct ref_entry
*entry
, void *cb_data
)
1905 struct repack_without_ref_sb
*data
= cb_data
;
1906 char line
[PATH_MAX
+ 100];
1909 if (!strcmp(data
->refname
, entry
->name
))
1911 if (entry
->flag
& REF_ISBROKEN
) {
1912 /* This shouldn't happen to packed refs. */
1913 error("%s is broken!", entry
->name
);
1916 if (!has_sha1_file(entry
->u
.value
.sha1
)) {
1917 unsigned char sha1
[20];
1920 if (read_ref_full(entry
->name
, sha1
, 0, &flags
))
1921 /* We should at least have found the packed ref. */
1922 die("Internal error");
1923 if ((flags
& REF_ISSYMREF
) || !(flags
& REF_ISPACKED
))
1925 * This packed reference is overridden by a
1926 * loose reference, so it is OK that its value
1927 * is no longer valid; for example, it might
1928 * refer to an object that has been garbage
1929 * collected. For this purpose we don't even
1930 * care whether the loose reference itself is
1931 * invalid, broken, symbolic, etc. Silently
1932 * omit the packed reference from the output.
1936 * There is no overriding loose reference, so the fact
1937 * that this reference doesn't refer to a valid object
1938 * indicates some kind of repository corruption.
1939 * Report the problem, then omit the reference from
1942 error("%s does not point to a valid object!", entry
->name
);
1946 len
= snprintf(line
, sizeof(line
), "%s %s\n",
1947 sha1_to_hex(entry
->u
.value
.sha1
), entry
->name
);
1948 /* this should not happen but just being defensive */
1949 if (len
> sizeof(line
))
1950 die("too long a refname '%s'", entry
->name
);
1951 write_or_die(data
->fd
, line
, len
);
1955 static struct lock_file packlock
;
1957 static int repack_without_ref(const char *refname
)
1959 struct repack_without_ref_sb data
;
1960 struct ref_cache
*refs
= get_ref_cache(NULL
);
1961 struct ref_dir
*packed
;
1963 if (!get_packed_ref(refname
))
1964 return 0; /* refname does not exist in packed refs */
1966 data
.refname
= refname
;
1967 data
.fd
= hold_lock_file_for_update(&packlock
, git_path("packed-refs"), 0);
1969 unable_to_lock_error(git_path("packed-refs"), errno
);
1970 return error("cannot delete '%s' from packed refs", refname
);
1972 clear_packed_ref_cache(refs
);
1973 packed
= get_packed_refs(refs
);
1974 do_for_each_entry_in_dir(packed
, 0, repack_without_ref_fn
, &data
);
1975 return commit_lock_file(&packlock
);
1978 int delete_ref(const char *refname
, const unsigned char *sha1
, int delopt
)
1980 struct ref_lock
*lock
;
1981 int err
, i
= 0, ret
= 0, flag
= 0;
1983 lock
= lock_ref_sha1_basic(refname
, sha1
, delopt
, &flag
);
1986 if (!(flag
& REF_ISPACKED
) || flag
& REF_ISSYMREF
) {
1988 i
= strlen(lock
->lk
->filename
) - 5; /* .lock */
1989 lock
->lk
->filename
[i
] = 0;
1990 err
= unlink_or_warn(lock
->lk
->filename
);
1991 if (err
&& errno
!= ENOENT
)
1994 lock
->lk
->filename
[i
] = '.';
1996 /* removing the loose one could have resurrected an earlier
1997 * packed one. Also, if it was not loose we need to repack
2000 ret
|= repack_without_ref(lock
->ref_name
);
2002 unlink_or_warn(git_path("logs/%s", lock
->ref_name
));
2003 invalidate_ref_cache(NULL
);
2009 * People using contrib's git-new-workdir have .git/logs/refs ->
2010 * /some/other/path/.git/logs/refs, and that may live on another device.
2012 * IOW, to avoid cross device rename errors, the temporary renamed log must
2013 * live into logs/refs.
2015 #define TMP_RENAMED_LOG "logs/refs/.tmp-renamed-log"
2017 int rename_ref(const char *oldrefname
, const char *newrefname
, const char *logmsg
)
2019 unsigned char sha1
[20], orig_sha1
[20];
2020 int flag
= 0, logmoved
= 0;
2021 struct ref_lock
*lock
;
2022 struct stat loginfo
;
2023 int log
= !lstat(git_path("logs/%s", oldrefname
), &loginfo
);
2024 const char *symref
= NULL
;
2025 struct ref_cache
*refs
= get_ref_cache(NULL
);
2027 if (log
&& S_ISLNK(loginfo
.st_mode
))
2028 return error("reflog for %s is a symlink", oldrefname
);
2030 symref
= resolve_ref_unsafe(oldrefname
, orig_sha1
, 1, &flag
);
2031 if (flag
& REF_ISSYMREF
)
2032 return error("refname %s is a symbolic ref, renaming it is not supported",
2035 return error("refname %s not found", oldrefname
);
2037 if (!is_refname_available(newrefname
, oldrefname
, get_packed_refs(refs
)))
2040 if (!is_refname_available(newrefname
, oldrefname
, get_loose_refs(refs
)))
2043 if (log
&& rename(git_path("logs/%s", oldrefname
), git_path(TMP_RENAMED_LOG
)))
2044 return error("unable to move logfile logs/%s to "TMP_RENAMED_LOG
": %s",
2045 oldrefname
, strerror(errno
));
2047 if (delete_ref(oldrefname
, orig_sha1
, REF_NODEREF
)) {
2048 error("unable to delete old %s", oldrefname
);
2052 if (!read_ref_full(newrefname
, sha1
, 1, &flag
) &&
2053 delete_ref(newrefname
, sha1
, REF_NODEREF
)) {
2054 if (errno
==EISDIR
) {
2055 if (remove_empty_directories(git_path("%s", newrefname
))) {
2056 error("Directory not empty: %s", newrefname
);
2060 error("unable to delete existing %s", newrefname
);
2065 if (log
&& safe_create_leading_directories(git_path("logs/%s", newrefname
))) {
2066 error("unable to create directory for %s", newrefname
);
2071 if (log
&& rename(git_path(TMP_RENAMED_LOG
), git_path("logs/%s", newrefname
))) {
2072 if (errno
==EISDIR
|| errno
==ENOTDIR
) {
2074 * rename(a, b) when b is an existing
2075 * directory ought to result in ISDIR, but
2076 * Solaris 5.8 gives ENOTDIR. Sheesh.
2078 if (remove_empty_directories(git_path("logs/%s", newrefname
))) {
2079 error("Directory not empty: logs/%s", newrefname
);
2084 error("unable to move logfile "TMP_RENAMED_LOG
" to logs/%s: %s",
2085 newrefname
, strerror(errno
));
2091 lock
= lock_ref_sha1_basic(newrefname
, NULL
, 0, NULL
);
2093 error("unable to lock %s for update", newrefname
);
2096 lock
->force_write
= 1;
2097 hashcpy(lock
->old_sha1
, orig_sha1
);
2098 if (write_ref_sha1(lock
, orig_sha1
, logmsg
)) {
2099 error("unable to write current sha1 into %s", newrefname
);
2106 lock
= lock_ref_sha1_basic(oldrefname
, NULL
, 0, NULL
);
2108 error("unable to lock %s for rollback", oldrefname
);
2112 lock
->force_write
= 1;
2113 flag
= log_all_ref_updates
;
2114 log_all_ref_updates
= 0;
2115 if (write_ref_sha1(lock
, orig_sha1
, NULL
))
2116 error("unable to write current sha1 into %s", oldrefname
);
2117 log_all_ref_updates
= flag
;
2120 if (logmoved
&& rename(git_path("logs/%s", newrefname
), git_path("logs/%s", oldrefname
)))
2121 error("unable to restore logfile %s from %s: %s",
2122 oldrefname
, newrefname
, strerror(errno
));
2123 if (!logmoved
&& log
&&
2124 rename(git_path(TMP_RENAMED_LOG
), git_path("logs/%s", oldrefname
)))
2125 error("unable to restore logfile %s from "TMP_RENAMED_LOG
": %s",
2126 oldrefname
, strerror(errno
));
2131 int close_ref(struct ref_lock
*lock
)
2133 if (close_lock_file(lock
->lk
))
2139 int commit_ref(struct ref_lock
*lock
)
2141 if (commit_lock_file(lock
->lk
))
2147 void unlock_ref(struct ref_lock
*lock
)
2149 /* Do not free lock->lk -- atexit() still looks at them */
2151 rollback_lock_file(lock
->lk
);
2152 free(lock
->ref_name
);
2153 free(lock
->orig_ref_name
);
2158 * copy the reflog message msg to buf, which has been allocated sufficiently
2159 * large, while cleaning up the whitespaces. Especially, convert LF to space,
2160 * because reflog file is one line per entry.
2162 static int copy_msg(char *buf
, const char *msg
)
2169 while ((c
= *msg
++)) {
2170 if (wasspace
&& isspace(c
))
2172 wasspace
= isspace(c
);
2177 while (buf
< cp
&& isspace(cp
[-1]))
2183 int log_ref_setup(const char *refname
, char *logfile
, int bufsize
)
2185 int logfd
, oflags
= O_APPEND
| O_WRONLY
;
2187 git_snpath(logfile
, bufsize
, "logs/%s", refname
);
2188 if (log_all_ref_updates
&&
2189 (!prefixcmp(refname
, "refs/heads/") ||
2190 !prefixcmp(refname
, "refs/remotes/") ||
2191 !prefixcmp(refname
, "refs/notes/") ||
2192 !strcmp(refname
, "HEAD"))) {
2193 if (safe_create_leading_directories(logfile
) < 0)
2194 return error("unable to create directory for %s",
2199 logfd
= open(logfile
, oflags
, 0666);
2201 if (!(oflags
& O_CREAT
) && errno
== ENOENT
)
2204 if ((oflags
& O_CREAT
) && errno
== EISDIR
) {
2205 if (remove_empty_directories(logfile
)) {
2206 return error("There are still logs under '%s'",
2209 logfd
= open(logfile
, oflags
, 0666);
2213 return error("Unable to append to %s: %s",
2214 logfile
, strerror(errno
));
2217 adjust_shared_perm(logfile
);
2222 static int log_ref_write(const char *refname
, const unsigned char *old_sha1
,
2223 const unsigned char *new_sha1
, const char *msg
)
2225 int logfd
, result
, written
, oflags
= O_APPEND
| O_WRONLY
;
2226 unsigned maxlen
, len
;
2228 char log_file
[PATH_MAX
];
2230 const char *committer
;
2232 if (log_all_ref_updates
< 0)
2233 log_all_ref_updates
= !is_bare_repository();
2235 result
= log_ref_setup(refname
, log_file
, sizeof(log_file
));
2239 logfd
= open(log_file
, oflags
);
2242 msglen
= msg
? strlen(msg
) : 0;
2243 committer
= git_committer_info(0);
2244 maxlen
= strlen(committer
) + msglen
+ 100;
2245 logrec
= xmalloc(maxlen
);
2246 len
= sprintf(logrec
, "%s %s %s\n",
2247 sha1_to_hex(old_sha1
),
2248 sha1_to_hex(new_sha1
),
2251 len
+= copy_msg(logrec
+ len
- 1, msg
) - 1;
2252 written
= len
<= maxlen
? write_in_full(logfd
, logrec
, len
) : -1;
2254 if (close(logfd
) != 0 || written
!= len
)
2255 return error("Unable to append to %s", log_file
);
2259 static int is_branch(const char *refname
)
2261 return !strcmp(refname
, "HEAD") || !prefixcmp(refname
, "refs/heads/");
2264 int write_ref_sha1(struct ref_lock
*lock
,
2265 const unsigned char *sha1
, const char *logmsg
)
2267 static char term
= '\n';
2272 if (!lock
->force_write
&& !hashcmp(lock
->old_sha1
, sha1
)) {
2276 o
= parse_object(sha1
);
2278 error("Trying to write ref %s with nonexistent object %s",
2279 lock
->ref_name
, sha1_to_hex(sha1
));
2283 if (o
->type
!= OBJ_COMMIT
&& is_branch(lock
->ref_name
)) {
2284 error("Trying to write non-commit object %s to branch %s",
2285 sha1_to_hex(sha1
), lock
->ref_name
);
2289 if (write_in_full(lock
->lock_fd
, sha1_to_hex(sha1
), 40) != 40 ||
2290 write_in_full(lock
->lock_fd
, &term
, 1) != 1
2291 || close_ref(lock
) < 0) {
2292 error("Couldn't write %s", lock
->lk
->filename
);
2296 clear_loose_ref_cache(get_ref_cache(NULL
));
2297 if (log_ref_write(lock
->ref_name
, lock
->old_sha1
, sha1
, logmsg
) < 0 ||
2298 (strcmp(lock
->ref_name
, lock
->orig_ref_name
) &&
2299 log_ref_write(lock
->orig_ref_name
, lock
->old_sha1
, sha1
, logmsg
) < 0)) {
2303 if (strcmp(lock
->orig_ref_name
, "HEAD") != 0) {
2305 * Special hack: If a branch is updated directly and HEAD
2306 * points to it (may happen on the remote side of a push
2307 * for example) then logically the HEAD reflog should be
2309 * A generic solution implies reverse symref information,
2310 * but finding all symrefs pointing to the given branch
2311 * would be rather costly for this rare event (the direct
2312 * update of a branch) to be worth it. So let's cheat and
2313 * check with HEAD only which should cover 99% of all usage
2314 * scenarios (even 100% of the default ones).
2316 unsigned char head_sha1
[20];
2318 const char *head_ref
;
2319 head_ref
= resolve_ref_unsafe("HEAD", head_sha1
, 1, &head_flag
);
2320 if (head_ref
&& (head_flag
& REF_ISSYMREF
) &&
2321 !strcmp(head_ref
, lock
->ref_name
))
2322 log_ref_write("HEAD", lock
->old_sha1
, sha1
, logmsg
);
2324 if (commit_ref(lock
)) {
2325 error("Couldn't set %s", lock
->ref_name
);
2333 int create_symref(const char *ref_target
, const char *refs_heads_master
,
2336 const char *lockpath
;
2338 int fd
, len
, written
;
2339 char *git_HEAD
= git_pathdup("%s", ref_target
);
2340 unsigned char old_sha1
[20], new_sha1
[20];
2342 if (logmsg
&& read_ref(ref_target
, old_sha1
))
2345 if (safe_create_leading_directories(git_HEAD
) < 0)
2346 return error("unable to create directory for %s", git_HEAD
);
2348 #ifndef NO_SYMLINK_HEAD
2349 if (prefer_symlink_refs
) {
2351 if (!symlink(refs_heads_master
, git_HEAD
))
2353 fprintf(stderr
, "no symlink - falling back to symbolic ref\n");
2357 len
= snprintf(ref
, sizeof(ref
), "ref: %s\n", refs_heads_master
);
2358 if (sizeof(ref
) <= len
) {
2359 error("refname too long: %s", refs_heads_master
);
2360 goto error_free_return
;
2362 lockpath
= mkpath("%s.lock", git_HEAD
);
2363 fd
= open(lockpath
, O_CREAT
| O_EXCL
| O_WRONLY
, 0666);
2365 error("Unable to open %s for writing", lockpath
);
2366 goto error_free_return
;
2368 written
= write_in_full(fd
, ref
, len
);
2369 if (close(fd
) != 0 || written
!= len
) {
2370 error("Unable to write to %s", lockpath
);
2371 goto error_unlink_return
;
2373 if (rename(lockpath
, git_HEAD
) < 0) {
2374 error("Unable to create %s", git_HEAD
);
2375 goto error_unlink_return
;
2377 if (adjust_shared_perm(git_HEAD
)) {
2378 error("Unable to fix permissions on %s", lockpath
);
2379 error_unlink_return
:
2380 unlink_or_warn(lockpath
);
2386 #ifndef NO_SYMLINK_HEAD
2389 if (logmsg
&& !read_ref(refs_heads_master
, new_sha1
))
2390 log_ref_write(ref_target
, old_sha1
, new_sha1
, logmsg
);
2396 static char *ref_msg(const char *line
, const char *endp
)
2400 ep
= memchr(line
, '\n', endp
- line
);
2403 return xmemdupz(line
, ep
- line
);
2406 int read_ref_at(const char *refname
, unsigned long at_time
, int cnt
,
2407 unsigned char *sha1
, char **msg
,
2408 unsigned long *cutoff_time
, int *cutoff_tz
, int *cutoff_cnt
)
2410 const char *logfile
, *logdata
, *logend
, *rec
, *lastgt
, *lastrec
;
2412 int logfd
, tz
, reccnt
= 0;
2415 unsigned char logged_sha1
[20];
2419 logfile
= git_path("logs/%s", refname
);
2420 logfd
= open(logfile
, O_RDONLY
, 0);
2422 die_errno("Unable to read log '%s'", logfile
);
2425 die("Log %s is empty.", logfile
);
2426 mapsz
= xsize_t(st
.st_size
);
2427 log_mapped
= xmmap(NULL
, mapsz
, PROT_READ
, MAP_PRIVATE
, logfd
, 0);
2428 logdata
= log_mapped
;
2432 rec
= logend
= logdata
+ st
.st_size
;
2433 while (logdata
< rec
) {
2435 if (logdata
< rec
&& *(rec
-1) == '\n')
2438 while (logdata
< rec
&& *(rec
-1) != '\n') {
2444 die("Log %s is corrupt.", logfile
);
2445 date
= strtoul(lastgt
+ 1, &tz_c
, 10);
2446 if (date
<= at_time
|| cnt
== 0) {
2447 tz
= strtoul(tz_c
, NULL
, 10);
2449 *msg
= ref_msg(rec
, logend
);
2451 *cutoff_time
= date
;
2455 *cutoff_cnt
= reccnt
- 1;
2457 if (get_sha1_hex(lastrec
, logged_sha1
))
2458 die("Log %s is corrupt.", logfile
);
2459 if (get_sha1_hex(rec
+ 41, sha1
))
2460 die("Log %s is corrupt.", logfile
);
2461 if (hashcmp(logged_sha1
, sha1
)) {
2462 warning("Log %s has gap after %s.",
2463 logfile
, show_date(date
, tz
, DATE_RFC2822
));
2466 else if (date
== at_time
) {
2467 if (get_sha1_hex(rec
+ 41, sha1
))
2468 die("Log %s is corrupt.", logfile
);
2471 if (get_sha1_hex(rec
+ 41, logged_sha1
))
2472 die("Log %s is corrupt.", logfile
);
2473 if (hashcmp(logged_sha1
, sha1
)) {
2474 warning("Log %s unexpectedly ended on %s.",
2475 logfile
, show_date(date
, tz
, DATE_RFC2822
));
2478 munmap(log_mapped
, mapsz
);
2487 while (rec
< logend
&& *rec
!= '>' && *rec
!= '\n')
2489 if (rec
== logend
|| *rec
== '\n')
2490 die("Log %s is corrupt.", logfile
);
2491 date
= strtoul(rec
+ 1, &tz_c
, 10);
2492 tz
= strtoul(tz_c
, NULL
, 10);
2493 if (get_sha1_hex(logdata
, sha1
))
2494 die("Log %s is corrupt.", logfile
);
2495 if (is_null_sha1(sha1
)) {
2496 if (get_sha1_hex(logdata
+ 41, sha1
))
2497 die("Log %s is corrupt.", logfile
);
2500 *msg
= ref_msg(logdata
, logend
);
2501 munmap(log_mapped
, mapsz
);
2504 *cutoff_time
= date
;
2508 *cutoff_cnt
= reccnt
;
2512 int for_each_recent_reflog_ent(const char *refname
, each_reflog_ent_fn fn
, long ofs
, void *cb_data
)
2514 const char *logfile
;
2516 struct strbuf sb
= STRBUF_INIT
;
2519 logfile
= git_path("logs/%s", refname
);
2520 logfp
= fopen(logfile
, "r");
2525 struct stat statbuf
;
2526 if (fstat(fileno(logfp
), &statbuf
) ||
2527 statbuf
.st_size
< ofs
||
2528 fseek(logfp
, -ofs
, SEEK_END
) ||
2529 strbuf_getwholeline(&sb
, logfp
, '\n')) {
2531 strbuf_release(&sb
);
2536 while (!strbuf_getwholeline(&sb
, logfp
, '\n')) {
2537 unsigned char osha1
[20], nsha1
[20];
2538 char *email_end
, *message
;
2539 unsigned long timestamp
;
2542 /* old SP new SP name <email> SP time TAB msg LF */
2543 if (sb
.len
< 83 || sb
.buf
[sb
.len
- 1] != '\n' ||
2544 get_sha1_hex(sb
.buf
, osha1
) || sb
.buf
[40] != ' ' ||
2545 get_sha1_hex(sb
.buf
+ 41, nsha1
) || sb
.buf
[81] != ' ' ||
2546 !(email_end
= strchr(sb
.buf
+ 82, '>')) ||
2547 email_end
[1] != ' ' ||
2548 !(timestamp
= strtoul(email_end
+ 2, &message
, 10)) ||
2549 !message
|| message
[0] != ' ' ||
2550 (message
[1] != '+' && message
[1] != '-') ||
2551 !isdigit(message
[2]) || !isdigit(message
[3]) ||
2552 !isdigit(message
[4]) || !isdigit(message
[5]))
2553 continue; /* corrupt? */
2554 email_end
[1] = '\0';
2555 tz
= strtol(message
+ 1, NULL
, 10);
2556 if (message
[6] != '\t')
2560 ret
= fn(osha1
, nsha1
, sb
.buf
+ 82, timestamp
, tz
, message
,
2566 strbuf_release(&sb
);
2570 int for_each_reflog_ent(const char *refname
, each_reflog_ent_fn fn
, void *cb_data
)
2572 return for_each_recent_reflog_ent(refname
, fn
, 0, cb_data
);
2576 * Call fn for each reflog in the namespace indicated by name. name
2577 * must be empty or end with '/'. Name will be used as a scratch
2578 * space, but its contents will be restored before return.
2580 static int do_for_each_reflog(struct strbuf
*name
, each_ref_fn fn
, void *cb_data
)
2582 DIR *d
= opendir(git_path("logs/%s", name
->buf
));
2585 int oldlen
= name
->len
;
2588 return name
->len
? errno
: 0;
2590 while ((de
= readdir(d
)) != NULL
) {
2593 if (de
->d_name
[0] == '.')
2595 if (has_extension(de
->d_name
, ".lock"))
2597 strbuf_addstr(name
, de
->d_name
);
2598 if (stat(git_path("logs/%s", name
->buf
), &st
) < 0) {
2599 ; /* silently ignore */
2601 if (S_ISDIR(st
.st_mode
)) {
2602 strbuf_addch(name
, '/');
2603 retval
= do_for_each_reflog(name
, fn
, cb_data
);
2605 unsigned char sha1
[20];
2606 if (read_ref_full(name
->buf
, sha1
, 0, NULL
))
2607 retval
= error("bad ref for %s", name
->buf
);
2609 retval
= fn(name
->buf
, sha1
, 0, cb_data
);
2614 strbuf_setlen(name
, oldlen
);
2620 int for_each_reflog(each_ref_fn fn
, void *cb_data
)
2624 strbuf_init(&name
, PATH_MAX
);
2625 retval
= do_for_each_reflog(&name
, fn
, cb_data
);
2626 strbuf_release(&name
);
2630 int update_ref(const char *action
, const char *refname
,
2631 const unsigned char *sha1
, const unsigned char *oldval
,
2632 int flags
, enum action_on_err onerr
)
2634 static struct ref_lock
*lock
;
2635 lock
= lock_any_ref_for_update(refname
, oldval
, flags
);
2637 const char *str
= "Cannot lock the ref '%s'.";
2639 case MSG_ON_ERR
: error(str
, refname
); break;
2640 case DIE_ON_ERR
: die(str
, refname
); break;
2641 case QUIET_ON_ERR
: break;
2645 if (write_ref_sha1(lock
, sha1
, action
) < 0) {
2646 const char *str
= "Cannot update the ref '%s'.";
2648 case MSG_ON_ERR
: error(str
, refname
); break;
2649 case DIE_ON_ERR
: die(str
, refname
); break;
2650 case QUIET_ON_ERR
: break;
2657 struct ref
*find_ref_by_name(const struct ref
*list
, const char *name
)
2659 for ( ; list
; list
= list
->next
)
2660 if (!strcmp(list
->name
, name
))
2661 return (struct ref
*)list
;
2666 * generate a format suitable for scanf from a ref_rev_parse_rules
2667 * rule, that is replace the "%.*s" spec with a "%s" spec
2669 static void gen_scanf_fmt(char *scanf_fmt
, const char *rule
)
2673 spec
= strstr(rule
, "%.*s");
2674 if (!spec
|| strstr(spec
+ 4, "%.*s"))
2675 die("invalid rule in ref_rev_parse_rules: %s", rule
);
2677 /* copy all until spec */
2678 strncpy(scanf_fmt
, rule
, spec
- rule
);
2679 scanf_fmt
[spec
- rule
] = '\0';
2681 strcat(scanf_fmt
, "%s");
2682 /* copy remaining rule */
2683 strcat(scanf_fmt
, spec
+ 4);
2688 char *shorten_unambiguous_ref(const char *refname
, int strict
)
2691 static char **scanf_fmts
;
2692 static int nr_rules
;
2695 /* pre generate scanf formats from ref_rev_parse_rules[] */
2697 size_t total_len
= 0;
2699 /* the rule list is NULL terminated, count them first */
2700 for (; ref_rev_parse_rules
[nr_rules
]; nr_rules
++)
2701 /* no +1 because strlen("%s") < strlen("%.*s") */
2702 total_len
+= strlen(ref_rev_parse_rules
[nr_rules
]);
2704 scanf_fmts
= xmalloc(nr_rules
* sizeof(char *) + total_len
);
2707 for (i
= 0; i
< nr_rules
; i
++) {
2708 scanf_fmts
[i
] = (char *)&scanf_fmts
[nr_rules
]
2710 gen_scanf_fmt(scanf_fmts
[i
], ref_rev_parse_rules
[i
]);
2711 total_len
+= strlen(ref_rev_parse_rules
[i
]);
2715 /* bail out if there are no rules */
2717 return xstrdup(refname
);
2719 /* buffer for scanf result, at most refname must fit */
2720 short_name
= xstrdup(refname
);
2722 /* skip first rule, it will always match */
2723 for (i
= nr_rules
- 1; i
> 0 ; --i
) {
2725 int rules_to_fail
= i
;
2728 if (1 != sscanf(refname
, scanf_fmts
[i
], short_name
))
2731 short_name_len
= strlen(short_name
);
2734 * in strict mode, all (except the matched one) rules
2735 * must fail to resolve to a valid non-ambiguous ref
2738 rules_to_fail
= nr_rules
;
2741 * check if the short name resolves to a valid ref,
2742 * but use only rules prior to the matched one
2744 for (j
= 0; j
< rules_to_fail
; j
++) {
2745 const char *rule
= ref_rev_parse_rules
[j
];
2746 char refname
[PATH_MAX
];
2748 /* skip matched rule */
2753 * the short name is ambiguous, if it resolves
2754 * (with this previous rule) to a valid ref
2755 * read_ref() returns 0 on success
2757 mksnpath(refname
, sizeof(refname
),
2758 rule
, short_name_len
, short_name
);
2759 if (ref_exists(refname
))
2764 * short name is non-ambiguous if all previous rules
2765 * haven't resolved to a valid ref
2767 if (j
== rules_to_fail
)
2772 return xstrdup(refname
);