Fifth batch for 2.19 cycle
[git/git.git] / bisect.h
CommitLineData
a2ad79ce
CC
1#ifndef BISECT_H
2#define BISECT_H
3
24d707f6
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 */
11extern void find_bisection(struct commit_list **list, int *reaches, int *all,
12 int find_all);
a2ad79ce 13
95188648
CC
14extern struct commit_list *filter_skipped(struct commit_list *list,
15 struct commit_list **tried,
9af3589e
CC
16 int show_all,
17 int *count,
18 int *skipped_first);
95188648 19
37c4c38d 20#define BISECT_SHOW_ALL (1<<0)
98993722 21#define REV_LIST_QUIET (1<<1)
37c4c38d 22
d797257e
CC
23struct rev_list_info {
24 struct rev_info *revs;
98993722 25 int flags;
d797257e
CC
26 int show_timestamp;
27 int hdr_termination;
28 const char *header_prefix;
29};
30
fee92fc1 31extern int bisect_next_all(const char *prefix, int no_checkout);
1bf072e3 32
1c876546
CC
33extern int estimate_bisect_steps(int all);
34
cb46d630
AD
35extern void read_bisect_terms(const char **bad, const char **good);
36
fb71a329
PB
37extern int bisect_clean_state(void);
38
a2ad79ce 39#endif