about summary refs log tree commit diff
path: root/third_party/git/sha1-lookup.h
diff options
context:
space:
mode:
Diffstat (limited to 'third_party/git/sha1-lookup.h')
-rw-r--r--third_party/git/sha1-lookup.h32
1 files changed, 32 insertions, 0 deletions
diff --git a/third_party/git/sha1-lookup.h b/third_party/git/sha1-lookup.h
new file mode 100644
index 000000000000..5afcd011c6be
--- /dev/null
+++ b/third_party/git/sha1-lookup.h
@@ -0,0 +1,32 @@
+#ifndef SHA1_LOOKUP_H
+#define SHA1_LOOKUP_H
+
+typedef const unsigned char *sha1_access_fn(size_t index, void *table);
+
+int sha1_pos(const unsigned char *sha1,
+	     void *table,
+	     size_t nr,
+	     sha1_access_fn fn);
+
+/*
+ * Searches for sha1 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
+ *  - 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 sha1 (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,
+		 const unsigned char *table, size_t stride, uint32_t *result);
+#endif