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