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