-
Notifications
You must be signed in to change notification settings - Fork 11
/
ezxml_wrapper.c
362 lines (317 loc) · 10 KB
/
ezxml_wrapper.c
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
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
/*
* Copyright (c) 2024 roleo.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, version 3.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include "string.h"
#include "ezxml_wrapper.h"
#include "utils.h"
#include "log.h"
ezxml_t root_xml;
/**
* Init xml parser
* @param buffer The buffer contaning the xml file
* @param buffer_size The size of the buffer
*/
void init_xml(char *buffer, int buffer_size)
{
root_xml = ezxml_parse_str(buffer, buffer_size);
}
/**
* Init xml parser
* @param buffer The name of the xml file
*/
void init_xml_from_file(char *file)
{
root_xml = ezxml_parse_file(file);
}
/**
* Close xml parser
*/
void close_xml()
{
ezxml_free(root_xml);
}
/**
* Get the method (the 1st element after <Body>)
* @param skip_prefix 1 to skip the prefix of the element (<prefix:method>)
* @return A pointer to the name of the method, NULL if not found
*/
const char *get_method(int skip_prefix)
{
ezxml_t xml;
char first_node[256];
int len;
char *c;
// Check if "Body" element exists
strcpy(first_node, "Body");
xml = root_xml->child;
while (xml && strcmp(first_node, xml->name)) xml = xml->ordered;
if ((xml) && (xml->child)) {
if (skip_prefix) {
c = strchr(xml->child->name, ':');
if (c == NULL) {
return xml->child->name;
} else {
c++;
return c;
}
}
}
// Check if "something:Body" element exists
xml = root_xml->child;
strcpy(first_node, ":Body");
while (xml) {
len = strlen(xml->name);
if (strcmp(first_node, &(xml->name)[len - 5]) == 0) break;
xml = xml->ordered;
}
if ((xml) && (xml->child)) {
if (skip_prefix) {
c = strchr(xml->child->name, ':');
if (c == NULL) {
return xml->child->name;
} else {
c++;
return c;
}
}
}
return NULL;
}
int go_to_parent;
/**
* Internal recursive function: get the 1st element with name "name" starting from "first_node"
* @param xml The xml structure
* @param name The name of the element to find
* @param first_node The node where to find the element
* @return A pointer to the value of the element, NULL if not found
*/
const char *get_element_rec(ezxml_t xml, char *name, char *first_node)
{
const char *ret;
char name_copy[256];
ezxml_t px, pk;
if (go_to_parent) return NULL;
// If it's the root of the document choose the first node ("Header" or "Body")
if (xml->parent == NULL) {
px = xml->child;
strcpy(name_copy, first_node);
while (px) {
if (strcmp(first_node, &(px->name)[strlen(px->name) - strlen(first_node)]) == 0) {
ret = get_element_rec(px, name, first_node);
return ret;
} else {
px = px->ordered;
}
}
// 1st node not found, exit
} else {
// Check if this node is "<name>"
if (strcmp(name, xml->name) == 0) {
return xml->txt;
}
// Check if this node is "<something:name>"
name_copy[0] = ':';
strcpy(&name_copy[1], name);
if (strcmp(name_copy, &(xml->name)[strlen(xml->name) - strlen(name_copy)]) == 0) {
return xml->txt;
}
// Check children
if (xml->child) {
ret = get_element_rec(xml->child, name, first_node);
go_to_parent = 0;
if (ret != NULL) return ret;
}
// Check brothers
while(pk = xml->ordered) {
ret = get_element_rec(pk, name, first_node);
if (go_to_parent) return NULL;
if (ret != NULL) return ret;
}
go_to_parent = 1;
}
return NULL;
}
/**
* Get the 1st element with name "name" starting from "first_node"
* @param name The name of the element to find
* @param first_node The node where to find the element
* @return A pointer to the value of the element, NULL if not found
*/
const char *get_element(char *name, char *first_node)
{
char *ret;
go_to_parent = 0;
ret = (char *) get_element_rec(root_xml, name, first_node);
if (ret == NULL) return NULL;
else return trim_mf(ret);
// Warning: the line above change the xml content
// ret should be a (const char *)
}
/**
* Internal recursive function: get the 1st element with name "name" starting from "start_from"
* @param xml The xml structure
* @param name The name of the element to find
* @param first_node The node where to find the element
* @return ezxml_t type pointing to the element, NULL if not found
*/
ezxml_t get_element_rec_ptr(ezxml_t xml, char *name, char *first_node)
{
ezxml_t ret;
char name_copy[256];
ezxml_t px, pk;
if (go_to_parent) return NULL;
// If it's the root of the document choose the first node ("Header" or "Body")
if (xml->parent == NULL) {
px = xml->child;
strcpy(name_copy, first_node);
while (px) {
if (strcmp(first_node, &(px->name)[strlen(px->name) - strlen(first_node)]) == 0) {
ret = get_element_rec_ptr(px, name, first_node);
return ret;
} else {
px = px->ordered;
}
}
// 1st node not found, exit
} else {
// Check if this node is "<name>"
if (strcmp(name, xml->name) == 0) {
return xml;
}
// Check if this node is "<something:name>"
name_copy[0] = ':';
strcpy(&name_copy[1], name);
if (strcmp(name_copy, &(xml->name)[strlen(xml->name) - strlen(name_copy)]) == 0) {
return xml;
}
// Check children
if (xml->child) {
ret = get_element_rec_ptr(xml->child, name, first_node);
go_to_parent = 0;
if (ret != NULL) return ret;
}
// Check brothers
while(pk = xml->ordered) {
ret = get_element_rec_ptr(pk, name, first_node);
if (go_to_parent) return NULL;
if (ret != NULL) return ret;
}
go_to_parent = 1;
}
return NULL;
}
/**
* Get the 1st element with name "name" starting from "start_from"
* @param start_from The element where to start
* @param name The name of the element to find
* @param first_node The 1st level node where to find the element
* @return ezxml_t type pointing to the element, NULL if not found
*/
ezxml_t get_element_ptr(ezxml_t start_from, char *name, char *first_node)
{
ezxml_t ret;
go_to_parent = 0;
if (start_from == NULL)
ret = get_element_rec_ptr(root_xml, name, first_node);
else
ret = get_element_rec_ptr(start_from, name, first_node);
return ret;
}
/**
* Get the child element with name "name" starting from node "father"
* @param name The name of the element to find
* @param father The node where to find the element
* @return A pointer to the value of the element, NULL if not found
*/
const char *get_element_in_element(const char *name, ezxml_t father)
{
char name_copy[256];
ezxml_t child = father->child;
ezxml_t pk;
if (child != NULL) {
// Check if this node is "<name>"
if (strcmp(name, child->name) == 0) {
return child->txt;
}
// Check if this node is "<something:name>"
name_copy[0] = ':';
strcpy(&name_copy[1], name);
if (strcmp(name_copy, &(child->name)[strlen(child->name) - strlen(name_copy)]) == 0) {
return child->txt;
}
// Check brothers
while(pk = child->ordered) {
// Check if this node is "<name>"
if (strcmp(name, pk->name) == 0) {
return pk->txt;
}
// Check if this node is "<something:name>"
name_copy[0] = ':';
strcpy(&name_copy[1], name);
if (strcmp(name_copy, &(pk->name)[strlen(pk->name) - strlen(name_copy)]) == 0) {
return pk->txt;
}
}
}
return NULL;
}
/**
* Get the child element with name "name" starting from node "father"
* @param name The name of the element to find
* @param father The node where to find the element
* @return ezxml_t type pointing to the element, NULL if not found
*/
ezxml_t get_element_in_element_ptr(const char *name, ezxml_t father)
{
char name_copy[256];
ezxml_t child = father->child;
ezxml_t pk;
if (child != NULL) {
// Check if this node is "<name>"
if (strcmp(name, child->name) == 0) {
return child;
}
// Check if this node is "<something:name>"
name_copy[0] = ':';
strcpy(&name_copy[1], name);
if (strcmp(name_copy, &(child->name)[strlen(child->name) - strlen(name_copy)]) == 0) {
return child;
}
// Check brothers
while(pk = child->ordered) {
// Check if this node is "<name>"
if (strcmp(name, pk->name) == 0) {
return pk;
}
// Check if this node is "<something:name>"
name_copy[0] = ':';
strcpy(&name_copy[1], name);
if (strcmp(name_copy, &(pk->name)[strlen(pk->name) - strlen(name_copy)]) == 0) {
return pk;
}
}
}
return NULL;
}
/**
* Get the attribute of a node with name "name"
* @param node The node where to find the attribute
* @param name The name of the attribute to find
* @return A pointer to the value of the attribute, NULL if not found
*/
const char *get_attribute(ezxml_t node, char *name)
{
return ezxml_attr(node, name);
}