summaryrefslogtreecommitdiff
path: root/bisect.h
diff options
context:
space:
mode:
authorChristian Couder <chriscool@tuxfamily.org>2009-06-06 06:41:33 +0200
committerJunio C Hamano <gitster@pobox.com>2009-06-06 11:26:56 -0700
commit9af3589e0e42eb289dfdb8bb4031e5bec4923308 (patch)
tree84f82922eb53f65de7c6a1bf0f05ba806e7ceeb9 /bisect.h
parente22278c0a0784d4285f0e3173794caad4e542658 (diff)
downloadgit-9af3589e0e42eb289dfdb8bb4031e5bec4923308.tar.gz
bisect: add parameters to "filter_skipped"
because we will need to get more information from this function in some later patches. The new "int *count" parameter gives the number of commits left after the skipped commit have been filtered out. The new "int *skipped_first" parameter tells us if the first commit in the list has been skipped. Note that using this parameter also changes the behavior of the function if the first commit is indeed skipped. Because we assume that in this case we will want all the filtered commits, not just the first one, even if "show_all" is not set. So using a not NULL "skipped_first" parameter really means that we plan to choose to test another commit than the first non skipped one if the first commit in the list is skipped. That in turn means that, in case the first commit is skipped, we have to return a fully filtered list. Signed-off-by: Christian Couder <chriscool@tuxfamily.org> Signed-off-by: Junio C Hamano <gitster@pobox.com>
Diffstat (limited to 'bisect.h')
-rw-r--r--bisect.h4
1 files changed, 3 insertions, 1 deletions
diff --git a/bisect.h b/bisect.h
index fb744fdb79..82f8fc1910 100644
--- a/bisect.h
+++ b/bisect.h
@@ -7,7 +7,9 @@ extern struct commit_list *find_bisection(struct commit_list *list,
extern struct commit_list *filter_skipped(struct commit_list *list,
struct commit_list **tried,
- int show_all);
+ int show_all,
+ int *count,
+ int *skipped_first);
extern void print_commit_list(struct commit_list *list,
const char *format_cur,