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