git.oblomov.eu Git - git/blob - 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         unsigned char found_sha1[20];
  75         int found = 0;
  76
  77         prepare_packed_git();
  78         for (p = packed_git; p && found < 2; p = p->next) {
  79                 unsigned num = num_packed_objects(p);
  80                 unsigned first = 0, last = num;
  81                 while (first < last) {
  82                         unsigned mid = (first + last) / 2;
  83                         unsigned char now[20];
  84                         int cmp;
  85
  86                         nth_packed_object_sha1(p, mid, now);
  87                         cmp = hashcmp(match, now);
  88                         if (!cmp) {
  89                                 first = mid;
  90                                 break;
  91                         }
  92                         if (cmp > 0) {
  93                                 first = mid+1;
  94                                 continue;
  95                         }
  96                         last = mid;
  97                 }
  98                 if (first < num) {
  99                         unsigned char now[20], next[20];
 100                         nth_packed_object_sha1(p, first, now);
 101                         if (match_sha(len, match, now)) {
 102                                 if (nth_packed_object_sha1(p, first+1, next) ||
 103                                     !match_sha(len, match, next)) {
 104                                         /* unique within this pack */
 105                                         if (!found) {
 106                                                 hashcpy(found_sha1, now);
 107                                                 found++;
 108                                         }
 109                                         else if (hashcmp(found_sha1, now)) {
 110                                                 found = 2;
 111                                                 break;
 112                                         }
 113                                 }
 114                                 else {
 115                                         /* not even unique within this pack */
 116                                         found = 2;
 117                                         break;
 118                                 }
 119                         }
 120                 }
 121         }
 122         if (found == 1)
 123                 hashcpy(sha1, found_sha1);
 124         return found;
 125 }
 126
 127 #define SHORT_NAME_NOT_FOUND (-1)
 128 #define SHORT_NAME_AMBIGUOUS (-2)
 129
 130 static int find_unique_short_object(int len, char *canonical,
 131                                     unsigned char *res, unsigned char *sha1)
 132 {
 133         int has_unpacked, has_packed;
 134         unsigned char unpacked_sha1[20], packed_sha1[20];
 135
 136         has_unpacked = find_short_object_filename(len, canonical, unpacked_sha1);
 137         has_packed = find_short_packed_object(len, res, packed_sha1);
 138         if (!has_unpacked && !has_packed)
 139                 return SHORT_NAME_NOT_FOUND;
 140         if (1 < has_unpacked || 1 < has_packed)
 141                 return SHORT_NAME_AMBIGUOUS;
 142         if (has_unpacked != has_packed) {
 143                 hashcpy(sha1, (has_packed ? packed_sha1 : unpacked_sha1));
 144                 return 0;
 145         }
 146         /* Both have unique ones -- do they match? */
 147         if (hashcmp(packed_sha1, unpacked_sha1))
 148                 return SHORT_NAME_AMBIGUOUS;
 149         hashcpy(sha1, packed_sha1);
 150         return 0;
 151 }
 152
 153 static int get_short_sha1(const char *name, int len, unsigned char *sha1,
 154                           int quietly)
 155 {
 156         int i, status;
 157         char canonical[40];
 158         unsigned char res[20];
 159
 160         if (len < MINIMUM_ABBREV || len > 40)
 161                 return -1;
 162         hashclr(res);
 163         memset(canonical, 'x', 40);
 164         for (i = 0; i < len ;i++) {
 165                 unsigned char c = name[i];
 166                 unsigned char val;
 167                 if (c >= '0' && c <= '9')
 168                         val = c - '0';
 169                 else if (c >= 'a' && c <= 'f')
 170                         val = c - 'a' + 10;
 171                 else if (c >= 'A' && c <='F') {
 172                         val = c - 'A' + 10;
 173                         c -= 'A' - 'a';
 174                 }
 175                 else
 176                         return -1;
 177                 canonical[i] = c;
 178                 if (!(i & 1))
 179                         val <<= 4;
 180                 res[i >> 1] |= val;
 181         }
 182
 183         status = find_unique_short_object(i, canonical, res, sha1);
 184         if (!quietly && (status == SHORT_NAME_AMBIGUOUS))
 185                 return error("short SHA1 %.*s is ambiguous.", len, canonical);
 186         return status;
 187 }
 188
 189 const char *find_unique_abbrev(const unsigned char *sha1, int len)
 190 {
 191         int status, is_null;
 192         static char hex[41];
 193
 194         is_null = is_null_sha1(sha1);
 195         memcpy(hex, sha1_to_hex(sha1), 40);
 196         if (len == 40 || !len)
 197                 return hex;
 198         while (len < 40) {
 199                 unsigned char sha1_ret[20];
 200                 status = get_short_sha1(hex, len, sha1_ret, 1);
 201                 if (!status ||
 202                     (is_null && status != SHORT_NAME_AMBIGUOUS)) {
 203                         hex[len] = 0;
 204                         return hex;
 205                 }
 206                 if (status != SHORT_NAME_AMBIGUOUS)
 207                         return NULL;
 208                 len++;
 209         }
 210         return NULL;
 211 }
 212
 213 static int ambiguous_path(const char *path, int len)
 214 {
 215         int slash = 1;
 216         int cnt;
 217
 218         for (cnt = 0; cnt < len; cnt++) {
 219                 switch (*path++) {
 220                 case '\0':
 221                         break;
 222                 case '/':
 223                         if (slash)
 224                                 break;
 225                         slash = 1;
 226                         continue;
 227                 case '.':
 228                         continue;
 229                 default:
 230                         slash = 0;
 231                         continue;
 232                 }
 233                 break;
 234         }
 235         return slash;
 236 }
 237
 238 int dwim_ref(const char *str, int len, unsigned char *sha1, char **ref)
 239 {
 240         static const char *fmt[] = {
 241                 "%.*s",
 242                 "refs/%.*s",
 243                 "refs/tags/%.*s",
 244                 "refs/heads/%.*s",
 245                 "refs/remotes/%.*s",
 246                 "refs/remotes/%.*s/HEAD",
 247                 NULL
 248         };
 249         const char **p, *r;
 250         int refs_found = 0;
 251
 252         *ref = NULL;
 253         for (p = fmt; *p; p++) {
 254                 unsigned char sha1_from_ref[20];
 255                 unsigned char *this_result;
 256
 257                 this_result = refs_found ? sha1_from_ref : sha1;
 258                 r = resolve_ref(mkpath(*p, len, str), this_result, 1, NULL);
 259                 if (r) {
 260                         if (!refs_found++)
 261                                 *ref = xstrdup(r);
 262                         if (!warn_ambiguous_refs)
 263                                 break;
 264                 }
 265         }
 266         return refs_found;
 267 }
 268
 269 static int get_sha1_basic(const char *str, int len, unsigned char *sha1)
 270 {
 271         static const char *warning = "warning: refname '%.*s' is ambiguous.\n";
 272         char *real_ref = NULL;
 273         int refs_found = 0;
 274         int at, reflog_len;
 275
 276         if (len == 40 && !get_sha1_hex(str, sha1))
 277                 return 0;
 278
 279         /* basic@{time or number} format to query ref-log */
 280         reflog_len = at = 0;
 281         if (str[len-1] == '}') {
 282                 for (at = 1; at < len - 1; at++) {
 283                         if (str[at] == '@' && str[at+1] == '{') {
 284                                 reflog_len = (len-1) - (at+2);
 285                                 len = at;
 286                                 break;
 287                         }
 288                 }
 289         }
 290
 291         /* Accept only unambiguous ref paths. */
 292         if (ambiguous_path(str, len))
 293                 return -1;
 294
 295         refs_found = dwim_ref(str, len, sha1, &real_ref);
 296
 297         if (!refs_found)
 298                 return -1;
 299
 300         if (warn_ambiguous_refs && refs_found > 1)
 301                 fprintf(stderr, warning, len, str);
 302
 303         if (reflog_len) {
 304                 int nth, i;
 305                 unsigned long at_time;
 306                 unsigned long co_time;
 307                 int co_tz, co_cnt;
 308
 309                 /*
 310                  * We'll have an independent reflog for "HEAD" eventually
 311                  * which won't be a synonym for the current branch reflog.
 312                  * In the mean time prevent people from getting used to
 313                  * such a synonym until the work is completed.
 314                  */
 315                 if (!strncmp("HEAD", str, len) &&
 316                     !strncmp(real_ref, "refs/", 5)) {
 317                         error("reflog for HEAD has not been implemented yet\n"
 318                               "Maybe you could try %s%s instead.",
 319                               strchr(real_ref+5, '/')+1, str + len);
 320                         exit(-1);
 321                 }
 322
 323                 /* Is it asking for N-th entry, or approxidate? */
 324                 for (i = nth = 0; 0 <= nth && i < reflog_len; i++) {
 325                         char ch = str[at+2+i];
 326                         if ('0' <= ch && ch <= '9')
 327                                 nth = nth * 10 + ch - '0';
 328                         else
 329                                 nth = -1;
 330                 }
 331                 if (0 <= nth)
 332                         at_time = 0;
 333                 else
 334                         at_time = approxidate(str + at + 2);
 335                 if (read_ref_at(real_ref, at_time, nth, sha1, NULL,
 336                                 &co_time, &co_tz, &co_cnt)) {
 337                         if (at_time)
 338                                 fprintf(stderr,
 339                                         "warning: Log for '%.*s' only goes "
 340                                         "back to %s.\n", len, str,
 341                                         show_rfc2822_date(co_time, co_tz));
 342                         else
 343                                 fprintf(stderr,
 344                                         "warning: Log for '%.*s' only has "
 345                                         "%d entries.\n", len, str, co_cnt);
 346                 }
 347         }
 348
 349         free(real_ref);
 350         return 0;
 351 }
 352
 353 static int get_sha1_1(const char *name, int len, unsigned char *sha1);
 354
 355 static int get_parent(const char *name, int len,
 356                       unsigned char *result, int idx)
 357 {
 358         unsigned char sha1[20];
 359         int ret = get_sha1_1(name, len, sha1);
 360         struct commit *commit;
 361         struct commit_list *p;
 362
 363         if (ret)
 364                 return ret;
 365         commit = lookup_commit_reference(sha1);
 366         if (!commit)
 367                 return -1;
 368         if (parse_commit(commit))
 369                 return -1;
 370         if (!idx) {
 371                 hashcpy(result, commit->object.sha1);
 372                 return 0;
 373         }
 374         p = commit->parents;
 375         while (p) {
 376                 if (!--idx) {
 377                         hashcpy(result, p->item->object.sha1);
 378                         return 0;
 379                 }
 380                 p = p->next;
 381         }
 382         return -1;
 383 }
 384
 385 static int get_nth_ancestor(const char *name, int len,
 386                             unsigned char *result, int generation)
 387 {
 388         unsigned char sha1[20];
 389         int ret = get_sha1_1(name, len, sha1);
 390         if (ret)
 391                 return ret;
 392
 393         while (generation--) {
 394                 struct commit *commit = lookup_commit_reference(sha1);
 395
 396                 if (!commit || parse_commit(commit) || !commit->parents)
 397                         return -1;
 398                 hashcpy(sha1, commit->parents->item->object.sha1);
 399         }
 400         hashcpy(result, sha1);
 401         return 0;
 402 }
 403
 404 static int peel_onion(const char *name, int len, unsigned char *sha1)
 405 {
 406         unsigned char outer[20];
 407         const char *sp;
 408         unsigned int expected_type = 0;
 409         struct object *o;
 410
 411         /*
 412          * "ref^{type}" dereferences ref repeatedly until you cannot
 413          * dereference anymore, or you get an object of given type,
 414          * whichever comes first.  "ref^{}" means just dereference
 415          * tags until you get a non-tag.  "ref^0" is a shorthand for
 416          * "ref^{commit}".  "commit^{tree}" could be used to find the
 417          * top-level tree of the given commit.
 418          */
 419         if (len < 4 || name[len-1] != '}')
 420                 return -1;
 421
 422         for (sp = name + len - 1; name <= sp; sp--) {
 423                 int ch = *sp;
 424                 if (ch == '{' && name < sp && sp[-1] == '^')
 425                         break;
 426         }
 427         if (sp <= name)
 428                 return -1;
 429
 430         sp++; /* beginning of type name, or closing brace for empty */
 431         if (!strncmp(commit_type, sp, 6) && sp[6] == '}')
 432                 expected_type = OBJ_COMMIT;
 433         else if (!strncmp(tree_type, sp, 4) && sp[4] == '}')
 434                 expected_type = OBJ_TREE;
 435         else if (!strncmp(blob_type, sp, 4) && sp[4] == '}')
 436                 expected_type = OBJ_BLOB;
 437         else if (sp[0] == '}')
 438                 expected_type = OBJ_NONE;
 439         else
 440                 return -1;
 441
 442         if (get_sha1_1(name, sp - name - 2, outer))
 443                 return -1;
 444
 445         o = parse_object(outer);
 446         if (!o)
 447                 return -1;
 448         if (!expected_type) {
 449                 o = deref_tag(o, name, sp - name - 2);
 450                 if (!o || (!o->parsed && !parse_object(o->sha1)))
 451                         return -1;
 452                 hashcpy(sha1, o->sha1);
 453         }
 454         else {
 455                 /* At this point, the syntax look correct, so
 456                  * if we do not get the needed object, we should
 457                  * barf.
 458                  */
 459
 460                 while (1) {
 461                         if (!o || (!o->parsed && !parse_object(o->sha1)))
 462                                 return -1;
 463                         if (o->type == expected_type) {
 464                                 hashcpy(sha1, o->sha1);
 465                                 return 0;
 466                         }
 467                         if (o->type == OBJ_TAG)
 468                                 o = ((struct tag*) o)->tagged;
 469                         else if (o->type == OBJ_COMMIT)
 470                                 o = &(((struct commit *) o)->tree->object);
 471                         else
 472                                 return error("%.*s: expected %s type, but the object dereferences to %s type",
 473                                              len, name, typename(expected_type),
 474                                              typename(o->type));
 475                         if (!o->parsed)
 476                                 parse_object(o->sha1);
 477                 }
 478         }
 479         return 0;
 480 }
 481
 482 static int get_describe_name(const char *name, int len, unsigned char *sha1)
 483 {
 484         const char *cp;
 485
 486         for (cp = name + len - 1; name + 2 <= cp; cp--) {
 487                 char ch = *cp;
 488                 if (hexval(ch) & ~0377) {
 489                         /* We must be looking at g in "SOMETHING-g"
 490                          * for it to be describe output.
 491                          */
 492                         if (ch == 'g' && cp[-1] == '-') {
 493                                 cp++;
 494                                 len -= cp - name;
 495                                 return get_short_sha1(cp, len, sha1, 1);
 496                         }
 497                 }
 498         }
 499         return -1;
 500 }
 501
 502 static int get_sha1_1(const char *name, int len, unsigned char *sha1)
 503 {
 504         int ret, has_suffix;
 505         const char *cp;
 506
 507         /* "name~3" is "name^^^",
 508          * "name~" and "name~0" are name -- not "name^0"!
 509          * "name^" is not "name^0"; it is "name^1".
 510          */
 511         has_suffix = 0;
 512         for (cp = name + len - 1; name <= cp; cp--) {
 513                 int ch = *cp;
 514                 if ('0' <= ch && ch <= '9')
 515                         continue;
 516                 if (ch == '~' || ch == '^')
 517                         has_suffix = ch;
 518                 break;
 519         }
 520
 521         if (has_suffix) {
 522                 int num = 0;
 523                 int len1 = cp - name;
 524                 cp++;
 525                 while (cp < name + len)
 526                         num = num * 10 + *cp++ - '0';
 527                 if (has_suffix == '^') {
 528                         if (!num && len1 == len - 1)
 529                                 num = 1;
 530                         return get_parent(name, len1, sha1, num);
 531                 }
 532                 /* else if (has_suffix == '~') -- goes without saying */
 533                 return get_nth_ancestor(name, len1, sha1, num);
 534         }
 535
 536         ret = peel_onion(name, len, sha1);
 537         if (!ret)
 538                 return 0;
 539
 540         ret = get_sha1_basic(name, len, sha1);
 541         if (!ret)
 542                 return 0;
 543
 544         /* It could be describe output that is "SOMETHING-gXXXX" */
 545         ret = get_describe_name(name, len, sha1);
 546         if (!ret)
 547                 return 0;
 548
 549         return get_short_sha1(name, len, sha1, 0);
 550 }
 551
 552 /*
 553  * This is like "get_sha1_basic()", except it allows "sha1 expressions",
 554  * notably "xyz^" for "parent of xyz"
 555  */
 556 int get_sha1(const char *name, unsigned char *sha1)
 557 {
 558         int ret, bracket_depth;
 559         unsigned unused;
 560         int namelen = strlen(name);
 561         const char *cp;
 562
 563         prepare_alt_odb();
 564         ret = get_sha1_1(name, namelen, sha1);
 565         if (!ret)
 566                 return ret;
 567         /* sha1:path --> object name of path in ent sha1
 568          * :path -> object name of path in index
 569          * :[0-3]:path -> object name of path in index at stage
 570          */
 571         if (name[0] == ':') {
 572                 int stage = 0;
 573                 struct cache_entry *ce;
 574                 int pos;
 575                 if (namelen < 3 ||
 576                     name[2] != ':' ||
 577                     name[1] < '0' || '3' < name[1])
 578                         cp = name + 1;
 579                 else {
 580                         stage = name[1] - '0';
 581                         cp = name + 3;
 582                 }
 583                 namelen = namelen - (cp - name);
 584                 if (!active_cache)
 585                         read_cache();
 586                 if (active_nr < 0)
 587                         return -1;
 588                 pos = cache_name_pos(cp, namelen);
 589                 if (pos < 0)
 590                         pos = -pos - 1;
 591                 while (pos < active_nr) {
 592                         ce = active_cache[pos];
 593                         if (ce_namelen(ce) != namelen ||
 594                             memcmp(ce->name, cp, namelen))
 595                                 break;
 596                         if (ce_stage(ce) == stage) {
 597                                 hashcpy(sha1, ce->sha1);
 598                                 return 0;
 599                         }
 600                         pos++;
 601                 }
 602                 return -1;
 603         }
 604         for (cp = name, bracket_depth = 0; *cp; cp++) {
 605                 if (*cp == '{')
 606                         bracket_depth++;
 607                 else if (bracket_depth && *cp == '}')
 608                         bracket_depth--;
 609                 else if (!bracket_depth && *cp == ':')
 610                         break;
 611         }
 612         if (*cp == ':') {
 613                 unsigned char tree_sha1[20];
 614                 if (!get_sha1_1(name, cp-name, tree_sha1))
 615                         return get_tree_entry(tree_sha1, cp+1, sha1,
 616                                               &unused);
 617         }
 618         return ret;
 619 }