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