williamr@2: /* crypto/lhash/lhash.h */ williamr@2: /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) williamr@2: * All rights reserved. williamr@2: * williamr@2: * This package is an SSL implementation written williamr@2: * by Eric Young (eay@cryptsoft.com). williamr@2: * The implementation was written so as to conform with Netscapes SSL. williamr@2: * williamr@2: * This library is free for commercial and non-commercial use as long as williamr@2: * the following conditions are aheared to. The following conditions williamr@2: * apply to all code found in this distribution, be it the RC4, RSA, williamr@2: * lhash, DES, etc., code; not just the SSL code. The SSL documentation williamr@2: * included with this distribution is covered by the same copyright terms williamr@2: * except that the holder is Tim Hudson (tjh@cryptsoft.com). williamr@2: * williamr@2: * Copyright remains Eric Young's, and as such any Copyright notices in williamr@2: * the code are not to be removed. williamr@2: * If this package is used in a product, Eric Young should be given attribution williamr@2: * as the author of the parts of the library used. williamr@2: * This can be in the form of a textual message at program startup or williamr@2: * in documentation (online or textual) provided with the package. williamr@2: * williamr@2: * Redistribution and use in source and binary forms, with or without williamr@2: * modification, are permitted provided that the following conditions williamr@2: * are met: williamr@2: * 1. Redistributions of source code must retain the copyright williamr@2: * notice, this list of conditions and the following disclaimer. williamr@2: * 2. Redistributions in binary form must reproduce the above copyright williamr@2: * notice, this list of conditions and the following disclaimer in the williamr@2: * documentation and/or other materials provided with the distribution. williamr@2: * 3. All advertising materials mentioning features or use of this software williamr@2: * must display the following acknowledgement: williamr@2: * "This product includes cryptographic software written by williamr@2: * Eric Young (eay@cryptsoft.com)" williamr@2: * The word 'cryptographic' can be left out if the rouines from the library williamr@2: * being used are not cryptographic related :-). williamr@2: * 4. If you include any Windows specific code (or a derivative thereof) from williamr@2: * the apps directory (application code) you must include an acknowledgement: williamr@2: * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" williamr@2: * williamr@2: * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND williamr@2: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE williamr@2: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE williamr@2: * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE williamr@2: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL williamr@2: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS williamr@2: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) williamr@2: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT williamr@2: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY williamr@2: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF williamr@2: * SUCH DAMAGE. williamr@2: * williamr@2: * The licence and distribution terms for any publically available version or williamr@2: * derivative of this code cannot be changed. i.e. this code cannot simply be williamr@2: * copied and put under another distribution licence williamr@2: * [including the GNU Public Licence.] williamr@2: */ williamr@2: /* williamr@2: © Portions copyright (c) 2006 Nokia Corporation. All rights reserved. williamr@2: */ williamr@2: williamr@2: /* Header for dynamic hash table routines williamr@2: * Author - Eric Young williamr@2: */ williamr@2: williamr@2: #ifndef HEADER_LHASH_H williamr@2: #define HEADER_LHASH_H williamr@2: williamr@2: #if (defined(__SYMBIAN32__) && !defined(SYMBIAN)) williamr@2: #define SYMBIAN williamr@2: #endif williamr@2: williamr@2: #ifdef SYMBIAN williamr@2: #include williamr@2: #endif williamr@2: #include williamr@2: #ifndef OPENSSL_NO_FP_API williamr@2: #include williamr@2: #endif williamr@2: williamr@2: #ifndef OPENSSL_NO_BIO williamr@2: #include williamr@2: #endif williamr@2: williamr@2: #ifdef __cplusplus williamr@2: extern "C" { williamr@2: #endif williamr@2: williamr@2: typedef struct lhash_node_st williamr@2: { williamr@2: void *data; williamr@2: struct lhash_node_st *next; williamr@2: #ifndef OPENSSL_NO_HASH_COMP williamr@2: unsigned long hash; williamr@2: #endif williamr@2: } LHASH_NODE; williamr@2: williamr@2: typedef int (*LHASH_COMP_FN_TYPE)(const void *, const void *); williamr@2: typedef unsigned long (*LHASH_HASH_FN_TYPE)(const void *); williamr@2: typedef void (*LHASH_DOALL_FN_TYPE)(void *); williamr@2: typedef void (*LHASH_DOALL_ARG_FN_TYPE)(void *, void *); williamr@2: williamr@2: /* Macros for declaring and implementing type-safe wrappers for LHASH callbacks. williamr@2: * This way, callbacks can be provided to LHASH structures without function williamr@2: * pointer casting and the macro-defined callbacks provide per-variable casting williamr@2: * before deferring to the underlying type-specific callbacks. NB: It is williamr@2: * possible to place a "static" in front of both the DECLARE and IMPLEMENT williamr@2: * macros if the functions are strictly internal. */ williamr@2: williamr@2: /* First: "hash" functions */ williamr@2: #define DECLARE_LHASH_HASH_FN(f_name,o_type) \ williamr@2: unsigned long f_name##_LHASH_HASH(const void *); williamr@2: #define IMPLEMENT_LHASH_HASH_FN(f_name,o_type) \ williamr@2: unsigned long f_name##_LHASH_HASH(const void *arg) { \ williamr@2: o_type a = (o_type)arg; \ williamr@2: return f_name(a); } williamr@2: #define LHASH_HASH_FN(f_name) f_name##_LHASH_HASH williamr@2: williamr@2: /* Second: "compare" functions */ williamr@2: #define DECLARE_LHASH_COMP_FN(f_name,o_type) \ williamr@2: int f_name##_LHASH_COMP(const void *, const void *); williamr@2: #define IMPLEMENT_LHASH_COMP_FN(f_name,o_type) \ williamr@2: int f_name##_LHASH_COMP(const void *arg1, const void *arg2) { \ williamr@2: o_type a = (o_type)arg1; \ williamr@2: o_type b = (o_type)arg2; \ williamr@2: return f_name(a,b); } williamr@2: #define LHASH_COMP_FN(f_name) f_name##_LHASH_COMP williamr@2: williamr@2: /* Third: "doall" functions */ williamr@2: #define DECLARE_LHASH_DOALL_FN(f_name,o_type) \ williamr@2: void f_name##_LHASH_DOALL(void *); williamr@2: #define IMPLEMENT_LHASH_DOALL_FN(f_name,o_type) \ williamr@2: void f_name##_LHASH_DOALL(void *arg) { \ williamr@2: o_type a = (o_type)arg; \ williamr@2: f_name(a); } williamr@2: #define LHASH_DOALL_FN(f_name) f_name##_LHASH_DOALL williamr@2: williamr@2: /* Fourth: "doall_arg" functions */ williamr@2: #define DECLARE_LHASH_DOALL_ARG_FN(f_name,o_type,a_type) \ williamr@2: void f_name##_LHASH_DOALL_ARG(void *, void *); williamr@2: #define IMPLEMENT_LHASH_DOALL_ARG_FN(f_name,o_type,a_type) \ williamr@2: void f_name##_LHASH_DOALL_ARG(void *arg1, void *arg2) { \ williamr@2: o_type a = (o_type)arg1; \ williamr@2: a_type b = (a_type)arg2; \ williamr@2: f_name(a,b); } williamr@2: #define LHASH_DOALL_ARG_FN(f_name) f_name##_LHASH_DOALL_ARG williamr@2: williamr@2: typedef struct lhash_st williamr@2: { williamr@2: LHASH_NODE **b; williamr@2: LHASH_COMP_FN_TYPE comp; williamr@2: LHASH_HASH_FN_TYPE hash; williamr@2: unsigned int num_nodes; williamr@2: unsigned int num_alloc_nodes; williamr@2: unsigned int p; williamr@2: unsigned int pmax; williamr@2: unsigned long up_load; /* load times 256 */ williamr@2: unsigned long down_load; /* load times 256 */ williamr@2: unsigned long num_items; williamr@2: williamr@2: unsigned long num_expands; williamr@2: unsigned long num_expand_reallocs; williamr@2: unsigned long num_contracts; williamr@2: unsigned long num_contract_reallocs; williamr@2: unsigned long num_hash_calls; williamr@2: unsigned long num_comp_calls; williamr@2: unsigned long num_insert; williamr@2: unsigned long num_replace; williamr@2: unsigned long num_delete; williamr@2: unsigned long num_no_delete; williamr@2: unsigned long num_retrieve; williamr@2: unsigned long num_retrieve_miss; williamr@2: unsigned long num_hash_comps; williamr@2: williamr@2: int error; williamr@2: } LHASH; williamr@2: williamr@2: #define LH_LOAD_MULT 256 williamr@2: williamr@2: /* Indicates a malloc() error in the last call, this is only bad williamr@2: * in lh_insert(). */ williamr@2: #define lh_error(lh) ((lh)->error) williamr@2: williamr@2: IMPORT_C LHASH *lh_new(LHASH_HASH_FN_TYPE h, LHASH_COMP_FN_TYPE c); williamr@2: IMPORT_C void lh_free(LHASH *lh); williamr@2: IMPORT_C void *lh_insert(LHASH *lh, void *data); williamr@2: IMPORT_C void *lh_delete(LHASH *lh, const void *data); williamr@2: IMPORT_C void *lh_retrieve(LHASH *lh, const void *data); williamr@2: IMPORT_C void lh_doall(LHASH *lh, LHASH_DOALL_FN_TYPE func); williamr@2: IMPORT_C void lh_doall_arg(LHASH *lh, LHASH_DOALL_ARG_FN_TYPE func, void *arg); williamr@2: IMPORT_C unsigned long lh_strhash(const char *c); williamr@2: IMPORT_C unsigned long lh_num_items(const LHASH *lh); williamr@2: williamr@2: #ifndef OPENSSL_NO_FP_API williamr@2: IMPORT_C void lh_stats(const LHASH *lh, FILE *out); williamr@2: IMPORT_C void lh_node_stats(const LHASH *lh, FILE *out); williamr@2: IMPORT_C void lh_node_usage_stats(const LHASH *lh, FILE *out); williamr@2: #endif williamr@2: williamr@2: #ifndef OPENSSL_NO_BIO williamr@2: IMPORT_C void lh_stats_bio(const LHASH *lh, BIO *out); williamr@2: IMPORT_C void lh_node_stats_bio(const LHASH *lh, BIO *out); williamr@2: IMPORT_C void lh_node_usage_stats_bio(const LHASH *lh, BIO *out); williamr@2: #endif williamr@2: #ifdef __cplusplus williamr@2: } williamr@2: #endif williamr@2: williamr@2: #endif williamr@2: