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 * Remove the entry with the given name from dir, recursing into
472 * subdirectories as necessary. If refname is the name of a directory
473 * (i.e., ends with '/'), then remove the directory and its contents.
474 * If the removal was successful, return the number of entries
475 * remaining in the directory entry that contained the deleted entry.
476 * If the name was not found, return -1. Please note that this
477 * function only deletes the entry from the cache; it does not delete
478 * it from the filesystem or ensure that other cache entries (which
479 * might be symbolic references to the removed entry) are updated.
480 * Nor does it remove any containing dir entries that might be made
481 * empty by the removal. dir must represent the top-level directory
482 * and must already be complete.
484 static int remove_entry(struct ref_dir
*dir
, const char *refname
)
486 int refname_len
= strlen(refname
);
488 struct ref_entry
*entry
;
489 int is_dir
= refname
[refname_len
- 1] == '/';
492 * refname represents a reference directory. Remove
493 * the trailing slash; otherwise we will get the
494 * directory *representing* refname rather than the
495 * one *containing* it.
497 char *dirname
= xmemdupz(refname
, refname_len
- 1);
498 dir
= find_containing_dir(dir
, dirname
, 0);
501 dir
= find_containing_dir(dir
, refname
, 0);
505 entry_index
= search_ref_dir(dir
, refname
, refname_len
);
506 if (entry_index
== -1)
508 entry
= dir
->entries
[entry_index
];
510 memmove(&dir
->entries
[entry_index
],
511 &dir
->entries
[entry_index
+ 1],
512 (dir
->nr
- entry_index
- 1) * sizeof(*dir
->entries
)
515 if (dir
->sorted
> entry_index
)
517 free_ref_entry(entry
);
522 * Add a ref_entry to the ref_dir (unsorted), recursing into
523 * subdirectories as necessary. dir must represent the top-level
524 * directory. Return 0 on success.
526 static int add_ref(struct ref_dir
*dir
, struct ref_entry
*ref
)
528 dir
= find_containing_dir(dir
, ref
->name
, 1);
531 add_entry_to_dir(dir
, ref
);
536 * Emit a warning and return true iff ref1 and ref2 have the same name
537 * and the same sha1. Die if they have the same name but different
540 static int is_dup_ref(const struct ref_entry
*ref1
, const struct ref_entry
*ref2
)
542 if (strcmp(ref1
->name
, ref2
->name
))
545 /* Duplicate name; make sure that they don't conflict: */
547 if ((ref1
->flag
& REF_DIR
) || (ref2
->flag
& REF_DIR
))
548 /* This is impossible by construction */
549 die("Reference directory conflict: %s", ref1
->name
);
551 if (hashcmp(ref1
->u
.value
.sha1
, ref2
->u
.value
.sha1
))
552 die("Duplicated ref, and SHA1s don't match: %s", ref1
->name
);
554 warning("Duplicated ref: %s", ref1
->name
);
559 * Sort the entries in dir non-recursively (if they are not already
560 * sorted) and remove any duplicate entries.
562 static void sort_ref_dir(struct ref_dir
*dir
)
565 struct ref_entry
*last
= NULL
;
568 * This check also prevents passing a zero-length array to qsort(),
569 * which is a problem on some platforms.
571 if (dir
->sorted
== dir
->nr
)
574 qsort(dir
->entries
, dir
->nr
, sizeof(*dir
->entries
), ref_entry_cmp
);
576 /* Remove any duplicates: */
577 for (i
= 0, j
= 0; j
< dir
->nr
; j
++) {
578 struct ref_entry
*entry
= dir
->entries
[j
];
579 if (last
&& is_dup_ref(last
, entry
))
580 free_ref_entry(entry
);
582 last
= dir
->entries
[i
++] = entry
;
584 dir
->sorted
= dir
->nr
= i
;
587 /* Include broken references in a do_for_each_ref*() iteration: */
588 #define DO_FOR_EACH_INCLUDE_BROKEN 0x01
591 * Return true iff the reference described by entry can be resolved to
592 * an object in the database. Emit a warning if the referred-to
593 * object does not exist.
595 static int ref_resolves_to_object(struct ref_entry
*entry
)
597 if (entry
->flag
& REF_ISBROKEN
)
599 if (!has_sha1_file(entry
->u
.value
.sha1
)) {
600 error("%s does not point to a valid object!", entry
->name
);
607 * current_ref is a performance hack: when iterating over references
608 * using the for_each_ref*() functions, current_ref is set to the
609 * current reference's entry before calling the callback function. If
610 * the callback function calls peel_ref(), then peel_ref() first
611 * checks whether the reference to be peeled is the current reference
612 * (it usually is) and if so, returns that reference's peeled version
613 * if it is available. This avoids a refname lookup in a common case.
615 static struct ref_entry
*current_ref
;
617 typedef int each_ref_entry_fn(struct ref_entry
*entry
, void *cb_data
);
619 struct ref_entry_cb
{
628 * Handle one reference in a do_for_each_ref*()-style iteration,
629 * calling an each_ref_fn for each entry.
631 static int do_one_ref(struct ref_entry
*entry
, void *cb_data
)
633 struct ref_entry_cb
*data
= cb_data
;
635 if (prefixcmp(entry
->name
, data
->base
))
638 if (!(data
->flags
& DO_FOR_EACH_INCLUDE_BROKEN
) &&
639 !ref_resolves_to_object(entry
))
643 retval
= data
->fn(entry
->name
+ data
->trim
, entry
->u
.value
.sha1
,
644 entry
->flag
, data
->cb_data
);
650 * Call fn for each reference in dir that has index in the range
651 * offset <= index < dir->nr. Recurse into subdirectories that are in
652 * that index range, sorting them before iterating. This function
653 * does not sort dir itself; it should be sorted beforehand. fn is
654 * called for all references, including broken ones.
656 static int do_for_each_entry_in_dir(struct ref_dir
*dir
, int offset
,
657 each_ref_entry_fn fn
, void *cb_data
)
660 assert(dir
->sorted
== dir
->nr
);
661 for (i
= offset
; i
< dir
->nr
; i
++) {
662 struct ref_entry
*entry
= dir
->entries
[i
];
664 if (entry
->flag
& REF_DIR
) {
665 struct ref_dir
*subdir
= get_ref_dir(entry
);
666 sort_ref_dir(subdir
);
667 retval
= do_for_each_entry_in_dir(subdir
, 0, fn
, cb_data
);
669 retval
= fn(entry
, cb_data
);
678 * Call fn for each reference in the union of dir1 and dir2, in order
679 * by refname. Recurse into subdirectories. If a value entry appears
680 * in both dir1 and dir2, then only process the version that is in
681 * dir2. The input dirs must already be sorted, but subdirs will be
682 * sorted as needed. fn is called for all references, including
685 static int do_for_each_entry_in_dirs(struct ref_dir
*dir1
,
686 struct ref_dir
*dir2
,
687 each_ref_entry_fn fn
, void *cb_data
)
692 assert(dir1
->sorted
== dir1
->nr
);
693 assert(dir2
->sorted
== dir2
->nr
);
695 struct ref_entry
*e1
, *e2
;
697 if (i1
== dir1
->nr
) {
698 return do_for_each_entry_in_dir(dir2
, i2
, fn
, cb_data
);
700 if (i2
== dir2
->nr
) {
701 return do_for_each_entry_in_dir(dir1
, i1
, fn
, cb_data
);
703 e1
= dir1
->entries
[i1
];
704 e2
= dir2
->entries
[i2
];
705 cmp
= strcmp(e1
->name
, e2
->name
);
707 if ((e1
->flag
& REF_DIR
) && (e2
->flag
& REF_DIR
)) {
708 /* Both are directories; descend them in parallel. */
709 struct ref_dir
*subdir1
= get_ref_dir(e1
);
710 struct ref_dir
*subdir2
= get_ref_dir(e2
);
711 sort_ref_dir(subdir1
);
712 sort_ref_dir(subdir2
);
713 retval
= do_for_each_entry_in_dirs(
714 subdir1
, subdir2
, fn
, cb_data
);
717 } else if (!(e1
->flag
& REF_DIR
) && !(e2
->flag
& REF_DIR
)) {
718 /* Both are references; ignore the one from dir1. */
719 retval
= fn(e2
, cb_data
);
723 die("conflict between reference and directory: %s",
735 if (e
->flag
& REF_DIR
) {
736 struct ref_dir
*subdir
= get_ref_dir(e
);
737 sort_ref_dir(subdir
);
738 retval
= do_for_each_entry_in_dir(
739 subdir
, 0, fn
, cb_data
);
741 retval
= fn(e
, cb_data
);
750 * Return true iff refname1 and refname2 conflict with each other.
751 * Two reference names conflict if one of them exactly matches the
752 * leading components of the other; e.g., "foo/bar" conflicts with
753 * both "foo" and with "foo/bar/baz" but not with "foo/bar" or
756 static int names_conflict(const char *refname1
, const char *refname2
)
758 for (; *refname1
&& *refname1
== *refname2
; refname1
++, refname2
++)
760 return (*refname1
== '\0' && *refname2
== '/')
761 || (*refname1
== '/' && *refname2
== '\0');
764 struct name_conflict_cb
{
766 const char *oldrefname
;
767 const char *conflicting_refname
;
770 static int name_conflict_fn(struct ref_entry
*entry
, void *cb_data
)
772 struct name_conflict_cb
*data
= (struct name_conflict_cb
*)cb_data
;
773 if (data
->oldrefname
&& !strcmp(data
->oldrefname
, entry
->name
))
775 if (names_conflict(data
->refname
, entry
->name
)) {
776 data
->conflicting_refname
= entry
->name
;
783 * Return true iff a reference named refname could be created without
784 * conflicting with the name of an existing reference in dir. If
785 * oldrefname is non-NULL, ignore potential conflicts with oldrefname
786 * (e.g., because oldrefname is scheduled for deletion in the same
789 static int is_refname_available(const char *refname
, const char *oldrefname
,
792 struct name_conflict_cb data
;
793 data
.refname
= refname
;
794 data
.oldrefname
= oldrefname
;
795 data
.conflicting_refname
= NULL
;
798 if (do_for_each_entry_in_dir(dir
, 0, name_conflict_fn
, &data
)) {
799 error("'%s' exists; cannot create '%s'",
800 data
.conflicting_refname
, refname
);
807 * Future: need to be in "struct repository"
808 * when doing a full libification.
810 static struct ref_cache
{
811 struct ref_cache
*next
;
812 struct ref_entry
*loose
;
813 struct ref_entry
*packed
;
814 /* The submodule name, or "" for the main repo. */
815 char name
[FLEX_ARRAY
];
818 static void clear_packed_ref_cache(struct ref_cache
*refs
)
821 free_ref_entry(refs
->packed
);
826 static void clear_loose_ref_cache(struct ref_cache
*refs
)
829 free_ref_entry(refs
->loose
);
834 static struct ref_cache
*create_ref_cache(const char *submodule
)
837 struct ref_cache
*refs
;
840 len
= strlen(submodule
) + 1;
841 refs
= xcalloc(1, sizeof(struct ref_cache
) + len
);
842 memcpy(refs
->name
, submodule
, len
);
847 * Return a pointer to a ref_cache for the specified submodule. For
848 * the main repository, use submodule==NULL. The returned structure
849 * will be allocated and initialized but not necessarily populated; it
850 * should not be freed.
852 static struct ref_cache
*get_ref_cache(const char *submodule
)
854 struct ref_cache
*refs
= ref_cache
;
858 if (!strcmp(submodule
, refs
->name
))
863 refs
= create_ref_cache(submodule
);
864 refs
->next
= ref_cache
;
869 void invalidate_ref_cache(const char *submodule
)
871 struct ref_cache
*refs
= get_ref_cache(submodule
);
872 clear_packed_ref_cache(refs
);
873 clear_loose_ref_cache(refs
);
876 /* The length of a peeled reference line in packed-refs, including EOL: */
877 #define PEELED_LINE_LENGTH 42
880 * The packed-refs header line that we write out. Perhaps other
881 * traits will be added later. The trailing space is required.
883 static const char PACKED_REFS_HEADER
[] =
884 "# pack-refs with: peeled fully-peeled \n";
887 * Parse one line from a packed-refs file. Write the SHA1 to sha1.
888 * Return a pointer to the refname within the line (null-terminated),
889 * or NULL if there was a problem.
891 static const char *parse_ref_line(char *line
, unsigned char *sha1
)
894 * 42: the answer to everything.
896 * In this case, it happens to be the answer to
897 * 40 (length of sha1 hex representation)
898 * +1 (space in between hex and name)
899 * +1 (newline at the end of the line)
901 int len
= strlen(line
) - 42;
905 if (get_sha1_hex(line
, sha1
) < 0)
907 if (!isspace(line
[40]))
912 if (line
[len
] != '\n')
920 * Read f, which is a packed-refs file, into dir.
922 * A comment line of the form "# pack-refs with: " may contain zero or
923 * more traits. We interpret the traits as follows:
927 * Probably no references are peeled. But if the file contains a
928 * peeled value for a reference, we will use it.
932 * References under "refs/tags/", if they *can* be peeled, *are*
933 * peeled in this file. References outside of "refs/tags/" are
934 * probably not peeled even if they could have been, but if we find
935 * a peeled value for such a reference we will use it.
939 * All references in the file that can be peeled are peeled.
940 * Inversely (and this is more important), any references in the
941 * file for which no peeled value is recorded is not peelable. This
942 * trait should typically be written alongside "peeled" for
943 * compatibility with older clients, but we do not require it
944 * (i.e., "peeled" is a no-op if "fully-peeled" is set).
946 static void read_packed_refs(FILE *f
, struct ref_dir
*dir
)
948 struct ref_entry
*last
= NULL
;
949 char refline
[PATH_MAX
];
950 enum { PEELED_NONE
, PEELED_TAGS
, PEELED_FULLY
} peeled
= PEELED_NONE
;
952 while (fgets(refline
, sizeof(refline
), f
)) {
953 unsigned char sha1
[20];
955 static const char header
[] = "# pack-refs with:";
957 if (!strncmp(refline
, header
, sizeof(header
)-1)) {
958 const char *traits
= refline
+ sizeof(header
) - 1;
959 if (strstr(traits
, " fully-peeled "))
960 peeled
= PEELED_FULLY
;
961 else if (strstr(traits
, " peeled "))
962 peeled
= PEELED_TAGS
;
963 /* perhaps other traits later as well */
967 refname
= parse_ref_line(refline
, sha1
);
969 last
= create_ref_entry(refname
, sha1
, REF_ISPACKED
, 1);
970 if (peeled
== PEELED_FULLY
||
971 (peeled
== PEELED_TAGS
&& !prefixcmp(refname
, "refs/tags/")))
972 last
->flag
|= REF_KNOWS_PEELED
;
978 strlen(refline
) == PEELED_LINE_LENGTH
&&
979 refline
[PEELED_LINE_LENGTH
- 1] == '\n' &&
980 !get_sha1_hex(refline
+ 1, sha1
)) {
981 hashcpy(last
->u
.value
.peeled
, sha1
);
983 * Regardless of what the file header said,
984 * we definitely know the value of *this*
987 last
->flag
|= REF_KNOWS_PEELED
;
992 static struct ref_dir
*get_packed_refs(struct ref_cache
*refs
)
995 const char *packed_refs_file
;
998 refs
->packed
= create_dir_entry(refs
, "", 0, 0);
1000 packed_refs_file
= git_path_submodule(refs
->name
, "packed-refs");
1002 packed_refs_file
= git_path("packed-refs");
1003 f
= fopen(packed_refs_file
, "r");
1005 read_packed_refs(f
, get_ref_dir(refs
->packed
));
1009 return get_ref_dir(refs
->packed
);
1012 void add_packed_ref(const char *refname
, const unsigned char *sha1
)
1014 add_ref(get_packed_refs(get_ref_cache(NULL
)),
1015 create_ref_entry(refname
, sha1
, REF_ISPACKED
, 1));
1019 * Read the loose references from the namespace dirname into dir
1020 * (without recursing). dirname must end with '/'. dir must be the
1021 * directory entry corresponding to dirname.
1023 static void read_loose_refs(const char *dirname
, struct ref_dir
*dir
)
1025 struct ref_cache
*refs
= dir
->ref_cache
;
1029 int dirnamelen
= strlen(dirname
);
1030 struct strbuf refname
;
1033 path
= git_path_submodule(refs
->name
, "%s", dirname
);
1035 path
= git_path("%s", dirname
);
1041 strbuf_init(&refname
, dirnamelen
+ 257);
1042 strbuf_add(&refname
, dirname
, dirnamelen
);
1044 while ((de
= readdir(d
)) != NULL
) {
1045 unsigned char sha1
[20];
1050 if (de
->d_name
[0] == '.')
1052 if (has_extension(de
->d_name
, ".lock"))
1054 strbuf_addstr(&refname
, de
->d_name
);
1055 refdir
= *refs
->name
1056 ? git_path_submodule(refs
->name
, "%s", refname
.buf
)
1057 : git_path("%s", refname
.buf
);
1058 if (stat(refdir
, &st
) < 0) {
1059 ; /* silently ignore */
1060 } else if (S_ISDIR(st
.st_mode
)) {
1061 strbuf_addch(&refname
, '/');
1062 add_entry_to_dir(dir
,
1063 create_dir_entry(refs
, refname
.buf
,
1069 if (resolve_gitlink_ref(refs
->name
, refname
.buf
, sha1
) < 0) {
1071 flag
|= REF_ISBROKEN
;
1073 } else if (read_ref_full(refname
.buf
, sha1
, 1, &flag
)) {
1075 flag
|= REF_ISBROKEN
;
1077 add_entry_to_dir(dir
,
1078 create_ref_entry(refname
.buf
, sha1
, flag
, 1));
1080 strbuf_setlen(&refname
, dirnamelen
);
1082 strbuf_release(&refname
);
1086 static struct ref_dir
*get_loose_refs(struct ref_cache
*refs
)
1090 * Mark the top-level directory complete because we
1091 * are about to read the only subdirectory that can
1094 refs
->loose
= create_dir_entry(refs
, "", 0, 0);
1096 * Create an incomplete entry for "refs/":
1098 add_entry_to_dir(get_ref_dir(refs
->loose
),
1099 create_dir_entry(refs
, "refs/", 5, 1));
1101 return get_ref_dir(refs
->loose
);
1104 /* We allow "recursive" symbolic refs. Only within reason, though */
1106 #define MAXREFLEN (1024)
1109 * Called by resolve_gitlink_ref_recursive() after it failed to read
1110 * from the loose refs in ref_cache refs. Find <refname> in the
1111 * packed-refs file for the submodule.
1113 static int resolve_gitlink_packed_ref(struct ref_cache
*refs
,
1114 const char *refname
, unsigned char *sha1
)
1116 struct ref_entry
*ref
;
1117 struct ref_dir
*dir
= get_packed_refs(refs
);
1119 ref
= find_ref(dir
, refname
);
1123 memcpy(sha1
, ref
->u
.value
.sha1
, 20);
1127 static int resolve_gitlink_ref_recursive(struct ref_cache
*refs
,
1128 const char *refname
, unsigned char *sha1
,
1132 char buffer
[128], *p
;
1135 if (recursion
> MAXDEPTH
|| strlen(refname
) > MAXREFLEN
)
1138 ? git_path_submodule(refs
->name
, "%s", refname
)
1139 : git_path("%s", refname
);
1140 fd
= open(path
, O_RDONLY
);
1142 return resolve_gitlink_packed_ref(refs
, refname
, sha1
);
1144 len
= read(fd
, buffer
, sizeof(buffer
)-1);
1148 while (len
&& isspace(buffer
[len
-1]))
1152 /* Was it a detached head or an old-fashioned symlink? */
1153 if (!get_sha1_hex(buffer
, sha1
))
1157 if (strncmp(buffer
, "ref:", 4))
1163 return resolve_gitlink_ref_recursive(refs
, p
, sha1
, recursion
+1);
1166 int resolve_gitlink_ref(const char *path
, const char *refname
, unsigned char *sha1
)
1168 int len
= strlen(path
), retval
;
1170 struct ref_cache
*refs
;
1172 while (len
&& path
[len
-1] == '/')
1176 submodule
= xstrndup(path
, len
);
1177 refs
= get_ref_cache(submodule
);
1180 retval
= resolve_gitlink_ref_recursive(refs
, refname
, sha1
, 0);
1185 * Return the ref_entry for the given refname from the packed
1186 * references. If it does not exist, return NULL.
1188 static struct ref_entry
*get_packed_ref(const char *refname
)
1190 return find_ref(get_packed_refs(get_ref_cache(NULL
)), refname
);
1193 const char *resolve_ref_unsafe(const char *refname
, unsigned char *sha1
, int reading
, int *flag
)
1195 int depth
= MAXDEPTH
;
1198 static char refname_buffer
[256];
1203 if (check_refname_format(refname
, REFNAME_ALLOW_ONELEVEL
))
1207 char path
[PATH_MAX
];
1215 git_snpath(path
, sizeof(path
), "%s", refname
);
1217 if (lstat(path
, &st
) < 0) {
1218 struct ref_entry
*entry
;
1220 if (errno
!= ENOENT
)
1223 * The loose reference file does not exist;
1224 * check for a packed reference.
1226 entry
= get_packed_ref(refname
);
1228 hashcpy(sha1
, entry
->u
.value
.sha1
);
1230 *flag
|= REF_ISPACKED
;
1233 /* The reference is not a packed reference, either. */
1242 /* Follow "normalized" - ie "refs/.." symlinks by hand */
1243 if (S_ISLNK(st
.st_mode
)) {
1244 len
= readlink(path
, buffer
, sizeof(buffer
)-1);
1248 if (!prefixcmp(buffer
, "refs/") &&
1249 !check_refname_format(buffer
, 0)) {
1250 strcpy(refname_buffer
, buffer
);
1251 refname
= refname_buffer
;
1253 *flag
|= REF_ISSYMREF
;
1258 /* Is it a directory? */
1259 if (S_ISDIR(st
.st_mode
)) {
1265 * Anything else, just open it and try to use it as
1268 fd
= open(path
, O_RDONLY
);
1271 len
= read_in_full(fd
, buffer
, sizeof(buffer
)-1);
1275 while (len
&& isspace(buffer
[len
-1]))
1280 * Is it a symbolic ref?
1282 if (prefixcmp(buffer
, "ref:"))
1285 *flag
|= REF_ISSYMREF
;
1287 while (isspace(*buf
))
1289 if (check_refname_format(buf
, REFNAME_ALLOW_ONELEVEL
)) {
1291 *flag
|= REF_ISBROKEN
;
1294 refname
= strcpy(refname_buffer
, buf
);
1296 /* Please note that FETCH_HEAD has a second line containing other data. */
1297 if (get_sha1_hex(buffer
, sha1
) || (buffer
[40] != '\0' && !isspace(buffer
[40]))) {
1299 *flag
|= REF_ISBROKEN
;
1305 char *resolve_refdup(const char *ref
, unsigned char *sha1
, int reading
, int *flag
)
1307 const char *ret
= resolve_ref_unsafe(ref
, sha1
, reading
, flag
);
1308 return ret
? xstrdup(ret
) : NULL
;
1311 /* The argument to filter_refs */
1313 const char *pattern
;
1318 int read_ref_full(const char *refname
, unsigned char *sha1
, int reading
, int *flags
)
1320 if (resolve_ref_unsafe(refname
, sha1
, reading
, flags
))
1325 int read_ref(const char *refname
, unsigned char *sha1
)
1327 return read_ref_full(refname
, sha1
, 1, NULL
);
1330 int ref_exists(const char *refname
)
1332 unsigned char sha1
[20];
1333 return !!resolve_ref_unsafe(refname
, sha1
, 1, NULL
);
1336 static int filter_refs(const char *refname
, const unsigned char *sha1
, int flags
,
1339 struct ref_filter
*filter
= (struct ref_filter
*)data
;
1340 if (fnmatch(filter
->pattern
, refname
, 0))
1342 return filter
->fn(refname
, sha1
, flags
, filter
->cb_data
);
1346 /* object was peeled successfully: */
1350 * object cannot be peeled because the named object (or an
1351 * object referred to by a tag in the peel chain), does not
1356 /* object cannot be peeled because it is not a tag: */
1359 /* ref_entry contains no peeled value because it is a symref: */
1360 PEEL_IS_SYMREF
= -3,
1363 * ref_entry cannot be peeled because it is broken (i.e., the
1364 * symbolic reference cannot even be resolved to an object
1371 * Peel the named object; i.e., if the object is a tag, resolve the
1372 * tag recursively until a non-tag is found. If successful, store the
1373 * result to sha1 and return PEEL_PEELED. If the object is not a tag
1374 * or is not valid, return PEEL_NON_TAG or PEEL_INVALID, respectively,
1375 * and leave sha1 unchanged.
1377 static enum peel_status
peel_object(const unsigned char *name
, unsigned char *sha1
)
1379 struct object
*o
= lookup_unknown_object(name
);
1381 if (o
->type
== OBJ_NONE
) {
1382 int type
= sha1_object_info(name
, NULL
);
1384 return PEEL_INVALID
;
1388 if (o
->type
!= OBJ_TAG
)
1389 return PEEL_NON_TAG
;
1391 o
= deref_tag_noverify(o
);
1393 return PEEL_INVALID
;
1395 hashcpy(sha1
, o
->sha1
);
1400 * Peel the entry (if possible) and return its new peel_status. If
1401 * repeel is true, re-peel the entry even if there is an old peeled
1402 * value that is already stored in it.
1404 * It is OK to call this function with a packed reference entry that
1405 * might be stale and might even refer to an object that has since
1406 * been garbage-collected. In such a case, if the entry has
1407 * REF_KNOWS_PEELED then leave the status unchanged and return
1408 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.
1410 static enum peel_status
peel_entry(struct ref_entry
*entry
, int repeel
)
1412 enum peel_status status
;
1414 if (entry
->flag
& REF_KNOWS_PEELED
) {
1416 entry
->flag
&= ~REF_KNOWS_PEELED
;
1417 hashclr(entry
->u
.value
.peeled
);
1419 return is_null_sha1(entry
->u
.value
.peeled
) ?
1420 PEEL_NON_TAG
: PEEL_PEELED
;
1423 if (entry
->flag
& REF_ISBROKEN
)
1425 if (entry
->flag
& REF_ISSYMREF
)
1426 return PEEL_IS_SYMREF
;
1428 status
= peel_object(entry
->u
.value
.sha1
, entry
->u
.value
.peeled
);
1429 if (status
== PEEL_PEELED
|| status
== PEEL_NON_TAG
)
1430 entry
->flag
|= REF_KNOWS_PEELED
;
1434 int peel_ref(const char *refname
, unsigned char *sha1
)
1437 unsigned char base
[20];
1439 if (current_ref
&& (current_ref
->name
== refname
1440 || !strcmp(current_ref
->name
, refname
))) {
1441 if (peel_entry(current_ref
, 0))
1443 hashcpy(sha1
, current_ref
->u
.value
.peeled
);
1447 if (read_ref_full(refname
, base
, 1, &flag
))
1451 * If the reference is packed, read its ref_entry from the
1452 * cache in the hope that we already know its peeled value.
1453 * We only try this optimization on packed references because
1454 * (a) forcing the filling of the loose reference cache could
1455 * be expensive and (b) loose references anyway usually do not
1456 * have REF_KNOWS_PEELED.
1458 if (flag
& REF_ISPACKED
) {
1459 struct ref_entry
*r
= get_packed_ref(refname
);
1461 if (peel_entry(r
, 0))
1463 hashcpy(sha1
, r
->u
.value
.peeled
);
1468 return peel_object(base
, sha1
);
1471 struct warn_if_dangling_data
{
1473 const char *refname
;
1474 const char *msg_fmt
;
1477 static int warn_if_dangling_symref(const char *refname
, const unsigned char *sha1
,
1478 int flags
, void *cb_data
)
1480 struct warn_if_dangling_data
*d
= cb_data
;
1481 const char *resolves_to
;
1482 unsigned char junk
[20];
1484 if (!(flags
& REF_ISSYMREF
))
1487 resolves_to
= resolve_ref_unsafe(refname
, junk
, 0, NULL
);
1488 if (!resolves_to
|| strcmp(resolves_to
, d
->refname
))
1491 fprintf(d
->fp
, d
->msg_fmt
, refname
);
1496 void warn_dangling_symref(FILE *fp
, const char *msg_fmt
, const char *refname
)
1498 struct warn_if_dangling_data data
;
1501 data
.refname
= refname
;
1502 data
.msg_fmt
= msg_fmt
;
1503 for_each_rawref(warn_if_dangling_symref
, &data
);
1507 * Call fn for each reference in the specified ref_cache, omitting
1508 * references not in the containing_dir of base. fn is called for all
1509 * references, including broken ones. If fn ever returns a non-zero
1510 * value, stop the iteration and return that value; otherwise, return
1513 static int do_for_each_entry(struct ref_cache
*refs
, const char *base
,
1514 each_ref_entry_fn fn
, void *cb_data
)
1516 struct ref_dir
*packed_dir
= get_packed_refs(refs
);
1517 struct ref_dir
*loose_dir
= get_loose_refs(refs
);
1520 if (base
&& *base
) {
1521 packed_dir
= find_containing_dir(packed_dir
, base
, 0);
1522 loose_dir
= find_containing_dir(loose_dir
, base
, 0);
1525 if (packed_dir
&& loose_dir
) {
1526 sort_ref_dir(packed_dir
);
1527 sort_ref_dir(loose_dir
);
1528 retval
= do_for_each_entry_in_dirs(
1529 packed_dir
, loose_dir
, fn
, cb_data
);
1530 } else if (packed_dir
) {
1531 sort_ref_dir(packed_dir
);
1532 retval
= do_for_each_entry_in_dir(
1533 packed_dir
, 0, fn
, cb_data
);
1534 } else if (loose_dir
) {
1535 sort_ref_dir(loose_dir
);
1536 retval
= do_for_each_entry_in_dir(
1537 loose_dir
, 0, fn
, cb_data
);
1544 * Call fn for each reference in the specified ref_cache for which the
1545 * refname begins with base. If trim is non-zero, then trim that many
1546 * characters off the beginning of each refname before passing the
1547 * refname to fn. flags can be DO_FOR_EACH_INCLUDE_BROKEN to include
1548 * broken references in the iteration. If fn ever returns a non-zero
1549 * value, stop the iteration and return that value; otherwise, return
1552 static int do_for_each_ref(struct ref_cache
*refs
, const char *base
,
1553 each_ref_fn fn
, int trim
, int flags
, void *cb_data
)
1555 struct ref_entry_cb data
;
1560 data
.cb_data
= cb_data
;
1562 return do_for_each_entry(refs
, base
, do_one_ref
, &data
);
1565 static int do_head_ref(const char *submodule
, each_ref_fn fn
, void *cb_data
)
1567 unsigned char sha1
[20];
1571 if (resolve_gitlink_ref(submodule
, "HEAD", sha1
) == 0)
1572 return fn("HEAD", sha1
, 0, cb_data
);
1577 if (!read_ref_full("HEAD", sha1
, 1, &flag
))
1578 return fn("HEAD", sha1
, flag
, cb_data
);
1583 int head_ref(each_ref_fn fn
, void *cb_data
)
1585 return do_head_ref(NULL
, fn
, cb_data
);
1588 int head_ref_submodule(const char *submodule
, each_ref_fn fn
, void *cb_data
)
1590 return do_head_ref(submodule
, fn
, cb_data
);
1593 int for_each_ref(each_ref_fn fn
, void *cb_data
)
1595 return do_for_each_ref(get_ref_cache(NULL
), "", fn
, 0, 0, cb_data
);
1598 int for_each_ref_submodule(const char *submodule
, each_ref_fn fn
, void *cb_data
)
1600 return do_for_each_ref(get_ref_cache(submodule
), "", fn
, 0, 0, cb_data
);
1603 int for_each_ref_in(const char *prefix
, each_ref_fn fn
, void *cb_data
)
1605 return do_for_each_ref(get_ref_cache(NULL
), prefix
, fn
, strlen(prefix
), 0, cb_data
);
1608 int for_each_ref_in_submodule(const char *submodule
, const char *prefix
,
1609 each_ref_fn fn
, void *cb_data
)
1611 return do_for_each_ref(get_ref_cache(submodule
), prefix
, fn
, strlen(prefix
), 0, cb_data
);
1614 int for_each_tag_ref(each_ref_fn fn
, void *cb_data
)
1616 return for_each_ref_in("refs/tags/", fn
, cb_data
);
1619 int for_each_tag_ref_submodule(const char *submodule
, each_ref_fn fn
, void *cb_data
)
1621 return for_each_ref_in_submodule(submodule
, "refs/tags/", fn
, cb_data
);
1624 int for_each_branch_ref(each_ref_fn fn
, void *cb_data
)
1626 return for_each_ref_in("refs/heads/", fn
, cb_data
);
1629 int for_each_branch_ref_submodule(const char *submodule
, each_ref_fn fn
, void *cb_data
)
1631 return for_each_ref_in_submodule(submodule
, "refs/heads/", fn
, cb_data
);
1634 int for_each_remote_ref(each_ref_fn fn
, void *cb_data
)
1636 return for_each_ref_in("refs/remotes/", fn
, cb_data
);
1639 int for_each_remote_ref_submodule(const char *submodule
, each_ref_fn fn
, void *cb_data
)
1641 return for_each_ref_in_submodule(submodule
, "refs/remotes/", fn
, cb_data
);
1644 int for_each_replace_ref(each_ref_fn fn
, void *cb_data
)
1646 return do_for_each_ref(get_ref_cache(NULL
), "refs/replace/", fn
, 13, 0, cb_data
);
1649 int head_ref_namespaced(each_ref_fn fn
, void *cb_data
)
1651 struct strbuf buf
= STRBUF_INIT
;
1653 unsigned char sha1
[20];
1656 strbuf_addf(&buf
, "%sHEAD", get_git_namespace());
1657 if (!read_ref_full(buf
.buf
, sha1
, 1, &flag
))
1658 ret
= fn(buf
.buf
, sha1
, flag
, cb_data
);
1659 strbuf_release(&buf
);
1664 int for_each_namespaced_ref(each_ref_fn fn
, void *cb_data
)
1666 struct strbuf buf
= STRBUF_INIT
;
1668 strbuf_addf(&buf
, "%srefs/", get_git_namespace());
1669 ret
= do_for_each_ref(get_ref_cache(NULL
), buf
.buf
, fn
, 0, 0, cb_data
);
1670 strbuf_release(&buf
);
1674 int for_each_glob_ref_in(each_ref_fn fn
, const char *pattern
,
1675 const char *prefix
, void *cb_data
)
1677 struct strbuf real_pattern
= STRBUF_INIT
;
1678 struct ref_filter filter
;
1681 if (!prefix
&& prefixcmp(pattern
, "refs/"))
1682 strbuf_addstr(&real_pattern
, "refs/");
1684 strbuf_addstr(&real_pattern
, prefix
);
1685 strbuf_addstr(&real_pattern
, pattern
);
1687 if (!has_glob_specials(pattern
)) {
1688 /* Append implied '/' '*' if not present. */
1689 if (real_pattern
.buf
[real_pattern
.len
- 1] != '/')
1690 strbuf_addch(&real_pattern
, '/');
1691 /* No need to check for '*', there is none. */
1692 strbuf_addch(&real_pattern
, '*');
1695 filter
.pattern
= real_pattern
.buf
;
1697 filter
.cb_data
= cb_data
;
1698 ret
= for_each_ref(filter_refs
, &filter
);
1700 strbuf_release(&real_pattern
);
1704 int for_each_glob_ref(each_ref_fn fn
, const char *pattern
, void *cb_data
)
1706 return for_each_glob_ref_in(fn
, pattern
, NULL
, cb_data
);
1709 int for_each_rawref(each_ref_fn fn
, void *cb_data
)
1711 return do_for_each_ref(get_ref_cache(NULL
), "", fn
, 0,
1712 DO_FOR_EACH_INCLUDE_BROKEN
, cb_data
);
1715 const char *prettify_refname(const char *name
)
1718 !prefixcmp(name
, "refs/heads/") ? 11 :
1719 !prefixcmp(name
, "refs/tags/") ? 10 :
1720 !prefixcmp(name
, "refs/remotes/") ? 13 :
1724 const char *ref_rev_parse_rules
[] = {
1729 "refs/remotes/%.*s",
1730 "refs/remotes/%.*s/HEAD",
1734 int refname_match(const char *abbrev_name
, const char *full_name
, const char **rules
)
1737 const int abbrev_name_len
= strlen(abbrev_name
);
1739 for (p
= rules
; *p
; p
++) {
1740 if (!strcmp(full_name
, mkpath(*p
, abbrev_name_len
, abbrev_name
))) {
1748 static struct ref_lock
*verify_lock(struct ref_lock
*lock
,
1749 const unsigned char *old_sha1
, int mustexist
)
1751 if (read_ref_full(lock
->ref_name
, lock
->old_sha1
, mustexist
, NULL
)) {
1752 error("Can't verify ref %s", lock
->ref_name
);
1756 if (hashcmp(lock
->old_sha1
, old_sha1
)) {
1757 error("Ref %s is at %s but expected %s", lock
->ref_name
,
1758 sha1_to_hex(lock
->old_sha1
), sha1_to_hex(old_sha1
));
1765 static int remove_empty_directories(const char *file
)
1767 /* we want to create a file but there is a directory there;
1768 * if that is an empty directory (or a directory that contains
1769 * only empty directories), remove them.
1774 strbuf_init(&path
, 20);
1775 strbuf_addstr(&path
, file
);
1777 result
= remove_dir_recursively(&path
, REMOVE_DIR_EMPTY_ONLY
);
1779 strbuf_release(&path
);
1785 * *string and *len will only be substituted, and *string returned (for
1786 * later free()ing) if the string passed in is a magic short-hand form
1789 static char *substitute_branch_name(const char **string
, int *len
)
1791 struct strbuf buf
= STRBUF_INIT
;
1792 int ret
= interpret_branch_name(*string
, &buf
);
1796 *string
= strbuf_detach(&buf
, &size
);
1798 return (char *)*string
;
1804 int dwim_ref(const char *str
, int len
, unsigned char *sha1
, char **ref
)
1806 char *last_branch
= substitute_branch_name(&str
, &len
);
1811 for (p
= ref_rev_parse_rules
; *p
; p
++) {
1812 char fullref
[PATH_MAX
];
1813 unsigned char sha1_from_ref
[20];
1814 unsigned char *this_result
;
1817 this_result
= refs_found
? sha1_from_ref
: sha1
;
1818 mksnpath(fullref
, sizeof(fullref
), *p
, len
, str
);
1819 r
= resolve_ref_unsafe(fullref
, this_result
, 1, &flag
);
1823 if (!warn_ambiguous_refs
)
1825 } else if ((flag
& REF_ISSYMREF
) && strcmp(fullref
, "HEAD")) {
1826 warning("ignoring dangling symref %s.", fullref
);
1827 } else if ((flag
& REF_ISBROKEN
) && strchr(fullref
, '/')) {
1828 warning("ignoring broken ref %s.", fullref
);
1835 int dwim_log(const char *str
, int len
, unsigned char *sha1
, char **log
)
1837 char *last_branch
= substitute_branch_name(&str
, &len
);
1842 for (p
= ref_rev_parse_rules
; *p
; p
++) {
1844 unsigned char hash
[20];
1845 char path
[PATH_MAX
];
1846 const char *ref
, *it
;
1848 mksnpath(path
, sizeof(path
), *p
, len
, str
);
1849 ref
= resolve_ref_unsafe(path
, hash
, 1, NULL
);
1852 if (!stat(git_path("logs/%s", path
), &st
) &&
1853 S_ISREG(st
.st_mode
))
1855 else if (strcmp(ref
, path
) &&
1856 !stat(git_path("logs/%s", ref
), &st
) &&
1857 S_ISREG(st
.st_mode
))
1861 if (!logs_found
++) {
1863 hashcpy(sha1
, hash
);
1865 if (!warn_ambiguous_refs
)
1872 static struct ref_lock
*lock_ref_sha1_basic(const char *refname
,
1873 const unsigned char *old_sha1
,
1874 int flags
, int *type_p
)
1877 const char *orig_refname
= refname
;
1878 struct ref_lock
*lock
;
1881 int mustexist
= (old_sha1
&& !is_null_sha1(old_sha1
));
1884 lock
= xcalloc(1, sizeof(struct ref_lock
));
1887 refname
= resolve_ref_unsafe(refname
, lock
->old_sha1
, mustexist
, &type
);
1888 if (!refname
&& errno
== EISDIR
) {
1889 /* we are trying to lock foo but we used to
1890 * have foo/bar which now does not exist;
1891 * it is normal for the empty directory 'foo'
1894 ref_file
= git_path("%s", orig_refname
);
1895 if (remove_empty_directories(ref_file
)) {
1897 error("there are still refs under '%s'", orig_refname
);
1900 refname
= resolve_ref_unsafe(orig_refname
, lock
->old_sha1
, mustexist
, &type
);
1906 error("unable to resolve reference %s: %s",
1907 orig_refname
, strerror(errno
));
1910 missing
= is_null_sha1(lock
->old_sha1
);
1911 /* When the ref did not exist and we are creating it,
1912 * make sure there is no existing ref that is packed
1913 * whose name begins with our refname, nor a ref whose
1914 * name is a proper prefix of our refname.
1917 !is_refname_available(refname
, NULL
, get_packed_refs(get_ref_cache(NULL
)))) {
1918 last_errno
= ENOTDIR
;
1922 lock
->lk
= xcalloc(1, sizeof(struct lock_file
));
1924 lflags
= LOCK_DIE_ON_ERROR
;
1925 if (flags
& REF_NODEREF
) {
1926 refname
= orig_refname
;
1927 lflags
|= LOCK_NODEREF
;
1929 lock
->ref_name
= xstrdup(refname
);
1930 lock
->orig_ref_name
= xstrdup(orig_refname
);
1931 ref_file
= git_path("%s", refname
);
1933 lock
->force_write
= 1;
1934 if ((flags
& REF_NODEREF
) && (type
& REF_ISSYMREF
))
1935 lock
->force_write
= 1;
1937 if (safe_create_leading_directories(ref_file
)) {
1939 error("unable to create directory for %s", ref_file
);
1943 lock
->lock_fd
= hold_lock_file_for_update(lock
->lk
, ref_file
, lflags
);
1944 return old_sha1
? verify_lock(lock
, old_sha1
, mustexist
) : lock
;
1952 struct ref_lock
*lock_ref_sha1(const char *refname
, const unsigned char *old_sha1
)
1954 char refpath
[PATH_MAX
];
1955 if (check_refname_format(refname
, 0))
1957 strcpy(refpath
, mkpath("refs/%s", refname
));
1958 return lock_ref_sha1_basic(refpath
, old_sha1
, 0, NULL
);
1961 struct ref_lock
*lock_any_ref_for_update(const char *refname
,
1962 const unsigned char *old_sha1
, int flags
)
1964 if (check_refname_format(refname
, REFNAME_ALLOW_ONELEVEL
))
1966 return lock_ref_sha1_basic(refname
, old_sha1
, flags
, NULL
);
1970 * Write an entry to the packed-refs file for the specified refname.
1971 * If peeled is non-NULL, write it as the entry's peeled value.
1973 static void write_packed_entry(int fd
, char *refname
, unsigned char *sha1
,
1974 unsigned char *peeled
)
1976 char line
[PATH_MAX
+ 100];
1979 len
= snprintf(line
, sizeof(line
), "%s %s\n",
1980 sha1_to_hex(sha1
), refname
);
1981 /* this should not happen but just being defensive */
1982 if (len
> sizeof(line
))
1983 die("too long a refname '%s'", refname
);
1984 write_or_die(fd
, line
, len
);
1987 if (snprintf(line
, sizeof(line
), "^%s\n",
1988 sha1_to_hex(peeled
)) != PEELED_LINE_LENGTH
)
1989 die("internal error");
1990 write_or_die(fd
, line
, PEELED_LINE_LENGTH
);
1994 struct ref_to_prune
{
1995 struct ref_to_prune
*next
;
1996 unsigned char sha1
[20];
1997 char name
[FLEX_ARRAY
];
2000 struct pack_refs_cb_data
{
2002 struct ref_to_prune
*ref_to_prune
;
2006 static int pack_one_ref(struct ref_entry
*entry
, void *cb_data
)
2008 struct pack_refs_cb_data
*cb
= cb_data
;
2009 enum peel_status peel_status
;
2010 int is_tag_ref
= !prefixcmp(entry
->name
, "refs/tags/");
2012 /* ALWAYS pack refs that were already packed or are tags */
2013 if (!(cb
->flags
& PACK_REFS_ALL
) && !is_tag_ref
&&
2014 !(entry
->flag
& REF_ISPACKED
))
2017 /* Do not pack symbolic or broken refs: */
2018 if ((entry
->flag
& REF_ISSYMREF
) || !ref_resolves_to_object(entry
))
2021 peel_status
= peel_entry(entry
, 1);
2022 if (peel_status
!= PEEL_PEELED
&& peel_status
!= PEEL_NON_TAG
)
2023 die("internal error peeling reference %s (%s)",
2024 entry
->name
, sha1_to_hex(entry
->u
.value
.sha1
));
2025 write_packed_entry(cb
->fd
, entry
->name
, entry
->u
.value
.sha1
,
2026 peel_status
== PEEL_PEELED
?
2027 entry
->u
.value
.peeled
: NULL
);
2029 /* If the ref was already packed, there is no need to prune it. */
2030 if ((cb
->flags
& PACK_REFS_PRUNE
) && !(entry
->flag
& REF_ISPACKED
)) {
2031 int namelen
= strlen(entry
->name
) + 1;
2032 struct ref_to_prune
*n
= xcalloc(1, sizeof(*n
) + namelen
);
2033 hashcpy(n
->sha1
, entry
->u
.value
.sha1
);
2034 strcpy(n
->name
, entry
->name
);
2035 n
->next
= cb
->ref_to_prune
;
2036 cb
->ref_to_prune
= n
;
2042 * Remove empty parents, but spare refs/ and immediate subdirs.
2043 * Note: munges *name.
2045 static void try_remove_empty_parents(char *name
)
2050 for (i
= 0; i
< 2; i
++) { /* refs/{heads,tags,...}/ */
2051 while (*p
&& *p
!= '/')
2053 /* tolerate duplicate slashes; see check_refname_format() */
2057 for (q
= p
; *q
; q
++)
2060 while (q
> p
&& *q
!= '/')
2062 while (q
> p
&& *(q
-1) == '/')
2067 if (rmdir(git_path("%s", name
)))
2072 /* make sure nobody touched the ref, and unlink */
2073 static void prune_ref(struct ref_to_prune
*r
)
2075 struct ref_lock
*lock
= lock_ref_sha1(r
->name
+ 5, r
->sha1
);
2078 unlink_or_warn(git_path("%s", r
->name
));
2080 try_remove_empty_parents(r
->name
);
2084 static void prune_refs(struct ref_to_prune
*r
)
2092 static struct lock_file packlock
;
2094 int pack_refs(unsigned int flags
)
2096 struct pack_refs_cb_data cbdata
;
2098 memset(&cbdata
, 0, sizeof(cbdata
));
2099 cbdata
.flags
= flags
;
2101 cbdata
.fd
= hold_lock_file_for_update(&packlock
, git_path("packed-refs"),
2104 write_or_die(cbdata
.fd
, PACKED_REFS_HEADER
, strlen(PACKED_REFS_HEADER
));
2106 do_for_each_entry(get_ref_cache(NULL
), "", pack_one_ref
, &cbdata
);
2107 if (commit_lock_file(&packlock
) < 0)
2108 die_errno("unable to overwrite old ref-pack file");
2109 prune_refs(cbdata
.ref_to_prune
);
2113 static int repack_ref_fn(struct ref_entry
*entry
, void *cb_data
)
2116 enum peel_status peel_status
;
2118 if (entry
->flag
& REF_ISBROKEN
) {
2119 /* This shouldn't happen to packed refs. */
2120 error("%s is broken!", entry
->name
);
2123 if (!has_sha1_file(entry
->u
.value
.sha1
)) {
2124 unsigned char sha1
[20];
2127 if (read_ref_full(entry
->name
, sha1
, 0, &flags
))
2128 /* We should at least have found the packed ref. */
2129 die("Internal error");
2130 if ((flags
& REF_ISSYMREF
) || !(flags
& REF_ISPACKED
))
2132 * This packed reference is overridden by a
2133 * loose reference, so it is OK that its value
2134 * is no longer valid; for example, it might
2135 * refer to an object that has been garbage
2136 * collected. For this purpose we don't even
2137 * care whether the loose reference itself is
2138 * invalid, broken, symbolic, etc. Silently
2139 * omit the packed reference from the output.
2143 * There is no overriding loose reference, so the fact
2144 * that this reference doesn't refer to a valid object
2145 * indicates some kind of repository corruption.
2146 * Report the problem, then omit the reference from
2149 error("%s does not point to a valid object!", entry
->name
);
2153 peel_status
= peel_entry(entry
, 0);
2154 write_packed_entry(*fd
, entry
->name
, entry
->u
.value
.sha1
,
2155 peel_status
== PEEL_PEELED
?
2156 entry
->u
.value
.peeled
: NULL
);
2161 static int repack_without_ref(const char *refname
)
2164 struct ref_cache
*refs
= get_ref_cache(NULL
);
2165 struct ref_dir
*packed
;
2167 if (!get_packed_ref(refname
))
2168 return 0; /* refname does not exist in packed refs */
2170 fd
= hold_lock_file_for_update(&packlock
, git_path("packed-refs"), 0);
2172 unable_to_lock_error(git_path("packed-refs"), errno
);
2173 return error("cannot delete '%s' from packed refs", refname
);
2175 clear_packed_ref_cache(refs
);
2176 packed
= get_packed_refs(refs
);
2177 /* Remove refname from the cache. */
2178 if (remove_entry(packed
, refname
) == -1) {
2180 * The packed entry disappeared while we were
2181 * acquiring the lock.
2183 rollback_lock_file(&packlock
);
2186 write_or_die(fd
, PACKED_REFS_HEADER
, strlen(PACKED_REFS_HEADER
));
2187 do_for_each_entry_in_dir(packed
, 0, repack_ref_fn
, &fd
);
2188 return commit_lock_file(&packlock
);
2191 int delete_ref(const char *refname
, const unsigned char *sha1
, int delopt
)
2193 struct ref_lock
*lock
;
2194 int err
, i
= 0, ret
= 0, flag
= 0;
2196 lock
= lock_ref_sha1_basic(refname
, sha1
, delopt
, &flag
);
2199 if (!(flag
& REF_ISPACKED
) || flag
& REF_ISSYMREF
) {
2201 i
= strlen(lock
->lk
->filename
) - 5; /* .lock */
2202 lock
->lk
->filename
[i
] = 0;
2203 err
= unlink_or_warn(lock
->lk
->filename
);
2204 if (err
&& errno
!= ENOENT
)
2207 lock
->lk
->filename
[i
] = '.';
2209 /* removing the loose one could have resurrected an earlier
2210 * packed one. Also, if it was not loose we need to repack
2213 ret
|= repack_without_ref(lock
->ref_name
);
2215 unlink_or_warn(git_path("logs/%s", lock
->ref_name
));
2216 clear_loose_ref_cache(get_ref_cache(NULL
));
2222 * People using contrib's git-new-workdir have .git/logs/refs ->
2223 * /some/other/path/.git/logs/refs, and that may live on another device.
2225 * IOW, to avoid cross device rename errors, the temporary renamed log must
2226 * live into logs/refs.
2228 #define TMP_RENAMED_LOG "logs/refs/.tmp-renamed-log"
2230 int rename_ref(const char *oldrefname
, const char *newrefname
, const char *logmsg
)
2232 unsigned char sha1
[20], orig_sha1
[20];
2233 int flag
= 0, logmoved
= 0;
2234 struct ref_lock
*lock
;
2235 struct stat loginfo
;
2236 int log
= !lstat(git_path("logs/%s", oldrefname
), &loginfo
);
2237 const char *symref
= NULL
;
2238 struct ref_cache
*refs
= get_ref_cache(NULL
);
2240 if (log
&& S_ISLNK(loginfo
.st_mode
))
2241 return error("reflog for %s is a symlink", oldrefname
);
2243 symref
= resolve_ref_unsafe(oldrefname
, orig_sha1
, 1, &flag
);
2244 if (flag
& REF_ISSYMREF
)
2245 return error("refname %s is a symbolic ref, renaming it is not supported",
2248 return error("refname %s not found", oldrefname
);
2250 if (!is_refname_available(newrefname
, oldrefname
, get_packed_refs(refs
)))
2253 if (!is_refname_available(newrefname
, oldrefname
, get_loose_refs(refs
)))
2256 if (log
&& rename(git_path("logs/%s", oldrefname
), git_path(TMP_RENAMED_LOG
)))
2257 return error("unable to move logfile logs/%s to "TMP_RENAMED_LOG
": %s",
2258 oldrefname
, strerror(errno
));
2260 if (delete_ref(oldrefname
, orig_sha1
, REF_NODEREF
)) {
2261 error("unable to delete old %s", oldrefname
);
2265 if (!read_ref_full(newrefname
, sha1
, 1, &flag
) &&
2266 delete_ref(newrefname
, sha1
, REF_NODEREF
)) {
2267 if (errno
==EISDIR
) {
2268 if (remove_empty_directories(git_path("%s", newrefname
))) {
2269 error("Directory not empty: %s", newrefname
);
2273 error("unable to delete existing %s", newrefname
);
2278 if (log
&& safe_create_leading_directories(git_path("logs/%s", newrefname
))) {
2279 error("unable to create directory for %s", newrefname
);
2284 if (log
&& rename(git_path(TMP_RENAMED_LOG
), git_path("logs/%s", newrefname
))) {
2285 if (errno
==EISDIR
|| errno
==ENOTDIR
) {
2287 * rename(a, b) when b is an existing
2288 * directory ought to result in ISDIR, but
2289 * Solaris 5.8 gives ENOTDIR. Sheesh.
2291 if (remove_empty_directories(git_path("logs/%s", newrefname
))) {
2292 error("Directory not empty: logs/%s", newrefname
);
2297 error("unable to move logfile "TMP_RENAMED_LOG
" to logs/%s: %s",
2298 newrefname
, strerror(errno
));
2304 lock
= lock_ref_sha1_basic(newrefname
, NULL
, 0, NULL
);
2306 error("unable to lock %s for update", newrefname
);
2309 lock
->force_write
= 1;
2310 hashcpy(lock
->old_sha1
, orig_sha1
);
2311 if (write_ref_sha1(lock
, orig_sha1
, logmsg
)) {
2312 error("unable to write current sha1 into %s", newrefname
);
2319 lock
= lock_ref_sha1_basic(oldrefname
, NULL
, 0, NULL
);
2321 error("unable to lock %s for rollback", oldrefname
);
2325 lock
->force_write
= 1;
2326 flag
= log_all_ref_updates
;
2327 log_all_ref_updates
= 0;
2328 if (write_ref_sha1(lock
, orig_sha1
, NULL
))
2329 error("unable to write current sha1 into %s", oldrefname
);
2330 log_all_ref_updates
= flag
;
2333 if (logmoved
&& rename(git_path("logs/%s", newrefname
), git_path("logs/%s", oldrefname
)))
2334 error("unable to restore logfile %s from %s: %s",
2335 oldrefname
, newrefname
, strerror(errno
));
2336 if (!logmoved
&& log
&&
2337 rename(git_path(TMP_RENAMED_LOG
), git_path("logs/%s", oldrefname
)))
2338 error("unable to restore logfile %s from "TMP_RENAMED_LOG
": %s",
2339 oldrefname
, strerror(errno
));
2344 int close_ref(struct ref_lock
*lock
)
2346 if (close_lock_file(lock
->lk
))
2352 int commit_ref(struct ref_lock
*lock
)
2354 if (commit_lock_file(lock
->lk
))
2360 void unlock_ref(struct ref_lock
*lock
)
2362 /* Do not free lock->lk -- atexit() still looks at them */
2364 rollback_lock_file(lock
->lk
);
2365 free(lock
->ref_name
);
2366 free(lock
->orig_ref_name
);
2371 * copy the reflog message msg to buf, which has been allocated sufficiently
2372 * large, while cleaning up the whitespaces. Especially, convert LF to space,
2373 * because reflog file is one line per entry.
2375 static int copy_msg(char *buf
, const char *msg
)
2382 while ((c
= *msg
++)) {
2383 if (wasspace
&& isspace(c
))
2385 wasspace
= isspace(c
);
2390 while (buf
< cp
&& isspace(cp
[-1]))
2396 int log_ref_setup(const char *refname
, char *logfile
, int bufsize
)
2398 int logfd
, oflags
= O_APPEND
| O_WRONLY
;
2400 git_snpath(logfile
, bufsize
, "logs/%s", refname
);
2401 if (log_all_ref_updates
&&
2402 (!prefixcmp(refname
, "refs/heads/") ||
2403 !prefixcmp(refname
, "refs/remotes/") ||
2404 !prefixcmp(refname
, "refs/notes/") ||
2405 !strcmp(refname
, "HEAD"))) {
2406 if (safe_create_leading_directories(logfile
) < 0)
2407 return error("unable to create directory for %s",
2412 logfd
= open(logfile
, oflags
, 0666);
2414 if (!(oflags
& O_CREAT
) && errno
== ENOENT
)
2417 if ((oflags
& O_CREAT
) && errno
== EISDIR
) {
2418 if (remove_empty_directories(logfile
)) {
2419 return error("There are still logs under '%s'",
2422 logfd
= open(logfile
, oflags
, 0666);
2426 return error("Unable to append to %s: %s",
2427 logfile
, strerror(errno
));
2430 adjust_shared_perm(logfile
);
2435 static int log_ref_write(const char *refname
, const unsigned char *old_sha1
,
2436 const unsigned char *new_sha1
, const char *msg
)
2438 int logfd
, result
, written
, oflags
= O_APPEND
| O_WRONLY
;
2439 unsigned maxlen
, len
;
2441 char log_file
[PATH_MAX
];
2443 const char *committer
;
2445 if (log_all_ref_updates
< 0)
2446 log_all_ref_updates
= !is_bare_repository();
2448 result
= log_ref_setup(refname
, log_file
, sizeof(log_file
));
2452 logfd
= open(log_file
, oflags
);
2455 msglen
= msg
? strlen(msg
) : 0;
2456 committer
= git_committer_info(0);
2457 maxlen
= strlen(committer
) + msglen
+ 100;
2458 logrec
= xmalloc(maxlen
);
2459 len
= sprintf(logrec
, "%s %s %s\n",
2460 sha1_to_hex(old_sha1
),
2461 sha1_to_hex(new_sha1
),
2464 len
+= copy_msg(logrec
+ len
- 1, msg
) - 1;
2465 written
= len
<= maxlen
? write_in_full(logfd
, logrec
, len
) : -1;
2467 if (close(logfd
) != 0 || written
!= len
)
2468 return error("Unable to append to %s", log_file
);
2472 static int is_branch(const char *refname
)
2474 return !strcmp(refname
, "HEAD") || !prefixcmp(refname
, "refs/heads/");
2477 int write_ref_sha1(struct ref_lock
*lock
,
2478 const unsigned char *sha1
, const char *logmsg
)
2480 static char term
= '\n';
2485 if (!lock
->force_write
&& !hashcmp(lock
->old_sha1
, sha1
)) {
2489 o
= parse_object(sha1
);
2491 error("Trying to write ref %s with nonexistent object %s",
2492 lock
->ref_name
, sha1_to_hex(sha1
));
2496 if (o
->type
!= OBJ_COMMIT
&& is_branch(lock
->ref_name
)) {
2497 error("Trying to write non-commit object %s to branch %s",
2498 sha1_to_hex(sha1
), lock
->ref_name
);
2502 if (write_in_full(lock
->lock_fd
, sha1_to_hex(sha1
), 40) != 40 ||
2503 write_in_full(lock
->lock_fd
, &term
, 1) != 1
2504 || close_ref(lock
) < 0) {
2505 error("Couldn't write %s", lock
->lk
->filename
);
2509 clear_loose_ref_cache(get_ref_cache(NULL
));
2510 if (log_ref_write(lock
->ref_name
, lock
->old_sha1
, sha1
, logmsg
) < 0 ||
2511 (strcmp(lock
->ref_name
, lock
->orig_ref_name
) &&
2512 log_ref_write(lock
->orig_ref_name
, lock
->old_sha1
, sha1
, logmsg
) < 0)) {
2516 if (strcmp(lock
->orig_ref_name
, "HEAD") != 0) {
2518 * Special hack: If a branch is updated directly and HEAD
2519 * points to it (may happen on the remote side of a push
2520 * for example) then logically the HEAD reflog should be
2522 * A generic solution implies reverse symref information,
2523 * but finding all symrefs pointing to the given branch
2524 * would be rather costly for this rare event (the direct
2525 * update of a branch) to be worth it. So let's cheat and
2526 * check with HEAD only which should cover 99% of all usage
2527 * scenarios (even 100% of the default ones).
2529 unsigned char head_sha1
[20];
2531 const char *head_ref
;
2532 head_ref
= resolve_ref_unsafe("HEAD", head_sha1
, 1, &head_flag
);
2533 if (head_ref
&& (head_flag
& REF_ISSYMREF
) &&
2534 !strcmp(head_ref
, lock
->ref_name
))
2535 log_ref_write("HEAD", lock
->old_sha1
, sha1
, logmsg
);
2537 if (commit_ref(lock
)) {
2538 error("Couldn't set %s", lock
->ref_name
);
2546 int create_symref(const char *ref_target
, const char *refs_heads_master
,
2549 const char *lockpath
;
2551 int fd
, len
, written
;
2552 char *git_HEAD
= git_pathdup("%s", ref_target
);
2553 unsigned char old_sha1
[20], new_sha1
[20];
2555 if (logmsg
&& read_ref(ref_target
, old_sha1
))
2558 if (safe_create_leading_directories(git_HEAD
) < 0)
2559 return error("unable to create directory for %s", git_HEAD
);
2561 #ifndef NO_SYMLINK_HEAD
2562 if (prefer_symlink_refs
) {
2564 if (!symlink(refs_heads_master
, git_HEAD
))
2566 fprintf(stderr
, "no symlink - falling back to symbolic ref\n");
2570 len
= snprintf(ref
, sizeof(ref
), "ref: %s\n", refs_heads_master
);
2571 if (sizeof(ref
) <= len
) {
2572 error("refname too long: %s", refs_heads_master
);
2573 goto error_free_return
;
2575 lockpath
= mkpath("%s.lock", git_HEAD
);
2576 fd
= open(lockpath
, O_CREAT
| O_EXCL
| O_WRONLY
, 0666);
2578 error("Unable to open %s for writing", lockpath
);
2579 goto error_free_return
;
2581 written
= write_in_full(fd
, ref
, len
);
2582 if (close(fd
) != 0 || written
!= len
) {
2583 error("Unable to write to %s", lockpath
);
2584 goto error_unlink_return
;
2586 if (rename(lockpath
, git_HEAD
) < 0) {
2587 error("Unable to create %s", git_HEAD
);
2588 goto error_unlink_return
;
2590 if (adjust_shared_perm(git_HEAD
)) {
2591 error("Unable to fix permissions on %s", lockpath
);
2592 error_unlink_return
:
2593 unlink_or_warn(lockpath
);
2599 #ifndef NO_SYMLINK_HEAD
2602 if (logmsg
&& !read_ref(refs_heads_master
, new_sha1
))
2603 log_ref_write(ref_target
, old_sha1
, new_sha1
, logmsg
);
2609 static char *ref_msg(const char *line
, const char *endp
)
2613 ep
= memchr(line
, '\n', endp
- line
);
2616 return xmemdupz(line
, ep
- line
);
2619 int read_ref_at(const char *refname
, unsigned long at_time
, int cnt
,
2620 unsigned char *sha1
, char **msg
,
2621 unsigned long *cutoff_time
, int *cutoff_tz
, int *cutoff_cnt
)
2623 const char *logfile
, *logdata
, *logend
, *rec
, *lastgt
, *lastrec
;
2625 int logfd
, tz
, reccnt
= 0;
2628 unsigned char logged_sha1
[20];
2632 logfile
= git_path("logs/%s", refname
);
2633 logfd
= open(logfile
, O_RDONLY
, 0);
2635 die_errno("Unable to read log '%s'", logfile
);
2638 die("Log %s is empty.", logfile
);
2639 mapsz
= xsize_t(st
.st_size
);
2640 log_mapped
= xmmap(NULL
, mapsz
, PROT_READ
, MAP_PRIVATE
, logfd
, 0);
2641 logdata
= log_mapped
;
2645 rec
= logend
= logdata
+ st
.st_size
;
2646 while (logdata
< rec
) {
2648 if (logdata
< rec
&& *(rec
-1) == '\n')
2651 while (logdata
< rec
&& *(rec
-1) != '\n') {
2657 die("Log %s is corrupt.", logfile
);
2658 date
= strtoul(lastgt
+ 1, &tz_c
, 10);
2659 if (date
<= at_time
|| cnt
== 0) {
2660 tz
= strtoul(tz_c
, NULL
, 10);
2662 *msg
= ref_msg(rec
, logend
);
2664 *cutoff_time
= date
;
2668 *cutoff_cnt
= reccnt
- 1;
2670 if (get_sha1_hex(lastrec
, logged_sha1
))
2671 die("Log %s is corrupt.", logfile
);
2672 if (get_sha1_hex(rec
+ 41, sha1
))
2673 die("Log %s is corrupt.", logfile
);
2674 if (hashcmp(logged_sha1
, sha1
)) {
2675 warning("Log %s has gap after %s.",
2676 logfile
, show_date(date
, tz
, DATE_RFC2822
));
2679 else if (date
== at_time
) {
2680 if (get_sha1_hex(rec
+ 41, sha1
))
2681 die("Log %s is corrupt.", logfile
);
2684 if (get_sha1_hex(rec
+ 41, logged_sha1
))
2685 die("Log %s is corrupt.", logfile
);
2686 if (hashcmp(logged_sha1
, sha1
)) {
2687 warning("Log %s unexpectedly ended on %s.",
2688 logfile
, show_date(date
, tz
, DATE_RFC2822
));
2691 munmap(log_mapped
, mapsz
);
2700 while (rec
< logend
&& *rec
!= '>' && *rec
!= '\n')
2702 if (rec
== logend
|| *rec
== '\n')
2703 die("Log %s is corrupt.", logfile
);
2704 date
= strtoul(rec
+ 1, &tz_c
, 10);
2705 tz
= strtoul(tz_c
, NULL
, 10);
2706 if (get_sha1_hex(logdata
, sha1
))
2707 die("Log %s is corrupt.", logfile
);
2708 if (is_null_sha1(sha1
)) {
2709 if (get_sha1_hex(logdata
+ 41, sha1
))
2710 die("Log %s is corrupt.", logfile
);
2713 *msg
= ref_msg(logdata
, logend
);
2714 munmap(log_mapped
, mapsz
);
2717 *cutoff_time
= date
;
2721 *cutoff_cnt
= reccnt
;
2725 int for_each_recent_reflog_ent(const char *refname
, each_reflog_ent_fn fn
, long ofs
, void *cb_data
)
2727 const char *logfile
;
2729 struct strbuf sb
= STRBUF_INIT
;
2732 logfile
= git_path("logs/%s", refname
);
2733 logfp
= fopen(logfile
, "r");
2738 struct stat statbuf
;
2739 if (fstat(fileno(logfp
), &statbuf
) ||
2740 statbuf
.st_size
< ofs
||
2741 fseek(logfp
, -ofs
, SEEK_END
) ||
2742 strbuf_getwholeline(&sb
, logfp
, '\n')) {
2744 strbuf_release(&sb
);
2749 while (!strbuf_getwholeline(&sb
, logfp
, '\n')) {
2750 unsigned char osha1
[20], nsha1
[20];
2751 char *email_end
, *message
;
2752 unsigned long timestamp
;
2755 /* old SP new SP name <email> SP time TAB msg LF */
2756 if (sb
.len
< 83 || sb
.buf
[sb
.len
- 1] != '\n' ||
2757 get_sha1_hex(sb
.buf
, osha1
) || sb
.buf
[40] != ' ' ||
2758 get_sha1_hex(sb
.buf
+ 41, nsha1
) || sb
.buf
[81] != ' ' ||
2759 !(email_end
= strchr(sb
.buf
+ 82, '>')) ||
2760 email_end
[1] != ' ' ||
2761 !(timestamp
= strtoul(email_end
+ 2, &message
, 10)) ||
2762 !message
|| message
[0] != ' ' ||
2763 (message
[1] != '+' && message
[1] != '-') ||
2764 !isdigit(message
[2]) || !isdigit(message
[3]) ||
2765 !isdigit(message
[4]) || !isdigit(message
[5]))
2766 continue; /* corrupt? */
2767 email_end
[1] = '\0';
2768 tz
= strtol(message
+ 1, NULL
, 10);
2769 if (message
[6] != '\t')
2773 ret
= fn(osha1
, nsha1
, sb
.buf
+ 82, timestamp
, tz
, message
,
2779 strbuf_release(&sb
);
2783 int for_each_reflog_ent(const char *refname
, each_reflog_ent_fn fn
, void *cb_data
)
2785 return for_each_recent_reflog_ent(refname
, fn
, 0, cb_data
);
2789 * Call fn for each reflog in the namespace indicated by name. name
2790 * must be empty or end with '/'. Name will be used as a scratch
2791 * space, but its contents will be restored before return.
2793 static int do_for_each_reflog(struct strbuf
*name
, each_ref_fn fn
, void *cb_data
)
2795 DIR *d
= opendir(git_path("logs/%s", name
->buf
));
2798 int oldlen
= name
->len
;
2801 return name
->len
? errno
: 0;
2803 while ((de
= readdir(d
)) != NULL
) {
2806 if (de
->d_name
[0] == '.')
2808 if (has_extension(de
->d_name
, ".lock"))
2810 strbuf_addstr(name
, de
->d_name
);
2811 if (stat(git_path("logs/%s", name
->buf
), &st
) < 0) {
2812 ; /* silently ignore */
2814 if (S_ISDIR(st
.st_mode
)) {
2815 strbuf_addch(name
, '/');
2816 retval
= do_for_each_reflog(name
, fn
, cb_data
);
2818 unsigned char sha1
[20];
2819 if (read_ref_full(name
->buf
, sha1
, 0, NULL
))
2820 retval
= error("bad ref for %s", name
->buf
);
2822 retval
= fn(name
->buf
, sha1
, 0, cb_data
);
2827 strbuf_setlen(name
, oldlen
);
2833 int for_each_reflog(each_ref_fn fn
, void *cb_data
)
2837 strbuf_init(&name
, PATH_MAX
);
2838 retval
= do_for_each_reflog(&name
, fn
, cb_data
);
2839 strbuf_release(&name
);
2843 int update_ref(const char *action
, const char *refname
,
2844 const unsigned char *sha1
, const unsigned char *oldval
,
2845 int flags
, enum action_on_err onerr
)
2847 static struct ref_lock
*lock
;
2848 lock
= lock_any_ref_for_update(refname
, oldval
, flags
);
2850 const char *str
= "Cannot lock the ref '%s'.";
2852 case MSG_ON_ERR
: error(str
, refname
); break;
2853 case DIE_ON_ERR
: die(str
, refname
); break;
2854 case QUIET_ON_ERR
: break;
2858 if (write_ref_sha1(lock
, sha1
, action
) < 0) {
2859 const char *str
= "Cannot update the ref '%s'.";
2861 case MSG_ON_ERR
: error(str
, refname
); break;
2862 case DIE_ON_ERR
: die(str
, refname
); break;
2863 case QUIET_ON_ERR
: break;
2870 struct ref
*find_ref_by_name(const struct ref
*list
, const char *name
)
2872 for ( ; list
; list
= list
->next
)
2873 if (!strcmp(list
->name
, name
))
2874 return (struct ref
*)list
;
2879 * generate a format suitable for scanf from a ref_rev_parse_rules
2880 * rule, that is replace the "%.*s" spec with a "%s" spec
2882 static void gen_scanf_fmt(char *scanf_fmt
, const char *rule
)
2886 spec
= strstr(rule
, "%.*s");
2887 if (!spec
|| strstr(spec
+ 4, "%.*s"))
2888 die("invalid rule in ref_rev_parse_rules: %s", rule
);
2890 /* copy all until spec */
2891 strncpy(scanf_fmt
, rule
, spec
- rule
);
2892 scanf_fmt
[spec
- rule
] = '\0';
2894 strcat(scanf_fmt
, "%s");
2895 /* copy remaining rule */
2896 strcat(scanf_fmt
, spec
+ 4);
2901 char *shorten_unambiguous_ref(const char *refname
, int strict
)
2904 static char **scanf_fmts
;
2905 static int nr_rules
;
2908 /* pre generate scanf formats from ref_rev_parse_rules[] */
2910 size_t total_len
= 0;
2912 /* the rule list is NULL terminated, count them first */
2913 for (; ref_rev_parse_rules
[nr_rules
]; nr_rules
++)
2914 /* no +1 because strlen("%s") < strlen("%.*s") */
2915 total_len
+= strlen(ref_rev_parse_rules
[nr_rules
]);
2917 scanf_fmts
= xmalloc(nr_rules
* sizeof(char *) + total_len
);
2920 for (i
= 0; i
< nr_rules
; i
++) {
2921 scanf_fmts
[i
] = (char *)&scanf_fmts
[nr_rules
]
2923 gen_scanf_fmt(scanf_fmts
[i
], ref_rev_parse_rules
[i
]);
2924 total_len
+= strlen(ref_rev_parse_rules
[i
]);
2928 /* bail out if there are no rules */
2930 return xstrdup(refname
);
2932 /* buffer for scanf result, at most refname must fit */
2933 short_name
= xstrdup(refname
);
2935 /* skip first rule, it will always match */
2936 for (i
= nr_rules
- 1; i
> 0 ; --i
) {
2938 int rules_to_fail
= i
;
2941 if (1 != sscanf(refname
, scanf_fmts
[i
], short_name
))
2944 short_name_len
= strlen(short_name
);
2947 * in strict mode, all (except the matched one) rules
2948 * must fail to resolve to a valid non-ambiguous ref
2951 rules_to_fail
= nr_rules
;
2954 * check if the short name resolves to a valid ref,
2955 * but use only rules prior to the matched one
2957 for (j
= 0; j
< rules_to_fail
; j
++) {
2958 const char *rule
= ref_rev_parse_rules
[j
];
2959 char refname
[PATH_MAX
];
2961 /* skip matched rule */
2966 * the short name is ambiguous, if it resolves
2967 * (with this previous rule) to a valid ref
2968 * read_ref() returns 0 on success
2970 mksnpath(refname
, sizeof(refname
),
2971 rule
, short_name_len
, short_name
);
2972 if (ref_exists(refname
))
2977 * short name is non-ambiguous if all previous rules
2978 * haven't resolved to a valid ref
2980 if (j
== rules_to_fail
)
2985 return xstrdup(refname
);