mirror of
https://github.com/git/git.git
synced 2024-05-06 20:26:11 +02:00
45ee13b942
All of our callers are actually looking up an object_id, not a bare hash. Likewise, the arrays they are looking in are actual arrays of object_id (not just raw bytes of hashes, as we might find in a pack .idx; those are handled by bsearch_hash()). Using an object_id gives us more type safety, and makes the callers slightly shorter. It also gets rid of the word "sha1" from several access functions, though we could obviously also rename those with s/sha1/hash/. Signed-off-by: Jeff King <peff@peff.net> Signed-off-by: Junio C Hamano <gitster@pobox.com>
33 lines
1.3 KiB
C
33 lines
1.3 KiB
C
#ifndef HASH_LOOKUP_H
|
|
#define HASH_LOOKUP_H
|
|
|
|
typedef const struct object_id *oid_access_fn(size_t index, void *table);
|
|
|
|
int oid_pos(const struct object_id *oid,
|
|
void *table,
|
|
size_t nr,
|
|
oid_access_fn fn);
|
|
|
|
/*
|
|
* 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:
|
|
*
|
|
* - 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
|
|
* - table: a sorted list of hashes with optional extra information in between
|
|
* - stride: distance between two consecutive elements in table (should be
|
|
* 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 hash (if the search is not successful)
|
|
*
|
|
* This function does not verify the validity of the fanout table.
|
|
*/
|
|
int bsearch_hash(const unsigned char *hash, const uint32_t *fanout_nbo,
|
|
const unsigned char *table, size_t stride, uint32_t *result);
|
|
#endif
|