xref: /freebsd/lib/libc/db/test/hash.tests/tverify.c (revision 06c3fb2749bda94cb5201f81ffdb8fa6c3161b2e)
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 
43 typedef struct {		       /* info to be stored */
44 	int num, siz;
45 } info;
46 
47 char	wp1[8192];
48 char	wp2[8192];
49 main(argc, argv)
50 char **argv;
51 {
52 	DBT key, res;
53 	DB	*dbp;
54 	HASHINFO ctl;
55 	int	trash;
56 	int	stat;
57 
58 	int i = 0;
59 
60 	ctl.nelem = INITIAL;
61 	ctl.hash = NULL;
62 	ctl.bsize = 64;
63 	ctl.ffactor = 1;
64 	ctl.cachesize = 1024 * 1024;	/* 1 MEG */
65 	ctl.lorder = 0;
66 	if (!(dbp = dbopen( "hashtest", O_RDONLY, 0400, DB_HASH, &ctl))) {
67 		/* create table */
68 		fprintf(stderr, "cannot open: hash table\n" );
69 		exit(1);
70 	}
71 
72 	key.data = wp1;
73 	while ( fgets(wp1, 8192, stdin) &&
74 		fgets(wp2, 8192, stdin) &&
75 		i++ < MAXWORDS) {
76 /*
77 * put info in structure, and structure in the item
78 */
79 		key.size = strlen(wp1);
80 
81 		stat = (dbp->get)(dbp, &key, &res,0);
82 		if (stat < 0) {
83 		    fprintf ( stderr, "Error retrieving %s\n", key.data );
84 		    exit(1);
85 		} else if ( stat > 0 ) {
86 		    fprintf ( stderr, "%s not found\n", key.data );
87 		    exit(1);
88 		}
89 		if ( memcmp ( res.data, wp2, res.size ) ) {
90 		    fprintf ( stderr, "data for %s is incorrect.  Data was %s.  Should have been %s\n", key.data, res.data, wp2 );
91 		}
92 	}
93 	(dbp->close)(dbp);
94 	exit(0);
95 }
96