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
|
/* ISC license. */
#include <stdint.h>
#include <string.h>
#include <errno.h>
#include <skalibs/uint64.h>
#include <skalibs/alloc.h>
#include <skalibs/tai.h>
#include <skalibs/gensetdyn.h>
#include <skalibs/avlnode.h>
#include <skalibs/avltree.h>
#include <s6-dns/dcache.h>
#define DNODE(z, i) GENSETDYN_P(dcache_node_t, &(z)->storage, i)
#define DCACHE_NODE_OVERHEAD (32 + sizeof(dcache_node_t) + 3 * sizeof(avlnode))
static void uniquify (avltree const *tree, tain_t *stamp)
{
static tain_t const nano = { .sec = TAI_ZERO, .nano = 1 } ;
uint32_t dummy ;
while (avltree_search(tree, stamp, &dummy))
tain_add(stamp, stamp, &nano) ;
}
static void dcache_delete (dcache_t *z, uint32_t i)
{
dcache_node_t *y = DNODE(z, i) ;
avltree_delete(&z->by_expire, &y->expire) ;
avltree_delete(&z->by_entry, &y->entry) ;
avltree_delete(&z->by_key, &y->key) ;
alloc_free(y->key.s) ;
z->size -= DCACHE_NODE_OVERHEAD + y->key.len + y->datalen ;
gensetdyn_delete(&z->storage, i) ;
}
static inline void dcache_gc_by_entry (dcache_t *z, uint64_t max)
{
while (z->size > max)
{
uint32_t oldest ;
if (!avltree_min(&z->by_entry, &oldest)) break ;
dcache_delete(z, oldest) ;
}
}
static inline void dcache_gc_by_expire (dcache_t *z, tain_t const *stamp)
{
for (;;)
{
uint32_t i ;
if (!avltree_min(&z->by_expire, &i)) break ;
if (tain_less(stamp, &DNODE(z, i)->expire)) break ;
dcache_delete(z, i) ;
}
}
static inline int dcache_add_node (dcache_t *z, dcache_node_t const *node)
{
uint32_t i ;
dcache_node_t *y ;
if (!gensetdyn_new(&z->storage, &i)) return 0 ;
y = DNODE(z, i) ; *y = *node ;
uniquify(&z->by_entry, &y->entry) ;
uniquify(&z->by_expire, &y->expire) ;
if (!avltree_insert(&z->by_key, i)) goto err1 ;
if (!avltree_insert(&z->by_entry, i)) goto err2 ;
if (!avltree_insert(&z->by_expire, i)) goto err3 ;
return 1 ;
err3:
avltree_delete(&z->by_entry, &y->entry) ;
err2:
avltree_delete(&z->by_key, &y->key) ;
err1:
gensetdyn_delete(&z->storage, i) ;
return 0 ;
}
static inline int dcache_add_unbounded (dcache_t *z, char const *key, uint16_t keylen, char const *data, uint16_t datalen, tain_t const *expire, tain_t const *stamp)
{
uint32_t len = keylen + datalen ;
dcache_node_t y = { .key = { .s = alloc(len) } } ;
if (!y.key.s) return 0 ;
memcpy(y.key.s, key, keylen) ;
memcpy(y.key.s + keylen, data, datalen) ;
y.key.len = keylen ;
y.datalen = datalen ;
y.entry = *stamp ;
y.expire = *expire ;
if (!dcache_add_node(z, &y))
{
alloc_free(y.key.s) ;
return 0 ;
}
z->size += DCACHE_NODE_OVERHEAD + len ;
z->motion += DCACHE_NODE_OVERHEAD + len ;
return 1 ;
}
int dcache_add (dcache_t *z, uint64_t max, char const *key, uint16_t keylen, char const *data, uint16_t datalen, tain_t const *expire, tain_t const *stamp)
{
uint64_t size = DCACHE_NODE_OVERHEAD + keylen + datalen ;
if (size > max) return (errno = EINVAL, 0) ;
if (z->size > max - size) dcache_gc_by_expire(z, stamp) ;
if (z->size > max - size) dcache_gc_by_entry(z, max - size) ;
return dcache_add_unbounded(z, key, keylen, data, datalen, expire, stamp) ;
}
|
