11 #include "oid-array.h"
13 #include "object-store.h"
14 #include "repository.h"
15 #include "submodule.h"
17 #include "commit-reach.h"
20 static int get_oid_oneline(struct repository
*r
, const char *, struct object_id
*, struct commit_list
*);
22 typedef int (*disambiguate_hint_fn
)(struct repository
*, const struct object_id
*, void *);
24 struct disambiguate_state
{
25 int len
; /* length of prefix in hex chars */
26 char hex_pfx
[GIT_MAX_HEXSZ
+ 1];
27 struct object_id bin_pfx
;
29 struct repository
*repo
;
30 disambiguate_hint_fn fn
;
32 struct object_id candidate
;
33 unsigned candidate_exists
:1;
34 unsigned candidate_checked
:1;
35 unsigned candidate_ok
:1;
36 unsigned disambiguate_fn_used
:1;
38 unsigned always_call_fn
:1;
41 static void update_candidates(struct disambiguate_state
*ds
, const struct object_id
*current
)
43 if (ds
->always_call_fn
) {
44 ds
->ambiguous
= ds
->fn(ds
->repo
, current
, ds
->cb_data
) ? 1 : 0;
47 if (!ds
->candidate_exists
) {
48 /* this is the first candidate */
49 oidcpy(&ds
->candidate
, current
);
50 ds
->candidate_exists
= 1;
52 } else if (oideq(&ds
->candidate
, current
)) {
53 /* the same as what we already have seen */
58 /* cannot disambiguate between ds->candidate and current */
63 if (!ds
->candidate_checked
) {
64 ds
->candidate_ok
= ds
->fn(ds
->repo
, &ds
->candidate
, ds
->cb_data
);
65 ds
->disambiguate_fn_used
= 1;
66 ds
->candidate_checked
= 1;
69 if (!ds
->candidate_ok
) {
70 /* discard the candidate; we know it does not satisfy fn */
71 oidcpy(&ds
->candidate
, current
);
72 ds
->candidate_checked
= 0;
76 /* if we reach this point, we know ds->candidate satisfies fn */
77 if (ds
->fn(ds
->repo
, current
, ds
->cb_data
)) {
79 * if both current and candidate satisfy fn, we cannot
86 /* otherwise, current can be discarded and candidate is still good */
89 static int match_hash(unsigned, const unsigned char *, const unsigned char *);
91 static enum cb_next
match_prefix(const struct object_id
*oid
, void *arg
)
93 struct disambiguate_state
*ds
= arg
;
94 /* no need to call match_hash, oidtree_each did prefix match */
95 update_candidates(ds
, oid
);
96 return ds
->ambiguous
? CB_BREAK
: CB_CONTINUE
;
99 static void find_short_object_filename(struct disambiguate_state
*ds
)
101 struct object_directory
*odb
;
103 for (odb
= ds
->repo
->objects
->odb
; odb
&& !ds
->ambiguous
; odb
= odb
->next
)
104 oidtree_each(odb_loose_cache(odb
, &ds
->bin_pfx
),
105 &ds
->bin_pfx
, ds
->len
, match_prefix
, ds
);
108 static int match_hash(unsigned len
, const unsigned char *a
, const unsigned char *b
)
118 if ((*a
^ *b
) & 0xf0)
123 static void unique_in_midx(struct multi_pack_index
*m
,
124 struct disambiguate_state
*ds
)
126 uint32_t num
, i
, first
= 0;
127 const struct object_id
*current
= NULL
;
128 num
= m
->num_objects
;
133 bsearch_midx(&ds
->bin_pfx
, m
, &first
);
136 * At this point, "first" is the location of the lowest object
137 * with an object name that could match "bin_pfx". See if we have
138 * 0, 1 or more objects that actually match(es).
140 for (i
= first
; i
< num
&& !ds
->ambiguous
; i
++) {
141 struct object_id oid
;
142 current
= nth_midxed_object_oid(&oid
, m
, i
);
143 if (!match_hash(ds
->len
, ds
->bin_pfx
.hash
, current
->hash
))
145 update_candidates(ds
, current
);
149 static void unique_in_pack(struct packed_git
*p
,
150 struct disambiguate_state
*ds
)
152 uint32_t num
, i
, first
= 0;
154 if (p
->multi_pack_index
)
157 if (open_pack_index(p
) || !p
->num_objects
)
160 num
= p
->num_objects
;
161 bsearch_pack(&ds
->bin_pfx
, p
, &first
);
164 * At this point, "first" is the location of the lowest object
165 * with an object name that could match "bin_pfx". See if we have
166 * 0, 1 or more objects that actually match(es).
168 for (i
= first
; i
< num
&& !ds
->ambiguous
; i
++) {
169 struct object_id oid
;
170 nth_packed_object_id(&oid
, p
, i
);
171 if (!match_hash(ds
->len
, ds
->bin_pfx
.hash
, oid
.hash
))
173 update_candidates(ds
, &oid
);
177 static void find_short_packed_object(struct disambiguate_state
*ds
)
179 struct multi_pack_index
*m
;
180 struct packed_git
*p
;
182 for (m
= get_multi_pack_index(ds
->repo
); m
&& !ds
->ambiguous
;
184 unique_in_midx(m
, ds
);
185 for (p
= get_packed_git(ds
->repo
); p
&& !ds
->ambiguous
;
187 unique_in_pack(p
, ds
);
190 static int finish_object_disambiguation(struct disambiguate_state
*ds
,
191 struct object_id
*oid
)
194 return SHORT_NAME_AMBIGUOUS
;
196 if (!ds
->candidate_exists
)
197 return MISSING_OBJECT
;
199 if (!ds
->candidate_checked
)
201 * If this is the only candidate, there is no point
202 * calling the disambiguation hint callback.
204 * On the other hand, if the current candidate
205 * replaced an earlier candidate that did _not_ pass
206 * the disambiguation hint callback, then we do have
207 * more than one objects that match the short name
208 * given, so we should make sure this one matches;
209 * otherwise, if we discovered this one and the one
210 * that we previously discarded in the reverse order,
211 * we would end up showing different results in the
214 ds
->candidate_ok
= (!ds
->disambiguate_fn_used
||
215 ds
->fn(ds
->repo
, &ds
->candidate
, ds
->cb_data
));
217 if (!ds
->candidate_ok
)
218 return SHORT_NAME_AMBIGUOUS
;
220 oidcpy(oid
, &ds
->candidate
);
224 static int disambiguate_commit_only(struct repository
*r
,
225 const struct object_id
*oid
,
226 void *cb_data_unused
)
228 int kind
= oid_object_info(r
, oid
, NULL
);
229 return kind
== OBJ_COMMIT
;
232 static int disambiguate_committish_only(struct repository
*r
,
233 const struct object_id
*oid
,
234 void *cb_data_unused
)
239 kind
= oid_object_info(r
, oid
, NULL
);
240 if (kind
== OBJ_COMMIT
)
245 /* We need to do this the hard way... */
246 obj
= deref_tag(r
, parse_object(r
, oid
), NULL
, 0);
247 if (obj
&& obj
->type
== OBJ_COMMIT
)
252 static int disambiguate_tree_only(struct repository
*r
,
253 const struct object_id
*oid
,
254 void *cb_data_unused
)
256 int kind
= oid_object_info(r
, oid
, NULL
);
257 return kind
== OBJ_TREE
;
260 static int disambiguate_treeish_only(struct repository
*r
,
261 const struct object_id
*oid
,
262 void *cb_data_unused
)
267 kind
= oid_object_info(r
, oid
, NULL
);
268 if (kind
== OBJ_TREE
|| kind
== OBJ_COMMIT
)
273 /* We need to do this the hard way... */
274 obj
= deref_tag(r
, parse_object(r
, oid
), NULL
, 0);
275 if (obj
&& (obj
->type
== OBJ_TREE
|| obj
->type
== OBJ_COMMIT
))
280 static int disambiguate_blob_only(struct repository
*r
,
281 const struct object_id
*oid
,
282 void *cb_data_unused
)
284 int kind
= oid_object_info(r
, oid
, NULL
);
285 return kind
== OBJ_BLOB
;
288 static disambiguate_hint_fn default_disambiguate_hint
;
290 int set_disambiguate_hint_config(const char *var
, const char *value
)
292 static const struct {
294 disambiguate_hint_fn fn
;
297 { "commit", disambiguate_commit_only
},
298 { "committish", disambiguate_committish_only
},
299 { "tree", disambiguate_tree_only
},
300 { "treeish", disambiguate_treeish_only
},
301 { "blob", disambiguate_blob_only
}
306 return config_error_nonbool(var
);
308 for (i
= 0; i
< ARRAY_SIZE(hints
); i
++) {
309 if (!strcasecmp(value
, hints
[i
].name
)) {
310 default_disambiguate_hint
= hints
[i
].fn
;
315 return error("unknown hint type for '%s': %s", var
, value
);
318 static int init_object_disambiguation(struct repository
*r
,
319 const char *name
, int len
,
320 struct disambiguate_state
*ds
)
324 if (len
< MINIMUM_ABBREV
|| len
> the_hash_algo
->hexsz
)
327 memset(ds
, 0, sizeof(*ds
));
329 for (i
= 0; i
< len
;i
++) {
330 unsigned char c
= name
[i
];
332 if (c
>= '0' && c
<= '9')
334 else if (c
>= 'a' && c
<= 'f')
336 else if (c
>= 'A' && c
<='F') {
345 ds
->bin_pfx
.hash
[i
>> 1] |= val
;
349 ds
->hex_pfx
[len
] = '\0';
355 struct ambiguous_output
{
356 const struct disambiguate_state
*ds
;
357 struct strbuf advice
;
361 static int show_ambiguous_object(const struct object_id
*oid
, void *data
)
363 struct ambiguous_output
*state
= data
;
364 const struct disambiguate_state
*ds
= state
->ds
;
365 struct strbuf
*advice
= &state
->advice
;
366 struct strbuf
*sb
= &state
->sb
;
370 if (ds
->fn
&& !ds
->fn(ds
->repo
, oid
, ds
->cb_data
))
373 hash
= repo_find_unique_abbrev(ds
->repo
, oid
, DEFAULT_ABBREV
);
374 type
= oid_object_info(ds
->repo
, oid
, NULL
);
378 * TRANSLATORS: This is a line of ambiguous object
379 * output shown when we cannot look up or parse the
380 * object in question. E.g. "deadbeef [bad object]".
382 strbuf_addf(sb
, _("%s [bad object]"), hash
);
386 assert(type
== OBJ_TREE
|| type
== OBJ_COMMIT
||
387 type
== OBJ_BLOB
|| type
== OBJ_TAG
);
389 if (type
== OBJ_COMMIT
) {
390 struct strbuf date
= STRBUF_INIT
;
391 struct strbuf msg
= STRBUF_INIT
;
392 struct commit
*commit
= lookup_commit(ds
->repo
, oid
);
395 struct pretty_print_context pp
= {0};
396 pp
.date_mode
.type
= DATE_SHORT
;
397 format_commit_message(commit
, "%ad", &date
, &pp
);
398 format_commit_message(commit
, "%s", &msg
, &pp
);
402 * TRANSLATORS: This is a line of ambiguous commit
403 * object output. E.g.:
405 * "deadbeef commit 2021-01-01 - Some Commit Message"
407 strbuf_addf(sb
, _("%s commit %s - %s"), hash
, date
.buf
,
410 strbuf_release(&date
);
411 strbuf_release(&msg
);
412 } else if (type
== OBJ_TAG
) {
413 struct tag
*tag
= lookup_tag(ds
->repo
, oid
);
415 if (!parse_tag(tag
) && tag
->tag
) {
417 * TRANSLATORS: This is a line of ambiguous
418 * tag object output. E.g.:
420 * "deadbeef tag 2022-01-01 - Some Tag Message"
422 * The second argument is the YYYY-MM-DD found
425 * The third argument is the "tag" string
428 strbuf_addf(sb
, _("%s tag %s - %s"), hash
,
429 show_date(tag
->date
, 0, DATE_MODE(SHORT
)),
433 * TRANSLATORS: This is a line of ambiguous
434 * tag object output where we couldn't parse
435 * the tag itself. E.g.:
437 * "deadbeef [bad tag, could not parse it]"
439 strbuf_addf(sb
, _("%s [bad tag, could not parse it]"),
442 } else if (type
== OBJ_TREE
) {
444 * TRANSLATORS: This is a line of ambiguous <type>
445 * object output. E.g. "deadbeef tree".
447 strbuf_addf(sb
, _("%s tree"), hash
);
448 } else if (type
== OBJ_BLOB
) {
450 * TRANSLATORS: This is a line of ambiguous <type>
451 * object output. E.g. "deadbeef blob".
453 strbuf_addf(sb
, _("%s blob"), hash
);
459 * TRANSLATORS: This is line item of ambiguous object output
460 * from describe_ambiguous_object() above. For RTL languages
461 * you'll probably want to swap the "%s" and leading " " space
464 strbuf_addf(advice
, _(" %s\n"), sb
->buf
);
470 static int collect_ambiguous(const struct object_id
*oid
, void *data
)
472 oid_array_append(data
, oid
);
476 static int repo_collect_ambiguous(struct repository
*r
,
477 const struct object_id
*oid
,
480 return collect_ambiguous(oid
, data
);
483 static int sort_ambiguous(const void *a
, const void *b
, void *ctx
)
485 struct repository
*sort_ambiguous_repo
= ctx
;
486 int a_type
= oid_object_info(sort_ambiguous_repo
, a
, NULL
);
487 int b_type
= oid_object_info(sort_ambiguous_repo
, b
, NULL
);
492 * Sorts by hash within the same object type, just as
493 * oid_array_for_each_unique() would do.
495 if (a_type
== b_type
)
499 * Between object types show tags, then commits, and finally
502 * The object_type enum is commit, tree, blob, tag, but we
503 * want tag, commit, tree blob. Cleverly (perhaps too
504 * cleverly) do that with modulus, since the enum assigns 1 to
505 * commit, so tag becomes 0.
507 a_type_sort
= a_type
% 4;
508 b_type_sort
= b_type
% 4;
509 return a_type_sort
> b_type_sort
? 1 : -1;
512 static void sort_ambiguous_oid_array(struct repository
*r
, struct oid_array
*a
)
514 QSORT_S(a
->oid
, a
->nr
, sort_ambiguous
, r
);
517 static enum get_oid_result
get_short_oid(struct repository
*r
,
518 const char *name
, int len
,
519 struct object_id
*oid
,
523 struct disambiguate_state ds
;
524 int quietly
= !!(flags
& GET_OID_QUIETLY
);
526 if (init_object_disambiguation(r
, name
, len
, &ds
) < 0)
529 if (HAS_MULTI_BITS(flags
& GET_OID_DISAMBIGUATORS
))
530 BUG("multiple get_short_oid disambiguator flags");
532 if (flags
& GET_OID_COMMIT
)
533 ds
.fn
= disambiguate_commit_only
;
534 else if (flags
& GET_OID_COMMITTISH
)
535 ds
.fn
= disambiguate_committish_only
;
536 else if (flags
& GET_OID_TREE
)
537 ds
.fn
= disambiguate_tree_only
;
538 else if (flags
& GET_OID_TREEISH
)
539 ds
.fn
= disambiguate_treeish_only
;
540 else if (flags
& GET_OID_BLOB
)
541 ds
.fn
= disambiguate_blob_only
;
543 ds
.fn
= default_disambiguate_hint
;
545 find_short_object_filename(&ds
);
546 find_short_packed_object(&ds
);
547 status
= finish_object_disambiguation(&ds
, oid
);
550 * If we didn't find it, do the usual reprepare() slow-path,
551 * since the object may have recently been added to the repository
552 * or migrated from loose to packed.
554 if (status
== MISSING_OBJECT
) {
555 reprepare_packed_git(r
);
556 find_short_object_filename(&ds
);
557 find_short_packed_object(&ds
);
558 status
= finish_object_disambiguation(&ds
, oid
);
561 if (!quietly
&& (status
== SHORT_NAME_AMBIGUOUS
)) {
562 struct oid_array collect
= OID_ARRAY_INIT
;
563 struct ambiguous_output out
= {
566 .advice
= STRBUF_INIT
,
569 error(_("short object ID %s is ambiguous"), ds
.hex_pfx
);
572 * We may still have ambiguity if we simply saw a series of
573 * candidates that did not satisfy our hint function. In
574 * that case, we still want to show them, so disable the hint
580 repo_for_each_abbrev(r
, ds
.hex_pfx
, collect_ambiguous
, &collect
);
581 sort_ambiguous_oid_array(r
, &collect
);
583 if (oid_array_for_each(&collect
, show_ambiguous_object
, &out
))
584 BUG("show_ambiguous_object shouldn't return non-zero");
587 * TRANSLATORS: The argument is the list of ambiguous
588 * objects composed in show_ambiguous_object(). See
589 * its "TRANSLATORS" comments for details.
591 advise(_("The candidates are:\n%s"), out
.advice
.buf
);
593 oid_array_clear(&collect
);
594 strbuf_release(&out
.advice
);
595 strbuf_release(&out
.sb
);
601 int repo_for_each_abbrev(struct repository
*r
, const char *prefix
,
602 each_abbrev_fn fn
, void *cb_data
)
604 struct oid_array collect
= OID_ARRAY_INIT
;
605 struct disambiguate_state ds
;
608 if (init_object_disambiguation(r
, prefix
, strlen(prefix
), &ds
) < 0)
611 ds
.always_call_fn
= 1;
612 ds
.fn
= repo_collect_ambiguous
;
613 ds
.cb_data
= &collect
;
614 find_short_object_filename(&ds
);
615 find_short_packed_object(&ds
);
617 ret
= oid_array_for_each_unique(&collect
, fn
, cb_data
);
618 oid_array_clear(&collect
);
623 * Return the slot of the most-significant bit set in "val". There are various
624 * ways to do this quickly with fls() or __builtin_clzl(), but speed is
625 * probably not a big deal here.
627 static unsigned msb(unsigned long val
)
635 struct min_abbrev_data
{
636 unsigned int init_len
;
637 unsigned int cur_len
;
639 struct repository
*repo
;
640 const struct object_id
*oid
;
643 static inline char get_hex_char_from_oid(const struct object_id
*oid
,
646 static const char hex
[] = "0123456789abcdef";
649 return hex
[oid
->hash
[pos
>> 1] >> 4];
651 return hex
[oid
->hash
[pos
>> 1] & 0xf];
654 static int extend_abbrev_len(const struct object_id
*oid
, void *cb_data
)
656 struct min_abbrev_data
*mad
= cb_data
;
658 unsigned int i
= mad
->init_len
;
659 while (mad
->hex
[i
] && mad
->hex
[i
] == get_hex_char_from_oid(oid
, i
))
662 if (i
< GIT_MAX_RAWSZ
&& i
>= mad
->cur_len
)
663 mad
->cur_len
= i
+ 1;
668 static int repo_extend_abbrev_len(struct repository
*r
,
669 const struct object_id
*oid
,
672 return extend_abbrev_len(oid
, cb_data
);
675 static void find_abbrev_len_for_midx(struct multi_pack_index
*m
,
676 struct min_abbrev_data
*mad
)
679 uint32_t num
, first
= 0;
680 struct object_id oid
;
681 const struct object_id
*mad_oid
;
686 num
= m
->num_objects
;
688 match
= bsearch_midx(mad_oid
, m
, &first
);
691 * first is now the position in the packfile where we would insert
692 * mad->hash if it does not exist (or the position of mad->hash if
693 * it does exist). Hence, we consider a maximum of two objects
694 * nearby for the abbreviation length.
698 if (nth_midxed_object_oid(&oid
, m
, first
))
699 extend_abbrev_len(&oid
, mad
);
700 } else if (first
< num
- 1) {
701 if (nth_midxed_object_oid(&oid
, m
, first
+ 1))
702 extend_abbrev_len(&oid
, mad
);
705 if (nth_midxed_object_oid(&oid
, m
, first
- 1))
706 extend_abbrev_len(&oid
, mad
);
708 mad
->init_len
= mad
->cur_len
;
711 static void find_abbrev_len_for_pack(struct packed_git
*p
,
712 struct min_abbrev_data
*mad
)
715 uint32_t num
, first
= 0;
716 struct object_id oid
;
717 const struct object_id
*mad_oid
;
719 if (p
->multi_pack_index
)
722 if (open_pack_index(p
) || !p
->num_objects
)
725 num
= p
->num_objects
;
727 match
= bsearch_pack(mad_oid
, p
, &first
);
730 * first is now the position in the packfile where we would insert
731 * mad->hash if it does not exist (or the position of mad->hash if
732 * it does exist). Hence, we consider a maximum of two objects
733 * nearby for the abbreviation length.
737 if (!nth_packed_object_id(&oid
, p
, first
))
738 extend_abbrev_len(&oid
, mad
);
739 } else if (first
< num
- 1) {
740 if (!nth_packed_object_id(&oid
, p
, first
+ 1))
741 extend_abbrev_len(&oid
, mad
);
744 if (!nth_packed_object_id(&oid
, p
, first
- 1))
745 extend_abbrev_len(&oid
, mad
);
747 mad
->init_len
= mad
->cur_len
;
750 static void find_abbrev_len_packed(struct min_abbrev_data
*mad
)
752 struct multi_pack_index
*m
;
753 struct packed_git
*p
;
755 for (m
= get_multi_pack_index(mad
->repo
); m
; m
= m
->next
)
756 find_abbrev_len_for_midx(m
, mad
);
757 for (p
= get_packed_git(mad
->repo
); p
; p
= p
->next
)
758 find_abbrev_len_for_pack(p
, mad
);
761 int repo_find_unique_abbrev_r(struct repository
*r
, char *hex
,
762 const struct object_id
*oid
, int len
)
764 struct disambiguate_state ds
;
765 struct min_abbrev_data mad
;
766 struct object_id oid_ret
;
767 const unsigned hexsz
= r
->hash_algo
->hexsz
;
770 unsigned long count
= repo_approximate_object_count(r
);
772 * Add one because the MSB only tells us the highest bit set,
773 * not including the value of all the _other_ bits (so "15"
774 * is only one off of 2^4, but the MSB is the 3rd bit.
776 len
= msb(count
) + 1;
778 * We now know we have on the order of 2^len objects, which
779 * expects a collision at 2^(len/2). But we also care about hex
780 * chars, not bits, and there are 4 bits per hex. So all
781 * together we need to divide by 2 and round up.
783 len
= DIV_ROUND_UP(len
, 2);
785 * For very small repos, we stick with our regular fallback.
787 if (len
< FALLBACK_DEFAULT_ABBREV
)
788 len
= FALLBACK_DEFAULT_ABBREV
;
791 oid_to_hex_r(hex
, oid
);
792 if (len
== hexsz
|| !len
)
801 find_abbrev_len_packed(&mad
);
803 if (init_object_disambiguation(r
, hex
, mad
.cur_len
, &ds
) < 0)
806 ds
.fn
= repo_extend_abbrev_len
;
807 ds
.always_call_fn
= 1;
808 ds
.cb_data
= (void *)&mad
;
810 find_short_object_filename(&ds
);
811 (void)finish_object_disambiguation(&ds
, &oid_ret
);
813 hex
[mad
.cur_len
] = 0;
817 const char *repo_find_unique_abbrev(struct repository
*r
,
818 const struct object_id
*oid
,
822 static char hexbuffer
[4][GIT_MAX_HEXSZ
+ 1];
823 char *hex
= hexbuffer
[bufno
];
824 bufno
= (bufno
+ 1) % ARRAY_SIZE(hexbuffer
);
825 repo_find_unique_abbrev_r(r
, hex
, oid
, len
);
829 static int ambiguous_path(const char *path
, int len
)
834 for (cnt
= 0; cnt
< len
; cnt
++) {
854 static inline int at_mark(const char *string
, int len
,
855 const char **suffix
, int nr
)
859 for (i
= 0; i
< nr
; i
++) {
860 int suffix_len
= strlen(suffix
[i
]);
861 if (suffix_len
<= len
862 && !strncasecmp(string
, suffix
[i
], suffix_len
))
868 static inline int upstream_mark(const char *string
, int len
)
870 const char *suffix
[] = { "@{upstream}", "@{u}" };
871 return at_mark(string
, len
, suffix
, ARRAY_SIZE(suffix
));
874 static inline int push_mark(const char *string
, int len
)
876 const char *suffix
[] = { "@{push}" };
877 return at_mark(string
, len
, suffix
, ARRAY_SIZE(suffix
));
880 static enum get_oid_result
get_oid_1(struct repository
*r
, const char *name
, int len
, struct object_id
*oid
, unsigned lookup_flags
);
881 static int interpret_nth_prior_checkout(struct repository
*r
, const char *name
, int namelen
, struct strbuf
*buf
);
883 static int get_oid_basic(struct repository
*r
, const char *str
, int len
,
884 struct object_id
*oid
, unsigned int flags
)
886 static const char *warn_msg
= "refname '%.*s' is ambiguous.";
887 static const char *object_name_msg
= N_(
888 "Git normally never creates a ref that ends with 40 hex characters\n"
889 "because it will be ignored when you just specify 40-hex. These refs\n"
890 "may be created by mistake. For example,\n"
892 " git switch -c $br $(git rev-parse ...)\n"
894 "where \"$br\" is somehow empty and a 40-hex ref is created. Please\n"
895 "examine these refs and maybe delete them. Turn this message off by\n"
896 "running \"git config advice.objectNameWarning false\"");
897 struct object_id tmp_oid
;
898 char *real_ref
= NULL
;
900 int at
, reflog_len
, nth_prior
= 0;
901 int fatal
= !(flags
& GET_OID_QUIETLY
);
903 if (len
== r
->hash_algo
->hexsz
&& !get_oid_hex(str
, oid
)) {
904 if (warn_ambiguous_refs
&& warn_on_object_refname_ambiguity
) {
905 refs_found
= repo_dwim_ref(r
, str
, len
, &tmp_oid
, &real_ref
, 0);
906 if (refs_found
> 0) {
907 warning(warn_msg
, len
, str
);
908 if (advice_enabled(ADVICE_OBJECT_NAME_WARNING
))
909 fprintf(stderr
, "%s\n", _(object_name_msg
));
916 /* basic@{time or number or -number} format to query ref-log */
918 if (len
&& str
[len
-1] == '}') {
919 for (at
= len
-4; at
>= 0; at
--) {
920 if (str
[at
] == '@' && str
[at
+1] == '{') {
921 if (str
[at
+2] == '-') {
923 /* @{-N} not at start */
928 if (!upstream_mark(str
+ at
, len
- at
) &&
929 !push_mark(str
+ at
, len
- at
)) {
930 reflog_len
= (len
-1) - (at
+2);
938 /* Accept only unambiguous ref paths. */
939 if (len
&& ambiguous_path(str
, len
))
943 struct strbuf buf
= STRBUF_INIT
;
946 if (interpret_nth_prior_checkout(r
, str
, len
, &buf
) > 0) {
947 detached
= (buf
.len
== r
->hash_algo
->hexsz
&& !get_oid_hex(buf
.buf
, oid
));
948 strbuf_release(&buf
);
954 if (!len
&& reflog_len
)
955 /* allow "@{...}" to mean the current branch reflog */
956 refs_found
= repo_dwim_ref(r
, "HEAD", 4, oid
, &real_ref
, !fatal
);
958 refs_found
= repo_dwim_log(r
, str
, len
, oid
, &real_ref
);
960 refs_found
= repo_dwim_ref(r
, str
, len
, oid
, &real_ref
, !fatal
);
965 if (warn_ambiguous_refs
&& !(flags
& GET_OID_QUIETLY
) &&
967 !get_short_oid(r
, str
, len
, &tmp_oid
, GET_OID_QUIETLY
)))
968 warning(warn_msg
, len
, str
);
976 /* Is it asking for N-th entry, or approxidate? */
977 for (i
= nth
= 0; 0 <= nth
&& i
< reflog_len
; i
++) {
978 char ch
= str
[at
+2+i
];
979 if ('0' <= ch
&& ch
<= '9')
980 nth
= nth
* 10 + ch
- '0';
984 if (100000000 <= nth
) {
991 char *tmp
= xstrndup(str
+ at
+ 2, reflog_len
);
992 at_time
= approxidate_careful(tmp
, &errors
);
999 if (read_ref_at(get_main_ref_store(r
),
1000 real_ref
, flags
, at_time
, nth
, oid
, NULL
,
1001 &co_time
, &co_tz
, &co_cnt
)) {
1003 if (!skip_prefix(real_ref
, "refs/heads/", &str
))
1008 if (!(flags
& GET_OID_QUIETLY
)) {
1009 warning(_("log for '%.*s' only goes back to %s"),
1011 show_date(co_time
, co_tz
, DATE_MODE(RFC2822
)));
1014 if (flags
& GET_OID_QUIETLY
) {
1017 die(_("log for '%.*s' only has %d entries"),
1027 static enum get_oid_result
get_parent(struct repository
*r
,
1028 const char *name
, int len
,
1029 struct object_id
*result
, int idx
)
1031 struct object_id oid
;
1032 enum get_oid_result ret
= get_oid_1(r
, name
, len
, &oid
,
1033 GET_OID_COMMITTISH
);
1034 struct commit
*commit
;
1035 struct commit_list
*p
;
1039 commit
= lookup_commit_reference(r
, &oid
);
1040 if (parse_commit(commit
))
1041 return MISSING_OBJECT
;
1043 oidcpy(result
, &commit
->object
.oid
);
1046 p
= commit
->parents
;
1049 oidcpy(result
, &p
->item
->object
.oid
);
1054 return MISSING_OBJECT
;
1057 static enum get_oid_result
get_nth_ancestor(struct repository
*r
,
1058 const char *name
, int len
,
1059 struct object_id
*result
,
1062 struct object_id oid
;
1063 struct commit
*commit
;
1066 ret
= get_oid_1(r
, name
, len
, &oid
, GET_OID_COMMITTISH
);
1069 commit
= lookup_commit_reference(r
, &oid
);
1071 return MISSING_OBJECT
;
1073 while (generation
--) {
1074 if (parse_commit(commit
) || !commit
->parents
)
1075 return MISSING_OBJECT
;
1076 commit
= commit
->parents
->item
;
1078 oidcpy(result
, &commit
->object
.oid
);
1082 struct object
*repo_peel_to_type(struct repository
*r
, const char *name
, int namelen
,
1083 struct object
*o
, enum object_type expected_type
)
1085 if (name
&& !namelen
)
1086 namelen
= strlen(name
);
1088 if (!o
|| (!o
->parsed
&& !parse_object(r
, &o
->oid
)))
1090 if (expected_type
== OBJ_ANY
|| o
->type
== expected_type
)
1092 if (o
->type
== OBJ_TAG
)
1093 o
= ((struct tag
*) o
)->tagged
;
1094 else if (o
->type
== OBJ_COMMIT
)
1095 o
= &(repo_get_commit_tree(r
, ((struct commit
*)o
))->object
);
1098 error("%.*s: expected %s type, but the object "
1099 "dereferences to %s type",
1100 namelen
, name
, type_name(expected_type
),
1101 type_name(o
->type
));
1107 static int peel_onion(struct repository
*r
, const char *name
, int len
,
1108 struct object_id
*oid
, unsigned lookup_flags
)
1110 struct object_id outer
;
1112 unsigned int expected_type
= 0;
1116 * "ref^{type}" dereferences ref repeatedly until you cannot
1117 * dereference anymore, or you get an object of given type,
1118 * whichever comes first. "ref^{}" means just dereference
1119 * tags until you get a non-tag. "ref^0" is a shorthand for
1120 * "ref^{commit}". "commit^{tree}" could be used to find the
1121 * top-level tree of the given commit.
1123 if (len
< 4 || name
[len
-1] != '}')
1126 for (sp
= name
+ len
- 1; name
<= sp
; sp
--) {
1128 if (ch
== '{' && name
< sp
&& sp
[-1] == '^')
1134 sp
++; /* beginning of type name, or closing brace for empty */
1135 if (starts_with(sp
, "commit}"))
1136 expected_type
= OBJ_COMMIT
;
1137 else if (starts_with(sp
, "tag}"))
1138 expected_type
= OBJ_TAG
;
1139 else if (starts_with(sp
, "tree}"))
1140 expected_type
= OBJ_TREE
;
1141 else if (starts_with(sp
, "blob}"))
1142 expected_type
= OBJ_BLOB
;
1143 else if (starts_with(sp
, "object}"))
1144 expected_type
= OBJ_ANY
;
1145 else if (sp
[0] == '}')
1146 expected_type
= OBJ_NONE
;
1147 else if (sp
[0] == '/')
1148 expected_type
= OBJ_COMMIT
;
1152 lookup_flags
&= ~GET_OID_DISAMBIGUATORS
;
1153 if (expected_type
== OBJ_COMMIT
)
1154 lookup_flags
|= GET_OID_COMMITTISH
;
1155 else if (expected_type
== OBJ_TREE
)
1156 lookup_flags
|= GET_OID_TREEISH
;
1158 if (get_oid_1(r
, name
, sp
- name
- 2, &outer
, lookup_flags
))
1161 o
= parse_object(r
, &outer
);
1164 if (!expected_type
) {
1165 o
= deref_tag(r
, o
, name
, sp
- name
- 2);
1166 if (!o
|| (!o
->parsed
&& !parse_object(r
, &o
->oid
)))
1168 oidcpy(oid
, &o
->oid
);
1173 * At this point, the syntax look correct, so
1174 * if we do not get the needed object, we should
1177 o
= repo_peel_to_type(r
, name
, len
, o
, expected_type
);
1181 oidcpy(oid
, &o
->oid
);
1183 /* "$commit^{/foo}" */
1186 struct commit_list
*list
= NULL
;
1189 * $commit^{/}. Some regex implementation may reject.
1190 * We don't need regex anyway. '' pattern always matches.
1195 prefix
= xstrndup(sp
+ 1, name
+ len
- 1 - (sp
+ 1));
1196 commit_list_insert((struct commit
*)o
, &list
);
1197 ret
= get_oid_oneline(r
, prefix
, oid
, list
);
1204 static int get_describe_name(struct repository
*r
,
1205 const char *name
, int len
,
1206 struct object_id
*oid
)
1209 unsigned flags
= GET_OID_QUIETLY
| GET_OID_COMMIT
;
1211 for (cp
= name
+ len
- 1; name
+ 2 <= cp
; cp
--) {
1213 if (!isxdigit(ch
)) {
1214 /* We must be looking at g in "SOMETHING-g"
1215 * for it to be describe output.
1217 if (ch
== 'g' && cp
[-1] == '-') {
1220 return get_short_oid(r
,
1221 cp
, len
, oid
, flags
);
1228 static enum get_oid_result
get_oid_1(struct repository
*r
,
1229 const char *name
, int len
,
1230 struct object_id
*oid
,
1231 unsigned lookup_flags
)
1233 int ret
, has_suffix
;
1237 * "name~3" is "name^^^", "name~" is "name~1", and "name^" is "name^1".
1240 for (cp
= name
+ len
- 1; name
<= cp
; cp
--) {
1242 if ('0' <= ch
&& ch
<= '9')
1244 if (ch
== '~' || ch
== '^')
1250 unsigned int num
= 0;
1251 int len1
= cp
- name
;
1253 while (cp
< name
+ len
) {
1254 unsigned int digit
= *cp
++ - '0';
1255 if (unsigned_mult_overflows(num
, 10))
1256 return MISSING_OBJECT
;
1258 if (unsigned_add_overflows(num
, digit
))
1259 return MISSING_OBJECT
;
1262 if (!num
&& len1
== len
- 1)
1264 else if (num
> INT_MAX
)
1265 return MISSING_OBJECT
;
1266 if (has_suffix
== '^')
1267 return get_parent(r
, name
, len1
, oid
, num
);
1268 /* else if (has_suffix == '~') -- goes without saying */
1269 return get_nth_ancestor(r
, name
, len1
, oid
, num
);
1272 ret
= peel_onion(r
, name
, len
, oid
, lookup_flags
);
1276 ret
= get_oid_basic(r
, name
, len
, oid
, lookup_flags
);
1280 /* It could be describe output that is "SOMETHING-gXXXX" */
1281 ret
= get_describe_name(r
, name
, len
, oid
);
1285 return get_short_oid(r
, name
, len
, oid
, lookup_flags
);
1289 * This interprets names like ':/Initial revision of "git"' by searching
1290 * through history and returning the first commit whose message starts
1291 * the given regular expression.
1293 * For negative-matching, prefix the pattern-part with '!-', like: ':/!-WIP'.
1295 * For a literal '!' character at the beginning of a pattern, you have to repeat
1296 * that, like: ':/!!foo'
1298 * For future extension, all other sequences beginning with ':/!' are reserved.
1301 /* Remember to update object flag allocation in object.h */
1302 #define ONELINE_SEEN (1u<<20)
1304 struct handle_one_ref_cb
{
1305 struct repository
*repo
;
1306 struct commit_list
**list
;
1309 static int handle_one_ref(const char *path
, const struct object_id
*oid
,
1313 struct handle_one_ref_cb
*cb
= cb_data
;
1314 struct commit_list
**list
= cb
->list
;
1315 struct object
*object
= parse_object(cb
->repo
, oid
);
1318 if (object
->type
== OBJ_TAG
) {
1319 object
= deref_tag(cb
->repo
, object
, path
,
1324 if (object
->type
!= OBJ_COMMIT
)
1326 commit_list_insert((struct commit
*)object
, list
);
1330 static int get_oid_oneline(struct repository
*r
,
1331 const char *prefix
, struct object_id
*oid
,
1332 struct commit_list
*list
)
1334 struct commit_list
*backup
= NULL
, *l
;
1339 if (prefix
[0] == '!') {
1342 if (prefix
[0] == '-') {
1345 } else if (prefix
[0] != '!') {
1350 if (regcomp(®ex
, prefix
, REG_EXTENDED
))
1353 for (l
= list
; l
; l
= l
->next
) {
1354 l
->item
->object
.flags
|= ONELINE_SEEN
;
1355 commit_list_insert(l
->item
, &backup
);
1358 const char *p
, *buf
;
1359 struct commit
*commit
;
1362 commit
= pop_most_recent_commit(&list
, ONELINE_SEEN
);
1363 if (!parse_object(r
, &commit
->object
.oid
))
1365 buf
= get_commit_buffer(commit
, NULL
);
1366 p
= strstr(buf
, "\n\n");
1367 matches
= negative
^ (p
&& !regexec(®ex
, p
+ 2, 0, NULL
, 0));
1368 unuse_commit_buffer(commit
, buf
);
1371 oidcpy(oid
, &commit
->object
.oid
);
1377 free_commit_list(list
);
1378 for (l
= backup
; l
; l
= l
->next
)
1379 clear_commit_marks(l
->item
, ONELINE_SEEN
);
1380 free_commit_list(backup
);
1381 return found
? 0 : -1;
1384 struct grab_nth_branch_switch_cbdata
{
1389 static int grab_nth_branch_switch(struct object_id
*ooid UNUSED
,
1390 struct object_id
*noid UNUSED
,
1391 const char *email UNUSED
,
1392 timestamp_t timestamp UNUSED
,
1394 const char *message
, void *cb_data
)
1396 struct grab_nth_branch_switch_cbdata
*cb
= cb_data
;
1397 const char *match
= NULL
, *target
= NULL
;
1400 if (skip_prefix(message
, "checkout: moving from ", &match
))
1401 target
= strstr(match
, " to ");
1403 if (!match
|| !target
)
1405 if (--(cb
->remaining
) == 0) {
1406 len
= target
- match
;
1407 strbuf_reset(cb
->sb
);
1408 strbuf_add(cb
->sb
, match
, len
);
1409 return 1; /* we are done */
1415 * Parse @{-N} syntax, return the number of characters parsed
1416 * if successful; otherwise signal an error with negative value.
1418 static int interpret_nth_prior_checkout(struct repository
*r
,
1419 const char *name
, int namelen
,
1424 struct grab_nth_branch_switch_cbdata cb
;
1430 if (name
[0] != '@' || name
[1] != '{' || name
[2] != '-')
1432 brace
= memchr(name
, '}', namelen
);
1435 nth
= strtol(name
+ 3, &num_end
, 10);
1436 if (num_end
!= brace
)
1443 retval
= refs_for_each_reflog_ent_reverse(get_main_ref_store(r
),
1444 "HEAD", grab_nth_branch_switch
, &cb
);
1446 retval
= brace
- name
+ 1;
1453 int repo_get_oid_mb(struct repository
*r
,
1455 struct object_id
*oid
)
1457 struct commit
*one
, *two
;
1458 struct commit_list
*mbs
;
1459 struct object_id oid_tmp
;
1463 dots
= strstr(name
, "...");
1465 return repo_get_oid(r
, name
, oid
);
1467 st
= repo_get_oid(r
, "HEAD", &oid_tmp
);
1470 strbuf_init(&sb
, dots
- name
);
1471 strbuf_add(&sb
, name
, dots
- name
);
1472 st
= repo_get_oid_committish(r
, sb
.buf
, &oid_tmp
);
1473 strbuf_release(&sb
);
1477 one
= lookup_commit_reference_gently(r
, &oid_tmp
, 0);
1481 if (repo_get_oid_committish(r
, dots
[3] ? (dots
+ 3) : "HEAD", &oid_tmp
))
1483 two
= lookup_commit_reference_gently(r
, &oid_tmp
, 0);
1486 mbs
= repo_get_merge_bases(r
, one
, two
);
1487 if (!mbs
|| mbs
->next
)
1491 oidcpy(oid
, &mbs
->item
->object
.oid
);
1493 free_commit_list(mbs
);
1497 /* parse @something syntax, when 'something' is not {.*} */
1498 static int interpret_empty_at(const char *name
, int namelen
, int len
, struct strbuf
*buf
)
1502 if (len
|| name
[1] == '{')
1505 /* make sure it's a single @, or @@{.*}, not @foo */
1506 next
= memchr(name
+ len
+ 1, '@', namelen
- len
- 1);
1507 if (next
&& next
[1] != '{')
1510 next
= name
+ namelen
;
1511 if (next
!= name
+ 1)
1515 strbuf_add(buf
, "HEAD", 4);
1519 static int reinterpret(struct repository
*r
,
1520 const char *name
, int namelen
, int len
,
1521 struct strbuf
*buf
, unsigned allowed
)
1523 /* we have extra data, which might need further processing */
1524 struct strbuf tmp
= STRBUF_INIT
;
1525 int used
= buf
->len
;
1527 struct interpret_branch_name_options options
= {
1531 strbuf_add(buf
, name
+ len
, namelen
- len
);
1532 ret
= repo_interpret_branch_name(r
, buf
->buf
, buf
->len
, &tmp
, &options
);
1533 /* that data was not interpreted, remove our cruft */
1535 strbuf_setlen(buf
, used
);
1539 strbuf_addbuf(buf
, &tmp
);
1540 strbuf_release(&tmp
);
1541 /* tweak for size of {-N} versus expanded ref name */
1542 return ret
- used
+ len
;
1545 static void set_shortened_ref(struct repository
*r
, struct strbuf
*buf
, const char *ref
)
1547 char *s
= refs_shorten_unambiguous_ref(get_main_ref_store(r
), ref
, 0);
1549 strbuf_addstr(buf
, s
);
1553 static int branch_interpret_allowed(const char *refname
, unsigned allowed
)
1558 if ((allowed
& INTERPRET_BRANCH_LOCAL
) &&
1559 starts_with(refname
, "refs/heads/"))
1561 if ((allowed
& INTERPRET_BRANCH_REMOTE
) &&
1562 starts_with(refname
, "refs/remotes/"))
1568 static int interpret_branch_mark(struct repository
*r
,
1569 const char *name
, int namelen
,
1570 int at
, struct strbuf
*buf
,
1571 int (*get_mark
)(const char *, int),
1572 const char *(*get_data
)(struct branch
*,
1574 const struct interpret_branch_name_options
*options
)
1577 struct branch
*branch
;
1578 struct strbuf err
= STRBUF_INIT
;
1581 len
= get_mark(name
+ at
, namelen
- at
);
1585 if (memchr(name
, ':', at
))
1589 char *name_str
= xmemdupz(name
, at
);
1590 branch
= branch_get(name_str
);
1593 branch
= branch_get(NULL
);
1595 value
= get_data(branch
, &err
);
1597 if (options
->nonfatal_dangling_mark
) {
1598 strbuf_release(&err
);
1605 if (!branch_interpret_allowed(value
, options
->allowed
))
1608 set_shortened_ref(r
, buf
, value
);
1612 int repo_interpret_branch_name(struct repository
*r
,
1613 const char *name
, int namelen
,
1615 const struct interpret_branch_name_options
*options
)
1622 namelen
= strlen(name
);
1624 if (!options
->allowed
|| (options
->allowed
& INTERPRET_BRANCH_LOCAL
)) {
1625 len
= interpret_nth_prior_checkout(r
, name
, namelen
, buf
);
1627 return len
; /* syntax Ok, not enough switches */
1628 } else if (len
> 0) {
1630 return len
; /* consumed all */
1632 return reinterpret(r
, name
, namelen
, len
, buf
,
1638 (at
= memchr(start
, '@', namelen
- (start
- name
)));
1641 if (!options
->allowed
|| (options
->allowed
& INTERPRET_BRANCH_HEAD
)) {
1642 len
= interpret_empty_at(name
, namelen
, at
- name
, buf
);
1644 return reinterpret(r
, name
, namelen
, len
, buf
,
1648 len
= interpret_branch_mark(r
, name
, namelen
, at
- name
, buf
,
1649 upstream_mark
, branch_get_upstream
,
1654 len
= interpret_branch_mark(r
, name
, namelen
, at
- name
, buf
,
1655 push_mark
, branch_get_push
,
1664 void strbuf_branchname(struct strbuf
*sb
, const char *name
, unsigned allowed
)
1666 int len
= strlen(name
);
1667 struct interpret_branch_name_options options
= {
1670 int used
= interpret_branch_name(name
, len
, sb
, &options
);
1674 strbuf_add(sb
, name
+ used
, len
- used
);
1677 int strbuf_check_branch_ref(struct strbuf
*sb
, const char *name
)
1679 if (startup_info
->have_repository
)
1680 strbuf_branchname(sb
, name
, INTERPRET_BRANCH_LOCAL
);
1682 strbuf_addstr(sb
, name
);
1685 * This splice must be done even if we end up rejecting the
1686 * name; builtin/branch.c::copy_or_rename_branch() still wants
1687 * to see what the name expanded to so that "branch -m" can be
1688 * used as a tool to correct earlier mistakes.
1690 strbuf_splice(sb
, 0, 0, "refs/heads/", 11);
1693 !strcmp(sb
->buf
, "refs/heads/HEAD"))
1696 return check_refname_format(sb
->buf
, 0);
1700 * This is like "get_oid_basic()", except it allows "object ID expressions",
1701 * notably "xyz^" for "parent of xyz"
1703 int repo_get_oid(struct repository
*r
, const char *name
, struct object_id
*oid
)
1705 struct object_context unused
;
1706 return get_oid_with_context(r
, name
, 0, oid
, &unused
);
1710 * This returns a non-zero value if the string (built using printf
1711 * format and the given arguments) is not a valid object.
1713 int get_oidf(struct object_id
*oid
, const char *fmt
, ...)
1717 struct strbuf sb
= STRBUF_INIT
;
1720 strbuf_vaddf(&sb
, fmt
, ap
);
1723 ret
= get_oid(sb
.buf
, oid
);
1724 strbuf_release(&sb
);
1730 * Many callers know that the user meant to name a commit-ish by
1731 * syntactical positions where the object name appears. Calling this
1732 * function allows the machinery to disambiguate shorter-than-unique
1733 * abbreviated object names between commit-ish and others.
1735 * Note that this does NOT error out when the named object is not a
1736 * commit-ish. It is merely to give a hint to the disambiguation
1739 int repo_get_oid_committish(struct repository
*r
,
1741 struct object_id
*oid
)
1743 struct object_context unused
;
1744 return get_oid_with_context(r
, name
, GET_OID_COMMITTISH
,
1748 int repo_get_oid_treeish(struct repository
*r
,
1750 struct object_id
*oid
)
1752 struct object_context unused
;
1753 return get_oid_with_context(r
, name
, GET_OID_TREEISH
,
1757 int repo_get_oid_commit(struct repository
*r
,
1759 struct object_id
*oid
)
1761 struct object_context unused
;
1762 return get_oid_with_context(r
, name
, GET_OID_COMMIT
,
1766 int repo_get_oid_tree(struct repository
*r
,
1768 struct object_id
*oid
)
1770 struct object_context unused
;
1771 return get_oid_with_context(r
, name
, GET_OID_TREE
,
1775 int repo_get_oid_blob(struct repository
*r
,
1777 struct object_id
*oid
)
1779 struct object_context unused
;
1780 return get_oid_with_context(r
, name
, GET_OID_BLOB
,
1784 /* Must be called only when object_name:filename doesn't exist. */
1785 static void diagnose_invalid_oid_path(struct repository
*r
,
1787 const char *filename
,
1788 const struct object_id
*tree_oid
,
1789 const char *object_name
,
1790 int object_name_len
)
1792 struct object_id oid
;
1793 unsigned short mode
;
1798 if (file_exists(filename
))
1799 die(_("path '%s' exists on disk, but not in '%.*s'"),
1800 filename
, object_name_len
, object_name
);
1801 if (is_missing_file_error(errno
)) {
1802 char *fullname
= xstrfmt("%s%s", prefix
, filename
);
1804 if (!get_tree_entry(r
, tree_oid
, fullname
, &oid
, &mode
)) {
1805 die(_("path '%s' exists, but not '%s'\n"
1806 "hint: Did you mean '%.*s:%s' aka '%.*s:./%s'?"),
1809 object_name_len
, object_name
,
1811 object_name_len
, object_name
,
1814 die(_("path '%s' does not exist in '%.*s'"),
1815 filename
, object_name_len
, object_name
);
1819 /* Must be called only when :stage:filename doesn't exist. */
1820 static void diagnose_invalid_index_path(struct repository
*r
,
1823 const char *filename
)
1825 struct index_state
*istate
= r
->index
;
1826 const struct cache_entry
*ce
;
1828 unsigned namelen
= strlen(filename
);
1829 struct strbuf fullname
= STRBUF_INIT
;
1834 /* Wrong stage number? */
1835 pos
= index_name_pos(istate
, filename
, namelen
);
1838 if (pos
< istate
->cache_nr
) {
1839 ce
= istate
->cache
[pos
];
1840 if (!S_ISSPARSEDIR(ce
->ce_mode
) &&
1841 ce_namelen(ce
) == namelen
&&
1842 !memcmp(ce
->name
, filename
, namelen
))
1843 die(_("path '%s' is in the index, but not at stage %d\n"
1844 "hint: Did you mean ':%d:%s'?"),
1846 ce_stage(ce
), filename
);
1849 /* Confusion between relative and absolute filenames? */
1850 strbuf_addstr(&fullname
, prefix
);
1851 strbuf_addstr(&fullname
, filename
);
1852 pos
= index_name_pos(istate
, fullname
.buf
, fullname
.len
);
1855 if (pos
< istate
->cache_nr
) {
1856 ce
= istate
->cache
[pos
];
1857 if (!S_ISSPARSEDIR(ce
->ce_mode
) &&
1858 ce_namelen(ce
) == fullname
.len
&&
1859 !memcmp(ce
->name
, fullname
.buf
, fullname
.len
))
1860 die(_("path '%s' is in the index, but not '%s'\n"
1861 "hint: Did you mean ':%d:%s' aka ':%d:./%s'?"),
1862 fullname
.buf
, filename
,
1863 ce_stage(ce
), fullname
.buf
,
1864 ce_stage(ce
), filename
);
1867 if (repo_file_exists(r
, filename
))
1868 die(_("path '%s' exists on disk, but not in the index"), filename
);
1869 if (is_missing_file_error(errno
))
1870 die(_("path '%s' does not exist (neither on disk nor in the index)"),
1873 strbuf_release(&fullname
);
1877 static char *resolve_relative_path(struct repository
*r
, const char *rel
)
1879 if (!starts_with(rel
, "./") && !starts_with(rel
, "../"))
1882 if (r
!= the_repository
|| !is_inside_work_tree())
1883 die(_("relative path syntax can't be used outside working tree"));
1885 /* die() inside prefix_path() if resolved path is outside worktree */
1886 return prefix_path(startup_info
->prefix
,
1887 startup_info
->prefix
? strlen(startup_info
->prefix
) : 0,
1891 static int reject_tree_in_index(struct repository
*repo
,
1893 const struct cache_entry
*ce
,
1898 if (!S_ISSPARSEDIR(ce
->ce_mode
))
1901 diagnose_invalid_index_path(repo
, stage
, prefix
, cp
);
1905 static enum get_oid_result
get_oid_with_context_1(struct repository
*repo
,
1909 struct object_id
*oid
,
1910 struct object_context
*oc
)
1912 int ret
, bracket_depth
;
1913 int namelen
= strlen(name
);
1915 int only_to_die
= flags
& GET_OID_ONLY_TO_DIE
;
1917 memset(oc
, 0, sizeof(*oc
));
1918 oc
->mode
= S_IFINVALID
;
1919 strbuf_init(&oc
->symlink_path
, 0);
1920 ret
= get_oid_1(repo
, name
, namelen
, oid
, flags
);
1921 if (!ret
&& flags
& GET_OID_REQUIRE_PATH
)
1922 die(_("<object>:<path> required, only <object> '%s' given"),
1927 * tree:path --> object name of path in tree
1928 * :path -> object name of absolute path in index
1929 * :./path -> object name of path relative to cwd in index
1930 * :[0-3]:path -> object name of path in index at stage
1931 * :/foo -> recent commit matching foo
1933 if (name
[0] == ':') {
1935 const struct cache_entry
*ce
;
1936 char *new_path
= NULL
;
1938 if (!only_to_die
&& namelen
> 2 && name
[1] == '/') {
1939 struct handle_one_ref_cb cb
;
1940 struct commit_list
*list
= NULL
;
1944 refs_for_each_ref(get_main_ref_store(repo
), handle_one_ref
, &cb
);
1945 refs_head_ref(get_main_ref_store(repo
), handle_one_ref
, &cb
);
1946 commit_list_sort_by_date(&list
);
1947 return get_oid_oneline(repo
, name
+ 2, oid
, list
);
1951 name
[1] < '0' || '3' < name
[1])
1954 stage
= name
[1] - '0';
1957 new_path
= resolve_relative_path(repo
, cp
);
1959 namelen
= namelen
- (cp
- name
);
1962 namelen
= strlen(cp
);
1965 if (flags
& GET_OID_RECORD_PATH
)
1966 oc
->path
= xstrdup(cp
);
1968 if (!repo
->index
|| !repo
->index
->cache
)
1969 repo_read_index(repo
);
1970 pos
= index_name_pos(repo
->index
, cp
, namelen
);
1973 while (pos
< repo
->index
->cache_nr
) {
1974 ce
= repo
->index
->cache
[pos
];
1975 if (ce_namelen(ce
) != namelen
||
1976 memcmp(ce
->name
, cp
, namelen
))
1978 if (ce_stage(ce
) == stage
) {
1980 if (reject_tree_in_index(repo
, only_to_die
, ce
,
1983 oidcpy(oid
, &ce
->oid
);
1984 oc
->mode
= ce
->ce_mode
;
1989 if (only_to_die
&& name
[1] && name
[1] != '/')
1990 diagnose_invalid_index_path(repo
, stage
, prefix
, cp
);
1994 for (cp
= name
, bracket_depth
= 0; *cp
; cp
++) {
1997 else if (bracket_depth
&& *cp
== '}')
1999 else if (!bracket_depth
&& *cp
== ':')
2003 struct object_id tree_oid
;
2004 int len
= cp
- name
;
2005 unsigned sub_flags
= flags
;
2007 sub_flags
&= ~GET_OID_DISAMBIGUATORS
;
2008 sub_flags
|= GET_OID_TREEISH
;
2010 if (!get_oid_1(repo
, name
, len
, &tree_oid
, sub_flags
)) {
2011 const char *filename
= cp
+1;
2012 char *new_filename
= NULL
;
2014 new_filename
= resolve_relative_path(repo
, filename
);
2016 filename
= new_filename
;
2017 if (flags
& GET_OID_FOLLOW_SYMLINKS
) {
2018 ret
= get_tree_entry_follow_symlinks(repo
, &tree_oid
,
2019 filename
, oid
, &oc
->symlink_path
,
2022 ret
= get_tree_entry(repo
, &tree_oid
, filename
, oid
,
2024 if (ret
&& only_to_die
) {
2025 diagnose_invalid_oid_path(repo
, prefix
,
2031 if (flags
& GET_OID_RECORD_PATH
)
2032 oc
->path
= xstrdup(filename
);
2038 die(_("invalid object name '%.*s'."), len
, name
);
2045 * Call this function when you know "name" given by the end user must
2046 * name an object but it doesn't; the function _may_ die with a better
2047 * diagnostic message than "no such object 'name'", e.g. "Path 'doc' does not
2048 * exist in 'HEAD'" when given "HEAD:doc", or it may return in which case
2049 * you have a chance to diagnose the error further.
2051 void maybe_die_on_misspelt_object_name(struct repository
*r
,
2055 struct object_context oc
;
2056 struct object_id oid
;
2057 get_oid_with_context_1(r
, name
, GET_OID_ONLY_TO_DIE
| GET_OID_QUIETLY
,
2061 enum get_oid_result
get_oid_with_context(struct repository
*repo
,
2064 struct object_id
*oid
,
2065 struct object_context
*oc
)
2067 if (flags
& GET_OID_FOLLOW_SYMLINKS
&& flags
& GET_OID_ONLY_TO_DIE
)
2068 BUG("incompatible flags for get_oid_with_context");
2069 return get_oid_with_context_1(repo
, str
, flags
, NULL
, oid
, oc
);