X-Git-Url: https://git.octo.it/?a=blobdiff_plain;f=sha1_name.c;h=4f92e12a8dfce29b5bb50108468259d9f04653f3;hb=e51c3b50063d52ecd209a6f9846570d660e6310c;hp=b4fed924f7ac95571904874fffe8012940f9febb;hpb=af61c6e008c39ee9f61af33bb48850230f503443;p=git.git

diff --git a/sha1_name.c b/sha1_name.c
index b4fed924..4f92e12a 100644
--- a/sha1_name.c
+++ b/sha1_name.c
@@ -1,33 +1,54 @@
 #include "cache.h"
+#include "tag.h"
 #include "commit.h"
+#include "tree.h"
+#include "blob.h"
 
 static int find_short_object_filename(int len, const char *name, unsigned char *sha1)
 {
-	static char dirname[PATH_MAX];
+	struct alternate_object_database *alt;
 	char hex[40];
-	DIR *dir;
-	int found;
+	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;
 
-	snprintf(dirname, sizeof(dirname), "%s/%.2s", get_object_directory(), name);
-	dir = opendir(dirname);
 	sprintf(hex, "%.2s", name);
-	found = 0;
-	if (dir) {
+	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))
+			if (memcmp(de->d_name, name + 2, len - 2))
 				continue;
-			memcpy(hex + 2, de->d_name, 38);
-			if (++found > 1)
+			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 0;
+	return found;
 }
 
 static int match_sha(unsigned len, const unsigned char *a, const unsigned char *b)
@@ -48,9 +69,11 @@ static int match_sha(unsigned len, const unsigned char *a, const unsigned char *
 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; p = p->next) {
+	for (p = packed_git; p && found < 2; p = p->next) {
 		unsigned num = num_packed_objects(p);
 		unsigned first = 0, last = num;
 		while (first < last) {
@@ -74,23 +97,65 @@ static int find_short_packed_object(int len, const unsigned char *match, unsigne
 			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)) {
-					memcpy(sha1, now, 20);
-					return 1;
+				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)
+static int get_short_sha1(const char *name, int len, unsigned char *sha1,
+			  int quietly)
 {
-	int i;
+	int i, status;
 	char canonical[40];
 	unsigned char res[20];
 
-	if (len < 4)
+	if (len < MINIMUM_ABBREV)
 		return -1;
 	memset(res, 0, 20);
 	memset(canonical, 'x', 40);
@@ -112,48 +177,102 @@ static int get_short_sha1(const char *name, int len, unsigned char *sha1)
 			val <<= 4;
 		res[i >> 1] |= val;
 	}
-	if (find_short_object_filename(i, canonical, sha1))
-		return 0;
-	if (find_short_packed_object(i, res, sha1))
-		return 0;
-	return -1;
+
+	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;
 }
 
-static int get_sha1_file(const char *path, unsigned char *result)
+const char *find_unique_abbrev(const unsigned char *sha1, int len)
 {
-	char buffer[60];
-	int fd = open(path, O_RDONLY);
-	int len;
+	int status, is_null;
+	static char hex[41];
 
-	if (fd < 0)
-		return -1;
-	len = read(fd, buffer, sizeof(buffer));
-	close(fd);
-	if (len < 40)
-		return -1;
-	return get_sha1_hex(buffer, result);
+	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 *prefix[] = {
-		"",
-		"refs",
-		"refs/tags",
-		"refs/heads",
+	static const char *fmt[] = {
+		"%.*s",
+		"refs/%.*s",
+		"refs/tags/%.*s",
+		"refs/heads/%.*s",
+		"refs/remotes/%.*s",
+		"refs/remotes/%.*s/HEAD",
 		NULL
 	};
 	const char **p;
+	const char *warning = "warning: refname '%.*s' is ambiguous.\n";
+	char *pathname;
+	int already_found = 0;
+	unsigned char *this_result;
+	unsigned char sha1_from_ref[20];
 
 	if (len == 40 && !get_sha1_hex(str, sha1))
 		return 0;
 
-	for (p = prefix; *p; p++) {
-		char *pathname = git_path("%s/%.*s", *p, len, str);
-		if (!get_sha1_file(pathname, sha1))
-			return 0;
-	}
+	/* Accept only unambiguous ref paths. */
+	if (ambiguous_path(str, len))
+		return -1;
 
+	for (p = fmt; *p; p++) {
+		this_result = already_found ? sha1_from_ref : sha1;
+		pathname = git_path(*p, len, str);
+		if (!read_ref(pathname, this_result)) {
+			if (warn_ambiguous_refs) {
+				if (already_found)
+					fprintf(stderr, warning, len, str);
+				already_found++;
+			}
+			else
+				return 0;
+		}
+	}
+	if (already_found)
+		return 0;
 	return -1;
 }
 
@@ -208,51 +327,126 @@ static int get_nth_ancestor(const char *name, int len,
 	return 0;
 }
 
-static int get_sha1_1(const char *name, int len, unsigned char *sha1)
+static int peel_onion(const char *name, int len, unsigned char *sha1)
 {
-	int parent, ret;
-	const char *cp;
+	unsigned char outer[20];
+	const char *sp;
+	const char *type_string = NULL;
+	struct object *o;
 
-	/* foo^[0-9] or foo^ (== foo^1); we do not do more than 9 parents. */
-	if (len > 2 && name[len-2] == '^' &&
-	    name[len-1] >= '0' && name[len-1] <= '9') {
-		parent = name[len-1] - '0';
-		len -= 2;
+	/*
+	 * "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;
 	}
-	else if (len > 1 && name[len-1] == '^') {
-		parent = 1;
-		len--;
-	} else
-		parent = -1;
+	if (sp <= name)
+		return -1;
 
-	if (parent >= 0)
-		return get_parent(name, len, sha1, parent);
+	sp++; /* beginning of type name, or closing brace for empty */
+	if (!strncmp(commit_type, sp, 6) && sp[6] == '}')
+		type_string = commit_type;
+	else if (!strncmp(tree_type, sp, 4) && sp[4] == '}')
+		type_string = tree_type;
+	else if (!strncmp(blob_type, sp, 4) && sp[4] == '}')
+		type_string = blob_type;
+	else if (sp[0] == '}')
+		type_string = NULL;
+	else
+		return -1;
+
+	if (get_sha1_1(name, sp - name - 2, outer))
+		return -1;
+
+	o = parse_object(outer);
+	if (!o)
+		return -1;
+	if (!type_string) {
+		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 == type_string) {
+				memcpy(sha1, o->sha1, 20);
+				return 0;
+			}
+			if (o->type == tag_type)
+				o = ((struct tag*) o)->tagged;
+			else if (o->type == commit_type)
+				o = &(((struct commit *) o)->tree->object);
+			else
+				return error("%.*s: expected %s type, but the object dereferences to %s type",
+					     len, name, type_string,
+					     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~12" is "name^^^^^^^^^^^^", and
 	 * "name~" and "name~0" are name -- not "name^0"!
+	 * "name^" is not "name^0"; it is "name^1".
 	 */
-	parent = 0;
+	has_suffix = 0;
 	for (cp = name + len - 1; name <= cp; cp--) {
 		int ch = *cp;
 		if ('0' <= ch && ch <= '9')
 			continue;
-		if (ch != '~')
-			parent = -1;
+		if (ch == '~' || ch == '^')
+			has_suffix = ch;
 		break;
 	}
-	if (!parent && *cp == '~') {
+
+	if (has_suffix) {
+		int num = 0;
 		int len1 = cp - name;
 		cp++;
 		while (cp < name + len)
-			parent = parent * 10 + *cp++ - '0';
-		return get_nth_ancestor(name, len1, sha1, parent);
+			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);
+	return get_short_sha1(name, len, sha1, 0);
 }
 
 /*
@@ -261,5 +455,6 @@ static int get_sha1_1(const char *name, int len, unsigned char *sha1)
  */
 int get_sha1(const char *name, unsigned char *sha1)
 {
+	prepare_alt_odb();
 	return get_sha1_1(name, strlen(name), sha1);
 }