map.h 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255
  1. /* Copyright (c) 2003-2004, Roger Dingledine
  2. * Copyright (c) 2004-2006, Roger Dingledine, Nick Mathewson.
  3. * Copyright (c) 2007-2018, The Tor Project, Inc. */
  4. /* See LICENSE for licensing information */
  5. #ifndef TOR_MAP_H
  6. #define TOR_MAP_H
  7. #include "lib/testsupport/testsupport.h"
  8. #include "lib/cc/torint.h"
  9. #include "siphash.h"
  10. #define DECLARE_MAP_FNS(maptype, keytype, prefix) \
  11. typedef struct maptype maptype; \
  12. typedef struct prefix##entry_t *prefix##iter_t; \
  13. MOCK_DECL(maptype*, prefix##new, (void)); \
  14. void* prefix##set(maptype *map, keytype key, void *val); \
  15. void* prefix##get(const maptype *map, keytype key); \
  16. void* prefix##remove(maptype *map, keytype key); \
  17. MOCK_DECL(void, prefix##free_, (maptype *map, void (*free_val)(void*))); \
  18. int prefix##isempty(const maptype *map); \
  19. int prefix##size(const maptype *map); \
  20. prefix##iter_t *prefix##iter_init(maptype *map); \
  21. prefix##iter_t *prefix##iter_next(maptype *map, prefix##iter_t *iter); \
  22. prefix##iter_t *prefix##iter_next_rmv(maptype *map, prefix##iter_t *iter); \
  23. void prefix##iter_get(prefix##iter_t *iter, keytype *keyp, void **valp); \
  24. int prefix##iter_done(prefix##iter_t *iter); \
  25. void prefix##assert_ok(const maptype *map)
  26. /* Map from const char * to void *. Implemented with a hash table. */
  27. DECLARE_MAP_FNS(strmap_t, const char *, strmap_);
  28. /* Map from const char[DIGEST_LEN] to void *. Implemented with a hash table. */
  29. DECLARE_MAP_FNS(digestmap_t, const char *, digestmap_);
  30. /* Map from const uint8_t[DIGEST256_LEN] to void *. Implemented with a hash
  31. * table. */
  32. DECLARE_MAP_FNS(digest256map_t, const uint8_t *, digest256map_);
  33. #define MAP_FREE_AND_NULL(maptype, map, fn) \
  34. do { \
  35. maptype ## _free_((map), (fn)); \
  36. (map) = NULL; \
  37. } while (0)
  38. #define strmap_free(map, fn) MAP_FREE_AND_NULL(strmap, (map), (fn))
  39. #define digestmap_free(map, fn) MAP_FREE_AND_NULL(digestmap, (map), (fn))
  40. #define digest256map_free(map, fn) MAP_FREE_AND_NULL(digest256map, (map), (fn))
  41. #undef DECLARE_MAP_FNS
  42. /** Iterates over the key-value pairs in a map <b>map</b> in order.
  43. * <b>prefix</b> is as for DECLARE_MAP_FNS (i.e., strmap_ or digestmap_).
  44. * The map's keys and values are of type keytype and valtype respectively;
  45. * each iteration assigns them to keyvar and valvar.
  46. *
  47. * Example use:
  48. * MAP_FOREACH(digestmap_, m, const char *, k, routerinfo_t *, r) {
  49. * // use k and r
  50. * } MAP_FOREACH_END.
  51. */
  52. /* Unpacks to, approximately:
  53. * {
  54. * digestmap_iter_t *k_iter;
  55. * for (k_iter = digestmap_iter_init(m); !digestmap_iter_done(k_iter);
  56. * k_iter = digestmap_iter_next(m, k_iter)) {
  57. * const char *k;
  58. * void *r_voidp;
  59. * routerinfo_t *r;
  60. * digestmap_iter_get(k_iter, &k, &r_voidp);
  61. * r = r_voidp;
  62. * // use k and r
  63. * }
  64. * }
  65. */
  66. #define MAP_FOREACH(prefix, map, keytype, keyvar, valtype, valvar) \
  67. STMT_BEGIN \
  68. prefix##iter_t *keyvar##_iter; \
  69. for (keyvar##_iter = prefix##iter_init(map); \
  70. !prefix##iter_done(keyvar##_iter); \
  71. keyvar##_iter = prefix##iter_next(map, keyvar##_iter)) { \
  72. keytype keyvar; \
  73. void *valvar##_voidp; \
  74. valtype valvar; \
  75. prefix##iter_get(keyvar##_iter, &keyvar, &valvar##_voidp); \
  76. valvar = valvar##_voidp;
  77. /** As MAP_FOREACH, except allows members to be removed from the map
  78. * during the iteration via MAP_DEL_CURRENT. Example use:
  79. *
  80. * Example use:
  81. * MAP_FOREACH(digestmap_, m, const char *, k, routerinfo_t *, r) {
  82. * if (is_very_old(r))
  83. * MAP_DEL_CURRENT(k);
  84. * } MAP_FOREACH_END.
  85. **/
  86. /* Unpacks to, approximately:
  87. * {
  88. * digestmap_iter_t *k_iter;
  89. * int k_del=0;
  90. * for (k_iter = digestmap_iter_init(m); !digestmap_iter_done(k_iter);
  91. * k_iter = k_del ? digestmap_iter_next(m, k_iter)
  92. * : digestmap_iter_next_rmv(m, k_iter)) {
  93. * const char *k;
  94. * void *r_voidp;
  95. * routerinfo_t *r;
  96. * k_del=0;
  97. * digestmap_iter_get(k_iter, &k, &r_voidp);
  98. * r = r_voidp;
  99. * if (is_very_old(r)) {
  100. * k_del = 1;
  101. * }
  102. * }
  103. * }
  104. */
  105. #define MAP_FOREACH_MODIFY(prefix, map, keytype, keyvar, valtype, valvar) \
  106. STMT_BEGIN \
  107. prefix##iter_t *keyvar##_iter; \
  108. int keyvar##_del=0; \
  109. for (keyvar##_iter = prefix##iter_init(map); \
  110. !prefix##iter_done(keyvar##_iter); \
  111. keyvar##_iter = keyvar##_del ? \
  112. prefix##iter_next_rmv(map, keyvar##_iter) : \
  113. prefix##iter_next(map, keyvar##_iter)) { \
  114. keytype keyvar; \
  115. void *valvar##_voidp; \
  116. valtype valvar; \
  117. keyvar##_del=0; \
  118. prefix##iter_get(keyvar##_iter, &keyvar, &valvar##_voidp); \
  119. valvar = valvar##_voidp;
  120. /** Used with MAP_FOREACH_MODIFY to remove the currently-iterated-upon
  121. * member of the map. */
  122. #define MAP_DEL_CURRENT(keyvar) \
  123. STMT_BEGIN \
  124. keyvar##_del = 1; \
  125. STMT_END
  126. /** Used to end a MAP_FOREACH() block. */
  127. #define MAP_FOREACH_END } STMT_END ;
  128. /** As MAP_FOREACH, but does not require declaration of prefix or keytype.
  129. * Example use:
  130. * DIGESTMAP_FOREACH(m, k, routerinfo_t *, r) {
  131. * // use k and r
  132. * } DIGESTMAP_FOREACH_END.
  133. */
  134. #define DIGESTMAP_FOREACH(map, keyvar, valtype, valvar) \
  135. MAP_FOREACH(digestmap_, map, const char *, keyvar, valtype, valvar)
  136. /** As MAP_FOREACH_MODIFY, but does not require declaration of prefix or
  137. * keytype.
  138. * Example use:
  139. * DIGESTMAP_FOREACH_MODIFY(m, k, routerinfo_t *, r) {
  140. * if (is_very_old(r))
  141. * MAP_DEL_CURRENT(k);
  142. * } DIGESTMAP_FOREACH_END.
  143. */
  144. #define DIGESTMAP_FOREACH_MODIFY(map, keyvar, valtype, valvar) \
  145. MAP_FOREACH_MODIFY(digestmap_, map, const char *, keyvar, valtype, valvar)
  146. /** Used to end a DIGESTMAP_FOREACH() block. */
  147. #define DIGESTMAP_FOREACH_END MAP_FOREACH_END
  148. #define DIGEST256MAP_FOREACH(map, keyvar, valtype, valvar) \
  149. MAP_FOREACH(digest256map_, map, const uint8_t *, keyvar, valtype, valvar)
  150. #define DIGEST256MAP_FOREACH_MODIFY(map, keyvar, valtype, valvar) \
  151. MAP_FOREACH_MODIFY(digest256map_, map, const uint8_t *, \
  152. keyvar, valtype, valvar)
  153. #define DIGEST256MAP_FOREACH_END MAP_FOREACH_END
  154. #define STRMAP_FOREACH(map, keyvar, valtype, valvar) \
  155. MAP_FOREACH(strmap_, map, const char *, keyvar, valtype, valvar)
  156. #define STRMAP_FOREACH_MODIFY(map, keyvar, valtype, valvar) \
  157. MAP_FOREACH_MODIFY(strmap_, map, const char *, keyvar, valtype, valvar)
  158. #define STRMAP_FOREACH_END MAP_FOREACH_END
  159. void* strmap_set_lc(strmap_t *map, const char *key, void *val);
  160. void* strmap_get_lc(const strmap_t *map, const char *key);
  161. void* strmap_remove_lc(strmap_t *map, const char *key);
  162. #define DECLARE_TYPED_DIGESTMAP_FNS(prefix, maptype, valtype) \
  163. typedef struct maptype maptype; \
  164. typedef struct prefix##iter_t *prefix##iter_t; \
  165. ATTR_UNUSED static inline maptype* \
  166. prefix##new(void) \
  167. { \
  168. return (maptype*)digestmap_new(); \
  169. } \
  170. ATTR_UNUSED static inline digestmap_t* \
  171. prefix##to_digestmap(maptype *map) \
  172. { \
  173. return (digestmap_t*)map; \
  174. } \
  175. ATTR_UNUSED static inline valtype* \
  176. prefix##get(maptype *map, const char *key) \
  177. { \
  178. return (valtype*)digestmap_get((digestmap_t*)map, key); \
  179. } \
  180. ATTR_UNUSED static inline valtype* \
  181. prefix##set(maptype *map, const char *key, valtype *val) \
  182. { \
  183. return (valtype*)digestmap_set((digestmap_t*)map, key, val); \
  184. } \
  185. ATTR_UNUSED static inline valtype* \
  186. prefix##remove(maptype *map, const char *key) \
  187. { \
  188. return (valtype*)digestmap_remove((digestmap_t*)map, key); \
  189. } \
  190. ATTR_UNUSED static inline void \
  191. prefix##f##ree_(maptype *map, void (*free_val)(void*)) \
  192. { \
  193. digestmap_free_((digestmap_t*)map, free_val); \
  194. } \
  195. ATTR_UNUSED static inline int \
  196. prefix##isempty(maptype *map) \
  197. { \
  198. return digestmap_isempty((digestmap_t*)map); \
  199. } \
  200. ATTR_UNUSED static inline int \
  201. prefix##size(maptype *map) \
  202. { \
  203. return digestmap_size((digestmap_t*)map); \
  204. } \
  205. ATTR_UNUSED static inline \
  206. prefix##iter_t *prefix##iter_init(maptype *map) \
  207. { \
  208. return (prefix##iter_t*) digestmap_iter_init((digestmap_t*)map); \
  209. } \
  210. ATTR_UNUSED static inline \
  211. prefix##iter_t *prefix##iter_next(maptype *map, prefix##iter_t *iter) \
  212. { \
  213. return (prefix##iter_t*) digestmap_iter_next( \
  214. (digestmap_t*)map, (digestmap_iter_t*)iter); \
  215. } \
  216. ATTR_UNUSED static inline prefix##iter_t* \
  217. prefix##iter_next_rmv(maptype *map, prefix##iter_t *iter) \
  218. { \
  219. return (prefix##iter_t*) digestmap_iter_next_rmv( \
  220. (digestmap_t*)map, (digestmap_iter_t*)iter); \
  221. } \
  222. ATTR_UNUSED static inline void \
  223. prefix##iter_get(prefix##iter_t *iter, \
  224. const char **keyp, \
  225. valtype **valp) \
  226. { \
  227. void *v; \
  228. digestmap_iter_get((digestmap_iter_t*) iter, keyp, &v); \
  229. *valp = v; \
  230. } \
  231. ATTR_UNUSED static inline int \
  232. prefix##iter_done(prefix##iter_t *iter) \
  233. { \
  234. return digestmap_iter_done((digestmap_iter_t*)iter); \
  235. }
  236. #endif /* !defined(TOR_CONTAINER_H) */