blob: 4c2a9d6b07d433f0cec06f0eefaf09a6a3e9d563 [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 Krejci0aa1f702021-04-01 16:16:19 +020040#include "plugins.h"
Radek Krejcif1ca0ac2021-04-12 16:00:06 +020041#include "plugins_exts/metadata.h"
Radek Krejci3e6632f2021-03-22 22:08:21 +010042#include "plugins_internal.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"
Radek Krejci859a15a2021-03-05 20:56:59 +010047#include "tree_edit.h"
Radek Krejci535ea9f2020-05-29 16:01:05 +020048#include "tree_schema.h"
49#include "tree_schema_internal.h"
Michal Vaskoa6669ba2020-08-06 16:14:26 +020050#include "validation.h"
Radek Krejci535ea9f2020-05-29 16:01:05 +020051#include "xml.h"
52#include "xpath.h"
Radek Krejcie7b95092019-05-15 11:03:07 +020053
Michal Vaskob104f112020-07-17 09:54:54 +020054static LY_ERR lyd_find_sibling_schema(const struct lyd_node *siblings, const struct lysc_node *schema,
Radek Krejci0f969882020-08-21 16:56:47 +020055 struct lyd_node **match);
Michal Vaskob104f112020-07-17 09:54:54 +020056
Radek Krejci084289f2019-07-09 17:35:30 +020057LY_ERR
Radek Krejcif9943642021-04-26 10:18:21 +020058lyd_value_store(const struct ly_ctx *ctx, struct lyd_value *val, const struct lysc_type *type, const void *value,
Radek Krejci8df109d2021-04-23 12:19:08 +020059 size_t value_len, ly_bool *dynamic, LY_VALUE_FORMAT format, void *prefix_data, uint32_t hints,
Radek Krejci2efc45b2020-12-22 16:25:44 +010060 const struct lysc_node *ctx_node, ly_bool *incomplete)
Radek Krejci084289f2019-07-09 17:35:30 +020061{
Michal Vaskofeca4fb2020-10-05 08:58:40 +020062 LY_ERR ret;
Radek Krejci084289f2019-07-09 17:35:30 +020063 struct ly_err_item *err = NULL;
Radek Krejci0b013302021-03-29 15:22:32 +020064 uint32_t options = (dynamic && *dynamic ? LYPLG_TYPE_STORE_DYNAMIC : 0);
Radek Krejci084289f2019-07-09 17:35:30 +020065
Michal Vasko62ed8652021-04-28 09:38:37 +020066 if (!value) {
67 value = "";
68 }
Michal Vaskofeca4fb2020-10-05 08:58:40 +020069 if (incomplete) {
70 *incomplete = 0;
Radek Krejci084289f2019-07-09 17:35:30 +020071 }
72
Michal Vasko405cc9e2020-12-01 12:01:27 +010073 ret = type->plugin->store(ctx, type, value, value_len, options, format, prefix_data, hints, ctx_node, val, NULL, &err);
Radek Iša96b2de12021-02-16 10:32:57 +010074 if (dynamic) {
75 *dynamic = 0;
76 }
77
Michal Vasko90932a92020-02-12 14:33:03 +010078 if (ret == LY_EINCOMPLETE) {
Michal Vaskofeca4fb2020-10-05 08:58:40 +020079 if (incomplete) {
80 *incomplete = 1;
81 }
82 } else if (ret) {
83 if (err) {
aPiecek4204b612021-05-03 09:06:16 +020084 LOGVAL_ERRITEM(ctx, err);
Michal Vaskofeca4fb2020-10-05 08:58:40 +020085 ly_err_free(err);
86 } else {
Radek Krejci2efc45b2020-12-22 16:25:44 +010087 LOGVAL(ctx, LYVE_OTHER, "Storing value \"%.*s\" failed.", (int)value_len, value);
Michal Vaskofeca4fb2020-10-05 08:58:40 +020088 }
89 return ret;
Michal Vasko90932a92020-02-12 14:33:03 +010090 }
91
Michal Vaskofeca4fb2020-10-05 08:58:40 +020092 return LY_SUCCESS;
Michal Vasko90932a92020-02-12 14:33:03 +010093}
94
Radek Krejci38d85362019-09-05 16:26:38 +020095LY_ERR
Michal Vaskofeca4fb2020-10-05 08:58:40 +020096lyd_value_validate_incomplete(const struct ly_ctx *ctx, const struct lysc_type *type, struct lyd_value *val,
Radek Krejci2efc45b2020-12-22 16:25:44 +010097 const struct lyd_node *ctx_node, const struct lyd_node *tree)
Radek Krejci38d85362019-09-05 16:26:38 +020098{
Michal Vaskofeca4fb2020-10-05 08:58:40 +020099 LY_ERR ret;
Radek Krejci38d85362019-09-05 16:26:38 +0200100 struct ly_err_item *err = NULL;
Radek Krejci38d85362019-09-05 16:26:38 +0200101
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200102 assert(type->plugin->validate);
Michal Vasko8d544252020-03-02 10:19:52 +0100103
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200104 ret = type->plugin->validate(ctx, type, ctx_node, tree, val, &err);
105 if (ret) {
Radek Krejci38d85362019-09-05 16:26:38 +0200106 if (err) {
aPiecek4204b612021-05-03 09:06:16 +0200107 LOGVAL_ERRITEM(ctx, err);
Radek Krejci38d85362019-09-05 16:26:38 +0200108 ly_err_free(err);
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200109 } else {
Radek Krejci6d5ba0c2021-04-26 07:49:59 +0200110 LOGVAL(ctx, LYVE_OTHER, "Resolving value \"%s\" failed.", type->plugin->print(ctx, val, LY_VALUE_CANON,
111 NULL, NULL, NULL));
Radek Krejci38d85362019-09-05 16:26:38 +0200112 }
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200113 return ret;
Radek Krejci38d85362019-09-05 16:26:38 +0200114 }
115
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200116 return LY_SUCCESS;
Radek Krejci38d85362019-09-05 16:26:38 +0200117}
118
Michal Vaskof937cfe2020-08-03 16:07:12 +0200119LY_ERR
Michal Vaskoaebbce02021-04-06 09:23:37 +0200120lys_value_validate(const struct ly_ctx *ctx, const struct lysc_node *node, const char *value, size_t value_len,
Radek Krejci8df109d2021-04-23 12:19:08 +0200121 LY_VALUE_FORMAT format, void *prefix_data)
Radek Krejci084289f2019-07-09 17:35:30 +0200122{
123 LY_ERR rc = LY_SUCCESS;
124 struct ly_err_item *err = NULL;
Michal Vaskoba99a3e2020-08-18 15:50:05 +0200125 struct lyd_value storage;
Radek Krejci084289f2019-07-09 17:35:30 +0200126 struct lysc_type *type;
Radek Krejci084289f2019-07-09 17:35:30 +0200127
128 LY_CHECK_ARG_RET(ctx, node, value, LY_EINVAL);
129
130 if (!(node->nodetype & (LYS_LEAF | LYS_LEAFLIST))) {
131 LOGARG(ctx, node);
132 return LY_EINVAL;
133 }
134
Michal Vasko22df3f02020-08-24 13:29:22 +0200135 type = ((struct lysc_node_leaf *)node)->type;
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200136 rc = type->plugin->store(ctx ? ctx : node->module->ctx, type, value, value_len, 0, format, prefix_data,
Michal Vasko405cc9e2020-12-01 12:01:27 +0100137 LYD_HINT_SCHEMA, node, &storage, NULL, &err);
Radek Krejci73dead22019-07-11 16:46:16 +0200138 if (rc == LY_EINCOMPLETE) {
139 /* actually success since we do not provide the context tree and call validation with
140 * LY_TYPE_OPTS_INCOMPLETE_DATA */
141 rc = LY_SUCCESS;
142 } else if (rc && err) {
143 if (ctx) {
144 /* log only in case the ctx was provided as input parameter */
Radek Krejciddace2c2021-01-08 11:30:56 +0100145 LOG_LOCSET(NULL, NULL, err->path, NULL);
aPiecek4204b612021-05-03 09:06:16 +0200146 LOGVAL_ERRITEM(ctx, err);
Radek Krejciddace2c2021-01-08 11:30:56 +0100147 LOG_LOCBACK(0, 0, 1, 0);
Radek Krejci084289f2019-07-09 17:35:30 +0200148 }
Radek Krejci73dead22019-07-11 16:46:16 +0200149 ly_err_free(err);
Radek Krejci084289f2019-07-09 17:35:30 +0200150 }
151
Michal Vaskoba99a3e2020-08-18 15:50:05 +0200152 if (!rc) {
153 type->plugin->free(ctx ? ctx : node->module->ctx, &storage);
154 }
Radek Krejci084289f2019-07-09 17:35:30 +0200155 return rc;
156}
157
158API LY_ERR
Michal Vaskoaebbce02021-04-06 09:23:37 +0200159lyd_value_validate(const struct ly_ctx *ctx, const struct lysc_node *schema, const char *value, size_t value_len,
160 const struct lyd_node *ctx_node, const struct lysc_type **realtype, const char **canonical)
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};
Radek Krejci09c77442021-04-26 11:10:34 +0200166 ly_bool stored = 0, log = 1;
Radek Krejci084289f2019-07-09 17:35:30 +0200167
Michal Vaskoaebbce02021-04-06 09:23:37 +0200168 LY_CHECK_ARG_RET(ctx, schema, value, LY_EINVAL);
Radek Krejci084289f2019-07-09 17:35:30 +0200169
Radek Krejci09c77442021-04-26 11:10:34 +0200170 if (!ctx) {
171 ctx = schema->module->ctx;
172 log = 0;
173 }
Michal Vaskoaebbce02021-04-06 09:23:37 +0200174 type = ((struct lysc_node_leaf *)schema)->type;
175
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200176 /* store */
Radek Krejci09c77442021-04-26 11:10:34 +0200177 rc = type->plugin->store(ctx, type, value, value_len, 0, LY_VALUE_JSON, NULL,
Michal Vaskoaebbce02021-04-06 09:23:37 +0200178 LYD_HINT_DATA, schema, &val, NULL, &err);
179 if (!rc || (rc == LY_EINCOMPLETE)) {
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200180 stored = 1;
Michal Vaskoaebbce02021-04-06 09:23:37 +0200181 }
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200182
Michal Vaskoaebbce02021-04-06 09:23:37 +0200183 if (ctx_node && (rc == LY_EINCOMPLETE)) {
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200184 /* resolve */
Radek Krejci09c77442021-04-26 11:10:34 +0200185 rc = type->plugin->validate(ctx, type, ctx_node, ctx_node, &val, &err);
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200186 }
187
Michal Vaskoaebbce02021-04-06 09:23:37 +0200188 if (rc && (rc != LY_EINCOMPLETE) && err) {
Radek Krejci09c77442021-04-26 11:10:34 +0200189 if (log) {
Michal Vaskoaebbce02021-04-06 09:23:37 +0200190 /* log error */
191 if (err->path) {
192 LOG_LOCSET(NULL, NULL, err->path, NULL);
193 } else if (ctx_node) {
194 LOG_LOCSET(NULL, ctx_node, NULL, NULL);
195 } else {
196 LOG_LOCSET(schema, NULL, NULL, NULL);
Radek Krejci084289f2019-07-09 17:35:30 +0200197 }
aPiecek4204b612021-05-03 09:06:16 +0200198 LOGVAL_ERRITEM(ctx, err);
Michal Vaskoaebbce02021-04-06 09:23:37 +0200199 if (err->path) {
200 LOG_LOCBACK(0, 0, 1, 0);
201 } else if (ctx_node) {
202 LOG_LOCBACK(0, 1, 0, 0);
203 } else {
204 LOG_LOCBACK(1, 0, 0, 0);
205 }
Radek Krejci084289f2019-07-09 17:35:30 +0200206 }
Michal Vaskoaebbce02021-04-06 09:23:37 +0200207 ly_err_free(err);
Radek Krejci084289f2019-07-09 17:35:30 +0200208 }
209
Michal Vaskoaebbce02021-04-06 09:23:37 +0200210 if (!rc || (rc == LY_EINCOMPLETE)) {
211 if (realtype) {
212 /* return realtype */
213 if (val.realtype->basetype == LY_TYPE_UNION) {
214 *realtype = val.subvalue->value.realtype;
215 } else {
216 *realtype = val.realtype;
217 }
218 }
219
220 if (canonical) {
221 /* return canonical value */
Radek Krejci6d5ba0c2021-04-26 07:49:59 +0200222 lydict_insert(ctx, val.realtype->plugin->print(ctx, &val, LY_VALUE_CANON, NULL, NULL, NULL), 0, canonical);
Michal Vasko29134f82020-11-13 18:03:20 +0100223 }
Michal Vasko3701af52020-08-03 14:29:38 +0200224 }
225
Michal Vaskoaebbce02021-04-06 09:23:37 +0200226 if (stored) {
227 /* free value */
228 type->plugin->free(ctx ? ctx : schema->module->ctx, &val);
229 }
230 return rc;
Radek Krejci084289f2019-07-09 17:35:30 +0200231}
232
233API LY_ERR
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200234lyd_value_compare(const struct lyd_node_term *node, const char *value, size_t value_len)
Radek Krejci084289f2019-07-09 17:35:30 +0200235{
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200236 LY_ERR ret = LY_SUCCESS;
Radek Krejci084289f2019-07-09 17:35:30 +0200237 struct ly_ctx *ctx;
238 struct lysc_type *type;
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200239 struct lyd_value val = {0};
Radek Krejci084289f2019-07-09 17:35:30 +0200240
241 LY_CHECK_ARG_RET(node ? node->schema->module->ctx : NULL, node, value, LY_EINVAL);
242
243 ctx = node->schema->module->ctx;
Michal Vasko22df3f02020-08-24 13:29:22 +0200244 type = ((struct lysc_node_leaf *)node->schema)->type;
Radek Krejci084289f2019-07-09 17:35:30 +0200245
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200246 /* store the value */
Michal Vasko9e685082021-01-29 14:49:09 +0100247 LOG_LOCSET(node->schema, &node->node, NULL, NULL);
Radek Krejci8df109d2021-04-23 12:19:08 +0200248 ret = lyd_value_store(ctx, &val, type, value, value_len, NULL, LY_VALUE_JSON, NULL, LYD_HINT_DATA, node->schema, NULL);
Radek Krejciddace2c2021-01-08 11:30:56 +0100249 LOG_LOCBACK(1, 1, 0, 0);
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200250 LY_CHECK_RET(ret);
Radek Krejci084289f2019-07-09 17:35:30 +0200251
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200252 /* compare values */
253 ret = type->plugin->compare(&node->value, &val);
Radek Krejci084289f2019-07-09 17:35:30 +0200254
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200255 type->plugin->free(ctx, &val);
Radek Krejci084289f2019-07-09 17:35:30 +0200256 return ret;
257}
258
Radek Krejci19611252020-10-04 13:54:53 +0200259API ly_bool
260lyd_is_default(const struct lyd_node *node)
261{
262 const struct lysc_node_leaf *leaf;
263 const struct lysc_node_leaflist *llist;
264 const struct lyd_node_term *term;
265 LY_ARRAY_COUNT_TYPE u;
266
Michal Vasko39eb6882021-09-16 08:53:13 +0200267 if (!(node->schema->nodetype & LYD_NODE_TERM)) {
268 return 0;
269 }
270
Radek Krejci19611252020-10-04 13:54:53 +0200271 term = (const struct lyd_node_term *)node;
272
273 if (node->schema->nodetype == LYS_LEAF) {
274 leaf = (const struct lysc_node_leaf *)node->schema;
275 if (!leaf->dflt) {
276 return 0;
277 }
278
279 /* compare with the default value */
Michal Vasko39eb6882021-09-16 08:53:13 +0200280 if (!leaf->type->plugin->compare(&term->value, leaf->dflt)) {
281 return 1;
Radek Krejci19611252020-10-04 13:54:53 +0200282 }
283 } else {
284 llist = (const struct lysc_node_leaflist *)node->schema;
285 if (!llist->dflts) {
286 return 0;
287 }
288
289 LY_ARRAY_FOR(llist->dflts, u) {
290 /* compare with each possible default value */
Michal Vasko39eb6882021-09-16 08:53:13 +0200291 if (!llist->type->plugin->compare(&term->value, llist->dflts[u])) {
292 return 1;
Radek Krejci19611252020-10-04 13:54:53 +0200293 }
294 }
295 }
296
Michal Vasko39eb6882021-09-16 08:53:13 +0200297 return 0;
Radek Krejci19611252020-10-04 13:54:53 +0200298}
299
Radek Krejci7931b192020-06-25 17:05:03 +0200300static LYD_FORMAT
Michal Vasko63f3d842020-07-08 10:10:14 +0200301lyd_parse_get_format(const struct ly_in *in, LYD_FORMAT format)
Radek Krejcie7b95092019-05-15 11:03:07 +0200302{
Michal Vasko69730152020-10-09 16:30:07 +0200303 if (!format && (in->type == LY_IN_FILEPATH)) {
Radek Krejcie7b95092019-05-15 11:03:07 +0200304 /* unknown format - try to detect it from filename's suffix */
Radek Krejci7931b192020-06-25 17:05:03 +0200305 const char *path = in->method.fpath.filepath;
306 size_t len = strlen(path);
Radek Krejcie7b95092019-05-15 11:03:07 +0200307
308 /* ignore trailing whitespaces */
Michal Vaskod989ba02020-08-24 10:59:24 +0200309 for ( ; len > 0 && isspace(path[len - 1]); len--) {}
Radek Krejcie7b95092019-05-15 11:03:07 +0200310
Radek Krejcif13b87b2020-12-01 22:02:17 +0100311 if ((len >= LY_XML_SUFFIX_LEN + 1) &&
312 !strncmp(&path[len - LY_XML_SUFFIX_LEN], LY_XML_SUFFIX, LY_XML_SUFFIX_LEN)) {
Radek Krejcie7b95092019-05-15 11:03:07 +0200313 format = LYD_XML;
Radek Krejcif13b87b2020-12-01 22:02:17 +0100314 } else if ((len >= LY_JSON_SUFFIX_LEN + 1) &&
315 !strncmp(&path[len - LY_JSON_SUFFIX_LEN], LY_JSON_SUFFIX, LY_JSON_SUFFIX_LEN)) {
Radek Krejcie7b95092019-05-15 11:03:07 +0200316 format = LYD_JSON;
Radek Krejcif13b87b2020-12-01 22:02:17 +0100317 } else if ((len >= LY_LYB_SUFFIX_LEN + 1) &&
318 !strncmp(&path[len - LY_LYB_SUFFIX_LEN], LY_LYB_SUFFIX, LY_LYB_SUFFIX_LEN)) {
Radek Krejcie7b95092019-05-15 11:03:07 +0200319 format = LYD_LYB;
Radek Krejci7931b192020-06-25 17:05:03 +0200320 } /* else still unknown */
Radek Krejcie7b95092019-05-15 11:03:07 +0200321 }
322
Radek Krejci7931b192020-06-25 17:05:03 +0200323 return format;
324}
Radek Krejcie7b95092019-05-15 11:03:07 +0200325
Michal Vaskoe0665742021-02-11 11:08:44 +0100326/**
327 * @brief Parse YANG data into a data tree.
328 *
329 * @param[in] ctx libyang context.
Radek Krejcif16e2542021-02-17 15:39:23 +0100330 * @param[in] ext Optional extenion instance to parse data following the schema tree specified in the extension instance
Michal Vaskoe0665742021-02-11 11:08:44 +0100331 * @param[in] parent Parent to connect the parsed nodes to, if any.
332 * @param[in,out] first_p Pointer to the first top-level parsed node, used only if @p parent is NULL.
333 * @param[in] in Input handle to read the input from.
334 * @param[in] format Expected format of the data in @p in.
335 * @param[in] parse_opts Options for parser.
336 * @param[in] val_opts Options for validation.
337 * @param[out] op Optional pointer to the parsed operation, if any.
338 * @return LY_ERR value.
339 */
340static LY_ERR
Radek Krejcif16e2542021-02-17 15:39:23 +0100341lyd_parse(const struct ly_ctx *ctx, const struct lysc_ext_instance *ext, struct lyd_node *parent, struct lyd_node **first_p,
342 struct ly_in *in, LYD_FORMAT format, uint32_t parse_opts, uint32_t val_opts, struct lyd_node **op)
Radek Krejci7931b192020-06-25 17:05:03 +0200343{
Michal Vaskoe0665742021-02-11 11:08:44 +0100344 LY_ERR rc = LY_SUCCESS;
Radek Krejci1798aae2020-07-14 13:26:06 +0200345 struct lyd_ctx *lydctx = NULL;
Michal Vaskoe0665742021-02-11 11:08:44 +0100346 struct ly_set parsed = {0};
347 struct lyd_node *first;
348 uint32_t i;
Radek Krejci1798aae2020-07-14 13:26:06 +0200349
Michal Vaskoe0665742021-02-11 11:08:44 +0100350 assert(ctx && (parent || first_p));
Radek Krejci7931b192020-06-25 17:05:03 +0200351
352 format = lyd_parse_get_format(in, format);
Michal Vaskoe0665742021-02-11 11:08:44 +0100353 if (first_p) {
354 *first_p = NULL;
355 }
Radek Krejci1798aae2020-07-14 13:26:06 +0200356
Michal Vasko63f3d842020-07-08 10:10:14 +0200357 /* remember input position */
358 in->func_start = in->current;
Radek Krejci7931b192020-06-25 17:05:03 +0200359
Michal Vaskoe0665742021-02-11 11:08:44 +0100360 /* parse the data */
Radek Krejci7931b192020-06-25 17:05:03 +0200361 switch (format) {
362 case LYD_XML:
Radek Krejcif16e2542021-02-17 15:39:23 +0100363 rc = lyd_parse_xml(ctx, ext, parent, first_p, in, parse_opts, val_opts, LYD_TYPE_DATA_YANG, NULL, &parsed, &lydctx);
Radek Krejci1798aae2020-07-14 13:26:06 +0200364 break;
Radek Krejci7931b192020-06-25 17:05:03 +0200365 case LYD_JSON:
Radek Krejcif16e2542021-02-17 15:39:23 +0100366 rc = lyd_parse_json(ctx, ext, parent, first_p, in, parse_opts, val_opts, LYD_TYPE_DATA_YANG, &parsed, &lydctx);
Radek Krejci1798aae2020-07-14 13:26:06 +0200367 break;
Radek Krejci7931b192020-06-25 17:05:03 +0200368 case LYD_LYB:
Radek Krejcif16e2542021-02-17 15:39:23 +0100369 rc = lyd_parse_lyb(ctx, ext, parent, first_p, in, parse_opts, val_opts, LYD_TYPE_DATA_YANG, &parsed, &lydctx);
Radek Krejci1798aae2020-07-14 13:26:06 +0200370 break;
Michal Vaskoc8a230d2020-08-14 12:17:10 +0200371 case LYD_UNKNOWN:
Michal Vaskod74978f2021-02-12 11:59:36 +0100372 LOGARG(ctx, format);
373 rc = LY_EINVAL;
Michal Vaskoe0665742021-02-11 11:08:44 +0100374 break;
375 }
376 LY_CHECK_GOTO(rc, cleanup);
377
378 if (parent) {
379 /* get first top-level sibling */
380 for (first = parent; first->parent; first = lyd_parent(first)) {}
381 first = lyd_first_sibling(first);
382 first_p = &first;
Radek Krejci7931b192020-06-25 17:05:03 +0200383 }
384
Michal Vaskoe0665742021-02-11 11:08:44 +0100385 if (!(parse_opts & LYD_PARSE_ONLY)) {
386 /* validate data */
Radek Krejci4f2e3e52021-03-30 14:20:28 +0200387 rc = lyd_validate(first_p, NULL, ctx, val_opts, 0, &lydctx->node_when, &lydctx->node_exts, &lydctx->node_types,
Michal Vaskoe0665742021-02-11 11:08:44 +0100388 &lydctx->meta_types, NULL);
389 LY_CHECK_GOTO(rc, cleanup);
390 }
Radek Krejci7931b192020-06-25 17:05:03 +0200391
Michal Vaskoe0665742021-02-11 11:08:44 +0100392 /* set the operation node */
393 if (op) {
394 *op = lydctx->op_node;
Radek Krejci1798aae2020-07-14 13:26:06 +0200395 }
396
397cleanup:
Michal Vaskoe0665742021-02-11 11:08:44 +0100398 if (lydctx) {
399 lydctx->free(lydctx);
Radek Krejci1798aae2020-07-14 13:26:06 +0200400 }
Michal Vaskoe0665742021-02-11 11:08:44 +0100401 if (rc) {
402 if (parent) {
403 /* free all the parsed subtrees */
404 for (i = 0; i < parsed.count; ++i) {
405 lyd_free_tree(parsed.dnodes[i]);
406 }
407 } else {
408 /* free everything */
409 lyd_free_all(*first_p);
410 *first_p = NULL;
411 }
412 }
413 ly_set_erase(&parsed, NULL);
414 return rc;
Radek Krejci7931b192020-06-25 17:05:03 +0200415}
416
417API LY_ERR
Radek Krejcif16e2542021-02-17 15:39:23 +0100418lyd_parse_ext_data(const struct lysc_ext_instance *ext, struct lyd_node *parent, struct ly_in *in, LYD_FORMAT format,
419 uint32_t parse_options, uint32_t validate_options, struct lyd_node **tree)
420{
421 const struct ly_ctx *ctx = ext ? ext->module->ctx : NULL;
422
423 LY_CHECK_ARG_RET(ctx, ext, in, parent || tree, LY_EINVAL);
424 LY_CHECK_ARG_RET(ctx, !(parse_options & ~LYD_PARSE_OPTS_MASK), LY_EINVAL);
425 LY_CHECK_ARG_RET(ctx, !(validate_options & ~LYD_VALIDATE_OPTS_MASK), LY_EINVAL);
426
427 return lyd_parse(ctx, ext, parent, tree, in, format, parse_options, validate_options, NULL);
428}
429
430API LY_ERR
Michal Vaskoe0665742021-02-11 11:08:44 +0100431lyd_parse_data(const struct ly_ctx *ctx, struct lyd_node *parent, struct ly_in *in, LYD_FORMAT format,
432 uint32_t parse_options, uint32_t validate_options, struct lyd_node **tree)
433{
434 LY_CHECK_ARG_RET(ctx, ctx, in, parent || tree, LY_EINVAL);
435 LY_CHECK_ARG_RET(ctx, !(parse_options & ~LYD_PARSE_OPTS_MASK), LY_EINVAL);
436 LY_CHECK_ARG_RET(ctx, !(validate_options & ~LYD_VALIDATE_OPTS_MASK), LY_EINVAL);
437
Radek Krejcif16e2542021-02-17 15:39:23 +0100438 return lyd_parse(ctx, NULL, parent, tree, in, format, parse_options, validate_options, NULL);
Michal Vaskoe0665742021-02-11 11:08:44 +0100439}
440
441API LY_ERR
442lyd_parse_data_mem(const struct ly_ctx *ctx, const char *data, LYD_FORMAT format, uint32_t parse_options,
443 uint32_t validate_options, struct lyd_node **tree)
Radek Krejci7931b192020-06-25 17:05:03 +0200444{
445 LY_ERR ret;
446 struct ly_in *in;
447
448 LY_CHECK_RET(ly_in_new_memory(data, &in));
Michal Vaskoe0665742021-02-11 11:08:44 +0100449 ret = lyd_parse_data(ctx, NULL, in, format, parse_options, validate_options, tree);
Radek Krejci7931b192020-06-25 17:05:03 +0200450
451 ly_in_free(in, 0);
452 return ret;
453}
454
455API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +0200456lyd_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 +0200457 struct lyd_node **tree)
Radek Krejci7931b192020-06-25 17:05:03 +0200458{
459 LY_ERR ret;
460 struct ly_in *in;
461
462 LY_CHECK_RET(ly_in_new_fd(fd, &in));
Michal Vaskoe0665742021-02-11 11:08:44 +0100463 ret = lyd_parse_data(ctx, NULL, in, format, parse_options, validate_options, tree);
Radek Krejci7931b192020-06-25 17:05:03 +0200464
465 ly_in_free(in, 0);
466 return ret;
467}
468
469API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +0200470lyd_parse_data_path(const struct ly_ctx *ctx, const char *path, LYD_FORMAT format, uint32_t parse_options,
471 uint32_t validate_options, struct lyd_node **tree)
Radek Krejci7931b192020-06-25 17:05:03 +0200472{
473 LY_ERR ret;
474 struct ly_in *in;
475
476 LY_CHECK_RET(ly_in_new_filepath(path, 0, &in));
Michal Vaskoe0665742021-02-11 11:08:44 +0100477 ret = lyd_parse_data(ctx, NULL, in, format, parse_options, validate_options, tree);
Radek Krejci7931b192020-06-25 17:05:03 +0200478
479 ly_in_free(in, 0);
480 return ret;
481}
482
Radek Krejcif16e2542021-02-17 15:39:23 +0100483/**
484 * @brief Parse YANG data into an operation data tree, in case the extension instance is specified, keep the searching
485 * for schema nodes locked inside the extension instance.
486 *
487 * At least one of @p parent, @p tree, or @p op must always be set.
488 *
489 * Specific @p data_type values have different parameter meaning as follows:
490 * - ::LYD_TYPE_RPC_NETCONF:
491 * - @p parent - must be NULL, the whole RPC is expected;
492 * - @p format - must be ::LYD_XML, NETCONF supports only this format;
493 * - @p tree - must be provided, all the NETCONF-specific XML envelopes will be returned here as
494 * a separate opaque data tree, even if the function fails, this may be returned;
495 * - @p op - must be provided, the RPC/action data tree itself will be returned here, pointing to the operation;
496 *
497 * - ::LYD_TYPE_NOTIF_NETCONF:
498 * - @p parent - must be NULL, the whole notification is expected;
499 * - @p format - must be ::LYD_XML, NETCONF supports only this format;
500 * - @p tree - must be provided, all the NETCONF-specific XML envelopes will be returned here as
501 * a separate opaque data tree, even if the function fails, this may be returned;
502 * - @p op - must be provided, the notification data tree itself will be returned here, pointing to the operation;
503 *
504 * - ::LYD_TYPE_REPLY_NETCONF:
505 * - @p parent - must be set, pointing to the invoked RPC operation (RPC or action) node;
506 * - @p format - must be ::LYD_XML, NETCONF supports only this format;
507 * - @p tree - must be provided, all the NETCONF-specific XML envelopes will be returned here as
508 * a separate opaque data tree, even if the function fails, this may be returned;
509 * - @p op - must be NULL, the reply is appended to the RPC;
510 * Note that there are 3 kinds of NETCONF replies - ok, error, and data. Only data reply appends any nodes to the RPC.
511 *
512 * @param[in] ctx libyang context.
513 * @param[in] ext Extension instance providing the specific schema tree to match with the data being parsed.
514 * @param[in] parent Optional parent to connect the parsed nodes to.
515 * @param[in] in Input handle to read the input from.
516 * @param[in] format Expected format of the data in @p in.
517 * @param[in] data_type Expected operation to parse (@ref datatype).
518 * @param[out] tree Optional full parsed data tree. If @p parent is set, set to NULL.
519 * @param[out] op Optional parsed operation node.
520 * @return LY_ERR value.
521 * @return LY_ENOT if @p data_type is a NETCONF message and the root XML element is not the expected one.
522 */
523static LY_ERR
524lyd_parse_op_(const struct ly_ctx *ctx, const struct lysc_ext_instance *ext, struct lyd_node *parent,
525 struct ly_in *in, LYD_FORMAT format, enum lyd_type data_type, struct lyd_node **tree, struct lyd_node **op)
Radek Krejci7931b192020-06-25 17:05:03 +0200526{
Michal Vaskoe0665742021-02-11 11:08:44 +0100527 LY_ERR rc = LY_SUCCESS;
528 struct lyd_ctx *lydctx = NULL;
529 struct ly_set parsed = {0};
530 struct lyd_node *first = NULL, *envp = NULL;
531 uint32_t i, parse_opts, val_opts;
Radek Krejci7931b192020-06-25 17:05:03 +0200532
Michal Vasko27fb0262021-02-23 09:42:01 +0100533 if (!ctx) {
534 ctx = LYD_CTX(parent);
535 }
Radek Krejci1798aae2020-07-14 13:26:06 +0200536 if (tree) {
537 *tree = NULL;
538 }
539 if (op) {
540 *op = NULL;
541 }
542
Radek Krejci7931b192020-06-25 17:05:03 +0200543 format = lyd_parse_get_format(in, format);
Radek Krejci7931b192020-06-25 17:05:03 +0200544
Michal Vasko63f3d842020-07-08 10:10:14 +0200545 /* remember input position */
546 in->func_start = in->current;
547
Michal Vaskoe0665742021-02-11 11:08:44 +0100548 /* check params based on the data type */
Michal Vasko1e4c68e2021-02-18 15:03:01 +0100549 if ((data_type == LYD_TYPE_RPC_NETCONF) || (data_type == LYD_TYPE_NOTIF_NETCONF)) {
Michal Vaskoe0665742021-02-11 11:08:44 +0100550 LY_CHECK_ARG_RET(ctx, format == LYD_XML, !parent, tree, op, LY_EINVAL);
Michal Vasko1e4c68e2021-02-18 15:03:01 +0100551 } else if (data_type == LYD_TYPE_REPLY_NETCONF) {
552 LY_CHECK_ARG_RET(ctx, format == LYD_XML, parent, parent->schema->nodetype & (LYS_RPC | LYS_ACTION), tree, !op,
553 LY_EINVAL);
Michal Vaskoe0665742021-02-11 11:08:44 +0100554 }
Michal Vasko9da78cf2021-07-21 13:45:10 +0200555 parse_opts = LYD_PARSE_ONLY | LYD_PARSE_OPAQ;
Michal Vaskoe0665742021-02-11 11:08:44 +0100556 val_opts = 0;
557
558 /* parse the data */
Radek Krejci7931b192020-06-25 17:05:03 +0200559 switch (format) {
560 case LYD_XML:
Radek Krejcif16e2542021-02-17 15:39:23 +0100561 rc = lyd_parse_xml(ctx, ext, parent, &first, in, parse_opts, val_opts, data_type, &envp, &parsed, &lydctx);
Michal Vasko299d5d12021-02-16 16:36:37 +0100562 if (rc && envp) {
563 /* special situation when the envelopes were parsed successfully */
564 if (tree) {
565 *tree = envp;
566 }
567 ly_set_erase(&parsed, NULL);
568 return rc;
569 }
Michal Vaskoe0665742021-02-11 11:08:44 +0100570 break;
Radek Krejci7931b192020-06-25 17:05:03 +0200571 case LYD_JSON:
Radek Krejcif16e2542021-02-17 15:39:23 +0100572 rc = lyd_parse_json(ctx, ext, parent, &first, in, parse_opts, val_opts, data_type, &parsed, &lydctx);
Michal Vaskoe0665742021-02-11 11:08:44 +0100573 break;
Radek Krejci7931b192020-06-25 17:05:03 +0200574 case LYD_LYB:
Radek Krejcif16e2542021-02-17 15:39:23 +0100575 rc = lyd_parse_lyb(ctx, ext, parent, &first, in, parse_opts, val_opts, data_type, &parsed, &lydctx);
Michal Vaskoe0665742021-02-11 11:08:44 +0100576 break;
Michal Vaskoc8a230d2020-08-14 12:17:10 +0200577 case LYD_UNKNOWN:
Michal Vaskod74978f2021-02-12 11:59:36 +0100578 LOGARG(ctx, format);
579 rc = LY_EINVAL;
Michal Vaskoc8a230d2020-08-14 12:17:10 +0200580 break;
Radek Krejci7931b192020-06-25 17:05:03 +0200581 }
Michal Vaskoe0665742021-02-11 11:08:44 +0100582 LY_CHECK_GOTO(rc, cleanup);
Radek Krejci7931b192020-06-25 17:05:03 +0200583
Michal Vaskoe0665742021-02-11 11:08:44 +0100584 /* set out params correctly */
585 if (tree) {
586 if (envp) {
587 /* special out param meaning */
588 *tree = envp;
589 } else {
590 *tree = parent ? NULL : first;
591 }
592 }
593 if (op) {
594 *op = lydctx->op_node;
595 }
596
597cleanup:
598 if (lydctx) {
599 lydctx->free(lydctx);
600 }
601 if (rc) {
602 if (parent) {
603 /* free all the parsed subtrees */
604 for (i = 0; i < parsed.count; ++i) {
605 lyd_free_tree(parsed.dnodes[i]);
606 }
607 } else {
608 /* free everything (cannot occur in the current code, a safety) */
609 lyd_free_all(first);
610 if (tree) {
611 *tree = NULL;
612 }
613 if (op) {
614 *op = NULL;
615 }
616 }
617 }
618 ly_set_erase(&parsed, NULL);
619 return rc;
Radek Krejcie7b95092019-05-15 11:03:07 +0200620}
Radek Krejci084289f2019-07-09 17:35:30 +0200621
Radek Krejcif16e2542021-02-17 15:39:23 +0100622API LY_ERR
623lyd_parse_op(const struct ly_ctx *ctx, struct lyd_node *parent, struct ly_in *in, LYD_FORMAT format,
624 enum lyd_type data_type, struct lyd_node **tree, struct lyd_node **op)
625{
626 LY_CHECK_ARG_RET(ctx, ctx || parent, in, data_type, parent || tree || op, LY_EINVAL);
627
628 return lyd_parse_op_(ctx, NULL, parent, in, format, data_type, tree, op);
629}
630
631API LY_ERR
632lyd_parse_ext_op(const struct lysc_ext_instance *ext, struct lyd_node *parent, struct ly_in *in, LYD_FORMAT format,
633 enum lyd_type data_type, struct lyd_node **tree, struct lyd_node **op)
634{
635 const struct ly_ctx *ctx = ext ? ext->module->ctx : NULL;
636
637 LY_CHECK_ARG_RET(ctx, ext, in, data_type, parent || tree || op, LY_EINVAL);
638
639 return lyd_parse_op_(ctx, ext, parent, in, format, data_type, tree, op);
640}
641
Michal Vasko90932a92020-02-12 14:33:03 +0100642LY_ERR
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200643lyd_create_term(const struct lysc_node *schema, const char *value, size_t value_len, ly_bool *dynamic,
Radek Krejci8df109d2021-04-23 12:19:08 +0200644 LY_VALUE_FORMAT format, void *prefix_data, uint32_t hints, ly_bool *incomplete, struct lyd_node **node)
Michal Vasko90932a92020-02-12 14:33:03 +0100645{
646 LY_ERR ret;
647 struct lyd_node_term *term;
648
Michal Vasko9b368d32020-02-14 13:53:31 +0100649 assert(schema->nodetype & LYD_NODE_TERM);
650
Michal Vasko90932a92020-02-12 14:33:03 +0100651 term = calloc(1, sizeof *term);
652 LY_CHECK_ERR_RET(!term, LOGMEM(schema->module->ctx), LY_EMEM);
653
654 term->schema = schema;
Michal Vasko9e685082021-01-29 14:49:09 +0100655 term->prev = &term->node;
Michal Vasko9b368d32020-02-14 13:53:31 +0100656 term->flags = LYD_NEW;
Michal Vasko90932a92020-02-12 14:33:03 +0100657
Radek Krejciddace2c2021-01-08 11:30:56 +0100658 LOG_LOCSET(schema, NULL, NULL, NULL);
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200659 ret = lyd_value_store(schema->module->ctx, &term->value, ((struct lysc_node_leaf *)term->schema)->type, value,
Radek Krejci2efc45b2020-12-22 16:25:44 +0100660 value_len, dynamic, format, prefix_data, hints, schema, incomplete);
Radek Krejciddace2c2021-01-08 11:30:56 +0100661 LOG_LOCBACK(1, 0, 0, 0);
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200662 LY_CHECK_ERR_RET(ret, free(term), ret);
Michal Vasko9e685082021-01-29 14:49:09 +0100663 lyd_hash(&term->node);
Michal Vasko9b368d32020-02-14 13:53:31 +0100664
Michal Vasko9e685082021-01-29 14:49:09 +0100665 *node = &term->node;
Michal Vasko9b368d32020-02-14 13:53:31 +0100666 return ret;
667}
668
669LY_ERR
670lyd_create_term2(const struct lysc_node *schema, const struct lyd_value *val, struct lyd_node **node)
671{
672 LY_ERR ret;
673 struct lyd_node_term *term;
674 struct lysc_type *type;
675
676 assert(schema->nodetype & LYD_NODE_TERM);
Radek Krejci224d4b42021-04-23 13:54:59 +0200677 assert(val && val->realtype);
Michal Vasko9b368d32020-02-14 13:53:31 +0100678
679 term = calloc(1, sizeof *term);
680 LY_CHECK_ERR_RET(!term, LOGMEM(schema->module->ctx), LY_EMEM);
681
682 term->schema = schema;
Michal Vasko9e685082021-01-29 14:49:09 +0100683 term->prev = &term->node;
Michal Vasko9b368d32020-02-14 13:53:31 +0100684 term->flags = LYD_NEW;
685
686 type = ((struct lysc_node_leaf *)schema)->type;
687 ret = type->plugin->duplicate(schema->module->ctx, val, &term->value);
688 if (ret) {
689 LOGERR(schema->module->ctx, ret, "Value duplication failed.");
690 free(term);
691 return ret;
692 }
Michal Vasko9e685082021-01-29 14:49:09 +0100693 lyd_hash(&term->node);
Michal Vasko90932a92020-02-12 14:33:03 +0100694
Michal Vasko9e685082021-01-29 14:49:09 +0100695 *node = &term->node;
Michal Vasko90932a92020-02-12 14:33:03 +0100696 return ret;
697}
698
699LY_ERR
700lyd_create_inner(const struct lysc_node *schema, struct lyd_node **node)
701{
702 struct lyd_node_inner *in;
703
Michal Vasko9b368d32020-02-14 13:53:31 +0100704 assert(schema->nodetype & LYD_NODE_INNER);
705
Michal Vasko90932a92020-02-12 14:33:03 +0100706 in = calloc(1, sizeof *in);
707 LY_CHECK_ERR_RET(!in, LOGMEM(schema->module->ctx), LY_EMEM);
708
709 in->schema = schema;
Michal Vasko9e685082021-01-29 14:49:09 +0100710 in->prev = &in->node;
Michal Vasko9b368d32020-02-14 13:53:31 +0100711 in->flags = LYD_NEW;
Michal Vasko3383be72020-11-03 17:15:31 +0100712 if ((schema->nodetype == LYS_CONTAINER) && !(schema->flags & LYS_PRESENCE)) {
713 in->flags |= LYD_DEFAULT;
714 }
Michal Vasko90932a92020-02-12 14:33:03 +0100715
Michal Vasko9b368d32020-02-14 13:53:31 +0100716 /* do not hash list with keys, we need them for the hash */
717 if ((schema->nodetype != LYS_LIST) || (schema->flags & LYS_KEYLESS)) {
Michal Vasko9e685082021-01-29 14:49:09 +0100718 lyd_hash(&in->node);
Michal Vasko9b368d32020-02-14 13:53:31 +0100719 }
Michal Vasko90932a92020-02-12 14:33:03 +0100720
Michal Vasko9e685082021-01-29 14:49:09 +0100721 *node = &in->node;
Michal Vasko90932a92020-02-12 14:33:03 +0100722 return LY_SUCCESS;
723}
724
Michal Vasko90932a92020-02-12 14:33:03 +0100725LY_ERR
Michal Vasko004d3152020-06-11 19:59:22 +0200726lyd_create_list(const struct lysc_node *schema, const struct ly_path_predicate *predicates, struct lyd_node **node)
Michal Vasko90932a92020-02-12 14:33:03 +0100727{
728 LY_ERR ret = LY_SUCCESS;
Michal Vasko90932a92020-02-12 14:33:03 +0100729 struct lyd_node *list = NULL, *key;
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200730 LY_ARRAY_COUNT_TYPE u;
Michal Vasko90932a92020-02-12 14:33:03 +0100731
Michal Vasko004d3152020-06-11 19:59:22 +0200732 assert((schema->nodetype == LYS_LIST) && !(schema->flags & LYS_KEYLESS));
Michal Vasko90932a92020-02-12 14:33:03 +0100733
734 /* create list */
735 LY_CHECK_GOTO(ret = lyd_create_inner(schema, &list), cleanup);
736
Radek Krejciddace2c2021-01-08 11:30:56 +0100737 LOG_LOCSET(NULL, list, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100738
Michal Vasko90932a92020-02-12 14:33:03 +0100739 /* create and insert all the keys */
Michal Vasko004d3152020-06-11 19:59:22 +0200740 LY_ARRAY_FOR(predicates, u) {
741 LY_CHECK_GOTO(ret = lyd_create_term2(predicates[u].key, &predicates[u].value, &key), cleanup);
Michal Vasko6ee6f432021-07-16 09:49:14 +0200742 lyd_insert_node(list, NULL, key, 0);
Michal Vasko90932a92020-02-12 14:33:03 +0100743 }
744
Michal Vasko9b368d32020-02-14 13:53:31 +0100745 /* hash having all the keys */
746 lyd_hash(list);
747
Michal Vasko90932a92020-02-12 14:33:03 +0100748 /* success */
749 *node = list;
750 list = NULL;
751
752cleanup:
Radek Krejciddace2c2021-01-08 11:30:56 +0100753 LOG_LOCBACK(0, 1, 0, 0);
Michal Vasko90932a92020-02-12 14:33:03 +0100754 lyd_free_tree(list);
Michal Vasko004d3152020-06-11 19:59:22 +0200755 return ret;
756}
757
758static LY_ERR
759lyd_create_list2(const struct lysc_node *schema, const char *keys, size_t keys_len, struct lyd_node **node)
760{
761 LY_ERR ret = LY_SUCCESS;
762 struct lyxp_expr *expr = NULL;
763 uint16_t exp_idx = 0;
764 enum ly_path_pred_type pred_type = 0;
765 struct ly_path_predicate *predicates = NULL;
766
Radek Krejciddace2c2021-01-08 11:30:56 +0100767 LOG_LOCSET(schema, NULL, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100768
Michal Vasko004d3152020-06-11 19:59:22 +0200769 /* parse keys */
Michal Vasko6b26e742020-07-17 15:02:10 +0200770 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 +0200771 LY_PATH_PRED_KEYS, &expr), cleanup);
Michal Vasko004d3152020-06-11 19:59:22 +0200772
773 /* compile them */
Radek Krejci8df109d2021-04-23 12:19:08 +0200774 LY_CHECK_GOTO(ret = ly_path_compile_predicate(schema->module->ctx, NULL, NULL, schema, expr, &exp_idx, LY_VALUE_JSON,
Michal Vasko5d24f6c2020-10-13 13:49:06 +0200775 NULL, &predicates, &pred_type), cleanup);
Michal Vasko004d3152020-06-11 19:59:22 +0200776
777 /* create the list node */
778 LY_CHECK_GOTO(ret = lyd_create_list(schema, predicates, node), cleanup);
779
780cleanup:
Radek Krejciddace2c2021-01-08 11:30:56 +0100781 LOG_LOCBACK(1, 0, 0, 0);
Michal Vasko004d3152020-06-11 19:59:22 +0200782 lyxp_expr_free(schema->module->ctx, expr);
Michal Vaskof7e16e22020-10-21 09:24:39 +0200783 ly_path_predicates_free(schema->module->ctx, pred_type, predicates);
Michal Vasko90932a92020-02-12 14:33:03 +0100784 return ret;
785}
786
787LY_ERR
Michal Vasko366a4a12020-12-04 16:23:57 +0100788lyd_create_any(const struct lysc_node *schema, const void *value, LYD_ANYDATA_VALUETYPE value_type, ly_bool use_value,
789 struct lyd_node **node)
Michal Vasko90932a92020-02-12 14:33:03 +0100790{
Michal Vasko366a4a12020-12-04 16:23:57 +0100791 LY_ERR ret;
Michal Vasko90932a92020-02-12 14:33:03 +0100792 struct lyd_node_any *any;
Michal Vasko366a4a12020-12-04 16:23:57 +0100793 union lyd_any_value any_val;
Michal Vasko90932a92020-02-12 14:33:03 +0100794
Michal Vasko9b368d32020-02-14 13:53:31 +0100795 assert(schema->nodetype & LYD_NODE_ANY);
796
Michal Vasko90932a92020-02-12 14:33:03 +0100797 any = calloc(1, sizeof *any);
798 LY_CHECK_ERR_RET(!any, LOGMEM(schema->module->ctx), LY_EMEM);
799
800 any->schema = schema;
Michal Vasko9e685082021-01-29 14:49:09 +0100801 any->prev = &any->node;
Michal Vasko9b368d32020-02-14 13:53:31 +0100802 any->flags = LYD_NEW;
Michal Vasko90932a92020-02-12 14:33:03 +0100803
Radek Krejci1798aae2020-07-14 13:26:06 +0200804 /* TODO: convert XML/JSON strings into a opaq data tree */
Michal Vasko366a4a12020-12-04 16:23:57 +0100805
806 if (use_value) {
807 any->value.str = value;
808 any->value_type = value_type;
809 } else {
810 any_val.str = value;
Michal Vasko9e685082021-01-29 14:49:09 +0100811 ret = lyd_any_copy_value(&any->node, &any_val, value_type);
Michal Vasko366a4a12020-12-04 16:23:57 +0100812 LY_CHECK_ERR_RET(ret, free(any), ret);
813 }
Michal Vasko9e685082021-01-29 14:49:09 +0100814 lyd_hash(&any->node);
Michal Vasko90932a92020-02-12 14:33:03 +0100815
Michal Vasko9e685082021-01-29 14:49:09 +0100816 *node = &any->node;
Michal Vasko90932a92020-02-12 14:33:03 +0100817 return LY_SUCCESS;
818}
819
Michal Vasko52927e22020-03-16 17:26:14 +0100820LY_ERR
Michal Vasko501af032020-11-11 20:27:44 +0100821lyd_create_opaq(const struct ly_ctx *ctx, const char *name, size_t name_len, const char *prefix, size_t pref_len,
822 const char *module_key, size_t module_key_len, const char *value, size_t value_len, ly_bool *dynamic,
Radek Krejci8df109d2021-04-23 12:19:08 +0200823 LY_VALUE_FORMAT format, void *val_prefix_data, uint32_t hints, struct lyd_node **node)
Michal Vasko52927e22020-03-16 17:26:14 +0100824{
Radek Krejci011e4aa2020-09-04 15:22:31 +0200825 LY_ERR ret = LY_SUCCESS;
Michal Vasko52927e22020-03-16 17:26:14 +0100826 struct lyd_node_opaq *opaq;
827
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200828 assert(ctx && name && name_len && format);
Michal Vasko52927e22020-03-16 17:26:14 +0100829
Michal Vasko4cd0a602021-05-31 11:11:58 +0200830 if (!value_len && (!dynamic || !*dynamic)) {
Michal Vasko52927e22020-03-16 17:26:14 +0100831 value = "";
832 }
833
834 opaq = calloc(1, sizeof *opaq);
Michal Vasko501af032020-11-11 20:27:44 +0100835 LY_CHECK_ERR_GOTO(!opaq, LOGMEM(ctx); ret = LY_EMEM, finish);
Michal Vasko52927e22020-03-16 17:26:14 +0100836
Michal Vasko9e685082021-01-29 14:49:09 +0100837 opaq->prev = &opaq->node;
Michal Vaskoad92b672020-11-12 13:11:31 +0100838 LY_CHECK_GOTO(ret = lydict_insert(ctx, name, name_len, &opaq->name.name), finish);
Radek Krejci011e4aa2020-09-04 15:22:31 +0200839
Michal Vasko52927e22020-03-16 17:26:14 +0100840 if (pref_len) {
Michal Vaskoad92b672020-11-12 13:11:31 +0100841 LY_CHECK_GOTO(ret = lydict_insert(ctx, prefix, pref_len, &opaq->name.prefix), finish);
Michal Vasko52927e22020-03-16 17:26:14 +0100842 }
Radek Krejci1798aae2020-07-14 13:26:06 +0200843 if (module_key_len) {
Michal Vaskoad92b672020-11-12 13:11:31 +0100844 LY_CHECK_GOTO(ret = lydict_insert(ctx, module_key, module_key_len, &opaq->name.module_ns), finish);
Radek Krejci1798aae2020-07-14 13:26:06 +0200845 }
Michal Vasko52927e22020-03-16 17:26:14 +0100846 if (dynamic && *dynamic) {
Radek Krejci011e4aa2020-09-04 15:22:31 +0200847 LY_CHECK_GOTO(ret = lydict_insert_zc(ctx, (char *)value, &opaq->value), finish);
Michal Vasko52927e22020-03-16 17:26:14 +0100848 *dynamic = 0;
849 } else {
Radek Krejci011e4aa2020-09-04 15:22:31 +0200850 LY_CHECK_GOTO(ret = lydict_insert(ctx, value, value_len, &opaq->value), finish);
Michal Vasko52927e22020-03-16 17:26:14 +0100851 }
Michal Vasko501af032020-11-11 20:27:44 +0100852
853 opaq->format = format;
854 opaq->val_prefix_data = val_prefix_data;
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200855 opaq->hints = hints;
Michal Vasko52927e22020-03-16 17:26:14 +0100856 opaq->ctx = ctx;
857
Radek Krejci011e4aa2020-09-04 15:22:31 +0200858finish:
859 if (ret) {
Michal Vasko9e685082021-01-29 14:49:09 +0100860 lyd_free_tree(&opaq->node);
Michal Vasko501af032020-11-11 20:27:44 +0100861 ly_free_prefix_data(format, val_prefix_data);
Radek Krejci011e4aa2020-09-04 15:22:31 +0200862 } else {
Michal Vasko9e685082021-01-29 14:49:09 +0100863 *node = &opaq->node;
Radek Krejci011e4aa2020-09-04 15:22:31 +0200864 }
865 return ret;
Michal Vasko52927e22020-03-16 17:26:14 +0100866}
867
Michal Vasko3a41dff2020-07-15 14:30:28 +0200868API LY_ERR
Michal Vasko65243892020-12-04 16:26:21 +0100869lyd_new_inner(struct lyd_node *parent, const struct lys_module *module, const char *name, ly_bool output,
870 struct lyd_node **node)
Michal Vasko013a8182020-03-03 10:46:53 +0100871{
872 struct lyd_node *ret = NULL;
873 const struct lysc_node *schema;
874 struct ly_ctx *ctx = parent ? parent->schema->module->ctx : (module ? module->ctx : NULL);
875
Michal Vasko6027eb92020-07-15 16:37:30 +0200876 LY_CHECK_ARG_RET(ctx, parent || module, parent || node, name, LY_EINVAL);
Michal Vasko013a8182020-03-03 10:46:53 +0100877
Michal Vaskof03ed032020-03-04 13:31:44 +0100878 if (!module) {
879 module = parent->schema->module;
880 }
881
Michal Vasko3a41dff2020-07-15 14:30:28 +0200882 schema = lys_find_child(parent ? parent->schema : NULL, module, name, 0,
Radek Krejci41ac9942020-11-02 14:47:56 +0100883 LYS_CONTAINER | LYS_NOTIF | LYS_RPC | LYS_ACTION, output ? LYS_GETNEXT_OUTPUT : 0);
Radek Krejcidd2a7662021-03-12 11:26:34 +0100884 LY_CHECK_ERR_RET(!schema, LOGERR(ctx, LY_EINVAL, "Inner node (not a list) \"%s\" not found.", name), LY_ENOTFOUND);
Michal Vasko013a8182020-03-03 10:46:53 +0100885
Michal Vasko3a41dff2020-07-15 14:30:28 +0200886 LY_CHECK_RET(lyd_create_inner(schema, &ret));
887 if (parent) {
Michal Vasko6ee6f432021-07-16 09:49:14 +0200888 lyd_insert_node(parent, NULL, ret, 0);
Michal Vasko013a8182020-03-03 10:46:53 +0100889 }
Michal Vasko3a41dff2020-07-15 14:30:28 +0200890
891 if (node) {
892 *node = ret;
893 }
894 return LY_SUCCESS;
Michal Vasko013a8182020-03-03 10:46:53 +0100895}
896
Michal Vasko3a41dff2020-07-15 14:30:28 +0200897API LY_ERR
Radek Krejcidd2a7662021-03-12 11:26:34 +0100898lyd_new_ext_inner(const struct lysc_ext_instance *ext, const char *name, struct lyd_node **node)
899{
900 struct lyd_node *ret = NULL;
901 const struct lysc_node *schema;
902 struct ly_ctx *ctx = ext ? ext->module->ctx : NULL;
903
904 LY_CHECK_ARG_RET(ctx, ext, node, name, LY_EINVAL);
905
906 schema = lysc_ext_find_node(ext, NULL, name, 0, LYS_CONTAINER | LYS_NOTIF | LYS_RPC | LYS_ACTION, 0);
907 if (!schema) {
908 if (ext->argument) {
909 LOGERR(ctx, LY_EINVAL, "Inner node (not a list) \"%s\" not found in instance \"%s\" of extension %s.",
910 name, ext->argument, ext->def->name);
911 } else {
912 LOGERR(ctx, LY_EINVAL, "Inner node (not a list) \"%s\" not found in instance of extension %s.",
913 name, ext->def->name);
914 }
915 return LY_ENOTFOUND;
916 }
917 LY_CHECK_RET(lyd_create_inner(schema, &ret));
918
919 *node = ret;
920
921 return LY_SUCCESS;
922}
923
Michal Vasko208e6d62021-06-28 11:23:50 +0200924/**
925 * @brief Create a new list node in the data tree.
926 *
927 * @param[in] parent Parent node for the node being created. NULL in case of creating a top level element.
928 * @param[in] module Module of the node being created. If NULL, @p parent module will be used.
929 * @param[in] name Schema node name of the new data node. The node must be #LYS_LIST.
930 * @param[in] format Format of key values.
931 * @param[in] output Flag in case the @p parent is RPC/Action. If value is 0, the input's data nodes of the RPC/Action are
932 * taken into consideration. Otherwise, the output's data node is going to be created.
933 * @param[out] node Optional created node.
934 * @param[in] ap Ordered key values of the new list instance, all must be set. For ::LY_VALUE_LYB, every value must
935 * be followed by the value length.
936 * @return LY_ERR value.
937 */
938static LY_ERR
939_lyd_new_list(struct lyd_node *parent, const struct lys_module *module, const char *name, LY_VALUE_FORMAT format,
940 ly_bool output, struct lyd_node **node, va_list ap)
Michal Vasko013a8182020-03-03 10:46:53 +0100941{
942 struct lyd_node *ret = NULL, *key;
943 const struct lysc_node *schema, *key_s;
944 struct ly_ctx *ctx = parent ? parent->schema->module->ctx : (module ? module->ctx : NULL);
Michal Vasko208e6d62021-06-28 11:23:50 +0200945 const void *key_val;
946 uint32_t key_len;
Michal Vasko013a8182020-03-03 10:46:53 +0100947 LY_ERR rc = LY_SUCCESS;
948
Michal Vasko6027eb92020-07-15 16:37:30 +0200949 LY_CHECK_ARG_RET(ctx, parent || module, parent || node, name, LY_EINVAL);
Michal Vasko013a8182020-03-03 10:46:53 +0100950
Michal Vaskof03ed032020-03-04 13:31:44 +0100951 if (!module) {
952 module = parent->schema->module;
953 }
954
Radek Krejci41ac9942020-11-02 14:47:56 +0100955 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 +0200956 LY_CHECK_ERR_RET(!schema, LOGERR(ctx, LY_EINVAL, "List node \"%s\" not found.", name), LY_ENOTFOUND);
Michal Vasko013a8182020-03-03 10:46:53 +0100957
958 /* create list inner node */
Michal Vasko3a41dff2020-07-15 14:30:28 +0200959 LY_CHECK_RET(lyd_create_inner(schema, &ret));
Michal Vasko013a8182020-03-03 10:46:53 +0100960
Michal Vasko013a8182020-03-03 10:46:53 +0100961 /* create and insert all the keys */
Michal Vasko544e58a2021-01-28 14:33:41 +0100962 for (key_s = lysc_node_child(schema); key_s && (key_s->flags & LYS_KEY); key_s = key_s->next) {
Michal Vasko208e6d62021-06-28 11:23:50 +0200963 if (format == LY_VALUE_LYB) {
964 key_val = va_arg(ap, const void *);
965 key_len = va_arg(ap, uint32_t);
966 } else {
967 key_val = va_arg(ap, const char *);
968 key_len = key_val ? strlen((char *)key_val) : 0;
969 }
Michal Vasko013a8182020-03-03 10:46:53 +0100970
Michal Vasko208e6d62021-06-28 11:23:50 +0200971 rc = lyd_create_term(key_s, key_val, key_len, NULL, format, NULL, LYD_HINT_DATA, NULL, &key);
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200972 LY_CHECK_GOTO(rc, cleanup);
Michal Vasko6ee6f432021-07-16 09:49:14 +0200973 lyd_insert_node(ret, NULL, key, 1);
Michal Vasko013a8182020-03-03 10:46:53 +0100974 }
975
Michal Vasko013a8182020-03-03 10:46:53 +0100976 if (parent) {
Michal Vasko6ee6f432021-07-16 09:49:14 +0200977 lyd_insert_node(parent, NULL, ret, 0);
Michal Vasko013a8182020-03-03 10:46:53 +0100978 }
979
980cleanup:
981 if (rc) {
982 lyd_free_tree(ret);
983 ret = NULL;
Michal Vasko3a41dff2020-07-15 14:30:28 +0200984 } else if (node) {
985 *node = ret;
Michal Vasko013a8182020-03-03 10:46:53 +0100986 }
Michal Vasko3a41dff2020-07-15 14:30:28 +0200987 return rc;
Michal Vasko013a8182020-03-03 10:46:53 +0100988}
989
Michal Vasko3a41dff2020-07-15 14:30:28 +0200990API LY_ERR
Michal Vasko208e6d62021-06-28 11:23:50 +0200991lyd_new_list(struct lyd_node *parent, const struct lys_module *module, const char *name, ly_bool output,
992 struct lyd_node **node, ...)
993{
994 LY_ERR rc;
995 va_list ap;
996
997 va_start(ap, node);
998
999 rc = _lyd_new_list(parent, module, name, LY_VALUE_JSON, output, node, ap);
1000
1001 va_end(ap);
1002 return rc;
1003}
1004
1005API LY_ERR
1006lyd_new_list_bin(struct lyd_node *parent, const struct lys_module *module, const char *name, ly_bool output,
1007 struct lyd_node **node, ...)
1008{
1009 LY_ERR rc;
1010 va_list ap;
1011
1012 va_start(ap, node);
1013
1014 rc = _lyd_new_list(parent, module, name, LY_VALUE_LYB, output, node, ap);
1015
1016 va_end(ap);
1017 return rc;
1018}
1019
1020API LY_ERR
1021lyd_new_list_canon(struct lyd_node *parent, const struct lys_module *module, const char *name, ly_bool output,
1022 struct lyd_node **node, ...)
1023{
1024 LY_ERR rc;
1025 va_list ap;
1026
1027 va_start(ap, node);
1028
1029 rc = _lyd_new_list(parent, module, name, LY_VALUE_CANON, output, node, ap);
1030
1031 va_end(ap);
1032 return rc;
1033}
1034
1035API LY_ERR
Radek Krejci8247bae2021-03-12 11:47:02 +01001036lyd_new_ext_list(const struct lysc_ext_instance *ext, const char *name, struct lyd_node **node, ...)
1037{
1038 struct lyd_node *ret = NULL, *key;
1039 const struct lysc_node *schema, *key_s;
1040 struct ly_ctx *ctx = ext ? ext->module->ctx : NULL;
1041 va_list ap;
1042 const char *key_val;
1043 LY_ERR rc = LY_SUCCESS;
1044
1045 LY_CHECK_ARG_RET(ctx, ext, node, name, LY_EINVAL);
1046
1047 schema = lysc_ext_find_node(ext, NULL, name, 0, LYS_LIST, 0);
1048 if (!schema) {
1049 if (ext->argument) {
1050 LOGERR(ctx, LY_EINVAL, "List node \"%s\" not found in instance \"%s\" of extension %s.",
1051 name, ext->argument, ext->def->name);
1052 } else {
1053 LOGERR(ctx, LY_EINVAL, "List node \"%s\" not found in instance of extension %s.", name, ext->def->name);
1054 }
1055 return LY_ENOTFOUND;
1056 }
1057 /* create list inner node */
1058 LY_CHECK_RET(lyd_create_inner(schema, &ret));
1059
1060 va_start(ap, node);
1061
1062 /* create and insert all the keys */
1063 for (key_s = lysc_node_child(schema); key_s && (key_s->flags & LYS_KEY); key_s = key_s->next) {
1064 key_val = va_arg(ap, const char *);
1065
Radek Krejci8df109d2021-04-23 12:19:08 +02001066 rc = lyd_create_term(key_s, key_val, key_val ? strlen(key_val) : 0, NULL, LY_VALUE_JSON, NULL, LYD_HINT_DATA,
Radek Krejci8247bae2021-03-12 11:47:02 +01001067 NULL, &key);
1068 LY_CHECK_GOTO(rc, cleanup);
Michal Vasko6ee6f432021-07-16 09:49:14 +02001069 lyd_insert_node(ret, NULL, key, 1);
Radek Krejci8247bae2021-03-12 11:47:02 +01001070 }
1071
1072cleanup:
1073 va_end(ap);
1074 if (rc) {
1075 lyd_free_tree(ret);
1076 ret = NULL;
Radek Krejci8247bae2021-03-12 11:47:02 +01001077 }
Radek Krejci8919fbd2021-03-15 09:35:25 +01001078 *node = ret;
Radek Krejci8247bae2021-03-12 11:47:02 +01001079 return rc;
1080}
1081
1082API LY_ERR
Michal Vasko3a41dff2020-07-15 14:30:28 +02001083lyd_new_list2(struct lyd_node *parent, const struct lys_module *module, const char *name, const char *keys,
Radek Krejci41ac9942020-11-02 14:47:56 +01001084 ly_bool output, struct lyd_node **node)
Michal Vasko013a8182020-03-03 10:46:53 +01001085{
1086 struct lyd_node *ret = NULL;
1087 const struct lysc_node *schema;
1088 struct ly_ctx *ctx = parent ? parent->schema->module->ctx : (module ? module->ctx : NULL);
1089
Michal Vasko6027eb92020-07-15 16:37:30 +02001090 LY_CHECK_ARG_RET(ctx, parent || module, parent || node, name, LY_EINVAL);
Michal Vasko013a8182020-03-03 10:46:53 +01001091
Michal Vaskof03ed032020-03-04 13:31:44 +01001092 if (!module) {
1093 module = parent->schema->module;
1094 }
Michal Vasko004d3152020-06-11 19:59:22 +02001095 if (!keys) {
1096 keys = "";
1097 }
Michal Vaskof03ed032020-03-04 13:31:44 +01001098
Michal Vasko004d3152020-06-11 19:59:22 +02001099 /* find schema node */
Radek Krejci41ac9942020-11-02 14:47:56 +01001100 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 +02001101 LY_CHECK_ERR_RET(!schema, LOGERR(ctx, LY_EINVAL, "List node \"%s\" not found.", name), LY_ENOTFOUND);
Michal Vasko013a8182020-03-03 10:46:53 +01001102
Michal Vasko004d3152020-06-11 19:59:22 +02001103 if ((schema->flags & LYS_KEYLESS) && !keys[0]) {
1104 /* key-less list */
Michal Vasko3a41dff2020-07-15 14:30:28 +02001105 LY_CHECK_RET(lyd_create_inner(schema, &ret));
Michal Vasko004d3152020-06-11 19:59:22 +02001106 } else {
1107 /* create the list node */
Michal Vasko3a41dff2020-07-15 14:30:28 +02001108 LY_CHECK_RET(lyd_create_list2(schema, keys, strlen(keys), &ret));
Michal Vasko004d3152020-06-11 19:59:22 +02001109 }
Michal Vasko004d3152020-06-11 19:59:22 +02001110 if (parent) {
Michal Vasko6ee6f432021-07-16 09:49:14 +02001111 lyd_insert_node(parent, NULL, ret, 0);
Michal Vasko013a8182020-03-03 10:46:53 +01001112 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02001113
1114 if (node) {
1115 *node = ret;
1116 }
1117 return LY_SUCCESS;
Michal Vasko013a8182020-03-03 10:46:53 +01001118}
1119
Radek Krejci09c77442021-04-26 11:10:34 +02001120/**
1121 * @brief Create a new term node in the data tree.
1122 *
1123 * @param[in] parent Parent node for the node being created. NULL in case of creating a top level element.
1124 * @param[in] module Module of the node being created. If NULL, @p parent module will be used.
1125 * @param[in] name Schema node name of the new data node. The node can be ::LYS_LEAF or ::LYS_LEAFLIST.
1126 * @param[in] value Value of the node being created.
1127 * @param[in] value_len Length of @p value.
1128 * @param[in] format Format of @p value.
1129 * @param[in] output Flag in case the @p parent is RPC/Action. If value is 0, the input's data nodes of the RPC/Action are
1130 * taken into consideration. Otherwise, the output's data node is going to be created.
1131 * @param[out] node Optional created node.
1132 * @return LY_ERR value.
1133 */
1134static LY_ERR
1135_lyd_new_term(struct lyd_node *parent, const struct lys_module *module, const char *name, const void *value,
1136 size_t value_len, LY_VALUE_FORMAT format, ly_bool output, struct lyd_node **node)
Michal Vasko013a8182020-03-03 10:46:53 +01001137{
Michal Vaskocbff3e92020-05-27 12:56:41 +02001138 LY_ERR rc;
Michal Vasko013a8182020-03-03 10:46:53 +01001139 struct lyd_node *ret = NULL;
1140 const struct lysc_node *schema;
Radek Krejci09c77442021-04-26 11:10:34 +02001141 const struct ly_ctx *ctx = parent ? LYD_CTX(parent) : (module ? module->ctx : NULL);
Michal Vasko013a8182020-03-03 10:46:53 +01001142
Michal Vasko6027eb92020-07-15 16:37:30 +02001143 LY_CHECK_ARG_RET(ctx, parent || module, parent || node, name, LY_EINVAL);
Michal Vasko013a8182020-03-03 10:46:53 +01001144
Michal Vaskof03ed032020-03-04 13:31:44 +01001145 if (!module) {
1146 module = parent->schema->module;
1147 }
1148
Radek Krejci41ac9942020-11-02 14:47:56 +01001149 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 +02001150 LY_CHECK_ERR_RET(!schema, LOGERR(ctx, LY_EINVAL, "Term node \"%s\" not found.", name), LY_ENOTFOUND);
Michal Vasko013a8182020-03-03 10:46:53 +01001151
Radek Krejci09c77442021-04-26 11:10:34 +02001152 rc = lyd_create_term(schema, value, value_len, NULL, format, NULL, LYD_HINT_DATA, NULL, &ret);
Michal Vaskofeca4fb2020-10-05 08:58:40 +02001153 LY_CHECK_RET(rc);
Michal Vaskocbff3e92020-05-27 12:56:41 +02001154 if (parent) {
Michal Vasko6ee6f432021-07-16 09:49:14 +02001155 lyd_insert_node(parent, NULL, ret, 0);
Michal Vasko013a8182020-03-03 10:46:53 +01001156 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02001157
1158 if (node) {
1159 *node = ret;
1160 }
1161 return LY_SUCCESS;
Michal Vasko013a8182020-03-03 10:46:53 +01001162}
1163
Michal Vasko3a41dff2020-07-15 14:30:28 +02001164API LY_ERR
Radek Krejci09c77442021-04-26 11:10:34 +02001165lyd_new_term(struct lyd_node *parent, const struct lys_module *module, const char *name, const char *val_str,
1166 ly_bool output, struct lyd_node **node)
1167{
1168 return _lyd_new_term(parent, module, name, val_str, val_str ? strlen(val_str) : 0, LY_VALUE_JSON, output, node);
1169}
1170
1171API LY_ERR
1172lyd_new_term_bin(struct lyd_node *parent, const struct lys_module *module, const char *name, const void *value,
1173 size_t value_len, ly_bool output, struct lyd_node **node)
1174{
1175 return _lyd_new_term(parent, module, name, value, value_len, LY_VALUE_LYB, output, node);
1176}
1177
1178API LY_ERR
1179lyd_new_term_canon(struct lyd_node *parent, const struct lys_module *module, const char *name, const char *val_str,
1180 ly_bool output, struct lyd_node **node)
1181{
1182 return _lyd_new_term(parent, module, name, val_str, val_str ? strlen(val_str) : 0, LY_VALUE_CANON, output, node);
1183}
1184
1185API LY_ERR
Radek Krejci8a5afc22021-03-12 11:10:47 +01001186lyd_new_ext_term(const struct lysc_ext_instance *ext, const char *name, const char *val_str, struct lyd_node **node)
1187{
1188 LY_ERR rc;
1189 struct lyd_node *ret = NULL;
1190 const struct lysc_node *schema;
1191 struct ly_ctx *ctx = ext ? ext->module->ctx : NULL;
1192
1193 LY_CHECK_ARG_RET(ctx, ext, node, name, LY_EINVAL);
1194
1195 schema = lysc_ext_find_node(ext, NULL, name, 0, LYD_NODE_TERM, 0);
1196 if (!schema) {
1197 if (ext->argument) {
1198 LOGERR(ctx, LY_EINVAL, "Term node \"%s\" not found in instance \"%s\" of extension %s.",
1199 name, ext->argument, ext->def->name);
1200 } else {
1201 LOGERR(ctx, LY_EINVAL, "Term node \"%s\" not found in instance of extension %s.", name, ext->def->name);
1202 }
1203 return LY_ENOTFOUND;
1204 }
Radek Krejci8df109d2021-04-23 12:19:08 +02001205 rc = lyd_create_term(schema, val_str, val_str ? strlen(val_str) : 0, NULL, LY_VALUE_JSON, NULL, LYD_HINT_DATA, NULL, &ret);
Radek Krejci8a5afc22021-03-12 11:10:47 +01001206 LY_CHECK_RET(rc);
1207
1208 *node = ret;
1209
1210 return LY_SUCCESS;
1211}
1212
1213API LY_ERR
Michal Vasko2a4ab2b2021-03-04 15:52:40 +01001214lyd_new_any(struct lyd_node *parent, const struct lys_module *module, const char *name, const void *value,
1215 ly_bool use_value, LYD_ANYDATA_VALUETYPE value_type, ly_bool output, struct lyd_node **node)
Michal Vasko013a8182020-03-03 10:46:53 +01001216{
1217 struct lyd_node *ret = NULL;
1218 const struct lysc_node *schema;
1219 struct ly_ctx *ctx = parent ? parent->schema->module->ctx : (module ? module->ctx : NULL);
1220
Michal Vasko6027eb92020-07-15 16:37:30 +02001221 LY_CHECK_ARG_RET(ctx, parent || module, parent || node, name, LY_EINVAL);
Michal Vasko013a8182020-03-03 10:46:53 +01001222
Michal Vaskof03ed032020-03-04 13:31:44 +01001223 if (!module) {
1224 module = parent->schema->module;
1225 }
1226
Radek Krejci41ac9942020-11-02 14:47:56 +01001227 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 +02001228 LY_CHECK_ERR_RET(!schema, LOGERR(ctx, LY_EINVAL, "Any node \"%s\" not found.", name), LY_ENOTFOUND);
Michal Vasko013a8182020-03-03 10:46:53 +01001229
Michal Vasko2a4ab2b2021-03-04 15:52:40 +01001230 LY_CHECK_RET(lyd_create_any(schema, value, value_type, use_value, &ret));
Michal Vasko3a41dff2020-07-15 14:30:28 +02001231 if (parent) {
Michal Vasko6ee6f432021-07-16 09:49:14 +02001232 lyd_insert_node(parent, NULL, ret, 0);
Michal Vasko013a8182020-03-03 10:46:53 +01001233 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02001234
1235 if (node) {
1236 *node = ret;
1237 }
1238 return LY_SUCCESS;
Michal Vasko013a8182020-03-03 10:46:53 +01001239}
1240
Radek Krejci0b963da2021-03-12 13:23:44 +01001241API LY_ERR
1242lyd_new_ext_any(const struct lysc_ext_instance *ext, const char *name, const void *value, ly_bool use_value,
1243 LYD_ANYDATA_VALUETYPE value_type, struct lyd_node **node)
1244{
1245 struct lyd_node *ret = NULL;
1246 const struct lysc_node *schema;
1247 struct ly_ctx *ctx = ext ? ext->module->ctx : NULL;
1248
1249 LY_CHECK_ARG_RET(ctx, ext, node, name, LY_EINVAL);
1250
1251 schema = lysc_ext_find_node(ext, NULL, name, 0, LYD_NODE_ANY, 0);
1252 if (!schema) {
1253 if (ext->argument) {
1254 LOGERR(ctx, LY_EINVAL, "Any node \"%s\" not found in instance \"%s\" of extension %s.",
1255 name, ext->argument, ext->def->name);
1256 } else {
1257 LOGERR(ctx, LY_EINVAL, "Any node \"%s\" not found in instance of extension %s.", name, ext->def->name);
1258 }
1259 return LY_ENOTFOUND;
1260 }
1261 LY_CHECK_RET(lyd_create_any(schema, value, value_type, use_value, &ret));
1262
1263 *node = ret;
1264
1265 return LY_SUCCESS;
1266}
1267
Michal Vasko3a41dff2020-07-15 14:30:28 +02001268API LY_ERR
Michal Vasko871a0252020-11-11 18:35:24 +01001269lyd_new_meta(const struct ly_ctx *ctx, struct lyd_node *parent, const struct lys_module *module, const char *name,
1270 const char *val_str, ly_bool clear_dflt, struct lyd_meta **meta)
Michal Vaskod86997b2020-05-26 15:19:54 +02001271{
Michal Vaskod86997b2020-05-26 15:19:54 +02001272 const char *prefix, *tmp;
Michal Vaskod86997b2020-05-26 15:19:54 +02001273 size_t pref_len, name_len;
1274
Michal Vasko2b5344c2021-02-26 10:12:05 +01001275 LY_CHECK_ARG_RET(ctx, ctx || parent, name, module || strchr(name, ':'), parent || meta, LY_EINVAL);
1276 if (!ctx) {
1277 ctx = LYD_CTX(parent);
1278 }
Michal Vasko00cbf532020-06-15 13:58:47 +02001279
Michal Vasko871a0252020-11-11 18:35:24 +01001280 if (parent && !parent->schema) {
Michal Vasko33b4fab2021-03-04 15:56:12 +01001281 LOGERR(ctx, LY_EINVAL, "Cannot add metadata \"%s\" to an opaque node \"%s\".", name, LYD_NAME(parent));
Michal Vasko871a0252020-11-11 18:35:24 +01001282 return LY_EINVAL;
1283 }
Michal Vasko610553d2020-11-18 18:15:05 +01001284 if (meta) {
1285 *meta = NULL;
1286 }
Michal Vaskod86997b2020-05-26 15:19:54 +02001287
1288 /* parse the name */
1289 tmp = name;
1290 if (ly_parse_nodeid(&tmp, &prefix, &pref_len, &name, &name_len) || tmp[0]) {
1291 LOGERR(ctx, LY_EINVAL, "Metadata name \"%s\" is not valid.", name);
Michal Vasko871a0252020-11-11 18:35:24 +01001292 return LY_EINVAL;
Michal Vaskod86997b2020-05-26 15:19:54 +02001293 }
1294
1295 /* find the module */
1296 if (prefix) {
Radek Krejci0ad51f12020-07-16 12:08:12 +02001297 module = ly_ctx_get_module_implemented2(ctx, prefix, pref_len);
Radek Krejci422afb12021-03-04 16:38:16 +01001298 LY_CHECK_ERR_RET(!module, LOGERR(ctx, LY_EINVAL, "Module \"%.*s\" not found.", (int)pref_len, prefix), LY_ENOTFOUND);
Michal Vaskod86997b2020-05-26 15:19:54 +02001299 }
1300
1301 /* set value if none */
1302 if (!val_str) {
1303 val_str = "";
1304 }
1305
Radek Krejci8df109d2021-04-23 12:19:08 +02001306 return lyd_create_meta(parent, meta, module, name, name_len, val_str, strlen(val_str), NULL, LY_VALUE_JSON,
Michal Vasko871a0252020-11-11 18:35:24 +01001307 NULL, LYD_HINT_DATA, clear_dflt, NULL);
1308}
Michal Vasko3a41dff2020-07-15 14:30:28 +02001309
Michal Vaskoba696702020-11-11 19:12:45 +01001310API LY_ERR
1311lyd_new_meta2(const struct ly_ctx *ctx, struct lyd_node *parent, ly_bool clear_dflt, const struct lyd_attr *attr,
1312 struct lyd_meta **meta)
1313{
1314 const struct lys_module *mod;
1315
1316 LY_CHECK_ARG_RET(NULL, ctx, attr, parent || meta, LY_EINVAL);
1317
1318 if (parent && !parent->schema) {
1319 LOGERR(ctx, LY_EINVAL, "Cannot add metadata to an opaque node \"%s\".", ((struct lyd_node_opaq *)parent)->name);
1320 return LY_EINVAL;
Michal Vasko3a41dff2020-07-15 14:30:28 +02001321 }
Michal Vasko610553d2020-11-18 18:15:05 +01001322 if (meta) {
1323 *meta = NULL;
1324 }
Michal Vaskoba696702020-11-11 19:12:45 +01001325
1326 switch (attr->format) {
Radek Krejci8df109d2021-04-23 12:19:08 +02001327 case LY_VALUE_XML:
Michal Vaskoad92b672020-11-12 13:11:31 +01001328 mod = ly_ctx_get_module_implemented_ns(ctx, attr->name.module_ns);
Michal Vaskoba696702020-11-11 19:12:45 +01001329 if (!mod) {
Michal Vaskoad92b672020-11-12 13:11:31 +01001330 LOGERR(ctx, LY_EINVAL, "Module with namespace \"%s\" not found.", attr->name.module_ns);
Michal Vaskoba696702020-11-11 19:12:45 +01001331 return LY_ENOTFOUND;
1332 }
1333 break;
Radek Krejci8df109d2021-04-23 12:19:08 +02001334 case LY_VALUE_JSON:
Michal Vaskoad92b672020-11-12 13:11:31 +01001335 mod = ly_ctx_get_module_implemented(ctx, attr->name.module_name);
Michal Vaskoba696702020-11-11 19:12:45 +01001336 if (!mod) {
Michal Vaskoad92b672020-11-12 13:11:31 +01001337 LOGERR(ctx, LY_EINVAL, "Module \"%s\" not found.", attr->name.module_name);
Michal Vaskoba696702020-11-11 19:12:45 +01001338 return LY_ENOTFOUND;
1339 }
1340 break;
1341 default:
1342 LOGINT_RET(ctx);
1343 }
1344
Michal Vaskoad92b672020-11-12 13:11:31 +01001345 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 +01001346 NULL, attr->format, attr->val_prefix_data, attr->hints, clear_dflt, NULL);
Michal Vaskod86997b2020-05-26 15:19:54 +02001347}
1348
Michal Vasko3a41dff2020-07-15 14:30:28 +02001349API LY_ERR
Michal Vasko00cbf532020-06-15 13:58:47 +02001350lyd_new_opaq(struct lyd_node *parent, const struct ly_ctx *ctx, const char *name, const char *value,
Michal Vasko0ab974d2021-02-24 13:18:26 +01001351 const char *prefix, const char *module_name, struct lyd_node **node)
Michal Vasko00cbf532020-06-15 13:58:47 +02001352{
1353 struct lyd_node *ret = NULL;
Radek Krejci07a55962021-03-02 20:16:43 +01001354
Michal Vasko0ab974d2021-02-24 13:18:26 +01001355 LY_CHECK_ARG_RET(ctx, parent || ctx, parent || node, name, module_name, !prefix || !strcmp(prefix, module_name), LY_EINVAL);
Michal Vasko00cbf532020-06-15 13:58:47 +02001356
1357 if (!ctx) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001358 ctx = LYD_CTX(parent);
Michal Vasko00cbf532020-06-15 13:58:47 +02001359 }
1360 if (!value) {
1361 value = "";
1362 }
1363
Michal Vasko0ab974d2021-02-24 13:18:26 +01001364 LY_CHECK_RET(lyd_create_opaq(ctx, name, strlen(name), prefix, prefix ? strlen(prefix) : 0, module_name,
Radek Krejci8df109d2021-04-23 12:19:08 +02001365 strlen(module_name), value, strlen(value), NULL, LY_VALUE_JSON, NULL, 0, &ret));
Michal Vasko3a41dff2020-07-15 14:30:28 +02001366 if (parent) {
Michal Vasko6ee6f432021-07-16 09:49:14 +02001367 lyd_insert_node(parent, NULL, ret, 1);
Michal Vasko00cbf532020-06-15 13:58:47 +02001368 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02001369
1370 if (node) {
1371 *node = ret;
1372 }
1373 return LY_SUCCESS;
Michal Vasko00cbf532020-06-15 13:58:47 +02001374}
1375
Michal Vasko3a41dff2020-07-15 14:30:28 +02001376API LY_ERR
Michal Vasko8d65f852021-02-17 11:28:13 +01001377lyd_new_opaq2(struct lyd_node *parent, const struct ly_ctx *ctx, const char *name, const char *value,
Michal Vasko0ab974d2021-02-24 13:18:26 +01001378 const char *prefix, const char *module_ns, struct lyd_node **node)
Michal Vasko8d65f852021-02-17 11:28:13 +01001379{
1380 struct lyd_node *ret = NULL;
1381
1382 LY_CHECK_ARG_RET(ctx, parent || ctx, parent || node, name, module_ns, LY_EINVAL);
1383
1384 if (!ctx) {
1385 ctx = LYD_CTX(parent);
1386 }
1387 if (!value) {
1388 value = "";
1389 }
1390
Michal Vasko0ab974d2021-02-24 13:18:26 +01001391 LY_CHECK_RET(lyd_create_opaq(ctx, name, strlen(name), prefix, prefix ? strlen(prefix) : 0, module_ns,
Radek Krejci8df109d2021-04-23 12:19:08 +02001392 strlen(module_ns), value, strlen(value), NULL, LY_VALUE_XML, NULL, 0, &ret));
Michal Vasko8d65f852021-02-17 11:28:13 +01001393 if (parent) {
Michal Vasko6ee6f432021-07-16 09:49:14 +02001394 lyd_insert_node(parent, NULL, ret, 1);
Michal Vasko8d65f852021-02-17 11:28:13 +01001395 }
1396
1397 if (node) {
1398 *node = ret;
1399 }
1400 return LY_SUCCESS;
1401}
1402
1403API LY_ERR
1404lyd_new_attr(struct lyd_node *parent, const char *module_name, const char *name, const char *value,
Radek Krejci0f969882020-08-21 16:56:47 +02001405 struct lyd_attr **attr)
Michal Vasko00cbf532020-06-15 13:58:47 +02001406{
Radek Krejci1798aae2020-07-14 13:26:06 +02001407 struct lyd_attr *ret = NULL;
Michal Vasko00cbf532020-06-15 13:58:47 +02001408 const struct ly_ctx *ctx;
1409 const char *prefix, *tmp;
Michal Vasko51d21b82020-11-13 18:03:54 +01001410 size_t pref_len, name_len, mod_len;
Michal Vasko00cbf532020-06-15 13:58:47 +02001411
Michal Vasko3a41dff2020-07-15 14:30:28 +02001412 LY_CHECK_ARG_RET(NULL, parent, !parent->schema, name, LY_EINVAL);
Michal Vasko00cbf532020-06-15 13:58:47 +02001413
Michal Vaskob7be7a82020-08-20 09:09:04 +02001414 ctx = LYD_CTX(parent);
Michal Vasko00cbf532020-06-15 13:58:47 +02001415
1416 /* parse the name */
1417 tmp = name;
1418 if (ly_parse_nodeid(&tmp, &prefix, &pref_len, &name, &name_len) || tmp[0]) {
Michal Vaskob69b68c2021-02-17 11:18:16 +01001419 LOGERR(ctx, LY_EINVAL, "Attribute name \"%s\" is not valid.", name);
Michal Vasko3a41dff2020-07-15 14:30:28 +02001420 return LY_EVALID;
Michal Vasko00cbf532020-06-15 13:58:47 +02001421 }
1422
Michal Vaskoe137fc42021-07-22 11:53:13 +02001423 if ((pref_len == 3) && !strncmp(prefix, "xml", 3)) {
1424 /* not a prefix but special name */
1425 name = prefix;
1426 name_len += 1 + pref_len;
1427 prefix = NULL;
1428 pref_len = 0;
1429 }
1430
Michal Vasko51d21b82020-11-13 18:03:54 +01001431 /* get the module */
1432 if (module_name) {
1433 mod_len = strlen(module_name);
1434 } else {
1435 module_name = prefix;
1436 mod_len = pref_len;
1437 }
1438
Michal Vasko00cbf532020-06-15 13:58:47 +02001439 /* set value if none */
Michal Vasko8d65f852021-02-17 11:28:13 +01001440 if (!value) {
1441 value = "";
Michal Vasko00cbf532020-06-15 13:58:47 +02001442 }
1443
Michal Vasko8d65f852021-02-17 11:28:13 +01001444 LY_CHECK_RET(lyd_create_attr(parent, &ret, ctx, name, name_len, prefix, pref_len, module_name, mod_len, value,
Radek Krejci8df109d2021-04-23 12:19:08 +02001445 strlen(value), NULL, LY_VALUE_JSON, NULL, LYD_HINT_DATA));
Michal Vasko8d65f852021-02-17 11:28:13 +01001446
1447 if (attr) {
1448 *attr = ret;
1449 }
1450 return LY_SUCCESS;
1451}
1452
1453API LY_ERR
1454lyd_new_attr2(struct lyd_node *parent, const char *module_ns, const char *name, const char *value,
1455 struct lyd_attr **attr)
1456{
1457 struct lyd_attr *ret = NULL;
1458 const struct ly_ctx *ctx;
1459 const char *prefix, *tmp;
1460 size_t pref_len, name_len;
1461
1462 LY_CHECK_ARG_RET(NULL, parent, !parent->schema, name, LY_EINVAL);
1463
1464 ctx = LYD_CTX(parent);
1465
1466 /* parse the name */
1467 tmp = name;
1468 if (ly_parse_nodeid(&tmp, &prefix, &pref_len, &name, &name_len) || tmp[0]) {
1469 LOGERR(ctx, LY_EINVAL, "Attribute name \"%s\" is not valid.", name);
1470 return LY_EVALID;
1471 }
1472
Michal Vaskoe137fc42021-07-22 11:53:13 +02001473 if ((pref_len == 3) && !strncmp(prefix, "xml", 3)) {
1474 /* not a prefix but special name */
1475 name = prefix;
1476 name_len += 1 + pref_len;
1477 prefix = NULL;
1478 pref_len = 0;
1479 }
1480
Michal Vasko8d65f852021-02-17 11:28:13 +01001481 /* set value if none */
1482 if (!value) {
1483 value = "";
1484 }
1485
1486 LY_CHECK_RET(lyd_create_attr(parent, &ret, ctx, name, name_len, prefix, pref_len, module_ns,
Radek Krejci8df109d2021-04-23 12:19:08 +02001487 module_ns ? strlen(module_ns) : 0, value, strlen(value), NULL, LY_VALUE_XML, NULL, LYD_HINT_DATA));
Michal Vasko3a41dff2020-07-15 14:30:28 +02001488
1489 if (attr) {
1490 *attr = ret;
1491 }
1492 return LY_SUCCESS;
Michal Vasko00cbf532020-06-15 13:58:47 +02001493}
1494
Radek Krejci09c77442021-04-26 11:10:34 +02001495/**
1496 * @brief Change the value of a term (leaf or leaf-list) node.
1497 *
1498 * Node changed this way is always considered explicitly set, meaning its default flag
1499 * is always cleared.
1500 *
1501 * @param[in] term Term node to change.
1502 * @param[in] value New value to set.
1503 * @param[in] value_len Length of @p value.
1504 * @param[in] format Format of @p value.
1505 * @return LY_SUCCESS if value was changed,
1506 * @return LY_EEXIST if value was the same and only the default flag was cleared,
1507 * @return LY_ENOT if the values were equal and no change occured,
1508 * @return LY_ERR value on other errors.
1509 */
1510static LY_ERR
1511_lyd_change_term(struct lyd_node *term, const void *value, size_t value_len, LY_VALUE_FORMAT format)
Michal Vasko00cbf532020-06-15 13:58:47 +02001512{
1513 LY_ERR ret = LY_SUCCESS;
1514 struct lysc_type *type;
1515 struct lyd_node_term *t;
1516 struct lyd_node *parent;
1517 struct lyd_value val = {0};
Radek Krejci857189e2020-09-01 13:26:36 +02001518 ly_bool dflt_change, val_change;
Michal Vasko00cbf532020-06-15 13:58:47 +02001519
Radek Krejci09c77442021-04-26 11:10:34 +02001520 assert(term && term->schema && (term->schema->nodetype & LYD_NODE_TERM));
Michal Vasko00cbf532020-06-15 13:58:47 +02001521
Michal Vasko00cbf532020-06-15 13:58:47 +02001522 t = (struct lyd_node_term *)term;
1523 type = ((struct lysc_node_leaf *)term->schema)->type;
1524
1525 /* parse the new value */
Radek Krejciddace2c2021-01-08 11:30:56 +01001526 LOG_LOCSET(term->schema, term, NULL, NULL);
Radek Krejci09c77442021-04-26 11:10:34 +02001527 ret = lyd_value_store(LYD_CTX(term), &val, type, value, value_len, NULL, format, NULL, LYD_HINT_DATA, term->schema, NULL);
Radek Krejciddace2c2021-01-08 11:30:56 +01001528 LOG_LOCBACK(term->schema ? 1 : 0, 1, 0, 0);
Michal Vaskofeca4fb2020-10-05 08:58:40 +02001529 LY_CHECK_GOTO(ret, cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001530
1531 /* compare original and new value */
1532 if (type->plugin->compare(&t->value, &val)) {
1533 /* values differ, switch them */
Michal Vaskob7be7a82020-08-20 09:09:04 +02001534 type->plugin->free(LYD_CTX(term), &t->value);
Michal Vasko00cbf532020-06-15 13:58:47 +02001535 t->value = val;
1536 memset(&val, 0, sizeof val);
1537 val_change = 1;
1538 } else {
1539 val_change = 0;
1540 }
1541
1542 /* always clear the default flag */
1543 if (term->flags & LYD_DEFAULT) {
Michal Vasko9e685082021-01-29 14:49:09 +01001544 for (parent = term; parent; parent = lyd_parent(parent)) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001545 parent->flags &= ~LYD_DEFAULT;
1546 }
1547 dflt_change = 1;
1548 } else {
1549 dflt_change = 0;
1550 }
1551
1552 if (val_change || dflt_change) {
1553 /* make the node non-validated */
1554 term->flags &= LYD_NEW;
1555 }
1556
1557 if (val_change) {
1558 if (term->schema->nodetype == LYS_LEAFLIST) {
1559 /* leaf-list needs to be hashed again and re-inserted into parent */
1560 lyd_unlink_hash(term);
1561 lyd_hash(term);
1562 LY_CHECK_GOTO(ret = lyd_insert_hash(term), cleanup);
1563 } else if ((term->schema->flags & LYS_KEY) && term->parent) {
1564 /* list needs to be updated if its key was changed */
1565 assert(term->parent->schema->nodetype == LYS_LIST);
Michal Vasko9e685082021-01-29 14:49:09 +01001566 lyd_unlink_hash(lyd_parent(term));
1567 lyd_hash(lyd_parent(term));
1568 LY_CHECK_GOTO(ret = lyd_insert_hash(lyd_parent(term)), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001569 } /* else leaf that is not a key, its value is not used for its hash so it does not change */
1570 }
1571
1572 /* retrun value */
1573 if (!val_change) {
1574 if (dflt_change) {
1575 /* only default flag change */
1576 ret = LY_EEXIST;
1577 } else {
1578 /* no change */
1579 ret = LY_ENOT;
1580 }
1581 } /* else value changed, LY_SUCCESS */
1582
1583cleanup:
Michal Vasko59512fc2020-12-09 18:13:29 +01001584 if (val.realtype) {
1585 type->plugin->free(LYD_CTX(term), &val);
1586 }
Michal Vasko00cbf532020-06-15 13:58:47 +02001587 return ret;
1588}
1589
Michal Vasko41586352020-07-13 13:54:25 +02001590API LY_ERR
Radek Krejci09c77442021-04-26 11:10:34 +02001591lyd_change_term(struct lyd_node *term, const char *val_str)
1592{
1593 LY_CHECK_ARG_RET(NULL, term, term->schema, term->schema->nodetype & LYD_NODE_TERM, LY_EINVAL);
1594
1595 return _lyd_change_term(term, val_str, val_str ? strlen(val_str) : 0, LY_VALUE_JSON);
1596}
1597
1598API LY_ERR
1599lyd_change_term_bin(struct lyd_node *term, const void *value, size_t value_len)
1600{
1601 LY_CHECK_ARG_RET(NULL, term, term->schema, term->schema->nodetype & LYD_NODE_TERM, LY_EINVAL);
1602
1603 return _lyd_change_term(term, value, value_len, LY_VALUE_LYB);
1604}
1605
1606API LY_ERR
1607lyd_change_term_canon(struct lyd_node *term, const char *val_str)
1608{
1609 LY_CHECK_ARG_RET(NULL, term, term->schema, term->schema->nodetype & LYD_NODE_TERM, LY_EINVAL);
1610
1611 return _lyd_change_term(term, val_str, val_str ? strlen(val_str) : 0, LY_VALUE_CANON);
1612}
1613
1614API LY_ERR
Michal Vasko41586352020-07-13 13:54:25 +02001615lyd_change_meta(struct lyd_meta *meta, const char *val_str)
1616{
1617 LY_ERR ret = LY_SUCCESS;
Radek Krejci2b18bf12020-11-06 11:20:20 +01001618 struct lyd_meta *m2 = NULL;
Michal Vasko41586352020-07-13 13:54:25 +02001619 struct lyd_value val;
Radek Krejci857189e2020-09-01 13:26:36 +02001620 ly_bool val_change;
Michal Vasko41586352020-07-13 13:54:25 +02001621
1622 LY_CHECK_ARG_RET(NULL, meta, LY_EINVAL);
1623
1624 if (!val_str) {
1625 val_str = "";
1626 }
1627
1628 /* parse the new value into a new meta structure */
1629 LY_CHECK_GOTO(ret = lyd_create_meta(NULL, &m2, meta->annotation->module, meta->name, strlen(meta->name), val_str,
Radek Krejci8df109d2021-04-23 12:19:08 +02001630 strlen(val_str), NULL, LY_VALUE_JSON, NULL, LYD_HINT_DATA, 0, NULL), cleanup);
Michal Vasko41586352020-07-13 13:54:25 +02001631
1632 /* compare original and new value */
1633 if (lyd_compare_meta(meta, m2)) {
1634 /* values differ, switch them */
1635 val = meta->value;
1636 meta->value = m2->value;
1637 m2->value = val;
1638 val_change = 1;
1639 } else {
1640 val_change = 0;
1641 }
1642
1643 /* retrun value */
1644 if (!val_change) {
1645 /* no change */
1646 ret = LY_ENOT;
1647 } /* else value changed, LY_SUCCESS */
1648
1649cleanup:
Michal Vasko1a66a5d2020-11-18 18:15:37 +01001650 lyd_free_meta_single(m2);
Michal Vasko41586352020-07-13 13:54:25 +02001651 return ret;
1652}
1653
Radek Krejci09c77442021-04-26 11:10:34 +02001654/**
1655 * @brief Update node value.
1656 *
1657 * @param[in] node Node to update.
1658 * @param[in] value New value to set.
1659 * @param[in] value_len Length of @p value.
1660 * @param[in] value_type Type of @p value for anydata/anyxml node.
1661 * @param[in] format Format of @p value.
1662 * @param[out] new_parent Set to @p node if the value was updated, otherwise set to NULL.
1663 * @param[out] new_node Set to @p node if the value was updated, otherwise set to NULL.
1664 * @return LY_ERR value.
1665 */
Michal Vasko6741dc62021-02-04 09:27:45 +01001666static LY_ERR
Radek Krejci09c77442021-04-26 11:10:34 +02001667lyd_new_path_update(struct lyd_node *node, const void *value, size_t value_len, LYD_ANYDATA_VALUETYPE value_type,
1668 LY_VALUE_FORMAT format, struct lyd_node **new_parent, struct lyd_node **new_node)
1669{
1670 LY_ERR ret = LY_SUCCESS;
1671 struct lyd_node *new_any;
1672
1673 switch (node->schema->nodetype) {
1674 case LYS_CONTAINER:
1675 case LYS_NOTIF:
1676 case LYS_RPC:
1677 case LYS_ACTION:
1678 case LYS_LIST:
1679 /* if it exists, there is nothing to update */
1680 *new_parent = NULL;
1681 *new_node = NULL;
1682 break;
1683 case LYS_LEAFLIST:
1684 if (!lysc_is_dup_inst_list(node->schema)) {
1685 /* if it exists, there is nothing to update */
1686 *new_parent = NULL;
1687 *new_node = NULL;
1688 break;
1689 }
1690 /* fallthrough */
1691 case LYS_LEAF:
1692 ret = _lyd_change_term(node, value, value_len, format);
1693 if ((ret == LY_SUCCESS) || (ret == LY_EEXIST)) {
1694 /* there was an actual change (at least of the default flag) */
1695 *new_parent = node;
1696 *new_node = node;
1697 ret = LY_SUCCESS;
1698 } else if (ret == LY_ENOT) {
1699 /* no change */
1700 *new_parent = NULL;
1701 *new_node = NULL;
1702 ret = LY_SUCCESS;
1703 } /* else error */
1704 break;
1705 case LYS_ANYDATA:
1706 case LYS_ANYXML:
1707 /* create a new any node */
1708 LY_CHECK_RET(lyd_create_any(node->schema, value, value_type, 0, &new_any));
1709
1710 /* compare with the existing one */
1711 if (lyd_compare_single(node, new_any, 0)) {
1712 /* not equal, switch values (so that we can use generic node free) */
1713 ((struct lyd_node_any *)new_any)->value = ((struct lyd_node_any *)node)->value;
1714 ((struct lyd_node_any *)new_any)->value_type = ((struct lyd_node_any *)node)->value_type;
1715 ((struct lyd_node_any *)node)->value.str = value;
1716 ((struct lyd_node_any *)node)->value_type = value_type;
1717
1718 *new_parent = node;
1719 *new_node = node;
1720 } else {
1721 /* they are equal */
1722 *new_parent = NULL;
1723 *new_node = NULL;
1724 }
1725 lyd_free_tree(new_any);
1726 break;
1727 default:
1728 LOGINT(LYD_CTX(node));
1729 ret = LY_EINT;
1730 break;
1731 }
1732
1733 return ret;
1734}
1735
1736static LY_ERR
1737lyd_new_path_check_find_lypath(struct ly_path *path, const char *str_path, const char *value, size_t value_len,
1738 LY_VALUE_FORMAT format, uint32_t options)
Michal Vasko6741dc62021-02-04 09:27:45 +01001739{
Michal Vaskoe78faec2021-04-08 17:24:43 +02001740 LY_ERR r;
Michal Vasko6741dc62021-02-04 09:27:45 +01001741 struct ly_path_predicate *pred;
Michal Vaskoe78faec2021-04-08 17:24:43 +02001742 const struct lysc_node *schema = NULL;
1743 LY_ARRAY_COUNT_TYPE u, new_count;
1744 int create = 0;
Michal Vasko6741dc62021-02-04 09:27:45 +01001745
1746 assert(path);
1747
1748 /* go through all the compiled nodes */
1749 LY_ARRAY_FOR(path, u) {
1750 schema = path[u].node;
Michal Vaskoe78faec2021-04-08 17:24:43 +02001751
1752 if (lysc_is_dup_inst_list(schema)) {
1753 if (path[u].pred_type == LY_PATH_PREDTYPE_NONE) {
1754 /* creating a new key-less list or state leaf-list instance */
1755 create = 1;
1756 new_count = u;
1757 } else if (path[u].pred_type != LY_PATH_PREDTYPE_POSITION) {
1758 LOG_LOCSET(schema, NULL, NULL, NULL);
1759 LOGVAL(schema->module->ctx, LYVE_XPATH, "Invalid predicate for %s \"%s\" in path \"%s\".",
1760 lys_nodetype2str(schema->nodetype), schema->name, str_path);
1761 LOG_LOCBACK(1, 0, 0, 0);
1762 return LY_EINVAL;
1763 }
1764 } else if ((schema->nodetype == LYS_LIST) && (path[u].pred_type != LY_PATH_PREDTYPE_LIST)) {
1765 if ((u < LY_ARRAY_COUNT(path) - 1) || !(options & LYD_NEW_PATH_OPAQ)) {
Michal Vasko6741dc62021-02-04 09:27:45 +01001766 LOG_LOCSET(schema, NULL, NULL, NULL);
1767 LOGVAL(schema->module->ctx, LYVE_XPATH, "Predicate missing for %s \"%s\" in path \"%s\".",
1768 lys_nodetype2str(schema->nodetype), schema->name, str_path);
1769 LOG_LOCBACK(1, 0, 0, 0);
1770 return LY_EINVAL;
Michal Vaskoe78faec2021-04-08 17:24:43 +02001771 } /* else creating an opaque list */
1772 } else if ((schema->nodetype == LYS_LEAFLIST) && (path[u].pred_type != LY_PATH_PREDTYPE_LEAFLIST)) {
Michal Vaskoe78faec2021-04-08 17:24:43 +02001773 r = LY_SUCCESS;
1774 if (options & LYD_NEW_PATH_OPAQ) {
Radek Krejci09c77442021-04-26 11:10:34 +02001775 r = lyd_value_validate(NULL, schema, value, value_len, NULL, NULL, NULL);
Michal Vaskoe78faec2021-04-08 17:24:43 +02001776 }
1777 if (!r) {
1778 /* store the new predicate so that it is used when searching for this instance */
1779 path[u].pred_type = LY_PATH_PREDTYPE_LEAFLIST;
1780 LY_ARRAY_NEW_RET(schema->module->ctx, path[u].predicates, pred, LY_EMEM);
1781
1782 LY_CHECK_RET(lyd_value_store(schema->module->ctx, &pred->value,
Radek Krejci09c77442021-04-26 11:10:34 +02001783 ((struct lysc_node_leaflist *)schema)->type, value, value_len, NULL, format, NULL,
Michal Vaskoe78faec2021-04-08 17:24:43 +02001784 LYD_HINT_DATA, schema, NULL));
1785 ++((struct lysc_type *)pred->value.realtype)->refcount;
1786 } /* else we have opaq flag and the value is not valid, leave no predicate and then create an opaque node */
1787 }
Michal Vasko6741dc62021-02-04 09:27:45 +01001788 }
1789
Michal Vaskoe78faec2021-04-08 17:24:43 +02001790 if (create) {
1791 /* hide the nodes that should always be created so they are not found */
1792 while (new_count < LY_ARRAY_COUNT(path)) {
1793 LY_ARRAY_DECREMENT(path);
1794 }
Michal Vasko6741dc62021-02-04 09:27:45 +01001795 }
1796
Michal Vaskoe78faec2021-04-08 17:24:43 +02001797 return LY_SUCCESS;
Michal Vasko6741dc62021-02-04 09:27:45 +01001798}
1799
Radek Krejci95ccd1b2021-03-12 14:57:22 +01001800/**
1801 * @brief Create a new node in the data tree based on a path. All node types can be created.
1802 *
Michal Vaskoa918a632021-07-02 11:53:36 +02001803 * If @p path points to a list key, the key value from the predicate is used and @p value is ignored.
1804 * Also, if a leaf-list is being created and both a predicate is defined in @p path
Radek Krejci95ccd1b2021-03-12 14:57:22 +01001805 * and @p value is set, the predicate is preferred.
1806 *
1807 * For key-less lists and state leaf-lists, positional predicates can be used. If no preciate is used for these
1808 * nodes, they are always created.
1809 *
1810 * @param[in] parent Data parent to add to/modify, can be NULL. Note that in case a first top-level sibling is used,
1811 * it may no longer be first if @p path is absolute and starts with a non-existing top-level node inserted
1812 * before @p parent. Use ::lyd_first_sibling() to adjust @p parent in these cases.
1813 * @param[in] ctx libyang context, must be set if @p parent is NULL.
1814 * @param[in] ext Extension instance where the node being created is defined. This argument takes effect only for absolute
1815 * path or when the relative paths touches document root (top-level). In such cases the present extension instance replaces
1816 * searching for the appropriate module.
1817 * @param[in] path [Path](@ref howtoXPath) to create.
Radek Krejci09c77442021-04-26 11:10:34 +02001818 * @param[in] value Value of the new leaf/leaf-list (const char *) in ::LY_VALUE_JSON format. If creating an
1819 * anyxml/anydata node, the expected type depends on @p value_type. For other node types, it should be NULL.
1820 * @param[in] value_len Length of @p value in bytes. May be 0 if @p value is a zero-terminated string. Ignored when
1821 * creating anyxml/anydata nodes.
Radek Krejci95ccd1b2021-03-12 14:57:22 +01001822 * @param[in] value_type Anyxml/anydata node @p value type.
1823 * @param[in] options Bitmask of options, see @ref pathoptions.
1824 * @param[out] new_parent Optional first parent node created. If only one node was created, equals to @p new_node.
1825 * @param[out] new_node Optional last node created.
1826 * @return LY_ERR value.
1827 */
1828static LY_ERR
1829lyd_new_path_(struct lyd_node *parent, const struct ly_ctx *ctx, const struct lysc_ext_instance *ext, const char *path,
Radek Krejci09c77442021-04-26 11:10:34 +02001830 const void *value, size_t value_len, LYD_ANYDATA_VALUETYPE value_type, uint32_t options,
Radek Krejci95ccd1b2021-03-12 14:57:22 +01001831 struct lyd_node **new_parent, struct lyd_node **new_node)
Michal Vasko00cbf532020-06-15 13:58:47 +02001832{
1833 LY_ERR ret = LY_SUCCESS, r;
1834 struct lyxp_expr *exp = NULL;
1835 struct ly_path *p = NULL;
1836 struct lyd_node *nparent = NULL, *nnode = NULL, *node = NULL, *cur_parent;
1837 const struct lysc_node *schema;
Michal Vaskoe78faec2021-04-08 17:24:43 +02001838 const struct lyd_value *val = NULL;
Radek Krejci910d0132021-03-05 14:19:31 +01001839 LY_ARRAY_COUNT_TYPE path_idx = 0, orig_count = 0;
Radek Krejci09c77442021-04-26 11:10:34 +02001840 LY_VALUE_FORMAT format;
Michal Vasko00cbf532020-06-15 13:58:47 +02001841
Radek Krejci95ccd1b2021-03-12 14:57:22 +01001842 assert(parent || ctx);
Radek Krejci09c77442021-04-26 11:10:34 +02001843 assert(path && ((path[0] == '/') || parent));
1844 assert(!(options & LYD_NEW_PATH_BIN_VALUE) || !(options & LYD_NEW_PATH_CANON_VALUE));
Michal Vasko00cbf532020-06-15 13:58:47 +02001845
1846 if (!ctx) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001847 ctx = LYD_CTX(parent);
Michal Vasko00cbf532020-06-15 13:58:47 +02001848 }
Radek Krejci09c77442021-04-26 11:10:34 +02001849 if (value && !value_len) {
1850 value_len = strlen(value);
1851 }
1852 if (options & LYD_NEW_PATH_BIN_VALUE) {
1853 format = LY_VALUE_LYB;
1854 } else if (options & LYD_NEW_PATH_CANON_VALUE) {
1855 format = LY_VALUE_CANON;
1856 } else {
1857 format = LY_VALUE_JSON;
1858 }
Michal Vasko00cbf532020-06-15 13:58:47 +02001859
1860 /* parse path */
Michal Vaskoed725d72021-06-23 12:03:45 +02001861 LY_CHECK_GOTO(ret = ly_path_parse(ctx, NULL, path, strlen(path), 0, LY_PATH_BEGIN_EITHER, LY_PATH_PREFIX_OPTIONAL,
1862 LY_PATH_PRED_SIMPLE, &exp), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001863
1864 /* compile path */
Michal Vaskoed725d72021-06-23 12:03:45 +02001865 LY_CHECK_GOTO(ret = ly_path_compile(ctx, NULL, parent ? parent->schema : NULL, ext, exp,
Michal Vasko0884d212021-10-14 09:21:46 +02001866 options & LYD_NEW_PATH_OUTPUT ? LY_PATH_OPER_OUTPUT : LY_PATH_OPER_INPUT, LY_PATH_TARGET_MANY, 0,
1867 LY_VALUE_JSON, NULL, &p), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001868
Michal Vasko6741dc62021-02-04 09:27:45 +01001869 /* check the compiled path before searching existing nodes, it may be shortened */
1870 orig_count = LY_ARRAY_COUNT(p);
Radek Krejci09c77442021-04-26 11:10:34 +02001871 LY_CHECK_GOTO(ret = lyd_new_path_check_find_lypath(p, path, value, value_len, format, options), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001872
1873 /* try to find any existing nodes in the path */
1874 if (parent) {
1875 ret = ly_path_eval_partial(p, parent, &path_idx, &node);
1876 if (ret == LY_SUCCESS) {
Michal Vasko6741dc62021-02-04 09:27:45 +01001877 if (orig_count == LY_ARRAY_COUNT(p)) {
1878 /* the node exists, are we supposed to update it or is it just a default? */
1879 if (!(options & LYD_NEW_PATH_UPDATE) && !(node->flags & LYD_DEFAULT)) {
1880 LOG_LOCSET(NULL, node, NULL, NULL);
1881 LOGVAL(ctx, LYVE_REFERENCE, "Path \"%s\" already exists", path);
1882 LOG_LOCBACK(0, 1, 0, 0);
1883 ret = LY_EEXIST;
1884 goto cleanup;
1885 }
Michal Vasko00cbf532020-06-15 13:58:47 +02001886
Michal Vasko6741dc62021-02-04 09:27:45 +01001887 /* update the existing node */
Radek Krejci09c77442021-04-26 11:10:34 +02001888 ret = lyd_new_path_update(node, value, value_len, value_type, format, &nparent, &nnode);
Michal Vasko6741dc62021-02-04 09:27:45 +01001889 goto cleanup;
1890 } /* else we were not searching for the whole path */
Michal Vasko00cbf532020-06-15 13:58:47 +02001891 } else if (ret == LY_EINCOMPLETE) {
1892 /* some nodes were found, adjust the iterator to the next segment */
1893 ++path_idx;
1894 } else if (ret == LY_ENOTFOUND) {
1895 /* 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 +01001896 if (lysc_data_parent(p[0].node)) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001897 node = parent;
1898 }
1899 } else {
1900 /* error */
1901 goto cleanup;
1902 }
1903 }
1904
Michal Vasko6741dc62021-02-04 09:27:45 +01001905 /* restore the full path for creating new nodes */
1906 while (orig_count > LY_ARRAY_COUNT(p)) {
1907 LY_ARRAY_INCREMENT(p);
1908 }
1909
Michal Vasko00cbf532020-06-15 13:58:47 +02001910 /* create all the non-existing nodes in a loop */
Michal Vaskod989ba02020-08-24 10:59:24 +02001911 for ( ; path_idx < LY_ARRAY_COUNT(p); ++path_idx) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001912 cur_parent = node;
1913 schema = p[path_idx].node;
1914
1915 switch (schema->nodetype) {
1916 case LYS_LIST:
Michal Vaskoe78faec2021-04-08 17:24:43 +02001917 if (lysc_is_dup_inst_list(schema)) {
1918 /* create key-less list instance */
1919 LY_CHECK_GOTO(ret = lyd_create_inner(schema, &node), cleanup);
1920 } else if ((options & LYD_NEW_PATH_OPAQ) && (p[path_idx].pred_type == LY_PATH_PREDTYPE_NONE)) {
1921 /* creating opaque list without keys */
1922 LY_CHECK_GOTO(ret = lyd_create_opaq(ctx, schema->name, strlen(schema->name), NULL, 0,
Radek Krejci8df109d2021-04-23 12:19:08 +02001923 schema->module->name, strlen(schema->module->name), NULL, 0, NULL, LY_VALUE_JSON, NULL,
Michal Vaskoe78faec2021-04-08 17:24:43 +02001924 LYD_NODEHINT_LIST, &node), cleanup);
1925 } else {
1926 /* create standard list instance */
1927 assert(p[path_idx].pred_type == LY_PATH_PREDTYPE_LIST);
1928 LY_CHECK_GOTO(ret = lyd_create_list(schema, p[path_idx].predicates, &node), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001929 }
Michal Vaskoe78faec2021-04-08 17:24:43 +02001930 break;
Michal Vasko00cbf532020-06-15 13:58:47 +02001931 case LYS_CONTAINER:
1932 case LYS_NOTIF:
1933 case LYS_RPC:
1934 case LYS_ACTION:
1935 LY_CHECK_GOTO(ret = lyd_create_inner(schema, &node), cleanup);
1936 break;
1937 case LYS_LEAFLIST:
Michal Vaskoe78faec2021-04-08 17:24:43 +02001938 if ((options & LYD_NEW_PATH_OPAQ) && (p[path_idx].pred_type != LY_PATH_PREDTYPE_LEAFLIST)) {
1939 /* we have not checked this only for dup-inst lists, otherwise it must be opaque */
1940 r = LY_EVALID;
1941 if (lysc_is_dup_inst_list(schema)) {
1942 /* validate value */
Radek Krejci09c77442021-04-26 11:10:34 +02001943 r = lyd_value_validate(NULL, schema, value ? value : "", value_len, NULL, NULL, NULL);
Michal Vaskoe78faec2021-04-08 17:24:43 +02001944 }
1945 if (r && (r != LY_EINCOMPLETE)) {
1946 /* creating opaque leaf-list */
Radek Krejci09c77442021-04-26 11:10:34 +02001947 LY_CHECK_GOTO(ret = lyd_create_opaq(ctx, schema->name, strlen(schema->name), value, value_len,
1948 schema->module->name, strlen(schema->module->name), NULL, 0, NULL, format, NULL,
1949 LYD_NODEHINT_LEAFLIST, &node), cleanup);
Michal Vaskoe78faec2021-04-08 17:24:43 +02001950 break;
1951 }
1952 }
1953
1954 /* get value to set */
1955 if (p[path_idx].pred_type == LY_PATH_PREDTYPE_LEAFLIST) {
1956 val = &p[path_idx].predicates[0].value;
Michal Vaskoe78faec2021-04-08 17:24:43 +02001957 }
1958
1959 /* create a leaf-list instance */
1960 if (val) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001961 LY_CHECK_GOTO(ret = lyd_create_term2(schema, &p[path_idx].predicates[0].value, &node), cleanup);
Michal Vaskoe78faec2021-04-08 17:24:43 +02001962 } else {
Radek Krejci09c77442021-04-26 11:10:34 +02001963 LY_CHECK_GOTO(ret = lyd_create_term(schema, value, value_len, NULL, format, NULL, LYD_HINT_DATA,
1964 NULL, &node), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001965 }
1966 break;
1967 case LYS_LEAF:
Michal Vasko35880332020-12-08 13:08:12 +01001968 if (lysc_is_key(schema)) {
1969 /* it must have been already created or some error will occur later */
1970 assert(cur_parent);
Michal Vaskoa918a632021-07-02 11:53:36 +02001971 lyd_find_sibling_schema(lyd_child(cur_parent), schema, &node);
1972 assert(node);
Michal Vasko35880332020-12-08 13:08:12 +01001973 goto next_iter;
1974 }
1975
Michal Vaskoe78faec2021-04-08 17:24:43 +02001976 if (options & LYD_NEW_PATH_OPAQ) {
1977 /* validate value */
Radek Krejci09c77442021-04-26 11:10:34 +02001978 r = lyd_value_validate(NULL, schema, value ? value : "", value_len, NULL, NULL, NULL);
Michal Vaskoe78faec2021-04-08 17:24:43 +02001979 if (r && (r != LY_EINCOMPLETE)) {
1980 /* creating opaque leaf */
Radek Krejci09c77442021-04-26 11:10:34 +02001981 LY_CHECK_GOTO(ret = lyd_create_opaq(ctx, schema->name, strlen(schema->name), value, value_len,
1982 schema->module->name, strlen(schema->module->name), NULL, 0, NULL, format, NULL, 0, &node),
1983 cleanup);
Michal Vaskoe78faec2021-04-08 17:24:43 +02001984 break;
1985 }
1986 }
1987
Michal Vaskoe78faec2021-04-08 17:24:43 +02001988 /* create a leaf instance */
Radek Krejci09c77442021-04-26 11:10:34 +02001989 LY_CHECK_GOTO(ret = lyd_create_term(schema, value, value_len, NULL, format, NULL, LYD_HINT_DATA, NULL,
1990 &node), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001991 break;
1992 case LYS_ANYDATA:
1993 case LYS_ANYXML:
Michal Vasko366a4a12020-12-04 16:23:57 +01001994 LY_CHECK_GOTO(ret = lyd_create_any(schema, value, value_type, 0, &node), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001995 break;
1996 default:
1997 LOGINT(ctx);
1998 ret = LY_EINT;
1999 goto cleanup;
2000 }
2001
2002 if (cur_parent) {
2003 /* connect to the parent */
Michal Vasko6ee6f432021-07-16 09:49:14 +02002004 lyd_insert_node(cur_parent, NULL, node, 0);
Michal Vasko00cbf532020-06-15 13:58:47 +02002005 } else if (parent) {
2006 /* connect to top-level siblings */
Michal Vasko6ee6f432021-07-16 09:49:14 +02002007 lyd_insert_node(NULL, &parent, node, 0);
Michal Vasko00cbf532020-06-15 13:58:47 +02002008 }
2009
Michal Vasko35880332020-12-08 13:08:12 +01002010next_iter:
Michal Vasko00cbf532020-06-15 13:58:47 +02002011 /* update remembered nodes */
2012 if (!nparent) {
2013 nparent = node;
2014 }
2015 nnode = node;
2016 }
2017
2018cleanup:
2019 lyxp_expr_free(ctx, exp);
Michal Vasko6741dc62021-02-04 09:27:45 +01002020 if (p) {
2021 while (orig_count > LY_ARRAY_COUNT(p)) {
2022 LY_ARRAY_INCREMENT(p);
2023 }
2024 }
Michal Vasko00cbf532020-06-15 13:58:47 +02002025 ly_path_free(ctx, p);
2026 if (!ret) {
2027 /* set out params only on success */
2028 if (new_parent) {
2029 *new_parent = nparent;
2030 }
2031 if (new_node) {
2032 *new_node = nnode;
2033 }
Michal Vaskof4b95ba2020-12-11 08:42:33 +01002034 } else {
2035 lyd_free_tree(nparent);
Michal Vasko00cbf532020-06-15 13:58:47 +02002036 }
2037 return ret;
2038}
2039
Radek Krejci95ccd1b2021-03-12 14:57:22 +01002040API LY_ERR
2041lyd_new_path(struct lyd_node *parent, const struct ly_ctx *ctx, const char *path, const char *value, uint32_t options,
2042 struct lyd_node **node)
2043{
Radek Krejci09c77442021-04-26 11:10:34 +02002044 LY_CHECK_ARG_RET(ctx, parent || ctx, path, (path[0] == '/') || parent,
2045 !(options & LYD_NEW_PATH_BIN_VALUE) || !(options & LYD_NEW_PATH_CANON_VALUE), LY_EINVAL);
2046
2047 return lyd_new_path_(parent, ctx, NULL, path, value, 0, LYD_ANYDATA_STRING, options, node, NULL);
Radek Krejci95ccd1b2021-03-12 14:57:22 +01002048}
2049
2050API LY_ERR
2051lyd_new_path2(struct lyd_node *parent, const struct ly_ctx *ctx, const char *path, const void *value,
Radek Krejci09c77442021-04-26 11:10:34 +02002052 size_t value_len, LYD_ANYDATA_VALUETYPE value_type, uint32_t options, struct lyd_node **new_parent,
2053 struct lyd_node **new_node)
Radek Krejci95ccd1b2021-03-12 14:57:22 +01002054{
Radek Krejci09c77442021-04-26 11:10:34 +02002055 LY_CHECK_ARG_RET(ctx, parent || ctx, path, (path[0] == '/') || parent,
2056 !(options & LYD_NEW_PATH_BIN_VALUE) || !(options & LYD_NEW_PATH_CANON_VALUE), LY_EINVAL);
2057 return lyd_new_path_(parent, ctx, NULL, path, value, value_len, value_type, options, new_parent, new_node);
Radek Krejci95ccd1b2021-03-12 14:57:22 +01002058}
2059
2060API LY_ERR
2061lyd_new_ext_path(struct lyd_node *parent, const struct lysc_ext_instance *ext, const char *path, const void *value,
2062 uint32_t options, struct lyd_node **node)
2063{
2064 const struct ly_ctx *ctx = ext ? ext->module->ctx : NULL;
2065
Radek Krejci09c77442021-04-26 11:10:34 +02002066 LY_CHECK_ARG_RET(ctx, ext, path, (path[0] == '/') || parent,
2067 !(options & LYD_NEW_PATH_BIN_VALUE) || !(options & LYD_NEW_PATH_CANON_VALUE), LY_EINVAL);
2068 return lyd_new_path_(parent, ctx, ext, path, value, 0, LYD_ANYDATA_STRING, options, node, NULL);
Radek Krejci95ccd1b2021-03-12 14:57:22 +01002069}
2070
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002071LY_ERR
2072lyd_new_implicit_r(struct lyd_node *parent, struct lyd_node **first, const struct lysc_node *sparent,
Radek Krejci4f2e3e52021-03-30 14:20:28 +02002073 const struct lys_module *mod, struct ly_set *node_when, struct ly_set *node_exts, struct ly_set *node_types,
2074 uint32_t impl_opts, struct lyd_node **diff)
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002075{
2076 LY_ERR ret;
Michal Vaskod1e53b92021-01-28 13:11:06 +01002077 const struct lysc_node *iter = NULL;
Radek Krejci2b18bf12020-11-06 11:20:20 +01002078 struct lyd_node *node = NULL;
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002079 struct lyd_value **dflts;
2080 LY_ARRAY_COUNT_TYPE u;
Michal Vasko630d9892020-12-08 17:11:08 +01002081 uint32_t getnext_opts;
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002082
2083 assert(first && (parent || sparent || mod));
2084
2085 if (!sparent && parent) {
2086 sparent = parent->schema;
2087 }
2088
Michal Vasko630d9892020-12-08 17:11:08 +01002089 getnext_opts = LYS_GETNEXT_WITHCHOICE;
2090 if (impl_opts & LYD_IMPLICIT_OUTPUT) {
2091 getnext_opts |= LYS_GETNEXT_OUTPUT;
2092 }
2093
2094 while ((iter = lys_getnext(iter, sparent, mod ? mod->compiled : NULL, getnext_opts))) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002095 if ((impl_opts & LYD_IMPLICIT_NO_STATE) && (iter->flags & LYS_CONFIG_R)) {
2096 continue;
Michal Vasko44b19a12020-08-07 09:21:30 +02002097 } else if ((impl_opts & LYD_IMPLICIT_NO_CONFIG) && (iter->flags & LYS_CONFIG_W)) {
2098 continue;
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002099 }
2100
2101 switch (iter->nodetype) {
2102 case LYS_CHOICE:
Michal Vaskobcf4d7d2020-11-18 18:16:49 +01002103 node = lys_getnext_data(NULL, *first, NULL, iter, NULL);
2104 if (!node && ((struct lysc_node_choice *)iter)->dflt) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002105 /* create default case data */
Michal Vasko14ed9cd2021-01-28 14:16:25 +01002106 LY_CHECK_RET(lyd_new_implicit_r(parent, first, &((struct lysc_node_choice *)iter)->dflt->node,
Radek Krejci4f2e3e52021-03-30 14:20:28 +02002107 NULL, node_when, node_exts, node_types, impl_opts, diff));
Michal Vaskobcf4d7d2020-11-18 18:16:49 +01002108 } else if (node) {
2109 /* create any default data in the existing case */
2110 assert(node->schema->parent->nodetype == LYS_CASE);
Radek Krejci4f2e3e52021-03-30 14:20:28 +02002111 LY_CHECK_RET(lyd_new_implicit_r(parent, first, node->schema->parent, NULL, node_when, node_exts, node_types,
Michal Vaskobcf4d7d2020-11-18 18:16:49 +01002112 impl_opts, diff));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002113 }
2114 break;
2115 case LYS_CONTAINER:
2116 if (!(iter->flags & LYS_PRESENCE) && lyd_find_sibling_val(*first, iter, NULL, 0, NULL)) {
2117 /* create default NP container */
2118 LY_CHECK_RET(lyd_create_inner(iter, &node));
Michal Vaskof4d67ea2021-03-31 13:53:21 +02002119 node->flags = LYD_DEFAULT | (lysc_has_when(iter) ? LYD_WHEN_TRUE : 0);
Michal Vasko6ee6f432021-07-16 09:49:14 +02002120 lyd_insert_node(parent, first, node, 0);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002121
Michal Vaskof4d67ea2021-03-31 13:53:21 +02002122 if (lysc_has_when(iter) && node_when) {
Michal Vaskoe16c7b72021-02-26 10:39:06 +01002123 /* remember to resolve when */
2124 LY_CHECK_RET(ly_set_add(node_when, node, 1, NULL));
2125 }
Radek Krejci4f2e3e52021-03-30 14:20:28 +02002126 if (node_exts) {
2127 /* remember to call all the extension's validation callbacks */
2128 LY_CHECK_RET(lysc_node_ext_tovalidate(node_exts, node));
2129 }
Michal Vaskoe49b6322020-11-05 17:38:36 +01002130 if (diff) {
2131 /* add into diff */
2132 LY_CHECK_RET(lyd_val_diff_add(node, LYD_DIFF_OP_CREATE, diff));
2133 }
2134
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002135 /* create any default children */
Radek Krejci4f2e3e52021-03-30 14:20:28 +02002136 LY_CHECK_RET(lyd_new_implicit_r(node, lyd_node_child_p(node), NULL, NULL, node_when, node_exts, node_types,
Michal Vasko69730152020-10-09 16:30:07 +02002137 impl_opts, diff));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002138 }
2139 break;
2140 case LYS_LEAF:
Michal Vasko69730152020-10-09 16:30:07 +02002141 if (!(impl_opts & LYD_IMPLICIT_NO_DEFAULTS) && ((struct lysc_node_leaf *)iter)->dflt &&
2142 lyd_find_sibling_val(*first, iter, NULL, 0, NULL)) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002143 /* create default leaf */
2144 ret = lyd_create_term2(iter, ((struct lysc_node_leaf *)iter)->dflt, &node);
2145 if (ret == LY_EINCOMPLETE) {
2146 if (node_types) {
2147 /* remember to resolve type */
Radek Krejci3d92e442020-10-12 12:48:13 +02002148 LY_CHECK_RET(ly_set_add(node_types, node, 1, NULL));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002149 }
2150 } else if (ret) {
2151 return ret;
2152 }
Michal Vaskof4d67ea2021-03-31 13:53:21 +02002153 node->flags = LYD_DEFAULT | (lysc_has_when(iter) ? LYD_WHEN_TRUE : 0);
Michal Vasko6ee6f432021-07-16 09:49:14 +02002154 lyd_insert_node(parent, first, node, 0);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002155
Michal Vaskof4d67ea2021-03-31 13:53:21 +02002156 if (lysc_has_when(iter) && node_when) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002157 /* remember to resolve when */
Radek Krejci3d92e442020-10-12 12:48:13 +02002158 LY_CHECK_RET(ly_set_add(node_when, node, 1, NULL));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002159 }
Radek Krejci4f2e3e52021-03-30 14:20:28 +02002160 if (node_exts) {
2161 /* remember to call all the extension's validation callbacks */
2162 LY_CHECK_RET(lysc_node_ext_tovalidate(node_exts, node));
2163 }
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002164 if (diff) {
2165 /* add into diff */
2166 LY_CHECK_RET(lyd_val_diff_add(node, LYD_DIFF_OP_CREATE, diff));
2167 }
2168 }
2169 break;
2170 case LYS_LEAFLIST:
Michal Vasko69730152020-10-09 16:30:07 +02002171 if (!(impl_opts & LYD_IMPLICIT_NO_DEFAULTS) && ((struct lysc_node_leaflist *)iter)->dflts &&
2172 lyd_find_sibling_val(*first, iter, NULL, 0, NULL)) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002173 /* create all default leaf-lists */
2174 dflts = ((struct lysc_node_leaflist *)iter)->dflts;
2175 LY_ARRAY_FOR(dflts, u) {
2176 ret = lyd_create_term2(iter, dflts[u], &node);
2177 if (ret == LY_EINCOMPLETE) {
2178 if (node_types) {
2179 /* remember to resolve type */
Radek Krejci3d92e442020-10-12 12:48:13 +02002180 LY_CHECK_RET(ly_set_add(node_types, node, 1, NULL));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002181 }
2182 } else if (ret) {
2183 return ret;
2184 }
Michal Vaskof4d67ea2021-03-31 13:53:21 +02002185 node->flags = LYD_DEFAULT | (lysc_has_when(iter) ? LYD_WHEN_TRUE : 0);
Michal Vasko6ee6f432021-07-16 09:49:14 +02002186 lyd_insert_node(parent, first, node, 0);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002187
Michal Vaskof4d67ea2021-03-31 13:53:21 +02002188 if (lysc_has_when(iter) && node_when) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002189 /* remember to resolve when */
Radek Krejci3d92e442020-10-12 12:48:13 +02002190 LY_CHECK_RET(ly_set_add(node_when, node, 1, NULL));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002191 }
Radek Krejci4f2e3e52021-03-30 14:20:28 +02002192 if (node_exts) {
2193 /* remember to call all the extension's validation callbacks */
2194 LY_CHECK_RET(lysc_node_ext_tovalidate(node_exts, node));
2195 }
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002196 if (diff) {
2197 /* add into diff */
2198 LY_CHECK_RET(lyd_val_diff_add(node, LYD_DIFF_OP_CREATE, diff));
2199 }
2200 }
2201 }
2202 break;
2203 default:
2204 /* without defaults */
2205 break;
2206 }
2207 }
2208
2209 return LY_SUCCESS;
2210}
2211
2212API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02002213lyd_new_implicit_tree(struct lyd_node *tree, uint32_t implicit_options, struct lyd_node **diff)
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002214{
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002215 LY_ERR ret = LY_SUCCESS;
Michal Vasko3488ada2020-12-03 14:18:19 +01002216 struct lyd_node *node;
Radek Krejci4f2e3e52021-03-30 14:20:28 +02002217 struct ly_set node_when = {0}, node_exts = {0};
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002218
2219 LY_CHECK_ARG_RET(NULL, tree, LY_EINVAL);
2220 if (diff) {
2221 *diff = NULL;
2222 }
2223
Michal Vasko56daf732020-08-10 10:57:18 +02002224 LYD_TREE_DFS_BEGIN(tree, node) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002225 /* skip added default nodes */
Michal Vasko69730152020-10-09 16:30:07 +02002226 if (((node->flags & (LYD_DEFAULT | LYD_NEW)) != (LYD_DEFAULT | LYD_NEW)) &&
2227 (node->schema->nodetype & LYD_NODE_INNER)) {
Radek Krejci4f2e3e52021-03-30 14:20:28 +02002228 LY_CHECK_GOTO(ret = lyd_new_implicit_r(node, lyd_node_child_p(node), NULL, NULL, &node_when, &node_exts,
Michal Vaskoc43c8ab2021-03-05 13:32:44 +01002229 NULL, implicit_options, diff), cleanup);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002230 }
2231
Michal Vasko56daf732020-08-10 10:57:18 +02002232 LYD_TREE_DFS_END(tree, node);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002233 }
2234
Michal Vasko3488ada2020-12-03 14:18:19 +01002235 /* resolve when and remove any invalid defaults */
Radek Krejci4f2e3e52021-03-30 14:20:28 +02002236 LY_CHECK_GOTO(ret = lyd_validate_unres(&tree, NULL, &node_when, &node_exts, NULL, NULL, diff), cleanup);
Michal Vasko3488ada2020-12-03 14:18:19 +01002237
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002238cleanup:
Michal Vasko3488ada2020-12-03 14:18:19 +01002239 ly_set_erase(&node_when, NULL);
Radek Krejci4f2e3e52021-03-30 14:20:28 +02002240 ly_set_erase(&node_exts, NULL);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002241 if (ret && diff) {
2242 lyd_free_all(*diff);
2243 *diff = NULL;
2244 }
2245 return ret;
2246}
2247
2248API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02002249lyd_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 +02002250{
2251 const struct lys_module *mod;
2252 struct lyd_node *d = NULL;
2253 uint32_t i = 0;
2254 LY_ERR ret = LY_SUCCESS;
2255
2256 LY_CHECK_ARG_RET(ctx, tree, *tree || ctx, LY_EINVAL);
2257 if (diff) {
2258 *diff = NULL;
2259 }
2260 if (!ctx) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02002261 ctx = LYD_CTX(*tree);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002262 }
2263
2264 /* add nodes for each module one-by-one */
2265 while ((mod = ly_ctx_get_module_iter(ctx, &i))) {
2266 if (!mod->implemented) {
2267 continue;
2268 }
2269
2270 LY_CHECK_GOTO(ret = lyd_new_implicit_module(tree, mod, implicit_options, diff ? &d : NULL), cleanup);
2271 if (d) {
2272 /* merge into one diff */
2273 lyd_insert_sibling(*diff, d, diff);
2274
2275 d = NULL;
2276 }
2277 }
2278
2279cleanup:
2280 if (ret && diff) {
2281 lyd_free_all(*diff);
2282 *diff = NULL;
2283 }
2284 return ret;
2285}
2286
2287API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02002288lyd_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 +02002289{
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002290 LY_ERR ret = LY_SUCCESS;
Michal Vasko3488ada2020-12-03 14:18:19 +01002291 struct lyd_node *root, *d = NULL;
Radek Krejci4f2e3e52021-03-30 14:20:28 +02002292 struct ly_set node_when = {0}, node_exts = {0};
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002293
2294 LY_CHECK_ARG_RET(NULL, tree, module, LY_EINVAL);
2295 if (diff) {
2296 *diff = NULL;
2297 }
2298
2299 /* add all top-level defaults for this module */
Radek Krejci4f2e3e52021-03-30 14:20:28 +02002300 LY_CHECK_GOTO(ret = lyd_new_implicit_r(NULL, tree, NULL, module, &node_when, &node_exts, NULL, implicit_options, diff), cleanup);
Michal Vasko3488ada2020-12-03 14:18:19 +01002301
2302 /* resolve when and remove any invalid defaults */
Radek Krejci4f2e3e52021-03-30 14:20:28 +02002303 LY_CHECK_GOTO(ret = lyd_validate_unres(tree, module, &node_when, &node_exts, NULL, NULL, diff), cleanup);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002304
2305 /* process nested nodes */
2306 LY_LIST_FOR(*tree, root) {
2307 /* skip added default nodes */
2308 if ((root->flags & (LYD_DEFAULT | LYD_NEW)) != (LYD_DEFAULT | LYD_NEW)) {
2309 LY_CHECK_GOTO(ret = lyd_new_implicit_tree(root, implicit_options, diff ? &d : NULL), cleanup);
2310
2311 if (d) {
2312 /* merge into one diff */
2313 lyd_insert_sibling(*diff, d, diff);
2314
2315 d = NULL;
2316 }
2317 }
2318 }
2319
2320cleanup:
Michal Vasko3488ada2020-12-03 14:18:19 +01002321 ly_set_erase(&node_when, NULL);
Radek Krejci4f2e3e52021-03-30 14:20:28 +02002322 ly_set_erase(&node_exts, NULL);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002323 if (ret && diff) {
2324 lyd_free_all(*diff);
2325 *diff = NULL;
2326 }
2327 return ret;
2328}
2329
Michal Vasko90932a92020-02-12 14:33:03 +01002330struct lyd_node *
Michal Vaskob104f112020-07-17 09:54:54 +02002331lyd_insert_get_next_anchor(const struct lyd_node *first_sibling, const struct lyd_node *new_node)
Michal Vasko90932a92020-02-12 14:33:03 +01002332{
Michal Vaskob104f112020-07-17 09:54:54 +02002333 const struct lysc_node *schema, *sparent;
Michal Vasko90932a92020-02-12 14:33:03 +01002334 struct lyd_node *match = NULL;
Radek Krejci857189e2020-09-01 13:26:36 +02002335 ly_bool found;
Michal Vasko93b16062020-12-09 18:14:18 +01002336 uint32_t getnext_opts;
Michal Vasko90932a92020-02-12 14:33:03 +01002337
Michal Vaskob104f112020-07-17 09:54:54 +02002338 assert(new_node);
2339
2340 if (!first_sibling || !new_node->schema) {
2341 /* insert at the end, no next anchor */
Michal Vasko90932a92020-02-12 14:33:03 +01002342 return NULL;
2343 }
2344
Michal Vasko93b16062020-12-09 18:14:18 +01002345 getnext_opts = 0;
Michal Vaskod1e53b92021-01-28 13:11:06 +01002346 if (new_node->schema->flags & LYS_IS_OUTPUT) {
Michal Vasko93b16062020-12-09 18:14:18 +01002347 getnext_opts = LYS_GETNEXT_OUTPUT;
2348 }
2349
Michal Vaskoa2756f02021-07-09 13:20:28 +02002350 if (first_sibling->parent && first_sibling->parent->schema && first_sibling->parent->children_ht) {
Michal Vaskob104f112020-07-17 09:54:54 +02002351 /* find the anchor using hashes */
2352 sparent = first_sibling->parent->schema;
Michal Vasko93b16062020-12-09 18:14:18 +01002353 schema = lys_getnext(new_node->schema, sparent, NULL, getnext_opts);
Michal Vaskob104f112020-07-17 09:54:54 +02002354 while (schema) {
2355 /* keep trying to find the first existing instance of the closest following schema sibling,
2356 * otherwise return NULL - inserting at the end */
2357 if (!lyd_find_sibling_schema(first_sibling, schema, &match)) {
2358 break;
2359 }
2360
Michal Vasko93b16062020-12-09 18:14:18 +01002361 schema = lys_getnext(schema, sparent, NULL, getnext_opts);
Michal Vaskob104f112020-07-17 09:54:54 +02002362 }
2363 } else {
2364 /* find the anchor without hashes */
2365 match = (struct lyd_node *)first_sibling;
Michal Vasko3a708622021-07-15 14:20:10 +02002366 sparent = lysc_data_parent(new_node->schema);
2367 if (!sparent) {
Michal Vaskob104f112020-07-17 09:54:54 +02002368 /* we are in top-level, skip all the data from preceding modules */
2369 LY_LIST_FOR(match, match) {
2370 if (!match->schema || (strcmp(lyd_owner_module(match)->name, lyd_owner_module(new_node)->name) >= 0)) {
2371 break;
2372 }
2373 }
2374 }
2375
2376 /* get the first schema sibling */
Michal Vasko93b16062020-12-09 18:14:18 +01002377 schema = lys_getnext(NULL, sparent, new_node->schema->module->compiled, getnext_opts);
Michal Vaskob104f112020-07-17 09:54:54 +02002378
2379 found = 0;
2380 LY_LIST_FOR(match, match) {
2381 if (!match->schema || (lyd_owner_module(match) != lyd_owner_module(new_node))) {
2382 /* we have found an opaque node, which must be at the end, so use it OR
2383 * modules do not match, so we must have traversed all the data from new_node module (if any),
2384 * we have found the first node of the next module, that is what we want */
2385 break;
2386 }
2387
2388 /* skip schema nodes until we find the instantiated one */
2389 while (!found) {
2390 if (new_node->schema == schema) {
2391 /* we have found the schema of the new node, continue search to find the first
2392 * data node with a different schema (after our schema) */
2393 found = 1;
2394 break;
2395 }
2396 if (match->schema == schema) {
2397 /* current node (match) is a data node still before the new node, continue search in data */
2398 break;
2399 }
Michal Vasko93b16062020-12-09 18:14:18 +01002400 schema = lys_getnext(schema, sparent, new_node->schema->module->compiled, getnext_opts);
Michal Vaskob104f112020-07-17 09:54:54 +02002401 assert(schema);
2402 }
2403
2404 if (found && (match->schema != new_node->schema)) {
2405 /* find the next node after we have found our node schema data instance */
2406 break;
2407 }
2408 }
Michal Vasko90932a92020-02-12 14:33:03 +01002409 }
2410
2411 return match;
2412}
2413
2414/**
2415 * @brief Insert node after a sibling.
2416 *
Michal Vasko9f96a052020-03-10 09:41:45 +01002417 * Handles inserting into NP containers and key-less lists.
2418 *
Michal Vasko90932a92020-02-12 14:33:03 +01002419 * @param[in] sibling Sibling to insert after.
2420 * @param[in] node Node to insert.
2421 */
2422static void
Michal Vaskof03ed032020-03-04 13:31:44 +01002423lyd_insert_after_node(struct lyd_node *sibling, struct lyd_node *node)
Michal Vasko90932a92020-02-12 14:33:03 +01002424{
Michal Vasko0249f7c2020-03-05 16:36:40 +01002425 struct lyd_node_inner *par;
2426
Michal Vasko90932a92020-02-12 14:33:03 +01002427 assert(!node->next && (node->prev == node));
2428
2429 node->next = sibling->next;
2430 node->prev = sibling;
2431 sibling->next = node;
2432 if (node->next) {
2433 /* sibling had a succeeding node */
2434 node->next->prev = node;
2435 } else {
2436 /* sibling was last, find first sibling and change its prev */
2437 if (sibling->parent) {
2438 sibling = sibling->parent->child;
2439 } else {
Michal Vaskod989ba02020-08-24 10:59:24 +02002440 for ( ; sibling->prev->next != node; sibling = sibling->prev) {}
Michal Vasko90932a92020-02-12 14:33:03 +01002441 }
2442 sibling->prev = node;
2443 }
2444 node->parent = sibling->parent;
Michal Vasko0249f7c2020-03-05 16:36:40 +01002445
Michal Vasko9f96a052020-03-10 09:41:45 +01002446 for (par = node->parent; par; par = par->parent) {
2447 if ((par->flags & LYD_DEFAULT) && !(node->flags & LYD_DEFAULT)) {
2448 /* remove default flags from NP containers */
Michal Vasko0249f7c2020-03-05 16:36:40 +01002449 par->flags &= ~LYD_DEFAULT;
2450 }
2451 }
Michal Vasko90932a92020-02-12 14:33:03 +01002452}
2453
2454/**
2455 * @brief Insert node before a sibling.
2456 *
Michal Vasko9f96a052020-03-10 09:41:45 +01002457 * Handles inserting into NP containers and key-less lists.
2458 *
Michal Vasko90932a92020-02-12 14:33:03 +01002459 * @param[in] sibling Sibling to insert before.
2460 * @param[in] node Node to insert.
2461 */
2462static void
Michal Vaskof03ed032020-03-04 13:31:44 +01002463lyd_insert_before_node(struct lyd_node *sibling, struct lyd_node *node)
Michal Vasko90932a92020-02-12 14:33:03 +01002464{
Michal Vasko0249f7c2020-03-05 16:36:40 +01002465 struct lyd_node_inner *par;
2466
Michal Vasko90932a92020-02-12 14:33:03 +01002467 assert(!node->next && (node->prev == node));
2468
2469 node->next = sibling;
2470 /* covers situation of sibling being first */
2471 node->prev = sibling->prev;
2472 sibling->prev = node;
2473 if (node->prev->next) {
2474 /* sibling had a preceding node */
2475 node->prev->next = node;
2476 } else if (sibling->parent) {
2477 /* sibling was first and we must also change parent child pointer */
2478 sibling->parent->child = node;
2479 }
2480 node->parent = sibling->parent;
Michal Vasko0249f7c2020-03-05 16:36:40 +01002481
Michal Vasko9f96a052020-03-10 09:41:45 +01002482 for (par = node->parent; par; par = par->parent) {
2483 if ((par->flags & LYD_DEFAULT) && !(node->flags & LYD_DEFAULT)) {
2484 /* remove default flags from NP containers */
Michal Vasko0249f7c2020-03-05 16:36:40 +01002485 par->flags &= ~LYD_DEFAULT;
2486 }
2487 }
Michal Vasko90932a92020-02-12 14:33:03 +01002488}
2489
2490/**
Michal Vaskob104f112020-07-17 09:54:54 +02002491 * @brief Insert node as the first and only child of a parent.
Michal Vasko90932a92020-02-12 14:33:03 +01002492 *
Michal Vasko9f96a052020-03-10 09:41:45 +01002493 * Handles inserting into NP containers and key-less lists.
2494 *
Michal Vasko90932a92020-02-12 14:33:03 +01002495 * @param[in] parent Parent to insert into.
2496 * @param[in] node Node to insert.
2497 */
2498static void
Michal Vaskob104f112020-07-17 09:54:54 +02002499lyd_insert_only_child(struct lyd_node *parent, struct lyd_node *node)
Michal Vasko90932a92020-02-12 14:33:03 +01002500{
2501 struct lyd_node_inner *par;
2502
Radek Krejcia1c1e542020-09-29 16:06:52 +02002503 assert(parent && !lyd_child(parent) && !node->next && (node->prev == node));
Michal Vasko52927e22020-03-16 17:26:14 +01002504 assert(!parent->schema || (parent->schema->nodetype & LYD_NODE_INNER));
Michal Vasko90932a92020-02-12 14:33:03 +01002505
2506 par = (struct lyd_node_inner *)parent;
2507
Michal Vaskob104f112020-07-17 09:54:54 +02002508 par->child = node;
Michal Vasko90932a92020-02-12 14:33:03 +01002509 node->parent = par;
Michal Vasko0249f7c2020-03-05 16:36:40 +01002510
Michal Vaskod989ba02020-08-24 10:59:24 +02002511 for ( ; par; par = par->parent) {
Michal Vasko9f96a052020-03-10 09:41:45 +01002512 if ((par->flags & LYD_DEFAULT) && !(node->flags & LYD_DEFAULT)) {
2513 /* remove default flags from NP containers */
Michal Vasko0249f7c2020-03-05 16:36:40 +01002514 par->flags &= ~LYD_DEFAULT;
2515 }
2516 }
Michal Vasko751cb4d2020-07-14 12:25:28 +02002517}
Michal Vasko0249f7c2020-03-05 16:36:40 +01002518
Michal Vasko751cb4d2020-07-14 12:25:28 +02002519/**
2520 * @brief Learn whether a list instance has all the keys.
2521 *
2522 * @param[in] list List instance to check.
2523 * @return non-zero if all the keys were found,
2524 * @return 0 otherwise.
2525 */
2526static int
2527lyd_insert_has_keys(const struct lyd_node *list)
2528{
2529 const struct lyd_node *key;
2530 const struct lysc_node *skey = NULL;
2531
2532 assert(list->schema->nodetype == LYS_LIST);
Radek Krejcia1c1e542020-09-29 16:06:52 +02002533 key = lyd_child(list);
Michal Vasko751cb4d2020-07-14 12:25:28 +02002534 while ((skey = lys_getnext(skey, list->schema, NULL, 0)) && (skey->flags & LYS_KEY)) {
2535 if (!key || (key->schema != skey)) {
2536 /* key missing */
2537 return 0;
2538 }
2539
2540 key = key->next;
2541 }
2542
2543 /* all keys found */
2544 return 1;
Michal Vasko90932a92020-02-12 14:33:03 +01002545}
2546
2547void
Michal Vasko6ee6f432021-07-16 09:49:14 +02002548lyd_insert_node(struct lyd_node *parent, struct lyd_node **first_sibling_p, struct lyd_node *node, ly_bool last)
Michal Vasko90932a92020-02-12 14:33:03 +01002549{
Michal Vaskob104f112020-07-17 09:54:54 +02002550 struct lyd_node *anchor, *first_sibling;
Michal Vasko90932a92020-02-12 14:33:03 +01002551
Michal Vaskob104f112020-07-17 09:54:54 +02002552 /* inserting list without its keys is not supported */
2553 assert((parent || first_sibling_p) && node && (node->hash || !node->schema));
Michal Vaskof756c942020-11-06 17:21:37 +01002554 assert(!parent || !parent->schema ||
2555 (parent->schema->nodetype & (LYS_CONTAINER | LYS_LIST | LYS_RPC | LYS_ACTION | LYS_NOTIF)));
Michal Vasko9b368d32020-02-14 13:53:31 +01002556
Michal Vaskob104f112020-07-17 09:54:54 +02002557 if (!parent && first_sibling_p && (*first_sibling_p) && (*first_sibling_p)->parent) {
Michal Vasko9e685082021-01-29 14:49:09 +01002558 parent = lyd_parent(*first_sibling_p);
Michal Vasko9b368d32020-02-14 13:53:31 +01002559 }
Michal Vasko90932a92020-02-12 14:33:03 +01002560
Michal Vaskob104f112020-07-17 09:54:54 +02002561 /* get first sibling */
Michal Vasko9e685082021-01-29 14:49:09 +01002562 first_sibling = parent ? lyd_child(parent) : *first_sibling_p;
Michal Vasko9f96a052020-03-10 09:41:45 +01002563
Michal Vasko6ee6f432021-07-16 09:49:14 +02002564 if (last) {
2565 /* no next anchor */
2566 anchor = NULL;
2567 } else {
2568 /* find the anchor, our next node, so we can insert before it */
2569 anchor = lyd_insert_get_next_anchor(first_sibling, node);
2570 }
2571
Michal Vaskob104f112020-07-17 09:54:54 +02002572 if (anchor) {
Michal Vasko6ee6f432021-07-16 09:49:14 +02002573 /* insert before the anchor */
Michal Vaskob104f112020-07-17 09:54:54 +02002574 lyd_insert_before_node(anchor, node);
Michal Vasko26123192020-11-09 21:02:34 +01002575 if (!parent && (*first_sibling_p == anchor)) {
2576 /* move first sibling */
2577 *first_sibling_p = node;
2578 }
Michal Vaskob104f112020-07-17 09:54:54 +02002579 } else if (first_sibling) {
Michal Vasko6ee6f432021-07-16 09:49:14 +02002580 /* insert as the last node */
Michal Vaskob104f112020-07-17 09:54:54 +02002581 lyd_insert_after_node(first_sibling->prev, node);
2582 } else if (parent) {
Michal Vasko6ee6f432021-07-16 09:49:14 +02002583 /* insert as the only child */
Michal Vaskob104f112020-07-17 09:54:54 +02002584 lyd_insert_only_child(parent, node);
Michal Vasko90932a92020-02-12 14:33:03 +01002585 } else {
Michal Vasko6ee6f432021-07-16 09:49:14 +02002586 /* insert as the only sibling */
Michal Vaskob104f112020-07-17 09:54:54 +02002587 *first_sibling_p = node;
2588 }
2589
2590 /* insert into parent HT */
2591 lyd_insert_hash(node);
2592
2593 /* finish hashes for our parent, if needed and possible */
Michal Vasko9e8de2d2020-09-01 08:17:10 +02002594 if (node->schema && (node->schema->flags & LYS_KEY) && parent && lyd_insert_has_keys(parent)) {
Michal Vaskob104f112020-07-17 09:54:54 +02002595 lyd_hash(parent);
2596
2597 /* now we can insert even the list into its parent HT */
2598 lyd_insert_hash(parent);
Michal Vasko90932a92020-02-12 14:33:03 +01002599 }
Michal Vasko90932a92020-02-12 14:33:03 +01002600}
2601
Michal Vasko717a4c32020-12-07 09:40:10 +01002602/**
2603 * @brief Check schema place of a node to be inserted.
2604 *
2605 * @param[in] parent Schema node of the parent data node.
2606 * @param[in] sibling Schema node of a sibling data node.
2607 * @param[in] schema Schema node if the data node to be inserted.
2608 * @return LY_SUCCESS on success.
2609 * @return LY_EINVAL if the place is invalid.
2610 */
Michal Vaskof03ed032020-03-04 13:31:44 +01002611static LY_ERR
Michal Vasko717a4c32020-12-07 09:40:10 +01002612lyd_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 +01002613{
2614 const struct lysc_node *par2;
2615
Michal Vasko62ed12d2020-05-21 10:08:25 +02002616 assert(!parent || !(parent->nodetype & (LYS_CASE | LYS_CHOICE)));
Michal Vasko717a4c32020-12-07 09:40:10 +01002617 assert(!sibling || !(sibling->nodetype & (LYS_CASE | LYS_CHOICE)));
2618 assert(!schema || !(schema->nodetype & (LYS_CASE | LYS_CHOICE)));
Michal Vaskof03ed032020-03-04 13:31:44 +01002619
Michal Vasko717a4c32020-12-07 09:40:10 +01002620 if (!schema || (!parent && !sibling)) {
Michal Vasko71e795e2020-12-04 16:27:37 +01002621 /* opaque nodes can be inserted wherever */
2622 return LY_SUCCESS;
2623 }
2624
Michal Vasko717a4c32020-12-07 09:40:10 +01002625 if (!parent) {
2626 parent = lysc_data_parent(sibling);
2627 }
2628
Michal Vaskof03ed032020-03-04 13:31:44 +01002629 /* find schema parent */
Michal Vasko62ed12d2020-05-21 10:08:25 +02002630 par2 = lysc_data_parent(schema);
Michal Vaskof03ed032020-03-04 13:31:44 +01002631
2632 if (parent) {
2633 /* inner node */
2634 if (par2 != parent) {
Michal Vaskob104f112020-07-17 09:54:54 +02002635 LOGERR(schema->module->ctx, LY_EINVAL, "Cannot insert, parent of \"%s\" is not \"%s\".", schema->name,
Michal Vasko69730152020-10-09 16:30:07 +02002636 parent->name);
Michal Vaskof03ed032020-03-04 13:31:44 +01002637 return LY_EINVAL;
2638 }
2639 } else {
2640 /* top-level node */
2641 if (par2) {
Radek Krejcif6d14cb2020-07-02 16:11:45 +02002642 LOGERR(schema->module->ctx, LY_EINVAL, "Cannot insert, node \"%s\" is not top-level.", schema->name);
Michal Vaskof03ed032020-03-04 13:31:44 +01002643 return LY_EINVAL;
2644 }
2645 }
2646
2647 return LY_SUCCESS;
2648}
2649
2650API LY_ERR
Michal Vaskob104f112020-07-17 09:54:54 +02002651lyd_insert_child(struct lyd_node *parent, struct lyd_node *node)
Michal Vaskof03ed032020-03-04 13:31:44 +01002652{
2653 struct lyd_node *iter;
2654
Michal Vasko0ab974d2021-02-24 13:18:26 +01002655 LY_CHECK_ARG_RET(NULL, parent, node, !parent->schema || (parent->schema->nodetype & LYD_NODE_INNER), LY_EINVAL);
Michal Vaskof03ed032020-03-04 13:31:44 +01002656
Michal Vasko717a4c32020-12-07 09:40:10 +01002657 LY_CHECK_RET(lyd_insert_check_schema(parent->schema, NULL, node->schema));
Michal Vaskof03ed032020-03-04 13:31:44 +01002658
Michal Vasko0ab974d2021-02-24 13:18:26 +01002659 if (node->schema && (node->schema->flags & LYS_KEY)) {
Michal Vaskof03ed032020-03-04 13:31:44 +01002660 LOGERR(parent->schema->module->ctx, LY_EINVAL, "Cannot insert key \"%s\".", node->schema->name);
2661 return LY_EINVAL;
2662 }
2663
2664 if (node->parent || node->prev->next) {
2665 lyd_unlink_tree(node);
2666 }
2667
2668 while (node) {
2669 iter = node->next;
2670 lyd_unlink_tree(node);
Michal Vasko6ee6f432021-07-16 09:49:14 +02002671 lyd_insert_node(parent, NULL, node, 0);
Michal Vaskof03ed032020-03-04 13:31:44 +01002672 node = iter;
2673 }
2674 return LY_SUCCESS;
2675}
2676
2677API LY_ERR
Michal Vaskob104f112020-07-17 09:54:54 +02002678lyd_insert_sibling(struct lyd_node *sibling, struct lyd_node *node, struct lyd_node **first)
Michal Vaskob1b5c262020-03-05 14:29:47 +01002679{
2680 struct lyd_node *iter;
2681
Michal Vaskob104f112020-07-17 09:54:54 +02002682 LY_CHECK_ARG_RET(NULL, node, LY_EINVAL);
Michal Vaskob1b5c262020-03-05 14:29:47 +01002683
Michal Vaskob104f112020-07-17 09:54:54 +02002684 if (sibling) {
Michal Vasko717a4c32020-12-07 09:40:10 +01002685 LY_CHECK_RET(lyd_insert_check_schema(NULL, sibling->schema, node->schema));
Michal Vaskob1b5c262020-03-05 14:29:47 +01002686 }
2687
Michal Vasko553d0b52020-12-04 16:27:52 +01002688 if (sibling == node) {
2689 /* we need to keep the connection to siblings so we can insert into them */
2690 sibling = sibling->prev;
2691 }
2692
Michal Vaskob1b5c262020-03-05 14:29:47 +01002693 if (node->parent || node->prev->next) {
2694 lyd_unlink_tree(node);
2695 }
2696
2697 while (node) {
Michal Vasko71e795e2020-12-04 16:27:37 +01002698 if (lysc_is_key(node->schema)) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02002699 LOGERR(LYD_CTX(node), LY_EINVAL, "Cannot insert key \"%s\".", node->schema->name);
Michal Vaskob104f112020-07-17 09:54:54 +02002700 return LY_EINVAL;
2701 }
2702
Michal Vaskob1b5c262020-03-05 14:29:47 +01002703 iter = node->next;
2704 lyd_unlink_tree(node);
Michal Vasko6ee6f432021-07-16 09:49:14 +02002705 lyd_insert_node(NULL, &sibling, node, 0);
Michal Vaskob1b5c262020-03-05 14:29:47 +01002706 node = iter;
2707 }
Michal Vaskob1b5c262020-03-05 14:29:47 +01002708
Michal Vaskob104f112020-07-17 09:54:54 +02002709 if (first) {
2710 /* find the first sibling */
2711 *first = sibling;
2712 while ((*first)->prev->next) {
2713 *first = (*first)->prev;
Michal Vasko0249f7c2020-03-05 16:36:40 +01002714 }
2715 }
2716
2717 return LY_SUCCESS;
2718}
2719
Michal Vaskob1b5c262020-03-05 14:29:47 +01002720API LY_ERR
Michal Vaskof03ed032020-03-04 13:31:44 +01002721lyd_insert_before(struct lyd_node *sibling, struct lyd_node *node)
2722{
Michal Vaskof03ed032020-03-04 13:31:44 +01002723 LY_CHECK_ARG_RET(NULL, sibling, node, LY_EINVAL);
2724
Michal Vasko717a4c32020-12-07 09:40:10 +01002725 LY_CHECK_RET(lyd_insert_check_schema(NULL, sibling->schema, node->schema));
Michal Vaskof03ed032020-03-04 13:31:44 +01002726
Michal Vaskob104f112020-07-17 09:54:54 +02002727 if (!(node->schema->nodetype & (LYS_LIST | LYS_LEAFLIST)) || !(node->schema->flags & LYS_ORDBY_USER)) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02002728 LOGERR(LYD_CTX(sibling), LY_EINVAL, "Can be used only for user-ordered nodes.");
Michal Vaskof03ed032020-03-04 13:31:44 +01002729 return LY_EINVAL;
2730 }
2731
Michal Vasko4bc2ce32020-12-08 10:06:16 +01002732 lyd_unlink_tree(node);
2733 lyd_insert_before_node(sibling, node);
2734 lyd_insert_hash(node);
Michal Vaskof03ed032020-03-04 13:31:44 +01002735
Michal Vaskof03ed032020-03-04 13:31:44 +01002736 return LY_SUCCESS;
2737}
2738
2739API LY_ERR
2740lyd_insert_after(struct lyd_node *sibling, struct lyd_node *node)
2741{
Michal Vaskof03ed032020-03-04 13:31:44 +01002742 LY_CHECK_ARG_RET(NULL, sibling, node, LY_EINVAL);
2743
Michal Vasko717a4c32020-12-07 09:40:10 +01002744 LY_CHECK_RET(lyd_insert_check_schema(NULL, sibling->schema, node->schema));
Michal Vaskof03ed032020-03-04 13:31:44 +01002745
Michal Vaskob104f112020-07-17 09:54:54 +02002746 if (!(node->schema->nodetype & (LYS_LIST | LYS_LEAFLIST)) || !(node->schema->flags & LYS_ORDBY_USER)) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02002747 LOGERR(LYD_CTX(sibling), LY_EINVAL, "Can be used only for user-ordered nodes.");
Michal Vaskof03ed032020-03-04 13:31:44 +01002748 return LY_EINVAL;
2749 }
2750
Michal Vasko4bc2ce32020-12-08 10:06:16 +01002751 lyd_unlink_tree(node);
2752 lyd_insert_after_node(sibling, node);
2753 lyd_insert_hash(node);
Michal Vaskof03ed032020-03-04 13:31:44 +01002754
Michal Vaskof03ed032020-03-04 13:31:44 +01002755 return LY_SUCCESS;
2756}
2757
2758API void
Michal Vasko66d508c2021-07-21 16:07:09 +02002759lyd_unlink_siblings(struct lyd_node *node)
2760{
2761 struct lyd_node *next, *elem, *first = NULL;
2762
2763 LY_LIST_FOR_SAFE(node, next, elem) {
2764 lyd_unlink_tree(elem);
2765 lyd_insert_node(NULL, &first, elem, 1);
2766 }
2767}
2768
2769API void
Michal Vaskof03ed032020-03-04 13:31:44 +01002770lyd_unlink_tree(struct lyd_node *node)
2771{
2772 struct lyd_node *iter;
2773
2774 if (!node) {
2775 return;
2776 }
2777
Michal Vaskob104f112020-07-17 09:54:54 +02002778 /* update hashes while still linked into the tree */
2779 lyd_unlink_hash(node);
2780
Michal Vaskof03ed032020-03-04 13:31:44 +01002781 /* unlink from siblings */
2782 if (node->prev->next) {
2783 node->prev->next = node->next;
2784 }
2785 if (node->next) {
2786 node->next->prev = node->prev;
2787 } else {
2788 /* unlinking the last node */
2789 if (node->parent) {
2790 iter = node->parent->child;
2791 } else {
2792 iter = node->prev;
2793 while (iter->prev != node) {
2794 iter = iter->prev;
2795 }
2796 }
2797 /* update the "last" pointer from the first node */
2798 iter->prev = node->prev;
2799 }
2800
2801 /* unlink from parent */
2802 if (node->parent) {
2803 if (node->parent->child == node) {
2804 /* the node is the first child */
2805 node->parent->child = node->next;
2806 }
2807
Michal Vaskoab49dbe2020-07-17 12:32:47 +02002808 /* check for NP container whether its last non-default node is not being unlinked */
Michal Vasko69730152020-10-09 16:30:07 +02002809 if (node->parent->schema && (node->parent->schema->nodetype == LYS_CONTAINER) &&
2810 !(node->parent->flags & LYD_DEFAULT) && !(node->parent->schema->flags & LYS_PRESENCE)) {
Michal Vaskoab49dbe2020-07-17 12:32:47 +02002811 LY_LIST_FOR(node->parent->child, iter) {
2812 if ((iter != node) && !(iter->flags & LYD_DEFAULT)) {
2813 break;
2814 }
2815 }
2816 if (!iter) {
2817 node->parent->flags |= LYD_DEFAULT;
2818 }
2819 }
2820
Michal Vaskof03ed032020-03-04 13:31:44 +01002821 node->parent = NULL;
2822 }
2823
2824 node->next = NULL;
2825 node->prev = node;
2826}
2827
Michal Vaskoa5da3292020-08-12 13:10:50 +02002828void
Michal Vasko871a0252020-11-11 18:35:24 +01002829lyd_insert_meta(struct lyd_node *parent, struct lyd_meta *meta, ly_bool clear_dflt)
Radek Krejci1798aae2020-07-14 13:26:06 +02002830{
2831 struct lyd_meta *last, *iter;
2832
2833 assert(parent);
Michal Vaskoa5da3292020-08-12 13:10:50 +02002834
2835 if (!meta) {
2836 return;
2837 }
Radek Krejci1798aae2020-07-14 13:26:06 +02002838
2839 for (iter = meta; iter; iter = iter->next) {
2840 iter->parent = parent;
2841 }
2842
2843 /* insert as the last attribute */
2844 if (parent->meta) {
Radek Krejci1e008d22020-08-17 11:37:37 +02002845 for (last = parent->meta; last->next; last = last->next) {}
Radek Krejci1798aae2020-07-14 13:26:06 +02002846 last->next = meta;
2847 } else {
2848 parent->meta = meta;
2849 }
2850
2851 /* remove default flags from NP containers */
Michal Vasko871a0252020-11-11 18:35:24 +01002852 while (clear_dflt && parent && (parent->schema->nodetype == LYS_CONTAINER) && (parent->flags & LYD_DEFAULT)) {
Radek Krejci1798aae2020-07-14 13:26:06 +02002853 parent->flags &= ~LYD_DEFAULT;
Michal Vasko9e685082021-01-29 14:49:09 +01002854 parent = lyd_parent(parent);
Radek Krejci1798aae2020-07-14 13:26:06 +02002855 }
Radek Krejci1798aae2020-07-14 13:26:06 +02002856}
2857
2858LY_ERR
Michal Vasko9f96a052020-03-10 09:41:45 +01002859lyd_create_meta(struct lyd_node *parent, struct lyd_meta **meta, const struct lys_module *mod, const char *name,
Radek Krejci8df109d2021-04-23 12:19:08 +02002860 size_t name_len, const char *value, size_t value_len, ly_bool *dynamic, LY_VALUE_FORMAT format,
Michal Vasko871a0252020-11-11 18:35:24 +01002861 void *prefix_data, uint32_t hints, ly_bool clear_dflt, ly_bool *incomplete)
Michal Vasko90932a92020-02-12 14:33:03 +01002862{
Radek Krejci2efc45b2020-12-22 16:25:44 +01002863 LY_ERR ret = LY_SUCCESS;
Michal Vasko90932a92020-02-12 14:33:03 +01002864 struct lysc_ext_instance *ant = NULL;
Michal Vaskob0534f92021-07-01 13:24:03 +02002865 const struct lysc_type **ant_type;
Michal Vasko9f96a052020-03-10 09:41:45 +01002866 struct lyd_meta *mt, *last;
Michal Vaskofd69e1d2020-07-03 11:57:17 +02002867 LY_ARRAY_COUNT_TYPE u;
Michal Vasko90932a92020-02-12 14:33:03 +01002868
Michal Vasko9f96a052020-03-10 09:41:45 +01002869 assert((parent || meta) && mod);
Michal Vasko6f4cbb62020-02-28 11:15:47 +01002870
Radek Krejciddace2c2021-01-08 11:30:56 +01002871 LOG_LOCSET(parent ? parent->schema : NULL, parent, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +01002872
Radek Krejci7eb54ba2020-05-18 16:30:04 +02002873 LY_ARRAY_FOR(mod->compiled->exts, u) {
Radek Krejci3e6632f2021-03-22 22:08:21 +01002874 if ((mod->compiled->exts[u].def->plugin == lyplg_find(LYPLG_EXTENSION, LYEXT_PLUGIN_INTERNAL_ANNOTATION)) &&
Radek Krejci7eb54ba2020-05-18 16:30:04 +02002875 !ly_strncmp(mod->compiled->exts[u].argument, name, name_len)) {
Michal Vasko90932a92020-02-12 14:33:03 +01002876 /* we have the annotation definition */
Radek Krejci7eb54ba2020-05-18 16:30:04 +02002877 ant = &mod->compiled->exts[u];
Michal Vasko90932a92020-02-12 14:33:03 +01002878 break;
2879 }
2880 }
2881 if (!ant) {
2882 /* attribute is not defined as a metadata annotation (RFC 7952) */
Radek Krejci2efc45b2020-12-22 16:25:44 +01002883 LOGVAL(mod->ctx, LYVE_REFERENCE, "Annotation definition for attribute \"%s:%.*s\" not found.",
Radek Krejci422afb12021-03-04 16:38:16 +01002884 mod->name, (int)name_len, name);
Radek Krejci2efc45b2020-12-22 16:25:44 +01002885 ret = LY_EINVAL;
2886 goto cleanup;
Michal Vasko90932a92020-02-12 14:33:03 +01002887 }
2888
Michal Vasko9f96a052020-03-10 09:41:45 +01002889 mt = calloc(1, sizeof *mt);
Radek Krejci2efc45b2020-12-22 16:25:44 +01002890 LY_CHECK_ERR_GOTO(!mt, LOGMEM(mod->ctx); ret = LY_EMEM, cleanup);
Michal Vasko9f96a052020-03-10 09:41:45 +01002891 mt->parent = parent;
2892 mt->annotation = ant;
Michal Vaskob0534f92021-07-01 13:24:03 +02002893 ant_type = ant->substmts[ANNOTATION_SUBSTMT_TYPE].storage;
2894 ret = lyd_value_store(mod->ctx, &mt->value, *ant_type, value, value_len, dynamic, format, prefix_data, hints,
2895 parent ? parent->schema : NULL, incomplete);
Radek Krejci2efc45b2020-12-22 16:25:44 +01002896 LY_CHECK_ERR_GOTO(ret, free(mt), cleanup);
2897 ret = lydict_insert(mod->ctx, name, name_len, &mt->name);
2898 LY_CHECK_ERR_GOTO(ret, free(mt), cleanup);
Michal Vasko90932a92020-02-12 14:33:03 +01002899
Michal Vasko6f4cbb62020-02-28 11:15:47 +01002900 /* insert as the last attribute */
2901 if (parent) {
Michal Vasko871a0252020-11-11 18:35:24 +01002902 lyd_insert_meta(parent, mt, clear_dflt);
Michal Vasko9f96a052020-03-10 09:41:45 +01002903 } else if (*meta) {
Radek Krejci1e008d22020-08-17 11:37:37 +02002904 for (last = *meta; last->next; last = last->next) {}
Michal Vasko9f96a052020-03-10 09:41:45 +01002905 last->next = mt;
Michal Vasko90932a92020-02-12 14:33:03 +01002906 }
2907
Michal Vasko9f96a052020-03-10 09:41:45 +01002908 if (meta) {
2909 *meta = mt;
Michal Vasko90932a92020-02-12 14:33:03 +01002910 }
Radek Krejci2efc45b2020-12-22 16:25:44 +01002911
2912cleanup:
Radek Krejciddace2c2021-01-08 11:30:56 +01002913 LOG_LOCBACK((parent && parent->schema) ? 1 : 0, parent ? 1 : 0, 0, 0);
Radek Krejci2efc45b2020-12-22 16:25:44 +01002914 return ret;
Michal Vasko90932a92020-02-12 14:33:03 +01002915}
2916
Michal Vaskoa5da3292020-08-12 13:10:50 +02002917void
2918lyd_insert_attr(struct lyd_node *parent, struct lyd_attr *attr)
2919{
2920 struct lyd_attr *last, *iter;
2921 struct lyd_node_opaq *opaq;
2922
2923 assert(parent && !parent->schema);
2924
2925 if (!attr) {
2926 return;
2927 }
2928
2929 opaq = (struct lyd_node_opaq *)parent;
2930 for (iter = attr; iter; iter = iter->next) {
2931 iter->parent = opaq;
2932 }
2933
2934 /* insert as the last attribute */
2935 if (opaq->attr) {
Radek Krejci1e008d22020-08-17 11:37:37 +02002936 for (last = opaq->attr; last->next; last = last->next) {}
Michal Vaskoa5da3292020-08-12 13:10:50 +02002937 last->next = attr;
2938 } else {
2939 opaq->attr = attr;
2940 }
2941}
2942
Michal Vasko52927e22020-03-16 17:26:14 +01002943LY_ERR
Michal Vaskofeca4fb2020-10-05 08:58:40 +02002944lyd_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 +01002945 const char *prefix, size_t prefix_len, const char *module_key, size_t module_key_len, const char *value,
Radek Krejci8df109d2021-04-23 12:19:08 +02002946 size_t value_len, ly_bool *dynamic, LY_VALUE_FORMAT format, void *val_prefix_data, uint32_t hints)
Michal Vasko52927e22020-03-16 17:26:14 +01002947{
Radek Krejci011e4aa2020-09-04 15:22:31 +02002948 LY_ERR ret = LY_SUCCESS;
Radek Krejci1798aae2020-07-14 13:26:06 +02002949 struct lyd_attr *at, *last;
Michal Vasko52927e22020-03-16 17:26:14 +01002950
2951 assert(ctx && (parent || attr) && (!parent || !parent->schema));
Michal Vaskofeca4fb2020-10-05 08:58:40 +02002952 assert(name && name_len && format);
Michal Vasko52927e22020-03-16 17:26:14 +01002953
Michal Vasko2a3722d2021-06-16 11:52:39 +02002954 if (!value_len && (!dynamic || !*dynamic)) {
Michal Vasko52927e22020-03-16 17:26:14 +01002955 value = "";
2956 }
2957
2958 at = calloc(1, sizeof *at);
Michal Vasko6b5cb2a2020-11-11 19:11:21 +01002959 LY_CHECK_ERR_RET(!at, LOGMEM(ctx); ly_free_prefix_data(format, val_prefix_data), LY_EMEM);
Radek Krejcid46e46a2020-09-15 14:22:42 +02002960
Michal Vaskoad92b672020-11-12 13:11:31 +01002961 LY_CHECK_GOTO(ret = lydict_insert(ctx, name, name_len, &at->name.name), finish);
Michal Vasko501af032020-11-11 20:27:44 +01002962 if (prefix_len) {
Michal Vaskoad92b672020-11-12 13:11:31 +01002963 LY_CHECK_GOTO(ret = lydict_insert(ctx, prefix, prefix_len, &at->name.prefix), finish);
Michal Vasko501af032020-11-11 20:27:44 +01002964 }
2965 if (module_key_len) {
Michal Vaskoad92b672020-11-12 13:11:31 +01002966 LY_CHECK_GOTO(ret = lydict_insert(ctx, module_key, module_key_len, &at->name.module_ns), finish);
Michal Vasko501af032020-11-11 20:27:44 +01002967 }
2968
Michal Vasko52927e22020-03-16 17:26:14 +01002969 if (dynamic && *dynamic) {
Radek Krejci011e4aa2020-09-04 15:22:31 +02002970 ret = lydict_insert_zc(ctx, (char *)value, &at->value);
2971 LY_CHECK_GOTO(ret, finish);
Michal Vasko52927e22020-03-16 17:26:14 +01002972 *dynamic = 0;
2973 } else {
Radek Krejci011e4aa2020-09-04 15:22:31 +02002974 LY_CHECK_GOTO(ret = lydict_insert(ctx, value, value_len, &at->value), finish);
Michal Vasko52927e22020-03-16 17:26:14 +01002975 }
Michal Vasko501af032020-11-11 20:27:44 +01002976 at->format = format;
2977 at->val_prefix_data = val_prefix_data;
2978 at->hints = hints;
Michal Vasko52927e22020-03-16 17:26:14 +01002979
2980 /* insert as the last attribute */
2981 if (parent) {
Michal Vaskoa5da3292020-08-12 13:10:50 +02002982 lyd_insert_attr(parent, at);
Michal Vasko52927e22020-03-16 17:26:14 +01002983 } else if (*attr) {
Radek Krejci1e008d22020-08-17 11:37:37 +02002984 for (last = *attr; last->next; last = last->next) {}
Michal Vasko52927e22020-03-16 17:26:14 +01002985 last->next = at;
2986 }
2987
Radek Krejci011e4aa2020-09-04 15:22:31 +02002988finish:
2989 if (ret) {
2990 lyd_free_attr_single(ctx, at);
2991 } else if (attr) {
Michal Vasko52927e22020-03-16 17:26:14 +01002992 *attr = at;
2993 }
2994 return LY_SUCCESS;
2995}
2996
Radek Krejci084289f2019-07-09 17:35:30 +02002997API const struct lyd_node_term *
Michal Vasko004d3152020-06-11 19:59:22 +02002998lyd_target(const struct ly_path *path, const struct lyd_node *tree)
Radek Krejci084289f2019-07-09 17:35:30 +02002999{
Michal Vasko004d3152020-06-11 19:59:22 +02003000 struct lyd_node *target;
Radek Krejci084289f2019-07-09 17:35:30 +02003001
Michal Vasko004d3152020-06-11 19:59:22 +02003002 if (ly_path_eval(path, tree, &target)) {
3003 return NULL;
Radek Krejci084289f2019-07-09 17:35:30 +02003004 }
3005
Michal Vasko004d3152020-06-11 19:59:22 +02003006 return (struct lyd_node_term *)target;
Radek Krejci084289f2019-07-09 17:35:30 +02003007}
3008
aPiecek2f63f952021-03-30 12:22:18 +02003009/**
3010 * @brief Check the equality of the two schemas from different contexts.
3011 *
3012 * @param schema1 of first node.
3013 * @param schema2 of second node.
3014 * @return 1 if the schemas are equal otherwise 0.
3015 */
3016static ly_bool
3017lyd_compare_schema_equal(const struct lysc_node *schema1, const struct lysc_node *schema2)
3018{
3019 if (!schema1 && !schema2) {
3020 return 1;
3021 } else if (!schema1 || !schema2) {
3022 return 0;
3023 }
3024
3025 assert(schema1->module->ctx != schema2->module->ctx);
3026
3027 if (schema1->nodetype != schema2->nodetype) {
3028 return 0;
3029 }
3030
3031 if (strcmp(schema1->name, schema2->name)) {
3032 return 0;
3033 }
3034
3035 if (strcmp(schema1->module->name, schema2->module->name)) {
3036 return 0;
3037 }
3038
3039 if (schema1->module->revision || schema2->module->revision) {
3040 if (!schema1->module->revision || !schema2->module->revision) {
3041 return 0;
3042 }
3043 if (strcmp(schema1->module->revision, schema2->module->revision)) {
3044 return 0;
3045 }
3046 }
3047
3048 return 1;
3049}
3050
3051/**
3052 * @brief Check the equality of the schemas for all parent nodes.
3053 *
3054 * Both nodes must be from different contexts.
3055 *
3056 * @param node1 Data of first node.
3057 * @param node2 Data of second node.
3058 * @return 1 if the all related parental schemas are equal otherwise 0.
3059 */
3060static ly_bool
3061lyd_compare_schema_parents_equal(const struct lyd_node *node1, const struct lyd_node *node2)
3062{
3063 const struct lysc_node *parent1, *parent2;
3064
3065 assert(node1 && node2);
3066
3067 for (parent1 = node1->schema->parent, parent2 = node2->schema->parent;
3068 parent1 && parent2;
3069 parent1 = parent1->parent, parent2 = parent2->parent) {
3070 if (!lyd_compare_schema_equal(parent1, parent2)) {
3071 return 0;
3072 }
3073 }
3074
3075 if (parent1 || parent2) {
3076 return 0;
3077 }
3078
3079 return 1;
3080}
3081
3082/**
3083 * @brief Internal implementation of @ref lyd_compare_single.
3084 * @copydoc lyd_compare_single
3085 * @param[in] parental_schemas_checked Flag used for optimization.
3086 * When this function is called for the first time, the flag must be set to 0.
3087 * The @ref lyd_compare_schema_parents_equal should be called only once during
3088 * recursive calls, and this is accomplished by setting to 1 in the lyd_compare_single_ body.
3089 */
3090static LY_ERR
3091lyd_compare_single_(const struct lyd_node *node1, const struct lyd_node *node2,
3092 uint32_t options, ly_bool parental_schemas_checked)
Radek Krejci1f05b6a2019-07-18 16:15:06 +02003093{
3094 const struct lyd_node *iter1, *iter2;
3095 struct lyd_node_term *term1, *term2;
3096 struct lyd_node_any *any1, *any2;
Michal Vasko52927e22020-03-16 17:26:14 +01003097 struct lyd_node_opaq *opaq1, *opaq2;
Radek Krejci1f05b6a2019-07-18 16:15:06 +02003098 size_t len1, len2;
Radek Krejci084289f2019-07-09 17:35:30 +02003099
Radek Krejci1f05b6a2019-07-18 16:15:06 +02003100 if (!node1 || !node2) {
3101 if (node1 == node2) {
3102 return LY_SUCCESS;
3103 } else {
3104 return LY_ENOT;
3105 }
3106 }
3107
aPiecek2f63f952021-03-30 12:22:18 +02003108 if (LYD_CTX(node1) == LYD_CTX(node2)) {
3109 /* same contexts */
3110 if (node1->schema != node2->schema) {
3111 return LY_ENOT;
3112 }
3113 } else {
3114 /* different contexts */
3115 if (!lyd_compare_schema_equal(node1->schema, node2->schema)) {
3116 return LY_ENOT;
3117 }
3118 if (!parental_schemas_checked) {
3119 if (!lyd_compare_schema_parents_equal(node1, node2)) {
3120 return LY_ENOT;
3121 }
3122 parental_schemas_checked = 1;
3123 }
Radek Krejci1f05b6a2019-07-18 16:15:06 +02003124 }
3125
3126 if (node1->hash != node2->hash) {
3127 return LY_ENOT;
3128 }
aPiecek2f63f952021-03-30 12:22:18 +02003129 /* equal hashes do not mean equal nodes, they can be just in collision so the nodes must be checked explicitly */
Radek Krejci1f05b6a2019-07-18 16:15:06 +02003130
Michal Vasko52927e22020-03-16 17:26:14 +01003131 if (!node1->schema) {
3132 opaq1 = (struct lyd_node_opaq *)node1;
3133 opaq2 = (struct lyd_node_opaq *)node2;
aPiecek2f63f952021-03-30 12:22:18 +02003134 if ((strcmp(opaq1->name.name, opaq2->name.name)) || (opaq1->format != opaq2->format) ||
3135 (strcmp(opaq1->name.module_ns, opaq2->name.module_ns))) {
Radek Krejci1f05b6a2019-07-18 16:15:06 +02003136 return LY_ENOT;
3137 }
Michal Vasko52927e22020-03-16 17:26:14 +01003138 switch (opaq1->format) {
Radek Krejci8df109d2021-04-23 12:19:08 +02003139 case LY_VALUE_XML:
Radek Krejci09c77442021-04-26 11:10:34 +02003140 if (lyxml_value_compare(LYD_CTX(node1), opaq1->value, opaq1->val_prefix_data, LYD_CTX(node2), opaq2->value,
3141 opaq2->val_prefix_data)) {
Michal Vasko52927e22020-03-16 17:26:14 +01003142 return LY_ENOT;
3143 }
3144 break;
Radek Krejci8df109d2021-04-23 12:19:08 +02003145 case LY_VALUE_JSON:
Radek Krejci1798aae2020-07-14 13:26:06 +02003146 /* prefixes in JSON are unique, so it is not necessary to canonize the values */
3147 if (strcmp(opaq1->value, opaq2->value)) {
3148 return LY_ENOT;
3149 }
3150 break;
Michal Vasko6b5cb2a2020-11-11 19:11:21 +01003151 default:
Michal Vasko52927e22020-03-16 17:26:14 +01003152 /* not allowed */
Michal Vaskob7be7a82020-08-20 09:09:04 +02003153 LOGINT(LYD_CTX(node1));
Michal Vasko52927e22020-03-16 17:26:14 +01003154 return LY_EINT;
3155 }
3156 if (options & LYD_COMPARE_FULL_RECURSION) {
3157 iter1 = opaq1->child;
3158 iter2 = opaq2->child;
Radek Krejci1f05b6a2019-07-18 16:15:06 +02003159 goto all_children_compare;
Michal Vasko52927e22020-03-16 17:26:14 +01003160 }
3161 return LY_SUCCESS;
3162 } else {
3163 switch (node1->schema->nodetype) {
3164 case LYS_LEAF:
3165 case LYS_LEAFLIST:
3166 if (options & LYD_COMPARE_DEFAULTS) {
3167 if ((node1->flags & LYD_DEFAULT) != (node2->flags & LYD_DEFAULT)) {
3168 return LY_ENOT;
3169 }
3170 }
3171
Michal Vasko1a2bf2e2020-06-16 13:07:48 +02003172 term1 = (struct lyd_node_term *)node1;
3173 term2 = (struct lyd_node_term *)node2;
aPiecek2f63f952021-03-30 12:22:18 +02003174
3175 /* same contexts */
3176 if (LYD_CTX(node1) == LYD_CTX(node2)) {
3177 return term1->value.realtype->plugin->compare(&term1->value, &term2->value);
3178 }
3179
3180 /* different contexts */
Radek Krejci6d5ba0c2021-04-26 07:49:59 +02003181 if (strcmp(lyd_get_value(node1), lyd_get_value(node2))) {
aPiecek2f63f952021-03-30 12:22:18 +02003182 return LY_ENOT;
3183 }
3184 return LY_SUCCESS;
Michal Vasko52927e22020-03-16 17:26:14 +01003185 case LYS_CONTAINER:
3186 if (options & LYD_COMPARE_DEFAULTS) {
3187 if ((node1->flags & LYD_DEFAULT) != (node2->flags & LYD_DEFAULT)) {
3188 return LY_ENOT;
3189 }
3190 }
3191 if (options & LYD_COMPARE_FULL_RECURSION) {
Michal Vasko9e685082021-01-29 14:49:09 +01003192 iter1 = lyd_child(node1);
3193 iter2 = lyd_child(node2);
Michal Vasko52927e22020-03-16 17:26:14 +01003194 goto all_children_compare;
Radek Krejci1f05b6a2019-07-18 16:15:06 +02003195 }
3196 return LY_SUCCESS;
Michal Vasko1bf09392020-03-27 12:38:10 +01003197 case LYS_RPC:
Michal Vasko52927e22020-03-16 17:26:14 +01003198 case LYS_ACTION:
3199 if (options & LYD_COMPARE_FULL_RECURSION) {
3200 /* TODO action/RPC
3201 goto all_children_compare;
3202 */
Radek Krejci1f05b6a2019-07-18 16:15:06 +02003203 }
3204 return LY_SUCCESS;
Michal Vasko52927e22020-03-16 17:26:14 +01003205 case LYS_NOTIF:
3206 if (options & LYD_COMPARE_FULL_RECURSION) {
3207 /* TODO Notification
3208 goto all_children_compare;
3209 */
3210 }
3211 return LY_SUCCESS;
3212 case LYS_LIST:
Michal Vasko9e685082021-01-29 14:49:09 +01003213 iter1 = lyd_child(node1);
3214 iter2 = lyd_child(node2);
Michal Vasko52927e22020-03-16 17:26:14 +01003215
3216 if (!(node1->schema->flags & LYS_KEYLESS) && !(options & LYD_COMPARE_FULL_RECURSION)) {
3217 /* lists with keys, their equivalence is based on their keys */
Michal Vasko544e58a2021-01-28 14:33:41 +01003218 for (const struct lysc_node *key = lysc_node_child(node1->schema);
Michal Vaskoc57d9a92020-06-23 13:28:27 +02003219 key && (key->flags & LYS_KEY);
Michal Vasko52927e22020-03-16 17:26:14 +01003220 key = key->next) {
aPiecek2f63f952021-03-30 12:22:18 +02003221 if (lyd_compare_single_(iter1, iter2, options, parental_schemas_checked)) {
Michal Vasko52927e22020-03-16 17:26:14 +01003222 return LY_ENOT;
3223 }
3224 iter1 = iter1->next;
3225 iter2 = iter2->next;
3226 }
3227 } else {
3228 /* lists without keys, their equivalence is based on equivalence of all the children (both direct and indirect) */
3229
Radek Krejci0f969882020-08-21 16:56:47 +02003230all_children_compare:
Michal Vasko52927e22020-03-16 17:26:14 +01003231 if (!iter1 && !iter2) {
3232 /* no children, nothing to compare */
3233 return LY_SUCCESS;
3234 }
3235
Michal Vaskod989ba02020-08-24 10:59:24 +02003236 for ( ; iter1 && iter2; iter1 = iter1->next, iter2 = iter2->next) {
aPiecek2f63f952021-03-30 12:22:18 +02003237 if (lyd_compare_single_(iter1, iter2, options | LYD_COMPARE_FULL_RECURSION, parental_schemas_checked)) {
Michal Vasko52927e22020-03-16 17:26:14 +01003238 return LY_ENOT;
3239 }
3240 }
3241 if (iter1 || iter2) {
3242 return LY_ENOT;
3243 }
3244 }
3245 return LY_SUCCESS;
3246 case LYS_ANYXML:
3247 case LYS_ANYDATA:
Michal Vasko22df3f02020-08-24 13:29:22 +02003248 any1 = (struct lyd_node_any *)node1;
3249 any2 = (struct lyd_node_any *)node2;
Michal Vasko52927e22020-03-16 17:26:14 +01003250
3251 if (any1->value_type != any2->value_type) {
3252 return LY_ENOT;
3253 }
3254 switch (any1->value_type) {
3255 case LYD_ANYDATA_DATATREE:
3256 iter1 = any1->value.tree;
3257 iter2 = any2->value.tree;
3258 goto all_children_compare;
3259 case LYD_ANYDATA_STRING:
3260 case LYD_ANYDATA_XML:
3261 case LYD_ANYDATA_JSON:
3262 len1 = strlen(any1->value.str);
3263 len2 = strlen(any2->value.str);
Michal Vasko69730152020-10-09 16:30:07 +02003264 if ((len1 != len2) || strcmp(any1->value.str, any2->value.str)) {
Michal Vasko52927e22020-03-16 17:26:14 +01003265 return LY_ENOT;
3266 }
3267 return LY_SUCCESS;
Michal Vasko52927e22020-03-16 17:26:14 +01003268 case LYD_ANYDATA_LYB:
Michal Vasko60ea6352020-06-29 13:39:39 +02003269 len1 = lyd_lyb_data_length(any1->value.mem);
3270 len2 = lyd_lyb_data_length(any2->value.mem);
Michal Vasko69730152020-10-09 16:30:07 +02003271 if ((len1 != len2) || memcmp(any1->value.mem, any2->value.mem, len1)) {
Michal Vasko52927e22020-03-16 17:26:14 +01003272 return LY_ENOT;
3273 }
3274 return LY_SUCCESS;
Michal Vasko52927e22020-03-16 17:26:14 +01003275 }
Radek Krejci1f05b6a2019-07-18 16:15:06 +02003276 }
3277 }
3278
Michal Vaskob7be7a82020-08-20 09:09:04 +02003279 LOGINT(LYD_CTX(node1));
Radek Krejci1f05b6a2019-07-18 16:15:06 +02003280 return LY_EINT;
3281}
Radek Krejci22ebdba2019-07-25 13:59:43 +02003282
Michal Vasko21725742020-06-29 11:49:25 +02003283API LY_ERR
aPiecek2f63f952021-03-30 12:22:18 +02003284lyd_compare_single(const struct lyd_node *node1, const struct lyd_node *node2, uint32_t options)
3285{
3286 return lyd_compare_single_(node1, node2, options, 0);
3287}
3288
3289API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02003290lyd_compare_siblings(const struct lyd_node *node1, const struct lyd_node *node2, uint32_t options)
Michal Vasko8f359bf2020-07-28 10:41:15 +02003291{
Michal Vaskod989ba02020-08-24 10:59:24 +02003292 for ( ; node1 && node2; node1 = node1->next, node2 = node2->next) {
Michal Vasko8f359bf2020-07-28 10:41:15 +02003293 LY_CHECK_RET(lyd_compare_single(node1, node2, options));
3294 }
3295
Michal Vasko11a81432020-07-28 16:31:29 +02003296 if (node1 == node2) {
3297 return LY_SUCCESS;
Michal Vasko8f359bf2020-07-28 10:41:15 +02003298 }
Michal Vasko11a81432020-07-28 16:31:29 +02003299 return LY_ENOT;
Michal Vasko8f359bf2020-07-28 10:41:15 +02003300}
3301
3302API LY_ERR
Michal Vasko21725742020-06-29 11:49:25 +02003303lyd_compare_meta(const struct lyd_meta *meta1, const struct lyd_meta *meta2)
3304{
3305 if (!meta1 || !meta2) {
3306 if (meta1 == meta2) {
3307 return LY_SUCCESS;
3308 } else {
3309 return LY_ENOT;
3310 }
3311 }
3312
Michal Vaskoa8083062020-11-06 17:22:10 +01003313 if ((meta1->annotation->module->ctx != meta2->annotation->module->ctx) || (meta1->annotation != meta2->annotation)) {
Michal Vasko21725742020-06-29 11:49:25 +02003314 return LY_ENOT;
3315 }
3316
Michal Vasko21725742020-06-29 11:49:25 +02003317 return meta1->value.realtype->plugin->compare(&meta1->value, &meta2->value);
3318}
3319
Radek Krejci22ebdba2019-07-25 13:59:43 +02003320/**
Michal Vasko9cf62422021-07-01 13:29:32 +02003321 * @brief Create a copy of the attribute.
3322 *
3323 * @param[in] attr Attribute to copy.
3324 * @param[in] node Opaque where to append the new attribute.
3325 * @param[out] dup Optional created attribute copy.
3326 * @return LY_ERR value.
3327 */
3328static LY_ERR
3329lyd_dup_attr_single(const struct lyd_attr *attr, struct lyd_node *node, struct lyd_attr **dup)
3330{
3331 LY_ERR ret = LY_SUCCESS;
3332 struct lyd_attr *a, *last;
3333 struct lyd_node_opaq *opaq = (struct lyd_node_opaq *)node;
3334
3335 LY_CHECK_ARG_RET(NULL, attr, node, !node->schema, LY_EINVAL);
3336
3337 /* create a copy */
3338 a = calloc(1, sizeof *attr);
3339 LY_CHECK_ERR_RET(!a, LOGMEM(LYD_CTX(node)), LY_EMEM);
3340
3341 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), attr->name.name, 0, &a->name.name), finish);
3342 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), attr->name.prefix, 0, &a->name.prefix), finish);
3343 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), attr->name.module_ns, 0, &a->name.module_ns), finish);
3344 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), attr->value, 0, &a->value), finish);
3345 a->hints = attr->hints;
3346 a->format = attr->format;
3347 if (attr->val_prefix_data) {
3348 ret = ly_dup_prefix_data(LYD_CTX(node), attr->format, attr->val_prefix_data, &a->val_prefix_data);
3349 LY_CHECK_GOTO(ret, finish);
3350 }
3351
3352 /* insert as the last attribute */
3353 a->parent = opaq;
3354 if (opaq->attr) {
3355 for (last = opaq->attr; last->next; last = last->next) {}
3356 last->next = a;
3357 } else {
3358 opaq->attr = a;
3359 }
3360
3361finish:
3362 if (ret) {
3363 lyd_free_attr_single(LYD_CTX(node), a);
3364 } else if (dup) {
3365 *dup = a;
3366 }
3367 return LY_SUCCESS;
3368}
3369
3370/**
Michal Vasko52927e22020-03-16 17:26:14 +01003371 * @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 +02003372 *
3373 * 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 +02003374 *
3375 * @param[in] node Original node to duplicate
3376 * @param[in] parent Parent to insert into, NULL for top-level sibling.
Michal Vasko67177e52021-08-25 11:15:15 +02003377 * @param[in] insert_last Whether the duplicated node can be inserted as the last child of @p parent. Set for
3378 * recursive duplication as an optimization.
Radek Krejcif8b95172020-05-15 14:51:06 +02003379 * @param[in,out] first First sibling, NULL if no top-level sibling exist yet. Can be also NULL if @p parent is set.
3380 * @param[in] options Bitmask of options flags, see @ref dupoptions.
3381 * @param[out] dup_p Pointer where the created duplicated node is placed (besides connecting it int @p parent / @p first sibling).
3382 * @return LY_ERR value
Radek Krejci22ebdba2019-07-25 13:59:43 +02003383 */
Michal Vasko52927e22020-03-16 17:26:14 +01003384static LY_ERR
Michal Vasko67177e52021-08-25 11:15:15 +02003385lyd_dup_r(const struct lyd_node *node, struct lyd_node *parent, ly_bool insert_last, struct lyd_node **first,
3386 uint32_t options, struct lyd_node **dup_p)
Radek Krejci22ebdba2019-07-25 13:59:43 +02003387{
Michal Vasko52927e22020-03-16 17:26:14 +01003388 LY_ERR ret;
Radek Krejci22ebdba2019-07-25 13:59:43 +02003389 struct lyd_node *dup = NULL;
Michal Vasko61551fa2020-07-09 15:45:45 +02003390 struct lyd_meta *meta;
Michal Vasko9cf62422021-07-01 13:29:32 +02003391 struct lyd_attr *attr;
Michal Vasko61551fa2020-07-09 15:45:45 +02003392 struct lyd_node_any *any;
Radek Krejci22ebdba2019-07-25 13:59:43 +02003393
Michal Vasko52927e22020-03-16 17:26:14 +01003394 LY_CHECK_ARG_RET(NULL, node, LY_EINVAL);
Radek Krejci22ebdba2019-07-25 13:59:43 +02003395
Michal Vasko52927e22020-03-16 17:26:14 +01003396 if (!node->schema) {
3397 dup = calloc(1, sizeof(struct lyd_node_opaq));
Michal Vasko9cf62422021-07-01 13:29:32 +02003398 ((struct lyd_node_opaq *)dup)->ctx = LYD_CTX(node);
Michal Vasko52927e22020-03-16 17:26:14 +01003399 } else {
3400 switch (node->schema->nodetype) {
Michal Vasko1bf09392020-03-27 12:38:10 +01003401 case LYS_RPC:
Michal Vasko52927e22020-03-16 17:26:14 +01003402 case LYS_ACTION:
3403 case LYS_NOTIF:
3404 case LYS_CONTAINER:
3405 case LYS_LIST:
3406 dup = calloc(1, sizeof(struct lyd_node_inner));
3407 break;
3408 case LYS_LEAF:
3409 case LYS_LEAFLIST:
3410 dup = calloc(1, sizeof(struct lyd_node_term));
3411 break;
3412 case LYS_ANYDATA:
3413 case LYS_ANYXML:
3414 dup = calloc(1, sizeof(struct lyd_node_any));
3415 break;
3416 default:
Michal Vaskob7be7a82020-08-20 09:09:04 +02003417 LOGINT(LYD_CTX(node));
Michal Vasko52927e22020-03-16 17:26:14 +01003418 ret = LY_EINT;
3419 goto error;
3420 }
Radek Krejci22ebdba2019-07-25 13:59:43 +02003421 }
Michal Vaskob7be7a82020-08-20 09:09:04 +02003422 LY_CHECK_ERR_GOTO(!dup, LOGMEM(LYD_CTX(node)); ret = LY_EMEM, error);
Radek Krejci22ebdba2019-07-25 13:59:43 +02003423
Michal Vaskof6df0a02020-06-16 13:08:34 +02003424 if (options & LYD_DUP_WITH_FLAGS) {
3425 dup->flags = node->flags;
3426 } else {
3427 dup->flags = (node->flags & LYD_DEFAULT) | LYD_NEW;
3428 }
Radek Krejci22ebdba2019-07-25 13:59:43 +02003429 dup->schema = node->schema;
Michal Vasko52927e22020-03-16 17:26:14 +01003430 dup->prev = dup;
Radek Krejci22ebdba2019-07-25 13:59:43 +02003431
Michal Vasko9cf62422021-07-01 13:29:32 +02003432 /* duplicate metadata/attributes */
Michal Vasko25a32822020-07-09 15:48:22 +02003433 if (!(options & LYD_DUP_NO_META)) {
Michal Vasko9cf62422021-07-01 13:29:32 +02003434 if (!node->schema) {
3435 LY_LIST_FOR(((struct lyd_node_opaq *)node)->attr, attr) {
3436 LY_CHECK_GOTO(ret = lyd_dup_attr_single(attr, dup, NULL), error);
3437 }
3438 } else {
3439 LY_LIST_FOR(node->meta, meta) {
3440 LY_CHECK_GOTO(ret = lyd_dup_meta_single(meta, dup, NULL), error);
3441 }
Michal Vasko25a32822020-07-09 15:48:22 +02003442 }
3443 }
Radek Krejci22ebdba2019-07-25 13:59:43 +02003444
3445 /* nodetype-specific work */
Michal Vasko52927e22020-03-16 17:26:14 +01003446 if (!dup->schema) {
3447 struct lyd_node_opaq *opaq = (struct lyd_node_opaq *)dup;
3448 struct lyd_node_opaq *orig = (struct lyd_node_opaq *)node;
3449 struct lyd_node *child;
Radek Krejci22ebdba2019-07-25 13:59:43 +02003450
3451 if (options & LYD_DUP_RECURSIVE) {
3452 /* duplicate all the children */
3453 LY_LIST_FOR(orig->child, child) {
Michal Vasko67177e52021-08-25 11:15:15 +02003454 LY_CHECK_GOTO(ret = lyd_dup_r(child, dup, 1, NULL, options, NULL), error);
Michal Vasko52927e22020-03-16 17:26:14 +01003455 }
3456 }
Michal Vaskoad92b672020-11-12 13:11:31 +01003457 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), orig->name.name, 0, &opaq->name.name), error);
Michal Vasko9cf62422021-07-01 13:29:32 +02003458 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), orig->name.prefix, 0, &opaq->name.prefix), error);
Michal Vaskoad92b672020-11-12 13:11:31 +01003459 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), orig->name.module_ns, 0, &opaq->name.module_ns), error);
Michal Vasko9cf62422021-07-01 13:29:32 +02003460 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), orig->value, 0, &opaq->value), error);
3461 opaq->hints = orig->hints;
3462 opaq->format = orig->format;
Michal Vasko6b5cb2a2020-11-11 19:11:21 +01003463 if (orig->val_prefix_data) {
3464 ret = ly_dup_prefix_data(LYD_CTX(node), opaq->format, orig->val_prefix_data, &opaq->val_prefix_data);
3465 LY_CHECK_GOTO(ret, error);
Michal Vasko52927e22020-03-16 17:26:14 +01003466 }
Michal Vasko52927e22020-03-16 17:26:14 +01003467 } else if (dup->schema->nodetype & LYD_NODE_TERM) {
3468 struct lyd_node_term *term = (struct lyd_node_term *)dup;
3469 struct lyd_node_term *orig = (struct lyd_node_term *)node;
3470
3471 term->hash = orig->hash;
Michal Vaskob7be7a82020-08-20 09:09:04 +02003472 LY_CHECK_ERR_GOTO(orig->value.realtype->plugin->duplicate(LYD_CTX(node), &orig->value, &term->value),
Michal Vasko69730152020-10-09 16:30:07 +02003473 LOGERR(LYD_CTX(node), LY_EINT, "Value duplication failed."); ret = LY_EINT, error);
Michal Vasko52927e22020-03-16 17:26:14 +01003474 } else if (dup->schema->nodetype & LYD_NODE_INNER) {
3475 struct lyd_node_inner *orig = (struct lyd_node_inner *)node;
3476 struct lyd_node *child;
3477
3478 if (options & LYD_DUP_RECURSIVE) {
3479 /* duplicate all the children */
3480 LY_LIST_FOR(orig->child, child) {
Michal Vasko67177e52021-08-25 11:15:15 +02003481 LY_CHECK_GOTO(ret = lyd_dup_r(child, dup, 1, NULL, options, NULL), error);
Radek Krejci22ebdba2019-07-25 13:59:43 +02003482 }
Michal Vasko69730152020-10-09 16:30:07 +02003483 } else if ((dup->schema->nodetype == LYS_LIST) && !(dup->schema->flags & LYS_KEYLESS)) {
Radek Krejci22ebdba2019-07-25 13:59:43 +02003484 /* always duplicate keys of a list */
Radek Krejci22ebdba2019-07-25 13:59:43 +02003485 child = orig->child;
Michal Vasko544e58a2021-01-28 14:33:41 +01003486 for (const struct lysc_node *key = lysc_node_child(dup->schema);
Michal Vaskoc57d9a92020-06-23 13:28:27 +02003487 key && (key->flags & LYS_KEY);
Radek Krejci0fe9b512019-07-26 17:51:05 +02003488 key = key->next) {
Radek Krejci22ebdba2019-07-25 13:59:43 +02003489 if (!child) {
3490 /* possibly not keys are present in filtered tree */
3491 break;
Radek Krejci0fe9b512019-07-26 17:51:05 +02003492 } else if (child->schema != key) {
3493 /* possibly not all keys are present in filtered tree,
3494 * but there can be also some non-key nodes */
3495 continue;
Radek Krejci22ebdba2019-07-25 13:59:43 +02003496 }
Michal Vasko67177e52021-08-25 11:15:15 +02003497 LY_CHECK_GOTO(ret = lyd_dup_r(child, dup, 1, NULL, options, NULL), error);
Radek Krejci22ebdba2019-07-25 13:59:43 +02003498 child = child->next;
3499 }
3500 }
3501 lyd_hash(dup);
3502 } else if (dup->schema->nodetype & LYD_NODE_ANY) {
Michal Vasko61551fa2020-07-09 15:45:45 +02003503 dup->hash = node->hash;
3504 any = (struct lyd_node_any *)node;
3505 LY_CHECK_GOTO(ret = lyd_any_copy_value(dup, &any->value, any->value_type), error);
Radek Krejci22ebdba2019-07-25 13:59:43 +02003506 }
3507
Michal Vasko52927e22020-03-16 17:26:14 +01003508 /* insert */
Michal Vasko67177e52021-08-25 11:15:15 +02003509 lyd_insert_node(parent, first, dup, insert_last);
Michal Vasko52927e22020-03-16 17:26:14 +01003510
3511 if (dup_p) {
3512 *dup_p = dup;
3513 }
3514 return LY_SUCCESS;
Radek Krejci22ebdba2019-07-25 13:59:43 +02003515
3516error:
Michal Vasko52927e22020-03-16 17:26:14 +01003517 lyd_free_tree(dup);
3518 return ret;
Radek Krejci22ebdba2019-07-25 13:59:43 +02003519}
3520
Michal Vasko29d674b2021-08-25 11:18:35 +02003521/**
3522 * @brief Get a parent node to connect duplicated subtree to.
3523 *
3524 * @param[in] node Node (subtree) to duplicate.
3525 * @param[in] parent Initial parent to connect to.
3526 * @param[in] options Bitmask of options flags, see @ref dupoptions.
3527 * @param[out] dup_parent First duplicated parent node, if any.
3528 * @param[out] local_parent Correct parent to directly connect duplicated @p node to.
3529 * @return LY_ERR value.
3530 */
Michal Vasko3a41dff2020-07-15 14:30:28 +02003531static LY_ERR
Michal Vasko20909752021-05-18 16:13:38 +02003532lyd_dup_get_local_parent(const struct lyd_node *node, const struct lyd_node_inner *parent, uint32_t options,
3533 struct lyd_node **dup_parent, struct lyd_node_inner **local_parent)
Radek Krejci22ebdba2019-07-25 13:59:43 +02003534{
Michal Vasko3a41dff2020-07-15 14:30:28 +02003535 const struct lyd_node_inner *orig_parent, *iter;
Radek Krejci857189e2020-09-01 13:26:36 +02003536 ly_bool repeat = 1;
Michal Vasko3a41dff2020-07-15 14:30:28 +02003537
3538 *dup_parent = NULL;
3539 *local_parent = NULL;
3540
3541 for (orig_parent = node->parent; repeat && orig_parent; orig_parent = orig_parent->parent) {
3542 if (parent && (parent->schema == orig_parent->schema)) {
3543 /* stop creating parents, connect what we have into the provided parent */
3544 iter = parent;
3545 repeat = 0;
3546 } else {
3547 iter = NULL;
Michal Vasko67177e52021-08-25 11:15:15 +02003548 LY_CHECK_RET(lyd_dup_r((struct lyd_node *)orig_parent, NULL, 0, (struct lyd_node **)&iter, options,
Radek Krejci0f969882020-08-21 16:56:47 +02003549 (struct lyd_node **)&iter));
Michal Vasko3a41dff2020-07-15 14:30:28 +02003550 }
3551 if (!*local_parent) {
3552 *local_parent = (struct lyd_node_inner *)iter;
3553 }
3554 if (iter->child) {
3555 /* 1) list - add after keys
3556 * 2) provided parent with some children */
3557 iter->child->prev->next = *dup_parent;
3558 if (*dup_parent) {
3559 (*dup_parent)->prev = iter->child->prev;
3560 iter->child->prev = *dup_parent;
3561 }
3562 } else {
3563 ((struct lyd_node_inner *)iter)->child = *dup_parent;
3564 }
3565 if (*dup_parent) {
3566 (*dup_parent)->parent = (struct lyd_node_inner *)iter;
3567 }
3568 *dup_parent = (struct lyd_node *)iter;
3569 }
3570
3571 if (repeat && parent) {
3572 /* given parent and created parents chain actually do not interconnect */
Michal Vaskob7be7a82020-08-20 09:09:04 +02003573 LOGERR(LYD_CTX(node), LY_EINVAL,
Michal Vasko69730152020-10-09 16:30:07 +02003574 "Invalid argument parent (%s()) - does not interconnect with the created node's parents chain.", __func__);
Michal Vasko3a41dff2020-07-15 14:30:28 +02003575 return LY_EINVAL;
3576 }
3577
3578 return LY_SUCCESS;
3579}
3580
3581static LY_ERR
Michal Vasko67177e52021-08-25 11:15:15 +02003582lyd_dup(const struct lyd_node *node, struct lyd_node_inner *parent, uint32_t options, ly_bool nosiblings,
3583 struct lyd_node **dup)
Michal Vasko3a41dff2020-07-15 14:30:28 +02003584{
3585 LY_ERR rc;
Radek Krejci22ebdba2019-07-25 13:59:43 +02003586 const struct lyd_node *orig; /* original node to be duplicated */
3587 struct lyd_node *first = NULL; /* the first duplicated node, this is returned */
Radek Krejci22ebdba2019-07-25 13:59:43 +02003588 struct lyd_node *top = NULL; /* the most higher created node */
3589 struct lyd_node_inner *local_parent = NULL; /* the direct parent node for the duplicated node(s) */
Radek Krejci22ebdba2019-07-25 13:59:43 +02003590
Michal Vasko3a41dff2020-07-15 14:30:28 +02003591 LY_CHECK_ARG_RET(NULL, node, LY_EINVAL);
Radek Krejci22ebdba2019-07-25 13:59:43 +02003592
3593 if (options & LYD_DUP_WITH_PARENTS) {
Michal Vasko20909752021-05-18 16:13:38 +02003594 LY_CHECK_GOTO(rc = lyd_dup_get_local_parent(node, parent, options & (LYD_DUP_WITH_FLAGS | LYD_DUP_NO_META),
3595 &top, &local_parent), error);
Radek Krejci22ebdba2019-07-25 13:59:43 +02003596 } else {
3597 local_parent = parent;
3598 }
3599
Radek Krejci22ebdba2019-07-25 13:59:43 +02003600 LY_LIST_FOR(node, orig) {
Michal Vasko35f4d772021-01-12 12:08:57 +01003601 if (lysc_is_key(orig->schema)) {
3602 if (local_parent) {
3603 /* the key must already exist in the parent */
3604 rc = lyd_find_sibling_schema(local_parent->child, orig->schema, first ? NULL : &first);
3605 LY_CHECK_ERR_GOTO(rc, LOGINT(LYD_CTX(node)), error);
3606 } else {
3607 assert(!(options & LYD_DUP_WITH_PARENTS));
3608 /* duplicating a single key, okay, I suppose... */
Michal Vasko67177e52021-08-25 11:15:15 +02003609 rc = lyd_dup_r(orig, NULL, 0, &first, options, first ? NULL : &first);
Michal Vasko35f4d772021-01-12 12:08:57 +01003610 LY_CHECK_GOTO(rc, error);
3611 }
3612 } else {
3613 /* if there is no local parent, it will be inserted into first */
Michal Vasko67177e52021-08-25 11:15:15 +02003614 rc = lyd_dup_r(orig, local_parent ? &local_parent->node : NULL, 0, &first, options, first ? NULL : &first);
Michal Vasko35f4d772021-01-12 12:08:57 +01003615 LY_CHECK_GOTO(rc, error);
3616 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02003617 if (nosiblings) {
Radek Krejci22ebdba2019-07-25 13:59:43 +02003618 break;
3619 }
3620 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02003621
Michal Vasko3a41dff2020-07-15 14:30:28 +02003622 if (dup) {
3623 *dup = first;
3624 }
3625 return LY_SUCCESS;
Radek Krejci22ebdba2019-07-25 13:59:43 +02003626
3627error:
3628 if (top) {
3629 lyd_free_tree(top);
3630 } else {
Michal Vaskof03ed032020-03-04 13:31:44 +01003631 lyd_free_siblings(first);
Radek Krejci22ebdba2019-07-25 13:59:43 +02003632 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02003633 return rc;
Radek Krejci22ebdba2019-07-25 13:59:43 +02003634}
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003635
Michal Vasko3a41dff2020-07-15 14:30:28 +02003636API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02003637lyd_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 +02003638{
3639 return lyd_dup(node, parent, options, 1, dup);
3640}
3641
3642API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02003643lyd_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 +02003644{
3645 return lyd_dup(node, parent, options, 0, dup);
3646}
3647
3648API LY_ERR
3649lyd_dup_meta_single(const struct lyd_meta *meta, struct lyd_node *node, struct lyd_meta **dup)
Michal Vasko25a32822020-07-09 15:48:22 +02003650{
Radek Krejci011e4aa2020-09-04 15:22:31 +02003651 LY_ERR ret = LY_SUCCESS;
Michal Vasko25a32822020-07-09 15:48:22 +02003652 struct lyd_meta *mt, *last;
3653
Michal Vasko3a41dff2020-07-15 14:30:28 +02003654 LY_CHECK_ARG_RET(NULL, meta, node, LY_EINVAL);
Michal Vasko25a32822020-07-09 15:48:22 +02003655
3656 /* create a copy */
3657 mt = calloc(1, sizeof *mt);
Michal Vaskob7be7a82020-08-20 09:09:04 +02003658 LY_CHECK_ERR_RET(!mt, LOGMEM(LYD_CTX(node)), LY_EMEM);
Michal Vasko25a32822020-07-09 15:48:22 +02003659 mt->annotation = meta->annotation;
Michal Vaskob7be7a82020-08-20 09:09:04 +02003660 ret = meta->value.realtype->plugin->duplicate(LYD_CTX(node), &meta->value, &mt->value);
Radek Krejci011e4aa2020-09-04 15:22:31 +02003661 LY_CHECK_ERR_GOTO(ret, LOGERR(LYD_CTX(node), LY_EINT, "Value duplication failed."), finish);
3662 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), meta->name, 0, &mt->name), finish);
Michal Vasko25a32822020-07-09 15:48:22 +02003663
3664 /* insert as the last attribute */
Radek Krejci011e4aa2020-09-04 15:22:31 +02003665 mt->parent = node;
Michal Vasko25a32822020-07-09 15:48:22 +02003666 if (node->meta) {
Radek Krejci1e008d22020-08-17 11:37:37 +02003667 for (last = node->meta; last->next; last = last->next) {}
Michal Vasko25a32822020-07-09 15:48:22 +02003668 last->next = mt;
3669 } else {
3670 node->meta = mt;
3671 }
3672
Radek Krejci011e4aa2020-09-04 15:22:31 +02003673finish:
3674 if (ret) {
3675 lyd_free_meta_single(mt);
3676 } else if (dup) {
Michal Vasko3a41dff2020-07-15 14:30:28 +02003677 *dup = mt;
3678 }
3679 return LY_SUCCESS;
Michal Vasko25a32822020-07-09 15:48:22 +02003680}
3681
Michal Vasko4490d312020-06-16 13:08:55 +02003682/**
3683 * @brief Merge a source sibling into target siblings.
3684 *
3685 * @param[in,out] first_trg First target sibling, is updated if top-level.
3686 * @param[in] parent_trg Target parent.
3687 * @param[in,out] sibling_src Source sibling to merge, set to NULL if spent.
Michal Vaskocd3f6172021-05-18 16:14:50 +02003688 * @param[in] merge_cb Optional merge callback.
3689 * @param[in] cb_data Arbitrary callback data.
Michal Vasko4490d312020-06-16 13:08:55 +02003690 * @param[in] options Merge options.
Michal Vaskocd3f6172021-05-18 16:14:50 +02003691 * @param[in,out] dup_inst Duplicate instance cache for all @p first_trg siblings.
Michal Vasko4490d312020-06-16 13:08:55 +02003692 * @return LY_ERR value.
3693 */
3694static LY_ERR
3695lyd_merge_sibling_r(struct lyd_node **first_trg, struct lyd_node *parent_trg, const struct lyd_node **sibling_src_p,
Michal Vaskocd3f6172021-05-18 16:14:50 +02003696 lyd_merge_cb merge_cb, void *cb_data, uint16_t options, struct lyd_dup_inst **dup_inst)
Michal Vasko4490d312020-06-16 13:08:55 +02003697{
Michal Vasko4490d312020-06-16 13:08:55 +02003698 const struct lyd_node *child_src, *tmp, *sibling_src;
Michal Vasko56daf732020-08-10 10:57:18 +02003699 struct lyd_node *match_trg, *dup_src, *elem;
Michal Vasko4490d312020-06-16 13:08:55 +02003700 struct lysc_type *type;
Michal Vaskocd3f6172021-05-18 16:14:50 +02003701 struct lyd_dup_inst *child_dup_inst = NULL;
3702 LY_ERR ret;
3703 ly_bool first_inst = 0;
Michal Vasko4490d312020-06-16 13:08:55 +02003704
3705 sibling_src = *sibling_src_p;
Michal Vaskocd3f6172021-05-18 16:14:50 +02003706 if (!sibling_src->schema) {
3707 /* try to find the same opaque node */
3708 lyd_find_sibling_opaq_next(*first_trg, LYD_NAME(sibling_src), &match_trg);
3709 } else if (sibling_src->schema->nodetype & (LYS_LIST | LYS_LEAFLIST)) {
Michal Vasko4490d312020-06-16 13:08:55 +02003710 /* try to find the exact instance */
Michal Vaskocd3f6172021-05-18 16:14:50 +02003711 lyd_find_sibling_first(*first_trg, sibling_src, &match_trg);
Michal Vasko4490d312020-06-16 13:08:55 +02003712 } else {
3713 /* try to simply find the node, there cannot be more instances */
Michal Vaskocd3f6172021-05-18 16:14:50 +02003714 lyd_find_sibling_val(*first_trg, sibling_src->schema, NULL, 0, &match_trg);
Michal Vasko4490d312020-06-16 13:08:55 +02003715 }
3716
Michal Vaskocd3f6172021-05-18 16:14:50 +02003717 if (match_trg) {
3718 /* update match as needed */
3719 LY_CHECK_RET(lyd_dup_inst_next(&match_trg, *first_trg, dup_inst));
3720 } else {
3721 /* first instance of this node */
3722 first_inst = 1;
3723 }
3724
3725 if (match_trg) {
3726 /* call callback */
3727 if (merge_cb) {
3728 LY_CHECK_RET(merge_cb(match_trg, sibling_src, cb_data));
3729 }
3730
Michal Vasko4490d312020-06-16 13:08:55 +02003731 /* node found, make sure even value matches for all node types */
Michal Vasko8f359bf2020-07-28 10:41:15 +02003732 if ((match_trg->schema->nodetype == LYS_LEAF) && lyd_compare_single(sibling_src, match_trg, LYD_COMPARE_DEFAULTS)) {
Michal Vasko4490d312020-06-16 13:08:55 +02003733 /* since they are different, they cannot both be default */
3734 assert(!(sibling_src->flags & LYD_DEFAULT) || !(match_trg->flags & LYD_DEFAULT));
3735
Michal Vasko3a41dff2020-07-15 14:30:28 +02003736 /* update value (or only LYD_DEFAULT flag) only if flag set or the source node is not default */
3737 if ((options & LYD_MERGE_DEFAULTS) || !(sibling_src->flags & LYD_DEFAULT)) {
Michal Vasko4490d312020-06-16 13:08:55 +02003738 type = ((struct lysc_node_leaf *)match_trg->schema)->type;
Michal Vaskob7be7a82020-08-20 09:09:04 +02003739 type->plugin->free(LYD_CTX(match_trg), &((struct lyd_node_term *)match_trg)->value);
3740 LY_CHECK_RET(type->plugin->duplicate(LYD_CTX(match_trg), &((struct lyd_node_term *)sibling_src)->value,
Michal Vasko69730152020-10-09 16:30:07 +02003741 &((struct lyd_node_term *)match_trg)->value));
Michal Vasko4490d312020-06-16 13:08:55 +02003742
3743 /* copy flags and add LYD_NEW */
Michal Vasko7e8315b2021-08-03 17:01:06 +02003744 match_trg->flags = sibling_src->flags | ((options & LYD_MERGE_WITH_FLAGS) ? 0 : LYD_NEW);
Michal Vasko4490d312020-06-16 13:08:55 +02003745 }
Michal Vasko8f359bf2020-07-28 10:41:15 +02003746 } else if ((match_trg->schema->nodetype & LYS_ANYDATA) && lyd_compare_single(sibling_src, match_trg, 0)) {
Michal Vasko4c583e82020-07-17 12:16:14 +02003747 /* update value */
3748 LY_CHECK_RET(lyd_any_copy_value(match_trg, &((struct lyd_node_any *)sibling_src)->value,
Radek Krejci0f969882020-08-21 16:56:47 +02003749 ((struct lyd_node_any *)sibling_src)->value_type));
Michal Vasko4490d312020-06-16 13:08:55 +02003750
3751 /* copy flags and add LYD_NEW */
Michal Vasko7e8315b2021-08-03 17:01:06 +02003752 match_trg->flags = sibling_src->flags | ((options & LYD_MERGE_WITH_FLAGS) ? 0 : LYD_NEW);
Michal Vaskocd3f6172021-05-18 16:14:50 +02003753 }
3754
3755 /* check descendants, recursively */
3756 ret = LY_SUCCESS;
3757 LY_LIST_FOR_SAFE(lyd_child_no_keys(sibling_src), tmp, child_src) {
3758 ret = lyd_merge_sibling_r(lyd_node_child_p(match_trg), match_trg, &child_src, merge_cb, cb_data, options,
3759 &child_dup_inst);
3760 if (ret) {
3761 break;
Michal Vasko4490d312020-06-16 13:08:55 +02003762 }
3763 }
Michal Vaskocd3f6172021-05-18 16:14:50 +02003764 lyd_dup_inst_free(child_dup_inst);
3765 LY_CHECK_RET(ret);
Michal Vasko4490d312020-06-16 13:08:55 +02003766 } else {
3767 /* node not found, merge it */
3768 if (options & LYD_MERGE_DESTRUCT) {
3769 dup_src = (struct lyd_node *)sibling_src;
3770 lyd_unlink_tree(dup_src);
3771 /* spend it */
3772 *sibling_src_p = NULL;
3773 } else {
Michal Vasko3a41dff2020-07-15 14:30:28 +02003774 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 +02003775 }
3776
Michal Vasko7e8315b2021-08-03 17:01:06 +02003777 if (!(options & LYD_MERGE_WITH_FLAGS)) {
3778 /* set LYD_NEW for all the new nodes, required for validation */
3779 LYD_TREE_DFS_BEGIN(dup_src, elem) {
3780 elem->flags |= LYD_NEW;
3781 LYD_TREE_DFS_END(dup_src, elem);
3782 }
Michal Vasko4490d312020-06-16 13:08:55 +02003783 }
3784
Michal Vaskocd3f6172021-05-18 16:14:50 +02003785 /* insert */
Michal Vasko6ee6f432021-07-16 09:49:14 +02003786 lyd_insert_node(parent_trg, first_trg, dup_src, 0);
Michal Vaskocd3f6172021-05-18 16:14:50 +02003787
3788 if (first_inst) {
3789 /* remember not to find this instance next time */
3790 LY_CHECK_RET(lyd_dup_inst_next(&dup_src, *first_trg, dup_inst));
3791 }
3792
3793 /* call callback, no source node */
3794 if (merge_cb) {
3795 LY_CHECK_RET(merge_cb(dup_src, NULL, cb_data));
3796 }
Michal Vasko4490d312020-06-16 13:08:55 +02003797 }
3798
3799 return LY_SUCCESS;
3800}
3801
Michal Vasko3a41dff2020-07-15 14:30:28 +02003802static LY_ERR
Michal Vaskocd3f6172021-05-18 16:14:50 +02003803lyd_merge(struct lyd_node **target, const struct lyd_node *source, const struct lys_module *mod,
3804 lyd_merge_cb merge_cb, void *cb_data, uint16_t options, ly_bool nosiblings)
Michal Vasko4490d312020-06-16 13:08:55 +02003805{
3806 const struct lyd_node *sibling_src, *tmp;
Michal Vaskocd3f6172021-05-18 16:14:50 +02003807 struct lyd_dup_inst *dup_inst = NULL;
Radek Krejci857189e2020-09-01 13:26:36 +02003808 ly_bool first;
Michal Vaskocd3f6172021-05-18 16:14:50 +02003809 LY_ERR ret = LY_SUCCESS;
Michal Vasko4490d312020-06-16 13:08:55 +02003810
3811 LY_CHECK_ARG_RET(NULL, target, LY_EINVAL);
3812
3813 if (!source) {
3814 /* nothing to merge */
3815 return LY_SUCCESS;
3816 }
3817
Michal Vasko831422b2020-11-24 11:20:51 +01003818 if ((*target && lysc_data_parent((*target)->schema)) || lysc_data_parent(source->schema)) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02003819 LOGERR(LYD_CTX(source), LY_EINVAL, "Invalid arguments - can merge only 2 top-level subtrees (%s()).", __func__);
Michal Vasko4490d312020-06-16 13:08:55 +02003820 return LY_EINVAL;
3821 }
3822
3823 LY_LIST_FOR_SAFE(source, tmp, sibling_src) {
Michal Vaskocd3f6172021-05-18 16:14:50 +02003824 if (mod && (lyd_owner_module(sibling_src) != mod)) {
3825 /* skip data nodes from different modules */
3826 continue;
3827 }
3828
Radek Krejci857189e2020-09-01 13:26:36 +02003829 first = (sibling_src == source) ? 1 : 0;
Michal Vaskocd3f6172021-05-18 16:14:50 +02003830 ret = lyd_merge_sibling_r(target, NULL, &sibling_src, merge_cb, cb_data, options, &dup_inst);
3831 if (ret) {
3832 break;
3833 }
Michal Vasko4490d312020-06-16 13:08:55 +02003834 if (first && !sibling_src) {
3835 /* source was spent (unlinked), move to the next node */
3836 source = tmp;
3837 }
3838
Michal Vasko3a41dff2020-07-15 14:30:28 +02003839 if (nosiblings) {
Michal Vasko4490d312020-06-16 13:08:55 +02003840 break;
3841 }
3842 }
3843
3844 if (options & LYD_MERGE_DESTRUCT) {
3845 /* free any leftover source data that were not merged */
3846 lyd_free_siblings((struct lyd_node *)source);
3847 }
3848
Michal Vaskocd3f6172021-05-18 16:14:50 +02003849 lyd_dup_inst_free(dup_inst);
3850 return ret;
Michal Vasko4490d312020-06-16 13:08:55 +02003851}
3852
Michal Vasko3a41dff2020-07-15 14:30:28 +02003853API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02003854lyd_merge_tree(struct lyd_node **target, const struct lyd_node *source, uint16_t options)
Michal Vasko3a41dff2020-07-15 14:30:28 +02003855{
Michal Vaskocd3f6172021-05-18 16:14:50 +02003856 return lyd_merge(target, source, NULL, NULL, NULL, options, 1);
Michal Vasko3a41dff2020-07-15 14:30:28 +02003857}
3858
3859API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02003860lyd_merge_siblings(struct lyd_node **target, const struct lyd_node *source, uint16_t options)
Michal Vasko3a41dff2020-07-15 14:30:28 +02003861{
Michal Vaskocd3f6172021-05-18 16:14:50 +02003862 return lyd_merge(target, source, NULL, NULL, NULL, options, 0);
3863}
3864
3865API LY_ERR
3866lyd_merge_module(struct lyd_node **target, const struct lyd_node *source, const struct lys_module *mod,
3867 lyd_merge_cb merge_cb, void *cb_data, uint16_t options)
3868{
3869 return lyd_merge(target, source, mod, merge_cb, cb_data, options, 0);
Michal Vasko3a41dff2020-07-15 14:30:28 +02003870}
3871
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003872static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02003873lyd_path_str_enlarge(char **buffer, size_t *buflen, size_t reqlen, ly_bool is_static)
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003874{
Michal Vasko14654712020-02-06 08:35:21 +01003875 /* ending \0 */
3876 ++reqlen;
3877
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003878 if (reqlen > *buflen) {
3879 if (is_static) {
3880 return LY_EINCOMPLETE;
3881 }
3882
3883 *buffer = ly_realloc(*buffer, reqlen * sizeof **buffer);
3884 if (!*buffer) {
3885 return LY_EMEM;
3886 }
3887
3888 *buflen = reqlen;
3889 }
3890
3891 return LY_SUCCESS;
3892}
3893
Michal Vaskod59035b2020-07-08 12:00:06 +02003894LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02003895lyd_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 +02003896{
3897 const struct lyd_node *key;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003898 size_t len;
3899 const char *val;
3900 char quot;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003901
Radek Krejcia1c1e542020-09-29 16:06:52 +02003902 for (key = lyd_child(node); key && (key->schema->flags & LYS_KEY); key = key->next) {
Radek Krejci6d5ba0c2021-04-26 07:49:59 +02003903 val = lyd_get_value(key);
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003904 len = 1 + strlen(key->schema->name) + 2 + strlen(val) + 2;
Michal Vaskoba99a3e2020-08-18 15:50:05 +02003905 LY_CHECK_RET(lyd_path_str_enlarge(buffer, buflen, *bufused + len, is_static));
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003906
3907 quot = '\'';
3908 if (strchr(val, '\'')) {
3909 quot = '"';
3910 }
3911 *bufused += sprintf(*buffer + *bufused, "[%s=%c%s%c]", key->schema->name, quot, val, quot);
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003912 }
3913
3914 return LY_SUCCESS;
3915}
3916
3917/**
3918 * @brief Append leaf-list value predicate to path.
3919 *
3920 * @param[in] node Node to print.
3921 * @param[in,out] buffer Buffer to print to.
3922 * @param[in,out] buflen Current buffer length.
3923 * @param[in,out] bufused Current number of characters used in @p buffer.
3924 * @param[in] is_static Whether buffer is static or can be reallocated.
3925 * @return LY_ERR
3926 */
3927static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02003928lyd_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 +02003929{
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003930 size_t len;
3931 const char *val;
3932 char quot;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003933
Radek Krejci6d5ba0c2021-04-26 07:49:59 +02003934 val = lyd_get_value(node);
Radek Krejcif13b87b2020-12-01 22:02:17 +01003935 len = 4 + strlen(val) + 2; /* "[.='" + val + "']" */
Michal Vaskoba99a3e2020-08-18 15:50:05 +02003936 LY_CHECK_RET(lyd_path_str_enlarge(buffer, buflen, *bufused + len, is_static));
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003937
3938 quot = '\'';
3939 if (strchr(val, '\'')) {
3940 quot = '"';
3941 }
3942 *bufused += sprintf(*buffer + *bufused, "[.=%c%s%c]", quot, val, quot);
3943
Michal Vaskoba99a3e2020-08-18 15:50:05 +02003944 return LY_SUCCESS;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003945}
3946
3947/**
3948 * @brief Append node position (relative to its other instances) predicate to path.
3949 *
3950 * @param[in] node Node to print.
3951 * @param[in,out] buffer Buffer to print to.
3952 * @param[in,out] buflen Current buffer length.
3953 * @param[in,out] bufused Current number of characters used in @p buffer.
3954 * @param[in] is_static Whether buffer is static or can be reallocated.
3955 * @return LY_ERR
3956 */
3957static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02003958lyd_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 +02003959{
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003960 size_t len;
Michal Vasko50cc0562021-05-18 16:15:43 +02003961 uint32_t pos;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003962 char *val = NULL;
3963 LY_ERR rc;
3964
Michal Vasko50cc0562021-05-18 16:15:43 +02003965 pos = lyd_list_pos(node);
3966 if (asprintf(&val, "%" PRIu32, pos) == -1) {
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003967 return LY_EMEM;
3968 }
3969
3970 len = 1 + strlen(val) + 1;
3971 rc = lyd_path_str_enlarge(buffer, buflen, *bufused + len, is_static);
3972 if (rc != LY_SUCCESS) {
3973 goto cleanup;
3974 }
3975
3976 *bufused += sprintf(*buffer + *bufused, "[%s]", val);
3977
3978cleanup:
3979 free(val);
3980 return rc;
3981}
3982
3983API char *
3984lyd_path(const struct lyd_node *node, LYD_PATH_TYPE pathtype, char *buffer, size_t buflen)
3985{
Radek Krejci857189e2020-09-01 13:26:36 +02003986 ly_bool is_static = 0;
Radek Krejci1deb5be2020-08-26 16:43:36 +02003987 uint32_t i, depth;
Michal Vasko14654712020-02-06 08:35:21 +01003988 size_t bufused = 0, len;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003989 const struct lyd_node *iter;
3990 const struct lys_module *mod;
Michal Vasko790b2bc2020-08-03 13:35:06 +02003991 LY_ERR rc = LY_SUCCESS;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003992
3993 LY_CHECK_ARG_RET(NULL, node, NULL);
3994 if (buffer) {
Michal Vasko16385f42021-05-18 16:16:09 +02003995 LY_CHECK_ARG_RET(LYD_CTX(node), buflen > 1, NULL);
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003996 is_static = 1;
Michal Vasko14654712020-02-06 08:35:21 +01003997 } else {
3998 buflen = 0;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003999 }
4000
4001 switch (pathtype) {
Radek Krejci635d2b82021-01-04 11:26:51 +01004002 case LYD_PATH_STD:
4003 case LYD_PATH_STD_NO_LAST_PRED:
Michal Vasko14654712020-02-06 08:35:21 +01004004 depth = 1;
Michal Vasko9e685082021-01-29 14:49:09 +01004005 for (iter = node; iter->parent; iter = lyd_parent(iter)) {
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004006 ++depth;
4007 }
4008
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004009 goto iter_print;
Michal Vasko14654712020-02-06 08:35:21 +01004010 while (depth) {
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004011 /* find the right node */
Michal Vasko9e685082021-01-29 14:49:09 +01004012 for (iter = node, i = 1; i < depth; iter = lyd_parent(iter), ++i) {}
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004013iter_print:
4014 /* print prefix and name */
4015 mod = NULL;
Michal Vasko69730152020-10-09 16:30:07 +02004016 if (iter->schema && (!iter->parent || (iter->schema->module != iter->parent->schema->module))) {
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004017 mod = iter->schema->module;
4018 }
4019
4020 /* realloc string */
Michal Vaskoad92b672020-11-12 13:11:31 +01004021 len = 1 + (mod ? strlen(mod->name) + 1 : 0) + (iter->schema ? strlen(iter->schema->name) :
4022 strlen(((struct lyd_node_opaq *)iter)->name.name));
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004023 rc = lyd_path_str_enlarge(&buffer, &buflen, bufused + len, is_static);
4024 if (rc != LY_SUCCESS) {
4025 break;
4026 }
4027
4028 /* print next node */
Radek Krejci1798aae2020-07-14 13:26:06 +02004029 bufused += sprintf(buffer + bufused, "/%s%s%s", mod ? mod->name : "", mod ? ":" : "",
Michal Vaskoad92b672020-11-12 13:11:31 +01004030 iter->schema ? iter->schema->name : ((struct lyd_node_opaq *)iter)->name.name);
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004031
Michal Vasko790b2bc2020-08-03 13:35:06 +02004032 /* do not always print the last (first) predicate */
Radek Krejci635d2b82021-01-04 11:26:51 +01004033 if (iter->schema && ((depth > 1) || (pathtype == LYD_PATH_STD))) {
Michal Vasko790b2bc2020-08-03 13:35:06 +02004034 switch (iter->schema->nodetype) {
4035 case LYS_LIST:
4036 if (iter->schema->flags & LYS_KEYLESS) {
4037 /* print its position */
4038 rc = lyd_path_position_predicate(iter, &buffer, &buflen, &bufused, is_static);
4039 } else {
4040 /* print all list keys in predicates */
4041 rc = lyd_path_list_predicate(iter, &buffer, &buflen, &bufused, is_static);
4042 }
4043 break;
4044 case LYS_LEAFLIST:
4045 if (iter->schema->flags & LYS_CONFIG_W) {
4046 /* print leaf-list value */
4047 rc = lyd_path_leaflist_predicate(iter, &buffer, &buflen, &bufused, is_static);
4048 } else {
4049 /* print its position */
4050 rc = lyd_path_position_predicate(iter, &buffer, &buflen, &bufused, is_static);
4051 }
4052 break;
4053 default:
4054 /* nothing to print more */
4055 break;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004056 }
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004057 }
4058 if (rc != LY_SUCCESS) {
4059 break;
4060 }
4061
Michal Vasko14654712020-02-06 08:35:21 +01004062 --depth;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004063 }
4064 break;
4065 }
4066
4067 return buffer;
4068}
Michal Vaskoe444f752020-02-10 12:20:06 +01004069
Michal Vasko25a32822020-07-09 15:48:22 +02004070API struct lyd_meta *
4071lyd_find_meta(const struct lyd_meta *first, const struct lys_module *module, const char *name)
4072{
4073 struct lyd_meta *ret = NULL;
4074 const struct ly_ctx *ctx;
4075 const char *prefix, *tmp;
4076 char *str;
4077 size_t pref_len, name_len;
4078
4079 LY_CHECK_ARG_RET(NULL, module || strchr(name, ':'), name, NULL);
4080
4081 if (!first) {
4082 return NULL;
4083 }
4084
4085 ctx = first->annotation->module->ctx;
4086
4087 /* parse the name */
4088 tmp = name;
4089 if (ly_parse_nodeid(&tmp, &prefix, &pref_len, &name, &name_len) || tmp[0]) {
4090 LOGERR(ctx, LY_EINVAL, "Metadata name \"%s\" is not valid.", name);
4091 return NULL;
4092 }
4093
4094 /* find the module */
4095 if (prefix) {
4096 str = strndup(prefix, pref_len);
4097 module = ly_ctx_get_module_latest(ctx, str);
4098 free(str);
Radek Krejci422afb12021-03-04 16:38:16 +01004099 LY_CHECK_ERR_RET(!module, LOGERR(ctx, LY_EINVAL, "Module \"%.*s\" not found.", (int)pref_len, prefix), NULL);
Michal Vasko25a32822020-07-09 15:48:22 +02004100 }
4101
4102 /* find the metadata */
4103 LY_LIST_FOR(first, first) {
4104 if ((first->annotation->module == module) && !strcmp(first->name, name)) {
4105 ret = (struct lyd_meta *)first;
4106 break;
4107 }
4108 }
4109
4110 return ret;
4111}
4112
Michal Vasko9b368d32020-02-14 13:53:31 +01004113API LY_ERR
Michal Vaskoe444f752020-02-10 12:20:06 +01004114lyd_find_sibling_first(const struct lyd_node *siblings, const struct lyd_node *target, struct lyd_node **match)
4115{
Michal Vaskoe78faec2021-04-08 17:24:43 +02004116 struct lyd_node **match_p, *iter;
Michal Vaskoe444f752020-02-10 12:20:06 +01004117 struct lyd_node_inner *parent;
Michal Vaskoe78faec2021-04-08 17:24:43 +02004118 ly_bool found;
Michal Vaskoe444f752020-02-10 12:20:06 +01004119
Michal Vaskof03ed032020-03-04 13:31:44 +01004120 LY_CHECK_ARG_RET(NULL, target, LY_EINVAL);
Michal Vaskoe444f752020-02-10 12:20:06 +01004121
Michal Vasko6da1e952020-12-09 18:14:38 +01004122 if (!siblings || (siblings->schema && target->schema &&
4123 (lysc_data_parent(siblings->schema) != lysc_data_parent(target->schema)))) {
Michal Vasko62ed12d2020-05-21 10:08:25 +02004124 /* no data or schema mismatch */
Michal Vasko9b368d32020-02-14 13:53:31 +01004125 if (match) {
4126 *match = NULL;
4127 }
Michal Vaskoe444f752020-02-10 12:20:06 +01004128 return LY_ENOTFOUND;
4129 }
4130
Michal Vaskoe78faec2021-04-08 17:24:43 +02004131 /* get first sibling */
4132 siblings = lyd_first_sibling(siblings);
Michal Vaskoe444f752020-02-10 12:20:06 +01004133
Michal Vasko9e685082021-01-29 14:49:09 +01004134 parent = siblings->parent;
Michal Vasko6da1e952020-12-09 18:14:38 +01004135 if (parent && parent->schema && parent->children_ht) {
Michal Vaskoe444f752020-02-10 12:20:06 +01004136 assert(target->hash);
4137
Michal Vaskoe78faec2021-04-08 17:24:43 +02004138 if (lysc_is_dup_inst_list(target->schema)) {
4139 /* we must search the instances from beginning to find the first matching one */
4140 found = 0;
4141 LYD_LIST_FOR_INST(siblings, target->schema, iter) {
4142 if (!lyd_compare_single(target, iter, 0)) {
4143 found = 1;
4144 break;
4145 }
4146 }
4147 if (found) {
4148 siblings = iter;
Michal Vaskoda859032020-07-14 12:20:14 +02004149 } else {
4150 siblings = NULL;
4151 }
Michal Vaskoe444f752020-02-10 12:20:06 +01004152 } else {
Michal Vaskoe78faec2021-04-08 17:24:43 +02004153 /* find by hash */
4154 if (!lyht_find(parent->children_ht, &target, target->hash, (void **)&match_p)) {
4155 siblings = *match_p;
4156 } else {
4157 /* not found */
4158 siblings = NULL;
4159 }
Michal Vaskoe444f752020-02-10 12:20:06 +01004160 }
4161 } else {
4162 /* no children hash table */
Michal Vaskod989ba02020-08-24 10:59:24 +02004163 for ( ; siblings; siblings = siblings->next) {
Michal Vasko8f359bf2020-07-28 10:41:15 +02004164 if (!lyd_compare_single(siblings, target, 0)) {
Michal Vaskoe444f752020-02-10 12:20:06 +01004165 break;
4166 }
4167 }
4168 }
4169
4170 if (!siblings) {
Michal Vasko9b368d32020-02-14 13:53:31 +01004171 if (match) {
4172 *match = NULL;
4173 }
Michal Vaskoe444f752020-02-10 12:20:06 +01004174 return LY_ENOTFOUND;
4175 }
4176
Michal Vasko9b368d32020-02-14 13:53:31 +01004177 if (match) {
4178 *match = (struct lyd_node *)siblings;
4179 }
Michal Vaskoe444f752020-02-10 12:20:06 +01004180 return LY_SUCCESS;
4181}
4182
Radek Krejci857189e2020-09-01 13:26:36 +02004183/**
4184 * @brief Comparison callback to match schema node with a schema of a data node.
4185 *
4186 * @param[in] val1_p Pointer to the schema node
4187 * @param[in] val2_p Pointer to the data node
Michal Vasko62524a92021-02-26 10:08:50 +01004188 * Implementation of ::lyht_value_equal_cb.
Radek Krejci857189e2020-09-01 13:26:36 +02004189 */
4190static ly_bool
4191lyd_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 +01004192{
4193 struct lysc_node *val1;
4194 struct lyd_node *val2;
4195
4196 val1 = *((struct lysc_node **)val1_p);
4197 val2 = *((struct lyd_node **)val2_p);
4198
Michal Vasko90932a92020-02-12 14:33:03 +01004199 if (val1 == val2->schema) {
4200 /* schema match is enough */
4201 return 1;
4202 } else {
4203 return 0;
4204 }
4205}
4206
Michal Vasko92239c72020-11-18 18:17:25 +01004207/**
4208 * @brief Search in the given siblings (NOT recursively) for the first schema node data instance.
4209 * Uses hashes - should be used whenever possible for best performance.
4210 *
4211 * @param[in] siblings Siblings to search in including preceding and succeeding nodes.
4212 * @param[in] schema Target data node schema to find.
4213 * @param[out] match Can be NULL, otherwise the found data node.
4214 * @return LY_SUCCESS on success, @p match set.
4215 * @return LY_ENOTFOUND if not found, @p match set to NULL.
4216 * @return LY_ERR value if another error occurred.
4217 */
Michal Vasko90932a92020-02-12 14:33:03 +01004218static LY_ERR
4219lyd_find_sibling_schema(const struct lyd_node *siblings, const struct lysc_node *schema, struct lyd_node **match)
4220{
4221 struct lyd_node **match_p;
4222 struct lyd_node_inner *parent;
4223 uint32_t hash;
Michal Vasko62524a92021-02-26 10:08:50 +01004224 lyht_value_equal_cb ht_cb;
Michal Vasko90932a92020-02-12 14:33:03 +01004225
Michal Vaskob104f112020-07-17 09:54:54 +02004226 assert(siblings && schema);
Michal Vasko90932a92020-02-12 14:33:03 +01004227
Michal Vasko9e685082021-01-29 14:49:09 +01004228 parent = siblings->parent;
Michal Vasko08fd6132020-11-18 18:17:45 +01004229 if (parent && parent->schema && parent->children_ht) {
Michal Vasko90932a92020-02-12 14:33:03 +01004230 /* calculate our hash */
4231 hash = dict_hash_multi(0, schema->module->name, strlen(schema->module->name));
4232 hash = dict_hash_multi(hash, schema->name, strlen(schema->name));
4233 hash = dict_hash_multi(hash, NULL, 0);
4234
4235 /* use special hash table function */
4236 ht_cb = lyht_set_cb(parent->children_ht, lyd_hash_table_schema_val_equal);
4237
4238 /* find by hash */
4239 if (!lyht_find(parent->children_ht, &schema, hash, (void **)&match_p)) {
4240 siblings = *match_p;
4241 } else {
4242 /* not found */
4243 siblings = NULL;
4244 }
4245
4246 /* set the original hash table compare function back */
4247 lyht_set_cb(parent->children_ht, ht_cb);
4248 } else {
Michal Vaskob104f112020-07-17 09:54:54 +02004249 /* find first sibling */
4250 if (siblings->parent) {
4251 siblings = siblings->parent->child;
4252 } else {
4253 while (siblings->prev->next) {
4254 siblings = siblings->prev;
4255 }
4256 }
4257
4258 /* search manually without hashes */
Michal Vaskod989ba02020-08-24 10:59:24 +02004259 for ( ; siblings; siblings = siblings->next) {
Michal Vasko90932a92020-02-12 14:33:03 +01004260 if (siblings->schema == schema) {
4261 /* schema match is enough */
4262 break;
4263 }
4264 }
4265 }
4266
4267 if (!siblings) {
Michal Vasko9b368d32020-02-14 13:53:31 +01004268 if (match) {
4269 *match = NULL;
4270 }
Michal Vasko90932a92020-02-12 14:33:03 +01004271 return LY_ENOTFOUND;
4272 }
4273
Michal Vasko9b368d32020-02-14 13:53:31 +01004274 if (match) {
4275 *match = (struct lyd_node *)siblings;
4276 }
Michal Vasko90932a92020-02-12 14:33:03 +01004277 return LY_SUCCESS;
4278}
4279
Michal Vaskoe444f752020-02-10 12:20:06 +01004280API LY_ERR
4281lyd_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 +02004282 size_t val_len, struct lyd_node **match)
Michal Vaskoe444f752020-02-10 12:20:06 +01004283{
4284 LY_ERR rc;
4285 struct lyd_node *target = NULL;
4286
Michal Vasko4c583e82020-07-17 12:16:14 +02004287 LY_CHECK_ARG_RET(NULL, schema, !(schema->nodetype & (LYS_CHOICE | LYS_CASE)), LY_EINVAL);
Michal Vaskoe444f752020-02-10 12:20:06 +01004288
Michal Vasko08fd6132020-11-18 18:17:45 +01004289 if (!siblings || (siblings->schema && (lysc_data_parent(siblings->schema) != lysc_data_parent(schema)))) {
Michal Vasko62ed12d2020-05-21 10:08:25 +02004290 /* no data or schema mismatch */
Michal Vasko9b368d32020-02-14 13:53:31 +01004291 if (match) {
4292 *match = NULL;
4293 }
Michal Vaskoe444f752020-02-10 12:20:06 +01004294 return LY_ENOTFOUND;
4295 }
4296
Michal Vaskof03ed032020-03-04 13:31:44 +01004297 if (key_or_value && !val_len) {
4298 val_len = strlen(key_or_value);
4299 }
4300
Michal Vaskob104f112020-07-17 09:54:54 +02004301 if ((schema->nodetype & (LYS_LIST | LYS_LEAFLIST)) && key_or_value) {
4302 /* create a data node and find the instance */
4303 if (schema->nodetype == LYS_LEAFLIST) {
4304 /* target used attributes: schema, hash, value */
Radek Krejci8df109d2021-04-23 12:19:08 +02004305 rc = lyd_create_term(schema, key_or_value, val_len, NULL, LY_VALUE_JSON, NULL, LYD_HINT_DATA, NULL, &target);
Michal Vaskofeca4fb2020-10-05 08:58:40 +02004306 LY_CHECK_RET(rc);
Michal Vaskob104f112020-07-17 09:54:54 +02004307 } else {
Michal Vasko90932a92020-02-12 14:33:03 +01004308 /* target used attributes: schema, hash, child (all keys) */
Michal Vasko004d3152020-06-11 19:59:22 +02004309 LY_CHECK_RET(lyd_create_list2(schema, key_or_value, val_len, &target));
Michal Vasko90932a92020-02-12 14:33:03 +01004310 }
4311
4312 /* find it */
4313 rc = lyd_find_sibling_first(siblings, target, match);
Michal Vaskob104f112020-07-17 09:54:54 +02004314 } else {
4315 /* find the first schema node instance */
4316 rc = lyd_find_sibling_schema(siblings, schema, match);
Michal Vaskoe444f752020-02-10 12:20:06 +01004317 }
4318
Michal Vaskoe444f752020-02-10 12:20:06 +01004319 lyd_free_tree(target);
4320 return rc;
4321}
Michal Vaskoccc02342020-05-21 10:09:21 +02004322
4323API LY_ERR
Michal Vaskoe78faec2021-04-08 17:24:43 +02004324lyd_find_sibling_dup_inst_set(const struct lyd_node *siblings, const struct lyd_node *target, struct ly_set **set)
4325{
4326 struct lyd_node **match_p, *first, *iter;
4327 struct lyd_node_inner *parent;
4328
4329 LY_CHECK_ARG_RET(NULL, target, lysc_is_dup_inst_list(target->schema), set, LY_EINVAL);
4330
4331 LY_CHECK_RET(ly_set_new(set));
4332
4333 if (!siblings || (siblings->schema && (lysc_data_parent(siblings->schema) != lysc_data_parent(target->schema)))) {
4334 /* no data or schema mismatch */
4335 return LY_ENOTFOUND;
4336 }
4337
4338 /* get first sibling */
4339 siblings = lyd_first_sibling(siblings);
4340
4341 parent = siblings->parent;
4342 if (parent && parent->schema && parent->children_ht) {
4343 assert(target->hash);
4344
4345 /* find the first instance */
4346 lyd_find_sibling_first(siblings, target, &first);
4347 if (first) {
4348 /* add it so that it is the first in the set */
4349 if (ly_set_add(*set, first, 1, NULL)) {
4350 goto error;
4351 }
4352
4353 /* find by hash */
4354 if (!lyht_find(parent->children_ht, &target, target->hash, (void **)&match_p)) {
4355 iter = *match_p;
4356 } else {
4357 /* not found */
4358 iter = NULL;
4359 }
4360 while (iter) {
4361 /* add all found nodes into the set */
4362 if ((iter != first) && !lyd_compare_single(iter, target, 0) && ly_set_add(*set, iter, 1, NULL)) {
4363 goto error;
4364 }
4365
4366 /* find next instance */
4367 if (lyht_find_next(parent->children_ht, &iter, iter->hash, (void **)&match_p)) {
4368 iter = NULL;
4369 } else {
4370 iter = *match_p;
4371 }
4372 }
4373 }
4374 } else {
4375 /* no children hash table */
4376 LY_LIST_FOR(siblings, siblings) {
4377 if (!lyd_compare_single(target, siblings, 0)) {
4378 ly_set_add(*set, (void *)siblings, 1, NULL);
4379 }
4380 }
4381 }
4382
4383 if (!(*set)->count) {
4384 return LY_ENOTFOUND;
4385 }
4386 return LY_SUCCESS;
4387
4388error:
4389 ly_set_free(*set, NULL);
4390 *set = NULL;
4391 return LY_EMEM;
4392}
4393
4394API LY_ERR
Michal Vasko1d4af6c2021-02-22 13:31:26 +01004395lyd_find_sibling_opaq_next(const struct lyd_node *first, const char *name, struct lyd_node **match)
4396{
4397 LY_CHECK_ARG_RET(NULL, name, LY_EINVAL);
4398
4399 for ( ; first; first = first->next) {
4400 if (!first->schema && !strcmp(LYD_NAME(first), name)) {
4401 break;
4402 }
4403 }
4404
4405 if (match) {
4406 *match = (struct lyd_node *)first;
4407 }
4408 return first ? LY_SUCCESS : LY_ENOTFOUND;
4409}
4410
4411API LY_ERR
aPiecekfba75362021-10-07 12:39:48 +02004412lyd_find_xpath2(const struct lyd_node *ctx_node, const char *xpath, const struct lyxp_var *vars, struct ly_set **set)
Michal Vaskoccc02342020-05-21 10:09:21 +02004413{
4414 LY_ERR ret = LY_SUCCESS;
Michal Vasko8bd9cc72021-07-16 14:06:10 +02004415 struct lyxp_set xp_set = {0};
Radek Krejcif03a9e22020-09-18 20:09:31 +02004416 struct lyxp_expr *exp = NULL;
Michal Vaskoccc02342020-05-21 10:09:21 +02004417 uint32_t i;
4418
4419 LY_CHECK_ARG_RET(NULL, ctx_node, xpath, set, LY_EINVAL);
4420
Michal Vasko37c69432021-04-12 14:48:24 +02004421 *set = NULL;
Michal Vaskoccc02342020-05-21 10:09:21 +02004422
4423 /* compile expression */
Radek Krejcif03a9e22020-09-18 20:09:31 +02004424 ret = lyxp_expr_parse((struct ly_ctx *)LYD_CTX(ctx_node), xpath, 0, 1, &exp);
4425 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskoccc02342020-05-21 10:09:21 +02004426
4427 /* evaluate expression */
aPiecekfba75362021-10-07 12:39:48 +02004428 ret = lyxp_eval(LYD_CTX(ctx_node), exp, NULL, LY_VALUE_JSON, NULL, ctx_node, ctx_node, vars, &xp_set, LYXP_IGNORE_WHEN);
Michal Vaskoccc02342020-05-21 10:09:21 +02004429 LY_CHECK_GOTO(ret, cleanup);
4430
4431 /* allocate return set */
Radek Krejciba03a5a2020-08-27 14:40:41 +02004432 ret = ly_set_new(set);
4433 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskoccc02342020-05-21 10:09:21 +02004434
4435 /* transform into ly_set */
4436 if (xp_set.type == LYXP_SET_NODE_SET) {
4437 /* allocate memory for all the elements once (even though not all items must be elements but most likely will be) */
4438 (*set)->objs = malloc(xp_set.used * sizeof *(*set)->objs);
Michal Vaskob7be7a82020-08-20 09:09:04 +02004439 LY_CHECK_ERR_GOTO(!(*set)->objs, LOGMEM(LYD_CTX(ctx_node)); ret = LY_EMEM, cleanup);
Michal Vaskoccc02342020-05-21 10:09:21 +02004440 (*set)->size = xp_set.used;
4441
4442 for (i = 0; i < xp_set.used; ++i) {
4443 if (xp_set.val.nodes[i].type == LYXP_NODE_ELEM) {
Radek Krejci3d92e442020-10-12 12:48:13 +02004444 ret = ly_set_add(*set, xp_set.val.nodes[i].node, 1, NULL);
Radek Krejciba03a5a2020-08-27 14:40:41 +02004445 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskoccc02342020-05-21 10:09:21 +02004446 }
4447 }
4448 }
4449
4450cleanup:
Michal Vasko0691d522020-05-21 13:21:47 +02004451 lyxp_set_free_content(&xp_set);
Michal Vaskob7be7a82020-08-20 09:09:04 +02004452 lyxp_expr_free((struct ly_ctx *)LYD_CTX(ctx_node), exp);
Radek Krejci8f45abc2020-11-26 12:15:13 +01004453 if (ret) {
4454 ly_set_free(*set, NULL);
4455 *set = NULL;
4456 }
Michal Vaskoccc02342020-05-21 10:09:21 +02004457 return ret;
4458}
Radek Krejcica989142020-11-05 11:32:22 +01004459
Michal Vasko3e1f6552021-01-14 09:27:55 +01004460API LY_ERR
aPiecekfba75362021-10-07 12:39:48 +02004461lyd_find_xpath(const struct lyd_node *ctx_node, const char *xpath, struct ly_set **set)
4462{
4463 return lyd_find_xpath2(ctx_node, xpath, NULL, set);
4464}
4465
4466API LY_ERR
4467lyd_eval_xpath2(const struct lyd_node *ctx_node, const char *xpath, const struct lyxp_var *vars, ly_bool *result)
Michal Vaskoc9eb3ca2021-07-16 10:20:37 +02004468{
4469 LY_ERR ret = LY_SUCCESS;
Michal Vasko8bd9cc72021-07-16 14:06:10 +02004470 struct lyxp_set xp_set = {0};
Michal Vaskoc9eb3ca2021-07-16 10:20:37 +02004471 struct lyxp_expr *exp = NULL;
4472
4473 LY_CHECK_ARG_RET(NULL, ctx_node, xpath, result, LY_EINVAL);
4474
4475 /* compile expression */
4476 ret = lyxp_expr_parse((struct ly_ctx *)LYD_CTX(ctx_node), xpath, 0, 1, &exp);
4477 LY_CHECK_GOTO(ret, cleanup);
4478
4479 /* evaluate expression */
aPiecekfba75362021-10-07 12:39:48 +02004480 ret = lyxp_eval(LYD_CTX(ctx_node), exp, NULL, LY_VALUE_JSON, NULL, ctx_node, ctx_node, vars, &xp_set, LYXP_IGNORE_WHEN);
Michal Vaskoc9eb3ca2021-07-16 10:20:37 +02004481 LY_CHECK_GOTO(ret, cleanup);
4482
4483 /* transform into boolean */
4484 ret = lyxp_set_cast(&xp_set, LYXP_SET_BOOLEAN);
4485 LY_CHECK_GOTO(ret, cleanup);
4486
4487 /* set result */
4488 *result = xp_set.val.bln;
4489
4490cleanup:
4491 lyxp_set_free_content(&xp_set);
4492 lyxp_expr_free((struct ly_ctx *)LYD_CTX(ctx_node), exp);
4493 return ret;
4494}
4495
4496API LY_ERR
aPiecekfba75362021-10-07 12:39:48 +02004497lyd_eval_xpath(const struct lyd_node *ctx_node, const char *xpath, ly_bool *result)
4498{
4499 return lyd_eval_xpath2(ctx_node, xpath, NULL, result);
4500}
4501
4502API LY_ERR
Michal Vasko3e1f6552021-01-14 09:27:55 +01004503lyd_find_path(const struct lyd_node *ctx_node, const char *path, ly_bool output, struct lyd_node **match)
4504{
4505 LY_ERR ret = LY_SUCCESS;
4506 struct lyxp_expr *expr = NULL;
4507 struct ly_path *lypath = NULL;
4508
4509 LY_CHECK_ARG_RET(NULL, ctx_node, ctx_node->schema, path, LY_EINVAL);
4510
4511 /* parse the path */
Michal Vaskoed725d72021-06-23 12:03:45 +02004512 ret = ly_path_parse(LYD_CTX(ctx_node), ctx_node->schema, path, strlen(path), 0, LY_PATH_BEGIN_EITHER,
Michal Vasko3e1f6552021-01-14 09:27:55 +01004513 LY_PATH_PREFIX_OPTIONAL, LY_PATH_PRED_SIMPLE, &expr);
4514 LY_CHECK_GOTO(ret, cleanup);
4515
4516 /* compile the path */
Michal Vaskoed725d72021-06-23 12:03:45 +02004517 ret = ly_path_compile(LYD_CTX(ctx_node), NULL, ctx_node->schema, NULL, expr,
Michal Vasko0884d212021-10-14 09:21:46 +02004518 output ? LY_PATH_OPER_OUTPUT : LY_PATH_OPER_INPUT, LY_PATH_TARGET_SINGLE, 0, LY_VALUE_JSON, NULL, &lypath);
Michal Vasko3e1f6552021-01-14 09:27:55 +01004519 LY_CHECK_GOTO(ret, cleanup);
4520
4521 /* evaluate the path */
4522 ret = ly_path_eval_partial(lypath, ctx_node, NULL, match);
4523
4524cleanup:
4525 lyxp_expr_free(LYD_CTX(ctx_node), expr);
4526 ly_path_free(LYD_CTX(ctx_node), lypath);
4527 return ret;
4528}
4529
Michal Vaskobb22b182021-06-14 08:14:21 +02004530API LY_ERR
4531lyd_find_target(const struct ly_path *path, const struct lyd_node *tree, struct lyd_node **match)
4532{
4533 LY_ERR ret;
4534 struct lyd_node *m;
4535
4536 LY_CHECK_ARG_RET(NULL, path, LY_EINVAL);
4537
4538 ret = ly_path_eval(path, tree, &m);
4539 if (ret) {
4540 if (match) {
4541 *match = NULL;
4542 }
4543 return LY_ENOTFOUND;
4544 }
4545
4546 if (match) {
4547 *match = m;
4548 }
4549 return LY_SUCCESS;
4550}
4551
Radek Krejcica989142020-11-05 11:32:22 +01004552API uint32_t
4553lyd_list_pos(const struct lyd_node *instance)
4554{
4555 const struct lyd_node *iter = NULL;
4556 uint32_t pos = 0;
4557
4558 if (!instance || !(instance->schema->nodetype & (LYS_LIST | LYS_LEAFLIST))) {
4559 return 0;
4560 }
4561
4562 /* data instances are ordered, so we can stop when we found instance of other schema node */
4563 for (iter = instance; iter->schema == instance->schema; iter = iter->prev) {
Radek Krejcibb27df32020-11-13 15:39:16 +01004564 if (pos && (iter->next == NULL)) {
Radek Krejcica989142020-11-05 11:32:22 +01004565 /* overrun to the end of the siblings list */
4566 break;
4567 }
4568 ++pos;
4569 }
4570
4571 return pos;
4572}
Radek Krejci4233f9b2020-11-05 12:38:35 +01004573
4574API struct lyd_node *
4575lyd_first_sibling(const struct lyd_node *node)
4576{
4577 struct lyd_node *start;
4578
4579 if (!node) {
4580 return NULL;
4581 }
4582
4583 /* get the first sibling */
4584 if (node->parent) {
4585 start = node->parent->child;
4586 } else {
Radek Krejcibb27df32020-11-13 15:39:16 +01004587 for (start = (struct lyd_node *)node; start->prev->next; start = start->prev) {}
Radek Krejci4233f9b2020-11-05 12:38:35 +01004588 }
4589
4590 return start;
4591}