db.1.85/test/hash.tests/thash4.c

   1 /*-
   2  * Copyright (c) 1991, 1993
   3  *      The Regents of the University of California.  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 static char copyright[] =
  39 "@(#) Copyright (c) 1991, 1993\n\
  40         The Regents of the University of California.  All rights reserved.\n";
  41 #endif /* not lint */
  42
  43 #ifndef lint
  44 static char sccsid[] = "@(#)thash4.c    8.1 (Berkeley) 6/4/93";
  45 #endif /* not lint */
  46
  47 #include <sys/types.h>
  48 #include <sys/file.h>
  49 #include <sys/timeb.h>
  50 #include <stdio.h>
  51 #include <errno.h>
  52 #include <db.h>
  53
  54 #define INITIAL 25000
  55 #define MAXWORDS    25000              /* # of elements in search table */
  56
  57 /* Usage: thash pagesize fillfactor file */
  58 char    wp1[8192];
  59 char    wp2[8192];
  60 main(argc, argv)
  61 char **argv;
  62 {
  63         DBT item, key, res;
  64         DB *dbp;
  65         HASHINFO ctl;
  66         FILE *fp;
  67         int     stat;
  68         time_t  t;
  69
  70         int i = 0;
  71
  72         argv++;
  73         ctl.hash = NULL;
  74         ctl.bsize = atoi(*argv++);
  75         ctl.ffactor = atoi(*argv++);
  76         ctl.nelem = atoi(*argv++);
  77         ctl.cachesize = atoi(*argv++);
  78         ctl.lorder = 0;
  79         if (!(dbp = dbopen( NULL, O_CREAT|O_RDWR, 0400, DB_HASH, &ctl))) {
  80                 /* create table */
  81                 fprintf(stderr, "cannot create: hash table size %d)\n",
  82                         INITIAL);
  83                 fprintf(stderr, "\terrno: %d\n", errno);
  84                 exit(1);
  85         }
  86
  87         key.data = wp1;
  88         item.data = wp2;
  89         while ( fgets(wp1, 8192, stdin) &&
  90                 fgets(wp2, 8192, stdin) &&
  91                 i++ < MAXWORDS) {
  92 /*
  93 * put info in structure, and structure in the item
  94 */
  95                 key.size = strlen(wp1);
  96                 item.size = strlen(wp2);
  97
  98 /*
  99  * enter key/data pair into the table
 100  */
 101                 if ((dbp->put)(dbp, &key, &item, R_NOOVERWRITE) != NULL) {
 102                         fprintf(stderr, "cannot enter: key %s\n",
 103                                 item.data);
 104                         fprintf(stderr, "\terrno: %d\n", errno);
 105                         exit(1);
 106                 }
 107         }
 108
 109         if ( --argc ) {
 110                 fp = fopen ( argv[0], "r");
 111                 i = 0;
 112                 while ( fgets(wp1, 256, fp) &&
 113                         fgets(wp2, 8192, fp) &&
 114                         i++ < MAXWORDS) {
 115
 116                     key.size = strlen(wp1);
 117                     stat = (dbp->get)(dbp, &key, &res, 0);
 118                     if (stat < 0 ) {
 119                         fprintf ( stderr, "Error retrieving %s\n", key.data );
 120                         fprintf(stderr, "\terrno: %d\n", errno);
 121                         exit(1);
 122                     } else if ( stat > 0 ) {
 123                         fprintf ( stderr, "%s not found\n", key.data );
 124                         fprintf(stderr, "\terrno: %d\n", errno);
 125                         exit(1);
 126                     }
 127                 }
 128                 fclose(fp);
 129         }
 130         dbp->close(dbp);
 131         exit(0);
 132 }