os/ossrv/ssl/libcrypto/src/crypto/lhash/lhash.h
author sl
Tue, 10 Jun 2014 14:32:02 +0200
changeset 1 260cb5ec6c19
permissions -rw-r--r--
Update contrib.
sl@0
     1
/* crypto/lhash/lhash.h */
sl@0
     2
/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
sl@0
     3
 * All rights reserved.
sl@0
     4
 *
sl@0
     5
 * This package is an SSL implementation written
sl@0
     6
 * by Eric Young (eay@cryptsoft.com).
sl@0
     7
 * The implementation was written so as to conform with Netscapes SSL.
sl@0
     8
 * 
sl@0
     9
 * This library is free for commercial and non-commercial use as long as
sl@0
    10
 * the following conditions are aheared to.  The following conditions
sl@0
    11
 * apply to all code found in this distribution, be it the RC4, RSA,
sl@0
    12
 * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
sl@0
    13
 * included with this distribution is covered by the same copyright terms
sl@0
    14
 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
sl@0
    15
 * 
sl@0
    16
 * Copyright remains Eric Young's, and as such any Copyright notices in
sl@0
    17
 * the code are not to be removed.
sl@0
    18
 * If this package is used in a product, Eric Young should be given attribution
sl@0
    19
 * as the author of the parts of the library used.
sl@0
    20
 * This can be in the form of a textual message at program startup or
sl@0
    21
 * in documentation (online or textual) provided with the package.
sl@0
    22
 * 
sl@0
    23
 * Redistribution and use in source and binary forms, with or without
sl@0
    24
 * modification, are permitted provided that the following conditions
sl@0
    25
 * are met:
sl@0
    26
 * 1. Redistributions of source code must retain the copyright
sl@0
    27
 *    notice, this list of conditions and the following disclaimer.
sl@0
    28
 * 2. Redistributions in binary form must reproduce the above copyright
sl@0
    29
 *    notice, this list of conditions and the following disclaimer in the
sl@0
    30
 *    documentation and/or other materials provided with the distribution.
sl@0
    31
 * 3. All advertising materials mentioning features or use of this software
sl@0
    32
 *    must display the following acknowledgement:
sl@0
    33
 *    "This product includes cryptographic software written by
sl@0
    34
 *     Eric Young (eay@cryptsoft.com)"
sl@0
    35
 *    The word 'cryptographic' can be left out if the rouines from the library
sl@0
    36
 *    being used are not cryptographic related :-).
sl@0
    37
 * 4. If you include any Windows specific code (or a derivative thereof) from 
sl@0
    38
 *    the apps directory (application code) you must include an acknowledgement:
sl@0
    39
 *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
sl@0
    40
 * 
sl@0
    41
 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
sl@0
    42
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
sl@0
    43
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
sl@0
    44
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
sl@0
    45
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
sl@0
    46
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
sl@0
    47
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
sl@0
    48
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
sl@0
    49
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
sl@0
    50
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
sl@0
    51
 * SUCH DAMAGE.
sl@0
    52
 * 
sl@0
    53
 * The licence and distribution terms for any publically available version or
sl@0
    54
 * derivative of this code cannot be changed.  i.e. this code cannot simply be
sl@0
    55
 * copied and put under another distribution licence
sl@0
    56
 * [including the GNU Public Licence.]
sl@0
    57
 */
sl@0
    58
/*
sl@0
    59
 © Portions copyright (c) 2006 Nokia Corporation.  All rights reserved.
sl@0
    60
 */
sl@0
    61
sl@0
    62
/* Header for dynamic hash table routines
sl@0
    63
 * Author - Eric Young
sl@0
    64
 */
sl@0
    65
sl@0
    66
#ifndef HEADER_LHASH_H
sl@0
    67
#define HEADER_LHASH_H
sl@0
    68
sl@0
    69
#if (defined(__SYMBIAN32__) && !defined(SYMBIAN))
sl@0
    70
#define SYMBIAN
sl@0
    71
#endif
sl@0
    72
sl@0
    73
#ifdef SYMBIAN
sl@0
    74
#include <e32def.h>
sl@0
    75
#endif
sl@0
    76
#include <openssl/e_os2.h>
sl@0
    77
#ifndef OPENSSL_NO_FP_API
sl@0
    78
#include <stdio.h>
sl@0
    79
#endif
sl@0
    80
sl@0
    81
#ifndef OPENSSL_NO_BIO
sl@0
    82
#include <openssl/bio.h>
sl@0
    83
#endif
sl@0
    84
sl@0
    85
#ifdef  __cplusplus
sl@0
    86
extern "C" {
sl@0
    87
#endif
sl@0
    88
sl@0
    89
typedef struct lhash_node_st
sl@0
    90
	{
sl@0
    91
	void *data;
sl@0
    92
	struct lhash_node_st *next;
sl@0
    93
#ifndef OPENSSL_NO_HASH_COMP
sl@0
    94
	unsigned long hash;
sl@0
    95
#endif
sl@0
    96
	} LHASH_NODE;
sl@0
    97
sl@0
    98
typedef int (*LHASH_COMP_FN_TYPE)(const void *, const void *);
sl@0
    99
typedef unsigned long (*LHASH_HASH_FN_TYPE)(const void *);
sl@0
   100
typedef void (*LHASH_DOALL_FN_TYPE)(void *);
sl@0
   101
typedef void (*LHASH_DOALL_ARG_FN_TYPE)(void *, void *);
sl@0
   102
sl@0
   103
/* Macros for declaring and implementing type-safe wrappers for LHASH callbacks.
sl@0
   104
 * This way, callbacks can be provided to LHASH structures without function
sl@0
   105
 * pointer casting and the macro-defined callbacks provide per-variable casting
sl@0
   106
 * before deferring to the underlying type-specific callbacks. NB: It is
sl@0
   107
 * possible to place a "static" in front of both the DECLARE and IMPLEMENT
sl@0
   108
 * macros if the functions are strictly internal. */
sl@0
   109
sl@0
   110
/* First: "hash" functions */
sl@0
   111
#define DECLARE_LHASH_HASH_FN(f_name,o_type) \
sl@0
   112
	unsigned long f_name##_LHASH_HASH(const void *);
sl@0
   113
#define IMPLEMENT_LHASH_HASH_FN(f_name,o_type) \
sl@0
   114
	unsigned long f_name##_LHASH_HASH(const void *arg) { \
sl@0
   115
		o_type a = (o_type)arg; \
sl@0
   116
		return f_name(a); }
sl@0
   117
#define LHASH_HASH_FN(f_name) f_name##_LHASH_HASH
sl@0
   118
sl@0
   119
/* Second: "compare" functions */
sl@0
   120
#define DECLARE_LHASH_COMP_FN(f_name,o_type) \
sl@0
   121
	int f_name##_LHASH_COMP(const void *, const void *);
sl@0
   122
#define IMPLEMENT_LHASH_COMP_FN(f_name,o_type) \
sl@0
   123
	int f_name##_LHASH_COMP(const void *arg1, const void *arg2) { \
sl@0
   124
		o_type a = (o_type)arg1; \
sl@0
   125
		o_type b = (o_type)arg2; \
sl@0
   126
		return f_name(a,b); }
sl@0
   127
#define LHASH_COMP_FN(f_name) f_name##_LHASH_COMP
sl@0
   128
sl@0
   129
/* Third: "doall" functions */
sl@0
   130
#define DECLARE_LHASH_DOALL_FN(f_name,o_type) \
sl@0
   131
	 void f_name##_LHASH_DOALL(void *);
sl@0
   132
#define IMPLEMENT_LHASH_DOALL_FN(f_name,o_type) \
sl@0
   133
	 void f_name##_LHASH_DOALL(void *arg) { \
sl@0
   134
		o_type a = (o_type)arg; \
sl@0
   135
		f_name(a); }
sl@0
   136
#define LHASH_DOALL_FN(f_name) f_name##_LHASH_DOALL
sl@0
   137
sl@0
   138
/* Fourth: "doall_arg" functions */
sl@0
   139
#define DECLARE_LHASH_DOALL_ARG_FN(f_name,o_type,a_type) \
sl@0
   140
	void f_name##_LHASH_DOALL_ARG(void *, void *);
sl@0
   141
#define IMPLEMENT_LHASH_DOALL_ARG_FN(f_name,o_type,a_type) \
sl@0
   142
	void f_name##_LHASH_DOALL_ARG(void *arg1, void *arg2) { \
sl@0
   143
		o_type a = (o_type)arg1; \
sl@0
   144
		a_type b = (a_type)arg2; \
sl@0
   145
		f_name(a,b); }
sl@0
   146
#define LHASH_DOALL_ARG_FN(f_name) f_name##_LHASH_DOALL_ARG
sl@0
   147
sl@0
   148
typedef struct lhash_st
sl@0
   149
	{
sl@0
   150
	LHASH_NODE **b;
sl@0
   151
	LHASH_COMP_FN_TYPE comp;
sl@0
   152
	LHASH_HASH_FN_TYPE hash;
sl@0
   153
	unsigned int num_nodes;
sl@0
   154
	unsigned int num_alloc_nodes;
sl@0
   155
	unsigned int p;
sl@0
   156
	unsigned int pmax;
sl@0
   157
	unsigned long up_load; /* load times 256 */
sl@0
   158
	unsigned long down_load; /* load times 256 */
sl@0
   159
	unsigned long num_items;
sl@0
   160
sl@0
   161
	unsigned long num_expands;
sl@0
   162
	unsigned long num_expand_reallocs;
sl@0
   163
	unsigned long num_contracts;
sl@0
   164
	unsigned long num_contract_reallocs;
sl@0
   165
	unsigned long num_hash_calls;
sl@0
   166
	unsigned long num_comp_calls;
sl@0
   167
	unsigned long num_insert;
sl@0
   168
	unsigned long num_replace;
sl@0
   169
	unsigned long num_delete;
sl@0
   170
	unsigned long num_no_delete;
sl@0
   171
	unsigned long num_retrieve;
sl@0
   172
	unsigned long num_retrieve_miss;
sl@0
   173
	unsigned long num_hash_comps;
sl@0
   174
sl@0
   175
	int error;
sl@0
   176
	} LHASH;
sl@0
   177
sl@0
   178
#define LH_LOAD_MULT	256
sl@0
   179
sl@0
   180
/* Indicates a malloc() error in the last call, this is only bad
sl@0
   181
 * in lh_insert(). */
sl@0
   182
#define lh_error(lh)	((lh)->error)
sl@0
   183
sl@0
   184
IMPORT_C LHASH *lh_new(LHASH_HASH_FN_TYPE h, LHASH_COMP_FN_TYPE c);
sl@0
   185
IMPORT_C void lh_free(LHASH *lh);
sl@0
   186
IMPORT_C void *lh_insert(LHASH *lh, void *data);
sl@0
   187
IMPORT_C void *lh_delete(LHASH *lh, const void *data);
sl@0
   188
IMPORT_C void *lh_retrieve(LHASH *lh, const void *data);
sl@0
   189
IMPORT_C void lh_doall(LHASH *lh, LHASH_DOALL_FN_TYPE func);
sl@0
   190
IMPORT_C void lh_doall_arg(LHASH *lh, LHASH_DOALL_ARG_FN_TYPE func, void *arg);
sl@0
   191
IMPORT_C unsigned long lh_strhash(const char *c);
sl@0
   192
IMPORT_C unsigned long lh_num_items(const LHASH *lh);
sl@0
   193
sl@0
   194
#ifndef OPENSSL_NO_FP_API
sl@0
   195
IMPORT_C void lh_stats(const LHASH *lh, FILE *out);
sl@0
   196
IMPORT_C void lh_node_stats(const LHASH *lh, FILE *out);
sl@0
   197
IMPORT_C void lh_node_usage_stats(const LHASH *lh, FILE *out);
sl@0
   198
#endif
sl@0
   199
sl@0
   200
#ifndef OPENSSL_NO_BIO
sl@0
   201
IMPORT_C void lh_stats_bio(const LHASH *lh, BIO *out);
sl@0
   202
IMPORT_C void lh_node_stats_bio(const LHASH *lh, BIO *out);
sl@0
   203
IMPORT_C void lh_node_usage_stats_bio(const LHASH *lh, BIO *out);
sl@0
   204
#endif
sl@0
   205
#ifdef  __cplusplus
sl@0
   206
}
sl@0
   207
#endif
sl@0
   208
sl@0
   209
#endif
sl@0
   210