blob: e8b598dd944dc97e8e0f83e2c05f174930b35e59 [file] [log] [blame]
Radek Krejcie7b95092019-05-15 11:03:07 +02001/**
Michal Vaskob1b5c262020-03-05 14:29:47 +01002 * @file tree_data.c
Radek Krejcie7b95092019-05-15 11:03:07 +02003 * @author Radek Krejci <rkrejci@cesnet.cz>
Michal Vasko6cd9b6b2020-06-22 10:05:22 +02004 * @brief Data tree functions
Radek Krejcie7b95092019-05-15 11:03:07 +02005 *
Michal Vasko6cd9b6b2020-06-22 10:05:22 +02006 * Copyright (c) 2015 - 2020 CESNET, z.s.p.o.
Radek Krejcie7b95092019-05-15 11:03:07 +02007 *
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
Radek Krejci535ea9f2020-05-29 16:01:05 +020015#define _GNU_SOURCE
16
17#include "tree_data.h"
Radek Krejcie7b95092019-05-15 11:03:07 +020018
Radek Krejci084289f2019-07-09 17:35:30 +020019#include <assert.h>
Radek Krejcie7b95092019-05-15 11:03:07 +020020#include <ctype.h>
Radek Krejci47fab892020-11-05 17:02:41 +010021#include <inttypes.h>
Radek Krejcie7b95092019-05-15 11:03:07 +020022#include <stdarg.h>
23#include <stdint.h>
Radek Krejci535ea9f2020-05-29 16:01:05 +020024#include <stdio.h>
25#include <stdlib.h>
Radek Krejcie7b95092019-05-15 11:03:07 +020026#include <string.h>
Radek Krejcie7b95092019-05-15 11:03:07 +020027
Radek Krejci535ea9f2020-05-29 16:01:05 +020028#include "common.h"
Michal Vasko5aa44c02020-06-29 11:47:02 +020029#include "compat.h"
Radek Krejci535ea9f2020-05-29 16:01:05 +020030#include "context.h"
31#include "dict.h"
Michal Vaskoa6669ba2020-08-06 16:14:26 +020032#include "diff.h"
Michal Vasko90932a92020-02-12 14:33:03 +010033#include "hash_table.h"
Radek Krejci47fab892020-11-05 17:02:41 +010034#include "in.h"
Michal Vaskoafac7822020-10-20 14:22:26 +020035#include "in_internal.h"
Radek Krejci535ea9f2020-05-29 16:01:05 +020036#include "log.h"
Radek Krejci7931b192020-06-25 17:05:03 +020037#include "parser_data.h"
38#include "parser_internal.h"
Michal Vasko004d3152020-06-11 19:59:22 +020039#include "path.h"
Radek Krejci535ea9f2020-05-29 16:01:05 +020040#include "plugins_exts.h"
Michal Vasko90932a92020-02-12 14:33:03 +010041#include "plugins_exts_internal.h"
Michal Vasko69730152020-10-09 16:30:07 +020042#include "plugins_exts_metadata.h"
Radek Krejci535ea9f2020-05-29 16:01:05 +020043#include "plugins_types.h"
44#include "set.h"
45#include "tree.h"
46#include "tree_data_internal.h"
47#include "tree_schema.h"
48#include "tree_schema_internal.h"
Michal Vaskoa6669ba2020-08-06 16:14:26 +020049#include "validation.h"
Radek Krejci535ea9f2020-05-29 16:01:05 +020050#include "xml.h"
51#include "xpath.h"
Radek Krejcie7b95092019-05-15 11:03:07 +020052
Michal Vaskob104f112020-07-17 09:54:54 +020053static LY_ERR lyd_find_sibling_schema(const struct lyd_node *siblings, const struct lysc_node *schema,
Radek Krejci0f969882020-08-21 16:56:47 +020054 struct lyd_node **match);
Michal Vaskob104f112020-07-17 09:54:54 +020055
Radek Krejci084289f2019-07-09 17:35:30 +020056LY_ERR
Michal Vaskofeca4fb2020-10-05 08:58:40 +020057lyd_value_store(const struct ly_ctx *ctx, struct lyd_value *val, const struct lysc_type *type, const char *value,
58 size_t value_len, ly_bool *dynamic, LY_PREFIX_FORMAT format, void *prefix_data, uint32_t hints,
59 const struct lysc_node *ctx_node, ly_bool *incomplete, enum LY_VLOG_ELEM log_elem_type, const void *log_elem)
Radek Krejci084289f2019-07-09 17:35:30 +020060{
Michal Vaskofeca4fb2020-10-05 08:58:40 +020061 LY_ERR ret;
Radek Krejci084289f2019-07-09 17:35:30 +020062 struct ly_err_item *err = NULL;
Michal Vasko25d6ad02020-10-22 12:20:22 +020063 uint32_t options = (dynamic && *dynamic ? LY_TYPE_STORE_DYNAMIC : 0);
Radek Krejci084289f2019-07-09 17:35:30 +020064
Michal Vaskofeca4fb2020-10-05 08:58:40 +020065 if (incomplete) {
66 *incomplete = 0;
Radek Krejci084289f2019-07-09 17:35:30 +020067 }
68
Michal Vaskofeca4fb2020-10-05 08:58:40 +020069 ret = type->plugin->store(ctx, type, value, value_len, options, format, prefix_data, hints, ctx_node, val, &err);
Michal Vasko90932a92020-02-12 14:33:03 +010070 if (ret == LY_EINCOMPLETE) {
Michal Vaskofeca4fb2020-10-05 08:58:40 +020071 if (incomplete) {
72 *incomplete = 1;
73 }
74 } else if (ret) {
75 if (err) {
76 LOGVAL(ctx, log_elem_type, log_elem, err->vecode, err->msg);
77 ly_err_free(err);
78 } else {
79 LOGVAL(ctx, log_elem_type, log_elem, LYVE_OTHER, "Storing value \"%.*s\" failed.", (int)value_len, value);
80 }
81 return ret;
Michal Vasko90932a92020-02-12 14:33:03 +010082 }
83
Michal Vaskofeca4fb2020-10-05 08:58:40 +020084 if (dynamic) {
85 *dynamic = 0;
86 }
87 return LY_SUCCESS;
Michal Vasko90932a92020-02-12 14:33:03 +010088}
89
Radek Krejci38d85362019-09-05 16:26:38 +020090LY_ERR
Michal Vaskofeca4fb2020-10-05 08:58:40 +020091lyd_value_validate_incomplete(const struct ly_ctx *ctx, const struct lysc_type *type, struct lyd_value *val,
92 const struct lyd_node *ctx_node, const struct lyd_node *tree, enum LY_VLOG_ELEM log_elem_type, const void *log_elem)
Radek Krejci38d85362019-09-05 16:26:38 +020093{
Michal Vaskofeca4fb2020-10-05 08:58:40 +020094 LY_ERR ret;
Radek Krejci38d85362019-09-05 16:26:38 +020095 struct ly_err_item *err = NULL;
Radek Krejci38d85362019-09-05 16:26:38 +020096
Michal Vaskofeca4fb2020-10-05 08:58:40 +020097 assert(type->plugin->validate);
Michal Vasko8d544252020-03-02 10:19:52 +010098
Michal Vaskofeca4fb2020-10-05 08:58:40 +020099 ret = type->plugin->validate(ctx, type, ctx_node, tree, val, &err);
100 if (ret) {
Radek Krejci38d85362019-09-05 16:26:38 +0200101 if (err) {
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200102 LOGVAL(ctx, log_elem_type, log_elem, err->vecode, err->msg);
Radek Krejci38d85362019-09-05 16:26:38 +0200103 ly_err_free(err);
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200104 } else {
105 LOGVAL(ctx, log_elem_type, log_elem, LYVE_OTHER, "Resolving value \"%s\" failed.", val->canonical);
Radek Krejci38d85362019-09-05 16:26:38 +0200106 }
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200107 return ret;
Radek Krejci38d85362019-09-05 16:26:38 +0200108 }
109
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200110 return LY_SUCCESS;
Radek Krejci38d85362019-09-05 16:26:38 +0200111}
112
Michal Vaskof937cfe2020-08-03 16:07:12 +0200113LY_ERR
114_lys_value_validate(const struct ly_ctx *ctx, const struct lysc_node *node, const char *value, size_t value_len,
Radek Krejci0f969882020-08-21 16:56:47 +0200115 LY_PREFIX_FORMAT format, void *prefix_data)
Radek Krejci084289f2019-07-09 17:35:30 +0200116{
117 LY_ERR rc = LY_SUCCESS;
118 struct ly_err_item *err = NULL;
Michal Vaskoba99a3e2020-08-18 15:50:05 +0200119 struct lyd_value storage;
Radek Krejci084289f2019-07-09 17:35:30 +0200120 struct lysc_type *type;
Radek Krejci084289f2019-07-09 17:35:30 +0200121
122 LY_CHECK_ARG_RET(ctx, node, value, LY_EINVAL);
123
124 if (!(node->nodetype & (LYS_LEAF | LYS_LEAFLIST))) {
125 LOGARG(ctx, node);
126 return LY_EINVAL;
127 }
128
Michal Vasko22df3f02020-08-24 13:29:22 +0200129 type = ((struct lysc_node_leaf *)node)->type;
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200130 rc = type->plugin->store(ctx ? ctx : node->module->ctx, type, value, value_len, 0, format, prefix_data,
131 LYD_HINT_SCHEMA, node, &storage, &err);
Radek Krejci73dead22019-07-11 16:46:16 +0200132 if (rc == LY_EINCOMPLETE) {
133 /* actually success since we do not provide the context tree and call validation with
134 * LY_TYPE_OPTS_INCOMPLETE_DATA */
135 rc = LY_SUCCESS;
136 } else if (rc && err) {
137 if (ctx) {
138 /* log only in case the ctx was provided as input parameter */
Radek Krejci73dead22019-07-11 16:46:16 +0200139 LOGVAL(ctx, LY_VLOG_STR, err->path, err->vecode, err->msg);
Radek Krejci084289f2019-07-09 17:35:30 +0200140 }
Radek Krejci73dead22019-07-11 16:46:16 +0200141 ly_err_free(err);
Radek Krejci084289f2019-07-09 17:35:30 +0200142 }
143
Michal Vaskoba99a3e2020-08-18 15:50:05 +0200144 if (!rc) {
145 type->plugin->free(ctx ? ctx : node->module->ctx, &storage);
146 }
Radek Krejci084289f2019-07-09 17:35:30 +0200147 return rc;
148}
149
150API LY_ERR
Michal Vaskof937cfe2020-08-03 16:07:12 +0200151lys_value_validate(const struct ly_ctx *ctx, const struct lysc_node *node, const char *value, size_t value_len)
152{
Michal Vaskoc8a230d2020-08-14 12:17:10 +0200153 return _lys_value_validate(ctx, node, value, value_len, LY_PREF_JSON, NULL);
Michal Vaskof937cfe2020-08-03 16:07:12 +0200154}
155
156API LY_ERR
Michal Vasko44685da2020-03-17 15:38:06 +0100157lyd_value_validate(const struct ly_ctx *ctx, const struct lyd_node_term *node, const char *value, size_t value_len,
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200158 const struct lyd_node *tree, const struct lysc_type **realtype)
Radek Krejci084289f2019-07-09 17:35:30 +0200159{
160 LY_ERR rc;
161 struct ly_err_item *err = NULL;
162 struct lysc_type *type;
Michal Vasko3701af52020-08-03 14:29:38 +0200163 struct lyd_value val = {0};
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200164 ly_bool stored = 0;
Radek Krejci084289f2019-07-09 17:35:30 +0200165
166 LY_CHECK_ARG_RET(ctx, node, value, LY_EINVAL);
167
Michal Vasko22df3f02020-08-24 13:29:22 +0200168 type = ((struct lysc_node_leaf *)node->schema)->type;
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200169 /* store */
170 rc = type->plugin->store(ctx ? ctx : LYD_CTX(node), type, value, value_len, 0, LY_PREF_JSON, NULL,
171 LYD_HINT_DATA, node->schema, &val, &err);
Radek Krejci73dead22019-07-11 16:46:16 +0200172 if (rc == LY_EINCOMPLETE) {
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200173 stored = 1;
174
175 /* resolve */
176 rc = type->plugin->validate(ctx ? ctx : LYD_CTX(node), type, (struct lyd_node *)node, tree, &val, &err);
177 }
178
179 if (rc) {
Radek Krejci73dead22019-07-11 16:46:16 +0200180 if (err) {
181 if (ctx) {
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200182 LOGVAL(ctx, LY_VLOG_LYD, node, err->vecode, err->msg);
Radek Krejci084289f2019-07-09 17:35:30 +0200183 }
Radek Krejci73dead22019-07-11 16:46:16 +0200184 ly_err_free(err);
Radek Krejci084289f2019-07-09 17:35:30 +0200185 }
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200186 if (stored) {
187 type->plugin->free(ctx ? ctx : LYD_CTX(node), &val);
188 }
Radek Krejci73dead22019-07-11 16:46:16 +0200189 return rc;
Radek Krejci084289f2019-07-09 17:35:30 +0200190 }
191
Michal Vasko3701af52020-08-03 14:29:38 +0200192 if (realtype) {
193 *realtype = val.realtype;
194 }
195
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200196 type->plugin->free(ctx ? ctx : LYD_CTX(node), &val);
Radek Krejci084289f2019-07-09 17:35:30 +0200197 return LY_SUCCESS;
198}
199
200API LY_ERR
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200201lyd_value_compare(const struct lyd_node_term *node, const char *value, size_t value_len)
Radek Krejci084289f2019-07-09 17:35:30 +0200202{
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200203 LY_ERR ret = LY_SUCCESS;
Radek Krejci084289f2019-07-09 17:35:30 +0200204 struct ly_ctx *ctx;
205 struct lysc_type *type;
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200206 struct lyd_value val = {0};
Radek Krejci084289f2019-07-09 17:35:30 +0200207
208 LY_CHECK_ARG_RET(node ? node->schema->module->ctx : NULL, node, value, LY_EINVAL);
209
210 ctx = node->schema->module->ctx;
Michal Vasko22df3f02020-08-24 13:29:22 +0200211 type = ((struct lysc_node_leaf *)node->schema)->type;
Radek Krejci084289f2019-07-09 17:35:30 +0200212
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200213 /* store the value */
214 ret = lyd_value_store(ctx, &val, type, value, value_len, NULL, LY_PREF_JSON, NULL, LYD_HINT_DATA, node->schema,
215 NULL, LY_VLOG_LYSC, node->schema);
216 LY_CHECK_RET(ret);
Radek Krejci084289f2019-07-09 17:35:30 +0200217
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200218 /* compare values */
219 ret = type->plugin->compare(&node->value, &val);
Radek Krejci084289f2019-07-09 17:35:30 +0200220
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200221 type->plugin->free(ctx, &val);
Radek Krejci084289f2019-07-09 17:35:30 +0200222 return ret;
223}
224
Radek Krejci19611252020-10-04 13:54:53 +0200225API ly_bool
226lyd_is_default(const struct lyd_node *node)
227{
228 const struct lysc_node_leaf *leaf;
229 const struct lysc_node_leaflist *llist;
230 const struct lyd_node_term *term;
231 LY_ARRAY_COUNT_TYPE u;
232
233 assert(node->schema->nodetype & LYD_NODE_TERM);
234 term = (const struct lyd_node_term *)node;
235
236 if (node->schema->nodetype == LYS_LEAF) {
237 leaf = (const struct lysc_node_leaf *)node->schema;
238 if (!leaf->dflt) {
239 return 0;
240 }
241
242 /* compare with the default value */
243 if (leaf->type->plugin->compare(&term->value, leaf->dflt)) {
244 return 0;
245 }
246 } else {
247 llist = (const struct lysc_node_leaflist *)node->schema;
248 if (!llist->dflts) {
249 return 0;
250 }
251
252 LY_ARRAY_FOR(llist->dflts, u) {
253 /* compare with each possible default value */
254 if (llist->type->plugin->compare(&term->value, llist->dflts[u])) {
255 return 0;
256 }
257 }
258 }
259
260 return 1;
261}
262
Radek Krejci7931b192020-06-25 17:05:03 +0200263static LYD_FORMAT
Michal Vasko63f3d842020-07-08 10:10:14 +0200264lyd_parse_get_format(const struct ly_in *in, LYD_FORMAT format)
Radek Krejcie7b95092019-05-15 11:03:07 +0200265{
Michal Vasko69730152020-10-09 16:30:07 +0200266 if (!format && (in->type == LY_IN_FILEPATH)) {
Radek Krejcie7b95092019-05-15 11:03:07 +0200267 /* unknown format - try to detect it from filename's suffix */
Radek Krejci7931b192020-06-25 17:05:03 +0200268 const char *path = in->method.fpath.filepath;
269 size_t len = strlen(path);
Radek Krejcie7b95092019-05-15 11:03:07 +0200270
271 /* ignore trailing whitespaces */
Michal Vaskod989ba02020-08-24 10:59:24 +0200272 for ( ; len > 0 && isspace(path[len - 1]); len--) {}
Radek Krejcie7b95092019-05-15 11:03:07 +0200273
Michal Vasko69730152020-10-09 16:30:07 +0200274 if ((len >= 5) && !strncmp(&path[len - 4], ".xml", 4)) {
Radek Krejcie7b95092019-05-15 11:03:07 +0200275 format = LYD_XML;
Michal Vasko69730152020-10-09 16:30:07 +0200276 } else if ((len >= 6) && !strncmp(&path[len - 5], ".json", 5)) {
Radek Krejcie7b95092019-05-15 11:03:07 +0200277 format = LYD_JSON;
Michal Vasko69730152020-10-09 16:30:07 +0200278 } else if ((len >= 5) && !strncmp(&path[len - 4], ".lyb", 4)) {
Radek Krejcie7b95092019-05-15 11:03:07 +0200279 format = LYD_LYB;
Radek Krejci7931b192020-06-25 17:05:03 +0200280 } /* else still unknown */
Radek Krejcie7b95092019-05-15 11:03:07 +0200281 }
282
Radek Krejci7931b192020-06-25 17:05:03 +0200283 return format;
284}
Radek Krejcie7b95092019-05-15 11:03:07 +0200285
Radek Krejci7931b192020-06-25 17:05:03 +0200286API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +0200287lyd_parse_data(const struct ly_ctx *ctx, struct ly_in *in, LYD_FORMAT format, uint32_t parse_options, uint32_t validate_options,
Radek Krejci0f969882020-08-21 16:56:47 +0200288 struct lyd_node **tree)
Radek Krejci7931b192020-06-25 17:05:03 +0200289{
Radek Krejci1798aae2020-07-14 13:26:06 +0200290 LY_ERR ret = LY_SUCCESS;
291 struct lyd_ctx *lydctx = NULL;
292
Radek Krejci7931b192020-06-25 17:05:03 +0200293 LY_CHECK_ARG_RET(ctx, ctx, in, tree, LY_EINVAL);
294 LY_CHECK_ARG_RET(ctx, !(parse_options & ~LYD_PARSE_OPTS_MASK), LY_EINVAL);
295 LY_CHECK_ARG_RET(ctx, !(validate_options & ~LYD_VALIDATE_OPTS_MASK), LY_EINVAL);
296
297 format = lyd_parse_get_format(in, format);
298 LY_CHECK_ARG_RET(ctx, format, LY_EINVAL);
299
Radek Krejci1798aae2020-07-14 13:26:06 +0200300 /* init */
301 *tree = NULL;
302
Michal Vasko63f3d842020-07-08 10:10:14 +0200303 /* remember input position */
304 in->func_start = in->current;
Radek Krejci7931b192020-06-25 17:05:03 +0200305
306 switch (format) {
307 case LYD_XML:
Radek Krejci1798aae2020-07-14 13:26:06 +0200308 LY_CHECK_RET(lyd_parse_xml_data(ctx, in, parse_options, validate_options, tree, &lydctx));
309 break;
Radek Krejci7931b192020-06-25 17:05:03 +0200310 case LYD_JSON:
Radek Krejci1798aae2020-07-14 13:26:06 +0200311 LY_CHECK_RET(lyd_parse_json_data(ctx, in, parse_options, validate_options, tree, &lydctx));
312 break;
Radek Krejci7931b192020-06-25 17:05:03 +0200313 case LYD_LYB:
Radek Krejci1798aae2020-07-14 13:26:06 +0200314 LY_CHECK_RET(lyd_parse_lyb_data(ctx, in, parse_options, validate_options, tree, &lydctx));
315 break;
Michal Vaskoc8a230d2020-08-14 12:17:10 +0200316 case LYD_UNKNOWN:
Radek Krejci7931b192020-06-25 17:05:03 +0200317 LOGINT_RET(ctx);
318 }
319
Radek Krejci1798aae2020-07-14 13:26:06 +0200320 if (!(parse_options & LYD_PARSE_ONLY)) {
321 uint32_t i = 0;
322 const struct lys_module *mod;
323 struct lyd_node *first, *next, **first2;
Radek Krejci7931b192020-06-25 17:05:03 +0200324
Radek Krejci1798aae2020-07-14 13:26:06 +0200325 next = *tree;
326 while (1) {
327 if (validate_options & LYD_VALIDATE_PRESENT) {
328 mod = lyd_data_next_module(&next, &first);
329 } else {
330 mod = lyd_mod_next_module(next, NULL, ctx, &i, &first);
331 }
332 if (!mod) {
333 break;
334 }
335 if (first == *tree) {
336 /* make sure first2 changes are carried to tree */
337 first2 = tree;
338 } else {
339 first2 = &first;
340 }
341
342 /* validate new top-level nodes, autodelete CANNOT occur, all nodes are new */
343 LY_CHECK_GOTO(ret = lyd_validate_new(first2, NULL, mod, NULL), cleanup);
344
345 /* add all top-level defaults for this module */
346 ret = lyd_new_implicit_r(NULL, first2, NULL, mod, &lydctx->unres_node_type, &lydctx->when_check,
Michal Vasko69730152020-10-09 16:30:07 +0200347 (validate_options & LYD_VALIDATE_NO_STATE) ? LYD_IMPLICIT_NO_STATE : 0, NULL);
Radek Krejci1798aae2020-07-14 13:26:06 +0200348 LY_CHECK_GOTO(ret, cleanup);
349
350 /* finish incompletely validated terminal values/attributes and when conditions */
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200351 ret = lyd_validate_unres(tree, &lydctx->when_check, &lydctx->unres_node_type, &lydctx->unres_meta_type, NULL);
Radek Krejci1798aae2020-07-14 13:26:06 +0200352 LY_CHECK_GOTO(ret, cleanup);
353
354 /* perform final validation that assumes the data tree is final */
355 LY_CHECK_GOTO(ret = lyd_validate_final_r(*first2, NULL, mod, validate_options, 0), cleanup);
356 }
357 }
358
359cleanup:
Michal Vaskoafac7822020-10-20 14:22:26 +0200360 lydctx->free(lydctx);
Radek Krejci1798aae2020-07-14 13:26:06 +0200361 if (ret) {
362 lyd_free_all(*tree);
363 *tree = NULL;
364 }
365 return ret;
Radek Krejci7931b192020-06-25 17:05:03 +0200366}
367
368API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +0200369lyd_parse_data_mem(const struct ly_ctx *ctx, const char *data, LYD_FORMAT format, uint32_t parse_options, uint32_t validate_options,
Radek Krejci0f969882020-08-21 16:56:47 +0200370 struct lyd_node **tree)
Radek Krejci7931b192020-06-25 17:05:03 +0200371{
372 LY_ERR ret;
373 struct ly_in *in;
374
375 LY_CHECK_RET(ly_in_new_memory(data, &in));
376 ret = lyd_parse_data(ctx, in, format, parse_options, validate_options, tree);
377
378 ly_in_free(in, 0);
379 return ret;
380}
381
382API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +0200383lyd_parse_data_fd(const struct ly_ctx *ctx, int fd, LYD_FORMAT format, uint32_t parse_options, uint32_t validate_options,
Radek Krejci0f969882020-08-21 16:56:47 +0200384 struct lyd_node **tree)
Radek Krejci7931b192020-06-25 17:05:03 +0200385{
386 LY_ERR ret;
387 struct ly_in *in;
388
389 LY_CHECK_RET(ly_in_new_fd(fd, &in));
390 ret = lyd_parse_data(ctx, in, format, parse_options, validate_options, tree);
391
392 ly_in_free(in, 0);
393 return ret;
394}
395
396API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +0200397lyd_parse_data_path(const struct ly_ctx *ctx, const char *path, LYD_FORMAT format, uint32_t parse_options,
398 uint32_t validate_options, struct lyd_node **tree)
Radek Krejci7931b192020-06-25 17:05:03 +0200399{
400 LY_ERR ret;
401 struct ly_in *in;
402
403 LY_CHECK_RET(ly_in_new_filepath(path, 0, &in));
404 ret = lyd_parse_data(ctx, in, format, parse_options, validate_options, tree);
405
406 ly_in_free(in, 0);
407 return ret;
408}
409
Radek Krejci7931b192020-06-25 17:05:03 +0200410API LY_ERR
411lyd_parse_rpc(const struct ly_ctx *ctx, struct ly_in *in, LYD_FORMAT format, struct lyd_node **tree, struct lyd_node **op)
412{
413 LY_CHECK_ARG_RET(ctx, ctx, in, tree, LY_EINVAL);
414
415 format = lyd_parse_get_format(in, format);
416 LY_CHECK_ARG_RET(ctx, format, LY_EINVAL);
417
Radek Krejci1798aae2020-07-14 13:26:06 +0200418 /* init */
419 *tree = NULL;
420 if (op) {
421 *op = NULL;
422 }
423
Michal Vasko63f3d842020-07-08 10:10:14 +0200424 /* remember input position */
425 in->func_start = in->current;
426
Radek Krejci7931b192020-06-25 17:05:03 +0200427 switch (format) {
428 case LYD_XML:
Michal Vasko63f3d842020-07-08 10:10:14 +0200429 return lyd_parse_xml_rpc(ctx, in, tree, op);
Radek Krejci7931b192020-06-25 17:05:03 +0200430 case LYD_JSON:
Michal Vasko63f3d842020-07-08 10:10:14 +0200431 return lyd_parse_json_rpc(ctx, in, tree, op);
Radek Krejci7931b192020-06-25 17:05:03 +0200432 case LYD_LYB:
Michal Vasko63f3d842020-07-08 10:10:14 +0200433 return lyd_parse_lyb_rpc(ctx, in, tree, op);
Michal Vaskoc8a230d2020-08-14 12:17:10 +0200434 case LYD_UNKNOWN:
435 break;
Radek Krejci7931b192020-06-25 17:05:03 +0200436 }
437
438 LOGINT_RET(ctx);
439}
440
441API LY_ERR
Michal Vasko63f3d842020-07-08 10:10:14 +0200442lyd_parse_reply(const struct lyd_node *request, struct ly_in *in, LYD_FORMAT format, struct lyd_node **tree,
Radek Krejci0f969882020-08-21 16:56:47 +0200443 struct lyd_node **op)
Radek Krejci7931b192020-06-25 17:05:03 +0200444{
445 LY_CHECK_ARG_RET(NULL, request, LY_EINVAL);
Michal Vaskob7be7a82020-08-20 09:09:04 +0200446 LY_CHECK_ARG_RET(LYD_CTX(request), in, tree || op, LY_EINVAL);
Radek Krejci7931b192020-06-25 17:05:03 +0200447
448 format = lyd_parse_get_format(in, format);
Michal Vaskob7be7a82020-08-20 09:09:04 +0200449 LY_CHECK_ARG_RET(LYD_CTX(request), format, LY_EINVAL);
Radek Krejci7931b192020-06-25 17:05:03 +0200450
Radek Krejci1798aae2020-07-14 13:26:06 +0200451 /* init */
452 if (tree) {
453 *tree = NULL;
454 }
455 if (op) {
456 *op = NULL;
457 }
458
Michal Vasko63f3d842020-07-08 10:10:14 +0200459 /* remember input position */
460 in->func_start = in->current;
461
Radek Krejci7931b192020-06-25 17:05:03 +0200462 switch (format) {
463 case LYD_XML:
Michal Vasko63f3d842020-07-08 10:10:14 +0200464 return lyd_parse_xml_reply(request, in, tree, op);
Radek Krejci7931b192020-06-25 17:05:03 +0200465 case LYD_JSON:
Michal Vasko63f3d842020-07-08 10:10:14 +0200466 return lyd_parse_json_reply(request, in, tree, op);
Radek Krejci7931b192020-06-25 17:05:03 +0200467 case LYD_LYB:
Michal Vasko63f3d842020-07-08 10:10:14 +0200468 return lyd_parse_lyb_reply(request, in, tree, op);
Michal Vaskoc8a230d2020-08-14 12:17:10 +0200469 case LYD_UNKNOWN:
470 break;
Radek Krejci7931b192020-06-25 17:05:03 +0200471 }
472
Michal Vaskob7be7a82020-08-20 09:09:04 +0200473 LOGINT_RET(LYD_CTX(request));
Radek Krejci7931b192020-06-25 17:05:03 +0200474}
475
476API LY_ERR
477lyd_parse_notif(const struct ly_ctx *ctx, struct ly_in *in, LYD_FORMAT format, struct lyd_node **tree, struct lyd_node **ntf)
478{
Radek Krejci1798aae2020-07-14 13:26:06 +0200479 LY_CHECK_ARG_RET(ctx, ctx, in, tree || ntf, LY_EINVAL);
Radek Krejci7931b192020-06-25 17:05:03 +0200480
481 format = lyd_parse_get_format(in, format);
482 LY_CHECK_ARG_RET(ctx, format, LY_EINVAL);
483
Radek Krejci1798aae2020-07-14 13:26:06 +0200484 /* init */
485 if (tree) {
486 *tree = NULL;
487 }
488 if (ntf) {
489 *ntf = NULL;
490 }
491
Michal Vasko63f3d842020-07-08 10:10:14 +0200492 /* remember input position */
493 in->func_start = in->current;
494
Radek Krejci7931b192020-06-25 17:05:03 +0200495 switch (format) {
496 case LYD_XML:
Michal Vasko63f3d842020-07-08 10:10:14 +0200497 return lyd_parse_xml_notif(ctx, in, tree, ntf);
Radek Krejci7931b192020-06-25 17:05:03 +0200498 case LYD_JSON:
Michal Vasko63f3d842020-07-08 10:10:14 +0200499 return lyd_parse_json_notif(ctx, in, tree, ntf);
Radek Krejci7931b192020-06-25 17:05:03 +0200500 case LYD_LYB:
Michal Vasko63f3d842020-07-08 10:10:14 +0200501 return lyd_parse_lyb_notif(ctx, in, tree, ntf);
Michal Vaskoc8a230d2020-08-14 12:17:10 +0200502 case LYD_UNKNOWN:
503 break;
Radek Krejci7931b192020-06-25 17:05:03 +0200504 }
505
506 LOGINT_RET(ctx);
Radek Krejcie7b95092019-05-15 11:03:07 +0200507}
Radek Krejci084289f2019-07-09 17:35:30 +0200508
Michal Vasko90932a92020-02-12 14:33:03 +0100509LY_ERR
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200510lyd_create_term(const struct lysc_node *schema, const char *value, size_t value_len, ly_bool *dynamic,
511 LY_PREFIX_FORMAT format, void *prefix_data, uint32_t hints, ly_bool *incomplete, struct lyd_node **node)
Michal Vasko90932a92020-02-12 14:33:03 +0100512{
513 LY_ERR ret;
514 struct lyd_node_term *term;
515
Michal Vasko9b368d32020-02-14 13:53:31 +0100516 assert(schema->nodetype & LYD_NODE_TERM);
517
Michal Vasko90932a92020-02-12 14:33:03 +0100518 term = calloc(1, sizeof *term);
519 LY_CHECK_ERR_RET(!term, LOGMEM(schema->module->ctx), LY_EMEM);
520
521 term->schema = schema;
522 term->prev = (struct lyd_node *)term;
Michal Vasko9b368d32020-02-14 13:53:31 +0100523 term->flags = LYD_NEW;
Michal Vasko90932a92020-02-12 14:33:03 +0100524
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200525 ret = lyd_value_store(schema->module->ctx, &term->value, ((struct lysc_node_leaf *)term->schema)->type, value,
526 value_len, dynamic, format, prefix_data, hints, schema, incomplete, LY_VLOG_LYSC, schema);
527 LY_CHECK_ERR_RET(ret, free(term), ret);
Michal Vasko9b368d32020-02-14 13:53:31 +0100528 lyd_hash((struct lyd_node *)term);
529
530 *node = (struct lyd_node *)term;
531 return ret;
532}
533
534LY_ERR
535lyd_create_term2(const struct lysc_node *schema, const struct lyd_value *val, struct lyd_node **node)
536{
537 LY_ERR ret;
538 struct lyd_node_term *term;
539 struct lysc_type *type;
540
541 assert(schema->nodetype & LYD_NODE_TERM);
Michal Vaskoba99a3e2020-08-18 15:50:05 +0200542 assert(val && val->canonical && val->realtype);
Michal Vasko9b368d32020-02-14 13:53:31 +0100543
544 term = calloc(1, sizeof *term);
545 LY_CHECK_ERR_RET(!term, LOGMEM(schema->module->ctx), LY_EMEM);
546
547 term->schema = schema;
548 term->prev = (struct lyd_node *)term;
549 term->flags = LYD_NEW;
550
551 type = ((struct lysc_node_leaf *)schema)->type;
552 ret = type->plugin->duplicate(schema->module->ctx, val, &term->value);
553 if (ret) {
554 LOGERR(schema->module->ctx, ret, "Value duplication failed.");
555 free(term);
556 return ret;
557 }
558 lyd_hash((struct lyd_node *)term);
Michal Vasko90932a92020-02-12 14:33:03 +0100559
560 *node = (struct lyd_node *)term;
561 return ret;
562}
563
564LY_ERR
565lyd_create_inner(const struct lysc_node *schema, struct lyd_node **node)
566{
567 struct lyd_node_inner *in;
568
Michal Vasko9b368d32020-02-14 13:53:31 +0100569 assert(schema->nodetype & LYD_NODE_INNER);
570
Michal Vasko90932a92020-02-12 14:33:03 +0100571 in = calloc(1, sizeof *in);
572 LY_CHECK_ERR_RET(!in, LOGMEM(schema->module->ctx), LY_EMEM);
573
574 in->schema = schema;
575 in->prev = (struct lyd_node *)in;
Michal Vasko9b368d32020-02-14 13:53:31 +0100576 in->flags = LYD_NEW;
Michal Vasko3383be72020-11-03 17:15:31 +0100577 if ((schema->nodetype == LYS_CONTAINER) && !(schema->flags & LYS_PRESENCE)) {
578 in->flags |= LYD_DEFAULT;
579 }
Michal Vasko90932a92020-02-12 14:33:03 +0100580
Michal Vasko9b368d32020-02-14 13:53:31 +0100581 /* do not hash list with keys, we need them for the hash */
582 if ((schema->nodetype != LYS_LIST) || (schema->flags & LYS_KEYLESS)) {
583 lyd_hash((struct lyd_node *)in);
584 }
Michal Vasko90932a92020-02-12 14:33:03 +0100585
586 *node = (struct lyd_node *)in;
587 return LY_SUCCESS;
588}
589
Michal Vasko90932a92020-02-12 14:33:03 +0100590LY_ERR
Michal Vasko004d3152020-06-11 19:59:22 +0200591lyd_create_list(const struct lysc_node *schema, const struct ly_path_predicate *predicates, struct lyd_node **node)
Michal Vasko90932a92020-02-12 14:33:03 +0100592{
593 LY_ERR ret = LY_SUCCESS;
Michal Vasko90932a92020-02-12 14:33:03 +0100594 struct lyd_node *list = NULL, *key;
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200595 LY_ARRAY_COUNT_TYPE u;
Michal Vasko90932a92020-02-12 14:33:03 +0100596
Michal Vasko004d3152020-06-11 19:59:22 +0200597 assert((schema->nodetype == LYS_LIST) && !(schema->flags & LYS_KEYLESS));
Michal Vasko90932a92020-02-12 14:33:03 +0100598
599 /* create list */
600 LY_CHECK_GOTO(ret = lyd_create_inner(schema, &list), cleanup);
601
Michal Vasko90932a92020-02-12 14:33:03 +0100602 /* create and insert all the keys */
Michal Vasko004d3152020-06-11 19:59:22 +0200603 LY_ARRAY_FOR(predicates, u) {
604 LY_CHECK_GOTO(ret = lyd_create_term2(predicates[u].key, &predicates[u].value, &key), cleanup);
Michal Vasko90932a92020-02-12 14:33:03 +0100605 lyd_insert_node(list, NULL, key);
606 }
607
Michal Vasko9b368d32020-02-14 13:53:31 +0100608 /* hash having all the keys */
609 lyd_hash(list);
610
Michal Vasko90932a92020-02-12 14:33:03 +0100611 /* success */
612 *node = list;
613 list = NULL;
614
615cleanup:
616 lyd_free_tree(list);
Michal Vasko004d3152020-06-11 19:59:22 +0200617 return ret;
618}
619
620static LY_ERR
621lyd_create_list2(const struct lysc_node *schema, const char *keys, size_t keys_len, struct lyd_node **node)
622{
623 LY_ERR ret = LY_SUCCESS;
624 struct lyxp_expr *expr = NULL;
625 uint16_t exp_idx = 0;
626 enum ly_path_pred_type pred_type = 0;
627 struct ly_path_predicate *predicates = NULL;
628
629 /* parse keys */
Michal Vasko6b26e742020-07-17 15:02:10 +0200630 LY_CHECK_GOTO(ret = ly_path_parse_predicate(schema->module->ctx, NULL, keys, keys_len, LY_PATH_PREFIX_OPTIONAL,
Michal Vasko69730152020-10-09 16:30:07 +0200631 LY_PATH_PRED_KEYS, &expr), cleanup);
Michal Vasko004d3152020-06-11 19:59:22 +0200632
633 /* compile them */
Michal Vasko5d24f6c2020-10-13 13:49:06 +0200634 LY_CHECK_GOTO(ret = ly_path_compile_predicate(schema->module->ctx, NULL, NULL, schema, expr, &exp_idx, LY_PREF_JSON,
635 NULL, &predicates, &pred_type), cleanup);
Michal Vasko004d3152020-06-11 19:59:22 +0200636
637 /* create the list node */
638 LY_CHECK_GOTO(ret = lyd_create_list(schema, predicates, node), cleanup);
639
640cleanup:
641 lyxp_expr_free(schema->module->ctx, expr);
Michal Vaskof7e16e22020-10-21 09:24:39 +0200642 ly_path_predicates_free(schema->module->ctx, pred_type, predicates);
Michal Vasko90932a92020-02-12 14:33:03 +0100643 return ret;
644}
645
646LY_ERR
647lyd_create_any(const struct lysc_node *schema, const void *value, LYD_ANYDATA_VALUETYPE value_type, struct lyd_node **node)
648{
649 struct lyd_node_any *any;
650
Michal Vasko9b368d32020-02-14 13:53:31 +0100651 assert(schema->nodetype & LYD_NODE_ANY);
652
Michal Vasko90932a92020-02-12 14:33:03 +0100653 any = calloc(1, sizeof *any);
654 LY_CHECK_ERR_RET(!any, LOGMEM(schema->module->ctx), LY_EMEM);
655
656 any->schema = schema;
657 any->prev = (struct lyd_node *)any;
Michal Vasko9b368d32020-02-14 13:53:31 +0100658 any->flags = LYD_NEW;
Michal Vasko90932a92020-02-12 14:33:03 +0100659
Radek Krejci1798aae2020-07-14 13:26:06 +0200660 /* TODO: convert XML/JSON strings into a opaq data tree */
661 any->value.str = value;
Michal Vasko90932a92020-02-12 14:33:03 +0100662 any->value_type = value_type;
Michal Vasko9b368d32020-02-14 13:53:31 +0100663 lyd_hash((struct lyd_node *)any);
Michal Vasko90932a92020-02-12 14:33:03 +0100664
665 *node = (struct lyd_node *)any;
666 return LY_SUCCESS;
667}
668
Michal Vasko52927e22020-03-16 17:26:14 +0100669LY_ERR
670lyd_create_opaq(const struct ly_ctx *ctx, const char *name, size_t name_len, const char *value, size_t value_len,
Michal Vasko6b5cb2a2020-11-11 19:11:21 +0100671 ly_bool *dynamic, LY_PREFIX_FORMAT format, uint32_t hints, void *val_prefix_data, const char *prefix, size_t pref_len,
Radek Krejci0f969882020-08-21 16:56:47 +0200672 const char *module_key, size_t module_key_len, struct lyd_node **node)
Michal Vasko52927e22020-03-16 17:26:14 +0100673{
Radek Krejci011e4aa2020-09-04 15:22:31 +0200674 LY_ERR ret = LY_SUCCESS;
Michal Vasko52927e22020-03-16 17:26:14 +0100675 struct lyd_node_opaq *opaq;
676
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200677 assert(ctx && name && name_len && format);
Michal Vasko52927e22020-03-16 17:26:14 +0100678
679 if (!value_len) {
680 value = "";
681 }
682
683 opaq = calloc(1, sizeof *opaq);
Michal Vasko6b5cb2a2020-11-11 19:11:21 +0100684 LY_CHECK_ERR_RET(!opaq, LOGMEM(ctx); ly_free_prefix_data(format, val_prefix_data), LY_EMEM);
Michal Vasko52927e22020-03-16 17:26:14 +0100685
686 opaq->prev = (struct lyd_node *)opaq;
Michal Vasko6b5cb2a2020-11-11 19:11:21 +0100687 opaq->val_prefix_data = val_prefix_data;
Radek Krejcid46e46a2020-09-15 14:22:42 +0200688 opaq->format = format;
Radek Krejci011e4aa2020-09-04 15:22:31 +0200689 LY_CHECK_GOTO(ret = lydict_insert(ctx, name, name_len, &opaq->name), finish);
690
Michal Vasko52927e22020-03-16 17:26:14 +0100691 if (pref_len) {
Radek Krejci011e4aa2020-09-04 15:22:31 +0200692 LY_CHECK_GOTO(ret = lydict_insert(ctx, prefix, pref_len, &opaq->prefix.id), finish);
Michal Vasko52927e22020-03-16 17:26:14 +0100693 }
Radek Krejci1798aae2020-07-14 13:26:06 +0200694 if (module_key_len) {
Radek Krejci011e4aa2020-09-04 15:22:31 +0200695 LY_CHECK_GOTO(ret = lydict_insert(ctx, module_key, module_key_len, &opaq->prefix.module_ns), finish);
Radek Krejci1798aae2020-07-14 13:26:06 +0200696 }
697
Michal Vasko52927e22020-03-16 17:26:14 +0100698 if (dynamic && *dynamic) {
Radek Krejci011e4aa2020-09-04 15:22:31 +0200699 LY_CHECK_GOTO(ret = lydict_insert_zc(ctx, (char *)value, &opaq->value), finish);
Michal Vasko52927e22020-03-16 17:26:14 +0100700 *dynamic = 0;
701 } else {
Radek Krejci011e4aa2020-09-04 15:22:31 +0200702 LY_CHECK_GOTO(ret = lydict_insert(ctx, value, value_len, &opaq->value), finish);
Michal Vasko52927e22020-03-16 17:26:14 +0100703 }
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200704 opaq->hints = hints;
Michal Vasko52927e22020-03-16 17:26:14 +0100705 opaq->ctx = ctx;
706
Radek Krejci011e4aa2020-09-04 15:22:31 +0200707finish:
708 if (ret) {
709 lyd_free_tree((struct lyd_node *)opaq);
710 } else {
711 *node = (struct lyd_node *)opaq;
712 }
713 return ret;
Michal Vasko52927e22020-03-16 17:26:14 +0100714}
715
Michal Vasko3a41dff2020-07-15 14:30:28 +0200716API LY_ERR
Radek Krejci41ac9942020-11-02 14:47:56 +0100717lyd_new_inner(struct lyd_node *parent, const struct lys_module *module, const char *name, ly_bool output, struct lyd_node **node)
Michal Vasko013a8182020-03-03 10:46:53 +0100718{
719 struct lyd_node *ret = NULL;
720 const struct lysc_node *schema;
721 struct ly_ctx *ctx = parent ? parent->schema->module->ctx : (module ? module->ctx : NULL);
722
Michal Vasko6027eb92020-07-15 16:37:30 +0200723 LY_CHECK_ARG_RET(ctx, parent || module, parent || node, name, LY_EINVAL);
Michal Vasko013a8182020-03-03 10:46:53 +0100724
Michal Vaskof03ed032020-03-04 13:31:44 +0100725 if (!module) {
726 module = parent->schema->module;
727 }
728
Michal Vasko3a41dff2020-07-15 14:30:28 +0200729 schema = lys_find_child(parent ? parent->schema : NULL, module, name, 0,
Radek Krejci41ac9942020-11-02 14:47:56 +0100730 LYS_CONTAINER | LYS_NOTIF | LYS_RPC | LYS_ACTION, output ? LYS_GETNEXT_OUTPUT : 0);
Michal Vasko3a41dff2020-07-15 14:30:28 +0200731 LY_CHECK_ERR_RET(!schema, LOGERR(ctx, LY_EINVAL, "Inner node (and not a list) \"%s\" not found.", name), LY_ENOTFOUND);
Michal Vasko013a8182020-03-03 10:46:53 +0100732
Michal Vasko3a41dff2020-07-15 14:30:28 +0200733 LY_CHECK_RET(lyd_create_inner(schema, &ret));
734 if (parent) {
Michal Vasko013a8182020-03-03 10:46:53 +0100735 lyd_insert_node(parent, NULL, ret);
736 }
Michal Vasko3a41dff2020-07-15 14:30:28 +0200737
738 if (node) {
739 *node = ret;
740 }
741 return LY_SUCCESS;
Michal Vasko013a8182020-03-03 10:46:53 +0100742}
743
Michal Vasko3a41dff2020-07-15 14:30:28 +0200744API LY_ERR
Radek Krejci41ac9942020-11-02 14:47:56 +0100745lyd_new_list(struct lyd_node *parent, const struct lys_module *module, const char *name, ly_bool output, struct lyd_node **node, ...)
Michal Vasko013a8182020-03-03 10:46:53 +0100746{
747 struct lyd_node *ret = NULL, *key;
748 const struct lysc_node *schema, *key_s;
749 struct ly_ctx *ctx = parent ? parent->schema->module->ctx : (module ? module->ctx : NULL);
750 va_list ap;
751 const char *key_val;
752 LY_ERR rc = LY_SUCCESS;
753
Michal Vasko6027eb92020-07-15 16:37:30 +0200754 LY_CHECK_ARG_RET(ctx, parent || module, parent || node, name, LY_EINVAL);
Michal Vasko013a8182020-03-03 10:46:53 +0100755
Michal Vaskof03ed032020-03-04 13:31:44 +0100756 if (!module) {
757 module = parent->schema->module;
758 }
759
Radek Krejci41ac9942020-11-02 14:47:56 +0100760 schema = lys_find_child(parent ? parent->schema : NULL, module, name, 0, LYS_LIST, output ? LYS_GETNEXT_OUTPUT : 0);
Michal Vasko3a41dff2020-07-15 14:30:28 +0200761 LY_CHECK_ERR_RET(!schema, LOGERR(ctx, LY_EINVAL, "List node \"%s\" not found.", name), LY_ENOTFOUND);
Michal Vasko013a8182020-03-03 10:46:53 +0100762
763 /* create list inner node */
Michal Vasko3a41dff2020-07-15 14:30:28 +0200764 LY_CHECK_RET(lyd_create_inner(schema, &ret));
Michal Vasko013a8182020-03-03 10:46:53 +0100765
Michal Vasko3a41dff2020-07-15 14:30:28 +0200766 va_start(ap, node);
Michal Vasko013a8182020-03-03 10:46:53 +0100767
768 /* create and insert all the keys */
769 for (key_s = lysc_node_children(schema, 0); key_s && (key_s->flags & LYS_KEY); key_s = key_s->next) {
770 key_val = va_arg(ap, const char *);
771
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200772 rc = lyd_create_term(key_s, key_val, key_val ? strlen(key_val) : 0, NULL, LY_PREF_JSON, NULL, LYD_HINT_DATA,
773 NULL, &key);
774 LY_CHECK_GOTO(rc, cleanup);
Michal Vasko013a8182020-03-03 10:46:53 +0100775 lyd_insert_node(ret, NULL, key);
776 }
777
Michal Vasko013a8182020-03-03 10:46:53 +0100778 if (parent) {
779 lyd_insert_node(parent, NULL, ret);
780 }
781
782cleanup:
Michal Vasko3a41dff2020-07-15 14:30:28 +0200783 va_end(ap);
Michal Vasko013a8182020-03-03 10:46:53 +0100784 if (rc) {
785 lyd_free_tree(ret);
786 ret = NULL;
Michal Vasko3a41dff2020-07-15 14:30:28 +0200787 } else if (node) {
788 *node = ret;
Michal Vasko013a8182020-03-03 10:46:53 +0100789 }
Michal Vasko3a41dff2020-07-15 14:30:28 +0200790 return rc;
Michal Vasko013a8182020-03-03 10:46:53 +0100791}
792
Michal Vasko3a41dff2020-07-15 14:30:28 +0200793API LY_ERR
794lyd_new_list2(struct lyd_node *parent, const struct lys_module *module, const char *name, const char *keys,
Radek Krejci41ac9942020-11-02 14:47:56 +0100795 ly_bool output, struct lyd_node **node)
Michal Vasko013a8182020-03-03 10:46:53 +0100796{
797 struct lyd_node *ret = NULL;
798 const struct lysc_node *schema;
799 struct ly_ctx *ctx = parent ? parent->schema->module->ctx : (module ? module->ctx : NULL);
800
Michal Vasko6027eb92020-07-15 16:37:30 +0200801 LY_CHECK_ARG_RET(ctx, parent || module, parent || node, name, LY_EINVAL);
Michal Vasko013a8182020-03-03 10:46:53 +0100802
Michal Vaskof03ed032020-03-04 13:31:44 +0100803 if (!module) {
804 module = parent->schema->module;
805 }
Michal Vasko004d3152020-06-11 19:59:22 +0200806 if (!keys) {
807 keys = "";
808 }
Michal Vaskof03ed032020-03-04 13:31:44 +0100809
Michal Vasko004d3152020-06-11 19:59:22 +0200810 /* find schema node */
Radek Krejci41ac9942020-11-02 14:47:56 +0100811 schema = lys_find_child(parent ? parent->schema : NULL, module, name, 0, LYS_LIST, output ? LYS_GETNEXT_OUTPUT : 0);
Michal Vasko3a41dff2020-07-15 14:30:28 +0200812 LY_CHECK_ERR_RET(!schema, LOGERR(ctx, LY_EINVAL, "List node \"%s\" not found.", name), LY_ENOTFOUND);
Michal Vasko013a8182020-03-03 10:46:53 +0100813
Michal Vasko004d3152020-06-11 19:59:22 +0200814 if ((schema->flags & LYS_KEYLESS) && !keys[0]) {
815 /* key-less list */
Michal Vasko3a41dff2020-07-15 14:30:28 +0200816 LY_CHECK_RET(lyd_create_inner(schema, &ret));
Michal Vasko004d3152020-06-11 19:59:22 +0200817 } else {
818 /* create the list node */
Michal Vasko3a41dff2020-07-15 14:30:28 +0200819 LY_CHECK_RET(lyd_create_list2(schema, keys, strlen(keys), &ret));
Michal Vasko004d3152020-06-11 19:59:22 +0200820 }
Michal Vasko004d3152020-06-11 19:59:22 +0200821 if (parent) {
Michal Vasko013a8182020-03-03 10:46:53 +0100822 lyd_insert_node(parent, NULL, ret);
823 }
Michal Vasko3a41dff2020-07-15 14:30:28 +0200824
825 if (node) {
826 *node = ret;
827 }
828 return LY_SUCCESS;
Michal Vasko013a8182020-03-03 10:46:53 +0100829}
830
Michal Vasko3a41dff2020-07-15 14:30:28 +0200831API LY_ERR
832lyd_new_term(struct lyd_node *parent, const struct lys_module *module, const char *name, const char *val_str,
Radek Krejci41ac9942020-11-02 14:47:56 +0100833 ly_bool output, struct lyd_node **node)
Michal Vasko013a8182020-03-03 10:46:53 +0100834{
Michal Vaskocbff3e92020-05-27 12:56:41 +0200835 LY_ERR rc;
Michal Vasko013a8182020-03-03 10:46:53 +0100836 struct lyd_node *ret = NULL;
837 const struct lysc_node *schema;
838 struct ly_ctx *ctx = parent ? parent->schema->module->ctx : (module ? module->ctx : NULL);
839
Michal Vasko6027eb92020-07-15 16:37:30 +0200840 LY_CHECK_ARG_RET(ctx, parent || module, parent || node, name, LY_EINVAL);
Michal Vasko013a8182020-03-03 10:46:53 +0100841
Michal Vaskof03ed032020-03-04 13:31:44 +0100842 if (!module) {
843 module = parent->schema->module;
844 }
845
Radek Krejci41ac9942020-11-02 14:47:56 +0100846 schema = lys_find_child(parent ? parent->schema : NULL, module, name, 0, LYD_NODE_TERM, output ? LYS_GETNEXT_OUTPUT : 0);
Michal Vasko3a41dff2020-07-15 14:30:28 +0200847 LY_CHECK_ERR_RET(!schema, LOGERR(ctx, LY_EINVAL, "Term node \"%s\" not found.", name), LY_ENOTFOUND);
Michal Vasko013a8182020-03-03 10:46:53 +0100848
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200849 rc = lyd_create_term(schema, val_str, val_str ? strlen(val_str) : 0, NULL, LY_PREF_JSON, NULL, LYD_HINT_DATA, NULL,
850 &ret);
851 LY_CHECK_RET(rc);
Michal Vaskocbff3e92020-05-27 12:56:41 +0200852 if (parent) {
Michal Vasko013a8182020-03-03 10:46:53 +0100853 lyd_insert_node(parent, NULL, ret);
854 }
Michal Vasko3a41dff2020-07-15 14:30:28 +0200855
856 if (node) {
857 *node = ret;
858 }
859 return LY_SUCCESS;
Michal Vasko013a8182020-03-03 10:46:53 +0100860}
861
Michal Vasko3a41dff2020-07-15 14:30:28 +0200862API LY_ERR
Michal Vasko013a8182020-03-03 10:46:53 +0100863lyd_new_any(struct lyd_node *parent, const struct lys_module *module, const char *name, const void *value,
Radek Krejci41ac9942020-11-02 14:47:56 +0100864 LYD_ANYDATA_VALUETYPE value_type, ly_bool output, struct lyd_node **node)
Michal Vasko013a8182020-03-03 10:46:53 +0100865{
866 struct lyd_node *ret = NULL;
867 const struct lysc_node *schema;
868 struct ly_ctx *ctx = parent ? parent->schema->module->ctx : (module ? module->ctx : NULL);
869
Michal Vasko6027eb92020-07-15 16:37:30 +0200870 LY_CHECK_ARG_RET(ctx, parent || module, parent || node, name, LY_EINVAL);
Michal Vasko013a8182020-03-03 10:46:53 +0100871
Michal Vaskof03ed032020-03-04 13:31:44 +0100872 if (!module) {
873 module = parent->schema->module;
874 }
875
Radek Krejci41ac9942020-11-02 14:47:56 +0100876 schema = lys_find_child(parent ? parent->schema : NULL, module, name, 0, LYD_NODE_ANY, output ? LYS_GETNEXT_OUTPUT : 0);
Michal Vasko3a41dff2020-07-15 14:30:28 +0200877 LY_CHECK_ERR_RET(!schema, LOGERR(ctx, LY_EINVAL, "Any node \"%s\" not found.", name), LY_ENOTFOUND);
Michal Vasko013a8182020-03-03 10:46:53 +0100878
Michal Vasko3a41dff2020-07-15 14:30:28 +0200879 LY_CHECK_RET(lyd_create_any(schema, value, value_type, &ret));
880 if (parent) {
Michal Vasko013a8182020-03-03 10:46:53 +0100881 lyd_insert_node(parent, NULL, ret);
882 }
Michal Vasko3a41dff2020-07-15 14:30:28 +0200883
884 if (node) {
885 *node = ret;
886 }
887 return LY_SUCCESS;
Michal Vasko013a8182020-03-03 10:46:53 +0100888}
889
Michal Vasko4490d312020-06-16 13:08:55 +0200890/**
891 * @brief Update node value.
892 *
893 * @param[in] node Node to update.
894 * @param[in] value New value to set.
895 * @param[in] value_type Type of @p value for any node.
896 * @param[out] new_parent Set to @p node if the value was updated, otherwise set to NULL.
897 * @param[out] new_node Set to @p node if the value was updated, otherwise set to NULL.
898 * @return LY_ERR value.
899 */
Michal Vasko00cbf532020-06-15 13:58:47 +0200900static LY_ERR
901lyd_new_path_update(struct lyd_node *node, const void *value, LYD_ANYDATA_VALUETYPE value_type,
Radek Krejci0f969882020-08-21 16:56:47 +0200902 struct lyd_node **new_parent, struct lyd_node **new_node)
Michal Vasko00cbf532020-06-15 13:58:47 +0200903{
904 LY_ERR ret = LY_SUCCESS;
905 struct lyd_node *new_any;
906
907 switch (node->schema->nodetype) {
908 case LYS_CONTAINER:
909 case LYS_NOTIF:
910 case LYS_RPC:
911 case LYS_ACTION:
912 case LYS_LIST:
913 case LYS_LEAFLIST:
914 /* if it exists, there is nothing to update */
915 *new_parent = NULL;
916 *new_node = NULL;
917 break;
918 case LYS_LEAF:
919 ret = lyd_change_term(node, value);
920 if ((ret == LY_SUCCESS) || (ret == LY_EEXIST)) {
921 /* there was an actual change (at least of the default flag) */
922 *new_parent = node;
923 *new_node = node;
924 ret = LY_SUCCESS;
925 } else if (ret == LY_ENOT) {
926 /* no change */
927 *new_parent = NULL;
928 *new_node = NULL;
929 ret = LY_SUCCESS;
930 } /* else error */
931 break;
932 case LYS_ANYDATA:
933 case LYS_ANYXML:
934 /* create a new any node */
935 LY_CHECK_RET(lyd_create_any(node->schema, value, value_type, &new_any));
936
937 /* compare with the existing one */
Michal Vasko8f359bf2020-07-28 10:41:15 +0200938 if (lyd_compare_single(node, new_any, 0)) {
Michal Vasko00cbf532020-06-15 13:58:47 +0200939 /* not equal, switch values (so that we can use generic node free) */
940 ((struct lyd_node_any *)new_any)->value = ((struct lyd_node_any *)node)->value;
941 ((struct lyd_node_any *)new_any)->value_type = ((struct lyd_node_any *)node)->value_type;
942 ((struct lyd_node_any *)node)->value.str = value;
943 ((struct lyd_node_any *)node)->value_type = value_type;
944
945 *new_parent = node;
946 *new_node = node;
947 } else {
948 /* they are equal */
949 *new_parent = NULL;
950 *new_node = NULL;
951 }
952 lyd_free_tree(new_any);
953 break;
954 default:
Michal Vaskob7be7a82020-08-20 09:09:04 +0200955 LOGINT(LYD_CTX(node));
Michal Vasko00cbf532020-06-15 13:58:47 +0200956 ret = LY_EINT;
957 break;
958 }
959
960 return ret;
961}
962
Michal Vasko3a41dff2020-07-15 14:30:28 +0200963API LY_ERR
Michal Vasko871a0252020-11-11 18:35:24 +0100964lyd_new_meta(const struct ly_ctx *ctx, struct lyd_node *parent, const struct lys_module *module, const char *name,
965 const char *val_str, ly_bool clear_dflt, struct lyd_meta **meta)
Michal Vaskod86997b2020-05-26 15:19:54 +0200966{
Michal Vaskod86997b2020-05-26 15:19:54 +0200967 const char *prefix, *tmp;
Michal Vaskod86997b2020-05-26 15:19:54 +0200968 size_t pref_len, name_len;
969
Michal Vasko871a0252020-11-11 18:35:24 +0100970 LY_CHECK_ARG_RET(NULL, ctx, name, module || strchr(name, ':'), parent || meta, LY_EINVAL);
Michal Vasko00cbf532020-06-15 13:58:47 +0200971
Michal Vasko871a0252020-11-11 18:35:24 +0100972 if (parent && !parent->schema) {
973 LOGERR(ctx, LY_EINVAL, "Cannot add metadata to an opaque node \"%s\".", ((struct lyd_node_opaq *)parent)->name);
974 return LY_EINVAL;
975 }
Michal Vaskod86997b2020-05-26 15:19:54 +0200976
977 /* parse the name */
978 tmp = name;
979 if (ly_parse_nodeid(&tmp, &prefix, &pref_len, &name, &name_len) || tmp[0]) {
980 LOGERR(ctx, LY_EINVAL, "Metadata name \"%s\" is not valid.", name);
Michal Vasko871a0252020-11-11 18:35:24 +0100981 return LY_EINVAL;
Michal Vaskod86997b2020-05-26 15:19:54 +0200982 }
983
984 /* find the module */
985 if (prefix) {
Radek Krejci0ad51f12020-07-16 12:08:12 +0200986 module = ly_ctx_get_module_implemented2(ctx, prefix, pref_len);
Michal Vasko3a41dff2020-07-15 14:30:28 +0200987 LY_CHECK_ERR_RET(!module, LOGERR(ctx, LY_EINVAL, "Module \"%.*s\" not found.", pref_len, prefix), LY_ENOTFOUND);
Michal Vaskod86997b2020-05-26 15:19:54 +0200988 }
989
990 /* set value if none */
991 if (!val_str) {
992 val_str = "";
993 }
994
Michal Vasko871a0252020-11-11 18:35:24 +0100995 return lyd_create_meta(parent, meta, module, name, name_len, val_str, strlen(val_str), NULL, LY_PREF_JSON,
996 NULL, LYD_HINT_DATA, clear_dflt, NULL);
997}
Michal Vasko3a41dff2020-07-15 14:30:28 +0200998
Michal Vasko3a41dff2020-07-15 14:30:28 +0200999 }
Michal Vaskod86997b2020-05-26 15:19:54 +02001000}
1001
Michal Vasko3a41dff2020-07-15 14:30:28 +02001002API LY_ERR
Michal Vasko00cbf532020-06-15 13:58:47 +02001003lyd_new_opaq(struct lyd_node *parent, const struct ly_ctx *ctx, const char *name, const char *value,
Radek Krejci0f969882020-08-21 16:56:47 +02001004 const char *module_name, struct lyd_node **node)
Michal Vasko00cbf532020-06-15 13:58:47 +02001005{
1006 struct lyd_node *ret = NULL;
1007
Michal Vasko6027eb92020-07-15 16:37:30 +02001008 LY_CHECK_ARG_RET(ctx, parent || ctx, parent || node, name, module_name, LY_EINVAL);
Michal Vasko00cbf532020-06-15 13:58:47 +02001009
1010 if (!ctx) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001011 ctx = LYD_CTX(parent);
Michal Vasko00cbf532020-06-15 13:58:47 +02001012 }
1013 if (!value) {
1014 value = "";
1015 }
1016
Michal Vasko6b5cb2a2020-11-11 19:11:21 +01001017 LY_CHECK_RET(lyd_create_opaq(ctx, name, strlen(name), value, strlen(value), NULL, LY_PREF_JSON, 0, NULL, NULL, 0,
Michal Vaskofeca4fb2020-10-05 08:58:40 +02001018 module_name, strlen(module_name), &ret));
Michal Vasko3a41dff2020-07-15 14:30:28 +02001019 if (parent) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001020 lyd_insert_node(parent, NULL, ret);
1021 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02001022
1023 if (node) {
1024 *node = ret;
1025 }
1026 return LY_SUCCESS;
Michal Vasko00cbf532020-06-15 13:58:47 +02001027}
1028
Michal Vasko3a41dff2020-07-15 14:30:28 +02001029API LY_ERR
1030lyd_new_attr(struct lyd_node *parent, const char *module_name, const char *name, const char *val_str,
Radek Krejci0f969882020-08-21 16:56:47 +02001031 struct lyd_attr **attr)
Michal Vasko00cbf532020-06-15 13:58:47 +02001032{
Radek Krejci1798aae2020-07-14 13:26:06 +02001033 struct lyd_attr *ret = NULL;
Michal Vasko00cbf532020-06-15 13:58:47 +02001034 const struct ly_ctx *ctx;
1035 const char *prefix, *tmp;
1036 size_t pref_len, name_len;
1037
Michal Vasko3a41dff2020-07-15 14:30:28 +02001038 LY_CHECK_ARG_RET(NULL, parent, !parent->schema, name, LY_EINVAL);
Michal Vasko00cbf532020-06-15 13:58:47 +02001039
Michal Vaskob7be7a82020-08-20 09:09:04 +02001040 ctx = LYD_CTX(parent);
Michal Vasko00cbf532020-06-15 13:58:47 +02001041
1042 /* parse the name */
1043 tmp = name;
1044 if (ly_parse_nodeid(&tmp, &prefix, &pref_len, &name, &name_len) || tmp[0]) {
1045 LOGERR(ctx, LY_EINVAL, "Metadata name \"%s\" is not valid.", name);
Michal Vasko3a41dff2020-07-15 14:30:28 +02001046 return LY_EVALID;
Michal Vasko00cbf532020-06-15 13:58:47 +02001047 }
1048
1049 /* set value if none */
1050 if (!val_str) {
1051 val_str = "";
1052 }
1053
Michal Vasko6b5cb2a2020-11-11 19:11:21 +01001054 LY_CHECK_RET(lyd_create_attr(parent, &ret, ctx, name, name_len, val_str, strlen(val_str), NULL, LY_PREF_JSON, 0, NULL,
Michal Vasko69730152020-10-09 16:30:07 +02001055 prefix, pref_len, module_name, module_name ? strlen(module_name) : 0));
Michal Vasko3a41dff2020-07-15 14:30:28 +02001056
1057 if (attr) {
1058 *attr = ret;
1059 }
1060 return LY_SUCCESS;
Michal Vasko00cbf532020-06-15 13:58:47 +02001061}
1062
1063API LY_ERR
1064lyd_change_term(struct lyd_node *term, const char *val_str)
1065{
1066 LY_ERR ret = LY_SUCCESS;
1067 struct lysc_type *type;
1068 struct lyd_node_term *t;
1069 struct lyd_node *parent;
1070 struct lyd_value val = {0};
Radek Krejci857189e2020-09-01 13:26:36 +02001071 ly_bool dflt_change, val_change;
Michal Vasko00cbf532020-06-15 13:58:47 +02001072
1073 LY_CHECK_ARG_RET(NULL, term, term->schema, term->schema->nodetype & LYD_NODE_TERM, LY_EINVAL);
1074
1075 if (!val_str) {
1076 val_str = "";
1077 }
1078 t = (struct lyd_node_term *)term;
1079 type = ((struct lysc_node_leaf *)term->schema)->type;
1080
1081 /* parse the new value */
Michal Vaskofeca4fb2020-10-05 08:58:40 +02001082 ret = lyd_value_store(LYD_CTX(term), &val, type, val_str, strlen(val_str), NULL, LY_PREF_JSON, NULL, LYD_HINT_DATA,
1083 term->schema, NULL, LY_VLOG_LYD, term);
1084 LY_CHECK_GOTO(ret, cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001085
1086 /* compare original and new value */
1087 if (type->plugin->compare(&t->value, &val)) {
1088 /* values differ, switch them */
Michal Vaskob7be7a82020-08-20 09:09:04 +02001089 type->plugin->free(LYD_CTX(term), &t->value);
Michal Vasko00cbf532020-06-15 13:58:47 +02001090 t->value = val;
1091 memset(&val, 0, sizeof val);
1092 val_change = 1;
1093 } else {
1094 val_change = 0;
1095 }
1096
1097 /* always clear the default flag */
1098 if (term->flags & LYD_DEFAULT) {
1099 for (parent = term; parent; parent = (struct lyd_node *)parent->parent) {
1100 parent->flags &= ~LYD_DEFAULT;
1101 }
1102 dflt_change = 1;
1103 } else {
1104 dflt_change = 0;
1105 }
1106
1107 if (val_change || dflt_change) {
1108 /* make the node non-validated */
1109 term->flags &= LYD_NEW;
1110 }
1111
1112 if (val_change) {
1113 if (term->schema->nodetype == LYS_LEAFLIST) {
1114 /* leaf-list needs to be hashed again and re-inserted into parent */
1115 lyd_unlink_hash(term);
1116 lyd_hash(term);
1117 LY_CHECK_GOTO(ret = lyd_insert_hash(term), cleanup);
1118 } else if ((term->schema->flags & LYS_KEY) && term->parent) {
1119 /* list needs to be updated if its key was changed */
1120 assert(term->parent->schema->nodetype == LYS_LIST);
1121 lyd_unlink_hash((struct lyd_node *)term->parent);
1122 lyd_hash((struct lyd_node *)term->parent);
1123 LY_CHECK_GOTO(ret = lyd_insert_hash((struct lyd_node *)term->parent), cleanup);
1124 } /* else leaf that is not a key, its value is not used for its hash so it does not change */
1125 }
1126
1127 /* retrun value */
1128 if (!val_change) {
1129 if (dflt_change) {
1130 /* only default flag change */
1131 ret = LY_EEXIST;
1132 } else {
1133 /* no change */
1134 ret = LY_ENOT;
1135 }
1136 } /* else value changed, LY_SUCCESS */
1137
1138cleanup:
Michal Vaskob7be7a82020-08-20 09:09:04 +02001139 type->plugin->free(LYD_CTX(term), &val);
Michal Vasko00cbf532020-06-15 13:58:47 +02001140 return ret;
1141}
1142
Michal Vasko41586352020-07-13 13:54:25 +02001143API LY_ERR
1144lyd_change_meta(struct lyd_meta *meta, const char *val_str)
1145{
1146 LY_ERR ret = LY_SUCCESS;
Radek Krejci2b18bf12020-11-06 11:20:20 +01001147 struct lyd_meta *m2 = NULL;
Michal Vasko41586352020-07-13 13:54:25 +02001148 struct lyd_value val;
Radek Krejci857189e2020-09-01 13:26:36 +02001149 ly_bool val_change;
Michal Vasko41586352020-07-13 13:54:25 +02001150
1151 LY_CHECK_ARG_RET(NULL, meta, LY_EINVAL);
1152
1153 if (!val_str) {
1154 val_str = "";
1155 }
1156
1157 /* parse the new value into a new meta structure */
1158 LY_CHECK_GOTO(ret = lyd_create_meta(NULL, &m2, meta->annotation->module, meta->name, strlen(meta->name), val_str,
Michal Vasko871a0252020-11-11 18:35:24 +01001159 strlen(val_str), NULL, LY_PREF_JSON, NULL, LYD_HINT_DATA, 0, NULL), cleanup);
Michal Vasko41586352020-07-13 13:54:25 +02001160
1161 /* compare original and new value */
1162 if (lyd_compare_meta(meta, m2)) {
1163 /* values differ, switch them */
1164 val = meta->value;
1165 meta->value = m2->value;
1166 m2->value = val;
1167 val_change = 1;
1168 } else {
1169 val_change = 0;
1170 }
1171
1172 /* retrun value */
1173 if (!val_change) {
1174 /* no change */
1175 ret = LY_ENOT;
1176 } /* else value changed, LY_SUCCESS */
1177
1178cleanup:
1179 return ret;
1180}
1181
Michal Vasko3a41dff2020-07-15 14:30:28 +02001182API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02001183lyd_new_path(struct lyd_node *parent, const struct ly_ctx *ctx, const char *path, const char *value, uint32_t options,
Radek Krejci0f969882020-08-21 16:56:47 +02001184 struct lyd_node **node)
Michal Vasko00cbf532020-06-15 13:58:47 +02001185{
Michal Vasko3a41dff2020-07-15 14:30:28 +02001186 return lyd_new_path2(parent, ctx, path, value, 0, options, node, NULL);
Michal Vasko00cbf532020-06-15 13:58:47 +02001187}
1188
1189API LY_ERR
1190lyd_new_path2(struct lyd_node *parent, const struct ly_ctx *ctx, const char *path, const void *value,
Radek Krejci1deb5be2020-08-26 16:43:36 +02001191 LYD_ANYDATA_VALUETYPE value_type, uint32_t options, struct lyd_node **new_parent, struct lyd_node **new_node)
Michal Vasko00cbf532020-06-15 13:58:47 +02001192{
1193 LY_ERR ret = LY_SUCCESS, r;
1194 struct lyxp_expr *exp = NULL;
1195 struct ly_path *p = NULL;
1196 struct lyd_node *nparent = NULL, *nnode = NULL, *node = NULL, *cur_parent;
1197 const struct lysc_node *schema;
Michal Vaskofd69e1d2020-07-03 11:57:17 +02001198 LY_ARRAY_COUNT_TYPE path_idx = 0;
Michal Vasko00cbf532020-06-15 13:58:47 +02001199 struct ly_path_predicate *pred;
1200
1201 LY_CHECK_ARG_RET(ctx, parent || ctx, path, (path[0] == '/') || parent, LY_EINVAL);
1202
1203 if (!ctx) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001204 ctx = LYD_CTX(parent);
Michal Vasko00cbf532020-06-15 13:58:47 +02001205 }
1206
1207 /* parse path */
Michal Vasko6b26e742020-07-17 15:02:10 +02001208 LY_CHECK_GOTO(ret = ly_path_parse(ctx, NULL, path, strlen(path), LY_PATH_BEGIN_EITHER, LY_PATH_LREF_FALSE,
Michal Vasko69730152020-10-09 16:30:07 +02001209 LY_PATH_PREFIX_OPTIONAL, LY_PATH_PRED_SIMPLE, &exp), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001210
1211 /* compile path */
1212 LY_CHECK_GOTO(ret = ly_path_compile(ctx, NULL, parent ? parent->schema : NULL, exp, LY_PATH_LREF_FALSE,
Michal Vasko5d24f6c2020-10-13 13:49:06 +02001213 options & LYD_NEW_PATH_OUTPUT ? LY_PATH_OPER_OUTPUT : LY_PATH_OPER_INPUT, LY_PATH_TARGET_MANY, LY_PREF_JSON,
1214 NULL, &p), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001215
Michal Vaskofd69e1d2020-07-03 11:57:17 +02001216 schema = p[LY_ARRAY_COUNT(p) - 1].node;
Michal Vasko69730152020-10-09 16:30:07 +02001217 if ((schema->nodetype == LYS_LIST) && (p[LY_ARRAY_COUNT(p) - 1].pred_type == LY_PATH_PREDTYPE_NONE) &&
Radek Krejci092e33c2020-10-12 15:33:10 +02001218 !(options & LYD_NEW_PATH_OPAQ)) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001219 LOGVAL(ctx, LY_VLOG_NONE, NULL, LYVE_XPATH, "Predicate missing for %s \"%s\" in path.",
Michal Vasko69730152020-10-09 16:30:07 +02001220 lys_nodetype2str(schema->nodetype), schema->name);
Michal Vasko00cbf532020-06-15 13:58:47 +02001221 ret = LY_EINVAL;
1222 goto cleanup;
Michal Vaskofd69e1d2020-07-03 11:57:17 +02001223 } else if ((schema->nodetype == LYS_LEAFLIST) && (p[LY_ARRAY_COUNT(p) - 1].pred_type == LY_PATH_PREDTYPE_NONE)) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001224 /* parse leafref value into a predicate, if not defined in the path */
Michal Vaskofd69e1d2020-07-03 11:57:17 +02001225 p[LY_ARRAY_COUNT(p) - 1].pred_type = LY_PATH_PREDTYPE_LEAFLIST;
1226 LY_ARRAY_NEW_GOTO(ctx, p[LY_ARRAY_COUNT(p) - 1].predicates, pred, ret, cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001227
1228 if (!value) {
1229 value = "";
1230 }
1231
1232 r = LY_SUCCESS;
Radek Krejci092e33c2020-10-12 15:33:10 +02001233 if (options & LYD_NEW_PATH_OPAQ) {
Michal Vaskof937cfe2020-08-03 16:07:12 +02001234 r = lys_value_validate(NULL, schema, value, strlen(value));
Michal Vasko00cbf532020-06-15 13:58:47 +02001235 }
1236 if (!r) {
Michal Vaskofeca4fb2020-10-05 08:58:40 +02001237 ret = lyd_value_store(ctx, &pred->value, ((struct lysc_node_leaflist *)schema)->type, value, strlen(value),
1238 NULL, LY_PREF_JSON, NULL, LYD_HINT_DATA, schema, NULL, LY_VLOG_LYSC, schema);
1239 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskoae875662020-10-21 10:33:17 +02001240 ++((struct lysc_type *)pred->value.realtype)->refcount;
Michal Vasko00cbf532020-06-15 13:58:47 +02001241 } /* else we have opaq flag and the value is not valid, leavne no predicate and then create an opaque node */
1242 }
1243
1244 /* try to find any existing nodes in the path */
1245 if (parent) {
1246 ret = ly_path_eval_partial(p, parent, &path_idx, &node);
1247 if (ret == LY_SUCCESS) {
1248 /* the node exists, are we supposed to update it or is it just a default? */
Radek Krejci092e33c2020-10-12 15:33:10 +02001249 if (!(options & LYD_NEW_PATH_UPDATE) && !(node->flags & LYD_DEFAULT)) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001250 LOGERR(ctx, LY_EEXIST, "Path \"%s\" already exists", path);
1251 ret = LY_EEXIST;
1252 goto cleanup;
1253 }
1254
1255 /* update the existing node */
1256 ret = lyd_new_path_update(node, value, value_type, &nparent, &nnode);
1257 goto cleanup;
1258 } else if (ret == LY_EINCOMPLETE) {
1259 /* some nodes were found, adjust the iterator to the next segment */
1260 ++path_idx;
1261 } else if (ret == LY_ENOTFOUND) {
1262 /* we will create the nodes from top-level, default behavior (absolute path), or from the parent (relative path) */
Michal Vasko45b0d202020-11-06 17:20:46 +01001263 if (lysc_data_parent(p[0].node)) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001264 node = parent;
1265 }
1266 } else {
1267 /* error */
1268 goto cleanup;
1269 }
1270 }
1271
1272 /* create all the non-existing nodes in a loop */
Michal Vaskod989ba02020-08-24 10:59:24 +02001273 for ( ; path_idx < LY_ARRAY_COUNT(p); ++path_idx) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001274 cur_parent = node;
1275 schema = p[path_idx].node;
1276
1277 switch (schema->nodetype) {
1278 case LYS_LIST:
1279 if (!(schema->flags & LYS_KEYLESS)) {
Radek Krejci092e33c2020-10-12 15:33:10 +02001280 if ((options & LYD_NEW_PATH_OPAQ) && (p[path_idx].pred_type == LY_PATH_PREDTYPE_NONE)) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001281 /* creating opaque list without keys */
Michal Vasko6b5cb2a2020-11-11 19:11:21 +01001282 LY_CHECK_GOTO(ret = lyd_create_opaq(ctx, schema->name, strlen(schema->name), NULL, 0, NULL, LY_PREF_JSON,
Michal Vaskofeca4fb2020-10-05 08:58:40 +02001283 LYD_NODEHINT_LIST, NULL, NULL, 0, schema->module->name, strlen(schema->module->name), &node),
Michal Vasko69730152020-10-09 16:30:07 +02001284 cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001285 } else {
1286 assert(p[path_idx].pred_type == LY_PATH_PREDTYPE_LIST);
1287 LY_CHECK_GOTO(ret = lyd_create_list(schema, p[path_idx].predicates, &node), cleanup);
1288 }
1289 break;
1290 }
Radek Krejci0f969882020-08-21 16:56:47 +02001291 /* fallthrough */
Michal Vasko00cbf532020-06-15 13:58:47 +02001292 case LYS_CONTAINER:
1293 case LYS_NOTIF:
1294 case LYS_RPC:
1295 case LYS_ACTION:
1296 LY_CHECK_GOTO(ret = lyd_create_inner(schema, &node), cleanup);
1297 break;
1298 case LYS_LEAFLIST:
Radek Krejci092e33c2020-10-12 15:33:10 +02001299 if ((options & LYD_NEW_PATH_OPAQ) && (p[path_idx].pred_type == LY_PATH_PREDTYPE_NONE)) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001300 /* creating opaque leaf-list without value */
Michal Vasko6b5cb2a2020-11-11 19:11:21 +01001301 LY_CHECK_GOTO(ret = lyd_create_opaq(ctx, schema->name, strlen(schema->name), NULL, 0, NULL, LY_PREF_JSON,
Michal Vaskofeca4fb2020-10-05 08:58:40 +02001302 LYD_NODEHINT_LEAFLIST, NULL, NULL, 0, schema->module->name, strlen(schema->module->name), &node),
1303 cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001304 } else {
1305 assert(p[path_idx].pred_type == LY_PATH_PREDTYPE_LEAFLIST);
1306 LY_CHECK_GOTO(ret = lyd_create_term2(schema, &p[path_idx].predicates[0].value, &node), cleanup);
1307 }
1308 break;
1309 case LYS_LEAF:
1310 /* make there is some value */
1311 if (!value) {
1312 value = "";
1313 }
1314
1315 r = LY_SUCCESS;
Radek Krejci092e33c2020-10-12 15:33:10 +02001316 if (options & LYD_NEW_PATH_OPAQ) {
Michal Vaskof937cfe2020-08-03 16:07:12 +02001317 r = lys_value_validate(NULL, schema, value, strlen(value));
Michal Vasko00cbf532020-06-15 13:58:47 +02001318 }
1319 if (!r) {
Michal Vaskofeca4fb2020-10-05 08:58:40 +02001320 ret = lyd_create_term(schema, value, strlen(value), NULL, LY_PREF_JSON, NULL, LYD_HINT_DATA, NULL, &node);
1321 LY_CHECK_GOTO(ret, cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001322 } else {
1323 /* creating opaque leaf without value */
Michal Vasko6b5cb2a2020-11-11 19:11:21 +01001324 LY_CHECK_GOTO(ret = lyd_create_opaq(ctx, schema->name, strlen(schema->name), NULL, 0, NULL, LY_PREF_JSON,
1325 0, NULL, NULL, 0, schema->module->name, strlen(schema->module->name), &node), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001326 }
1327 break;
1328 case LYS_ANYDATA:
1329 case LYS_ANYXML:
1330 LY_CHECK_GOTO(ret = lyd_create_any(schema, value, value_type, &node), cleanup);
1331 break;
1332 default:
1333 LOGINT(ctx);
1334 ret = LY_EINT;
1335 goto cleanup;
1336 }
1337
1338 if (cur_parent) {
1339 /* connect to the parent */
1340 lyd_insert_node(cur_parent, NULL, node);
1341 } else if (parent) {
1342 /* connect to top-level siblings */
1343 lyd_insert_node(NULL, &parent, node);
1344 }
1345
1346 /* update remembered nodes */
1347 if (!nparent) {
1348 nparent = node;
1349 }
1350 nnode = node;
1351 }
1352
1353cleanup:
1354 lyxp_expr_free(ctx, exp);
1355 ly_path_free(ctx, p);
1356 if (!ret) {
1357 /* set out params only on success */
1358 if (new_parent) {
1359 *new_parent = nparent;
1360 }
1361 if (new_node) {
1362 *new_node = nnode;
1363 }
1364 }
1365 return ret;
1366}
1367
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001368LY_ERR
1369lyd_new_implicit_r(struct lyd_node *parent, struct lyd_node **first, const struct lysc_node *sparent,
Radek Krejci1deb5be2020-08-26 16:43:36 +02001370 const struct lys_module *mod, struct ly_set *node_types, struct ly_set *node_when, uint32_t impl_opts,
Radek Krejci0f969882020-08-21 16:56:47 +02001371 struct lyd_node **diff)
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001372{
1373 LY_ERR ret;
1374 const struct lysc_node *iter = NULL;
Radek Krejci2b18bf12020-11-06 11:20:20 +01001375 struct lyd_node *node = NULL;
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001376 struct lyd_value **dflts;
1377 LY_ARRAY_COUNT_TYPE u;
1378
1379 assert(first && (parent || sparent || mod));
1380
1381 if (!sparent && parent) {
1382 sparent = parent->schema;
1383 }
1384
1385 while ((iter = lys_getnext(iter, sparent, mod ? mod->compiled : NULL, LYS_GETNEXT_WITHCHOICE))) {
1386 if ((impl_opts & LYD_IMPLICIT_NO_STATE) && (iter->flags & LYS_CONFIG_R)) {
1387 continue;
Michal Vasko44b19a12020-08-07 09:21:30 +02001388 } else if ((impl_opts & LYD_IMPLICIT_NO_CONFIG) && (iter->flags & LYS_CONFIG_W)) {
1389 continue;
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001390 }
1391
1392 switch (iter->nodetype) {
1393 case LYS_CHOICE:
1394 if (((struct lysc_node_choice *)iter)->dflt && !lys_getnext_data(NULL, *first, NULL, iter, NULL)) {
1395 /* create default case data */
1396 LY_CHECK_RET(lyd_new_implicit_r(parent, first, (struct lysc_node *)((struct lysc_node_choice *)iter)->dflt,
Michal Vasko69730152020-10-09 16:30:07 +02001397 NULL, node_types, node_when, impl_opts, diff));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001398 }
1399 break;
1400 case LYS_CONTAINER:
1401 if (!(iter->flags & LYS_PRESENCE) && lyd_find_sibling_val(*first, iter, NULL, 0, NULL)) {
1402 /* create default NP container */
1403 LY_CHECK_RET(lyd_create_inner(iter, &node));
Michal Vasko0cadfcb2020-11-04 17:17:05 +01001404 node->flags = LYD_DEFAULT | (node->schema->when ? LYD_WHEN_TRUE : 0);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001405 lyd_insert_node(parent, first, node);
1406
1407 /* cannot be a NP container with when */
1408 assert(!iter->when);
1409
Michal Vaskoe49b6322020-11-05 17:38:36 +01001410 if (diff) {
1411 /* add into diff */
1412 LY_CHECK_RET(lyd_val_diff_add(node, LYD_DIFF_OP_CREATE, diff));
1413 }
1414
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001415 /* create any default children */
1416 LY_CHECK_RET(lyd_new_implicit_r(node, lyd_node_children_p(node), NULL, NULL, node_types, node_when,
Michal Vasko69730152020-10-09 16:30:07 +02001417 impl_opts, diff));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001418 }
1419 break;
1420 case LYS_LEAF:
Michal Vasko69730152020-10-09 16:30:07 +02001421 if (!(impl_opts & LYD_IMPLICIT_NO_DEFAULTS) && ((struct lysc_node_leaf *)iter)->dflt &&
1422 lyd_find_sibling_val(*first, iter, NULL, 0, NULL)) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001423 /* create default leaf */
1424 ret = lyd_create_term2(iter, ((struct lysc_node_leaf *)iter)->dflt, &node);
1425 if (ret == LY_EINCOMPLETE) {
1426 if (node_types) {
1427 /* remember to resolve type */
Radek Krejci3d92e442020-10-12 12:48:13 +02001428 LY_CHECK_RET(ly_set_add(node_types, node, 1, NULL));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001429 }
1430 } else if (ret) {
1431 return ret;
1432 }
Michal Vasko0cadfcb2020-11-04 17:17:05 +01001433 node->flags = LYD_DEFAULT | (node->schema->when ? LYD_WHEN_TRUE : 0);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001434 lyd_insert_node(parent, first, node);
1435
1436 if (iter->when && node_when) {
1437 /* remember to resolve when */
Radek Krejci3d92e442020-10-12 12:48:13 +02001438 LY_CHECK_RET(ly_set_add(node_when, node, 1, NULL));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001439 }
1440 if (diff) {
1441 /* add into diff */
1442 LY_CHECK_RET(lyd_val_diff_add(node, LYD_DIFF_OP_CREATE, diff));
1443 }
1444 }
1445 break;
1446 case LYS_LEAFLIST:
Michal Vasko69730152020-10-09 16:30:07 +02001447 if (!(impl_opts & LYD_IMPLICIT_NO_DEFAULTS) && ((struct lysc_node_leaflist *)iter)->dflts &&
1448 lyd_find_sibling_val(*first, iter, NULL, 0, NULL)) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001449 /* create all default leaf-lists */
1450 dflts = ((struct lysc_node_leaflist *)iter)->dflts;
1451 LY_ARRAY_FOR(dflts, u) {
1452 ret = lyd_create_term2(iter, dflts[u], &node);
1453 if (ret == LY_EINCOMPLETE) {
1454 if (node_types) {
1455 /* remember to resolve type */
Radek Krejci3d92e442020-10-12 12:48:13 +02001456 LY_CHECK_RET(ly_set_add(node_types, node, 1, NULL));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001457 }
1458 } else if (ret) {
1459 return ret;
1460 }
Radek Krejcic5b54a02020-11-05 17:13:18 +01001461 node->flags = LYD_DEFAULT | (node->schema->when ? LYD_WHEN_TRUE : 0);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001462 lyd_insert_node(parent, first, node);
1463
1464 if (iter->when && node_when) {
1465 /* remember to resolve when */
Radek Krejci3d92e442020-10-12 12:48:13 +02001466 LY_CHECK_RET(ly_set_add(node_when, node, 1, NULL));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001467 }
1468 if (diff) {
1469 /* add into diff */
1470 LY_CHECK_RET(lyd_val_diff_add(node, LYD_DIFF_OP_CREATE, diff));
1471 }
1472 }
1473 }
1474 break;
1475 default:
1476 /* without defaults */
1477 break;
1478 }
1479 }
1480
1481 return LY_SUCCESS;
1482}
1483
1484API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02001485lyd_new_implicit_tree(struct lyd_node *tree, uint32_t implicit_options, struct lyd_node **diff)
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001486{
Michal Vasko56daf732020-08-10 10:57:18 +02001487 struct lyd_node *node;
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001488 LY_ERR ret = LY_SUCCESS;
1489
1490 LY_CHECK_ARG_RET(NULL, tree, LY_EINVAL);
1491 if (diff) {
1492 *diff = NULL;
1493 }
1494
Michal Vasko56daf732020-08-10 10:57:18 +02001495 LYD_TREE_DFS_BEGIN(tree, node) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001496 /* skip added default nodes */
Michal Vasko69730152020-10-09 16:30:07 +02001497 if (((node->flags & (LYD_DEFAULT | LYD_NEW)) != (LYD_DEFAULT | LYD_NEW)) &&
1498 (node->schema->nodetype & LYD_NODE_INNER)) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001499 LY_CHECK_GOTO(ret = lyd_new_implicit_r(node, lyd_node_children_p((struct lyd_node *)node), NULL, NULL, NULL,
Michal Vasko69730152020-10-09 16:30:07 +02001500 NULL, implicit_options, diff), cleanup);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001501 }
1502
Michal Vasko56daf732020-08-10 10:57:18 +02001503 LYD_TREE_DFS_END(tree, node);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001504 }
1505
1506cleanup:
1507 if (ret && diff) {
1508 lyd_free_all(*diff);
1509 *diff = NULL;
1510 }
1511 return ret;
1512}
1513
1514API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02001515lyd_new_implicit_all(struct lyd_node **tree, const struct ly_ctx *ctx, uint32_t implicit_options, struct lyd_node **diff)
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001516{
1517 const struct lys_module *mod;
1518 struct lyd_node *d = NULL;
1519 uint32_t i = 0;
1520 LY_ERR ret = LY_SUCCESS;
1521
1522 LY_CHECK_ARG_RET(ctx, tree, *tree || ctx, LY_EINVAL);
1523 if (diff) {
1524 *diff = NULL;
1525 }
1526 if (!ctx) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001527 ctx = LYD_CTX(*tree);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001528 }
1529
1530 /* add nodes for each module one-by-one */
1531 while ((mod = ly_ctx_get_module_iter(ctx, &i))) {
1532 if (!mod->implemented) {
1533 continue;
1534 }
1535
1536 LY_CHECK_GOTO(ret = lyd_new_implicit_module(tree, mod, implicit_options, diff ? &d : NULL), cleanup);
1537 if (d) {
1538 /* merge into one diff */
1539 lyd_insert_sibling(*diff, d, diff);
1540
1541 d = NULL;
1542 }
1543 }
1544
1545cleanup:
1546 if (ret && diff) {
1547 lyd_free_all(*diff);
1548 *diff = NULL;
1549 }
1550 return ret;
1551}
1552
1553API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02001554lyd_new_implicit_module(struct lyd_node **tree, const struct lys_module *module, uint32_t implicit_options, struct lyd_node **diff)
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001555{
1556 struct lyd_node *root, *d = NULL;
1557 LY_ERR ret = LY_SUCCESS;
1558
1559 LY_CHECK_ARG_RET(NULL, tree, module, LY_EINVAL);
1560 if (diff) {
1561 *diff = NULL;
1562 }
1563
1564 /* add all top-level defaults for this module */
1565 LY_CHECK_GOTO(ret = lyd_new_implicit_r(NULL, tree, NULL, module, NULL, NULL, implicit_options, diff), cleanup);
1566
1567 /* process nested nodes */
1568 LY_LIST_FOR(*tree, root) {
1569 /* skip added default nodes */
1570 if ((root->flags & (LYD_DEFAULT | LYD_NEW)) != (LYD_DEFAULT | LYD_NEW)) {
1571 LY_CHECK_GOTO(ret = lyd_new_implicit_tree(root, implicit_options, diff ? &d : NULL), cleanup);
1572
1573 if (d) {
1574 /* merge into one diff */
1575 lyd_insert_sibling(*diff, d, diff);
1576
1577 d = NULL;
1578 }
1579 }
1580 }
1581
1582cleanup:
1583 if (ret && diff) {
1584 lyd_free_all(*diff);
1585 *diff = NULL;
1586 }
1587 return ret;
1588}
1589
Michal Vasko90932a92020-02-12 14:33:03 +01001590struct lyd_node *
Michal Vaskob104f112020-07-17 09:54:54 +02001591lyd_insert_get_next_anchor(const struct lyd_node *first_sibling, const struct lyd_node *new_node)
Michal Vasko90932a92020-02-12 14:33:03 +01001592{
Michal Vaskob104f112020-07-17 09:54:54 +02001593 const struct lysc_node *schema, *sparent;
Michal Vasko90932a92020-02-12 14:33:03 +01001594 struct lyd_node *match = NULL;
Radek Krejci857189e2020-09-01 13:26:36 +02001595 ly_bool found;
Michal Vasko90932a92020-02-12 14:33:03 +01001596
Michal Vaskob104f112020-07-17 09:54:54 +02001597 assert(new_node);
1598
1599 if (!first_sibling || !new_node->schema) {
1600 /* insert at the end, no next anchor */
Michal Vasko90932a92020-02-12 14:33:03 +01001601 return NULL;
1602 }
1603
Michal Vaskob104f112020-07-17 09:54:54 +02001604 if (first_sibling->parent && first_sibling->parent->children_ht) {
1605 /* find the anchor using hashes */
1606 sparent = first_sibling->parent->schema;
1607 schema = lys_getnext(new_node->schema, sparent, NULL, 0);
1608 while (schema) {
1609 /* keep trying to find the first existing instance of the closest following schema sibling,
1610 * otherwise return NULL - inserting at the end */
1611 if (!lyd_find_sibling_schema(first_sibling, schema, &match)) {
1612 break;
1613 }
1614
1615 schema = lys_getnext(schema, sparent, NULL, 0);
1616 }
1617 } else {
1618 /* find the anchor without hashes */
1619 match = (struct lyd_node *)first_sibling;
1620 if (!lysc_data_parent(new_node->schema)) {
1621 /* we are in top-level, skip all the data from preceding modules */
1622 LY_LIST_FOR(match, match) {
1623 if (!match->schema || (strcmp(lyd_owner_module(match)->name, lyd_owner_module(new_node)->name) >= 0)) {
1624 break;
1625 }
1626 }
1627 }
1628
1629 /* get the first schema sibling */
1630 sparent = lysc_data_parent(new_node->schema);
1631 schema = lys_getnext(NULL, sparent, new_node->schema->module->compiled, 0);
1632
1633 found = 0;
1634 LY_LIST_FOR(match, match) {
1635 if (!match->schema || (lyd_owner_module(match) != lyd_owner_module(new_node))) {
1636 /* we have found an opaque node, which must be at the end, so use it OR
1637 * modules do not match, so we must have traversed all the data from new_node module (if any),
1638 * we have found the first node of the next module, that is what we want */
1639 break;
1640 }
1641
1642 /* skip schema nodes until we find the instantiated one */
1643 while (!found) {
1644 if (new_node->schema == schema) {
1645 /* we have found the schema of the new node, continue search to find the first
1646 * data node with a different schema (after our schema) */
1647 found = 1;
1648 break;
1649 }
1650 if (match->schema == schema) {
1651 /* current node (match) is a data node still before the new node, continue search in data */
1652 break;
1653 }
1654 schema = lys_getnext(schema, sparent, new_node->schema->module->compiled, 0);
1655 assert(schema);
1656 }
1657
1658 if (found && (match->schema != new_node->schema)) {
1659 /* find the next node after we have found our node schema data instance */
1660 break;
1661 }
1662 }
Michal Vasko90932a92020-02-12 14:33:03 +01001663 }
1664
1665 return match;
1666}
1667
1668/**
1669 * @brief Insert node after a sibling.
1670 *
Michal Vasko9f96a052020-03-10 09:41:45 +01001671 * Handles inserting into NP containers and key-less lists.
1672 *
Michal Vasko90932a92020-02-12 14:33:03 +01001673 * @param[in] sibling Sibling to insert after.
1674 * @param[in] node Node to insert.
1675 */
1676static void
Michal Vaskof03ed032020-03-04 13:31:44 +01001677lyd_insert_after_node(struct lyd_node *sibling, struct lyd_node *node)
Michal Vasko90932a92020-02-12 14:33:03 +01001678{
Michal Vasko0249f7c2020-03-05 16:36:40 +01001679 struct lyd_node_inner *par;
1680
Michal Vasko90932a92020-02-12 14:33:03 +01001681 assert(!node->next && (node->prev == node));
1682
1683 node->next = sibling->next;
1684 node->prev = sibling;
1685 sibling->next = node;
1686 if (node->next) {
1687 /* sibling had a succeeding node */
1688 node->next->prev = node;
1689 } else {
1690 /* sibling was last, find first sibling and change its prev */
1691 if (sibling->parent) {
1692 sibling = sibling->parent->child;
1693 } else {
Michal Vaskod989ba02020-08-24 10:59:24 +02001694 for ( ; sibling->prev->next != node; sibling = sibling->prev) {}
Michal Vasko90932a92020-02-12 14:33:03 +01001695 }
1696 sibling->prev = node;
1697 }
1698 node->parent = sibling->parent;
Michal Vasko0249f7c2020-03-05 16:36:40 +01001699
Michal Vasko9f96a052020-03-10 09:41:45 +01001700 for (par = node->parent; par; par = par->parent) {
1701 if ((par->flags & LYD_DEFAULT) && !(node->flags & LYD_DEFAULT)) {
1702 /* remove default flags from NP containers */
Michal Vasko0249f7c2020-03-05 16:36:40 +01001703 par->flags &= ~LYD_DEFAULT;
1704 }
Michal Vaskob104f112020-07-17 09:54:54 +02001705 if (par->schema && (par->schema->nodetype == LYS_LIST) && (par->schema->flags & LYS_KEYLESS)) {
Michal Vasko9f96a052020-03-10 09:41:45 +01001706 /* rehash key-less list */
1707 lyd_hash((struct lyd_node *)par);
1708 }
Michal Vasko0249f7c2020-03-05 16:36:40 +01001709 }
Michal Vasko90932a92020-02-12 14:33:03 +01001710}
1711
1712/**
1713 * @brief Insert node before a sibling.
1714 *
Michal Vasko9f96a052020-03-10 09:41:45 +01001715 * Handles inserting into NP containers and key-less lists.
1716 *
Michal Vasko90932a92020-02-12 14:33:03 +01001717 * @param[in] sibling Sibling to insert before.
1718 * @param[in] node Node to insert.
1719 */
1720static void
Michal Vaskof03ed032020-03-04 13:31:44 +01001721lyd_insert_before_node(struct lyd_node *sibling, struct lyd_node *node)
Michal Vasko90932a92020-02-12 14:33:03 +01001722{
Michal Vasko0249f7c2020-03-05 16:36:40 +01001723 struct lyd_node_inner *par;
1724
Michal Vasko90932a92020-02-12 14:33:03 +01001725 assert(!node->next && (node->prev == node));
1726
1727 node->next = sibling;
1728 /* covers situation of sibling being first */
1729 node->prev = sibling->prev;
1730 sibling->prev = node;
1731 if (node->prev->next) {
1732 /* sibling had a preceding node */
1733 node->prev->next = node;
1734 } else if (sibling->parent) {
1735 /* sibling was first and we must also change parent child pointer */
1736 sibling->parent->child = node;
1737 }
1738 node->parent = sibling->parent;
Michal Vasko0249f7c2020-03-05 16:36:40 +01001739
Michal Vasko9f96a052020-03-10 09:41:45 +01001740 for (par = node->parent; par; par = par->parent) {
1741 if ((par->flags & LYD_DEFAULT) && !(node->flags & LYD_DEFAULT)) {
1742 /* remove default flags from NP containers */
Michal Vasko0249f7c2020-03-05 16:36:40 +01001743 par->flags &= ~LYD_DEFAULT;
1744 }
Michal Vaskob104f112020-07-17 09:54:54 +02001745 if (par->schema && (par->schema->nodetype == LYS_LIST) && (par->schema->flags & LYS_KEYLESS)) {
Michal Vasko9f96a052020-03-10 09:41:45 +01001746 /* rehash key-less list */
1747 lyd_hash((struct lyd_node *)par);
1748 }
Michal Vasko0249f7c2020-03-05 16:36:40 +01001749 }
Michal Vasko90932a92020-02-12 14:33:03 +01001750}
1751
1752/**
Michal Vaskob104f112020-07-17 09:54:54 +02001753 * @brief Insert node as the first and only child of a parent.
Michal Vasko90932a92020-02-12 14:33:03 +01001754 *
Michal Vasko9f96a052020-03-10 09:41:45 +01001755 * Handles inserting into NP containers and key-less lists.
1756 *
Michal Vasko90932a92020-02-12 14:33:03 +01001757 * @param[in] parent Parent to insert into.
1758 * @param[in] node Node to insert.
1759 */
1760static void
Michal Vaskob104f112020-07-17 09:54:54 +02001761lyd_insert_only_child(struct lyd_node *parent, struct lyd_node *node)
Michal Vasko90932a92020-02-12 14:33:03 +01001762{
1763 struct lyd_node_inner *par;
1764
Radek Krejcia1c1e542020-09-29 16:06:52 +02001765 assert(parent && !lyd_child(parent) && !node->next && (node->prev == node));
Michal Vasko52927e22020-03-16 17:26:14 +01001766 assert(!parent->schema || (parent->schema->nodetype & LYD_NODE_INNER));
Michal Vasko90932a92020-02-12 14:33:03 +01001767
1768 par = (struct lyd_node_inner *)parent;
1769
Michal Vaskob104f112020-07-17 09:54:54 +02001770 par->child = node;
Michal Vasko90932a92020-02-12 14:33:03 +01001771 node->parent = par;
Michal Vasko0249f7c2020-03-05 16:36:40 +01001772
Michal Vaskod989ba02020-08-24 10:59:24 +02001773 for ( ; par; par = par->parent) {
Michal Vasko9f96a052020-03-10 09:41:45 +01001774 if ((par->flags & LYD_DEFAULT) && !(node->flags & LYD_DEFAULT)) {
1775 /* remove default flags from NP containers */
Michal Vasko0249f7c2020-03-05 16:36:40 +01001776 par->flags &= ~LYD_DEFAULT;
1777 }
Michal Vasko52927e22020-03-16 17:26:14 +01001778 if (par->schema && (par->schema->nodetype == LYS_LIST) && (par->schema->flags & LYS_KEYLESS)) {
Michal Vasko9f96a052020-03-10 09:41:45 +01001779 /* rehash key-less list */
1780 lyd_hash((struct lyd_node *)par);
1781 }
Michal Vasko0249f7c2020-03-05 16:36:40 +01001782 }
Michal Vasko751cb4d2020-07-14 12:25:28 +02001783}
Michal Vasko0249f7c2020-03-05 16:36:40 +01001784
Michal Vasko751cb4d2020-07-14 12:25:28 +02001785/**
1786 * @brief Learn whether a list instance has all the keys.
1787 *
1788 * @param[in] list List instance to check.
1789 * @return non-zero if all the keys were found,
1790 * @return 0 otherwise.
1791 */
1792static int
1793lyd_insert_has_keys(const struct lyd_node *list)
1794{
1795 const struct lyd_node *key;
1796 const struct lysc_node *skey = NULL;
1797
1798 assert(list->schema->nodetype == LYS_LIST);
Radek Krejcia1c1e542020-09-29 16:06:52 +02001799 key = lyd_child(list);
Michal Vasko751cb4d2020-07-14 12:25:28 +02001800 while ((skey = lys_getnext(skey, list->schema, NULL, 0)) && (skey->flags & LYS_KEY)) {
1801 if (!key || (key->schema != skey)) {
1802 /* key missing */
1803 return 0;
1804 }
1805
1806 key = key->next;
1807 }
1808
1809 /* all keys found */
1810 return 1;
Michal Vasko90932a92020-02-12 14:33:03 +01001811}
1812
1813void
Michal Vaskob104f112020-07-17 09:54:54 +02001814lyd_insert_node(struct lyd_node *parent, struct lyd_node **first_sibling_p, struct lyd_node *node)
Michal Vasko90932a92020-02-12 14:33:03 +01001815{
Michal Vaskob104f112020-07-17 09:54:54 +02001816 struct lyd_node *anchor, *first_sibling;
Michal Vasko90932a92020-02-12 14:33:03 +01001817
Michal Vaskob104f112020-07-17 09:54:54 +02001818 /* inserting list without its keys is not supported */
1819 assert((parent || first_sibling_p) && node && (node->hash || !node->schema));
Michal Vaskof756c942020-11-06 17:21:37 +01001820 assert(!parent || !parent->schema ||
1821 (parent->schema->nodetype & (LYS_CONTAINER | LYS_LIST | LYS_RPC | LYS_ACTION | LYS_NOTIF)));
Michal Vasko9b368d32020-02-14 13:53:31 +01001822
Michal Vaskob104f112020-07-17 09:54:54 +02001823 if (!parent && first_sibling_p && (*first_sibling_p) && (*first_sibling_p)->parent) {
1824 parent = (struct lyd_node *)(*first_sibling_p)->parent;
Michal Vasko9b368d32020-02-14 13:53:31 +01001825 }
Michal Vasko90932a92020-02-12 14:33:03 +01001826
Michal Vaskob104f112020-07-17 09:54:54 +02001827 /* get first sibling */
1828 first_sibling = parent ? ((struct lyd_node_inner *)parent)->child : *first_sibling_p;
Michal Vasko9f96a052020-03-10 09:41:45 +01001829
Michal Vaskob104f112020-07-17 09:54:54 +02001830 /* find the anchor, our next node, so we can insert before it */
1831 anchor = lyd_insert_get_next_anchor(first_sibling, node);
1832 if (anchor) {
1833 lyd_insert_before_node(anchor, node);
Michal Vasko26123192020-11-09 21:02:34 +01001834 if (!parent && (*first_sibling_p == anchor)) {
1835 /* move first sibling */
1836 *first_sibling_p = node;
1837 }
Michal Vaskob104f112020-07-17 09:54:54 +02001838 } else if (first_sibling) {
1839 lyd_insert_after_node(first_sibling->prev, node);
1840 } else if (parent) {
1841 lyd_insert_only_child(parent, node);
Michal Vasko90932a92020-02-12 14:33:03 +01001842 } else {
Michal Vaskob104f112020-07-17 09:54:54 +02001843 *first_sibling_p = node;
1844 }
1845
1846 /* insert into parent HT */
1847 lyd_insert_hash(node);
1848
1849 /* finish hashes for our parent, if needed and possible */
Michal Vasko9e8de2d2020-09-01 08:17:10 +02001850 if (node->schema && (node->schema->flags & LYS_KEY) && parent && lyd_insert_has_keys(parent)) {
Michal Vaskob104f112020-07-17 09:54:54 +02001851 lyd_hash(parent);
1852
1853 /* now we can insert even the list into its parent HT */
1854 lyd_insert_hash(parent);
Michal Vasko90932a92020-02-12 14:33:03 +01001855 }
Michal Vasko90932a92020-02-12 14:33:03 +01001856}
1857
Michal Vaskof03ed032020-03-04 13:31:44 +01001858static LY_ERR
1859lyd_insert_check_schema(const struct lysc_node *parent, const struct lysc_node *schema)
1860{
1861 const struct lysc_node *par2;
1862
1863 assert(schema);
Michal Vasko62ed12d2020-05-21 10:08:25 +02001864 assert(!parent || !(parent->nodetype & (LYS_CASE | LYS_CHOICE)));
Michal Vaskof03ed032020-03-04 13:31:44 +01001865
1866 /* find schema parent */
Michal Vasko62ed12d2020-05-21 10:08:25 +02001867 par2 = lysc_data_parent(schema);
Michal Vaskof03ed032020-03-04 13:31:44 +01001868
1869 if (parent) {
1870 /* inner node */
1871 if (par2 != parent) {
Michal Vaskob104f112020-07-17 09:54:54 +02001872 LOGERR(schema->module->ctx, LY_EINVAL, "Cannot insert, parent of \"%s\" is not \"%s\".", schema->name,
Michal Vasko69730152020-10-09 16:30:07 +02001873 parent->name);
Michal Vaskof03ed032020-03-04 13:31:44 +01001874 return LY_EINVAL;
1875 }
1876 } else {
1877 /* top-level node */
1878 if (par2) {
Radek Krejcif6d14cb2020-07-02 16:11:45 +02001879 LOGERR(schema->module->ctx, LY_EINVAL, "Cannot insert, node \"%s\" is not top-level.", schema->name);
Michal Vaskof03ed032020-03-04 13:31:44 +01001880 return LY_EINVAL;
1881 }
1882 }
1883
1884 return LY_SUCCESS;
1885}
1886
1887API LY_ERR
Michal Vaskob104f112020-07-17 09:54:54 +02001888lyd_insert_child(struct lyd_node *parent, struct lyd_node *node)
Michal Vaskof03ed032020-03-04 13:31:44 +01001889{
1890 struct lyd_node *iter;
1891
Michal Vasko654bc852020-06-23 13:28:06 +02001892 LY_CHECK_ARG_RET(NULL, parent, node, parent->schema->nodetype & LYD_NODE_INNER, LY_EINVAL);
Michal Vaskof03ed032020-03-04 13:31:44 +01001893
1894 LY_CHECK_RET(lyd_insert_check_schema(parent->schema, node->schema));
1895
1896 if (node->schema->flags & LYS_KEY) {
1897 LOGERR(parent->schema->module->ctx, LY_EINVAL, "Cannot insert key \"%s\".", node->schema->name);
1898 return LY_EINVAL;
1899 }
1900
1901 if (node->parent || node->prev->next) {
1902 lyd_unlink_tree(node);
1903 }
1904
1905 while (node) {
1906 iter = node->next;
1907 lyd_unlink_tree(node);
1908 lyd_insert_node(parent, NULL, node);
1909 node = iter;
1910 }
1911 return LY_SUCCESS;
1912}
1913
1914API LY_ERR
Michal Vaskob104f112020-07-17 09:54:54 +02001915lyd_insert_sibling(struct lyd_node *sibling, struct lyd_node *node, struct lyd_node **first)
Michal Vaskob1b5c262020-03-05 14:29:47 +01001916{
1917 struct lyd_node *iter;
1918
Michal Vaskob104f112020-07-17 09:54:54 +02001919 LY_CHECK_ARG_RET(NULL, node, LY_EINVAL);
Michal Vaskob1b5c262020-03-05 14:29:47 +01001920
Michal Vaskob104f112020-07-17 09:54:54 +02001921 if (sibling) {
1922 LY_CHECK_RET(lyd_insert_check_schema(lysc_data_parent(sibling->schema), node->schema));
Michal Vaskob1b5c262020-03-05 14:29:47 +01001923 }
1924
1925 if (node->parent || node->prev->next) {
1926 lyd_unlink_tree(node);
1927 }
1928
1929 while (node) {
Michal Vaskob104f112020-07-17 09:54:54 +02001930 if (node->schema->flags & LYS_KEY) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001931 LOGERR(LYD_CTX(node), LY_EINVAL, "Cannot insert key \"%s\".", node->schema->name);
Michal Vaskob104f112020-07-17 09:54:54 +02001932 return LY_EINVAL;
1933 }
1934
Michal Vaskob1b5c262020-03-05 14:29:47 +01001935 iter = node->next;
1936 lyd_unlink_tree(node);
1937 lyd_insert_node(NULL, &sibling, node);
1938 node = iter;
1939 }
Michal Vaskob1b5c262020-03-05 14:29:47 +01001940
Michal Vaskob104f112020-07-17 09:54:54 +02001941 if (first) {
1942 /* find the first sibling */
1943 *first = sibling;
1944 while ((*first)->prev->next) {
1945 *first = (*first)->prev;
Michal Vasko0249f7c2020-03-05 16:36:40 +01001946 }
1947 }
1948
1949 return LY_SUCCESS;
1950}
1951
Michal Vaskob1b5c262020-03-05 14:29:47 +01001952API LY_ERR
Michal Vaskof03ed032020-03-04 13:31:44 +01001953lyd_insert_before(struct lyd_node *sibling, struct lyd_node *node)
1954{
1955 struct lyd_node *iter;
1956
1957 LY_CHECK_ARG_RET(NULL, sibling, node, LY_EINVAL);
1958
Michal Vasko62ed12d2020-05-21 10:08:25 +02001959 LY_CHECK_RET(lyd_insert_check_schema(lysc_data_parent(sibling->schema), node->schema));
Michal Vaskof03ed032020-03-04 13:31:44 +01001960
Michal Vaskob104f112020-07-17 09:54:54 +02001961 if (!(node->schema->nodetype & (LYS_LIST | LYS_LEAFLIST)) || !(node->schema->flags & LYS_ORDBY_USER)) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001962 LOGERR(LYD_CTX(sibling), LY_EINVAL, "Can be used only for user-ordered nodes.");
Michal Vaskof03ed032020-03-04 13:31:44 +01001963 return LY_EINVAL;
1964 }
1965
1966 if (node->parent || node->prev->next) {
1967 lyd_unlink_tree(node);
1968 }
1969
1970 /* insert in reverse order to get the original order */
1971 node = node->prev;
1972 while (node) {
1973 iter = node->prev;
1974 lyd_unlink_tree(node);
1975
1976 lyd_insert_before_node(sibling, node);
Michal Vasko751cb4d2020-07-14 12:25:28 +02001977 lyd_insert_hash(node);
1978
Michal Vaskof03ed032020-03-04 13:31:44 +01001979 /* move the anchor accordingly */
1980 sibling = node;
1981
1982 node = (iter == node) ? NULL : iter;
1983 }
1984 return LY_SUCCESS;
1985}
1986
1987API LY_ERR
1988lyd_insert_after(struct lyd_node *sibling, struct lyd_node *node)
1989{
1990 struct lyd_node *iter;
1991
1992 LY_CHECK_ARG_RET(NULL, sibling, node, LY_EINVAL);
1993
Michal Vasko62ed12d2020-05-21 10:08:25 +02001994 LY_CHECK_RET(lyd_insert_check_schema(lysc_data_parent(sibling->schema), node->schema));
Michal Vaskof03ed032020-03-04 13:31:44 +01001995
Michal Vaskob104f112020-07-17 09:54:54 +02001996 if (!(node->schema->nodetype & (LYS_LIST | LYS_LEAFLIST)) || !(node->schema->flags & LYS_ORDBY_USER)) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001997 LOGERR(LYD_CTX(sibling), LY_EINVAL, "Can be used only for user-ordered nodes.");
Michal Vaskof03ed032020-03-04 13:31:44 +01001998 return LY_EINVAL;
1999 }
2000
2001 if (node->parent || node->prev->next) {
2002 lyd_unlink_tree(node);
2003 }
2004
2005 while (node) {
2006 iter = node->next;
2007 lyd_unlink_tree(node);
2008
2009 lyd_insert_after_node(sibling, node);
Michal Vasko751cb4d2020-07-14 12:25:28 +02002010 lyd_insert_hash(node);
2011
Michal Vaskof03ed032020-03-04 13:31:44 +01002012 /* move the anchor accordingly */
2013 sibling = node;
2014
2015 node = iter;
2016 }
2017 return LY_SUCCESS;
2018}
2019
2020API void
2021lyd_unlink_tree(struct lyd_node *node)
2022{
2023 struct lyd_node *iter;
2024
2025 if (!node) {
2026 return;
2027 }
2028
Michal Vaskob104f112020-07-17 09:54:54 +02002029 /* update hashes while still linked into the tree */
2030 lyd_unlink_hash(node);
2031
Michal Vaskof03ed032020-03-04 13:31:44 +01002032 /* unlink from siblings */
2033 if (node->prev->next) {
2034 node->prev->next = node->next;
2035 }
2036 if (node->next) {
2037 node->next->prev = node->prev;
2038 } else {
2039 /* unlinking the last node */
2040 if (node->parent) {
2041 iter = node->parent->child;
2042 } else {
2043 iter = node->prev;
2044 while (iter->prev != node) {
2045 iter = iter->prev;
2046 }
2047 }
2048 /* update the "last" pointer from the first node */
2049 iter->prev = node->prev;
2050 }
2051
2052 /* unlink from parent */
2053 if (node->parent) {
2054 if (node->parent->child == node) {
2055 /* the node is the first child */
2056 node->parent->child = node->next;
2057 }
2058
Michal Vaskoab49dbe2020-07-17 12:32:47 +02002059 /* check for NP container whether its last non-default node is not being unlinked */
Michal Vasko69730152020-10-09 16:30:07 +02002060 if (node->parent->schema && (node->parent->schema->nodetype == LYS_CONTAINER) &&
2061 !(node->parent->flags & LYD_DEFAULT) && !(node->parent->schema->flags & LYS_PRESENCE)) {
Michal Vaskoab49dbe2020-07-17 12:32:47 +02002062 LY_LIST_FOR(node->parent->child, iter) {
2063 if ((iter != node) && !(iter->flags & LYD_DEFAULT)) {
2064 break;
2065 }
2066 }
2067 if (!iter) {
2068 node->parent->flags |= LYD_DEFAULT;
2069 }
2070 }
2071
Michal Vaskof03ed032020-03-04 13:31:44 +01002072 /* check for keyless list and update its hash */
2073 for (iter = (struct lyd_node *)node->parent; iter; iter = (struct lyd_node *)iter->parent) {
Michal Vasko413c7f22020-05-05 12:34:06 +02002074 if (iter->schema && (iter->schema->flags & LYS_KEYLESS)) {
Michal Vaskof03ed032020-03-04 13:31:44 +01002075 lyd_hash(iter);
2076 }
2077 }
2078
2079 node->parent = NULL;
2080 }
2081
2082 node->next = NULL;
2083 node->prev = node;
2084}
2085
Michal Vaskoa5da3292020-08-12 13:10:50 +02002086void
Michal Vasko871a0252020-11-11 18:35:24 +01002087lyd_insert_meta(struct lyd_node *parent, struct lyd_meta *meta, ly_bool clear_dflt)
Radek Krejci1798aae2020-07-14 13:26:06 +02002088{
2089 struct lyd_meta *last, *iter;
2090
2091 assert(parent);
Michal Vaskoa5da3292020-08-12 13:10:50 +02002092
2093 if (!meta) {
2094 return;
2095 }
Radek Krejci1798aae2020-07-14 13:26:06 +02002096
2097 for (iter = meta; iter; iter = iter->next) {
2098 iter->parent = parent;
2099 }
2100
2101 /* insert as the last attribute */
2102 if (parent->meta) {
Radek Krejci1e008d22020-08-17 11:37:37 +02002103 for (last = parent->meta; last->next; last = last->next) {}
Radek Krejci1798aae2020-07-14 13:26:06 +02002104 last->next = meta;
2105 } else {
2106 parent->meta = meta;
2107 }
2108
2109 /* remove default flags from NP containers */
Michal Vasko871a0252020-11-11 18:35:24 +01002110 while (clear_dflt && parent && (parent->schema->nodetype == LYS_CONTAINER) && (parent->flags & LYD_DEFAULT)) {
Radek Krejci1798aae2020-07-14 13:26:06 +02002111 parent->flags &= ~LYD_DEFAULT;
2112 parent = (struct lyd_node *)parent->parent;
2113 }
Radek Krejci1798aae2020-07-14 13:26:06 +02002114}
2115
2116LY_ERR
Michal Vasko9f96a052020-03-10 09:41:45 +01002117lyd_create_meta(struct lyd_node *parent, struct lyd_meta **meta, const struct lys_module *mod, const char *name,
Michal Vaskofeca4fb2020-10-05 08:58:40 +02002118 size_t name_len, const char *value, size_t value_len, ly_bool *dynamic, LY_PREFIX_FORMAT format,
Michal Vasko871a0252020-11-11 18:35:24 +01002119 void *prefix_data, uint32_t hints, ly_bool clear_dflt, ly_bool *incomplete)
Michal Vasko90932a92020-02-12 14:33:03 +01002120{
Michal Vaskofeca4fb2020-10-05 08:58:40 +02002121 LY_ERR rc;
Michal Vasko90932a92020-02-12 14:33:03 +01002122 struct lysc_ext_instance *ant = NULL;
Michal Vasko9f96a052020-03-10 09:41:45 +01002123 struct lyd_meta *mt, *last;
Michal Vaskofd69e1d2020-07-03 11:57:17 +02002124 LY_ARRAY_COUNT_TYPE u;
Michal Vasko90932a92020-02-12 14:33:03 +01002125
Michal Vasko9f96a052020-03-10 09:41:45 +01002126 assert((parent || meta) && mod);
Michal Vasko6f4cbb62020-02-28 11:15:47 +01002127
Radek Krejci7eb54ba2020-05-18 16:30:04 +02002128 LY_ARRAY_FOR(mod->compiled->exts, u) {
Michal Vasko69730152020-10-09 16:30:07 +02002129 if ((mod->compiled->exts[u].def->plugin == lyext_plugins_internal[LYEXT_PLUGIN_INTERNAL_ANNOTATION].plugin) &&
Radek Krejci7eb54ba2020-05-18 16:30:04 +02002130 !ly_strncmp(mod->compiled->exts[u].argument, name, name_len)) {
Michal Vasko90932a92020-02-12 14:33:03 +01002131 /* we have the annotation definition */
Radek Krejci7eb54ba2020-05-18 16:30:04 +02002132 ant = &mod->compiled->exts[u];
Michal Vasko90932a92020-02-12 14:33:03 +01002133 break;
2134 }
2135 }
2136 if (!ant) {
2137 /* attribute is not defined as a metadata annotation (RFC 7952) */
2138 LOGERR(mod->ctx, LY_EINVAL, "Annotation definition for attribute \"%s:%.*s\" not found.",
2139 mod->name, name_len, name);
2140 return LY_EINVAL;
2141 }
2142
Michal Vasko9f96a052020-03-10 09:41:45 +01002143 mt = calloc(1, sizeof *mt);
2144 LY_CHECK_ERR_RET(!mt, LOGMEM(mod->ctx), LY_EMEM);
2145 mt->parent = parent;
2146 mt->annotation = ant;
Michal Vaskofeca4fb2020-10-05 08:58:40 +02002147 rc = lyd_value_store(mod->ctx, &mt->value, ((struct lyext_metadata *)ant->data)->type, value, value_len, dynamic,
2148 format, prefix_data, hints, parent ? parent->schema : NULL, incomplete, LY_VLOG_NONE, NULL);
2149 LY_CHECK_ERR_RET(rc, free(mt), rc);
Radek Krejci011e4aa2020-09-04 15:22:31 +02002150 rc = lydict_insert(mod->ctx, name, name_len, &mt->name);
2151 LY_CHECK_ERR_RET(rc, free(mt), rc);
Michal Vasko90932a92020-02-12 14:33:03 +01002152
Michal Vasko6f4cbb62020-02-28 11:15:47 +01002153 /* insert as the last attribute */
2154 if (parent) {
Michal Vasko871a0252020-11-11 18:35:24 +01002155 lyd_insert_meta(parent, mt, clear_dflt);
Michal Vasko9f96a052020-03-10 09:41:45 +01002156 } else if (*meta) {
Radek Krejci1e008d22020-08-17 11:37:37 +02002157 for (last = *meta; last->next; last = last->next) {}
Michal Vasko9f96a052020-03-10 09:41:45 +01002158 last->next = mt;
Michal Vasko90932a92020-02-12 14:33:03 +01002159 }
2160
Michal Vasko9f96a052020-03-10 09:41:45 +01002161 if (meta) {
2162 *meta = mt;
Michal Vasko90932a92020-02-12 14:33:03 +01002163 }
Michal Vaskofeca4fb2020-10-05 08:58:40 +02002164 return LY_SUCCESS;
Michal Vasko90932a92020-02-12 14:33:03 +01002165}
2166
Michal Vaskoa5da3292020-08-12 13:10:50 +02002167void
2168lyd_insert_attr(struct lyd_node *parent, struct lyd_attr *attr)
2169{
2170 struct lyd_attr *last, *iter;
2171 struct lyd_node_opaq *opaq;
2172
2173 assert(parent && !parent->schema);
2174
2175 if (!attr) {
2176 return;
2177 }
2178
2179 opaq = (struct lyd_node_opaq *)parent;
2180 for (iter = attr; iter; iter = iter->next) {
2181 iter->parent = opaq;
2182 }
2183
2184 /* insert as the last attribute */
2185 if (opaq->attr) {
Radek Krejci1e008d22020-08-17 11:37:37 +02002186 for (last = opaq->attr; last->next; last = last->next) {}
Michal Vaskoa5da3292020-08-12 13:10:50 +02002187 last->next = attr;
2188 } else {
2189 opaq->attr = attr;
2190 }
2191}
2192
Michal Vasko52927e22020-03-16 17:26:14 +01002193LY_ERR
Michal Vaskofeca4fb2020-10-05 08:58:40 +02002194lyd_create_attr(struct lyd_node *parent, struct lyd_attr **attr, const struct ly_ctx *ctx, const char *name, size_t name_len,
Michal Vasko6b5cb2a2020-11-11 19:11:21 +01002195 const char *value, size_t value_len, ly_bool *dynamic, LY_PREFIX_FORMAT format, uint32_t hints,
2196 void *val_prefix_data, const char *prefix, size_t prefix_len, const char *module_key, size_t module_key_len)
Michal Vasko52927e22020-03-16 17:26:14 +01002197{
Radek Krejci011e4aa2020-09-04 15:22:31 +02002198 LY_ERR ret = LY_SUCCESS;
Radek Krejci1798aae2020-07-14 13:26:06 +02002199 struct lyd_attr *at, *last;
Michal Vasko52927e22020-03-16 17:26:14 +01002200
2201 assert(ctx && (parent || attr) && (!parent || !parent->schema));
Michal Vaskofeca4fb2020-10-05 08:58:40 +02002202 assert(name && name_len && format);
Michal Vasko52927e22020-03-16 17:26:14 +01002203
2204 if (!value_len) {
2205 value = "";
2206 }
2207
2208 at = calloc(1, sizeof *at);
Michal Vasko6b5cb2a2020-11-11 19:11:21 +01002209 LY_CHECK_ERR_RET(!at, LOGMEM(ctx); ly_free_prefix_data(format, val_prefix_data), LY_EMEM);
Michal Vaskofeca4fb2020-10-05 08:58:40 +02002210 at->hints = hints;
Radek Krejcid46e46a2020-09-15 14:22:42 +02002211 at->format = format;
Michal Vasko6b5cb2a2020-11-11 19:11:21 +01002212 at->val_prefix_data = val_prefix_data;
Radek Krejcid46e46a2020-09-15 14:22:42 +02002213
Radek Krejci011e4aa2020-09-04 15:22:31 +02002214 LY_CHECK_GOTO(ret = lydict_insert(ctx, name, name_len, &at->name), finish);
Michal Vasko52927e22020-03-16 17:26:14 +01002215 if (dynamic && *dynamic) {
Radek Krejci011e4aa2020-09-04 15:22:31 +02002216 ret = lydict_insert_zc(ctx, (char *)value, &at->value);
2217 LY_CHECK_GOTO(ret, finish);
Michal Vasko52927e22020-03-16 17:26:14 +01002218 *dynamic = 0;
2219 } else {
Radek Krejci011e4aa2020-09-04 15:22:31 +02002220 LY_CHECK_GOTO(ret = lydict_insert(ctx, value, value_len, &at->value), finish);
Michal Vasko52927e22020-03-16 17:26:14 +01002221 }
2222
Radek Krejci1798aae2020-07-14 13:26:06 +02002223 if (prefix_len) {
Radek Krejci011e4aa2020-09-04 15:22:31 +02002224 LY_CHECK_GOTO(ret = lydict_insert(ctx, prefix, prefix_len, &at->prefix.id), finish);
Radek Krejci1798aae2020-07-14 13:26:06 +02002225 }
2226 if (module_key_len) {
Radek Krejci011e4aa2020-09-04 15:22:31 +02002227 LY_CHECK_GOTO(ret = lydict_insert(ctx, module_key, module_key_len, &at->prefix.module_ns), finish);
Michal Vasko52927e22020-03-16 17:26:14 +01002228 }
2229
2230 /* insert as the last attribute */
2231 if (parent) {
Michal Vaskoa5da3292020-08-12 13:10:50 +02002232 lyd_insert_attr(parent, at);
Michal Vasko52927e22020-03-16 17:26:14 +01002233 } else if (*attr) {
Radek Krejci1e008d22020-08-17 11:37:37 +02002234 for (last = *attr; last->next; last = last->next) {}
Michal Vasko52927e22020-03-16 17:26:14 +01002235 last->next = at;
2236 }
2237
Radek Krejci011e4aa2020-09-04 15:22:31 +02002238finish:
2239 if (ret) {
2240 lyd_free_attr_single(ctx, at);
2241 } else if (attr) {
Michal Vasko52927e22020-03-16 17:26:14 +01002242 *attr = at;
2243 }
2244 return LY_SUCCESS;
2245}
2246
Radek Krejci084289f2019-07-09 17:35:30 +02002247API const struct lyd_node_term *
Michal Vasko004d3152020-06-11 19:59:22 +02002248lyd_target(const struct ly_path *path, const struct lyd_node *tree)
Radek Krejci084289f2019-07-09 17:35:30 +02002249{
Michal Vasko004d3152020-06-11 19:59:22 +02002250 struct lyd_node *target;
Radek Krejci084289f2019-07-09 17:35:30 +02002251
Michal Vasko004d3152020-06-11 19:59:22 +02002252 if (ly_path_eval(path, tree, &target)) {
2253 return NULL;
Radek Krejci084289f2019-07-09 17:35:30 +02002254 }
2255
Michal Vasko004d3152020-06-11 19:59:22 +02002256 return (struct lyd_node_term *)target;
Radek Krejci084289f2019-07-09 17:35:30 +02002257}
2258
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002259API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02002260lyd_compare_single(const struct lyd_node *node1, const struct lyd_node *node2, uint32_t options)
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002261{
2262 const struct lyd_node *iter1, *iter2;
2263 struct lyd_node_term *term1, *term2;
2264 struct lyd_node_any *any1, *any2;
Michal Vasko52927e22020-03-16 17:26:14 +01002265 struct lyd_node_opaq *opaq1, *opaq2;
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002266 size_t len1, len2;
Radek Krejci084289f2019-07-09 17:35:30 +02002267
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002268 if (!node1 || !node2) {
2269 if (node1 == node2) {
2270 return LY_SUCCESS;
2271 } else {
2272 return LY_ENOT;
2273 }
2274 }
2275
Michal Vaskob7be7a82020-08-20 09:09:04 +02002276 if ((LYD_CTX(node1) != LYD_CTX(node2)) || (node1->schema != node2->schema)) {
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002277 return LY_ENOT;
2278 }
2279
2280 if (node1->hash != node2->hash) {
2281 return LY_ENOT;
2282 }
Michal Vasko52927e22020-03-16 17:26:14 +01002283 /* equal hashes do not mean equal nodes, they can be just in collision (or both be 0) so the nodes must be checked explicitly */
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002284
Michal Vasko52927e22020-03-16 17:26:14 +01002285 if (!node1->schema) {
2286 opaq1 = (struct lyd_node_opaq *)node1;
2287 opaq2 = (struct lyd_node_opaq *)node2;
Radek Krejci1798aae2020-07-14 13:26:06 +02002288 if ((opaq1->name != opaq2->name) || (opaq1->format != opaq2->format) || (opaq1->prefix.module_ns != opaq2->prefix.module_ns)) {
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002289 return LY_ENOT;
2290 }
Michal Vasko52927e22020-03-16 17:26:14 +01002291 switch (opaq1->format) {
Michal Vasko6b5cb2a2020-11-11 19:11:21 +01002292 case LY_PREF_XML:
2293 if (lyxml_value_compare(LYD_CTX(node1), opaq1->value, opaq1->val_prefix_data, opaq2->value, opaq2->val_prefix_data)) {
Michal Vasko52927e22020-03-16 17:26:14 +01002294 return LY_ENOT;
2295 }
2296 break;
Michal Vasko6b5cb2a2020-11-11 19:11:21 +01002297 case LY_PREF_JSON:
Radek Krejci1798aae2020-07-14 13:26:06 +02002298 /* prefixes in JSON are unique, so it is not necessary to canonize the values */
2299 if (strcmp(opaq1->value, opaq2->value)) {
2300 return LY_ENOT;
2301 }
2302 break;
Michal Vasko6b5cb2a2020-11-11 19:11:21 +01002303 default:
Michal Vasko52927e22020-03-16 17:26:14 +01002304 /* not allowed */
Michal Vaskob7be7a82020-08-20 09:09:04 +02002305 LOGINT(LYD_CTX(node1));
Michal Vasko52927e22020-03-16 17:26:14 +01002306 return LY_EINT;
2307 }
2308 if (options & LYD_COMPARE_FULL_RECURSION) {
2309 iter1 = opaq1->child;
2310 iter2 = opaq2->child;
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002311 goto all_children_compare;
Michal Vasko52927e22020-03-16 17:26:14 +01002312 }
2313 return LY_SUCCESS;
2314 } else {
2315 switch (node1->schema->nodetype) {
2316 case LYS_LEAF:
2317 case LYS_LEAFLIST:
2318 if (options & LYD_COMPARE_DEFAULTS) {
2319 if ((node1->flags & LYD_DEFAULT) != (node2->flags & LYD_DEFAULT)) {
2320 return LY_ENOT;
2321 }
2322 }
2323
Michal Vasko1a2bf2e2020-06-16 13:07:48 +02002324 term1 = (struct lyd_node_term *)node1;
2325 term2 = (struct lyd_node_term *)node2;
2326 if (term1->value.realtype != term2->value.realtype) {
2327 return LY_ENOT;
2328 }
Michal Vasko52927e22020-03-16 17:26:14 +01002329
Michal Vasko1a2bf2e2020-06-16 13:07:48 +02002330 return term1->value.realtype->plugin->compare(&term1->value, &term2->value);
Michal Vasko52927e22020-03-16 17:26:14 +01002331 case LYS_CONTAINER:
2332 if (options & LYD_COMPARE_DEFAULTS) {
2333 if ((node1->flags & LYD_DEFAULT) != (node2->flags & LYD_DEFAULT)) {
2334 return LY_ENOT;
2335 }
2336 }
2337 if (options & LYD_COMPARE_FULL_RECURSION) {
Michal Vasko22df3f02020-08-24 13:29:22 +02002338 iter1 = ((struct lyd_node_inner *)node1)->child;
2339 iter2 = ((struct lyd_node_inner *)node2)->child;
Michal Vasko52927e22020-03-16 17:26:14 +01002340 goto all_children_compare;
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002341 }
2342 return LY_SUCCESS;
Michal Vasko1bf09392020-03-27 12:38:10 +01002343 case LYS_RPC:
Michal Vasko52927e22020-03-16 17:26:14 +01002344 case LYS_ACTION:
2345 if (options & LYD_COMPARE_FULL_RECURSION) {
2346 /* TODO action/RPC
2347 goto all_children_compare;
2348 */
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002349 }
2350 return LY_SUCCESS;
Michal Vasko52927e22020-03-16 17:26:14 +01002351 case LYS_NOTIF:
2352 if (options & LYD_COMPARE_FULL_RECURSION) {
2353 /* TODO Notification
2354 goto all_children_compare;
2355 */
2356 }
2357 return LY_SUCCESS;
2358 case LYS_LIST:
Michal Vasko22df3f02020-08-24 13:29:22 +02002359 iter1 = ((struct lyd_node_inner *)node1)->child;
2360 iter2 = ((struct lyd_node_inner *)node2)->child;
Michal Vasko52927e22020-03-16 17:26:14 +01002361
2362 if (!(node1->schema->flags & LYS_KEYLESS) && !(options & LYD_COMPARE_FULL_RECURSION)) {
2363 /* lists with keys, their equivalence is based on their keys */
Michal Vasko22df3f02020-08-24 13:29:22 +02002364 for (struct lysc_node *key = ((struct lysc_node_list *)node1->schema)->child;
Michal Vaskoc57d9a92020-06-23 13:28:27 +02002365 key && (key->flags & LYS_KEY);
Michal Vasko52927e22020-03-16 17:26:14 +01002366 key = key->next) {
Michal Vasko8f359bf2020-07-28 10:41:15 +02002367 if (lyd_compare_single(iter1, iter2, options)) {
Michal Vasko52927e22020-03-16 17:26:14 +01002368 return LY_ENOT;
2369 }
2370 iter1 = iter1->next;
2371 iter2 = iter2->next;
2372 }
2373 } else {
2374 /* lists without keys, their equivalence is based on equivalence of all the children (both direct and indirect) */
2375
Radek Krejci0f969882020-08-21 16:56:47 +02002376all_children_compare:
Michal Vasko52927e22020-03-16 17:26:14 +01002377 if (!iter1 && !iter2) {
2378 /* no children, nothing to compare */
2379 return LY_SUCCESS;
2380 }
2381
Michal Vaskod989ba02020-08-24 10:59:24 +02002382 for ( ; iter1 && iter2; iter1 = iter1->next, iter2 = iter2->next) {
Michal Vasko8f359bf2020-07-28 10:41:15 +02002383 if (lyd_compare_single(iter1, iter2, options | LYD_COMPARE_FULL_RECURSION)) {
Michal Vasko52927e22020-03-16 17:26:14 +01002384 return LY_ENOT;
2385 }
2386 }
2387 if (iter1 || iter2) {
2388 return LY_ENOT;
2389 }
2390 }
2391 return LY_SUCCESS;
2392 case LYS_ANYXML:
2393 case LYS_ANYDATA:
Michal Vasko22df3f02020-08-24 13:29:22 +02002394 any1 = (struct lyd_node_any *)node1;
2395 any2 = (struct lyd_node_any *)node2;
Michal Vasko52927e22020-03-16 17:26:14 +01002396
2397 if (any1->value_type != any2->value_type) {
2398 return LY_ENOT;
2399 }
2400 switch (any1->value_type) {
2401 case LYD_ANYDATA_DATATREE:
2402 iter1 = any1->value.tree;
2403 iter2 = any2->value.tree;
2404 goto all_children_compare;
2405 case LYD_ANYDATA_STRING:
2406 case LYD_ANYDATA_XML:
2407 case LYD_ANYDATA_JSON:
2408 len1 = strlen(any1->value.str);
2409 len2 = strlen(any2->value.str);
Michal Vasko69730152020-10-09 16:30:07 +02002410 if ((len1 != len2) || strcmp(any1->value.str, any2->value.str)) {
Michal Vasko52927e22020-03-16 17:26:14 +01002411 return LY_ENOT;
2412 }
2413 return LY_SUCCESS;
Michal Vasko52927e22020-03-16 17:26:14 +01002414 case LYD_ANYDATA_LYB:
Michal Vasko60ea6352020-06-29 13:39:39 +02002415 len1 = lyd_lyb_data_length(any1->value.mem);
2416 len2 = lyd_lyb_data_length(any2->value.mem);
Michal Vasko69730152020-10-09 16:30:07 +02002417 if ((len1 != len2) || memcmp(any1->value.mem, any2->value.mem, len1)) {
Michal Vasko52927e22020-03-16 17:26:14 +01002418 return LY_ENOT;
2419 }
2420 return LY_SUCCESS;
Michal Vasko52927e22020-03-16 17:26:14 +01002421 }
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002422 }
2423 }
2424
Michal Vaskob7be7a82020-08-20 09:09:04 +02002425 LOGINT(LYD_CTX(node1));
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002426 return LY_EINT;
2427}
Radek Krejci22ebdba2019-07-25 13:59:43 +02002428
Michal Vasko21725742020-06-29 11:49:25 +02002429API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02002430lyd_compare_siblings(const struct lyd_node *node1, const struct lyd_node *node2, uint32_t options)
Michal Vasko8f359bf2020-07-28 10:41:15 +02002431{
Michal Vaskod989ba02020-08-24 10:59:24 +02002432 for ( ; node1 && node2; node1 = node1->next, node2 = node2->next) {
Michal Vasko8f359bf2020-07-28 10:41:15 +02002433 LY_CHECK_RET(lyd_compare_single(node1, node2, options));
2434 }
2435
Michal Vasko11a81432020-07-28 16:31:29 +02002436 if (node1 == node2) {
2437 return LY_SUCCESS;
Michal Vasko8f359bf2020-07-28 10:41:15 +02002438 }
Michal Vasko11a81432020-07-28 16:31:29 +02002439 return LY_ENOT;
Michal Vasko8f359bf2020-07-28 10:41:15 +02002440}
2441
2442API LY_ERR
Michal Vasko21725742020-06-29 11:49:25 +02002443lyd_compare_meta(const struct lyd_meta *meta1, const struct lyd_meta *meta2)
2444{
2445 if (!meta1 || !meta2) {
2446 if (meta1 == meta2) {
2447 return LY_SUCCESS;
2448 } else {
2449 return LY_ENOT;
2450 }
2451 }
2452
Michal Vaskoa8083062020-11-06 17:22:10 +01002453 if ((meta1->annotation->module->ctx != meta2->annotation->module->ctx) || (meta1->annotation != meta2->annotation)) {
Michal Vasko21725742020-06-29 11:49:25 +02002454 return LY_ENOT;
2455 }
2456
2457 if (meta1->value.realtype != meta2->value.realtype) {
2458 return LY_ENOT;
2459 }
2460
2461 return meta1->value.realtype->plugin->compare(&meta1->value, &meta2->value);
2462}
2463
Radek Krejci22ebdba2019-07-25 13:59:43 +02002464/**
Michal Vasko52927e22020-03-16 17:26:14 +01002465 * @brief Duplicate a single node and connect it into @p parent (if present) or last of @p first siblings.
Radek Krejci22ebdba2019-07-25 13:59:43 +02002466 *
2467 * Ignores LYD_DUP_WITH_PARENTS and LYD_DUP_WITH_SIBLINGS which are supposed to be handled by lyd_dup().
Radek Krejcif8b95172020-05-15 14:51:06 +02002468 *
2469 * @param[in] node Original node to duplicate
2470 * @param[in] parent Parent to insert into, NULL for top-level sibling.
2471 * @param[in,out] first First sibling, NULL if no top-level sibling exist yet. Can be also NULL if @p parent is set.
2472 * @param[in] options Bitmask of options flags, see @ref dupoptions.
2473 * @param[out] dup_p Pointer where the created duplicated node is placed (besides connecting it int @p parent / @p first sibling).
2474 * @return LY_ERR value
Radek Krejci22ebdba2019-07-25 13:59:43 +02002475 */
Michal Vasko52927e22020-03-16 17:26:14 +01002476static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02002477lyd_dup_r(const struct lyd_node *node, struct lyd_node *parent, struct lyd_node **first, uint32_t options,
Radek Krejci0f969882020-08-21 16:56:47 +02002478 struct lyd_node **dup_p)
Radek Krejci22ebdba2019-07-25 13:59:43 +02002479{
Michal Vasko52927e22020-03-16 17:26:14 +01002480 LY_ERR ret;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002481 struct lyd_node *dup = NULL;
Michal Vasko61551fa2020-07-09 15:45:45 +02002482 struct lyd_meta *meta;
2483 struct lyd_node_any *any;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002484
Michal Vasko52927e22020-03-16 17:26:14 +01002485 LY_CHECK_ARG_RET(NULL, node, LY_EINVAL);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002486
Michal Vasko52927e22020-03-16 17:26:14 +01002487 if (!node->schema) {
2488 dup = calloc(1, sizeof(struct lyd_node_opaq));
2489 } else {
2490 switch (node->schema->nodetype) {
Michal Vasko1bf09392020-03-27 12:38:10 +01002491 case LYS_RPC:
Michal Vasko52927e22020-03-16 17:26:14 +01002492 case LYS_ACTION:
2493 case LYS_NOTIF:
2494 case LYS_CONTAINER:
2495 case LYS_LIST:
2496 dup = calloc(1, sizeof(struct lyd_node_inner));
2497 break;
2498 case LYS_LEAF:
2499 case LYS_LEAFLIST:
2500 dup = calloc(1, sizeof(struct lyd_node_term));
2501 break;
2502 case LYS_ANYDATA:
2503 case LYS_ANYXML:
2504 dup = calloc(1, sizeof(struct lyd_node_any));
2505 break;
2506 default:
Michal Vaskob7be7a82020-08-20 09:09:04 +02002507 LOGINT(LYD_CTX(node));
Michal Vasko52927e22020-03-16 17:26:14 +01002508 ret = LY_EINT;
2509 goto error;
2510 }
Radek Krejci22ebdba2019-07-25 13:59:43 +02002511 }
Michal Vaskob7be7a82020-08-20 09:09:04 +02002512 LY_CHECK_ERR_GOTO(!dup, LOGMEM(LYD_CTX(node)); ret = LY_EMEM, error);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002513
Michal Vaskof6df0a02020-06-16 13:08:34 +02002514 if (options & LYD_DUP_WITH_FLAGS) {
2515 dup->flags = node->flags;
2516 } else {
2517 dup->flags = (node->flags & LYD_DEFAULT) | LYD_NEW;
2518 }
Radek Krejci22ebdba2019-07-25 13:59:43 +02002519 dup->schema = node->schema;
Michal Vasko52927e22020-03-16 17:26:14 +01002520 dup->prev = dup;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002521
Michal Vasko25a32822020-07-09 15:48:22 +02002522 /* duplicate metadata */
2523 if (!(options & LYD_DUP_NO_META)) {
2524 LY_LIST_FOR(node->meta, meta) {
Michal Vasko3a41dff2020-07-15 14:30:28 +02002525 LY_CHECK_GOTO(ret = lyd_dup_meta_single(meta, dup, NULL), error);
Michal Vasko25a32822020-07-09 15:48:22 +02002526 }
2527 }
Radek Krejci22ebdba2019-07-25 13:59:43 +02002528
2529 /* nodetype-specific work */
Michal Vasko52927e22020-03-16 17:26:14 +01002530 if (!dup->schema) {
2531 struct lyd_node_opaq *opaq = (struct lyd_node_opaq *)dup;
2532 struct lyd_node_opaq *orig = (struct lyd_node_opaq *)node;
2533 struct lyd_node *child;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002534
2535 if (options & LYD_DUP_RECURSIVE) {
2536 /* duplicate all the children */
2537 LY_LIST_FOR(orig->child, child) {
Michal Vasko3a41dff2020-07-15 14:30:28 +02002538 LY_CHECK_GOTO(ret = lyd_dup_r(child, dup, NULL, options, NULL), error);
Michal Vasko52927e22020-03-16 17:26:14 +01002539 }
2540 }
Radek Krejci011e4aa2020-09-04 15:22:31 +02002541 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), orig->name, 0, &opaq->name), error);
Michal Vasko52927e22020-03-16 17:26:14 +01002542 opaq->format = orig->format;
Radek Krejci1798aae2020-07-14 13:26:06 +02002543 if (orig->prefix.id) {
Radek Krejci011e4aa2020-09-04 15:22:31 +02002544 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), orig->prefix.id, 0, &opaq->prefix.id), error);
Michal Vasko52927e22020-03-16 17:26:14 +01002545 }
Radek Krejci011e4aa2020-09-04 15:22:31 +02002546 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), orig->prefix.module_ns, 0, &opaq->prefix.module_ns), error);
Michal Vasko6b5cb2a2020-11-11 19:11:21 +01002547 if (orig->val_prefix_data) {
2548 ret = ly_dup_prefix_data(LYD_CTX(node), opaq->format, orig->val_prefix_data, &opaq->val_prefix_data);
2549 LY_CHECK_GOTO(ret, error);
Michal Vasko52927e22020-03-16 17:26:14 +01002550 }
Radek Krejci011e4aa2020-09-04 15:22:31 +02002551 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), orig->value, 0, &opaq->value), error);
Michal Vasko52927e22020-03-16 17:26:14 +01002552 opaq->ctx = orig->ctx;
2553 } else if (dup->schema->nodetype & LYD_NODE_TERM) {
2554 struct lyd_node_term *term = (struct lyd_node_term *)dup;
2555 struct lyd_node_term *orig = (struct lyd_node_term *)node;
2556
2557 term->hash = orig->hash;
Michal Vaskob7be7a82020-08-20 09:09:04 +02002558 LY_CHECK_ERR_GOTO(orig->value.realtype->plugin->duplicate(LYD_CTX(node), &orig->value, &term->value),
Michal Vasko69730152020-10-09 16:30:07 +02002559 LOGERR(LYD_CTX(node), LY_EINT, "Value duplication failed."); ret = LY_EINT, error);
Michal Vasko52927e22020-03-16 17:26:14 +01002560 } else if (dup->schema->nodetype & LYD_NODE_INNER) {
2561 struct lyd_node_inner *orig = (struct lyd_node_inner *)node;
2562 struct lyd_node *child;
2563
2564 if (options & LYD_DUP_RECURSIVE) {
2565 /* duplicate all the children */
2566 LY_LIST_FOR(orig->child, child) {
Michal Vasko3a41dff2020-07-15 14:30:28 +02002567 LY_CHECK_GOTO(ret = lyd_dup_r(child, dup, NULL, options, NULL), error);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002568 }
Michal Vasko69730152020-10-09 16:30:07 +02002569 } else if ((dup->schema->nodetype == LYS_LIST) && !(dup->schema->flags & LYS_KEYLESS)) {
Radek Krejci22ebdba2019-07-25 13:59:43 +02002570 /* always duplicate keys of a list */
Radek Krejci22ebdba2019-07-25 13:59:43 +02002571 child = orig->child;
Michal Vasko52927e22020-03-16 17:26:14 +01002572 for (struct lysc_node *key = ((struct lysc_node_list *)dup->schema)->child;
Michal Vaskoc57d9a92020-06-23 13:28:27 +02002573 key && (key->flags & LYS_KEY);
Radek Krejci0fe9b512019-07-26 17:51:05 +02002574 key = key->next) {
Radek Krejci22ebdba2019-07-25 13:59:43 +02002575 if (!child) {
2576 /* possibly not keys are present in filtered tree */
2577 break;
Radek Krejci0fe9b512019-07-26 17:51:05 +02002578 } else if (child->schema != key) {
2579 /* possibly not all keys are present in filtered tree,
2580 * but there can be also some non-key nodes */
2581 continue;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002582 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02002583 LY_CHECK_GOTO(ret = lyd_dup_r(child, dup, NULL, options, NULL), error);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002584 child = child->next;
2585 }
2586 }
2587 lyd_hash(dup);
2588 } else if (dup->schema->nodetype & LYD_NODE_ANY) {
Michal Vasko61551fa2020-07-09 15:45:45 +02002589 dup->hash = node->hash;
2590 any = (struct lyd_node_any *)node;
2591 LY_CHECK_GOTO(ret = lyd_any_copy_value(dup, &any->value, any->value_type), error);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002592 }
2593
Michal Vasko52927e22020-03-16 17:26:14 +01002594 /* insert */
2595 lyd_insert_node(parent, first, dup);
Michal Vasko52927e22020-03-16 17:26:14 +01002596
2597 if (dup_p) {
2598 *dup_p = dup;
2599 }
2600 return LY_SUCCESS;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002601
2602error:
Michal Vasko52927e22020-03-16 17:26:14 +01002603 lyd_free_tree(dup);
2604 return ret;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002605}
2606
Michal Vasko3a41dff2020-07-15 14:30:28 +02002607static LY_ERR
2608lyd_dup_get_local_parent(const struct lyd_node *node, const struct lyd_node_inner *parent, struct lyd_node **dup_parent,
Radek Krejci0f969882020-08-21 16:56:47 +02002609 struct lyd_node_inner **local_parent)
Radek Krejci22ebdba2019-07-25 13:59:43 +02002610{
Michal Vasko3a41dff2020-07-15 14:30:28 +02002611 const struct lyd_node_inner *orig_parent, *iter;
Radek Krejci857189e2020-09-01 13:26:36 +02002612 ly_bool repeat = 1;
Michal Vasko3a41dff2020-07-15 14:30:28 +02002613
2614 *dup_parent = NULL;
2615 *local_parent = NULL;
2616
2617 for (orig_parent = node->parent; repeat && orig_parent; orig_parent = orig_parent->parent) {
2618 if (parent && (parent->schema == orig_parent->schema)) {
2619 /* stop creating parents, connect what we have into the provided parent */
2620 iter = parent;
2621 repeat = 0;
2622 } else {
2623 iter = NULL;
2624 LY_CHECK_RET(lyd_dup_r((struct lyd_node *)orig_parent, NULL, (struct lyd_node **)&iter, 0,
Radek Krejci0f969882020-08-21 16:56:47 +02002625 (struct lyd_node **)&iter));
Michal Vasko3a41dff2020-07-15 14:30:28 +02002626 }
2627 if (!*local_parent) {
2628 *local_parent = (struct lyd_node_inner *)iter;
2629 }
2630 if (iter->child) {
2631 /* 1) list - add after keys
2632 * 2) provided parent with some children */
2633 iter->child->prev->next = *dup_parent;
2634 if (*dup_parent) {
2635 (*dup_parent)->prev = iter->child->prev;
2636 iter->child->prev = *dup_parent;
2637 }
2638 } else {
2639 ((struct lyd_node_inner *)iter)->child = *dup_parent;
2640 }
2641 if (*dup_parent) {
2642 (*dup_parent)->parent = (struct lyd_node_inner *)iter;
2643 }
2644 *dup_parent = (struct lyd_node *)iter;
2645 }
2646
2647 if (repeat && parent) {
2648 /* given parent and created parents chain actually do not interconnect */
Michal Vaskob7be7a82020-08-20 09:09:04 +02002649 LOGERR(LYD_CTX(node), LY_EINVAL,
Michal Vasko69730152020-10-09 16:30:07 +02002650 "Invalid argument parent (%s()) - does not interconnect with the created node's parents chain.", __func__);
Michal Vasko3a41dff2020-07-15 14:30:28 +02002651 return LY_EINVAL;
2652 }
2653
2654 return LY_SUCCESS;
2655}
2656
2657static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02002658lyd_dup(const struct lyd_node *node, struct lyd_node_inner *parent, uint32_t options, ly_bool nosiblings, struct lyd_node **dup)
Michal Vasko3a41dff2020-07-15 14:30:28 +02002659{
2660 LY_ERR rc;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002661 const struct lyd_node *orig; /* original node to be duplicated */
2662 struct lyd_node *first = NULL; /* the first duplicated node, this is returned */
Radek Krejci22ebdba2019-07-25 13:59:43 +02002663 struct lyd_node *top = NULL; /* the most higher created node */
2664 struct lyd_node_inner *local_parent = NULL; /* the direct parent node for the duplicated node(s) */
Radek Krejci22ebdba2019-07-25 13:59:43 +02002665
Michal Vasko3a41dff2020-07-15 14:30:28 +02002666 LY_CHECK_ARG_RET(NULL, node, LY_EINVAL);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002667
2668 if (options & LYD_DUP_WITH_PARENTS) {
Michal Vasko3a41dff2020-07-15 14:30:28 +02002669 LY_CHECK_GOTO(rc = lyd_dup_get_local_parent(node, parent, &top, &local_parent), error);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002670 } else {
2671 local_parent = parent;
2672 }
2673
Radek Krejci22ebdba2019-07-25 13:59:43 +02002674 LY_LIST_FOR(node, orig) {
Michal Vasko52927e22020-03-16 17:26:14 +01002675 /* if there is no local parent, it will be inserted into first */
Michal Vasko3a41dff2020-07-15 14:30:28 +02002676 LY_CHECK_GOTO(rc = lyd_dup_r(orig, (struct lyd_node *)local_parent, &first, options, first ? NULL : &first), error);
2677 if (nosiblings) {
Radek Krejci22ebdba2019-07-25 13:59:43 +02002678 break;
2679 }
2680 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02002681
2682 /* rehash if needed */
Michal Vaskod989ba02020-08-24 10:59:24 +02002683 for ( ; local_parent; local_parent = local_parent->parent) {
Michal Vasko69730152020-10-09 16:30:07 +02002684 if ((local_parent->schema->nodetype == LYS_LIST) && (local_parent->schema->flags & LYS_KEYLESS)) {
Michal Vasko3a41dff2020-07-15 14:30:28 +02002685 lyd_hash((struct lyd_node *)local_parent);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002686 }
2687 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02002688
2689 if (dup) {
2690 *dup = first;
2691 }
2692 return LY_SUCCESS;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002693
2694error:
2695 if (top) {
2696 lyd_free_tree(top);
2697 } else {
Michal Vaskof03ed032020-03-04 13:31:44 +01002698 lyd_free_siblings(first);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002699 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02002700 return rc;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002701}
Michal Vasko5ec7cda2019-09-11 13:43:08 +02002702
Michal Vasko3a41dff2020-07-15 14:30:28 +02002703API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02002704lyd_dup_single(const struct lyd_node *node, struct lyd_node_inner *parent, uint32_t options, struct lyd_node **dup)
Michal Vasko3a41dff2020-07-15 14:30:28 +02002705{
2706 return lyd_dup(node, parent, options, 1, dup);
2707}
2708
2709API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02002710lyd_dup_siblings(const struct lyd_node *node, struct lyd_node_inner *parent, uint32_t options, struct lyd_node **dup)
Michal Vasko3a41dff2020-07-15 14:30:28 +02002711{
2712 return lyd_dup(node, parent, options, 0, dup);
2713}
2714
2715API LY_ERR
2716lyd_dup_meta_single(const struct lyd_meta *meta, struct lyd_node *node, struct lyd_meta **dup)
Michal Vasko25a32822020-07-09 15:48:22 +02002717{
Radek Krejci011e4aa2020-09-04 15:22:31 +02002718 LY_ERR ret = LY_SUCCESS;
Michal Vasko25a32822020-07-09 15:48:22 +02002719 struct lyd_meta *mt, *last;
2720
Michal Vasko3a41dff2020-07-15 14:30:28 +02002721 LY_CHECK_ARG_RET(NULL, meta, node, LY_EINVAL);
Michal Vasko25a32822020-07-09 15:48:22 +02002722
2723 /* create a copy */
2724 mt = calloc(1, sizeof *mt);
Michal Vaskob7be7a82020-08-20 09:09:04 +02002725 LY_CHECK_ERR_RET(!mt, LOGMEM(LYD_CTX(node)), LY_EMEM);
Michal Vasko25a32822020-07-09 15:48:22 +02002726 mt->annotation = meta->annotation;
Michal Vaskob7be7a82020-08-20 09:09:04 +02002727 ret = meta->value.realtype->plugin->duplicate(LYD_CTX(node), &meta->value, &mt->value);
Radek Krejci011e4aa2020-09-04 15:22:31 +02002728 LY_CHECK_ERR_GOTO(ret, LOGERR(LYD_CTX(node), LY_EINT, "Value duplication failed."), finish);
2729 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), meta->name, 0, &mt->name), finish);
Michal Vasko25a32822020-07-09 15:48:22 +02002730
2731 /* insert as the last attribute */
Radek Krejci011e4aa2020-09-04 15:22:31 +02002732 mt->parent = node;
Michal Vasko25a32822020-07-09 15:48:22 +02002733 if (node->meta) {
Radek Krejci1e008d22020-08-17 11:37:37 +02002734 for (last = node->meta; last->next; last = last->next) {}
Michal Vasko25a32822020-07-09 15:48:22 +02002735 last->next = mt;
2736 } else {
2737 node->meta = mt;
2738 }
2739
Radek Krejci011e4aa2020-09-04 15:22:31 +02002740finish:
2741 if (ret) {
2742 lyd_free_meta_single(mt);
2743 } else if (dup) {
Michal Vasko3a41dff2020-07-15 14:30:28 +02002744 *dup = mt;
2745 }
2746 return LY_SUCCESS;
Michal Vasko25a32822020-07-09 15:48:22 +02002747}
2748
Michal Vasko4490d312020-06-16 13:08:55 +02002749/**
2750 * @brief Merge a source sibling into target siblings.
2751 *
2752 * @param[in,out] first_trg First target sibling, is updated if top-level.
2753 * @param[in] parent_trg Target parent.
2754 * @param[in,out] sibling_src Source sibling to merge, set to NULL if spent.
2755 * @param[in] options Merge options.
2756 * @return LY_ERR value.
2757 */
2758static LY_ERR
2759lyd_merge_sibling_r(struct lyd_node **first_trg, struct lyd_node *parent_trg, const struct lyd_node **sibling_src_p,
Radek Krejci1deb5be2020-08-26 16:43:36 +02002760 uint16_t options)
Michal Vasko4490d312020-06-16 13:08:55 +02002761{
2762 LY_ERR ret;
2763 const struct lyd_node *child_src, *tmp, *sibling_src;
Michal Vasko56daf732020-08-10 10:57:18 +02002764 struct lyd_node *match_trg, *dup_src, *elem;
Michal Vasko4490d312020-06-16 13:08:55 +02002765 struct lysc_type *type;
Michal Vasko4490d312020-06-16 13:08:55 +02002766
2767 sibling_src = *sibling_src_p;
2768 if (sibling_src->schema->nodetype & (LYS_LIST | LYS_LEAFLIST)) {
2769 /* try to find the exact instance */
2770 ret = lyd_find_sibling_first(*first_trg, sibling_src, &match_trg);
2771 } else {
2772 /* try to simply find the node, there cannot be more instances */
2773 ret = lyd_find_sibling_val(*first_trg, sibling_src->schema, NULL, 0, &match_trg);
2774 }
2775
2776 if (!ret) {
2777 /* node found, make sure even value matches for all node types */
Michal Vasko8f359bf2020-07-28 10:41:15 +02002778 if ((match_trg->schema->nodetype == LYS_LEAF) && lyd_compare_single(sibling_src, match_trg, LYD_COMPARE_DEFAULTS)) {
Michal Vasko4490d312020-06-16 13:08:55 +02002779 /* since they are different, they cannot both be default */
2780 assert(!(sibling_src->flags & LYD_DEFAULT) || !(match_trg->flags & LYD_DEFAULT));
2781
Michal Vasko3a41dff2020-07-15 14:30:28 +02002782 /* update value (or only LYD_DEFAULT flag) only if flag set or the source node is not default */
2783 if ((options & LYD_MERGE_DEFAULTS) || !(sibling_src->flags & LYD_DEFAULT)) {
Michal Vasko4490d312020-06-16 13:08:55 +02002784 type = ((struct lysc_node_leaf *)match_trg->schema)->type;
Michal Vaskob7be7a82020-08-20 09:09:04 +02002785 type->plugin->free(LYD_CTX(match_trg), &((struct lyd_node_term *)match_trg)->value);
2786 LY_CHECK_RET(type->plugin->duplicate(LYD_CTX(match_trg), &((struct lyd_node_term *)sibling_src)->value,
Michal Vasko69730152020-10-09 16:30:07 +02002787 &((struct lyd_node_term *)match_trg)->value));
Michal Vasko4490d312020-06-16 13:08:55 +02002788
2789 /* copy flags and add LYD_NEW */
2790 match_trg->flags = sibling_src->flags | LYD_NEW;
2791 }
Michal Vasko8f359bf2020-07-28 10:41:15 +02002792 } else if ((match_trg->schema->nodetype & LYS_ANYDATA) && lyd_compare_single(sibling_src, match_trg, 0)) {
Michal Vasko4c583e82020-07-17 12:16:14 +02002793 /* update value */
2794 LY_CHECK_RET(lyd_any_copy_value(match_trg, &((struct lyd_node_any *)sibling_src)->value,
Radek Krejci0f969882020-08-21 16:56:47 +02002795 ((struct lyd_node_any *)sibling_src)->value_type));
Michal Vasko4490d312020-06-16 13:08:55 +02002796
2797 /* copy flags and add LYD_NEW */
2798 match_trg->flags = sibling_src->flags | LYD_NEW;
Michal Vasko4490d312020-06-16 13:08:55 +02002799 } else {
2800 /* check descendants, recursively */
Radek Krejcia1c1e542020-09-29 16:06:52 +02002801 LY_LIST_FOR_SAFE(lyd_child_no_keys(sibling_src), tmp, child_src) {
Michal Vasko4490d312020-06-16 13:08:55 +02002802 LY_CHECK_RET(lyd_merge_sibling_r(lyd_node_children_p(match_trg), match_trg, &child_src, options));
2803 }
2804 }
2805 } else {
2806 /* node not found, merge it */
2807 if (options & LYD_MERGE_DESTRUCT) {
2808 dup_src = (struct lyd_node *)sibling_src;
2809 lyd_unlink_tree(dup_src);
2810 /* spend it */
2811 *sibling_src_p = NULL;
2812 } else {
Michal Vasko3a41dff2020-07-15 14:30:28 +02002813 LY_CHECK_RET(lyd_dup_single(sibling_src, NULL, LYD_DUP_RECURSIVE | LYD_DUP_WITH_FLAGS, &dup_src));
Michal Vasko4490d312020-06-16 13:08:55 +02002814 }
2815
2816 /* set LYD_NEW for all the new nodes, required for validation */
Michal Vasko56daf732020-08-10 10:57:18 +02002817 LYD_TREE_DFS_BEGIN(dup_src, elem) {
Michal Vasko4490d312020-06-16 13:08:55 +02002818 elem->flags |= LYD_NEW;
Michal Vasko56daf732020-08-10 10:57:18 +02002819 LYD_TREE_DFS_END(dup_src, elem);
Michal Vasko4490d312020-06-16 13:08:55 +02002820 }
2821
2822 lyd_insert_node(parent_trg, first_trg, dup_src);
2823 }
2824
2825 return LY_SUCCESS;
2826}
2827
Michal Vasko3a41dff2020-07-15 14:30:28 +02002828static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02002829lyd_merge(struct lyd_node **target, const struct lyd_node *source, uint16_t options, ly_bool nosiblings)
Michal Vasko4490d312020-06-16 13:08:55 +02002830{
2831 const struct lyd_node *sibling_src, *tmp;
Radek Krejci857189e2020-09-01 13:26:36 +02002832 ly_bool first;
Michal Vasko4490d312020-06-16 13:08:55 +02002833
2834 LY_CHECK_ARG_RET(NULL, target, LY_EINVAL);
2835
2836 if (!source) {
2837 /* nothing to merge */
2838 return LY_SUCCESS;
2839 }
2840
2841 if (lysc_data_parent((*target)->schema) || lysc_data_parent(source->schema)) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02002842 LOGERR(LYD_CTX(source), LY_EINVAL, "Invalid arguments - can merge only 2 top-level subtrees (%s()).", __func__);
Michal Vasko4490d312020-06-16 13:08:55 +02002843 return LY_EINVAL;
2844 }
2845
2846 LY_LIST_FOR_SAFE(source, tmp, sibling_src) {
Radek Krejci857189e2020-09-01 13:26:36 +02002847 first = (sibling_src == source) ? 1 : 0;
Michal Vasko4490d312020-06-16 13:08:55 +02002848 LY_CHECK_RET(lyd_merge_sibling_r(target, NULL, &sibling_src, options));
2849 if (first && !sibling_src) {
2850 /* source was spent (unlinked), move to the next node */
2851 source = tmp;
2852 }
2853
Michal Vasko3a41dff2020-07-15 14:30:28 +02002854 if (nosiblings) {
Michal Vasko4490d312020-06-16 13:08:55 +02002855 break;
2856 }
2857 }
2858
2859 if (options & LYD_MERGE_DESTRUCT) {
2860 /* free any leftover source data that were not merged */
2861 lyd_free_siblings((struct lyd_node *)source);
2862 }
2863
2864 return LY_SUCCESS;
2865}
2866
Michal Vasko3a41dff2020-07-15 14:30:28 +02002867API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02002868lyd_merge_tree(struct lyd_node **target, const struct lyd_node *source, uint16_t options)
Michal Vasko3a41dff2020-07-15 14:30:28 +02002869{
2870 return lyd_merge(target, source, options, 1);
2871}
2872
2873API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02002874lyd_merge_siblings(struct lyd_node **target, const struct lyd_node *source, uint16_t options)
Michal Vasko3a41dff2020-07-15 14:30:28 +02002875{
2876 return lyd_merge(target, source, options, 0);
2877}
2878
Michal Vasko5ec7cda2019-09-11 13:43:08 +02002879static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02002880lyd_path_str_enlarge(char **buffer, size_t *buflen, size_t reqlen, ly_bool is_static)
Michal Vasko5ec7cda2019-09-11 13:43:08 +02002881{
Michal Vasko14654712020-02-06 08:35:21 +01002882 /* ending \0 */
2883 ++reqlen;
2884
Michal Vasko5ec7cda2019-09-11 13:43:08 +02002885 if (reqlen > *buflen) {
2886 if (is_static) {
2887 return LY_EINCOMPLETE;
2888 }
2889
2890 *buffer = ly_realloc(*buffer, reqlen * sizeof **buffer);
2891 if (!*buffer) {
2892 return LY_EMEM;
2893 }
2894
2895 *buflen = reqlen;
2896 }
2897
2898 return LY_SUCCESS;
2899}
2900
Michal Vaskod59035b2020-07-08 12:00:06 +02002901LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02002902lyd_path_list_predicate(const struct lyd_node *node, char **buffer, size_t *buflen, size_t *bufused, ly_bool is_static)
Michal Vasko5ec7cda2019-09-11 13:43:08 +02002903{
2904 const struct lyd_node *key;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02002905 size_t len;
2906 const char *val;
2907 char quot;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02002908
Radek Krejcia1c1e542020-09-29 16:06:52 +02002909 for (key = lyd_child(node); key && (key->schema->flags & LYS_KEY); key = key->next) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02002910 val = LYD_CANON_VALUE(key);
Michal Vasko5ec7cda2019-09-11 13:43:08 +02002911 len = 1 + strlen(key->schema->name) + 2 + strlen(val) + 2;
Michal Vaskoba99a3e2020-08-18 15:50:05 +02002912 LY_CHECK_RET(lyd_path_str_enlarge(buffer, buflen, *bufused + len, is_static));
Michal Vasko5ec7cda2019-09-11 13:43:08 +02002913
2914 quot = '\'';
2915 if (strchr(val, '\'')) {
2916 quot = '"';
2917 }
2918 *bufused += sprintf(*buffer + *bufused, "[%s=%c%s%c]", key->schema->name, quot, val, quot);
Michal Vasko5ec7cda2019-09-11 13:43:08 +02002919 }
2920
2921 return LY_SUCCESS;
2922}
2923
2924/**
2925 * @brief Append leaf-list value predicate to path.
2926 *
2927 * @param[in] node Node to print.
2928 * @param[in,out] buffer Buffer to print to.
2929 * @param[in,out] buflen Current buffer length.
2930 * @param[in,out] bufused Current number of characters used in @p buffer.
2931 * @param[in] is_static Whether buffer is static or can be reallocated.
2932 * @return LY_ERR
2933 */
2934static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02002935lyd_path_leaflist_predicate(const struct lyd_node *node, char **buffer, size_t *buflen, size_t *bufused, ly_bool is_static)
Michal Vasko5ec7cda2019-09-11 13:43:08 +02002936{
Michal Vasko5ec7cda2019-09-11 13:43:08 +02002937 size_t len;
2938 const char *val;
2939 char quot;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02002940
Michal Vaskob7be7a82020-08-20 09:09:04 +02002941 val = LYD_CANON_VALUE(node);
Michal Vasko5ec7cda2019-09-11 13:43:08 +02002942 len = 4 + strlen(val) + 2;
Michal Vaskoba99a3e2020-08-18 15:50:05 +02002943 LY_CHECK_RET(lyd_path_str_enlarge(buffer, buflen, *bufused + len, is_static));
Michal Vasko5ec7cda2019-09-11 13:43:08 +02002944
2945 quot = '\'';
2946 if (strchr(val, '\'')) {
2947 quot = '"';
2948 }
2949 *bufused += sprintf(*buffer + *bufused, "[.=%c%s%c]", quot, val, quot);
2950
Michal Vaskoba99a3e2020-08-18 15:50:05 +02002951 return LY_SUCCESS;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02002952}
2953
2954/**
2955 * @brief Append node position (relative to its other instances) predicate to path.
2956 *
2957 * @param[in] node Node to print.
2958 * @param[in,out] buffer Buffer to print to.
2959 * @param[in,out] buflen Current buffer length.
2960 * @param[in,out] bufused Current number of characters used in @p buffer.
2961 * @param[in] is_static Whether buffer is static or can be reallocated.
2962 * @return LY_ERR
2963 */
2964static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02002965lyd_path_position_predicate(const struct lyd_node *node, char **buffer, size_t *buflen, size_t *bufused, ly_bool is_static)
Michal Vasko5ec7cda2019-09-11 13:43:08 +02002966{
2967 const struct lyd_node *first, *iter;
2968 size_t len;
Radek Krejci1deb5be2020-08-26 16:43:36 +02002969 uint64_t pos;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02002970 char *val = NULL;
2971 LY_ERR rc;
2972
2973 if (node->parent) {
2974 first = node->parent->child;
2975 } else {
Michal Vaskoe070bfe2020-08-31 12:27:25 +02002976 for (first = node; first->prev->next; first = first->prev) {}
Michal Vasko5ec7cda2019-09-11 13:43:08 +02002977 }
2978 pos = 1;
2979 for (iter = first; iter != node; iter = iter->next) {
2980 if (iter->schema == node->schema) {
2981 ++pos;
2982 }
2983 }
Radek Krejci1deb5be2020-08-26 16:43:36 +02002984 if (asprintf(&val, "%" PRIu64, pos) == -1) {
Michal Vasko5ec7cda2019-09-11 13:43:08 +02002985 return LY_EMEM;
2986 }
2987
2988 len = 1 + strlen(val) + 1;
2989 rc = lyd_path_str_enlarge(buffer, buflen, *bufused + len, is_static);
2990 if (rc != LY_SUCCESS) {
2991 goto cleanup;
2992 }
2993
2994 *bufused += sprintf(*buffer + *bufused, "[%s]", val);
2995
2996cleanup:
2997 free(val);
2998 return rc;
2999}
3000
3001API char *
3002lyd_path(const struct lyd_node *node, LYD_PATH_TYPE pathtype, char *buffer, size_t buflen)
3003{
Radek Krejci857189e2020-09-01 13:26:36 +02003004 ly_bool is_static = 0;
Radek Krejci1deb5be2020-08-26 16:43:36 +02003005 uint32_t i, depth;
Michal Vasko14654712020-02-06 08:35:21 +01003006 size_t bufused = 0, len;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003007 const struct lyd_node *iter;
3008 const struct lys_module *mod;
Michal Vasko790b2bc2020-08-03 13:35:06 +02003009 LY_ERR rc = LY_SUCCESS;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003010
3011 LY_CHECK_ARG_RET(NULL, node, NULL);
3012 if (buffer) {
3013 LY_CHECK_ARG_RET(node->schema->module->ctx, buflen > 1, NULL);
3014 is_static = 1;
Michal Vasko14654712020-02-06 08:35:21 +01003015 } else {
3016 buflen = 0;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003017 }
3018
3019 switch (pathtype) {
Michal Vasko14654712020-02-06 08:35:21 +01003020 case LYD_PATH_LOG:
Michal Vasko790b2bc2020-08-03 13:35:06 +02003021 case LYD_PATH_LOG_NO_LAST_PRED:
Michal Vasko14654712020-02-06 08:35:21 +01003022 depth = 1;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003023 for (iter = node; iter->parent; iter = (const struct lyd_node *)iter->parent) {
3024 ++depth;
3025 }
3026
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003027 goto iter_print;
Michal Vasko14654712020-02-06 08:35:21 +01003028 while (depth) {
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003029 /* find the right node */
Radek Krejci1e008d22020-08-17 11:37:37 +02003030 for (iter = node, i = 1; i < depth; iter = (const struct lyd_node *)iter->parent, ++i) {}
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003031iter_print:
3032 /* print prefix and name */
3033 mod = NULL;
Michal Vasko69730152020-10-09 16:30:07 +02003034 if (iter->schema && (!iter->parent || (iter->schema->module != iter->parent->schema->module))) {
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003035 mod = iter->schema->module;
3036 }
3037
3038 /* realloc string */
Michal Vasko22df3f02020-08-24 13:29:22 +02003039 len = 1 + (mod ? strlen(mod->name) + 1 : 0) + (iter->schema ? strlen(iter->schema->name) : strlen(((struct lyd_node_opaq *)iter)->name));
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003040 rc = lyd_path_str_enlarge(&buffer, &buflen, bufused + len, is_static);
3041 if (rc != LY_SUCCESS) {
3042 break;
3043 }
3044
3045 /* print next node */
Radek Krejci1798aae2020-07-14 13:26:06 +02003046 bufused += sprintf(buffer + bufused, "/%s%s%s", mod ? mod->name : "", mod ? ":" : "",
Michal Vasko69730152020-10-09 16:30:07 +02003047 iter->schema ? iter->schema->name : ((struct lyd_node_opaq *)iter)->name);
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003048
Michal Vasko790b2bc2020-08-03 13:35:06 +02003049 /* do not always print the last (first) predicate */
Michal Vasko552e1122020-11-06 17:22:44 +01003050 if (iter->schema && ((depth > 1) || (pathtype == LYD_PATH_LOG))) {
Michal Vasko790b2bc2020-08-03 13:35:06 +02003051 switch (iter->schema->nodetype) {
3052 case LYS_LIST:
3053 if (iter->schema->flags & LYS_KEYLESS) {
3054 /* print its position */
3055 rc = lyd_path_position_predicate(iter, &buffer, &buflen, &bufused, is_static);
3056 } else {
3057 /* print all list keys in predicates */
3058 rc = lyd_path_list_predicate(iter, &buffer, &buflen, &bufused, is_static);
3059 }
3060 break;
3061 case LYS_LEAFLIST:
3062 if (iter->schema->flags & LYS_CONFIG_W) {
3063 /* print leaf-list value */
3064 rc = lyd_path_leaflist_predicate(iter, &buffer, &buflen, &bufused, is_static);
3065 } else {
3066 /* print its position */
3067 rc = lyd_path_position_predicate(iter, &buffer, &buflen, &bufused, is_static);
3068 }
3069 break;
3070 default:
3071 /* nothing to print more */
3072 break;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003073 }
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003074 }
3075 if (rc != LY_SUCCESS) {
3076 break;
3077 }
3078
Michal Vasko14654712020-02-06 08:35:21 +01003079 --depth;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003080 }
3081 break;
3082 }
3083
3084 return buffer;
3085}
Michal Vaskoe444f752020-02-10 12:20:06 +01003086
Michal Vasko25a32822020-07-09 15:48:22 +02003087API struct lyd_meta *
3088lyd_find_meta(const struct lyd_meta *first, const struct lys_module *module, const char *name)
3089{
3090 struct lyd_meta *ret = NULL;
3091 const struct ly_ctx *ctx;
3092 const char *prefix, *tmp;
3093 char *str;
3094 size_t pref_len, name_len;
3095
3096 LY_CHECK_ARG_RET(NULL, module || strchr(name, ':'), name, NULL);
3097
3098 if (!first) {
3099 return NULL;
3100 }
3101
3102 ctx = first->annotation->module->ctx;
3103
3104 /* parse the name */
3105 tmp = name;
3106 if (ly_parse_nodeid(&tmp, &prefix, &pref_len, &name, &name_len) || tmp[0]) {
3107 LOGERR(ctx, LY_EINVAL, "Metadata name \"%s\" is not valid.", name);
3108 return NULL;
3109 }
3110
3111 /* find the module */
3112 if (prefix) {
3113 str = strndup(prefix, pref_len);
3114 module = ly_ctx_get_module_latest(ctx, str);
3115 free(str);
3116 LY_CHECK_ERR_RET(!module, LOGERR(ctx, LY_EINVAL, "Module \"%.*s\" not found.", pref_len, prefix), NULL);
3117 }
3118
3119 /* find the metadata */
3120 LY_LIST_FOR(first, first) {
3121 if ((first->annotation->module == module) && !strcmp(first->name, name)) {
3122 ret = (struct lyd_meta *)first;
3123 break;
3124 }
3125 }
3126
3127 return ret;
3128}
3129
Michal Vasko9b368d32020-02-14 13:53:31 +01003130API LY_ERR
Michal Vaskoe444f752020-02-10 12:20:06 +01003131lyd_find_sibling_first(const struct lyd_node *siblings, const struct lyd_node *target, struct lyd_node **match)
3132{
3133 struct lyd_node **match_p;
3134 struct lyd_node_inner *parent;
3135
Michal Vaskof03ed032020-03-04 13:31:44 +01003136 LY_CHECK_ARG_RET(NULL, target, LY_EINVAL);
Michal Vaskoe444f752020-02-10 12:20:06 +01003137
Michal Vasko62ed12d2020-05-21 10:08:25 +02003138 if (!siblings || (lysc_data_parent(siblings->schema) != lysc_data_parent(target->schema))) {
3139 /* no data or schema mismatch */
Michal Vasko9b368d32020-02-14 13:53:31 +01003140 if (match) {
3141 *match = NULL;
3142 }
Michal Vaskoe444f752020-02-10 12:20:06 +01003143 return LY_ENOTFOUND;
3144 }
3145
3146 /* find first sibling */
3147 if (siblings->parent) {
3148 siblings = siblings->parent->child;
3149 } else {
3150 while (siblings->prev->next) {
3151 siblings = siblings->prev;
3152 }
3153 }
3154
3155 parent = (struct lyd_node_inner *)siblings->parent;
3156 if (parent && parent->children_ht) {
3157 assert(target->hash);
3158
3159 /* find by hash */
3160 if (!lyht_find(parent->children_ht, &target, target->hash, (void **)&match_p)) {
Michal Vaskoda859032020-07-14 12:20:14 +02003161 /* check even value when needed */
Michal Vasko8f359bf2020-07-28 10:41:15 +02003162 if (!(target->schema->nodetype & (LYS_LIST | LYS_LEAFLIST)) || !lyd_compare_single(target, *match_p, 0)) {
Michal Vaskoda859032020-07-14 12:20:14 +02003163 siblings = *match_p;
3164 } else {
3165 siblings = NULL;
3166 }
Michal Vaskoe444f752020-02-10 12:20:06 +01003167 } else {
3168 /* not found */
3169 siblings = NULL;
3170 }
3171 } else {
3172 /* no children hash table */
Michal Vaskod989ba02020-08-24 10:59:24 +02003173 for ( ; siblings; siblings = siblings->next) {
Michal Vasko8f359bf2020-07-28 10:41:15 +02003174 if (!lyd_compare_single(siblings, target, 0)) {
Michal Vaskoe444f752020-02-10 12:20:06 +01003175 break;
3176 }
3177 }
3178 }
3179
3180 if (!siblings) {
Michal Vasko9b368d32020-02-14 13:53:31 +01003181 if (match) {
3182 *match = NULL;
3183 }
Michal Vaskoe444f752020-02-10 12:20:06 +01003184 return LY_ENOTFOUND;
3185 }
3186
Michal Vasko9b368d32020-02-14 13:53:31 +01003187 if (match) {
3188 *match = (struct lyd_node *)siblings;
3189 }
Michal Vaskoe444f752020-02-10 12:20:06 +01003190 return LY_SUCCESS;
3191}
3192
Radek Krejci857189e2020-09-01 13:26:36 +02003193/**
3194 * @brief Comparison callback to match schema node with a schema of a data node.
3195 *
3196 * @param[in] val1_p Pointer to the schema node
3197 * @param[in] val2_p Pointer to the data node
3198 * Implementation of ::values_equal_cb.
3199 */
3200static ly_bool
3201lyd_hash_table_schema_val_equal(void *val1_p, void *val2_p, ly_bool UNUSED(mod), void *UNUSED(cb_data))
Michal Vasko90932a92020-02-12 14:33:03 +01003202{
3203 struct lysc_node *val1;
3204 struct lyd_node *val2;
3205
3206 val1 = *((struct lysc_node **)val1_p);
3207 val2 = *((struct lyd_node **)val2_p);
3208
Michal Vasko90932a92020-02-12 14:33:03 +01003209 if (val1 == val2->schema) {
3210 /* schema match is enough */
3211 return 1;
3212 } else {
3213 return 0;
3214 }
3215}
3216
3217static LY_ERR
3218lyd_find_sibling_schema(const struct lyd_node *siblings, const struct lysc_node *schema, struct lyd_node **match)
3219{
3220 struct lyd_node **match_p;
3221 struct lyd_node_inner *parent;
3222 uint32_t hash;
3223 values_equal_cb ht_cb;
3224
Michal Vaskob104f112020-07-17 09:54:54 +02003225 assert(siblings && schema);
Michal Vasko90932a92020-02-12 14:33:03 +01003226
3227 parent = (struct lyd_node_inner *)siblings->parent;
3228 if (parent && parent->children_ht) {
3229 /* calculate our hash */
3230 hash = dict_hash_multi(0, schema->module->name, strlen(schema->module->name));
3231 hash = dict_hash_multi(hash, schema->name, strlen(schema->name));
3232 hash = dict_hash_multi(hash, NULL, 0);
3233
3234 /* use special hash table function */
3235 ht_cb = lyht_set_cb(parent->children_ht, lyd_hash_table_schema_val_equal);
3236
3237 /* find by hash */
3238 if (!lyht_find(parent->children_ht, &schema, hash, (void **)&match_p)) {
3239 siblings = *match_p;
3240 } else {
3241 /* not found */
3242 siblings = NULL;
3243 }
3244
3245 /* set the original hash table compare function back */
3246 lyht_set_cb(parent->children_ht, ht_cb);
3247 } else {
Michal Vaskob104f112020-07-17 09:54:54 +02003248 /* find first sibling */
3249 if (siblings->parent) {
3250 siblings = siblings->parent->child;
3251 } else {
3252 while (siblings->prev->next) {
3253 siblings = siblings->prev;
3254 }
3255 }
3256
3257 /* search manually without hashes */
Michal Vaskod989ba02020-08-24 10:59:24 +02003258 for ( ; siblings; siblings = siblings->next) {
Michal Vasko90932a92020-02-12 14:33:03 +01003259 if (siblings->schema == schema) {
3260 /* schema match is enough */
3261 break;
3262 }
3263 }
3264 }
3265
3266 if (!siblings) {
Michal Vasko9b368d32020-02-14 13:53:31 +01003267 if (match) {
3268 *match = NULL;
3269 }
Michal Vasko90932a92020-02-12 14:33:03 +01003270 return LY_ENOTFOUND;
3271 }
3272
Michal Vasko9b368d32020-02-14 13:53:31 +01003273 if (match) {
3274 *match = (struct lyd_node *)siblings;
3275 }
Michal Vasko90932a92020-02-12 14:33:03 +01003276 return LY_SUCCESS;
3277}
3278
Michal Vaskoe444f752020-02-10 12:20:06 +01003279API LY_ERR
3280lyd_find_sibling_val(const struct lyd_node *siblings, const struct lysc_node *schema, const char *key_or_value,
Radek Krejci0f969882020-08-21 16:56:47 +02003281 size_t val_len, struct lyd_node **match)
Michal Vaskoe444f752020-02-10 12:20:06 +01003282{
3283 LY_ERR rc;
3284 struct lyd_node *target = NULL;
3285
Michal Vasko4c583e82020-07-17 12:16:14 +02003286 LY_CHECK_ARG_RET(NULL, schema, !(schema->nodetype & (LYS_CHOICE | LYS_CASE)), LY_EINVAL);
Michal Vaskoe444f752020-02-10 12:20:06 +01003287
Michal Vasko62ed12d2020-05-21 10:08:25 +02003288 if (!siblings || (lysc_data_parent(siblings->schema) != lysc_data_parent(schema))) {
3289 /* no data or schema mismatch */
Michal Vasko9b368d32020-02-14 13:53:31 +01003290 if (match) {
3291 *match = NULL;
3292 }
Michal Vaskoe444f752020-02-10 12:20:06 +01003293 return LY_ENOTFOUND;
3294 }
3295
Michal Vaskof03ed032020-03-04 13:31:44 +01003296 if (key_or_value && !val_len) {
3297 val_len = strlen(key_or_value);
3298 }
3299
Michal Vaskob104f112020-07-17 09:54:54 +02003300 if ((schema->nodetype & (LYS_LIST | LYS_LEAFLIST)) && key_or_value) {
3301 /* create a data node and find the instance */
3302 if (schema->nodetype == LYS_LEAFLIST) {
3303 /* target used attributes: schema, hash, value */
Michal Vaskofeca4fb2020-10-05 08:58:40 +02003304 rc = lyd_create_term(schema, key_or_value, val_len, NULL, LY_PREF_JSON, NULL, LYD_HINT_DATA, NULL, &target);
3305 LY_CHECK_RET(rc);
Michal Vaskob104f112020-07-17 09:54:54 +02003306 } else {
Michal Vasko90932a92020-02-12 14:33:03 +01003307 /* target used attributes: schema, hash, child (all keys) */
Michal Vasko004d3152020-06-11 19:59:22 +02003308 LY_CHECK_RET(lyd_create_list2(schema, key_or_value, val_len, &target));
Michal Vasko90932a92020-02-12 14:33:03 +01003309 }
3310
3311 /* find it */
3312 rc = lyd_find_sibling_first(siblings, target, match);
Michal Vaskob104f112020-07-17 09:54:54 +02003313 } else {
3314 /* find the first schema node instance */
3315 rc = lyd_find_sibling_schema(siblings, schema, match);
Michal Vaskoe444f752020-02-10 12:20:06 +01003316 }
3317
Michal Vaskoe444f752020-02-10 12:20:06 +01003318 lyd_free_tree(target);
3319 return rc;
3320}
Michal Vaskoccc02342020-05-21 10:09:21 +02003321
3322API LY_ERR
3323lyd_find_xpath(const struct lyd_node *ctx_node, const char *xpath, struct ly_set **set)
3324{
3325 LY_ERR ret = LY_SUCCESS;
3326 struct lyxp_set xp_set;
Radek Krejcif03a9e22020-09-18 20:09:31 +02003327 struct lyxp_expr *exp = NULL;
Michal Vaskoccc02342020-05-21 10:09:21 +02003328 uint32_t i;
3329
3330 LY_CHECK_ARG_RET(NULL, ctx_node, xpath, set, LY_EINVAL);
3331
3332 memset(&xp_set, 0, sizeof xp_set);
3333
3334 /* compile expression */
Radek Krejcif03a9e22020-09-18 20:09:31 +02003335 ret = lyxp_expr_parse((struct ly_ctx *)LYD_CTX(ctx_node), xpath, 0, 1, &exp);
3336 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskoccc02342020-05-21 10:09:21 +02003337
3338 /* evaluate expression */
Michal Vaskocdad7122020-11-09 21:04:44 +01003339 ret = lyxp_eval(exp, NULL, LY_PREF_JSON, NULL, ctx_node, ctx_node, &xp_set, LYXP_IGNORE_WHEN);
Michal Vaskoccc02342020-05-21 10:09:21 +02003340 LY_CHECK_GOTO(ret, cleanup);
3341
3342 /* allocate return set */
Radek Krejciba03a5a2020-08-27 14:40:41 +02003343 ret = ly_set_new(set);
3344 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskoccc02342020-05-21 10:09:21 +02003345
3346 /* transform into ly_set */
3347 if (xp_set.type == LYXP_SET_NODE_SET) {
3348 /* allocate memory for all the elements once (even though not all items must be elements but most likely will be) */
3349 (*set)->objs = malloc(xp_set.used * sizeof *(*set)->objs);
Michal Vaskob7be7a82020-08-20 09:09:04 +02003350 LY_CHECK_ERR_GOTO(!(*set)->objs, LOGMEM(LYD_CTX(ctx_node)); ret = LY_EMEM, cleanup);
Michal Vaskoccc02342020-05-21 10:09:21 +02003351 (*set)->size = xp_set.used;
3352
3353 for (i = 0; i < xp_set.used; ++i) {
3354 if (xp_set.val.nodes[i].type == LYXP_NODE_ELEM) {
Radek Krejci3d92e442020-10-12 12:48:13 +02003355 ret = ly_set_add(*set, xp_set.val.nodes[i].node, 1, NULL);
Radek Krejciba03a5a2020-08-27 14:40:41 +02003356 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskoccc02342020-05-21 10:09:21 +02003357 }
3358 }
3359 }
3360
3361cleanup:
Michal Vasko0691d522020-05-21 13:21:47 +02003362 lyxp_set_free_content(&xp_set);
Michal Vaskob7be7a82020-08-20 09:09:04 +02003363 lyxp_expr_free((struct ly_ctx *)LYD_CTX(ctx_node), exp);
Michal Vaskoccc02342020-05-21 10:09:21 +02003364 return ret;
3365}
Radek Krejcica989142020-11-05 11:32:22 +01003366
3367API uint32_t
3368lyd_list_pos(const struct lyd_node *instance)
3369{
3370 const struct lyd_node *iter = NULL;
3371 uint32_t pos = 0;
3372
3373 if (!instance || !(instance->schema->nodetype & (LYS_LIST | LYS_LEAFLIST))) {
3374 return 0;
3375 }
3376
3377 /* data instances are ordered, so we can stop when we found instance of other schema node */
3378 for (iter = instance; iter->schema == instance->schema; iter = iter->prev) {
3379 if (pos && iter->next == NULL) {
3380 /* overrun to the end of the siblings list */
3381 break;
3382 }
3383 ++pos;
3384 }
3385
3386 return pos;
3387}
Radek Krejci4233f9b2020-11-05 12:38:35 +01003388
3389API struct lyd_node *
3390lyd_first_sibling(const struct lyd_node *node)
3391{
3392 struct lyd_node *start;
3393
3394 if (!node) {
3395 return NULL;
3396 }
3397
3398 /* get the first sibling */
3399 if (node->parent) {
3400 start = node->parent->child;
3401 } else {
3402 for (start = (struct lyd_node *)node; start->prev->next; start = start->prev);
3403 }
3404
3405 return start;
3406}