iron_map.c 5.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237
  1. #include "iron_map.h"
  2. #include "iron_gc.h"
  3. #include "iron_string.h"
  4. static size_t hash(const char *k) {
  5. // fnv1a
  6. size_t hash = 0x811c9dc5;
  7. while (*k) {
  8. hash ^= (unsigned char) *k++;
  9. hash *= 0x01000193;
  10. }
  11. return hash;
  12. }
  13. static size_t index_set(any_map_t *m, char *k) {
  14. size_t i = hash(k) & (m->keys->capacity - 1); // % m->keys->capacity
  15. while (true) {
  16. if (m->keys->buffer[i] == NULL) {
  17. m->keys->length++;
  18. break;
  19. }
  20. if (string_equals(k, m->keys->buffer[i])) {
  21. break;
  22. }
  23. ++i;
  24. if (i > m->keys->capacity - 1) {
  25. i = 0;
  26. }
  27. }
  28. return i;
  29. }
  30. static size_t index_get(char_ptr_array_t *keys, char *k) {
  31. if (k == NULL || keys->capacity == 0) {
  32. return -1;
  33. }
  34. size_t i = hash(k) & (keys->capacity - 1);
  35. while (!string_equals(k, keys->buffer[i])) {
  36. if (keys->buffer[i] == NULL) {
  37. return -1;
  38. }
  39. ++i;
  40. if (i > keys->capacity - 1) {
  41. i = 0;
  42. }
  43. }
  44. return i;
  45. }
  46. static void resize(any_map_t *m, int elem_size) {
  47. if (m->keys->length < m->keys->capacity * 0.5) {
  48. return;
  49. }
  50. int cap = m->keys->capacity == 0 ? 16 : m->keys->capacity * 2;
  51. any_map_t *tmp = any_map_create();
  52. tmp->keys->capacity = cap;
  53. tmp->keys->buffer = gc_realloc(tmp->keys->buffer, cap * sizeof(void *));
  54. tmp->values->capacity = cap;
  55. tmp->values->buffer = gc_realloc(tmp->values->buffer, cap * elem_size);
  56. if (elem_size < 8) {
  57. gc_leaf(tmp->values->buffer);
  58. }
  59. any_array_t *old_keys = map_keys(m);
  60. for (int i = 0; i < old_keys->length; ++i) {
  61. char *k = old_keys->buffer[i];
  62. size_t j = index_set(tmp, k);
  63. tmp->keys->buffer[j] = k;
  64. if (elem_size == 8) {
  65. void **buf = tmp->values->buffer;
  66. buf[j] = any_map_get(m, k);
  67. }
  68. else {
  69. int32_t *buf = tmp->values->buffer;
  70. buf[j] = i32_map_get(m, k);
  71. }
  72. }
  73. m->keys = tmp->keys;
  74. m->values = tmp->values;
  75. }
  76. void i32_map_set(i32_map_t *m, char *k, int v) {
  77. resize(m, 4);
  78. size_t i = index_set(m, k);
  79. m->keys->buffer[i] = k;
  80. m->values->buffer[i] = v;
  81. }
  82. void f32_map_set(f32_map_t *m, char *k, float v) {
  83. resize(m, 4);
  84. size_t i = index_set(m, k);
  85. m->keys->buffer[i] = k;
  86. m->values->buffer[i] = v;
  87. }
  88. void any_map_set(any_map_t *m, char *k, void *v) {
  89. resize(m, 8);
  90. size_t i = index_set(m, k);
  91. m->keys->buffer[i] = k;
  92. m->values->buffer[i] = v;
  93. }
  94. int32_t i32_map_get(i32_map_t *m, char *k) {
  95. size_t i = index_get(m->keys, k);
  96. return i == -1 ? -1 : m->values->buffer[i];
  97. }
  98. float f32_map_get(f32_map_t *m, char *k) {
  99. size_t i = index_get(m->keys, k);
  100. return i == -1 ? -1.0 : m->values->buffer[i];
  101. }
  102. void *any_map_get(any_map_t *m, char *k) {
  103. size_t i = index_get(m->keys, k);
  104. return i == -1 ? NULL : m->values->buffer[i];
  105. }
  106. static int next_pos(any_map_t *m, int i) {
  107. return i == m->keys->capacity - 1 ? 0 : i + 1;
  108. }
  109. void map_delete(any_map_t *m, char *k) {
  110. size_t i = index_get(m->keys, k);
  111. if (i != -1) {
  112. m->keys->buffer[i] = NULL;
  113. m->values->buffer[i] = NULL;
  114. m->keys->length--;
  115. int next = next_pos(m, i);
  116. while (m->keys->buffer[next] != NULL && next != i) {
  117. int j = index_set(m, m->keys->buffer[next]);
  118. if (j != next) {
  119. m->keys->buffer[j] = m->keys->buffer[next];
  120. m->values->buffer[j] = m->values->buffer[next];
  121. m->keys->buffer[next] = NULL;
  122. m->values->buffer[next] = NULL;
  123. }
  124. next = next_pos(m, next);
  125. }
  126. }
  127. }
  128. any_array_t *map_keys(any_map_t *m) {
  129. char_ptr_array_t *keys = gc_alloc(sizeof(char_ptr_array_t));
  130. char_ptr_array_resize(keys, m->keys->length);
  131. for (int i = 0; i < m->keys->capacity; ++i) {
  132. if (m->keys->buffer[i] != NULL) {
  133. char_ptr_array_push(keys, m->keys->buffer[i]);
  134. }
  135. }
  136. return keys;
  137. }
  138. i32_map_t *i32_map_create() {
  139. i32_map_t *r = gc_alloc(sizeof(i32_map_t));
  140. r->keys = gc_alloc(sizeof(char_ptr_array_t));
  141. r->values = gc_alloc(sizeof(i32_array_t));
  142. return r;
  143. }
  144. any_map_t *any_map_create() {
  145. any_map_t *r = gc_alloc(sizeof(any_map_t));
  146. r->keys = gc_alloc(sizeof(char_ptr_array_t));
  147. r->values = gc_alloc(sizeof(any_array_t));
  148. return r;
  149. }
  150. // imap
  151. void i32_imap_set(i32_imap_t *m, int k, int v) {
  152. int i = i32_array_index_of(m->keys, k);
  153. if (i == -1) {
  154. i32_array_push(m->keys, k);
  155. i32_array_push(m->values, v);
  156. }
  157. else {
  158. m->keys->buffer[i] = k;
  159. m->values->buffer[i] = v;
  160. }
  161. }
  162. void any_imap_set(any_imap_t *m, int k, void *v) {
  163. int i = i32_array_index_of(m->keys, k);
  164. if (i == -1) {
  165. i32_array_push(m->keys, k);
  166. any_array_push(m->values, v);
  167. }
  168. else {
  169. m->keys->buffer[i] = k;
  170. m->values->buffer[i] = v;
  171. }
  172. }
  173. int32_t i32_imap_get(i32_imap_t *m, int k) {
  174. int i = i32_array_index_of(m->keys, k);
  175. if (i > -1) {
  176. return m->values->buffer[i];
  177. }
  178. return -1;
  179. }
  180. void *any_imap_get(any_imap_t *m, int k) {
  181. int i = i32_array_index_of(m->keys, k);
  182. if (i > -1) {
  183. return m->values->buffer[i];
  184. }
  185. return NULL;
  186. }
  187. void imap_delete(any_imap_t *m, int k) {
  188. int i = i32_array_index_of(m->keys, k);
  189. if (i > -1) {
  190. i32_array_splice(m->keys, i, 1);
  191. array_splice(m->values, i, 1);
  192. }
  193. }
  194. i32_array_t *imap_keys(any_imap_t *m) {
  195. return m->keys;
  196. }
  197. i32_imap_t *i32_imap_create() {
  198. i32_imap_t *r = gc_alloc(sizeof(i32_imap_t));
  199. r->keys = gc_alloc(sizeof(i32_array_t));
  200. r->values = gc_alloc(sizeof(i32_array_t));
  201. return r;
  202. }
  203. any_imap_t *any_imap_create() {
  204. any_imap_t *r = gc_alloc(sizeof(any_imap_t));
  205. r->keys = gc_alloc(sizeof(i32_array_t));
  206. r->values = gc_alloc(sizeof(any_array_t));
  207. return r;
  208. }