]>
Commit | Line | Data |
---|---|---|
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" |
28fb8438 | 8 | #include "remote.h" |
9938af6a | 9 | |
32574b68 NTND |
10 | static int get_sha1_oneline(const char *, unsigned char *, struct commit_list *); |
11 | ||
a78fafe7 JH |
12 | typedef int (*disambiguate_hint_fn)(const unsigned char *, void *); |
13 | ||
14 | struct disambiguate_state { | |
15 | disambiguate_hint_fn fn; | |
16 | void *cb_data; | |
17 | unsigned char candidate[20]; | |
18 | unsigned candidate_exists:1; | |
19 | unsigned candidate_checked:1; | |
20 | unsigned candidate_ok:1; | |
21 | unsigned disambiguate_fn_used:1; | |
22 | unsigned ambiguous:1; | |
957d7406 | 23 | unsigned always_call_fn:1; |
a78fafe7 JH |
24 | }; |
25 | ||
26 | static void update_candidates(struct disambiguate_state *ds, const unsigned char *current) | |
27 | { | |
957d7406 JH |
28 | if (ds->always_call_fn) { |
29 | ds->ambiguous = ds->fn(current, ds->cb_data) ? 1 : 0; | |
30 | return; | |
31 | } | |
a78fafe7 JH |
32 | if (!ds->candidate_exists) { |
33 | /* this is the first candidate */ | |
34 | hashcpy(ds->candidate, current); | |
35 | ds->candidate_exists = 1; | |
36 | return; | |
37 | } else if (!hashcmp(ds->candidate, current)) { | |
38 | /* the same as what we already have seen */ | |
39 | return; | |
40 | } | |
41 | ||
42 | if (!ds->fn) { | |
43 | /* cannot disambiguate between ds->candidate and current */ | |
44 | ds->ambiguous = 1; | |
45 | return; | |
46 | } | |
47 | ||
48 | if (!ds->candidate_checked) { | |
49 | ds->candidate_ok = ds->fn(ds->candidate, ds->cb_data); | |
50 | ds->disambiguate_fn_used = 1; | |
51 | ds->candidate_checked = 1; | |
52 | } | |
53 | ||
54 | if (!ds->candidate_ok) { | |
55 | /* discard the candidate; we know it does not satisify fn */ | |
56 | hashcpy(ds->candidate, current); | |
57 | ds->candidate_checked = 0; | |
58 | return; | |
59 | } | |
60 | ||
61 | /* if we reach this point, we know ds->candidate satisfies fn */ | |
62 | if (ds->fn(current, ds->cb_data)) { | |
63 | /* | |
64 | * if both current and candidate satisfy fn, we cannot | |
65 | * disambiguate. | |
66 | */ | |
67 | ds->candidate_ok = 0; | |
68 | ds->ambiguous = 1; | |
69 | } | |
70 | ||
71 | /* otherwise, current can be discarded and candidate is still good */ | |
72 | } | |
73 | ||
74 | static void find_short_object_filename(int len, const char *hex_pfx, struct disambiguate_state *ds) | |
9938af6a | 75 | { |
99a19b43 | 76 | struct alternate_object_database *alt; |
9938af6a | 77 | char hex[40]; |
99a19b43 JH |
78 | static struct alternate_object_database *fakeent; |
79 | ||
80 | if (!fakeent) { | |
274ac009 JH |
81 | /* |
82 | * Create a "fake" alternate object database that | |
83 | * points to our own object database, to make it | |
84 | * easier to get a temporary working space in | |
85 | * alt->name/alt->base while iterating over the | |
86 | * object databases including our own. | |
87 | */ | |
99a19b43 JH |
88 | const char *objdir = get_object_directory(); |
89 | int objdir_len = strlen(objdir); | |
90 | int entlen = objdir_len + 43; | |
91 | fakeent = xmalloc(sizeof(*fakeent) + entlen); | |
92 | memcpy(fakeent->base, objdir, objdir_len); | |
93 | fakeent->name = fakeent->base + objdir_len + 1; | |
94 | fakeent->name[-1] = '/'; | |
95 | } | |
96 | fakeent->next = alt_odb_list; | |
9938af6a | 97 | |
1703f9aa | 98 | sprintf(hex, "%.2s", hex_pfx); |
a78fafe7 | 99 | for (alt = fakeent; alt && !ds->ambiguous; alt = alt->next) { |
9938af6a | 100 | struct dirent *de; |
99a19b43 | 101 | DIR *dir; |
1703f9aa | 102 | sprintf(alt->name, "%.2s/", hex_pfx); |
99a19b43 JH |
103 | dir = opendir(alt->base); |
104 | if (!dir) | |
105 | continue; | |
a78fafe7 JH |
106 | |
107 | while (!ds->ambiguous && (de = readdir(dir)) != NULL) { | |
108 | unsigned char sha1[20]; | |
109 | ||
9938af6a JH |
110 | if (strlen(de->d_name) != 38) |
111 | continue; | |
1703f9aa | 112 | if (memcmp(de->d_name, hex_pfx + 2, len - 2)) |
9938af6a | 113 | continue; |
a78fafe7 JH |
114 | memcpy(hex + 2, de->d_name, 38); |
115 | if (!get_sha1_hex(hex, sha1)) | |
116 | update_candidates(ds, sha1); | |
9938af6a JH |
117 | } |
118 | closedir(dir); | |
119 | } | |
9938af6a JH |
120 | } |
121 | ||
122 | static int match_sha(unsigned len, const unsigned char *a, const unsigned char *b) | |
123 | { | |
124 | do { | |
125 | if (*a != *b) | |
126 | return 0; | |
127 | a++; | |
128 | b++; | |
129 | len -= 2; | |
130 | } while (len > 1); | |
131 | if (len) | |
132 | if ((*a ^ *b) & 0xf0) | |
133 | return 0; | |
134 | return 1; | |
135 | } | |
136 | ||
a78fafe7 | 137 | static void unique_in_pack(int len, |
1703f9aa | 138 | const unsigned char *bin_pfx, |
a78fafe7 JH |
139 | struct packed_git *p, |
140 | struct disambiguate_state *ds) | |
9938af6a | 141 | { |
f703e6ea JH |
142 | uint32_t num, last, i, first = 0; |
143 | const unsigned char *current = NULL; | |
144 | ||
145 | open_pack_index(p); | |
146 | num = p->num_objects; | |
147 | last = num; | |
148 | while (first < last) { | |
149 | uint32_t mid = (first + last) / 2; | |
150 | const unsigned char *current; | |
151 | int cmp; | |
152 | ||
153 | current = nth_packed_object_sha1(p, mid); | |
1703f9aa | 154 | cmp = hashcmp(bin_pfx, current); |
f703e6ea JH |
155 | if (!cmp) { |
156 | first = mid; | |
157 | break; | |
9938af6a | 158 | } |
f703e6ea JH |
159 | if (cmp > 0) { |
160 | first = mid+1; | |
161 | continue; | |
9938af6a | 162 | } |
f703e6ea JH |
163 | last = mid; |
164 | } | |
165 | ||
166 | /* | |
167 | * At this point, "first" is the location of the lowest object | |
1703f9aa | 168 | * with an object name that could match "bin_pfx". See if we have |
f703e6ea JH |
169 | * 0, 1 or more objects that actually match(es). |
170 | */ | |
a78fafe7 JH |
171 | for (i = first; i < num && !ds->ambiguous; i++) { |
172 | current = nth_packed_object_sha1(p, i); | |
1703f9aa | 173 | if (!match_sha(len, bin_pfx, current)) |
f703e6ea | 174 | break; |
a78fafe7 | 175 | update_candidates(ds, current); |
9938af6a | 176 | } |
f703e6ea JH |
177 | } |
178 | ||
a78fafe7 JH |
179 | static void find_short_packed_object(int len, const unsigned char *bin_pfx, |
180 | struct disambiguate_state *ds) | |
9938af6a JH |
181 | { |
182 | struct packed_git *p; | |
183 | ||
184 | prepare_packed_git(); | |
a78fafe7 JH |
185 | for (p = packed_git; p && !ds->ambiguous; p = p->next) |
186 | unique_in_pack(len, bin_pfx, p, ds); | |
99a19b43 JH |
187 | } |
188 | ||
013f276e JH |
189 | #define SHORT_NAME_NOT_FOUND (-1) |
190 | #define SHORT_NAME_AMBIGUOUS (-2) | |
191 | ||
a78fafe7 JH |
192 | static int finish_object_disambiguation(struct disambiguate_state *ds, |
193 | unsigned char *sha1) | |
99a19b43 | 194 | { |
a78fafe7 JH |
195 | if (ds->ambiguous) |
196 | return SHORT_NAME_AMBIGUOUS; | |
99a19b43 | 197 | |
a78fafe7 | 198 | if (!ds->candidate_exists) |
013f276e | 199 | return SHORT_NAME_NOT_FOUND; |
a78fafe7 JH |
200 | |
201 | if (!ds->candidate_checked) | |
202 | /* | |
203 | * If this is the only candidate, there is no point | |
204 | * calling the disambiguation hint callback. | |
205 | * | |
206 | * On the other hand, if the current candidate | |
207 | * replaced an earlier candidate that did _not_ pass | |
208 | * the disambiguation hint callback, then we do have | |
209 | * more than one objects that match the short name | |
210 | * given, so we should make sure this one matches; | |
211 | * otherwise, if we discovered this one and the one | |
212 | * that we previously discarded in the reverse order, | |
213 | * we would end up showing different results in the | |
214 | * same repository! | |
215 | */ | |
216 | ds->candidate_ok = (!ds->disambiguate_fn_used || | |
217 | ds->fn(ds->candidate, ds->cb_data)); | |
218 | ||
219 | if (!ds->candidate_ok) | |
013f276e | 220 | return SHORT_NAME_AMBIGUOUS; |
a78fafe7 JH |
221 | |
222 | hashcpy(sha1, ds->candidate); | |
9938af6a JH |
223 | return 0; |
224 | } | |
225 | ||
aa1dec9e JH |
226 | static int disambiguate_commit_only(const unsigned char *sha1, void *cb_data_unused) |
227 | { | |
228 | int kind = sha1_object_info(sha1, NULL); | |
229 | return kind == OBJ_COMMIT; | |
230 | } | |
231 | ||
e2643617 JH |
232 | static int disambiguate_committish_only(const unsigned char *sha1, void *cb_data_unused) |
233 | { | |
234 | struct object *obj; | |
235 | int kind; | |
236 | ||
237 | kind = sha1_object_info(sha1, NULL); | |
238 | if (kind == OBJ_COMMIT) | |
239 | return 1; | |
240 | if (kind != OBJ_TAG) | |
99a19b43 | 241 | return 0; |
e2643617 JH |
242 | |
243 | /* We need to do this the hard way... */ | |
244 | obj = deref_tag(lookup_object(sha1), NULL, 0); | |
245 | if (obj && obj->type == OBJ_COMMIT) | |
246 | return 1; | |
9938af6a JH |
247 | return 0; |
248 | } | |
249 | ||
daba53ae | 250 | static int disambiguate_tree_only(const unsigned char *sha1, void *cb_data_unused) |
9938af6a | 251 | { |
daba53ae JH |
252 | int kind = sha1_object_info(sha1, NULL); |
253 | return kind == OBJ_TREE; | |
254 | } | |
9938af6a | 255 | |
daba53ae JH |
256 | static int disambiguate_treeish_only(const unsigned char *sha1, void *cb_data_unused) |
257 | { | |
258 | struct object *obj; | |
259 | int kind; | |
260 | ||
261 | kind = sha1_object_info(sha1, NULL); | |
262 | if (kind == OBJ_TREE || kind == OBJ_COMMIT) | |
263 | return 1; | |
264 | if (kind != OBJ_TAG) | |
265 | return 0; | |
266 | ||
267 | /* We need to do this the hard way... */ | |
268 | obj = deref_tag(lookup_object(sha1), NULL, 0); | |
269 | if (obj && (obj->type == OBJ_TREE || obj->type == OBJ_COMMIT)) | |
270 | return 1; | |
271 | return 0; | |
272 | } | |
273 | ||
274 | static int disambiguate_blob_only(const unsigned char *sha1, void *cb_data_unused) | |
275 | { | |
276 | int kind = sha1_object_info(sha1, NULL); | |
277 | return kind == OBJ_BLOB; | |
278 | } | |
279 | ||
957d7406 JH |
280 | static int prepare_prefixes(const char *name, int len, |
281 | unsigned char *bin_pfx, | |
282 | char *hex_pfx) | |
9938af6a | 283 | { |
957d7406 | 284 | int i; |
9938af6a | 285 | |
1703f9aa JH |
286 | hashclr(bin_pfx); |
287 | memset(hex_pfx, 'x', 40); | |
af61c6e0 | 288 | for (i = 0; i < len ;i++) { |
9938af6a JH |
289 | unsigned char c = name[i]; |
290 | unsigned char val; | |
9938af6a JH |
291 | if (c >= '0' && c <= '9') |
292 | val = c - '0'; | |
293 | else if (c >= 'a' && c <= 'f') | |
294 | val = c - 'a' + 10; | |
295 | else if (c >= 'A' && c <='F') { | |
296 | val = c - 'A' + 10; | |
297 | c -= 'A' - 'a'; | |
298 | } | |
299 | else | |
300 | return -1; | |
1703f9aa | 301 | hex_pfx[i] = c; |
9938af6a JH |
302 | if (!(i & 1)) |
303 | val <<= 4; | |
1703f9aa | 304 | bin_pfx[i >> 1] |= val; |
9938af6a | 305 | } |
957d7406 JH |
306 | return 0; |
307 | } | |
308 | ||
309 | static int get_short_sha1(const char *name, int len, unsigned char *sha1, | |
310 | unsigned flags) | |
311 | { | |
312 | int status; | |
313 | char hex_pfx[40]; | |
314 | unsigned char bin_pfx[20]; | |
315 | struct disambiguate_state ds; | |
316 | int quietly = !!(flags & GET_SHA1_QUIETLY); | |
317 | ||
318 | if (len < MINIMUM_ABBREV || len > 40) | |
319 | return -1; | |
320 | if (prepare_prefixes(name, len, bin_pfx, hex_pfx) < 0) | |
321 | return -1; | |
99a19b43 | 322 | |
a78fafe7 JH |
323 | prepare_alt_odb(); |
324 | ||
325 | memset(&ds, 0, sizeof(ds)); | |
aa1dec9e JH |
326 | if (flags & GET_SHA1_COMMIT) |
327 | ds.fn = disambiguate_commit_only; | |
e2643617 JH |
328 | else if (flags & GET_SHA1_COMMITTISH) |
329 | ds.fn = disambiguate_committish_only; | |
daba53ae JH |
330 | else if (flags & GET_SHA1_TREE) |
331 | ds.fn = disambiguate_tree_only; | |
332 | else if (flags & GET_SHA1_TREEISH) | |
333 | ds.fn = disambiguate_treeish_only; | |
334 | else if (flags & GET_SHA1_BLOB) | |
335 | ds.fn = disambiguate_blob_only; | |
aa1dec9e | 336 | |
a78fafe7 JH |
337 | find_short_object_filename(len, hex_pfx, &ds); |
338 | find_short_packed_object(len, bin_pfx, &ds); | |
339 | status = finish_object_disambiguation(&ds, sha1); | |
99a19b43 | 340 | |
013f276e | 341 | if (!quietly && (status == SHORT_NAME_AMBIGUOUS)) |
1703f9aa | 342 | return error("short SHA1 %.*s is ambiguous.", len, hex_pfx); |
013f276e JH |
343 | return status; |
344 | } | |
345 | ||
957d7406 JH |
346 | |
347 | int for_each_abbrev(const char *prefix, each_abbrev_fn fn, void *cb_data) | |
348 | { | |
349 | char hex_pfx[40]; | |
350 | unsigned char bin_pfx[20]; | |
351 | struct disambiguate_state ds; | |
352 | int len = strlen(prefix); | |
353 | ||
354 | if (len < MINIMUM_ABBREV || len > 40) | |
355 | return -1; | |
356 | if (prepare_prefixes(prefix, len, bin_pfx, hex_pfx) < 0) | |
357 | return -1; | |
358 | ||
359 | prepare_alt_odb(); | |
360 | ||
361 | memset(&ds, 0, sizeof(ds)); | |
362 | ds.always_call_fn = 1; | |
363 | ds.cb_data = cb_data; | |
364 | ds.fn = fn; | |
365 | ||
366 | find_short_object_filename(len, hex_pfx, &ds); | |
367 | find_short_packed_object(len, bin_pfx, &ds); | |
368 | return ds.ambiguous; | |
369 | } | |
370 | ||
013f276e JH |
371 | const char *find_unique_abbrev(const unsigned char *sha1, int len) |
372 | { | |
b66fde9a | 373 | int status, exists; |
013f276e | 374 | static char hex[41]; |
47dd0d59 | 375 | |
b66fde9a | 376 | exists = has_sha1_file(sha1); |
013f276e | 377 | memcpy(hex, sha1_to_hex(sha1), 40); |
02c5cba2 | 378 | if (len == 40 || !len) |
47dd0d59 | 379 | return hex; |
013f276e JH |
380 | while (len < 40) { |
381 | unsigned char sha1_ret[20]; | |
37c00e55 | 382 | status = get_short_sha1(hex, len, sha1_ret, GET_SHA1_QUIETLY); |
b66fde9a JH |
383 | if (exists |
384 | ? !status | |
385 | : status == SHORT_NAME_NOT_FOUND) { | |
ea2c69ed | 386 | hex[len] = 0; |
013f276e JH |
387 | return hex; |
388 | } | |
013f276e JH |
389 | len++; |
390 | } | |
b66fde9a | 391 | return hex; |
9938af6a JH |
392 | } |
393 | ||
6677c466 | 394 | static int ambiguous_path(const char *path, int len) |
af13cdf2 LT |
395 | { |
396 | int slash = 1; | |
6677c466 | 397 | int cnt; |
af13cdf2 | 398 | |
6677c466 | 399 | for (cnt = 0; cnt < len; cnt++) { |
af13cdf2 LT |
400 | switch (*path++) { |
401 | case '\0': | |
402 | break; | |
403 | case '/': | |
404 | if (slash) | |
405 | break; | |
406 | slash = 1; | |
407 | continue; | |
408 | case '.': | |
409 | continue; | |
410 | default: | |
411 | slash = 0; | |
412 | continue; | |
413 | } | |
c054d64e | 414 | break; |
af13cdf2 | 415 | } |
6677c466 | 416 | return slash; |
af13cdf2 LT |
417 | } |
418 | ||
ae0ba8e2 JH |
419 | static inline int upstream_mark(const char *string, int len) |
420 | { | |
421 | const char *suffix[] = { "@{upstream}", "@{u}" }; | |
422 | int i; | |
423 | ||
424 | for (i = 0; i < ARRAY_SIZE(suffix); i++) { | |
425 | int suffix_len = strlen(suffix[i]); | |
426 | if (suffix_len <= len | |
427 | && !memcmp(string, suffix[i], suffix_len)) | |
428 | return suffix_len; | |
429 | } | |
430 | return 0; | |
431 | } | |
432 | ||
e48ba200 | 433 | static int get_sha1_1(const char *name, int len, unsigned char *sha1, unsigned lookup_flags); |
d18ba221 | 434 | |
e86eb666 JH |
435 | static int get_sha1_basic(const char *str, int len, unsigned char *sha1) |
436 | { | |
eedce784 | 437 | static const char *warn_msg = "refname '%.*s' is ambiguous."; |
ed378ec7 | 438 | char *real_ref = NULL; |
ab2a1a32 JH |
439 | int refs_found = 0; |
440 | int at, reflog_len; | |
9938af6a | 441 | |
3c3852e3 | 442 | if (len == 40 && !get_sha1_hex(str, sha1)) |
9938af6a JH |
443 | return 0; |
444 | ||
d18ba221 | 445 | /* basic@{time or number or -number} format to query ref-log */ |
694500ed | 446 | reflog_len = at = 0; |
f265458f | 447 | if (len && str[len-1] == '}') { |
aa9c55b6 | 448 | for (at = len-2; at >= 0; at--) { |
ab2a1a32 | 449 | if (str[at] == '@' && str[at+1] == '{') { |
ae0ba8e2 | 450 | if (!upstream_mark(str + at, len - at)) { |
28fb8438 JS |
451 | reflog_len = (len-1) - (at+2); |
452 | len = at; | |
453 | } | |
ab2a1a32 JH |
454 | break; |
455 | } | |
d556fae2 SP |
456 | } |
457 | } | |
458 | ||
af13cdf2 | 459 | /* Accept only unambiguous ref paths. */ |
11cf8801 | 460 | if (len && ambiguous_path(str, len)) |
af13cdf2 LT |
461 | return -1; |
462 | ||
11cf8801 | 463 | if (!len && reflog_len) { |
d18ba221 TR |
464 | struct strbuf buf = STRBUF_INIT; |
465 | int ret; | |
466 | /* try the @{-N} syntax for n-th checkout */ | |
431b1969 | 467 | ret = interpret_branch_name(str+at, &buf); |
d18ba221 TR |
468 | if (ret > 0) { |
469 | /* substitute this branch name and restart */ | |
e48ba200 | 470 | return get_sha1_1(buf.buf, buf.len, sha1, 0); |
d18ba221 TR |
471 | } else if (ret == 0) { |
472 | return -1; | |
473 | } | |
11cf8801 NP |
474 | /* allow "@{...}" to mean the current branch reflog */ |
475 | refs_found = dwim_ref("HEAD", 4, sha1, &real_ref); | |
f2eba66d NP |
476 | } else if (reflog_len) |
477 | refs_found = dwim_log(str, len, sha1, &real_ref); | |
478 | else | |
11cf8801 | 479 | refs_found = dwim_ref(str, len, sha1, &real_ref); |
d556fae2 SP |
480 | |
481 | if (!refs_found) | |
482 | return -1; | |
483 | ||
484 | if (warn_ambiguous_refs && refs_found > 1) | |
eedce784 | 485 | warning(warn_msg, len, str); |
d556fae2 | 486 | |
ab2a1a32 | 487 | if (reflog_len) { |
ab2a1a32 JH |
488 | int nth, i; |
489 | unsigned long at_time; | |
16d7cc90 JH |
490 | unsigned long co_time; |
491 | int co_tz, co_cnt; | |
492 | ||
12a258c0 JK |
493 | /* a @{-N} placed anywhere except the start is an error */ |
494 | if (str[at+2] == '-') | |
495 | return -1; | |
496 | ||
fe558516 | 497 | /* Is it asking for N-th entry, or approxidate? */ |
ab2a1a32 JH |
498 | for (i = nth = 0; 0 <= nth && i < reflog_len; i++) { |
499 | char ch = str[at+2+i]; | |
500 | if ('0' <= ch && ch <= '9') | |
501 | nth = nth * 10 + ch - '0'; | |
502 | else | |
503 | nth = -1; | |
504 | } | |
ea360dd0 SP |
505 | if (100000000 <= nth) { |
506 | at_time = nth; | |
507 | nth = -1; | |
508 | } else if (0 <= nth) | |
ab2a1a32 | 509 | at_time = 0; |
861f00e3 | 510 | else { |
93cfa7c7 | 511 | int errors = 0; |
861f00e3 | 512 | char *tmp = xstrndup(str + at + 2, reflog_len); |
93cfa7c7 | 513 | at_time = approxidate_careful(tmp, &errors); |
861f00e3 | 514 | free(tmp); |
a5e10acb JH |
515 | if (errors) |
516 | return -1; | |
861f00e3 | 517 | } |
16d7cc90 JH |
518 | if (read_ref_at(real_ref, at_time, nth, sha1, NULL, |
519 | &co_time, &co_tz, &co_cnt)) { | |
520 | if (at_time) | |
eedce784 JS |
521 | warning("Log for '%.*s' only goes " |
522 | "back to %s.", len, str, | |
73013afd | 523 | show_date(co_time, co_tz, DATE_RFC2822)); |
e6eedc31 JS |
524 | else { |
525 | free(real_ref); | |
526 | die("Log for '%.*s' only has %d entries.", | |
527 | len, str, co_cnt); | |
528 | } | |
16d7cc90 | 529 | } |
d556fae2 SP |
530 | } |
531 | ||
ed378ec7 | 532 | free(real_ref); |
d556fae2 | 533 | return 0; |
9938af6a JH |
534 | } |
535 | ||
9938af6a JH |
536 | static int get_parent(const char *name, int len, |
537 | unsigned char *result, int idx) | |
538 | { | |
539 | unsigned char sha1[20]; | |
e2643617 | 540 | int ret = get_sha1_1(name, len, sha1, GET_SHA1_COMMITTISH); |
9938af6a JH |
541 | struct commit *commit; |
542 | struct commit_list *p; | |
543 | ||
544 | if (ret) | |
545 | return ret; | |
546 | commit = lookup_commit_reference(sha1); | |
547 | if (!commit) | |
548 | return -1; | |
549 | if (parse_commit(commit)) | |
550 | return -1; | |
551 | if (!idx) { | |
e702496e | 552 | hashcpy(result, commit->object.sha1); |
9938af6a JH |
553 | return 0; |
554 | } | |
555 | p = commit->parents; | |
556 | while (p) { | |
557 | if (!--idx) { | |
e702496e | 558 | hashcpy(result, p->item->object.sha1); |
9938af6a JH |
559 | return 0; |
560 | } | |
561 | p = p->next; | |
562 | } | |
563 | return -1; | |
564 | } | |
565 | ||
4f7599ac JH |
566 | static int get_nth_ancestor(const char *name, int len, |
567 | unsigned char *result, int generation) | |
568 | { | |
569 | unsigned char sha1[20]; | |
621ff675 LT |
570 | struct commit *commit; |
571 | int ret; | |
572 | ||
e2643617 | 573 | ret = get_sha1_1(name, len, sha1, GET_SHA1_COMMITTISH); |
4f7599ac JH |
574 | if (ret) |
575 | return ret; | |
621ff675 LT |
576 | commit = lookup_commit_reference(sha1); |
577 | if (!commit) | |
578 | return -1; | |
4f7599ac JH |
579 | |
580 | while (generation--) { | |
621ff675 | 581 | if (parse_commit(commit) || !commit->parents) |
4f7599ac | 582 | return -1; |
621ff675 | 583 | commit = commit->parents->item; |
4f7599ac | 584 | } |
621ff675 | 585 | hashcpy(result, commit->object.sha1); |
4f7599ac JH |
586 | return 0; |
587 | } | |
588 | ||
81776315 JH |
589 | struct object *peel_to_type(const char *name, int namelen, |
590 | struct object *o, enum object_type expected_type) | |
591 | { | |
592 | if (name && !namelen) | |
593 | namelen = strlen(name); | |
81776315 JH |
594 | while (1) { |
595 | if (!o || (!o->parsed && !parse_object(o->sha1))) | |
596 | return NULL; | |
a6a3f2cc | 597 | if (expected_type == OBJ_ANY || o->type == expected_type) |
81776315 JH |
598 | return o; |
599 | if (o->type == OBJ_TAG) | |
600 | o = ((struct tag*) o)->tagged; | |
601 | else if (o->type == OBJ_COMMIT) | |
602 | o = &(((struct commit *) o)->tree->object); | |
603 | else { | |
604 | if (name) | |
605 | error("%.*s: expected %s type, but the object " | |
606 | "dereferences to %s type", | |
607 | namelen, name, typename(expected_type), | |
608 | typename(o->type)); | |
609 | return NULL; | |
610 | } | |
611 | } | |
612 | } | |
613 | ||
5385f52d JH |
614 | static int peel_onion(const char *name, int len, unsigned char *sha1) |
615 | { | |
616 | unsigned char outer[20]; | |
617 | const char *sp; | |
885a86ab | 618 | unsigned int expected_type = 0; |
e2643617 | 619 | unsigned lookup_flags = 0; |
5385f52d JH |
620 | struct object *o; |
621 | ||
622 | /* | |
623 | * "ref^{type}" dereferences ref repeatedly until you cannot | |
624 | * dereference anymore, or you get an object of given type, | |
625 | * whichever comes first. "ref^{}" means just dereference | |
626 | * tags until you get a non-tag. "ref^0" is a shorthand for | |
627 | * "ref^{commit}". "commit^{tree}" could be used to find the | |
628 | * top-level tree of the given commit. | |
629 | */ | |
630 | if (len < 4 || name[len-1] != '}') | |
631 | return -1; | |
632 | ||
633 | for (sp = name + len - 1; name <= sp; sp--) { | |
634 | int ch = *sp; | |
635 | if (ch == '{' && name < sp && sp[-1] == '^') | |
636 | break; | |
637 | } | |
638 | if (sp <= name) | |
639 | return -1; | |
640 | ||
641 | sp++; /* beginning of type name, or closing brace for empty */ | |
642 | if (!strncmp(commit_type, sp, 6) && sp[6] == '}') | |
1974632c | 643 | expected_type = OBJ_COMMIT; |
5385f52d | 644 | else if (!strncmp(tree_type, sp, 4) && sp[4] == '}') |
1974632c | 645 | expected_type = OBJ_TREE; |
5385f52d | 646 | else if (!strncmp(blob_type, sp, 4) && sp[4] == '}') |
1974632c | 647 | expected_type = OBJ_BLOB; |
a6a3f2cc JH |
648 | else if (!prefixcmp(sp, "object}")) |
649 | expected_type = OBJ_ANY; | |
5385f52d | 650 | else if (sp[0] == '}') |
1974632c | 651 | expected_type = OBJ_NONE; |
32574b68 NTND |
652 | else if (sp[0] == '/') |
653 | expected_type = OBJ_COMMIT; | |
5385f52d JH |
654 | else |
655 | return -1; | |
656 | ||
e2643617 JH |
657 | if (expected_type == OBJ_COMMIT) |
658 | lookup_flags = GET_SHA1_COMMITTISH; | |
ed1ca602 JH |
659 | else if (expected_type == OBJ_TREE) |
660 | lookup_flags = GET_SHA1_TREEISH; | |
e2643617 JH |
661 | |
662 | if (get_sha1_1(name, sp - name - 2, outer, lookup_flags)) | |
5385f52d JH |
663 | return -1; |
664 | ||
665 | o = parse_object(outer); | |
666 | if (!o) | |
667 | return -1; | |
885a86ab | 668 | if (!expected_type) { |
9534f40b | 669 | o = deref_tag(o, name, sp - name - 2); |
6e1c6c10 JH |
670 | if (!o || (!o->parsed && !parse_object(o->sha1))) |
671 | return -1; | |
e702496e | 672 | hashcpy(sha1, o->sha1); |
32574b68 | 673 | return 0; |
5385f52d | 674 | } |
32574b68 NTND |
675 | |
676 | /* | |
677 | * At this point, the syntax look correct, so | |
678 | * if we do not get the needed object, we should | |
679 | * barf. | |
680 | */ | |
681 | o = peel_to_type(name, len, o, expected_type); | |
682 | if (!o) | |
81776315 | 683 | return -1; |
32574b68 NTND |
684 | |
685 | hashcpy(sha1, o->sha1); | |
686 | if (sp[0] == '/') { | |
687 | /* "$commit^{/foo}" */ | |
688 | char *prefix; | |
689 | int ret; | |
690 | struct commit_list *list = NULL; | |
691 | ||
81776315 | 692 | /* |
4322842a NTND |
693 | * $commit^{/}. Some regex implementation may reject. |
694 | * We don't need regex anyway. '' pattern always matches. | |
5385f52d | 695 | */ |
4322842a | 696 | if (sp[1] == '}') |
81776315 | 697 | return 0; |
4322842a | 698 | |
32574b68 NTND |
699 | prefix = xstrndup(sp + 1, name + len - 1 - (sp + 1)); |
700 | commit_list_insert((struct commit *)o, &list); | |
701 | ret = get_sha1_oneline(prefix, sha1, list); | |
702 | free(prefix); | |
703 | return ret; | |
5385f52d JH |
704 | } |
705 | return 0; | |
706 | } | |
707 | ||
7dd45e15 JH |
708 | static int get_describe_name(const char *name, int len, unsigned char *sha1) |
709 | { | |
710 | const char *cp; | |
6269b6b6 | 711 | unsigned flags = GET_SHA1_QUIETLY | GET_SHA1_COMMIT; |
7dd45e15 JH |
712 | |
713 | for (cp = name + len - 1; name + 2 <= cp; cp--) { | |
714 | char ch = *cp; | |
715 | if (hexval(ch) & ~0377) { | |
716 | /* We must be looking at g in "SOMETHING-g" | |
717 | * for it to be describe output. | |
718 | */ | |
719 | if (ch == 'g' && cp[-1] == '-') { | |
720 | cp++; | |
721 | len -= cp - name; | |
6269b6b6 | 722 | return get_short_sha1(cp, len, sha1, flags); |
7dd45e15 JH |
723 | } |
724 | } | |
725 | } | |
726 | return -1; | |
727 | } | |
728 | ||
e48ba200 | 729 | static int get_sha1_1(const char *name, int len, unsigned char *sha1, unsigned lookup_flags) |
9938af6a | 730 | { |
0601dbe1 | 731 | int ret, has_suffix; |
4f7599ac | 732 | const char *cp; |
9938af6a | 733 | |
621ff675 LT |
734 | /* |
735 | * "name~3" is "name^^^", "name~" is "name~1", and "name^" is "name^1". | |
4f7599ac | 736 | */ |
0601dbe1 | 737 | has_suffix = 0; |
4f7599ac JH |
738 | for (cp = name + len - 1; name <= cp; cp--) { |
739 | int ch = *cp; | |
740 | if ('0' <= ch && ch <= '9') | |
741 | continue; | |
0601dbe1 JH |
742 | if (ch == '~' || ch == '^') |
743 | has_suffix = ch; | |
4f7599ac JH |
744 | break; |
745 | } | |
0601dbe1 JH |
746 | |
747 | if (has_suffix) { | |
748 | int num = 0; | |
4f7599ac JH |
749 | int len1 = cp - name; |
750 | cp++; | |
751 | while (cp < name + len) | |
0601dbe1 | 752 | num = num * 10 + *cp++ - '0'; |
621ff675 LT |
753 | if (!num && len1 == len - 1) |
754 | num = 1; | |
755 | if (has_suffix == '^') | |
0601dbe1 | 756 | return get_parent(name, len1, sha1, num); |
0601dbe1 JH |
757 | /* else if (has_suffix == '~') -- goes without saying */ |
758 | return get_nth_ancestor(name, len1, sha1, num); | |
4f7599ac JH |
759 | } |
760 | ||
5385f52d JH |
761 | ret = peel_onion(name, len, sha1); |
762 | if (!ret) | |
763 | return 0; | |
764 | ||
9938af6a JH |
765 | ret = get_sha1_basic(name, len, sha1); |
766 | if (!ret) | |
767 | return 0; | |
7dd45e15 JH |
768 | |
769 | /* It could be describe output that is "SOMETHING-gXXXX" */ | |
770 | ret = get_describe_name(name, len, sha1); | |
771 | if (!ret) | |
772 | return 0; | |
773 | ||
e2643617 | 774 | return get_short_sha1(name, len, sha1, lookup_flags); |
9938af6a JH |
775 | } |
776 | ||
f7bff003 JH |
777 | /* |
778 | * This interprets names like ':/Initial revision of "git"' by searching | |
779 | * through history and returning the first commit whose message starts | |
3d045897 | 780 | * the given regular expression. |
f7bff003 JH |
781 | * |
782 | * For future extension, ':/!' is reserved. If you want to match a message | |
783 | * beginning with a '!', you have to repeat the exclamation mark. | |
784 | */ | |
785 | #define ONELINE_SEEN (1u<<20) | |
786 | ||
28a4d940 JS |
787 | static int handle_one_ref(const char *path, |
788 | const unsigned char *sha1, int flag, void *cb_data) | |
789 | { | |
790 | struct commit_list **list = cb_data; | |
791 | struct object *object = parse_object(sha1); | |
792 | if (!object) | |
793 | return 0; | |
affeef12 | 794 | if (object->type == OBJ_TAG) { |
28a4d940 | 795 | object = deref_tag(object, path, strlen(path)); |
affeef12 MK |
796 | if (!object) |
797 | return 0; | |
798 | } | |
28a4d940 JS |
799 | if (object->type != OBJ_COMMIT) |
800 | return 0; | |
47e44ed1 | 801 | commit_list_insert_by_date((struct commit *)object, list); |
28a4d940 JS |
802 | return 0; |
803 | } | |
804 | ||
84baa31b NTND |
805 | static int get_sha1_oneline(const char *prefix, unsigned char *sha1, |
806 | struct commit_list *list) | |
28a4d940 | 807 | { |
84baa31b | 808 | struct commit_list *backup = NULL, *l; |
28042dbc | 809 | int found = 0; |
57895105 | 810 | regex_t regex; |
28a4d940 JS |
811 | |
812 | if (prefix[0] == '!') { | |
813 | if (prefix[1] != '!') | |
814 | die ("Invalid search pattern: %s", prefix); | |
815 | prefix++; | |
816 | } | |
57895105 LT |
817 | |
818 | if (regcomp(®ex, prefix, REG_EXTENDED)) | |
819 | die("Invalid search pattern: %s", prefix); | |
820 | ||
84baa31b NTND |
821 | for (l = list; l; l = l->next) { |
822 | l->item->object.flags |= ONELINE_SEEN; | |
28a4d940 | 823 | commit_list_insert(l->item, &backup); |
84baa31b | 824 | } |
ed8ad7e2 | 825 | while (list) { |
28042dbc | 826 | char *p, *to_free = NULL; |
1358e7d6 | 827 | struct commit *commit; |
364d3e65 JS |
828 | enum object_type type; |
829 | unsigned long size; | |
28042dbc | 830 | int matches; |
ed8ad7e2 JM |
831 | |
832 | commit = pop_most_recent_commit(&list, ONELINE_SEEN); | |
283cdbcf MK |
833 | if (!parse_object(commit->object.sha1)) |
834 | continue; | |
364d3e65 JS |
835 | if (commit->buffer) |
836 | p = commit->buffer; | |
837 | else { | |
838 | p = read_sha1_file(commit->object.sha1, &type, &size); | |
839 | if (!p) | |
840 | continue; | |
28042dbc | 841 | to_free = p; |
364d3e65 | 842 | } |
28042dbc JH |
843 | |
844 | p = strstr(p, "\n\n"); | |
845 | matches = p && !regexec(®ex, p + 2, 0, NULL, 0); | |
846 | free(to_free); | |
847 | ||
848 | if (matches) { | |
28a4d940 | 849 | hashcpy(sha1, commit->object.sha1); |
28042dbc | 850 | found = 1; |
28a4d940 JS |
851 | break; |
852 | } | |
853 | } | |
57895105 | 854 | regfree(®ex); |
28a4d940 JS |
855 | free_commit_list(list); |
856 | for (l = backup; l; l = l->next) | |
857 | clear_commit_marks(l->item, ONELINE_SEEN); | |
28042dbc JH |
858 | free_commit_list(backup); |
859 | return found ? 0 : -1; | |
28a4d940 JS |
860 | } |
861 | ||
ae5a6c36 | 862 | struct grab_nth_branch_switch_cbdata { |
98f85ff4 JH |
863 | int remaining; |
864 | struct strbuf buf; | |
ae5a6c36 JH |
865 | }; |
866 | ||
867 | static int grab_nth_branch_switch(unsigned char *osha1, unsigned char *nsha1, | |
868 | const char *email, unsigned long timestamp, int tz, | |
869 | const char *message, void *cb_data) | |
870 | { | |
871 | struct grab_nth_branch_switch_cbdata *cb = cb_data; | |
a884d0cb TR |
872 | const char *match = NULL, *target = NULL; |
873 | size_t len; | |
874 | ||
875 | if (!prefixcmp(message, "checkout: moving from ")) { | |
876 | match = message + strlen("checkout: moving from "); | |
d7c03c1f | 877 | target = strstr(match, " to "); |
ae5a6c36 JH |
878 | } |
879 | ||
c829774c | 880 | if (!match || !target) |
ae5a6c36 | 881 | return 0; |
98f85ff4 JH |
882 | if (--(cb->remaining) == 0) { |
883 | len = target - match; | |
884 | strbuf_reset(&cb->buf); | |
885 | strbuf_add(&cb->buf, match, len); | |
886 | return 1; /* we are done */ | |
887 | } | |
ae5a6c36 JH |
888 | return 0; |
889 | } | |
890 | ||
891 | /* | |
ae0ba8e2 JH |
892 | * Parse @{-N} syntax, return the number of characters parsed |
893 | * if successful; otherwise signal an error with negative value. | |
ae5a6c36 | 894 | */ |
ae0ba8e2 | 895 | static int interpret_nth_prior_checkout(const char *name, struct strbuf *buf) |
ae5a6c36 | 896 | { |
c2883e62 | 897 | long nth; |
98f85ff4 | 898 | int retval; |
ae5a6c36 | 899 | struct grab_nth_branch_switch_cbdata cb; |
a884d0cb TR |
900 | const char *brace; |
901 | char *num_end; | |
ae5a6c36 JH |
902 | |
903 | if (name[0] != '@' || name[1] != '{' || name[2] != '-') | |
904 | return -1; | |
a884d0cb TR |
905 | brace = strchr(name, '}'); |
906 | if (!brace) | |
907 | return -1; | |
98f85ff4 | 908 | nth = strtol(name + 3, &num_end, 10); |
a884d0cb | 909 | if (num_end != brace) |
ae5a6c36 | 910 | return -1; |
c2883e62 JH |
911 | if (nth <= 0) |
912 | return -1; | |
98f85ff4 JH |
913 | cb.remaining = nth; |
914 | strbuf_init(&cb.buf, 20); | |
915 | ||
39765e59 | 916 | retval = 0; |
98f85ff4 JH |
917 | if (0 < for_each_reflog_ent_reverse("HEAD", grab_nth_branch_switch, &cb)) { |
918 | strbuf_reset(buf); | |
919 | strbuf_add(buf, cb.buf.buf, cb.buf.len); | |
920 | retval = brace - name + 1; | |
921 | } | |
a884d0cb | 922 | |
98f85ff4 | 923 | strbuf_release(&cb.buf); |
39765e59 | 924 | return retval; |
ae5a6c36 JH |
925 | } |
926 | ||
619a644d JH |
927 | int get_sha1_mb(const char *name, unsigned char *sha1) |
928 | { | |
929 | struct commit *one, *two; | |
930 | struct commit_list *mbs; | |
931 | unsigned char sha1_tmp[20]; | |
932 | const char *dots; | |
933 | int st; | |
934 | ||
935 | dots = strstr(name, "..."); | |
936 | if (!dots) | |
937 | return get_sha1(name, sha1); | |
938 | if (dots == name) | |
939 | st = get_sha1("HEAD", sha1_tmp); | |
940 | else { | |
941 | struct strbuf sb; | |
942 | strbuf_init(&sb, dots - name); | |
943 | strbuf_add(&sb, name, dots - name); | |
cd74e473 | 944 | st = get_sha1_committish(sb.buf, sha1_tmp); |
619a644d JH |
945 | strbuf_release(&sb); |
946 | } | |
947 | if (st) | |
948 | return st; | |
949 | one = lookup_commit_reference_gently(sha1_tmp, 0); | |
950 | if (!one) | |
951 | return -1; | |
952 | ||
cd74e473 | 953 | if (get_sha1_committish(dots[3] ? (dots + 3) : "HEAD", sha1_tmp)) |
619a644d JH |
954 | return -1; |
955 | two = lookup_commit_reference_gently(sha1_tmp, 0); | |
956 | if (!two) | |
957 | return -1; | |
958 | mbs = get_merge_bases(one, two, 1); | |
959 | if (!mbs || mbs->next) | |
960 | st = -1; | |
961 | else { | |
962 | st = 0; | |
963 | hashcpy(sha1, mbs->item->object.sha1); | |
964 | } | |
965 | free_commit_list(mbs); | |
966 | return st; | |
967 | } | |
968 | ||
ae0ba8e2 JH |
969 | /* |
970 | * This reads short-hand syntax that not only evaluates to a commit | |
971 | * object name, but also can act as if the end user spelled the name | |
972 | * of the branch from the command line. | |
973 | * | |
974 | * - "@{-N}" finds the name of the Nth previous branch we were on, and | |
975 | * places the name of the branch in the given buf and returns the | |
976 | * number of characters parsed if successful. | |
977 | * | |
978 | * - "<branch>@{upstream}" finds the name of the other ref that | |
979 | * <branch> is configured to merge with (missing <branch> defaults | |
980 | * to the current branch), and places the name of the branch in the | |
981 | * given buf and returns the number of characters parsed if | |
982 | * successful. | |
983 | * | |
984 | * If the input is not of the accepted format, it returns a negative | |
985 | * number to signal an error. | |
986 | * | |
987 | * If the input was ok but there are not N branch switches in the | |
988 | * reflog, it returns 0. | |
989 | */ | |
990 | int interpret_branch_name(const char *name, struct strbuf *buf) | |
991 | { | |
992 | char *cp; | |
993 | struct branch *upstream; | |
994 | int namelen = strlen(name); | |
995 | int len = interpret_nth_prior_checkout(name, buf); | |
996 | int tmp_len; | |
997 | ||
998 | if (!len) | |
999 | return len; /* syntax Ok, not enough switches */ | |
d46a8301 JK |
1000 | if (0 < len && len == namelen) |
1001 | return len; /* consumed all */ | |
1002 | else if (0 < len) { | |
1003 | /* we have extra data, which might need further processing */ | |
1004 | struct strbuf tmp = STRBUF_INIT; | |
1005 | int used = buf->len; | |
1006 | int ret; | |
1007 | ||
1008 | strbuf_add(buf, name + len, namelen - len); | |
1009 | ret = interpret_branch_name(buf->buf, &tmp); | |
1010 | /* that data was not interpreted, remove our cruft */ | |
1011 | if (ret < 0) { | |
1012 | strbuf_setlen(buf, used); | |
1013 | return len; | |
1014 | } | |
1015 | strbuf_reset(buf); | |
1016 | strbuf_addbuf(buf, &tmp); | |
1017 | strbuf_release(&tmp); | |
1018 | /* tweak for size of {-N} versus expanded ref name */ | |
1019 | return ret - used + len; | |
1020 | } | |
1021 | ||
ae0ba8e2 JH |
1022 | cp = strchr(name, '@'); |
1023 | if (!cp) | |
1024 | return -1; | |
1025 | tmp_len = upstream_mark(cp, namelen - (cp - name)); | |
1026 | if (!tmp_len) | |
1027 | return -1; | |
1028 | len = cp + tmp_len - name; | |
1029 | cp = xstrndup(name, cp - name); | |
1030 | upstream = branch_get(*cp ? cp : NULL); | |
9884e67f ZJS |
1031 | /* |
1032 | * Upstream can be NULL only if cp refers to HEAD and HEAD | |
1033 | * points to something different than a branch. | |
1034 | */ | |
1035 | if (!upstream) | |
64720288 | 1036 | return error(_("HEAD does not point to a branch")); |
bb0dab5d ZJS |
1037 | if (!upstream->merge || !upstream->merge[0]->dst) { |
1038 | if (!ref_exists(upstream->refname)) | |
64720288 | 1039 | return error(_("No such branch: '%s'"), cp); |
17c82211 | 1040 | if (!upstream->merge) |
64720288 | 1041 | return error(_("No upstream configured for branch '%s'"), |
17c82211 ZJS |
1042 | upstream->name); |
1043 | return error( | |
64720288 | 1044 | _("Upstream branch '%s' not stored as a remote-tracking branch"), |
17c82211 | 1045 | upstream->merge[0]->src); |
bb0dab5d | 1046 | } |
ae0ba8e2 JH |
1047 | free(cp); |
1048 | cp = shorten_unambiguous_ref(upstream->merge[0]->dst, 0); | |
1049 | strbuf_reset(buf); | |
1050 | strbuf_addstr(buf, cp); | |
1051 | free(cp); | |
1052 | return len; | |
1053 | } | |
1054 | ||
6bab74e7 JN |
1055 | int strbuf_branchname(struct strbuf *sb, const char *name) |
1056 | { | |
1057 | int len = strlen(name); | |
1058 | if (interpret_branch_name(name, sb) == len) | |
1059 | return 0; | |
1060 | strbuf_add(sb, name, len); | |
1061 | return len; | |
1062 | } | |
1063 | ||
1064 | int strbuf_check_branch_ref(struct strbuf *sb, const char *name) | |
1065 | { | |
1066 | strbuf_branchname(sb, name); | |
1067 | if (name[0] == '-') | |
8d9c5010 | 1068 | return -1; |
6bab74e7 | 1069 | strbuf_splice(sb, 0, 0, "refs/heads/", 11); |
8d9c5010 | 1070 | return check_refname_format(sb->buf, 0); |
6bab74e7 JN |
1071 | } |
1072 | ||
9938af6a JH |
1073 | /* |
1074 | * This is like "get_sha1_basic()", except it allows "sha1 expressions", | |
1075 | * notably "xyz^" for "parent of xyz" | |
1076 | */ | |
1077 | int get_sha1(const char *name, unsigned char *sha1) | |
1078 | { | |
573285e5 | 1079 | struct object_context unused; |
33bd598c | 1080 | return get_sha1_with_context(name, 0, sha1, &unused); |
a0cd87a5 MK |
1081 | } |
1082 | ||
cd74e473 JH |
1083 | /* |
1084 | * Many callers know that the user meant to name a committish by | |
1085 | * syntactical positions where the object name appears. Calling this | |
1086 | * function allows the machinery to disambiguate shorter-than-unique | |
1087 | * abbreviated object names between committish and others. | |
1088 | * | |
1089 | * Note that this does NOT error out when the named object is not a | |
1090 | * committish. It is merely to give a hint to the disambiguation | |
1091 | * machinery. | |
1092 | */ | |
1093 | int get_sha1_committish(const char *name, unsigned char *sha1) | |
1094 | { | |
1095 | struct object_context unused; | |
1096 | return get_sha1_with_context(name, GET_SHA1_COMMITTISH, | |
1097 | sha1, &unused); | |
1098 | } | |
1099 | ||
daba53ae JH |
1100 | int get_sha1_treeish(const char *name, unsigned char *sha1) |
1101 | { | |
1102 | struct object_context unused; | |
1103 | return get_sha1_with_context(name, GET_SHA1_TREEISH, | |
1104 | sha1, &unused); | |
1105 | } | |
1106 | ||
1107 | int get_sha1_commit(const char *name, unsigned char *sha1) | |
1108 | { | |
1109 | struct object_context unused; | |
1110 | return get_sha1_with_context(name, GET_SHA1_COMMIT, | |
1111 | sha1, &unused); | |
1112 | } | |
1113 | ||
1114 | int get_sha1_tree(const char *name, unsigned char *sha1) | |
1115 | { | |
1116 | struct object_context unused; | |
1117 | return get_sha1_with_context(name, GET_SHA1_TREE, | |
1118 | sha1, &unused); | |
1119 | } | |
1120 | ||
1121 | int get_sha1_blob(const char *name, unsigned char *sha1) | |
1122 | { | |
1123 | struct object_context unused; | |
1124 | return get_sha1_with_context(name, GET_SHA1_BLOB, | |
1125 | sha1, &unused); | |
a0cd87a5 MK |
1126 | } |
1127 | ||
009fee47 MM |
1128 | /* Must be called only when object_name:filename doesn't exist. */ |
1129 | static void diagnose_invalid_sha1_path(const char *prefix, | |
1130 | const char *filename, | |
1131 | const unsigned char *tree_sha1, | |
b2981d06 RS |
1132 | const char *object_name, |
1133 | int object_name_len) | |
009fee47 MM |
1134 | { |
1135 | struct stat st; | |
1136 | unsigned char sha1[20]; | |
1137 | unsigned mode; | |
1138 | ||
1139 | if (!prefix) | |
1140 | prefix = ""; | |
1141 | ||
1142 | if (!lstat(filename, &st)) | |
b2981d06 RS |
1143 | die("Path '%s' exists on disk, but not in '%.*s'.", |
1144 | filename, object_name_len, object_name); | |
009fee47 MM |
1145 | if (errno == ENOENT || errno == ENOTDIR) { |
1146 | char *fullname = xmalloc(strlen(filename) | |
1147 | + strlen(prefix) + 1); | |
1148 | strcpy(fullname, prefix); | |
1149 | strcat(fullname, filename); | |
1150 | ||
1151 | if (!get_tree_entry(tree_sha1, fullname, | |
1152 | sha1, &mode)) { | |
1153 | die("Path '%s' exists, but not '%s'.\n" | |
b2981d06 | 1154 | "Did you mean '%.*s:%s' aka '%.*s:./%s'?", |
009fee47 MM |
1155 | fullname, |
1156 | filename, | |
b2981d06 | 1157 | object_name_len, object_name, |
e41d718c | 1158 | fullname, |
b2981d06 | 1159 | object_name_len, object_name, |
e41d718c | 1160 | filename); |
009fee47 | 1161 | } |
b2981d06 RS |
1162 | die("Path '%s' does not exist in '%.*s'", |
1163 | filename, object_name_len, object_name); | |
009fee47 MM |
1164 | } |
1165 | } | |
1166 | ||
1167 | /* Must be called only when :stage:filename doesn't exist. */ | |
1168 | static void diagnose_invalid_index_path(int stage, | |
1169 | const char *prefix, | |
1170 | const char *filename) | |
1171 | { | |
1172 | struct stat st; | |
1173 | struct cache_entry *ce; | |
1174 | int pos; | |
1175 | unsigned namelen = strlen(filename); | |
1176 | unsigned fullnamelen; | |
1177 | char *fullname; | |
1178 | ||
1179 | if (!prefix) | |
1180 | prefix = ""; | |
1181 | ||
1182 | /* Wrong stage number? */ | |
1183 | pos = cache_name_pos(filename, namelen); | |
1184 | if (pos < 0) | |
1185 | pos = -pos - 1; | |
77e8466f MH |
1186 | if (pos < active_nr) { |
1187 | ce = active_cache[pos]; | |
1188 | if (ce_namelen(ce) == namelen && | |
1189 | !memcmp(ce->name, filename, namelen)) | |
1190 | die("Path '%s' is in the index, but not at stage %d.\n" | |
1191 | "Did you mean ':%d:%s'?", | |
1192 | filename, stage, | |
1193 | ce_stage(ce), filename); | |
1194 | } | |
009fee47 MM |
1195 | |
1196 | /* Confusion between relative and absolute filenames? */ | |
1197 | fullnamelen = namelen + strlen(prefix); | |
1198 | fullname = xmalloc(fullnamelen + 1); | |
1199 | strcpy(fullname, prefix); | |
1200 | strcat(fullname, filename); | |
1201 | pos = cache_name_pos(fullname, fullnamelen); | |
1202 | if (pos < 0) | |
1203 | pos = -pos - 1; | |
77e8466f MH |
1204 | if (pos < active_nr) { |
1205 | ce = active_cache[pos]; | |
1206 | if (ce_namelen(ce) == fullnamelen && | |
1207 | !memcmp(ce->name, fullname, fullnamelen)) | |
1208 | die("Path '%s' is in the index, but not '%s'.\n" | |
e41d718c | 1209 | "Did you mean ':%d:%s' aka ':%d:./%s'?", |
77e8466f | 1210 | fullname, filename, |
e41d718c MG |
1211 | ce_stage(ce), fullname, |
1212 | ce_stage(ce), filename); | |
77e8466f | 1213 | } |
009fee47 MM |
1214 | |
1215 | if (!lstat(filename, &st)) | |
1216 | die("Path '%s' exists on disk, but not in the index.", filename); | |
1217 | if (errno == ENOENT || errno == ENOTDIR) | |
1218 | die("Path '%s' does not exist (neither on disk nor in the index).", | |
1219 | filename); | |
1220 | ||
1221 | free(fullname); | |
1222 | } | |
1223 | ||
1224 | ||
979f7929 NTND |
1225 | static char *resolve_relative_path(const char *rel) |
1226 | { | |
1227 | if (prefixcmp(rel, "./") && prefixcmp(rel, "../")) | |
1228 | return NULL; | |
1229 | ||
1230 | if (!startup_info) | |
1231 | die("BUG: startup_info struct is not initialized."); | |
1232 | ||
1233 | if (!is_inside_work_tree()) | |
1234 | die("relative path syntax can't be used outside working tree."); | |
1235 | ||
1236 | /* die() inside prefix_path() if resolved path is outside worktree */ | |
1237 | return prefix_path(startup_info->prefix, | |
1238 | startup_info->prefix ? strlen(startup_info->prefix) : 0, | |
1239 | rel); | |
1240 | } | |
1241 | ||
33bd598c JH |
1242 | static int get_sha1_with_context_1(const char *name, |
1243 | unsigned flags, | |
1244 | const char *prefix, | |
1245 | unsigned char *sha1, | |
1246 | struct object_context *oc) | |
a0cd87a5 MK |
1247 | { |
1248 | int ret, bracket_depth; | |
73b0e5af JH |
1249 | int namelen = strlen(name); |
1250 | const char *cp; | |
33bd598c | 1251 | int only_to_die = flags & GET_SHA1_ONLY_TO_DIE; |
5119602a | 1252 | |
573285e5 CP |
1253 | memset(oc, 0, sizeof(*oc)); |
1254 | oc->mode = S_IFINVALID; | |
33bd598c | 1255 | ret = get_sha1_1(name, namelen, sha1, flags); |
73b0e5af JH |
1256 | if (!ret) |
1257 | return ret; | |
33bd598c JH |
1258 | /* |
1259 | * sha1:path --> object name of path in ent sha1 | |
979f7929 NTND |
1260 | * :path -> object name of absolute path in index |
1261 | * :./path -> object name of path relative to cwd in index | |
73b0e5af | 1262 | * :[0-3]:path -> object name of path in index at stage |
95ad6d2d | 1263 | * :/foo -> recent commit matching foo |
73b0e5af JH |
1264 | */ |
1265 | if (name[0] == ':') { | |
1266 | int stage = 0; | |
1267 | struct cache_entry *ce; | |
979f7929 | 1268 | char *new_path = NULL; |
73b0e5af | 1269 | int pos; |
2e83b66c | 1270 | if (!only_to_die && namelen > 2 && name[1] == '/') { |
84baa31b NTND |
1271 | struct commit_list *list = NULL; |
1272 | for_each_ref(handle_one_ref, &list); | |
1273 | return get_sha1_oneline(name + 2, sha1, list); | |
1274 | } | |
73b0e5af JH |
1275 | if (namelen < 3 || |
1276 | name[2] != ':' || | |
1277 | name[1] < '0' || '3' < name[1]) | |
1278 | cp = name + 1; | |
1279 | else { | |
1280 | stage = name[1] - '0'; | |
1281 | cp = name + 3; | |
5119602a | 1282 | } |
3d6e0f74 JH |
1283 | new_path = resolve_relative_path(cp); |
1284 | if (!new_path) { | |
1285 | namelen = namelen - (cp - name); | |
1286 | } else { | |
1287 | cp = new_path; | |
1288 | namelen = strlen(cp); | |
1289 | } | |
573285e5 CP |
1290 | |
1291 | strncpy(oc->path, cp, | |
1292 | sizeof(oc->path)); | |
1293 | oc->path[sizeof(oc->path)-1] = '\0'; | |
1294 | ||
73b0e5af JH |
1295 | if (!active_cache) |
1296 | read_cache(); | |
73b0e5af JH |
1297 | pos = cache_name_pos(cp, namelen); |
1298 | if (pos < 0) | |
1299 | pos = -pos - 1; | |
1300 | while (pos < active_nr) { | |
1301 | ce = active_cache[pos]; | |
1302 | if (ce_namelen(ce) != namelen || | |
1303 | memcmp(ce->name, cp, namelen)) | |
1304 | break; | |
1305 | if (ce_stage(ce) == stage) { | |
e702496e | 1306 | hashcpy(sha1, ce->sha1); |
90064710 | 1307 | oc->mode = ce->ce_mode; |
979f7929 | 1308 | free(new_path); |
73b0e5af JH |
1309 | return 0; |
1310 | } | |
e7cef45f | 1311 | pos++; |
73b0e5af | 1312 | } |
2e83b66c | 1313 | if (only_to_die && name[1] && name[1] != '/') |
009fee47 | 1314 | diagnose_invalid_index_path(stage, prefix, cp); |
979f7929 | 1315 | free(new_path); |
73b0e5af JH |
1316 | return -1; |
1317 | } | |
cce91a2c SP |
1318 | for (cp = name, bracket_depth = 0; *cp; cp++) { |
1319 | if (*cp == '{') | |
1320 | bracket_depth++; | |
1321 | else if (bracket_depth && *cp == '}') | |
1322 | bracket_depth--; | |
1323 | else if (!bracket_depth && *cp == ':') | |
1324 | break; | |
1325 | } | |
1326 | if (*cp == ':') { | |
73b0e5af | 1327 | unsigned char tree_sha1[20]; |
b2981d06 RS |
1328 | int len = cp - name; |
1329 | if (!get_sha1_1(name, len, tree_sha1, GET_SHA1_TREEISH)) { | |
009fee47 | 1330 | const char *filename = cp+1; |
979f7929 NTND |
1331 | char *new_filename = NULL; |
1332 | ||
1333 | new_filename = resolve_relative_path(filename); | |
1334 | if (new_filename) | |
1335 | filename = new_filename; | |
573285e5 | 1336 | ret = get_tree_entry(tree_sha1, filename, sha1, &oc->mode); |
d7236c43 | 1337 | if (ret && only_to_die) { |
009fee47 | 1338 | diagnose_invalid_sha1_path(prefix, filename, |
b2981d06 RS |
1339 | tree_sha1, |
1340 | name, len); | |
009fee47 | 1341 | } |
573285e5 CP |
1342 | hashcpy(oc->tree, tree_sha1); |
1343 | strncpy(oc->path, filename, | |
1344 | sizeof(oc->path)); | |
1345 | oc->path[sizeof(oc->path)-1] = '\0'; | |
1346 | ||
979f7929 | 1347 | free(new_filename); |
009fee47 MM |
1348 | return ret; |
1349 | } else { | |
2e83b66c | 1350 | if (only_to_die) |
b2981d06 | 1351 | die("Invalid object name '%.*s'.", len, name); |
009fee47 | 1352 | } |
5119602a LT |
1353 | } |
1354 | return ret; | |
9938af6a | 1355 | } |
f01cc14c | 1356 | |
8c135ea2 JH |
1357 | /* |
1358 | * Call this function when you know "name" given by the end user must | |
1359 | * name an object but it doesn't; the function _may_ die with a better | |
1360 | * diagnostic message than "no such object 'name'", e.g. "Path 'doc' does not | |
1361 | * exist in 'HEAD'" when given "HEAD:doc", or it may return in which case | |
1362 | * you have a chance to diagnose the error further. | |
1363 | */ | |
1364 | void maybe_die_on_misspelt_object_name(const char *name, const char *prefix) | |
f01cc14c JH |
1365 | { |
1366 | struct object_context oc; | |
8c135ea2 | 1367 | unsigned char sha1[20]; |
33bd598c | 1368 | get_sha1_with_context_1(name, GET_SHA1_ONLY_TO_DIE, prefix, sha1, &oc); |
8c135ea2 JH |
1369 | } |
1370 | ||
33bd598c | 1371 | int get_sha1_with_context(const char *str, unsigned flags, unsigned char *sha1, struct object_context *orc) |
f01cc14c | 1372 | { |
33bd598c | 1373 | return get_sha1_with_context_1(str, flags, NULL, sha1, orc); |
f01cc14c | 1374 | } |