🌐 AI搜索 & 代理 主页
Google Git
Sign in
chromium / external / github.com / git / git / refs/tags/v2.35.7 / . / bisect.h
blob: ec24ac2d7ee9d18fa6a9188534040602fd728e38 [file] [log] [blame]
Christian Coudera2ad79c2009-03-26 04:55:24[diff] [blame]1#ifndef BISECT_H
2#define BISECT_H
3
Elijah Newrenef3ca952018-08-15 17:54:05[diff] [blame]4struct commit_list;
Nguyễn Thái Ngọc Duy69d2cfe2018-11-10 05:48:59[diff] [blame]5struct repository;
Elijah Newrenef3ca952018-08-15 17:54:05[diff] [blame]6
Martin Ågren24d707f2017-11-05 20:24:28[diff] [blame]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`.
13 */
Denton Liu55454422019-04-29 08:28:14[diff] [blame]14void find_bisection(struct commit_list **list, int *reaches, int *all,
Aaron Lipmanad464a42020-08-07 21:58:38[diff] [blame]15 unsigned bisect_flags);
Christian Coudera2ad79c2009-03-26 04:55:24[diff] [blame]16
Denton Liu55454422019-04-29 08:28:14[diff] [blame]17struct commit_list *filter_skipped(struct commit_list *list,
Denton Liuad6dad02019-04-29 08:28:23[diff] [blame]18 struct commit_list **tried,
19 int show_all,
20 int *count,
21 int *skipped_first);
Christian Couder95188642009-03-26 04:55:49[diff] [blame]22
Christian Couder37c4c382009-03-29 09:55:43[diff] [blame]23#define BISECT_SHOW_ALL (1<<0)
Nguyễn Thái Ngọc Duy98993722012-02-28 14:00:00[diff] [blame]24#define REV_LIST_QUIET (1<<1)
Christian Couder37c4c382009-03-29 09:55:43[diff] [blame]25
Aaron Lipmanad464a42020-08-07 21:58:38[diff] [blame]26#define FIND_BISECTION_ALL (1u<<0)
27#define FIND_BISECTION_FIRST_PARENT_ONLY (1u<<1)
28
Christian Couderd7972572009-04-06 20:28:00[diff] [blame]29struct rev_list_info {
30 struct rev_info *revs;
Nguyễn Thái Ngọc Duy98993722012-02-28 14:00:00[diff] [blame]31 int flags;
Christian Couderd7972572009-04-06 20:28:00[diff] [blame]32 int show_timestamp;
33 int hdr_termination;
34 const char *header_prefix;
35};
36
Miriam Rubio680e8a02020-02-17 08:40:32[diff] [blame]37/*
38 * enum bisect_error represents the following return codes:
39 * BISECT_OK: success code. Internally, it means that next
40 * commit has been found (and possibly checked out) and it
41 * should be tested.
42 * BISECT_FAILED error code: default error code.
Pranit Bauvace58b5d2020-02-17 08:40:34[diff] [blame]43 * BISECT_ONLY_SKIPPED_LEFT error code: only skipped
44 * commits left to be tested.
Pranit Bauva6c69f222020-02-17 08:40:39[diff] [blame]45 * BISECT_MERGE_BASE_CHECK error code: merge base check failed.
46 * BISECT_NO_TESTABLE_COMMIT error code: no testable commit found.
47 * BISECT_INTERNAL_SUCCESS_1ST_BAD_FOUND early success code:
48 * first term_bad commit found.
Pranit Bauvacdd4dc22020-02-17 08:40:36[diff] [blame]49 * BISECT_INTERNAL_SUCCESS_MERGE_BASE early success
50 * code: found merge base that should be tested.
Pranit Bauva6c69f222020-02-17 08:40:39[diff] [blame]51 * Early success codes BISECT_INTERNAL_SUCCESS_1ST_BAD_FOUND and
52 * BISECT_INTERNAL_SUCCESS_MERGE_BASE should be only internal codes.
Miriam Rubio680e8a02020-02-17 08:40:32[diff] [blame]53 */
54enum bisect_error {
55 BISECT_OK = 0,
Pranit Bauvace58b5d2020-02-17 08:40:34[diff] [blame]56 BISECT_FAILED = -1,
Pranit Bauvacdd4dc22020-02-17 08:40:36[diff] [blame]57 BISECT_ONLY_SKIPPED_LEFT = -2,
Pranit Bauva9ec598e2020-02-17 08:40:38[diff] [blame]58 BISECT_MERGE_BASE_CHECK = -3,
Pranit Bauva6c69f222020-02-17 08:40:39[diff] [blame]59 BISECT_NO_TESTABLE_COMMIT = -4,
60 BISECT_INTERNAL_SUCCESS_1ST_BAD_FOUND = -10,
Pranit Bauvacdd4dc22020-02-17 08:40:36[diff] [blame]61 BISECT_INTERNAL_SUCCESS_MERGE_BASE = -11
Miriam Rubio680e8a02020-02-17 08:40:32[diff] [blame]62};
63
Aaron Lipmanbe5fe202020-08-07 21:58:36[diff] [blame]64enum bisect_error bisect_next_all(struct repository *r, const char *prefix);
Christian Couder1bf072e2009-03-26 04:55:54[diff] [blame]65
Denton Liu55454422019-04-29 08:28:14[diff] [blame]66int estimate_bisect_steps(int all);
Christian Couder1c876542009-04-19 09:55:38[diff] [blame]67
Denton Liu55454422019-04-29 08:28:14[diff] [blame]68void read_bisect_terms(const char **bad, const char **good);
Antoine Delaitecb46d632015-06-29 15:40:30[diff] [blame]69
Denton Liu55454422019-04-29 08:28:14[diff] [blame]70int bisect_clean_state(void);
Pranit Bauvafb71a322017-09-29 06:49:39[diff] [blame]71
Christian Coudera2ad79c2009-03-26 04:55:24[diff] [blame]72#endif