hashmap.c

   1 #include <stdio.h>
   2 #include <stdlib.h>
   3
   4 #include "hashmap.h"
   5
   6 struct hashlevel;
   7
   8 typedef struct hashlevel {
   9   ast_var *data;
  10   struct hashlevel *sublevels;
  11 } hashlevel;
  12
  13 static hashlevel *root;
  14
  15 void hashmap_initialize()
  16 {
  17   ast_var *temp;
  18
  19   root = calloc(1, sizeof (hashlevel));
  20   temp = find_var("one");
  21   temp->type = KNIGHT_REF;
  22   temp->val.knight_ref = 1;
  23
  24   temp = find_var("two");
  25   temp->type = KNIGHT_REF;
  26   temp->val.knight_ref = 2;
  27
  28   temp = find_var("three");
  29   temp->type = KNIGHT_REF;
  30   temp->val.knight_ref = 3;
  31
  32   temp = find_var("four");
  33   temp->type = KNIGHT_REF;
  34   temp->val.knight_ref = 4;
  35
  36   temp = find_var("five");
  37   temp->type = KNIGHT_REF;
  38   temp->val.knight_ref = 5;
  39
  40   temp = find_var("six");
  41   temp->type = KNIGHT_REF;
  42   temp->val.knight_ref = 6;
  43
  44   temp = find_var("seven");
  45   temp->type = KNIGHT_REF;
  46   temp->val.knight_ref = 7;
  47
  48   temp = find_var("eight");
  49   temp->type = KNIGHT_REF;
  50   temp->val.knight_ref = 8;
  51
  52   temp = find_var("nine");
  53   temp->type = KNIGHT_REF;
  54   temp->val.knight_ref = 9;
  55
  56 }
  57
  58 static int index(const char c)
  59 {
  60   int i = c;
  61
  62   if (c >= '0')
  63     i -= '0';
  64   if (c > 'a')
  65     i -= ('a' - '0');
  66   return i;
  67 }
  68
  69 ast_var *find_var(const char *key)
  70 {
  71   const char *c_key = key;
  72   hashlevel *c_hash = root;
  73   int c_idx;
  74
  75   if (!key)
  76     return NULL;
  77
  78   while (*c_key != '\0') {
  79     c_idx = index(*c_key);
  80     if (!c_hash->sublevels)
  81       c_hash->sublevels = calloc(37, sizeof (hashlevel));
  82     c_hash = &(c_hash->sublevels[c_idx]);
  83     c_key++;
  84   }
  85
  86   if (!c_hash->data)
  87     c_hash->data = calloc(1, sizeof (ast_var));
  88
  89   return c_hash->data;
  90 }