Andrew's git - gitweb.git/blob - t/helper/test-hashmap.c

   1#include "git-compat-util.h"
   2#include "hashmap.h"
   3
   4struct test_entry
   5{
   6        struct hashmap_entry ent;
   7        /* key and value as two \0-terminated strings */
   8        char key[FLEX_ARRAY];
   9};
  10
  11static const char *get_value(const struct test_entry *e)
  12{
  13        return e->key + strlen(e->key) + 1;
  14}
  15
  16static int test_entry_cmp(const void *cmp_data,
  17                          const void *entry,
  18                          const void *entry_or_key,
  19                          const void *keydata)
  20{
  21        const int ignore_case = cmp_data ? *((int *)cmp_data) : 0;
  22        const struct test_entry *e1 = entry;
  23        const struct test_entry *e2 = entry_or_key;
  24        const char *key = keydata;
  25
  26        if (ignore_case)
  27                return strcasecmp(e1->key, key ? key : e2->key);
  28        else
  29                return strcmp(e1->key, key ? key : e2->key);
  30}
  31
  32static struct test_entry *alloc_test_entry(int hash, char *key, int klen,
  33                char *value, int vlen)
  34{
  35        struct test_entry *entry = xmalloc(st_add4(sizeof(*entry), klen, vlen, 2));
  36        hashmap_entry_init(entry, hash);
  37        memcpy(entry->key, key, klen + 1);
  38        memcpy(entry->key + klen + 1, value, vlen + 1);
  39        return entry;
  40}
  41
  42#define HASH_METHOD_FNV 0
  43#define HASH_METHOD_I 1
  44#define HASH_METHOD_IDIV10 2
  45#define HASH_METHOD_0 3
  46#define HASH_METHOD_X2 4
  47#define TEST_SPARSE 8
  48#define TEST_ADD 16
  49#define TEST_SIZE 100000
  50
  51static unsigned int hash(unsigned int method, unsigned int i, const char *key)
  52{
  53        unsigned int hash = 0;
  54        switch (method & 3)
  55        {
  56        case HASH_METHOD_FNV:
  57                hash = strhash(key);
  58                break;
  59        case HASH_METHOD_I:
  60                hash = i;
  61                break;
  62        case HASH_METHOD_IDIV10:
  63                hash = i / 10;
  64                break;
  65        case HASH_METHOD_0:
  66                hash = 0;
  67                break;
  68        }
  69
  70        if (method & HASH_METHOD_X2)
  71                hash = 2 * hash;
  72        return hash;
  73}
  74
  75/*
  76 * Test performance of hashmap.[ch]
  77 * Usage: time echo "perfhashmap method rounds" | test-hashmap
  78 */
  79static void perf_hashmap(unsigned int method, unsigned int rounds)
  80{
  81        struct hashmap map;
  82        char buf[16];
  83        struct test_entry **entries;
  84        unsigned int *hashes;
  85        unsigned int i, j;
  86
  87        ALLOC_ARRAY(entries, TEST_SIZE);
  88        ALLOC_ARRAY(hashes, TEST_SIZE);
  89        for (i = 0; i < TEST_SIZE; i++) {
  90                snprintf(buf, sizeof(buf), "%i", i);
  91                entries[i] = alloc_test_entry(0, buf, strlen(buf), "", 0);
  92                hashes[i] = hash(method, i, entries[i]->key);
  93        }
  94
  95        if (method & TEST_ADD) {
  96                /* test adding to the map */
  97                for (j = 0; j < rounds; j++) {
  98                        hashmap_init(&map, test_entry_cmp, NULL, 0);
  99
 100                        /* add entries */
 101                        for (i = 0; i < TEST_SIZE; i++) {
 102                                hashmap_entry_init(entries[i], hashes[i]);
 103                                hashmap_add(&map, entries[i]);
 104                        }
 105
 106                        hashmap_free(&map, 0);
 107                }
 108        } else {
 109                /* test map lookups */
 110                hashmap_init(&map, test_entry_cmp, NULL, 0);
 111
 112                /* fill the map (sparsely if specified) */
 113                j = (method & TEST_SPARSE) ? TEST_SIZE / 10 : TEST_SIZE;
 114                for (i = 0; i < j; i++) {
 115                        hashmap_entry_init(entries[i], hashes[i]);
 116                        hashmap_add(&map, entries[i]);
 117                }
 118
 119                for (j = 0; j < rounds; j++) {
 120                        for (i = 0; i < TEST_SIZE; i++) {
 121                                hashmap_get_from_hash(&map, hashes[i],
 122                                                      entries[i]->key);
 123                        }
 124                }
 125
 126                hashmap_free(&map, 0);
 127        }
 128}
 129
 130#define DELIM " \t\r\n"
 131
 132/*
 133 * Read stdin line by line and print result of commands to stdout:
 134 *
 135 * hash key -> strhash(key) memhash(key) strihash(key) memihash(key)
 136 * put key value -> NULL / old value
 137 * get key -> NULL / value
 138 * remove key -> NULL / old value
 139 * iterate -> key1 value1\nkey2 value2\n...
 140 * size -> tablesize numentries
 141 *
 142 * perfhashmap method rounds -> test hashmap.[ch] performance
 143 */
 144int cmd_main(int argc, const char **argv)
 145{
 146        char line[1024];
 147        struct hashmap map;
 148        int icase;
 149
 150        /* init hash map */
 151        icase = argc > 1 && !strcmp("ignorecase", argv[1]);
 152        hashmap_init(&map, test_entry_cmp, &icase, 0);
 153
 154        /* process commands from stdin */
 155        while (fgets(line, sizeof(line), stdin)) {
 156                char *cmd, *p1 = NULL, *p2 = NULL;
 157                int l1 = 0, l2 = 0, hash = 0;
 158                struct test_entry *entry;
 159
 160                /* break line into command and up to two parameters */
 161                cmd = strtok(line, DELIM);
 162                /* ignore empty lines */
 163                if (!cmd || *cmd == '#')
 164                        continue;
 165
 166                p1 = strtok(NULL, DELIM);
 167                if (p1) {
 168                        l1 = strlen(p1);
 169                        hash = icase ? strihash(p1) : strhash(p1);
 170                        p2 = strtok(NULL, DELIM);
 171                        if (p2)
 172                                l2 = strlen(p2);
 173                }
 174
 175                if (!strcmp("hash", cmd) && l1) {
 176
 177                        /* print results of different hash functions */
 178                        printf("%u %u %u %u\n", strhash(p1), memhash(p1, l1),
 179                                        strihash(p1), memihash(p1, l1));
 180
 181                } else if (!strcmp("add", cmd) && l1 && l2) {
 182
 183                        /* create entry with key = p1, value = p2 */
 184                        entry = alloc_test_entry(hash, p1, l1, p2, l2);
 185
 186                        /* add to hashmap */
 187                        hashmap_add(&map, entry);
 188
 189                } else if (!strcmp("put", cmd) && l1 && l2) {
 190
 191                        /* create entry with key = p1, value = p2 */
 192                        entry = alloc_test_entry(hash, p1, l1, p2, l2);
 193
 194                        /* add / replace entry */
 195                        entry = hashmap_put(&map, entry);
 196
 197                        /* print and free replaced entry, if any */
 198                        puts(entry ? get_value(entry) : "NULL");
 199                        free(entry);
 200
 201                } else if (!strcmp("get", cmd) && l1) {
 202
 203                        /* lookup entry in hashmap */
 204                        entry = hashmap_get_from_hash(&map, hash, p1);
 205
 206                        /* print result */
 207                        if (!entry)
 208                                puts("NULL");
 209                        while (entry) {
 210                                puts(get_value(entry));
 211                                entry = hashmap_get_next(&map, entry);
 212                        }
 213
 214                } else if (!strcmp("remove", cmd) && l1) {
 215
 216                        /* setup static key */
 217                        struct hashmap_entry key;
 218                        hashmap_entry_init(&key, hash);
 219
 220                        /* remove entry from hashmap */
 221                        entry = hashmap_remove(&map, &key, p1);
 222
 223                        /* print result and free entry*/
 224                        puts(entry ? get_value(entry) : "NULL");
 225                        free(entry);
 226
 227                } else if (!strcmp("iterate", cmd)) {
 228
 229                        struct hashmap_iter iter;
 230                        hashmap_iter_init(&map, &iter);
 231                        while ((entry = hashmap_iter_next(&iter)))
 232                                printf("%s %s\n", entry->key, get_value(entry));
 233
 234                } else if (!strcmp("size", cmd)) {
 235
 236                        /* print table sizes */
 237                        printf("%u %u\n", map.tablesize,
 238                               hashmap_get_size(&map));
 239
 240                } else if (!strcmp("intern", cmd) && l1) {
 241
 242                        /* test that strintern works */
 243                        const char *i1 = strintern(p1);
 244                        const char *i2 = strintern(p1);
 245                        if (strcmp(i1, p1))
 246                                printf("strintern(%s) returns %s\n", p1, i1);
 247                        else if (i1 == p1)
 248                                printf("strintern(%s) returns input pointer\n", p1);
 249                        else if (i1 != i2)
 250                                printf("strintern(%s) != strintern(%s)", i1, i2);
 251                        else
 252                                printf("%s\n", i1);
 253
 254                } else if (!strcmp("perfhashmap", cmd) && l1 && l2) {
 255
 256                        perf_hashmap(atoi(p1), atoi(p2));
 257
 258                } else {
 259
 260                        printf("Unknown command %s\n", cmd);
 261
 262                }
 263        }
 264
 265        hashmap_free(&map, 1);
 266        return 0;
 267}