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