1 /*- 2 * SPDX-License-Identifier: BSD-3-Clause 3 * 4 * Copyright (c) 1991, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * This code is derived from software contributed to Berkeley by 8 * Margo Seltzer. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. Neither the name of the University nor the names of its contributors 19 * may be used to endorse or promote products derived from this software 20 * without specific prior written permission. 21 * 22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 32 * SUCH DAMAGE. 33 */ 34 35 #ifndef lint 36 static char copyright[] = 37 "@(#) Copyright (c) 1991, 1993\n\ 38 The Regents of the University of California. All rights reserved.\n"; 39 #endif /* not lint */ 40 41 #if defined(LIBC_SCCS) && !defined(lint) 42 static char sccsid[] = "@(#)tdel.c 8.1 (Berkeley) 6/4/93"; 43 #endif /* LIBC_SCCS and not lint */ 44 #include <sys/types.h> 45 #include <sys/file.h> 46 #include <db.h> 47 #include <stdio.h> 48 49 #define INITIAL 25000 50 #define MAXWORDS 25000 /* # of elements in search table */ 51 52 /* Usage: thash pagesize fillfactor file */ 53 char wp1[8192]; 54 char wp2[8192]; 55 main(argc, argv) 56 char **argv; 57 { 58 DBT item, key; 59 DB *dbp; 60 HASHINFO ctl; 61 FILE *fp; 62 int stat; 63 64 int i = 0; 65 66 argv++; 67 ctl.nelem = INITIAL; 68 ctl.hash = NULL; 69 ctl.bsize = atoi(*argv++); 70 ctl.ffactor = atoi(*argv++); 71 ctl.cachesize = 1024 * 1024; /* 1 MEG */ 72 ctl.lorder = 0; 73 argc -= 2; 74 if (!(dbp = dbopen( NULL, O_CREAT|O_RDWR, 0400, DB_HASH, &ctl))) { 75 /* create table */ 76 fprintf(stderr, "cannot create: hash table size %d)\n", 77 INITIAL); 78 exit(1); 79 } 80 81 key.data = wp1; 82 item.data = wp2; 83 while ( fgets(wp1, 8192, stdin) && 84 fgets(wp2, 8192, stdin) && 85 i++ < MAXWORDS) { 86 /* 87 * put info in structure, and structure in the item 88 */ 89 key.size = strlen(wp1); 90 item.size = strlen(wp2); 91 92 /* 93 * enter key/data pair into the table 94 */ 95 if ((dbp->put)(dbp, &key, &item, R_NOOVERWRITE) != NULL) { 96 fprintf(stderr, "cannot enter: key %s\n", 97 item.data); 98 exit(1); 99 } 100 } 101 102 if ( --argc ) { 103 fp = fopen ( argv[0], "r"); 104 i = 0; 105 while ( fgets(wp1, 8192, fp) && 106 fgets(wp2, 8192, fp) && 107 i++ < MAXWORDS) { 108 key.size = strlen(wp1); 109 stat = (dbp->del)(dbp, &key, 0); 110 if (stat) { 111 fprintf ( stderr, "Error retrieving %s\n", key.data ); 112 exit(1); 113 } 114 } 115 fclose(fp); 116 } 117 (dbp->close)(dbp); 118 exit(0); 119 } 120