lib/libc/db/hash/tests/tread2.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[] = "@(#)tread2.c    5.2 (Berkeley) 3/12/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 typedef struct {                       /* info to be stored */
  56         int num, siz;
  57 } info;
  58
  59 char    wp1[256];
  60 char    wp2[256];
  61 main(argc, argv)
  62 char **argv;
  63 {
  64         DBT item, key, res;
  65         DB      *dbp;
  66         HASHINFO ctl;
  67         int     stat;
  68
  69         int i = 0;
  70
  71         ctl.nelem = INITIAL;
  72         ctl.hash = NULL;
  73         ctl.bsize = 64;
  74         ctl.ffactor = 1;
  75         ctl.cachesize = atoi(*argv++);
  76         ctl.lorder = 0;
  77         if (!(dbp = hash_open( "hashtest", O_RDONLY, 0400, &ctl))) {
  78                 /* create table */
  79                 fprintf(stderr, "cannot open: hash table\n" );
  80                 exit(1);
  81         }
  82
  83         key.data = wp1;
  84         item.data = wp2;
  85         while ( fgets(wp1, 256, stdin) &&
  86                 fgets(wp2, 256, stdin) &&
  87                 i++ < MAXWORDS) {
  88 /*
  89 * put info in structure, and structure in the item
  90 */
  91                 key.size = strlen(wp1);
  92                 item.size = strlen(wp2);
  93
  94                 stat = (dbp->get)(dbp, &key, &res);
  95                 if (stat < 0) {
  96                     fprintf ( stderr, "Error retrieving %s\n", key.data );
  97                     exit(1);
  98                 } else if ( stat > 0 ) {
  99                     fprintf ( stderr, "%s not found\n", key.data );
 100                     exit(1);
 101                 }
 102         }
 103         (dbp->close)(dbp);
 104         exit(0);
 105 }