blob: 005f131baa072e23c1483017d495466402146341 [file] [log] [blame]
Radek Krejcie7b95092019-05-15 11:03:07 +02001/**
2 * @file parser_xml.c
3 * @author Radek Krejci <rkrejci@cesnet.cz>
4 * @brief XML data parser for libyang
5 *
6 * Copyright (c) 2019 CESNET, z.s.p.o.
7 *
8 * This source code is licensed under BSD 3-Clause License (the "License").
9 * You may not use this file except in compliance with the License.
10 * You may obtain a copy of the License at
11 *
12 * https://opensource.org/licenses/BSD-3-Clause
13 */
14
15#include "common.h"
16
17#include <stdint.h>
18#include <stdlib.h>
19#include <string.h>
20
21#include "context.h"
22#include "dict.h"
23#include "log.h"
24#include "plugins_types.h"
25#include "set.h"
26#include "tree_data.h"
27#include "tree_data_internal.h"
28#include "tree_schema.h"
29#include "xml.h"
30
31/**
32 * @brief internal context for XML YANG data parser.
33 *
34 * The leading part is compatible with the struct lyxml_context
35 */
36struct lyd_xml_ctx {
37 struct ly_ctx *ctx; /**< libyang context */
38 uint64_t line; /**< number of the line being currently processed */
39 enum LYXML_PARSER_STATUS status; /**< status providing information about the next expected object in input data */
40 struct ly_set elements; /**< list of not-yet-closed elements */
41 struct ly_set ns; /**< handled with LY_SET_OPT_USEASLIST */
42
43 uint16_t options; /**< various @ref dataparseroptions. */
44 uint16_t path_len; /**< used bytes in the path buffer */
45#define LYD_PARSER_BUFSIZE 4078
46 char path[LYD_PARSER_BUFSIZE]; /**< buffer for the generated path */
Radek Krejcie553e6d2019-06-07 15:33:18 +020047 struct ly_set incomplete_type_validation; /**< set of nodes validated with LY_EINCOMPLETE result */
Radek Krejcie7b95092019-05-15 11:03:07 +020048};
49
50/**
Radek Krejciaca74032019-06-04 08:53:06 +020051 * @brief XML-parser's implementation of ly_type_resolve_prefix() callback to provide mapping between prefixes used in the values to the schema
52 * via XML namespaces.
53 */
54static const struct lys_module *
55lydxml_resolve_prefix(struct ly_ctx *ctx, const char *prefix, size_t prefix_len, void *parser)
56{
57 const struct lyxml_ns *ns;
58 struct lyxml_context *xmlctx = (struct lyxml_context*)parser;
59
60 ns = lyxml_ns_get(xmlctx, prefix, prefix_len);
61 if (!ns) {
62 return NULL;
63 }
64
65 return ly_ctx_get_module_implemented_ns(ctx, ns->uri);
66}
67
68/**
Radek Krejcie7b95092019-05-15 11:03:07 +020069 * @brief Parse XML attributes of the XML element of YANG data.
70 *
71 * @param[in] ctx XML YANG data parser context.
Radek Krejcie7b95092019-05-15 11:03:07 +020072 * @param[in,out] data Pointer to the XML string representation of the YANG data to parse.
73 * @param[out] attributes Resulting list of the parsed attributes. XML namespace definitions are not parsed
74 * as attributes, they are stored internally in the parser context.
75 * @reutn LY_ERR value.
76 */
77static LY_ERR
Radek Krejci17a78d82019-05-15 15:49:55 +020078lydxml_attributes(struct lyd_xml_ctx *ctx, const char **data, struct lyd_attr **attributes)
Radek Krejcie7b95092019-05-15 11:03:07 +020079{
80 LY_ERR ret = LY_SUCCESS;
81 unsigned int u;
82 const char *prefix, *name;
83 size_t prefix_len, name_len;
84 struct lyd_attr *attr = NULL, *last = NULL;
85 const struct lyxml_ns *ns;
86 struct ly_set attr_prefixes = {0};
87 struct attr_prefix_s {
88 const char *prefix;
89 size_t prefix_len;
90 } *attr_prefix;
91 struct lys_module *mod;
92
93 while(ctx->status == LYXML_ATTRIBUTE &&
94 lyxml_get_attribute((struct lyxml_context*)ctx, data, &prefix, &prefix_len, &name, &name_len) == LY_SUCCESS) {
95 int dynamic = 0;
96 char *buffer = NULL, *value;
97 size_t buffer_size = 0, value_len;
98
Radek Krejci17a78d82019-05-15 15:49:55 +020099 if (!name) {
100 /* seems like all the attrributes were internally processed as namespace definitions */
101 continue;
Radek Krejcie7b95092019-05-15 11:03:07 +0200102 }
Radek Krejci17a78d82019-05-15 15:49:55 +0200103
104 /* get attribute value */
105 ret = lyxml_get_string((struct lyxml_context *)ctx, data, &buffer, &buffer_size, &value, &value_len, &dynamic);
106 LY_CHECK_GOTO(ret, cleanup);
107
108 attr = calloc(1, sizeof *attr);
109 LY_CHECK_ERR_GOTO(!attr, LOGMEM(ctx->ctx); ret = LY_EMEM, cleanup);
110
111 attr->name = lydict_insert(ctx->ctx, name, name_len);
112 /* auxiliary store the prefix information and wait with resolving prefix to the time when all the namespaces,
113 * defined in this element, are parsed, so we will get the correct namespace for this prefix */
114 attr_prefix = malloc(sizeof *attr_prefix);
115 attr_prefix->prefix = prefix;
116 attr_prefix->prefix_len = prefix_len;
117 ly_set_add(&attr_prefixes, attr_prefix, LY_SET_OPT_USEASLIST);
118
119 /* TODO process value */
120
121 if (last) {
122 last->next = attr;
123 } else {
124 (*attributes) = attr;
125 }
126 last = attr;
Radek Krejcie7b95092019-05-15 11:03:07 +0200127 }
128
129 /* resolve annotation pointers in all the attributes */
130 for (last = *attributes, u = 0; u < attr_prefixes.count && last; u++, last = last->next) {
131 attr_prefix = (struct attr_prefix_s*)attr_prefixes.objs[u];
132 ns = lyxml_ns_get((struct lyxml_context *)ctx, attr_prefix->prefix, attr_prefix->prefix_len);
133 mod = ly_ctx_get_module_implemented_ns(ctx->ctx, ns->uri);
134
135 /* TODO get annotation */
136 }
137
138cleanup:
139
140 ly_set_erase(&attr_prefixes, free);
141 return ret;
142}
143
144/**
145 * @brief Parse XML elements as children YANG data node of the specified parent node.
146 *
147 * @param[in] ctx XML YANG data parser context.
148 * @param[in] parent Parent node where the children are inserted. NULL in case of parsing top-level elements.
149 * @param[in,out] data Pointer to the XML string representation of the YANG data to parse.
150 * @param[out] node Resulting list of the parsed nodes.
151 * @reutn LY_ERR value.
152 */
153static LY_ERR
154lydxml_nodes(struct lyd_xml_ctx *ctx, struct lyd_node_inner *parent, const char **data, struct lyd_node **node)
155{
156 LY_ERR ret = LY_SUCCESS;
157 const char *prefix, *name;
Radek Krejcie7b95092019-05-15 11:03:07 +0200158 size_t prefix_len, name_len;
159 struct lyd_attr *attributes = NULL;
160 const struct lyxml_ns *ns;
161 const struct lysc_node *snode;
162 struct lys_module *mod;
163 unsigned int parents_count = ctx->elements.count;
Radek Krejci710226d2019-07-24 17:24:59 +0200164 struct lyd_node *cur = NULL, *prev = NULL, *last = NULL;
Radek Krejcie7b95092019-05-15 11:03:07 +0200165
166 (*node) = NULL;
167
168 while(ctx->status == LYXML_ELEMENT) {
169 ret = lyxml_get_element((struct lyxml_context *)ctx, data, &prefix, &prefix_len, &name, &name_len);
170 LY_CHECK_GOTO(ret, cleanup);
171 if (!name) {
172 /* closing previous element */
Radek Krejcie7b95092019-05-15 11:03:07 +0200173 if (ctx->elements.count < parents_count) {
174 /* all siblings parsed */
175 break;
176 } else {
177 continue;
178 }
179 }
180 attributes = NULL;
Radek Krejci1f05b6a2019-07-18 16:15:06 +0200181 if (ctx->status == LYXML_ATTRIBUTE) {
Radek Krejci11702142019-07-24 17:46:04 +0200182 LY_CHECK_GOTO(lydxml_attributes(ctx, data, &attributes), error);
Radek Krejci1f05b6a2019-07-18 16:15:06 +0200183 }
184
Radek Krejcie7b95092019-05-15 11:03:07 +0200185 ns = lyxml_ns_get((struct lyxml_context *)ctx, prefix, prefix_len);
186 if (!ns) {
187 LOGVAL(ctx->ctx, LY_VLOG_LINE, &ctx->line, LYVE_REFERENCE, "Unknown XML prefix \"%*.s\".", prefix_len, prefix);
Radek Krejci11702142019-07-24 17:46:04 +0200188 goto error;
Radek Krejcie7b95092019-05-15 11:03:07 +0200189 }
190 mod = ly_ctx_get_module_implemented_ns(ctx->ctx, ns->uri);
191 if (!mod) {
192 LOGVAL(ctx->ctx, LY_VLOG_LINE, &ctx->line, LYVE_REFERENCE, "No module with namespace \"%s\" in the context.", ns->uri);
Radek Krejci11702142019-07-24 17:46:04 +0200193 goto error;
Radek Krejcie7b95092019-05-15 11:03:07 +0200194 }
195 snode = lys_child(parent ? parent->schema : NULL, mod, name, name_len, 0, (ctx->options & LYD_OPT_RPCREPLY) ? LYS_GETNEXT_OUTPUT : 0);
196 if (!snode) {
197 LOGVAL(ctx->ctx, LY_VLOG_LINE, &ctx->line, LYVE_REFERENCE, "Element \"%.*s\" not found in the \"%s\" module.", name_len, name, mod->name);
Radek Krejci11702142019-07-24 17:46:04 +0200198 goto error;
Radek Krejcie7b95092019-05-15 11:03:07 +0200199 }
200
201 /* allocate new node */
202 switch (snode->nodetype) {
Radek Krejcif3b6fec2019-07-24 15:53:11 +0200203 case LYS_ACTION:
204 if ((ctx->options & LYD_OPT_TYPEMASK) != LYD_OPT_RPC) {
205 LOGVAL(ctx->ctx, LY_VLOG_LINE, &ctx->line, LYVE_RESTRICTION, "Unexpected RPC/action element \"%.*s\" in %s data set.",
206 name_len, name, lyd_parse_options_type2str(ctx->options & LYD_OPT_TYPEMASK));
Radek Krejci11702142019-07-24 17:46:04 +0200207 goto error;
Radek Krejcif3b6fec2019-07-24 15:53:11 +0200208 }
209 cur = calloc(1, sizeof(struct lyd_node_inner));
210 break;
211 case LYS_NOTIF:
212 if ((ctx->options & LYD_OPT_TYPEMASK) != LYD_OPT_RPC) {
213 LOGVAL(ctx->ctx, LY_VLOG_LINE, &ctx->line, LYVE_RESTRICTION, "Unexpected Notification element \"%.*s\" in %s data set.",
214 name_len, name, lyd_parse_options_type2str(ctx->options));
Radek Krejci11702142019-07-24 17:46:04 +0200215 goto error;
Radek Krejcif3b6fec2019-07-24 15:53:11 +0200216 }
217 cur = calloc(1, sizeof(struct lyd_node_inner));
218 break;
Radek Krejcie7b95092019-05-15 11:03:07 +0200219 case LYS_CONTAINER:
220 case LYS_LIST:
221 cur = calloc(1, sizeof(struct lyd_node_inner));
222 break;
223 case LYS_LEAF:
224 case LYS_LEAFLIST:
225 cur = calloc(1, sizeof(struct lyd_node_term));
226 break;
227 case LYS_ANYDATA:
228 case LYS_ANYXML:
229 cur = calloc(1, sizeof(struct lyd_node_any));
230 break;
Radek Krejcie7b95092019-05-15 11:03:07 +0200231 default:
232 LOGINT(ctx->ctx);
Radek Krejci11702142019-07-24 17:46:04 +0200233 ret = LY_EINT;
Radek Krejcie7b95092019-05-15 11:03:07 +0200234 goto cleanup;
235 }
236 if (!(*node)) {
237 (*node) = cur;
238 }
Radek Krejci710226d2019-07-24 17:24:59 +0200239 last = cur;
Radek Krejcie7b95092019-05-15 11:03:07 +0200240 cur->schema = snode;
Radek Krejci710226d2019-07-24 17:24:59 +0200241 cur->prev = cur;
Radek Krejcie7b95092019-05-15 11:03:07 +0200242 cur->parent = parent;
Radek Krejcie92210c2019-05-17 15:53:35 +0200243 if (parent) {
Radek Krejci710226d2019-07-24 17:24:59 +0200244 if (prev && cur->schema->nodetype == LYS_LEAF && (cur->schema->flags & LYS_KEY)) {
245 /* it is key and we need to insert it into a correct place */
246 struct lysc_node_leaf **keys = ((struct lysc_node_list*)parent->schema)->keys;
247 unsigned int cur_index, key_index;
248 struct lyd_node *key;
249
250 for (cur_index = 0; keys[cur_index] != (struct lysc_node_leaf*)cur->schema; ++cur_index);
251 for (key = prev; !(key->schema->flags & LYS_KEY) && key->prev != prev; key = key->prev);
252 for (; key->schema->flags & LYS_KEY; key = key->prev) {
253 for (key_index = 0; keys[key_index] != (struct lysc_node_leaf*)key->schema; ++key_index);
254 if (key_index < cur_index) {
255 /* cur key is supposed to be placed after the key */
256 cur->next = key->next;
257 cur->prev = key;
258 key->next = cur;
259 if (cur->next) {
260 cur->next->prev = cur;
261 } else {
262 parent->child->prev = cur;
263 }
264 break;
265 }
266 if (key->prev == prev) {
267 /* current key is supposed to be the first child from the current children */
268 key = NULL;
269 break;
270 }
271 }
272 if (!key || !(key->schema->flags & LYS_KEY)) {
273 /* current key is supposed to be the first child from the current children */
274 cur->next = parent->child;
275 cur->prev = parent->child->prev;
276 parent->child->prev = cur;
277 parent->child = cur;
278 }
279 if (cur->next) {
280 last = prev;
281 if (ctx->options & LYD_OPT_STRICT) {
282 LOGVAL(ctx->ctx, LY_VLOG_LINE, &ctx->line, LYVE_RESTRICTION, "Invalid position of the key \"%.*s\" in a list.",
283 name_len, name);
Radek Krejci11702142019-07-24 17:46:04 +0200284 goto error;
Radek Krejci710226d2019-07-24 17:24:59 +0200285 } else {
286 LOGWRN(ctx->ctx, "Invalid position of the key \"%.*s\" in a list.", name_len, name);
287 }
288 }
289 } else {
290 /* last child of the parent */
291 if (prev) {
292 parent->child->prev = cur;
293 prev->next = cur;
294 cur->prev = prev;
295 }
296 }
Radek Krejcie7b95092019-05-15 11:03:07 +0200297 } else {
Radek Krejci710226d2019-07-24 17:24:59 +0200298 /* top level */
299 if (prev) {
300 /* last top level node */
301 struct lyd_node *iter;
302 for (iter = prev; iter->prev->next; iter = iter->prev);
303 iter->prev = cur;
304 prev->next = cur;
305 cur->prev = prev;
306 } /* first top level node - nothing more to do */
Radek Krejcie7b95092019-05-15 11:03:07 +0200307 }
Radek Krejci710226d2019-07-24 17:24:59 +0200308 prev = last;
Radek Krejcie7b95092019-05-15 11:03:07 +0200309 cur->attr = attributes;
310 attributes = NULL;
311
312 if (snode->nodetype & LYD_NODE_TERM) {
313 int dynamic = 0;
314 char *buffer = NULL, *value;
315 size_t buffer_size = 0, value_len;
316
317 if (ctx->status == LYXML_ELEM_CONTENT) {
318 /* get the value */
Radek Krejci11702142019-07-24 17:46:04 +0200319 ret = lyxml_get_string((struct lyxml_context *)ctx, data, &buffer, &buffer_size, &value, &value_len, &dynamic);
320 if (ret == LY_EINVAL) {
Radek Krejci339e2de2019-05-17 14:28:24 +0200321 /* just indentation of a child element found */
322 LOGVAL(ctx->ctx, LY_VLOG_LINE, &ctx->line, LYVE_SYNTAX, "Child element inside terminal node \"%s\" found.", cur->schema->name);
323 goto cleanup;
324 }
Radek Krejci11702142019-07-24 17:46:04 +0200325 ret = LY_SUCCESS;
Radek Krejcie92210c2019-05-17 15:53:35 +0200326 } else {
327 /* no content - validate empty value */
328 value = "";
329 value_len = 0;
Radek Krejcie7b95092019-05-15 11:03:07 +0200330 }
Radek Krejci3c9758d2019-07-11 16:49:10 +0200331 ret = lyd_value_parse((struct lyd_node_term*)cur, value, value_len, dynamic, 0, lydxml_resolve_prefix, ctx, LYD_XML, NULL);
Radek Krejcie553e6d2019-06-07 15:33:18 +0200332 if (ret == LY_EINCOMPLETE) {
333 ly_set_add(&ctx->incomplete_type_validation, cur, LY_SET_OPT_USEASLIST);
334 } else if (ret) {
335 if (dynamic){
336 free(value);
337 }
338 goto cleanup;
339 }
Radek Krejcie7b95092019-05-15 11:03:07 +0200340 } else if (snode->nodetype & LYD_NODE_INNER) {
341 int dynamic = 0;
342 char *buffer = NULL, *value;
343 size_t buffer_size = 0, value_len;
344
345 if (ctx->status == LYXML_ELEM_CONTENT) {
346 LY_ERR r = lyxml_get_string((struct lyxml_context *)ctx, data, &buffer, &buffer_size, &value, &value_len, &dynamic);
Radek Krejcie553e6d2019-06-07 15:33:18 +0200347 if (r != LY_EINVAL && (r != LY_SUCCESS || value_len != 0)) {
Radek Krejcie7b95092019-05-15 11:03:07 +0200348 LOGINT(ctx->ctx);
Radek Krejci11702142019-07-24 17:46:04 +0200349 ret = LY_EINT;
Radek Krejcie7b95092019-05-15 11:03:07 +0200350 goto cleanup;
351 }
352 }
Radek Krejciee4cab22019-07-17 17:07:47 +0200353 /* process children */
Radek Krejcie553e6d2019-06-07 15:33:18 +0200354 if (ctx->status == LYXML_ELEMENT && parents_count != ctx->elements.count) {
Radek Krejcie7b95092019-05-15 11:03:07 +0200355 ret = lydxml_nodes(ctx, (struct lyd_node_inner*)cur, data, lyd_node_children_p(cur));
Radek Krejcie92210c2019-05-17 15:53:35 +0200356 LY_CHECK_GOTO(ret, cleanup);
Radek Krejcie7b95092019-05-15 11:03:07 +0200357 }
Radek Krejciee4cab22019-07-17 17:07:47 +0200358 } else if (snode->nodetype & LYD_NODE_ANY) {
359 unsigned int cur_element_index = ctx->elements.count;
360 const char *start = *data, *stop;
361 const char *p, *n;
362 size_t p_len, n_len;
363
364 /* skip children data and store them as a string */
365 while (cur_element_index <= ctx->elements.count) {
366 switch (ctx->status) {
367 case LYXML_ELEMENT:
368 ret = lyxml_get_element((struct lyxml_context *)ctx, data, &p, &p_len, &n, &n_len);
369 break;
370 case LYXML_ATTRIBUTE:
371 lyxml_get_attribute((struct lyxml_context*)ctx, data, &p, &p_len, &n, &n_len);
372 break;
373 case LYXML_ELEM_CONTENT:
374 case LYXML_ATTR_CONTENT:
375 ret = lyxml_get_string((struct lyxml_context *)ctx, data, NULL, NULL, NULL, NULL, NULL);
376 if (ret == LY_EINVAL) {
377 /* not an error, just incorrect XML parser status */
378 ret = LY_SUCCESS;
379 }
380 break;
381 case LYXML_END:
382 /* unexpected end of data */
383 LOGINT(ctx->ctx);
Radek Krejci11702142019-07-24 17:46:04 +0200384 ret = LY_EINT;
Radek Krejciee4cab22019-07-17 17:07:47 +0200385 goto cleanup;
386 }
387 LY_CHECK_GOTO(ret, cleanup);
388 }
389 /* data now points after the anydata's closing element tag, we need just end of its content */
390 for (stop = *data - 1; *stop != '<'; --stop);
391
392 ((struct lyd_node_any*)cur)->value_type = LYD_ANYDATA_XML;
393 ((struct lyd_node_any*)cur)->value.xml = lydict_insert(ctx->ctx, start, stop - start);
Radek Krejcie7b95092019-05-15 11:03:07 +0200394 }
Radek Krejci1f05b6a2019-07-18 16:15:06 +0200395
396 /* calculate the hash and insert it into parent (list with keys is handled when its keys are inserted) */
397 lyd_hash(cur);
398 lyd_insert_hash(cur);
Radek Krejcib6f7ae52019-07-19 10:31:42 +0200399
400 /* if we have empty non-presence container, we keep it, but mark it as default */
401 if (cur->schema->nodetype == LYS_CONTAINER && !((struct lyd_node_inner*)cur)->child &&
402 !cur->attr && !(((struct lysc_node_container*)cur->schema)->flags & LYS_PRESENCE)) {
403 cur->flags |= LYD_DEFAULT;
404 }
405
406 /* TODO context validation */
Radek Krejcie7b95092019-05-15 11:03:07 +0200407 }
408
Radek Krejcif3b6fec2019-07-24 15:53:11 +0200409 /* TODO add missing siblings default elements */
410
Radek Krejcie7b95092019-05-15 11:03:07 +0200411cleanup:
Radek Krejcie7b95092019-05-15 11:03:07 +0200412 lyd_free_attr(ctx->ctx, attributes, 1);
Radek Krejcie7b95092019-05-15 11:03:07 +0200413 return ret;
Radek Krejci11702142019-07-24 17:46:04 +0200414
415error:
416 ret = LY_EVALID;
417 goto cleanup;
Radek Krejcie7b95092019-05-15 11:03:07 +0200418}
419
420LY_ERR
Radek Krejcif3b6fec2019-07-24 15:53:11 +0200421lyd_parse_xml(struct ly_ctx *ctx, const char *data, int options, const struct lyd_node **trees, struct lyd_node **result)
Radek Krejcie7b95092019-05-15 11:03:07 +0200422{
Radek Krejci18a57d92019-07-25 14:01:42 +0200423 LY_ERR ret = LY_SUCCESS;
Radek Krejcif3b6fec2019-07-24 15:53:11 +0200424 struct lyd_node_inner *parent = NULL;
Radek Krejcie7b95092019-05-15 11:03:07 +0200425 struct lyd_xml_ctx xmlctx = {0};
426
427 xmlctx.options = options;
428 xmlctx.ctx = ctx;
429 xmlctx.line = 1;
430
Radek Krejcif3b6fec2019-07-24 15:53:11 +0200431 /* init */
432 *result = NULL;
433
434 if (!data || !data[0]) {
435 goto no_data;
436 }
437
438 if (options & LYD_OPT_RPCREPLY) {
439 /* TODO prepare container for RPC reply, for which we need RPC
440 * - prepare *result as top-level node
441 * - prepare parent as the RPC/action node */
442 (void)trees;
443 }
444
445 ret = lydxml_nodes(&xmlctx, parent, &data, *result ? &parent->child : result);
Radek Krejcie92210c2019-05-17 15:53:35 +0200446 if (ret) {
447 lyd_free_all(*result);
448 *result = NULL;
Radek Krejcie553e6d2019-06-07 15:33:18 +0200449 } else {
450 /* finish incompletely validated terminal values */
451 for (unsigned int u = 0; u < xmlctx.incomplete_type_validation.count; u++) {
452 struct lyd_node_term *node = (struct lyd_node_term*)xmlctx.incomplete_type_validation.objs[u];
Radek Krejcif3b6fec2019-07-24 15:53:11 +0200453 const struct lyd_node **result_trees = NULL;
Radek Krejcie72c0432019-06-10 10:17:03 +0200454
455 /* prepare sized array for validator */
456 if (*result) {
Radek Krejcif3b6fec2019-07-24 15:53:11 +0200457 result_trees = lyd_trees_new(1, *result);
Radek Krejcie553e6d2019-06-07 15:33:18 +0200458 }
Radek Krejcie72c0432019-06-10 10:17:03 +0200459 /* validate and store the value of the node */
Radek Krejci3c9758d2019-07-11 16:49:10 +0200460 ret = lyd_value_parse(node, node->value.canonized, node->value.canonized ? strlen(node->value.canonized) : 0, 0, 1,
Radek Krejcif3b6fec2019-07-24 15:53:11 +0200461 lydxml_resolve_prefix, ctx, LYD_XML, result_trees);
462 lyd_trees_free(result_trees, 0);
Radek Krejcie553e6d2019-06-07 15:33:18 +0200463 if (ret) {
464 lyd_free_all(*result);
465 *result = NULL;
466 break;
467 }
468 }
Radek Krejcif3b6fec2019-07-24 15:53:11 +0200469
470 if (!(*result)) {
471no_data:
472 /* no data */
473 if (options & (LYD_OPT_RPC | LYD_OPT_NOTIF)) {
474 /* error, top level node identify RPC and Notification */
475 LOGERR(ctx, LY_EINVAL, "Invalid input data of data parser - expected %s which cannot be empty.",
476 lyd_parse_options_type2str(options));
477 } else {
478 /* others - no work is needed, just check for missing mandatory nodes */
479 /* TODO lyd_validate(&result, options, ctx); */
480 }
481 }
Radek Krejcie92210c2019-05-17 15:53:35 +0200482 }
Radek Krejcie553e6d2019-06-07 15:33:18 +0200483
484 ly_set_erase(&xmlctx.incomplete_type_validation, NULL);
Radek Krejcie7b95092019-05-15 11:03:07 +0200485 lyxml_context_clear((struct lyxml_context*)&xmlctx);
486 return ret;
487}