| * 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, |
| struct commit_list *filter_skipped(struct commit_list *list, |
| struct commit_list **tried, |
| #define BISECT_SHOW_ALL (1<<0) |
| #define REV_LIST_QUIET (1<<1) |
| const char *header_prefix; |
| int bisect_next_all(struct repository *r, |
| int estimate_bisect_steps(int all); |
| void read_bisect_terms(const char **bad, const char **good); |
| int bisect_clean_state(void); |