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. All advertising materials mentioning features or use of this software 17 * must display the following acknowledgement: 18 * This product includes software developed by the University of 19 * California, Berkeley and its contributors. 20 * 4. Neither the name of the University nor the names of its contributors 21 * may be used to endorse or promote products derived from this software 22 * without specific prior written permission. 23 * 24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 34 * SUCH DAMAGE. 35 * 36 * @(#) Copyright (c) 1991, 1993 The Regents of the University of California. All rights reserved. 37 * @(#)thash4.c 8.1 (Berkeley) 6/4/93 38 */ 39 40 #include <sys/types.h> 41 #include <sys/file.h> 42 #include <sys/timeb.h> 43 #include <stdio.h> 44 #include <errno.h> 45 #include <db.h> 46 47 #define INITIAL 25000 48 #define MAXWORDS 25000 /* # of elements in search table */ 49 50 /* Usage: thash pagesize fillfactor file */ 51 char wp1[8192]; 52 char wp2[8192]; 53 main(argc, argv) 54 char **argv; 55 { 56 DBT item, key, res; 57 DB *dbp; 58 HASHINFO ctl; 59 FILE *fp; 60 int stat; 61 time_t t; 62 63 int i = 0; 64 65 argv++; 66 ctl.hash = NULL; 67 ctl.bsize = atoi(*argv++); 68 ctl.ffactor = atoi(*argv++); 69 ctl.nelem = atoi(*argv++); 70 ctl.cachesize = atoi(*argv++); 71 ctl.lorder = 0; 72 if (!(dbp = dbopen( NULL, O_CREAT|O_RDWR, 0400, DB_HASH, &ctl))) { 73 /* create table */ 74 fprintf(stderr, "cannot create: hash table size %d)\n", 75 INITIAL); 76 fprintf(stderr, "\terrno: %d\n", errno); 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 /* 92 * enter key/data pair into the table 93 */ 94 if ((dbp->put)(dbp, &key, &item, R_NOOVERWRITE) != NULL) { 95 fprintf(stderr, "cannot enter: key %s\n", 96 item.data); 97 fprintf(stderr, "\terrno: %d\n", errno); 98 exit(1); 99 } 100 } 101 102 if ( --argc ) { 103 fp = fopen ( argv[0], "r"); 104 i = 0; 105 while ( fgets(wp1, 256, fp) && 106 fgets(wp2, 8192, fp) && 107 i++ < MAXWORDS) { 108 109 key.size = strlen(wp1); 110 stat = (dbp->get)(dbp, &key, &res, 0); 111 if (stat < 0 ) { 112 fprintf ( stderr, "Error retrieving %s\n", key.data ); 113 fprintf(stderr, "\terrno: %d\n", errno); 114 exit(1); 115 } else if ( stat > 0 ) { 116 fprintf ( stderr, "%s not found\n", key.data ); 117 fprintf(stderr, "\terrno: %d\n", errno); 118 exit(1); 119 } 120 } 121 fclose(fp); 122 } 123 dbp->close(dbp); 124 exit(0); 125 } 126