Sun, 13 May 2018 17:34:06 +0200
documentation for the UcxStack
olaf@20 | 1 | /* |
universe@103 | 2 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER. |
olaf@20 | 3 | * |
universe@259 | 4 | * Copyright 2017 Mike Becker, Olaf Wintermann All rights reserved. |
universe@103 | 5 | * |
universe@103 | 6 | * Redistribution and use in source and binary forms, with or without |
universe@103 | 7 | * modification, are permitted provided that the following conditions are met: |
universe@103 | 8 | * |
universe@103 | 9 | * 1. Redistributions of source code must retain the above copyright |
universe@103 | 10 | * notice, this list of conditions and the following disclaimer. |
universe@103 | 11 | * |
universe@103 | 12 | * 2. Redistributions in binary form must reproduce the above copyright |
universe@103 | 13 | * notice, this list of conditions and the following disclaimer in the |
universe@103 | 14 | * documentation and/or other materials provided with the distribution. |
universe@103 | 15 | * |
universe@103 | 16 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
universe@103 | 17 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
universe@103 | 18 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
universe@103 | 19 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE |
universe@103 | 20 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
universe@103 | 21 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
universe@103 | 22 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
universe@103 | 23 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
universe@103 | 24 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
universe@103 | 25 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
universe@103 | 26 | * POSSIBILITY OF SUCH DAMAGE. |
olaf@20 | 27 | */ |
olaf@2 | 28 | |
universe@251 | 29 | #include "ucx/map.h" |
universe@251 | 30 | |
olaf@20 | 31 | #include <stdlib.h> |
olaf@20 | 32 | #include <string.h> |
olaf@20 | 33 | |
olaf@20 | 34 | UcxMap *ucx_map_new(size_t size) { |
olaf@137 | 35 | return ucx_map_new_a(NULL, size); |
olaf@107 | 36 | } |
olaf@107 | 37 | |
olaf@137 | 38 | UcxMap *ucx_map_new_a(UcxAllocator *allocator, size_t size) { |
olaf@45 | 39 | if(size == 0) { |
olaf@45 | 40 | size = 16; |
olaf@45 | 41 | } |
olaf@108 | 42 | |
olaf@107 | 43 | if(!allocator) { |
olaf@107 | 44 | allocator = ucx_default_allocator(); |
olaf@107 | 45 | } |
olaf@107 | 46 | |
universe@173 | 47 | UcxMap *map = (UcxMap*)almalloc(allocator, sizeof(UcxMap)); |
universe@139 | 48 | if (!map) { |
olaf@20 | 49 | return NULL; |
olaf@20 | 50 | } |
olaf@107 | 51 | |
olaf@107 | 52 | map->allocator = allocator; |
universe@173 | 53 | map->map = (UcxMapElement**)alcalloc( |
universe@173 | 54 | allocator, size, sizeof(UcxMapElement*)); |
olaf@20 | 55 | if(map->map == NULL) { |
universe@173 | 56 | alfree(allocator, map); |
olaf@20 | 57 | return NULL; |
olaf@20 | 58 | } |
olaf@20 | 59 | map->size = size; |
olaf@45 | 60 | map->count = 0; |
olaf@20 | 61 | |
olaf@20 | 62 | return map; |
olaf@20 | 63 | } |
olaf@20 | 64 | |
universe@206 | 65 | static void ucx_map_free_elmlist_contents(UcxMap *map) { |
universe@29 | 66 | for (size_t n = 0 ; n < map->size ; n++) { |
universe@29 | 67 | UcxMapElement *elem = map->map[n]; |
universe@29 | 68 | if (elem != NULL) { |
universe@29 | 69 | do { |
universe@29 | 70 | UcxMapElement *next = elem->next; |
universe@173 | 71 | alfree(map->allocator, elem->key.data); |
universe@173 | 72 | alfree(map->allocator, elem); |
universe@29 | 73 | elem = next; |
universe@29 | 74 | } while (elem != NULL); |
universe@29 | 75 | } |
universe@29 | 76 | } |
olaf@70 | 77 | } |
olaf@70 | 78 | |
olaf@70 | 79 | void ucx_map_free(UcxMap *map) { |
universe@206 | 80 | ucx_map_free_elmlist_contents(map); |
universe@206 | 81 | alfree(map->allocator, map->map); |
universe@173 | 82 | alfree(map->allocator, map); |
universe@29 | 83 | } |
universe@29 | 84 | |
universe@209 | 85 | void ucx_map_free_content(UcxMap *map, ucx_destructor destr) { |
universe@208 | 86 | UcxMapIterator iter = ucx_map_iterator(map); |
universe@208 | 87 | void *val; |
universe@208 | 88 | UCX_MAP_FOREACH(key, val, iter) { |
universe@277 | 89 | if (destr) { |
universe@277 | 90 | destr(val); |
universe@277 | 91 | } else { |
universe@287 | 92 | alfree(map->allocator, val); |
universe@277 | 93 | } |
universe@208 | 94 | } |
universe@208 | 95 | } |
universe@208 | 96 | |
universe@206 | 97 | void ucx_map_clear(UcxMap *map) { |
universe@207 | 98 | if (map->count == 0) { |
universe@207 | 99 | return; // nothing to do |
universe@207 | 100 | } |
universe@206 | 101 | ucx_map_free_elmlist_contents(map); |
universe@206 | 102 | memset(map->map, 0, map->size*sizeof(UcxMapElement*)); |
universe@206 | 103 | map->count = 0; |
universe@206 | 104 | } |
universe@206 | 105 | |
universe@253 | 106 | int ucx_map_copy(UcxMap *from, UcxMap *to, copy_func fnc, void *data) { |
olaf@52 | 107 | UcxMapIterator i = ucx_map_iterator(from); |
olaf@52 | 108 | void *value; |
olaf@111 | 109 | UCX_MAP_FOREACH(key, value, i) { |
universe@138 | 110 | if (ucx_map_put(to, key, fnc ? fnc(value, data) : value)) { |
olaf@52 | 111 | return 1; |
olaf@52 | 112 | } |
olaf@52 | 113 | } |
olaf@52 | 114 | return 0; |
olaf@52 | 115 | } |
olaf@52 | 116 | |
olaf@44 | 117 | UcxMap *ucx_map_clone(UcxMap *map, copy_func fnc, void *data) { |
universe@51 | 118 | size_t bs = (map->count * 5) >> 1; |
olaf@45 | 119 | UcxMap *newmap = ucx_map_new(bs > map->size ? bs : map->size); |
universe@138 | 120 | if (!newmap) { |
olaf@52 | 121 | return NULL; |
olaf@44 | 122 | } |
olaf@52 | 123 | ucx_map_copy(map, newmap, fnc, data); |
olaf@44 | 124 | return newmap; |
olaf@44 | 125 | } |
olaf@44 | 126 | |
olaf@52 | 127 | int ucx_map_rehash(UcxMap *map) { |
universe@51 | 128 | size_t load = (map->size * 3) >> 2; |
universe@51 | 129 | if (map->count > load) { |
olaf@52 | 130 | UcxMap oldmap; |
olaf@52 | 131 | oldmap.map = map->map; |
olaf@52 | 132 | oldmap.size = map->size; |
olaf@52 | 133 | oldmap.count = map->count; |
olaf@107 | 134 | oldmap.allocator = map->allocator; |
olaf@52 | 135 | |
olaf@52 | 136 | map->size = (map->count * 5) >> 1; |
universe@173 | 137 | map->map = (UcxMapElement**)alcalloc( |
universe@173 | 138 | map->allocator, map->size, sizeof(UcxMapElement*)); |
universe@138 | 139 | if (!map->map) { |
olaf@52 | 140 | *map = oldmap; |
olaf@52 | 141 | return 1; |
olaf@52 | 142 | } |
olaf@52 | 143 | map->count = 0; |
olaf@52 | 144 | ucx_map_copy(&oldmap, map, NULL, NULL); |
olaf@70 | 145 | |
olaf@70 | 146 | /* free the UcxMapElement list of oldmap */ |
universe@206 | 147 | ucx_map_free_elmlist_contents(&oldmap); |
universe@206 | 148 | alfree(map->allocator, oldmap.map); |
universe@51 | 149 | } |
olaf@52 | 150 | return 0; |
universe@51 | 151 | } |
universe@51 | 152 | |
olaf@20 | 153 | int ucx_map_put(UcxMap *map, UcxKey key, void *data) { |
olaf@107 | 154 | UcxAllocator *allocator = map->allocator; |
olaf@107 | 155 | |
universe@138 | 156 | if (key.hash == 0) { |
olaf@20 | 157 | key.hash = ucx_hash((char*)key.data, key.len); |
olaf@20 | 158 | } |
olaf@20 | 159 | |
universe@29 | 160 | size_t slot = key.hash%map->size; |
universe@253 | 161 | UcxMapElement *elm = map->map[slot]; |
universe@253 | 162 | UcxMapElement *prev = NULL; |
universe@29 | 163 | |
universe@138 | 164 | while (elm && elm->key.hash < key.hash) { |
universe@29 | 165 | prev = elm; |
universe@29 | 166 | elm = elm->next; |
universe@29 | 167 | } |
universe@29 | 168 | |
universe@138 | 169 | if (!elm || elm->key.hash != key.hash) { |
universe@173 | 170 | UcxMapElement *e = (UcxMapElement*)almalloc( |
universe@173 | 171 | allocator, sizeof(UcxMapElement)); |
universe@138 | 172 | if (!e) { |
olaf@20 | 173 | return -1; |
olaf@20 | 174 | } |
olaf@30 | 175 | e->key.data = NULL; |
universe@53 | 176 | if (prev) { |
universe@53 | 177 | prev->next = e; |
universe@53 | 178 | } else { |
universe@29 | 179 | map->map[slot] = e; |
universe@29 | 180 | } |
universe@29 | 181 | e->next = elm; |
olaf@20 | 182 | elm = e; |
olaf@20 | 183 | } |
universe@29 | 184 | |
universe@138 | 185 | if (!elm->key.data) { |
universe@173 | 186 | void *kd = almalloc(allocator, key.len); |
universe@138 | 187 | if (!kd) { |
olaf@30 | 188 | return -1; |
olaf@30 | 189 | } |
olaf@30 | 190 | memcpy(kd, key.data, key.len); |
olaf@30 | 191 | key.data = kd; |
olaf@30 | 192 | elm->key = key; |
olaf@45 | 193 | map->count++; |
olaf@30 | 194 | } |
olaf@20 | 195 | elm->data = data; |
olaf@20 | 196 | |
olaf@20 | 197 | return 0; |
olaf@20 | 198 | } |
olaf@20 | 199 | |
universe@253 | 200 | static void* ucx_map_get_and_remove(UcxMap *map, UcxKey key, int remove) { |
olaf@20 | 201 | if(key.hash == 0) { |
olaf@20 | 202 | key.hash = ucx_hash((char*)key.data, key.len); |
olaf@20 | 203 | } |
olaf@20 | 204 | |
universe@53 | 205 | size_t slot = key.hash%map->size; |
universe@253 | 206 | UcxMapElement *elm = map->map[slot]; |
universe@253 | 207 | UcxMapElement *pelm = NULL; |
universe@53 | 208 | while (elm && elm->key.hash <= key.hash) { |
olaf@20 | 209 | if(elm->key.hash == key.hash) { |
olaf@20 | 210 | int n = (key.len > elm->key.len) ? elm->key.len : key.len; |
universe@29 | 211 | if (memcmp(elm->key.data, key.data, n) == 0) { |
universe@53 | 212 | void *data = elm->data; |
universe@53 | 213 | if (remove) { |
universe@53 | 214 | if (pelm) { |
universe@53 | 215 | pelm->next = elm->next; |
universe@53 | 216 | } else { |
universe@53 | 217 | map->map[slot] = elm->next; |
universe@53 | 218 | } |
universe@173 | 219 | alfree(map->allocator, elm->key.data); |
universe@173 | 220 | alfree(map->allocator, elm); |
universe@53 | 221 | map->count--; |
universe@53 | 222 | } |
universe@53 | 223 | |
universe@53 | 224 | return data; |
olaf@20 | 225 | } |
olaf@20 | 226 | } |
universe@53 | 227 | pelm = elm; |
universe@53 | 228 | elm = pelm->next; |
olaf@20 | 229 | } |
olaf@20 | 230 | |
olaf@20 | 231 | return NULL; |
olaf@20 | 232 | } |
olaf@20 | 233 | |
universe@53 | 234 | void *ucx_map_get(UcxMap *map, UcxKey key) { |
universe@53 | 235 | return ucx_map_get_and_remove(map, key, 0); |
universe@53 | 236 | } |
universe@53 | 237 | |
universe@53 | 238 | void *ucx_map_remove(UcxMap *map, UcxKey key) { |
universe@53 | 239 | return ucx_map_get_and_remove(map, key, 1); |
universe@53 | 240 | } |
universe@53 | 241 | |
olaf@20 | 242 | UcxKey ucx_key(void *data, size_t len) { |
olaf@20 | 243 | UcxKey key; |
olaf@20 | 244 | key.data = data; |
olaf@20 | 245 | key.len = len; |
universe@69 | 246 | key.hash = ucx_hash((const char*) data, len); |
olaf@20 | 247 | return key; |
olaf@20 | 248 | } |
olaf@20 | 249 | |
olaf@20 | 250 | |
universe@67 | 251 | int ucx_hash(const char *data, size_t len) { |
olaf@20 | 252 | /* murmur hash 2 */ |
olaf@20 | 253 | |
olaf@20 | 254 | int m = 0x5bd1e995; |
olaf@20 | 255 | int r = 24; |
olaf@20 | 256 | |
olaf@20 | 257 | int h = 25 ^ len; |
olaf@20 | 258 | |
olaf@20 | 259 | int i = 0; |
olaf@20 | 260 | while (len >= 4) { |
olaf@20 | 261 | int k = data[i + 0] & 0xFF; |
olaf@20 | 262 | k |= (data[i + 1] & 0xFF) << 8; |
olaf@20 | 263 | k |= (data[i + 2] & 0xFF) << 16; |
olaf@20 | 264 | k |= (data[i + 3] & 0xFF) << 24; |
olaf@20 | 265 | |
olaf@20 | 266 | k *= m; |
olaf@20 | 267 | k ^= k >> r; |
olaf@20 | 268 | k *= m; |
olaf@20 | 269 | |
olaf@20 | 270 | h *= m; |
olaf@20 | 271 | h ^= k; |
olaf@20 | 272 | |
olaf@20 | 273 | i += 4; |
olaf@20 | 274 | len -= 4; |
olaf@20 | 275 | } |
olaf@20 | 276 | |
olaf@20 | 277 | switch (len) { |
olaf@20 | 278 | case 3: h ^= (data[i + 2] & 0xFF) << 16; |
universe@38 | 279 | /* no break */ |
olaf@20 | 280 | case 2: h ^= (data[i + 1] & 0xFF) << 8; |
universe@38 | 281 | /* no break */ |
olaf@20 | 282 | case 1: h ^= (data[i + 0] & 0xFF); h *= m; |
universe@38 | 283 | /* no break */ |
olaf@20 | 284 | } |
olaf@20 | 285 | |
olaf@20 | 286 | h ^= h >> 13; |
olaf@20 | 287 | h *= m; |
olaf@20 | 288 | h ^= h >> 15; |
olaf@20 | 289 | |
olaf@20 | 290 | return h; |
olaf@20 | 291 | } |
olaf@31 | 292 | |
olaf@31 | 293 | UcxMapIterator ucx_map_iterator(UcxMap *map) { |
olaf@31 | 294 | UcxMapIterator i; |
olaf@31 | 295 | i.map = map; |
olaf@31 | 296 | i.cur = NULL; |
olaf@31 | 297 | i.index = 0; |
olaf@31 | 298 | return i; |
olaf@31 | 299 | } |
olaf@31 | 300 | |
olaf@111 | 301 | int ucx_map_iter_next(UcxMapIterator *i, UcxKey *key, void **elm) { |
olaf@31 | 302 | UcxMapElement *e = i->cur; |
olaf@31 | 303 | |
universe@138 | 304 | if (e) { |
universe@138 | 305 | e = e->next; |
universe@138 | 306 | } else { |
olaf@31 | 307 | e = i->map->map[0]; |
olaf@31 | 308 | } |
olaf@31 | 309 | |
universe@138 | 310 | while (i->index < i->map->size) { |
universe@138 | 311 | if (e) { |
universe@138 | 312 | if (e->data) { |
olaf@31 | 313 | i->cur = e; |
olaf@31 | 314 | *elm = e->data; |
olaf@111 | 315 | *key = e->key; |
universe@138 | 316 | return 1; |
olaf@31 | 317 | } |
olaf@31 | 318 | |
olaf@31 | 319 | e = e->next; |
olaf@31 | 320 | } else { |
olaf@31 | 321 | i->index++; |
olaf@31 | 322 | |
universe@138 | 323 | if (i->index < i->map->size) { |
olaf@31 | 324 | e = i->map->map[i->index]; |
olaf@31 | 325 | } |
olaf@31 | 326 | } |
olaf@31 | 327 | } |
olaf@31 | 328 | |
universe@138 | 329 | return 0; |
olaf@31 | 330 | } |
universe@42 | 331 |