2 * Copyright (c) 1991 The Regents of the University of California.
5 * This code is derived from software contributed to Berkeley by
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
39 "@(#) Copyright (c) 1991 The Regents of the University of California.\n\
40 All rights reserved.\n";
44 static char sccsid
[] = "@(#)driver2.c 5.2 (Berkeley) 9/11/91";
48 * Test driver, to try to tackle the large ugly-split problem.
59 return(17); /* So I'm cruel... */
68 char contentbuf
[2049];
76 info
.cachesize
= NULL
;
77 #ifdef HASH_ID_PROGRAM_SPECIFIED
78 info
.hash_id
= HASH_ID_PROGRAM_SPECIFIED
;
79 info
.hash_func
= my_hash
;
84 if (!(db
= dbopen("bigtest", O_RDWR
| O_CREAT
, 0644, DB_HASH
, &info
))) {
85 sprintf(buf
, "dbopen: failed on file bigtest");
91 content
.data
= contentbuf
;
92 bzero(keybuf
, sizeof(keybuf
));
93 bzero(contentbuf
, sizeof(contentbuf
));
94 for (i
=1; i
<= 500; i
++) {
95 key
.size
= 128 + (random()&1023);
96 content
.size
= 128 + (random()&1023);
97 /* printf("%d: Key size %d, data size %d\n", i, key.size,
99 sprintf(keybuf
, "Key #%d", i
);
100 sprintf(contentbuf
, "Contents #%d", i
);
101 if ((db
->put
)(db
, &key
, &content
, R_NOOVERWRITE
)) {
102 sprintf(buf
, "dbm_store #%d", i
);
106 if ((db
->close
)(db
)) {
107 perror("closing hash file");