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. Neither the name of the University nor the names of its contributors 17 * may be used to endorse or promote products derived from this software 18 * without specific prior written permission. 19 * 20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 30 * SUCH DAMAGE. 31 * 32 * @(#) Copyright (c) 1991, 1993 The Regents of the University of California. All rights reserved. 33 * @(#)tread2.c 8.1 (Berkeley) 6/4/93 34 * $DragonFly: src/lib/libc/db/test/hash.tests/tread2.c,v 1.4 2005/11/12 23:01:55 swildner Exp $ 35 */ 36 37 #include <sys/types.h> 38 #include <sys/file.h> 39 #include <stdio.h> 40 #include <db.h> 41 42 #define INITIAL 25000 43 #define MAXWORDS 25000 /* # of elements in search table */ 44 45 typedef struct { /* info to be stored */ 46 int num, siz; 47 } info; 48 49 char wp1[8192]; 50 char wp2[8192]; 51 52 int 53 main(int argc, char **argv) 54 { 55 DBT item, key, res; 56 DB *dbp; 57 HASHINFO ctl; 58 int stat; 59 60 int i = 0; 61 62 ctl.nelem = INITIAL; 63 ctl.hash = NULL; 64 ctl.bsize = 64; 65 ctl.ffactor = 1; 66 ctl.cachesize = atoi(*argv++); 67 ctl.lorder = 0; 68 if (!(dbp = dbopen( "hashtest", O_RDONLY, 0400, DB_HASH, &ctl))) { 69 /* create table */ 70 fprintf(stderr, "cannot open: hash table\n" ); 71 exit(1); 72 } 73 74 key.data = wp1; 75 item.data = wp2; 76 while ( fgets(wp1, 8192, stdin) && 77 fgets(wp2, 8192, stdin) && 78 i++ < MAXWORDS) { 79 /* 80 * put info in structure, and structure in the item 81 */ 82 key.size = strlen(wp1); 83 item.size = strlen(wp2); 84 85 stat = (dbp->get)(dbp, &key, &res,0); 86 if (stat < 0) { 87 fprintf ( stderr, "Error retrieving %s\n", key.data ); 88 exit(1); 89 } else if ( stat > 0 ) { 90 fprintf ( stderr, "%s not found\n", key.data ); 91 exit(1); 92 } 93 } 94 (dbp->close)(dbp); 95 exit(0); 96 } 97