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