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
|
#include <string.h>
#include <import/eb32tree.h>
#include <import/ebistree.h>
#include <haproxy/dict.h>
#include <haproxy/thread.h>
struct dict *new_dict(const char *name)
{
struct dict *dict;
dict = malloc(sizeof *dict);
if (!dict)
return NULL;
dict->name = name;
dict->values = EB_ROOT_UNIQUE;
HA_RWLOCK_INIT(&dict->rwlock);
return dict;
}
/*
* Allocate a new dictionary entry with <s> as string value which is strdup()'ed.
* Returns the new allocated entry if succeeded, NULL if not.
*/
static struct dict_entry *new_dict_entry(char *s)
{
struct dict_entry *de;
de = calloc(1, sizeof *de);
if (!de)
return NULL;
de->value.key = strdup(s);
if (!de->value.key)
goto err;
de->len = strlen(s);
de->refcount = 1;
return de;
err:
ha_free(&de->value.key);
de->len = 0;
free(de);
return NULL;
}
/*
* Release the memory allocated for <de> dictionary entry.
*/
static void free_dict_entry(struct dict_entry *de)
{
de->refcount = 0;
ha_free(&de->value.key);
free(de);
}
/*
* Simple function to lookup dictionary entries with <s> as value.
*/
static struct dict_entry *__dict_lookup(struct dict *d, const char *s)
{
struct dict_entry *de;
struct ebpt_node *node;
de = NULL;
node = ebis_lookup(&d->values, s);
if (node)
de = container_of(node, struct dict_entry, value);
return de;
}
/*
* Insert an entry in <d> dictionary with <s> as value. *
*/
struct dict_entry *dict_insert(struct dict *d, char *s)
{
struct dict_entry *de;
struct ebpt_node *n;
HA_RWLOCK_RDLOCK(DICT_LOCK, &d->rwlock);
de = __dict_lookup(d, s);
HA_RWLOCK_RDUNLOCK(DICT_LOCK, &d->rwlock);
if (de) {
HA_ATOMIC_INC(&de->refcount);
return de;
}
de = new_dict_entry(s);
if (!de)
return NULL;
HA_RWLOCK_WRLOCK(DICT_LOCK, &d->rwlock);
n = ebis_insert(&d->values, &de->value);
HA_RWLOCK_WRUNLOCK(DICT_LOCK, &d->rwlock);
if (n != &de->value) {
free_dict_entry(de);
de = container_of(n, struct dict_entry, value);
}
return de;
}
/*
* Unreference a dict entry previously acquired with <dict_insert>.
* If this is the last live reference to the entry, it is
* removed from the dictionary.
*/
void dict_entry_unref(struct dict *d, struct dict_entry *de)
{
if (!de)
return;
if (HA_ATOMIC_SUB_FETCH(&de->refcount, 1) != 0)
return;
HA_RWLOCK_WRLOCK(DICT_LOCK, &d->rwlock);
ebpt_delete(&de->value);
HA_RWLOCK_WRUNLOCK(DICT_LOCK, &d->rwlock);
free_dict_entry(de);
}
|
