summaryrefslogtreecommitdiff
path: root/bisect.h
diff options
context:
space:
mode:
authorChristian Couder <chriscool@tuxfamily.org>2009-03-26 04:55:49 (GMT)
committerJunio C Hamano <gitster@pobox.com>2009-04-05 08:29:35 (GMT)
commit951886481668b97485640a1b24fc73fccff0d629 (patch)
tree251e2f30932c15ad79c67c7bb06263e9b1f71417 /bisect.h
parent5aaa507b067ca22324c34308cb56bcb64392a5db (diff)
downloadgit-951886481668b97485640a1b24fc73fccff0d629.zip
git-951886481668b97485640a1b24fc73fccff0d629.tar.gz
git-951886481668b97485640a1b24fc73fccff0d629.tar.bz2
rev-list: call new "filter_skip" function
This patch implements a new "filter_skip" function in C in "bisect.c" that will later replace the existing implementation in shell in "git-bisect.sh". An array is used to store the skipped commits. But the array is not yet fed anything. 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.h6
1 files changed, 5 insertions, 1 deletions
diff --git a/bisect.h b/bisect.h
index 31c99fe..2489630 100644
--- a/bisect.h
+++ b/bisect.h
@@ -5,7 +5,11 @@ extern struct commit_list *find_bisection(struct commit_list *list,
int *reaches, int *all,
int find_all);
+extern struct commit_list *filter_skipped(struct commit_list *list,
+ struct commit_list **tried,
+ int show_all);
+
extern int show_bisect_vars(struct rev_info *revs, int reaches, int all,
- int show_all);
+ int show_all, int show_tried);
#endif