blob: d5099b3f9a4f55822a930ab0519a22e5945531cb [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
Jan Kundrátc6e39de2021-12-09 16:01:19 +0100158LIBYANG_API_DEF 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
Jan Kundrátc6e39de2021-12-09 16:01:19 +0100233LIBYANG_API_DEF 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
Jan Kundrátc6e39de2021-12-09 16:01:19 +0100259LIBYANG_API_DEF ly_bool
Radek Krejci19611252020-10-04 13:54:53 +0200260lyd_is_default(const struct lyd_node *node)
261{
262 const struct lysc_node_leaf *leaf;
263 const struct lysc_node_leaflist *llist;
264 const struct lyd_node_term *term;
265 LY_ARRAY_COUNT_TYPE u;
266
Michal Vasko39eb6882021-09-16 08:53:13 +0200267 if (!(node->schema->nodetype & LYD_NODE_TERM)) {
268 return 0;
269 }
270
Radek Krejci19611252020-10-04 13:54:53 +0200271 term = (const struct lyd_node_term *)node;
272
273 if (node->schema->nodetype == LYS_LEAF) {
274 leaf = (const struct lysc_node_leaf *)node->schema;
275 if (!leaf->dflt) {
276 return 0;
277 }
278
279 /* compare with the default value */
Michal Vasko39eb6882021-09-16 08:53:13 +0200280 if (!leaf->type->plugin->compare(&term->value, leaf->dflt)) {
281 return 1;
Radek Krejci19611252020-10-04 13:54:53 +0200282 }
283 } else {
284 llist = (const struct lysc_node_leaflist *)node->schema;
285 if (!llist->dflts) {
286 return 0;
287 }
288
289 LY_ARRAY_FOR(llist->dflts, u) {
290 /* compare with each possible default value */
Michal Vasko39eb6882021-09-16 08:53:13 +0200291 if (!llist->type->plugin->compare(&term->value, llist->dflts[u])) {
292 return 1;
Radek Krejci19611252020-10-04 13:54:53 +0200293 }
294 }
295 }
296
Michal Vasko39eb6882021-09-16 08:53:13 +0200297 return 0;
Radek Krejci19611252020-10-04 13:54:53 +0200298}
299
Radek Krejci7931b192020-06-25 17:05:03 +0200300static LYD_FORMAT
Michal Vasko63f3d842020-07-08 10:10:14 +0200301lyd_parse_get_format(const struct ly_in *in, LYD_FORMAT format)
Radek Krejcie7b95092019-05-15 11:03:07 +0200302{
Michal Vasko69730152020-10-09 16:30:07 +0200303 if (!format && (in->type == LY_IN_FILEPATH)) {
Radek Krejcie7b95092019-05-15 11:03:07 +0200304 /* unknown format - try to detect it from filename's suffix */
Radek Krejci7931b192020-06-25 17:05:03 +0200305 const char *path = in->method.fpath.filepath;
306 size_t len = strlen(path);
Radek Krejcie7b95092019-05-15 11:03:07 +0200307
308 /* ignore trailing whitespaces */
Michal Vaskod989ba02020-08-24 10:59:24 +0200309 for ( ; len > 0 && isspace(path[len - 1]); len--) {}
Radek Krejcie7b95092019-05-15 11:03:07 +0200310
Radek Krejcif13b87b2020-12-01 22:02:17 +0100311 if ((len >= LY_XML_SUFFIX_LEN + 1) &&
312 !strncmp(&path[len - LY_XML_SUFFIX_LEN], LY_XML_SUFFIX, LY_XML_SUFFIX_LEN)) {
Radek Krejcie7b95092019-05-15 11:03:07 +0200313 format = LYD_XML;
Radek Krejcif13b87b2020-12-01 22:02:17 +0100314 } else if ((len >= LY_JSON_SUFFIX_LEN + 1) &&
315 !strncmp(&path[len - LY_JSON_SUFFIX_LEN], LY_JSON_SUFFIX, LY_JSON_SUFFIX_LEN)) {
Radek Krejcie7b95092019-05-15 11:03:07 +0200316 format = LYD_JSON;
Radek Krejcif13b87b2020-12-01 22:02:17 +0100317 } else if ((len >= LY_LYB_SUFFIX_LEN + 1) &&
318 !strncmp(&path[len - LY_LYB_SUFFIX_LEN], LY_LYB_SUFFIX, LY_LYB_SUFFIX_LEN)) {
Radek Krejcie7b95092019-05-15 11:03:07 +0200319 format = LYD_LYB;
Radek Krejci7931b192020-06-25 17:05:03 +0200320 } /* else still unknown */
Radek Krejcie7b95092019-05-15 11:03:07 +0200321 }
322
Radek Krejci7931b192020-06-25 17:05:03 +0200323 return format;
324}
Radek Krejcie7b95092019-05-15 11:03:07 +0200325
Michal Vaskoe0665742021-02-11 11:08:44 +0100326/**
327 * @brief Parse YANG data into a data tree.
328 *
329 * @param[in] ctx libyang context.
Radek Krejcif16e2542021-02-17 15:39:23 +0100330 * @param[in] ext Optional extenion instance to parse data following the schema tree specified in the extension instance
Michal Vaskoe0665742021-02-11 11:08:44 +0100331 * @param[in] parent Parent to connect the parsed nodes to, if any.
332 * @param[in,out] first_p Pointer to the first top-level parsed node, used only if @p parent is NULL.
333 * @param[in] in Input handle to read the input from.
334 * @param[in] format Expected format of the data in @p in.
335 * @param[in] parse_opts Options for parser.
336 * @param[in] val_opts Options for validation.
337 * @param[out] op Optional pointer to the parsed operation, if any.
338 * @return LY_ERR value.
339 */
340static LY_ERR
Radek Krejcif16e2542021-02-17 15:39:23 +0100341lyd_parse(const struct ly_ctx *ctx, const struct lysc_ext_instance *ext, struct lyd_node *parent, struct lyd_node **first_p,
342 struct ly_in *in, LYD_FORMAT format, uint32_t parse_opts, uint32_t val_opts, struct lyd_node **op)
Radek Krejci7931b192020-06-25 17:05:03 +0200343{
Michal Vaskoe0665742021-02-11 11:08:44 +0100344 LY_ERR rc = LY_SUCCESS;
Radek Krejci1798aae2020-07-14 13:26:06 +0200345 struct lyd_ctx *lydctx = NULL;
Michal Vaskoe0665742021-02-11 11:08:44 +0100346 struct ly_set parsed = {0};
347 struct lyd_node *first;
348 uint32_t i;
Michal Vaskoaac267d2022-01-17 13:34:48 +0100349 ly_bool subtree_sibling = 0;
Radek Krejci1798aae2020-07-14 13:26:06 +0200350
Michal Vaskoe0665742021-02-11 11:08:44 +0100351 assert(ctx && (parent || first_p));
Radek Krejci7931b192020-06-25 17:05:03 +0200352
353 format = lyd_parse_get_format(in, format);
Michal Vaskoe0665742021-02-11 11:08:44 +0100354 if (first_p) {
355 *first_p = NULL;
356 }
Radek Krejci1798aae2020-07-14 13:26:06 +0200357
Michal Vasko63f3d842020-07-08 10:10:14 +0200358 /* remember input position */
359 in->func_start = in->current;
Radek Krejci7931b192020-06-25 17:05:03 +0200360
Michal Vaskoe0665742021-02-11 11:08:44 +0100361 /* parse the data */
Radek Krejci7931b192020-06-25 17:05:03 +0200362 switch (format) {
363 case LYD_XML:
Michal Vaskoaac267d2022-01-17 13:34:48 +0100364 rc = lyd_parse_xml(ctx, ext, parent, first_p, in, parse_opts, val_opts, LYD_TYPE_DATA_YANG, NULL, &parsed,
365 &subtree_sibling, &lydctx);
Radek Krejci1798aae2020-07-14 13:26:06 +0200366 break;
Radek Krejci7931b192020-06-25 17:05:03 +0200367 case LYD_JSON:
Michal Vaskoaac267d2022-01-17 13:34:48 +0100368 rc = lyd_parse_json(ctx, ext, parent, first_p, in, parse_opts, val_opts, LYD_TYPE_DATA_YANG, &parsed,
369 &subtree_sibling, &lydctx);
Radek Krejci1798aae2020-07-14 13:26:06 +0200370 break;
Radek Krejci7931b192020-06-25 17:05:03 +0200371 case LYD_LYB:
Michal Vaskoaac267d2022-01-17 13:34:48 +0100372 rc = lyd_parse_lyb(ctx, ext, parent, first_p, in, parse_opts, val_opts, LYD_TYPE_DATA_YANG, &parsed,
373 &subtree_sibling, &lydctx);
Radek Krejci1798aae2020-07-14 13:26:06 +0200374 break;
Michal Vaskoc8a230d2020-08-14 12:17:10 +0200375 case LYD_UNKNOWN:
Michal Vaskod74978f2021-02-12 11:59:36 +0100376 LOGARG(ctx, format);
377 rc = LY_EINVAL;
Michal Vaskoe0665742021-02-11 11:08:44 +0100378 break;
379 }
380 LY_CHECK_GOTO(rc, cleanup);
381
382 if (parent) {
383 /* get first top-level sibling */
384 for (first = parent; first->parent; first = lyd_parent(first)) {}
385 first = lyd_first_sibling(first);
386 first_p = &first;
Radek Krejci7931b192020-06-25 17:05:03 +0200387 }
388
Michal Vaskoe0665742021-02-11 11:08:44 +0100389 if (!(parse_opts & LYD_PARSE_ONLY)) {
390 /* validate data */
Michal Vaskoaac267d2022-01-17 13:34:48 +0100391 rc = lyd_validate(first_p, NULL, ctx, val_opts, 0, &lydctx->node_when, &lydctx->node_types, &lydctx->meta_types,
392 &lydctx->ext_val, NULL);
Michal Vaskoe0665742021-02-11 11:08:44 +0100393 LY_CHECK_GOTO(rc, cleanup);
394 }
Radek Krejci7931b192020-06-25 17:05:03 +0200395
Michal Vaskoe0665742021-02-11 11:08:44 +0100396 /* set the operation node */
397 if (op) {
398 *op = lydctx->op_node;
Radek Krejci1798aae2020-07-14 13:26:06 +0200399 }
400
401cleanup:
Michal Vaskoe0665742021-02-11 11:08:44 +0100402 if (lydctx) {
403 lydctx->free(lydctx);
Radek Krejci1798aae2020-07-14 13:26:06 +0200404 }
Michal Vaskoe0665742021-02-11 11:08:44 +0100405 if (rc) {
406 if (parent) {
407 /* free all the parsed subtrees */
408 for (i = 0; i < parsed.count; ++i) {
409 lyd_free_tree(parsed.dnodes[i]);
410 }
411 } else {
412 /* free everything */
413 lyd_free_all(*first_p);
414 *first_p = NULL;
415 }
Michal Vaskoaac267d2022-01-17 13:34:48 +0100416 } else if (subtree_sibling) {
417 rc = LY_ENOT;
Michal Vaskoe0665742021-02-11 11:08:44 +0100418 }
419 ly_set_erase(&parsed, NULL);
420 return rc;
Radek Krejci7931b192020-06-25 17:05:03 +0200421}
422
Jan Kundrátc6e39de2021-12-09 16:01:19 +0100423LIBYANG_API_DEF LY_ERR
Radek Krejcif16e2542021-02-17 15:39:23 +0100424lyd_parse_ext_data(const struct lysc_ext_instance *ext, struct lyd_node *parent, struct ly_in *in, LYD_FORMAT format,
425 uint32_t parse_options, uint32_t validate_options, struct lyd_node **tree)
426{
427 const struct ly_ctx *ctx = ext ? ext->module->ctx : NULL;
428
429 LY_CHECK_ARG_RET(ctx, ext, in, parent || tree, LY_EINVAL);
430 LY_CHECK_ARG_RET(ctx, !(parse_options & ~LYD_PARSE_OPTS_MASK), LY_EINVAL);
431 LY_CHECK_ARG_RET(ctx, !(validate_options & ~LYD_VALIDATE_OPTS_MASK), LY_EINVAL);
432
433 return lyd_parse(ctx, ext, parent, tree, in, format, parse_options, validate_options, NULL);
434}
435
Jan Kundrátc6e39de2021-12-09 16:01:19 +0100436LIBYANG_API_DEF LY_ERR
Michal Vaskoe0665742021-02-11 11:08:44 +0100437lyd_parse_data(const struct ly_ctx *ctx, struct lyd_node *parent, struct ly_in *in, LYD_FORMAT format,
438 uint32_t parse_options, uint32_t validate_options, struct lyd_node **tree)
439{
440 LY_CHECK_ARG_RET(ctx, ctx, in, parent || tree, LY_EINVAL);
441 LY_CHECK_ARG_RET(ctx, !(parse_options & ~LYD_PARSE_OPTS_MASK), LY_EINVAL);
442 LY_CHECK_ARG_RET(ctx, !(validate_options & ~LYD_VALIDATE_OPTS_MASK), LY_EINVAL);
443
Radek Krejcif16e2542021-02-17 15:39:23 +0100444 return lyd_parse(ctx, NULL, parent, tree, in, format, parse_options, validate_options, NULL);
Michal Vaskoe0665742021-02-11 11:08:44 +0100445}
446
Jan Kundrátc6e39de2021-12-09 16:01:19 +0100447LIBYANG_API_DEF LY_ERR
Michal Vaskoe0665742021-02-11 11:08:44 +0100448lyd_parse_data_mem(const struct ly_ctx *ctx, const char *data, LYD_FORMAT format, uint32_t parse_options,
449 uint32_t validate_options, struct lyd_node **tree)
Radek Krejci7931b192020-06-25 17:05:03 +0200450{
451 LY_ERR ret;
452 struct ly_in *in;
453
454 LY_CHECK_RET(ly_in_new_memory(data, &in));
Michal Vaskoe0665742021-02-11 11:08:44 +0100455 ret = lyd_parse_data(ctx, NULL, in, format, parse_options, validate_options, tree);
Radek Krejci7931b192020-06-25 17:05:03 +0200456
457 ly_in_free(in, 0);
458 return ret;
459}
460
Jan Kundrátc6e39de2021-12-09 16:01:19 +0100461LIBYANG_API_DEF LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +0200462lyd_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 +0200463 struct lyd_node **tree)
Radek Krejci7931b192020-06-25 17:05:03 +0200464{
465 LY_ERR ret;
466 struct ly_in *in;
467
468 LY_CHECK_RET(ly_in_new_fd(fd, &in));
Michal Vaskoe0665742021-02-11 11:08:44 +0100469 ret = lyd_parse_data(ctx, NULL, in, format, parse_options, validate_options, tree);
Radek Krejci7931b192020-06-25 17:05:03 +0200470
471 ly_in_free(in, 0);
472 return ret;
473}
474
Jan Kundrátc6e39de2021-12-09 16:01:19 +0100475LIBYANG_API_DEF LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +0200476lyd_parse_data_path(const struct ly_ctx *ctx, const char *path, LYD_FORMAT format, uint32_t parse_options,
477 uint32_t validate_options, struct lyd_node **tree)
Radek Krejci7931b192020-06-25 17:05:03 +0200478{
479 LY_ERR ret;
480 struct ly_in *in;
481
482 LY_CHECK_RET(ly_in_new_filepath(path, 0, &in));
Michal Vaskoe0665742021-02-11 11:08:44 +0100483 ret = lyd_parse_data(ctx, NULL, in, format, parse_options, validate_options, tree);
Radek Krejci7931b192020-06-25 17:05:03 +0200484
485 ly_in_free(in, 0);
486 return ret;
487}
488
Radek Krejcif16e2542021-02-17 15:39:23 +0100489/**
490 * @brief Parse YANG data into an operation data tree, in case the extension instance is specified, keep the searching
491 * for schema nodes locked inside the extension instance.
492 *
493 * At least one of @p parent, @p tree, or @p op must always be set.
494 *
495 * Specific @p data_type values have different parameter meaning as follows:
496 * - ::LYD_TYPE_RPC_NETCONF:
497 * - @p parent - must be NULL, the whole RPC is expected;
498 * - @p format - must be ::LYD_XML, NETCONF supports only this format;
499 * - @p tree - must be provided, all the NETCONF-specific XML envelopes will be returned here as
500 * a separate opaque data tree, even if the function fails, this may be returned;
501 * - @p op - must be provided, the RPC/action data tree itself will be returned here, pointing to the operation;
502 *
503 * - ::LYD_TYPE_NOTIF_NETCONF:
504 * - @p parent - must be NULL, the whole notification is expected;
505 * - @p format - must be ::LYD_XML, NETCONF supports only this format;
506 * - @p tree - must be provided, all the NETCONF-specific XML envelopes will be returned here as
507 * a separate opaque data tree, even if the function fails, this may be returned;
508 * - @p op - must be provided, the notification data tree itself will be returned here, pointing to the operation;
509 *
510 * - ::LYD_TYPE_REPLY_NETCONF:
511 * - @p parent - must be set, pointing to the invoked RPC operation (RPC or action) node;
512 * - @p format - must be ::LYD_XML, NETCONF supports only this format;
513 * - @p tree - must be provided, all the NETCONF-specific XML envelopes will be returned here as
514 * a separate opaque data tree, even if the function fails, this may be returned;
515 * - @p op - must be NULL, the reply is appended to the RPC;
516 * Note that there are 3 kinds of NETCONF replies - ok, error, and data. Only data reply appends any nodes to the RPC.
517 *
518 * @param[in] ctx libyang context.
519 * @param[in] ext Extension instance providing the specific schema tree to match with the data being parsed.
520 * @param[in] parent Optional parent to connect the parsed nodes to.
521 * @param[in] in Input handle to read the input from.
522 * @param[in] format Expected format of the data in @p in.
523 * @param[in] data_type Expected operation to parse (@ref datatype).
524 * @param[out] tree Optional full parsed data tree. If @p parent is set, set to NULL.
525 * @param[out] op Optional parsed operation node.
526 * @return LY_ERR value.
527 * @return LY_ENOT if @p data_type is a NETCONF message and the root XML element is not the expected one.
528 */
529static LY_ERR
530lyd_parse_op_(const struct ly_ctx *ctx, const struct lysc_ext_instance *ext, struct lyd_node *parent,
531 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 +0200532{
Michal Vaskoe0665742021-02-11 11:08:44 +0100533 LY_ERR rc = LY_SUCCESS;
534 struct lyd_ctx *lydctx = NULL;
535 struct ly_set parsed = {0};
536 struct lyd_node *first = NULL, *envp = NULL;
537 uint32_t i, parse_opts, val_opts;
Radek Krejci7931b192020-06-25 17:05:03 +0200538
Michal Vasko27fb0262021-02-23 09:42:01 +0100539 if (!ctx) {
540 ctx = LYD_CTX(parent);
541 }
Radek Krejci1798aae2020-07-14 13:26:06 +0200542 if (tree) {
543 *tree = NULL;
544 }
545 if (op) {
546 *op = NULL;
547 }
548
Radek Krejci7931b192020-06-25 17:05:03 +0200549 format = lyd_parse_get_format(in, format);
Radek Krejci7931b192020-06-25 17:05:03 +0200550
Michal Vasko63f3d842020-07-08 10:10:14 +0200551 /* remember input position */
552 in->func_start = in->current;
553
Michal Vaskoe0665742021-02-11 11:08:44 +0100554 /* check params based on the data type */
Michal Vasko1e4c68e2021-02-18 15:03:01 +0100555 if ((data_type == LYD_TYPE_RPC_NETCONF) || (data_type == LYD_TYPE_NOTIF_NETCONF)) {
Michal Vaskoe0665742021-02-11 11:08:44 +0100556 LY_CHECK_ARG_RET(ctx, format == LYD_XML, !parent, tree, op, LY_EINVAL);
Michal Vasko1e4c68e2021-02-18 15:03:01 +0100557 } else if (data_type == LYD_TYPE_REPLY_NETCONF) {
558 LY_CHECK_ARG_RET(ctx, format == LYD_XML, parent, parent->schema->nodetype & (LYS_RPC | LYS_ACTION), tree, !op,
559 LY_EINVAL);
Michal Vaskoe0665742021-02-11 11:08:44 +0100560 }
Michal Vasko9da78cf2021-07-21 13:45:10 +0200561 parse_opts = LYD_PARSE_ONLY | LYD_PARSE_OPAQ;
Michal Vaskoe0665742021-02-11 11:08:44 +0100562 val_opts = 0;
563
564 /* parse the data */
Radek Krejci7931b192020-06-25 17:05:03 +0200565 switch (format) {
566 case LYD_XML:
Michal Vaskoaac267d2022-01-17 13:34:48 +0100567 rc = lyd_parse_xml(ctx, ext, parent, &first, in, parse_opts, val_opts, data_type, &envp, &parsed, NULL, &lydctx);
Michal Vasko299d5d12021-02-16 16:36:37 +0100568 if (rc && envp) {
569 /* special situation when the envelopes were parsed successfully */
570 if (tree) {
571 *tree = envp;
572 }
573 ly_set_erase(&parsed, NULL);
574 return rc;
575 }
Michal Vaskoe0665742021-02-11 11:08:44 +0100576 break;
Radek Krejci7931b192020-06-25 17:05:03 +0200577 case LYD_JSON:
Michal Vaskoaac267d2022-01-17 13:34:48 +0100578 rc = lyd_parse_json(ctx, ext, parent, &first, in, parse_opts, val_opts, data_type, &parsed, NULL, &lydctx);
Michal Vaskoe0665742021-02-11 11:08:44 +0100579 break;
Radek Krejci7931b192020-06-25 17:05:03 +0200580 case LYD_LYB:
Michal Vaskoaac267d2022-01-17 13:34:48 +0100581 rc = lyd_parse_lyb(ctx, ext, parent, &first, in, parse_opts, val_opts, data_type, &parsed, NULL, &lydctx);
Michal Vaskoe0665742021-02-11 11:08:44 +0100582 break;
Michal Vaskoc8a230d2020-08-14 12:17:10 +0200583 case LYD_UNKNOWN:
Michal Vaskod74978f2021-02-12 11:59:36 +0100584 LOGARG(ctx, format);
585 rc = LY_EINVAL;
Michal Vaskoc8a230d2020-08-14 12:17:10 +0200586 break;
Radek Krejci7931b192020-06-25 17:05:03 +0200587 }
Michal Vaskoe0665742021-02-11 11:08:44 +0100588 LY_CHECK_GOTO(rc, cleanup);
Radek Krejci7931b192020-06-25 17:05:03 +0200589
Michal Vaskoe0665742021-02-11 11:08:44 +0100590 /* set out params correctly */
591 if (tree) {
592 if (envp) {
593 /* special out param meaning */
594 *tree = envp;
595 } else {
596 *tree = parent ? NULL : first;
597 }
598 }
599 if (op) {
600 *op = lydctx->op_node;
601 }
602
603cleanup:
604 if (lydctx) {
605 lydctx->free(lydctx);
606 }
607 if (rc) {
608 if (parent) {
609 /* free all the parsed subtrees */
610 for (i = 0; i < parsed.count; ++i) {
611 lyd_free_tree(parsed.dnodes[i]);
612 }
613 } else {
614 /* free everything (cannot occur in the current code, a safety) */
615 lyd_free_all(first);
616 if (tree) {
617 *tree = NULL;
618 }
619 if (op) {
620 *op = NULL;
621 }
622 }
623 }
624 ly_set_erase(&parsed, NULL);
625 return rc;
Radek Krejcie7b95092019-05-15 11:03:07 +0200626}
Radek Krejci084289f2019-07-09 17:35:30 +0200627
Jan Kundrátc6e39de2021-12-09 16:01:19 +0100628LIBYANG_API_DEF LY_ERR
Radek Krejcif16e2542021-02-17 15:39:23 +0100629lyd_parse_op(const struct ly_ctx *ctx, 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 LY_CHECK_ARG_RET(ctx, ctx || parent, in, data_type, parent || tree || op, LY_EINVAL);
633
634 return lyd_parse_op_(ctx, NULL, parent, in, format, data_type, tree, op);
635}
636
Jan Kundrátc6e39de2021-12-09 16:01:19 +0100637LIBYANG_API_DEF LY_ERR
Radek Krejcif16e2542021-02-17 15:39:23 +0100638lyd_parse_ext_op(const struct lysc_ext_instance *ext, struct lyd_node *parent, struct ly_in *in, LYD_FORMAT format,
639 enum lyd_type data_type, struct lyd_node **tree, struct lyd_node **op)
640{
641 const struct ly_ctx *ctx = ext ? ext->module->ctx : NULL;
642
643 LY_CHECK_ARG_RET(ctx, ext, in, data_type, parent || tree || op, LY_EINVAL);
644
645 return lyd_parse_op_(ctx, ext, parent, in, format, data_type, tree, op);
646}
647
Michal Vasko90932a92020-02-12 14:33:03 +0100648LY_ERR
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200649lyd_create_term(const struct lysc_node *schema, const char *value, size_t value_len, ly_bool *dynamic,
Radek Krejci8df109d2021-04-23 12:19:08 +0200650 LY_VALUE_FORMAT format, void *prefix_data, uint32_t hints, ly_bool *incomplete, struct lyd_node **node)
Michal Vasko90932a92020-02-12 14:33:03 +0100651{
652 LY_ERR ret;
653 struct lyd_node_term *term;
654
Michal Vasko9b368d32020-02-14 13:53:31 +0100655 assert(schema->nodetype & LYD_NODE_TERM);
656
Michal Vasko90932a92020-02-12 14:33:03 +0100657 term = calloc(1, sizeof *term);
658 LY_CHECK_ERR_RET(!term, LOGMEM(schema->module->ctx), LY_EMEM);
659
660 term->schema = schema;
Michal Vasko9e685082021-01-29 14:49:09 +0100661 term->prev = &term->node;
Michal Vasko9b368d32020-02-14 13:53:31 +0100662 term->flags = LYD_NEW;
Michal Vasko90932a92020-02-12 14:33:03 +0100663
Radek Krejciddace2c2021-01-08 11:30:56 +0100664 LOG_LOCSET(schema, NULL, NULL, NULL);
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200665 ret = lyd_value_store(schema->module->ctx, &term->value, ((struct lysc_node_leaf *)term->schema)->type, value,
Radek Krejci2efc45b2020-12-22 16:25:44 +0100666 value_len, dynamic, format, prefix_data, hints, schema, incomplete);
Radek Krejciddace2c2021-01-08 11:30:56 +0100667 LOG_LOCBACK(1, 0, 0, 0);
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200668 LY_CHECK_ERR_RET(ret, free(term), ret);
Michal Vasko9e685082021-01-29 14:49:09 +0100669 lyd_hash(&term->node);
Michal Vasko9b368d32020-02-14 13:53:31 +0100670
Michal Vasko9e685082021-01-29 14:49:09 +0100671 *node = &term->node;
Michal Vasko9b368d32020-02-14 13:53:31 +0100672 return ret;
673}
674
675LY_ERR
676lyd_create_term2(const struct lysc_node *schema, const struct lyd_value *val, struct lyd_node **node)
677{
678 LY_ERR ret;
679 struct lyd_node_term *term;
680 struct lysc_type *type;
681
682 assert(schema->nodetype & LYD_NODE_TERM);
Radek Krejci224d4b42021-04-23 13:54:59 +0200683 assert(val && val->realtype);
Michal Vasko9b368d32020-02-14 13:53:31 +0100684
685 term = calloc(1, sizeof *term);
686 LY_CHECK_ERR_RET(!term, LOGMEM(schema->module->ctx), LY_EMEM);
687
688 term->schema = schema;
Michal Vasko9e685082021-01-29 14:49:09 +0100689 term->prev = &term->node;
Michal Vasko9b368d32020-02-14 13:53:31 +0100690 term->flags = LYD_NEW;
691
692 type = ((struct lysc_node_leaf *)schema)->type;
693 ret = type->plugin->duplicate(schema->module->ctx, val, &term->value);
694 if (ret) {
695 LOGERR(schema->module->ctx, ret, "Value duplication failed.");
696 free(term);
697 return ret;
698 }
Michal Vasko9e685082021-01-29 14:49:09 +0100699 lyd_hash(&term->node);
Michal Vasko90932a92020-02-12 14:33:03 +0100700
Michal Vasko9e685082021-01-29 14:49:09 +0100701 *node = &term->node;
Michal Vasko90932a92020-02-12 14:33:03 +0100702 return ret;
703}
704
705LY_ERR
706lyd_create_inner(const struct lysc_node *schema, struct lyd_node **node)
707{
708 struct lyd_node_inner *in;
709
Michal Vasko9b368d32020-02-14 13:53:31 +0100710 assert(schema->nodetype & LYD_NODE_INNER);
711
Michal Vasko90932a92020-02-12 14:33:03 +0100712 in = calloc(1, sizeof *in);
713 LY_CHECK_ERR_RET(!in, LOGMEM(schema->module->ctx), LY_EMEM);
714
715 in->schema = schema;
Michal Vasko9e685082021-01-29 14:49:09 +0100716 in->prev = &in->node;
Michal Vasko9b368d32020-02-14 13:53:31 +0100717 in->flags = LYD_NEW;
Michal Vasko3383be72020-11-03 17:15:31 +0100718 if ((schema->nodetype == LYS_CONTAINER) && !(schema->flags & LYS_PRESENCE)) {
719 in->flags |= LYD_DEFAULT;
720 }
Michal Vasko90932a92020-02-12 14:33:03 +0100721
Michal Vasko9b368d32020-02-14 13:53:31 +0100722 /* do not hash list with keys, we need them for the hash */
723 if ((schema->nodetype != LYS_LIST) || (schema->flags & LYS_KEYLESS)) {
Michal Vasko9e685082021-01-29 14:49:09 +0100724 lyd_hash(&in->node);
Michal Vasko9b368d32020-02-14 13:53:31 +0100725 }
Michal Vasko90932a92020-02-12 14:33:03 +0100726
Michal Vasko9e685082021-01-29 14:49:09 +0100727 *node = &in->node;
Michal Vasko90932a92020-02-12 14:33:03 +0100728 return LY_SUCCESS;
729}
730
Michal Vasko90932a92020-02-12 14:33:03 +0100731LY_ERR
Michal Vasko004d3152020-06-11 19:59:22 +0200732lyd_create_list(const struct lysc_node *schema, const struct ly_path_predicate *predicates, struct lyd_node **node)
Michal Vasko90932a92020-02-12 14:33:03 +0100733{
734 LY_ERR ret = LY_SUCCESS;
Michal Vasko90932a92020-02-12 14:33:03 +0100735 struct lyd_node *list = NULL, *key;
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200736 LY_ARRAY_COUNT_TYPE u;
Michal Vasko90932a92020-02-12 14:33:03 +0100737
Michal Vasko004d3152020-06-11 19:59:22 +0200738 assert((schema->nodetype == LYS_LIST) && !(schema->flags & LYS_KEYLESS));
Michal Vasko90932a92020-02-12 14:33:03 +0100739
740 /* create list */
741 LY_CHECK_GOTO(ret = lyd_create_inner(schema, &list), cleanup);
742
Radek Krejciddace2c2021-01-08 11:30:56 +0100743 LOG_LOCSET(NULL, list, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100744
Michal Vasko90932a92020-02-12 14:33:03 +0100745 /* create and insert all the keys */
Michal Vasko004d3152020-06-11 19:59:22 +0200746 LY_ARRAY_FOR(predicates, u) {
747 LY_CHECK_GOTO(ret = lyd_create_term2(predicates[u].key, &predicates[u].value, &key), cleanup);
Michal Vasko6ee6f432021-07-16 09:49:14 +0200748 lyd_insert_node(list, NULL, key, 0);
Michal Vasko90932a92020-02-12 14:33:03 +0100749 }
750
Michal Vasko9b368d32020-02-14 13:53:31 +0100751 /* hash having all the keys */
752 lyd_hash(list);
753
Michal Vasko90932a92020-02-12 14:33:03 +0100754 /* success */
755 *node = list;
756 list = NULL;
757
758cleanup:
Radek Krejciddace2c2021-01-08 11:30:56 +0100759 LOG_LOCBACK(0, 1, 0, 0);
Michal Vasko90932a92020-02-12 14:33:03 +0100760 lyd_free_tree(list);
Michal Vasko004d3152020-06-11 19:59:22 +0200761 return ret;
762}
763
764static LY_ERR
765lyd_create_list2(const struct lysc_node *schema, const char *keys, size_t keys_len, struct lyd_node **node)
766{
767 LY_ERR ret = LY_SUCCESS;
768 struct lyxp_expr *expr = NULL;
769 uint16_t exp_idx = 0;
770 enum ly_path_pred_type pred_type = 0;
771 struct ly_path_predicate *predicates = NULL;
772
Radek Krejciddace2c2021-01-08 11:30:56 +0100773 LOG_LOCSET(schema, NULL, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100774
Michal Vasko004d3152020-06-11 19:59:22 +0200775 /* parse keys */
Michal Vasko6b26e742020-07-17 15:02:10 +0200776 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 +0200777 LY_PATH_PRED_KEYS, &expr), cleanup);
Michal Vasko004d3152020-06-11 19:59:22 +0200778
779 /* compile them */
Radek Krejci8df109d2021-04-23 12:19:08 +0200780 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 +0200781 NULL, &predicates, &pred_type), cleanup);
Michal Vasko004d3152020-06-11 19:59:22 +0200782
783 /* create the list node */
784 LY_CHECK_GOTO(ret = lyd_create_list(schema, predicates, node), cleanup);
785
786cleanup:
Radek Krejciddace2c2021-01-08 11:30:56 +0100787 LOG_LOCBACK(1, 0, 0, 0);
Michal Vasko004d3152020-06-11 19:59:22 +0200788 lyxp_expr_free(schema->module->ctx, expr);
Michal Vaskof7e16e22020-10-21 09:24:39 +0200789 ly_path_predicates_free(schema->module->ctx, pred_type, predicates);
Michal Vasko90932a92020-02-12 14:33:03 +0100790 return ret;
791}
792
793LY_ERR
Michal Vasko366a4a12020-12-04 16:23:57 +0100794lyd_create_any(const struct lysc_node *schema, const void *value, LYD_ANYDATA_VALUETYPE value_type, ly_bool use_value,
795 struct lyd_node **node)
Michal Vasko90932a92020-02-12 14:33:03 +0100796{
Michal Vasko366a4a12020-12-04 16:23:57 +0100797 LY_ERR ret;
Michal Vasko90932a92020-02-12 14:33:03 +0100798 struct lyd_node_any *any;
Michal Vasko366a4a12020-12-04 16:23:57 +0100799 union lyd_any_value any_val;
Michal Vasko90932a92020-02-12 14:33:03 +0100800
Michal Vasko9b368d32020-02-14 13:53:31 +0100801 assert(schema->nodetype & LYD_NODE_ANY);
802
Michal Vasko90932a92020-02-12 14:33:03 +0100803 any = calloc(1, sizeof *any);
804 LY_CHECK_ERR_RET(!any, LOGMEM(schema->module->ctx), LY_EMEM);
805
806 any->schema = schema;
Michal Vasko9e685082021-01-29 14:49:09 +0100807 any->prev = &any->node;
Michal Vasko9b368d32020-02-14 13:53:31 +0100808 any->flags = LYD_NEW;
Michal Vasko90932a92020-02-12 14:33:03 +0100809
Radek Krejci1798aae2020-07-14 13:26:06 +0200810 /* TODO: convert XML/JSON strings into a opaq data tree */
Michal Vasko366a4a12020-12-04 16:23:57 +0100811
812 if (use_value) {
813 any->value.str = value;
814 any->value_type = value_type;
815 } else {
816 any_val.str = value;
Michal Vasko9e685082021-01-29 14:49:09 +0100817 ret = lyd_any_copy_value(&any->node, &any_val, value_type);
Michal Vasko366a4a12020-12-04 16:23:57 +0100818 LY_CHECK_ERR_RET(ret, free(any), ret);
819 }
Michal Vasko9e685082021-01-29 14:49:09 +0100820 lyd_hash(&any->node);
Michal Vasko90932a92020-02-12 14:33:03 +0100821
Michal Vasko9e685082021-01-29 14:49:09 +0100822 *node = &any->node;
Michal Vasko90932a92020-02-12 14:33:03 +0100823 return LY_SUCCESS;
824}
825
Michal Vasko52927e22020-03-16 17:26:14 +0100826LY_ERR
Michal Vasko501af032020-11-11 20:27:44 +0100827lyd_create_opaq(const struct ly_ctx *ctx, const char *name, size_t name_len, const char *prefix, size_t pref_len,
828 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 +0200829 LY_VALUE_FORMAT format, void *val_prefix_data, uint32_t hints, struct lyd_node **node)
Michal Vasko52927e22020-03-16 17:26:14 +0100830{
Radek Krejci011e4aa2020-09-04 15:22:31 +0200831 LY_ERR ret = LY_SUCCESS;
Michal Vasko52927e22020-03-16 17:26:14 +0100832 struct lyd_node_opaq *opaq;
833
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200834 assert(ctx && name && name_len && format);
Michal Vasko52927e22020-03-16 17:26:14 +0100835
Michal Vasko4cd0a602021-05-31 11:11:58 +0200836 if (!value_len && (!dynamic || !*dynamic)) {
Michal Vasko52927e22020-03-16 17:26:14 +0100837 value = "";
838 }
839
840 opaq = calloc(1, sizeof *opaq);
Michal Vasko501af032020-11-11 20:27:44 +0100841 LY_CHECK_ERR_GOTO(!opaq, LOGMEM(ctx); ret = LY_EMEM, finish);
Michal Vasko52927e22020-03-16 17:26:14 +0100842
Michal Vasko9e685082021-01-29 14:49:09 +0100843 opaq->prev = &opaq->node;
Michal Vaskoad92b672020-11-12 13:11:31 +0100844 LY_CHECK_GOTO(ret = lydict_insert(ctx, name, name_len, &opaq->name.name), finish);
Radek Krejci011e4aa2020-09-04 15:22:31 +0200845
Michal Vasko52927e22020-03-16 17:26:14 +0100846 if (pref_len) {
Michal Vaskoad92b672020-11-12 13:11:31 +0100847 LY_CHECK_GOTO(ret = lydict_insert(ctx, prefix, pref_len, &opaq->name.prefix), finish);
Michal Vasko52927e22020-03-16 17:26:14 +0100848 }
Radek Krejci1798aae2020-07-14 13:26:06 +0200849 if (module_key_len) {
Michal Vaskoad92b672020-11-12 13:11:31 +0100850 LY_CHECK_GOTO(ret = lydict_insert(ctx, module_key, module_key_len, &opaq->name.module_ns), finish);
Radek Krejci1798aae2020-07-14 13:26:06 +0200851 }
Michal Vasko52927e22020-03-16 17:26:14 +0100852 if (dynamic && *dynamic) {
Radek Krejci011e4aa2020-09-04 15:22:31 +0200853 LY_CHECK_GOTO(ret = lydict_insert_zc(ctx, (char *)value, &opaq->value), finish);
Michal Vasko52927e22020-03-16 17:26:14 +0100854 *dynamic = 0;
855 } else {
Radek Krejci011e4aa2020-09-04 15:22:31 +0200856 LY_CHECK_GOTO(ret = lydict_insert(ctx, value, value_len, &opaq->value), finish);
Michal Vasko52927e22020-03-16 17:26:14 +0100857 }
Michal Vasko501af032020-11-11 20:27:44 +0100858
859 opaq->format = format;
860 opaq->val_prefix_data = val_prefix_data;
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200861 opaq->hints = hints;
Michal Vasko52927e22020-03-16 17:26:14 +0100862 opaq->ctx = ctx;
863
Radek Krejci011e4aa2020-09-04 15:22:31 +0200864finish:
865 if (ret) {
Michal Vasko9e685082021-01-29 14:49:09 +0100866 lyd_free_tree(&opaq->node);
Michal Vasko501af032020-11-11 20:27:44 +0100867 ly_free_prefix_data(format, val_prefix_data);
Radek Krejci011e4aa2020-09-04 15:22:31 +0200868 } else {
Michal Vasko9e685082021-01-29 14:49:09 +0100869 *node = &opaq->node;
Radek Krejci011e4aa2020-09-04 15:22:31 +0200870 }
871 return ret;
Michal Vasko52927e22020-03-16 17:26:14 +0100872}
873
Jan Kundrátc6e39de2021-12-09 16:01:19 +0100874LIBYANG_API_DEF LY_ERR
Michal Vasko65243892020-12-04 16:26:21 +0100875lyd_new_inner(struct lyd_node *parent, const struct lys_module *module, const char *name, ly_bool output,
876 struct lyd_node **node)
Michal Vasko013a8182020-03-03 10:46:53 +0100877{
878 struct lyd_node *ret = NULL;
879 const struct lysc_node *schema;
Michal Vasko1d80a532021-11-24 10:41:05 +0100880 const struct ly_ctx *ctx = parent ? LYD_CTX(parent) : (module ? module->ctx : NULL);
Michal Vasko013a8182020-03-03 10:46:53 +0100881
Michal Vasko6027eb92020-07-15 16:37:30 +0200882 LY_CHECK_ARG_RET(ctx, parent || module, parent || node, name, LY_EINVAL);
Michal Vasko1d80a532021-11-24 10:41:05 +0100883 LY_CHECK_CTX_EQUAL_RET(parent ? LYD_CTX(parent) : NULL, module ? module->ctx : NULL, LY_EINVAL);
Michal Vasko013a8182020-03-03 10:46:53 +0100884
Michal Vaskof03ed032020-03-04 13:31:44 +0100885 if (!module) {
886 module = parent->schema->module;
887 }
888
Michal Vasko3a41dff2020-07-15 14:30:28 +0200889 schema = lys_find_child(parent ? parent->schema : NULL, module, name, 0,
Radek Krejci41ac9942020-11-02 14:47:56 +0100890 LYS_CONTAINER | LYS_NOTIF | LYS_RPC | LYS_ACTION, output ? LYS_GETNEXT_OUTPUT : 0);
Radek Krejcidd2a7662021-03-12 11:26:34 +0100891 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 +0100892
Michal Vasko3a41dff2020-07-15 14:30:28 +0200893 LY_CHECK_RET(lyd_create_inner(schema, &ret));
894 if (parent) {
Michal Vasko6ee6f432021-07-16 09:49:14 +0200895 lyd_insert_node(parent, NULL, ret, 0);
Michal Vasko013a8182020-03-03 10:46:53 +0100896 }
Michal Vasko3a41dff2020-07-15 14:30:28 +0200897
898 if (node) {
899 *node = ret;
900 }
901 return LY_SUCCESS;
Michal Vasko013a8182020-03-03 10:46:53 +0100902}
903
Jan Kundrátc6e39de2021-12-09 16:01:19 +0100904LIBYANG_API_DEF LY_ERR
Radek Krejcidd2a7662021-03-12 11:26:34 +0100905lyd_new_ext_inner(const struct lysc_ext_instance *ext, const char *name, struct lyd_node **node)
906{
907 struct lyd_node *ret = NULL;
908 const struct lysc_node *schema;
909 struct ly_ctx *ctx = ext ? ext->module->ctx : NULL;
910
911 LY_CHECK_ARG_RET(ctx, ext, node, name, LY_EINVAL);
912
913 schema = lysc_ext_find_node(ext, NULL, name, 0, LYS_CONTAINER | LYS_NOTIF | LYS_RPC | LYS_ACTION, 0);
914 if (!schema) {
915 if (ext->argument) {
916 LOGERR(ctx, LY_EINVAL, "Inner node (not a list) \"%s\" not found in instance \"%s\" of extension %s.",
917 name, ext->argument, ext->def->name);
918 } else {
919 LOGERR(ctx, LY_EINVAL, "Inner node (not a list) \"%s\" not found in instance of extension %s.",
920 name, ext->def->name);
921 }
922 return LY_ENOTFOUND;
923 }
924 LY_CHECK_RET(lyd_create_inner(schema, &ret));
925
926 *node = ret;
927
928 return LY_SUCCESS;
929}
930
Michal Vasko208e6d62021-06-28 11:23:50 +0200931/**
932 * @brief Create a new list node in the data tree.
933 *
934 * @param[in] parent Parent node for the node being created. NULL in case of creating a top level element.
935 * @param[in] module Module of the node being created. If NULL, @p parent module will be used.
936 * @param[in] name Schema node name of the new data node. The node must be #LYS_LIST.
937 * @param[in] format Format of key values.
938 * @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
939 * taken into consideration. Otherwise, the output's data node is going to be created.
940 * @param[out] node Optional created node.
941 * @param[in] ap Ordered key values of the new list instance, all must be set. For ::LY_VALUE_LYB, every value must
942 * be followed by the value length.
943 * @return LY_ERR value.
944 */
945static LY_ERR
946_lyd_new_list(struct lyd_node *parent, const struct lys_module *module, const char *name, LY_VALUE_FORMAT format,
947 ly_bool output, struct lyd_node **node, va_list ap)
Michal Vasko013a8182020-03-03 10:46:53 +0100948{
949 struct lyd_node *ret = NULL, *key;
950 const struct lysc_node *schema, *key_s;
Michal Vasko1d80a532021-11-24 10:41:05 +0100951 const struct ly_ctx *ctx = parent ? LYD_CTX(parent) : (module ? module->ctx : NULL);
Michal Vasko208e6d62021-06-28 11:23:50 +0200952 const void *key_val;
953 uint32_t key_len;
Michal Vasko013a8182020-03-03 10:46:53 +0100954 LY_ERR rc = LY_SUCCESS;
955
Michal Vasko6027eb92020-07-15 16:37:30 +0200956 LY_CHECK_ARG_RET(ctx, parent || module, parent || node, name, LY_EINVAL);
Michal Vasko1d80a532021-11-24 10:41:05 +0100957 LY_CHECK_CTX_EQUAL_RET(parent ? LYD_CTX(parent) : NULL, module ? module->ctx : NULL, LY_EINVAL);
Michal Vasko013a8182020-03-03 10:46:53 +0100958
Michal Vaskof03ed032020-03-04 13:31:44 +0100959 if (!module) {
960 module = parent->schema->module;
961 }
962
Radek Krejci41ac9942020-11-02 14:47:56 +0100963 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 +0200964 LY_CHECK_ERR_RET(!schema, LOGERR(ctx, LY_EINVAL, "List node \"%s\" not found.", name), LY_ENOTFOUND);
Michal Vasko013a8182020-03-03 10:46:53 +0100965
966 /* create list inner node */
Michal Vasko3a41dff2020-07-15 14:30:28 +0200967 LY_CHECK_RET(lyd_create_inner(schema, &ret));
Michal Vasko013a8182020-03-03 10:46:53 +0100968
Michal Vasko013a8182020-03-03 10:46:53 +0100969 /* create and insert all the keys */
Michal Vasko544e58a2021-01-28 14:33:41 +0100970 for (key_s = lysc_node_child(schema); key_s && (key_s->flags & LYS_KEY); key_s = key_s->next) {
Michal Vasko208e6d62021-06-28 11:23:50 +0200971 if (format == LY_VALUE_LYB) {
972 key_val = va_arg(ap, const void *);
973 key_len = va_arg(ap, uint32_t);
974 } else {
975 key_val = va_arg(ap, const char *);
976 key_len = key_val ? strlen((char *)key_val) : 0;
977 }
Michal Vasko013a8182020-03-03 10:46:53 +0100978
Michal Vasko208e6d62021-06-28 11:23:50 +0200979 rc = lyd_create_term(key_s, key_val, key_len, NULL, format, NULL, LYD_HINT_DATA, NULL, &key);
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200980 LY_CHECK_GOTO(rc, cleanup);
Michal Vasko6ee6f432021-07-16 09:49:14 +0200981 lyd_insert_node(ret, NULL, key, 1);
Michal Vasko013a8182020-03-03 10:46:53 +0100982 }
983
Michal Vasko013a8182020-03-03 10:46:53 +0100984 if (parent) {
Michal Vasko6ee6f432021-07-16 09:49:14 +0200985 lyd_insert_node(parent, NULL, ret, 0);
Michal Vasko013a8182020-03-03 10:46:53 +0100986 }
987
988cleanup:
989 if (rc) {
990 lyd_free_tree(ret);
991 ret = NULL;
Michal Vasko3a41dff2020-07-15 14:30:28 +0200992 } else if (node) {
993 *node = ret;
Michal Vasko013a8182020-03-03 10:46:53 +0100994 }
Michal Vasko3a41dff2020-07-15 14:30:28 +0200995 return rc;
Michal Vasko013a8182020-03-03 10:46:53 +0100996}
997
Jan Kundrátc6e39de2021-12-09 16:01:19 +0100998LIBYANG_API_DEF LY_ERR
Michal Vasko208e6d62021-06-28 11:23:50 +0200999lyd_new_list(struct lyd_node *parent, const struct lys_module *module, const char *name, ly_bool output,
1000 struct lyd_node **node, ...)
1001{
1002 LY_ERR rc;
1003 va_list ap;
1004
1005 va_start(ap, node);
1006
1007 rc = _lyd_new_list(parent, module, name, LY_VALUE_JSON, output, node, ap);
1008
1009 va_end(ap);
1010 return rc;
1011}
1012
Jan Kundrátc6e39de2021-12-09 16:01:19 +01001013LIBYANG_API_DEF LY_ERR
Michal Vasko208e6d62021-06-28 11:23:50 +02001014lyd_new_list_bin(struct lyd_node *parent, const struct lys_module *module, const char *name, ly_bool output,
1015 struct lyd_node **node, ...)
1016{
1017 LY_ERR rc;
1018 va_list ap;
1019
1020 va_start(ap, node);
1021
1022 rc = _lyd_new_list(parent, module, name, LY_VALUE_LYB, output, node, ap);
1023
1024 va_end(ap);
1025 return rc;
1026}
1027
Jan Kundrátc6e39de2021-12-09 16:01:19 +01001028LIBYANG_API_DEF LY_ERR
Michal Vasko208e6d62021-06-28 11:23:50 +02001029lyd_new_list_canon(struct lyd_node *parent, const struct lys_module *module, const char *name, ly_bool output,
1030 struct lyd_node **node, ...)
1031{
1032 LY_ERR rc;
1033 va_list ap;
1034
1035 va_start(ap, node);
1036
1037 rc = _lyd_new_list(parent, module, name, LY_VALUE_CANON, output, node, ap);
1038
1039 va_end(ap);
1040 return rc;
1041}
1042
Jan Kundrátc6e39de2021-12-09 16:01:19 +01001043LIBYANG_API_DEF LY_ERR
Radek Krejci8247bae2021-03-12 11:47:02 +01001044lyd_new_ext_list(const struct lysc_ext_instance *ext, const char *name, struct lyd_node **node, ...)
1045{
1046 struct lyd_node *ret = NULL, *key;
1047 const struct lysc_node *schema, *key_s;
1048 struct ly_ctx *ctx = ext ? ext->module->ctx : NULL;
1049 va_list ap;
1050 const char *key_val;
1051 LY_ERR rc = LY_SUCCESS;
1052
1053 LY_CHECK_ARG_RET(ctx, ext, node, name, LY_EINVAL);
1054
1055 schema = lysc_ext_find_node(ext, NULL, name, 0, LYS_LIST, 0);
1056 if (!schema) {
1057 if (ext->argument) {
1058 LOGERR(ctx, LY_EINVAL, "List node \"%s\" not found in instance \"%s\" of extension %s.",
1059 name, ext->argument, ext->def->name);
1060 } else {
1061 LOGERR(ctx, LY_EINVAL, "List node \"%s\" not found in instance of extension %s.", name, ext->def->name);
1062 }
1063 return LY_ENOTFOUND;
1064 }
1065 /* create list inner node */
1066 LY_CHECK_RET(lyd_create_inner(schema, &ret));
1067
1068 va_start(ap, node);
1069
1070 /* create and insert all the keys */
1071 for (key_s = lysc_node_child(schema); key_s && (key_s->flags & LYS_KEY); key_s = key_s->next) {
1072 key_val = va_arg(ap, const char *);
1073
Radek Krejci8df109d2021-04-23 12:19:08 +02001074 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 +01001075 NULL, &key);
1076 LY_CHECK_GOTO(rc, cleanup);
Michal Vasko6ee6f432021-07-16 09:49:14 +02001077 lyd_insert_node(ret, NULL, key, 1);
Radek Krejci8247bae2021-03-12 11:47:02 +01001078 }
1079
1080cleanup:
1081 va_end(ap);
1082 if (rc) {
1083 lyd_free_tree(ret);
1084 ret = NULL;
Radek Krejci8247bae2021-03-12 11:47:02 +01001085 }
Radek Krejci8919fbd2021-03-15 09:35:25 +01001086 *node = ret;
Radek Krejci8247bae2021-03-12 11:47:02 +01001087 return rc;
1088}
1089
Jan Kundrátc6e39de2021-12-09 16:01:19 +01001090LIBYANG_API_DEF LY_ERR
Michal Vasko3a41dff2020-07-15 14:30:28 +02001091lyd_new_list2(struct lyd_node *parent, const struct lys_module *module, const char *name, const char *keys,
Radek Krejci41ac9942020-11-02 14:47:56 +01001092 ly_bool output, struct lyd_node **node)
Michal Vasko013a8182020-03-03 10:46:53 +01001093{
1094 struct lyd_node *ret = NULL;
1095 const struct lysc_node *schema;
Michal Vasko1d80a532021-11-24 10:41:05 +01001096 const struct ly_ctx *ctx = parent ? LYD_CTX(parent) : (module ? module->ctx : NULL);
Michal Vasko013a8182020-03-03 10:46:53 +01001097
Michal Vasko6027eb92020-07-15 16:37:30 +02001098 LY_CHECK_ARG_RET(ctx, parent || module, parent || node, name, LY_EINVAL);
Michal Vasko1d80a532021-11-24 10:41:05 +01001099 LY_CHECK_CTX_EQUAL_RET(parent ? LYD_CTX(parent) : NULL, module ? module->ctx : NULL, LY_EINVAL);
Michal Vasko013a8182020-03-03 10:46:53 +01001100
Michal Vaskof03ed032020-03-04 13:31:44 +01001101 if (!module) {
1102 module = parent->schema->module;
1103 }
Michal Vasko004d3152020-06-11 19:59:22 +02001104 if (!keys) {
1105 keys = "";
1106 }
Michal Vaskof03ed032020-03-04 13:31:44 +01001107
Michal Vasko004d3152020-06-11 19:59:22 +02001108 /* find schema node */
Radek Krejci41ac9942020-11-02 14:47:56 +01001109 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 +02001110 LY_CHECK_ERR_RET(!schema, LOGERR(ctx, LY_EINVAL, "List node \"%s\" not found.", name), LY_ENOTFOUND);
Michal Vasko013a8182020-03-03 10:46:53 +01001111
Michal Vasko004d3152020-06-11 19:59:22 +02001112 if ((schema->flags & LYS_KEYLESS) && !keys[0]) {
1113 /* key-less list */
Michal Vasko3a41dff2020-07-15 14:30:28 +02001114 LY_CHECK_RET(lyd_create_inner(schema, &ret));
Michal Vasko004d3152020-06-11 19:59:22 +02001115 } else {
1116 /* create the list node */
Michal Vasko3a41dff2020-07-15 14:30:28 +02001117 LY_CHECK_RET(lyd_create_list2(schema, keys, strlen(keys), &ret));
Michal Vasko004d3152020-06-11 19:59:22 +02001118 }
Michal Vasko004d3152020-06-11 19:59:22 +02001119 if (parent) {
Michal Vasko6ee6f432021-07-16 09:49:14 +02001120 lyd_insert_node(parent, NULL, ret, 0);
Michal Vasko013a8182020-03-03 10:46:53 +01001121 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02001122
1123 if (node) {
1124 *node = ret;
1125 }
1126 return LY_SUCCESS;
Michal Vasko013a8182020-03-03 10:46:53 +01001127}
1128
Radek Krejci09c77442021-04-26 11:10:34 +02001129/**
1130 * @brief Create a new term node in the data tree.
1131 *
1132 * @param[in] parent Parent node for the node being created. NULL in case of creating a top level element.
1133 * @param[in] module Module of the node being created. If NULL, @p parent module will be used.
1134 * @param[in] name Schema node name of the new data node. The node can be ::LYS_LEAF or ::LYS_LEAFLIST.
1135 * @param[in] value Value of the node being created.
1136 * @param[in] value_len Length of @p value.
1137 * @param[in] format Format of @p value.
1138 * @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
1139 * taken into consideration. Otherwise, the output's data node is going to be created.
1140 * @param[out] node Optional created node.
1141 * @return LY_ERR value.
1142 */
1143static LY_ERR
1144_lyd_new_term(struct lyd_node *parent, const struct lys_module *module, const char *name, const void *value,
1145 size_t value_len, LY_VALUE_FORMAT format, ly_bool output, struct lyd_node **node)
Michal Vasko013a8182020-03-03 10:46:53 +01001146{
Michal Vaskocbff3e92020-05-27 12:56:41 +02001147 LY_ERR rc;
Michal Vasko013a8182020-03-03 10:46:53 +01001148 struct lyd_node *ret = NULL;
1149 const struct lysc_node *schema;
Radek Krejci09c77442021-04-26 11:10:34 +02001150 const struct ly_ctx *ctx = parent ? LYD_CTX(parent) : (module ? module->ctx : NULL);
Michal Vasko013a8182020-03-03 10:46:53 +01001151
Michal Vasko6027eb92020-07-15 16:37:30 +02001152 LY_CHECK_ARG_RET(ctx, parent || module, parent || node, name, LY_EINVAL);
Michal Vasko1d80a532021-11-24 10:41:05 +01001153 LY_CHECK_CTX_EQUAL_RET(parent ? LYD_CTX(parent) : NULL, module ? module->ctx : NULL, LY_EINVAL);
Michal Vasko013a8182020-03-03 10:46:53 +01001154
Michal Vaskof03ed032020-03-04 13:31:44 +01001155 if (!module) {
1156 module = parent->schema->module;
1157 }
1158
Radek Krejci41ac9942020-11-02 14:47:56 +01001159 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 +02001160 LY_CHECK_ERR_RET(!schema, LOGERR(ctx, LY_EINVAL, "Term node \"%s\" not found.", name), LY_ENOTFOUND);
Michal Vasko013a8182020-03-03 10:46:53 +01001161
Radek Krejci09c77442021-04-26 11:10:34 +02001162 rc = lyd_create_term(schema, value, value_len, NULL, format, NULL, LYD_HINT_DATA, NULL, &ret);
Michal Vaskofeca4fb2020-10-05 08:58:40 +02001163 LY_CHECK_RET(rc);
Michal Vaskocbff3e92020-05-27 12:56:41 +02001164 if (parent) {
Michal Vasko6ee6f432021-07-16 09:49:14 +02001165 lyd_insert_node(parent, NULL, ret, 0);
Michal Vasko013a8182020-03-03 10:46:53 +01001166 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02001167
1168 if (node) {
1169 *node = ret;
1170 }
1171 return LY_SUCCESS;
Michal Vasko013a8182020-03-03 10:46:53 +01001172}
1173
Jan Kundrátc6e39de2021-12-09 16:01:19 +01001174LIBYANG_API_DEF LY_ERR
Radek Krejci09c77442021-04-26 11:10:34 +02001175lyd_new_term(struct lyd_node *parent, const struct lys_module *module, const char *name, const char *val_str,
1176 ly_bool output, struct lyd_node **node)
1177{
1178 return _lyd_new_term(parent, module, name, val_str, val_str ? strlen(val_str) : 0, LY_VALUE_JSON, output, node);
1179}
1180
Jan Kundrátc6e39de2021-12-09 16:01:19 +01001181LIBYANG_API_DEF LY_ERR
Radek Krejci09c77442021-04-26 11:10:34 +02001182lyd_new_term_bin(struct lyd_node *parent, const struct lys_module *module, const char *name, const void *value,
1183 size_t value_len, ly_bool output, struct lyd_node **node)
1184{
1185 return _lyd_new_term(parent, module, name, value, value_len, LY_VALUE_LYB, output, node);
1186}
1187
Jan Kundrátc6e39de2021-12-09 16:01:19 +01001188LIBYANG_API_DEF LY_ERR
Radek Krejci09c77442021-04-26 11:10:34 +02001189lyd_new_term_canon(struct lyd_node *parent, const struct lys_module *module, const char *name, const char *val_str,
1190 ly_bool output, struct lyd_node **node)
1191{
1192 return _lyd_new_term(parent, module, name, val_str, val_str ? strlen(val_str) : 0, LY_VALUE_CANON, output, node);
1193}
1194
Jan Kundrátc6e39de2021-12-09 16:01:19 +01001195LIBYANG_API_DEF LY_ERR
Radek Krejci8a5afc22021-03-12 11:10:47 +01001196lyd_new_ext_term(const struct lysc_ext_instance *ext, const char *name, const char *val_str, struct lyd_node **node)
1197{
1198 LY_ERR rc;
1199 struct lyd_node *ret = NULL;
1200 const struct lysc_node *schema;
1201 struct ly_ctx *ctx = ext ? ext->module->ctx : NULL;
1202
1203 LY_CHECK_ARG_RET(ctx, ext, node, name, LY_EINVAL);
1204
1205 schema = lysc_ext_find_node(ext, NULL, name, 0, LYD_NODE_TERM, 0);
1206 if (!schema) {
1207 if (ext->argument) {
1208 LOGERR(ctx, LY_EINVAL, "Term node \"%s\" not found in instance \"%s\" of extension %s.",
1209 name, ext->argument, ext->def->name);
1210 } else {
1211 LOGERR(ctx, LY_EINVAL, "Term node \"%s\" not found in instance of extension %s.", name, ext->def->name);
1212 }
1213 return LY_ENOTFOUND;
1214 }
Radek Krejci8df109d2021-04-23 12:19:08 +02001215 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 +01001216 LY_CHECK_RET(rc);
1217
1218 *node = ret;
1219
1220 return LY_SUCCESS;
1221}
1222
Jan Kundrátc6e39de2021-12-09 16:01:19 +01001223LIBYANG_API_DEF LY_ERR
Michal Vasko2a4ab2b2021-03-04 15:52:40 +01001224lyd_new_any(struct lyd_node *parent, const struct lys_module *module, const char *name, const void *value,
1225 ly_bool use_value, LYD_ANYDATA_VALUETYPE value_type, ly_bool output, struct lyd_node **node)
Michal Vasko013a8182020-03-03 10:46:53 +01001226{
1227 struct lyd_node *ret = NULL;
1228 const struct lysc_node *schema;
Michal Vasko1d80a532021-11-24 10:41:05 +01001229 const struct ly_ctx *ctx = parent ? LYD_CTX(parent) : (module ? module->ctx : NULL);
Michal Vasko013a8182020-03-03 10:46:53 +01001230
Michal Vasko6027eb92020-07-15 16:37:30 +02001231 LY_CHECK_ARG_RET(ctx, parent || module, parent || node, name, LY_EINVAL);
Michal Vasko1d80a532021-11-24 10:41:05 +01001232 LY_CHECK_CTX_EQUAL_RET(parent ? LYD_CTX(parent) : NULL, module ? module->ctx : NULL, LY_EINVAL);
Michal Vasko013a8182020-03-03 10:46:53 +01001233
Michal Vaskof03ed032020-03-04 13:31:44 +01001234 if (!module) {
1235 module = parent->schema->module;
1236 }
1237
Radek Krejci41ac9942020-11-02 14:47:56 +01001238 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 +02001239 LY_CHECK_ERR_RET(!schema, LOGERR(ctx, LY_EINVAL, "Any node \"%s\" not found.", name), LY_ENOTFOUND);
Michal Vasko013a8182020-03-03 10:46:53 +01001240
Michal Vasko2a4ab2b2021-03-04 15:52:40 +01001241 LY_CHECK_RET(lyd_create_any(schema, value, value_type, use_value, &ret));
Michal Vasko3a41dff2020-07-15 14:30:28 +02001242 if (parent) {
Michal Vasko6ee6f432021-07-16 09:49:14 +02001243 lyd_insert_node(parent, NULL, ret, 0);
Michal Vasko013a8182020-03-03 10:46:53 +01001244 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02001245
1246 if (node) {
1247 *node = ret;
1248 }
1249 return LY_SUCCESS;
Michal Vasko013a8182020-03-03 10:46:53 +01001250}
1251
Jan Kundrátc6e39de2021-12-09 16:01:19 +01001252LIBYANG_API_DEF LY_ERR
Radek Krejci0b963da2021-03-12 13:23:44 +01001253lyd_new_ext_any(const struct lysc_ext_instance *ext, const char *name, const void *value, ly_bool use_value,
1254 LYD_ANYDATA_VALUETYPE value_type, struct lyd_node **node)
1255{
1256 struct lyd_node *ret = NULL;
1257 const struct lysc_node *schema;
1258 struct ly_ctx *ctx = ext ? ext->module->ctx : NULL;
1259
1260 LY_CHECK_ARG_RET(ctx, ext, node, name, LY_EINVAL);
1261
1262 schema = lysc_ext_find_node(ext, NULL, name, 0, LYD_NODE_ANY, 0);
1263 if (!schema) {
1264 if (ext->argument) {
1265 LOGERR(ctx, LY_EINVAL, "Any node \"%s\" not found in instance \"%s\" of extension %s.",
1266 name, ext->argument, ext->def->name);
1267 } else {
1268 LOGERR(ctx, LY_EINVAL, "Any node \"%s\" not found in instance of extension %s.", name, ext->def->name);
1269 }
1270 return LY_ENOTFOUND;
1271 }
1272 LY_CHECK_RET(lyd_create_any(schema, value, value_type, use_value, &ret));
1273
1274 *node = ret;
1275
1276 return LY_SUCCESS;
1277}
1278
Jan Kundrátc6e39de2021-12-09 16:01:19 +01001279LIBYANG_API_DEF LY_ERR
Michal Vasko871a0252020-11-11 18:35:24 +01001280lyd_new_meta(const struct ly_ctx *ctx, struct lyd_node *parent, const struct lys_module *module, const char *name,
1281 const char *val_str, ly_bool clear_dflt, struct lyd_meta **meta)
Michal Vaskod86997b2020-05-26 15:19:54 +02001282{
Michal Vaskod86997b2020-05-26 15:19:54 +02001283 const char *prefix, *tmp;
Michal Vaskod86997b2020-05-26 15:19:54 +02001284 size_t pref_len, name_len;
1285
Michal Vasko2b5344c2021-02-26 10:12:05 +01001286 LY_CHECK_ARG_RET(ctx, ctx || parent, name, module || strchr(name, ':'), parent || meta, LY_EINVAL);
Michal Vasko1d80a532021-11-24 10:41:05 +01001287 LY_CHECK_CTX_EQUAL_RET(ctx, parent ? LYD_CTX(parent) : NULL, module ? module->ctx : NULL, LY_EINVAL);
Michal Vasko2b5344c2021-02-26 10:12:05 +01001288 if (!ctx) {
1289 ctx = LYD_CTX(parent);
1290 }
Michal Vasko00cbf532020-06-15 13:58:47 +02001291
Michal Vasko871a0252020-11-11 18:35:24 +01001292 if (parent && !parent->schema) {
Michal Vasko33b4fab2021-03-04 15:56:12 +01001293 LOGERR(ctx, LY_EINVAL, "Cannot add metadata \"%s\" to an opaque node \"%s\".", name, LYD_NAME(parent));
Michal Vasko871a0252020-11-11 18:35:24 +01001294 return LY_EINVAL;
1295 }
Michal Vasko610553d2020-11-18 18:15:05 +01001296 if (meta) {
1297 *meta = NULL;
1298 }
Michal Vaskod86997b2020-05-26 15:19:54 +02001299
1300 /* parse the name */
1301 tmp = name;
1302 if (ly_parse_nodeid(&tmp, &prefix, &pref_len, &name, &name_len) || tmp[0]) {
1303 LOGERR(ctx, LY_EINVAL, "Metadata name \"%s\" is not valid.", name);
Michal Vasko871a0252020-11-11 18:35:24 +01001304 return LY_EINVAL;
Michal Vaskod86997b2020-05-26 15:19:54 +02001305 }
1306
1307 /* find the module */
1308 if (prefix) {
Radek Krejci0ad51f12020-07-16 12:08:12 +02001309 module = ly_ctx_get_module_implemented2(ctx, prefix, pref_len);
Radek Krejci422afb12021-03-04 16:38:16 +01001310 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 +02001311 }
1312
1313 /* set value if none */
1314 if (!val_str) {
1315 val_str = "";
1316 }
1317
Radek Krejci8df109d2021-04-23 12:19:08 +02001318 return lyd_create_meta(parent, meta, module, name, name_len, val_str, strlen(val_str), NULL, LY_VALUE_JSON,
Michal Vaskoaac267d2022-01-17 13:34:48 +01001319 NULL, LYD_HINT_DATA, parent ? parent->schema : NULL, clear_dflt, NULL);
Michal Vasko871a0252020-11-11 18:35:24 +01001320}
Michal Vasko3a41dff2020-07-15 14:30:28 +02001321
Jan Kundrátc6e39de2021-12-09 16:01:19 +01001322LIBYANG_API_DEF LY_ERR
Michal Vaskoba696702020-11-11 19:12:45 +01001323lyd_new_meta2(const struct ly_ctx *ctx, struct lyd_node *parent, ly_bool clear_dflt, const struct lyd_attr *attr,
1324 struct lyd_meta **meta)
1325{
1326 const struct lys_module *mod;
1327
1328 LY_CHECK_ARG_RET(NULL, ctx, attr, parent || meta, LY_EINVAL);
Michal Vasko1d80a532021-11-24 10:41:05 +01001329 LY_CHECK_CTX_EQUAL_RET(ctx, parent ? LYD_CTX(parent) : NULL, LY_EINVAL);
Michal Vaskoba696702020-11-11 19:12:45 +01001330
1331 if (parent && !parent->schema) {
1332 LOGERR(ctx, LY_EINVAL, "Cannot add metadata to an opaque node \"%s\".", ((struct lyd_node_opaq *)parent)->name);
1333 return LY_EINVAL;
Michal Vasko3a41dff2020-07-15 14:30:28 +02001334 }
Michal Vasko610553d2020-11-18 18:15:05 +01001335 if (meta) {
1336 *meta = NULL;
1337 }
Michal Vaskoba696702020-11-11 19:12:45 +01001338
1339 switch (attr->format) {
Radek Krejci8df109d2021-04-23 12:19:08 +02001340 case LY_VALUE_XML:
Michal Vaskoad92b672020-11-12 13:11:31 +01001341 mod = ly_ctx_get_module_implemented_ns(ctx, attr->name.module_ns);
Michal Vaskoba696702020-11-11 19:12:45 +01001342 if (!mod) {
Michal Vaskoad92b672020-11-12 13:11:31 +01001343 LOGERR(ctx, LY_EINVAL, "Module with namespace \"%s\" not found.", attr->name.module_ns);
Michal Vaskoba696702020-11-11 19:12:45 +01001344 return LY_ENOTFOUND;
1345 }
1346 break;
Radek Krejci8df109d2021-04-23 12:19:08 +02001347 case LY_VALUE_JSON:
Michal Vaskoad92b672020-11-12 13:11:31 +01001348 mod = ly_ctx_get_module_implemented(ctx, attr->name.module_name);
Michal Vaskoba696702020-11-11 19:12:45 +01001349 if (!mod) {
Michal Vaskoad92b672020-11-12 13:11:31 +01001350 LOGERR(ctx, LY_EINVAL, "Module \"%s\" not found.", attr->name.module_name);
Michal Vaskoba696702020-11-11 19:12:45 +01001351 return LY_ENOTFOUND;
1352 }
1353 break;
1354 default:
1355 LOGINT_RET(ctx);
1356 }
1357
Michal Vaskoad92b672020-11-12 13:11:31 +01001358 return lyd_create_meta(parent, meta, mod, attr->name.name, strlen(attr->name.name), attr->value, strlen(attr->value),
Michal Vaskoaac267d2022-01-17 13:34:48 +01001359 NULL, attr->format, attr->val_prefix_data, attr->hints, parent ? parent->schema : NULL, clear_dflt, NULL);
Michal Vaskod86997b2020-05-26 15:19:54 +02001360}
1361
Jan Kundrátc6e39de2021-12-09 16:01:19 +01001362LIBYANG_API_DEF LY_ERR
Michal Vasko00cbf532020-06-15 13:58:47 +02001363lyd_new_opaq(struct lyd_node *parent, const struct ly_ctx *ctx, const char *name, const char *value,
Michal Vasko0ab974d2021-02-24 13:18:26 +01001364 const char *prefix, const char *module_name, struct lyd_node **node)
Michal Vasko00cbf532020-06-15 13:58:47 +02001365{
1366 struct lyd_node *ret = NULL;
Radek Krejci07a55962021-03-02 20:16:43 +01001367
Michal Vasko0ab974d2021-02-24 13:18:26 +01001368 LY_CHECK_ARG_RET(ctx, parent || ctx, parent || node, name, module_name, !prefix || !strcmp(prefix, module_name), LY_EINVAL);
Michal Vasko1d80a532021-11-24 10:41:05 +01001369 LY_CHECK_CTX_EQUAL_RET(ctx, parent ? LYD_CTX(parent) : NULL, LY_EINVAL);
Michal Vasko00cbf532020-06-15 13:58:47 +02001370
1371 if (!ctx) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001372 ctx = LYD_CTX(parent);
Michal Vasko00cbf532020-06-15 13:58:47 +02001373 }
1374 if (!value) {
1375 value = "";
1376 }
1377
Michal Vasko0ab974d2021-02-24 13:18:26 +01001378 LY_CHECK_RET(lyd_create_opaq(ctx, name, strlen(name), prefix, prefix ? strlen(prefix) : 0, module_name,
Radek Krejci8df109d2021-04-23 12:19:08 +02001379 strlen(module_name), value, strlen(value), NULL, LY_VALUE_JSON, NULL, 0, &ret));
Michal Vasko3a41dff2020-07-15 14:30:28 +02001380 if (parent) {
Michal Vasko6ee6f432021-07-16 09:49:14 +02001381 lyd_insert_node(parent, NULL, ret, 1);
Michal Vasko00cbf532020-06-15 13:58:47 +02001382 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02001383
1384 if (node) {
1385 *node = ret;
1386 }
1387 return LY_SUCCESS;
Michal Vasko00cbf532020-06-15 13:58:47 +02001388}
1389
Jan Kundrátc6e39de2021-12-09 16:01:19 +01001390LIBYANG_API_DEF LY_ERR
Michal Vasko8d65f852021-02-17 11:28:13 +01001391lyd_new_opaq2(struct lyd_node *parent, const struct ly_ctx *ctx, const char *name, const char *value,
Michal Vasko0ab974d2021-02-24 13:18:26 +01001392 const char *prefix, const char *module_ns, struct lyd_node **node)
Michal Vasko8d65f852021-02-17 11:28:13 +01001393{
1394 struct lyd_node *ret = NULL;
1395
1396 LY_CHECK_ARG_RET(ctx, parent || ctx, parent || node, name, module_ns, LY_EINVAL);
Michal Vasko1d80a532021-11-24 10:41:05 +01001397 LY_CHECK_CTX_EQUAL_RET(ctx, parent ? LYD_CTX(parent) : NULL, LY_EINVAL);
Michal Vasko8d65f852021-02-17 11:28:13 +01001398
1399 if (!ctx) {
1400 ctx = LYD_CTX(parent);
1401 }
1402 if (!value) {
1403 value = "";
1404 }
1405
Michal Vasko0ab974d2021-02-24 13:18:26 +01001406 LY_CHECK_RET(lyd_create_opaq(ctx, name, strlen(name), prefix, prefix ? strlen(prefix) : 0, module_ns,
Radek Krejci8df109d2021-04-23 12:19:08 +02001407 strlen(module_ns), value, strlen(value), NULL, LY_VALUE_XML, NULL, 0, &ret));
Michal Vasko8d65f852021-02-17 11:28:13 +01001408 if (parent) {
Michal Vasko6ee6f432021-07-16 09:49:14 +02001409 lyd_insert_node(parent, NULL, ret, 1);
Michal Vasko8d65f852021-02-17 11:28:13 +01001410 }
1411
1412 if (node) {
1413 *node = ret;
1414 }
1415 return LY_SUCCESS;
1416}
1417
Jan Kundrátc6e39de2021-12-09 16:01:19 +01001418LIBYANG_API_DEF LY_ERR
Michal Vasko8d65f852021-02-17 11:28:13 +01001419lyd_new_attr(struct lyd_node *parent, const char *module_name, const char *name, const char *value,
Radek Krejci0f969882020-08-21 16:56:47 +02001420 struct lyd_attr **attr)
Michal Vasko00cbf532020-06-15 13:58:47 +02001421{
Radek Krejci1798aae2020-07-14 13:26:06 +02001422 struct lyd_attr *ret = NULL;
Michal Vasko00cbf532020-06-15 13:58:47 +02001423 const struct ly_ctx *ctx;
1424 const char *prefix, *tmp;
Michal Vasko51d21b82020-11-13 18:03:54 +01001425 size_t pref_len, name_len, mod_len;
Michal Vasko00cbf532020-06-15 13:58:47 +02001426
Michal Vasko3a41dff2020-07-15 14:30:28 +02001427 LY_CHECK_ARG_RET(NULL, parent, !parent->schema, name, LY_EINVAL);
Michal Vasko00cbf532020-06-15 13:58:47 +02001428
Michal Vaskob7be7a82020-08-20 09:09:04 +02001429 ctx = LYD_CTX(parent);
Michal Vasko00cbf532020-06-15 13:58:47 +02001430
1431 /* parse the name */
1432 tmp = name;
1433 if (ly_parse_nodeid(&tmp, &prefix, &pref_len, &name, &name_len) || tmp[0]) {
Michal Vaskob69b68c2021-02-17 11:18:16 +01001434 LOGERR(ctx, LY_EINVAL, "Attribute name \"%s\" is not valid.", name);
Michal Vasko3a41dff2020-07-15 14:30:28 +02001435 return LY_EVALID;
Michal Vasko00cbf532020-06-15 13:58:47 +02001436 }
1437
Michal Vaskoe137fc42021-07-22 11:53:13 +02001438 if ((pref_len == 3) && !strncmp(prefix, "xml", 3)) {
1439 /* not a prefix but special name */
1440 name = prefix;
1441 name_len += 1 + pref_len;
1442 prefix = NULL;
1443 pref_len = 0;
1444 }
1445
Michal Vasko51d21b82020-11-13 18:03:54 +01001446 /* get the module */
1447 if (module_name) {
1448 mod_len = strlen(module_name);
1449 } else {
1450 module_name = prefix;
1451 mod_len = pref_len;
1452 }
1453
Michal Vasko00cbf532020-06-15 13:58:47 +02001454 /* set value if none */
Michal Vasko8d65f852021-02-17 11:28:13 +01001455 if (!value) {
1456 value = "";
Michal Vasko00cbf532020-06-15 13:58:47 +02001457 }
1458
Michal Vasko8d65f852021-02-17 11:28:13 +01001459 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 +02001460 strlen(value), NULL, LY_VALUE_JSON, NULL, LYD_HINT_DATA));
Michal Vasko8d65f852021-02-17 11:28:13 +01001461
1462 if (attr) {
1463 *attr = ret;
1464 }
1465 return LY_SUCCESS;
1466}
1467
Jan Kundrátc6e39de2021-12-09 16:01:19 +01001468LIBYANG_API_DEF LY_ERR
Michal Vasko8d65f852021-02-17 11:28:13 +01001469lyd_new_attr2(struct lyd_node *parent, const char *module_ns, const char *name, const char *value,
1470 struct lyd_attr **attr)
1471{
1472 struct lyd_attr *ret = NULL;
1473 const struct ly_ctx *ctx;
1474 const char *prefix, *tmp;
1475 size_t pref_len, name_len;
1476
1477 LY_CHECK_ARG_RET(NULL, parent, !parent->schema, name, LY_EINVAL);
1478
1479 ctx = LYD_CTX(parent);
1480
1481 /* parse the name */
1482 tmp = name;
1483 if (ly_parse_nodeid(&tmp, &prefix, &pref_len, &name, &name_len) || tmp[0]) {
1484 LOGERR(ctx, LY_EINVAL, "Attribute name \"%s\" is not valid.", name);
1485 return LY_EVALID;
1486 }
1487
Michal Vaskoe137fc42021-07-22 11:53:13 +02001488 if ((pref_len == 3) && !strncmp(prefix, "xml", 3)) {
1489 /* not a prefix but special name */
1490 name = prefix;
1491 name_len += 1 + pref_len;
1492 prefix = NULL;
1493 pref_len = 0;
1494 }
1495
Michal Vasko8d65f852021-02-17 11:28:13 +01001496 /* set value if none */
1497 if (!value) {
1498 value = "";
1499 }
1500
1501 LY_CHECK_RET(lyd_create_attr(parent, &ret, ctx, name, name_len, prefix, pref_len, module_ns,
Radek Krejci8df109d2021-04-23 12:19:08 +02001502 module_ns ? strlen(module_ns) : 0, value, strlen(value), NULL, LY_VALUE_XML, NULL, LYD_HINT_DATA));
Michal Vasko3a41dff2020-07-15 14:30:28 +02001503
1504 if (attr) {
1505 *attr = ret;
1506 }
1507 return LY_SUCCESS;
Michal Vasko00cbf532020-06-15 13:58:47 +02001508}
1509
Radek Krejci09c77442021-04-26 11:10:34 +02001510/**
1511 * @brief Change the value of a term (leaf or leaf-list) node.
1512 *
1513 * Node changed this way is always considered explicitly set, meaning its default flag
1514 * is always cleared.
1515 *
1516 * @param[in] term Term node to change.
1517 * @param[in] value New value to set.
1518 * @param[in] value_len Length of @p value.
1519 * @param[in] format Format of @p value.
1520 * @return LY_SUCCESS if value was changed,
1521 * @return LY_EEXIST if value was the same and only the default flag was cleared,
1522 * @return LY_ENOT if the values were equal and no change occured,
1523 * @return LY_ERR value on other errors.
1524 */
1525static LY_ERR
1526_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 +02001527{
1528 LY_ERR ret = LY_SUCCESS;
1529 struct lysc_type *type;
1530 struct lyd_node_term *t;
1531 struct lyd_node *parent;
1532 struct lyd_value val = {0};
Radek Krejci857189e2020-09-01 13:26:36 +02001533 ly_bool dflt_change, val_change;
Michal Vasko00cbf532020-06-15 13:58:47 +02001534
Radek Krejci09c77442021-04-26 11:10:34 +02001535 assert(term && term->schema && (term->schema->nodetype & LYD_NODE_TERM));
Michal Vasko00cbf532020-06-15 13:58:47 +02001536
Michal Vasko00cbf532020-06-15 13:58:47 +02001537 t = (struct lyd_node_term *)term;
1538 type = ((struct lysc_node_leaf *)term->schema)->type;
1539
1540 /* parse the new value */
Radek Krejciddace2c2021-01-08 11:30:56 +01001541 LOG_LOCSET(term->schema, term, NULL, NULL);
Radek Krejci09c77442021-04-26 11:10:34 +02001542 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 +01001543 LOG_LOCBACK(term->schema ? 1 : 0, 1, 0, 0);
Michal Vaskofeca4fb2020-10-05 08:58:40 +02001544 LY_CHECK_GOTO(ret, cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001545
1546 /* compare original and new value */
1547 if (type->plugin->compare(&t->value, &val)) {
1548 /* values differ, switch them */
Michal Vaskob7be7a82020-08-20 09:09:04 +02001549 type->plugin->free(LYD_CTX(term), &t->value);
Michal Vasko00cbf532020-06-15 13:58:47 +02001550 t->value = val;
1551 memset(&val, 0, sizeof val);
1552 val_change = 1;
1553 } else {
1554 val_change = 0;
1555 }
1556
1557 /* always clear the default flag */
1558 if (term->flags & LYD_DEFAULT) {
Michal Vasko9e685082021-01-29 14:49:09 +01001559 for (parent = term; parent; parent = lyd_parent(parent)) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001560 parent->flags &= ~LYD_DEFAULT;
1561 }
1562 dflt_change = 1;
1563 } else {
1564 dflt_change = 0;
1565 }
1566
1567 if (val_change || dflt_change) {
1568 /* make the node non-validated */
1569 term->flags &= LYD_NEW;
1570 }
1571
1572 if (val_change) {
1573 if (term->schema->nodetype == LYS_LEAFLIST) {
1574 /* leaf-list needs to be hashed again and re-inserted into parent */
1575 lyd_unlink_hash(term);
1576 lyd_hash(term);
1577 LY_CHECK_GOTO(ret = lyd_insert_hash(term), cleanup);
1578 } else if ((term->schema->flags & LYS_KEY) && term->parent) {
1579 /* list needs to be updated if its key was changed */
1580 assert(term->parent->schema->nodetype == LYS_LIST);
Michal Vasko9e685082021-01-29 14:49:09 +01001581 lyd_unlink_hash(lyd_parent(term));
1582 lyd_hash(lyd_parent(term));
1583 LY_CHECK_GOTO(ret = lyd_insert_hash(lyd_parent(term)), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001584 } /* else leaf that is not a key, its value is not used for its hash so it does not change */
1585 }
1586
1587 /* retrun value */
1588 if (!val_change) {
1589 if (dflt_change) {
1590 /* only default flag change */
1591 ret = LY_EEXIST;
1592 } else {
1593 /* no change */
1594 ret = LY_ENOT;
1595 }
1596 } /* else value changed, LY_SUCCESS */
1597
1598cleanup:
Michal Vasko59512fc2020-12-09 18:13:29 +01001599 if (val.realtype) {
1600 type->plugin->free(LYD_CTX(term), &val);
1601 }
Michal Vasko00cbf532020-06-15 13:58:47 +02001602 return ret;
1603}
1604
Jan Kundrátc6e39de2021-12-09 16:01:19 +01001605LIBYANG_API_DEF LY_ERR
Radek Krejci09c77442021-04-26 11:10:34 +02001606lyd_change_term(struct lyd_node *term, const char *val_str)
1607{
1608 LY_CHECK_ARG_RET(NULL, term, term->schema, term->schema->nodetype & LYD_NODE_TERM, LY_EINVAL);
1609
1610 return _lyd_change_term(term, val_str, val_str ? strlen(val_str) : 0, LY_VALUE_JSON);
1611}
1612
Jan Kundrátc6e39de2021-12-09 16:01:19 +01001613LIBYANG_API_DEF LY_ERR
Radek Krejci09c77442021-04-26 11:10:34 +02001614lyd_change_term_bin(struct lyd_node *term, const void *value, size_t value_len)
1615{
1616 LY_CHECK_ARG_RET(NULL, term, term->schema, term->schema->nodetype & LYD_NODE_TERM, LY_EINVAL);
1617
1618 return _lyd_change_term(term, value, value_len, LY_VALUE_LYB);
1619}
1620
Jan Kundrátc6e39de2021-12-09 16:01:19 +01001621LIBYANG_API_DEF LY_ERR
Radek Krejci09c77442021-04-26 11:10:34 +02001622lyd_change_term_canon(struct lyd_node *term, const char *val_str)
1623{
1624 LY_CHECK_ARG_RET(NULL, term, term->schema, term->schema->nodetype & LYD_NODE_TERM, LY_EINVAL);
1625
1626 return _lyd_change_term(term, val_str, val_str ? strlen(val_str) : 0, LY_VALUE_CANON);
1627}
1628
Jan Kundrátc6e39de2021-12-09 16:01:19 +01001629LIBYANG_API_DEF LY_ERR
Michal Vasko41586352020-07-13 13:54:25 +02001630lyd_change_meta(struct lyd_meta *meta, const char *val_str)
1631{
1632 LY_ERR ret = LY_SUCCESS;
Radek Krejci2b18bf12020-11-06 11:20:20 +01001633 struct lyd_meta *m2 = NULL;
Michal Vasko41586352020-07-13 13:54:25 +02001634 struct lyd_value val;
Radek Krejci857189e2020-09-01 13:26:36 +02001635 ly_bool val_change;
Michal Vasko41586352020-07-13 13:54:25 +02001636
1637 LY_CHECK_ARG_RET(NULL, meta, LY_EINVAL);
1638
1639 if (!val_str) {
1640 val_str = "";
1641 }
1642
1643 /* parse the new value into a new meta structure */
Michal Vaskoaac267d2022-01-17 13:34:48 +01001644 ret = lyd_create_meta(NULL, &m2, meta->annotation->module, meta->name, strlen(meta->name), val_str, strlen(val_str),
1645 NULL, LY_VALUE_JSON, NULL, LYD_HINT_DATA, meta->parent ? meta->parent->schema : NULL, 0, NULL);
1646 LY_CHECK_GOTO(ret, cleanup);
Michal Vasko41586352020-07-13 13:54:25 +02001647
1648 /* compare original and new value */
1649 if (lyd_compare_meta(meta, m2)) {
1650 /* values differ, switch them */
1651 val = meta->value;
1652 meta->value = m2->value;
1653 m2->value = val;
1654 val_change = 1;
1655 } else {
1656 val_change = 0;
1657 }
1658
1659 /* retrun value */
1660 if (!val_change) {
1661 /* no change */
1662 ret = LY_ENOT;
1663 } /* else value changed, LY_SUCCESS */
1664
1665cleanup:
Michal Vasko1a66a5d2020-11-18 18:15:37 +01001666 lyd_free_meta_single(m2);
Michal Vasko41586352020-07-13 13:54:25 +02001667 return ret;
1668}
1669
Radek Krejci09c77442021-04-26 11:10:34 +02001670/**
1671 * @brief Update node value.
1672 *
1673 * @param[in] node Node to update.
1674 * @param[in] value New value to set.
1675 * @param[in] value_len Length of @p value.
1676 * @param[in] value_type Type of @p value for anydata/anyxml node.
1677 * @param[in] format Format of @p value.
1678 * @param[out] new_parent Set to @p node if the value was updated, otherwise set to NULL.
1679 * @param[out] new_node Set to @p node if the value was updated, otherwise set to NULL.
1680 * @return LY_ERR value.
1681 */
Michal Vasko6741dc62021-02-04 09:27:45 +01001682static LY_ERR
Radek Krejci09c77442021-04-26 11:10:34 +02001683lyd_new_path_update(struct lyd_node *node, const void *value, size_t value_len, LYD_ANYDATA_VALUETYPE value_type,
1684 LY_VALUE_FORMAT format, struct lyd_node **new_parent, struct lyd_node **new_node)
1685{
1686 LY_ERR ret = LY_SUCCESS;
1687 struct lyd_node *new_any;
1688
1689 switch (node->schema->nodetype) {
1690 case LYS_CONTAINER:
1691 case LYS_NOTIF:
1692 case LYS_RPC:
1693 case LYS_ACTION:
1694 case LYS_LIST:
1695 /* if it exists, there is nothing to update */
1696 *new_parent = NULL;
1697 *new_node = NULL;
1698 break;
1699 case LYS_LEAFLIST:
1700 if (!lysc_is_dup_inst_list(node->schema)) {
1701 /* if it exists, there is nothing to update */
1702 *new_parent = NULL;
1703 *new_node = NULL;
1704 break;
1705 }
1706 /* fallthrough */
1707 case LYS_LEAF:
1708 ret = _lyd_change_term(node, value, value_len, format);
1709 if ((ret == LY_SUCCESS) || (ret == LY_EEXIST)) {
1710 /* there was an actual change (at least of the default flag) */
1711 *new_parent = node;
1712 *new_node = node;
1713 ret = LY_SUCCESS;
1714 } else if (ret == LY_ENOT) {
1715 /* no change */
1716 *new_parent = NULL;
1717 *new_node = NULL;
1718 ret = LY_SUCCESS;
1719 } /* else error */
1720 break;
1721 case LYS_ANYDATA:
1722 case LYS_ANYXML:
1723 /* create a new any node */
1724 LY_CHECK_RET(lyd_create_any(node->schema, value, value_type, 0, &new_any));
1725
1726 /* compare with the existing one */
1727 if (lyd_compare_single(node, new_any, 0)) {
1728 /* not equal, switch values (so that we can use generic node free) */
1729 ((struct lyd_node_any *)new_any)->value = ((struct lyd_node_any *)node)->value;
1730 ((struct lyd_node_any *)new_any)->value_type = ((struct lyd_node_any *)node)->value_type;
1731 ((struct lyd_node_any *)node)->value.str = value;
1732 ((struct lyd_node_any *)node)->value_type = value_type;
1733
1734 *new_parent = node;
1735 *new_node = node;
1736 } else {
1737 /* they are equal */
1738 *new_parent = NULL;
1739 *new_node = NULL;
1740 }
1741 lyd_free_tree(new_any);
1742 break;
1743 default:
1744 LOGINT(LYD_CTX(node));
1745 ret = LY_EINT;
1746 break;
1747 }
1748
1749 return ret;
1750}
1751
1752static LY_ERR
1753lyd_new_path_check_find_lypath(struct ly_path *path, const char *str_path, const char *value, size_t value_len,
1754 LY_VALUE_FORMAT format, uint32_t options)
Michal Vasko6741dc62021-02-04 09:27:45 +01001755{
Michal Vaskoe78faec2021-04-08 17:24:43 +02001756 LY_ERR r;
Michal Vasko6741dc62021-02-04 09:27:45 +01001757 struct ly_path_predicate *pred;
Michal Vasko04726242022-01-10 09:30:08 +01001758 struct lyd_value val;
Michal Vaskoe78faec2021-04-08 17:24:43 +02001759 const struct lysc_node *schema = NULL;
1760 LY_ARRAY_COUNT_TYPE u, new_count;
1761 int create = 0;
Michal Vasko6741dc62021-02-04 09:27:45 +01001762
1763 assert(path);
1764
1765 /* go through all the compiled nodes */
1766 LY_ARRAY_FOR(path, u) {
1767 schema = path[u].node;
Michal Vaskoe78faec2021-04-08 17:24:43 +02001768
1769 if (lysc_is_dup_inst_list(schema)) {
1770 if (path[u].pred_type == LY_PATH_PREDTYPE_NONE) {
1771 /* creating a new key-less list or state leaf-list instance */
1772 create = 1;
1773 new_count = u;
1774 } else if (path[u].pred_type != LY_PATH_PREDTYPE_POSITION) {
1775 LOG_LOCSET(schema, NULL, NULL, NULL);
1776 LOGVAL(schema->module->ctx, LYVE_XPATH, "Invalid predicate for %s \"%s\" in path \"%s\".",
1777 lys_nodetype2str(schema->nodetype), schema->name, str_path);
1778 LOG_LOCBACK(1, 0, 0, 0);
1779 return LY_EINVAL;
1780 }
1781 } else if ((schema->nodetype == LYS_LIST) && (path[u].pred_type != LY_PATH_PREDTYPE_LIST)) {
1782 if ((u < LY_ARRAY_COUNT(path) - 1) || !(options & LYD_NEW_PATH_OPAQ)) {
Michal Vasko6741dc62021-02-04 09:27:45 +01001783 LOG_LOCSET(schema, NULL, NULL, NULL);
1784 LOGVAL(schema->module->ctx, LYVE_XPATH, "Predicate missing for %s \"%s\" in path \"%s\".",
1785 lys_nodetype2str(schema->nodetype), schema->name, str_path);
1786 LOG_LOCBACK(1, 0, 0, 0);
1787 return LY_EINVAL;
Michal Vaskoe78faec2021-04-08 17:24:43 +02001788 } /* else creating an opaque list */
1789 } else if ((schema->nodetype == LYS_LEAFLIST) && (path[u].pred_type != LY_PATH_PREDTYPE_LEAFLIST)) {
Michal Vaskoe78faec2021-04-08 17:24:43 +02001790 r = LY_SUCCESS;
1791 if (options & LYD_NEW_PATH_OPAQ) {
Radek Krejci09c77442021-04-26 11:10:34 +02001792 r = lyd_value_validate(NULL, schema, value, value_len, NULL, NULL, NULL);
Michal Vaskoe78faec2021-04-08 17:24:43 +02001793 }
1794 if (!r) {
Michal Vasko04726242022-01-10 09:30:08 +01001795 /* try to store the value */
1796 LY_CHECK_RET(lyd_value_store(schema->module->ctx, &val, ((struct lysc_node_leaflist *)schema)->type,
1797 value, value_len, NULL, format, NULL, LYD_HINT_DATA, schema, NULL));
1798 ++((struct lysc_type *)val.realtype)->refcount;
1799
Michal Vaskoe78faec2021-04-08 17:24:43 +02001800 /* store the new predicate so that it is used when searching for this instance */
1801 path[u].pred_type = LY_PATH_PREDTYPE_LEAFLIST;
1802 LY_ARRAY_NEW_RET(schema->module->ctx, path[u].predicates, pred, LY_EMEM);
Michal Vasko04726242022-01-10 09:30:08 +01001803 pred->value = val;
Michal Vaskoe78faec2021-04-08 17:24:43 +02001804 } /* else we have opaq flag and the value is not valid, leave no predicate and then create an opaque node */
1805 }
Michal Vasko6741dc62021-02-04 09:27:45 +01001806 }
1807
Michal Vaskoe78faec2021-04-08 17:24:43 +02001808 if (create) {
1809 /* hide the nodes that should always be created so they are not found */
1810 while (new_count < LY_ARRAY_COUNT(path)) {
1811 LY_ARRAY_DECREMENT(path);
1812 }
Michal Vasko6741dc62021-02-04 09:27:45 +01001813 }
1814
Michal Vaskoe78faec2021-04-08 17:24:43 +02001815 return LY_SUCCESS;
Michal Vasko6741dc62021-02-04 09:27:45 +01001816}
1817
Radek Krejci95ccd1b2021-03-12 14:57:22 +01001818/**
1819 * @brief Create a new node in the data tree based on a path. All node types can be created.
1820 *
Michal Vaskoa918a632021-07-02 11:53:36 +02001821 * If @p path points to a list key, the key value from the predicate is used and @p value is ignored.
1822 * Also, if a leaf-list is being created and both a predicate is defined in @p path
Radek Krejci95ccd1b2021-03-12 14:57:22 +01001823 * and @p value is set, the predicate is preferred.
1824 *
1825 * For key-less lists and state leaf-lists, positional predicates can be used. If no preciate is used for these
1826 * nodes, they are always created.
1827 *
1828 * @param[in] parent Data parent to add to/modify, can be NULL. Note that in case a first top-level sibling is used,
1829 * it may no longer be first if @p path is absolute and starts with a non-existing top-level node inserted
1830 * before @p parent. Use ::lyd_first_sibling() to adjust @p parent in these cases.
1831 * @param[in] ctx libyang context, must be set if @p parent is NULL.
1832 * @param[in] ext Extension instance where the node being created is defined. This argument takes effect only for absolute
1833 * path or when the relative paths touches document root (top-level). In such cases the present extension instance replaces
1834 * searching for the appropriate module.
1835 * @param[in] path [Path](@ref howtoXPath) to create.
Radek Krejci09c77442021-04-26 11:10:34 +02001836 * @param[in] value Value of the new leaf/leaf-list (const char *) in ::LY_VALUE_JSON format. If creating an
1837 * anyxml/anydata node, the expected type depends on @p value_type. For other node types, it should be NULL.
1838 * @param[in] value_len Length of @p value in bytes. May be 0 if @p value is a zero-terminated string. Ignored when
1839 * creating anyxml/anydata nodes.
Radek Krejci95ccd1b2021-03-12 14:57:22 +01001840 * @param[in] value_type Anyxml/anydata node @p value type.
1841 * @param[in] options Bitmask of options, see @ref pathoptions.
1842 * @param[out] new_parent Optional first parent node created. If only one node was created, equals to @p new_node.
1843 * @param[out] new_node Optional last node created.
1844 * @return LY_ERR value.
1845 */
1846static LY_ERR
1847lyd_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 +02001848 const void *value, size_t value_len, LYD_ANYDATA_VALUETYPE value_type, uint32_t options,
Radek Krejci95ccd1b2021-03-12 14:57:22 +01001849 struct lyd_node **new_parent, struct lyd_node **new_node)
Michal Vasko00cbf532020-06-15 13:58:47 +02001850{
1851 LY_ERR ret = LY_SUCCESS, r;
1852 struct lyxp_expr *exp = NULL;
1853 struct ly_path *p = NULL;
1854 struct lyd_node *nparent = NULL, *nnode = NULL, *node = NULL, *cur_parent;
1855 const struct lysc_node *schema;
Michal Vaskoe78faec2021-04-08 17:24:43 +02001856 const struct lyd_value *val = NULL;
Radek Krejci910d0132021-03-05 14:19:31 +01001857 LY_ARRAY_COUNT_TYPE path_idx = 0, orig_count = 0;
Radek Krejci09c77442021-04-26 11:10:34 +02001858 LY_VALUE_FORMAT format;
Michal Vasko00cbf532020-06-15 13:58:47 +02001859
Radek Krejci95ccd1b2021-03-12 14:57:22 +01001860 assert(parent || ctx);
Radek Krejci09c77442021-04-26 11:10:34 +02001861 assert(path && ((path[0] == '/') || parent));
1862 assert(!(options & LYD_NEW_PATH_BIN_VALUE) || !(options & LYD_NEW_PATH_CANON_VALUE));
Michal Vasko00cbf532020-06-15 13:58:47 +02001863
1864 if (!ctx) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001865 ctx = LYD_CTX(parent);
Michal Vasko00cbf532020-06-15 13:58:47 +02001866 }
Radek Krejci09c77442021-04-26 11:10:34 +02001867 if (value && !value_len) {
1868 value_len = strlen(value);
1869 }
1870 if (options & LYD_NEW_PATH_BIN_VALUE) {
1871 format = LY_VALUE_LYB;
1872 } else if (options & LYD_NEW_PATH_CANON_VALUE) {
1873 format = LY_VALUE_CANON;
1874 } else {
1875 format = LY_VALUE_JSON;
1876 }
Michal Vasko00cbf532020-06-15 13:58:47 +02001877
1878 /* parse path */
Michal Vaskoed725d72021-06-23 12:03:45 +02001879 LY_CHECK_GOTO(ret = ly_path_parse(ctx, NULL, path, strlen(path), 0, LY_PATH_BEGIN_EITHER, LY_PATH_PREFIX_OPTIONAL,
1880 LY_PATH_PRED_SIMPLE, &exp), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001881
1882 /* compile path */
Michal Vasko106f0862021-11-02 11:49:27 +01001883 LY_CHECK_GOTO(ret = ly_path_compile(ctx, NULL, lyd_node_schema(parent), ext, exp, options & LYD_NEW_PATH_OUTPUT ?
1884 LY_PATH_OPER_OUTPUT : LY_PATH_OPER_INPUT, LY_PATH_TARGET_MANY, 0, LY_VALUE_JSON, NULL, &p), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001885
Michal Vasko6741dc62021-02-04 09:27:45 +01001886 /* check the compiled path before searching existing nodes, it may be shortened */
1887 orig_count = LY_ARRAY_COUNT(p);
Radek Krejci09c77442021-04-26 11:10:34 +02001888 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 +02001889
1890 /* try to find any existing nodes in the path */
1891 if (parent) {
1892 ret = ly_path_eval_partial(p, parent, &path_idx, &node);
1893 if (ret == LY_SUCCESS) {
Michal Vasko6741dc62021-02-04 09:27:45 +01001894 if (orig_count == LY_ARRAY_COUNT(p)) {
1895 /* the node exists, are we supposed to update it or is it just a default? */
1896 if (!(options & LYD_NEW_PATH_UPDATE) && !(node->flags & LYD_DEFAULT)) {
1897 LOG_LOCSET(NULL, node, NULL, NULL);
1898 LOGVAL(ctx, LYVE_REFERENCE, "Path \"%s\" already exists", path);
1899 LOG_LOCBACK(0, 1, 0, 0);
1900 ret = LY_EEXIST;
1901 goto cleanup;
1902 }
Michal Vasko00cbf532020-06-15 13:58:47 +02001903
Michal Vasko6741dc62021-02-04 09:27:45 +01001904 /* update the existing node */
Radek Krejci09c77442021-04-26 11:10:34 +02001905 ret = lyd_new_path_update(node, value, value_len, value_type, format, &nparent, &nnode);
Michal Vasko6741dc62021-02-04 09:27:45 +01001906 goto cleanup;
1907 } /* else we were not searching for the whole path */
Michal Vasko00cbf532020-06-15 13:58:47 +02001908 } else if (ret == LY_EINCOMPLETE) {
1909 /* some nodes were found, adjust the iterator to the next segment */
1910 ++path_idx;
1911 } else if (ret == LY_ENOTFOUND) {
1912 /* 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 +01001913 if (lysc_data_parent(p[0].node)) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001914 node = parent;
1915 }
1916 } else {
1917 /* error */
1918 goto cleanup;
1919 }
1920 }
1921
Michal Vasko6741dc62021-02-04 09:27:45 +01001922 /* restore the full path for creating new nodes */
1923 while (orig_count > LY_ARRAY_COUNT(p)) {
1924 LY_ARRAY_INCREMENT(p);
1925 }
1926
Michal Vasko00cbf532020-06-15 13:58:47 +02001927 /* create all the non-existing nodes in a loop */
Michal Vaskod989ba02020-08-24 10:59:24 +02001928 for ( ; path_idx < LY_ARRAY_COUNT(p); ++path_idx) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001929 cur_parent = node;
1930 schema = p[path_idx].node;
1931
1932 switch (schema->nodetype) {
1933 case LYS_LIST:
Michal Vaskoe78faec2021-04-08 17:24:43 +02001934 if (lysc_is_dup_inst_list(schema)) {
1935 /* create key-less list instance */
1936 LY_CHECK_GOTO(ret = lyd_create_inner(schema, &node), cleanup);
1937 } else if ((options & LYD_NEW_PATH_OPAQ) && (p[path_idx].pred_type == LY_PATH_PREDTYPE_NONE)) {
1938 /* creating opaque list without keys */
1939 LY_CHECK_GOTO(ret = lyd_create_opaq(ctx, schema->name, strlen(schema->name), NULL, 0,
Radek Krejci8df109d2021-04-23 12:19:08 +02001940 schema->module->name, strlen(schema->module->name), NULL, 0, NULL, LY_VALUE_JSON, NULL,
Michal Vaskoe78faec2021-04-08 17:24:43 +02001941 LYD_NODEHINT_LIST, &node), cleanup);
1942 } else {
1943 /* create standard list instance */
1944 assert(p[path_idx].pred_type == LY_PATH_PREDTYPE_LIST);
1945 LY_CHECK_GOTO(ret = lyd_create_list(schema, p[path_idx].predicates, &node), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001946 }
Michal Vaskoe78faec2021-04-08 17:24:43 +02001947 break;
Michal Vasko00cbf532020-06-15 13:58:47 +02001948 case LYS_CONTAINER:
1949 case LYS_NOTIF:
1950 case LYS_RPC:
1951 case LYS_ACTION:
1952 LY_CHECK_GOTO(ret = lyd_create_inner(schema, &node), cleanup);
1953 break;
1954 case LYS_LEAFLIST:
Michal Vaskoe78faec2021-04-08 17:24:43 +02001955 if ((options & LYD_NEW_PATH_OPAQ) && (p[path_idx].pred_type != LY_PATH_PREDTYPE_LEAFLIST)) {
1956 /* we have not checked this only for dup-inst lists, otherwise it must be opaque */
1957 r = LY_EVALID;
1958 if (lysc_is_dup_inst_list(schema)) {
1959 /* validate value */
Radek Krejci09c77442021-04-26 11:10:34 +02001960 r = lyd_value_validate(NULL, schema, value ? value : "", value_len, NULL, NULL, NULL);
Michal Vaskoe78faec2021-04-08 17:24:43 +02001961 }
1962 if (r && (r != LY_EINCOMPLETE)) {
1963 /* creating opaque leaf-list */
Radek Krejci09c77442021-04-26 11:10:34 +02001964 LY_CHECK_GOTO(ret = lyd_create_opaq(ctx, schema->name, strlen(schema->name), value, value_len,
1965 schema->module->name, strlen(schema->module->name), NULL, 0, NULL, format, NULL,
1966 LYD_NODEHINT_LEAFLIST, &node), cleanup);
Michal Vaskoe78faec2021-04-08 17:24:43 +02001967 break;
1968 }
1969 }
1970
1971 /* get value to set */
1972 if (p[path_idx].pred_type == LY_PATH_PREDTYPE_LEAFLIST) {
1973 val = &p[path_idx].predicates[0].value;
Michal Vaskoe78faec2021-04-08 17:24:43 +02001974 }
1975
1976 /* create a leaf-list instance */
1977 if (val) {
Michal Vasko00cbf532020-06-15 13:58:47 +02001978 LY_CHECK_GOTO(ret = lyd_create_term2(schema, &p[path_idx].predicates[0].value, &node), cleanup);
Michal Vaskoe78faec2021-04-08 17:24:43 +02001979 } else {
Radek Krejci09c77442021-04-26 11:10:34 +02001980 LY_CHECK_GOTO(ret = lyd_create_term(schema, value, value_len, NULL, format, NULL, LYD_HINT_DATA,
1981 NULL, &node), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02001982 }
1983 break;
1984 case LYS_LEAF:
Michal Vasko106f0862021-11-02 11:49:27 +01001985 if (lysc_is_key(schema) && cur_parent->schema) {
Michal Vasko35880332020-12-08 13:08:12 +01001986 /* it must have been already created or some error will occur later */
Michal Vaskoa918a632021-07-02 11:53:36 +02001987 lyd_find_sibling_schema(lyd_child(cur_parent), schema, &node);
1988 assert(node);
Michal Vasko35880332020-12-08 13:08:12 +01001989 goto next_iter;
1990 }
1991
Michal Vaskoe78faec2021-04-08 17:24:43 +02001992 if (options & LYD_NEW_PATH_OPAQ) {
Michal Vasko106f0862021-11-02 11:49:27 +01001993 if (cur_parent && !cur_parent->schema) {
1994 /* always create opaque nodes for opaque parents */
1995 r = LY_ENOT;
1996 } else {
1997 /* validate value */
1998 r = lyd_value_validate(NULL, schema, value ? value : "", value_len, NULL, NULL, NULL);
1999 }
Michal Vaskoe78faec2021-04-08 17:24:43 +02002000 if (r && (r != LY_EINCOMPLETE)) {
2001 /* creating opaque leaf */
Radek Krejci09c77442021-04-26 11:10:34 +02002002 LY_CHECK_GOTO(ret = lyd_create_opaq(ctx, schema->name, strlen(schema->name), value, value_len,
2003 schema->module->name, strlen(schema->module->name), NULL, 0, NULL, format, NULL, 0, &node),
2004 cleanup);
Michal Vaskoe78faec2021-04-08 17:24:43 +02002005 break;
2006 }
2007 }
2008
Michal Vaskoe78faec2021-04-08 17:24:43 +02002009 /* create a leaf instance */
Radek Krejci09c77442021-04-26 11:10:34 +02002010 LY_CHECK_GOTO(ret = lyd_create_term(schema, value, value_len, NULL, format, NULL, LYD_HINT_DATA, NULL,
2011 &node), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02002012 break;
2013 case LYS_ANYDATA:
2014 case LYS_ANYXML:
Michal Vasko366a4a12020-12-04 16:23:57 +01002015 LY_CHECK_GOTO(ret = lyd_create_any(schema, value, value_type, 0, &node), cleanup);
Michal Vasko00cbf532020-06-15 13:58:47 +02002016 break;
2017 default:
2018 LOGINT(ctx);
2019 ret = LY_EINT;
2020 goto cleanup;
2021 }
2022
2023 if (cur_parent) {
2024 /* connect to the parent */
Michal Vasko6ee6f432021-07-16 09:49:14 +02002025 lyd_insert_node(cur_parent, NULL, node, 0);
Michal Vasko00cbf532020-06-15 13:58:47 +02002026 } else if (parent) {
2027 /* connect to top-level siblings */
Michal Vasko6ee6f432021-07-16 09:49:14 +02002028 lyd_insert_node(NULL, &parent, node, 0);
Michal Vasko00cbf532020-06-15 13:58:47 +02002029 }
2030
Michal Vasko35880332020-12-08 13:08:12 +01002031next_iter:
Michal Vasko00cbf532020-06-15 13:58:47 +02002032 /* update remembered nodes */
2033 if (!nparent) {
2034 nparent = node;
2035 }
2036 nnode = node;
2037 }
2038
2039cleanup:
2040 lyxp_expr_free(ctx, exp);
Michal Vasko6741dc62021-02-04 09:27:45 +01002041 if (p) {
2042 while (orig_count > LY_ARRAY_COUNT(p)) {
2043 LY_ARRAY_INCREMENT(p);
2044 }
2045 }
Michal Vasko00cbf532020-06-15 13:58:47 +02002046 ly_path_free(ctx, p);
2047 if (!ret) {
2048 /* set out params only on success */
2049 if (new_parent) {
2050 *new_parent = nparent;
2051 }
2052 if (new_node) {
2053 *new_node = nnode;
2054 }
Michal Vaskof4b95ba2020-12-11 08:42:33 +01002055 } else {
2056 lyd_free_tree(nparent);
Michal Vasko00cbf532020-06-15 13:58:47 +02002057 }
2058 return ret;
2059}
2060
Jan Kundrátc6e39de2021-12-09 16:01:19 +01002061LIBYANG_API_DEF LY_ERR
Radek Krejci95ccd1b2021-03-12 14:57:22 +01002062lyd_new_path(struct lyd_node *parent, const struct ly_ctx *ctx, const char *path, const char *value, uint32_t options,
2063 struct lyd_node **node)
2064{
Radek Krejci09c77442021-04-26 11:10:34 +02002065 LY_CHECK_ARG_RET(ctx, parent || ctx, path, (path[0] == '/') || parent,
2066 !(options & LYD_NEW_PATH_BIN_VALUE) || !(options & LYD_NEW_PATH_CANON_VALUE), LY_EINVAL);
Michal Vasko1d80a532021-11-24 10:41:05 +01002067 LY_CHECK_CTX_EQUAL_RET(parent ? LYD_CTX(parent) : NULL, ctx, LY_EINVAL);
Radek Krejci09c77442021-04-26 11:10:34 +02002068
2069 return lyd_new_path_(parent, ctx, NULL, path, value, 0, LYD_ANYDATA_STRING, options, node, NULL);
Radek Krejci95ccd1b2021-03-12 14:57:22 +01002070}
2071
Jan Kundrátc6e39de2021-12-09 16:01:19 +01002072LIBYANG_API_DEF LY_ERR
Radek Krejci95ccd1b2021-03-12 14:57:22 +01002073lyd_new_path2(struct lyd_node *parent, const struct ly_ctx *ctx, const char *path, const void *value,
Radek Krejci09c77442021-04-26 11:10:34 +02002074 size_t value_len, LYD_ANYDATA_VALUETYPE value_type, uint32_t options, struct lyd_node **new_parent,
2075 struct lyd_node **new_node)
Radek Krejci95ccd1b2021-03-12 14:57:22 +01002076{
Radek Krejci09c77442021-04-26 11:10:34 +02002077 LY_CHECK_ARG_RET(ctx, parent || ctx, path, (path[0] == '/') || parent,
2078 !(options & LYD_NEW_PATH_BIN_VALUE) || !(options & LYD_NEW_PATH_CANON_VALUE), LY_EINVAL);
Michal Vasko1d80a532021-11-24 10:41:05 +01002079 LY_CHECK_CTX_EQUAL_RET(parent ? LYD_CTX(parent) : NULL, ctx, LY_EINVAL);
2080
Radek Krejci09c77442021-04-26 11:10:34 +02002081 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 +01002082}
2083
Jan Kundrátc6e39de2021-12-09 16:01:19 +01002084LIBYANG_API_DEF LY_ERR
Radek Krejci95ccd1b2021-03-12 14:57:22 +01002085lyd_new_ext_path(struct lyd_node *parent, const struct lysc_ext_instance *ext, const char *path, const void *value,
2086 uint32_t options, struct lyd_node **node)
2087{
2088 const struct ly_ctx *ctx = ext ? ext->module->ctx : NULL;
2089
Radek Krejci09c77442021-04-26 11:10:34 +02002090 LY_CHECK_ARG_RET(ctx, ext, path, (path[0] == '/') || parent,
2091 !(options & LYD_NEW_PATH_BIN_VALUE) || !(options & LYD_NEW_PATH_CANON_VALUE), LY_EINVAL);
Michal Vasko1d80a532021-11-24 10:41:05 +01002092 LY_CHECK_CTX_EQUAL_RET(parent ? LYD_CTX(parent) : NULL, ctx, LY_EINVAL);
2093
Radek Krejci09c77442021-04-26 11:10:34 +02002094 return lyd_new_path_(parent, ctx, ext, path, value, 0, LYD_ANYDATA_STRING, options, node, NULL);
Radek Krejci95ccd1b2021-03-12 14:57:22 +01002095}
2096
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002097LY_ERR
2098lyd_new_implicit_r(struct lyd_node *parent, struct lyd_node **first, const struct lysc_node *sparent,
Michal Vaskoaac267d2022-01-17 13:34:48 +01002099 const struct lys_module *mod, struct ly_set *node_when, struct ly_set *node_types, uint32_t impl_opts,
2100 struct lyd_node **diff)
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002101{
2102 LY_ERR ret;
Michal Vaskod1e53b92021-01-28 13:11:06 +01002103 const struct lysc_node *iter = NULL;
Radek Krejci2b18bf12020-11-06 11:20:20 +01002104 struct lyd_node *node = NULL;
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002105 struct lyd_value **dflts;
2106 LY_ARRAY_COUNT_TYPE u;
Michal Vasko630d9892020-12-08 17:11:08 +01002107 uint32_t getnext_opts;
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002108
2109 assert(first && (parent || sparent || mod));
2110
2111 if (!sparent && parent) {
2112 sparent = parent->schema;
2113 }
2114
Michal Vasko630d9892020-12-08 17:11:08 +01002115 getnext_opts = LYS_GETNEXT_WITHCHOICE;
2116 if (impl_opts & LYD_IMPLICIT_OUTPUT) {
2117 getnext_opts |= LYS_GETNEXT_OUTPUT;
2118 }
2119
2120 while ((iter = lys_getnext(iter, sparent, mod ? mod->compiled : NULL, getnext_opts))) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002121 if ((impl_opts & LYD_IMPLICIT_NO_STATE) && (iter->flags & LYS_CONFIG_R)) {
2122 continue;
Michal Vasko44b19a12020-08-07 09:21:30 +02002123 } else if ((impl_opts & LYD_IMPLICIT_NO_CONFIG) && (iter->flags & LYS_CONFIG_W)) {
2124 continue;
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002125 }
2126
2127 switch (iter->nodetype) {
2128 case LYS_CHOICE:
Michal Vaskobcf4d7d2020-11-18 18:16:49 +01002129 node = lys_getnext_data(NULL, *first, NULL, iter, NULL);
2130 if (!node && ((struct lysc_node_choice *)iter)->dflt) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002131 /* create default case data */
Michal Vasko14ed9cd2021-01-28 14:16:25 +01002132 LY_CHECK_RET(lyd_new_implicit_r(parent, first, &((struct lysc_node_choice *)iter)->dflt->node,
Michal Vaskoaac267d2022-01-17 13:34:48 +01002133 NULL, node_when, node_types, impl_opts, diff));
Michal Vaskobcf4d7d2020-11-18 18:16:49 +01002134 } else if (node) {
2135 /* create any default data in the existing case */
2136 assert(node->schema->parent->nodetype == LYS_CASE);
Michal Vaskoaac267d2022-01-17 13:34:48 +01002137 LY_CHECK_RET(lyd_new_implicit_r(parent, first, node->schema->parent, NULL, node_when, node_types,
Michal Vaskobcf4d7d2020-11-18 18:16:49 +01002138 impl_opts, diff));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002139 }
2140 break;
2141 case LYS_CONTAINER:
2142 if (!(iter->flags & LYS_PRESENCE) && lyd_find_sibling_val(*first, iter, NULL, 0, NULL)) {
2143 /* create default NP container */
2144 LY_CHECK_RET(lyd_create_inner(iter, &node));
Michal Vaskof4d67ea2021-03-31 13:53:21 +02002145 node->flags = LYD_DEFAULT | (lysc_has_when(iter) ? LYD_WHEN_TRUE : 0);
Michal Vasko6ee6f432021-07-16 09:49:14 +02002146 lyd_insert_node(parent, first, node, 0);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002147
Michal Vaskof4d67ea2021-03-31 13:53:21 +02002148 if (lysc_has_when(iter) && node_when) {
Michal Vaskoe16c7b72021-02-26 10:39:06 +01002149 /* remember to resolve when */
2150 LY_CHECK_RET(ly_set_add(node_when, node, 1, NULL));
2151 }
Michal Vaskoe49b6322020-11-05 17:38:36 +01002152 if (diff) {
2153 /* add into diff */
2154 LY_CHECK_RET(lyd_val_diff_add(node, LYD_DIFF_OP_CREATE, diff));
2155 }
2156
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002157 /* create any default children */
Michal Vaskoaac267d2022-01-17 13:34:48 +01002158 LY_CHECK_RET(lyd_new_implicit_r(node, lyd_node_child_p(node), NULL, NULL, node_when, node_types,
Michal Vasko69730152020-10-09 16:30:07 +02002159 impl_opts, diff));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002160 }
2161 break;
2162 case LYS_LEAF:
Michal Vasko69730152020-10-09 16:30:07 +02002163 if (!(impl_opts & LYD_IMPLICIT_NO_DEFAULTS) && ((struct lysc_node_leaf *)iter)->dflt &&
2164 lyd_find_sibling_val(*first, iter, NULL, 0, NULL)) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002165 /* create default leaf */
2166 ret = lyd_create_term2(iter, ((struct lysc_node_leaf *)iter)->dflt, &node);
2167 if (ret == LY_EINCOMPLETE) {
2168 if (node_types) {
2169 /* remember to resolve type */
Radek Krejci3d92e442020-10-12 12:48:13 +02002170 LY_CHECK_RET(ly_set_add(node_types, node, 1, NULL));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002171 }
2172 } else if (ret) {
2173 return ret;
2174 }
Michal Vaskof4d67ea2021-03-31 13:53:21 +02002175 node->flags = LYD_DEFAULT | (lysc_has_when(iter) ? LYD_WHEN_TRUE : 0);
Michal Vasko6ee6f432021-07-16 09:49:14 +02002176 lyd_insert_node(parent, first, node, 0);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002177
Michal Vaskof4d67ea2021-03-31 13:53:21 +02002178 if (lysc_has_when(iter) && node_when) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002179 /* remember to resolve when */
Radek Krejci3d92e442020-10-12 12:48:13 +02002180 LY_CHECK_RET(ly_set_add(node_when, node, 1, NULL));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002181 }
2182 if (diff) {
2183 /* add into diff */
2184 LY_CHECK_RET(lyd_val_diff_add(node, LYD_DIFF_OP_CREATE, diff));
2185 }
2186 }
2187 break;
2188 case LYS_LEAFLIST:
Michal Vasko69730152020-10-09 16:30:07 +02002189 if (!(impl_opts & LYD_IMPLICIT_NO_DEFAULTS) && ((struct lysc_node_leaflist *)iter)->dflts &&
2190 lyd_find_sibling_val(*first, iter, NULL, 0, NULL)) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002191 /* create all default leaf-lists */
2192 dflts = ((struct lysc_node_leaflist *)iter)->dflts;
2193 LY_ARRAY_FOR(dflts, u) {
2194 ret = lyd_create_term2(iter, dflts[u], &node);
2195 if (ret == LY_EINCOMPLETE) {
2196 if (node_types) {
2197 /* remember to resolve type */
Radek Krejci3d92e442020-10-12 12:48:13 +02002198 LY_CHECK_RET(ly_set_add(node_types, node, 1, NULL));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002199 }
2200 } else if (ret) {
2201 return ret;
2202 }
Michal Vaskof4d67ea2021-03-31 13:53:21 +02002203 node->flags = LYD_DEFAULT | (lysc_has_when(iter) ? LYD_WHEN_TRUE : 0);
Michal Vasko6ee6f432021-07-16 09:49:14 +02002204 lyd_insert_node(parent, first, node, 0);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002205
Michal Vaskof4d67ea2021-03-31 13:53:21 +02002206 if (lysc_has_when(iter) && node_when) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002207 /* remember to resolve when */
Radek Krejci3d92e442020-10-12 12:48:13 +02002208 LY_CHECK_RET(ly_set_add(node_when, node, 1, NULL));
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002209 }
2210 if (diff) {
2211 /* add into diff */
2212 LY_CHECK_RET(lyd_val_diff_add(node, LYD_DIFF_OP_CREATE, diff));
2213 }
2214 }
2215 }
2216 break;
2217 default:
2218 /* without defaults */
2219 break;
2220 }
2221 }
2222
2223 return LY_SUCCESS;
2224}
2225
Jan Kundrátc6e39de2021-12-09 16:01:19 +01002226LIBYANG_API_DEF LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02002227lyd_new_implicit_tree(struct lyd_node *tree, uint32_t implicit_options, struct lyd_node **diff)
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002228{
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002229 LY_ERR ret = LY_SUCCESS;
Michal Vasko3488ada2020-12-03 14:18:19 +01002230 struct lyd_node *node;
Michal Vaskoaac267d2022-01-17 13:34:48 +01002231 struct ly_set node_when = {0};
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002232
2233 LY_CHECK_ARG_RET(NULL, tree, LY_EINVAL);
2234 if (diff) {
2235 *diff = NULL;
2236 }
2237
Michal Vasko56daf732020-08-10 10:57:18 +02002238 LYD_TREE_DFS_BEGIN(tree, node) {
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002239 /* skip added default nodes */
Michal Vasko69730152020-10-09 16:30:07 +02002240 if (((node->flags & (LYD_DEFAULT | LYD_NEW)) != (LYD_DEFAULT | LYD_NEW)) &&
2241 (node->schema->nodetype & LYD_NODE_INNER)) {
Michal Vaskoaac267d2022-01-17 13:34:48 +01002242 LY_CHECK_GOTO(ret = lyd_new_implicit_r(node, lyd_node_child_p(node), NULL, NULL, &node_when, NULL,
2243 implicit_options, diff), cleanup);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002244 }
2245
Michal Vasko56daf732020-08-10 10:57:18 +02002246 LYD_TREE_DFS_END(tree, node);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002247 }
2248
Michal Vasko3488ada2020-12-03 14:18:19 +01002249 /* resolve when and remove any invalid defaults */
Michal Vaskoaac267d2022-01-17 13:34:48 +01002250 LY_CHECK_GOTO(ret = lyd_validate_unres(&tree, NULL, &node_when, LYXP_IGNORE_WHEN, NULL, NULL, NULL, 0, diff), cleanup);
Michal Vasko3488ada2020-12-03 14:18:19 +01002251
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002252cleanup:
Michal Vasko3488ada2020-12-03 14:18:19 +01002253 ly_set_erase(&node_when, NULL);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002254 if (ret && diff) {
2255 lyd_free_all(*diff);
2256 *diff = NULL;
2257 }
2258 return ret;
2259}
2260
Jan Kundrátc6e39de2021-12-09 16:01:19 +01002261LIBYANG_API_DEF LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02002262lyd_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 +02002263{
2264 const struct lys_module *mod;
2265 struct lyd_node *d = NULL;
2266 uint32_t i = 0;
2267 LY_ERR ret = LY_SUCCESS;
2268
2269 LY_CHECK_ARG_RET(ctx, tree, *tree || ctx, LY_EINVAL);
Michal Vasko1d80a532021-11-24 10:41:05 +01002270 LY_CHECK_CTX_EQUAL_RET(*tree ? LYD_CTX(*tree) : NULL, ctx, LY_EINVAL);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002271 if (diff) {
2272 *diff = NULL;
2273 }
2274 if (!ctx) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02002275 ctx = LYD_CTX(*tree);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002276 }
2277
2278 /* add nodes for each module one-by-one */
2279 while ((mod = ly_ctx_get_module_iter(ctx, &i))) {
2280 if (!mod->implemented) {
2281 continue;
2282 }
2283
2284 LY_CHECK_GOTO(ret = lyd_new_implicit_module(tree, mod, implicit_options, diff ? &d : NULL), cleanup);
2285 if (d) {
2286 /* merge into one diff */
2287 lyd_insert_sibling(*diff, d, diff);
2288
2289 d = NULL;
2290 }
2291 }
2292
2293cleanup:
2294 if (ret && diff) {
2295 lyd_free_all(*diff);
2296 *diff = NULL;
2297 }
2298 return ret;
2299}
2300
Jan Kundrátc6e39de2021-12-09 16:01:19 +01002301LIBYANG_API_DEF LY_ERR
Michal Vasko1d80a532021-11-24 10:41:05 +01002302lyd_new_implicit_module(struct lyd_node **tree, const struct lys_module *module, uint32_t implicit_options,
2303 struct lyd_node **diff)
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002304{
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002305 LY_ERR ret = LY_SUCCESS;
Michal Vasko3488ada2020-12-03 14:18:19 +01002306 struct lyd_node *root, *d = NULL;
Michal Vaskoaac267d2022-01-17 13:34:48 +01002307 struct ly_set node_when = {0};
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002308
2309 LY_CHECK_ARG_RET(NULL, tree, module, LY_EINVAL);
Michal Vasko1d80a532021-11-24 10:41:05 +01002310 LY_CHECK_CTX_EQUAL_RET(*tree ? LYD_CTX(*tree) : NULL, module ? module->ctx : NULL, LY_EINVAL);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002311 if (diff) {
2312 *diff = NULL;
2313 }
2314
2315 /* add all top-level defaults for this module */
Michal Vaskoaac267d2022-01-17 13:34:48 +01002316 LY_CHECK_GOTO(ret = lyd_new_implicit_r(NULL, tree, NULL, module, &node_when, NULL, implicit_options, diff), cleanup);
Michal Vasko3488ada2020-12-03 14:18:19 +01002317
2318 /* resolve when and remove any invalid defaults */
Michal Vaskoaac267d2022-01-17 13:34:48 +01002319 LY_CHECK_GOTO(ret = lyd_validate_unres(tree, module, &node_when, LYXP_IGNORE_WHEN, NULL, NULL, NULL, 0, diff),
Michal Vasko0110cc92021-12-06 15:42:22 +01002320 cleanup);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002321
2322 /* process nested nodes */
2323 LY_LIST_FOR(*tree, root) {
2324 /* skip added default nodes */
2325 if ((root->flags & (LYD_DEFAULT | LYD_NEW)) != (LYD_DEFAULT | LYD_NEW)) {
2326 LY_CHECK_GOTO(ret = lyd_new_implicit_tree(root, implicit_options, diff ? &d : NULL), cleanup);
2327
2328 if (d) {
2329 /* merge into one diff */
2330 lyd_insert_sibling(*diff, d, diff);
2331
2332 d = NULL;
2333 }
2334 }
2335 }
2336
2337cleanup:
Michal Vasko3488ada2020-12-03 14:18:19 +01002338 ly_set_erase(&node_when, NULL);
Michal Vaskoa6669ba2020-08-06 16:14:26 +02002339 if (ret && diff) {
2340 lyd_free_all(*diff);
2341 *diff = NULL;
2342 }
2343 return ret;
2344}
2345
Michal Vasko90932a92020-02-12 14:33:03 +01002346struct lyd_node *
Michal Vaskob104f112020-07-17 09:54:54 +02002347lyd_insert_get_next_anchor(const struct lyd_node *first_sibling, const struct lyd_node *new_node)
Michal Vasko90932a92020-02-12 14:33:03 +01002348{
Michal Vaskob104f112020-07-17 09:54:54 +02002349 const struct lysc_node *schema, *sparent;
Michal Vasko90932a92020-02-12 14:33:03 +01002350 struct lyd_node *match = NULL;
Radek Krejci857189e2020-09-01 13:26:36 +02002351 ly_bool found;
Michal Vasko93b16062020-12-09 18:14:18 +01002352 uint32_t getnext_opts;
Michal Vasko90932a92020-02-12 14:33:03 +01002353
Michal Vaskob104f112020-07-17 09:54:54 +02002354 assert(new_node);
2355
2356 if (!first_sibling || !new_node->schema) {
2357 /* insert at the end, no next anchor */
Michal Vasko90932a92020-02-12 14:33:03 +01002358 return NULL;
2359 }
2360
Michal Vaskoc08b9d22022-02-10 15:48:39 +01002361 assert(!first_sibling || (LYD_CTX(first_sibling) == LYD_CTX(new_node)));
2362
Michal Vasko93b16062020-12-09 18:14:18 +01002363 getnext_opts = 0;
Michal Vaskod1e53b92021-01-28 13:11:06 +01002364 if (new_node->schema->flags & LYS_IS_OUTPUT) {
Michal Vasko93b16062020-12-09 18:14:18 +01002365 getnext_opts = LYS_GETNEXT_OUTPUT;
2366 }
2367
Michal Vaskoa2756f02021-07-09 13:20:28 +02002368 if (first_sibling->parent && first_sibling->parent->schema && first_sibling->parent->children_ht) {
Michal Vaskob104f112020-07-17 09:54:54 +02002369 /* find the anchor using hashes */
2370 sparent = first_sibling->parent->schema;
Michal Vasko93b16062020-12-09 18:14:18 +01002371 schema = lys_getnext(new_node->schema, sparent, NULL, getnext_opts);
Michal Vaskob104f112020-07-17 09:54:54 +02002372 while (schema) {
2373 /* keep trying to find the first existing instance of the closest following schema sibling,
2374 * otherwise return NULL - inserting at the end */
2375 if (!lyd_find_sibling_schema(first_sibling, schema, &match)) {
2376 break;
2377 }
2378
Michal Vasko93b16062020-12-09 18:14:18 +01002379 schema = lys_getnext(schema, sparent, NULL, getnext_opts);
Michal Vaskob104f112020-07-17 09:54:54 +02002380 }
2381 } else {
2382 /* find the anchor without hashes */
2383 match = (struct lyd_node *)first_sibling;
Michal Vasko3a708622021-07-15 14:20:10 +02002384 sparent = lysc_data_parent(new_node->schema);
2385 if (!sparent) {
Michal Vaskob104f112020-07-17 09:54:54 +02002386 /* we are in top-level, skip all the data from preceding modules */
2387 LY_LIST_FOR(match, match) {
2388 if (!match->schema || (strcmp(lyd_owner_module(match)->name, lyd_owner_module(new_node)->name) >= 0)) {
2389 break;
2390 }
2391 }
2392 }
2393
2394 /* get the first schema sibling */
Michal Vasko93b16062020-12-09 18:14:18 +01002395 schema = lys_getnext(NULL, sparent, new_node->schema->module->compiled, getnext_opts);
Michal Vaskob104f112020-07-17 09:54:54 +02002396
2397 found = 0;
2398 LY_LIST_FOR(match, match) {
2399 if (!match->schema || (lyd_owner_module(match) != lyd_owner_module(new_node))) {
2400 /* we have found an opaque node, which must be at the end, so use it OR
2401 * modules do not match, so we must have traversed all the data from new_node module (if any),
2402 * we have found the first node of the next module, that is what we want */
2403 break;
2404 }
2405
2406 /* skip schema nodes until we find the instantiated one */
2407 while (!found) {
2408 if (new_node->schema == schema) {
2409 /* we have found the schema of the new node, continue search to find the first
2410 * data node with a different schema (after our schema) */
2411 found = 1;
2412 break;
2413 }
2414 if (match->schema == schema) {
2415 /* current node (match) is a data node still before the new node, continue search in data */
2416 break;
2417 }
Michal Vasko93b16062020-12-09 18:14:18 +01002418 schema = lys_getnext(schema, sparent, new_node->schema->module->compiled, getnext_opts);
Michal Vaskob104f112020-07-17 09:54:54 +02002419 assert(schema);
2420 }
2421
2422 if (found && (match->schema != new_node->schema)) {
2423 /* find the next node after we have found our node schema data instance */
2424 break;
2425 }
2426 }
Michal Vasko90932a92020-02-12 14:33:03 +01002427 }
2428
2429 return match;
2430}
2431
2432/**
2433 * @brief Insert node after a sibling.
2434 *
Michal Vasko9f96a052020-03-10 09:41:45 +01002435 * Handles inserting into NP containers and key-less lists.
2436 *
Michal Vasko90932a92020-02-12 14:33:03 +01002437 * @param[in] sibling Sibling to insert after.
2438 * @param[in] node Node to insert.
2439 */
2440static void
Michal Vaskof03ed032020-03-04 13:31:44 +01002441lyd_insert_after_node(struct lyd_node *sibling, struct lyd_node *node)
Michal Vasko90932a92020-02-12 14:33:03 +01002442{
Michal Vasko0249f7c2020-03-05 16:36:40 +01002443 struct lyd_node_inner *par;
2444
Michal Vasko90932a92020-02-12 14:33:03 +01002445 assert(!node->next && (node->prev == node));
2446
2447 node->next = sibling->next;
2448 node->prev = sibling;
2449 sibling->next = node;
2450 if (node->next) {
2451 /* sibling had a succeeding node */
2452 node->next->prev = node;
2453 } else {
2454 /* sibling was last, find first sibling and change its prev */
2455 if (sibling->parent) {
2456 sibling = sibling->parent->child;
2457 } else {
Michal Vaskod989ba02020-08-24 10:59:24 +02002458 for ( ; sibling->prev->next != node; sibling = sibling->prev) {}
Michal Vasko90932a92020-02-12 14:33:03 +01002459 }
2460 sibling->prev = node;
2461 }
2462 node->parent = sibling->parent;
Michal Vasko0249f7c2020-03-05 16:36:40 +01002463
Michal Vasko9f96a052020-03-10 09:41:45 +01002464 for (par = node->parent; par; par = par->parent) {
2465 if ((par->flags & LYD_DEFAULT) && !(node->flags & LYD_DEFAULT)) {
2466 /* remove default flags from NP containers */
Michal Vasko0249f7c2020-03-05 16:36:40 +01002467 par->flags &= ~LYD_DEFAULT;
2468 }
2469 }
Michal Vasko90932a92020-02-12 14:33:03 +01002470}
2471
2472/**
2473 * @brief Insert node before a sibling.
2474 *
Michal Vasko9f96a052020-03-10 09:41:45 +01002475 * Handles inserting into NP containers and key-less lists.
2476 *
Michal Vasko90932a92020-02-12 14:33:03 +01002477 * @param[in] sibling Sibling to insert before.
2478 * @param[in] node Node to insert.
2479 */
2480static void
Michal Vaskof03ed032020-03-04 13:31:44 +01002481lyd_insert_before_node(struct lyd_node *sibling, struct lyd_node *node)
Michal Vasko90932a92020-02-12 14:33:03 +01002482{
Michal Vasko0249f7c2020-03-05 16:36:40 +01002483 struct lyd_node_inner *par;
2484
Michal Vasko90932a92020-02-12 14:33:03 +01002485 assert(!node->next && (node->prev == node));
2486
2487 node->next = sibling;
2488 /* covers situation of sibling being first */
2489 node->prev = sibling->prev;
2490 sibling->prev = node;
2491 if (node->prev->next) {
2492 /* sibling had a preceding node */
2493 node->prev->next = node;
2494 } else if (sibling->parent) {
2495 /* sibling was first and we must also change parent child pointer */
2496 sibling->parent->child = node;
2497 }
2498 node->parent = sibling->parent;
Michal Vasko0249f7c2020-03-05 16:36:40 +01002499
Michal Vasko9f96a052020-03-10 09:41:45 +01002500 for (par = node->parent; par; par = par->parent) {
2501 if ((par->flags & LYD_DEFAULT) && !(node->flags & LYD_DEFAULT)) {
2502 /* remove default flags from NP containers */
Michal Vasko0249f7c2020-03-05 16:36:40 +01002503 par->flags &= ~LYD_DEFAULT;
2504 }
2505 }
Michal Vasko90932a92020-02-12 14:33:03 +01002506}
2507
2508/**
Michal Vaskob104f112020-07-17 09:54:54 +02002509 * @brief Insert node as the first and only child of a parent.
Michal Vasko90932a92020-02-12 14:33:03 +01002510 *
Michal Vasko9f96a052020-03-10 09:41:45 +01002511 * Handles inserting into NP containers and key-less lists.
2512 *
Michal Vasko90932a92020-02-12 14:33:03 +01002513 * @param[in] parent Parent to insert into.
2514 * @param[in] node Node to insert.
2515 */
2516static void
Michal Vaskob104f112020-07-17 09:54:54 +02002517lyd_insert_only_child(struct lyd_node *parent, struct lyd_node *node)
Michal Vasko90932a92020-02-12 14:33:03 +01002518{
2519 struct lyd_node_inner *par;
2520
Radek Krejcia1c1e542020-09-29 16:06:52 +02002521 assert(parent && !lyd_child(parent) && !node->next && (node->prev == node));
Michal Vasko52927e22020-03-16 17:26:14 +01002522 assert(!parent->schema || (parent->schema->nodetype & LYD_NODE_INNER));
Michal Vasko90932a92020-02-12 14:33:03 +01002523
2524 par = (struct lyd_node_inner *)parent;
2525
Michal Vaskob104f112020-07-17 09:54:54 +02002526 par->child = node;
Michal Vasko90932a92020-02-12 14:33:03 +01002527 node->parent = par;
Michal Vasko0249f7c2020-03-05 16:36:40 +01002528
Michal Vaskod989ba02020-08-24 10:59:24 +02002529 for ( ; par; par = par->parent) {
Michal Vasko9f96a052020-03-10 09:41:45 +01002530 if ((par->flags & LYD_DEFAULT) && !(node->flags & LYD_DEFAULT)) {
2531 /* remove default flags from NP containers */
Michal Vasko0249f7c2020-03-05 16:36:40 +01002532 par->flags &= ~LYD_DEFAULT;
2533 }
2534 }
Michal Vasko751cb4d2020-07-14 12:25:28 +02002535}
Michal Vasko0249f7c2020-03-05 16:36:40 +01002536
Michal Vasko751cb4d2020-07-14 12:25:28 +02002537/**
2538 * @brief Learn whether a list instance has all the keys.
2539 *
2540 * @param[in] list List instance to check.
2541 * @return non-zero if all the keys were found,
2542 * @return 0 otherwise.
2543 */
2544static int
2545lyd_insert_has_keys(const struct lyd_node *list)
2546{
2547 const struct lyd_node *key;
2548 const struct lysc_node *skey = NULL;
2549
2550 assert(list->schema->nodetype == LYS_LIST);
Radek Krejcia1c1e542020-09-29 16:06:52 +02002551 key = lyd_child(list);
Michal Vasko751cb4d2020-07-14 12:25:28 +02002552 while ((skey = lys_getnext(skey, list->schema, NULL, 0)) && (skey->flags & LYS_KEY)) {
2553 if (!key || (key->schema != skey)) {
2554 /* key missing */
2555 return 0;
2556 }
2557
2558 key = key->next;
2559 }
2560
2561 /* all keys found */
2562 return 1;
Michal Vasko90932a92020-02-12 14:33:03 +01002563}
2564
2565void
Michal Vasko6ee6f432021-07-16 09:49:14 +02002566lyd_insert_node(struct lyd_node *parent, struct lyd_node **first_sibling_p, struct lyd_node *node, ly_bool last)
Michal Vasko90932a92020-02-12 14:33:03 +01002567{
Michal Vaskob104f112020-07-17 09:54:54 +02002568 struct lyd_node *anchor, *first_sibling;
Michal Vasko90932a92020-02-12 14:33:03 +01002569
Michal Vaskob104f112020-07-17 09:54:54 +02002570 /* inserting list without its keys is not supported */
2571 assert((parent || first_sibling_p) && node && (node->hash || !node->schema));
Michal Vaskof756c942020-11-06 17:21:37 +01002572 assert(!parent || !parent->schema ||
2573 (parent->schema->nodetype & (LYS_CONTAINER | LYS_LIST | LYS_RPC | LYS_ACTION | LYS_NOTIF)));
Michal Vasko9b368d32020-02-14 13:53:31 +01002574
Michal Vaskob104f112020-07-17 09:54:54 +02002575 if (!parent && first_sibling_p && (*first_sibling_p) && (*first_sibling_p)->parent) {
Michal Vasko9e685082021-01-29 14:49:09 +01002576 parent = lyd_parent(*first_sibling_p);
Michal Vasko9b368d32020-02-14 13:53:31 +01002577 }
Michal Vasko90932a92020-02-12 14:33:03 +01002578
Michal Vaskob104f112020-07-17 09:54:54 +02002579 /* get first sibling */
Michal Vasko9e685082021-01-29 14:49:09 +01002580 first_sibling = parent ? lyd_child(parent) : *first_sibling_p;
Michal Vasko9f96a052020-03-10 09:41:45 +01002581
Michal Vasko6ee6f432021-07-16 09:49:14 +02002582 if (last) {
2583 /* no next anchor */
2584 anchor = NULL;
2585 } else {
2586 /* find the anchor, our next node, so we can insert before it */
2587 anchor = lyd_insert_get_next_anchor(first_sibling, node);
2588 }
2589
Michal Vaskob104f112020-07-17 09:54:54 +02002590 if (anchor) {
Michal Vasko6ee6f432021-07-16 09:49:14 +02002591 /* insert before the anchor */
Michal Vaskob104f112020-07-17 09:54:54 +02002592 lyd_insert_before_node(anchor, node);
Michal Vasko26123192020-11-09 21:02:34 +01002593 if (!parent && (*first_sibling_p == anchor)) {
2594 /* move first sibling */
2595 *first_sibling_p = node;
2596 }
Michal Vaskob104f112020-07-17 09:54:54 +02002597 } else if (first_sibling) {
Michal Vasko6ee6f432021-07-16 09:49:14 +02002598 /* insert as the last node */
Michal Vaskob104f112020-07-17 09:54:54 +02002599 lyd_insert_after_node(first_sibling->prev, node);
2600 } else if (parent) {
Michal Vasko6ee6f432021-07-16 09:49:14 +02002601 /* insert as the only child */
Michal Vaskob104f112020-07-17 09:54:54 +02002602 lyd_insert_only_child(parent, node);
Michal Vasko90932a92020-02-12 14:33:03 +01002603 } else {
Michal Vasko6ee6f432021-07-16 09:49:14 +02002604 /* insert as the only sibling */
Michal Vaskob104f112020-07-17 09:54:54 +02002605 *first_sibling_p = node;
2606 }
2607
2608 /* insert into parent HT */
2609 lyd_insert_hash(node);
2610
2611 /* finish hashes for our parent, if needed and possible */
Michal Vasko9e8de2d2020-09-01 08:17:10 +02002612 if (node->schema && (node->schema->flags & LYS_KEY) && parent && lyd_insert_has_keys(parent)) {
Michal Vaskob104f112020-07-17 09:54:54 +02002613 lyd_hash(parent);
2614
2615 /* now we can insert even the list into its parent HT */
2616 lyd_insert_hash(parent);
Michal Vasko90932a92020-02-12 14:33:03 +01002617 }
Michal Vasko90932a92020-02-12 14:33:03 +01002618}
2619
Michal Vasko717a4c32020-12-07 09:40:10 +01002620/**
2621 * @brief Check schema place of a node to be inserted.
2622 *
2623 * @param[in] parent Schema node of the parent data node.
2624 * @param[in] sibling Schema node of a sibling data node.
2625 * @param[in] schema Schema node if the data node to be inserted.
2626 * @return LY_SUCCESS on success.
2627 * @return LY_EINVAL if the place is invalid.
2628 */
Michal Vaskof03ed032020-03-04 13:31:44 +01002629static LY_ERR
Michal Vasko717a4c32020-12-07 09:40:10 +01002630lyd_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 +01002631{
2632 const struct lysc_node *par2;
2633
Michal Vasko62ed12d2020-05-21 10:08:25 +02002634 assert(!parent || !(parent->nodetype & (LYS_CASE | LYS_CHOICE)));
Michal Vasko717a4c32020-12-07 09:40:10 +01002635 assert(!sibling || !(sibling->nodetype & (LYS_CASE | LYS_CHOICE)));
2636 assert(!schema || !(schema->nodetype & (LYS_CASE | LYS_CHOICE)));
Michal Vaskof03ed032020-03-04 13:31:44 +01002637
Michal Vasko717a4c32020-12-07 09:40:10 +01002638 if (!schema || (!parent && !sibling)) {
Michal Vasko71e795e2020-12-04 16:27:37 +01002639 /* opaque nodes can be inserted wherever */
2640 return LY_SUCCESS;
2641 }
2642
Michal Vasko717a4c32020-12-07 09:40:10 +01002643 if (!parent) {
2644 parent = lysc_data_parent(sibling);
2645 }
2646
Michal Vaskof03ed032020-03-04 13:31:44 +01002647 /* find schema parent */
Michal Vasko62ed12d2020-05-21 10:08:25 +02002648 par2 = lysc_data_parent(schema);
Michal Vaskof03ed032020-03-04 13:31:44 +01002649
2650 if (parent) {
2651 /* inner node */
2652 if (par2 != parent) {
Michal Vaskob104f112020-07-17 09:54:54 +02002653 LOGERR(schema->module->ctx, LY_EINVAL, "Cannot insert, parent of \"%s\" is not \"%s\".", schema->name,
Michal Vasko69730152020-10-09 16:30:07 +02002654 parent->name);
Michal Vaskof03ed032020-03-04 13:31:44 +01002655 return LY_EINVAL;
2656 }
2657 } else {
2658 /* top-level node */
2659 if (par2) {
Radek Krejcif6d14cb2020-07-02 16:11:45 +02002660 LOGERR(schema->module->ctx, LY_EINVAL, "Cannot insert, node \"%s\" is not top-level.", schema->name);
Michal Vaskof03ed032020-03-04 13:31:44 +01002661 return LY_EINVAL;
2662 }
2663 }
2664
2665 return LY_SUCCESS;
2666}
2667
Jan Kundrátc6e39de2021-12-09 16:01:19 +01002668LIBYANG_API_DEF LY_ERR
Michal Vaskob104f112020-07-17 09:54:54 +02002669lyd_insert_child(struct lyd_node *parent, struct lyd_node *node)
Michal Vaskof03ed032020-03-04 13:31:44 +01002670{
2671 struct lyd_node *iter;
2672
Michal Vasko0ab974d2021-02-24 13:18:26 +01002673 LY_CHECK_ARG_RET(NULL, parent, node, !parent->schema || (parent->schema->nodetype & LYD_NODE_INNER), LY_EINVAL);
Michal Vasko1d80a532021-11-24 10:41:05 +01002674 LY_CHECK_CTX_EQUAL_RET(LYD_CTX(parent), LYD_CTX(node), LY_EINVAL);
Michal Vaskof03ed032020-03-04 13:31:44 +01002675
Michal Vasko717a4c32020-12-07 09:40:10 +01002676 LY_CHECK_RET(lyd_insert_check_schema(parent->schema, NULL, node->schema));
Michal Vaskof03ed032020-03-04 13:31:44 +01002677
Michal Vasko0ab974d2021-02-24 13:18:26 +01002678 if (node->schema && (node->schema->flags & LYS_KEY)) {
Michal Vaskoaac267d2022-01-17 13:34:48 +01002679 LOGERR(LYD_CTX(parent), LY_EINVAL, "Cannot insert key \"%s\".", node->schema->name);
Michal Vaskof03ed032020-03-04 13:31:44 +01002680 return LY_EINVAL;
2681 }
2682
2683 if (node->parent || node->prev->next) {
2684 lyd_unlink_tree(node);
2685 }
2686
2687 while (node) {
2688 iter = node->next;
2689 lyd_unlink_tree(node);
Michal Vasko6ee6f432021-07-16 09:49:14 +02002690 lyd_insert_node(parent, NULL, node, 0);
Michal Vaskof03ed032020-03-04 13:31:44 +01002691 node = iter;
2692 }
2693 return LY_SUCCESS;
2694}
2695
Jan Kundrátc6e39de2021-12-09 16:01:19 +01002696LIBYANG_API_DEF LY_ERR
Michal Vaskoaac267d2022-01-17 13:34:48 +01002697lyd_insert_ext(struct lyd_node *parent, struct lyd_node *first)
2698{
2699 struct lyd_node *iter;
2700
2701 LY_CHECK_ARG_RET(NULL, parent, first, !first->parent, !first->prev->next,
2702 !parent->schema || (parent->schema->nodetype & LYD_NODE_INNER), LY_EINVAL);
2703
2704 if (first->schema && (first->schema->flags & LYS_KEY)) {
2705 LOGERR(LYD_CTX(parent), LY_EINVAL, "Cannot insert key \"%s\".", first->schema->name);
2706 return LY_EINVAL;
2707 }
2708
2709 while (first) {
2710 iter = first->next;
2711 lyd_unlink_tree(first);
Michal Vaskoc08b9d22022-02-10 15:48:39 +01002712 lyd_insert_node(parent, NULL, first, 1);
Michal Vaskoaac267d2022-01-17 13:34:48 +01002713 first = iter;
2714 }
2715 return LY_SUCCESS;
2716}
2717
2718LIBYANG_API_DEF LY_ERR
Michal Vaskob104f112020-07-17 09:54:54 +02002719lyd_insert_sibling(struct lyd_node *sibling, struct lyd_node *node, struct lyd_node **first)
Michal Vaskob1b5c262020-03-05 14:29:47 +01002720{
2721 struct lyd_node *iter;
2722
Michal Vaskob104f112020-07-17 09:54:54 +02002723 LY_CHECK_ARG_RET(NULL, node, LY_EINVAL);
Michal Vasko1d80a532021-11-24 10:41:05 +01002724 LY_CHECK_CTX_EQUAL_RET(sibling ? LYD_CTX(sibling) : NULL, LYD_CTX(node), LY_EINVAL);
Michal Vaskob1b5c262020-03-05 14:29:47 +01002725
Michal Vaskob104f112020-07-17 09:54:54 +02002726 if (sibling) {
Michal Vasko717a4c32020-12-07 09:40:10 +01002727 LY_CHECK_RET(lyd_insert_check_schema(NULL, sibling->schema, node->schema));
Michal Vaskob1b5c262020-03-05 14:29:47 +01002728 }
2729
Michal Vasko553d0b52020-12-04 16:27:52 +01002730 if (sibling == node) {
2731 /* we need to keep the connection to siblings so we can insert into them */
2732 sibling = sibling->prev;
2733 }
2734
Michal Vaskob1b5c262020-03-05 14:29:47 +01002735 if (node->parent || node->prev->next) {
2736 lyd_unlink_tree(node);
2737 }
2738
2739 while (node) {
Michal Vasko71e795e2020-12-04 16:27:37 +01002740 if (lysc_is_key(node->schema)) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02002741 LOGERR(LYD_CTX(node), LY_EINVAL, "Cannot insert key \"%s\".", node->schema->name);
Michal Vaskob104f112020-07-17 09:54:54 +02002742 return LY_EINVAL;
2743 }
2744
Michal Vaskob1b5c262020-03-05 14:29:47 +01002745 iter = node->next;
2746 lyd_unlink_tree(node);
Michal Vasko6ee6f432021-07-16 09:49:14 +02002747 lyd_insert_node(NULL, &sibling, node, 0);
Michal Vaskob1b5c262020-03-05 14:29:47 +01002748 node = iter;
2749 }
Michal Vaskob1b5c262020-03-05 14:29:47 +01002750
Michal Vaskob104f112020-07-17 09:54:54 +02002751 if (first) {
2752 /* find the first sibling */
2753 *first = sibling;
2754 while ((*first)->prev->next) {
2755 *first = (*first)->prev;
Michal Vasko0249f7c2020-03-05 16:36:40 +01002756 }
2757 }
2758
2759 return LY_SUCCESS;
2760}
2761
Jan Kundrátc6e39de2021-12-09 16:01:19 +01002762LIBYANG_API_DEF LY_ERR
Michal Vaskof03ed032020-03-04 13:31:44 +01002763lyd_insert_before(struct lyd_node *sibling, struct lyd_node *node)
2764{
Michal Vaskof03ed032020-03-04 13:31:44 +01002765 LY_CHECK_ARG_RET(NULL, sibling, node, LY_EINVAL);
Michal Vasko1d80a532021-11-24 10:41:05 +01002766 LY_CHECK_CTX_EQUAL_RET(LYD_CTX(sibling), LYD_CTX(node), LY_EINVAL);
Michal Vaskof03ed032020-03-04 13:31:44 +01002767
Michal Vasko717a4c32020-12-07 09:40:10 +01002768 LY_CHECK_RET(lyd_insert_check_schema(NULL, sibling->schema, node->schema));
Michal Vaskof03ed032020-03-04 13:31:44 +01002769
Michal Vaskob104f112020-07-17 09:54:54 +02002770 if (!(node->schema->nodetype & (LYS_LIST | LYS_LEAFLIST)) || !(node->schema->flags & LYS_ORDBY_USER)) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02002771 LOGERR(LYD_CTX(sibling), LY_EINVAL, "Can be used only for user-ordered nodes.");
Michal Vaskof03ed032020-03-04 13:31:44 +01002772 return LY_EINVAL;
2773 }
2774
Michal Vasko4bc2ce32020-12-08 10:06:16 +01002775 lyd_unlink_tree(node);
2776 lyd_insert_before_node(sibling, node);
2777 lyd_insert_hash(node);
Michal Vaskof03ed032020-03-04 13:31:44 +01002778
Michal Vaskof03ed032020-03-04 13:31:44 +01002779 return LY_SUCCESS;
2780}
2781
Jan Kundrátc6e39de2021-12-09 16:01:19 +01002782LIBYANG_API_DEF LY_ERR
Michal Vaskof03ed032020-03-04 13:31:44 +01002783lyd_insert_after(struct lyd_node *sibling, struct lyd_node *node)
2784{
Michal Vaskof03ed032020-03-04 13:31:44 +01002785 LY_CHECK_ARG_RET(NULL, sibling, node, LY_EINVAL);
Michal Vasko1d80a532021-11-24 10:41:05 +01002786 LY_CHECK_CTX_EQUAL_RET(LYD_CTX(sibling), LYD_CTX(node), LY_EINVAL);
Michal Vaskof03ed032020-03-04 13:31:44 +01002787
Michal Vasko717a4c32020-12-07 09:40:10 +01002788 LY_CHECK_RET(lyd_insert_check_schema(NULL, sibling->schema, node->schema));
Michal Vaskof03ed032020-03-04 13:31:44 +01002789
Michal Vaskob104f112020-07-17 09:54:54 +02002790 if (!(node->schema->nodetype & (LYS_LIST | LYS_LEAFLIST)) || !(node->schema->flags & LYS_ORDBY_USER)) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02002791 LOGERR(LYD_CTX(sibling), LY_EINVAL, "Can be used only for user-ordered nodes.");
Michal Vaskof03ed032020-03-04 13:31:44 +01002792 return LY_EINVAL;
2793 }
2794
Michal Vasko4bc2ce32020-12-08 10:06:16 +01002795 lyd_unlink_tree(node);
2796 lyd_insert_after_node(sibling, node);
2797 lyd_insert_hash(node);
Michal Vaskof03ed032020-03-04 13:31:44 +01002798
Michal Vaskof03ed032020-03-04 13:31:44 +01002799 return LY_SUCCESS;
2800}
2801
Jan Kundrátc6e39de2021-12-09 16:01:19 +01002802LIBYANG_API_DEF void
Michal Vasko66d508c2021-07-21 16:07:09 +02002803lyd_unlink_siblings(struct lyd_node *node)
2804{
2805 struct lyd_node *next, *elem, *first = NULL;
2806
2807 LY_LIST_FOR_SAFE(node, next, elem) {
2808 lyd_unlink_tree(elem);
2809 lyd_insert_node(NULL, &first, elem, 1);
2810 }
2811}
2812
Jan Kundrátc6e39de2021-12-09 16:01:19 +01002813LIBYANG_API_DEF void
Michal Vaskof03ed032020-03-04 13:31:44 +01002814lyd_unlink_tree(struct lyd_node *node)
2815{
2816 struct lyd_node *iter;
2817
2818 if (!node) {
2819 return;
2820 }
2821
Michal Vaskob104f112020-07-17 09:54:54 +02002822 /* update hashes while still linked into the tree */
2823 lyd_unlink_hash(node);
2824
Michal Vaskof03ed032020-03-04 13:31:44 +01002825 /* unlink from siblings */
2826 if (node->prev->next) {
2827 node->prev->next = node->next;
2828 }
2829 if (node->next) {
2830 node->next->prev = node->prev;
2831 } else {
2832 /* unlinking the last node */
2833 if (node->parent) {
2834 iter = node->parent->child;
2835 } else {
2836 iter = node->prev;
2837 while (iter->prev != node) {
2838 iter = iter->prev;
2839 }
2840 }
2841 /* update the "last" pointer from the first node */
2842 iter->prev = node->prev;
2843 }
2844
2845 /* unlink from parent */
2846 if (node->parent) {
2847 if (node->parent->child == node) {
2848 /* the node is the first child */
2849 node->parent->child = node->next;
2850 }
2851
Michal Vaskoab49dbe2020-07-17 12:32:47 +02002852 /* check for NP container whether its last non-default node is not being unlinked */
Michal Vasko69730152020-10-09 16:30:07 +02002853 if (node->parent->schema && (node->parent->schema->nodetype == LYS_CONTAINER) &&
2854 !(node->parent->flags & LYD_DEFAULT) && !(node->parent->schema->flags & LYS_PRESENCE)) {
Michal Vaskoab49dbe2020-07-17 12:32:47 +02002855 LY_LIST_FOR(node->parent->child, iter) {
2856 if ((iter != node) && !(iter->flags & LYD_DEFAULT)) {
2857 break;
2858 }
2859 }
2860 if (!iter) {
2861 node->parent->flags |= LYD_DEFAULT;
2862 }
2863 }
2864
Michal Vaskof03ed032020-03-04 13:31:44 +01002865 node->parent = NULL;
2866 }
2867
2868 node->next = NULL;
2869 node->prev = node;
2870}
2871
Michal Vaskoa5da3292020-08-12 13:10:50 +02002872void
Michal Vasko871a0252020-11-11 18:35:24 +01002873lyd_insert_meta(struct lyd_node *parent, struct lyd_meta *meta, ly_bool clear_dflt)
Radek Krejci1798aae2020-07-14 13:26:06 +02002874{
2875 struct lyd_meta *last, *iter;
2876
2877 assert(parent);
Michal Vaskoa5da3292020-08-12 13:10:50 +02002878
2879 if (!meta) {
2880 return;
2881 }
Radek Krejci1798aae2020-07-14 13:26:06 +02002882
2883 for (iter = meta; iter; iter = iter->next) {
2884 iter->parent = parent;
2885 }
2886
2887 /* insert as the last attribute */
2888 if (parent->meta) {
Radek Krejci1e008d22020-08-17 11:37:37 +02002889 for (last = parent->meta; last->next; last = last->next) {}
Radek Krejci1798aae2020-07-14 13:26:06 +02002890 last->next = meta;
2891 } else {
2892 parent->meta = meta;
2893 }
2894
2895 /* remove default flags from NP containers */
Michal Vasko871a0252020-11-11 18:35:24 +01002896 while (clear_dflt && parent && (parent->schema->nodetype == LYS_CONTAINER) && (parent->flags & LYD_DEFAULT)) {
Radek Krejci1798aae2020-07-14 13:26:06 +02002897 parent->flags &= ~LYD_DEFAULT;
Michal Vasko9e685082021-01-29 14:49:09 +01002898 parent = lyd_parent(parent);
Radek Krejci1798aae2020-07-14 13:26:06 +02002899 }
Radek Krejci1798aae2020-07-14 13:26:06 +02002900}
2901
2902LY_ERR
Michal Vasko9f96a052020-03-10 09:41:45 +01002903lyd_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 +02002904 size_t name_len, const char *value, size_t value_len, ly_bool *dynamic, LY_VALUE_FORMAT format,
Michal Vaskoaac267d2022-01-17 13:34:48 +01002905 void *prefix_data, uint32_t hints, const struct lysc_node *ctx_node, ly_bool clear_dflt, ly_bool *incomplete)
Michal Vasko90932a92020-02-12 14:33:03 +01002906{
Radek Krejci2efc45b2020-12-22 16:25:44 +01002907 LY_ERR ret = LY_SUCCESS;
Michal Vasko90932a92020-02-12 14:33:03 +01002908 struct lysc_ext_instance *ant = NULL;
Michal Vaskob0534f92021-07-01 13:24:03 +02002909 const struct lysc_type **ant_type;
Michal Vasko9f96a052020-03-10 09:41:45 +01002910 struct lyd_meta *mt, *last;
Michal Vaskofd69e1d2020-07-03 11:57:17 +02002911 LY_ARRAY_COUNT_TYPE u;
Michal Vasko90932a92020-02-12 14:33:03 +01002912
Michal Vasko9f96a052020-03-10 09:41:45 +01002913 assert((parent || meta) && mod);
Michal Vasko6f4cbb62020-02-28 11:15:47 +01002914
Michal Vaskoaac267d2022-01-17 13:34:48 +01002915 LOG_LOCSET(ctx_node, parent, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +01002916
Radek Krejci7eb54ba2020-05-18 16:30:04 +02002917 LY_ARRAY_FOR(mod->compiled->exts, u) {
Radek Krejci3e6632f2021-03-22 22:08:21 +01002918 if ((mod->compiled->exts[u].def->plugin == lyplg_find(LYPLG_EXTENSION, LYEXT_PLUGIN_INTERNAL_ANNOTATION)) &&
Radek Krejci7eb54ba2020-05-18 16:30:04 +02002919 !ly_strncmp(mod->compiled->exts[u].argument, name, name_len)) {
Michal Vasko90932a92020-02-12 14:33:03 +01002920 /* we have the annotation definition */
Radek Krejci7eb54ba2020-05-18 16:30:04 +02002921 ant = &mod->compiled->exts[u];
Michal Vasko90932a92020-02-12 14:33:03 +01002922 break;
2923 }
2924 }
2925 if (!ant) {
2926 /* attribute is not defined as a metadata annotation (RFC 7952) */
Radek Krejci2efc45b2020-12-22 16:25:44 +01002927 LOGVAL(mod->ctx, LYVE_REFERENCE, "Annotation definition for attribute \"%s:%.*s\" not found.",
Radek Krejci422afb12021-03-04 16:38:16 +01002928 mod->name, (int)name_len, name);
Radek Krejci2efc45b2020-12-22 16:25:44 +01002929 ret = LY_EINVAL;
2930 goto cleanup;
Michal Vasko90932a92020-02-12 14:33:03 +01002931 }
2932
Michal Vasko9f96a052020-03-10 09:41:45 +01002933 mt = calloc(1, sizeof *mt);
Radek Krejci2efc45b2020-12-22 16:25:44 +01002934 LY_CHECK_ERR_GOTO(!mt, LOGMEM(mod->ctx); ret = LY_EMEM, cleanup);
Michal Vasko9f96a052020-03-10 09:41:45 +01002935 mt->parent = parent;
2936 mt->annotation = ant;
Michal Vaskob0534f92021-07-01 13:24:03 +02002937 ant_type = ant->substmts[ANNOTATION_SUBSTMT_TYPE].storage;
2938 ret = lyd_value_store(mod->ctx, &mt->value, *ant_type, value, value_len, dynamic, format, prefix_data, hints,
Michal Vaskoaac267d2022-01-17 13:34:48 +01002939 ctx_node, incomplete);
Radek Krejci2efc45b2020-12-22 16:25:44 +01002940 LY_CHECK_ERR_GOTO(ret, free(mt), cleanup);
2941 ret = lydict_insert(mod->ctx, name, name_len, &mt->name);
2942 LY_CHECK_ERR_GOTO(ret, free(mt), cleanup);
Michal Vasko90932a92020-02-12 14:33:03 +01002943
Michal Vasko6f4cbb62020-02-28 11:15:47 +01002944 /* insert as the last attribute */
2945 if (parent) {
Michal Vasko871a0252020-11-11 18:35:24 +01002946 lyd_insert_meta(parent, mt, clear_dflt);
Michal Vasko9f96a052020-03-10 09:41:45 +01002947 } else if (*meta) {
Radek Krejci1e008d22020-08-17 11:37:37 +02002948 for (last = *meta; last->next; last = last->next) {}
Michal Vasko9f96a052020-03-10 09:41:45 +01002949 last->next = mt;
Michal Vasko90932a92020-02-12 14:33:03 +01002950 }
2951
Michal Vasko9f96a052020-03-10 09:41:45 +01002952 if (meta) {
2953 *meta = mt;
Michal Vasko90932a92020-02-12 14:33:03 +01002954 }
Radek Krejci2efc45b2020-12-22 16:25:44 +01002955
2956cleanup:
Michal Vaskoaac267d2022-01-17 13:34:48 +01002957 LOG_LOCBACK(ctx_node ? 1 : 0, parent ? 1 : 0, 0, 0);
Radek Krejci2efc45b2020-12-22 16:25:44 +01002958 return ret;
Michal Vasko90932a92020-02-12 14:33:03 +01002959}
2960
Michal Vaskoa5da3292020-08-12 13:10:50 +02002961void
2962lyd_insert_attr(struct lyd_node *parent, struct lyd_attr *attr)
2963{
2964 struct lyd_attr *last, *iter;
2965 struct lyd_node_opaq *opaq;
2966
2967 assert(parent && !parent->schema);
2968
2969 if (!attr) {
2970 return;
2971 }
2972
2973 opaq = (struct lyd_node_opaq *)parent;
2974 for (iter = attr; iter; iter = iter->next) {
2975 iter->parent = opaq;
2976 }
2977
2978 /* insert as the last attribute */
2979 if (opaq->attr) {
Radek Krejci1e008d22020-08-17 11:37:37 +02002980 for (last = opaq->attr; last->next; last = last->next) {}
Michal Vaskoa5da3292020-08-12 13:10:50 +02002981 last->next = attr;
2982 } else {
2983 opaq->attr = attr;
2984 }
2985}
2986
Michal Vasko52927e22020-03-16 17:26:14 +01002987LY_ERR
Michal Vaskofeca4fb2020-10-05 08:58:40 +02002988lyd_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 +01002989 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 +02002990 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 +01002991{
Radek Krejci011e4aa2020-09-04 15:22:31 +02002992 LY_ERR ret = LY_SUCCESS;
Radek Krejci1798aae2020-07-14 13:26:06 +02002993 struct lyd_attr *at, *last;
Michal Vasko52927e22020-03-16 17:26:14 +01002994
2995 assert(ctx && (parent || attr) && (!parent || !parent->schema));
Michal Vaskofeca4fb2020-10-05 08:58:40 +02002996 assert(name && name_len && format);
Michal Vasko52927e22020-03-16 17:26:14 +01002997
Michal Vasko2a3722d2021-06-16 11:52:39 +02002998 if (!value_len && (!dynamic || !*dynamic)) {
Michal Vasko52927e22020-03-16 17:26:14 +01002999 value = "";
3000 }
3001
3002 at = calloc(1, sizeof *at);
Michal Vasko6b5cb2a2020-11-11 19:11:21 +01003003 LY_CHECK_ERR_RET(!at, LOGMEM(ctx); ly_free_prefix_data(format, val_prefix_data), LY_EMEM);
Radek Krejcid46e46a2020-09-15 14:22:42 +02003004
Michal Vaskoad92b672020-11-12 13:11:31 +01003005 LY_CHECK_GOTO(ret = lydict_insert(ctx, name, name_len, &at->name.name), finish);
Michal Vasko501af032020-11-11 20:27:44 +01003006 if (prefix_len) {
Michal Vaskoad92b672020-11-12 13:11:31 +01003007 LY_CHECK_GOTO(ret = lydict_insert(ctx, prefix, prefix_len, &at->name.prefix), finish);
Michal Vasko501af032020-11-11 20:27:44 +01003008 }
3009 if (module_key_len) {
Michal Vaskoad92b672020-11-12 13:11:31 +01003010 LY_CHECK_GOTO(ret = lydict_insert(ctx, module_key, module_key_len, &at->name.module_ns), finish);
Michal Vasko501af032020-11-11 20:27:44 +01003011 }
3012
Michal Vasko52927e22020-03-16 17:26:14 +01003013 if (dynamic && *dynamic) {
Radek Krejci011e4aa2020-09-04 15:22:31 +02003014 ret = lydict_insert_zc(ctx, (char *)value, &at->value);
3015 LY_CHECK_GOTO(ret, finish);
Michal Vasko52927e22020-03-16 17:26:14 +01003016 *dynamic = 0;
3017 } else {
Radek Krejci011e4aa2020-09-04 15:22:31 +02003018 LY_CHECK_GOTO(ret = lydict_insert(ctx, value, value_len, &at->value), finish);
Michal Vasko52927e22020-03-16 17:26:14 +01003019 }
Michal Vasko501af032020-11-11 20:27:44 +01003020 at->format = format;
3021 at->val_prefix_data = val_prefix_data;
3022 at->hints = hints;
Michal Vasko52927e22020-03-16 17:26:14 +01003023
3024 /* insert as the last attribute */
3025 if (parent) {
Michal Vaskoa5da3292020-08-12 13:10:50 +02003026 lyd_insert_attr(parent, at);
Michal Vasko52927e22020-03-16 17:26:14 +01003027 } else if (*attr) {
Radek Krejci1e008d22020-08-17 11:37:37 +02003028 for (last = *attr; last->next; last = last->next) {}
Michal Vasko52927e22020-03-16 17:26:14 +01003029 last->next = at;
3030 }
3031
Radek Krejci011e4aa2020-09-04 15:22:31 +02003032finish:
3033 if (ret) {
3034 lyd_free_attr_single(ctx, at);
3035 } else if (attr) {
Michal Vasko52927e22020-03-16 17:26:14 +01003036 *attr = at;
3037 }
3038 return LY_SUCCESS;
3039}
3040
Jan Kundrátc6e39de2021-12-09 16:01:19 +01003041LIBYANG_API_DEF const struct lyd_node_term *
Michal Vasko004d3152020-06-11 19:59:22 +02003042lyd_target(const struct ly_path *path, const struct lyd_node *tree)
Radek Krejci084289f2019-07-09 17:35:30 +02003043{
Michal Vasko004d3152020-06-11 19:59:22 +02003044 struct lyd_node *target;
Radek Krejci084289f2019-07-09 17:35:30 +02003045
Michal Vasko004d3152020-06-11 19:59:22 +02003046 if (ly_path_eval(path, tree, &target)) {
3047 return NULL;
Radek Krejci084289f2019-07-09 17:35:30 +02003048 }
3049
Michal Vasko004d3152020-06-11 19:59:22 +02003050 return (struct lyd_node_term *)target;
Radek Krejci084289f2019-07-09 17:35:30 +02003051}
3052
aPiecek2f63f952021-03-30 12:22:18 +02003053/**
3054 * @brief Check the equality of the two schemas from different contexts.
3055 *
3056 * @param schema1 of first node.
3057 * @param schema2 of second node.
3058 * @return 1 if the schemas are equal otherwise 0.
3059 */
3060static ly_bool
3061lyd_compare_schema_equal(const struct lysc_node *schema1, const struct lysc_node *schema2)
3062{
3063 if (!schema1 && !schema2) {
3064 return 1;
3065 } else if (!schema1 || !schema2) {
3066 return 0;
3067 }
3068
3069 assert(schema1->module->ctx != schema2->module->ctx);
3070
3071 if (schema1->nodetype != schema2->nodetype) {
3072 return 0;
3073 }
3074
3075 if (strcmp(schema1->name, schema2->name)) {
3076 return 0;
3077 }
3078
3079 if (strcmp(schema1->module->name, schema2->module->name)) {
3080 return 0;
3081 }
3082
3083 if (schema1->module->revision || schema2->module->revision) {
3084 if (!schema1->module->revision || !schema2->module->revision) {
3085 return 0;
3086 }
3087 if (strcmp(schema1->module->revision, schema2->module->revision)) {
3088 return 0;
3089 }
3090 }
3091
3092 return 1;
3093}
3094
3095/**
3096 * @brief Check the equality of the schemas for all parent nodes.
3097 *
3098 * Both nodes must be from different contexts.
3099 *
3100 * @param node1 Data of first node.
3101 * @param node2 Data of second node.
3102 * @return 1 if the all related parental schemas are equal otherwise 0.
3103 */
3104static ly_bool
3105lyd_compare_schema_parents_equal(const struct lyd_node *node1, const struct lyd_node *node2)
3106{
3107 const struct lysc_node *parent1, *parent2;
3108
3109 assert(node1 && node2);
3110
3111 for (parent1 = node1->schema->parent, parent2 = node2->schema->parent;
3112 parent1 && parent2;
3113 parent1 = parent1->parent, parent2 = parent2->parent) {
3114 if (!lyd_compare_schema_equal(parent1, parent2)) {
3115 return 0;
3116 }
3117 }
3118
3119 if (parent1 || parent2) {
3120 return 0;
3121 }
3122
3123 return 1;
3124}
3125
3126/**
3127 * @brief Internal implementation of @ref lyd_compare_single.
3128 * @copydoc lyd_compare_single
3129 * @param[in] parental_schemas_checked Flag used for optimization.
3130 * When this function is called for the first time, the flag must be set to 0.
3131 * The @ref lyd_compare_schema_parents_equal should be called only once during
3132 * recursive calls, and this is accomplished by setting to 1 in the lyd_compare_single_ body.
3133 */
3134static LY_ERR
3135lyd_compare_single_(const struct lyd_node *node1, const struct lyd_node *node2,
3136 uint32_t options, ly_bool parental_schemas_checked)
Radek Krejci1f05b6a2019-07-18 16:15:06 +02003137{
3138 const struct lyd_node *iter1, *iter2;
3139 struct lyd_node_term *term1, *term2;
3140 struct lyd_node_any *any1, *any2;
Michal Vasko52927e22020-03-16 17:26:14 +01003141 struct lyd_node_opaq *opaq1, *opaq2;
Radek Krejci1f05b6a2019-07-18 16:15:06 +02003142 size_t len1, len2;
Radek Krejci084289f2019-07-09 17:35:30 +02003143
Radek Krejci1f05b6a2019-07-18 16:15:06 +02003144 if (!node1 || !node2) {
3145 if (node1 == node2) {
3146 return LY_SUCCESS;
3147 } else {
3148 return LY_ENOT;
3149 }
3150 }
3151
aPiecek2f63f952021-03-30 12:22:18 +02003152 if (LYD_CTX(node1) == LYD_CTX(node2)) {
3153 /* same contexts */
3154 if (node1->schema != node2->schema) {
3155 return LY_ENOT;
3156 }
3157 } else {
3158 /* different contexts */
3159 if (!lyd_compare_schema_equal(node1->schema, node2->schema)) {
3160 return LY_ENOT;
3161 }
3162 if (!parental_schemas_checked) {
3163 if (!lyd_compare_schema_parents_equal(node1, node2)) {
3164 return LY_ENOT;
3165 }
3166 parental_schemas_checked = 1;
3167 }
Radek Krejci1f05b6a2019-07-18 16:15:06 +02003168 }
3169
3170 if (node1->hash != node2->hash) {
3171 return LY_ENOT;
3172 }
aPiecek2f63f952021-03-30 12:22:18 +02003173 /* 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 +02003174
Michal Vasko52927e22020-03-16 17:26:14 +01003175 if (!node1->schema) {
3176 opaq1 = (struct lyd_node_opaq *)node1;
3177 opaq2 = (struct lyd_node_opaq *)node2;
aPiecek2f63f952021-03-30 12:22:18 +02003178 if ((strcmp(opaq1->name.name, opaq2->name.name)) || (opaq1->format != opaq2->format) ||
3179 (strcmp(opaq1->name.module_ns, opaq2->name.module_ns))) {
Radek Krejci1f05b6a2019-07-18 16:15:06 +02003180 return LY_ENOT;
3181 }
Michal Vasko52927e22020-03-16 17:26:14 +01003182 switch (opaq1->format) {
Radek Krejci8df109d2021-04-23 12:19:08 +02003183 case LY_VALUE_XML:
Radek Krejci09c77442021-04-26 11:10:34 +02003184 if (lyxml_value_compare(LYD_CTX(node1), opaq1->value, opaq1->val_prefix_data, LYD_CTX(node2), opaq2->value,
3185 opaq2->val_prefix_data)) {
Michal Vasko52927e22020-03-16 17:26:14 +01003186 return LY_ENOT;
3187 }
3188 break;
Radek Krejci8df109d2021-04-23 12:19:08 +02003189 case LY_VALUE_JSON:
Radek Krejci1798aae2020-07-14 13:26:06 +02003190 /* prefixes in JSON are unique, so it is not necessary to canonize the values */
3191 if (strcmp(opaq1->value, opaq2->value)) {
3192 return LY_ENOT;
3193 }
3194 break;
Michal Vasko6b5cb2a2020-11-11 19:11:21 +01003195 default:
Michal Vasko52927e22020-03-16 17:26:14 +01003196 /* not allowed */
Michal Vaskob7be7a82020-08-20 09:09:04 +02003197 LOGINT(LYD_CTX(node1));
Michal Vasko52927e22020-03-16 17:26:14 +01003198 return LY_EINT;
3199 }
3200 if (options & LYD_COMPARE_FULL_RECURSION) {
3201 iter1 = opaq1->child;
3202 iter2 = opaq2->child;
Radek Krejci1f05b6a2019-07-18 16:15:06 +02003203 goto all_children_compare;
Michal Vasko52927e22020-03-16 17:26:14 +01003204 }
3205 return LY_SUCCESS;
3206 } else {
3207 switch (node1->schema->nodetype) {
3208 case LYS_LEAF:
3209 case LYS_LEAFLIST:
3210 if (options & LYD_COMPARE_DEFAULTS) {
3211 if ((node1->flags & LYD_DEFAULT) != (node2->flags & LYD_DEFAULT)) {
3212 return LY_ENOT;
3213 }
3214 }
3215
Michal Vasko1a2bf2e2020-06-16 13:07:48 +02003216 term1 = (struct lyd_node_term *)node1;
3217 term2 = (struct lyd_node_term *)node2;
aPiecek2f63f952021-03-30 12:22:18 +02003218
3219 /* same contexts */
3220 if (LYD_CTX(node1) == LYD_CTX(node2)) {
3221 return term1->value.realtype->plugin->compare(&term1->value, &term2->value);
3222 }
3223
3224 /* different contexts */
Radek Krejci6d5ba0c2021-04-26 07:49:59 +02003225 if (strcmp(lyd_get_value(node1), lyd_get_value(node2))) {
aPiecek2f63f952021-03-30 12:22:18 +02003226 return LY_ENOT;
3227 }
3228 return LY_SUCCESS;
Michal Vasko52927e22020-03-16 17:26:14 +01003229 case LYS_CONTAINER:
3230 if (options & LYD_COMPARE_DEFAULTS) {
3231 if ((node1->flags & LYD_DEFAULT) != (node2->flags & LYD_DEFAULT)) {
3232 return LY_ENOT;
3233 }
3234 }
3235 if (options & LYD_COMPARE_FULL_RECURSION) {
Michal Vasko9e685082021-01-29 14:49:09 +01003236 iter1 = lyd_child(node1);
3237 iter2 = lyd_child(node2);
Michal Vasko52927e22020-03-16 17:26:14 +01003238 goto all_children_compare;
Radek Krejci1f05b6a2019-07-18 16:15:06 +02003239 }
3240 return LY_SUCCESS;
Michal Vasko1bf09392020-03-27 12:38:10 +01003241 case LYS_RPC:
Michal Vasko52927e22020-03-16 17:26:14 +01003242 case LYS_ACTION:
3243 if (options & LYD_COMPARE_FULL_RECURSION) {
3244 /* TODO action/RPC
3245 goto all_children_compare;
3246 */
Radek Krejci1f05b6a2019-07-18 16:15:06 +02003247 }
3248 return LY_SUCCESS;
Michal Vasko52927e22020-03-16 17:26:14 +01003249 case LYS_NOTIF:
3250 if (options & LYD_COMPARE_FULL_RECURSION) {
3251 /* TODO Notification
3252 goto all_children_compare;
3253 */
3254 }
3255 return LY_SUCCESS;
3256 case LYS_LIST:
Michal Vasko9e685082021-01-29 14:49:09 +01003257 iter1 = lyd_child(node1);
3258 iter2 = lyd_child(node2);
Michal Vasko52927e22020-03-16 17:26:14 +01003259
3260 if (!(node1->schema->flags & LYS_KEYLESS) && !(options & LYD_COMPARE_FULL_RECURSION)) {
3261 /* lists with keys, their equivalence is based on their keys */
Michal Vasko544e58a2021-01-28 14:33:41 +01003262 for (const struct lysc_node *key = lysc_node_child(node1->schema);
Michal Vaskoc57d9a92020-06-23 13:28:27 +02003263 key && (key->flags & LYS_KEY);
Michal Vasko52927e22020-03-16 17:26:14 +01003264 key = key->next) {
aPiecek2f63f952021-03-30 12:22:18 +02003265 if (lyd_compare_single_(iter1, iter2, options, parental_schemas_checked)) {
Michal Vasko52927e22020-03-16 17:26:14 +01003266 return LY_ENOT;
3267 }
3268 iter1 = iter1->next;
3269 iter2 = iter2->next;
3270 }
3271 } else {
3272 /* lists without keys, their equivalence is based on equivalence of all the children (both direct and indirect) */
3273
Radek Krejci0f969882020-08-21 16:56:47 +02003274all_children_compare:
Michal Vasko52927e22020-03-16 17:26:14 +01003275 if (!iter1 && !iter2) {
3276 /* no children, nothing to compare */
3277 return LY_SUCCESS;
3278 }
3279
Michal Vaskod989ba02020-08-24 10:59:24 +02003280 for ( ; iter1 && iter2; iter1 = iter1->next, iter2 = iter2->next) {
aPiecek2f63f952021-03-30 12:22:18 +02003281 if (lyd_compare_single_(iter1, iter2, options | LYD_COMPARE_FULL_RECURSION, parental_schemas_checked)) {
Michal Vasko52927e22020-03-16 17:26:14 +01003282 return LY_ENOT;
3283 }
3284 }
3285 if (iter1 || iter2) {
3286 return LY_ENOT;
3287 }
3288 }
3289 return LY_SUCCESS;
3290 case LYS_ANYXML:
3291 case LYS_ANYDATA:
Michal Vasko22df3f02020-08-24 13:29:22 +02003292 any1 = (struct lyd_node_any *)node1;
3293 any2 = (struct lyd_node_any *)node2;
Michal Vasko52927e22020-03-16 17:26:14 +01003294
3295 if (any1->value_type != any2->value_type) {
3296 return LY_ENOT;
3297 }
3298 switch (any1->value_type) {
3299 case LYD_ANYDATA_DATATREE:
3300 iter1 = any1->value.tree;
3301 iter2 = any2->value.tree;
3302 goto all_children_compare;
3303 case LYD_ANYDATA_STRING:
3304 case LYD_ANYDATA_XML:
3305 case LYD_ANYDATA_JSON:
3306 len1 = strlen(any1->value.str);
3307 len2 = strlen(any2->value.str);
Michal Vasko69730152020-10-09 16:30:07 +02003308 if ((len1 != len2) || strcmp(any1->value.str, any2->value.str)) {
Michal Vasko52927e22020-03-16 17:26:14 +01003309 return LY_ENOT;
3310 }
3311 return LY_SUCCESS;
Michal Vasko52927e22020-03-16 17:26:14 +01003312 case LYD_ANYDATA_LYB:
Michal Vasko60ea6352020-06-29 13:39:39 +02003313 len1 = lyd_lyb_data_length(any1->value.mem);
3314 len2 = lyd_lyb_data_length(any2->value.mem);
Michal Vasko69730152020-10-09 16:30:07 +02003315 if ((len1 != len2) || memcmp(any1->value.mem, any2->value.mem, len1)) {
Michal Vasko52927e22020-03-16 17:26:14 +01003316 return LY_ENOT;
3317 }
3318 return LY_SUCCESS;
Michal Vasko52927e22020-03-16 17:26:14 +01003319 }
Radek Krejci1f05b6a2019-07-18 16:15:06 +02003320 }
3321 }
3322
Michal Vaskob7be7a82020-08-20 09:09:04 +02003323 LOGINT(LYD_CTX(node1));
Radek Krejci1f05b6a2019-07-18 16:15:06 +02003324 return LY_EINT;
3325}
Radek Krejci22ebdba2019-07-25 13:59:43 +02003326
Jan Kundrátc6e39de2021-12-09 16:01:19 +01003327LIBYANG_API_DEF LY_ERR
aPiecek2f63f952021-03-30 12:22:18 +02003328lyd_compare_single(const struct lyd_node *node1, const struct lyd_node *node2, uint32_t options)
3329{
3330 return lyd_compare_single_(node1, node2, options, 0);
3331}
3332
Jan Kundrátc6e39de2021-12-09 16:01:19 +01003333LIBYANG_API_DEF LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02003334lyd_compare_siblings(const struct lyd_node *node1, const struct lyd_node *node2, uint32_t options)
Michal Vasko8f359bf2020-07-28 10:41:15 +02003335{
Michal Vaskod989ba02020-08-24 10:59:24 +02003336 for ( ; node1 && node2; node1 = node1->next, node2 = node2->next) {
Michal Vasko8f359bf2020-07-28 10:41:15 +02003337 LY_CHECK_RET(lyd_compare_single(node1, node2, options));
3338 }
3339
Michal Vasko11a81432020-07-28 16:31:29 +02003340 if (node1 == node2) {
3341 return LY_SUCCESS;
Michal Vasko8f359bf2020-07-28 10:41:15 +02003342 }
Michal Vasko11a81432020-07-28 16:31:29 +02003343 return LY_ENOT;
Michal Vasko8f359bf2020-07-28 10:41:15 +02003344}
3345
Jan Kundrátc6e39de2021-12-09 16:01:19 +01003346LIBYANG_API_DEF LY_ERR
Michal Vasko21725742020-06-29 11:49:25 +02003347lyd_compare_meta(const struct lyd_meta *meta1, const struct lyd_meta *meta2)
3348{
3349 if (!meta1 || !meta2) {
3350 if (meta1 == meta2) {
3351 return LY_SUCCESS;
3352 } else {
3353 return LY_ENOT;
3354 }
3355 }
3356
Michal Vaskoa8083062020-11-06 17:22:10 +01003357 if ((meta1->annotation->module->ctx != meta2->annotation->module->ctx) || (meta1->annotation != meta2->annotation)) {
Michal Vasko21725742020-06-29 11:49:25 +02003358 return LY_ENOT;
3359 }
3360
Michal Vasko21725742020-06-29 11:49:25 +02003361 return meta1->value.realtype->plugin->compare(&meta1->value, &meta2->value);
3362}
3363
Radek Krejci22ebdba2019-07-25 13:59:43 +02003364/**
Michal Vasko9cf62422021-07-01 13:29:32 +02003365 * @brief Create a copy of the attribute.
3366 *
3367 * @param[in] attr Attribute to copy.
3368 * @param[in] node Opaque where to append the new attribute.
3369 * @param[out] dup Optional created attribute copy.
3370 * @return LY_ERR value.
3371 */
3372static LY_ERR
3373lyd_dup_attr_single(const struct lyd_attr *attr, struct lyd_node *node, struct lyd_attr **dup)
3374{
3375 LY_ERR ret = LY_SUCCESS;
3376 struct lyd_attr *a, *last;
3377 struct lyd_node_opaq *opaq = (struct lyd_node_opaq *)node;
3378
3379 LY_CHECK_ARG_RET(NULL, attr, node, !node->schema, LY_EINVAL);
3380
3381 /* create a copy */
3382 a = calloc(1, sizeof *attr);
3383 LY_CHECK_ERR_RET(!a, LOGMEM(LYD_CTX(node)), LY_EMEM);
3384
3385 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), attr->name.name, 0, &a->name.name), finish);
3386 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), attr->name.prefix, 0, &a->name.prefix), finish);
3387 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), attr->name.module_ns, 0, &a->name.module_ns), finish);
3388 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), attr->value, 0, &a->value), finish);
3389 a->hints = attr->hints;
3390 a->format = attr->format;
3391 if (attr->val_prefix_data) {
3392 ret = ly_dup_prefix_data(LYD_CTX(node), attr->format, attr->val_prefix_data, &a->val_prefix_data);
3393 LY_CHECK_GOTO(ret, finish);
3394 }
3395
3396 /* insert as the last attribute */
3397 a->parent = opaq;
3398 if (opaq->attr) {
3399 for (last = opaq->attr; last->next; last = last->next) {}
3400 last->next = a;
3401 } else {
3402 opaq->attr = a;
3403 }
3404
3405finish:
3406 if (ret) {
3407 lyd_free_attr_single(LYD_CTX(node), a);
3408 } else if (dup) {
3409 *dup = a;
3410 }
3411 return LY_SUCCESS;
3412}
3413
3414/**
Michal Vaskoaac267d2022-01-17 13:34:48 +01003415 * @brief Find @p schema equivalent in @p trg_ctx.
3416 *
3417 * @param[in] schema Schema node to find.
3418 * @param[in] trg_ctx Target context to search in.
3419 * @param[in] parent Data parent of @p schema, if any.
3420 * @param[out] trg_schema Found schema from @p trg_ctx to use.
3421 * @return LY_RRR value.
3422 */
3423static LY_ERR
3424lyd_dup_find_schema(const struct lysc_node *schema, const struct ly_ctx *trg_ctx, struct lyd_node *parent,
3425 const struct lysc_node **trg_schema)
3426{
3427 const struct lysc_node *node = NULL, *sparent = NULL;
3428 const struct lys_module *mod = NULL;
3429 char *path;
3430
3431 if (!schema) {
3432 /* opaque node */
3433 *trg_schema = NULL;
3434 return LY_SUCCESS;
3435 }
3436
3437 if (parent && parent->schema) {
3438 /* start from schema parent */
3439 sparent = parent->schema;
3440 } else {
3441 /* start from module */
3442 mod = ly_ctx_get_module_implemented(trg_ctx, schema->module->name);
3443 if (!mod) {
3444 LOGERR(trg_ctx, LY_ENOTFOUND, "Module \"%s\" not present/implemented in the target context.",
3445 schema->module->name);
3446 return LY_ENOTFOUND;
3447 }
3448 }
3449
3450 /* find the schema node */
3451 while ((node = lys_getnext(node, sparent, mod ? mod->compiled : NULL, 0))) {
3452 if (!strcmp(node->module->name, schema->module->name) && !strcmp(node->name, schema->name)) {
3453 *trg_schema = node;
3454 return LY_SUCCESS;
3455 }
3456 }
3457
3458 /* schema node not found */
3459 path = lysc_path(schema, LYSC_PATH_LOG, NULL, 0);
3460 LOGERR(trg_ctx, LY_ENOTFOUND, "Schema node \"%s\" not found in the target context.", path);
3461 free(path);
3462 return LY_ENOTFOUND;
3463}
3464
3465/**
Michal Vasko52927e22020-03-16 17:26:14 +01003466 * @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 +02003467 *
Michal Vaskoaac267d2022-01-17 13:34:48 +01003468 * 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 +02003469 *
Michal Vaskoaac267d2022-01-17 13:34:48 +01003470 * @param[in] node Node to duplicate.
3471 * @param[in] trg_ctx Target context for duplicated nodes.
Radek Krejcif8b95172020-05-15 14:51:06 +02003472 * @param[in] parent Parent to insert into, NULL for top-level sibling.
Michal Vasko67177e52021-08-25 11:15:15 +02003473 * @param[in] insert_last Whether the duplicated node can be inserted as the last child of @p parent. Set for
3474 * recursive duplication as an optimization.
Radek Krejcif8b95172020-05-15 14:51:06 +02003475 * @param[in,out] first First sibling, NULL if no top-level sibling exist yet. Can be also NULL if @p parent is set.
3476 * @param[in] options Bitmask of options flags, see @ref dupoptions.
Michal Vaskoaac267d2022-01-17 13:34:48 +01003477 * @param[out] dup_p Pointer where the created duplicated node is placed (besides connecting it to @p parent / @p first).
3478 * @return LY_ERR value.
Radek Krejci22ebdba2019-07-25 13:59:43 +02003479 */
Michal Vasko52927e22020-03-16 17:26:14 +01003480static LY_ERR
Michal Vaskoaac267d2022-01-17 13:34:48 +01003481lyd_dup_r(const struct lyd_node *node, const struct ly_ctx *trg_ctx, struct lyd_node *parent, ly_bool insert_last,
3482 struct lyd_node **first, uint32_t options, struct lyd_node **dup_p)
Radek Krejci22ebdba2019-07-25 13:59:43 +02003483{
Michal Vasko52927e22020-03-16 17:26:14 +01003484 LY_ERR ret;
Radek Krejci22ebdba2019-07-25 13:59:43 +02003485 struct lyd_node *dup = NULL;
Michal Vasko61551fa2020-07-09 15:45:45 +02003486 struct lyd_meta *meta;
Michal Vasko9cf62422021-07-01 13:29:32 +02003487 struct lyd_attr *attr;
Michal Vasko61551fa2020-07-09 15:45:45 +02003488 struct lyd_node_any *any;
Michal Vaskoaac267d2022-01-17 13:34:48 +01003489 const struct lysc_type *type;
3490 const char *val_can;
Radek Krejci22ebdba2019-07-25 13:59:43 +02003491
Michal Vasko52927e22020-03-16 17:26:14 +01003492 LY_CHECK_ARG_RET(NULL, node, LY_EINVAL);
Radek Krejci22ebdba2019-07-25 13:59:43 +02003493
Michal Vasko52927e22020-03-16 17:26:14 +01003494 if (!node->schema) {
3495 dup = calloc(1, sizeof(struct lyd_node_opaq));
Michal Vaskoaac267d2022-01-17 13:34:48 +01003496 ((struct lyd_node_opaq *)dup)->ctx = trg_ctx;
Michal Vasko52927e22020-03-16 17:26:14 +01003497 } else {
3498 switch (node->schema->nodetype) {
Michal Vasko1bf09392020-03-27 12:38:10 +01003499 case LYS_RPC:
Michal Vasko52927e22020-03-16 17:26:14 +01003500 case LYS_ACTION:
3501 case LYS_NOTIF:
3502 case LYS_CONTAINER:
3503 case LYS_LIST:
3504 dup = calloc(1, sizeof(struct lyd_node_inner));
3505 break;
3506 case LYS_LEAF:
3507 case LYS_LEAFLIST:
3508 dup = calloc(1, sizeof(struct lyd_node_term));
3509 break;
3510 case LYS_ANYDATA:
3511 case LYS_ANYXML:
3512 dup = calloc(1, sizeof(struct lyd_node_any));
3513 break;
3514 default:
Michal Vaskoaac267d2022-01-17 13:34:48 +01003515 LOGINT(trg_ctx);
Michal Vasko52927e22020-03-16 17:26:14 +01003516 ret = LY_EINT;
3517 goto error;
3518 }
Radek Krejci22ebdba2019-07-25 13:59:43 +02003519 }
Michal Vaskoaac267d2022-01-17 13:34:48 +01003520 LY_CHECK_ERR_GOTO(!dup, LOGMEM(trg_ctx); ret = LY_EMEM, error);
Radek Krejci22ebdba2019-07-25 13:59:43 +02003521
Michal Vaskof6df0a02020-06-16 13:08:34 +02003522 if (options & LYD_DUP_WITH_FLAGS) {
3523 dup->flags = node->flags;
3524 } else {
3525 dup->flags = (node->flags & LYD_DEFAULT) | LYD_NEW;
3526 }
Michal Vaskoaac267d2022-01-17 13:34:48 +01003527 if (trg_ctx == LYD_CTX(node)) {
3528 dup->schema = node->schema;
3529 } else {
3530 LY_CHECK_GOTO(ret = lyd_dup_find_schema(node->schema, trg_ctx, parent, &dup->schema), error);
3531 }
Michal Vasko52927e22020-03-16 17:26:14 +01003532 dup->prev = dup;
Radek Krejci22ebdba2019-07-25 13:59:43 +02003533
Michal Vasko9cf62422021-07-01 13:29:32 +02003534 /* duplicate metadata/attributes */
Michal Vasko25a32822020-07-09 15:48:22 +02003535 if (!(options & LYD_DUP_NO_META)) {
Michal Vasko9cf62422021-07-01 13:29:32 +02003536 if (!node->schema) {
3537 LY_LIST_FOR(((struct lyd_node_opaq *)node)->attr, attr) {
3538 LY_CHECK_GOTO(ret = lyd_dup_attr_single(attr, dup, NULL), error);
3539 }
3540 } else {
3541 LY_LIST_FOR(node->meta, meta) {
3542 LY_CHECK_GOTO(ret = lyd_dup_meta_single(meta, dup, NULL), error);
3543 }
Michal Vasko25a32822020-07-09 15:48:22 +02003544 }
3545 }
Radek Krejci22ebdba2019-07-25 13:59:43 +02003546
3547 /* nodetype-specific work */
Michal Vasko52927e22020-03-16 17:26:14 +01003548 if (!dup->schema) {
3549 struct lyd_node_opaq *opaq = (struct lyd_node_opaq *)dup;
3550 struct lyd_node_opaq *orig = (struct lyd_node_opaq *)node;
3551 struct lyd_node *child;
Radek Krejci22ebdba2019-07-25 13:59:43 +02003552
3553 if (options & LYD_DUP_RECURSIVE) {
3554 /* duplicate all the children */
3555 LY_LIST_FOR(orig->child, child) {
Michal Vaskoaac267d2022-01-17 13:34:48 +01003556 LY_CHECK_GOTO(ret = lyd_dup_r(child, trg_ctx, dup, 1, NULL, options, NULL), error);
Michal Vasko52927e22020-03-16 17:26:14 +01003557 }
3558 }
Michal Vaskoaac267d2022-01-17 13:34:48 +01003559 LY_CHECK_GOTO(ret = lydict_insert(trg_ctx, orig->name.name, 0, &opaq->name.name), error);
3560 LY_CHECK_GOTO(ret = lydict_insert(trg_ctx, orig->name.prefix, 0, &opaq->name.prefix), error);
3561 LY_CHECK_GOTO(ret = lydict_insert(trg_ctx, orig->name.module_ns, 0, &opaq->name.module_ns), error);
3562 LY_CHECK_GOTO(ret = lydict_insert(trg_ctx, orig->value, 0, &opaq->value), error);
Michal Vasko9cf62422021-07-01 13:29:32 +02003563 opaq->hints = orig->hints;
3564 opaq->format = orig->format;
Michal Vasko6b5cb2a2020-11-11 19:11:21 +01003565 if (orig->val_prefix_data) {
Michal Vaskoaac267d2022-01-17 13:34:48 +01003566 ret = ly_dup_prefix_data(trg_ctx, opaq->format, orig->val_prefix_data, &opaq->val_prefix_data);
Michal Vasko6b5cb2a2020-11-11 19:11:21 +01003567 LY_CHECK_GOTO(ret, error);
Michal Vasko52927e22020-03-16 17:26:14 +01003568 }
Michal Vasko52927e22020-03-16 17:26:14 +01003569 } else if (dup->schema->nodetype & LYD_NODE_TERM) {
3570 struct lyd_node_term *term = (struct lyd_node_term *)dup;
3571 struct lyd_node_term *orig = (struct lyd_node_term *)node;
3572
3573 term->hash = orig->hash;
Michal Vaskoaac267d2022-01-17 13:34:48 +01003574 if (trg_ctx == LYD_CTX(node)) {
3575 ret = orig->value.realtype->plugin->duplicate(trg_ctx, &orig->value, &term->value);
3576 LY_CHECK_ERR_GOTO(ret, LOGERR(trg_ctx, ret, "Value duplication failed."), error);
3577 } else {
3578 /* store canonical value in the target context */
3579 val_can = lyd_get_value(node);
3580 type = ((struct lysc_node_leaf *)term->schema)->type;
3581 ret = lyd_value_store(trg_ctx, &term->value, type, val_can, strlen(val_can), NULL, LY_VALUE_CANON, NULL,
3582 LYD_HINT_DATA, term->schema, NULL);
3583 LY_CHECK_GOTO(ret, error);
3584 }
Michal Vasko52927e22020-03-16 17:26:14 +01003585 } else if (dup->schema->nodetype & LYD_NODE_INNER) {
3586 struct lyd_node_inner *orig = (struct lyd_node_inner *)node;
3587 struct lyd_node *child;
3588
3589 if (options & LYD_DUP_RECURSIVE) {
3590 /* duplicate all the children */
3591 LY_LIST_FOR(orig->child, child) {
Michal Vaskoaac267d2022-01-17 13:34:48 +01003592 LY_CHECK_GOTO(ret = lyd_dup_r(child, trg_ctx, dup, 1, NULL, options, NULL), error);
Radek Krejci22ebdba2019-07-25 13:59:43 +02003593 }
Michal Vasko69730152020-10-09 16:30:07 +02003594 } else if ((dup->schema->nodetype == LYS_LIST) && !(dup->schema->flags & LYS_KEYLESS)) {
Radek Krejci22ebdba2019-07-25 13:59:43 +02003595 /* always duplicate keys of a list */
Radek Krejci22ebdba2019-07-25 13:59:43 +02003596 child = orig->child;
Michal Vasko544e58a2021-01-28 14:33:41 +01003597 for (const struct lysc_node *key = lysc_node_child(dup->schema);
Michal Vaskoc57d9a92020-06-23 13:28:27 +02003598 key && (key->flags & LYS_KEY);
Radek Krejci0fe9b512019-07-26 17:51:05 +02003599 key = key->next) {
Radek Krejci22ebdba2019-07-25 13:59:43 +02003600 if (!child) {
3601 /* possibly not keys are present in filtered tree */
3602 break;
Radek Krejci0fe9b512019-07-26 17:51:05 +02003603 } else if (child->schema != key) {
3604 /* possibly not all keys are present in filtered tree,
3605 * but there can be also some non-key nodes */
3606 continue;
Radek Krejci22ebdba2019-07-25 13:59:43 +02003607 }
Michal Vaskoaac267d2022-01-17 13:34:48 +01003608 LY_CHECK_GOTO(ret = lyd_dup_r(child, trg_ctx, dup, 1, NULL, options, NULL), error);
Radek Krejci22ebdba2019-07-25 13:59:43 +02003609 child = child->next;
3610 }
3611 }
3612 lyd_hash(dup);
3613 } else if (dup->schema->nodetype & LYD_NODE_ANY) {
Michal Vasko61551fa2020-07-09 15:45:45 +02003614 dup->hash = node->hash;
3615 any = (struct lyd_node_any *)node;
3616 LY_CHECK_GOTO(ret = lyd_any_copy_value(dup, &any->value, any->value_type), error);
Radek Krejci22ebdba2019-07-25 13:59:43 +02003617 }
3618
Michal Vasko52927e22020-03-16 17:26:14 +01003619 /* insert */
Michal Vasko67177e52021-08-25 11:15:15 +02003620 lyd_insert_node(parent, first, dup, insert_last);
Michal Vasko52927e22020-03-16 17:26:14 +01003621
3622 if (dup_p) {
3623 *dup_p = dup;
3624 }
3625 return LY_SUCCESS;
Radek Krejci22ebdba2019-07-25 13:59:43 +02003626
3627error:
Michal Vasko52927e22020-03-16 17:26:14 +01003628 lyd_free_tree(dup);
3629 return ret;
Radek Krejci22ebdba2019-07-25 13:59:43 +02003630}
3631
Michal Vasko29d674b2021-08-25 11:18:35 +02003632/**
3633 * @brief Get a parent node to connect duplicated subtree to.
3634 *
3635 * @param[in] node Node (subtree) to duplicate.
Michal Vaskoaac267d2022-01-17 13:34:48 +01003636 * @param[in] trg_ctx Target context for duplicated nodes.
Michal Vasko29d674b2021-08-25 11:18:35 +02003637 * @param[in] parent Initial parent to connect to.
3638 * @param[in] options Bitmask of options flags, see @ref dupoptions.
3639 * @param[out] dup_parent First duplicated parent node, if any.
3640 * @param[out] local_parent Correct parent to directly connect duplicated @p node to.
3641 * @return LY_ERR value.
3642 */
Michal Vasko3a41dff2020-07-15 14:30:28 +02003643static LY_ERR
Michal Vaskoaac267d2022-01-17 13:34:48 +01003644lyd_dup_get_local_parent(const struct lyd_node *node, const struct ly_ctx *trg_ctx, const struct lyd_node_inner *parent,
3645 uint32_t options, struct lyd_node **dup_parent, struct lyd_node_inner **local_parent)
Radek Krejci22ebdba2019-07-25 13:59:43 +02003646{
Michal Vasko3a41dff2020-07-15 14:30:28 +02003647 const struct lyd_node_inner *orig_parent, *iter;
Radek Krejci857189e2020-09-01 13:26:36 +02003648 ly_bool repeat = 1;
Michal Vasko3a41dff2020-07-15 14:30:28 +02003649
3650 *dup_parent = NULL;
3651 *local_parent = NULL;
3652
3653 for (orig_parent = node->parent; repeat && orig_parent; orig_parent = orig_parent->parent) {
3654 if (parent && (parent->schema == orig_parent->schema)) {
3655 /* stop creating parents, connect what we have into the provided parent */
3656 iter = parent;
3657 repeat = 0;
3658 } else {
3659 iter = NULL;
Michal Vaskoaac267d2022-01-17 13:34:48 +01003660 LY_CHECK_RET(lyd_dup_r((struct lyd_node *)orig_parent, trg_ctx, NULL, 0, (struct lyd_node **)&iter, options,
Radek Krejci0f969882020-08-21 16:56:47 +02003661 (struct lyd_node **)&iter));
Michal Vasko3a41dff2020-07-15 14:30:28 +02003662 }
3663 if (!*local_parent) {
3664 *local_parent = (struct lyd_node_inner *)iter;
3665 }
3666 if (iter->child) {
3667 /* 1) list - add after keys
3668 * 2) provided parent with some children */
3669 iter->child->prev->next = *dup_parent;
3670 if (*dup_parent) {
3671 (*dup_parent)->prev = iter->child->prev;
3672 iter->child->prev = *dup_parent;
3673 }
3674 } else {
3675 ((struct lyd_node_inner *)iter)->child = *dup_parent;
3676 }
3677 if (*dup_parent) {
3678 (*dup_parent)->parent = (struct lyd_node_inner *)iter;
3679 }
3680 *dup_parent = (struct lyd_node *)iter;
3681 }
3682
3683 if (repeat && parent) {
3684 /* given parent and created parents chain actually do not interconnect */
Michal Vaskoaac267d2022-01-17 13:34:48 +01003685 LOGERR(trg_ctx, LY_EINVAL,
Michal Vasko69730152020-10-09 16:30:07 +02003686 "Invalid argument parent (%s()) - does not interconnect with the created node's parents chain.", __func__);
Michal Vasko3a41dff2020-07-15 14:30:28 +02003687 return LY_EINVAL;
3688 }
3689
3690 return LY_SUCCESS;
3691}
3692
3693static LY_ERR
Michal Vaskoaac267d2022-01-17 13:34:48 +01003694lyd_dup(const struct lyd_node *node, const struct ly_ctx *trg_ctx, struct lyd_node_inner *parent, uint32_t options,
3695 ly_bool nosiblings, struct lyd_node **dup)
Michal Vasko3a41dff2020-07-15 14:30:28 +02003696{
3697 LY_ERR rc;
Radek Krejci22ebdba2019-07-25 13:59:43 +02003698 const struct lyd_node *orig; /* original node to be duplicated */
3699 struct lyd_node *first = NULL; /* the first duplicated node, this is returned */
Radek Krejci22ebdba2019-07-25 13:59:43 +02003700 struct lyd_node *top = NULL; /* the most higher created node */
3701 struct lyd_node_inner *local_parent = NULL; /* the direct parent node for the duplicated node(s) */
Radek Krejci22ebdba2019-07-25 13:59:43 +02003702
Michal Vaskoaac267d2022-01-17 13:34:48 +01003703 assert(node && trg_ctx && (!parent || (LYD_CTX(parent) == trg_ctx)));
Radek Krejci22ebdba2019-07-25 13:59:43 +02003704
3705 if (options & LYD_DUP_WITH_PARENTS) {
Michal Vaskoaac267d2022-01-17 13:34:48 +01003706 LY_CHECK_GOTO(rc = lyd_dup_get_local_parent(node, trg_ctx, parent, options & (LYD_DUP_WITH_FLAGS | LYD_DUP_NO_META),
Michal Vasko20909752021-05-18 16:13:38 +02003707 &top, &local_parent), error);
Radek Krejci22ebdba2019-07-25 13:59:43 +02003708 } else {
3709 local_parent = parent;
3710 }
3711
Radek Krejci22ebdba2019-07-25 13:59:43 +02003712 LY_LIST_FOR(node, orig) {
Michal Vasko35f4d772021-01-12 12:08:57 +01003713 if (lysc_is_key(orig->schema)) {
3714 if (local_parent) {
3715 /* the key must already exist in the parent */
3716 rc = lyd_find_sibling_schema(local_parent->child, orig->schema, first ? NULL : &first);
Michal Vaskoaac267d2022-01-17 13:34:48 +01003717 LY_CHECK_ERR_GOTO(rc, LOGINT(trg_ctx), error);
Michal Vasko35f4d772021-01-12 12:08:57 +01003718 } else {
3719 assert(!(options & LYD_DUP_WITH_PARENTS));
3720 /* duplicating a single key, okay, I suppose... */
Michal Vaskoaac267d2022-01-17 13:34:48 +01003721 rc = lyd_dup_r(orig, trg_ctx, NULL, 0, &first, options, first ? NULL : &first);
Michal Vasko35f4d772021-01-12 12:08:57 +01003722 LY_CHECK_GOTO(rc, error);
3723 }
3724 } else {
3725 /* if there is no local parent, it will be inserted into first */
Michal Vaskoaac267d2022-01-17 13:34:48 +01003726 rc = lyd_dup_r(orig, trg_ctx, local_parent ? &local_parent->node : NULL, 0, &first, options,
3727 first ? NULL : &first);
Michal Vasko35f4d772021-01-12 12:08:57 +01003728 LY_CHECK_GOTO(rc, error);
3729 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02003730 if (nosiblings) {
Radek Krejci22ebdba2019-07-25 13:59:43 +02003731 break;
3732 }
3733 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02003734
Michal Vasko3a41dff2020-07-15 14:30:28 +02003735 if (dup) {
3736 *dup = first;
3737 }
3738 return LY_SUCCESS;
Radek Krejci22ebdba2019-07-25 13:59:43 +02003739
3740error:
3741 if (top) {
3742 lyd_free_tree(top);
3743 } else {
Michal Vaskof03ed032020-03-04 13:31:44 +01003744 lyd_free_siblings(first);
Radek Krejci22ebdba2019-07-25 13:59:43 +02003745 }
Michal Vasko3a41dff2020-07-15 14:30:28 +02003746 return rc;
Radek Krejci22ebdba2019-07-25 13:59:43 +02003747}
Michal Vasko5ec7cda2019-09-11 13:43:08 +02003748
Jan Kundrátc6e39de2021-12-09 16:01:19 +01003749LIBYANG_API_DEF LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02003750lyd_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 +02003751{
Michal Vaskoaac267d2022-01-17 13:34:48 +01003752 LY_CHECK_ARG_RET(NULL, node, LY_EINVAL);
3753 if (node && parent && (LYD_CTX(node) != LYD_CTX(parent))) {
3754 LOGERR(NULL, LY_EINVAL, "Different contexts used in node duplication.");
3755 return LY_EINVAL;
3756 }
3757
3758 return lyd_dup(node, LYD_CTX(node), parent, options, 1, dup);
3759}
3760
3761LIBYANG_API_DEF LY_ERR
3762lyd_dup_single_to_ctx(const struct lyd_node *node, const struct ly_ctx *trg_ctx, struct lyd_node_inner *parent,
3763 uint32_t options, struct lyd_node **dup)
3764{
3765 LY_CHECK_ARG_RET(trg_ctx, node, trg_ctx, LY_EINVAL);
3766
3767 return lyd_dup(node, trg_ctx, parent, options, 1, dup);
Michal Vasko3a41dff2020-07-15 14:30:28 +02003768}
3769
Jan Kundrátc6e39de2021-12-09 16:01:19 +01003770LIBYANG_API_DEF LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02003771lyd_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 +02003772{
Michal Vaskoaac267d2022-01-17 13:34:48 +01003773 LY_CHECK_ARG_RET(NULL, node, LY_EINVAL);
3774 if (node && parent && (LYD_CTX(node) != LYD_CTX(parent))) {
3775 LOGERR(NULL, LY_EINVAL, "Different contexts used in node duplication.");
3776 return LY_EINVAL;
3777 }
3778
3779 return lyd_dup(node, LYD_CTX(node), parent, options, 0, dup);
3780}
3781
3782LIBYANG_API_DEF LY_ERR
3783lyd_dup_siblings_to_ctx(const struct lyd_node *node, const struct ly_ctx *trg_ctx, struct lyd_node_inner *parent,
3784 uint32_t options, struct lyd_node **dup)
3785{
3786 LY_CHECK_ARG_RET(trg_ctx, node, trg_ctx, LY_EINVAL);
3787
3788 return lyd_dup(node, trg_ctx, parent, options, 0, dup);
Michal Vasko3a41dff2020-07-15 14:30:28 +02003789}
3790
Jan Kundrátc6e39de2021-12-09 16:01:19 +01003791LIBYANG_API_DEF LY_ERR
Michal Vasko3a41dff2020-07-15 14:30:28 +02003792lyd_dup_meta_single(const struct lyd_meta *meta, struct lyd_node *node, struct lyd_meta **dup)
Michal Vasko25a32822020-07-09 15:48:22 +02003793{
Radek Krejci011e4aa2020-09-04 15:22:31 +02003794 LY_ERR ret = LY_SUCCESS;
Michal Vasko25a32822020-07-09 15:48:22 +02003795 struct lyd_meta *mt, *last;
3796
Michal Vasko3a41dff2020-07-15 14:30:28 +02003797 LY_CHECK_ARG_RET(NULL, meta, node, LY_EINVAL);
Michal Vasko25a32822020-07-09 15:48:22 +02003798
3799 /* create a copy */
3800 mt = calloc(1, sizeof *mt);
Michal Vaskob7be7a82020-08-20 09:09:04 +02003801 LY_CHECK_ERR_RET(!mt, LOGMEM(LYD_CTX(node)), LY_EMEM);
Michal Vasko25a32822020-07-09 15:48:22 +02003802 mt->annotation = meta->annotation;
Michal Vaskob7be7a82020-08-20 09:09:04 +02003803 ret = meta->value.realtype->plugin->duplicate(LYD_CTX(node), &meta->value, &mt->value);
Radek Krejci011e4aa2020-09-04 15:22:31 +02003804 LY_CHECK_ERR_GOTO(ret, LOGERR(LYD_CTX(node), LY_EINT, "Value duplication failed."), finish);
3805 LY_CHECK_GOTO(ret = lydict_insert(LYD_CTX(node), meta->name, 0, &mt->name), finish);
Michal Vasko25a32822020-07-09 15:48:22 +02003806
3807 /* insert as the last attribute */
Radek Krejci011e4aa2020-09-04 15:22:31 +02003808 mt->parent = node;
Michal Vasko25a32822020-07-09 15:48:22 +02003809 if (node->meta) {
Radek Krejci1e008d22020-08-17 11:37:37 +02003810 for (last = node->meta; last->next; last = last->next) {}
Michal Vasko25a32822020-07-09 15:48:22 +02003811 last->next = mt;
3812 } else {
3813 node->meta = mt;
3814 }
3815
Radek Krejci011e4aa2020-09-04 15:22:31 +02003816finish:
3817 if (ret) {
3818 lyd_free_meta_single(mt);
3819 } else if (dup) {
Michal Vasko3a41dff2020-07-15 14:30:28 +02003820 *dup = mt;
3821 }
3822 return LY_SUCCESS;
Michal Vasko25a32822020-07-09 15:48:22 +02003823}
3824
Michal Vasko4490d312020-06-16 13:08:55 +02003825/**
3826 * @brief Merge a source sibling into target siblings.
3827 *
3828 * @param[in,out] first_trg First target sibling, is updated if top-level.
3829 * @param[in] parent_trg Target parent.
3830 * @param[in,out] sibling_src Source sibling to merge, set to NULL if spent.
Michal Vaskocd3f6172021-05-18 16:14:50 +02003831 * @param[in] merge_cb Optional merge callback.
3832 * @param[in] cb_data Arbitrary callback data.
Michal Vasko4490d312020-06-16 13:08:55 +02003833 * @param[in] options Merge options.
Michal Vaskocd3f6172021-05-18 16:14:50 +02003834 * @param[in,out] dup_inst Duplicate instance cache for all @p first_trg siblings.
Michal Vasko4490d312020-06-16 13:08:55 +02003835 * @return LY_ERR value.
3836 */
3837static LY_ERR
3838lyd_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 +02003839 lyd_merge_cb merge_cb, void *cb_data, uint16_t options, struct lyd_dup_inst **dup_inst)
Michal Vasko4490d312020-06-16 13:08:55 +02003840{
Michal Vasko4490d312020-06-16 13:08:55 +02003841 const struct lyd_node *child_src, *tmp, *sibling_src;
Michal Vasko56daf732020-08-10 10:57:18 +02003842 struct lyd_node *match_trg, *dup_src, *elem;
Michal Vaskofee29a92022-01-27 16:18:12 +01003843 struct lyd_node_opaq *opaq_trg, *opaq_src;
Michal Vasko4490d312020-06-16 13:08:55 +02003844 struct lysc_type *type;
Michal Vaskocd3f6172021-05-18 16:14:50 +02003845 struct lyd_dup_inst *child_dup_inst = NULL;
3846 LY_ERR ret;
3847 ly_bool first_inst = 0;
Michal Vasko4490d312020-06-16 13:08:55 +02003848
3849 sibling_src = *sibling_src_p;
Michal Vaskocd3f6172021-05-18 16:14:50 +02003850 if (!sibling_src->schema) {
3851 /* try to find the same opaque node */
3852 lyd_find_sibling_opaq_next(*first_trg, LYD_NAME(sibling_src), &match_trg);
3853 } else if (sibling_src->schema->nodetype & (LYS_LIST | LYS_LEAFLIST)) {
Michal Vasko4490d312020-06-16 13:08:55 +02003854 /* try to find the exact instance */
Michal Vaskocd3f6172021-05-18 16:14:50 +02003855 lyd_find_sibling_first(*first_trg, sibling_src, &match_trg);
Michal Vasko4490d312020-06-16 13:08:55 +02003856 } else {
3857 /* try to simply find the node, there cannot be more instances */
Michal Vaskocd3f6172021-05-18 16:14:50 +02003858 lyd_find_sibling_val(*first_trg, sibling_src->schema, NULL, 0, &match_trg);
Michal Vasko4490d312020-06-16 13:08:55 +02003859 }
3860
Michal Vaskocd3f6172021-05-18 16:14:50 +02003861 if (match_trg) {
3862 /* update match as needed */
3863 LY_CHECK_RET(lyd_dup_inst_next(&match_trg, *first_trg, dup_inst));
3864 } else {
3865 /* first instance of this node */
3866 first_inst = 1;
3867 }
3868
3869 if (match_trg) {
3870 /* call callback */
3871 if (merge_cb) {
3872 LY_CHECK_RET(merge_cb(match_trg, sibling_src, cb_data));
3873 }
3874
Michal Vasko4490d312020-06-16 13:08:55 +02003875 /* node found, make sure even value matches for all node types */
Michal Vaskofee29a92022-01-27 16:18:12 +01003876 if (!match_trg->schema) {
3877 if (lyd_compare_single(sibling_src, match_trg, 0)) {
3878 /* update value */
3879 opaq_trg = (struct lyd_node_opaq *)match_trg;
3880 opaq_src = (struct lyd_node_opaq *)sibling_src;
3881
3882 lydict_remove(LYD_CTX(opaq_trg), opaq_trg->value);
3883 lydict_insert(LYD_CTX(opaq_trg), opaq_src->value, 0, &opaq_trg->value);
3884 opaq_trg->hints = opaq_src->hints;
3885
3886 ly_free_prefix_data(opaq_trg->format, opaq_trg->val_prefix_data);
3887 opaq_trg->format = opaq_src->format;
3888 ly_dup_prefix_data(LYD_CTX(opaq_trg), opaq_src->format, opaq_src->val_prefix_data,
3889 &opaq_trg->val_prefix_data);
3890 }
3891 } else if ((match_trg->schema->nodetype == LYS_LEAF) &&
3892 lyd_compare_single(sibling_src, match_trg, LYD_COMPARE_DEFAULTS)) {
Michal Vasko4490d312020-06-16 13:08:55 +02003893 /* since they are different, they cannot both be default */
3894 assert(!(sibling_src->flags & LYD_DEFAULT) || !(match_trg->flags & LYD_DEFAULT));
3895
Michal Vasko3a41dff2020-07-15 14:30:28 +02003896 /* update value (or only LYD_DEFAULT flag) only if flag set or the source node is not default */
3897 if ((options & LYD_MERGE_DEFAULTS) || !(sibling_src->flags & LYD_DEFAULT)) {
Michal Vasko4490d312020-06-16 13:08:55 +02003898 type = ((struct lysc_node_leaf *)match_trg->schema)->type;
Michal Vaskob7be7a82020-08-20 09:09:04 +02003899 type->plugin->free(LYD_CTX(match_trg), &((struct lyd_node_term *)match_trg)->value);
3900 LY_CHECK_RET(type->plugin->duplicate(LYD_CTX(match_trg), &((struct lyd_node_term *)sibling_src)->value,
Michal Vasko69730152020-10-09 16:30:07 +02003901 &((struct lyd_node_term *)match_trg)->value));
Michal Vasko4490d312020-06-16 13:08:55 +02003902
3903 /* copy flags and add LYD_NEW */
Michal Vasko7e8315b2021-08-03 17:01:06 +02003904 match_trg->flags = sibling_src->flags | ((options & LYD_MERGE_WITH_FLAGS) ? 0 : LYD_NEW);
Michal Vasko4490d312020-06-16 13:08:55 +02003905 }
Michal Vasko8f359bf2020-07-28 10:41:15 +02003906 } else if ((match_trg->schema->nodetype & LYS_ANYDATA) && lyd_compare_single(sibling_src, match_trg, 0)) {
Michal Vasko4c583e82020-07-17 12:16:14 +02003907 /* update value */
3908 LY_CHECK_RET(lyd_any_copy_value(match_trg, &((struct lyd_node_any *)sibling_src)->value,
Radek Krejci0f969882020-08-21 16:56:47 +02003909 ((struct lyd_node_any *)sibling_src)->value_type));
Michal Vasko4490d312020-06-16 13:08:55 +02003910
3911 /* copy flags and add LYD_NEW */
Michal Vasko7e8315b2021-08-03 17:01:06 +02003912 match_trg->flags = sibling_src->flags | ((options & LYD_MERGE_WITH_FLAGS) ? 0 : LYD_NEW);
Michal Vaskocd3f6172021-05-18 16:14:50 +02003913 }
3914
3915 /* check descendants, recursively */
3916 ret = LY_SUCCESS;
3917 LY_LIST_FOR_SAFE(lyd_child_no_keys(sibling_src), tmp, child_src) {
3918 ret = lyd_merge_sibling_r(lyd_node_child_p(match_trg), match_trg, &child_src, merge_cb, cb_data, options,
3919 &child_dup_inst);
3920 if (ret) {
3921 break;
Michal Vasko4490d312020-06-16 13:08:55 +02003922 }
3923 }
Michal Vaskocd3f6172021-05-18 16:14:50 +02003924 lyd_dup_inst_free(child_dup_inst);
3925 LY_CHECK_RET(ret);
Michal Vasko4490d312020-06-16 13:08:55 +02003926 } else {
3927 /* node not found, merge it */
3928 if (options & LYD_MERGE_DESTRUCT) {
3929 dup_src = (struct lyd_node *)sibling_src;
3930 lyd_unlink_tree(dup_src);
3931 /* spend it */
3932 *sibling_src_p = NULL;
3933 } else {
Michal Vasko3a41dff2020-07-15 14:30:28 +02003934 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 +02003935 }
3936
Michal Vasko7e8315b2021-08-03 17:01:06 +02003937 if (!(options & LYD_MERGE_WITH_FLAGS)) {
3938 /* set LYD_NEW for all the new nodes, required for validation */
3939 LYD_TREE_DFS_BEGIN(dup_src, elem) {
3940 elem->flags |= LYD_NEW;
3941 LYD_TREE_DFS_END(dup_src, elem);
3942 }
Michal Vasko4490d312020-06-16 13:08:55 +02003943 }
3944
Michal Vaskocd3f6172021-05-18 16:14:50 +02003945 /* insert */
Michal Vasko6ee6f432021-07-16 09:49:14 +02003946 lyd_insert_node(parent_trg, first_trg, dup_src, 0);
Michal Vaskocd3f6172021-05-18 16:14:50 +02003947
3948 if (first_inst) {
3949 /* remember not to find this instance next time */
3950 LY_CHECK_RET(lyd_dup_inst_next(&dup_src, *first_trg, dup_inst));
3951 }
3952
3953 /* call callback, no source node */
3954 if (merge_cb) {
3955 LY_CHECK_RET(merge_cb(dup_src, NULL, cb_data));
3956 }
Michal Vasko4490d312020-06-16 13:08:55 +02003957 }
3958
3959 return LY_SUCCESS;
3960}
3961
Michal Vasko3a41dff2020-07-15 14:30:28 +02003962static LY_ERR
Michal Vaskocd3f6172021-05-18 16:14:50 +02003963lyd_merge(struct lyd_node **target, const struct lyd_node *source, const struct lys_module *mod,
3964 lyd_merge_cb merge_cb, void *cb_data, uint16_t options, ly_bool nosiblings)
Michal Vasko4490d312020-06-16 13:08:55 +02003965{
3966 const struct lyd_node *sibling_src, *tmp;
Michal Vaskocd3f6172021-05-18 16:14:50 +02003967 struct lyd_dup_inst *dup_inst = NULL;
Radek Krejci857189e2020-09-01 13:26:36 +02003968 ly_bool first;
Michal Vaskocd3f6172021-05-18 16:14:50 +02003969 LY_ERR ret = LY_SUCCESS;
Michal Vasko4490d312020-06-16 13:08:55 +02003970
3971 LY_CHECK_ARG_RET(NULL, target, LY_EINVAL);
Michal Vasko1d80a532021-11-24 10:41:05 +01003972 LY_CHECK_CTX_EQUAL_RET(*target ? LYD_CTX(*target) : NULL, source ? LYD_CTX(source) : NULL, mod ? mod->ctx : NULL,
3973 LY_EINVAL);
Michal Vasko4490d312020-06-16 13:08:55 +02003974
3975 if (!source) {
3976 /* nothing to merge */
3977 return LY_SUCCESS;
3978 }
3979
Michal Vasko831422b2020-11-24 11:20:51 +01003980 if ((*target && lysc_data_parent((*target)->schema)) || lysc_data_parent(source->schema)) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02003981 LOGERR(LYD_CTX(source), LY_EINVAL, "Invalid arguments - can merge only 2 top-level subtrees (%s()).", __func__);
Michal Vasko4490d312020-06-16 13:08:55 +02003982 return LY_EINVAL;
3983 }
3984
3985 LY_LIST_FOR_SAFE(source, tmp, sibling_src) {
Michal Vaskocd3f6172021-05-18 16:14:50 +02003986 if (mod && (lyd_owner_module(sibling_src) != mod)) {
3987 /* skip data nodes from different modules */
3988 continue;
3989 }
3990
Radek Krejci857189e2020-09-01 13:26:36 +02003991 first = (sibling_src == source) ? 1 : 0;
Michal Vaskocd3f6172021-05-18 16:14:50 +02003992 ret = lyd_merge_sibling_r(target, NULL, &sibling_src, merge_cb, cb_data, options, &dup_inst);
3993 if (ret) {
3994 break;
3995 }
Michal Vasko4490d312020-06-16 13:08:55 +02003996 if (first && !sibling_src) {
3997 /* source was spent (unlinked), move to the next node */
3998 source = tmp;
3999 }
4000
Michal Vasko3a41dff2020-07-15 14:30:28 +02004001 if (nosiblings) {
Michal Vasko4490d312020-06-16 13:08:55 +02004002 break;
4003 }
4004 }
4005
4006 if (options & LYD_MERGE_DESTRUCT) {
4007 /* free any leftover source data that were not merged */
4008 lyd_free_siblings((struct lyd_node *)source);
4009 }
4010
Michal Vaskocd3f6172021-05-18 16:14:50 +02004011 lyd_dup_inst_free(dup_inst);
4012 return ret;
Michal Vasko4490d312020-06-16 13:08:55 +02004013}
4014
Jan Kundrátc6e39de2021-12-09 16:01:19 +01004015LIBYANG_API_DEF LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02004016lyd_merge_tree(struct lyd_node **target, const struct lyd_node *source, uint16_t options)
Michal Vasko3a41dff2020-07-15 14:30:28 +02004017{
Michal Vaskocd3f6172021-05-18 16:14:50 +02004018 return lyd_merge(target, source, NULL, NULL, NULL, options, 1);
Michal Vasko3a41dff2020-07-15 14:30:28 +02004019}
4020
Jan Kundrátc6e39de2021-12-09 16:01:19 +01004021LIBYANG_API_DEF LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02004022lyd_merge_siblings(struct lyd_node **target, const struct lyd_node *source, uint16_t options)
Michal Vasko3a41dff2020-07-15 14:30:28 +02004023{
Michal Vaskocd3f6172021-05-18 16:14:50 +02004024 return lyd_merge(target, source, NULL, NULL, NULL, options, 0);
4025}
4026
Jan Kundrátc6e39de2021-12-09 16:01:19 +01004027LIBYANG_API_DEF LY_ERR
Michal Vaskocd3f6172021-05-18 16:14:50 +02004028lyd_merge_module(struct lyd_node **target, const struct lyd_node *source, const struct lys_module *mod,
4029 lyd_merge_cb merge_cb, void *cb_data, uint16_t options)
4030{
4031 return lyd_merge(target, source, mod, merge_cb, cb_data, options, 0);
Michal Vasko3a41dff2020-07-15 14:30:28 +02004032}
4033
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004034static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02004035lyd_path_str_enlarge(char **buffer, size_t *buflen, size_t reqlen, ly_bool is_static)
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004036{
Michal Vasko14654712020-02-06 08:35:21 +01004037 /* ending \0 */
4038 ++reqlen;
4039
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004040 if (reqlen > *buflen) {
4041 if (is_static) {
4042 return LY_EINCOMPLETE;
4043 }
4044
4045 *buffer = ly_realloc(*buffer, reqlen * sizeof **buffer);
4046 if (!*buffer) {
4047 return LY_EMEM;
4048 }
4049
4050 *buflen = reqlen;
4051 }
4052
4053 return LY_SUCCESS;
4054}
4055
Michal Vaskod59035b2020-07-08 12:00:06 +02004056LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02004057lyd_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 +02004058{
4059 const struct lyd_node *key;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004060 size_t len;
4061 const char *val;
4062 char quot;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004063
Michal Vasko824d0832021-11-04 15:36:51 +01004064 for (key = lyd_child(node); key && key->schema && (key->schema->flags & LYS_KEY); key = key->next) {
Radek Krejci6d5ba0c2021-04-26 07:49:59 +02004065 val = lyd_get_value(key);
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004066 len = 1 + strlen(key->schema->name) + 2 + strlen(val) + 2;
Michal Vaskoba99a3e2020-08-18 15:50:05 +02004067 LY_CHECK_RET(lyd_path_str_enlarge(buffer, buflen, *bufused + len, is_static));
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004068
4069 quot = '\'';
4070 if (strchr(val, '\'')) {
4071 quot = '"';
4072 }
4073 *bufused += sprintf(*buffer + *bufused, "[%s=%c%s%c]", key->schema->name, quot, val, quot);
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004074 }
4075
4076 return LY_SUCCESS;
4077}
4078
4079/**
4080 * @brief Append leaf-list value predicate to path.
4081 *
4082 * @param[in] node Node to print.
4083 * @param[in,out] buffer Buffer to print to.
4084 * @param[in,out] buflen Current buffer length.
4085 * @param[in,out] bufused Current number of characters used in @p buffer.
4086 * @param[in] is_static Whether buffer is static or can be reallocated.
4087 * @return LY_ERR
4088 */
4089static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02004090lyd_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 +02004091{
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004092 size_t len;
4093 const char *val;
4094 char quot;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004095
Radek Krejci6d5ba0c2021-04-26 07:49:59 +02004096 val = lyd_get_value(node);
Radek Krejcif13b87b2020-12-01 22:02:17 +01004097 len = 4 + strlen(val) + 2; /* "[.='" + val + "']" */
Michal Vaskoba99a3e2020-08-18 15:50:05 +02004098 LY_CHECK_RET(lyd_path_str_enlarge(buffer, buflen, *bufused + len, is_static));
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004099
4100 quot = '\'';
4101 if (strchr(val, '\'')) {
4102 quot = '"';
4103 }
4104 *bufused += sprintf(*buffer + *bufused, "[.=%c%s%c]", quot, val, quot);
4105
Michal Vaskoba99a3e2020-08-18 15:50:05 +02004106 return LY_SUCCESS;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004107}
4108
4109/**
4110 * @brief Append node position (relative to its other instances) predicate to path.
4111 *
4112 * @param[in] node Node to print.
4113 * @param[in,out] buffer Buffer to print to.
4114 * @param[in,out] buflen Current buffer length.
4115 * @param[in,out] bufused Current number of characters used in @p buffer.
4116 * @param[in] is_static Whether buffer is static or can be reallocated.
4117 * @return LY_ERR
4118 */
4119static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02004120lyd_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 +02004121{
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004122 size_t len;
Michal Vasko50cc0562021-05-18 16:15:43 +02004123 uint32_t pos;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004124 char *val = NULL;
4125 LY_ERR rc;
4126
Michal Vasko50cc0562021-05-18 16:15:43 +02004127 pos = lyd_list_pos(node);
4128 if (asprintf(&val, "%" PRIu32, pos) == -1) {
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004129 return LY_EMEM;
4130 }
4131
4132 len = 1 + strlen(val) + 1;
4133 rc = lyd_path_str_enlarge(buffer, buflen, *bufused + len, is_static);
4134 if (rc != LY_SUCCESS) {
4135 goto cleanup;
4136 }
4137
4138 *bufused += sprintf(*buffer + *bufused, "[%s]", val);
4139
4140cleanup:
4141 free(val);
4142 return rc;
4143}
4144
Jan Kundrátc6e39de2021-12-09 16:01:19 +01004145LIBYANG_API_DEF char *
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004146lyd_path(const struct lyd_node *node, LYD_PATH_TYPE pathtype, char *buffer, size_t buflen)
4147{
Radek Krejci857189e2020-09-01 13:26:36 +02004148 ly_bool is_static = 0;
Radek Krejci1deb5be2020-08-26 16:43:36 +02004149 uint32_t i, depth;
Michal Vasko14654712020-02-06 08:35:21 +01004150 size_t bufused = 0, len;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004151 const struct lyd_node *iter;
4152 const struct lys_module *mod;
Michal Vasko790b2bc2020-08-03 13:35:06 +02004153 LY_ERR rc = LY_SUCCESS;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004154
4155 LY_CHECK_ARG_RET(NULL, node, NULL);
4156 if (buffer) {
Michal Vasko16385f42021-05-18 16:16:09 +02004157 LY_CHECK_ARG_RET(LYD_CTX(node), buflen > 1, NULL);
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004158 is_static = 1;
Michal Vasko14654712020-02-06 08:35:21 +01004159 } else {
4160 buflen = 0;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004161 }
4162
4163 switch (pathtype) {
Radek Krejci635d2b82021-01-04 11:26:51 +01004164 case LYD_PATH_STD:
4165 case LYD_PATH_STD_NO_LAST_PRED:
Michal Vasko14654712020-02-06 08:35:21 +01004166 depth = 1;
Michal Vasko9e685082021-01-29 14:49:09 +01004167 for (iter = node; iter->parent; iter = lyd_parent(iter)) {
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004168 ++depth;
4169 }
4170
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004171 goto iter_print;
Michal Vasko14654712020-02-06 08:35:21 +01004172 while (depth) {
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004173 /* find the right node */
Michal Vasko9e685082021-01-29 14:49:09 +01004174 for (iter = node, i = 1; i < depth; iter = lyd_parent(iter), ++i) {}
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004175iter_print:
4176 /* print prefix and name */
4177 mod = NULL;
Michal Vasko9f1b4472022-01-06 13:35:08 +01004178 if (iter->schema && (!iter->parent || !iter->parent->schema ||
4179 (iter->schema->module != iter->parent->schema->module))) {
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004180 mod = iter->schema->module;
4181 }
4182
4183 /* realloc string */
Michal Vaskoad92b672020-11-12 13:11:31 +01004184 len = 1 + (mod ? strlen(mod->name) + 1 : 0) + (iter->schema ? strlen(iter->schema->name) :
4185 strlen(((struct lyd_node_opaq *)iter)->name.name));
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004186 rc = lyd_path_str_enlarge(&buffer, &buflen, bufused + len, is_static);
4187 if (rc != LY_SUCCESS) {
4188 break;
4189 }
4190
4191 /* print next node */
Radek Krejci1798aae2020-07-14 13:26:06 +02004192 bufused += sprintf(buffer + bufused, "/%s%s%s", mod ? mod->name : "", mod ? ":" : "",
Michal Vaskoad92b672020-11-12 13:11:31 +01004193 iter->schema ? iter->schema->name : ((struct lyd_node_opaq *)iter)->name.name);
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004194
Michal Vasko790b2bc2020-08-03 13:35:06 +02004195 /* do not always print the last (first) predicate */
Radek Krejci635d2b82021-01-04 11:26:51 +01004196 if (iter->schema && ((depth > 1) || (pathtype == LYD_PATH_STD))) {
Michal Vasko790b2bc2020-08-03 13:35:06 +02004197 switch (iter->schema->nodetype) {
4198 case LYS_LIST:
4199 if (iter->schema->flags & LYS_KEYLESS) {
4200 /* print its position */
4201 rc = lyd_path_position_predicate(iter, &buffer, &buflen, &bufused, is_static);
4202 } else {
4203 /* print all list keys in predicates */
4204 rc = lyd_path_list_predicate(iter, &buffer, &buflen, &bufused, is_static);
4205 }
4206 break;
4207 case LYS_LEAFLIST:
4208 if (iter->schema->flags & LYS_CONFIG_W) {
4209 /* print leaf-list value */
4210 rc = lyd_path_leaflist_predicate(iter, &buffer, &buflen, &bufused, is_static);
4211 } else {
4212 /* print its position */
4213 rc = lyd_path_position_predicate(iter, &buffer, &buflen, &bufused, is_static);
4214 }
4215 break;
4216 default:
4217 /* nothing to print more */
4218 break;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004219 }
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004220 }
4221 if (rc != LY_SUCCESS) {
4222 break;
4223 }
4224
Michal Vasko14654712020-02-06 08:35:21 +01004225 --depth;
Michal Vasko5ec7cda2019-09-11 13:43:08 +02004226 }
4227 break;
4228 }
4229
4230 return buffer;
4231}
Michal Vaskoe444f752020-02-10 12:20:06 +01004232
Jan Kundrátc6e39de2021-12-09 16:01:19 +01004233LIBYANG_API_DEF struct lyd_meta *
Michal Vasko25a32822020-07-09 15:48:22 +02004234lyd_find_meta(const struct lyd_meta *first, const struct lys_module *module, const char *name)
4235{
4236 struct lyd_meta *ret = NULL;
4237 const struct ly_ctx *ctx;
4238 const char *prefix, *tmp;
4239 char *str;
4240 size_t pref_len, name_len;
4241
4242 LY_CHECK_ARG_RET(NULL, module || strchr(name, ':'), name, NULL);
Michal Vasko1d80a532021-11-24 10:41:05 +01004243 LY_CHECK_CTX_EQUAL_RET(first ? first->annotation->module->ctx : NULL, module ? module->ctx : NULL, NULL);
Michal Vasko25a32822020-07-09 15:48:22 +02004244
4245 if (!first) {
4246 return NULL;
4247 }
4248
4249 ctx = first->annotation->module->ctx;
4250
4251 /* parse the name */
4252 tmp = name;
4253 if (ly_parse_nodeid(&tmp, &prefix, &pref_len, &name, &name_len) || tmp[0]) {
4254 LOGERR(ctx, LY_EINVAL, "Metadata name \"%s\" is not valid.", name);
4255 return NULL;
4256 }
4257
4258 /* find the module */
4259 if (prefix) {
4260 str = strndup(prefix, pref_len);
4261 module = ly_ctx_get_module_latest(ctx, str);
4262 free(str);
Radek Krejci422afb12021-03-04 16:38:16 +01004263 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 +02004264 }
4265
4266 /* find the metadata */
4267 LY_LIST_FOR(first, first) {
4268 if ((first->annotation->module == module) && !strcmp(first->name, name)) {
4269 ret = (struct lyd_meta *)first;
4270 break;
4271 }
4272 }
4273
4274 return ret;
4275}
4276
Jan Kundrátc6e39de2021-12-09 16:01:19 +01004277LIBYANG_API_DEF LY_ERR
Michal Vaskoe444f752020-02-10 12:20:06 +01004278lyd_find_sibling_first(const struct lyd_node *siblings, const struct lyd_node *target, struct lyd_node **match)
4279{
Michal Vaskoe78faec2021-04-08 17:24:43 +02004280 struct lyd_node **match_p, *iter;
Michal Vaskoe444f752020-02-10 12:20:06 +01004281 struct lyd_node_inner *parent;
Michal Vaskoe78faec2021-04-08 17:24:43 +02004282 ly_bool found;
Michal Vaskoe444f752020-02-10 12:20:06 +01004283
Michal Vaskof03ed032020-03-04 13:31:44 +01004284 LY_CHECK_ARG_RET(NULL, target, LY_EINVAL);
Michal Vasko1d80a532021-11-24 10:41:05 +01004285 LY_CHECK_CTX_EQUAL_RET(siblings ? LYD_CTX(siblings) : NULL, LYD_CTX(target), LY_EINVAL);
Michal Vaskoe444f752020-02-10 12:20:06 +01004286
Michal Vasko6da1e952020-12-09 18:14:38 +01004287 if (!siblings || (siblings->schema && target->schema &&
4288 (lysc_data_parent(siblings->schema) != lysc_data_parent(target->schema)))) {
Michal Vasko62ed12d2020-05-21 10:08:25 +02004289 /* no data or schema mismatch */
Michal Vasko9b368d32020-02-14 13:53:31 +01004290 if (match) {
4291 *match = NULL;
4292 }
Michal Vaskoe444f752020-02-10 12:20:06 +01004293 return LY_ENOTFOUND;
4294 }
4295
Michal Vaskoe78faec2021-04-08 17:24:43 +02004296 /* get first sibling */
4297 siblings = lyd_first_sibling(siblings);
Michal Vaskoe444f752020-02-10 12:20:06 +01004298
Michal Vasko9e685082021-01-29 14:49:09 +01004299 parent = siblings->parent;
Michal Vasko6da1e952020-12-09 18:14:38 +01004300 if (parent && parent->schema && parent->children_ht) {
Michal Vaskoe444f752020-02-10 12:20:06 +01004301 assert(target->hash);
4302
Michal Vaskoe78faec2021-04-08 17:24:43 +02004303 if (lysc_is_dup_inst_list(target->schema)) {
4304 /* we must search the instances from beginning to find the first matching one */
4305 found = 0;
4306 LYD_LIST_FOR_INST(siblings, target->schema, iter) {
4307 if (!lyd_compare_single(target, iter, 0)) {
4308 found = 1;
4309 break;
4310 }
4311 }
4312 if (found) {
4313 siblings = iter;
Michal Vaskoda859032020-07-14 12:20:14 +02004314 } else {
4315 siblings = NULL;
4316 }
Michal Vaskoe444f752020-02-10 12:20:06 +01004317 } else {
Michal Vaskoe78faec2021-04-08 17:24:43 +02004318 /* find by hash */
4319 if (!lyht_find(parent->children_ht, &target, target->hash, (void **)&match_p)) {
4320 siblings = *match_p;
4321 } else {
4322 /* not found */
4323 siblings = NULL;
4324 }
Michal Vaskoe444f752020-02-10 12:20:06 +01004325 }
4326 } else {
4327 /* no children hash table */
Michal Vaskod989ba02020-08-24 10:59:24 +02004328 for ( ; siblings; siblings = siblings->next) {
Michal Vasko8f359bf2020-07-28 10:41:15 +02004329 if (!lyd_compare_single(siblings, target, 0)) {
Michal Vaskoe444f752020-02-10 12:20:06 +01004330 break;
4331 }
4332 }
4333 }
4334
4335 if (!siblings) {
Michal Vasko9b368d32020-02-14 13:53:31 +01004336 if (match) {
4337 *match = NULL;
4338 }
Michal Vaskoe444f752020-02-10 12:20:06 +01004339 return LY_ENOTFOUND;
4340 }
4341
Michal Vasko9b368d32020-02-14 13:53:31 +01004342 if (match) {
4343 *match = (struct lyd_node *)siblings;
4344 }
Michal Vaskoe444f752020-02-10 12:20:06 +01004345 return LY_SUCCESS;
4346}
4347
Radek Krejci857189e2020-09-01 13:26:36 +02004348/**
4349 * @brief Comparison callback to match schema node with a schema of a data node.
4350 *
4351 * @param[in] val1_p Pointer to the schema node
4352 * @param[in] val2_p Pointer to the data node
Michal Vasko62524a92021-02-26 10:08:50 +01004353 * Implementation of ::lyht_value_equal_cb.
Radek Krejci857189e2020-09-01 13:26:36 +02004354 */
4355static ly_bool
4356lyd_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 +01004357{
4358 struct lysc_node *val1;
4359 struct lyd_node *val2;
4360
4361 val1 = *((struct lysc_node **)val1_p);
4362 val2 = *((struct lyd_node **)val2_p);
4363
Michal Vasko90932a92020-02-12 14:33:03 +01004364 if (val1 == val2->schema) {
4365 /* schema match is enough */
4366 return 1;
4367 } else {
4368 return 0;
4369 }
4370}
4371
Michal Vasko92239c72020-11-18 18:17:25 +01004372/**
4373 * @brief Search in the given siblings (NOT recursively) for the first schema node data instance.
4374 * Uses hashes - should be used whenever possible for best performance.
4375 *
4376 * @param[in] siblings Siblings to search in including preceding and succeeding nodes.
4377 * @param[in] schema Target data node schema to find.
4378 * @param[out] match Can be NULL, otherwise the found data node.
4379 * @return LY_SUCCESS on success, @p match set.
4380 * @return LY_ENOTFOUND if not found, @p match set to NULL.
4381 * @return LY_ERR value if another error occurred.
4382 */
Michal Vasko90932a92020-02-12 14:33:03 +01004383static LY_ERR
4384lyd_find_sibling_schema(const struct lyd_node *siblings, const struct lysc_node *schema, struct lyd_node **match)
4385{
4386 struct lyd_node **match_p;
4387 struct lyd_node_inner *parent;
4388 uint32_t hash;
Michal Vasko62524a92021-02-26 10:08:50 +01004389 lyht_value_equal_cb ht_cb;
Michal Vasko90932a92020-02-12 14:33:03 +01004390
Michal Vaskob104f112020-07-17 09:54:54 +02004391 assert(siblings && schema);
Michal Vasko90932a92020-02-12 14:33:03 +01004392
Michal Vasko9e685082021-01-29 14:49:09 +01004393 parent = siblings->parent;
Michal Vasko08fd6132020-11-18 18:17:45 +01004394 if (parent && parent->schema && parent->children_ht) {
Michal Vasko90932a92020-02-12 14:33:03 +01004395 /* calculate our hash */
4396 hash = dict_hash_multi(0, schema->module->name, strlen(schema->module->name));
4397 hash = dict_hash_multi(hash, schema->name, strlen(schema->name));
4398 hash = dict_hash_multi(hash, NULL, 0);
4399
4400 /* use special hash table function */
4401 ht_cb = lyht_set_cb(parent->children_ht, lyd_hash_table_schema_val_equal);
4402
4403 /* find by hash */
4404 if (!lyht_find(parent->children_ht, &schema, hash, (void **)&match_p)) {
4405 siblings = *match_p;
4406 } else {
4407 /* not found */
4408 siblings = NULL;
4409 }
4410
4411 /* set the original hash table compare function back */
4412 lyht_set_cb(parent->children_ht, ht_cb);
4413 } else {
Michal Vaskob104f112020-07-17 09:54:54 +02004414 /* find first sibling */
4415 if (siblings->parent) {
4416 siblings = siblings->parent->child;
4417 } else {
4418 while (siblings->prev->next) {
4419 siblings = siblings->prev;
4420 }
4421 }
4422
4423 /* search manually without hashes */
Michal Vaskod989ba02020-08-24 10:59:24 +02004424 for ( ; siblings; siblings = siblings->next) {
Michal Vasko90932a92020-02-12 14:33:03 +01004425 if (siblings->schema == schema) {
4426 /* schema match is enough */
4427 break;
4428 }
4429 }
4430 }
4431
4432 if (!siblings) {
Michal Vasko9b368d32020-02-14 13:53:31 +01004433 if (match) {
4434 *match = NULL;
4435 }
Michal Vasko90932a92020-02-12 14:33:03 +01004436 return LY_ENOTFOUND;
4437 }
4438
Michal Vasko9b368d32020-02-14 13:53:31 +01004439 if (match) {
4440 *match = (struct lyd_node *)siblings;
4441 }
Michal Vasko90932a92020-02-12 14:33:03 +01004442 return LY_SUCCESS;
4443}
4444
Jan Kundrátc6e39de2021-12-09 16:01:19 +01004445LIBYANG_API_DEF LY_ERR
Michal Vaskoe444f752020-02-10 12:20:06 +01004446lyd_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 +02004447 size_t val_len, struct lyd_node **match)
Michal Vaskoe444f752020-02-10 12:20:06 +01004448{
4449 LY_ERR rc;
4450 struct lyd_node *target = NULL;
4451
Michal Vasko4c583e82020-07-17 12:16:14 +02004452 LY_CHECK_ARG_RET(NULL, schema, !(schema->nodetype & (LYS_CHOICE | LYS_CASE)), LY_EINVAL);
Michal Vasko1d80a532021-11-24 10:41:05 +01004453 LY_CHECK_CTX_EQUAL_RET(siblings ? LYD_CTX(siblings) : NULL, schema->module->ctx, LY_EINVAL);
Michal Vaskoe444f752020-02-10 12:20:06 +01004454
Michal Vasko08fd6132020-11-18 18:17:45 +01004455 if (!siblings || (siblings->schema && (lysc_data_parent(siblings->schema) != lysc_data_parent(schema)))) {
Michal Vasko62ed12d2020-05-21 10:08:25 +02004456 /* no data or schema mismatch */
Michal Vasko9b368d32020-02-14 13:53:31 +01004457 if (match) {
4458 *match = NULL;
4459 }
Michal Vaskoe444f752020-02-10 12:20:06 +01004460 return LY_ENOTFOUND;
4461 }
4462
Michal Vaskof03ed032020-03-04 13:31:44 +01004463 if (key_or_value && !val_len) {
4464 val_len = strlen(key_or_value);
4465 }
4466
Michal Vaskob104f112020-07-17 09:54:54 +02004467 if ((schema->nodetype & (LYS_LIST | LYS_LEAFLIST)) && key_or_value) {
4468 /* create a data node and find the instance */
4469 if (schema->nodetype == LYS_LEAFLIST) {
4470 /* target used attributes: schema, hash, value */
Radek Krejci8df109d2021-04-23 12:19:08 +02004471 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 +02004472 LY_CHECK_RET(rc);
Michal Vaskob104f112020-07-17 09:54:54 +02004473 } else {
Michal Vasko90932a92020-02-12 14:33:03 +01004474 /* target used attributes: schema, hash, child (all keys) */
Michal Vasko004d3152020-06-11 19:59:22 +02004475 LY_CHECK_RET(lyd_create_list2(schema, key_or_value, val_len, &target));
Michal Vasko90932a92020-02-12 14:33:03 +01004476 }
4477
4478 /* find it */
4479 rc = lyd_find_sibling_first(siblings, target, match);
Michal Vaskob104f112020-07-17 09:54:54 +02004480 } else {
4481 /* find the first schema node instance */
4482 rc = lyd_find_sibling_schema(siblings, schema, match);
Michal Vaskoe444f752020-02-10 12:20:06 +01004483 }
4484
Michal Vaskoe444f752020-02-10 12:20:06 +01004485 lyd_free_tree(target);
4486 return rc;
4487}
Michal Vaskoccc02342020-05-21 10:09:21 +02004488
Jan Kundrátc6e39de2021-12-09 16:01:19 +01004489LIBYANG_API_DEF LY_ERR
Michal Vaskoe78faec2021-04-08 17:24:43 +02004490lyd_find_sibling_dup_inst_set(const struct lyd_node *siblings, const struct lyd_node *target, struct ly_set **set)
4491{
4492 struct lyd_node **match_p, *first, *iter;
4493 struct lyd_node_inner *parent;
4494
4495 LY_CHECK_ARG_RET(NULL, target, lysc_is_dup_inst_list(target->schema), set, LY_EINVAL);
Michal Vasko1d80a532021-11-24 10:41:05 +01004496 LY_CHECK_CTX_EQUAL_RET(siblings ? LYD_CTX(siblings) : NULL, LYD_CTX(target), LY_EINVAL);
Michal Vaskoe78faec2021-04-08 17:24:43 +02004497
4498 LY_CHECK_RET(ly_set_new(set));
4499
4500 if (!siblings || (siblings->schema && (lysc_data_parent(siblings->schema) != lysc_data_parent(target->schema)))) {
4501 /* no data or schema mismatch */
4502 return LY_ENOTFOUND;
4503 }
4504
4505 /* get first sibling */
4506 siblings = lyd_first_sibling(siblings);
4507
4508 parent = siblings->parent;
4509 if (parent && parent->schema && parent->children_ht) {
4510 assert(target->hash);
4511
4512 /* find the first instance */
4513 lyd_find_sibling_first(siblings, target, &first);
4514 if (first) {
4515 /* add it so that it is the first in the set */
4516 if (ly_set_add(*set, first, 1, NULL)) {
4517 goto error;
4518 }
4519
4520 /* find by hash */
4521 if (!lyht_find(parent->children_ht, &target, target->hash, (void **)&match_p)) {
4522 iter = *match_p;
4523 } else {
4524 /* not found */
4525 iter = NULL;
4526 }
4527 while (iter) {
4528 /* add all found nodes into the set */
4529 if ((iter != first) && !lyd_compare_single(iter, target, 0) && ly_set_add(*set, iter, 1, NULL)) {
4530 goto error;
4531 }
4532
4533 /* find next instance */
4534 if (lyht_find_next(parent->children_ht, &iter, iter->hash, (void **)&match_p)) {
4535 iter = NULL;
4536 } else {
4537 iter = *match_p;
4538 }
4539 }
4540 }
4541 } else {
4542 /* no children hash table */
4543 LY_LIST_FOR(siblings, siblings) {
4544 if (!lyd_compare_single(target, siblings, 0)) {
4545 ly_set_add(*set, (void *)siblings, 1, NULL);
4546 }
4547 }
4548 }
4549
4550 if (!(*set)->count) {
4551 return LY_ENOTFOUND;
4552 }
4553 return LY_SUCCESS;
4554
4555error:
4556 ly_set_free(*set, NULL);
4557 *set = NULL;
4558 return LY_EMEM;
4559}
4560
Jan Kundrátc6e39de2021-12-09 16:01:19 +01004561LIBYANG_API_DEF LY_ERR
Michal Vasko1d4af6c2021-02-22 13:31:26 +01004562lyd_find_sibling_opaq_next(const struct lyd_node *first, const char *name, struct lyd_node **match)
4563{
4564 LY_CHECK_ARG_RET(NULL, name, LY_EINVAL);
4565
4566 for ( ; first; first = first->next) {
4567 if (!first->schema && !strcmp(LYD_NAME(first), name)) {
4568 break;
4569 }
4570 }
4571
4572 if (match) {
4573 *match = (struct lyd_node *)first;
4574 }
4575 return first ? LY_SUCCESS : LY_ENOTFOUND;
4576}
4577
Jan Kundrátc6e39de2021-12-09 16:01:19 +01004578LIBYANG_API_DEF LY_ERR
Michal Vaskoaac267d2022-01-17 13:34:48 +01004579lyd_find_xpath4(const struct lyd_node *ctx_node, const struct lyd_node *tree, const char *xpath, LY_VALUE_FORMAT format,
4580 void *prefix_data, const struct lyxp_var *vars, struct ly_set **set)
Michal Vaskoccc02342020-05-21 10:09:21 +02004581{
4582 LY_ERR ret = LY_SUCCESS;
Michal Vasko8bd9cc72021-07-16 14:06:10 +02004583 struct lyxp_set xp_set = {0};
Radek Krejcif03a9e22020-09-18 20:09:31 +02004584 struct lyxp_expr *exp = NULL;
Michal Vaskoccc02342020-05-21 10:09:21 +02004585 uint32_t i;
4586
Michal Vaskoaac267d2022-01-17 13:34:48 +01004587 LY_CHECK_ARG_RET(NULL, tree, xpath, format, set, LY_EINVAL);
Michal Vaskoccc02342020-05-21 10:09:21 +02004588
Michal Vasko37c69432021-04-12 14:48:24 +02004589 *set = NULL;
Michal Vaskoccc02342020-05-21 10:09:21 +02004590
Michal Vaskoaac267d2022-01-17 13:34:48 +01004591 /* parse expression */
Michal Vasko279539d2021-12-13 16:58:25 +01004592 ret = lyxp_expr_parse((struct ly_ctx *)LYD_CTX(tree), xpath, 0, 1, &exp);
Radek Krejcif03a9e22020-09-18 20:09:31 +02004593 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskoccc02342020-05-21 10:09:21 +02004594
4595 /* evaluate expression */
Michal Vaskoaac267d2022-01-17 13:34:48 +01004596 ret = lyxp_eval(LYD_CTX(tree), exp, NULL, format, prefix_data, ctx_node, tree, vars, &xp_set, LYXP_IGNORE_WHEN);
Michal Vaskoccc02342020-05-21 10:09:21 +02004597 LY_CHECK_GOTO(ret, cleanup);
4598
4599 /* allocate return set */
Radek Krejciba03a5a2020-08-27 14:40:41 +02004600 ret = ly_set_new(set);
4601 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskoccc02342020-05-21 10:09:21 +02004602
4603 /* transform into ly_set */
4604 if (xp_set.type == LYXP_SET_NODE_SET) {
4605 /* allocate memory for all the elements once (even though not all items must be elements but most likely will be) */
4606 (*set)->objs = malloc(xp_set.used * sizeof *(*set)->objs);
Michal Vasko279539d2021-12-13 16:58:25 +01004607 LY_CHECK_ERR_GOTO(!(*set)->objs, LOGMEM(LYD_CTX(tree)); ret = LY_EMEM, cleanup);
Michal Vaskoccc02342020-05-21 10:09:21 +02004608 (*set)->size = xp_set.used;
4609
4610 for (i = 0; i < xp_set.used; ++i) {
4611 if (xp_set.val.nodes[i].type == LYXP_NODE_ELEM) {
Radek Krejci3d92e442020-10-12 12:48:13 +02004612 ret = ly_set_add(*set, xp_set.val.nodes[i].node, 1, NULL);
Radek Krejciba03a5a2020-08-27 14:40:41 +02004613 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskoccc02342020-05-21 10:09:21 +02004614 }
4615 }
4616 }
4617
4618cleanup:
Michal Vasko0691d522020-05-21 13:21:47 +02004619 lyxp_set_free_content(&xp_set);
Michal Vasko279539d2021-12-13 16:58:25 +01004620 lyxp_expr_free((struct ly_ctx *)LYD_CTX(tree), exp);
Radek Krejci8f45abc2020-11-26 12:15:13 +01004621 if (ret) {
4622 ly_set_free(*set, NULL);
4623 *set = NULL;
4624 }
Michal Vaskoccc02342020-05-21 10:09:21 +02004625 return ret;
4626}
Radek Krejcica989142020-11-05 11:32:22 +01004627
Jan Kundrátc6e39de2021-12-09 16:01:19 +01004628LIBYANG_API_DEF LY_ERR
Michal Vaskoaac267d2022-01-17 13:34:48 +01004629lyd_find_xpath3(const struct lyd_node *ctx_node, const struct lyd_node *tree, const char *xpath,
4630 const struct lyxp_var *vars, struct ly_set **set)
4631{
4632 LY_CHECK_ARG_RET(NULL, tree, xpath, set, LY_EINVAL);
4633
4634 return lyd_find_xpath4(ctx_node, tree, xpath, LY_VALUE_JSON, NULL, vars, set);
4635}
4636
4637LIBYANG_API_DEF LY_ERR
Michal Vasko279539d2021-12-13 16:58:25 +01004638lyd_find_xpath2(const struct lyd_node *ctx_node, const char *xpath, const struct lyxp_var *vars, struct ly_set **set)
4639{
4640 LY_CHECK_ARG_RET(NULL, ctx_node, xpath, set, LY_EINVAL);
4641
Michal Vaskoaac267d2022-01-17 13:34:48 +01004642 return lyd_find_xpath4(ctx_node, ctx_node, xpath, LY_VALUE_JSON, NULL, vars, set);
Michal Vasko279539d2021-12-13 16:58:25 +01004643}
4644
Jan Kundrátc6e39de2021-12-09 16:01:19 +01004645LIBYANG_API_DEF LY_ERR
aPiecekfba75362021-10-07 12:39:48 +02004646lyd_find_xpath(const struct lyd_node *ctx_node, const char *xpath, struct ly_set **set)
4647{
Michal Vasko279539d2021-12-13 16:58:25 +01004648 LY_CHECK_ARG_RET(NULL, ctx_node, xpath, set, LY_EINVAL);
4649
Michal Vaskoaac267d2022-01-17 13:34:48 +01004650 return lyd_find_xpath4(ctx_node, ctx_node, xpath, LY_VALUE_JSON, NULL, NULL, set);
aPiecekfba75362021-10-07 12:39:48 +02004651}
4652
Jan Kundrátc6e39de2021-12-09 16:01:19 +01004653LIBYANG_API_DEF LY_ERR
aPiecekfba75362021-10-07 12:39:48 +02004654lyd_eval_xpath2(const struct lyd_node *ctx_node, const char *xpath, const struct lyxp_var *vars, ly_bool *result)
Michal Vaskoc9eb3ca2021-07-16 10:20:37 +02004655{
4656 LY_ERR ret = LY_SUCCESS;
Michal Vasko8bd9cc72021-07-16 14:06:10 +02004657 struct lyxp_set xp_set = {0};
Michal Vaskoc9eb3ca2021-07-16 10:20:37 +02004658 struct lyxp_expr *exp = NULL;
4659
4660 LY_CHECK_ARG_RET(NULL, ctx_node, xpath, result, LY_EINVAL);
4661
4662 /* compile expression */
4663 ret = lyxp_expr_parse((struct ly_ctx *)LYD_CTX(ctx_node), xpath, 0, 1, &exp);
4664 LY_CHECK_GOTO(ret, cleanup);
4665
4666 /* evaluate expression */
aPiecekfba75362021-10-07 12:39:48 +02004667 ret = lyxp_eval(LYD_CTX(ctx_node), exp, NULL, LY_VALUE_JSON, NULL, ctx_node, ctx_node, vars, &xp_set, LYXP_IGNORE_WHEN);
Michal Vaskoc9eb3ca2021-07-16 10:20:37 +02004668 LY_CHECK_GOTO(ret, cleanup);
4669
4670 /* transform into boolean */
4671 ret = lyxp_set_cast(&xp_set, LYXP_SET_BOOLEAN);
4672 LY_CHECK_GOTO(ret, cleanup);
4673
4674 /* set result */
4675 *result = xp_set.val.bln;
4676
4677cleanup:
4678 lyxp_set_free_content(&xp_set);
4679 lyxp_expr_free((struct ly_ctx *)LYD_CTX(ctx_node), exp);
4680 return ret;
4681}
4682
Jan Kundrátc6e39de2021-12-09 16:01:19 +01004683LIBYANG_API_DEF LY_ERR
aPiecekfba75362021-10-07 12:39:48 +02004684lyd_eval_xpath(const struct lyd_node *ctx_node, const char *xpath, ly_bool *result)
4685{
4686 return lyd_eval_xpath2(ctx_node, xpath, NULL, result);
4687}
4688
Jan Kundrátc6e39de2021-12-09 16:01:19 +01004689LIBYANG_API_DEF LY_ERR
Michal Vasko3e1f6552021-01-14 09:27:55 +01004690lyd_find_path(const struct lyd_node *ctx_node, const char *path, ly_bool output, struct lyd_node **match)
4691{
4692 LY_ERR ret = LY_SUCCESS;
4693 struct lyxp_expr *expr = NULL;
4694 struct ly_path *lypath = NULL;
4695
4696 LY_CHECK_ARG_RET(NULL, ctx_node, ctx_node->schema, path, LY_EINVAL);
4697
4698 /* parse the path */
Michal Vaskoed725d72021-06-23 12:03:45 +02004699 ret = ly_path_parse(LYD_CTX(ctx_node), ctx_node->schema, path, strlen(path), 0, LY_PATH_BEGIN_EITHER,
Michal Vasko3e1f6552021-01-14 09:27:55 +01004700 LY_PATH_PREFIX_OPTIONAL, LY_PATH_PRED_SIMPLE, &expr);
4701 LY_CHECK_GOTO(ret, cleanup);
4702
4703 /* compile the path */
Michal Vaskoed725d72021-06-23 12:03:45 +02004704 ret = ly_path_compile(LYD_CTX(ctx_node), NULL, ctx_node->schema, NULL, expr,
Michal Vasko0884d212021-10-14 09:21:46 +02004705 output ? LY_PATH_OPER_OUTPUT : LY_PATH_OPER_INPUT, LY_PATH_TARGET_SINGLE, 0, LY_VALUE_JSON, NULL, &lypath);
Michal Vasko3e1f6552021-01-14 09:27:55 +01004706 LY_CHECK_GOTO(ret, cleanup);
4707
4708 /* evaluate the path */
4709 ret = ly_path_eval_partial(lypath, ctx_node, NULL, match);
4710
4711cleanup:
4712 lyxp_expr_free(LYD_CTX(ctx_node), expr);
4713 ly_path_free(LYD_CTX(ctx_node), lypath);
4714 return ret;
4715}
4716
Jan Kundrátc6e39de2021-12-09 16:01:19 +01004717LIBYANG_API_DEF LY_ERR
Michal Vaskobb22b182021-06-14 08:14:21 +02004718lyd_find_target(const struct ly_path *path, const struct lyd_node *tree, struct lyd_node **match)
4719{
4720 LY_ERR ret;
4721 struct lyd_node *m;
4722
4723 LY_CHECK_ARG_RET(NULL, path, LY_EINVAL);
4724
4725 ret = ly_path_eval(path, tree, &m);
4726 if (ret) {
4727 if (match) {
4728 *match = NULL;
4729 }
4730 return LY_ENOTFOUND;
4731 }
4732
4733 if (match) {
4734 *match = m;
4735 }
4736 return LY_SUCCESS;
4737}
4738
Jan Kundrátc6e39de2021-12-09 16:01:19 +01004739LIBYANG_API_DEF uint32_t
Radek Krejcica989142020-11-05 11:32:22 +01004740lyd_list_pos(const struct lyd_node *instance)
4741{
4742 const struct lyd_node *iter = NULL;
4743 uint32_t pos = 0;
4744
4745 if (!instance || !(instance->schema->nodetype & (LYS_LIST | LYS_LEAFLIST))) {
4746 return 0;
4747 }
4748
4749 /* data instances are ordered, so we can stop when we found instance of other schema node */
4750 for (iter = instance; iter->schema == instance->schema; iter = iter->prev) {
Radek Krejcibb27df32020-11-13 15:39:16 +01004751 if (pos && (iter->next == NULL)) {
Radek Krejcica989142020-11-05 11:32:22 +01004752 /* overrun to the end of the siblings list */
4753 break;
4754 }
4755 ++pos;
4756 }
4757
4758 return pos;
4759}
Radek Krejci4233f9b2020-11-05 12:38:35 +01004760
Jan Kundrátc6e39de2021-12-09 16:01:19 +01004761LIBYANG_API_DEF struct lyd_node *
Radek Krejci4233f9b2020-11-05 12:38:35 +01004762lyd_first_sibling(const struct lyd_node *node)
4763{
4764 struct lyd_node *start;
4765
4766 if (!node) {
4767 return NULL;
4768 }
4769
4770 /* get the first sibling */
4771 if (node->parent) {
4772 start = node->parent->child;
4773 } else {
Radek Krejcibb27df32020-11-13 15:39:16 +01004774 for (start = (struct lyd_node *)node; start->prev->next; start = start->prev) {}
Radek Krejci4233f9b2020-11-05 12:38:35 +01004775 }
4776
4777 return start;
4778}