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
|
/* ISC license. */
#include <stdint.h>
#include <string.h>
#include <skalibs/genalloc.h>
#include <skalibs/avltree.h>
#include "shibari-cache-config-internal.h"
void *node_dtok (uint32_t d, void *data)
{
repo *r = data ;
return r->storage->s + genalloc_s(node, &r->ga)[d].key ;
}
int node_cmp (void const *a, void const *b, void *data)
{
(void)data ;
return strcmp((char const *)a, (char const *)b) ;
}
node const *repo_search (repo const *r, char const *key)
{
uint32_t i ;
return avltree_search(&r->tree, key, &i) ? genalloc_s(node const, &r->ga) + i : 0 ;
}
void repo_add (repo *r, node const *nod)
{
uint32_t i = genalloc_len(node, &r->ga) ;
if (!genalloc_append(node, &r->ga, nod)) dienomem() ;
if (!avltree_insert(&r->tree, i)) dienomem() ;
}
void repo_update (repo *r, node const *nod)
{
uint32_t i ;
if (avltree_search(&r->tree, r->storage->s + nod->key, &i))
{
if (!avltree_delete(&r->tree, r->storage->s + nod->key)) dienomem() ;
genalloc_s(node, &r->ga)[i] = *nod ;
if (!avltree_insert(&r->tree, i)) dienomem() ;
}
else repo_add(r, nod) ;
}
|
