hash.h 3.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106
  1. #ifndef HEADER_CURL_HASH_H
  2. #define HEADER_CURL_HASH_H
  3. /***************************************************************************
  4. * _ _ ____ _
  5. * Project ___| | | | _ \| |
  6. * / __| | | | |_) | |
  7. * | (__| |_| | _ <| |___
  8. * \___|\___/|_| \_\_____|
  9. *
  10. * Copyright (C) 1998 - 2007, Daniel Stenberg, <daniel@haxx.se>, et al.
  11. *
  12. * This software is licensed as described in the file COPYING, which
  13. * you should have received as part of this distribution. The terms
  14. * are also available at http://curl.haxx.se/docs/copyright.html.
  15. *
  16. * You may opt to use, copy, modify, merge, publish, distribute and/or sell
  17. * copies of the Software, and permit persons to whom the Software is
  18. * furnished to do so, under the terms of the COPYING file.
  19. *
  20. * This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
  21. * KIND, either express or implied.
  22. *
  23. ***************************************************************************/
  24. #include "curl_setup.h"
  25. #include <stddef.h>
  26. #include "llist.h"
  27. /* Hash function prototype */
  28. typedef size_t (*hash_function) (void* key,
  29. size_t key_length,
  30. size_t slots_num);
  31. /*
  32. Comparator function prototype. Compares two keys.
  33. */
  34. typedef size_t (*comp_function) (void* key1,
  35. size_t key1_len,
  36. void*key2,
  37. size_t key2_len);
  38. typedef void (*curl_hash_dtor)(void *);
  39. struct curl_hash {
  40. struct curl_llist **table;
  41. /* Hash function to be used for this hash table */
  42. hash_function hash_func;
  43. /* Comparator function to compare keys */
  44. comp_function comp_func;
  45. curl_hash_dtor dtor;
  46. int slots;
  47. size_t size;
  48. };
  49. struct curl_hash_element {
  50. void *ptr;
  51. char *key;
  52. size_t key_len;
  53. };
  54. struct curl_hash_iterator {
  55. struct curl_hash *hash;
  56. int slot_index;
  57. struct curl_llist_element *current_element;
  58. };
  59. int Curl_hash_init(struct curl_hash *h,
  60. int slots,
  61. hash_function hfunc,
  62. comp_function comparator,
  63. curl_hash_dtor dtor);
  64. struct curl_hash *Curl_hash_alloc(int slots,
  65. hash_function hfunc,
  66. comp_function comparator,
  67. curl_hash_dtor dtor);
  68. void *Curl_hash_add(struct curl_hash *h, void *key, size_t key_len, void *p);
  69. int Curl_hash_delete(struct curl_hash *h, void *key, size_t key_len);
  70. void *Curl_hash_pick(struct curl_hash *, void * key, size_t key_len);
  71. void Curl_hash_apply(struct curl_hash *h, void *user,
  72. void (*cb)(void *user, void *ptr));
  73. int Curl_hash_count(struct curl_hash *h);
  74. void Curl_hash_clean(struct curl_hash *h);
  75. void Curl_hash_clean_with_criterium(struct curl_hash *h, void *user,
  76. int (*comp)(void *, void *));
  77. void Curl_hash_destroy(struct curl_hash *h);
  78. size_t Curl_hash_str(void* key, size_t key_length, size_t slots_num);
  79. size_t Curl_str_key_compare(void*k1, size_t key1_len, void*k2,
  80. size_t key2_len);
  81. void Curl_hash_start_iterate(struct curl_hash *hash,
  82. struct curl_hash_iterator *iter);
  83. struct curl_hash_element *
  84. Curl_hash_next_element(struct curl_hash_iterator *iter);
  85. void Curl_hash_print(struct curl_hash *h,
  86. void (*func)(void *));
  87. #endif /* HEADER_CURL_HASH_H */