Merge git://ozlabs.org/~paulus/gitk
[git.git] / bisect.h
blob821d16e4ddad71d177190a0e05012c5a509fa17b
1 #ifndef BISECT_H
2 #define BISECT_H
4 struct commit_list;
5 struct repository;
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`.
14 extern void find_bisection(struct commit_list **list, int *reaches, int *all,
15 int find_all);
17 extern struct commit_list *filter_skipped(struct commit_list *list,
18 struct commit_list **tried,
19 int show_all,
20 int *count,
21 int *skipped_first);
23 #define BISECT_SHOW_ALL (1<<0)
24 #define REV_LIST_QUIET (1<<1)
26 struct rev_list_info {
27 struct rev_info *revs;
28 int flags;
29 int show_timestamp;
30 int hdr_termination;
31 const char *header_prefix;
34 extern int bisect_next_all(struct repository *r,
35 const char *prefix,
36 int no_checkout);
38 extern int estimate_bisect_steps(int all);
40 extern void read_bisect_terms(const char **bad, const char **good);
42 extern int bisect_clean_state(void);
44 #endif