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, 22 deletions

diff --git a/third_party/git/linear-assignment.h b/third_party/git/linear-assignment.h
deleted file mode 100644
index 1dfea766290d..000000000000
--- a/third_party/git/linear-assignment.h
+++ /dev/null
@@ -1,22 +0,0 @@
-#ifndef LINEAR_ASSIGNMENT_H
-#define LINEAR_ASSIGNMENT_H
-
-/*
- * Compute an assignment of columns -> rows (and vice versa) such that every
- * column is assigned to at most one row (and vice versa) minimizing the
- * overall cost.
- *
- * The parameter `cost` is the cost matrix: the cost to assign column j to row
- * i is `cost[j + column_count * i].
- *
- * The arrays column2row and row2column will be populated with the respective
- * assignments (-1 for unassigned, which can happen only if column_count !=
- * row_count).
- */
-void compute_assignment(int column_count, int row_count, int *cost,
-			int *column2row, int *row2column);
-
-/* The maximal cost in the cost matrix (to prevent integer overflows). */
-#define COST_MAX (1<<16)
-
-#endif