11573Srgrimes/*-
21573Srgrimes * Copyright (c) 1991, 1993
31573Srgrimes *	The Regents of the University of California.  All rights reserved.
41573Srgrimes *
51573Srgrimes * This code is derived from software contributed to Berkeley by
61573Srgrimes * Margo Seltzer.
71573Srgrimes *
81573Srgrimes * Redistribution and use in source and binary forms, with or without
91573Srgrimes * modification, are permitted provided that the following conditions
101573Srgrimes * are met:
111573Srgrimes * 1. Redistributions of source code must retain the above copyright
121573Srgrimes *    notice, this list of conditions and the following disclaimer.
131573Srgrimes * 2. Redistributions in binary form must reproduce the above copyright
141573Srgrimes *    notice, this list of conditions and the following disclaimer in the
151573Srgrimes *    documentation and/or other materials provided with the distribution.
161573Srgrimes * 4. Neither the name of the University nor the names of its contributors
171573Srgrimes *    may be used to endorse or promote products derived from this software
181573Srgrimes *    without specific prior written permission.
191573Srgrimes *
201573Srgrimes * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
211573Srgrimes * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
221573Srgrimes * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
231573Srgrimes * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
241573Srgrimes * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
251573Srgrimes * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
261573Srgrimes * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
271573Srgrimes * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
281573Srgrimes * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
291573Srgrimes * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
301573Srgrimes * SUCH DAMAGE.
311573Srgrimes */
321573Srgrimes
331573Srgrimes#ifndef lint
341573Srgrimesstatic char copyright[] =
351573Srgrimes"@(#) Copyright (c) 1991, 1993\n\
361573Srgrimes	The Regents of the University of California.  All rights reserved.\n";
371573Srgrimes#endif /* not lint */
381573Srgrimes
3992986Sobrien#if defined(LIBC_SCCS) && !defined(lint)
401573Srgrimesstatic char sccsid[] = "@(#)tdel.c	8.1 (Berkeley) 6/4/93";
4192986Sobrien#endif /* LIBC_SCCS and not lint */
4292986Sobrien#include <sys/cdefs.h>
4392986Sobrien__FBSDID("$FreeBSD$");
441573Srgrimes
451573Srgrimes#include <sys/types.h>
461573Srgrimes#include <sys/file.h>
471573Srgrimes#include <db.h>
481573Srgrimes#include <stdio.h>
491573Srgrimes
501573Srgrimes#define INITIAL	25000
511573Srgrimes#define MAXWORDS    25000	       /* # of elements in search table */
521573Srgrimes
531573Srgrimes/* Usage: thash pagesize fillfactor file */
541573Srgrimeschar	wp1[8192];
551573Srgrimeschar	wp2[8192];
561573Srgrimesmain(argc, argv)
571573Srgrimeschar **argv;
581573Srgrimes{
591573Srgrimes	DBT item, key;
601573Srgrimes	DB	*dbp;
611573Srgrimes	HASHINFO ctl;
621573Srgrimes	FILE *fp;
631573Srgrimes	int	stat;
641573Srgrimes
651573Srgrimes	int i = 0;
661573Srgrimes
671573Srgrimes	argv++;
681573Srgrimes	ctl.nelem = INITIAL;
691573Srgrimes	ctl.hash = NULL;
701573Srgrimes	ctl.bsize = atoi(*argv++);
711573Srgrimes	ctl.ffactor = atoi(*argv++);
721573Srgrimes	ctl.cachesize = 1024 * 1024;	/* 1 MEG */
731573Srgrimes	ctl.lorder = 0;
741573Srgrimes	argc -= 2;
751573Srgrimes	if (!(dbp = dbopen( NULL, O_CREAT|O_RDWR, 0400, DB_HASH, &ctl))) {
761573Srgrimes		/* create table */
771573Srgrimes		fprintf(stderr, "cannot create: hash table size %d)\n",
781573Srgrimes			INITIAL);
791573Srgrimes		exit(1);
801573Srgrimes	}
811573Srgrimes
821573Srgrimes	key.data = wp1;
831573Srgrimes	item.data = wp2;
841573Srgrimes	while ( fgets(wp1, 8192, stdin) &&
851573Srgrimes		fgets(wp2, 8192, stdin) &&
861573Srgrimes		i++ < MAXWORDS) {
871573Srgrimes/*
881573Srgrimes* put info in structure, and structure in the item
891573Srgrimes*/
901573Srgrimes		key.size = strlen(wp1);
911573Srgrimes		item.size = strlen(wp2);
921573Srgrimes
931573Srgrimes/*
941573Srgrimes * enter key/data pair into the table
951573Srgrimes */
961573Srgrimes		if ((dbp->put)(dbp, &key, &item, R_NOOVERWRITE) != NULL) {
971573Srgrimes			fprintf(stderr, "cannot enter: key %s\n",
981573Srgrimes				item.data);
991573Srgrimes			exit(1);
1008870Srgrimes		}
1011573Srgrimes	}
1021573Srgrimes
1031573Srgrimes	if ( --argc ) {
1041573Srgrimes		fp = fopen ( argv[0], "r");
1051573Srgrimes		i = 0;
1061573Srgrimes		while ( fgets(wp1, 8192, fp) &&
1071573Srgrimes			fgets(wp2, 8192, fp) &&
1081573Srgrimes			i++ < MAXWORDS) {
1091573Srgrimes		    key.size = strlen(wp1);
1101573Srgrimes		    stat = (dbp->del)(dbp, &key, 0);
1111573Srgrimes		    if (stat) {
1121573Srgrimes			fprintf ( stderr, "Error retrieving %s\n", key.data );
1131573Srgrimes			exit(1);
1148870Srgrimes		    }
1151573Srgrimes		}
1161573Srgrimes		fclose(fp);
1171573Srgrimes	}
1181573Srgrimes	(dbp->close)(dbp);
1191573Srgrimes	exit(0);
1201573Srgrimes}
121