1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/os/ossrv/ssl/libcrypto/src/crypto/lhash/lhash.h Fri Jun 15 03:10:57 2012 +0200
1.3 @@ -0,0 +1,210 @@
1.4 +/* crypto/lhash/lhash.h */
1.5 +/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
1.6 + * All rights reserved.
1.7 + *
1.8 + * This package is an SSL implementation written
1.9 + * by Eric Young (eay@cryptsoft.com).
1.10 + * The implementation was written so as to conform with Netscapes SSL.
1.11 + *
1.12 + * This library is free for commercial and non-commercial use as long as
1.13 + * the following conditions are aheared to. The following conditions
1.14 + * apply to all code found in this distribution, be it the RC4, RSA,
1.15 + * lhash, DES, etc., code; not just the SSL code. The SSL documentation
1.16 + * included with this distribution is covered by the same copyright terms
1.17 + * except that the holder is Tim Hudson (tjh@cryptsoft.com).
1.18 + *
1.19 + * Copyright remains Eric Young's, and as such any Copyright notices in
1.20 + * the code are not to be removed.
1.21 + * If this package is used in a product, Eric Young should be given attribution
1.22 + * as the author of the parts of the library used.
1.23 + * This can be in the form of a textual message at program startup or
1.24 + * in documentation (online or textual) provided with the package.
1.25 + *
1.26 + * Redistribution and use in source and binary forms, with or without
1.27 + * modification, are permitted provided that the following conditions
1.28 + * are met:
1.29 + * 1. Redistributions of source code must retain the copyright
1.30 + * notice, this list of conditions and the following disclaimer.
1.31 + * 2. Redistributions in binary form must reproduce the above copyright
1.32 + * notice, this list of conditions and the following disclaimer in the
1.33 + * documentation and/or other materials provided with the distribution.
1.34 + * 3. All advertising materials mentioning features or use of this software
1.35 + * must display the following acknowledgement:
1.36 + * "This product includes cryptographic software written by
1.37 + * Eric Young (eay@cryptsoft.com)"
1.38 + * The word 'cryptographic' can be left out if the rouines from the library
1.39 + * being used are not cryptographic related :-).
1.40 + * 4. If you include any Windows specific code (or a derivative thereof) from
1.41 + * the apps directory (application code) you must include an acknowledgement:
1.42 + * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
1.43 + *
1.44 + * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
1.45 + * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
1.46 + * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
1.47 + * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
1.48 + * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
1.49 + * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
1.50 + * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
1.51 + * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
1.52 + * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
1.53 + * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
1.54 + * SUCH DAMAGE.
1.55 + *
1.56 + * The licence and distribution terms for any publically available version or
1.57 + * derivative of this code cannot be changed. i.e. this code cannot simply be
1.58 + * copied and put under another distribution licence
1.59 + * [including the GNU Public Licence.]
1.60 + */
1.61 +/*
1.62 + © Portions copyright (c) 2006 Nokia Corporation. All rights reserved.
1.63 + */
1.64 +
1.65 +/* Header for dynamic hash table routines
1.66 + * Author - Eric Young
1.67 + */
1.68 +
1.69 +#ifndef HEADER_LHASH_H
1.70 +#define HEADER_LHASH_H
1.71 +
1.72 +#if (defined(__SYMBIAN32__) && !defined(SYMBIAN))
1.73 +#define SYMBIAN
1.74 +#endif
1.75 +
1.76 +#ifdef SYMBIAN
1.77 +#include <e32def.h>
1.78 +#endif
1.79 +#include <openssl/e_os2.h>
1.80 +#ifndef OPENSSL_NO_FP_API
1.81 +#include <stdio.h>
1.82 +#endif
1.83 +
1.84 +#ifndef OPENSSL_NO_BIO
1.85 +#include <openssl/bio.h>
1.86 +#endif
1.87 +
1.88 +#ifdef __cplusplus
1.89 +extern "C" {
1.90 +#endif
1.91 +
1.92 +typedef struct lhash_node_st
1.93 + {
1.94 + void *data;
1.95 + struct lhash_node_st *next;
1.96 +#ifndef OPENSSL_NO_HASH_COMP
1.97 + unsigned long hash;
1.98 +#endif
1.99 + } LHASH_NODE;
1.100 +
1.101 +typedef int (*LHASH_COMP_FN_TYPE)(const void *, const void *);
1.102 +typedef unsigned long (*LHASH_HASH_FN_TYPE)(const void *);
1.103 +typedef void (*LHASH_DOALL_FN_TYPE)(void *);
1.104 +typedef void (*LHASH_DOALL_ARG_FN_TYPE)(void *, void *);
1.105 +
1.106 +/* Macros for declaring and implementing type-safe wrappers for LHASH callbacks.
1.107 + * This way, callbacks can be provided to LHASH structures without function
1.108 + * pointer casting and the macro-defined callbacks provide per-variable casting
1.109 + * before deferring to the underlying type-specific callbacks. NB: It is
1.110 + * possible to place a "static" in front of both the DECLARE and IMPLEMENT
1.111 + * macros if the functions are strictly internal. */
1.112 +
1.113 +/* First: "hash" functions */
1.114 +#define DECLARE_LHASH_HASH_FN(f_name,o_type) \
1.115 + unsigned long f_name##_LHASH_HASH(const void *);
1.116 +#define IMPLEMENT_LHASH_HASH_FN(f_name,o_type) \
1.117 + unsigned long f_name##_LHASH_HASH(const void *arg) { \
1.118 + o_type a = (o_type)arg; \
1.119 + return f_name(a); }
1.120 +#define LHASH_HASH_FN(f_name) f_name##_LHASH_HASH
1.121 +
1.122 +/* Second: "compare" functions */
1.123 +#define DECLARE_LHASH_COMP_FN(f_name,o_type) \
1.124 + int f_name##_LHASH_COMP(const void *, const void *);
1.125 +#define IMPLEMENT_LHASH_COMP_FN(f_name,o_type) \
1.126 + int f_name##_LHASH_COMP(const void *arg1, const void *arg2) { \
1.127 + o_type a = (o_type)arg1; \
1.128 + o_type b = (o_type)arg2; \
1.129 + return f_name(a,b); }
1.130 +#define LHASH_COMP_FN(f_name) f_name##_LHASH_COMP
1.131 +
1.132 +/* Third: "doall" functions */
1.133 +#define DECLARE_LHASH_DOALL_FN(f_name,o_type) \
1.134 + void f_name##_LHASH_DOALL(void *);
1.135 +#define IMPLEMENT_LHASH_DOALL_FN(f_name,o_type) \
1.136 + void f_name##_LHASH_DOALL(void *arg) { \
1.137 + o_type a = (o_type)arg; \
1.138 + f_name(a); }
1.139 +#define LHASH_DOALL_FN(f_name) f_name##_LHASH_DOALL
1.140 +
1.141 +/* Fourth: "doall_arg" functions */
1.142 +#define DECLARE_LHASH_DOALL_ARG_FN(f_name,o_type,a_type) \
1.143 + void f_name##_LHASH_DOALL_ARG(void *, void *);
1.144 +#define IMPLEMENT_LHASH_DOALL_ARG_FN(f_name,o_type,a_type) \
1.145 + void f_name##_LHASH_DOALL_ARG(void *arg1, void *arg2) { \
1.146 + o_type a = (o_type)arg1; \
1.147 + a_type b = (a_type)arg2; \
1.148 + f_name(a,b); }
1.149 +#define LHASH_DOALL_ARG_FN(f_name) f_name##_LHASH_DOALL_ARG
1.150 +
1.151 +typedef struct lhash_st
1.152 + {
1.153 + LHASH_NODE **b;
1.154 + LHASH_COMP_FN_TYPE comp;
1.155 + LHASH_HASH_FN_TYPE hash;
1.156 + unsigned int num_nodes;
1.157 + unsigned int num_alloc_nodes;
1.158 + unsigned int p;
1.159 + unsigned int pmax;
1.160 + unsigned long up_load; /* load times 256 */
1.161 + unsigned long down_load; /* load times 256 */
1.162 + unsigned long num_items;
1.163 +
1.164 + unsigned long num_expands;
1.165 + unsigned long num_expand_reallocs;
1.166 + unsigned long num_contracts;
1.167 + unsigned long num_contract_reallocs;
1.168 + unsigned long num_hash_calls;
1.169 + unsigned long num_comp_calls;
1.170 + unsigned long num_insert;
1.171 + unsigned long num_replace;
1.172 + unsigned long num_delete;
1.173 + unsigned long num_no_delete;
1.174 + unsigned long num_retrieve;
1.175 + unsigned long num_retrieve_miss;
1.176 + unsigned long num_hash_comps;
1.177 +
1.178 + int error;
1.179 + } LHASH;
1.180 +
1.181 +#define LH_LOAD_MULT 256
1.182 +
1.183 +/* Indicates a malloc() error in the last call, this is only bad
1.184 + * in lh_insert(). */
1.185 +#define lh_error(lh) ((lh)->error)
1.186 +
1.187 +IMPORT_C LHASH *lh_new(LHASH_HASH_FN_TYPE h, LHASH_COMP_FN_TYPE c);
1.188 +IMPORT_C void lh_free(LHASH *lh);
1.189 +IMPORT_C void *lh_insert(LHASH *lh, void *data);
1.190 +IMPORT_C void *lh_delete(LHASH *lh, const void *data);
1.191 +IMPORT_C void *lh_retrieve(LHASH *lh, const void *data);
1.192 +IMPORT_C void lh_doall(LHASH *lh, LHASH_DOALL_FN_TYPE func);
1.193 +IMPORT_C void lh_doall_arg(LHASH *lh, LHASH_DOALL_ARG_FN_TYPE func, void *arg);
1.194 +IMPORT_C unsigned long lh_strhash(const char *c);
1.195 +IMPORT_C unsigned long lh_num_items(const LHASH *lh);
1.196 +
1.197 +#ifndef OPENSSL_NO_FP_API
1.198 +IMPORT_C void lh_stats(const LHASH *lh, FILE *out);
1.199 +IMPORT_C void lh_node_stats(const LHASH *lh, FILE *out);
1.200 +IMPORT_C void lh_node_usage_stats(const LHASH *lh, FILE *out);
1.201 +#endif
1.202 +
1.203 +#ifndef OPENSSL_NO_BIO
1.204 +IMPORT_C void lh_stats_bio(const LHASH *lh, BIO *out);
1.205 +IMPORT_C void lh_node_stats_bio(const LHASH *lh, BIO *out);
1.206 +IMPORT_C void lh_node_usage_stats_bio(const LHASH *lh, BIO *out);
1.207 +#endif
1.208 +#ifdef __cplusplus
1.209 +}
1.210 +#endif
1.211 +
1.212 +#endif
1.213 +