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