refs.c 33.5 KB
Newer Older
1 2 3 4
/*
 * The backend-independent part of the reference module.
 */

D
Daniel Barkalow 已提交
5
#include "cache.h"
6
#include "lockfile.h"
7
#include "refs.h"
8
#include "refs/refs-internal.h"
9 10
#include "object.h"
#include "tag.h"
11

12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30
/*
 * List of all available backends
 */
static struct ref_storage_be *refs_backends = &refs_be_files;

static struct ref_storage_be *find_ref_storage_backend(const char *name)
{
	struct ref_storage_be *be;
	for (be = refs_backends; be; be = be->next)
		if (!strcmp(be->name, name))
			return be;
	return NULL;
}

int ref_storage_backend_exists(const char *name)
{
	return find_ref_storage_backend(name) != NULL;
}

31
/*
32 33
 * How to handle various characters in refnames:
 * 0: An acceptable character for refs
34 35 36
 * 1: End-of-component
 * 2: ., look for a preceding . to reject .. in refs
 * 3: {, look for a preceding @ to reject @{ in refs
37
 * 4: A bad character: ASCII control characters, and
38 39
 *    ":", "?", "[", "\", "^", "~", SP, or TAB
 * 5: *, reject unless REFNAME_REFSPEC_PATTERN is set
40 41
 */
static unsigned char refname_disposition[256] = {
42 43
	1, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
	4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
44
	4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 2, 1,
45
	0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 4,
46
	0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
47 48 49
	0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 4, 0, 4, 0,
	0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
	0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 4, 4
50 51 52 53 54 55 56
};

/*
 * Try to read one refname component from the front of refname.
 * Return the length of the component found, or -1 if the component is
 * not legal.  It is legal if it is something reasonable to have under
 * ".git/refs/"; We do not like it if:
57 58 59
 *
 * - any path component of it begins with ".", or
 * - it has double dots "..", or
60
 * - it has ASCII control characters, or
61 62
 * - it has ":", "?", "[", "\", "^", "~", SP, or TAB anywhere, or
 * - it has "*" anywhere unless REFNAME_REFSPEC_PATTERN is set, or
63 64 65
 * - it ends with a "/", or
 * - it ends with ".lock", or
 * - it contains a "@{" portion
66
 */
67
static int check_refname_component(const char *refname, int *flags)
68 69 70 71 72
{
	const char *cp;
	char last = '\0';

	for (cp = refname; ; cp++) {
73 74 75
		int ch = *cp & 255;
		unsigned char disp = refname_disposition[ch];
		switch (disp) {
76
		case 1:
77
			goto out;
78
		case 2:
79 80 81
			if (last == '.')
				return -1; /* Refname contains "..". */
			break;
82
		case 3:
83 84
			if (last == '@')
				return -1; /* Refname contains "@{". */
85
			break;
86
		case 4:
87
			return -1;
88 89 90 91 92 93 94 95 96 97
		case 5:
			if (!(*flags & REFNAME_REFSPEC_PATTERN))
				return -1; /* refspec can't be a pattern */

			/*
			 * Unset the pattern flag so that we only accept
			 * a single asterisk for one side of refspec.
			 */
			*flags &= ~ REFNAME_REFSPEC_PATTERN;
			break;
98
		}
99 100
		last = ch;
	}
101
out:
102
	if (cp == refname)
103
		return 0; /* Component has zero length. */
104 105
	if (refname[0] == '.')
		return -1; /* Component starts with '.'. */
106 107
	if (cp - refname >= LOCK_SUFFIX_LEN &&
	    !memcmp(cp - LOCK_SUFFIX_LEN, LOCK_SUFFIX, LOCK_SUFFIX_LEN))
108 109 110 111
		return -1; /* Refname ends with ".lock". */
	return cp - refname;
}

112
int check_refname_format(const char *refname, int flags)
113 114 115
{
	int component_len, component_count = 0;

F
Felipe Contreras 已提交
116 117 118 119
	if (!strcmp(refname, "@"))
		/* Refname is a single character '@'. */
		return -1;

120 121
	while (1) {
		/* We are at the start of a path component. */
122 123 124 125
		component_len = check_refname_component(refname, &flags);
		if (component_len <= 0)
			return -1;

126 127 128 129 130 131 132 133 134 135 136 137 138 139
		component_count++;
		if (refname[component_len] == '\0')
			break;
		/* Skip to next component. */
		refname += component_len + 1;
	}

	if (refname[component_len - 1] == '.')
		return -1; /* Refname ends with '.'. */
	if (!(flags & REFNAME_ALLOW_ONELEVEL) && component_count < 2)
		return -1; /* Refname has only one component. */
	return 0;
}

140
int refname_is_safe(const char *refname)
141
{
142 143 144
	const char *rest;

	if (skip_prefix(refname, "refs/", &rest)) {
145 146
		char *buf;
		int result;
147 148 149 150 151
		size_t restlen = strlen(rest);

		/* rest must not be empty, or start or end with "/" */
		if (!restlen || *rest == '/' || rest[restlen - 1] == '/')
			return 0;
152 153 154 155 156 157

		/*
		 * Does the refname try to escape refs/?
		 * For example: refs/foo/../bar is safe but refs/foo/../../bar
		 * is not.
		 */
158 159
		buf = xmallocz(restlen);
		result = !normalize_path_copy(buf, rest) && !strcmp(buf, rest);
160 161 162
		free(buf);
		return result;
	}
163 164

	do {
165 166 167
		if (!isupper(*refname) && *refname != '_')
			return 0;
		refname++;
168
	} while (*refname);
169 170 171
	return 1;
}

172 173
char *resolve_refdup(const char *refname, int resolve_flags,
		     unsigned char *sha1, int *flags)
174
{
175 176
	return xstrdup_or_null(resolve_ref_unsafe(refname, resolve_flags,
						  sha1, flags));
177 178
}

179 180 181 182 183 184
/* The argument to filter_refs */
struct ref_filter {
	const char *pattern;
	each_ref_fn *fn;
	void *cb_data;
};
185

186
int read_ref_full(const char *refname, int resolve_flags, unsigned char *sha1, int *flags)
187
{
188 189 190
	if (resolve_ref_unsafe(refname, resolve_flags, sha1, flags))
		return 0;
	return -1;
191 192
}

193
int read_ref(const char *refname, unsigned char *sha1)
194
{
195
	return read_ref_full(refname, RESOLVE_REF_READING, sha1, NULL);
196 197
}

198
int ref_exists(const char *refname)
199
{
200 201
	unsigned char sha1[20];
	return !!resolve_ref_unsafe(refname, RESOLVE_REF_READING, sha1, NULL);
202 203
}

204 205
static int filter_refs(const char *refname, const struct object_id *oid,
			   int flags, void *data)
206
{
207 208 209 210 211
	struct ref_filter *filter = (struct ref_filter *)data;

	if (wildmatch(filter->pattern, refname, 0, NULL))
		return 0;
	return filter->fn(refname, oid, flags, filter->cb_data);
212 213
}

214
enum peel_status peel_object(const unsigned char *name, unsigned char *sha1)
215
{
216
	struct object *o = lookup_unknown_object(name);
217

218 219 220 221 222
	if (o->type == OBJ_NONE) {
		int type = sha1_object_info(name, NULL);
		if (type < 0 || !object_as_type(o, type, 0))
			return PEEL_INVALID;
	}
223

224 225
	if (o->type != OBJ_TAG)
		return PEEL_NON_TAG;
226

227 228 229 230
	o = deref_tag_noverify(o);
	if (!o)
		return PEEL_INVALID;

J
Junio C Hamano 已提交
231
	hashcpy(sha1, o->oid.hash);
232
	return PEEL_PEELED;
233 234
}

235 236 237 238 239 240
struct warn_if_dangling_data {
	FILE *fp;
	const char *refname;
	const struct string_list *refnames;
	const char *msg_fmt;
};
241

242 243 244 245 246 247
static int warn_if_dangling_symref(const char *refname, const struct object_id *oid,
				   int flags, void *cb_data)
{
	struct warn_if_dangling_data *d = cb_data;
	const char *resolves_to;
	struct object_id junk;
248

249 250
	if (!(flags & REF_ISSYMREF))
		return 0;
251

252 253 254 255 256 257 258
	resolves_to = resolve_ref_unsafe(refname, 0, junk.hash, NULL);
	if (!resolves_to
	    || (d->refname
		? strcmp(resolves_to, d->refname)
		: !string_list_has_string(d->refnames, resolves_to))) {
		return 0;
	}
259

260 261 262
	fprintf(d->fp, d->msg_fmt, refname);
	fputc('\n', d->fp);
	return 0;
263 264
}

265
void warn_dangling_symref(FILE *fp, const char *msg_fmt, const char *refname)
266
{
267 268 269 270 271 272 273
	struct warn_if_dangling_data data;

	data.fp = fp;
	data.refname = refname;
	data.refnames = NULL;
	data.msg_fmt = msg_fmt;
	for_each_rawref(warn_if_dangling_symref, &data);
274 275
}

276
void warn_dangling_symrefs(FILE *fp, const char *msg_fmt, const struct string_list *refnames)
277
{
278
	struct warn_if_dangling_data data;
279

280 281 282 283 284
	data.fp = fp;
	data.refname = NULL;
	data.refnames = refnames;
	data.msg_fmt = msg_fmt;
	for_each_rawref(warn_if_dangling_symref, &data);
285 286
}

287
int for_each_tag_ref(each_ref_fn fn, void *cb_data)
288
{
289
	return for_each_ref_in("refs/tags/", fn, cb_data);
290 291
}

292
int for_each_tag_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
293
{
294
	return for_each_ref_in_submodule(submodule, "refs/tags/", fn, cb_data);
295 296
}

297
int for_each_branch_ref(each_ref_fn fn, void *cb_data)
298
{
299
	return for_each_ref_in("refs/heads/", fn, cb_data);
300 301
}

302
int for_each_branch_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
303
{
304
	return for_each_ref_in_submodule(submodule, "refs/heads/", fn, cb_data);
305
}
306

307
int for_each_remote_ref(each_ref_fn fn, void *cb_data)
308
{
309
	return for_each_ref_in("refs/remotes/", fn, cb_data);
310 311
}

312
int for_each_remote_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
313
{
314
	return for_each_ref_in_submodule(submodule, "refs/remotes/", fn, cb_data);
315
}
316

317 318 319 320 321 322
int head_ref_namespaced(each_ref_fn fn, void *cb_data)
{
	struct strbuf buf = STRBUF_INIT;
	int ret = 0;
	struct object_id oid;
	int flag;
323

324 325 326 327
	strbuf_addf(&buf, "%sHEAD", get_git_namespace());
	if (!read_ref_full(buf.buf, RESOLVE_REF_READING, oid.hash, &flag))
		ret = fn(buf.buf, &oid, flag, cb_data);
	strbuf_release(&buf);
328

329
	return ret;
330
}
331

332 333
int for_each_glob_ref_in(each_ref_fn fn, const char *pattern,
	const char *prefix, void *cb_data)
334
{
335 336 337
	struct strbuf real_pattern = STRBUF_INIT;
	struct ref_filter filter;
	int ret;
I
Ilari Liusvaara 已提交
338

339
	if (!prefix && !starts_with(pattern, "refs/"))
I
Ilari Liusvaara 已提交
340
		strbuf_addstr(&real_pattern, "refs/");
341 342
	else if (prefix)
		strbuf_addstr(&real_pattern, prefix);
I
Ilari Liusvaara 已提交
343 344
	strbuf_addstr(&real_pattern, pattern);

345
	if (!has_glob_specials(pattern)) {
346
		/* Append implied '/' '*' if not present. */
347
		strbuf_complete(&real_pattern, '/');
I
Ilari Liusvaara 已提交
348 349 350 351 352 353 354 355 356 357 358 359 360
		/* No need to check for '*', there is none. */
		strbuf_addch(&real_pattern, '*');
	}

	filter.pattern = real_pattern.buf;
	filter.fn = fn;
	filter.cb_data = cb_data;
	ret = for_each_ref(filter_refs, &filter);

	strbuf_release(&real_pattern);
	return ret;
}

361 362 363 364 365
int for_each_glob_ref(each_ref_fn fn, const char *pattern, void *cb_data)
{
	return for_each_glob_ref_in(fn, pattern, NULL, cb_data);
}

366
const char *prettify_refname(const char *name)
367 368
{
	return name + (
369 370 371
		starts_with(name, "refs/heads/") ? 11 :
		starts_with(name, "refs/tags/") ? 10 :
		starts_with(name, "refs/remotes/") ? 13 :
372 373 374
		0);
}

375
static const char *ref_rev_parse_rules[] = {
S
Steffen Prohaska 已提交
376 377 378 379 380 381 382 383 384
	"%.*s",
	"refs/%.*s",
	"refs/tags/%.*s",
	"refs/heads/%.*s",
	"refs/remotes/%.*s",
	"refs/remotes/%.*s/HEAD",
	NULL
};

385
int refname_match(const char *abbrev_name, const char *full_name)
S
Steffen Prohaska 已提交
386 387 388 389
{
	const char **p;
	const int abbrev_name_len = strlen(abbrev_name);

390
	for (p = ref_rev_parse_rules; *p; p++) {
S
Steffen Prohaska 已提交
391 392 393 394 395 396 397 398
		if (!strcmp(full_name, mkpath(*p, abbrev_name_len, abbrev_name))) {
			return 1;
		}
	}

	return 0;
}

399 400 401 402 403 404 405 406
/*
 * *string and *len will only be substituted, and *string returned (for
 * later free()ing) if the string passed in is a magic short-hand form
 * to name a branch.
 */
static char *substitute_branch_name(const char **string, int *len)
{
	struct strbuf buf = STRBUF_INIT;
407
	int ret = interpret_branch_name(*string, *len, &buf);
408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433

	if (ret == *len) {
		size_t size;
		*string = strbuf_detach(&buf, &size);
		*len = size;
		return (char *)*string;
	}

	return NULL;
}

int dwim_ref(const char *str, int len, unsigned char *sha1, char **ref)
{
	char *last_branch = substitute_branch_name(&str, &len);
	const char **p, *r;
	int refs_found = 0;

	*ref = NULL;
	for (p = ref_rev_parse_rules; *p; p++) {
		char fullref[PATH_MAX];
		unsigned char sha1_from_ref[20];
		unsigned char *this_result;
		int flag;

		this_result = refs_found ? sha1_from_ref : sha1;
		mksnpath(fullref, sizeof(fullref), *p, len, str);
434 435
		r = resolve_ref_unsafe(fullref, RESOLVE_REF_READING,
				       this_result, &flag);
436 437 438 439 440
		if (r) {
			if (!refs_found++)
				*ref = xstrdup(r);
			if (!warn_ambiguous_refs)
				break;
441
		} else if ((flag & REF_ISSYMREF) && strcmp(fullref, "HEAD")) {
442
			warning("ignoring dangling symref %s.", fullref);
443 444 445
		} else if ((flag & REF_ISBROKEN) && strchr(fullref, '/')) {
			warning("ignoring broken ref %s.", fullref);
		}
446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463
	}
	free(last_branch);
	return refs_found;
}

int dwim_log(const char *str, int len, unsigned char *sha1, char **log)
{
	char *last_branch = substitute_branch_name(&str, &len);
	const char **p;
	int logs_found = 0;

	*log = NULL;
	for (p = ref_rev_parse_rules; *p; p++) {
		unsigned char hash[20];
		char path[PATH_MAX];
		const char *ref, *it;

		mksnpath(path, sizeof(path), *p, len, str);
464 465
		ref = resolve_ref_unsafe(path, RESOLVE_REF_READING,
					 hash, NULL);
466 467
		if (!ref)
			continue;
468
		if (reflog_exists(path))
469
			it = path;
470
		else if (strcmp(ref, path) && reflog_exists(ref))
471 472 473 474 475 476 477
			it = ref;
		else
			continue;
		if (!logs_found++) {
			*log = xstrdup(it);
			hashcpy(sha1, hash);
		}
478 479
		if (!warn_ambiguous_refs)
			break;
J
Junio C Hamano 已提交
480
	}
481 482
	free(last_branch);
	return logs_found;
483 484
}

D
David Turner 已提交
485 486
static int is_per_worktree_ref(const char *refname)
{
487 488
	return !strcmp(refname, "HEAD") ||
		starts_with(refname, "refs/bisect/");
D
David Turner 已提交
489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511
}

static int is_pseudoref_syntax(const char *refname)
{
	const char *c;

	for (c = refname; *c; c++) {
		if (!isupper(*c) && *c != '-' && *c != '_')
			return 0;
	}

	return 1;
}

enum ref_type ref_type(const char *refname)
{
	if (is_per_worktree_ref(refname))
		return REF_TYPE_PER_WORKTREE;
	if (is_pseudoref_syntax(refname))
		return REF_TYPE_PSEUDOREF;
       return REF_TYPE_NORMAL;
}

512 513 514 515 516 517 518 519 520 521 522 523 524 525
static int write_pseudoref(const char *pseudoref, const unsigned char *sha1,
			   const unsigned char *old_sha1, struct strbuf *err)
{
	const char *filename;
	int fd;
	static struct lock_file lock;
	struct strbuf buf = STRBUF_INIT;
	int ret = -1;

	strbuf_addf(&buf, "%s\n", sha1_to_hex(sha1));

	filename = git_path("%s", pseudoref);
	fd = hold_lock_file_for_update(&lock, filename, LOCK_DIE_ON_ERROR);
	if (fd < 0) {
526
		strbuf_addf(err, "could not open '%s' for writing: %s",
527 528 529 530 531 532
			    filename, strerror(errno));
		return -1;
	}

	if (old_sha1) {
		unsigned char actual_old_sha1[20];
533 534 535

		if (read_ref(pseudoref, actual_old_sha1))
			die("could not read ref '%s'", pseudoref);
536
		if (hashcmp(actual_old_sha1, old_sha1)) {
537
			strbuf_addf(err, "unexpected sha1 when writing '%s'", pseudoref);
538 539 540 541 542 543
			rollback_lock_file(&lock);
			goto done;
		}
	}

	if (write_in_full(fd, buf.buf, buf.len) != buf.len) {
544
		strbuf_addf(err, "could not write to '%s'", filename);
545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570
		rollback_lock_file(&lock);
		goto done;
	}

	commit_lock_file(&lock);
	ret = 0;
done:
	strbuf_release(&buf);
	return ret;
}

static int delete_pseudoref(const char *pseudoref, const unsigned char *old_sha1)
{
	static struct lock_file lock;
	const char *filename;

	filename = git_path("%s", pseudoref);

	if (old_sha1 && !is_null_sha1(old_sha1)) {
		int fd;
		unsigned char actual_old_sha1[20];

		fd = hold_lock_file_for_update(&lock, filename,
					       LOCK_DIE_ON_ERROR);
		if (fd < 0)
			die_errno(_("Could not open '%s' for writing"), filename);
571 572
		if (read_ref(pseudoref, actual_old_sha1))
			die("could not read ref '%s'", pseudoref);
573 574 575 576
		if (hashcmp(actual_old_sha1, old_sha1)) {
			warning("Unexpected sha1 when deleting %s", pseudoref);
			rollback_lock_file(&lock);
			return -1;
577
		}
578 579 580 581 582

		unlink(filename);
		rollback_lock_file(&lock);
	} else {
		unlink(filename);
583
	}
584

585
	return 0;
D
Daniel Barkalow 已提交
586
}
587

588 589
int delete_ref(const char *refname, const unsigned char *old_sha1,
	       unsigned int flags)
590
{
591
	struct ref_transaction *transaction;
592
	struct strbuf err = STRBUF_INIT;
593

594
	if (ref_type(refname) == REF_TYPE_PSEUDOREF)
J
Junio C Hamano 已提交
595
		return delete_pseudoref(refname, old_sha1);
596

597 598
	transaction = ref_transaction_begin(&err);
	if (!transaction ||
599
	    ref_transaction_delete(transaction, refname, old_sha1,
600
				   flags, NULL, &err) ||
601
	    ref_transaction_commit(transaction, &err)) {
602 603 604
		error("%s", err.buf);
		ref_transaction_free(transaction);
		strbuf_release(&err);
J
Junio C Hamano 已提交
605
		return 1;
606
	}
607 608
	ref_transaction_free(transaction);
	strbuf_release(&err);
609 610
	return 0;
}
611

612
int copy_reflog_msg(char *buf, const char *msg)
613 614 615 616
{
	char *cp = buf;
	char c;
	int wasspace = 1;
617

618 619 620 621 622 623 624 625
	*cp++ = '\t';
	while ((c = *msg++)) {
		if (wasspace && isspace(c))
			continue;
		wasspace = isspace(c);
		if (wasspace)
			c = ' ';
		*cp++ = c;
626
	}
627 628 629 630 631
	while (buf < cp && isspace(cp[-1]))
		cp--;
	*cp++ = '\n';
	return cp - buf;
}
632

633
int should_autocreate_reflog(const char *refname)
634 635 636 637 638 639 640 641 642
{
	if (!log_all_ref_updates)
		return 0;
	return starts_with(refname, "refs/heads/") ||
		starts_with(refname, "refs/remotes/") ||
		starts_with(refname, "refs/notes/") ||
		!strcmp(refname, "HEAD");
}

643
int is_branch(const char *refname)
644
{
645
	return !strcmp(refname, "HEAD") || starts_with(refname, "refs/heads/");
646 647
}

648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692
struct read_ref_at_cb {
	const char *refname;
	unsigned long at_time;
	int cnt;
	int reccnt;
	unsigned char *sha1;
	int found_it;

	unsigned char osha1[20];
	unsigned char nsha1[20];
	int tz;
	unsigned long date;
	char **msg;
	unsigned long *cutoff_time;
	int *cutoff_tz;
	int *cutoff_cnt;
};

static int read_ref_at_ent(unsigned char *osha1, unsigned char *nsha1,
		const char *email, unsigned long timestamp, int tz,
		const char *message, void *cb_data)
{
	struct read_ref_at_cb *cb = cb_data;

	cb->reccnt++;
	cb->tz = tz;
	cb->date = timestamp;

	if (timestamp <= cb->at_time || cb->cnt == 0) {
		if (cb->msg)
			*cb->msg = xstrdup(message);
		if (cb->cutoff_time)
			*cb->cutoff_time = timestamp;
		if (cb->cutoff_tz)
			*cb->cutoff_tz = tz;
		if (cb->cutoff_cnt)
			*cb->cutoff_cnt = cb->reccnt - 1;
		/*
		 * we have not yet updated cb->[n|o]sha1 so they still
		 * hold the values for the previous record.
		 */
		if (!is_null_sha1(cb->osha1)) {
			hashcpy(cb->sha1, nsha1);
			if (hashcmp(cb->osha1, nsha1))
				warning("Log for ref %s has gap after %s.",
693
					cb->refname, show_date(cb->date, cb->tz, DATE_MODE(RFC2822)));
694 695 696 697 698 699
		}
		else if (cb->date == cb->at_time)
			hashcpy(cb->sha1, nsha1);
		else if (hashcmp(nsha1, cb->sha1))
			warning("Log for ref %s unexpectedly ended on %s.",
				cb->refname, show_date(cb->date, cb->tz,
700
						       DATE_MODE(RFC2822)));
701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731
		hashcpy(cb->osha1, osha1);
		hashcpy(cb->nsha1, nsha1);
		cb->found_it = 1;
		return 1;
	}
	hashcpy(cb->osha1, osha1);
	hashcpy(cb->nsha1, nsha1);
	if (cb->cnt > 0)
		cb->cnt--;
	return 0;
}

static int read_ref_at_ent_oldest(unsigned char *osha1, unsigned char *nsha1,
				  const char *email, unsigned long timestamp,
				  int tz, const char *message, void *cb_data)
{
	struct read_ref_at_cb *cb = cb_data;

	if (cb->msg)
		*cb->msg = xstrdup(message);
	if (cb->cutoff_time)
		*cb->cutoff_time = timestamp;
	if (cb->cutoff_tz)
		*cb->cutoff_tz = tz;
	if (cb->cutoff_cnt)
		*cb->cutoff_cnt = cb->reccnt;
	hashcpy(cb->sha1, osha1);
	if (is_null_sha1(cb->sha1))
		hashcpy(cb->sha1, nsha1);
	/* We just want the first entry */
	return 1;
732 733
}

734
int read_ref_at(const char *refname, unsigned int flags, unsigned long at_time, int cnt,
735 736
		unsigned char *sha1, char **msg,
		unsigned long *cutoff_time, int *cutoff_tz, int *cutoff_cnt)
737
{
738
	struct read_ref_at_cb cb;
739

740 741 742 743 744 745 746 747 748 749 750 751
	memset(&cb, 0, sizeof(cb));
	cb.refname = refname;
	cb.at_time = at_time;
	cb.cnt = cnt;
	cb.msg = msg;
	cb.cutoff_time = cutoff_time;
	cb.cutoff_tz = cutoff_tz;
	cb.cutoff_cnt = cutoff_cnt;
	cb.sha1 = sha1;

	for_each_reflog_ent_reverse(refname, read_ref_at_ent, &cb);

752 753 754 755 756 757
	if (!cb.reccnt) {
		if (flags & GET_SHA1_QUIETLY)
			exit(128);
		else
			die("Log for %s is empty.", refname);
	}
758 759 760 761
	if (cb.found_it)
		return 0;

	for_each_reflog_ent(refname, read_ref_at_ent_oldest, &cb);
762

763
	return 1;
764
}
765

766
struct ref_transaction *ref_transaction_begin(struct strbuf *err)
767
{
768 769
	assert(err);

770 771 772
	return xcalloc(1, sizeof(struct ref_transaction));
}

773
void ref_transaction_free(struct ref_transaction *transaction)
774 775 776
{
	int i;

777 778 779
	if (!transaction)
		return;

780 781
	for (i = 0; i < transaction->nr; i++) {
		free(transaction->updates[i]->msg);
782
		free(transaction->updates[i]);
783
	}
784 785 786 787
	free(transaction->updates);
	free(transaction);
}

788 789 790 791 792 793
struct ref_update *ref_transaction_add_update(
		struct ref_transaction *transaction,
		const char *refname, unsigned int flags,
		const unsigned char *new_sha1,
		const unsigned char *old_sha1,
		const char *msg)
794
{
795
	struct ref_update *update;
796 797 798 799 800 801 802

	if (transaction->state != REF_TRANSACTION_OPEN)
		die("BUG: update called for transaction that is not open");

	if ((flags & REF_ISPRUNING) && !(flags & REF_NODEREF))
		die("BUG: REF_ISPRUNING set without REF_NODEREF");

803
	FLEX_ALLOC_STR(update, refname, refname);
804 805
	ALLOC_GROW(transaction->updates, transaction->nr + 1, transaction->alloc);
	transaction->updates[transaction->nr++] = update;
806 807 808 809 810 811 812 813 814

	update->flags = flags;

	if (flags & REF_HAVE_NEW)
		hashcpy(update->new_sha1, new_sha1);
	if (flags & REF_HAVE_OLD)
		hashcpy(update->old_sha1, old_sha1);
	if (msg)
		update->msg = xstrdup(msg);
815 816 817
	return update;
}

818 819 820 821
int ref_transaction_update(struct ref_transaction *transaction,
			   const char *refname,
			   const unsigned char *new_sha1,
			   const unsigned char *old_sha1,
822
			   unsigned int flags, const char *msg,
823
			   struct strbuf *err)
824
{
825 826
	assert(err);

827 828 829
	if ((new_sha1 && !is_null_sha1(new_sha1)) ?
	    check_refname_format(refname, REFNAME_ALLOW_ONELEVEL) :
	    !refname_is_safe(refname)) {
830
		strbuf_addf(err, "refusing to update ref with bad name '%s'",
831 832 833 834
			    refname);
		return -1;
	}

835 836 837 838
	flags |= (new_sha1 ? REF_HAVE_NEW : 0) | (old_sha1 ? REF_HAVE_OLD : 0);

	ref_transaction_add_update(transaction, refname, flags,
				   new_sha1, old_sha1, msg);
839
	return 0;
840 841
}

842 843 844
int ref_transaction_create(struct ref_transaction *transaction,
			   const char *refname,
			   const unsigned char *new_sha1,
845
			   unsigned int flags, const char *msg,
846
			   struct strbuf *err)
847
{
848 849
	if (!new_sha1 || is_null_sha1(new_sha1))
		die("BUG: create called without valid new_sha1");
850
	return ref_transaction_update(transaction, refname, new_sha1,
851
				      null_sha1, flags, msg, err);
852 853
}

854 855 856
int ref_transaction_delete(struct ref_transaction *transaction,
			   const char *refname,
			   const unsigned char *old_sha1,
857
			   unsigned int flags, const char *msg,
858
			   struct strbuf *err)
859
{
860 861
	if (old_sha1 && is_null_sha1(old_sha1))
		die("BUG: delete called with old_sha1 set to zeros");
862
	return ref_transaction_update(transaction, refname,
863
				      null_sha1, old_sha1,
864
				      flags, msg, err);
865 866
}

867 868 869 870 871 872 873 874 875 876 877 878 879
int ref_transaction_verify(struct ref_transaction *transaction,
			   const char *refname,
			   const unsigned char *old_sha1,
			   unsigned int flags,
			   struct strbuf *err)
{
	if (!old_sha1)
		die("BUG: verify called with old_sha1 set to NULL");
	return ref_transaction_update(transaction, refname,
				      NULL, old_sha1,
				      flags, NULL, err);
}

880 881
int update_ref(const char *msg, const char *refname,
	       const unsigned char *new_sha1, const unsigned char *old_sha1,
882
	       unsigned int flags, enum action_on_err onerr)
883
{
884
	struct ref_transaction *t = NULL;
885
	struct strbuf err = STRBUF_INIT;
886
	int ret = 0;
887

888 889 890 891 892 893 894 895 896 897 898 899 900
	if (ref_type(refname) == REF_TYPE_PSEUDOREF) {
		ret = write_pseudoref(refname, new_sha1, old_sha1, &err);
	} else {
		t = ref_transaction_begin(&err);
		if (!t ||
		    ref_transaction_update(t, refname, new_sha1, old_sha1,
					   flags, msg, &err) ||
		    ref_transaction_commit(t, &err)) {
			ret = 1;
			ref_transaction_free(t);
		}
	}
	if (ret) {
901 902 903 904 905 906 907 908 909 910 911 912 913
		const char *str = "update_ref failed for ref '%s': %s";

		switch (onerr) {
		case UPDATE_REFS_MSG_ON_ERR:
			error(str, refname, err.buf);
			break;
		case UPDATE_REFS_DIE_ON_ERR:
			die(str, refname, err.buf);
			break;
		case UPDATE_REFS_QUIET_ON_ERR:
			break;
		}
		strbuf_release(&err);
914
		return 1;
915 916
	}
	strbuf_release(&err);
917 918
	if (t)
		ref_transaction_free(t);
919
	return 0;
920 921
}

922
char *shorten_unambiguous_ref(const char *refname, int strict)
J
Jeff King 已提交
923 924 925 926 927 928 929
{
	int i;
	static char **scanf_fmts;
	static int nr_rules;
	char *short_name;

	if (!nr_rules) {
930 931 932 933 934 935
		/*
		 * Pre-generate scanf formats from ref_rev_parse_rules[].
		 * Generate a format suitable for scanf from a
		 * ref_rev_parse_rules rule by interpolating "%s" at the
		 * location of the "%.*s".
		 */
J
Jeff King 已提交
936
		size_t total_len = 0;
937
		size_t offset = 0;
J
Jeff King 已提交
938 939

		/* the rule list is NULL terminated, count them first */
J
Jeff King 已提交
940
		for (nr_rules = 0; ref_rev_parse_rules[nr_rules]; nr_rules++)
941 942
			/* -2 for strlen("%.*s") - strlen("%s"); +1 for NUL */
			total_len += strlen(ref_rev_parse_rules[nr_rules]) - 2 + 1;
J
Jeff King 已提交
943

944
		scanf_fmts = xmalloc(st_add(st_mult(nr_rules, sizeof(char *)), total_len));
J
Jeff King 已提交
945

946
		offset = 0;
J
Jeff King 已提交
947
		for (i = 0; i < nr_rules; i++) {
948
			assert(offset < total_len);
949
			scanf_fmts[i] = (char *)&scanf_fmts[nr_rules] + offset;
950 951
			offset += snprintf(scanf_fmts[i], total_len - offset,
					   ref_rev_parse_rules[i], 2, "%s") + 1;
J
Jeff King 已提交
952 953 954 955 956
		}
	}

	/* bail out if there are no rules */
	if (!nr_rules)
957
		return xstrdup(refname);
J
Jeff King 已提交
958

959 960
	/* buffer for scanf result, at most refname must fit */
	short_name = xstrdup(refname);
J
Jeff King 已提交
961 962 963 964

	/* skip first rule, it will always match */
	for (i = nr_rules - 1; i > 0 ; --i) {
		int j;
965
		int rules_to_fail = i;
J
Jeff King 已提交
966 967
		int short_name_len;

968
		if (1 != sscanf(refname, scanf_fmts[i], short_name))
J
Jeff King 已提交
969 970 971 972
			continue;

		short_name_len = strlen(short_name);

973 974 975 976 977 978 979
		/*
		 * in strict mode, all (except the matched one) rules
		 * must fail to resolve to a valid non-ambiguous ref
		 */
		if (strict)
			rules_to_fail = nr_rules;

J
Jeff King 已提交
980 981 982 983
		/*
		 * check if the short name resolves to a valid ref,
		 * but use only rules prior to the matched one
		 */
984
		for (j = 0; j < rules_to_fail; j++) {
J
Jeff King 已提交
985 986 987
			const char *rule = ref_rev_parse_rules[j];
			char refname[PATH_MAX];

988 989 990 991
			/* skip matched rule */
			if (i == j)
				continue;

J
Jeff King 已提交
992 993 994 995 996 997 998
			/*
			 * the short name is ambiguous, if it resolves
			 * (with this previous rule) to a valid ref
			 * read_ref() returns 0 on success
			 */
			mksnpath(refname, sizeof(refname),
				 rule, short_name_len, short_name);
999
			if (ref_exists(refname))
J
Jeff King 已提交
1000 1001 1002 1003 1004 1005 1006
				break;
		}

		/*
		 * short name is non-ambiguous if all previous rules
		 * haven't resolved to a valid ref
		 */
1007
		if (j == rules_to_fail)
J
Jeff King 已提交
1008 1009 1010 1011
			return short_name;
	}

	free(short_name);
1012
	return xstrdup(refname);
J
Jeff King 已提交
1013
}
1014 1015 1016 1017 1018 1019 1020

static struct string_list *hide_refs;

int parse_hide_refs_config(const char *var, const char *value, const char *section)
{
	if (!strcmp("transfer.hiderefs", var) ||
	    /* NEEDSWORK: use parse_config_key() once both are merged */
1021
	    (starts_with(var, section) && var[strlen(section)] == '.' &&
1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040
	     !strcmp(var + strlen(section), ".hiderefs"))) {
		char *ref;
		int len;

		if (!value)
			return config_error_nonbool(var);
		ref = xstrdup(value);
		len = strlen(ref);
		while (len && ref[len - 1] == '/')
			ref[--len] = '\0';
		if (!hide_refs) {
			hide_refs = xcalloc(1, sizeof(*hide_refs));
			hide_refs->strdup_strings = 1;
		}
		string_list_append(hide_refs, ref);
	}
	return 0;
}

1041
int ref_is_hidden(const char *refname, const char *refname_full)
1042
{
1043
	int i;
1044 1045 1046

	if (!hide_refs)
		return 0;
1047 1048
	for (i = hide_refs->nr - 1; i >= 0; i--) {
		const char *match = hide_refs->items[i].string;
1049
		const char *subject;
1050
		int neg = 0;
1051
		int len;
1052 1053 1054 1055 1056 1057

		if (*match == '!') {
			neg = 1;
			match++;
		}

1058 1059 1060 1061 1062 1063 1064 1065 1066
		if (*match == '^') {
			subject = refname_full;
			match++;
		} else {
			subject = refname;
		}

		/* refname can be NULL when namespaces are used. */
		if (!subject || !starts_with(subject, match))
1067
			continue;
1068
		len = strlen(match);
1069
		if (!subject[len] || subject[len] == '/')
1070
			return !neg;
1071 1072 1073
	}
	return 0;
}
1074

D
David Turner 已提交
1075 1076 1077
const char *find_descendant_ref(const char *dirname,
				const struct string_list *extras,
				const struct string_list *skip)
1078
{
D
David Turner 已提交
1079
	int pos;
1080

D
David Turner 已提交
1081 1082
	if (!extras)
		return NULL;
1083 1084

	/*
D
David Turner 已提交
1085 1086 1087 1088
	 * Look at the place where dirname would be inserted into
	 * extras. If there is an entry at that position that starts
	 * with dirname (remember, dirname includes the trailing
	 * slash) and is not in skip, then we have a conflict.
1089
	 */
D
David Turner 已提交
1090 1091 1092
	for (pos = string_list_find_insert_index(extras, dirname, 0);
	     pos < extras->nr; pos++) {
		const char *extra_refname = extras->items[pos].string;
1093

D
David Turner 已提交
1094 1095 1096 1097 1098
		if (!starts_with(extra_refname, dirname))
			break;

		if (!skip || !string_list_has_string(skip, extra_refname))
			return extra_refname;
1099
	}
D
David Turner 已提交
1100 1101
	return NULL;
}
1102

1103
int rename_ref_available(const char *old_refname, const char *new_refname)
D
David Turner 已提交
1104 1105 1106
{
	struct string_list skip = STRING_LIST_INIT_NODUP;
	struct strbuf err = STRBUF_INIT;
1107
	int ok;
1108

1109 1110 1111
	string_list_insert(&skip, old_refname);
	ok = !verify_refname_available(new_refname, NULL, &skip, &err);
	if (!ok)
D
David Turner 已提交
1112 1113 1114 1115
		error("%s", err.buf);

	string_list_clear(&skip, 0);
	strbuf_release(&err);
1116
	return ok;
1117
}
1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140

int head_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
{
	struct object_id oid;
	int flag;

	if (submodule) {
		if (resolve_gitlink_ref(submodule, "HEAD", oid.hash) == 0)
			return fn("HEAD", &oid, 0, cb_data);

		return 0;
	}

	if (!read_ref_full("HEAD", RESOLVE_REF_READING, oid.hash, &flag))
		return fn("HEAD", &oid, flag, cb_data);

	return 0;
}

int head_ref(each_ref_fn fn, void *cb_data)
{
	return head_ref_submodule(NULL, fn, cb_data);
}
1141

1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153
/*
 * Call fn for each reference in the specified submodule for which the
 * refname begins with prefix. If trim is non-zero, then trim that
 * many characters off the beginning of each refname before passing
 * the refname to fn. flags can be DO_FOR_EACH_INCLUDE_BROKEN to
 * include broken references in the iteration. If fn ever returns a
 * non-zero value, stop the iteration and return that value;
 * otherwise, return 0.
 */
static int do_for_each_ref(const char *submodule, const char *prefix,
			   each_ref_fn fn, int trim, int flags, void *cb_data)
{
1154
	struct ref_store *refs = get_ref_store(submodule);
1155 1156
	struct ref_iterator *iter;

1157 1158 1159
	if (!refs)
		return 0;

1160 1161 1162 1163 1164 1165
	iter = files_ref_iterator_begin(submodule, prefix, flags);
	iter = prefix_ref_iterator_begin(iter, prefix, trim);

	return do_for_each_ref_iterator(iter, fn, cb_data);
}

1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216
int for_each_ref(each_ref_fn fn, void *cb_data)
{
	return do_for_each_ref(NULL, "", fn, 0, 0, cb_data);
}

int for_each_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
{
	return do_for_each_ref(submodule, "", fn, 0, 0, cb_data);
}

int for_each_ref_in(const char *prefix, each_ref_fn fn, void *cb_data)
{
	return do_for_each_ref(NULL, prefix, fn, strlen(prefix), 0, cb_data);
}

int for_each_fullref_in(const char *prefix, each_ref_fn fn, void *cb_data, unsigned int broken)
{
	unsigned int flag = 0;

	if (broken)
		flag = DO_FOR_EACH_INCLUDE_BROKEN;
	return do_for_each_ref(NULL, prefix, fn, 0, flag, cb_data);
}

int for_each_ref_in_submodule(const char *submodule, const char *prefix,
		each_ref_fn fn, void *cb_data)
{
	return do_for_each_ref(submodule, prefix, fn, strlen(prefix), 0, cb_data);
}

int for_each_replace_ref(each_ref_fn fn, void *cb_data)
{
	return do_for_each_ref(NULL, git_replace_ref_base, fn,
			       strlen(git_replace_ref_base), 0, cb_data);
}

int for_each_namespaced_ref(each_ref_fn fn, void *cb_data)
{
	struct strbuf buf = STRBUF_INIT;
	int ret;
	strbuf_addf(&buf, "%srefs/", get_git_namespace());
	ret = do_for_each_ref(NULL, buf.buf, fn, 0, 0, cb_data);
	strbuf_release(&buf);
	return ret;
}

int for_each_rawref(each_ref_fn fn, void *cb_data)
{
	return do_for_each_ref(NULL, "", fn, 0,
			       DO_FOR_EACH_INCLUDE_BROKEN, cb_data);
}
1217 1218

/* This function needs to return a meaningful errno on failure */
1219 1220 1221 1222
static const char *resolve_ref_recursively(struct ref_store *refs,
					   const char *refname,
					   int resolve_flags,
					   unsigned char *sha1, int *flags)
1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253
{
	static struct strbuf sb_refname = STRBUF_INIT;
	int unused_flags;
	int symref_count;

	if (!flags)
		flags = &unused_flags;

	*flags = 0;

	if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {
		if (!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||
		    !refname_is_safe(refname)) {
			errno = EINVAL;
			return NULL;
		}

		/*
		 * dwim_ref() uses REF_ISBROKEN to distinguish between
		 * missing refs and refs that were present but invalid,
		 * to complain about the latter to stderr.
		 *
		 * We don't know whether the ref exists, so don't set
		 * REF_ISBROKEN yet.
		 */
		*flags |= REF_BAD_NAME;
	}

	for (symref_count = 0; symref_count < SYMREF_MAXDEPTH; symref_count++) {
		unsigned int read_flags = 0;

1254 1255
		if (read_raw_ref(refs, refname,
				 sha1, &sb_refname, &read_flags)) {
1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293
			*flags |= read_flags;
			if (errno != ENOENT || (resolve_flags & RESOLVE_REF_READING))
				return NULL;
			hashclr(sha1);
			if (*flags & REF_BAD_NAME)
				*flags |= REF_ISBROKEN;
			return refname;
		}

		*flags |= read_flags;

		if (!(read_flags & REF_ISSYMREF)) {
			if (*flags & REF_BAD_NAME) {
				hashclr(sha1);
				*flags |= REF_ISBROKEN;
			}
			return refname;
		}

		refname = sb_refname.buf;
		if (resolve_flags & RESOLVE_REF_NO_RECURSE) {
			hashclr(sha1);
			return refname;
		}
		if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {
			if (!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||
			    !refname_is_safe(refname)) {
				errno = EINVAL;
				return NULL;
			}

			*flags |= REF_ISBROKEN | REF_BAD_NAME;
		}
	}

	errno = ELOOP;
	return NULL;
}
1294

1295 1296 1297 1298 1299 1300 1301
const char *resolve_ref_unsafe(const char *refname, int resolve_flags,
			       unsigned char *sha1, int *flags)
{
	return resolve_ref_recursively(get_ref_store(NULL), refname,
				       resolve_flags, sha1, flags);
}

1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389
/* A pointer to the ref_store for the main repository: */
static struct ref_store *main_ref_store;

/* A linked list of ref_stores for submodules: */
static struct ref_store *submodule_ref_stores;

void base_ref_store_init(struct ref_store *refs,
			 const struct ref_storage_be *be,
			 const char *submodule)
{
	refs->be = be;
	if (!submodule) {
		if (main_ref_store)
			die("BUG: main_ref_store initialized twice");

		refs->submodule = "";
		refs->next = NULL;
		main_ref_store = refs;
	} else {
		if (lookup_ref_store(submodule))
			die("BUG: ref_store for submodule '%s' initialized twice",
			    submodule);

		refs->submodule = xstrdup(submodule);
		refs->next = submodule_ref_stores;
		submodule_ref_stores = refs;
	}
}

struct ref_store *ref_store_init(const char *submodule)
{
	const char *be_name = "files";
	struct ref_storage_be *be = find_ref_storage_backend(be_name);

	if (!be)
		die("BUG: reference backend %s is unknown", be_name);

	if (!submodule || !*submodule)
		return be->init(NULL);
	else
		return be->init(submodule);
}

struct ref_store *lookup_ref_store(const char *submodule)
{
	struct ref_store *refs;

	if (!submodule || !*submodule)
		return main_ref_store;

	for (refs = submodule_ref_stores; refs; refs = refs->next) {
		if (!strcmp(submodule, refs->submodule))
			return refs;
	}

	return NULL;
}

struct ref_store *get_ref_store(const char *submodule)
{
	struct ref_store *refs;

	if (!submodule || !*submodule) {
		refs = lookup_ref_store(NULL);

		if (!refs)
			refs = ref_store_init(NULL);
	} else {
		refs = lookup_ref_store(submodule);

		if (!refs) {
			struct strbuf submodule_sb = STRBUF_INIT;

			strbuf_addstr(&submodule_sb, submodule);
			if (is_nonbare_repository_dir(&submodule_sb))
				refs = ref_store_init(submodule);
			strbuf_release(&submodule_sb);
		}
	}

	return refs;
}

void assert_main_repository(struct ref_store *refs, const char *caller)
{
	if (*refs->submodule)
		die("BUG: %s called for a submodule", caller);
}
1390 1391 1392 1393 1394 1395 1396 1397 1398

/* backend functions */
int ref_transaction_commit(struct ref_transaction *transaction,
			   struct strbuf *err)
{
	struct ref_store *refs = get_ref_store(NULL);

	return refs->be->transaction_commit(refs, transaction, err);
}