]>
git.ipfire.org Git - thirdparty/git.git/blob - bisect.h
8 * Find bisection. If something is found, `reaches` will be the number of
9 * commits that the best commit reaches. `all` will be the count of
10 * non-SAMETREE commits. If nothing is found, `list` will be NULL.
11 * Otherwise, it will be either all non-SAMETREE commits or the single
12 * best commit, as chosen by `find_all`.
14 void find_bisection(struct commit_list
**list
, int *reaches
, int *all
,
17 struct commit_list
*filter_skipped(struct commit_list
*list
,
18 struct commit_list
**tried
,
23 #define BISECT_SHOW_ALL (1<<0)
24 #define REV_LIST_QUIET (1<<1)
26 struct rev_list_info
{
27 struct rev_info
*revs
;
31 const char *header_prefix
;
34 int bisect_next_all(struct repository
*r
,
38 int estimate_bisect_steps(int all
);
40 void read_bisect_terms(const char **bad
, const char **good
);
42 int bisect_clean_state(void);