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 #ifndef lint 36 static char copyright[] = 37 "@(#) Copyright (c) 1991, 1993\n\ 38 The Regents of the University of California. All rights reserved.\n"; 39 #endif /* not lint */ 40 41 #if defined(LIBC_SCCS) && !defined(lint) 42 static char sccsid[] = "@(#)tread2.c 8.1 (Berkeley) 6/4/93"; 43 #endif /* LIBC_SCCS and not lint */ 44 #include <sys/types.h> 45 #include <sys/file.h> 46 #include <stdio.h> 47 #include <db.h> 48 49 #define INITIAL 25000 50 #define MAXWORDS 25000 /* # of elements in search table */ 51 52 typedef struct { /* info to be stored */ 53 int num, siz; 54 } info; 55 56 char wp1[8192]; 57 char wp2[8192]; 58 main(argc, argv) 59 char **argv; 60 { 61 DBT item, key, res; 62 DB *dbp; 63 HASHINFO ctl; 64 int stat; 65 66 int i = 0; 67 68 ctl.nelem = INITIAL; 69 ctl.hash = NULL; 70 ctl.bsize = 64; 71 ctl.ffactor = 1; 72 ctl.cachesize = atoi(*argv++); 73 ctl.lorder = 0; 74 if (!(dbp = dbopen( "hashtest", O_RDONLY, 0400, DB_HASH, &ctl))) { 75 /* create table */ 76 fprintf(stderr, "cannot open: hash table\n" ); 77 exit(1); 78 } 79 80 key.data = wp1; 81 item.data = wp2; 82 while ( fgets(wp1, 8192, stdin) && 83 fgets(wp2, 8192, stdin) && 84 i++ < MAXWORDS) { 85 /* 86 * put info in structure, and structure in the item 87 */ 88 key.size = strlen(wp1); 89 item.size = strlen(wp2); 90 91 stat = (dbp->get)(dbp, &key, &res,0); 92 if (stat < 0) { 93 fprintf ( stderr, "Error retrieving %s\n", key.data ); 94 exit(1); 95 } else if ( stat > 0 ) { 96 fprintf ( stderr, "%s not found\n", key.data ); 97 exit(1); 98 } 99 } 100 (dbp->close)(dbp); 101 exit(0); 102 } 103