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