1/*-
2 * SPDX-License-Identifier: BSD-3-Clause
3 *
4 * Copyright (c) 1991, 1993
5 *	The Regents of the University of California.  All rights reserved.
6 *
7 * This code is derived from software contributed to Berkeley by
8 * Margo Seltzer.
9 *
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
12 * are met:
13 * 1. Redistributions of source code must retain the above copyright
14 *    notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 *    notice, this list of conditions and the following disclaimer in the
17 *    documentation and/or other materials provided with the distribution.
18 * 3. Neither the name of the University nor the names of its contributors
19 *    may be used to endorse or promote products derived from this software
20 *    without specific prior written permission.
21 *
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 * SUCH DAMAGE.
33 */
34
35#include <sys/types.h>
36#include <sys/file.h>
37#include <stdio.h>
38#include <db.h>
39
40#define INITIAL	25000
41#define MAXWORDS    25000	       /* # of elements in search table */
42
43
44char	wp[8192];
45char	cp[8192];
46main(argc, argv)
47char **argv;
48{
49	DBT item, key, res;
50	DB	*dbp;
51	FILE *fp;
52	int	stat;
53
54	if (!(dbp = dbopen( "hashtest", O_RDONLY, 0400, DB_HASH, NULL))) {
55		/* create table */
56		fprintf(stderr, "cannot open: hash table\n" );
57		exit(1);
58	}
59
60/*
61* put info in structure, and structure in the item
62*/
63	for ( stat = (dbp->seq) (dbp, &res, &item, 1 );
64	      stat == 0;
65	      stat = (dbp->seq) (dbp, &res, &item, 0 ) ) {
66
67	      bcopy ( res.data, wp, res.size );
68	      wp[res.size] = 0;
69	      bcopy ( item.data, cp, item.size );
70	      cp[item.size] = 0;
71
72	      printf ( "%s %s\n", wp, cp );
73	}
74	(dbp->close)(dbp);
75	exit(0);
76}
77