lhash.h 9.3 KB

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