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