7 static int find_short_object_filename(int len, const char *name, unsigned char *sha1)
9 struct alternate_object_database *alt;
12 static struct alternate_object_database *fakeent;
15 const char *objdir = get_object_directory();
16 int objdir_len = strlen(objdir);
17 int entlen = objdir_len + 43;
18 fakeent = xmalloc(sizeof(*fakeent) + entlen);
19 memcpy(fakeent->base, objdir, objdir_len);
20 fakeent->name = fakeent->base + objdir_len + 1;
21 fakeent->name[-1] = '/';
23 fakeent->next = alt_odb_list;
25 sprintf(hex, "%.2s", name);
26 for (alt = fakeent; alt && found < 2; alt = alt->next) {
29 sprintf(alt->name, "%.2s/", name);
30 dir = opendir(alt->base);
33 while ((de = readdir(dir)) != NULL) {
34 if (strlen(de->d_name) != 38)
36 if (memcmp(de->d_name, name + 2, len - 2))
39 memcpy(hex + 2, de->d_name, 38);
42 else if (memcmp(hex + 2, de->d_name, 38)) {
50 return get_sha1_hex(hex, sha1) == 0;
54 static int match_sha(unsigned len, const unsigned char *a, const unsigned char *b)
69 static int find_short_packed_object(int len, const unsigned char *match, unsigned char *sha1)
72 unsigned char found_sha1[20];
76 for (p = packed_git; p && found < 2; p = p->next) {
77 unsigned num = num_packed_objects(p);
78 unsigned first = 0, last = num;
79 while (first < last) {
80 unsigned mid = (first + last) / 2;
81 unsigned char now[20];
84 nth_packed_object_sha1(p, mid, now);
85 cmp = memcmp(match, now, 20);
97 unsigned char now[20], next[20];
98 nth_packed_object_sha1(p, first, now);
99 if (match_sha(len, match, now)) {
100 if (nth_packed_object_sha1(p, first+1, next) ||
101 !match_sha(len, match, next)) {
102 /* unique within this pack */
104 memcpy(found_sha1, now, 20);
107 else if (memcmp(found_sha1, now, 20)) {
113 /* not even unique within this pack */
121 memcpy(sha1, found_sha1, 20);
125 #define SHORT_NAME_NOT_FOUND (-1)
126 #define SHORT_NAME_AMBIGUOUS (-2)
128 static int find_unique_short_object(int len, char *canonical,
129 unsigned char *res, unsigned char *sha1)
131 int has_unpacked, has_packed;
132 unsigned char unpacked_sha1[20], packed_sha1[20];
134 has_unpacked = find_short_object_filename(len, canonical, unpacked_sha1);
135 has_packed = find_short_packed_object(len, res, packed_sha1);
136 if (!has_unpacked && !has_packed)
137 return SHORT_NAME_NOT_FOUND;
138 if (1 < has_unpacked || 1 < has_packed)
139 return SHORT_NAME_AMBIGUOUS;
140 if (has_unpacked != has_packed) {
141 memcpy(sha1, (has_packed ? packed_sha1 : unpacked_sha1), 20);
144 /* Both have unique ones -- do they match? */
145 if (memcmp(packed_sha1, unpacked_sha1, 20))
147 memcpy(sha1, packed_sha1, 20);
151 static int get_short_sha1(const char *name, int len, unsigned char *sha1,
156 unsigned char res[20];
161 memset(canonical, 'x', 40);
162 for (i = 0; i < len ;i++) {
163 unsigned char c = name[i];
165 if (c >= '0' && c <= '9')
167 else if (c >= 'a' && c <= 'f')
169 else if (c >= 'A' && c <='F') {
181 status = find_unique_short_object(i, canonical, res, sha1);
182 if (!quietly && (status == SHORT_NAME_AMBIGUOUS))
183 return error("short SHA1 %.*s is ambiguous.", len, canonical);
187 const char *find_unique_abbrev(const unsigned char *sha1, int len)
191 memcpy(hex, sha1_to_hex(sha1), 40);
193 unsigned char sha1_ret[20];
194 status = get_short_sha1(hex, len, sha1_ret, 1);
199 if (status != SHORT_NAME_AMBIGUOUS)
206 static int get_sha1_basic(const char *str, int len, unsigned char *sha1)
208 static const char *prefix[] = {
217 if (len == 40 && !get_sha1_hex(str, sha1))
220 for (p = prefix; *p; p++) {
221 char *pathname = git_path("%s/%.*s", *p, len, str);
222 if (!read_ref(pathname, sha1))
229 static int get_sha1_1(const char *name, int len, unsigned char *sha1);
231 static int get_parent(const char *name, int len,
232 unsigned char *result, int idx)
234 unsigned char sha1[20];
235 int ret = get_sha1_1(name, len, sha1);
236 struct commit *commit;
237 struct commit_list *p;
241 commit = lookup_commit_reference(sha1);
244 if (parse_commit(commit))
247 memcpy(result, commit->object.sha1, 20);
253 memcpy(result, p->item->object.sha1, 20);
261 static int get_nth_ancestor(const char *name, int len,
262 unsigned char *result, int generation)
264 unsigned char sha1[20];
265 int ret = get_sha1_1(name, len, sha1);
269 while (generation--) {
270 struct commit *commit = lookup_commit_reference(sha1);
272 if (!commit || parse_commit(commit) || !commit->parents)
274 memcpy(sha1, commit->parents->item->object.sha1, 20);
276 memcpy(result, sha1, 20);
280 static int peel_onion(const char *name, int len, unsigned char *sha1)
282 unsigned char outer[20];
284 const char *type_string = NULL;
288 * "ref^{type}" dereferences ref repeatedly until you cannot
289 * dereference anymore, or you get an object of given type,
290 * whichever comes first. "ref^{}" means just dereference
291 * tags until you get a non-tag. "ref^0" is a shorthand for
292 * "ref^{commit}". "commit^{tree}" could be used to find the
293 * top-level tree of the given commit.
295 if (len < 4 || name[len-1] != '}')
298 for (sp = name + len - 1; name <= sp; sp--) {
300 if (ch == '{' && name < sp && sp[-1] == '^')
306 sp++; /* beginning of type name, or closing brace for empty */
307 if (!strncmp(commit_type, sp, 6) && sp[6] == '}')
308 type_string = commit_type;
309 else if (!strncmp(tree_type, sp, 4) && sp[4] == '}')
310 type_string = tree_type;
311 else if (!strncmp(blob_type, sp, 4) && sp[4] == '}')
312 type_string = blob_type;
313 else if (sp[0] == '}')
318 if (get_sha1_1(name, sp - name - 2, outer))
321 o = parse_object(outer);
326 if (!o || (!o->parsed && !parse_object(o->sha1)))
328 memcpy(sha1, o->sha1, 20);
331 /* At this point, the syntax look correct, so
332 * if we do not get the needed object, we should
337 if (!o || (!o->parsed && !parse_object(o->sha1)))
339 if (o->type == type_string) {
340 memcpy(sha1, o->sha1, 20);
343 if (o->type == tag_type)
344 o = ((struct tag*) o)->tagged;
345 else if (o->type == commit_type)
346 o = &(((struct commit *) o)->tree->object);
348 return error("%.*s: expected %s type, but the object dereferences to %s type",
349 len, name, type_string,
352 parse_object(o->sha1);
358 static int get_sha1_1(const char *name, int len, unsigned char *sha1)
363 /* foo^[0-9] or foo^ (== foo^1); we do not do more than 9 parents. */
364 if (len > 2 && name[len-2] == '^' &&
365 name[len-1] >= '0' && name[len-1] <= '9') {
366 parent = name[len-1] - '0';
369 else if (len > 1 && name[len-1] == '^') {
376 return get_parent(name, len, sha1, parent);
378 /* "name~3" is "name^^^",
379 * "name~12" is "name^^^^^^^^^^^^", and
380 * "name~" and "name~0" are name -- not "name^0"!
383 for (cp = name + len - 1; name <= cp; cp--) {
385 if ('0' <= ch && ch <= '9')
391 if (!parent && *cp == '~') {
392 int len1 = cp - name;
394 while (cp < name + len)
395 parent = parent * 10 + *cp++ - '0';
396 return get_nth_ancestor(name, len1, sha1, parent);
399 ret = peel_onion(name, len, sha1);
403 ret = get_sha1_basic(name, len, sha1);
406 return get_short_sha1(name, len, sha1, 0);
410 * This is like "get_sha1_basic()", except it allows "sha1 expressions",
411 * notably "xyz^" for "parent of xyz"
413 int get_sha1(const char *name, unsigned char *sha1)
416 return get_sha1_1(name, strlen(name), sha1);