blob: e633297472c6f8896005287e1f9d394c142cbabd [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 Vasko1e4c68e2021-02-18 15:03:01 +0100334 rc = lyd_parse_xml(ctx, parent, first_p, in, parse_opts, val_opts, LYD_TYPE_DATA_YANG, NULL, &parsed, &lydctx);
Radek Krejci1798aae2020-07-14 13:26:06 +0200335 break;
Radek Krejci7931b192020-06-25 17:05:03 +0200336 case LYD_JSON:
Michal Vasko1e4c68e2021-02-18 15:03:01 +0100337 rc = lyd_parse_json(ctx, parent, first_p, in, parse_opts, val_opts, LYD_TYPE_DATA_YANG, &parsed, &lydctx);
Radek Krejci1798aae2020-07-14 13:26:06 +0200338 break;
Radek Krejci7931b192020-06-25 17:05:03 +0200339 case LYD_LYB:
Michal Vasko1e4c68e2021-02-18 15:03:01 +0100340 rc = lyd_parse_lyb(ctx, parent, first_p, in, parse_opts, val_opts, LYD_TYPE_DATA_YANG, &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 */
Michal Vasko1e4c68e2021-02-18 15:03:01 +0100465 if ((data_type == LYD_TYPE_RPC_NETCONF) || (data_type == LYD_TYPE_NOTIF_NETCONF)) {
Michal Vaskoe0665742021-02-11 11:08:44 +0100466 LY_CHECK_ARG_RET(ctx, format == LYD_XML, !parent, tree, op, LY_EINVAL);
Michal Vasko1e4c68e2021-02-18 15:03:01 +0100467 } else if (data_type == LYD_TYPE_REPLY_NETCONF) {
468 LY_CHECK_ARG_RET(ctx, format == LYD_XML, parent, parent->schema->nodetype & (LYS_RPC | LYS_ACTION), tree, !op,
469 LY_EINVAL);
Michal Vaskoe0665742021-02-11 11:08:44 +0100470 }
471 parse_opts = LYD_PARSE_ONLY | LYD_PARSE_STRICT;
472 val_opts = 0;
473
474 /* parse the data */
Radek Krejci7931b192020-06-25 17:05:03 +0200475 switch (format) {
476 case LYD_XML:
Michal Vaskoe0665742021-02-11 11:08:44 +0100477 rc = lyd_parse_xml(ctx, parent, &first, in, parse_opts, val_opts, data_type, &envp, &parsed, &lydctx);
Michal Vasko299d5d12021-02-16 16:36:37 +0100478 if (rc && envp) {
479 /* special situation when the envelopes were parsed successfully */
480 if (tree) {
481 *tree = envp;
482 }
483 ly_set_erase(&parsed, NULL);
484 return rc;
485 }
Michal Vaskoe0665742021-02-11 11:08:44 +0100486 break;
Radek Krejci7931b192020-06-25 17:05:03 +0200487 case LYD_JSON:
Michal Vaskoe0665742021-02-11 11:08:44 +0100488 rc = lyd_parse_json(ctx, parent, &first, in, parse_opts, val_opts, data_type, &parsed, &lydctx);
489 break;
Radek Krejci7931b192020-06-25 17:05:03 +0200490 case LYD_LYB:
Michal Vaskoe0665742021-02-11 11:08:44 +0100491 rc = lyd_parse_lyb(ctx, parent, &first, in, parse_opts, val_opts, data_type, &parsed, &lydctx);
492 break;
Michal Vaskoc8a230d2020-08-14 12:17:10 +0200493 case LYD_UNKNOWN:
Michal Vaskod74978f2021-02-12 11:59:36 +0100494 LOGARG(ctx, format);
495 rc = LY_EINVAL;
Michal Vaskoc8a230d2020-08-14 12:17:10 +0200496 break;
Radek Krejci7931b192020-06-25 17:05:03 +0200497 }
Michal Vaskoe0665742021-02-11 11:08:44 +0100498 LY_CHECK_GOTO(rc, cleanup);
Radek Krejci7931b192020-06-25 17:05:03 +0200499
Michal Vaskoe0665742021-02-11 11:08:44 +0100500 /* set out params correctly */
501 if (tree) {
502 if (envp) {
503 /* special out param meaning */
504 *tree = envp;
505 } else {
506 *tree = parent ? NULL : first;
507 }
508 }
509 if (op) {
510 *op = lydctx->op_node;
511 }
512
513cleanup:
514 if (lydctx) {
515 lydctx->free(lydctx);
516 }
517 if (rc) {
518 if (parent) {
519 /* free all the parsed subtrees */
520 for (i = 0; i < parsed.count; ++i) {
521 lyd_free_tree(parsed.dnodes[i]);
522 }
523 } else {
524 /* free everything (cannot occur in the current code, a safety) */
525 lyd_free_all(first);
526 if (tree) {
527 *tree = NULL;
528 }
529 if (op) {
530 *op = NULL;
531 }
532 }
533 }
534 ly_set_erase(&parsed, NULL);
535 return rc;
Radek Krejcie7b95092019-05-15 11:03:07 +0200536}
Radek Krejci084289f2019-07-09 17:35:30 +0200537
Michal Vasko90932a92020-02-12 14:33:03 +0100538LY_ERR
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200539lyd_create_term(const struct lysc_node *schema, const char *value, size_t value_len, ly_bool *dynamic,
540 LY_PREFIX_FORMAT format, void *prefix_data, uint32_t hints, ly_bool *incomplete, struct lyd_node **node)
Michal Vasko90932a92020-02-12 14:33:03 +0100541{
542 LY_ERR ret;
543 struct lyd_node_term *term;
544
Michal Vasko9b368d32020-02-14 13:53:31 +0100545 assert(schema->nodetype & LYD_NODE_TERM);
546
Michal Vasko90932a92020-02-12 14:33:03 +0100547 term = calloc(1, sizeof *term);
548 LY_CHECK_ERR_RET(!term, LOGMEM(schema->module->ctx), LY_EMEM);
549
550 term->schema = schema;
Michal Vasko9e685082021-01-29 14:49:09 +0100551 term->prev = &term->node;
Michal Vasko9b368d32020-02-14 13:53:31 +0100552 term->flags = LYD_NEW;
Michal Vasko90932a92020-02-12 14:33:03 +0100553
Radek Krejciddace2c2021-01-08 11:30:56 +0100554 LOG_LOCSET(schema, NULL, NULL, NULL);
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200555 ret = lyd_value_store(schema->module->ctx, &term->value, ((struct lysc_node_leaf *)term->schema)->type, value,
Radek Krejci2efc45b2020-12-22 16:25:44 +0100556 value_len, dynamic, format, prefix_data, hints, schema, incomplete);
Radek Krejciddace2c2021-01-08 11:30:56 +0100557 LOG_LOCBACK(1, 0, 0, 0);
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200558 LY_CHECK_ERR_RET(ret, free(term), ret);
Michal Vasko9e685082021-01-29 14:49:09 +0100559 lyd_hash(&term->node);
Michal Vasko9b368d32020-02-14 13:53:31 +0100560
Michal Vasko9e685082021-01-29 14:49:09 +0100561 *node = &term->node;
Michal Vasko9b368d32020-02-14 13:53:31 +0100562 return ret;
563}
564
565LY_ERR
566lyd_create_term2(const struct lysc_node *schema, const struct lyd_value *val, struct lyd_node **node)
567{
568 LY_ERR ret;
569 struct lyd_node_term *term;
570 struct lysc_type *type;
571
572 assert(schema->nodetype & LYD_NODE_TERM);
Michal Vaskoba99a3e2020-08-18 15:50:05 +0200573 assert(val && val->canonical && val->realtype);
Michal Vasko9b368d32020-02-14 13:53:31 +0100574
575 term = calloc(1, sizeof *term);
576 LY_CHECK_ERR_RET(!term, LOGMEM(schema->module->ctx), LY_EMEM);
577
578 term->schema = schema;
Michal Vasko9e685082021-01-29 14:49:09 +0100579 term->prev = &term->node;
Michal Vasko9b368d32020-02-14 13:53:31 +0100580 term->flags = LYD_NEW;
581
582 type = ((struct lysc_node_leaf *)schema)->type;
583 ret = type->plugin->duplicate(schema->module->ctx, val, &term->value);
584 if (ret) {
585 LOGERR(schema->module->ctx, ret, "Value duplication failed.");
586 free(term);
587 return ret;
588 }
Michal Vasko9e685082021-01-29 14:49:09 +0100589 lyd_hash(&term->node);
Michal Vasko90932a92020-02-12 14:33:03 +0100590
Michal Vasko9e685082021-01-29 14:49:09 +0100591 *node = &term->node;
Michal Vasko90932a92020-02-12 14:33:03 +0100592 return ret;
593}
594
595LY_ERR
596lyd_create_inner(const struct lysc_node *schema, struct lyd_node **node)
597{
598 struct lyd_node_inner *in;
599
Michal Vasko9b368d32020-02-14 13:53:31 +0100600 assert(schema->nodetype & LYD_NODE_INNER);
601
Michal Vasko90932a92020-02-12 14:33:03 +0100602 in = calloc(1, sizeof *in);
603 LY_CHECK_ERR_RET(!in, LOGMEM(schema->module->ctx), LY_EMEM);
604
605 in->schema = schema;
Michal Vasko9e685082021-01-29 14:49:09 +0100606 in->prev = &in->node;
Michal Vasko9b368d32020-02-14 13:53:31 +0100607 in->flags = LYD_NEW;
Michal Vasko3383be72020-11-03 17:15:31 +0100608 if ((schema->nodetype == LYS_CONTAINER) && !(schema->flags & LYS_PRESENCE)) {
609 in->flags |= LYD_DEFAULT;
610 }
Michal Vasko90932a92020-02-12 14:33:03 +0100611
Michal Vasko9b368d32020-02-14 13:53:31 +0100612 /* do not hash list with keys, we need them for the hash */
613 if ((schema->nodetype != LYS_LIST) || (schema->flags & LYS_KEYLESS)) {
Michal Vasko9e685082021-01-29 14:49:09 +0100614 lyd_hash(&in->node);
Michal Vasko9b368d32020-02-14 13:53:31 +0100615 }
Michal Vasko90932a92020-02-12 14:33:03 +0100616
Michal Vasko9e685082021-01-29 14:49:09 +0100617 *node = &in->node;
Michal Vasko90932a92020-02-12 14:33:03 +0100618 return LY_SUCCESS;
619}
620
Michal Vasko90932a92020-02-12 14:33:03 +0100621LY_ERR
Michal Vasko004d3152020-06-11 19:59:22 +0200622lyd_create_list(const struct lysc_node *schema, const struct ly_path_predicate *predicates, struct lyd_node **node)
Michal Vasko90932a92020-02-12 14:33:03 +0100623{
624 LY_ERR ret = LY_SUCCESS;
Michal Vasko90932a92020-02-12 14:33:03 +0100625 struct lyd_node *list = NULL, *key;
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200626 LY_ARRAY_COUNT_TYPE u;
Michal Vasko90932a92020-02-12 14:33:03 +0100627
Michal Vasko004d3152020-06-11 19:59:22 +0200628 assert((schema->nodetype == LYS_LIST) && !(schema->flags & LYS_KEYLESS));
Michal Vasko90932a92020-02-12 14:33:03 +0100629
630 /* create list */
631 LY_CHECK_GOTO(ret = lyd_create_inner(schema, &list), cleanup);
632
Radek Krejciddace2c2021-01-08 11:30:56 +0100633 LOG_LOCSET(NULL, list, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100634
Michal Vasko90932a92020-02-12 14:33:03 +0100635 /* create and insert all the keys */
Michal Vasko004d3152020-06-11 19:59:22 +0200636 LY_ARRAY_FOR(predicates, u) {
637 LY_CHECK_GOTO(ret = lyd_create_term2(predicates[u].key, &predicates[u].value, &key), cleanup);
Michal Vasko90932a92020-02-12 14:33:03 +0100638 lyd_insert_node(list, NULL, key);
639 }
640
Michal Vasko9b368d32020-02-14 13:53:31 +0100641 /* hash having all the keys */
642 lyd_hash(list);
643
Michal Vasko90932a92020-02-12 14:33:03 +0100644 /* success */
645 *node = list;
646 list = NULL;
647
648cleanup:
Radek Krejciddace2c2021-01-08 11:30:56 +0100649 LOG_LOCBACK(0, 1, 0, 0);
Michal Vasko90932a92020-02-12 14:33:03 +0100650 lyd_free_tree(list);
Michal Vasko004d3152020-06-11 19:59:22 +0200651 return ret;
652}
653
654static LY_ERR
655lyd_create_list2(const struct lysc_node *schema, const char *keys, size_t keys_len, struct lyd_node **node)
656{
657 LY_ERR ret = LY_SUCCESS;
658 struct lyxp_expr *expr = NULL;
659 uint16_t exp_idx = 0;
660 enum ly_path_pred_type pred_type = 0;
661 struct ly_path_predicate *predicates = NULL;
662
Radek Krejciddace2c2021-01-08 11:30:56 +0100663 LOG_LOCSET(schema, NULL, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100664
Michal Vasko004d3152020-06-11 19:59:22 +0200665 /* parse keys */
Michal Vasko6b26e742020-07-17 15:02:10 +0200666 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 +0200667 LY_PATH_PRED_KEYS, &expr), cleanup);
Michal Vasko004d3152020-06-11 19:59:22 +0200668
669 /* compile them */
Michal Vasko5d24f6c2020-10-13 13:49:06 +0200670 LY_CHECK_GOTO(ret = ly_path_compile_predicate(schema->module->ctx, NULL, NULL, schema, expr, &exp_idx, LY_PREF_JSON,
671 NULL, &predicates, &pred_type), cleanup);
Michal Vasko004d3152020-06-11 19:59:22 +0200672
673 /* create the list node */
674 LY_CHECK_GOTO(ret = lyd_create_list(schema, predicates, node), cleanup);
675
676cleanup:
Radek Krejciddace2c2021-01-08 11:30:56 +0100677 LOG_LOCBACK(1, 0, 0, 0);
Michal Vasko004d3152020-06-11 19:59:22 +0200678 lyxp_expr_free(schema->module->ctx, expr);
Michal Vaskof7e16e22020-10-21 09:24:39 +0200679 ly_path_predicates_free(schema->module->ctx, pred_type, predicates);
Michal Vasko90932a92020-02-12 14:33:03 +0100680 return ret;
681}
682
683LY_ERR
Michal Vasko366a4a12020-12-04 16:23:57 +0100684lyd_create_any(const struct lysc_node *schema, const void *value, LYD_ANYDATA_VALUETYPE value_type, ly_bool use_value,
685 struct lyd_node **node)
Michal Vasko90932a92020-02-12 14:33:03 +0100686{
Michal Vasko366a4a12020-12-04 16:23:57 +0100687 LY_ERR ret;
Michal Vasko90932a92020-02-12 14:33:03 +0100688 struct lyd_node_any *any;
Michal Vasko366a4a12020-12-04 16:23:57 +0100689 union lyd_any_value any_val;
Michal Vasko90932a92020-02-12 14:33:03 +0100690
Michal Vasko9b368d32020-02-14 13:53:31 +0100691 assert(schema->nodetype & LYD_NODE_ANY);
692
Michal Vasko90932a92020-02-12 14:33:03 +0100693 any = calloc(1, sizeof *any);
694 LY_CHECK_ERR_RET(!any, LOGMEM(schema->module->ctx), LY_EMEM);
695
696 any->schema = schema;
Michal Vasko9e685082021-01-29 14:49:09 +0100697 any->prev = &any->node;
Michal Vasko9b368d32020-02-14 13:53:31 +0100698 any->flags = LYD_NEW;
Michal Vasko90932a92020-02-12 14:33:03 +0100699
Radek Krejci1798aae2020-07-14 13:26:06 +0200700 /* TODO: convert XML/JSON strings into a opaq data tree */
Michal Vasko366a4a12020-12-04 16:23:57 +0100701
702 if (use_value) {
703 any->value.str = value;
704 any->value_type = value_type;
705 } else {
706 any_val.str = value;
Michal Vasko9e685082021-01-29 14:49:09 +0100707 ret = lyd_any_copy_value(&any->node, &any_val, value_type);
Michal Vasko366a4a12020-12-04 16:23:57 +0100708 LY_CHECK_ERR_RET(ret, free(any), ret);
709 }
Michal Vasko9e685082021-01-29 14:49:09 +0100710 lyd_hash(&any->node);
Michal Vasko90932a92020-02-12 14:33:03 +0100711
Michal Vasko9e685082021-01-29 14:49:09 +0100712 *node = &any->node;
Michal Vasko90932a92020-02-12 14:33:03 +0100713 return LY_SUCCESS;
714}
715
Michal Vasko52927e22020-03-16 17:26:14 +0100716LY_ERR
Michal Vasko501af032020-11-11 20:27:44 +0100717lyd_create_opaq(const struct ly_ctx *ctx, const char *name, size_t name_len, const char *prefix, size_t pref_len,
718 const char *module_key, size_t module_key_len, const char *value, size_t value_len, ly_bool *dynamic,
719 LY_PREFIX_FORMAT format, void *val_prefix_data, uint32_t hints, struct lyd_node **node)
Michal Vasko52927e22020-03-16 17:26:14 +0100720{
Radek Krejci011e4aa2020-09-04 15:22:31 +0200721 LY_ERR ret = LY_SUCCESS;
Michal Vasko52927e22020-03-16 17:26:14 +0100722 struct lyd_node_opaq *opaq;
723
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200724 assert(ctx && name && name_len && format);
Michal Vasko52927e22020-03-16 17:26:14 +0100725
726 if (!value_len) {
727 value = "";
728 }
729
730 opaq = calloc(1, sizeof *opaq);
Michal Vasko501af032020-11-11 20:27:44 +0100731 LY_CHECK_ERR_GOTO(!opaq, LOGMEM(ctx); ret = LY_EMEM, finish);
Michal Vasko52927e22020-03-16 17:26:14 +0100732
Michal Vasko9e685082021-01-29 14:49:09 +0100733 opaq->prev = &opaq->node;
Michal Vaskoad92b672020-11-12 13:11:31 +0100734 LY_CHECK_GOTO(ret = lydict_insert(ctx, name, name_len, &opaq->name.name), finish);
Radek Krejci011e4aa2020-09-04 15:22:31 +0200735
Michal Vasko52927e22020-03-16 17:26:14 +0100736 if (pref_len) {
Michal Vaskoad92b672020-11-12 13:11:31 +0100737 LY_CHECK_GOTO(ret = lydict_insert(ctx, prefix, pref_len, &opaq->name.prefix), finish);
Michal Vasko52927e22020-03-16 17:26:14 +0100738 }
Radek Krejci1798aae2020-07-14 13:26:06 +0200739 if (module_key_len) {
Michal Vaskoad92b672020-11-12 13:11:31 +0100740 LY_CHECK_GOTO(ret = lydict_insert(ctx, module_key, module_key_len, &opaq->name.module_ns), finish);
Radek Krejci1798aae2020-07-14 13:26:06 +0200741 }
Michal Vasko52927e22020-03-16 17:26:14 +0100742 if (dynamic && *dynamic) {
Radek Krejci011e4aa2020-09-04 15:22:31 +0200743 LY_CHECK_GOTO(ret = lydict_insert_zc(ctx, (char *)value, &opaq->value), finish);
Michal Vasko52927e22020-03-16 17:26:14 +0100744 *dynamic = 0;
745 } else {
Radek Krejci011e4aa2020-09-04 15:22:31 +0200746 LY_CHECK_GOTO(ret = lydict_insert(ctx, value, value_len, &opaq->value), finish);
Michal Vasko52927e22020-03-16 17:26:14 +0100747 }
Michal Vasko501af032020-11-11 20:27:44 +0100748
749 opaq->format = format;
750 opaq->val_prefix_data = val_prefix_data;
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200751 opaq->hints = hints;
Michal Vasko52927e22020-03-16 17:26:14 +0100752 opaq->ctx = ctx;
753
Radek Krejci011e4aa2020-09-04 15:22:31 +0200754finish:
755 if (ret) {
Michal Vasko9e685082021-01-29 14:49:09 +0100756 lyd_free_tree(&opaq->node);
Michal Vasko501af032020-11-11 20:27:44 +0100757 ly_free_prefix_data(format, val_prefix_data);
Radek Krejci011e4aa2020-09-04 15:22:31 +0200758 } else {
Michal Vasko9e685082021-01-29 14:49:09 +0100759 *node = &opaq->node;
Radek Krejci011e4aa2020-09-04 15:22:31 +0200760 }
761 return ret;
Michal Vasko52927e22020-03-16 17:26:14 +0100762}
763
Michal Vasko3a41dff2020-07-15 14:30:28 +0200764API LY_ERR
Michal Vasko65243892020-12-04 16:26:21 +0100765lyd_new_inner(struct lyd_node *parent, const struct lys_module *module, const char *name, ly_bool output,
766 struct lyd_node **node)
Michal Vasko013a8182020-03-03 10:46:53 +0100767{
768 struct lyd_node *ret = NULL;
769 const struct lysc_node *schema;
770 struct ly_ctx *ctx = parent ? parent->schema->module->ctx : (module ? module->ctx : NULL);
771
Michal Vasko6027eb92020-07-15 16:37:30 +0200772 LY_CHECK_ARG_RET(ctx, parent || module, parent || node, name, LY_EINVAL);
Michal Vasko013a8182020-03-03 10:46:53 +0100773
Michal Vaskof03ed032020-03-04 13:31:44 +0100774 if (!module) {
775 module = parent->schema->module;
776 }
777
Michal Vasko3a41dff2020-07-15 14:30:28 +0200778 schema = lys_find_child(parent ? parent->schema : NULL, module, name, 0,
Radek Krejci41ac9942020-11-02 14:47:56 +0100779 LYS_CONTAINER | LYS_NOTIF | LYS_RPC | LYS_ACTION, output ? LYS_GETNEXT_OUTPUT : 0);
Michal Vasko3a41dff2020-07-15 14:30:28 +0200780 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 +0100781
Michal Vasko3a41dff2020-07-15 14:30:28 +0200782 LY_CHECK_RET(lyd_create_inner(schema, &ret));
783 if (parent) {
Michal Vasko013a8182020-03-03 10:46:53 +0100784 lyd_insert_node(parent, NULL, ret);
785 }
Michal Vasko3a41dff2020-07-15 14:30:28 +0200786
787 if (node) {
788 *node = ret;
789 }
790 return LY_SUCCESS;
Michal Vasko013a8182020-03-03 10:46:53 +0100791}
792
Michal Vasko3a41dff2020-07-15 14:30:28 +0200793API LY_ERR
Michal Vasko65243892020-12-04 16:26:21 +0100794lyd_new_list(struct lyd_node *parent, const struct lys_module *module, const char *name, ly_bool output,
795 struct lyd_node **node, ...)
Michal Vasko013a8182020-03-03 10:46:53 +0100796{
797 struct lyd_node *ret = NULL, *key;
798 const struct lysc_node *schema, *key_s;
799 struct ly_ctx *ctx = parent ? parent->schema->module->ctx : (module ? module->ctx : NULL);
800 va_list ap;
801 const char *key_val;
802 LY_ERR rc = LY_SUCCESS;
803
Michal Vasko6027eb92020-07-15 16:37:30 +0200804 LY_CHECK_ARG_RET(ctx, parent || module, parent || node, name, LY_EINVAL);
Michal Vasko013a8182020-03-03 10:46:53 +0100805
Michal Vaskof03ed032020-03-04 13:31:44 +0100806 if (!module) {
807 module = parent->schema->module;
808 }
809
Radek Krejci41ac9942020-11-02 14:47:56 +0100810 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 +0200811 LY_CHECK_ERR_RET(!schema, LOGERR(ctx, LY_EINVAL, "List node \"%s\" not found.", name), LY_ENOTFOUND);
Michal Vasko013a8182020-03-03 10:46:53 +0100812
813 /* create list inner node */
Michal Vasko3a41dff2020-07-15 14:30:28 +0200814 LY_CHECK_RET(lyd_create_inner(schema, &ret));
Michal Vasko013a8182020-03-03 10:46:53 +0100815
Michal Vasko3a41dff2020-07-15 14:30:28 +0200816 va_start(ap, node);
Michal Vasko013a8182020-03-03 10:46:53 +0100817
818 /* create and insert all the keys */
Michal Vasko544e58a2021-01-28 14:33:41 +0100819 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 +0100820 key_val = va_arg(ap, const char *);
821
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200822 rc = lyd_create_term(key_s, key_val, key_val ? strlen(key_val) : 0, NULL, LY_PREF_JSON, NULL, LYD_HINT_DATA,
823 NULL, &key);
824 LY_CHECK_GOTO(rc, cleanup);
Michal Vasko013a8182020-03-03 10:46:53 +0100825 lyd_insert_node(ret, NULL, key);
826 }
827
Michal Vasko013a8182020-03-03 10:46:53 +0100828 if (parent) {
829 lyd_insert_node(parent, NULL, ret);
830 }
831
832cleanup:
Michal Vasko3a41dff2020-07-15 14:30:28 +0200833 va_end(ap);
Michal Vasko013a8182020-03-03 10:46:53 +0100834 if (rc) {
835 lyd_free_tree(ret);
836 ret = NULL;
Michal Vasko3a41dff2020-07-15 14:30:28 +0200837 } else if (node) {
838 *node = ret;
Michal Vasko013a8182020-03-03 10:46:53 +0100839 }
Michal Vasko3a41dff2020-07-15 14:30:28 +0200840 return rc;
Michal Vasko013a8182020-03-03 10:46:53 +0100841}
842
Michal Vasko3a41dff2020-07-15 14:30:28 +0200843API LY_ERR
844lyd_new_list2(struct lyd_node *parent, const struct lys_module *module, const char *name, const char *keys,
Radek Krejci41ac9942020-11-02 14:47:56 +0100845 ly_bool output, struct lyd_node **node)
Michal Vasko013a8182020-03-03 10:46:53 +0100846{
847 struct lyd_node *ret = NULL;
848 const struct lysc_node *schema;
849 struct ly_ctx *ctx = parent ? parent->schema->module->ctx : (module ? module->ctx : NULL);
850
Michal Vasko6027eb92020-07-15 16:37:30 +0200851 LY_CHECK_ARG_RET(ctx, parent || module, parent || node, name, LY_EINVAL);
Michal Vasko013a8182020-03-03 10:46:53 +0100852
Michal Vaskof03ed032020-03-04 13:31:44 +0100853 if (!module) {
854 module = parent->schema->module;
855 }
Michal Vasko004d3152020-06-11 19:59:22 +0200856 if (!keys) {
857 keys = "";
858 }
Michal Vaskof03ed032020-03-04 13:31:44 +0100859
Michal Vasko004d3152020-06-11 19:59:22 +0200860 /* find schema node */
Radek Krejci41ac9942020-11-02 14:47:56 +0100861 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 +0200862 LY_CHECK_ERR_RET(!schema, LOGERR(ctx, LY_EINVAL, "List node \"%s\" not found.", name), LY_ENOTFOUND);
Michal Vasko013a8182020-03-03 10:46:53 +0100863
Michal Vasko004d3152020-06-11 19:59:22 +0200864 if ((schema->flags & LYS_KEYLESS) && !keys[0]) {
865 /* key-less list */
Michal Vasko3a41dff2020-07-15 14:30:28 +0200866 LY_CHECK_RET(lyd_create_inner(schema, &ret));
Michal Vasko004d3152020-06-11 19:59:22 +0200867 } else {
868 /* create the list node */
Michal Vasko3a41dff2020-07-15 14:30:28 +0200869 LY_CHECK_RET(lyd_create_list2(schema, keys, strlen(keys), &ret));
Michal Vasko004d3152020-06-11 19:59:22 +0200870 }
Michal Vasko004d3152020-06-11 19:59:22 +0200871 if (parent) {
Michal Vasko013a8182020-03-03 10:46:53 +0100872 lyd_insert_node(parent, NULL, ret);
873 }
Michal Vasko3a41dff2020-07-15 14:30:28 +0200874
875 if (node) {
876 *node = ret;
877 }
878 return LY_SUCCESS;
Michal Vasko013a8182020-03-03 10:46:53 +0100879}
880
Michal Vasko3a41dff2020-07-15 14:30:28 +0200881API LY_ERR
882lyd_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 +0100883 ly_bool output, struct lyd_node **node)
Michal Vasko013a8182020-03-03 10:46:53 +0100884{
Michal Vaskocbff3e92020-05-27 12:56:41 +0200885 LY_ERR rc;
Michal Vasko013a8182020-03-03 10:46:53 +0100886 struct lyd_node *ret = NULL;
887 const struct lysc_node *schema;
888 struct ly_ctx *ctx = parent ? parent->schema->module->ctx : (module ? module->ctx : NULL);
889
Michal Vasko6027eb92020-07-15 16:37:30 +0200890 LY_CHECK_ARG_RET(ctx, parent || module, parent || node, name, LY_EINVAL);
Michal Vasko013a8182020-03-03 10:46:53 +0100891
Michal Vaskof03ed032020-03-04 13:31:44 +0100892 if (!module) {
893 module = parent->schema->module;
894 }
895
Radek Krejci41ac9942020-11-02 14:47:56 +0100896 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 +0200897 LY_CHECK_ERR_RET(!schema, LOGERR(ctx, LY_EINVAL, "Term node \"%s\" not found.", name), LY_ENOTFOUND);
Michal Vasko013a8182020-03-03 10:46:53 +0100898
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200899 rc = lyd_create_term(schema, val_str, val_str ? strlen(val_str) : 0, NULL, LY_PREF_JSON, NULL, LYD_HINT_DATA, NULL,
900 &ret);
901 LY_CHECK_RET(rc);
Michal Vaskocbff3e92020-05-27 12:56:41 +0200902 if (parent) {
Michal Vasko013a8182020-03-03 10:46:53 +0100903 lyd_insert_node(parent, NULL, ret);
904 }
Michal Vasko3a41dff2020-07-15 14:30:28 +0200905
906 if (node) {
907 *node = ret;
908 }
909 return LY_SUCCESS;
Michal Vasko013a8182020-03-03 10:46:53 +0100910}
911
Michal Vasko3a41dff2020-07-15 14:30:28 +0200912API LY_ERR
Michal Vasko219006c2020-12-04 16:26:52 +0100913lyd_new_any(struct lyd_node *parent, const struct lys_module *module, const char *name, void *value,
Radek Krejci41ac9942020-11-02 14:47:56 +0100914 LYD_ANYDATA_VALUETYPE value_type, ly_bool output, struct lyd_node **node)
Michal Vasko013a8182020-03-03 10:46:53 +0100915{
916 struct lyd_node *ret = NULL;
917 const struct lysc_node *schema;
918 struct ly_ctx *ctx = parent ? parent->schema->module->ctx : (module ? module->ctx : NULL);
919
Michal Vasko6027eb92020-07-15 16:37:30 +0200920 LY_CHECK_ARG_RET(ctx, parent || module, parent || node, name, LY_EINVAL);
Michal Vasko013a8182020-03-03 10:46:53 +0100921
Michal Vaskof03ed032020-03-04 13:31:44 +0100922 if (!module) {
923 module = parent->schema->module;
924 }
925
Radek Krejci41ac9942020-11-02 14:47:56 +0100926 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 +0200927 LY_CHECK_ERR_RET(!schema, LOGERR(ctx, LY_EINVAL, "Any node \"%s\" not found.", name), LY_ENOTFOUND);
Michal Vasko013a8182020-03-03 10:46:53 +0100928
Michal Vasko366a4a12020-12-04 16:23:57 +0100929 LY_CHECK_RET(lyd_create_any(schema, value, value_type, 1, &ret));
Michal Vasko3a41dff2020-07-15 14:30:28 +0200930 if (parent) {
Michal Vasko013a8182020-03-03 10:46:53 +0100931 lyd_insert_node(parent, NULL, ret);
932 }
Michal Vasko3a41dff2020-07-15 14:30:28 +0200933
934 if (node) {
935 *node = ret;
936 }
937 return LY_SUCCESS;
Michal Vasko013a8182020-03-03 10:46:53 +0100938}
939
Michal Vasko4490d312020-06-16 13:08:55 +0200940/**
941 * @brief Update node value.
942 *
943 * @param[in] node Node to update.
944 * @param[in] value New value to set.
945 * @param[in] value_type Type of @p value for any node.
946 * @param[out] new_parent Set to @p node if the value was updated, otherwise set to NULL.
947 * @param[out] new_node Set to @p node if the value was updated, otherwise set to NULL.
948 * @return LY_ERR value.
949 */
Michal Vasko00cbf532020-06-15 13:58:47 +0200950static LY_ERR
951lyd_new_path_update(struct lyd_node *node, const void *value, LYD_ANYDATA_VALUETYPE value_type,
Radek Krejci0f969882020-08-21 16:56:47 +0200952 struct lyd_node **new_parent, struct lyd_node **new_node)
Michal Vasko00cbf532020-06-15 13:58:47 +0200953{
954 LY_ERR ret = LY_SUCCESS;
955 struct lyd_node *new_any;
956
957 switch (node->schema->nodetype) {
958 case LYS_CONTAINER:
959 case LYS_NOTIF:
960 case LYS_RPC:
961 case LYS_ACTION:
962 case LYS_LIST:
963 case LYS_LEAFLIST:
964 /* if it exists, there is nothing to update */
965 *new_parent = NULL;
966 *new_node = NULL;
967 break;
968 case LYS_LEAF:
969 ret = lyd_change_term(node, value);
970 if ((ret == LY_SUCCESS) || (ret == LY_EEXIST)) {
971 /* there was an actual change (at least of the default flag) */
972 *new_parent = node;
973 *new_node = node;
974 ret = LY_SUCCESS;
975 } else if (ret == LY_ENOT) {
976 /* no change */
977 *new_parent = NULL;
978 *new_node = NULL;
979 ret = LY_SUCCESS;
980 } /* else error */
981 break;
982 case LYS_ANYDATA:
983 case LYS_ANYXML:
984 /* create a new any node */
Michal Vasko366a4a12020-12-04 16:23:57 +0100985 LY_CHECK_RET(lyd_create_any(node->schema, value, value_type, 0, &new_any));
Michal Vasko00cbf532020-06-15 13:58:47 +0200986
987 /* compare with the existing one */
Michal Vasko8f359bf2020-07-28 10:41:15 +0200988 if (lyd_compare_single(node, new_any, 0)) {
Michal Vasko00cbf532020-06-15 13:58:47 +0200989 /* not equal, switch values (so that we can use generic node free) */
990 ((struct lyd_node_any *)new_any)->value = ((struct lyd_node_any *)node)->value;
991 ((struct lyd_node_any *)new_any)->value_type = ((struct lyd_node_any *)node)->value_type;
992 ((struct lyd_node_any *)node)->value.str = value;
993 ((struct lyd_node_any *)node)->value_type = value_type;
994
995 *new_parent = node;
996 *new_node = node;
997 } else {
998 /* they are equal */
999 *new_parent = NULL;
1000 *new_node = NULL;
1001 }
1002 lyd_free_tree(new_any);
1003 break;
1004 default:
Michal Vaskob7be7a82020-08-20 09:09:04 +02001005 LOGINT(LYD_CTX(node));
Michal Vasko00cbf532020-06-15 13:58:47 +02001006 ret = LY_EINT;
1007 break;
1008 }
1009
1010 return ret;
1011}
1012
Michal Vasko3a41dff2020-07-15 14:30:28 +02001013API LY_ERR
Michal Vasko871a0252020-11-11 18:35:24 +01001014lyd_new_meta(const struct ly_ctx *ctx, struct lyd_node *parent, const struct lys_module *module, const char *name,
1015 const char *val_str, ly_bool clear_dflt, struct lyd_meta **meta)
Michal Vaskod86997b2020-05-26 15:19:54 +02001016{
Michal Vaskod86997b2020-05-26 15:19:54 +02001017 const char *prefix, *tmp;
Michal Vaskod86997b2020-05-26 15:19:54 +02001018 size_t pref_len, name_len;
1019
Michal Vasko871a0252020-11-11 18:35:24 +01001020 LY_CHECK_ARG_RET(NULL, ctx, name, module || strchr(name, ':'), parent || meta, LY_EINVAL);
Michal Vasko00cbf532020-06-15 13:58:47 +02001021
Michal Vasko871a0252020-11-11 18:35:24 +01001022 if (parent && !parent->schema) {
1023 LOGERR(ctx, LY_EINVAL, "Cannot add metadata to an opaque node \"%s\".", ((struct lyd_node_opaq *)parent)->name);
1024 return LY_EINVAL;
1025 }
Michal Vasko610553d2020-11-18 18:15:05 +01001026 if (meta) {
1027 *meta = NULL;
1028 }
Michal Vaskod86997b2020-05-26 15:19:54 +02001029
1030 /* parse the name */
1031 tmp = name;
1032 if (ly_parse_nodeid(&tmp, &prefix, &pref_len, &name, &name_len) || tmp[0]) {
1033 LOGERR(ctx, LY_EINVAL, "Metadata name \"%s\" is not valid.", name);
Michal Vasko871a0252020-11-11 18:35:24 +01001034 return LY_EINVAL;
Michal Vaskod86997b2020-05-26 15:19:54 +02001035 }
1036
1037 /* find the module */
1038 if (prefix) {
Radek Krejci0ad51f12020-07-16 12:08:12 +02001039 module = ly_ctx_get_module_implemented2(ctx, prefix, pref_len);
Michal Vasko3a41dff2020-07-15 14:30:28 +02001040 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 +02001041 }
1042
1043 /* set value if none */
1044 if (!val_str) {
1045 val_str = "";
1046 }
1047
Michal Vasko871a0252020-11-11 18:35:24 +01001048 return lyd_create_meta(parent, meta, module, name, name_len, val_str, strlen(val_str), NULL, LY_PREF_JSON,
1049 NULL, LYD_HINT_DATA, clear_dflt, NULL);
1050}
Michal Vasko3a41dff2020-07-15 14:30:28 +02001051
Michal Vaskoba696702020-11-11 19:12:45 +01001052API LY_ERR
1053lyd_new_meta2(const struct ly_ctx *ctx, struct lyd_node *parent, ly_bool clear_dflt, const struct lyd_attr *attr,
1054 struct lyd_meta **meta)
1055{
1056 const struct lys_module *mod;
1057
1058 LY_CHECK_ARG_RET(NULL, ctx, attr, parent || meta, LY_EINVAL);
1059
1060 if (parent && !parent->schema) {
1061 LOGERR(ctx, LY_EINVAL, "Cannot add metadata to an opaque node \"%s\".", ((struct lyd_node_opaq *)parent)->name);
1062 return LY_EINVAL;
Michal Vasko3a41dff2020-07-15 14:30:28 +02001063 }
Michal Vasko610553d2020-11-18 18:15:05 +01001064 if (meta) {
1065 *meta = NULL;
1066 }
Michal Vaskoba696702020-11-11 19:12:45 +01001067
1068 switch (attr->format) {
1069 case LY_PREF_XML:
Michal Vaskoad92b672020-11-12 13:11:31 +01001070 mod = ly_ctx_get_module_implemented_ns(ctx, attr->name.module_ns);
Michal Vaskoba696702020-11-11 19:12:45 +01001071 if (!mod) {
Michal Vaskoad92b672020-11-12 13:11:31 +01001072 LOGERR(ctx, LY_EINVAL, "Module with namespace \"%s\" not found.", attr->name.module_ns);
Michal Vaskoba696702020-11-11 19:12:45 +01001073 return LY_ENOTFOUND;
1074 }
1075 break;
1076 case LY_PREF_JSON:
Michal Vaskoad92b672020-11-12 13:11:31 +01001077 mod = ly_ctx_get_module_implemented(ctx, attr->name.module_name);
Michal Vaskoba696702020-11-11 19:12:45 +01001078 if (!mod) {
Michal Vaskoad92b672020-11-12 13:11:31 +01001079 LOGERR(ctx, LY_EINVAL, "Module \"%s\" not found.", attr->name.module_name);
Michal Vaskoba696702020-11-11 19:12:45 +01001080 return LY_ENOTFOUND;
1081 }
1082 break;
1083 default:
1084 LOGINT_RET(ctx);
1085 }
1086
Michal Vaskoad92b672020-11-12 13:11:31 +01001087 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 +01001088 NULL, attr->format, attr->val_prefix_data, attr->hints, clear_dflt, NULL);
Michal Vaskod86997b2020-05-26 15:19:54 +02001089}
1090
Michal Vasko3a41dff2020-07-15 14:30:28 +02001091API LY_ERR
Michal Vasko00cbf532020-06-15 13:58:47 +02001092lyd_new_opaq(struct lyd_node *parent, const struct ly_ctx *ctx, const char *name, const char *value,
Radek Krejci0f969882020-08-21 16:56:47 +02001093 const char *module_name, struct lyd_node **node)
Michal Vasko00cbf532020-06-15 13:58:47 +02001094{
1095 struct lyd_node *ret = NULL;
1096
Michal Vasko6027eb92020-07-15 16:37:30 +02001097 LY_CHECK_ARG_RET(ctx, parent || ctx, parent || node, name, module_name, LY_EINVAL);
Michal Vasko00cbf532020-06-15 13:58:47 +02001098
1099 if (!ctx) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001100 ctx = LYD_CTX(parent);
Michal Vasko00cbf532020-06-15 13:58:47 +02001101 }
1102 if (!value) {
1103 value = "";
1104 }
1105
Michal Vasko501af032020-11-11 20:27:44 +01001106 LY_CHECK_RET(lyd_create_opaq(ctx, name, strlen(name), NULL, 0, module_name, strlen(module_name), value,
1107 strlen(value), NULL, LY_PREF_JSON, NULL, 0, &ret));
Michal Vasko3a41dff2020-07-15 14:30:28 +02001108 if (parent) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001109 lyd_insert_node(parent, NULL, ret);
1110 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02001111
1112 if (node) {
1113 *node = ret;
1114 }
1115 return LY_SUCCESS;
Michal Vasko00cbf532020-06-15 13:58:47 +02001116}
1117
Michal Vasko3a41dff2020-07-15 14:30:28 +02001118API LY_ERR
Michal Vasko8d65f852021-02-17 11:28:13 +01001119lyd_new_opaq2(struct lyd_node *parent, const struct ly_ctx *ctx, const char *name, const char *value,
1120 const char *module_ns, struct lyd_node **node)
1121{
1122 struct lyd_node *ret = NULL;
1123
1124 LY_CHECK_ARG_RET(ctx, parent || ctx, parent || node, name, module_ns, LY_EINVAL);
1125
1126 if (!ctx) {
1127 ctx = LYD_CTX(parent);
1128 }
1129 if (!value) {
1130 value = "";
1131 }
1132
1133 LY_CHECK_RET(lyd_create_opaq(ctx, name, strlen(name), NULL, 0, module_ns, strlen(module_ns), value,
1134 strlen(value), NULL, LY_PREF_XML, NULL, 0, &ret));
1135 if (parent) {
1136 lyd_insert_node(parent, NULL, ret);
1137 }
1138
1139 if (node) {
1140 *node = ret;
1141 }
1142 return LY_SUCCESS;
1143}
1144
1145API LY_ERR
1146lyd_new_attr(struct lyd_node *parent, const char *module_name, const char *name, const char *value,
Radek Krejci0f969882020-08-21 16:56:47 +02001147 struct lyd_attr **attr)
Michal Vasko00cbf532020-06-15 13:58:47 +02001148{
Radek Krejci1798aae2020-07-14 13:26:06 +02001149 struct lyd_attr *ret = NULL;
Michal Vasko00cbf532020-06-15 13:58:47 +02001150 const struct ly_ctx *ctx;
1151 const char *prefix, *tmp;
Michal Vasko51d21b82020-11-13 18:03:54 +01001152 size_t pref_len, name_len, mod_len;
Michal Vasko00cbf532020-06-15 13:58:47 +02001153
Michal Vasko3a41dff2020-07-15 14:30:28 +02001154 LY_CHECK_ARG_RET(NULL, parent, !parent->schema, name, LY_EINVAL);
Michal Vasko00cbf532020-06-15 13:58:47 +02001155
Michal Vaskob7be7a82020-08-20 09:09:04 +02001156 ctx = LYD_CTX(parent);
Michal Vasko00cbf532020-06-15 13:58:47 +02001157
1158 /* parse the name */
1159 tmp = name;
1160 if (ly_parse_nodeid(&tmp, &prefix, &pref_len, &name, &name_len) || tmp[0]) {
Michal Vaskob69b68c2021-02-17 11:18:16 +01001161 LOGERR(ctx, LY_EINVAL, "Attribute name \"%s\" is not valid.", name);
Michal Vasko3a41dff2020-07-15 14:30:28 +02001162 return LY_EVALID;
Michal Vasko00cbf532020-06-15 13:58:47 +02001163 }
1164
Michal Vasko51d21b82020-11-13 18:03:54 +01001165 /* get the module */
1166 if (module_name) {
1167 mod_len = strlen(module_name);
1168 } else {
1169 module_name = prefix;
1170 mod_len = pref_len;
1171 }
1172
Michal Vasko00cbf532020-06-15 13:58:47 +02001173 /* set value if none */
Michal Vasko8d65f852021-02-17 11:28:13 +01001174 if (!value) {
1175 value = "";
Michal Vasko00cbf532020-06-15 13:58:47 +02001176 }
1177
Michal Vasko8d65f852021-02-17 11:28:13 +01001178 LY_CHECK_RET(lyd_create_attr(parent, &ret, ctx, name, name_len, prefix, pref_len, module_name, mod_len, value,
1179 strlen(value), NULL, LY_PREF_JSON, NULL, LYD_HINT_DATA));
1180
1181 if (attr) {
1182 *attr = ret;
1183 }
1184 return LY_SUCCESS;
1185}
1186
1187API LY_ERR
1188lyd_new_attr2(struct lyd_node *parent, const char *module_ns, const char *name, const char *value,
1189 struct lyd_attr **attr)
1190{
1191 struct lyd_attr *ret = NULL;
1192 const struct ly_ctx *ctx;
1193 const char *prefix, *tmp;
1194 size_t pref_len, name_len;
1195
1196 LY_CHECK_ARG_RET(NULL, parent, !parent->schema, name, LY_EINVAL);
1197
1198 ctx = LYD_CTX(parent);
1199
1200 /* parse the name */
1201 tmp = name;
1202 if (ly_parse_nodeid(&tmp, &prefix, &pref_len, &name, &name_len) || tmp[0]) {
1203 LOGERR(ctx, LY_EINVAL, "Attribute name \"%s\" is not valid.", name);
1204 return LY_EVALID;
1205 }
1206
1207 /* set value if none */
1208 if (!value) {
1209 value = "";
1210 }
1211
1212 LY_CHECK_RET(lyd_create_attr(parent, &ret, ctx, name, name_len, prefix, pref_len, module_ns,
1213 module_ns ? strlen(module_ns) : 0, value, strlen(value), NULL, LY_PREF_XML, NULL, LYD_HINT_DATA));
Michal Vasko3a41dff2020-07-15 14:30:28 +02001214
1215 if (attr) {
1216 *attr = ret;
1217 }
1218 return LY_SUCCESS;
Michal Vasko00cbf532020-06-15 13:58:47 +02001219}
1220
1221API LY_ERR
1222lyd_change_term(struct lyd_node *term, const char *val_str)
1223{
1224 LY_ERR ret = LY_SUCCESS;
1225 struct lysc_type *type;
1226 struct lyd_node_term *t;
1227 struct lyd_node *parent;
1228 struct lyd_value val = {0};
Radek Krejci857189e2020-09-01 13:26:36 +02001229 ly_bool dflt_change, val_change;
Michal Vasko00cbf532020-06-15 13:58:47 +02001230
1231 LY_CHECK_ARG_RET(NULL, term, term->schema, term->schema->nodetype & LYD_NODE_TERM, LY_EINVAL);
1232
1233 if (!val_str) {
1234 val_str = "";
1235 }
1236 t = (struct lyd_node_term *)term;
1237 type = ((struct lysc_node_leaf *)term->schema)->type;
1238
1239 /* parse the new value */
Radek Krejciddace2c2021-01-08 11:30:56 +01001240 LOG_LOCSET(term->schema, term, NULL, NULL);
Michal Vaskofeca4fb2020-10-05 08:58:40 +02001241 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 +01001242 term->schema, NULL);
Radek Krejciddace2c2021-01-08 11:30:56 +01001243 LOG_LOCBACK(term->schema ? 1 : 0, 1, 0, 0);
Michal Vaskofeca4fb2020-10-05 08:58:40 +02001244 LY_CHECK_GOTO(ret, cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001245
1246 /* compare original and new value */
1247 if (type->plugin->compare(&t->value, &val)) {
1248 /* values differ, switch them */
Michal Vaskob7be7a82020-08-20 09:09:04 +02001249 type->plugin->free(LYD_CTX(term), &t->value);
Michal Vasko00cbf532020-06-15 13:58:47 +02001250 t->value = val;
1251 memset(&val, 0, sizeof val);
1252 val_change = 1;
1253 } else {
1254 val_change = 0;
1255 }
1256
1257 /* always clear the default flag */
1258 if (term->flags & LYD_DEFAULT) {
Michal Vasko9e685082021-01-29 14:49:09 +01001259 for (parent = term; parent; parent = lyd_parent(parent)) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001260 parent->flags &= ~LYD_DEFAULT;
1261 }
1262 dflt_change = 1;
1263 } else {
1264 dflt_change = 0;
1265 }
1266
1267 if (val_change || dflt_change) {
1268 /* make the node non-validated */
1269 term->flags &= LYD_NEW;
1270 }
1271
1272 if (val_change) {
1273 if (term->schema->nodetype == LYS_LEAFLIST) {
1274 /* leaf-list needs to be hashed again and re-inserted into parent */
1275 lyd_unlink_hash(term);
1276 lyd_hash(term);
1277 LY_CHECK_GOTO(ret = lyd_insert_hash(term), cleanup);
1278 } else if ((term->schema->flags & LYS_KEY) && term->parent) {
1279 /* list needs to be updated if its key was changed */
1280 assert(term->parent->schema->nodetype == LYS_LIST);
Michal Vasko9e685082021-01-29 14:49:09 +01001281 lyd_unlink_hash(lyd_parent(term));
1282 lyd_hash(lyd_parent(term));
1283 LY_CHECK_GOTO(ret = lyd_insert_hash(lyd_parent(term)), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001284 } /* else leaf that is not a key, its value is not used for its hash so it does not change */
1285 }
1286
1287 /* retrun value */
1288 if (!val_change) {
1289 if (dflt_change) {
1290 /* only default flag change */
1291 ret = LY_EEXIST;
1292 } else {
1293 /* no change */
1294 ret = LY_ENOT;
1295 }
1296 } /* else value changed, LY_SUCCESS */
1297
1298cleanup:
Michal Vasko59512fc2020-12-09 18:13:29 +01001299 if (val.realtype) {
1300 type->plugin->free(LYD_CTX(term), &val);
1301 }
Michal Vasko00cbf532020-06-15 13:58:47 +02001302 return ret;
1303}
1304
Michal Vasko41586352020-07-13 13:54:25 +02001305API LY_ERR
1306lyd_change_meta(struct lyd_meta *meta, const char *val_str)
1307{
1308 LY_ERR ret = LY_SUCCESS;
Radek Krejci2b18bf12020-11-06 11:20:20 +01001309 struct lyd_meta *m2 = NULL;
Michal Vasko41586352020-07-13 13:54:25 +02001310 struct lyd_value val;
Radek Krejci857189e2020-09-01 13:26:36 +02001311 ly_bool val_change;
Michal Vasko41586352020-07-13 13:54:25 +02001312
1313 LY_CHECK_ARG_RET(NULL, meta, LY_EINVAL);
1314
1315 if (!val_str) {
1316 val_str = "";
1317 }
1318
1319 /* parse the new value into a new meta structure */
1320 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 +01001321 strlen(val_str), NULL, LY_PREF_JSON, NULL, LYD_HINT_DATA, 0, NULL), cleanup);
Michal Vasko41586352020-07-13 13:54:25 +02001322
1323 /* compare original and new value */
1324 if (lyd_compare_meta(meta, m2)) {
1325 /* values differ, switch them */
1326 val = meta->value;
1327 meta->value = m2->value;
1328 m2->value = val;
1329 val_change = 1;
1330 } else {
1331 val_change = 0;
1332 }
1333
1334 /* retrun value */
1335 if (!val_change) {
1336 /* no change */
1337 ret = LY_ENOT;
1338 } /* else value changed, LY_SUCCESS */
1339
1340cleanup:
Michal Vasko1a66a5d2020-11-18 18:15:37 +01001341 lyd_free_meta_single(m2);
Michal Vasko41586352020-07-13 13:54:25 +02001342 return ret;
1343}
1344
Michal Vasko3a41dff2020-07-15 14:30:28 +02001345API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02001346lyd_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 +02001347 struct lyd_node **node)
Michal Vasko00cbf532020-06-15 13:58:47 +02001348{
Michal Vasko3a41dff2020-07-15 14:30:28 +02001349 return lyd_new_path2(parent, ctx, path, value, 0, options, node, NULL);
Michal Vasko00cbf532020-06-15 13:58:47 +02001350}
1351
Michal Vasko6741dc62021-02-04 09:27:45 +01001352static LY_ERR
1353lyd_new_path_check_find_lypath(struct ly_path *path, const char *str_path, const char *value, uint32_t options)
1354{
1355 LY_ERR ret = LY_SUCCESS, r;
1356 const struct lysc_node *schema;
1357 struct ly_path_predicate *pred;
Michal Vasko6f9b4262021-02-04 12:09:56 +01001358 LY_ARRAY_COUNT_TYPE u, new_count;
Michal Vasko6741dc62021-02-04 09:27:45 +01001359
1360 assert(path);
1361
1362 /* go through all the compiled nodes */
1363 LY_ARRAY_FOR(path, u) {
1364 schema = path[u].node;
Michal Vasko6f9b4262021-02-04 12:09:56 +01001365 new_count = u + 1;
Michal Vasko6741dc62021-02-04 09:27:45 +01001366 if ((schema->nodetype == LYS_LIST) && (path[u].pred_type == LY_PATH_PREDTYPE_NONE)) {
1367 if (schema->flags & LYS_KEYLESS) {
1368 /* creating a new keyless list instance */
1369 break;
1370 } else if ((u < LY_ARRAY_COUNT(path) - 1) || !(options & LYD_NEW_PATH_OPAQ)) {
1371 LOG_LOCSET(schema, NULL, NULL, NULL);
1372 LOGVAL(schema->module->ctx, LYVE_XPATH, "Predicate missing for %s \"%s\" in path \"%s\".",
1373 lys_nodetype2str(schema->nodetype), schema->name, str_path);
1374 LOG_LOCBACK(1, 0, 0, 0);
1375 return LY_EINVAL;
1376 } /* else creating an opaque list without keys */
1377 }
1378 }
1379
Michal Vasko6f9b4262021-02-04 12:09:56 +01001380 if ((schema->nodetype == LYS_LEAFLIST) && (path[new_count - 1].pred_type == LY_PATH_PREDTYPE_NONE)) {
Michal Vasko6741dc62021-02-04 09:27:45 +01001381 /* parse leafref value into a predicate, if not defined in the path */
1382 if (!value) {
1383 value = "";
1384 }
1385
1386 r = LY_SUCCESS;
1387 if (options & LYD_NEW_PATH_OPAQ) {
1388 r = lys_value_validate(NULL, schema, value, strlen(value));
1389 }
1390 if (!r) {
1391 /* store the new predicate */
Michal Vasko6f9b4262021-02-04 12:09:56 +01001392 path[new_count - 1].pred_type = LY_PATH_PREDTYPE_LEAFLIST;
1393 LY_ARRAY_NEW_GOTO(schema->module->ctx, path[new_count - 1].predicates, pred, ret, cleanup);
Michal Vasko6741dc62021-02-04 09:27:45 +01001394
1395 ret = lyd_value_store(schema->module->ctx, &pred->value, ((struct lysc_node_leaflist *)schema)->type, value,
1396 strlen(value), NULL, LY_PREF_JSON, NULL, LYD_HINT_DATA, schema, NULL);
1397 LY_CHECK_GOTO(ret, cleanup);
1398 ++((struct lysc_type *)pred->value.realtype)->refcount;
1399
1400 if (schema->flags & LYS_CONFIG_R) {
1401 /* creating a new state leaf-list instance */
Michal Vasko6f9b4262021-02-04 12:09:56 +01001402 --new_count;
Michal Vasko6741dc62021-02-04 09:27:45 +01001403 }
1404 } /* else we have opaq flag and the value is not valid, leave no predicate and then create an opaque node */
1405 }
1406
1407 /* hide the nodes that should always be created so they are not found */
Michal Vasko6f9b4262021-02-04 12:09:56 +01001408 while (new_count < LY_ARRAY_COUNT(path)) {
Michal Vasko6741dc62021-02-04 09:27:45 +01001409 LY_ARRAY_DECREMENT(path);
1410 }
1411
1412cleanup:
1413 return ret;
1414}
1415
Michal Vasko00cbf532020-06-15 13:58:47 +02001416API LY_ERR
1417lyd_new_path2(struct lyd_node *parent, const struct ly_ctx *ctx, const char *path, const void *value,
Radek Krejci1deb5be2020-08-26 16:43:36 +02001418 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 +02001419{
1420 LY_ERR ret = LY_SUCCESS, r;
1421 struct lyxp_expr *exp = NULL;
1422 struct ly_path *p = NULL;
1423 struct lyd_node *nparent = NULL, *nnode = NULL, *node = NULL, *cur_parent;
1424 const struct lysc_node *schema;
Michal Vasko6741dc62021-02-04 09:27:45 +01001425 LY_ARRAY_COUNT_TYPE path_idx = 0, orig_count;
Michal Vasko00cbf532020-06-15 13:58:47 +02001426
1427 LY_CHECK_ARG_RET(ctx, parent || ctx, path, (path[0] == '/') || parent, LY_EINVAL);
1428
1429 if (!ctx) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001430 ctx = LYD_CTX(parent);
Michal Vasko00cbf532020-06-15 13:58:47 +02001431 }
1432
1433 /* parse path */
Michal Vasko6b26e742020-07-17 15:02:10 +02001434 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 +02001435 LY_PATH_PREFIX_OPTIONAL, LY_PATH_PRED_SIMPLE, &exp), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001436
1437 /* compile path */
1438 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 +02001439 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 +01001440 NULL, NULL, &p), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001441
Michal Vasko6741dc62021-02-04 09:27:45 +01001442 /* check the compiled path before searching existing nodes, it may be shortened */
1443 orig_count = LY_ARRAY_COUNT(p);
1444 LY_CHECK_GOTO(ret = lyd_new_path_check_find_lypath(p, path, value, options), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001445
1446 /* try to find any existing nodes in the path */
1447 if (parent) {
1448 ret = ly_path_eval_partial(p, parent, &path_idx, &node);
1449 if (ret == LY_SUCCESS) {
Michal Vasko6741dc62021-02-04 09:27:45 +01001450 if (orig_count == LY_ARRAY_COUNT(p)) {
1451 /* the node exists, are we supposed to update it or is it just a default? */
1452 if (!(options & LYD_NEW_PATH_UPDATE) && !(node->flags & LYD_DEFAULT)) {
1453 LOG_LOCSET(NULL, node, NULL, NULL);
1454 LOGVAL(ctx, LYVE_REFERENCE, "Path \"%s\" already exists", path);
1455 LOG_LOCBACK(0, 1, 0, 0);
1456 ret = LY_EEXIST;
1457 goto cleanup;
1458 }
Michal Vasko00cbf532020-06-15 13:58:47 +02001459
Michal Vasko6741dc62021-02-04 09:27:45 +01001460 /* update the existing node */
1461 ret = lyd_new_path_update(node, value, value_type, &nparent, &nnode);
1462 goto cleanup;
1463 } /* else we were not searching for the whole path */
Michal Vasko00cbf532020-06-15 13:58:47 +02001464 } else if (ret == LY_EINCOMPLETE) {
1465 /* some nodes were found, adjust the iterator to the next segment */
1466 ++path_idx;
1467 } else if (ret == LY_ENOTFOUND) {
1468 /* 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 +01001469 if (lysc_data_parent(p[0].node)) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001470 node = parent;
1471 }
1472 } else {
1473 /* error */
1474 goto cleanup;
1475 }
1476 }
1477
Michal Vasko6741dc62021-02-04 09:27:45 +01001478 /* restore the full path for creating new nodes */
1479 while (orig_count > LY_ARRAY_COUNT(p)) {
1480 LY_ARRAY_INCREMENT(p);
1481 }
1482
Michal Vasko00cbf532020-06-15 13:58:47 +02001483 /* create all the non-existing nodes in a loop */
Michal Vaskod989ba02020-08-24 10:59:24 +02001484 for ( ; path_idx < LY_ARRAY_COUNT(p); ++path_idx) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001485 cur_parent = node;
1486 schema = p[path_idx].node;
1487
1488 switch (schema->nodetype) {
1489 case LYS_LIST:
1490 if (!(schema->flags & LYS_KEYLESS)) {
Radek Krejci092e33c2020-10-12 15:33:10 +02001491 if ((options & LYD_NEW_PATH_OPAQ) && (p[path_idx].pred_type == LY_PATH_PREDTYPE_NONE)) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001492 /* creating opaque list without keys */
Michal Vasko501af032020-11-11 20:27:44 +01001493 LY_CHECK_GOTO(ret = lyd_create_opaq(ctx, schema->name, strlen(schema->name), NULL, 0,
1494 schema->module->name, strlen(schema->module->name), NULL, 0, NULL, LY_PREF_JSON, NULL,
1495 LYD_NODEHINT_LIST, &node), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001496 } else {
Michal Vasko8b776962021-01-12 12:21:49 +01001497 if (p[path_idx].pred_type != LY_PATH_PREDTYPE_LIST) {
1498 LOG_LOCSET(schema, NULL, NULL, NULL);
1499 LOGVAL(ctx, LYVE_XPATH, "Predicate missing for %s \"%s\" in path \"%s\".",
1500 lys_nodetype2str(schema->nodetype), schema->name, path);
1501 LOG_LOCBACK(1, 0, 0, 0);
1502 ret = LY_EINVAL;
1503 goto cleanup;
1504 }
1505
Michal Vasko00cbf532020-06-15 13:58:47 +02001506 LY_CHECK_GOTO(ret = lyd_create_list(schema, p[path_idx].predicates, &node), cleanup);
1507 }
1508 break;
1509 }
Radek Krejcif13b87b2020-12-01 22:02:17 +01001510 /* fall through */
Michal Vasko00cbf532020-06-15 13:58:47 +02001511 case LYS_CONTAINER:
1512 case LYS_NOTIF:
1513 case LYS_RPC:
1514 case LYS_ACTION:
1515 LY_CHECK_GOTO(ret = lyd_create_inner(schema, &node), cleanup);
1516 break;
1517 case LYS_LEAFLIST:
Radek Krejci092e33c2020-10-12 15:33:10 +02001518 if ((options & LYD_NEW_PATH_OPAQ) && (p[path_idx].pred_type == LY_PATH_PREDTYPE_NONE)) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001519 /* creating opaque leaf-list without value */
Michal Vasko501af032020-11-11 20:27:44 +01001520 LY_CHECK_GOTO(ret = lyd_create_opaq(ctx, schema->name, strlen(schema->name), NULL, 0,
1521 schema->module->name, strlen(schema->module->name), NULL, 0, NULL, LY_PREF_JSON, NULL,
1522 LYD_NODEHINT_LEAFLIST, &node), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001523 } else {
1524 assert(p[path_idx].pred_type == LY_PATH_PREDTYPE_LEAFLIST);
1525 LY_CHECK_GOTO(ret = lyd_create_term2(schema, &p[path_idx].predicates[0].value, &node), cleanup);
1526 }
1527 break;
1528 case LYS_LEAF:
Michal Vasko35880332020-12-08 13:08:12 +01001529 if (lysc_is_key(schema)) {
1530 /* it must have been already created or some error will occur later */
1531 assert(cur_parent);
1532 node = lyd_child(cur_parent);
1533 assert(node && (node->schema == schema));
1534 goto next_iter;
1535 }
1536
1537 /* make sure there is some value */
Michal Vasko00cbf532020-06-15 13:58:47 +02001538 if (!value) {
1539 value = "";
1540 }
1541
1542 r = LY_SUCCESS;
Radek Krejci092e33c2020-10-12 15:33:10 +02001543 if (options & LYD_NEW_PATH_OPAQ) {
Michal Vaskof937cfe2020-08-03 16:07:12 +02001544 r = lys_value_validate(NULL, schema, value, strlen(value));
Michal Vasko00cbf532020-06-15 13:58:47 +02001545 }
1546 if (!r) {
Michal Vaskofeca4fb2020-10-05 08:58:40 +02001547 ret = lyd_create_term(schema, value, strlen(value), NULL, LY_PREF_JSON, NULL, LYD_HINT_DATA, NULL, &node);
1548 LY_CHECK_GOTO(ret, cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001549 } else {
1550 /* creating opaque leaf without value */
Michal Vasko501af032020-11-11 20:27:44 +01001551 LY_CHECK_GOTO(ret = lyd_create_opaq(ctx, schema->name, strlen(schema->name), NULL, 0, schema->module->name,
1552 strlen(schema->module->name), NULL, 0, NULL, LY_PREF_JSON, NULL, 0, &node), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001553 }
1554 break;
1555 case LYS_ANYDATA:
1556 case LYS_ANYXML:
Michal Vasko366a4a12020-12-04 16:23:57 +01001557 LY_CHECK_GOTO(ret = lyd_create_any(schema, value, value_type, 0, &node), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001558 break;
1559 default:
1560 LOGINT(ctx);
1561 ret = LY_EINT;
1562 goto cleanup;
1563 }
1564
1565 if (cur_parent) {
1566 /* connect to the parent */
1567 lyd_insert_node(cur_parent, NULL, node);
1568 } else if (parent) {
1569 /* connect to top-level siblings */
1570 lyd_insert_node(NULL, &parent, node);
1571 }
1572
Michal Vasko35880332020-12-08 13:08:12 +01001573next_iter:
Michal Vasko00cbf532020-06-15 13:58:47 +02001574 /* update remembered nodes */
1575 if (!nparent) {
1576 nparent = node;
1577 }
1578 nnode = node;
1579 }
1580
1581cleanup:
1582 lyxp_expr_free(ctx, exp);
Michal Vasko6741dc62021-02-04 09:27:45 +01001583 if (p) {
1584 while (orig_count > LY_ARRAY_COUNT(p)) {
1585 LY_ARRAY_INCREMENT(p);
1586 }
1587 }
Michal Vasko00cbf532020-06-15 13:58:47 +02001588 ly_path_free(ctx, p);
1589 if (!ret) {
1590 /* set out params only on success */
1591 if (new_parent) {
1592 *new_parent = nparent;
1593 }
1594 if (new_node) {
1595 *new_node = nnode;
1596 }
Michal Vaskof4b95ba2020-12-11 08:42:33 +01001597 } else {
1598 lyd_free_tree(nparent);
Michal Vasko00cbf532020-06-15 13:58:47 +02001599 }
1600 return ret;
1601}
1602
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001603LY_ERR
1604lyd_new_implicit_r(struct lyd_node *parent, struct lyd_node **first, const struct lysc_node *sparent,
Radek Krejci1deb5be2020-08-26 16:43:36 +02001605 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 +02001606 struct lyd_node **diff)
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001607{
1608 LY_ERR ret;
Michal Vaskod1e53b92021-01-28 13:11:06 +01001609 const struct lysc_node *iter = NULL;
Radek Krejci2b18bf12020-11-06 11:20:20 +01001610 struct lyd_node *node = NULL;
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001611 struct lyd_value **dflts;
1612 LY_ARRAY_COUNT_TYPE u;
Michal Vasko630d9892020-12-08 17:11:08 +01001613 uint32_t getnext_opts;
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001614
1615 assert(first && (parent || sparent || mod));
1616
1617 if (!sparent && parent) {
1618 sparent = parent->schema;
1619 }
1620
Michal Vasko630d9892020-12-08 17:11:08 +01001621 getnext_opts = LYS_GETNEXT_WITHCHOICE;
1622 if (impl_opts & LYD_IMPLICIT_OUTPUT) {
1623 getnext_opts |= LYS_GETNEXT_OUTPUT;
1624 }
1625
1626 while ((iter = lys_getnext(iter, sparent, mod ? mod->compiled : NULL, getnext_opts))) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001627 if ((impl_opts & LYD_IMPLICIT_NO_STATE) && (iter->flags & LYS_CONFIG_R)) {
1628 continue;
Michal Vasko44b19a12020-08-07 09:21:30 +02001629 } else if ((impl_opts & LYD_IMPLICIT_NO_CONFIG) && (iter->flags & LYS_CONFIG_W)) {
1630 continue;
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001631 }
1632
1633 switch (iter->nodetype) {
1634 case LYS_CHOICE:
Michal Vaskobcf4d7d2020-11-18 18:16:49 +01001635 node = lys_getnext_data(NULL, *first, NULL, iter, NULL);
1636 if (!node && ((struct lysc_node_choice *)iter)->dflt) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001637 /* create default case data */
Michal Vasko14ed9cd2021-01-28 14:16:25 +01001638 LY_CHECK_RET(lyd_new_implicit_r(parent, first, &((struct lysc_node_choice *)iter)->dflt->node,
Michal Vasko69730152020-10-09 16:30:07 +02001639 NULL, node_types, node_when, impl_opts, diff));
Michal Vaskobcf4d7d2020-11-18 18:16:49 +01001640 } else if (node) {
1641 /* create any default data in the existing case */
1642 assert(node->schema->parent->nodetype == LYS_CASE);
1643 LY_CHECK_RET(lyd_new_implicit_r(parent, first, node->schema->parent, NULL, node_types, node_when,
1644 impl_opts, diff));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001645 }
1646 break;
1647 case LYS_CONTAINER:
1648 if (!(iter->flags & LYS_PRESENCE) && lyd_find_sibling_val(*first, iter, NULL, 0, NULL)) {
1649 /* create default NP container */
1650 LY_CHECK_RET(lyd_create_inner(iter, &node));
Radek Krejci9a3823e2021-01-27 20:26:46 +01001651 node->flags = LYD_DEFAULT | (lysc_node_when(node->schema) ? LYD_WHEN_TRUE : 0);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001652 lyd_insert_node(parent, first, node);
1653
1654 /* cannot be a NP container with when */
Radek Krejci9a3823e2021-01-27 20:26:46 +01001655 assert(!lysc_node_when(iter));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001656
Michal Vaskoe49b6322020-11-05 17:38:36 +01001657 if (diff) {
1658 /* add into diff */
1659 LY_CHECK_RET(lyd_val_diff_add(node, LYD_DIFF_OP_CREATE, diff));
1660 }
1661
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001662 /* create any default children */
Michal Vaskoe0665742021-02-11 11:08:44 +01001663 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 +02001664 impl_opts, diff));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001665 }
1666 break;
1667 case LYS_LEAF:
Michal Vasko69730152020-10-09 16:30:07 +02001668 if (!(impl_opts & LYD_IMPLICIT_NO_DEFAULTS) && ((struct lysc_node_leaf *)iter)->dflt &&
1669 lyd_find_sibling_val(*first, iter, NULL, 0, NULL)) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001670 /* create default leaf */
1671 ret = lyd_create_term2(iter, ((struct lysc_node_leaf *)iter)->dflt, &node);
1672 if (ret == LY_EINCOMPLETE) {
1673 if (node_types) {
1674 /* remember to resolve type */
Radek Krejci3d92e442020-10-12 12:48:13 +02001675 LY_CHECK_RET(ly_set_add(node_types, node, 1, NULL));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001676 }
1677 } else if (ret) {
1678 return ret;
1679 }
Radek Krejci9a3823e2021-01-27 20:26:46 +01001680 node->flags = LYD_DEFAULT | (lysc_node_when(node->schema) ? LYD_WHEN_TRUE : 0);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001681 lyd_insert_node(parent, first, node);
1682
Radek Krejci9a3823e2021-01-27 20:26:46 +01001683 if (lysc_node_when(iter) && node_when) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001684 /* remember to resolve when */
Radek Krejci3d92e442020-10-12 12:48:13 +02001685 LY_CHECK_RET(ly_set_add(node_when, node, 1, NULL));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001686 }
1687 if (diff) {
1688 /* add into diff */
1689 LY_CHECK_RET(lyd_val_diff_add(node, LYD_DIFF_OP_CREATE, diff));
1690 }
1691 }
1692 break;
1693 case LYS_LEAFLIST:
Michal Vasko69730152020-10-09 16:30:07 +02001694 if (!(impl_opts & LYD_IMPLICIT_NO_DEFAULTS) && ((struct lysc_node_leaflist *)iter)->dflts &&
1695 lyd_find_sibling_val(*first, iter, NULL, 0, NULL)) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001696 /* create all default leaf-lists */
1697 dflts = ((struct lysc_node_leaflist *)iter)->dflts;
1698 LY_ARRAY_FOR(dflts, u) {
1699 ret = lyd_create_term2(iter, dflts[u], &node);
1700 if (ret == LY_EINCOMPLETE) {
1701 if (node_types) {
1702 /* remember to resolve type */
Radek Krejci3d92e442020-10-12 12:48:13 +02001703 LY_CHECK_RET(ly_set_add(node_types, node, 1, NULL));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001704 }
1705 } else if (ret) {
1706 return ret;
1707 }
Radek Krejci9a3823e2021-01-27 20:26:46 +01001708 node->flags = LYD_DEFAULT | (lysc_node_when(node->schema) ? LYD_WHEN_TRUE : 0);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001709 lyd_insert_node(parent, first, node);
1710
Radek Krejci9a3823e2021-01-27 20:26:46 +01001711 if (lysc_node_when(iter) && node_when) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001712 /* remember to resolve when */
Radek Krejci3d92e442020-10-12 12:48:13 +02001713 LY_CHECK_RET(ly_set_add(node_when, node, 1, NULL));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001714 }
1715 if (diff) {
1716 /* add into diff */
1717 LY_CHECK_RET(lyd_val_diff_add(node, LYD_DIFF_OP_CREATE, diff));
1718 }
1719 }
1720 }
1721 break;
1722 default:
1723 /* without defaults */
1724 break;
1725 }
1726 }
1727
1728 return LY_SUCCESS;
1729}
1730
1731API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02001732lyd_new_implicit_tree(struct lyd_node *tree, uint32_t implicit_options, struct lyd_node **diff)
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001733{
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001734 LY_ERR ret = LY_SUCCESS;
Michal Vasko3488ada2020-12-03 14:18:19 +01001735 struct lyd_node *node;
1736 struct ly_set node_when = {0};
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001737
1738 LY_CHECK_ARG_RET(NULL, tree, LY_EINVAL);
1739 if (diff) {
1740 *diff = NULL;
1741 }
1742
Michal Vasko56daf732020-08-10 10:57:18 +02001743 LYD_TREE_DFS_BEGIN(tree, node) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001744 /* skip added default nodes */
Michal Vasko69730152020-10-09 16:30:07 +02001745 if (((node->flags & (LYD_DEFAULT | LYD_NEW)) != (LYD_DEFAULT | LYD_NEW)) &&
1746 (node->schema->nodetype & LYD_NODE_INNER)) {
Michal Vaskoe0665742021-02-11 11:08:44 +01001747 LY_CHECK_GOTO(ret = lyd_new_implicit_r(node, lyd_node_child_p(node), NULL, NULL, NULL,
Michal Vasko3488ada2020-12-03 14:18:19 +01001748 &node_when, implicit_options, diff), cleanup);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001749 }
1750
Michal Vasko56daf732020-08-10 10:57:18 +02001751 LYD_TREE_DFS_END(tree, node);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001752 }
1753
Michal Vasko3488ada2020-12-03 14:18:19 +01001754 /* resolve when and remove any invalid defaults */
Michal Vaskod3bb12f2020-12-04 14:33:09 +01001755 LY_CHECK_GOTO(ret = lyd_validate_unres(&tree, NULL, &node_when, NULL, NULL, diff), cleanup);
Michal Vasko3488ada2020-12-03 14:18:19 +01001756
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001757cleanup:
Michal Vasko3488ada2020-12-03 14:18:19 +01001758 ly_set_erase(&node_when, NULL);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001759 if (ret && diff) {
1760 lyd_free_all(*diff);
1761 *diff = NULL;
1762 }
1763 return ret;
1764}
1765
1766API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02001767lyd_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 +02001768{
1769 const struct lys_module *mod;
1770 struct lyd_node *d = NULL;
1771 uint32_t i = 0;
1772 LY_ERR ret = LY_SUCCESS;
1773
1774 LY_CHECK_ARG_RET(ctx, tree, *tree || ctx, LY_EINVAL);
1775 if (diff) {
1776 *diff = NULL;
1777 }
1778 if (!ctx) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001779 ctx = LYD_CTX(*tree);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001780 }
1781
1782 /* add nodes for each module one-by-one */
1783 while ((mod = ly_ctx_get_module_iter(ctx, &i))) {
1784 if (!mod->implemented) {
1785 continue;
1786 }
1787
1788 LY_CHECK_GOTO(ret = lyd_new_implicit_module(tree, mod, implicit_options, diff ? &d : NULL), cleanup);
1789 if (d) {
1790 /* merge into one diff */
1791 lyd_insert_sibling(*diff, d, diff);
1792
1793 d = NULL;
1794 }
1795 }
1796
1797cleanup:
1798 if (ret && diff) {
1799 lyd_free_all(*diff);
1800 *diff = NULL;
1801 }
1802 return ret;
1803}
1804
1805API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02001806lyd_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 +02001807{
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001808 LY_ERR ret = LY_SUCCESS;
Michal Vasko3488ada2020-12-03 14:18:19 +01001809 struct lyd_node *root, *d = NULL;
1810 struct ly_set node_when = {0};
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001811
1812 LY_CHECK_ARG_RET(NULL, tree, module, LY_EINVAL);
1813 if (diff) {
1814 *diff = NULL;
1815 }
1816
1817 /* add all top-level defaults for this module */
Michal Vasko3488ada2020-12-03 14:18:19 +01001818 LY_CHECK_GOTO(ret = lyd_new_implicit_r(NULL, tree, NULL, module, NULL, &node_when, implicit_options, diff), cleanup);
1819
1820 /* resolve when and remove any invalid defaults */
Michal Vaskod3bb12f2020-12-04 14:33:09 +01001821 LY_CHECK_GOTO(ret = lyd_validate_unres(tree, module, &node_when, NULL, NULL, diff), cleanup);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001822
1823 /* process nested nodes */
1824 LY_LIST_FOR(*tree, root) {
1825 /* skip added default nodes */
1826 if ((root->flags & (LYD_DEFAULT | LYD_NEW)) != (LYD_DEFAULT | LYD_NEW)) {
1827 LY_CHECK_GOTO(ret = lyd_new_implicit_tree(root, implicit_options, diff ? &d : NULL), cleanup);
1828
1829 if (d) {
1830 /* merge into one diff */
1831 lyd_insert_sibling(*diff, d, diff);
1832
1833 d = NULL;
1834 }
1835 }
1836 }
1837
1838cleanup:
Michal Vasko3488ada2020-12-03 14:18:19 +01001839 ly_set_erase(&node_when, NULL);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001840 if (ret && diff) {
1841 lyd_free_all(*diff);
1842 *diff = NULL;
1843 }
1844 return ret;
1845}
1846
Michal Vasko90932a92020-02-12 14:33:03 +01001847struct lyd_node *
Michal Vaskob104f112020-07-17 09:54:54 +02001848lyd_insert_get_next_anchor(const struct lyd_node *first_sibling, const struct lyd_node *new_node)
Michal Vasko90932a92020-02-12 14:33:03 +01001849{
Michal Vaskob104f112020-07-17 09:54:54 +02001850 const struct lysc_node *schema, *sparent;
Michal Vasko90932a92020-02-12 14:33:03 +01001851 struct lyd_node *match = NULL;
Radek Krejci857189e2020-09-01 13:26:36 +02001852 ly_bool found;
Michal Vasko93b16062020-12-09 18:14:18 +01001853 uint32_t getnext_opts;
Michal Vasko90932a92020-02-12 14:33:03 +01001854
Michal Vaskob104f112020-07-17 09:54:54 +02001855 assert(new_node);
1856
1857 if (!first_sibling || !new_node->schema) {
1858 /* insert at the end, no next anchor */
Michal Vasko90932a92020-02-12 14:33:03 +01001859 return NULL;
1860 }
1861
Michal Vasko93b16062020-12-09 18:14:18 +01001862 getnext_opts = 0;
Michal Vaskod1e53b92021-01-28 13:11:06 +01001863 if (new_node->schema->flags & LYS_IS_OUTPUT) {
Michal Vasko93b16062020-12-09 18:14:18 +01001864 getnext_opts = LYS_GETNEXT_OUTPUT;
1865 }
1866
Michal Vaskob104f112020-07-17 09:54:54 +02001867 if (first_sibling->parent && first_sibling->parent->children_ht) {
1868 /* find the anchor using hashes */
1869 sparent = first_sibling->parent->schema;
Michal Vasko93b16062020-12-09 18:14:18 +01001870 schema = lys_getnext(new_node->schema, sparent, NULL, getnext_opts);
Michal Vaskob104f112020-07-17 09:54:54 +02001871 while (schema) {
1872 /* keep trying to find the first existing instance of the closest following schema sibling,
1873 * otherwise return NULL - inserting at the end */
1874 if (!lyd_find_sibling_schema(first_sibling, schema, &match)) {
1875 break;
1876 }
1877
Michal Vasko93b16062020-12-09 18:14:18 +01001878 schema = lys_getnext(schema, sparent, NULL, getnext_opts);
Michal Vaskob104f112020-07-17 09:54:54 +02001879 }
1880 } else {
1881 /* find the anchor without hashes */
1882 match = (struct lyd_node *)first_sibling;
1883 if (!lysc_data_parent(new_node->schema)) {
1884 /* we are in top-level, skip all the data from preceding modules */
1885 LY_LIST_FOR(match, match) {
1886 if (!match->schema || (strcmp(lyd_owner_module(match)->name, lyd_owner_module(new_node)->name) >= 0)) {
1887 break;
1888 }
1889 }
1890 }
1891
1892 /* get the first schema sibling */
1893 sparent = lysc_data_parent(new_node->schema);
Michal Vasko93b16062020-12-09 18:14:18 +01001894 schema = lys_getnext(NULL, sparent, new_node->schema->module->compiled, getnext_opts);
Michal Vaskob104f112020-07-17 09:54:54 +02001895
1896 found = 0;
1897 LY_LIST_FOR(match, match) {
1898 if (!match->schema || (lyd_owner_module(match) != lyd_owner_module(new_node))) {
1899 /* we have found an opaque node, which must be at the end, so use it OR
1900 * modules do not match, so we must have traversed all the data from new_node module (if any),
1901 * we have found the first node of the next module, that is what we want */
1902 break;
1903 }
1904
1905 /* skip schema nodes until we find the instantiated one */
1906 while (!found) {
1907 if (new_node->schema == schema) {
1908 /* we have found the schema of the new node, continue search to find the first
1909 * data node with a different schema (after our schema) */
1910 found = 1;
1911 break;
1912 }
1913 if (match->schema == schema) {
1914 /* current node (match) is a data node still before the new node, continue search in data */
1915 break;
1916 }
Michal Vasko93b16062020-12-09 18:14:18 +01001917 schema = lys_getnext(schema, sparent, new_node->schema->module->compiled, getnext_opts);
Michal Vaskob104f112020-07-17 09:54:54 +02001918 assert(schema);
1919 }
1920
1921 if (found && (match->schema != new_node->schema)) {
1922 /* find the next node after we have found our node schema data instance */
1923 break;
1924 }
1925 }
Michal Vasko90932a92020-02-12 14:33:03 +01001926 }
1927
1928 return match;
1929}
1930
1931/**
1932 * @brief Insert node after a sibling.
1933 *
Michal Vasko9f96a052020-03-10 09:41:45 +01001934 * Handles inserting into NP containers and key-less lists.
1935 *
Michal Vasko90932a92020-02-12 14:33:03 +01001936 * @param[in] sibling Sibling to insert after.
1937 * @param[in] node Node to insert.
1938 */
1939static void
Michal Vaskof03ed032020-03-04 13:31:44 +01001940lyd_insert_after_node(struct lyd_node *sibling, struct lyd_node *node)
Michal Vasko90932a92020-02-12 14:33:03 +01001941{
Michal Vasko0249f7c2020-03-05 16:36:40 +01001942 struct lyd_node_inner *par;
1943
Michal Vasko90932a92020-02-12 14:33:03 +01001944 assert(!node->next && (node->prev == node));
1945
1946 node->next = sibling->next;
1947 node->prev = sibling;
1948 sibling->next = node;
1949 if (node->next) {
1950 /* sibling had a succeeding node */
1951 node->next->prev = node;
1952 } else {
1953 /* sibling was last, find first sibling and change its prev */
1954 if (sibling->parent) {
1955 sibling = sibling->parent->child;
1956 } else {
Michal Vaskod989ba02020-08-24 10:59:24 +02001957 for ( ; sibling->prev->next != node; sibling = sibling->prev) {}
Michal Vasko90932a92020-02-12 14:33:03 +01001958 }
1959 sibling->prev = node;
1960 }
1961 node->parent = sibling->parent;
Michal Vasko0249f7c2020-03-05 16:36:40 +01001962
Michal Vasko9f96a052020-03-10 09:41:45 +01001963 for (par = node->parent; par; par = par->parent) {
1964 if ((par->flags & LYD_DEFAULT) && !(node->flags & LYD_DEFAULT)) {
1965 /* remove default flags from NP containers */
Michal Vasko0249f7c2020-03-05 16:36:40 +01001966 par->flags &= ~LYD_DEFAULT;
1967 }
Michal Vaskob104f112020-07-17 09:54:54 +02001968 if (par->schema && (par->schema->nodetype == LYS_LIST) && (par->schema->flags & LYS_KEYLESS)) {
Michal Vasko9f96a052020-03-10 09:41:45 +01001969 /* rehash key-less list */
Michal Vasko9e685082021-01-29 14:49:09 +01001970 lyd_hash(&par->node);
Michal Vasko9f96a052020-03-10 09:41:45 +01001971 }
Michal Vasko0249f7c2020-03-05 16:36:40 +01001972 }
Michal Vasko90932a92020-02-12 14:33:03 +01001973}
1974
1975/**
1976 * @brief Insert node before a sibling.
1977 *
Michal Vasko9f96a052020-03-10 09:41:45 +01001978 * Handles inserting into NP containers and key-less lists.
1979 *
Michal Vasko90932a92020-02-12 14:33:03 +01001980 * @param[in] sibling Sibling to insert before.
1981 * @param[in] node Node to insert.
1982 */
1983static void
Michal Vaskof03ed032020-03-04 13:31:44 +01001984lyd_insert_before_node(struct lyd_node *sibling, struct lyd_node *node)
Michal Vasko90932a92020-02-12 14:33:03 +01001985{
Michal Vasko0249f7c2020-03-05 16:36:40 +01001986 struct lyd_node_inner *par;
1987
Michal Vasko90932a92020-02-12 14:33:03 +01001988 assert(!node->next && (node->prev == node));
1989
1990 node->next = sibling;
1991 /* covers situation of sibling being first */
1992 node->prev = sibling->prev;
1993 sibling->prev = node;
1994 if (node->prev->next) {
1995 /* sibling had a preceding node */
1996 node->prev->next = node;
1997 } else if (sibling->parent) {
1998 /* sibling was first and we must also change parent child pointer */
1999 sibling->parent->child = node;
2000 }
2001 node->parent = sibling->parent;
Michal Vasko0249f7c2020-03-05 16:36:40 +01002002
Michal Vasko9f96a052020-03-10 09:41:45 +01002003 for (par = node->parent; par; par = par->parent) {
2004 if ((par->flags & LYD_DEFAULT) && !(node->flags & LYD_DEFAULT)) {
2005 /* remove default flags from NP containers */
Michal Vasko0249f7c2020-03-05 16:36:40 +01002006 par->flags &= ~LYD_DEFAULT;
2007 }
Michal Vaskob104f112020-07-17 09:54:54 +02002008 if (par->schema && (par->schema->nodetype == LYS_LIST) && (par->schema->flags & LYS_KEYLESS)) {
Michal Vasko9f96a052020-03-10 09:41:45 +01002009 /* rehash key-less list */
Michal Vasko9e685082021-01-29 14:49:09 +01002010 lyd_hash(&par->node);
Michal Vasko9f96a052020-03-10 09:41:45 +01002011 }
Michal Vasko0249f7c2020-03-05 16:36:40 +01002012 }
Michal Vasko90932a92020-02-12 14:33:03 +01002013}
2014
2015/**
Michal Vaskob104f112020-07-17 09:54:54 +02002016 * @brief Insert node as the first and only child of a parent.
Michal Vasko90932a92020-02-12 14:33:03 +01002017 *
Michal Vasko9f96a052020-03-10 09:41:45 +01002018 * Handles inserting into NP containers and key-less lists.
2019 *
Michal Vasko90932a92020-02-12 14:33:03 +01002020 * @param[in] parent Parent to insert into.
2021 * @param[in] node Node to insert.
2022 */
2023static void
Michal Vaskob104f112020-07-17 09:54:54 +02002024lyd_insert_only_child(struct lyd_node *parent, struct lyd_node *node)
Michal Vasko90932a92020-02-12 14:33:03 +01002025{
2026 struct lyd_node_inner *par;
2027
Radek Krejcia1c1e542020-09-29 16:06:52 +02002028 assert(parent && !lyd_child(parent) && !node->next && (node->prev == node));
Michal Vasko52927e22020-03-16 17:26:14 +01002029 assert(!parent->schema || (parent->schema->nodetype & LYD_NODE_INNER));
Michal Vasko90932a92020-02-12 14:33:03 +01002030
2031 par = (struct lyd_node_inner *)parent;
2032
Michal Vaskob104f112020-07-17 09:54:54 +02002033 par->child = node;
Michal Vasko90932a92020-02-12 14:33:03 +01002034 node->parent = par;
Michal Vasko0249f7c2020-03-05 16:36:40 +01002035
Michal Vaskod989ba02020-08-24 10:59:24 +02002036 for ( ; par; par = par->parent) {
Michal Vasko9f96a052020-03-10 09:41:45 +01002037 if ((par->flags & LYD_DEFAULT) && !(node->flags & LYD_DEFAULT)) {
2038 /* remove default flags from NP containers */
Michal Vasko0249f7c2020-03-05 16:36:40 +01002039 par->flags &= ~LYD_DEFAULT;
2040 }
Michal Vasko52927e22020-03-16 17:26:14 +01002041 if (par->schema && (par->schema->nodetype == LYS_LIST) && (par->schema->flags & LYS_KEYLESS)) {
Michal Vasko9f96a052020-03-10 09:41:45 +01002042 /* rehash key-less list */
Michal Vasko9e685082021-01-29 14:49:09 +01002043 lyd_hash(&par->node);
Michal Vasko9f96a052020-03-10 09:41:45 +01002044 }
Michal Vasko0249f7c2020-03-05 16:36:40 +01002045 }
Michal Vasko751cb4d2020-07-14 12:25:28 +02002046}
Michal Vasko0249f7c2020-03-05 16:36:40 +01002047
Michal Vasko751cb4d2020-07-14 12:25:28 +02002048/**
2049 * @brief Learn whether a list instance has all the keys.
2050 *
2051 * @param[in] list List instance to check.
2052 * @return non-zero if all the keys were found,
2053 * @return 0 otherwise.
2054 */
2055static int
2056lyd_insert_has_keys(const struct lyd_node *list)
2057{
2058 const struct lyd_node *key;
2059 const struct lysc_node *skey = NULL;
2060
2061 assert(list->schema->nodetype == LYS_LIST);
Radek Krejcia1c1e542020-09-29 16:06:52 +02002062 key = lyd_child(list);
Michal Vasko751cb4d2020-07-14 12:25:28 +02002063 while ((skey = lys_getnext(skey, list->schema, NULL, 0)) && (skey->flags & LYS_KEY)) {
2064 if (!key || (key->schema != skey)) {
2065 /* key missing */
2066 return 0;
2067 }
2068
2069 key = key->next;
2070 }
2071
2072 /* all keys found */
2073 return 1;
Michal Vasko90932a92020-02-12 14:33:03 +01002074}
2075
2076void
Michal Vaskob104f112020-07-17 09:54:54 +02002077lyd_insert_node(struct lyd_node *parent, struct lyd_node **first_sibling_p, struct lyd_node *node)
Michal Vasko90932a92020-02-12 14:33:03 +01002078{
Michal Vaskob104f112020-07-17 09:54:54 +02002079 struct lyd_node *anchor, *first_sibling;
Michal Vasko90932a92020-02-12 14:33:03 +01002080
Michal Vaskob104f112020-07-17 09:54:54 +02002081 /* inserting list without its keys is not supported */
2082 assert((parent || first_sibling_p) && node && (node->hash || !node->schema));
Michal Vaskof756c942020-11-06 17:21:37 +01002083 assert(!parent || !parent->schema ||
2084 (parent->schema->nodetype & (LYS_CONTAINER | LYS_LIST | LYS_RPC | LYS_ACTION | LYS_NOTIF)));
Michal Vasko9b368d32020-02-14 13:53:31 +01002085
Michal Vaskob104f112020-07-17 09:54:54 +02002086 if (!parent && first_sibling_p && (*first_sibling_p) && (*first_sibling_p)->parent) {
Michal Vasko9e685082021-01-29 14:49:09 +01002087 parent = lyd_parent(*first_sibling_p);
Michal Vasko9b368d32020-02-14 13:53:31 +01002088 }
Michal Vasko90932a92020-02-12 14:33:03 +01002089
Michal Vaskob104f112020-07-17 09:54:54 +02002090 /* get first sibling */
Michal Vasko9e685082021-01-29 14:49:09 +01002091 first_sibling = parent ? lyd_child(parent) : *first_sibling_p;
Michal Vasko9f96a052020-03-10 09:41:45 +01002092
Michal Vaskob104f112020-07-17 09:54:54 +02002093 /* find the anchor, our next node, so we can insert before it */
2094 anchor = lyd_insert_get_next_anchor(first_sibling, node);
2095 if (anchor) {
2096 lyd_insert_before_node(anchor, node);
Michal Vasko26123192020-11-09 21:02:34 +01002097 if (!parent && (*first_sibling_p == anchor)) {
2098 /* move first sibling */
2099 *first_sibling_p = node;
2100 }
Michal Vaskob104f112020-07-17 09:54:54 +02002101 } else if (first_sibling) {
2102 lyd_insert_after_node(first_sibling->prev, node);
2103 } else if (parent) {
2104 lyd_insert_only_child(parent, node);
Michal Vasko90932a92020-02-12 14:33:03 +01002105 } else {
Michal Vaskob104f112020-07-17 09:54:54 +02002106 *first_sibling_p = node;
2107 }
2108
2109 /* insert into parent HT */
2110 lyd_insert_hash(node);
2111
2112 /* finish hashes for our parent, if needed and possible */
Michal Vasko9e8de2d2020-09-01 08:17:10 +02002113 if (node->schema && (node->schema->flags & LYS_KEY) && parent && lyd_insert_has_keys(parent)) {
Michal Vaskob104f112020-07-17 09:54:54 +02002114 lyd_hash(parent);
2115
2116 /* now we can insert even the list into its parent HT */
2117 lyd_insert_hash(parent);
Michal Vasko90932a92020-02-12 14:33:03 +01002118 }
Michal Vasko90932a92020-02-12 14:33:03 +01002119}
2120
Michal Vasko717a4c32020-12-07 09:40:10 +01002121/**
2122 * @brief Check schema place of a node to be inserted.
2123 *
2124 * @param[in] parent Schema node of the parent data node.
2125 * @param[in] sibling Schema node of a sibling data node.
2126 * @param[in] schema Schema node if the data node to be inserted.
2127 * @return LY_SUCCESS on success.
2128 * @return LY_EINVAL if the place is invalid.
2129 */
Michal Vaskof03ed032020-03-04 13:31:44 +01002130static LY_ERR
Michal Vasko717a4c32020-12-07 09:40:10 +01002131lyd_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 +01002132{
2133 const struct lysc_node *par2;
2134
Michal Vasko62ed12d2020-05-21 10:08:25 +02002135 assert(!parent || !(parent->nodetype & (LYS_CASE | LYS_CHOICE)));
Michal Vasko717a4c32020-12-07 09:40:10 +01002136 assert(!sibling || !(sibling->nodetype & (LYS_CASE | LYS_CHOICE)));
2137 assert(!schema || !(schema->nodetype & (LYS_CASE | LYS_CHOICE)));
Michal Vaskof03ed032020-03-04 13:31:44 +01002138
Michal Vasko717a4c32020-12-07 09:40:10 +01002139 if (!schema || (!parent && !sibling)) {
Michal Vasko71e795e2020-12-04 16:27:37 +01002140 /* opaque nodes can be inserted wherever */
2141 return LY_SUCCESS;
2142 }
2143
Michal Vasko717a4c32020-12-07 09:40:10 +01002144 if (!parent) {
2145 parent = lysc_data_parent(sibling);
2146 }
2147
Michal Vaskof03ed032020-03-04 13:31:44 +01002148 /* find schema parent */
Michal Vasko62ed12d2020-05-21 10:08:25 +02002149 par2 = lysc_data_parent(schema);
Michal Vaskof03ed032020-03-04 13:31:44 +01002150
2151 if (parent) {
2152 /* inner node */
2153 if (par2 != parent) {
Michal Vaskob104f112020-07-17 09:54:54 +02002154 LOGERR(schema->module->ctx, LY_EINVAL, "Cannot insert, parent of \"%s\" is not \"%s\".", schema->name,
Michal Vasko69730152020-10-09 16:30:07 +02002155 parent->name);
Michal Vaskof03ed032020-03-04 13:31:44 +01002156 return LY_EINVAL;
2157 }
2158 } else {
2159 /* top-level node */
2160 if (par2) {
Radek Krejcif6d14cb2020-07-02 16:11:45 +02002161 LOGERR(schema->module->ctx, LY_EINVAL, "Cannot insert, node \"%s\" is not top-level.", schema->name);
Michal Vaskof03ed032020-03-04 13:31:44 +01002162 return LY_EINVAL;
2163 }
2164 }
2165
2166 return LY_SUCCESS;
2167}
2168
2169API LY_ERR
Michal Vaskob104f112020-07-17 09:54:54 +02002170lyd_insert_child(struct lyd_node *parent, struct lyd_node *node)
Michal Vaskof03ed032020-03-04 13:31:44 +01002171{
2172 struct lyd_node *iter;
2173
Michal Vasko654bc852020-06-23 13:28:06 +02002174 LY_CHECK_ARG_RET(NULL, parent, node, parent->schema->nodetype & LYD_NODE_INNER, LY_EINVAL);
Michal Vaskof03ed032020-03-04 13:31:44 +01002175
Michal Vasko717a4c32020-12-07 09:40:10 +01002176 LY_CHECK_RET(lyd_insert_check_schema(parent->schema, NULL, node->schema));
Michal Vaskof03ed032020-03-04 13:31:44 +01002177
2178 if (node->schema->flags & LYS_KEY) {
2179 LOGERR(parent->schema->module->ctx, LY_EINVAL, "Cannot insert key \"%s\".", node->schema->name);
2180 return LY_EINVAL;
2181 }
2182
2183 if (node->parent || node->prev->next) {
2184 lyd_unlink_tree(node);
2185 }
2186
2187 while (node) {
2188 iter = node->next;
2189 lyd_unlink_tree(node);
2190 lyd_insert_node(parent, NULL, node);
2191 node = iter;
2192 }
2193 return LY_SUCCESS;
2194}
2195
2196API LY_ERR
Michal Vaskob104f112020-07-17 09:54:54 +02002197lyd_insert_sibling(struct lyd_node *sibling, struct lyd_node *node, struct lyd_node **first)
Michal Vaskob1b5c262020-03-05 14:29:47 +01002198{
2199 struct lyd_node *iter;
2200
Michal Vaskob104f112020-07-17 09:54:54 +02002201 LY_CHECK_ARG_RET(NULL, node, LY_EINVAL);
Michal Vaskob1b5c262020-03-05 14:29:47 +01002202
Michal Vaskob104f112020-07-17 09:54:54 +02002203 if (sibling) {
Michal Vasko717a4c32020-12-07 09:40:10 +01002204 LY_CHECK_RET(lyd_insert_check_schema(NULL, sibling->schema, node->schema));
Michal Vaskob1b5c262020-03-05 14:29:47 +01002205 }
2206
Michal Vasko553d0b52020-12-04 16:27:52 +01002207 if (sibling == node) {
2208 /* we need to keep the connection to siblings so we can insert into them */
2209 sibling = sibling->prev;
2210 }
2211
Michal Vaskob1b5c262020-03-05 14:29:47 +01002212 if (node->parent || node->prev->next) {
2213 lyd_unlink_tree(node);
2214 }
2215
2216 while (node) {
Michal Vasko71e795e2020-12-04 16:27:37 +01002217 if (lysc_is_key(node->schema)) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02002218 LOGERR(LYD_CTX(node), LY_EINVAL, "Cannot insert key \"%s\".", node->schema->name);
Michal Vaskob104f112020-07-17 09:54:54 +02002219 return LY_EINVAL;
2220 }
2221
Michal Vaskob1b5c262020-03-05 14:29:47 +01002222 iter = node->next;
2223 lyd_unlink_tree(node);
2224 lyd_insert_node(NULL, &sibling, node);
2225 node = iter;
2226 }
Michal Vaskob1b5c262020-03-05 14:29:47 +01002227
Michal Vaskob104f112020-07-17 09:54:54 +02002228 if (first) {
2229 /* find the first sibling */
2230 *first = sibling;
2231 while ((*first)->prev->next) {
2232 *first = (*first)->prev;
Michal Vasko0249f7c2020-03-05 16:36:40 +01002233 }
2234 }
2235
2236 return LY_SUCCESS;
2237}
2238
Michal Vaskob1b5c262020-03-05 14:29:47 +01002239API LY_ERR
Michal Vaskof03ed032020-03-04 13:31:44 +01002240lyd_insert_before(struct lyd_node *sibling, struct lyd_node *node)
2241{
Michal Vaskof03ed032020-03-04 13:31:44 +01002242 LY_CHECK_ARG_RET(NULL, sibling, node, LY_EINVAL);
2243
Michal Vasko717a4c32020-12-07 09:40:10 +01002244 LY_CHECK_RET(lyd_insert_check_schema(NULL, sibling->schema, node->schema));
Michal Vaskof03ed032020-03-04 13:31:44 +01002245
Michal Vaskob104f112020-07-17 09:54:54 +02002246 if (!(node->schema->nodetype & (LYS_LIST | LYS_LEAFLIST)) || !(node->schema->flags & LYS_ORDBY_USER)) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02002247 LOGERR(LYD_CTX(sibling), LY_EINVAL, "Can be used only for user-ordered nodes.");
Michal Vaskof03ed032020-03-04 13:31:44 +01002248 return LY_EINVAL;
2249 }
2250
Michal Vasko4bc2ce32020-12-08 10:06:16 +01002251 lyd_unlink_tree(node);
2252 lyd_insert_before_node(sibling, node);
2253 lyd_insert_hash(node);
Michal Vaskof03ed032020-03-04 13:31:44 +01002254
Michal Vaskof03ed032020-03-04 13:31:44 +01002255 return LY_SUCCESS;
2256}
2257
2258API LY_ERR
2259lyd_insert_after(struct lyd_node *sibling, struct lyd_node *node)
2260{
Michal Vaskof03ed032020-03-04 13:31:44 +01002261 LY_CHECK_ARG_RET(NULL, sibling, node, LY_EINVAL);
2262
Michal Vasko717a4c32020-12-07 09:40:10 +01002263 LY_CHECK_RET(lyd_insert_check_schema(NULL, sibling->schema, node->schema));
Michal Vaskof03ed032020-03-04 13:31:44 +01002264
Michal Vaskob104f112020-07-17 09:54:54 +02002265 if (!(node->schema->nodetype & (LYS_LIST | LYS_LEAFLIST)) || !(node->schema->flags & LYS_ORDBY_USER)) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02002266 LOGERR(LYD_CTX(sibling), LY_EINVAL, "Can be used only for user-ordered nodes.");
Michal Vaskof03ed032020-03-04 13:31:44 +01002267 return LY_EINVAL;
2268 }
2269
Michal Vasko4bc2ce32020-12-08 10:06:16 +01002270 lyd_unlink_tree(node);
2271 lyd_insert_after_node(sibling, node);
2272 lyd_insert_hash(node);
Michal Vaskof03ed032020-03-04 13:31:44 +01002273
Michal Vaskof03ed032020-03-04 13:31:44 +01002274 return LY_SUCCESS;
2275}
2276
2277API void
2278lyd_unlink_tree(struct lyd_node *node)
2279{
2280 struct lyd_node *iter;
2281
2282 if (!node) {
2283 return;
2284 }
2285
Michal Vaskob104f112020-07-17 09:54:54 +02002286 /* update hashes while still linked into the tree */
2287 lyd_unlink_hash(node);
2288
Michal Vaskof03ed032020-03-04 13:31:44 +01002289 /* unlink from siblings */
2290 if (node->prev->next) {
2291 node->prev->next = node->next;
2292 }
2293 if (node->next) {
2294 node->next->prev = node->prev;
2295 } else {
2296 /* unlinking the last node */
2297 if (node->parent) {
2298 iter = node->parent->child;
2299 } else {
2300 iter = node->prev;
2301 while (iter->prev != node) {
2302 iter = iter->prev;
2303 }
2304 }
2305 /* update the "last" pointer from the first node */
2306 iter->prev = node->prev;
2307 }
2308
2309 /* unlink from parent */
2310 if (node->parent) {
2311 if (node->parent->child == node) {
2312 /* the node is the first child */
2313 node->parent->child = node->next;
2314 }
2315
Michal Vaskoab49dbe2020-07-17 12:32:47 +02002316 /* check for NP container whether its last non-default node is not being unlinked */
Michal Vasko69730152020-10-09 16:30:07 +02002317 if (node->parent->schema && (node->parent->schema->nodetype == LYS_CONTAINER) &&
2318 !(node->parent->flags & LYD_DEFAULT) && !(node->parent->schema->flags & LYS_PRESENCE)) {
Michal Vaskoab49dbe2020-07-17 12:32:47 +02002319 LY_LIST_FOR(node->parent->child, iter) {
2320 if ((iter != node) && !(iter->flags & LYD_DEFAULT)) {
2321 break;
2322 }
2323 }
2324 if (!iter) {
2325 node->parent->flags |= LYD_DEFAULT;
2326 }
2327 }
2328
Michal Vaskof03ed032020-03-04 13:31:44 +01002329 /* check for keyless list and update its hash */
Michal Vasko9e685082021-01-29 14:49:09 +01002330 for (iter = lyd_parent(node); iter; iter = lyd_parent(iter)) {
Michal Vasko413c7f22020-05-05 12:34:06 +02002331 if (iter->schema && (iter->schema->flags & LYS_KEYLESS)) {
Michal Vaskof03ed032020-03-04 13:31:44 +01002332 lyd_hash(iter);
2333 }
2334 }
2335
2336 node->parent = NULL;
2337 }
2338
2339 node->next = NULL;
2340 node->prev = node;
2341}
2342
Michal Vaskoa5da3292020-08-12 13:10:50 +02002343void
Michal Vasko871a0252020-11-11 18:35:24 +01002344lyd_insert_meta(struct lyd_node *parent, struct lyd_meta *meta, ly_bool clear_dflt)
Radek Krejci1798aae2020-07-14 13:26:06 +02002345{
2346 struct lyd_meta *last, *iter;
2347
2348 assert(parent);
Michal Vaskoa5da3292020-08-12 13:10:50 +02002349
2350 if (!meta) {
2351 return;
2352 }
Radek Krejci1798aae2020-07-14 13:26:06 +02002353
2354 for (iter = meta; iter; iter = iter->next) {
2355 iter->parent = parent;
2356 }
2357
2358 /* insert as the last attribute */
2359 if (parent->meta) {
Radek Krejci1e008d22020-08-17 11:37:37 +02002360 for (last = parent->meta; last->next; last = last->next) {}
Radek Krejci1798aae2020-07-14 13:26:06 +02002361 last->next = meta;
2362 } else {
2363 parent->meta = meta;
2364 }
2365
2366 /* remove default flags from NP containers */
Michal Vasko871a0252020-11-11 18:35:24 +01002367 while (clear_dflt && parent && (parent->schema->nodetype == LYS_CONTAINER) && (parent->flags & LYD_DEFAULT)) {
Radek Krejci1798aae2020-07-14 13:26:06 +02002368 parent->flags &= ~LYD_DEFAULT;
Michal Vasko9e685082021-01-29 14:49:09 +01002369 parent = lyd_parent(parent);
Radek Krejci1798aae2020-07-14 13:26:06 +02002370 }
Radek Krejci1798aae2020-07-14 13:26:06 +02002371}
2372
2373LY_ERR
Michal Vasko9f96a052020-03-10 09:41:45 +01002374lyd_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 +02002375 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 +01002376 void *prefix_data, uint32_t hints, ly_bool clear_dflt, ly_bool *incomplete)
Michal Vasko90932a92020-02-12 14:33:03 +01002377{
Radek Krejci2efc45b2020-12-22 16:25:44 +01002378 LY_ERR ret = LY_SUCCESS;
Michal Vasko90932a92020-02-12 14:33:03 +01002379 struct lysc_ext_instance *ant = NULL;
Michal Vasko9f96a052020-03-10 09:41:45 +01002380 struct lyd_meta *mt, *last;
Michal Vaskofd69e1d2020-07-03 11:57:17 +02002381 LY_ARRAY_COUNT_TYPE u;
Michal Vasko90932a92020-02-12 14:33:03 +01002382
Michal Vasko9f96a052020-03-10 09:41:45 +01002383 assert((parent || meta) && mod);
Michal Vasko6f4cbb62020-02-28 11:15:47 +01002384
Radek Krejciddace2c2021-01-08 11:30:56 +01002385 LOG_LOCSET(parent ? parent->schema : NULL, parent, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +01002386
Radek Krejci7eb54ba2020-05-18 16:30:04 +02002387 LY_ARRAY_FOR(mod->compiled->exts, u) {
Michal Vasko69730152020-10-09 16:30:07 +02002388 if ((mod->compiled->exts[u].def->plugin == lyext_plugins_internal[LYEXT_PLUGIN_INTERNAL_ANNOTATION].plugin) &&
Radek Krejci7eb54ba2020-05-18 16:30:04 +02002389 !ly_strncmp(mod->compiled->exts[u].argument, name, name_len)) {
Michal Vasko90932a92020-02-12 14:33:03 +01002390 /* we have the annotation definition */
Radek Krejci7eb54ba2020-05-18 16:30:04 +02002391 ant = &mod->compiled->exts[u];
Michal Vasko90932a92020-02-12 14:33:03 +01002392 break;
2393 }
2394 }
2395 if (!ant) {
2396 /* attribute is not defined as a metadata annotation (RFC 7952) */
Radek Krejci2efc45b2020-12-22 16:25:44 +01002397 LOGVAL(mod->ctx, LYVE_REFERENCE, "Annotation definition for attribute \"%s:%.*s\" not found.",
Michal Vasko90932a92020-02-12 14:33:03 +01002398 mod->name, name_len, name);
Radek Krejci2efc45b2020-12-22 16:25:44 +01002399 ret = LY_EINVAL;
2400 goto cleanup;
Michal Vasko90932a92020-02-12 14:33:03 +01002401 }
2402
Michal Vasko9f96a052020-03-10 09:41:45 +01002403 mt = calloc(1, sizeof *mt);
Radek Krejci2efc45b2020-12-22 16:25:44 +01002404 LY_CHECK_ERR_GOTO(!mt, LOGMEM(mod->ctx); ret = LY_EMEM, cleanup);
Michal Vasko9f96a052020-03-10 09:41:45 +01002405 mt->parent = parent;
2406 mt->annotation = ant;
Radek Krejci2efc45b2020-12-22 16:25:44 +01002407 ret = lyd_value_store(mod->ctx, &mt->value, ((struct lyext_metadata *)ant->data)->type, value, value_len, dynamic,
2408 format, prefix_data, hints, parent ? parent->schema : NULL, incomplete);
2409 LY_CHECK_ERR_GOTO(ret, free(mt), cleanup);
2410 ret = lydict_insert(mod->ctx, name, name_len, &mt->name);
2411 LY_CHECK_ERR_GOTO(ret, free(mt), cleanup);
Michal Vasko90932a92020-02-12 14:33:03 +01002412
Michal Vasko6f4cbb62020-02-28 11:15:47 +01002413 /* insert as the last attribute */
2414 if (parent) {
Michal Vasko871a0252020-11-11 18:35:24 +01002415 lyd_insert_meta(parent, mt, clear_dflt);
Michal Vasko9f96a052020-03-10 09:41:45 +01002416 } else if (*meta) {
Radek Krejci1e008d22020-08-17 11:37:37 +02002417 for (last = *meta; last->next; last = last->next) {}
Michal Vasko9f96a052020-03-10 09:41:45 +01002418 last->next = mt;
Michal Vasko90932a92020-02-12 14:33:03 +01002419 }
2420
Michal Vasko9f96a052020-03-10 09:41:45 +01002421 if (meta) {
2422 *meta = mt;
Michal Vasko90932a92020-02-12 14:33:03 +01002423 }
Radek Krejci2efc45b2020-12-22 16:25:44 +01002424
2425cleanup:
Radek Krejciddace2c2021-01-08 11:30:56 +01002426 LOG_LOCBACK((parent && parent->schema) ? 1 : 0, parent ? 1 : 0, 0, 0);
Radek Krejci2efc45b2020-12-22 16:25:44 +01002427 return ret;
Michal Vasko90932a92020-02-12 14:33:03 +01002428}
2429
Michal Vaskoa5da3292020-08-12 13:10:50 +02002430void
2431lyd_insert_attr(struct lyd_node *parent, struct lyd_attr *attr)
2432{
2433 struct lyd_attr *last, *iter;
2434 struct lyd_node_opaq *opaq;
2435
2436 assert(parent && !parent->schema);
2437
2438 if (!attr) {
2439 return;
2440 }
2441
2442 opaq = (struct lyd_node_opaq *)parent;
2443 for (iter = attr; iter; iter = iter->next) {
2444 iter->parent = opaq;
2445 }
2446
2447 /* insert as the last attribute */
2448 if (opaq->attr) {
Radek Krejci1e008d22020-08-17 11:37:37 +02002449 for (last = opaq->attr; last->next; last = last->next) {}
Michal Vaskoa5da3292020-08-12 13:10:50 +02002450 last->next = attr;
2451 } else {
2452 opaq->attr = attr;
2453 }
2454}
2455
Michal Vasko52927e22020-03-16 17:26:14 +01002456LY_ERR
Michal Vaskofeca4fb2020-10-05 08:58:40 +02002457lyd_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 +01002458 const char *prefix, size_t prefix_len, const char *module_key, size_t module_key_len, const char *value,
2459 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 +01002460{
Radek Krejci011e4aa2020-09-04 15:22:31 +02002461 LY_ERR ret = LY_SUCCESS;
Radek Krejci1798aae2020-07-14 13:26:06 +02002462 struct lyd_attr *at, *last;
Michal Vasko52927e22020-03-16 17:26:14 +01002463
2464 assert(ctx && (parent || attr) && (!parent || !parent->schema));
Michal Vaskofeca4fb2020-10-05 08:58:40 +02002465 assert(name && name_len && format);
Michal Vasko52927e22020-03-16 17:26:14 +01002466
2467 if (!value_len) {
2468 value = "";
2469 }
2470
2471 at = calloc(1, sizeof *at);
Michal Vasko6b5cb2a2020-11-11 19:11:21 +01002472 LY_CHECK_ERR_RET(!at, LOGMEM(ctx); ly_free_prefix_data(format, val_prefix_data), LY_EMEM);
Radek Krejcid46e46a2020-09-15 14:22:42 +02002473
Michal Vaskoad92b672020-11-12 13:11:31 +01002474 LY_CHECK_GOTO(ret = lydict_insert(ctx, name, name_len, &at->name.name), finish);
Michal Vasko501af032020-11-11 20:27:44 +01002475 if (prefix_len) {
Michal Vaskoad92b672020-11-12 13:11:31 +01002476 LY_CHECK_GOTO(ret = lydict_insert(ctx, prefix, prefix_len, &at->name.prefix), finish);
Michal Vasko501af032020-11-11 20:27:44 +01002477 }
2478 if (module_key_len) {
Michal Vaskoad92b672020-11-12 13:11:31 +01002479 LY_CHECK_GOTO(ret = lydict_insert(ctx, module_key, module_key_len, &at->name.module_ns), finish);
Michal Vasko501af032020-11-11 20:27:44 +01002480 }
2481
Michal Vasko52927e22020-03-16 17:26:14 +01002482 if (dynamic && *dynamic) {
Radek Krejci011e4aa2020-09-04 15:22:31 +02002483 ret = lydict_insert_zc(ctx, (char *)value, &at->value);
2484 LY_CHECK_GOTO(ret, finish);
Michal Vasko52927e22020-03-16 17:26:14 +01002485 *dynamic = 0;
2486 } else {
Radek Krejci011e4aa2020-09-04 15:22:31 +02002487 LY_CHECK_GOTO(ret = lydict_insert(ctx, value, value_len, &at->value), finish);
Michal Vasko52927e22020-03-16 17:26:14 +01002488 }
Michal Vasko501af032020-11-11 20:27:44 +01002489 at->format = format;
2490 at->val_prefix_data = val_prefix_data;
2491 at->hints = hints;
Michal Vasko52927e22020-03-16 17:26:14 +01002492
2493 /* insert as the last attribute */
2494 if (parent) {
Michal Vaskoa5da3292020-08-12 13:10:50 +02002495 lyd_insert_attr(parent, at);
Michal Vasko52927e22020-03-16 17:26:14 +01002496 } else if (*attr) {
Radek Krejci1e008d22020-08-17 11:37:37 +02002497 for (last = *attr; last->next; last = last->next) {}
Michal Vasko52927e22020-03-16 17:26:14 +01002498 last->next = at;
2499 }
2500
Radek Krejci011e4aa2020-09-04 15:22:31 +02002501finish:
2502 if (ret) {
2503 lyd_free_attr_single(ctx, at);
2504 } else if (attr) {
Michal Vasko52927e22020-03-16 17:26:14 +01002505 *attr = at;
2506 }
2507 return LY_SUCCESS;
2508}
2509
Radek Krejci084289f2019-07-09 17:35:30 +02002510API const struct lyd_node_term *
Michal Vasko004d3152020-06-11 19:59:22 +02002511lyd_target(const struct ly_path *path, const struct lyd_node *tree)
Radek Krejci084289f2019-07-09 17:35:30 +02002512{
Michal Vasko004d3152020-06-11 19:59:22 +02002513 struct lyd_node *target;
Radek Krejci084289f2019-07-09 17:35:30 +02002514
Michal Vasko004d3152020-06-11 19:59:22 +02002515 if (ly_path_eval(path, tree, &target)) {
2516 return NULL;
Radek Krejci084289f2019-07-09 17:35:30 +02002517 }
2518
Michal Vasko004d3152020-06-11 19:59:22 +02002519 return (struct lyd_node_term *)target;
Radek Krejci084289f2019-07-09 17:35:30 +02002520}
2521
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002522API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02002523lyd_compare_single(const struct lyd_node *node1, const struct lyd_node *node2, uint32_t options)
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002524{
2525 const struct lyd_node *iter1, *iter2;
2526 struct lyd_node_term *term1, *term2;
2527 struct lyd_node_any *any1, *any2;
Michal Vasko52927e22020-03-16 17:26:14 +01002528 struct lyd_node_opaq *opaq1, *opaq2;
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002529 size_t len1, len2;
Radek Krejci084289f2019-07-09 17:35:30 +02002530
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002531 if (!node1 || !node2) {
2532 if (node1 == node2) {
2533 return LY_SUCCESS;
2534 } else {
2535 return LY_ENOT;
2536 }
2537 }
2538
Michal Vaskob7be7a82020-08-20 09:09:04 +02002539 if ((LYD_CTX(node1) != LYD_CTX(node2)) || (node1->schema != node2->schema)) {
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002540 return LY_ENOT;
2541 }
2542
2543 if (node1->hash != node2->hash) {
2544 return LY_ENOT;
2545 }
Michal Vasko52927e22020-03-16 17:26:14 +01002546 /* 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 +02002547
Michal Vasko52927e22020-03-16 17:26:14 +01002548 if (!node1->schema) {
2549 opaq1 = (struct lyd_node_opaq *)node1;
2550 opaq2 = (struct lyd_node_opaq *)node2;
Michal Vaskoad92b672020-11-12 13:11:31 +01002551 if ((opaq1->name.name != opaq2->name.name) || (opaq1->format != opaq2->format) ||
2552 (opaq1->name.module_ns != opaq2->name.module_ns)) {
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002553 return LY_ENOT;
2554 }
Michal Vasko52927e22020-03-16 17:26:14 +01002555 switch (opaq1->format) {
Michal Vasko6b5cb2a2020-11-11 19:11:21 +01002556 case LY_PREF_XML:
2557 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 +01002558 return LY_ENOT;
2559 }
2560 break;
Michal Vasko6b5cb2a2020-11-11 19:11:21 +01002561 case LY_PREF_JSON:
Radek Krejci1798aae2020-07-14 13:26:06 +02002562 /* prefixes in JSON are unique, so it is not necessary to canonize the values */
2563 if (strcmp(opaq1->value, opaq2->value)) {
2564 return LY_ENOT;
2565 }
2566 break;
Michal Vasko6b5cb2a2020-11-11 19:11:21 +01002567 default:
Michal Vasko52927e22020-03-16 17:26:14 +01002568 /* not allowed */
Michal Vaskob7be7a82020-08-20 09:09:04 +02002569 LOGINT(LYD_CTX(node1));
Michal Vasko52927e22020-03-16 17:26:14 +01002570 return LY_EINT;
2571 }
2572 if (options & LYD_COMPARE_FULL_RECURSION) {
2573 iter1 = opaq1->child;
2574 iter2 = opaq2->child;
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002575 goto all_children_compare;
Michal Vasko52927e22020-03-16 17:26:14 +01002576 }
2577 return LY_SUCCESS;
2578 } else {
2579 switch (node1->schema->nodetype) {
2580 case LYS_LEAF:
2581 case LYS_LEAFLIST:
2582 if (options & LYD_COMPARE_DEFAULTS) {
2583 if ((node1->flags & LYD_DEFAULT) != (node2->flags & LYD_DEFAULT)) {
2584 return LY_ENOT;
2585 }
2586 }
2587
Michal Vasko1a2bf2e2020-06-16 13:07:48 +02002588 term1 = (struct lyd_node_term *)node1;
2589 term2 = (struct lyd_node_term *)node2;
Michal Vasko1a2bf2e2020-06-16 13:07:48 +02002590 return term1->value.realtype->plugin->compare(&term1->value, &term2->value);
Michal Vasko52927e22020-03-16 17:26:14 +01002591 case LYS_CONTAINER:
2592 if (options & LYD_COMPARE_DEFAULTS) {
2593 if ((node1->flags & LYD_DEFAULT) != (node2->flags & LYD_DEFAULT)) {
2594 return LY_ENOT;
2595 }
2596 }
2597 if (options & LYD_COMPARE_FULL_RECURSION) {
Michal Vasko9e685082021-01-29 14:49:09 +01002598 iter1 = lyd_child(node1);
2599 iter2 = lyd_child(node2);
Michal Vasko52927e22020-03-16 17:26:14 +01002600 goto all_children_compare;
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002601 }
2602 return LY_SUCCESS;
Michal Vasko1bf09392020-03-27 12:38:10 +01002603 case LYS_RPC:
Michal Vasko52927e22020-03-16 17:26:14 +01002604 case LYS_ACTION:
2605 if (options & LYD_COMPARE_FULL_RECURSION) {
2606 /* TODO action/RPC
2607 goto all_children_compare;
2608 */
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002609 }
2610 return LY_SUCCESS;
Michal Vasko52927e22020-03-16 17:26:14 +01002611 case LYS_NOTIF:
2612 if (options & LYD_COMPARE_FULL_RECURSION) {
2613 /* TODO Notification
2614 goto all_children_compare;
2615 */
2616 }
2617 return LY_SUCCESS;
2618 case LYS_LIST:
Michal Vasko9e685082021-01-29 14:49:09 +01002619 iter1 = lyd_child(node1);
2620 iter2 = lyd_child(node2);
Michal Vasko52927e22020-03-16 17:26:14 +01002621
2622 if (!(node1->schema->flags & LYS_KEYLESS) && !(options & LYD_COMPARE_FULL_RECURSION)) {
2623 /* lists with keys, their equivalence is based on their keys */
Michal Vasko544e58a2021-01-28 14:33:41 +01002624 for (const struct lysc_node *key = lysc_node_child(node1->schema);
Michal Vaskoc57d9a92020-06-23 13:28:27 +02002625 key && (key->flags & LYS_KEY);
Michal Vasko52927e22020-03-16 17:26:14 +01002626 key = key->next) {
Michal Vasko8f359bf2020-07-28 10:41:15 +02002627 if (lyd_compare_single(iter1, iter2, options)) {
Michal Vasko52927e22020-03-16 17:26:14 +01002628 return LY_ENOT;
2629 }
2630 iter1 = iter1->next;
2631 iter2 = iter2->next;
2632 }
2633 } else {
2634 /* lists without keys, their equivalence is based on equivalence of all the children (both direct and indirect) */
2635
Radek Krejci0f969882020-08-21 16:56:47 +02002636all_children_compare:
Michal Vasko52927e22020-03-16 17:26:14 +01002637 if (!iter1 && !iter2) {
2638 /* no children, nothing to compare */
2639 return LY_SUCCESS;
2640 }
2641
Michal Vaskod989ba02020-08-24 10:59:24 +02002642 for ( ; iter1 && iter2; iter1 = iter1->next, iter2 = iter2->next) {
Michal Vasko8f359bf2020-07-28 10:41:15 +02002643 if (lyd_compare_single(iter1, iter2, options | LYD_COMPARE_FULL_RECURSION)) {
Michal Vasko52927e22020-03-16 17:26:14 +01002644 return LY_ENOT;
2645 }
2646 }
2647 if (iter1 || iter2) {
2648 return LY_ENOT;
2649 }
2650 }
2651 return LY_SUCCESS;
2652 case LYS_ANYXML:
2653 case LYS_ANYDATA:
Michal Vasko22df3f02020-08-24 13:29:22 +02002654 any1 = (struct lyd_node_any *)node1;
2655 any2 = (struct lyd_node_any *)node2;
Michal Vasko52927e22020-03-16 17:26:14 +01002656
2657 if (any1->value_type != any2->value_type) {
2658 return LY_ENOT;
2659 }
2660 switch (any1->value_type) {
2661 case LYD_ANYDATA_DATATREE:
2662 iter1 = any1->value.tree;
2663 iter2 = any2->value.tree;
2664 goto all_children_compare;
2665 case LYD_ANYDATA_STRING:
2666 case LYD_ANYDATA_XML:
2667 case LYD_ANYDATA_JSON:
2668 len1 = strlen(any1->value.str);
2669 len2 = strlen(any2->value.str);
Michal Vasko69730152020-10-09 16:30:07 +02002670 if ((len1 != len2) || strcmp(any1->value.str, any2->value.str)) {
Michal Vasko52927e22020-03-16 17:26:14 +01002671 return LY_ENOT;
2672 }
2673 return LY_SUCCESS;
Michal Vasko52927e22020-03-16 17:26:14 +01002674 case LYD_ANYDATA_LYB:
Michal Vasko60ea6352020-06-29 13:39:39 +02002675 len1 = lyd_lyb_data_length(any1->value.mem);
2676 len2 = lyd_lyb_data_length(any2->value.mem);
Michal Vasko69730152020-10-09 16:30:07 +02002677 if ((len1 != len2) || memcmp(any1->value.mem, any2->value.mem, len1)) {
Michal Vasko52927e22020-03-16 17:26:14 +01002678 return LY_ENOT;
2679 }
2680 return LY_SUCCESS;
Michal Vasko52927e22020-03-16 17:26:14 +01002681 }
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002682 }
2683 }
2684
Michal Vaskob7be7a82020-08-20 09:09:04 +02002685 LOGINT(LYD_CTX(node1));
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002686 return LY_EINT;
2687}
Radek Krejci22ebdba2019-07-25 13:59:43 +02002688
Michal Vasko21725742020-06-29 11:49:25 +02002689API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02002690lyd_compare_siblings(const struct lyd_node *node1, const struct lyd_node *node2, uint32_t options)
Michal Vasko8f359bf2020-07-28 10:41:15 +02002691{
Michal Vaskod989ba02020-08-24 10:59:24 +02002692 for ( ; node1 && node2; node1 = node1->next, node2 = node2->next) {
Michal Vasko8f359bf2020-07-28 10:41:15 +02002693 LY_CHECK_RET(lyd_compare_single(node1, node2, options));
2694 }
2695
Michal Vasko11a81432020-07-28 16:31:29 +02002696 if (node1 == node2) {
2697 return LY_SUCCESS;
Michal Vasko8f359bf2020-07-28 10:41:15 +02002698 }
Michal Vasko11a81432020-07-28 16:31:29 +02002699 return LY_ENOT;
Michal Vasko8f359bf2020-07-28 10:41:15 +02002700}
2701
2702API LY_ERR
Michal Vasko21725742020-06-29 11:49:25 +02002703lyd_compare_meta(const struct lyd_meta *meta1, const struct lyd_meta *meta2)
2704{
2705 if (!meta1 || !meta2) {
2706 if (meta1 == meta2) {
2707 return LY_SUCCESS;
2708 } else {
2709 return LY_ENOT;
2710 }
2711 }
2712
Michal Vaskoa8083062020-11-06 17:22:10 +01002713 if ((meta1->annotation->module->ctx != meta2->annotation->module->ctx) || (meta1->annotation != meta2->annotation)) {
Michal Vasko21725742020-06-29 11:49:25 +02002714 return LY_ENOT;
2715 }
2716
Michal Vasko21725742020-06-29 11:49:25 +02002717 return meta1->value.realtype->plugin->compare(&meta1->value, &meta2->value);
2718}
2719
Radek Krejci22ebdba2019-07-25 13:59:43 +02002720/**
Michal Vasko52927e22020-03-16 17:26:14 +01002721 * @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 +02002722 *
2723 * 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 +02002724 *
2725 * @param[in] node Original node to duplicate
2726 * @param[in] parent Parent to insert into, NULL for top-level sibling.
2727 * @param[in,out] first First sibling, NULL if no top-level sibling exist yet. Can be also NULL if @p parent is set.
2728 * @param[in] options Bitmask of options flags, see @ref dupoptions.
2729 * @param[out] dup_p Pointer where the created duplicated node is placed (besides connecting it int @p parent / @p first sibling).
2730 * @return LY_ERR value
Radek Krejci22ebdba2019-07-25 13:59:43 +02002731 */
Michal Vasko52927e22020-03-16 17:26:14 +01002732static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02002733lyd_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 +02002734 struct lyd_node **dup_p)
Radek Krejci22ebdba2019-07-25 13:59:43 +02002735{
Michal Vasko52927e22020-03-16 17:26:14 +01002736 LY_ERR ret;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002737 struct lyd_node *dup = NULL;
Michal Vasko61551fa2020-07-09 15:45:45 +02002738 struct lyd_meta *meta;
2739 struct lyd_node_any *any;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002740
Michal Vasko52927e22020-03-16 17:26:14 +01002741 LY_CHECK_ARG_RET(NULL, node, LY_EINVAL);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002742
Michal Vasko52927e22020-03-16 17:26:14 +01002743 if (!node->schema) {
2744 dup = calloc(1, sizeof(struct lyd_node_opaq));
2745 } else {
2746 switch (node->schema->nodetype) {
Michal Vasko1bf09392020-03-27 12:38:10 +01002747 case LYS_RPC:
Michal Vasko52927e22020-03-16 17:26:14 +01002748 case LYS_ACTION:
2749 case LYS_NOTIF:
2750 case LYS_CONTAINER:
2751 case LYS_LIST:
2752 dup = calloc(1, sizeof(struct lyd_node_inner));
2753 break;
2754 case LYS_LEAF:
2755 case LYS_LEAFLIST:
2756 dup = calloc(1, sizeof(struct lyd_node_term));
2757 break;
2758 case LYS_ANYDATA:
2759 case LYS_ANYXML:
2760 dup = calloc(1, sizeof(struct lyd_node_any));
2761 break;
2762 default:
Michal Vaskob7be7a82020-08-20 09:09:04 +02002763 LOGINT(LYD_CTX(node));
Michal Vasko52927e22020-03-16 17:26:14 +01002764 ret = LY_EINT;
2765 goto error;
2766 }
Radek Krejci22ebdba2019-07-25 13:59:43 +02002767 }
Michal Vaskob7be7a82020-08-20 09:09:04 +02002768 LY_CHECK_ERR_GOTO(!dup, LOGMEM(LYD_CTX(node)); ret = LY_EMEM, error);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002769
Michal Vaskof6df0a02020-06-16 13:08:34 +02002770 if (options & LYD_DUP_WITH_FLAGS) {
2771 dup->flags = node->flags;
2772 } else {
2773 dup->flags = (node->flags & LYD_DEFAULT) | LYD_NEW;
2774 }
Radek Krejci22ebdba2019-07-25 13:59:43 +02002775 dup->schema = node->schema;
Michal Vasko52927e22020-03-16 17:26:14 +01002776 dup->prev = dup;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002777
Michal Vasko25a32822020-07-09 15:48:22 +02002778 /* duplicate metadata */
2779 if (!(options & LYD_DUP_NO_META)) {
2780 LY_LIST_FOR(node->meta, meta) {
Michal Vasko3a41dff2020-07-15 14:30:28 +02002781 LY_CHECK_GOTO(ret = lyd_dup_meta_single(meta, dup, NULL), error);
Michal Vasko25a32822020-07-09 15:48:22 +02002782 }
2783 }
Radek Krejci22ebdba2019-07-25 13:59:43 +02002784
2785 /* nodetype-specific work */
Michal Vasko52927e22020-03-16 17:26:14 +01002786 if (!dup->schema) {
2787 struct lyd_node_opaq *opaq = (struct lyd_node_opaq *)dup;
2788 struct lyd_node_opaq *orig = (struct lyd_node_opaq *)node;
2789 struct lyd_node *child;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002790
2791 if (options & LYD_DUP_RECURSIVE) {
2792 /* duplicate all the children */
2793 LY_LIST_FOR(orig->child, child) {
Michal Vasko3a41dff2020-07-15 14:30:28 +02002794 LY_CHECK_GOTO(ret = lyd_dup_r(child, dup, NULL, options, NULL), error);
Michal Vasko52927e22020-03-16 17:26:14 +01002795 }
2796 }
Michal Vaskoad92b672020-11-12 13:11:31 +01002797 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), orig->name.name, 0, &opaq->name.name), error);
Michal Vasko52927e22020-03-16 17:26:14 +01002798 opaq->format = orig->format;
Michal Vaskoad92b672020-11-12 13:11:31 +01002799 if (orig->name.prefix) {
2800 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), orig->name.prefix, 0, &opaq->name.prefix), error);
Michal Vasko52927e22020-03-16 17:26:14 +01002801 }
Michal Vaskoad92b672020-11-12 13:11:31 +01002802 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 +01002803 if (orig->val_prefix_data) {
2804 ret = ly_dup_prefix_data(LYD_CTX(node), opaq->format, orig->val_prefix_data, &opaq->val_prefix_data);
2805 LY_CHECK_GOTO(ret, error);
Michal Vasko52927e22020-03-16 17:26:14 +01002806 }
Radek Krejci011e4aa2020-09-04 15:22:31 +02002807 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), orig->value, 0, &opaq->value), error);
Michal Vasko52927e22020-03-16 17:26:14 +01002808 opaq->ctx = orig->ctx;
2809 } else if (dup->schema->nodetype & LYD_NODE_TERM) {
2810 struct lyd_node_term *term = (struct lyd_node_term *)dup;
2811 struct lyd_node_term *orig = (struct lyd_node_term *)node;
2812
2813 term->hash = orig->hash;
Michal Vaskob7be7a82020-08-20 09:09:04 +02002814 LY_CHECK_ERR_GOTO(orig->value.realtype->plugin->duplicate(LYD_CTX(node), &orig->value, &term->value),
Michal Vasko69730152020-10-09 16:30:07 +02002815 LOGERR(LYD_CTX(node), LY_EINT, "Value duplication failed."); ret = LY_EINT, error);
Michal Vasko52927e22020-03-16 17:26:14 +01002816 } else if (dup->schema->nodetype & LYD_NODE_INNER) {
2817 struct lyd_node_inner *orig = (struct lyd_node_inner *)node;
2818 struct lyd_node *child;
2819
2820 if (options & LYD_DUP_RECURSIVE) {
2821 /* duplicate all the children */
2822 LY_LIST_FOR(orig->child, child) {
Michal Vasko3a41dff2020-07-15 14:30:28 +02002823 LY_CHECK_GOTO(ret = lyd_dup_r(child, dup, NULL, options, NULL), error);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002824 }
Michal Vasko69730152020-10-09 16:30:07 +02002825 } else if ((dup->schema->nodetype == LYS_LIST) && !(dup->schema->flags & LYS_KEYLESS)) {
Radek Krejci22ebdba2019-07-25 13:59:43 +02002826 /* always duplicate keys of a list */
Radek Krejci22ebdba2019-07-25 13:59:43 +02002827 child = orig->child;
Michal Vasko544e58a2021-01-28 14:33:41 +01002828 for (const struct lysc_node *key = lysc_node_child(dup->schema);
Michal Vaskoc57d9a92020-06-23 13:28:27 +02002829 key && (key->flags & LYS_KEY);
Radek Krejci0fe9b512019-07-26 17:51:05 +02002830 key = key->next) {
Radek Krejci22ebdba2019-07-25 13:59:43 +02002831 if (!child) {
2832 /* possibly not keys are present in filtered tree */
2833 break;
Radek Krejci0fe9b512019-07-26 17:51:05 +02002834 } else if (child->schema != key) {
2835 /* possibly not all keys are present in filtered tree,
2836 * but there can be also some non-key nodes */
2837 continue;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002838 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02002839 LY_CHECK_GOTO(ret = lyd_dup_r(child, dup, NULL, options, NULL), error);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002840 child = child->next;
2841 }
2842 }
2843 lyd_hash(dup);
2844 } else if (dup->schema->nodetype & LYD_NODE_ANY) {
Michal Vasko61551fa2020-07-09 15:45:45 +02002845 dup->hash = node->hash;
2846 any = (struct lyd_node_any *)node;
2847 LY_CHECK_GOTO(ret = lyd_any_copy_value(dup, &any->value, any->value_type), error);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002848 }
2849
Michal Vasko52927e22020-03-16 17:26:14 +01002850 /* insert */
2851 lyd_insert_node(parent, first, dup);
Michal Vasko52927e22020-03-16 17:26:14 +01002852
2853 if (dup_p) {
2854 *dup_p = dup;
2855 }
2856 return LY_SUCCESS;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002857
2858error:
Michal Vasko52927e22020-03-16 17:26:14 +01002859 lyd_free_tree(dup);
2860 return ret;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002861}
2862
Michal Vasko3a41dff2020-07-15 14:30:28 +02002863static LY_ERR
2864lyd_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 +02002865 struct lyd_node_inner **local_parent)
Radek Krejci22ebdba2019-07-25 13:59:43 +02002866{
Michal Vasko3a41dff2020-07-15 14:30:28 +02002867 const struct lyd_node_inner *orig_parent, *iter;
Radek Krejci857189e2020-09-01 13:26:36 +02002868 ly_bool repeat = 1;
Michal Vasko3a41dff2020-07-15 14:30:28 +02002869
2870 *dup_parent = NULL;
2871 *local_parent = NULL;
2872
2873 for (orig_parent = node->parent; repeat && orig_parent; orig_parent = orig_parent->parent) {
2874 if (parent && (parent->schema == orig_parent->schema)) {
2875 /* stop creating parents, connect what we have into the provided parent */
2876 iter = parent;
2877 repeat = 0;
2878 } else {
2879 iter = NULL;
2880 LY_CHECK_RET(lyd_dup_r((struct lyd_node *)orig_parent, NULL, (struct lyd_node **)&iter, 0,
Radek Krejci0f969882020-08-21 16:56:47 +02002881 (struct lyd_node **)&iter));
Michal Vasko3a41dff2020-07-15 14:30:28 +02002882 }
2883 if (!*local_parent) {
2884 *local_parent = (struct lyd_node_inner *)iter;
2885 }
2886 if (iter->child) {
2887 /* 1) list - add after keys
2888 * 2) provided parent with some children */
2889 iter->child->prev->next = *dup_parent;
2890 if (*dup_parent) {
2891 (*dup_parent)->prev = iter->child->prev;
2892 iter->child->prev = *dup_parent;
2893 }
2894 } else {
2895 ((struct lyd_node_inner *)iter)->child = *dup_parent;
2896 }
2897 if (*dup_parent) {
2898 (*dup_parent)->parent = (struct lyd_node_inner *)iter;
2899 }
2900 *dup_parent = (struct lyd_node *)iter;
2901 }
2902
2903 if (repeat && parent) {
2904 /* given parent and created parents chain actually do not interconnect */
Michal Vaskob7be7a82020-08-20 09:09:04 +02002905 LOGERR(LYD_CTX(node), LY_EINVAL,
Michal Vasko69730152020-10-09 16:30:07 +02002906 "Invalid argument parent (%s()) - does not interconnect with the created node's parents chain.", __func__);
Michal Vasko3a41dff2020-07-15 14:30:28 +02002907 return LY_EINVAL;
2908 }
2909
2910 return LY_SUCCESS;
2911}
2912
2913static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02002914lyd_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 +02002915{
2916 LY_ERR rc;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002917 const struct lyd_node *orig; /* original node to be duplicated */
2918 struct lyd_node *first = NULL; /* the first duplicated node, this is returned */
Radek Krejci22ebdba2019-07-25 13:59:43 +02002919 struct lyd_node *top = NULL; /* the most higher created node */
2920 struct lyd_node_inner *local_parent = NULL; /* the direct parent node for the duplicated node(s) */
Radek Krejci22ebdba2019-07-25 13:59:43 +02002921
Michal Vasko3a41dff2020-07-15 14:30:28 +02002922 LY_CHECK_ARG_RET(NULL, node, LY_EINVAL);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002923
2924 if (options & LYD_DUP_WITH_PARENTS) {
Michal Vasko3a41dff2020-07-15 14:30:28 +02002925 LY_CHECK_GOTO(rc = lyd_dup_get_local_parent(node, parent, &top, &local_parent), error);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002926 } else {
2927 local_parent = parent;
2928 }
2929
Radek Krejci22ebdba2019-07-25 13:59:43 +02002930 LY_LIST_FOR(node, orig) {
Michal Vasko35f4d772021-01-12 12:08:57 +01002931 if (lysc_is_key(orig->schema)) {
2932 if (local_parent) {
2933 /* the key must already exist in the parent */
2934 rc = lyd_find_sibling_schema(local_parent->child, orig->schema, first ? NULL : &first);
2935 LY_CHECK_ERR_GOTO(rc, LOGINT(LYD_CTX(node)), error);
2936 } else {
2937 assert(!(options & LYD_DUP_WITH_PARENTS));
2938 /* duplicating a single key, okay, I suppose... */
2939 rc = lyd_dup_r(orig, NULL, &first, options, first ? NULL : &first);
2940 LY_CHECK_GOTO(rc, error);
2941 }
2942 } else {
2943 /* if there is no local parent, it will be inserted into first */
Michal Vasko9e685082021-01-29 14:49:09 +01002944 rc = lyd_dup_r(orig, &local_parent->node, &first, options, first ? NULL : &first);
Michal Vasko35f4d772021-01-12 12:08:57 +01002945 LY_CHECK_GOTO(rc, error);
2946 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02002947 if (nosiblings) {
Radek Krejci22ebdba2019-07-25 13:59:43 +02002948 break;
2949 }
2950 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02002951
2952 /* rehash if needed */
Michal Vaskod989ba02020-08-24 10:59:24 +02002953 for ( ; local_parent; local_parent = local_parent->parent) {
Michal Vasko69730152020-10-09 16:30:07 +02002954 if ((local_parent->schema->nodetype == LYS_LIST) && (local_parent->schema->flags & LYS_KEYLESS)) {
Michal Vasko9e685082021-01-29 14:49:09 +01002955 lyd_hash(&local_parent->node);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002956 }
2957 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02002958
2959 if (dup) {
2960 *dup = first;
2961 }
2962 return LY_SUCCESS;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002963
2964error:
2965 if (top) {
2966 lyd_free_tree(top);
2967 } else {
Michal Vaskof03ed032020-03-04 13:31:44 +01002968 lyd_free_siblings(first);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002969 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02002970 return rc;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002971}
Michal Vasko5ec7cda2019-09-11 13:43:08 +02002972
Michal Vasko3a41dff2020-07-15 14:30:28 +02002973API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02002974lyd_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 +02002975{
2976 return lyd_dup(node, parent, options, 1, dup);
2977}
2978
2979API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02002980lyd_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 +02002981{
2982 return lyd_dup(node, parent, options, 0, dup);
2983}
2984
2985API LY_ERR
2986lyd_dup_meta_single(const struct lyd_meta *meta, struct lyd_node *node, struct lyd_meta **dup)
Michal Vasko25a32822020-07-09 15:48:22 +02002987{
Radek Krejci011e4aa2020-09-04 15:22:31 +02002988 LY_ERR ret = LY_SUCCESS;
Michal Vasko25a32822020-07-09 15:48:22 +02002989 struct lyd_meta *mt, *last;
2990
Michal Vasko3a41dff2020-07-15 14:30:28 +02002991 LY_CHECK_ARG_RET(NULL, meta, node, LY_EINVAL);
Michal Vasko25a32822020-07-09 15:48:22 +02002992
2993 /* create a copy */
2994 mt = calloc(1, sizeof *mt);
Michal Vaskob7be7a82020-08-20 09:09:04 +02002995 LY_CHECK_ERR_RET(!mt, LOGMEM(LYD_CTX(node)), LY_EMEM);
Michal Vasko25a32822020-07-09 15:48:22 +02002996 mt->annotation = meta->annotation;
Michal Vaskob7be7a82020-08-20 09:09:04 +02002997 ret = meta->value.realtype->plugin->duplicate(LYD_CTX(node), &meta->value, &mt->value);
Radek Krejci011e4aa2020-09-04 15:22:31 +02002998 LY_CHECK_ERR_GOTO(ret, LOGERR(LYD_CTX(node), LY_EINT, "Value duplication failed."), finish);
2999 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), meta->name, 0, &mt->name), finish);
Michal Vasko25a32822020-07-09 15:48:22 +02003000
3001 /* insert as the last attribute */
Radek Krejci011e4aa2020-09-04 15:22:31 +02003002 mt->parent = node;
Michal Vasko25a32822020-07-09 15:48:22 +02003003 if (node->meta) {
Radek Krejci1e008d22020-08-17 11:37:37 +02003004 for (last = node->meta; last->next; last = last->next) {}
Michal Vasko25a32822020-07-09 15:48:22 +02003005 last->next = mt;
3006 } else {
3007 node->meta = mt;
3008 }
3009
Radek Krejci011e4aa2020-09-04 15:22:31 +02003010finish:
3011 if (ret) {
3012 lyd_free_meta_single(mt);
3013 } else if (dup) {
Michal Vasko3a41dff2020-07-15 14:30:28 +02003014 *dup = mt;
3015 }
3016 return LY_SUCCESS;
Michal Vasko25a32822020-07-09 15:48:22 +02003017}
3018
Michal Vasko4490d312020-06-16 13:08:55 +02003019/**
3020 * @brief Merge a source sibling into target siblings.
3021 *
3022 * @param[in,out] first_trg First target sibling, is updated if top-level.
3023 * @param[in] parent_trg Target parent.
3024 * @param[in,out] sibling_src Source sibling to merge, set to NULL if spent.
3025 * @param[in] options Merge options.
3026 * @return LY_ERR value.
3027 */
3028static LY_ERR
3029lyd_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 +02003030 uint16_t options)
Michal Vasko4490d312020-06-16 13:08:55 +02003031{
3032 LY_ERR ret;
3033 const struct lyd_node *child_src, *tmp, *sibling_src;
Michal Vasko56daf732020-08-10 10:57:18 +02003034 struct lyd_node *match_trg, *dup_src, *elem;
Michal Vasko4490d312020-06-16 13:08:55 +02003035 struct lysc_type *type;
Michal Vasko4490d312020-06-16 13:08:55 +02003036
3037 sibling_src = *sibling_src_p;
3038 if (sibling_src->schema->nodetype & (LYS_LIST | LYS_LEAFLIST)) {
3039 /* try to find the exact instance */
3040 ret = lyd_find_sibling_first(*first_trg, sibling_src, &match_trg);
3041 } else {
3042 /* try to simply find the node, there cannot be more instances */
3043 ret = lyd_find_sibling_val(*first_trg, sibling_src->schema, NULL, 0, &match_trg);
3044 }
3045
3046 if (!ret) {
3047 /* node found, make sure even value matches for all node types */
Michal Vasko8f359bf2020-07-28 10:41:15 +02003048 if ((match_trg->schema->nodetype == LYS_LEAF) && lyd_compare_single(sibling_src, match_trg, LYD_COMPARE_DEFAULTS)) {
Michal Vasko4490d312020-06-16 13:08:55 +02003049 /* since they are different, they cannot both be default */
3050 assert(!(sibling_src->flags & LYD_DEFAULT) || !(match_trg->flags & LYD_DEFAULT));
3051
Michal Vasko3a41dff2020-07-15 14:30:28 +02003052 /* update value (or only LYD_DEFAULT flag) only if flag set or the source node is not default */
3053 if ((options & LYD_MERGE_DEFAULTS) || !(sibling_src->flags & LYD_DEFAULT)) {
Michal Vasko4490d312020-06-16 13:08:55 +02003054 type = ((struct lysc_node_leaf *)match_trg->schema)->type;
Michal Vaskob7be7a82020-08-20 09:09:04 +02003055 type->plugin->free(LYD_CTX(match_trg), &((struct lyd_node_term *)match_trg)->value);
3056 LY_CHECK_RET(type->plugin->duplicate(LYD_CTX(match_trg), &((struct lyd_node_term *)sibling_src)->value,
Michal Vasko69730152020-10-09 16:30:07 +02003057 &((struct lyd_node_term *)match_trg)->value));
Michal Vasko4490d312020-06-16 13:08:55 +02003058
3059 /* copy flags and add LYD_NEW */
3060 match_trg->flags = sibling_src->flags | LYD_NEW;
3061 }
Michal Vasko8f359bf2020-07-28 10:41:15 +02003062 } else if ((match_trg->schema->nodetype & LYS_ANYDATA) && lyd_compare_single(sibling_src, match_trg, 0)) {
Michal Vasko4c583e82020-07-17 12:16:14 +02003063 /* update value */
3064 LY_CHECK_RET(lyd_any_copy_value(match_trg, &((struct lyd_node_any *)sibling_src)->value,
Radek Krejci0f969882020-08-21 16:56:47 +02003065 ((struct lyd_node_any *)sibling_src)->value_type));
Michal Vasko4490d312020-06-16 13:08:55 +02003066
3067 /* copy flags and add LYD_NEW */
3068 match_trg->flags = sibling_src->flags | LYD_NEW;
Michal Vasko4490d312020-06-16 13:08:55 +02003069 } else {
3070 /* check descendants, recursively */
Radek Krejcia1c1e542020-09-29 16:06:52 +02003071 LY_LIST_FOR_SAFE(lyd_child_no_keys(sibling_src), tmp, child_src) {
Michal Vaskoe0665742021-02-11 11:08:44 +01003072 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 +02003073 }
3074 }
3075 } else {
3076 /* node not found, merge it */
3077 if (options & LYD_MERGE_DESTRUCT) {
3078 dup_src = (struct lyd_node *)sibling_src;
3079 lyd_unlink_tree(dup_src);
3080 /* spend it */
3081 *sibling_src_p = NULL;
3082 } else {
Michal Vasko3a41dff2020-07-15 14:30:28 +02003083 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 +02003084 }
3085
3086 /* set LYD_NEW for all the new nodes, required for validation */
Michal Vasko56daf732020-08-10 10:57:18 +02003087 LYD_TREE_DFS_BEGIN(dup_src, elem) {
Michal Vasko4490d312020-06-16 13:08:55 +02003088 elem->flags |= LYD_NEW;
Michal Vasko56daf732020-08-10 10:57:18 +02003089 LYD_TREE_DFS_END(dup_src, elem);
Michal Vasko4490d312020-06-16 13:08:55 +02003090 }
3091
3092 lyd_insert_node(parent_trg, first_trg, dup_src);
3093 }
3094
3095 return LY_SUCCESS;
3096}
3097
Michal Vasko3a41dff2020-07-15 14:30:28 +02003098static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02003099lyd_merge(struct lyd_node **target, const struct lyd_node *source, uint16_t options, ly_bool nosiblings)
Michal Vasko4490d312020-06-16 13:08:55 +02003100{
3101 const struct lyd_node *sibling_src, *tmp;
Radek Krejci857189e2020-09-01 13:26:36 +02003102 ly_bool first;
Michal Vasko4490d312020-06-16 13:08:55 +02003103
3104 LY_CHECK_ARG_RET(NULL, target, LY_EINVAL);
3105
3106 if (!source) {
3107 /* nothing to merge */
3108 return LY_SUCCESS;
3109 }
3110
Michal Vasko831422b2020-11-24 11:20:51 +01003111 if ((*target && lysc_data_parent((*target)->schema)) || lysc_data_parent(source->schema)) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02003112 LOGERR(LYD_CTX(source), LY_EINVAL, "Invalid arguments - can merge only 2 top-level subtrees (%s()).", __func__);
Michal Vasko4490d312020-06-16 13:08:55 +02003113 return LY_EINVAL;
3114 }
3115
3116 LY_LIST_FOR_SAFE(source, tmp, sibling_src) {
Radek Krejci857189e2020-09-01 13:26:36 +02003117 first = (sibling_src == source) ? 1 : 0;
Michal Vasko4490d312020-06-16 13:08:55 +02003118 LY_CHECK_RET(lyd_merge_sibling_r(target, NULL, &sibling_src, options));
3119 if (first && !sibling_src) {
3120 /* source was spent (unlinked), move to the next node */
3121 source = tmp;
3122 }
3123
Michal Vasko3a41dff2020-07-15 14:30:28 +02003124 if (nosiblings) {
Michal Vasko4490d312020-06-16 13:08:55 +02003125 break;
3126 }
3127 }
3128
3129 if (options & LYD_MERGE_DESTRUCT) {
3130 /* free any leftover source data that were not merged */
3131 lyd_free_siblings((struct lyd_node *)source);
3132 }
3133
3134 return LY_SUCCESS;
3135}
3136
Michal Vasko3a41dff2020-07-15 14:30:28 +02003137API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02003138lyd_merge_tree(struct lyd_node **target, const struct lyd_node *source, uint16_t options)
Michal Vasko3a41dff2020-07-15 14:30:28 +02003139{
3140 return lyd_merge(target, source, options, 1);
3141}
3142
3143API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02003144lyd_merge_siblings(struct lyd_node **target, const struct lyd_node *source, uint16_t options)
Michal Vasko3a41dff2020-07-15 14:30:28 +02003145{
3146 return lyd_merge(target, source, options, 0);
3147}
3148
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003149static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02003150lyd_path_str_enlarge(char **buffer, size_t *buflen, size_t reqlen, ly_bool is_static)
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003151{
Michal Vasko14654712020-02-06 08:35:21 +01003152 /* ending \0 */
3153 ++reqlen;
3154
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003155 if (reqlen > *buflen) {
3156 if (is_static) {
3157 return LY_EINCOMPLETE;
3158 }
3159
3160 *buffer = ly_realloc(*buffer, reqlen * sizeof **buffer);
3161 if (!*buffer) {
3162 return LY_EMEM;
3163 }
3164
3165 *buflen = reqlen;
3166 }
3167
3168 return LY_SUCCESS;
3169}
3170
Michal Vaskod59035b2020-07-08 12:00:06 +02003171LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02003172lyd_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 +02003173{
3174 const struct lyd_node *key;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003175 size_t len;
3176 const char *val;
3177 char quot;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003178
Radek Krejcia1c1e542020-09-29 16:06:52 +02003179 for (key = lyd_child(node); key && (key->schema->flags & LYS_KEY); key = key->next) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02003180 val = LYD_CANON_VALUE(key);
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003181 len = 1 + strlen(key->schema->name) + 2 + strlen(val) + 2;
Michal Vaskoba99a3e2020-08-18 15:50:05 +02003182 LY_CHECK_RET(lyd_path_str_enlarge(buffer, buflen, *bufused + len, is_static));
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003183
3184 quot = '\'';
3185 if (strchr(val, '\'')) {
3186 quot = '"';
3187 }
3188 *bufused += sprintf(*buffer + *bufused, "[%s=%c%s%c]", key->schema->name, quot, val, quot);
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003189 }
3190
3191 return LY_SUCCESS;
3192}
3193
3194/**
3195 * @brief Append leaf-list value predicate to path.
3196 *
3197 * @param[in] node Node to print.
3198 * @param[in,out] buffer Buffer to print to.
3199 * @param[in,out] buflen Current buffer length.
3200 * @param[in,out] bufused Current number of characters used in @p buffer.
3201 * @param[in] is_static Whether buffer is static or can be reallocated.
3202 * @return LY_ERR
3203 */
3204static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02003205lyd_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 +02003206{
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003207 size_t len;
3208 const char *val;
3209 char quot;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003210
Michal Vaskob7be7a82020-08-20 09:09:04 +02003211 val = LYD_CANON_VALUE(node);
Radek Krejcif13b87b2020-12-01 22:02:17 +01003212 len = 4 + strlen(val) + 2; /* "[.='" + val + "']" */
Michal Vaskoba99a3e2020-08-18 15:50:05 +02003213 LY_CHECK_RET(lyd_path_str_enlarge(buffer, buflen, *bufused + len, is_static));
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003214
3215 quot = '\'';
3216 if (strchr(val, '\'')) {
3217 quot = '"';
3218 }
3219 *bufused += sprintf(*buffer + *bufused, "[.=%c%s%c]", quot, val, quot);
3220
Michal Vaskoba99a3e2020-08-18 15:50:05 +02003221 return LY_SUCCESS;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003222}
3223
3224/**
3225 * @brief Append node position (relative to its other instances) predicate to path.
3226 *
3227 * @param[in] node Node to print.
3228 * @param[in,out] buffer Buffer to print to.
3229 * @param[in,out] buflen Current buffer length.
3230 * @param[in,out] bufused Current number of characters used in @p buffer.
3231 * @param[in] is_static Whether buffer is static or can be reallocated.
3232 * @return LY_ERR
3233 */
3234static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02003235lyd_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 +02003236{
3237 const struct lyd_node *first, *iter;
3238 size_t len;
Radek Krejci1deb5be2020-08-26 16:43:36 +02003239 uint64_t pos;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003240 char *val = NULL;
3241 LY_ERR rc;
3242
3243 if (node->parent) {
3244 first = node->parent->child;
3245 } else {
Michal Vaskoe070bfe2020-08-31 12:27:25 +02003246 for (first = node; first->prev->next; first = first->prev) {}
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003247 }
3248 pos = 1;
3249 for (iter = first; iter != node; iter = iter->next) {
3250 if (iter->schema == node->schema) {
3251 ++pos;
3252 }
3253 }
Radek Krejci1deb5be2020-08-26 16:43:36 +02003254 if (asprintf(&val, "%" PRIu64, pos) == -1) {
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003255 return LY_EMEM;
3256 }
3257
3258 len = 1 + strlen(val) + 1;
3259 rc = lyd_path_str_enlarge(buffer, buflen, *bufused + len, is_static);
3260 if (rc != LY_SUCCESS) {
3261 goto cleanup;
3262 }
3263
3264 *bufused += sprintf(*buffer + *bufused, "[%s]", val);
3265
3266cleanup:
3267 free(val);
3268 return rc;
3269}
3270
3271API char *
3272lyd_path(const struct lyd_node *node, LYD_PATH_TYPE pathtype, char *buffer, size_t buflen)
3273{
Radek Krejci857189e2020-09-01 13:26:36 +02003274 ly_bool is_static = 0;
Radek Krejci1deb5be2020-08-26 16:43:36 +02003275 uint32_t i, depth;
Michal Vasko14654712020-02-06 08:35:21 +01003276 size_t bufused = 0, len;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003277 const struct lyd_node *iter;
3278 const struct lys_module *mod;
Michal Vasko790b2bc2020-08-03 13:35:06 +02003279 LY_ERR rc = LY_SUCCESS;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003280
3281 LY_CHECK_ARG_RET(NULL, node, NULL);
3282 if (buffer) {
3283 LY_CHECK_ARG_RET(node->schema->module->ctx, buflen > 1, NULL);
3284 is_static = 1;
Michal Vasko14654712020-02-06 08:35:21 +01003285 } else {
3286 buflen = 0;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003287 }
3288
3289 switch (pathtype) {
Radek Krejci635d2b82021-01-04 11:26:51 +01003290 case LYD_PATH_STD:
3291 case LYD_PATH_STD_NO_LAST_PRED:
Michal Vasko14654712020-02-06 08:35:21 +01003292 depth = 1;
Michal Vasko9e685082021-01-29 14:49:09 +01003293 for (iter = node; iter->parent; iter = lyd_parent(iter)) {
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003294 ++depth;
3295 }
3296
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003297 goto iter_print;
Michal Vasko14654712020-02-06 08:35:21 +01003298 while (depth) {
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003299 /* find the right node */
Michal Vasko9e685082021-01-29 14:49:09 +01003300 for (iter = node, i = 1; i < depth; iter = lyd_parent(iter), ++i) {}
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003301iter_print:
3302 /* print prefix and name */
3303 mod = NULL;
Michal Vasko69730152020-10-09 16:30:07 +02003304 if (iter->schema && (!iter->parent || (iter->schema->module != iter->parent->schema->module))) {
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003305 mod = iter->schema->module;
3306 }
3307
3308 /* realloc string */
Michal Vaskoad92b672020-11-12 13:11:31 +01003309 len = 1 + (mod ? strlen(mod->name) + 1 : 0) + (iter->schema ? strlen(iter->schema->name) :
3310 strlen(((struct lyd_node_opaq *)iter)->name.name));
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003311 rc = lyd_path_str_enlarge(&buffer, &buflen, bufused + len, is_static);
3312 if (rc != LY_SUCCESS) {
3313 break;
3314 }
3315
3316 /* print next node */
Radek Krejci1798aae2020-07-14 13:26:06 +02003317 bufused += sprintf(buffer + bufused, "/%s%s%s", mod ? mod->name : "", mod ? ":" : "",
Michal Vaskoad92b672020-11-12 13:11:31 +01003318 iter->schema ? iter->schema->name : ((struct lyd_node_opaq *)iter)->name.name);
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003319
Michal Vasko790b2bc2020-08-03 13:35:06 +02003320 /* do not always print the last (first) predicate */
Radek Krejci635d2b82021-01-04 11:26:51 +01003321 if (iter->schema && ((depth > 1) || (pathtype == LYD_PATH_STD))) {
Michal Vasko790b2bc2020-08-03 13:35:06 +02003322 switch (iter->schema->nodetype) {
3323 case LYS_LIST:
3324 if (iter->schema->flags & LYS_KEYLESS) {
3325 /* print its position */
3326 rc = lyd_path_position_predicate(iter, &buffer, &buflen, &bufused, is_static);
3327 } else {
3328 /* print all list keys in predicates */
3329 rc = lyd_path_list_predicate(iter, &buffer, &buflen, &bufused, is_static);
3330 }
3331 break;
3332 case LYS_LEAFLIST:
3333 if (iter->schema->flags & LYS_CONFIG_W) {
3334 /* print leaf-list value */
3335 rc = lyd_path_leaflist_predicate(iter, &buffer, &buflen, &bufused, is_static);
3336 } else {
3337 /* print its position */
3338 rc = lyd_path_position_predicate(iter, &buffer, &buflen, &bufused, is_static);
3339 }
3340 break;
3341 default:
3342 /* nothing to print more */
3343 break;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003344 }
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003345 }
3346 if (rc != LY_SUCCESS) {
3347 break;
3348 }
3349
Michal Vasko14654712020-02-06 08:35:21 +01003350 --depth;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003351 }
3352 break;
3353 }
3354
3355 return buffer;
3356}
Michal Vaskoe444f752020-02-10 12:20:06 +01003357
Michal Vasko25a32822020-07-09 15:48:22 +02003358API struct lyd_meta *
3359lyd_find_meta(const struct lyd_meta *first, const struct lys_module *module, const char *name)
3360{
3361 struct lyd_meta *ret = NULL;
3362 const struct ly_ctx *ctx;
3363 const char *prefix, *tmp;
3364 char *str;
3365 size_t pref_len, name_len;
3366
3367 LY_CHECK_ARG_RET(NULL, module || strchr(name, ':'), name, NULL);
3368
3369 if (!first) {
3370 return NULL;
3371 }
3372
3373 ctx = first->annotation->module->ctx;
3374
3375 /* parse the name */
3376 tmp = name;
3377 if (ly_parse_nodeid(&tmp, &prefix, &pref_len, &name, &name_len) || tmp[0]) {
3378 LOGERR(ctx, LY_EINVAL, "Metadata name \"%s\" is not valid.", name);
3379 return NULL;
3380 }
3381
3382 /* find the module */
3383 if (prefix) {
3384 str = strndup(prefix, pref_len);
3385 module = ly_ctx_get_module_latest(ctx, str);
3386 free(str);
3387 LY_CHECK_ERR_RET(!module, LOGERR(ctx, LY_EINVAL, "Module \"%.*s\" not found.", pref_len, prefix), NULL);
3388 }
3389
3390 /* find the metadata */
3391 LY_LIST_FOR(first, first) {
3392 if ((first->annotation->module == module) && !strcmp(first->name, name)) {
3393 ret = (struct lyd_meta *)first;
3394 break;
3395 }
3396 }
3397
3398 return ret;
3399}
3400
Michal Vasko9b368d32020-02-14 13:53:31 +01003401API LY_ERR
Michal Vaskoe444f752020-02-10 12:20:06 +01003402lyd_find_sibling_first(const struct lyd_node *siblings, const struct lyd_node *target, struct lyd_node **match)
3403{
3404 struct lyd_node **match_p;
3405 struct lyd_node_inner *parent;
3406
Michal Vaskof03ed032020-03-04 13:31:44 +01003407 LY_CHECK_ARG_RET(NULL, target, LY_EINVAL);
Michal Vaskoe444f752020-02-10 12:20:06 +01003408
Michal Vasko6da1e952020-12-09 18:14:38 +01003409 if (!siblings || (siblings->schema && target->schema &&
3410 (lysc_data_parent(siblings->schema) != lysc_data_parent(target->schema)))) {
Michal Vasko62ed12d2020-05-21 10:08:25 +02003411 /* no data or schema mismatch */
Michal Vasko9b368d32020-02-14 13:53:31 +01003412 if (match) {
3413 *match = NULL;
3414 }
Michal Vaskoe444f752020-02-10 12:20:06 +01003415 return LY_ENOTFOUND;
3416 }
3417
3418 /* find first sibling */
3419 if (siblings->parent) {
3420 siblings = siblings->parent->child;
3421 } else {
3422 while (siblings->prev->next) {
3423 siblings = siblings->prev;
3424 }
3425 }
3426
Michal Vasko9e685082021-01-29 14:49:09 +01003427 parent = siblings->parent;
Michal Vasko6da1e952020-12-09 18:14:38 +01003428 if (parent && parent->schema && parent->children_ht) {
Michal Vaskoe444f752020-02-10 12:20:06 +01003429 assert(target->hash);
3430
3431 /* find by hash */
3432 if (!lyht_find(parent->children_ht, &target, target->hash, (void **)&match_p)) {
Michal Vaskoda859032020-07-14 12:20:14 +02003433 /* check even value when needed */
Michal Vasko8f359bf2020-07-28 10:41:15 +02003434 if (!(target->schema->nodetype & (LYS_LIST | LYS_LEAFLIST)) || !lyd_compare_single(target, *match_p, 0)) {
Michal Vaskoda859032020-07-14 12:20:14 +02003435 siblings = *match_p;
3436 } else {
3437 siblings = NULL;
3438 }
Michal Vaskoe444f752020-02-10 12:20:06 +01003439 } else {
3440 /* not found */
3441 siblings = NULL;
3442 }
3443 } else {
3444 /* no children hash table */
Michal Vaskod989ba02020-08-24 10:59:24 +02003445 for ( ; siblings; siblings = siblings->next) {
Michal Vasko8f359bf2020-07-28 10:41:15 +02003446 if (!lyd_compare_single(siblings, target, 0)) {
Michal Vaskoe444f752020-02-10 12:20:06 +01003447 break;
3448 }
3449 }
3450 }
3451
3452 if (!siblings) {
Michal Vasko9b368d32020-02-14 13:53:31 +01003453 if (match) {
3454 *match = NULL;
3455 }
Michal Vaskoe444f752020-02-10 12:20:06 +01003456 return LY_ENOTFOUND;
3457 }
3458
Michal Vasko9b368d32020-02-14 13:53:31 +01003459 if (match) {
3460 *match = (struct lyd_node *)siblings;
3461 }
Michal Vaskoe444f752020-02-10 12:20:06 +01003462 return LY_SUCCESS;
3463}
3464
Radek Krejci857189e2020-09-01 13:26:36 +02003465/**
3466 * @brief Comparison callback to match schema node with a schema of a data node.
3467 *
3468 * @param[in] val1_p Pointer to the schema node
3469 * @param[in] val2_p Pointer to the data node
3470 * Implementation of ::values_equal_cb.
3471 */
3472static ly_bool
3473lyd_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 +01003474{
3475 struct lysc_node *val1;
3476 struct lyd_node *val2;
3477
3478 val1 = *((struct lysc_node **)val1_p);
3479 val2 = *((struct lyd_node **)val2_p);
3480
Michal Vasko90932a92020-02-12 14:33:03 +01003481 if (val1 == val2->schema) {
3482 /* schema match is enough */
3483 return 1;
3484 } else {
3485 return 0;
3486 }
3487}
3488
Michal Vasko92239c72020-11-18 18:17:25 +01003489/**
3490 * @brief Search in the given siblings (NOT recursively) for the first schema node data instance.
3491 * Uses hashes - should be used whenever possible for best performance.
3492 *
3493 * @param[in] siblings Siblings to search in including preceding and succeeding nodes.
3494 * @param[in] schema Target data node schema to find.
3495 * @param[out] match Can be NULL, otherwise the found data node.
3496 * @return LY_SUCCESS on success, @p match set.
3497 * @return LY_ENOTFOUND if not found, @p match set to NULL.
3498 * @return LY_ERR value if another error occurred.
3499 */
Michal Vasko90932a92020-02-12 14:33:03 +01003500static LY_ERR
3501lyd_find_sibling_schema(const struct lyd_node *siblings, const struct lysc_node *schema, struct lyd_node **match)
3502{
3503 struct lyd_node **match_p;
3504 struct lyd_node_inner *parent;
3505 uint32_t hash;
3506 values_equal_cb ht_cb;
3507
Michal Vaskob104f112020-07-17 09:54:54 +02003508 assert(siblings && schema);
Michal Vasko90932a92020-02-12 14:33:03 +01003509
Michal Vasko9e685082021-01-29 14:49:09 +01003510 parent = siblings->parent;
Michal Vasko08fd6132020-11-18 18:17:45 +01003511 if (parent && parent->schema && parent->children_ht) {
Michal Vasko90932a92020-02-12 14:33:03 +01003512 /* calculate our hash */
3513 hash = dict_hash_multi(0, schema->module->name, strlen(schema->module->name));
3514 hash = dict_hash_multi(hash, schema->name, strlen(schema->name));
3515 hash = dict_hash_multi(hash, NULL, 0);
3516
3517 /* use special hash table function */
3518 ht_cb = lyht_set_cb(parent->children_ht, lyd_hash_table_schema_val_equal);
3519
3520 /* find by hash */
3521 if (!lyht_find(parent->children_ht, &schema, hash, (void **)&match_p)) {
3522 siblings = *match_p;
3523 } else {
3524 /* not found */
3525 siblings = NULL;
3526 }
3527
3528 /* set the original hash table compare function back */
3529 lyht_set_cb(parent->children_ht, ht_cb);
3530 } else {
Michal Vaskob104f112020-07-17 09:54:54 +02003531 /* find first sibling */
3532 if (siblings->parent) {
3533 siblings = siblings->parent->child;
3534 } else {
3535 while (siblings->prev->next) {
3536 siblings = siblings->prev;
3537 }
3538 }
3539
3540 /* search manually without hashes */
Michal Vaskod989ba02020-08-24 10:59:24 +02003541 for ( ; siblings; siblings = siblings->next) {
Michal Vasko90932a92020-02-12 14:33:03 +01003542 if (siblings->schema == schema) {
3543 /* schema match is enough */
3544 break;
3545 }
3546 }
3547 }
3548
3549 if (!siblings) {
Michal Vasko9b368d32020-02-14 13:53:31 +01003550 if (match) {
3551 *match = NULL;
3552 }
Michal Vasko90932a92020-02-12 14:33:03 +01003553 return LY_ENOTFOUND;
3554 }
3555
Michal Vasko9b368d32020-02-14 13:53:31 +01003556 if (match) {
3557 *match = (struct lyd_node *)siblings;
3558 }
Michal Vasko90932a92020-02-12 14:33:03 +01003559 return LY_SUCCESS;
3560}
3561
Michal Vaskoe444f752020-02-10 12:20:06 +01003562API LY_ERR
3563lyd_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 +02003564 size_t val_len, struct lyd_node **match)
Michal Vaskoe444f752020-02-10 12:20:06 +01003565{
3566 LY_ERR rc;
3567 struct lyd_node *target = NULL;
3568
Michal Vasko4c583e82020-07-17 12:16:14 +02003569 LY_CHECK_ARG_RET(NULL, schema, !(schema->nodetype & (LYS_CHOICE | LYS_CASE)), LY_EINVAL);
Michal Vaskoe444f752020-02-10 12:20:06 +01003570
Michal Vasko08fd6132020-11-18 18:17:45 +01003571 if (!siblings || (siblings->schema && (lysc_data_parent(siblings->schema) != lysc_data_parent(schema)))) {
Michal Vasko62ed12d2020-05-21 10:08:25 +02003572 /* no data or schema mismatch */
Michal Vasko9b368d32020-02-14 13:53:31 +01003573 if (match) {
3574 *match = NULL;
3575 }
Michal Vaskoe444f752020-02-10 12:20:06 +01003576 return LY_ENOTFOUND;
3577 }
3578
Michal Vaskof03ed032020-03-04 13:31:44 +01003579 if (key_or_value && !val_len) {
3580 val_len = strlen(key_or_value);
3581 }
3582
Michal Vaskob104f112020-07-17 09:54:54 +02003583 if ((schema->nodetype & (LYS_LIST | LYS_LEAFLIST)) && key_or_value) {
3584 /* create a data node and find the instance */
3585 if (schema->nodetype == LYS_LEAFLIST) {
3586 /* target used attributes: schema, hash, value */
Michal Vaskofeca4fb2020-10-05 08:58:40 +02003587 rc = lyd_create_term(schema, key_or_value, val_len, NULL, LY_PREF_JSON, NULL, LYD_HINT_DATA, NULL, &target);
3588 LY_CHECK_RET(rc);
Michal Vaskob104f112020-07-17 09:54:54 +02003589 } else {
Michal Vasko90932a92020-02-12 14:33:03 +01003590 /* target used attributes: schema, hash, child (all keys) */
Michal Vasko004d3152020-06-11 19:59:22 +02003591 LY_CHECK_RET(lyd_create_list2(schema, key_or_value, val_len, &target));
Michal Vasko90932a92020-02-12 14:33:03 +01003592 }
3593
3594 /* find it */
3595 rc = lyd_find_sibling_first(siblings, target, match);
Michal Vaskob104f112020-07-17 09:54:54 +02003596 } else {
3597 /* find the first schema node instance */
3598 rc = lyd_find_sibling_schema(siblings, schema, match);
Michal Vaskoe444f752020-02-10 12:20:06 +01003599 }
3600
Michal Vaskoe444f752020-02-10 12:20:06 +01003601 lyd_free_tree(target);
3602 return rc;
3603}
Michal Vaskoccc02342020-05-21 10:09:21 +02003604
3605API LY_ERR
3606lyd_find_xpath(const struct lyd_node *ctx_node, const char *xpath, struct ly_set **set)
3607{
3608 LY_ERR ret = LY_SUCCESS;
3609 struct lyxp_set xp_set;
Radek Krejcif03a9e22020-09-18 20:09:31 +02003610 struct lyxp_expr *exp = NULL;
Michal Vaskoccc02342020-05-21 10:09:21 +02003611 uint32_t i;
3612
3613 LY_CHECK_ARG_RET(NULL, ctx_node, xpath, set, LY_EINVAL);
3614
3615 memset(&xp_set, 0, sizeof xp_set);
3616
3617 /* compile expression */
Radek Krejcif03a9e22020-09-18 20:09:31 +02003618 ret = lyxp_expr_parse((struct ly_ctx *)LYD_CTX(ctx_node), xpath, 0, 1, &exp);
3619 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskoccc02342020-05-21 10:09:21 +02003620
3621 /* evaluate expression */
Michal Vasko400e9672021-01-11 13:39:17 +01003622 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 +02003623 LY_CHECK_GOTO(ret, cleanup);
3624
3625 /* allocate return set */
Radek Krejciba03a5a2020-08-27 14:40:41 +02003626 ret = ly_set_new(set);
3627 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskoccc02342020-05-21 10:09:21 +02003628
3629 /* transform into ly_set */
3630 if (xp_set.type == LYXP_SET_NODE_SET) {
3631 /* allocate memory for all the elements once (even though not all items must be elements but most likely will be) */
3632 (*set)->objs = malloc(xp_set.used * sizeof *(*set)->objs);
Michal Vaskob7be7a82020-08-20 09:09:04 +02003633 LY_CHECK_ERR_GOTO(!(*set)->objs, LOGMEM(LYD_CTX(ctx_node)); ret = LY_EMEM, cleanup);
Michal Vaskoccc02342020-05-21 10:09:21 +02003634 (*set)->size = xp_set.used;
3635
3636 for (i = 0; i < xp_set.used; ++i) {
3637 if (xp_set.val.nodes[i].type == LYXP_NODE_ELEM) {
Radek Krejci3d92e442020-10-12 12:48:13 +02003638 ret = ly_set_add(*set, xp_set.val.nodes[i].node, 1, NULL);
Radek Krejciba03a5a2020-08-27 14:40:41 +02003639 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskoccc02342020-05-21 10:09:21 +02003640 }
3641 }
3642 }
3643
3644cleanup:
Michal Vasko0691d522020-05-21 13:21:47 +02003645 lyxp_set_free_content(&xp_set);
Michal Vaskob7be7a82020-08-20 09:09:04 +02003646 lyxp_expr_free((struct ly_ctx *)LYD_CTX(ctx_node), exp);
Radek Krejci8f45abc2020-11-26 12:15:13 +01003647 if (ret) {
3648 ly_set_free(*set, NULL);
3649 *set = NULL;
3650 }
Michal Vaskoccc02342020-05-21 10:09:21 +02003651 return ret;
3652}
Radek Krejcica989142020-11-05 11:32:22 +01003653
Michal Vasko3e1f6552021-01-14 09:27:55 +01003654API LY_ERR
3655lyd_find_path(const struct lyd_node *ctx_node, const char *path, ly_bool output, struct lyd_node **match)
3656{
3657 LY_ERR ret = LY_SUCCESS;
3658 struct lyxp_expr *expr = NULL;
3659 struct ly_path *lypath = NULL;
3660
3661 LY_CHECK_ARG_RET(NULL, ctx_node, ctx_node->schema, path, LY_EINVAL);
3662
3663 /* parse the path */
3664 ret = ly_path_parse(LYD_CTX(ctx_node), ctx_node->schema, path, strlen(path), LY_PATH_BEGIN_EITHER, LY_PATH_LREF_FALSE,
3665 LY_PATH_PREFIX_OPTIONAL, LY_PATH_PRED_SIMPLE, &expr);
3666 LY_CHECK_GOTO(ret, cleanup);
3667
3668 /* compile the path */
3669 ret = ly_path_compile(LYD_CTX(ctx_node), NULL, ctx_node->schema, expr, LY_PATH_LREF_FALSE,
3670 output ? LY_PATH_OPER_OUTPUT : LY_PATH_OPER_INPUT, LY_PATH_TARGET_SINGLE, LY_PREF_JSON,
3671 (void *)LYD_CTX(ctx_node), NULL, &lypath);
3672 LY_CHECK_GOTO(ret, cleanup);
3673
3674 /* evaluate the path */
3675 ret = ly_path_eval_partial(lypath, ctx_node, NULL, match);
3676
3677cleanup:
3678 lyxp_expr_free(LYD_CTX(ctx_node), expr);
3679 ly_path_free(LYD_CTX(ctx_node), lypath);
3680 return ret;
3681}
3682
Radek Krejcica989142020-11-05 11:32:22 +01003683API uint32_t
3684lyd_list_pos(const struct lyd_node *instance)
3685{
3686 const struct lyd_node *iter = NULL;
3687 uint32_t pos = 0;
3688
3689 if (!instance || !(instance->schema->nodetype & (LYS_LIST | LYS_LEAFLIST))) {
3690 return 0;
3691 }
3692
3693 /* data instances are ordered, so we can stop when we found instance of other schema node */
3694 for (iter = instance; iter->schema == instance->schema; iter = iter->prev) {
Radek Krejcibb27df32020-11-13 15:39:16 +01003695 if (pos && (iter->next == NULL)) {
Radek Krejcica989142020-11-05 11:32:22 +01003696 /* overrun to the end of the siblings list */
3697 break;
3698 }
3699 ++pos;
3700 }
3701
3702 return pos;
3703}
Radek Krejci4233f9b2020-11-05 12:38:35 +01003704
3705API struct lyd_node *
3706lyd_first_sibling(const struct lyd_node *node)
3707{
3708 struct lyd_node *start;
3709
3710 if (!node) {
3711 return NULL;
3712 }
3713
3714 /* get the first sibling */
3715 if (node->parent) {
3716 start = node->parent->child;
3717 } else {
Radek Krejcibb27df32020-11-13 15:39:16 +01003718 for (start = (struct lyd_node *)node; start->prev->next; start = start->prev) {}
Radek Krejci4233f9b2020-11-05 12:38:35 +01003719 }
3720
3721 return start;
3722}