97 lines
2.3 KiB
C
97 lines
2.3 KiB
C
|
/*
|
||
|
|
* kvlist - simple key/value store
|
||
|
|
*
|
||
|
|
* Copyright (C) 2014 Felix Fietkau <nbd@openwrt.org>
|
||
|
|
*
|
||
|
|
* Permission to use, copy, modify, and/or 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 <stdlib.h>
|
||
|
|
#include <string.h>
|
||
|
|
|
||
|
|
#include "utils.h"
|
||
|
|
#include "avl-cmp.h"
|
||
|
|
#include "blob.h"
|
||
|
|
|
||
|
|
#include "kvlist.h"
|
||
|
|
|
||
|
|
int kvlist_strlen(struct kvlist *kv, void *data)
|
||
|
|
{
|
||
|
|
return strlen(data) + 1;
|
||
|
|
}
|
||
|
|
|
||
|
|
int kvlist_blob_len(struct kvlist *kv, void *data)
|
||
|
|
{
|
||
|
|
return blob_pad_len(data);
|
||
|
|
}
|
||
|
|
|
||
|
|
void kvlist_init(struct kvlist *kv, int (*get_len)(struct kvlist *kv, void *data))
|
||
|
|
{
|
||
|
|
avl_init(&kv->avl, avl_strcmp, false, NULL);
|
||
|
|
kv->get_len = get_len;
|
||
|
|
}
|
||
|
|
|
||
|
|
static struct kvlist_node *__kvlist_get(struct kvlist *kv, const char *name)
|
||
|
|
{
|
||
|
|
struct kvlist_node *node;
|
||
|
|
|
||
|
|
return avl_find_element(&kv->avl, name, node, avl);
|
||
|
|
}
|
||
|
|
|
||
|
|
void *kvlist_get(struct kvlist *kv, const char *name)
|
||
|
|
{
|
||
|
|
struct kvlist_node *node;
|
||
|
|
|
||
|
|
node = __kvlist_get(kv, name);
|
||
|
|
if (!node)
|
||
|
|
return NULL;
|
||
|
|
|
||
|
|
return node->data;
|
||
|
|
}
|
||
|
|
|
||
|
|
bool kvlist_delete(struct kvlist *kv, const char *name)
|
||
|
|
{
|
||
|
|
struct kvlist_node *node;
|
||
|
|
|
||
|
|
node = __kvlist_get(kv, name);
|
||
|
|
if (node) {
|
||
|
|
avl_delete(&kv->avl, &node->avl);
|
||
|
|
free(node);
|
||
|
|
}
|
||
|
|
|
||
|
|
return !!node;
|
||
|
|
}
|
||
|
|
|
||
|
|
void kvlist_set(struct kvlist *kv, const char *name, void *data)
|
||
|
|
{
|
||
|
|
struct kvlist_node *node;
|
||
|
|
char *name_buf;
|
||
|
|
int len = kv->get_len(kv, data);
|
||
|
|
|
||
|
|
kvlist_delete(kv, name);
|
||
|
|
|
||
|
|
node = calloc_a(sizeof(struct kvlist_node) + len,
|
||
|
|
&name_buf, strlen(name) + 1);
|
||
|
|
memcpy(node->data, data, len);
|
||
|
|
|
||
|
|
node->avl.key = strcpy(name_buf, name);
|
||
|
|
avl_insert(&kv->avl, &node->avl);
|
||
|
|
}
|
||
|
|
|
||
|
|
void kvlist_free(struct kvlist *kv)
|
||
|
|
{
|
||
|
|
struct kvlist_node *node, *tmp;
|
||
|
|
|
||
|
|
avl_remove_all_elements(&kv->avl, node, avl, tmp)
|
||
|
|
free(node);
|
||
|
|
}
|