aboutsummaryrefslogtreecommitdiffstats
path: root/test/monniaux/binary_search
diff options
context:
space:
mode:
authorDavid Monniaux <david.monniaux@univ-grenoble-alpes.fr>2019-04-08 16:12:04 +0200
committerDavid Monniaux <david.monniaux@univ-grenoble-alpes.fr>2019-04-08 16:12:04 +0200
commit5e06ed3a94dcd7f46b3e087e72e725579d3dd765 (patch)
tree7839fa44a95450774ef8ec80330b55acab5d965d /test/monniaux/binary_search
parent6e9f3d396d4087150f8ec148802c32252eaeead5 (diff)
downloadcompcert-kvx-5e06ed3a94dcd7f46b3e087e72e725579d3dd765.tar.gz
compcert-kvx-5e06ed3a94dcd7f46b3e087e72e725579d3dd765.zip
better explanation
Diffstat (limited to 'test/monniaux/binary_search')
-rw-r--r--test/monniaux/binary_search/binary_search.c30
1 files changed, 26 insertions, 4 deletions
diff --git a/test/monniaux/binary_search/binary_search.c b/test/monniaux/binary_search/binary_search.c
index d5839955..41638def 100644
--- a/test/monniaux/binary_search/binary_search.c
+++ b/test/monniaux/binary_search/binary_search.c
@@ -41,6 +41,22 @@ int my_bsearch2 (data *a, index n, data x) {
}
int my_bsearch3 (data *a, index n, data x) {
+ index i = 0, j = n - 1;
+ while (i <= j) {
+ index k = (i + j) / 2;
+ index kp1 = k+1, km1 = k-1;
+ data ak = a[k];
+ _Bool lt = ak < x, gt = ak > x;
+ i = TERNARY32(lt, kp1, i);
+ j = TERNARY32(gt, km1, j);
+ if (ak == x) {
+ return k;
+ }
+ }
+ return -1;
+}
+
+int my_bsearch4 (data *a, index n, data x) {
index i = 0, j = n - 1, k;
k = (i + j) / 2;
while (i <= j) {
@@ -71,7 +87,7 @@ void random_ascending_fill(data *a, index n) {
}
int main () {
- index n=5000;
+ index n=25000;
data v=1502;
data *buf=malloc(n*sizeof(data));
@@ -92,15 +108,21 @@ int main () {
index pos3 = my_bsearch3(buf, n, v);
timestamp3 = get_current_cycle()-timestamp3;
+ cycle_t timestamp4 = get_current_cycle();
+ index pos4 = my_bsearch4(buf, n, v);
+ timestamp4 = get_current_cycle()-timestamp4;
+
printf("position1: %d\n"
"position2: %d\n"
"position3: %d\n"
+ "position4: %d\n"
"random fill cycles: %" PRIu64 "\n"
"search1 cycles: %" PRIu64 "\n"
"search2 cycles: %" PRIu64 "\n"
- "search3 cycles: %" PRIu64 "\n",
- pos1, pos2, pos3,
- timestamp0, timestamp1, timestamp2, timestamp3);
+ "search3 cycles: %" PRIu64 "\n"
+ "search4 cycles: %" PRIu64 "\n",
+ pos1, pos2, pos3, pos4,
+ timestamp0, timestamp1, timestamp2, timestamp3, timestamp4);
free(buf);
}