xref: /dragonfly/lib/libc/db/test/hash.tests/tread2.c (revision cfd1aba3)
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. 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  * @(#)tread2.c	8.1 (Berkeley) 6/4/93
33  * $FreeBSD: head/lib/libc/db/test/hash.tests/tread2.c 165903 2007-01-09 00:28:16Z imp $
34  */
35 
36 #include <sys/types.h>
37 #include <sys/file.h>
38 #include <stdio.h>
39 #include <db.h>
40 
41 #define INITIAL	25000
42 #define MAXWORDS    25000	       /* # of elements in search table */
43 
44 typedef struct {		       /* info to be stored */
45 	int num, siz;
46 } info;
47 
48 char	wp1[8192];
49 char	wp2[8192];
50 
51 int
52 main(int argc, char **argv)
53 {
54 	DBT item, key, res;
55 	DB	*dbp;
56 	HASHINFO ctl;
57 	int	stat;
58 
59 	int i = 0;
60 
61 	ctl.nelem = INITIAL;
62 	ctl.hash = NULL;
63 	ctl.bsize = 64;
64 	ctl.ffactor = 1;
65 	ctl.cachesize = atoi(*argv++);
66 	ctl.lorder = 0;
67 	if (!(dbp = dbopen( "hashtest", O_RDONLY, 0400, DB_HASH, &ctl))) {
68 		/* create table */
69 		fprintf(stderr, "cannot open: hash table\n" );
70 		exit(1);
71 	}
72 
73 	key.data = wp1;
74 	item.data = wp2;
75 	while ( fgets(wp1, 8192, stdin) &&
76 		fgets(wp2, 8192, stdin) &&
77 		i++ < MAXWORDS) {
78 /*
79 * put info in structure, and structure in the item
80 */
81 		key.size = strlen(wp1);
82 		item.size = strlen(wp2);
83 
84 		stat = (dbp->get)(dbp, &key, &res,0);
85 		if (stat < 0) {
86 		    fprintf ( stderr, "Error retrieving %s\n", key.data );
87 		    exit(1);
88 		} else if ( stat > 0 ) {
89 		    fprintf ( stderr, "%s not found\n", key.data );
90 		    exit(1);
91 		}
92 	}
93 	(dbp->close)(dbp);
94 	exit(0);
95 }
96