diff options
author | Vincent Ambo <Vincent Ambo> | 2020-01-11T23·36+0000 |
---|---|---|
committer | Vincent Ambo <Vincent Ambo> | 2020-01-11T23·36+0000 |
commit | 1b593e1ea4d2af0f6444d9a7788d5d99abd6fde5 (patch) | |
tree | e3accb9beed5c4c1b5a05c99db71ab2841f0ed04 /bisect.h |
Squashed 'third_party/git/' content from commit cb71568594
git-subtree-dir: third_party/git git-subtree-split: cb715685942260375e1eb8153b0768a376e4ece7
Diffstat (limited to 'bisect.h')
-rw-r--r-- | bisect.h | 44 |
1 files changed, 44 insertions, 0 deletions
diff --git a/bisect.h b/bisect.h new file mode 100644 index 000000000000..4e69a11ea8f3 --- /dev/null +++ b/bisect.h @@ -0,0 +1,44 @@ +#ifndef BISECT_H +#define BISECT_H + +struct commit_list; +struct repository; + +/* + * 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`. + */ +void find_bisection(struct commit_list **list, int *reaches, int *all, + int find_all); + +struct commit_list *filter_skipped(struct commit_list *list, + struct commit_list **tried, + int show_all, + int *count, + int *skipped_first); + +#define BISECT_SHOW_ALL (1<<0) +#define REV_LIST_QUIET (1<<1) + +struct rev_list_info { + struct rev_info *revs; + int flags; + int show_timestamp; + int hdr_termination; + const char *header_prefix; +}; + +int bisect_next_all(struct repository *r, + const char *prefix, + int no_checkout); + +int estimate_bisect_steps(int all); + +void read_bisect_terms(const char **bad, const char **good); + +int bisect_clean_state(void); + +#endif |