blob: 8eee40176ce4d4d0a19e81b2ec35e576e6664a78 [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 */
178 rc = type->plugin->validate(ctx ? ctx : LYD_CTX(node), type, (struct lyd_node *)node, tree, &val, &err);
179 }
180
181 if (rc) {
Radek Krejci73dead22019-07-11 16:46:16 +0200182 if (err) {
183 if (ctx) {
Radek Krejciddace2c2021-01-08 11:30:56 +0100184 LOG_LOCSET(NULL, (const struct lyd_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 */
Radek Krejciddace2c2021-01-08 11:30:56 +0100222 LOG_LOCSET(node->schema, (const struct lyd_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
Radek Krejci7931b192020-06-25 17:05:03 +0200298API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +0200299lyd_parse_data(const struct ly_ctx *ctx, struct ly_in *in, LYD_FORMAT format, uint32_t parse_options, uint32_t validate_options,
Radek Krejci0f969882020-08-21 16:56:47 +0200300 struct lyd_node **tree)
Radek Krejci7931b192020-06-25 17:05:03 +0200301{
Radek Krejci1798aae2020-07-14 13:26:06 +0200302 LY_ERR ret = LY_SUCCESS;
303 struct lyd_ctx *lydctx = NULL;
304
Radek Krejci7931b192020-06-25 17:05:03 +0200305 LY_CHECK_ARG_RET(ctx, ctx, in, tree, LY_EINVAL);
306 LY_CHECK_ARG_RET(ctx, !(parse_options & ~LYD_PARSE_OPTS_MASK), LY_EINVAL);
307 LY_CHECK_ARG_RET(ctx, !(validate_options & ~LYD_VALIDATE_OPTS_MASK), LY_EINVAL);
308
309 format = lyd_parse_get_format(in, format);
310 LY_CHECK_ARG_RET(ctx, format, LY_EINVAL);
311
Radek Krejci1798aae2020-07-14 13:26:06 +0200312 /* init */
313 *tree = NULL;
314
Michal Vasko63f3d842020-07-08 10:10:14 +0200315 /* remember input position */
316 in->func_start = in->current;
Radek Krejci7931b192020-06-25 17:05:03 +0200317
318 switch (format) {
319 case LYD_XML:
Radek Krejci1798aae2020-07-14 13:26:06 +0200320 LY_CHECK_RET(lyd_parse_xml_data(ctx, in, parse_options, validate_options, tree, &lydctx));
321 break;
Radek Krejci7931b192020-06-25 17:05:03 +0200322 case LYD_JSON:
Radek Krejci1798aae2020-07-14 13:26:06 +0200323 LY_CHECK_RET(lyd_parse_json_data(ctx, in, parse_options, validate_options, tree, &lydctx));
324 break;
Radek Krejci7931b192020-06-25 17:05:03 +0200325 case LYD_LYB:
Radek Krejci1798aae2020-07-14 13:26:06 +0200326 LY_CHECK_RET(lyd_parse_lyb_data(ctx, in, parse_options, validate_options, tree, &lydctx));
327 break;
Michal Vaskoc8a230d2020-08-14 12:17:10 +0200328 case LYD_UNKNOWN:
Radek Krejci7931b192020-06-25 17:05:03 +0200329 LOGINT_RET(ctx);
330 }
331
Radek Krejci1798aae2020-07-14 13:26:06 +0200332 if (!(parse_options & LYD_PARSE_ONLY)) {
333 uint32_t i = 0;
334 const struct lys_module *mod;
335 struct lyd_node *first, *next, **first2;
Radek Krejci7931b192020-06-25 17:05:03 +0200336
Radek Krejci1798aae2020-07-14 13:26:06 +0200337 next = *tree;
338 while (1) {
339 if (validate_options & LYD_VALIDATE_PRESENT) {
340 mod = lyd_data_next_module(&next, &first);
341 } else {
342 mod = lyd_mod_next_module(next, NULL, ctx, &i, &first);
343 }
344 if (!mod) {
345 break;
346 }
Radek Krejcicc551802020-12-05 11:57:20 +0100347 if (!first || (first == *tree)) {
Radek Krejci1798aae2020-07-14 13:26:06 +0200348 /* make sure first2 changes are carried to tree */
349 first2 = tree;
350 } else {
351 first2 = &first;
352 }
353
354 /* validate new top-level nodes, autodelete CANNOT occur, all nodes are new */
355 LY_CHECK_GOTO(ret = lyd_validate_new(first2, NULL, mod, NULL), cleanup);
356
357 /* add all top-level defaults for this module */
Michal Vasko32711382020-12-03 14:14:31 +0100358 ret = lyd_new_implicit_r(NULL, first2, NULL, mod, &lydctx->node_types, &lydctx->node_when,
Michal Vasko69730152020-10-09 16:30:07 +0200359 (validate_options & LYD_VALIDATE_NO_STATE) ? LYD_IMPLICIT_NO_STATE : 0, NULL);
Radek Krejci1798aae2020-07-14 13:26:06 +0200360 LY_CHECK_GOTO(ret, cleanup);
361
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100362 /* our first module node pointer may no longer be the first */
363 while (*first2 && (*first2)->prev->next && (lyd_owner_module(*first2) == lyd_owner_module((*first2)->prev))) {
364 *first2 = (*first2)->prev;
365 }
366
Radek Krejci1798aae2020-07-14 13:26:06 +0200367 /* finish incompletely validated terminal values/attributes and when conditions */
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100368 ret = lyd_validate_unres(first2, mod, &lydctx->node_when, &lydctx->node_types, &lydctx->meta_types, NULL);
Radek Krejci1798aae2020-07-14 13:26:06 +0200369 LY_CHECK_GOTO(ret, cleanup);
370
371 /* perform final validation that assumes the data tree is final */
Michal Vaskobd4db892020-11-23 16:58:20 +0100372 LY_CHECK_GOTO(ret = lyd_validate_final_r(*first2, NULL, NULL, mod, validate_options, 0), cleanup);
Radek Krejci1798aae2020-07-14 13:26:06 +0200373 }
374 }
375
376cleanup:
Michal Vaskoafac7822020-10-20 14:22:26 +0200377 lydctx->free(lydctx);
Radek Krejci1798aae2020-07-14 13:26:06 +0200378 if (ret) {
379 lyd_free_all(*tree);
380 *tree = NULL;
381 }
382 return ret;
Radek Krejci7931b192020-06-25 17:05:03 +0200383}
384
385API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +0200386lyd_parse_data_mem(const struct ly_ctx *ctx, const char *data, LYD_FORMAT format, uint32_t parse_options, uint32_t validate_options,
Radek Krejci0f969882020-08-21 16:56:47 +0200387 struct lyd_node **tree)
Radek Krejci7931b192020-06-25 17:05:03 +0200388{
389 LY_ERR ret;
390 struct ly_in *in;
391
392 LY_CHECK_RET(ly_in_new_memory(data, &in));
393 ret = lyd_parse_data(ctx, in, format, parse_options, validate_options, tree);
394
395 ly_in_free(in, 0);
396 return ret;
397}
398
399API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +0200400lyd_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 +0200401 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_fd(fd, &in));
407 ret = lyd_parse_data(ctx, in, format, parse_options, validate_options, tree);
408
409 ly_in_free(in, 0);
410 return ret;
411}
412
413API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +0200414lyd_parse_data_path(const struct ly_ctx *ctx, const char *path, LYD_FORMAT format, uint32_t parse_options,
415 uint32_t validate_options, 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_filepath(path, 0, &in));
421 ret = lyd_parse_data(ctx, in, format, parse_options, validate_options, tree);
422
423 ly_in_free(in, 0);
424 return ret;
425}
426
Radek Krejci7931b192020-06-25 17:05:03 +0200427API LY_ERR
428lyd_parse_rpc(const struct ly_ctx *ctx, struct ly_in *in, LYD_FORMAT format, struct lyd_node **tree, struct lyd_node **op)
429{
430 LY_CHECK_ARG_RET(ctx, ctx, in, tree, LY_EINVAL);
431
432 format = lyd_parse_get_format(in, format);
433 LY_CHECK_ARG_RET(ctx, format, LY_EINVAL);
434
Radek Krejci1798aae2020-07-14 13:26:06 +0200435 /* init */
436 *tree = NULL;
437 if (op) {
438 *op = NULL;
439 }
440
Michal Vasko63f3d842020-07-08 10:10:14 +0200441 /* remember input position */
442 in->func_start = in->current;
443
Radek Krejci7931b192020-06-25 17:05:03 +0200444 switch (format) {
445 case LYD_XML:
Michal Vasko63f3d842020-07-08 10:10:14 +0200446 return lyd_parse_xml_rpc(ctx, in, tree, op);
Radek Krejci7931b192020-06-25 17:05:03 +0200447 case LYD_JSON:
Michal Vasko63f3d842020-07-08 10:10:14 +0200448 return lyd_parse_json_rpc(ctx, in, tree, op);
Radek Krejci7931b192020-06-25 17:05:03 +0200449 case LYD_LYB:
Michal Vasko63f3d842020-07-08 10:10:14 +0200450 return lyd_parse_lyb_rpc(ctx, in, tree, op);
Michal Vaskoc8a230d2020-08-14 12:17:10 +0200451 case LYD_UNKNOWN:
452 break;
Radek Krejci7931b192020-06-25 17:05:03 +0200453 }
454
455 LOGINT_RET(ctx);
456}
457
458API LY_ERR
Michal Vasko2552ea32020-12-08 15:32:34 +0100459lyd_parse_reply(const struct ly_ctx *ctx, struct ly_in *in, LYD_FORMAT format, struct lyd_node **tree,
Radek Krejci0f969882020-08-21 16:56:47 +0200460 struct lyd_node **op)
Radek Krejci7931b192020-06-25 17:05:03 +0200461{
Michal Vasko2552ea32020-12-08 15:32:34 +0100462 LY_CHECK_ARG_RET(ctx, ctx, in, tree || op, LY_EINVAL);
Radek Krejci7931b192020-06-25 17:05:03 +0200463
464 format = lyd_parse_get_format(in, format);
Michal Vasko2552ea32020-12-08 15:32:34 +0100465 LY_CHECK_ARG_RET(ctx, format, LY_EINVAL);
Radek Krejci7931b192020-06-25 17:05:03 +0200466
Radek Krejci1798aae2020-07-14 13:26:06 +0200467 /* init */
468 if (tree) {
469 *tree = NULL;
470 }
471 if (op) {
472 *op = NULL;
473 }
474
Michal Vasko63f3d842020-07-08 10:10:14 +0200475 /* remember input position */
476 in->func_start = in->current;
477
Radek Krejci7931b192020-06-25 17:05:03 +0200478 switch (format) {
479 case LYD_XML:
Michal Vasko2552ea32020-12-08 15:32:34 +0100480 return lyd_parse_xml_reply(ctx, in, tree, op);
Radek Krejci7931b192020-06-25 17:05:03 +0200481 case LYD_JSON:
Michal Vasko2552ea32020-12-08 15:32:34 +0100482 return lyd_parse_json_reply(ctx, in, tree, op);
Radek Krejci7931b192020-06-25 17:05:03 +0200483 case LYD_LYB:
Michal Vasko2552ea32020-12-08 15:32:34 +0100484 return lyd_parse_lyb_reply(ctx, in, tree, op);
Michal Vaskoc8a230d2020-08-14 12:17:10 +0200485 case LYD_UNKNOWN:
486 break;
Radek Krejci7931b192020-06-25 17:05:03 +0200487 }
488
Michal Vasko2552ea32020-12-08 15:32:34 +0100489 LOGINT_RET(ctx);
Radek Krejci7931b192020-06-25 17:05:03 +0200490}
491
492API LY_ERR
493lyd_parse_notif(const struct ly_ctx *ctx, struct ly_in *in, LYD_FORMAT format, struct lyd_node **tree, struct lyd_node **ntf)
494{
Radek Krejci1798aae2020-07-14 13:26:06 +0200495 LY_CHECK_ARG_RET(ctx, ctx, in, tree || ntf, LY_EINVAL);
Radek Krejci7931b192020-06-25 17:05:03 +0200496
497 format = lyd_parse_get_format(in, format);
498 LY_CHECK_ARG_RET(ctx, format, LY_EINVAL);
499
Radek Krejci1798aae2020-07-14 13:26:06 +0200500 /* init */
501 if (tree) {
502 *tree = NULL;
503 }
504 if (ntf) {
505 *ntf = NULL;
506 }
507
Michal Vasko63f3d842020-07-08 10:10:14 +0200508 /* remember input position */
509 in->func_start = in->current;
510
Radek Krejci7931b192020-06-25 17:05:03 +0200511 switch (format) {
512 case LYD_XML:
Michal Vasko63f3d842020-07-08 10:10:14 +0200513 return lyd_parse_xml_notif(ctx, in, tree, ntf);
Radek Krejci7931b192020-06-25 17:05:03 +0200514 case LYD_JSON:
Michal Vasko63f3d842020-07-08 10:10:14 +0200515 return lyd_parse_json_notif(ctx, in, tree, ntf);
Radek Krejci7931b192020-06-25 17:05:03 +0200516 case LYD_LYB:
Michal Vasko63f3d842020-07-08 10:10:14 +0200517 return lyd_parse_lyb_notif(ctx, in, tree, ntf);
Michal Vaskoc8a230d2020-08-14 12:17:10 +0200518 case LYD_UNKNOWN:
519 break;
Radek Krejci7931b192020-06-25 17:05:03 +0200520 }
521
522 LOGINT_RET(ctx);
Radek Krejcie7b95092019-05-15 11:03:07 +0200523}
Radek Krejci084289f2019-07-09 17:35:30 +0200524
Michal Vasko90932a92020-02-12 14:33:03 +0100525LY_ERR
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200526lyd_create_term(const struct lysc_node *schema, const char *value, size_t value_len, ly_bool *dynamic,
527 LY_PREFIX_FORMAT format, void *prefix_data, uint32_t hints, ly_bool *incomplete, struct lyd_node **node)
Michal Vasko90932a92020-02-12 14:33:03 +0100528{
529 LY_ERR ret;
530 struct lyd_node_term *term;
531
Michal Vasko9b368d32020-02-14 13:53:31 +0100532 assert(schema->nodetype & LYD_NODE_TERM);
533
Michal Vasko90932a92020-02-12 14:33:03 +0100534 term = calloc(1, sizeof *term);
535 LY_CHECK_ERR_RET(!term, LOGMEM(schema->module->ctx), LY_EMEM);
536
537 term->schema = schema;
538 term->prev = (struct lyd_node *)term;
Michal Vasko9b368d32020-02-14 13:53:31 +0100539 term->flags = LYD_NEW;
Michal Vasko90932a92020-02-12 14:33:03 +0100540
Radek Krejciddace2c2021-01-08 11:30:56 +0100541 LOG_LOCSET(schema, NULL, NULL, NULL);
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200542 ret = lyd_value_store(schema->module->ctx, &term->value, ((struct lysc_node_leaf *)term->schema)->type, value,
Radek Krejci2efc45b2020-12-22 16:25:44 +0100543 value_len, dynamic, format, prefix_data, hints, schema, incomplete);
Radek Krejciddace2c2021-01-08 11:30:56 +0100544 LOG_LOCBACK(1, 0, 0, 0);
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200545 LY_CHECK_ERR_RET(ret, free(term), ret);
Michal Vasko9b368d32020-02-14 13:53:31 +0100546 lyd_hash((struct lyd_node *)term);
547
548 *node = (struct lyd_node *)term;
549 return ret;
550}
551
552LY_ERR
553lyd_create_term2(const struct lysc_node *schema, const struct lyd_value *val, struct lyd_node **node)
554{
555 LY_ERR ret;
556 struct lyd_node_term *term;
557 struct lysc_type *type;
558
559 assert(schema->nodetype & LYD_NODE_TERM);
Michal Vaskoba99a3e2020-08-18 15:50:05 +0200560 assert(val && val->canonical && val->realtype);
Michal Vasko9b368d32020-02-14 13:53:31 +0100561
562 term = calloc(1, sizeof *term);
563 LY_CHECK_ERR_RET(!term, LOGMEM(schema->module->ctx), LY_EMEM);
564
565 term->schema = schema;
566 term->prev = (struct lyd_node *)term;
567 term->flags = LYD_NEW;
568
569 type = ((struct lysc_node_leaf *)schema)->type;
570 ret = type->plugin->duplicate(schema->module->ctx, val, &term->value);
571 if (ret) {
572 LOGERR(schema->module->ctx, ret, "Value duplication failed.");
573 free(term);
574 return ret;
575 }
576 lyd_hash((struct lyd_node *)term);
Michal Vasko90932a92020-02-12 14:33:03 +0100577
578 *node = (struct lyd_node *)term;
579 return ret;
580}
581
582LY_ERR
583lyd_create_inner(const struct lysc_node *schema, struct lyd_node **node)
584{
585 struct lyd_node_inner *in;
586
Michal Vasko9b368d32020-02-14 13:53:31 +0100587 assert(schema->nodetype & LYD_NODE_INNER);
588
Michal Vasko90932a92020-02-12 14:33:03 +0100589 in = calloc(1, sizeof *in);
590 LY_CHECK_ERR_RET(!in, LOGMEM(schema->module->ctx), LY_EMEM);
591
592 in->schema = schema;
593 in->prev = (struct lyd_node *)in;
Michal Vasko9b368d32020-02-14 13:53:31 +0100594 in->flags = LYD_NEW;
Michal Vasko3383be72020-11-03 17:15:31 +0100595 if ((schema->nodetype == LYS_CONTAINER) && !(schema->flags & LYS_PRESENCE)) {
596 in->flags |= LYD_DEFAULT;
597 }
Michal Vasko90932a92020-02-12 14:33:03 +0100598
Michal Vasko9b368d32020-02-14 13:53:31 +0100599 /* do not hash list with keys, we need them for the hash */
600 if ((schema->nodetype != LYS_LIST) || (schema->flags & LYS_KEYLESS)) {
601 lyd_hash((struct lyd_node *)in);
602 }
Michal Vasko90932a92020-02-12 14:33:03 +0100603
604 *node = (struct lyd_node *)in;
605 return LY_SUCCESS;
606}
607
Michal Vasko90932a92020-02-12 14:33:03 +0100608LY_ERR
Michal Vasko004d3152020-06-11 19:59:22 +0200609lyd_create_list(const struct lysc_node *schema, const struct ly_path_predicate *predicates, struct lyd_node **node)
Michal Vasko90932a92020-02-12 14:33:03 +0100610{
611 LY_ERR ret = LY_SUCCESS;
Michal Vasko90932a92020-02-12 14:33:03 +0100612 struct lyd_node *list = NULL, *key;
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200613 LY_ARRAY_COUNT_TYPE u;
Michal Vasko90932a92020-02-12 14:33:03 +0100614
Michal Vasko004d3152020-06-11 19:59:22 +0200615 assert((schema->nodetype == LYS_LIST) && !(schema->flags & LYS_KEYLESS));
Michal Vasko90932a92020-02-12 14:33:03 +0100616
617 /* create list */
618 LY_CHECK_GOTO(ret = lyd_create_inner(schema, &list), cleanup);
619
Radek Krejciddace2c2021-01-08 11:30:56 +0100620 LOG_LOCSET(NULL, list, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100621
Michal Vasko90932a92020-02-12 14:33:03 +0100622 /* create and insert all the keys */
Michal Vasko004d3152020-06-11 19:59:22 +0200623 LY_ARRAY_FOR(predicates, u) {
624 LY_CHECK_GOTO(ret = lyd_create_term2(predicates[u].key, &predicates[u].value, &key), cleanup);
Michal Vasko90932a92020-02-12 14:33:03 +0100625 lyd_insert_node(list, NULL, key);
626 }
627
Michal Vasko9b368d32020-02-14 13:53:31 +0100628 /* hash having all the keys */
629 lyd_hash(list);
630
Michal Vasko90932a92020-02-12 14:33:03 +0100631 /* success */
632 *node = list;
633 list = NULL;
634
635cleanup:
Radek Krejciddace2c2021-01-08 11:30:56 +0100636 LOG_LOCBACK(0, 1, 0, 0);
Michal Vasko90932a92020-02-12 14:33:03 +0100637 lyd_free_tree(list);
Michal Vasko004d3152020-06-11 19:59:22 +0200638 return ret;
639}
640
641static LY_ERR
642lyd_create_list2(const struct lysc_node *schema, const char *keys, size_t keys_len, struct lyd_node **node)
643{
644 LY_ERR ret = LY_SUCCESS;
645 struct lyxp_expr *expr = NULL;
646 uint16_t exp_idx = 0;
647 enum ly_path_pred_type pred_type = 0;
648 struct ly_path_predicate *predicates = NULL;
649
Radek Krejciddace2c2021-01-08 11:30:56 +0100650 LOG_LOCSET(schema, NULL, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100651
Michal Vasko004d3152020-06-11 19:59:22 +0200652 /* parse keys */
Michal Vasko6b26e742020-07-17 15:02:10 +0200653 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 +0200654 LY_PATH_PRED_KEYS, &expr), cleanup);
Michal Vasko004d3152020-06-11 19:59:22 +0200655
656 /* compile them */
Michal Vasko5d24f6c2020-10-13 13:49:06 +0200657 LY_CHECK_GOTO(ret = ly_path_compile_predicate(schema->module->ctx, NULL, NULL, schema, expr, &exp_idx, LY_PREF_JSON,
658 NULL, &predicates, &pred_type), cleanup);
Michal Vasko004d3152020-06-11 19:59:22 +0200659
660 /* create the list node */
661 LY_CHECK_GOTO(ret = lyd_create_list(schema, predicates, node), cleanup);
662
663cleanup:
Radek Krejciddace2c2021-01-08 11:30:56 +0100664 LOG_LOCBACK(1, 0, 0, 0);
Michal Vasko004d3152020-06-11 19:59:22 +0200665 lyxp_expr_free(schema->module->ctx, expr);
Michal Vaskof7e16e22020-10-21 09:24:39 +0200666 ly_path_predicates_free(schema->module->ctx, pred_type, predicates);
Michal Vasko90932a92020-02-12 14:33:03 +0100667 return ret;
668}
669
670LY_ERR
Michal Vasko366a4a12020-12-04 16:23:57 +0100671lyd_create_any(const struct lysc_node *schema, const void *value, LYD_ANYDATA_VALUETYPE value_type, ly_bool use_value,
672 struct lyd_node **node)
Michal Vasko90932a92020-02-12 14:33:03 +0100673{
Michal Vasko366a4a12020-12-04 16:23:57 +0100674 LY_ERR ret;
Michal Vasko90932a92020-02-12 14:33:03 +0100675 struct lyd_node_any *any;
Michal Vasko366a4a12020-12-04 16:23:57 +0100676 union lyd_any_value any_val;
Michal Vasko90932a92020-02-12 14:33:03 +0100677
Michal Vasko9b368d32020-02-14 13:53:31 +0100678 assert(schema->nodetype & LYD_NODE_ANY);
679
Michal Vasko90932a92020-02-12 14:33:03 +0100680 any = calloc(1, sizeof *any);
681 LY_CHECK_ERR_RET(!any, LOGMEM(schema->module->ctx), LY_EMEM);
682
683 any->schema = schema;
684 any->prev = (struct lyd_node *)any;
Michal Vasko9b368d32020-02-14 13:53:31 +0100685 any->flags = LYD_NEW;
Michal Vasko90932a92020-02-12 14:33:03 +0100686
Radek Krejci1798aae2020-07-14 13:26:06 +0200687 /* TODO: convert XML/JSON strings into a opaq data tree */
Michal Vasko366a4a12020-12-04 16:23:57 +0100688
689 if (use_value) {
690 any->value.str = value;
691 any->value_type = value_type;
692 } else {
693 any_val.str = value;
694 ret = lyd_any_copy_value((struct lyd_node *)any, &any_val, value_type);
695 LY_CHECK_ERR_RET(ret, free(any), ret);
696 }
Michal Vasko9b368d32020-02-14 13:53:31 +0100697 lyd_hash((struct lyd_node *)any);
Michal Vasko90932a92020-02-12 14:33:03 +0100698
699 *node = (struct lyd_node *)any;
700 return LY_SUCCESS;
701}
702
Michal Vasko52927e22020-03-16 17:26:14 +0100703LY_ERR
Michal Vasko501af032020-11-11 20:27:44 +0100704lyd_create_opaq(const struct ly_ctx *ctx, const char *name, size_t name_len, const char *prefix, size_t pref_len,
705 const char *module_key, size_t module_key_len, const char *value, size_t value_len, ly_bool *dynamic,
706 LY_PREFIX_FORMAT format, void *val_prefix_data, uint32_t hints, struct lyd_node **node)
Michal Vasko52927e22020-03-16 17:26:14 +0100707{
Radek Krejci011e4aa2020-09-04 15:22:31 +0200708 LY_ERR ret = LY_SUCCESS;
Michal Vasko52927e22020-03-16 17:26:14 +0100709 struct lyd_node_opaq *opaq;
710
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200711 assert(ctx && name && name_len && format);
Michal Vasko52927e22020-03-16 17:26:14 +0100712
713 if (!value_len) {
714 value = "";
715 }
716
717 opaq = calloc(1, sizeof *opaq);
Michal Vasko501af032020-11-11 20:27:44 +0100718 LY_CHECK_ERR_GOTO(!opaq, LOGMEM(ctx); ret = LY_EMEM, finish);
Michal Vasko52927e22020-03-16 17:26:14 +0100719
720 opaq->prev = (struct lyd_node *)opaq;
Michal Vaskoad92b672020-11-12 13:11:31 +0100721 LY_CHECK_GOTO(ret = lydict_insert(ctx, name, name_len, &opaq->name.name), finish);
Radek Krejci011e4aa2020-09-04 15:22:31 +0200722
Michal Vasko52927e22020-03-16 17:26:14 +0100723 if (pref_len) {
Michal Vaskoad92b672020-11-12 13:11:31 +0100724 LY_CHECK_GOTO(ret = lydict_insert(ctx, prefix, pref_len, &opaq->name.prefix), finish);
Michal Vasko52927e22020-03-16 17:26:14 +0100725 }
Radek Krejci1798aae2020-07-14 13:26:06 +0200726 if (module_key_len) {
Michal Vaskoad92b672020-11-12 13:11:31 +0100727 LY_CHECK_GOTO(ret = lydict_insert(ctx, module_key, module_key_len, &opaq->name.module_ns), finish);
Radek Krejci1798aae2020-07-14 13:26:06 +0200728 }
Michal Vasko52927e22020-03-16 17:26:14 +0100729 if (dynamic && *dynamic) {
Radek Krejci011e4aa2020-09-04 15:22:31 +0200730 LY_CHECK_GOTO(ret = lydict_insert_zc(ctx, (char *)value, &opaq->value), finish);
Michal Vasko52927e22020-03-16 17:26:14 +0100731 *dynamic = 0;
732 } else {
Radek Krejci011e4aa2020-09-04 15:22:31 +0200733 LY_CHECK_GOTO(ret = lydict_insert(ctx, value, value_len, &opaq->value), finish);
Michal Vasko52927e22020-03-16 17:26:14 +0100734 }
Michal Vasko501af032020-11-11 20:27:44 +0100735
736 opaq->format = format;
737 opaq->val_prefix_data = val_prefix_data;
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200738 opaq->hints = hints;
Michal Vasko52927e22020-03-16 17:26:14 +0100739 opaq->ctx = ctx;
740
Radek Krejci011e4aa2020-09-04 15:22:31 +0200741finish:
742 if (ret) {
743 lyd_free_tree((struct lyd_node *)opaq);
Michal Vasko501af032020-11-11 20:27:44 +0100744 ly_free_prefix_data(format, val_prefix_data);
Radek Krejci011e4aa2020-09-04 15:22:31 +0200745 } else {
746 *node = (struct lyd_node *)opaq;
747 }
748 return ret;
Michal Vasko52927e22020-03-16 17:26:14 +0100749}
750
Michal Vasko3a41dff2020-07-15 14:30:28 +0200751API LY_ERR
Michal Vasko65243892020-12-04 16:26:21 +0100752lyd_new_inner(struct lyd_node *parent, const struct lys_module *module, const char *name, ly_bool output,
753 struct lyd_node **node)
Michal Vasko013a8182020-03-03 10:46:53 +0100754{
755 struct lyd_node *ret = NULL;
756 const struct lysc_node *schema;
757 struct ly_ctx *ctx = parent ? parent->schema->module->ctx : (module ? module->ctx : NULL);
758
Michal Vasko6027eb92020-07-15 16:37:30 +0200759 LY_CHECK_ARG_RET(ctx, parent || module, parent || node, name, LY_EINVAL);
Michal Vasko013a8182020-03-03 10:46:53 +0100760
Michal Vaskof03ed032020-03-04 13:31:44 +0100761 if (!module) {
762 module = parent->schema->module;
763 }
764
Michal Vasko3a41dff2020-07-15 14:30:28 +0200765 schema = lys_find_child(parent ? parent->schema : NULL, module, name, 0,
Radek Krejci41ac9942020-11-02 14:47:56 +0100766 LYS_CONTAINER | LYS_NOTIF | LYS_RPC | LYS_ACTION, output ? LYS_GETNEXT_OUTPUT : 0);
Michal Vasko3a41dff2020-07-15 14:30:28 +0200767 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 +0100768
Michal Vasko3a41dff2020-07-15 14:30:28 +0200769 LY_CHECK_RET(lyd_create_inner(schema, &ret));
770 if (parent) {
Michal Vasko013a8182020-03-03 10:46:53 +0100771 lyd_insert_node(parent, NULL, ret);
772 }
Michal Vasko3a41dff2020-07-15 14:30:28 +0200773
774 if (node) {
775 *node = ret;
776 }
777 return LY_SUCCESS;
Michal Vasko013a8182020-03-03 10:46:53 +0100778}
779
Michal Vasko3a41dff2020-07-15 14:30:28 +0200780API LY_ERR
Michal Vasko65243892020-12-04 16:26:21 +0100781lyd_new_list(struct lyd_node *parent, const struct lys_module *module, const char *name, ly_bool output,
782 struct lyd_node **node, ...)
Michal Vasko013a8182020-03-03 10:46:53 +0100783{
784 struct lyd_node *ret = NULL, *key;
785 const struct lysc_node *schema, *key_s;
786 struct ly_ctx *ctx = parent ? parent->schema->module->ctx : (module ? module->ctx : NULL);
787 va_list ap;
788 const char *key_val;
789 LY_ERR rc = LY_SUCCESS;
790
Michal Vasko6027eb92020-07-15 16:37:30 +0200791 LY_CHECK_ARG_RET(ctx, parent || module, parent || node, name, LY_EINVAL);
Michal Vasko013a8182020-03-03 10:46:53 +0100792
Michal Vaskof03ed032020-03-04 13:31:44 +0100793 if (!module) {
794 module = parent->schema->module;
795 }
796
Radek Krejci41ac9942020-11-02 14:47:56 +0100797 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 +0200798 LY_CHECK_ERR_RET(!schema, LOGERR(ctx, LY_EINVAL, "List node \"%s\" not found.", name), LY_ENOTFOUND);
Michal Vasko013a8182020-03-03 10:46:53 +0100799
800 /* create list inner node */
Michal Vasko3a41dff2020-07-15 14:30:28 +0200801 LY_CHECK_RET(lyd_create_inner(schema, &ret));
Michal Vasko013a8182020-03-03 10:46:53 +0100802
Michal Vasko3a41dff2020-07-15 14:30:28 +0200803 va_start(ap, node);
Michal Vasko013a8182020-03-03 10:46:53 +0100804
805 /* create and insert all the keys */
806 for (key_s = lysc_node_children(schema, 0); key_s && (key_s->flags & LYS_KEY); key_s = key_s->next) {
807 key_val = va_arg(ap, const char *);
808
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200809 rc = lyd_create_term(key_s, key_val, key_val ? strlen(key_val) : 0, NULL, LY_PREF_JSON, NULL, LYD_HINT_DATA,
810 NULL, &key);
811 LY_CHECK_GOTO(rc, cleanup);
Michal Vasko013a8182020-03-03 10:46:53 +0100812 lyd_insert_node(ret, NULL, key);
813 }
814
Michal Vasko013a8182020-03-03 10:46:53 +0100815 if (parent) {
816 lyd_insert_node(parent, NULL, ret);
817 }
818
819cleanup:
Michal Vasko3a41dff2020-07-15 14:30:28 +0200820 va_end(ap);
Michal Vasko013a8182020-03-03 10:46:53 +0100821 if (rc) {
822 lyd_free_tree(ret);
823 ret = NULL;
Michal Vasko3a41dff2020-07-15 14:30:28 +0200824 } else if (node) {
825 *node = ret;
Michal Vasko013a8182020-03-03 10:46:53 +0100826 }
Michal Vasko3a41dff2020-07-15 14:30:28 +0200827 return rc;
Michal Vasko013a8182020-03-03 10:46:53 +0100828}
829
Michal Vasko3a41dff2020-07-15 14:30:28 +0200830API LY_ERR
831lyd_new_list2(struct lyd_node *parent, const struct lys_module *module, const char *name, const char *keys,
Radek Krejci41ac9942020-11-02 14:47:56 +0100832 ly_bool output, struct lyd_node **node)
Michal Vasko013a8182020-03-03 10:46:53 +0100833{
834 struct lyd_node *ret = NULL;
835 const struct lysc_node *schema;
836 struct ly_ctx *ctx = parent ? parent->schema->module->ctx : (module ? module->ctx : NULL);
837
Michal Vasko6027eb92020-07-15 16:37:30 +0200838 LY_CHECK_ARG_RET(ctx, parent || module, parent || node, name, LY_EINVAL);
Michal Vasko013a8182020-03-03 10:46:53 +0100839
Michal Vaskof03ed032020-03-04 13:31:44 +0100840 if (!module) {
841 module = parent->schema->module;
842 }
Michal Vasko004d3152020-06-11 19:59:22 +0200843 if (!keys) {
844 keys = "";
845 }
Michal Vaskof03ed032020-03-04 13:31:44 +0100846
Michal Vasko004d3152020-06-11 19:59:22 +0200847 /* find schema node */
Radek Krejci41ac9942020-11-02 14:47:56 +0100848 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 +0200849 LY_CHECK_ERR_RET(!schema, LOGERR(ctx, LY_EINVAL, "List node \"%s\" not found.", name), LY_ENOTFOUND);
Michal Vasko013a8182020-03-03 10:46:53 +0100850
Michal Vasko004d3152020-06-11 19:59:22 +0200851 if ((schema->flags & LYS_KEYLESS) && !keys[0]) {
852 /* key-less list */
Michal Vasko3a41dff2020-07-15 14:30:28 +0200853 LY_CHECK_RET(lyd_create_inner(schema, &ret));
Michal Vasko004d3152020-06-11 19:59:22 +0200854 } else {
855 /* create the list node */
Michal Vasko3a41dff2020-07-15 14:30:28 +0200856 LY_CHECK_RET(lyd_create_list2(schema, keys, strlen(keys), &ret));
Michal Vasko004d3152020-06-11 19:59:22 +0200857 }
Michal Vasko004d3152020-06-11 19:59:22 +0200858 if (parent) {
Michal Vasko013a8182020-03-03 10:46:53 +0100859 lyd_insert_node(parent, NULL, ret);
860 }
Michal Vasko3a41dff2020-07-15 14:30:28 +0200861
862 if (node) {
863 *node = ret;
864 }
865 return LY_SUCCESS;
Michal Vasko013a8182020-03-03 10:46:53 +0100866}
867
Michal Vasko3a41dff2020-07-15 14:30:28 +0200868API LY_ERR
869lyd_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 +0100870 ly_bool output, struct lyd_node **node)
Michal Vasko013a8182020-03-03 10:46:53 +0100871{
Michal Vaskocbff3e92020-05-27 12:56:41 +0200872 LY_ERR rc;
Michal Vasko013a8182020-03-03 10:46:53 +0100873 struct lyd_node *ret = NULL;
874 const struct lysc_node *schema;
875 struct ly_ctx *ctx = parent ? parent->schema->module->ctx : (module ? module->ctx : NULL);
876
Michal Vasko6027eb92020-07-15 16:37:30 +0200877 LY_CHECK_ARG_RET(ctx, parent || module, parent || node, name, LY_EINVAL);
Michal Vasko013a8182020-03-03 10:46:53 +0100878
Michal Vaskof03ed032020-03-04 13:31:44 +0100879 if (!module) {
880 module = parent->schema->module;
881 }
882
Radek Krejci41ac9942020-11-02 14:47:56 +0100883 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 +0200884 LY_CHECK_ERR_RET(!schema, LOGERR(ctx, LY_EINVAL, "Term node \"%s\" not found.", name), LY_ENOTFOUND);
Michal Vasko013a8182020-03-03 10:46:53 +0100885
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200886 rc = lyd_create_term(schema, val_str, val_str ? strlen(val_str) : 0, NULL, LY_PREF_JSON, NULL, LYD_HINT_DATA, NULL,
887 &ret);
888 LY_CHECK_RET(rc);
Michal Vaskocbff3e92020-05-27 12:56:41 +0200889 if (parent) {
Michal Vasko013a8182020-03-03 10:46:53 +0100890 lyd_insert_node(parent, NULL, ret);
891 }
Michal Vasko3a41dff2020-07-15 14:30:28 +0200892
893 if (node) {
894 *node = ret;
895 }
896 return LY_SUCCESS;
Michal Vasko013a8182020-03-03 10:46:53 +0100897}
898
Michal Vasko3a41dff2020-07-15 14:30:28 +0200899API LY_ERR
Michal Vasko219006c2020-12-04 16:26:52 +0100900lyd_new_any(struct lyd_node *parent, const struct lys_module *module, const char *name, void *value,
Radek Krejci41ac9942020-11-02 14:47:56 +0100901 LYD_ANYDATA_VALUETYPE value_type, ly_bool output, struct lyd_node **node)
Michal Vasko013a8182020-03-03 10:46:53 +0100902{
903 struct lyd_node *ret = NULL;
904 const struct lysc_node *schema;
905 struct ly_ctx *ctx = parent ? parent->schema->module->ctx : (module ? module->ctx : NULL);
906
Michal Vasko6027eb92020-07-15 16:37:30 +0200907 LY_CHECK_ARG_RET(ctx, parent || module, parent || node, name, LY_EINVAL);
Michal Vasko013a8182020-03-03 10:46:53 +0100908
Michal Vaskof03ed032020-03-04 13:31:44 +0100909 if (!module) {
910 module = parent->schema->module;
911 }
912
Radek Krejci41ac9942020-11-02 14:47:56 +0100913 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 +0200914 LY_CHECK_ERR_RET(!schema, LOGERR(ctx, LY_EINVAL, "Any node \"%s\" not found.", name), LY_ENOTFOUND);
Michal Vasko013a8182020-03-03 10:46:53 +0100915
Michal Vasko366a4a12020-12-04 16:23:57 +0100916 LY_CHECK_RET(lyd_create_any(schema, value, value_type, 1, &ret));
Michal Vasko3a41dff2020-07-15 14:30:28 +0200917 if (parent) {
Michal Vasko013a8182020-03-03 10:46:53 +0100918 lyd_insert_node(parent, NULL, ret);
919 }
Michal Vasko3a41dff2020-07-15 14:30:28 +0200920
921 if (node) {
922 *node = ret;
923 }
924 return LY_SUCCESS;
Michal Vasko013a8182020-03-03 10:46:53 +0100925}
926
Michal Vasko4490d312020-06-16 13:08:55 +0200927/**
928 * @brief Update node value.
929 *
930 * @param[in] node Node to update.
931 * @param[in] value New value to set.
932 * @param[in] value_type Type of @p value for any node.
933 * @param[out] new_parent Set to @p node if the value was updated, otherwise set to NULL.
934 * @param[out] new_node Set to @p node if the value was updated, otherwise set to NULL.
935 * @return LY_ERR value.
936 */
Michal Vasko00cbf532020-06-15 13:58:47 +0200937static LY_ERR
938lyd_new_path_update(struct lyd_node *node, const void *value, LYD_ANYDATA_VALUETYPE value_type,
Radek Krejci0f969882020-08-21 16:56:47 +0200939 struct lyd_node **new_parent, struct lyd_node **new_node)
Michal Vasko00cbf532020-06-15 13:58:47 +0200940{
941 LY_ERR ret = LY_SUCCESS;
942 struct lyd_node *new_any;
943
944 switch (node->schema->nodetype) {
945 case LYS_CONTAINER:
946 case LYS_NOTIF:
947 case LYS_RPC:
948 case LYS_ACTION:
949 case LYS_LIST:
950 case LYS_LEAFLIST:
951 /* if it exists, there is nothing to update */
952 *new_parent = NULL;
953 *new_node = NULL;
954 break;
955 case LYS_LEAF:
956 ret = lyd_change_term(node, value);
957 if ((ret == LY_SUCCESS) || (ret == LY_EEXIST)) {
958 /* there was an actual change (at least of the default flag) */
959 *new_parent = node;
960 *new_node = node;
961 ret = LY_SUCCESS;
962 } else if (ret == LY_ENOT) {
963 /* no change */
964 *new_parent = NULL;
965 *new_node = NULL;
966 ret = LY_SUCCESS;
967 } /* else error */
968 break;
969 case LYS_ANYDATA:
970 case LYS_ANYXML:
971 /* create a new any node */
Michal Vasko366a4a12020-12-04 16:23:57 +0100972 LY_CHECK_RET(lyd_create_any(node->schema, value, value_type, 0, &new_any));
Michal Vasko00cbf532020-06-15 13:58:47 +0200973
974 /* compare with the existing one */
Michal Vasko8f359bf2020-07-28 10:41:15 +0200975 if (lyd_compare_single(node, new_any, 0)) {
Michal Vasko00cbf532020-06-15 13:58:47 +0200976 /* not equal, switch values (so that we can use generic node free) */
977 ((struct lyd_node_any *)new_any)->value = ((struct lyd_node_any *)node)->value;
978 ((struct lyd_node_any *)new_any)->value_type = ((struct lyd_node_any *)node)->value_type;
979 ((struct lyd_node_any *)node)->value.str = value;
980 ((struct lyd_node_any *)node)->value_type = value_type;
981
982 *new_parent = node;
983 *new_node = node;
984 } else {
985 /* they are equal */
986 *new_parent = NULL;
987 *new_node = NULL;
988 }
989 lyd_free_tree(new_any);
990 break;
991 default:
Michal Vaskob7be7a82020-08-20 09:09:04 +0200992 LOGINT(LYD_CTX(node));
Michal Vasko00cbf532020-06-15 13:58:47 +0200993 ret = LY_EINT;
994 break;
995 }
996
997 return ret;
998}
999
Michal Vasko3a41dff2020-07-15 14:30:28 +02001000API LY_ERR
Michal Vasko871a0252020-11-11 18:35:24 +01001001lyd_new_meta(const struct ly_ctx *ctx, struct lyd_node *parent, const struct lys_module *module, const char *name,
1002 const char *val_str, ly_bool clear_dflt, struct lyd_meta **meta)
Michal Vaskod86997b2020-05-26 15:19:54 +02001003{
Michal Vaskod86997b2020-05-26 15:19:54 +02001004 const char *prefix, *tmp;
Michal Vaskod86997b2020-05-26 15:19:54 +02001005 size_t pref_len, name_len;
1006
Michal Vasko871a0252020-11-11 18:35:24 +01001007 LY_CHECK_ARG_RET(NULL, ctx, name, module || strchr(name, ':'), parent || meta, LY_EINVAL);
Michal Vasko00cbf532020-06-15 13:58:47 +02001008
Michal Vasko871a0252020-11-11 18:35:24 +01001009 if (parent && !parent->schema) {
1010 LOGERR(ctx, LY_EINVAL, "Cannot add metadata to an opaque node \"%s\".", ((struct lyd_node_opaq *)parent)->name);
1011 return LY_EINVAL;
1012 }
Michal Vasko610553d2020-11-18 18:15:05 +01001013 if (meta) {
1014 *meta = NULL;
1015 }
Michal Vaskod86997b2020-05-26 15:19:54 +02001016
1017 /* parse the name */
1018 tmp = name;
1019 if (ly_parse_nodeid(&tmp, &prefix, &pref_len, &name, &name_len) || tmp[0]) {
1020 LOGERR(ctx, LY_EINVAL, "Metadata name \"%s\" is not valid.", name);
Michal Vasko871a0252020-11-11 18:35:24 +01001021 return LY_EINVAL;
Michal Vaskod86997b2020-05-26 15:19:54 +02001022 }
1023
1024 /* find the module */
1025 if (prefix) {
Radek Krejci0ad51f12020-07-16 12:08:12 +02001026 module = ly_ctx_get_module_implemented2(ctx, prefix, pref_len);
Michal Vasko3a41dff2020-07-15 14:30:28 +02001027 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 +02001028 }
1029
1030 /* set value if none */
1031 if (!val_str) {
1032 val_str = "";
1033 }
1034
Michal Vasko871a0252020-11-11 18:35:24 +01001035 return lyd_create_meta(parent, meta, module, name, name_len, val_str, strlen(val_str), NULL, LY_PREF_JSON,
1036 NULL, LYD_HINT_DATA, clear_dflt, NULL);
1037}
Michal Vasko3a41dff2020-07-15 14:30:28 +02001038
Michal Vaskoba696702020-11-11 19:12:45 +01001039API LY_ERR
1040lyd_new_meta2(const struct ly_ctx *ctx, struct lyd_node *parent, ly_bool clear_dflt, const struct lyd_attr *attr,
1041 struct lyd_meta **meta)
1042{
1043 const struct lys_module *mod;
1044
1045 LY_CHECK_ARG_RET(NULL, ctx, attr, parent || meta, LY_EINVAL);
1046
1047 if (parent && !parent->schema) {
1048 LOGERR(ctx, LY_EINVAL, "Cannot add metadata to an opaque node \"%s\".", ((struct lyd_node_opaq *)parent)->name);
1049 return LY_EINVAL;
Michal Vasko3a41dff2020-07-15 14:30:28 +02001050 }
Michal Vasko610553d2020-11-18 18:15:05 +01001051 if (meta) {
1052 *meta = NULL;
1053 }
Michal Vaskoba696702020-11-11 19:12:45 +01001054
1055 switch (attr->format) {
1056 case LY_PREF_XML:
Michal Vaskoad92b672020-11-12 13:11:31 +01001057 mod = ly_ctx_get_module_implemented_ns(ctx, attr->name.module_ns);
Michal Vaskoba696702020-11-11 19:12:45 +01001058 if (!mod) {
Michal Vaskoad92b672020-11-12 13:11:31 +01001059 LOGERR(ctx, LY_EINVAL, "Module with namespace \"%s\" not found.", attr->name.module_ns);
Michal Vaskoba696702020-11-11 19:12:45 +01001060 return LY_ENOTFOUND;
1061 }
1062 break;
1063 case LY_PREF_JSON:
Michal Vaskoad92b672020-11-12 13:11:31 +01001064 mod = ly_ctx_get_module_implemented(ctx, attr->name.module_name);
Michal Vaskoba696702020-11-11 19:12:45 +01001065 if (!mod) {
Michal Vaskoad92b672020-11-12 13:11:31 +01001066 LOGERR(ctx, LY_EINVAL, "Module \"%s\" not found.", attr->name.module_name);
Michal Vaskoba696702020-11-11 19:12:45 +01001067 return LY_ENOTFOUND;
1068 }
1069 break;
1070 default:
1071 LOGINT_RET(ctx);
1072 }
1073
Michal Vaskoad92b672020-11-12 13:11:31 +01001074 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 +01001075 NULL, attr->format, attr->val_prefix_data, attr->hints, clear_dflt, NULL);
Michal Vaskod86997b2020-05-26 15:19:54 +02001076}
1077
Michal Vasko3a41dff2020-07-15 14:30:28 +02001078API LY_ERR
Michal Vasko00cbf532020-06-15 13:58:47 +02001079lyd_new_opaq(struct lyd_node *parent, const struct ly_ctx *ctx, const char *name, const char *value,
Radek Krejci0f969882020-08-21 16:56:47 +02001080 const char *module_name, struct lyd_node **node)
Michal Vasko00cbf532020-06-15 13:58:47 +02001081{
1082 struct lyd_node *ret = NULL;
1083
Michal Vasko6027eb92020-07-15 16:37:30 +02001084 LY_CHECK_ARG_RET(ctx, parent || ctx, parent || node, name, module_name, LY_EINVAL);
Michal Vasko00cbf532020-06-15 13:58:47 +02001085
1086 if (!ctx) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001087 ctx = LYD_CTX(parent);
Michal Vasko00cbf532020-06-15 13:58:47 +02001088 }
1089 if (!value) {
1090 value = "";
1091 }
1092
Michal Vasko501af032020-11-11 20:27:44 +01001093 LY_CHECK_RET(lyd_create_opaq(ctx, name, strlen(name), NULL, 0, module_name, strlen(module_name), value,
1094 strlen(value), NULL, LY_PREF_JSON, NULL, 0, &ret));
Michal Vasko3a41dff2020-07-15 14:30:28 +02001095 if (parent) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001096 lyd_insert_node(parent, NULL, ret);
1097 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02001098
1099 if (node) {
1100 *node = ret;
1101 }
1102 return LY_SUCCESS;
Michal Vasko00cbf532020-06-15 13:58:47 +02001103}
1104
Michal Vasko3a41dff2020-07-15 14:30:28 +02001105API LY_ERR
1106lyd_new_attr(struct lyd_node *parent, const char *module_name, const char *name, const char *val_str,
Radek Krejci0f969882020-08-21 16:56:47 +02001107 struct lyd_attr **attr)
Michal Vasko00cbf532020-06-15 13:58:47 +02001108{
Radek Krejci1798aae2020-07-14 13:26:06 +02001109 struct lyd_attr *ret = NULL;
Michal Vasko00cbf532020-06-15 13:58:47 +02001110 const struct ly_ctx *ctx;
1111 const char *prefix, *tmp;
Michal Vasko51d21b82020-11-13 18:03:54 +01001112 size_t pref_len, name_len, mod_len;
Michal Vasko00cbf532020-06-15 13:58:47 +02001113
Michal Vasko3a41dff2020-07-15 14:30:28 +02001114 LY_CHECK_ARG_RET(NULL, parent, !parent->schema, name, LY_EINVAL);
Michal Vasko00cbf532020-06-15 13:58:47 +02001115
Michal Vaskob7be7a82020-08-20 09:09:04 +02001116 ctx = LYD_CTX(parent);
Michal Vasko00cbf532020-06-15 13:58:47 +02001117
1118 /* parse the name */
1119 tmp = name;
1120 if (ly_parse_nodeid(&tmp, &prefix, &pref_len, &name, &name_len) || tmp[0]) {
1121 LOGERR(ctx, LY_EINVAL, "Metadata name \"%s\" is not valid.", name);
Michal Vasko3a41dff2020-07-15 14:30:28 +02001122 return LY_EVALID;
Michal Vasko00cbf532020-06-15 13:58:47 +02001123 }
1124
Michal Vasko51d21b82020-11-13 18:03:54 +01001125 /* get the module */
1126 if (module_name) {
1127 mod_len = strlen(module_name);
1128 } else {
1129 module_name = prefix;
1130 mod_len = pref_len;
1131 }
1132
Michal Vasko00cbf532020-06-15 13:58:47 +02001133 /* set value if none */
1134 if (!val_str) {
1135 val_str = "";
1136 }
1137
Michal Vasko51d21b82020-11-13 18:03:54 +01001138 LY_CHECK_RET(lyd_create_attr(parent, &ret, ctx, name, name_len, prefix, pref_len, module_name, mod_len, val_str,
1139 strlen(val_str), NULL, LY_PREF_JSON, NULL, LYD_HINT_DATA));
Michal Vasko3a41dff2020-07-15 14:30:28 +02001140
1141 if (attr) {
1142 *attr = ret;
1143 }
1144 return LY_SUCCESS;
Michal Vasko00cbf532020-06-15 13:58:47 +02001145}
1146
1147API LY_ERR
1148lyd_change_term(struct lyd_node *term, const char *val_str)
1149{
1150 LY_ERR ret = LY_SUCCESS;
1151 struct lysc_type *type;
1152 struct lyd_node_term *t;
1153 struct lyd_node *parent;
1154 struct lyd_value val = {0};
Radek Krejci857189e2020-09-01 13:26:36 +02001155 ly_bool dflt_change, val_change;
Michal Vasko00cbf532020-06-15 13:58:47 +02001156
1157 LY_CHECK_ARG_RET(NULL, term, term->schema, term->schema->nodetype & LYD_NODE_TERM, LY_EINVAL);
1158
1159 if (!val_str) {
1160 val_str = "";
1161 }
1162 t = (struct lyd_node_term *)term;
1163 type = ((struct lysc_node_leaf *)term->schema)->type;
1164
1165 /* parse the new value */
Radek Krejciddace2c2021-01-08 11:30:56 +01001166 LOG_LOCSET(term->schema, term, NULL, NULL);
Michal Vaskofeca4fb2020-10-05 08:58:40 +02001167 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 +01001168 term->schema, NULL);
Radek Krejciddace2c2021-01-08 11:30:56 +01001169 LOG_LOCBACK(term->schema ? 1 : 0, 1, 0, 0);
Michal Vaskofeca4fb2020-10-05 08:58:40 +02001170 LY_CHECK_GOTO(ret, cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001171
1172 /* compare original and new value */
1173 if (type->plugin->compare(&t->value, &val)) {
1174 /* values differ, switch them */
Michal Vaskob7be7a82020-08-20 09:09:04 +02001175 type->plugin->free(LYD_CTX(term), &t->value);
Michal Vasko00cbf532020-06-15 13:58:47 +02001176 t->value = val;
1177 memset(&val, 0, sizeof val);
1178 val_change = 1;
1179 } else {
1180 val_change = 0;
1181 }
1182
1183 /* always clear the default flag */
1184 if (term->flags & LYD_DEFAULT) {
1185 for (parent = term; parent; parent = (struct lyd_node *)parent->parent) {
1186 parent->flags &= ~LYD_DEFAULT;
1187 }
1188 dflt_change = 1;
1189 } else {
1190 dflt_change = 0;
1191 }
1192
1193 if (val_change || dflt_change) {
1194 /* make the node non-validated */
1195 term->flags &= LYD_NEW;
1196 }
1197
1198 if (val_change) {
1199 if (term->schema->nodetype == LYS_LEAFLIST) {
1200 /* leaf-list needs to be hashed again and re-inserted into parent */
1201 lyd_unlink_hash(term);
1202 lyd_hash(term);
1203 LY_CHECK_GOTO(ret = lyd_insert_hash(term), cleanup);
1204 } else if ((term->schema->flags & LYS_KEY) && term->parent) {
1205 /* list needs to be updated if its key was changed */
1206 assert(term->parent->schema->nodetype == LYS_LIST);
1207 lyd_unlink_hash((struct lyd_node *)term->parent);
1208 lyd_hash((struct lyd_node *)term->parent);
1209 LY_CHECK_GOTO(ret = lyd_insert_hash((struct lyd_node *)term->parent), cleanup);
1210 } /* else leaf that is not a key, its value is not used for its hash so it does not change */
1211 }
1212
1213 /* retrun value */
1214 if (!val_change) {
1215 if (dflt_change) {
1216 /* only default flag change */
1217 ret = LY_EEXIST;
1218 } else {
1219 /* no change */
1220 ret = LY_ENOT;
1221 }
1222 } /* else value changed, LY_SUCCESS */
1223
1224cleanup:
Michal Vasko59512fc2020-12-09 18:13:29 +01001225 if (val.realtype) {
1226 type->plugin->free(LYD_CTX(term), &val);
1227 }
Michal Vasko00cbf532020-06-15 13:58:47 +02001228 return ret;
1229}
1230
Michal Vasko41586352020-07-13 13:54:25 +02001231API LY_ERR
1232lyd_change_meta(struct lyd_meta *meta, const char *val_str)
1233{
1234 LY_ERR ret = LY_SUCCESS;
Radek Krejci2b18bf12020-11-06 11:20:20 +01001235 struct lyd_meta *m2 = NULL;
Michal Vasko41586352020-07-13 13:54:25 +02001236 struct lyd_value val;
Radek Krejci857189e2020-09-01 13:26:36 +02001237 ly_bool val_change;
Michal Vasko41586352020-07-13 13:54:25 +02001238
1239 LY_CHECK_ARG_RET(NULL, meta, LY_EINVAL);
1240
1241 if (!val_str) {
1242 val_str = "";
1243 }
1244
1245 /* parse the new value into a new meta structure */
1246 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 +01001247 strlen(val_str), NULL, LY_PREF_JSON, NULL, LYD_HINT_DATA, 0, NULL), cleanup);
Michal Vasko41586352020-07-13 13:54:25 +02001248
1249 /* compare original and new value */
1250 if (lyd_compare_meta(meta, m2)) {
1251 /* values differ, switch them */
1252 val = meta->value;
1253 meta->value = m2->value;
1254 m2->value = val;
1255 val_change = 1;
1256 } else {
1257 val_change = 0;
1258 }
1259
1260 /* retrun value */
1261 if (!val_change) {
1262 /* no change */
1263 ret = LY_ENOT;
1264 } /* else value changed, LY_SUCCESS */
1265
1266cleanup:
Michal Vasko1a66a5d2020-11-18 18:15:37 +01001267 lyd_free_meta_single(m2);
Michal Vasko41586352020-07-13 13:54:25 +02001268 return ret;
1269}
1270
Michal Vasko3a41dff2020-07-15 14:30:28 +02001271API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02001272lyd_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 +02001273 struct lyd_node **node)
Michal Vasko00cbf532020-06-15 13:58:47 +02001274{
Michal Vasko3a41dff2020-07-15 14:30:28 +02001275 return lyd_new_path2(parent, ctx, path, value, 0, options, node, NULL);
Michal Vasko00cbf532020-06-15 13:58:47 +02001276}
1277
1278API LY_ERR
1279lyd_new_path2(struct lyd_node *parent, const struct ly_ctx *ctx, const char *path, const void *value,
Radek Krejci1deb5be2020-08-26 16:43:36 +02001280 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 +02001281{
1282 LY_ERR ret = LY_SUCCESS, r;
1283 struct lyxp_expr *exp = NULL;
1284 struct ly_path *p = NULL;
1285 struct lyd_node *nparent = NULL, *nnode = NULL, *node = NULL, *cur_parent;
1286 const struct lysc_node *schema;
Michal Vaskofd69e1d2020-07-03 11:57:17 +02001287 LY_ARRAY_COUNT_TYPE path_idx = 0;
Michal Vasko00cbf532020-06-15 13:58:47 +02001288 struct ly_path_predicate *pred;
1289
1290 LY_CHECK_ARG_RET(ctx, parent || ctx, path, (path[0] == '/') || parent, LY_EINVAL);
1291
1292 if (!ctx) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001293 ctx = LYD_CTX(parent);
Michal Vasko00cbf532020-06-15 13:58:47 +02001294 }
1295
1296 /* parse path */
Michal Vasko6b26e742020-07-17 15:02:10 +02001297 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 +02001298 LY_PATH_PREFIX_OPTIONAL, LY_PATH_PRED_SIMPLE, &exp), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001299
1300 /* compile path */
1301 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 +02001302 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 +01001303 NULL, NULL, &p), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001304
Radek Krejcic7d13e32020-12-09 12:32:24 +01001305 assert(p);
Michal Vaskofd69e1d2020-07-03 11:57:17 +02001306 schema = p[LY_ARRAY_COUNT(p) - 1].node;
Michal Vasko69730152020-10-09 16:30:07 +02001307 if ((schema->nodetype == LYS_LIST) && (p[LY_ARRAY_COUNT(p) - 1].pred_type == LY_PATH_PREDTYPE_NONE) &&
Radek Krejci092e33c2020-10-12 15:33:10 +02001308 !(options & LYD_NEW_PATH_OPAQ)) {
Radek Krejciddace2c2021-01-08 11:30:56 +01001309 LOG_LOCSET(schema, NULL, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +01001310 LOGVAL(ctx, LYVE_XPATH, "Predicate missing for %s \"%s\" in path \"%s\".",
1311 lys_nodetype2str(schema->nodetype), schema->name, path);
Radek Krejciddace2c2021-01-08 11:30:56 +01001312 LOG_LOCBACK(1, 0, 0, 0);
Michal Vasko00cbf532020-06-15 13:58:47 +02001313 ret = LY_EINVAL;
1314 goto cleanup;
Michal Vaskofd69e1d2020-07-03 11:57:17 +02001315 } else if ((schema->nodetype == LYS_LEAFLIST) && (p[LY_ARRAY_COUNT(p) - 1].pred_type == LY_PATH_PREDTYPE_NONE)) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001316 /* parse leafref value into a predicate, if not defined in the path */
Michal Vasko00cbf532020-06-15 13:58:47 +02001317 if (!value) {
1318 value = "";
1319 }
1320
1321 r = LY_SUCCESS;
Radek Krejci092e33c2020-10-12 15:33:10 +02001322 if (options & LYD_NEW_PATH_OPAQ) {
Michal Vaskof937cfe2020-08-03 16:07:12 +02001323 r = lys_value_validate(NULL, schema, value, strlen(value));
Michal Vasko00cbf532020-06-15 13:58:47 +02001324 }
1325 if (!r) {
Michal Vasko3af81bc2020-11-18 18:16:13 +01001326 /* store the new predicate */
1327 p[LY_ARRAY_COUNT(p) - 1].pred_type = LY_PATH_PREDTYPE_LEAFLIST;
1328 LY_ARRAY_NEW_GOTO(ctx, p[LY_ARRAY_COUNT(p) - 1].predicates, pred, ret, cleanup);
1329
Michal Vaskofeca4fb2020-10-05 08:58:40 +02001330 ret = lyd_value_store(ctx, &pred->value, ((struct lysc_node_leaflist *)schema)->type, value, strlen(value),
Radek Krejci2efc45b2020-12-22 16:25:44 +01001331 NULL, LY_PREF_JSON, NULL, LYD_HINT_DATA, schema, NULL);
Michal Vaskofeca4fb2020-10-05 08:58:40 +02001332 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskoae875662020-10-21 10:33:17 +02001333 ++((struct lysc_type *)pred->value.realtype)->refcount;
Michal Vasko00cbf532020-06-15 13:58:47 +02001334 } /* else we have opaq flag and the value is not valid, leavne no predicate and then create an opaque node */
1335 }
1336
1337 /* try to find any existing nodes in the path */
1338 if (parent) {
1339 ret = ly_path_eval_partial(p, parent, &path_idx, &node);
1340 if (ret == LY_SUCCESS) {
1341 /* the node exists, are we supposed to update it or is it just a default? */
Radek Krejci092e33c2020-10-12 15:33:10 +02001342 if (!(options & LYD_NEW_PATH_UPDATE) && !(node->flags & LYD_DEFAULT)) {
Radek Krejciddace2c2021-01-08 11:30:56 +01001343 LOG_LOCSET(NULL, node, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +01001344 LOGVAL(ctx, LYVE_REFERENCE, "Path \"%s\" already exists", path);
Radek Krejciddace2c2021-01-08 11:30:56 +01001345 LOG_LOCBACK(0, 1, 0, 0);
Michal Vasko00cbf532020-06-15 13:58:47 +02001346 ret = LY_EEXIST;
1347 goto cleanup;
1348 }
1349
1350 /* update the existing node */
1351 ret = lyd_new_path_update(node, value, value_type, &nparent, &nnode);
1352 goto cleanup;
1353 } else if (ret == LY_EINCOMPLETE) {
1354 /* some nodes were found, adjust the iterator to the next segment */
1355 ++path_idx;
1356 } else if (ret == LY_ENOTFOUND) {
1357 /* 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 +01001358 if (lysc_data_parent(p[0].node)) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001359 node = parent;
1360 }
1361 } else {
1362 /* error */
1363 goto cleanup;
1364 }
1365 }
1366
1367 /* create all the non-existing nodes in a loop */
Michal Vaskod989ba02020-08-24 10:59:24 +02001368 for ( ; path_idx < LY_ARRAY_COUNT(p); ++path_idx) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001369 cur_parent = node;
1370 schema = p[path_idx].node;
1371
1372 switch (schema->nodetype) {
1373 case LYS_LIST:
1374 if (!(schema->flags & LYS_KEYLESS)) {
Radek Krejci092e33c2020-10-12 15:33:10 +02001375 if ((options & LYD_NEW_PATH_OPAQ) && (p[path_idx].pred_type == LY_PATH_PREDTYPE_NONE)) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001376 /* creating opaque list without keys */
Michal Vasko501af032020-11-11 20:27:44 +01001377 LY_CHECK_GOTO(ret = lyd_create_opaq(ctx, schema->name, strlen(schema->name), NULL, 0,
1378 schema->module->name, strlen(schema->module->name), NULL, 0, NULL, LY_PREF_JSON, NULL,
1379 LYD_NODEHINT_LIST, &node), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001380 } else {
1381 assert(p[path_idx].pred_type == LY_PATH_PREDTYPE_LIST);
1382 LY_CHECK_GOTO(ret = lyd_create_list(schema, p[path_idx].predicates, &node), cleanup);
1383 }
1384 break;
1385 }
Radek Krejcif13b87b2020-12-01 22:02:17 +01001386 /* fall through */
Michal Vasko00cbf532020-06-15 13:58:47 +02001387 case LYS_CONTAINER:
1388 case LYS_NOTIF:
1389 case LYS_RPC:
1390 case LYS_ACTION:
1391 LY_CHECK_GOTO(ret = lyd_create_inner(schema, &node), cleanup);
1392 break;
1393 case LYS_LEAFLIST:
Radek Krejci092e33c2020-10-12 15:33:10 +02001394 if ((options & LYD_NEW_PATH_OPAQ) && (p[path_idx].pred_type == LY_PATH_PREDTYPE_NONE)) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001395 /* creating opaque leaf-list without value */
Michal Vasko501af032020-11-11 20:27:44 +01001396 LY_CHECK_GOTO(ret = lyd_create_opaq(ctx, schema->name, strlen(schema->name), NULL, 0,
1397 schema->module->name, strlen(schema->module->name), NULL, 0, NULL, LY_PREF_JSON, NULL,
1398 LYD_NODEHINT_LEAFLIST, &node), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001399 } else {
1400 assert(p[path_idx].pred_type == LY_PATH_PREDTYPE_LEAFLIST);
1401 LY_CHECK_GOTO(ret = lyd_create_term2(schema, &p[path_idx].predicates[0].value, &node), cleanup);
1402 }
1403 break;
1404 case LYS_LEAF:
Michal Vasko35880332020-12-08 13:08:12 +01001405 if (lysc_is_key(schema)) {
1406 /* it must have been already created or some error will occur later */
1407 assert(cur_parent);
1408 node = lyd_child(cur_parent);
1409 assert(node && (node->schema == schema));
1410 goto next_iter;
1411 }
1412
1413 /* make sure there is some value */
Michal Vasko00cbf532020-06-15 13:58:47 +02001414 if (!value) {
1415 value = "";
1416 }
1417
1418 r = LY_SUCCESS;
Radek Krejci092e33c2020-10-12 15:33:10 +02001419 if (options & LYD_NEW_PATH_OPAQ) {
Michal Vaskof937cfe2020-08-03 16:07:12 +02001420 r = lys_value_validate(NULL, schema, value, strlen(value));
Michal Vasko00cbf532020-06-15 13:58:47 +02001421 }
1422 if (!r) {
Michal Vaskofeca4fb2020-10-05 08:58:40 +02001423 ret = lyd_create_term(schema, value, strlen(value), NULL, LY_PREF_JSON, NULL, LYD_HINT_DATA, NULL, &node);
1424 LY_CHECK_GOTO(ret, cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001425 } else {
1426 /* creating opaque leaf without value */
Michal Vasko501af032020-11-11 20:27:44 +01001427 LY_CHECK_GOTO(ret = lyd_create_opaq(ctx, schema->name, strlen(schema->name), NULL, 0, schema->module->name,
1428 strlen(schema->module->name), NULL, 0, NULL, LY_PREF_JSON, NULL, 0, &node), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001429 }
1430 break;
1431 case LYS_ANYDATA:
1432 case LYS_ANYXML:
Michal Vasko366a4a12020-12-04 16:23:57 +01001433 LY_CHECK_GOTO(ret = lyd_create_any(schema, value, value_type, 0, &node), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001434 break;
1435 default:
1436 LOGINT(ctx);
1437 ret = LY_EINT;
1438 goto cleanup;
1439 }
1440
1441 if (cur_parent) {
1442 /* connect to the parent */
1443 lyd_insert_node(cur_parent, NULL, node);
1444 } else if (parent) {
1445 /* connect to top-level siblings */
1446 lyd_insert_node(NULL, &parent, node);
1447 }
1448
Michal Vasko35880332020-12-08 13:08:12 +01001449next_iter:
Michal Vasko00cbf532020-06-15 13:58:47 +02001450 /* update remembered nodes */
1451 if (!nparent) {
1452 nparent = node;
1453 }
1454 nnode = node;
1455 }
1456
1457cleanup:
1458 lyxp_expr_free(ctx, exp);
1459 ly_path_free(ctx, p);
1460 if (!ret) {
1461 /* set out params only on success */
1462 if (new_parent) {
1463 *new_parent = nparent;
1464 }
1465 if (new_node) {
1466 *new_node = nnode;
1467 }
Michal Vaskof4b95ba2020-12-11 08:42:33 +01001468 } else {
1469 lyd_free_tree(nparent);
Michal Vasko00cbf532020-06-15 13:58:47 +02001470 }
1471 return ret;
1472}
1473
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001474LY_ERR
1475lyd_new_implicit_r(struct lyd_node *parent, struct lyd_node **first, const struct lysc_node *sparent,
Radek Krejci1deb5be2020-08-26 16:43:36 +02001476 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 +02001477 struct lyd_node **diff)
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001478{
1479 LY_ERR ret;
Michal Vasko630d9892020-12-08 17:11:08 +01001480 const struct lysc_node *iter = NULL, *sp;
Radek Krejci2b18bf12020-11-06 11:20:20 +01001481 struct lyd_node *node = NULL;
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001482 struct lyd_value **dflts;
1483 LY_ARRAY_COUNT_TYPE u;
Michal Vasko630d9892020-12-08 17:11:08 +01001484 uint32_t getnext_opts;
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001485
1486 assert(first && (parent || sparent || mod));
1487
1488 if (!sparent && parent) {
1489 sparent = parent->schema;
1490 }
1491
Michal Vasko630d9892020-12-08 17:11:08 +01001492 for (sp = sparent; sp && !(sp->nodetype & (LYS_RPC | LYS_ACTION | LYS_NOTIF)); sp = sp->parent) {}
1493 if (sp) {
1494 /* these options lose meaning in operations and could cause skipping some nodes
1495 * (because LYS_CONFIG* flags are set in the schema nodes with a different meaning) */
1496 impl_opts &= ~(LYD_IMPLICIT_NO_STATE | LYD_IMPLICIT_NO_CONFIG);
1497 }
1498
1499 getnext_opts = LYS_GETNEXT_WITHCHOICE;
1500 if (impl_opts & LYD_IMPLICIT_OUTPUT) {
1501 getnext_opts |= LYS_GETNEXT_OUTPUT;
1502 }
1503
1504 while ((iter = lys_getnext(iter, sparent, mod ? mod->compiled : NULL, getnext_opts))) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001505 if ((impl_opts & LYD_IMPLICIT_NO_STATE) && (iter->flags & LYS_CONFIG_R)) {
1506 continue;
Michal Vasko44b19a12020-08-07 09:21:30 +02001507 } else if ((impl_opts & LYD_IMPLICIT_NO_CONFIG) && (iter->flags & LYS_CONFIG_W)) {
1508 continue;
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001509 }
1510
1511 switch (iter->nodetype) {
1512 case LYS_CHOICE:
Michal Vaskobcf4d7d2020-11-18 18:16:49 +01001513 node = lys_getnext_data(NULL, *first, NULL, iter, NULL);
1514 if (!node && ((struct lysc_node_choice *)iter)->dflt) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001515 /* create default case data */
1516 LY_CHECK_RET(lyd_new_implicit_r(parent, first, (struct lysc_node *)((struct lysc_node_choice *)iter)->dflt,
Michal Vasko69730152020-10-09 16:30:07 +02001517 NULL, node_types, node_when, impl_opts, diff));
Michal Vaskobcf4d7d2020-11-18 18:16:49 +01001518 } else if (node) {
1519 /* create any default data in the existing case */
1520 assert(node->schema->parent->nodetype == LYS_CASE);
1521 LY_CHECK_RET(lyd_new_implicit_r(parent, first, node->schema->parent, NULL, node_types, node_when,
1522 impl_opts, diff));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001523 }
1524 break;
1525 case LYS_CONTAINER:
1526 if (!(iter->flags & LYS_PRESENCE) && lyd_find_sibling_val(*first, iter, NULL, 0, NULL)) {
1527 /* create default NP container */
1528 LY_CHECK_RET(lyd_create_inner(iter, &node));
Michal Vasko0cadfcb2020-11-04 17:17:05 +01001529 node->flags = LYD_DEFAULT | (node->schema->when ? LYD_WHEN_TRUE : 0);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001530 lyd_insert_node(parent, first, node);
1531
1532 /* cannot be a NP container with when */
1533 assert(!iter->when);
1534
Michal Vaskoe49b6322020-11-05 17:38:36 +01001535 if (diff) {
1536 /* add into diff */
1537 LY_CHECK_RET(lyd_val_diff_add(node, LYD_DIFF_OP_CREATE, diff));
1538 }
1539
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001540 /* create any default children */
1541 LY_CHECK_RET(lyd_new_implicit_r(node, lyd_node_children_p(node), NULL, NULL, node_types, node_when,
Michal Vasko69730152020-10-09 16:30:07 +02001542 impl_opts, diff));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001543 }
1544 break;
1545 case LYS_LEAF:
Michal Vasko69730152020-10-09 16:30:07 +02001546 if (!(impl_opts & LYD_IMPLICIT_NO_DEFAULTS) && ((struct lysc_node_leaf *)iter)->dflt &&
1547 lyd_find_sibling_val(*first, iter, NULL, 0, NULL)) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001548 /* create default leaf */
1549 ret = lyd_create_term2(iter, ((struct lysc_node_leaf *)iter)->dflt, &node);
1550 if (ret == LY_EINCOMPLETE) {
1551 if (node_types) {
1552 /* remember to resolve type */
Radek Krejci3d92e442020-10-12 12:48:13 +02001553 LY_CHECK_RET(ly_set_add(node_types, node, 1, NULL));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001554 }
1555 } else if (ret) {
1556 return ret;
1557 }
Michal Vasko0cadfcb2020-11-04 17:17:05 +01001558 node->flags = LYD_DEFAULT | (node->schema->when ? LYD_WHEN_TRUE : 0);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001559 lyd_insert_node(parent, first, node);
1560
1561 if (iter->when && node_when) {
1562 /* remember to resolve when */
Radek Krejci3d92e442020-10-12 12:48:13 +02001563 LY_CHECK_RET(ly_set_add(node_when, node, 1, NULL));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001564 }
1565 if (diff) {
1566 /* add into diff */
1567 LY_CHECK_RET(lyd_val_diff_add(node, LYD_DIFF_OP_CREATE, diff));
1568 }
1569 }
1570 break;
1571 case LYS_LEAFLIST:
Michal Vasko69730152020-10-09 16:30:07 +02001572 if (!(impl_opts & LYD_IMPLICIT_NO_DEFAULTS) && ((struct lysc_node_leaflist *)iter)->dflts &&
1573 lyd_find_sibling_val(*first, iter, NULL, 0, NULL)) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001574 /* create all default leaf-lists */
1575 dflts = ((struct lysc_node_leaflist *)iter)->dflts;
1576 LY_ARRAY_FOR(dflts, u) {
1577 ret = lyd_create_term2(iter, dflts[u], &node);
1578 if (ret == LY_EINCOMPLETE) {
1579 if (node_types) {
1580 /* remember to resolve type */
Radek Krejci3d92e442020-10-12 12:48:13 +02001581 LY_CHECK_RET(ly_set_add(node_types, node, 1, NULL));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001582 }
1583 } else if (ret) {
1584 return ret;
1585 }
Radek Krejcic5b54a02020-11-05 17:13:18 +01001586 node->flags = LYD_DEFAULT | (node->schema->when ? LYD_WHEN_TRUE : 0);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001587 lyd_insert_node(parent, first, node);
1588
1589 if (iter->when && node_when) {
1590 /* remember to resolve when */
Radek Krejci3d92e442020-10-12 12:48:13 +02001591 LY_CHECK_RET(ly_set_add(node_when, node, 1, NULL));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001592 }
1593 if (diff) {
1594 /* add into diff */
1595 LY_CHECK_RET(lyd_val_diff_add(node, LYD_DIFF_OP_CREATE, diff));
1596 }
1597 }
1598 }
1599 break;
1600 default:
1601 /* without defaults */
1602 break;
1603 }
1604 }
1605
1606 return LY_SUCCESS;
1607}
1608
1609API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02001610lyd_new_implicit_tree(struct lyd_node *tree, uint32_t implicit_options, struct lyd_node **diff)
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001611{
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001612 LY_ERR ret = LY_SUCCESS;
Michal Vasko3488ada2020-12-03 14:18:19 +01001613 struct lyd_node *node;
1614 struct ly_set node_when = {0};
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001615
1616 LY_CHECK_ARG_RET(NULL, tree, LY_EINVAL);
1617 if (diff) {
1618 *diff = NULL;
1619 }
1620
Michal Vasko56daf732020-08-10 10:57:18 +02001621 LYD_TREE_DFS_BEGIN(tree, node) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001622 /* skip added default nodes */
Michal Vasko69730152020-10-09 16:30:07 +02001623 if (((node->flags & (LYD_DEFAULT | LYD_NEW)) != (LYD_DEFAULT | LYD_NEW)) &&
1624 (node->schema->nodetype & LYD_NODE_INNER)) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001625 LY_CHECK_GOTO(ret = lyd_new_implicit_r(node, lyd_node_children_p((struct lyd_node *)node), NULL, NULL, NULL,
Michal Vasko3488ada2020-12-03 14:18:19 +01001626 &node_when, implicit_options, diff), cleanup);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001627 }
1628
Michal Vasko56daf732020-08-10 10:57:18 +02001629 LYD_TREE_DFS_END(tree, node);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001630 }
1631
Michal Vasko3488ada2020-12-03 14:18:19 +01001632 /* resolve when and remove any invalid defaults */
Michal Vaskod3bb12f2020-12-04 14:33:09 +01001633 LY_CHECK_GOTO(ret = lyd_validate_unres(&tree, NULL, &node_when, NULL, NULL, diff), cleanup);
Michal Vasko3488ada2020-12-03 14:18:19 +01001634
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001635cleanup:
Michal Vasko3488ada2020-12-03 14:18:19 +01001636 ly_set_erase(&node_when, NULL);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001637 if (ret && diff) {
1638 lyd_free_all(*diff);
1639 *diff = NULL;
1640 }
1641 return ret;
1642}
1643
1644API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02001645lyd_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 +02001646{
1647 const struct lys_module *mod;
1648 struct lyd_node *d = NULL;
1649 uint32_t i = 0;
1650 LY_ERR ret = LY_SUCCESS;
1651
1652 LY_CHECK_ARG_RET(ctx, tree, *tree || ctx, LY_EINVAL);
1653 if (diff) {
1654 *diff = NULL;
1655 }
1656 if (!ctx) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001657 ctx = LYD_CTX(*tree);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001658 }
1659
1660 /* add nodes for each module one-by-one */
1661 while ((mod = ly_ctx_get_module_iter(ctx, &i))) {
1662 if (!mod->implemented) {
1663 continue;
1664 }
1665
1666 LY_CHECK_GOTO(ret = lyd_new_implicit_module(tree, mod, implicit_options, diff ? &d : NULL), cleanup);
1667 if (d) {
1668 /* merge into one diff */
1669 lyd_insert_sibling(*diff, d, diff);
1670
1671 d = NULL;
1672 }
1673 }
1674
1675cleanup:
1676 if (ret && diff) {
1677 lyd_free_all(*diff);
1678 *diff = NULL;
1679 }
1680 return ret;
1681}
1682
1683API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02001684lyd_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 +02001685{
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001686 LY_ERR ret = LY_SUCCESS;
Michal Vasko3488ada2020-12-03 14:18:19 +01001687 struct lyd_node *root, *d = NULL;
1688 struct ly_set node_when = {0};
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001689
1690 LY_CHECK_ARG_RET(NULL, tree, module, LY_EINVAL);
1691 if (diff) {
1692 *diff = NULL;
1693 }
1694
1695 /* add all top-level defaults for this module */
Michal Vasko3488ada2020-12-03 14:18:19 +01001696 LY_CHECK_GOTO(ret = lyd_new_implicit_r(NULL, tree, NULL, module, NULL, &node_when, implicit_options, diff), cleanup);
1697
1698 /* resolve when and remove any invalid defaults */
Michal Vaskod3bb12f2020-12-04 14:33:09 +01001699 LY_CHECK_GOTO(ret = lyd_validate_unres(tree, module, &node_when, NULL, NULL, diff), cleanup);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001700
1701 /* process nested nodes */
1702 LY_LIST_FOR(*tree, root) {
1703 /* skip added default nodes */
1704 if ((root->flags & (LYD_DEFAULT | LYD_NEW)) != (LYD_DEFAULT | LYD_NEW)) {
1705 LY_CHECK_GOTO(ret = lyd_new_implicit_tree(root, implicit_options, diff ? &d : NULL), cleanup);
1706
1707 if (d) {
1708 /* merge into one diff */
1709 lyd_insert_sibling(*diff, d, diff);
1710
1711 d = NULL;
1712 }
1713 }
1714 }
1715
1716cleanup:
Michal Vasko3488ada2020-12-03 14:18:19 +01001717 ly_set_erase(&node_when, NULL);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001718 if (ret && diff) {
1719 lyd_free_all(*diff);
1720 *diff = NULL;
1721 }
1722 return ret;
1723}
1724
Michal Vasko90932a92020-02-12 14:33:03 +01001725struct lyd_node *
Michal Vaskob104f112020-07-17 09:54:54 +02001726lyd_insert_get_next_anchor(const struct lyd_node *first_sibling, const struct lyd_node *new_node)
Michal Vasko90932a92020-02-12 14:33:03 +01001727{
Michal Vaskob104f112020-07-17 09:54:54 +02001728 const struct lysc_node *schema, *sparent;
Michal Vasko90932a92020-02-12 14:33:03 +01001729 struct lyd_node *match = NULL;
Radek Krejci857189e2020-09-01 13:26:36 +02001730 ly_bool found;
Michal Vasko93b16062020-12-09 18:14:18 +01001731 uint32_t getnext_opts;
Michal Vasko90932a92020-02-12 14:33:03 +01001732
Michal Vaskob104f112020-07-17 09:54:54 +02001733 assert(new_node);
1734
1735 if (!first_sibling || !new_node->schema) {
1736 /* insert at the end, no next anchor */
Michal Vasko90932a92020-02-12 14:33:03 +01001737 return NULL;
1738 }
1739
Michal Vasko93b16062020-12-09 18:14:18 +01001740 getnext_opts = 0;
1741 if (new_node->schema->flags & LYS_CONFIG_R) {
1742 getnext_opts = LYS_GETNEXT_OUTPUT;
1743 }
1744
Michal Vaskob104f112020-07-17 09:54:54 +02001745 if (first_sibling->parent && first_sibling->parent->children_ht) {
1746 /* find the anchor using hashes */
1747 sparent = first_sibling->parent->schema;
Michal Vasko93b16062020-12-09 18:14:18 +01001748 schema = lys_getnext(new_node->schema, sparent, NULL, getnext_opts);
Michal Vaskob104f112020-07-17 09:54:54 +02001749 while (schema) {
1750 /* keep trying to find the first existing instance of the closest following schema sibling,
1751 * otherwise return NULL - inserting at the end */
1752 if (!lyd_find_sibling_schema(first_sibling, schema, &match)) {
1753 break;
1754 }
1755
Michal Vasko93b16062020-12-09 18:14:18 +01001756 schema = lys_getnext(schema, sparent, NULL, getnext_opts);
Michal Vaskob104f112020-07-17 09:54:54 +02001757 }
1758 } else {
1759 /* find the anchor without hashes */
1760 match = (struct lyd_node *)first_sibling;
1761 if (!lysc_data_parent(new_node->schema)) {
1762 /* we are in top-level, skip all the data from preceding modules */
1763 LY_LIST_FOR(match, match) {
1764 if (!match->schema || (strcmp(lyd_owner_module(match)->name, lyd_owner_module(new_node)->name) >= 0)) {
1765 break;
1766 }
1767 }
1768 }
1769
1770 /* get the first schema sibling */
1771 sparent = lysc_data_parent(new_node->schema);
Michal Vasko93b16062020-12-09 18:14:18 +01001772 schema = lys_getnext(NULL, sparent, new_node->schema->module->compiled, getnext_opts);
Michal Vaskob104f112020-07-17 09:54:54 +02001773
1774 found = 0;
1775 LY_LIST_FOR(match, match) {
1776 if (!match->schema || (lyd_owner_module(match) != lyd_owner_module(new_node))) {
1777 /* we have found an opaque node, which must be at the end, so use it OR
1778 * modules do not match, so we must have traversed all the data from new_node module (if any),
1779 * we have found the first node of the next module, that is what we want */
1780 break;
1781 }
1782
1783 /* skip schema nodes until we find the instantiated one */
1784 while (!found) {
1785 if (new_node->schema == schema) {
1786 /* we have found the schema of the new node, continue search to find the first
1787 * data node with a different schema (after our schema) */
1788 found = 1;
1789 break;
1790 }
1791 if (match->schema == schema) {
1792 /* current node (match) is a data node still before the new node, continue search in data */
1793 break;
1794 }
Michal Vasko93b16062020-12-09 18:14:18 +01001795 schema = lys_getnext(schema, sparent, new_node->schema->module->compiled, getnext_opts);
Michal Vaskob104f112020-07-17 09:54:54 +02001796 assert(schema);
1797 }
1798
1799 if (found && (match->schema != new_node->schema)) {
1800 /* find the next node after we have found our node schema data instance */
1801 break;
1802 }
1803 }
Michal Vasko90932a92020-02-12 14:33:03 +01001804 }
1805
1806 return match;
1807}
1808
1809/**
1810 * @brief Insert node after a sibling.
1811 *
Michal Vasko9f96a052020-03-10 09:41:45 +01001812 * Handles inserting into NP containers and key-less lists.
1813 *
Michal Vasko90932a92020-02-12 14:33:03 +01001814 * @param[in] sibling Sibling to insert after.
1815 * @param[in] node Node to insert.
1816 */
1817static void
Michal Vaskof03ed032020-03-04 13:31:44 +01001818lyd_insert_after_node(struct lyd_node *sibling, struct lyd_node *node)
Michal Vasko90932a92020-02-12 14:33:03 +01001819{
Michal Vasko0249f7c2020-03-05 16:36:40 +01001820 struct lyd_node_inner *par;
1821
Michal Vasko90932a92020-02-12 14:33:03 +01001822 assert(!node->next && (node->prev == node));
1823
1824 node->next = sibling->next;
1825 node->prev = sibling;
1826 sibling->next = node;
1827 if (node->next) {
1828 /* sibling had a succeeding node */
1829 node->next->prev = node;
1830 } else {
1831 /* sibling was last, find first sibling and change its prev */
1832 if (sibling->parent) {
1833 sibling = sibling->parent->child;
1834 } else {
Michal Vaskod989ba02020-08-24 10:59:24 +02001835 for ( ; sibling->prev->next != node; sibling = sibling->prev) {}
Michal Vasko90932a92020-02-12 14:33:03 +01001836 }
1837 sibling->prev = node;
1838 }
1839 node->parent = sibling->parent;
Michal Vasko0249f7c2020-03-05 16:36:40 +01001840
Michal Vasko9f96a052020-03-10 09:41:45 +01001841 for (par = node->parent; par; par = par->parent) {
1842 if ((par->flags & LYD_DEFAULT) && !(node->flags & LYD_DEFAULT)) {
1843 /* remove default flags from NP containers */
Michal Vasko0249f7c2020-03-05 16:36:40 +01001844 par->flags &= ~LYD_DEFAULT;
1845 }
Michal Vaskob104f112020-07-17 09:54:54 +02001846 if (par->schema && (par->schema->nodetype == LYS_LIST) && (par->schema->flags & LYS_KEYLESS)) {
Michal Vasko9f96a052020-03-10 09:41:45 +01001847 /* rehash key-less list */
1848 lyd_hash((struct lyd_node *)par);
1849 }
Michal Vasko0249f7c2020-03-05 16:36:40 +01001850 }
Michal Vasko90932a92020-02-12 14:33:03 +01001851}
1852
1853/**
1854 * @brief Insert node before a sibling.
1855 *
Michal Vasko9f96a052020-03-10 09:41:45 +01001856 * Handles inserting into NP containers and key-less lists.
1857 *
Michal Vasko90932a92020-02-12 14:33:03 +01001858 * @param[in] sibling Sibling to insert before.
1859 * @param[in] node Node to insert.
1860 */
1861static void
Michal Vaskof03ed032020-03-04 13:31:44 +01001862lyd_insert_before_node(struct lyd_node *sibling, struct lyd_node *node)
Michal Vasko90932a92020-02-12 14:33:03 +01001863{
Michal Vasko0249f7c2020-03-05 16:36:40 +01001864 struct lyd_node_inner *par;
1865
Michal Vasko90932a92020-02-12 14:33:03 +01001866 assert(!node->next && (node->prev == node));
1867
1868 node->next = sibling;
1869 /* covers situation of sibling being first */
1870 node->prev = sibling->prev;
1871 sibling->prev = node;
1872 if (node->prev->next) {
1873 /* sibling had a preceding node */
1874 node->prev->next = node;
1875 } else if (sibling->parent) {
1876 /* sibling was first and we must also change parent child pointer */
1877 sibling->parent->child = node;
1878 }
1879 node->parent = sibling->parent;
Michal Vasko0249f7c2020-03-05 16:36:40 +01001880
Michal Vasko9f96a052020-03-10 09:41:45 +01001881 for (par = node->parent; par; par = par->parent) {
1882 if ((par->flags & LYD_DEFAULT) && !(node->flags & LYD_DEFAULT)) {
1883 /* remove default flags from NP containers */
Michal Vasko0249f7c2020-03-05 16:36:40 +01001884 par->flags &= ~LYD_DEFAULT;
1885 }
Michal Vaskob104f112020-07-17 09:54:54 +02001886 if (par->schema && (par->schema->nodetype == LYS_LIST) && (par->schema->flags & LYS_KEYLESS)) {
Michal Vasko9f96a052020-03-10 09:41:45 +01001887 /* rehash key-less list */
1888 lyd_hash((struct lyd_node *)par);
1889 }
Michal Vasko0249f7c2020-03-05 16:36:40 +01001890 }
Michal Vasko90932a92020-02-12 14:33:03 +01001891}
1892
1893/**
Michal Vaskob104f112020-07-17 09:54:54 +02001894 * @brief Insert node as the first and only child of a parent.
Michal Vasko90932a92020-02-12 14:33:03 +01001895 *
Michal Vasko9f96a052020-03-10 09:41:45 +01001896 * Handles inserting into NP containers and key-less lists.
1897 *
Michal Vasko90932a92020-02-12 14:33:03 +01001898 * @param[in] parent Parent to insert into.
1899 * @param[in] node Node to insert.
1900 */
1901static void
Michal Vaskob104f112020-07-17 09:54:54 +02001902lyd_insert_only_child(struct lyd_node *parent, struct lyd_node *node)
Michal Vasko90932a92020-02-12 14:33:03 +01001903{
1904 struct lyd_node_inner *par;
1905
Radek Krejcia1c1e542020-09-29 16:06:52 +02001906 assert(parent && !lyd_child(parent) && !node->next && (node->prev == node));
Michal Vasko52927e22020-03-16 17:26:14 +01001907 assert(!parent->schema || (parent->schema->nodetype & LYD_NODE_INNER));
Michal Vasko90932a92020-02-12 14:33:03 +01001908
1909 par = (struct lyd_node_inner *)parent;
1910
Michal Vaskob104f112020-07-17 09:54:54 +02001911 par->child = node;
Michal Vasko90932a92020-02-12 14:33:03 +01001912 node->parent = par;
Michal Vasko0249f7c2020-03-05 16:36:40 +01001913
Michal Vaskod989ba02020-08-24 10:59:24 +02001914 for ( ; par; par = par->parent) {
Michal Vasko9f96a052020-03-10 09:41:45 +01001915 if ((par->flags & LYD_DEFAULT) && !(node->flags & LYD_DEFAULT)) {
1916 /* remove default flags from NP containers */
Michal Vasko0249f7c2020-03-05 16:36:40 +01001917 par->flags &= ~LYD_DEFAULT;
1918 }
Michal Vasko52927e22020-03-16 17:26:14 +01001919 if (par->schema && (par->schema->nodetype == LYS_LIST) && (par->schema->flags & LYS_KEYLESS)) {
Michal Vasko9f96a052020-03-10 09:41:45 +01001920 /* rehash key-less list */
1921 lyd_hash((struct lyd_node *)par);
1922 }
Michal Vasko0249f7c2020-03-05 16:36:40 +01001923 }
Michal Vasko751cb4d2020-07-14 12:25:28 +02001924}
Michal Vasko0249f7c2020-03-05 16:36:40 +01001925
Michal Vasko751cb4d2020-07-14 12:25:28 +02001926/**
1927 * @brief Learn whether a list instance has all the keys.
1928 *
1929 * @param[in] list List instance to check.
1930 * @return non-zero if all the keys were found,
1931 * @return 0 otherwise.
1932 */
1933static int
1934lyd_insert_has_keys(const struct lyd_node *list)
1935{
1936 const struct lyd_node *key;
1937 const struct lysc_node *skey = NULL;
1938
1939 assert(list->schema->nodetype == LYS_LIST);
Radek Krejcia1c1e542020-09-29 16:06:52 +02001940 key = lyd_child(list);
Michal Vasko751cb4d2020-07-14 12:25:28 +02001941 while ((skey = lys_getnext(skey, list->schema, NULL, 0)) && (skey->flags & LYS_KEY)) {
1942 if (!key || (key->schema != skey)) {
1943 /* key missing */
1944 return 0;
1945 }
1946
1947 key = key->next;
1948 }
1949
1950 /* all keys found */
1951 return 1;
Michal Vasko90932a92020-02-12 14:33:03 +01001952}
1953
1954void
Michal Vaskob104f112020-07-17 09:54:54 +02001955lyd_insert_node(struct lyd_node *parent, struct lyd_node **first_sibling_p, struct lyd_node *node)
Michal Vasko90932a92020-02-12 14:33:03 +01001956{
Michal Vaskob104f112020-07-17 09:54:54 +02001957 struct lyd_node *anchor, *first_sibling;
Michal Vasko90932a92020-02-12 14:33:03 +01001958
Michal Vaskob104f112020-07-17 09:54:54 +02001959 /* inserting list without its keys is not supported */
1960 assert((parent || first_sibling_p) && node && (node->hash || !node->schema));
Michal Vaskof756c942020-11-06 17:21:37 +01001961 assert(!parent || !parent->schema ||
1962 (parent->schema->nodetype & (LYS_CONTAINER | LYS_LIST | LYS_RPC | LYS_ACTION | LYS_NOTIF)));
Michal Vasko9b368d32020-02-14 13:53:31 +01001963
Michal Vaskob104f112020-07-17 09:54:54 +02001964 if (!parent && first_sibling_p && (*first_sibling_p) && (*first_sibling_p)->parent) {
1965 parent = (struct lyd_node *)(*first_sibling_p)->parent;
Michal Vasko9b368d32020-02-14 13:53:31 +01001966 }
Michal Vasko90932a92020-02-12 14:33:03 +01001967
Michal Vaskob104f112020-07-17 09:54:54 +02001968 /* get first sibling */
1969 first_sibling = parent ? ((struct lyd_node_inner *)parent)->child : *first_sibling_p;
Michal Vasko9f96a052020-03-10 09:41:45 +01001970
Michal Vaskob104f112020-07-17 09:54:54 +02001971 /* find the anchor, our next node, so we can insert before it */
1972 anchor = lyd_insert_get_next_anchor(first_sibling, node);
1973 if (anchor) {
1974 lyd_insert_before_node(anchor, node);
Michal Vasko26123192020-11-09 21:02:34 +01001975 if (!parent && (*first_sibling_p == anchor)) {
1976 /* move first sibling */
1977 *first_sibling_p = node;
1978 }
Michal Vaskob104f112020-07-17 09:54:54 +02001979 } else if (first_sibling) {
1980 lyd_insert_after_node(first_sibling->prev, node);
1981 } else if (parent) {
1982 lyd_insert_only_child(parent, node);
Michal Vasko90932a92020-02-12 14:33:03 +01001983 } else {
Michal Vaskob104f112020-07-17 09:54:54 +02001984 *first_sibling_p = node;
1985 }
1986
1987 /* insert into parent HT */
1988 lyd_insert_hash(node);
1989
1990 /* finish hashes for our parent, if needed and possible */
Michal Vasko9e8de2d2020-09-01 08:17:10 +02001991 if (node->schema && (node->schema->flags & LYS_KEY) && parent && lyd_insert_has_keys(parent)) {
Michal Vaskob104f112020-07-17 09:54:54 +02001992 lyd_hash(parent);
1993
1994 /* now we can insert even the list into its parent HT */
1995 lyd_insert_hash(parent);
Michal Vasko90932a92020-02-12 14:33:03 +01001996 }
Michal Vasko90932a92020-02-12 14:33:03 +01001997}
1998
Michal Vasko717a4c32020-12-07 09:40:10 +01001999/**
2000 * @brief Check schema place of a node to be inserted.
2001 *
2002 * @param[in] parent Schema node of the parent data node.
2003 * @param[in] sibling Schema node of a sibling data node.
2004 * @param[in] schema Schema node if the data node to be inserted.
2005 * @return LY_SUCCESS on success.
2006 * @return LY_EINVAL if the place is invalid.
2007 */
Michal Vaskof03ed032020-03-04 13:31:44 +01002008static LY_ERR
Michal Vasko717a4c32020-12-07 09:40:10 +01002009lyd_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 +01002010{
2011 const struct lysc_node *par2;
2012
Michal Vasko62ed12d2020-05-21 10:08:25 +02002013 assert(!parent || !(parent->nodetype & (LYS_CASE | LYS_CHOICE)));
Michal Vasko717a4c32020-12-07 09:40:10 +01002014 assert(!sibling || !(sibling->nodetype & (LYS_CASE | LYS_CHOICE)));
2015 assert(!schema || !(schema->nodetype & (LYS_CASE | LYS_CHOICE)));
Michal Vaskof03ed032020-03-04 13:31:44 +01002016
Michal Vasko717a4c32020-12-07 09:40:10 +01002017 if (!schema || (!parent && !sibling)) {
Michal Vasko71e795e2020-12-04 16:27:37 +01002018 /* opaque nodes can be inserted wherever */
2019 return LY_SUCCESS;
2020 }
2021
Michal Vasko717a4c32020-12-07 09:40:10 +01002022 if (!parent) {
2023 parent = lysc_data_parent(sibling);
2024 }
2025
Michal Vaskof03ed032020-03-04 13:31:44 +01002026 /* find schema parent */
Michal Vasko62ed12d2020-05-21 10:08:25 +02002027 par2 = lysc_data_parent(schema);
Michal Vaskof03ed032020-03-04 13:31:44 +01002028
2029 if (parent) {
2030 /* inner node */
2031 if (par2 != parent) {
Michal Vaskob104f112020-07-17 09:54:54 +02002032 LOGERR(schema->module->ctx, LY_EINVAL, "Cannot insert, parent of \"%s\" is not \"%s\".", schema->name,
Michal Vasko69730152020-10-09 16:30:07 +02002033 parent->name);
Michal Vaskof03ed032020-03-04 13:31:44 +01002034 return LY_EINVAL;
2035 }
2036 } else {
2037 /* top-level node */
2038 if (par2) {
Radek Krejcif6d14cb2020-07-02 16:11:45 +02002039 LOGERR(schema->module->ctx, LY_EINVAL, "Cannot insert, node \"%s\" is not top-level.", schema->name);
Michal Vaskof03ed032020-03-04 13:31:44 +01002040 return LY_EINVAL;
2041 }
2042 }
2043
2044 return LY_SUCCESS;
2045}
2046
2047API LY_ERR
Michal Vaskob104f112020-07-17 09:54:54 +02002048lyd_insert_child(struct lyd_node *parent, struct lyd_node *node)
Michal Vaskof03ed032020-03-04 13:31:44 +01002049{
2050 struct lyd_node *iter;
2051
Michal Vasko654bc852020-06-23 13:28:06 +02002052 LY_CHECK_ARG_RET(NULL, parent, node, parent->schema->nodetype & LYD_NODE_INNER, LY_EINVAL);
Michal Vaskof03ed032020-03-04 13:31:44 +01002053
Michal Vasko717a4c32020-12-07 09:40:10 +01002054 LY_CHECK_RET(lyd_insert_check_schema(parent->schema, NULL, node->schema));
Michal Vaskof03ed032020-03-04 13:31:44 +01002055
2056 if (node->schema->flags & LYS_KEY) {
2057 LOGERR(parent->schema->module->ctx, LY_EINVAL, "Cannot insert key \"%s\".", node->schema->name);
2058 return LY_EINVAL;
2059 }
2060
2061 if (node->parent || node->prev->next) {
2062 lyd_unlink_tree(node);
2063 }
2064
2065 while (node) {
2066 iter = node->next;
2067 lyd_unlink_tree(node);
2068 lyd_insert_node(parent, NULL, node);
2069 node = iter;
2070 }
2071 return LY_SUCCESS;
2072}
2073
2074API LY_ERR
Michal Vaskob104f112020-07-17 09:54:54 +02002075lyd_insert_sibling(struct lyd_node *sibling, struct lyd_node *node, struct lyd_node **first)
Michal Vaskob1b5c262020-03-05 14:29:47 +01002076{
2077 struct lyd_node *iter;
2078
Michal Vaskob104f112020-07-17 09:54:54 +02002079 LY_CHECK_ARG_RET(NULL, node, LY_EINVAL);
Michal Vaskob1b5c262020-03-05 14:29:47 +01002080
Michal Vaskob104f112020-07-17 09:54:54 +02002081 if (sibling) {
Michal Vasko717a4c32020-12-07 09:40:10 +01002082 LY_CHECK_RET(lyd_insert_check_schema(NULL, sibling->schema, node->schema));
Michal Vaskob1b5c262020-03-05 14:29:47 +01002083 }
2084
Michal Vasko553d0b52020-12-04 16:27:52 +01002085 if (sibling == node) {
2086 /* we need to keep the connection to siblings so we can insert into them */
2087 sibling = sibling->prev;
2088 }
2089
Michal Vaskob1b5c262020-03-05 14:29:47 +01002090 if (node->parent || node->prev->next) {
2091 lyd_unlink_tree(node);
2092 }
2093
2094 while (node) {
Michal Vasko71e795e2020-12-04 16:27:37 +01002095 if (lysc_is_key(node->schema)) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02002096 LOGERR(LYD_CTX(node), LY_EINVAL, "Cannot insert key \"%s\".", node->schema->name);
Michal Vaskob104f112020-07-17 09:54:54 +02002097 return LY_EINVAL;
2098 }
2099
Michal Vaskob1b5c262020-03-05 14:29:47 +01002100 iter = node->next;
2101 lyd_unlink_tree(node);
2102 lyd_insert_node(NULL, &sibling, node);
2103 node = iter;
2104 }
Michal Vaskob1b5c262020-03-05 14:29:47 +01002105
Michal Vaskob104f112020-07-17 09:54:54 +02002106 if (first) {
2107 /* find the first sibling */
2108 *first = sibling;
2109 while ((*first)->prev->next) {
2110 *first = (*first)->prev;
Michal Vasko0249f7c2020-03-05 16:36:40 +01002111 }
2112 }
2113
2114 return LY_SUCCESS;
2115}
2116
Michal Vaskob1b5c262020-03-05 14:29:47 +01002117API LY_ERR
Michal Vaskof03ed032020-03-04 13:31:44 +01002118lyd_insert_before(struct lyd_node *sibling, struct lyd_node *node)
2119{
Michal Vaskof03ed032020-03-04 13:31:44 +01002120 LY_CHECK_ARG_RET(NULL, sibling, node, LY_EINVAL);
2121
Michal Vasko717a4c32020-12-07 09:40:10 +01002122 LY_CHECK_RET(lyd_insert_check_schema(NULL, sibling->schema, node->schema));
Michal Vaskof03ed032020-03-04 13:31:44 +01002123
Michal Vaskob104f112020-07-17 09:54:54 +02002124 if (!(node->schema->nodetype & (LYS_LIST | LYS_LEAFLIST)) || !(node->schema->flags & LYS_ORDBY_USER)) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02002125 LOGERR(LYD_CTX(sibling), LY_EINVAL, "Can be used only for user-ordered nodes.");
Michal Vaskof03ed032020-03-04 13:31:44 +01002126 return LY_EINVAL;
2127 }
2128
Michal Vasko4bc2ce32020-12-08 10:06:16 +01002129 lyd_unlink_tree(node);
2130 lyd_insert_before_node(sibling, node);
2131 lyd_insert_hash(node);
Michal Vaskof03ed032020-03-04 13:31:44 +01002132
Michal Vaskof03ed032020-03-04 13:31:44 +01002133 return LY_SUCCESS;
2134}
2135
2136API LY_ERR
2137lyd_insert_after(struct lyd_node *sibling, struct lyd_node *node)
2138{
Michal Vaskof03ed032020-03-04 13:31:44 +01002139 LY_CHECK_ARG_RET(NULL, sibling, node, LY_EINVAL);
2140
Michal Vasko717a4c32020-12-07 09:40:10 +01002141 LY_CHECK_RET(lyd_insert_check_schema(NULL, sibling->schema, node->schema));
Michal Vaskof03ed032020-03-04 13:31:44 +01002142
Michal Vaskob104f112020-07-17 09:54:54 +02002143 if (!(node->schema->nodetype & (LYS_LIST | LYS_LEAFLIST)) || !(node->schema->flags & LYS_ORDBY_USER)) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02002144 LOGERR(LYD_CTX(sibling), LY_EINVAL, "Can be used only for user-ordered nodes.");
Michal Vaskof03ed032020-03-04 13:31:44 +01002145 return LY_EINVAL;
2146 }
2147
Michal Vasko4bc2ce32020-12-08 10:06:16 +01002148 lyd_unlink_tree(node);
2149 lyd_insert_after_node(sibling, node);
2150 lyd_insert_hash(node);
Michal Vaskof03ed032020-03-04 13:31:44 +01002151
Michal Vaskof03ed032020-03-04 13:31:44 +01002152 return LY_SUCCESS;
2153}
2154
2155API void
2156lyd_unlink_tree(struct lyd_node *node)
2157{
2158 struct lyd_node *iter;
2159
2160 if (!node) {
2161 return;
2162 }
2163
Michal Vaskob104f112020-07-17 09:54:54 +02002164 /* update hashes while still linked into the tree */
2165 lyd_unlink_hash(node);
2166
Michal Vaskof03ed032020-03-04 13:31:44 +01002167 /* unlink from siblings */
2168 if (node->prev->next) {
2169 node->prev->next = node->next;
2170 }
2171 if (node->next) {
2172 node->next->prev = node->prev;
2173 } else {
2174 /* unlinking the last node */
2175 if (node->parent) {
2176 iter = node->parent->child;
2177 } else {
2178 iter = node->prev;
2179 while (iter->prev != node) {
2180 iter = iter->prev;
2181 }
2182 }
2183 /* update the "last" pointer from the first node */
2184 iter->prev = node->prev;
2185 }
2186
2187 /* unlink from parent */
2188 if (node->parent) {
2189 if (node->parent->child == node) {
2190 /* the node is the first child */
2191 node->parent->child = node->next;
2192 }
2193
Michal Vaskoab49dbe2020-07-17 12:32:47 +02002194 /* check for NP container whether its last non-default node is not being unlinked */
Michal Vasko69730152020-10-09 16:30:07 +02002195 if (node->parent->schema && (node->parent->schema->nodetype == LYS_CONTAINER) &&
2196 !(node->parent->flags & LYD_DEFAULT) && !(node->parent->schema->flags & LYS_PRESENCE)) {
Michal Vaskoab49dbe2020-07-17 12:32:47 +02002197 LY_LIST_FOR(node->parent->child, iter) {
2198 if ((iter != node) && !(iter->flags & LYD_DEFAULT)) {
2199 break;
2200 }
2201 }
2202 if (!iter) {
2203 node->parent->flags |= LYD_DEFAULT;
2204 }
2205 }
2206
Michal Vaskof03ed032020-03-04 13:31:44 +01002207 /* check for keyless list and update its hash */
2208 for (iter = (struct lyd_node *)node->parent; iter; iter = (struct lyd_node *)iter->parent) {
Michal Vasko413c7f22020-05-05 12:34:06 +02002209 if (iter->schema && (iter->schema->flags & LYS_KEYLESS)) {
Michal Vaskof03ed032020-03-04 13:31:44 +01002210 lyd_hash(iter);
2211 }
2212 }
2213
2214 node->parent = NULL;
2215 }
2216
2217 node->next = NULL;
2218 node->prev = node;
2219}
2220
Michal Vaskoa5da3292020-08-12 13:10:50 +02002221void
Michal Vasko871a0252020-11-11 18:35:24 +01002222lyd_insert_meta(struct lyd_node *parent, struct lyd_meta *meta, ly_bool clear_dflt)
Radek Krejci1798aae2020-07-14 13:26:06 +02002223{
2224 struct lyd_meta *last, *iter;
2225
2226 assert(parent);
Michal Vaskoa5da3292020-08-12 13:10:50 +02002227
2228 if (!meta) {
2229 return;
2230 }
Radek Krejci1798aae2020-07-14 13:26:06 +02002231
2232 for (iter = meta; iter; iter = iter->next) {
2233 iter->parent = parent;
2234 }
2235
2236 /* insert as the last attribute */
2237 if (parent->meta) {
Radek Krejci1e008d22020-08-17 11:37:37 +02002238 for (last = parent->meta; last->next; last = last->next) {}
Radek Krejci1798aae2020-07-14 13:26:06 +02002239 last->next = meta;
2240 } else {
2241 parent->meta = meta;
2242 }
2243
2244 /* remove default flags from NP containers */
Michal Vasko871a0252020-11-11 18:35:24 +01002245 while (clear_dflt && parent && (parent->schema->nodetype == LYS_CONTAINER) && (parent->flags & LYD_DEFAULT)) {
Radek Krejci1798aae2020-07-14 13:26:06 +02002246 parent->flags &= ~LYD_DEFAULT;
2247 parent = (struct lyd_node *)parent->parent;
2248 }
Radek Krejci1798aae2020-07-14 13:26:06 +02002249}
2250
2251LY_ERR
Michal Vasko9f96a052020-03-10 09:41:45 +01002252lyd_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 +02002253 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 +01002254 void *prefix_data, uint32_t hints, ly_bool clear_dflt, ly_bool *incomplete)
Michal Vasko90932a92020-02-12 14:33:03 +01002255{
Radek Krejci2efc45b2020-12-22 16:25:44 +01002256 LY_ERR ret = LY_SUCCESS;
Michal Vasko90932a92020-02-12 14:33:03 +01002257 struct lysc_ext_instance *ant = NULL;
Michal Vasko9f96a052020-03-10 09:41:45 +01002258 struct lyd_meta *mt, *last;
Michal Vaskofd69e1d2020-07-03 11:57:17 +02002259 LY_ARRAY_COUNT_TYPE u;
Michal Vasko90932a92020-02-12 14:33:03 +01002260
Michal Vasko9f96a052020-03-10 09:41:45 +01002261 assert((parent || meta) && mod);
Michal Vasko6f4cbb62020-02-28 11:15:47 +01002262
Radek Krejciddace2c2021-01-08 11:30:56 +01002263 LOG_LOCSET(parent ? parent->schema : NULL, parent, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +01002264
Radek Krejci7eb54ba2020-05-18 16:30:04 +02002265 LY_ARRAY_FOR(mod->compiled->exts, u) {
Michal Vasko69730152020-10-09 16:30:07 +02002266 if ((mod->compiled->exts[u].def->plugin == lyext_plugins_internal[LYEXT_PLUGIN_INTERNAL_ANNOTATION].plugin) &&
Radek Krejci7eb54ba2020-05-18 16:30:04 +02002267 !ly_strncmp(mod->compiled->exts[u].argument, name, name_len)) {
Michal Vasko90932a92020-02-12 14:33:03 +01002268 /* we have the annotation definition */
Radek Krejci7eb54ba2020-05-18 16:30:04 +02002269 ant = &mod->compiled->exts[u];
Michal Vasko90932a92020-02-12 14:33:03 +01002270 break;
2271 }
2272 }
2273 if (!ant) {
2274 /* attribute is not defined as a metadata annotation (RFC 7952) */
Radek Krejci2efc45b2020-12-22 16:25:44 +01002275 LOGVAL(mod->ctx, LYVE_REFERENCE, "Annotation definition for attribute \"%s:%.*s\" not found.",
Michal Vasko90932a92020-02-12 14:33:03 +01002276 mod->name, name_len, name);
Radek Krejci2efc45b2020-12-22 16:25:44 +01002277 ret = LY_EINVAL;
2278 goto cleanup;
Michal Vasko90932a92020-02-12 14:33:03 +01002279 }
2280
Michal Vasko9f96a052020-03-10 09:41:45 +01002281 mt = calloc(1, sizeof *mt);
Radek Krejci2efc45b2020-12-22 16:25:44 +01002282 LY_CHECK_ERR_GOTO(!mt, LOGMEM(mod->ctx); ret = LY_EMEM, cleanup);
Michal Vasko9f96a052020-03-10 09:41:45 +01002283 mt->parent = parent;
2284 mt->annotation = ant;
Radek Krejci2efc45b2020-12-22 16:25:44 +01002285 ret = lyd_value_store(mod->ctx, &mt->value, ((struct lyext_metadata *)ant->data)->type, value, value_len, dynamic,
2286 format, prefix_data, hints, parent ? parent->schema : NULL, incomplete);
2287 LY_CHECK_ERR_GOTO(ret, free(mt), cleanup);
2288 ret = lydict_insert(mod->ctx, name, name_len, &mt->name);
2289 LY_CHECK_ERR_GOTO(ret, free(mt), cleanup);
Michal Vasko90932a92020-02-12 14:33:03 +01002290
Michal Vasko6f4cbb62020-02-28 11:15:47 +01002291 /* insert as the last attribute */
2292 if (parent) {
Michal Vasko871a0252020-11-11 18:35:24 +01002293 lyd_insert_meta(parent, mt, clear_dflt);
Michal Vasko9f96a052020-03-10 09:41:45 +01002294 } else if (*meta) {
Radek Krejci1e008d22020-08-17 11:37:37 +02002295 for (last = *meta; last->next; last = last->next) {}
Michal Vasko9f96a052020-03-10 09:41:45 +01002296 last->next = mt;
Michal Vasko90932a92020-02-12 14:33:03 +01002297 }
2298
Michal Vasko9f96a052020-03-10 09:41:45 +01002299 if (meta) {
2300 *meta = mt;
Michal Vasko90932a92020-02-12 14:33:03 +01002301 }
Radek Krejci2efc45b2020-12-22 16:25:44 +01002302
2303cleanup:
Radek Krejciddace2c2021-01-08 11:30:56 +01002304 LOG_LOCBACK((parent && parent->schema) ? 1 : 0, parent ? 1 : 0, 0, 0);
Radek Krejci2efc45b2020-12-22 16:25:44 +01002305 return ret;
Michal Vasko90932a92020-02-12 14:33:03 +01002306}
2307
Michal Vaskoa5da3292020-08-12 13:10:50 +02002308void
2309lyd_insert_attr(struct lyd_node *parent, struct lyd_attr *attr)
2310{
2311 struct lyd_attr *last, *iter;
2312 struct lyd_node_opaq *opaq;
2313
2314 assert(parent && !parent->schema);
2315
2316 if (!attr) {
2317 return;
2318 }
2319
2320 opaq = (struct lyd_node_opaq *)parent;
2321 for (iter = attr; iter; iter = iter->next) {
2322 iter->parent = opaq;
2323 }
2324
2325 /* insert as the last attribute */
2326 if (opaq->attr) {
Radek Krejci1e008d22020-08-17 11:37:37 +02002327 for (last = opaq->attr; last->next; last = last->next) {}
Michal Vaskoa5da3292020-08-12 13:10:50 +02002328 last->next = attr;
2329 } else {
2330 opaq->attr = attr;
2331 }
2332}
2333
Michal Vasko52927e22020-03-16 17:26:14 +01002334LY_ERR
Michal Vaskofeca4fb2020-10-05 08:58:40 +02002335lyd_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 +01002336 const char *prefix, size_t prefix_len, const char *module_key, size_t module_key_len, const char *value,
2337 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 +01002338{
Radek Krejci011e4aa2020-09-04 15:22:31 +02002339 LY_ERR ret = LY_SUCCESS;
Radek Krejci1798aae2020-07-14 13:26:06 +02002340 struct lyd_attr *at, *last;
Michal Vasko52927e22020-03-16 17:26:14 +01002341
2342 assert(ctx && (parent || attr) && (!parent || !parent->schema));
Michal Vaskofeca4fb2020-10-05 08:58:40 +02002343 assert(name && name_len && format);
Michal Vasko52927e22020-03-16 17:26:14 +01002344
2345 if (!value_len) {
2346 value = "";
2347 }
2348
2349 at = calloc(1, sizeof *at);
Michal Vasko6b5cb2a2020-11-11 19:11:21 +01002350 LY_CHECK_ERR_RET(!at, LOGMEM(ctx); ly_free_prefix_data(format, val_prefix_data), LY_EMEM);
Radek Krejcid46e46a2020-09-15 14:22:42 +02002351
Michal Vaskoad92b672020-11-12 13:11:31 +01002352 LY_CHECK_GOTO(ret = lydict_insert(ctx, name, name_len, &at->name.name), finish);
Michal Vasko501af032020-11-11 20:27:44 +01002353 if (prefix_len) {
Michal Vaskoad92b672020-11-12 13:11:31 +01002354 LY_CHECK_GOTO(ret = lydict_insert(ctx, prefix, prefix_len, &at->name.prefix), finish);
Michal Vasko501af032020-11-11 20:27:44 +01002355 }
2356 if (module_key_len) {
Michal Vaskoad92b672020-11-12 13:11:31 +01002357 LY_CHECK_GOTO(ret = lydict_insert(ctx, module_key, module_key_len, &at->name.module_ns), finish);
Michal Vasko501af032020-11-11 20:27:44 +01002358 }
2359
Michal Vasko52927e22020-03-16 17:26:14 +01002360 if (dynamic && *dynamic) {
Radek Krejci011e4aa2020-09-04 15:22:31 +02002361 ret = lydict_insert_zc(ctx, (char *)value, &at->value);
2362 LY_CHECK_GOTO(ret, finish);
Michal Vasko52927e22020-03-16 17:26:14 +01002363 *dynamic = 0;
2364 } else {
Radek Krejci011e4aa2020-09-04 15:22:31 +02002365 LY_CHECK_GOTO(ret = lydict_insert(ctx, value, value_len, &at->value), finish);
Michal Vasko52927e22020-03-16 17:26:14 +01002366 }
Michal Vasko501af032020-11-11 20:27:44 +01002367 at->format = format;
2368 at->val_prefix_data = val_prefix_data;
2369 at->hints = hints;
Michal Vasko52927e22020-03-16 17:26:14 +01002370
2371 /* insert as the last attribute */
2372 if (parent) {
Michal Vaskoa5da3292020-08-12 13:10:50 +02002373 lyd_insert_attr(parent, at);
Michal Vasko52927e22020-03-16 17:26:14 +01002374 } else if (*attr) {
Radek Krejci1e008d22020-08-17 11:37:37 +02002375 for (last = *attr; last->next; last = last->next) {}
Michal Vasko52927e22020-03-16 17:26:14 +01002376 last->next = at;
2377 }
2378
Radek Krejci011e4aa2020-09-04 15:22:31 +02002379finish:
2380 if (ret) {
2381 lyd_free_attr_single(ctx, at);
2382 } else if (attr) {
Michal Vasko52927e22020-03-16 17:26:14 +01002383 *attr = at;
2384 }
2385 return LY_SUCCESS;
2386}
2387
Radek Krejci084289f2019-07-09 17:35:30 +02002388API const struct lyd_node_term *
Michal Vasko004d3152020-06-11 19:59:22 +02002389lyd_target(const struct ly_path *path, const struct lyd_node *tree)
Radek Krejci084289f2019-07-09 17:35:30 +02002390{
Michal Vasko004d3152020-06-11 19:59:22 +02002391 struct lyd_node *target;
Radek Krejci084289f2019-07-09 17:35:30 +02002392
Michal Vasko004d3152020-06-11 19:59:22 +02002393 if (ly_path_eval(path, tree, &target)) {
2394 return NULL;
Radek Krejci084289f2019-07-09 17:35:30 +02002395 }
2396
Michal Vasko004d3152020-06-11 19:59:22 +02002397 return (struct lyd_node_term *)target;
Radek Krejci084289f2019-07-09 17:35:30 +02002398}
2399
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002400API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02002401lyd_compare_single(const struct lyd_node *node1, const struct lyd_node *node2, uint32_t options)
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002402{
2403 const struct lyd_node *iter1, *iter2;
2404 struct lyd_node_term *term1, *term2;
2405 struct lyd_node_any *any1, *any2;
Michal Vasko52927e22020-03-16 17:26:14 +01002406 struct lyd_node_opaq *opaq1, *opaq2;
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002407 size_t len1, len2;
Radek Krejci084289f2019-07-09 17:35:30 +02002408
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002409 if (!node1 || !node2) {
2410 if (node1 == node2) {
2411 return LY_SUCCESS;
2412 } else {
2413 return LY_ENOT;
2414 }
2415 }
2416
Michal Vaskob7be7a82020-08-20 09:09:04 +02002417 if ((LYD_CTX(node1) != LYD_CTX(node2)) || (node1->schema != node2->schema)) {
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002418 return LY_ENOT;
2419 }
2420
2421 if (node1->hash != node2->hash) {
2422 return LY_ENOT;
2423 }
Michal Vasko52927e22020-03-16 17:26:14 +01002424 /* 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 +02002425
Michal Vasko52927e22020-03-16 17:26:14 +01002426 if (!node1->schema) {
2427 opaq1 = (struct lyd_node_opaq *)node1;
2428 opaq2 = (struct lyd_node_opaq *)node2;
Michal Vaskoad92b672020-11-12 13:11:31 +01002429 if ((opaq1->name.name != opaq2->name.name) || (opaq1->format != opaq2->format) ||
2430 (opaq1->name.module_ns != opaq2->name.module_ns)) {
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002431 return LY_ENOT;
2432 }
Michal Vasko52927e22020-03-16 17:26:14 +01002433 switch (opaq1->format) {
Michal Vasko6b5cb2a2020-11-11 19:11:21 +01002434 case LY_PREF_XML:
2435 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 +01002436 return LY_ENOT;
2437 }
2438 break;
Michal Vasko6b5cb2a2020-11-11 19:11:21 +01002439 case LY_PREF_JSON:
Radek Krejci1798aae2020-07-14 13:26:06 +02002440 /* prefixes in JSON are unique, so it is not necessary to canonize the values */
2441 if (strcmp(opaq1->value, opaq2->value)) {
2442 return LY_ENOT;
2443 }
2444 break;
Michal Vasko6b5cb2a2020-11-11 19:11:21 +01002445 default:
Michal Vasko52927e22020-03-16 17:26:14 +01002446 /* not allowed */
Michal Vaskob7be7a82020-08-20 09:09:04 +02002447 LOGINT(LYD_CTX(node1));
Michal Vasko52927e22020-03-16 17:26:14 +01002448 return LY_EINT;
2449 }
2450 if (options & LYD_COMPARE_FULL_RECURSION) {
2451 iter1 = opaq1->child;
2452 iter2 = opaq2->child;
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002453 goto all_children_compare;
Michal Vasko52927e22020-03-16 17:26:14 +01002454 }
2455 return LY_SUCCESS;
2456 } else {
2457 switch (node1->schema->nodetype) {
2458 case LYS_LEAF:
2459 case LYS_LEAFLIST:
2460 if (options & LYD_COMPARE_DEFAULTS) {
2461 if ((node1->flags & LYD_DEFAULT) != (node2->flags & LYD_DEFAULT)) {
2462 return LY_ENOT;
2463 }
2464 }
2465
Michal Vasko1a2bf2e2020-06-16 13:07:48 +02002466 term1 = (struct lyd_node_term *)node1;
2467 term2 = (struct lyd_node_term *)node2;
2468 if (term1->value.realtype != term2->value.realtype) {
2469 return LY_ENOT;
2470 }
Michal Vasko52927e22020-03-16 17:26:14 +01002471
Michal Vasko1a2bf2e2020-06-16 13:07:48 +02002472 return term1->value.realtype->plugin->compare(&term1->value, &term2->value);
Michal Vasko52927e22020-03-16 17:26:14 +01002473 case LYS_CONTAINER:
2474 if (options & LYD_COMPARE_DEFAULTS) {
2475 if ((node1->flags & LYD_DEFAULT) != (node2->flags & LYD_DEFAULT)) {
2476 return LY_ENOT;
2477 }
2478 }
2479 if (options & LYD_COMPARE_FULL_RECURSION) {
Michal Vasko22df3f02020-08-24 13:29:22 +02002480 iter1 = ((struct lyd_node_inner *)node1)->child;
2481 iter2 = ((struct lyd_node_inner *)node2)->child;
Michal Vasko52927e22020-03-16 17:26:14 +01002482 goto all_children_compare;
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002483 }
2484 return LY_SUCCESS;
Michal Vasko1bf09392020-03-27 12:38:10 +01002485 case LYS_RPC:
Michal Vasko52927e22020-03-16 17:26:14 +01002486 case LYS_ACTION:
2487 if (options & LYD_COMPARE_FULL_RECURSION) {
2488 /* TODO action/RPC
2489 goto all_children_compare;
2490 */
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002491 }
2492 return LY_SUCCESS;
Michal Vasko52927e22020-03-16 17:26:14 +01002493 case LYS_NOTIF:
2494 if (options & LYD_COMPARE_FULL_RECURSION) {
2495 /* TODO Notification
2496 goto all_children_compare;
2497 */
2498 }
2499 return LY_SUCCESS;
2500 case LYS_LIST:
Michal Vasko22df3f02020-08-24 13:29:22 +02002501 iter1 = ((struct lyd_node_inner *)node1)->child;
2502 iter2 = ((struct lyd_node_inner *)node2)->child;
Michal Vasko52927e22020-03-16 17:26:14 +01002503
2504 if (!(node1->schema->flags & LYS_KEYLESS) && !(options & LYD_COMPARE_FULL_RECURSION)) {
2505 /* lists with keys, their equivalence is based on their keys */
Michal Vasko22df3f02020-08-24 13:29:22 +02002506 for (struct lysc_node *key = ((struct lysc_node_list *)node1->schema)->child;
Michal Vaskoc57d9a92020-06-23 13:28:27 +02002507 key && (key->flags & LYS_KEY);
Michal Vasko52927e22020-03-16 17:26:14 +01002508 key = key->next) {
Michal Vasko8f359bf2020-07-28 10:41:15 +02002509 if (lyd_compare_single(iter1, iter2, options)) {
Michal Vasko52927e22020-03-16 17:26:14 +01002510 return LY_ENOT;
2511 }
2512 iter1 = iter1->next;
2513 iter2 = iter2->next;
2514 }
2515 } else {
2516 /* lists without keys, their equivalence is based on equivalence of all the children (both direct and indirect) */
2517
Radek Krejci0f969882020-08-21 16:56:47 +02002518all_children_compare:
Michal Vasko52927e22020-03-16 17:26:14 +01002519 if (!iter1 && !iter2) {
2520 /* no children, nothing to compare */
2521 return LY_SUCCESS;
2522 }
2523
Michal Vaskod989ba02020-08-24 10:59:24 +02002524 for ( ; iter1 && iter2; iter1 = iter1->next, iter2 = iter2->next) {
Michal Vasko8f359bf2020-07-28 10:41:15 +02002525 if (lyd_compare_single(iter1, iter2, options | LYD_COMPARE_FULL_RECURSION)) {
Michal Vasko52927e22020-03-16 17:26:14 +01002526 return LY_ENOT;
2527 }
2528 }
2529 if (iter1 || iter2) {
2530 return LY_ENOT;
2531 }
2532 }
2533 return LY_SUCCESS;
2534 case LYS_ANYXML:
2535 case LYS_ANYDATA:
Michal Vasko22df3f02020-08-24 13:29:22 +02002536 any1 = (struct lyd_node_any *)node1;
2537 any2 = (struct lyd_node_any *)node2;
Michal Vasko52927e22020-03-16 17:26:14 +01002538
2539 if (any1->value_type != any2->value_type) {
2540 return LY_ENOT;
2541 }
2542 switch (any1->value_type) {
2543 case LYD_ANYDATA_DATATREE:
2544 iter1 = any1->value.tree;
2545 iter2 = any2->value.tree;
2546 goto all_children_compare;
2547 case LYD_ANYDATA_STRING:
2548 case LYD_ANYDATA_XML:
2549 case LYD_ANYDATA_JSON:
2550 len1 = strlen(any1->value.str);
2551 len2 = strlen(any2->value.str);
Michal Vasko69730152020-10-09 16:30:07 +02002552 if ((len1 != len2) || strcmp(any1->value.str, any2->value.str)) {
Michal Vasko52927e22020-03-16 17:26:14 +01002553 return LY_ENOT;
2554 }
2555 return LY_SUCCESS;
Michal Vasko52927e22020-03-16 17:26:14 +01002556 case LYD_ANYDATA_LYB:
Michal Vasko60ea6352020-06-29 13:39:39 +02002557 len1 = lyd_lyb_data_length(any1->value.mem);
2558 len2 = lyd_lyb_data_length(any2->value.mem);
Michal Vasko69730152020-10-09 16:30:07 +02002559 if ((len1 != len2) || memcmp(any1->value.mem, any2->value.mem, len1)) {
Michal Vasko52927e22020-03-16 17:26:14 +01002560 return LY_ENOT;
2561 }
2562 return LY_SUCCESS;
Michal Vasko52927e22020-03-16 17:26:14 +01002563 }
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002564 }
2565 }
2566
Michal Vaskob7be7a82020-08-20 09:09:04 +02002567 LOGINT(LYD_CTX(node1));
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002568 return LY_EINT;
2569}
Radek Krejci22ebdba2019-07-25 13:59:43 +02002570
Michal Vasko21725742020-06-29 11:49:25 +02002571API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02002572lyd_compare_siblings(const struct lyd_node *node1, const struct lyd_node *node2, uint32_t options)
Michal Vasko8f359bf2020-07-28 10:41:15 +02002573{
Michal Vaskod989ba02020-08-24 10:59:24 +02002574 for ( ; node1 && node2; node1 = node1->next, node2 = node2->next) {
Michal Vasko8f359bf2020-07-28 10:41:15 +02002575 LY_CHECK_RET(lyd_compare_single(node1, node2, options));
2576 }
2577
Michal Vasko11a81432020-07-28 16:31:29 +02002578 if (node1 == node2) {
2579 return LY_SUCCESS;
Michal Vasko8f359bf2020-07-28 10:41:15 +02002580 }
Michal Vasko11a81432020-07-28 16:31:29 +02002581 return LY_ENOT;
Michal Vasko8f359bf2020-07-28 10:41:15 +02002582}
2583
2584API LY_ERR
Michal Vasko21725742020-06-29 11:49:25 +02002585lyd_compare_meta(const struct lyd_meta *meta1, const struct lyd_meta *meta2)
2586{
2587 if (!meta1 || !meta2) {
2588 if (meta1 == meta2) {
2589 return LY_SUCCESS;
2590 } else {
2591 return LY_ENOT;
2592 }
2593 }
2594
Michal Vaskoa8083062020-11-06 17:22:10 +01002595 if ((meta1->annotation->module->ctx != meta2->annotation->module->ctx) || (meta1->annotation != meta2->annotation)) {
Michal Vasko21725742020-06-29 11:49:25 +02002596 return LY_ENOT;
2597 }
2598
2599 if (meta1->value.realtype != meta2->value.realtype) {
2600 return LY_ENOT;
2601 }
2602
2603 return meta1->value.realtype->plugin->compare(&meta1->value, &meta2->value);
2604}
2605
Radek Krejci22ebdba2019-07-25 13:59:43 +02002606/**
Michal Vasko52927e22020-03-16 17:26:14 +01002607 * @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 +02002608 *
2609 * 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 +02002610 *
2611 * @param[in] node Original node to duplicate
2612 * @param[in] parent Parent to insert into, NULL for top-level sibling.
2613 * @param[in,out] first First sibling, NULL if no top-level sibling exist yet. Can be also NULL if @p parent is set.
2614 * @param[in] options Bitmask of options flags, see @ref dupoptions.
2615 * @param[out] dup_p Pointer where the created duplicated node is placed (besides connecting it int @p parent / @p first sibling).
2616 * @return LY_ERR value
Radek Krejci22ebdba2019-07-25 13:59:43 +02002617 */
Michal Vasko52927e22020-03-16 17:26:14 +01002618static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02002619lyd_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 +02002620 struct lyd_node **dup_p)
Radek Krejci22ebdba2019-07-25 13:59:43 +02002621{
Michal Vasko52927e22020-03-16 17:26:14 +01002622 LY_ERR ret;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002623 struct lyd_node *dup = NULL;
Michal Vasko61551fa2020-07-09 15:45:45 +02002624 struct lyd_meta *meta;
2625 struct lyd_node_any *any;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002626
Michal Vasko52927e22020-03-16 17:26:14 +01002627 LY_CHECK_ARG_RET(NULL, node, LY_EINVAL);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002628
Michal Vasko52927e22020-03-16 17:26:14 +01002629 if (!node->schema) {
2630 dup = calloc(1, sizeof(struct lyd_node_opaq));
2631 } else {
2632 switch (node->schema->nodetype) {
Michal Vasko1bf09392020-03-27 12:38:10 +01002633 case LYS_RPC:
Michal Vasko52927e22020-03-16 17:26:14 +01002634 case LYS_ACTION:
2635 case LYS_NOTIF:
2636 case LYS_CONTAINER:
2637 case LYS_LIST:
2638 dup = calloc(1, sizeof(struct lyd_node_inner));
2639 break;
2640 case LYS_LEAF:
2641 case LYS_LEAFLIST:
2642 dup = calloc(1, sizeof(struct lyd_node_term));
2643 break;
2644 case LYS_ANYDATA:
2645 case LYS_ANYXML:
2646 dup = calloc(1, sizeof(struct lyd_node_any));
2647 break;
2648 default:
Michal Vaskob7be7a82020-08-20 09:09:04 +02002649 LOGINT(LYD_CTX(node));
Michal Vasko52927e22020-03-16 17:26:14 +01002650 ret = LY_EINT;
2651 goto error;
2652 }
Radek Krejci22ebdba2019-07-25 13:59:43 +02002653 }
Michal Vaskob7be7a82020-08-20 09:09:04 +02002654 LY_CHECK_ERR_GOTO(!dup, LOGMEM(LYD_CTX(node)); ret = LY_EMEM, error);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002655
Michal Vaskof6df0a02020-06-16 13:08:34 +02002656 if (options & LYD_DUP_WITH_FLAGS) {
2657 dup->flags = node->flags;
2658 } else {
2659 dup->flags = (node->flags & LYD_DEFAULT) | LYD_NEW;
2660 }
Radek Krejci22ebdba2019-07-25 13:59:43 +02002661 dup->schema = node->schema;
Michal Vasko52927e22020-03-16 17:26:14 +01002662 dup->prev = dup;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002663
Michal Vasko25a32822020-07-09 15:48:22 +02002664 /* duplicate metadata */
2665 if (!(options & LYD_DUP_NO_META)) {
2666 LY_LIST_FOR(node->meta, meta) {
Michal Vasko3a41dff2020-07-15 14:30:28 +02002667 LY_CHECK_GOTO(ret = lyd_dup_meta_single(meta, dup, NULL), error);
Michal Vasko25a32822020-07-09 15:48:22 +02002668 }
2669 }
Radek Krejci22ebdba2019-07-25 13:59:43 +02002670
2671 /* nodetype-specific work */
Michal Vasko52927e22020-03-16 17:26:14 +01002672 if (!dup->schema) {
2673 struct lyd_node_opaq *opaq = (struct lyd_node_opaq *)dup;
2674 struct lyd_node_opaq *orig = (struct lyd_node_opaq *)node;
2675 struct lyd_node *child;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002676
2677 if (options & LYD_DUP_RECURSIVE) {
2678 /* duplicate all the children */
2679 LY_LIST_FOR(orig->child, child) {
Michal Vasko3a41dff2020-07-15 14:30:28 +02002680 LY_CHECK_GOTO(ret = lyd_dup_r(child, dup, NULL, options, NULL), error);
Michal Vasko52927e22020-03-16 17:26:14 +01002681 }
2682 }
Michal Vaskoad92b672020-11-12 13:11:31 +01002683 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), orig->name.name, 0, &opaq->name.name), error);
Michal Vasko52927e22020-03-16 17:26:14 +01002684 opaq->format = orig->format;
Michal Vaskoad92b672020-11-12 13:11:31 +01002685 if (orig->name.prefix) {
2686 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), orig->name.prefix, 0, &opaq->name.prefix), error);
Michal Vasko52927e22020-03-16 17:26:14 +01002687 }
Michal Vaskoad92b672020-11-12 13:11:31 +01002688 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 +01002689 if (orig->val_prefix_data) {
2690 ret = ly_dup_prefix_data(LYD_CTX(node), opaq->format, orig->val_prefix_data, &opaq->val_prefix_data);
2691 LY_CHECK_GOTO(ret, error);
Michal Vasko52927e22020-03-16 17:26:14 +01002692 }
Radek Krejci011e4aa2020-09-04 15:22:31 +02002693 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), orig->value, 0, &opaq->value), error);
Michal Vasko52927e22020-03-16 17:26:14 +01002694 opaq->ctx = orig->ctx;
2695 } else if (dup->schema->nodetype & LYD_NODE_TERM) {
2696 struct lyd_node_term *term = (struct lyd_node_term *)dup;
2697 struct lyd_node_term *orig = (struct lyd_node_term *)node;
2698
2699 term->hash = orig->hash;
Michal Vaskob7be7a82020-08-20 09:09:04 +02002700 LY_CHECK_ERR_GOTO(orig->value.realtype->plugin->duplicate(LYD_CTX(node), &orig->value, &term->value),
Michal Vasko69730152020-10-09 16:30:07 +02002701 LOGERR(LYD_CTX(node), LY_EINT, "Value duplication failed."); ret = LY_EINT, error);
Michal Vasko52927e22020-03-16 17:26:14 +01002702 } else if (dup->schema->nodetype & LYD_NODE_INNER) {
2703 struct lyd_node_inner *orig = (struct lyd_node_inner *)node;
2704 struct lyd_node *child;
2705
2706 if (options & LYD_DUP_RECURSIVE) {
2707 /* duplicate all the children */
2708 LY_LIST_FOR(orig->child, child) {
Michal Vasko3a41dff2020-07-15 14:30:28 +02002709 LY_CHECK_GOTO(ret = lyd_dup_r(child, dup, NULL, options, NULL), error);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002710 }
Michal Vasko69730152020-10-09 16:30:07 +02002711 } else if ((dup->schema->nodetype == LYS_LIST) && !(dup->schema->flags & LYS_KEYLESS)) {
Radek Krejci22ebdba2019-07-25 13:59:43 +02002712 /* always duplicate keys of a list */
Radek Krejci22ebdba2019-07-25 13:59:43 +02002713 child = orig->child;
Michal Vasko52927e22020-03-16 17:26:14 +01002714 for (struct lysc_node *key = ((struct lysc_node_list *)dup->schema)->child;
Michal Vaskoc57d9a92020-06-23 13:28:27 +02002715 key && (key->flags & LYS_KEY);
Radek Krejci0fe9b512019-07-26 17:51:05 +02002716 key = key->next) {
Radek Krejci22ebdba2019-07-25 13:59:43 +02002717 if (!child) {
2718 /* possibly not keys are present in filtered tree */
2719 break;
Radek Krejci0fe9b512019-07-26 17:51:05 +02002720 } else if (child->schema != key) {
2721 /* possibly not all keys are present in filtered tree,
2722 * but there can be also some non-key nodes */
2723 continue;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002724 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02002725 LY_CHECK_GOTO(ret = lyd_dup_r(child, dup, NULL, options, NULL), error);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002726 child = child->next;
2727 }
2728 }
2729 lyd_hash(dup);
2730 } else if (dup->schema->nodetype & LYD_NODE_ANY) {
Michal Vasko61551fa2020-07-09 15:45:45 +02002731 dup->hash = node->hash;
2732 any = (struct lyd_node_any *)node;
2733 LY_CHECK_GOTO(ret = lyd_any_copy_value(dup, &any->value, any->value_type), error);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002734 }
2735
Michal Vasko52927e22020-03-16 17:26:14 +01002736 /* insert */
2737 lyd_insert_node(parent, first, dup);
Michal Vasko52927e22020-03-16 17:26:14 +01002738
2739 if (dup_p) {
2740 *dup_p = dup;
2741 }
2742 return LY_SUCCESS;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002743
2744error:
Michal Vasko52927e22020-03-16 17:26:14 +01002745 lyd_free_tree(dup);
2746 return ret;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002747}
2748
Michal Vasko3a41dff2020-07-15 14:30:28 +02002749static LY_ERR
2750lyd_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 +02002751 struct lyd_node_inner **local_parent)
Radek Krejci22ebdba2019-07-25 13:59:43 +02002752{
Michal Vasko3a41dff2020-07-15 14:30:28 +02002753 const struct lyd_node_inner *orig_parent, *iter;
Radek Krejci857189e2020-09-01 13:26:36 +02002754 ly_bool repeat = 1;
Michal Vasko3a41dff2020-07-15 14:30:28 +02002755
2756 *dup_parent = NULL;
2757 *local_parent = NULL;
2758
2759 for (orig_parent = node->parent; repeat && orig_parent; orig_parent = orig_parent->parent) {
2760 if (parent && (parent->schema == orig_parent->schema)) {
2761 /* stop creating parents, connect what we have into the provided parent */
2762 iter = parent;
2763 repeat = 0;
2764 } else {
2765 iter = NULL;
2766 LY_CHECK_RET(lyd_dup_r((struct lyd_node *)orig_parent, NULL, (struct lyd_node **)&iter, 0,
Radek Krejci0f969882020-08-21 16:56:47 +02002767 (struct lyd_node **)&iter));
Michal Vasko3a41dff2020-07-15 14:30:28 +02002768 }
2769 if (!*local_parent) {
2770 *local_parent = (struct lyd_node_inner *)iter;
2771 }
2772 if (iter->child) {
2773 /* 1) list - add after keys
2774 * 2) provided parent with some children */
2775 iter->child->prev->next = *dup_parent;
2776 if (*dup_parent) {
2777 (*dup_parent)->prev = iter->child->prev;
2778 iter->child->prev = *dup_parent;
2779 }
2780 } else {
2781 ((struct lyd_node_inner *)iter)->child = *dup_parent;
2782 }
2783 if (*dup_parent) {
2784 (*dup_parent)->parent = (struct lyd_node_inner *)iter;
2785 }
2786 *dup_parent = (struct lyd_node *)iter;
2787 }
2788
2789 if (repeat && parent) {
2790 /* given parent and created parents chain actually do not interconnect */
Michal Vaskob7be7a82020-08-20 09:09:04 +02002791 LOGERR(LYD_CTX(node), LY_EINVAL,
Michal Vasko69730152020-10-09 16:30:07 +02002792 "Invalid argument parent (%s()) - does not interconnect with the created node's parents chain.", __func__);
Michal Vasko3a41dff2020-07-15 14:30:28 +02002793 return LY_EINVAL;
2794 }
2795
2796 return LY_SUCCESS;
2797}
2798
2799static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02002800lyd_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 +02002801{
2802 LY_ERR rc;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002803 const struct lyd_node *orig; /* original node to be duplicated */
2804 struct lyd_node *first = NULL; /* the first duplicated node, this is returned */
Radek Krejci22ebdba2019-07-25 13:59:43 +02002805 struct lyd_node *top = NULL; /* the most higher created node */
2806 struct lyd_node_inner *local_parent = NULL; /* the direct parent node for the duplicated node(s) */
Radek Krejci22ebdba2019-07-25 13:59:43 +02002807
Michal Vasko3a41dff2020-07-15 14:30:28 +02002808 LY_CHECK_ARG_RET(NULL, node, LY_EINVAL);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002809
2810 if (options & LYD_DUP_WITH_PARENTS) {
Michal Vasko3a41dff2020-07-15 14:30:28 +02002811 LY_CHECK_GOTO(rc = lyd_dup_get_local_parent(node, parent, &top, &local_parent), error);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002812 } else {
2813 local_parent = parent;
2814 }
2815
Radek Krejci22ebdba2019-07-25 13:59:43 +02002816 LY_LIST_FOR(node, orig) {
Michal Vasko52927e22020-03-16 17:26:14 +01002817 /* if there is no local parent, it will be inserted into first */
Michal Vasko3a41dff2020-07-15 14:30:28 +02002818 LY_CHECK_GOTO(rc = lyd_dup_r(orig, (struct lyd_node *)local_parent, &first, options, first ? NULL : &first), error);
2819 if (nosiblings) {
Radek Krejci22ebdba2019-07-25 13:59:43 +02002820 break;
2821 }
2822 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02002823
2824 /* rehash if needed */
Michal Vaskod989ba02020-08-24 10:59:24 +02002825 for ( ; local_parent; local_parent = local_parent->parent) {
Michal Vasko69730152020-10-09 16:30:07 +02002826 if ((local_parent->schema->nodetype == LYS_LIST) && (local_parent->schema->flags & LYS_KEYLESS)) {
Michal Vasko3a41dff2020-07-15 14:30:28 +02002827 lyd_hash((struct lyd_node *)local_parent);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002828 }
2829 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02002830
2831 if (dup) {
2832 *dup = first;
2833 }
2834 return LY_SUCCESS;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002835
2836error:
2837 if (top) {
2838 lyd_free_tree(top);
2839 } else {
Michal Vaskof03ed032020-03-04 13:31:44 +01002840 lyd_free_siblings(first);
Radek Krejci22ebdba2019-07-25 13:59:43 +02002841 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02002842 return rc;
Radek Krejci22ebdba2019-07-25 13:59:43 +02002843}
Michal Vasko5ec7cda2019-09-11 13:43:08 +02002844
Michal Vasko3a41dff2020-07-15 14:30:28 +02002845API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02002846lyd_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 +02002847{
2848 return lyd_dup(node, parent, options, 1, dup);
2849}
2850
2851API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02002852lyd_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 +02002853{
2854 return lyd_dup(node, parent, options, 0, dup);
2855}
2856
2857API LY_ERR
2858lyd_dup_meta_single(const struct lyd_meta *meta, struct lyd_node *node, struct lyd_meta **dup)
Michal Vasko25a32822020-07-09 15:48:22 +02002859{
Radek Krejci011e4aa2020-09-04 15:22:31 +02002860 LY_ERR ret = LY_SUCCESS;
Michal Vasko25a32822020-07-09 15:48:22 +02002861 struct lyd_meta *mt, *last;
2862
Michal Vasko3a41dff2020-07-15 14:30:28 +02002863 LY_CHECK_ARG_RET(NULL, meta, node, LY_EINVAL);
Michal Vasko25a32822020-07-09 15:48:22 +02002864
2865 /* create a copy */
2866 mt = calloc(1, sizeof *mt);
Michal Vaskob7be7a82020-08-20 09:09:04 +02002867 LY_CHECK_ERR_RET(!mt, LOGMEM(LYD_CTX(node)), LY_EMEM);
Michal Vasko25a32822020-07-09 15:48:22 +02002868 mt->annotation = meta->annotation;
Michal Vaskob7be7a82020-08-20 09:09:04 +02002869 ret = meta->value.realtype->plugin->duplicate(LYD_CTX(node), &meta->value, &mt->value);
Radek Krejci011e4aa2020-09-04 15:22:31 +02002870 LY_CHECK_ERR_GOTO(ret, LOGERR(LYD_CTX(node), LY_EINT, "Value duplication failed."), finish);
2871 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), meta->name, 0, &mt->name), finish);
Michal Vasko25a32822020-07-09 15:48:22 +02002872
2873 /* insert as the last attribute */
Radek Krejci011e4aa2020-09-04 15:22:31 +02002874 mt->parent = node;
Michal Vasko25a32822020-07-09 15:48:22 +02002875 if (node->meta) {
Radek Krejci1e008d22020-08-17 11:37:37 +02002876 for (last = node->meta; last->next; last = last->next) {}
Michal Vasko25a32822020-07-09 15:48:22 +02002877 last->next = mt;
2878 } else {
2879 node->meta = mt;
2880 }
2881
Radek Krejci011e4aa2020-09-04 15:22:31 +02002882finish:
2883 if (ret) {
2884 lyd_free_meta_single(mt);
2885 } else if (dup) {
Michal Vasko3a41dff2020-07-15 14:30:28 +02002886 *dup = mt;
2887 }
2888 return LY_SUCCESS;
Michal Vasko25a32822020-07-09 15:48:22 +02002889}
2890
Michal Vasko4490d312020-06-16 13:08:55 +02002891/**
2892 * @brief Merge a source sibling into target siblings.
2893 *
2894 * @param[in,out] first_trg First target sibling, is updated if top-level.
2895 * @param[in] parent_trg Target parent.
2896 * @param[in,out] sibling_src Source sibling to merge, set to NULL if spent.
2897 * @param[in] options Merge options.
2898 * @return LY_ERR value.
2899 */
2900static LY_ERR
2901lyd_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 +02002902 uint16_t options)
Michal Vasko4490d312020-06-16 13:08:55 +02002903{
2904 LY_ERR ret;
2905 const struct lyd_node *child_src, *tmp, *sibling_src;
Michal Vasko56daf732020-08-10 10:57:18 +02002906 struct lyd_node *match_trg, *dup_src, *elem;
Michal Vasko4490d312020-06-16 13:08:55 +02002907 struct lysc_type *type;
Michal Vasko4490d312020-06-16 13:08:55 +02002908
2909 sibling_src = *sibling_src_p;
2910 if (sibling_src->schema->nodetype & (LYS_LIST | LYS_LEAFLIST)) {
2911 /* try to find the exact instance */
2912 ret = lyd_find_sibling_first(*first_trg, sibling_src, &match_trg);
2913 } else {
2914 /* try to simply find the node, there cannot be more instances */
2915 ret = lyd_find_sibling_val(*first_trg, sibling_src->schema, NULL, 0, &match_trg);
2916 }
2917
2918 if (!ret) {
2919 /* node found, make sure even value matches for all node types */
Michal Vasko8f359bf2020-07-28 10:41:15 +02002920 if ((match_trg->schema->nodetype == LYS_LEAF) && lyd_compare_single(sibling_src, match_trg, LYD_COMPARE_DEFAULTS)) {
Michal Vasko4490d312020-06-16 13:08:55 +02002921 /* since they are different, they cannot both be default */
2922 assert(!(sibling_src->flags & LYD_DEFAULT) || !(match_trg->flags & LYD_DEFAULT));
2923
Michal Vasko3a41dff2020-07-15 14:30:28 +02002924 /* update value (or only LYD_DEFAULT flag) only if flag set or the source node is not default */
2925 if ((options & LYD_MERGE_DEFAULTS) || !(sibling_src->flags & LYD_DEFAULT)) {
Michal Vasko4490d312020-06-16 13:08:55 +02002926 type = ((struct lysc_node_leaf *)match_trg->schema)->type;
Michal Vaskob7be7a82020-08-20 09:09:04 +02002927 type->plugin->free(LYD_CTX(match_trg), &((struct lyd_node_term *)match_trg)->value);
2928 LY_CHECK_RET(type->plugin->duplicate(LYD_CTX(match_trg), &((struct lyd_node_term *)sibling_src)->value,
Michal Vasko69730152020-10-09 16:30:07 +02002929 &((struct lyd_node_term *)match_trg)->value));
Michal Vasko4490d312020-06-16 13:08:55 +02002930
2931 /* copy flags and add LYD_NEW */
2932 match_trg->flags = sibling_src->flags | LYD_NEW;
2933 }
Michal Vasko8f359bf2020-07-28 10:41:15 +02002934 } else if ((match_trg->schema->nodetype & LYS_ANYDATA) && lyd_compare_single(sibling_src, match_trg, 0)) {
Michal Vasko4c583e82020-07-17 12:16:14 +02002935 /* update value */
2936 LY_CHECK_RET(lyd_any_copy_value(match_trg, &((struct lyd_node_any *)sibling_src)->value,
Radek Krejci0f969882020-08-21 16:56:47 +02002937 ((struct lyd_node_any *)sibling_src)->value_type));
Michal Vasko4490d312020-06-16 13:08:55 +02002938
2939 /* copy flags and add LYD_NEW */
2940 match_trg->flags = sibling_src->flags | LYD_NEW;
Michal Vasko4490d312020-06-16 13:08:55 +02002941 } else {
2942 /* check descendants, recursively */
Radek Krejcia1c1e542020-09-29 16:06:52 +02002943 LY_LIST_FOR_SAFE(lyd_child_no_keys(sibling_src), tmp, child_src) {
Michal Vasko4490d312020-06-16 13:08:55 +02002944 LY_CHECK_RET(lyd_merge_sibling_r(lyd_node_children_p(match_trg), match_trg, &child_src, options));
2945 }
2946 }
2947 } else {
2948 /* node not found, merge it */
2949 if (options & LYD_MERGE_DESTRUCT) {
2950 dup_src = (struct lyd_node *)sibling_src;
2951 lyd_unlink_tree(dup_src);
2952 /* spend it */
2953 *sibling_src_p = NULL;
2954 } else {
Michal Vasko3a41dff2020-07-15 14:30:28 +02002955 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 +02002956 }
2957
2958 /* set LYD_NEW for all the new nodes, required for validation */
Michal Vasko56daf732020-08-10 10:57:18 +02002959 LYD_TREE_DFS_BEGIN(dup_src, elem) {
Michal Vasko4490d312020-06-16 13:08:55 +02002960 elem->flags |= LYD_NEW;
Michal Vasko56daf732020-08-10 10:57:18 +02002961 LYD_TREE_DFS_END(dup_src, elem);
Michal Vasko4490d312020-06-16 13:08:55 +02002962 }
2963
2964 lyd_insert_node(parent_trg, first_trg, dup_src);
2965 }
2966
2967 return LY_SUCCESS;
2968}
2969
Michal Vasko3a41dff2020-07-15 14:30:28 +02002970static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02002971lyd_merge(struct lyd_node **target, const struct lyd_node *source, uint16_t options, ly_bool nosiblings)
Michal Vasko4490d312020-06-16 13:08:55 +02002972{
2973 const struct lyd_node *sibling_src, *tmp;
Radek Krejci857189e2020-09-01 13:26:36 +02002974 ly_bool first;
Michal Vasko4490d312020-06-16 13:08:55 +02002975
2976 LY_CHECK_ARG_RET(NULL, target, LY_EINVAL);
2977
2978 if (!source) {
2979 /* nothing to merge */
2980 return LY_SUCCESS;
2981 }
2982
Michal Vasko831422b2020-11-24 11:20:51 +01002983 if ((*target && lysc_data_parent((*target)->schema)) || lysc_data_parent(source->schema)) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02002984 LOGERR(LYD_CTX(source), LY_EINVAL, "Invalid arguments - can merge only 2 top-level subtrees (%s()).", __func__);
Michal Vasko4490d312020-06-16 13:08:55 +02002985 return LY_EINVAL;
2986 }
2987
2988 LY_LIST_FOR_SAFE(source, tmp, sibling_src) {
Radek Krejci857189e2020-09-01 13:26:36 +02002989 first = (sibling_src == source) ? 1 : 0;
Michal Vasko4490d312020-06-16 13:08:55 +02002990 LY_CHECK_RET(lyd_merge_sibling_r(target, NULL, &sibling_src, options));
2991 if (first && !sibling_src) {
2992 /* source was spent (unlinked), move to the next node */
2993 source = tmp;
2994 }
2995
Michal Vasko3a41dff2020-07-15 14:30:28 +02002996 if (nosiblings) {
Michal Vasko4490d312020-06-16 13:08:55 +02002997 break;
2998 }
2999 }
3000
3001 if (options & LYD_MERGE_DESTRUCT) {
3002 /* free any leftover source data that were not merged */
3003 lyd_free_siblings((struct lyd_node *)source);
3004 }
3005
3006 return LY_SUCCESS;
3007}
3008
Michal Vasko3a41dff2020-07-15 14:30:28 +02003009API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02003010lyd_merge_tree(struct lyd_node **target, const struct lyd_node *source, uint16_t options)
Michal Vasko3a41dff2020-07-15 14:30:28 +02003011{
3012 return lyd_merge(target, source, options, 1);
3013}
3014
3015API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02003016lyd_merge_siblings(struct lyd_node **target, const struct lyd_node *source, uint16_t options)
Michal Vasko3a41dff2020-07-15 14:30:28 +02003017{
3018 return lyd_merge(target, source, options, 0);
3019}
3020
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003021static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02003022lyd_path_str_enlarge(char **buffer, size_t *buflen, size_t reqlen, ly_bool is_static)
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003023{
Michal Vasko14654712020-02-06 08:35:21 +01003024 /* ending \0 */
3025 ++reqlen;
3026
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003027 if (reqlen > *buflen) {
3028 if (is_static) {
3029 return LY_EINCOMPLETE;
3030 }
3031
3032 *buffer = ly_realloc(*buffer, reqlen * sizeof **buffer);
3033 if (!*buffer) {
3034 return LY_EMEM;
3035 }
3036
3037 *buflen = reqlen;
3038 }
3039
3040 return LY_SUCCESS;
3041}
3042
Michal Vaskod59035b2020-07-08 12:00:06 +02003043LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02003044lyd_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 +02003045{
3046 const struct lyd_node *key;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003047 size_t len;
3048 const char *val;
3049 char quot;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003050
Radek Krejcia1c1e542020-09-29 16:06:52 +02003051 for (key = lyd_child(node); key && (key->schema->flags & LYS_KEY); key = key->next) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02003052 val = LYD_CANON_VALUE(key);
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003053 len = 1 + strlen(key->schema->name) + 2 + strlen(val) + 2;
Michal Vaskoba99a3e2020-08-18 15:50:05 +02003054 LY_CHECK_RET(lyd_path_str_enlarge(buffer, buflen, *bufused + len, is_static));
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003055
3056 quot = '\'';
3057 if (strchr(val, '\'')) {
3058 quot = '"';
3059 }
3060 *bufused += sprintf(*buffer + *bufused, "[%s=%c%s%c]", key->schema->name, quot, val, quot);
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003061 }
3062
3063 return LY_SUCCESS;
3064}
3065
3066/**
3067 * @brief Append leaf-list value predicate to path.
3068 *
3069 * @param[in] node Node to print.
3070 * @param[in,out] buffer Buffer to print to.
3071 * @param[in,out] buflen Current buffer length.
3072 * @param[in,out] bufused Current number of characters used in @p buffer.
3073 * @param[in] is_static Whether buffer is static or can be reallocated.
3074 * @return LY_ERR
3075 */
3076static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02003077lyd_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 +02003078{
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003079 size_t len;
3080 const char *val;
3081 char quot;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003082
Michal Vaskob7be7a82020-08-20 09:09:04 +02003083 val = LYD_CANON_VALUE(node);
Radek Krejcif13b87b2020-12-01 22:02:17 +01003084 len = 4 + strlen(val) + 2; /* "[.='" + val + "']" */
Michal Vaskoba99a3e2020-08-18 15:50:05 +02003085 LY_CHECK_RET(lyd_path_str_enlarge(buffer, buflen, *bufused + len, is_static));
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003086
3087 quot = '\'';
3088 if (strchr(val, '\'')) {
3089 quot = '"';
3090 }
3091 *bufused += sprintf(*buffer + *bufused, "[.=%c%s%c]", quot, val, quot);
3092
Michal Vaskoba99a3e2020-08-18 15:50:05 +02003093 return LY_SUCCESS;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003094}
3095
3096/**
3097 * @brief Append node position (relative to its other instances) predicate to path.
3098 *
3099 * @param[in] node Node to print.
3100 * @param[in,out] buffer Buffer to print to.
3101 * @param[in,out] buflen Current buffer length.
3102 * @param[in,out] bufused Current number of characters used in @p buffer.
3103 * @param[in] is_static Whether buffer is static or can be reallocated.
3104 * @return LY_ERR
3105 */
3106static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02003107lyd_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 +02003108{
3109 const struct lyd_node *first, *iter;
3110 size_t len;
Radek Krejci1deb5be2020-08-26 16:43:36 +02003111 uint64_t pos;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003112 char *val = NULL;
3113 LY_ERR rc;
3114
3115 if (node->parent) {
3116 first = node->parent->child;
3117 } else {
Michal Vaskoe070bfe2020-08-31 12:27:25 +02003118 for (first = node; first->prev->next; first = first->prev) {}
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003119 }
3120 pos = 1;
3121 for (iter = first; iter != node; iter = iter->next) {
3122 if (iter->schema == node->schema) {
3123 ++pos;
3124 }
3125 }
Radek Krejci1deb5be2020-08-26 16:43:36 +02003126 if (asprintf(&val, "%" PRIu64, pos) == -1) {
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003127 return LY_EMEM;
3128 }
3129
3130 len = 1 + strlen(val) + 1;
3131 rc = lyd_path_str_enlarge(buffer, buflen, *bufused + len, is_static);
3132 if (rc != LY_SUCCESS) {
3133 goto cleanup;
3134 }
3135
3136 *bufused += sprintf(*buffer + *bufused, "[%s]", val);
3137
3138cleanup:
3139 free(val);
3140 return rc;
3141}
3142
3143API char *
3144lyd_path(const struct lyd_node *node, LYD_PATH_TYPE pathtype, char *buffer, size_t buflen)
3145{
Radek Krejci857189e2020-09-01 13:26:36 +02003146 ly_bool is_static = 0;
Radek Krejci1deb5be2020-08-26 16:43:36 +02003147 uint32_t i, depth;
Michal Vasko14654712020-02-06 08:35:21 +01003148 size_t bufused = 0, len;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003149 const struct lyd_node *iter;
3150 const struct lys_module *mod;
Michal Vasko790b2bc2020-08-03 13:35:06 +02003151 LY_ERR rc = LY_SUCCESS;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003152
3153 LY_CHECK_ARG_RET(NULL, node, NULL);
3154 if (buffer) {
3155 LY_CHECK_ARG_RET(node->schema->module->ctx, buflen > 1, NULL);
3156 is_static = 1;
Michal Vasko14654712020-02-06 08:35:21 +01003157 } else {
3158 buflen = 0;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003159 }
3160
3161 switch (pathtype) {
Radek Krejci635d2b82021-01-04 11:26:51 +01003162 case LYD_PATH_STD:
3163 case LYD_PATH_STD_NO_LAST_PRED:
Michal Vasko14654712020-02-06 08:35:21 +01003164 depth = 1;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003165 for (iter = node; iter->parent; iter = (const struct lyd_node *)iter->parent) {
3166 ++depth;
3167 }
3168
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003169 goto iter_print;
Michal Vasko14654712020-02-06 08:35:21 +01003170 while (depth) {
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003171 /* find the right node */
Radek Krejci1e008d22020-08-17 11:37:37 +02003172 for (iter = node, i = 1; i < depth; iter = (const struct lyd_node *)iter->parent, ++i) {}
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003173iter_print:
3174 /* print prefix and name */
3175 mod = NULL;
Michal Vasko69730152020-10-09 16:30:07 +02003176 if (iter->schema && (!iter->parent || (iter->schema->module != iter->parent->schema->module))) {
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003177 mod = iter->schema->module;
3178 }
3179
3180 /* realloc string */
Michal Vaskoad92b672020-11-12 13:11:31 +01003181 len = 1 + (mod ? strlen(mod->name) + 1 : 0) + (iter->schema ? strlen(iter->schema->name) :
3182 strlen(((struct lyd_node_opaq *)iter)->name.name));
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003183 rc = lyd_path_str_enlarge(&buffer, &buflen, bufused + len, is_static);
3184 if (rc != LY_SUCCESS) {
3185 break;
3186 }
3187
3188 /* print next node */
Radek Krejci1798aae2020-07-14 13:26:06 +02003189 bufused += sprintf(buffer + bufused, "/%s%s%s", mod ? mod->name : "", mod ? ":" : "",
Michal Vaskoad92b672020-11-12 13:11:31 +01003190 iter->schema ? iter->schema->name : ((struct lyd_node_opaq *)iter)->name.name);
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003191
Michal Vasko790b2bc2020-08-03 13:35:06 +02003192 /* do not always print the last (first) predicate */
Radek Krejci635d2b82021-01-04 11:26:51 +01003193 if (iter->schema && ((depth > 1) || (pathtype == LYD_PATH_STD))) {
Michal Vasko790b2bc2020-08-03 13:35:06 +02003194 switch (iter->schema->nodetype) {
3195 case LYS_LIST:
3196 if (iter->schema->flags & LYS_KEYLESS) {
3197 /* print its position */
3198 rc = lyd_path_position_predicate(iter, &buffer, &buflen, &bufused, is_static);
3199 } else {
3200 /* print all list keys in predicates */
3201 rc = lyd_path_list_predicate(iter, &buffer, &buflen, &bufused, is_static);
3202 }
3203 break;
3204 case LYS_LEAFLIST:
3205 if (iter->schema->flags & LYS_CONFIG_W) {
3206 /* print leaf-list value */
3207 rc = lyd_path_leaflist_predicate(iter, &buffer, &buflen, &bufused, is_static);
3208 } else {
3209 /* print its position */
3210 rc = lyd_path_position_predicate(iter, &buffer, &buflen, &bufused, is_static);
3211 }
3212 break;
3213 default:
3214 /* nothing to print more */
3215 break;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003216 }
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003217 }
3218 if (rc != LY_SUCCESS) {
3219 break;
3220 }
3221
Michal Vasko14654712020-02-06 08:35:21 +01003222 --depth;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003223 }
3224 break;
3225 }
3226
3227 return buffer;
3228}
Michal Vaskoe444f752020-02-10 12:20:06 +01003229
Michal Vasko25a32822020-07-09 15:48:22 +02003230API struct lyd_meta *
3231lyd_find_meta(const struct lyd_meta *first, const struct lys_module *module, const char *name)
3232{
3233 struct lyd_meta *ret = NULL;
3234 const struct ly_ctx *ctx;
3235 const char *prefix, *tmp;
3236 char *str;
3237 size_t pref_len, name_len;
3238
3239 LY_CHECK_ARG_RET(NULL, module || strchr(name, ':'), name, NULL);
3240
3241 if (!first) {
3242 return NULL;
3243 }
3244
3245 ctx = first->annotation->module->ctx;
3246
3247 /* parse the name */
3248 tmp = name;
3249 if (ly_parse_nodeid(&tmp, &prefix, &pref_len, &name, &name_len) || tmp[0]) {
3250 LOGERR(ctx, LY_EINVAL, "Metadata name \"%s\" is not valid.", name);
3251 return NULL;
3252 }
3253
3254 /* find the module */
3255 if (prefix) {
3256 str = strndup(prefix, pref_len);
3257 module = ly_ctx_get_module_latest(ctx, str);
3258 free(str);
3259 LY_CHECK_ERR_RET(!module, LOGERR(ctx, LY_EINVAL, "Module \"%.*s\" not found.", pref_len, prefix), NULL);
3260 }
3261
3262 /* find the metadata */
3263 LY_LIST_FOR(first, first) {
3264 if ((first->annotation->module == module) && !strcmp(first->name, name)) {
3265 ret = (struct lyd_meta *)first;
3266 break;
3267 }
3268 }
3269
3270 return ret;
3271}
3272
Michal Vasko9b368d32020-02-14 13:53:31 +01003273API LY_ERR
Michal Vaskoe444f752020-02-10 12:20:06 +01003274lyd_find_sibling_first(const struct lyd_node *siblings, const struct lyd_node *target, struct lyd_node **match)
3275{
3276 struct lyd_node **match_p;
3277 struct lyd_node_inner *parent;
3278
Michal Vaskof03ed032020-03-04 13:31:44 +01003279 LY_CHECK_ARG_RET(NULL, target, LY_EINVAL);
Michal Vaskoe444f752020-02-10 12:20:06 +01003280
Michal Vasko6da1e952020-12-09 18:14:38 +01003281 if (!siblings || (siblings->schema && target->schema &&
3282 (lysc_data_parent(siblings->schema) != lysc_data_parent(target->schema)))) {
Michal Vasko62ed12d2020-05-21 10:08:25 +02003283 /* no data or schema mismatch */
Michal Vasko9b368d32020-02-14 13:53:31 +01003284 if (match) {
3285 *match = NULL;
3286 }
Michal Vaskoe444f752020-02-10 12:20:06 +01003287 return LY_ENOTFOUND;
3288 }
3289
3290 /* find first sibling */
3291 if (siblings->parent) {
3292 siblings = siblings->parent->child;
3293 } else {
3294 while (siblings->prev->next) {
3295 siblings = siblings->prev;
3296 }
3297 }
3298
3299 parent = (struct lyd_node_inner *)siblings->parent;
Michal Vasko6da1e952020-12-09 18:14:38 +01003300 if (parent && parent->schema && parent->children_ht) {
Michal Vaskoe444f752020-02-10 12:20:06 +01003301 assert(target->hash);
3302
3303 /* find by hash */
3304 if (!lyht_find(parent->children_ht, &target, target->hash, (void **)&match_p)) {
Michal Vaskoda859032020-07-14 12:20:14 +02003305 /* check even value when needed */
Michal Vasko8f359bf2020-07-28 10:41:15 +02003306 if (!(target->schema->nodetype & (LYS_LIST | LYS_LEAFLIST)) || !lyd_compare_single(target, *match_p, 0)) {
Michal Vaskoda859032020-07-14 12:20:14 +02003307 siblings = *match_p;
3308 } else {
3309 siblings = NULL;
3310 }
Michal Vaskoe444f752020-02-10 12:20:06 +01003311 } else {
3312 /* not found */
3313 siblings = NULL;
3314 }
3315 } else {
3316 /* no children hash table */
Michal Vaskod989ba02020-08-24 10:59:24 +02003317 for ( ; siblings; siblings = siblings->next) {
Michal Vasko8f359bf2020-07-28 10:41:15 +02003318 if (!lyd_compare_single(siblings, target, 0)) {
Michal Vaskoe444f752020-02-10 12:20:06 +01003319 break;
3320 }
3321 }
3322 }
3323
3324 if (!siblings) {
Michal Vasko9b368d32020-02-14 13:53:31 +01003325 if (match) {
3326 *match = NULL;
3327 }
Michal Vaskoe444f752020-02-10 12:20:06 +01003328 return LY_ENOTFOUND;
3329 }
3330
Michal Vasko9b368d32020-02-14 13:53:31 +01003331 if (match) {
3332 *match = (struct lyd_node *)siblings;
3333 }
Michal Vaskoe444f752020-02-10 12:20:06 +01003334 return LY_SUCCESS;
3335}
3336
Radek Krejci857189e2020-09-01 13:26:36 +02003337/**
3338 * @brief Comparison callback to match schema node with a schema of a data node.
3339 *
3340 * @param[in] val1_p Pointer to the schema node
3341 * @param[in] val2_p Pointer to the data node
3342 * Implementation of ::values_equal_cb.
3343 */
3344static ly_bool
3345lyd_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 +01003346{
3347 struct lysc_node *val1;
3348 struct lyd_node *val2;
3349
3350 val1 = *((struct lysc_node **)val1_p);
3351 val2 = *((struct lyd_node **)val2_p);
3352
Michal Vasko90932a92020-02-12 14:33:03 +01003353 if (val1 == val2->schema) {
3354 /* schema match is enough */
3355 return 1;
3356 } else {
3357 return 0;
3358 }
3359}
3360
Michal Vasko92239c72020-11-18 18:17:25 +01003361/**
3362 * @brief Search in the given siblings (NOT recursively) for the first schema node data instance.
3363 * Uses hashes - should be used whenever possible for best performance.
3364 *
3365 * @param[in] siblings Siblings to search in including preceding and succeeding nodes.
3366 * @param[in] schema Target data node schema to find.
3367 * @param[out] match Can be NULL, otherwise the found data node.
3368 * @return LY_SUCCESS on success, @p match set.
3369 * @return LY_ENOTFOUND if not found, @p match set to NULL.
3370 * @return LY_ERR value if another error occurred.
3371 */
Michal Vasko90932a92020-02-12 14:33:03 +01003372static LY_ERR
3373lyd_find_sibling_schema(const struct lyd_node *siblings, const struct lysc_node *schema, struct lyd_node **match)
3374{
3375 struct lyd_node **match_p;
3376 struct lyd_node_inner *parent;
3377 uint32_t hash;
3378 values_equal_cb ht_cb;
3379
Michal Vaskob104f112020-07-17 09:54:54 +02003380 assert(siblings && schema);
Michal Vasko90932a92020-02-12 14:33:03 +01003381
3382 parent = (struct lyd_node_inner *)siblings->parent;
Michal Vasko08fd6132020-11-18 18:17:45 +01003383 if (parent && parent->schema && parent->children_ht) {
Michal Vasko90932a92020-02-12 14:33:03 +01003384 /* calculate our hash */
3385 hash = dict_hash_multi(0, schema->module->name, strlen(schema->module->name));
3386 hash = dict_hash_multi(hash, schema->name, strlen(schema->name));
3387 hash = dict_hash_multi(hash, NULL, 0);
3388
3389 /* use special hash table function */
3390 ht_cb = lyht_set_cb(parent->children_ht, lyd_hash_table_schema_val_equal);
3391
3392 /* find by hash */
3393 if (!lyht_find(parent->children_ht, &schema, hash, (void **)&match_p)) {
3394 siblings = *match_p;
3395 } else {
3396 /* not found */
3397 siblings = NULL;
3398 }
3399
3400 /* set the original hash table compare function back */
3401 lyht_set_cb(parent->children_ht, ht_cb);
3402 } else {
Michal Vaskob104f112020-07-17 09:54:54 +02003403 /* find first sibling */
3404 if (siblings->parent) {
3405 siblings = siblings->parent->child;
3406 } else {
3407 while (siblings->prev->next) {
3408 siblings = siblings->prev;
3409 }
3410 }
3411
3412 /* search manually without hashes */
Michal Vaskod989ba02020-08-24 10:59:24 +02003413 for ( ; siblings; siblings = siblings->next) {
Michal Vasko90932a92020-02-12 14:33:03 +01003414 if (siblings->schema == schema) {
3415 /* schema match is enough */
3416 break;
3417 }
3418 }
3419 }
3420
3421 if (!siblings) {
Michal Vasko9b368d32020-02-14 13:53:31 +01003422 if (match) {
3423 *match = NULL;
3424 }
Michal Vasko90932a92020-02-12 14:33:03 +01003425 return LY_ENOTFOUND;
3426 }
3427
Michal Vasko9b368d32020-02-14 13:53:31 +01003428 if (match) {
3429 *match = (struct lyd_node *)siblings;
3430 }
Michal Vasko90932a92020-02-12 14:33:03 +01003431 return LY_SUCCESS;
3432}
3433
Michal Vaskoe444f752020-02-10 12:20:06 +01003434API LY_ERR
3435lyd_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 +02003436 size_t val_len, struct lyd_node **match)
Michal Vaskoe444f752020-02-10 12:20:06 +01003437{
3438 LY_ERR rc;
3439 struct lyd_node *target = NULL;
3440
Michal Vasko4c583e82020-07-17 12:16:14 +02003441 LY_CHECK_ARG_RET(NULL, schema, !(schema->nodetype & (LYS_CHOICE | LYS_CASE)), LY_EINVAL);
Michal Vaskoe444f752020-02-10 12:20:06 +01003442
Michal Vasko08fd6132020-11-18 18:17:45 +01003443 if (!siblings || (siblings->schema && (lysc_data_parent(siblings->schema) != lysc_data_parent(schema)))) {
Michal Vasko62ed12d2020-05-21 10:08:25 +02003444 /* no data or schema mismatch */
Michal Vasko9b368d32020-02-14 13:53:31 +01003445 if (match) {
3446 *match = NULL;
3447 }
Michal Vaskoe444f752020-02-10 12:20:06 +01003448 return LY_ENOTFOUND;
3449 }
3450
Michal Vaskof03ed032020-03-04 13:31:44 +01003451 if (key_or_value && !val_len) {
3452 val_len = strlen(key_or_value);
3453 }
3454
Michal Vaskob104f112020-07-17 09:54:54 +02003455 if ((schema->nodetype & (LYS_LIST | LYS_LEAFLIST)) && key_or_value) {
3456 /* create a data node and find the instance */
3457 if (schema->nodetype == LYS_LEAFLIST) {
3458 /* target used attributes: schema, hash, value */
Michal Vaskofeca4fb2020-10-05 08:58:40 +02003459 rc = lyd_create_term(schema, key_or_value, val_len, NULL, LY_PREF_JSON, NULL, LYD_HINT_DATA, NULL, &target);
3460 LY_CHECK_RET(rc);
Michal Vaskob104f112020-07-17 09:54:54 +02003461 } else {
Michal Vasko90932a92020-02-12 14:33:03 +01003462 /* target used attributes: schema, hash, child (all keys) */
Michal Vasko004d3152020-06-11 19:59:22 +02003463 LY_CHECK_RET(lyd_create_list2(schema, key_or_value, val_len, &target));
Michal Vasko90932a92020-02-12 14:33:03 +01003464 }
3465
3466 /* find it */
3467 rc = lyd_find_sibling_first(siblings, target, match);
Michal Vaskob104f112020-07-17 09:54:54 +02003468 } else {
3469 /* find the first schema node instance */
3470 rc = lyd_find_sibling_schema(siblings, schema, match);
Michal Vaskoe444f752020-02-10 12:20:06 +01003471 }
3472
Michal Vaskoe444f752020-02-10 12:20:06 +01003473 lyd_free_tree(target);
3474 return rc;
3475}
Michal Vaskoccc02342020-05-21 10:09:21 +02003476
3477API LY_ERR
3478lyd_find_xpath(const struct lyd_node *ctx_node, const char *xpath, struct ly_set **set)
3479{
3480 LY_ERR ret = LY_SUCCESS;
3481 struct lyxp_set xp_set;
Radek Krejcif03a9e22020-09-18 20:09:31 +02003482 struct lyxp_expr *exp = NULL;
Michal Vaskoccc02342020-05-21 10:09:21 +02003483 uint32_t i;
3484
3485 LY_CHECK_ARG_RET(NULL, ctx_node, xpath, set, LY_EINVAL);
3486
3487 memset(&xp_set, 0, sizeof xp_set);
3488
3489 /* compile expression */
Radek Krejcif03a9e22020-09-18 20:09:31 +02003490 ret = lyxp_expr_parse((struct ly_ctx *)LYD_CTX(ctx_node), xpath, 0, 1, &exp);
3491 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskoccc02342020-05-21 10:09:21 +02003492
3493 /* evaluate expression */
Michal Vaskocdad7122020-11-09 21:04:44 +01003494 ret = lyxp_eval(exp, NULL, LY_PREF_JSON, NULL, ctx_node, ctx_node, &xp_set, LYXP_IGNORE_WHEN);
Michal Vaskoccc02342020-05-21 10:09:21 +02003495 LY_CHECK_GOTO(ret, cleanup);
3496
3497 /* allocate return set */
Radek Krejciba03a5a2020-08-27 14:40:41 +02003498 ret = ly_set_new(set);
3499 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskoccc02342020-05-21 10:09:21 +02003500
3501 /* transform into ly_set */
3502 if (xp_set.type == LYXP_SET_NODE_SET) {
3503 /* allocate memory for all the elements once (even though not all items must be elements but most likely will be) */
3504 (*set)->objs = malloc(xp_set.used * sizeof *(*set)->objs);
Michal Vaskob7be7a82020-08-20 09:09:04 +02003505 LY_CHECK_ERR_GOTO(!(*set)->objs, LOGMEM(LYD_CTX(ctx_node)); ret = LY_EMEM, cleanup);
Michal Vaskoccc02342020-05-21 10:09:21 +02003506 (*set)->size = xp_set.used;
3507
3508 for (i = 0; i < xp_set.used; ++i) {
3509 if (xp_set.val.nodes[i].type == LYXP_NODE_ELEM) {
Radek Krejci3d92e442020-10-12 12:48:13 +02003510 ret = ly_set_add(*set, xp_set.val.nodes[i].node, 1, NULL);
Radek Krejciba03a5a2020-08-27 14:40:41 +02003511 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskoccc02342020-05-21 10:09:21 +02003512 }
3513 }
3514 }
3515
3516cleanup:
Michal Vasko0691d522020-05-21 13:21:47 +02003517 lyxp_set_free_content(&xp_set);
Michal Vaskob7be7a82020-08-20 09:09:04 +02003518 lyxp_expr_free((struct ly_ctx *)LYD_CTX(ctx_node), exp);
Radek Krejci8f45abc2020-11-26 12:15:13 +01003519 if (ret) {
3520 ly_set_free(*set, NULL);
3521 *set = NULL;
3522 }
Michal Vaskoccc02342020-05-21 10:09:21 +02003523 return ret;
3524}
Radek Krejcica989142020-11-05 11:32:22 +01003525
3526API uint32_t
3527lyd_list_pos(const struct lyd_node *instance)
3528{
3529 const struct lyd_node *iter = NULL;
3530 uint32_t pos = 0;
3531
3532 if (!instance || !(instance->schema->nodetype & (LYS_LIST | LYS_LEAFLIST))) {
3533 return 0;
3534 }
3535
3536 /* data instances are ordered, so we can stop when we found instance of other schema node */
3537 for (iter = instance; iter->schema == instance->schema; iter = iter->prev) {
Radek Krejcibb27df32020-11-13 15:39:16 +01003538 if (pos && (iter->next == NULL)) {
Radek Krejcica989142020-11-05 11:32:22 +01003539 /* overrun to the end of the siblings list */
3540 break;
3541 }
3542 ++pos;
3543 }
3544
3545 return pos;
3546}
Radek Krejci4233f9b2020-11-05 12:38:35 +01003547
3548API struct lyd_node *
3549lyd_first_sibling(const struct lyd_node *node)
3550{
3551 struct lyd_node *start;
3552
3553 if (!node) {
3554 return NULL;
3555 }
3556
3557 /* get the first sibling */
3558 if (node->parent) {
3559 start = node->parent->child;
3560 } else {
Radek Krejcibb27df32020-11-13 15:39:16 +01003561 for (start = (struct lyd_node *)node; start->prev->next; start = start->prev) {}
Radek Krejci4233f9b2020-11-05 12:38:35 +01003562 }
3563
3564 return start;
3565}