1#ifndef BISECT_H 2#define BISECT_H 3 4/* 5 * Find bisection. If something is found, `reaches` will be the number of 6 * commits that the best commit reaches. `all` will be the count of 7 * non-SAMETREE commits. If nothing is found, `list` will be NULL. 8 * Otherwise, it will be either all non-SAMETREE commits or the single 9 * best commit, as chosen by `find_all`. 10 */ 11externvoidfind_bisection(struct commit_list **list,int*reaches,int*all, 12int find_all); 13 14externstruct commit_list *filter_skipped(struct commit_list *list, 15struct commit_list **tried, 16int show_all, 17int*count, 18int*skipped_first); 19 20#define BISECT_SHOW_ALL (1<<0) 21#define REV_LIST_QUIET (1<<1) 22 23struct rev_list_info { 24struct rev_info *revs; 25int flags; 26int show_timestamp; 27int hdr_termination; 28const char*header_prefix; 29}; 30 31externintbisect_next_all(const char*prefix,int no_checkout); 32 33externintestimate_bisect_steps(int all); 34 35externvoidread_bisect_terms(const char**bad,const char**good); 36 37#endif