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
|
#include <stdio.h>
#include <stdlib.h>
#include <netbytes.h>
char *alloc_new_str_s(char *str, size_t size)
{
char *ret = NULL;
if (str == NULL)
{
return NULL;
}
//1MB is enought
if (size > (1024*1024))
{
return NULL;
}
ret = malloc(size+1); //extra for 1 zero at then end
if (ret == NULL)
{
return NULL;
}
memcpy(ret, str, size);
ret[size] = 0; //add zero at the end
return ret;
}
char *alloc_new_str(char *str)
{
return alloc_new_str_s(str, strlen(str));
}
typedef struct kv_user_name
{
int id;
char *name;
char *desc;
} kv_user_name;
kv_user_name* kv_new(int id, char *name, char *desc)
{
kv_user_name *ret = NULL;
ret = malloc(sizeof(kv_user_name));
if (!ret)
{
return NULL;
}
ret->id = id;
ret->name = alloc_new_str(name);
ret->desc = alloc_new_str(desc);
return ret;
}
kv_user_name* kv_empty()
{
kv_user_name *ret = NULL;
ret = calloc(1, sizeof(kv_user_name));
if (!ret)
{
return NULL;
}
return ret;
}
netbyte_store* kv_marsh(kv_user_name *kv)
{
netbyte_store *nb=NULL;
nb_u8 nb_id;
nb_u8arr nb_name, nb_desc;
nb = calloc(1,sizeof(netbyte_store));
nb_init(nb);
nb_u8_create(&nb_id, kv->id);
nb_add_u8(nb, &nb_id);
nb_u8arr_create(&nb_name, strlen(kv->name), kv->name);
nb_add_u8arr(nb, &nb_name);
nb_u8arr_create(&nb_desc, strlen(kv->desc), kv->desc);
nb_add_u8arr(nb, &nb_desc);
nb_print(nb);
nb_print(nb);
return nb;
}
int kv_unmarsh(netbyte_store *store, kv_user_name *kv)
{
__nb_type *type=NULL;
if (!store)
{
return -1;
}
if (!kv)
{
return -1;
}
if (0 == nb_val(store, 0, &type))
if (type->type == NBT_U8)
{
nb_u8 *u8 = (nb_u8 *)type->nb_val;
kv->id = u8->val;
} else
{
printf("ERR\n");
}
if (0 == nb_val(store, 1, &type))
if (type->type == NBT_U8ARRAY)
{
nb_u8arr *u8arr = (nb_u8arr *)type->nb_val;
kv->name = alloc_new_str_s(u8arr->val, u8arr->len);
} else
{
printf("ERR\n");
}
if (0 == nb_val(store, 2, &type))
if (type->type == NBT_U8ARRAY)
{
nb_u8arr *u8arr = (nb_u8arr *)type->nb_val;
kv->desc = alloc_new_str_s(u8arr->val, u8arr->len);
} else
{
printf("ERR\n");
}
return 0;
}
void kv_free(kv_user_name *kv)
{
if (kv!=NULL)
{
free(kv->name);
free(kv->desc);
free(kv);
}
}
int main()
{
int er=-1;
uint8_t *res=NULL;
FILE *f=NULL;
int i=0;
kv_user_name *kv=NULL;
netbyte_store *nb=malloc(sizeof(netbyte_store));
nb_tok_arr *pat = NULL;
printf("Start test\n");
f = fopen("test_kv_save.md","r");
if (nb_fread( nb, fileno(f) ) == 0)
{
nb_print( nb );
}
fclose( f );
pat = nb_tok_create(32);
if (pat == NULL)
{
printf("ERR nb_tok_create\n");
}
if (-1 == nb_parse("u8,u8[],u8[] ",pat))
{
printf("ERR nb_parse\n");
}
for (i=0;i<pat->len;i++)
{
nb_tok tok = pat->tok[i];
printf("%d S:%d TS:%d L:%d A:%d\n",
i, tok.sign, tok.type_size, tok.len, tok.arr
);
}
if (nb_match(nb, pat)==0)
{
printf("Match\n");
} else
{
printf("No match\n");
}
kv = kv_empty();
kv_unmarsh(nb, kv);
printf("ID:%d\n", kv->id);
printf("NAME:%s\n",kv->name);
printf("DESC:%s\n", kv->desc);
kv_free(kv);
nb_free(nb);
printf("End test\n");
return 0;
}
|
