wasm_hashmap.c 6.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290
  1. /*
  2. * Copyright (C) 2019 Intel Corporation. All rights reserved.
  3. * SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
  4. */
  5. #include "wasm_hashmap.h"
  6. #include "wasm_log.h"
  7. #include "wasm_thread.h"
  8. #include "wasm_memory.h"
  9. typedef struct HashMapElem {
  10. void *key;
  11. void *value;
  12. struct HashMapElem *next;
  13. } HashMapElem;
  14. struct HashMap {
  15. /* size of element array */
  16. uint32 size;
  17. /* lock for elements */
  18. korp_mutex *lock;
  19. /* hash function of key */
  20. HashFunc hash_func;
  21. /* key equal function */
  22. KeyEqualFunc key_equal_func;
  23. KeyDestroyFunc key_destroy_func;
  24. ValueDestroyFunc value_destroy_func;
  25. HashMapElem *elements[1];
  26. };
  27. HashMap*
  28. wasm_hash_map_create(uint32 size, bool use_lock,
  29. HashFunc hash_func,
  30. KeyEqualFunc key_equal_func,
  31. KeyDestroyFunc key_destroy_func,
  32. ValueDestroyFunc value_destroy_func)
  33. {
  34. HashMap *map;
  35. uint32 total_size;
  36. if (size > HASH_MAP_MAX_SIZE) {
  37. LOG_ERROR("HashMap create failed: size is too large.\n");
  38. return NULL;
  39. }
  40. if (!hash_func || !key_equal_func) {
  41. LOG_ERROR("HashMap create failed: hash function or key equal function "
  42. " is NULL.\n");
  43. return NULL;
  44. }
  45. total_size = offsetof(HashMap, elements) +
  46. sizeof(HashMapElem) * size +
  47. (use_lock ? sizeof(korp_mutex) : 0);
  48. if (!(map = wasm_malloc(total_size))) {
  49. LOG_ERROR("HashMap create failed: alloc memory failed.\n");
  50. return NULL;
  51. }
  52. memset(map, 0, total_size);
  53. if (use_lock) {
  54. map->lock = (korp_mutex*)
  55. ((uint8*)map + offsetof(HashMap, elements) + sizeof(HashMapElem) * size);
  56. if (ws_mutex_init(map->lock, false)) {
  57. LOG_ERROR("HashMap create failed: init map lock failed.\n");
  58. wasm_free(map);
  59. return NULL;
  60. }
  61. }
  62. map->size = size;
  63. map->hash_func = hash_func;
  64. map->key_equal_func = key_equal_func;
  65. map->key_destroy_func = key_destroy_func;
  66. map->value_destroy_func = value_destroy_func;
  67. return map;
  68. }
  69. bool
  70. wasm_hash_map_insert(HashMap *map, void *key, void *value)
  71. {
  72. uint32 index;
  73. HashMapElem *elem;
  74. if (!map || !key) {
  75. LOG_ERROR("HashMap insert elem failed: map or key is NULL.\n");
  76. return false;
  77. }
  78. if (map->lock) {
  79. ws_mutex_lock(map->lock);
  80. }
  81. index = map->hash_func(key) % map->size;
  82. elem = map->elements[index];
  83. while (elem) {
  84. if (map->key_equal_func(elem->key, key)) {
  85. LOG_ERROR("HashMap insert elem failed: duplicated key found.\n");
  86. goto fail;
  87. }
  88. elem = elem->next;
  89. }
  90. if (!(elem = wasm_malloc(sizeof(HashMapElem)))) {
  91. LOG_ERROR("HashMap insert elem failed: alloc memory failed.\n");
  92. goto fail;
  93. }
  94. elem->key = key;
  95. elem->value = value;
  96. elem->next = map->elements[index];
  97. map->elements[index] = elem;
  98. if (map->lock) {
  99. ws_mutex_unlock(map->lock);
  100. }
  101. return true;
  102. fail:
  103. if (map->lock) {
  104. ws_mutex_unlock(map->lock);
  105. }
  106. return false;
  107. }
  108. void*
  109. wasm_hash_map_find(HashMap *map, void *key)
  110. {
  111. uint32 index;
  112. HashMapElem *elem;
  113. void *value;
  114. if (!map || !key) {
  115. LOG_ERROR("HashMap find elem failed: map or key is NULL.\n");
  116. return NULL;
  117. }
  118. if (map->lock) {
  119. ws_mutex_lock(map->lock);
  120. }
  121. index = map->hash_func(key) % map->size;
  122. elem = map->elements[index];
  123. while (elem) {
  124. if (map->key_equal_func(elem->key, key)) {
  125. value = elem->value;
  126. if (map->lock) {
  127. ws_mutex_unlock(map->lock);
  128. }
  129. return value;
  130. }
  131. elem = elem->next;
  132. }
  133. if (map->lock) {
  134. ws_mutex_unlock(map->lock);
  135. }
  136. return NULL;
  137. }
  138. bool
  139. wasm_hash_map_update(HashMap *map, void *key, void *value,
  140. void **p_old_value)
  141. {
  142. uint32 index;
  143. HashMapElem *elem;
  144. if (!map || !key) {
  145. LOG_ERROR("HashMap update elem failed: map or key is NULL.\n");
  146. return false;
  147. }
  148. if (map->lock) {
  149. ws_mutex_lock(map->lock);
  150. }
  151. index = map->hash_func(key) % map->size;
  152. elem = map->elements[index];
  153. while (elem) {
  154. if (map->key_equal_func(elem->key, key)) {
  155. if (p_old_value)
  156. *p_old_value = elem->value;
  157. elem->value = value;
  158. if (map->lock) {
  159. ws_mutex_unlock(map->lock);
  160. }
  161. return true;
  162. }
  163. elem = elem->next;
  164. }
  165. if (map->lock) {
  166. ws_mutex_unlock(map->lock);
  167. }
  168. return false;
  169. }
  170. bool
  171. wasm_hash_map_remove(HashMap *map, void *key,
  172. void **p_old_key, void **p_old_value)
  173. {
  174. uint32 index;
  175. HashMapElem *elem, *prev;
  176. if (!map || !key) {
  177. LOG_ERROR("HashMap remove elem failed: map or key is NULL.\n");
  178. return false;
  179. }
  180. if (map->lock) {
  181. ws_mutex_lock(map->lock);
  182. }
  183. index = map->hash_func(key) % map->size;
  184. prev = elem = map->elements[index];
  185. while (elem) {
  186. if (map->key_equal_func(elem->key, key)) {
  187. if (p_old_key)
  188. *p_old_key = elem->key;
  189. if (p_old_value)
  190. *p_old_value = elem->value;
  191. if (elem == map->elements[index])
  192. map->elements[index] = elem->next;
  193. else
  194. prev->next = elem->next;
  195. wasm_free(elem);
  196. if (map->lock) {
  197. ws_mutex_unlock(map->lock);
  198. }
  199. return true;
  200. }
  201. prev = elem;
  202. elem = elem->next;
  203. }
  204. if (map->lock) {
  205. ws_mutex_unlock(map->lock);
  206. }
  207. return false;
  208. }
  209. bool
  210. wasm_hash_map_destroy(HashMap *map)
  211. {
  212. uint32 index;
  213. HashMapElem *elem, *next;
  214. if (!map) {
  215. LOG_ERROR("HashMap destroy failed: map is NULL.\n");
  216. return false;
  217. }
  218. if (map->lock) {
  219. ws_mutex_lock(map->lock);
  220. }
  221. for (index = 0; index < map->size; index++) {
  222. elem = map->elements[index];
  223. while (elem) {
  224. next = elem->next;
  225. if (map->key_destroy_func) {
  226. map->key_destroy_func(elem->key);
  227. }
  228. if (map->value_destroy_func) {
  229. map->value_destroy_func(elem->value);
  230. }
  231. wasm_free(elem);
  232. elem = next;
  233. }
  234. }
  235. if (map->lock) {
  236. ws_mutex_unlock(map->lock);
  237. ws_mutex_destroy(map->lock);
  238. }
  239. wasm_free(map);
  240. return true;
  241. }