2 * Copyright (c) 1991, 1993
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
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. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * @(#) Copyright (c) 1991, 1993 The Regents of the University of California. All rights reserved.
37 * @(#)tdel.c 8.1 (Berkeley) 6/4/93
40 #include <sys/types.h>
46 #define MAXWORDS 25000 /* # of elements in search table */
48 /* Usage: thash pagesize fillfactor file */
65 ctl.bsize = atoi(*argv++);
66 ctl.ffactor = atoi(*argv++);
67 ctl.cachesize = 1024 * 1024; /* 1 MEG */
70 if (!(dbp = dbopen( NULL, O_CREAT|O_RDWR, 0400, DB_HASH, &ctl))) {
72 fprintf(stderr, "cannot create: hash table size %d)\n",
79 while ( fgets(wp1, 8192, stdin) &&
80 fgets(wp2, 8192, stdin) &&
83 * put info in structure, and structure in the item
85 key.size = strlen(wp1);
86 item.size = strlen(wp2);
89 * enter key/data pair into the table
91 if ((dbp->put)(dbp, &key, &item, R_NOOVERWRITE) != NULL) {
92 fprintf(stderr, "cannot enter: key %s\n",
99 fp = fopen ( argv[0], "r");
101 while ( fgets(wp1, 8192, fp) &&
102 fgets(wp2, 8192, fp) &&
104 key.size = strlen(wp1);
105 stat = (dbp->del)(dbp, &key, 0);
107 fprintf ( stderr, "Error retrieving %s\n", key.data );