Path: blob/main/lib/libc/db/test/hash.tests/tcreat3.c
39583 views
/*-1* SPDX-License-Identifier: BSD-3-Clause2*3* Copyright (c) 1991, 19934* The Regents of the University of California. All rights reserved.5*6* This code is derived from software contributed to Berkeley by7* Margo Seltzer.8*9* Redistribution and use in source and binary forms, with or without10* modification, are permitted provided that the following conditions11* are met:12* 1. Redistributions of source code must retain the above copyright13* notice, this list of conditions and the following disclaimer.14* 2. Redistributions in binary form must reproduce the above copyright15* notice, this list of conditions and the following disclaimer in the16* documentation and/or other materials provided with the distribution.17* 3. Neither the name of the University nor the names of its contributors18* may be used to endorse or promote products derived from this software19* without specific prior written permission.20*21* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND22* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE23* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE24* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE25* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL26* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS27* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)28* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT29* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY30* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF31* SUCH DAMAGE.32*/3334#include <sys/types.h>35#include <sys/file.h>36#include <stdio.h>37#include <db.h>3839#define INITIAL 2500040#define MAXWORDS 25000 /* # of elements in search table */4142char wp1[8192];43char wp2[8192];44main(argc, argv)45char **argv;46{47DBT item, key;48DB *dbp;49HASHINFO ctl;50FILE *fp;51int trash;5253int i = 0;5455argv++;56ctl.hash = NULL;57ctl.bsize = atoi(*argv++);58ctl.ffactor = atoi(*argv++);59ctl.nelem = atoi(*argv++);60ctl.lorder = 0;61if (!(dbp = dbopen( "hashtest",62O_CREAT|O_TRUNC|O_RDWR, 0600, DB_HASH, &ctl))){63/* create table */64fprintf(stderr, "cannot create: hash table (size %d)\n",65INITIAL);66exit(1);67}6869key.data = wp1;70item.data = wp2;71while ( fgets(wp1, 8192, stdin) &&72fgets(wp2, 8192, stdin) &&73i++ < MAXWORDS) {74/*75* put info in structure, and structure in the item76*/77key.size = strlen(wp1);78item.size = strlen(wp2);7980/*81* enter key/data pair into the table82*/83if ((dbp->put)(dbp, &key, &item, R_NOOVERWRITE) != NULL) {84fprintf(stderr, "cannot enter: key %s\n",85item.data);86exit(1);87}88}8990(dbp->close)(dbp);91exit(0);92}939495