blob: 25f4f1c05f46190043b45f9f02a0fda7eab82791 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
|
#include "../common/tdb_private.h"
#include "../common/io.c"
#include "../common/tdb.c"
#include "../common/lock.c"
#include "../common/freelist.c"
#include "../common/traverse.c"
#include "../common/transaction.c"
#include "../common/error.c"
#include "../common/open.c"
#include "../common/check.c"
#include "../common/hash.c"
#include "../common/rescue.c"
#include "tap-interface.h"
#include <stdlib.h>
#include "logging.h"
#define NUM 20
/* Binary searches are deceptively simple: easy to screw up! */
int main(int argc, char *argv[])
{
unsigned int i, j, n;
struct found f[NUM+1];
struct found_table table;
/* Set up array for searching. */
for (i = 0; i < NUM+1; i++) {
f[i].head = i * 3;
}
table.arr = f;
for (i = 0; i < NUM; i++) {
table.num = i;
for (j = 0; j < (i + 2) * 3; j++) {
n = find_entry(&table, j);
ok1(n <= i);
/* If we were searching for something too large... */
if (j > i*3)
ok1(n == i);
else {
/* It must give us something after j */
ok1(f[n].head >= j);
ok1(n == 0 || f[n-1].head < j);
}
}
}
return exit_status();
}
|
