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 <stdio.h>
38#include <db.h>
39
40#define INITIAL	25000
41#define MAXWORDS    25000	       /* # of elements in search table */
42
43char	wp1[8192];
44char	wp2[8192];
45main(argc, argv)
46char **argv;
47{
48	DBT item, key;
49	DB	*dbp;
50	HASHINFO ctl;
51	FILE *fp;
52	int	trash;
53
54	int i = 0;
55
56	argv++;
57	ctl.hash = NULL;
58	ctl.bsize = atoi(*argv++);
59	ctl.ffactor = atoi(*argv++);
60	ctl.nelem = atoi(*argv++);
61	ctl.lorder = 0;
62	if (!(dbp = dbopen( "hashtest",
63	    O_CREAT|O_TRUNC|O_RDWR, 0600, DB_HASH, &ctl))){
64		/* create table */
65		fprintf(stderr, "cannot create: hash table (size %d)\n",
66			INITIAL);
67		exit(1);
68	}
69
70	key.data = wp1;
71	item.data = wp2;
72	while ( fgets(wp1, 8192, stdin) &&
73		fgets(wp2, 8192, stdin) &&
74		i++ < MAXWORDS) {
75/*
76* put info in structure, and structure in the item
77*/
78		key.size = strlen(wp1);
79		item.size = strlen(wp2);
80
81/*
82 * enter key/data pair into the table
83 */
84		if ((dbp->put)(dbp, &key, &item, R_NOOVERWRITE) != NULL) {
85			fprintf(stderr, "cannot enter: key %s\n",
86				item.data);
87			exit(1);
88		}
89	}
90
91	(dbp->close)(dbp);
92	exit(0);
93}
94