blob: ad1e5bf13988628373353281f33b4959d2728f12 [file] [log] [blame]
Michal Vaskocde73ac2019-11-14 16:10:27 +01001/**
2 * @file validation.c
3 * @author Michal Vasko <mvasko@cesnet.cz>
4 * @brief Validation
5 *
Michal Vasko906bafa2022-04-22 12:28:55 +02006 * Copyright (c) 2019 - 2022 CESNET, z.s.p.o.
Michal Vaskocde73ac2019-11-14 16:10:27 +01007 *
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 */
Christian Hopps32874e12021-05-01 09:43:54 -040014#define _GNU_SOURCE /* asprintf, strdup */
Michal Vasko81bc5512020-11-13 18:05:18 +010015
Michal Vaskofbed4ea2020-07-08 10:43:30 +020016#include "validation.h"
Michal Vaskocde73ac2019-11-14 16:10:27 +010017
18#include <assert.h>
Radek Krejci77114102021-03-10 15:21:57 +010019#include <limits.h>
Radek Krejci535ea9f2020-05-29 16:01:05 +020020#include <stdint.h>
Michal Vasko52927e22020-03-16 17:26:14 +010021#include <stdio.h>
22#include <stdlib.h>
Radek Krejci535ea9f2020-05-29 16:01:05 +020023#include <string.h>
Michal Vaskocde73ac2019-11-14 16:10:27 +010024
Radek Krejci535ea9f2020-05-29 16:01:05 +020025#include "common.h"
Michal Vasko69730152020-10-09 16:30:07 +020026#include "compat.h"
Michal Vasko8104fd42020-07-13 11:09:51 +020027#include "diff.h"
Radek Krejci535ea9f2020-05-29 16:01:05 +020028#include "hash_table.h"
29#include "log.h"
Radek Krejci7931b192020-06-25 17:05:03 +020030#include "parser_data.h"
Radek Krejci77114102021-03-10 15:21:57 +010031#include "parser_internal.h"
Radek Krejci1b2eef82021-02-17 11:17:27 +010032#include "plugins_exts.h"
Radek Krejcif1ca0ac2021-04-12 16:00:06 +020033#include "plugins_exts/metadata.h"
Radek Krejci535ea9f2020-05-29 16:01:05 +020034#include "plugins_types.h"
35#include "set.h"
36#include "tree.h"
Radek Krejci47fab892020-11-05 17:02:41 +010037#include "tree_data.h"
Michal Vaskocde73ac2019-11-14 16:10:27 +010038#include "tree_data_internal.h"
Radek Krejci535ea9f2020-05-29 16:01:05 +020039#include "tree_schema.h"
Michal Vasko14654712020-02-06 08:35:21 +010040#include "tree_schema_internal.h"
Radek Krejci535ea9f2020-05-29 16:01:05 +020041#include "xpath.h"
Michal Vaskocde73ac2019-11-14 16:10:27 +010042
Michal Vaskoa6669ba2020-08-06 16:14:26 +020043LY_ERR
Michal Vasko8104fd42020-07-13 11:09:51 +020044lyd_val_diff_add(const struct lyd_node *node, enum lyd_diff_op op, struct lyd_node **diff)
45{
46 LY_ERR ret = LY_SUCCESS;
47 struct lyd_node *new_diff = NULL;
Michal Vasko81bc5512020-11-13 18:05:18 +010048 const struct lyd_node *prev_inst;
Michal Vaskoe78faec2021-04-08 17:24:43 +020049 char *key = NULL, *value = NULL, *position = NULL;
Michal Vasko81bc5512020-11-13 18:05:18 +010050 size_t buflen = 0, bufused = 0;
Michal Vaskoe78faec2021-04-08 17:24:43 +020051 uint32_t pos;
Michal Vasko8104fd42020-07-13 11:09:51 +020052
53 assert((op == LYD_DIFF_OP_DELETE) || (op == LYD_DIFF_OP_CREATE));
54
Michal Vasko81bc5512020-11-13 18:05:18 +010055 if ((op == LYD_DIFF_OP_CREATE) && lysc_is_userordered(node->schema)) {
Michal Vaskoe78faec2021-04-08 17:24:43 +020056 if (lysc_is_dup_inst_list(node->schema)) {
57 pos = lyd_list_pos(node);
Michal Vasko81bc5512020-11-13 18:05:18 +010058
Michal Vaskoe78faec2021-04-08 17:24:43 +020059 /* generate position meta */
60 if (pos > 1) {
61 if (asprintf(&position, "%" PRIu32, pos - 1) == -1) {
62 LOGMEM(LYD_CTX(node));
63 ret = LY_EMEM;
64 goto cleanup;
65 }
Michal Vasko81bc5512020-11-13 18:05:18 +010066 } else {
Michal Vaskoe78faec2021-04-08 17:24:43 +020067 position = strdup("");
68 LY_CHECK_ERR_GOTO(!position, LOGMEM(LYD_CTX(node)); ret = LY_EMEM, cleanup);
Michal Vasko81bc5512020-11-13 18:05:18 +010069 }
70 } else {
Michal Vaskoe78faec2021-04-08 17:24:43 +020071 if (node->prev->next && (node->prev->schema == node->schema)) {
72 prev_inst = node->prev;
Michal Vasko81bc5512020-11-13 18:05:18 +010073 } else {
Michal Vaskoe78faec2021-04-08 17:24:43 +020074 /* first instance */
75 prev_inst = NULL;
76 }
77
78 if (node->schema->nodetype == LYS_LIST) {
79 /* generate key meta */
80 if (prev_inst) {
81 LY_CHECK_GOTO(ret = lyd_path_list_predicate(prev_inst, &key, &buflen, &bufused, 0), cleanup);
82 } else {
83 key = strdup("");
84 LY_CHECK_ERR_GOTO(!key, LOGMEM(LYD_CTX(node)); ret = LY_EMEM, cleanup);
85 }
86 } else {
87 /* generate value meta */
88 if (prev_inst) {
Radek Krejci6d5ba0c2021-04-26 07:49:59 +020089 value = strdup(lyd_get_value(prev_inst));
Michal Vaskoe78faec2021-04-08 17:24:43 +020090 LY_CHECK_ERR_GOTO(!value, LOGMEM(LYD_CTX(node)); ret = LY_EMEM, cleanup);
91 } else {
92 value = strdup("");
93 LY_CHECK_ERR_GOTO(!value, LOGMEM(LYD_CTX(node)); ret = LY_EMEM, cleanup);
94 }
Michal Vasko81bc5512020-11-13 18:05:18 +010095 }
96 }
97 }
98
Michal Vasko8104fd42020-07-13 11:09:51 +020099 /* create new diff tree */
Michal Vaskoe78faec2021-04-08 17:24:43 +0200100 LY_CHECK_GOTO(ret = lyd_diff_add(node, op, NULL, NULL, key, value, position, NULL, NULL, &new_diff), cleanup);
Michal Vasko8104fd42020-07-13 11:09:51 +0200101
102 /* merge into existing diff */
Michal Vaskoc0e58e82020-11-11 19:04:33 +0100103 ret = lyd_diff_merge_all(diff, new_diff, 0);
Michal Vasko8104fd42020-07-13 11:09:51 +0200104
Michal Vasko81bc5512020-11-13 18:05:18 +0100105cleanup:
Michal Vasko8104fd42020-07-13 11:09:51 +0200106 lyd_free_tree(new_diff);
Michal Vasko81bc5512020-11-13 18:05:18 +0100107 free(key);
108 free(value);
Michal Vaskoe78faec2021-04-08 17:24:43 +0200109 free(position);
Michal Vasko8104fd42020-07-13 11:09:51 +0200110 return ret;
111}
112
113/**
Michal Vaskobd4db892020-11-23 16:58:20 +0100114 * @brief Evaluate all relevant "when" conditions of a node.
Michal Vaskocde73ac2019-11-14 16:10:27 +0100115 *
Michal Vaskobd4db892020-11-23 16:58:20 +0100116 * @param[in] tree Data tree.
117 * @param[in] node Node whose relevant when conditions will be evaluated.
118 * @param[in] schema Schema node of @p node. It may not be possible to use directly if @p node is opaque.
Michal Vasko976ec432021-12-06 15:42:22 +0100119 * @param[in] xpath_options Additional XPath options to use.
Michal Vaskobd4db892020-11-23 16:58:20 +0100120 * @param[out] disabled First when that evaluated false, if any.
121 * @return LY_SUCCESS on success.
122 * @return LY_EINCOMPLETE if a referenced node does not have its when evaluated.
123 * @return LY_ERR value on error.
Michal Vaskocde73ac2019-11-14 16:10:27 +0100124 */
125static LY_ERR
Michal Vaskobd4db892020-11-23 16:58:20 +0100126lyd_validate_node_when(const struct lyd_node *tree, const struct lyd_node *node, const struct lysc_node *schema,
Michal Vasko976ec432021-12-06 15:42:22 +0100127 uint32_t xpath_options, const struct lysc_when **disabled)
Michal Vaskocde73ac2019-11-14 16:10:27 +0100128{
Michal Vasko8104fd42020-07-13 11:09:51 +0200129 LY_ERR ret;
Michal Vaskocde73ac2019-11-14 16:10:27 +0100130 const struct lyd_node *ctx_node;
131 struct lyxp_set xp_set;
Michal Vaskobd4db892020-11-23 16:58:20 +0100132 LY_ARRAY_COUNT_TYPE u;
Michal Vaskocde73ac2019-11-14 16:10:27 +0100133
Michal Vaskobd4db892020-11-23 16:58:20 +0100134 assert(!node->schema || (node->schema == schema));
Michal Vaskocde73ac2019-11-14 16:10:27 +0100135
Michal Vaskobd4db892020-11-23 16:58:20 +0100136 *disabled = NULL;
Michal Vaskocde73ac2019-11-14 16:10:27 +0100137
Michal Vaskobd4db892020-11-23 16:58:20 +0100138 do {
Radek Krejci9a3823e2021-01-27 20:26:46 +0100139 const struct lysc_when *when;
140 struct lysc_when **when_list = lysc_node_when(schema);
Michal Vasko26bbb272022-08-02 14:54:33 +0200141
Radek Krejci9a3823e2021-01-27 20:26:46 +0100142 LY_ARRAY_FOR(when_list, u) {
143 when = when_list[u];
Michal Vaskocde73ac2019-11-14 16:10:27 +0100144
Michal Vaskobd4db892020-11-23 16:58:20 +0100145 /* get context node */
146 if (when->context == schema) {
147 ctx_node = node;
148 } else {
149 assert((!when->context && !node->parent) || (when->context == node->parent->schema));
Michal Vasko9e685082021-01-29 14:49:09 +0100150 ctx_node = lyd_parent(node);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100151 }
Michal Vaskobd4db892020-11-23 16:58:20 +0100152
153 /* evaluate when */
154 memset(&xp_set, 0, sizeof xp_set);
Radek Krejci8df109d2021-04-23 12:19:08 +0200155 ret = lyxp_eval(LYD_CTX(node), when->cond, schema->module, LY_VALUE_SCHEMA_RESOLVED, when->prefixes,
Michal Vaskoa3e92bc2022-07-29 14:56:23 +0200156 ctx_node, ctx_node, tree, NULL, &xp_set, LYXP_SCHEMA | xpath_options);
Michal Vaskobd4db892020-11-23 16:58:20 +0100157 lyxp_set_cast(&xp_set, LYXP_SET_BOOLEAN);
158
159 /* return error or LY_EINCOMPLETE for dependant unresolved when */
160 LY_CHECK_RET(ret);
161
162 if (!xp_set.val.bln) {
163 /* false when */
164 *disabled = when;
165 return LY_SUCCESS;
Michal Vasko8104fd42020-07-13 11:09:51 +0200166 }
Michal Vaskocde73ac2019-11-14 16:10:27 +0100167 }
Michal Vaskobd4db892020-11-23 16:58:20 +0100168
169 schema = schema->parent;
170 } while (schema && (schema->nodetype & (LYS_CASE | LYS_CHOICE)));
171
172 return LY_SUCCESS;
173}
174
175/**
176 * @brief Evaluate when conditions of collected unres nodes.
177 *
178 * @param[in,out] tree Data tree, is updated if some nodes are autodeleted.
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100179 * @param[in] mod Module of the @p tree to take into consideration when deleting @p tree and moving it.
180 * If set, it is expected @p tree should point to the first node of @p mod. Otherwise it will simply be
181 * the first top-level sibling.
Michal Vaskobd4db892020-11-23 16:58:20 +0100182 * @param[in] node_when Set with nodes with "when" conditions.
Michal Vasko976ec432021-12-06 15:42:22 +0100183 * @param[in] xpath_options Additional XPath options to use.
Michal Vasko27d2b1b2021-07-19 15:20:02 +0200184 * @param[in,out] node_types Set with nodes with unresolved types, remove any with false "when" parents.
Michal Vaskobd4db892020-11-23 16:58:20 +0100185 * @param[in,out] diff Validation diff.
186 * @return LY_SUCCESS on success.
187 * @return LY_ERR value on error.
188 */
189static LY_ERR
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100190lyd_validate_unres_when(struct lyd_node **tree, const struct lys_module *mod, struct ly_set *node_when,
Michal Vasko976ec432021-12-06 15:42:22 +0100191 uint32_t xpath_options, struct ly_set *node_types, struct lyd_node **diff)
Michal Vaskobd4db892020-11-23 16:58:20 +0100192{
Michal Vasko6f0c5c72022-08-05 15:28:14 +0200193 LY_ERR rc, r;
Michal Vasko27d2b1b2021-07-19 15:20:02 +0200194 uint32_t i, idx;
Michal Vaskobd4db892020-11-23 16:58:20 +0100195 const struct lysc_when *disabled;
Michal Vasko27d2b1b2021-07-19 15:20:02 +0200196 struct lyd_node *node = NULL, *elem;
Michal Vaskobd4db892020-11-23 16:58:20 +0100197
198 if (!node_when->count) {
199 return LY_SUCCESS;
Michal Vaskocde73ac2019-11-14 16:10:27 +0100200 }
201
Michal Vaskobd4db892020-11-23 16:58:20 +0100202 i = node_when->count;
203 do {
204 --i;
205 node = node_when->dnodes[i];
Radek Krejciddace2c2021-01-08 11:30:56 +0100206 LOG_LOCSET(node->schema, node, NULL, NULL);
Michal Vaskobd4db892020-11-23 16:58:20 +0100207
208 /* evaluate all when expressions that affect this node's existence */
Michal Vasko6f0c5c72022-08-05 15:28:14 +0200209 r = lyd_validate_node_when(*tree, node, node->schema, xpath_options, &disabled);
210 if (!r) {
Michal Vaskobd4db892020-11-23 16:58:20 +0100211 if (disabled) {
212 /* when false */
213 if (node->flags & LYD_WHEN_TRUE) {
214 /* autodelete */
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100215 lyd_del_move_root(tree, node, mod);
Michal Vaskobd4db892020-11-23 16:58:20 +0100216 if (diff) {
217 /* add into diff */
Michal Vasko6f0c5c72022-08-05 15:28:14 +0200218 LY_CHECK_GOTO(rc = lyd_val_diff_add(node, LYD_DIFF_OP_DELETE, diff), error);
Michal Vaskobd4db892020-11-23 16:58:20 +0100219 }
Michal Vasko27d2b1b2021-07-19 15:20:02 +0200220
221 /* remove from node types set, if present */
Michal Vasko6f0c5c72022-08-05 15:28:14 +0200222 if (node_types && node_types->count) {
Michal Vasko36ce6b22021-07-26 09:19:21 +0200223 LYD_TREE_DFS_BEGIN(node, elem) {
Michal Vasko6f0c5c72022-08-05 15:28:14 +0200224 /* only term nodes with a validation callback can be in node_types */
225 if ((elem->schema->nodetype & LYD_NODE_TERM) &&
226 ((struct lysc_node_leaf *)elem->schema)->type->plugin->validate &&
227 ly_set_contains(node_types, elem, &idx)) {
228 LY_CHECK_GOTO(rc = ly_set_rm_index(node_types, idx, NULL), error);
Michal Vasko36ce6b22021-07-26 09:19:21 +0200229 }
230 LYD_TREE_DFS_END(node, elem);
Michal Vasko27d2b1b2021-07-19 15:20:02 +0200231 }
Michal Vasko27d2b1b2021-07-19 15:20:02 +0200232 }
233
234 /* free */
Michal Vaskobd4db892020-11-23 16:58:20 +0100235 lyd_free_tree(node);
236 } else {
237 /* invalid data */
Radek Krejci2efc45b2020-12-22 16:25:44 +0100238 LOGVAL(LYD_CTX(node), LY_VCODE_NOWHEN, disabled->cond->expr);
Michal Vasko6f0c5c72022-08-05 15:28:14 +0200239 rc = LY_EVALID;
Radek Krejci2efc45b2020-12-22 16:25:44 +0100240 goto error;
Michal Vaskobd4db892020-11-23 16:58:20 +0100241 }
242 } else {
243 /* when true */
244 node->flags |= LYD_WHEN_TRUE;
245 }
246
Michal Vasko413af592021-12-13 11:50:51 +0100247 /* remove this node from the set keeping the order, its when was resolved */
248 ly_set_rm_index_ordered(node_when, i, NULL);
Michal Vasko6f0c5c72022-08-05 15:28:14 +0200249 } else if (r != LY_EINCOMPLETE) {
Michal Vaskobd4db892020-11-23 16:58:20 +0100250 /* error */
Michal Vasko6f0c5c72022-08-05 15:28:14 +0200251 rc = r;
Radek Krejci2efc45b2020-12-22 16:25:44 +0100252 goto error;
Michal Vaskobd4db892020-11-23 16:58:20 +0100253 }
Radek Krejci2efc45b2020-12-22 16:25:44 +0100254
Radek Krejciddace2c2021-01-08 11:30:56 +0100255 LOG_LOCBACK(1, 1, 0, 0);
Michal Vaskobd4db892020-11-23 16:58:20 +0100256 } while (i);
257
258 return LY_SUCCESS;
Radek Krejci2efc45b2020-12-22 16:25:44 +0100259
260error:
Radek Krejciddace2c2021-01-08 11:30:56 +0100261 LOG_LOCBACK(1, 1, 0, 0);
Michal Vasko6f0c5c72022-08-05 15:28:14 +0200262 return rc;
Michal Vaskocde73ac2019-11-14 16:10:27 +0100263}
264
Radek Krejci4f2e3e52021-03-30 14:20:28 +0200265LY_ERR
Michal Vaskofbbea932022-06-07 11:00:55 +0200266lyd_validate_unres(struct lyd_node **tree, const struct lys_module *mod, enum lyd_type data_type, struct ly_set *node_when,
Michal Vasko135719f2022-08-25 12:18:17 +0200267 uint32_t when_xp_opts, struct ly_set *node_types, struct ly_set *meta_types, struct ly_set *ext_node,
268 struct ly_set *ext_val, uint32_t val_opts, struct lyd_node **diff)
Michal Vaskocde73ac2019-11-14 16:10:27 +0100269{
270 LY_ERR ret = LY_SUCCESS;
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200271 uint32_t i;
Michal Vaskocde73ac2019-11-14 16:10:27 +0100272
Michal Vaskoddd76592022-01-17 13:34:48 +0100273 if (ext_val && ext_val->count) {
274 /* first validate parsed extension data */
275 i = ext_val->count;
276 do {
277 --i;
278
279 struct lyd_ctx_ext_val *ext_v = ext_val->objs[i];
280
281 /* validate extension data */
Michal Vaskofbbea932022-06-07 11:00:55 +0200282 ret = ext_v->ext->def->plugin->validate(ext_v->ext, ext_v->sibling, *tree, data_type, val_opts, diff);
Michal Vaskoddd76592022-01-17 13:34:48 +0100283 LY_CHECK_RET(ret);
284
285 /* remove this item from the set */
Michal Vasko8cc3f662022-03-29 11:25:51 +0200286 ly_set_rm_index(ext_val, i, free);
Michal Vaskoddd76592022-01-17 13:34:48 +0100287 } while (i);
288 }
289
Michal Vasko135719f2022-08-25 12:18:17 +0200290 if (ext_node && ext_node->count) {
291 /* validate data nodes with extension instances */
292 i = ext_node->count;
293 do {
294 --i;
295
296 struct lyd_ctx_ext_node *ext_n = ext_node->objs[i];
297
298 /* validate the node */
Michal Vaskoeba23112022-08-26 08:35:41 +0200299 ret = ext_n->ext->def->plugin->node(ext_n->ext, ext_n->node, val_opts);
Michal Vasko135719f2022-08-25 12:18:17 +0200300 LY_CHECK_RET(ret);
301
302 /* remove this item from the set */
303 ly_set_rm_index(ext_node, i, free);
304 } while (i);
305 }
306
Michal Vaskob1b5c262020-03-05 14:29:47 +0100307 if (node_when) {
308 /* evaluate all when conditions */
309 uint32_t prev_count;
Michal Vasko26bbb272022-08-02 14:54:33 +0200310
Michal Vaskob1b5c262020-03-05 14:29:47 +0100311 do {
312 prev_count = node_when->count;
Michal Vasko976ec432021-12-06 15:42:22 +0100313 LY_CHECK_RET(lyd_validate_unres_when(tree, mod, node_when, when_xp_opts, node_types, diff));
Radek Krejci0f969882020-08-21 16:56:47 +0200314 /* there must have been some when conditions resolved */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100315 } while (prev_count > node_when->count);
Michal Vaskocde73ac2019-11-14 16:10:27 +0100316
Michal Vaskob1b5c262020-03-05 14:29:47 +0100317 /* there could have been no cyclic when dependencies, checked during compilation */
318 assert(!node_when->count);
319 }
320
321 if (node_types && node_types->count) {
322 /* finish incompletely validated terminal values (traverse from the end for efficient set removal) */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200323 i = node_types->count;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100324 do {
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200325 --i;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100326
Michal Vasko14ed9cd2021-01-28 14:16:25 +0100327 struct lyd_node_term *node = node_types->objs[i];
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200328 struct lysc_type *type = ((struct lysc_node_leaf *)node->schema)->type;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100329
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200330 /* resolve the value of the node */
Michal Vasko9e685082021-01-29 14:49:09 +0100331 LOG_LOCSET(node->schema, &node->node, NULL, NULL);
332 ret = lyd_value_validate_incomplete(LYD_CTX(node), type, &node->value, &node->node, *tree);
Radek Krejciddace2c2021-01-08 11:30:56 +0100333 LOG_LOCBACK(node->schema ? 1 : 0, 1, 0, 0);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100334 LY_CHECK_RET(ret);
335
336 /* remove this node from the set */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200337 ly_set_rm_index(node_types, i, NULL);
338 } while (i);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100339 }
340
Michal Vasko9f96a052020-03-10 09:41:45 +0100341 if (meta_types && meta_types->count) {
342 /* ... and metadata values */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200343 i = meta_types->count;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100344 do {
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200345 --i;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100346
Michal Vasko14ed9cd2021-01-28 14:16:25 +0100347 struct lyd_meta *meta = meta_types->objs[i];
Radek Krejci1b2eef82021-02-17 11:17:27 +0100348 struct lysc_type *type = *(struct lysc_type **)meta->annotation->substmts[ANNOTATION_SUBSTMT_TYPE].storage;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100349
Michal Vasko9f96a052020-03-10 09:41:45 +0100350 /* validate and store the value of the metadata */
Radek Krejci2efc45b2020-12-22 16:25:44 +0100351 ret = lyd_value_validate_incomplete(LYD_CTX(meta->parent), type, &meta->value, meta->parent, *tree);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100352 LY_CHECK_RET(ret);
353
354 /* remove this attr from the set */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200355 ly_set_rm_index(meta_types, i, NULL);
356 } while (i);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100357 }
Michal Vaskocde73ac2019-11-14 16:10:27 +0100358
359 return ret;
360}
361
Michal Vaskobb844672020-07-03 11:06:12 +0200362/**
363 * @brief Validate instance duplication.
364 *
365 * @param[in] first First sibling to search in.
366 * @param[in] node Data node instance to check.
367 * @return LY_ERR value.
368 */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100369static LY_ERR
370lyd_validate_duplicates(const struct lyd_node *first, const struct lyd_node *node)
Michal Vaskocde73ac2019-11-14 16:10:27 +0100371{
Michal Vaskob1b5c262020-03-05 14:29:47 +0100372 struct lyd_node **match_p;
Radek Krejci857189e2020-09-01 13:26:36 +0200373 ly_bool fail = 0;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100374
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100375 assert(node->flags & LYD_NEW);
376
Michal Vaskod6c18af2021-02-12 12:07:31 +0100377 /* key-less list or non-configuration leaf-list */
Michal Vaskoe78faec2021-04-08 17:24:43 +0200378 if (lysc_is_dup_inst_list(node->schema)) {
Michal Vaskob1b5c262020-03-05 14:29:47 +0100379 /* duplicate instances allowed */
380 return LY_SUCCESS;
Michal Vaskocde73ac2019-11-14 16:10:27 +0100381 }
382
Michal Vaskob1b5c262020-03-05 14:29:47 +0100383 /* find exactly the same next instance using hashes if possible */
384 if (node->parent && node->parent->children_ht) {
385 if (!lyht_find_next(node->parent->children_ht, &node, node->hash, (void **)&match_p)) {
386 fail = 1;
387 }
388 } else {
Michal Vaskod989ba02020-08-24 10:59:24 +0200389 for ( ; first; first = first->next) {
Michal Vaskob1b5c262020-03-05 14:29:47 +0100390 if (first == node) {
391 continue;
392 }
393
394 if (node->schema->nodetype & (LYD_NODE_ANY | LYS_LEAF)) {
395 if (first->schema == node->schema) {
396 fail = 1;
397 break;
398 }
Michal Vasko8f359bf2020-07-28 10:41:15 +0200399 } else if (!lyd_compare_single(first, node, 0)) {
Michal Vaskob1b5c262020-03-05 14:29:47 +0100400 fail = 1;
401 break;
402 }
403 }
404 }
405
406 if (fail) {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100407 LOGVAL(node->schema->module->ctx, LY_VCODE_DUP, node->schema->name);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100408 return LY_EVALID;
409 }
410 return LY_SUCCESS;
Michal Vaskocde73ac2019-11-14 16:10:27 +0100411}
412
Michal Vaskobb844672020-07-03 11:06:12 +0200413/**
414 * @brief Validate multiple case data existence with possible autodelete.
415 *
416 * @param[in,out] first First sibling to search in, is updated if needed.
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100417 * @param[in] mod Module of the siblings, NULL for nested siblings.
Michal Vaskobb844672020-07-03 11:06:12 +0200418 * @param[in] choic Choice node whose cases to check.
Michal Vasko8104fd42020-07-13 11:09:51 +0200419 * @param[in,out] diff Validation diff.
Michal Vaskobb844672020-07-03 11:06:12 +0200420 * @return LY_ERR value.
421 */
Michal Vaskocde73ac2019-11-14 16:10:27 +0100422static LY_ERR
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100423lyd_validate_cases(struct lyd_node **first, const struct lys_module *mod, const struct lysc_node_choice *choic,
424 struct lyd_node **diff)
Michal Vaskob1b5c262020-03-05 14:29:47 +0100425{
426 const struct lysc_node *scase, *iter, *old_case = NULL, *new_case = NULL;
427 struct lyd_node *match, *to_del;
Radek Krejci857189e2020-09-01 13:26:36 +0200428 ly_bool found;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100429
Michal Vasko14ed9cd2021-01-28 14:16:25 +0100430 LOG_LOCSET(&choic->node, NULL, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100431
Michal Vaskob1b5c262020-03-05 14:29:47 +0100432 LY_LIST_FOR((struct lysc_node *)choic->cases, scase) {
433 found = 0;
434 iter = NULL;
435 match = NULL;
436 while ((match = lys_getnext_data(match, *first, &iter, scase, NULL))) {
437 if (match->flags & LYD_NEW) {
438 /* a new case data found, nothing more to look for */
439 found = 2;
440 break;
441 } else {
442 /* and old case data found */
443 if (found == 0) {
444 found = 1;
445 }
446 }
447 }
448
449 if (found == 1) {
450 /* there should not be 2 old cases */
451 if (old_case) {
452 /* old data from 2 cases */
Radek Krejci2efc45b2020-12-22 16:25:44 +0100453 LOGVAL(choic->module->ctx, LY_VCODE_DUPCASE, old_case->name, scase->name);
Radek Krejciddace2c2021-01-08 11:30:56 +0100454 LOG_LOCBACK(1, 0, 0, 0);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100455 return LY_EVALID;
456 }
457
458 /* remember an old existing case */
459 old_case = scase;
460 } else if (found == 2) {
461 if (new_case) {
462 /* new data from 2 cases */
Radek Krejci2efc45b2020-12-22 16:25:44 +0100463 LOGVAL(choic->module->ctx, LY_VCODE_DUPCASE, new_case->name, scase->name);
Radek Krejciddace2c2021-01-08 11:30:56 +0100464 LOG_LOCBACK(1, 0, 0, 0);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100465 return LY_EVALID;
466 }
467
468 /* remember a new existing case */
469 new_case = scase;
470 }
471 }
472
Radek Krejciddace2c2021-01-08 11:30:56 +0100473 LOG_LOCBACK(1, 0, 0, 0);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100474
Michal Vaskob1b5c262020-03-05 14:29:47 +0100475 if (old_case && new_case) {
476 /* auto-delete old case */
477 iter = NULL;
478 match = NULL;
479 to_del = NULL;
480 while ((match = lys_getnext_data(match, *first, &iter, old_case, NULL))) {
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100481 lyd_del_move_root(first, to_del, mod);
482
Michal Vasko8104fd42020-07-13 11:09:51 +0200483 /* free previous node */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100484 lyd_free_tree(to_del);
Michal Vasko8104fd42020-07-13 11:09:51 +0200485 if (diff) {
486 /* add into diff */
487 LY_CHECK_RET(lyd_val_diff_add(match, LYD_DIFF_OP_DELETE, diff));
488 }
Michal Vaskob1b5c262020-03-05 14:29:47 +0100489 to_del = match;
490 }
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100491 lyd_del_move_root(first, to_del, mod);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100492 lyd_free_tree(to_del);
493 }
494
495 return LY_SUCCESS;
496}
497
Michal Vaskobb844672020-07-03 11:06:12 +0200498/**
499 * @brief Check whether a schema node can have some default values (true for NP containers as well).
500 *
501 * @param[in] schema Schema node to check.
502 * @return non-zero if yes,
503 * @return 0 otherwise.
504 */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100505static int
506lyd_val_has_default(const struct lysc_node *schema)
507{
508 switch (schema->nodetype) {
509 case LYS_LEAF:
510 if (((struct lysc_node_leaf *)schema)->dflt) {
511 return 1;
512 }
513 break;
514 case LYS_LEAFLIST:
515 if (((struct lysc_node_leaflist *)schema)->dflts) {
516 return 1;
517 }
518 break;
519 case LYS_CONTAINER:
520 if (!(schema->flags & LYS_PRESENCE)) {
521 return 1;
522 }
523 break;
524 default:
525 break;
526 }
527
528 return 0;
529}
530
Michal Vaskobb844672020-07-03 11:06:12 +0200531/**
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100532 * @brief Properly delete a node as part of autodelete validation tasks.
533 *
534 * @param[in,out] first First sibling, is updated if needed.
535 * @param[in] node Node instance to delete.
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100536 * @param[in] mod Module of the siblings, NULL for nested siblings.
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100537 * @param[in,out] next_p Temporary LY_LIST_FOR_SAFE next pointer, is updated if needed.
538 * @param[in,out] diff Validation diff.
539 */
540static void
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100541lyd_validate_autodel_node_del(struct lyd_node **first, struct lyd_node *node, const struct lys_module *mod,
542 struct lyd_node **next_p, struct lyd_node **diff)
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100543{
544 struct lyd_node *iter;
545
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100546 lyd_del_move_root(first, node, mod);
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100547 if (node == *next_p) {
548 *next_p = (*next_p)->next;
549 }
550 if (diff) {
551 /* add into diff */
552 if ((node->schema->nodetype == LYS_CONTAINER) && !(node->schema->flags & LYS_PRESENCE)) {
553 /* we do not want to track NP container changes, but remember any removed children */
554 LY_LIST_FOR(lyd_child(node), iter) {
555 lyd_val_diff_add(iter, LYD_DIFF_OP_DELETE, diff);
556 }
557 } else {
558 lyd_val_diff_add(node, LYD_DIFF_OP_DELETE, diff);
559 }
560 }
561 lyd_free_tree(node);
562}
563
564/**
Michal Vaskobb844672020-07-03 11:06:12 +0200565 * @brief Autodelete old instances to prevent validation errors.
566 *
567 * @param[in,out] first First sibling to search in, is updated if needed.
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100568 * @param[in] node New data node instance to check.
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100569 * @param[in] mod Module of the siblings, NULL for nested siblings.
Michal Vaskobb844672020-07-03 11:06:12 +0200570 * @param[in,out] next_p Temporary LY_LIST_FOR_SAFE next pointer, is updated if needed.
Michal Vasko8104fd42020-07-13 11:09:51 +0200571 * @param[in,out] diff Validation diff.
Michal Vaskobb844672020-07-03 11:06:12 +0200572 */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100573static void
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100574lyd_validate_autodel_dup(struct lyd_node **first, struct lyd_node *node, const struct lys_module *mod,
575 struct lyd_node **next_p, struct lyd_node **diff)
Michal Vaskob1b5c262020-03-05 14:29:47 +0100576{
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100577 struct lyd_node *match, *next;
578
579 assert(node->flags & LYD_NEW);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100580
581 if (lyd_val_has_default(node->schema)) {
582 assert(node->schema->nodetype & (LYS_LEAF | LYS_LEAFLIST | LYS_CONTAINER));
Michal Vasko4c583e82020-07-17 12:16:14 +0200583 LYD_LIST_FOR_INST_SAFE(*first, node->schema, next, match) {
Michal Vaskob1b5c262020-03-05 14:29:47 +0100584 if ((match->flags & LYD_DEFAULT) && !(match->flags & LYD_NEW)) {
585 /* default instance found, remove it */
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100586 lyd_validate_autodel_node_del(first, match, mod, next_p, diff);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100587
588 /* remove only a single container/leaf default instance, if there are more, it is an error */
589 if (node->schema->nodetype & (LYS_LEAF | LYS_CONTAINER)) {
590 break;
591 }
592 }
Michal Vaskob1b5c262020-03-05 14:29:47 +0100593 }
594 }
595}
596
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100597/**
598 * @brief Autodelete leftover default nodes of deleted cases (that have no existing explicit data).
599 *
600 * @param[in,out] first First sibling to search in, is updated if needed.
601 * @param[in] node Default data node instance to check.
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100602 * @param[in] mod Module of the siblings, NULL for nested siblings.
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100603 * @param[in,out] next_p Temporary LY_LIST_FOR_SAFE next pointer, is updated if needed.
604 * @param[in,out] diff Validation diff.
605 */
606static void
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100607lyd_validate_autodel_case_dflt(struct lyd_node **first, struct lyd_node *node, const struct lys_module *mod,
608 struct lyd_node **next_p, struct lyd_node **diff)
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100609{
610 struct lysc_node_choice *choic;
611 struct lyd_node *iter = NULL;
612 const struct lysc_node *slast = NULL;
613
614 assert(node->flags & LYD_DEFAULT);
615
616 if (!node->schema->parent || (node->schema->parent->nodetype != LYS_CASE)) {
617 /* the default node is not a descendant of a case */
618 return;
619 }
620
621 choic = (struct lysc_node_choice *)node->schema->parent->parent;
622 assert(choic->nodetype == LYS_CHOICE);
623
624 if (choic->dflt && (choic->dflt == (struct lysc_node_case *)node->schema->parent)) {
625 /* data of a default case, keep them */
626 return;
627 }
628
629 /* try to find an explicit node of the case */
630 while ((iter = lys_getnext_data(iter, *first, &slast, node->schema->parent, NULL))) {
631 if (!(iter->flags & LYD_DEFAULT)) {
632 break;
633 }
634 }
635
636 if (!iter) {
637 /* there are only default nodes of the case meaning it does not exist and neither should any default nodes
638 * of the case, remove this one default node */
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100639 lyd_validate_autodel_node_del(first, node, mod, next_p, diff);
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100640 }
641}
642
Michal Vasko17f76642021-08-03 17:01:30 +0200643/**
644 * @brief Validate new siblings in choices, recursively for nested choices.
645 *
646 * @param[in,out] first First sibling.
647 * @param[in] sparent Schema parent of the siblings, NULL for top-level siblings.
648 * @param[in] mod Module of the siblings, NULL for nested siblings.
649 * @param[in,out] diff Validation diff.
650 * @return LY_ERR value.
651 */
652static LY_ERR
653lyd_validate_choice_r(struct lyd_node **first, const struct lysc_node *sparent, const struct lys_module *mod,
Radek Krejci0f969882020-08-21 16:56:47 +0200654 struct lyd_node **diff)
Michal Vaskob1b5c262020-03-05 14:29:47 +0100655{
Michal Vaskob1b5c262020-03-05 14:29:47 +0100656 const struct lysc_node *snode = NULL;
657
Michal Vaskob1b5c262020-03-05 14:29:47 +0100658 while (*first && (snode = lys_getnext(snode, sparent, mod ? mod->compiled : NULL, LYS_GETNEXT_WITHCHOICE))) {
659 /* check case duplicites */
660 if (snode->nodetype == LYS_CHOICE) {
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100661 LY_CHECK_RET(lyd_validate_cases(first, mod, (struct lysc_node_choice *)snode, diff));
Michal Vasko17f76642021-08-03 17:01:30 +0200662
663 /* check for nested choice */
664 LY_CHECK_RET(lyd_validate_choice_r(first, snode, mod, diff));
Michal Vaskob1b5c262020-03-05 14:29:47 +0100665 }
666 }
667
Michal Vasko17f76642021-08-03 17:01:30 +0200668 return LY_SUCCESS;
669}
670
671LY_ERR
672lyd_validate_new(struct lyd_node **first, const struct lysc_node *sparent, const struct lys_module *mod,
673 struct lyd_node **diff)
674{
675 struct lyd_node *next, *node;
676
677 assert(first && (sparent || mod));
678
679 /* validate choices */
680 LY_CHECK_RET(lyd_validate_choice_r(first, sparent, mod, diff));
681
Michal Vaskob1b5c262020-03-05 14:29:47 +0100682 LY_LIST_FOR_SAFE(*first, next, node) {
Michal Vasko6a6e3082022-05-10 10:32:38 +0200683 if (!node->schema || (mod && (lyd_owner_module(node) != mod))) {
684 /* opaque node or all top-level data from this module checked */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100685 break;
686 }
687
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100688 if (!(node->flags & (LYD_NEW | LYD_DEFAULT))) {
689 /* check only new and default nodes */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100690 continue;
691 }
692
Radek Krejciddace2c2021-01-08 11:30:56 +0100693 LOG_LOCSET(node->schema, node, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100694
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100695 if (node->flags & LYD_NEW) {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100696 LY_ERR ret;
697
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100698 /* remove old default(s) of the new node if it exists */
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100699 lyd_validate_autodel_dup(first, node, mod, &next, diff);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100700
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100701 /* then check new node instance duplicities */
Radek Krejci2efc45b2020-12-22 16:25:44 +0100702 ret = lyd_validate_duplicates(*first, node);
Radek Krejciddace2c2021-01-08 11:30:56 +0100703 LY_CHECK_ERR_RET(ret, LOG_LOCBACK(node->schema ? 1 : 0, 1, 0, 0), ret);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100704
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100705 /* this node is valid */
706 node->flags &= ~LYD_NEW;
707 }
708
Michal Vasko0e6de512021-01-11 13:39:44 +0100709 LOG_LOCBACK(node->schema ? 1 : 0, 1, 0, 0);
710
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100711 if (node->flags & LYD_DEFAULT) {
712 /* remove leftover default nodes from a no-longer existing case */
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100713 lyd_validate_autodel_case_dflt(first, node, mod, &next, diff);
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100714 }
Michal Vaskob1b5c262020-03-05 14:29:47 +0100715 }
716
717 return LY_SUCCESS;
718}
719
Michal Vaskobb844672020-07-03 11:06:12 +0200720/**
Michal Vaskobd4db892020-11-23 16:58:20 +0100721 * @brief Evaluate any "when" conditions of a non-existent data node with existing parent.
722 *
723 * @param[in] first First data sibling of the non-existing node.
724 * @param[in] parent Data parent of the non-existing node.
725 * @param[in] snode Schema node of the non-existing node.
726 * @param[out] disabled First when that evaluated false, if any.
727 * @return LY_ERR value.
728 */
729static LY_ERR
730lyd_validate_dummy_when(const struct lyd_node *first, const struct lyd_node *parent, const struct lysc_node *snode,
731 const struct lysc_when **disabled)
732{
733 LY_ERR ret = LY_SUCCESS;
734 struct lyd_node *tree, *dummy = NULL;
Michal Vaskoa27245c2022-05-02 09:01:35 +0200735 uint32_t xp_opts;
Michal Vaskobd4db892020-11-23 16:58:20 +0100736
737 /* find root */
738 if (parent) {
739 tree = (struct lyd_node *)parent;
740 while (tree->parent) {
741 tree = lyd_parent(tree);
742 }
743 tree = lyd_first_sibling(tree);
744 } else {
Michal Vaskobd99b5e2022-04-29 11:15:47 +0200745 /* is the first sibling from the same module, but may not be the actual first */
746 tree = lyd_first_sibling(first);
Michal Vaskobd4db892020-11-23 16:58:20 +0100747 }
748
749 /* create dummy opaque node */
Michal Vasko0ab974d2021-02-24 13:18:26 +0100750 ret = lyd_new_opaq((struct lyd_node *)parent, snode->module->ctx, snode->name, NULL, NULL, snode->module->name, &dummy);
Michal Vaskobd4db892020-11-23 16:58:20 +0100751 LY_CHECK_GOTO(ret, cleanup);
752
753 /* connect it if needed */
754 if (!parent) {
755 if (first) {
756 lyd_insert_sibling((struct lyd_node *)first, dummy, &tree);
757 } else {
758 assert(!tree);
759 tree = dummy;
760 }
761 }
762
Michal Vaskoa27245c2022-05-02 09:01:35 +0200763 /* explicitly specified accesible tree */
764 if (snode->flags & LYS_CONFIG_W) {
765 xp_opts = LYXP_ACCESS_TREE_CONFIG;
766 } else {
767 xp_opts = LYXP_ACCESS_TREE_ALL;
768 }
769
Michal Vaskobd4db892020-11-23 16:58:20 +0100770 /* evaluate all when */
Michal Vaskoa27245c2022-05-02 09:01:35 +0200771 ret = lyd_validate_node_when(tree, dummy, snode, xp_opts, disabled);
Michal Vaskobd4db892020-11-23 16:58:20 +0100772 if (ret == LY_EINCOMPLETE) {
773 /* all other when must be resolved by now */
774 LOGINT(snode->module->ctx);
775 ret = LY_EINT;
776 goto cleanup;
777 } else if (ret) {
778 /* error */
779 goto cleanup;
780 }
781
782cleanup:
783 lyd_free_tree(dummy);
784 return ret;
785}
786
787/**
Michal Vaskobb844672020-07-03 11:06:12 +0200788 * @brief Validate mandatory node existence.
789 *
790 * @param[in] first First sibling to search in.
Michal Vaskobd4db892020-11-23 16:58:20 +0100791 * @param[in] parent Data parent.
Michal Vaskobb844672020-07-03 11:06:12 +0200792 * @param[in] snode Schema node to validate.
793 * @return LY_ERR value.
794 */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100795static LY_ERR
Michal Vaskobd4db892020-11-23 16:58:20 +0100796lyd_validate_mandatory(const struct lyd_node *first, const struct lyd_node *parent, const struct lysc_node *snode)
Michal Vaskoa3881362020-01-21 15:57:35 +0100797{
Michal Vaskobd4db892020-11-23 16:58:20 +0100798 const struct lysc_when *disabled;
799
Michal Vaskoa3881362020-01-21 15:57:35 +0100800 if (snode->nodetype == LYS_CHOICE) {
Michal Vasko9b368d32020-02-14 13:53:31 +0100801 /* some data of a choice case exist */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100802 if (lys_getnext_data(NULL, first, NULL, snode, NULL)) {
Michal Vasko9b368d32020-02-14 13:53:31 +0100803 return LY_SUCCESS;
804 }
805 } else {
806 assert(snode->nodetype & (LYS_LEAF | LYS_CONTAINER | LYD_NODE_ANY));
Michal Vaskoa3881362020-01-21 15:57:35 +0100807
Michal Vaskob1b5c262020-03-05 14:29:47 +0100808 if (!lyd_find_sibling_val(first, snode, NULL, 0, NULL)) {
Michal Vasko9b368d32020-02-14 13:53:31 +0100809 /* data instance found */
810 return LY_SUCCESS;
Michal Vaskoa3881362020-01-21 15:57:35 +0100811 }
812 }
813
Michal Vaskobd4db892020-11-23 16:58:20 +0100814 disabled = NULL;
815 if (lysc_has_when(snode)) {
816 /* if there are any when conditions, they must be true for a validation error */
817 LY_CHECK_RET(lyd_validate_dummy_when(first, parent, snode, &disabled));
818 }
819
820 if (!disabled) {
821 /* node instance not found */
Michal Vasko538b8952021-02-17 11:27:26 +0100822 if (snode->nodetype == LYS_CHOICE) {
Michal Vaskoe9391c72021-10-05 10:04:56 +0200823 LOGVAL_APPTAG(snode->module->ctx, "missing-choice", LY_VCODE_NOMAND_CHOIC, snode->name);
Michal Vasko538b8952021-02-17 11:27:26 +0100824 } else {
825 LOGVAL(snode->module->ctx, LY_VCODE_NOMAND, snode->name);
826 }
Michal Vaskobd4db892020-11-23 16:58:20 +0100827 return LY_EVALID;
828 }
829
830 return LY_SUCCESS;
Michal Vaskoa3881362020-01-21 15:57:35 +0100831}
832
Michal Vaskobb844672020-07-03 11:06:12 +0200833/**
834 * @brief Validate min/max-elements constraints, if any.
835 *
836 * @param[in] first First sibling to search in.
Michal Vaskobd4db892020-11-23 16:58:20 +0100837 * @param[in] parent Data parent.
Michal Vaskobb844672020-07-03 11:06:12 +0200838 * @param[in] snode Schema node to validate.
839 * @param[in] min Minimum number of elements, 0 for no restriction.
840 * @param[in] max Max number of elements, 0 for no restriction.
841 * @return LY_ERR value.
842 */
Michal Vaskoa3881362020-01-21 15:57:35 +0100843static LY_ERR
Michal Vaskobd4db892020-11-23 16:58:20 +0100844lyd_validate_minmax(const struct lyd_node *first, const struct lyd_node *parent, const struct lysc_node *snode,
845 uint32_t min, uint32_t max)
Michal Vaskoa3881362020-01-21 15:57:35 +0100846{
Michal Vaskoacd83e72020-02-04 14:12:01 +0100847 uint32_t count = 0;
Michal Vasko4c583e82020-07-17 12:16:14 +0200848 struct lyd_node *iter;
Michal Vaskobd4db892020-11-23 16:58:20 +0100849 const struct lysc_when *disabled;
Radek Krejci2efc45b2020-12-22 16:25:44 +0100850 ly_bool invalid_instance = 0;
Michal Vaskoacd83e72020-02-04 14:12:01 +0100851
Michal Vasko9b368d32020-02-14 13:53:31 +0100852 assert(min || max);
853
Michal Vasko4c583e82020-07-17 12:16:14 +0200854 LYD_LIST_FOR_INST(first, snode, iter) {
855 ++count;
Michal Vasko9b368d32020-02-14 13:53:31 +0100856
Michal Vasko4c583e82020-07-17 12:16:14 +0200857 if (min && (count == min)) {
858 /* satisfied */
859 min = 0;
860 if (!max) {
861 /* nothing more to check */
Michal Vasko9b368d32020-02-14 13:53:31 +0100862 break;
863 }
Michal Vaskoacd83e72020-02-04 14:12:01 +0100864 }
Michal Vasko4c583e82020-07-17 12:16:14 +0200865 if (max && (count > max)) {
866 /* not satisifed */
Radek Krejciddace2c2021-01-08 11:30:56 +0100867 LOG_LOCSET(NULL, iter, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100868 invalid_instance = 1;
Michal Vasko4c583e82020-07-17 12:16:14 +0200869 break;
870 }
Michal Vaskoacd83e72020-02-04 14:12:01 +0100871 }
872
Michal Vasko9b368d32020-02-14 13:53:31 +0100873 if (min) {
874 assert(count < min);
Michal Vaskobd4db892020-11-23 16:58:20 +0100875
876 disabled = NULL;
877 if (lysc_has_when(snode)) {
878 /* if there are any when conditions, they must be true for a validation error */
879 LY_CHECK_RET(lyd_validate_dummy_when(first, parent, snode, &disabled));
880 }
881
882 if (!disabled) {
Michal Vaskoe9391c72021-10-05 10:04:56 +0200883 LOGVAL_APPTAG(snode->module->ctx, "too-few-elements", LY_VCODE_NOMIN, snode->name);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100884 goto failure;
Michal Vaskobd4db892020-11-23 16:58:20 +0100885 }
Michal Vaskoacd83e72020-02-04 14:12:01 +0100886 } else if (max && (count > max)) {
Michal Vaskoe9391c72021-10-05 10:04:56 +0200887 LOGVAL_APPTAG(snode->module->ctx, "too-many-elements", LY_VCODE_NOMAX, snode->name);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100888 goto failure;
Michal Vaskoacd83e72020-02-04 14:12:01 +0100889 }
890
Michal Vaskoa3881362020-01-21 15:57:35 +0100891 return LY_SUCCESS;
Radek Krejci2efc45b2020-12-22 16:25:44 +0100892
893failure:
Radek Krejciddace2c2021-01-08 11:30:56 +0100894 LOG_LOCBACK(0, invalid_instance, 0, 0);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100895 return LY_EVALID;
Michal Vaskoa3881362020-01-21 15:57:35 +0100896}
897
Michal Vaskobb844672020-07-03 11:06:12 +0200898/**
899 * @brief Find node referenced by a list unique statement.
900 *
901 * @param[in] uniq_leaf Unique leaf to find.
902 * @param[in] list List instance to use for the search.
903 * @return Found leaf,
904 * @return NULL if no leaf found.
905 */
Michal Vasko14654712020-02-06 08:35:21 +0100906static struct lyd_node *
Michal Vaskobb844672020-07-03 11:06:12 +0200907lyd_val_uniq_find_leaf(const struct lysc_node_leaf *uniq_leaf, const struct lyd_node *list)
Michal Vasko14654712020-02-06 08:35:21 +0100908{
Michal Vasko9b368d32020-02-14 13:53:31 +0100909 struct lyd_node *node;
910 const struct lysc_node *iter;
911 size_t depth = 0, i;
Michal Vasko14654712020-02-06 08:35:21 +0100912
Michal Vasko9b368d32020-02-14 13:53:31 +0100913 /* get leaf depth */
Michal Vasko14ed9cd2021-01-28 14:16:25 +0100914 for (iter = &uniq_leaf->node; iter && (iter != list->schema); iter = lysc_data_parent(iter)) {
Michal Vasko62ed12d2020-05-21 10:08:25 +0200915 ++depth;
Michal Vasko14654712020-02-06 08:35:21 +0100916 }
Michal Vasko9b368d32020-02-14 13:53:31 +0100917
Michal Vaskobb844672020-07-03 11:06:12 +0200918 node = (struct lyd_node *)list;
Michal Vasko9b368d32020-02-14 13:53:31 +0100919 while (node && depth) {
920 /* find schema node with this depth */
Michal Vasko14ed9cd2021-01-28 14:16:25 +0100921 for (i = depth - 1, iter = &uniq_leaf->node; i; iter = lysc_data_parent(iter)) {
Michal Vasko62ed12d2020-05-21 10:08:25 +0200922 --i;
Michal Vasko9b368d32020-02-14 13:53:31 +0100923 }
924
925 /* find iter instance in children */
926 assert(iter->nodetype & (LYS_CONTAINER | LYS_LEAF));
Radek Krejcia1c1e542020-09-29 16:06:52 +0200927 lyd_find_sibling_val(lyd_child(node), iter, NULL, 0, &node);
Michal Vasko9b368d32020-02-14 13:53:31 +0100928 --depth;
929 }
930
Michal Vasko14654712020-02-06 08:35:21 +0100931 return node;
932}
933
Michal Vaskobb844672020-07-03 11:06:12 +0200934/**
935 * @brief Callback for comparing 2 list unique leaf values.
936 *
Michal Vasko62524a92021-02-26 10:08:50 +0100937 * Implementation of ::lyht_value_equal_cb.
Radek Krejci857189e2020-09-01 13:26:36 +0200938 *
Michal Vaskobb844672020-07-03 11:06:12 +0200939 * @param[in] cb_data 0 to compare all uniques, n to compare only n-th unique.
Michal Vasko14654712020-02-06 08:35:21 +0100940 */
Radek Krejci857189e2020-09-01 13:26:36 +0200941static ly_bool
942lyd_val_uniq_list_equal(void *val1_p, void *val2_p, ly_bool UNUSED(mod), void *cb_data)
Michal Vasko14654712020-02-06 08:35:21 +0100943{
944 struct ly_ctx *ctx;
945 struct lysc_node_list *slist;
946 struct lyd_node *diter, *first, *second;
947 struct lyd_value *val1, *val2;
948 char *path1, *path2, *uniq_str, *ptr;
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200949 LY_ARRAY_COUNT_TYPE u, v, action;
Michal Vasko14654712020-02-06 08:35:21 +0100950
951 assert(val1_p && val2_p);
952
953 first = *((struct lyd_node **)val1_p);
954 second = *((struct lyd_node **)val2_p);
Michal Vasko41e630c2021-07-23 12:47:18 +0200955 action = (uintptr_t)cb_data;
Michal Vasko14654712020-02-06 08:35:21 +0100956
957 assert(first && (first->schema->nodetype == LYS_LIST));
958 assert(second && (second->schema == first->schema));
959
960 ctx = first->schema->module->ctx;
961
962 slist = (struct lysc_node_list *)first->schema;
963
964 /* compare unique leaves */
965 if (action > 0) {
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200966 u = action - 1;
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200967 if (u < LY_ARRAY_COUNT(slist->uniques)) {
Michal Vasko14654712020-02-06 08:35:21 +0100968 goto uniquecheck;
969 }
970 }
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200971 LY_ARRAY_FOR(slist->uniques, u) {
Michal Vasko14654712020-02-06 08:35:21 +0100972uniquecheck:
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200973 LY_ARRAY_FOR(slist->uniques[u], v) {
Michal Vasko14654712020-02-06 08:35:21 +0100974 /* first */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200975 diter = lyd_val_uniq_find_leaf(slist->uniques[u][v], first);
Michal Vasko14654712020-02-06 08:35:21 +0100976 if (diter) {
977 val1 = &((struct lyd_node_term *)diter)->value;
978 } else {
979 /* use default value */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200980 val1 = slist->uniques[u][v]->dflt;
Michal Vasko14654712020-02-06 08:35:21 +0100981 }
982
983 /* second */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200984 diter = lyd_val_uniq_find_leaf(slist->uniques[u][v], second);
Michal Vasko14654712020-02-06 08:35:21 +0100985 if (diter) {
986 val2 = &((struct lyd_node_term *)diter)->value;
987 } else {
988 /* use default value */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200989 val2 = slist->uniques[u][v]->dflt;
Michal Vasko14654712020-02-06 08:35:21 +0100990 }
991
992 if (!val1 || !val2 || val1->realtype->plugin->compare(val1, val2)) {
993 /* values differ or either one is not set */
994 break;
995 }
996 }
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200997 if (v && (v == LY_ARRAY_COUNT(slist->uniques[u]))) {
Michal Vasko14654712020-02-06 08:35:21 +0100998 /* all unique leafs are the same in this set, create this nice error */
Radek Krejci635d2b82021-01-04 11:26:51 +0100999 path1 = lyd_path(first, LYD_PATH_STD, NULL, 0);
1000 path2 = lyd_path(second, LYD_PATH_STD, NULL, 0);
Michal Vasko14654712020-02-06 08:35:21 +01001001
1002 /* use buffer to rebuild the unique string */
Radek Krejcif13b87b2020-12-01 22:02:17 +01001003#define UNIQ_BUF_SIZE 1024
1004 uniq_str = malloc(UNIQ_BUF_SIZE);
Michal Vasko14654712020-02-06 08:35:21 +01001005 uniq_str[0] = '\0';
1006 ptr = uniq_str;
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001007 LY_ARRAY_FOR(slist->uniques[u], v) {
1008 if (v) {
Michal Vasko14654712020-02-06 08:35:21 +01001009 strcpy(ptr, " ");
1010 ++ptr;
1011 }
Michal Vasko14ed9cd2021-01-28 14:16:25 +01001012 ptr = lysc_path_until((struct lysc_node *)slist->uniques[u][v], &slist->node, LYSC_PATH_LOG,
Radek Krejcif13b87b2020-12-01 22:02:17 +01001013 ptr, UNIQ_BUF_SIZE - (ptr - uniq_str));
Michal Vasko14654712020-02-06 08:35:21 +01001014 if (!ptr) {
1015 /* path will be incomplete, whatever */
1016 break;
1017 }
1018
1019 ptr += strlen(ptr);
1020 }
Radek Krejciddace2c2021-01-08 11:30:56 +01001021 LOG_LOCSET(NULL, second, NULL, NULL);
Michal Vaskoe9391c72021-10-05 10:04:56 +02001022 LOGVAL_APPTAG(ctx, "data-not-unique", LY_VCODE_NOUNIQ, uniq_str, path1, path2);
Radek Krejciddace2c2021-01-08 11:30:56 +01001023 LOG_LOCBACK(0, 1, 0, 0);
Michal Vasko14654712020-02-06 08:35:21 +01001024
1025 free(path1);
1026 free(path2);
1027 free(uniq_str);
Radek Krejcif13b87b2020-12-01 22:02:17 +01001028#undef UNIQ_BUF_SIZE
1029
Michal Vasko14654712020-02-06 08:35:21 +01001030 return 1;
1031 }
1032
1033 if (action > 0) {
1034 /* done */
1035 return 0;
1036 }
1037 }
1038
1039 return 0;
1040}
1041
Michal Vaskobb844672020-07-03 11:06:12 +02001042/**
1043 * @brief Validate list unique leaves.
1044 *
1045 * @param[in] first First sibling to search in.
1046 * @param[in] snode Schema node to validate.
1047 * @param[in] uniques List unique arrays to validate.
1048 * @return LY_ERR value.
1049 */
Michal Vaskoa3881362020-01-21 15:57:35 +01001050static LY_ERR
Michal Vaskobb844672020-07-03 11:06:12 +02001051lyd_validate_unique(const struct lyd_node *first, const struct lysc_node *snode, const struct lysc_node_leaf ***uniques)
Michal Vaskoa3881362020-01-21 15:57:35 +01001052{
Michal Vaskob1b5c262020-03-05 14:29:47 +01001053 const struct lyd_node *diter;
Michal Vasko14654712020-02-06 08:35:21 +01001054 struct ly_set *set;
Michal Vaskofd69e1d2020-07-03 11:57:17 +02001055 LY_ARRAY_COUNT_TYPE u, v, x = 0;
Michal Vasko14654712020-02-06 08:35:21 +01001056 LY_ERR ret = LY_SUCCESS;
Michal Vasko626196f2022-08-05 12:49:52 +02001057 uint32_t hash, i;
Radek Krejci813c02d2021-04-26 10:29:19 +02001058 size_t key_len;
1059 ly_bool dyn;
1060 const void *hash_key;
Michal Vasko41e630c2021-07-23 12:47:18 +02001061 void *cb_data;
Michal Vasko14654712020-02-06 08:35:21 +01001062 struct hash_table **uniqtables = NULL;
1063 struct lyd_value *val;
1064 struct ly_ctx *ctx = snode->module->ctx;
1065
1066 assert(uniques);
1067
1068 /* get all list instances */
Radek Krejciba03a5a2020-08-27 14:40:41 +02001069 LY_CHECK_RET(ly_set_new(&set));
Michal Vaskob1b5c262020-03-05 14:29:47 +01001070 LY_LIST_FOR(first, diter) {
Michal Vasko9b368d32020-02-14 13:53:31 +01001071 if (diter->schema == snode) {
Radek Krejci3d92e442020-10-12 12:48:13 +02001072 ret = ly_set_add(set, (void *)diter, 1, NULL);
Michal Vaskob0099a92020-08-31 14:55:23 +02001073 LY_CHECK_GOTO(ret, cleanup);
Michal Vasko9b368d32020-02-14 13:53:31 +01001074 }
1075 }
Michal Vasko14654712020-02-06 08:35:21 +01001076
1077 if (set->count == 2) {
1078 /* simple comparison */
1079 if (lyd_val_uniq_list_equal(&set->objs[0], &set->objs[1], 0, (void *)0)) {
1080 /* instance duplication */
1081 ret = LY_EVALID;
1082 goto cleanup;
1083 }
1084 } else if (set->count > 2) {
1085 /* use hashes for comparison */
Michal Vaskofd69e1d2020-07-03 11:57:17 +02001086 uniqtables = malloc(LY_ARRAY_COUNT(uniques) * sizeof *uniqtables);
Michal Vasko14654712020-02-06 08:35:21 +01001087 LY_CHECK_ERR_GOTO(!uniqtables, LOGMEM(ctx); ret = LY_EMEM, cleanup);
Michal Vaskofd69e1d2020-07-03 11:57:17 +02001088 x = LY_ARRAY_COUNT(uniques);
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001089 for (v = 0; v < x; v++) {
Michal Vasko41e630c2021-07-23 12:47:18 +02001090 cb_data = (void *)(uintptr_t)(v + 1L);
Michal Vasko626196f2022-08-05 12:49:52 +02001091 uniqtables[v] = lyht_new(lyht_get_fixed_size(set->count), sizeof(struct lyd_node *),
1092 lyd_val_uniq_list_equal, cb_data, 0);
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001093 LY_CHECK_ERR_GOTO(!uniqtables[v], LOGMEM(ctx); ret = LY_EMEM, cleanup);
Michal Vasko14654712020-02-06 08:35:21 +01001094 }
1095
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001096 for (i = 0; i < set->count; i++) {
Michal Vasko14654712020-02-06 08:35:21 +01001097 /* loop for unique - get the hash for the instances */
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001098 for (u = 0; u < x; u++) {
Michal Vasko14654712020-02-06 08:35:21 +01001099 val = NULL;
Michal Vaskofd69e1d2020-07-03 11:57:17 +02001100 for (v = hash = 0; v < LY_ARRAY_COUNT(uniques[u]); v++) {
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001101 diter = lyd_val_uniq_find_leaf(uniques[u][v], set->objs[i]);
Michal Vasko14654712020-02-06 08:35:21 +01001102 if (diter) {
1103 val = &((struct lyd_node_term *)diter)->value;
1104 } else {
1105 /* use default value */
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001106 val = uniques[u][v]->dflt;
Michal Vasko14654712020-02-06 08:35:21 +01001107 }
1108 if (!val) {
1109 /* unique item not present nor has default value */
1110 break;
1111 }
1112
Radek Krejci813c02d2021-04-26 10:29:19 +02001113 /* get hash key */
Michal Vaskodcfac2c2021-05-10 11:36:37 +02001114 hash_key = val->realtype->plugin->print(NULL, val, LY_VALUE_LYB, NULL, &dyn, &key_len);
Radek Krejci813c02d2021-04-26 10:29:19 +02001115 hash = dict_hash_multi(hash, hash_key, key_len);
1116 if (dyn) {
1117 free((void *)hash_key);
Michal Vasko14654712020-02-06 08:35:21 +01001118 }
1119 }
1120 if (!val) {
1121 /* skip this list instance since its unique set is incomplete */
1122 continue;
1123 }
1124
1125 /* finish the hash value */
1126 hash = dict_hash_multi(hash, NULL, 0);
1127
1128 /* insert into the hashtable */
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001129 ret = lyht_insert(uniqtables[u], &set->objs[i], hash, NULL);
Michal Vasko14654712020-02-06 08:35:21 +01001130 if (ret == LY_EEXIST) {
1131 /* instance duplication */
1132 ret = LY_EVALID;
1133 }
1134 LY_CHECK_GOTO(ret != LY_SUCCESS, cleanup);
1135 }
1136 }
1137 }
1138
1139cleanup:
1140 ly_set_free(set, NULL);
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001141 for (v = 0; v < x; v++) {
1142 if (!uniqtables[v]) {
Michal Vasko14654712020-02-06 08:35:21 +01001143 /* failed when allocating uniquetables[j], following j are not allocated */
1144 break;
1145 }
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001146 lyht_free(uniqtables[v]);
Michal Vasko14654712020-02-06 08:35:21 +01001147 }
1148 free(uniqtables);
1149
1150 return ret;
Michal Vaskoa3881362020-01-21 15:57:35 +01001151}
1152
Michal Vaskobb844672020-07-03 11:06:12 +02001153/**
1154 * @brief Validate data siblings based on generic schema node restrictions, recursively for schema-only nodes.
1155 *
1156 * @param[in] first First sibling to search in.
Michal Vaskobd4db892020-11-23 16:58:20 +01001157 * @param[in] parent Data parent.
Michal Vaskobb844672020-07-03 11:06:12 +02001158 * @param[in] sparent Schema parent of the nodes to check.
1159 * @param[in] mod Module of the nodes to check.
1160 * @param[in] val_opts Validation options, see @ref datavalidationoptions.
Michal Vaskoe0665742021-02-11 11:08:44 +01001161 * @param[in] int_opts Internal parser options.
Michal Vaskobb844672020-07-03 11:06:12 +02001162 * @return LY_ERR value.
1163 */
Michal Vaskoa3881362020-01-21 15:57:35 +01001164static LY_ERR
Michal Vaskobd4db892020-11-23 16:58:20 +01001165lyd_validate_siblings_schema_r(const struct lyd_node *first, const struct lyd_node *parent,
Michal Vaskoe0665742021-02-11 11:08:44 +01001166 const struct lysc_node *sparent, const struct lysc_module *mod, uint32_t val_opts, uint32_t int_opts)
Michal Vaskocde73ac2019-11-14 16:10:27 +01001167{
Radek Krejci2efc45b2020-12-22 16:25:44 +01001168 LY_ERR ret = LY_SUCCESS;
Michal Vasko6c16cda2021-02-04 11:05:52 +01001169 const struct lysc_node *snode = NULL, *scase;
Michal Vaskoa3881362020-01-21 15:57:35 +01001170 struct lysc_node_list *slist;
Michal Vaskod8958df2020-08-05 13:27:36 +02001171 struct lysc_node_leaflist *sllist;
Radek Krejci1deb5be2020-08-26 16:43:36 +02001172 uint32_t getnext_opts;
Michal Vaskocb7526d2020-03-30 15:08:26 +02001173
Michal Vaskoe0665742021-02-11 11:08:44 +01001174 getnext_opts = LYS_GETNEXT_WITHCHOICE | (int_opts & LYD_INTOPT_REPLY ? LYS_GETNEXT_OUTPUT : 0);
Michal Vaskocde73ac2019-11-14 16:10:27 +01001175
Michal Vaskoa3881362020-01-21 15:57:35 +01001176 /* disabled nodes are skipped by lys_getnext */
Michal Vaskocb7526d2020-03-30 15:08:26 +02001177 while ((snode = lys_getnext(snode, sparent, mod, getnext_opts))) {
Radek Krejci7931b192020-06-25 17:05:03 +02001178 if ((val_opts & LYD_VALIDATE_NO_STATE) && (snode->flags & LYS_CONFIG_R)) {
Michal Vaskoe75ecfd2020-03-06 14:12:28 +01001179 continue;
1180 }
1181
Radek Krejciddace2c2021-01-08 11:30:56 +01001182 LOG_LOCSET(snode, NULL, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +01001183
Michal Vaskoa3881362020-01-21 15:57:35 +01001184 /* check min-elements and max-elements */
Michal Vaskod8958df2020-08-05 13:27:36 +02001185 if (snode->nodetype == LYS_LIST) {
Michal Vaskoa3881362020-01-21 15:57:35 +01001186 slist = (struct lysc_node_list *)snode;
1187 if (slist->min || slist->max) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001188 ret = lyd_validate_minmax(first, parent, snode, slist->min, slist->max);
1189 LY_CHECK_GOTO(ret, error);
Michal Vaskoa3881362020-01-21 15:57:35 +01001190 }
Michal Vaskod8958df2020-08-05 13:27:36 +02001191 } else if (snode->nodetype == LYS_LEAFLIST) {
1192 sllist = (struct lysc_node_leaflist *)snode;
1193 if (sllist->min || sllist->max) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001194 ret = lyd_validate_minmax(first, parent, snode, sllist->min, sllist->max);
1195 LY_CHECK_GOTO(ret, error);
Michal Vaskod8958df2020-08-05 13:27:36 +02001196 }
Michal Vaskoacd83e72020-02-04 14:12:01 +01001197
Michal Vaskoacd83e72020-02-04 14:12:01 +01001198 } else if (snode->flags & LYS_MAND_TRUE) {
Radek Krejcif6a11002020-08-21 13:29:07 +02001199 /* check generic mandatory existence */
Radek Krejci2efc45b2020-12-22 16:25:44 +01001200 ret = lyd_validate_mandatory(first, parent, snode);
1201 LY_CHECK_GOTO(ret, error);
Michal Vaskoa3881362020-01-21 15:57:35 +01001202 }
1203
1204 /* check unique */
1205 if (snode->nodetype == LYS_LIST) {
1206 slist = (struct lysc_node_list *)snode;
1207 if (slist->uniques) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001208 ret = lyd_validate_unique(first, snode, (const struct lysc_node_leaf ***)slist->uniques);
1209 LY_CHECK_GOTO(ret, error);
Michal Vaskoa3881362020-01-21 15:57:35 +01001210 }
1211 }
1212
Michal Vasko6c16cda2021-02-04 11:05:52 +01001213 if (snode->nodetype == LYS_CHOICE) {
1214 /* find the existing case, if any */
1215 LY_LIST_FOR(lysc_node_child(snode), scase) {
1216 if (lys_getnext_data(NULL, first, NULL, scase, NULL)) {
1217 /* validate only this case */
Michal Vaskoe0665742021-02-11 11:08:44 +01001218 ret = lyd_validate_siblings_schema_r(first, parent, scase, mod, val_opts, int_opts);
Michal Vasko6c16cda2021-02-04 11:05:52 +01001219 LY_CHECK_GOTO(ret, error);
1220 break;
1221 }
1222 }
Michal Vaskoacd83e72020-02-04 14:12:01 +01001223 }
Radek Krejci2efc45b2020-12-22 16:25:44 +01001224
Radek Krejciddace2c2021-01-08 11:30:56 +01001225 LOG_LOCBACK(1, 0, 0, 0);
Michal Vaskocde73ac2019-11-14 16:10:27 +01001226 }
1227
Michal Vaskoacd83e72020-02-04 14:12:01 +01001228 return LY_SUCCESS;
Radek Krejci2efc45b2020-12-22 16:25:44 +01001229
1230error:
Radek Krejciddace2c2021-01-08 11:30:56 +01001231 LOG_LOCBACK(1, 0, 0, 0);
Radek Krejci2efc45b2020-12-22 16:25:44 +01001232 return ret;
Michal Vaskoacd83e72020-02-04 14:12:01 +01001233}
1234
Michal Vaskobb844672020-07-03 11:06:12 +02001235/**
1236 * @brief Validate obsolete nodes, only warnings are printed.
1237 *
1238 * @param[in] node Node to check.
1239 */
Michal Vaskoe75ecfd2020-03-06 14:12:28 +01001240static void
1241lyd_validate_obsolete(const struct lyd_node *node)
1242{
1243 const struct lysc_node *snode;
1244
1245 snode = node->schema;
1246 do {
1247 if (snode->flags & LYS_STATUS_OBSLT) {
1248 LOGWRN(snode->module->ctx, "Obsolete schema node \"%s\" instantiated in data.", snode->name);
1249 break;
1250 }
1251
1252 snode = snode->parent;
1253 } while (snode && (snode->nodetype & (LYS_CHOICE | LYS_CASE)));
1254}
1255
Michal Vaskobb844672020-07-03 11:06:12 +02001256/**
1257 * @brief Validate must conditions of a data node.
1258 *
1259 * @param[in] node Node to validate.
Michal Vaskoe0665742021-02-11 11:08:44 +01001260 * @param[in] int_opts Internal parser options.
Michal Vasko906bafa2022-04-22 12:28:55 +02001261 * @param[in] xpath_options Additional XPath options to use.
Michal Vaskobb844672020-07-03 11:06:12 +02001262 * @return LY_ERR value.
1263 */
Michal Vaskocc048b22020-03-27 15:52:38 +01001264static LY_ERR
Michal Vasko906bafa2022-04-22 12:28:55 +02001265lyd_validate_must(const struct lyd_node *node, uint32_t int_opts, uint32_t xpath_options)
Michal Vaskocc048b22020-03-27 15:52:38 +01001266{
Michal Vaskoa1db2342021-07-19 12:23:23 +02001267 LY_ERR ret;
Michal Vaskocc048b22020-03-27 15:52:38 +01001268 struct lyxp_set xp_set;
1269 struct lysc_must *musts;
1270 const struct lyd_node *tree;
Radek Krejci9a3823e2021-01-27 20:26:46 +01001271 const struct lysc_node *schema;
Michal Vaskoe9391c72021-10-05 10:04:56 +02001272 const char *emsg, *eapptag;
Michal Vaskofd69e1d2020-07-03 11:57:17 +02001273 LY_ARRAY_COUNT_TYPE u;
Michal Vaskocc048b22020-03-27 15:52:38 +01001274
Michal Vaskoe0665742021-02-11 11:08:44 +01001275 assert((int_opts & (LYD_INTOPT_RPC | LYD_INTOPT_REPLY)) != (LYD_INTOPT_RPC | LYD_INTOPT_REPLY));
1276 assert((int_opts & (LYD_INTOPT_ACTION | LYD_INTOPT_REPLY)) != (LYD_INTOPT_ACTION | LYD_INTOPT_REPLY));
1277
Radek Krejci9a3823e2021-01-27 20:26:46 +01001278 if (node->schema->nodetype & (LYS_ACTION | LYS_RPC)) {
Michal Vaskoe0665742021-02-11 11:08:44 +01001279 if (int_opts & (LYD_INTOPT_RPC | LYD_INTOPT_ACTION)) {
Radek Krejci9a3823e2021-01-27 20:26:46 +01001280 schema = &((struct lysc_node_action *)node->schema)->input.node;
Michal Vaskoe0665742021-02-11 11:08:44 +01001281 } else if (int_opts & LYD_INTOPT_REPLY) {
Radek Krejci9a3823e2021-01-27 20:26:46 +01001282 schema = &((struct lysc_node_action *)node->schema)->output.node;
Michal Vaskocb7526d2020-03-30 15:08:26 +02001283 } else {
Michal Vaskoa1db2342021-07-19 12:23:23 +02001284 LOGINT_RET(LYD_CTX(node));
Michal Vaskocb7526d2020-03-30 15:08:26 +02001285 }
Radek Krejci9a3823e2021-01-27 20:26:46 +01001286 } else {
1287 schema = node->schema;
Michal Vaskocc048b22020-03-27 15:52:38 +01001288 }
Radek Krejci9a3823e2021-01-27 20:26:46 +01001289 musts = lysc_node_musts(schema);
Michal Vaskocc048b22020-03-27 15:52:38 +01001290 if (!musts) {
1291 /* no must to evaluate */
1292 return LY_SUCCESS;
1293 }
1294
1295 /* find first top-level node */
Michal Vasko9e685082021-01-29 14:49:09 +01001296 for (tree = node; tree->parent; tree = lyd_parent(tree)) {}
Michal Vaskof9221e62021-02-04 12:10:14 +01001297 tree = lyd_first_sibling(tree);
Michal Vaskocc048b22020-03-27 15:52:38 +01001298
1299 LY_ARRAY_FOR(musts, u) {
1300 memset(&xp_set, 0, sizeof xp_set);
1301
1302 /* evaluate must */
Michal Vaskoa1db2342021-07-19 12:23:23 +02001303 ret = lyxp_eval(LYD_CTX(node), musts[u].cond, node->schema->module, LY_VALUE_SCHEMA_RESOLVED,
Michal Vaskoa3e92bc2022-07-29 14:56:23 +02001304 musts[u].prefixes, node, node, tree, NULL, &xp_set, LYXP_SCHEMA | xpath_options);
Michal Vaskoa1db2342021-07-19 12:23:23 +02001305 if (ret == LY_EINCOMPLETE) {
1306 LOGINT_RET(LYD_CTX(node));
1307 } else if (ret) {
1308 return ret;
1309 }
Michal Vaskocc048b22020-03-27 15:52:38 +01001310
1311 /* check the result */
1312 lyxp_set_cast(&xp_set, LYXP_SET_BOOLEAN);
Michal Vasko004d3152020-06-11 19:59:22 +02001313 if (!xp_set.val.bln) {
Michal Vaskoe9391c72021-10-05 10:04:56 +02001314 /* use specific error information */
1315 emsg = musts[u].emsg;
1316 eapptag = musts[u].eapptag ? musts[u].eapptag : "must-violation";
1317 if (emsg) {
1318 LOGVAL_APPTAG(LYD_CTX(node), eapptag, LYVE_DATA, "%s", emsg);
1319 } else {
1320 LOGVAL_APPTAG(LYD_CTX(node), eapptag, LY_VCODE_NOMUST, musts[u].cond->expr);
1321 }
Michal Vaskocc048b22020-03-27 15:52:38 +01001322 return LY_EVALID;
1323 }
1324 }
1325
1326 return LY_SUCCESS;
1327}
1328
Michal Vaskoe0665742021-02-11 11:08:44 +01001329/**
1330 * @brief Perform all remaining validation tasks, the data tree must be final when calling this function.
1331 *
1332 * @param[in] first First sibling.
1333 * @param[in] parent Data parent.
1334 * @param[in] sparent Schema parent of the siblings, NULL for top-level siblings.
1335 * @param[in] mod Module of the siblings, NULL for nested siblings.
1336 * @param[in] val_opts Validation options (@ref datavalidationoptions).
1337 * @param[in] int_opts Internal parser options.
Michal Vasko906bafa2022-04-22 12:28:55 +02001338 * @param[in] must_xp_opts Additional XPath options to use for evaluating "must".
Michal Vaskoe0665742021-02-11 11:08:44 +01001339 * @return LY_ERR value.
1340 */
1341static LY_ERR
Michal Vaskobd4db892020-11-23 16:58:20 +01001342lyd_validate_final_r(struct lyd_node *first, const struct lyd_node *parent, const struct lysc_node *sparent,
Michal Vasko906bafa2022-04-22 12:28:55 +02001343 const struct lys_module *mod, uint32_t val_opts, uint32_t int_opts, uint32_t must_xp_opts)
Michal Vaskoacd83e72020-02-04 14:12:01 +01001344{
Michal Vasko22e8f1f2021-12-02 09:26:06 +01001345 LY_ERR r;
1346 const char *innode;
Radek Krejci7f769d72020-07-11 23:13:56 +02001347 struct lyd_node *next = NULL, *node;
Michal Vaskoacd83e72020-02-04 14:12:01 +01001348
Michal Vasko14654712020-02-06 08:35:21 +01001349 /* validate all restrictions of nodes themselves */
Michal Vaskob1b5c262020-03-05 14:29:47 +01001350 LY_LIST_FOR_SAFE(first, next, node) {
Michal Vasko61ad1ff2022-02-10 15:48:39 +01001351 if (node->flags & LYD_EXT) {
1352 /* ext instance data should have already been validated */
1353 continue;
1354 }
1355
Radek Krejciddace2c2021-01-08 11:30:56 +01001356 LOG_LOCSET(node->schema, node, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +01001357
Michal Vaskoa8c61722020-03-27 16:59:32 +01001358 /* opaque data */
1359 if (!node->schema) {
Michal Vaskoac6f4be2022-05-02 10:16:50 +02001360 r = lyd_parse_opaq_error(node);
Michal Vasko6344e7a2022-05-10 10:08:53 +02001361 LOG_LOCBACK(0, 1, 0, 0);
Michal Vaskoac6f4be2022-05-02 10:16:50 +02001362 return r;
Michal Vaskoa8c61722020-03-27 16:59:32 +01001363 }
1364
Michal Vasko6344e7a2022-05-10 10:08:53 +02001365 if (!node->parent && mod && (lyd_owner_module(node) != mod)) {
1366 /* all top-level data from this module checked */
1367 LOG_LOCBACK(1, 1, 0, 0);
1368 break;
1369 }
1370
Michal Vasko8d289f92021-12-02 10:11:00 +01001371 /* no state/input/output/op data */
Michal Vasko22e8f1f2021-12-02 09:26:06 +01001372 innode = NULL;
Radek Krejci7931b192020-06-25 17:05:03 +02001373 if ((val_opts & LYD_VALIDATE_NO_STATE) && (node->schema->flags & LYS_CONFIG_R)) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001374 innode = "state";
Michal Vaskoe0665742021-02-11 11:08:44 +01001375 } else if ((int_opts & (LYD_INTOPT_RPC | LYD_INTOPT_ACTION)) && (node->schema->flags & LYS_IS_OUTPUT)) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001376 innode = "output";
Michal Vaskoe0665742021-02-11 11:08:44 +01001377 } else if ((int_opts & LYD_INTOPT_REPLY) && (node->schema->flags & LYS_IS_INPUT)) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001378 innode = "input";
Michal Vasko8d289f92021-12-02 10:11:00 +01001379 } else if (!(int_opts & (LYD_INTOPT_RPC | LYD_INTOPT_REPLY)) && (node->schema->nodetype == LYS_RPC)) {
1380 innode = "rpc";
1381 } else if (!(int_opts & (LYD_INTOPT_ACTION | LYD_INTOPT_REPLY)) && (node->schema->nodetype == LYS_ACTION)) {
1382 innode = "action";
1383 } else if (!(int_opts & LYD_INTOPT_NOTIF) && (node->schema->nodetype == LYS_NOTIF)) {
1384 innode = "notification";
Michal Vasko22e8f1f2021-12-02 09:26:06 +01001385 }
1386 if (innode) {
1387 LOGVAL(LYD_CTX(node), LY_VCODE_UNEXPNODE, innode, node->schema->name);
1388 LOG_LOCBACK(1, 1, 0, 0);
1389 return LY_EVALID;
Michal Vasko5b37a352020-03-06 13:38:33 +01001390 }
1391
Michal Vaskoe75ecfd2020-03-06 14:12:28 +01001392 /* obsolete data */
1393 lyd_validate_obsolete(node);
1394
Michal Vaskocc048b22020-03-27 15:52:38 +01001395 /* node's musts */
Michal Vasko906bafa2022-04-22 12:28:55 +02001396 if ((r = lyd_validate_must(node, int_opts, must_xp_opts))) {
Michal Vasko22e8f1f2021-12-02 09:26:06 +01001397 LOG_LOCBACK(1, 1, 0, 0);
1398 return r;
1399 }
Michal Vaskocc048b22020-03-27 15:52:38 +01001400
Michal Vasko53d97a12020-11-05 17:39:10 +01001401 /* node value was checked by plugins */
Radek Krejci2efc45b2020-12-22 16:25:44 +01001402
Michal Vasko22e8f1f2021-12-02 09:26:06 +01001403 /* next iter */
Radek Krejciddace2c2021-01-08 11:30:56 +01001404 LOG_LOCBACK(1, 1, 0, 0);
Michal Vasko14654712020-02-06 08:35:21 +01001405 }
Michal Vaskocde73ac2019-11-14 16:10:27 +01001406
Michal Vasko14654712020-02-06 08:35:21 +01001407 /* validate schema-based restrictions */
Michal Vaskoe0665742021-02-11 11:08:44 +01001408 LY_CHECK_RET(lyd_validate_siblings_schema_r(first, parent, sparent, mod ? mod->compiled : NULL, val_opts, int_opts));
Michal Vasko14654712020-02-06 08:35:21 +01001409
Michal Vaskob1b5c262020-03-05 14:29:47 +01001410 LY_LIST_FOR(first, node) {
Michal Vasko19034e22021-07-19 12:24:14 +02001411 if (!node->parent && mod && (lyd_owner_module(node) != mod)) {
1412 /* all top-level data from this module checked */
1413 break;
1414 }
1415
Michal Vasko14654712020-02-06 08:35:21 +01001416 /* validate all children recursively */
Michal Vasko906bafa2022-04-22 12:28:55 +02001417 LY_CHECK_RET(lyd_validate_final_r(lyd_child(node), node, node->schema, NULL, val_opts, int_opts, must_xp_opts));
Michal Vaskocde73ac2019-11-14 16:10:27 +01001418
Michal Vaskob1b5c262020-03-05 14:29:47 +01001419 /* set default for containers */
aPiecekc5f36a72021-05-18 14:12:31 +02001420 if (node->schema && (node->schema->nodetype == LYS_CONTAINER) && !(node->schema->flags & LYS_PRESENCE)) {
Radek Krejcia1c1e542020-09-29 16:06:52 +02001421 LY_LIST_FOR(lyd_child(node), next) {
Michal Vaskob1b5c262020-03-05 14:29:47 +01001422 if (!(next->flags & LYD_DEFAULT)) {
1423 break;
1424 }
Michal Vaskoa3881362020-01-21 15:57:35 +01001425 }
Michal Vaskob1b5c262020-03-05 14:29:47 +01001426 if (!next) {
1427 node->flags |= LYD_DEFAULT;
1428 }
Michal Vasko9b368d32020-02-14 13:53:31 +01001429 }
1430 }
1431
1432 return LY_SUCCESS;
1433}
1434
Radek Krejci7931b192020-06-25 17:05:03 +02001435/**
Michal Vaskoddd76592022-01-17 13:34:48 +01001436 * @brief Validate extension instance data by storing it in its unres set.
1437 *
1438 * @param[in] sibling First sibling with ::LYD_EXT flag, all the following ones are expected to have it, too.
1439 * @param[in,out] ext_val Set with parsed extension instance data to validate.
1440 * @return LY_ERR value.
1441 */
1442static LY_ERR
1443lyd_validate_nested_ext(struct lyd_node *sibling, struct ly_set *ext_val)
1444{
1445 struct lyd_node *node;
1446 struct lyd_ctx_ext_val *ext_v;
1447 struct lysc_ext_instance *nested_exts, *ext = NULL;
1448 LY_ARRAY_COUNT_TYPE u;
1449
1450 /* check of basic assumptions */
1451 if (!sibling->parent || !sibling->parent->schema) {
1452 LOGINT_RET(LYD_CTX(sibling));
1453 }
1454 LY_LIST_FOR(sibling, node) {
1455 if (!(node->flags & LYD_EXT)) {
1456 LOGINT_RET(LYD_CTX(sibling));
1457 }
1458 }
1459
1460 /* try to find the extension instance */
1461 nested_exts = sibling->parent->schema->exts;
1462 LY_ARRAY_FOR(nested_exts, u) {
1463 if (nested_exts[u].def->plugin->validate) {
1464 if (ext) {
1465 /* more extension instances with validate callback */
1466 LOGINT_RET(LYD_CTX(sibling));
1467 }
1468 ext = &nested_exts[u];
1469 }
1470 }
1471 if (!ext) {
1472 /* no extension instance with validate callback */
1473 LOGINT_RET(LYD_CTX(sibling));
1474 }
1475
1476 /* store for validation */
1477 ext_v = malloc(sizeof *ext_v);
1478 LY_CHECK_ERR_RET(!ext_v, LOGMEM(LYD_CTX(sibling)), LY_EMEM);
1479 ext_v->ext = ext;
1480 ext_v->sibling = sibling;
1481 LY_CHECK_RET(ly_set_add(ext_val, ext_v, 1, NULL));
1482
1483 return LY_SUCCESS;
1484}
1485
Michal Vasko135719f2022-08-25 12:18:17 +02001486LY_ERR
1487lyd_validate_node_ext(struct lyd_node *node, struct ly_set *ext_node)
1488{
1489 struct lyd_ctx_ext_node *ext_n;
1490 struct lysc_ext_instance *exts;
1491 LY_ARRAY_COUNT_TYPE u;
1492
1493 /* try to find a relevant extension instance with node callback */
1494 exts = node->schema->exts;
1495 LY_ARRAY_FOR(exts, u) {
1496 if (exts[u].def->plugin && exts[u].def->plugin->node) {
1497 /* store for validation */
1498 ext_n = malloc(sizeof *ext_n);
1499 LY_CHECK_ERR_RET(!ext_n, LOGMEM(LYD_CTX(node)), LY_EMEM);
1500 ext_n->ext = &exts[u];
1501 ext_n->node = node;
1502 LY_CHECK_RET(ly_set_add(ext_node, ext_n, 1, NULL));
1503 }
1504 }
1505
1506 return LY_SUCCESS;
1507}
1508
Michal Vaskoddd76592022-01-17 13:34:48 +01001509/**
Michal Vaskobb844672020-07-03 11:06:12 +02001510 * @brief Validate the whole data subtree.
1511 *
1512 * @param[in] root Subtree root.
Michal Vaskoe0665742021-02-11 11:08:44 +01001513 * @param[in,out] node_when Set for nodes with when conditions.
Michal Vasko32711382020-12-03 14:14:31 +01001514 * @param[in,out] node_types Set for unres node types.
1515 * @param[in,out] meta_types Set for unres metadata types.
Michal Vasko1a6e6902022-08-26 08:35:09 +02001516 * @param[in,out] ext_node Set with nodes with extensions to validate.
Michal Vaskoddd76592022-01-17 13:34:48 +01001517 * @param[in,out] ext_val Set for parsed extension data to validate.
Michal Vasko29adfbe2020-12-08 17:12:03 +01001518 * @param[in] impl_opts Implicit options, see @ref implicitoptions.
Michal Vasko8104fd42020-07-13 11:09:51 +02001519 * @param[in,out] diff Validation diff.
Michal Vaskobb844672020-07-03 11:06:12 +02001520 * @return LY_ERR value.
Radek Krejci7931b192020-06-25 17:05:03 +02001521 */
Michal Vaskob1b5c262020-03-05 14:29:47 +01001522static LY_ERR
Michal Vaskoddd76592022-01-17 13:34:48 +01001523lyd_validate_subtree(struct lyd_node *root, struct ly_set *node_when, struct ly_set *node_types,
Michal Vasko1a6e6902022-08-26 08:35:09 +02001524 struct ly_set *meta_types, struct ly_set *ext_node, struct ly_set *ext_val, uint32_t impl_opts,
1525 struct lyd_node **diff)
Michal Vaskofea12c62020-03-30 11:00:15 +02001526{
1527 const struct lyd_meta *meta;
Michal Vasko56daf732020-08-10 10:57:18 +02001528 struct lyd_node *node;
Michal Vaskofea12c62020-03-30 11:00:15 +02001529
Michal Vasko56daf732020-08-10 10:57:18 +02001530 LYD_TREE_DFS_BEGIN(root, node) {
Michal Vaskoddd76592022-01-17 13:34:48 +01001531 if (node->flags & LYD_EXT) {
1532 /* validate using the extension instance callback */
1533 return lyd_validate_nested_ext(node, ext_val);
1534 }
1535
Michal Vasko5900da42021-08-04 11:02:43 +02001536 if (!node->schema) {
Michal Vaskoddd76592022-01-17 13:34:48 +01001537 /* do not validate opaque nodes */
aPiecek18a844e2021-08-10 11:06:24 +02001538 goto next_node;
Michal Vasko5900da42021-08-04 11:02:43 +02001539 }
1540
Michal Vasko0275cf62020-11-05 17:40:30 +01001541 LY_LIST_FOR(node->meta, meta) {
Radek Krejci1b2eef82021-02-17 11:17:27 +01001542 if ((*(const struct lysc_type **)meta->annotation->substmts[ANNOTATION_SUBSTMT_TYPE].storage)->plugin->validate) {
Michal Vasko0275cf62020-11-05 17:40:30 +01001543 /* metadata type resolution */
Michal Vasko32711382020-12-03 14:14:31 +01001544 LY_CHECK_RET(ly_set_add(meta_types, (void *)meta, 1, NULL));
Michal Vaskofea12c62020-03-30 11:00:15 +02001545 }
Michal Vasko0275cf62020-11-05 17:40:30 +01001546 }
Michal Vaskofea12c62020-03-30 11:00:15 +02001547
Michal Vasko0275cf62020-11-05 17:40:30 +01001548 if ((node->schema->nodetype & LYD_NODE_TERM) && ((struct lysc_node_leaf *)node->schema)->type->plugin->validate) {
1549 /* node type resolution */
Michal Vasko32711382020-12-03 14:14:31 +01001550 LY_CHECK_RET(ly_set_add(node_types, (void *)node, 1, NULL));
Michal Vasko0275cf62020-11-05 17:40:30 +01001551 } else if (node->schema->nodetype & LYD_NODE_INNER) {
1552 /* new node validation, autodelete */
Michal Vaskoe0665742021-02-11 11:08:44 +01001553 LY_CHECK_RET(lyd_validate_new(lyd_node_child_p(node), node->schema, NULL, diff));
Michal Vaskofea12c62020-03-30 11:00:15 +02001554
Michal Vasko0275cf62020-11-05 17:40:30 +01001555 /* add nested defaults */
Michal Vaskofcbd78f2022-08-26 08:34:15 +02001556 LY_CHECK_RET(lyd_new_implicit_r(node, lyd_node_child_p(node), NULL, NULL, NULL, NULL, NULL, impl_opts, diff));
Michal Vasko0275cf62020-11-05 17:40:30 +01001557 }
Michal Vaskofea12c62020-03-30 11:00:15 +02001558
Michal Vaskof4d67ea2021-03-31 13:53:21 +02001559 if (lysc_has_when(node->schema)) {
Michal Vasko0275cf62020-11-05 17:40:30 +01001560 /* when evaluation */
Michal Vasko32711382020-12-03 14:14:31 +01001561 LY_CHECK_RET(ly_set_add(node_when, (void *)node, 1, NULL));
Michal Vaskofea12c62020-03-30 11:00:15 +02001562 }
1563
Michal Vasko1a6e6902022-08-26 08:35:09 +02001564 /* store for ext instance node validation, if needed */
1565 LY_CHECK_RET(lyd_validate_node_ext(node, ext_node));
1566
aPiecek18a844e2021-08-10 11:06:24 +02001567next_node:
Michal Vasko56daf732020-08-10 10:57:18 +02001568 LYD_TREE_DFS_END(root, node);
Michal Vaskofea12c62020-03-30 11:00:15 +02001569 }
1570
1571 return LY_SUCCESS;
1572}
1573
Michal Vaskoe0665742021-02-11 11:08:44 +01001574LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02001575lyd_validate(struct lyd_node **tree, const struct lys_module *module, const struct ly_ctx *ctx, uint32_t val_opts,
Michal Vaskoddd76592022-01-17 13:34:48 +01001576 ly_bool validate_subtree, struct ly_set *node_when_p, struct ly_set *node_types_p, struct ly_set *meta_types_p,
Michal Vasko135719f2022-08-25 12:18:17 +02001577 struct ly_set *ext_node_p, struct ly_set *ext_val_p, struct lyd_node **diff)
Michal Vaskof03ed032020-03-04 13:31:44 +01001578{
1579 LY_ERR ret = LY_SUCCESS;
Michal Vasko73e47212020-12-03 14:20:16 +01001580 struct lyd_node *first, *next, **first2, *iter;
Michal Vaskob1b5c262020-03-05 14:29:47 +01001581 const struct lys_module *mod;
Michal Vasko135719f2022-08-25 12:18:17 +02001582 struct ly_set node_types = {0}, meta_types = {0}, node_when = {0}, ext_node = {0}, ext_val = {0};
Michal Vaskob1b5c262020-03-05 14:29:47 +01001583 uint32_t i = 0;
Michal Vaskof03ed032020-03-04 13:31:44 +01001584
Michal Vaskoe0665742021-02-11 11:08:44 +01001585 assert(tree && ctx);
Michal Vasko135719f2022-08-25 12:18:17 +02001586 assert((node_when_p && node_types_p && meta_types_p && ext_node_p && ext_val_p) ||
1587 (!node_when_p && !node_types_p && !meta_types_p && !ext_node_p && !ext_val_p));
Michal Vaskoe0665742021-02-11 11:08:44 +01001588
1589 if (!node_when_p) {
1590 node_when_p = &node_when;
1591 node_types_p = &node_types;
1592 meta_types_p = &meta_types;
Michal Vasko135719f2022-08-25 12:18:17 +02001593 ext_node_p = &ext_node;
Michal Vaskoddd76592022-01-17 13:34:48 +01001594 ext_val_p = &ext_val;
Michal Vasko8104fd42020-07-13 11:09:51 +02001595 }
Michal Vaskof03ed032020-03-04 13:31:44 +01001596
Michal Vaskob1b5c262020-03-05 14:29:47 +01001597 next = *tree;
1598 while (1) {
Radek Krejci7931b192020-06-25 17:05:03 +02001599 if (val_opts & LYD_VALIDATE_PRESENT) {
Michal Vaskob1b5c262020-03-05 14:29:47 +01001600 mod = lyd_data_next_module(&next, &first);
1601 } else {
Michal Vasko26e80012020-07-08 10:55:46 +02001602 mod = lyd_mod_next_module(next, module, ctx, &i, &first);
Michal Vaskof03ed032020-03-04 13:31:44 +01001603 }
Michal Vaskob1b5c262020-03-05 14:29:47 +01001604 if (!mod) {
1605 break;
1606 }
Michal Vasko7c4cf1e2020-06-22 10:04:30 +02001607 if (!first || (first == *tree)) {
Michal Vaskob1b5c262020-03-05 14:29:47 +01001608 /* make sure first2 changes are carried to tree */
1609 first2 = tree;
1610 } else {
1611 first2 = &first;
1612 }
1613
1614 /* validate new top-level nodes of this module, autodelete */
Michal Vasko8104fd42020-07-13 11:09:51 +02001615 ret = lyd_validate_new(first2, NULL, mod, diff);
1616 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskob1b5c262020-03-05 14:29:47 +01001617
Radek Krejci7be7b9f2021-02-24 11:46:27 +01001618 /* add all top-level defaults for this module, if going to validate subtree, do not add into unres sets
1619 * (lyd_validate_subtree() adds all the nodes in that case) */
Michal Vaskoddd76592022-01-17 13:34:48 +01001620 ret = lyd_new_implicit_r(NULL, first2, NULL, mod, validate_subtree ? NULL : node_when_p,
Michal Vaskofcbd78f2022-08-26 08:34:15 +02001621 validate_subtree ? NULL : node_types_p, validate_subtree ? NULL : ext_node_p,
1622 (val_opts & LYD_VALIDATE_NO_STATE) ? LYD_IMPLICIT_NO_STATE : 0, diff);
Michal Vasko8104fd42020-07-13 11:09:51 +02001623 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskob1b5c262020-03-05 14:29:47 +01001624
Michal Vaskod3bb12f2020-12-04 14:33:09 +01001625 /* our first module node pointer may no longer be the first */
Michal Vasko598063b2021-07-19 11:39:05 +02001626 first = *first2;
1627 lyd_first_module_sibling(&first, mod);
1628 if (!first || (first == *tree)) {
1629 first2 = tree;
1630 } else {
1631 first2 = &first;
Michal Vaskod3bb12f2020-12-04 14:33:09 +01001632 }
1633
Michal Vaskoe0665742021-02-11 11:08:44 +01001634 if (validate_subtree) {
1635 /* process nested nodes */
1636 LY_LIST_FOR(*first2, iter) {
Michal Vasko0e72b7a2021-07-16 14:53:27 +02001637 if (lyd_owner_module(iter) != mod) {
1638 break;
1639 }
1640
Michal Vasko1a6e6902022-08-26 08:35:09 +02001641 ret = lyd_validate_subtree(iter, node_when_p, node_types_p, meta_types_p, ext_node_p, ext_val_p,
Michal Vaskoe0665742021-02-11 11:08:44 +01001642 (val_opts & LYD_VALIDATE_NO_STATE) ? LYD_IMPLICIT_NO_STATE : 0, diff);
1643 LY_CHECK_GOTO(ret, cleanup);
1644 }
Michal Vaskob1b5c262020-03-05 14:29:47 +01001645 }
1646
1647 /* finish incompletely validated terminal values/attributes and when conditions */
Michal Vasko135719f2022-08-25 12:18:17 +02001648 ret = lyd_validate_unres(first2, mod, LYD_TYPE_DATA_YANG, node_when_p, 0, node_types_p, meta_types_p,
1649 ext_node_p, ext_val_p, val_opts, diff);
Michal Vaskob1b5c262020-03-05 14:29:47 +01001650 LY_CHECK_GOTO(ret, cleanup);
1651
1652 /* perform final validation that assumes the data tree is final */
Michal Vasko906bafa2022-04-22 12:28:55 +02001653 ret = lyd_validate_final_r(*first2, NULL, NULL, mod, val_opts, 0, 0);
Michal Vasko8104fd42020-07-13 11:09:51 +02001654 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskof03ed032020-03-04 13:31:44 +01001655 }
1656
Michal Vaskof03ed032020-03-04 13:31:44 +01001657cleanup:
Michal Vaskoe0665742021-02-11 11:08:44 +01001658 ly_set_erase(&node_when, NULL);
Michal Vasko32711382020-12-03 14:14:31 +01001659 ly_set_erase(&node_types, NULL);
1660 ly_set_erase(&meta_types, NULL);
Michal Vasko135719f2022-08-25 12:18:17 +02001661 ly_set_erase(&ext_node, free);
Michal Vaskoddd76592022-01-17 13:34:48 +01001662 ly_set_erase(&ext_val, free);
Michal Vaskof03ed032020-03-04 13:31:44 +01001663 return ret;
1664}
Michal Vaskob1b5c262020-03-05 14:29:47 +01001665
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001666LIBYANG_API_DEF LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02001667lyd_validate_all(struct lyd_node **tree, const struct ly_ctx *ctx, uint32_t val_opts, struct lyd_node **diff)
Michal Vaskob1b5c262020-03-05 14:29:47 +01001668{
Michal Vaskoe0665742021-02-11 11:08:44 +01001669 LY_CHECK_ARG_RET(NULL, tree, *tree || ctx, LY_EINVAL);
Michal Vasko892f5bf2021-11-24 10:41:05 +01001670 LY_CHECK_CTX_EQUAL_RET(*tree ? LYD_CTX(*tree) : NULL, ctx, LY_EINVAL);
Michal Vaskoe0665742021-02-11 11:08:44 +01001671 if (!ctx) {
1672 ctx = LYD_CTX(*tree);
1673 }
1674 if (diff) {
1675 *diff = NULL;
1676 }
1677
Michal Vasko135719f2022-08-25 12:18:17 +02001678 return lyd_validate(tree, NULL, ctx, val_opts, 1, NULL, NULL, NULL, NULL, NULL, diff);
Michal Vaskob1b5c262020-03-05 14:29:47 +01001679}
1680
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001681LIBYANG_API_DEF LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02001682lyd_validate_module(struct lyd_node **tree, const struct lys_module *module, uint32_t val_opts, struct lyd_node **diff)
Michal Vaskob1b5c262020-03-05 14:29:47 +01001683{
Michal Vaskoe0665742021-02-11 11:08:44 +01001684 LY_CHECK_ARG_RET(NULL, tree, *tree || module, LY_EINVAL);
Michal Vasko892f5bf2021-11-24 10:41:05 +01001685 LY_CHECK_CTX_EQUAL_RET(*tree ? LYD_CTX(*tree) : NULL, module ? module->ctx : NULL, LY_EINVAL);
Michal Vaskoe0665742021-02-11 11:08:44 +01001686 if (diff) {
1687 *diff = NULL;
1688 }
1689
Michal Vasko135719f2022-08-25 12:18:17 +02001690 return lyd_validate(tree, module, (*tree) ? LYD_CTX(*tree) : module->ctx, val_opts, 1, NULL, NULL, NULL, NULL, NULL,
1691 diff);
Michal Vaskob1b5c262020-03-05 14:29:47 +01001692}
Michal Vaskofea12c62020-03-30 11:00:15 +02001693
Michal Vaskobb844672020-07-03 11:06:12 +02001694/**
1695 * @brief Find nodes for merging an operation into data tree for validation.
1696 *
1697 * @param[in] op_tree Full operation data tree.
1698 * @param[in] op_node Operation node itself.
1699 * @param[in] tree Data tree to be merged into.
1700 * @param[out] op_subtree Operation subtree to merge.
Michal Vasko2f03d222020-12-09 18:15:51 +01001701 * @param[out] tree_sibling Data tree sibling to merge next to, is set if @p tree_parent is NULL.
1702 * @param[out] tree_parent Data tree parent to merge into, is set if @p tree_sibling is NULL.
Michal Vaskobb844672020-07-03 11:06:12 +02001703 */
Michal Vaskocb7526d2020-03-30 15:08:26 +02001704static void
Michal Vaskobb844672020-07-03 11:06:12 +02001705lyd_val_op_merge_find(const struct lyd_node *op_tree, const struct lyd_node *op_node, const struct lyd_node *tree,
Michal Vasko2f03d222020-12-09 18:15:51 +01001706 struct lyd_node **op_subtree, struct lyd_node **tree_sibling, struct lyd_node **tree_parent)
Michal Vaskofea12c62020-03-30 11:00:15 +02001707{
Michal Vaskocb7526d2020-03-30 15:08:26 +02001708 const struct lyd_node *tree_iter, *op_iter;
1709 struct lyd_node *match;
Michal Vaskofea12c62020-03-30 11:00:15 +02001710 uint32_t i, cur_depth, op_depth;
Michal Vaskofea12c62020-03-30 11:00:15 +02001711
Michal Vasko2f03d222020-12-09 18:15:51 +01001712 *op_subtree = NULL;
1713 *tree_sibling = NULL;
1714 *tree_parent = NULL;
1715
Michal Vaskocb7526d2020-03-30 15:08:26 +02001716 /* learn op depth (top-level being depth 0) */
Michal Vaskofea12c62020-03-30 11:00:15 +02001717 op_depth = 0;
Michal Vasko9e685082021-01-29 14:49:09 +01001718 for (op_iter = op_node; op_iter != op_tree; op_iter = lyd_parent(op_iter)) {
Michal Vaskofea12c62020-03-30 11:00:15 +02001719 ++op_depth;
1720 }
1721
1722 /* find where to merge op */
1723 tree_iter = tree;
1724 cur_depth = op_depth;
Michal Vasko2f03d222020-12-09 18:15:51 +01001725 while (cur_depth && tree_iter) {
Michal Vaskofea12c62020-03-30 11:00:15 +02001726 /* find op iter in tree */
1727 lyd_find_sibling_first(tree_iter, op_iter, &match);
1728 if (!match) {
1729 break;
1730 }
1731
1732 /* move tree_iter */
Radek Krejcia1c1e542020-09-29 16:06:52 +02001733 tree_iter = lyd_child(match);
Michal Vaskofea12c62020-03-30 11:00:15 +02001734
1735 /* move depth */
1736 --cur_depth;
Michal Vasko2f03d222020-12-09 18:15:51 +01001737
1738 /* find next op parent */
1739 op_iter = op_node;
1740 for (i = 0; i < cur_depth; ++i) {
Michal Vasko9e685082021-01-29 14:49:09 +01001741 op_iter = lyd_parent(op_iter);
Michal Vasko2f03d222020-12-09 18:15:51 +01001742 }
Michal Vaskofea12c62020-03-30 11:00:15 +02001743 }
1744
Michal Vasko2f03d222020-12-09 18:15:51 +01001745 assert(op_iter);
Michal Vaskobb844672020-07-03 11:06:12 +02001746 *op_subtree = (struct lyd_node *)op_iter;
Michal Vasko2f03d222020-12-09 18:15:51 +01001747 if (!tree || tree_iter) {
1748 /* there is no tree whatsoever or this is the last found sibling */
1749 *tree_sibling = (struct lyd_node *)tree_iter;
1750 } else {
1751 /* matching parent was found but it has no children to insert next to */
1752 assert(match);
1753 *tree_parent = match;
1754 }
Michal Vaskocb7526d2020-03-30 15:08:26 +02001755}
1756
Michal Vaskoe0665742021-02-11 11:08:44 +01001757/**
1758 * @brief Validate an RPC/action request, reply, or notification.
1759 *
1760 * @param[in] op_tree Full operation data tree.
1761 * @param[in] op_node Operation node itself.
1762 * @param[in] dep_tree Tree to be used for validating references from the operation subtree.
1763 * @param[in] int_opts Internal parser options.
Michal Vaskofbbea932022-06-07 11:00:55 +02001764 * @param[in] data_type Type of validated data.
Michal Vaskoe0665742021-02-11 11:08:44 +01001765 * @param[in] validate_subtree Whether subtree was already validated (as part of data parsing) or not (separate validation).
1766 * @param[in] node_when_p Set of nodes with when conditions, if NULL a local set is used.
1767 * @param[in] node_types_p Set of unres node types, if NULL a local set is used.
1768 * @param[in] meta_types_p Set of unres metadata types, if NULL a local set is used.
Michal Vasko135719f2022-08-25 12:18:17 +02001769 * @param[in] ext_node_p Set of unres nodes with extensions to validate, if NULL a local set is used.
Michal Vaskoddd76592022-01-17 13:34:48 +01001770 * @param[in] ext_val_p Set of parsed extension data to validate, if NULL a local set is used.
Michal Vaskoe0665742021-02-11 11:08:44 +01001771 * @param[out] diff Optional diff with any changes made by the validation.
1772 * @return LY_SUCCESS on success.
1773 * @return LY_ERR error on error.
1774 */
1775static LY_ERR
Michal Vaskofbbea932022-06-07 11:00:55 +02001776_lyd_validate_op(struct lyd_node *op_tree, struct lyd_node *op_node, const struct lyd_node *dep_tree, enum lyd_type data_type,
Michal Vaskoddd76592022-01-17 13:34:48 +01001777 uint32_t int_opts, ly_bool validate_subtree, struct ly_set *node_when_p, struct ly_set *node_types_p,
Michal Vasko135719f2022-08-25 12:18:17 +02001778 struct ly_set *meta_types_p, struct ly_set *ext_node_p, struct ly_set *ext_val_p, struct lyd_node **diff)
Michal Vaskocb7526d2020-03-30 15:08:26 +02001779{
Michal Vaskoe0665742021-02-11 11:08:44 +01001780 LY_ERR rc = LY_SUCCESS;
Michal Vaskofbbea932022-06-07 11:00:55 +02001781 struct lyd_node *tree_sibling, *tree_parent, *op_subtree, *op_parent, *op_sibling_before, *op_sibling_after, *child;
Michal Vasko135719f2022-08-25 12:18:17 +02001782 struct ly_set node_types = {0}, meta_types = {0}, node_when = {0}, ext_node = {0}, ext_val = {0};
Michal Vaskocb7526d2020-03-30 15:08:26 +02001783
Michal Vaskoe0665742021-02-11 11:08:44 +01001784 assert(op_tree && op_node);
Michal Vasko135719f2022-08-25 12:18:17 +02001785 assert((node_when_p && node_types_p && meta_types_p && ext_node_p && ext_val_p) ||
1786 (!node_when_p && !node_types_p && !meta_types_p && !ext_node_p && !ext_val_p));
Michal Vaskoe0665742021-02-11 11:08:44 +01001787
1788 if (!node_when_p) {
1789 node_when_p = &node_when;
1790 node_types_p = &node_types;
1791 meta_types_p = &meta_types;
Michal Vasko135719f2022-08-25 12:18:17 +02001792 ext_node_p = &ext_node;
Michal Vaskoddd76592022-01-17 13:34:48 +01001793 ext_val_p = &ext_val;
Michal Vaskoe0665742021-02-11 11:08:44 +01001794 }
1795
1796 /* merge op_tree into dep_tree */
1797 lyd_val_op_merge_find(op_tree, op_node, dep_tree, &op_subtree, &tree_sibling, &tree_parent);
Michal Vaskoc61dd062022-06-07 11:01:28 +02001798 op_sibling_before = op_subtree->prev->next ? op_subtree->prev : NULL;
1799 op_sibling_after = op_subtree->next;
Michal Vaskoe0665742021-02-11 11:08:44 +01001800 op_parent = lyd_parent(op_subtree);
Michal Vaskoc61dd062022-06-07 11:01:28 +02001801
Michal Vaskoe0665742021-02-11 11:08:44 +01001802 lyd_unlink_tree(op_subtree);
Michal Vasko6ee6f432021-07-16 09:49:14 +02001803 lyd_insert_node(tree_parent, &tree_sibling, op_subtree, 0);
Michal Vaskoe0665742021-02-11 11:08:44 +01001804 if (!dep_tree) {
1805 dep_tree = tree_sibling;
1806 }
1807
1808 LOG_LOCSET(NULL, op_node, NULL, NULL);
1809
1810 if (int_opts & LYD_INTOPT_REPLY) {
1811 /* add output children defaults */
Michal Vaskoddd76592022-01-17 13:34:48 +01001812 rc = lyd_new_implicit_r(op_node, lyd_node_child_p(op_node), NULL, NULL, node_when_p, node_types_p,
Michal Vaskofcbd78f2022-08-26 08:34:15 +02001813 ext_node_p, LYD_IMPLICIT_OUTPUT, diff);
Michal Vaskoe0665742021-02-11 11:08:44 +01001814 LY_CHECK_GOTO(rc, cleanup);
1815
1816 if (validate_subtree) {
1817 /* skip validating the operation itself, go to children directly */
1818 LY_LIST_FOR(lyd_child(op_node), child) {
Michal Vasko1a6e6902022-08-26 08:35:09 +02001819 rc = lyd_validate_subtree(child, node_when_p, node_types_p, meta_types_p, ext_node_p, ext_val_p, 0, diff);
Radek Krejci4f2e3e52021-03-30 14:20:28 +02001820 LY_CHECK_GOTO(rc, cleanup);
Michal Vaskoe0665742021-02-11 11:08:44 +01001821 }
1822 }
1823 } else {
1824 if (validate_subtree) {
1825 /* prevalidate whole operation subtree */
Michal Vasko1a6e6902022-08-26 08:35:09 +02001826 rc = lyd_validate_subtree(op_node, node_when_p, node_types_p, meta_types_p, ext_node_p, ext_val_p, 0, diff);
Radek Krejci4f2e3e52021-03-30 14:20:28 +02001827 LY_CHECK_GOTO(rc, cleanup);
Michal Vaskoe0665742021-02-11 11:08:44 +01001828 }
1829 }
1830
Michal Vasko906bafa2022-04-22 12:28:55 +02001831 /* finish incompletely validated terminal values/attributes and when conditions on the full tree,
1832 * account for unresolved 'when' that may appear in the non-validated dependency data tree */
Michal Vaskofbbea932022-06-07 11:00:55 +02001833 LY_CHECK_GOTO(rc = lyd_validate_unres((struct lyd_node **)&dep_tree, NULL, data_type, node_when_p, LYXP_IGNORE_WHEN,
Michal Vasko135719f2022-08-25 12:18:17 +02001834 node_types_p, meta_types_p, ext_node_p, ext_val_p, 0, diff), cleanup);
Michal Vaskoe0665742021-02-11 11:08:44 +01001835
1836 /* perform final validation of the operation/notification */
1837 lyd_validate_obsolete(op_node);
Michal Vasko906bafa2022-04-22 12:28:55 +02001838 LY_CHECK_GOTO(rc = lyd_validate_must(op_node, int_opts, LYXP_IGNORE_WHEN), cleanup);
Michal Vaskoe0665742021-02-11 11:08:44 +01001839
1840 /* final validation of all the descendants */
Michal Vasko906bafa2022-04-22 12:28:55 +02001841 rc = lyd_validate_final_r(lyd_child(op_node), op_node, op_node->schema, NULL, 0, int_opts, LYXP_IGNORE_WHEN);
1842 LY_CHECK_GOTO(rc, cleanup);
Michal Vaskoe0665742021-02-11 11:08:44 +01001843
1844cleanup:
1845 LOG_LOCBACK(0, 1, 0, 0);
Michal Vaskoc61dd062022-06-07 11:01:28 +02001846
Michal Vaskoe0665742021-02-11 11:08:44 +01001847 /* restore operation tree */
1848 lyd_unlink_tree(op_subtree);
Michal Vaskoc61dd062022-06-07 11:01:28 +02001849 if (op_sibling_before) {
1850 lyd_insert_after_node(op_sibling_before, op_subtree);
1851 } else if (op_sibling_after) {
1852 lyd_insert_before_node(op_sibling_after, op_subtree);
1853 } else if (op_parent) {
Michal Vasko6ee6f432021-07-16 09:49:14 +02001854 lyd_insert_node(op_parent, NULL, op_subtree, 0);
Michal Vaskoe0665742021-02-11 11:08:44 +01001855 }
1856
1857 ly_set_erase(&node_when, NULL);
1858 ly_set_erase(&node_types, NULL);
1859 ly_set_erase(&meta_types, NULL);
Michal Vasko135719f2022-08-25 12:18:17 +02001860 ly_set_erase(&ext_node, free);
Michal Vaskoddd76592022-01-17 13:34:48 +01001861 ly_set_erase(&ext_val, free);
Michal Vaskoe0665742021-02-11 11:08:44 +01001862 return rc;
1863}
1864
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001865LIBYANG_API_DEF LY_ERR
Michal Vaskoe0665742021-02-11 11:08:44 +01001866lyd_validate_op(struct lyd_node *op_tree, const struct lyd_node *dep_tree, enum lyd_type data_type, struct lyd_node **diff)
1867{
1868 struct lyd_node *op_node;
1869 uint32_t int_opts;
Michal Vaskofbbea932022-06-07 11:00:55 +02001870 struct ly_set ext_val = {0};
1871 LY_ERR rc;
Michal Vaskoe0665742021-02-11 11:08:44 +01001872
Michal Vasko2da45692022-04-29 09:51:08 +02001873 LY_CHECK_ARG_RET(NULL, op_tree, !dep_tree || !dep_tree->parent, (data_type == LYD_TYPE_RPC_YANG) ||
Michal Vasko1e4c68e2021-02-18 15:03:01 +01001874 (data_type == LYD_TYPE_NOTIF_YANG) || (data_type == LYD_TYPE_REPLY_YANG), LY_EINVAL);
Michal Vasko8104fd42020-07-13 11:09:51 +02001875 if (diff) {
1876 *diff = NULL;
1877 }
Michal Vasko1e4c68e2021-02-18 15:03:01 +01001878 if (data_type == LYD_TYPE_RPC_YANG) {
Michal Vaskoe0665742021-02-11 11:08:44 +01001879 int_opts = LYD_INTOPT_RPC | LYD_INTOPT_ACTION;
Michal Vasko1e4c68e2021-02-18 15:03:01 +01001880 } else if (data_type == LYD_TYPE_NOTIF_YANG) {
Michal Vaskoe0665742021-02-11 11:08:44 +01001881 int_opts = LYD_INTOPT_NOTIF;
1882 } else {
1883 int_opts = LYD_INTOPT_REPLY;
1884 }
Michal Vaskocb7526d2020-03-30 15:08:26 +02001885
Michal Vasko2da45692022-04-29 09:51:08 +02001886 if (op_tree->schema && (op_tree->schema->nodetype & (LYS_RPC | LYS_ACTION | LYS_NOTIF))) {
1887 /* we have the operation/notification, adjust the pointers */
1888 op_node = op_tree;
1889 while (op_tree->parent) {
1890 op_tree = lyd_parent(op_tree);
Michal Vaskocb7526d2020-03-30 15:08:26 +02001891 }
Michal Vasko2da45692022-04-29 09:51:08 +02001892 } else {
1893 /* find the operation/notification */
1894 while (op_tree->parent) {
1895 op_tree = lyd_parent(op_tree);
1896 }
1897 LYD_TREE_DFS_BEGIN(op_tree, op_node) {
1898 if (!op_node->schema) {
Michal Vaskoac6f4be2022-05-02 10:16:50 +02001899 return lyd_parse_opaq_error(op_node);
Michal Vaskofbbea932022-06-07 11:00:55 +02001900 } else if (op_node->flags & LYD_EXT) {
1901 /* fully validate the rest using the extension instance callback */
1902 LY_CHECK_RET(lyd_validate_nested_ext(op_node, &ext_val));
Michal Vasko135719f2022-08-25 12:18:17 +02001903 rc = lyd_validate_unres((struct lyd_node **)&dep_tree, NULL, data_type, NULL, 0, NULL, NULL, NULL,
1904 &ext_val, 0, diff);
Michal Vaskofbbea932022-06-07 11:00:55 +02001905 ly_set_erase(&ext_val, free);
1906 return rc;
Michal Vasko2da45692022-04-29 09:51:08 +02001907 }
1908
1909 if ((int_opts & (LYD_INTOPT_RPC | LYD_INTOPT_ACTION | LYD_INTOPT_REPLY)) &&
1910 (op_node->schema->nodetype & (LYS_RPC | LYS_ACTION))) {
1911 break;
1912 } else if ((int_opts & LYD_INTOPT_NOTIF) && (op_node->schema->nodetype == LYS_NOTIF)) {
1913 break;
1914 }
1915 LYD_TREE_DFS_END(op_tree, op_node);
1916 }
Michal Vaskocb7526d2020-03-30 15:08:26 +02001917 }
Michal Vasko2da45692022-04-29 09:51:08 +02001918
Michal Vaskoe0665742021-02-11 11:08:44 +01001919 if (int_opts & (LYD_INTOPT_RPC | LYD_INTOPT_ACTION | LYD_INTOPT_REPLY)) {
Michal Vasko9b232082022-06-07 10:59:31 +02001920 if (!op_node || !(op_node->schema->nodetype & (LYS_RPC | LYS_ACTION))) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001921 LOGERR(LYD_CTX(op_tree), LY_EINVAL, "No RPC/action to validate found.");
Michal Vaskocb7526d2020-03-30 15:08:26 +02001922 return LY_EINVAL;
1923 }
1924 } else {
Michal Vasko9b232082022-06-07 10:59:31 +02001925 if (!op_node || (op_node->schema->nodetype != LYS_NOTIF)) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001926 LOGERR(LYD_CTX(op_tree), LY_EINVAL, "No notification to validate found.");
Michal Vaskocb7526d2020-03-30 15:08:26 +02001927 return LY_EINVAL;
1928 }
1929 }
1930
Michal Vaskoe0665742021-02-11 11:08:44 +01001931 /* validate */
Michal Vasko135719f2022-08-25 12:18:17 +02001932 return _lyd_validate_op(op_tree, op_node, dep_tree, data_type, int_opts, 1, NULL, NULL, NULL, NULL, NULL, diff);
Michal Vaskofea12c62020-03-30 11:00:15 +02001933}