1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include "mdb.h"
static const struct keytablist empty;
static int hash(char *key);
int *getkeys(struct keytablist *list, int id)
{
int len = 2;
int *indexes = calloc(len, sizeof(int));
for (int i = 0, j = 0; i < TABLEN; ++i) {
if (j >= len) {
indexes = realloc(indexes, ++len * sizeof(int));
indexes[len - 1] = 0;
}
if (list[id].tab[i].key)
indexes[j++] = i;
}
return indexes;
}
struct keytab getkey(struct keytablist *list, int id, char *key)
{
int idx = hash(key);
if (list[id].tab[idx].key == NULL)
return (struct keytab) { .key = NULL, .flag = 0, .v = 0 };
while (strcmp(list[id].tab[idx].key, key) && idx < TABLEN)
idx++;
if (idx >= TABLEN)
return (struct keytab) { .key = NULL, .flag = 0, .v = 0 };
return list[id].tab[idx];
}
int setkey(struct keytablist **list, int *len, int id, char *pair)
{
if (id >= *len) {
*list = realloc(*list, (id + 1) * sizeof(struct keytablist));
for (int i = *len; i <= id; ++i)
(*list)[i] = empty;
*len = id + 1;
(*list)[0].len = *len;
}
char *tok = strtok(pair, ":");
char *key = calloc(strlen(tok) + 1, sizeof(char));
strcpy(key, tok);
tok = strtok(NULL, ":");
if (tok == NULL) {
fprintf(stderr, "Invalid key-value pair\n");
return 1;
}
union value v;
int flag;
if (isdigit(*tok)) {
flag = 1;
v.num = atof(tok);
} else if (!strcmp(tok, "true") || !strcmp(tok, "false")) {
flag = 2;
v.b = !strcmp(tok, "true");
} else {
flag = 3;
v.str = calloc(strlen(tok) + 1, sizeof(char));
strcpy(v.str, tok);
}
int idx = hash(key);
while ((*list)[id].tab[idx].key != NULL &&
strcmp((*list)[id].tab[idx].key, key) &&
idx < TABLEN) idx++;
if (idx >= TABLEN) {
fprintf(stderr, "No more room in table\n");
return 2;
}
if (!(*list)[id].tab[idx].key)
(*list)[id].tab[idx].key = key;
else
free(key);
(*list)[id].tab[idx].v = v;
(*list)[id].tab[idx].flag = flag;
return 0;
}
void delkey(struct keytablist *list, int id, char *key)
{
int idx = hash(key);
while (strcmp(list[id].tab[idx].key, key) && idx < TABLEN)
idx++;
if (idx >= TABLEN) {
fprintf(stderr, "Invalid key: %s\n", key);
return;
}
free(list[id].tab[idx].key);
list[id].tab[idx].key = NULL;
if (list[id].tab[idx].flag == 3) {
free(list[id].tab[idx].v.str);
list[id].tab[idx].v.str = NULL;
}
list[id].tab[idx].flag = 0;
}
static int hash(char *key)
{
unsigned long h = 5381;
for (int i = 0; i < strlen(key); ++i)
h = ((h << 5) + h) + key[i];
return h % TABLEN;
}
|
