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[] = "@(#)tcreat3.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 <stdio.h>
481573Srgrimes#include <db.h>
491573Srgrimes
501573Srgrimes#define INITIAL	25000
511573Srgrimes#define MAXWORDS    25000	       /* # of elements in search table */
521573Srgrimes
531573Srgrimeschar	wp1[8192];
541573Srgrimeschar	wp2[8192];
551573Srgrimesmain(argc, argv)
561573Srgrimeschar **argv;
571573Srgrimes{
581573Srgrimes	DBT item, key;
591573Srgrimes	DB	*dbp;
601573Srgrimes	HASHINFO ctl;
611573Srgrimes	FILE *fp;
621573Srgrimes	int	trash;
631573Srgrimes
641573Srgrimes	int i = 0;
651573Srgrimes
661573Srgrimes	argv++;
671573Srgrimes	ctl.hash = NULL;
681573Srgrimes	ctl.bsize = atoi(*argv++);
691573Srgrimes	ctl.ffactor = atoi(*argv++);
701573Srgrimes	ctl.nelem = atoi(*argv++);
711573Srgrimes	ctl.lorder = 0;
721573Srgrimes	if (!(dbp = dbopen( "hashtest",
731573Srgrimes	    O_CREAT|O_TRUNC|O_RDWR, 0600, DB_HASH, &ctl))){
741573Srgrimes		/* create table */
751573Srgrimes		fprintf(stderr, "cannot create: hash table (size %d)\n",
761573Srgrimes			INITIAL);
771573Srgrimes		exit(1);
781573Srgrimes	}
791573Srgrimes
801573Srgrimes	key.data = wp1;
811573Srgrimes	item.data = wp2;
821573Srgrimes	while ( fgets(wp1, 8192, stdin) &&
831573Srgrimes		fgets(wp2, 8192, stdin) &&
841573Srgrimes		i++ < MAXWORDS) {
851573Srgrimes/*
861573Srgrimes* put info in structure, and structure in the item
871573Srgrimes*/
881573Srgrimes		key.size = strlen(wp1);
891573Srgrimes		item.size = strlen(wp2);
901573Srgrimes
911573Srgrimes/*
921573Srgrimes * enter key/data pair into the table
931573Srgrimes */
941573Srgrimes		if ((dbp->put)(dbp, &key, &item, R_NOOVERWRITE) != NULL) {
951573Srgrimes			fprintf(stderr, "cannot enter: key %s\n",
961573Srgrimes				item.data);
971573Srgrimes			exit(1);
988870Srgrimes		}
991573Srgrimes	}
1001573Srgrimes
1011573Srgrimes	(dbp->close)(dbp);
1021573Srgrimes	exit(0);
1031573Srgrimes}
104