зеркало из https://github.com/microsoft/git.git
object-name.c: rename from sha1-name.c
Generalize the last remnants of "sha" and "sha1" in this file and rename it to reflect that we're not just able to handle SHA-1 these days. We need to update one test to check for an updated error string. Signed-off-by: Martin Ågren <martin.agren@gmail.com> Reviewed-by: Derrick Stolee <dstolee@microsoft.com> Signed-off-by: Junio C Hamano <gitster@pobox.com>
This commit is contained in:
Родитель
71ca53e812
Коммит
1e6771e504
2
Makefile
2
Makefile
|
@ -937,6 +937,7 @@ LIB_OBJS += notes-cache.o
|
||||||
LIB_OBJS += notes-merge.o
|
LIB_OBJS += notes-merge.o
|
||||||
LIB_OBJS += notes-utils.o
|
LIB_OBJS += notes-utils.o
|
||||||
LIB_OBJS += notes.o
|
LIB_OBJS += notes.o
|
||||||
|
LIB_OBJS += object-name.o
|
||||||
LIB_OBJS += object.o
|
LIB_OBJS += object.o
|
||||||
LIB_OBJS += oid-array.o
|
LIB_OBJS += oid-array.o
|
||||||
LIB_OBJS += oidmap.o
|
LIB_OBJS += oidmap.o
|
||||||
|
@ -995,7 +996,6 @@ LIB_OBJS += server-info.o
|
||||||
LIB_OBJS += setup.o
|
LIB_OBJS += setup.o
|
||||||
LIB_OBJS += sha1-file.o
|
LIB_OBJS += sha1-file.o
|
||||||
LIB_OBJS += sha1-lookup.o
|
LIB_OBJS += sha1-lookup.o
|
||||||
LIB_OBJS += sha1-name.o
|
|
||||||
LIB_OBJS += shallow.o
|
LIB_OBJS += shallow.o
|
||||||
LIB_OBJS += sideband.o
|
LIB_OBJS += sideband.o
|
||||||
LIB_OBJS += sigchain.o
|
LIB_OBJS += sigchain.o
|
||||||
|
|
|
@ -21,7 +21,7 @@
|
||||||
* in the traversal (until we mark it SEEN). This is a way to
|
* in the traversal (until we mark it SEEN). This is a way to
|
||||||
* let us silently de-dup calls to show() in the caller. This
|
* let us silently de-dup calls to show() in the caller. This
|
||||||
* is subtly different from the "revision.h:SHOWN" and the
|
* is subtly different from the "revision.h:SHOWN" and the
|
||||||
* "sha1-name.c:ONELINE_SEEN" bits. And also different from
|
* "object-name.c:ONELINE_SEEN" bits. And also different from
|
||||||
* the non-de-dup usage in pack-bitmap.c
|
* the non-de-dup usage in pack-bitmap.c
|
||||||
*/
|
*/
|
||||||
#define FILTER_SHOWN_BUT_REVISIT (1<<21)
|
#define FILTER_SHOWN_BUT_REVISIT (1<<21)
|
||||||
|
|
|
@ -85,7 +85,7 @@ static void update_candidates(struct disambiguate_state *ds, const struct object
|
||||||
/* otherwise, current can be discarded and candidate is still good */
|
/* otherwise, current can be discarded and candidate is still good */
|
||||||
}
|
}
|
||||||
|
|
||||||
static int match_sha(unsigned, const unsigned char *, const unsigned char *);
|
static int match_hash(unsigned, const unsigned char *, const unsigned char *);
|
||||||
|
|
||||||
static void find_short_object_filename(struct disambiguate_state *ds)
|
static void find_short_object_filename(struct disambiguate_state *ds)
|
||||||
{
|
{
|
||||||
|
@ -102,7 +102,7 @@ static void find_short_object_filename(struct disambiguate_state *ds)
|
||||||
while (!ds->ambiguous && pos < loose_objects->nr) {
|
while (!ds->ambiguous && pos < loose_objects->nr) {
|
||||||
const struct object_id *oid;
|
const struct object_id *oid;
|
||||||
oid = loose_objects->oid + pos;
|
oid = loose_objects->oid + pos;
|
||||||
if (!match_sha(ds->len, ds->bin_pfx.hash, oid->hash))
|
if (!match_hash(ds->len, ds->bin_pfx.hash, oid->hash))
|
||||||
break;
|
break;
|
||||||
update_candidates(ds, oid);
|
update_candidates(ds, oid);
|
||||||
pos++;
|
pos++;
|
||||||
|
@ -110,7 +110,7 @@ static void find_short_object_filename(struct disambiguate_state *ds)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
static int match_sha(unsigned len, const unsigned char *a, const unsigned char *b)
|
static int match_hash(unsigned len, const unsigned char *a, const unsigned char *b)
|
||||||
{
|
{
|
||||||
do {
|
do {
|
||||||
if (*a != *b)
|
if (*a != *b)
|
||||||
|
@ -145,7 +145,7 @@ static void unique_in_midx(struct multi_pack_index *m,
|
||||||
for (i = first; i < num && !ds->ambiguous; i++) {
|
for (i = first; i < num && !ds->ambiguous; i++) {
|
||||||
struct object_id oid;
|
struct object_id oid;
|
||||||
current = nth_midxed_object_oid(&oid, m, i);
|
current = nth_midxed_object_oid(&oid, m, i);
|
||||||
if (!match_sha(ds->len, ds->bin_pfx.hash, current->hash))
|
if (!match_hash(ds->len, ds->bin_pfx.hash, current->hash))
|
||||||
break;
|
break;
|
||||||
update_candidates(ds, current);
|
update_candidates(ds, current);
|
||||||
}
|
}
|
||||||
|
@ -173,7 +173,7 @@ static void unique_in_pack(struct packed_git *p,
|
||||||
for (i = first; i < num && !ds->ambiguous; i++) {
|
for (i = first; i < num && !ds->ambiguous; i++) {
|
||||||
struct object_id oid;
|
struct object_id oid;
|
||||||
nth_packed_object_id(&oid, p, i);
|
nth_packed_object_id(&oid, p, i);
|
||||||
if (!match_sha(ds->len, ds->bin_pfx.hash, oid.hash))
|
if (!match_hash(ds->len, ds->bin_pfx.hash, oid.hash))
|
||||||
break;
|
break;
|
||||||
update_candidates(ds, &oid);
|
update_candidates(ds, &oid);
|
||||||
}
|
}
|
||||||
|
@ -483,7 +483,7 @@ static enum get_oid_result get_short_oid(struct repository *r,
|
||||||
if (!quietly && (status == SHORT_NAME_AMBIGUOUS)) {
|
if (!quietly && (status == SHORT_NAME_AMBIGUOUS)) {
|
||||||
struct oid_array collect = OID_ARRAY_INIT;
|
struct oid_array collect = OID_ARRAY_INIT;
|
||||||
|
|
||||||
error(_("short SHA1 %s is ambiguous"), ds.hex_pfx);
|
error(_("short object ID %s is ambiguous"), ds.hex_pfx);
|
||||||
|
|
||||||
/*
|
/*
|
||||||
* We may still have ambiguity if we simply saw a series of
|
* We may still have ambiguity if we simply saw a series of
|
||||||
|
@ -1811,7 +1811,7 @@ static enum get_oid_result get_oid_with_context_1(struct repository *repo,
|
||||||
if (!ret)
|
if (!ret)
|
||||||
return ret;
|
return ret;
|
||||||
/*
|
/*
|
||||||
* sha1:path --> object name of path in ent sha1
|
* tree:path --> object name of path in tree
|
||||||
* :path -> object name of absolute path in index
|
* :path -> object name of absolute path in index
|
||||||
* :./path -> object name of path relative to cwd in index
|
* :./path -> object name of path relative to cwd in index
|
||||||
* :[0-3]:path -> object name of path in index at stage
|
* :[0-3]:path -> object name of path in index at stage
|
||||||
|
@ -1949,6 +1949,6 @@ enum get_oid_result get_oid_with_context(struct repository *repo,
|
||||||
struct object_context *oc)
|
struct object_context *oc)
|
||||||
{
|
{
|
||||||
if (flags & GET_OID_FOLLOW_SYMLINKS && flags & GET_OID_ONLY_TO_DIE)
|
if (flags & GET_OID_FOLLOW_SYMLINKS && flags & GET_OID_ONLY_TO_DIE)
|
||||||
BUG("incompatible flags for get_sha1_with_context");
|
BUG("incompatible flags for get_oid_with_context");
|
||||||
return get_oid_with_context_1(repo, str, flags, NULL, oid, oc);
|
return get_oid_with_context_1(repo, str, flags, NULL, oid, oc);
|
||||||
}
|
}
|
|
@ -48,7 +48,7 @@ test_expect_success 'blob and tree' '
|
||||||
|
|
||||||
test_expect_success 'warn ambiguity when no candidate matches type hint' '
|
test_expect_success 'warn ambiguity when no candidate matches type hint' '
|
||||||
test_must_fail git rev-parse --verify 000000000^{commit} 2>actual &&
|
test_must_fail git rev-parse --verify 000000000^{commit} 2>actual &&
|
||||||
test_i18ngrep "short SHA1 000000000 is ambiguous" actual
|
test_i18ngrep "short object ID 000000000 is ambiguous" actual
|
||||||
'
|
'
|
||||||
|
|
||||||
test_expect_success 'disambiguate tree-ish' '
|
test_expect_success 'disambiguate tree-ish' '
|
||||||
|
|
Загрузка…
Ссылка в новой задаче