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 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329
|
// SPDX-License-Identifier: GPL-3.0-or-later
#include "../libnetdata.h"
// ----------------------------------------------------------------------------
// dictionary statistics
static inline void NETDATA_DICTIONARY_STATS_INSERTS_PLUS1(DICTIONARY *dict) {
if(likely(dict->stats))
dict->stats->inserts++;
}
static inline void NETDATA_DICTIONARY_STATS_DELETES_PLUS1(DICTIONARY *dict) {
if(likely(dict->stats))
dict->stats->deletes++;
}
static inline void NETDATA_DICTIONARY_STATS_SEARCHES_PLUS1(DICTIONARY *dict) {
if(likely(dict->stats))
dict->stats->searches++;
}
static inline void NETDATA_DICTIONARY_STATS_ENTRIES_PLUS1(DICTIONARY *dict) {
if(likely(dict->stats))
dict->stats->entries++;
}
static inline void NETDATA_DICTIONARY_STATS_ENTRIES_MINUS1(DICTIONARY *dict) {
if(likely(dict->stats))
dict->stats->entries--;
}
// ----------------------------------------------------------------------------
// dictionary locks
static inline void dictionary_read_lock(DICTIONARY *dict) {
if(likely(dict->rwlock)) {
// debug(D_DICTIONARY, "Dictionary READ lock");
netdata_rwlock_rdlock(dict->rwlock);
}
}
static inline void dictionary_write_lock(DICTIONARY *dict) {
if(likely(dict->rwlock)) {
// debug(D_DICTIONARY, "Dictionary WRITE lock");
netdata_rwlock_wrlock(dict->rwlock);
}
}
static inline void dictionary_unlock(DICTIONARY *dict) {
if(likely(dict->rwlock)) {
// debug(D_DICTIONARY, "Dictionary UNLOCK lock");
netdata_rwlock_unlock(dict->rwlock);
}
}
// ----------------------------------------------------------------------------
// avl index
static int name_value_compare(void* a, void* b) {
if(((NAME_VALUE *)a)->hash < ((NAME_VALUE *)b)->hash) return -1;
else if(((NAME_VALUE *)a)->hash > ((NAME_VALUE *)b)->hash) return 1;
else return strcmp(((NAME_VALUE *)a)->name, ((NAME_VALUE *)b)->name);
}
static inline NAME_VALUE *dictionary_name_value_index_find_nolock(DICTIONARY *dict, const char *name, uint32_t hash) {
NAME_VALUE tmp;
tmp.hash = (hash)?hash:simple_hash(name);
tmp.name = (char *)name;
NETDATA_DICTIONARY_STATS_SEARCHES_PLUS1(dict);
return (NAME_VALUE *)avl_search(&(dict->values_index), (avl *) &tmp);
}
// ----------------------------------------------------------------------------
// internal methods
static NAME_VALUE *dictionary_name_value_create_nolock(DICTIONARY *dict, const char *name, void *value, size_t value_len, uint32_t hash) {
debug(D_DICTIONARY, "Creating name value entry for name '%s'.", name);
NAME_VALUE *nv = callocz(1, sizeof(NAME_VALUE));
if(dict->flags & DICTIONARY_FLAG_NAME_LINK_DONT_CLONE)
nv->name = (char *)name;
else {
nv->name = strdupz(name);
}
nv->hash = (hash)?hash:simple_hash(nv->name);
if(dict->flags & DICTIONARY_FLAG_VALUE_LINK_DONT_CLONE)
nv->value = value;
else {
nv->value = mallocz(value_len);
memcpy(nv->value, value, value_len);
}
// index it
NETDATA_DICTIONARY_STATS_INSERTS_PLUS1(dict);
if(unlikely(avl_insert(&((dict)->values_index), (avl *)(nv)) != (avl *)nv))
error("dictionary: INTERNAL ERROR: duplicate insertion to dictionary.");
NETDATA_DICTIONARY_STATS_ENTRIES_PLUS1(dict);
return nv;
}
static void dictionary_name_value_destroy_nolock(DICTIONARY *dict, NAME_VALUE *nv) {
debug(D_DICTIONARY, "Destroying name value entry for name '%s'.", nv->name);
NETDATA_DICTIONARY_STATS_DELETES_PLUS1(dict);
if(unlikely(avl_remove(&(dict->values_index), (avl *)(nv)) != (avl *)nv))
error("dictionary: INTERNAL ERROR: dictionary invalid removal of node.");
NETDATA_DICTIONARY_STATS_ENTRIES_MINUS1(dict);
if(!(dict->flags & DICTIONARY_FLAG_VALUE_LINK_DONT_CLONE)) {
debug(D_REGISTRY, "Dictionary freeing value of '%s'", nv->name);
freez(nv->value);
}
if(!(dict->flags & DICTIONARY_FLAG_NAME_LINK_DONT_CLONE)) {
debug(D_REGISTRY, "Dictionary freeing name '%s'", nv->name);
freez(nv->name);
}
freez(nv);
}
// ----------------------------------------------------------------------------
// API - basic methods
DICTIONARY *dictionary_create(uint8_t flags) {
debug(D_DICTIONARY, "Creating dictionary.");
DICTIONARY *dict = callocz(1, sizeof(DICTIONARY));
if(flags & DICTIONARY_FLAG_WITH_STATISTICS)
dict->stats = callocz(1, sizeof(struct dictionary_stats));
if(!(flags & DICTIONARY_FLAG_SINGLE_THREADED)) {
dict->rwlock = callocz(1, sizeof(netdata_rwlock_t));
netdata_rwlock_init(dict->rwlock);
}
avl_init(&dict->values_index, name_value_compare);
dict->flags = flags;
return dict;
}
void dictionary_destroy(DICTIONARY *dict) {
debug(D_DICTIONARY, "Destroying dictionary.");
dictionary_write_lock(dict);
while(dict->values_index.root)
dictionary_name_value_destroy_nolock(dict, (NAME_VALUE *)dict->values_index.root);
dictionary_unlock(dict);
if(dict->stats)
freez(dict->stats);
if(dict->rwlock) {
netdata_rwlock_destroy(dict->rwlock);
freez(dict->rwlock);
}
freez(dict);
}
// ----------------------------------------------------------------------------
void *dictionary_set(DICTIONARY *dict, const char *name, void *value, size_t value_len) {
debug(D_DICTIONARY, "SET dictionary entry with name '%s'.", name);
uint32_t hash = simple_hash(name);
dictionary_write_lock(dict);
NAME_VALUE *nv = dictionary_name_value_index_find_nolock(dict, name, hash);
if(unlikely(!nv)) {
debug(D_DICTIONARY, "Dictionary entry with name '%s' not found. Creating a new one.", name);
nv = dictionary_name_value_create_nolock(dict, name, value, value_len, hash);
if(unlikely(!nv))
fatal("Cannot create name_value.");
}
else {
debug(D_DICTIONARY, "Dictionary entry with name '%s' found. Changing its value.", name);
if(dict->flags & DICTIONARY_FLAG_VALUE_LINK_DONT_CLONE) {
debug(D_REGISTRY, "Dictionary: linking value to '%s'", name);
nv->value = value;
}
else {
debug(D_REGISTRY, "Dictionary: cloning value to '%s'", name);
// copy the new value without breaking
// any other thread accessing the same entry
void *new = mallocz(value_len),
*old = nv->value;
memcpy(new, value, value_len);
nv->value = new;
debug(D_REGISTRY, "Dictionary: freeing old value of '%s'", name);
freez(old);
}
}
dictionary_unlock(dict);
return nv->value;
}
void *dictionary_get(DICTIONARY *dict, const char *name) {
debug(D_DICTIONARY, "GET dictionary entry with name '%s'.", name);
dictionary_read_lock(dict);
NAME_VALUE *nv = dictionary_name_value_index_find_nolock(dict, name, 0);
dictionary_unlock(dict);
if(unlikely(!nv)) {
debug(D_DICTIONARY, "Not found dictionary entry with name '%s'.", name);
return NULL;
}
debug(D_DICTIONARY, "Found dictionary entry with name '%s'.", name);
return nv->value;
}
int dictionary_del(DICTIONARY *dict, const char *name) {
int ret;
debug(D_DICTIONARY, "DEL dictionary entry with name '%s'.", name);
dictionary_write_lock(dict);
NAME_VALUE *nv = dictionary_name_value_index_find_nolock(dict, name, 0);
if(unlikely(!nv)) {
debug(D_DICTIONARY, "Not found dictionary entry with name '%s'.", name);
ret = -1;
}
else {
debug(D_DICTIONARY, "Found dictionary entry with name '%s'.", name);
dictionary_name_value_destroy_nolock(dict, nv);
ret = 0;
}
dictionary_unlock(dict);
return ret;
}
// ----------------------------------------------------------------------------
// API - walk through the dictionary
// the dictionary is locked for reading while this happens
// do not user other dictionary calls while walking the dictionary - deadlock!
static int dictionary_walker(avl *a, int (*callback)(void *entry, void *data), void *data) {
int total = 0, ret = 0;
if(a->avl_link[0]) {
ret = dictionary_walker(a->avl_link[0], callback, data);
if(ret < 0) return ret;
total += ret;
}
ret = callback(((NAME_VALUE *)a)->value, data);
if(ret < 0) return ret;
total += ret;
if(a->avl_link[1]) {
ret = dictionary_walker(a->avl_link[1], callback, data);
if (ret < 0) return ret;
total += ret;
}
return total;
}
int dictionary_get_all(DICTIONARY *dict, int (*callback)(void *entry, void *data), void *data) {
int ret = 0;
dictionary_read_lock(dict);
if(likely(dict->values_index.root))
ret = dictionary_walker(dict->values_index.root, callback, data);
dictionary_unlock(dict);
return ret;
}
static int dictionary_walker_name_value(avl *a, int (*callback)(char *name, void *entry, void *data), void *data) {
int total = 0, ret = 0;
if(a->avl_link[0]) {
ret = dictionary_walker_name_value(a->avl_link[0], callback, data);
if(ret < 0) return ret;
total += ret;
}
ret = callback(((NAME_VALUE *)a)->name, ((NAME_VALUE *)a)->value, data);
if(ret < 0) return ret;
total += ret;
if(a->avl_link[1]) {
ret = dictionary_walker_name_value(a->avl_link[1], callback, data);
if (ret < 0) return ret;
total += ret;
}
return total;
}
int dictionary_get_all_name_value(DICTIONARY *dict, int (*callback)(char *name, void *entry, void *data), void *data) {
int ret = 0;
dictionary_read_lock(dict);
if(likely(dict->values_index.root))
ret = dictionary_walker_name_value(dict->values_index.root, callback, data);
dictionary_unlock(dict);
return ret;
}
|