1
0
Fork 0
mirror of https://github.com/git/git.git synced 2024-03-28 22:40:01 +01:00

hash-lookup: rename from sha1-lookup

Change all remnants of "sha1" in hash-lookup.c and .h and rename them to
reflect that we're not just able to handle SHA-1 these days.

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:
Martin Ågren 2020-12-31 12:56:23 +01:00 committed by Junio C Hamano
parent 7a7d992d0d
commit bc62692757
14 changed files with 25 additions and 25 deletions

View File

@ -901,6 +901,7 @@ LIB_OBJS += gettext.o
LIB_OBJS += gpg-interface.o
LIB_OBJS += graph.o
LIB_OBJS += grep.o
LIB_OBJS += hash-lookup.o
LIB_OBJS += hashmap.o
LIB_OBJS += help.o
LIB_OBJS += hex.o
@ -995,7 +996,6 @@ LIB_OBJS += sequencer.o
LIB_OBJS += serve.o
LIB_OBJS += server-info.o
LIB_OBJS += setup.o
LIB_OBJS += sha1-lookup.o
LIB_OBJS += shallow.o
LIB_OBJS += sideband.o
LIB_OBJS += sigchain.o

View File

@ -6,7 +6,7 @@
#include "refs.h"
#include "list-objects.h"
#include "quote.h"
#include "sha1-lookup.h"
#include "hash-lookup.h"
#include "run-command.h"
#include "log-tree.h"
#include "bisect.h"

View File

@ -7,7 +7,7 @@
#include "refs.h"
#include "parse-options.h"
#include "prio-queue.h"
#include "sha1-lookup.h"
#include "hash-lookup.h"
#include "commit-slab.h"
/*

View File

@ -7,7 +7,7 @@
#include "object.h"
#include "refs.h"
#include "revision.h"
#include "sha1-lookup.h"
#include "hash-lookup.h"
#include "commit-graph.h"
#include "object-store.h"
#include "alloc.h"

View File

@ -14,7 +14,7 @@
#include "mergesort.h"
#include "commit-slab.h"
#include "prio-queue.h"
#include "sha1-lookup.h"
#include "hash-lookup.h"
#include "wt-status.h"
#include "advice.h"
#include "refs.h"

View File

@ -1,9 +1,9 @@
#include "cache.h"
#include "sha1-lookup.h"
#include "hash-lookup.h"
static uint32_t take2(const unsigned char *sha1)
static uint32_t take2(const unsigned char *hash)
{
return ((sha1[0] << 8) | sha1[1]);
return ((hash[0] << 8) | hash[1]);
}
/*
@ -100,17 +100,17 @@ int hash_pos(const unsigned char *hash, void *table, size_t nr,
return index_pos_to_insert_pos(lo);
}
int bsearch_hash(const unsigned char *sha1, const uint32_t *fanout_nbo,
int bsearch_hash(const unsigned char *hash, const uint32_t *fanout_nbo,
const unsigned char *table, size_t stride, uint32_t *result)
{
uint32_t hi, lo;
hi = ntohl(fanout_nbo[*sha1]);
lo = ((*sha1 == 0x0) ? 0 : ntohl(fanout_nbo[*sha1 - 1]));
hi = ntohl(fanout_nbo[*hash]);
lo = ((*hash == 0x0) ? 0 : ntohl(fanout_nbo[*hash - 1]));
while (lo < hi) {
unsigned mi = lo + (hi - lo) / 2;
int cmp = hashcmp(table + mi * stride, sha1);
int cmp = hashcmp(table + mi * stride, hash);
if (!cmp) {
if (result)

View File

@ -1,5 +1,5 @@
#ifndef SHA1_LOOKUP_H
#define SHA1_LOOKUP_H
#ifndef HASH_LOOKUP_H
#define HASH_LOOKUP_H
typedef const unsigned char *hash_access_fn(size_t index, void *table);
@ -9,12 +9,12 @@ int hash_pos(const unsigned char *hash,
hash_access_fn fn);
/*
* Searches for sha1 in table, using the given fanout table to determine the
* Searches for hash in table, using the given fanout table to determine the
* interval to search, then using binary search. Returns 1 if found, 0 if not.
*
* Takes the following parameters:
*
* - sha1: the hash to search for
* - hash: the hash to search for
* - fanout_nbo: a 256-element array of NETWORK-order 32-bit integers; the
* integer at position i represents the number of elements in table whose
* first byte is less than or equal to i
@ -23,10 +23,10 @@ int hash_pos(const unsigned char *hash,
* GIT_MAX_RAWSZ or greater)
* - result: if not NULL, this function stores the element index of the
* position found (if the search is successful) or the index of the least
* element that is greater than sha1 (if the search is not successful)
* element that is greater than hash (if the search is not successful)
*
* This function does not verify the validity of the fanout table.
*/
int bsearch_hash(const unsigned char *sha1, const uint32_t *fanout_nbo,
int bsearch_hash(const unsigned char *hash, const uint32_t *fanout_nbo,
const unsigned char *table, size_t stride, uint32_t *result);
#endif

2
midx.c
View File

@ -5,7 +5,7 @@
#include "lockfile.h"
#include "packfile.h"
#include "object-store.h"
#include "sha1-lookup.h"
#include "hash-lookup.h"
#include "midx.h"
#include "progress.h"
#include "trace2.h"

View File

@ -20,7 +20,7 @@
#include "tree-walk.h"
#include "refs.h"
#include "pack-revindex.h"
#include "sha1-lookup.h"
#include "hash-lookup.h"
#include "bulk-checkin.h"
#include "repository.h"
#include "replace-object.h"

View File

@ -1,6 +1,6 @@
#include "cache.h"
#include "oid-array.h"
#include "sha1-lookup.h"
#include "hash-lookup.h"
void oid_array_append(struct oid_array *array, const struct object_id *oid)
{

View File

@ -9,7 +9,7 @@
#include "pack-revindex.h"
#include "pack.h"
#include "pack-bitmap.h"
#include "sha1-lookup.h"
#include "hash-lookup.h"
#include "pack-objects.h"
#include "commit-reach.h"

View File

@ -7,7 +7,7 @@
#include "packfile.h"
#include "delta.h"
#include "streaming.h"
#include "sha1-lookup.h"
#include "hash-lookup.h"
#include "commit.h"
#include "object.h"
#include "tag.h"

View File

@ -1,7 +1,7 @@
#include "cache.h"
#include "diff.h"
#include "commit.h"
#include "sha1-lookup.h"
#include "hash-lookup.h"
#include "patch-ids.h"
static int patch_id_defined(struct commit *commit)

View File

@ -10,7 +10,7 @@
#include "attr.h"
#include "pathspec.h"
#include "object-store.h"
#include "sha1-lookup.h"
#include "hash-lookup.h"
#define RESOLVED 0
#define PUNTED 1