bisect.h 1.03 KB
Newer Older
1 2 3
#ifndef BISECT_H
#define BISECT_H

4 5 6 7 8 9 10 11 12
/*
 * 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`.
 */
extern void find_bisection(struct commit_list **list, int *reaches, int *all,
			   int find_all);
13

14 15
extern struct commit_list *filter_skipped(struct commit_list *list,
					  struct commit_list **tried,
16 17 18
					  int show_all,
					  int *count,
					  int *skipped_first);
19

20
#define BISECT_SHOW_ALL		(1<<0)
21
#define REV_LIST_QUIET		(1<<1)
22

23 24
struct rev_list_info {
	struct rev_info *revs;
25
	int flags;
26 27 28 29 30
	int show_timestamp;
	int hdr_termination;
	const char *header_prefix;
};

31
extern int bisect_next_all(const char *prefix, int no_checkout);
32

33 34
extern int estimate_bisect_steps(int all);

35 36
extern void read_bisect_terms(const char **bad, const char **good);

37 38
extern int bisect_clean_state(void);

39
#endif