about summary refs log tree commit diff
path: root/third_party/git/sha1-lookup.h
diff options
context:
space:
mode:
authorVincent Ambo <mail@tazj.in>2021-09-21T10·03+0300
committerVincent Ambo <mail@tazj.in>2021-09-21T11·29+0300
commit43b1791ec601732ac31195df96781a848360a9ac (patch)
treedaae8d638343295d2f1f7da955e556ef4c958864 /third_party/git/sha1-lookup.h
parent2d8e7dc9d9c38127ec4ebd13aee8e8f586a43318 (diff)
chore(3p/git): Unvendor git and track patches instead r/2903
This was vendored a long time ago under the expectation that keeping
it in sync with cgit would be easier this way, but it has proven not
to be a big issue.

On the other hand, a vendored copy of git is an annoying maintenance
burden. It is much easier to rebase the single (dottime) patch that we
have.

This removes the vendored copy of git and instead passes the git
source code to cgit via `pkgs.srcOnly`, which includes the applied
patch so that cgit can continue rendering dottime.

Change-Id: If31f62dea7ce688fd1b9050204e9378019775f2b
Diffstat (limited to 'third_party/git/sha1-lookup.h')
-rw-r--r--third_party/git/sha1-lookup.h32
1 files changed, 0 insertions, 32 deletions
diff --git a/third_party/git/sha1-lookup.h b/third_party/git/sha1-lookup.h
deleted file mode 100644
index 5afcd011c6be..000000000000
--- a/third_party/git/sha1-lookup.h
+++ /dev/null
@@ -1,32 +0,0 @@
-#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