report_refname_conflict(): inline function
[git/mingw/j6t.git] / refs.c
blob74225943b621b541d58aae0c59c73429656690b7
1 #include "cache.h"
2 #include "lockfile.h"
3 #include "refs.h"
4 #include "object.h"
5 #include "tag.h"
6 #include "dir.h"
7 #include "string-list.h"
9 struct ref_lock {
10 char *ref_name;
11 char *orig_ref_name;
12 struct lock_file *lk;
13 unsigned char old_sha1[20];
14 int lock_fd;
18 * How to handle various characters in refnames:
19 * 0: An acceptable character for refs
20 * 1: End-of-component
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
44 * pruned.
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
56 * checked.
58 #define REF_HAVE_OLD 0x10
61 * Try to read one refname component from the front of refname.
62 * Return the length of the component found, or -1 if the component is
63 * not legal. It is legal if it is something reasonable to have under
64 * ".git/refs/"; We do not like it if:
66 * - any path component of it begins with ".", or
67 * - it has double dots "..", or
68 * - it has ASCII control character, "~", "^", ":" or SP, anywhere, or
69 * - it ends with a "/".
70 * - it ends with ".lock"
71 * - it contains a "\" (backslash)
73 static int check_refname_component(const char *refname, int flags)
75 const char *cp;
76 char last = '\0';
78 for (cp = refname; ; cp++) {
79 int ch = *cp & 255;
80 unsigned char disp = refname_disposition[ch];
81 switch (disp) {
82 case 1:
83 goto out;
84 case 2:
85 if (last == '.')
86 return -1; /* Refname contains "..". */
87 break;
88 case 3:
89 if (last == '@')
90 return -1; /* Refname contains "@{". */
91 break;
92 case 4:
93 return -1;
95 last = ch;
97 out:
98 if (cp == refname)
99 return 0; /* Component has zero length. */
100 if (refname[0] == '.')
101 return -1; /* Component starts with '.'. */
102 if (cp - refname >= LOCK_SUFFIX_LEN &&
103 !memcmp(cp - LOCK_SUFFIX_LEN, LOCK_SUFFIX, LOCK_SUFFIX_LEN))
104 return -1; /* Refname ends with ".lock". */
105 return cp - refname;
108 int check_refname_format(const char *refname, int flags)
110 int component_len, component_count = 0;
112 if (!strcmp(refname, "@"))
113 /* Refname is a single character '@'. */
114 return -1;
116 while (1) {
117 /* We are at the start of a path component. */
118 component_len = check_refname_component(refname, flags);
119 if (component_len <= 0) {
120 if ((flags & REFNAME_REFSPEC_PATTERN) &&
121 refname[0] == '*' &&
122 (refname[1] == '\0' || refname[1] == '/')) {
123 /* Accept one wildcard as a full refname component. */
124 flags &= ~REFNAME_REFSPEC_PATTERN;
125 component_len = 1;
126 } else {
127 return -1;
130 component_count++;
131 if (refname[component_len] == '\0')
132 break;
133 /* Skip to next component. */
134 refname += component_len + 1;
137 if (refname[component_len - 1] == '.')
138 return -1; /* Refname ends with '.'. */
139 if (!(flags & REFNAME_ALLOW_ONELEVEL) && component_count < 2)
140 return -1; /* Refname has only one component. */
141 return 0;
144 struct ref_entry;
147 * Information used (along with the information in ref_entry) to
148 * describe a single cached reference. This data structure only
149 * occurs embedded in a union in struct ref_entry, and only when
150 * (ref_entry->flag & REF_DIR) is zero.
152 struct ref_value {
154 * The name of the object to which this reference resolves
155 * (which may be a tag object). If REF_ISBROKEN, this is
156 * null. If REF_ISSYMREF, then this is the name of the object
157 * referred to by the last reference in the symlink chain.
159 unsigned char sha1[20];
162 * If REF_KNOWS_PEELED, then this field holds the peeled value
163 * of this reference, or null if the reference is known not to
164 * be peelable. See the documentation for peel_ref() for an
165 * exact definition of "peelable".
167 unsigned char peeled[20];
170 struct ref_cache;
173 * Information used (along with the information in ref_entry) to
174 * describe a level in the hierarchy of references. This data
175 * structure only occurs embedded in a union in struct ref_entry, and
176 * only when (ref_entry.flag & REF_DIR) is set. In that case,
177 * (ref_entry.flag & REF_INCOMPLETE) determines whether the references
178 * in the directory have already been read:
180 * (ref_entry.flag & REF_INCOMPLETE) unset -- a directory of loose
181 * or packed references, already read.
183 * (ref_entry.flag & REF_INCOMPLETE) set -- a directory of loose
184 * references that hasn't been read yet (nor has any of its
185 * subdirectories).
187 * Entries within a directory are stored within a growable array of
188 * pointers to ref_entries (entries, nr, alloc). Entries 0 <= i <
189 * sorted are sorted by their component name in strcmp() order and the
190 * remaining entries are unsorted.
192 * Loose references are read lazily, one directory at a time. When a
193 * directory of loose references is read, then all of the references
194 * in that directory are stored, and REF_INCOMPLETE stubs are created
195 * for any subdirectories, but the subdirectories themselves are not
196 * read. The reading is triggered by get_ref_dir().
198 struct ref_dir {
199 int nr, alloc;
202 * Entries with index 0 <= i < sorted are sorted by name. New
203 * entries are appended to the list unsorted, and are sorted
204 * only when required; thus we avoid the need to sort the list
205 * after the addition of every reference.
207 int sorted;
209 /* A pointer to the ref_cache that contains this ref_dir. */
210 struct ref_cache *ref_cache;
212 struct ref_entry **entries;
216 * Bit values for ref_entry::flag. REF_ISSYMREF=0x01,
217 * REF_ISPACKED=0x02, REF_ISBROKEN=0x04 and REF_BAD_NAME=0x08 are
218 * public values; see refs.h.
222 * The field ref_entry->u.value.peeled of this value entry contains
223 * the correct peeled value for the reference, which might be
224 * null_sha1 if the reference is not a tag or if it is broken.
226 #define REF_KNOWS_PEELED 0x10
228 /* ref_entry represents a directory of references */
229 #define REF_DIR 0x20
232 * Entry has not yet been read from disk (used only for REF_DIR
233 * entries representing loose references)
235 #define REF_INCOMPLETE 0x40
238 * A ref_entry represents either a reference or a "subdirectory" of
239 * references.
241 * Each directory in the reference namespace is represented by a
242 * ref_entry with (flags & REF_DIR) set and containing a subdir member
243 * that holds the entries in that directory that have been read so
244 * far. If (flags & REF_INCOMPLETE) is set, then the directory and
245 * its subdirectories haven't been read yet. REF_INCOMPLETE is only
246 * used for loose reference directories.
248 * References are represented by a ref_entry with (flags & REF_DIR)
249 * unset and a value member that describes the reference's value. The
250 * flag member is at the ref_entry level, but it is also needed to
251 * interpret the contents of the value field (in other words, a
252 * ref_value object is not very much use without the enclosing
253 * ref_entry).
255 * Reference names cannot end with slash and directories' names are
256 * always stored with a trailing slash (except for the top-level
257 * directory, which is always denoted by ""). This has two nice
258 * consequences: (1) when the entries in each subdir are sorted
259 * lexicographically by name (as they usually are), the references in
260 * a whole tree can be generated in lexicographic order by traversing
261 * the tree in left-to-right, depth-first order; (2) the names of
262 * references and subdirectories cannot conflict, and therefore the
263 * presence of an empty subdirectory does not block the creation of a
264 * similarly-named reference. (The fact that reference names with the
265 * same leading components can conflict *with each other* is a
266 * separate issue that is regulated by is_refname_available().)
268 * Please note that the name field contains the fully-qualified
269 * reference (or subdirectory) name. Space could be saved by only
270 * storing the relative names. But that would require the full names
271 * to be generated on the fly when iterating in do_for_each_ref(), and
272 * would break callback functions, who have always been able to assume
273 * that the name strings that they are passed will not be freed during
274 * the iteration.
276 struct ref_entry {
277 unsigned char flag; /* ISSYMREF? ISPACKED? */
278 union {
279 struct ref_value value; /* if not (flags&REF_DIR) */
280 struct ref_dir subdir; /* if (flags&REF_DIR) */
281 } u;
283 * The full name of the reference (e.g., "refs/heads/master")
284 * or the full name of the directory with a trailing slash
285 * (e.g., "refs/heads/"):
287 char name[FLEX_ARRAY];
290 static void read_loose_refs(const char *dirname, struct ref_dir *dir);
292 static struct ref_dir *get_ref_dir(struct ref_entry *entry)
294 struct ref_dir *dir;
295 assert(entry->flag & REF_DIR);
296 dir = &entry->u.subdir;
297 if (entry->flag & REF_INCOMPLETE) {
298 read_loose_refs(entry->name, dir);
299 entry->flag &= ~REF_INCOMPLETE;
301 return dir;
305 * Check if a refname is safe.
306 * For refs that start with "refs/" we consider it safe as long they do
307 * not try to resolve to outside of refs/.
309 * For all other refs we only consider them safe iff they only contain
310 * upper case characters and '_' (like "HEAD" AND "MERGE_HEAD", and not like
311 * "config").
313 static int refname_is_safe(const char *refname)
315 if (starts_with(refname, "refs/")) {
316 char *buf;
317 int result;
319 buf = xmalloc(strlen(refname) + 1);
321 * Does the refname try to escape refs/?
322 * For example: refs/foo/../bar is safe but refs/foo/../../bar
323 * is not.
325 result = !normalize_path_copy(buf, refname + strlen("refs/"));
326 free(buf);
327 return result;
329 while (*refname) {
330 if (!isupper(*refname) && *refname != '_')
331 return 0;
332 refname++;
334 return 1;
337 static struct ref_entry *create_ref_entry(const char *refname,
338 const unsigned char *sha1, int flag,
339 int check_name)
341 int len;
342 struct ref_entry *ref;
344 if (check_name &&
345 check_refname_format(refname, REFNAME_ALLOW_ONELEVEL))
346 die("Reference has invalid format: '%s'", refname);
347 if (!check_name && !refname_is_safe(refname))
348 die("Reference has invalid name: '%s'", refname);
349 len = strlen(refname) + 1;
350 ref = xmalloc(sizeof(struct ref_entry) + len);
351 hashcpy(ref->u.value.sha1, sha1);
352 hashclr(ref->u.value.peeled);
353 memcpy(ref->name, refname, len);
354 ref->flag = flag;
355 return ref;
358 static void clear_ref_dir(struct ref_dir *dir);
360 static void free_ref_entry(struct ref_entry *entry)
362 if (entry->flag & REF_DIR) {
364 * Do not use get_ref_dir() here, as that might
365 * trigger the reading of loose refs.
367 clear_ref_dir(&entry->u.subdir);
369 free(entry);
373 * Add a ref_entry to the end of dir (unsorted). Entry is always
374 * stored directly in dir; no recursion into subdirectories is
375 * done.
377 static void add_entry_to_dir(struct ref_dir *dir, struct ref_entry *entry)
379 ALLOC_GROW(dir->entries, dir->nr + 1, dir->alloc);
380 dir->entries[dir->nr++] = entry;
381 /* optimize for the case that entries are added in order */
382 if (dir->nr == 1 ||
383 (dir->nr == dir->sorted + 1 &&
384 strcmp(dir->entries[dir->nr - 2]->name,
385 dir->entries[dir->nr - 1]->name) < 0))
386 dir->sorted = dir->nr;
390 * Clear and free all entries in dir, recursively.
392 static void clear_ref_dir(struct ref_dir *dir)
394 int i;
395 for (i = 0; i < dir->nr; i++)
396 free_ref_entry(dir->entries[i]);
397 free(dir->entries);
398 dir->sorted = dir->nr = dir->alloc = 0;
399 dir->entries = NULL;
403 * Create a struct ref_entry object for the specified dirname.
404 * dirname is the name of the directory with a trailing slash (e.g.,
405 * "refs/heads/") or "" for the top-level directory.
407 static struct ref_entry *create_dir_entry(struct ref_cache *ref_cache,
408 const char *dirname, size_t len,
409 int incomplete)
411 struct ref_entry *direntry;
412 direntry = xcalloc(1, sizeof(struct ref_entry) + len + 1);
413 memcpy(direntry->name, dirname, len);
414 direntry->name[len] = '\0';
415 direntry->u.subdir.ref_cache = ref_cache;
416 direntry->flag = REF_DIR | (incomplete ? REF_INCOMPLETE : 0);
417 return direntry;
420 static int ref_entry_cmp(const void *a, const void *b)
422 struct ref_entry *one = *(struct ref_entry **)a;
423 struct ref_entry *two = *(struct ref_entry **)b;
424 return strcmp(one->name, two->name);
427 static void sort_ref_dir(struct ref_dir *dir);
429 struct string_slice {
430 size_t len;
431 const char *str;
434 static int ref_entry_cmp_sslice(const void *key_, const void *ent_)
436 const struct string_slice *key = key_;
437 const struct ref_entry *ent = *(const struct ref_entry * const *)ent_;
438 int cmp = strncmp(key->str, ent->name, key->len);
439 if (cmp)
440 return cmp;
441 return '\0' - (unsigned char)ent->name[key->len];
445 * Return the index of the entry with the given refname from the
446 * ref_dir (non-recursively), sorting dir if necessary. Return -1 if
447 * no such entry is found. dir must already be complete.
449 static int search_ref_dir(struct ref_dir *dir, const char *refname, size_t len)
451 struct ref_entry **r;
452 struct string_slice key;
454 if (refname == NULL || !dir->nr)
455 return -1;
457 sort_ref_dir(dir);
458 key.len = len;
459 key.str = refname;
460 r = bsearch(&key, dir->entries, dir->nr, sizeof(*dir->entries),
461 ref_entry_cmp_sslice);
463 if (r == NULL)
464 return -1;
466 return r - dir->entries;
470 * Search for a directory entry directly within dir (without
471 * recursing). Sort dir if necessary. subdirname must be a directory
472 * name (i.e., end in '/'). If mkdir is set, then create the
473 * directory if it is missing; otherwise, return NULL if the desired
474 * directory cannot be found. dir must already be complete.
476 static struct ref_dir *search_for_subdir(struct ref_dir *dir,
477 const char *subdirname, size_t len,
478 int mkdir)
480 int entry_index = search_ref_dir(dir, subdirname, len);
481 struct ref_entry *entry;
482 if (entry_index == -1) {
483 if (!mkdir)
484 return NULL;
486 * Since dir is complete, the absence of a subdir
487 * means that the subdir really doesn't exist;
488 * therefore, create an empty record for it but mark
489 * the record complete.
491 entry = create_dir_entry(dir->ref_cache, subdirname, len, 0);
492 add_entry_to_dir(dir, entry);
493 } else {
494 entry = dir->entries[entry_index];
496 return get_ref_dir(entry);
500 * If refname is a reference name, find the ref_dir within the dir
501 * tree that should hold refname. If refname is a directory name
502 * (i.e., ends in '/'), then return that ref_dir itself. dir must
503 * represent the top-level directory and must already be complete.
504 * Sort ref_dirs and recurse into subdirectories as necessary. If
505 * mkdir is set, then create any missing directories; otherwise,
506 * return NULL if the desired directory cannot be found.
508 static struct ref_dir *find_containing_dir(struct ref_dir *dir,
509 const char *refname, int mkdir)
511 const char *slash;
512 for (slash = strchr(refname, '/'); slash; slash = strchr(slash + 1, '/')) {
513 size_t dirnamelen = slash - refname + 1;
514 struct ref_dir *subdir;
515 subdir = search_for_subdir(dir, refname, dirnamelen, mkdir);
516 if (!subdir) {
517 dir = NULL;
518 break;
520 dir = subdir;
523 return dir;
527 * Find the value entry with the given name in dir, sorting ref_dirs
528 * and recursing into subdirectories as necessary. If the name is not
529 * found or it corresponds to a directory entry, return NULL.
531 static struct ref_entry *find_ref(struct ref_dir *dir, const char *refname)
533 int entry_index;
534 struct ref_entry *entry;
535 dir = find_containing_dir(dir, refname, 0);
536 if (!dir)
537 return NULL;
538 entry_index = search_ref_dir(dir, refname, strlen(refname));
539 if (entry_index == -1)
540 return NULL;
541 entry = dir->entries[entry_index];
542 return (entry->flag & REF_DIR) ? NULL : entry;
546 * Remove the entry with the given name from dir, recursing into
547 * subdirectories as necessary. If refname is the name of a directory
548 * (i.e., ends with '/'), then remove the directory and its contents.
549 * If the removal was successful, return the number of entries
550 * remaining in the directory entry that contained the deleted entry.
551 * If the name was not found, return -1. Please note that this
552 * function only deletes the entry from the cache; it does not delete
553 * it from the filesystem or ensure that other cache entries (which
554 * might be symbolic references to the removed entry) are updated.
555 * Nor does it remove any containing dir entries that might be made
556 * empty by the removal. dir must represent the top-level directory
557 * and must already be complete.
559 static int remove_entry(struct ref_dir *dir, const char *refname)
561 int refname_len = strlen(refname);
562 int entry_index;
563 struct ref_entry *entry;
564 int is_dir = refname[refname_len - 1] == '/';
565 if (is_dir) {
567 * refname represents a reference directory. Remove
568 * the trailing slash; otherwise we will get the
569 * directory *representing* refname rather than the
570 * one *containing* it.
572 char *dirname = xmemdupz(refname, refname_len - 1);
573 dir = find_containing_dir(dir, dirname, 0);
574 free(dirname);
575 } else {
576 dir = find_containing_dir(dir, refname, 0);
578 if (!dir)
579 return -1;
580 entry_index = search_ref_dir(dir, refname, refname_len);
581 if (entry_index == -1)
582 return -1;
583 entry = dir->entries[entry_index];
585 memmove(&dir->entries[entry_index],
586 &dir->entries[entry_index + 1],
587 (dir->nr - entry_index - 1) * sizeof(*dir->entries)
589 dir->nr--;
590 if (dir->sorted > entry_index)
591 dir->sorted--;
592 free_ref_entry(entry);
593 return dir->nr;
597 * Add a ref_entry to the ref_dir (unsorted), recursing into
598 * subdirectories as necessary. dir must represent the top-level
599 * directory. Return 0 on success.
601 static int add_ref(struct ref_dir *dir, struct ref_entry *ref)
603 dir = find_containing_dir(dir, ref->name, 1);
604 if (!dir)
605 return -1;
606 add_entry_to_dir(dir, ref);
607 return 0;
611 * Emit a warning and return true iff ref1 and ref2 have the same name
612 * and the same sha1. Die if they have the same name but different
613 * sha1s.
615 static int is_dup_ref(const struct ref_entry *ref1, const struct ref_entry *ref2)
617 if (strcmp(ref1->name, ref2->name))
618 return 0;
620 /* Duplicate name; make sure that they don't conflict: */
622 if ((ref1->flag & REF_DIR) || (ref2->flag & REF_DIR))
623 /* This is impossible by construction */
624 die("Reference directory conflict: %s", ref1->name);
626 if (hashcmp(ref1->u.value.sha1, ref2->u.value.sha1))
627 die("Duplicated ref, and SHA1s don't match: %s", ref1->name);
629 warning("Duplicated ref: %s", ref1->name);
630 return 1;
634 * Sort the entries in dir non-recursively (if they are not already
635 * sorted) and remove any duplicate entries.
637 static void sort_ref_dir(struct ref_dir *dir)
639 int i, j;
640 struct ref_entry *last = NULL;
643 * This check also prevents passing a zero-length array to qsort(),
644 * which is a problem on some platforms.
646 if (dir->sorted == dir->nr)
647 return;
649 qsort(dir->entries, dir->nr, sizeof(*dir->entries), ref_entry_cmp);
651 /* Remove any duplicates: */
652 for (i = 0, j = 0; j < dir->nr; j++) {
653 struct ref_entry *entry = dir->entries[j];
654 if (last && is_dup_ref(last, entry))
655 free_ref_entry(entry);
656 else
657 last = dir->entries[i++] = entry;
659 dir->sorted = dir->nr = i;
662 /* Include broken references in a do_for_each_ref*() iteration: */
663 #define DO_FOR_EACH_INCLUDE_BROKEN 0x01
666 * Return true iff the reference described by entry can be resolved to
667 * an object in the database. Emit a warning if the referred-to
668 * object does not exist.
670 static int ref_resolves_to_object(struct ref_entry *entry)
672 if (entry->flag & REF_ISBROKEN)
673 return 0;
674 if (!has_sha1_file(entry->u.value.sha1)) {
675 error("%s does not point to a valid object!", entry->name);
676 return 0;
678 return 1;
682 * current_ref is a performance hack: when iterating over references
683 * using the for_each_ref*() functions, current_ref is set to the
684 * current reference's entry before calling the callback function. If
685 * the callback function calls peel_ref(), then peel_ref() first
686 * checks whether the reference to be peeled is the current reference
687 * (it usually is) and if so, returns that reference's peeled version
688 * if it is available. This avoids a refname lookup in a common case.
690 static struct ref_entry *current_ref;
692 typedef int each_ref_entry_fn(struct ref_entry *entry, void *cb_data);
694 struct ref_entry_cb {
695 const char *base;
696 int trim;
697 int flags;
698 each_ref_fn *fn;
699 void *cb_data;
703 * Handle one reference in a do_for_each_ref*()-style iteration,
704 * calling an each_ref_fn for each entry.
706 static int do_one_ref(struct ref_entry *entry, void *cb_data)
708 struct ref_entry_cb *data = cb_data;
709 struct ref_entry *old_current_ref;
710 int retval;
712 if (!starts_with(entry->name, data->base))
713 return 0;
715 if (!(data->flags & DO_FOR_EACH_INCLUDE_BROKEN) &&
716 !ref_resolves_to_object(entry))
717 return 0;
719 /* Store the old value, in case this is a recursive call: */
720 old_current_ref = current_ref;
721 current_ref = entry;
722 retval = data->fn(entry->name + data->trim, entry->u.value.sha1,
723 entry->flag, data->cb_data);
724 current_ref = old_current_ref;
725 return retval;
729 * Call fn for each reference in dir that has index in the range
730 * offset <= index < dir->nr. Recurse into subdirectories that are in
731 * that index range, sorting them before iterating. This function
732 * does not sort dir itself; it should be sorted beforehand. fn is
733 * called for all references, including broken ones.
735 static int do_for_each_entry_in_dir(struct ref_dir *dir, int offset,
736 each_ref_entry_fn fn, void *cb_data)
738 int i;
739 assert(dir->sorted == dir->nr);
740 for (i = offset; i < dir->nr; i++) {
741 struct ref_entry *entry = dir->entries[i];
742 int retval;
743 if (entry->flag & REF_DIR) {
744 struct ref_dir *subdir = get_ref_dir(entry);
745 sort_ref_dir(subdir);
746 retval = do_for_each_entry_in_dir(subdir, 0, fn, cb_data);
747 } else {
748 retval = fn(entry, cb_data);
750 if (retval)
751 return retval;
753 return 0;
757 * Call fn for each reference in the union of dir1 and dir2, in order
758 * by refname. Recurse into subdirectories. If a value entry appears
759 * in both dir1 and dir2, then only process the version that is in
760 * dir2. The input dirs must already be sorted, but subdirs will be
761 * sorted as needed. fn is called for all references, including
762 * broken ones.
764 static int do_for_each_entry_in_dirs(struct ref_dir *dir1,
765 struct ref_dir *dir2,
766 each_ref_entry_fn fn, void *cb_data)
768 int retval;
769 int i1 = 0, i2 = 0;
771 assert(dir1->sorted == dir1->nr);
772 assert(dir2->sorted == dir2->nr);
773 while (1) {
774 struct ref_entry *e1, *e2;
775 int cmp;
776 if (i1 == dir1->nr) {
777 return do_for_each_entry_in_dir(dir2, i2, fn, cb_data);
779 if (i2 == dir2->nr) {
780 return do_for_each_entry_in_dir(dir1, i1, fn, cb_data);
782 e1 = dir1->entries[i1];
783 e2 = dir2->entries[i2];
784 cmp = strcmp(e1->name, e2->name);
785 if (cmp == 0) {
786 if ((e1->flag & REF_DIR) && (e2->flag & REF_DIR)) {
787 /* Both are directories; descend them in parallel. */
788 struct ref_dir *subdir1 = get_ref_dir(e1);
789 struct ref_dir *subdir2 = get_ref_dir(e2);
790 sort_ref_dir(subdir1);
791 sort_ref_dir(subdir2);
792 retval = do_for_each_entry_in_dirs(
793 subdir1, subdir2, fn, cb_data);
794 i1++;
795 i2++;
796 } else if (!(e1->flag & REF_DIR) && !(e2->flag & REF_DIR)) {
797 /* Both are references; ignore the one from dir1. */
798 retval = fn(e2, cb_data);
799 i1++;
800 i2++;
801 } else {
802 die("conflict between reference and directory: %s",
803 e1->name);
805 } else {
806 struct ref_entry *e;
807 if (cmp < 0) {
808 e = e1;
809 i1++;
810 } else {
811 e = e2;
812 i2++;
814 if (e->flag & REF_DIR) {
815 struct ref_dir *subdir = get_ref_dir(e);
816 sort_ref_dir(subdir);
817 retval = do_for_each_entry_in_dir(
818 subdir, 0, fn, cb_data);
819 } else {
820 retval = fn(e, cb_data);
823 if (retval)
824 return retval;
829 * Load all of the refs from the dir into our in-memory cache. The hard work
830 * of loading loose refs is done by get_ref_dir(), so we just need to recurse
831 * through all of the sub-directories. We do not even need to care about
832 * sorting, as traversal order does not matter to us.
834 static void prime_ref_dir(struct ref_dir *dir)
836 int i;
837 for (i = 0; i < dir->nr; i++) {
838 struct ref_entry *entry = dir->entries[i];
839 if (entry->flag & REF_DIR)
840 prime_ref_dir(get_ref_dir(entry));
844 struct nonmatching_ref_data {
845 const struct string_list *skip;
846 struct ref_entry *found;
849 static int nonmatching_ref_fn(struct ref_entry *entry, void *vdata)
851 struct nonmatching_ref_data *data = vdata;
853 if (data->skip && string_list_has_string(data->skip, entry->name))
854 return 0;
856 data->found = entry;
857 return 1;
861 * Return true iff a reference named refname could be created without
862 * conflicting with the name of an existing reference in dir. If
863 * skip is non-NULL, ignore potential conflicts with refs in skip
864 * (e.g., because they are scheduled for deletion in the same
865 * operation).
867 * Two reference names conflict if one of them exactly matches the
868 * leading components of the other; e.g., "refs/foo/bar" conflicts
869 * with both "refs/foo" and with "refs/foo/bar/baz" but not with
870 * "refs/foo/bar" or "refs/foo/barbados".
872 * skip must be sorted.
874 static int is_refname_available(const char *refname,
875 const struct string_list *skip,
876 struct ref_dir *dir)
878 const char *slash;
879 int pos;
880 struct strbuf dirname = STRBUF_INIT;
883 * For the sake of comments in this function, suppose that
884 * refname is "refs/foo/bar".
887 for (slash = strchr(refname, '/'); slash; slash = strchr(slash + 1, '/')) {
889 * We are still at a leading dir of the refname (e.g.,
890 * "refs/foo"; if there is a reference with that name,
891 * it is a conflict, *unless* it is in skip.
893 pos = search_ref_dir(dir, refname, slash - refname);
894 if (pos >= 0) {
896 * We found a reference whose name is a proper
897 * prefix of refname; e.g., "refs/foo".
899 struct ref_entry *entry = dir->entries[pos];
900 if (skip && string_list_has_string(skip, entry->name)) {
902 * The reference we just found, e.g.,
903 * "refs/foo", is also in skip, so it
904 * is not considered a conflict.
905 * Moreover, the fact that "refs/foo"
906 * exists means that there cannot be
907 * any references anywhere under the
908 * "refs/foo/" namespace (because they
909 * would have conflicted with
910 * "refs/foo"). So we can stop looking
911 * now and return true.
913 return 1;
915 error("'%s' exists; cannot create '%s'", entry->name, refname);
916 return 0;
921 * Otherwise, we can try to continue our search with
922 * the next component. So try to look up the
923 * directory, e.g., "refs/foo/".
925 pos = search_ref_dir(dir, refname, slash + 1 - refname);
926 if (pos < 0) {
928 * There was no directory "refs/foo/", so
929 * there is nothing under this whole prefix,
930 * and we are OK.
932 return 1;
935 dir = get_ref_dir(dir->entries[pos]);
939 * We are at the leaf of our refname (e.g., "refs/foo/bar").
940 * There is no point in searching for a reference with that
941 * name, because a refname isn't considered to conflict with
942 * itself. But we still need to check for references whose
943 * names are in the "refs/foo/bar/" namespace, because they
944 * *do* conflict.
946 strbuf_addstr(&dirname, refname);
947 strbuf_addch(&dirname, '/');
948 pos = search_ref_dir(dir, dirname.buf, dirname.len);
949 strbuf_release(&dirname);
951 if (pos >= 0) {
953 * We found a directory named "$refname/" (e.g.,
954 * "refs/foo/bar/"). It is a problem iff it contains
955 * any ref that is not in "skip".
957 struct nonmatching_ref_data data;
958 struct ref_entry *entry = dir->entries[pos];
960 dir = get_ref_dir(entry);
961 data.skip = skip;
962 sort_ref_dir(dir);
963 if (!do_for_each_entry_in_dir(dir, 0, nonmatching_ref_fn, &data))
964 return 1;
966 error("'%s' exists; cannot create '%s'", data.found->name, refname);
967 return 0;
970 return 1;
973 struct packed_ref_cache {
974 struct ref_entry *root;
977 * Count of references to the data structure in this instance,
978 * including the pointer from ref_cache::packed if any. The
979 * data will not be freed as long as the reference count is
980 * nonzero.
982 unsigned int referrers;
985 * Iff the packed-refs file associated with this instance is
986 * currently locked for writing, this points at the associated
987 * lock (which is owned by somebody else). The referrer count
988 * is also incremented when the file is locked and decremented
989 * when it is unlocked.
991 struct lock_file *lock;
993 /* The metadata from when this packed-refs cache was read */
994 struct stat_validity validity;
998 * Future: need to be in "struct repository"
999 * when doing a full libification.
1001 static struct ref_cache {
1002 struct ref_cache *next;
1003 struct ref_entry *loose;
1004 struct packed_ref_cache *packed;
1006 * The submodule name, or "" for the main repo. We allocate
1007 * length 1 rather than FLEX_ARRAY so that the main ref_cache
1008 * is initialized correctly.
1010 char name[1];
1011 } ref_cache, *submodule_ref_caches;
1013 /* Lock used for the main packed-refs file: */
1014 static struct lock_file packlock;
1017 * Increment the reference count of *packed_refs.
1019 static void acquire_packed_ref_cache(struct packed_ref_cache *packed_refs)
1021 packed_refs->referrers++;
1025 * Decrease the reference count of *packed_refs. If it goes to zero,
1026 * free *packed_refs and return true; otherwise return false.
1028 static int release_packed_ref_cache(struct packed_ref_cache *packed_refs)
1030 if (!--packed_refs->referrers) {
1031 free_ref_entry(packed_refs->root);
1032 stat_validity_clear(&packed_refs->validity);
1033 free(packed_refs);
1034 return 1;
1035 } else {
1036 return 0;
1040 static void clear_packed_ref_cache(struct ref_cache *refs)
1042 if (refs->packed) {
1043 struct packed_ref_cache *packed_refs = refs->packed;
1045 if (packed_refs->lock)
1046 die("internal error: packed-ref cache cleared while locked");
1047 refs->packed = NULL;
1048 release_packed_ref_cache(packed_refs);
1052 static void clear_loose_ref_cache(struct ref_cache *refs)
1054 if (refs->loose) {
1055 free_ref_entry(refs->loose);
1056 refs->loose = NULL;
1060 static struct ref_cache *create_ref_cache(const char *submodule)
1062 int len;
1063 struct ref_cache *refs;
1064 if (!submodule)
1065 submodule = "";
1066 len = strlen(submodule) + 1;
1067 refs = xcalloc(1, sizeof(struct ref_cache) + len);
1068 memcpy(refs->name, submodule, len);
1069 return refs;
1073 * Return a pointer to a ref_cache for the specified submodule. For
1074 * the main repository, use submodule==NULL. The returned structure
1075 * will be allocated and initialized but not necessarily populated; it
1076 * should not be freed.
1078 static struct ref_cache *get_ref_cache(const char *submodule)
1080 struct ref_cache *refs;
1082 if (!submodule || !*submodule)
1083 return &ref_cache;
1085 for (refs = submodule_ref_caches; refs; refs = refs->next)
1086 if (!strcmp(submodule, refs->name))
1087 return refs;
1089 refs = create_ref_cache(submodule);
1090 refs->next = submodule_ref_caches;
1091 submodule_ref_caches = refs;
1092 return refs;
1095 /* The length of a peeled reference line in packed-refs, including EOL: */
1096 #define PEELED_LINE_LENGTH 42
1099 * The packed-refs header line that we write out. Perhaps other
1100 * traits will be added later. The trailing space is required.
1102 static const char PACKED_REFS_HEADER[] =
1103 "# pack-refs with: peeled fully-peeled \n";
1106 * Parse one line from a packed-refs file. Write the SHA1 to sha1.
1107 * Return a pointer to the refname within the line (null-terminated),
1108 * or NULL if there was a problem.
1110 static const char *parse_ref_line(struct strbuf *line, unsigned char *sha1)
1112 const char *ref;
1115 * 42: the answer to everything.
1117 * In this case, it happens to be the answer to
1118 * 40 (length of sha1 hex representation)
1119 * +1 (space in between hex and name)
1120 * +1 (newline at the end of the line)
1122 if (line->len <= 42)
1123 return NULL;
1125 if (get_sha1_hex(line->buf, sha1) < 0)
1126 return NULL;
1127 if (!isspace(line->buf[40]))
1128 return NULL;
1130 ref = line->buf + 41;
1131 if (isspace(*ref))
1132 return NULL;
1134 if (line->buf[line->len - 1] != '\n')
1135 return NULL;
1136 line->buf[--line->len] = 0;
1138 return ref;
1142 * Read f, which is a packed-refs file, into dir.
1144 * A comment line of the form "# pack-refs with: " may contain zero or
1145 * more traits. We interpret the traits as follows:
1147 * No traits:
1149 * Probably no references are peeled. But if the file contains a
1150 * peeled value for a reference, we will use it.
1152 * peeled:
1154 * References under "refs/tags/", if they *can* be peeled, *are*
1155 * peeled in this file. References outside of "refs/tags/" are
1156 * probably not peeled even if they could have been, but if we find
1157 * a peeled value for such a reference we will use it.
1159 * fully-peeled:
1161 * All references in the file that can be peeled are peeled.
1162 * Inversely (and this is more important), any references in the
1163 * file for which no peeled value is recorded is not peelable. This
1164 * trait should typically be written alongside "peeled" for
1165 * compatibility with older clients, but we do not require it
1166 * (i.e., "peeled" is a no-op if "fully-peeled" is set).
1168 static void read_packed_refs(FILE *f, struct ref_dir *dir)
1170 struct ref_entry *last = NULL;
1171 struct strbuf line = STRBUF_INIT;
1172 enum { PEELED_NONE, PEELED_TAGS, PEELED_FULLY } peeled = PEELED_NONE;
1174 while (strbuf_getwholeline(&line, f, '\n') != EOF) {
1175 unsigned char sha1[20];
1176 const char *refname;
1177 const char *traits;
1179 if (skip_prefix(line.buf, "# pack-refs with:", &traits)) {
1180 if (strstr(traits, " fully-peeled "))
1181 peeled = PEELED_FULLY;
1182 else if (strstr(traits, " peeled "))
1183 peeled = PEELED_TAGS;
1184 /* perhaps other traits later as well */
1185 continue;
1188 refname = parse_ref_line(&line, sha1);
1189 if (refname) {
1190 int flag = REF_ISPACKED;
1192 if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {
1193 hashclr(sha1);
1194 flag |= REF_BAD_NAME | REF_ISBROKEN;
1196 last = create_ref_entry(refname, sha1, flag, 0);
1197 if (peeled == PEELED_FULLY ||
1198 (peeled == PEELED_TAGS && starts_with(refname, "refs/tags/")))
1199 last->flag |= REF_KNOWS_PEELED;
1200 add_ref(dir, last);
1201 continue;
1203 if (last &&
1204 line.buf[0] == '^' &&
1205 line.len == PEELED_LINE_LENGTH &&
1206 line.buf[PEELED_LINE_LENGTH - 1] == '\n' &&
1207 !get_sha1_hex(line.buf + 1, sha1)) {
1208 hashcpy(last->u.value.peeled, sha1);
1210 * Regardless of what the file header said,
1211 * we definitely know the value of *this*
1212 * reference:
1214 last->flag |= REF_KNOWS_PEELED;
1218 strbuf_release(&line);
1222 * Get the packed_ref_cache for the specified ref_cache, creating it
1223 * if necessary.
1225 static struct packed_ref_cache *get_packed_ref_cache(struct ref_cache *refs)
1227 const char *packed_refs_file;
1229 if (*refs->name)
1230 packed_refs_file = git_path_submodule(refs->name, "packed-refs");
1231 else
1232 packed_refs_file = git_path("packed-refs");
1234 if (refs->packed &&
1235 !stat_validity_check(&refs->packed->validity, packed_refs_file))
1236 clear_packed_ref_cache(refs);
1238 if (!refs->packed) {
1239 FILE *f;
1241 refs->packed = xcalloc(1, sizeof(*refs->packed));
1242 acquire_packed_ref_cache(refs->packed);
1243 refs->packed->root = create_dir_entry(refs, "", 0, 0);
1244 f = fopen(packed_refs_file, "r");
1245 if (f) {
1246 stat_validity_update(&refs->packed->validity, fileno(f));
1247 read_packed_refs(f, get_ref_dir(refs->packed->root));
1248 fclose(f);
1251 return refs->packed;
1254 static struct ref_dir *get_packed_ref_dir(struct packed_ref_cache *packed_ref_cache)
1256 return get_ref_dir(packed_ref_cache->root);
1259 static struct ref_dir *get_packed_refs(struct ref_cache *refs)
1261 return get_packed_ref_dir(get_packed_ref_cache(refs));
1264 void add_packed_ref(const char *refname, const unsigned char *sha1)
1266 struct packed_ref_cache *packed_ref_cache =
1267 get_packed_ref_cache(&ref_cache);
1269 if (!packed_ref_cache->lock)
1270 die("internal error: packed refs not locked");
1271 add_ref(get_packed_ref_dir(packed_ref_cache),
1272 create_ref_entry(refname, sha1, REF_ISPACKED, 1));
1276 * Read the loose references from the namespace dirname into dir
1277 * (without recursing). dirname must end with '/'. dir must be the
1278 * directory entry corresponding to dirname.
1280 static void read_loose_refs(const char *dirname, struct ref_dir *dir)
1282 struct ref_cache *refs = dir->ref_cache;
1283 DIR *d;
1284 const char *path;
1285 struct dirent *de;
1286 int dirnamelen = strlen(dirname);
1287 struct strbuf refname;
1289 if (*refs->name)
1290 path = git_path_submodule(refs->name, "%s", dirname);
1291 else
1292 path = git_path("%s", dirname);
1294 d = opendir(path);
1295 if (!d)
1296 return;
1298 strbuf_init(&refname, dirnamelen + 257);
1299 strbuf_add(&refname, dirname, dirnamelen);
1301 while ((de = readdir(d)) != NULL) {
1302 unsigned char sha1[20];
1303 struct stat st;
1304 int flag;
1305 const char *refdir;
1307 if (de->d_name[0] == '.')
1308 continue;
1309 if (ends_with(de->d_name, ".lock"))
1310 continue;
1311 strbuf_addstr(&refname, de->d_name);
1312 refdir = *refs->name
1313 ? git_path_submodule(refs->name, "%s", refname.buf)
1314 : git_path("%s", refname.buf);
1315 if (stat(refdir, &st) < 0) {
1316 ; /* silently ignore */
1317 } else if (S_ISDIR(st.st_mode)) {
1318 strbuf_addch(&refname, '/');
1319 add_entry_to_dir(dir,
1320 create_dir_entry(refs, refname.buf,
1321 refname.len, 1));
1322 } else {
1323 if (*refs->name) {
1324 hashclr(sha1);
1325 flag = 0;
1326 if (resolve_gitlink_ref(refs->name, refname.buf, sha1) < 0) {
1327 hashclr(sha1);
1328 flag |= REF_ISBROKEN;
1330 } else if (read_ref_full(refname.buf,
1331 RESOLVE_REF_READING,
1332 sha1, &flag)) {
1333 hashclr(sha1);
1334 flag |= REF_ISBROKEN;
1336 if (check_refname_format(refname.buf,
1337 REFNAME_ALLOW_ONELEVEL)) {
1338 hashclr(sha1);
1339 flag |= REF_BAD_NAME | REF_ISBROKEN;
1341 add_entry_to_dir(dir,
1342 create_ref_entry(refname.buf, sha1, flag, 0));
1344 strbuf_setlen(&refname, dirnamelen);
1346 strbuf_release(&refname);
1347 closedir(d);
1350 static struct ref_dir *get_loose_refs(struct ref_cache *refs)
1352 if (!refs->loose) {
1354 * Mark the top-level directory complete because we
1355 * are about to read the only subdirectory that can
1356 * hold references:
1358 refs->loose = create_dir_entry(refs, "", 0, 0);
1360 * Create an incomplete entry for "refs/":
1362 add_entry_to_dir(get_ref_dir(refs->loose),
1363 create_dir_entry(refs, "refs/", 5, 1));
1365 return get_ref_dir(refs->loose);
1368 /* We allow "recursive" symbolic refs. Only within reason, though */
1369 #define MAXDEPTH 5
1370 #define MAXREFLEN (1024)
1373 * Called by resolve_gitlink_ref_recursive() after it failed to read
1374 * from the loose refs in ref_cache refs. Find <refname> in the
1375 * packed-refs file for the submodule.
1377 static int resolve_gitlink_packed_ref(struct ref_cache *refs,
1378 const char *refname, unsigned char *sha1)
1380 struct ref_entry *ref;
1381 struct ref_dir *dir = get_packed_refs(refs);
1383 ref = find_ref(dir, refname);
1384 if (ref == NULL)
1385 return -1;
1387 hashcpy(sha1, ref->u.value.sha1);
1388 return 0;
1391 static int resolve_gitlink_ref_recursive(struct ref_cache *refs,
1392 const char *refname, unsigned char *sha1,
1393 int recursion)
1395 int fd, len;
1396 char buffer[128], *p;
1397 char *path;
1399 if (recursion > MAXDEPTH || strlen(refname) > MAXREFLEN)
1400 return -1;
1401 path = *refs->name
1402 ? git_path_submodule(refs->name, "%s", refname)
1403 : git_path("%s", refname);
1404 fd = open(path, O_RDONLY);
1405 if (fd < 0)
1406 return resolve_gitlink_packed_ref(refs, refname, sha1);
1408 len = read(fd, buffer, sizeof(buffer)-1);
1409 close(fd);
1410 if (len < 0)
1411 return -1;
1412 while (len && isspace(buffer[len-1]))
1413 len--;
1414 buffer[len] = 0;
1416 /* Was it a detached head or an old-fashioned symlink? */
1417 if (!get_sha1_hex(buffer, sha1))
1418 return 0;
1420 /* Symref? */
1421 if (strncmp(buffer, "ref:", 4))
1422 return -1;
1423 p = buffer + 4;
1424 while (isspace(*p))
1425 p++;
1427 return resolve_gitlink_ref_recursive(refs, p, sha1, recursion+1);
1430 int resolve_gitlink_ref(const char *path, const char *refname, unsigned char *sha1)
1432 int len = strlen(path), retval;
1433 char *submodule;
1434 struct ref_cache *refs;
1436 while (len && path[len-1] == '/')
1437 len--;
1438 if (!len)
1439 return -1;
1440 submodule = xstrndup(path, len);
1441 refs = get_ref_cache(submodule);
1442 free(submodule);
1444 retval = resolve_gitlink_ref_recursive(refs, refname, sha1, 0);
1445 return retval;
1449 * Return the ref_entry for the given refname from the packed
1450 * references. If it does not exist, return NULL.
1452 static struct ref_entry *get_packed_ref(const char *refname)
1454 return find_ref(get_packed_refs(&ref_cache), refname);
1458 * A loose ref file doesn't exist; check for a packed ref. The
1459 * options are forwarded from resolve_safe_unsafe().
1461 static int resolve_missing_loose_ref(const char *refname,
1462 int resolve_flags,
1463 unsigned char *sha1,
1464 int *flags)
1466 struct ref_entry *entry;
1469 * The loose reference file does not exist; check for a packed
1470 * reference.
1472 entry = get_packed_ref(refname);
1473 if (entry) {
1474 hashcpy(sha1, entry->u.value.sha1);
1475 if (flags)
1476 *flags |= REF_ISPACKED;
1477 return 0;
1479 /* The reference is not a packed reference, either. */
1480 if (resolve_flags & RESOLVE_REF_READING) {
1481 errno = ENOENT;
1482 return -1;
1483 } else {
1484 hashclr(sha1);
1485 return 0;
1489 /* This function needs to return a meaningful errno on failure */
1490 const char *resolve_ref_unsafe(const char *refname, int resolve_flags, unsigned char *sha1, int *flags)
1492 int depth = MAXDEPTH;
1493 ssize_t len;
1494 char buffer[256];
1495 static char refname_buffer[256];
1496 int bad_name = 0;
1498 if (flags)
1499 *flags = 0;
1501 if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {
1502 if (flags)
1503 *flags |= REF_BAD_NAME;
1505 if (!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||
1506 !refname_is_safe(refname)) {
1507 errno = EINVAL;
1508 return NULL;
1511 * dwim_ref() uses REF_ISBROKEN to distinguish between
1512 * missing refs and refs that were present but invalid,
1513 * to complain about the latter to stderr.
1515 * We don't know whether the ref exists, so don't set
1516 * REF_ISBROKEN yet.
1518 bad_name = 1;
1520 for (;;) {
1521 char path[PATH_MAX];
1522 struct stat st;
1523 char *buf;
1524 int fd;
1526 if (--depth < 0) {
1527 errno = ELOOP;
1528 return NULL;
1531 git_snpath(path, sizeof(path), "%s", refname);
1534 * We might have to loop back here to avoid a race
1535 * condition: first we lstat() the file, then we try
1536 * to read it as a link or as a file. But if somebody
1537 * changes the type of the file (file <-> directory
1538 * <-> symlink) between the lstat() and reading, then
1539 * we don't want to report that as an error but rather
1540 * try again starting with the lstat().
1542 stat_ref:
1543 if (lstat(path, &st) < 0) {
1544 if (errno != ENOENT)
1545 return NULL;
1546 if (resolve_missing_loose_ref(refname, resolve_flags,
1547 sha1, flags))
1548 return NULL;
1549 if (bad_name) {
1550 hashclr(sha1);
1551 if (flags)
1552 *flags |= REF_ISBROKEN;
1554 return refname;
1557 /* Follow "normalized" - ie "refs/.." symlinks by hand */
1558 if (S_ISLNK(st.st_mode)) {
1559 len = readlink(path, buffer, sizeof(buffer)-1);
1560 if (len < 0) {
1561 if (errno == ENOENT || errno == EINVAL)
1562 /* inconsistent with lstat; retry */
1563 goto stat_ref;
1564 else
1565 return NULL;
1567 buffer[len] = 0;
1568 if (starts_with(buffer, "refs/") &&
1569 !check_refname_format(buffer, 0)) {
1570 strcpy(refname_buffer, buffer);
1571 refname = refname_buffer;
1572 if (flags)
1573 *flags |= REF_ISSYMREF;
1574 if (resolve_flags & RESOLVE_REF_NO_RECURSE) {
1575 hashclr(sha1);
1576 return refname;
1578 continue;
1582 /* Is it a directory? */
1583 if (S_ISDIR(st.st_mode)) {
1584 errno = EISDIR;
1585 return NULL;
1589 * Anything else, just open it and try to use it as
1590 * a ref
1592 fd = open(path, O_RDONLY);
1593 if (fd < 0) {
1594 if (errno == ENOENT)
1595 /* inconsistent with lstat; retry */
1596 goto stat_ref;
1597 else
1598 return NULL;
1600 len = read_in_full(fd, buffer, sizeof(buffer)-1);
1601 if (len < 0) {
1602 int save_errno = errno;
1603 close(fd);
1604 errno = save_errno;
1605 return NULL;
1607 close(fd);
1608 while (len && isspace(buffer[len-1]))
1609 len--;
1610 buffer[len] = '\0';
1613 * Is it a symbolic ref?
1615 if (!starts_with(buffer, "ref:")) {
1617 * Please note that FETCH_HEAD has a second
1618 * line containing other data.
1620 if (get_sha1_hex(buffer, sha1) ||
1621 (buffer[40] != '\0' && !isspace(buffer[40]))) {
1622 if (flags)
1623 *flags |= REF_ISBROKEN;
1624 errno = EINVAL;
1625 return NULL;
1627 if (bad_name) {
1628 hashclr(sha1);
1629 if (flags)
1630 *flags |= REF_ISBROKEN;
1632 return refname;
1634 if (flags)
1635 *flags |= REF_ISSYMREF;
1636 buf = buffer + 4;
1637 while (isspace(*buf))
1638 buf++;
1639 refname = strcpy(refname_buffer, buf);
1640 if (resolve_flags & RESOLVE_REF_NO_RECURSE) {
1641 hashclr(sha1);
1642 return refname;
1644 if (check_refname_format(buf, REFNAME_ALLOW_ONELEVEL)) {
1645 if (flags)
1646 *flags |= REF_ISBROKEN;
1648 if (!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||
1649 !refname_is_safe(buf)) {
1650 errno = EINVAL;
1651 return NULL;
1653 bad_name = 1;
1658 char *resolve_refdup(const char *ref, int resolve_flags, unsigned char *sha1, int *flags)
1660 return xstrdup_or_null(resolve_ref_unsafe(ref, resolve_flags, sha1, flags));
1663 /* The argument to filter_refs */
1664 struct ref_filter {
1665 const char *pattern;
1666 each_ref_fn *fn;
1667 void *cb_data;
1670 int read_ref_full(const char *refname, int resolve_flags, unsigned char *sha1, int *flags)
1672 if (resolve_ref_unsafe(refname, resolve_flags, sha1, flags))
1673 return 0;
1674 return -1;
1677 int read_ref(const char *refname, unsigned char *sha1)
1679 return read_ref_full(refname, RESOLVE_REF_READING, sha1, NULL);
1682 int ref_exists(const char *refname)
1684 unsigned char sha1[20];
1685 return !!resolve_ref_unsafe(refname, RESOLVE_REF_READING, sha1, NULL);
1688 static int filter_refs(const char *refname, const unsigned char *sha1, int flags,
1689 void *data)
1691 struct ref_filter *filter = (struct ref_filter *)data;
1692 if (wildmatch(filter->pattern, refname, 0, NULL))
1693 return 0;
1694 return filter->fn(refname, sha1, flags, filter->cb_data);
1697 enum peel_status {
1698 /* object was peeled successfully: */
1699 PEEL_PEELED = 0,
1702 * object cannot be peeled because the named object (or an
1703 * object referred to by a tag in the peel chain), does not
1704 * exist.
1706 PEEL_INVALID = -1,
1708 /* object cannot be peeled because it is not a tag: */
1709 PEEL_NON_TAG = -2,
1711 /* ref_entry contains no peeled value because it is a symref: */
1712 PEEL_IS_SYMREF = -3,
1715 * ref_entry cannot be peeled because it is broken (i.e., the
1716 * symbolic reference cannot even be resolved to an object
1717 * name):
1719 PEEL_BROKEN = -4
1723 * Peel the named object; i.e., if the object is a tag, resolve the
1724 * tag recursively until a non-tag is found. If successful, store the
1725 * result to sha1 and return PEEL_PEELED. If the object is not a tag
1726 * or is not valid, return PEEL_NON_TAG or PEEL_INVALID, respectively,
1727 * and leave sha1 unchanged.
1729 static enum peel_status peel_object(const unsigned char *name, unsigned char *sha1)
1731 struct object *o = lookup_unknown_object(name);
1733 if (o->type == OBJ_NONE) {
1734 int type = sha1_object_info(name, NULL);
1735 if (type < 0 || !object_as_type(o, type, 0))
1736 return PEEL_INVALID;
1739 if (o->type != OBJ_TAG)
1740 return PEEL_NON_TAG;
1742 o = deref_tag_noverify(o);
1743 if (!o)
1744 return PEEL_INVALID;
1746 hashcpy(sha1, o->sha1);
1747 return PEEL_PEELED;
1751 * Peel the entry (if possible) and return its new peel_status. If
1752 * repeel is true, re-peel the entry even if there is an old peeled
1753 * value that is already stored in it.
1755 * It is OK to call this function with a packed reference entry that
1756 * might be stale and might even refer to an object that has since
1757 * been garbage-collected. In such a case, if the entry has
1758 * REF_KNOWS_PEELED then leave the status unchanged and return
1759 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.
1761 static enum peel_status peel_entry(struct ref_entry *entry, int repeel)
1763 enum peel_status status;
1765 if (entry->flag & REF_KNOWS_PEELED) {
1766 if (repeel) {
1767 entry->flag &= ~REF_KNOWS_PEELED;
1768 hashclr(entry->u.value.peeled);
1769 } else {
1770 return is_null_sha1(entry->u.value.peeled) ?
1771 PEEL_NON_TAG : PEEL_PEELED;
1774 if (entry->flag & REF_ISBROKEN)
1775 return PEEL_BROKEN;
1776 if (entry->flag & REF_ISSYMREF)
1777 return PEEL_IS_SYMREF;
1779 status = peel_object(entry->u.value.sha1, entry->u.value.peeled);
1780 if (status == PEEL_PEELED || status == PEEL_NON_TAG)
1781 entry->flag |= REF_KNOWS_PEELED;
1782 return status;
1785 int peel_ref(const char *refname, unsigned char *sha1)
1787 int flag;
1788 unsigned char base[20];
1790 if (current_ref && (current_ref->name == refname
1791 || !strcmp(current_ref->name, refname))) {
1792 if (peel_entry(current_ref, 0))
1793 return -1;
1794 hashcpy(sha1, current_ref->u.value.peeled);
1795 return 0;
1798 if (read_ref_full(refname, RESOLVE_REF_READING, base, &flag))
1799 return -1;
1802 * If the reference is packed, read its ref_entry from the
1803 * cache in the hope that we already know its peeled value.
1804 * We only try this optimization on packed references because
1805 * (a) forcing the filling of the loose reference cache could
1806 * be expensive and (b) loose references anyway usually do not
1807 * have REF_KNOWS_PEELED.
1809 if (flag & REF_ISPACKED) {
1810 struct ref_entry *r = get_packed_ref(refname);
1811 if (r) {
1812 if (peel_entry(r, 0))
1813 return -1;
1814 hashcpy(sha1, r->u.value.peeled);
1815 return 0;
1819 return peel_object(base, sha1);
1822 struct warn_if_dangling_data {
1823 FILE *fp;
1824 const char *refname;
1825 const struct string_list *refnames;
1826 const char *msg_fmt;
1829 static int warn_if_dangling_symref(const char *refname, const unsigned char *sha1,
1830 int flags, void *cb_data)
1832 struct warn_if_dangling_data *d = cb_data;
1833 const char *resolves_to;
1834 unsigned char junk[20];
1836 if (!(flags & REF_ISSYMREF))
1837 return 0;
1839 resolves_to = resolve_ref_unsafe(refname, 0, junk, NULL);
1840 if (!resolves_to
1841 || (d->refname
1842 ? strcmp(resolves_to, d->refname)
1843 : !string_list_has_string(d->refnames, resolves_to))) {
1844 return 0;
1847 fprintf(d->fp, d->msg_fmt, refname);
1848 fputc('\n', d->fp);
1849 return 0;
1852 void warn_dangling_symref(FILE *fp, const char *msg_fmt, const char *refname)
1854 struct warn_if_dangling_data data;
1856 data.fp = fp;
1857 data.refname = refname;
1858 data.refnames = NULL;
1859 data.msg_fmt = msg_fmt;
1860 for_each_rawref(warn_if_dangling_symref, &data);
1863 void warn_dangling_symrefs(FILE *fp, const char *msg_fmt, const struct string_list *refnames)
1865 struct warn_if_dangling_data data;
1867 data.fp = fp;
1868 data.refname = NULL;
1869 data.refnames = refnames;
1870 data.msg_fmt = msg_fmt;
1871 for_each_rawref(warn_if_dangling_symref, &data);
1875 * Call fn for each reference in the specified ref_cache, omitting
1876 * references not in the containing_dir of base. fn is called for all
1877 * references, including broken ones. If fn ever returns a non-zero
1878 * value, stop the iteration and return that value; otherwise, return
1879 * 0.
1881 static int do_for_each_entry(struct ref_cache *refs, const char *base,
1882 each_ref_entry_fn fn, void *cb_data)
1884 struct packed_ref_cache *packed_ref_cache;
1885 struct ref_dir *loose_dir;
1886 struct ref_dir *packed_dir;
1887 int retval = 0;
1890 * We must make sure that all loose refs are read before accessing the
1891 * packed-refs file; this avoids a race condition in which loose refs
1892 * are migrated to the packed-refs file by a simultaneous process, but
1893 * our in-memory view is from before the migration. get_packed_ref_cache()
1894 * takes care of making sure our view is up to date with what is on
1895 * disk.
1897 loose_dir = get_loose_refs(refs);
1898 if (base && *base) {
1899 loose_dir = find_containing_dir(loose_dir, base, 0);
1901 if (loose_dir)
1902 prime_ref_dir(loose_dir);
1904 packed_ref_cache = get_packed_ref_cache(refs);
1905 acquire_packed_ref_cache(packed_ref_cache);
1906 packed_dir = get_packed_ref_dir(packed_ref_cache);
1907 if (base && *base) {
1908 packed_dir = find_containing_dir(packed_dir, base, 0);
1911 if (packed_dir && loose_dir) {
1912 sort_ref_dir(packed_dir);
1913 sort_ref_dir(loose_dir);
1914 retval = do_for_each_entry_in_dirs(
1915 packed_dir, loose_dir, fn, cb_data);
1916 } else if (packed_dir) {
1917 sort_ref_dir(packed_dir);
1918 retval = do_for_each_entry_in_dir(
1919 packed_dir, 0, fn, cb_data);
1920 } else if (loose_dir) {
1921 sort_ref_dir(loose_dir);
1922 retval = do_for_each_entry_in_dir(
1923 loose_dir, 0, fn, cb_data);
1926 release_packed_ref_cache(packed_ref_cache);
1927 return retval;
1931 * Call fn for each reference in the specified ref_cache for which the
1932 * refname begins with base. If trim is non-zero, then trim that many
1933 * characters off the beginning of each refname before passing the
1934 * refname to fn. flags can be DO_FOR_EACH_INCLUDE_BROKEN to include
1935 * broken references in the iteration. If fn ever returns a non-zero
1936 * value, stop the iteration and return that value; otherwise, return
1937 * 0.
1939 static int do_for_each_ref(struct ref_cache *refs, const char *base,
1940 each_ref_fn fn, int trim, int flags, void *cb_data)
1942 struct ref_entry_cb data;
1943 data.base = base;
1944 data.trim = trim;
1945 data.flags = flags;
1946 data.fn = fn;
1947 data.cb_data = cb_data;
1949 if (ref_paranoia < 0)
1950 ref_paranoia = git_env_bool("GIT_REF_PARANOIA", 0);
1951 if (ref_paranoia)
1952 data.flags |= DO_FOR_EACH_INCLUDE_BROKEN;
1954 return do_for_each_entry(refs, base, do_one_ref, &data);
1957 static int do_head_ref(const char *submodule, each_ref_fn fn, void *cb_data)
1959 unsigned char sha1[20];
1960 int flag;
1962 if (submodule) {
1963 if (resolve_gitlink_ref(submodule, "HEAD", sha1) == 0)
1964 return fn("HEAD", sha1, 0, cb_data);
1966 return 0;
1969 if (!read_ref_full("HEAD", RESOLVE_REF_READING, sha1, &flag))
1970 return fn("HEAD", sha1, flag, cb_data);
1972 return 0;
1975 int head_ref(each_ref_fn fn, void *cb_data)
1977 return do_head_ref(NULL, fn, cb_data);
1980 int head_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
1982 return do_head_ref(submodule, fn, cb_data);
1985 int for_each_ref(each_ref_fn fn, void *cb_data)
1987 return do_for_each_ref(&ref_cache, "", fn, 0, 0, cb_data);
1990 int for_each_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
1992 return do_for_each_ref(get_ref_cache(submodule), "", fn, 0, 0, cb_data);
1995 int for_each_ref_in(const char *prefix, each_ref_fn fn, void *cb_data)
1997 return do_for_each_ref(&ref_cache, prefix, fn, strlen(prefix), 0, cb_data);
2000 int for_each_ref_in_submodule(const char *submodule, const char *prefix,
2001 each_ref_fn fn, void *cb_data)
2003 return do_for_each_ref(get_ref_cache(submodule), prefix, fn, strlen(prefix), 0, cb_data);
2006 int for_each_tag_ref(each_ref_fn fn, void *cb_data)
2008 return for_each_ref_in("refs/tags/", fn, cb_data);
2011 int for_each_tag_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
2013 return for_each_ref_in_submodule(submodule, "refs/tags/", fn, cb_data);
2016 int for_each_branch_ref(each_ref_fn fn, void *cb_data)
2018 return for_each_ref_in("refs/heads/", fn, cb_data);
2021 int for_each_branch_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
2023 return for_each_ref_in_submodule(submodule, "refs/heads/", fn, cb_data);
2026 int for_each_remote_ref(each_ref_fn fn, void *cb_data)
2028 return for_each_ref_in("refs/remotes/", fn, cb_data);
2031 int for_each_remote_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
2033 return for_each_ref_in_submodule(submodule, "refs/remotes/", fn, cb_data);
2036 int for_each_replace_ref(each_ref_fn fn, void *cb_data)
2038 return do_for_each_ref(&ref_cache, "refs/replace/", fn, 13, 0, cb_data);
2041 int head_ref_namespaced(each_ref_fn fn, void *cb_data)
2043 struct strbuf buf = STRBUF_INIT;
2044 int ret = 0;
2045 unsigned char sha1[20];
2046 int flag;
2048 strbuf_addf(&buf, "%sHEAD", get_git_namespace());
2049 if (!read_ref_full(buf.buf, RESOLVE_REF_READING, sha1, &flag))
2050 ret = fn(buf.buf, sha1, flag, cb_data);
2051 strbuf_release(&buf);
2053 return ret;
2056 int for_each_namespaced_ref(each_ref_fn fn, void *cb_data)
2058 struct strbuf buf = STRBUF_INIT;
2059 int ret;
2060 strbuf_addf(&buf, "%srefs/", get_git_namespace());
2061 ret = do_for_each_ref(&ref_cache, buf.buf, fn, 0, 0, cb_data);
2062 strbuf_release(&buf);
2063 return ret;
2066 int for_each_glob_ref_in(each_ref_fn fn, const char *pattern,
2067 const char *prefix, void *cb_data)
2069 struct strbuf real_pattern = STRBUF_INIT;
2070 struct ref_filter filter;
2071 int ret;
2073 if (!prefix && !starts_with(pattern, "refs/"))
2074 strbuf_addstr(&real_pattern, "refs/");
2075 else if (prefix)
2076 strbuf_addstr(&real_pattern, prefix);
2077 strbuf_addstr(&real_pattern, pattern);
2079 if (!has_glob_specials(pattern)) {
2080 /* Append implied '/' '*' if not present. */
2081 if (real_pattern.buf[real_pattern.len - 1] != '/')
2082 strbuf_addch(&real_pattern, '/');
2083 /* No need to check for '*', there is none. */
2084 strbuf_addch(&real_pattern, '*');
2087 filter.pattern = real_pattern.buf;
2088 filter.fn = fn;
2089 filter.cb_data = cb_data;
2090 ret = for_each_ref(filter_refs, &filter);
2092 strbuf_release(&real_pattern);
2093 return ret;
2096 int for_each_glob_ref(each_ref_fn fn, const char *pattern, void *cb_data)
2098 return for_each_glob_ref_in(fn, pattern, NULL, cb_data);
2101 int for_each_rawref(each_ref_fn fn, void *cb_data)
2103 return do_for_each_ref(&ref_cache, "", fn, 0,
2104 DO_FOR_EACH_INCLUDE_BROKEN, cb_data);
2107 const char *prettify_refname(const char *name)
2109 return name + (
2110 starts_with(name, "refs/heads/") ? 11 :
2111 starts_with(name, "refs/tags/") ? 10 :
2112 starts_with(name, "refs/remotes/") ? 13 :
2116 static const char *ref_rev_parse_rules[] = {
2117 "%.*s",
2118 "refs/%.*s",
2119 "refs/tags/%.*s",
2120 "refs/heads/%.*s",
2121 "refs/remotes/%.*s",
2122 "refs/remotes/%.*s/HEAD",
2123 NULL
2126 int refname_match(const char *abbrev_name, const char *full_name)
2128 const char **p;
2129 const int abbrev_name_len = strlen(abbrev_name);
2131 for (p = ref_rev_parse_rules; *p; p++) {
2132 if (!strcmp(full_name, mkpath(*p, abbrev_name_len, abbrev_name))) {
2133 return 1;
2137 return 0;
2140 static void unlock_ref(struct ref_lock *lock)
2142 /* Do not free lock->lk -- atexit() still looks at them */
2143 if (lock->lk)
2144 rollback_lock_file(lock->lk);
2145 free(lock->ref_name);
2146 free(lock->orig_ref_name);
2147 free(lock);
2150 /* This function should make sure errno is meaningful on error */
2151 static struct ref_lock *verify_lock(struct ref_lock *lock,
2152 const unsigned char *old_sha1, int mustexist)
2154 if (read_ref_full(lock->ref_name,
2155 mustexist ? RESOLVE_REF_READING : 0,
2156 lock->old_sha1, NULL)) {
2157 int save_errno = errno;
2158 error("Can't verify ref %s", lock->ref_name);
2159 unlock_ref(lock);
2160 errno = save_errno;
2161 return NULL;
2163 if (hashcmp(lock->old_sha1, old_sha1)) {
2164 error("Ref %s is at %s but expected %s", lock->ref_name,
2165 sha1_to_hex(lock->old_sha1), sha1_to_hex(old_sha1));
2166 unlock_ref(lock);
2167 errno = EBUSY;
2168 return NULL;
2170 return lock;
2173 static int remove_empty_directories(const char *file)
2175 /* we want to create a file but there is a directory there;
2176 * if that is an empty directory (or a directory that contains
2177 * only empty directories), remove them.
2179 struct strbuf path;
2180 int result, save_errno;
2182 strbuf_init(&path, 20);
2183 strbuf_addstr(&path, file);
2185 result = remove_dir_recursively(&path, REMOVE_DIR_EMPTY_ONLY);
2186 save_errno = errno;
2188 strbuf_release(&path);
2189 errno = save_errno;
2191 return result;
2195 * *string and *len will only be substituted, and *string returned (for
2196 * later free()ing) if the string passed in is a magic short-hand form
2197 * to name a branch.
2199 static char *substitute_branch_name(const char **string, int *len)
2201 struct strbuf buf = STRBUF_INIT;
2202 int ret = interpret_branch_name(*string, *len, &buf);
2204 if (ret == *len) {
2205 size_t size;
2206 *string = strbuf_detach(&buf, &size);
2207 *len = size;
2208 return (char *)*string;
2211 return NULL;
2214 int dwim_ref(const char *str, int len, unsigned char *sha1, char **ref)
2216 char *last_branch = substitute_branch_name(&str, &len);
2217 const char **p, *r;
2218 int refs_found = 0;
2220 *ref = NULL;
2221 for (p = ref_rev_parse_rules; *p; p++) {
2222 char fullref[PATH_MAX];
2223 unsigned char sha1_from_ref[20];
2224 unsigned char *this_result;
2225 int flag;
2227 this_result = refs_found ? sha1_from_ref : sha1;
2228 mksnpath(fullref, sizeof(fullref), *p, len, str);
2229 r = resolve_ref_unsafe(fullref, RESOLVE_REF_READING,
2230 this_result, &flag);
2231 if (r) {
2232 if (!refs_found++)
2233 *ref = xstrdup(r);
2234 if (!warn_ambiguous_refs)
2235 break;
2236 } else if ((flag & REF_ISSYMREF) && strcmp(fullref, "HEAD")) {
2237 warning("ignoring dangling symref %s.", fullref);
2238 } else if ((flag & REF_ISBROKEN) && strchr(fullref, '/')) {
2239 warning("ignoring broken ref %s.", fullref);
2242 free(last_branch);
2243 return refs_found;
2246 int dwim_log(const char *str, int len, unsigned char *sha1, char **log)
2248 char *last_branch = substitute_branch_name(&str, &len);
2249 const char **p;
2250 int logs_found = 0;
2252 *log = NULL;
2253 for (p = ref_rev_parse_rules; *p; p++) {
2254 unsigned char hash[20];
2255 char path[PATH_MAX];
2256 const char *ref, *it;
2258 mksnpath(path, sizeof(path), *p, len, str);
2259 ref = resolve_ref_unsafe(path, RESOLVE_REF_READING,
2260 hash, NULL);
2261 if (!ref)
2262 continue;
2263 if (reflog_exists(path))
2264 it = path;
2265 else if (strcmp(ref, path) && reflog_exists(ref))
2266 it = ref;
2267 else
2268 continue;
2269 if (!logs_found++) {
2270 *log = xstrdup(it);
2271 hashcpy(sha1, hash);
2273 if (!warn_ambiguous_refs)
2274 break;
2276 free(last_branch);
2277 return logs_found;
2281 * Locks a ref returning the lock on success and NULL on failure.
2282 * On failure errno is set to something meaningful.
2284 static struct ref_lock *lock_ref_sha1_basic(const char *refname,
2285 const unsigned char *old_sha1,
2286 const struct string_list *skip,
2287 unsigned int flags, int *type_p)
2289 char *ref_file;
2290 const char *orig_refname = refname;
2291 struct ref_lock *lock;
2292 int last_errno = 0;
2293 int type, lflags;
2294 int mustexist = (old_sha1 && !is_null_sha1(old_sha1));
2295 int resolve_flags = 0;
2296 int attempts_remaining = 3;
2298 lock = xcalloc(1, sizeof(struct ref_lock));
2299 lock->lock_fd = -1;
2301 if (mustexist)
2302 resolve_flags |= RESOLVE_REF_READING;
2303 if (flags & REF_DELETING) {
2304 resolve_flags |= RESOLVE_REF_ALLOW_BAD_NAME;
2305 if (flags & REF_NODEREF)
2306 resolve_flags |= RESOLVE_REF_NO_RECURSE;
2309 refname = resolve_ref_unsafe(refname, resolve_flags,
2310 lock->old_sha1, &type);
2311 if (!refname && errno == EISDIR) {
2312 /* we are trying to lock foo but we used to
2313 * have foo/bar which now does not exist;
2314 * it is normal for the empty directory 'foo'
2315 * to remain.
2317 ref_file = git_path("%s", orig_refname);
2318 if (remove_empty_directories(ref_file)) {
2319 last_errno = errno;
2320 error("there are still refs under '%s'", orig_refname);
2321 goto error_return;
2323 refname = resolve_ref_unsafe(orig_refname, resolve_flags,
2324 lock->old_sha1, &type);
2326 if (type_p)
2327 *type_p = type;
2328 if (!refname) {
2329 last_errno = errno;
2330 error("unable to resolve reference %s: %s",
2331 orig_refname, strerror(errno));
2332 goto error_return;
2335 * If the ref did not exist and we are creating it, make sure
2336 * there is no existing packed ref whose name begins with our
2337 * refname, nor a packed ref whose name is a proper prefix of
2338 * our refname.
2340 if (is_null_sha1(lock->old_sha1) &&
2341 !is_refname_available(refname, skip, get_packed_refs(&ref_cache))) {
2342 last_errno = ENOTDIR;
2343 goto error_return;
2346 lock->lk = xcalloc(1, sizeof(struct lock_file));
2348 lflags = 0;
2349 if (flags & REF_NODEREF) {
2350 refname = orig_refname;
2351 lflags |= LOCK_NO_DEREF;
2353 lock->ref_name = xstrdup(refname);
2354 lock->orig_ref_name = xstrdup(orig_refname);
2355 ref_file = git_path("%s", refname);
2357 retry:
2358 switch (safe_create_leading_directories(ref_file)) {
2359 case SCLD_OK:
2360 break; /* success */
2361 case SCLD_VANISHED:
2362 if (--attempts_remaining > 0)
2363 goto retry;
2364 /* fall through */
2365 default:
2366 last_errno = errno;
2367 error("unable to create directory for %s", ref_file);
2368 goto error_return;
2371 lock->lock_fd = hold_lock_file_for_update(lock->lk, ref_file, lflags);
2372 if (lock->lock_fd < 0) {
2373 last_errno = errno;
2374 if (errno == ENOENT && --attempts_remaining > 0)
2376 * Maybe somebody just deleted one of the
2377 * directories leading to ref_file. Try
2378 * again:
2380 goto retry;
2381 else {
2382 struct strbuf err = STRBUF_INIT;
2383 unable_to_lock_message(ref_file, errno, &err);
2384 error("%s", err.buf);
2385 strbuf_release(&err);
2386 goto error_return;
2389 return old_sha1 ? verify_lock(lock, old_sha1, mustexist) : lock;
2391 error_return:
2392 unlock_ref(lock);
2393 errno = last_errno;
2394 return NULL;
2398 * Write an entry to the packed-refs file for the specified refname.
2399 * If peeled is non-NULL, write it as the entry's peeled value.
2401 static void write_packed_entry(FILE *fh, char *refname, unsigned char *sha1,
2402 unsigned char *peeled)
2404 fprintf_or_die(fh, "%s %s\n", sha1_to_hex(sha1), refname);
2405 if (peeled)
2406 fprintf_or_die(fh, "^%s\n", sha1_to_hex(peeled));
2410 * An each_ref_entry_fn that writes the entry to a packed-refs file.
2412 static int write_packed_entry_fn(struct ref_entry *entry, void *cb_data)
2414 enum peel_status peel_status = peel_entry(entry, 0);
2416 if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)
2417 error("internal error: %s is not a valid packed reference!",
2418 entry->name);
2419 write_packed_entry(cb_data, entry->name, entry->u.value.sha1,
2420 peel_status == PEEL_PEELED ?
2421 entry->u.value.peeled : NULL);
2422 return 0;
2425 /* This should return a meaningful errno on failure */
2426 int lock_packed_refs(int flags)
2428 struct packed_ref_cache *packed_ref_cache;
2430 if (hold_lock_file_for_update(&packlock, git_path("packed-refs"), flags) < 0)
2431 return -1;
2433 * Get the current packed-refs while holding the lock. If the
2434 * packed-refs file has been modified since we last read it,
2435 * this will automatically invalidate the cache and re-read
2436 * the packed-refs file.
2438 packed_ref_cache = get_packed_ref_cache(&ref_cache);
2439 packed_ref_cache->lock = &packlock;
2440 /* Increment the reference count to prevent it from being freed: */
2441 acquire_packed_ref_cache(packed_ref_cache);
2442 return 0;
2446 * Commit the packed refs changes.
2447 * On error we must make sure that errno contains a meaningful value.
2449 int commit_packed_refs(void)
2451 struct packed_ref_cache *packed_ref_cache =
2452 get_packed_ref_cache(&ref_cache);
2453 int error = 0;
2454 int save_errno = 0;
2455 FILE *out;
2457 if (!packed_ref_cache->lock)
2458 die("internal error: packed-refs not locked");
2460 out = fdopen_lock_file(packed_ref_cache->lock, "w");
2461 if (!out)
2462 die_errno("unable to fdopen packed-refs descriptor");
2464 fprintf_or_die(out, "%s", PACKED_REFS_HEADER);
2465 do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache),
2466 0, write_packed_entry_fn, out);
2468 if (commit_lock_file(packed_ref_cache->lock)) {
2469 save_errno = errno;
2470 error = -1;
2472 packed_ref_cache->lock = NULL;
2473 release_packed_ref_cache(packed_ref_cache);
2474 errno = save_errno;
2475 return error;
2478 void rollback_packed_refs(void)
2480 struct packed_ref_cache *packed_ref_cache =
2481 get_packed_ref_cache(&ref_cache);
2483 if (!packed_ref_cache->lock)
2484 die("internal error: packed-refs not locked");
2485 rollback_lock_file(packed_ref_cache->lock);
2486 packed_ref_cache->lock = NULL;
2487 release_packed_ref_cache(packed_ref_cache);
2488 clear_packed_ref_cache(&ref_cache);
2491 struct ref_to_prune {
2492 struct ref_to_prune *next;
2493 unsigned char sha1[20];
2494 char name[FLEX_ARRAY];
2497 struct pack_refs_cb_data {
2498 unsigned int flags;
2499 struct ref_dir *packed_refs;
2500 struct ref_to_prune *ref_to_prune;
2504 * An each_ref_entry_fn that is run over loose references only. If
2505 * the loose reference can be packed, add an entry in the packed ref
2506 * cache. If the reference should be pruned, also add it to
2507 * ref_to_prune in the pack_refs_cb_data.
2509 static int pack_if_possible_fn(struct ref_entry *entry, void *cb_data)
2511 struct pack_refs_cb_data *cb = cb_data;
2512 enum peel_status peel_status;
2513 struct ref_entry *packed_entry;
2514 int is_tag_ref = starts_with(entry->name, "refs/tags/");
2516 /* ALWAYS pack tags */
2517 if (!(cb->flags & PACK_REFS_ALL) && !is_tag_ref)
2518 return 0;
2520 /* Do not pack symbolic or broken refs: */
2521 if ((entry->flag & REF_ISSYMREF) || !ref_resolves_to_object(entry))
2522 return 0;
2524 /* Add a packed ref cache entry equivalent to the loose entry. */
2525 peel_status = peel_entry(entry, 1);
2526 if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)
2527 die("internal error peeling reference %s (%s)",
2528 entry->name, sha1_to_hex(entry->u.value.sha1));
2529 packed_entry = find_ref(cb->packed_refs, entry->name);
2530 if (packed_entry) {
2531 /* Overwrite existing packed entry with info from loose entry */
2532 packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED;
2533 hashcpy(packed_entry->u.value.sha1, entry->u.value.sha1);
2534 } else {
2535 packed_entry = create_ref_entry(entry->name, entry->u.value.sha1,
2536 REF_ISPACKED | REF_KNOWS_PEELED, 0);
2537 add_ref(cb->packed_refs, packed_entry);
2539 hashcpy(packed_entry->u.value.peeled, entry->u.value.peeled);
2541 /* Schedule the loose reference for pruning if requested. */
2542 if ((cb->flags & PACK_REFS_PRUNE)) {
2543 int namelen = strlen(entry->name) + 1;
2544 struct ref_to_prune *n = xcalloc(1, sizeof(*n) + namelen);
2545 hashcpy(n->sha1, entry->u.value.sha1);
2546 strcpy(n->name, entry->name);
2547 n->next = cb->ref_to_prune;
2548 cb->ref_to_prune = n;
2550 return 0;
2554 * Remove empty parents, but spare refs/ and immediate subdirs.
2555 * Note: munges *name.
2557 static void try_remove_empty_parents(char *name)
2559 char *p, *q;
2560 int i;
2561 p = name;
2562 for (i = 0; i < 2; i++) { /* refs/{heads,tags,...}/ */
2563 while (*p && *p != '/')
2564 p++;
2565 /* tolerate duplicate slashes; see check_refname_format() */
2566 while (*p == '/')
2567 p++;
2569 for (q = p; *q; q++)
2571 while (1) {
2572 while (q > p && *q != '/')
2573 q--;
2574 while (q > p && *(q-1) == '/')
2575 q--;
2576 if (q == p)
2577 break;
2578 *q = '\0';
2579 if (rmdir(git_path("%s", name)))
2580 break;
2584 /* make sure nobody touched the ref, and unlink */
2585 static void prune_ref(struct ref_to_prune *r)
2587 struct ref_transaction *transaction;
2588 struct strbuf err = STRBUF_INIT;
2590 if (check_refname_format(r->name, 0))
2591 return;
2593 transaction = ref_transaction_begin(&err);
2594 if (!transaction ||
2595 ref_transaction_delete(transaction, r->name, r->sha1,
2596 REF_ISPRUNING, NULL, &err) ||
2597 ref_transaction_commit(transaction, &err)) {
2598 ref_transaction_free(transaction);
2599 error("%s", err.buf);
2600 strbuf_release(&err);
2601 return;
2603 ref_transaction_free(transaction);
2604 strbuf_release(&err);
2605 try_remove_empty_parents(r->name);
2608 static void prune_refs(struct ref_to_prune *r)
2610 while (r) {
2611 prune_ref(r);
2612 r = r->next;
2616 int pack_refs(unsigned int flags)
2618 struct pack_refs_cb_data cbdata;
2620 memset(&cbdata, 0, sizeof(cbdata));
2621 cbdata.flags = flags;
2623 lock_packed_refs(LOCK_DIE_ON_ERROR);
2624 cbdata.packed_refs = get_packed_refs(&ref_cache);
2626 do_for_each_entry_in_dir(get_loose_refs(&ref_cache), 0,
2627 pack_if_possible_fn, &cbdata);
2629 if (commit_packed_refs())
2630 die_errno("unable to overwrite old ref-pack file");
2632 prune_refs(cbdata.ref_to_prune);
2633 return 0;
2636 int repack_without_refs(struct string_list *refnames, struct strbuf *err)
2638 struct ref_dir *packed;
2639 struct string_list_item *refname;
2640 int ret, needs_repacking = 0, removed = 0;
2642 assert(err);
2644 /* Look for a packed ref */
2645 for_each_string_list_item(refname, refnames) {
2646 if (get_packed_ref(refname->string)) {
2647 needs_repacking = 1;
2648 break;
2652 /* Avoid locking if we have nothing to do */
2653 if (!needs_repacking)
2654 return 0; /* no refname exists in packed refs */
2656 if (lock_packed_refs(0)) {
2657 unable_to_lock_message(git_path("packed-refs"), errno, err);
2658 return -1;
2660 packed = get_packed_refs(&ref_cache);
2662 /* Remove refnames from the cache */
2663 for_each_string_list_item(refname, refnames)
2664 if (remove_entry(packed, refname->string) != -1)
2665 removed = 1;
2666 if (!removed) {
2668 * All packed entries disappeared while we were
2669 * acquiring the lock.
2671 rollback_packed_refs();
2672 return 0;
2675 /* Write what remains */
2676 ret = commit_packed_refs();
2677 if (ret)
2678 strbuf_addf(err, "unable to overwrite old ref-pack file: %s",
2679 strerror(errno));
2680 return ret;
2683 static int delete_ref_loose(struct ref_lock *lock, int flag, struct strbuf *err)
2685 assert(err);
2687 if (!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) {
2689 * loose. The loose file name is the same as the
2690 * lockfile name, minus ".lock":
2692 char *loose_filename = get_locked_file_path(lock->lk);
2693 int res = unlink_or_msg(loose_filename, err);
2694 free(loose_filename);
2695 if (res)
2696 return 1;
2698 return 0;
2701 int delete_ref(const char *refname, const unsigned char *sha1, unsigned int flags)
2703 struct ref_transaction *transaction;
2704 struct strbuf err = STRBUF_INIT;
2706 transaction = ref_transaction_begin(&err);
2707 if (!transaction ||
2708 ref_transaction_delete(transaction, refname,
2709 (sha1 && !is_null_sha1(sha1)) ? sha1 : NULL,
2710 flags, NULL, &err) ||
2711 ref_transaction_commit(transaction, &err)) {
2712 error("%s", err.buf);
2713 ref_transaction_free(transaction);
2714 strbuf_release(&err);
2715 return 1;
2717 ref_transaction_free(transaction);
2718 strbuf_release(&err);
2719 return 0;
2723 * People using contrib's git-new-workdir have .git/logs/refs ->
2724 * /some/other/path/.git/logs/refs, and that may live on another device.
2726 * IOW, to avoid cross device rename errors, the temporary renamed log must
2727 * live into logs/refs.
2729 #define TMP_RENAMED_LOG "logs/refs/.tmp-renamed-log"
2731 static int rename_tmp_log(const char *newrefname)
2733 int attempts_remaining = 4;
2735 retry:
2736 switch (safe_create_leading_directories(git_path("logs/%s", newrefname))) {
2737 case SCLD_OK:
2738 break; /* success */
2739 case SCLD_VANISHED:
2740 if (--attempts_remaining > 0)
2741 goto retry;
2742 /* fall through */
2743 default:
2744 error("unable to create directory for %s", newrefname);
2745 return -1;
2748 if (rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", newrefname))) {
2749 if ((errno==EISDIR || errno==ENOTDIR) && --attempts_remaining > 0) {
2751 * rename(a, b) when b is an existing
2752 * directory ought to result in ISDIR, but
2753 * Solaris 5.8 gives ENOTDIR. Sheesh.
2755 if (remove_empty_directories(git_path("logs/%s", newrefname))) {
2756 error("Directory not empty: logs/%s", newrefname);
2757 return -1;
2759 goto retry;
2760 } else if (errno == ENOENT && --attempts_remaining > 0) {
2762 * Maybe another process just deleted one of
2763 * the directories in the path to newrefname.
2764 * Try again from the beginning.
2766 goto retry;
2767 } else {
2768 error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s: %s",
2769 newrefname, strerror(errno));
2770 return -1;
2773 return 0;
2776 static int rename_ref_available(const char *oldname, const char *newname)
2778 struct string_list skip = STRING_LIST_INIT_NODUP;
2779 int ret;
2781 string_list_insert(&skip, oldname);
2782 ret = is_refname_available(newname, &skip, get_packed_refs(&ref_cache))
2783 && is_refname_available(newname, &skip, get_loose_refs(&ref_cache));
2784 string_list_clear(&skip, 0);
2785 return ret;
2788 static int write_ref_sha1(struct ref_lock *lock, const unsigned char *sha1,
2789 const char *logmsg);
2791 int rename_ref(const char *oldrefname, const char *newrefname, const char *logmsg)
2793 unsigned char sha1[20], orig_sha1[20];
2794 int flag = 0, logmoved = 0;
2795 struct ref_lock *lock;
2796 struct stat loginfo;
2797 int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);
2798 const char *symref = NULL;
2800 if (log && S_ISLNK(loginfo.st_mode))
2801 return error("reflog for %s is a symlink", oldrefname);
2803 symref = resolve_ref_unsafe(oldrefname, RESOLVE_REF_READING,
2804 orig_sha1, &flag);
2805 if (flag & REF_ISSYMREF)
2806 return error("refname %s is a symbolic ref, renaming it is not supported",
2807 oldrefname);
2808 if (!symref)
2809 return error("refname %s not found", oldrefname);
2811 if (!rename_ref_available(oldrefname, newrefname))
2812 return 1;
2814 if (log && rename(git_path("logs/%s", oldrefname), git_path(TMP_RENAMED_LOG)))
2815 return error("unable to move logfile logs/%s to "TMP_RENAMED_LOG": %s",
2816 oldrefname, strerror(errno));
2818 if (delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {
2819 error("unable to delete old %s", oldrefname);
2820 goto rollback;
2823 if (!read_ref_full(newrefname, RESOLVE_REF_READING, sha1, NULL) &&
2824 delete_ref(newrefname, sha1, REF_NODEREF)) {
2825 if (errno==EISDIR) {
2826 if (remove_empty_directories(git_path("%s", newrefname))) {
2827 error("Directory not empty: %s", newrefname);
2828 goto rollback;
2830 } else {
2831 error("unable to delete existing %s", newrefname);
2832 goto rollback;
2836 if (log && rename_tmp_log(newrefname))
2837 goto rollback;
2839 logmoved = log;
2841 lock = lock_ref_sha1_basic(newrefname, NULL, NULL, 0, NULL);
2842 if (!lock) {
2843 error("unable to lock %s for update", newrefname);
2844 goto rollback;
2846 hashcpy(lock->old_sha1, orig_sha1);
2847 if (write_ref_sha1(lock, orig_sha1, logmsg)) {
2848 error("unable to write current sha1 into %s", newrefname);
2849 goto rollback;
2852 return 0;
2854 rollback:
2855 lock = lock_ref_sha1_basic(oldrefname, NULL, NULL, 0, NULL);
2856 if (!lock) {
2857 error("unable to lock %s for rollback", oldrefname);
2858 goto rollbacklog;
2861 flag = log_all_ref_updates;
2862 log_all_ref_updates = 0;
2863 if (write_ref_sha1(lock, orig_sha1, NULL))
2864 error("unable to write current sha1 into %s", oldrefname);
2865 log_all_ref_updates = flag;
2867 rollbacklog:
2868 if (logmoved && rename(git_path("logs/%s", newrefname), git_path("logs/%s", oldrefname)))
2869 error("unable to restore logfile %s from %s: %s",
2870 oldrefname, newrefname, strerror(errno));
2871 if (!logmoved && log &&
2872 rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", oldrefname)))
2873 error("unable to restore logfile %s from "TMP_RENAMED_LOG": %s",
2874 oldrefname, strerror(errno));
2876 return 1;
2879 static int close_ref(struct ref_lock *lock)
2881 if (close_lock_file(lock->lk))
2882 return -1;
2883 lock->lock_fd = -1;
2884 return 0;
2887 static int commit_ref(struct ref_lock *lock)
2889 if (commit_lock_file(lock->lk))
2890 return -1;
2891 lock->lock_fd = -1;
2892 return 0;
2896 * copy the reflog message msg to buf, which has been allocated sufficiently
2897 * large, while cleaning up the whitespaces. Especially, convert LF to space,
2898 * because reflog file is one line per entry.
2900 static int copy_msg(char *buf, const char *msg)
2902 char *cp = buf;
2903 char c;
2904 int wasspace = 1;
2906 *cp++ = '\t';
2907 while ((c = *msg++)) {
2908 if (wasspace && isspace(c))
2909 continue;
2910 wasspace = isspace(c);
2911 if (wasspace)
2912 c = ' ';
2913 *cp++ = c;
2915 while (buf < cp && isspace(cp[-1]))
2916 cp--;
2917 *cp++ = '\n';
2918 return cp - buf;
2921 /* This function must set a meaningful errno on failure */
2922 int log_ref_setup(const char *refname, char *logfile, int bufsize)
2924 int logfd, oflags = O_APPEND | O_WRONLY;
2926 git_snpath(logfile, bufsize, "logs/%s", refname);
2927 if (log_all_ref_updates &&
2928 (starts_with(refname, "refs/heads/") ||
2929 starts_with(refname, "refs/remotes/") ||
2930 starts_with(refname, "refs/notes/") ||
2931 !strcmp(refname, "HEAD"))) {
2932 if (safe_create_leading_directories(logfile) < 0) {
2933 int save_errno = errno;
2934 error("unable to create directory for %s", logfile);
2935 errno = save_errno;
2936 return -1;
2938 oflags |= O_CREAT;
2941 logfd = open(logfile, oflags, 0666);
2942 if (logfd < 0) {
2943 if (!(oflags & O_CREAT) && (errno == ENOENT || errno == EISDIR))
2944 return 0;
2946 if (errno == EISDIR) {
2947 if (remove_empty_directories(logfile)) {
2948 int save_errno = errno;
2949 error("There are still logs under '%s'",
2950 logfile);
2951 errno = save_errno;
2952 return -1;
2954 logfd = open(logfile, oflags, 0666);
2957 if (logfd < 0) {
2958 int save_errno = errno;
2959 error("Unable to append to %s: %s", logfile,
2960 strerror(errno));
2961 errno = save_errno;
2962 return -1;
2966 adjust_shared_perm(logfile);
2967 close(logfd);
2968 return 0;
2971 static int log_ref_write_fd(int fd, const unsigned char *old_sha1,
2972 const unsigned char *new_sha1,
2973 const char *committer, const char *msg)
2975 int msglen, written;
2976 unsigned maxlen, len;
2977 char *logrec;
2979 msglen = msg ? strlen(msg) : 0;
2980 maxlen = strlen(committer) + msglen + 100;
2981 logrec = xmalloc(maxlen);
2982 len = sprintf(logrec, "%s %s %s\n",
2983 sha1_to_hex(old_sha1),
2984 sha1_to_hex(new_sha1),
2985 committer);
2986 if (msglen)
2987 len += copy_msg(logrec + len - 1, msg) - 1;
2989 written = len <= maxlen ? write_in_full(fd, logrec, len) : -1;
2990 free(logrec);
2991 if (written != len)
2992 return -1;
2994 return 0;
2997 static int log_ref_write(const char *refname, const unsigned char *old_sha1,
2998 const unsigned char *new_sha1, const char *msg)
3000 int logfd, result, oflags = O_APPEND | O_WRONLY;
3001 char log_file[PATH_MAX];
3003 if (log_all_ref_updates < 0)
3004 log_all_ref_updates = !is_bare_repository();
3006 result = log_ref_setup(refname, log_file, sizeof(log_file));
3007 if (result)
3008 return result;
3010 logfd = open(log_file, oflags);
3011 if (logfd < 0)
3012 return 0;
3013 result = log_ref_write_fd(logfd, old_sha1, new_sha1,
3014 git_committer_info(0), msg);
3015 if (result) {
3016 int save_errno = errno;
3017 close(logfd);
3018 error("Unable to append to %s", log_file);
3019 errno = save_errno;
3020 return -1;
3022 if (close(logfd)) {
3023 int save_errno = errno;
3024 error("Unable to append to %s", log_file);
3025 errno = save_errno;
3026 return -1;
3028 return 0;
3031 int is_branch(const char *refname)
3033 return !strcmp(refname, "HEAD") || starts_with(refname, "refs/heads/");
3037 * Write sha1 into the ref specified by the lock. Make sure that errno
3038 * is sane on error.
3040 static int write_ref_sha1(struct ref_lock *lock,
3041 const unsigned char *sha1, const char *logmsg)
3043 static char term = '\n';
3044 struct object *o;
3046 o = parse_object(sha1);
3047 if (!o) {
3048 error("Trying to write ref %s with nonexistent object %s",
3049 lock->ref_name, sha1_to_hex(sha1));
3050 unlock_ref(lock);
3051 errno = EINVAL;
3052 return -1;
3054 if (o->type != OBJ_COMMIT && is_branch(lock->ref_name)) {
3055 error("Trying to write non-commit object %s to branch %s",
3056 sha1_to_hex(sha1), lock->ref_name);
3057 unlock_ref(lock);
3058 errno = EINVAL;
3059 return -1;
3061 if (write_in_full(lock->lock_fd, sha1_to_hex(sha1), 40) != 40 ||
3062 write_in_full(lock->lock_fd, &term, 1) != 1 ||
3063 close_ref(lock) < 0) {
3064 int save_errno = errno;
3065 error("Couldn't write %s", lock->lk->filename.buf);
3066 unlock_ref(lock);
3067 errno = save_errno;
3068 return -1;
3070 clear_loose_ref_cache(&ref_cache);
3071 if (log_ref_write(lock->ref_name, lock->old_sha1, sha1, logmsg) < 0 ||
3072 (strcmp(lock->ref_name, lock->orig_ref_name) &&
3073 log_ref_write(lock->orig_ref_name, lock->old_sha1, sha1, logmsg) < 0)) {
3074 unlock_ref(lock);
3075 return -1;
3077 if (strcmp(lock->orig_ref_name, "HEAD") != 0) {
3079 * Special hack: If a branch is updated directly and HEAD
3080 * points to it (may happen on the remote side of a push
3081 * for example) then logically the HEAD reflog should be
3082 * updated too.
3083 * A generic solution implies reverse symref information,
3084 * but finding all symrefs pointing to the given branch
3085 * would be rather costly for this rare event (the direct
3086 * update of a branch) to be worth it. So let's cheat and
3087 * check with HEAD only which should cover 99% of all usage
3088 * scenarios (even 100% of the default ones).
3090 unsigned char head_sha1[20];
3091 int head_flag;
3092 const char *head_ref;
3093 head_ref = resolve_ref_unsafe("HEAD", RESOLVE_REF_READING,
3094 head_sha1, &head_flag);
3095 if (head_ref && (head_flag & REF_ISSYMREF) &&
3096 !strcmp(head_ref, lock->ref_name))
3097 log_ref_write("HEAD", lock->old_sha1, sha1, logmsg);
3099 if (commit_ref(lock)) {
3100 error("Couldn't set %s", lock->ref_name);
3101 unlock_ref(lock);
3102 return -1;
3104 unlock_ref(lock);
3105 return 0;
3108 int create_symref(const char *ref_target, const char *refs_heads_master,
3109 const char *logmsg)
3111 const char *lockpath;
3112 char ref[1000];
3113 int fd, len, written;
3114 char *git_HEAD = git_pathdup("%s", ref_target);
3115 unsigned char old_sha1[20], new_sha1[20];
3117 if (logmsg && read_ref(ref_target, old_sha1))
3118 hashclr(old_sha1);
3120 if (safe_create_leading_directories(git_HEAD) < 0)
3121 return error("unable to create directory for %s", git_HEAD);
3123 #ifndef NO_SYMLINK_HEAD
3124 if (prefer_symlink_refs) {
3125 unlink(git_HEAD);
3126 if (!symlink(refs_heads_master, git_HEAD))
3127 goto done;
3128 fprintf(stderr, "no symlink - falling back to symbolic ref\n");
3130 #endif
3132 len = snprintf(ref, sizeof(ref), "ref: %s\n", refs_heads_master);
3133 if (sizeof(ref) <= len) {
3134 error("refname too long: %s", refs_heads_master);
3135 goto error_free_return;
3137 lockpath = mkpath("%s.lock", git_HEAD);
3138 fd = open(lockpath, O_CREAT | O_EXCL | O_WRONLY, 0666);
3139 if (fd < 0) {
3140 error("Unable to open %s for writing", lockpath);
3141 goto error_free_return;
3143 written = write_in_full(fd, ref, len);
3144 if (close(fd) != 0 || written != len) {
3145 error("Unable to write to %s", lockpath);
3146 goto error_unlink_return;
3148 if (rename(lockpath, git_HEAD) < 0) {
3149 error("Unable to create %s", git_HEAD);
3150 goto error_unlink_return;
3152 if (adjust_shared_perm(git_HEAD)) {
3153 error("Unable to fix permissions on %s", lockpath);
3154 error_unlink_return:
3155 unlink_or_warn(lockpath);
3156 error_free_return:
3157 free(git_HEAD);
3158 return -1;
3161 #ifndef NO_SYMLINK_HEAD
3162 done:
3163 #endif
3164 if (logmsg && !read_ref(refs_heads_master, new_sha1))
3165 log_ref_write(ref_target, old_sha1, new_sha1, logmsg);
3167 free(git_HEAD);
3168 return 0;
3171 struct read_ref_at_cb {
3172 const char *refname;
3173 unsigned long at_time;
3174 int cnt;
3175 int reccnt;
3176 unsigned char *sha1;
3177 int found_it;
3179 unsigned char osha1[20];
3180 unsigned char nsha1[20];
3181 int tz;
3182 unsigned long date;
3183 char **msg;
3184 unsigned long *cutoff_time;
3185 int *cutoff_tz;
3186 int *cutoff_cnt;
3189 static int read_ref_at_ent(unsigned char *osha1, unsigned char *nsha1,
3190 const char *email, unsigned long timestamp, int tz,
3191 const char *message, void *cb_data)
3193 struct read_ref_at_cb *cb = cb_data;
3195 cb->reccnt++;
3196 cb->tz = tz;
3197 cb->date = timestamp;
3199 if (timestamp <= cb->at_time || cb->cnt == 0) {
3200 if (cb->msg)
3201 *cb->msg = xstrdup(message);
3202 if (cb->cutoff_time)
3203 *cb->cutoff_time = timestamp;
3204 if (cb->cutoff_tz)
3205 *cb->cutoff_tz = tz;
3206 if (cb->cutoff_cnt)
3207 *cb->cutoff_cnt = cb->reccnt - 1;
3209 * we have not yet updated cb->[n|o]sha1 so they still
3210 * hold the values for the previous record.
3212 if (!is_null_sha1(cb->osha1)) {
3213 hashcpy(cb->sha1, nsha1);
3214 if (hashcmp(cb->osha1, nsha1))
3215 warning("Log for ref %s has gap after %s.",
3216 cb->refname, show_date(cb->date, cb->tz, DATE_RFC2822));
3218 else if (cb->date == cb->at_time)
3219 hashcpy(cb->sha1, nsha1);
3220 else if (hashcmp(nsha1, cb->sha1))
3221 warning("Log for ref %s unexpectedly ended on %s.",
3222 cb->refname, show_date(cb->date, cb->tz,
3223 DATE_RFC2822));
3224 hashcpy(cb->osha1, osha1);
3225 hashcpy(cb->nsha1, nsha1);
3226 cb->found_it = 1;
3227 return 1;
3229 hashcpy(cb->osha1, osha1);
3230 hashcpy(cb->nsha1, nsha1);
3231 if (cb->cnt > 0)
3232 cb->cnt--;
3233 return 0;
3236 static int read_ref_at_ent_oldest(unsigned char *osha1, unsigned char *nsha1,
3237 const char *email, unsigned long timestamp,
3238 int tz, const char *message, void *cb_data)
3240 struct read_ref_at_cb *cb = cb_data;
3242 if (cb->msg)
3243 *cb->msg = xstrdup(message);
3244 if (cb->cutoff_time)
3245 *cb->cutoff_time = timestamp;
3246 if (cb->cutoff_tz)
3247 *cb->cutoff_tz = tz;
3248 if (cb->cutoff_cnt)
3249 *cb->cutoff_cnt = cb->reccnt;
3250 hashcpy(cb->sha1, osha1);
3251 if (is_null_sha1(cb->sha1))
3252 hashcpy(cb->sha1, nsha1);
3253 /* We just want the first entry */
3254 return 1;
3257 int read_ref_at(const char *refname, unsigned int flags, unsigned long at_time, int cnt,
3258 unsigned char *sha1, char **msg,
3259 unsigned long *cutoff_time, int *cutoff_tz, int *cutoff_cnt)
3261 struct read_ref_at_cb cb;
3263 memset(&cb, 0, sizeof(cb));
3264 cb.refname = refname;
3265 cb.at_time = at_time;
3266 cb.cnt = cnt;
3267 cb.msg = msg;
3268 cb.cutoff_time = cutoff_time;
3269 cb.cutoff_tz = cutoff_tz;
3270 cb.cutoff_cnt = cutoff_cnt;
3271 cb.sha1 = sha1;
3273 for_each_reflog_ent_reverse(refname, read_ref_at_ent, &cb);
3275 if (!cb.reccnt) {
3276 if (flags & GET_SHA1_QUIETLY)
3277 exit(128);
3278 else
3279 die("Log for %s is empty.", refname);
3281 if (cb.found_it)
3282 return 0;
3284 for_each_reflog_ent(refname, read_ref_at_ent_oldest, &cb);
3286 return 1;
3289 int reflog_exists(const char *refname)
3291 struct stat st;
3293 return !lstat(git_path("logs/%s", refname), &st) &&
3294 S_ISREG(st.st_mode);
3297 int delete_reflog(const char *refname)
3299 return remove_path(git_path("logs/%s", refname));
3302 static int show_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn, void *cb_data)
3304 unsigned char osha1[20], nsha1[20];
3305 char *email_end, *message;
3306 unsigned long timestamp;
3307 int tz;
3309 /* old SP new SP name <email> SP time TAB msg LF */
3310 if (sb->len < 83 || sb->buf[sb->len - 1] != '\n' ||
3311 get_sha1_hex(sb->buf, osha1) || sb->buf[40] != ' ' ||
3312 get_sha1_hex(sb->buf + 41, nsha1) || sb->buf[81] != ' ' ||
3313 !(email_end = strchr(sb->buf + 82, '>')) ||
3314 email_end[1] != ' ' ||
3315 !(timestamp = strtoul(email_end + 2, &message, 10)) ||
3316 !message || message[0] != ' ' ||
3317 (message[1] != '+' && message[1] != '-') ||
3318 !isdigit(message[2]) || !isdigit(message[3]) ||
3319 !isdigit(message[4]) || !isdigit(message[5]))
3320 return 0; /* corrupt? */
3321 email_end[1] = '\0';
3322 tz = strtol(message + 1, NULL, 10);
3323 if (message[6] != '\t')
3324 message += 6;
3325 else
3326 message += 7;
3327 return fn(osha1, nsha1, sb->buf + 82, timestamp, tz, message, cb_data);
3330 static char *find_beginning_of_line(char *bob, char *scan)
3332 while (bob < scan && *(--scan) != '\n')
3333 ; /* keep scanning backwards */
3335 * Return either beginning of the buffer, or LF at the end of
3336 * the previous line.
3338 return scan;
3341 int for_each_reflog_ent_reverse(const char *refname, each_reflog_ent_fn fn, void *cb_data)
3343 struct strbuf sb = STRBUF_INIT;
3344 FILE *logfp;
3345 long pos;
3346 int ret = 0, at_tail = 1;
3348 logfp = fopen(git_path("logs/%s", refname), "r");
3349 if (!logfp)
3350 return -1;
3352 /* Jump to the end */
3353 if (fseek(logfp, 0, SEEK_END) < 0)
3354 return error("cannot seek back reflog for %s: %s",
3355 refname, strerror(errno));
3356 pos = ftell(logfp);
3357 while (!ret && 0 < pos) {
3358 int cnt;
3359 size_t nread;
3360 char buf[BUFSIZ];
3361 char *endp, *scanp;
3363 /* Fill next block from the end */
3364 cnt = (sizeof(buf) < pos) ? sizeof(buf) : pos;
3365 if (fseek(logfp, pos - cnt, SEEK_SET))
3366 return error("cannot seek back reflog for %s: %s",
3367 refname, strerror(errno));
3368 nread = fread(buf, cnt, 1, logfp);
3369 if (nread != 1)
3370 return error("cannot read %d bytes from reflog for %s: %s",
3371 cnt, refname, strerror(errno));
3372 pos -= cnt;
3374 scanp = endp = buf + cnt;
3375 if (at_tail && scanp[-1] == '\n')
3376 /* Looking at the final LF at the end of the file */
3377 scanp--;
3378 at_tail = 0;
3380 while (buf < scanp) {
3382 * terminating LF of the previous line, or the beginning
3383 * of the buffer.
3385 char *bp;
3387 bp = find_beginning_of_line(buf, scanp);
3389 if (*bp == '\n') {
3391 * The newline is the end of the previous line,
3392 * so we know we have complete line starting
3393 * at (bp + 1). Prefix it onto any prior data
3394 * we collected for the line and process it.
3396 strbuf_splice(&sb, 0, 0, bp + 1, endp - (bp + 1));
3397 scanp = bp;
3398 endp = bp + 1;
3399 ret = show_one_reflog_ent(&sb, fn, cb_data);
3400 strbuf_reset(&sb);
3401 if (ret)
3402 break;
3403 } else if (!pos) {
3405 * We are at the start of the buffer, and the
3406 * start of the file; there is no previous
3407 * line, and we have everything for this one.
3408 * Process it, and we can end the loop.
3410 strbuf_splice(&sb, 0, 0, buf, endp - buf);
3411 ret = show_one_reflog_ent(&sb, fn, cb_data);
3412 strbuf_reset(&sb);
3413 break;
3416 if (bp == buf) {
3418 * We are at the start of the buffer, and there
3419 * is more file to read backwards. Which means
3420 * we are in the middle of a line. Note that we
3421 * may get here even if *bp was a newline; that
3422 * just means we are at the exact end of the
3423 * previous line, rather than some spot in the
3424 * middle.
3426 * Save away what we have to be combined with
3427 * the data from the next read.
3429 strbuf_splice(&sb, 0, 0, buf, endp - buf);
3430 break;
3435 if (!ret && sb.len)
3436 die("BUG: reverse reflog parser had leftover data");
3438 fclose(logfp);
3439 strbuf_release(&sb);
3440 return ret;
3443 int for_each_reflog_ent(const char *refname, each_reflog_ent_fn fn, void *cb_data)
3445 FILE *logfp;
3446 struct strbuf sb = STRBUF_INIT;
3447 int ret = 0;
3449 logfp = fopen(git_path("logs/%s", refname), "r");
3450 if (!logfp)
3451 return -1;
3453 while (!ret && !strbuf_getwholeline(&sb, logfp, '\n'))
3454 ret = show_one_reflog_ent(&sb, fn, cb_data);
3455 fclose(logfp);
3456 strbuf_release(&sb);
3457 return ret;
3460 * Call fn for each reflog in the namespace indicated by name. name
3461 * must be empty or end with '/'. Name will be used as a scratch
3462 * space, but its contents will be restored before return.
3464 static int do_for_each_reflog(struct strbuf *name, each_ref_fn fn, void *cb_data)
3466 DIR *d = opendir(git_path("logs/%s", name->buf));
3467 int retval = 0;
3468 struct dirent *de;
3469 int oldlen = name->len;
3471 if (!d)
3472 return name->len ? errno : 0;
3474 while ((de = readdir(d)) != NULL) {
3475 struct stat st;
3477 if (de->d_name[0] == '.')
3478 continue;
3479 if (ends_with(de->d_name, ".lock"))
3480 continue;
3481 strbuf_addstr(name, de->d_name);
3482 if (stat(git_path("logs/%s", name->buf), &st) < 0) {
3483 ; /* silently ignore */
3484 } else {
3485 if (S_ISDIR(st.st_mode)) {
3486 strbuf_addch(name, '/');
3487 retval = do_for_each_reflog(name, fn, cb_data);
3488 } else {
3489 unsigned char sha1[20];
3490 if (read_ref_full(name->buf, 0, sha1, NULL))
3491 retval = error("bad ref for %s", name->buf);
3492 else
3493 retval = fn(name->buf, sha1, 0, cb_data);
3495 if (retval)
3496 break;
3498 strbuf_setlen(name, oldlen);
3500 closedir(d);
3501 return retval;
3504 int for_each_reflog(each_ref_fn fn, void *cb_data)
3506 int retval;
3507 struct strbuf name;
3508 strbuf_init(&name, PATH_MAX);
3509 retval = do_for_each_reflog(&name, fn, cb_data);
3510 strbuf_release(&name);
3511 return retval;
3515 * Information needed for a single ref update. Set new_sha1 to the new
3516 * value or to null_sha1 to delete the ref. To check the old value
3517 * while the ref is locked, set (flags & REF_HAVE_OLD) and set
3518 * old_sha1 to the old value, or to null_sha1 to ensure the ref does
3519 * not exist before update.
3521 struct ref_update {
3523 * If (flags & REF_HAVE_NEW), set the reference to this value:
3525 unsigned char new_sha1[20];
3527 * If (flags & REF_HAVE_OLD), check that the reference
3528 * previously had this value:
3530 unsigned char old_sha1[20];
3532 * One or more of REF_HAVE_NEW, REF_HAVE_OLD, REF_NODEREF,
3533 * REF_DELETING, and REF_ISPRUNING:
3535 unsigned int flags;
3536 struct ref_lock *lock;
3537 int type;
3538 char *msg;
3539 const char refname[FLEX_ARRAY];
3543 * Transaction states.
3544 * OPEN: The transaction is in a valid state and can accept new updates.
3545 * An OPEN transaction can be committed.
3546 * CLOSED: A closed transaction is no longer active and no other operations
3547 * than free can be used on it in this state.
3548 * A transaction can either become closed by successfully committing
3549 * an active transaction or if there is a failure while building
3550 * the transaction thus rendering it failed/inactive.
3552 enum ref_transaction_state {
3553 REF_TRANSACTION_OPEN = 0,
3554 REF_TRANSACTION_CLOSED = 1
3558 * Data structure for holding a reference transaction, which can
3559 * consist of checks and updates to multiple references, carried out
3560 * as atomically as possible. This structure is opaque to callers.
3562 struct ref_transaction {
3563 struct ref_update **updates;
3564 size_t alloc;
3565 size_t nr;
3566 enum ref_transaction_state state;
3569 struct ref_transaction *ref_transaction_begin(struct strbuf *err)
3571 assert(err);
3573 return xcalloc(1, sizeof(struct ref_transaction));
3576 void ref_transaction_free(struct ref_transaction *transaction)
3578 int i;
3580 if (!transaction)
3581 return;
3583 for (i = 0; i < transaction->nr; i++) {
3584 free(transaction->updates[i]->msg);
3585 free(transaction->updates[i]);
3587 free(transaction->updates);
3588 free(transaction);
3591 static struct ref_update *add_update(struct ref_transaction *transaction,
3592 const char *refname)
3594 size_t len = strlen(refname);
3595 struct ref_update *update = xcalloc(1, sizeof(*update) + len + 1);
3597 strcpy((char *)update->refname, refname);
3598 ALLOC_GROW(transaction->updates, transaction->nr + 1, transaction->alloc);
3599 transaction->updates[transaction->nr++] = update;
3600 return update;
3603 int ref_transaction_update(struct ref_transaction *transaction,
3604 const char *refname,
3605 const unsigned char *new_sha1,
3606 const unsigned char *old_sha1,
3607 unsigned int flags, const char *msg,
3608 struct strbuf *err)
3610 struct ref_update *update;
3612 assert(err);
3614 if (transaction->state != REF_TRANSACTION_OPEN)
3615 die("BUG: update called for transaction that is not open");
3617 if (new_sha1 && !is_null_sha1(new_sha1) &&
3618 check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {
3619 strbuf_addf(err, "refusing to update ref with bad name %s",
3620 refname);
3621 return -1;
3624 update = add_update(transaction, refname);
3625 if (new_sha1) {
3626 hashcpy(update->new_sha1, new_sha1);
3627 flags |= REF_HAVE_NEW;
3629 if (old_sha1) {
3630 hashcpy(update->old_sha1, old_sha1);
3631 flags |= REF_HAVE_OLD;
3633 update->flags = flags;
3634 if (msg)
3635 update->msg = xstrdup(msg);
3636 return 0;
3639 int ref_transaction_create(struct ref_transaction *transaction,
3640 const char *refname,
3641 const unsigned char *new_sha1,
3642 unsigned int flags, const char *msg,
3643 struct strbuf *err)
3645 if (!new_sha1 || is_null_sha1(new_sha1))
3646 die("BUG: create called without valid new_sha1");
3647 return ref_transaction_update(transaction, refname, new_sha1,
3648 null_sha1, flags, msg, err);
3651 int ref_transaction_delete(struct ref_transaction *transaction,
3652 const char *refname,
3653 const unsigned char *old_sha1,
3654 unsigned int flags, const char *msg,
3655 struct strbuf *err)
3657 if (old_sha1 && is_null_sha1(old_sha1))
3658 die("BUG: delete called with old_sha1 set to zeros");
3659 return ref_transaction_update(transaction, refname,
3660 null_sha1, old_sha1,
3661 flags, msg, err);
3664 int ref_transaction_verify(struct ref_transaction *transaction,
3665 const char *refname,
3666 const unsigned char *old_sha1,
3667 unsigned int flags,
3668 struct strbuf *err)
3670 if (!old_sha1)
3671 die("BUG: verify called with old_sha1 set to NULL");
3672 return ref_transaction_update(transaction, refname,
3673 NULL, old_sha1,
3674 flags, NULL, err);
3677 int update_ref(const char *msg, const char *refname,
3678 const unsigned char *new_sha1, const unsigned char *old_sha1,
3679 unsigned int flags, enum action_on_err onerr)
3681 struct ref_transaction *t;
3682 struct strbuf err = STRBUF_INIT;
3684 t = ref_transaction_begin(&err);
3685 if (!t ||
3686 ref_transaction_update(t, refname, new_sha1, old_sha1,
3687 flags, msg, &err) ||
3688 ref_transaction_commit(t, &err)) {
3689 const char *str = "update_ref failed for ref '%s': %s";
3691 ref_transaction_free(t);
3692 switch (onerr) {
3693 case UPDATE_REFS_MSG_ON_ERR:
3694 error(str, refname, err.buf);
3695 break;
3696 case UPDATE_REFS_DIE_ON_ERR:
3697 die(str, refname, err.buf);
3698 break;
3699 case UPDATE_REFS_QUIET_ON_ERR:
3700 break;
3702 strbuf_release(&err);
3703 return 1;
3705 strbuf_release(&err);
3706 ref_transaction_free(t);
3707 return 0;
3710 static int ref_update_compare(const void *r1, const void *r2)
3712 const struct ref_update * const *u1 = r1;
3713 const struct ref_update * const *u2 = r2;
3714 return strcmp((*u1)->refname, (*u2)->refname);
3717 static int ref_update_reject_duplicates(struct ref_update **updates, int n,
3718 struct strbuf *err)
3720 int i;
3722 assert(err);
3724 for (i = 1; i < n; i++)
3725 if (!strcmp(updates[i - 1]->refname, updates[i]->refname)) {
3726 strbuf_addf(err,
3727 "Multiple updates for ref '%s' not allowed.",
3728 updates[i]->refname);
3729 return 1;
3731 return 0;
3734 int ref_transaction_commit(struct ref_transaction *transaction,
3735 struct strbuf *err)
3737 int ret = 0, i;
3738 int n = transaction->nr;
3739 struct ref_update **updates = transaction->updates;
3740 struct string_list refs_to_delete = STRING_LIST_INIT_NODUP;
3741 struct string_list_item *ref_to_delete;
3743 assert(err);
3745 if (transaction->state != REF_TRANSACTION_OPEN)
3746 die("BUG: commit called for transaction that is not open");
3748 if (!n) {
3749 transaction->state = REF_TRANSACTION_CLOSED;
3750 return 0;
3753 /* Copy, sort, and reject duplicate refs */
3754 qsort(updates, n, sizeof(*updates), ref_update_compare);
3755 if (ref_update_reject_duplicates(updates, n, err)) {
3756 ret = TRANSACTION_GENERIC_ERROR;
3757 goto cleanup;
3760 /* Acquire all locks while verifying old values */
3761 for (i = 0; i < n; i++) {
3762 struct ref_update *update = updates[i];
3763 unsigned int flags = update->flags;
3765 if ((flags & REF_HAVE_NEW) && is_null_sha1(update->new_sha1))
3766 flags |= REF_DELETING;
3767 update->lock = lock_ref_sha1_basic(
3768 update->refname,
3769 ((update->flags & REF_HAVE_OLD) ?
3770 update->old_sha1 : NULL),
3771 NULL,
3772 flags,
3773 &update->type);
3774 if (!update->lock) {
3775 ret = (errno == ENOTDIR)
3776 ? TRANSACTION_NAME_CONFLICT
3777 : TRANSACTION_GENERIC_ERROR;
3778 strbuf_addf(err, "Cannot lock the ref '%s'.",
3779 update->refname);
3780 goto cleanup;
3784 /* Perform updates first so live commits remain referenced */
3785 for (i = 0; i < n; i++) {
3786 struct ref_update *update = updates[i];
3787 int flags = update->flags;
3789 if ((flags & REF_HAVE_NEW) && !is_null_sha1(update->new_sha1)) {
3790 int overwriting_symref = ((update->type & REF_ISSYMREF) &&
3791 (update->flags & REF_NODEREF));
3793 if (!overwriting_symref
3794 && !hashcmp(update->lock->old_sha1, update->new_sha1)) {
3796 * The reference already has the desired
3797 * value, so we don't need to write it.
3799 unlock_ref(update->lock);
3800 update->lock = NULL;
3801 } else if (write_ref_sha1(update->lock, update->new_sha1,
3802 update->msg)) {
3803 update->lock = NULL; /* freed by write_ref_sha1 */
3804 strbuf_addf(err, "Cannot update the ref '%s'.",
3805 update->refname);
3806 ret = TRANSACTION_GENERIC_ERROR;
3807 goto cleanup;
3808 } else {
3809 /* freed by write_ref_sha1(): */
3810 update->lock = NULL;
3815 /* Perform deletes now that updates are safely completed */
3816 for (i = 0; i < n; i++) {
3817 struct ref_update *update = updates[i];
3818 int flags = update->flags;
3820 if ((flags & REF_HAVE_NEW) && is_null_sha1(update->new_sha1)) {
3821 if (delete_ref_loose(update->lock, update->type, err)) {
3822 ret = TRANSACTION_GENERIC_ERROR;
3823 goto cleanup;
3826 if (!(flags & REF_ISPRUNING))
3827 string_list_append(&refs_to_delete,
3828 update->lock->ref_name);
3832 if (repack_without_refs(&refs_to_delete, err)) {
3833 ret = TRANSACTION_GENERIC_ERROR;
3834 goto cleanup;
3836 for_each_string_list_item(ref_to_delete, &refs_to_delete)
3837 unlink_or_warn(git_path("logs/%s", ref_to_delete->string));
3838 clear_loose_ref_cache(&ref_cache);
3840 cleanup:
3841 transaction->state = REF_TRANSACTION_CLOSED;
3843 for (i = 0; i < n; i++)
3844 if (updates[i]->lock)
3845 unlock_ref(updates[i]->lock);
3846 string_list_clear(&refs_to_delete, 0);
3847 return ret;
3850 char *shorten_unambiguous_ref(const char *refname, int strict)
3852 int i;
3853 static char **scanf_fmts;
3854 static int nr_rules;
3855 char *short_name;
3857 if (!nr_rules) {
3859 * Pre-generate scanf formats from ref_rev_parse_rules[].
3860 * Generate a format suitable for scanf from a
3861 * ref_rev_parse_rules rule by interpolating "%s" at the
3862 * location of the "%.*s".
3864 size_t total_len = 0;
3865 size_t offset = 0;
3867 /* the rule list is NULL terminated, count them first */
3868 for (nr_rules = 0; ref_rev_parse_rules[nr_rules]; nr_rules++)
3869 /* -2 for strlen("%.*s") - strlen("%s"); +1 for NUL */
3870 total_len += strlen(ref_rev_parse_rules[nr_rules]) - 2 + 1;
3872 scanf_fmts = xmalloc(nr_rules * sizeof(char *) + total_len);
3874 offset = 0;
3875 for (i = 0; i < nr_rules; i++) {
3876 assert(offset < total_len);
3877 scanf_fmts[i] = (char *)&scanf_fmts[nr_rules] + offset;
3878 offset += snprintf(scanf_fmts[i], total_len - offset,
3879 ref_rev_parse_rules[i], 2, "%s") + 1;
3883 /* bail out if there are no rules */
3884 if (!nr_rules)
3885 return xstrdup(refname);
3887 /* buffer for scanf result, at most refname must fit */
3888 short_name = xstrdup(refname);
3890 /* skip first rule, it will always match */
3891 for (i = nr_rules - 1; i > 0 ; --i) {
3892 int j;
3893 int rules_to_fail = i;
3894 int short_name_len;
3896 if (1 != sscanf(refname, scanf_fmts[i], short_name))
3897 continue;
3899 short_name_len = strlen(short_name);
3902 * in strict mode, all (except the matched one) rules
3903 * must fail to resolve to a valid non-ambiguous ref
3905 if (strict)
3906 rules_to_fail = nr_rules;
3909 * check if the short name resolves to a valid ref,
3910 * but use only rules prior to the matched one
3912 for (j = 0; j < rules_to_fail; j++) {
3913 const char *rule = ref_rev_parse_rules[j];
3914 char refname[PATH_MAX];
3916 /* skip matched rule */
3917 if (i == j)
3918 continue;
3921 * the short name is ambiguous, if it resolves
3922 * (with this previous rule) to a valid ref
3923 * read_ref() returns 0 on success
3925 mksnpath(refname, sizeof(refname),
3926 rule, short_name_len, short_name);
3927 if (ref_exists(refname))
3928 break;
3932 * short name is non-ambiguous if all previous rules
3933 * haven't resolved to a valid ref
3935 if (j == rules_to_fail)
3936 return short_name;
3939 free(short_name);
3940 return xstrdup(refname);
3943 static struct string_list *hide_refs;
3945 int parse_hide_refs_config(const char *var, const char *value, const char *section)
3947 if (!strcmp("transfer.hiderefs", var) ||
3948 /* NEEDSWORK: use parse_config_key() once both are merged */
3949 (starts_with(var, section) && var[strlen(section)] == '.' &&
3950 !strcmp(var + strlen(section), ".hiderefs"))) {
3951 char *ref;
3952 int len;
3954 if (!value)
3955 return config_error_nonbool(var);
3956 ref = xstrdup(value);
3957 len = strlen(ref);
3958 while (len && ref[len - 1] == '/')
3959 ref[--len] = '\0';
3960 if (!hide_refs) {
3961 hide_refs = xcalloc(1, sizeof(*hide_refs));
3962 hide_refs->strdup_strings = 1;
3964 string_list_append(hide_refs, ref);
3966 return 0;
3969 int ref_is_hidden(const char *refname)
3971 struct string_list_item *item;
3973 if (!hide_refs)
3974 return 0;
3975 for_each_string_list_item(item, hide_refs) {
3976 int len;
3977 if (!starts_with(refname, item->string))
3978 continue;
3979 len = strlen(item->string);
3980 if (!refname[len] || refname[len] == '/')
3981 return 1;
3983 return 0;
3986 struct expire_reflog_cb {
3987 unsigned int flags;
3988 reflog_expiry_should_prune_fn *should_prune_fn;
3989 void *policy_cb;
3990 FILE *newlog;
3991 unsigned char last_kept_sha1[20];
3994 static int expire_reflog_ent(unsigned char *osha1, unsigned char *nsha1,
3995 const char *email, unsigned long timestamp, int tz,
3996 const char *message, void *cb_data)
3998 struct expire_reflog_cb *cb = cb_data;
3999 struct expire_reflog_policy_cb *policy_cb = cb->policy_cb;
4001 if (cb->flags & EXPIRE_REFLOGS_REWRITE)
4002 osha1 = cb->last_kept_sha1;
4004 if ((*cb->should_prune_fn)(osha1, nsha1, email, timestamp, tz,
4005 message, policy_cb)) {
4006 if (!cb->newlog)
4007 printf("would prune %s", message);
4008 else if (cb->flags & EXPIRE_REFLOGS_VERBOSE)
4009 printf("prune %s", message);
4010 } else {
4011 if (cb->newlog) {
4012 fprintf(cb->newlog, "%s %s %s %lu %+05d\t%s",
4013 sha1_to_hex(osha1), sha1_to_hex(nsha1),
4014 email, timestamp, tz, message);
4015 hashcpy(cb->last_kept_sha1, nsha1);
4017 if (cb->flags & EXPIRE_REFLOGS_VERBOSE)
4018 printf("keep %s", message);
4020 return 0;
4023 int reflog_expire(const char *refname, const unsigned char *sha1,
4024 unsigned int flags,
4025 reflog_expiry_prepare_fn prepare_fn,
4026 reflog_expiry_should_prune_fn should_prune_fn,
4027 reflog_expiry_cleanup_fn cleanup_fn,
4028 void *policy_cb_data)
4030 static struct lock_file reflog_lock;
4031 struct expire_reflog_cb cb;
4032 struct ref_lock *lock;
4033 char *log_file;
4034 int status = 0;
4035 int type;
4037 memset(&cb, 0, sizeof(cb));
4038 cb.flags = flags;
4039 cb.policy_cb = policy_cb_data;
4040 cb.should_prune_fn = should_prune_fn;
4043 * The reflog file is locked by holding the lock on the
4044 * reference itself, plus we might need to update the
4045 * reference if --updateref was specified:
4047 lock = lock_ref_sha1_basic(refname, sha1, NULL, 0, &type);
4048 if (!lock)
4049 return error("cannot lock ref '%s'", refname);
4050 if (!reflog_exists(refname)) {
4051 unlock_ref(lock);
4052 return 0;
4055 log_file = git_pathdup("logs/%s", refname);
4056 if (!(flags & EXPIRE_REFLOGS_DRY_RUN)) {
4058 * Even though holding $GIT_DIR/logs/$reflog.lock has
4059 * no locking implications, we use the lock_file
4060 * machinery here anyway because it does a lot of the
4061 * work we need, including cleaning up if the program
4062 * exits unexpectedly.
4064 if (hold_lock_file_for_update(&reflog_lock, log_file, 0) < 0) {
4065 struct strbuf err = STRBUF_INIT;
4066 unable_to_lock_message(log_file, errno, &err);
4067 error("%s", err.buf);
4068 strbuf_release(&err);
4069 goto failure;
4071 cb.newlog = fdopen_lock_file(&reflog_lock, "w");
4072 if (!cb.newlog) {
4073 error("cannot fdopen %s (%s)",
4074 reflog_lock.filename.buf, strerror(errno));
4075 goto failure;
4079 (*prepare_fn)(refname, sha1, cb.policy_cb);
4080 for_each_reflog_ent(refname, expire_reflog_ent, &cb);
4081 (*cleanup_fn)(cb.policy_cb);
4083 if (!(flags & EXPIRE_REFLOGS_DRY_RUN)) {
4085 * It doesn't make sense to adjust a reference pointed
4086 * to by a symbolic ref based on expiring entries in
4087 * the symbolic reference's reflog. Nor can we update
4088 * a reference if there are no remaining reflog
4089 * entries.
4091 int update = (flags & EXPIRE_REFLOGS_UPDATE_REF) &&
4092 !(type & REF_ISSYMREF) &&
4093 !is_null_sha1(cb.last_kept_sha1);
4095 if (close_lock_file(&reflog_lock)) {
4096 status |= error("couldn't write %s: %s", log_file,
4097 strerror(errno));
4098 } else if (update &&
4099 (write_in_full(lock->lock_fd,
4100 sha1_to_hex(cb.last_kept_sha1), 40) != 40 ||
4101 write_str_in_full(lock->lock_fd, "\n") != 1 ||
4102 close_ref(lock) < 0)) {
4103 status |= error("couldn't write %s",
4104 lock->lk->filename.buf);
4105 rollback_lock_file(&reflog_lock);
4106 } else if (commit_lock_file(&reflog_lock)) {
4107 status |= error("unable to commit reflog '%s' (%s)",
4108 log_file, strerror(errno));
4109 } else if (update && commit_ref(lock)) {
4110 status |= error("couldn't set %s", lock->ref_name);
4113 free(log_file);
4114 unlock_ref(lock);
4115 return status;
4117 failure:
4118 rollback_lock_file(&reflog_lock);
4119 free(log_file);
4120 unlock_ref(lock);
4121 return -1;