Commit | Line | Data |
---|---|---|
15637ed4 | 1 | /*- |
78ed81a3 | 2 | * Copyright (c) 1991, 1993 |
3 | * The Regents of the University of California. All rights reserved. | |
15637ed4 RG |
4 | * |
5 | * This code is derived from software contributed to Berkeley by | |
6 | * Margo Seltzer. | |
7 | * | |
8 | * Redistribution and use in source and binary forms, with or without | |
9 | * modification, are permitted provided that the following conditions | |
10 | * are met: | |
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. | |
23 | * | |
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 | |
34 | * SUCH DAMAGE. | |
35 | */ | |
36 | ||
37 | #ifndef lint | |
78ed81a3 | 38 | static char copyright[] = |
39 | "@(#) Copyright (c) 1991, 1993\n\ | |
40 | The Regents of the University of California. All rights reserved.\n"; | |
15637ed4 RG |
41 | #endif /* not lint */ |
42 | ||
43 | #ifndef lint | |
78ed81a3 | 44 | static char sccsid[] = "@(#)driver2.c 8.1 (Berkeley) 6/4/93"; |
15637ed4 RG |
45 | #endif /* not lint */ |
46 | ||
78ed81a3 | 47 | /* |
48 | * Test driver, to try to tackle the large ugly-split problem. | |
49 | */ | |
50 | ||
15637ed4 | 51 | #include <sys/file.h> |
78ed81a3 | 52 | #include <stdio.h> |
53 | #include "ndbm.h" | |
15637ed4 | 54 | |
78ed81a3 | 55 | int my_hash(key, len) |
56 | char *key; | |
57 | int len; | |
58 | { | |
59 | return(17); /* So I'm cruel... */ | |
60 | } | |
15637ed4 | 61 | |
15637ed4 | 62 | main(argc, argv) |
78ed81a3 | 63 | int argc; |
15637ed4 | 64 | { |
78ed81a3 | 65 | DB *db; |
66 | DBT key, content; | |
67 | char keybuf[2049]; | |
68 | char contentbuf[2049]; | |
69 | char buf[256]; | |
70 | int i; | |
71 | HASHINFO info; | |
15637ed4 | 72 | |
78ed81a3 | 73 | info.bsize = 1024; |
74 | info.ffactor = 5; | |
75 | info.nelem = 1; | |
76 | info.cachesize = NULL; | |
77 | #ifdef HASH_ID_PROGRAM_SPECIFIED | |
78 | info.hash_id = HASH_ID_PROGRAM_SPECIFIED; | |
79 | info.hash_func = my_hash; | |
80 | #else | |
81 | info.hash = my_hash; | |
82 | #endif | |
83 | info.lorder = 0; | |
84 | if (!(db = dbopen("bigtest", O_RDWR | O_CREAT, 0644, DB_HASH, &info))) { | |
85 | sprintf(buf, "dbopen: failed on file bigtest"); | |
86 | perror(buf); | |
15637ed4 RG |
87 | exit(1); |
88 | } | |
78ed81a3 | 89 | srandom(17); |
90 | key.data = keybuf; | |
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, | |
98 | content.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); | |
103 | perror(buf); | |
104 | } | |
105 | } | |
106 | if ((db->close)(db)) { | |
107 | perror("closing hash file"); | |
108 | exit(1); | |
15637ed4 | 109 | } |
15637ed4 RG |
110 | exit(0); |
111 | } | |
78ed81a3 | 112 | |
113 | ||
114 |