7 #include "string-list.h"
13 unsigned char old_sha1
[20];
18 * How to handle various characters in refnames:
19 * 0: An acceptable character for refs
21 * 2: ., look for a preceding . to reject .. in refs
22 * 3: {, look for a preceding @ to reject @{ in refs
23 * 4: A bad character: ASCII control characters, "~", "^", ":" or SP
25 static unsigned char refname_disposition
[256] = {
26 1, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
27 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
28 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 2, 1,
29 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 4,
30 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
31 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 4, 0, 4, 0,
32 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
33 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 4, 4
37 * Flag passed to lock_ref_sha1_basic() telling it to tolerate broken
38 * refs (i.e., because the reference is about to be deleted anyway).
40 #define REF_DELETING 0x02
43 * Used as a flag in ref_update::flags when a loose ref is being
46 #define REF_ISPRUNING 0x04
49 * Used as a flag in ref_update::flags when the reference should be
50 * updated to new_sha1.
52 #define REF_HAVE_NEW 0x08
55 * Used as a flag in ref_update::flags when old_sha1 should be
58 #define REF_HAVE_OLD 0x10
61 * Used as a flag in ref_update::flags when the lockfile needs to be
64 #define REF_NEEDS_COMMIT 0x20
67 * Try to read one refname component from the front of refname.
68 * Return the length of the component found, or -1 if the component is
69 * not legal. It is legal if it is something reasonable to have under
70 * ".git/refs/"; We do not like it if:
72 * - any path component of it begins with ".", or
73 * - it has double dots "..", or
74 * - it has ASCII control character, "~", "^", ":" or SP, anywhere, or
75 * - it ends with a "/".
76 * - it ends with ".lock"
77 * - it contains a "\" (backslash)
79 static int check_refname_component(const char *refname
, int flags
)
84 for (cp
= refname
; ; cp
++) {
86 unsigned char disp
= refname_disposition
[ch
];
92 return -1; /* Refname contains "..". */
96 return -1; /* Refname contains "@{". */
105 return 0; /* Component has zero length. */
106 if (refname
[0] == '.')
107 return -1; /* Component starts with '.'. */
108 if (cp
- refname
>= LOCK_SUFFIX_LEN
&&
109 !memcmp(cp
- LOCK_SUFFIX_LEN
, LOCK_SUFFIX
, LOCK_SUFFIX_LEN
))
110 return -1; /* Refname ends with ".lock". */
114 int check_refname_format(const char *refname
, int flags
)
116 int component_len
, component_count
= 0;
118 if (!strcmp(refname
, "@"))
119 /* Refname is a single character '@'. */
123 /* We are at the start of a path component. */
124 component_len
= check_refname_component(refname
, flags
);
125 if (component_len
<= 0) {
126 if ((flags
& REFNAME_REFSPEC_PATTERN
) &&
128 (refname
[1] == '\0' || refname
[1] == '/')) {
129 /* Accept one wildcard as a full refname component. */
130 flags
&= ~REFNAME_REFSPEC_PATTERN
;
137 if (refname
[component_len
] == '\0')
139 /* Skip to next component. */
140 refname
+= component_len
+ 1;
143 if (refname
[component_len
- 1] == '.')
144 return -1; /* Refname ends with '.'. */
145 if (!(flags
& REFNAME_ALLOW_ONELEVEL
) && component_count
< 2)
146 return -1; /* Refname has only one component. */
153 * Information used (along with the information in ref_entry) to
154 * describe a single cached reference. This data structure only
155 * occurs embedded in a union in struct ref_entry, and only when
156 * (ref_entry->flag & REF_DIR) is zero.
160 * The name of the object to which this reference resolves
161 * (which may be a tag object). If REF_ISBROKEN, this is
162 * null. If REF_ISSYMREF, then this is the name of the object
163 * referred to by the last reference in the symlink chain.
165 unsigned char sha1
[20];
168 * If REF_KNOWS_PEELED, then this field holds the peeled value
169 * of this reference, or null if the reference is known not to
170 * be peelable. See the documentation for peel_ref() for an
171 * exact definition of "peelable".
173 unsigned char peeled
[20];
179 * Information used (along with the information in ref_entry) to
180 * describe a level in the hierarchy of references. This data
181 * structure only occurs embedded in a union in struct ref_entry, and
182 * only when (ref_entry.flag & REF_DIR) is set. In that case,
183 * (ref_entry.flag & REF_INCOMPLETE) determines whether the references
184 * in the directory have already been read:
186 * (ref_entry.flag & REF_INCOMPLETE) unset -- a directory of loose
187 * or packed references, already read.
189 * (ref_entry.flag & REF_INCOMPLETE) set -- a directory of loose
190 * references that hasn't been read yet (nor has any of its
193 * Entries within a directory are stored within a growable array of
194 * pointers to ref_entries (entries, nr, alloc). Entries 0 <= i <
195 * sorted are sorted by their component name in strcmp() order and the
196 * remaining entries are unsorted.
198 * Loose references are read lazily, one directory at a time. When a
199 * directory of loose references is read, then all of the references
200 * in that directory are stored, and REF_INCOMPLETE stubs are created
201 * for any subdirectories, but the subdirectories themselves are not
202 * read. The reading is triggered by get_ref_dir().
208 * Entries with index 0 <= i < sorted are sorted by name. New
209 * entries are appended to the list unsorted, and are sorted
210 * only when required; thus we avoid the need to sort the list
211 * after the addition of every reference.
215 /* A pointer to the ref_cache that contains this ref_dir. */
216 struct ref_cache
*ref_cache
;
218 struct ref_entry
**entries
;
222 * Bit values for ref_entry::flag. REF_ISSYMREF=0x01,
223 * REF_ISPACKED=0x02, REF_ISBROKEN=0x04 and REF_BAD_NAME=0x08 are
224 * public values; see refs.h.
228 * The field ref_entry->u.value.peeled of this value entry contains
229 * the correct peeled value for the reference, which might be
230 * null_sha1 if the reference is not a tag or if it is broken.
232 #define REF_KNOWS_PEELED 0x10
234 /* ref_entry represents a directory of references */
238 * Entry has not yet been read from disk (used only for REF_DIR
239 * entries representing loose references)
241 #define REF_INCOMPLETE 0x40
244 * A ref_entry represents either a reference or a "subdirectory" of
247 * Each directory in the reference namespace is represented by a
248 * ref_entry with (flags & REF_DIR) set and containing a subdir member
249 * that holds the entries in that directory that have been read so
250 * far. If (flags & REF_INCOMPLETE) is set, then the directory and
251 * its subdirectories haven't been read yet. REF_INCOMPLETE is only
252 * used for loose reference directories.
254 * References are represented by a ref_entry with (flags & REF_DIR)
255 * unset and a value member that describes the reference's value. The
256 * flag member is at the ref_entry level, but it is also needed to
257 * interpret the contents of the value field (in other words, a
258 * ref_value object is not very much use without the enclosing
261 * Reference names cannot end with slash and directories' names are
262 * always stored with a trailing slash (except for the top-level
263 * directory, which is always denoted by ""). This has two nice
264 * consequences: (1) when the entries in each subdir are sorted
265 * lexicographically by name (as they usually are), the references in
266 * a whole tree can be generated in lexicographic order by traversing
267 * the tree in left-to-right, depth-first order; (2) the names of
268 * references and subdirectories cannot conflict, and therefore the
269 * presence of an empty subdirectory does not block the creation of a
270 * similarly-named reference. (The fact that reference names with the
271 * same leading components can conflict *with each other* is a
272 * separate issue that is regulated by verify_refname_available().)
274 * Please note that the name field contains the fully-qualified
275 * reference (or subdirectory) name. Space could be saved by only
276 * storing the relative names. But that would require the full names
277 * to be generated on the fly when iterating in do_for_each_ref(), and
278 * would break callback functions, who have always been able to assume
279 * that the name strings that they are passed will not be freed during
283 unsigned char flag
; /* ISSYMREF? ISPACKED? */
285 struct ref_value value
; /* if not (flags&REF_DIR) */
286 struct ref_dir subdir
; /* if (flags&REF_DIR) */
289 * The full name of the reference (e.g., "refs/heads/master")
290 * or the full name of the directory with a trailing slash
291 * (e.g., "refs/heads/"):
293 char name
[FLEX_ARRAY
];
296 static void read_loose_refs(const char *dirname
, struct ref_dir
*dir
);
298 static struct ref_dir
*get_ref_dir(struct ref_entry
*entry
)
301 assert(entry
->flag
& REF_DIR
);
302 dir
= &entry
->u
.subdir
;
303 if (entry
->flag
& REF_INCOMPLETE
) {
304 read_loose_refs(entry
->name
, dir
);
305 entry
->flag
&= ~REF_INCOMPLETE
;
311 * Check if a refname is safe.
312 * For refs that start with "refs/" we consider it safe as long they do
313 * not try to resolve to outside of refs/.
315 * For all other refs we only consider them safe iff they only contain
316 * upper case characters and '_' (like "HEAD" AND "MERGE_HEAD", and not like
319 static int refname_is_safe(const char *refname
)
321 if (starts_with(refname
, "refs/")) {
325 buf
= xmalloc(strlen(refname
) + 1);
327 * Does the refname try to escape refs/?
328 * For example: refs/foo/../bar is safe but refs/foo/../../bar
331 result
= !normalize_path_copy(buf
, refname
+ strlen("refs/"));
336 if (!isupper(*refname
) && *refname
!= '_')
343 static struct ref_entry
*create_ref_entry(const char *refname
,
344 const unsigned char *sha1
, int flag
,
348 struct ref_entry
*ref
;
351 check_refname_format(refname
, REFNAME_ALLOW_ONELEVEL
))
352 die("Reference has invalid format: '%s'", refname
);
353 if (!check_name
&& !refname_is_safe(refname
))
354 die("Reference has invalid name: '%s'", refname
);
355 len
= strlen(refname
) + 1;
356 ref
= xmalloc(sizeof(struct ref_entry
) + len
);
357 hashcpy(ref
->u
.value
.sha1
, sha1
);
358 hashclr(ref
->u
.value
.peeled
);
359 memcpy(ref
->name
, refname
, len
);
364 static void clear_ref_dir(struct ref_dir
*dir
);
366 static void free_ref_entry(struct ref_entry
*entry
)
368 if (entry
->flag
& REF_DIR
) {
370 * Do not use get_ref_dir() here, as that might
371 * trigger the reading of loose refs.
373 clear_ref_dir(&entry
->u
.subdir
);
379 * Add a ref_entry to the end of dir (unsorted). Entry is always
380 * stored directly in dir; no recursion into subdirectories is
383 static void add_entry_to_dir(struct ref_dir
*dir
, struct ref_entry
*entry
)
385 ALLOC_GROW(dir
->entries
, dir
->nr
+ 1, dir
->alloc
);
386 dir
->entries
[dir
->nr
++] = entry
;
387 /* optimize for the case that entries are added in order */
389 (dir
->nr
== dir
->sorted
+ 1 &&
390 strcmp(dir
->entries
[dir
->nr
- 2]->name
,
391 dir
->entries
[dir
->nr
- 1]->name
) < 0))
392 dir
->sorted
= dir
->nr
;
396 * Clear and free all entries in dir, recursively.
398 static void clear_ref_dir(struct ref_dir
*dir
)
401 for (i
= 0; i
< dir
->nr
; i
++)
402 free_ref_entry(dir
->entries
[i
]);
404 dir
->sorted
= dir
->nr
= dir
->alloc
= 0;
409 * Create a struct ref_entry object for the specified dirname.
410 * dirname is the name of the directory with a trailing slash (e.g.,
411 * "refs/heads/") or "" for the top-level directory.
413 static struct ref_entry
*create_dir_entry(struct ref_cache
*ref_cache
,
414 const char *dirname
, size_t len
,
417 struct ref_entry
*direntry
;
418 direntry
= xcalloc(1, sizeof(struct ref_entry
) + len
+ 1);
419 memcpy(direntry
->name
, dirname
, len
);
420 direntry
->name
[len
] = '\0';
421 direntry
->u
.subdir
.ref_cache
= ref_cache
;
422 direntry
->flag
= REF_DIR
| (incomplete
? REF_INCOMPLETE
: 0);
426 static int ref_entry_cmp(const void *a
, const void *b
)
428 struct ref_entry
*one
= *(struct ref_entry
**)a
;
429 struct ref_entry
*two
= *(struct ref_entry
**)b
;
430 return strcmp(one
->name
, two
->name
);
433 static void sort_ref_dir(struct ref_dir
*dir
);
435 struct string_slice
{
440 static int ref_entry_cmp_sslice(const void *key_
, const void *ent_
)
442 const struct string_slice
*key
= key_
;
443 const struct ref_entry
*ent
= *(const struct ref_entry
* const *)ent_
;
444 int cmp
= strncmp(key
->str
, ent
->name
, key
->len
);
447 return '\0' - (unsigned char)ent
->name
[key
->len
];
451 * Return the index of the entry with the given refname from the
452 * ref_dir (non-recursively), sorting dir if necessary. Return -1 if
453 * no such entry is found. dir must already be complete.
455 static int search_ref_dir(struct ref_dir
*dir
, const char *refname
, size_t len
)
457 struct ref_entry
**r
;
458 struct string_slice key
;
460 if (refname
== NULL
|| !dir
->nr
)
466 r
= bsearch(&key
, dir
->entries
, dir
->nr
, sizeof(*dir
->entries
),
467 ref_entry_cmp_sslice
);
472 return r
- dir
->entries
;
476 * Search for a directory entry directly within dir (without
477 * recursing). Sort dir if necessary. subdirname must be a directory
478 * name (i.e., end in '/'). If mkdir is set, then create the
479 * directory if it is missing; otherwise, return NULL if the desired
480 * directory cannot be found. dir must already be complete.
482 static struct ref_dir
*search_for_subdir(struct ref_dir
*dir
,
483 const char *subdirname
, size_t len
,
486 int entry_index
= search_ref_dir(dir
, subdirname
, len
);
487 struct ref_entry
*entry
;
488 if (entry_index
== -1) {
492 * Since dir is complete, the absence of a subdir
493 * means that the subdir really doesn't exist;
494 * therefore, create an empty record for it but mark
495 * the record complete.
497 entry
= create_dir_entry(dir
->ref_cache
, subdirname
, len
, 0);
498 add_entry_to_dir(dir
, entry
);
500 entry
= dir
->entries
[entry_index
];
502 return get_ref_dir(entry
);
506 * If refname is a reference name, find the ref_dir within the dir
507 * tree that should hold refname. If refname is a directory name
508 * (i.e., ends in '/'), then return that ref_dir itself. dir must
509 * represent the top-level directory and must already be complete.
510 * Sort ref_dirs and recurse into subdirectories as necessary. If
511 * mkdir is set, then create any missing directories; otherwise,
512 * return NULL if the desired directory cannot be found.
514 static struct ref_dir
*find_containing_dir(struct ref_dir
*dir
,
515 const char *refname
, int mkdir
)
518 for (slash
= strchr(refname
, '/'); slash
; slash
= strchr(slash
+ 1, '/')) {
519 size_t dirnamelen
= slash
- refname
+ 1;
520 struct ref_dir
*subdir
;
521 subdir
= search_for_subdir(dir
, refname
, dirnamelen
, mkdir
);
533 * Find the value entry with the given name in dir, sorting ref_dirs
534 * and recursing into subdirectories as necessary. If the name is not
535 * found or it corresponds to a directory entry, return NULL.
537 static struct ref_entry
*find_ref(struct ref_dir
*dir
, const char *refname
)
540 struct ref_entry
*entry
;
541 dir
= find_containing_dir(dir
, refname
, 0);
544 entry_index
= search_ref_dir(dir
, refname
, strlen(refname
));
545 if (entry_index
== -1)
547 entry
= dir
->entries
[entry_index
];
548 return (entry
->flag
& REF_DIR
) ? NULL
: entry
;
552 * Remove the entry with the given name from dir, recursing into
553 * subdirectories as necessary. If refname is the name of a directory
554 * (i.e., ends with '/'), then remove the directory and its contents.
555 * If the removal was successful, return the number of entries
556 * remaining in the directory entry that contained the deleted entry.
557 * If the name was not found, return -1. Please note that this
558 * function only deletes the entry from the cache; it does not delete
559 * it from the filesystem or ensure that other cache entries (which
560 * might be symbolic references to the removed entry) are updated.
561 * Nor does it remove any containing dir entries that might be made
562 * empty by the removal. dir must represent the top-level directory
563 * and must already be complete.
565 static int remove_entry(struct ref_dir
*dir
, const char *refname
)
567 int refname_len
= strlen(refname
);
569 struct ref_entry
*entry
;
570 int is_dir
= refname
[refname_len
- 1] == '/';
573 * refname represents a reference directory. Remove
574 * the trailing slash; otherwise we will get the
575 * directory *representing* refname rather than the
576 * one *containing* it.
578 char *dirname
= xmemdupz(refname
, refname_len
- 1);
579 dir
= find_containing_dir(dir
, dirname
, 0);
582 dir
= find_containing_dir(dir
, refname
, 0);
586 entry_index
= search_ref_dir(dir
, refname
, refname_len
);
587 if (entry_index
== -1)
589 entry
= dir
->entries
[entry_index
];
591 memmove(&dir
->entries
[entry_index
],
592 &dir
->entries
[entry_index
+ 1],
593 (dir
->nr
- entry_index
- 1) * sizeof(*dir
->entries
)
596 if (dir
->sorted
> entry_index
)
598 free_ref_entry(entry
);
603 * Add a ref_entry to the ref_dir (unsorted), recursing into
604 * subdirectories as necessary. dir must represent the top-level
605 * directory. Return 0 on success.
607 static int add_ref(struct ref_dir
*dir
, struct ref_entry
*ref
)
609 dir
= find_containing_dir(dir
, ref
->name
, 1);
612 add_entry_to_dir(dir
, ref
);
617 * Emit a warning and return true iff ref1 and ref2 have the same name
618 * and the same sha1. Die if they have the same name but different
621 static int is_dup_ref(const struct ref_entry
*ref1
, const struct ref_entry
*ref2
)
623 if (strcmp(ref1
->name
, ref2
->name
))
626 /* Duplicate name; make sure that they don't conflict: */
628 if ((ref1
->flag
& REF_DIR
) || (ref2
->flag
& REF_DIR
))
629 /* This is impossible by construction */
630 die("Reference directory conflict: %s", ref1
->name
);
632 if (hashcmp(ref1
->u
.value
.sha1
, ref2
->u
.value
.sha1
))
633 die("Duplicated ref, and SHA1s don't match: %s", ref1
->name
);
635 warning("Duplicated ref: %s", ref1
->name
);
640 * Sort the entries in dir non-recursively (if they are not already
641 * sorted) and remove any duplicate entries.
643 static void sort_ref_dir(struct ref_dir
*dir
)
646 struct ref_entry
*last
= NULL
;
649 * This check also prevents passing a zero-length array to qsort(),
650 * which is a problem on some platforms.
652 if (dir
->sorted
== dir
->nr
)
655 qsort(dir
->entries
, dir
->nr
, sizeof(*dir
->entries
), ref_entry_cmp
);
657 /* Remove any duplicates: */
658 for (i
= 0, j
= 0; j
< dir
->nr
; j
++) {
659 struct ref_entry
*entry
= dir
->entries
[j
];
660 if (last
&& is_dup_ref(last
, entry
))
661 free_ref_entry(entry
);
663 last
= dir
->entries
[i
++] = entry
;
665 dir
->sorted
= dir
->nr
= i
;
668 /* Include broken references in a do_for_each_ref*() iteration: */
669 #define DO_FOR_EACH_INCLUDE_BROKEN 0x01
672 * Return true iff the reference described by entry can be resolved to
673 * an object in the database. Emit a warning if the referred-to
674 * object does not exist.
676 static int ref_resolves_to_object(struct ref_entry
*entry
)
678 if (entry
->flag
& REF_ISBROKEN
)
680 if (!has_sha1_file(entry
->u
.value
.sha1
)) {
681 error("%s does not point to a valid object!", entry
->name
);
688 * current_ref is a performance hack: when iterating over references
689 * using the for_each_ref*() functions, current_ref is set to the
690 * current reference's entry before calling the callback function. If
691 * the callback function calls peel_ref(), then peel_ref() first
692 * checks whether the reference to be peeled is the current reference
693 * (it usually is) and if so, returns that reference's peeled version
694 * if it is available. This avoids a refname lookup in a common case.
696 static struct ref_entry
*current_ref
;
698 typedef int each_ref_entry_fn(struct ref_entry
*entry
, void *cb_data
);
700 struct ref_entry_cb
{
709 * Handle one reference in a do_for_each_ref*()-style iteration,
710 * calling an each_ref_fn for each entry.
712 static int do_one_ref(struct ref_entry
*entry
, void *cb_data
)
714 struct ref_entry_cb
*data
= cb_data
;
715 struct ref_entry
*old_current_ref
;
718 if (!starts_with(entry
->name
, data
->base
))
721 if (!(data
->flags
& DO_FOR_EACH_INCLUDE_BROKEN
) &&
722 !ref_resolves_to_object(entry
))
725 /* Store the old value, in case this is a recursive call: */
726 old_current_ref
= current_ref
;
728 retval
= data
->fn(entry
->name
+ data
->trim
, entry
->u
.value
.sha1
,
729 entry
->flag
, data
->cb_data
);
730 current_ref
= old_current_ref
;
735 * Call fn for each reference in dir that has index in the range
736 * offset <= index < dir->nr. Recurse into subdirectories that are in
737 * that index range, sorting them before iterating. This function
738 * does not sort dir itself; it should be sorted beforehand. fn is
739 * called for all references, including broken ones.
741 static int do_for_each_entry_in_dir(struct ref_dir
*dir
, int offset
,
742 each_ref_entry_fn fn
, void *cb_data
)
745 assert(dir
->sorted
== dir
->nr
);
746 for (i
= offset
; i
< dir
->nr
; i
++) {
747 struct ref_entry
*entry
= dir
->entries
[i
];
749 if (entry
->flag
& REF_DIR
) {
750 struct ref_dir
*subdir
= get_ref_dir(entry
);
751 sort_ref_dir(subdir
);
752 retval
= do_for_each_entry_in_dir(subdir
, 0, fn
, cb_data
);
754 retval
= fn(entry
, cb_data
);
763 * Call fn for each reference in the union of dir1 and dir2, in order
764 * by refname. Recurse into subdirectories. If a value entry appears
765 * in both dir1 and dir2, then only process the version that is in
766 * dir2. The input dirs must already be sorted, but subdirs will be
767 * sorted as needed. fn is called for all references, including
770 static int do_for_each_entry_in_dirs(struct ref_dir
*dir1
,
771 struct ref_dir
*dir2
,
772 each_ref_entry_fn fn
, void *cb_data
)
777 assert(dir1
->sorted
== dir1
->nr
);
778 assert(dir2
->sorted
== dir2
->nr
);
780 struct ref_entry
*e1
, *e2
;
782 if (i1
== dir1
->nr
) {
783 return do_for_each_entry_in_dir(dir2
, i2
, fn
, cb_data
);
785 if (i2
== dir2
->nr
) {
786 return do_for_each_entry_in_dir(dir1
, i1
, fn
, cb_data
);
788 e1
= dir1
->entries
[i1
];
789 e2
= dir2
->entries
[i2
];
790 cmp
= strcmp(e1
->name
, e2
->name
);
792 if ((e1
->flag
& REF_DIR
) && (e2
->flag
& REF_DIR
)) {
793 /* Both are directories; descend them in parallel. */
794 struct ref_dir
*subdir1
= get_ref_dir(e1
);
795 struct ref_dir
*subdir2
= get_ref_dir(e2
);
796 sort_ref_dir(subdir1
);
797 sort_ref_dir(subdir2
);
798 retval
= do_for_each_entry_in_dirs(
799 subdir1
, subdir2
, fn
, cb_data
);
802 } else if (!(e1
->flag
& REF_DIR
) && !(e2
->flag
& REF_DIR
)) {
803 /* Both are references; ignore the one from dir1. */
804 retval
= fn(e2
, cb_data
);
808 die("conflict between reference and directory: %s",
820 if (e
->flag
& REF_DIR
) {
821 struct ref_dir
*subdir
= get_ref_dir(e
);
822 sort_ref_dir(subdir
);
823 retval
= do_for_each_entry_in_dir(
824 subdir
, 0, fn
, cb_data
);
826 retval
= fn(e
, cb_data
);
835 * Load all of the refs from the dir into our in-memory cache. The hard work
836 * of loading loose refs is done by get_ref_dir(), so we just need to recurse
837 * through all of the sub-directories. We do not even need to care about
838 * sorting, as traversal order does not matter to us.
840 static void prime_ref_dir(struct ref_dir
*dir
)
843 for (i
= 0; i
< dir
->nr
; i
++) {
844 struct ref_entry
*entry
= dir
->entries
[i
];
845 if (entry
->flag
& REF_DIR
)
846 prime_ref_dir(get_ref_dir(entry
));
850 struct nonmatching_ref_data
{
851 const struct string_list
*skip
;
852 const char *conflicting_refname
;
855 static int nonmatching_ref_fn(struct ref_entry
*entry
, void *vdata
)
857 struct nonmatching_ref_data
*data
= vdata
;
859 if (data
->skip
&& string_list_has_string(data
->skip
, entry
->name
))
862 data
->conflicting_refname
= entry
->name
;
867 * Return 0 if a reference named refname could be created without
868 * conflicting with the name of an existing reference in dir.
869 * Otherwise, return a negative value and write an explanation to err.
870 * If extras is non-NULL, it is a list of additional refnames with
871 * which refname is not allowed to conflict. If skip is non-NULL,
872 * ignore potential conflicts with refs in skip (e.g., because they
873 * are scheduled for deletion in the same operation). Behavior is
874 * undefined if the same name is listed in both extras and skip.
876 * Two reference names conflict if one of them exactly matches the
877 * leading components of the other; e.g., "refs/foo/bar" conflicts
878 * with both "refs/foo" and with "refs/foo/bar/baz" but not with
879 * "refs/foo/bar" or "refs/foo/barbados".
881 * extras and skip must be sorted.
883 static int verify_refname_available(const char *refname
,
884 const struct string_list
*extras
,
885 const struct string_list
*skip
,
891 struct strbuf dirname
= STRBUF_INIT
;
895 * For the sake of comments in this function, suppose that
896 * refname is "refs/foo/bar".
901 strbuf_grow(&dirname
, strlen(refname
) + 1);
902 for (slash
= strchr(refname
, '/'); slash
; slash
= strchr(slash
+ 1, '/')) {
903 /* Expand dirname to the new prefix, not including the trailing slash: */
904 strbuf_add(&dirname
, refname
+ dirname
.len
, slash
- refname
- dirname
.len
);
907 * We are still at a leading dir of the refname (e.g.,
908 * "refs/foo"; if there is a reference with that name,
909 * it is a conflict, *unless* it is in skip.
912 pos
= search_ref_dir(dir
, dirname
.buf
, dirname
.len
);
914 (!skip
|| !string_list_has_string(skip
, dirname
.buf
))) {
916 * We found a reference whose name is
917 * a proper prefix of refname; e.g.,
918 * "refs/foo", and is not in skip.
920 strbuf_addf(err
, "'%s' exists; cannot create '%s'",
921 dirname
.buf
, refname
);
926 if (extras
&& string_list_has_string(extras
, dirname
.buf
) &&
927 (!skip
|| !string_list_has_string(skip
, dirname
.buf
))) {
928 strbuf_addf(err
, "cannot process '%s' and '%s' at the same time",
929 refname
, dirname
.buf
);
934 * Otherwise, we can try to continue our search with
935 * the next component. So try to look up the
936 * directory, e.g., "refs/foo/". If we come up empty,
937 * we know there is nothing under this whole prefix,
938 * but even in that case we still have to continue the
939 * search for conflicts with extras.
941 strbuf_addch(&dirname
, '/');
943 pos
= search_ref_dir(dir
, dirname
.buf
, dirname
.len
);
946 * There was no directory "refs/foo/",
947 * so there is nothing under this
948 * whole prefix. So there is no need
949 * to continue looking for conflicting
950 * references. But we need to continue
951 * looking for conflicting extras.
955 dir
= get_ref_dir(dir
->entries
[pos
]);
961 * We are at the leaf of our refname (e.g., "refs/foo/bar").
962 * There is no point in searching for a reference with that
963 * name, because a refname isn't considered to conflict with
964 * itself. But we still need to check for references whose
965 * names are in the "refs/foo/bar/" namespace, because they
968 strbuf_addstr(&dirname
, refname
+ dirname
.len
);
969 strbuf_addch(&dirname
, '/');
972 pos
= search_ref_dir(dir
, dirname
.buf
, dirname
.len
);
976 * We found a directory named "$refname/"
977 * (e.g., "refs/foo/bar/"). It is a problem
978 * iff it contains any ref that is not in
981 struct nonmatching_ref_data data
;
984 data
.conflicting_refname
= NULL
;
985 dir
= get_ref_dir(dir
->entries
[pos
]);
987 if (do_for_each_entry_in_dir(dir
, 0, nonmatching_ref_fn
, &data
)) {
988 strbuf_addf(err
, "'%s' exists; cannot create '%s'",
989 data
.conflicting_refname
, refname
);
997 * Check for entries in extras that start with
998 * "$refname/". We do that by looking for the place
999 * where "$refname/" would be inserted in extras. If
1000 * there is an entry at that position that starts with
1001 * "$refname/" and is not in skip, then we have a
1004 for (pos
= string_list_find_insert_index(extras
, dirname
.buf
, 0);
1005 pos
< extras
->nr
; pos
++) {
1006 const char *extra_refname
= extras
->items
[pos
].string
;
1008 if (!starts_with(extra_refname
, dirname
.buf
))
1011 if (!skip
|| !string_list_has_string(skip
, extra_refname
)) {
1012 strbuf_addf(err
, "cannot process '%s' and '%s' at the same time",
1013 refname
, extra_refname
);
1019 /* No conflicts were found */
1023 strbuf_release(&dirname
);
1027 struct packed_ref_cache
{
1028 struct ref_entry
*root
;
1031 * Count of references to the data structure in this instance,
1032 * including the pointer from ref_cache::packed if any. The
1033 * data will not be freed as long as the reference count is
1036 unsigned int referrers
;
1039 * Iff the packed-refs file associated with this instance is
1040 * currently locked for writing, this points at the associated
1041 * lock (which is owned by somebody else). The referrer count
1042 * is also incremented when the file is locked and decremented
1043 * when it is unlocked.
1045 struct lock_file
*lock
;
1047 /* The metadata from when this packed-refs cache was read */
1048 struct stat_validity validity
;
1052 * Future: need to be in "struct repository"
1053 * when doing a full libification.
1055 static struct ref_cache
{
1056 struct ref_cache
*next
;
1057 struct ref_entry
*loose
;
1058 struct packed_ref_cache
*packed
;
1060 * The submodule name, or "" for the main repo. We allocate
1061 * length 1 rather than FLEX_ARRAY so that the main ref_cache
1062 * is initialized correctly.
1065 } ref_cache
, *submodule_ref_caches
;
1067 /* Lock used for the main packed-refs file: */
1068 static struct lock_file packlock
;
1071 * Increment the reference count of *packed_refs.
1073 static void acquire_packed_ref_cache(struct packed_ref_cache
*packed_refs
)
1075 packed_refs
->referrers
++;
1079 * Decrease the reference count of *packed_refs. If it goes to zero,
1080 * free *packed_refs and return true; otherwise return false.
1082 static int release_packed_ref_cache(struct packed_ref_cache
*packed_refs
)
1084 if (!--packed_refs
->referrers
) {
1085 free_ref_entry(packed_refs
->root
);
1086 stat_validity_clear(&packed_refs
->validity
);
1094 static void clear_packed_ref_cache(struct ref_cache
*refs
)
1097 struct packed_ref_cache
*packed_refs
= refs
->packed
;
1099 if (packed_refs
->lock
)
1100 die("internal error: packed-ref cache cleared while locked");
1101 refs
->packed
= NULL
;
1102 release_packed_ref_cache(packed_refs
);
1106 static void clear_loose_ref_cache(struct ref_cache
*refs
)
1109 free_ref_entry(refs
->loose
);
1114 static struct ref_cache
*create_ref_cache(const char *submodule
)
1117 struct ref_cache
*refs
;
1120 len
= strlen(submodule
) + 1;
1121 refs
= xcalloc(1, sizeof(struct ref_cache
) + len
);
1122 memcpy(refs
->name
, submodule
, len
);
1127 * Return a pointer to a ref_cache for the specified submodule. For
1128 * the main repository, use submodule==NULL. The returned structure
1129 * will be allocated and initialized but not necessarily populated; it
1130 * should not be freed.
1132 static struct ref_cache
*get_ref_cache(const char *submodule
)
1134 struct ref_cache
*refs
;
1136 if (!submodule
|| !*submodule
)
1139 for (refs
= submodule_ref_caches
; refs
; refs
= refs
->next
)
1140 if (!strcmp(submodule
, refs
->name
))
1143 refs
= create_ref_cache(submodule
);
1144 refs
->next
= submodule_ref_caches
;
1145 submodule_ref_caches
= refs
;
1149 /* The length of a peeled reference line in packed-refs, including EOL: */
1150 #define PEELED_LINE_LENGTH 42
1153 * The packed-refs header line that we write out. Perhaps other
1154 * traits will be added later. The trailing space is required.
1156 static const char PACKED_REFS_HEADER
[] =
1157 "# pack-refs with: peeled fully-peeled \n";
1160 * Parse one line from a packed-refs file. Write the SHA1 to sha1.
1161 * Return a pointer to the refname within the line (null-terminated),
1162 * or NULL if there was a problem.
1164 static const char *parse_ref_line(struct strbuf
*line
, unsigned char *sha1
)
1169 * 42: the answer to everything.
1171 * In this case, it happens to be the answer to
1172 * 40 (length of sha1 hex representation)
1173 * +1 (space in between hex and name)
1174 * +1 (newline at the end of the line)
1176 if (line
->len
<= 42)
1179 if (get_sha1_hex(line
->buf
, sha1
) < 0)
1181 if (!isspace(line
->buf
[40]))
1184 ref
= line
->buf
+ 41;
1188 if (line
->buf
[line
->len
- 1] != '\n')
1190 line
->buf
[--line
->len
] = 0;
1196 * Read f, which is a packed-refs file, into dir.
1198 * A comment line of the form "# pack-refs with: " may contain zero or
1199 * more traits. We interpret the traits as follows:
1203 * Probably no references are peeled. But if the file contains a
1204 * peeled value for a reference, we will use it.
1208 * References under "refs/tags/", if they *can* be peeled, *are*
1209 * peeled in this file. References outside of "refs/tags/" are
1210 * probably not peeled even if they could have been, but if we find
1211 * a peeled value for such a reference we will use it.
1215 * All references in the file that can be peeled are peeled.
1216 * Inversely (and this is more important), any references in the
1217 * file for which no peeled value is recorded is not peelable. This
1218 * trait should typically be written alongside "peeled" for
1219 * compatibility with older clients, but we do not require it
1220 * (i.e., "peeled" is a no-op if "fully-peeled" is set).
1222 static void read_packed_refs(FILE *f
, struct ref_dir
*dir
)
1224 struct ref_entry
*last
= NULL
;
1225 struct strbuf line
= STRBUF_INIT
;
1226 enum { PEELED_NONE
, PEELED_TAGS
, PEELED_FULLY
} peeled
= PEELED_NONE
;
1228 while (strbuf_getwholeline(&line
, f
, '\n') != EOF
) {
1229 unsigned char sha1
[20];
1230 const char *refname
;
1233 if (skip_prefix(line
.buf
, "# pack-refs with:", &traits
)) {
1234 if (strstr(traits
, " fully-peeled "))
1235 peeled
= PEELED_FULLY
;
1236 else if (strstr(traits
, " peeled "))
1237 peeled
= PEELED_TAGS
;
1238 /* perhaps other traits later as well */
1242 refname
= parse_ref_line(&line
, sha1
);
1244 int flag
= REF_ISPACKED
;
1246 if (check_refname_format(refname
, REFNAME_ALLOW_ONELEVEL
)) {
1248 flag
|= REF_BAD_NAME
| REF_ISBROKEN
;
1250 last
= create_ref_entry(refname
, sha1
, flag
, 0);
1251 if (peeled
== PEELED_FULLY
||
1252 (peeled
== PEELED_TAGS
&& starts_with(refname
, "refs/tags/")))
1253 last
->flag
|= REF_KNOWS_PEELED
;
1258 line
.buf
[0] == '^' &&
1259 line
.len
== PEELED_LINE_LENGTH
&&
1260 line
.buf
[PEELED_LINE_LENGTH
- 1] == '\n' &&
1261 !get_sha1_hex(line
.buf
+ 1, sha1
)) {
1262 hashcpy(last
->u
.value
.peeled
, sha1
);
1264 * Regardless of what the file header said,
1265 * we definitely know the value of *this*
1268 last
->flag
|= REF_KNOWS_PEELED
;
1272 strbuf_release(&line
);
1276 * Get the packed_ref_cache for the specified ref_cache, creating it
1279 static struct packed_ref_cache
*get_packed_ref_cache(struct ref_cache
*refs
)
1281 const char *packed_refs_file
;
1284 packed_refs_file
= git_path_submodule(refs
->name
, "packed-refs");
1286 packed_refs_file
= git_path("packed-refs");
1289 !stat_validity_check(&refs
->packed
->validity
, packed_refs_file
))
1290 clear_packed_ref_cache(refs
);
1292 if (!refs
->packed
) {
1295 refs
->packed
= xcalloc(1, sizeof(*refs
->packed
));
1296 acquire_packed_ref_cache(refs
->packed
);
1297 refs
->packed
->root
= create_dir_entry(refs
, "", 0, 0);
1298 f
= fopen(packed_refs_file
, "r");
1300 stat_validity_update(&refs
->packed
->validity
, fileno(f
));
1301 read_packed_refs(f
, get_ref_dir(refs
->packed
->root
));
1305 return refs
->packed
;
1308 static struct ref_dir
*get_packed_ref_dir(struct packed_ref_cache
*packed_ref_cache
)
1310 return get_ref_dir(packed_ref_cache
->root
);
1313 static struct ref_dir
*get_packed_refs(struct ref_cache
*refs
)
1315 return get_packed_ref_dir(get_packed_ref_cache(refs
));
1318 void add_packed_ref(const char *refname
, const unsigned char *sha1
)
1320 struct packed_ref_cache
*packed_ref_cache
=
1321 get_packed_ref_cache(&ref_cache
);
1323 if (!packed_ref_cache
->lock
)
1324 die("internal error: packed refs not locked");
1325 add_ref(get_packed_ref_dir(packed_ref_cache
),
1326 create_ref_entry(refname
, sha1
, REF_ISPACKED
, 1));
1330 * Read the loose references from the namespace dirname into dir
1331 * (without recursing). dirname must end with '/'. dir must be the
1332 * directory entry corresponding to dirname.
1334 static void read_loose_refs(const char *dirname
, struct ref_dir
*dir
)
1336 struct ref_cache
*refs
= dir
->ref_cache
;
1340 int dirnamelen
= strlen(dirname
);
1341 struct strbuf refname
;
1344 path
= git_path_submodule(refs
->name
, "%s", dirname
);
1346 path
= git_path("%s", dirname
);
1352 strbuf_init(&refname
, dirnamelen
+ 257);
1353 strbuf_add(&refname
, dirname
, dirnamelen
);
1355 while ((de
= readdir(d
)) != NULL
) {
1356 unsigned char sha1
[20];
1361 if (de
->d_name
[0] == '.')
1363 if (ends_with(de
->d_name
, ".lock"))
1365 strbuf_addstr(&refname
, de
->d_name
);
1366 refdir
= *refs
->name
1367 ? git_path_submodule(refs
->name
, "%s", refname
.buf
)
1368 : git_path("%s", refname
.buf
);
1369 if (stat(refdir
, &st
) < 0) {
1370 ; /* silently ignore */
1371 } else if (S_ISDIR(st
.st_mode
)) {
1372 strbuf_addch(&refname
, '/');
1373 add_entry_to_dir(dir
,
1374 create_dir_entry(refs
, refname
.buf
,
1380 if (resolve_gitlink_ref(refs
->name
, refname
.buf
, sha1
) < 0) {
1382 flag
|= REF_ISBROKEN
;
1384 } else if (read_ref_full(refname
.buf
,
1385 RESOLVE_REF_READING
,
1388 flag
|= REF_ISBROKEN
;
1390 if (check_refname_format(refname
.buf
,
1391 REFNAME_ALLOW_ONELEVEL
)) {
1393 flag
|= REF_BAD_NAME
| REF_ISBROKEN
;
1395 add_entry_to_dir(dir
,
1396 create_ref_entry(refname
.buf
, sha1
, flag
, 0));
1398 strbuf_setlen(&refname
, dirnamelen
);
1400 strbuf_release(&refname
);
1404 static struct ref_dir
*get_loose_refs(struct ref_cache
*refs
)
1408 * Mark the top-level directory complete because we
1409 * are about to read the only subdirectory that can
1412 refs
->loose
= create_dir_entry(refs
, "", 0, 0);
1414 * Create an incomplete entry for "refs/":
1416 add_entry_to_dir(get_ref_dir(refs
->loose
),
1417 create_dir_entry(refs
, "refs/", 5, 1));
1419 return get_ref_dir(refs
->loose
);
1422 /* We allow "recursive" symbolic refs. Only within reason, though */
1424 #define MAXREFLEN (1024)
1427 * Called by resolve_gitlink_ref_recursive() after it failed to read
1428 * from the loose refs in ref_cache refs. Find <refname> in the
1429 * packed-refs file for the submodule.
1431 static int resolve_gitlink_packed_ref(struct ref_cache
*refs
,
1432 const char *refname
, unsigned char *sha1
)
1434 struct ref_entry
*ref
;
1435 struct ref_dir
*dir
= get_packed_refs(refs
);
1437 ref
= find_ref(dir
, refname
);
1441 hashcpy(sha1
, ref
->u
.value
.sha1
);
1445 static int resolve_gitlink_ref_recursive(struct ref_cache
*refs
,
1446 const char *refname
, unsigned char *sha1
,
1450 char buffer
[128], *p
;
1453 if (recursion
> MAXDEPTH
|| strlen(refname
) > MAXREFLEN
)
1456 ? git_path_submodule(refs
->name
, "%s", refname
)
1457 : git_path("%s", refname
);
1458 fd
= open(path
, O_RDONLY
);
1460 return resolve_gitlink_packed_ref(refs
, refname
, sha1
);
1462 len
= read(fd
, buffer
, sizeof(buffer
)-1);
1466 while (len
&& isspace(buffer
[len
-1]))
1470 /* Was it a detached head or an old-fashioned symlink? */
1471 if (!get_sha1_hex(buffer
, sha1
))
1475 if (strncmp(buffer
, "ref:", 4))
1481 return resolve_gitlink_ref_recursive(refs
, p
, sha1
, recursion
+1);
1484 int resolve_gitlink_ref(const char *path
, const char *refname
, unsigned char *sha1
)
1486 int len
= strlen(path
), retval
;
1488 struct ref_cache
*refs
;
1490 while (len
&& path
[len
-1] == '/')
1494 submodule
= xstrndup(path
, len
);
1495 refs
= get_ref_cache(submodule
);
1498 retval
= resolve_gitlink_ref_recursive(refs
, refname
, sha1
, 0);
1503 * Return the ref_entry for the given refname from the packed
1504 * references. If it does not exist, return NULL.
1506 static struct ref_entry
*get_packed_ref(const char *refname
)
1508 return find_ref(get_packed_refs(&ref_cache
), refname
);
1512 * A loose ref file doesn't exist; check for a packed ref. The
1513 * options are forwarded from resolve_safe_unsafe().
1515 static int resolve_missing_loose_ref(const char *refname
,
1517 unsigned char *sha1
,
1520 struct ref_entry
*entry
;
1523 * The loose reference file does not exist; check for a packed
1526 entry
= get_packed_ref(refname
);
1528 hashcpy(sha1
, entry
->u
.value
.sha1
);
1530 *flags
|= REF_ISPACKED
;
1533 /* The reference is not a packed reference, either. */
1534 if (resolve_flags
& RESOLVE_REF_READING
) {
1543 /* This function needs to return a meaningful errno on failure */
1544 const char *resolve_ref_unsafe(const char *refname
, int resolve_flags
, unsigned char *sha1
, int *flags
)
1546 int depth
= MAXDEPTH
;
1549 static char refname_buffer
[256];
1555 if (check_refname_format(refname
, REFNAME_ALLOW_ONELEVEL
)) {
1557 *flags
|= REF_BAD_NAME
;
1559 if (!(resolve_flags
& RESOLVE_REF_ALLOW_BAD_NAME
) ||
1560 !refname_is_safe(refname
)) {
1565 * dwim_ref() uses REF_ISBROKEN to distinguish between
1566 * missing refs and refs that were present but invalid,
1567 * to complain about the latter to stderr.
1569 * We don't know whether the ref exists, so don't set
1575 char path
[PATH_MAX
];
1585 git_snpath(path
, sizeof(path
), "%s", refname
);
1588 * We might have to loop back here to avoid a race
1589 * condition: first we lstat() the file, then we try
1590 * to read it as a link or as a file. But if somebody
1591 * changes the type of the file (file <-> directory
1592 * <-> symlink) between the lstat() and reading, then
1593 * we don't want to report that as an error but rather
1594 * try again starting with the lstat().
1597 if (lstat(path
, &st
) < 0) {
1598 if (errno
!= ENOENT
)
1600 if (resolve_missing_loose_ref(refname
, resolve_flags
,
1606 *flags
|= REF_ISBROKEN
;
1611 /* Follow "normalized" - ie "refs/.." symlinks by hand */
1612 if (S_ISLNK(st
.st_mode
)) {
1613 len
= readlink(path
, buffer
, sizeof(buffer
)-1);
1615 if (errno
== ENOENT
|| errno
== EINVAL
)
1616 /* inconsistent with lstat; retry */
1622 if (starts_with(buffer
, "refs/") &&
1623 !check_refname_format(buffer
, 0)) {
1624 strcpy(refname_buffer
, buffer
);
1625 refname
= refname_buffer
;
1627 *flags
|= REF_ISSYMREF
;
1628 if (resolve_flags
& RESOLVE_REF_NO_RECURSE
) {
1636 /* Is it a directory? */
1637 if (S_ISDIR(st
.st_mode
)) {
1643 * Anything else, just open it and try to use it as
1646 fd
= open(path
, O_RDONLY
);
1648 if (errno
== ENOENT
)
1649 /* inconsistent with lstat; retry */
1654 len
= read_in_full(fd
, buffer
, sizeof(buffer
)-1);
1656 int save_errno
= errno
;
1662 while (len
&& isspace(buffer
[len
-1]))
1667 * Is it a symbolic ref?
1669 if (!starts_with(buffer
, "ref:")) {
1671 * Please note that FETCH_HEAD has a second
1672 * line containing other data.
1674 if (get_sha1_hex(buffer
, sha1
) ||
1675 (buffer
[40] != '\0' && !isspace(buffer
[40]))) {
1677 *flags
|= REF_ISBROKEN
;
1684 *flags
|= REF_ISBROKEN
;
1689 *flags
|= REF_ISSYMREF
;
1691 while (isspace(*buf
))
1693 refname
= strcpy(refname_buffer
, buf
);
1694 if (resolve_flags
& RESOLVE_REF_NO_RECURSE
) {
1698 if (check_refname_format(buf
, REFNAME_ALLOW_ONELEVEL
)) {
1700 *flags
|= REF_ISBROKEN
;
1702 if (!(resolve_flags
& RESOLVE_REF_ALLOW_BAD_NAME
) ||
1703 !refname_is_safe(buf
)) {
1712 char *resolve_refdup(const char *ref
, int resolve_flags
, unsigned char *sha1
, int *flags
)
1714 return xstrdup_or_null(resolve_ref_unsafe(ref
, resolve_flags
, sha1
, flags
));
1717 /* The argument to filter_refs */
1719 const char *pattern
;
1724 int read_ref_full(const char *refname
, int resolve_flags
, unsigned char *sha1
, int *flags
)
1726 if (resolve_ref_unsafe(refname
, resolve_flags
, sha1
, flags
))
1731 int read_ref(const char *refname
, unsigned char *sha1
)
1733 return read_ref_full(refname
, RESOLVE_REF_READING
, sha1
, NULL
);
1736 int ref_exists(const char *refname
)
1738 unsigned char sha1
[20];
1739 return !!resolve_ref_unsafe(refname
, RESOLVE_REF_READING
, sha1
, NULL
);
1742 static int filter_refs(const char *refname
, const unsigned char *sha1
, int flags
,
1745 struct ref_filter
*filter
= (struct ref_filter
*)data
;
1746 if (wildmatch(filter
->pattern
, refname
, 0, NULL
))
1748 return filter
->fn(refname
, sha1
, flags
, filter
->cb_data
);
1752 /* object was peeled successfully: */
1756 * object cannot be peeled because the named object (or an
1757 * object referred to by a tag in the peel chain), does not
1762 /* object cannot be peeled because it is not a tag: */
1765 /* ref_entry contains no peeled value because it is a symref: */
1766 PEEL_IS_SYMREF
= -3,
1769 * ref_entry cannot be peeled because it is broken (i.e., the
1770 * symbolic reference cannot even be resolved to an object
1777 * Peel the named object; i.e., if the object is a tag, resolve the
1778 * tag recursively until a non-tag is found. If successful, store the
1779 * result to sha1 and return PEEL_PEELED. If the object is not a tag
1780 * or is not valid, return PEEL_NON_TAG or PEEL_INVALID, respectively,
1781 * and leave sha1 unchanged.
1783 static enum peel_status
peel_object(const unsigned char *name
, unsigned char *sha1
)
1785 struct object
*o
= lookup_unknown_object(name
);
1787 if (o
->type
== OBJ_NONE
) {
1788 int type
= sha1_object_info(name
, NULL
);
1789 if (type
< 0 || !object_as_type(o
, type
, 0))
1790 return PEEL_INVALID
;
1793 if (o
->type
!= OBJ_TAG
)
1794 return PEEL_NON_TAG
;
1796 o
= deref_tag_noverify(o
);
1798 return PEEL_INVALID
;
1800 hashcpy(sha1
, o
->sha1
);
1805 * Peel the entry (if possible) and return its new peel_status. If
1806 * repeel is true, re-peel the entry even if there is an old peeled
1807 * value that is already stored in it.
1809 * It is OK to call this function with a packed reference entry that
1810 * might be stale and might even refer to an object that has since
1811 * been garbage-collected. In such a case, if the entry has
1812 * REF_KNOWS_PEELED then leave the status unchanged and return
1813 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.
1815 static enum peel_status
peel_entry(struct ref_entry
*entry
, int repeel
)
1817 enum peel_status status
;
1819 if (entry
->flag
& REF_KNOWS_PEELED
) {
1821 entry
->flag
&= ~REF_KNOWS_PEELED
;
1822 hashclr(entry
->u
.value
.peeled
);
1824 return is_null_sha1(entry
->u
.value
.peeled
) ?
1825 PEEL_NON_TAG
: PEEL_PEELED
;
1828 if (entry
->flag
& REF_ISBROKEN
)
1830 if (entry
->flag
& REF_ISSYMREF
)
1831 return PEEL_IS_SYMREF
;
1833 status
= peel_object(entry
->u
.value
.sha1
, entry
->u
.value
.peeled
);
1834 if (status
== PEEL_PEELED
|| status
== PEEL_NON_TAG
)
1835 entry
->flag
|= REF_KNOWS_PEELED
;
1839 int peel_ref(const char *refname
, unsigned char *sha1
)
1842 unsigned char base
[20];
1844 if (current_ref
&& (current_ref
->name
== refname
1845 || !strcmp(current_ref
->name
, refname
))) {
1846 if (peel_entry(current_ref
, 0))
1848 hashcpy(sha1
, current_ref
->u
.value
.peeled
);
1852 if (read_ref_full(refname
, RESOLVE_REF_READING
, base
, &flag
))
1856 * If the reference is packed, read its ref_entry from the
1857 * cache in the hope that we already know its peeled value.
1858 * We only try this optimization on packed references because
1859 * (a) forcing the filling of the loose reference cache could
1860 * be expensive and (b) loose references anyway usually do not
1861 * have REF_KNOWS_PEELED.
1863 if (flag
& REF_ISPACKED
) {
1864 struct ref_entry
*r
= get_packed_ref(refname
);
1866 if (peel_entry(r
, 0))
1868 hashcpy(sha1
, r
->u
.value
.peeled
);
1873 return peel_object(base
, sha1
);
1876 struct warn_if_dangling_data
{
1878 const char *refname
;
1879 const struct string_list
*refnames
;
1880 const char *msg_fmt
;
1883 static int warn_if_dangling_symref(const char *refname
, const unsigned char *sha1
,
1884 int flags
, void *cb_data
)
1886 struct warn_if_dangling_data
*d
= cb_data
;
1887 const char *resolves_to
;
1888 unsigned char junk
[20];
1890 if (!(flags
& REF_ISSYMREF
))
1893 resolves_to
= resolve_ref_unsafe(refname
, 0, junk
, NULL
);
1896 ? strcmp(resolves_to
, d
->refname
)
1897 : !string_list_has_string(d
->refnames
, resolves_to
))) {
1901 fprintf(d
->fp
, d
->msg_fmt
, refname
);
1906 void warn_dangling_symref(FILE *fp
, const char *msg_fmt
, const char *refname
)
1908 struct warn_if_dangling_data data
;
1911 data
.refname
= refname
;
1912 data
.refnames
= NULL
;
1913 data
.msg_fmt
= msg_fmt
;
1914 for_each_rawref(warn_if_dangling_symref
, &data
);
1917 void warn_dangling_symrefs(FILE *fp
, const char *msg_fmt
, const struct string_list
*refnames
)
1919 struct warn_if_dangling_data data
;
1922 data
.refname
= NULL
;
1923 data
.refnames
= refnames
;
1924 data
.msg_fmt
= msg_fmt
;
1925 for_each_rawref(warn_if_dangling_symref
, &data
);
1929 * Call fn for each reference in the specified ref_cache, omitting
1930 * references not in the containing_dir of base. fn is called for all
1931 * references, including broken ones. If fn ever returns a non-zero
1932 * value, stop the iteration and return that value; otherwise, return
1935 static int do_for_each_entry(struct ref_cache
*refs
, const char *base
,
1936 each_ref_entry_fn fn
, void *cb_data
)
1938 struct packed_ref_cache
*packed_ref_cache
;
1939 struct ref_dir
*loose_dir
;
1940 struct ref_dir
*packed_dir
;
1944 * We must make sure that all loose refs are read before accessing the
1945 * packed-refs file; this avoids a race condition in which loose refs
1946 * are migrated to the packed-refs file by a simultaneous process, but
1947 * our in-memory view is from before the migration. get_packed_ref_cache()
1948 * takes care of making sure our view is up to date with what is on
1951 loose_dir
= get_loose_refs(refs
);
1952 if (base
&& *base
) {
1953 loose_dir
= find_containing_dir(loose_dir
, base
, 0);
1956 prime_ref_dir(loose_dir
);
1958 packed_ref_cache
= get_packed_ref_cache(refs
);
1959 acquire_packed_ref_cache(packed_ref_cache
);
1960 packed_dir
= get_packed_ref_dir(packed_ref_cache
);
1961 if (base
&& *base
) {
1962 packed_dir
= find_containing_dir(packed_dir
, base
, 0);
1965 if (packed_dir
&& loose_dir
) {
1966 sort_ref_dir(packed_dir
);
1967 sort_ref_dir(loose_dir
);
1968 retval
= do_for_each_entry_in_dirs(
1969 packed_dir
, loose_dir
, fn
, cb_data
);
1970 } else if (packed_dir
) {
1971 sort_ref_dir(packed_dir
);
1972 retval
= do_for_each_entry_in_dir(
1973 packed_dir
, 0, fn
, cb_data
);
1974 } else if (loose_dir
) {
1975 sort_ref_dir(loose_dir
);
1976 retval
= do_for_each_entry_in_dir(
1977 loose_dir
, 0, fn
, cb_data
);
1980 release_packed_ref_cache(packed_ref_cache
);
1985 * Call fn for each reference in the specified ref_cache for which the
1986 * refname begins with base. If trim is non-zero, then trim that many
1987 * characters off the beginning of each refname before passing the
1988 * refname to fn. flags can be DO_FOR_EACH_INCLUDE_BROKEN to include
1989 * broken references in the iteration. If fn ever returns a non-zero
1990 * value, stop the iteration and return that value; otherwise, return
1993 static int do_for_each_ref(struct ref_cache
*refs
, const char *base
,
1994 each_ref_fn fn
, int trim
, int flags
, void *cb_data
)
1996 struct ref_entry_cb data
;
2001 data
.cb_data
= cb_data
;
2003 if (ref_paranoia
< 0)
2004 ref_paranoia
= git_env_bool("GIT_REF_PARANOIA", 0);
2006 data
.flags
|= DO_FOR_EACH_INCLUDE_BROKEN
;
2008 return do_for_each_entry(refs
, base
, do_one_ref
, &data
);
2011 static int do_head_ref(const char *submodule
, each_ref_fn fn
, void *cb_data
)
2013 unsigned char sha1
[20];
2017 if (resolve_gitlink_ref(submodule
, "HEAD", sha1
) == 0)
2018 return fn("HEAD", sha1
, 0, cb_data
);
2023 if (!read_ref_full("HEAD", RESOLVE_REF_READING
, sha1
, &flag
))
2024 return fn("HEAD", sha1
, flag
, cb_data
);
2029 int head_ref(each_ref_fn fn
, void *cb_data
)
2031 return do_head_ref(NULL
, fn
, cb_data
);
2034 int head_ref_submodule(const char *submodule
, each_ref_fn fn
, void *cb_data
)
2036 return do_head_ref(submodule
, fn
, cb_data
);
2039 int for_each_ref(each_ref_fn fn
, void *cb_data
)
2041 return do_for_each_ref(&ref_cache
, "", fn
, 0, 0, cb_data
);
2044 int for_each_ref_submodule(const char *submodule
, each_ref_fn fn
, void *cb_data
)
2046 return do_for_each_ref(get_ref_cache(submodule
), "", fn
, 0, 0, cb_data
);
2049 int for_each_ref_in(const char *prefix
, each_ref_fn fn
, void *cb_data
)
2051 return do_for_each_ref(&ref_cache
, prefix
, fn
, strlen(prefix
), 0, cb_data
);
2054 int for_each_ref_in_submodule(const char *submodule
, const char *prefix
,
2055 each_ref_fn fn
, void *cb_data
)
2057 return do_for_each_ref(get_ref_cache(submodule
), prefix
, fn
, strlen(prefix
), 0, cb_data
);
2060 int for_each_tag_ref(each_ref_fn fn
, void *cb_data
)
2062 return for_each_ref_in("refs/tags/", fn
, cb_data
);
2065 int for_each_tag_ref_submodule(const char *submodule
, each_ref_fn fn
, void *cb_data
)
2067 return for_each_ref_in_submodule(submodule
, "refs/tags/", fn
, cb_data
);
2070 int for_each_branch_ref(each_ref_fn fn
, void *cb_data
)
2072 return for_each_ref_in("refs/heads/", fn
, cb_data
);
2075 int for_each_branch_ref_submodule(const char *submodule
, each_ref_fn fn
, void *cb_data
)
2077 return for_each_ref_in_submodule(submodule
, "refs/heads/", fn
, cb_data
);
2080 int for_each_remote_ref(each_ref_fn fn
, void *cb_data
)
2082 return for_each_ref_in("refs/remotes/", fn
, cb_data
);
2085 int for_each_remote_ref_submodule(const char *submodule
, each_ref_fn fn
, void *cb_data
)
2087 return for_each_ref_in_submodule(submodule
, "refs/remotes/", fn
, cb_data
);
2090 int for_each_replace_ref(each_ref_fn fn
, void *cb_data
)
2092 return do_for_each_ref(&ref_cache
, "refs/replace/", fn
, 13, 0, cb_data
);
2095 int head_ref_namespaced(each_ref_fn fn
, void *cb_data
)
2097 struct strbuf buf
= STRBUF_INIT
;
2099 unsigned char sha1
[20];
2102 strbuf_addf(&buf
, "%sHEAD", get_git_namespace());
2103 if (!read_ref_full(buf
.buf
, RESOLVE_REF_READING
, sha1
, &flag
))
2104 ret
= fn(buf
.buf
, sha1
, flag
, cb_data
);
2105 strbuf_release(&buf
);
2110 int for_each_namespaced_ref(each_ref_fn fn
, void *cb_data
)
2112 struct strbuf buf
= STRBUF_INIT
;
2114 strbuf_addf(&buf
, "%srefs/", get_git_namespace());
2115 ret
= do_for_each_ref(&ref_cache
, buf
.buf
, fn
, 0, 0, cb_data
);
2116 strbuf_release(&buf
);
2120 int for_each_glob_ref_in(each_ref_fn fn
, const char *pattern
,
2121 const char *prefix
, void *cb_data
)
2123 struct strbuf real_pattern
= STRBUF_INIT
;
2124 struct ref_filter filter
;
2127 if (!prefix
&& !starts_with(pattern
, "refs/"))
2128 strbuf_addstr(&real_pattern
, "refs/");
2130 strbuf_addstr(&real_pattern
, prefix
);
2131 strbuf_addstr(&real_pattern
, pattern
);
2133 if (!has_glob_specials(pattern
)) {
2134 /* Append implied '/' '*' if not present. */
2135 if (real_pattern
.buf
[real_pattern
.len
- 1] != '/')
2136 strbuf_addch(&real_pattern
, '/');
2137 /* No need to check for '*', there is none. */
2138 strbuf_addch(&real_pattern
, '*');
2141 filter
.pattern
= real_pattern
.buf
;
2143 filter
.cb_data
= cb_data
;
2144 ret
= for_each_ref(filter_refs
, &filter
);
2146 strbuf_release(&real_pattern
);
2150 int for_each_glob_ref(each_ref_fn fn
, const char *pattern
, void *cb_data
)
2152 return for_each_glob_ref_in(fn
, pattern
, NULL
, cb_data
);
2155 int for_each_rawref(each_ref_fn fn
, void *cb_data
)
2157 return do_for_each_ref(&ref_cache
, "", fn
, 0,
2158 DO_FOR_EACH_INCLUDE_BROKEN
, cb_data
);
2161 const char *prettify_refname(const char *name
)
2164 starts_with(name
, "refs/heads/") ? 11 :
2165 starts_with(name
, "refs/tags/") ? 10 :
2166 starts_with(name
, "refs/remotes/") ? 13 :
2170 static const char *ref_rev_parse_rules
[] = {
2175 "refs/remotes/%.*s",
2176 "refs/remotes/%.*s/HEAD",
2180 int refname_match(const char *abbrev_name
, const char *full_name
)
2183 const int abbrev_name_len
= strlen(abbrev_name
);
2185 for (p
= ref_rev_parse_rules
; *p
; p
++) {
2186 if (!strcmp(full_name
, mkpath(*p
, abbrev_name_len
, abbrev_name
))) {
2194 static void unlock_ref(struct ref_lock
*lock
)
2196 /* Do not free lock->lk -- atexit() still looks at them */
2198 rollback_lock_file(lock
->lk
);
2199 free(lock
->ref_name
);
2200 free(lock
->orig_ref_name
);
2204 /* This function should make sure errno is meaningful on error */
2205 static struct ref_lock
*verify_lock(struct ref_lock
*lock
,
2206 const unsigned char *old_sha1
, int mustexist
)
2208 if (read_ref_full(lock
->ref_name
,
2209 mustexist
? RESOLVE_REF_READING
: 0,
2210 lock
->old_sha1
, NULL
)) {
2211 int save_errno
= errno
;
2212 error("Can't verify ref %s", lock
->ref_name
);
2217 if (hashcmp(lock
->old_sha1
, old_sha1
)) {
2218 error("Ref %s is at %s but expected %s", lock
->ref_name
,
2219 sha1_to_hex(lock
->old_sha1
), sha1_to_hex(old_sha1
));
2227 static int remove_empty_directories(const char *file
)
2229 /* we want to create a file but there is a directory there;
2230 * if that is an empty directory (or a directory that contains
2231 * only empty directories), remove them.
2234 int result
, save_errno
;
2236 strbuf_init(&path
, 20);
2237 strbuf_addstr(&path
, file
);
2239 result
= remove_dir_recursively(&path
, REMOVE_DIR_EMPTY_ONLY
);
2242 strbuf_release(&path
);
2249 * *string and *len will only be substituted, and *string returned (for
2250 * later free()ing) if the string passed in is a magic short-hand form
2253 static char *substitute_branch_name(const char **string
, int *len
)
2255 struct strbuf buf
= STRBUF_INIT
;
2256 int ret
= interpret_branch_name(*string
, *len
, &buf
);
2260 *string
= strbuf_detach(&buf
, &size
);
2262 return (char *)*string
;
2268 int dwim_ref(const char *str
, int len
, unsigned char *sha1
, char **ref
)
2270 char *last_branch
= substitute_branch_name(&str
, &len
);
2275 for (p
= ref_rev_parse_rules
; *p
; p
++) {
2276 char fullref
[PATH_MAX
];
2277 unsigned char sha1_from_ref
[20];
2278 unsigned char *this_result
;
2281 this_result
= refs_found
? sha1_from_ref
: sha1
;
2282 mksnpath(fullref
, sizeof(fullref
), *p
, len
, str
);
2283 r
= resolve_ref_unsafe(fullref
, RESOLVE_REF_READING
,
2284 this_result
, &flag
);
2288 if (!warn_ambiguous_refs
)
2290 } else if ((flag
& REF_ISSYMREF
) && strcmp(fullref
, "HEAD")) {
2291 warning("ignoring dangling symref %s.", fullref
);
2292 } else if ((flag
& REF_ISBROKEN
) && strchr(fullref
, '/')) {
2293 warning("ignoring broken ref %s.", fullref
);
2300 int dwim_log(const char *str
, int len
, unsigned char *sha1
, char **log
)
2302 char *last_branch
= substitute_branch_name(&str
, &len
);
2307 for (p
= ref_rev_parse_rules
; *p
; p
++) {
2308 unsigned char hash
[20];
2309 char path
[PATH_MAX
];
2310 const char *ref
, *it
;
2312 mksnpath(path
, sizeof(path
), *p
, len
, str
);
2313 ref
= resolve_ref_unsafe(path
, RESOLVE_REF_READING
,
2317 if (reflog_exists(path
))
2319 else if (strcmp(ref
, path
) && reflog_exists(ref
))
2323 if (!logs_found
++) {
2325 hashcpy(sha1
, hash
);
2327 if (!warn_ambiguous_refs
)
2335 * Locks a ref returning the lock on success and NULL on failure.
2336 * On failure errno is set to something meaningful.
2338 static struct ref_lock
*lock_ref_sha1_basic(const char *refname
,
2339 const unsigned char *old_sha1
,
2340 const struct string_list
*extras
,
2341 const struct string_list
*skip
,
2342 unsigned int flags
, int *type_p
,
2346 const char *orig_refname
= refname
;
2347 struct ref_lock
*lock
;
2350 int mustexist
= (old_sha1
&& !is_null_sha1(old_sha1
));
2351 int resolve_flags
= 0;
2352 int attempts_remaining
= 3;
2356 lock
= xcalloc(1, sizeof(struct ref_lock
));
2360 resolve_flags
|= RESOLVE_REF_READING
;
2361 if (flags
& REF_DELETING
) {
2362 resolve_flags
|= RESOLVE_REF_ALLOW_BAD_NAME
;
2363 if (flags
& REF_NODEREF
)
2364 resolve_flags
|= RESOLVE_REF_NO_RECURSE
;
2367 refname
= resolve_ref_unsafe(refname
, resolve_flags
,
2368 lock
->old_sha1
, &type
);
2369 if (!refname
&& errno
== EISDIR
) {
2370 /* we are trying to lock foo but we used to
2371 * have foo/bar which now does not exist;
2372 * it is normal for the empty directory 'foo'
2375 ref_file
= git_path("%s", orig_refname
);
2376 if (remove_empty_directories(ref_file
)) {
2379 if (!verify_refname_available(orig_refname
, extras
, skip
,
2380 get_loose_refs(&ref_cache
), err
))
2381 strbuf_addf(err
, "there are still refs under '%s'",
2386 refname
= resolve_ref_unsafe(orig_refname
, resolve_flags
,
2387 lock
->old_sha1
, &type
);
2393 if (last_errno
!= ENOTDIR
||
2394 !verify_refname_available(orig_refname
, extras
, skip
,
2395 get_loose_refs(&ref_cache
), err
))
2396 strbuf_addf(err
, "unable to resolve reference %s: %s",
2397 orig_refname
, strerror(last_errno
));
2402 * If the ref did not exist and we are creating it, make sure
2403 * there is no existing packed ref whose name begins with our
2404 * refname, nor a packed ref whose name is a proper prefix of
2407 if (is_null_sha1(lock
->old_sha1
) &&
2408 verify_refname_available(refname
, extras
, skip
,
2409 get_packed_refs(&ref_cache
), err
)) {
2410 last_errno
= ENOTDIR
;
2414 lock
->lk
= xcalloc(1, sizeof(struct lock_file
));
2417 if (flags
& REF_NODEREF
) {
2418 refname
= orig_refname
;
2419 lflags
|= LOCK_NO_DEREF
;
2421 lock
->ref_name
= xstrdup(refname
);
2422 lock
->orig_ref_name
= xstrdup(orig_refname
);
2423 ref_file
= git_path("%s", refname
);
2426 switch (safe_create_leading_directories(ref_file
)) {
2428 break; /* success */
2430 if (--attempts_remaining
> 0)
2435 strbuf_addf(err
, "unable to create directory for %s", ref_file
);
2439 lock
->lock_fd
= hold_lock_file_for_update(lock
->lk
, ref_file
, lflags
);
2440 if (lock
->lock_fd
< 0) {
2442 if (errno
== ENOENT
&& --attempts_remaining
> 0)
2444 * Maybe somebody just deleted one of the
2445 * directories leading to ref_file. Try
2450 unable_to_lock_message(ref_file
, errno
, err
);
2454 return old_sha1
? verify_lock(lock
, old_sha1
, mustexist
) : lock
;
2463 * Write an entry to the packed-refs file for the specified refname.
2464 * If peeled is non-NULL, write it as the entry's peeled value.
2466 static void write_packed_entry(FILE *fh
, char *refname
, unsigned char *sha1
,
2467 unsigned char *peeled
)
2469 fprintf_or_die(fh
, "%s %s\n", sha1_to_hex(sha1
), refname
);
2471 fprintf_or_die(fh
, "^%s\n", sha1_to_hex(peeled
));
2475 * An each_ref_entry_fn that writes the entry to a packed-refs file.
2477 static int write_packed_entry_fn(struct ref_entry
*entry
, void *cb_data
)
2479 enum peel_status peel_status
= peel_entry(entry
, 0);
2481 if (peel_status
!= PEEL_PEELED
&& peel_status
!= PEEL_NON_TAG
)
2482 error("internal error: %s is not a valid packed reference!",
2484 write_packed_entry(cb_data
, entry
->name
, entry
->u
.value
.sha1
,
2485 peel_status
== PEEL_PEELED
?
2486 entry
->u
.value
.peeled
: NULL
);
2490 /* This should return a meaningful errno on failure */
2491 int lock_packed_refs(int flags
)
2493 struct packed_ref_cache
*packed_ref_cache
;
2495 if (hold_lock_file_for_update(&packlock
, git_path("packed-refs"), flags
) < 0)
2498 * Get the current packed-refs while holding the lock. If the
2499 * packed-refs file has been modified since we last read it,
2500 * this will automatically invalidate the cache and re-read
2501 * the packed-refs file.
2503 packed_ref_cache
= get_packed_ref_cache(&ref_cache
);
2504 packed_ref_cache
->lock
= &packlock
;
2505 /* Increment the reference count to prevent it from being freed: */
2506 acquire_packed_ref_cache(packed_ref_cache
);
2511 * Commit the packed refs changes.
2512 * On error we must make sure that errno contains a meaningful value.
2514 int commit_packed_refs(void)
2516 struct packed_ref_cache
*packed_ref_cache
=
2517 get_packed_ref_cache(&ref_cache
);
2522 if (!packed_ref_cache
->lock
)
2523 die("internal error: packed-refs not locked");
2525 out
= fdopen_lock_file(packed_ref_cache
->lock
, "w");
2527 die_errno("unable to fdopen packed-refs descriptor");
2529 fprintf_or_die(out
, "%s", PACKED_REFS_HEADER
);
2530 do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache
),
2531 0, write_packed_entry_fn
, out
);
2533 if (commit_lock_file(packed_ref_cache
->lock
)) {
2537 packed_ref_cache
->lock
= NULL
;
2538 release_packed_ref_cache(packed_ref_cache
);
2543 void rollback_packed_refs(void)
2545 struct packed_ref_cache
*packed_ref_cache
=
2546 get_packed_ref_cache(&ref_cache
);
2548 if (!packed_ref_cache
->lock
)
2549 die("internal error: packed-refs not locked");
2550 rollback_lock_file(packed_ref_cache
->lock
);
2551 packed_ref_cache
->lock
= NULL
;
2552 release_packed_ref_cache(packed_ref_cache
);
2553 clear_packed_ref_cache(&ref_cache
);
2556 struct ref_to_prune
{
2557 struct ref_to_prune
*next
;
2558 unsigned char sha1
[20];
2559 char name
[FLEX_ARRAY
];
2562 struct pack_refs_cb_data
{
2564 struct ref_dir
*packed_refs
;
2565 struct ref_to_prune
*ref_to_prune
;
2569 * An each_ref_entry_fn that is run over loose references only. If
2570 * the loose reference can be packed, add an entry in the packed ref
2571 * cache. If the reference should be pruned, also add it to
2572 * ref_to_prune in the pack_refs_cb_data.
2574 static int pack_if_possible_fn(struct ref_entry
*entry
, void *cb_data
)
2576 struct pack_refs_cb_data
*cb
= cb_data
;
2577 enum peel_status peel_status
;
2578 struct ref_entry
*packed_entry
;
2579 int is_tag_ref
= starts_with(entry
->name
, "refs/tags/");
2581 /* ALWAYS pack tags */
2582 if (!(cb
->flags
& PACK_REFS_ALL
) && !is_tag_ref
)
2585 /* Do not pack symbolic or broken refs: */
2586 if ((entry
->flag
& REF_ISSYMREF
) || !ref_resolves_to_object(entry
))
2589 /* Add a packed ref cache entry equivalent to the loose entry. */
2590 peel_status
= peel_entry(entry
, 1);
2591 if (peel_status
!= PEEL_PEELED
&& peel_status
!= PEEL_NON_TAG
)
2592 die("internal error peeling reference %s (%s)",
2593 entry
->name
, sha1_to_hex(entry
->u
.value
.sha1
));
2594 packed_entry
= find_ref(cb
->packed_refs
, entry
->name
);
2596 /* Overwrite existing packed entry with info from loose entry */
2597 packed_entry
->flag
= REF_ISPACKED
| REF_KNOWS_PEELED
;
2598 hashcpy(packed_entry
->u
.value
.sha1
, entry
->u
.value
.sha1
);
2600 packed_entry
= create_ref_entry(entry
->name
, entry
->u
.value
.sha1
,
2601 REF_ISPACKED
| REF_KNOWS_PEELED
, 0);
2602 add_ref(cb
->packed_refs
, packed_entry
);
2604 hashcpy(packed_entry
->u
.value
.peeled
, entry
->u
.value
.peeled
);
2606 /* Schedule the loose reference for pruning if requested. */
2607 if ((cb
->flags
& PACK_REFS_PRUNE
)) {
2608 int namelen
= strlen(entry
->name
) + 1;
2609 struct ref_to_prune
*n
= xcalloc(1, sizeof(*n
) + namelen
);
2610 hashcpy(n
->sha1
, entry
->u
.value
.sha1
);
2611 strcpy(n
->name
, entry
->name
);
2612 n
->next
= cb
->ref_to_prune
;
2613 cb
->ref_to_prune
= n
;
2619 * Remove empty parents, but spare refs/ and immediate subdirs.
2620 * Note: munges *name.
2622 static void try_remove_empty_parents(char *name
)
2627 for (i
= 0; i
< 2; i
++) { /* refs/{heads,tags,...}/ */
2628 while (*p
&& *p
!= '/')
2630 /* tolerate duplicate slashes; see check_refname_format() */
2634 for (q
= p
; *q
; q
++)
2637 while (q
> p
&& *q
!= '/')
2639 while (q
> p
&& *(q
-1) == '/')
2644 if (rmdir(git_path("%s", name
)))
2649 /* make sure nobody touched the ref, and unlink */
2650 static void prune_ref(struct ref_to_prune
*r
)
2652 struct ref_transaction
*transaction
;
2653 struct strbuf err
= STRBUF_INIT
;
2655 if (check_refname_format(r
->name
, 0))
2658 transaction
= ref_transaction_begin(&err
);
2660 ref_transaction_delete(transaction
, r
->name
, r
->sha1
,
2661 REF_ISPRUNING
, NULL
, &err
) ||
2662 ref_transaction_commit(transaction
, &err
)) {
2663 ref_transaction_free(transaction
);
2664 error("%s", err
.buf
);
2665 strbuf_release(&err
);
2668 ref_transaction_free(transaction
);
2669 strbuf_release(&err
);
2670 try_remove_empty_parents(r
->name
);
2673 static void prune_refs(struct ref_to_prune
*r
)
2681 int pack_refs(unsigned int flags
)
2683 struct pack_refs_cb_data cbdata
;
2685 memset(&cbdata
, 0, sizeof(cbdata
));
2686 cbdata
.flags
= flags
;
2688 lock_packed_refs(LOCK_DIE_ON_ERROR
);
2689 cbdata
.packed_refs
= get_packed_refs(&ref_cache
);
2691 do_for_each_entry_in_dir(get_loose_refs(&ref_cache
), 0,
2692 pack_if_possible_fn
, &cbdata
);
2694 if (commit_packed_refs())
2695 die_errno("unable to overwrite old ref-pack file");
2697 prune_refs(cbdata
.ref_to_prune
);
2701 int repack_without_refs(struct string_list
*refnames
, struct strbuf
*err
)
2703 struct ref_dir
*packed
;
2704 struct string_list_item
*refname
;
2705 int ret
, needs_repacking
= 0, removed
= 0;
2709 /* Look for a packed ref */
2710 for_each_string_list_item(refname
, refnames
) {
2711 if (get_packed_ref(refname
->string
)) {
2712 needs_repacking
= 1;
2717 /* Avoid locking if we have nothing to do */
2718 if (!needs_repacking
)
2719 return 0; /* no refname exists in packed refs */
2721 if (lock_packed_refs(0)) {
2722 unable_to_lock_message(git_path("packed-refs"), errno
, err
);
2725 packed
= get_packed_refs(&ref_cache
);
2727 /* Remove refnames from the cache */
2728 for_each_string_list_item(refname
, refnames
)
2729 if (remove_entry(packed
, refname
->string
) != -1)
2733 * All packed entries disappeared while we were
2734 * acquiring the lock.
2736 rollback_packed_refs();
2740 /* Write what remains */
2741 ret
= commit_packed_refs();
2743 strbuf_addf(err
, "unable to overwrite old ref-pack file: %s",
2748 static int delete_ref_loose(struct ref_lock
*lock
, int flag
, struct strbuf
*err
)
2752 if (!(flag
& REF_ISPACKED
) || flag
& REF_ISSYMREF
) {
2754 * loose. The loose file name is the same as the
2755 * lockfile name, minus ".lock":
2757 char *loose_filename
= get_locked_file_path(lock
->lk
);
2758 int res
= unlink_or_msg(loose_filename
, err
);
2759 free(loose_filename
);
2766 int delete_ref(const char *refname
, const unsigned char *sha1
, unsigned int flags
)
2768 struct ref_transaction
*transaction
;
2769 struct strbuf err
= STRBUF_INIT
;
2771 transaction
= ref_transaction_begin(&err
);
2773 ref_transaction_delete(transaction
, refname
,
2774 (sha1
&& !is_null_sha1(sha1
)) ? sha1
: NULL
,
2775 flags
, NULL
, &err
) ||
2776 ref_transaction_commit(transaction
, &err
)) {
2777 error("%s", err
.buf
);
2778 ref_transaction_free(transaction
);
2779 strbuf_release(&err
);
2782 ref_transaction_free(transaction
);
2783 strbuf_release(&err
);
2788 * People using contrib's git-new-workdir have .git/logs/refs ->
2789 * /some/other/path/.git/logs/refs, and that may live on another device.
2791 * IOW, to avoid cross device rename errors, the temporary renamed log must
2792 * live into logs/refs.
2794 #define TMP_RENAMED_LOG "logs/refs/.tmp-renamed-log"
2796 static int rename_tmp_log(const char *newrefname
)
2798 int attempts_remaining
= 4;
2801 switch (safe_create_leading_directories(git_path("logs/%s", newrefname
))) {
2803 break; /* success */
2805 if (--attempts_remaining
> 0)
2809 error("unable to create directory for %s", newrefname
);
2813 if (rename(git_path(TMP_RENAMED_LOG
), git_path("logs/%s", newrefname
))) {
2814 if ((errno
==EISDIR
|| errno
==ENOTDIR
) && --attempts_remaining
> 0) {
2816 * rename(a, b) when b is an existing
2817 * directory ought to result in ISDIR, but
2818 * Solaris 5.8 gives ENOTDIR. Sheesh.
2820 if (remove_empty_directories(git_path("logs/%s", newrefname
))) {
2821 error("Directory not empty: logs/%s", newrefname
);
2825 } else if (errno
== ENOENT
&& --attempts_remaining
> 0) {
2827 * Maybe another process just deleted one of
2828 * the directories in the path to newrefname.
2829 * Try again from the beginning.
2833 error("unable to move logfile "TMP_RENAMED_LOG
" to logs/%s: %s",
2834 newrefname
, strerror(errno
));
2841 static int rename_ref_available(const char *oldname
, const char *newname
)
2843 struct string_list skip
= STRING_LIST_INIT_NODUP
;
2844 struct strbuf err
= STRBUF_INIT
;
2847 string_list_insert(&skip
, oldname
);
2848 ret
= !verify_refname_available(newname
, NULL
, &skip
,
2849 get_packed_refs(&ref_cache
), &err
)
2850 && !verify_refname_available(newname
, NULL
, &skip
,
2851 get_loose_refs(&ref_cache
), &err
);
2853 error("%s", err
.buf
);
2855 string_list_clear(&skip
, 0);
2856 strbuf_release(&err
);
2860 static int write_ref_to_lockfile(struct ref_lock
*lock
, const unsigned char *sha1
);
2861 static int commit_ref_update(struct ref_lock
*lock
,
2862 const unsigned char *sha1
, const char *logmsg
);
2864 int rename_ref(const char *oldrefname
, const char *newrefname
, const char *logmsg
)
2866 unsigned char sha1
[20], orig_sha1
[20];
2867 int flag
= 0, logmoved
= 0;
2868 struct ref_lock
*lock
;
2869 struct stat loginfo
;
2870 int log
= !lstat(git_path("logs/%s", oldrefname
), &loginfo
);
2871 const char *symref
= NULL
;
2872 struct strbuf err
= STRBUF_INIT
;
2874 if (log
&& S_ISLNK(loginfo
.st_mode
))
2875 return error("reflog for %s is a symlink", oldrefname
);
2877 symref
= resolve_ref_unsafe(oldrefname
, RESOLVE_REF_READING
,
2879 if (flag
& REF_ISSYMREF
)
2880 return error("refname %s is a symbolic ref, renaming it is not supported",
2883 return error("refname %s not found", oldrefname
);
2885 if (!rename_ref_available(oldrefname
, newrefname
))
2888 if (log
&& rename(git_path("logs/%s", oldrefname
), git_path(TMP_RENAMED_LOG
)))
2889 return error("unable to move logfile logs/%s to "TMP_RENAMED_LOG
": %s",
2890 oldrefname
, strerror(errno
));
2892 if (delete_ref(oldrefname
, orig_sha1
, REF_NODEREF
)) {
2893 error("unable to delete old %s", oldrefname
);
2897 if (!read_ref_full(newrefname
, RESOLVE_REF_READING
, sha1
, NULL
) &&
2898 delete_ref(newrefname
, sha1
, REF_NODEREF
)) {
2899 if (errno
==EISDIR
) {
2900 if (remove_empty_directories(git_path("%s", newrefname
))) {
2901 error("Directory not empty: %s", newrefname
);
2905 error("unable to delete existing %s", newrefname
);
2910 if (log
&& rename_tmp_log(newrefname
))
2915 lock
= lock_ref_sha1_basic(newrefname
, NULL
, NULL
, NULL
, 0, NULL
, &err
);
2917 error("unable to rename '%s' to '%s': %s", oldrefname
, newrefname
, err
.buf
);
2918 strbuf_release(&err
);
2921 hashcpy(lock
->old_sha1
, orig_sha1
);
2923 if (write_ref_to_lockfile(lock
, orig_sha1
) ||
2924 commit_ref_update(lock
, orig_sha1
, logmsg
)) {
2925 error("unable to write current sha1 into %s", newrefname
);
2932 lock
= lock_ref_sha1_basic(oldrefname
, NULL
, NULL
, NULL
, 0, NULL
, &err
);
2934 error("unable to lock %s for rollback: %s", oldrefname
, err
.buf
);
2935 strbuf_release(&err
);
2939 flag
= log_all_ref_updates
;
2940 log_all_ref_updates
= 0;
2941 if (write_ref_to_lockfile(lock
, orig_sha1
) ||
2942 commit_ref_update(lock
, orig_sha1
, NULL
))
2943 error("unable to write current sha1 into %s", oldrefname
);
2944 log_all_ref_updates
= flag
;
2947 if (logmoved
&& rename(git_path("logs/%s", newrefname
), git_path("logs/%s", oldrefname
)))
2948 error("unable to restore logfile %s from %s: %s",
2949 oldrefname
, newrefname
, strerror(errno
));
2950 if (!logmoved
&& log
&&
2951 rename(git_path(TMP_RENAMED_LOG
), git_path("logs/%s", oldrefname
)))
2952 error("unable to restore logfile %s from "TMP_RENAMED_LOG
": %s",
2953 oldrefname
, strerror(errno
));
2958 static int close_ref(struct ref_lock
*lock
)
2960 if (close_lock_file(lock
->lk
))
2966 static int commit_ref(struct ref_lock
*lock
)
2968 if (commit_lock_file(lock
->lk
))
2975 * copy the reflog message msg to buf, which has been allocated sufficiently
2976 * large, while cleaning up the whitespaces. Especially, convert LF to space,
2977 * because reflog file is one line per entry.
2979 static int copy_msg(char *buf
, const char *msg
)
2986 while ((c
= *msg
++)) {
2987 if (wasspace
&& isspace(c
))
2989 wasspace
= isspace(c
);
2994 while (buf
< cp
&& isspace(cp
[-1]))
3000 /* This function must set a meaningful errno on failure */
3001 int log_ref_setup(const char *refname
, char *logfile
, int bufsize
)
3003 int logfd
, oflags
= O_APPEND
| O_WRONLY
;
3005 git_snpath(logfile
, bufsize
, "logs/%s", refname
);
3006 if (log_all_ref_updates
&&
3007 (starts_with(refname
, "refs/heads/") ||
3008 starts_with(refname
, "refs/remotes/") ||
3009 starts_with(refname
, "refs/notes/") ||
3010 !strcmp(refname
, "HEAD"))) {
3011 if (safe_create_leading_directories(logfile
) < 0) {
3012 int save_errno
= errno
;
3013 error("unable to create directory for %s", logfile
);
3020 logfd
= open(logfile
, oflags
, 0666);
3022 if (!(oflags
& O_CREAT
) && (errno
== ENOENT
|| errno
== EISDIR
))
3025 if (errno
== EISDIR
) {
3026 if (remove_empty_directories(logfile
)) {
3027 int save_errno
= errno
;
3028 error("There are still logs under '%s'",
3033 logfd
= open(logfile
, oflags
, 0666);
3037 int save_errno
= errno
;
3038 error("Unable to append to %s: %s", logfile
,
3045 adjust_shared_perm(logfile
);
3050 static int log_ref_write_fd(int fd
, const unsigned char *old_sha1
,
3051 const unsigned char *new_sha1
,
3052 const char *committer
, const char *msg
)
3054 int msglen
, written
;
3055 unsigned maxlen
, len
;
3058 msglen
= msg
? strlen(msg
) : 0;
3059 maxlen
= strlen(committer
) + msglen
+ 100;
3060 logrec
= xmalloc(maxlen
);
3061 len
= sprintf(logrec
, "%s %s %s\n",
3062 sha1_to_hex(old_sha1
),
3063 sha1_to_hex(new_sha1
),
3066 len
+= copy_msg(logrec
+ len
- 1, msg
) - 1;
3068 written
= len
<= maxlen
? write_in_full(fd
, logrec
, len
) : -1;
3076 static int log_ref_write(const char *refname
, const unsigned char *old_sha1
,
3077 const unsigned char *new_sha1
, const char *msg
)
3079 int logfd
, result
, oflags
= O_APPEND
| O_WRONLY
;
3080 char log_file
[PATH_MAX
];
3082 if (log_all_ref_updates
< 0)
3083 log_all_ref_updates
= !is_bare_repository();
3085 result
= log_ref_setup(refname
, log_file
, sizeof(log_file
));
3089 logfd
= open(log_file
, oflags
);
3092 result
= log_ref_write_fd(logfd
, old_sha1
, new_sha1
,
3093 git_committer_info(0), msg
);
3095 int save_errno
= errno
;
3097 error("Unable to append to %s", log_file
);
3102 int save_errno
= errno
;
3103 error("Unable to append to %s", log_file
);
3110 int is_branch(const char *refname
)
3112 return !strcmp(refname
, "HEAD") || starts_with(refname
, "refs/heads/");
3116 * Write sha1 into the open lockfile, then close the lockfile. On
3117 * errors, rollback the lockfile and set errno to reflect the problem.
3119 static int write_ref_to_lockfile(struct ref_lock
*lock
,
3120 const unsigned char *sha1
)
3122 static char term
= '\n';
3125 o
= parse_object(sha1
);
3127 error("Trying to write ref %s with nonexistent object %s",
3128 lock
->ref_name
, sha1_to_hex(sha1
));
3133 if (o
->type
!= OBJ_COMMIT
&& is_branch(lock
->ref_name
)) {
3134 error("Trying to write non-commit object %s to branch %s",
3135 sha1_to_hex(sha1
), lock
->ref_name
);
3140 if (write_in_full(lock
->lock_fd
, sha1_to_hex(sha1
), 40) != 40 ||
3141 write_in_full(lock
->lock_fd
, &term
, 1) != 1 ||
3142 close_ref(lock
) < 0) {
3143 int save_errno
= errno
;
3144 error("Couldn't write %s", lock
->lk
->filename
.buf
);
3153 * Commit a change to a loose reference that has already been written
3154 * to the loose reference lockfile. Also update the reflogs if
3155 * necessary, using the specified lockmsg (which can be NULL).
3157 static int commit_ref_update(struct ref_lock
*lock
,
3158 const unsigned char *sha1
, const char *logmsg
)
3160 clear_loose_ref_cache(&ref_cache
);
3161 if (log_ref_write(lock
->ref_name
, lock
->old_sha1
, sha1
, logmsg
) < 0 ||
3162 (strcmp(lock
->ref_name
, lock
->orig_ref_name
) &&
3163 log_ref_write(lock
->orig_ref_name
, lock
->old_sha1
, sha1
, logmsg
) < 0)) {
3167 if (strcmp(lock
->orig_ref_name
, "HEAD") != 0) {
3169 * Special hack: If a branch is updated directly and HEAD
3170 * points to it (may happen on the remote side of a push
3171 * for example) then logically the HEAD reflog should be
3173 * A generic solution implies reverse symref information,
3174 * but finding all symrefs pointing to the given branch
3175 * would be rather costly for this rare event (the direct
3176 * update of a branch) to be worth it. So let's cheat and
3177 * check with HEAD only which should cover 99% of all usage
3178 * scenarios (even 100% of the default ones).
3180 unsigned char head_sha1
[20];
3182 const char *head_ref
;
3183 head_ref
= resolve_ref_unsafe("HEAD", RESOLVE_REF_READING
,
3184 head_sha1
, &head_flag
);
3185 if (head_ref
&& (head_flag
& REF_ISSYMREF
) &&
3186 !strcmp(head_ref
, lock
->ref_name
))
3187 log_ref_write("HEAD", lock
->old_sha1
, sha1
, logmsg
);
3189 if (commit_ref(lock
)) {
3190 error("Couldn't set %s", lock
->ref_name
);
3198 int create_symref(const char *ref_target
, const char *refs_heads_master
,
3201 const char *lockpath
;
3203 int fd
, len
, written
;
3204 char *git_HEAD
= git_pathdup("%s", ref_target
);
3205 unsigned char old_sha1
[20], new_sha1
[20];
3207 if (logmsg
&& read_ref(ref_target
, old_sha1
))
3210 if (safe_create_leading_directories(git_HEAD
) < 0)
3211 return error("unable to create directory for %s", git_HEAD
);
3213 #ifndef NO_SYMLINK_HEAD
3214 if (prefer_symlink_refs
) {
3216 if (!symlink(refs_heads_master
, git_HEAD
))
3218 fprintf(stderr
, "no symlink - falling back to symbolic ref\n");
3222 len
= snprintf(ref
, sizeof(ref
), "ref: %s\n", refs_heads_master
);
3223 if (sizeof(ref
) <= len
) {
3224 error("refname too long: %s", refs_heads_master
);
3225 goto error_free_return
;
3227 lockpath
= mkpath("%s.lock", git_HEAD
);
3228 fd
= open(lockpath
, O_CREAT
| O_EXCL
| O_WRONLY
, 0666);
3230 error("Unable to open %s for writing", lockpath
);
3231 goto error_free_return
;
3233 written
= write_in_full(fd
, ref
, len
);
3234 if (close(fd
) != 0 || written
!= len
) {
3235 error("Unable to write to %s", lockpath
);
3236 goto error_unlink_return
;
3238 if (rename(lockpath
, git_HEAD
) < 0) {
3239 error("Unable to create %s", git_HEAD
);
3240 goto error_unlink_return
;
3242 if (adjust_shared_perm(git_HEAD
)) {
3243 error("Unable to fix permissions on %s", lockpath
);
3244 error_unlink_return
:
3245 unlink_or_warn(lockpath
);
3251 #ifndef NO_SYMLINK_HEAD
3254 if (logmsg
&& !read_ref(refs_heads_master
, new_sha1
))
3255 log_ref_write(ref_target
, old_sha1
, new_sha1
, logmsg
);
3261 struct read_ref_at_cb
{
3262 const char *refname
;
3263 unsigned long at_time
;
3266 unsigned char *sha1
;
3269 unsigned char osha1
[20];
3270 unsigned char nsha1
[20];
3274 unsigned long *cutoff_time
;
3279 static int read_ref_at_ent(unsigned char *osha1
, unsigned char *nsha1
,
3280 const char *email
, unsigned long timestamp
, int tz
,
3281 const char *message
, void *cb_data
)
3283 struct read_ref_at_cb
*cb
= cb_data
;
3287 cb
->date
= timestamp
;
3289 if (timestamp
<= cb
->at_time
|| cb
->cnt
== 0) {
3291 *cb
->msg
= xstrdup(message
);
3292 if (cb
->cutoff_time
)
3293 *cb
->cutoff_time
= timestamp
;
3295 *cb
->cutoff_tz
= tz
;
3297 *cb
->cutoff_cnt
= cb
->reccnt
- 1;
3299 * we have not yet updated cb->[n|o]sha1 so they still
3300 * hold the values for the previous record.
3302 if (!is_null_sha1(cb
->osha1
)) {
3303 hashcpy(cb
->sha1
, nsha1
);
3304 if (hashcmp(cb
->osha1
, nsha1
))
3305 warning("Log for ref %s has gap after %s.",
3306 cb
->refname
, show_date(cb
->date
, cb
->tz
, DATE_RFC2822
));
3308 else if (cb
->date
== cb
->at_time
)
3309 hashcpy(cb
->sha1
, nsha1
);
3310 else if (hashcmp(nsha1
, cb
->sha1
))
3311 warning("Log for ref %s unexpectedly ended on %s.",
3312 cb
->refname
, show_date(cb
->date
, cb
->tz
,
3314 hashcpy(cb
->osha1
, osha1
);
3315 hashcpy(cb
->nsha1
, nsha1
);
3319 hashcpy(cb
->osha1
, osha1
);
3320 hashcpy(cb
->nsha1
, nsha1
);
3326 static int read_ref_at_ent_oldest(unsigned char *osha1
, unsigned char *nsha1
,
3327 const char *email
, unsigned long timestamp
,
3328 int tz
, const char *message
, void *cb_data
)
3330 struct read_ref_at_cb
*cb
= cb_data
;
3333 *cb
->msg
= xstrdup(message
);
3334 if (cb
->cutoff_time
)
3335 *cb
->cutoff_time
= timestamp
;
3337 *cb
->cutoff_tz
= tz
;
3339 *cb
->cutoff_cnt
= cb
->reccnt
;
3340 hashcpy(cb
->sha1
, osha1
);
3341 if (is_null_sha1(cb
->sha1
))
3342 hashcpy(cb
->sha1
, nsha1
);
3343 /* We just want the first entry */
3347 int read_ref_at(const char *refname
, unsigned int flags
, unsigned long at_time
, int cnt
,
3348 unsigned char *sha1
, char **msg
,
3349 unsigned long *cutoff_time
, int *cutoff_tz
, int *cutoff_cnt
)
3351 struct read_ref_at_cb cb
;
3353 memset(&cb
, 0, sizeof(cb
));
3354 cb
.refname
= refname
;
3355 cb
.at_time
= at_time
;
3358 cb
.cutoff_time
= cutoff_time
;
3359 cb
.cutoff_tz
= cutoff_tz
;
3360 cb
.cutoff_cnt
= cutoff_cnt
;
3363 for_each_reflog_ent_reverse(refname
, read_ref_at_ent
, &cb
);
3366 if (flags
& GET_SHA1_QUIETLY
)
3369 die("Log for %s is empty.", refname
);
3374 for_each_reflog_ent(refname
, read_ref_at_ent_oldest
, &cb
);
3379 int reflog_exists(const char *refname
)
3383 return !lstat(git_path("logs/%s", refname
), &st
) &&
3384 S_ISREG(st
.st_mode
);
3387 int delete_reflog(const char *refname
)
3389 return remove_path(git_path("logs/%s", refname
));
3392 static int show_one_reflog_ent(struct strbuf
*sb
, each_reflog_ent_fn fn
, void *cb_data
)
3394 unsigned char osha1
[20], nsha1
[20];
3395 char *email_end
, *message
;
3396 unsigned long timestamp
;
3399 /* old SP new SP name <email> SP time TAB msg LF */
3400 if (sb
->len
< 83 || sb
->buf
[sb
->len
- 1] != '\n' ||
3401 get_sha1_hex(sb
->buf
, osha1
) || sb
->buf
[40] != ' ' ||
3402 get_sha1_hex(sb
->buf
+ 41, nsha1
) || sb
->buf
[81] != ' ' ||
3403 !(email_end
= strchr(sb
->buf
+ 82, '>')) ||
3404 email_end
[1] != ' ' ||
3405 !(timestamp
= strtoul(email_end
+ 2, &message
, 10)) ||
3406 !message
|| message
[0] != ' ' ||
3407 (message
[1] != '+' && message
[1] != '-') ||
3408 !isdigit(message
[2]) || !isdigit(message
[3]) ||
3409 !isdigit(message
[4]) || !isdigit(message
[5]))
3410 return 0; /* corrupt? */
3411 email_end
[1] = '\0';
3412 tz
= strtol(message
+ 1, NULL
, 10);
3413 if (message
[6] != '\t')
3417 return fn(osha1
, nsha1
, sb
->buf
+ 82, timestamp
, tz
, message
, cb_data
);
3420 static char *find_beginning_of_line(char *bob
, char *scan
)
3422 while (bob
< scan
&& *(--scan
) != '\n')
3423 ; /* keep scanning backwards */
3425 * Return either beginning of the buffer, or LF at the end of
3426 * the previous line.
3431 int for_each_reflog_ent_reverse(const char *refname
, each_reflog_ent_fn fn
, void *cb_data
)
3433 struct strbuf sb
= STRBUF_INIT
;
3436 int ret
= 0, at_tail
= 1;
3438 logfp
= fopen(git_path("logs/%s", refname
), "r");
3442 /* Jump to the end */
3443 if (fseek(logfp
, 0, SEEK_END
) < 0)
3444 return error("cannot seek back reflog for %s: %s",
3445 refname
, strerror(errno
));
3447 while (!ret
&& 0 < pos
) {
3453 /* Fill next block from the end */
3454 cnt
= (sizeof(buf
) < pos
) ? sizeof(buf
) : pos
;
3455 if (fseek(logfp
, pos
- cnt
, SEEK_SET
))
3456 return error("cannot seek back reflog for %s: %s",
3457 refname
, strerror(errno
));
3458 nread
= fread(buf
, cnt
, 1, logfp
);
3460 return error("cannot read %d bytes from reflog for %s: %s",
3461 cnt
, refname
, strerror(errno
));
3464 scanp
= endp
= buf
+ cnt
;
3465 if (at_tail
&& scanp
[-1] == '\n')
3466 /* Looking at the final LF at the end of the file */
3470 while (buf
< scanp
) {
3472 * terminating LF of the previous line, or the beginning
3477 bp
= find_beginning_of_line(buf
, scanp
);
3481 * The newline is the end of the previous line,
3482 * so we know we have complete line starting
3483 * at (bp + 1). Prefix it onto any prior data
3484 * we collected for the line and process it.
3486 strbuf_splice(&sb
, 0, 0, bp
+ 1, endp
- (bp
+ 1));
3489 ret
= show_one_reflog_ent(&sb
, fn
, cb_data
);
3495 * We are at the start of the buffer, and the
3496 * start of the file; there is no previous
3497 * line, and we have everything for this one.
3498 * Process it, and we can end the loop.
3500 strbuf_splice(&sb
, 0, 0, buf
, endp
- buf
);
3501 ret
= show_one_reflog_ent(&sb
, fn
, cb_data
);
3508 * We are at the start of the buffer, and there
3509 * is more file to read backwards. Which means
3510 * we are in the middle of a line. Note that we
3511 * may get here even if *bp was a newline; that
3512 * just means we are at the exact end of the
3513 * previous line, rather than some spot in the
3516 * Save away what we have to be combined with
3517 * the data from the next read.
3519 strbuf_splice(&sb
, 0, 0, buf
, endp
- buf
);
3526 die("BUG: reverse reflog parser had leftover data");
3529 strbuf_release(&sb
);
3533 int for_each_reflog_ent(const char *refname
, each_reflog_ent_fn fn
, void *cb_data
)
3536 struct strbuf sb
= STRBUF_INIT
;
3539 logfp
= fopen(git_path("logs/%s", refname
), "r");
3543 while (!ret
&& !strbuf_getwholeline(&sb
, logfp
, '\n'))
3544 ret
= show_one_reflog_ent(&sb
, fn
, cb_data
);
3546 strbuf_release(&sb
);
3550 * Call fn for each reflog in the namespace indicated by name. name
3551 * must be empty or end with '/'. Name will be used as a scratch
3552 * space, but its contents will be restored before return.
3554 static int do_for_each_reflog(struct strbuf
*name
, each_ref_fn fn
, void *cb_data
)
3556 DIR *d
= opendir(git_path("logs/%s", name
->buf
));
3559 int oldlen
= name
->len
;
3562 return name
->len
? errno
: 0;
3564 while ((de
= readdir(d
)) != NULL
) {
3567 if (de
->d_name
[0] == '.')
3569 if (ends_with(de
->d_name
, ".lock"))
3571 strbuf_addstr(name
, de
->d_name
);
3572 if (stat(git_path("logs/%s", name
->buf
), &st
) < 0) {
3573 ; /* silently ignore */
3575 if (S_ISDIR(st
.st_mode
)) {
3576 strbuf_addch(name
, '/');
3577 retval
= do_for_each_reflog(name
, fn
, cb_data
);
3579 unsigned char sha1
[20];
3580 if (read_ref_full(name
->buf
, 0, sha1
, NULL
))
3581 retval
= error("bad ref for %s", name
->buf
);
3583 retval
= fn(name
->buf
, sha1
, 0, cb_data
);
3588 strbuf_setlen(name
, oldlen
);
3594 int for_each_reflog(each_ref_fn fn
, void *cb_data
)
3598 strbuf_init(&name
, PATH_MAX
);
3599 retval
= do_for_each_reflog(&name
, fn
, cb_data
);
3600 strbuf_release(&name
);
3605 * Information needed for a single ref update. Set new_sha1 to the new
3606 * value or to null_sha1 to delete the ref. To check the old value
3607 * while the ref is locked, set (flags & REF_HAVE_OLD) and set
3608 * old_sha1 to the old value, or to null_sha1 to ensure the ref does
3609 * not exist before update.
3613 * If (flags & REF_HAVE_NEW), set the reference to this value:
3615 unsigned char new_sha1
[20];
3617 * If (flags & REF_HAVE_OLD), check that the reference
3618 * previously had this value:
3620 unsigned char old_sha1
[20];
3622 * One or more of REF_HAVE_NEW, REF_HAVE_OLD, REF_NODEREF,
3623 * REF_DELETING, and REF_ISPRUNING:
3626 struct ref_lock
*lock
;
3629 const char refname
[FLEX_ARRAY
];
3633 * Transaction states.
3634 * OPEN: The transaction is in a valid state and can accept new updates.
3635 * An OPEN transaction can be committed.
3636 * CLOSED: A closed transaction is no longer active and no other operations
3637 * than free can be used on it in this state.
3638 * A transaction can either become closed by successfully committing
3639 * an active transaction or if there is a failure while building
3640 * the transaction thus rendering it failed/inactive.
3642 enum ref_transaction_state
{
3643 REF_TRANSACTION_OPEN
= 0,
3644 REF_TRANSACTION_CLOSED
= 1
3648 * Data structure for holding a reference transaction, which can
3649 * consist of checks and updates to multiple references, carried out
3650 * as atomically as possible. This structure is opaque to callers.
3652 struct ref_transaction
{
3653 struct ref_update
**updates
;
3656 enum ref_transaction_state state
;
3659 struct ref_transaction
*ref_transaction_begin(struct strbuf
*err
)
3663 return xcalloc(1, sizeof(struct ref_transaction
));
3666 void ref_transaction_free(struct ref_transaction
*transaction
)
3673 for (i
= 0; i
< transaction
->nr
; i
++) {
3674 free(transaction
->updates
[i
]->msg
);
3675 free(transaction
->updates
[i
]);
3677 free(transaction
->updates
);
3681 static struct ref_update
*add_update(struct ref_transaction
*transaction
,
3682 const char *refname
)
3684 size_t len
= strlen(refname
);
3685 struct ref_update
*update
= xcalloc(1, sizeof(*update
) + len
+ 1);
3687 strcpy((char *)update
->refname
, refname
);
3688 ALLOC_GROW(transaction
->updates
, transaction
->nr
+ 1, transaction
->alloc
);
3689 transaction
->updates
[transaction
->nr
++] = update
;
3693 int ref_transaction_update(struct ref_transaction
*transaction
,
3694 const char *refname
,
3695 const unsigned char *new_sha1
,
3696 const unsigned char *old_sha1
,
3697 unsigned int flags
, const char *msg
,
3700 struct ref_update
*update
;
3704 if (transaction
->state
!= REF_TRANSACTION_OPEN
)
3705 die("BUG: update called for transaction that is not open");
3707 if (new_sha1
&& !is_null_sha1(new_sha1
) &&
3708 check_refname_format(refname
, REFNAME_ALLOW_ONELEVEL
)) {
3709 strbuf_addf(err
, "refusing to update ref with bad name %s",
3714 update
= add_update(transaction
, refname
);
3716 hashcpy(update
->new_sha1
, new_sha1
);
3717 flags
|= REF_HAVE_NEW
;
3720 hashcpy(update
->old_sha1
, old_sha1
);
3721 flags
|= REF_HAVE_OLD
;
3723 update
->flags
= flags
;
3725 update
->msg
= xstrdup(msg
);
3729 int ref_transaction_create(struct ref_transaction
*transaction
,
3730 const char *refname
,
3731 const unsigned char *new_sha1
,
3732 unsigned int flags
, const char *msg
,
3735 if (!new_sha1
|| is_null_sha1(new_sha1
))
3736 die("BUG: create called without valid new_sha1");
3737 return ref_transaction_update(transaction
, refname
, new_sha1
,
3738 null_sha1
, flags
, msg
, err
);
3741 int ref_transaction_delete(struct ref_transaction
*transaction
,
3742 const char *refname
,
3743 const unsigned char *old_sha1
,
3744 unsigned int flags
, const char *msg
,
3747 if (old_sha1
&& is_null_sha1(old_sha1
))
3748 die("BUG: delete called with old_sha1 set to zeros");
3749 return ref_transaction_update(transaction
, refname
,
3750 null_sha1
, old_sha1
,
3754 int ref_transaction_verify(struct ref_transaction
*transaction
,
3755 const char *refname
,
3756 const unsigned char *old_sha1
,
3761 die("BUG: verify called with old_sha1 set to NULL");
3762 return ref_transaction_update(transaction
, refname
,
3767 int update_ref(const char *msg
, const char *refname
,
3768 const unsigned char *new_sha1
, const unsigned char *old_sha1
,
3769 unsigned int flags
, enum action_on_err onerr
)
3771 struct ref_transaction
*t
;
3772 struct strbuf err
= STRBUF_INIT
;
3774 t
= ref_transaction_begin(&err
);
3776 ref_transaction_update(t
, refname
, new_sha1
, old_sha1
,
3777 flags
, msg
, &err
) ||
3778 ref_transaction_commit(t
, &err
)) {
3779 const char *str
= "update_ref failed for ref '%s': %s";
3781 ref_transaction_free(t
);
3783 case UPDATE_REFS_MSG_ON_ERR
:
3784 error(str
, refname
, err
.buf
);
3786 case UPDATE_REFS_DIE_ON_ERR
:
3787 die(str
, refname
, err
.buf
);
3789 case UPDATE_REFS_QUIET_ON_ERR
:
3792 strbuf_release(&err
);
3795 strbuf_release(&err
);
3796 ref_transaction_free(t
);
3800 static int ref_update_reject_duplicates(struct string_list
*refnames
,
3803 int i
, n
= refnames
->nr
;
3807 for (i
= 1; i
< n
; i
++)
3808 if (!strcmp(refnames
->items
[i
- 1].string
, refnames
->items
[i
].string
)) {
3810 "Multiple updates for ref '%s' not allowed.",
3811 refnames
->items
[i
].string
);
3817 int ref_transaction_commit(struct ref_transaction
*transaction
,
3821 int n
= transaction
->nr
;
3822 struct ref_update
**updates
= transaction
->updates
;
3823 struct string_list refs_to_delete
= STRING_LIST_INIT_NODUP
;
3824 struct string_list_item
*ref_to_delete
;
3825 struct string_list affected_refnames
= STRING_LIST_INIT_NODUP
;
3829 if (transaction
->state
!= REF_TRANSACTION_OPEN
)
3830 die("BUG: commit called for transaction that is not open");
3833 transaction
->state
= REF_TRANSACTION_CLOSED
;
3837 /* Fail if a refname appears more than once in the transaction: */
3838 for (i
= 0; i
< n
; i
++)
3839 string_list_append(&affected_refnames
, updates
[i
]->refname
);
3840 string_list_sort(&affected_refnames
);
3841 if (ref_update_reject_duplicates(&affected_refnames
, err
)) {
3842 ret
= TRANSACTION_GENERIC_ERROR
;
3847 * Acquire all locks, verify old values if provided, check
3848 * that new values are valid, and write new values to the
3849 * lockfiles, ready to be activated. Only keep one lockfile
3850 * open at a time to avoid running out of file descriptors.
3852 for (i
= 0; i
< n
; i
++) {
3853 struct ref_update
*update
= updates
[i
];
3855 if ((update
->flags
& REF_HAVE_NEW
) &&
3856 is_null_sha1(update
->new_sha1
))
3857 update
->flags
|= REF_DELETING
;
3858 update
->lock
= lock_ref_sha1_basic(
3860 ((update
->flags
& REF_HAVE_OLD
) ?
3861 update
->old_sha1
: NULL
),
3862 &affected_refnames
, NULL
,
3866 if (!update
->lock
) {
3869 ret
= (errno
== ENOTDIR
)
3870 ? TRANSACTION_NAME_CONFLICT
3871 : TRANSACTION_GENERIC_ERROR
;
3872 reason
= strbuf_detach(err
, NULL
);
3873 strbuf_addf(err
, "Cannot lock ref '%s': %s",
3874 update
->refname
, reason
);
3878 if ((update
->flags
& REF_HAVE_NEW
) &&
3879 !(update
->flags
& REF_DELETING
)) {
3880 int overwriting_symref
= ((update
->type
& REF_ISSYMREF
) &&
3881 (update
->flags
& REF_NODEREF
));
3883 if (!overwriting_symref
&&
3884 !hashcmp(update
->lock
->old_sha1
, update
->new_sha1
)) {
3886 * The reference already has the desired
3887 * value, so we don't need to write it.
3889 } else if (write_ref_to_lockfile(update
->lock
,
3890 update
->new_sha1
)) {
3892 * The lock was freed upon failure of
3893 * write_ref_to_lockfile():
3895 update
->lock
= NULL
;
3896 strbuf_addf(err
, "Cannot update the ref '%s'.",
3898 ret
= TRANSACTION_GENERIC_ERROR
;
3901 update
->flags
|= REF_NEEDS_COMMIT
;
3904 if (!(update
->flags
& REF_NEEDS_COMMIT
)) {
3906 * We didn't have to write anything to the lockfile.
3907 * Close it to free up the file descriptor:
3909 if (close_ref(update
->lock
)) {
3910 strbuf_addf(err
, "Couldn't close %s.lock",
3917 /* Perform updates first so live commits remain referenced */
3918 for (i
= 0; i
< n
; i
++) {
3919 struct ref_update
*update
= updates
[i
];
3921 if (update
->flags
& REF_NEEDS_COMMIT
) {
3922 if (commit_ref_update(update
->lock
,
3923 update
->new_sha1
, update
->msg
)) {
3924 /* freed by commit_ref_update(): */
3925 update
->lock
= NULL
;
3926 strbuf_addf(err
, "Cannot update the ref '%s'.",
3928 ret
= TRANSACTION_GENERIC_ERROR
;
3931 /* freed by commit_ref_update(): */
3932 update
->lock
= NULL
;
3937 /* Perform deletes now that updates are safely completed */
3938 for (i
= 0; i
< n
; i
++) {
3939 struct ref_update
*update
= updates
[i
];
3941 if (update
->flags
& REF_DELETING
) {
3942 if (delete_ref_loose(update
->lock
, update
->type
, err
)) {
3943 ret
= TRANSACTION_GENERIC_ERROR
;
3947 if (!(update
->flags
& REF_ISPRUNING
))
3948 string_list_append(&refs_to_delete
,
3949 update
->lock
->ref_name
);
3953 if (repack_without_refs(&refs_to_delete
, err
)) {
3954 ret
= TRANSACTION_GENERIC_ERROR
;
3957 for_each_string_list_item(ref_to_delete
, &refs_to_delete
)
3958 unlink_or_warn(git_path("logs/%s", ref_to_delete
->string
));
3959 clear_loose_ref_cache(&ref_cache
);
3962 transaction
->state
= REF_TRANSACTION_CLOSED
;
3964 for (i
= 0; i
< n
; i
++)
3965 if (updates
[i
]->lock
)
3966 unlock_ref(updates
[i
]->lock
);
3967 string_list_clear(&refs_to_delete
, 0);
3968 string_list_clear(&affected_refnames
, 0);
3972 char *shorten_unambiguous_ref(const char *refname
, int strict
)
3975 static char **scanf_fmts
;
3976 static int nr_rules
;
3981 * Pre-generate scanf formats from ref_rev_parse_rules[].
3982 * Generate a format suitable for scanf from a
3983 * ref_rev_parse_rules rule by interpolating "%s" at the
3984 * location of the "%.*s".
3986 size_t total_len
= 0;
3989 /* the rule list is NULL terminated, count them first */
3990 for (nr_rules
= 0; ref_rev_parse_rules
[nr_rules
]; nr_rules
++)
3991 /* -2 for strlen("%.*s") - strlen("%s"); +1 for NUL */
3992 total_len
+= strlen(ref_rev_parse_rules
[nr_rules
]) - 2 + 1;
3994 scanf_fmts
= xmalloc(nr_rules
* sizeof(char *) + total_len
);
3997 for (i
= 0; i
< nr_rules
; i
++) {
3998 assert(offset
< total_len
);
3999 scanf_fmts
[i
] = (char *)&scanf_fmts
[nr_rules
] + offset
;
4000 offset
+= snprintf(scanf_fmts
[i
], total_len
- offset
,
4001 ref_rev_parse_rules
[i
], 2, "%s") + 1;
4005 /* bail out if there are no rules */
4007 return xstrdup(refname
);
4009 /* buffer for scanf result, at most refname must fit */
4010 short_name
= xstrdup(refname
);
4012 /* skip first rule, it will always match */
4013 for (i
= nr_rules
- 1; i
> 0 ; --i
) {
4015 int rules_to_fail
= i
;
4018 if (1 != sscanf(refname
, scanf_fmts
[i
], short_name
))
4021 short_name_len
= strlen(short_name
);
4024 * in strict mode, all (except the matched one) rules
4025 * must fail to resolve to a valid non-ambiguous ref
4028 rules_to_fail
= nr_rules
;
4031 * check if the short name resolves to a valid ref,
4032 * but use only rules prior to the matched one
4034 for (j
= 0; j
< rules_to_fail
; j
++) {
4035 const char *rule
= ref_rev_parse_rules
[j
];
4036 char refname
[PATH_MAX
];
4038 /* skip matched rule */
4043 * the short name is ambiguous, if it resolves
4044 * (with this previous rule) to a valid ref
4045 * read_ref() returns 0 on success
4047 mksnpath(refname
, sizeof(refname
),
4048 rule
, short_name_len
, short_name
);
4049 if (ref_exists(refname
))
4054 * short name is non-ambiguous if all previous rules
4055 * haven't resolved to a valid ref
4057 if (j
== rules_to_fail
)
4062 return xstrdup(refname
);
4065 static struct string_list
*hide_refs
;
4067 int parse_hide_refs_config(const char *var
, const char *value
, const char *section
)
4069 if (!strcmp("transfer.hiderefs", var
) ||
4070 /* NEEDSWORK: use parse_config_key() once both are merged */
4071 (starts_with(var
, section
) && var
[strlen(section
)] == '.' &&
4072 !strcmp(var
+ strlen(section
), ".hiderefs"))) {
4077 return config_error_nonbool(var
);
4078 ref
= xstrdup(value
);
4080 while (len
&& ref
[len
- 1] == '/')
4083 hide_refs
= xcalloc(1, sizeof(*hide_refs
));
4084 hide_refs
->strdup_strings
= 1;
4086 string_list_append(hide_refs
, ref
);
4091 int ref_is_hidden(const char *refname
)
4093 struct string_list_item
*item
;
4097 for_each_string_list_item(item
, hide_refs
) {
4099 if (!starts_with(refname
, item
->string
))
4101 len
= strlen(item
->string
);
4102 if (!refname
[len
] || refname
[len
] == '/')
4108 struct expire_reflog_cb
{
4110 reflog_expiry_should_prune_fn
*should_prune_fn
;
4113 unsigned char last_kept_sha1
[20];
4116 static int expire_reflog_ent(unsigned char *osha1
, unsigned char *nsha1
,
4117 const char *email
, unsigned long timestamp
, int tz
,
4118 const char *message
, void *cb_data
)
4120 struct expire_reflog_cb
*cb
= cb_data
;
4121 struct expire_reflog_policy_cb
*policy_cb
= cb
->policy_cb
;
4123 if (cb
->flags
& EXPIRE_REFLOGS_REWRITE
)
4124 osha1
= cb
->last_kept_sha1
;
4126 if ((*cb
->should_prune_fn
)(osha1
, nsha1
, email
, timestamp
, tz
,
4127 message
, policy_cb
)) {
4129 printf("would prune %s", message
);
4130 else if (cb
->flags
& EXPIRE_REFLOGS_VERBOSE
)
4131 printf("prune %s", message
);
4134 fprintf(cb
->newlog
, "%s %s %s %lu %+05d\t%s",
4135 sha1_to_hex(osha1
), sha1_to_hex(nsha1
),
4136 email
, timestamp
, tz
, message
);
4137 hashcpy(cb
->last_kept_sha1
, nsha1
);
4139 if (cb
->flags
& EXPIRE_REFLOGS_VERBOSE
)
4140 printf("keep %s", message
);
4145 int reflog_expire(const char *refname
, const unsigned char *sha1
,
4147 reflog_expiry_prepare_fn prepare_fn
,
4148 reflog_expiry_should_prune_fn should_prune_fn
,
4149 reflog_expiry_cleanup_fn cleanup_fn
,
4150 void *policy_cb_data
)
4152 static struct lock_file reflog_lock
;
4153 struct expire_reflog_cb cb
;
4154 struct ref_lock
*lock
;
4158 struct strbuf err
= STRBUF_INIT
;
4160 memset(&cb
, 0, sizeof(cb
));
4162 cb
.policy_cb
= policy_cb_data
;
4163 cb
.should_prune_fn
= should_prune_fn
;
4166 * The reflog file is locked by holding the lock on the
4167 * reference itself, plus we might need to update the
4168 * reference if --updateref was specified:
4170 lock
= lock_ref_sha1_basic(refname
, sha1
, NULL
, NULL
, 0, &type
, &err
);
4172 error("cannot lock ref '%s': %s", refname
, err
.buf
);
4173 strbuf_release(&err
);
4176 if (!reflog_exists(refname
)) {
4181 log_file
= git_pathdup("logs/%s", refname
);
4182 if (!(flags
& EXPIRE_REFLOGS_DRY_RUN
)) {
4184 * Even though holding $GIT_DIR/logs/$reflog.lock has
4185 * no locking implications, we use the lock_file
4186 * machinery here anyway because it does a lot of the
4187 * work we need, including cleaning up if the program
4188 * exits unexpectedly.
4190 if (hold_lock_file_for_update(&reflog_lock
, log_file
, 0) < 0) {
4191 struct strbuf err
= STRBUF_INIT
;
4192 unable_to_lock_message(log_file
, errno
, &err
);
4193 error("%s", err
.buf
);
4194 strbuf_release(&err
);
4197 cb
.newlog
= fdopen_lock_file(&reflog_lock
, "w");
4199 error("cannot fdopen %s (%s)",
4200 reflog_lock
.filename
.buf
, strerror(errno
));
4205 (*prepare_fn
)(refname
, sha1
, cb
.policy_cb
);
4206 for_each_reflog_ent(refname
, expire_reflog_ent
, &cb
);
4207 (*cleanup_fn
)(cb
.policy_cb
);
4209 if (!(flags
& EXPIRE_REFLOGS_DRY_RUN
)) {
4211 * It doesn't make sense to adjust a reference pointed
4212 * to by a symbolic ref based on expiring entries in
4213 * the symbolic reference's reflog. Nor can we update
4214 * a reference if there are no remaining reflog
4217 int update
= (flags
& EXPIRE_REFLOGS_UPDATE_REF
) &&
4218 !(type
& REF_ISSYMREF
) &&
4219 !is_null_sha1(cb
.last_kept_sha1
);
4221 if (close_lock_file(&reflog_lock
)) {
4222 status
|= error("couldn't write %s: %s", log_file
,
4224 } else if (update
&&
4225 (write_in_full(lock
->lock_fd
,
4226 sha1_to_hex(cb
.last_kept_sha1
), 40) != 40 ||
4227 write_str_in_full(lock
->lock_fd
, "\n") != 1 ||
4228 close_ref(lock
) < 0)) {
4229 status
|= error("couldn't write %s",
4230 lock
->lk
->filename
.buf
);
4231 rollback_lock_file(&reflog_lock
);
4232 } else if (commit_lock_file(&reflog_lock
)) {
4233 status
|= error("unable to commit reflog '%s' (%s)",
4234 log_file
, strerror(errno
));
4235 } else if (update
&& commit_ref(lock
)) {
4236 status
|= error("couldn't set %s", lock
->ref_name
);
4244 rollback_lock_file(&reflog_lock
);