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