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

1 files changed, 0 insertions, 96 deletions

diff --git a/third_party/git/oid-array.c b/third_party/git/oid-array.c
deleted file mode 100644
index 8657a5cedf..0000000000
--- a/third_party/git/oid-array.c
+++ /dev/null
@@ -1,96 +0,0 @@
-#include "cache.h"
-#include "oid-array.h"
-#include "sha1-lookup.h"
-
-void oid_array_append(struct oid_array *array, const struct object_id *oid)
-{
-	ALLOC_GROW(array->oid, array->nr + 1, array->alloc);
-	oidcpy(&array->oid[array->nr++], oid);
-	array->sorted = 0;
-}
-
-static int void_hashcmp(const void *a, const void *b)
-{
-	return oidcmp(a, b);
-}
-
-static void oid_array_sort(struct oid_array *array)
-{
-	QSORT(array->oid, array->nr, void_hashcmp);
-	array->sorted = 1;
-}
-
-static const unsigned char *sha1_access(size_t index, void *table)
-{
-	struct object_id *array = table;
-	return array[index].hash;
-}
-
-int oid_array_lookup(struct oid_array *array, const struct object_id *oid)
-{
-	if (!array->sorted)
-		oid_array_sort(array);
-	return sha1_pos(oid->hash, array->oid, array->nr, sha1_access);
-}
-
-void oid_array_clear(struct oid_array *array)
-{
-	FREE_AND_NULL(array->oid);
-	array->nr = 0;
-	array->alloc = 0;
-	array->sorted = 0;
-}
-
-
-int oid_array_for_each(struct oid_array *array,
-		       for_each_oid_fn fn,
-		       void *data)
-{
-	size_t i;
-
-	/* No oid_array_sort() here! See oid-array.h */
-
-	for (i = 0; i < array->nr; i++) {
-		int ret = fn(array->oid + i, data);
-		if (ret)
-			return ret;
-	}
-	return 0;
-}
-
-int oid_array_for_each_unique(struct oid_array *array,
-			      for_each_oid_fn fn,
-			      void *data)
-{
-	size_t i;
-
-	if (!array->sorted)
-		oid_array_sort(array);
-
-	for (i = 0; i < array->nr; i++) {
-		int ret;
-		if (i > 0 && oideq(array->oid + i, array->oid + i - 1))
-			continue;
-		ret = fn(array->oid + i, data);
-		if (ret)
-			return ret;
-	}
-	return 0;
-}
-
-void oid_array_filter(struct oid_array *array,
-		      for_each_oid_fn want,
-		      void *cb_data)
-{
-	size_t nr = array->nr, src, dst;
-	struct object_id *oids = array->oid;
-
-	for (src = dst = 0; src < nr; src++) {
-		if (want(&oids[src], cb_data)) {
-			if (src != dst)
-				oidcpy(&oids[dst], &oids[src]);
-			dst++;
-		}
-	}
-	array->nr = dst;
-}