merge(third_party/git): Merge squashed git subtree at v2.23.0 r/373

Merge commit '1b593e1ea4d2af0f6444d9a7788d5d99abd6fde5' as 'third_party/git'

1 files changed, 44 insertions, 0 deletions

diff --git a/third_party/git/bisect.h b/third_party/git/bisect.h
new file mode 100644
index 000000000000..4e69a11ea8f3
--- /dev/null
+++ b/third_party/git/bisect.h
@@ -0,0 +1,44 @@
+#ifndef BISECT_H
+#define BISECT_H
+
+struct commit_list;
+struct repository;
+
+/*
+ * Find bisection. If something is found, `reaches` will be the number of
+ * commits that the best commit reaches. `all` will be the count of
+ * non-SAMETREE commits. If nothing is found, `list` will be NULL.
+ * Otherwise, it will be either all non-SAMETREE commits or the single
+ * best commit, as chosen by `find_all`.
+ */
+void find_bisection(struct commit_list **list, int *reaches, int *all,
+		    int find_all);
+
+struct commit_list *filter_skipped(struct commit_list *list,
+				   struct commit_list **tried,
+				   int show_all,
+				   int *count,
+				   int *skipped_first);
+
+#define BISECT_SHOW_ALL		(1<<0)
+#define REV_LIST_QUIET		(1<<1)
+
+struct rev_list_info {
+	struct rev_info *revs;
+	int flags;
+	int show_timestamp;
+	int hdr_termination;
+	const char *header_prefix;
+};
+
+int bisect_next_all(struct repository *r,
+		    const char *prefix,
+		    int no_checkout);
+
+int estimate_bisect_steps(int all);
+
+void read_bisect_terms(const char **bad, const char **good);
+
+int bisect_clean_state(void);
+
+#endif