]>
git.ipfire.org Git - thirdparty/git.git/blob - bisect.h
7 * Find bisection. If something is found, `reaches` will be the number of
8 * commits that the best commit reaches. `all` will be the count of
9 * non-SAMETREE commits. If nothing is found, `list` will be NULL.
10 * Otherwise, it will be either all non-SAMETREE commits or the single
11 * best commit, as chosen by `find_all`.
13 extern void find_bisection(struct commit_list
**list
, int *reaches
, int *all
,
16 extern struct commit_list
*filter_skipped(struct commit_list
*list
,
17 struct commit_list
**tried
,
22 #define BISECT_SHOW_ALL (1<<0)
23 #define REV_LIST_QUIET (1<<1)
25 struct rev_list_info
{
26 struct rev_info
*revs
;
30 const char *header_prefix
;
33 extern int bisect_next_all(const char *prefix
, int no_checkout
);
35 extern int estimate_bisect_steps(int all
);
37 extern void read_bisect_terms(const char **bad
, const char **good
);
39 extern int bisect_clean_state(void);