ucx/map.c

Thu, 05 Jan 2012 14:53:54 +0100

author
Olaf Wintermann <olaf.wintermann@gmail.com>
date
Thu, 05 Jan 2012 14:53:54 +0100
changeset 20
db7d9860dbbd
parent 2
79646375a420
child 29
bce0d7f2912b
permissions
-rw-r--r--

added some map functions

olaf@20 1 /*
olaf@20 2 *
olaf@20 3 */
olaf@2 4
olaf@20 5 #include <stdlib.h>
olaf@20 6 #include <string.h>
olaf@20 7
olaf@20 8 #include "map.h"
olaf@20 9
olaf@20 10 UcxMap *ucx_map_new(size_t size) {
olaf@20 11 UcxMap *map = (UcxMap*)malloc(sizeof(UcxMap));
olaf@20 12 if(map == NULL) {
olaf@20 13 return NULL;
olaf@20 14 }
olaf@20 15
olaf@20 16 map->map = (UcxMapElement*)calloc(size, sizeof(UcxMapElement));
olaf@20 17 if(map->map == NULL) {
olaf@20 18 free(map);
olaf@20 19 return NULL;
olaf@20 20 }
olaf@20 21 map->size = size;
olaf@20 22
olaf@20 23 return map;
olaf@20 24 }
olaf@20 25
olaf@20 26 int ucx_map_put(UcxMap *map, UcxKey key, void *data) {
olaf@20 27 if(key.hash == 0) {
olaf@20 28 key.hash = ucx_hash((char*)key.data, key.len);
olaf@20 29 }
olaf@20 30 void *kd = malloc(key.len);
olaf@20 31 memcpy(kd, key.data, key.len);
olaf@20 32 key.data = kd;
olaf@20 33
olaf@20 34 UcxMapElement *elm = &map->map[key.hash%map->size];
olaf@20 35 if(elm->next != NULL) {
olaf@20 36 while(elm->next != NULL) {
olaf@20 37 elm = elm->next;
olaf@20 38 }
olaf@20 39 UcxMapElement *e = (UcxMapElement*)malloc(sizeof(UcxMapElement));
olaf@20 40 if(e == NULL) {
olaf@20 41 return -1;
olaf@20 42 }
olaf@20 43 elm->next = e;
olaf@20 44 elm = e;
olaf@20 45 }
olaf@20 46
olaf@20 47 elm->key = key;
olaf@20 48 elm->data = data;
olaf@20 49
olaf@20 50 return 0;
olaf@20 51 }
olaf@20 52
olaf@20 53 void* ucx_map_get(UcxMap *map, UcxKey key) {
olaf@20 54 if(key.hash == 0) {
olaf@20 55 key.hash = ucx_hash((char*)key.data, key.len);
olaf@20 56 }
olaf@20 57
olaf@20 58 UcxMapElement *elm = &map->map[key.hash%map->size];
olaf@20 59 while(elm != NULL) {
olaf@20 60 if(elm->key.hash == key.hash) {
olaf@20 61 int n = (key.len > elm->key.len) ? elm->key.len : key.len;
olaf@20 62 if(memcmp(elm->key.data, key.data, n) == 0) {
olaf@20 63 return elm->data;
olaf@20 64 }
olaf@20 65 }
olaf@20 66 elm = elm->next;
olaf@20 67 }
olaf@20 68
olaf@20 69 return NULL;
olaf@20 70 }
olaf@20 71
olaf@20 72 UcxKey ucx_key(void *data, size_t len) {
olaf@20 73 UcxKey key;
olaf@20 74 key.data = data;
olaf@20 75 key.len = len;
olaf@20 76 key.hash = ucx_hash(data, len);
olaf@20 77 return key;
olaf@20 78 }
olaf@20 79
olaf@20 80
olaf@20 81 int ucx_hash(char *data, size_t len) {
olaf@20 82 /* murmur hash 2 */
olaf@20 83
olaf@20 84 int m = 0x5bd1e995;
olaf@20 85 int r = 24;
olaf@20 86
olaf@20 87 int h = 25 ^ len;
olaf@20 88
olaf@20 89 int i = 0;
olaf@20 90 while (len >= 4) {
olaf@20 91 int k = data[i + 0] & 0xFF;
olaf@20 92 k |= (data[i + 1] & 0xFF) << 8;
olaf@20 93 k |= (data[i + 2] & 0xFF) << 16;
olaf@20 94 k |= (data[i + 3] & 0xFF) << 24;
olaf@20 95
olaf@20 96 k *= m;
olaf@20 97 k ^= k >> r;
olaf@20 98 k *= m;
olaf@20 99
olaf@20 100 h *= m;
olaf@20 101 h ^= k;
olaf@20 102
olaf@20 103 i += 4;
olaf@20 104 len -= 4;
olaf@20 105 }
olaf@20 106
olaf@20 107 switch (len) {
olaf@20 108 case 3: h ^= (data[i + 2] & 0xFF) << 16;
olaf@20 109 case 2: h ^= (data[i + 1] & 0xFF) << 8;
olaf@20 110 case 1: h ^= (data[i + 0] & 0xFF); h *= m;
olaf@20 111 }
olaf@20 112
olaf@20 113 h ^= h >> 13;
olaf@20 114 h *= m;
olaf@20 115 h ^= h >> 15;
olaf@20 116
olaf@20 117 return h;
olaf@20 118 }

mercurial