1/*
2 * Copyright (c) 2000-2001,2011,2014 Apple Inc. All Rights Reserved.
3 *
4 * The contents of this file constitute Original Code as defined in and are
5 * subject to the Apple Public Source License Version 1.2 (the 'License').
6 * You may not use this file except in compliance with the License. Please obtain
7 * a copy of the License at http://www.apple.com/publicsource and read it before
8 * using this file.
9 *
10 * This Original Code and all software distributed under the License are
11 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESS
12 * OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, INCLUDING WITHOUT
13 * LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
14 * PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT. Please see the License for the
15 * specific language governing rights and limitations under the License.
16 */
17
18
19/* crypto/lhash/lhash.h */
20/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
21 * All rights reserved.
22 *
23 * This package is an SSL implementation written
24 * by Eric Young (eay@cryptsoft.com).
25 * The implementation was written so as to conform with Netscapes SSL.
26 *
27 * This library is free for commercial and non-commercial use as long as
28 * the following conditions are aheared to.  The following conditions
29 * apply to all code found in this distribution, be it the RC4, RSA,
30 * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
31 * included with this distribution is covered by the same copyright terms
32 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
33 *
34 * Copyright remains Eric Young's, and as such any Copyright notices in
35 * the code are not to be removed.
36 * If this package is used in a product, Eric Young should be given attribution
37 * as the author of the parts of the library used.
38 * This can be in the form of a textual message at program startup or
39 * in documentation (online or textual) provided with the package.
40 *
41 * Redistribution and use in source and binary forms, with or without
42 * modification, are permitted provided that the following conditions
43 * are met:
44 * 1. Redistributions of source code must retain the copyright
45 *    notice, this list of conditions and the following disclaimer.
46 * 2. Redistributions in binary form must reproduce the above copyright
47 *    notice, this list of conditions and the following disclaimer in the
48 *    documentation and/or other materials provided with the distribution.
49 * 3. All advertising materials mentioning features or use of this software
50 *    must display the following acknowledgement:
51 *    "This product includes cryptographic software written by
52 *     Eric Young (eay@cryptsoft.com)"
53 *    The word 'cryptographic' can be left out if the rouines from the library
54 *    being used are not cryptographic related :-).
55 * 4. If you include any Windows specific code (or a derivative thereof) from
56 *    the apps directory (application code) you must include an acknowledgement:
57 *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
58 *
59 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
60 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
61 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
62 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
63 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
64 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
65 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
66 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
67 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
68 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
69 * SUCH DAMAGE.
70 *
71 * The licence and distribution terms for any publically available version or
72 * derivative of this code cannot be changed.  i.e. this code cannot simply be
73 * copied and put under another distribution licence
74 * [including the GNU Public Licence.]
75 */
76
77/* Header for dynamic hash table routines
78 * Author - Eric Young
79 */
80
81#ifndef HEADER_LHASH_H
82#define HEADER_LHASH_H
83
84#ifdef  __cplusplus
85extern "C" {
86#endif
87
88#ifndef NO_FP_API
89#include <stdio.h>
90#endif
91
92typedef struct lhash_node_st
93	{
94	void *data;
95	struct lhash_node_st *next;
96#ifndef NO_HASH_COMP
97	unsigned long hash;
98#endif
99	} LHASH_NODE;
100
101typedef struct lhash_st
102	{
103	LHASH_NODE **b;
104	int (*comp)();
105	unsigned long (*hash)();
106	unsigned int num_nodes;
107	unsigned int num_alloc_nodes;
108	unsigned int p;
109	unsigned int pmax;
110	unsigned long up_load; /* load times 256 */
111	unsigned long down_load; /* load times 256 */
112	unsigned long num_items;
113
114	unsigned long num_expands;
115	unsigned long num_expand_reallocs;
116	unsigned long num_contracts;
117	unsigned long num_contract_reallocs;
118	unsigned long num_hash_calls;
119	unsigned long num_comp_calls;
120	unsigned long num_insert;
121	unsigned long num_replace;
122	unsigned long num_delete;
123	unsigned long num_no_delete;
124	unsigned long num_retrieve;
125	unsigned long num_retrieve_miss;
126	unsigned long num_hash_comps;
127
128	int error;
129	} LHASH;
130
131#define LH_LOAD_MULT	256
132
133/* Indicates a malloc() error in the last call, this is only bad
134 * in lh_insert(). */
135#define lh_error(lh)	((lh)->error)
136
137LHASH *lh_new(unsigned long (*h)(/* void *a */), int (*c)(/* void *a,void *b */));
138void lh_free(LHASH *lh);
139void *lh_insert(LHASH *lh, void *data);
140void *lh_delete(LHASH *lh, void *data);
141void *lh_retrieve(LHASH *lh, void *data);
142    void lh_doall(LHASH *lh, void (*func)(/*void *b*/));
143void lh_doall_arg(LHASH *lh, void (*func)(/*void *a,void *b*/),void *arg);
144unsigned long lh_strhash(const char *c);
145unsigned long lh_num_items(LHASH *lh);
146
147#ifndef NO_FP_API
148void lh_stats(LHASH *lh, FILE *out);
149void lh_node_stats(LHASH *lh, FILE *out);
150void lh_node_usage_stats(LHASH *lh, FILE *out);
151#endif
152
153#ifdef HEADER_BIO_H
154void lh_stats_bio(LHASH *lh, BIO *out);
155void lh_node_stats_bio(LHASH *lh, BIO *out);
156void lh_node_usage_stats_bio(LHASH *lh, BIO *out);
157#endif
158#ifdef  __cplusplus
159}
160#endif
161
162#endif
163
164