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