9 static int find_short_object_filename(int len, const char *name, unsigned char *sha1)
11 struct alternate_object_database *alt;
14 static struct alternate_object_database *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] = '/';
25 fakeent->next = alt_odb_list;
27 sprintf(hex, "%.2s", name);
28 for (alt = fakeent; alt && found < 2; alt = alt->next) {
31 sprintf(alt->name, "%.2s/", name);
32 dir = opendir(alt->base);
35 while ((de = readdir(dir)) != NULL) {
36 if (strlen(de->d_name) != 38)
38 if (memcmp(de->d_name, name + 2, len - 2))
41 memcpy(hex + 2, de->d_name, 38);
44 else if (memcmp(hex + 2, de->d_name, 38)) {
52 return get_sha1_hex(hex, sha1) == 0;
56 static int match_sha(unsigned len, const unsigned char *a, const unsigned char *b)
71 static int find_short_packed_object(int len, const unsigned char *match, unsigned char *sha1)
74 const unsigned char *found_sha1 = NULL;
78 for (p = packed_git; p && found < 2; p = p->next) {
84 while (first < last) {
85 uint32_t mid = (first + last) / 2;
86 const unsigned char *now;
89 now = nth_packed_object_sha1(p, mid);
90 cmp = hashcmp(match, now);
102 const unsigned char *now, *next;
103 now = nth_packed_object_sha1(p, first);
104 if (match_sha(len, match, now)) {
105 next = nth_packed_object_sha1(p, first+1);
106 if (!next|| !match_sha(len, match, next)) {
107 /* unique within this pack */
112 else if (hashcmp(found_sha1, now)) {
118 /* not even unique within this pack */
126 hashcpy(sha1, found_sha1);
130 #define SHORT_NAME_NOT_FOUND (-1)
131 #define SHORT_NAME_AMBIGUOUS (-2)
133 static int find_unique_short_object(int len, char *canonical,
134 unsigned char *res, unsigned char *sha1)
136 int has_unpacked, has_packed;
137 unsigned char unpacked_sha1[20], packed_sha1[20];
140 has_unpacked = find_short_object_filename(len, canonical, unpacked_sha1);
141 has_packed = find_short_packed_object(len, res, packed_sha1);
142 if (!has_unpacked && !has_packed)
143 return SHORT_NAME_NOT_FOUND;
144 if (1 < has_unpacked || 1 < has_packed)
145 return SHORT_NAME_AMBIGUOUS;
146 if (has_unpacked != has_packed) {
147 hashcpy(sha1, (has_packed ? packed_sha1 : unpacked_sha1));
150 /* Both have unique ones -- do they match? */
151 if (hashcmp(packed_sha1, unpacked_sha1))
152 return SHORT_NAME_AMBIGUOUS;
153 hashcpy(sha1, packed_sha1);
157 static int get_short_sha1(const char *name, int len, unsigned char *sha1,
162 unsigned char res[20];
164 if (len < MINIMUM_ABBREV || len > 40)
167 memset(canonical, 'x', 40);
168 for (i = 0; i < len ;i++) {
169 unsigned char c = name[i];
171 if (c >= '0' && c <= '9')
173 else if (c >= 'a' && c <= 'f')
175 else if (c >= 'A' && c <='F') {
187 status = find_unique_short_object(i, canonical, res, sha1);
188 if (!quietly && (status == SHORT_NAME_AMBIGUOUS))
189 return error("short SHA1 %.*s is ambiguous.", len, canonical);
193 const char *find_unique_abbrev(const unsigned char *sha1, int len)
198 exists = has_sha1_file(sha1);
199 memcpy(hex, sha1_to_hex(sha1), 40);
200 if (len == 40 || !len)
203 unsigned char sha1_ret[20];
204 status = get_short_sha1(hex, len, sha1_ret, 1);
207 : status == SHORT_NAME_NOT_FOUND) {
216 static int ambiguous_path(const char *path, int len)
221 for (cnt = 0; cnt < len; cnt++) {
241 int dwim_ref(const char *str, int len, unsigned char *sha1, char **ref)
247 for (p = ref_rev_parse_rules; *p; p++) {
248 char fullref[PATH_MAX];
249 unsigned char sha1_from_ref[20];
250 unsigned char *this_result;
252 this_result = refs_found ? sha1_from_ref : sha1;
253 mksnpath(fullref, sizeof(fullref), *p, len, str);
254 r = resolve_ref(fullref, this_result, 1, NULL);
258 if (!warn_ambiguous_refs)
265 int dwim_log(const char *str, int len, unsigned char *sha1, char **log)
271 for (p = ref_rev_parse_rules; *p; p++) {
273 unsigned char hash[20];
275 const char *ref, *it;
277 mksnpath(path, sizeof(path), *p, len, str);
278 ref = resolve_ref(path, hash, 1, NULL);
281 if (!stat(git_path("logs/%s", path), &st) &&
284 else if (strcmp(ref, path) &&
285 !stat(git_path("logs/%s", ref), &st) &&
294 if (!warn_ambiguous_refs)
300 static int get_sha1_1(const char *name, int len, unsigned char *sha1);
302 static int get_sha1_basic(const char *str, int len, unsigned char *sha1)
304 static const char *warning = "warning: refname '%.*s' is ambiguous.\n";
305 char *real_ref = NULL;
309 if (len == 40 && !get_sha1_hex(str, sha1))
312 /* basic@{time or number or -number} format to query ref-log */
314 if (str[len-1] == '}') {
315 for (at = 0; at < len - 1; at++) {
316 if (str[at] == '@' && str[at+1] == '{') {
317 reflog_len = (len-1) - (at+2);
324 /* Accept only unambiguous ref paths. */
325 if (len && ambiguous_path(str, len))
328 if (!len && reflog_len) {
329 struct strbuf buf = STRBUF_INIT;
331 /* try the @{-N} syntax for n-th checkout */
332 ret = interpret_nth_last_branch(str+at, &buf);
334 /* substitute this branch name and restart */
335 return get_sha1_1(buf.buf, buf.len, sha1);
336 } else if (ret == 0) {
339 /* allow "@{...}" to mean the current branch reflog */
340 refs_found = dwim_ref("HEAD", 4, sha1, &real_ref);
341 } else if (reflog_len)
342 refs_found = dwim_log(str, len, sha1, &real_ref);
344 refs_found = dwim_ref(str, len, sha1, &real_ref);
349 if (warn_ambiguous_refs && refs_found > 1)
350 fprintf(stderr, warning, len, str);
354 unsigned long at_time;
355 unsigned long co_time;
358 /* Is it asking for N-th entry, or approxidate? */
359 for (i = nth = 0; 0 <= nth && i < reflog_len; i++) {
360 char ch = str[at+2+i];
361 if ('0' <= ch && ch <= '9')
362 nth = nth * 10 + ch - '0';
366 if (100000000 <= nth) {
372 char *tmp = xstrndup(str + at + 2, reflog_len);
373 at_time = approxidate(tmp);
376 if (read_ref_at(real_ref, at_time, nth, sha1, NULL,
377 &co_time, &co_tz, &co_cnt)) {
380 "warning: Log for '%.*s' only goes "
381 "back to %s.\n", len, str,
382 show_date(co_time, co_tz, DATE_RFC2822));
385 "warning: Log for '%.*s' only has "
386 "%d entries.\n", len, str, co_cnt);
394 static int get_parent(const char *name, int len,
395 unsigned char *result, int idx)
397 unsigned char sha1[20];
398 int ret = get_sha1_1(name, len, sha1);
399 struct commit *commit;
400 struct commit_list *p;
404 commit = lookup_commit_reference(sha1);
407 if (parse_commit(commit))
410 hashcpy(result, commit->object.sha1);
416 hashcpy(result, p->item->object.sha1);
424 static int get_nth_ancestor(const char *name, int len,
425 unsigned char *result, int generation)
427 unsigned char sha1[20];
428 struct commit *commit;
431 ret = get_sha1_1(name, len, sha1);
434 commit = lookup_commit_reference(sha1);
438 while (generation--) {
439 if (parse_commit(commit) || !commit->parents)
441 commit = commit->parents->item;
443 hashcpy(result, commit->object.sha1);
447 struct object *peel_to_type(const char *name, int namelen,
448 struct object *o, enum object_type expected_type)
450 if (name && !namelen)
451 namelen = strlen(name);
453 unsigned char sha1[20];
454 if (get_sha1_1(name, namelen, sha1))
456 o = parse_object(sha1);
459 if (!o || (!o->parsed && !parse_object(o->sha1)))
461 if (o->type == expected_type)
463 if (o->type == OBJ_TAG)
464 o = ((struct tag*) o)->tagged;
465 else if (o->type == OBJ_COMMIT)
466 o = &(((struct commit *) o)->tree->object);
469 error("%.*s: expected %s type, but the object "
470 "dereferences to %s type",
471 namelen, name, typename(expected_type),
478 static int peel_onion(const char *name, int len, unsigned char *sha1)
480 unsigned char outer[20];
482 unsigned int expected_type = 0;
486 * "ref^{type}" dereferences ref repeatedly until you cannot
487 * dereference anymore, or you get an object of given type,
488 * whichever comes first. "ref^{}" means just dereference
489 * tags until you get a non-tag. "ref^0" is a shorthand for
490 * "ref^{commit}". "commit^{tree}" could be used to find the
491 * top-level tree of the given commit.
493 if (len < 4 || name[len-1] != '}')
496 for (sp = name + len - 1; name <= sp; sp--) {
498 if (ch == '{' && name < sp && sp[-1] == '^')
504 sp++; /* beginning of type name, or closing brace for empty */
505 if (!strncmp(commit_type, sp, 6) && sp[6] == '}')
506 expected_type = OBJ_COMMIT;
507 else if (!strncmp(tree_type, sp, 4) && sp[4] == '}')
508 expected_type = OBJ_TREE;
509 else if (!strncmp(blob_type, sp, 4) && sp[4] == '}')
510 expected_type = OBJ_BLOB;
511 else if (sp[0] == '}')
512 expected_type = OBJ_NONE;
516 if (get_sha1_1(name, sp - name - 2, outer))
519 o = parse_object(outer);
522 if (!expected_type) {
523 o = deref_tag(o, name, sp - name - 2);
524 if (!o || (!o->parsed && !parse_object(o->sha1)))
526 hashcpy(sha1, o->sha1);
530 * At this point, the syntax look correct, so
531 * if we do not get the needed object, we should
534 o = peel_to_type(name, len, o, expected_type);
536 hashcpy(sha1, o->sha1);
544 static int get_describe_name(const char *name, int len, unsigned char *sha1)
548 for (cp = name + len - 1; name + 2 <= cp; cp--) {
550 if (hexval(ch) & ~0377) {
551 /* We must be looking at g in "SOMETHING-g"
552 * for it to be describe output.
554 if (ch == 'g' && cp[-1] == '-') {
557 return get_short_sha1(cp, len, sha1, 1);
564 static int get_sha1_1(const char *name, int len, unsigned char *sha1)
570 * "name~3" is "name^^^", "name~" is "name~1", and "name^" is "name^1".
573 for (cp = name + len - 1; name <= cp; cp--) {
575 if ('0' <= ch && ch <= '9')
577 if (ch == '~' || ch == '^')
584 int len1 = cp - name;
586 while (cp < name + len)
587 num = num * 10 + *cp++ - '0';
588 if (!num && len1 == len - 1)
590 if (has_suffix == '^')
591 return get_parent(name, len1, sha1, num);
592 /* else if (has_suffix == '~') -- goes without saying */
593 return get_nth_ancestor(name, len1, sha1, num);
596 ret = peel_onion(name, len, sha1);
600 ret = get_sha1_basic(name, len, sha1);
604 /* It could be describe output that is "SOMETHING-gXXXX" */
605 ret = get_describe_name(name, len, sha1);
609 return get_short_sha1(name, len, sha1, 0);
612 static int handle_one_ref(const char *path,
613 const unsigned char *sha1, int flag, void *cb_data)
615 struct commit_list **list = cb_data;
616 struct object *object = parse_object(sha1);
619 if (object->type == OBJ_TAG) {
620 object = deref_tag(object, path, strlen(path));
624 if (object->type != OBJ_COMMIT)
626 insert_by_date((struct commit *)object, list);
631 * This interprets names like ':/Initial revision of "git"' by searching
632 * through history and returning the first commit whose message starts
633 * with the given string.
635 * For future extension, ':/!' is reserved. If you want to match a message
636 * beginning with a '!', you have to repeat the exclamation mark.
639 #define ONELINE_SEEN (1u<<20)
640 static int get_sha1_oneline(const char *prefix, unsigned char *sha1)
642 struct commit_list *list = NULL, *backup = NULL, *l;
644 char *temp_commit_buffer = NULL;
646 if (prefix[0] == '!') {
647 if (prefix[1] != '!')
648 die ("Invalid search pattern: %s", prefix);
651 for_each_ref(handle_one_ref, &list);
652 for (l = list; l; l = l->next)
653 commit_list_insert(l->item, &backup);
656 struct commit *commit;
657 enum object_type type;
660 commit = pop_most_recent_commit(&list, ONELINE_SEEN);
661 if (!parse_object(commit->object.sha1))
663 free(temp_commit_buffer);
667 p = read_sha1_file(commit->object.sha1, &type, &size);
670 temp_commit_buffer = p;
672 if (!(p = strstr(p, "\n\n")))
674 if (!prefixcmp(p + 2, prefix)) {
675 hashcpy(sha1, commit->object.sha1);
680 free(temp_commit_buffer);
681 free_commit_list(list);
682 for (l = backup; l; l = l->next)
683 clear_commit_marks(l->item, ONELINE_SEEN);
687 struct grab_nth_branch_switch_cbdata {
693 static int grab_nth_branch_switch(unsigned char *osha1, unsigned char *nsha1,
694 const char *email, unsigned long timestamp, int tz,
695 const char *message, void *cb_data)
697 struct grab_nth_branch_switch_cbdata *cb = cb_data;
698 const char *match = NULL, *target = NULL;
701 if (!prefixcmp(message, "checkout: moving from ")) {
702 match = message + strlen("checkout: moving from ");
703 if ((target = strstr(match, " to ")) != NULL)
710 len = target - match - 4;
711 if (target[len] == '\n' && !strncmp(match, target, len))
719 if (cb->nth-- <= 0) {
720 strbuf_reset(cb->buf);
721 strbuf_add(cb->buf, match, len);
728 * This reads "@{-N}" syntax, finds the name of the Nth previous
729 * branch we were on, and places the name of the branch in the given
730 * buf and returns the number of characters parsed if successful.
732 * If the input is not of the accepted format, it returns a negative
733 * number to signal an error.
735 * If the input was ok but there are not N branch switches in the
736 * reflog, it returns 0.
738 int interpret_nth_last_branch(const char *name, struct strbuf *buf)
741 struct grab_nth_branch_switch_cbdata cb;
745 if (name[0] != '@' || name[1] != '{' || name[2] != '-')
747 brace = strchr(name, '}');
750 nth = strtol(name+3, &num_end, 10);
751 if (num_end != brace)
757 for_each_reflog_ent("HEAD", grab_nth_branch_switch, &cb);
765 for_each_reflog_ent("HEAD", grab_nth_branch_switch, &cb);
771 * This is like "get_sha1_basic()", except it allows "sha1 expressions",
772 * notably "xyz^" for "parent of xyz"
774 int get_sha1(const char *name, unsigned char *sha1)
777 return get_sha1_with_mode(name, sha1, &unused);
780 int get_sha1_with_mode(const char *name, unsigned char *sha1, unsigned *mode)
782 int ret, bracket_depth;
783 int namelen = strlen(name);
787 ret = get_sha1_1(name, namelen, sha1);
790 /* sha1:path --> object name of path in ent sha1
791 * :path -> object name of path in index
792 * :[0-3]:path -> object name of path in index at stage
794 if (name[0] == ':') {
796 struct cache_entry *ce;
798 if (namelen > 2 && name[1] == '/')
799 return get_sha1_oneline(name + 2, sha1);
802 name[1] < '0' || '3' < name[1])
805 stage = name[1] - '0';
808 namelen = namelen - (cp - name);
811 pos = cache_name_pos(cp, namelen);
814 while (pos < active_nr) {
815 ce = active_cache[pos];
816 if (ce_namelen(ce) != namelen ||
817 memcmp(ce->name, cp, namelen))
819 if (ce_stage(ce) == stage) {
820 hashcpy(sha1, ce->sha1);
828 for (cp = name, bracket_depth = 0; *cp; cp++) {
831 else if (bracket_depth && *cp == '}')
833 else if (!bracket_depth && *cp == ':')
837 unsigned char tree_sha1[20];
838 if (!get_sha1_1(name, cp-name, tree_sha1))
839 return get_tree_entry(tree_sha1, cp+1, sha1,