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