aboutsummaryrefslogtreecommitdiff
path: root/table_static.c
blob: d14b04eed473e9ae7b3a22dfdca6431d1ed5174c (plain)
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
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
/*
 * Copyright (c) 2021 Omar Polo <op@omarpolo.com>
 *
 * Permission to use, copy, modify, and distribute this software for any
 * purpose with or without fee is hereby granted, provided that the above
 * copyright notice and this permission notice appear in all copies.
 *
 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 */

#include "compat.h"

#include <stdlib.h>
#include <string.h>

#include "kamid.h"
#include "utils.h"

static void	*hash_alloc(size_t, void *);
static void	*hash_calloc(size_t, size_t, void *);
static void	 hash_free(void *, void *);

static int	 table_static_open(struct table *);
static int	 table_static_add(struct table *, const char *, const char *);
static int	 table_static_lookup(struct table *, const char *, char **);
static void	 table_static_close(struct table *);

struct table_backend table_static = {
	"static",
	table_static_open,
	table_static_add,
	table_static_lookup,
	table_static_close,
};

struct kp {
	char	*key;
	char	*val;
};

static void *
hash_alloc(size_t len, void *d)
{
	return xmalloc(len);
}

static void *
hash_calloc(size_t nmemb, size_t size, void *d)
{
	return xcalloc(nmemb, size);
}

static void
hash_free(void *ptr, void *d)
{
	free(ptr);
}

static int
table_static_open(struct table *t)
{
	struct ohash_info info = {
		.key_offset = offsetof(struct kp, key),
		.calloc = hash_calloc,
		.free = hash_free,
		.alloc = hash_alloc,
	};

	t->t_handle = xmalloc(sizeof(struct ohash));
	ohash_init(t->t_handle, 5, &info);
	return 0;
}

int
table_static_add(struct table *t, const char *key, const char *val)
{
	struct kp	*kp;
	unsigned int	 slot;

	kp = xcalloc(1, sizeof(*kp));
	kp->key = xstrdup(key);
	if (val != NULL)
		kp->val = xstrdup(val);

	slot = ohash_qlookup(t->t_handle, kp->key);
	ohash_insert(t->t_handle, slot, kp);

	return 0;
}

int
table_static_lookup(struct table *t, const char *key, char **ret_val)
{
	struct kp	*kp;
	unsigned int	 slot;

#if 0
	slot = ohash_qlookup(t->t_handle, key);
	if ((kp = ohash_find(t->t_handle, slot)) == NULL)
		return -1;

	*ret_val = xstrdup(kp->val);
	return 0;
#endif

	for (kp = ohash_first(t->t_handle, &slot);
	     kp != NULL;
	     kp = ohash_next(t->t_handle, &slot)) {
		if (!strcmp(kp->key, key)) {
			*ret_val = xstrdup(kp->val);
			return 0;
		}
	}
	return -1;
}

static void
table_static_close(struct table *t)
{
	struct kp	*kp;
	unsigned int	 i;

	for (kp = ohash_first(t->t_handle, &i);
	     kp != NULL;
	     kp = ohash_next(t->t_handle, &i)) {
		ohash_remove(t->t_handle, i);
		free(kp->key);
		free(kp->val);
		free(kp);
	}

	free(t->t_handle);
}