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