lib/libc/db/hash/tests/tcreat3.c

   1 /*-
   2  * Copyright (c) 1990 The Regents of the University of California.
   3  * All rights reserved.
   4  *
   5  * This code is derived from software contributed to Berkeley by
   6  * Margo Seltzer.
   7  *
   8  * Redistribution and use in source and binary forms, with or without
   9  * modification, are permitted provided that the following conditions
  10  * are met:
  11  * 1. Redistributions of source code must retain the above copyright
  12  *    notice, this list of conditions and the following disclaimer.
  13  * 2. Redistributions in binary form must reproduce the above copyright
  14  *    notice, this list of conditions and the following disclaimer in the
  15  *    documentation and/or other materials provided with the distribution.
  16  * 3. All advertising materials mentioning features or use of this software
  17  *    must display the following acknowledgement:
  18  *      This product includes software developed by the University of
  19  *      California, Berkeley and its contributors.
  20  * 4. Neither the name of the University nor the names of its contributors
  21  *    may be used to endorse or promote products derived from this software
  22  *    without specific prior written permission.
  23  *
  24  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  25  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  26  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  27  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  28  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  29  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  30  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  31  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  32  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  33  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  34  * SUCH DAMAGE.
  35  */
  36
  37 #ifndef lint
  38 char copyright[] =
  39 "@(#) Copyright (c) 1990 The Regents of the University of California.\n\
  40  All rights reserved.\n";
  41 #endif /* not lint */
  42
  43 #ifndef lint
  44 static char sccsid[] = "@(#)tcreat3.c   5.1 (Berkeley) 1/31/91";
  45 #endif /* not lint */
  46
  47 #include <sys/types.h>
  48 #include <stdio.h>
  49 #include <sys/file.h>
  50 #include <db.h>
  51
  52 #define INITIAL 25000
  53 #define MAXWORDS    25000              /* # of elements in search table */
  54
  55 char    wp1[8192];
  56 char    wp2[8192];
  57 main(argc, argv)
  58 char **argv;
  59 {
  60         DBT item, key;
  61         DB      *dbp;
  62         HASHINFO ctl;
  63         FILE *fp;
  64         int     trash;
  65
  66         int i = 0;
  67
  68         argv++;
  69         ctl.hash = NULL;
  70         ctl.bsize = atoi(*argv++);
  71         ctl.ffactor = atoi(*argv++);
  72         ctl.nelem = atoi(*argv++);
  73         ctl.lorder = 0;
  74         if (!(dbp = hash_open( "hashtest", O_CREAT|O_TRUNC|O_RDWR, 0600, &ctl))){
  75                 /* create table */
  76                 fprintf(stderr, "cannot create: hash table (size %d)\n",
  77                         INITIAL);
  78                 exit(1);
  79         }
  80
  81         key.data = wp1;
  82         item.data = wp2;
  83         while ( fgets(wp1, 8192, stdin) &&
  84                 fgets(wp2, 8192, stdin) &&
  85                 i++ < MAXWORDS) {
  86 /*
  87 * put info in structure, and structure in the item
  88 */
  89                 key.size = strlen(wp1);
  90                 item.size = strlen(wp2);
  91
  92 /*
  93  * enter key/data pair into the table
  94  */
  95                 if ((dbp->put)(dbp, &key, &item, R_NOOVERWRITE) != NULL) {
  96                         fprintf(stderr, "cannot enter: key %s\n",
  97                                 item.data);
  98                         exit(1);
  99                 }
 100         }
 101
 102         (dbp->close)(dbp);
 103         exit(0);
 104 }