1 #include "../common/tdb_private.h"
2 #include "../common/io.c"
3 #include "../common/tdb.c"
4 #include "../common/lock.c"
5 #include "../common/freelist.c"
6 #include "../common/traverse.c"
7 #include "../common/transaction.c"
8 #include "../common/error.c"
9 #include "../common/open.c"
10 #include "../common/check.c"
11 #include "../common/hash.c"
12 #include "../common/rescue.c"
13 #include "tap-interface.h"
19 /* Binary searches are deceptively simple: easy to screw up! */
20 int main(int argc, char *argv[])
23 struct found f[NUM+1];
24 struct found_table table;
26 /* Set up array for searching. */
27 for (i = 0; i < NUM+1; i++) {
32 for (i = 0; i < NUM; i++) {
34 for (j = 0; j < (i + 2) * 3; j++) {
35 n = find_entry(&table, j);
38 /* If we were searching for something too large... */
42 /* It must give us something after j */
44 ok1(n == 0 || f[n-1].head < j);