sha1_name.c

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