tcreat3.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[] = "@(#)tcreat3.c 8.1 (Berkeley) 6/4/93"; 451573Srgrimes#endif /* not lint */ 461573Srgrimes 471573Srgrimes#include <sys/types.h> 481573Srgrimes#include <sys/file.h> 491573Srgrimes#include <stdio.h> 501573Srgrimes#include <db.h> 511573Srgrimes 521573Srgrimes#define INITIAL 25000 531573Srgrimes#define MAXWORDS 25000 /* # of elements in search table */ 541573Srgrimes 551573Srgrimeschar wp1[8192]; 561573Srgrimeschar wp2[8192]; 571573Srgrimesmain(argc, argv) 581573Srgrimeschar **argv; 591573Srgrimes{ 601573Srgrimes DBT item, key; 611573Srgrimes DB *dbp; 621573Srgrimes HASHINFO ctl; 631573Srgrimes FILE *fp; 641573Srgrimes int trash; 651573Srgrimes 661573Srgrimes int i = 0; 671573Srgrimes 681573Srgrimes argv++; 691573Srgrimes ctl.hash = NULL; 701573Srgrimes ctl.bsize = atoi(*argv++); 711573Srgrimes ctl.ffactor = atoi(*argv++); 721573Srgrimes ctl.nelem = atoi(*argv++); 731573Srgrimes ctl.lorder = 0; 741573Srgrimes if (!(dbp = dbopen( "hashtest", 751573Srgrimes O_CREAT|O_TRUNC|O_RDWR, 0600, 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); 1001573Srgrimes } 1011573Srgrimes } 1021573Srgrimes 1031573Srgrimes (dbp->close)(dbp); 1041573Srgrimes exit(0); 1051573Srgrimes} 106