-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfsdatastorage.c
More file actions
187 lines (175 loc) · 5.52 KB
/
fsdatastorage.c
File metadata and controls
187 lines (175 loc) · 5.52 KB
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
#include "fsdatastorage.h"
#define FS_STOREDDATA_DEBUG
#include <cmem.h>
#include <cstr.h>
#ifdef FS_STOREDDATA_DEBUG
#include <stdio.h>
#define PrHID8 cPrefixUint64 "X"
#endif
static int _FSDataItem_compare_with_key (const FSDataItem * node, const uint64_t * pkey)
{
return (int)(node->key - *pkey);
}
static int _FSDataItem_compare_with_node (const FSDataItem * node, const FSDataItem * value)
{
return (int)(node->key - value->key);
}
static void _FSDataItem_purge(FSDataStorage * storage, uint32_t curTime)
{
cring_t * r = storage->q.prev;
while(r != &storage->q){
FSDataItem * d = cring_cast(FSDataItem, q, r);
if(d->end >= curTime)
break;
#ifdef FS_STOREDDATA_DEBUG
fprintf(stderr, "%-5.5s [%u] EXP " PrHID8 "(%u):", storage->name, curTime, d->key, d->end);
for(int i=0; i < 8; i++) fprintf(stderr, "%02X", d->data[i]);
fputc('\n', stderr);
#endif
ctree_splay_del_node(&storage->tree, &d->node);
r = cring_erase_left(r);
storage->free(d, storage->user);
}
}
static void _do_nothing(void*n) {}
FSDS_EXPORT
FSDataStorage * FSDataStorage_Init (FSDataStorage * ds, const char * name, void * const destructor, void * const user)
{
if(ds == NULL) {
size_t l = cstrlen(name);
if (NULL == (ds = cnew_ex(FSDataStorage, l + 1))) {
return NULL;
}
ds->name = (const char*)(ds + 1);
cstrcpy((char*)ds->name, name);
}else{
ds->name = name;
}
ds->free = destructor ? destructor : _do_nothing;
ds->user = user;
ds->tree = NULL;
cring_init(&ds->q);
return ds;
}
FSDS_EXPORT
void FSDataStorage_Clean(FSDataStorage * ds)
{
ds->tree = NULL;
cring_t * r = ds->q.next;
while(r != &ds->q){
r = r->next;
ds->free(cring_cast(FSDataItem, q, r->prev), ds->user);
}
cring_init(&ds->q);
if(ds->name == (const char*)(ds+1)){
free(ds);
}
}
FSDS_EXPORT
FSDataItem * FSDataItem_New(size_t len)
{
FSDataItem * d = cnew0_ex(FSDataItem, len);
if(d){
d->len = len;
cring_init(&d->q);
}
return d;
}
FSDS_EXPORT
void FSDataItem_Renew(FSDataStorage * storage, uint32_t curTime, FSDataItem * d, uint32_t duration)
{
#ifdef FS_STOREDDATA_DEBUG
fprintf(stderr, "%-5.5s [%u] UPD " PrHID8 " (end=%u data=", storage->name, curTime, d->key, d->end);
for(int i=0; i < 8; i++) fprintf(stderr, "%02X", d->data[i]);
fprintf(stderr,")\n");
#endif
cring_erase(&d->q);
if(curTime){
_FSDataItem_purge(storage, curTime);
}else{
duration = 0xFFFFFFFF;
}
d->end = curTime + duration;
cring_enqueue(&storage->q, &d->q);
}
FSDS_EXPORT
void FSDataItem_Put (FSDataStorage * storage, uint32_t curTime, FSDataItem * d, uint32_t duration)
{
if(curTime){
_FSDataItem_purge(storage, curTime);
}else{
duration = 0xFFFFFFFF;
}
d->end = curTime + duration;
#ifdef FS_STOREDDATA_DEBUG
fprintf(stderr, "%-5.5s [%u] PUT " PrHID8 " (end=%u data=", storage->name, curTime, d->key, d->end);
for(int i=0; i < 8; i++) fprintf(stderr, "%02X", d->data[i]);
fprintf(stderr, ")\n");
#endif
cring_erase(&d->q); // erase it in any case to prevent double-free
FSDataItem * o = (FSDataItem *)ctree_splay_add(&storage->tree, _FSDataItem_compare_with_node, &d->node, true);
if(d != o){
#ifdef FS_STOREDDATA_DEBUG
fprintf(stderr, " RM OLD " PrHID8 " (end=%u data=", o->key, o->end);
for(int i=0; i < 8; i++) fprintf(stderr, "%02X", o->data[i]);
fprintf(stderr, ")\n");
#endif
cring_erase(&o->q);
storage->free(o, storage->user);
}
cring_enqueue(&storage->q, &d->q);
}
FSDS_EXPORT
FSDataItem * FSDataItem_Get (FSDataStorage * storage, uint32_t curTime, uint64_t key)
{
if(curTime){
_FSDataItem_purge(storage, curTime);
}
FSDataItem * d = (FSDataItem *)ctree_splay_del(&storage->tree, _FSDataItem_compare_with_key, &key);
if(d){
#ifdef FS_STOREDDATA_DEBUG
fprintf(stderr, "%-5.5s [%u] GET " PrHID8 " (end=%u data=", storage->name, curTime, d->key, d->end);
for(int i=0; i < 8; i++) fprintf(stderr, "%02X", d->data[i]);
fprintf(stderr, ")\n");
#endif
cring_erase(&d->q);
#ifdef FS_STOREDDATA_DEBUG
}else{
fprintf(stderr, "%-5.5s [%u] GET " PrHID8 " (not found)\n", storage->name, curTime, key);
#endif
}
return d;
}
FSDS_EXPORT
FSDataItem * FSDataItem_Find (FSDataStorage * storage, uint32_t curTime, uint64_t key)
{
if(curTime){
_FSDataItem_purge(storage, curTime);
}
FSDataItem * d = (FSDataItem *)ctree_splay_find(&storage->tree, _FSDataItem_compare_with_key, &key);
#ifdef FS_STOREDDATA_DEBUG
if(d){
fprintf(stderr, "%-5.5s [%u] FND " PrHID8 " (end=%u data=", storage->name, curTime, d->key, d->end);
for(int i=0; i < 8; i++) fprintf(stderr, "%02X", d->data[i]);
fprintf(stderr, ")\n");
}else{
fprintf(stderr, "%-5.5s [%u] FND " PrHID8 " (not found)\n", storage->name, curTime, key);
}
#endif
return d;
}
FSDS_EXPORT
void FSDataItem_Del (FSDataStorage * storage, uint32_t curTime, FSDataItem * d)
{
#ifdef FS_STOREDDATA_DEBUG
fprintf(stderr, "%-5.5s [%u] DEL " PrHID8 " (end=%u data=", storage->name, curTime, d->key, d->end);
for(int i=0; i < 8; i++) fprintf(stderr, "%02X", d->data[i]);
fprintf(stderr, ")\n");
#endif
ctree_splay_del_node(&storage->tree, &d->node);
cring_erase(&d->q);
storage->free(d, storage->user);
if(curTime){
_FSDataItem_purge(storage, curTime);
}
}