|  | #ifndef BISECT_H | 
|  | #define BISECT_H | 
|  |  | 
|  | extern struct commit_list *find_bisection(struct commit_list *list, | 
|  | int *reaches, int *all, | 
|  | int find_all); | 
|  |  | 
|  | extern 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; | 
|  | }; | 
|  |  | 
|  | extern int bisect_next_all(const char *prefix, int no_checkout); | 
|  |  | 
|  | extern int estimate_bisect_steps(int all); | 
|  |  | 
|  | extern void read_bisect_terms(const char **bad, const char **good); | 
|  |  | 
|  | #endif |