[thirdparty/git.git] / sha1_name.c

#include "cache.h"
#include "tag.h"
#include "commit.h"
#include "tree.h"
#include "blob.h"
#include "tree-walk.h"
#include "refs.h"

static int find_short_object_filename(int len, const char *name, unsigned char *sha1)
{
	struct alternate_object_database *alt;
	char hex[40];
	int found = 0;
	static struct alternate_object_database *fakeent;

	if (!fakeent) {
		const char *objdir = get_object_directory();
		int objdir_len = strlen(objdir);
		int entlen = objdir_len + 43;
		fakeent = xmalloc(sizeof(*fakeent) + entlen);
		memcpy(fakeent->base, objdir, objdir_len);
		fakeent->name = fakeent->base + objdir_len + 1;
		fakeent->name[-1] = '/';
	}
	fakeent->next = alt_odb_list;

	sprintf(hex, "%.2s", name);
	for (alt = fakeent; alt && found < 2; alt = alt->next) {
		struct dirent *de;
		DIR *dir;
		sprintf(alt->name, "%.2s/", name);
		dir = opendir(alt->base);
		if (!dir)
			continue;
		while ((de = readdir(dir)) != NULL) {
			if (strlen(de->d_name) != 38)
				continue;
			if (memcmp(de->d_name, name + 2, len - 2))
				continue;
			if (!found) {
				memcpy(hex + 2, de->d_name, 38);
				found++;
			}
			else if (memcmp(hex + 2, de->d_name, 38)) {
				found = 2;
				break;
			}
		}
		closedir(dir);
	}
	if (found == 1)
		return get_sha1_hex(hex, sha1) == 0;
	return found;
}

static int match_sha(unsigned len, const unsigned char *a, const unsigned char *b)
{
	do {
		if (*a != *b)
			return 0;
		a++;
		b++;
		len -= 2;
	} while (len > 1);
	if (len)
		if ((*a ^ *b) & 0xf0)
			return 0;
	return 1;
}

static int find_short_packed_object(int len, const unsigned char *match, unsigned char *sha1)
{
	struct packed_git *p;
	unsigned char found_sha1[20];
	int found = 0;

	prepare_packed_git();
	for (p = packed_git; p && found < 2; p = p->next) {
		unsigned num = num_packed_objects(p);
		unsigned first = 0, last = num;
		while (first < last) {
			unsigned mid = (first + last) / 2;
			unsigned char now[20];
			int cmp;

			nth_packed_object_sha1(p, mid, now);
			cmp = memcmp(match, now, 20);
			if (!cmp) {
				first = mid;
				break;
			}
			if (cmp > 0) {
				first = mid+1;
				continue;
			}
			last = mid;
		}
		if (first < num) {
			unsigned char now[20], next[20];
			nth_packed_object_sha1(p, first, now);
			if (match_sha(len, match, now)) {
				if (nth_packed_object_sha1(p, first+1, next) ||
				    !match_sha(len, match, next)) {
					/* unique within this pack */
					if (!found) {
						memcpy(found_sha1, now, 20);
						found++;
					}
					else if (memcmp(found_sha1, now, 20)) {
						found = 2;
						break;
					}
				}
				else {
					/* not even unique within this pack */
					found = 2;
					break;
				}
			}
		}
	}
	if (found == 1)
		memcpy(sha1, found_sha1, 20);
	return found;
}

#define SHORT_NAME_NOT_FOUND (-1)
#define SHORT_NAME_AMBIGUOUS (-2)

static int find_unique_short_object(int len, char *canonical,
				    unsigned char *res, unsigned char *sha1)
{
	int has_unpacked, has_packed;
	unsigned char unpacked_sha1[20], packed_sha1[20];

	has_unpacked = find_short_object_filename(len, canonical, unpacked_sha1);
	has_packed = find_short_packed_object(len, res, packed_sha1);
	if (!has_unpacked && !has_packed)
		return SHORT_NAME_NOT_FOUND;
	if (1 < has_unpacked || 1 < has_packed)
		return SHORT_NAME_AMBIGUOUS;
	if (has_unpacked != has_packed) {
		memcpy(sha1, (has_packed ? packed_sha1 : unpacked_sha1), 20);
		return 0;
	}
	/* Both have unique ones -- do they match? */
	if (memcmp(packed_sha1, unpacked_sha1, 20))
		return SHORT_NAME_AMBIGUOUS;
	memcpy(sha1, packed_sha1, 20);
	return 0;
}

static int get_short_sha1(const char *name, int len, unsigned char *sha1,
			  int quietly)
{
	int i, status;
	char canonical[40];
	unsigned char res[20];

	if (len < MINIMUM_ABBREV)
		return -1;
	memset(res, 0, 20);
	memset(canonical, 'x', 40);
	for (i = 0; i < len ;i++) {
		unsigned char c = name[i];
		unsigned char val;
		if (c >= '0' && c <= '9')
			val = c - '0';
		else if (c >= 'a' && c <= 'f')
			val = c - 'a' + 10;
		else if (c >= 'A' && c <='F') {
			val = c - 'A' + 10;
			c -= 'A' - 'a';
		}
		else
			return -1;
		canonical[i] = c;
		if (!(i & 1))
			val <<= 4;
		res[i >> 1] |= val;
	}

	status = find_unique_short_object(i, canonical, res, sha1);
	if (!quietly && (status == SHORT_NAME_AMBIGUOUS))
		return error("short SHA1 %.*s is ambiguous.", len, canonical);
	return status;
}

const char *find_unique_abbrev(const unsigned char *sha1, int len)
{
	int status, is_null;
	static char hex[41];

	is_null = !memcmp(sha1, null_sha1, 20);
	memcpy(hex, sha1_to_hex(sha1), 40);
	if (len == 40)
		return hex;
	while (len < 40) {
		unsigned char sha1_ret[20];
		status = get_short_sha1(hex, len, sha1_ret, 1);
		if (!status ||
		    (is_null && status != SHORT_NAME_AMBIGUOUS)) {
			hex[len] = 0;
			return hex;
		}
		if (status != SHORT_NAME_AMBIGUOUS)
			return NULL;
		len++;
	}
	return NULL;
}

static int ambiguous_path(const char *path, int len)
{
	int slash = 1;
	int cnt;

	for (cnt = 0; cnt < len; cnt++) {
		switch (*path++) {
		case '\0':
			break;
		case '/':
			if (slash)
				break;
			slash = 1;
			continue;
		case '.':
			continue;
		default:
			slash = 0;
			continue;
		}
		break;
	}
	return slash;
}

static int get_sha1_basic(const char *str, int len, unsigned char *sha1)
{
	static const char *fmt[] = {
		"%.*s",
		"refs/%.*s",
		"refs/tags/%.*s",
		"refs/heads/%.*s",
		"refs/remotes/%.*s",
		"refs/remotes/%.*s/HEAD",
		NULL
	};
	static const char *warning = "warning: refname '%.*s' is ambiguous.\n";
	const char **p, *pathname;
	char *real_path = NULL;
	int refs_found = 0, am;
	unsigned long at_time = (unsigned long)-1;
	unsigned char *this_result;
	unsigned char sha1_from_ref[20];

	if (len == 40 && !get_sha1_hex(str, sha1))
		return 0;

	/* At a given period of time? "@{2 hours ago}" */
	for (am = 1; am < len - 1; am++) {
		if (str[am] == '@' && str[am+1] == '{' && str[len-1] == '}') {
			int date_len = len - am - 3;
			char *date_spec = xmalloc(date_len + 1);
			strlcpy(date_spec, str + am + 2, date_len + 1);
			at_time = approxidate(date_spec);
			free(date_spec);
			len = am;
			break;
		}
	}

	/* Accept only unambiguous ref paths. */
	if (ambiguous_path(str, len))
		return -1;

	for (p = fmt; *p; p++) {
		this_result = refs_found ? sha1_from_ref : sha1;
		pathname = resolve_ref(git_path(*p, len, str), this_result, 1);
		if (pathname) {
			if (!refs_found++)
				real_path = strdup(pathname);
			if (!warn_ambiguous_refs)
				break;
		}
	}

	if (!refs_found)
		return -1;

	if (warn_ambiguous_refs && refs_found > 1)
		fprintf(stderr, warning, len, str);

	if (at_time != (unsigned long)-1) {
		read_ref_at(
			real_path + strlen(git_path(".")) - 1,
			at_time,
			sha1);
	}

	free(real_path);
	return 0;
}

static int get_sha1_1(const char *name, int len, unsigned char *sha1);

static int get_parent(const char *name, int len,
		      unsigned char *result, int idx)
{
	unsigned char sha1[20];
	int ret = get_sha1_1(name, len, sha1);
	struct commit *commit;
	struct commit_list *p;

	if (ret)
		return ret;
	commit = lookup_commit_reference(sha1);
	if (!commit)
		return -1;
	if (parse_commit(commit))
		return -1;
	if (!idx) {
		memcpy(result, commit->object.sha1, 20);
		return 0;
	}
	p = commit->parents;
	while (p) {
		if (!--idx) {
			memcpy(result, p->item->object.sha1, 20);
			return 0;
		}
		p = p->next;
	}
	return -1;
}

static int get_nth_ancestor(const char *name, int len,
			    unsigned char *result, int generation)
{
	unsigned char sha1[20];
	int ret = get_sha1_1(name, len, sha1);
	if (ret)
		return ret;

	while (generation--) {
		struct commit *commit = lookup_commit_reference(sha1);

		if (!commit || parse_commit(commit) || !commit->parents)
			return -1;
		memcpy(sha1, commit->parents->item->object.sha1, 20);
	}
	memcpy(result, sha1, 20);
	return 0;
}

static int peel_onion(const char *name, int len, unsigned char *sha1)
{
	unsigned char outer[20];
	const char *sp;
	unsigned int expected_type = 0;
	struct object *o;

	/*
	 * "ref^{type}" dereferences ref repeatedly until you cannot
	 * dereference anymore, or you get an object of given type,
	 * whichever comes first.  "ref^{}" means just dereference
	 * tags until you get a non-tag.  "ref^0" is a shorthand for
	 * "ref^{commit}".  "commit^{tree}" could be used to find the
	 * top-level tree of the given commit.
	 */
	if (len < 4 || name[len-1] != '}')
		return -1;

	for (sp = name + len - 1; name <= sp; sp--) {
		int ch = *sp;
		if (ch == '{' && name < sp && sp[-1] == '^')
			break;
	}
	if (sp <= name)
		return -1;

	sp++; /* beginning of type name, or closing brace for empty */
	if (!strncmp(commit_type, sp, 6) && sp[6] == '}')
		expected_type = TYPE_COMMIT;
	else if (!strncmp(tree_type, sp, 4) && sp[4] == '}')
		expected_type = TYPE_TREE;
	else if (!strncmp(blob_type, sp, 4) && sp[4] == '}')
		expected_type = TYPE_BLOB;
	else if (sp[0] == '}')
		expected_type = TYPE_NONE;
	else
		return -1;

	if (get_sha1_1(name, sp - name - 2, outer))
		return -1;

	o = parse_object(outer);
	if (!o)
		return -1;
	if (!expected_type) {
		o = deref_tag(o, name, sp - name - 2);
		if (!o || (!o->parsed && !parse_object(o->sha1)))
			return -1;
		memcpy(sha1, o->sha1, 20);
	}
	else {
		/* At this point, the syntax look correct, so
		 * if we do not get the needed object, we should
		 * barf.
		 */

		while (1) {
			if (!o || (!o->parsed && !parse_object(o->sha1)))
				return -1;
			if (o->type == expected_type) {
				memcpy(sha1, o->sha1, 20);
				return 0;
			}
			if (o->type == TYPE_TAG)
				o = ((struct tag*) o)->tagged;
			else if (o->type == TYPE_COMMIT)
				o = &(((struct commit *) o)->tree->object);
			else
				return error("%.*s: expected %s type, but the object dereferences to %s type",
					     len, name, typename(expected_type),
					     typename(o->type));
			if (!o->parsed)
				parse_object(o->sha1);
		}
	}
	return 0;
}

static int get_sha1_1(const char *name, int len, unsigned char *sha1)
{
	int ret, has_suffix;
	const char *cp;

	/* "name~3" is "name^^^",
	 * "name~" and "name~0" are name -- not "name^0"!
	 * "name^" is not "name^0"; it is "name^1".
	 */
	has_suffix = 0;
	for (cp = name + len - 1; name <= cp; cp--) {
		int ch = *cp;
		if ('0' <= ch && ch <= '9')
			continue;
		if (ch == '~' || ch == '^')
			has_suffix = ch;
		break;
	}

	if (has_suffix) {
		int num = 0;
		int len1 = cp - name;
		cp++;
		while (cp < name + len)
			num = num * 10 + *cp++ - '0';
		if (has_suffix == '^') {
			if (!num && len1 == len - 1)
				num = 1;
			return get_parent(name, len1, sha1, num);
		}
		/* else if (has_suffix == '~') -- goes without saying */
		return get_nth_ancestor(name, len1, sha1, num);
	}

	ret = peel_onion(name, len, sha1);
	if (!ret)
		return 0;

	ret = get_sha1_basic(name, len, sha1);
	if (!ret)
		return 0;
	return get_short_sha1(name, len, sha1, 0);
}

/*
 * This is like "get_sha1_basic()", except it allows "sha1 expressions",
 * notably "xyz^" for "parent of xyz"
 */
int get_sha1(const char *name, unsigned char *sha1)
{
	int ret, bracket_depth;
	unsigned unused;
	int namelen = strlen(name);
	const char *cp;

	prepare_alt_odb();
	ret = get_sha1_1(name, namelen, sha1);
	if (!ret)
		return ret;
	/* sha1:path --> object name of path in ent sha1
	 * :path -> object name of path in index
	 * :[0-3]:path -> object name of path in index at stage
	 */
	if (name[0] == ':') {
		int stage = 0;
		struct cache_entry *ce;
		int pos;
		if (namelen < 3 ||
		    name[2] != ':' ||
		    name[1] < '0' || '3' < name[1])
			cp = name + 1;
		else {
			stage = name[1] - '0';
			cp = name + 3;
		}
		namelen = namelen - (cp - name);
		if (!active_cache)
			read_cache();
		if (active_nr < 0)
			return -1;
		pos = cache_name_pos(cp, namelen);
		if (pos < 0)
			pos = -pos - 1;
		while (pos < active_nr) {
			ce = active_cache[pos];
			if (ce_namelen(ce) != namelen ||
			    memcmp(ce->name, cp, namelen))
				break;
			if (ce_stage(ce) == stage) {
				memcpy(sha1, ce->sha1, 20);
				return 0;
			}
			pos++;
		}
		return -1;
	}
	for (cp = name, bracket_depth = 0; *cp; cp++) {
		if (*cp == '{')
			bracket_depth++;
		else if (bracket_depth && *cp == '}')
			bracket_depth--;
		else if (!bracket_depth && *cp == ':')
			break;
	}
	if (*cp == ':') {
		unsigned char tree_sha1[20];
		if (!get_sha1_1(name, cp-name, tree_sha1))
			return get_tree_entry(tree_sha1, cp+1, sha1,
					      &unused);
	}
	return ret;
}
Commit	Line	Data
9938af6a	1	#include "cache.h"
5385f52d	2	#include "tag.h"
9938af6a	3	#include "commit.h"
5385f52d JH	4	#include "tree.h"
5385f52d JH	5	#include "blob.h"
f3ab49db	6	#include "tree-walk.h"
d556fae2	7	#include "refs.h"
9938af6a JH	8
	9	static int find_short_object_filename(int len, const char name, unsigned char sha1)
	10	{
99a19b43	11	struct alternate_object_database *alt;
9938af6a	12	char hex[40];
99a19b43 JH	13	int found = 0;
	14	static struct alternate_object_database *fakeent;
	15
	16	if (!fakeent) {
	17	const char *objdir = get_object_directory();
	18	int objdir_len = strlen(objdir);
	19	int entlen = objdir_len + 43;
	20	fakeent = xmalloc(sizeof(*fakeent) + entlen);
	21	memcpy(fakeent->base, objdir, objdir_len);
	22	fakeent->name = fakeent->base + objdir_len + 1;
	23	fakeent->name[-1] = '/';
	24	}
	25	fakeent->next = alt_odb_list;
9938af6a	26
9938af6a	27	sprintf(hex, "%.2s", name);
99a19b43	28	for (alt = fakeent; alt && found < 2; alt = alt->next) {
9938af6a	29	struct dirent *de;
99a19b43 JH	30	DIR *dir;
	31	sprintf(alt->name, "%.2s/", name);
	32	dir = opendir(alt->base);
	33	if (!dir)
	34	continue;
9938af6a JH	35	while ((de = readdir(dir)) != NULL) {
	36	if (strlen(de->d_name) != 38)
	37	continue;
99a19b43	38	if (memcmp(de->d_name, name + 2, len - 2))
9938af6a	39	continue;
99a19b43 JH	40	if (!found) {
	41	memcpy(hex + 2, de->d_name, 38);
	42	found++;
	43	}
	44	else if (memcmp(hex + 2, de->d_name, 38)) {
	45	found = 2;
9938af6a	46	break;
99a19b43	47	}
9938af6a JH	48	}
	49	closedir(dir);
	50	}
	51	if (found == 1)
	52	return get_sha1_hex(hex, sha1) == 0;
99a19b43	53	return found;
9938af6a JH	54	}
	55
	56	static int match_sha(unsigned len, const unsigned char a, const unsigned char b)
	57	{
	58	do {
	59	if (a != b)
	60	return 0;
	61	a++;
	62	b++;
	63	len -= 2;
	64	} while (len > 1);
	65	if (len)
	66	if ((a ^ b) & 0xf0)
	67	return 0;
	68	return 1;
	69	}
	70
	71	static int find_short_packed_object(int len, const unsigned char match, unsigned char sha1)
	72	{
	73	struct packed_git *p;
99a19b43 JH	74	unsigned char found_sha1[20];
99a19b43 JH	75	int found = 0;
9938af6a JH	76
9938af6a JH	77	prepare_packed_git();
99a19b43	78	for (p = packed_git; p && found < 2; p = p->next) {
9938af6a JH	79	unsigned num = num_packed_objects(p);
	80	unsigned first = 0, last = num;
	81	while (first < last) {
	82	unsigned mid = (first + last) / 2;
	83	unsigned char now[20];
	84	int cmp;
	85
	86	nth_packed_object_sha1(p, mid, now);
	87	cmp = memcmp(match, now, 20);
	88	if (!cmp) {
	89	first = mid;
	90	break;
	91	}
	92	if (cmp > 0) {
	93	first = mid+1;
	94	continue;
	95	}
	96	last = mid;
	97	}
	98	if (first < num) {
0bc45890	99	unsigned char now[20], next[20];
9938af6a JH	100	nth_packed_object_sha1(p, first, now);
9938af6a JH	101	if (match_sha(len, match, now)) {
0bc45890 JH	102	if (nth_packed_object_sha1(p, first+1, next) \|\|
	103	!match_sha(len, match, next)) {
	104	/* unique within this pack */
	105	if (!found) {
	106	memcpy(found_sha1, now, 20);
	107	found++;
	108	}
	109	else if (memcmp(found_sha1, now, 20)) {
	110	found = 2;
	111	break;
	112	}
99a19b43	113	}
0bc45890 JH	114	else {
0bc45890 JH	115	/* not even unique within this pack */
99a19b43 JH	116	found = 2;
99a19b43 JH	117	break;
9938af6a JH	118	}
	119	}
	120	}
	121	}
99a19b43 JH	122	if (found == 1)
	123	memcpy(sha1, found_sha1, 20);
	124	return found;
	125	}
	126
013f276e JH	127	#define SHORT_NAME_NOT_FOUND (-1)
	128	#define SHORT_NAME_AMBIGUOUS (-2)
	129
99a19b43 JH	130	static int find_unique_short_object(int len, char *canonical,
	131	unsigned char res, unsigned char sha1)
	132	{
	133	int has_unpacked, has_packed;
	134	unsigned char unpacked_sha1[20], packed_sha1[20];
	135
	136	has_unpacked = find_short_object_filename(len, canonical, unpacked_sha1);
	137	has_packed = find_short_packed_object(len, res, packed_sha1);
	138	if (!has_unpacked && !has_packed)
013f276e	139	return SHORT_NAME_NOT_FOUND;
99a19b43	140	if (1 < has_unpacked \|\| 1 < has_packed)
013f276e	141	return SHORT_NAME_AMBIGUOUS;
99a19b43 JH	142	if (has_unpacked != has_packed) {
	143	memcpy(sha1, (has_packed ? packed_sha1 : unpacked_sha1), 20);
	144	return 0;
	145	}
	146	/* Both have unique ones -- do they match? */
	147	if (memcmp(packed_sha1, unpacked_sha1, 20))
e974c9ab	148	return SHORT_NAME_AMBIGUOUS;
99a19b43	149	memcpy(sha1, packed_sha1, 20);
9938af6a JH	150	return 0;
	151	}
	152
013f276e JH	153	static int get_short_sha1(const char name, int len, unsigned char sha1,
013f276e JH	154	int quietly)
9938af6a	155	{
013f276e	156	int i, status;
9938af6a JH	157	char canonical[40];
	158	unsigned char res[20];
	159
46a6c262	160	if (len < MINIMUM_ABBREV)
af61c6e0	161	return -1;
9938af6a JH	162	memset(res, 0, 20);
9938af6a JH	163	memset(canonical, 'x', 40);
af61c6e0	164	for (i = 0; i < len ;i++) {
9938af6a JH	165	unsigned char c = name[i];
9938af6a JH	166	unsigned char val;
9938af6a JH	167	if (c >= '0' && c <= '9')
	168	val = c - '0';
	169	else if (c >= 'a' && c <= 'f')
	170	val = c - 'a' + 10;
	171	else if (c >= 'A' && c <='F') {
	172	val = c - 'A' + 10;
	173	c -= 'A' - 'a';
	174	}
	175	else
	176	return -1;
	177	canonical[i] = c;
	178	if (!(i & 1))
	179	val <<= 4;
	180	res[i >> 1] \|= val;
	181	}
99a19b43	182
013f276e JH	183	status = find_unique_short_object(i, canonical, res, sha1);
	184	if (!quietly && (status == SHORT_NAME_AMBIGUOUS))
	185	return error("short SHA1 %.*s is ambiguous.", len, canonical);
	186	return status;
	187	}
	188
	189	const char find_unique_abbrev(const unsigned char sha1, int len)
	190	{
297a1aad	191	int status, is_null;
013f276e	192	static char hex[41];
47dd0d59	193
297a1aad	194	is_null = !memcmp(sha1, null_sha1, 20);
013f276e	195	memcpy(hex, sha1_to_hex(sha1), 40);
47dd0d59 JH	196	if (len == 40)
47dd0d59 JH	197	return hex;
013f276e JH	198	while (len < 40) {
	199	unsigned char sha1_ret[20];
	200	status = get_short_sha1(hex, len, sha1_ret, 1);
297a1aad JH	201	if (!status \|\|
297a1aad JH	202	(is_null && status != SHORT_NAME_AMBIGUOUS)) {
013f276e JH	203	hex[len] = 0;
	204	return hex;
	205	}
	206	if (status != SHORT_NAME_AMBIGUOUS)
	207	return NULL;
	208	len++;
	209	}
	210	return NULL;
9938af6a JH	211	}
9938af6a JH	212
6677c466	213	static int ambiguous_path(const char *path, int len)
af13cdf2 LT	214	{
af13cdf2 LT	215	int slash = 1;
6677c466	216	int cnt;
af13cdf2	217
6677c466	218	for (cnt = 0; cnt < len; cnt++) {
af13cdf2 LT	219	switch (*path++) {
	220	case '\0':
	221	break;
	222	case '/':
	223	if (slash)
	224	break;
	225	slash = 1;
	226	continue;
	227	case '.':
	228	continue;
	229	default:
	230	slash = 0;
	231	continue;
	232	}
c054d64e	233	break;
af13cdf2	234	}
6677c466	235	return slash;
af13cdf2 LT	236	}
af13cdf2 LT	237
9938af6a JH	238	static int get_sha1_basic(const char str, int len, unsigned char sha1)
9938af6a JH	239	{
c51d1369	240	static const char *fmt[] = {
84a9b58c	241	"%.*s",
c51d1369 JH	242	"refs/%.*s",
	243	"refs/tags/%.*s",
	244	"refs/heads/%.*s",
	245	"refs/remotes/%.*s",
	246	"refs/remotes/%.*s/HEAD",
9938af6a JH	247	NULL
9938af6a JH	248	};
d556fae2 SP	249	static const char warning = "warning: refname '%.s' is ambiguous.\n";
	250	const char *p, pathname;
	251	char *real_path = NULL;
cce91a2c	252	int refs_found = 0, am;
d556fae2	253	unsigned long at_time = (unsigned long)-1;
c51d1369 JH	254	unsigned char *this_result;
c51d1369 JH	255	unsigned char sha1_from_ref[20];
9938af6a	256
3c3852e3	257	if (len == 40 && !get_sha1_hex(str, sha1))
9938af6a JH	258	return 0;
9938af6a JH	259
cce91a2c SP	260	/* At a given period of time? "@{2 hours ago}" */
	261	for (am = 1; am < len - 1; am++) {
	262	if (str[am] == '@' && str[am+1] == '{' && str[len-1] == '}') {
	263	int date_len = len - am - 3;
d556fae2	264	char *date_spec = xmalloc(date_len + 1);
817151e6	265	strlcpy(date_spec, str + am + 2, date_len + 1);
d556fae2 SP	266	at_time = approxidate(date_spec);
d556fae2 SP	267	free(date_spec);
cce91a2c	268	len = am;
70e34b2d	269	break;
d556fae2 SP	270	}
	271	}
	272
af13cdf2	273	/* Accept only unambiguous ref paths. */
6677c466	274	if (ambiguous_path(str, len))
af13cdf2 LT	275	return -1;
af13cdf2 LT	276
c51d1369	277	for (p = fmt; *p; p++) {
d556fae2 SP	278	this_result = refs_found ? sha1_from_ref : sha1;
	279	pathname = resolve_ref(git_path(*p, len, str), this_result, 1);
	280	if (pathname) {
	281	if (!refs_found++)
	282	real_path = strdup(pathname);
	283	if (!warn_ambiguous_refs)
	284	break;
2f8acdb3	285	}
6677c466	286	}
d556fae2 SP	287
	288	if (!refs_found)
	289	return -1;
	290
	291	if (warn_ambiguous_refs && refs_found > 1)
	292	fprintf(stderr, warning, len, str);
	293
	294	if (at_time != (unsigned long)-1) {
	295	read_ref_at(
	296	real_path + strlen(git_path(".")) - 1,
	297	at_time,
	298	sha1);
	299	}
	300
	301	free(real_path);
	302	return 0;
9938af6a JH	303	}
	304
	305	static int get_sha1_1(const char name, int len, unsigned char sha1);
	306
	307	static int get_parent(const char *name, int len,
	308	unsigned char *result, int idx)
	309	{
	310	unsigned char sha1[20];
	311	int ret = get_sha1_1(name, len, sha1);
	312	struct commit *commit;
	313	struct commit_list *p;
	314
	315	if (ret)
	316	return ret;
	317	commit = lookup_commit_reference(sha1);
	318	if (!commit)
	319	return -1;
	320	if (parse_commit(commit))
	321	return -1;
	322	if (!idx) {
	323	memcpy(result, commit->object.sha1, 20);
	324	return 0;
	325	}
	326	p = commit->parents;
	327	while (p) {
	328	if (!--idx) {
	329	memcpy(result, p->item->object.sha1, 20);
	330	return 0;
	331	}
	332	p = p->next;
	333	}
	334	return -1;
	335	}
	336
4f7599ac JH	337	static int get_nth_ancestor(const char *name, int len,
	338	unsigned char *result, int generation)
	339	{
	340	unsigned char sha1[20];
	341	int ret = get_sha1_1(name, len, sha1);
	342	if (ret)
	343	return ret;
	344
	345	while (generation--) {
	346	struct commit *commit = lookup_commit_reference(sha1);
	347
	348	if (!commit \|\| parse_commit(commit) \|\| !commit->parents)
	349	return -1;
	350	memcpy(sha1, commit->parents->item->object.sha1, 20);
	351	}
	352	memcpy(result, sha1, 20);
	353	return 0;
	354	}
	355
5385f52d JH	356	static int peel_onion(const char name, int len, unsigned char sha1)
	357	{
	358	unsigned char outer[20];
	359	const char *sp;
885a86ab	360	unsigned int expected_type = 0;
5385f52d JH	361	struct object *o;
	362
	363	/*
	364	* "ref^{type}" dereferences ref repeatedly until you cannot
	365	* dereference anymore, or you get an object of given type,
	366	* whichever comes first. "ref^{}" means just dereference
	367	* tags until you get a non-tag. "ref^0" is a shorthand for
	368	* "ref^{commit}". "commit^{tree}" could be used to find the
	369	* top-level tree of the given commit.
	370	*/
	371	if (len < 4 \|\| name[len-1] != '}')
	372	return -1;
	373
	374	for (sp = name + len - 1; name <= sp; sp--) {
	375	int ch = *sp;
	376	if (ch == '{' && name < sp && sp[-1] == '^')
	377	break;
	378	}
	379	if (sp <= name)
	380	return -1;
	381
	382	sp++; /* beginning of type name, or closing brace for empty */
	383	if (!strncmp(commit_type, sp, 6) && sp[6] == '}')
885a86ab	384	expected_type = TYPE_COMMIT;
5385f52d	385	else if (!strncmp(tree_type, sp, 4) && sp[4] == '}')
885a86ab	386	expected_type = TYPE_TREE;
5385f52d	387	else if (!strncmp(blob_type, sp, 4) && sp[4] == '}')
885a86ab	388	expected_type = TYPE_BLOB;
5385f52d	389	else if (sp[0] == '}')
885a86ab	390	expected_type = TYPE_NONE;
5385f52d JH	391	else
	392	return -1;
	393
	394	if (get_sha1_1(name, sp - name - 2, outer))
	395	return -1;
	396
	397	o = parse_object(outer);
	398	if (!o)
	399	return -1;
885a86ab	400	if (!expected_type) {
9534f40b	401	o = deref_tag(o, name, sp - name - 2);
6e1c6c10 JH	402	if (!o \|\| (!o->parsed && !parse_object(o->sha1)))
6e1c6c10 JH	403	return -1;
5385f52d JH	404	memcpy(sha1, o->sha1, 20);
	405	}
	406	else {
	407	/* At this point, the syntax look correct, so
	408	* if we do not get the needed object, we should
	409	* barf.
	410	*/
	411
	412	while (1) {
6e1c6c10	413	if (!o \|\| (!o->parsed && !parse_object(o->sha1)))
5385f52d	414	return -1;
885a86ab	415	if (o->type == expected_type) {
5385f52d JH	416	memcpy(sha1, o->sha1, 20);
	417	return 0;
	418	}
885a86ab	419	if (o->type == TYPE_TAG)
5385f52d	420	o = ((struct tag*) o)->tagged;
885a86ab	421	else if (o->type == TYPE_COMMIT)
5385f52d JH	422	o = &(((struct commit *) o)->tree->object);
	423	else
	424	return error("%.*s: expected %s type, but the object dereferences to %s type",
885a86ab LT	425	len, name, typename(expected_type),
885a86ab LT	426	typename(o->type));
5385f52d JH	427	if (!o->parsed)
	428	parse_object(o->sha1);
	429	}
	430	}
	431	return 0;
	432	}
	433
9938af6a JH	434	static int get_sha1_1(const char name, int len, unsigned char sha1)
9938af6a JH	435	{
0601dbe1	436	int ret, has_suffix;
4f7599ac	437	const char *cp;
9938af6a	438
4f7599ac	439	/* "name~3" is "name^^^",
4f7599ac	440	* "name~" and "name~0" are name -- not "name^0"!
0601dbe1	441	* "name^" is not "name^0"; it is "name^1".
4f7599ac	442	*/
0601dbe1	443	has_suffix = 0;
4f7599ac JH	444	for (cp = name + len - 1; name <= cp; cp--) {
	445	int ch = *cp;
	446	if ('0' <= ch && ch <= '9')
	447	continue;
0601dbe1 JH	448	if (ch == '~' \|\| ch == '^')
0601dbe1 JH	449	has_suffix = ch;
4f7599ac JH	450	break;
4f7599ac JH	451	}
0601dbe1 JH	452
	453	if (has_suffix) {
	454	int num = 0;
4f7599ac JH	455	int len1 = cp - name;
	456	cp++;
	457	while (cp < name + len)
0601dbe1 JH	458	num = num * 10 + *cp++ - '0';
	459	if (has_suffix == '^') {
	460	if (!num && len1 == len - 1)
	461	num = 1;
	462	return get_parent(name, len1, sha1, num);
	463	}
	464	/* else if (has_suffix == '~') -- goes without saying */
	465	return get_nth_ancestor(name, len1, sha1, num);
4f7599ac JH	466	}
4f7599ac JH	467
5385f52d JH	468	ret = peel_onion(name, len, sha1);
	469	if (!ret)
	470	return 0;
	471
9938af6a JH	472	ret = get_sha1_basic(name, len, sha1);
	473	if (!ret)
	474	return 0;
013f276e	475	return get_short_sha1(name, len, sha1, 0);
9938af6a JH	476	}
	477
	478	/*
	479	* This is like "get_sha1_basic()", except it allows "sha1 expressions",
	480	* notably "xyz^" for "parent of xyz"
	481	*/
	482	int get_sha1(const char name, unsigned char sha1)
	483	{
cce91a2c	484	int ret, bracket_depth;
041a7308	485	unsigned unused;
73b0e5af JH	486	int namelen = strlen(name);
73b0e5af JH	487	const char *cp;
5119602a	488
99a19b43	489	prepare_alt_odb();
73b0e5af JH	490	ret = get_sha1_1(name, namelen, sha1);
	491	if (!ret)
	492	return ret;
	493	/* sha1:path --> object name of path in ent sha1
	494	* :path -> object name of path in index
	495	* :[0-3]:path -> object name of path in index at stage
	496	*/
	497	if (name[0] == ':') {
	498	int stage = 0;
	499	struct cache_entry *ce;
	500	int pos;
	501	if (namelen < 3 \|\|
	502	name[2] != ':' \|\|
	503	name[1] < '0' \|\| '3' < name[1])
	504	cp = name + 1;
	505	else {
	506	stage = name[1] - '0';
	507	cp = name + 3;
5119602a	508	}
73b0e5af JH	509	namelen = namelen - (cp - name);
	510	if (!active_cache)
	511	read_cache();
	512	if (active_nr < 0)
	513	return -1;
	514	pos = cache_name_pos(cp, namelen);
	515	if (pos < 0)
	516	pos = -pos - 1;
	517	while (pos < active_nr) {
	518	ce = active_cache[pos];
	519	if (ce_namelen(ce) != namelen \|\|
	520	memcmp(ce->name, cp, namelen))
	521	break;
	522	if (ce_stage(ce) == stage) {
	523	memcpy(sha1, ce->sha1, 20);
	524	return 0;
	525	}
e7cef45f	526	pos++;
73b0e5af JH	527	}
	528	return -1;
	529	}
cce91a2c SP	530	for (cp = name, bracket_depth = 0; *cp; cp++) {
	531	if (*cp == '{')
	532	bracket_depth++;
	533	else if (bracket_depth && *cp == '}')
	534	bracket_depth--;
	535	else if (!bracket_depth && *cp == ':')
	536	break;
	537	}
	538	if (*cp == ':') {
73b0e5af JH	539	unsigned char tree_sha1[20];
	540	if (!get_sha1_1(name, cp-name, tree_sha1))
	541	return get_tree_entry(tree_sha1, cp+1, sha1,
	542	&unused);
5119602a LT	543	}
5119602a LT	544	return ret;
9938af6a	545	}