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
|
#include <stdio.h>
#include <dtree/dtree.h>
#include <dtree/eztree.h>
/**
* A small test that creates a tree, splits the nodes
* and then merges them again.
*/
dt_err split_and_merge();
dt_err search_for_payload();
dt_err json_encode(char *json);
dt_err test_shortcut_functions();
#define TEST(function) \
printf("Running '%s'...", #function); \
fflush(stdout); \
err = function; \
printf(" %s\n", (err == 0) ? "OK!" : "FAILED!"); \
if(err) goto end;
int main(void)
{
dt_err err = SUCCESS;
printf("=== libdyntree test suite ===\n");
TEST(split_and_merge())
TEST(search_for_payload())
char json[1024];
TEST(json_encode(json))
dtree *recover;
dtree_decode_json(&recover, json);
dtree_free(recover);
end:
printf("==== done ====\n");
return err;
}
/*************** TEST IMPLEMENTATIONS ****************/
dt_err split_and_merge()
{
dt_err err;
/* Allocate a node named root */
dtree *root;
err = dtree_malloc(&root);
if(err) goto exit;
/* Add child as a recursive node to root */
dtree *child;
err = dtree_addlist(root, &child);
if(err) goto exit;
/* Make child a literal node containing the works of shakespeare */
const char *hamlet = "To be, or not to be: that is the question:\n"
"Whether 'tis nobler in the mind to suffer\n"
"The slings and arrows of outrageous fortune,\n"
"Or to take arms against a sea of troubles,\n"
"And by opposing end them? To die: to sleep;\n"
"No more; and by a sleep to say we end\n"
"The heart-ache and the thousand natural shocks\n"
"That flesh is heir to, 'tis a consummation\n"
"Devoutly to be wish'd. To die, to sleep;";
err = dtree_addliteral(child, hamlet);
if(err) goto exit;
/* Split our tree into two single-nodes */
err = dtree_split_trees(root, child);
if(err) goto exit;
/* Re-merge because they miss each other */
err = dtree_merge_trees(root, child);
if(err) goto exit;
/* Cleanup */
exit:
dtree_free(root);
return err;
}
dt_err search_for_payload()
{
dt_err err;
dtree *root, *a, *b, *found;
err = dtree_malloc(&root);
if(err) goto exit;
const char *string = "This is some data!";
err = dtree_addlist(root, &a);
if(err) goto exit;
err = dtree_addliteral(a, string);
if(err) goto exit;
err = dtree_addlist(root, &b);
if(err) goto exit;
err = dtree_addnumeral(b, 1337);
if(err) goto exit;
/* Try to find our data again */
err = dtree_search_payload(root, &found, (void*) string, LITERAL);
if(err) goto exit;
err = dtree_search_payload(root, &found, (void*) 1337, NUMERIC);
if(err) goto exit;
exit:
dtree_free(root);
return err;
}
dt_err json_encode(char *json) {
dt_err err;
dtree *root, *a, *b, *c, *found;
err = dtree_malloc(&root);
if (err) goto exit;
dtree *key, *val;
err = dtree_addlist(root, &a);
if (err) goto exit;
err = dtree_addlist(root, &b);
if (err) goto exit;
err = dtree_addlist(root, &c);
if (err) goto exit;
err = dtree_addpair(a, &key, &val);
if (err) goto exit;
err = dtree_addliteral(key, "Server Address");
if (err) goto exit;
err = dtree_addliteral(val, "https://github.com");
if (err) goto exit;
key = val = NULL;
err = dtree_addpair(b, &key, &val);
if (err) goto exit;
err = dtree_addliteral(key, "Server Port");
if (err) goto exit;
err = dtree_addnumeral(val, 8080);
if (err) goto exit;
key = val = NULL;
err = dtree_addpair(c, &key, &val);
if (err) goto exit;
err = dtree_addliteral(key, "Users");
if (err) goto exit;
dtree *sbrec, *sbrec2;
err = dtree_addlist(val, &sbrec);
if (err) goto exit;
err = dtree_addlist(val, &sbrec2);
if (err) goto exit;
dtree *subkey, *subval;
err = dtree_addpair(sbrec, &subkey, &subval);
if (err) goto exit;
err = dtree_addliteral(subkey, "spacekookie");
if (err) goto exit;
err = dtree_addliteral(subval, "Admin");
if (err) goto exit;
key = val = NULL;
dtree *subkey2, *subval2;
err = dtree_addpair(sbrec2, &subkey2, &subval2);
if (err) goto exit;
err = dtree_addliteral(subkey2, "jane");
if (err) goto exit;
err = dtree_addliteral(subval2, "normal");
if (err) goto exit;
err = dtree_encode_set(root, DYNTREE_JSON_MINIFIED);
if (err) goto exit;
err = dtree_encode_json(root, json);
if (err) goto exit;
exit:
dtree_free(root);
return err;
}
|
