1 /*-
2 * SPDX-License-Identifier: BSD-3-Clause
3 *
4 * Copyright (c) 1991, 1993
5 * The Regents of the University of California. All rights reserved.
6 *
7 * This code is derived from software contributed to Berkeley by
8 * Margo Seltzer.
9 *
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
21 *
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 * SUCH DAMAGE.
33 */
34
35 #include <sys/types.h>
36 #include <sys/file.h>
37 #include <sys/timeb.h>
38 #include <stdio.h>
39 #include <errno.h>
40 #include <db.h>
41
42 #define INITIAL 25000
43 #define MAXWORDS 25000 /* # of elements in search table */
44
45 /* Usage: thash pagesize fillfactor file */
46 char wp1[8192];
47 char wp2[8192];
main(argc,argv)48 main(argc, argv)
49 char **argv;
50 {
51 DBT item, key, res;
52 DB *dbp;
53 HASHINFO ctl;
54 FILE *fp;
55 int stat;
56 time_t t;
57
58 int i = 0;
59
60 argv++;
61 ctl.hash = NULL;
62 ctl.bsize = atoi(*argv++);
63 ctl.ffactor = atoi(*argv++);
64 ctl.nelem = atoi(*argv++);
65 ctl.cachesize = atoi(*argv++);
66 ctl.lorder = 0;
67 if (!(dbp = dbopen( NULL, O_CREAT|O_RDWR, 0400, DB_HASH, &ctl))) {
68 /* create table */
69 fprintf(stderr, "cannot create: hash table size %d)\n",
70 INITIAL);
71 fprintf(stderr, "\terrno: %d\n", errno);
72 exit(1);
73 }
74
75 key.data = wp1;
76 item.data = wp2;
77 while ( fgets(wp1, 8192, stdin) &&
78 fgets(wp2, 8192, stdin) &&
79 i++ < MAXWORDS) {
80 /*
81 * put info in structure, and structure in the item
82 */
83 key.size = strlen(wp1);
84 item.size = strlen(wp2);
85
86 /*
87 * enter key/data pair into the table
88 */
89 if ((dbp->put)(dbp, &key, &item, R_NOOVERWRITE) != NULL) {
90 fprintf(stderr, "cannot enter: key %s\n",
91 item.data);
92 fprintf(stderr, "\terrno: %d\n", errno);
93 exit(1);
94 }
95 }
96
97 if ( --argc ) {
98 fp = fopen ( argv[0], "r");
99 i = 0;
100 while ( fgets(wp1, 256, fp) &&
101 fgets(wp2, 8192, fp) &&
102 i++ < MAXWORDS) {
103
104 key.size = strlen(wp1);
105 stat = (dbp->get)(dbp, &key, &res, 0);
106 if (stat < 0 ) {
107 fprintf ( stderr, "Error retrieving %s\n", key.data );
108 fprintf(stderr, "\terrno: %d\n", errno);
109 exit(1);
110 } else if ( stat > 0 ) {
111 fprintf ( stderr, "%s not found\n", key.data );
112 fprintf(stderr, "\terrno: %d\n", errno);
113 exit(1);
114 }
115 }
116 fclose(fp);
117 }
118 dbp->close(dbp);
119 exit(0);
120 }
121