xref: /freebsd/lib/libc/db/test/hash.tests/thash4.c (revision 6780ab54325a71e7e70112b11657973edde8655e)
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  * 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
38 static char copyright[] =
39 "@(#) Copyright (c) 1991, 1993\n\
40 	The Regents of the University of California.  All rights reserved.\n";
41 #endif /* not lint */
42 
43 #if defined(LIBC_SCCS) && !defined(lint)
44 static char sccsid[] = "@(#)thash4.c	8.1 (Berkeley) 6/4/93";
45 #endif /* LIBC_SCCS and not lint */
46 #include <sys/cdefs.h>
47 __FBSDID("$FreeBSD$");
48 
49 #include <sys/types.h>
50 #include <sys/file.h>
51 #include <sys/timeb.h>
52 #include <stdio.h>
53 #include <errno.h>
54 #include <db.h>
55 
56 #define INITIAL	25000
57 #define MAXWORDS    25000	       /* # of elements in search table */
58 
59 /* Usage: thash pagesize fillfactor file */
60 char	wp1[8192];
61 char	wp2[8192];
62 main(argc, argv)
63 char **argv;
64 {
65 	DBT item, key, res;
66 	DB *dbp;
67 	HASHINFO ctl;
68 	FILE *fp;
69 	int	stat;
70 	time_t	t;
71 
72 	int i = 0;
73 
74 	argv++;
75 	ctl.hash = NULL;
76 	ctl.bsize = atoi(*argv++);
77 	ctl.ffactor = atoi(*argv++);
78 	ctl.nelem = atoi(*argv++);
79 	ctl.cachesize = atoi(*argv++);
80 	ctl.lorder = 0;
81 	if (!(dbp = dbopen( NULL, O_CREAT|O_RDWR, 0400, DB_HASH, &ctl))) {
82 		/* create table */
83 		fprintf(stderr, "cannot create: hash table size %d)\n",
84 			INITIAL);
85 		fprintf(stderr, "\terrno: %d\n", errno);
86 		exit(1);
87 	}
88 
89 	key.data = wp1;
90 	item.data = wp2;
91 	while ( fgets(wp1, 8192, stdin) &&
92 		fgets(wp2, 8192, stdin) &&
93 		i++ < MAXWORDS) {
94 /*
95 * put info in structure, and structure in the item
96 */
97 		key.size = strlen(wp1);
98 		item.size = strlen(wp2);
99 
100 /*
101  * enter key/data pair into the table
102  */
103 		if ((dbp->put)(dbp, &key, &item, R_NOOVERWRITE) != NULL) {
104 			fprintf(stderr, "cannot enter: key %s\n",
105 				item.data);
106 			fprintf(stderr, "\terrno: %d\n", errno);
107 			exit(1);
108 		}
109 	}
110 
111 	if ( --argc ) {
112 		fp = fopen ( argv[0], "r");
113 		i = 0;
114 		while ( fgets(wp1, 256, fp) &&
115 			fgets(wp2, 8192, fp) &&
116 			i++ < MAXWORDS) {
117 
118 		    key.size = strlen(wp1);
119 		    stat = (dbp->get)(dbp, &key, &res, 0);
120 		    if (stat < 0 ) {
121 			fprintf ( stderr, "Error retrieving %s\n", key.data );
122 			fprintf(stderr, "\terrno: %d\n", errno);
123 			exit(1);
124 		    } else if ( stat > 0 ) {
125 			fprintf ( stderr, "%s not found\n", key.data );
126 			fprintf(stderr, "\terrno: %d\n", errno);
127 			exit(1);
128 		    }
129 		}
130 		fclose(fp);
131 	}
132 	dbp->close(dbp);
133 	exit(0);
134 }
135