approxidate_careful() reports errorneous date string
[git/git.git] / sha1_name.c
CommitLineData
9938af6a 1#include "cache.h"
5385f52d 2#include "tag.h"
9938af6a 3#include "commit.h"
5385f52d
JH
4#include "tree.h"
5#include "blob.h"
f3ab49db 6#include "tree-walk.h"
d556fae2 7#include "refs.h"
9938af6a
JH
8
9static 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
56static 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
71static int find_short_packed_object(int len, const unsigned char *match, unsigned char *sha1)
72{
73 struct packed_git *p;
d72308e0 74 const unsigned char *found_sha1 = NULL;
99a19b43 75 int found = 0;
9938af6a
JH
76
77 prepare_packed_git();
99a19b43 78 for (p = packed_git; p && found < 2; p = p->next) {
1055880e
JB
79 uint32_t num, last;
80 uint32_t first = 0;
81 open_pack_index(p);
82 num = p->num_objects;
83 last = num;
9938af6a 84 while (first < last) {
326bf396 85 uint32_t mid = (first + last) / 2;
d72308e0 86 const unsigned char *now;
9938af6a
JH
87 int cmp;
88
d72308e0 89 now = nth_packed_object_sha1(p, mid);
a89fccd2 90 cmp = hashcmp(match, now);
9938af6a
JH
91 if (!cmp) {
92 first = mid;
93 break;
94 }
95 if (cmp > 0) {
96 first = mid+1;
97 continue;
98 }
99 last = mid;
100 }
101 if (first < num) {
d72308e0
NP
102 const unsigned char *now, *next;
103 now = nth_packed_object_sha1(p, first);
9938af6a 104 if (match_sha(len, match, now)) {
d72308e0
NP
105 next = nth_packed_object_sha1(p, first+1);
106 if (!next|| !match_sha(len, match, next)) {
0bc45890
JH
107 /* unique within this pack */
108 if (!found) {
d72308e0 109 found_sha1 = now;
0bc45890
JH
110 found++;
111 }
a89fccd2 112 else if (hashcmp(found_sha1, now)) {
0bc45890
JH
113 found = 2;
114 break;
115 }
99a19b43 116 }
0bc45890
JH
117 else {
118 /* not even unique within this pack */
99a19b43
JH
119 found = 2;
120 break;
9938af6a
JH
121 }
122 }
123 }
124 }
99a19b43 125 if (found == 1)
e702496e 126 hashcpy(sha1, found_sha1);
99a19b43
JH
127 return found;
128}
129
013f276e
JH
130#define SHORT_NAME_NOT_FOUND (-1)
131#define SHORT_NAME_AMBIGUOUS (-2)
132
99a19b43
JH
133static int find_unique_short_object(int len, char *canonical,
134 unsigned char *res, unsigned char *sha1)
135{
136 int has_unpacked, has_packed;
137 unsigned char unpacked_sha1[20], packed_sha1[20];
138
693d2bc6 139 prepare_alt_odb();
99a19b43
JH
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)
013f276e 143 return SHORT_NAME_NOT_FOUND;
99a19b43 144 if (1 < has_unpacked || 1 < has_packed)
013f276e 145 return SHORT_NAME_AMBIGUOUS;
99a19b43 146 if (has_unpacked != has_packed) {
e702496e 147 hashcpy(sha1, (has_packed ? packed_sha1 : unpacked_sha1));
99a19b43
JH
148 return 0;
149 }
150 /* Both have unique ones -- do they match? */
a89fccd2 151 if (hashcmp(packed_sha1, unpacked_sha1))
e974c9ab 152 return SHORT_NAME_AMBIGUOUS;
e702496e 153 hashcpy(sha1, packed_sha1);
9938af6a
JH
154 return 0;
155}
156
013f276e
JH
157static int get_short_sha1(const char *name, int len, unsigned char *sha1,
158 int quietly)
9938af6a 159{
013f276e 160 int i, status;
9938af6a
JH
161 char canonical[40];
162 unsigned char res[20];
163
8a83157e 164 if (len < MINIMUM_ABBREV || len > 40)
af61c6e0 165 return -1;
a8e0d16d 166 hashclr(res);
9938af6a 167 memset(canonical, 'x', 40);
af61c6e0 168 for (i = 0; i < len ;i++) {
9938af6a
JH
169 unsigned char c = name[i];
170 unsigned char val;
9938af6a
JH
171 if (c >= '0' && c <= '9')
172 val = c - '0';
173 else if (c >= 'a' && c <= 'f')
174 val = c - 'a' + 10;
175 else if (c >= 'A' && c <='F') {
176 val = c - 'A' + 10;
177 c -= 'A' - 'a';
178 }
179 else
180 return -1;
181 canonical[i] = c;
182 if (!(i & 1))
183 val <<= 4;
184 res[i >> 1] |= val;
185 }
99a19b43 186
013f276e
JH
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);
190 return status;
191}
192
193const char *find_unique_abbrev(const unsigned char *sha1, int len)
194{
b66fde9a 195 int status, exists;
013f276e 196 static char hex[41];
47dd0d59 197
b66fde9a 198 exists = has_sha1_file(sha1);
013f276e 199 memcpy(hex, sha1_to_hex(sha1), 40);
02c5cba2 200 if (len == 40 || !len)
47dd0d59 201 return hex;
013f276e
JH
202 while (len < 40) {
203 unsigned char sha1_ret[20];
204 status = get_short_sha1(hex, len, sha1_ret, 1);
b66fde9a
JH
205 if (exists
206 ? !status
207 : status == SHORT_NAME_NOT_FOUND) {
013f276e
JH
208 hex[len] = 0;
209 return hex;
210 }
013f276e
JH
211 len++;
212 }
b66fde9a 213 return hex;
9938af6a
JH
214}
215
6677c466 216static int ambiguous_path(const char *path, int len)
af13cdf2
LT
217{
218 int slash = 1;
6677c466 219 int cnt;
af13cdf2 220
6677c466 221 for (cnt = 0; cnt < len; cnt++) {
af13cdf2
LT
222 switch (*path++) {
223 case '\0':
224 break;
225 case '/':
226 if (slash)
227 break;
228 slash = 1;
229 continue;
230 case '.':
231 continue;
232 default:
233 slash = 0;
234 continue;
235 }
c054d64e 236 break;
af13cdf2 237 }
6677c466 238 return slash;
af13cdf2
LT
239}
240
aa9c55b6
JS
241/*
242 * *string and *len will only be substituted, and *string returned (for
243 * later free()ing) if the string passed in is of the form @{-<n>}.
244 */
431b1969 245static char *substitute_branch_name(const char **string, int *len)
aa9c55b6
JS
246{
247 struct strbuf buf = STRBUF_INIT;
431b1969 248 int ret = interpret_branch_name(*string, &buf);
aa9c55b6
JS
249
250 if (ret == *len) {
251 size_t size;
252 *string = strbuf_detach(&buf, &size);
253 *len = size;
254 return (char *)*string;
255 }
256
257 return NULL;
258}
259
e86eb666 260int dwim_ref(const char *str, int len, unsigned char *sha1, char **ref)
9938af6a 261{
431b1969 262 char *last_branch = substitute_branch_name(&str, &len);
e86eb666
JH
263 const char **p, *r;
264 int refs_found = 0;
265
266 *ref = NULL;
79803322 267 for (p = ref_rev_parse_rules; *p; p++) {
94cc3552 268 char fullref[PATH_MAX];
e86eb666
JH
269 unsigned char sha1_from_ref[20];
270 unsigned char *this_result;
057e7138 271 int flag;
e86eb666
JH
272
273 this_result = refs_found ? sha1_from_ref : sha1;
94cc3552 274 mksnpath(fullref, sizeof(fullref), *p, len, str);
057e7138 275 r = resolve_ref(fullref, this_result, 1, &flag);
e86eb666
JH
276 if (r) {
277 if (!refs_found++)
278 *ref = xstrdup(r);
279 if (!warn_ambiguous_refs)
280 break;
9e5b80cd
JH
281 } else if ((flag & REF_ISSYMREF) &&
282 (len != 4 || strcmp(str, "HEAD")))
057e7138 283 warning("ignoring dangling symref %s.", fullref);
e86eb666 284 }
aa9c55b6 285 free(last_branch);
e86eb666
JH
286 return refs_found;
287}
288
eb3a4822 289int dwim_log(const char *str, int len, unsigned char *sha1, char **log)
f2eba66d 290{
431b1969 291 char *last_branch = substitute_branch_name(&str, &len);
f2eba66d
NP
292 const char **p;
293 int logs_found = 0;
294
295 *log = NULL;
79803322 296 for (p = ref_rev_parse_rules; *p; p++) {
f2eba66d 297 struct stat st;
40facde0
JH
298 unsigned char hash[20];
299 char path[PATH_MAX];
300 const char *ref, *it;
301
94cc3552 302 mksnpath(path, sizeof(path), *p, len, str);
0c4cd7f4 303 ref = resolve_ref(path, hash, 1, NULL);
40facde0
JH
304 if (!ref)
305 continue;
f2eba66d 306 if (!stat(git_path("logs/%s", path), &st) &&
40facde0
JH
307 S_ISREG(st.st_mode))
308 it = path;
309 else if (strcmp(ref, path) &&
310 !stat(git_path("logs/%s", ref), &st) &&
311 S_ISREG(st.st_mode))
312 it = ref;
313 else
314 continue;
315 if (!logs_found++) {
316 *log = xstrdup(it);
317 hashcpy(sha1, hash);
f2eba66d 318 }
40facde0
JH
319 if (!warn_ambiguous_refs)
320 break;
f2eba66d 321 }
aa9c55b6 322 free(last_branch);
f2eba66d
NP
323 return logs_found;
324}
325
d18ba221
TR
326static int get_sha1_1(const char *name, int len, unsigned char *sha1);
327
e86eb666
JH
328static int get_sha1_basic(const char *str, int len, unsigned char *sha1)
329{
d556fae2 330 static const char *warning = "warning: refname '%.*s' is ambiguous.\n";
ed378ec7 331 char *real_ref = NULL;
ab2a1a32
JH
332 int refs_found = 0;
333 int at, reflog_len;
9938af6a 334
3c3852e3 335 if (len == 40 && !get_sha1_hex(str, sha1))
9938af6a
JH
336 return 0;
337
d18ba221 338 /* basic@{time or number or -number} format to query ref-log */
694500ed 339 reflog_len = at = 0;
f265458f 340 if (len && str[len-1] == '}') {
aa9c55b6 341 for (at = len-2; at >= 0; at--) {
ab2a1a32
JH
342 if (str[at] == '@' && str[at+1] == '{') {
343 reflog_len = (len-1) - (at+2);
344 len = at;
345 break;
346 }
d556fae2
SP
347 }
348 }
349
af13cdf2 350 /* Accept only unambiguous ref paths. */
11cf8801 351 if (len && ambiguous_path(str, len))
af13cdf2
LT
352 return -1;
353
11cf8801 354 if (!len && reflog_len) {
d18ba221
TR
355 struct strbuf buf = STRBUF_INIT;
356 int ret;
357 /* try the @{-N} syntax for n-th checkout */
431b1969 358 ret = interpret_branch_name(str+at, &buf);
d18ba221
TR
359 if (ret > 0) {
360 /* substitute this branch name and restart */
361 return get_sha1_1(buf.buf, buf.len, sha1);
362 } else if (ret == 0) {
363 return -1;
364 }
11cf8801
NP
365 /* allow "@{...}" to mean the current branch reflog */
366 refs_found = dwim_ref("HEAD", 4, sha1, &real_ref);
f2eba66d
NP
367 } else if (reflog_len)
368 refs_found = dwim_log(str, len, sha1, &real_ref);
369 else
11cf8801 370 refs_found = dwim_ref(str, len, sha1, &real_ref);
d556fae2
SP
371
372 if (!refs_found)
373 return -1;
374
375 if (warn_ambiguous_refs && refs_found > 1)
376 fprintf(stderr, warning, len, str);
377
ab2a1a32 378 if (reflog_len) {
ab2a1a32
JH
379 int nth, i;
380 unsigned long at_time;
16d7cc90
JH
381 unsigned long co_time;
382 int co_tz, co_cnt;
383
fe558516 384 /* Is it asking for N-th entry, or approxidate? */
ab2a1a32
JH
385 for (i = nth = 0; 0 <= nth && i < reflog_len; i++) {
386 char ch = str[at+2+i];
387 if ('0' <= ch && ch <= '9')
388 nth = nth * 10 + ch - '0';
389 else
390 nth = -1;
391 }
ea360dd0
SP
392 if (100000000 <= nth) {
393 at_time = nth;
394 nth = -1;
395 } else if (0 <= nth)
ab2a1a32 396 at_time = 0;
861f00e3 397 else {
93cfa7c7 398 int errors = 0;
861f00e3 399 char *tmp = xstrndup(str + at + 2, reflog_len);
93cfa7c7
JH
400 at_time = approxidate_careful(tmp, &errors);
401 if (errors)
402 die("Bogus timestamp '%s'", tmp);
861f00e3
JK
403 free(tmp);
404 }
16d7cc90
JH
405 if (read_ref_at(real_ref, at_time, nth, sha1, NULL,
406 &co_time, &co_tz, &co_cnt)) {
407 if (at_time)
408 fprintf(stderr,
409 "warning: Log for '%.*s' only goes "
410 "back to %s.\n", len, str,
73013afd 411 show_date(co_time, co_tz, DATE_RFC2822));
16d7cc90
JH
412 else
413 fprintf(stderr,
414 "warning: Log for '%.*s' only has "
415 "%d entries.\n", len, str, co_cnt);
416 }
d556fae2
SP
417 }
418
ed378ec7 419 free(real_ref);
d556fae2 420 return 0;
9938af6a
JH
421}
422
9938af6a
JH
423static int get_parent(const char *name, int len,
424 unsigned char *result, int idx)
425{
426 unsigned char sha1[20];
427 int ret = get_sha1_1(name, len, sha1);
428 struct commit *commit;
429 struct commit_list *p;
430
431 if (ret)
432 return ret;
433 commit = lookup_commit_reference(sha1);
434 if (!commit)
435 return -1;
436 if (parse_commit(commit))
437 return -1;
438 if (!idx) {
e702496e 439 hashcpy(result, commit->object.sha1);
9938af6a
JH
440 return 0;
441 }
442 p = commit->parents;
443 while (p) {
444 if (!--idx) {
e702496e 445 hashcpy(result, p->item->object.sha1);
9938af6a
JH
446 return 0;
447 }
448 p = p->next;
449 }
450 return -1;
451}
452
4f7599ac
JH
453static int get_nth_ancestor(const char *name, int len,
454 unsigned char *result, int generation)
455{
456 unsigned char sha1[20];
621ff675
LT
457 struct commit *commit;
458 int ret;
459
460 ret = get_sha1_1(name, len, sha1);
4f7599ac
JH
461 if (ret)
462 return ret;
621ff675
LT
463 commit = lookup_commit_reference(sha1);
464 if (!commit)
465 return -1;
4f7599ac
JH
466
467 while (generation--) {
621ff675 468 if (parse_commit(commit) || !commit->parents)
4f7599ac 469 return -1;
621ff675 470 commit = commit->parents->item;
4f7599ac 471 }
621ff675 472 hashcpy(result, commit->object.sha1);
4f7599ac
JH
473 return 0;
474}
475
81776315
JH
476struct object *peel_to_type(const char *name, int namelen,
477 struct object *o, enum object_type expected_type)
478{
479 if (name && !namelen)
480 namelen = strlen(name);
481 if (!o) {
482 unsigned char sha1[20];
483 if (get_sha1_1(name, namelen, sha1))
484 return NULL;
485 o = parse_object(sha1);
486 }
487 while (1) {
488 if (!o || (!o->parsed && !parse_object(o->sha1)))
489 return NULL;
490 if (o->type == expected_type)
491 return o;
492 if (o->type == OBJ_TAG)
493 o = ((struct tag*) o)->tagged;
494 else if (o->type == OBJ_COMMIT)
495 o = &(((struct commit *) o)->tree->object);
496 else {
497 if (name)
498 error("%.*s: expected %s type, but the object "
499 "dereferences to %s type",
500 namelen, name, typename(expected_type),
501 typename(o->type));
502 return NULL;
503 }
504 }
505}
506
5385f52d
JH
507static int peel_onion(const char *name, int len, unsigned char *sha1)
508{
509 unsigned char outer[20];
510 const char *sp;
885a86ab 511 unsigned int expected_type = 0;
5385f52d
JH
512 struct object *o;
513
514 /*
515 * "ref^{type}" dereferences ref repeatedly until you cannot
516 * dereference anymore, or you get an object of given type,
517 * whichever comes first. "ref^{}" means just dereference
518 * tags until you get a non-tag. "ref^0" is a shorthand for
519 * "ref^{commit}". "commit^{tree}" could be used to find the
520 * top-level tree of the given commit.
521 */
522 if (len < 4 || name[len-1] != '}')
523 return -1;
524
525 for (sp = name + len - 1; name <= sp; sp--) {
526 int ch = *sp;
527 if (ch == '{' && name < sp && sp[-1] == '^')
528 break;
529 }
530 if (sp <= name)
531 return -1;
532
533 sp++; /* beginning of type name, or closing brace for empty */
534 if (!strncmp(commit_type, sp, 6) && sp[6] == '}')
1974632c 535 expected_type = OBJ_COMMIT;
5385f52d 536 else if (!strncmp(tree_type, sp, 4) && sp[4] == '}')
1974632c 537 expected_type = OBJ_TREE;
5385f52d 538 else if (!strncmp(blob_type, sp, 4) && sp[4] == '}')
1974632c 539 expected_type = OBJ_BLOB;
5385f52d 540 else if (sp[0] == '}')
1974632c 541 expected_type = OBJ_NONE;
5385f52d
JH
542 else
543 return -1;
544
545 if (get_sha1_1(name, sp - name - 2, outer))
546 return -1;
547
548 o = parse_object(outer);
549 if (!o)
550 return -1;
885a86ab 551 if (!expected_type) {
9534f40b 552 o = deref_tag(o, name, sp - name - 2);
6e1c6c10
JH
553 if (!o || (!o->parsed && !parse_object(o->sha1)))
554 return -1;
e702496e 555 hashcpy(sha1, o->sha1);
5385f52d
JH
556 }
557 else {
81776315
JH
558 /*
559 * At this point, the syntax look correct, so
5385f52d
JH
560 * if we do not get the needed object, we should
561 * barf.
562 */
81776315
JH
563 o = peel_to_type(name, len, o, expected_type);
564 if (o) {
565 hashcpy(sha1, o->sha1);
566 return 0;
5385f52d 567 }
81776315 568 return -1;
5385f52d
JH
569 }
570 return 0;
571}
572
7dd45e15
JH
573static int get_describe_name(const char *name, int len, unsigned char *sha1)
574{
575 const char *cp;
576
577 for (cp = name + len - 1; name + 2 <= cp; cp--) {
578 char ch = *cp;
579 if (hexval(ch) & ~0377) {
580 /* We must be looking at g in "SOMETHING-g"
581 * for it to be describe output.
582 */
583 if (ch == 'g' && cp[-1] == '-') {
584 cp++;
585 len -= cp - name;
586 return get_short_sha1(cp, len, sha1, 1);
587 }
588 }
589 }
590 return -1;
591}
592
9938af6a
JH
593static int get_sha1_1(const char *name, int len, unsigned char *sha1)
594{
0601dbe1 595 int ret, has_suffix;
4f7599ac 596 const char *cp;
9938af6a 597
621ff675
LT
598 /*
599 * "name~3" is "name^^^", "name~" is "name~1", and "name^" is "name^1".
4f7599ac 600 */
0601dbe1 601 has_suffix = 0;
4f7599ac
JH
602 for (cp = name + len - 1; name <= cp; cp--) {
603 int ch = *cp;
604 if ('0' <= ch && ch <= '9')
605 continue;
0601dbe1
JH
606 if (ch == '~' || ch == '^')
607 has_suffix = ch;
4f7599ac
JH
608 break;
609 }
0601dbe1
JH
610
611 if (has_suffix) {
612 int num = 0;
4f7599ac
JH
613 int len1 = cp - name;
614 cp++;
615 while (cp < name + len)
0601dbe1 616 num = num * 10 + *cp++ - '0';
621ff675
LT
617 if (!num && len1 == len - 1)
618 num = 1;
619 if (has_suffix == '^')
0601dbe1 620 return get_parent(name, len1, sha1, num);
0601dbe1
JH
621 /* else if (has_suffix == '~') -- goes without saying */
622 return get_nth_ancestor(name, len1, sha1, num);
4f7599ac
JH
623 }
624
5385f52d
JH
625 ret = peel_onion(name, len, sha1);
626 if (!ret)
627 return 0;
628
9938af6a
JH
629 ret = get_sha1_basic(name, len, sha1);
630 if (!ret)
631 return 0;
7dd45e15
JH
632
633 /* It could be describe output that is "SOMETHING-gXXXX" */
634 ret = get_describe_name(name, len, sha1);
635 if (!ret)
636 return 0;
637
013f276e 638 return get_short_sha1(name, len, sha1, 0);
9938af6a
JH
639}
640
28a4d940
JS
641static int handle_one_ref(const char *path,
642 const unsigned char *sha1, int flag, void *cb_data)
643{
644 struct commit_list **list = cb_data;
645 struct object *object = parse_object(sha1);
646 if (!object)
647 return 0;
affeef12 648 if (object->type == OBJ_TAG) {
28a4d940 649 object = deref_tag(object, path, strlen(path));
affeef12
MK
650 if (!object)
651 return 0;
652 }
28a4d940
JS
653 if (object->type != OBJ_COMMIT)
654 return 0;
655 insert_by_date((struct commit *)object, list);
656 return 0;
657}
658
659/*
660 * This interprets names like ':/Initial revision of "git"' by searching
661 * through history and returning the first commit whose message starts
662 * with the given string.
663 *
664 * For future extension, ':/!' is reserved. If you want to match a message
665 * beginning with a '!', you have to repeat the exclamation mark.
666 */
667
668#define ONELINE_SEEN (1u<<20)
1358e7d6 669static int get_sha1_oneline(const char *prefix, unsigned char *sha1)
28a4d940
JS
670{
671 struct commit_list *list = NULL, *backup = NULL, *l;
1358e7d6 672 int retval = -1;
364d3e65 673 char *temp_commit_buffer = NULL;
28a4d940
JS
674
675 if (prefix[0] == '!') {
676 if (prefix[1] != '!')
677 die ("Invalid search pattern: %s", prefix);
678 prefix++;
679 }
28a4d940
JS
680 for_each_ref(handle_one_ref, &list);
681 for (l = list; l; l = l->next)
682 commit_list_insert(l->item, &backup);
ed8ad7e2 683 while (list) {
28a4d940 684 char *p;
1358e7d6 685 struct commit *commit;
364d3e65
JS
686 enum object_type type;
687 unsigned long size;
ed8ad7e2
JM
688
689 commit = pop_most_recent_commit(&list, ONELINE_SEEN);
283cdbcf
MK
690 if (!parse_object(commit->object.sha1))
691 continue;
8e0f7003 692 free(temp_commit_buffer);
364d3e65
JS
693 if (commit->buffer)
694 p = commit->buffer;
695 else {
696 p = read_sha1_file(commit->object.sha1, &type, &size);
697 if (!p)
698 continue;
699 temp_commit_buffer = p;
700 }
701 if (!(p = strstr(p, "\n\n")))
28a4d940
JS
702 continue;
703 if (!prefixcmp(p + 2, prefix)) {
704 hashcpy(sha1, commit->object.sha1);
1358e7d6 705 retval = 0;
28a4d940
JS
706 break;
707 }
708 }
8e0f7003 709 free(temp_commit_buffer);
28a4d940
JS
710 free_commit_list(list);
711 for (l = backup; l; l = l->next)
712 clear_commit_marks(l->item, ONELINE_SEEN);
1358e7d6 713 return retval;
28a4d940
JS
714}
715
ae5a6c36 716struct grab_nth_branch_switch_cbdata {
c2883e62 717 long cnt, alloc;
ae5a6c36
JH
718 struct strbuf *buf;
719};
720
721static int grab_nth_branch_switch(unsigned char *osha1, unsigned char *nsha1,
722 const char *email, unsigned long timestamp, int tz,
723 const char *message, void *cb_data)
724{
725 struct grab_nth_branch_switch_cbdata *cb = cb_data;
a884d0cb
TR
726 const char *match = NULL, *target = NULL;
727 size_t len;
c2883e62 728 int nth;
a884d0cb
TR
729
730 if (!prefixcmp(message, "checkout: moving from ")) {
731 match = message + strlen("checkout: moving from ");
d7c03c1f 732 target = strstr(match, " to ");
ae5a6c36
JH
733 }
734
c829774c 735 if (!match || !target)
ae5a6c36
JH
736 return 0;
737
d7c03c1f 738 len = target - match;
c2883e62
JH
739 nth = cb->cnt++ % cb->alloc;
740 strbuf_reset(&cb->buf[nth]);
741 strbuf_add(&cb->buf[nth], match, len);
ae5a6c36
JH
742 return 0;
743}
744
745/*
746 * This reads "@{-N}" syntax, finds the name of the Nth previous
747 * branch we were on, and places the name of the branch in the given
a884d0cb 748 * buf and returns the number of characters parsed if successful.
ae5a6c36
JH
749 *
750 * If the input is not of the accepted format, it returns a negative
751 * number to signal an error.
a884d0cb
TR
752 *
753 * If the input was ok but there are not N branch switches in the
754 * reflog, it returns 0.
ae5a6c36 755 */
431b1969 756int interpret_branch_name(const char *name, struct strbuf *buf)
ae5a6c36 757{
c2883e62 758 long nth;
39765e59 759 int i, retval;
ae5a6c36 760 struct grab_nth_branch_switch_cbdata cb;
a884d0cb
TR
761 const char *brace;
762 char *num_end;
ae5a6c36
JH
763
764 if (name[0] != '@' || name[1] != '{' || name[2] != '-')
765 return -1;
a884d0cb
TR
766 brace = strchr(name, '}');
767 if (!brace)
768 return -1;
769 nth = strtol(name+3, &num_end, 10);
770 if (num_end != brace)
ae5a6c36 771 return -1;
c2883e62
JH
772 if (nth <= 0)
773 return -1;
774 cb.alloc = nth;
775 cb.buf = xmalloc(nth * sizeof(struct strbuf));
776 for (i = 0; i < nth; i++)
777 strbuf_init(&cb.buf[i], 20);
778 cb.cnt = 0;
39765e59 779 retval = 0;
101d15e0
JH
780 for_each_recent_reflog_ent("HEAD", grab_nth_branch_switch, 40960, &cb);
781 if (cb.cnt < nth) {
782 cb.cnt = 0;
101d15e0
JH
783 for_each_reflog_ent("HEAD", grab_nth_branch_switch, &cb);
784 }
c2883e62 785 if (cb.cnt < nth)
39765e59 786 goto release_return;
c2883e62
JH
787 i = cb.cnt % nth;
788 strbuf_reset(buf);
789 strbuf_add(buf, cb.buf[i].buf, cb.buf[i].len);
39765e59
JH
790 retval = brace-name+1;
791
792release_return:
c2883e62
JH
793 for (i = 0; i < nth; i++)
794 strbuf_release(&cb.buf[i]);
795 free(cb.buf);
a884d0cb 796
39765e59 797 return retval;
ae5a6c36
JH
798}
799
9938af6a
JH
800/*
801 * This is like "get_sha1_basic()", except it allows "sha1 expressions",
802 * notably "xyz^" for "parent of xyz"
803 */
804int get_sha1(const char *name, unsigned char *sha1)
805{
041a7308 806 unsigned unused;
a0cd87a5
MK
807 return get_sha1_with_mode(name, sha1, &unused);
808}
809
810int get_sha1_with_mode(const char *name, unsigned char *sha1, unsigned *mode)
811{
812 int ret, bracket_depth;
73b0e5af
JH
813 int namelen = strlen(name);
814 const char *cp;
5119602a 815
a0cd87a5 816 *mode = S_IFINVALID;
73b0e5af
JH
817 ret = get_sha1_1(name, namelen, sha1);
818 if (!ret)
819 return ret;
820 /* sha1:path --> object name of path in ent sha1
821 * :path -> object name of path in index
822 * :[0-3]:path -> object name of path in index at stage
823 */
824 if (name[0] == ':') {
825 int stage = 0;
826 struct cache_entry *ce;
827 int pos;
28a4d940
JS
828 if (namelen > 2 && name[1] == '/')
829 return get_sha1_oneline(name + 2, sha1);
73b0e5af
JH
830 if (namelen < 3 ||
831 name[2] != ':' ||
832 name[1] < '0' || '3' < name[1])
833 cp = name + 1;
834 else {
835 stage = name[1] - '0';
836 cp = name + 3;
5119602a 837 }
73b0e5af
JH
838 namelen = namelen - (cp - name);
839 if (!active_cache)
840 read_cache();
73b0e5af
JH
841 pos = cache_name_pos(cp, namelen);
842 if (pos < 0)
843 pos = -pos - 1;
844 while (pos < active_nr) {
845 ce = active_cache[pos];
846 if (ce_namelen(ce) != namelen ||
847 memcmp(ce->name, cp, namelen))
848 break;
849 if (ce_stage(ce) == stage) {
e702496e 850 hashcpy(sha1, ce->sha1);
7a51ed66 851 *mode = ce->ce_mode;
73b0e5af
JH
852 return 0;
853 }
e7cef45f 854 pos++;
73b0e5af
JH
855 }
856 return -1;
857 }
cce91a2c
SP
858 for (cp = name, bracket_depth = 0; *cp; cp++) {
859 if (*cp == '{')
860 bracket_depth++;
861 else if (bracket_depth && *cp == '}')
862 bracket_depth--;
863 else if (!bracket_depth && *cp == ':')
864 break;
865 }
866 if (*cp == ':') {
73b0e5af
JH
867 unsigned char tree_sha1[20];
868 if (!get_sha1_1(name, cp-name, tree_sha1))
869 return get_tree_entry(tree_sha1, cp+1, sha1,
a0cd87a5 870 mode);
5119602a
LT
871 }
872 return ret;
9938af6a 873}