1#ifndef BISECT_H 2#define BISECT_H 3 4struct commit_list; 5 6/* 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`. 12 */ 13extern void find_bisection(struct commit_list **list, int *reaches, int *all, 14 int find_all); 15 16extern struct commit_list *filter_skipped(struct commit_list *list, 17 struct commit_list **tried, 18 int show_all, 19 int *count, 20 int *skipped_first); 21 22#define BISECT_SHOW_ALL (1<<0) 23#define REV_LIST_QUIET (1<<1) 24 25struct rev_list_info { 26 struct rev_info *revs; 27 int flags; 28 int show_timestamp; 29 int hdr_termination; 30 const char *header_prefix; 31}; 32 33extern int bisect_next_all(const char *prefix, int no_checkout); 34 35extern int estimate_bisect_steps(int all); 36 37extern void read_bisect_terms(const char **bad, const char **good); 38 39extern int bisect_clean_state(void); 40 41#endif