blob: c864d7b506d3bc005f642beb297e01ebca9f9b89 [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
267 assert(node->schema->nodetype & LYD_NODE_TERM);
268 term = (const struct lyd_node_term *)node;
269
270 if (node->schema->nodetype == LYS_LEAF) {
271 leaf = (const struct lysc_node_leaf *)node->schema;
272 if (!leaf->dflt) {
273 return 0;
274 }
275
276 /* compare with the default value */
277 if (leaf->type->plugin->compare(&term->value, leaf->dflt)) {
278 return 0;
279 }
280 } else {
281 llist = (const struct lysc_node_leaflist *)node->schema;
282 if (!llist->dflts) {
283 return 0;
284 }
285
286 LY_ARRAY_FOR(llist->dflts, u) {
287 /* compare with each possible default value */
288 if (llist->type->plugin->compare(&term->value, llist->dflts[u])) {
289 return 0;
290 }
291 }
292 }
293
294 return 1;
295}
296
Radek Krejci7931b192020-06-25 17:05:03 +0200297static LYD_FORMAT
Michal Vasko63f3d842020-07-08 10:10:14 +0200298lyd_parse_get_format(const struct ly_in *in, LYD_FORMAT format)
Radek Krejcie7b95092019-05-15 11:03:07 +0200299{
Michal Vasko69730152020-10-09 16:30:07 +0200300 if (!format && (in->type == LY_IN_FILEPATH)) {
Radek Krejcie7b95092019-05-15 11:03:07 +0200301 /* unknown format - try to detect it from filename's suffix */
Radek Krejci7931b192020-06-25 17:05:03 +0200302 const char *path = in->method.fpath.filepath;
303 size_t len = strlen(path);
Radek Krejcie7b95092019-05-15 11:03:07 +0200304
305 /* ignore trailing whitespaces */
Michal Vaskod989ba02020-08-24 10:59:24 +0200306 for ( ; len > 0 && isspace(path[len - 1]); len--) {}
Radek Krejcie7b95092019-05-15 11:03:07 +0200307
Radek Krejcif13b87b2020-12-01 22:02:17 +0100308 if ((len >= LY_XML_SUFFIX_LEN + 1) &&
309 !strncmp(&path[len - LY_XML_SUFFIX_LEN], LY_XML_SUFFIX, LY_XML_SUFFIX_LEN)) {
Radek Krejcie7b95092019-05-15 11:03:07 +0200310 format = LYD_XML;
Radek Krejcif13b87b2020-12-01 22:02:17 +0100311 } else if ((len >= LY_JSON_SUFFIX_LEN + 1) &&
312 !strncmp(&path[len - LY_JSON_SUFFIX_LEN], LY_JSON_SUFFIX, LY_JSON_SUFFIX_LEN)) {
Radek Krejcie7b95092019-05-15 11:03:07 +0200313 format = LYD_JSON;
Radek Krejcif13b87b2020-12-01 22:02:17 +0100314 } else if ((len >= LY_LYB_SUFFIX_LEN + 1) &&
315 !strncmp(&path[len - LY_LYB_SUFFIX_LEN], LY_LYB_SUFFIX, LY_LYB_SUFFIX_LEN)) {
Radek Krejcie7b95092019-05-15 11:03:07 +0200316 format = LYD_LYB;
Radek Krejci7931b192020-06-25 17:05:03 +0200317 } /* else still unknown */
Radek Krejcie7b95092019-05-15 11:03:07 +0200318 }
319
Radek Krejci7931b192020-06-25 17:05:03 +0200320 return format;
321}
Radek Krejcie7b95092019-05-15 11:03:07 +0200322
Michal Vaskoe0665742021-02-11 11:08:44 +0100323/**
324 * @brief Parse YANG data into a data tree.
325 *
326 * @param[in] ctx libyang context.
Radek Krejcif16e2542021-02-17 15:39:23 +0100327 * @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 +0100328 * @param[in] parent Parent to connect the parsed nodes to, if any.
329 * @param[in,out] first_p Pointer to the first top-level parsed node, used only if @p parent is NULL.
330 * @param[in] in Input handle to read the input from.
331 * @param[in] format Expected format of the data in @p in.
332 * @param[in] parse_opts Options for parser.
333 * @param[in] val_opts Options for validation.
334 * @param[out] op Optional pointer to the parsed operation, if any.
335 * @return LY_ERR value.
336 */
337static LY_ERR
Radek Krejcif16e2542021-02-17 15:39:23 +0100338lyd_parse(const struct ly_ctx *ctx, const struct lysc_ext_instance *ext, struct lyd_node *parent, struct lyd_node **first_p,
339 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 +0200340{
Michal Vaskoe0665742021-02-11 11:08:44 +0100341 LY_ERR rc = LY_SUCCESS;
Radek Krejci1798aae2020-07-14 13:26:06 +0200342 struct lyd_ctx *lydctx = NULL;
Michal Vaskoe0665742021-02-11 11:08:44 +0100343 struct ly_set parsed = {0};
344 struct lyd_node *first;
345 uint32_t i;
Radek Krejci1798aae2020-07-14 13:26:06 +0200346
Michal Vaskoe0665742021-02-11 11:08:44 +0100347 assert(ctx && (parent || first_p));
Radek Krejci7931b192020-06-25 17:05:03 +0200348
349 format = lyd_parse_get_format(in, format);
Michal Vaskoe0665742021-02-11 11:08:44 +0100350 if (first_p) {
351 *first_p = NULL;
352 }
Radek Krejci1798aae2020-07-14 13:26:06 +0200353
Michal Vasko63f3d842020-07-08 10:10:14 +0200354 /* remember input position */
355 in->func_start = in->current;
Radek Krejci7931b192020-06-25 17:05:03 +0200356
Michal Vaskoe0665742021-02-11 11:08:44 +0100357 /* parse the data */
Radek Krejci7931b192020-06-25 17:05:03 +0200358 switch (format) {
359 case LYD_XML:
Radek Krejcif16e2542021-02-17 15:39:23 +0100360 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 +0200361 break;
Radek Krejci7931b192020-06-25 17:05:03 +0200362 case LYD_JSON:
Radek Krejcif16e2542021-02-17 15:39:23 +0100363 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 +0200364 break;
Radek Krejci7931b192020-06-25 17:05:03 +0200365 case LYD_LYB:
Radek Krejcif16e2542021-02-17 15:39:23 +0100366 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 +0200367 break;
Michal Vaskoc8a230d2020-08-14 12:17:10 +0200368 case LYD_UNKNOWN:
Michal Vaskod74978f2021-02-12 11:59:36 +0100369 LOGARG(ctx, format);
370 rc = LY_EINVAL;
Michal Vaskoe0665742021-02-11 11:08:44 +0100371 break;
372 }
373 LY_CHECK_GOTO(rc, cleanup);
374
375 if (parent) {
376 /* get first top-level sibling */
377 for (first = parent; first->parent; first = lyd_parent(first)) {}
378 first = lyd_first_sibling(first);
379 first_p = &first;
Radek Krejci7931b192020-06-25 17:05:03 +0200380 }
381
Michal Vaskoe0665742021-02-11 11:08:44 +0100382 if (!(parse_opts & LYD_PARSE_ONLY)) {
383 /* validate data */
Radek Krejci4f2e3e52021-03-30 14:20:28 +0200384 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 +0100385 &lydctx->meta_types, NULL);
386 LY_CHECK_GOTO(rc, cleanup);
387 }
Radek Krejci7931b192020-06-25 17:05:03 +0200388
Michal Vaskoe0665742021-02-11 11:08:44 +0100389 /* set the operation node */
390 if (op) {
391 *op = lydctx->op_node;
Radek Krejci1798aae2020-07-14 13:26:06 +0200392 }
393
394cleanup:
Michal Vaskoe0665742021-02-11 11:08:44 +0100395 if (lydctx) {
396 lydctx->free(lydctx);
Radek Krejci1798aae2020-07-14 13:26:06 +0200397 }
Michal Vaskoe0665742021-02-11 11:08:44 +0100398 if (rc) {
399 if (parent) {
400 /* free all the parsed subtrees */
401 for (i = 0; i < parsed.count; ++i) {
402 lyd_free_tree(parsed.dnodes[i]);
403 }
404 } else {
405 /* free everything */
406 lyd_free_all(*first_p);
407 *first_p = NULL;
408 }
409 }
410 ly_set_erase(&parsed, NULL);
411 return rc;
Radek Krejci7931b192020-06-25 17:05:03 +0200412}
413
414API LY_ERR
Radek Krejcif16e2542021-02-17 15:39:23 +0100415lyd_parse_ext_data(const struct lysc_ext_instance *ext, struct lyd_node *parent, struct ly_in *in, LYD_FORMAT format,
416 uint32_t parse_options, uint32_t validate_options, struct lyd_node **tree)
417{
418 const struct ly_ctx *ctx = ext ? ext->module->ctx : NULL;
419
420 LY_CHECK_ARG_RET(ctx, ext, in, parent || tree, LY_EINVAL);
421 LY_CHECK_ARG_RET(ctx, !(parse_options & ~LYD_PARSE_OPTS_MASK), LY_EINVAL);
422 LY_CHECK_ARG_RET(ctx, !(validate_options & ~LYD_VALIDATE_OPTS_MASK), LY_EINVAL);
423
424 return lyd_parse(ctx, ext, parent, tree, in, format, parse_options, validate_options, NULL);
425}
426
427API LY_ERR
Michal Vaskoe0665742021-02-11 11:08:44 +0100428lyd_parse_data(const struct ly_ctx *ctx, struct lyd_node *parent, struct ly_in *in, LYD_FORMAT format,
429 uint32_t parse_options, uint32_t validate_options, struct lyd_node **tree)
430{
431 LY_CHECK_ARG_RET(ctx, ctx, in, parent || tree, LY_EINVAL);
432 LY_CHECK_ARG_RET(ctx, !(parse_options & ~LYD_PARSE_OPTS_MASK), LY_EINVAL);
433 LY_CHECK_ARG_RET(ctx, !(validate_options & ~LYD_VALIDATE_OPTS_MASK), LY_EINVAL);
434
Radek Krejcif16e2542021-02-17 15:39:23 +0100435 return lyd_parse(ctx, NULL, parent, tree, in, format, parse_options, validate_options, NULL);
Michal Vaskoe0665742021-02-11 11:08:44 +0100436}
437
438API LY_ERR
439lyd_parse_data_mem(const struct ly_ctx *ctx, const char *data, LYD_FORMAT format, uint32_t parse_options,
440 uint32_t validate_options, struct lyd_node **tree)
Radek Krejci7931b192020-06-25 17:05:03 +0200441{
442 LY_ERR ret;
443 struct ly_in *in;
444
445 LY_CHECK_RET(ly_in_new_memory(data, &in));
Michal Vaskoe0665742021-02-11 11:08:44 +0100446 ret = lyd_parse_data(ctx, NULL, in, format, parse_options, validate_options, tree);
Radek Krejci7931b192020-06-25 17:05:03 +0200447
448 ly_in_free(in, 0);
449 return ret;
450}
451
452API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +0200453lyd_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 +0200454 struct lyd_node **tree)
Radek Krejci7931b192020-06-25 17:05:03 +0200455{
456 LY_ERR ret;
457 struct ly_in *in;
458
459 LY_CHECK_RET(ly_in_new_fd(fd, &in));
Michal Vaskoe0665742021-02-11 11:08:44 +0100460 ret = lyd_parse_data(ctx, NULL, in, format, parse_options, validate_options, tree);
Radek Krejci7931b192020-06-25 17:05:03 +0200461
462 ly_in_free(in, 0);
463 return ret;
464}
465
466API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +0200467lyd_parse_data_path(const struct ly_ctx *ctx, const char *path, LYD_FORMAT format, uint32_t parse_options,
468 uint32_t validate_options, struct lyd_node **tree)
Radek Krejci7931b192020-06-25 17:05:03 +0200469{
470 LY_ERR ret;
471 struct ly_in *in;
472
473 LY_CHECK_RET(ly_in_new_filepath(path, 0, &in));
Michal Vaskoe0665742021-02-11 11:08:44 +0100474 ret = lyd_parse_data(ctx, NULL, in, format, parse_options, validate_options, tree);
Radek Krejci7931b192020-06-25 17:05:03 +0200475
476 ly_in_free(in, 0);
477 return ret;
478}
479
Radek Krejcif16e2542021-02-17 15:39:23 +0100480/**
481 * @brief Parse YANG data into an operation data tree, in case the extension instance is specified, keep the searching
482 * for schema nodes locked inside the extension instance.
483 *
484 * At least one of @p parent, @p tree, or @p op must always be set.
485 *
486 * Specific @p data_type values have different parameter meaning as follows:
487 * - ::LYD_TYPE_RPC_NETCONF:
488 * - @p parent - must be NULL, the whole RPC is expected;
489 * - @p format - must be ::LYD_XML, NETCONF supports only this format;
490 * - @p tree - must be provided, all the NETCONF-specific XML envelopes will be returned here as
491 * a separate opaque data tree, even if the function fails, this may be returned;
492 * - @p op - must be provided, the RPC/action data tree itself will be returned here, pointing to the operation;
493 *
494 * - ::LYD_TYPE_NOTIF_NETCONF:
495 * - @p parent - must be NULL, the whole notification is expected;
496 * - @p format - must be ::LYD_XML, NETCONF supports only this format;
497 * - @p tree - must be provided, all the NETCONF-specific XML envelopes will be returned here as
498 * a separate opaque data tree, even if the function fails, this may be returned;
499 * - @p op - must be provided, the notification data tree itself will be returned here, pointing to the operation;
500 *
501 * - ::LYD_TYPE_REPLY_NETCONF:
502 * - @p parent - must be set, pointing to the invoked RPC operation (RPC or action) node;
503 * - @p format - must be ::LYD_XML, NETCONF supports only this format;
504 * - @p tree - must be provided, all the NETCONF-specific XML envelopes will be returned here as
505 * a separate opaque data tree, even if the function fails, this may be returned;
506 * - @p op - must be NULL, the reply is appended to the RPC;
507 * Note that there are 3 kinds of NETCONF replies - ok, error, and data. Only data reply appends any nodes to the RPC.
508 *
509 * @param[in] ctx libyang context.
510 * @param[in] ext Extension instance providing the specific schema tree to match with the data being parsed.
511 * @param[in] parent Optional parent to connect the parsed nodes to.
512 * @param[in] in Input handle to read the input from.
513 * @param[in] format Expected format of the data in @p in.
514 * @param[in] data_type Expected operation to parse (@ref datatype).
515 * @param[out] tree Optional full parsed data tree. If @p parent is set, set to NULL.
516 * @param[out] op Optional parsed operation node.
517 * @return LY_ERR value.
518 * @return LY_ENOT if @p data_type is a NETCONF message and the root XML element is not the expected one.
519 */
520static LY_ERR
521lyd_parse_op_(const struct ly_ctx *ctx, const struct lysc_ext_instance *ext, struct lyd_node *parent,
522 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 +0200523{
Michal Vaskoe0665742021-02-11 11:08:44 +0100524 LY_ERR rc = LY_SUCCESS;
525 struct lyd_ctx *lydctx = NULL;
526 struct ly_set parsed = {0};
527 struct lyd_node *first = NULL, *envp = NULL;
528 uint32_t i, parse_opts, val_opts;
Radek Krejci7931b192020-06-25 17:05:03 +0200529
Michal Vasko27fb0262021-02-23 09:42:01 +0100530 if (!ctx) {
531 ctx = LYD_CTX(parent);
532 }
Radek Krejci1798aae2020-07-14 13:26:06 +0200533 if (tree) {
534 *tree = NULL;
535 }
536 if (op) {
537 *op = NULL;
538 }
539
Radek Krejci7931b192020-06-25 17:05:03 +0200540 format = lyd_parse_get_format(in, format);
Radek Krejci7931b192020-06-25 17:05:03 +0200541
Michal Vasko63f3d842020-07-08 10:10:14 +0200542 /* remember input position */
543 in->func_start = in->current;
544
Michal Vaskoe0665742021-02-11 11:08:44 +0100545 /* check params based on the data type */
Michal Vasko1e4c68e2021-02-18 15:03:01 +0100546 if ((data_type == LYD_TYPE_RPC_NETCONF) || (data_type == LYD_TYPE_NOTIF_NETCONF)) {
Michal Vaskoe0665742021-02-11 11:08:44 +0100547 LY_CHECK_ARG_RET(ctx, format == LYD_XML, !parent, tree, op, LY_EINVAL);
Michal Vasko1e4c68e2021-02-18 15:03:01 +0100548 } else if (data_type == LYD_TYPE_REPLY_NETCONF) {
549 LY_CHECK_ARG_RET(ctx, format == LYD_XML, parent, parent->schema->nodetype & (LYS_RPC | LYS_ACTION), tree, !op,
550 LY_EINVAL);
Michal Vaskoe0665742021-02-11 11:08:44 +0100551 }
552 parse_opts = LYD_PARSE_ONLY | LYD_PARSE_STRICT;
553 val_opts = 0;
554
555 /* parse the data */
Radek Krejci7931b192020-06-25 17:05:03 +0200556 switch (format) {
557 case LYD_XML:
Radek Krejcif16e2542021-02-17 15:39:23 +0100558 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 +0100559 if (rc && envp) {
560 /* special situation when the envelopes were parsed successfully */
561 if (tree) {
562 *tree = envp;
563 }
564 ly_set_erase(&parsed, NULL);
565 return rc;
566 }
Michal Vaskoe0665742021-02-11 11:08:44 +0100567 break;
Radek Krejci7931b192020-06-25 17:05:03 +0200568 case LYD_JSON:
Radek Krejcif16e2542021-02-17 15:39:23 +0100569 rc = lyd_parse_json(ctx, ext, parent, &first, in, parse_opts, val_opts, data_type, &parsed, &lydctx);
Michal Vaskoe0665742021-02-11 11:08:44 +0100570 break;
Radek Krejci7931b192020-06-25 17:05:03 +0200571 case LYD_LYB:
Radek Krejcif16e2542021-02-17 15:39:23 +0100572 rc = lyd_parse_lyb(ctx, ext, parent, &first, in, parse_opts, val_opts, data_type, &parsed, &lydctx);
Michal Vaskoe0665742021-02-11 11:08:44 +0100573 break;
Michal Vaskoc8a230d2020-08-14 12:17:10 +0200574 case LYD_UNKNOWN:
Michal Vaskod74978f2021-02-12 11:59:36 +0100575 LOGARG(ctx, format);
576 rc = LY_EINVAL;
Michal Vaskoc8a230d2020-08-14 12:17:10 +0200577 break;
Radek Krejci7931b192020-06-25 17:05:03 +0200578 }
Michal Vaskoe0665742021-02-11 11:08:44 +0100579 LY_CHECK_GOTO(rc, cleanup);
Radek Krejci7931b192020-06-25 17:05:03 +0200580
Michal Vaskoe0665742021-02-11 11:08:44 +0100581 /* set out params correctly */
582 if (tree) {
583 if (envp) {
584 /* special out param meaning */
585 *tree = envp;
586 } else {
587 *tree = parent ? NULL : first;
588 }
589 }
590 if (op) {
591 *op = lydctx->op_node;
592 }
593
594cleanup:
595 if (lydctx) {
596 lydctx->free(lydctx);
597 }
598 if (rc) {
599 if (parent) {
600 /* free all the parsed subtrees */
601 for (i = 0; i < parsed.count; ++i) {
602 lyd_free_tree(parsed.dnodes[i]);
603 }
604 } else {
605 /* free everything (cannot occur in the current code, a safety) */
606 lyd_free_all(first);
607 if (tree) {
608 *tree = NULL;
609 }
610 if (op) {
611 *op = NULL;
612 }
613 }
614 }
615 ly_set_erase(&parsed, NULL);
616 return rc;
Radek Krejcie7b95092019-05-15 11:03:07 +0200617}
Radek Krejci084289f2019-07-09 17:35:30 +0200618
Radek Krejcif16e2542021-02-17 15:39:23 +0100619API LY_ERR
620lyd_parse_op(const struct ly_ctx *ctx, struct lyd_node *parent, struct ly_in *in, LYD_FORMAT format,
621 enum lyd_type data_type, struct lyd_node **tree, struct lyd_node **op)
622{
623 LY_CHECK_ARG_RET(ctx, ctx || parent, in, data_type, parent || tree || op, LY_EINVAL);
624
625 return lyd_parse_op_(ctx, NULL, parent, in, format, data_type, tree, op);
626}
627
628API LY_ERR
629lyd_parse_ext_op(const struct lysc_ext_instance *ext, struct lyd_node *parent, struct ly_in *in, LYD_FORMAT format,
630 enum lyd_type data_type, struct lyd_node **tree, struct lyd_node **op)
631{
632 const struct ly_ctx *ctx = ext ? ext->module->ctx : NULL;
633
634 LY_CHECK_ARG_RET(ctx, ext, in, data_type, parent || tree || op, LY_EINVAL);
635
636 return lyd_parse_op_(ctx, ext, parent, in, format, data_type, tree, op);
637}
638
Michal Vasko90932a92020-02-12 14:33:03 +0100639LY_ERR
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200640lyd_create_term(const struct lysc_node *schema, const char *value, size_t value_len, ly_bool *dynamic,
Radek Krejci8df109d2021-04-23 12:19:08 +0200641 LY_VALUE_FORMAT format, void *prefix_data, uint32_t hints, ly_bool *incomplete, struct lyd_node **node)
Michal Vasko90932a92020-02-12 14:33:03 +0100642{
643 LY_ERR ret;
644 struct lyd_node_term *term;
645
Michal Vasko9b368d32020-02-14 13:53:31 +0100646 assert(schema->nodetype & LYD_NODE_TERM);
647
Michal Vasko90932a92020-02-12 14:33:03 +0100648 term = calloc(1, sizeof *term);
649 LY_CHECK_ERR_RET(!term, LOGMEM(schema->module->ctx), LY_EMEM);
650
651 term->schema = schema;
Michal Vasko9e685082021-01-29 14:49:09 +0100652 term->prev = &term->node;
Michal Vasko9b368d32020-02-14 13:53:31 +0100653 term->flags = LYD_NEW;
Michal Vasko90932a92020-02-12 14:33:03 +0100654
Radek Krejciddace2c2021-01-08 11:30:56 +0100655 LOG_LOCSET(schema, NULL, NULL, NULL);
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200656 ret = lyd_value_store(schema->module->ctx, &term->value, ((struct lysc_node_leaf *)term->schema)->type, value,
Radek Krejci2efc45b2020-12-22 16:25:44 +0100657 value_len, dynamic, format, prefix_data, hints, schema, incomplete);
Radek Krejciddace2c2021-01-08 11:30:56 +0100658 LOG_LOCBACK(1, 0, 0, 0);
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200659 LY_CHECK_ERR_RET(ret, free(term), ret);
Michal Vasko9e685082021-01-29 14:49:09 +0100660 lyd_hash(&term->node);
Michal Vasko9b368d32020-02-14 13:53:31 +0100661
Michal Vasko9e685082021-01-29 14:49:09 +0100662 *node = &term->node;
Michal Vasko9b368d32020-02-14 13:53:31 +0100663 return ret;
664}
665
666LY_ERR
667lyd_create_term2(const struct lysc_node *schema, const struct lyd_value *val, struct lyd_node **node)
668{
669 LY_ERR ret;
670 struct lyd_node_term *term;
671 struct lysc_type *type;
672
673 assert(schema->nodetype & LYD_NODE_TERM);
Radek Krejci224d4b42021-04-23 13:54:59 +0200674 assert(val && val->realtype);
Michal Vasko9b368d32020-02-14 13:53:31 +0100675
676 term = calloc(1, sizeof *term);
677 LY_CHECK_ERR_RET(!term, LOGMEM(schema->module->ctx), LY_EMEM);
678
679 term->schema = schema;
Michal Vasko9e685082021-01-29 14:49:09 +0100680 term->prev = &term->node;
Michal Vasko9b368d32020-02-14 13:53:31 +0100681 term->flags = LYD_NEW;
682
683 type = ((struct lysc_node_leaf *)schema)->type;
684 ret = type->plugin->duplicate(schema->module->ctx, val, &term->value);
685 if (ret) {
686 LOGERR(schema->module->ctx, ret, "Value duplication failed.");
687 free(term);
688 return ret;
689 }
Michal Vasko9e685082021-01-29 14:49:09 +0100690 lyd_hash(&term->node);
Michal Vasko90932a92020-02-12 14:33:03 +0100691
Michal Vasko9e685082021-01-29 14:49:09 +0100692 *node = &term->node;
Michal Vasko90932a92020-02-12 14:33:03 +0100693 return ret;
694}
695
696LY_ERR
697lyd_create_inner(const struct lysc_node *schema, struct lyd_node **node)
698{
699 struct lyd_node_inner *in;
700
Michal Vasko9b368d32020-02-14 13:53:31 +0100701 assert(schema->nodetype & LYD_NODE_INNER);
702
Michal Vasko90932a92020-02-12 14:33:03 +0100703 in = calloc(1, sizeof *in);
704 LY_CHECK_ERR_RET(!in, LOGMEM(schema->module->ctx), LY_EMEM);
705
706 in->schema = schema;
Michal Vasko9e685082021-01-29 14:49:09 +0100707 in->prev = &in->node;
Michal Vasko9b368d32020-02-14 13:53:31 +0100708 in->flags = LYD_NEW;
Michal Vasko3383be72020-11-03 17:15:31 +0100709 if ((schema->nodetype == LYS_CONTAINER) && !(schema->flags & LYS_PRESENCE)) {
710 in->flags |= LYD_DEFAULT;
711 }
Michal Vasko90932a92020-02-12 14:33:03 +0100712
Michal Vasko9b368d32020-02-14 13:53:31 +0100713 /* do not hash list with keys, we need them for the hash */
714 if ((schema->nodetype != LYS_LIST) || (schema->flags & LYS_KEYLESS)) {
Michal Vasko9e685082021-01-29 14:49:09 +0100715 lyd_hash(&in->node);
Michal Vasko9b368d32020-02-14 13:53:31 +0100716 }
Michal Vasko90932a92020-02-12 14:33:03 +0100717
Michal Vasko9e685082021-01-29 14:49:09 +0100718 *node = &in->node;
Michal Vasko90932a92020-02-12 14:33:03 +0100719 return LY_SUCCESS;
720}
721
Michal Vasko90932a92020-02-12 14:33:03 +0100722LY_ERR
Michal Vasko004d3152020-06-11 19:59:22 +0200723lyd_create_list(const struct lysc_node *schema, const struct ly_path_predicate *predicates, struct lyd_node **node)
Michal Vasko90932a92020-02-12 14:33:03 +0100724{
725 LY_ERR ret = LY_SUCCESS;
Michal Vasko90932a92020-02-12 14:33:03 +0100726 struct lyd_node *list = NULL, *key;
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200727 LY_ARRAY_COUNT_TYPE u;
Michal Vasko90932a92020-02-12 14:33:03 +0100728
Michal Vasko004d3152020-06-11 19:59:22 +0200729 assert((schema->nodetype == LYS_LIST) && !(schema->flags & LYS_KEYLESS));
Michal Vasko90932a92020-02-12 14:33:03 +0100730
731 /* create list */
732 LY_CHECK_GOTO(ret = lyd_create_inner(schema, &list), cleanup);
733
Radek Krejciddace2c2021-01-08 11:30:56 +0100734 LOG_LOCSET(NULL, list, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100735
Michal Vasko90932a92020-02-12 14:33:03 +0100736 /* create and insert all the keys */
Michal Vasko004d3152020-06-11 19:59:22 +0200737 LY_ARRAY_FOR(predicates, u) {
738 LY_CHECK_GOTO(ret = lyd_create_term2(predicates[u].key, &predicates[u].value, &key), cleanup);
Michal Vasko90932a92020-02-12 14:33:03 +0100739 lyd_insert_node(list, NULL, key);
740 }
741
Michal Vasko9b368d32020-02-14 13:53:31 +0100742 /* hash having all the keys */
743 lyd_hash(list);
744
Michal Vasko90932a92020-02-12 14:33:03 +0100745 /* success */
746 *node = list;
747 list = NULL;
748
749cleanup:
Radek Krejciddace2c2021-01-08 11:30:56 +0100750 LOG_LOCBACK(0, 1, 0, 0);
Michal Vasko90932a92020-02-12 14:33:03 +0100751 lyd_free_tree(list);
Michal Vasko004d3152020-06-11 19:59:22 +0200752 return ret;
753}
754
755static LY_ERR
756lyd_create_list2(const struct lysc_node *schema, const char *keys, size_t keys_len, struct lyd_node **node)
757{
758 LY_ERR ret = LY_SUCCESS;
759 struct lyxp_expr *expr = NULL;
760 uint16_t exp_idx = 0;
761 enum ly_path_pred_type pred_type = 0;
762 struct ly_path_predicate *predicates = NULL;
763
Radek Krejciddace2c2021-01-08 11:30:56 +0100764 LOG_LOCSET(schema, NULL, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100765
Michal Vasko004d3152020-06-11 19:59:22 +0200766 /* parse keys */
Michal Vasko6b26e742020-07-17 15:02:10 +0200767 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 +0200768 LY_PATH_PRED_KEYS, &expr), cleanup);
Michal Vasko004d3152020-06-11 19:59:22 +0200769
770 /* compile them */
Radek Krejci8df109d2021-04-23 12:19:08 +0200771 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 +0200772 NULL, &predicates, &pred_type), cleanup);
Michal Vasko004d3152020-06-11 19:59:22 +0200773
774 /* create the list node */
775 LY_CHECK_GOTO(ret = lyd_create_list(schema, predicates, node), cleanup);
776
777cleanup:
Radek Krejciddace2c2021-01-08 11:30:56 +0100778 LOG_LOCBACK(1, 0, 0, 0);
Michal Vasko004d3152020-06-11 19:59:22 +0200779 lyxp_expr_free(schema->module->ctx, expr);
Michal Vaskof7e16e22020-10-21 09:24:39 +0200780 ly_path_predicates_free(schema->module->ctx, pred_type, predicates);
Michal Vasko90932a92020-02-12 14:33:03 +0100781 return ret;
782}
783
784LY_ERR
Michal Vasko366a4a12020-12-04 16:23:57 +0100785lyd_create_any(const struct lysc_node *schema, const void *value, LYD_ANYDATA_VALUETYPE value_type, ly_bool use_value,
786 struct lyd_node **node)
Michal Vasko90932a92020-02-12 14:33:03 +0100787{
Michal Vasko366a4a12020-12-04 16:23:57 +0100788 LY_ERR ret;
Michal Vasko90932a92020-02-12 14:33:03 +0100789 struct lyd_node_any *any;
Michal Vasko366a4a12020-12-04 16:23:57 +0100790 union lyd_any_value any_val;
Michal Vasko90932a92020-02-12 14:33:03 +0100791
Michal Vasko9b368d32020-02-14 13:53:31 +0100792 assert(schema->nodetype & LYD_NODE_ANY);
793
Michal Vasko90932a92020-02-12 14:33:03 +0100794 any = calloc(1, sizeof *any);
795 LY_CHECK_ERR_RET(!any, LOGMEM(schema->module->ctx), LY_EMEM);
796
797 any->schema = schema;
Michal Vasko9e685082021-01-29 14:49:09 +0100798 any->prev = &any->node;
Michal Vasko9b368d32020-02-14 13:53:31 +0100799 any->flags = LYD_NEW;
Michal Vasko90932a92020-02-12 14:33:03 +0100800
Radek Krejci1798aae2020-07-14 13:26:06 +0200801 /* TODO: convert XML/JSON strings into a opaq data tree */
Michal Vasko366a4a12020-12-04 16:23:57 +0100802
803 if (use_value) {
804 any->value.str = value;
805 any->value_type = value_type;
806 } else {
807 any_val.str = value;
Michal Vasko9e685082021-01-29 14:49:09 +0100808 ret = lyd_any_copy_value(&any->node, &any_val, value_type);
Michal Vasko366a4a12020-12-04 16:23:57 +0100809 LY_CHECK_ERR_RET(ret, free(any), ret);
810 }
Michal Vasko9e685082021-01-29 14:49:09 +0100811 lyd_hash(&any->node);
Michal Vasko90932a92020-02-12 14:33:03 +0100812
Michal Vasko9e685082021-01-29 14:49:09 +0100813 *node = &any->node;
Michal Vasko90932a92020-02-12 14:33:03 +0100814 return LY_SUCCESS;
815}
816
Michal Vasko52927e22020-03-16 17:26:14 +0100817LY_ERR
Michal Vasko501af032020-11-11 20:27:44 +0100818lyd_create_opaq(const struct ly_ctx *ctx, const char *name, size_t name_len, const char *prefix, size_t pref_len,
819 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 +0200820 LY_VALUE_FORMAT format, void *val_prefix_data, uint32_t hints, struct lyd_node **node)
Michal Vasko52927e22020-03-16 17:26:14 +0100821{
Radek Krejci011e4aa2020-09-04 15:22:31 +0200822 LY_ERR ret = LY_SUCCESS;
Michal Vasko52927e22020-03-16 17:26:14 +0100823 struct lyd_node_opaq *opaq;
824
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200825 assert(ctx && name && name_len && format);
Michal Vasko52927e22020-03-16 17:26:14 +0100826
827 if (!value_len) {
828 value = "";
829 }
830
831 opaq = calloc(1, sizeof *opaq);
Michal Vasko501af032020-11-11 20:27:44 +0100832 LY_CHECK_ERR_GOTO(!opaq, LOGMEM(ctx); ret = LY_EMEM, finish);
Michal Vasko52927e22020-03-16 17:26:14 +0100833
Michal Vasko9e685082021-01-29 14:49:09 +0100834 opaq->prev = &opaq->node;
Michal Vaskoad92b672020-11-12 13:11:31 +0100835 LY_CHECK_GOTO(ret = lydict_insert(ctx, name, name_len, &opaq->name.name), finish);
Radek Krejci011e4aa2020-09-04 15:22:31 +0200836
Michal Vasko52927e22020-03-16 17:26:14 +0100837 if (pref_len) {
Michal Vaskoad92b672020-11-12 13:11:31 +0100838 LY_CHECK_GOTO(ret = lydict_insert(ctx, prefix, pref_len, &opaq->name.prefix), finish);
Michal Vasko52927e22020-03-16 17:26:14 +0100839 }
Radek Krejci1798aae2020-07-14 13:26:06 +0200840 if (module_key_len) {
Michal Vaskoad92b672020-11-12 13:11:31 +0100841 LY_CHECK_GOTO(ret = lydict_insert(ctx, module_key, module_key_len, &opaq->name.module_ns), finish);
Radek Krejci1798aae2020-07-14 13:26:06 +0200842 }
Michal Vasko52927e22020-03-16 17:26:14 +0100843 if (dynamic && *dynamic) {
Radek Krejci011e4aa2020-09-04 15:22:31 +0200844 LY_CHECK_GOTO(ret = lydict_insert_zc(ctx, (char *)value, &opaq->value), finish);
Michal Vasko52927e22020-03-16 17:26:14 +0100845 *dynamic = 0;
846 } else {
Radek Krejci011e4aa2020-09-04 15:22:31 +0200847 LY_CHECK_GOTO(ret = lydict_insert(ctx, value, value_len, &opaq->value), finish);
Michal Vasko52927e22020-03-16 17:26:14 +0100848 }
Michal Vasko501af032020-11-11 20:27:44 +0100849
850 opaq->format = format;
851 opaq->val_prefix_data = val_prefix_data;
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200852 opaq->hints = hints;
Michal Vasko52927e22020-03-16 17:26:14 +0100853 opaq->ctx = ctx;
854
Radek Krejci011e4aa2020-09-04 15:22:31 +0200855finish:
856 if (ret) {
Michal Vasko9e685082021-01-29 14:49:09 +0100857 lyd_free_tree(&opaq->node);
Michal Vasko501af032020-11-11 20:27:44 +0100858 ly_free_prefix_data(format, val_prefix_data);
Radek Krejci011e4aa2020-09-04 15:22:31 +0200859 } else {
Michal Vasko9e685082021-01-29 14:49:09 +0100860 *node = &opaq->node;
Radek Krejci011e4aa2020-09-04 15:22:31 +0200861 }
862 return ret;
Michal Vasko52927e22020-03-16 17:26:14 +0100863}
864
Michal Vasko3a41dff2020-07-15 14:30:28 +0200865API LY_ERR
Michal Vasko65243892020-12-04 16:26:21 +0100866lyd_new_inner(struct lyd_node *parent, const struct lys_module *module, const char *name, ly_bool output,
867 struct lyd_node **node)
Michal Vasko013a8182020-03-03 10:46:53 +0100868{
869 struct lyd_node *ret = NULL;
870 const struct lysc_node *schema;
871 struct ly_ctx *ctx = parent ? parent->schema->module->ctx : (module ? module->ctx : NULL);
872
Michal Vasko6027eb92020-07-15 16:37:30 +0200873 LY_CHECK_ARG_RET(ctx, parent || module, parent || node, name, LY_EINVAL);
Michal Vasko013a8182020-03-03 10:46:53 +0100874
Michal Vaskof03ed032020-03-04 13:31:44 +0100875 if (!module) {
876 module = parent->schema->module;
877 }
878
Michal Vasko3a41dff2020-07-15 14:30:28 +0200879 schema = lys_find_child(parent ? parent->schema : NULL, module, name, 0,
Radek Krejci41ac9942020-11-02 14:47:56 +0100880 LYS_CONTAINER | LYS_NOTIF | LYS_RPC | LYS_ACTION, output ? LYS_GETNEXT_OUTPUT : 0);
Radek Krejcidd2a7662021-03-12 11:26:34 +0100881 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 +0100882
Michal Vasko3a41dff2020-07-15 14:30:28 +0200883 LY_CHECK_RET(lyd_create_inner(schema, &ret));
884 if (parent) {
Michal Vasko013a8182020-03-03 10:46:53 +0100885 lyd_insert_node(parent, NULL, ret);
886 }
Michal Vasko3a41dff2020-07-15 14:30:28 +0200887
888 if (node) {
889 *node = ret;
890 }
891 return LY_SUCCESS;
Michal Vasko013a8182020-03-03 10:46:53 +0100892}
893
Michal Vasko3a41dff2020-07-15 14:30:28 +0200894API LY_ERR
Radek Krejcidd2a7662021-03-12 11:26:34 +0100895lyd_new_ext_inner(const struct lysc_ext_instance *ext, const char *name, struct lyd_node **node)
896{
897 struct lyd_node *ret = NULL;
898 const struct lysc_node *schema;
899 struct ly_ctx *ctx = ext ? ext->module->ctx : NULL;
900
901 LY_CHECK_ARG_RET(ctx, ext, node, name, LY_EINVAL);
902
903 schema = lysc_ext_find_node(ext, NULL, name, 0, LYS_CONTAINER | LYS_NOTIF | LYS_RPC | LYS_ACTION, 0);
904 if (!schema) {
905 if (ext->argument) {
906 LOGERR(ctx, LY_EINVAL, "Inner node (not a list) \"%s\" not found in instance \"%s\" of extension %s.",
907 name, ext->argument, ext->def->name);
908 } else {
909 LOGERR(ctx, LY_EINVAL, "Inner node (not a list) \"%s\" not found in instance of extension %s.",
910 name, ext->def->name);
911 }
912 return LY_ENOTFOUND;
913 }
914 LY_CHECK_RET(lyd_create_inner(schema, &ret));
915
916 *node = ret;
917
918 return LY_SUCCESS;
919}
920
921API LY_ERR
Michal Vasko65243892020-12-04 16:26:21 +0100922lyd_new_list(struct lyd_node *parent, const struct lys_module *module, const char *name, ly_bool output,
923 struct lyd_node **node, ...)
Michal Vasko013a8182020-03-03 10:46:53 +0100924{
925 struct lyd_node *ret = NULL, *key;
926 const struct lysc_node *schema, *key_s;
927 struct ly_ctx *ctx = parent ? parent->schema->module->ctx : (module ? module->ctx : NULL);
928 va_list ap;
929 const char *key_val;
930 LY_ERR rc = LY_SUCCESS;
931
Michal Vasko6027eb92020-07-15 16:37:30 +0200932 LY_CHECK_ARG_RET(ctx, parent || module, parent || node, name, LY_EINVAL);
Michal Vasko013a8182020-03-03 10:46:53 +0100933
Michal Vaskof03ed032020-03-04 13:31:44 +0100934 if (!module) {
935 module = parent->schema->module;
936 }
937
Radek Krejci41ac9942020-11-02 14:47:56 +0100938 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 +0200939 LY_CHECK_ERR_RET(!schema, LOGERR(ctx, LY_EINVAL, "List node \"%s\" not found.", name), LY_ENOTFOUND);
Michal Vasko013a8182020-03-03 10:46:53 +0100940
941 /* create list inner node */
Michal Vasko3a41dff2020-07-15 14:30:28 +0200942 LY_CHECK_RET(lyd_create_inner(schema, &ret));
Michal Vasko013a8182020-03-03 10:46:53 +0100943
Michal Vasko3a41dff2020-07-15 14:30:28 +0200944 va_start(ap, node);
Michal Vasko013a8182020-03-03 10:46:53 +0100945
946 /* create and insert all the keys */
Michal Vasko544e58a2021-01-28 14:33:41 +0100947 for (key_s = lysc_node_child(schema); key_s && (key_s->flags & LYS_KEY); key_s = key_s->next) {
Michal Vasko013a8182020-03-03 10:46:53 +0100948 key_val = va_arg(ap, const char *);
949
Radek Krejci8df109d2021-04-23 12:19:08 +0200950 rc = lyd_create_term(key_s, key_val, key_val ? strlen(key_val) : 0, NULL, LY_VALUE_JSON, NULL, LYD_HINT_DATA,
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200951 NULL, &key);
952 LY_CHECK_GOTO(rc, cleanup);
Michal Vasko013a8182020-03-03 10:46:53 +0100953 lyd_insert_node(ret, NULL, key);
954 }
955
Michal Vasko013a8182020-03-03 10:46:53 +0100956 if (parent) {
957 lyd_insert_node(parent, NULL, ret);
958 }
959
960cleanup:
Michal Vasko3a41dff2020-07-15 14:30:28 +0200961 va_end(ap);
Michal Vasko013a8182020-03-03 10:46:53 +0100962 if (rc) {
963 lyd_free_tree(ret);
964 ret = NULL;
Michal Vasko3a41dff2020-07-15 14:30:28 +0200965 } else if (node) {
966 *node = ret;
Michal Vasko013a8182020-03-03 10:46:53 +0100967 }
Michal Vasko3a41dff2020-07-15 14:30:28 +0200968 return rc;
Michal Vasko013a8182020-03-03 10:46:53 +0100969}
970
Michal Vasko3a41dff2020-07-15 14:30:28 +0200971API LY_ERR
Radek Krejci8247bae2021-03-12 11:47:02 +0100972lyd_new_ext_list(const struct lysc_ext_instance *ext, const char *name, struct lyd_node **node, ...)
973{
974 struct lyd_node *ret = NULL, *key;
975 const struct lysc_node *schema, *key_s;
976 struct ly_ctx *ctx = ext ? ext->module->ctx : NULL;
977 va_list ap;
978 const char *key_val;
979 LY_ERR rc = LY_SUCCESS;
980
981 LY_CHECK_ARG_RET(ctx, ext, node, name, LY_EINVAL);
982
983 schema = lysc_ext_find_node(ext, NULL, name, 0, LYS_LIST, 0);
984 if (!schema) {
985 if (ext->argument) {
986 LOGERR(ctx, LY_EINVAL, "List node \"%s\" not found in instance \"%s\" of extension %s.",
987 name, ext->argument, ext->def->name);
988 } else {
989 LOGERR(ctx, LY_EINVAL, "List node \"%s\" not found in instance of extension %s.", name, ext->def->name);
990 }
991 return LY_ENOTFOUND;
992 }
993 /* create list inner node */
994 LY_CHECK_RET(lyd_create_inner(schema, &ret));
995
996 va_start(ap, node);
997
998 /* create and insert all the keys */
999 for (key_s = lysc_node_child(schema); key_s && (key_s->flags & LYS_KEY); key_s = key_s->next) {
1000 key_val = va_arg(ap, const char *);
1001
Radek Krejci8df109d2021-04-23 12:19:08 +02001002 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 +01001003 NULL, &key);
1004 LY_CHECK_GOTO(rc, cleanup);
1005 lyd_insert_node(ret, NULL, key);
1006 }
1007
1008cleanup:
1009 va_end(ap);
1010 if (rc) {
1011 lyd_free_tree(ret);
1012 ret = NULL;
Radek Krejci8247bae2021-03-12 11:47:02 +01001013 }
Radek Krejci8919fbd2021-03-15 09:35:25 +01001014 *node = ret;
Radek Krejci8247bae2021-03-12 11:47:02 +01001015 return rc;
1016}
1017
1018API LY_ERR
Michal Vasko3a41dff2020-07-15 14:30:28 +02001019lyd_new_list2(struct lyd_node *parent, const struct lys_module *module, const char *name, const char *keys,
Radek Krejci41ac9942020-11-02 14:47:56 +01001020 ly_bool output, struct lyd_node **node)
Michal Vasko013a8182020-03-03 10:46:53 +01001021{
1022 struct lyd_node *ret = NULL;
1023 const struct lysc_node *schema;
1024 struct ly_ctx *ctx = parent ? parent->schema->module->ctx : (module ? module->ctx : NULL);
1025
Michal Vasko6027eb92020-07-15 16:37:30 +02001026 LY_CHECK_ARG_RET(ctx, parent || module, parent || node, name, LY_EINVAL);
Michal Vasko013a8182020-03-03 10:46:53 +01001027
Michal Vaskof03ed032020-03-04 13:31:44 +01001028 if (!module) {
1029 module = parent->schema->module;
1030 }
Michal Vasko004d3152020-06-11 19:59:22 +02001031 if (!keys) {
1032 keys = "";
1033 }
Michal Vaskof03ed032020-03-04 13:31:44 +01001034
Michal Vasko004d3152020-06-11 19:59:22 +02001035 /* find schema node */
Radek Krejci41ac9942020-11-02 14:47:56 +01001036 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 +02001037 LY_CHECK_ERR_RET(!schema, LOGERR(ctx, LY_EINVAL, "List node \"%s\" not found.", name), LY_ENOTFOUND);
Michal Vasko013a8182020-03-03 10:46:53 +01001038
Michal Vasko004d3152020-06-11 19:59:22 +02001039 if ((schema->flags & LYS_KEYLESS) && !keys[0]) {
1040 /* key-less list */
Michal Vasko3a41dff2020-07-15 14:30:28 +02001041 LY_CHECK_RET(lyd_create_inner(schema, &ret));
Michal Vasko004d3152020-06-11 19:59:22 +02001042 } else {
1043 /* create the list node */
Michal Vasko3a41dff2020-07-15 14:30:28 +02001044 LY_CHECK_RET(lyd_create_list2(schema, keys, strlen(keys), &ret));
Michal Vasko004d3152020-06-11 19:59:22 +02001045 }
Michal Vasko004d3152020-06-11 19:59:22 +02001046 if (parent) {
Michal Vasko013a8182020-03-03 10:46:53 +01001047 lyd_insert_node(parent, NULL, ret);
1048 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02001049
1050 if (node) {
1051 *node = ret;
1052 }
1053 return LY_SUCCESS;
Michal Vasko013a8182020-03-03 10:46:53 +01001054}
1055
Radek Krejci09c77442021-04-26 11:10:34 +02001056/**
1057 * @brief Create a new term node in the data tree.
1058 *
1059 * @param[in] parent Parent node for the node being created. NULL in case of creating a top level element.
1060 * @param[in] module Module of the node being created. If NULL, @p parent module will be used.
1061 * @param[in] name Schema node name of the new data node. The node can be ::LYS_LEAF or ::LYS_LEAFLIST.
1062 * @param[in] value Value of the node being created.
1063 * @param[in] value_len Length of @p value.
1064 * @param[in] format Format of @p value.
1065 * @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
1066 * taken into consideration. Otherwise, the output's data node is going to be created.
1067 * @param[out] node Optional created node.
1068 * @return LY_ERR value.
1069 */
1070static LY_ERR
1071_lyd_new_term(struct lyd_node *parent, const struct lys_module *module, const char *name, const void *value,
1072 size_t value_len, LY_VALUE_FORMAT format, ly_bool output, struct lyd_node **node)
Michal Vasko013a8182020-03-03 10:46:53 +01001073{
Michal Vaskocbff3e92020-05-27 12:56:41 +02001074 LY_ERR rc;
Michal Vasko013a8182020-03-03 10:46:53 +01001075 struct lyd_node *ret = NULL;
1076 const struct lysc_node *schema;
Radek Krejci09c77442021-04-26 11:10:34 +02001077 const struct ly_ctx *ctx = parent ? LYD_CTX(parent) : (module ? module->ctx : NULL);
Michal Vasko013a8182020-03-03 10:46:53 +01001078
Michal Vasko6027eb92020-07-15 16:37:30 +02001079 LY_CHECK_ARG_RET(ctx, parent || module, parent || node, name, LY_EINVAL);
Michal Vasko013a8182020-03-03 10:46:53 +01001080
Michal Vaskof03ed032020-03-04 13:31:44 +01001081 if (!module) {
1082 module = parent->schema->module;
1083 }
1084
Radek Krejci41ac9942020-11-02 14:47:56 +01001085 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 +02001086 LY_CHECK_ERR_RET(!schema, LOGERR(ctx, LY_EINVAL, "Term node \"%s\" not found.", name), LY_ENOTFOUND);
Michal Vasko013a8182020-03-03 10:46:53 +01001087
Radek Krejci09c77442021-04-26 11:10:34 +02001088 rc = lyd_create_term(schema, value, value_len, NULL, format, NULL, LYD_HINT_DATA, NULL, &ret);
Michal Vaskofeca4fb2020-10-05 08:58:40 +02001089 LY_CHECK_RET(rc);
Michal Vaskocbff3e92020-05-27 12:56:41 +02001090 if (parent) {
Michal Vasko013a8182020-03-03 10:46:53 +01001091 lyd_insert_node(parent, NULL, ret);
1092 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02001093
1094 if (node) {
1095 *node = ret;
1096 }
1097 return LY_SUCCESS;
Michal Vasko013a8182020-03-03 10:46:53 +01001098}
1099
Michal Vasko3a41dff2020-07-15 14:30:28 +02001100API LY_ERR
Radek Krejci09c77442021-04-26 11:10:34 +02001101lyd_new_term(struct lyd_node *parent, const struct lys_module *module, const char *name, const char *val_str,
1102 ly_bool output, struct lyd_node **node)
1103{
1104 return _lyd_new_term(parent, module, name, val_str, val_str ? strlen(val_str) : 0, LY_VALUE_JSON, output, node);
1105}
1106
1107API LY_ERR
1108lyd_new_term_bin(struct lyd_node *parent, const struct lys_module *module, const char *name, const void *value,
1109 size_t value_len, ly_bool output, struct lyd_node **node)
1110{
1111 return _lyd_new_term(parent, module, name, value, value_len, LY_VALUE_LYB, output, node);
1112}
1113
1114API LY_ERR
1115lyd_new_term_canon(struct lyd_node *parent, const struct lys_module *module, const char *name, const char *val_str,
1116 ly_bool output, struct lyd_node **node)
1117{
1118 return _lyd_new_term(parent, module, name, val_str, val_str ? strlen(val_str) : 0, LY_VALUE_CANON, output, node);
1119}
1120
1121API LY_ERR
Radek Krejci8a5afc22021-03-12 11:10:47 +01001122lyd_new_ext_term(const struct lysc_ext_instance *ext, const char *name, const char *val_str, struct lyd_node **node)
1123{
1124 LY_ERR rc;
1125 struct lyd_node *ret = NULL;
1126 const struct lysc_node *schema;
1127 struct ly_ctx *ctx = ext ? ext->module->ctx : NULL;
1128
1129 LY_CHECK_ARG_RET(ctx, ext, node, name, LY_EINVAL);
1130
1131 schema = lysc_ext_find_node(ext, NULL, name, 0, LYD_NODE_TERM, 0);
1132 if (!schema) {
1133 if (ext->argument) {
1134 LOGERR(ctx, LY_EINVAL, "Term node \"%s\" not found in instance \"%s\" of extension %s.",
1135 name, ext->argument, ext->def->name);
1136 } else {
1137 LOGERR(ctx, LY_EINVAL, "Term node \"%s\" not found in instance of extension %s.", name, ext->def->name);
1138 }
1139 return LY_ENOTFOUND;
1140 }
Radek Krejci8df109d2021-04-23 12:19:08 +02001141 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 +01001142 LY_CHECK_RET(rc);
1143
1144 *node = ret;
1145
1146 return LY_SUCCESS;
1147}
1148
1149API LY_ERR
Michal Vasko2a4ab2b2021-03-04 15:52:40 +01001150lyd_new_any(struct lyd_node *parent, const struct lys_module *module, const char *name, const void *value,
1151 ly_bool use_value, LYD_ANYDATA_VALUETYPE value_type, ly_bool output, struct lyd_node **node)
Michal Vasko013a8182020-03-03 10:46:53 +01001152{
1153 struct lyd_node *ret = NULL;
1154 const struct lysc_node *schema;
1155 struct ly_ctx *ctx = parent ? parent->schema->module->ctx : (module ? module->ctx : NULL);
1156
Michal Vasko6027eb92020-07-15 16:37:30 +02001157 LY_CHECK_ARG_RET(ctx, parent || module, parent || node, name, LY_EINVAL);
Michal Vasko013a8182020-03-03 10:46:53 +01001158
Michal Vaskof03ed032020-03-04 13:31:44 +01001159 if (!module) {
1160 module = parent->schema->module;
1161 }
1162
Radek Krejci41ac9942020-11-02 14:47:56 +01001163 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 +02001164 LY_CHECK_ERR_RET(!schema, LOGERR(ctx, LY_EINVAL, "Any node \"%s\" not found.", name), LY_ENOTFOUND);
Michal Vasko013a8182020-03-03 10:46:53 +01001165
Michal Vasko2a4ab2b2021-03-04 15:52:40 +01001166 LY_CHECK_RET(lyd_create_any(schema, value, value_type, use_value, &ret));
Michal Vasko3a41dff2020-07-15 14:30:28 +02001167 if (parent) {
Michal Vasko013a8182020-03-03 10:46:53 +01001168 lyd_insert_node(parent, NULL, ret);
1169 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02001170
1171 if (node) {
1172 *node = ret;
1173 }
1174 return LY_SUCCESS;
Michal Vasko013a8182020-03-03 10:46:53 +01001175}
1176
Radek Krejci0b963da2021-03-12 13:23:44 +01001177API LY_ERR
1178lyd_new_ext_any(const struct lysc_ext_instance *ext, const char *name, const void *value, ly_bool use_value,
1179 LYD_ANYDATA_VALUETYPE value_type, struct lyd_node **node)
1180{
1181 struct lyd_node *ret = NULL;
1182 const struct lysc_node *schema;
1183 struct ly_ctx *ctx = ext ? ext->module->ctx : NULL;
1184
1185 LY_CHECK_ARG_RET(ctx, ext, node, name, LY_EINVAL);
1186
1187 schema = lysc_ext_find_node(ext, NULL, name, 0, LYD_NODE_ANY, 0);
1188 if (!schema) {
1189 if (ext->argument) {
1190 LOGERR(ctx, LY_EINVAL, "Any node \"%s\" not found in instance \"%s\" of extension %s.",
1191 name, ext->argument, ext->def->name);
1192 } else {
1193 LOGERR(ctx, LY_EINVAL, "Any node \"%s\" not found in instance of extension %s.", name, ext->def->name);
1194 }
1195 return LY_ENOTFOUND;
1196 }
1197 LY_CHECK_RET(lyd_create_any(schema, value, value_type, use_value, &ret));
1198
1199 *node = ret;
1200
1201 return LY_SUCCESS;
1202}
1203
Michal Vasko3a41dff2020-07-15 14:30:28 +02001204API LY_ERR
Michal Vasko871a0252020-11-11 18:35:24 +01001205lyd_new_meta(const struct ly_ctx *ctx, struct lyd_node *parent, const struct lys_module *module, const char *name,
1206 const char *val_str, ly_bool clear_dflt, struct lyd_meta **meta)
Michal Vaskod86997b2020-05-26 15:19:54 +02001207{
Michal Vaskod86997b2020-05-26 15:19:54 +02001208 const char *prefix, *tmp;
Michal Vaskod86997b2020-05-26 15:19:54 +02001209 size_t pref_len, name_len;
1210
Michal Vasko2b5344c2021-02-26 10:12:05 +01001211 LY_CHECK_ARG_RET(ctx, ctx || parent, name, module || strchr(name, ':'), parent || meta, LY_EINVAL);
1212 if (!ctx) {
1213 ctx = LYD_CTX(parent);
1214 }
Michal Vasko00cbf532020-06-15 13:58:47 +02001215
Michal Vasko871a0252020-11-11 18:35:24 +01001216 if (parent && !parent->schema) {
Michal Vasko33b4fab2021-03-04 15:56:12 +01001217 LOGERR(ctx, LY_EINVAL, "Cannot add metadata \"%s\" to an opaque node \"%s\".", name, LYD_NAME(parent));
Michal Vasko871a0252020-11-11 18:35:24 +01001218 return LY_EINVAL;
1219 }
Michal Vasko610553d2020-11-18 18:15:05 +01001220 if (meta) {
1221 *meta = NULL;
1222 }
Michal Vaskod86997b2020-05-26 15:19:54 +02001223
1224 /* parse the name */
1225 tmp = name;
1226 if (ly_parse_nodeid(&tmp, &prefix, &pref_len, &name, &name_len) || tmp[0]) {
1227 LOGERR(ctx, LY_EINVAL, "Metadata name \"%s\" is not valid.", name);
Michal Vasko871a0252020-11-11 18:35:24 +01001228 return LY_EINVAL;
Michal Vaskod86997b2020-05-26 15:19:54 +02001229 }
1230
1231 /* find the module */
1232 if (prefix) {
Radek Krejci0ad51f12020-07-16 12:08:12 +02001233 module = ly_ctx_get_module_implemented2(ctx, prefix, pref_len);
Radek Krejci422afb12021-03-04 16:38:16 +01001234 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 +02001235 }
1236
1237 /* set value if none */
1238 if (!val_str) {
1239 val_str = "";
1240 }
1241
Radek Krejci8df109d2021-04-23 12:19:08 +02001242 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 +01001243 NULL, LYD_HINT_DATA, clear_dflt, NULL);
1244}
Michal Vasko3a41dff2020-07-15 14:30:28 +02001245
Michal Vaskoba696702020-11-11 19:12:45 +01001246API LY_ERR
1247lyd_new_meta2(const struct ly_ctx *ctx, struct lyd_node *parent, ly_bool clear_dflt, const struct lyd_attr *attr,
1248 struct lyd_meta **meta)
1249{
1250 const struct lys_module *mod;
1251
1252 LY_CHECK_ARG_RET(NULL, ctx, attr, parent || meta, LY_EINVAL);
1253
1254 if (parent && !parent->schema) {
1255 LOGERR(ctx, LY_EINVAL, "Cannot add metadata to an opaque node \"%s\".", ((struct lyd_node_opaq *)parent)->name);
1256 return LY_EINVAL;
Michal Vasko3a41dff2020-07-15 14:30:28 +02001257 }
Michal Vasko610553d2020-11-18 18:15:05 +01001258 if (meta) {
1259 *meta = NULL;
1260 }
Michal Vaskoba696702020-11-11 19:12:45 +01001261
1262 switch (attr->format) {
Radek Krejci8df109d2021-04-23 12:19:08 +02001263 case LY_VALUE_XML:
Michal Vaskoad92b672020-11-12 13:11:31 +01001264 mod = ly_ctx_get_module_implemented_ns(ctx, attr->name.module_ns);
Michal Vaskoba696702020-11-11 19:12:45 +01001265 if (!mod) {
Michal Vaskoad92b672020-11-12 13:11:31 +01001266 LOGERR(ctx, LY_EINVAL, "Module with namespace \"%s\" not found.", attr->name.module_ns);
Michal Vaskoba696702020-11-11 19:12:45 +01001267 return LY_ENOTFOUND;
1268 }
1269 break;
Radek Krejci8df109d2021-04-23 12:19:08 +02001270 case LY_VALUE_JSON:
Michal Vaskoad92b672020-11-12 13:11:31 +01001271 mod = ly_ctx_get_module_implemented(ctx, attr->name.module_name);
Michal Vaskoba696702020-11-11 19:12:45 +01001272 if (!mod) {
Michal Vaskoad92b672020-11-12 13:11:31 +01001273 LOGERR(ctx, LY_EINVAL, "Module \"%s\" not found.", attr->name.module_name);
Michal Vaskoba696702020-11-11 19:12:45 +01001274 return LY_ENOTFOUND;
1275 }
1276 break;
1277 default:
1278 LOGINT_RET(ctx);
1279 }
1280
Michal Vaskoad92b672020-11-12 13:11:31 +01001281 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 +01001282 NULL, attr->format, attr->val_prefix_data, attr->hints, clear_dflt, NULL);
Michal Vaskod86997b2020-05-26 15:19:54 +02001283}
1284
Michal Vasko3a41dff2020-07-15 14:30:28 +02001285API LY_ERR
Michal Vasko00cbf532020-06-15 13:58:47 +02001286lyd_new_opaq(struct lyd_node *parent, const struct ly_ctx *ctx, const char *name, const char *value,
Michal Vasko0ab974d2021-02-24 13:18:26 +01001287 const char *prefix, const char *module_name, struct lyd_node **node)
Michal Vasko00cbf532020-06-15 13:58:47 +02001288{
1289 struct lyd_node *ret = NULL;
Radek Krejci07a55962021-03-02 20:16:43 +01001290
Michal Vasko0ab974d2021-02-24 13:18:26 +01001291 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 +02001292
1293 if (!ctx) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001294 ctx = LYD_CTX(parent);
Michal Vasko00cbf532020-06-15 13:58:47 +02001295 }
1296 if (!value) {
1297 value = "";
1298 }
1299
Michal Vasko0ab974d2021-02-24 13:18:26 +01001300 LY_CHECK_RET(lyd_create_opaq(ctx, name, strlen(name), prefix, prefix ? strlen(prefix) : 0, module_name,
Radek Krejci8df109d2021-04-23 12:19:08 +02001301 strlen(module_name), value, strlen(value), NULL, LY_VALUE_JSON, NULL, 0, &ret));
Michal Vasko3a41dff2020-07-15 14:30:28 +02001302 if (parent) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001303 lyd_insert_node(parent, NULL, ret);
1304 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02001305
1306 if (node) {
1307 *node = ret;
1308 }
1309 return LY_SUCCESS;
Michal Vasko00cbf532020-06-15 13:58:47 +02001310}
1311
Michal Vasko3a41dff2020-07-15 14:30:28 +02001312API LY_ERR
Michal Vasko8d65f852021-02-17 11:28:13 +01001313lyd_new_opaq2(struct lyd_node *parent, const struct ly_ctx *ctx, const char *name, const char *value,
Michal Vasko0ab974d2021-02-24 13:18:26 +01001314 const char *prefix, const char *module_ns, struct lyd_node **node)
Michal Vasko8d65f852021-02-17 11:28:13 +01001315{
1316 struct lyd_node *ret = NULL;
1317
1318 LY_CHECK_ARG_RET(ctx, parent || ctx, parent || node, name, module_ns, LY_EINVAL);
1319
1320 if (!ctx) {
1321 ctx = LYD_CTX(parent);
1322 }
1323 if (!value) {
1324 value = "";
1325 }
1326
Michal Vasko0ab974d2021-02-24 13:18:26 +01001327 LY_CHECK_RET(lyd_create_opaq(ctx, name, strlen(name), prefix, prefix ? strlen(prefix) : 0, module_ns,
Radek Krejci8df109d2021-04-23 12:19:08 +02001328 strlen(module_ns), value, strlen(value), NULL, LY_VALUE_XML, NULL, 0, &ret));
Michal Vasko8d65f852021-02-17 11:28:13 +01001329 if (parent) {
1330 lyd_insert_node(parent, NULL, ret);
1331 }
1332
1333 if (node) {
1334 *node = ret;
1335 }
1336 return LY_SUCCESS;
1337}
1338
1339API LY_ERR
1340lyd_new_attr(struct lyd_node *parent, const char *module_name, const char *name, const char *value,
Radek Krejci0f969882020-08-21 16:56:47 +02001341 struct lyd_attr **attr)
Michal Vasko00cbf532020-06-15 13:58:47 +02001342{
Radek Krejci1798aae2020-07-14 13:26:06 +02001343 struct lyd_attr *ret = NULL;
Michal Vasko00cbf532020-06-15 13:58:47 +02001344 const struct ly_ctx *ctx;
1345 const char *prefix, *tmp;
Michal Vasko51d21b82020-11-13 18:03:54 +01001346 size_t pref_len, name_len, mod_len;
Michal Vasko00cbf532020-06-15 13:58:47 +02001347
Michal Vasko3a41dff2020-07-15 14:30:28 +02001348 LY_CHECK_ARG_RET(NULL, parent, !parent->schema, name, LY_EINVAL);
Michal Vasko00cbf532020-06-15 13:58:47 +02001349
Michal Vaskob7be7a82020-08-20 09:09:04 +02001350 ctx = LYD_CTX(parent);
Michal Vasko00cbf532020-06-15 13:58:47 +02001351
1352 /* parse the name */
1353 tmp = name;
1354 if (ly_parse_nodeid(&tmp, &prefix, &pref_len, &name, &name_len) || tmp[0]) {
Michal Vaskob69b68c2021-02-17 11:18:16 +01001355 LOGERR(ctx, LY_EINVAL, "Attribute name \"%s\" is not valid.", name);
Michal Vasko3a41dff2020-07-15 14:30:28 +02001356 return LY_EVALID;
Michal Vasko00cbf532020-06-15 13:58:47 +02001357 }
1358
Michal Vasko51d21b82020-11-13 18:03:54 +01001359 /* get the module */
1360 if (module_name) {
1361 mod_len = strlen(module_name);
1362 } else {
1363 module_name = prefix;
1364 mod_len = pref_len;
1365 }
1366
Michal Vasko00cbf532020-06-15 13:58:47 +02001367 /* set value if none */
Michal Vasko8d65f852021-02-17 11:28:13 +01001368 if (!value) {
1369 value = "";
Michal Vasko00cbf532020-06-15 13:58:47 +02001370 }
1371
Michal Vasko8d65f852021-02-17 11:28:13 +01001372 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 +02001373 strlen(value), NULL, LY_VALUE_JSON, NULL, LYD_HINT_DATA));
Michal Vasko8d65f852021-02-17 11:28:13 +01001374
1375 if (attr) {
1376 *attr = ret;
1377 }
1378 return LY_SUCCESS;
1379}
1380
1381API LY_ERR
1382lyd_new_attr2(struct lyd_node *parent, const char *module_ns, const char *name, const char *value,
1383 struct lyd_attr **attr)
1384{
1385 struct lyd_attr *ret = NULL;
1386 const struct ly_ctx *ctx;
1387 const char *prefix, *tmp;
1388 size_t pref_len, name_len;
1389
1390 LY_CHECK_ARG_RET(NULL, parent, !parent->schema, name, LY_EINVAL);
1391
1392 ctx = LYD_CTX(parent);
1393
1394 /* parse the name */
1395 tmp = name;
1396 if (ly_parse_nodeid(&tmp, &prefix, &pref_len, &name, &name_len) || tmp[0]) {
1397 LOGERR(ctx, LY_EINVAL, "Attribute name \"%s\" is not valid.", name);
1398 return LY_EVALID;
1399 }
1400
1401 /* set value if none */
1402 if (!value) {
1403 value = "";
1404 }
1405
1406 LY_CHECK_RET(lyd_create_attr(parent, &ret, ctx, name, name_len, prefix, pref_len, module_ns,
Radek Krejci8df109d2021-04-23 12:19:08 +02001407 module_ns ? strlen(module_ns) : 0, value, strlen(value), NULL, LY_VALUE_XML, NULL, LYD_HINT_DATA));
Michal Vasko3a41dff2020-07-15 14:30:28 +02001408
1409 if (attr) {
1410 *attr = ret;
1411 }
1412 return LY_SUCCESS;
Michal Vasko00cbf532020-06-15 13:58:47 +02001413}
1414
Radek Krejci09c77442021-04-26 11:10:34 +02001415/**
1416 * @brief Change the value of a term (leaf or leaf-list) node.
1417 *
1418 * Node changed this way is always considered explicitly set, meaning its default flag
1419 * is always cleared.
1420 *
1421 * @param[in] term Term node to change.
1422 * @param[in] value New value to set.
1423 * @param[in] value_len Length of @p value.
1424 * @param[in] format Format of @p value.
1425 * @return LY_SUCCESS if value was changed,
1426 * @return LY_EEXIST if value was the same and only the default flag was cleared,
1427 * @return LY_ENOT if the values were equal and no change occured,
1428 * @return LY_ERR value on other errors.
1429 */
1430static LY_ERR
1431_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 +02001432{
1433 LY_ERR ret = LY_SUCCESS;
1434 struct lysc_type *type;
1435 struct lyd_node_term *t;
1436 struct lyd_node *parent;
1437 struct lyd_value val = {0};
Radek Krejci857189e2020-09-01 13:26:36 +02001438 ly_bool dflt_change, val_change;
Michal Vasko00cbf532020-06-15 13:58:47 +02001439
Radek Krejci09c77442021-04-26 11:10:34 +02001440 assert(term && term->schema && (term->schema->nodetype & LYD_NODE_TERM));
Michal Vasko00cbf532020-06-15 13:58:47 +02001441
Michal Vasko00cbf532020-06-15 13:58:47 +02001442 t = (struct lyd_node_term *)term;
1443 type = ((struct lysc_node_leaf *)term->schema)->type;
1444
1445 /* parse the new value */
Radek Krejciddace2c2021-01-08 11:30:56 +01001446 LOG_LOCSET(term->schema, term, NULL, NULL);
Radek Krejci09c77442021-04-26 11:10:34 +02001447 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 +01001448 LOG_LOCBACK(term->schema ? 1 : 0, 1, 0, 0);
Michal Vaskofeca4fb2020-10-05 08:58:40 +02001449 LY_CHECK_GOTO(ret, cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001450
1451 /* compare original and new value */
1452 if (type->plugin->compare(&t->value, &val)) {
1453 /* values differ, switch them */
Michal Vaskob7be7a82020-08-20 09:09:04 +02001454 type->plugin->free(LYD_CTX(term), &t->value);
Michal Vasko00cbf532020-06-15 13:58:47 +02001455 t->value = val;
1456 memset(&val, 0, sizeof val);
1457 val_change = 1;
1458 } else {
1459 val_change = 0;
1460 }
1461
1462 /* always clear the default flag */
1463 if (term->flags & LYD_DEFAULT) {
Michal Vasko9e685082021-01-29 14:49:09 +01001464 for (parent = term; parent; parent = lyd_parent(parent)) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001465 parent->flags &= ~LYD_DEFAULT;
1466 }
1467 dflt_change = 1;
1468 } else {
1469 dflt_change = 0;
1470 }
1471
1472 if (val_change || dflt_change) {
1473 /* make the node non-validated */
1474 term->flags &= LYD_NEW;
1475 }
1476
1477 if (val_change) {
1478 if (term->schema->nodetype == LYS_LEAFLIST) {
1479 /* leaf-list needs to be hashed again and re-inserted into parent */
1480 lyd_unlink_hash(term);
1481 lyd_hash(term);
1482 LY_CHECK_GOTO(ret = lyd_insert_hash(term), cleanup);
1483 } else if ((term->schema->flags & LYS_KEY) && term->parent) {
1484 /* list needs to be updated if its key was changed */
1485 assert(term->parent->schema->nodetype == LYS_LIST);
Michal Vasko9e685082021-01-29 14:49:09 +01001486 lyd_unlink_hash(lyd_parent(term));
1487 lyd_hash(lyd_parent(term));
1488 LY_CHECK_GOTO(ret = lyd_insert_hash(lyd_parent(term)), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001489 } /* else leaf that is not a key, its value is not used for its hash so it does not change */
1490 }
1491
1492 /* retrun value */
1493 if (!val_change) {
1494 if (dflt_change) {
1495 /* only default flag change */
1496 ret = LY_EEXIST;
1497 } else {
1498 /* no change */
1499 ret = LY_ENOT;
1500 }
1501 } /* else value changed, LY_SUCCESS */
1502
1503cleanup:
Michal Vasko59512fc2020-12-09 18:13:29 +01001504 if (val.realtype) {
1505 type->plugin->free(LYD_CTX(term), &val);
1506 }
Michal Vasko00cbf532020-06-15 13:58:47 +02001507 return ret;
1508}
1509
Michal Vasko41586352020-07-13 13:54:25 +02001510API LY_ERR
Radek Krejci09c77442021-04-26 11:10:34 +02001511lyd_change_term(struct lyd_node *term, const char *val_str)
1512{
1513 LY_CHECK_ARG_RET(NULL, term, term->schema, term->schema->nodetype & LYD_NODE_TERM, LY_EINVAL);
1514
1515 return _lyd_change_term(term, val_str, val_str ? strlen(val_str) : 0, LY_VALUE_JSON);
1516}
1517
1518API LY_ERR
1519lyd_change_term_bin(struct lyd_node *term, const void *value, size_t value_len)
1520{
1521 LY_CHECK_ARG_RET(NULL, term, term->schema, term->schema->nodetype & LYD_NODE_TERM, LY_EINVAL);
1522
1523 return _lyd_change_term(term, value, value_len, LY_VALUE_LYB);
1524}
1525
1526API LY_ERR
1527lyd_change_term_canon(struct lyd_node *term, const char *val_str)
1528{
1529 LY_CHECK_ARG_RET(NULL, term, term->schema, term->schema->nodetype & LYD_NODE_TERM, LY_EINVAL);
1530
1531 return _lyd_change_term(term, val_str, val_str ? strlen(val_str) : 0, LY_VALUE_CANON);
1532}
1533
1534API LY_ERR
Michal Vasko41586352020-07-13 13:54:25 +02001535lyd_change_meta(struct lyd_meta *meta, const char *val_str)
1536{
1537 LY_ERR ret = LY_SUCCESS;
Radek Krejci2b18bf12020-11-06 11:20:20 +01001538 struct lyd_meta *m2 = NULL;
Michal Vasko41586352020-07-13 13:54:25 +02001539 struct lyd_value val;
Radek Krejci857189e2020-09-01 13:26:36 +02001540 ly_bool val_change;
Michal Vasko41586352020-07-13 13:54:25 +02001541
1542 LY_CHECK_ARG_RET(NULL, meta, LY_EINVAL);
1543
1544 if (!val_str) {
1545 val_str = "";
1546 }
1547
1548 /* parse the new value into a new meta structure */
1549 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 +02001550 strlen(val_str), NULL, LY_VALUE_JSON, NULL, LYD_HINT_DATA, 0, NULL), cleanup);
Michal Vasko41586352020-07-13 13:54:25 +02001551
1552 /* compare original and new value */
1553 if (lyd_compare_meta(meta, m2)) {
1554 /* values differ, switch them */
1555 val = meta->value;
1556 meta->value = m2->value;
1557 m2->value = val;
1558 val_change = 1;
1559 } else {
1560 val_change = 0;
1561 }
1562
1563 /* retrun value */
1564 if (!val_change) {
1565 /* no change */
1566 ret = LY_ENOT;
1567 } /* else value changed, LY_SUCCESS */
1568
1569cleanup:
Michal Vasko1a66a5d2020-11-18 18:15:37 +01001570 lyd_free_meta_single(m2);
Michal Vasko41586352020-07-13 13:54:25 +02001571 return ret;
1572}
1573
Radek Krejci09c77442021-04-26 11:10:34 +02001574/**
1575 * @brief Update node value.
1576 *
1577 * @param[in] node Node to update.
1578 * @param[in] value New value to set.
1579 * @param[in] value_len Length of @p value.
1580 * @param[in] value_type Type of @p value for anydata/anyxml node.
1581 * @param[in] format Format of @p value.
1582 * @param[out] new_parent Set to @p node if the value was updated, otherwise set to NULL.
1583 * @param[out] new_node Set to @p node if the value was updated, otherwise set to NULL.
1584 * @return LY_ERR value.
1585 */
Michal Vasko6741dc62021-02-04 09:27:45 +01001586static LY_ERR
Radek Krejci09c77442021-04-26 11:10:34 +02001587lyd_new_path_update(struct lyd_node *node, const void *value, size_t value_len, LYD_ANYDATA_VALUETYPE value_type,
1588 LY_VALUE_FORMAT format, struct lyd_node **new_parent, struct lyd_node **new_node)
1589{
1590 LY_ERR ret = LY_SUCCESS;
1591 struct lyd_node *new_any;
1592
1593 switch (node->schema->nodetype) {
1594 case LYS_CONTAINER:
1595 case LYS_NOTIF:
1596 case LYS_RPC:
1597 case LYS_ACTION:
1598 case LYS_LIST:
1599 /* if it exists, there is nothing to update */
1600 *new_parent = NULL;
1601 *new_node = NULL;
1602 break;
1603 case LYS_LEAFLIST:
1604 if (!lysc_is_dup_inst_list(node->schema)) {
1605 /* if it exists, there is nothing to update */
1606 *new_parent = NULL;
1607 *new_node = NULL;
1608 break;
1609 }
1610 /* fallthrough */
1611 case LYS_LEAF:
1612 ret = _lyd_change_term(node, value, value_len, format);
1613 if ((ret == LY_SUCCESS) || (ret == LY_EEXIST)) {
1614 /* there was an actual change (at least of the default flag) */
1615 *new_parent = node;
1616 *new_node = node;
1617 ret = LY_SUCCESS;
1618 } else if (ret == LY_ENOT) {
1619 /* no change */
1620 *new_parent = NULL;
1621 *new_node = NULL;
1622 ret = LY_SUCCESS;
1623 } /* else error */
1624 break;
1625 case LYS_ANYDATA:
1626 case LYS_ANYXML:
1627 /* create a new any node */
1628 LY_CHECK_RET(lyd_create_any(node->schema, value, value_type, 0, &new_any));
1629
1630 /* compare with the existing one */
1631 if (lyd_compare_single(node, new_any, 0)) {
1632 /* not equal, switch values (so that we can use generic node free) */
1633 ((struct lyd_node_any *)new_any)->value = ((struct lyd_node_any *)node)->value;
1634 ((struct lyd_node_any *)new_any)->value_type = ((struct lyd_node_any *)node)->value_type;
1635 ((struct lyd_node_any *)node)->value.str = value;
1636 ((struct lyd_node_any *)node)->value_type = value_type;
1637
1638 *new_parent = node;
1639 *new_node = node;
1640 } else {
1641 /* they are equal */
1642 *new_parent = NULL;
1643 *new_node = NULL;
1644 }
1645 lyd_free_tree(new_any);
1646 break;
1647 default:
1648 LOGINT(LYD_CTX(node));
1649 ret = LY_EINT;
1650 break;
1651 }
1652
1653 return ret;
1654}
1655
1656static LY_ERR
1657lyd_new_path_check_find_lypath(struct ly_path *path, const char *str_path, const char *value, size_t value_len,
1658 LY_VALUE_FORMAT format, uint32_t options)
Michal Vasko6741dc62021-02-04 09:27:45 +01001659{
Michal Vaskoe78faec2021-04-08 17:24:43 +02001660 LY_ERR r;
Michal Vasko6741dc62021-02-04 09:27:45 +01001661 struct ly_path_predicate *pred;
Michal Vaskoe78faec2021-04-08 17:24:43 +02001662 const struct lysc_node *schema = NULL;
1663 LY_ARRAY_COUNT_TYPE u, new_count;
1664 int create = 0;
Michal Vasko6741dc62021-02-04 09:27:45 +01001665
1666 assert(path);
1667
1668 /* go through all the compiled nodes */
1669 LY_ARRAY_FOR(path, u) {
1670 schema = path[u].node;
Michal Vaskoe78faec2021-04-08 17:24:43 +02001671
1672 if (lysc_is_dup_inst_list(schema)) {
1673 if (path[u].pred_type == LY_PATH_PREDTYPE_NONE) {
1674 /* creating a new key-less list or state leaf-list instance */
1675 create = 1;
1676 new_count = u;
1677 } else if (path[u].pred_type != LY_PATH_PREDTYPE_POSITION) {
1678 LOG_LOCSET(schema, NULL, NULL, NULL);
1679 LOGVAL(schema->module->ctx, LYVE_XPATH, "Invalid predicate for %s \"%s\" in path \"%s\".",
1680 lys_nodetype2str(schema->nodetype), schema->name, str_path);
1681 LOG_LOCBACK(1, 0, 0, 0);
1682 return LY_EINVAL;
1683 }
1684 } else if ((schema->nodetype == LYS_LIST) && (path[u].pred_type != LY_PATH_PREDTYPE_LIST)) {
1685 if ((u < LY_ARRAY_COUNT(path) - 1) || !(options & LYD_NEW_PATH_OPAQ)) {
Michal Vasko6741dc62021-02-04 09:27:45 +01001686 LOG_LOCSET(schema, NULL, NULL, NULL);
1687 LOGVAL(schema->module->ctx, LYVE_XPATH, "Predicate missing for %s \"%s\" in path \"%s\".",
1688 lys_nodetype2str(schema->nodetype), schema->name, str_path);
1689 LOG_LOCBACK(1, 0, 0, 0);
1690 return LY_EINVAL;
Michal Vaskoe78faec2021-04-08 17:24:43 +02001691 } /* else creating an opaque list */
1692 } else if ((schema->nodetype == LYS_LEAFLIST) && (path[u].pred_type != LY_PATH_PREDTYPE_LEAFLIST)) {
Michal Vaskoe78faec2021-04-08 17:24:43 +02001693 r = LY_SUCCESS;
1694 if (options & LYD_NEW_PATH_OPAQ) {
Radek Krejci09c77442021-04-26 11:10:34 +02001695 r = lyd_value_validate(NULL, schema, value, value_len, NULL, NULL, NULL);
Michal Vaskoe78faec2021-04-08 17:24:43 +02001696 }
1697 if (!r) {
1698 /* store the new predicate so that it is used when searching for this instance */
1699 path[u].pred_type = LY_PATH_PREDTYPE_LEAFLIST;
1700 LY_ARRAY_NEW_RET(schema->module->ctx, path[u].predicates, pred, LY_EMEM);
1701
1702 LY_CHECK_RET(lyd_value_store(schema->module->ctx, &pred->value,
Radek Krejci09c77442021-04-26 11:10:34 +02001703 ((struct lysc_node_leaflist *)schema)->type, value, value_len, NULL, format, NULL,
Michal Vaskoe78faec2021-04-08 17:24:43 +02001704 LYD_HINT_DATA, schema, NULL));
1705 ++((struct lysc_type *)pred->value.realtype)->refcount;
1706 } /* else we have opaq flag and the value is not valid, leave no predicate and then create an opaque node */
1707 }
Michal Vasko6741dc62021-02-04 09:27:45 +01001708 }
1709
Michal Vaskoe78faec2021-04-08 17:24:43 +02001710 if (create) {
1711 /* hide the nodes that should always be created so they are not found */
1712 while (new_count < LY_ARRAY_COUNT(path)) {
1713 LY_ARRAY_DECREMENT(path);
1714 }
Michal Vasko6741dc62021-02-04 09:27:45 +01001715 }
1716
Michal Vaskoe78faec2021-04-08 17:24:43 +02001717 return LY_SUCCESS;
Michal Vasko6741dc62021-02-04 09:27:45 +01001718}
1719
Radek Krejci95ccd1b2021-03-12 14:57:22 +01001720/**
1721 * @brief Create a new node in the data tree based on a path. All node types can be created.
1722 *
1723 * If @p path points to a list key and the list instance does not exist, the key value from the predicate is used
1724 * and @p value is ignored. Also, if a leaf-list is being created and both a predicate is defined in @p path
1725 * and @p value is set, the predicate is preferred.
1726 *
1727 * For key-less lists and state leaf-lists, positional predicates can be used. If no preciate is used for these
1728 * nodes, they are always created.
1729 *
1730 * @param[in] parent Data parent to add to/modify, can be NULL. Note that in case a first top-level sibling is used,
1731 * it may no longer be first if @p path is absolute and starts with a non-existing top-level node inserted
1732 * before @p parent. Use ::lyd_first_sibling() to adjust @p parent in these cases.
1733 * @param[in] ctx libyang context, must be set if @p parent is NULL.
1734 * @param[in] ext Extension instance where the node being created is defined. This argument takes effect only for absolute
1735 * path or when the relative paths touches document root (top-level). In such cases the present extension instance replaces
1736 * searching for the appropriate module.
1737 * @param[in] path [Path](@ref howtoXPath) to create.
Radek Krejci09c77442021-04-26 11:10:34 +02001738 * @param[in] value Value of the new leaf/leaf-list (const char *) in ::LY_VALUE_JSON format. If creating an
1739 * anyxml/anydata node, the expected type depends on @p value_type. For other node types, it should be NULL.
1740 * @param[in] value_len Length of @p value in bytes. May be 0 if @p value is a zero-terminated string. Ignored when
1741 * creating anyxml/anydata nodes.
Radek Krejci95ccd1b2021-03-12 14:57:22 +01001742 * @param[in] value_type Anyxml/anydata node @p value type.
1743 * @param[in] options Bitmask of options, see @ref pathoptions.
1744 * @param[out] new_parent Optional first parent node created. If only one node was created, equals to @p new_node.
1745 * @param[out] new_node Optional last node created.
1746 * @return LY_ERR value.
1747 */
1748static LY_ERR
1749lyd_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 +02001750 const void *value, size_t value_len, LYD_ANYDATA_VALUETYPE value_type, uint32_t options,
Radek Krejci95ccd1b2021-03-12 14:57:22 +01001751 struct lyd_node **new_parent, struct lyd_node **new_node)
Michal Vasko00cbf532020-06-15 13:58:47 +02001752{
1753 LY_ERR ret = LY_SUCCESS, r;
1754 struct lyxp_expr *exp = NULL;
1755 struct ly_path *p = NULL;
1756 struct lyd_node *nparent = NULL, *nnode = NULL, *node = NULL, *cur_parent;
1757 const struct lysc_node *schema;
Michal Vaskoe78faec2021-04-08 17:24:43 +02001758 const struct lyd_value *val = NULL;
Radek Krejci910d0132021-03-05 14:19:31 +01001759 LY_ARRAY_COUNT_TYPE path_idx = 0, orig_count = 0;
Radek Krejci09c77442021-04-26 11:10:34 +02001760 LY_VALUE_FORMAT format;
Michal Vasko00cbf532020-06-15 13:58:47 +02001761
Radek Krejci95ccd1b2021-03-12 14:57:22 +01001762 assert(parent || ctx);
Radek Krejci09c77442021-04-26 11:10:34 +02001763 assert(path && ((path[0] == '/') || parent));
1764 assert(!(options & LYD_NEW_PATH_BIN_VALUE) || !(options & LYD_NEW_PATH_CANON_VALUE));
Michal Vasko00cbf532020-06-15 13:58:47 +02001765
1766 if (!ctx) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001767 ctx = LYD_CTX(parent);
Michal Vasko00cbf532020-06-15 13:58:47 +02001768 }
Radek Krejci09c77442021-04-26 11:10:34 +02001769 if (value && !value_len) {
1770 value_len = strlen(value);
1771 }
1772 if (options & LYD_NEW_PATH_BIN_VALUE) {
1773 format = LY_VALUE_LYB;
1774 } else if (options & LYD_NEW_PATH_CANON_VALUE) {
1775 format = LY_VALUE_CANON;
1776 } else {
1777 format = LY_VALUE_JSON;
1778 }
Michal Vasko00cbf532020-06-15 13:58:47 +02001779
1780 /* parse path */
Michal Vasko6b26e742020-07-17 15:02:10 +02001781 LY_CHECK_GOTO(ret = ly_path_parse(ctx, NULL, path, strlen(path), LY_PATH_BEGIN_EITHER, LY_PATH_LREF_FALSE,
Michal Vasko69730152020-10-09 16:30:07 +02001782 LY_PATH_PREFIX_OPTIONAL, LY_PATH_PRED_SIMPLE, &exp), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001783
1784 /* compile path */
Radek Krejci95ccd1b2021-03-12 14:57:22 +01001785 LY_CHECK_GOTO(ret = ly_path_compile(ctx, NULL, parent ? parent->schema : NULL, ext, exp, LY_PATH_LREF_FALSE,
Radek Krejci8df109d2021-04-23 12:19:08 +02001786 options & LYD_NEW_PATH_OUTPUT ? LY_PATH_OPER_OUTPUT : LY_PATH_OPER_INPUT, LY_PATH_TARGET_MANY, LY_VALUE_JSON,
Michal Vasko405cc9e2020-12-01 12:01:27 +01001787 NULL, NULL, &p), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001788
Michal Vasko6741dc62021-02-04 09:27:45 +01001789 /* check the compiled path before searching existing nodes, it may be shortened */
1790 orig_count = LY_ARRAY_COUNT(p);
Radek Krejci09c77442021-04-26 11:10:34 +02001791 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 +02001792
1793 /* try to find any existing nodes in the path */
1794 if (parent) {
1795 ret = ly_path_eval_partial(p, parent, &path_idx, &node);
1796 if (ret == LY_SUCCESS) {
Michal Vasko6741dc62021-02-04 09:27:45 +01001797 if (orig_count == LY_ARRAY_COUNT(p)) {
1798 /* the node exists, are we supposed to update it or is it just a default? */
1799 if (!(options & LYD_NEW_PATH_UPDATE) && !(node->flags & LYD_DEFAULT)) {
1800 LOG_LOCSET(NULL, node, NULL, NULL);
1801 LOGVAL(ctx, LYVE_REFERENCE, "Path \"%s\" already exists", path);
1802 LOG_LOCBACK(0, 1, 0, 0);
1803 ret = LY_EEXIST;
1804 goto cleanup;
1805 }
Michal Vasko00cbf532020-06-15 13:58:47 +02001806
Michal Vasko6741dc62021-02-04 09:27:45 +01001807 /* update the existing node */
Radek Krejci09c77442021-04-26 11:10:34 +02001808 ret = lyd_new_path_update(node, value, value_len, value_type, format, &nparent, &nnode);
Michal Vasko6741dc62021-02-04 09:27:45 +01001809 goto cleanup;
1810 } /* else we were not searching for the whole path */
Michal Vasko00cbf532020-06-15 13:58:47 +02001811 } else if (ret == LY_EINCOMPLETE) {
1812 /* some nodes were found, adjust the iterator to the next segment */
1813 ++path_idx;
1814 } else if (ret == LY_ENOTFOUND) {
1815 /* 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 +01001816 if (lysc_data_parent(p[0].node)) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001817 node = parent;
1818 }
1819 } else {
1820 /* error */
1821 goto cleanup;
1822 }
1823 }
1824
Michal Vasko6741dc62021-02-04 09:27:45 +01001825 /* restore the full path for creating new nodes */
1826 while (orig_count > LY_ARRAY_COUNT(p)) {
1827 LY_ARRAY_INCREMENT(p);
1828 }
1829
Michal Vasko00cbf532020-06-15 13:58:47 +02001830 /* create all the non-existing nodes in a loop */
Michal Vaskod989ba02020-08-24 10:59:24 +02001831 for ( ; path_idx < LY_ARRAY_COUNT(p); ++path_idx) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001832 cur_parent = node;
1833 schema = p[path_idx].node;
1834
1835 switch (schema->nodetype) {
1836 case LYS_LIST:
Michal Vaskoe78faec2021-04-08 17:24:43 +02001837 if (lysc_is_dup_inst_list(schema)) {
1838 /* create key-less list instance */
1839 LY_CHECK_GOTO(ret = lyd_create_inner(schema, &node), cleanup);
1840 } else if ((options & LYD_NEW_PATH_OPAQ) && (p[path_idx].pred_type == LY_PATH_PREDTYPE_NONE)) {
1841 /* creating opaque list without keys */
1842 LY_CHECK_GOTO(ret = lyd_create_opaq(ctx, schema->name, strlen(schema->name), NULL, 0,
Radek Krejci8df109d2021-04-23 12:19:08 +02001843 schema->module->name, strlen(schema->module->name), NULL, 0, NULL, LY_VALUE_JSON, NULL,
Michal Vaskoe78faec2021-04-08 17:24:43 +02001844 LYD_NODEHINT_LIST, &node), cleanup);
1845 } else {
1846 /* create standard list instance */
1847 assert(p[path_idx].pred_type == LY_PATH_PREDTYPE_LIST);
1848 LY_CHECK_GOTO(ret = lyd_create_list(schema, p[path_idx].predicates, &node), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001849 }
Michal Vaskoe78faec2021-04-08 17:24:43 +02001850 break;
Michal Vasko00cbf532020-06-15 13:58:47 +02001851 case LYS_CONTAINER:
1852 case LYS_NOTIF:
1853 case LYS_RPC:
1854 case LYS_ACTION:
1855 LY_CHECK_GOTO(ret = lyd_create_inner(schema, &node), cleanup);
1856 break;
1857 case LYS_LEAFLIST:
Michal Vaskoe78faec2021-04-08 17:24:43 +02001858 if ((options & LYD_NEW_PATH_OPAQ) && (p[path_idx].pred_type != LY_PATH_PREDTYPE_LEAFLIST)) {
1859 /* we have not checked this only for dup-inst lists, otherwise it must be opaque */
1860 r = LY_EVALID;
1861 if (lysc_is_dup_inst_list(schema)) {
1862 /* validate value */
Radek Krejci09c77442021-04-26 11:10:34 +02001863 r = lyd_value_validate(NULL, schema, value ? value : "", value_len, NULL, NULL, NULL);
Michal Vaskoe78faec2021-04-08 17:24:43 +02001864 }
1865 if (r && (r != LY_EINCOMPLETE)) {
1866 /* creating opaque leaf-list */
Radek Krejci09c77442021-04-26 11:10:34 +02001867 LY_CHECK_GOTO(ret = lyd_create_opaq(ctx, schema->name, strlen(schema->name), value, value_len,
1868 schema->module->name, strlen(schema->module->name), NULL, 0, NULL, format, NULL,
1869 LYD_NODEHINT_LEAFLIST, &node), cleanup);
Michal Vaskoe78faec2021-04-08 17:24:43 +02001870 break;
1871 }
1872 }
1873
1874 /* get value to set */
1875 if (p[path_idx].pred_type == LY_PATH_PREDTYPE_LEAFLIST) {
1876 val = &p[path_idx].predicates[0].value;
Michal Vaskoe78faec2021-04-08 17:24:43 +02001877 }
1878
1879 /* create a leaf-list instance */
1880 if (val) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001881 LY_CHECK_GOTO(ret = lyd_create_term2(schema, &p[path_idx].predicates[0].value, &node), cleanup);
Michal Vaskoe78faec2021-04-08 17:24:43 +02001882 } else {
Radek Krejci09c77442021-04-26 11:10:34 +02001883 LY_CHECK_GOTO(ret = lyd_create_term(schema, value, value_len, NULL, format, NULL, LYD_HINT_DATA,
1884 NULL, &node), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001885 }
1886 break;
1887 case LYS_LEAF:
Michal Vasko35880332020-12-08 13:08:12 +01001888 if (lysc_is_key(schema)) {
1889 /* it must have been already created or some error will occur later */
1890 assert(cur_parent);
1891 node = lyd_child(cur_parent);
1892 assert(node && (node->schema == schema));
1893 goto next_iter;
1894 }
1895
Michal Vaskoe78faec2021-04-08 17:24:43 +02001896 if (options & LYD_NEW_PATH_OPAQ) {
1897 /* validate value */
Radek Krejci09c77442021-04-26 11:10:34 +02001898 r = lyd_value_validate(NULL, schema, value ? value : "", value_len, NULL, NULL, NULL);
Michal Vaskoe78faec2021-04-08 17:24:43 +02001899 if (r && (r != LY_EINCOMPLETE)) {
1900 /* creating opaque leaf */
Radek Krejci09c77442021-04-26 11:10:34 +02001901 LY_CHECK_GOTO(ret = lyd_create_opaq(ctx, schema->name, strlen(schema->name), value, value_len,
1902 schema->module->name, strlen(schema->module->name), NULL, 0, NULL, format, NULL, 0, &node),
1903 cleanup);
Michal Vaskoe78faec2021-04-08 17:24:43 +02001904 break;
1905 }
1906 }
1907
Michal Vaskoe78faec2021-04-08 17:24:43 +02001908 /* create a leaf instance */
Radek Krejci09c77442021-04-26 11:10:34 +02001909 LY_CHECK_GOTO(ret = lyd_create_term(schema, value, value_len, NULL, format, NULL, LYD_HINT_DATA, NULL,
1910 &node), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001911 break;
1912 case LYS_ANYDATA:
1913 case LYS_ANYXML:
Michal Vasko366a4a12020-12-04 16:23:57 +01001914 LY_CHECK_GOTO(ret = lyd_create_any(schema, value, value_type, 0, &node), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001915 break;
1916 default:
1917 LOGINT(ctx);
1918 ret = LY_EINT;
1919 goto cleanup;
1920 }
1921
1922 if (cur_parent) {
1923 /* connect to the parent */
1924 lyd_insert_node(cur_parent, NULL, node);
1925 } else if (parent) {
1926 /* connect to top-level siblings */
1927 lyd_insert_node(NULL, &parent, node);
1928 }
1929
Michal Vasko35880332020-12-08 13:08:12 +01001930next_iter:
Michal Vasko00cbf532020-06-15 13:58:47 +02001931 /* update remembered nodes */
1932 if (!nparent) {
1933 nparent = node;
1934 }
1935 nnode = node;
1936 }
1937
1938cleanup:
1939 lyxp_expr_free(ctx, exp);
Michal Vasko6741dc62021-02-04 09:27:45 +01001940 if (p) {
1941 while (orig_count > LY_ARRAY_COUNT(p)) {
1942 LY_ARRAY_INCREMENT(p);
1943 }
1944 }
Michal Vasko00cbf532020-06-15 13:58:47 +02001945 ly_path_free(ctx, p);
1946 if (!ret) {
1947 /* set out params only on success */
1948 if (new_parent) {
1949 *new_parent = nparent;
1950 }
1951 if (new_node) {
1952 *new_node = nnode;
1953 }
Michal Vaskof4b95ba2020-12-11 08:42:33 +01001954 } else {
1955 lyd_free_tree(nparent);
Michal Vasko00cbf532020-06-15 13:58:47 +02001956 }
1957 return ret;
1958}
1959
Radek Krejci95ccd1b2021-03-12 14:57:22 +01001960API LY_ERR
1961lyd_new_path(struct lyd_node *parent, const struct ly_ctx *ctx, const char *path, const char *value, uint32_t options,
1962 struct lyd_node **node)
1963{
Radek Krejci09c77442021-04-26 11:10:34 +02001964 LY_CHECK_ARG_RET(ctx, parent || ctx, path, (path[0] == '/') || parent,
1965 !(options & LYD_NEW_PATH_BIN_VALUE) || !(options & LYD_NEW_PATH_CANON_VALUE), LY_EINVAL);
1966
1967 return lyd_new_path_(parent, ctx, NULL, path, value, 0, LYD_ANYDATA_STRING, options, node, NULL);
Radek Krejci95ccd1b2021-03-12 14:57:22 +01001968}
1969
1970API LY_ERR
1971lyd_new_path2(struct lyd_node *parent, const struct ly_ctx *ctx, const char *path, const void *value,
Radek Krejci09c77442021-04-26 11:10:34 +02001972 size_t value_len, LYD_ANYDATA_VALUETYPE value_type, uint32_t options, struct lyd_node **new_parent,
1973 struct lyd_node **new_node)
Radek Krejci95ccd1b2021-03-12 14:57:22 +01001974{
Radek Krejci09c77442021-04-26 11:10:34 +02001975 LY_CHECK_ARG_RET(ctx, parent || ctx, path, (path[0] == '/') || parent,
1976 !(options & LYD_NEW_PATH_BIN_VALUE) || !(options & LYD_NEW_PATH_CANON_VALUE), LY_EINVAL);
1977 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 +01001978}
1979
1980API LY_ERR
1981lyd_new_ext_path(struct lyd_node *parent, const struct lysc_ext_instance *ext, const char *path, const void *value,
1982 uint32_t options, struct lyd_node **node)
1983{
1984 const struct ly_ctx *ctx = ext ? ext->module->ctx : NULL;
1985
Radek Krejci09c77442021-04-26 11:10:34 +02001986 LY_CHECK_ARG_RET(ctx, ext, path, (path[0] == '/') || parent,
1987 !(options & LYD_NEW_PATH_BIN_VALUE) || !(options & LYD_NEW_PATH_CANON_VALUE), LY_EINVAL);
1988 return lyd_new_path_(parent, ctx, ext, path, value, 0, LYD_ANYDATA_STRING, options, node, NULL);
Radek Krejci95ccd1b2021-03-12 14:57:22 +01001989}
1990
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001991LY_ERR
1992lyd_new_implicit_r(struct lyd_node *parent, struct lyd_node **first, const struct lysc_node *sparent,
Radek Krejci4f2e3e52021-03-30 14:20:28 +02001993 const struct lys_module *mod, struct ly_set *node_when, struct ly_set *node_exts, struct ly_set *node_types,
1994 uint32_t impl_opts, struct lyd_node **diff)
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001995{
1996 LY_ERR ret;
Michal Vaskod1e53b92021-01-28 13:11:06 +01001997 const struct lysc_node *iter = NULL;
Radek Krejci2b18bf12020-11-06 11:20:20 +01001998 struct lyd_node *node = NULL;
Michal Vaskoa6669ba2020-08-06 16:14:26 +02001999 struct lyd_value **dflts;
2000 LY_ARRAY_COUNT_TYPE u;
Michal Vasko630d9892020-12-08 17:11:08 +01002001 uint32_t getnext_opts;
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002002
2003 assert(first && (parent || sparent || mod));
2004
2005 if (!sparent && parent) {
2006 sparent = parent->schema;
2007 }
2008
Michal Vasko630d9892020-12-08 17:11:08 +01002009 getnext_opts = LYS_GETNEXT_WITHCHOICE;
2010 if (impl_opts & LYD_IMPLICIT_OUTPUT) {
2011 getnext_opts |= LYS_GETNEXT_OUTPUT;
2012 }
2013
2014 while ((iter = lys_getnext(iter, sparent, mod ? mod->compiled : NULL, getnext_opts))) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002015 if ((impl_opts & LYD_IMPLICIT_NO_STATE) && (iter->flags & LYS_CONFIG_R)) {
2016 continue;
Michal Vasko44b19a12020-08-07 09:21:30 +02002017 } else if ((impl_opts & LYD_IMPLICIT_NO_CONFIG) && (iter->flags & LYS_CONFIG_W)) {
2018 continue;
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002019 }
2020
2021 switch (iter->nodetype) {
2022 case LYS_CHOICE:
Michal Vaskobcf4d7d2020-11-18 18:16:49 +01002023 node = lys_getnext_data(NULL, *first, NULL, iter, NULL);
2024 if (!node && ((struct lysc_node_choice *)iter)->dflt) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002025 /* create default case data */
Michal Vasko14ed9cd2021-01-28 14:16:25 +01002026 LY_CHECK_RET(lyd_new_implicit_r(parent, first, &((struct lysc_node_choice *)iter)->dflt->node,
Radek Krejci4f2e3e52021-03-30 14:20:28 +02002027 NULL, node_when, node_exts, node_types, impl_opts, diff));
Michal Vaskobcf4d7d2020-11-18 18:16:49 +01002028 } else if (node) {
2029 /* create any default data in the existing case */
2030 assert(node->schema->parent->nodetype == LYS_CASE);
Radek Krejci4f2e3e52021-03-30 14:20:28 +02002031 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 +01002032 impl_opts, diff));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002033 }
2034 break;
2035 case LYS_CONTAINER:
2036 if (!(iter->flags & LYS_PRESENCE) && lyd_find_sibling_val(*first, iter, NULL, 0, NULL)) {
2037 /* create default NP container */
2038 LY_CHECK_RET(lyd_create_inner(iter, &node));
Michal Vaskof4d67ea2021-03-31 13:53:21 +02002039 node->flags = LYD_DEFAULT | (lysc_has_when(iter) ? LYD_WHEN_TRUE : 0);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002040 lyd_insert_node(parent, first, node);
2041
Michal Vaskof4d67ea2021-03-31 13:53:21 +02002042 if (lysc_has_when(iter) && node_when) {
Michal Vaskoe16c7b72021-02-26 10:39:06 +01002043 /* remember to resolve when */
2044 LY_CHECK_RET(ly_set_add(node_when, node, 1, NULL));
2045 }
Radek Krejci4f2e3e52021-03-30 14:20:28 +02002046 if (node_exts) {
2047 /* remember to call all the extension's validation callbacks */
2048 LY_CHECK_RET(lysc_node_ext_tovalidate(node_exts, node));
2049 }
Michal Vaskoe49b6322020-11-05 17:38:36 +01002050 if (diff) {
2051 /* add into diff */
2052 LY_CHECK_RET(lyd_val_diff_add(node, LYD_DIFF_OP_CREATE, diff));
2053 }
2054
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002055 /* create any default children */
Radek Krejci4f2e3e52021-03-30 14:20:28 +02002056 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 +02002057 impl_opts, diff));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002058 }
2059 break;
2060 case LYS_LEAF:
Michal Vasko69730152020-10-09 16:30:07 +02002061 if (!(impl_opts & LYD_IMPLICIT_NO_DEFAULTS) && ((struct lysc_node_leaf *)iter)->dflt &&
2062 lyd_find_sibling_val(*first, iter, NULL, 0, NULL)) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002063 /* create default leaf */
2064 ret = lyd_create_term2(iter, ((struct lysc_node_leaf *)iter)->dflt, &node);
2065 if (ret == LY_EINCOMPLETE) {
2066 if (node_types) {
2067 /* remember to resolve type */
Radek Krejci3d92e442020-10-12 12:48:13 +02002068 LY_CHECK_RET(ly_set_add(node_types, node, 1, NULL));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002069 }
2070 } else if (ret) {
2071 return ret;
2072 }
Michal Vaskof4d67ea2021-03-31 13:53:21 +02002073 node->flags = LYD_DEFAULT | (lysc_has_when(iter) ? LYD_WHEN_TRUE : 0);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002074 lyd_insert_node(parent, first, node);
2075
Michal Vaskof4d67ea2021-03-31 13:53:21 +02002076 if (lysc_has_when(iter) && node_when) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002077 /* remember to resolve when */
Radek Krejci3d92e442020-10-12 12:48:13 +02002078 LY_CHECK_RET(ly_set_add(node_when, node, 1, NULL));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002079 }
Radek Krejci4f2e3e52021-03-30 14:20:28 +02002080 if (node_exts) {
2081 /* remember to call all the extension's validation callbacks */
2082 LY_CHECK_RET(lysc_node_ext_tovalidate(node_exts, node));
2083 }
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002084 if (diff) {
2085 /* add into diff */
2086 LY_CHECK_RET(lyd_val_diff_add(node, LYD_DIFF_OP_CREATE, diff));
2087 }
2088 }
2089 break;
2090 case LYS_LEAFLIST:
Michal Vasko69730152020-10-09 16:30:07 +02002091 if (!(impl_opts & LYD_IMPLICIT_NO_DEFAULTS) && ((struct lysc_node_leaflist *)iter)->dflts &&
2092 lyd_find_sibling_val(*first, iter, NULL, 0, NULL)) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002093 /* create all default leaf-lists */
2094 dflts = ((struct lysc_node_leaflist *)iter)->dflts;
2095 LY_ARRAY_FOR(dflts, u) {
2096 ret = lyd_create_term2(iter, dflts[u], &node);
2097 if (ret == LY_EINCOMPLETE) {
2098 if (node_types) {
2099 /* remember to resolve type */
Radek Krejci3d92e442020-10-12 12:48:13 +02002100 LY_CHECK_RET(ly_set_add(node_types, node, 1, NULL));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002101 }
2102 } else if (ret) {
2103 return ret;
2104 }
Michal Vaskof4d67ea2021-03-31 13:53:21 +02002105 node->flags = LYD_DEFAULT | (lysc_has_when(iter) ? LYD_WHEN_TRUE : 0);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002106 lyd_insert_node(parent, first, node);
2107
Michal Vaskof4d67ea2021-03-31 13:53:21 +02002108 if (lysc_has_when(iter) && node_when) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002109 /* remember to resolve when */
Radek Krejci3d92e442020-10-12 12:48:13 +02002110 LY_CHECK_RET(ly_set_add(node_when, node, 1, NULL));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002111 }
Radek Krejci4f2e3e52021-03-30 14:20:28 +02002112 if (node_exts) {
2113 /* remember to call all the extension's validation callbacks */
2114 LY_CHECK_RET(lysc_node_ext_tovalidate(node_exts, node));
2115 }
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002116 if (diff) {
2117 /* add into diff */
2118 LY_CHECK_RET(lyd_val_diff_add(node, LYD_DIFF_OP_CREATE, diff));
2119 }
2120 }
2121 }
2122 break;
2123 default:
2124 /* without defaults */
2125 break;
2126 }
2127 }
2128
2129 return LY_SUCCESS;
2130}
2131
2132API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02002133lyd_new_implicit_tree(struct lyd_node *tree, uint32_t implicit_options, struct lyd_node **diff)
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002134{
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002135 LY_ERR ret = LY_SUCCESS;
Michal Vasko3488ada2020-12-03 14:18:19 +01002136 struct lyd_node *node;
Radek Krejci4f2e3e52021-03-30 14:20:28 +02002137 struct ly_set node_when = {0}, node_exts = {0};
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002138
2139 LY_CHECK_ARG_RET(NULL, tree, LY_EINVAL);
2140 if (diff) {
2141 *diff = NULL;
2142 }
2143
Michal Vasko56daf732020-08-10 10:57:18 +02002144 LYD_TREE_DFS_BEGIN(tree, node) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002145 /* skip added default nodes */
Michal Vasko69730152020-10-09 16:30:07 +02002146 if (((node->flags & (LYD_DEFAULT | LYD_NEW)) != (LYD_DEFAULT | LYD_NEW)) &&
2147 (node->schema->nodetype & LYD_NODE_INNER)) {
Radek Krejci4f2e3e52021-03-30 14:20:28 +02002148 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 +01002149 NULL, implicit_options, diff), cleanup);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002150 }
2151
Michal Vasko56daf732020-08-10 10:57:18 +02002152 LYD_TREE_DFS_END(tree, node);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002153 }
2154
Michal Vasko3488ada2020-12-03 14:18:19 +01002155 /* resolve when and remove any invalid defaults */
Radek Krejci4f2e3e52021-03-30 14:20:28 +02002156 LY_CHECK_GOTO(ret = lyd_validate_unres(&tree, NULL, &node_when, &node_exts, NULL, NULL, diff), cleanup);
Michal Vasko3488ada2020-12-03 14:18:19 +01002157
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002158cleanup:
Michal Vasko3488ada2020-12-03 14:18:19 +01002159 ly_set_erase(&node_when, NULL);
Radek Krejci4f2e3e52021-03-30 14:20:28 +02002160 ly_set_erase(&node_exts, NULL);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002161 if (ret && diff) {
2162 lyd_free_all(*diff);
2163 *diff = NULL;
2164 }
2165 return ret;
2166}
2167
2168API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02002169lyd_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 +02002170{
2171 const struct lys_module *mod;
2172 struct lyd_node *d = NULL;
2173 uint32_t i = 0;
2174 LY_ERR ret = LY_SUCCESS;
2175
2176 LY_CHECK_ARG_RET(ctx, tree, *tree || ctx, LY_EINVAL);
2177 if (diff) {
2178 *diff = NULL;
2179 }
2180 if (!ctx) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02002181 ctx = LYD_CTX(*tree);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002182 }
2183
2184 /* add nodes for each module one-by-one */
2185 while ((mod = ly_ctx_get_module_iter(ctx, &i))) {
2186 if (!mod->implemented) {
2187 continue;
2188 }
2189
2190 LY_CHECK_GOTO(ret = lyd_new_implicit_module(tree, mod, implicit_options, diff ? &d : NULL), cleanup);
2191 if (d) {
2192 /* merge into one diff */
2193 lyd_insert_sibling(*diff, d, diff);
2194
2195 d = NULL;
2196 }
2197 }
2198
2199cleanup:
2200 if (ret && diff) {
2201 lyd_free_all(*diff);
2202 *diff = NULL;
2203 }
2204 return ret;
2205}
2206
2207API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02002208lyd_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 +02002209{
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002210 LY_ERR ret = LY_SUCCESS;
Michal Vasko3488ada2020-12-03 14:18:19 +01002211 struct lyd_node *root, *d = NULL;
Radek Krejci4f2e3e52021-03-30 14:20:28 +02002212 struct ly_set node_when = {0}, node_exts = {0};
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002213
2214 LY_CHECK_ARG_RET(NULL, tree, module, LY_EINVAL);
2215 if (diff) {
2216 *diff = NULL;
2217 }
2218
2219 /* add all top-level defaults for this module */
Radek Krejci4f2e3e52021-03-30 14:20:28 +02002220 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 +01002221
2222 /* resolve when and remove any invalid defaults */
Radek Krejci4f2e3e52021-03-30 14:20:28 +02002223 LY_CHECK_GOTO(ret = lyd_validate_unres(tree, module, &node_when, &node_exts, NULL, NULL, diff), cleanup);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002224
2225 /* process nested nodes */
2226 LY_LIST_FOR(*tree, root) {
2227 /* skip added default nodes */
2228 if ((root->flags & (LYD_DEFAULT | LYD_NEW)) != (LYD_DEFAULT | LYD_NEW)) {
2229 LY_CHECK_GOTO(ret = lyd_new_implicit_tree(root, implicit_options, diff ? &d : NULL), cleanup);
2230
2231 if (d) {
2232 /* merge into one diff */
2233 lyd_insert_sibling(*diff, d, diff);
2234
2235 d = NULL;
2236 }
2237 }
2238 }
2239
2240cleanup:
Michal Vasko3488ada2020-12-03 14:18:19 +01002241 ly_set_erase(&node_when, NULL);
Radek Krejci4f2e3e52021-03-30 14:20:28 +02002242 ly_set_erase(&node_exts, NULL);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002243 if (ret && diff) {
2244 lyd_free_all(*diff);
2245 *diff = NULL;
2246 }
2247 return ret;
2248}
2249
Michal Vasko90932a92020-02-12 14:33:03 +01002250struct lyd_node *
Michal Vaskob104f112020-07-17 09:54:54 +02002251lyd_insert_get_next_anchor(const struct lyd_node *first_sibling, const struct lyd_node *new_node)
Michal Vasko90932a92020-02-12 14:33:03 +01002252{
Michal Vaskob104f112020-07-17 09:54:54 +02002253 const struct lysc_node *schema, *sparent;
Michal Vasko90932a92020-02-12 14:33:03 +01002254 struct lyd_node *match = NULL;
Radek Krejci857189e2020-09-01 13:26:36 +02002255 ly_bool found;
Michal Vasko93b16062020-12-09 18:14:18 +01002256 uint32_t getnext_opts;
Michal Vasko90932a92020-02-12 14:33:03 +01002257
Michal Vaskob104f112020-07-17 09:54:54 +02002258 assert(new_node);
2259
2260 if (!first_sibling || !new_node->schema) {
2261 /* insert at the end, no next anchor */
Michal Vasko90932a92020-02-12 14:33:03 +01002262 return NULL;
2263 }
2264
Michal Vasko93b16062020-12-09 18:14:18 +01002265 getnext_opts = 0;
Michal Vaskod1e53b92021-01-28 13:11:06 +01002266 if (new_node->schema->flags & LYS_IS_OUTPUT) {
Michal Vasko93b16062020-12-09 18:14:18 +01002267 getnext_opts = LYS_GETNEXT_OUTPUT;
2268 }
2269
Michal Vaskob104f112020-07-17 09:54:54 +02002270 if (first_sibling->parent && first_sibling->parent->children_ht) {
2271 /* find the anchor using hashes */
2272 sparent = first_sibling->parent->schema;
Michal Vasko93b16062020-12-09 18:14:18 +01002273 schema = lys_getnext(new_node->schema, sparent, NULL, getnext_opts);
Michal Vaskob104f112020-07-17 09:54:54 +02002274 while (schema) {
2275 /* keep trying to find the first existing instance of the closest following schema sibling,
2276 * otherwise return NULL - inserting at the end */
2277 if (!lyd_find_sibling_schema(first_sibling, schema, &match)) {
2278 break;
2279 }
2280
Michal Vasko93b16062020-12-09 18:14:18 +01002281 schema = lys_getnext(schema, sparent, NULL, getnext_opts);
Michal Vaskob104f112020-07-17 09:54:54 +02002282 }
2283 } else {
2284 /* find the anchor without hashes */
2285 match = (struct lyd_node *)first_sibling;
2286 if (!lysc_data_parent(new_node->schema)) {
2287 /* we are in top-level, skip all the data from preceding modules */
2288 LY_LIST_FOR(match, match) {
2289 if (!match->schema || (strcmp(lyd_owner_module(match)->name, lyd_owner_module(new_node)->name) >= 0)) {
2290 break;
2291 }
2292 }
2293 }
2294
2295 /* get the first schema sibling */
2296 sparent = lysc_data_parent(new_node->schema);
Michal Vasko93b16062020-12-09 18:14:18 +01002297 schema = lys_getnext(NULL, sparent, new_node->schema->module->compiled, getnext_opts);
Michal Vaskob104f112020-07-17 09:54:54 +02002298
2299 found = 0;
2300 LY_LIST_FOR(match, match) {
2301 if (!match->schema || (lyd_owner_module(match) != lyd_owner_module(new_node))) {
2302 /* we have found an opaque node, which must be at the end, so use it OR
2303 * modules do not match, so we must have traversed all the data from new_node module (if any),
2304 * we have found the first node of the next module, that is what we want */
2305 break;
2306 }
2307
2308 /* skip schema nodes until we find the instantiated one */
2309 while (!found) {
2310 if (new_node->schema == schema) {
2311 /* we have found the schema of the new node, continue search to find the first
2312 * data node with a different schema (after our schema) */
2313 found = 1;
2314 break;
2315 }
2316 if (match->schema == schema) {
2317 /* current node (match) is a data node still before the new node, continue search in data */
2318 break;
2319 }
Michal Vasko93b16062020-12-09 18:14:18 +01002320 schema = lys_getnext(schema, sparent, new_node->schema->module->compiled, getnext_opts);
Michal Vaskob104f112020-07-17 09:54:54 +02002321 assert(schema);
2322 }
2323
2324 if (found && (match->schema != new_node->schema)) {
2325 /* find the next node after we have found our node schema data instance */
2326 break;
2327 }
2328 }
Michal Vasko90932a92020-02-12 14:33:03 +01002329 }
2330
2331 return match;
2332}
2333
2334/**
2335 * @brief Insert node after a sibling.
2336 *
Michal Vasko9f96a052020-03-10 09:41:45 +01002337 * Handles inserting into NP containers and key-less lists.
2338 *
Michal Vasko90932a92020-02-12 14:33:03 +01002339 * @param[in] sibling Sibling to insert after.
2340 * @param[in] node Node to insert.
2341 */
2342static void
Michal Vaskof03ed032020-03-04 13:31:44 +01002343lyd_insert_after_node(struct lyd_node *sibling, struct lyd_node *node)
Michal Vasko90932a92020-02-12 14:33:03 +01002344{
Michal Vasko0249f7c2020-03-05 16:36:40 +01002345 struct lyd_node_inner *par;
2346
Michal Vasko90932a92020-02-12 14:33:03 +01002347 assert(!node->next && (node->prev == node));
2348
2349 node->next = sibling->next;
2350 node->prev = sibling;
2351 sibling->next = node;
2352 if (node->next) {
2353 /* sibling had a succeeding node */
2354 node->next->prev = node;
2355 } else {
2356 /* sibling was last, find first sibling and change its prev */
2357 if (sibling->parent) {
2358 sibling = sibling->parent->child;
2359 } else {
Michal Vaskod989ba02020-08-24 10:59:24 +02002360 for ( ; sibling->prev->next != node; sibling = sibling->prev) {}
Michal Vasko90932a92020-02-12 14:33:03 +01002361 }
2362 sibling->prev = node;
2363 }
2364 node->parent = sibling->parent;
Michal Vasko0249f7c2020-03-05 16:36:40 +01002365
Michal Vasko9f96a052020-03-10 09:41:45 +01002366 for (par = node->parent; par; par = par->parent) {
2367 if ((par->flags & LYD_DEFAULT) && !(node->flags & LYD_DEFAULT)) {
2368 /* remove default flags from NP containers */
Michal Vasko0249f7c2020-03-05 16:36:40 +01002369 par->flags &= ~LYD_DEFAULT;
2370 }
2371 }
Michal Vasko90932a92020-02-12 14:33:03 +01002372}
2373
2374/**
2375 * @brief Insert node before a sibling.
2376 *
Michal Vasko9f96a052020-03-10 09:41:45 +01002377 * Handles inserting into NP containers and key-less lists.
2378 *
Michal Vasko90932a92020-02-12 14:33:03 +01002379 * @param[in] sibling Sibling to insert before.
2380 * @param[in] node Node to insert.
2381 */
2382static void
Michal Vaskof03ed032020-03-04 13:31:44 +01002383lyd_insert_before_node(struct lyd_node *sibling, struct lyd_node *node)
Michal Vasko90932a92020-02-12 14:33:03 +01002384{
Michal Vasko0249f7c2020-03-05 16:36:40 +01002385 struct lyd_node_inner *par;
2386
Michal Vasko90932a92020-02-12 14:33:03 +01002387 assert(!node->next && (node->prev == node));
2388
2389 node->next = sibling;
2390 /* covers situation of sibling being first */
2391 node->prev = sibling->prev;
2392 sibling->prev = node;
2393 if (node->prev->next) {
2394 /* sibling had a preceding node */
2395 node->prev->next = node;
2396 } else if (sibling->parent) {
2397 /* sibling was first and we must also change parent child pointer */
2398 sibling->parent->child = node;
2399 }
2400 node->parent = sibling->parent;
Michal Vasko0249f7c2020-03-05 16:36:40 +01002401
Michal Vasko9f96a052020-03-10 09:41:45 +01002402 for (par = node->parent; par; par = par->parent) {
2403 if ((par->flags & LYD_DEFAULT) && !(node->flags & LYD_DEFAULT)) {
2404 /* remove default flags from NP containers */
Michal Vasko0249f7c2020-03-05 16:36:40 +01002405 par->flags &= ~LYD_DEFAULT;
2406 }
2407 }
Michal Vasko90932a92020-02-12 14:33:03 +01002408}
2409
2410/**
Michal Vaskob104f112020-07-17 09:54:54 +02002411 * @brief Insert node as the first and only child of a parent.
Michal Vasko90932a92020-02-12 14:33:03 +01002412 *
Michal Vasko9f96a052020-03-10 09:41:45 +01002413 * Handles inserting into NP containers and key-less lists.
2414 *
Michal Vasko90932a92020-02-12 14:33:03 +01002415 * @param[in] parent Parent to insert into.
2416 * @param[in] node Node to insert.
2417 */
2418static void
Michal Vaskob104f112020-07-17 09:54:54 +02002419lyd_insert_only_child(struct lyd_node *parent, struct lyd_node *node)
Michal Vasko90932a92020-02-12 14:33:03 +01002420{
2421 struct lyd_node_inner *par;
2422
Radek Krejcia1c1e542020-09-29 16:06:52 +02002423 assert(parent && !lyd_child(parent) && !node->next && (node->prev == node));
Michal Vasko52927e22020-03-16 17:26:14 +01002424 assert(!parent->schema || (parent->schema->nodetype & LYD_NODE_INNER));
Michal Vasko90932a92020-02-12 14:33:03 +01002425
2426 par = (struct lyd_node_inner *)parent;
2427
Michal Vaskob104f112020-07-17 09:54:54 +02002428 par->child = node;
Michal Vasko90932a92020-02-12 14:33:03 +01002429 node->parent = par;
Michal Vasko0249f7c2020-03-05 16:36:40 +01002430
Michal Vaskod989ba02020-08-24 10:59:24 +02002431 for ( ; par; par = par->parent) {
Michal Vasko9f96a052020-03-10 09:41:45 +01002432 if ((par->flags & LYD_DEFAULT) && !(node->flags & LYD_DEFAULT)) {
2433 /* remove default flags from NP containers */
Michal Vasko0249f7c2020-03-05 16:36:40 +01002434 par->flags &= ~LYD_DEFAULT;
2435 }
2436 }
Michal Vasko751cb4d2020-07-14 12:25:28 +02002437}
Michal Vasko0249f7c2020-03-05 16:36:40 +01002438
Michal Vasko751cb4d2020-07-14 12:25:28 +02002439/**
2440 * @brief Learn whether a list instance has all the keys.
2441 *
2442 * @param[in] list List instance to check.
2443 * @return non-zero if all the keys were found,
2444 * @return 0 otherwise.
2445 */
2446static int
2447lyd_insert_has_keys(const struct lyd_node *list)
2448{
2449 const struct lyd_node *key;
2450 const struct lysc_node *skey = NULL;
2451
2452 assert(list->schema->nodetype == LYS_LIST);
Radek Krejcia1c1e542020-09-29 16:06:52 +02002453 key = lyd_child(list);
Michal Vasko751cb4d2020-07-14 12:25:28 +02002454 while ((skey = lys_getnext(skey, list->schema, NULL, 0)) && (skey->flags & LYS_KEY)) {
2455 if (!key || (key->schema != skey)) {
2456 /* key missing */
2457 return 0;
2458 }
2459
2460 key = key->next;
2461 }
2462
2463 /* all keys found */
2464 return 1;
Michal Vasko90932a92020-02-12 14:33:03 +01002465}
2466
2467void
Michal Vaskob104f112020-07-17 09:54:54 +02002468lyd_insert_node(struct lyd_node *parent, struct lyd_node **first_sibling_p, struct lyd_node *node)
Michal Vasko90932a92020-02-12 14:33:03 +01002469{
Michal Vaskob104f112020-07-17 09:54:54 +02002470 struct lyd_node *anchor, *first_sibling;
Michal Vasko90932a92020-02-12 14:33:03 +01002471
Michal Vaskob104f112020-07-17 09:54:54 +02002472 /* inserting list without its keys is not supported */
2473 assert((parent || first_sibling_p) && node && (node->hash || !node->schema));
Michal Vaskof756c942020-11-06 17:21:37 +01002474 assert(!parent || !parent->schema ||
2475 (parent->schema->nodetype & (LYS_CONTAINER | LYS_LIST | LYS_RPC | LYS_ACTION | LYS_NOTIF)));
Michal Vasko9b368d32020-02-14 13:53:31 +01002476
Michal Vaskob104f112020-07-17 09:54:54 +02002477 if (!parent && first_sibling_p && (*first_sibling_p) && (*first_sibling_p)->parent) {
Michal Vasko9e685082021-01-29 14:49:09 +01002478 parent = lyd_parent(*first_sibling_p);
Michal Vasko9b368d32020-02-14 13:53:31 +01002479 }
Michal Vasko90932a92020-02-12 14:33:03 +01002480
Michal Vaskob104f112020-07-17 09:54:54 +02002481 /* get first sibling */
Michal Vasko9e685082021-01-29 14:49:09 +01002482 first_sibling = parent ? lyd_child(parent) : *first_sibling_p;
Michal Vasko9f96a052020-03-10 09:41:45 +01002483
Michal Vaskob104f112020-07-17 09:54:54 +02002484 /* find the anchor, our next node, so we can insert before it */
2485 anchor = lyd_insert_get_next_anchor(first_sibling, node);
2486 if (anchor) {
2487 lyd_insert_before_node(anchor, node);
Michal Vasko26123192020-11-09 21:02:34 +01002488 if (!parent && (*first_sibling_p == anchor)) {
2489 /* move first sibling */
2490 *first_sibling_p = node;
2491 }
Michal Vaskob104f112020-07-17 09:54:54 +02002492 } else if (first_sibling) {
2493 lyd_insert_after_node(first_sibling->prev, node);
2494 } else if (parent) {
2495 lyd_insert_only_child(parent, node);
Michal Vasko90932a92020-02-12 14:33:03 +01002496 } else {
Michal Vaskob104f112020-07-17 09:54:54 +02002497 *first_sibling_p = node;
2498 }
2499
2500 /* insert into parent HT */
2501 lyd_insert_hash(node);
2502
2503 /* finish hashes for our parent, if needed and possible */
Michal Vasko9e8de2d2020-09-01 08:17:10 +02002504 if (node->schema && (node->schema->flags & LYS_KEY) && parent && lyd_insert_has_keys(parent)) {
Michal Vaskob104f112020-07-17 09:54:54 +02002505 lyd_hash(parent);
2506
2507 /* now we can insert even the list into its parent HT */
2508 lyd_insert_hash(parent);
Michal Vasko90932a92020-02-12 14:33:03 +01002509 }
Michal Vasko90932a92020-02-12 14:33:03 +01002510}
2511
Michal Vasko717a4c32020-12-07 09:40:10 +01002512/**
2513 * @brief Check schema place of a node to be inserted.
2514 *
2515 * @param[in] parent Schema node of the parent data node.
2516 * @param[in] sibling Schema node of a sibling data node.
2517 * @param[in] schema Schema node if the data node to be inserted.
2518 * @return LY_SUCCESS on success.
2519 * @return LY_EINVAL if the place is invalid.
2520 */
Michal Vaskof03ed032020-03-04 13:31:44 +01002521static LY_ERR
Michal Vasko717a4c32020-12-07 09:40:10 +01002522lyd_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 +01002523{
2524 const struct lysc_node *par2;
2525
Michal Vasko62ed12d2020-05-21 10:08:25 +02002526 assert(!parent || !(parent->nodetype & (LYS_CASE | LYS_CHOICE)));
Michal Vasko717a4c32020-12-07 09:40:10 +01002527 assert(!sibling || !(sibling->nodetype & (LYS_CASE | LYS_CHOICE)));
2528 assert(!schema || !(schema->nodetype & (LYS_CASE | LYS_CHOICE)));
Michal Vaskof03ed032020-03-04 13:31:44 +01002529
Michal Vasko717a4c32020-12-07 09:40:10 +01002530 if (!schema || (!parent && !sibling)) {
Michal Vasko71e795e2020-12-04 16:27:37 +01002531 /* opaque nodes can be inserted wherever */
2532 return LY_SUCCESS;
2533 }
2534
Michal Vasko717a4c32020-12-07 09:40:10 +01002535 if (!parent) {
2536 parent = lysc_data_parent(sibling);
2537 }
2538
Michal Vaskof03ed032020-03-04 13:31:44 +01002539 /* find schema parent */
Michal Vasko62ed12d2020-05-21 10:08:25 +02002540 par2 = lysc_data_parent(schema);
Michal Vaskof03ed032020-03-04 13:31:44 +01002541
2542 if (parent) {
2543 /* inner node */
2544 if (par2 != parent) {
Michal Vaskob104f112020-07-17 09:54:54 +02002545 LOGERR(schema->module->ctx, LY_EINVAL, "Cannot insert, parent of \"%s\" is not \"%s\".", schema->name,
Michal Vasko69730152020-10-09 16:30:07 +02002546 parent->name);
Michal Vaskof03ed032020-03-04 13:31:44 +01002547 return LY_EINVAL;
2548 }
2549 } else {
2550 /* top-level node */
2551 if (par2) {
Radek Krejcif6d14cb2020-07-02 16:11:45 +02002552 LOGERR(schema->module->ctx, LY_EINVAL, "Cannot insert, node \"%s\" is not top-level.", schema->name);
Michal Vaskof03ed032020-03-04 13:31:44 +01002553 return LY_EINVAL;
2554 }
2555 }
2556
2557 return LY_SUCCESS;
2558}
2559
2560API LY_ERR
Michal Vaskob104f112020-07-17 09:54:54 +02002561lyd_insert_child(struct lyd_node *parent, struct lyd_node *node)
Michal Vaskof03ed032020-03-04 13:31:44 +01002562{
2563 struct lyd_node *iter;
2564
Michal Vasko0ab974d2021-02-24 13:18:26 +01002565 LY_CHECK_ARG_RET(NULL, parent, node, !parent->schema || (parent->schema->nodetype & LYD_NODE_INNER), LY_EINVAL);
Michal Vaskof03ed032020-03-04 13:31:44 +01002566
Michal Vasko717a4c32020-12-07 09:40:10 +01002567 LY_CHECK_RET(lyd_insert_check_schema(parent->schema, NULL, node->schema));
Michal Vaskof03ed032020-03-04 13:31:44 +01002568
Michal Vasko0ab974d2021-02-24 13:18:26 +01002569 if (node->schema && (node->schema->flags & LYS_KEY)) {
Michal Vaskof03ed032020-03-04 13:31:44 +01002570 LOGERR(parent->schema->module->ctx, LY_EINVAL, "Cannot insert key \"%s\".", node->schema->name);
2571 return LY_EINVAL;
2572 }
2573
2574 if (node->parent || node->prev->next) {
2575 lyd_unlink_tree(node);
2576 }
2577
2578 while (node) {
2579 iter = node->next;
2580 lyd_unlink_tree(node);
2581 lyd_insert_node(parent, NULL, node);
2582 node = iter;
2583 }
2584 return LY_SUCCESS;
2585}
2586
2587API LY_ERR
Michal Vaskob104f112020-07-17 09:54:54 +02002588lyd_insert_sibling(struct lyd_node *sibling, struct lyd_node *node, struct lyd_node **first)
Michal Vaskob1b5c262020-03-05 14:29:47 +01002589{
2590 struct lyd_node *iter;
2591
Michal Vaskob104f112020-07-17 09:54:54 +02002592 LY_CHECK_ARG_RET(NULL, node, LY_EINVAL);
Michal Vaskob1b5c262020-03-05 14:29:47 +01002593
Michal Vaskob104f112020-07-17 09:54:54 +02002594 if (sibling) {
Michal Vasko717a4c32020-12-07 09:40:10 +01002595 LY_CHECK_RET(lyd_insert_check_schema(NULL, sibling->schema, node->schema));
Michal Vaskob1b5c262020-03-05 14:29:47 +01002596 }
2597
Michal Vasko553d0b52020-12-04 16:27:52 +01002598 if (sibling == node) {
2599 /* we need to keep the connection to siblings so we can insert into them */
2600 sibling = sibling->prev;
2601 }
2602
Michal Vaskob1b5c262020-03-05 14:29:47 +01002603 if (node->parent || node->prev->next) {
2604 lyd_unlink_tree(node);
2605 }
2606
2607 while (node) {
Michal Vasko71e795e2020-12-04 16:27:37 +01002608 if (lysc_is_key(node->schema)) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02002609 LOGERR(LYD_CTX(node), LY_EINVAL, "Cannot insert key \"%s\".", node->schema->name);
Michal Vaskob104f112020-07-17 09:54:54 +02002610 return LY_EINVAL;
2611 }
2612
Michal Vaskob1b5c262020-03-05 14:29:47 +01002613 iter = node->next;
2614 lyd_unlink_tree(node);
2615 lyd_insert_node(NULL, &sibling, node);
2616 node = iter;
2617 }
Michal Vaskob1b5c262020-03-05 14:29:47 +01002618
Michal Vaskob104f112020-07-17 09:54:54 +02002619 if (first) {
2620 /* find the first sibling */
2621 *first = sibling;
2622 while ((*first)->prev->next) {
2623 *first = (*first)->prev;
Michal Vasko0249f7c2020-03-05 16:36:40 +01002624 }
2625 }
2626
2627 return LY_SUCCESS;
2628}
2629
Michal Vaskob1b5c262020-03-05 14:29:47 +01002630API LY_ERR
Michal Vaskof03ed032020-03-04 13:31:44 +01002631lyd_insert_before(struct lyd_node *sibling, struct lyd_node *node)
2632{
Michal Vaskof03ed032020-03-04 13:31:44 +01002633 LY_CHECK_ARG_RET(NULL, sibling, node, LY_EINVAL);
2634
Michal Vasko717a4c32020-12-07 09:40:10 +01002635 LY_CHECK_RET(lyd_insert_check_schema(NULL, sibling->schema, node->schema));
Michal Vaskof03ed032020-03-04 13:31:44 +01002636
Michal Vaskob104f112020-07-17 09:54:54 +02002637 if (!(node->schema->nodetype & (LYS_LIST | LYS_LEAFLIST)) || !(node->schema->flags & LYS_ORDBY_USER)) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02002638 LOGERR(LYD_CTX(sibling), LY_EINVAL, "Can be used only for user-ordered nodes.");
Michal Vaskof03ed032020-03-04 13:31:44 +01002639 return LY_EINVAL;
2640 }
2641
Michal Vasko4bc2ce32020-12-08 10:06:16 +01002642 lyd_unlink_tree(node);
2643 lyd_insert_before_node(sibling, node);
2644 lyd_insert_hash(node);
Michal Vaskof03ed032020-03-04 13:31:44 +01002645
Michal Vaskof03ed032020-03-04 13:31:44 +01002646 return LY_SUCCESS;
2647}
2648
2649API LY_ERR
2650lyd_insert_after(struct lyd_node *sibling, struct lyd_node *node)
2651{
Michal Vaskof03ed032020-03-04 13:31:44 +01002652 LY_CHECK_ARG_RET(NULL, sibling, node, LY_EINVAL);
2653
Michal Vasko717a4c32020-12-07 09:40:10 +01002654 LY_CHECK_RET(lyd_insert_check_schema(NULL, sibling->schema, node->schema));
Michal Vaskof03ed032020-03-04 13:31:44 +01002655
Michal Vaskob104f112020-07-17 09:54:54 +02002656 if (!(node->schema->nodetype & (LYS_LIST | LYS_LEAFLIST)) || !(node->schema->flags & LYS_ORDBY_USER)) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02002657 LOGERR(LYD_CTX(sibling), LY_EINVAL, "Can be used only for user-ordered nodes.");
Michal Vaskof03ed032020-03-04 13:31:44 +01002658 return LY_EINVAL;
2659 }
2660
Michal Vasko4bc2ce32020-12-08 10:06:16 +01002661 lyd_unlink_tree(node);
2662 lyd_insert_after_node(sibling, node);
2663 lyd_insert_hash(node);
Michal Vaskof03ed032020-03-04 13:31:44 +01002664
Michal Vaskof03ed032020-03-04 13:31:44 +01002665 return LY_SUCCESS;
2666}
2667
2668API void
2669lyd_unlink_tree(struct lyd_node *node)
2670{
2671 struct lyd_node *iter;
2672
2673 if (!node) {
2674 return;
2675 }
2676
Michal Vaskob104f112020-07-17 09:54:54 +02002677 /* update hashes while still linked into the tree */
2678 lyd_unlink_hash(node);
2679
Michal Vaskof03ed032020-03-04 13:31:44 +01002680 /* unlink from siblings */
2681 if (node->prev->next) {
2682 node->prev->next = node->next;
2683 }
2684 if (node->next) {
2685 node->next->prev = node->prev;
2686 } else {
2687 /* unlinking the last node */
2688 if (node->parent) {
2689 iter = node->parent->child;
2690 } else {
2691 iter = node->prev;
2692 while (iter->prev != node) {
2693 iter = iter->prev;
2694 }
2695 }
2696 /* update the "last" pointer from the first node */
2697 iter->prev = node->prev;
2698 }
2699
2700 /* unlink from parent */
2701 if (node->parent) {
2702 if (node->parent->child == node) {
2703 /* the node is the first child */
2704 node->parent->child = node->next;
2705 }
2706
Michal Vaskoab49dbe2020-07-17 12:32:47 +02002707 /* check for NP container whether its last non-default node is not being unlinked */
Michal Vasko69730152020-10-09 16:30:07 +02002708 if (node->parent->schema && (node->parent->schema->nodetype == LYS_CONTAINER) &&
2709 !(node->parent->flags & LYD_DEFAULT) && !(node->parent->schema->flags & LYS_PRESENCE)) {
Michal Vaskoab49dbe2020-07-17 12:32:47 +02002710 LY_LIST_FOR(node->parent->child, iter) {
2711 if ((iter != node) && !(iter->flags & LYD_DEFAULT)) {
2712 break;
2713 }
2714 }
2715 if (!iter) {
2716 node->parent->flags |= LYD_DEFAULT;
2717 }
2718 }
2719
Michal Vaskof03ed032020-03-04 13:31:44 +01002720 node->parent = NULL;
2721 }
2722
2723 node->next = NULL;
2724 node->prev = node;
2725}
2726
Michal Vaskoa5da3292020-08-12 13:10:50 +02002727void
Michal Vasko871a0252020-11-11 18:35:24 +01002728lyd_insert_meta(struct lyd_node *parent, struct lyd_meta *meta, ly_bool clear_dflt)
Radek Krejci1798aae2020-07-14 13:26:06 +02002729{
2730 struct lyd_meta *last, *iter;
2731
2732 assert(parent);
Michal Vaskoa5da3292020-08-12 13:10:50 +02002733
2734 if (!meta) {
2735 return;
2736 }
Radek Krejci1798aae2020-07-14 13:26:06 +02002737
2738 for (iter = meta; iter; iter = iter->next) {
2739 iter->parent = parent;
2740 }
2741
2742 /* insert as the last attribute */
2743 if (parent->meta) {
Radek Krejci1e008d22020-08-17 11:37:37 +02002744 for (last = parent->meta; last->next; last = last->next) {}
Radek Krejci1798aae2020-07-14 13:26:06 +02002745 last->next = meta;
2746 } else {
2747 parent->meta = meta;
2748 }
2749
2750 /* remove default flags from NP containers */
Michal Vasko871a0252020-11-11 18:35:24 +01002751 while (clear_dflt && parent && (parent->schema->nodetype == LYS_CONTAINER) && (parent->flags & LYD_DEFAULT)) {
Radek Krejci1798aae2020-07-14 13:26:06 +02002752 parent->flags &= ~LYD_DEFAULT;
Michal Vasko9e685082021-01-29 14:49:09 +01002753 parent = lyd_parent(parent);
Radek Krejci1798aae2020-07-14 13:26:06 +02002754 }
Radek Krejci1798aae2020-07-14 13:26:06 +02002755}
2756
2757LY_ERR
Michal Vasko9f96a052020-03-10 09:41:45 +01002758lyd_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 +02002759 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 +01002760 void *prefix_data, uint32_t hints, ly_bool clear_dflt, ly_bool *incomplete)
Michal Vasko90932a92020-02-12 14:33:03 +01002761{
Radek Krejci2efc45b2020-12-22 16:25:44 +01002762 LY_ERR ret = LY_SUCCESS;
Michal Vasko90932a92020-02-12 14:33:03 +01002763 struct lysc_ext_instance *ant = NULL;
Michal Vasko9f96a052020-03-10 09:41:45 +01002764 struct lyd_meta *mt, *last;
Michal Vaskofd69e1d2020-07-03 11:57:17 +02002765 LY_ARRAY_COUNT_TYPE u;
Michal Vasko90932a92020-02-12 14:33:03 +01002766
Michal Vasko9f96a052020-03-10 09:41:45 +01002767 assert((parent || meta) && mod);
Michal Vasko6f4cbb62020-02-28 11:15:47 +01002768
Radek Krejciddace2c2021-01-08 11:30:56 +01002769 LOG_LOCSET(parent ? parent->schema : NULL, parent, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +01002770
Radek Krejci7eb54ba2020-05-18 16:30:04 +02002771 LY_ARRAY_FOR(mod->compiled->exts, u) {
Radek Krejci3e6632f2021-03-22 22:08:21 +01002772 if ((mod->compiled->exts[u].def->plugin == lyplg_find(LYPLG_EXTENSION, LYEXT_PLUGIN_INTERNAL_ANNOTATION)) &&
Radek Krejci7eb54ba2020-05-18 16:30:04 +02002773 !ly_strncmp(mod->compiled->exts[u].argument, name, name_len)) {
Michal Vasko90932a92020-02-12 14:33:03 +01002774 /* we have the annotation definition */
Radek Krejci7eb54ba2020-05-18 16:30:04 +02002775 ant = &mod->compiled->exts[u];
Michal Vasko90932a92020-02-12 14:33:03 +01002776 break;
2777 }
2778 }
2779 if (!ant) {
2780 /* attribute is not defined as a metadata annotation (RFC 7952) */
Radek Krejci2efc45b2020-12-22 16:25:44 +01002781 LOGVAL(mod->ctx, LYVE_REFERENCE, "Annotation definition for attribute \"%s:%.*s\" not found.",
Radek Krejci422afb12021-03-04 16:38:16 +01002782 mod->name, (int)name_len, name);
Radek Krejci2efc45b2020-12-22 16:25:44 +01002783 ret = LY_EINVAL;
2784 goto cleanup;
Michal Vasko90932a92020-02-12 14:33:03 +01002785 }
2786
Michal Vasko9f96a052020-03-10 09:41:45 +01002787 mt = calloc(1, sizeof *mt);
Radek Krejci2efc45b2020-12-22 16:25:44 +01002788 LY_CHECK_ERR_GOTO(!mt, LOGMEM(mod->ctx); ret = LY_EMEM, cleanup);
Michal Vasko9f96a052020-03-10 09:41:45 +01002789 mt->parent = parent;
2790 mt->annotation = ant;
Radek Krejci1b2eef82021-02-17 11:17:27 +01002791 ret = lyd_value_store(mod->ctx, &mt->value, *(const struct lysc_type **)ant->substmts[ANNOTATION_SUBSTMT_TYPE].storage,
2792 value, value_len, dynamic, format, prefix_data, hints, parent ? parent->schema : NULL, incomplete);
Radek Krejci2efc45b2020-12-22 16:25:44 +01002793 LY_CHECK_ERR_GOTO(ret, free(mt), cleanup);
2794 ret = lydict_insert(mod->ctx, name, name_len, &mt->name);
2795 LY_CHECK_ERR_GOTO(ret, free(mt), cleanup);
Michal Vasko90932a92020-02-12 14:33:03 +01002796
Michal Vasko6f4cbb62020-02-28 11:15:47 +01002797 /* insert as the last attribute */
2798 if (parent) {
Michal Vasko871a0252020-11-11 18:35:24 +01002799 lyd_insert_meta(parent, mt, clear_dflt);
Michal Vasko9f96a052020-03-10 09:41:45 +01002800 } else if (*meta) {
Radek Krejci1e008d22020-08-17 11:37:37 +02002801 for (last = *meta; last->next; last = last->next) {}
Michal Vasko9f96a052020-03-10 09:41:45 +01002802 last->next = mt;
Michal Vasko90932a92020-02-12 14:33:03 +01002803 }
2804
Michal Vasko9f96a052020-03-10 09:41:45 +01002805 if (meta) {
2806 *meta = mt;
Michal Vasko90932a92020-02-12 14:33:03 +01002807 }
Radek Krejci2efc45b2020-12-22 16:25:44 +01002808
2809cleanup:
Radek Krejciddace2c2021-01-08 11:30:56 +01002810 LOG_LOCBACK((parent && parent->schema) ? 1 : 0, parent ? 1 : 0, 0, 0);
Radek Krejci2efc45b2020-12-22 16:25:44 +01002811 return ret;
Michal Vasko90932a92020-02-12 14:33:03 +01002812}
2813
Michal Vaskoa5da3292020-08-12 13:10:50 +02002814void
2815lyd_insert_attr(struct lyd_node *parent, struct lyd_attr *attr)
2816{
2817 struct lyd_attr *last, *iter;
2818 struct lyd_node_opaq *opaq;
2819
2820 assert(parent && !parent->schema);
2821
2822 if (!attr) {
2823 return;
2824 }
2825
2826 opaq = (struct lyd_node_opaq *)parent;
2827 for (iter = attr; iter; iter = iter->next) {
2828 iter->parent = opaq;
2829 }
2830
2831 /* insert as the last attribute */
2832 if (opaq->attr) {
Radek Krejci1e008d22020-08-17 11:37:37 +02002833 for (last = opaq->attr; last->next; last = last->next) {}
Michal Vaskoa5da3292020-08-12 13:10:50 +02002834 last->next = attr;
2835 } else {
2836 opaq->attr = attr;
2837 }
2838}
2839
Michal Vasko52927e22020-03-16 17:26:14 +01002840LY_ERR
Michal Vaskofeca4fb2020-10-05 08:58:40 +02002841lyd_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 +01002842 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 +02002843 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 +01002844{
Radek Krejci011e4aa2020-09-04 15:22:31 +02002845 LY_ERR ret = LY_SUCCESS;
Radek Krejci1798aae2020-07-14 13:26:06 +02002846 struct lyd_attr *at, *last;
Michal Vasko52927e22020-03-16 17:26:14 +01002847
2848 assert(ctx && (parent || attr) && (!parent || !parent->schema));
Michal Vaskofeca4fb2020-10-05 08:58:40 +02002849 assert(name && name_len && format);
Michal Vasko52927e22020-03-16 17:26:14 +01002850
2851 if (!value_len) {
2852 value = "";
2853 }
2854
2855 at = calloc(1, sizeof *at);
Michal Vasko6b5cb2a2020-11-11 19:11:21 +01002856 LY_CHECK_ERR_RET(!at, LOGMEM(ctx); ly_free_prefix_data(format, val_prefix_data), LY_EMEM);
Radek Krejcid46e46a2020-09-15 14:22:42 +02002857
Michal Vaskoad92b672020-11-12 13:11:31 +01002858 LY_CHECK_GOTO(ret = lydict_insert(ctx, name, name_len, &at->name.name), finish);
Michal Vasko501af032020-11-11 20:27:44 +01002859 if (prefix_len) {
Michal Vaskoad92b672020-11-12 13:11:31 +01002860 LY_CHECK_GOTO(ret = lydict_insert(ctx, prefix, prefix_len, &at->name.prefix), finish);
Michal Vasko501af032020-11-11 20:27:44 +01002861 }
2862 if (module_key_len) {
Michal Vaskoad92b672020-11-12 13:11:31 +01002863 LY_CHECK_GOTO(ret = lydict_insert(ctx, module_key, module_key_len, &at->name.module_ns), finish);
Michal Vasko501af032020-11-11 20:27:44 +01002864 }
2865
Michal Vasko52927e22020-03-16 17:26:14 +01002866 if (dynamic && *dynamic) {
Radek Krejci011e4aa2020-09-04 15:22:31 +02002867 ret = lydict_insert_zc(ctx, (char *)value, &at->value);
2868 LY_CHECK_GOTO(ret, finish);
Michal Vasko52927e22020-03-16 17:26:14 +01002869 *dynamic = 0;
2870 } else {
Radek Krejci011e4aa2020-09-04 15:22:31 +02002871 LY_CHECK_GOTO(ret = lydict_insert(ctx, value, value_len, &at->value), finish);
Michal Vasko52927e22020-03-16 17:26:14 +01002872 }
Michal Vasko501af032020-11-11 20:27:44 +01002873 at->format = format;
2874 at->val_prefix_data = val_prefix_data;
2875 at->hints = hints;
Michal Vasko52927e22020-03-16 17:26:14 +01002876
2877 /* insert as the last attribute */
2878 if (parent) {
Michal Vaskoa5da3292020-08-12 13:10:50 +02002879 lyd_insert_attr(parent, at);
Michal Vasko52927e22020-03-16 17:26:14 +01002880 } else if (*attr) {
Radek Krejci1e008d22020-08-17 11:37:37 +02002881 for (last = *attr; last->next; last = last->next) {}
Michal Vasko52927e22020-03-16 17:26:14 +01002882 last->next = at;
2883 }
2884
Radek Krejci011e4aa2020-09-04 15:22:31 +02002885finish:
2886 if (ret) {
2887 lyd_free_attr_single(ctx, at);
2888 } else if (attr) {
Michal Vasko52927e22020-03-16 17:26:14 +01002889 *attr = at;
2890 }
2891 return LY_SUCCESS;
2892}
2893
Radek Krejci084289f2019-07-09 17:35:30 +02002894API const struct lyd_node_term *
Michal Vasko004d3152020-06-11 19:59:22 +02002895lyd_target(const struct ly_path *path, const struct lyd_node *tree)
Radek Krejci084289f2019-07-09 17:35:30 +02002896{
Michal Vasko004d3152020-06-11 19:59:22 +02002897 struct lyd_node *target;
Radek Krejci084289f2019-07-09 17:35:30 +02002898
Michal Vasko004d3152020-06-11 19:59:22 +02002899 if (ly_path_eval(path, tree, &target)) {
2900 return NULL;
Radek Krejci084289f2019-07-09 17:35:30 +02002901 }
2902
Michal Vasko004d3152020-06-11 19:59:22 +02002903 return (struct lyd_node_term *)target;
Radek Krejci084289f2019-07-09 17:35:30 +02002904}
2905
aPiecek2f63f952021-03-30 12:22:18 +02002906/**
2907 * @brief Check the equality of the two schemas from different contexts.
2908 *
2909 * @param schema1 of first node.
2910 * @param schema2 of second node.
2911 * @return 1 if the schemas are equal otherwise 0.
2912 */
2913static ly_bool
2914lyd_compare_schema_equal(const struct lysc_node *schema1, const struct lysc_node *schema2)
2915{
2916 if (!schema1 && !schema2) {
2917 return 1;
2918 } else if (!schema1 || !schema2) {
2919 return 0;
2920 }
2921
2922 assert(schema1->module->ctx != schema2->module->ctx);
2923
2924 if (schema1->nodetype != schema2->nodetype) {
2925 return 0;
2926 }
2927
2928 if (strcmp(schema1->name, schema2->name)) {
2929 return 0;
2930 }
2931
2932 if (strcmp(schema1->module->name, schema2->module->name)) {
2933 return 0;
2934 }
2935
2936 if (schema1->module->revision || schema2->module->revision) {
2937 if (!schema1->module->revision || !schema2->module->revision) {
2938 return 0;
2939 }
2940 if (strcmp(schema1->module->revision, schema2->module->revision)) {
2941 return 0;
2942 }
2943 }
2944
2945 return 1;
2946}
2947
2948/**
2949 * @brief Check the equality of the schemas for all parent nodes.
2950 *
2951 * Both nodes must be from different contexts.
2952 *
2953 * @param node1 Data of first node.
2954 * @param node2 Data of second node.
2955 * @return 1 if the all related parental schemas are equal otherwise 0.
2956 */
2957static ly_bool
2958lyd_compare_schema_parents_equal(const struct lyd_node *node1, const struct lyd_node *node2)
2959{
2960 const struct lysc_node *parent1, *parent2;
2961
2962 assert(node1 && node2);
2963
2964 for (parent1 = node1->schema->parent, parent2 = node2->schema->parent;
2965 parent1 && parent2;
2966 parent1 = parent1->parent, parent2 = parent2->parent) {
2967 if (!lyd_compare_schema_equal(parent1, parent2)) {
2968 return 0;
2969 }
2970 }
2971
2972 if (parent1 || parent2) {
2973 return 0;
2974 }
2975
2976 return 1;
2977}
2978
2979/**
2980 * @brief Internal implementation of @ref lyd_compare_single.
2981 * @copydoc lyd_compare_single
2982 * @param[in] parental_schemas_checked Flag used for optimization.
2983 * When this function is called for the first time, the flag must be set to 0.
2984 * The @ref lyd_compare_schema_parents_equal should be called only once during
2985 * recursive calls, and this is accomplished by setting to 1 in the lyd_compare_single_ body.
2986 */
2987static LY_ERR
2988lyd_compare_single_(const struct lyd_node *node1, const struct lyd_node *node2,
2989 uint32_t options, ly_bool parental_schemas_checked)
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002990{
2991 const struct lyd_node *iter1, *iter2;
2992 struct lyd_node_term *term1, *term2;
2993 struct lyd_node_any *any1, *any2;
Michal Vasko52927e22020-03-16 17:26:14 +01002994 struct lyd_node_opaq *opaq1, *opaq2;
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002995 size_t len1, len2;
Radek Krejci084289f2019-07-09 17:35:30 +02002996
Radek Krejci1f05b6a2019-07-18 16:15:06 +02002997 if (!node1 || !node2) {
2998 if (node1 == node2) {
2999 return LY_SUCCESS;
3000 } else {
3001 return LY_ENOT;
3002 }
3003 }
3004
aPiecek2f63f952021-03-30 12:22:18 +02003005 if (LYD_CTX(node1) == LYD_CTX(node2)) {
3006 /* same contexts */
3007 if (node1->schema != node2->schema) {
3008 return LY_ENOT;
3009 }
3010 } else {
3011 /* different contexts */
3012 if (!lyd_compare_schema_equal(node1->schema, node2->schema)) {
3013 return LY_ENOT;
3014 }
3015 if (!parental_schemas_checked) {
3016 if (!lyd_compare_schema_parents_equal(node1, node2)) {
3017 return LY_ENOT;
3018 }
3019 parental_schemas_checked = 1;
3020 }
Radek Krejci1f05b6a2019-07-18 16:15:06 +02003021 }
3022
3023 if (node1->hash != node2->hash) {
3024 return LY_ENOT;
3025 }
aPiecek2f63f952021-03-30 12:22:18 +02003026 /* 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 +02003027
Michal Vasko52927e22020-03-16 17:26:14 +01003028 if (!node1->schema) {
3029 opaq1 = (struct lyd_node_opaq *)node1;
3030 opaq2 = (struct lyd_node_opaq *)node2;
aPiecek2f63f952021-03-30 12:22:18 +02003031 if ((strcmp(opaq1->name.name, opaq2->name.name)) || (opaq1->format != opaq2->format) ||
3032 (strcmp(opaq1->name.module_ns, opaq2->name.module_ns))) {
Radek Krejci1f05b6a2019-07-18 16:15:06 +02003033 return LY_ENOT;
3034 }
Michal Vasko52927e22020-03-16 17:26:14 +01003035 switch (opaq1->format) {
Radek Krejci8df109d2021-04-23 12:19:08 +02003036 case LY_VALUE_XML:
Radek Krejci09c77442021-04-26 11:10:34 +02003037 if (lyxml_value_compare(LYD_CTX(node1), opaq1->value, opaq1->val_prefix_data, LYD_CTX(node2), opaq2->value,
3038 opaq2->val_prefix_data)) {
Michal Vasko52927e22020-03-16 17:26:14 +01003039 return LY_ENOT;
3040 }
3041 break;
Radek Krejci8df109d2021-04-23 12:19:08 +02003042 case LY_VALUE_JSON:
Radek Krejci1798aae2020-07-14 13:26:06 +02003043 /* prefixes in JSON are unique, so it is not necessary to canonize the values */
3044 if (strcmp(opaq1->value, opaq2->value)) {
3045 return LY_ENOT;
3046 }
3047 break;
Michal Vasko6b5cb2a2020-11-11 19:11:21 +01003048 default:
Michal Vasko52927e22020-03-16 17:26:14 +01003049 /* not allowed */
Michal Vaskob7be7a82020-08-20 09:09:04 +02003050 LOGINT(LYD_CTX(node1));
Michal Vasko52927e22020-03-16 17:26:14 +01003051 return LY_EINT;
3052 }
3053 if (options & LYD_COMPARE_FULL_RECURSION) {
3054 iter1 = opaq1->child;
3055 iter2 = opaq2->child;
Radek Krejci1f05b6a2019-07-18 16:15:06 +02003056 goto all_children_compare;
Michal Vasko52927e22020-03-16 17:26:14 +01003057 }
3058 return LY_SUCCESS;
3059 } else {
3060 switch (node1->schema->nodetype) {
3061 case LYS_LEAF:
3062 case LYS_LEAFLIST:
3063 if (options & LYD_COMPARE_DEFAULTS) {
3064 if ((node1->flags & LYD_DEFAULT) != (node2->flags & LYD_DEFAULT)) {
3065 return LY_ENOT;
3066 }
3067 }
3068
Michal Vasko1a2bf2e2020-06-16 13:07:48 +02003069 term1 = (struct lyd_node_term *)node1;
3070 term2 = (struct lyd_node_term *)node2;
aPiecek2f63f952021-03-30 12:22:18 +02003071
3072 /* same contexts */
3073 if (LYD_CTX(node1) == LYD_CTX(node2)) {
3074 return term1->value.realtype->plugin->compare(&term1->value, &term2->value);
3075 }
3076
3077 /* different contexts */
Radek Krejci6d5ba0c2021-04-26 07:49:59 +02003078 if (strcmp(lyd_get_value(node1), lyd_get_value(node2))) {
aPiecek2f63f952021-03-30 12:22:18 +02003079 return LY_ENOT;
3080 }
3081 return LY_SUCCESS;
Michal Vasko52927e22020-03-16 17:26:14 +01003082 case LYS_CONTAINER:
3083 if (options & LYD_COMPARE_DEFAULTS) {
3084 if ((node1->flags & LYD_DEFAULT) != (node2->flags & LYD_DEFAULT)) {
3085 return LY_ENOT;
3086 }
3087 }
3088 if (options & LYD_COMPARE_FULL_RECURSION) {
Michal Vasko9e685082021-01-29 14:49:09 +01003089 iter1 = lyd_child(node1);
3090 iter2 = lyd_child(node2);
Michal Vasko52927e22020-03-16 17:26:14 +01003091 goto all_children_compare;
Radek Krejci1f05b6a2019-07-18 16:15:06 +02003092 }
3093 return LY_SUCCESS;
Michal Vasko1bf09392020-03-27 12:38:10 +01003094 case LYS_RPC:
Michal Vasko52927e22020-03-16 17:26:14 +01003095 case LYS_ACTION:
3096 if (options & LYD_COMPARE_FULL_RECURSION) {
3097 /* TODO action/RPC
3098 goto all_children_compare;
3099 */
Radek Krejci1f05b6a2019-07-18 16:15:06 +02003100 }
3101 return LY_SUCCESS;
Michal Vasko52927e22020-03-16 17:26:14 +01003102 case LYS_NOTIF:
3103 if (options & LYD_COMPARE_FULL_RECURSION) {
3104 /* TODO Notification
3105 goto all_children_compare;
3106 */
3107 }
3108 return LY_SUCCESS;
3109 case LYS_LIST:
Michal Vasko9e685082021-01-29 14:49:09 +01003110 iter1 = lyd_child(node1);
3111 iter2 = lyd_child(node2);
Michal Vasko52927e22020-03-16 17:26:14 +01003112
3113 if (!(node1->schema->flags & LYS_KEYLESS) && !(options & LYD_COMPARE_FULL_RECURSION)) {
3114 /* lists with keys, their equivalence is based on their keys */
Michal Vasko544e58a2021-01-28 14:33:41 +01003115 for (const struct lysc_node *key = lysc_node_child(node1->schema);
Michal Vaskoc57d9a92020-06-23 13:28:27 +02003116 key && (key->flags & LYS_KEY);
Michal Vasko52927e22020-03-16 17:26:14 +01003117 key = key->next) {
aPiecek2f63f952021-03-30 12:22:18 +02003118 if (lyd_compare_single_(iter1, iter2, options, parental_schemas_checked)) {
Michal Vasko52927e22020-03-16 17:26:14 +01003119 return LY_ENOT;
3120 }
3121 iter1 = iter1->next;
3122 iter2 = iter2->next;
3123 }
3124 } else {
3125 /* lists without keys, their equivalence is based on equivalence of all the children (both direct and indirect) */
3126
Radek Krejci0f969882020-08-21 16:56:47 +02003127all_children_compare:
Michal Vasko52927e22020-03-16 17:26:14 +01003128 if (!iter1 && !iter2) {
3129 /* no children, nothing to compare */
3130 return LY_SUCCESS;
3131 }
3132
Michal Vaskod989ba02020-08-24 10:59:24 +02003133 for ( ; iter1 && iter2; iter1 = iter1->next, iter2 = iter2->next) {
aPiecek2f63f952021-03-30 12:22:18 +02003134 if (lyd_compare_single_(iter1, iter2, options | LYD_COMPARE_FULL_RECURSION, parental_schemas_checked)) {
Michal Vasko52927e22020-03-16 17:26:14 +01003135 return LY_ENOT;
3136 }
3137 }
3138 if (iter1 || iter2) {
3139 return LY_ENOT;
3140 }
3141 }
3142 return LY_SUCCESS;
3143 case LYS_ANYXML:
3144 case LYS_ANYDATA:
Michal Vasko22df3f02020-08-24 13:29:22 +02003145 any1 = (struct lyd_node_any *)node1;
3146 any2 = (struct lyd_node_any *)node2;
Michal Vasko52927e22020-03-16 17:26:14 +01003147
3148 if (any1->value_type != any2->value_type) {
3149 return LY_ENOT;
3150 }
3151 switch (any1->value_type) {
3152 case LYD_ANYDATA_DATATREE:
3153 iter1 = any1->value.tree;
3154 iter2 = any2->value.tree;
3155 goto all_children_compare;
3156 case LYD_ANYDATA_STRING:
3157 case LYD_ANYDATA_XML:
3158 case LYD_ANYDATA_JSON:
3159 len1 = strlen(any1->value.str);
3160 len2 = strlen(any2->value.str);
Michal Vasko69730152020-10-09 16:30:07 +02003161 if ((len1 != len2) || strcmp(any1->value.str, any2->value.str)) {
Michal Vasko52927e22020-03-16 17:26:14 +01003162 return LY_ENOT;
3163 }
3164 return LY_SUCCESS;
Michal Vasko52927e22020-03-16 17:26:14 +01003165 case LYD_ANYDATA_LYB:
Michal Vasko60ea6352020-06-29 13:39:39 +02003166 len1 = lyd_lyb_data_length(any1->value.mem);
3167 len2 = lyd_lyb_data_length(any2->value.mem);
Michal Vasko69730152020-10-09 16:30:07 +02003168 if ((len1 != len2) || memcmp(any1->value.mem, any2->value.mem, len1)) {
Michal Vasko52927e22020-03-16 17:26:14 +01003169 return LY_ENOT;
3170 }
3171 return LY_SUCCESS;
Michal Vasko52927e22020-03-16 17:26:14 +01003172 }
Radek Krejci1f05b6a2019-07-18 16:15:06 +02003173 }
3174 }
3175
Michal Vaskob7be7a82020-08-20 09:09:04 +02003176 LOGINT(LYD_CTX(node1));
Radek Krejci1f05b6a2019-07-18 16:15:06 +02003177 return LY_EINT;
3178}
Radek Krejci22ebdba2019-07-25 13:59:43 +02003179
Michal Vasko21725742020-06-29 11:49:25 +02003180API LY_ERR
aPiecek2f63f952021-03-30 12:22:18 +02003181lyd_compare_single(const struct lyd_node *node1, const struct lyd_node *node2, uint32_t options)
3182{
3183 return lyd_compare_single_(node1, node2, options, 0);
3184}
3185
3186API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02003187lyd_compare_siblings(const struct lyd_node *node1, const struct lyd_node *node2, uint32_t options)
Michal Vasko8f359bf2020-07-28 10:41:15 +02003188{
Michal Vaskod989ba02020-08-24 10:59:24 +02003189 for ( ; node1 && node2; node1 = node1->next, node2 = node2->next) {
Michal Vasko8f359bf2020-07-28 10:41:15 +02003190 LY_CHECK_RET(lyd_compare_single(node1, node2, options));
3191 }
3192
Michal Vasko11a81432020-07-28 16:31:29 +02003193 if (node1 == node2) {
3194 return LY_SUCCESS;
Michal Vasko8f359bf2020-07-28 10:41:15 +02003195 }
Michal Vasko11a81432020-07-28 16:31:29 +02003196 return LY_ENOT;
Michal Vasko8f359bf2020-07-28 10:41:15 +02003197}
3198
3199API LY_ERR
Michal Vasko21725742020-06-29 11:49:25 +02003200lyd_compare_meta(const struct lyd_meta *meta1, const struct lyd_meta *meta2)
3201{
3202 if (!meta1 || !meta2) {
3203 if (meta1 == meta2) {
3204 return LY_SUCCESS;
3205 } else {
3206 return LY_ENOT;
3207 }
3208 }
3209
Michal Vaskoa8083062020-11-06 17:22:10 +01003210 if ((meta1->annotation->module->ctx != meta2->annotation->module->ctx) || (meta1->annotation != meta2->annotation)) {
Michal Vasko21725742020-06-29 11:49:25 +02003211 return LY_ENOT;
3212 }
3213
Michal Vasko21725742020-06-29 11:49:25 +02003214 return meta1->value.realtype->plugin->compare(&meta1->value, &meta2->value);
3215}
3216
Radek Krejci22ebdba2019-07-25 13:59:43 +02003217/**
Michal Vasko52927e22020-03-16 17:26:14 +01003218 * @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 +02003219 *
3220 * 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 +02003221 *
3222 * @param[in] node Original node to duplicate
3223 * @param[in] parent Parent to insert into, NULL for top-level sibling.
3224 * @param[in,out] first First sibling, NULL if no top-level sibling exist yet. Can be also NULL if @p parent is set.
3225 * @param[in] options Bitmask of options flags, see @ref dupoptions.
3226 * @param[out] dup_p Pointer where the created duplicated node is placed (besides connecting it int @p parent / @p first sibling).
3227 * @return LY_ERR value
Radek Krejci22ebdba2019-07-25 13:59:43 +02003228 */
Michal Vasko52927e22020-03-16 17:26:14 +01003229static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02003230lyd_dup_r(const struct lyd_node *node, struct lyd_node *parent, struct lyd_node **first, uint32_t options,
Radek Krejci0f969882020-08-21 16:56:47 +02003231 struct lyd_node **dup_p)
Radek Krejci22ebdba2019-07-25 13:59:43 +02003232{
Michal Vasko52927e22020-03-16 17:26:14 +01003233 LY_ERR ret;
Radek Krejci22ebdba2019-07-25 13:59:43 +02003234 struct lyd_node *dup = NULL;
Michal Vasko61551fa2020-07-09 15:45:45 +02003235 struct lyd_meta *meta;
3236 struct lyd_node_any *any;
Radek Krejci22ebdba2019-07-25 13:59:43 +02003237
Michal Vasko52927e22020-03-16 17:26:14 +01003238 LY_CHECK_ARG_RET(NULL, node, LY_EINVAL);
Radek Krejci22ebdba2019-07-25 13:59:43 +02003239
Michal Vasko52927e22020-03-16 17:26:14 +01003240 if (!node->schema) {
3241 dup = calloc(1, sizeof(struct lyd_node_opaq));
3242 } else {
3243 switch (node->schema->nodetype) {
Michal Vasko1bf09392020-03-27 12:38:10 +01003244 case LYS_RPC:
Michal Vasko52927e22020-03-16 17:26:14 +01003245 case LYS_ACTION:
3246 case LYS_NOTIF:
3247 case LYS_CONTAINER:
3248 case LYS_LIST:
3249 dup = calloc(1, sizeof(struct lyd_node_inner));
3250 break;
3251 case LYS_LEAF:
3252 case LYS_LEAFLIST:
3253 dup = calloc(1, sizeof(struct lyd_node_term));
3254 break;
3255 case LYS_ANYDATA:
3256 case LYS_ANYXML:
3257 dup = calloc(1, sizeof(struct lyd_node_any));
3258 break;
3259 default:
Michal Vaskob7be7a82020-08-20 09:09:04 +02003260 LOGINT(LYD_CTX(node));
Michal Vasko52927e22020-03-16 17:26:14 +01003261 ret = LY_EINT;
3262 goto error;
3263 }
Radek Krejci22ebdba2019-07-25 13:59:43 +02003264 }
Michal Vaskob7be7a82020-08-20 09:09:04 +02003265 LY_CHECK_ERR_GOTO(!dup, LOGMEM(LYD_CTX(node)); ret = LY_EMEM, error);
Radek Krejci22ebdba2019-07-25 13:59:43 +02003266
Michal Vaskof6df0a02020-06-16 13:08:34 +02003267 if (options & LYD_DUP_WITH_FLAGS) {
3268 dup->flags = node->flags;
3269 } else {
3270 dup->flags = (node->flags & LYD_DEFAULT) | LYD_NEW;
3271 }
Radek Krejci22ebdba2019-07-25 13:59:43 +02003272 dup->schema = node->schema;
Michal Vasko52927e22020-03-16 17:26:14 +01003273 dup->prev = dup;
Radek Krejci22ebdba2019-07-25 13:59:43 +02003274
Michal Vasko25a32822020-07-09 15:48:22 +02003275 /* duplicate metadata */
3276 if (!(options & LYD_DUP_NO_META)) {
3277 LY_LIST_FOR(node->meta, meta) {
Michal Vasko3a41dff2020-07-15 14:30:28 +02003278 LY_CHECK_GOTO(ret = lyd_dup_meta_single(meta, dup, NULL), error);
Michal Vasko25a32822020-07-09 15:48:22 +02003279 }
3280 }
Radek Krejci22ebdba2019-07-25 13:59:43 +02003281
3282 /* nodetype-specific work */
Michal Vasko52927e22020-03-16 17:26:14 +01003283 if (!dup->schema) {
3284 struct lyd_node_opaq *opaq = (struct lyd_node_opaq *)dup;
3285 struct lyd_node_opaq *orig = (struct lyd_node_opaq *)node;
3286 struct lyd_node *child;
Radek Krejci22ebdba2019-07-25 13:59:43 +02003287
3288 if (options & LYD_DUP_RECURSIVE) {
3289 /* duplicate all the children */
3290 LY_LIST_FOR(orig->child, child) {
Michal Vasko3a41dff2020-07-15 14:30:28 +02003291 LY_CHECK_GOTO(ret = lyd_dup_r(child, dup, NULL, options, NULL), error);
Michal Vasko52927e22020-03-16 17:26:14 +01003292 }
3293 }
Michal Vaskoad92b672020-11-12 13:11:31 +01003294 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), orig->name.name, 0, &opaq->name.name), error);
Michal Vasko52927e22020-03-16 17:26:14 +01003295 opaq->format = orig->format;
Michal Vaskoad92b672020-11-12 13:11:31 +01003296 if (orig->name.prefix) {
3297 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), orig->name.prefix, 0, &opaq->name.prefix), error);
Michal Vasko52927e22020-03-16 17:26:14 +01003298 }
Michal Vaskoad92b672020-11-12 13:11:31 +01003299 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), orig->name.module_ns, 0, &opaq->name.module_ns), error);
Michal Vasko6b5cb2a2020-11-11 19:11:21 +01003300 if (orig->val_prefix_data) {
3301 ret = ly_dup_prefix_data(LYD_CTX(node), opaq->format, orig->val_prefix_data, &opaq->val_prefix_data);
3302 LY_CHECK_GOTO(ret, error);
Michal Vasko52927e22020-03-16 17:26:14 +01003303 }
Radek Krejci011e4aa2020-09-04 15:22:31 +02003304 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), orig->value, 0, &opaq->value), error);
Michal Vasko52927e22020-03-16 17:26:14 +01003305 opaq->ctx = orig->ctx;
3306 } else if (dup->schema->nodetype & LYD_NODE_TERM) {
3307 struct lyd_node_term *term = (struct lyd_node_term *)dup;
3308 struct lyd_node_term *orig = (struct lyd_node_term *)node;
3309
3310 term->hash = orig->hash;
Michal Vaskob7be7a82020-08-20 09:09:04 +02003311 LY_CHECK_ERR_GOTO(orig->value.realtype->plugin->duplicate(LYD_CTX(node), &orig->value, &term->value),
Michal Vasko69730152020-10-09 16:30:07 +02003312 LOGERR(LYD_CTX(node), LY_EINT, "Value duplication failed."); ret = LY_EINT, error);
Michal Vasko52927e22020-03-16 17:26:14 +01003313 } else if (dup->schema->nodetype & LYD_NODE_INNER) {
3314 struct lyd_node_inner *orig = (struct lyd_node_inner *)node;
3315 struct lyd_node *child;
3316
3317 if (options & LYD_DUP_RECURSIVE) {
3318 /* duplicate all the children */
3319 LY_LIST_FOR(orig->child, child) {
Michal Vasko3a41dff2020-07-15 14:30:28 +02003320 LY_CHECK_GOTO(ret = lyd_dup_r(child, dup, NULL, options, NULL), error);
Radek Krejci22ebdba2019-07-25 13:59:43 +02003321 }
Michal Vasko69730152020-10-09 16:30:07 +02003322 } else if ((dup->schema->nodetype == LYS_LIST) && !(dup->schema->flags & LYS_KEYLESS)) {
Radek Krejci22ebdba2019-07-25 13:59:43 +02003323 /* always duplicate keys of a list */
Radek Krejci22ebdba2019-07-25 13:59:43 +02003324 child = orig->child;
Michal Vasko544e58a2021-01-28 14:33:41 +01003325 for (const struct lysc_node *key = lysc_node_child(dup->schema);
Michal Vaskoc57d9a92020-06-23 13:28:27 +02003326 key && (key->flags & LYS_KEY);
Radek Krejci0fe9b512019-07-26 17:51:05 +02003327 key = key->next) {
Radek Krejci22ebdba2019-07-25 13:59:43 +02003328 if (!child) {
3329 /* possibly not keys are present in filtered tree */
3330 break;
Radek Krejci0fe9b512019-07-26 17:51:05 +02003331 } else if (child->schema != key) {
3332 /* possibly not all keys are present in filtered tree,
3333 * but there can be also some non-key nodes */
3334 continue;
Radek Krejci22ebdba2019-07-25 13:59:43 +02003335 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02003336 LY_CHECK_GOTO(ret = lyd_dup_r(child, dup, NULL, options, NULL), error);
Radek Krejci22ebdba2019-07-25 13:59:43 +02003337 child = child->next;
3338 }
3339 }
3340 lyd_hash(dup);
3341 } else if (dup->schema->nodetype & LYD_NODE_ANY) {
Michal Vasko61551fa2020-07-09 15:45:45 +02003342 dup->hash = node->hash;
3343 any = (struct lyd_node_any *)node;
3344 LY_CHECK_GOTO(ret = lyd_any_copy_value(dup, &any->value, any->value_type), error);
Radek Krejci22ebdba2019-07-25 13:59:43 +02003345 }
3346
Michal Vasko52927e22020-03-16 17:26:14 +01003347 /* insert */
3348 lyd_insert_node(parent, first, dup);
Michal Vasko52927e22020-03-16 17:26:14 +01003349
3350 if (dup_p) {
3351 *dup_p = dup;
3352 }
3353 return LY_SUCCESS;
Radek Krejci22ebdba2019-07-25 13:59:43 +02003354
3355error:
Michal Vasko52927e22020-03-16 17:26:14 +01003356 lyd_free_tree(dup);
3357 return ret;
Radek Krejci22ebdba2019-07-25 13:59:43 +02003358}
3359
Michal Vasko3a41dff2020-07-15 14:30:28 +02003360static LY_ERR
Michal Vasko20909752021-05-18 16:13:38 +02003361lyd_dup_get_local_parent(const struct lyd_node *node, const struct lyd_node_inner *parent, uint32_t options,
3362 struct lyd_node **dup_parent, struct lyd_node_inner **local_parent)
Radek Krejci22ebdba2019-07-25 13:59:43 +02003363{
Michal Vasko3a41dff2020-07-15 14:30:28 +02003364 const struct lyd_node_inner *orig_parent, *iter;
Radek Krejci857189e2020-09-01 13:26:36 +02003365 ly_bool repeat = 1;
Michal Vasko3a41dff2020-07-15 14:30:28 +02003366
3367 *dup_parent = NULL;
3368 *local_parent = NULL;
3369
3370 for (orig_parent = node->parent; repeat && orig_parent; orig_parent = orig_parent->parent) {
3371 if (parent && (parent->schema == orig_parent->schema)) {
3372 /* stop creating parents, connect what we have into the provided parent */
3373 iter = parent;
3374 repeat = 0;
3375 } else {
3376 iter = NULL;
Michal Vasko20909752021-05-18 16:13:38 +02003377 LY_CHECK_RET(lyd_dup_r((struct lyd_node *)orig_parent, NULL, (struct lyd_node **)&iter, options,
Radek Krejci0f969882020-08-21 16:56:47 +02003378 (struct lyd_node **)&iter));
Michal Vasko3a41dff2020-07-15 14:30:28 +02003379 }
3380 if (!*local_parent) {
3381 *local_parent = (struct lyd_node_inner *)iter;
3382 }
3383 if (iter->child) {
3384 /* 1) list - add after keys
3385 * 2) provided parent with some children */
3386 iter->child->prev->next = *dup_parent;
3387 if (*dup_parent) {
3388 (*dup_parent)->prev = iter->child->prev;
3389 iter->child->prev = *dup_parent;
3390 }
3391 } else {
3392 ((struct lyd_node_inner *)iter)->child = *dup_parent;
3393 }
3394 if (*dup_parent) {
3395 (*dup_parent)->parent = (struct lyd_node_inner *)iter;
3396 }
3397 *dup_parent = (struct lyd_node *)iter;
3398 }
3399
3400 if (repeat && parent) {
3401 /* given parent and created parents chain actually do not interconnect */
Michal Vaskob7be7a82020-08-20 09:09:04 +02003402 LOGERR(LYD_CTX(node), LY_EINVAL,
Michal Vasko69730152020-10-09 16:30:07 +02003403 "Invalid argument parent (%s()) - does not interconnect with the created node's parents chain.", __func__);
Michal Vasko3a41dff2020-07-15 14:30:28 +02003404 return LY_EINVAL;
3405 }
3406
3407 return LY_SUCCESS;
3408}
3409
3410static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02003411lyd_dup(const struct lyd_node *node, struct lyd_node_inner *parent, uint32_t options, ly_bool nosiblings, struct lyd_node **dup)
Michal Vasko3a41dff2020-07-15 14:30:28 +02003412{
3413 LY_ERR rc;
Radek Krejci22ebdba2019-07-25 13:59:43 +02003414 const struct lyd_node *orig; /* original node to be duplicated */
3415 struct lyd_node *first = NULL; /* the first duplicated node, this is returned */
Radek Krejci22ebdba2019-07-25 13:59:43 +02003416 struct lyd_node *top = NULL; /* the most higher created node */
3417 struct lyd_node_inner *local_parent = NULL; /* the direct parent node for the duplicated node(s) */
Radek Krejci22ebdba2019-07-25 13:59:43 +02003418
Michal Vasko3a41dff2020-07-15 14:30:28 +02003419 LY_CHECK_ARG_RET(NULL, node, LY_EINVAL);
Radek Krejci22ebdba2019-07-25 13:59:43 +02003420
3421 if (options & LYD_DUP_WITH_PARENTS) {
Michal Vasko20909752021-05-18 16:13:38 +02003422 LY_CHECK_GOTO(rc = lyd_dup_get_local_parent(node, parent, options & (LYD_DUP_WITH_FLAGS | LYD_DUP_NO_META),
3423 &top, &local_parent), error);
Radek Krejci22ebdba2019-07-25 13:59:43 +02003424 } else {
3425 local_parent = parent;
3426 }
3427
Radek Krejci22ebdba2019-07-25 13:59:43 +02003428 LY_LIST_FOR(node, orig) {
Michal Vasko35f4d772021-01-12 12:08:57 +01003429 if (lysc_is_key(orig->schema)) {
3430 if (local_parent) {
3431 /* the key must already exist in the parent */
3432 rc = lyd_find_sibling_schema(local_parent->child, orig->schema, first ? NULL : &first);
3433 LY_CHECK_ERR_GOTO(rc, LOGINT(LYD_CTX(node)), error);
3434 } else {
3435 assert(!(options & LYD_DUP_WITH_PARENTS));
3436 /* duplicating a single key, okay, I suppose... */
3437 rc = lyd_dup_r(orig, NULL, &first, options, first ? NULL : &first);
3438 LY_CHECK_GOTO(rc, error);
3439 }
3440 } else {
3441 /* if there is no local parent, it will be inserted into first */
Michal Vasko9e685082021-01-29 14:49:09 +01003442 rc = lyd_dup_r(orig, &local_parent->node, &first, options, first ? NULL : &first);
Michal Vasko35f4d772021-01-12 12:08:57 +01003443 LY_CHECK_GOTO(rc, error);
3444 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02003445 if (nosiblings) {
Radek Krejci22ebdba2019-07-25 13:59:43 +02003446 break;
3447 }
3448 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02003449
Michal Vasko3a41dff2020-07-15 14:30:28 +02003450 if (dup) {
3451 *dup = first;
3452 }
3453 return LY_SUCCESS;
Radek Krejci22ebdba2019-07-25 13:59:43 +02003454
3455error:
3456 if (top) {
3457 lyd_free_tree(top);
3458 } else {
Michal Vaskof03ed032020-03-04 13:31:44 +01003459 lyd_free_siblings(first);
Radek Krejci22ebdba2019-07-25 13:59:43 +02003460 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02003461 return rc;
Radek Krejci22ebdba2019-07-25 13:59:43 +02003462}
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003463
Michal Vasko3a41dff2020-07-15 14:30:28 +02003464API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02003465lyd_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 +02003466{
3467 return lyd_dup(node, parent, options, 1, dup);
3468}
3469
3470API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02003471lyd_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 +02003472{
3473 return lyd_dup(node, parent, options, 0, dup);
3474}
3475
3476API LY_ERR
3477lyd_dup_meta_single(const struct lyd_meta *meta, struct lyd_node *node, struct lyd_meta **dup)
Michal Vasko25a32822020-07-09 15:48:22 +02003478{
Radek Krejci011e4aa2020-09-04 15:22:31 +02003479 LY_ERR ret = LY_SUCCESS;
Michal Vasko25a32822020-07-09 15:48:22 +02003480 struct lyd_meta *mt, *last;
3481
Michal Vasko3a41dff2020-07-15 14:30:28 +02003482 LY_CHECK_ARG_RET(NULL, meta, node, LY_EINVAL);
Michal Vasko25a32822020-07-09 15:48:22 +02003483
3484 /* create a copy */
3485 mt = calloc(1, sizeof *mt);
Michal Vaskob7be7a82020-08-20 09:09:04 +02003486 LY_CHECK_ERR_RET(!mt, LOGMEM(LYD_CTX(node)), LY_EMEM);
Michal Vasko25a32822020-07-09 15:48:22 +02003487 mt->annotation = meta->annotation;
Michal Vaskob7be7a82020-08-20 09:09:04 +02003488 ret = meta->value.realtype->plugin->duplicate(LYD_CTX(node), &meta->value, &mt->value);
Radek Krejci011e4aa2020-09-04 15:22:31 +02003489 LY_CHECK_ERR_GOTO(ret, LOGERR(LYD_CTX(node), LY_EINT, "Value duplication failed."), finish);
3490 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), meta->name, 0, &mt->name), finish);
Michal Vasko25a32822020-07-09 15:48:22 +02003491
3492 /* insert as the last attribute */
Radek Krejci011e4aa2020-09-04 15:22:31 +02003493 mt->parent = node;
Michal Vasko25a32822020-07-09 15:48:22 +02003494 if (node->meta) {
Radek Krejci1e008d22020-08-17 11:37:37 +02003495 for (last = node->meta; last->next; last = last->next) {}
Michal Vasko25a32822020-07-09 15:48:22 +02003496 last->next = mt;
3497 } else {
3498 node->meta = mt;
3499 }
3500
Radek Krejci011e4aa2020-09-04 15:22:31 +02003501finish:
3502 if (ret) {
3503 lyd_free_meta_single(mt);
3504 } else if (dup) {
Michal Vasko3a41dff2020-07-15 14:30:28 +02003505 *dup = mt;
3506 }
3507 return LY_SUCCESS;
Michal Vasko25a32822020-07-09 15:48:22 +02003508}
3509
Michal Vasko4490d312020-06-16 13:08:55 +02003510/**
3511 * @brief Merge a source sibling into target siblings.
3512 *
3513 * @param[in,out] first_trg First target sibling, is updated if top-level.
3514 * @param[in] parent_trg Target parent.
3515 * @param[in,out] sibling_src Source sibling to merge, set to NULL if spent.
Michal Vaskocd3f6172021-05-18 16:14:50 +02003516 * @param[in] merge_cb Optional merge callback.
3517 * @param[in] cb_data Arbitrary callback data.
Michal Vasko4490d312020-06-16 13:08:55 +02003518 * @param[in] options Merge options.
Michal Vaskocd3f6172021-05-18 16:14:50 +02003519 * @param[in,out] dup_inst Duplicate instance cache for all @p first_trg siblings.
Michal Vasko4490d312020-06-16 13:08:55 +02003520 * @return LY_ERR value.
3521 */
3522static LY_ERR
3523lyd_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 +02003524 lyd_merge_cb merge_cb, void *cb_data, uint16_t options, struct lyd_dup_inst **dup_inst)
Michal Vasko4490d312020-06-16 13:08:55 +02003525{
Michal Vasko4490d312020-06-16 13:08:55 +02003526 const struct lyd_node *child_src, *tmp, *sibling_src;
Michal Vasko56daf732020-08-10 10:57:18 +02003527 struct lyd_node *match_trg, *dup_src, *elem;
Michal Vasko4490d312020-06-16 13:08:55 +02003528 struct lysc_type *type;
Michal Vaskocd3f6172021-05-18 16:14:50 +02003529 struct lyd_dup_inst *child_dup_inst = NULL;
3530 LY_ERR ret;
3531 ly_bool first_inst = 0;
Michal Vasko4490d312020-06-16 13:08:55 +02003532
3533 sibling_src = *sibling_src_p;
Michal Vaskocd3f6172021-05-18 16:14:50 +02003534 if (!sibling_src->schema) {
3535 /* try to find the same opaque node */
3536 lyd_find_sibling_opaq_next(*first_trg, LYD_NAME(sibling_src), &match_trg);
3537 } else if (sibling_src->schema->nodetype & (LYS_LIST | LYS_LEAFLIST)) {
Michal Vasko4490d312020-06-16 13:08:55 +02003538 /* try to find the exact instance */
Michal Vaskocd3f6172021-05-18 16:14:50 +02003539 lyd_find_sibling_first(*first_trg, sibling_src, &match_trg);
Michal Vasko4490d312020-06-16 13:08:55 +02003540 } else {
3541 /* try to simply find the node, there cannot be more instances */
Michal Vaskocd3f6172021-05-18 16:14:50 +02003542 lyd_find_sibling_val(*first_trg, sibling_src->schema, NULL, 0, &match_trg);
Michal Vasko4490d312020-06-16 13:08:55 +02003543 }
3544
Michal Vaskocd3f6172021-05-18 16:14:50 +02003545 if (match_trg) {
3546 /* update match as needed */
3547 LY_CHECK_RET(lyd_dup_inst_next(&match_trg, *first_trg, dup_inst));
3548 } else {
3549 /* first instance of this node */
3550 first_inst = 1;
3551 }
3552
3553 if (match_trg) {
3554 /* call callback */
3555 if (merge_cb) {
3556 LY_CHECK_RET(merge_cb(match_trg, sibling_src, cb_data));
3557 }
3558
Michal Vasko4490d312020-06-16 13:08:55 +02003559 /* node found, make sure even value matches for all node types */
Michal Vasko8f359bf2020-07-28 10:41:15 +02003560 if ((match_trg->schema->nodetype == LYS_LEAF) && lyd_compare_single(sibling_src, match_trg, LYD_COMPARE_DEFAULTS)) {
Michal Vasko4490d312020-06-16 13:08:55 +02003561 /* since they are different, they cannot both be default */
3562 assert(!(sibling_src->flags & LYD_DEFAULT) || !(match_trg->flags & LYD_DEFAULT));
3563
Michal Vasko3a41dff2020-07-15 14:30:28 +02003564 /* update value (or only LYD_DEFAULT flag) only if flag set or the source node is not default */
3565 if ((options & LYD_MERGE_DEFAULTS) || !(sibling_src->flags & LYD_DEFAULT)) {
Michal Vasko4490d312020-06-16 13:08:55 +02003566 type = ((struct lysc_node_leaf *)match_trg->schema)->type;
Michal Vaskob7be7a82020-08-20 09:09:04 +02003567 type->plugin->free(LYD_CTX(match_trg), &((struct lyd_node_term *)match_trg)->value);
3568 LY_CHECK_RET(type->plugin->duplicate(LYD_CTX(match_trg), &((struct lyd_node_term *)sibling_src)->value,
Michal Vasko69730152020-10-09 16:30:07 +02003569 &((struct lyd_node_term *)match_trg)->value));
Michal Vasko4490d312020-06-16 13:08:55 +02003570
3571 /* copy flags and add LYD_NEW */
3572 match_trg->flags = sibling_src->flags | LYD_NEW;
3573 }
Michal Vasko8f359bf2020-07-28 10:41:15 +02003574 } else if ((match_trg->schema->nodetype & LYS_ANYDATA) && lyd_compare_single(sibling_src, match_trg, 0)) {
Michal Vasko4c583e82020-07-17 12:16:14 +02003575 /* update value */
3576 LY_CHECK_RET(lyd_any_copy_value(match_trg, &((struct lyd_node_any *)sibling_src)->value,
Radek Krejci0f969882020-08-21 16:56:47 +02003577 ((struct lyd_node_any *)sibling_src)->value_type));
Michal Vasko4490d312020-06-16 13:08:55 +02003578
3579 /* copy flags and add LYD_NEW */
3580 match_trg->flags = sibling_src->flags | LYD_NEW;
Michal Vaskocd3f6172021-05-18 16:14:50 +02003581 }
3582
3583 /* check descendants, recursively */
3584 ret = LY_SUCCESS;
3585 LY_LIST_FOR_SAFE(lyd_child_no_keys(sibling_src), tmp, child_src) {
3586 ret = lyd_merge_sibling_r(lyd_node_child_p(match_trg), match_trg, &child_src, merge_cb, cb_data, options,
3587 &child_dup_inst);
3588 if (ret) {
3589 break;
Michal Vasko4490d312020-06-16 13:08:55 +02003590 }
3591 }
Michal Vaskocd3f6172021-05-18 16:14:50 +02003592 lyd_dup_inst_free(child_dup_inst);
3593 LY_CHECK_RET(ret);
Michal Vasko4490d312020-06-16 13:08:55 +02003594 } else {
3595 /* node not found, merge it */
3596 if (options & LYD_MERGE_DESTRUCT) {
3597 dup_src = (struct lyd_node *)sibling_src;
3598 lyd_unlink_tree(dup_src);
3599 /* spend it */
3600 *sibling_src_p = NULL;
3601 } else {
Michal Vasko3a41dff2020-07-15 14:30:28 +02003602 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 +02003603 }
3604
3605 /* set LYD_NEW for all the new nodes, required for validation */
Michal Vasko56daf732020-08-10 10:57:18 +02003606 LYD_TREE_DFS_BEGIN(dup_src, elem) {
Michal Vasko4490d312020-06-16 13:08:55 +02003607 elem->flags |= LYD_NEW;
Michal Vasko56daf732020-08-10 10:57:18 +02003608 LYD_TREE_DFS_END(dup_src, elem);
Michal Vasko4490d312020-06-16 13:08:55 +02003609 }
3610
Michal Vaskocd3f6172021-05-18 16:14:50 +02003611 /* insert */
Michal Vasko4490d312020-06-16 13:08:55 +02003612 lyd_insert_node(parent_trg, first_trg, dup_src);
Michal Vaskocd3f6172021-05-18 16:14:50 +02003613
3614 if (first_inst) {
3615 /* remember not to find this instance next time */
3616 LY_CHECK_RET(lyd_dup_inst_next(&dup_src, *first_trg, dup_inst));
3617 }
3618
3619 /* call callback, no source node */
3620 if (merge_cb) {
3621 LY_CHECK_RET(merge_cb(dup_src, NULL, cb_data));
3622 }
Michal Vasko4490d312020-06-16 13:08:55 +02003623 }
3624
3625 return LY_SUCCESS;
3626}
3627
Michal Vasko3a41dff2020-07-15 14:30:28 +02003628static LY_ERR
Michal Vaskocd3f6172021-05-18 16:14:50 +02003629lyd_merge(struct lyd_node **target, const struct lyd_node *source, const struct lys_module *mod,
3630 lyd_merge_cb merge_cb, void *cb_data, uint16_t options, ly_bool nosiblings)
Michal Vasko4490d312020-06-16 13:08:55 +02003631{
3632 const struct lyd_node *sibling_src, *tmp;
Michal Vaskocd3f6172021-05-18 16:14:50 +02003633 struct lyd_dup_inst *dup_inst = NULL;
Radek Krejci857189e2020-09-01 13:26:36 +02003634 ly_bool first;
Michal Vaskocd3f6172021-05-18 16:14:50 +02003635 LY_ERR ret = LY_SUCCESS;
Michal Vasko4490d312020-06-16 13:08:55 +02003636
3637 LY_CHECK_ARG_RET(NULL, target, LY_EINVAL);
3638
3639 if (!source) {
3640 /* nothing to merge */
3641 return LY_SUCCESS;
3642 }
3643
Michal Vasko831422b2020-11-24 11:20:51 +01003644 if ((*target && lysc_data_parent((*target)->schema)) || lysc_data_parent(source->schema)) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02003645 LOGERR(LYD_CTX(source), LY_EINVAL, "Invalid arguments - can merge only 2 top-level subtrees (%s()).", __func__);
Michal Vasko4490d312020-06-16 13:08:55 +02003646 return LY_EINVAL;
3647 }
3648
3649 LY_LIST_FOR_SAFE(source, tmp, sibling_src) {
Michal Vaskocd3f6172021-05-18 16:14:50 +02003650 if (mod && (lyd_owner_module(sibling_src) != mod)) {
3651 /* skip data nodes from different modules */
3652 continue;
3653 }
3654
Radek Krejci857189e2020-09-01 13:26:36 +02003655 first = (sibling_src == source) ? 1 : 0;
Michal Vaskocd3f6172021-05-18 16:14:50 +02003656 ret = lyd_merge_sibling_r(target, NULL, &sibling_src, merge_cb, cb_data, options, &dup_inst);
3657 if (ret) {
3658 break;
3659 }
Michal Vasko4490d312020-06-16 13:08:55 +02003660 if (first && !sibling_src) {
3661 /* source was spent (unlinked), move to the next node */
3662 source = tmp;
3663 }
3664
Michal Vasko3a41dff2020-07-15 14:30:28 +02003665 if (nosiblings) {
Michal Vasko4490d312020-06-16 13:08:55 +02003666 break;
3667 }
3668 }
3669
3670 if (options & LYD_MERGE_DESTRUCT) {
3671 /* free any leftover source data that were not merged */
3672 lyd_free_siblings((struct lyd_node *)source);
3673 }
3674
Michal Vaskocd3f6172021-05-18 16:14:50 +02003675 lyd_dup_inst_free(dup_inst);
3676 return ret;
Michal Vasko4490d312020-06-16 13:08:55 +02003677}
3678
Michal Vasko3a41dff2020-07-15 14:30:28 +02003679API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02003680lyd_merge_tree(struct lyd_node **target, const struct lyd_node *source, uint16_t options)
Michal Vasko3a41dff2020-07-15 14:30:28 +02003681{
Michal Vaskocd3f6172021-05-18 16:14:50 +02003682 return lyd_merge(target, source, NULL, NULL, NULL, options, 1);
Michal Vasko3a41dff2020-07-15 14:30:28 +02003683}
3684
3685API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02003686lyd_merge_siblings(struct lyd_node **target, const struct lyd_node *source, uint16_t options)
Michal Vasko3a41dff2020-07-15 14:30:28 +02003687{
Michal Vaskocd3f6172021-05-18 16:14:50 +02003688 return lyd_merge(target, source, NULL, NULL, NULL, options, 0);
3689}
3690
3691API LY_ERR
3692lyd_merge_module(struct lyd_node **target, const struct lyd_node *source, const struct lys_module *mod,
3693 lyd_merge_cb merge_cb, void *cb_data, uint16_t options)
3694{
3695 return lyd_merge(target, source, mod, merge_cb, cb_data, options, 0);
Michal Vasko3a41dff2020-07-15 14:30:28 +02003696}
3697
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003698static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02003699lyd_path_str_enlarge(char **buffer, size_t *buflen, size_t reqlen, ly_bool is_static)
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003700{
Michal Vasko14654712020-02-06 08:35:21 +01003701 /* ending \0 */
3702 ++reqlen;
3703
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003704 if (reqlen > *buflen) {
3705 if (is_static) {
3706 return LY_EINCOMPLETE;
3707 }
3708
3709 *buffer = ly_realloc(*buffer, reqlen * sizeof **buffer);
3710 if (!*buffer) {
3711 return LY_EMEM;
3712 }
3713
3714 *buflen = reqlen;
3715 }
3716
3717 return LY_SUCCESS;
3718}
3719
Michal Vaskod59035b2020-07-08 12:00:06 +02003720LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02003721lyd_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 +02003722{
3723 const struct lyd_node *key;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003724 size_t len;
3725 const char *val;
3726 char quot;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003727
Radek Krejcia1c1e542020-09-29 16:06:52 +02003728 for (key = lyd_child(node); key && (key->schema->flags & LYS_KEY); key = key->next) {
Radek Krejci6d5ba0c2021-04-26 07:49:59 +02003729 val = lyd_get_value(key);
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003730 len = 1 + strlen(key->schema->name) + 2 + strlen(val) + 2;
Michal Vaskoba99a3e2020-08-18 15:50:05 +02003731 LY_CHECK_RET(lyd_path_str_enlarge(buffer, buflen, *bufused + len, is_static));
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003732
3733 quot = '\'';
3734 if (strchr(val, '\'')) {
3735 quot = '"';
3736 }
3737 *bufused += sprintf(*buffer + *bufused, "[%s=%c%s%c]", key->schema->name, quot, val, quot);
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003738 }
3739
3740 return LY_SUCCESS;
3741}
3742
3743/**
3744 * @brief Append leaf-list value predicate to path.
3745 *
3746 * @param[in] node Node to print.
3747 * @param[in,out] buffer Buffer to print to.
3748 * @param[in,out] buflen Current buffer length.
3749 * @param[in,out] bufused Current number of characters used in @p buffer.
3750 * @param[in] is_static Whether buffer is static or can be reallocated.
3751 * @return LY_ERR
3752 */
3753static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02003754lyd_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 +02003755{
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003756 size_t len;
3757 const char *val;
3758 char quot;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003759
Radek Krejci6d5ba0c2021-04-26 07:49:59 +02003760 val = lyd_get_value(node);
Radek Krejcif13b87b2020-12-01 22:02:17 +01003761 len = 4 + strlen(val) + 2; /* "[.='" + val + "']" */
Michal Vaskoba99a3e2020-08-18 15:50:05 +02003762 LY_CHECK_RET(lyd_path_str_enlarge(buffer, buflen, *bufused + len, is_static));
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003763
3764 quot = '\'';
3765 if (strchr(val, '\'')) {
3766 quot = '"';
3767 }
3768 *bufused += sprintf(*buffer + *bufused, "[.=%c%s%c]", quot, val, quot);
3769
Michal Vaskoba99a3e2020-08-18 15:50:05 +02003770 return LY_SUCCESS;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003771}
3772
3773/**
3774 * @brief Append node position (relative to its other instances) predicate to path.
3775 *
3776 * @param[in] node Node to print.
3777 * @param[in,out] buffer Buffer to print to.
3778 * @param[in,out] buflen Current buffer length.
3779 * @param[in,out] bufused Current number of characters used in @p buffer.
3780 * @param[in] is_static Whether buffer is static or can be reallocated.
3781 * @return LY_ERR
3782 */
3783static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02003784lyd_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 +02003785{
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003786 size_t len;
Michal Vasko50cc0562021-05-18 16:15:43 +02003787 uint32_t pos;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003788 char *val = NULL;
3789 LY_ERR rc;
3790
Michal Vasko50cc0562021-05-18 16:15:43 +02003791 pos = lyd_list_pos(node);
3792 if (asprintf(&val, "%" PRIu32, pos) == -1) {
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003793 return LY_EMEM;
3794 }
3795
3796 len = 1 + strlen(val) + 1;
3797 rc = lyd_path_str_enlarge(buffer, buflen, *bufused + len, is_static);
3798 if (rc != LY_SUCCESS) {
3799 goto cleanup;
3800 }
3801
3802 *bufused += sprintf(*buffer + *bufused, "[%s]", val);
3803
3804cleanup:
3805 free(val);
3806 return rc;
3807}
3808
3809API char *
3810lyd_path(const struct lyd_node *node, LYD_PATH_TYPE pathtype, char *buffer, size_t buflen)
3811{
Radek Krejci857189e2020-09-01 13:26:36 +02003812 ly_bool is_static = 0;
Radek Krejci1deb5be2020-08-26 16:43:36 +02003813 uint32_t i, depth;
Michal Vasko14654712020-02-06 08:35:21 +01003814 size_t bufused = 0, len;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003815 const struct lyd_node *iter;
3816 const struct lys_module *mod;
Michal Vasko790b2bc2020-08-03 13:35:06 +02003817 LY_ERR rc = LY_SUCCESS;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003818
3819 LY_CHECK_ARG_RET(NULL, node, NULL);
3820 if (buffer) {
Michal Vasko16385f42021-05-18 16:16:09 +02003821 LY_CHECK_ARG_RET(LYD_CTX(node), buflen > 1, NULL);
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003822 is_static = 1;
Michal Vasko14654712020-02-06 08:35:21 +01003823 } else {
3824 buflen = 0;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003825 }
3826
3827 switch (pathtype) {
Radek Krejci635d2b82021-01-04 11:26:51 +01003828 case LYD_PATH_STD:
3829 case LYD_PATH_STD_NO_LAST_PRED:
Michal Vasko14654712020-02-06 08:35:21 +01003830 depth = 1;
Michal Vasko9e685082021-01-29 14:49:09 +01003831 for (iter = node; iter->parent; iter = lyd_parent(iter)) {
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003832 ++depth;
3833 }
3834
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003835 goto iter_print;
Michal Vasko14654712020-02-06 08:35:21 +01003836 while (depth) {
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003837 /* find the right node */
Michal Vasko9e685082021-01-29 14:49:09 +01003838 for (iter = node, i = 1; i < depth; iter = lyd_parent(iter), ++i) {}
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003839iter_print:
3840 /* print prefix and name */
3841 mod = NULL;
Michal Vasko69730152020-10-09 16:30:07 +02003842 if (iter->schema && (!iter->parent || (iter->schema->module != iter->parent->schema->module))) {
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003843 mod = iter->schema->module;
3844 }
3845
3846 /* realloc string */
Michal Vaskoad92b672020-11-12 13:11:31 +01003847 len = 1 + (mod ? strlen(mod->name) + 1 : 0) + (iter->schema ? strlen(iter->schema->name) :
3848 strlen(((struct lyd_node_opaq *)iter)->name.name));
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003849 rc = lyd_path_str_enlarge(&buffer, &buflen, bufused + len, is_static);
3850 if (rc != LY_SUCCESS) {
3851 break;
3852 }
3853
3854 /* print next node */
Radek Krejci1798aae2020-07-14 13:26:06 +02003855 bufused += sprintf(buffer + bufused, "/%s%s%s", mod ? mod->name : "", mod ? ":" : "",
Michal Vaskoad92b672020-11-12 13:11:31 +01003856 iter->schema ? iter->schema->name : ((struct lyd_node_opaq *)iter)->name.name);
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003857
Michal Vasko790b2bc2020-08-03 13:35:06 +02003858 /* do not always print the last (first) predicate */
Radek Krejci635d2b82021-01-04 11:26:51 +01003859 if (iter->schema && ((depth > 1) || (pathtype == LYD_PATH_STD))) {
Michal Vasko790b2bc2020-08-03 13:35:06 +02003860 switch (iter->schema->nodetype) {
3861 case LYS_LIST:
3862 if (iter->schema->flags & LYS_KEYLESS) {
3863 /* print its position */
3864 rc = lyd_path_position_predicate(iter, &buffer, &buflen, &bufused, is_static);
3865 } else {
3866 /* print all list keys in predicates */
3867 rc = lyd_path_list_predicate(iter, &buffer, &buflen, &bufused, is_static);
3868 }
3869 break;
3870 case LYS_LEAFLIST:
3871 if (iter->schema->flags & LYS_CONFIG_W) {
3872 /* print leaf-list value */
3873 rc = lyd_path_leaflist_predicate(iter, &buffer, &buflen, &bufused, is_static);
3874 } else {
3875 /* print its position */
3876 rc = lyd_path_position_predicate(iter, &buffer, &buflen, &bufused, is_static);
3877 }
3878 break;
3879 default:
3880 /* nothing to print more */
3881 break;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003882 }
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003883 }
3884 if (rc != LY_SUCCESS) {
3885 break;
3886 }
3887
Michal Vasko14654712020-02-06 08:35:21 +01003888 --depth;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003889 }
3890 break;
3891 }
3892
3893 return buffer;
3894}
Michal Vaskoe444f752020-02-10 12:20:06 +01003895
Michal Vasko25a32822020-07-09 15:48:22 +02003896API struct lyd_meta *
3897lyd_find_meta(const struct lyd_meta *first, const struct lys_module *module, const char *name)
3898{
3899 struct lyd_meta *ret = NULL;
3900 const struct ly_ctx *ctx;
3901 const char *prefix, *tmp;
3902 char *str;
3903 size_t pref_len, name_len;
3904
3905 LY_CHECK_ARG_RET(NULL, module || strchr(name, ':'), name, NULL);
3906
3907 if (!first) {
3908 return NULL;
3909 }
3910
3911 ctx = first->annotation->module->ctx;
3912
3913 /* parse the name */
3914 tmp = name;
3915 if (ly_parse_nodeid(&tmp, &prefix, &pref_len, &name, &name_len) || tmp[0]) {
3916 LOGERR(ctx, LY_EINVAL, "Metadata name \"%s\" is not valid.", name);
3917 return NULL;
3918 }
3919
3920 /* find the module */
3921 if (prefix) {
3922 str = strndup(prefix, pref_len);
3923 module = ly_ctx_get_module_latest(ctx, str);
3924 free(str);
Radek Krejci422afb12021-03-04 16:38:16 +01003925 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 +02003926 }
3927
3928 /* find the metadata */
3929 LY_LIST_FOR(first, first) {
3930 if ((first->annotation->module == module) && !strcmp(first->name, name)) {
3931 ret = (struct lyd_meta *)first;
3932 break;
3933 }
3934 }
3935
3936 return ret;
3937}
3938
Michal Vasko9b368d32020-02-14 13:53:31 +01003939API LY_ERR
Michal Vaskoe444f752020-02-10 12:20:06 +01003940lyd_find_sibling_first(const struct lyd_node *siblings, const struct lyd_node *target, struct lyd_node **match)
3941{
Michal Vaskoe78faec2021-04-08 17:24:43 +02003942 struct lyd_node **match_p, *iter;
Michal Vaskoe444f752020-02-10 12:20:06 +01003943 struct lyd_node_inner *parent;
Michal Vaskoe78faec2021-04-08 17:24:43 +02003944 ly_bool found;
Michal Vaskoe444f752020-02-10 12:20:06 +01003945
Michal Vaskof03ed032020-03-04 13:31:44 +01003946 LY_CHECK_ARG_RET(NULL, target, LY_EINVAL);
Michal Vaskoe444f752020-02-10 12:20:06 +01003947
Michal Vasko6da1e952020-12-09 18:14:38 +01003948 if (!siblings || (siblings->schema && target->schema &&
3949 (lysc_data_parent(siblings->schema) != lysc_data_parent(target->schema)))) {
Michal Vasko62ed12d2020-05-21 10:08:25 +02003950 /* no data or schema mismatch */
Michal Vasko9b368d32020-02-14 13:53:31 +01003951 if (match) {
3952 *match = NULL;
3953 }
Michal Vaskoe444f752020-02-10 12:20:06 +01003954 return LY_ENOTFOUND;
3955 }
3956
Michal Vaskoe78faec2021-04-08 17:24:43 +02003957 /* get first sibling */
3958 siblings = lyd_first_sibling(siblings);
Michal Vaskoe444f752020-02-10 12:20:06 +01003959
Michal Vasko9e685082021-01-29 14:49:09 +01003960 parent = siblings->parent;
Michal Vasko6da1e952020-12-09 18:14:38 +01003961 if (parent && parent->schema && parent->children_ht) {
Michal Vaskoe444f752020-02-10 12:20:06 +01003962 assert(target->hash);
3963
Michal Vaskoe78faec2021-04-08 17:24:43 +02003964 if (lysc_is_dup_inst_list(target->schema)) {
3965 /* we must search the instances from beginning to find the first matching one */
3966 found = 0;
3967 LYD_LIST_FOR_INST(siblings, target->schema, iter) {
3968 if (!lyd_compare_single(target, iter, 0)) {
3969 found = 1;
3970 break;
3971 }
3972 }
3973 if (found) {
3974 siblings = iter;
Michal Vaskoda859032020-07-14 12:20:14 +02003975 } else {
3976 siblings = NULL;
3977 }
Michal Vaskoe444f752020-02-10 12:20:06 +01003978 } else {
Michal Vaskoe78faec2021-04-08 17:24:43 +02003979 /* find by hash */
3980 if (!lyht_find(parent->children_ht, &target, target->hash, (void **)&match_p)) {
3981 siblings = *match_p;
3982 } else {
3983 /* not found */
3984 siblings = NULL;
3985 }
Michal Vaskoe444f752020-02-10 12:20:06 +01003986 }
3987 } else {
3988 /* no children hash table */
Michal Vaskod989ba02020-08-24 10:59:24 +02003989 for ( ; siblings; siblings = siblings->next) {
Michal Vasko8f359bf2020-07-28 10:41:15 +02003990 if (!lyd_compare_single(siblings, target, 0)) {
Michal Vaskoe444f752020-02-10 12:20:06 +01003991 break;
3992 }
3993 }
3994 }
3995
3996 if (!siblings) {
Michal Vasko9b368d32020-02-14 13:53:31 +01003997 if (match) {
3998 *match = NULL;
3999 }
Michal Vaskoe444f752020-02-10 12:20:06 +01004000 return LY_ENOTFOUND;
4001 }
4002
Michal Vasko9b368d32020-02-14 13:53:31 +01004003 if (match) {
4004 *match = (struct lyd_node *)siblings;
4005 }
Michal Vaskoe444f752020-02-10 12:20:06 +01004006 return LY_SUCCESS;
4007}
4008
Radek Krejci857189e2020-09-01 13:26:36 +02004009/**
4010 * @brief Comparison callback to match schema node with a schema of a data node.
4011 *
4012 * @param[in] val1_p Pointer to the schema node
4013 * @param[in] val2_p Pointer to the data node
Michal Vasko62524a92021-02-26 10:08:50 +01004014 * Implementation of ::lyht_value_equal_cb.
Radek Krejci857189e2020-09-01 13:26:36 +02004015 */
4016static ly_bool
4017lyd_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 +01004018{
4019 struct lysc_node *val1;
4020 struct lyd_node *val2;
4021
4022 val1 = *((struct lysc_node **)val1_p);
4023 val2 = *((struct lyd_node **)val2_p);
4024
Michal Vasko90932a92020-02-12 14:33:03 +01004025 if (val1 == val2->schema) {
4026 /* schema match is enough */
4027 return 1;
4028 } else {
4029 return 0;
4030 }
4031}
4032
Michal Vasko92239c72020-11-18 18:17:25 +01004033/**
4034 * @brief Search in the given siblings (NOT recursively) for the first schema node data instance.
4035 * Uses hashes - should be used whenever possible for best performance.
4036 *
4037 * @param[in] siblings Siblings to search in including preceding and succeeding nodes.
4038 * @param[in] schema Target data node schema to find.
4039 * @param[out] match Can be NULL, otherwise the found data node.
4040 * @return LY_SUCCESS on success, @p match set.
4041 * @return LY_ENOTFOUND if not found, @p match set to NULL.
4042 * @return LY_ERR value if another error occurred.
4043 */
Michal Vasko90932a92020-02-12 14:33:03 +01004044static LY_ERR
4045lyd_find_sibling_schema(const struct lyd_node *siblings, const struct lysc_node *schema, struct lyd_node **match)
4046{
4047 struct lyd_node **match_p;
4048 struct lyd_node_inner *parent;
4049 uint32_t hash;
Michal Vasko62524a92021-02-26 10:08:50 +01004050 lyht_value_equal_cb ht_cb;
Michal Vasko90932a92020-02-12 14:33:03 +01004051
Michal Vaskob104f112020-07-17 09:54:54 +02004052 assert(siblings && schema);
Michal Vasko90932a92020-02-12 14:33:03 +01004053
Michal Vasko9e685082021-01-29 14:49:09 +01004054 parent = siblings->parent;
Michal Vasko08fd6132020-11-18 18:17:45 +01004055 if (parent && parent->schema && parent->children_ht) {
Michal Vasko90932a92020-02-12 14:33:03 +01004056 /* calculate our hash */
4057 hash = dict_hash_multi(0, schema->module->name, strlen(schema->module->name));
4058 hash = dict_hash_multi(hash, schema->name, strlen(schema->name));
4059 hash = dict_hash_multi(hash, NULL, 0);
4060
4061 /* use special hash table function */
4062 ht_cb = lyht_set_cb(parent->children_ht, lyd_hash_table_schema_val_equal);
4063
4064 /* find by hash */
4065 if (!lyht_find(parent->children_ht, &schema, hash, (void **)&match_p)) {
4066 siblings = *match_p;
4067 } else {
4068 /* not found */
4069 siblings = NULL;
4070 }
4071
4072 /* set the original hash table compare function back */
4073 lyht_set_cb(parent->children_ht, ht_cb);
4074 } else {
Michal Vaskob104f112020-07-17 09:54:54 +02004075 /* find first sibling */
4076 if (siblings->parent) {
4077 siblings = siblings->parent->child;
4078 } else {
4079 while (siblings->prev->next) {
4080 siblings = siblings->prev;
4081 }
4082 }
4083
4084 /* search manually without hashes */
Michal Vaskod989ba02020-08-24 10:59:24 +02004085 for ( ; siblings; siblings = siblings->next) {
Michal Vasko90932a92020-02-12 14:33:03 +01004086 if (siblings->schema == schema) {
4087 /* schema match is enough */
4088 break;
4089 }
4090 }
4091 }
4092
4093 if (!siblings) {
Michal Vasko9b368d32020-02-14 13:53:31 +01004094 if (match) {
4095 *match = NULL;
4096 }
Michal Vasko90932a92020-02-12 14:33:03 +01004097 return LY_ENOTFOUND;
4098 }
4099
Michal Vasko9b368d32020-02-14 13:53:31 +01004100 if (match) {
4101 *match = (struct lyd_node *)siblings;
4102 }
Michal Vasko90932a92020-02-12 14:33:03 +01004103 return LY_SUCCESS;
4104}
4105
Michal Vaskoe444f752020-02-10 12:20:06 +01004106API LY_ERR
4107lyd_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 +02004108 size_t val_len, struct lyd_node **match)
Michal Vaskoe444f752020-02-10 12:20:06 +01004109{
4110 LY_ERR rc;
4111 struct lyd_node *target = NULL;
4112
Michal Vasko4c583e82020-07-17 12:16:14 +02004113 LY_CHECK_ARG_RET(NULL, schema, !(schema->nodetype & (LYS_CHOICE | LYS_CASE)), LY_EINVAL);
Michal Vaskoe444f752020-02-10 12:20:06 +01004114
Michal Vasko08fd6132020-11-18 18:17:45 +01004115 if (!siblings || (siblings->schema && (lysc_data_parent(siblings->schema) != lysc_data_parent(schema)))) {
Michal Vasko62ed12d2020-05-21 10:08:25 +02004116 /* no data or schema mismatch */
Michal Vasko9b368d32020-02-14 13:53:31 +01004117 if (match) {
4118 *match = NULL;
4119 }
Michal Vaskoe444f752020-02-10 12:20:06 +01004120 return LY_ENOTFOUND;
4121 }
4122
Michal Vaskof03ed032020-03-04 13:31:44 +01004123 if (key_or_value && !val_len) {
4124 val_len = strlen(key_or_value);
4125 }
4126
Michal Vaskob104f112020-07-17 09:54:54 +02004127 if ((schema->nodetype & (LYS_LIST | LYS_LEAFLIST)) && key_or_value) {
4128 /* create a data node and find the instance */
4129 if (schema->nodetype == LYS_LEAFLIST) {
4130 /* target used attributes: schema, hash, value */
Radek Krejci8df109d2021-04-23 12:19:08 +02004131 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 +02004132 LY_CHECK_RET(rc);
Michal Vaskob104f112020-07-17 09:54:54 +02004133 } else {
Michal Vasko90932a92020-02-12 14:33:03 +01004134 /* target used attributes: schema, hash, child (all keys) */
Michal Vasko004d3152020-06-11 19:59:22 +02004135 LY_CHECK_RET(lyd_create_list2(schema, key_or_value, val_len, &target));
Michal Vasko90932a92020-02-12 14:33:03 +01004136 }
4137
4138 /* find it */
4139 rc = lyd_find_sibling_first(siblings, target, match);
Michal Vaskob104f112020-07-17 09:54:54 +02004140 } else {
4141 /* find the first schema node instance */
4142 rc = lyd_find_sibling_schema(siblings, schema, match);
Michal Vaskoe444f752020-02-10 12:20:06 +01004143 }
4144
Michal Vaskoe444f752020-02-10 12:20:06 +01004145 lyd_free_tree(target);
4146 return rc;
4147}
Michal Vaskoccc02342020-05-21 10:09:21 +02004148
4149API LY_ERR
Michal Vaskoe78faec2021-04-08 17:24:43 +02004150lyd_find_sibling_dup_inst_set(const struct lyd_node *siblings, const struct lyd_node *target, struct ly_set **set)
4151{
4152 struct lyd_node **match_p, *first, *iter;
4153 struct lyd_node_inner *parent;
4154
4155 LY_CHECK_ARG_RET(NULL, target, lysc_is_dup_inst_list(target->schema), set, LY_EINVAL);
4156
4157 LY_CHECK_RET(ly_set_new(set));
4158
4159 if (!siblings || (siblings->schema && (lysc_data_parent(siblings->schema) != lysc_data_parent(target->schema)))) {
4160 /* no data or schema mismatch */
4161 return LY_ENOTFOUND;
4162 }
4163
4164 /* get first sibling */
4165 siblings = lyd_first_sibling(siblings);
4166
4167 parent = siblings->parent;
4168 if (parent && parent->schema && parent->children_ht) {
4169 assert(target->hash);
4170
4171 /* find the first instance */
4172 lyd_find_sibling_first(siblings, target, &first);
4173 if (first) {
4174 /* add it so that it is the first in the set */
4175 if (ly_set_add(*set, first, 1, NULL)) {
4176 goto error;
4177 }
4178
4179 /* find by hash */
4180 if (!lyht_find(parent->children_ht, &target, target->hash, (void **)&match_p)) {
4181 iter = *match_p;
4182 } else {
4183 /* not found */
4184 iter = NULL;
4185 }
4186 while (iter) {
4187 /* add all found nodes into the set */
4188 if ((iter != first) && !lyd_compare_single(iter, target, 0) && ly_set_add(*set, iter, 1, NULL)) {
4189 goto error;
4190 }
4191
4192 /* find next instance */
4193 if (lyht_find_next(parent->children_ht, &iter, iter->hash, (void **)&match_p)) {
4194 iter = NULL;
4195 } else {
4196 iter = *match_p;
4197 }
4198 }
4199 }
4200 } else {
4201 /* no children hash table */
4202 LY_LIST_FOR(siblings, siblings) {
4203 if (!lyd_compare_single(target, siblings, 0)) {
4204 ly_set_add(*set, (void *)siblings, 1, NULL);
4205 }
4206 }
4207 }
4208
4209 if (!(*set)->count) {
4210 return LY_ENOTFOUND;
4211 }
4212 return LY_SUCCESS;
4213
4214error:
4215 ly_set_free(*set, NULL);
4216 *set = NULL;
4217 return LY_EMEM;
4218}
4219
4220API LY_ERR
Michal Vasko1d4af6c2021-02-22 13:31:26 +01004221lyd_find_sibling_opaq_next(const struct lyd_node *first, const char *name, struct lyd_node **match)
4222{
4223 LY_CHECK_ARG_RET(NULL, name, LY_EINVAL);
4224
4225 for ( ; first; first = first->next) {
4226 if (!first->schema && !strcmp(LYD_NAME(first), name)) {
4227 break;
4228 }
4229 }
4230
4231 if (match) {
4232 *match = (struct lyd_node *)first;
4233 }
4234 return first ? LY_SUCCESS : LY_ENOTFOUND;
4235}
4236
4237API LY_ERR
Michal Vaskoccc02342020-05-21 10:09:21 +02004238lyd_find_xpath(const struct lyd_node *ctx_node, const char *xpath, struct ly_set **set)
4239{
4240 LY_ERR ret = LY_SUCCESS;
4241 struct lyxp_set xp_set;
Radek Krejcif03a9e22020-09-18 20:09:31 +02004242 struct lyxp_expr *exp = NULL;
Michal Vaskoccc02342020-05-21 10:09:21 +02004243 uint32_t i;
4244
4245 LY_CHECK_ARG_RET(NULL, ctx_node, xpath, set, LY_EINVAL);
4246
Michal Vasko37c69432021-04-12 14:48:24 +02004247 *set = NULL;
Michal Vaskoccc02342020-05-21 10:09:21 +02004248 memset(&xp_set, 0, sizeof xp_set);
4249
4250 /* compile expression */
Radek Krejcif03a9e22020-09-18 20:09:31 +02004251 ret = lyxp_expr_parse((struct ly_ctx *)LYD_CTX(ctx_node), xpath, 0, 1, &exp);
4252 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskoccc02342020-05-21 10:09:21 +02004253
4254 /* evaluate expression */
Radek Krejci8df109d2021-04-23 12:19:08 +02004255 ret = lyxp_eval(LYD_CTX(ctx_node), exp, NULL, LY_VALUE_JSON, NULL, ctx_node, ctx_node, &xp_set, LYXP_IGNORE_WHEN);
Michal Vaskoccc02342020-05-21 10:09:21 +02004256 LY_CHECK_GOTO(ret, cleanup);
4257
4258 /* allocate return set */
Radek Krejciba03a5a2020-08-27 14:40:41 +02004259 ret = ly_set_new(set);
4260 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskoccc02342020-05-21 10:09:21 +02004261
4262 /* transform into ly_set */
4263 if (xp_set.type == LYXP_SET_NODE_SET) {
4264 /* allocate memory for all the elements once (even though not all items must be elements but most likely will be) */
4265 (*set)->objs = malloc(xp_set.used * sizeof *(*set)->objs);
Michal Vaskob7be7a82020-08-20 09:09:04 +02004266 LY_CHECK_ERR_GOTO(!(*set)->objs, LOGMEM(LYD_CTX(ctx_node)); ret = LY_EMEM, cleanup);
Michal Vaskoccc02342020-05-21 10:09:21 +02004267 (*set)->size = xp_set.used;
4268
4269 for (i = 0; i < xp_set.used; ++i) {
4270 if (xp_set.val.nodes[i].type == LYXP_NODE_ELEM) {
Radek Krejci3d92e442020-10-12 12:48:13 +02004271 ret = ly_set_add(*set, xp_set.val.nodes[i].node, 1, NULL);
Radek Krejciba03a5a2020-08-27 14:40:41 +02004272 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskoccc02342020-05-21 10:09:21 +02004273 }
4274 }
4275 }
4276
4277cleanup:
Michal Vasko0691d522020-05-21 13:21:47 +02004278 lyxp_set_free_content(&xp_set);
Michal Vaskob7be7a82020-08-20 09:09:04 +02004279 lyxp_expr_free((struct ly_ctx *)LYD_CTX(ctx_node), exp);
Radek Krejci8f45abc2020-11-26 12:15:13 +01004280 if (ret) {
4281 ly_set_free(*set, NULL);
4282 *set = NULL;
4283 }
Michal Vaskoccc02342020-05-21 10:09:21 +02004284 return ret;
4285}
Radek Krejcica989142020-11-05 11:32:22 +01004286
Michal Vasko3e1f6552021-01-14 09:27:55 +01004287API LY_ERR
4288lyd_find_path(const struct lyd_node *ctx_node, const char *path, ly_bool output, struct lyd_node **match)
4289{
4290 LY_ERR ret = LY_SUCCESS;
4291 struct lyxp_expr *expr = NULL;
4292 struct ly_path *lypath = NULL;
4293
4294 LY_CHECK_ARG_RET(NULL, ctx_node, ctx_node->schema, path, LY_EINVAL);
4295
4296 /* parse the path */
4297 ret = ly_path_parse(LYD_CTX(ctx_node), ctx_node->schema, path, strlen(path), LY_PATH_BEGIN_EITHER, LY_PATH_LREF_FALSE,
4298 LY_PATH_PREFIX_OPTIONAL, LY_PATH_PRED_SIMPLE, &expr);
4299 LY_CHECK_GOTO(ret, cleanup);
4300
4301 /* compile the path */
Radek Krejcid5d37432021-03-12 13:46:40 +01004302 ret = ly_path_compile(LYD_CTX(ctx_node), NULL, ctx_node->schema, NULL, expr, LY_PATH_LREF_FALSE,
Michal Vasko9eb821d2021-04-30 07:38:11 +02004303 output ? LY_PATH_OPER_OUTPUT : LY_PATH_OPER_INPUT, LY_PATH_TARGET_SINGLE, LY_VALUE_JSON, NULL, NULL, &lypath);
Michal Vasko3e1f6552021-01-14 09:27:55 +01004304 LY_CHECK_GOTO(ret, cleanup);
4305
4306 /* evaluate the path */
4307 ret = ly_path_eval_partial(lypath, ctx_node, NULL, match);
4308
4309cleanup:
4310 lyxp_expr_free(LYD_CTX(ctx_node), expr);
4311 ly_path_free(LYD_CTX(ctx_node), lypath);
4312 return ret;
4313}
4314
Radek Krejcica989142020-11-05 11:32:22 +01004315API uint32_t
4316lyd_list_pos(const struct lyd_node *instance)
4317{
4318 const struct lyd_node *iter = NULL;
4319 uint32_t pos = 0;
4320
4321 if (!instance || !(instance->schema->nodetype & (LYS_LIST | LYS_LEAFLIST))) {
4322 return 0;
4323 }
4324
4325 /* data instances are ordered, so we can stop when we found instance of other schema node */
4326 for (iter = instance; iter->schema == instance->schema; iter = iter->prev) {
Radek Krejcibb27df32020-11-13 15:39:16 +01004327 if (pos && (iter->next == NULL)) {
Radek Krejcica989142020-11-05 11:32:22 +01004328 /* overrun to the end of the siblings list */
4329 break;
4330 }
4331 ++pos;
4332 }
4333
4334 return pos;
4335}
Radek Krejci4233f9b2020-11-05 12:38:35 +01004336
4337API struct lyd_node *
4338lyd_first_sibling(const struct lyd_node *node)
4339{
4340 struct lyd_node *start;
4341
4342 if (!node) {
4343 return NULL;
4344 }
4345
4346 /* get the first sibling */
4347 if (node->parent) {
4348 start = node->parent->child;
4349 } else {
Radek Krejcibb27df32020-11-13 15:39:16 +01004350 for (start = (struct lyd_node *)node; start->prev->next; start = start->prev) {}
Radek Krejci4233f9b2020-11-05 12:38:35 +01004351 }
4352
4353 return start;
4354}