bh_hashmap.c 8.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385
  1. /*
  2. * Copyright (C) 2019 Intel Corporation. All rights reserved.
  3. * SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
  4. */
  5. #include "bh_hashmap.h"
  6. typedef struct HashMapElem {
  7. void *key;
  8. void *value;
  9. struct HashMapElem *next;
  10. } HashMapElem;
  11. struct HashMap {
  12. /* size of element array */
  13. uint32 size;
  14. /* lock for elements */
  15. korp_mutex *lock;
  16. /* hash function of key */
  17. HashFunc hash_func;
  18. /* key equal function */
  19. KeyEqualFunc key_equal_func;
  20. KeyDestroyFunc key_destroy_func;
  21. ValueDestroyFunc value_destroy_func;
  22. HashMapElem *elements[1];
  23. };
  24. HashMap *
  25. bh_hash_map_create(uint32 size, bool use_lock, HashFunc hash_func,
  26. KeyEqualFunc key_equal_func, KeyDestroyFunc key_destroy_func,
  27. ValueDestroyFunc value_destroy_func)
  28. {
  29. HashMap *map;
  30. uint64 total_size;
  31. if (size > HASH_MAP_MAX_SIZE) {
  32. LOG_ERROR("HashMap create failed: size is too large.\n");
  33. return NULL;
  34. }
  35. if (!hash_func || !key_equal_func) {
  36. LOG_ERROR("HashMap create failed: hash function or key equal function "
  37. " is NULL.\n");
  38. return NULL;
  39. }
  40. total_size = offsetof(HashMap, elements)
  41. + sizeof(HashMapElem *) * (uint64)size
  42. + (use_lock ? sizeof(korp_mutex) : 0);
  43. if (total_size >= UINT32_MAX || !(map = BH_MALLOC((uint32)total_size))) {
  44. LOG_ERROR("HashMap create failed: alloc memory failed.\n");
  45. return NULL;
  46. }
  47. memset(map, 0, (uint32)total_size);
  48. if (use_lock) {
  49. map->lock = (korp_mutex *)((uint8 *)map + offsetof(HashMap, elements)
  50. + sizeof(HashMapElem *) * size);
  51. if (os_mutex_init(map->lock)) {
  52. LOG_ERROR("HashMap create failed: init map lock failed.\n");
  53. BH_FREE(map);
  54. return NULL;
  55. }
  56. }
  57. map->size = size;
  58. map->hash_func = hash_func;
  59. map->key_equal_func = key_equal_func;
  60. map->key_destroy_func = key_destroy_func;
  61. map->value_destroy_func = value_destroy_func;
  62. return map;
  63. }
  64. bool
  65. bh_hash_map_insert_with_dup(HashMap *map, void *key, void *value)
  66. {
  67. uint32 index;
  68. HashMapElem *elem;
  69. if (!map || !key) {
  70. LOG_ERROR("HashMap insert elem failed: map or key is NULL.\n");
  71. return false;
  72. }
  73. if (map->lock) {
  74. os_mutex_lock(map->lock);
  75. }
  76. index = map->hash_func(key) % map->size;
  77. elem = map->elements[index];
  78. while (elem) {
  79. if (map->key_equal_func(elem->key, key)) {
  80. if (elem->value == value)
  81. break;
  82. else
  83. return false;
  84. }
  85. elem = elem->next;
  86. }
  87. if (!elem) {
  88. if (!(elem = BH_MALLOC(sizeof(HashMapElem)))) {
  89. LOG_ERROR("HashMap insert elem failed: alloc memory failed.\n");
  90. goto fail;
  91. }
  92. elem->key = key;
  93. elem->value = value;
  94. elem->next = map->elements[index];
  95. map->elements[index] = elem;
  96. }
  97. if (map->lock) {
  98. os_mutex_unlock(map->lock);
  99. }
  100. return true;
  101. fail:
  102. if (map->lock) {
  103. os_mutex_unlock(map->lock);
  104. }
  105. return false;
  106. }
  107. bool
  108. bh_hash_map_insert(HashMap *map, void *key, void *value)
  109. {
  110. uint32 index;
  111. HashMapElem *elem;
  112. if (!map || !key) {
  113. LOG_ERROR("HashMap insert elem failed: map or key is NULL.\n");
  114. return false;
  115. }
  116. if (map->lock) {
  117. os_mutex_lock(map->lock);
  118. }
  119. index = map->hash_func(key) % map->size;
  120. elem = map->elements[index];
  121. while (elem) {
  122. if (map->key_equal_func(elem->key, key)) {
  123. LOG_ERROR("HashMap insert elem failed: duplicated key found.\n");
  124. goto fail;
  125. }
  126. elem = elem->next;
  127. }
  128. if (!(elem = BH_MALLOC(sizeof(HashMapElem)))) {
  129. LOG_ERROR("HashMap insert elem failed: alloc memory failed.\n");
  130. goto fail;
  131. }
  132. elem->key = key;
  133. elem->value = value;
  134. elem->next = map->elements[index];
  135. map->elements[index] = elem;
  136. if (map->lock) {
  137. os_mutex_unlock(map->lock);
  138. }
  139. return true;
  140. fail:
  141. if (map->lock) {
  142. os_mutex_unlock(map->lock);
  143. }
  144. return false;
  145. }
  146. void *
  147. bh_hash_map_find(HashMap *map, void *key)
  148. {
  149. uint32 index;
  150. HashMapElem *elem;
  151. void *value;
  152. if (!map || !key) {
  153. LOG_ERROR("HashMap find elem failed: map or key is NULL.\n");
  154. return NULL;
  155. }
  156. if (map->lock) {
  157. os_mutex_lock(map->lock);
  158. }
  159. index = map->hash_func(key) % map->size;
  160. elem = map->elements[index];
  161. while (elem) {
  162. if (map->key_equal_func(elem->key, key)) {
  163. value = elem->value;
  164. if (map->lock) {
  165. os_mutex_unlock(map->lock);
  166. }
  167. return value;
  168. }
  169. elem = elem->next;
  170. }
  171. if (map->lock) {
  172. os_mutex_unlock(map->lock);
  173. }
  174. return NULL;
  175. }
  176. bool
  177. bh_hash_map_update(HashMap *map, void *key, void *value, void **p_old_value)
  178. {
  179. uint32 index;
  180. HashMapElem *elem;
  181. if (!map || !key) {
  182. LOG_ERROR("HashMap update elem failed: map or key is NULL.\n");
  183. return false;
  184. }
  185. if (map->lock) {
  186. os_mutex_lock(map->lock);
  187. }
  188. index = map->hash_func(key) % map->size;
  189. elem = map->elements[index];
  190. while (elem) {
  191. if (map->key_equal_func(elem->key, key)) {
  192. if (p_old_value)
  193. *p_old_value = elem->value;
  194. elem->value = value;
  195. if (map->lock) {
  196. os_mutex_unlock(map->lock);
  197. }
  198. return true;
  199. }
  200. elem = elem->next;
  201. }
  202. if (map->lock) {
  203. os_mutex_unlock(map->lock);
  204. }
  205. return false;
  206. }
  207. bool
  208. bh_hash_map_remove(HashMap *map, void *key, void **p_old_key,
  209. void **p_old_value)
  210. {
  211. uint32 index;
  212. HashMapElem *elem, *prev;
  213. if (!map || !key) {
  214. LOG_ERROR("HashMap remove elem failed: map or key is NULL.\n");
  215. return false;
  216. }
  217. if (map->lock) {
  218. os_mutex_lock(map->lock);
  219. }
  220. index = map->hash_func(key) % map->size;
  221. prev = elem = map->elements[index];
  222. while (elem) {
  223. if (map->key_equal_func(elem->key, key)) {
  224. if (p_old_key)
  225. *p_old_key = elem->key;
  226. if (p_old_value)
  227. *p_old_value = elem->value;
  228. if (elem == map->elements[index])
  229. map->elements[index] = elem->next;
  230. else
  231. prev->next = elem->next;
  232. BH_FREE(elem);
  233. if (map->lock) {
  234. os_mutex_unlock(map->lock);
  235. }
  236. return true;
  237. }
  238. prev = elem;
  239. elem = elem->next;
  240. }
  241. if (map->lock) {
  242. os_mutex_unlock(map->lock);
  243. }
  244. return false;
  245. }
  246. bool
  247. bh_hash_map_destroy(HashMap *map)
  248. {
  249. uint32 index;
  250. HashMapElem *elem, *next;
  251. if (!map) {
  252. LOG_ERROR("HashMap destroy failed: map is NULL.\n");
  253. return false;
  254. }
  255. if (map->lock) {
  256. os_mutex_lock(map->lock);
  257. }
  258. for (index = 0; index < map->size; index++) {
  259. elem = map->elements[index];
  260. while (elem) {
  261. next = elem->next;
  262. if (map->key_destroy_func) {
  263. map->key_destroy_func(elem->key);
  264. }
  265. if (map->value_destroy_func) {
  266. map->value_destroy_func(elem->value);
  267. }
  268. BH_FREE(elem);
  269. elem = next;
  270. }
  271. }
  272. if (map->lock) {
  273. os_mutex_unlock(map->lock);
  274. os_mutex_destroy(map->lock);
  275. }
  276. BH_FREE(map);
  277. return true;
  278. }
  279. uint32
  280. bh_hash_map_get_struct_size(HashMap *hashmap)
  281. {
  282. uint32 size = (uint32)(uintptr_t)offsetof(HashMap, elements)
  283. + (uint32)sizeof(HashMapElem *) * hashmap->size;
  284. if (hashmap->lock) {
  285. size += (uint32)sizeof(korp_mutex);
  286. }
  287. return size;
  288. }
  289. uint32
  290. bh_hash_map_get_elem_struct_size()
  291. {
  292. return (uint32)sizeof(HashMapElem);
  293. }
  294. bool
  295. bh_hash_map_traverse(HashMap *map, TraverseCallbackFunc callback,
  296. void *user_data)
  297. {
  298. uint32 index;
  299. HashMapElem *elem, *next;
  300. if (!map || !callback) {
  301. LOG_ERROR("HashMap traverse failed: map or callback is NULL.\n");
  302. return false;
  303. }
  304. if (map->lock) {
  305. os_mutex_lock(map->lock);
  306. }
  307. for (index = 0; index < map->size; index++) {
  308. elem = map->elements[index];
  309. while (elem) {
  310. next = elem->next;
  311. callback(elem->key, elem->value, user_data);
  312. elem = next;
  313. }
  314. }
  315. if (map->lock) {
  316. os_mutex_unlock(map->lock);
  317. }
  318. return true;
  319. }