refs: do not create ref_entry when searching
[git/git.git] / refs.c
CommitLineData
95fc7512 1#include "cache.h"
85023577 2#include "refs.h"
cf0adba7
JH
3#include "object.h"
4#include "tag.h"
7155b727 5#include "dir.h"
95fc7512 6
bc5fd6d3
MH
7/*
8 * Make sure "ref" is something reasonable to have under ".git/refs/";
9 * We do not like it if:
10 *
11 * - any path component of it begins with ".", or
12 * - it has double dots "..", or
13 * - it has ASCII control character, "~", "^", ":" or SP, anywhere, or
14 * - it ends with a "/".
15 * - it ends with ".lock"
16 * - it contains a "\" (backslash)
17 */
f4204ab9 18
bc5fd6d3
MH
19/* Return true iff ch is not allowed in reference names. */
20static inline int bad_ref_char(int ch)
21{
22 if (((unsigned) ch) <= ' ' || ch == 0x7f ||
23 ch == '~' || ch == '^' || ch == ':' || ch == '\\')
24 return 1;
25 /* 2.13 Pattern Matching Notation */
26 if (ch == '*' || ch == '?' || ch == '[') /* Unsupported */
27 return 1;
28 return 0;
29}
30
31/*
32 * Try to read one refname component from the front of refname. Return
33 * the length of the component found, or -1 if the component is not
34 * legal.
35 */
36static int check_refname_component(const char *refname, int flags)
37{
38 const char *cp;
39 char last = '\0';
40
41 for (cp = refname; ; cp++) {
42 char ch = *cp;
43 if (ch == '\0' || ch == '/')
44 break;
45 if (bad_ref_char(ch))
46 return -1; /* Illegal character in refname. */
47 if (last == '.' && ch == '.')
48 return -1; /* Refname contains "..". */
49 if (last == '@' && ch == '{')
50 return -1; /* Refname contains "@{". */
51 last = ch;
52 }
53 if (cp == refname)
dac529e4 54 return 0; /* Component has zero length. */
bc5fd6d3
MH
55 if (refname[0] == '.') {
56 if (!(flags & REFNAME_DOT_COMPONENT))
57 return -1; /* Component starts with '.'. */
58 /*
59 * Even if leading dots are allowed, don't allow "."
60 * as a component (".." is prevented by a rule above).
61 */
62 if (refname[1] == '\0')
63 return -1; /* Component equals ".". */
64 }
65 if (cp - refname >= 5 && !memcmp(cp - 5, ".lock", 5))
66 return -1; /* Refname ends with ".lock". */
67 return cp - refname;
68}
69
70int check_refname_format(const char *refname, int flags)
71{
72 int component_len, component_count = 0;
73
74 while (1) {
75 /* We are at the start of a path component. */
76 component_len = check_refname_component(refname, flags);
dac529e4 77 if (component_len <= 0) {
bc5fd6d3
MH
78 if ((flags & REFNAME_REFSPEC_PATTERN) &&
79 refname[0] == '*' &&
80 (refname[1] == '\0' || refname[1] == '/')) {
81 /* Accept one wildcard as a full refname component. */
82 flags &= ~REFNAME_REFSPEC_PATTERN;
83 component_len = 1;
84 } else {
85 return -1;
86 }
87 }
88 component_count++;
89 if (refname[component_len] == '\0')
90 break;
91 /* Skip to next component. */
92 refname += component_len + 1;
93 }
94
95 if (refname[component_len - 1] == '.')
96 return -1; /* Refname ends with '.'. */
97 if (!(flags & REFNAME_ALLOW_ONELEVEL) && component_count < 2)
98 return -1; /* Refname has only one component. */
99 return 0;
100}
101
102struct ref_entry;
e1e22e37 103
28e6a34e
MH
104/*
105 * Information used (along with the information in ref_entry) to
106 * describe a single cached reference. This data structure only
107 * occurs embedded in a union in struct ref_entry, and only when
108 * (ref_entry->flag & REF_DIR) is zero.
109 */
593f1bb8
MH
110struct ref_value {
111 unsigned char sha1[20];
112 unsigned char peeled[20];
113};
114
f006c42a
MH
115struct ref_cache;
116
28e6a34e
MH
117/*
118 * Information used (along with the information in ref_entry) to
119 * describe a level in the hierarchy of references. This data
120 * structure only occurs embedded in a union in struct ref_entry, and
121 * only when (ref_entry.flag & REF_DIR) is set. In that case,
122 * (ref_entry.flag & REF_INCOMPLETE) determines whether the references
123 * in the directory have already been read:
124 *
125 * (ref_entry.flag & REF_INCOMPLETE) unset -- a directory of loose
126 * or packed references, already read.
127 *
128 * (ref_entry.flag & REF_INCOMPLETE) set -- a directory of loose
129 * references that hasn't been read yet (nor has any of its
130 * subdirectories).
131 *
132 * Entries within a directory are stored within a growable array of
133 * pointers to ref_entries (entries, nr, alloc). Entries 0 <= i <
134 * sorted are sorted by their component name in strcmp() order and the
135 * remaining entries are unsorted.
136 *
137 * Loose references are read lazily, one directory at a time. When a
138 * directory of loose references is read, then all of the references
139 * in that directory are stored, and REF_INCOMPLETE stubs are created
140 * for any subdirectories, but the subdirectories themselves are not
141 * read. The reading is triggered by get_ref_dir().
142 */
d3177275 143struct ref_dir {
e9c4c111 144 int nr, alloc;
e6ed3ca6
MH
145
146 /*
147 * Entries with index 0 <= i < sorted are sorted by name. New
148 * entries are appended to the list unsorted, and are sorted
149 * only when required; thus we avoid the need to sort the list
150 * after the addition of every reference.
151 */
152 int sorted;
153
f006c42a
MH
154 /* A pointer to the ref_cache that contains this ref_dir. */
155 struct ref_cache *ref_cache;
156
d3177275 157 struct ref_entry **entries;
e9c4c111
JP
158};
159
432ad41e
MH
160/* ISSYMREF=0x01, ISPACKED=0x02, and ISBROKEN=0x04 are public interfaces */
161#define REF_KNOWS_PEELED 0x08
28e6a34e
MH
162
163/* ref_entry represents a directory of references */
432ad41e 164#define REF_DIR 0x10
cf0adba7 165
28e6a34e
MH
166/*
167 * Entry has not yet been read from disk (used only for REF_DIR
168 * entries representing loose references)
169 */
170#define REF_INCOMPLETE 0x20
171
432ad41e
MH
172/*
173 * A ref_entry represents either a reference or a "subdirectory" of
28e6a34e
MH
174 * references.
175 *
176 * Each directory in the reference namespace is represented by a
177 * ref_entry with (flags & REF_DIR) set and containing a subdir member
178 * that holds the entries in that directory that have been read so
179 * far. If (flags & REF_INCOMPLETE) is set, then the directory and
180 * its subdirectories haven't been read yet. REF_INCOMPLETE is only
181 * used for loose reference directories.
182 *
183 * References are represented by a ref_entry with (flags & REF_DIR)
184 * unset and a value member that describes the reference's value. The
185 * flag member is at the ref_entry level, but it is also needed to
186 * interpret the contents of the value field (in other words, a
187 * ref_value object is not very much use without the enclosing
188 * ref_entry).
432ad41e
MH
189 *
190 * Reference names cannot end with slash and directories' names are
191 * always stored with a trailing slash (except for the top-level
192 * directory, which is always denoted by ""). This has two nice
193 * consequences: (1) when the entries in each subdir are sorted
194 * lexicographically by name (as they usually are), the references in
195 * a whole tree can be generated in lexicographic order by traversing
196 * the tree in left-to-right, depth-first order; (2) the names of
197 * references and subdirectories cannot conflict, and therefore the
198 * presence of an empty subdirectory does not block the creation of a
199 * similarly-named reference. (The fact that reference names with the
200 * same leading components can conflict *with each other* is a
201 * separate issue that is regulated by is_refname_available().)
202 *
203 * Please note that the name field contains the fully-qualified
204 * reference (or subdirectory) name. Space could be saved by only
205 * storing the relative names. But that would require the full names
206 * to be generated on the fly when iterating in do_for_each_ref(), and
207 * would break callback functions, who have always been able to assume
208 * that the name strings that they are passed will not be freed during
209 * the iteration.
210 */
bc5fd6d3
MH
211struct ref_entry {
212 unsigned char flag; /* ISSYMREF? ISPACKED? */
593f1bb8 213 union {
432ad41e
MH
214 struct ref_value value; /* if not (flags&REF_DIR) */
215 struct ref_dir subdir; /* if (flags&REF_DIR) */
593f1bb8 216 } u;
432ad41e
MH
217 /*
218 * The full name of the reference (e.g., "refs/heads/master")
219 * or the full name of the directory with a trailing slash
220 * (e.g., "refs/heads/"):
221 */
bc5fd6d3
MH
222 char name[FLEX_ARRAY];
223};
e1e22e37 224
28e6a34e
MH
225static void read_loose_refs(const char *dirname, struct ref_dir *dir);
226
d7826d54
MH
227static struct ref_dir *get_ref_dir(struct ref_entry *entry)
228{
28e6a34e 229 struct ref_dir *dir;
d7826d54 230 assert(entry->flag & REF_DIR);
28e6a34e
MH
231 dir = &entry->u.subdir;
232 if (entry->flag & REF_INCOMPLETE) {
233 read_loose_refs(entry->name, dir);
234 entry->flag &= ~REF_INCOMPLETE;
235 }
236 return dir;
d7826d54
MH
237}
238
cddc4258
MH
239static struct ref_entry *create_ref_entry(const char *refname,
240 const unsigned char *sha1, int flag,
241 int check_name)
e1e22e37
LT
242{
243 int len;
cddc4258 244 struct ref_entry *ref;
e1e22e37 245
09116a1c 246 if (check_name &&
dfefa935
MH
247 check_refname_format(refname, REFNAME_ALLOW_ONELEVEL|REFNAME_DOT_COMPONENT))
248 die("Reference has invalid format: '%s'", refname);
cddc4258
MH
249 len = strlen(refname) + 1;
250 ref = xmalloc(sizeof(struct ref_entry) + len);
593f1bb8
MH
251 hashcpy(ref->u.value.sha1, sha1);
252 hashclr(ref->u.value.peeled);
cddc4258
MH
253 memcpy(ref->name, refname, len);
254 ref->flag = flag;
255 return ref;
256}
257
432ad41e
MH
258static void clear_ref_dir(struct ref_dir *dir);
259
732134ed
MH
260static void free_ref_entry(struct ref_entry *entry)
261{
432ad41e 262 if (entry->flag & REF_DIR)
d7826d54 263 clear_ref_dir(get_ref_dir(entry));
732134ed
MH
264 free(entry);
265}
266
432ad41e
MH
267/*
268 * Add a ref_entry to the end of dir (unsorted). Entry is always
269 * stored directly in dir; no recursion into subdirectories is
270 * done.
271 */
272static void add_entry_to_dir(struct ref_dir *dir, struct ref_entry *entry)
cddc4258 273{
432ad41e
MH
274 ALLOC_GROW(dir->entries, dir->nr + 1, dir->alloc);
275 dir->entries[dir->nr++] = entry;
c774aab9
JP
276}
277
432ad41e
MH
278/*
279 * Clear and free all entries in dir, recursively.
280 */
d3177275 281static void clear_ref_dir(struct ref_dir *dir)
bc5fd6d3
MH
282{
283 int i;
d3177275
MH
284 for (i = 0; i < dir->nr; i++)
285 free_ref_entry(dir->entries[i]);
286 free(dir->entries);
287 dir->sorted = dir->nr = dir->alloc = 0;
288 dir->entries = NULL;
bc5fd6d3
MH
289}
290
432ad41e
MH
291/*
292 * Create a struct ref_entry object for the specified dirname.
293 * dirname is the name of the directory with a trailing slash (e.g.,
294 * "refs/heads/") or "" for the top-level directory.
295 */
f006c42a 296static struct ref_entry *create_dir_entry(struct ref_cache *ref_cache,
b9146f51
RS
297 const char *dirname, size_t len,
298 int incomplete)
432ad41e
MH
299{
300 struct ref_entry *direntry;
432ad41e 301 direntry = xcalloc(1, sizeof(struct ref_entry) + len + 1);
b9146f51
RS
302 memcpy(direntry->name, dirname, len);
303 direntry->name[len] = '\0';
f006c42a 304 direntry->u.subdir.ref_cache = ref_cache;
28e6a34e 305 direntry->flag = REF_DIR | (incomplete ? REF_INCOMPLETE : 0);
432ad41e
MH
306 return direntry;
307}
308
e9c4c111 309static int ref_entry_cmp(const void *a, const void *b)
c774aab9 310{
e9c4c111
JP
311 struct ref_entry *one = *(struct ref_entry **)a;
312 struct ref_entry *two = *(struct ref_entry **)b;
313 return strcmp(one->name, two->name);
314}
c774aab9 315
d3177275 316static void sort_ref_dir(struct ref_dir *dir);
bc5fd6d3 317
e1980c9d
JH
318struct string_slice {
319 size_t len;
320 const char *str;
321};
322
323static int ref_entry_cmp_sslice(const void *key_, const void *ent_)
324{
325 struct string_slice *key = (struct string_slice *)key_;
326 struct ref_entry *ent = *(struct ref_entry **)ent_;
327 int entlen = strlen(ent->name);
328 int cmplen = key->len < entlen ? key->len : entlen;
329 int cmp = memcmp(key->str, ent->name, cmplen);
330 if (cmp)
331 return cmp;
332 return key->len - entlen;
333}
334
432ad41e
MH
335/*
336 * Return the entry with the given refname from the ref_dir
337 * (non-recursively), sorting dir if necessary. Return NULL if no
28e6a34e 338 * such entry is found. dir must already be complete.
432ad41e 339 */
40ad937d
RS
340static struct ref_entry *search_ref_dir(struct ref_dir *dir,
341 const char *refname, size_t len)
bc5fd6d3 342{
e1980c9d
JH
343 struct ref_entry **r;
344 struct string_slice key;
bc5fd6d3 345
432ad41e 346 if (refname == NULL || !dir->nr)
bc5fd6d3
MH
347 return NULL;
348
d3177275 349 sort_ref_dir(dir);
e1980c9d
JH
350 key.len = len;
351 key.str = refname;
352 r = bsearch(&key, dir->entries, dir->nr, sizeof(*dir->entries),
353 ref_entry_cmp_sslice);
bc5fd6d3
MH
354
355 if (r == NULL)
356 return NULL;
357
358 return *r;
359}
360
f348ac92
MH
361/*
362 * Search for a directory entry directly within dir (without
363 * recursing). Sort dir if necessary. subdirname must be a directory
364 * name (i.e., end in '/'). If mkdir is set, then create the
365 * directory if it is missing; otherwise, return NULL if the desired
28e6a34e 366 * directory cannot be found. dir must already be complete.
f348ac92 367 */
3f3aa1bc 368static struct ref_dir *search_for_subdir(struct ref_dir *dir,
dd02e728
RS
369 const char *subdirname, size_t len,
370 int mkdir)
f348ac92 371{
40ad937d 372 struct ref_entry *entry = search_ref_dir(dir, subdirname, len);
f348ac92
MH
373 if (!entry) {
374 if (!mkdir)
375 return NULL;
28e6a34e
MH
376 /*
377 * Since dir is complete, the absence of a subdir
378 * means that the subdir really doesn't exist;
379 * therefore, create an empty record for it but mark
380 * the record complete.
381 */
b9146f51 382 entry = create_dir_entry(dir->ref_cache, subdirname, len, 0);
f348ac92
MH
383 add_entry_to_dir(dir, entry);
384 }
3f3aa1bc 385 return get_ref_dir(entry);
f348ac92
MH
386}
387
432ad41e
MH
388/*
389 * If refname is a reference name, find the ref_dir within the dir
390 * tree that should hold refname. If refname is a directory name
391 * (i.e., ends in '/'), then return that ref_dir itself. dir must
28e6a34e
MH
392 * represent the top-level directory and must already be complete.
393 * Sort ref_dirs and recurse into subdirectories as necessary. If
394 * mkdir is set, then create any missing directories; otherwise,
395 * return NULL if the desired directory cannot be found.
432ad41e
MH
396 */
397static struct ref_dir *find_containing_dir(struct ref_dir *dir,
398 const char *refname, int mkdir)
399{
5fa04418 400 const char *slash;
5fa04418 401 for (slash = strchr(refname, '/'); slash; slash = strchr(slash + 1, '/')) {
dd02e728 402 size_t dirnamelen = slash - refname + 1;
3f3aa1bc 403 struct ref_dir *subdir;
dd02e728 404 subdir = search_for_subdir(dir, refname, dirnamelen, mkdir);
663c1295
JH
405 if (!subdir) {
406 dir = NULL;
f348ac92 407 break;
432ad41e 408 }
3f3aa1bc 409 dir = subdir;
432ad41e
MH
410 }
411
432ad41e
MH
412 return dir;
413}
414
415/*
416 * Find the value entry with the given name in dir, sorting ref_dirs
417 * and recursing into subdirectories as necessary. If the name is not
418 * found or it corresponds to a directory entry, return NULL.
419 */
420static struct ref_entry *find_ref(struct ref_dir *dir, const char *refname)
421{
422 struct ref_entry *entry;
423 dir = find_containing_dir(dir, refname, 0);
424 if (!dir)
425 return NULL;
40ad937d 426 entry = search_ref_dir(dir, refname, strlen(refname));
432ad41e
MH
427 return (entry && !(entry->flag & REF_DIR)) ? entry : NULL;
428}
429
430/*
431 * Add a ref_entry to the ref_dir (unsorted), recursing into
432 * subdirectories as necessary. dir must represent the top-level
433 * directory. Return 0 on success.
434 */
435static int add_ref(struct ref_dir *dir, struct ref_entry *ref)
436{
437 dir = find_containing_dir(dir, ref->name, 1);
438 if (!dir)
439 return -1;
440 add_entry_to_dir(dir, ref);
441 return 0;
442}
443
202a56a9
MH
444/*
445 * Emit a warning and return true iff ref1 and ref2 have the same name
446 * and the same sha1. Die if they have the same name but different
447 * sha1s.
448 */
449static int is_dup_ref(const struct ref_entry *ref1, const struct ref_entry *ref2)
450{
432ad41e 451 if (strcmp(ref1->name, ref2->name))
202a56a9 452 return 0;
432ad41e
MH
453
454 /* Duplicate name; make sure that they don't conflict: */
455
456 if ((ref1->flag & REF_DIR) || (ref2->flag & REF_DIR))
457 /* This is impossible by construction */
458 die("Reference directory conflict: %s", ref1->name);
459
460 if (hashcmp(ref1->u.value.sha1, ref2->u.value.sha1))
461 die("Duplicated ref, and SHA1s don't match: %s", ref1->name);
462
463 warning("Duplicated ref: %s", ref1->name);
464 return 1;
202a56a9
MH
465}
466
e6ed3ca6 467/*
432ad41e
MH
468 * Sort the entries in dir non-recursively (if they are not already
469 * sorted) and remove any duplicate entries.
e6ed3ca6 470 */
d3177275 471static void sort_ref_dir(struct ref_dir *dir)
e9c4c111 472{
202a56a9 473 int i, j;
81a79d8e 474 struct ref_entry *last = NULL;
c774aab9 475
e6ed3ca6
MH
476 /*
477 * This check also prevents passing a zero-length array to qsort(),
478 * which is a problem on some platforms.
479 */
d3177275 480 if (dir->sorted == dir->nr)
e9c4c111 481 return;
c774aab9 482
d3177275 483 qsort(dir->entries, dir->nr, sizeof(*dir->entries), ref_entry_cmp);
c774aab9 484
81a79d8e
MH
485 /* Remove any duplicates: */
486 for (i = 0, j = 0; j < dir->nr; j++) {
487 struct ref_entry *entry = dir->entries[j];
488 if (last && is_dup_ref(last, entry))
489 free_ref_entry(entry);
490 else
491 last = dir->entries[i++] = entry;
e9c4c111 492 }
81a79d8e 493 dir->sorted = dir->nr = i;
e9c4c111 494}
c774aab9 495
bc5fd6d3 496#define DO_FOR_EACH_INCLUDE_BROKEN 01
c774aab9 497
bc5fd6d3 498static struct ref_entry *current_ref;
c774aab9 499
bc5fd6d3
MH
500static int do_one_ref(const char *base, each_ref_fn fn, int trim,
501 int flags, void *cb_data, struct ref_entry *entry)
502{
429213e4 503 int retval;
bc5fd6d3
MH
504 if (prefixcmp(entry->name, base))
505 return 0;
c774aab9 506
bc5fd6d3
MH
507 if (!(flags & DO_FOR_EACH_INCLUDE_BROKEN)) {
508 if (entry->flag & REF_ISBROKEN)
509 return 0; /* ignore broken refs e.g. dangling symref */
593f1bb8 510 if (!has_sha1_file(entry->u.value.sha1)) {
bc5fd6d3
MH
511 error("%s does not point to a valid object!", entry->name);
512 return 0;
513 }
514 }
515 current_ref = entry;
593f1bb8 516 retval = fn(entry->name + trim, entry->u.value.sha1, entry->flag, cb_data);
429213e4
MH
517 current_ref = NULL;
518 return retval;
bc5fd6d3 519}
c774aab9 520
c36b5bc2 521/*
d3177275 522 * Call fn for each reference in dir that has index in the range
432ad41e
MH
523 * offset <= index < dir->nr. Recurse into subdirectories that are in
524 * that index range, sorting them before iterating. This function
525 * does not sort dir itself; it should be sorted beforehand.
c36b5bc2 526 */
d3177275
MH
527static int do_for_each_ref_in_dir(struct ref_dir *dir, int offset,
528 const char *base,
529 each_ref_fn fn, int trim, int flags, void *cb_data)
c36b5bc2
MH
530{
531 int i;
d3177275
MH
532 assert(dir->sorted == dir->nr);
533 for (i = offset; i < dir->nr; i++) {
432ad41e
MH
534 struct ref_entry *entry = dir->entries[i];
535 int retval;
536 if (entry->flag & REF_DIR) {
d7826d54
MH
537 struct ref_dir *subdir = get_ref_dir(entry);
538 sort_ref_dir(subdir);
539 retval = do_for_each_ref_in_dir(subdir, 0,
432ad41e
MH
540 base, fn, trim, flags, cb_data);
541 } else {
542 retval = do_one_ref(base, fn, trim, flags, cb_data, entry);
543 }
c36b5bc2
MH
544 if (retval)
545 return retval;
546 }
547 return 0;
548}
549
b3fd060f 550/*
d3177275 551 * Call fn for each reference in the union of dir1 and dir2, in order
432ad41e
MH
552 * by refname. Recurse into subdirectories. If a value entry appears
553 * in both dir1 and dir2, then only process the version that is in
554 * dir2. The input dirs must already be sorted, but subdirs will be
555 * sorted as needed.
b3fd060f 556 */
d3177275
MH
557static int do_for_each_ref_in_dirs(struct ref_dir *dir1,
558 struct ref_dir *dir2,
559 const char *base, each_ref_fn fn, int trim,
560 int flags, void *cb_data)
b3fd060f
MH
561{
562 int retval;
563 int i1 = 0, i2 = 0;
564
d3177275
MH
565 assert(dir1->sorted == dir1->nr);
566 assert(dir2->sorted == dir2->nr);
432ad41e
MH
567 while (1) {
568 struct ref_entry *e1, *e2;
569 int cmp;
570 if (i1 == dir1->nr) {
571 return do_for_each_ref_in_dir(dir2, i2,
572 base, fn, trim, flags, cb_data);
573 }
574 if (i2 == dir2->nr) {
575 return do_for_each_ref_in_dir(dir1, i1,
576 base, fn, trim, flags, cb_data);
577 }
578 e1 = dir1->entries[i1];
579 e2 = dir2->entries[i2];
580 cmp = strcmp(e1->name, e2->name);
581 if (cmp == 0) {
582 if ((e1->flag & REF_DIR) && (e2->flag & REF_DIR)) {
583 /* Both are directories; descend them in parallel. */
d7826d54
MH
584 struct ref_dir *subdir1 = get_ref_dir(e1);
585 struct ref_dir *subdir2 = get_ref_dir(e2);
586 sort_ref_dir(subdir1);
587 sort_ref_dir(subdir2);
432ad41e 588 retval = do_for_each_ref_in_dirs(
d7826d54 589 subdir1, subdir2,
432ad41e
MH
590 base, fn, trim, flags, cb_data);
591 i1++;
592 i2++;
593 } else if (!(e1->flag & REF_DIR) && !(e2->flag & REF_DIR)) {
594 /* Both are references; ignore the one from dir1. */
595 retval = do_one_ref(base, fn, trim, flags, cb_data, e2);
596 i1++;
597 i2++;
598 } else {
599 die("conflict between reference and directory: %s",
600 e1->name);
601 }
b3fd060f 602 } else {
432ad41e
MH
603 struct ref_entry *e;
604 if (cmp < 0) {
605 e = e1;
b3fd060f 606 i1++;
432ad41e
MH
607 } else {
608 e = e2;
609 i2++;
610 }
611 if (e->flag & REF_DIR) {
d7826d54
MH
612 struct ref_dir *subdir = get_ref_dir(e);
613 sort_ref_dir(subdir);
432ad41e 614 retval = do_for_each_ref_in_dir(
d7826d54 615 subdir, 0,
432ad41e
MH
616 base, fn, trim, flags, cb_data);
617 } else {
618 retval = do_one_ref(base, fn, trim, flags, cb_data, e);
b3fd060f
MH
619 }
620 }
621 if (retval)
622 return retval;
623 }
d3177275
MH
624 if (i1 < dir1->nr)
625 return do_for_each_ref_in_dir(dir1, i1,
626 base, fn, trim, flags, cb_data);
627 if (i2 < dir2->nr)
628 return do_for_each_ref_in_dir(dir2, i2,
629 base, fn, trim, flags, cb_data);
b3fd060f
MH
630 return 0;
631}
632
d66da478
MH
633/*
634 * Return true iff refname1 and refname2 conflict with each other.
635 * Two reference names conflict if one of them exactly matches the
636 * leading components of the other; e.g., "foo/bar" conflicts with
637 * both "foo" and with "foo/bar/baz" but not with "foo/bar" or
638 * "foo/barbados".
639 */
640static int names_conflict(const char *refname1, const char *refname2)
641{
5a4d4947
MH
642 for (; *refname1 && *refname1 == *refname2; refname1++, refname2++)
643 ;
644 return (*refname1 == '\0' && *refname2 == '/')
645 || (*refname1 == '/' && *refname2 == '\0');
646}
647
648struct name_conflict_cb {
649 const char *refname;
650 const char *oldrefname;
651 const char *conflicting_refname;
652};
653
654static int name_conflict_fn(const char *existingrefname, const unsigned char *sha1,
655 int flags, void *cb_data)
656{
657 struct name_conflict_cb *data = (struct name_conflict_cb *)cb_data;
658 if (data->oldrefname && !strcmp(data->oldrefname, existingrefname))
659 return 0;
660 if (names_conflict(data->refname, existingrefname)) {
661 data->conflicting_refname = existingrefname;
662 return 1;
d66da478 663 }
5a4d4947 664 return 0;
d66da478
MH
665}
666
bc5fd6d3
MH
667/*
668 * Return true iff a reference named refname could be created without
5a4d4947
MH
669 * conflicting with the name of an existing reference in array. If
670 * oldrefname is non-NULL, ignore potential conflicts with oldrefname
671 * (e.g., because oldrefname is scheduled for deletion in the same
bc5fd6d3
MH
672 * operation).
673 */
674static int is_refname_available(const char *refname, const char *oldrefname,
d3177275 675 struct ref_dir *dir)
bc5fd6d3 676{
5a4d4947
MH
677 struct name_conflict_cb data;
678 data.refname = refname;
679 data.oldrefname = oldrefname;
680 data.conflicting_refname = NULL;
681
d3177275
MH
682 sort_ref_dir(dir);
683 if (do_for_each_ref_in_dir(dir, 0, "", name_conflict_fn,
684 0, DO_FOR_EACH_INCLUDE_BROKEN,
685 &data)) {
5a4d4947
MH
686 error("'%s' exists; cannot create '%s'",
687 data.conflicting_refname, refname);
688 return 0;
bc5fd6d3
MH
689 }
690 return 1;
e1e22e37
LT
691}
692
5e290ff7
JH
693/*
694 * Future: need to be in "struct repository"
695 * when doing a full libification.
696 */
79c7ca54
MH
697static struct ref_cache {
698 struct ref_cache *next;
d12229f5
MH
699 struct ref_entry *loose;
700 struct ref_entry *packed;
ce40979c
MH
701 /* The submodule name, or "" for the main repo. */
702 char name[FLEX_ARRAY];
79c7ca54 703} *ref_cache;
0e88c130 704
760c4512 705static void clear_packed_ref_cache(struct ref_cache *refs)
e1e22e37 706{
d12229f5
MH
707 if (refs->packed) {
708 free_ref_entry(refs->packed);
709 refs->packed = NULL;
710 }
5e290ff7 711}
e1e22e37 712
760c4512
MH
713static void clear_loose_ref_cache(struct ref_cache *refs)
714{
d12229f5
MH
715 if (refs->loose) {
716 free_ref_entry(refs->loose);
717 refs->loose = NULL;
718 }
760c4512
MH
719}
720
79c7ca54 721static struct ref_cache *create_ref_cache(const char *submodule)
e5dbf605 722{
ce40979c 723 int len;
79c7ca54 724 struct ref_cache *refs;
ce40979c
MH
725 if (!submodule)
726 submodule = "";
727 len = strlen(submodule) + 1;
79c7ca54 728 refs = xcalloc(1, sizeof(struct ref_cache) + len);
ce40979c 729 memcpy(refs->name, submodule, len);
e5dbf605
MH
730 return refs;
731}
732
4349a668 733/*
79c7ca54 734 * Return a pointer to a ref_cache for the specified submodule. For
4349a668
MH
735 * the main repository, use submodule==NULL. The returned structure
736 * will be allocated and initialized but not necessarily populated; it
737 * should not be freed.
738 */
79c7ca54 739static struct ref_cache *get_ref_cache(const char *submodule)
4349a668 740{
79c7ca54 741 struct ref_cache *refs = ref_cache;
0e88c130
MH
742 if (!submodule)
743 submodule = "";
744 while (refs) {
745 if (!strcmp(submodule, refs->name))
746 return refs;
747 refs = refs->next;
4349a668 748 }
0e88c130 749
79c7ca54
MH
750 refs = create_ref_cache(submodule);
751 refs->next = ref_cache;
752 ref_cache = refs;
0e88c130 753 return refs;
4349a668
MH
754}
755
8be8bde7 756void invalidate_ref_cache(const char *submodule)
f130b116 757{
c5f29abd
MH
758 struct ref_cache *refs = get_ref_cache(submodule);
759 clear_packed_ref_cache(refs);
760 clear_loose_ref_cache(refs);
5e290ff7 761}
e1e22e37 762
bc5fd6d3
MH
763/*
764 * Parse one line from a packed-refs file. Write the SHA1 to sha1.
765 * Return a pointer to the refname within the line (null-terminated),
766 * or NULL if there was a problem.
767 */
768static const char *parse_ref_line(char *line, unsigned char *sha1)
769{
770 /*
771 * 42: the answer to everything.
772 *
773 * In this case, it happens to be the answer to
774 * 40 (length of sha1 hex representation)
775 * +1 (space in between hex and name)
776 * +1 (newline at the end of the line)
777 */
778 int len = strlen(line) - 42;
779
780 if (len <= 0)
781 return NULL;
782 if (get_sha1_hex(line, sha1) < 0)
783 return NULL;
784 if (!isspace(line[40]))
785 return NULL;
786 line += 41;
787 if (isspace(*line))
788 return NULL;
789 if (line[len] != '\n')
790 return NULL;
791 line[len] = 0;
792
793 return line;
794}
795
d3177275 796static void read_packed_refs(FILE *f, struct ref_dir *dir)
f4204ab9 797{
e9c4c111 798 struct ref_entry *last = NULL;
f4204ab9
JH
799 char refline[PATH_MAX];
800 int flag = REF_ISPACKED;
801
802 while (fgets(refline, sizeof(refline), f)) {
803 unsigned char sha1[20];
dfefa935 804 const char *refname;
f4204ab9
JH
805 static const char header[] = "# pack-refs with:";
806
807 if (!strncmp(refline, header, sizeof(header)-1)) {
808 const char *traits = refline + sizeof(header) - 1;
809 if (strstr(traits, " peeled "))
810 flag |= REF_KNOWS_PEELED;
811 /* perhaps other traits later as well */
812 continue;
813 }
814
dfefa935
MH
815 refname = parse_ref_line(refline, sha1);
816 if (refname) {
dd73ecd1 817 last = create_ref_entry(refname, sha1, flag, 1);
d3177275 818 add_ref(dir, last);
f4204ab9
JH
819 continue;
820 }
821 if (last &&
822 refline[0] == '^' &&
823 strlen(refline) == 42 &&
824 refline[41] == '\n' &&
825 !get_sha1_hex(refline + 1, sha1))
593f1bb8 826 hashcpy(last->u.value.peeled, sha1);
f4204ab9 827 }
f4204ab9
JH
828}
829
d3177275 830static struct ref_dir *get_packed_refs(struct ref_cache *refs)
5e290ff7 831{
d12229f5 832 if (!refs->packed) {
4349a668
MH
833 const char *packed_refs_file;
834 FILE *f;
0bad611b 835
b9146f51 836 refs->packed = create_dir_entry(refs, "", 0, 0);
316b097a
MH
837 if (*refs->name)
838 packed_refs_file = git_path_submodule(refs->name, "packed-refs");
4349a668
MH
839 else
840 packed_refs_file = git_path("packed-refs");
841 f = fopen(packed_refs_file, "r");
e1e22e37 842 if (f) {
d7826d54 843 read_packed_refs(f, get_ref_dir(refs->packed));
e1e22e37 844 fclose(f);
e1e22e37 845 }
e1e22e37 846 }
d7826d54 847 return get_ref_dir(refs->packed);
e1e22e37
LT
848}
849
30249ee6
MH
850void add_packed_ref(const char *refname, const unsigned char *sha1)
851{
852 add_ref(get_packed_refs(get_ref_cache(NULL)),
853 create_ref_entry(refname, sha1, REF_ISPACKED, 1));
854}
855
abc39098 856/*
28e6a34e
MH
857 * Read the loose references from the namespace dirname into dir
858 * (without recursing). dirname must end with '/'. dir must be the
859 * directory entry corresponding to dirname.
abc39098 860 */
423a1afc 861static void read_loose_refs(const char *dirname, struct ref_dir *dir)
e1e22e37 862{
423a1afc 863 struct ref_cache *refs = dir->ref_cache;
d3177275 864 DIR *d;
0bad611b 865 const char *path;
d5fdae67 866 struct dirent *de;
abc39098 867 int dirnamelen = strlen(dirname);
72b64b44 868 struct strbuf refname;
0bad611b 869
3b124823 870 if (*refs->name)
66a3d20b 871 path = git_path_submodule(refs->name, "%s", dirname);
0bad611b 872 else
66a3d20b 873 path = git_path("%s", dirname);
0bad611b 874
d3177275 875 d = opendir(path);
d5fdae67
MH
876 if (!d)
877 return;
878
66a3d20b
MH
879 strbuf_init(&refname, dirnamelen + 257);
880 strbuf_add(&refname, dirname, dirnamelen);
d5fdae67
MH
881
882 while ((de = readdir(d)) != NULL) {
883 unsigned char sha1[20];
884 struct stat st;
885 int flag;
d5fdae67
MH
886 const char *refdir;
887
888 if (de->d_name[0] == '.')
889 continue;
d5fdae67
MH
890 if (has_extension(de->d_name, ".lock"))
891 continue;
72b64b44 892 strbuf_addstr(&refname, de->d_name);
d5fdae67 893 refdir = *refs->name
72b64b44
MH
894 ? git_path_submodule(refs->name, "%s", refname.buf)
895 : git_path("%s", refname.buf);
896 if (stat(refdir, &st) < 0) {
897 ; /* silently ignore */
898 } else if (S_ISDIR(st.st_mode)) {
abc39098 899 strbuf_addch(&refname, '/');
28e6a34e 900 add_entry_to_dir(dir,
b9146f51
RS
901 create_dir_entry(refs, refname.buf,
902 refname.len, 1));
72b64b44 903 } else {
3b124823 904 if (*refs->name) {
f8948e2f 905 hashclr(sha1);
0bad611b 906 flag = 0;
72b64b44 907 if (resolve_gitlink_ref(refs->name, refname.buf, sha1) < 0) {
0bad611b 908 hashclr(sha1);
98ac34b2 909 flag |= REF_ISBROKEN;
0bad611b 910 }
72b64b44 911 } else if (read_ref_full(refname.buf, sha1, 1, &flag)) {
09116a1c
JH
912 hashclr(sha1);
913 flag |= REF_ISBROKEN;
914 }
9f2fb4a3
MH
915 add_entry_to_dir(dir,
916 create_ref_entry(refname.buf, sha1, flag, 1));
e1e22e37 917 }
66a3d20b 918 strbuf_setlen(&refname, dirnamelen);
e1e22e37 919 }
72b64b44 920 strbuf_release(&refname);
d5fdae67 921 closedir(d);
e1e22e37
LT
922}
923
d3177275 924static struct ref_dir *get_loose_refs(struct ref_cache *refs)
e1e22e37 925{
d12229f5 926 if (!refs->loose) {
28e6a34e
MH
927 /*
928 * Mark the top-level directory complete because we
929 * are about to read the only subdirectory that can
930 * hold references:
931 */
b9146f51 932 refs->loose = create_dir_entry(refs, "", 0, 0);
28e6a34e
MH
933 /*
934 * Create an incomplete entry for "refs/":
935 */
936 add_entry_to_dir(get_ref_dir(refs->loose),
b9146f51 937 create_dir_entry(refs, "refs/", 5, 1));
e1e22e37 938 }
d7826d54 939 return get_ref_dir(refs->loose);
e1e22e37
LT
940}
941
ca8db142
LT
942/* We allow "recursive" symbolic refs. Only within reason, though */
943#define MAXDEPTH 5
0ebde32c
LT
944#define MAXREFLEN (1024)
945
e5fa45c1
JH
946/*
947 * Called by resolve_gitlink_ref_recursive() after it failed to read
b0626608
MH
948 * from the loose refs in ref_cache refs. Find <refname> in the
949 * packed-refs file for the submodule.
e5fa45c1 950 */
b0626608 951static int resolve_gitlink_packed_ref(struct ref_cache *refs,
85be1fe3 952 const char *refname, unsigned char *sha1)
0ebde32c 953{
2c5c66be 954 struct ref_entry *ref;
d3177275 955 struct ref_dir *dir = get_packed_refs(refs);
0ebde32c 956
432ad41e 957 ref = find_ref(dir, refname);
b0626608
MH
958 if (ref == NULL)
959 return -1;
960
593f1bb8 961 memcpy(sha1, ref->u.value.sha1, 20);
b0626608 962 return 0;
0ebde32c
LT
963}
964
b0626608 965static int resolve_gitlink_ref_recursive(struct ref_cache *refs,
85be1fe3 966 const char *refname, unsigned char *sha1,
dfefa935 967 int recursion)
0ebde32c 968{
064d51dc 969 int fd, len;
0ebde32c 970 char buffer[128], *p;
064d51dc 971 char *path;
0ebde32c 972
064d51dc 973 if (recursion > MAXDEPTH || strlen(refname) > MAXREFLEN)
0ebde32c 974 return -1;
064d51dc
MH
975 path = *refs->name
976 ? git_path_submodule(refs->name, "%s", refname)
977 : git_path("%s", refname);
978 fd = open(path, O_RDONLY);
0ebde32c 979 if (fd < 0)
b0626608 980 return resolve_gitlink_packed_ref(refs, refname, sha1);
0ebde32c
LT
981
982 len = read(fd, buffer, sizeof(buffer)-1);
983 close(fd);
984 if (len < 0)
985 return -1;
986 while (len && isspace(buffer[len-1]))
987 len--;
988 buffer[len] = 0;
989
990 /* Was it a detached head or an old-fashioned symlink? */
85be1fe3 991 if (!get_sha1_hex(buffer, sha1))
0ebde32c
LT
992 return 0;
993
994 /* Symref? */
995 if (strncmp(buffer, "ref:", 4))
996 return -1;
997 p = buffer + 4;
998 while (isspace(*p))
999 p++;
1000
064d51dc 1001 return resolve_gitlink_ref_recursive(refs, p, sha1, recursion+1);
0ebde32c
LT
1002}
1003
85be1fe3 1004int resolve_gitlink_ref(const char *path, const char *refname, unsigned char *sha1)
0ebde32c
LT
1005{
1006 int len = strlen(path), retval;
064d51dc 1007 char *submodule;
b0626608 1008 struct ref_cache *refs;
0ebde32c
LT
1009
1010 while (len && path[len-1] == '/')
1011 len--;
1012 if (!len)
1013 return -1;
b0626608
MH
1014 submodule = xstrndup(path, len);
1015 refs = get_ref_cache(submodule);
1016 free(submodule);
1017
064d51dc 1018 retval = resolve_gitlink_ref_recursive(refs, refname, sha1, 0);
0ebde32c
LT
1019 return retval;
1020}
ca8db142 1021
4886b89f 1022/*
c224ca7f
MH
1023 * Try to read ref from the packed references. On success, set sha1
1024 * and return 0; otherwise, return -1.
4886b89f 1025 */
dfefa935 1026static int get_packed_ref(const char *refname, unsigned char *sha1)
c224ca7f 1027{
d3177275 1028 struct ref_dir *packed = get_packed_refs(get_ref_cache(NULL));
432ad41e 1029 struct ref_entry *entry = find_ref(packed, refname);
2c5c66be 1030 if (entry) {
593f1bb8 1031 hashcpy(sha1, entry->u.value.sha1);
2c5c66be 1032 return 0;
c224ca7f
MH
1033 }
1034 return -1;
1035}
1036
8d68493f 1037const char *resolve_ref_unsafe(const char *refname, unsigned char *sha1, int reading, int *flag)
8a65ff76 1038{
0104ca09
HO
1039 int depth = MAXDEPTH;
1040 ssize_t len;
a876ed83 1041 char buffer[256];
dfefa935 1042 static char refname_buffer[256];
ca8db142 1043
8da19775
JH
1044 if (flag)
1045 *flag = 0;
1046
dfefa935 1047 if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL))
8384d788
MH
1048 return NULL;
1049
a876ed83 1050 for (;;) {
55956350 1051 char path[PATH_MAX];
a876ed83
JH
1052 struct stat st;
1053 char *buf;
1054 int fd;
8a65ff76 1055
a876ed83
JH
1056 if (--depth < 0)
1057 return NULL;
ca8db142 1058
dfefa935 1059 git_snpath(path, sizeof(path), "%s", refname);
c224ca7f 1060
a876ed83 1061 if (lstat(path, &st) < 0) {
c224ca7f
MH
1062 if (errno != ENOENT)
1063 return NULL;
1064 /*
1065 * The loose reference file does not exist;
1066 * check for a packed reference.
1067 */
dfefa935 1068 if (!get_packed_ref(refname, sha1)) {
c224ca7f
MH
1069 if (flag)
1070 *flag |= REF_ISPACKED;
dfefa935 1071 return refname;
434cd0cd 1072 }
c224ca7f
MH
1073 /* The reference is not a packed reference, either. */
1074 if (reading) {
a876ed83 1075 return NULL;
c224ca7f
MH
1076 } else {
1077 hashclr(sha1);
dfefa935 1078 return refname;
c224ca7f 1079 }
a876ed83 1080 }
ca8db142 1081
a876ed83
JH
1082 /* Follow "normalized" - ie "refs/.." symlinks by hand */
1083 if (S_ISLNK(st.st_mode)) {
1084 len = readlink(path, buffer, sizeof(buffer)-1);
7bb2bf8e
MH
1085 if (len < 0)
1086 return NULL;
b54cb795 1087 buffer[len] = 0;
1f58a038
MH
1088 if (!prefixcmp(buffer, "refs/") &&
1089 !check_refname_format(buffer, 0)) {
dfefa935
MH
1090 strcpy(refname_buffer, buffer);
1091 refname = refname_buffer;
8da19775
JH
1092 if (flag)
1093 *flag |= REF_ISSYMREF;
a876ed83
JH
1094 continue;
1095 }
ca8db142 1096 }
a876ed83 1097
7a21632f
DS
1098 /* Is it a directory? */
1099 if (S_ISDIR(st.st_mode)) {
1100 errno = EISDIR;
1101 return NULL;
1102 }
1103
a876ed83
JH
1104 /*
1105 * Anything else, just open it and try to use it as
1106 * a ref
1107 */
1108 fd = open(path, O_RDONLY);
1109 if (fd < 0)
1110 return NULL;
93d26e4c 1111 len = read_in_full(fd, buffer, sizeof(buffer)-1);
a876ed83 1112 close(fd);
28775050
MH
1113 if (len < 0)
1114 return NULL;
1115 while (len && isspace(buffer[len-1]))
1116 len--;
1117 buffer[len] = '\0';
a876ed83
JH
1118
1119 /*
1120 * Is it a symbolic ref?
1121 */
28775050 1122 if (prefixcmp(buffer, "ref:"))
a876ed83 1123 break;
55956350
JH
1124 if (flag)
1125 *flag |= REF_ISSYMREF;
a876ed83 1126 buf = buffer + 4;
28775050
MH
1127 while (isspace(*buf))
1128 buf++;
313fb010 1129 if (check_refname_format(buf, REFNAME_ALLOW_ONELEVEL)) {
55956350
JH
1130 if (flag)
1131 *flag |= REF_ISBROKEN;
313fb010
MH
1132 return NULL;
1133 }
dfefa935 1134 refname = strcpy(refname_buffer, buf);
8a65ff76 1135 }
f989fea0
MH
1136 /* Please note that FETCH_HEAD has a second line containing other data. */
1137 if (get_sha1_hex(buffer, sha1) || (buffer[40] != '\0' && !isspace(buffer[40]))) {
55956350
JH
1138 if (flag)
1139 *flag |= REF_ISBROKEN;
a876ed83 1140 return NULL;
629cd3ac 1141 }
dfefa935 1142 return refname;
a876ed83
JH
1143}
1144
96ec7b1e
NTND
1145char *resolve_refdup(const char *ref, unsigned char *sha1, int reading, int *flag)
1146{
8cad4744 1147 const char *ret = resolve_ref_unsafe(ref, sha1, reading, flag);
96ec7b1e
NTND
1148 return ret ? xstrdup(ret) : NULL;
1149}
1150
d08bae7e
IL
1151/* The argument to filter_refs */
1152struct ref_filter {
1153 const char *pattern;
1154 each_ref_fn *fn;
1155 void *cb_data;
1156};
1157
dfefa935 1158int read_ref_full(const char *refname, unsigned char *sha1, int reading, int *flags)
a876ed83 1159{
8d68493f 1160 if (resolve_ref_unsafe(refname, sha1, reading, flags))
a876ed83
JH
1161 return 0;
1162 return -1;
8a65ff76
LT
1163}
1164
dfefa935 1165int read_ref(const char *refname, unsigned char *sha1)
c6893323 1166{
dfefa935 1167 return read_ref_full(refname, sha1, 1, NULL);
c6893323
NTND
1168}
1169
bc5fd6d3 1170int ref_exists(const char *refname)
ef06b918 1171{
bc5fd6d3
MH
1172 unsigned char sha1[20];
1173 return !!resolve_ref_unsafe(refname, sha1, 1, NULL);
ef06b918
JH
1174}
1175
85be1fe3 1176static int filter_refs(const char *refname, const unsigned char *sha1, int flags,
dfefa935 1177 void *data)
d08bae7e
IL
1178{
1179 struct ref_filter *filter = (struct ref_filter *)data;
dfefa935 1180 if (fnmatch(filter->pattern, refname, 0))
d08bae7e 1181 return 0;
85be1fe3 1182 return filter->fn(refname, sha1, flags, filter->cb_data);
d08bae7e
IL
1183}
1184
dfefa935 1185int peel_ref(const char *refname, unsigned char *sha1)
cf0adba7
JH
1186{
1187 int flag;
1188 unsigned char base[20];
1189 struct object *o;
1190
dfefa935
MH
1191 if (current_ref && (current_ref->name == refname
1192 || !strcmp(current_ref->name, refname))) {
0ae91be0 1193 if (current_ref->flag & REF_KNOWS_PEELED) {
593f1bb8 1194 hashcpy(sha1, current_ref->u.value.peeled);
0ae91be0
SP
1195 return 0;
1196 }
593f1bb8 1197 hashcpy(base, current_ref->u.value.sha1);
0ae91be0
SP
1198 goto fallback;
1199 }
1200
dfefa935 1201 if (read_ref_full(refname, base, 1, &flag))
cf0adba7
JH
1202 return -1;
1203
1204 if ((flag & REF_ISPACKED)) {
d3177275 1205 struct ref_dir *dir = get_packed_refs(get_ref_cache(NULL));
432ad41e 1206 struct ref_entry *r = find_ref(dir, refname);
cf0adba7 1207
e9c4c111 1208 if (r != NULL && r->flag & REF_KNOWS_PEELED) {
593f1bb8 1209 hashcpy(sha1, r->u.value.peeled);
e9c4c111 1210 return 0;
cf0adba7 1211 }
cf0adba7
JH
1212 }
1213
0ae91be0 1214fallback:
cf0adba7 1215 o = parse_object(base);
8c87dc77 1216 if (o && o->type == OBJ_TAG) {
dfefa935 1217 o = deref_tag(o, refname, 0);
cf0adba7
JH
1218 if (o) {
1219 hashcpy(sha1, o->sha1);
1220 return 0;
1221 }
1222 }
1223 return -1;
1224}
1225
bc5fd6d3
MH
1226struct warn_if_dangling_data {
1227 FILE *fp;
1228 const char *refname;
1229 const char *msg_fmt;
1230};
1231
1232static int warn_if_dangling_symref(const char *refname, const unsigned char *sha1,
1233 int flags, void *cb_data)
1234{
1235 struct warn_if_dangling_data *d = cb_data;
1236 const char *resolves_to;
1237 unsigned char junk[20];
1238
1239 if (!(flags & REF_ISSYMREF))
1240 return 0;
1241
1242 resolves_to = resolve_ref_unsafe(refname, junk, 0, NULL);
1243 if (!resolves_to || strcmp(resolves_to, d->refname))
1244 return 0;
1245
1246 fprintf(d->fp, d->msg_fmt, refname);
1be65eda 1247 fputc('\n', d->fp);
bc5fd6d3
MH
1248 return 0;
1249}
1250
1251void warn_dangling_symref(FILE *fp, const char *msg_fmt, const char *refname)
1252{
1253 struct warn_if_dangling_data data;
1254
1255 data.fp = fp;
1256 data.refname = refname;
1257 data.msg_fmt = msg_fmt;
1258 for_each_rawref(warn_if_dangling_symref, &data);
1259}
1260
0bad611b
HV
1261static int do_for_each_ref(const char *submodule, const char *base, each_ref_fn fn,
1262 int trim, int flags, void *cb_data)
8a65ff76 1263{
316b097a 1264 struct ref_cache *refs = get_ref_cache(submodule);
933ac036
MH
1265 struct ref_dir *packed_dir = get_packed_refs(refs);
1266 struct ref_dir *loose_dir = get_loose_refs(refs);
1267 int retval = 0;
1268
1269 if (base && *base) {
1270 packed_dir = find_containing_dir(packed_dir, base, 0);
1271 loose_dir = find_containing_dir(loose_dir, base, 0);
1272 }
1273
1274 if (packed_dir && loose_dir) {
1275 sort_ref_dir(packed_dir);
1276 sort_ref_dir(loose_dir);
1277 retval = do_for_each_ref_in_dirs(
1278 packed_dir, loose_dir,
1279 base, fn, trim, flags, cb_data);
1280 } else if (packed_dir) {
1281 sort_ref_dir(packed_dir);
1282 retval = do_for_each_ref_in_dir(
1283 packed_dir, 0,
1284 base, fn, trim, flags, cb_data);
1285 } else if (loose_dir) {
1286 sort_ref_dir(loose_dir);
1287 retval = do_for_each_ref_in_dir(
1288 loose_dir, 0,
1289 base, fn, trim, flags, cb_data);
1290 }
1291
1292 return retval;
8a65ff76
LT
1293}
1294
0bad611b 1295static int do_head_ref(const char *submodule, each_ref_fn fn, void *cb_data)
723c31fe
LT
1296{
1297 unsigned char sha1[20];
8da19775
JH
1298 int flag;
1299
0bad611b
HV
1300 if (submodule) {
1301 if (resolve_gitlink_ref(submodule, "HEAD", sha1) == 0)
1302 return fn("HEAD", sha1, 0, cb_data);
1303
1304 return 0;
1305 }
1306
c6893323 1307 if (!read_ref_full("HEAD", sha1, 1, &flag))
8da19775 1308 return fn("HEAD", sha1, flag, cb_data);
0bad611b 1309
2f34ba32 1310 return 0;
723c31fe
LT
1311}
1312
0bad611b
HV
1313int head_ref(each_ref_fn fn, void *cb_data)
1314{
1315 return do_head_ref(NULL, fn, cb_data);
1316}
1317
9ef6aeb0
HV
1318int head_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
1319{
1320 return do_head_ref(submodule, fn, cb_data);
1321}
1322
cb5d709f 1323int for_each_ref(each_ref_fn fn, void *cb_data)
8a65ff76 1324{
b3cfc406 1325 return do_for_each_ref(NULL, "", fn, 0, 0, cb_data);
a62be77f
SE
1326}
1327
9ef6aeb0
HV
1328int for_each_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
1329{
b3cfc406 1330 return do_for_each_ref(submodule, "", fn, 0, 0, cb_data);
a62be77f
SE
1331}
1332
2a8177b6
CC
1333int for_each_ref_in(const char *prefix, each_ref_fn fn, void *cb_data)
1334{
0bad611b 1335 return do_for_each_ref(NULL, prefix, fn, strlen(prefix), 0, cb_data);
2a8177b6
CC
1336}
1337
9ef6aeb0
HV
1338int for_each_ref_in_submodule(const char *submodule, const char *prefix,
1339 each_ref_fn fn, void *cb_data)
1340{
1341 return do_for_each_ref(submodule, prefix, fn, strlen(prefix), 0, cb_data);
2a8177b6
CC
1342}
1343
cb5d709f 1344int for_each_tag_ref(each_ref_fn fn, void *cb_data)
a62be77f 1345{
2a8177b6 1346 return for_each_ref_in("refs/tags/", fn, cb_data);
a62be77f
SE
1347}
1348
9ef6aeb0
HV
1349int for_each_tag_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
1350{
1351 return for_each_ref_in_submodule(submodule, "refs/tags/", fn, cb_data);
1352}
1353
cb5d709f 1354int for_each_branch_ref(each_ref_fn fn, void *cb_data)
a62be77f 1355{
2a8177b6 1356 return for_each_ref_in("refs/heads/", fn, cb_data);
a62be77f
SE
1357}
1358
9ef6aeb0
HV
1359int for_each_branch_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
1360{
1361 return for_each_ref_in_submodule(submodule, "refs/heads/", fn, cb_data);
1362}
1363
cb5d709f 1364int for_each_remote_ref(each_ref_fn fn, void *cb_data)
a62be77f 1365{
2a8177b6 1366 return for_each_ref_in("refs/remotes/", fn, cb_data);
f8948e2f
JH
1367}
1368
9ef6aeb0
HV
1369int for_each_remote_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
1370{
1371 return for_each_ref_in_submodule(submodule, "refs/remotes/", fn, cb_data);
1372}
1373
29268700
CC
1374int for_each_replace_ref(each_ref_fn fn, void *cb_data)
1375{
0bad611b 1376 return do_for_each_ref(NULL, "refs/replace/", fn, 13, 0, cb_data);
29268700
CC
1377}
1378
a1bea2c1
JT
1379int head_ref_namespaced(each_ref_fn fn, void *cb_data)
1380{
1381 struct strbuf buf = STRBUF_INIT;
1382 int ret = 0;
1383 unsigned char sha1[20];
1384 int flag;
1385
1386 strbuf_addf(&buf, "%sHEAD", get_git_namespace());
c6893323 1387 if (!read_ref_full(buf.buf, sha1, 1, &flag))
a1bea2c1
JT
1388 ret = fn(buf.buf, sha1, flag, cb_data);
1389 strbuf_release(&buf);
1390
1391 return ret;
1392}
1393
1394int for_each_namespaced_ref(each_ref_fn fn, void *cb_data)
1395{
1396 struct strbuf buf = STRBUF_INIT;
1397 int ret;
1398 strbuf_addf(&buf, "%srefs/", get_git_namespace());
1399 ret = do_for_each_ref(NULL, buf.buf, fn, 0, 0, cb_data);
1400 strbuf_release(&buf);
1401 return ret;
1402}
1403
b09fe971
IL
1404int for_each_glob_ref_in(each_ref_fn fn, const char *pattern,
1405 const char *prefix, void *cb_data)
d08bae7e
IL
1406{
1407 struct strbuf real_pattern = STRBUF_INIT;
1408 struct ref_filter filter;
d08bae7e
IL
1409 int ret;
1410
b09fe971 1411 if (!prefix && prefixcmp(pattern, "refs/"))
d08bae7e 1412 strbuf_addstr(&real_pattern, "refs/");
b09fe971
IL
1413 else if (prefix)
1414 strbuf_addstr(&real_pattern, prefix);
d08bae7e
IL
1415 strbuf_addstr(&real_pattern, pattern);
1416
894a9d33 1417 if (!has_glob_specials(pattern)) {
9517e6b8 1418 /* Append implied '/' '*' if not present. */
d08bae7e
IL
1419 if (real_pattern.buf[real_pattern.len - 1] != '/')
1420 strbuf_addch(&real_pattern, '/');
1421 /* No need to check for '*', there is none. */
1422 strbuf_addch(&real_pattern, '*');
1423 }
1424
1425 filter.pattern = real_pattern.buf;
1426 filter.fn = fn;
1427 filter.cb_data = cb_data;
1428 ret = for_each_ref(filter_refs, &filter);
1429
1430 strbuf_release(&real_pattern);
1431 return ret;
1432}
1433
b09fe971
IL
1434int for_each_glob_ref(each_ref_fn fn, const char *pattern, void *cb_data)
1435{
1436 return for_each_glob_ref_in(fn, pattern, NULL, cb_data);
1437}
1438
f8948e2f
JH
1439int for_each_rawref(each_ref_fn fn, void *cb_data)
1440{
b3cfc406 1441 return do_for_each_ref(NULL, "", fn, 0,
f8948e2f 1442 DO_FOR_EACH_INCLUDE_BROKEN, cb_data);
8a65ff76
LT
1443}
1444
4577e483 1445const char *prettify_refname(const char *name)
a9c37a72 1446{
a9c37a72
DB
1447 return name + (
1448 !prefixcmp(name, "refs/heads/") ? 11 :
1449 !prefixcmp(name, "refs/tags/") ? 10 :
1450 !prefixcmp(name, "refs/remotes/") ? 13 :
1451 0);
1452}
1453
79803322
SP
1454const char *ref_rev_parse_rules[] = {
1455 "%.*s",
1456 "refs/%.*s",
1457 "refs/tags/%.*s",
1458 "refs/heads/%.*s",
1459 "refs/remotes/%.*s",
1460 "refs/remotes/%.*s/HEAD",
1461 NULL
1462};
1463
1464int refname_match(const char *abbrev_name, const char *full_name, const char **rules)
1465{
1466 const char **p;
1467 const int abbrev_name_len = strlen(abbrev_name);
1468
1469 for (p = rules; *p; p++) {
1470 if (!strcmp(full_name, mkpath(*p, abbrev_name_len, abbrev_name))) {
1471 return 1;
1472 }
1473 }
1474
1475 return 0;
1476}
1477
e5f38ec3 1478static struct ref_lock *verify_lock(struct ref_lock *lock,
4bd18c43
SP
1479 const unsigned char *old_sha1, int mustexist)
1480{
c6893323 1481 if (read_ref_full(lock->ref_name, lock->old_sha1, mustexist, NULL)) {
434cd0cd 1482 error("Can't verify ref %s", lock->ref_name);
4bd18c43
SP
1483 unlock_ref(lock);
1484 return NULL;
1485 }
a89fccd2 1486 if (hashcmp(lock->old_sha1, old_sha1)) {
434cd0cd 1487 error("Ref %s is at %s but expected %s", lock->ref_name,
4bd18c43
SP
1488 sha1_to_hex(lock->old_sha1), sha1_to_hex(old_sha1));
1489 unlock_ref(lock);
1490 return NULL;
1491 }
1492 return lock;
1493}
1494
7155b727 1495static int remove_empty_directories(const char *file)
bc7127ef
JH
1496{
1497 /* we want to create a file but there is a directory there;
1498 * if that is an empty directory (or a directory that contains
1499 * only empty directories), remove them.
1500 */
7155b727
JS
1501 struct strbuf path;
1502 int result;
bc7127ef 1503
7155b727
JS
1504 strbuf_init(&path, 20);
1505 strbuf_addstr(&path, file);
1506
a0f4afbe 1507 result = remove_dir_recursively(&path, REMOVE_DIR_EMPTY_ONLY);
7155b727
JS
1508
1509 strbuf_release(&path);
1510
1511 return result;
bc7127ef
JH
1512}
1513
ff74f7f1
JH
1514/*
1515 * *string and *len will only be substituted, and *string returned (for
1516 * later free()ing) if the string passed in is a magic short-hand form
1517 * to name a branch.
1518 */
1519static char *substitute_branch_name(const char **string, int *len)
1520{
1521 struct strbuf buf = STRBUF_INIT;
1522 int ret = interpret_branch_name(*string, &buf);
1523
1524 if (ret == *len) {
1525 size_t size;
1526 *string = strbuf_detach(&buf, &size);
1527 *len = size;
1528 return (char *)*string;
1529 }
1530
1531 return NULL;
1532}
1533
1534int dwim_ref(const char *str, int len, unsigned char *sha1, char **ref)
1535{
1536 char *last_branch = substitute_branch_name(&str, &len);
1537 const char **p, *r;
1538 int refs_found = 0;
1539
1540 *ref = NULL;
1541 for (p = ref_rev_parse_rules; *p; p++) {
1542 char fullref[PATH_MAX];
1543 unsigned char sha1_from_ref[20];
1544 unsigned char *this_result;
1545 int flag;
1546
1547 this_result = refs_found ? sha1_from_ref : sha1;
1548 mksnpath(fullref, sizeof(fullref), *p, len, str);
8cad4744 1549 r = resolve_ref_unsafe(fullref, this_result, 1, &flag);
ff74f7f1
JH
1550 if (r) {
1551 if (!refs_found++)
1552 *ref = xstrdup(r);
1553 if (!warn_ambiguous_refs)
1554 break;
55956350 1555 } else if ((flag & REF_ISSYMREF) && strcmp(fullref, "HEAD")) {
ff74f7f1 1556 warning("ignoring dangling symref %s.", fullref);
55956350
JH
1557 } else if ((flag & REF_ISBROKEN) && strchr(fullref, '/')) {
1558 warning("ignoring broken ref %s.", fullref);
1559 }
ff74f7f1
JH
1560 }
1561 free(last_branch);
1562 return refs_found;
1563}
1564
1565int dwim_log(const char *str, int len, unsigned char *sha1, char **log)
1566{
1567 char *last_branch = substitute_branch_name(&str, &len);
1568 const char **p;
1569 int logs_found = 0;
1570
1571 *log = NULL;
1572 for (p = ref_rev_parse_rules; *p; p++) {
1573 struct stat st;
1574 unsigned char hash[20];
1575 char path[PATH_MAX];
1576 const char *ref, *it;
1577
1578 mksnpath(path, sizeof(path), *p, len, str);
8cad4744 1579 ref = resolve_ref_unsafe(path, hash, 1, NULL);
ff74f7f1
JH
1580 if (!ref)
1581 continue;
1582 if (!stat(git_path("logs/%s", path), &st) &&
1583 S_ISREG(st.st_mode))
1584 it = path;
1585 else if (strcmp(ref, path) &&
1586 !stat(git_path("logs/%s", ref), &st) &&
1587 S_ISREG(st.st_mode))
1588 it = ref;
1589 else
1590 continue;
1591 if (!logs_found++) {
1592 *log = xstrdup(it);
1593 hashcpy(sha1, hash);
1594 }
1595 if (!warn_ambiguous_refs)
1596 break;
1597 }
1598 free(last_branch);
1599 return logs_found;
1600}
1601
dfefa935
MH
1602static struct ref_lock *lock_ref_sha1_basic(const char *refname,
1603 const unsigned char *old_sha1,
1604 int flags, int *type_p)
4bd18c43 1605{
434cd0cd 1606 char *ref_file;
dfefa935 1607 const char *orig_refname = refname;
4bd18c43 1608 struct ref_lock *lock;
5cc3cef9 1609 int last_errno = 0;
acd3b9ec 1610 int type, lflags;
4431fcc4 1611 int mustexist = (old_sha1 && !is_null_sha1(old_sha1));
5bdd8d4a 1612 int missing = 0;
4bd18c43
SP
1613
1614 lock = xcalloc(1, sizeof(struct ref_lock));
1615 lock->lock_fd = -1;
1616
8d68493f 1617 refname = resolve_ref_unsafe(refname, lock->old_sha1, mustexist, &type);
dfefa935 1618 if (!refname && errno == EISDIR) {
bc7127ef
JH
1619 /* we are trying to lock foo but we used to
1620 * have foo/bar which now does not exist;
1621 * it is normal for the empty directory 'foo'
1622 * to remain.
1623 */
dfefa935 1624 ref_file = git_path("%s", orig_refname);
5cc3cef9
JH
1625 if (remove_empty_directories(ref_file)) {
1626 last_errno = errno;
dfefa935 1627 error("there are still refs under '%s'", orig_refname);
5cc3cef9
JH
1628 goto error_return;
1629 }
8d68493f 1630 refname = resolve_ref_unsafe(orig_refname, lock->old_sha1, mustexist, &type);
bc7127ef 1631 }
68db31cc
SV
1632 if (type_p)
1633 *type_p = type;
dfefa935 1634 if (!refname) {
5cc3cef9 1635 last_errno = errno;
818f477c 1636 error("unable to resolve reference %s: %s",
dfefa935 1637 orig_refname, strerror(errno));
5cc3cef9 1638 goto error_return;
4bd18c43 1639 }
5bdd8d4a 1640 missing = is_null_sha1(lock->old_sha1);
c976d415
LH
1641 /* When the ref did not exist and we are creating it,
1642 * make sure there is no existing ref that is packed
1643 * whose name begins with our refname, nor a ref whose
1644 * name is a proper prefix of our refname.
1645 */
5bdd8d4a 1646 if (missing &&
316b097a 1647 !is_refname_available(refname, NULL, get_packed_refs(get_ref_cache(NULL)))) {
f475e08e 1648 last_errno = ENOTDIR;
c976d415 1649 goto error_return;
f475e08e 1650 }
22a3844e 1651
c33d5174 1652 lock->lk = xcalloc(1, sizeof(struct lock_file));
4bd18c43 1653
acd3b9ec
JH
1654 lflags = LOCK_DIE_ON_ERROR;
1655 if (flags & REF_NODEREF) {
dfefa935 1656 refname = orig_refname;
acd3b9ec
JH
1657 lflags |= LOCK_NODEREF;
1658 }
dfefa935
MH
1659 lock->ref_name = xstrdup(refname);
1660 lock->orig_ref_name = xstrdup(orig_refname);
1661 ref_file = git_path("%s", refname);
5bdd8d4a 1662 if (missing)
68db31cc
SV
1663 lock->force_write = 1;
1664 if ((flags & REF_NODEREF) && (type & REF_ISSYMREF))
1665 lock->force_write = 1;
4bd18c43 1666
5cc3cef9
JH
1667 if (safe_create_leading_directories(ref_file)) {
1668 last_errno = errno;
1669 error("unable to create directory for %s", ref_file);
1670 goto error_return;
1671 }
4bd18c43 1672
acd3b9ec 1673 lock->lock_fd = hold_lock_file_for_update(lock->lk, ref_file, lflags);
4bd18c43 1674 return old_sha1 ? verify_lock(lock, old_sha1, mustexist) : lock;
5cc3cef9
JH
1675
1676 error_return:
1677 unlock_ref(lock);
1678 errno = last_errno;
1679 return NULL;
4bd18c43
SP
1680}
1681
dfefa935 1682struct ref_lock *lock_ref_sha1(const char *refname, const unsigned char *old_sha1)
95fc7512 1683{
53cce84c 1684 char refpath[PATH_MAX];
dfefa935 1685 if (check_refname_format(refname, 0))
4bd18c43 1686 return NULL;
dfefa935 1687 strcpy(refpath, mkpath("refs/%s", refname));
68db31cc 1688 return lock_ref_sha1_basic(refpath, old_sha1, 0, NULL);
4bd18c43
SP
1689}
1690
dfefa935
MH
1691struct ref_lock *lock_any_ref_for_update(const char *refname,
1692 const unsigned char *old_sha1, int flags)
4bd18c43 1693{
dfefa935 1694 if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL))
257f3020 1695 return NULL;
dfefa935 1696 return lock_ref_sha1_basic(refname, old_sha1, flags, NULL);
c0277d15
JH
1697}
1698
d66da478
MH
1699struct repack_without_ref_sb {
1700 const char *refname;
1701 int fd;
1702};
1703
1704static int repack_without_ref_fn(const char *refname, const unsigned char *sha1,
1705 int flags, void *cb_data)
1706{
1707 struct repack_without_ref_sb *data = cb_data;
1708 char line[PATH_MAX + 100];
1709 int len;
1710
1711 if (!strcmp(data->refname, refname))
1712 return 0;
1713 len = snprintf(line, sizeof(line), "%s %s\n",
1714 sha1_to_hex(sha1), refname);
1715 /* this should not happen but just being defensive */
1716 if (len > sizeof(line))
1717 die("too long a refname '%s'", refname);
1718 write_or_die(data->fd, line, len);
1719 return 0;
1720}
1721
26a063a1
JH
1722static struct lock_file packlock;
1723
c0277d15
JH
1724static int repack_without_ref(const char *refname)
1725{
d66da478 1726 struct repack_without_ref_sb data;
d3177275 1727 struct ref_dir *packed = get_packed_refs(get_ref_cache(NULL));
432ad41e 1728 if (find_ref(packed, refname) == NULL)
c0277d15 1729 return 0;
d66da478
MH
1730 data.refname = refname;
1731 data.fd = hold_lock_file_for_update(&packlock, git_path("packed-refs"), 0);
1732 if (data.fd < 0) {
1b018fd9 1733 unable_to_lock_error(git_path("packed-refs"), errno);
c0277d15 1734 return error("cannot delete '%s' from packed refs", refname);
1b018fd9 1735 }
d3177275 1736 do_for_each_ref_in_dir(packed, 0, "", repack_without_ref_fn, 0, 0, &data);
c0277d15
JH
1737 return commit_lock_file(&packlock);
1738}
1739
eca35a25 1740int delete_ref(const char *refname, const unsigned char *sha1, int delopt)
c0277d15
JH
1741{
1742 struct ref_lock *lock;
eca35a25 1743 int err, i = 0, ret = 0, flag = 0;
c0277d15 1744
68db31cc 1745 lock = lock_ref_sha1_basic(refname, sha1, 0, &flag);
c0277d15
JH
1746 if (!lock)
1747 return 1;
045a476f 1748 if (!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) {
c0277d15 1749 /* loose */
eca35a25
MV
1750 const char *path;
1751
1752 if (!(delopt & REF_NODEREF)) {
1753 i = strlen(lock->lk->filename) - 5; /* .lock */
1754 lock->lk->filename[i] = 0;
1755 path = lock->lk->filename;
1756 } else {
9db56f71 1757 path = git_path("%s", refname);
eca35a25 1758 }
691f1a28
AR
1759 err = unlink_or_warn(path);
1760 if (err && errno != ENOENT)
c0277d15 1761 ret = 1;
691f1a28 1762
eca35a25
MV
1763 if (!(delopt & REF_NODEREF))
1764 lock->lk->filename[i] = '.';
c0277d15
JH
1765 }
1766 /* removing the loose one could have resurrected an earlier
1767 * packed one. Also, if it was not loose we need to repack
1768 * without it.
1769 */
1770 ret |= repack_without_ref(refname);
1771
691f1a28 1772 unlink_or_warn(git_path("logs/%s", lock->ref_name));
3870a0d1 1773 invalidate_ref_cache(NULL);
c0277d15
JH
1774 unlock_ref(lock);
1775 return ret;
4bd18c43
SP
1776}
1777
765c2258
PH
1778/*
1779 * People using contrib's git-new-workdir have .git/logs/refs ->
1780 * /some/other/path/.git/logs/refs, and that may live on another device.
1781 *
1782 * IOW, to avoid cross device rename errors, the temporary renamed log must
1783 * live into logs/refs.
1784 */
1785#define TMP_RENAMED_LOG "logs/refs/.tmp-renamed-log"
1786
dfefa935 1787int rename_ref(const char *oldrefname, const char *newrefname, const char *logmsg)
c976d415 1788{
c976d415
LH
1789 unsigned char sha1[20], orig_sha1[20];
1790 int flag = 0, logmoved = 0;
1791 struct ref_lock *lock;
c976d415 1792 struct stat loginfo;
dfefa935 1793 int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);
eca35a25 1794 const char *symref = NULL;
316b097a 1795 struct ref_cache *refs = get_ref_cache(NULL);
c976d415 1796
450d4c0f 1797 if (log && S_ISLNK(loginfo.st_mode))
dfefa935 1798 return error("reflog for %s is a symlink", oldrefname);
c976d415 1799
8d68493f 1800 symref = resolve_ref_unsafe(oldrefname, orig_sha1, 1, &flag);
eca35a25 1801 if (flag & REF_ISSYMREF)
fa58186c 1802 return error("refname %s is a symbolic ref, renaming it is not supported",
dfefa935 1803 oldrefname);
eca35a25 1804 if (!symref)
dfefa935 1805 return error("refname %s not found", oldrefname);
c976d415 1806
316b097a 1807 if (!is_refname_available(newrefname, oldrefname, get_packed_refs(refs)))
c976d415
LH
1808 return 1;
1809
316b097a 1810 if (!is_refname_available(newrefname, oldrefname, get_loose_refs(refs)))
c976d415
LH
1811 return 1;
1812
dfefa935 1813 if (log && rename(git_path("logs/%s", oldrefname), git_path(TMP_RENAMED_LOG)))
765c2258 1814 return error("unable to move logfile logs/%s to "TMP_RENAMED_LOG": %s",
dfefa935 1815 oldrefname, strerror(errno));
c976d415 1816
dfefa935
MH
1817 if (delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {
1818 error("unable to delete old %s", oldrefname);
c976d415
LH
1819 goto rollback;
1820 }
1821
dfefa935
MH
1822 if (!read_ref_full(newrefname, sha1, 1, &flag) &&
1823 delete_ref(newrefname, sha1, REF_NODEREF)) {
c976d415 1824 if (errno==EISDIR) {
dfefa935
MH
1825 if (remove_empty_directories(git_path("%s", newrefname))) {
1826 error("Directory not empty: %s", newrefname);
c976d415
LH
1827 goto rollback;
1828 }
1829 } else {
dfefa935 1830 error("unable to delete existing %s", newrefname);
c976d415
LH
1831 goto rollback;
1832 }
1833 }
1834
dfefa935
MH
1835 if (log && safe_create_leading_directories(git_path("logs/%s", newrefname))) {
1836 error("unable to create directory for %s", newrefname);
c976d415
LH
1837 goto rollback;
1838 }
1839
1840 retry:
dfefa935 1841 if (log && rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", newrefname))) {
d9e74d57
JR
1842 if (errno==EISDIR || errno==ENOTDIR) {
1843 /*
1844 * rename(a, b) when b is an existing
1845 * directory ought to result in ISDIR, but
1846 * Solaris 5.8 gives ENOTDIR. Sheesh.
1847 */
dfefa935
MH
1848 if (remove_empty_directories(git_path("logs/%s", newrefname))) {
1849 error("Directory not empty: logs/%s", newrefname);
c976d415
LH
1850 goto rollback;
1851 }
1852 goto retry;
1853 } else {
765c2258 1854 error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s: %s",
dfefa935 1855 newrefname, strerror(errno));
c976d415
LH
1856 goto rollback;
1857 }
1858 }
1859 logmoved = log;
1860
dfefa935 1861 lock = lock_ref_sha1_basic(newrefname, NULL, 0, NULL);
c976d415 1862 if (!lock) {
dfefa935 1863 error("unable to lock %s for update", newrefname);
c976d415
LH
1864 goto rollback;
1865 }
c976d415
LH
1866 lock->force_write = 1;
1867 hashcpy(lock->old_sha1, orig_sha1);
678d0f4c 1868 if (write_ref_sha1(lock, orig_sha1, logmsg)) {
dfefa935 1869 error("unable to write current sha1 into %s", newrefname);
c976d415
LH
1870 goto rollback;
1871 }
1872
1873 return 0;
1874
1875 rollback:
dfefa935 1876 lock = lock_ref_sha1_basic(oldrefname, NULL, 0, NULL);
c976d415 1877 if (!lock) {
dfefa935 1878 error("unable to lock %s for rollback", oldrefname);
c976d415
LH
1879 goto rollbacklog;
1880 }
1881
1882 lock->force_write = 1;
1883 flag = log_all_ref_updates;
1884 log_all_ref_updates = 0;
1885 if (write_ref_sha1(lock, orig_sha1, NULL))
dfefa935 1886 error("unable to write current sha1 into %s", oldrefname);
c976d415
LH
1887 log_all_ref_updates = flag;
1888
1889 rollbacklog:
dfefa935 1890 if (logmoved && rename(git_path("logs/%s", newrefname), git_path("logs/%s", oldrefname)))
c976d415 1891 error("unable to restore logfile %s from %s: %s",
dfefa935 1892 oldrefname, newrefname, strerror(errno));
c976d415 1893 if (!logmoved && log &&
dfefa935 1894 rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", oldrefname)))
765c2258 1895 error("unable to restore logfile %s from "TMP_RENAMED_LOG": %s",
dfefa935 1896 oldrefname, strerror(errno));
c976d415
LH
1897
1898 return 1;
1899}
1900
435fc852 1901int close_ref(struct ref_lock *lock)
b531394d
BC
1902{
1903 if (close_lock_file(lock->lk))
1904 return -1;
1905 lock->lock_fd = -1;
1906 return 0;
1907}
1908
435fc852 1909int commit_ref(struct ref_lock *lock)
b531394d
BC
1910{
1911 if (commit_lock_file(lock->lk))
1912 return -1;
1913 lock->lock_fd = -1;
1914 return 0;
1915}
1916
e5f38ec3 1917void unlock_ref(struct ref_lock *lock)
4bd18c43 1918{
4ed7cd3a
BC
1919 /* Do not free lock->lk -- atexit() still looks at them */
1920 if (lock->lk)
1921 rollback_lock_file(lock->lk);
434cd0cd 1922 free(lock->ref_name);
1655707c 1923 free(lock->orig_ref_name);
4bd18c43
SP
1924 free(lock);
1925}
1926
0ec29a47
JH
1927/*
1928 * copy the reflog message msg to buf, which has been allocated sufficiently
1929 * large, while cleaning up the whitespaces. Especially, convert LF to space,
1930 * because reflog file is one line per entry.
1931 */
1932static int copy_msg(char *buf, const char *msg)
1933{
1934 char *cp = buf;
1935 char c;
1936 int wasspace = 1;
1937
1938 *cp++ = '\t';
1939 while ((c = *msg++)) {
1940 if (wasspace && isspace(c))
1941 continue;
1942 wasspace = isspace(c);
1943 if (wasspace)
1944 c = ' ';
1945 *cp++ = c;
1946 }
1947 while (buf < cp && isspace(cp[-1]))
1948 cp--;
1949 *cp++ = '\n';
1950 return cp - buf;
1951}
1952
dfefa935 1953int log_ref_setup(const char *refname, char *logfile, int bufsize)
6de08ae6 1954{
859c3017 1955 int logfd, oflags = O_APPEND | O_WRONLY;
9a13f0b7 1956
dfefa935 1957 git_snpath(logfile, bufsize, "logs/%s", refname);
4057deb5 1958 if (log_all_ref_updates &&
dfefa935
MH
1959 (!prefixcmp(refname, "refs/heads/") ||
1960 !prefixcmp(refname, "refs/remotes/") ||
1961 !prefixcmp(refname, "refs/notes/") ||
1962 !strcmp(refname, "HEAD"))) {
157aaea5 1963 if (safe_create_leading_directories(logfile) < 0)
6de08ae6 1964 return error("unable to create directory for %s",
157aaea5 1965 logfile);
6de08ae6
SP
1966 oflags |= O_CREAT;
1967 }
1968
157aaea5 1969 logfd = open(logfile, oflags, 0666);
6de08ae6 1970 if (logfd < 0) {
1974bf62 1971 if (!(oflags & O_CREAT) && errno == ENOENT)
6de08ae6 1972 return 0;
3b463c3f
JH
1973
1974 if ((oflags & O_CREAT) && errno == EISDIR) {
157aaea5 1975 if (remove_empty_directories(logfile)) {
3b463c3f 1976 return error("There are still logs under '%s'",
157aaea5 1977 logfile);
3b463c3f 1978 }
157aaea5 1979 logfd = open(logfile, oflags, 0666);
3b463c3f
JH
1980 }
1981
1982 if (logfd < 0)
1983 return error("Unable to append to %s: %s",
157aaea5 1984 logfile, strerror(errno));
6de08ae6
SP
1985 }
1986
157aaea5 1987 adjust_shared_perm(logfile);
859c3017
EM
1988 close(logfd);
1989 return 0;
1990}
443b92b6 1991
dfefa935 1992static int log_ref_write(const char *refname, const unsigned char *old_sha1,
859c3017
EM
1993 const unsigned char *new_sha1, const char *msg)
1994{
1995 int logfd, result, written, oflags = O_APPEND | O_WRONLY;
1996 unsigned maxlen, len;
1997 int msglen;
157aaea5 1998 char log_file[PATH_MAX];
859c3017
EM
1999 char *logrec;
2000 const char *committer;
2001
2002 if (log_all_ref_updates < 0)
2003 log_all_ref_updates = !is_bare_repository();
2004
dfefa935 2005 result = log_ref_setup(refname, log_file, sizeof(log_file));
859c3017
EM
2006 if (result)
2007 return result;
2008
2009 logfd = open(log_file, oflags);
2010 if (logfd < 0)
2011 return 0;
0ec29a47 2012 msglen = msg ? strlen(msg) : 0;
774751a8 2013 committer = git_committer_info(0);
8ac65937
JH
2014 maxlen = strlen(committer) + msglen + 100;
2015 logrec = xmalloc(maxlen);
2016 len = sprintf(logrec, "%s %s %s\n",
9a13f0b7
NP
2017 sha1_to_hex(old_sha1),
2018 sha1_to_hex(new_sha1),
8ac65937
JH
2019 committer);
2020 if (msglen)
0ec29a47 2021 len += copy_msg(logrec + len - 1, msg) - 1;
93822c22 2022 written = len <= maxlen ? write_in_full(logfd, logrec, len) : -1;
6de08ae6 2023 free(logrec);
91c8d590 2024 if (close(logfd) != 0 || written != len)
9a13f0b7 2025 return error("Unable to append to %s", log_file);
6de08ae6
SP
2026 return 0;
2027}
2028
c3b0dec5
LT
2029static int is_branch(const char *refname)
2030{
2031 return !strcmp(refname, "HEAD") || !prefixcmp(refname, "refs/heads/");
2032}
2033
4bd18c43
SP
2034int write_ref_sha1(struct ref_lock *lock,
2035 const unsigned char *sha1, const char *logmsg)
2036{
2037 static char term = '\n';
c3b0dec5 2038 struct object *o;
4bd18c43
SP
2039
2040 if (!lock)
95fc7512 2041 return -1;
a89fccd2 2042 if (!lock->force_write && !hashcmp(lock->old_sha1, sha1)) {
4bd18c43
SP
2043 unlock_ref(lock);
2044 return 0;
95fc7512 2045 }
c3b0dec5
LT
2046 o = parse_object(sha1);
2047 if (!o) {
7be8b3ba 2048 error("Trying to write ref %s with nonexistent object %s",
c3b0dec5
LT
2049 lock->ref_name, sha1_to_hex(sha1));
2050 unlock_ref(lock);
2051 return -1;
2052 }
2053 if (o->type != OBJ_COMMIT && is_branch(lock->ref_name)) {
2054 error("Trying to write non-commit object %s to branch %s",
2055 sha1_to_hex(sha1), lock->ref_name);
2056 unlock_ref(lock);
2057 return -1;
2058 }
93822c22
AW
2059 if (write_in_full(lock->lock_fd, sha1_to_hex(sha1), 40) != 40 ||
2060 write_in_full(lock->lock_fd, &term, 1) != 1
b531394d 2061 || close_ref(lock) < 0) {
c33d5174 2062 error("Couldn't write %s", lock->lk->filename);
4bd18c43
SP
2063 unlock_ref(lock);
2064 return -1;
2065 }
8bf90dc9 2066 clear_loose_ref_cache(get_ref_cache(NULL));
bd104db1
NP
2067 if (log_ref_write(lock->ref_name, lock->old_sha1, sha1, logmsg) < 0 ||
2068 (strcmp(lock->ref_name, lock->orig_ref_name) &&
2069 log_ref_write(lock->orig_ref_name, lock->old_sha1, sha1, logmsg) < 0)) {
6de08ae6
SP
2070 unlock_ref(lock);
2071 return -1;
2072 }
605fac8b
NP
2073 if (strcmp(lock->orig_ref_name, "HEAD") != 0) {
2074 /*
2075 * Special hack: If a branch is updated directly and HEAD
2076 * points to it (may happen on the remote side of a push
2077 * for example) then logically the HEAD reflog should be
2078 * updated too.
2079 * A generic solution implies reverse symref information,
2080 * but finding all symrefs pointing to the given branch
2081 * would be rather costly for this rare event (the direct
2082 * update of a branch) to be worth it. So let's cheat and
2083 * check with HEAD only which should cover 99% of all usage
2084 * scenarios (even 100% of the default ones).
2085 */
2086 unsigned char head_sha1[20];
2087 int head_flag;
2088 const char *head_ref;
8cad4744 2089 head_ref = resolve_ref_unsafe("HEAD", head_sha1, 1, &head_flag);
605fac8b
NP
2090 if (head_ref && (head_flag & REF_ISSYMREF) &&
2091 !strcmp(head_ref, lock->ref_name))
2092 log_ref_write("HEAD", lock->old_sha1, sha1, logmsg);
2093 }
b531394d 2094 if (commit_ref(lock)) {
434cd0cd 2095 error("Couldn't set %s", lock->ref_name);
4bd18c43
SP
2096 unlock_ref(lock);
2097 return -1;
2098 }
4bd18c43
SP
2099 unlock_ref(lock);
2100 return 0;
95fc7512 2101}
d556fae2 2102
8b5157e4
NP
2103int create_symref(const char *ref_target, const char *refs_heads_master,
2104 const char *logmsg)
41b625b0
NP
2105{
2106 const char *lockpath;
2107 char ref[1000];
2108 int fd, len, written;
a4f34cbb 2109 char *git_HEAD = git_pathdup("%s", ref_target);
8b5157e4
NP
2110 unsigned char old_sha1[20], new_sha1[20];
2111
2112 if (logmsg && read_ref(ref_target, old_sha1))
2113 hashclr(old_sha1);
41b625b0 2114
d48744d1
JH
2115 if (safe_create_leading_directories(git_HEAD) < 0)
2116 return error("unable to create directory for %s", git_HEAD);
2117
41b625b0
NP
2118#ifndef NO_SYMLINK_HEAD
2119 if (prefer_symlink_refs) {
2120 unlink(git_HEAD);
2121 if (!symlink(refs_heads_master, git_HEAD))
8b5157e4 2122 goto done;
41b625b0
NP
2123 fprintf(stderr, "no symlink - falling back to symbolic ref\n");
2124 }
2125#endif
2126
2127 len = snprintf(ref, sizeof(ref), "ref: %s\n", refs_heads_master);
2128 if (sizeof(ref) <= len) {
2129 error("refname too long: %s", refs_heads_master);
47fc52e2 2130 goto error_free_return;
41b625b0
NP
2131 }
2132 lockpath = mkpath("%s.lock", git_HEAD);
2133 fd = open(lockpath, O_CREAT | O_EXCL | O_WRONLY, 0666);
2134 if (fd < 0) {
2135 error("Unable to open %s for writing", lockpath);
47fc52e2 2136 goto error_free_return;
41b625b0
NP
2137 }
2138 written = write_in_full(fd, ref, len);
91c8d590 2139 if (close(fd) != 0 || written != len) {
41b625b0 2140 error("Unable to write to %s", lockpath);
47fc52e2 2141 goto error_unlink_return;
41b625b0
NP
2142 }
2143 if (rename(lockpath, git_HEAD) < 0) {
41b625b0 2144 error("Unable to create %s", git_HEAD);
47fc52e2 2145 goto error_unlink_return;
41b625b0
NP
2146 }
2147 if (adjust_shared_perm(git_HEAD)) {
41b625b0 2148 error("Unable to fix permissions on %s", lockpath);
47fc52e2 2149 error_unlink_return:
691f1a28 2150 unlink_or_warn(lockpath);
47fc52e2
JH
2151 error_free_return:
2152 free(git_HEAD);
2153 return -1;
41b625b0 2154 }
8b5157e4 2155
ee96d11b 2156#ifndef NO_SYMLINK_HEAD
8b5157e4 2157 done:
ee96d11b 2158#endif
8b5157e4
NP
2159 if (logmsg && !read_ref(refs_heads_master, new_sha1))
2160 log_ref_write(ref_target, old_sha1, new_sha1, logmsg);
2161
47fc52e2 2162 free(git_HEAD);
41b625b0
NP
2163 return 0;
2164}
2165
16d7cc90
JH
2166static char *ref_msg(const char *line, const char *endp)
2167{
2168 const char *ep;
16d7cc90 2169 line += 82;
182af834
PH
2170 ep = memchr(line, '\n', endp - line);
2171 if (!ep)
2172 ep = endp;
2173 return xmemdupz(line, ep - line);
16d7cc90
JH
2174}
2175
dfefa935
MH
2176int read_ref_at(const char *refname, unsigned long at_time, int cnt,
2177 unsigned char *sha1, char **msg,
2178 unsigned long *cutoff_time, int *cutoff_tz, int *cutoff_cnt)
d556fae2 2179{
e5229042 2180 const char *logfile, *logdata, *logend, *rec, *lastgt, *lastrec;
d556fae2 2181 char *tz_c;
e29cb53a 2182 int logfd, tz, reccnt = 0;
d556fae2
SP
2183 struct stat st;
2184 unsigned long date;
e5229042 2185 unsigned char logged_sha1[20];
cb48cb58 2186 void *log_mapped;
dc49cd76 2187 size_t mapsz;
d556fae2 2188
dfefa935 2189 logfile = git_path("logs/%s", refname);
d556fae2
SP
2190 logfd = open(logfile, O_RDONLY, 0);
2191 if (logfd < 0)
d824cbba 2192 die_errno("Unable to read log '%s'", logfile);
d556fae2
SP
2193 fstat(logfd, &st);
2194 if (!st.st_size)
2195 die("Log %s is empty.", logfile);
dc49cd76
SP
2196 mapsz = xsize_t(st.st_size);
2197 log_mapped = xmmap(NULL, mapsz, PROT_READ, MAP_PRIVATE, logfd, 0);
cb48cb58 2198 logdata = log_mapped;
d556fae2
SP
2199 close(logfd);
2200
e5229042 2201 lastrec = NULL;
d556fae2
SP
2202 rec = logend = logdata + st.st_size;
2203 while (logdata < rec) {
e29cb53a 2204 reccnt++;
d556fae2
SP
2205 if (logdata < rec && *(rec-1) == '\n')
2206 rec--;
e5229042
SP
2207 lastgt = NULL;
2208 while (logdata < rec && *(rec-1) != '\n') {
d556fae2 2209 rec--;
e5229042
SP
2210 if (*rec == '>')
2211 lastgt = rec;
2212 }
2213 if (!lastgt)
d556fae2 2214 die("Log %s is corrupt.", logfile);
e5229042 2215 date = strtoul(lastgt + 1, &tz_c, 10);
ab2a1a32 2216 if (date <= at_time || cnt == 0) {
76a44c5c 2217 tz = strtoul(tz_c, NULL, 10);
16d7cc90
JH
2218 if (msg)
2219 *msg = ref_msg(rec, logend);
2220 if (cutoff_time)
2221 *cutoff_time = date;
2222 if (cutoff_tz)
2223 *cutoff_tz = tz;
2224 if (cutoff_cnt)
76a44c5c 2225 *cutoff_cnt = reccnt - 1;
e5229042
SP
2226 if (lastrec) {
2227 if (get_sha1_hex(lastrec, logged_sha1))
2228 die("Log %s is corrupt.", logfile);
2229 if (get_sha1_hex(rec + 41, sha1))
2230 die("Log %s is corrupt.", logfile);
a89fccd2 2231 if (hashcmp(logged_sha1, sha1)) {
edbc25c5 2232 warning("Log %s has gap after %s.",
73013afd 2233 logfile, show_date(date, tz, DATE_RFC2822));
e5229042 2234 }
e5f38ec3
JH
2235 }
2236 else if (date == at_time) {
e5229042
SP
2237 if (get_sha1_hex(rec + 41, sha1))
2238 die("Log %s is corrupt.", logfile);
e5f38ec3
JH
2239 }
2240 else {
e5229042
SP
2241 if (get_sha1_hex(rec + 41, logged_sha1))
2242 die("Log %s is corrupt.", logfile);
a89fccd2 2243 if (hashcmp(logged_sha1, sha1)) {
edbc25c5 2244 warning("Log %s unexpectedly ended on %s.",
73013afd 2245 logfile, show_date(date, tz, DATE_RFC2822));
e5229042
SP
2246 }
2247 }
dc49cd76 2248 munmap(log_mapped, mapsz);
d556fae2
SP
2249 return 0;
2250 }
e5229042 2251 lastrec = rec;
ab2a1a32
JH
2252 if (cnt > 0)
2253 cnt--;
d556fae2
SP
2254 }
2255
e5229042
SP
2256 rec = logdata;
2257 while (rec < logend && *rec != '>' && *rec != '\n')
2258 rec++;
2259 if (rec == logend || *rec == '\n')
d556fae2 2260 die("Log %s is corrupt.", logfile);
e5229042 2261 date = strtoul(rec + 1, &tz_c, 10);
d556fae2
SP
2262 tz = strtoul(tz_c, NULL, 10);
2263 if (get_sha1_hex(logdata, sha1))
2264 die("Log %s is corrupt.", logfile);
d1a4489a
JK
2265 if (is_null_sha1(sha1)) {
2266 if (get_sha1_hex(logdata + 41, sha1))
2267 die("Log %s is corrupt.", logfile);
2268 }
16d7cc90
JH
2269 if (msg)
2270 *msg = ref_msg(logdata, logend);
dc49cd76 2271 munmap(log_mapped, mapsz);
16d7cc90
JH
2272
2273 if (cutoff_time)
2274 *cutoff_time = date;
2275 if (cutoff_tz)
2276 *cutoff_tz = tz;
2277 if (cutoff_cnt)
2278 *cutoff_cnt = reccnt;
2279 return 1;
d556fae2 2280}
2ff81662 2281
dfefa935 2282int for_each_recent_reflog_ent(const char *refname, each_reflog_ent_fn fn, long ofs, void *cb_data)
2ff81662
JH
2283{
2284 const char *logfile;
2285 FILE *logfp;
8ca78803 2286 struct strbuf sb = STRBUF_INIT;
2266bf27 2287 int ret = 0;
2ff81662 2288
dfefa935 2289 logfile = git_path("logs/%s", refname);
2ff81662
JH
2290 logfp = fopen(logfile, "r");
2291 if (!logfp)
883d60fa 2292 return -1;
101d15e0
JH
2293
2294 if (ofs) {
2295 struct stat statbuf;
2296 if (fstat(fileno(logfp), &statbuf) ||
2297 statbuf.st_size < ofs ||
2298 fseek(logfp, -ofs, SEEK_END) ||
8ca78803 2299 strbuf_getwholeline(&sb, logfp, '\n')) {
9d33f7c2 2300 fclose(logfp);
8ca78803 2301 strbuf_release(&sb);
101d15e0 2302 return -1;
9d33f7c2 2303 }
101d15e0
JH
2304 }
2305
8ca78803 2306 while (!strbuf_getwholeline(&sb, logfp, '\n')) {
2ff81662 2307 unsigned char osha1[20], nsha1[20];
883d60fa
JS
2308 char *email_end, *message;
2309 unsigned long timestamp;
8ca78803 2310 int tz;
2ff81662
JH
2311
2312 /* old SP new SP name <email> SP time TAB msg LF */
8ca78803
RS
2313 if (sb.len < 83 || sb.buf[sb.len - 1] != '\n' ||
2314 get_sha1_hex(sb.buf, osha1) || sb.buf[40] != ' ' ||
2315 get_sha1_hex(sb.buf + 41, nsha1) || sb.buf[81] != ' ' ||
2316 !(email_end = strchr(sb.buf + 82, '>')) ||
883d60fa
JS
2317 email_end[1] != ' ' ||
2318 !(timestamp = strtoul(email_end + 2, &message, 10)) ||
2319 !message || message[0] != ' ' ||
2320 (message[1] != '+' && message[1] != '-') ||
2321 !isdigit(message[2]) || !isdigit(message[3]) ||
b4dd4856 2322 !isdigit(message[4]) || !isdigit(message[5]))
2ff81662 2323 continue; /* corrupt? */
883d60fa
JS
2324 email_end[1] = '\0';
2325 tz = strtol(message + 1, NULL, 10);
b4dd4856
JS
2326 if (message[6] != '\t')
2327 message += 6;
2328 else
2329 message += 7;
8ca78803
RS
2330 ret = fn(osha1, nsha1, sb.buf + 82, timestamp, tz, message,
2331 cb_data);
883d60fa 2332 if (ret)
2266bf27 2333 break;
2ff81662
JH
2334 }
2335 fclose(logfp);
8ca78803 2336 strbuf_release(&sb);
2266bf27 2337 return ret;
2ff81662 2338}
e29cb53a 2339
dfefa935 2340int for_each_reflog_ent(const char *refname, each_reflog_ent_fn fn, void *cb_data)
101d15e0 2341{
dfefa935 2342 return for_each_recent_reflog_ent(refname, fn, 0, cb_data);
101d15e0
JH
2343}
2344
989c0e5d
MH
2345/*
2346 * Call fn for each reflog in the namespace indicated by name. name
2347 * must be empty or end with '/'. Name will be used as a scratch
2348 * space, but its contents will be restored before return.
2349 */
2350static int do_for_each_reflog(struct strbuf *name, each_ref_fn fn, void *cb_data)
eb8381c8 2351{
989c0e5d 2352 DIR *d = opendir(git_path("logs/%s", name->buf));
fcee5a14 2353 int retval = 0;
93c603fc 2354 struct dirent *de;
989c0e5d 2355 int oldlen = name->len;
eb8381c8 2356
93c603fc 2357 if (!d)
989c0e5d 2358 return name->len ? errno : 0;
eb8381c8 2359
93c603fc
MH
2360 while ((de = readdir(d)) != NULL) {
2361 struct stat st;
eb8381c8 2362
93c603fc
MH
2363 if (de->d_name[0] == '.')
2364 continue;
93c603fc
MH
2365 if (has_extension(de->d_name, ".lock"))
2366 continue;
989c0e5d
MH
2367 strbuf_addstr(name, de->d_name);
2368 if (stat(git_path("logs/%s", name->buf), &st) < 0) {
2369 ; /* silently ignore */
93c603fc 2370 } else {
eb8381c8 2371 if (S_ISDIR(st.st_mode)) {
989c0e5d
MH
2372 strbuf_addch(name, '/');
2373 retval = do_for_each_reflog(name, fn, cb_data);
eb8381c8
NP
2374 } else {
2375 unsigned char sha1[20];
989c0e5d
MH
2376 if (read_ref_full(name->buf, sha1, 0, NULL))
2377 retval = error("bad ref for %s", name->buf);
eb8381c8 2378 else
989c0e5d 2379 retval = fn(name->buf, sha1, 0, cb_data);
eb8381c8
NP
2380 }
2381 if (retval)
2382 break;
2383 }
989c0e5d 2384 strbuf_setlen(name, oldlen);
eb8381c8 2385 }
93c603fc 2386 closedir(d);
eb8381c8
NP
2387 return retval;
2388}
2389
2390int for_each_reflog(each_ref_fn fn, void *cb_data)
2391{
989c0e5d
MH
2392 int retval;
2393 struct strbuf name;
2394 strbuf_init(&name, PATH_MAX);
2395 retval = do_for_each_reflog(&name, fn, cb_data);
2396 strbuf_release(&name);
2397 return retval;
eb8381c8 2398}
3d9f037c
CR
2399
2400int update_ref(const char *action, const char *refname,
2401 const unsigned char *sha1, const unsigned char *oldval,
2402 int flags, enum action_on_err onerr)
2403{
2404 static struct ref_lock *lock;
2405 lock = lock_any_ref_for_update(refname, oldval, flags);
2406 if (!lock) {
2407 const char *str = "Cannot lock the ref '%s'.";
2408 switch (onerr) {
2409 case MSG_ON_ERR: error(str, refname); break;
2410 case DIE_ON_ERR: die(str, refname); break;
2411 case QUIET_ON_ERR: break;
2412 }
2413 return 1;
2414 }
2415 if (write_ref_sha1(lock, sha1, action) < 0) {
2416 const char *str = "Cannot update the ref '%s'.";
2417 switch (onerr) {
2418 case MSG_ON_ERR: error(str, refname); break;
2419 case DIE_ON_ERR: die(str, refname); break;
2420 case QUIET_ON_ERR: break;
2421 }
2422 return 1;
2423 }
2424 return 0;
2425}
cda69f48 2426
5483f799 2427struct ref *find_ref_by_name(const struct ref *list, const char *name)
cda69f48
JK
2428{
2429 for ( ; list; list = list->next)
2430 if (!strcmp(list->name, name))
5483f799 2431 return (struct ref *)list;
cda69f48
JK
2432 return NULL;
2433}
7c2b3029
JK
2434
2435/*
2436 * generate a format suitable for scanf from a ref_rev_parse_rules
2437 * rule, that is replace the "%.*s" spec with a "%s" spec
2438 */
2439static void gen_scanf_fmt(char *scanf_fmt, const char *rule)
2440{
2441 char *spec;
2442
2443 spec = strstr(rule, "%.*s");
2444 if (!spec || strstr(spec + 4, "%.*s"))
2445 die("invalid rule in ref_rev_parse_rules: %s", rule);
2446
2447 /* copy all until spec */
2448 strncpy(scanf_fmt, rule, spec - rule);
2449 scanf_fmt[spec - rule] = '\0';
2450 /* copy new spec */
2451 strcat(scanf_fmt, "%s");
2452 /* copy remaining rule */
2453 strcat(scanf_fmt, spec + 4);
2454
2455 return;
2456}
2457
dfefa935 2458char *shorten_unambiguous_ref(const char *refname, int strict)
7c2b3029
JK
2459{
2460 int i;
2461 static char **scanf_fmts;
2462 static int nr_rules;
2463 char *short_name;
2464
2465 /* pre generate scanf formats from ref_rev_parse_rules[] */
2466 if (!nr_rules) {
2467 size_t total_len = 0;
2468
2469 /* the rule list is NULL terminated, count them first */
2470 for (; ref_rev_parse_rules[nr_rules]; nr_rules++)
2471 /* no +1 because strlen("%s") < strlen("%.*s") */
2472 total_len += strlen(ref_rev_parse_rules[nr_rules]);
2473
2474 scanf_fmts = xmalloc(nr_rules * sizeof(char *) + total_len);
2475
2476 total_len = 0;
2477 for (i = 0; i < nr_rules; i++) {
2478 scanf_fmts[i] = (char *)&scanf_fmts[nr_rules]
2479 + total_len;
2480 gen_scanf_fmt(scanf_fmts[i], ref_rev_parse_rules[i]);
2481 total_len += strlen(ref_rev_parse_rules[i]);
2482 }
2483 }
2484
2485 /* bail out if there are no rules */
2486 if (!nr_rules)
dfefa935 2487 return xstrdup(refname);
7c2b3029 2488
dfefa935
MH
2489 /* buffer for scanf result, at most refname must fit */
2490 short_name = xstrdup(refname);
7c2b3029
JK
2491
2492 /* skip first rule, it will always match */
2493 for (i = nr_rules - 1; i > 0 ; --i) {
2494 int j;
6e7b3309 2495 int rules_to_fail = i;
7c2b3029
JK
2496 int short_name_len;
2497
dfefa935 2498 if (1 != sscanf(refname, scanf_fmts[i], short_name))
7c2b3029
JK
2499 continue;
2500
2501 short_name_len = strlen(short_name);
2502
6e7b3309
BW
2503 /*
2504 * in strict mode, all (except the matched one) rules
2505 * must fail to resolve to a valid non-ambiguous ref
2506 */
2507 if (strict)
2508 rules_to_fail = nr_rules;
2509
7c2b3029
JK
2510 /*
2511 * check if the short name resolves to a valid ref,
2512 * but use only rules prior to the matched one
2513 */
6e7b3309 2514 for (j = 0; j < rules_to_fail; j++) {
7c2b3029 2515 const char *rule = ref_rev_parse_rules[j];
7c2b3029
JK
2516 char refname[PATH_MAX];
2517
6e7b3309
BW
2518 /* skip matched rule */
2519 if (i == j)
2520 continue;
2521
7c2b3029
JK
2522 /*
2523 * the short name is ambiguous, if it resolves
2524 * (with this previous rule) to a valid ref
2525 * read_ref() returns 0 on success
2526 */
2527 mksnpath(refname, sizeof(refname),
2528 rule, short_name_len, short_name);
c6893323 2529 if (ref_exists(refname))
7c2b3029
JK
2530 break;
2531 }
2532
2533 /*
2534 * short name is non-ambiguous if all previous rules
2535 * haven't resolved to a valid ref
2536 */
6e7b3309 2537 if (j == rules_to_fail)
7c2b3029
JK
2538 return short_name;
2539 }
2540
2541 free(short_name);
dfefa935 2542 return xstrdup(refname);
7c2b3029 2543}