]> git.ipfire.org Git - thirdparty/git.git/blob - refs.c
treewide: remove unnecessary cache.h inclusion from a few headers
[thirdparty/git.git] / refs.c
1 /*
2 * The backend-independent part of the reference module.
3 */
4
5 #include "cache.h"
6 #include "alloc.h"
7 #include "config.h"
8 #include "hashmap.h"
9 #include "hex.h"
10 #include "lockfile.h"
11 #include "iterator.h"
12 #include "refs.h"
13 #include "refs/refs-internal.h"
14 #include "run-command.h"
15 #include "hook.h"
16 #include "object-store.h"
17 #include "object.h"
18 #include "tag.h"
19 #include "submodule.h"
20 #include "worktree.h"
21 #include "strvec.h"
22 #include "repository.h"
23 #include "sigchain.h"
24 #include "date.h"
25 #include "commit.h"
26
27 /*
28 * List of all available backends
29 */
30 static struct ref_storage_be *refs_backends = &refs_be_files;
31
32 static struct ref_storage_be *find_ref_storage_backend(const char *name)
33 {
34 struct ref_storage_be *be;
35 for (be = refs_backends; be; be = be->next)
36 if (!strcmp(be->name, name))
37 return be;
38 return NULL;
39 }
40
41 /*
42 * How to handle various characters in refnames:
43 * 0: An acceptable character for refs
44 * 1: End-of-component
45 * 2: ., look for a preceding . to reject .. in refs
46 * 3: {, look for a preceding @ to reject @{ in refs
47 * 4: A bad character: ASCII control characters, and
48 * ":", "?", "[", "\", "^", "~", SP, or TAB
49 * 5: *, reject unless REFNAME_REFSPEC_PATTERN is set
50 */
51 static unsigned char refname_disposition[256] = {
52 1, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
53 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
54 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 2, 1,
55 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 4,
56 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
57 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 4, 0, 4, 0,
58 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
59 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 4, 4
60 };
61
62 struct ref_namespace_info ref_namespace[] = {
63 [NAMESPACE_HEAD] = {
64 .ref = "HEAD",
65 .decoration = DECORATION_REF_HEAD,
66 .exact = 1,
67 },
68 [NAMESPACE_BRANCHES] = {
69 .ref = "refs/heads/",
70 .decoration = DECORATION_REF_LOCAL,
71 },
72 [NAMESPACE_TAGS] = {
73 .ref = "refs/tags/",
74 .decoration = DECORATION_REF_TAG,
75 },
76 [NAMESPACE_REMOTE_REFS] = {
77 /*
78 * The default refspec for new remotes copies refs from
79 * refs/heads/ on the remote into refs/remotes/<remote>/.
80 * As such, "refs/remotes/" has special handling.
81 */
82 .ref = "refs/remotes/",
83 .decoration = DECORATION_REF_REMOTE,
84 },
85 [NAMESPACE_STASH] = {
86 /*
87 * The single ref "refs/stash" stores the latest stash.
88 * Older stashes can be found in the reflog.
89 */
90 .ref = "refs/stash",
91 .exact = 1,
92 .decoration = DECORATION_REF_STASH,
93 },
94 [NAMESPACE_REPLACE] = {
95 /*
96 * This namespace allows Git to act as if one object ID
97 * points to the content of another. Unlike the other
98 * ref namespaces, this one can be changed by the
99 * GIT_REPLACE_REF_BASE environment variable. This
100 * .namespace value will be overwritten in setup_git_env().
101 */
102 .ref = "refs/replace/",
103 .decoration = DECORATION_GRAFTED,
104 },
105 [NAMESPACE_NOTES] = {
106 /*
107 * The refs/notes/commit ref points to the tip of a
108 * parallel commit history that adds metadata to commits
109 * in the normal history. This ref can be overwritten
110 * by the core.notesRef config variable or the
111 * GIT_NOTES_REFS environment variable.
112 */
113 .ref = "refs/notes/commit",
114 .exact = 1,
115 },
116 [NAMESPACE_PREFETCH] = {
117 /*
118 * Prefetch refs are written by the background 'fetch'
119 * maintenance task. It allows faster foreground fetches
120 * by advertising these previously-downloaded tips without
121 * updating refs/remotes/ without user intervention.
122 */
123 .ref = "refs/prefetch/",
124 },
125 [NAMESPACE_REWRITTEN] = {
126 /*
127 * Rewritten refs are used by the 'label' command in the
128 * sequencer. These are particularly useful during an
129 * interactive rebase that uses the 'merge' command.
130 */
131 .ref = "refs/rewritten/",
132 },
133 };
134
135 void update_ref_namespace(enum ref_namespace namespace, char *ref)
136 {
137 struct ref_namespace_info *info = &ref_namespace[namespace];
138 if (info->ref_updated)
139 free(info->ref);
140 info->ref = ref;
141 info->ref_updated = 1;
142 }
143
144 /*
145 * Try to read one refname component from the front of refname.
146 * Return the length of the component found, or -1 if the component is
147 * not legal. It is legal if it is something reasonable to have under
148 * ".git/refs/"; We do not like it if:
149 *
150 * - it begins with ".", or
151 * - it has double dots "..", or
152 * - it has ASCII control characters, or
153 * - it has ":", "?", "[", "\", "^", "~", SP, or TAB anywhere, or
154 * - it has "*" anywhere unless REFNAME_REFSPEC_PATTERN is set, or
155 * - it ends with a "/", or
156 * - it ends with ".lock", or
157 * - it contains a "@{" portion
158 *
159 * When sanitized is not NULL, instead of rejecting the input refname
160 * as an error, try to come up with a usable replacement for the input
161 * refname in it.
162 */
163 static int check_refname_component(const char *refname, int *flags,
164 struct strbuf *sanitized)
165 {
166 const char *cp;
167 char last = '\0';
168 size_t component_start = 0; /* garbage - not a reasonable initial value */
169
170 if (sanitized)
171 component_start = sanitized->len;
172
173 for (cp = refname; ; cp++) {
174 int ch = *cp & 255;
175 unsigned char disp = refname_disposition[ch];
176
177 if (sanitized && disp != 1)
178 strbuf_addch(sanitized, ch);
179
180 switch (disp) {
181 case 1:
182 goto out;
183 case 2:
184 if (last == '.') { /* Refname contains "..". */
185 if (sanitized)
186 /* collapse ".." to single "." */
187 strbuf_setlen(sanitized, sanitized->len - 1);
188 else
189 return -1;
190 }
191 break;
192 case 3:
193 if (last == '@') { /* Refname contains "@{". */
194 if (sanitized)
195 sanitized->buf[sanitized->len-1] = '-';
196 else
197 return -1;
198 }
199 break;
200 case 4:
201 /* forbidden char */
202 if (sanitized)
203 sanitized->buf[sanitized->len-1] = '-';
204 else
205 return -1;
206 break;
207 case 5:
208 if (!(*flags & REFNAME_REFSPEC_PATTERN)) {
209 /* refspec can't be a pattern */
210 if (sanitized)
211 sanitized->buf[sanitized->len-1] = '-';
212 else
213 return -1;
214 }
215
216 /*
217 * Unset the pattern flag so that we only accept
218 * a single asterisk for one side of refspec.
219 */
220 *flags &= ~ REFNAME_REFSPEC_PATTERN;
221 break;
222 }
223 last = ch;
224 }
225 out:
226 if (cp == refname)
227 return 0; /* Component has zero length. */
228
229 if (refname[0] == '.') { /* Component starts with '.'. */
230 if (sanitized)
231 sanitized->buf[component_start] = '-';
232 else
233 return -1;
234 }
235 if (cp - refname >= LOCK_SUFFIX_LEN &&
236 !memcmp(cp - LOCK_SUFFIX_LEN, LOCK_SUFFIX, LOCK_SUFFIX_LEN)) {
237 if (!sanitized)
238 return -1;
239 /* Refname ends with ".lock". */
240 while (strbuf_strip_suffix(sanitized, LOCK_SUFFIX)) {
241 /* try again in case we have .lock.lock */
242 }
243 }
244 return cp - refname;
245 }
246
247 static int check_or_sanitize_refname(const char *refname, int flags,
248 struct strbuf *sanitized)
249 {
250 int component_len, component_count = 0;
251
252 if (!strcmp(refname, "@")) {
253 /* Refname is a single character '@'. */
254 if (sanitized)
255 strbuf_addch(sanitized, '-');
256 else
257 return -1;
258 }
259
260 while (1) {
261 if (sanitized && sanitized->len)
262 strbuf_complete(sanitized, '/');
263
264 /* We are at the start of a path component. */
265 component_len = check_refname_component(refname, &flags,
266 sanitized);
267 if (sanitized && component_len == 0)
268 ; /* OK, omit empty component */
269 else if (component_len <= 0)
270 return -1;
271
272 component_count++;
273 if (refname[component_len] == '\0')
274 break;
275 /* Skip to next component. */
276 refname += component_len + 1;
277 }
278
279 if (refname[component_len - 1] == '.') {
280 /* Refname ends with '.'. */
281 if (sanitized)
282 ; /* omit ending dot */
283 else
284 return -1;
285 }
286 if (!(flags & REFNAME_ALLOW_ONELEVEL) && component_count < 2)
287 return -1; /* Refname has only one component. */
288 return 0;
289 }
290
291 int check_refname_format(const char *refname, int flags)
292 {
293 return check_or_sanitize_refname(refname, flags, NULL);
294 }
295
296 void sanitize_refname_component(const char *refname, struct strbuf *out)
297 {
298 if (check_or_sanitize_refname(refname, REFNAME_ALLOW_ONELEVEL, out))
299 BUG("sanitizing refname '%s' check returned error", refname);
300 }
301
302 int refname_is_safe(const char *refname)
303 {
304 const char *rest;
305
306 if (skip_prefix(refname, "refs/", &rest)) {
307 char *buf;
308 int result;
309 size_t restlen = strlen(rest);
310
311 /* rest must not be empty, or start or end with "/" */
312 if (!restlen || *rest == '/' || rest[restlen - 1] == '/')
313 return 0;
314
315 /*
316 * Does the refname try to escape refs/?
317 * For example: refs/foo/../bar is safe but refs/foo/../../bar
318 * is not.
319 */
320 buf = xmallocz(restlen);
321 result = !normalize_path_copy(buf, rest) && !strcmp(buf, rest);
322 free(buf);
323 return result;
324 }
325
326 do {
327 if (!isupper(*refname) && *refname != '_')
328 return 0;
329 refname++;
330 } while (*refname);
331 return 1;
332 }
333
334 /*
335 * Return true if refname, which has the specified oid and flags, can
336 * be resolved to an object in the database. If the referred-to object
337 * does not exist, emit a warning and return false.
338 */
339 int ref_resolves_to_object(const char *refname,
340 struct repository *repo,
341 const struct object_id *oid,
342 unsigned int flags)
343 {
344 if (flags & REF_ISBROKEN)
345 return 0;
346 if (!repo_has_object_file(repo, oid)) {
347 error(_("%s does not point to a valid object!"), refname);
348 return 0;
349 }
350 return 1;
351 }
352
353 char *refs_resolve_refdup(struct ref_store *refs,
354 const char *refname, int resolve_flags,
355 struct object_id *oid, int *flags)
356 {
357 const char *result;
358
359 result = refs_resolve_ref_unsafe(refs, refname, resolve_flags,
360 oid, flags);
361 return xstrdup_or_null(result);
362 }
363
364 char *resolve_refdup(const char *refname, int resolve_flags,
365 struct object_id *oid, int *flags)
366 {
367 return refs_resolve_refdup(get_main_ref_store(the_repository),
368 refname, resolve_flags,
369 oid, flags);
370 }
371
372 /* The argument to filter_refs */
373 struct ref_filter {
374 const char *pattern;
375 const char *prefix;
376 each_ref_fn *fn;
377 void *cb_data;
378 };
379
380 int read_ref_full(const char *refname, int resolve_flags, struct object_id *oid, int *flags)
381 {
382 struct ref_store *refs = get_main_ref_store(the_repository);
383
384 if (refs_resolve_ref_unsafe(refs, refname, resolve_flags,
385 oid, flags))
386 return 0;
387 return -1;
388 }
389
390 int read_ref(const char *refname, struct object_id *oid)
391 {
392 return read_ref_full(refname, RESOLVE_REF_READING, oid, NULL);
393 }
394
395 int refs_ref_exists(struct ref_store *refs, const char *refname)
396 {
397 return !!refs_resolve_ref_unsafe(refs, refname, RESOLVE_REF_READING,
398 NULL, NULL);
399 }
400
401 int ref_exists(const char *refname)
402 {
403 return refs_ref_exists(get_main_ref_store(the_repository), refname);
404 }
405
406 static int filter_refs(const char *refname, const struct object_id *oid,
407 int flags, void *data)
408 {
409 struct ref_filter *filter = (struct ref_filter *)data;
410
411 if (wildmatch(filter->pattern, refname, 0))
412 return 0;
413 if (filter->prefix)
414 skip_prefix(refname, filter->prefix, &refname);
415 return filter->fn(refname, oid, flags, filter->cb_data);
416 }
417
418 enum peel_status peel_object(const struct object_id *name, struct object_id *oid)
419 {
420 struct object *o = lookup_unknown_object(the_repository, name);
421
422 if (o->type == OBJ_NONE) {
423 int type = oid_object_info(the_repository, name, NULL);
424 if (type < 0 || !object_as_type(o, type, 0))
425 return PEEL_INVALID;
426 }
427
428 if (o->type != OBJ_TAG)
429 return PEEL_NON_TAG;
430
431 o = deref_tag_noverify(o);
432 if (!o)
433 return PEEL_INVALID;
434
435 oidcpy(oid, &o->oid);
436 return PEEL_PEELED;
437 }
438
439 struct warn_if_dangling_data {
440 FILE *fp;
441 const char *refname;
442 const struct string_list *refnames;
443 const char *msg_fmt;
444 };
445
446 static int warn_if_dangling_symref(const char *refname,
447 const struct object_id *oid UNUSED,
448 int flags, void *cb_data)
449 {
450 struct warn_if_dangling_data *d = cb_data;
451 const char *resolves_to;
452
453 if (!(flags & REF_ISSYMREF))
454 return 0;
455
456 resolves_to = resolve_ref_unsafe(refname, 0, NULL, NULL);
457 if (!resolves_to
458 || (d->refname
459 ? strcmp(resolves_to, d->refname)
460 : !string_list_has_string(d->refnames, resolves_to))) {
461 return 0;
462 }
463
464 fprintf(d->fp, d->msg_fmt, refname);
465 fputc('\n', d->fp);
466 return 0;
467 }
468
469 void warn_dangling_symref(FILE *fp, const char *msg_fmt, const char *refname)
470 {
471 struct warn_if_dangling_data data;
472
473 data.fp = fp;
474 data.refname = refname;
475 data.refnames = NULL;
476 data.msg_fmt = msg_fmt;
477 for_each_rawref(warn_if_dangling_symref, &data);
478 }
479
480 void warn_dangling_symrefs(FILE *fp, const char *msg_fmt, const struct string_list *refnames)
481 {
482 struct warn_if_dangling_data data;
483
484 data.fp = fp;
485 data.refname = NULL;
486 data.refnames = refnames;
487 data.msg_fmt = msg_fmt;
488 for_each_rawref(warn_if_dangling_symref, &data);
489 }
490
491 int refs_for_each_tag_ref(struct ref_store *refs, each_ref_fn fn, void *cb_data)
492 {
493 return refs_for_each_ref_in(refs, "refs/tags/", fn, cb_data);
494 }
495
496 int for_each_tag_ref(each_ref_fn fn, void *cb_data)
497 {
498 return refs_for_each_tag_ref(get_main_ref_store(the_repository), fn, cb_data);
499 }
500
501 int refs_for_each_branch_ref(struct ref_store *refs, each_ref_fn fn, void *cb_data)
502 {
503 return refs_for_each_ref_in(refs, "refs/heads/", fn, cb_data);
504 }
505
506 int for_each_branch_ref(each_ref_fn fn, void *cb_data)
507 {
508 return refs_for_each_branch_ref(get_main_ref_store(the_repository), fn, cb_data);
509 }
510
511 int refs_for_each_remote_ref(struct ref_store *refs, each_ref_fn fn, void *cb_data)
512 {
513 return refs_for_each_ref_in(refs, "refs/remotes/", fn, cb_data);
514 }
515
516 int for_each_remote_ref(each_ref_fn fn, void *cb_data)
517 {
518 return refs_for_each_remote_ref(get_main_ref_store(the_repository), fn, cb_data);
519 }
520
521 int head_ref_namespaced(each_ref_fn fn, void *cb_data)
522 {
523 struct strbuf buf = STRBUF_INIT;
524 int ret = 0;
525 struct object_id oid;
526 int flag;
527
528 strbuf_addf(&buf, "%sHEAD", get_git_namespace());
529 if (!read_ref_full(buf.buf, RESOLVE_REF_READING, &oid, &flag))
530 ret = fn(buf.buf, &oid, flag, cb_data);
531 strbuf_release(&buf);
532
533 return ret;
534 }
535
536 void normalize_glob_ref(struct string_list_item *item, const char *prefix,
537 const char *pattern)
538 {
539 struct strbuf normalized_pattern = STRBUF_INIT;
540
541 if (*pattern == '/')
542 BUG("pattern must not start with '/'");
543
544 if (prefix)
545 strbuf_addstr(&normalized_pattern, prefix);
546 else if (!starts_with(pattern, "refs/") &&
547 strcmp(pattern, "HEAD"))
548 strbuf_addstr(&normalized_pattern, "refs/");
549 /*
550 * NEEDSWORK: Special case other symrefs such as REBASE_HEAD,
551 * MERGE_HEAD, etc.
552 */
553
554 strbuf_addstr(&normalized_pattern, pattern);
555 strbuf_strip_suffix(&normalized_pattern, "/");
556
557 item->string = strbuf_detach(&normalized_pattern, NULL);
558 item->util = has_glob_specials(pattern) ? NULL : item->string;
559 strbuf_release(&normalized_pattern);
560 }
561
562 int for_each_glob_ref_in(each_ref_fn fn, const char *pattern,
563 const char *prefix, void *cb_data)
564 {
565 struct strbuf real_pattern = STRBUF_INIT;
566 struct ref_filter filter;
567 int ret;
568
569 if (!prefix && !starts_with(pattern, "refs/"))
570 strbuf_addstr(&real_pattern, "refs/");
571 else if (prefix)
572 strbuf_addstr(&real_pattern, prefix);
573 strbuf_addstr(&real_pattern, pattern);
574
575 if (!has_glob_specials(pattern)) {
576 /* Append implied '/' '*' if not present. */
577 strbuf_complete(&real_pattern, '/');
578 /* No need to check for '*', there is none. */
579 strbuf_addch(&real_pattern, '*');
580 }
581
582 filter.pattern = real_pattern.buf;
583 filter.prefix = prefix;
584 filter.fn = fn;
585 filter.cb_data = cb_data;
586 ret = for_each_ref(filter_refs, &filter);
587
588 strbuf_release(&real_pattern);
589 return ret;
590 }
591
592 int for_each_glob_ref(each_ref_fn fn, const char *pattern, void *cb_data)
593 {
594 return for_each_glob_ref_in(fn, pattern, NULL, cb_data);
595 }
596
597 const char *prettify_refname(const char *name)
598 {
599 if (skip_prefix(name, "refs/heads/", &name) ||
600 skip_prefix(name, "refs/tags/", &name) ||
601 skip_prefix(name, "refs/remotes/", &name))
602 ; /* nothing */
603 return name;
604 }
605
606 static const char *ref_rev_parse_rules[] = {
607 "%.*s",
608 "refs/%.*s",
609 "refs/tags/%.*s",
610 "refs/heads/%.*s",
611 "refs/remotes/%.*s",
612 "refs/remotes/%.*s/HEAD",
613 NULL
614 };
615
616 #define NUM_REV_PARSE_RULES (ARRAY_SIZE(ref_rev_parse_rules) - 1)
617
618 /*
619 * Is it possible that the caller meant full_name with abbrev_name?
620 * If so return a non-zero value to signal "yes"; the magnitude of
621 * the returned value gives the precedence used for disambiguation.
622 *
623 * If abbrev_name cannot mean full_name, return 0.
624 */
625 int refname_match(const char *abbrev_name, const char *full_name)
626 {
627 const char **p;
628 const int abbrev_name_len = strlen(abbrev_name);
629 const int num_rules = NUM_REV_PARSE_RULES;
630
631 for (p = ref_rev_parse_rules; *p; p++)
632 if (!strcmp(full_name, mkpath(*p, abbrev_name_len, abbrev_name)))
633 return &ref_rev_parse_rules[num_rules] - p;
634
635 return 0;
636 }
637
638 /*
639 * Given a 'prefix' expand it by the rules in 'ref_rev_parse_rules' and add
640 * the results to 'prefixes'
641 */
642 void expand_ref_prefix(struct strvec *prefixes, const char *prefix)
643 {
644 const char **p;
645 int len = strlen(prefix);
646
647 for (p = ref_rev_parse_rules; *p; p++)
648 strvec_pushf(prefixes, *p, len, prefix);
649 }
650
651 static const char default_branch_name_advice[] = N_(
652 "Using '%s' as the name for the initial branch. This default branch name\n"
653 "is subject to change. To configure the initial branch name to use in all\n"
654 "of your new repositories, which will suppress this warning, call:\n"
655 "\n"
656 "\tgit config --global init.defaultBranch <name>\n"
657 "\n"
658 "Names commonly chosen instead of 'master' are 'main', 'trunk' and\n"
659 "'development'. The just-created branch can be renamed via this command:\n"
660 "\n"
661 "\tgit branch -m <name>\n"
662 );
663
664 char *repo_default_branch_name(struct repository *r, int quiet)
665 {
666 const char *config_key = "init.defaultbranch";
667 const char *config_display_key = "init.defaultBranch";
668 char *ret = NULL, *full_ref;
669 const char *env = getenv("GIT_TEST_DEFAULT_INITIAL_BRANCH_NAME");
670
671 if (env && *env)
672 ret = xstrdup(env);
673 else if (repo_config_get_string(r, config_key, &ret) < 0)
674 die(_("could not retrieve `%s`"), config_display_key);
675
676 if (!ret) {
677 ret = xstrdup("master");
678 if (!quiet)
679 advise(_(default_branch_name_advice), ret);
680 }
681
682 full_ref = xstrfmt("refs/heads/%s", ret);
683 if (check_refname_format(full_ref, 0))
684 die(_("invalid branch name: %s = %s"), config_display_key, ret);
685 free(full_ref);
686
687 return ret;
688 }
689
690 const char *git_default_branch_name(int quiet)
691 {
692 static char *ret;
693
694 if (!ret)
695 ret = repo_default_branch_name(the_repository, quiet);
696
697 return ret;
698 }
699
700 /*
701 * *string and *len will only be substituted, and *string returned (for
702 * later free()ing) if the string passed in is a magic short-hand form
703 * to name a branch.
704 */
705 static char *substitute_branch_name(struct repository *r,
706 const char **string, int *len,
707 int nonfatal_dangling_mark)
708 {
709 struct strbuf buf = STRBUF_INIT;
710 struct interpret_branch_name_options options = {
711 .nonfatal_dangling_mark = nonfatal_dangling_mark
712 };
713 int ret = repo_interpret_branch_name(r, *string, *len, &buf, &options);
714
715 if (ret == *len) {
716 size_t size;
717 *string = strbuf_detach(&buf, &size);
718 *len = size;
719 return (char *)*string;
720 }
721
722 return NULL;
723 }
724
725 int repo_dwim_ref(struct repository *r, const char *str, int len,
726 struct object_id *oid, char **ref, int nonfatal_dangling_mark)
727 {
728 char *last_branch = substitute_branch_name(r, &str, &len,
729 nonfatal_dangling_mark);
730 int refs_found = expand_ref(r, str, len, oid, ref);
731 free(last_branch);
732 return refs_found;
733 }
734
735 int expand_ref(struct repository *repo, const char *str, int len,
736 struct object_id *oid, char **ref)
737 {
738 const char **p, *r;
739 int refs_found = 0;
740 struct strbuf fullref = STRBUF_INIT;
741
742 *ref = NULL;
743 for (p = ref_rev_parse_rules; *p; p++) {
744 struct object_id oid_from_ref;
745 struct object_id *this_result;
746 int flag;
747 struct ref_store *refs = get_main_ref_store(repo);
748
749 this_result = refs_found ? &oid_from_ref : oid;
750 strbuf_reset(&fullref);
751 strbuf_addf(&fullref, *p, len, str);
752 r = refs_resolve_ref_unsafe(refs, fullref.buf,
753 RESOLVE_REF_READING,
754 this_result, &flag);
755 if (r) {
756 if (!refs_found++)
757 *ref = xstrdup(r);
758 if (!warn_ambiguous_refs)
759 break;
760 } else if ((flag & REF_ISSYMREF) && strcmp(fullref.buf, "HEAD")) {
761 warning(_("ignoring dangling symref %s"), fullref.buf);
762 } else if ((flag & REF_ISBROKEN) && strchr(fullref.buf, '/')) {
763 warning(_("ignoring broken ref %s"), fullref.buf);
764 }
765 }
766 strbuf_release(&fullref);
767 return refs_found;
768 }
769
770 int repo_dwim_log(struct repository *r, const char *str, int len,
771 struct object_id *oid, char **log)
772 {
773 struct ref_store *refs = get_main_ref_store(r);
774 char *last_branch = substitute_branch_name(r, &str, &len, 0);
775 const char **p;
776 int logs_found = 0;
777 struct strbuf path = STRBUF_INIT;
778
779 *log = NULL;
780 for (p = ref_rev_parse_rules; *p; p++) {
781 struct object_id hash;
782 const char *ref, *it;
783
784 strbuf_reset(&path);
785 strbuf_addf(&path, *p, len, str);
786 ref = refs_resolve_ref_unsafe(refs, path.buf,
787 RESOLVE_REF_READING,
788 oid ? &hash : NULL, NULL);
789 if (!ref)
790 continue;
791 if (refs_reflog_exists(refs, path.buf))
792 it = path.buf;
793 else if (strcmp(ref, path.buf) &&
794 refs_reflog_exists(refs, ref))
795 it = ref;
796 else
797 continue;
798 if (!logs_found++) {
799 *log = xstrdup(it);
800 if (oid)
801 oidcpy(oid, &hash);
802 }
803 if (!warn_ambiguous_refs)
804 break;
805 }
806 strbuf_release(&path);
807 free(last_branch);
808 return logs_found;
809 }
810
811 int dwim_log(const char *str, int len, struct object_id *oid, char **log)
812 {
813 return repo_dwim_log(the_repository, str, len, oid, log);
814 }
815
816 int is_per_worktree_ref(const char *refname)
817 {
818 return starts_with(refname, "refs/worktree/") ||
819 starts_with(refname, "refs/bisect/") ||
820 starts_with(refname, "refs/rewritten/");
821 }
822
823 static int is_pseudoref_syntax(const char *refname)
824 {
825 const char *c;
826
827 for (c = refname; *c; c++) {
828 if (!isupper(*c) && *c != '-' && *c != '_')
829 return 0;
830 }
831
832 /*
833 * HEAD is not a pseudoref, but it certainly uses the
834 * pseudoref syntax.
835 */
836 return 1;
837 }
838
839 static int is_current_worktree_ref(const char *ref) {
840 return is_pseudoref_syntax(ref) || is_per_worktree_ref(ref);
841 }
842
843 enum ref_worktree_type parse_worktree_ref(const char *maybe_worktree_ref,
844 const char **worktree_name, int *worktree_name_length,
845 const char **bare_refname)
846 {
847 const char *name_dummy;
848 int name_length_dummy;
849 const char *ref_dummy;
850
851 if (!worktree_name)
852 worktree_name = &name_dummy;
853 if (!worktree_name_length)
854 worktree_name_length = &name_length_dummy;
855 if (!bare_refname)
856 bare_refname = &ref_dummy;
857
858 if (skip_prefix(maybe_worktree_ref, "worktrees/", bare_refname)) {
859 const char *slash = strchr(*bare_refname, '/');
860
861 *worktree_name = *bare_refname;
862 if (!slash) {
863 *worktree_name_length = strlen(*worktree_name);
864
865 /* This is an error condition, and the caller tell because the bare_refname is "" */
866 *bare_refname = *worktree_name + *worktree_name_length;
867 return REF_WORKTREE_OTHER;
868 }
869
870 *worktree_name_length = slash - *bare_refname;
871 *bare_refname = slash + 1;
872
873 if (is_current_worktree_ref(*bare_refname))
874 return REF_WORKTREE_OTHER;
875 }
876
877 *worktree_name = NULL;
878 *worktree_name_length = 0;
879
880 if (skip_prefix(maybe_worktree_ref, "main-worktree/", bare_refname)
881 && is_current_worktree_ref(*bare_refname))
882 return REF_WORKTREE_MAIN;
883
884 *bare_refname = maybe_worktree_ref;
885 if (is_current_worktree_ref(maybe_worktree_ref))
886 return REF_WORKTREE_CURRENT;
887
888 return REF_WORKTREE_SHARED;
889 }
890
891 long get_files_ref_lock_timeout_ms(void)
892 {
893 static int configured = 0;
894
895 /* The default timeout is 100 ms: */
896 static int timeout_ms = 100;
897
898 if (!configured) {
899 git_config_get_int("core.filesreflocktimeout", &timeout_ms);
900 configured = 1;
901 }
902
903 return timeout_ms;
904 }
905
906 int refs_delete_ref(struct ref_store *refs, const char *msg,
907 const char *refname,
908 const struct object_id *old_oid,
909 unsigned int flags)
910 {
911 struct ref_transaction *transaction;
912 struct strbuf err = STRBUF_INIT;
913
914 transaction = ref_store_transaction_begin(refs, &err);
915 if (!transaction ||
916 ref_transaction_delete(transaction, refname, old_oid,
917 flags, msg, &err) ||
918 ref_transaction_commit(transaction, &err)) {
919 error("%s", err.buf);
920 ref_transaction_free(transaction);
921 strbuf_release(&err);
922 return 1;
923 }
924 ref_transaction_free(transaction);
925 strbuf_release(&err);
926 return 0;
927 }
928
929 int delete_ref(const char *msg, const char *refname,
930 const struct object_id *old_oid, unsigned int flags)
931 {
932 return refs_delete_ref(get_main_ref_store(the_repository), msg, refname,
933 old_oid, flags);
934 }
935
936 static void copy_reflog_msg(struct strbuf *sb, const char *msg)
937 {
938 char c;
939 int wasspace = 1;
940
941 while ((c = *msg++)) {
942 if (wasspace && isspace(c))
943 continue;
944 wasspace = isspace(c);
945 if (wasspace)
946 c = ' ';
947 strbuf_addch(sb, c);
948 }
949 strbuf_rtrim(sb);
950 }
951
952 static char *normalize_reflog_message(const char *msg)
953 {
954 struct strbuf sb = STRBUF_INIT;
955
956 if (msg && *msg)
957 copy_reflog_msg(&sb, msg);
958 return strbuf_detach(&sb, NULL);
959 }
960
961 int should_autocreate_reflog(const char *refname)
962 {
963 switch (log_all_ref_updates) {
964 case LOG_REFS_ALWAYS:
965 return 1;
966 case LOG_REFS_NORMAL:
967 return starts_with(refname, "refs/heads/") ||
968 starts_with(refname, "refs/remotes/") ||
969 starts_with(refname, "refs/notes/") ||
970 !strcmp(refname, "HEAD");
971 default:
972 return 0;
973 }
974 }
975
976 int is_branch(const char *refname)
977 {
978 return !strcmp(refname, "HEAD") || starts_with(refname, "refs/heads/");
979 }
980
981 struct read_ref_at_cb {
982 const char *refname;
983 timestamp_t at_time;
984 int cnt;
985 int reccnt;
986 struct object_id *oid;
987 int found_it;
988
989 struct object_id ooid;
990 struct object_id noid;
991 int tz;
992 timestamp_t date;
993 char **msg;
994 timestamp_t *cutoff_time;
995 int *cutoff_tz;
996 int *cutoff_cnt;
997 };
998
999 static void set_read_ref_cutoffs(struct read_ref_at_cb *cb,
1000 timestamp_t timestamp, int tz, const char *message)
1001 {
1002 if (cb->msg)
1003 *cb->msg = xstrdup(message);
1004 if (cb->cutoff_time)
1005 *cb->cutoff_time = timestamp;
1006 if (cb->cutoff_tz)
1007 *cb->cutoff_tz = tz;
1008 if (cb->cutoff_cnt)
1009 *cb->cutoff_cnt = cb->reccnt;
1010 }
1011
1012 static int read_ref_at_ent(struct object_id *ooid, struct object_id *noid,
1013 const char *email UNUSED,
1014 timestamp_t timestamp, int tz,
1015 const char *message, void *cb_data)
1016 {
1017 struct read_ref_at_cb *cb = cb_data;
1018 int reached_count;
1019
1020 cb->tz = tz;
1021 cb->date = timestamp;
1022
1023 /*
1024 * It is not possible for cb->cnt == 0 on the first iteration because
1025 * that special case is handled in read_ref_at().
1026 */
1027 if (cb->cnt > 0)
1028 cb->cnt--;
1029 reached_count = cb->cnt == 0 && !is_null_oid(ooid);
1030 if (timestamp <= cb->at_time || reached_count) {
1031 set_read_ref_cutoffs(cb, timestamp, tz, message);
1032 /*
1033 * we have not yet updated cb->[n|o]oid so they still
1034 * hold the values for the previous record.
1035 */
1036 if (!is_null_oid(&cb->ooid) && !oideq(&cb->ooid, noid))
1037 warning(_("log for ref %s has gap after %s"),
1038 cb->refname, show_date(cb->date, cb->tz, DATE_MODE(RFC2822)));
1039 if (reached_count)
1040 oidcpy(cb->oid, ooid);
1041 else if (!is_null_oid(&cb->ooid) || cb->date == cb->at_time)
1042 oidcpy(cb->oid, noid);
1043 else if (!oideq(noid, cb->oid))
1044 warning(_("log for ref %s unexpectedly ended on %s"),
1045 cb->refname, show_date(cb->date, cb->tz,
1046 DATE_MODE(RFC2822)));
1047 cb->found_it = 1;
1048 }
1049 cb->reccnt++;
1050 oidcpy(&cb->ooid, ooid);
1051 oidcpy(&cb->noid, noid);
1052 return cb->found_it;
1053 }
1054
1055 static int read_ref_at_ent_newest(struct object_id *ooid UNUSED,
1056 struct object_id *noid,
1057 const char *email UNUSED,
1058 timestamp_t timestamp, int tz,
1059 const char *message, void *cb_data)
1060 {
1061 struct read_ref_at_cb *cb = cb_data;
1062
1063 set_read_ref_cutoffs(cb, timestamp, tz, message);
1064 oidcpy(cb->oid, noid);
1065 /* We just want the first entry */
1066 return 1;
1067 }
1068
1069 static int read_ref_at_ent_oldest(struct object_id *ooid, struct object_id *noid,
1070 const char *email UNUSED,
1071 timestamp_t timestamp, int tz,
1072 const char *message, void *cb_data)
1073 {
1074 struct read_ref_at_cb *cb = cb_data;
1075
1076 set_read_ref_cutoffs(cb, timestamp, tz, message);
1077 oidcpy(cb->oid, ooid);
1078 if (is_null_oid(cb->oid))
1079 oidcpy(cb->oid, noid);
1080 /* We just want the first entry */
1081 return 1;
1082 }
1083
1084 int read_ref_at(struct ref_store *refs, const char *refname,
1085 unsigned int flags, timestamp_t at_time, int cnt,
1086 struct object_id *oid, char **msg,
1087 timestamp_t *cutoff_time, int *cutoff_tz, int *cutoff_cnt)
1088 {
1089 struct read_ref_at_cb cb;
1090
1091 memset(&cb, 0, sizeof(cb));
1092 cb.refname = refname;
1093 cb.at_time = at_time;
1094 cb.cnt = cnt;
1095 cb.msg = msg;
1096 cb.cutoff_time = cutoff_time;
1097 cb.cutoff_tz = cutoff_tz;
1098 cb.cutoff_cnt = cutoff_cnt;
1099 cb.oid = oid;
1100
1101 if (cb.cnt == 0) {
1102 refs_for_each_reflog_ent_reverse(refs, refname, read_ref_at_ent_newest, &cb);
1103 return 0;
1104 }
1105
1106 refs_for_each_reflog_ent_reverse(refs, refname, read_ref_at_ent, &cb);
1107
1108 if (!cb.reccnt) {
1109 if (flags & GET_OID_QUIETLY)
1110 exit(128);
1111 else
1112 die(_("log for %s is empty"), refname);
1113 }
1114 if (cb.found_it)
1115 return 0;
1116
1117 refs_for_each_reflog_ent(refs, refname, read_ref_at_ent_oldest, &cb);
1118
1119 return 1;
1120 }
1121
1122 struct ref_transaction *ref_store_transaction_begin(struct ref_store *refs,
1123 struct strbuf *err)
1124 {
1125 struct ref_transaction *tr;
1126 assert(err);
1127
1128 CALLOC_ARRAY(tr, 1);
1129 tr->ref_store = refs;
1130 return tr;
1131 }
1132
1133 struct ref_transaction *ref_transaction_begin(struct strbuf *err)
1134 {
1135 return ref_store_transaction_begin(get_main_ref_store(the_repository), err);
1136 }
1137
1138 void ref_transaction_free(struct ref_transaction *transaction)
1139 {
1140 size_t i;
1141
1142 if (!transaction)
1143 return;
1144
1145 switch (transaction->state) {
1146 case REF_TRANSACTION_OPEN:
1147 case REF_TRANSACTION_CLOSED:
1148 /* OK */
1149 break;
1150 case REF_TRANSACTION_PREPARED:
1151 BUG("free called on a prepared reference transaction");
1152 break;
1153 default:
1154 BUG("unexpected reference transaction state");
1155 break;
1156 }
1157
1158 for (i = 0; i < transaction->nr; i++) {
1159 free(transaction->updates[i]->msg);
1160 free(transaction->updates[i]);
1161 }
1162 free(transaction->updates);
1163 free(transaction);
1164 }
1165
1166 struct ref_update *ref_transaction_add_update(
1167 struct ref_transaction *transaction,
1168 const char *refname, unsigned int flags,
1169 const struct object_id *new_oid,
1170 const struct object_id *old_oid,
1171 const char *msg)
1172 {
1173 struct ref_update *update;
1174
1175 if (transaction->state != REF_TRANSACTION_OPEN)
1176 BUG("update called for transaction that is not open");
1177
1178 FLEX_ALLOC_STR(update, refname, refname);
1179 ALLOC_GROW(transaction->updates, transaction->nr + 1, transaction->alloc);
1180 transaction->updates[transaction->nr++] = update;
1181
1182 update->flags = flags;
1183
1184 if (flags & REF_HAVE_NEW)
1185 oidcpy(&update->new_oid, new_oid);
1186 if (flags & REF_HAVE_OLD)
1187 oidcpy(&update->old_oid, old_oid);
1188 update->msg = normalize_reflog_message(msg);
1189 return update;
1190 }
1191
1192 int ref_transaction_update(struct ref_transaction *transaction,
1193 const char *refname,
1194 const struct object_id *new_oid,
1195 const struct object_id *old_oid,
1196 unsigned int flags, const char *msg,
1197 struct strbuf *err)
1198 {
1199 assert(err);
1200
1201 if (!(flags & REF_SKIP_REFNAME_VERIFICATION) &&
1202 ((new_oid && !is_null_oid(new_oid)) ?
1203 check_refname_format(refname, REFNAME_ALLOW_ONELEVEL) :
1204 !refname_is_safe(refname))) {
1205 strbuf_addf(err, _("refusing to update ref with bad name '%s'"),
1206 refname);
1207 return -1;
1208 }
1209
1210 if (flags & ~REF_TRANSACTION_UPDATE_ALLOWED_FLAGS)
1211 BUG("illegal flags 0x%x passed to ref_transaction_update()", flags);
1212
1213 /*
1214 * Clear flags outside the allowed set; this should be a noop because
1215 * of the BUG() check above, but it works around a -Wnonnull warning
1216 * with some versions of "gcc -O3".
1217 */
1218 flags &= REF_TRANSACTION_UPDATE_ALLOWED_FLAGS;
1219
1220 flags |= (new_oid ? REF_HAVE_NEW : 0) | (old_oid ? REF_HAVE_OLD : 0);
1221
1222 ref_transaction_add_update(transaction, refname, flags,
1223 new_oid, old_oid, msg);
1224 return 0;
1225 }
1226
1227 int ref_transaction_create(struct ref_transaction *transaction,
1228 const char *refname,
1229 const struct object_id *new_oid,
1230 unsigned int flags, const char *msg,
1231 struct strbuf *err)
1232 {
1233 if (!new_oid || is_null_oid(new_oid)) {
1234 strbuf_addf(err, "'%s' has a null OID", refname);
1235 return 1;
1236 }
1237 return ref_transaction_update(transaction, refname, new_oid,
1238 null_oid(), flags, msg, err);
1239 }
1240
1241 int ref_transaction_delete(struct ref_transaction *transaction,
1242 const char *refname,
1243 const struct object_id *old_oid,
1244 unsigned int flags, const char *msg,
1245 struct strbuf *err)
1246 {
1247 if (old_oid && is_null_oid(old_oid))
1248 BUG("delete called with old_oid set to zeros");
1249 return ref_transaction_update(transaction, refname,
1250 null_oid(), old_oid,
1251 flags, msg, err);
1252 }
1253
1254 int ref_transaction_verify(struct ref_transaction *transaction,
1255 const char *refname,
1256 const struct object_id *old_oid,
1257 unsigned int flags,
1258 struct strbuf *err)
1259 {
1260 if (!old_oid)
1261 BUG("verify called with old_oid set to NULL");
1262 return ref_transaction_update(transaction, refname,
1263 NULL, old_oid,
1264 flags, NULL, err);
1265 }
1266
1267 int refs_update_ref(struct ref_store *refs, const char *msg,
1268 const char *refname, const struct object_id *new_oid,
1269 const struct object_id *old_oid, unsigned int flags,
1270 enum action_on_err onerr)
1271 {
1272 struct ref_transaction *t = NULL;
1273 struct strbuf err = STRBUF_INIT;
1274 int ret = 0;
1275
1276 t = ref_store_transaction_begin(refs, &err);
1277 if (!t ||
1278 ref_transaction_update(t, refname, new_oid, old_oid, flags, msg,
1279 &err) ||
1280 ref_transaction_commit(t, &err)) {
1281 ret = 1;
1282 ref_transaction_free(t);
1283 }
1284 if (ret) {
1285 const char *str = _("update_ref failed for ref '%s': %s");
1286
1287 switch (onerr) {
1288 case UPDATE_REFS_MSG_ON_ERR:
1289 error(str, refname, err.buf);
1290 break;
1291 case UPDATE_REFS_DIE_ON_ERR:
1292 die(str, refname, err.buf);
1293 break;
1294 case UPDATE_REFS_QUIET_ON_ERR:
1295 break;
1296 }
1297 strbuf_release(&err);
1298 return 1;
1299 }
1300 strbuf_release(&err);
1301 if (t)
1302 ref_transaction_free(t);
1303 return 0;
1304 }
1305
1306 int update_ref(const char *msg, const char *refname,
1307 const struct object_id *new_oid,
1308 const struct object_id *old_oid,
1309 unsigned int flags, enum action_on_err onerr)
1310 {
1311 return refs_update_ref(get_main_ref_store(the_repository), msg, refname, new_oid,
1312 old_oid, flags, onerr);
1313 }
1314
1315 /*
1316 * Check that the string refname matches a rule of the form
1317 * "{prefix}%.*s{suffix}". So "foo/bar/baz" would match the rule
1318 * "foo/%.*s/baz", and return the string "bar".
1319 */
1320 static const char *match_parse_rule(const char *refname, const char *rule,
1321 size_t *len)
1322 {
1323 /*
1324 * Check that rule matches refname up to the first percent in the rule.
1325 * We can bail immediately if not, but otherwise we leave "rule" at the
1326 * %-placeholder, and "refname" at the start of the potential matched
1327 * name.
1328 */
1329 while (*rule != '%') {
1330 if (!*rule)
1331 BUG("rev-parse rule did not have percent");
1332 if (*refname++ != *rule++)
1333 return NULL;
1334 }
1335
1336 /*
1337 * Check that our "%" is the expected placeholder. This assumes there
1338 * are no other percents (placeholder or quoted) in the string, but
1339 * that is sufficient for our rev-parse rules.
1340 */
1341 if (!skip_prefix(rule, "%.*s", &rule))
1342 return NULL;
1343
1344 /*
1345 * And now check that our suffix (if any) matches.
1346 */
1347 if (!strip_suffix(refname, rule, len))
1348 return NULL;
1349
1350 return refname; /* len set by strip_suffix() */
1351 }
1352
1353 char *refs_shorten_unambiguous_ref(struct ref_store *refs,
1354 const char *refname, int strict)
1355 {
1356 int i;
1357 struct strbuf resolved_buf = STRBUF_INIT;
1358
1359 /* skip first rule, it will always match */
1360 for (i = NUM_REV_PARSE_RULES - 1; i > 0 ; --i) {
1361 int j;
1362 int rules_to_fail = i;
1363 const char *short_name;
1364 size_t short_name_len;
1365
1366 short_name = match_parse_rule(refname, ref_rev_parse_rules[i],
1367 &short_name_len);
1368 if (!short_name)
1369 continue;
1370
1371 /*
1372 * in strict mode, all (except the matched one) rules
1373 * must fail to resolve to a valid non-ambiguous ref
1374 */
1375 if (strict)
1376 rules_to_fail = NUM_REV_PARSE_RULES;
1377
1378 /*
1379 * check if the short name resolves to a valid ref,
1380 * but use only rules prior to the matched one
1381 */
1382 for (j = 0; j < rules_to_fail; j++) {
1383 const char *rule = ref_rev_parse_rules[j];
1384
1385 /* skip matched rule */
1386 if (i == j)
1387 continue;
1388
1389 /*
1390 * the short name is ambiguous, if it resolves
1391 * (with this previous rule) to a valid ref
1392 * read_ref() returns 0 on success
1393 */
1394 strbuf_reset(&resolved_buf);
1395 strbuf_addf(&resolved_buf, rule,
1396 cast_size_t_to_int(short_name_len),
1397 short_name);
1398 if (refs_ref_exists(refs, resolved_buf.buf))
1399 break;
1400 }
1401
1402 /*
1403 * short name is non-ambiguous if all previous rules
1404 * haven't resolved to a valid ref
1405 */
1406 if (j == rules_to_fail) {
1407 strbuf_release(&resolved_buf);
1408 return xmemdupz(short_name, short_name_len);
1409 }
1410 }
1411
1412 strbuf_release(&resolved_buf);
1413 return xstrdup(refname);
1414 }
1415
1416 char *shorten_unambiguous_ref(const char *refname, int strict)
1417 {
1418 return refs_shorten_unambiguous_ref(get_main_ref_store(the_repository),
1419 refname, strict);
1420 }
1421
1422 int parse_hide_refs_config(const char *var, const char *value, const char *section,
1423 struct string_list *hide_refs)
1424 {
1425 const char *key;
1426 if (!strcmp("transfer.hiderefs", var) ||
1427 (!parse_config_key(var, section, NULL, NULL, &key) &&
1428 !strcmp(key, "hiderefs"))) {
1429 char *ref;
1430 int len;
1431
1432 if (!value)
1433 return config_error_nonbool(var);
1434 ref = xstrdup(value);
1435 len = strlen(ref);
1436 while (len && ref[len - 1] == '/')
1437 ref[--len] = '\0';
1438 string_list_append_nodup(hide_refs, ref);
1439 }
1440 return 0;
1441 }
1442
1443 int ref_is_hidden(const char *refname, const char *refname_full,
1444 const struct string_list *hide_refs)
1445 {
1446 int i;
1447
1448 for (i = hide_refs->nr - 1; i >= 0; i--) {
1449 const char *match = hide_refs->items[i].string;
1450 const char *subject;
1451 int neg = 0;
1452 const char *p;
1453
1454 if (*match == '!') {
1455 neg = 1;
1456 match++;
1457 }
1458
1459 if (*match == '^') {
1460 subject = refname_full;
1461 match++;
1462 } else {
1463 subject = refname;
1464 }
1465
1466 /* refname can be NULL when namespaces are used. */
1467 if (subject &&
1468 skip_prefix(subject, match, &p) &&
1469 (!*p || *p == '/'))
1470 return !neg;
1471 }
1472 return 0;
1473 }
1474
1475 const char *find_descendant_ref(const char *dirname,
1476 const struct string_list *extras,
1477 const struct string_list *skip)
1478 {
1479 int pos;
1480
1481 if (!extras)
1482 return NULL;
1483
1484 /*
1485 * Look at the place where dirname would be inserted into
1486 * extras. If there is an entry at that position that starts
1487 * with dirname (remember, dirname includes the trailing
1488 * slash) and is not in skip, then we have a conflict.
1489 */
1490 for (pos = string_list_find_insert_index(extras, dirname, 0);
1491 pos < extras->nr; pos++) {
1492 const char *extra_refname = extras->items[pos].string;
1493
1494 if (!starts_with(extra_refname, dirname))
1495 break;
1496
1497 if (!skip || !string_list_has_string(skip, extra_refname))
1498 return extra_refname;
1499 }
1500 return NULL;
1501 }
1502
1503 int refs_head_ref(struct ref_store *refs, each_ref_fn fn, void *cb_data)
1504 {
1505 struct object_id oid;
1506 int flag;
1507
1508 if (refs_resolve_ref_unsafe(refs, "HEAD", RESOLVE_REF_READING,
1509 &oid, &flag))
1510 return fn("HEAD", &oid, flag, cb_data);
1511
1512 return 0;
1513 }
1514
1515 int head_ref(each_ref_fn fn, void *cb_data)
1516 {
1517 return refs_head_ref(get_main_ref_store(the_repository), fn, cb_data);
1518 }
1519
1520 struct ref_iterator *refs_ref_iterator_begin(
1521 struct ref_store *refs,
1522 const char *prefix, int trim,
1523 enum do_for_each_ref_flags flags)
1524 {
1525 struct ref_iterator *iter;
1526
1527 if (!(flags & DO_FOR_EACH_INCLUDE_BROKEN)) {
1528 static int ref_paranoia = -1;
1529
1530 if (ref_paranoia < 0)
1531 ref_paranoia = git_env_bool("GIT_REF_PARANOIA", 1);
1532 if (ref_paranoia) {
1533 flags |= DO_FOR_EACH_INCLUDE_BROKEN;
1534 flags |= DO_FOR_EACH_OMIT_DANGLING_SYMREFS;
1535 }
1536 }
1537
1538 iter = refs->be->iterator_begin(refs, prefix, flags);
1539
1540 /*
1541 * `iterator_begin()` already takes care of prefix, but we
1542 * might need to do some trimming:
1543 */
1544 if (trim)
1545 iter = prefix_ref_iterator_begin(iter, "", trim);
1546
1547 /* Sanity check for subclasses: */
1548 if (!iter->ordered)
1549 BUG("reference iterator is not ordered");
1550
1551 return iter;
1552 }
1553
1554 /*
1555 * Call fn for each reference in the specified submodule for which the
1556 * refname begins with prefix. If trim is non-zero, then trim that
1557 * many characters off the beginning of each refname before passing
1558 * the refname to fn. flags can be DO_FOR_EACH_INCLUDE_BROKEN to
1559 * include broken references in the iteration. If fn ever returns a
1560 * non-zero value, stop the iteration and return that value;
1561 * otherwise, return 0.
1562 */
1563 static int do_for_each_repo_ref(struct repository *r, const char *prefix,
1564 each_repo_ref_fn fn, int trim, int flags,
1565 void *cb_data)
1566 {
1567 struct ref_iterator *iter;
1568 struct ref_store *refs = get_main_ref_store(r);
1569
1570 if (!refs)
1571 return 0;
1572
1573 iter = refs_ref_iterator_begin(refs, prefix, trim, flags);
1574
1575 return do_for_each_repo_ref_iterator(r, iter, fn, cb_data);
1576 }
1577
1578 struct do_for_each_ref_help {
1579 each_ref_fn *fn;
1580 void *cb_data;
1581 };
1582
1583 static int do_for_each_ref_helper(struct repository *r,
1584 const char *refname,
1585 const struct object_id *oid,
1586 int flags,
1587 void *cb_data)
1588 {
1589 struct do_for_each_ref_help *hp = cb_data;
1590
1591 return hp->fn(refname, oid, flags, hp->cb_data);
1592 }
1593
1594 static int do_for_each_ref(struct ref_store *refs, const char *prefix,
1595 each_ref_fn fn, int trim,
1596 enum do_for_each_ref_flags flags, void *cb_data)
1597 {
1598 struct ref_iterator *iter;
1599 struct do_for_each_ref_help hp = { fn, cb_data };
1600
1601 if (!refs)
1602 return 0;
1603
1604 iter = refs_ref_iterator_begin(refs, prefix, trim, flags);
1605
1606 return do_for_each_repo_ref_iterator(the_repository, iter,
1607 do_for_each_ref_helper, &hp);
1608 }
1609
1610 int refs_for_each_ref(struct ref_store *refs, each_ref_fn fn, void *cb_data)
1611 {
1612 return do_for_each_ref(refs, "", fn, 0, 0, cb_data);
1613 }
1614
1615 int for_each_ref(each_ref_fn fn, void *cb_data)
1616 {
1617 return refs_for_each_ref(get_main_ref_store(the_repository), fn, cb_data);
1618 }
1619
1620 int refs_for_each_ref_in(struct ref_store *refs, const char *prefix,
1621 each_ref_fn fn, void *cb_data)
1622 {
1623 return do_for_each_ref(refs, prefix, fn, strlen(prefix), 0, cb_data);
1624 }
1625
1626 int for_each_ref_in(const char *prefix, each_ref_fn fn, void *cb_data)
1627 {
1628 return refs_for_each_ref_in(get_main_ref_store(the_repository), prefix, fn, cb_data);
1629 }
1630
1631 int for_each_fullref_in(const char *prefix, each_ref_fn fn, void *cb_data)
1632 {
1633 return do_for_each_ref(get_main_ref_store(the_repository),
1634 prefix, fn, 0, 0, cb_data);
1635 }
1636
1637 int refs_for_each_fullref_in(struct ref_store *refs, const char *prefix,
1638 each_ref_fn fn, void *cb_data)
1639 {
1640 return do_for_each_ref(refs, prefix, fn, 0, 0, cb_data);
1641 }
1642
1643 int for_each_replace_ref(struct repository *r, each_repo_ref_fn fn, void *cb_data)
1644 {
1645 const char *git_replace_ref_base = ref_namespace[NAMESPACE_REPLACE].ref;
1646 return do_for_each_repo_ref(r, git_replace_ref_base, fn,
1647 strlen(git_replace_ref_base),
1648 DO_FOR_EACH_INCLUDE_BROKEN, cb_data);
1649 }
1650
1651 int for_each_namespaced_ref(each_ref_fn fn, void *cb_data)
1652 {
1653 struct strbuf buf = STRBUF_INIT;
1654 int ret;
1655 strbuf_addf(&buf, "%srefs/", get_git_namespace());
1656 ret = do_for_each_ref(get_main_ref_store(the_repository),
1657 buf.buf, fn, 0, 0, cb_data);
1658 strbuf_release(&buf);
1659 return ret;
1660 }
1661
1662 int refs_for_each_rawref(struct ref_store *refs, each_ref_fn fn, void *cb_data)
1663 {
1664 return do_for_each_ref(refs, "", fn, 0,
1665 DO_FOR_EACH_INCLUDE_BROKEN, cb_data);
1666 }
1667
1668 int for_each_rawref(each_ref_fn fn, void *cb_data)
1669 {
1670 return refs_for_each_rawref(get_main_ref_store(the_repository), fn, cb_data);
1671 }
1672
1673 static int qsort_strcmp(const void *va, const void *vb)
1674 {
1675 const char *a = *(const char **)va;
1676 const char *b = *(const char **)vb;
1677
1678 return strcmp(a, b);
1679 }
1680
1681 static void find_longest_prefixes_1(struct string_list *out,
1682 struct strbuf *prefix,
1683 const char **patterns, size_t nr)
1684 {
1685 size_t i;
1686
1687 for (i = 0; i < nr; i++) {
1688 char c = patterns[i][prefix->len];
1689 if (!c || is_glob_special(c)) {
1690 string_list_append(out, prefix->buf);
1691 return;
1692 }
1693 }
1694
1695 i = 0;
1696 while (i < nr) {
1697 size_t end;
1698
1699 /*
1700 * Set "end" to the index of the element _after_ the last one
1701 * in our group.
1702 */
1703 for (end = i + 1; end < nr; end++) {
1704 if (patterns[i][prefix->len] != patterns[end][prefix->len])
1705 break;
1706 }
1707
1708 strbuf_addch(prefix, patterns[i][prefix->len]);
1709 find_longest_prefixes_1(out, prefix, patterns + i, end - i);
1710 strbuf_setlen(prefix, prefix->len - 1);
1711
1712 i = end;
1713 }
1714 }
1715
1716 static void find_longest_prefixes(struct string_list *out,
1717 const char **patterns)
1718 {
1719 struct strvec sorted = STRVEC_INIT;
1720 struct strbuf prefix = STRBUF_INIT;
1721
1722 strvec_pushv(&sorted, patterns);
1723 QSORT(sorted.v, sorted.nr, qsort_strcmp);
1724
1725 find_longest_prefixes_1(out, &prefix, sorted.v, sorted.nr);
1726
1727 strvec_clear(&sorted);
1728 strbuf_release(&prefix);
1729 }
1730
1731 int refs_for_each_fullref_in_prefixes(struct ref_store *ref_store,
1732 const char *namespace,
1733 const char **patterns,
1734 each_ref_fn fn, void *cb_data)
1735 {
1736 struct string_list prefixes = STRING_LIST_INIT_DUP;
1737 struct string_list_item *prefix;
1738 struct strbuf buf = STRBUF_INIT;
1739 int ret = 0, namespace_len;
1740
1741 find_longest_prefixes(&prefixes, patterns);
1742
1743 if (namespace)
1744 strbuf_addstr(&buf, namespace);
1745 namespace_len = buf.len;
1746
1747 for_each_string_list_item(prefix, &prefixes) {
1748 strbuf_addstr(&buf, prefix->string);
1749 ret = refs_for_each_fullref_in(ref_store, buf.buf, fn, cb_data);
1750 if (ret)
1751 break;
1752 strbuf_setlen(&buf, namespace_len);
1753 }
1754
1755 string_list_clear(&prefixes, 0);
1756 strbuf_release(&buf);
1757 return ret;
1758 }
1759
1760 static int refs_read_special_head(struct ref_store *ref_store,
1761 const char *refname, struct object_id *oid,
1762 struct strbuf *referent, unsigned int *type,
1763 int *failure_errno)
1764 {
1765 struct strbuf full_path = STRBUF_INIT;
1766 struct strbuf content = STRBUF_INIT;
1767 int result = -1;
1768 strbuf_addf(&full_path, "%s/%s", ref_store->gitdir, refname);
1769
1770 if (strbuf_read_file(&content, full_path.buf, 0) < 0)
1771 goto done;
1772
1773 result = parse_loose_ref_contents(content.buf, oid, referent, type,
1774 failure_errno);
1775
1776 done:
1777 strbuf_release(&full_path);
1778 strbuf_release(&content);
1779 return result;
1780 }
1781
1782 int refs_read_raw_ref(struct ref_store *ref_store, const char *refname,
1783 struct object_id *oid, struct strbuf *referent,
1784 unsigned int *type, int *failure_errno)
1785 {
1786 assert(failure_errno);
1787 if (!strcmp(refname, "FETCH_HEAD") || !strcmp(refname, "MERGE_HEAD")) {
1788 return refs_read_special_head(ref_store, refname, oid, referent,
1789 type, failure_errno);
1790 }
1791
1792 return ref_store->be->read_raw_ref(ref_store, refname, oid, referent,
1793 type, failure_errno);
1794 }
1795
1796 int refs_read_symbolic_ref(struct ref_store *ref_store, const char *refname,
1797 struct strbuf *referent)
1798 {
1799 return ref_store->be->read_symbolic_ref(ref_store, refname, referent);
1800 }
1801
1802 const char *refs_resolve_ref_unsafe(struct ref_store *refs,
1803 const char *refname,
1804 int resolve_flags,
1805 struct object_id *oid,
1806 int *flags)
1807 {
1808 static struct strbuf sb_refname = STRBUF_INIT;
1809 struct object_id unused_oid;
1810 int unused_flags;
1811 int symref_count;
1812
1813 if (!oid)
1814 oid = &unused_oid;
1815 if (!flags)
1816 flags = &unused_flags;
1817
1818 *flags = 0;
1819
1820 if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {
1821 if (!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||
1822 !refname_is_safe(refname))
1823 return NULL;
1824
1825 /*
1826 * dwim_ref() uses REF_ISBROKEN to distinguish between
1827 * missing refs and refs that were present but invalid,
1828 * to complain about the latter to stderr.
1829 *
1830 * We don't know whether the ref exists, so don't set
1831 * REF_ISBROKEN yet.
1832 */
1833 *flags |= REF_BAD_NAME;
1834 }
1835
1836 for (symref_count = 0; symref_count < SYMREF_MAXDEPTH; symref_count++) {
1837 unsigned int read_flags = 0;
1838 int failure_errno;
1839
1840 if (refs_read_raw_ref(refs, refname, oid, &sb_refname,
1841 &read_flags, &failure_errno)) {
1842 *flags |= read_flags;
1843
1844 /* In reading mode, refs must eventually resolve */
1845 if (resolve_flags & RESOLVE_REF_READING)
1846 return NULL;
1847
1848 /*
1849 * Otherwise a missing ref is OK. But the files backend
1850 * may show errors besides ENOENT if there are
1851 * similarly-named refs.
1852 */
1853 if (failure_errno != ENOENT &&
1854 failure_errno != EISDIR &&
1855 failure_errno != ENOTDIR)
1856 return NULL;
1857
1858 oidclr(oid);
1859 if (*flags & REF_BAD_NAME)
1860 *flags |= REF_ISBROKEN;
1861 return refname;
1862 }
1863
1864 *flags |= read_flags;
1865
1866 if (!(read_flags & REF_ISSYMREF)) {
1867 if (*flags & REF_BAD_NAME) {
1868 oidclr(oid);
1869 *flags |= REF_ISBROKEN;
1870 }
1871 return refname;
1872 }
1873
1874 refname = sb_refname.buf;
1875 if (resolve_flags & RESOLVE_REF_NO_RECURSE) {
1876 oidclr(oid);
1877 return refname;
1878 }
1879 if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {
1880 if (!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||
1881 !refname_is_safe(refname))
1882 return NULL;
1883
1884 *flags |= REF_ISBROKEN | REF_BAD_NAME;
1885 }
1886 }
1887
1888 return NULL;
1889 }
1890
1891 /* backend functions */
1892 int refs_init_db(struct strbuf *err)
1893 {
1894 struct ref_store *refs = get_main_ref_store(the_repository);
1895
1896 return refs->be->init_db(refs, err);
1897 }
1898
1899 const char *resolve_ref_unsafe(const char *refname, int resolve_flags,
1900 struct object_id *oid, int *flags)
1901 {
1902 return refs_resolve_ref_unsafe(get_main_ref_store(the_repository), refname,
1903 resolve_flags, oid, flags);
1904 }
1905
1906 int resolve_gitlink_ref(const char *submodule, const char *refname,
1907 struct object_id *oid)
1908 {
1909 struct ref_store *refs;
1910 int flags;
1911
1912 refs = get_submodule_ref_store(submodule);
1913
1914 if (!refs)
1915 return -1;
1916
1917 if (!refs_resolve_ref_unsafe(refs, refname, 0, oid, &flags) ||
1918 is_null_oid(oid))
1919 return -1;
1920 return 0;
1921 }
1922
1923 struct ref_store_hash_entry
1924 {
1925 struct hashmap_entry ent;
1926
1927 struct ref_store *refs;
1928
1929 /* NUL-terminated identifier of the ref store: */
1930 char name[FLEX_ARRAY];
1931 };
1932
1933 static int ref_store_hash_cmp(const void *cmp_data UNUSED,
1934 const struct hashmap_entry *eptr,
1935 const struct hashmap_entry *entry_or_key,
1936 const void *keydata)
1937 {
1938 const struct ref_store_hash_entry *e1, *e2;
1939 const char *name;
1940
1941 e1 = container_of(eptr, const struct ref_store_hash_entry, ent);
1942 e2 = container_of(entry_or_key, const struct ref_store_hash_entry, ent);
1943 name = keydata ? keydata : e2->name;
1944
1945 return strcmp(e1->name, name);
1946 }
1947
1948 static struct ref_store_hash_entry *alloc_ref_store_hash_entry(
1949 const char *name, struct ref_store *refs)
1950 {
1951 struct ref_store_hash_entry *entry;
1952
1953 FLEX_ALLOC_STR(entry, name, name);
1954 hashmap_entry_init(&entry->ent, strhash(name));
1955 entry->refs = refs;
1956 return entry;
1957 }
1958
1959 /* A hashmap of ref_stores, stored by submodule name: */
1960 static struct hashmap submodule_ref_stores;
1961
1962 /* A hashmap of ref_stores, stored by worktree id: */
1963 static struct hashmap worktree_ref_stores;
1964
1965 /*
1966 * Look up a ref store by name. If that ref_store hasn't been
1967 * registered yet, return NULL.
1968 */
1969 static struct ref_store *lookup_ref_store_map(struct hashmap *map,
1970 const char *name)
1971 {
1972 struct ref_store_hash_entry *entry;
1973 unsigned int hash;
1974
1975 if (!map->tablesize)
1976 /* It's initialized on demand in register_ref_store(). */
1977 return NULL;
1978
1979 hash = strhash(name);
1980 entry = hashmap_get_entry_from_hash(map, hash, name,
1981 struct ref_store_hash_entry, ent);
1982 return entry ? entry->refs : NULL;
1983 }
1984
1985 /*
1986 * Create, record, and return a ref_store instance for the specified
1987 * gitdir.
1988 */
1989 static struct ref_store *ref_store_init(struct repository *repo,
1990 const char *gitdir,
1991 unsigned int flags)
1992 {
1993 const char *be_name = "files";
1994 struct ref_storage_be *be = find_ref_storage_backend(be_name);
1995 struct ref_store *refs;
1996
1997 if (!be)
1998 BUG("reference backend %s is unknown", be_name);
1999
2000 refs = be->init(repo, gitdir, flags);
2001 return refs;
2002 }
2003
2004 struct ref_store *get_main_ref_store(struct repository *r)
2005 {
2006 if (r->refs_private)
2007 return r->refs_private;
2008
2009 if (!r->gitdir)
2010 BUG("attempting to get main_ref_store outside of repository");
2011
2012 r->refs_private = ref_store_init(r, r->gitdir, REF_STORE_ALL_CAPS);
2013 r->refs_private = maybe_debug_wrap_ref_store(r->gitdir, r->refs_private);
2014 return r->refs_private;
2015 }
2016
2017 /*
2018 * Associate a ref store with a name. It is a fatal error to call this
2019 * function twice for the same name.
2020 */
2021 static void register_ref_store_map(struct hashmap *map,
2022 const char *type,
2023 struct ref_store *refs,
2024 const char *name)
2025 {
2026 struct ref_store_hash_entry *entry;
2027
2028 if (!map->tablesize)
2029 hashmap_init(map, ref_store_hash_cmp, NULL, 0);
2030
2031 entry = alloc_ref_store_hash_entry(name, refs);
2032 if (hashmap_put(map, &entry->ent))
2033 BUG("%s ref_store '%s' initialized twice", type, name);
2034 }
2035
2036 struct ref_store *get_submodule_ref_store(const char *submodule)
2037 {
2038 struct strbuf submodule_sb = STRBUF_INIT;
2039 struct ref_store *refs;
2040 char *to_free = NULL;
2041 size_t len;
2042 struct repository *subrepo;
2043
2044 if (!submodule)
2045 return NULL;
2046
2047 len = strlen(submodule);
2048 while (len && is_dir_sep(submodule[len - 1]))
2049 len--;
2050 if (!len)
2051 return NULL;
2052
2053 if (submodule[len])
2054 /* We need to strip off one or more trailing slashes */
2055 submodule = to_free = xmemdupz(submodule, len);
2056
2057 refs = lookup_ref_store_map(&submodule_ref_stores, submodule);
2058 if (refs)
2059 goto done;
2060
2061 strbuf_addstr(&submodule_sb, submodule);
2062 if (!is_nonbare_repository_dir(&submodule_sb))
2063 goto done;
2064
2065 if (submodule_to_gitdir(&submodule_sb, submodule))
2066 goto done;
2067
2068 subrepo = xmalloc(sizeof(*subrepo));
2069 /*
2070 * NEEDSWORK: Make get_submodule_ref_store() work with arbitrary
2071 * superprojects other than the_repository. This probably should be
2072 * done by making it take a struct repository * parameter instead of a
2073 * submodule path.
2074 */
2075 if (repo_submodule_init(subrepo, the_repository, submodule,
2076 null_oid())) {
2077 free(subrepo);
2078 goto done;
2079 }
2080 refs = ref_store_init(subrepo, submodule_sb.buf,
2081 REF_STORE_READ | REF_STORE_ODB);
2082 register_ref_store_map(&submodule_ref_stores, "submodule",
2083 refs, submodule);
2084
2085 done:
2086 strbuf_release(&submodule_sb);
2087 free(to_free);
2088
2089 return refs;
2090 }
2091
2092 struct ref_store *get_worktree_ref_store(const struct worktree *wt)
2093 {
2094 struct ref_store *refs;
2095 const char *id;
2096
2097 if (wt->is_current)
2098 return get_main_ref_store(the_repository);
2099
2100 id = wt->id ? wt->id : "/";
2101 refs = lookup_ref_store_map(&worktree_ref_stores, id);
2102 if (refs)
2103 return refs;
2104
2105 if (wt->id)
2106 refs = ref_store_init(the_repository,
2107 git_common_path("worktrees/%s", wt->id),
2108 REF_STORE_ALL_CAPS);
2109 else
2110 refs = ref_store_init(the_repository,
2111 get_git_common_dir(),
2112 REF_STORE_ALL_CAPS);
2113
2114 if (refs)
2115 register_ref_store_map(&worktree_ref_stores, "worktree",
2116 refs, id);
2117 return refs;
2118 }
2119
2120 void base_ref_store_init(struct ref_store *refs, struct repository *repo,
2121 const char *path, const struct ref_storage_be *be)
2122 {
2123 refs->be = be;
2124 refs->repo = repo;
2125 refs->gitdir = xstrdup(path);
2126 }
2127
2128 /* backend functions */
2129 int refs_pack_refs(struct ref_store *refs, unsigned int flags)
2130 {
2131 return refs->be->pack_refs(refs, flags);
2132 }
2133
2134 int peel_iterated_oid(const struct object_id *base, struct object_id *peeled)
2135 {
2136 if (current_ref_iter &&
2137 (current_ref_iter->oid == base ||
2138 oideq(current_ref_iter->oid, base)))
2139 return ref_iterator_peel(current_ref_iter, peeled);
2140
2141 return peel_object(base, peeled) ? -1 : 0;
2142 }
2143
2144 int refs_create_symref(struct ref_store *refs,
2145 const char *ref_target,
2146 const char *refs_heads_master,
2147 const char *logmsg)
2148 {
2149 char *msg;
2150 int retval;
2151
2152 msg = normalize_reflog_message(logmsg);
2153 retval = refs->be->create_symref(refs, ref_target, refs_heads_master,
2154 msg);
2155 free(msg);
2156 return retval;
2157 }
2158
2159 int create_symref(const char *ref_target, const char *refs_heads_master,
2160 const char *logmsg)
2161 {
2162 return refs_create_symref(get_main_ref_store(the_repository), ref_target,
2163 refs_heads_master, logmsg);
2164 }
2165
2166 int ref_update_reject_duplicates(struct string_list *refnames,
2167 struct strbuf *err)
2168 {
2169 size_t i, n = refnames->nr;
2170
2171 assert(err);
2172
2173 for (i = 1; i < n; i++) {
2174 int cmp = strcmp(refnames->items[i - 1].string,
2175 refnames->items[i].string);
2176
2177 if (!cmp) {
2178 strbuf_addf(err,
2179 _("multiple updates for ref '%s' not allowed"),
2180 refnames->items[i].string);
2181 return 1;
2182 } else if (cmp > 0) {
2183 BUG("ref_update_reject_duplicates() received unsorted list");
2184 }
2185 }
2186 return 0;
2187 }
2188
2189 static int run_transaction_hook(struct ref_transaction *transaction,
2190 const char *state)
2191 {
2192 struct child_process proc = CHILD_PROCESS_INIT;
2193 struct strbuf buf = STRBUF_INIT;
2194 const char *hook;
2195 int ret = 0, i;
2196
2197 hook = find_hook("reference-transaction");
2198 if (!hook)
2199 return ret;
2200
2201 strvec_pushl(&proc.args, hook, state, NULL);
2202 proc.in = -1;
2203 proc.stdout_to_stderr = 1;
2204 proc.trace2_hook_name = "reference-transaction";
2205
2206 ret = start_command(&proc);
2207 if (ret)
2208 return ret;
2209
2210 sigchain_push(SIGPIPE, SIG_IGN);
2211
2212 for (i = 0; i < transaction->nr; i++) {
2213 struct ref_update *update = transaction->updates[i];
2214
2215 strbuf_reset(&buf);
2216 strbuf_addf(&buf, "%s %s %s\n",
2217 oid_to_hex(&update->old_oid),
2218 oid_to_hex(&update->new_oid),
2219 update->refname);
2220
2221 if (write_in_full(proc.in, buf.buf, buf.len) < 0) {
2222 if (errno != EPIPE) {
2223 /* Don't leak errno outside this API */
2224 errno = 0;
2225 ret = -1;
2226 }
2227 break;
2228 }
2229 }
2230
2231 close(proc.in);
2232 sigchain_pop(SIGPIPE);
2233 strbuf_release(&buf);
2234
2235 ret |= finish_command(&proc);
2236 return ret;
2237 }
2238
2239 int ref_transaction_prepare(struct ref_transaction *transaction,
2240 struct strbuf *err)
2241 {
2242 struct ref_store *refs = transaction->ref_store;
2243 int ret;
2244
2245 switch (transaction->state) {
2246 case REF_TRANSACTION_OPEN:
2247 /* Good. */
2248 break;
2249 case REF_TRANSACTION_PREPARED:
2250 BUG("prepare called twice on reference transaction");
2251 break;
2252 case REF_TRANSACTION_CLOSED:
2253 BUG("prepare called on a closed reference transaction");
2254 break;
2255 default:
2256 BUG("unexpected reference transaction state");
2257 break;
2258 }
2259
2260 if (refs->repo->objects->odb->disable_ref_updates) {
2261 strbuf_addstr(err,
2262 _("ref updates forbidden inside quarantine environment"));
2263 return -1;
2264 }
2265
2266 ret = refs->be->transaction_prepare(refs, transaction, err);
2267 if (ret)
2268 return ret;
2269
2270 ret = run_transaction_hook(transaction, "prepared");
2271 if (ret) {
2272 ref_transaction_abort(transaction, err);
2273 die(_("ref updates aborted by hook"));
2274 }
2275
2276 return 0;
2277 }
2278
2279 int ref_transaction_abort(struct ref_transaction *transaction,
2280 struct strbuf *err)
2281 {
2282 struct ref_store *refs = transaction->ref_store;
2283 int ret = 0;
2284
2285 switch (transaction->state) {
2286 case REF_TRANSACTION_OPEN:
2287 /* No need to abort explicitly. */
2288 break;
2289 case REF_TRANSACTION_PREPARED:
2290 ret = refs->be->transaction_abort(refs, transaction, err);
2291 break;
2292 case REF_TRANSACTION_CLOSED:
2293 BUG("abort called on a closed reference transaction");
2294 break;
2295 default:
2296 BUG("unexpected reference transaction state");
2297 break;
2298 }
2299
2300 run_transaction_hook(transaction, "aborted");
2301
2302 ref_transaction_free(transaction);
2303 return ret;
2304 }
2305
2306 int ref_transaction_commit(struct ref_transaction *transaction,
2307 struct strbuf *err)
2308 {
2309 struct ref_store *refs = transaction->ref_store;
2310 int ret;
2311
2312 switch (transaction->state) {
2313 case REF_TRANSACTION_OPEN:
2314 /* Need to prepare first. */
2315 ret = ref_transaction_prepare(transaction, err);
2316 if (ret)
2317 return ret;
2318 break;
2319 case REF_TRANSACTION_PREPARED:
2320 /* Fall through to finish. */
2321 break;
2322 case REF_TRANSACTION_CLOSED:
2323 BUG("commit called on a closed reference transaction");
2324 break;
2325 default:
2326 BUG("unexpected reference transaction state");
2327 break;
2328 }
2329
2330 ret = refs->be->transaction_finish(refs, transaction, err);
2331 if (!ret)
2332 run_transaction_hook(transaction, "committed");
2333 return ret;
2334 }
2335
2336 int refs_verify_refname_available(struct ref_store *refs,
2337 const char *refname,
2338 const struct string_list *extras,
2339 const struct string_list *skip,
2340 struct strbuf *err)
2341 {
2342 const char *slash;
2343 const char *extra_refname;
2344 struct strbuf dirname = STRBUF_INIT;
2345 struct strbuf referent = STRBUF_INIT;
2346 struct object_id oid;
2347 unsigned int type;
2348 struct ref_iterator *iter;
2349 int ok;
2350 int ret = -1;
2351
2352 /*
2353 * For the sake of comments in this function, suppose that
2354 * refname is "refs/foo/bar".
2355 */
2356
2357 assert(err);
2358
2359 strbuf_grow(&dirname, strlen(refname) + 1);
2360 for (slash = strchr(refname, '/'); slash; slash = strchr(slash + 1, '/')) {
2361 /*
2362 * Just saying "Is a directory" when we e.g. can't
2363 * lock some multi-level ref isn't very informative,
2364 * the user won't be told *what* is a directory, so
2365 * let's not use strerror() below.
2366 */
2367 int ignore_errno;
2368 /* Expand dirname to the new prefix, not including the trailing slash: */
2369 strbuf_add(&dirname, refname + dirname.len, slash - refname - dirname.len);
2370
2371 /*
2372 * We are still at a leading dir of the refname (e.g.,
2373 * "refs/foo"; if there is a reference with that name,
2374 * it is a conflict, *unless* it is in skip.
2375 */
2376 if (skip && string_list_has_string(skip, dirname.buf))
2377 continue;
2378
2379 if (!refs_read_raw_ref(refs, dirname.buf, &oid, &referent,
2380 &type, &ignore_errno)) {
2381 strbuf_addf(err, _("'%s' exists; cannot create '%s'"),
2382 dirname.buf, refname);
2383 goto cleanup;
2384 }
2385
2386 if (extras && string_list_has_string(extras, dirname.buf)) {
2387 strbuf_addf(err, _("cannot process '%s' and '%s' at the same time"),
2388 refname, dirname.buf);
2389 goto cleanup;
2390 }
2391 }
2392
2393 /*
2394 * We are at the leaf of our refname (e.g., "refs/foo/bar").
2395 * There is no point in searching for a reference with that
2396 * name, because a refname isn't considered to conflict with
2397 * itself. But we still need to check for references whose
2398 * names are in the "refs/foo/bar/" namespace, because they
2399 * *do* conflict.
2400 */
2401 strbuf_addstr(&dirname, refname + dirname.len);
2402 strbuf_addch(&dirname, '/');
2403
2404 iter = refs_ref_iterator_begin(refs, dirname.buf, 0,
2405 DO_FOR_EACH_INCLUDE_BROKEN);
2406 while ((ok = ref_iterator_advance(iter)) == ITER_OK) {
2407 if (skip &&
2408 string_list_has_string(skip, iter->refname))
2409 continue;
2410
2411 strbuf_addf(err, _("'%s' exists; cannot create '%s'"),
2412 iter->refname, refname);
2413 ref_iterator_abort(iter);
2414 goto cleanup;
2415 }
2416
2417 if (ok != ITER_DONE)
2418 BUG("error while iterating over references");
2419
2420 extra_refname = find_descendant_ref(dirname.buf, extras, skip);
2421 if (extra_refname)
2422 strbuf_addf(err, _("cannot process '%s' and '%s' at the same time"),
2423 refname, extra_refname);
2424 else
2425 ret = 0;
2426
2427 cleanup:
2428 strbuf_release(&referent);
2429 strbuf_release(&dirname);
2430 return ret;
2431 }
2432
2433 int refs_for_each_reflog(struct ref_store *refs, each_ref_fn fn, void *cb_data)
2434 {
2435 struct ref_iterator *iter;
2436 struct do_for_each_ref_help hp = { fn, cb_data };
2437
2438 iter = refs->be->reflog_iterator_begin(refs);
2439
2440 return do_for_each_repo_ref_iterator(the_repository, iter,
2441 do_for_each_ref_helper, &hp);
2442 }
2443
2444 int for_each_reflog(each_ref_fn fn, void *cb_data)
2445 {
2446 return refs_for_each_reflog(get_main_ref_store(the_repository), fn, cb_data);
2447 }
2448
2449 int refs_for_each_reflog_ent_reverse(struct ref_store *refs,
2450 const char *refname,
2451 each_reflog_ent_fn fn,
2452 void *cb_data)
2453 {
2454 return refs->be->for_each_reflog_ent_reverse(refs, refname,
2455 fn, cb_data);
2456 }
2457
2458 int for_each_reflog_ent_reverse(const char *refname, each_reflog_ent_fn fn,
2459 void *cb_data)
2460 {
2461 return refs_for_each_reflog_ent_reverse(get_main_ref_store(the_repository),
2462 refname, fn, cb_data);
2463 }
2464
2465 int refs_for_each_reflog_ent(struct ref_store *refs, const char *refname,
2466 each_reflog_ent_fn fn, void *cb_data)
2467 {
2468 return refs->be->for_each_reflog_ent(refs, refname, fn, cb_data);
2469 }
2470
2471 int for_each_reflog_ent(const char *refname, each_reflog_ent_fn fn,
2472 void *cb_data)
2473 {
2474 return refs_for_each_reflog_ent(get_main_ref_store(the_repository), refname,
2475 fn, cb_data);
2476 }
2477
2478 int refs_reflog_exists(struct ref_store *refs, const char *refname)
2479 {
2480 return refs->be->reflog_exists(refs, refname);
2481 }
2482
2483 int reflog_exists(const char *refname)
2484 {
2485 return refs_reflog_exists(get_main_ref_store(the_repository), refname);
2486 }
2487
2488 int refs_create_reflog(struct ref_store *refs, const char *refname,
2489 struct strbuf *err)
2490 {
2491 return refs->be->create_reflog(refs, refname, err);
2492 }
2493
2494 int safe_create_reflog(const char *refname, struct strbuf *err)
2495 {
2496 return refs_create_reflog(get_main_ref_store(the_repository), refname,
2497 err);
2498 }
2499
2500 int refs_delete_reflog(struct ref_store *refs, const char *refname)
2501 {
2502 return refs->be->delete_reflog(refs, refname);
2503 }
2504
2505 int delete_reflog(const char *refname)
2506 {
2507 return refs_delete_reflog(get_main_ref_store(the_repository), refname);
2508 }
2509
2510 int refs_reflog_expire(struct ref_store *refs,
2511 const char *refname,
2512 unsigned int flags,
2513 reflog_expiry_prepare_fn prepare_fn,
2514 reflog_expiry_should_prune_fn should_prune_fn,
2515 reflog_expiry_cleanup_fn cleanup_fn,
2516 void *policy_cb_data)
2517 {
2518 return refs->be->reflog_expire(refs, refname, flags,
2519 prepare_fn, should_prune_fn,
2520 cleanup_fn, policy_cb_data);
2521 }
2522
2523 int reflog_expire(const char *refname,
2524 unsigned int flags,
2525 reflog_expiry_prepare_fn prepare_fn,
2526 reflog_expiry_should_prune_fn should_prune_fn,
2527 reflog_expiry_cleanup_fn cleanup_fn,
2528 void *policy_cb_data)
2529 {
2530 return refs_reflog_expire(get_main_ref_store(the_repository),
2531 refname, flags,
2532 prepare_fn, should_prune_fn,
2533 cleanup_fn, policy_cb_data);
2534 }
2535
2536 int initial_ref_transaction_commit(struct ref_transaction *transaction,
2537 struct strbuf *err)
2538 {
2539 struct ref_store *refs = transaction->ref_store;
2540
2541 return refs->be->initial_transaction_commit(refs, transaction, err);
2542 }
2543
2544 void ref_transaction_for_each_queued_update(struct ref_transaction *transaction,
2545 ref_transaction_for_each_queued_update_fn cb,
2546 void *cb_data)
2547 {
2548 int i;
2549
2550 for (i = 0; i < transaction->nr; i++) {
2551 struct ref_update *update = transaction->updates[i];
2552
2553 cb(update->refname,
2554 (update->flags & REF_HAVE_OLD) ? &update->old_oid : NULL,
2555 (update->flags & REF_HAVE_NEW) ? &update->new_oid : NULL,
2556 cb_data);
2557 }
2558 }
2559
2560 int refs_delete_refs(struct ref_store *refs, const char *logmsg,
2561 struct string_list *refnames, unsigned int flags)
2562 {
2563 char *msg;
2564 int retval;
2565
2566 msg = normalize_reflog_message(logmsg);
2567 retval = refs->be->delete_refs(refs, msg, refnames, flags);
2568 free(msg);
2569 return retval;
2570 }
2571
2572 int delete_refs(const char *msg, struct string_list *refnames,
2573 unsigned int flags)
2574 {
2575 return refs_delete_refs(get_main_ref_store(the_repository), msg, refnames, flags);
2576 }
2577
2578 int refs_rename_ref(struct ref_store *refs, const char *oldref,
2579 const char *newref, const char *logmsg)
2580 {
2581 char *msg;
2582 int retval;
2583
2584 msg = normalize_reflog_message(logmsg);
2585 retval = refs->be->rename_ref(refs, oldref, newref, msg);
2586 free(msg);
2587 return retval;
2588 }
2589
2590 int rename_ref(const char *oldref, const char *newref, const char *logmsg)
2591 {
2592 return refs_rename_ref(get_main_ref_store(the_repository), oldref, newref, logmsg);
2593 }
2594
2595 int refs_copy_existing_ref(struct ref_store *refs, const char *oldref,
2596 const char *newref, const char *logmsg)
2597 {
2598 char *msg;
2599 int retval;
2600
2601 msg = normalize_reflog_message(logmsg);
2602 retval = refs->be->copy_ref(refs, oldref, newref, msg);
2603 free(msg);
2604 return retval;
2605 }
2606
2607 int copy_existing_ref(const char *oldref, const char *newref, const char *logmsg)
2608 {
2609 return refs_copy_existing_ref(get_main_ref_store(the_repository), oldref, newref, logmsg);
2610 }