THIS IS A TEST INSTANCE ONLY! REPOSITORIES CAN BE DELETED AT ANY TIME!

Git Source Code Mirror - This is a publish-only repository and all pull requests are ignored. Please follow Documentation/SubmittingPatches procedure for any of your improvements.
git
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

45 lines
1.1KB

  1. #ifndef BISECT_H
  2. #define BISECT_H
  3. struct commit_list;
  4. struct repository;
  5. /*
  6. * Find bisection. If something is found, `reaches` will be the number of
  7. * commits that the best commit reaches. `all` will be the count of
  8. * non-SAMETREE commits. If nothing is found, `list` will be NULL.
  9. * Otherwise, it will be either all non-SAMETREE commits or the single
  10. * best commit, as chosen by `find_all`.
  11. */
  12. void find_bisection(struct commit_list **list, int *reaches, int *all,
  13. int find_all);
  14. struct commit_list *filter_skipped(struct commit_list *list,
  15. struct commit_list **tried,
  16. int show_all,
  17. int *count,
  18. int *skipped_first);
  19. #define BISECT_SHOW_ALL (1<<0)
  20. #define REV_LIST_QUIET (1<<1)
  21. struct rev_list_info {
  22. struct rev_info *revs;
  23. int flags;
  24. int show_timestamp;
  25. int hdr_termination;
  26. const char *header_prefix;
  27. };
  28. int bisect_next_all(struct repository *r,
  29. const char *prefix,
  30. int no_checkout);
  31. int estimate_bisect_steps(int all);
  32. void read_bisect_terms(const char **bad, const char **good);
  33. int bisect_clean_state(void);
  34. #endif