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[] = "@(#)thash4.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 <sys/timeb.h>
481573Srgrimes#include <stdio.h>
491573Srgrimes#include <errno.h>
501573Srgrimes#include <db.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, res;
621573Srgrimes	DB *dbp;
631573Srgrimes	HASHINFO ctl;
641573Srgrimes	FILE *fp;
651573Srgrimes	int	stat;
661573Srgrimes	time_t	t;
671573Srgrimes
681573Srgrimes	int i = 0;
691573Srgrimes
701573Srgrimes	argv++;
711573Srgrimes	ctl.hash = NULL;
721573Srgrimes	ctl.bsize = atoi(*argv++);
731573Srgrimes	ctl.ffactor = atoi(*argv++);
741573Srgrimes	ctl.nelem = atoi(*argv++);
751573Srgrimes	ctl.cachesize = atoi(*argv++);
761573Srgrimes	ctl.lorder = 0;
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		fprintf(stderr, "\terrno: %d\n", errno);
821573Srgrimes		exit(1);
831573Srgrimes	}
841573Srgrimes
851573Srgrimes	key.data = wp1;
861573Srgrimes	item.data = wp2;
878870Srgrimes	while ( fgets(wp1, 8192, stdin) &&
888870Srgrimes		fgets(wp2, 8192, stdin) &&
891573Srgrimes		i++ < MAXWORDS) {
901573Srgrimes/*
911573Srgrimes* put info in structure, and structure in the item
921573Srgrimes*/
931573Srgrimes		key.size = strlen(wp1);
941573Srgrimes		item.size = strlen(wp2);
951573Srgrimes
961573Srgrimes/*
971573Srgrimes * enter key/data pair into the table
981573Srgrimes */
991573Srgrimes		if ((dbp->put)(dbp, &key, &item, R_NOOVERWRITE) != NULL) {
1001573Srgrimes			fprintf(stderr, "cannot enter: key %s\n",
1011573Srgrimes				item.data);
1021573Srgrimes			fprintf(stderr, "\terrno: %d\n", errno);
1031573Srgrimes			exit(1);
1048870Srgrimes		}
1051573Srgrimes	}
1061573Srgrimes
1071573Srgrimes	if ( --argc ) {
1081573Srgrimes		fp = fopen ( argv[0], "r");
1091573Srgrimes		i = 0;
1108870Srgrimes		while ( fgets(wp1, 256, fp) &&
1118870Srgrimes			fgets(wp2, 8192, fp) &&
1121573Srgrimes			i++ < MAXWORDS) {
1131573Srgrimes
1141573Srgrimes		    key.size = strlen(wp1);
1151573Srgrimes		    stat = (dbp->get)(dbp, &key, &res, 0);
1161573Srgrimes		    if (stat < 0 ) {
1171573Srgrimes			fprintf ( stderr, "Error retrieving %s\n", key.data );
1181573Srgrimes			fprintf(stderr, "\terrno: %d\n", errno);
1191573Srgrimes			exit(1);
1201573Srgrimes		    } else if ( stat > 0 ) {
1211573Srgrimes			fprintf ( stderr, "%s not found\n", key.data );
1221573Srgrimes			fprintf(stderr, "\terrno: %d\n", errno);
1231573Srgrimes			exit(1);
1241573Srgrimes		    }
1251573Srgrimes		}
1261573Srgrimes		fclose(fp);
1271573Srgrimes	}
1281573Srgrimes	dbp->close(dbp);
1291573Srgrimes	exit(0);
1301573Srgrimes}
131