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