blob: a2f0506195ff7e3e70629f4162be547a527c05a5 [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,
Radek Krejci2efc45b2020-12-22 16:25:44 +010059 const struct lysc_node *ctx_node, ly_bool *incomplete)
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 Vasko405cc9e2020-12-01 12:01:27 +010069 ret = type->plugin->store(ctx, type, value, value_len, options, format, prefix_data, hints, ctx_node, val, NULL, &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) {
Radek Krejci2efc45b2020-12-22 16:25:44 +010076 LOGVAL(ctx, err->vecode, err->msg);
Michal Vaskofeca4fb2020-10-05 08:58:40 +020077 ly_err_free(err);
78 } else {
Radek Krejci2efc45b2020-12-22 16:25:44 +010079 LOGVAL(ctx, LYVE_OTHER, "Storing value \"%.*s\" failed.", (int)value_len, value);
Michal Vaskofeca4fb2020-10-05 08:58:40 +020080 }
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,
Radek Krejci2efc45b2020-12-22 16:25:44 +010092 const struct lyd_node *ctx_node, const struct lyd_node *tree)
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) {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100102 LOGVAL(ctx, 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 {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100105 LOGVAL(ctx, 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,
Michal Vasko405cc9e2020-12-01 12:01:27 +0100131 LYD_HINT_SCHEMA, node, &storage, NULL, &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 Krejciddace2c2021-01-08 11:30:56 +0100139 LOG_LOCSET(NULL, NULL, err->path, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100140 LOGVAL(ctx, err->vecode, err->msg);
Radek Krejciddace2c2021-01-08 11:30:56 +0100141 LOG_LOCBACK(0, 0, 1, 0);
Radek Krejci084289f2019-07-09 17:35:30 +0200142 }
Radek Krejci73dead22019-07-11 16:46:16 +0200143 ly_err_free(err);
Radek Krejci084289f2019-07-09 17:35:30 +0200144 }
145
Michal Vaskoba99a3e2020-08-18 15:50:05 +0200146 if (!rc) {
147 type->plugin->free(ctx ? ctx : node->module->ctx, &storage);
148 }
Radek Krejci084289f2019-07-09 17:35:30 +0200149 return rc;
150}
151
152API LY_ERR
Michal Vaskof937cfe2020-08-03 16:07:12 +0200153lys_value_validate(const struct ly_ctx *ctx, const struct lysc_node *node, const char *value, size_t value_len)
154{
Michal Vaskoc8a230d2020-08-14 12:17:10 +0200155 return _lys_value_validate(ctx, node, value, value_len, LY_PREF_JSON, NULL);
Michal Vaskof937cfe2020-08-03 16:07:12 +0200156}
157
158API LY_ERR
Michal Vasko44685da2020-03-17 15:38:06 +0100159lyd_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 +0200160 const struct lyd_node *tree, const struct lysc_type **realtype)
Radek Krejci084289f2019-07-09 17:35:30 +0200161{
162 LY_ERR rc;
163 struct ly_err_item *err = NULL;
164 struct lysc_type *type;
Michal Vasko3701af52020-08-03 14:29:38 +0200165 struct lyd_value val = {0};
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200166 ly_bool stored = 0;
Radek Krejci084289f2019-07-09 17:35:30 +0200167
168 LY_CHECK_ARG_RET(ctx, node, value, LY_EINVAL);
169
Michal Vasko22df3f02020-08-24 13:29:22 +0200170 type = ((struct lysc_node_leaf *)node->schema)->type;
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200171 /* store */
172 rc = type->plugin->store(ctx ? ctx : LYD_CTX(node), type, value, value_len, 0, LY_PREF_JSON, NULL,
Michal Vasko405cc9e2020-12-01 12:01:27 +0100173 LYD_HINT_DATA, node->schema, &val, NULL, &err);
Radek Krejci73dead22019-07-11 16:46:16 +0200174 if (rc == LY_EINCOMPLETE) {
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200175 stored = 1;
176
177 /* resolve */
Michal Vasko9e685082021-01-29 14:49:09 +0100178 rc = type->plugin->validate(ctx ? ctx : LYD_CTX(node), type, &node->node, tree, &val, &err);
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200179 }
180
181 if (rc) {
Radek Krejci73dead22019-07-11 16:46:16 +0200182 if (err) {
183 if (ctx) {
Michal Vasko9e685082021-01-29 14:49:09 +0100184 LOG_LOCSET(NULL, &node->node, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100185 LOGVAL(ctx, err->vecode, err->msg);
Radek Krejciddace2c2021-01-08 11:30:56 +0100186 LOG_LOCBACK(0, 1, 0, 0);
Radek Krejci084289f2019-07-09 17:35:30 +0200187 }
Radek Krejci73dead22019-07-11 16:46:16 +0200188 ly_err_free(err);
Radek Krejci084289f2019-07-09 17:35:30 +0200189 }
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200190 if (stored) {
191 type->plugin->free(ctx ? ctx : LYD_CTX(node), &val);
192 }
Radek Krejci73dead22019-07-11 16:46:16 +0200193 return rc;
Radek Krejci084289f2019-07-09 17:35:30 +0200194 }
195
Michal Vasko3701af52020-08-03 14:29:38 +0200196 if (realtype) {
Michal Vasko29134f82020-11-13 18:03:20 +0100197 if (val.realtype->basetype == LY_TYPE_UNION) {
198 *realtype = val.subvalue->value.realtype;
199 } else {
200 *realtype = val.realtype;
201 }
Michal Vasko3701af52020-08-03 14:29:38 +0200202 }
203
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200204 type->plugin->free(ctx ? ctx : LYD_CTX(node), &val);
Radek Krejci084289f2019-07-09 17:35:30 +0200205 return LY_SUCCESS;
206}
207
208API LY_ERR
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200209lyd_value_compare(const struct lyd_node_term *node, const char *value, size_t value_len)
Radek Krejci084289f2019-07-09 17:35:30 +0200210{
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200211 LY_ERR ret = LY_SUCCESS;
Radek Krejci084289f2019-07-09 17:35:30 +0200212 struct ly_ctx *ctx;
213 struct lysc_type *type;
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200214 struct lyd_value val = {0};
Radek Krejci084289f2019-07-09 17:35:30 +0200215
216 LY_CHECK_ARG_RET(node ? node->schema->module->ctx : NULL, node, value, LY_EINVAL);
217
218 ctx = node->schema->module->ctx;
Michal Vasko22df3f02020-08-24 13:29:22 +0200219 type = ((struct lysc_node_leaf *)node->schema)->type;
Radek Krejci084289f2019-07-09 17:35:30 +0200220
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200221 /* store the value */
Michal Vasko9e685082021-01-29 14:49:09 +0100222 LOG_LOCSET(node->schema, &node->node, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100223 ret = lyd_value_store(ctx, &val, type, value, value_len, NULL, LY_PREF_JSON, NULL, LYD_HINT_DATA, node->schema, NULL);
Radek Krejciddace2c2021-01-08 11:30:56 +0100224 LOG_LOCBACK(1, 1, 0, 0);
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200225 LY_CHECK_RET(ret);
Radek Krejci084289f2019-07-09 17:35:30 +0200226
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200227 /* compare values */
228 ret = type->plugin->compare(&node->value, &val);
Radek Krejci084289f2019-07-09 17:35:30 +0200229
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200230 type->plugin->free(ctx, &val);
Radek Krejci084289f2019-07-09 17:35:30 +0200231 return ret;
232}
233
Radek Krejci19611252020-10-04 13:54:53 +0200234API ly_bool
235lyd_is_default(const struct lyd_node *node)
236{
237 const struct lysc_node_leaf *leaf;
238 const struct lysc_node_leaflist *llist;
239 const struct lyd_node_term *term;
240 LY_ARRAY_COUNT_TYPE u;
241
242 assert(node->schema->nodetype & LYD_NODE_TERM);
243 term = (const struct lyd_node_term *)node;
244
245 if (node->schema->nodetype == LYS_LEAF) {
246 leaf = (const struct lysc_node_leaf *)node->schema;
247 if (!leaf->dflt) {
248 return 0;
249 }
250
251 /* compare with the default value */
252 if (leaf->type->plugin->compare(&term->value, leaf->dflt)) {
253 return 0;
254 }
255 } else {
256 llist = (const struct lysc_node_leaflist *)node->schema;
257 if (!llist->dflts) {
258 return 0;
259 }
260
261 LY_ARRAY_FOR(llist->dflts, u) {
262 /* compare with each possible default value */
263 if (llist->type->plugin->compare(&term->value, llist->dflts[u])) {
264 return 0;
265 }
266 }
267 }
268
269 return 1;
270}
271
Radek Krejci7931b192020-06-25 17:05:03 +0200272static LYD_FORMAT
Michal Vasko63f3d842020-07-08 10:10:14 +0200273lyd_parse_get_format(const struct ly_in *in, LYD_FORMAT format)
Radek Krejcie7b95092019-05-15 11:03:07 +0200274{
Michal Vasko69730152020-10-09 16:30:07 +0200275 if (!format && (in->type == LY_IN_FILEPATH)) {
Radek Krejcie7b95092019-05-15 11:03:07 +0200276 /* unknown format - try to detect it from filename's suffix */
Radek Krejci7931b192020-06-25 17:05:03 +0200277 const char *path = in->method.fpath.filepath;
278 size_t len = strlen(path);
Radek Krejcie7b95092019-05-15 11:03:07 +0200279
280 /* ignore trailing whitespaces */
Michal Vaskod989ba02020-08-24 10:59:24 +0200281 for ( ; len > 0 && isspace(path[len - 1]); len--) {}
Radek Krejcie7b95092019-05-15 11:03:07 +0200282
Radek Krejcif13b87b2020-12-01 22:02:17 +0100283 if ((len >= LY_XML_SUFFIX_LEN + 1) &&
284 !strncmp(&path[len - LY_XML_SUFFIX_LEN], LY_XML_SUFFIX, LY_XML_SUFFIX_LEN)) {
Radek Krejcie7b95092019-05-15 11:03:07 +0200285 format = LYD_XML;
Radek Krejcif13b87b2020-12-01 22:02:17 +0100286 } else if ((len >= LY_JSON_SUFFIX_LEN + 1) &&
287 !strncmp(&path[len - LY_JSON_SUFFIX_LEN], LY_JSON_SUFFIX, LY_JSON_SUFFIX_LEN)) {
Radek Krejcie7b95092019-05-15 11:03:07 +0200288 format = LYD_JSON;
Radek Krejcif13b87b2020-12-01 22:02:17 +0100289 } else if ((len >= LY_LYB_SUFFIX_LEN + 1) &&
290 !strncmp(&path[len - LY_LYB_SUFFIX_LEN], LY_LYB_SUFFIX, LY_LYB_SUFFIX_LEN)) {
Radek Krejcie7b95092019-05-15 11:03:07 +0200291 format = LYD_LYB;
Radek Krejci7931b192020-06-25 17:05:03 +0200292 } /* else still unknown */
Radek Krejcie7b95092019-05-15 11:03:07 +0200293 }
294
Radek Krejci7931b192020-06-25 17:05:03 +0200295 return format;
296}
Radek Krejcie7b95092019-05-15 11:03:07 +0200297
Michal Vaskoe0665742021-02-11 11:08:44 +0100298/**
299 * @brief Parse YANG data into a data tree.
300 *
301 * @param[in] ctx libyang context.
302 * @param[in] parent Parent to connect the parsed nodes to, if any.
303 * @param[in,out] first_p Pointer to the first top-level parsed node, used only if @p parent is NULL.
304 * @param[in] in Input handle to read the input from.
305 * @param[in] format Expected format of the data in @p in.
306 * @param[in] parse_opts Options for parser.
307 * @param[in] val_opts Options for validation.
308 * @param[out] op Optional pointer to the parsed operation, if any.
309 * @return LY_ERR value.
310 */
311static LY_ERR
312lyd_parse(const struct ly_ctx *ctx, struct lyd_node *parent, struct lyd_node **first_p, struct ly_in *in,
313 LYD_FORMAT format, uint32_t parse_opts, uint32_t val_opts, struct lyd_node **op)
Radek Krejci7931b192020-06-25 17:05:03 +0200314{
Michal Vaskoe0665742021-02-11 11:08:44 +0100315 LY_ERR rc = LY_SUCCESS;
Radek Krejci1798aae2020-07-14 13:26:06 +0200316 struct lyd_ctx *lydctx = NULL;
Michal Vaskoe0665742021-02-11 11:08:44 +0100317 struct ly_set parsed = {0};
318 struct lyd_node *first;
319 uint32_t i;
Radek Krejci1798aae2020-07-14 13:26:06 +0200320
Michal Vaskoe0665742021-02-11 11:08:44 +0100321 assert(ctx && (parent || first_p));
Radek Krejci7931b192020-06-25 17:05:03 +0200322
323 format = lyd_parse_get_format(in, format);
Michal Vaskoe0665742021-02-11 11:08:44 +0100324 if (first_p) {
325 *first_p = NULL;
326 }
Radek Krejci1798aae2020-07-14 13:26:06 +0200327
Michal Vasko63f3d842020-07-08 10:10:14 +0200328 /* remember input position */
329 in->func_start = in->current;
Radek Krejci7931b192020-06-25 17:05:03 +0200330
Michal Vaskoe0665742021-02-11 11:08:44 +0100331 /* parse the data */
Radek Krejci7931b192020-06-25 17:05:03 +0200332 switch (format) {
333 case LYD_XML:
Michal Vaskoe0665742021-02-11 11:08:44 +0100334 rc = lyd_parse_xml(ctx, parent, first_p, in, parse_opts, val_opts, LYD_TYPE_YANG_DATA, NULL, &parsed, &lydctx);
Radek Krejci1798aae2020-07-14 13:26:06 +0200335 break;
Radek Krejci7931b192020-06-25 17:05:03 +0200336 case LYD_JSON:
Michal Vaskoe0665742021-02-11 11:08:44 +0100337 rc = lyd_parse_json(ctx, parent, first_p, in, parse_opts, val_opts, LYD_TYPE_YANG_DATA, &parsed, &lydctx);
Radek Krejci1798aae2020-07-14 13:26:06 +0200338 break;
Radek Krejci7931b192020-06-25 17:05:03 +0200339 case LYD_LYB:
Michal Vaskoe0665742021-02-11 11:08:44 +0100340 rc = lyd_parse_lyb(ctx, parent, first_p, in, parse_opts, val_opts, LYD_TYPE_YANG_DATA, &parsed, &lydctx);
Radek Krejci1798aae2020-07-14 13:26:06 +0200341 break;
Michal Vaskoc8a230d2020-08-14 12:17:10 +0200342 case LYD_UNKNOWN:
Michal Vaskod74978f2021-02-12 11:59:36 +0100343 LOGARG(ctx, format);
344 rc = LY_EINVAL;
Michal Vaskoe0665742021-02-11 11:08:44 +0100345 break;
346 }
347 LY_CHECK_GOTO(rc, cleanup);
348
349 if (parent) {
350 /* get first top-level sibling */
351 for (first = parent; first->parent; first = lyd_parent(first)) {}
352 first = lyd_first_sibling(first);
353 first_p = &first;
Radek Krejci7931b192020-06-25 17:05:03 +0200354 }
355
Michal Vaskoe0665742021-02-11 11:08:44 +0100356 if (!(parse_opts & LYD_PARSE_ONLY)) {
357 /* validate data */
358 rc = lyd_validate(first_p, NULL, ctx, val_opts, 0, &lydctx->node_when, &lydctx->node_types,
359 &lydctx->meta_types, NULL);
360 LY_CHECK_GOTO(rc, cleanup);
361 }
Radek Krejci7931b192020-06-25 17:05:03 +0200362
Michal Vaskoe0665742021-02-11 11:08:44 +0100363 /* set the operation node */
364 if (op) {
365 *op = lydctx->op_node;
Radek Krejci1798aae2020-07-14 13:26:06 +0200366 }
367
368cleanup:
Michal Vaskoe0665742021-02-11 11:08:44 +0100369 if (lydctx) {
370 lydctx->free(lydctx);
Radek Krejci1798aae2020-07-14 13:26:06 +0200371 }
Michal Vaskoe0665742021-02-11 11:08:44 +0100372 if (rc) {
373 if (parent) {
374 /* free all the parsed subtrees */
375 for (i = 0; i < parsed.count; ++i) {
376 lyd_free_tree(parsed.dnodes[i]);
377 }
378 } else {
379 /* free everything */
380 lyd_free_all(*first_p);
381 *first_p = NULL;
382 }
383 }
384 ly_set_erase(&parsed, NULL);
385 return rc;
Radek Krejci7931b192020-06-25 17:05:03 +0200386}
387
388API LY_ERR
Michal Vaskoe0665742021-02-11 11:08:44 +0100389lyd_parse_data(const struct ly_ctx *ctx, struct lyd_node *parent, struct ly_in *in, LYD_FORMAT format,
390 uint32_t parse_options, uint32_t validate_options, struct lyd_node **tree)
391{
392 LY_CHECK_ARG_RET(ctx, ctx, in, parent || tree, LY_EINVAL);
393 LY_CHECK_ARG_RET(ctx, !(parse_options & ~LYD_PARSE_OPTS_MASK), LY_EINVAL);
394 LY_CHECK_ARG_RET(ctx, !(validate_options & ~LYD_VALIDATE_OPTS_MASK), LY_EINVAL);
395
396 return lyd_parse(ctx, parent, tree, in, format, parse_options, validate_options, NULL);
397}
398
399API LY_ERR
400lyd_parse_data_mem(const struct ly_ctx *ctx, const char *data, LYD_FORMAT format, uint32_t parse_options,
401 uint32_t validate_options, struct lyd_node **tree)
Radek Krejci7931b192020-06-25 17:05:03 +0200402{
403 LY_ERR ret;
404 struct ly_in *in;
405
406 LY_CHECK_RET(ly_in_new_memory(data, &in));
Michal Vaskoe0665742021-02-11 11:08:44 +0100407 ret = lyd_parse_data(ctx, NULL, in, format, parse_options, validate_options, tree);
Radek Krejci7931b192020-06-25 17:05:03 +0200408
409 ly_in_free(in, 0);
410 return ret;
411}
412
413API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +0200414lyd_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 +0200415 struct lyd_node **tree)
Radek Krejci7931b192020-06-25 17:05:03 +0200416{
417 LY_ERR ret;
418 struct ly_in *in;
419
420 LY_CHECK_RET(ly_in_new_fd(fd, &in));
Michal Vaskoe0665742021-02-11 11:08:44 +0100421 ret = lyd_parse_data(ctx, NULL, in, format, parse_options, validate_options, tree);
Radek Krejci7931b192020-06-25 17:05:03 +0200422
423 ly_in_free(in, 0);
424 return ret;
425}
426
427API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +0200428lyd_parse_data_path(const struct ly_ctx *ctx, const char *path, LYD_FORMAT format, uint32_t parse_options,
429 uint32_t validate_options, struct lyd_node **tree)
Radek Krejci7931b192020-06-25 17:05:03 +0200430{
431 LY_ERR ret;
432 struct ly_in *in;
433
434 LY_CHECK_RET(ly_in_new_filepath(path, 0, &in));
Michal Vaskoe0665742021-02-11 11:08:44 +0100435 ret = lyd_parse_data(ctx, NULL, in, format, parse_options, validate_options, tree);
Radek Krejci7931b192020-06-25 17:05:03 +0200436
437 ly_in_free(in, 0);
438 return ret;
439}
440
Radek Krejci7931b192020-06-25 17:05:03 +0200441API LY_ERR
Michal Vaskoe0665742021-02-11 11:08:44 +0100442lyd_parse_op(const struct ly_ctx *ctx, struct lyd_node *parent, struct ly_in *in, LYD_FORMAT format,
443 enum lyd_type data_type, struct lyd_node **tree, struct lyd_node **op)
Radek Krejci7931b192020-06-25 17:05:03 +0200444{
Michal Vaskoe0665742021-02-11 11:08:44 +0100445 LY_ERR rc = LY_SUCCESS;
446 struct lyd_ctx *lydctx = NULL;
447 struct ly_set parsed = {0};
448 struct lyd_node *first = NULL, *envp = NULL;
449 uint32_t i, parse_opts, val_opts;
Radek Krejci7931b192020-06-25 17:05:03 +0200450
Michal Vaskoe0665742021-02-11 11:08:44 +0100451 LY_CHECK_ARG_RET(ctx, ctx || parent, in, data_type, parent || tree || op, LY_EINVAL);
Radek Krejci1798aae2020-07-14 13:26:06 +0200452 if (tree) {
453 *tree = NULL;
454 }
455 if (op) {
456 *op = NULL;
457 }
458
Radek Krejci7931b192020-06-25 17:05:03 +0200459 format = lyd_parse_get_format(in, format);
Radek Krejci7931b192020-06-25 17:05:03 +0200460
Michal Vasko63f3d842020-07-08 10:10:14 +0200461 /* remember input position */
462 in->func_start = in->current;
463
Michal Vaskoe0665742021-02-11 11:08:44 +0100464 /* check params based on the data type */
465 if (data_type == LYD_TYPE_NETCONF_RPC) {
466 LY_CHECK_ARG_RET(ctx, format == LYD_XML, !parent, tree, op, LY_EINVAL);
467 } else if (data_type == LYD_TYPE_NETCONF_REPLY_OR_NOTIF) {
468 LY_CHECK_ARG_RET(ctx, format == LYD_XML, parent, parent->schema->nodetype & (LYS_RPC | LYS_ACTION), tree, op, LY_EINVAL);
469 }
470 parse_opts = LYD_PARSE_ONLY | LYD_PARSE_STRICT;
471 val_opts = 0;
472
473 /* parse the data */
Radek Krejci7931b192020-06-25 17:05:03 +0200474 switch (format) {
475 case LYD_XML:
Michal Vaskoe0665742021-02-11 11:08:44 +0100476 rc = lyd_parse_xml(ctx, parent, &first, in, parse_opts, val_opts, data_type, &envp, &parsed, &lydctx);
Michal Vasko299d5d12021-02-16 16:36:37 +0100477 if (rc && envp) {
478 /* special situation when the envelopes were parsed successfully */
479 if (tree) {
480 *tree = envp;
481 }
482 ly_set_erase(&parsed, NULL);
483 return rc;
484 }
Michal Vaskoe0665742021-02-11 11:08:44 +0100485 break;
Radek Krejci7931b192020-06-25 17:05:03 +0200486 case LYD_JSON:
Michal Vaskoe0665742021-02-11 11:08:44 +0100487 rc = lyd_parse_json(ctx, parent, &first, in, parse_opts, val_opts, data_type, &parsed, &lydctx);
488 break;
Radek Krejci7931b192020-06-25 17:05:03 +0200489 case LYD_LYB:
Michal Vaskoe0665742021-02-11 11:08:44 +0100490 rc = lyd_parse_lyb(ctx, parent, &first, in, parse_opts, val_opts, data_type, &parsed, &lydctx);
491 break;
Michal Vaskoc8a230d2020-08-14 12:17:10 +0200492 case LYD_UNKNOWN:
Michal Vaskod74978f2021-02-12 11:59:36 +0100493 LOGARG(ctx, format);
494 rc = LY_EINVAL;
Michal Vaskoc8a230d2020-08-14 12:17:10 +0200495 break;
Radek Krejci7931b192020-06-25 17:05:03 +0200496 }
Michal Vaskoe0665742021-02-11 11:08:44 +0100497 LY_CHECK_GOTO(rc, cleanup);
Radek Krejci7931b192020-06-25 17:05:03 +0200498
Michal Vaskoe0665742021-02-11 11:08:44 +0100499 /* set out params correctly */
500 if (tree) {
501 if (envp) {
502 /* special out param meaning */
503 *tree = envp;
504 } else {
505 *tree = parent ? NULL : first;
506 }
507 }
508 if (op) {
509 *op = lydctx->op_node;
510 }
511
512cleanup:
513 if (lydctx) {
514 lydctx->free(lydctx);
515 }
516 if (rc) {
517 if (parent) {
518 /* free all the parsed subtrees */
519 for (i = 0; i < parsed.count; ++i) {
520 lyd_free_tree(parsed.dnodes[i]);
521 }
522 } else {
523 /* free everything (cannot occur in the current code, a safety) */
524 lyd_free_all(first);
525 if (tree) {
526 *tree = NULL;
527 }
528 if (op) {
529 *op = NULL;
530 }
531 }
532 }
533 ly_set_erase(&parsed, NULL);
534 return rc;
Radek Krejcie7b95092019-05-15 11:03:07 +0200535}
Radek Krejci084289f2019-07-09 17:35:30 +0200536
Michal Vasko90932a92020-02-12 14:33:03 +0100537LY_ERR
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200538lyd_create_term(const struct lysc_node *schema, const char *value, size_t value_len, ly_bool *dynamic,
539 LY_PREFIX_FORMAT format, void *prefix_data, uint32_t hints, ly_bool *incomplete, struct lyd_node **node)
Michal Vasko90932a92020-02-12 14:33:03 +0100540{
541 LY_ERR ret;
542 struct lyd_node_term *term;
543
Michal Vasko9b368d32020-02-14 13:53:31 +0100544 assert(schema->nodetype & LYD_NODE_TERM);
545
Michal Vasko90932a92020-02-12 14:33:03 +0100546 term = calloc(1, sizeof *term);
547 LY_CHECK_ERR_RET(!term, LOGMEM(schema->module->ctx), LY_EMEM);
548
549 term->schema = schema;
Michal Vasko9e685082021-01-29 14:49:09 +0100550 term->prev = &term->node;
Michal Vasko9b368d32020-02-14 13:53:31 +0100551 term->flags = LYD_NEW;
Michal Vasko90932a92020-02-12 14:33:03 +0100552
Radek Krejciddace2c2021-01-08 11:30:56 +0100553 LOG_LOCSET(schema, NULL, NULL, NULL);
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200554 ret = lyd_value_store(schema->module->ctx, &term->value, ((struct lysc_node_leaf *)term->schema)->type, value,
Radek Krejci2efc45b2020-12-22 16:25:44 +0100555 value_len, dynamic, format, prefix_data, hints, schema, incomplete);
Radek Krejciddace2c2021-01-08 11:30:56 +0100556 LOG_LOCBACK(1, 0, 0, 0);
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200557 LY_CHECK_ERR_RET(ret, free(term), ret);
Michal Vasko9e685082021-01-29 14:49:09 +0100558 lyd_hash(&term->node);
Michal Vasko9b368d32020-02-14 13:53:31 +0100559
Michal Vasko9e685082021-01-29 14:49:09 +0100560 *node = &term->node;
Michal Vasko9b368d32020-02-14 13:53:31 +0100561 return ret;
562}
563
564LY_ERR
565lyd_create_term2(const struct lysc_node *schema, const struct lyd_value *val, struct lyd_node **node)
566{
567 LY_ERR ret;
568 struct lyd_node_term *term;
569 struct lysc_type *type;
570
571 assert(schema->nodetype & LYD_NODE_TERM);
Michal Vaskoba99a3e2020-08-18 15:50:05 +0200572 assert(val && val->canonical && val->realtype);
Michal Vasko9b368d32020-02-14 13:53:31 +0100573
574 term = calloc(1, sizeof *term);
575 LY_CHECK_ERR_RET(!term, LOGMEM(schema->module->ctx), LY_EMEM);
576
577 term->schema = schema;
Michal Vasko9e685082021-01-29 14:49:09 +0100578 term->prev = &term->node;
Michal Vasko9b368d32020-02-14 13:53:31 +0100579 term->flags = LYD_NEW;
580
581 type = ((struct lysc_node_leaf *)schema)->type;
582 ret = type->plugin->duplicate(schema->module->ctx, val, &term->value);
583 if (ret) {
584 LOGERR(schema->module->ctx, ret, "Value duplication failed.");
585 free(term);
586 return ret;
587 }
Michal Vasko9e685082021-01-29 14:49:09 +0100588 lyd_hash(&term->node);
Michal Vasko90932a92020-02-12 14:33:03 +0100589
Michal Vasko9e685082021-01-29 14:49:09 +0100590 *node = &term->node;
Michal Vasko90932a92020-02-12 14:33:03 +0100591 return ret;
592}
593
594LY_ERR
595lyd_create_inner(const struct lysc_node *schema, struct lyd_node **node)
596{
597 struct lyd_node_inner *in;
598
Michal Vasko9b368d32020-02-14 13:53:31 +0100599 assert(schema->nodetype & LYD_NODE_INNER);
600
Michal Vasko90932a92020-02-12 14:33:03 +0100601 in = calloc(1, sizeof *in);
602 LY_CHECK_ERR_RET(!in, LOGMEM(schema->module->ctx), LY_EMEM);
603
604 in->schema = schema;
Michal Vasko9e685082021-01-29 14:49:09 +0100605 in->prev = &in->node;
Michal Vasko9b368d32020-02-14 13:53:31 +0100606 in->flags = LYD_NEW;
Michal Vasko3383be72020-11-03 17:15:31 +0100607 if ((schema->nodetype == LYS_CONTAINER) && !(schema->flags & LYS_PRESENCE)) {
608 in->flags |= LYD_DEFAULT;
609 }
Michal Vasko90932a92020-02-12 14:33:03 +0100610
Michal Vasko9b368d32020-02-14 13:53:31 +0100611 /* do not hash list with keys, we need them for the hash */
612 if ((schema->nodetype != LYS_LIST) || (schema->flags & LYS_KEYLESS)) {
Michal Vasko9e685082021-01-29 14:49:09 +0100613 lyd_hash(&in->node);
Michal Vasko9b368d32020-02-14 13:53:31 +0100614 }
Michal Vasko90932a92020-02-12 14:33:03 +0100615
Michal Vasko9e685082021-01-29 14:49:09 +0100616 *node = &in->node;
Michal Vasko90932a92020-02-12 14:33:03 +0100617 return LY_SUCCESS;
618}
619
Michal Vasko90932a92020-02-12 14:33:03 +0100620LY_ERR
Michal Vasko004d3152020-06-11 19:59:22 +0200621lyd_create_list(const struct lysc_node *schema, const struct ly_path_predicate *predicates, struct lyd_node **node)
Michal Vasko90932a92020-02-12 14:33:03 +0100622{
623 LY_ERR ret = LY_SUCCESS;
Michal Vasko90932a92020-02-12 14:33:03 +0100624 struct lyd_node *list = NULL, *key;
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200625 LY_ARRAY_COUNT_TYPE u;
Michal Vasko90932a92020-02-12 14:33:03 +0100626
Michal Vasko004d3152020-06-11 19:59:22 +0200627 assert((schema->nodetype == LYS_LIST) && !(schema->flags & LYS_KEYLESS));
Michal Vasko90932a92020-02-12 14:33:03 +0100628
629 /* create list */
630 LY_CHECK_GOTO(ret = lyd_create_inner(schema, &list), cleanup);
631
Radek Krejciddace2c2021-01-08 11:30:56 +0100632 LOG_LOCSET(NULL, list, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100633
Michal Vasko90932a92020-02-12 14:33:03 +0100634 /* create and insert all the keys */
Michal Vasko004d3152020-06-11 19:59:22 +0200635 LY_ARRAY_FOR(predicates, u) {
636 LY_CHECK_GOTO(ret = lyd_create_term2(predicates[u].key, &predicates[u].value, &key), cleanup);
Michal Vasko90932a92020-02-12 14:33:03 +0100637 lyd_insert_node(list, NULL, key);
638 }
639
Michal Vasko9b368d32020-02-14 13:53:31 +0100640 /* hash having all the keys */
641 lyd_hash(list);
642
Michal Vasko90932a92020-02-12 14:33:03 +0100643 /* success */
644 *node = list;
645 list = NULL;
646
647cleanup:
Radek Krejciddace2c2021-01-08 11:30:56 +0100648 LOG_LOCBACK(0, 1, 0, 0);
Michal Vasko90932a92020-02-12 14:33:03 +0100649 lyd_free_tree(list);
Michal Vasko004d3152020-06-11 19:59:22 +0200650 return ret;
651}
652
653static LY_ERR
654lyd_create_list2(const struct lysc_node *schema, const char *keys, size_t keys_len, struct lyd_node **node)
655{
656 LY_ERR ret = LY_SUCCESS;
657 struct lyxp_expr *expr = NULL;
658 uint16_t exp_idx = 0;
659 enum ly_path_pred_type pred_type = 0;
660 struct ly_path_predicate *predicates = NULL;
661
Radek Krejciddace2c2021-01-08 11:30:56 +0100662 LOG_LOCSET(schema, NULL, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100663
Michal Vasko004d3152020-06-11 19:59:22 +0200664 /* parse keys */
Michal Vasko6b26e742020-07-17 15:02:10 +0200665 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 +0200666 LY_PATH_PRED_KEYS, &expr), cleanup);
Michal Vasko004d3152020-06-11 19:59:22 +0200667
668 /* compile them */
Michal Vasko5d24f6c2020-10-13 13:49:06 +0200669 LY_CHECK_GOTO(ret = ly_path_compile_predicate(schema->module->ctx, NULL, NULL, schema, expr, &exp_idx, LY_PREF_JSON,
670 NULL, &predicates, &pred_type), cleanup);
Michal Vasko004d3152020-06-11 19:59:22 +0200671
672 /* create the list node */
673 LY_CHECK_GOTO(ret = lyd_create_list(schema, predicates, node), cleanup);
674
675cleanup:
Radek Krejciddace2c2021-01-08 11:30:56 +0100676 LOG_LOCBACK(1, 0, 0, 0);
Michal Vasko004d3152020-06-11 19:59:22 +0200677 lyxp_expr_free(schema->module->ctx, expr);
Michal Vaskof7e16e22020-10-21 09:24:39 +0200678 ly_path_predicates_free(schema->module->ctx, pred_type, predicates);
Michal Vasko90932a92020-02-12 14:33:03 +0100679 return ret;
680}
681
682LY_ERR
Michal Vasko366a4a12020-12-04 16:23:57 +0100683lyd_create_any(const struct lysc_node *schema, const void *value, LYD_ANYDATA_VALUETYPE value_type, ly_bool use_value,
684 struct lyd_node **node)
Michal Vasko90932a92020-02-12 14:33:03 +0100685{
Michal Vasko366a4a12020-12-04 16:23:57 +0100686 LY_ERR ret;
Michal Vasko90932a92020-02-12 14:33:03 +0100687 struct lyd_node_any *any;
Michal Vasko366a4a12020-12-04 16:23:57 +0100688 union lyd_any_value any_val;
Michal Vasko90932a92020-02-12 14:33:03 +0100689
Michal Vasko9b368d32020-02-14 13:53:31 +0100690 assert(schema->nodetype & LYD_NODE_ANY);
691
Michal Vasko90932a92020-02-12 14:33:03 +0100692 any = calloc(1, sizeof *any);
693 LY_CHECK_ERR_RET(!any, LOGMEM(schema->module->ctx), LY_EMEM);
694
695 any->schema = schema;
Michal Vasko9e685082021-01-29 14:49:09 +0100696 any->prev = &any->node;
Michal Vasko9b368d32020-02-14 13:53:31 +0100697 any->flags = LYD_NEW;
Michal Vasko90932a92020-02-12 14:33:03 +0100698
Radek Krejci1798aae2020-07-14 13:26:06 +0200699 /* TODO: convert XML/JSON strings into a opaq data tree */
Michal Vasko366a4a12020-12-04 16:23:57 +0100700
701 if (use_value) {
702 any->value.str = value;
703 any->value_type = value_type;
704 } else {
705 any_val.str = value;
Michal Vasko9e685082021-01-29 14:49:09 +0100706 ret = lyd_any_copy_value(&any->node, &any_val, value_type);
Michal Vasko366a4a12020-12-04 16:23:57 +0100707 LY_CHECK_ERR_RET(ret, free(any), ret);
708 }
Michal Vasko9e685082021-01-29 14:49:09 +0100709 lyd_hash(&any->node);
Michal Vasko90932a92020-02-12 14:33:03 +0100710
Michal Vasko9e685082021-01-29 14:49:09 +0100711 *node = &any->node;
Michal Vasko90932a92020-02-12 14:33:03 +0100712 return LY_SUCCESS;
713}
714
Michal Vasko52927e22020-03-16 17:26:14 +0100715LY_ERR
Michal Vasko501af032020-11-11 20:27:44 +0100716lyd_create_opaq(const struct ly_ctx *ctx, const char *name, size_t name_len, const char *prefix, size_t pref_len,
717 const char *module_key, size_t module_key_len, const char *value, size_t value_len, ly_bool *dynamic,
718 LY_PREFIX_FORMAT format, void *val_prefix_data, uint32_t hints, struct lyd_node **node)
Michal Vasko52927e22020-03-16 17:26:14 +0100719{
Radek Krejci011e4aa2020-09-04 15:22:31 +0200720 LY_ERR ret = LY_SUCCESS;
Michal Vasko52927e22020-03-16 17:26:14 +0100721 struct lyd_node_opaq *opaq;
722
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200723 assert(ctx && name && name_len && format);
Michal Vasko52927e22020-03-16 17:26:14 +0100724
725 if (!value_len) {
726 value = "";
727 }
728
729 opaq = calloc(1, sizeof *opaq);
Michal Vasko501af032020-11-11 20:27:44 +0100730 LY_CHECK_ERR_GOTO(!opaq, LOGMEM(ctx); ret = LY_EMEM, finish);
Michal Vasko52927e22020-03-16 17:26:14 +0100731
Michal Vasko9e685082021-01-29 14:49:09 +0100732 opaq->prev = &opaq->node;
Michal Vaskoad92b672020-11-12 13:11:31 +0100733 LY_CHECK_GOTO(ret = lydict_insert(ctx, name, name_len, &opaq->name.name), finish);
Radek Krejci011e4aa2020-09-04 15:22:31 +0200734
Michal Vasko52927e22020-03-16 17:26:14 +0100735 if (pref_len) {
Michal Vaskoad92b672020-11-12 13:11:31 +0100736 LY_CHECK_GOTO(ret = lydict_insert(ctx, prefix, pref_len, &opaq->name.prefix), finish);
Michal Vasko52927e22020-03-16 17:26:14 +0100737 }
Radek Krejci1798aae2020-07-14 13:26:06 +0200738 if (module_key_len) {
Michal Vaskoad92b672020-11-12 13:11:31 +0100739 LY_CHECK_GOTO(ret = lydict_insert(ctx, module_key, module_key_len, &opaq->name.module_ns), finish);
Radek Krejci1798aae2020-07-14 13:26:06 +0200740 }
Michal Vasko52927e22020-03-16 17:26:14 +0100741 if (dynamic && *dynamic) {
Radek Krejci011e4aa2020-09-04 15:22:31 +0200742 LY_CHECK_GOTO(ret = lydict_insert_zc(ctx, (char *)value, &opaq->value), finish);
Michal Vasko52927e22020-03-16 17:26:14 +0100743 *dynamic = 0;
744 } else {
Radek Krejci011e4aa2020-09-04 15:22:31 +0200745 LY_CHECK_GOTO(ret = lydict_insert(ctx, value, value_len, &opaq->value), finish);
Michal Vasko52927e22020-03-16 17:26:14 +0100746 }
Michal Vasko501af032020-11-11 20:27:44 +0100747
748 opaq->format = format;
749 opaq->val_prefix_data = val_prefix_data;
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200750 opaq->hints = hints;
Michal Vasko52927e22020-03-16 17:26:14 +0100751 opaq->ctx = ctx;
752
Radek Krejci011e4aa2020-09-04 15:22:31 +0200753finish:
754 if (ret) {
Michal Vasko9e685082021-01-29 14:49:09 +0100755 lyd_free_tree(&opaq->node);
Michal Vasko501af032020-11-11 20:27:44 +0100756 ly_free_prefix_data(format, val_prefix_data);
Radek Krejci011e4aa2020-09-04 15:22:31 +0200757 } else {
Michal Vasko9e685082021-01-29 14:49:09 +0100758 *node = &opaq->node;
Radek Krejci011e4aa2020-09-04 15:22:31 +0200759 }
760 return ret;
Michal Vasko52927e22020-03-16 17:26:14 +0100761}
762
Michal Vasko3a41dff2020-07-15 14:30:28 +0200763API LY_ERR
Michal Vasko65243892020-12-04 16:26:21 +0100764lyd_new_inner(struct lyd_node *parent, const struct lys_module *module, const char *name, ly_bool output,
765 struct lyd_node **node)
Michal Vasko013a8182020-03-03 10:46:53 +0100766{
767 struct lyd_node *ret = NULL;
768 const struct lysc_node *schema;
769 struct ly_ctx *ctx = parent ? parent->schema->module->ctx : (module ? module->ctx : NULL);
770
Michal Vasko6027eb92020-07-15 16:37:30 +0200771 LY_CHECK_ARG_RET(ctx, parent || module, parent || node, name, LY_EINVAL);
Michal Vasko013a8182020-03-03 10:46:53 +0100772
Michal Vaskof03ed032020-03-04 13:31:44 +0100773 if (!module) {
774 module = parent->schema->module;
775 }
776
Michal Vasko3a41dff2020-07-15 14:30:28 +0200777 schema = lys_find_child(parent ? parent->schema : NULL, module, name, 0,
Radek Krejci41ac9942020-11-02 14:47:56 +0100778 LYS_CONTAINER | LYS_NOTIF | LYS_RPC | LYS_ACTION, output ? LYS_GETNEXT_OUTPUT : 0);
Michal Vasko3a41dff2020-07-15 14:30:28 +0200779 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 +0100780
Michal Vasko3a41dff2020-07-15 14:30:28 +0200781 LY_CHECK_RET(lyd_create_inner(schema, &ret));
782 if (parent) {
Michal Vasko013a8182020-03-03 10:46:53 +0100783 lyd_insert_node(parent, NULL, ret);
784 }
Michal Vasko3a41dff2020-07-15 14:30:28 +0200785
786 if (node) {
787 *node = ret;
788 }
789 return LY_SUCCESS;
Michal Vasko013a8182020-03-03 10:46:53 +0100790}
791
Michal Vasko3a41dff2020-07-15 14:30:28 +0200792API LY_ERR
Michal Vasko65243892020-12-04 16:26:21 +0100793lyd_new_list(struct lyd_node *parent, const struct lys_module *module, const char *name, ly_bool output,
794 struct lyd_node **node, ...)
Michal Vasko013a8182020-03-03 10:46:53 +0100795{
796 struct lyd_node *ret = NULL, *key;
797 const struct lysc_node *schema, *key_s;
798 struct ly_ctx *ctx = parent ? parent->schema->module->ctx : (module ? module->ctx : NULL);
799 va_list ap;
800 const char *key_val;
801 LY_ERR rc = LY_SUCCESS;
802
Michal Vasko6027eb92020-07-15 16:37:30 +0200803 LY_CHECK_ARG_RET(ctx, parent || module, parent || node, name, LY_EINVAL);
Michal Vasko013a8182020-03-03 10:46:53 +0100804
Michal Vaskof03ed032020-03-04 13:31:44 +0100805 if (!module) {
806 module = parent->schema->module;
807 }
808
Radek Krejci41ac9942020-11-02 14:47:56 +0100809 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 +0200810 LY_CHECK_ERR_RET(!schema, LOGERR(ctx, LY_EINVAL, "List node \"%s\" not found.", name), LY_ENOTFOUND);
Michal Vasko013a8182020-03-03 10:46:53 +0100811
812 /* create list inner node */
Michal Vasko3a41dff2020-07-15 14:30:28 +0200813 LY_CHECK_RET(lyd_create_inner(schema, &ret));
Michal Vasko013a8182020-03-03 10:46:53 +0100814
Michal Vasko3a41dff2020-07-15 14:30:28 +0200815 va_start(ap, node);
Michal Vasko013a8182020-03-03 10:46:53 +0100816
817 /* create and insert all the keys */
Michal Vasko544e58a2021-01-28 14:33:41 +0100818 for (key_s = lysc_node_child(schema); key_s && (key_s->flags & LYS_KEY); key_s = key_s->next) {
Michal Vasko013a8182020-03-03 10:46:53 +0100819 key_val = va_arg(ap, const char *);
820
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200821 rc = lyd_create_term(key_s, key_val, key_val ? strlen(key_val) : 0, NULL, LY_PREF_JSON, NULL, LYD_HINT_DATA,
822 NULL, &key);
823 LY_CHECK_GOTO(rc, cleanup);
Michal Vasko013a8182020-03-03 10:46:53 +0100824 lyd_insert_node(ret, NULL, key);
825 }
826
Michal Vasko013a8182020-03-03 10:46:53 +0100827 if (parent) {
828 lyd_insert_node(parent, NULL, ret);
829 }
830
831cleanup:
Michal Vasko3a41dff2020-07-15 14:30:28 +0200832 va_end(ap);
Michal Vasko013a8182020-03-03 10:46:53 +0100833 if (rc) {
834 lyd_free_tree(ret);
835 ret = NULL;
Michal Vasko3a41dff2020-07-15 14:30:28 +0200836 } else if (node) {
837 *node = ret;
Michal Vasko013a8182020-03-03 10:46:53 +0100838 }
Michal Vasko3a41dff2020-07-15 14:30:28 +0200839 return rc;
Michal Vasko013a8182020-03-03 10:46:53 +0100840}
841
Michal Vasko3a41dff2020-07-15 14:30:28 +0200842API LY_ERR
843lyd_new_list2(struct lyd_node *parent, const struct lys_module *module, const char *name, const char *keys,
Radek Krejci41ac9942020-11-02 14:47:56 +0100844 ly_bool output, struct lyd_node **node)
Michal Vasko013a8182020-03-03 10:46:53 +0100845{
846 struct lyd_node *ret = NULL;
847 const struct lysc_node *schema;
848 struct ly_ctx *ctx = parent ? parent->schema->module->ctx : (module ? module->ctx : NULL);
849
Michal Vasko6027eb92020-07-15 16:37:30 +0200850 LY_CHECK_ARG_RET(ctx, parent || module, parent || node, name, LY_EINVAL);
Michal Vasko013a8182020-03-03 10:46:53 +0100851
Michal Vaskof03ed032020-03-04 13:31:44 +0100852 if (!module) {
853 module = parent->schema->module;
854 }
Michal Vasko004d3152020-06-11 19:59:22 +0200855 if (!keys) {
856 keys = "";
857 }
Michal Vaskof03ed032020-03-04 13:31:44 +0100858
Michal Vasko004d3152020-06-11 19:59:22 +0200859 /* find schema node */
Radek Krejci41ac9942020-11-02 14:47:56 +0100860 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 +0200861 LY_CHECK_ERR_RET(!schema, LOGERR(ctx, LY_EINVAL, "List node \"%s\" not found.", name), LY_ENOTFOUND);
Michal Vasko013a8182020-03-03 10:46:53 +0100862
Michal Vasko004d3152020-06-11 19:59:22 +0200863 if ((schema->flags & LYS_KEYLESS) && !keys[0]) {
864 /* key-less list */
Michal Vasko3a41dff2020-07-15 14:30:28 +0200865 LY_CHECK_RET(lyd_create_inner(schema, &ret));
Michal Vasko004d3152020-06-11 19:59:22 +0200866 } else {
867 /* create the list node */
Michal Vasko3a41dff2020-07-15 14:30:28 +0200868 LY_CHECK_RET(lyd_create_list2(schema, keys, strlen(keys), &ret));
Michal Vasko004d3152020-06-11 19:59:22 +0200869 }
Michal Vasko004d3152020-06-11 19:59:22 +0200870 if (parent) {
Michal Vasko013a8182020-03-03 10:46:53 +0100871 lyd_insert_node(parent, NULL, ret);
872 }
Michal Vasko3a41dff2020-07-15 14:30:28 +0200873
874 if (node) {
875 *node = ret;
876 }
877 return LY_SUCCESS;
Michal Vasko013a8182020-03-03 10:46:53 +0100878}
879
Michal Vasko3a41dff2020-07-15 14:30:28 +0200880API LY_ERR
881lyd_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 +0100882 ly_bool output, struct lyd_node **node)
Michal Vasko013a8182020-03-03 10:46:53 +0100883{
Michal Vaskocbff3e92020-05-27 12:56:41 +0200884 LY_ERR rc;
Michal Vasko013a8182020-03-03 10:46:53 +0100885 struct lyd_node *ret = NULL;
886 const struct lysc_node *schema;
887 struct ly_ctx *ctx = parent ? parent->schema->module->ctx : (module ? module->ctx : NULL);
888
Michal Vasko6027eb92020-07-15 16:37:30 +0200889 LY_CHECK_ARG_RET(ctx, parent || module, parent || node, name, LY_EINVAL);
Michal Vasko013a8182020-03-03 10:46:53 +0100890
Michal Vaskof03ed032020-03-04 13:31:44 +0100891 if (!module) {
892 module = parent->schema->module;
893 }
894
Radek Krejci41ac9942020-11-02 14:47:56 +0100895 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 +0200896 LY_CHECK_ERR_RET(!schema, LOGERR(ctx, LY_EINVAL, "Term node \"%s\" not found.", name), LY_ENOTFOUND);
Michal Vasko013a8182020-03-03 10:46:53 +0100897
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200898 rc = lyd_create_term(schema, val_str, val_str ? strlen(val_str) : 0, NULL, LY_PREF_JSON, NULL, LYD_HINT_DATA, NULL,
899 &ret);
900 LY_CHECK_RET(rc);
Michal Vaskocbff3e92020-05-27 12:56:41 +0200901 if (parent) {
Michal Vasko013a8182020-03-03 10:46:53 +0100902 lyd_insert_node(parent, NULL, ret);
903 }
Michal Vasko3a41dff2020-07-15 14:30:28 +0200904
905 if (node) {
906 *node = ret;
907 }
908 return LY_SUCCESS;
Michal Vasko013a8182020-03-03 10:46:53 +0100909}
910
Michal Vasko3a41dff2020-07-15 14:30:28 +0200911API LY_ERR
Michal Vasko219006c2020-12-04 16:26:52 +0100912lyd_new_any(struct lyd_node *parent, const struct lys_module *module, const char *name, void *value,
Radek Krejci41ac9942020-11-02 14:47:56 +0100913 LYD_ANYDATA_VALUETYPE value_type, ly_bool output, struct lyd_node **node)
Michal Vasko013a8182020-03-03 10:46:53 +0100914{
915 struct lyd_node *ret = NULL;
916 const struct lysc_node *schema;
917 struct ly_ctx *ctx = parent ? parent->schema->module->ctx : (module ? module->ctx : NULL);
918
Michal Vasko6027eb92020-07-15 16:37:30 +0200919 LY_CHECK_ARG_RET(ctx, parent || module, parent || node, name, LY_EINVAL);
Michal Vasko013a8182020-03-03 10:46:53 +0100920
Michal Vaskof03ed032020-03-04 13:31:44 +0100921 if (!module) {
922 module = parent->schema->module;
923 }
924
Radek Krejci41ac9942020-11-02 14:47:56 +0100925 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 +0200926 LY_CHECK_ERR_RET(!schema, LOGERR(ctx, LY_EINVAL, "Any node \"%s\" not found.", name), LY_ENOTFOUND);
Michal Vasko013a8182020-03-03 10:46:53 +0100927
Michal Vasko366a4a12020-12-04 16:23:57 +0100928 LY_CHECK_RET(lyd_create_any(schema, value, value_type, 1, &ret));
Michal Vasko3a41dff2020-07-15 14:30:28 +0200929 if (parent) {
Michal Vasko013a8182020-03-03 10:46:53 +0100930 lyd_insert_node(parent, NULL, ret);
931 }
Michal Vasko3a41dff2020-07-15 14:30:28 +0200932
933 if (node) {
934 *node = ret;
935 }
936 return LY_SUCCESS;
Michal Vasko013a8182020-03-03 10:46:53 +0100937}
938
Michal Vasko4490d312020-06-16 13:08:55 +0200939/**
940 * @brief Update node value.
941 *
942 * @param[in] node Node to update.
943 * @param[in] value New value to set.
944 * @param[in] value_type Type of @p value for any node.
945 * @param[out] new_parent Set to @p node if the value was updated, otherwise set to NULL.
946 * @param[out] new_node Set to @p node if the value was updated, otherwise set to NULL.
947 * @return LY_ERR value.
948 */
Michal Vasko00cbf532020-06-15 13:58:47 +0200949static LY_ERR
950lyd_new_path_update(struct lyd_node *node, const void *value, LYD_ANYDATA_VALUETYPE value_type,
Radek Krejci0f969882020-08-21 16:56:47 +0200951 struct lyd_node **new_parent, struct lyd_node **new_node)
Michal Vasko00cbf532020-06-15 13:58:47 +0200952{
953 LY_ERR ret = LY_SUCCESS;
954 struct lyd_node *new_any;
955
956 switch (node->schema->nodetype) {
957 case LYS_CONTAINER:
958 case LYS_NOTIF:
959 case LYS_RPC:
960 case LYS_ACTION:
961 case LYS_LIST:
962 case LYS_LEAFLIST:
963 /* if it exists, there is nothing to update */
964 *new_parent = NULL;
965 *new_node = NULL;
966 break;
967 case LYS_LEAF:
968 ret = lyd_change_term(node, value);
969 if ((ret == LY_SUCCESS) || (ret == LY_EEXIST)) {
970 /* there was an actual change (at least of the default flag) */
971 *new_parent = node;
972 *new_node = node;
973 ret = LY_SUCCESS;
974 } else if (ret == LY_ENOT) {
975 /* no change */
976 *new_parent = NULL;
977 *new_node = NULL;
978 ret = LY_SUCCESS;
979 } /* else error */
980 break;
981 case LYS_ANYDATA:
982 case LYS_ANYXML:
983 /* create a new any node */
Michal Vasko366a4a12020-12-04 16:23:57 +0100984 LY_CHECK_RET(lyd_create_any(node->schema, value, value_type, 0, &new_any));
Michal Vasko00cbf532020-06-15 13:58:47 +0200985
986 /* compare with the existing one */
Michal Vasko8f359bf2020-07-28 10:41:15 +0200987 if (lyd_compare_single(node, new_any, 0)) {
Michal Vasko00cbf532020-06-15 13:58:47 +0200988 /* not equal, switch values (so that we can use generic node free) */
989 ((struct lyd_node_any *)new_any)->value = ((struct lyd_node_any *)node)->value;
990 ((struct lyd_node_any *)new_any)->value_type = ((struct lyd_node_any *)node)->value_type;
991 ((struct lyd_node_any *)node)->value.str = value;
992 ((struct lyd_node_any *)node)->value_type = value_type;
993
994 *new_parent = node;
995 *new_node = node;
996 } else {
997 /* they are equal */
998 *new_parent = NULL;
999 *new_node = NULL;
1000 }
1001 lyd_free_tree(new_any);
1002 break;
1003 default:
Michal Vaskob7be7a82020-08-20 09:09:04 +02001004 LOGINT(LYD_CTX(node));
Michal Vasko00cbf532020-06-15 13:58:47 +02001005 ret = LY_EINT;
1006 break;
1007 }
1008
1009 return ret;
1010}
1011
Michal Vasko3a41dff2020-07-15 14:30:28 +02001012API LY_ERR
Michal Vasko871a0252020-11-11 18:35:24 +01001013lyd_new_meta(const struct ly_ctx *ctx, struct lyd_node *parent, const struct lys_module *module, const char *name,
1014 const char *val_str, ly_bool clear_dflt, struct lyd_meta **meta)
Michal Vaskod86997b2020-05-26 15:19:54 +02001015{
Michal Vaskod86997b2020-05-26 15:19:54 +02001016 const char *prefix, *tmp;
Michal Vaskod86997b2020-05-26 15:19:54 +02001017 size_t pref_len, name_len;
1018
Michal Vasko871a0252020-11-11 18:35:24 +01001019 LY_CHECK_ARG_RET(NULL, ctx, name, module || strchr(name, ':'), parent || meta, LY_EINVAL);
Michal Vasko00cbf532020-06-15 13:58:47 +02001020
Michal Vasko871a0252020-11-11 18:35:24 +01001021 if (parent && !parent->schema) {
1022 LOGERR(ctx, LY_EINVAL, "Cannot add metadata to an opaque node \"%s\".", ((struct lyd_node_opaq *)parent)->name);
1023 return LY_EINVAL;
1024 }
Michal Vasko610553d2020-11-18 18:15:05 +01001025 if (meta) {
1026 *meta = NULL;
1027 }
Michal Vaskod86997b2020-05-26 15:19:54 +02001028
1029 /* parse the name */
1030 tmp = name;
1031 if (ly_parse_nodeid(&tmp, &prefix, &pref_len, &name, &name_len) || tmp[0]) {
1032 LOGERR(ctx, LY_EINVAL, "Metadata name \"%s\" is not valid.", name);
Michal Vasko871a0252020-11-11 18:35:24 +01001033 return LY_EINVAL;
Michal Vaskod86997b2020-05-26 15:19:54 +02001034 }
1035
1036 /* find the module */
1037 if (prefix) {
Radek Krejci0ad51f12020-07-16 12:08:12 +02001038 module = ly_ctx_get_module_implemented2(ctx, prefix, pref_len);
Michal Vasko3a41dff2020-07-15 14:30:28 +02001039 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 +02001040 }
1041
1042 /* set value if none */
1043 if (!val_str) {
1044 val_str = "";
1045 }
1046
Michal Vasko871a0252020-11-11 18:35:24 +01001047 return lyd_create_meta(parent, meta, module, name, name_len, val_str, strlen(val_str), NULL, LY_PREF_JSON,
1048 NULL, LYD_HINT_DATA, clear_dflt, NULL);
1049}
Michal Vasko3a41dff2020-07-15 14:30:28 +02001050
Michal Vaskoba696702020-11-11 19:12:45 +01001051API LY_ERR
1052lyd_new_meta2(const struct ly_ctx *ctx, struct lyd_node *parent, ly_bool clear_dflt, const struct lyd_attr *attr,
1053 struct lyd_meta **meta)
1054{
1055 const struct lys_module *mod;
1056
1057 LY_CHECK_ARG_RET(NULL, ctx, attr, parent || meta, LY_EINVAL);
1058
1059 if (parent && !parent->schema) {
1060 LOGERR(ctx, LY_EINVAL, "Cannot add metadata to an opaque node \"%s\".", ((struct lyd_node_opaq *)parent)->name);
1061 return LY_EINVAL;
Michal Vasko3a41dff2020-07-15 14:30:28 +02001062 }
Michal Vasko610553d2020-11-18 18:15:05 +01001063 if (meta) {
1064 *meta = NULL;
1065 }
Michal Vaskoba696702020-11-11 19:12:45 +01001066
1067 switch (attr->format) {
1068 case LY_PREF_XML:
Michal Vaskoad92b672020-11-12 13:11:31 +01001069 mod = ly_ctx_get_module_implemented_ns(ctx, attr->name.module_ns);
Michal Vaskoba696702020-11-11 19:12:45 +01001070 if (!mod) {
Michal Vaskoad92b672020-11-12 13:11:31 +01001071 LOGERR(ctx, LY_EINVAL, "Module with namespace \"%s\" not found.", attr->name.module_ns);
Michal Vaskoba696702020-11-11 19:12:45 +01001072 return LY_ENOTFOUND;
1073 }
1074 break;
1075 case LY_PREF_JSON:
Michal Vaskoad92b672020-11-12 13:11:31 +01001076 mod = ly_ctx_get_module_implemented(ctx, attr->name.module_name);
Michal Vaskoba696702020-11-11 19:12:45 +01001077 if (!mod) {
Michal Vaskoad92b672020-11-12 13:11:31 +01001078 LOGERR(ctx, LY_EINVAL, "Module \"%s\" not found.", attr->name.module_name);
Michal Vaskoba696702020-11-11 19:12:45 +01001079 return LY_ENOTFOUND;
1080 }
1081 break;
1082 default:
1083 LOGINT_RET(ctx);
1084 }
1085
Michal Vaskoad92b672020-11-12 13:11:31 +01001086 return lyd_create_meta(parent, meta, mod, attr->name.name, strlen(attr->name.name), attr->value, strlen(attr->value),
Michal Vaskoba696702020-11-11 19:12:45 +01001087 NULL, attr->format, attr->val_prefix_data, attr->hints, clear_dflt, NULL);
Michal Vaskod86997b2020-05-26 15:19:54 +02001088}
1089
Michal Vasko3a41dff2020-07-15 14:30:28 +02001090API LY_ERR
Michal Vasko00cbf532020-06-15 13:58:47 +02001091lyd_new_opaq(struct lyd_node *parent, const struct ly_ctx *ctx, const char *name, const char *value,
Radek Krejci0f969882020-08-21 16:56:47 +02001092 const char *module_name, struct lyd_node **node)
Michal Vasko00cbf532020-06-15 13:58:47 +02001093{
1094 struct lyd_node *ret = NULL;
1095
Michal Vasko6027eb92020-07-15 16:37:30 +02001096 LY_CHECK_ARG_RET(ctx, parent || ctx, parent || node, name, module_name, LY_EINVAL);
Michal Vasko00cbf532020-06-15 13:58:47 +02001097
1098 if (!ctx) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001099 ctx = LYD_CTX(parent);
Michal Vasko00cbf532020-06-15 13:58:47 +02001100 }
1101 if (!value) {
1102 value = "";
1103 }
1104
Michal Vasko501af032020-11-11 20:27:44 +01001105 LY_CHECK_RET(lyd_create_opaq(ctx, name, strlen(name), NULL, 0, module_name, strlen(module_name), value,
1106 strlen(value), NULL, LY_PREF_JSON, NULL, 0, &ret));
Michal Vasko3a41dff2020-07-15 14:30:28 +02001107 if (parent) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001108 lyd_insert_node(parent, NULL, ret);
1109 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02001110
1111 if (node) {
1112 *node = ret;
1113 }
1114 return LY_SUCCESS;
Michal Vasko00cbf532020-06-15 13:58:47 +02001115}
1116
Michal Vasko3a41dff2020-07-15 14:30:28 +02001117API LY_ERR
Michal Vasko8d65f852021-02-17 11:28:13 +01001118lyd_new_opaq2(struct lyd_node *parent, const struct ly_ctx *ctx, const char *name, const char *value,
1119 const char *module_ns, struct lyd_node **node)
1120{
1121 struct lyd_node *ret = NULL;
1122
1123 LY_CHECK_ARG_RET(ctx, parent || ctx, parent || node, name, module_ns, LY_EINVAL);
1124
1125 if (!ctx) {
1126 ctx = LYD_CTX(parent);
1127 }
1128 if (!value) {
1129 value = "";
1130 }
1131
1132 LY_CHECK_RET(lyd_create_opaq(ctx, name, strlen(name), NULL, 0, module_ns, strlen(module_ns), value,
1133 strlen(value), NULL, LY_PREF_XML, NULL, 0, &ret));
1134 if (parent) {
1135 lyd_insert_node(parent, NULL, ret);
1136 }
1137
1138 if (node) {
1139 *node = ret;
1140 }
1141 return LY_SUCCESS;
1142}
1143
1144API LY_ERR
1145lyd_new_attr(struct lyd_node *parent, const char *module_name, const char *name, const char *value,
Radek Krejci0f969882020-08-21 16:56:47 +02001146 struct lyd_attr **attr)
Michal Vasko00cbf532020-06-15 13:58:47 +02001147{
Radek Krejci1798aae2020-07-14 13:26:06 +02001148 struct lyd_attr *ret = NULL;
Michal Vasko00cbf532020-06-15 13:58:47 +02001149 const struct ly_ctx *ctx;
1150 const char *prefix, *tmp;
Michal Vasko51d21b82020-11-13 18:03:54 +01001151 size_t pref_len, name_len, mod_len;
Michal Vasko00cbf532020-06-15 13:58:47 +02001152
Michal Vasko3a41dff2020-07-15 14:30:28 +02001153 LY_CHECK_ARG_RET(NULL, parent, !parent->schema, name, LY_EINVAL);
Michal Vasko00cbf532020-06-15 13:58:47 +02001154
Michal Vaskob7be7a82020-08-20 09:09:04 +02001155 ctx = LYD_CTX(parent);
Michal Vasko00cbf532020-06-15 13:58:47 +02001156
1157 /* parse the name */
1158 tmp = name;
1159 if (ly_parse_nodeid(&tmp, &prefix, &pref_len, &name, &name_len) || tmp[0]) {
Michal Vaskob69b68c2021-02-17 11:18:16 +01001160 LOGERR(ctx, LY_EINVAL, "Attribute name \"%s\" is not valid.", name);
Michal Vasko3a41dff2020-07-15 14:30:28 +02001161 return LY_EVALID;
Michal Vasko00cbf532020-06-15 13:58:47 +02001162 }
1163
Michal Vasko51d21b82020-11-13 18:03:54 +01001164 /* get the module */
1165 if (module_name) {
1166 mod_len = strlen(module_name);
1167 } else {
1168 module_name = prefix;
1169 mod_len = pref_len;
1170 }
1171
Michal Vasko00cbf532020-06-15 13:58:47 +02001172 /* set value if none */
Michal Vasko8d65f852021-02-17 11:28:13 +01001173 if (!value) {
1174 value = "";
Michal Vasko00cbf532020-06-15 13:58:47 +02001175 }
1176
Michal Vasko8d65f852021-02-17 11:28:13 +01001177 LY_CHECK_RET(lyd_create_attr(parent, &ret, ctx, name, name_len, prefix, pref_len, module_name, mod_len, value,
1178 strlen(value), NULL, LY_PREF_JSON, NULL, LYD_HINT_DATA));
1179
1180 if (attr) {
1181 *attr = ret;
1182 }
1183 return LY_SUCCESS;
1184}
1185
1186API LY_ERR
1187lyd_new_attr2(struct lyd_node *parent, const char *module_ns, const char *name, const char *value,
1188 struct lyd_attr **attr)
1189{
1190 struct lyd_attr *ret = NULL;
1191 const struct ly_ctx *ctx;
1192 const char *prefix, *tmp;
1193 size_t pref_len, name_len;
1194
1195 LY_CHECK_ARG_RET(NULL, parent, !parent->schema, name, LY_EINVAL);
1196
1197 ctx = LYD_CTX(parent);
1198
1199 /* parse the name */
1200 tmp = name;
1201 if (ly_parse_nodeid(&tmp, &prefix, &pref_len, &name, &name_len) || tmp[0]) {
1202 LOGERR(ctx, LY_EINVAL, "Attribute name \"%s\" is not valid.", name);
1203 return LY_EVALID;
1204 }
1205
1206 /* set value if none */
1207 if (!value) {
1208 value = "";
1209 }
1210
1211 LY_CHECK_RET(lyd_create_attr(parent, &ret, ctx, name, name_len, prefix, pref_len, module_ns,
1212 module_ns ? strlen(module_ns) : 0, value, strlen(value), NULL, LY_PREF_XML, NULL, LYD_HINT_DATA));
Michal Vasko3a41dff2020-07-15 14:30:28 +02001213
1214 if (attr) {
1215 *attr = ret;
1216 }
1217 return LY_SUCCESS;
Michal Vasko00cbf532020-06-15 13:58:47 +02001218}
1219
1220API LY_ERR
1221lyd_change_term(struct lyd_node *term, const char *val_str)
1222{
1223 LY_ERR ret = LY_SUCCESS;
1224 struct lysc_type *type;
1225 struct lyd_node_term *t;
1226 struct lyd_node *parent;
1227 struct lyd_value val = {0};
Radek Krejci857189e2020-09-01 13:26:36 +02001228 ly_bool dflt_change, val_change;
Michal Vasko00cbf532020-06-15 13:58:47 +02001229
1230 LY_CHECK_ARG_RET(NULL, term, term->schema, term->schema->nodetype & LYD_NODE_TERM, LY_EINVAL);
1231
1232 if (!val_str) {
1233 val_str = "";
1234 }
1235 t = (struct lyd_node_term *)term;
1236 type = ((struct lysc_node_leaf *)term->schema)->type;
1237
1238 /* parse the new value */
Radek Krejciddace2c2021-01-08 11:30:56 +01001239 LOG_LOCSET(term->schema, term, NULL, NULL);
Michal Vaskofeca4fb2020-10-05 08:58:40 +02001240 ret = lyd_value_store(LYD_CTX(term), &val, type, val_str, strlen(val_str), NULL, LY_PREF_JSON, NULL, LYD_HINT_DATA,
Radek Krejci2efc45b2020-12-22 16:25:44 +01001241 term->schema, NULL);
Radek Krejciddace2c2021-01-08 11:30:56 +01001242 LOG_LOCBACK(term->schema ? 1 : 0, 1, 0, 0);
Michal Vaskofeca4fb2020-10-05 08:58:40 +02001243 LY_CHECK_GOTO(ret, cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001244
1245 /* compare original and new value */
1246 if (type->plugin->compare(&t->value, &val)) {
1247 /* values differ, switch them */
Michal Vaskob7be7a82020-08-20 09:09:04 +02001248 type->plugin->free(LYD_CTX(term), &t->value);
Michal Vasko00cbf532020-06-15 13:58:47 +02001249 t->value = val;
1250 memset(&val, 0, sizeof val);
1251 val_change = 1;
1252 } else {
1253 val_change = 0;
1254 }
1255
1256 /* always clear the default flag */
1257 if (term->flags & LYD_DEFAULT) {
Michal Vasko9e685082021-01-29 14:49:09 +01001258 for (parent = term; parent; parent = lyd_parent(parent)) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001259 parent->flags &= ~LYD_DEFAULT;
1260 }
1261 dflt_change = 1;
1262 } else {
1263 dflt_change = 0;
1264 }
1265
1266 if (val_change || dflt_change) {
1267 /* make the node non-validated */
1268 term->flags &= LYD_NEW;
1269 }
1270
1271 if (val_change) {
1272 if (term->schema->nodetype == LYS_LEAFLIST) {
1273 /* leaf-list needs to be hashed again and re-inserted into parent */
1274 lyd_unlink_hash(term);
1275 lyd_hash(term);
1276 LY_CHECK_GOTO(ret = lyd_insert_hash(term), cleanup);
1277 } else if ((term->schema->flags & LYS_KEY) && term->parent) {
1278 /* list needs to be updated if its key was changed */
1279 assert(term->parent->schema->nodetype == LYS_LIST);
Michal Vasko9e685082021-01-29 14:49:09 +01001280 lyd_unlink_hash(lyd_parent(term));
1281 lyd_hash(lyd_parent(term));
1282 LY_CHECK_GOTO(ret = lyd_insert_hash(lyd_parent(term)), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001283 } /* else leaf that is not a key, its value is not used for its hash so it does not change */
1284 }
1285
1286 /* retrun value */
1287 if (!val_change) {
1288 if (dflt_change) {
1289 /* only default flag change */
1290 ret = LY_EEXIST;
1291 } else {
1292 /* no change */
1293 ret = LY_ENOT;
1294 }
1295 } /* else value changed, LY_SUCCESS */
1296
1297cleanup:
Michal Vasko59512fc2020-12-09 18:13:29 +01001298 if (val.realtype) {
1299 type->plugin->free(LYD_CTX(term), &val);
1300 }
Michal Vasko00cbf532020-06-15 13:58:47 +02001301 return ret;
1302}
1303
Michal Vasko41586352020-07-13 13:54:25 +02001304API LY_ERR
1305lyd_change_meta(struct lyd_meta *meta, const char *val_str)
1306{
1307 LY_ERR ret = LY_SUCCESS;
Radek Krejci2b18bf12020-11-06 11:20:20 +01001308 struct lyd_meta *m2 = NULL;
Michal Vasko41586352020-07-13 13:54:25 +02001309 struct lyd_value val;
Radek Krejci857189e2020-09-01 13:26:36 +02001310 ly_bool val_change;
Michal Vasko41586352020-07-13 13:54:25 +02001311
1312 LY_CHECK_ARG_RET(NULL, meta, LY_EINVAL);
1313
1314 if (!val_str) {
1315 val_str = "";
1316 }
1317
1318 /* parse the new value into a new meta structure */
1319 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 +01001320 strlen(val_str), NULL, LY_PREF_JSON, NULL, LYD_HINT_DATA, 0, NULL), cleanup);
Michal Vasko41586352020-07-13 13:54:25 +02001321
1322 /* compare original and new value */
1323 if (lyd_compare_meta(meta, m2)) {
1324 /* values differ, switch them */
1325 val = meta->value;
1326 meta->value = m2->value;
1327 m2->value = val;
1328 val_change = 1;
1329 } else {
1330 val_change = 0;
1331 }
1332
1333 /* retrun value */
1334 if (!val_change) {
1335 /* no change */
1336 ret = LY_ENOT;
1337 } /* else value changed, LY_SUCCESS */
1338
1339cleanup:
Michal Vasko1a66a5d2020-11-18 18:15:37 +01001340 lyd_free_meta_single(m2);
Michal Vasko41586352020-07-13 13:54:25 +02001341 return ret;
1342}
1343
Michal Vasko3a41dff2020-07-15 14:30:28 +02001344API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02001345lyd_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 +02001346 struct lyd_node **node)
Michal Vasko00cbf532020-06-15 13:58:47 +02001347{
Michal Vasko3a41dff2020-07-15 14:30:28 +02001348 return lyd_new_path2(parent, ctx, path, value, 0, options, node, NULL);
Michal Vasko00cbf532020-06-15 13:58:47 +02001349}
1350
Michal Vasko6741dc62021-02-04 09:27:45 +01001351static LY_ERR
1352lyd_new_path_check_find_lypath(struct ly_path *path, const char *str_path, const char *value, uint32_t options)
1353{
1354 LY_ERR ret = LY_SUCCESS, r;
1355 const struct lysc_node *schema;
1356 struct ly_path_predicate *pred;
Michal Vasko6f9b4262021-02-04 12:09:56 +01001357 LY_ARRAY_COUNT_TYPE u, new_count;
Michal Vasko6741dc62021-02-04 09:27:45 +01001358
1359 assert(path);
1360
1361 /* go through all the compiled nodes */
1362 LY_ARRAY_FOR(path, u) {
1363 schema = path[u].node;
Michal Vasko6f9b4262021-02-04 12:09:56 +01001364 new_count = u + 1;
Michal Vasko6741dc62021-02-04 09:27:45 +01001365 if ((schema->nodetype == LYS_LIST) && (path[u].pred_type == LY_PATH_PREDTYPE_NONE)) {
1366 if (schema->flags & LYS_KEYLESS) {
1367 /* creating a new keyless list instance */
1368 break;
1369 } else if ((u < LY_ARRAY_COUNT(path) - 1) || !(options & LYD_NEW_PATH_OPAQ)) {
1370 LOG_LOCSET(schema, NULL, NULL, NULL);
1371 LOGVAL(schema->module->ctx, LYVE_XPATH, "Predicate missing for %s \"%s\" in path \"%s\".",
1372 lys_nodetype2str(schema->nodetype), schema->name, str_path);
1373 LOG_LOCBACK(1, 0, 0, 0);
1374 return LY_EINVAL;
1375 } /* else creating an opaque list without keys */
1376 }
1377 }
1378
Michal Vasko6f9b4262021-02-04 12:09:56 +01001379 if ((schema->nodetype == LYS_LEAFLIST) && (path[new_count - 1].pred_type == LY_PATH_PREDTYPE_NONE)) {
Michal Vasko6741dc62021-02-04 09:27:45 +01001380 /* parse leafref value into a predicate, if not defined in the path */
1381 if (!value) {
1382 value = "";
1383 }
1384
1385 r = LY_SUCCESS;
1386 if (options & LYD_NEW_PATH_OPAQ) {
1387 r = lys_value_validate(NULL, schema, value, strlen(value));
1388 }
1389 if (!r) {
1390 /* store the new predicate */
Michal Vasko6f9b4262021-02-04 12:09:56 +01001391 path[new_count - 1].pred_type = LY_PATH_PREDTYPE_LEAFLIST;
1392 LY_ARRAY_NEW_GOTO(schema->module->ctx, path[new_count - 1].predicates, pred, ret, cleanup);
Michal Vasko6741dc62021-02-04 09:27:45 +01001393
1394 ret = lyd_value_store(schema->module->ctx, &pred->value, ((struct lysc_node_leaflist *)schema)->type, value,
1395 strlen(value), NULL, LY_PREF_JSON, NULL, LYD_HINT_DATA, schema, NULL);
1396 LY_CHECK_GOTO(ret, cleanup);
1397 ++((struct lysc_type *)pred->value.realtype)->refcount;
1398
1399 if (schema->flags & LYS_CONFIG_R) {
1400 /* creating a new state leaf-list instance */
Michal Vasko6f9b4262021-02-04 12:09:56 +01001401 --new_count;
Michal Vasko6741dc62021-02-04 09:27:45 +01001402 }
1403 } /* else we have opaq flag and the value is not valid, leave no predicate and then create an opaque node */
1404 }
1405
1406 /* hide the nodes that should always be created so they are not found */
Michal Vasko6f9b4262021-02-04 12:09:56 +01001407 while (new_count < LY_ARRAY_COUNT(path)) {
Michal Vasko6741dc62021-02-04 09:27:45 +01001408 LY_ARRAY_DECREMENT(path);
1409 }
1410
1411cleanup:
1412 return ret;
1413}
1414
Michal Vasko00cbf532020-06-15 13:58:47 +02001415API LY_ERR
1416lyd_new_path2(struct lyd_node *parent, const struct ly_ctx *ctx, const char *path, const void *value,
Radek Krejci1deb5be2020-08-26 16:43:36 +02001417 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 +02001418{
1419 LY_ERR ret = LY_SUCCESS, r;
1420 struct lyxp_expr *exp = NULL;
1421 struct ly_path *p = NULL;
1422 struct lyd_node *nparent = NULL, *nnode = NULL, *node = NULL, *cur_parent;
1423 const struct lysc_node *schema;
Michal Vasko6741dc62021-02-04 09:27:45 +01001424 LY_ARRAY_COUNT_TYPE path_idx = 0, orig_count;
Michal Vasko00cbf532020-06-15 13:58:47 +02001425
1426 LY_CHECK_ARG_RET(ctx, parent || ctx, path, (path[0] == '/') || parent, LY_EINVAL);
1427
1428 if (!ctx) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001429 ctx = LYD_CTX(parent);
Michal Vasko00cbf532020-06-15 13:58:47 +02001430 }
1431
1432 /* parse path */
Michal Vasko6b26e742020-07-17 15:02:10 +02001433 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 +02001434 LY_PATH_PREFIX_OPTIONAL, LY_PATH_PRED_SIMPLE, &exp), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001435
1436 /* compile path */
1437 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 +02001438 options & LYD_NEW_PATH_OUTPUT ? LY_PATH_OPER_OUTPUT : LY_PATH_OPER_INPUT, LY_PATH_TARGET_MANY, LY_PREF_JSON,
Michal Vasko405cc9e2020-12-01 12:01:27 +01001439 NULL, NULL, &p), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001440
Michal Vasko6741dc62021-02-04 09:27:45 +01001441 /* check the compiled path before searching existing nodes, it may be shortened */
1442 orig_count = LY_ARRAY_COUNT(p);
1443 LY_CHECK_GOTO(ret = lyd_new_path_check_find_lypath(p, path, value, options), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001444
1445 /* try to find any existing nodes in the path */
1446 if (parent) {
1447 ret = ly_path_eval_partial(p, parent, &path_idx, &node);
1448 if (ret == LY_SUCCESS) {
Michal Vasko6741dc62021-02-04 09:27:45 +01001449 if (orig_count == LY_ARRAY_COUNT(p)) {
1450 /* the node exists, are we supposed to update it or is it just a default? */
1451 if (!(options & LYD_NEW_PATH_UPDATE) && !(node->flags & LYD_DEFAULT)) {
1452 LOG_LOCSET(NULL, node, NULL, NULL);
1453 LOGVAL(ctx, LYVE_REFERENCE, "Path \"%s\" already exists", path);
1454 LOG_LOCBACK(0, 1, 0, 0);
1455 ret = LY_EEXIST;
1456 goto cleanup;
1457 }
Michal Vasko00cbf532020-06-15 13:58:47 +02001458
Michal Vasko6741dc62021-02-04 09:27:45 +01001459 /* update the existing node */
1460 ret = lyd_new_path_update(node, value, value_type, &nparent, &nnode);
1461 goto cleanup;
1462 } /* else we were not searching for the whole path */
Michal Vasko00cbf532020-06-15 13:58:47 +02001463 } else if (ret == LY_EINCOMPLETE) {
1464 /* some nodes were found, adjust the iterator to the next segment */
1465 ++path_idx;
1466 } else if (ret == LY_ENOTFOUND) {
1467 /* 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 +01001468 if (lysc_data_parent(p[0].node)) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001469 node = parent;
1470 }
1471 } else {
1472 /* error */
1473 goto cleanup;
1474 }
1475 }
1476
Michal Vasko6741dc62021-02-04 09:27:45 +01001477 /* restore the full path for creating new nodes */
1478 while (orig_count > LY_ARRAY_COUNT(p)) {
1479 LY_ARRAY_INCREMENT(p);
1480 }
1481
Michal Vasko00cbf532020-06-15 13:58:47 +02001482 /* create all the non-existing nodes in a loop */
Michal Vaskod989ba02020-08-24 10:59:24 +02001483 for ( ; path_idx < LY_ARRAY_COUNT(p); ++path_idx) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001484 cur_parent = node;
1485 schema = p[path_idx].node;
1486
1487 switch (schema->nodetype) {
1488 case LYS_LIST:
1489 if (!(schema->flags & LYS_KEYLESS)) {
Radek Krejci092e33c2020-10-12 15:33:10 +02001490 if ((options & LYD_NEW_PATH_OPAQ) && (p[path_idx].pred_type == LY_PATH_PREDTYPE_NONE)) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001491 /* creating opaque list without keys */
Michal Vasko501af032020-11-11 20:27:44 +01001492 LY_CHECK_GOTO(ret = lyd_create_opaq(ctx, schema->name, strlen(schema->name), NULL, 0,
1493 schema->module->name, strlen(schema->module->name), NULL, 0, NULL, LY_PREF_JSON, NULL,
1494 LYD_NODEHINT_LIST, &node), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001495 } else {
Michal Vasko8b776962021-01-12 12:21:49 +01001496 if (p[path_idx].pred_type != LY_PATH_PREDTYPE_LIST) {
1497 LOG_LOCSET(schema, NULL, NULL, NULL);
1498 LOGVAL(ctx, LYVE_XPATH, "Predicate missing for %s \"%s\" in path \"%s\".",
1499 lys_nodetype2str(schema->nodetype), schema->name, path);
1500 LOG_LOCBACK(1, 0, 0, 0);
1501 ret = LY_EINVAL;
1502 goto cleanup;
1503 }
1504
Michal Vasko00cbf532020-06-15 13:58:47 +02001505 LY_CHECK_GOTO(ret = lyd_create_list(schema, p[path_idx].predicates, &node), cleanup);
1506 }
1507 break;
1508 }
Radek Krejcif13b87b2020-12-01 22:02:17 +01001509 /* fall through */
Michal Vasko00cbf532020-06-15 13:58:47 +02001510 case LYS_CONTAINER:
1511 case LYS_NOTIF:
1512 case LYS_RPC:
1513 case LYS_ACTION:
1514 LY_CHECK_GOTO(ret = lyd_create_inner(schema, &node), cleanup);
1515 break;
1516 case LYS_LEAFLIST:
Radek Krejci092e33c2020-10-12 15:33:10 +02001517 if ((options & LYD_NEW_PATH_OPAQ) && (p[path_idx].pred_type == LY_PATH_PREDTYPE_NONE)) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001518 /* creating opaque leaf-list without value */
Michal Vasko501af032020-11-11 20:27:44 +01001519 LY_CHECK_GOTO(ret = lyd_create_opaq(ctx, schema->name, strlen(schema->name), NULL, 0,
1520 schema->module->name, strlen(schema->module->name), NULL, 0, NULL, LY_PREF_JSON, NULL,
1521 LYD_NODEHINT_LEAFLIST, &node), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001522 } else {
1523 assert(p[path_idx].pred_type == LY_PATH_PREDTYPE_LEAFLIST);
1524 LY_CHECK_GOTO(ret = lyd_create_term2(schema, &p[path_idx].predicates[0].value, &node), cleanup);
1525 }
1526 break;
1527 case LYS_LEAF:
Michal Vasko35880332020-12-08 13:08:12 +01001528 if (lysc_is_key(schema)) {
1529 /* it must have been already created or some error will occur later */
1530 assert(cur_parent);
1531 node = lyd_child(cur_parent);
1532 assert(node && (node->schema == schema));
1533 goto next_iter;
1534 }
1535
1536 /* make sure there is some value */
Michal Vasko00cbf532020-06-15 13:58:47 +02001537 if (!value) {
1538 value = "";
1539 }
1540
1541 r = LY_SUCCESS;
Radek Krejci092e33c2020-10-12 15:33:10 +02001542 if (options & LYD_NEW_PATH_OPAQ) {
Michal Vaskof937cfe2020-08-03 16:07:12 +02001543 r = lys_value_validate(NULL, schema, value, strlen(value));
Michal Vasko00cbf532020-06-15 13:58:47 +02001544 }
1545 if (!r) {
Michal Vaskofeca4fb2020-10-05 08:58:40 +02001546 ret = lyd_create_term(schema, value, strlen(value), NULL, LY_PREF_JSON, NULL, LYD_HINT_DATA, NULL, &node);
1547 LY_CHECK_GOTO(ret, cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001548 } else {
1549 /* creating opaque leaf without value */
Michal Vasko501af032020-11-11 20:27:44 +01001550 LY_CHECK_GOTO(ret = lyd_create_opaq(ctx, schema->name, strlen(schema->name), NULL, 0, schema->module->name,
1551 strlen(schema->module->name), NULL, 0, NULL, LY_PREF_JSON, NULL, 0, &node), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001552 }
1553 break;
1554 case LYS_ANYDATA:
1555 case LYS_ANYXML:
Michal Vasko366a4a12020-12-04 16:23:57 +01001556 LY_CHECK_GOTO(ret = lyd_create_any(schema, value, value_type, 0, &node), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001557 break;
1558 default:
1559 LOGINT(ctx);
1560 ret = LY_EINT;
1561 goto cleanup;
1562 }
1563
1564 if (cur_parent) {
1565 /* connect to the parent */
1566 lyd_insert_node(cur_parent, NULL, node);
1567 } else if (parent) {
1568 /* connect to top-level siblings */
1569 lyd_insert_node(NULL, &parent, node);
1570 }
1571
Michal Vasko35880332020-12-08 13:08:12 +01001572next_iter:
Michal Vasko00cbf532020-06-15 13:58:47 +02001573 /* update remembered nodes */
1574 if (!nparent) {
1575 nparent = node;
1576 }
1577 nnode = node;
1578 }
1579
1580cleanup:
1581 lyxp_expr_free(ctx, exp);
Michal Vasko6741dc62021-02-04 09:27:45 +01001582 if (p) {
1583 while (orig_count > LY_ARRAY_COUNT(p)) {
1584 LY_ARRAY_INCREMENT(p);
1585 }
1586 }
Michal Vasko00cbf532020-06-15 13:58:47 +02001587 ly_path_free(ctx, p);
1588 if (!ret) {
1589 /* set out params only on success */
1590 if (new_parent) {
1591 *new_parent = nparent;
1592 }
1593 if (new_node) {
1594 *new_node = nnode;
1595 }
Michal Vaskof4b95ba2020-12-11 08:42:33 +01001596 } else {
1597 lyd_free_tree(nparent);
Michal Vasko00cbf532020-06-15 13:58:47 +02001598 }
1599 return ret;
1600}
1601
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001602LY_ERR
1603lyd_new_implicit_r(struct lyd_node *parent, struct lyd_node **first, const struct lysc_node *sparent,
Radek Krejci1deb5be2020-08-26 16:43:36 +02001604 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 +02001605 struct lyd_node **diff)
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001606{
1607 LY_ERR ret;
Michal Vaskod1e53b92021-01-28 13:11:06 +01001608 const struct lysc_node *iter = NULL;
Radek Krejci2b18bf12020-11-06 11:20:20 +01001609 struct lyd_node *node = NULL;
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001610 struct lyd_value **dflts;
1611 LY_ARRAY_COUNT_TYPE u;
Michal Vasko630d9892020-12-08 17:11:08 +01001612 uint32_t getnext_opts;
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001613
1614 assert(first && (parent || sparent || mod));
1615
1616 if (!sparent && parent) {
1617 sparent = parent->schema;
1618 }
1619
Michal Vasko630d9892020-12-08 17:11:08 +01001620 getnext_opts = LYS_GETNEXT_WITHCHOICE;
1621 if (impl_opts & LYD_IMPLICIT_OUTPUT) {
1622 getnext_opts |= LYS_GETNEXT_OUTPUT;
1623 }
1624
1625 while ((iter = lys_getnext(iter, sparent, mod ? mod->compiled : NULL, getnext_opts))) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001626 if ((impl_opts & LYD_IMPLICIT_NO_STATE) && (iter->flags & LYS_CONFIG_R)) {
1627 continue;
Michal Vasko44b19a12020-08-07 09:21:30 +02001628 } else if ((impl_opts & LYD_IMPLICIT_NO_CONFIG) && (iter->flags & LYS_CONFIG_W)) {
1629 continue;
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001630 }
1631
1632 switch (iter->nodetype) {
1633 case LYS_CHOICE:
Michal Vaskobcf4d7d2020-11-18 18:16:49 +01001634 node = lys_getnext_data(NULL, *first, NULL, iter, NULL);
1635 if (!node && ((struct lysc_node_choice *)iter)->dflt) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001636 /* create default case data */
Michal Vasko14ed9cd2021-01-28 14:16:25 +01001637 LY_CHECK_RET(lyd_new_implicit_r(parent, first, &((struct lysc_node_choice *)iter)->dflt->node,
Michal Vasko69730152020-10-09 16:30:07 +02001638 NULL, node_types, node_when, impl_opts, diff));
Michal Vaskobcf4d7d2020-11-18 18:16:49 +01001639 } else if (node) {
1640 /* create any default data in the existing case */
1641 assert(node->schema->parent->nodetype == LYS_CASE);
1642 LY_CHECK_RET(lyd_new_implicit_r(parent, first, node->schema->parent, NULL, node_types, node_when,
1643 impl_opts, diff));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001644 }
1645 break;
1646 case LYS_CONTAINER:
1647 if (!(iter->flags & LYS_PRESENCE) && lyd_find_sibling_val(*first, iter, NULL, 0, NULL)) {
1648 /* create default NP container */
1649 LY_CHECK_RET(lyd_create_inner(iter, &node));
Radek Krejci9a3823e2021-01-27 20:26:46 +01001650 node->flags = LYD_DEFAULT | (lysc_node_when(node->schema) ? LYD_WHEN_TRUE : 0);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001651 lyd_insert_node(parent, first, node);
1652
1653 /* cannot be a NP container with when */
Radek Krejci9a3823e2021-01-27 20:26:46 +01001654 assert(!lysc_node_when(iter));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001655
Michal Vaskoe49b6322020-11-05 17:38:36 +01001656 if (diff) {
1657 /* add into diff */
1658 LY_CHECK_RET(lyd_val_diff_add(node, LYD_DIFF_OP_CREATE, diff));
1659 }
1660
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001661 /* create any default children */
Michal Vaskoe0665742021-02-11 11:08:44 +01001662 LY_CHECK_RET(lyd_new_implicit_r(node, lyd_node_child_p(node), NULL, NULL, node_types, node_when,
Michal Vasko69730152020-10-09 16:30:07 +02001663 impl_opts, diff));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001664 }
1665 break;
1666 case LYS_LEAF:
Michal Vasko69730152020-10-09 16:30:07 +02001667 if (!(impl_opts & LYD_IMPLICIT_NO_DEFAULTS) && ((struct lysc_node_leaf *)iter)->dflt &&
1668 lyd_find_sibling_val(*first, iter, NULL, 0, NULL)) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001669 /* create default leaf */
1670 ret = lyd_create_term2(iter, ((struct lysc_node_leaf *)iter)->dflt, &node);
1671 if (ret == LY_EINCOMPLETE) {
1672 if (node_types) {
1673 /* remember to resolve type */
Radek Krejci3d92e442020-10-12 12:48:13 +02001674 LY_CHECK_RET(ly_set_add(node_types, node, 1, NULL));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001675 }
1676 } else if (ret) {
1677 return ret;
1678 }
Radek Krejci9a3823e2021-01-27 20:26:46 +01001679 node->flags = LYD_DEFAULT | (lysc_node_when(node->schema) ? LYD_WHEN_TRUE : 0);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001680 lyd_insert_node(parent, first, node);
1681
Radek Krejci9a3823e2021-01-27 20:26:46 +01001682 if (lysc_node_when(iter) && node_when) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001683 /* remember to resolve when */
Radek Krejci3d92e442020-10-12 12:48:13 +02001684 LY_CHECK_RET(ly_set_add(node_when, node, 1, NULL));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001685 }
1686 if (diff) {
1687 /* add into diff */
1688 LY_CHECK_RET(lyd_val_diff_add(node, LYD_DIFF_OP_CREATE, diff));
1689 }
1690 }
1691 break;
1692 case LYS_LEAFLIST:
Michal Vasko69730152020-10-09 16:30:07 +02001693 if (!(impl_opts & LYD_IMPLICIT_NO_DEFAULTS) && ((struct lysc_node_leaflist *)iter)->dflts &&
1694 lyd_find_sibling_val(*first, iter, NULL, 0, NULL)) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001695 /* create all default leaf-lists */
1696 dflts = ((struct lysc_node_leaflist *)iter)->dflts;
1697 LY_ARRAY_FOR(dflts, u) {
1698 ret = lyd_create_term2(iter, dflts[u], &node);
1699 if (ret == LY_EINCOMPLETE) {
1700 if (node_types) {
1701 /* remember to resolve type */
Radek Krejci3d92e442020-10-12 12:48:13 +02001702 LY_CHECK_RET(ly_set_add(node_types, node, 1, NULL));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001703 }
1704 } else if (ret) {
1705 return ret;
1706 }
Radek Krejci9a3823e2021-01-27 20:26:46 +01001707 node->flags = LYD_DEFAULT | (lysc_node_when(node->schema) ? LYD_WHEN_TRUE : 0);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001708 lyd_insert_node(parent, first, node);
1709
Radek Krejci9a3823e2021-01-27 20:26:46 +01001710 if (lysc_node_when(iter) && node_when) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001711 /* remember to resolve when */
Radek Krejci3d92e442020-10-12 12:48:13 +02001712 LY_CHECK_RET(ly_set_add(node_when, node, 1, NULL));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001713 }
1714 if (diff) {
1715 /* add into diff */
1716 LY_CHECK_RET(lyd_val_diff_add(node, LYD_DIFF_OP_CREATE, diff));
1717 }
1718 }
1719 }
1720 break;
1721 default:
1722 /* without defaults */
1723 break;
1724 }
1725 }
1726
1727 return LY_SUCCESS;
1728}
1729
1730API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02001731lyd_new_implicit_tree(struct lyd_node *tree, uint32_t implicit_options, struct lyd_node **diff)
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001732{
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001733 LY_ERR ret = LY_SUCCESS;
Michal Vasko3488ada2020-12-03 14:18:19 +01001734 struct lyd_node *node;
1735 struct ly_set node_when = {0};
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001736
1737 LY_CHECK_ARG_RET(NULL, tree, LY_EINVAL);
1738 if (diff) {
1739 *diff = NULL;
1740 }
1741
Michal Vasko56daf732020-08-10 10:57:18 +02001742 LYD_TREE_DFS_BEGIN(tree, node) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001743 /* skip added default nodes */
Michal Vasko69730152020-10-09 16:30:07 +02001744 if (((node->flags & (LYD_DEFAULT | LYD_NEW)) != (LYD_DEFAULT | LYD_NEW)) &&
1745 (node->schema->nodetype & LYD_NODE_INNER)) {
Michal Vaskoe0665742021-02-11 11:08:44 +01001746 LY_CHECK_GOTO(ret = lyd_new_implicit_r(node, lyd_node_child_p(node), NULL, NULL, NULL,
Michal Vasko3488ada2020-12-03 14:18:19 +01001747 &node_when, implicit_options, diff), cleanup);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001748 }
1749
Michal Vasko56daf732020-08-10 10:57:18 +02001750 LYD_TREE_DFS_END(tree, node);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001751 }
1752
Michal Vasko3488ada2020-12-03 14:18:19 +01001753 /* resolve when and remove any invalid defaults */
Michal Vaskod3bb12f2020-12-04 14:33:09 +01001754 LY_CHECK_GOTO(ret = lyd_validate_unres(&tree, NULL, &node_when, NULL, NULL, diff), cleanup);
Michal Vasko3488ada2020-12-03 14:18:19 +01001755
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001756cleanup:
Michal Vasko3488ada2020-12-03 14:18:19 +01001757 ly_set_erase(&node_when, NULL);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001758 if (ret && diff) {
1759 lyd_free_all(*diff);
1760 *diff = NULL;
1761 }
1762 return ret;
1763}
1764
1765API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02001766lyd_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 +02001767{
1768 const struct lys_module *mod;
1769 struct lyd_node *d = NULL;
1770 uint32_t i = 0;
1771 LY_ERR ret = LY_SUCCESS;
1772
1773 LY_CHECK_ARG_RET(ctx, tree, *tree || ctx, LY_EINVAL);
1774 if (diff) {
1775 *diff = NULL;
1776 }
1777 if (!ctx) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001778 ctx = LYD_CTX(*tree);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001779 }
1780
1781 /* add nodes for each module one-by-one */
1782 while ((mod = ly_ctx_get_module_iter(ctx, &i))) {
1783 if (!mod->implemented) {
1784 continue;
1785 }
1786
1787 LY_CHECK_GOTO(ret = lyd_new_implicit_module(tree, mod, implicit_options, diff ? &d : NULL), cleanup);
1788 if (d) {
1789 /* merge into one diff */
1790 lyd_insert_sibling(*diff, d, diff);
1791
1792 d = NULL;
1793 }
1794 }
1795
1796cleanup:
1797 if (ret && diff) {
1798 lyd_free_all(*diff);
1799 *diff = NULL;
1800 }
1801 return ret;
1802}
1803
1804API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02001805lyd_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 +02001806{
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001807 LY_ERR ret = LY_SUCCESS;
Michal Vasko3488ada2020-12-03 14:18:19 +01001808 struct lyd_node *root, *d = NULL;
1809 struct ly_set node_when = {0};
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001810
1811 LY_CHECK_ARG_RET(NULL, tree, module, LY_EINVAL);
1812 if (diff) {
1813 *diff = NULL;
1814 }
1815
1816 /* add all top-level defaults for this module */
Michal Vasko3488ada2020-12-03 14:18:19 +01001817 LY_CHECK_GOTO(ret = lyd_new_implicit_r(NULL, tree, NULL, module, NULL, &node_when, implicit_options, diff), cleanup);
1818
1819 /* resolve when and remove any invalid defaults */
Michal Vaskod3bb12f2020-12-04 14:33:09 +01001820 LY_CHECK_GOTO(ret = lyd_validate_unres(tree, module, &node_when, NULL, NULL, diff), cleanup);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001821
1822 /* process nested nodes */
1823 LY_LIST_FOR(*tree, root) {
1824 /* skip added default nodes */
1825 if ((root->flags & (LYD_DEFAULT | LYD_NEW)) != (LYD_DEFAULT | LYD_NEW)) {
1826 LY_CHECK_GOTO(ret = lyd_new_implicit_tree(root, implicit_options, diff ? &d : NULL), cleanup);
1827
1828 if (d) {
1829 /* merge into one diff */
1830 lyd_insert_sibling(*diff, d, diff);
1831
1832 d = NULL;
1833 }
1834 }
1835 }
1836
1837cleanup:
Michal Vasko3488ada2020-12-03 14:18:19 +01001838 ly_set_erase(&node_when, NULL);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001839 if (ret && diff) {
1840 lyd_free_all(*diff);
1841 *diff = NULL;
1842 }
1843 return ret;
1844}
1845
Michal Vasko90932a92020-02-12 14:33:03 +01001846struct lyd_node *
Michal Vaskob104f112020-07-17 09:54:54 +02001847lyd_insert_get_next_anchor(const struct lyd_node *first_sibling, const struct lyd_node *new_node)
Michal Vasko90932a92020-02-12 14:33:03 +01001848{
Michal Vaskob104f112020-07-17 09:54:54 +02001849 const struct lysc_node *schema, *sparent;
Michal Vasko90932a92020-02-12 14:33:03 +01001850 struct lyd_node *match = NULL;
Radek Krejci857189e2020-09-01 13:26:36 +02001851 ly_bool found;
Michal Vasko93b16062020-12-09 18:14:18 +01001852 uint32_t getnext_opts;
Michal Vasko90932a92020-02-12 14:33:03 +01001853
Michal Vaskob104f112020-07-17 09:54:54 +02001854 assert(new_node);
1855
1856 if (!first_sibling || !new_node->schema) {
1857 /* insert at the end, no next anchor */
Michal Vasko90932a92020-02-12 14:33:03 +01001858 return NULL;
1859 }
1860
Michal Vasko93b16062020-12-09 18:14:18 +01001861 getnext_opts = 0;
Michal Vaskod1e53b92021-01-28 13:11:06 +01001862 if (new_node->schema->flags & LYS_IS_OUTPUT) {
Michal Vasko93b16062020-12-09 18:14:18 +01001863 getnext_opts = LYS_GETNEXT_OUTPUT;
1864 }
1865
Michal Vaskob104f112020-07-17 09:54:54 +02001866 if (first_sibling->parent && first_sibling->parent->children_ht) {
1867 /* find the anchor using hashes */
1868 sparent = first_sibling->parent->schema;
Michal Vasko93b16062020-12-09 18:14:18 +01001869 schema = lys_getnext(new_node->schema, sparent, NULL, getnext_opts);
Michal Vaskob104f112020-07-17 09:54:54 +02001870 while (schema) {
1871 /* keep trying to find the first existing instance of the closest following schema sibling,
1872 * otherwise return NULL - inserting at the end */
1873 if (!lyd_find_sibling_schema(first_sibling, schema, &match)) {
1874 break;
1875 }
1876
Michal Vasko93b16062020-12-09 18:14:18 +01001877 schema = lys_getnext(schema, sparent, NULL, getnext_opts);
Michal Vaskob104f112020-07-17 09:54:54 +02001878 }
1879 } else {
1880 /* find the anchor without hashes */
1881 match = (struct lyd_node *)first_sibling;
1882 if (!lysc_data_parent(new_node->schema)) {
1883 /* we are in top-level, skip all the data from preceding modules */
1884 LY_LIST_FOR(match, match) {
1885 if (!match->schema || (strcmp(lyd_owner_module(match)->name, lyd_owner_module(new_node)->name) >= 0)) {
1886 break;
1887 }
1888 }
1889 }
1890
1891 /* get the first schema sibling */
1892 sparent = lysc_data_parent(new_node->schema);
Michal Vasko93b16062020-12-09 18:14:18 +01001893 schema = lys_getnext(NULL, sparent, new_node->schema->module->compiled, getnext_opts);
Michal Vaskob104f112020-07-17 09:54:54 +02001894
1895 found = 0;
1896 LY_LIST_FOR(match, match) {
1897 if (!match->schema || (lyd_owner_module(match) != lyd_owner_module(new_node))) {
1898 /* we have found an opaque node, which must be at the end, so use it OR
1899 * modules do not match, so we must have traversed all the data from new_node module (if any),
1900 * we have found the first node of the next module, that is what we want */
1901 break;
1902 }
1903
1904 /* skip schema nodes until we find the instantiated one */
1905 while (!found) {
1906 if (new_node->schema == schema) {
1907 /* we have found the schema of the new node, continue search to find the first
1908 * data node with a different schema (after our schema) */
1909 found = 1;
1910 break;
1911 }
1912 if (match->schema == schema) {
1913 /* current node (match) is a data node still before the new node, continue search in data */
1914 break;
1915 }
Michal Vasko93b16062020-12-09 18:14:18 +01001916 schema = lys_getnext(schema, sparent, new_node->schema->module->compiled, getnext_opts);
Michal Vaskob104f112020-07-17 09:54:54 +02001917 assert(schema);
1918 }
1919
1920 if (found && (match->schema != new_node->schema)) {
1921 /* find the next node after we have found our node schema data instance */
1922 break;
1923 }
1924 }
Michal Vasko90932a92020-02-12 14:33:03 +01001925 }
1926
1927 return match;
1928}
1929
1930/**
1931 * @brief Insert node after a sibling.
1932 *
Michal Vasko9f96a052020-03-10 09:41:45 +01001933 * Handles inserting into NP containers and key-less lists.
1934 *
Michal Vasko90932a92020-02-12 14:33:03 +01001935 * @param[in] sibling Sibling to insert after.
1936 * @param[in] node Node to insert.
1937 */
1938static void
Michal Vaskof03ed032020-03-04 13:31:44 +01001939lyd_insert_after_node(struct lyd_node *sibling, struct lyd_node *node)
Michal Vasko90932a92020-02-12 14:33:03 +01001940{
Michal Vasko0249f7c2020-03-05 16:36:40 +01001941 struct lyd_node_inner *par;
1942
Michal Vasko90932a92020-02-12 14:33:03 +01001943 assert(!node->next && (node->prev == node));
1944
1945 node->next = sibling->next;
1946 node->prev = sibling;
1947 sibling->next = node;
1948 if (node->next) {
1949 /* sibling had a succeeding node */
1950 node->next->prev = node;
1951 } else {
1952 /* sibling was last, find first sibling and change its prev */
1953 if (sibling->parent) {
1954 sibling = sibling->parent->child;
1955 } else {
Michal Vaskod989ba02020-08-24 10:59:24 +02001956 for ( ; sibling->prev->next != node; sibling = sibling->prev) {}
Michal Vasko90932a92020-02-12 14:33:03 +01001957 }
1958 sibling->prev = node;
1959 }
1960 node->parent = sibling->parent;
Michal Vasko0249f7c2020-03-05 16:36:40 +01001961
Michal Vasko9f96a052020-03-10 09:41:45 +01001962 for (par = node->parent; par; par = par->parent) {
1963 if ((par->flags & LYD_DEFAULT) && !(node->flags & LYD_DEFAULT)) {
1964 /* remove default flags from NP containers */
Michal Vasko0249f7c2020-03-05 16:36:40 +01001965 par->flags &= ~LYD_DEFAULT;
1966 }
Michal Vaskob104f112020-07-17 09:54:54 +02001967 if (par->schema && (par->schema->nodetype == LYS_LIST) && (par->schema->flags & LYS_KEYLESS)) {
Michal Vasko9f96a052020-03-10 09:41:45 +01001968 /* rehash key-less list */
Michal Vasko9e685082021-01-29 14:49:09 +01001969 lyd_hash(&par->node);
Michal Vasko9f96a052020-03-10 09:41:45 +01001970 }
Michal Vasko0249f7c2020-03-05 16:36:40 +01001971 }
Michal Vasko90932a92020-02-12 14:33:03 +01001972}
1973
1974/**
1975 * @brief Insert node before a sibling.
1976 *
Michal Vasko9f96a052020-03-10 09:41:45 +01001977 * Handles inserting into NP containers and key-less lists.
1978 *
Michal Vasko90932a92020-02-12 14:33:03 +01001979 * @param[in] sibling Sibling to insert before.
1980 * @param[in] node Node to insert.
1981 */
1982static void
Michal Vaskof03ed032020-03-04 13:31:44 +01001983lyd_insert_before_node(struct lyd_node *sibling, struct lyd_node *node)
Michal Vasko90932a92020-02-12 14:33:03 +01001984{
Michal Vasko0249f7c2020-03-05 16:36:40 +01001985 struct lyd_node_inner *par;
1986
Michal Vasko90932a92020-02-12 14:33:03 +01001987 assert(!node->next && (node->prev == node));
1988
1989 node->next = sibling;
1990 /* covers situation of sibling being first */
1991 node->prev = sibling->prev;
1992 sibling->prev = node;
1993 if (node->prev->next) {
1994 /* sibling had a preceding node */
1995 node->prev->next = node;
1996 } else if (sibling->parent) {
1997 /* sibling was first and we must also change parent child pointer */
1998 sibling->parent->child = node;
1999 }
2000 node->parent = sibling->parent;
Michal Vasko0249f7c2020-03-05 16:36:40 +01002001
Michal Vasko9f96a052020-03-10 09:41:45 +01002002 for (par = node->parent; par; par = par->parent) {
2003 if ((par->flags & LYD_DEFAULT) && !(node->flags & LYD_DEFAULT)) {
2004 /* remove default flags from NP containers */
Michal Vasko0249f7c2020-03-05 16:36:40 +01002005 par->flags &= ~LYD_DEFAULT;
2006 }
Michal Vaskob104f112020-07-17 09:54:54 +02002007 if (par->schema && (par->schema->nodetype == LYS_LIST) && (par->schema->flags & LYS_KEYLESS)) {
Michal Vasko9f96a052020-03-10 09:41:45 +01002008 /* rehash key-less list */
Michal Vasko9e685082021-01-29 14:49:09 +01002009 lyd_hash(&par->node);
Michal Vasko9f96a052020-03-10 09:41:45 +01002010 }
Michal Vasko0249f7c2020-03-05 16:36:40 +01002011 }
Michal Vasko90932a92020-02-12 14:33:03 +01002012}
2013
2014/**
Michal Vaskob104f112020-07-17 09:54:54 +02002015 * @brief Insert node as the first and only child of a parent.
Michal Vasko90932a92020-02-12 14:33:03 +01002016 *
Michal Vasko9f96a052020-03-10 09:41:45 +01002017 * Handles inserting into NP containers and key-less lists.
2018 *
Michal Vasko90932a92020-02-12 14:33:03 +01002019 * @param[in] parent Parent to insert into.
2020 * @param[in] node Node to insert.
2021 */
2022static void
Michal Vaskob104f112020-07-17 09:54:54 +02002023lyd_insert_only_child(struct lyd_node *parent, struct lyd_node *node)
Michal Vasko90932a92020-02-12 14:33:03 +01002024{
2025 struct lyd_node_inner *par;
2026
Radek Krejcia1c1e542020-09-29 16:06:52 +02002027 assert(parent && !lyd_child(parent) && !node->next && (node->prev == node));
Michal Vasko52927e22020-03-16 17:26:14 +01002028 assert(!parent->schema || (parent->schema->nodetype & LYD_NODE_INNER));
Michal Vasko90932a92020-02-12 14:33:03 +01002029
2030 par = (struct lyd_node_inner *)parent;
2031
Michal Vaskob104f112020-07-17 09:54:54 +02002032 par->child = node;
Michal Vasko90932a92020-02-12 14:33:03 +01002033 node->parent = par;
Michal Vasko0249f7c2020-03-05 16:36:40 +01002034
Michal Vaskod989ba02020-08-24 10:59:24 +02002035 for ( ; par; par = par->parent) {
Michal Vasko9f96a052020-03-10 09:41:45 +01002036 if ((par->flags & LYD_DEFAULT) && !(node->flags & LYD_DEFAULT)) {
2037 /* remove default flags from NP containers */
Michal Vasko0249f7c2020-03-05 16:36:40 +01002038 par->flags &= ~LYD_DEFAULT;
2039 }
Michal Vasko52927e22020-03-16 17:26:14 +01002040 if (par->schema && (par->schema->nodetype == LYS_LIST) && (par->schema->flags & LYS_KEYLESS)) {
Michal Vasko9f96a052020-03-10 09:41:45 +01002041 /* rehash key-less list */
Michal Vasko9e685082021-01-29 14:49:09 +01002042 lyd_hash(&par->node);
Michal Vasko9f96a052020-03-10 09:41:45 +01002043 }
Michal Vasko0249f7c2020-03-05 16:36:40 +01002044 }
Michal Vasko751cb4d2020-07-14 12:25:28 +02002045}
Michal Vasko0249f7c2020-03-05 16:36:40 +01002046
Michal Vasko751cb4d2020-07-14 12:25:28 +02002047/**
2048 * @brief Learn whether a list instance has all the keys.
2049 *
2050 * @param[in] list List instance to check.
2051 * @return non-zero if all the keys were found,
2052 * @return 0 otherwise.
2053 */
2054static int
2055lyd_insert_has_keys(const struct lyd_node *list)
2056{
2057 const struct lyd_node *key;
2058 const struct lysc_node *skey = NULL;
2059
2060 assert(list->schema->nodetype == LYS_LIST);
Radek Krejcia1c1e542020-09-29 16:06:52 +02002061 key = lyd_child(list);
Michal Vasko751cb4d2020-07-14 12:25:28 +02002062 while ((skey = lys_getnext(skey, list->schema, NULL, 0)) && (skey->flags & LYS_KEY)) {
2063 if (!key || (key->schema != skey)) {
2064 /* key missing */
2065 return 0;
2066 }
2067
2068 key = key->next;
2069 }
2070
2071 /* all keys found */
2072 return 1;
Michal Vasko90932a92020-02-12 14:33:03 +01002073}
2074
2075void
Michal Vaskob104f112020-07-17 09:54:54 +02002076lyd_insert_node(struct lyd_node *parent, struct lyd_node **first_sibling_p, struct lyd_node *node)
Michal Vasko90932a92020-02-12 14:33:03 +01002077{
Michal Vaskob104f112020-07-17 09:54:54 +02002078 struct lyd_node *anchor, *first_sibling;
Michal Vasko90932a92020-02-12 14:33:03 +01002079
Michal Vaskob104f112020-07-17 09:54:54 +02002080 /* inserting list without its keys is not supported */
2081 assert((parent || first_sibling_p) && node && (node->hash || !node->schema));
Michal Vaskof756c942020-11-06 17:21:37 +01002082 assert(!parent || !parent->schema ||
2083 (parent->schema->nodetype & (LYS_CONTAINER | LYS_LIST | LYS_RPC | LYS_ACTION | LYS_NOTIF)));
Michal Vasko9b368d32020-02-14 13:53:31 +01002084
Michal Vaskob104f112020-07-17 09:54:54 +02002085 if (!parent && first_sibling_p && (*first_sibling_p) && (*first_sibling_p)->parent) {
Michal Vasko9e685082021-01-29 14:49:09 +01002086 parent = lyd_parent(*first_sibling_p);
Michal Vasko9b368d32020-02-14 13:53:31 +01002087 }
Michal Vasko90932a92020-02-12 14:33:03 +01002088
Michal Vaskob104f112020-07-17 09:54:54 +02002089 /* get first sibling */
Michal Vasko9e685082021-01-29 14:49:09 +01002090 first_sibling = parent ? lyd_child(parent) : *first_sibling_p;
Michal Vasko9f96a052020-03-10 09:41:45 +01002091
Michal Vaskob104f112020-07-17 09:54:54 +02002092 /* find the anchor, our next node, so we can insert before it */
2093 anchor = lyd_insert_get_next_anchor(first_sibling, node);
2094 if (anchor) {
2095 lyd_insert_before_node(anchor, node);
Michal Vasko26123192020-11-09 21:02:34 +01002096 if (!parent && (*first_sibling_p == anchor)) {
2097 /* move first sibling */
2098 *first_sibling_p = node;
2099 }
Michal Vaskob104f112020-07-17 09:54:54 +02002100 } else if (first_sibling) {
2101 lyd_insert_after_node(first_sibling->prev, node);
2102 } else if (parent) {
2103 lyd_insert_only_child(parent, node);
Michal Vasko90932a92020-02-12 14:33:03 +01002104 } else {
Michal Vaskob104f112020-07-17 09:54:54 +02002105 *first_sibling_p = node;
2106 }
2107
2108 /* insert into parent HT */
2109 lyd_insert_hash(node);
2110
2111 /* finish hashes for our parent, if needed and possible */
Michal Vasko9e8de2d2020-09-01 08:17:10 +02002112 if (node->schema && (node->schema->flags & LYS_KEY) && parent && lyd_insert_has_keys(parent)) {
Michal Vaskob104f112020-07-17 09:54:54 +02002113 lyd_hash(parent);
2114
2115 /* now we can insert even the list into its parent HT */
2116 lyd_insert_hash(parent);
Michal Vasko90932a92020-02-12 14:33:03 +01002117 }
Michal Vasko90932a92020-02-12 14:33:03 +01002118}
2119
Michal Vasko717a4c32020-12-07 09:40:10 +01002120/**
2121 * @brief Check schema place of a node to be inserted.
2122 *
2123 * @param[in] parent Schema node of the parent data node.
2124 * @param[in] sibling Schema node of a sibling data node.
2125 * @param[in] schema Schema node if the data node to be inserted.
2126 * @return LY_SUCCESS on success.
2127 * @return LY_EINVAL if the place is invalid.
2128 */
Michal Vaskof03ed032020-03-04 13:31:44 +01002129static LY_ERR
Michal Vasko717a4c32020-12-07 09:40:10 +01002130lyd_insert_check_schema(const struct lysc_node *parent, const struct lysc_node *sibling, const struct lysc_node *schema)
Michal Vaskof03ed032020-03-04 13:31:44 +01002131{
2132 const struct lysc_node *par2;
2133
Michal Vasko62ed12d2020-05-21 10:08:25 +02002134 assert(!parent || !(parent->nodetype & (LYS_CASE | LYS_CHOICE)));
Michal Vasko717a4c32020-12-07 09:40:10 +01002135 assert(!sibling || !(sibling->nodetype & (LYS_CASE | LYS_CHOICE)));
2136 assert(!schema || !(schema->nodetype & (LYS_CASE | LYS_CHOICE)));
Michal Vaskof03ed032020-03-04 13:31:44 +01002137
Michal Vasko717a4c32020-12-07 09:40:10 +01002138 if (!schema || (!parent && !sibling)) {
Michal Vasko71e795e2020-12-04 16:27:37 +01002139 /* opaque nodes can be inserted wherever */
2140 return LY_SUCCESS;
2141 }
2142
Michal Vasko717a4c32020-12-07 09:40:10 +01002143 if (!parent) {
2144 parent = lysc_data_parent(sibling);
2145 }
2146
Michal Vaskof03ed032020-03-04 13:31:44 +01002147 /* find schema parent */
Michal Vasko62ed12d2020-05-21 10:08:25 +02002148 par2 = lysc_data_parent(schema);
Michal Vaskof03ed032020-03-04 13:31:44 +01002149
2150 if (parent) {
2151 /* inner node */
2152 if (par2 != parent) {
Michal Vaskob104f112020-07-17 09:54:54 +02002153 LOGERR(schema->module->ctx, LY_EINVAL, "Cannot insert, parent of \"%s\" is not \"%s\".", schema->name,
Michal Vasko69730152020-10-09 16:30:07 +02002154 parent->name);
Michal Vaskof03ed032020-03-04 13:31:44 +01002155 return LY_EINVAL;
2156 }
2157 } else {
2158 /* top-level node */
2159 if (par2) {
Radek Krejcif6d14cb2020-07-02 16:11:45 +02002160 LOGERR(schema->module->ctx, LY_EINVAL, "Cannot insert, node \"%s\" is not top-level.", schema->name);
Michal Vaskof03ed032020-03-04 13:31:44 +01002161 return LY_EINVAL;
2162 }
2163 }
2164
2165 return LY_SUCCESS;
2166}
2167
2168API LY_ERR
Michal Vaskob104f112020-07-17 09:54:54 +02002169lyd_insert_child(struct lyd_node *parent, struct lyd_node *node)
Michal Vaskof03ed032020-03-04 13:31:44 +01002170{
2171 struct lyd_node *iter;
2172
Michal Vasko654bc852020-06-23 13:28:06 +02002173 LY_CHECK_ARG_RET(NULL, parent, node, parent->schema->nodetype & LYD_NODE_INNER, LY_EINVAL);
Michal Vaskof03ed032020-03-04 13:31:44 +01002174
Michal Vasko717a4c32020-12-07 09:40:10 +01002175 LY_CHECK_RET(lyd_insert_check_schema(parent->schema, NULL, node->schema));
Michal Vaskof03ed032020-03-04 13:31:44 +01002176
2177 if (node->schema->flags & LYS_KEY) {
2178 LOGERR(parent->schema->module->ctx, LY_EINVAL, "Cannot insert key \"%s\".", node->schema->name);
2179 return LY_EINVAL;
2180 }
2181
2182 if (node->parent || node->prev->next) {
2183 lyd_unlink_tree(node);
2184 }
2185
2186 while (node) {
2187 iter = node->next;
2188 lyd_unlink_tree(node);
2189 lyd_insert_node(parent, NULL, node);
2190 node = iter;
2191 }
2192 return LY_SUCCESS;
2193}
2194
2195API LY_ERR
Michal Vaskob104f112020-07-17 09:54:54 +02002196lyd_insert_sibling(struct lyd_node *sibling, struct lyd_node *node, struct lyd_node **first)
Michal Vaskob1b5c262020-03-05 14:29:47 +01002197{
2198 struct lyd_node *iter;
2199
Michal Vaskob104f112020-07-17 09:54:54 +02002200 LY_CHECK_ARG_RET(NULL, node, LY_EINVAL);
Michal Vaskob1b5c262020-03-05 14:29:47 +01002201
Michal Vaskob104f112020-07-17 09:54:54 +02002202 if (sibling) {
Michal Vasko717a4c32020-12-07 09:40:10 +01002203 LY_CHECK_RET(lyd_insert_check_schema(NULL, sibling->schema, node->schema));
Michal Vaskob1b5c262020-03-05 14:29:47 +01002204 }
2205
Michal Vasko553d0b52020-12-04 16:27:52 +01002206 if (sibling == node) {
2207 /* we need to keep the connection to siblings so we can insert into them */
2208 sibling = sibling->prev;
2209 }
2210
Michal Vaskob1b5c262020-03-05 14:29:47 +01002211 if (node->parent || node->prev->next) {
2212 lyd_unlink_tree(node);
2213 }
2214
2215 while (node) {
Michal Vasko71e795e2020-12-04 16:27:37 +01002216 if (lysc_is_key(node->schema)) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02002217 LOGERR(LYD_CTX(node), LY_EINVAL, "Cannot insert key \"%s\".", node->schema->name);
Michal Vaskob104f112020-07-17 09:54:54 +02002218 return LY_EINVAL;
2219 }
2220
Michal Vaskob1b5c262020-03-05 14:29:47 +01002221 iter = node->next;
2222 lyd_unlink_tree(node);
2223 lyd_insert_node(NULL, &sibling, node);
2224 node = iter;
2225 }
Michal Vaskob1b5c262020-03-05 14:29:47 +01002226
Michal Vaskob104f112020-07-17 09:54:54 +02002227 if (first) {
2228 /* find the first sibling */
2229 *first = sibling;
2230 while ((*first)->prev->next) {
2231 *first = (*first)->prev;
Michal Vasko0249f7c2020-03-05 16:36:40 +01002232 }
2233 }
2234
2235 return LY_SUCCESS;
2236}
2237
Michal Vaskob1b5c262020-03-05 14:29:47 +01002238API LY_ERR
Michal Vaskof03ed032020-03-04 13:31:44 +01002239lyd_insert_before(struct lyd_node *sibling, struct lyd_node *node)
2240{
Michal Vaskof03ed032020-03-04 13:31:44 +01002241 LY_CHECK_ARG_RET(NULL, sibling, node, LY_EINVAL);
2242
Michal Vasko717a4c32020-12-07 09:40:10 +01002243 LY_CHECK_RET(lyd_insert_check_schema(NULL, sibling->schema, node->schema));
Michal Vaskof03ed032020-03-04 13:31:44 +01002244
Michal Vaskob104f112020-07-17 09:54:54 +02002245 if (!(node->schema->nodetype & (LYS_LIST | LYS_LEAFLIST)) || !(node->schema->flags & LYS_ORDBY_USER)) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02002246 LOGERR(LYD_CTX(sibling), LY_EINVAL, "Can be used only for user-ordered nodes.");
Michal Vaskof03ed032020-03-04 13:31:44 +01002247 return LY_EINVAL;
2248 }
2249
Michal Vasko4bc2ce32020-12-08 10:06:16 +01002250 lyd_unlink_tree(node);
2251 lyd_insert_before_node(sibling, node);
2252 lyd_insert_hash(node);
Michal Vaskof03ed032020-03-04 13:31:44 +01002253
Michal Vaskof03ed032020-03-04 13:31:44 +01002254 return LY_SUCCESS;
2255}
2256
2257API LY_ERR
2258lyd_insert_after(struct lyd_node *sibling, struct lyd_node *node)
2259{
Michal Vaskof03ed032020-03-04 13:31:44 +01002260 LY_CHECK_ARG_RET(NULL, sibling, node, LY_EINVAL);
2261
Michal Vasko717a4c32020-12-07 09:40:10 +01002262 LY_CHECK_RET(lyd_insert_check_schema(NULL, sibling->schema, node->schema));
Michal Vaskof03ed032020-03-04 13:31:44 +01002263
Michal Vaskob104f112020-07-17 09:54:54 +02002264 if (!(node->schema->nodetype & (LYS_LIST | LYS_LEAFLIST)) || !(node->schema->flags & LYS_ORDBY_USER)) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02002265 LOGERR(LYD_CTX(sibling), LY_EINVAL, "Can be used only for user-ordered nodes.");
Michal Vaskof03ed032020-03-04 13:31:44 +01002266 return LY_EINVAL;
2267 }
2268
Michal Vasko4bc2ce32020-12-08 10:06:16 +01002269 lyd_unlink_tree(node);
2270 lyd_insert_after_node(sibling, node);
2271 lyd_insert_hash(node);
Michal Vaskof03ed032020-03-04 13:31:44 +01002272
Michal Vaskof03ed032020-03-04 13:31:44 +01002273 return LY_SUCCESS;
2274}
2275
2276API void
2277lyd_unlink_tree(struct lyd_node *node)
2278{
2279 struct lyd_node *iter;
2280
2281 if (!node) {
2282 return;
2283 }
2284
Michal Vaskob104f112020-07-17 09:54:54 +02002285 /* update hashes while still linked into the tree */
2286 lyd_unlink_hash(node);
2287
Michal Vaskof03ed032020-03-04 13:31:44 +01002288 /* unlink from siblings */
2289 if (node->prev->next) {
2290 node->prev->next = node->next;
2291 }
2292 if (node->next) {
2293 node->next->prev = node->prev;
2294 } else {
2295 /* unlinking the last node */
2296 if (node->parent) {
2297 iter = node->parent->child;
2298 } else {
2299 iter = node->prev;
2300 while (iter->prev != node) {
2301 iter = iter->prev;
2302 }
2303 }
2304 /* update the "last" pointer from the first node */
2305 iter->prev = node->prev;
2306 }
2307
2308 /* unlink from parent */
2309 if (node->parent) {
2310 if (node->parent->child == node) {
2311 /* the node is the first child */
2312 node->parent->child = node->next;
2313 }
2314
Michal Vaskoab49dbe2020-07-17 12:32:47 +02002315 /* check for NP container whether its last non-default node is not being unlinked */
Michal Vasko69730152020-10-09 16:30:07 +02002316 if (node->parent->schema && (node->parent->schema->nodetype == LYS_CONTAINER) &&
2317 !(node->parent->flags & LYD_DEFAULT) && !(node->parent->schema->flags & LYS_PRESENCE)) {
Michal Vaskoab49dbe2020-07-17 12:32:47 +02002318 LY_LIST_FOR(node->parent->child, iter) {
2319 if ((iter != node) && !(iter->flags & LYD_DEFAULT)) {
2320 break;
2321 }
2322 }
2323 if (!iter) {
2324 node->parent->flags |= LYD_DEFAULT;
2325 }
2326 }
2327
Michal Vaskof03ed032020-03-04 13:31:44 +01002328 /* check for keyless list and update its hash */
Michal Vasko9e685082021-01-29 14:49:09 +01002329 for (iter = lyd_parent(node); iter; iter = lyd_parent(iter)) {
Michal Vasko413c7f22020-05-05 12:34:06 +02002330 if (iter->schema && (iter->schema->flags & LYS_KEYLESS)) {
Michal Vaskof03ed032020-03-04 13:31:44 +01002331 lyd_hash(iter);
2332 }
2333 }
2334
2335 node->parent = NULL;
2336 }
2337
2338 node->next = NULL;
2339 node->prev = node;
2340}
2341
Michal Vaskoa5da3292020-08-12 13:10:50 +02002342void
Michal Vasko871a0252020-11-11 18:35:24 +01002343lyd_insert_meta(struct lyd_node *parent, struct lyd_meta *meta, ly_bool clear_dflt)
Radek Krejci1798aae2020-07-14 13:26:06 +02002344{
2345 struct lyd_meta *last, *iter;
2346
2347 assert(parent);
Michal Vaskoa5da3292020-08-12 13:10:50 +02002348
2349 if (!meta) {
2350 return;
2351 }
Radek Krejci1798aae2020-07-14 13:26:06 +02002352
2353 for (iter = meta; iter; iter = iter->next) {
2354 iter->parent = parent;
2355 }
2356
2357 /* insert as the last attribute */
2358 if (parent->meta) {
Radek Krejci1e008d22020-08-17 11:37:37 +02002359 for (last = parent->meta; last->next; last = last->next) {}
Radek Krejci1798aae2020-07-14 13:26:06 +02002360 last->next = meta;
2361 } else {
2362 parent->meta = meta;
2363 }
2364
2365 /* remove default flags from NP containers */
Michal Vasko871a0252020-11-11 18:35:24 +01002366 while (clear_dflt && parent && (parent->schema->nodetype == LYS_CONTAINER) && (parent->flags & LYD_DEFAULT)) {
Radek Krejci1798aae2020-07-14 13:26:06 +02002367 parent->flags &= ~LYD_DEFAULT;
Michal Vasko9e685082021-01-29 14:49:09 +01002368 parent = lyd_parent(parent);
Radek Krejci1798aae2020-07-14 13:26:06 +02002369 }
Radek Krejci1798aae2020-07-14 13:26:06 +02002370}
2371
2372LY_ERR
Michal Vasko9f96a052020-03-10 09:41:45 +01002373lyd_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 +02002374 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 +01002375 void *prefix_data, uint32_t hints, ly_bool clear_dflt, ly_bool *incomplete)
Michal Vasko90932a92020-02-12 14:33:03 +01002376{
Radek Krejci2efc45b2020-12-22 16:25:44 +01002377 LY_ERR ret = LY_SUCCESS;
Michal Vasko90932a92020-02-12 14:33:03 +01002378 struct lysc_ext_instance *ant = NULL;
Michal Vasko9f96a052020-03-10 09:41:45 +01002379 struct lyd_meta *mt, *last;
Michal Vaskofd69e1d2020-07-03 11:57:17 +02002380 LY_ARRAY_COUNT_TYPE u;
Michal Vasko90932a92020-02-12 14:33:03 +01002381
Michal Vasko9f96a052020-03-10 09:41:45 +01002382 assert((parent || meta) && mod);
Michal Vasko6f4cbb62020-02-28 11:15:47 +01002383
Radek Krejciddace2c2021-01-08 11:30:56 +01002384 LOG_LOCSET(parent ? parent->schema : NULL, parent, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +01002385
Radek Krejci7eb54ba2020-05-18 16:30:04 +02002386 LY_ARRAY_FOR(mod->compiled->exts, u) {
Michal Vasko69730152020-10-09 16:30:07 +02002387 if ((mod->compiled->exts[u].def->plugin == lyext_plugins_internal[LYEXT_PLUGIN_INTERNAL_ANNOTATION].plugin) &&
Radek Krejci7eb54ba2020-05-18 16:30:04 +02002388 !ly_strncmp(mod->compiled->exts[u].argument, name, name_len)) {
Michal Vasko90932a92020-02-12 14:33:03 +01002389 /* we have the annotation definition */
Radek Krejci7eb54ba2020-05-18 16:30:04 +02002390 ant = &mod->compiled->exts[u];
Michal Vasko90932a92020-02-12 14:33:03 +01002391 break;
2392 }
2393 }
2394 if (!ant) {
2395 /* attribute is not defined as a metadata annotation (RFC 7952) */
Radek Krejci2efc45b2020-12-22 16:25:44 +01002396 LOGVAL(mod->ctx, LYVE_REFERENCE, "Annotation definition for attribute \"%s:%.*s\" not found.",
Michal Vasko90932a92020-02-12 14:33:03 +01002397 mod->name, name_len, name);
Radek Krejci2efc45b2020-12-22 16:25:44 +01002398 ret = LY_EINVAL;
2399 goto cleanup;
Michal Vasko90932a92020-02-12 14:33:03 +01002400 }
2401
Michal Vasko9f96a052020-03-10 09:41:45 +01002402 mt = calloc(1, sizeof *mt);
Radek Krejci2efc45b2020-12-22 16:25:44 +01002403 LY_CHECK_ERR_GOTO(!mt, LOGMEM(mod->ctx); ret = LY_EMEM, cleanup);
Michal Vasko9f96a052020-03-10 09:41:45 +01002404 mt->parent = parent;
2405 mt->annotation = ant;
Radek Krejci2efc45b2020-12-22 16:25:44 +01002406 ret = lyd_value_store(mod->ctx, &mt->value, ((struct lyext_metadata *)ant->data)->type, value, value_len, dynamic,
2407 format, prefix_data, hints, parent ? parent->schema : NULL, incomplete);
2408 LY_CHECK_ERR_GOTO(ret, free(mt), cleanup);
2409 ret = lydict_insert(mod->ctx, name, name_len, &mt->name);
2410 LY_CHECK_ERR_GOTO(ret, free(mt), cleanup);
Michal Vasko90932a92020-02-12 14:33:03 +01002411
Michal Vasko6f4cbb62020-02-28 11:15:47 +01002412 /* insert as the last attribute */
2413 if (parent) {
Michal Vasko871a0252020-11-11 18:35:24 +01002414 lyd_insert_meta(parent, mt, clear_dflt);
Michal Vasko9f96a052020-03-10 09:41:45 +01002415 } else if (*meta) {
Radek Krejci1e008d22020-08-17 11:37:37 +02002416 for (last = *meta; last->next; last = last->next) {}
Michal Vasko9f96a052020-03-10 09:41:45 +01002417 last->next = mt;
Michal Vasko90932a92020-02-12 14:33:03 +01002418 }
2419
Michal Vasko9f96a052020-03-10 09:41:45 +01002420 if (meta) {
2421 *meta = mt;
Michal Vasko90932a92020-02-12 14:33:03 +01002422 }
Radek Krejci2efc45b2020-12-22 16:25:44 +01002423
2424cleanup:
Radek Krejciddace2c2021-01-08 11:30:56 +01002425 LOG_LOCBACK((parent && parent->schema) ? 1 : 0, parent ? 1 : 0, 0, 0);
Radek Krejci2efc45b2020-12-22 16:25:44 +01002426 return ret;
Michal Vasko90932a92020-02-12 14:33:03 +01002427}
2428
Michal Vaskoa5da3292020-08-12 13:10:50 +02002429void
2430lyd_insert_attr(struct lyd_node *parent, struct lyd_attr *attr)
2431{
2432 struct lyd_attr *last, *iter;
2433 struct lyd_node_opaq *opaq;
2434
2435 assert(parent && !parent->schema);
2436
2437 if (!attr) {
2438 return;
2439 }
2440
2441 opaq = (struct lyd_node_opaq *)parent;
2442 for (iter = attr; iter; iter = iter->next) {
2443 iter->parent = opaq;
2444 }
2445
2446 /* insert as the last attribute */
2447 if (opaq->attr) {
Radek Krejci1e008d22020-08-17 11:37:37 +02002448 for (last = opaq->attr; last->next; last = last->next) {}
Michal Vaskoa5da3292020-08-12 13:10:50 +02002449 last->next = attr;
2450 } else {
2451 opaq->attr = attr;
2452 }
2453}
2454
Michal Vasko52927e22020-03-16 17:26:14 +01002455LY_ERR
Michal Vaskofeca4fb2020-10-05 08:58:40 +02002456lyd_create_attr(struct lyd_node *parent, struct lyd_attr **attr, const struct ly_ctx *ctx, const char *name, size_t name_len,
Michal Vasko501af032020-11-11 20:27:44 +01002457 const char *prefix, size_t prefix_len, const char *module_key, size_t module_key_len, const char *value,
2458 size_t value_len, ly_bool *dynamic, LY_PREFIX_FORMAT format, void *val_prefix_data, uint32_t hints)
Michal Vasko52927e22020-03-16 17:26:14 +01002459{
Radek Krejci011e4aa2020-09-04 15:22:31 +02002460 LY_ERR ret = LY_SUCCESS;
Radek Krejci1798aae2020-07-14 13:26:06 +02002461 struct lyd_attr *at, *last;
Michal Vasko52927e22020-03-16 17:26:14 +01002462
2463 assert(ctx && (parent || attr) && (!parent || !parent->schema));
Michal Vaskofeca4fb2020-10-05 08:58:40 +02002464 assert(name && name_len && format);
Michal Vasko52927e22020-03-16 17:26:14 +01002465
2466 if (!value_len) {
2467 value = "";
2468 }
2469
2470 at = calloc(1, sizeof *at);
Michal Vasko6b5cb2a2020-11-11 19:11:21 +01002471 LY_CHECK_ERR_RET(!at, LOGMEM(ctx); ly_free_prefix_data(format, val_prefix_data), LY_EMEM);
Radek Krejcid46e46a2020-09-15 14:22:42 +02002472
Michal Vaskoad92b672020-11-12 13:11:31 +01002473 LY_CHECK_GOTO(ret = lydict_insert(ctx, name, name_len, &at->name.name), finish);
Michal Vasko501af032020-11-11 20:27:44 +01002474 if (prefix_len) {
Michal Vaskoad92b672020-11-12 13:11:31 +01002475 LY_CHECK_GOTO(ret = lydict_insert(ctx, prefix, prefix_len, &at->name.prefix), finish);
Michal Vasko501af032020-11-11 20:27:44 +01002476 }
2477 if (module_key_len) {
Michal Vaskoad92b672020-11-12 13:11:31 +01002478 LY_CHECK_GOTO(ret = lydict_insert(ctx, module_key, module_key_len, &at->name.module_ns), finish);
Michal Vasko501af032020-11-11 20:27:44 +01002479 }
2480
Michal Vasko52927e22020-03-16 17:26:14 +01002481 if (dynamic && *dynamic) {
Radek Krejci011e4aa2020-09-04 15:22:31 +02002482 ret = lydict_insert_zc(ctx, (char *)value, &at->value);
2483 LY_CHECK_GOTO(ret, finish);
Michal Vasko52927e22020-03-16 17:26:14 +01002484 *dynamic = 0;
2485 } else {
Radek Krejci011e4aa2020-09-04 15:22:31 +02002486 LY_CHECK_GOTO(ret = lydict_insert(ctx, value, value_len, &at->value), finish);
Michal Vasko52927e22020-03-16 17:26:14 +01002487 }
Michal Vasko501af032020-11-11 20:27:44 +01002488 at->format = format;
2489 at->val_prefix_data = val_prefix_data;
2490 at->hints = hints;
Michal Vasko52927e22020-03-16 17:26:14 +01002491
2492 /* insert as the last attribute */
2493 if (parent) {
Michal Vaskoa5da3292020-08-12 13:10:50 +02002494 lyd_insert_attr(parent, at);
Michal Vasko52927e22020-03-16 17:26:14 +01002495 } else if (*attr) {
Radek Krejci1e008d22020-08-17 11:37:37 +02002496 for (last = *attr; last->next; last = last->next) {}
Michal Vasko52927e22020-03-16 17:26:14 +01002497 last->next = at;
2498 }
2499
Radek Krejci011e4aa2020-09-04 15:22:31 +02002500finish:
2501 if (ret) {
2502 lyd_free_attr_single(ctx, at);
2503 } else if (attr) {
Michal Vasko52927e22020-03-16 17:26:14 +01002504 *attr = at;
2505 }
2506 return LY_SUCCESS;
2507}
2508
Radek Krejci084289f2019-07-09 17:35:30 +02002509API const struct lyd_node_term *
Michal Vasko004d3152020-06-11 19:59:22 +02002510lyd_target(const struct ly_path *path, const struct lyd_node *tree)
Radek Krejci084289f2019-07-09 17:35:30 +02002511{
Michal Vasko004d3152020-06-11 19:59:22 +02002512 struct lyd_node *target;
Radek Krejci084289f2019-07-09 17:35:30 +02002513
Michal Vasko004d3152020-06-11 19:59:22 +02002514 if (ly_path_eval(path, tree, &target)) {
2515 return NULL;
Radek Krejci084289f2019-07-09 17:35:30 +02002516 }
2517
Michal Vasko004d3152020-06-11 19:59:22 +02002518 return (struct lyd_node_term *)target;
Radek Krejci084289f2019-07-09 17:35:30 +02002519}
2520
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002521API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02002522lyd_compare_single(const struct lyd_node *node1, const struct lyd_node *node2, uint32_t options)
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002523{
2524 const struct lyd_node *iter1, *iter2;
2525 struct lyd_node_term *term1, *term2;
2526 struct lyd_node_any *any1, *any2;
Michal Vasko52927e22020-03-16 17:26:14 +01002527 struct lyd_node_opaq *opaq1, *opaq2;
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002528 size_t len1, len2;
Radek Krejci084289f2019-07-09 17:35:30 +02002529
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002530 if (!node1 || !node2) {
2531 if (node1 == node2) {
2532 return LY_SUCCESS;
2533 } else {
2534 return LY_ENOT;
2535 }
2536 }
2537
Michal Vaskob7be7a82020-08-20 09:09:04 +02002538 if ((LYD_CTX(node1) != LYD_CTX(node2)) || (node1->schema != node2->schema)) {
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002539 return LY_ENOT;
2540 }
2541
2542 if (node1->hash != node2->hash) {
2543 return LY_ENOT;
2544 }
Michal Vasko52927e22020-03-16 17:26:14 +01002545 /* 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 +02002546
Michal Vasko52927e22020-03-16 17:26:14 +01002547 if (!node1->schema) {
2548 opaq1 = (struct lyd_node_opaq *)node1;
2549 opaq2 = (struct lyd_node_opaq *)node2;
Michal Vaskoad92b672020-11-12 13:11:31 +01002550 if ((opaq1->name.name != opaq2->name.name) || (opaq1->format != opaq2->format) ||
2551 (opaq1->name.module_ns != opaq2->name.module_ns)) {
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002552 return LY_ENOT;
2553 }
Michal Vasko52927e22020-03-16 17:26:14 +01002554 switch (opaq1->format) {
Michal Vasko6b5cb2a2020-11-11 19:11:21 +01002555 case LY_PREF_XML:
2556 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 +01002557 return LY_ENOT;
2558 }
2559 break;
Michal Vasko6b5cb2a2020-11-11 19:11:21 +01002560 case LY_PREF_JSON:
Radek Krejci1798aae2020-07-14 13:26:06 +02002561 /* prefixes in JSON are unique, so it is not necessary to canonize the values */
2562 if (strcmp(opaq1->value, opaq2->value)) {
2563 return LY_ENOT;
2564 }
2565 break;
Michal Vasko6b5cb2a2020-11-11 19:11:21 +01002566 default:
Michal Vasko52927e22020-03-16 17:26:14 +01002567 /* not allowed */
Michal Vaskob7be7a82020-08-20 09:09:04 +02002568 LOGINT(LYD_CTX(node1));
Michal Vasko52927e22020-03-16 17:26:14 +01002569 return LY_EINT;
2570 }
2571 if (options & LYD_COMPARE_FULL_RECURSION) {
2572 iter1 = opaq1->child;
2573 iter2 = opaq2->child;
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002574 goto all_children_compare;
Michal Vasko52927e22020-03-16 17:26:14 +01002575 }
2576 return LY_SUCCESS;
2577 } else {
2578 switch (node1->schema->nodetype) {
2579 case LYS_LEAF:
2580 case LYS_LEAFLIST:
2581 if (options & LYD_COMPARE_DEFAULTS) {
2582 if ((node1->flags & LYD_DEFAULT) != (node2->flags & LYD_DEFAULT)) {
2583 return LY_ENOT;
2584 }
2585 }
2586
Michal Vasko1a2bf2e2020-06-16 13:07:48 +02002587 term1 = (struct lyd_node_term *)node1;
2588 term2 = (struct lyd_node_term *)node2;
Michal Vasko1a2bf2e2020-06-16 13:07:48 +02002589 return term1->value.realtype->plugin->compare(&term1->value, &term2->value);
Michal Vasko52927e22020-03-16 17:26:14 +01002590 case LYS_CONTAINER:
2591 if (options & LYD_COMPARE_DEFAULTS) {
2592 if ((node1->flags & LYD_DEFAULT) != (node2->flags & LYD_DEFAULT)) {
2593 return LY_ENOT;
2594 }
2595 }
2596 if (options & LYD_COMPARE_FULL_RECURSION) {
Michal Vasko9e685082021-01-29 14:49:09 +01002597 iter1 = lyd_child(node1);
2598 iter2 = lyd_child(node2);
Michal Vasko52927e22020-03-16 17:26:14 +01002599 goto all_children_compare;
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002600 }
2601 return LY_SUCCESS;
Michal Vasko1bf09392020-03-27 12:38:10 +01002602 case LYS_RPC:
Michal Vasko52927e22020-03-16 17:26:14 +01002603 case LYS_ACTION:
2604 if (options & LYD_COMPARE_FULL_RECURSION) {
2605 /* TODO action/RPC
2606 goto all_children_compare;
2607 */
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002608 }
2609 return LY_SUCCESS;
Michal Vasko52927e22020-03-16 17:26:14 +01002610 case LYS_NOTIF:
2611 if (options & LYD_COMPARE_FULL_RECURSION) {
2612 /* TODO Notification
2613 goto all_children_compare;
2614 */
2615 }
2616 return LY_SUCCESS;
2617 case LYS_LIST:
Michal Vasko9e685082021-01-29 14:49:09 +01002618 iter1 = lyd_child(node1);
2619 iter2 = lyd_child(node2);
Michal Vasko52927e22020-03-16 17:26:14 +01002620
2621 if (!(node1->schema->flags & LYS_KEYLESS) && !(options & LYD_COMPARE_FULL_RECURSION)) {
2622 /* lists with keys, their equivalence is based on their keys */
Michal Vasko544e58a2021-01-28 14:33:41 +01002623 for (const struct lysc_node *key = lysc_node_child(node1->schema);
Michal Vaskoc57d9a92020-06-23 13:28:27 +02002624 key && (key->flags & LYS_KEY);
Michal Vasko52927e22020-03-16 17:26:14 +01002625 key = key->next) {
Michal Vasko8f359bf2020-07-28 10:41:15 +02002626 if (lyd_compare_single(iter1, iter2, options)) {
Michal Vasko52927e22020-03-16 17:26:14 +01002627 return LY_ENOT;
2628 }
2629 iter1 = iter1->next;
2630 iter2 = iter2->next;
2631 }
2632 } else {
2633 /* lists without keys, their equivalence is based on equivalence of all the children (both direct and indirect) */
2634
Radek Krejci0f969882020-08-21 16:56:47 +02002635all_children_compare:
Michal Vasko52927e22020-03-16 17:26:14 +01002636 if (!iter1 && !iter2) {
2637 /* no children, nothing to compare */
2638 return LY_SUCCESS;
2639 }
2640
Michal Vaskod989ba02020-08-24 10:59:24 +02002641 for ( ; iter1 && iter2; iter1 = iter1->next, iter2 = iter2->next) {
Michal Vasko8f359bf2020-07-28 10:41:15 +02002642 if (lyd_compare_single(iter1, iter2, options | LYD_COMPARE_FULL_RECURSION)) {
Michal Vasko52927e22020-03-16 17:26:14 +01002643 return LY_ENOT;
2644 }
2645 }
2646 if (iter1 || iter2) {
2647 return LY_ENOT;
2648 }
2649 }
2650 return LY_SUCCESS;
2651 case LYS_ANYXML:
2652 case LYS_ANYDATA:
Michal Vasko22df3f02020-08-24 13:29:22 +02002653 any1 = (struct lyd_node_any *)node1;
2654 any2 = (struct lyd_node_any *)node2;
Michal Vasko52927e22020-03-16 17:26:14 +01002655
2656 if (any1->value_type != any2->value_type) {
2657 return LY_ENOT;
2658 }
2659 switch (any1->value_type) {
2660 case LYD_ANYDATA_DATATREE:
2661 iter1 = any1->value.tree;
2662 iter2 = any2->value.tree;
2663 goto all_children_compare;
2664 case LYD_ANYDATA_STRING:
2665 case LYD_ANYDATA_XML:
2666 case LYD_ANYDATA_JSON:
2667 len1 = strlen(any1->value.str);
2668 len2 = strlen(any2->value.str);
Michal Vasko69730152020-10-09 16:30:07 +02002669 if ((len1 != len2) || strcmp(any1->value.str, any2->value.str)) {
Michal Vasko52927e22020-03-16 17:26:14 +01002670 return LY_ENOT;
2671 }
2672 return LY_SUCCESS;
Michal Vasko52927e22020-03-16 17:26:14 +01002673 case LYD_ANYDATA_LYB:
Michal Vasko60ea6352020-06-29 13:39:39 +02002674 len1 = lyd_lyb_data_length(any1->value.mem);
2675 len2 = lyd_lyb_data_length(any2->value.mem);
Michal Vasko69730152020-10-09 16:30:07 +02002676 if ((len1 != len2) || memcmp(any1->value.mem, any2->value.mem, len1)) {
Michal Vasko52927e22020-03-16 17:26:14 +01002677 return LY_ENOT;
2678 }
2679 return LY_SUCCESS;
Michal Vasko52927e22020-03-16 17:26:14 +01002680 }
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002681 }
2682 }
2683
Michal Vaskob7be7a82020-08-20 09:09:04 +02002684 LOGINT(LYD_CTX(node1));
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002685 return LY_EINT;
2686}
Radek Krejci22ebdba2019-07-25 13:59:43 +02002687
Michal Vasko21725742020-06-29 11:49:25 +02002688API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02002689lyd_compare_siblings(const struct lyd_node *node1, const struct lyd_node *node2, uint32_t options)
Michal Vasko8f359bf2020-07-28 10:41:15 +02002690{
Michal Vaskod989ba02020-08-24 10:59:24 +02002691 for ( ; node1 && node2; node1 = node1->next, node2 = node2->next) {
Michal Vasko8f359bf2020-07-28 10:41:15 +02002692 LY_CHECK_RET(lyd_compare_single(node1, node2, options));
2693 }
2694
Michal Vasko11a81432020-07-28 16:31:29 +02002695 if (node1 == node2) {
2696 return LY_SUCCESS;
Michal Vasko8f359bf2020-07-28 10:41:15 +02002697 }
Michal Vasko11a81432020-07-28 16:31:29 +02002698 return LY_ENOT;
Michal Vasko8f359bf2020-07-28 10:41:15 +02002699}
2700
2701API LY_ERR
Michal Vasko21725742020-06-29 11:49:25 +02002702lyd_compare_meta(const struct lyd_meta *meta1, const struct lyd_meta *meta2)
2703{
2704 if (!meta1 || !meta2) {
2705 if (meta1 == meta2) {
2706 return LY_SUCCESS;
2707 } else {
2708 return LY_ENOT;
2709 }
2710 }
2711
Michal Vaskoa8083062020-11-06 17:22:10 +01002712 if ((meta1->annotation->module->ctx != meta2->annotation->module->ctx) || (meta1->annotation != meta2->annotation)) {
Michal Vasko21725742020-06-29 11:49:25 +02002713 return LY_ENOT;
2714 }
2715
Michal Vasko21725742020-06-29 11:49:25 +02002716 return meta1->value.realtype->plugin->compare(&meta1->value, &meta2->value);
2717}
2718
Radek Krejci22ebdba2019-07-25 13:59:43 +02002719/**
Michal Vasko52927e22020-03-16 17:26:14 +01002720 * @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 +02002721 *
2722 * 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 +02002723 *
2724 * @param[in] node Original node to duplicate
2725 * @param[in] parent Parent to insert into, NULL for top-level sibling.
2726 * @param[in,out] first First sibling, NULL if no top-level sibling exist yet. Can be also NULL if @p parent is set.
2727 * @param[in] options Bitmask of options flags, see @ref dupoptions.
2728 * @param[out] dup_p Pointer where the created duplicated node is placed (besides connecting it int @p parent / @p first sibling).
2729 * @return LY_ERR value
Radek Krejci22ebdba2019-07-25 13:59:43 +02002730 */
Michal Vasko52927e22020-03-16 17:26:14 +01002731static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02002732lyd_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 +02002733 struct lyd_node **dup_p)
Radek Krejci22ebdba2019-07-25 13:59:43 +02002734{
Michal Vasko52927e22020-03-16 17:26:14 +01002735 LY_ERR ret;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002736 struct lyd_node *dup = NULL;
Michal Vasko61551fa2020-07-09 15:45:45 +02002737 struct lyd_meta *meta;
2738 struct lyd_node_any *any;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002739
Michal Vasko52927e22020-03-16 17:26:14 +01002740 LY_CHECK_ARG_RET(NULL, node, LY_EINVAL);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002741
Michal Vasko52927e22020-03-16 17:26:14 +01002742 if (!node->schema) {
2743 dup = calloc(1, sizeof(struct lyd_node_opaq));
2744 } else {
2745 switch (node->schema->nodetype) {
Michal Vasko1bf09392020-03-27 12:38:10 +01002746 case LYS_RPC:
Michal Vasko52927e22020-03-16 17:26:14 +01002747 case LYS_ACTION:
2748 case LYS_NOTIF:
2749 case LYS_CONTAINER:
2750 case LYS_LIST:
2751 dup = calloc(1, sizeof(struct lyd_node_inner));
2752 break;
2753 case LYS_LEAF:
2754 case LYS_LEAFLIST:
2755 dup = calloc(1, sizeof(struct lyd_node_term));
2756 break;
2757 case LYS_ANYDATA:
2758 case LYS_ANYXML:
2759 dup = calloc(1, sizeof(struct lyd_node_any));
2760 break;
2761 default:
Michal Vaskob7be7a82020-08-20 09:09:04 +02002762 LOGINT(LYD_CTX(node));
Michal Vasko52927e22020-03-16 17:26:14 +01002763 ret = LY_EINT;
2764 goto error;
2765 }
Radek Krejci22ebdba2019-07-25 13:59:43 +02002766 }
Michal Vaskob7be7a82020-08-20 09:09:04 +02002767 LY_CHECK_ERR_GOTO(!dup, LOGMEM(LYD_CTX(node)); ret = LY_EMEM, error);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002768
Michal Vaskof6df0a02020-06-16 13:08:34 +02002769 if (options & LYD_DUP_WITH_FLAGS) {
2770 dup->flags = node->flags;
2771 } else {
2772 dup->flags = (node->flags & LYD_DEFAULT) | LYD_NEW;
2773 }
Radek Krejci22ebdba2019-07-25 13:59:43 +02002774 dup->schema = node->schema;
Michal Vasko52927e22020-03-16 17:26:14 +01002775 dup->prev = dup;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002776
Michal Vasko25a32822020-07-09 15:48:22 +02002777 /* duplicate metadata */
2778 if (!(options & LYD_DUP_NO_META)) {
2779 LY_LIST_FOR(node->meta, meta) {
Michal Vasko3a41dff2020-07-15 14:30:28 +02002780 LY_CHECK_GOTO(ret = lyd_dup_meta_single(meta, dup, NULL), error);
Michal Vasko25a32822020-07-09 15:48:22 +02002781 }
2782 }
Radek Krejci22ebdba2019-07-25 13:59:43 +02002783
2784 /* nodetype-specific work */
Michal Vasko52927e22020-03-16 17:26:14 +01002785 if (!dup->schema) {
2786 struct lyd_node_opaq *opaq = (struct lyd_node_opaq *)dup;
2787 struct lyd_node_opaq *orig = (struct lyd_node_opaq *)node;
2788 struct lyd_node *child;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002789
2790 if (options & LYD_DUP_RECURSIVE) {
2791 /* duplicate all the children */
2792 LY_LIST_FOR(orig->child, child) {
Michal Vasko3a41dff2020-07-15 14:30:28 +02002793 LY_CHECK_GOTO(ret = lyd_dup_r(child, dup, NULL, options, NULL), error);
Michal Vasko52927e22020-03-16 17:26:14 +01002794 }
2795 }
Michal Vaskoad92b672020-11-12 13:11:31 +01002796 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), orig->name.name, 0, &opaq->name.name), error);
Michal Vasko52927e22020-03-16 17:26:14 +01002797 opaq->format = orig->format;
Michal Vaskoad92b672020-11-12 13:11:31 +01002798 if (orig->name.prefix) {
2799 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), orig->name.prefix, 0, &opaq->name.prefix), error);
Michal Vasko52927e22020-03-16 17:26:14 +01002800 }
Michal Vaskoad92b672020-11-12 13:11:31 +01002801 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), orig->name.module_ns, 0, &opaq->name.module_ns), error);
Michal Vasko6b5cb2a2020-11-11 19:11:21 +01002802 if (orig->val_prefix_data) {
2803 ret = ly_dup_prefix_data(LYD_CTX(node), opaq->format, orig->val_prefix_data, &opaq->val_prefix_data);
2804 LY_CHECK_GOTO(ret, error);
Michal Vasko52927e22020-03-16 17:26:14 +01002805 }
Radek Krejci011e4aa2020-09-04 15:22:31 +02002806 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), orig->value, 0, &opaq->value), error);
Michal Vasko52927e22020-03-16 17:26:14 +01002807 opaq->ctx = orig->ctx;
2808 } else if (dup->schema->nodetype & LYD_NODE_TERM) {
2809 struct lyd_node_term *term = (struct lyd_node_term *)dup;
2810 struct lyd_node_term *orig = (struct lyd_node_term *)node;
2811
2812 term->hash = orig->hash;
Michal Vaskob7be7a82020-08-20 09:09:04 +02002813 LY_CHECK_ERR_GOTO(orig->value.realtype->plugin->duplicate(LYD_CTX(node), &orig->value, &term->value),
Michal Vasko69730152020-10-09 16:30:07 +02002814 LOGERR(LYD_CTX(node), LY_EINT, "Value duplication failed."); ret = LY_EINT, error);
Michal Vasko52927e22020-03-16 17:26:14 +01002815 } else if (dup->schema->nodetype & LYD_NODE_INNER) {
2816 struct lyd_node_inner *orig = (struct lyd_node_inner *)node;
2817 struct lyd_node *child;
2818
2819 if (options & LYD_DUP_RECURSIVE) {
2820 /* duplicate all the children */
2821 LY_LIST_FOR(orig->child, child) {
Michal Vasko3a41dff2020-07-15 14:30:28 +02002822 LY_CHECK_GOTO(ret = lyd_dup_r(child, dup, NULL, options, NULL), error);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002823 }
Michal Vasko69730152020-10-09 16:30:07 +02002824 } else if ((dup->schema->nodetype == LYS_LIST) && !(dup->schema->flags & LYS_KEYLESS)) {
Radek Krejci22ebdba2019-07-25 13:59:43 +02002825 /* always duplicate keys of a list */
Radek Krejci22ebdba2019-07-25 13:59:43 +02002826 child = orig->child;
Michal Vasko544e58a2021-01-28 14:33:41 +01002827 for (const struct lysc_node *key = lysc_node_child(dup->schema);
Michal Vaskoc57d9a92020-06-23 13:28:27 +02002828 key && (key->flags & LYS_KEY);
Radek Krejci0fe9b512019-07-26 17:51:05 +02002829 key = key->next) {
Radek Krejci22ebdba2019-07-25 13:59:43 +02002830 if (!child) {
2831 /* possibly not keys are present in filtered tree */
2832 break;
Radek Krejci0fe9b512019-07-26 17:51:05 +02002833 } else if (child->schema != key) {
2834 /* possibly not all keys are present in filtered tree,
2835 * but there can be also some non-key nodes */
2836 continue;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002837 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02002838 LY_CHECK_GOTO(ret = lyd_dup_r(child, dup, NULL, options, NULL), error);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002839 child = child->next;
2840 }
2841 }
2842 lyd_hash(dup);
2843 } else if (dup->schema->nodetype & LYD_NODE_ANY) {
Michal Vasko61551fa2020-07-09 15:45:45 +02002844 dup->hash = node->hash;
2845 any = (struct lyd_node_any *)node;
2846 LY_CHECK_GOTO(ret = lyd_any_copy_value(dup, &any->value, any->value_type), error);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002847 }
2848
Michal Vasko52927e22020-03-16 17:26:14 +01002849 /* insert */
2850 lyd_insert_node(parent, first, dup);
Michal Vasko52927e22020-03-16 17:26:14 +01002851
2852 if (dup_p) {
2853 *dup_p = dup;
2854 }
2855 return LY_SUCCESS;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002856
2857error:
Michal Vasko52927e22020-03-16 17:26:14 +01002858 lyd_free_tree(dup);
2859 return ret;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002860}
2861
Michal Vasko3a41dff2020-07-15 14:30:28 +02002862static LY_ERR
2863lyd_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 +02002864 struct lyd_node_inner **local_parent)
Radek Krejci22ebdba2019-07-25 13:59:43 +02002865{
Michal Vasko3a41dff2020-07-15 14:30:28 +02002866 const struct lyd_node_inner *orig_parent, *iter;
Radek Krejci857189e2020-09-01 13:26:36 +02002867 ly_bool repeat = 1;
Michal Vasko3a41dff2020-07-15 14:30:28 +02002868
2869 *dup_parent = NULL;
2870 *local_parent = NULL;
2871
2872 for (orig_parent = node->parent; repeat && orig_parent; orig_parent = orig_parent->parent) {
2873 if (parent && (parent->schema == orig_parent->schema)) {
2874 /* stop creating parents, connect what we have into the provided parent */
2875 iter = parent;
2876 repeat = 0;
2877 } else {
2878 iter = NULL;
2879 LY_CHECK_RET(lyd_dup_r((struct lyd_node *)orig_parent, NULL, (struct lyd_node **)&iter, 0,
Radek Krejci0f969882020-08-21 16:56:47 +02002880 (struct lyd_node **)&iter));
Michal Vasko3a41dff2020-07-15 14:30:28 +02002881 }
2882 if (!*local_parent) {
2883 *local_parent = (struct lyd_node_inner *)iter;
2884 }
2885 if (iter->child) {
2886 /* 1) list - add after keys
2887 * 2) provided parent with some children */
2888 iter->child->prev->next = *dup_parent;
2889 if (*dup_parent) {
2890 (*dup_parent)->prev = iter->child->prev;
2891 iter->child->prev = *dup_parent;
2892 }
2893 } else {
2894 ((struct lyd_node_inner *)iter)->child = *dup_parent;
2895 }
2896 if (*dup_parent) {
2897 (*dup_parent)->parent = (struct lyd_node_inner *)iter;
2898 }
2899 *dup_parent = (struct lyd_node *)iter;
2900 }
2901
2902 if (repeat && parent) {
2903 /* given parent and created parents chain actually do not interconnect */
Michal Vaskob7be7a82020-08-20 09:09:04 +02002904 LOGERR(LYD_CTX(node), LY_EINVAL,
Michal Vasko69730152020-10-09 16:30:07 +02002905 "Invalid argument parent (%s()) - does not interconnect with the created node's parents chain.", __func__);
Michal Vasko3a41dff2020-07-15 14:30:28 +02002906 return LY_EINVAL;
2907 }
2908
2909 return LY_SUCCESS;
2910}
2911
2912static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02002913lyd_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 +02002914{
2915 LY_ERR rc;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002916 const struct lyd_node *orig; /* original node to be duplicated */
2917 struct lyd_node *first = NULL; /* the first duplicated node, this is returned */
Radek Krejci22ebdba2019-07-25 13:59:43 +02002918 struct lyd_node *top = NULL; /* the most higher created node */
2919 struct lyd_node_inner *local_parent = NULL; /* the direct parent node for the duplicated node(s) */
Radek Krejci22ebdba2019-07-25 13:59:43 +02002920
Michal Vasko3a41dff2020-07-15 14:30:28 +02002921 LY_CHECK_ARG_RET(NULL, node, LY_EINVAL);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002922
2923 if (options & LYD_DUP_WITH_PARENTS) {
Michal Vasko3a41dff2020-07-15 14:30:28 +02002924 LY_CHECK_GOTO(rc = lyd_dup_get_local_parent(node, parent, &top, &local_parent), error);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002925 } else {
2926 local_parent = parent;
2927 }
2928
Radek Krejci22ebdba2019-07-25 13:59:43 +02002929 LY_LIST_FOR(node, orig) {
Michal Vasko35f4d772021-01-12 12:08:57 +01002930 if (lysc_is_key(orig->schema)) {
2931 if (local_parent) {
2932 /* the key must already exist in the parent */
2933 rc = lyd_find_sibling_schema(local_parent->child, orig->schema, first ? NULL : &first);
2934 LY_CHECK_ERR_GOTO(rc, LOGINT(LYD_CTX(node)), error);
2935 } else {
2936 assert(!(options & LYD_DUP_WITH_PARENTS));
2937 /* duplicating a single key, okay, I suppose... */
2938 rc = lyd_dup_r(orig, NULL, &first, options, first ? NULL : &first);
2939 LY_CHECK_GOTO(rc, error);
2940 }
2941 } else {
2942 /* if there is no local parent, it will be inserted into first */
Michal Vasko9e685082021-01-29 14:49:09 +01002943 rc = lyd_dup_r(orig, &local_parent->node, &first, options, first ? NULL : &first);
Michal Vasko35f4d772021-01-12 12:08:57 +01002944 LY_CHECK_GOTO(rc, error);
2945 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02002946 if (nosiblings) {
Radek Krejci22ebdba2019-07-25 13:59:43 +02002947 break;
2948 }
2949 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02002950
2951 /* rehash if needed */
Michal Vaskod989ba02020-08-24 10:59:24 +02002952 for ( ; local_parent; local_parent = local_parent->parent) {
Michal Vasko69730152020-10-09 16:30:07 +02002953 if ((local_parent->schema->nodetype == LYS_LIST) && (local_parent->schema->flags & LYS_KEYLESS)) {
Michal Vasko9e685082021-01-29 14:49:09 +01002954 lyd_hash(&local_parent->node);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002955 }
2956 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02002957
2958 if (dup) {
2959 *dup = first;
2960 }
2961 return LY_SUCCESS;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002962
2963error:
2964 if (top) {
2965 lyd_free_tree(top);
2966 } else {
Michal Vaskof03ed032020-03-04 13:31:44 +01002967 lyd_free_siblings(first);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002968 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02002969 return rc;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002970}
Michal Vasko5ec7cda2019-09-11 13:43:08 +02002971
Michal Vasko3a41dff2020-07-15 14:30:28 +02002972API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02002973lyd_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 +02002974{
2975 return lyd_dup(node, parent, options, 1, dup);
2976}
2977
2978API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02002979lyd_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 +02002980{
2981 return lyd_dup(node, parent, options, 0, dup);
2982}
2983
2984API LY_ERR
2985lyd_dup_meta_single(const struct lyd_meta *meta, struct lyd_node *node, struct lyd_meta **dup)
Michal Vasko25a32822020-07-09 15:48:22 +02002986{
Radek Krejci011e4aa2020-09-04 15:22:31 +02002987 LY_ERR ret = LY_SUCCESS;
Michal Vasko25a32822020-07-09 15:48:22 +02002988 struct lyd_meta *mt, *last;
2989
Michal Vasko3a41dff2020-07-15 14:30:28 +02002990 LY_CHECK_ARG_RET(NULL, meta, node, LY_EINVAL);
Michal Vasko25a32822020-07-09 15:48:22 +02002991
2992 /* create a copy */
2993 mt = calloc(1, sizeof *mt);
Michal Vaskob7be7a82020-08-20 09:09:04 +02002994 LY_CHECK_ERR_RET(!mt, LOGMEM(LYD_CTX(node)), LY_EMEM);
Michal Vasko25a32822020-07-09 15:48:22 +02002995 mt->annotation = meta->annotation;
Michal Vaskob7be7a82020-08-20 09:09:04 +02002996 ret = meta->value.realtype->plugin->duplicate(LYD_CTX(node), &meta->value, &mt->value);
Radek Krejci011e4aa2020-09-04 15:22:31 +02002997 LY_CHECK_ERR_GOTO(ret, LOGERR(LYD_CTX(node), LY_EINT, "Value duplication failed."), finish);
2998 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), meta->name, 0, &mt->name), finish);
Michal Vasko25a32822020-07-09 15:48:22 +02002999
3000 /* insert as the last attribute */
Radek Krejci011e4aa2020-09-04 15:22:31 +02003001 mt->parent = node;
Michal Vasko25a32822020-07-09 15:48:22 +02003002 if (node->meta) {
Radek Krejci1e008d22020-08-17 11:37:37 +02003003 for (last = node->meta; last->next; last = last->next) {}
Michal Vasko25a32822020-07-09 15:48:22 +02003004 last->next = mt;
3005 } else {
3006 node->meta = mt;
3007 }
3008
Radek Krejci011e4aa2020-09-04 15:22:31 +02003009finish:
3010 if (ret) {
3011 lyd_free_meta_single(mt);
3012 } else if (dup) {
Michal Vasko3a41dff2020-07-15 14:30:28 +02003013 *dup = mt;
3014 }
3015 return LY_SUCCESS;
Michal Vasko25a32822020-07-09 15:48:22 +02003016}
3017
Michal Vasko4490d312020-06-16 13:08:55 +02003018/**
3019 * @brief Merge a source sibling into target siblings.
3020 *
3021 * @param[in,out] first_trg First target sibling, is updated if top-level.
3022 * @param[in] parent_trg Target parent.
3023 * @param[in,out] sibling_src Source sibling to merge, set to NULL if spent.
3024 * @param[in] options Merge options.
3025 * @return LY_ERR value.
3026 */
3027static LY_ERR
3028lyd_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 +02003029 uint16_t options)
Michal Vasko4490d312020-06-16 13:08:55 +02003030{
3031 LY_ERR ret;
3032 const struct lyd_node *child_src, *tmp, *sibling_src;
Michal Vasko56daf732020-08-10 10:57:18 +02003033 struct lyd_node *match_trg, *dup_src, *elem;
Michal Vasko4490d312020-06-16 13:08:55 +02003034 struct lysc_type *type;
Michal Vasko4490d312020-06-16 13:08:55 +02003035
3036 sibling_src = *sibling_src_p;
3037 if (sibling_src->schema->nodetype & (LYS_LIST | LYS_LEAFLIST)) {
3038 /* try to find the exact instance */
3039 ret = lyd_find_sibling_first(*first_trg, sibling_src, &match_trg);
3040 } else {
3041 /* try to simply find the node, there cannot be more instances */
3042 ret = lyd_find_sibling_val(*first_trg, sibling_src->schema, NULL, 0, &match_trg);
3043 }
3044
3045 if (!ret) {
3046 /* node found, make sure even value matches for all node types */
Michal Vasko8f359bf2020-07-28 10:41:15 +02003047 if ((match_trg->schema->nodetype == LYS_LEAF) && lyd_compare_single(sibling_src, match_trg, LYD_COMPARE_DEFAULTS)) {
Michal Vasko4490d312020-06-16 13:08:55 +02003048 /* since they are different, they cannot both be default */
3049 assert(!(sibling_src->flags & LYD_DEFAULT) || !(match_trg->flags & LYD_DEFAULT));
3050
Michal Vasko3a41dff2020-07-15 14:30:28 +02003051 /* update value (or only LYD_DEFAULT flag) only if flag set or the source node is not default */
3052 if ((options & LYD_MERGE_DEFAULTS) || !(sibling_src->flags & LYD_DEFAULT)) {
Michal Vasko4490d312020-06-16 13:08:55 +02003053 type = ((struct lysc_node_leaf *)match_trg->schema)->type;
Michal Vaskob7be7a82020-08-20 09:09:04 +02003054 type->plugin->free(LYD_CTX(match_trg), &((struct lyd_node_term *)match_trg)->value);
3055 LY_CHECK_RET(type->plugin->duplicate(LYD_CTX(match_trg), &((struct lyd_node_term *)sibling_src)->value,
Michal Vasko69730152020-10-09 16:30:07 +02003056 &((struct lyd_node_term *)match_trg)->value));
Michal Vasko4490d312020-06-16 13:08:55 +02003057
3058 /* copy flags and add LYD_NEW */
3059 match_trg->flags = sibling_src->flags | LYD_NEW;
3060 }
Michal Vasko8f359bf2020-07-28 10:41:15 +02003061 } else if ((match_trg->schema->nodetype & LYS_ANYDATA) && lyd_compare_single(sibling_src, match_trg, 0)) {
Michal Vasko4c583e82020-07-17 12:16:14 +02003062 /* update value */
3063 LY_CHECK_RET(lyd_any_copy_value(match_trg, &((struct lyd_node_any *)sibling_src)->value,
Radek Krejci0f969882020-08-21 16:56:47 +02003064 ((struct lyd_node_any *)sibling_src)->value_type));
Michal Vasko4490d312020-06-16 13:08:55 +02003065
3066 /* copy flags and add LYD_NEW */
3067 match_trg->flags = sibling_src->flags | LYD_NEW;
Michal Vasko4490d312020-06-16 13:08:55 +02003068 } else {
3069 /* check descendants, recursively */
Radek Krejcia1c1e542020-09-29 16:06:52 +02003070 LY_LIST_FOR_SAFE(lyd_child_no_keys(sibling_src), tmp, child_src) {
Michal Vaskoe0665742021-02-11 11:08:44 +01003071 LY_CHECK_RET(lyd_merge_sibling_r(lyd_node_child_p(match_trg), match_trg, &child_src, options));
Michal Vasko4490d312020-06-16 13:08:55 +02003072 }
3073 }
3074 } else {
3075 /* node not found, merge it */
3076 if (options & LYD_MERGE_DESTRUCT) {
3077 dup_src = (struct lyd_node *)sibling_src;
3078 lyd_unlink_tree(dup_src);
3079 /* spend it */
3080 *sibling_src_p = NULL;
3081 } else {
Michal Vasko3a41dff2020-07-15 14:30:28 +02003082 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 +02003083 }
3084
3085 /* set LYD_NEW for all the new nodes, required for validation */
Michal Vasko56daf732020-08-10 10:57:18 +02003086 LYD_TREE_DFS_BEGIN(dup_src, elem) {
Michal Vasko4490d312020-06-16 13:08:55 +02003087 elem->flags |= LYD_NEW;
Michal Vasko56daf732020-08-10 10:57:18 +02003088 LYD_TREE_DFS_END(dup_src, elem);
Michal Vasko4490d312020-06-16 13:08:55 +02003089 }
3090
3091 lyd_insert_node(parent_trg, first_trg, dup_src);
3092 }
3093
3094 return LY_SUCCESS;
3095}
3096
Michal Vasko3a41dff2020-07-15 14:30:28 +02003097static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02003098lyd_merge(struct lyd_node **target, const struct lyd_node *source, uint16_t options, ly_bool nosiblings)
Michal Vasko4490d312020-06-16 13:08:55 +02003099{
3100 const struct lyd_node *sibling_src, *tmp;
Radek Krejci857189e2020-09-01 13:26:36 +02003101 ly_bool first;
Michal Vasko4490d312020-06-16 13:08:55 +02003102
3103 LY_CHECK_ARG_RET(NULL, target, LY_EINVAL);
3104
3105 if (!source) {
3106 /* nothing to merge */
3107 return LY_SUCCESS;
3108 }
3109
Michal Vasko831422b2020-11-24 11:20:51 +01003110 if ((*target && lysc_data_parent((*target)->schema)) || lysc_data_parent(source->schema)) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02003111 LOGERR(LYD_CTX(source), LY_EINVAL, "Invalid arguments - can merge only 2 top-level subtrees (%s()).", __func__);
Michal Vasko4490d312020-06-16 13:08:55 +02003112 return LY_EINVAL;
3113 }
3114
3115 LY_LIST_FOR_SAFE(source, tmp, sibling_src) {
Radek Krejci857189e2020-09-01 13:26:36 +02003116 first = (sibling_src == source) ? 1 : 0;
Michal Vasko4490d312020-06-16 13:08:55 +02003117 LY_CHECK_RET(lyd_merge_sibling_r(target, NULL, &sibling_src, options));
3118 if (first && !sibling_src) {
3119 /* source was spent (unlinked), move to the next node */
3120 source = tmp;
3121 }
3122
Michal Vasko3a41dff2020-07-15 14:30:28 +02003123 if (nosiblings) {
Michal Vasko4490d312020-06-16 13:08:55 +02003124 break;
3125 }
3126 }
3127
3128 if (options & LYD_MERGE_DESTRUCT) {
3129 /* free any leftover source data that were not merged */
3130 lyd_free_siblings((struct lyd_node *)source);
3131 }
3132
3133 return LY_SUCCESS;
3134}
3135
Michal Vasko3a41dff2020-07-15 14:30:28 +02003136API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02003137lyd_merge_tree(struct lyd_node **target, const struct lyd_node *source, uint16_t options)
Michal Vasko3a41dff2020-07-15 14:30:28 +02003138{
3139 return lyd_merge(target, source, options, 1);
3140}
3141
3142API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02003143lyd_merge_siblings(struct lyd_node **target, const struct lyd_node *source, uint16_t options)
Michal Vasko3a41dff2020-07-15 14:30:28 +02003144{
3145 return lyd_merge(target, source, options, 0);
3146}
3147
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003148static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02003149lyd_path_str_enlarge(char **buffer, size_t *buflen, size_t reqlen, ly_bool is_static)
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003150{
Michal Vasko14654712020-02-06 08:35:21 +01003151 /* ending \0 */
3152 ++reqlen;
3153
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003154 if (reqlen > *buflen) {
3155 if (is_static) {
3156 return LY_EINCOMPLETE;
3157 }
3158
3159 *buffer = ly_realloc(*buffer, reqlen * sizeof **buffer);
3160 if (!*buffer) {
3161 return LY_EMEM;
3162 }
3163
3164 *buflen = reqlen;
3165 }
3166
3167 return LY_SUCCESS;
3168}
3169
Michal Vaskod59035b2020-07-08 12:00:06 +02003170LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02003171lyd_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 +02003172{
3173 const struct lyd_node *key;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003174 size_t len;
3175 const char *val;
3176 char quot;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003177
Radek Krejcia1c1e542020-09-29 16:06:52 +02003178 for (key = lyd_child(node); key && (key->schema->flags & LYS_KEY); key = key->next) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02003179 val = LYD_CANON_VALUE(key);
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003180 len = 1 + strlen(key->schema->name) + 2 + strlen(val) + 2;
Michal Vaskoba99a3e2020-08-18 15:50:05 +02003181 LY_CHECK_RET(lyd_path_str_enlarge(buffer, buflen, *bufused + len, is_static));
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003182
3183 quot = '\'';
3184 if (strchr(val, '\'')) {
3185 quot = '"';
3186 }
3187 *bufused += sprintf(*buffer + *bufused, "[%s=%c%s%c]", key->schema->name, quot, val, quot);
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003188 }
3189
3190 return LY_SUCCESS;
3191}
3192
3193/**
3194 * @brief Append leaf-list value predicate to path.
3195 *
3196 * @param[in] node Node to print.
3197 * @param[in,out] buffer Buffer to print to.
3198 * @param[in,out] buflen Current buffer length.
3199 * @param[in,out] bufused Current number of characters used in @p buffer.
3200 * @param[in] is_static Whether buffer is static or can be reallocated.
3201 * @return LY_ERR
3202 */
3203static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02003204lyd_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 +02003205{
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003206 size_t len;
3207 const char *val;
3208 char quot;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003209
Michal Vaskob7be7a82020-08-20 09:09:04 +02003210 val = LYD_CANON_VALUE(node);
Radek Krejcif13b87b2020-12-01 22:02:17 +01003211 len = 4 + strlen(val) + 2; /* "[.='" + val + "']" */
Michal Vaskoba99a3e2020-08-18 15:50:05 +02003212 LY_CHECK_RET(lyd_path_str_enlarge(buffer, buflen, *bufused + len, is_static));
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003213
3214 quot = '\'';
3215 if (strchr(val, '\'')) {
3216 quot = '"';
3217 }
3218 *bufused += sprintf(*buffer + *bufused, "[.=%c%s%c]", quot, val, quot);
3219
Michal Vaskoba99a3e2020-08-18 15:50:05 +02003220 return LY_SUCCESS;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003221}
3222
3223/**
3224 * @brief Append node position (relative to its other instances) predicate to path.
3225 *
3226 * @param[in] node Node to print.
3227 * @param[in,out] buffer Buffer to print to.
3228 * @param[in,out] buflen Current buffer length.
3229 * @param[in,out] bufused Current number of characters used in @p buffer.
3230 * @param[in] is_static Whether buffer is static or can be reallocated.
3231 * @return LY_ERR
3232 */
3233static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02003234lyd_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 +02003235{
3236 const struct lyd_node *first, *iter;
3237 size_t len;
Radek Krejci1deb5be2020-08-26 16:43:36 +02003238 uint64_t pos;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003239 char *val = NULL;
3240 LY_ERR rc;
3241
3242 if (node->parent) {
3243 first = node->parent->child;
3244 } else {
Michal Vaskoe070bfe2020-08-31 12:27:25 +02003245 for (first = node; first->prev->next; first = first->prev) {}
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003246 }
3247 pos = 1;
3248 for (iter = first; iter != node; iter = iter->next) {
3249 if (iter->schema == node->schema) {
3250 ++pos;
3251 }
3252 }
Radek Krejci1deb5be2020-08-26 16:43:36 +02003253 if (asprintf(&val, "%" PRIu64, pos) == -1) {
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003254 return LY_EMEM;
3255 }
3256
3257 len = 1 + strlen(val) + 1;
3258 rc = lyd_path_str_enlarge(buffer, buflen, *bufused + len, is_static);
3259 if (rc != LY_SUCCESS) {
3260 goto cleanup;
3261 }
3262
3263 *bufused += sprintf(*buffer + *bufused, "[%s]", val);
3264
3265cleanup:
3266 free(val);
3267 return rc;
3268}
3269
3270API char *
3271lyd_path(const struct lyd_node *node, LYD_PATH_TYPE pathtype, char *buffer, size_t buflen)
3272{
Radek Krejci857189e2020-09-01 13:26:36 +02003273 ly_bool is_static = 0;
Radek Krejci1deb5be2020-08-26 16:43:36 +02003274 uint32_t i, depth;
Michal Vasko14654712020-02-06 08:35:21 +01003275 size_t bufused = 0, len;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003276 const struct lyd_node *iter;
3277 const struct lys_module *mod;
Michal Vasko790b2bc2020-08-03 13:35:06 +02003278 LY_ERR rc = LY_SUCCESS;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003279
3280 LY_CHECK_ARG_RET(NULL, node, NULL);
3281 if (buffer) {
3282 LY_CHECK_ARG_RET(node->schema->module->ctx, buflen > 1, NULL);
3283 is_static = 1;
Michal Vasko14654712020-02-06 08:35:21 +01003284 } else {
3285 buflen = 0;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003286 }
3287
3288 switch (pathtype) {
Radek Krejci635d2b82021-01-04 11:26:51 +01003289 case LYD_PATH_STD:
3290 case LYD_PATH_STD_NO_LAST_PRED:
Michal Vasko14654712020-02-06 08:35:21 +01003291 depth = 1;
Michal Vasko9e685082021-01-29 14:49:09 +01003292 for (iter = node; iter->parent; iter = lyd_parent(iter)) {
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003293 ++depth;
3294 }
3295
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003296 goto iter_print;
Michal Vasko14654712020-02-06 08:35:21 +01003297 while (depth) {
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003298 /* find the right node */
Michal Vasko9e685082021-01-29 14:49:09 +01003299 for (iter = node, i = 1; i < depth; iter = lyd_parent(iter), ++i) {}
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003300iter_print:
3301 /* print prefix and name */
3302 mod = NULL;
Michal Vasko69730152020-10-09 16:30:07 +02003303 if (iter->schema && (!iter->parent || (iter->schema->module != iter->parent->schema->module))) {
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003304 mod = iter->schema->module;
3305 }
3306
3307 /* realloc string */
Michal Vaskoad92b672020-11-12 13:11:31 +01003308 len = 1 + (mod ? strlen(mod->name) + 1 : 0) + (iter->schema ? strlen(iter->schema->name) :
3309 strlen(((struct lyd_node_opaq *)iter)->name.name));
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003310 rc = lyd_path_str_enlarge(&buffer, &buflen, bufused + len, is_static);
3311 if (rc != LY_SUCCESS) {
3312 break;
3313 }
3314
3315 /* print next node */
Radek Krejci1798aae2020-07-14 13:26:06 +02003316 bufused += sprintf(buffer + bufused, "/%s%s%s", mod ? mod->name : "", mod ? ":" : "",
Michal Vaskoad92b672020-11-12 13:11:31 +01003317 iter->schema ? iter->schema->name : ((struct lyd_node_opaq *)iter)->name.name);
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003318
Michal Vasko790b2bc2020-08-03 13:35:06 +02003319 /* do not always print the last (first) predicate */
Radek Krejci635d2b82021-01-04 11:26:51 +01003320 if (iter->schema && ((depth > 1) || (pathtype == LYD_PATH_STD))) {
Michal Vasko790b2bc2020-08-03 13:35:06 +02003321 switch (iter->schema->nodetype) {
3322 case LYS_LIST:
3323 if (iter->schema->flags & LYS_KEYLESS) {
3324 /* print its position */
3325 rc = lyd_path_position_predicate(iter, &buffer, &buflen, &bufused, is_static);
3326 } else {
3327 /* print all list keys in predicates */
3328 rc = lyd_path_list_predicate(iter, &buffer, &buflen, &bufused, is_static);
3329 }
3330 break;
3331 case LYS_LEAFLIST:
3332 if (iter->schema->flags & LYS_CONFIG_W) {
3333 /* print leaf-list value */
3334 rc = lyd_path_leaflist_predicate(iter, &buffer, &buflen, &bufused, is_static);
3335 } else {
3336 /* print its position */
3337 rc = lyd_path_position_predicate(iter, &buffer, &buflen, &bufused, is_static);
3338 }
3339 break;
3340 default:
3341 /* nothing to print more */
3342 break;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003343 }
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003344 }
3345 if (rc != LY_SUCCESS) {
3346 break;
3347 }
3348
Michal Vasko14654712020-02-06 08:35:21 +01003349 --depth;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003350 }
3351 break;
3352 }
3353
3354 return buffer;
3355}
Michal Vaskoe444f752020-02-10 12:20:06 +01003356
Michal Vasko25a32822020-07-09 15:48:22 +02003357API struct lyd_meta *
3358lyd_find_meta(const struct lyd_meta *first, const struct lys_module *module, const char *name)
3359{
3360 struct lyd_meta *ret = NULL;
3361 const struct ly_ctx *ctx;
3362 const char *prefix, *tmp;
3363 char *str;
3364 size_t pref_len, name_len;
3365
3366 LY_CHECK_ARG_RET(NULL, module || strchr(name, ':'), name, NULL);
3367
3368 if (!first) {
3369 return NULL;
3370 }
3371
3372 ctx = first->annotation->module->ctx;
3373
3374 /* parse the name */
3375 tmp = name;
3376 if (ly_parse_nodeid(&tmp, &prefix, &pref_len, &name, &name_len) || tmp[0]) {
3377 LOGERR(ctx, LY_EINVAL, "Metadata name \"%s\" is not valid.", name);
3378 return NULL;
3379 }
3380
3381 /* find the module */
3382 if (prefix) {
3383 str = strndup(prefix, pref_len);
3384 module = ly_ctx_get_module_latest(ctx, str);
3385 free(str);
3386 LY_CHECK_ERR_RET(!module, LOGERR(ctx, LY_EINVAL, "Module \"%.*s\" not found.", pref_len, prefix), NULL);
3387 }
3388
3389 /* find the metadata */
3390 LY_LIST_FOR(first, first) {
3391 if ((first->annotation->module == module) && !strcmp(first->name, name)) {
3392 ret = (struct lyd_meta *)first;
3393 break;
3394 }
3395 }
3396
3397 return ret;
3398}
3399
Michal Vasko9b368d32020-02-14 13:53:31 +01003400API LY_ERR
Michal Vaskoe444f752020-02-10 12:20:06 +01003401lyd_find_sibling_first(const struct lyd_node *siblings, const struct lyd_node *target, struct lyd_node **match)
3402{
3403 struct lyd_node **match_p;
3404 struct lyd_node_inner *parent;
3405
Michal Vaskof03ed032020-03-04 13:31:44 +01003406 LY_CHECK_ARG_RET(NULL, target, LY_EINVAL);
Michal Vaskoe444f752020-02-10 12:20:06 +01003407
Michal Vasko6da1e952020-12-09 18:14:38 +01003408 if (!siblings || (siblings->schema && target->schema &&
3409 (lysc_data_parent(siblings->schema) != lysc_data_parent(target->schema)))) {
Michal Vasko62ed12d2020-05-21 10:08:25 +02003410 /* no data or schema mismatch */
Michal Vasko9b368d32020-02-14 13:53:31 +01003411 if (match) {
3412 *match = NULL;
3413 }
Michal Vaskoe444f752020-02-10 12:20:06 +01003414 return LY_ENOTFOUND;
3415 }
3416
3417 /* find first sibling */
3418 if (siblings->parent) {
3419 siblings = siblings->parent->child;
3420 } else {
3421 while (siblings->prev->next) {
3422 siblings = siblings->prev;
3423 }
3424 }
3425
Michal Vasko9e685082021-01-29 14:49:09 +01003426 parent = siblings->parent;
Michal Vasko6da1e952020-12-09 18:14:38 +01003427 if (parent && parent->schema && parent->children_ht) {
Michal Vaskoe444f752020-02-10 12:20:06 +01003428 assert(target->hash);
3429
3430 /* find by hash */
3431 if (!lyht_find(parent->children_ht, &target, target->hash, (void **)&match_p)) {
Michal Vaskoda859032020-07-14 12:20:14 +02003432 /* check even value when needed */
Michal Vasko8f359bf2020-07-28 10:41:15 +02003433 if (!(target->schema->nodetype & (LYS_LIST | LYS_LEAFLIST)) || !lyd_compare_single(target, *match_p, 0)) {
Michal Vaskoda859032020-07-14 12:20:14 +02003434 siblings = *match_p;
3435 } else {
3436 siblings = NULL;
3437 }
Michal Vaskoe444f752020-02-10 12:20:06 +01003438 } else {
3439 /* not found */
3440 siblings = NULL;
3441 }
3442 } else {
3443 /* no children hash table */
Michal Vaskod989ba02020-08-24 10:59:24 +02003444 for ( ; siblings; siblings = siblings->next) {
Michal Vasko8f359bf2020-07-28 10:41:15 +02003445 if (!lyd_compare_single(siblings, target, 0)) {
Michal Vaskoe444f752020-02-10 12:20:06 +01003446 break;
3447 }
3448 }
3449 }
3450
3451 if (!siblings) {
Michal Vasko9b368d32020-02-14 13:53:31 +01003452 if (match) {
3453 *match = NULL;
3454 }
Michal Vaskoe444f752020-02-10 12:20:06 +01003455 return LY_ENOTFOUND;
3456 }
3457
Michal Vasko9b368d32020-02-14 13:53:31 +01003458 if (match) {
3459 *match = (struct lyd_node *)siblings;
3460 }
Michal Vaskoe444f752020-02-10 12:20:06 +01003461 return LY_SUCCESS;
3462}
3463
Radek Krejci857189e2020-09-01 13:26:36 +02003464/**
3465 * @brief Comparison callback to match schema node with a schema of a data node.
3466 *
3467 * @param[in] val1_p Pointer to the schema node
3468 * @param[in] val2_p Pointer to the data node
3469 * Implementation of ::values_equal_cb.
3470 */
3471static ly_bool
3472lyd_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 +01003473{
3474 struct lysc_node *val1;
3475 struct lyd_node *val2;
3476
3477 val1 = *((struct lysc_node **)val1_p);
3478 val2 = *((struct lyd_node **)val2_p);
3479
Michal Vasko90932a92020-02-12 14:33:03 +01003480 if (val1 == val2->schema) {
3481 /* schema match is enough */
3482 return 1;
3483 } else {
3484 return 0;
3485 }
3486}
3487
Michal Vasko92239c72020-11-18 18:17:25 +01003488/**
3489 * @brief Search in the given siblings (NOT recursively) for the first schema node data instance.
3490 * Uses hashes - should be used whenever possible for best performance.
3491 *
3492 * @param[in] siblings Siblings to search in including preceding and succeeding nodes.
3493 * @param[in] schema Target data node schema to find.
3494 * @param[out] match Can be NULL, otherwise the found data node.
3495 * @return LY_SUCCESS on success, @p match set.
3496 * @return LY_ENOTFOUND if not found, @p match set to NULL.
3497 * @return LY_ERR value if another error occurred.
3498 */
Michal Vasko90932a92020-02-12 14:33:03 +01003499static LY_ERR
3500lyd_find_sibling_schema(const struct lyd_node *siblings, const struct lysc_node *schema, struct lyd_node **match)
3501{
3502 struct lyd_node **match_p;
3503 struct lyd_node_inner *parent;
3504 uint32_t hash;
3505 values_equal_cb ht_cb;
3506
Michal Vaskob104f112020-07-17 09:54:54 +02003507 assert(siblings && schema);
Michal Vasko90932a92020-02-12 14:33:03 +01003508
Michal Vasko9e685082021-01-29 14:49:09 +01003509 parent = siblings->parent;
Michal Vasko08fd6132020-11-18 18:17:45 +01003510 if (parent && parent->schema && parent->children_ht) {
Michal Vasko90932a92020-02-12 14:33:03 +01003511 /* calculate our hash */
3512 hash = dict_hash_multi(0, schema->module->name, strlen(schema->module->name));
3513 hash = dict_hash_multi(hash, schema->name, strlen(schema->name));
3514 hash = dict_hash_multi(hash, NULL, 0);
3515
3516 /* use special hash table function */
3517 ht_cb = lyht_set_cb(parent->children_ht, lyd_hash_table_schema_val_equal);
3518
3519 /* find by hash */
3520 if (!lyht_find(parent->children_ht, &schema, hash, (void **)&match_p)) {
3521 siblings = *match_p;
3522 } else {
3523 /* not found */
3524 siblings = NULL;
3525 }
3526
3527 /* set the original hash table compare function back */
3528 lyht_set_cb(parent->children_ht, ht_cb);
3529 } else {
Michal Vaskob104f112020-07-17 09:54:54 +02003530 /* find first sibling */
3531 if (siblings->parent) {
3532 siblings = siblings->parent->child;
3533 } else {
3534 while (siblings->prev->next) {
3535 siblings = siblings->prev;
3536 }
3537 }
3538
3539 /* search manually without hashes */
Michal Vaskod989ba02020-08-24 10:59:24 +02003540 for ( ; siblings; siblings = siblings->next) {
Michal Vasko90932a92020-02-12 14:33:03 +01003541 if (siblings->schema == schema) {
3542 /* schema match is enough */
3543 break;
3544 }
3545 }
3546 }
3547
3548 if (!siblings) {
Michal Vasko9b368d32020-02-14 13:53:31 +01003549 if (match) {
3550 *match = NULL;
3551 }
Michal Vasko90932a92020-02-12 14:33:03 +01003552 return LY_ENOTFOUND;
3553 }
3554
Michal Vasko9b368d32020-02-14 13:53:31 +01003555 if (match) {
3556 *match = (struct lyd_node *)siblings;
3557 }
Michal Vasko90932a92020-02-12 14:33:03 +01003558 return LY_SUCCESS;
3559}
3560
Michal Vaskoe444f752020-02-10 12:20:06 +01003561API LY_ERR
3562lyd_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 +02003563 size_t val_len, struct lyd_node **match)
Michal Vaskoe444f752020-02-10 12:20:06 +01003564{
3565 LY_ERR rc;
3566 struct lyd_node *target = NULL;
3567
Michal Vasko4c583e82020-07-17 12:16:14 +02003568 LY_CHECK_ARG_RET(NULL, schema, !(schema->nodetype & (LYS_CHOICE | LYS_CASE)), LY_EINVAL);
Michal Vaskoe444f752020-02-10 12:20:06 +01003569
Michal Vasko08fd6132020-11-18 18:17:45 +01003570 if (!siblings || (siblings->schema && (lysc_data_parent(siblings->schema) != lysc_data_parent(schema)))) {
Michal Vasko62ed12d2020-05-21 10:08:25 +02003571 /* no data or schema mismatch */
Michal Vasko9b368d32020-02-14 13:53:31 +01003572 if (match) {
3573 *match = NULL;
3574 }
Michal Vaskoe444f752020-02-10 12:20:06 +01003575 return LY_ENOTFOUND;
3576 }
3577
Michal Vaskof03ed032020-03-04 13:31:44 +01003578 if (key_or_value && !val_len) {
3579 val_len = strlen(key_or_value);
3580 }
3581
Michal Vaskob104f112020-07-17 09:54:54 +02003582 if ((schema->nodetype & (LYS_LIST | LYS_LEAFLIST)) && key_or_value) {
3583 /* create a data node and find the instance */
3584 if (schema->nodetype == LYS_LEAFLIST) {
3585 /* target used attributes: schema, hash, value */
Michal Vaskofeca4fb2020-10-05 08:58:40 +02003586 rc = lyd_create_term(schema, key_or_value, val_len, NULL, LY_PREF_JSON, NULL, LYD_HINT_DATA, NULL, &target);
3587 LY_CHECK_RET(rc);
Michal Vaskob104f112020-07-17 09:54:54 +02003588 } else {
Michal Vasko90932a92020-02-12 14:33:03 +01003589 /* target used attributes: schema, hash, child (all keys) */
Michal Vasko004d3152020-06-11 19:59:22 +02003590 LY_CHECK_RET(lyd_create_list2(schema, key_or_value, val_len, &target));
Michal Vasko90932a92020-02-12 14:33:03 +01003591 }
3592
3593 /* find it */
3594 rc = lyd_find_sibling_first(siblings, target, match);
Michal Vaskob104f112020-07-17 09:54:54 +02003595 } else {
3596 /* find the first schema node instance */
3597 rc = lyd_find_sibling_schema(siblings, schema, match);
Michal Vaskoe444f752020-02-10 12:20:06 +01003598 }
3599
Michal Vaskoe444f752020-02-10 12:20:06 +01003600 lyd_free_tree(target);
3601 return rc;
3602}
Michal Vaskoccc02342020-05-21 10:09:21 +02003603
3604API LY_ERR
3605lyd_find_xpath(const struct lyd_node *ctx_node, const char *xpath, struct ly_set **set)
3606{
3607 LY_ERR ret = LY_SUCCESS;
3608 struct lyxp_set xp_set;
Radek Krejcif03a9e22020-09-18 20:09:31 +02003609 struct lyxp_expr *exp = NULL;
Michal Vaskoccc02342020-05-21 10:09:21 +02003610 uint32_t i;
3611
3612 LY_CHECK_ARG_RET(NULL, ctx_node, xpath, set, LY_EINVAL);
3613
3614 memset(&xp_set, 0, sizeof xp_set);
3615
3616 /* compile expression */
Radek Krejcif03a9e22020-09-18 20:09:31 +02003617 ret = lyxp_expr_parse((struct ly_ctx *)LYD_CTX(ctx_node), xpath, 0, 1, &exp);
3618 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskoccc02342020-05-21 10:09:21 +02003619
3620 /* evaluate expression */
Michal Vasko400e9672021-01-11 13:39:17 +01003621 ret = lyxp_eval(LYD_CTX(ctx_node), exp, NULL, LY_PREF_JSON, NULL, ctx_node, ctx_node, &xp_set, LYXP_IGNORE_WHEN);
Michal Vaskoccc02342020-05-21 10:09:21 +02003622 LY_CHECK_GOTO(ret, cleanup);
3623
3624 /* allocate return set */
Radek Krejciba03a5a2020-08-27 14:40:41 +02003625 ret = ly_set_new(set);
3626 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskoccc02342020-05-21 10:09:21 +02003627
3628 /* transform into ly_set */
3629 if (xp_set.type == LYXP_SET_NODE_SET) {
3630 /* allocate memory for all the elements once (even though not all items must be elements but most likely will be) */
3631 (*set)->objs = malloc(xp_set.used * sizeof *(*set)->objs);
Michal Vaskob7be7a82020-08-20 09:09:04 +02003632 LY_CHECK_ERR_GOTO(!(*set)->objs, LOGMEM(LYD_CTX(ctx_node)); ret = LY_EMEM, cleanup);
Michal Vaskoccc02342020-05-21 10:09:21 +02003633 (*set)->size = xp_set.used;
3634
3635 for (i = 0; i < xp_set.used; ++i) {
3636 if (xp_set.val.nodes[i].type == LYXP_NODE_ELEM) {
Radek Krejci3d92e442020-10-12 12:48:13 +02003637 ret = ly_set_add(*set, xp_set.val.nodes[i].node, 1, NULL);
Radek Krejciba03a5a2020-08-27 14:40:41 +02003638 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskoccc02342020-05-21 10:09:21 +02003639 }
3640 }
3641 }
3642
3643cleanup:
Michal Vasko0691d522020-05-21 13:21:47 +02003644 lyxp_set_free_content(&xp_set);
Michal Vaskob7be7a82020-08-20 09:09:04 +02003645 lyxp_expr_free((struct ly_ctx *)LYD_CTX(ctx_node), exp);
Radek Krejci8f45abc2020-11-26 12:15:13 +01003646 if (ret) {
3647 ly_set_free(*set, NULL);
3648 *set = NULL;
3649 }
Michal Vaskoccc02342020-05-21 10:09:21 +02003650 return ret;
3651}
Radek Krejcica989142020-11-05 11:32:22 +01003652
Michal Vasko3e1f6552021-01-14 09:27:55 +01003653API LY_ERR
3654lyd_find_path(const struct lyd_node *ctx_node, const char *path, ly_bool output, struct lyd_node **match)
3655{
3656 LY_ERR ret = LY_SUCCESS;
3657 struct lyxp_expr *expr = NULL;
3658 struct ly_path *lypath = NULL;
3659
3660 LY_CHECK_ARG_RET(NULL, ctx_node, ctx_node->schema, path, LY_EINVAL);
3661
3662 /* parse the path */
3663 ret = ly_path_parse(LYD_CTX(ctx_node), ctx_node->schema, path, strlen(path), LY_PATH_BEGIN_EITHER, LY_PATH_LREF_FALSE,
3664 LY_PATH_PREFIX_OPTIONAL, LY_PATH_PRED_SIMPLE, &expr);
3665 LY_CHECK_GOTO(ret, cleanup);
3666
3667 /* compile the path */
3668 ret = ly_path_compile(LYD_CTX(ctx_node), NULL, ctx_node->schema, expr, LY_PATH_LREF_FALSE,
3669 output ? LY_PATH_OPER_OUTPUT : LY_PATH_OPER_INPUT, LY_PATH_TARGET_SINGLE, LY_PREF_JSON,
3670 (void *)LYD_CTX(ctx_node), NULL, &lypath);
3671 LY_CHECK_GOTO(ret, cleanup);
3672
3673 /* evaluate the path */
3674 ret = ly_path_eval_partial(lypath, ctx_node, NULL, match);
3675
3676cleanup:
3677 lyxp_expr_free(LYD_CTX(ctx_node), expr);
3678 ly_path_free(LYD_CTX(ctx_node), lypath);
3679 return ret;
3680}
3681
Radek Krejcica989142020-11-05 11:32:22 +01003682API uint32_t
3683lyd_list_pos(const struct lyd_node *instance)
3684{
3685 const struct lyd_node *iter = NULL;
3686 uint32_t pos = 0;
3687
3688 if (!instance || !(instance->schema->nodetype & (LYS_LIST | LYS_LEAFLIST))) {
3689 return 0;
3690 }
3691
3692 /* data instances are ordered, so we can stop when we found instance of other schema node */
3693 for (iter = instance; iter->schema == instance->schema; iter = iter->prev) {
Radek Krejcibb27df32020-11-13 15:39:16 +01003694 if (pos && (iter->next == NULL)) {
Radek Krejcica989142020-11-05 11:32:22 +01003695 /* overrun to the end of the siblings list */
3696 break;
3697 }
3698 ++pos;
3699 }
3700
3701 return pos;
3702}
Radek Krejci4233f9b2020-11-05 12:38:35 +01003703
3704API struct lyd_node *
3705lyd_first_sibling(const struct lyd_node *node)
3706{
3707 struct lyd_node *start;
3708
3709 if (!node) {
3710 return NULL;
3711 }
3712
3713 /* get the first sibling */
3714 if (node->parent) {
3715 start = node->parent->child;
3716 } else {
Radek Krejcibb27df32020-11-13 15:39:16 +01003717 for (start = (struct lyd_node *)node; start->prev->next; start = start->prev) {}
Radek Krejci4233f9b2020-11-05 12:38:35 +01003718 }
3719
3720 return start;
3721}