blob: a6c9fdded442b9fd10cba92d86a3ae7c1281b83d [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 Vaskoe78faec2021-04-08 17:24:43 +02006 * Copyright (c) 2019 - 2021 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);
141 LY_ARRAY_FOR(when_list, u) {
142 when = when_list[u];
Michal Vaskocde73ac2019-11-14 16:10:27 +0100143
Michal Vaskobd4db892020-11-23 16:58:20 +0100144 /* get context node */
145 if (when->context == schema) {
146 ctx_node = node;
147 } else {
148 assert((!when->context && !node->parent) || (when->context == node->parent->schema));
Michal Vasko9e685082021-01-29 14:49:09 +0100149 ctx_node = lyd_parent(node);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100150 }
Michal Vaskobd4db892020-11-23 16:58:20 +0100151
152 /* evaluate when */
153 memset(&xp_set, 0, sizeof xp_set);
Radek Krejci8df109d2021-04-23 12:19:08 +0200154 ret = lyxp_eval(LYD_CTX(node), when->cond, schema->module, LY_VALUE_SCHEMA_RESOLVED, when->prefixes,
Michal Vasko976ec432021-12-06 15:42:22 +0100155 ctx_node, tree, NULL, &xp_set, LYXP_SCHEMA | xpath_options);
Michal Vaskobd4db892020-11-23 16:58:20 +0100156 lyxp_set_cast(&xp_set, LYXP_SET_BOOLEAN);
157
158 /* return error or LY_EINCOMPLETE for dependant unresolved when */
159 LY_CHECK_RET(ret);
160
161 if (!xp_set.val.bln) {
162 /* false when */
163 *disabled = when;
164 return LY_SUCCESS;
Michal Vasko8104fd42020-07-13 11:09:51 +0200165 }
Michal Vaskocde73ac2019-11-14 16:10:27 +0100166 }
Michal Vaskobd4db892020-11-23 16:58:20 +0100167
168 schema = schema->parent;
169 } while (schema && (schema->nodetype & (LYS_CASE | LYS_CHOICE)));
170
171 return LY_SUCCESS;
172}
173
174/**
175 * @brief Evaluate when conditions of collected unres nodes.
176 *
177 * @param[in,out] tree Data tree, is updated if some nodes are autodeleted.
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100178 * @param[in] mod Module of the @p tree to take into consideration when deleting @p tree and moving it.
179 * If set, it is expected @p tree should point to the first node of @p mod. Otherwise it will simply be
180 * the first top-level sibling.
Michal Vaskobd4db892020-11-23 16:58:20 +0100181 * @param[in] node_when Set with nodes with "when" conditions.
Michal Vasko976ec432021-12-06 15:42:22 +0100182 * @param[in] xpath_options Additional XPath options to use.
Michal Vasko27d2b1b2021-07-19 15:20:02 +0200183 * @param[in,out] node_types Set with nodes with unresolved types, remove any with false "when" parents.
Michal Vaskobd4db892020-11-23 16:58:20 +0100184 * @param[in,out] diff Validation diff.
185 * @return LY_SUCCESS on success.
186 * @return LY_ERR value on error.
187 */
188static LY_ERR
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100189lyd_validate_unres_when(struct lyd_node **tree, const struct lys_module *mod, struct ly_set *node_when,
Michal Vasko976ec432021-12-06 15:42:22 +0100190 uint32_t xpath_options, struct ly_set *node_types, struct lyd_node **diff)
Michal Vaskobd4db892020-11-23 16:58:20 +0100191{
192 LY_ERR ret;
Michal Vasko27d2b1b2021-07-19 15:20:02 +0200193 uint32_t i, idx;
Michal Vaskobd4db892020-11-23 16:58:20 +0100194 const struct lysc_when *disabled;
Michal Vasko27d2b1b2021-07-19 15:20:02 +0200195 struct lyd_node *node = NULL, *elem;
Michal Vaskobd4db892020-11-23 16:58:20 +0100196
197 if (!node_when->count) {
198 return LY_SUCCESS;
Michal Vaskocde73ac2019-11-14 16:10:27 +0100199 }
200
Michal Vaskobd4db892020-11-23 16:58:20 +0100201 i = node_when->count;
202 do {
203 --i;
204 node = node_when->dnodes[i];
Radek Krejciddace2c2021-01-08 11:30:56 +0100205 LOG_LOCSET(node->schema, node, NULL, NULL);
Michal Vaskobd4db892020-11-23 16:58:20 +0100206
207 /* evaluate all when expressions that affect this node's existence */
Michal Vasko976ec432021-12-06 15:42:22 +0100208 ret = lyd_validate_node_when(*tree, node, node->schema, xpath_options, &disabled);
Michal Vaskobd4db892020-11-23 16:58:20 +0100209 if (!ret) {
210 if (disabled) {
211 /* when false */
212 if (node->flags & LYD_WHEN_TRUE) {
213 /* autodelete */
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100214 lyd_del_move_root(tree, node, mod);
Michal Vaskobd4db892020-11-23 16:58:20 +0100215 if (diff) {
216 /* add into diff */
Radek Krejci2efc45b2020-12-22 16:25:44 +0100217 ret = lyd_val_diff_add(node, LYD_DIFF_OP_DELETE, diff);
218 LY_CHECK_GOTO(ret, 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 Vasko36ce6b22021-07-26 09:19:21 +0200222 if (node_types) {
223 LYD_TREE_DFS_BEGIN(node, elem) {
224 if (ly_set_contains(node_types, elem, &idx)) {
225 LY_CHECK_GOTO(ret = ly_set_rm_index(node_types, idx, NULL), error);
226 }
227 LYD_TREE_DFS_END(node, elem);
Michal Vasko27d2b1b2021-07-19 15:20:02 +0200228 }
Michal Vasko27d2b1b2021-07-19 15:20:02 +0200229 }
230
231 /* free */
Michal Vaskobd4db892020-11-23 16:58:20 +0100232 lyd_free_tree(node);
233 } else {
234 /* invalid data */
Radek Krejci2efc45b2020-12-22 16:25:44 +0100235 LOGVAL(LYD_CTX(node), LY_VCODE_NOWHEN, disabled->cond->expr);
236 ret = LY_EVALID;
237 goto error;
Michal Vaskobd4db892020-11-23 16:58:20 +0100238 }
239 } else {
240 /* when true */
241 node->flags |= LYD_WHEN_TRUE;
242 }
243
244 /* remove this node from the set, its when was resolved */
245 ly_set_rm_index(node_when, i, NULL);
246 } else if (ret != LY_EINCOMPLETE) {
247 /* error */
Radek Krejci2efc45b2020-12-22 16:25:44 +0100248 goto error;
Michal Vaskobd4db892020-11-23 16:58:20 +0100249 }
Radek Krejci2efc45b2020-12-22 16:25:44 +0100250
Radek Krejciddace2c2021-01-08 11:30:56 +0100251 LOG_LOCBACK(1, 1, 0, 0);
Michal Vaskobd4db892020-11-23 16:58:20 +0100252 } while (i);
253
254 return LY_SUCCESS;
Radek Krejci2efc45b2020-12-22 16:25:44 +0100255
256error:
Radek Krejciddace2c2021-01-08 11:30:56 +0100257 LOG_LOCBACK(1, 1, 0, 0);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100258 return ret;
Michal Vaskocde73ac2019-11-14 16:10:27 +0100259}
260
Radek Krejci4f2e3e52021-03-30 14:20:28 +0200261struct node_ext {
262 struct lyd_node *node;
263 struct lysc_ext_instance *ext;
264};
265
266static LY_ERR
267node_ext_tovalidate_add(struct ly_set *node_exts, struct lysc_ext_instance *exts, struct lyd_node *node)
268{
269 LY_ERR ret = LY_SUCCESS;
270 struct lysc_ext_instance *ext;
271 struct node_ext *rec;
272
Radek Krejci3011b072021-04-13 20:25:34 +0200273 LY_ARRAY_FOR(exts, struct lysc_ext_instance, ext) {
Radek Krejci4a4d1e02021-04-09 14:04:40 +0200274 if (ext->def->plugin && ext->def->plugin->validate) {
Radek Krejci4f2e3e52021-03-30 14:20:28 +0200275 rec = malloc(sizeof *rec);
276 LY_CHECK_ERR_RET(!rec, LOGMEM(LYD_CTX(node)), LY_EMEM);
277 rec->ext = ext;
278 rec->node = node;
279
280 ret = ly_set_add(node_exts, rec, 1, NULL);
281 if (ret) {
282 free(rec);
283 break;
284 }
285 }
286 }
287
288 return ret;
289}
290
Michal Vaskocde73ac2019-11-14 16:10:27 +0100291LY_ERR
Radek Krejci4f2e3e52021-03-30 14:20:28 +0200292lysc_node_ext_tovalidate(struct ly_set *node_exts, struct lyd_node *node)
293{
294 const struct lysc_node *schema = node->schema;
295
296 if (!schema) {
297 /* nothing to do */
298 return LY_SUCCESS;
299 }
300
301 /* node's extensions */
302 LY_CHECK_RET(node_ext_tovalidate_add(node_exts, schema->exts, node));
303
304 if (schema->nodetype & (LYS_LEAF | LYS_LEAFLIST)) {
305 /* type's extensions */
306 LY_CHECK_RET(node_ext_tovalidate_add(node_exts, ((struct lysc_node_leaf *)schema)->type->exts, node));
307 }
308
309 return LY_SUCCESS;
310}
311
312LY_ERR
Michal Vasko976ec432021-12-06 15:42:22 +0100313lyd_validate_unres(struct lyd_node **tree, const struct lys_module *mod, struct ly_set *node_when, uint32_t when_xp_opts,
314 struct ly_set *node_exts, struct ly_set *node_types, struct ly_set *meta_types, struct lyd_node **diff)
Michal Vaskocde73ac2019-11-14 16:10:27 +0100315{
316 LY_ERR ret = LY_SUCCESS;
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200317 uint32_t i;
Michal Vaskocde73ac2019-11-14 16:10:27 +0100318
Michal Vaskob1b5c262020-03-05 14:29:47 +0100319 if (node_when) {
320 /* evaluate all when conditions */
321 uint32_t prev_count;
322 do {
323 prev_count = node_when->count;
Michal Vasko976ec432021-12-06 15:42:22 +0100324 LY_CHECK_RET(lyd_validate_unres_when(tree, mod, node_when, when_xp_opts, node_types, diff));
Radek Krejci0f969882020-08-21 16:56:47 +0200325 /* there must have been some when conditions resolved */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100326 } while (prev_count > node_when->count);
Michal Vaskocde73ac2019-11-14 16:10:27 +0100327
Michal Vaskob1b5c262020-03-05 14:29:47 +0100328 /* there could have been no cyclic when dependencies, checked during compilation */
329 assert(!node_when->count);
330 }
331
Radek Krejci4f2e3e52021-03-30 14:20:28 +0200332 if (node_exts && node_exts->count) {
333 i = node_exts->count;
334 do {
335 --i;
336
337 struct node_ext *item = node_exts->objs[i];
338
339 LOG_LOCSET(item->node->schema, item->node, NULL, NULL);
340 ret = item->ext->def->plugin->validate(item->ext, item->node);
341 LOG_LOCBACK(item->node->schema ? 1 : 0, 1, 0, 0);
342 LY_CHECK_RET(ret);
343
344 /* remove this node from the set */
345 ly_set_rm_index(node_exts, i, free);
346 } while (i);
347 }
348
Michal Vaskob1b5c262020-03-05 14:29:47 +0100349 if (node_types && node_types->count) {
350 /* finish incompletely validated terminal values (traverse from the end for efficient set removal) */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200351 i = node_types->count;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100352 do {
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200353 --i;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100354
Michal Vasko14ed9cd2021-01-28 14:16:25 +0100355 struct lyd_node_term *node = node_types->objs[i];
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200356 struct lysc_type *type = ((struct lysc_node_leaf *)node->schema)->type;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100357
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200358 /* resolve the value of the node */
Michal Vasko9e685082021-01-29 14:49:09 +0100359 LOG_LOCSET(node->schema, &node->node, NULL, NULL);
360 ret = lyd_value_validate_incomplete(LYD_CTX(node), type, &node->value, &node->node, *tree);
Radek Krejciddace2c2021-01-08 11:30:56 +0100361 LOG_LOCBACK(node->schema ? 1 : 0, 1, 0, 0);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100362 LY_CHECK_RET(ret);
363
364 /* remove this node from the set */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200365 ly_set_rm_index(node_types, i, NULL);
366 } while (i);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100367 }
368
Michal Vasko9f96a052020-03-10 09:41:45 +0100369 if (meta_types && meta_types->count) {
370 /* ... and metadata values */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200371 i = meta_types->count;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100372 do {
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200373 --i;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100374
Michal Vasko14ed9cd2021-01-28 14:16:25 +0100375 struct lyd_meta *meta = meta_types->objs[i];
Radek Krejci1b2eef82021-02-17 11:17:27 +0100376 struct lysc_type *type = *(struct lysc_type **)meta->annotation->substmts[ANNOTATION_SUBSTMT_TYPE].storage;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100377
Michal Vasko9f96a052020-03-10 09:41:45 +0100378 /* validate and store the value of the metadata */
Radek Krejci2efc45b2020-12-22 16:25:44 +0100379 ret = lyd_value_validate_incomplete(LYD_CTX(meta->parent), type, &meta->value, meta->parent, *tree);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100380 LY_CHECK_RET(ret);
381
382 /* remove this attr from the set */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200383 ly_set_rm_index(meta_types, i, NULL);
384 } while (i);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100385 }
Michal Vaskocde73ac2019-11-14 16:10:27 +0100386
387 return ret;
388}
389
Michal Vaskobb844672020-07-03 11:06:12 +0200390/**
391 * @brief Validate instance duplication.
392 *
393 * @param[in] first First sibling to search in.
394 * @param[in] node Data node instance to check.
395 * @return LY_ERR value.
396 */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100397static LY_ERR
398lyd_validate_duplicates(const struct lyd_node *first, const struct lyd_node *node)
Michal Vaskocde73ac2019-11-14 16:10:27 +0100399{
Michal Vaskob1b5c262020-03-05 14:29:47 +0100400 struct lyd_node **match_p;
Radek Krejci857189e2020-09-01 13:26:36 +0200401 ly_bool fail = 0;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100402
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100403 assert(node->flags & LYD_NEW);
404
Michal Vaskod6c18af2021-02-12 12:07:31 +0100405 /* key-less list or non-configuration leaf-list */
Michal Vaskoe78faec2021-04-08 17:24:43 +0200406 if (lysc_is_dup_inst_list(node->schema)) {
Michal Vaskob1b5c262020-03-05 14:29:47 +0100407 /* duplicate instances allowed */
408 return LY_SUCCESS;
Michal Vaskocde73ac2019-11-14 16:10:27 +0100409 }
410
Michal Vaskob1b5c262020-03-05 14:29:47 +0100411 /* find exactly the same next instance using hashes if possible */
412 if (node->parent && node->parent->children_ht) {
413 if (!lyht_find_next(node->parent->children_ht, &node, node->hash, (void **)&match_p)) {
414 fail = 1;
415 }
416 } else {
Michal Vaskod989ba02020-08-24 10:59:24 +0200417 for ( ; first; first = first->next) {
Michal Vaskob1b5c262020-03-05 14:29:47 +0100418 if (first == node) {
419 continue;
420 }
421
422 if (node->schema->nodetype & (LYD_NODE_ANY | LYS_LEAF)) {
423 if (first->schema == node->schema) {
424 fail = 1;
425 break;
426 }
Michal Vasko8f359bf2020-07-28 10:41:15 +0200427 } else if (!lyd_compare_single(first, node, 0)) {
Michal Vaskob1b5c262020-03-05 14:29:47 +0100428 fail = 1;
429 break;
430 }
431 }
432 }
433
434 if (fail) {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100435 LOGVAL(node->schema->module->ctx, LY_VCODE_DUP, node->schema->name);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100436 return LY_EVALID;
437 }
438 return LY_SUCCESS;
Michal Vaskocde73ac2019-11-14 16:10:27 +0100439}
440
Michal Vaskobb844672020-07-03 11:06:12 +0200441/**
442 * @brief Validate multiple case data existence with possible autodelete.
443 *
444 * @param[in,out] first First sibling to search in, is updated if needed.
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100445 * @param[in] mod Module of the siblings, NULL for nested siblings.
Michal Vaskobb844672020-07-03 11:06:12 +0200446 * @param[in] choic Choice node whose cases to check.
Michal Vasko8104fd42020-07-13 11:09:51 +0200447 * @param[in,out] diff Validation diff.
Michal Vaskobb844672020-07-03 11:06:12 +0200448 * @return LY_ERR value.
449 */
Michal Vaskocde73ac2019-11-14 16:10:27 +0100450static LY_ERR
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100451lyd_validate_cases(struct lyd_node **first, const struct lys_module *mod, const struct lysc_node_choice *choic,
452 struct lyd_node **diff)
Michal Vaskob1b5c262020-03-05 14:29:47 +0100453{
454 const struct lysc_node *scase, *iter, *old_case = NULL, *new_case = NULL;
455 struct lyd_node *match, *to_del;
Radek Krejci857189e2020-09-01 13:26:36 +0200456 ly_bool found;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100457
Michal Vasko14ed9cd2021-01-28 14:16:25 +0100458 LOG_LOCSET(&choic->node, NULL, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100459
Michal Vaskob1b5c262020-03-05 14:29:47 +0100460 LY_LIST_FOR((struct lysc_node *)choic->cases, scase) {
461 found = 0;
462 iter = NULL;
463 match = NULL;
464 while ((match = lys_getnext_data(match, *first, &iter, scase, NULL))) {
465 if (match->flags & LYD_NEW) {
466 /* a new case data found, nothing more to look for */
467 found = 2;
468 break;
469 } else {
470 /* and old case data found */
471 if (found == 0) {
472 found = 1;
473 }
474 }
475 }
476
477 if (found == 1) {
478 /* there should not be 2 old cases */
479 if (old_case) {
480 /* old data from 2 cases */
Radek Krejci2efc45b2020-12-22 16:25:44 +0100481 LOGVAL(choic->module->ctx, LY_VCODE_DUPCASE, old_case->name, scase->name);
Radek Krejciddace2c2021-01-08 11:30:56 +0100482 LOG_LOCBACK(1, 0, 0, 0);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100483 return LY_EVALID;
484 }
485
486 /* remember an old existing case */
487 old_case = scase;
488 } else if (found == 2) {
489 if (new_case) {
490 /* new data from 2 cases */
Radek Krejci2efc45b2020-12-22 16:25:44 +0100491 LOGVAL(choic->module->ctx, LY_VCODE_DUPCASE, new_case->name, scase->name);
Radek Krejciddace2c2021-01-08 11:30:56 +0100492 LOG_LOCBACK(1, 0, 0, 0);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100493 return LY_EVALID;
494 }
495
496 /* remember a new existing case */
497 new_case = scase;
498 }
499 }
500
Radek Krejciddace2c2021-01-08 11:30:56 +0100501 LOG_LOCBACK(1, 0, 0, 0);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100502
Michal Vaskob1b5c262020-03-05 14:29:47 +0100503 if (old_case && new_case) {
504 /* auto-delete old case */
505 iter = NULL;
506 match = NULL;
507 to_del = NULL;
508 while ((match = lys_getnext_data(match, *first, &iter, old_case, NULL))) {
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100509 lyd_del_move_root(first, to_del, mod);
510
Michal Vasko8104fd42020-07-13 11:09:51 +0200511 /* free previous node */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100512 lyd_free_tree(to_del);
Michal Vasko8104fd42020-07-13 11:09:51 +0200513 if (diff) {
514 /* add into diff */
515 LY_CHECK_RET(lyd_val_diff_add(match, LYD_DIFF_OP_DELETE, diff));
516 }
Michal Vaskob1b5c262020-03-05 14:29:47 +0100517 to_del = match;
518 }
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100519 lyd_del_move_root(first, to_del, mod);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100520 lyd_free_tree(to_del);
521 }
522
523 return LY_SUCCESS;
524}
525
Michal Vaskobb844672020-07-03 11:06:12 +0200526/**
527 * @brief Check whether a schema node can have some default values (true for NP containers as well).
528 *
529 * @param[in] schema Schema node to check.
530 * @return non-zero if yes,
531 * @return 0 otherwise.
532 */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100533static int
534lyd_val_has_default(const struct lysc_node *schema)
535{
536 switch (schema->nodetype) {
537 case LYS_LEAF:
538 if (((struct lysc_node_leaf *)schema)->dflt) {
539 return 1;
540 }
541 break;
542 case LYS_LEAFLIST:
543 if (((struct lysc_node_leaflist *)schema)->dflts) {
544 return 1;
545 }
546 break;
547 case LYS_CONTAINER:
548 if (!(schema->flags & LYS_PRESENCE)) {
549 return 1;
550 }
551 break;
552 default:
553 break;
554 }
555
556 return 0;
557}
558
Michal Vaskobb844672020-07-03 11:06:12 +0200559/**
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100560 * @brief Properly delete a node as part of autodelete validation tasks.
561 *
562 * @param[in,out] first First sibling, is updated if needed.
563 * @param[in] node Node instance to delete.
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100564 * @param[in] mod Module of the siblings, NULL for nested siblings.
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100565 * @param[in,out] next_p Temporary LY_LIST_FOR_SAFE next pointer, is updated if needed.
566 * @param[in,out] diff Validation diff.
567 */
568static void
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100569lyd_validate_autodel_node_del(struct lyd_node **first, struct lyd_node *node, const struct lys_module *mod,
570 struct lyd_node **next_p, struct lyd_node **diff)
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100571{
572 struct lyd_node *iter;
573
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100574 lyd_del_move_root(first, node, mod);
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100575 if (node == *next_p) {
576 *next_p = (*next_p)->next;
577 }
578 if (diff) {
579 /* add into diff */
580 if ((node->schema->nodetype == LYS_CONTAINER) && !(node->schema->flags & LYS_PRESENCE)) {
581 /* we do not want to track NP container changes, but remember any removed children */
582 LY_LIST_FOR(lyd_child(node), iter) {
583 lyd_val_diff_add(iter, LYD_DIFF_OP_DELETE, diff);
584 }
585 } else {
586 lyd_val_diff_add(node, LYD_DIFF_OP_DELETE, diff);
587 }
588 }
589 lyd_free_tree(node);
590}
591
592/**
Michal Vaskobb844672020-07-03 11:06:12 +0200593 * @brief Autodelete old instances to prevent validation errors.
594 *
595 * @param[in,out] first First sibling to search in, is updated if needed.
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100596 * @param[in] node New data node instance to check.
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100597 * @param[in] mod Module of the siblings, NULL for nested siblings.
Michal Vaskobb844672020-07-03 11:06:12 +0200598 * @param[in,out] next_p Temporary LY_LIST_FOR_SAFE next pointer, is updated if needed.
Michal Vasko8104fd42020-07-13 11:09:51 +0200599 * @param[in,out] diff Validation diff.
Michal Vaskobb844672020-07-03 11:06:12 +0200600 */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100601static void
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100602lyd_validate_autodel_dup(struct lyd_node **first, struct lyd_node *node, const struct lys_module *mod,
603 struct lyd_node **next_p, struct lyd_node **diff)
Michal Vaskob1b5c262020-03-05 14:29:47 +0100604{
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100605 struct lyd_node *match, *next;
606
607 assert(node->flags & LYD_NEW);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100608
609 if (lyd_val_has_default(node->schema)) {
610 assert(node->schema->nodetype & (LYS_LEAF | LYS_LEAFLIST | LYS_CONTAINER));
Michal Vasko4c583e82020-07-17 12:16:14 +0200611 LYD_LIST_FOR_INST_SAFE(*first, node->schema, next, match) {
Michal Vaskob1b5c262020-03-05 14:29:47 +0100612 if ((match->flags & LYD_DEFAULT) && !(match->flags & LYD_NEW)) {
613 /* default instance found, remove it */
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100614 lyd_validate_autodel_node_del(first, match, mod, next_p, diff);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100615
616 /* remove only a single container/leaf default instance, if there are more, it is an error */
617 if (node->schema->nodetype & (LYS_LEAF | LYS_CONTAINER)) {
618 break;
619 }
620 }
Michal Vaskob1b5c262020-03-05 14:29:47 +0100621 }
622 }
623}
624
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100625/**
626 * @brief Autodelete leftover default nodes of deleted cases (that have no existing explicit data).
627 *
628 * @param[in,out] first First sibling to search in, is updated if needed.
629 * @param[in] node Default data node instance to check.
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100630 * @param[in] mod Module of the siblings, NULL for nested siblings.
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100631 * @param[in,out] next_p Temporary LY_LIST_FOR_SAFE next pointer, is updated if needed.
632 * @param[in,out] diff Validation diff.
633 */
634static void
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100635lyd_validate_autodel_case_dflt(struct lyd_node **first, struct lyd_node *node, const struct lys_module *mod,
636 struct lyd_node **next_p, struct lyd_node **diff)
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100637{
638 struct lysc_node_choice *choic;
639 struct lyd_node *iter = NULL;
640 const struct lysc_node *slast = NULL;
641
642 assert(node->flags & LYD_DEFAULT);
643
644 if (!node->schema->parent || (node->schema->parent->nodetype != LYS_CASE)) {
645 /* the default node is not a descendant of a case */
646 return;
647 }
648
649 choic = (struct lysc_node_choice *)node->schema->parent->parent;
650 assert(choic->nodetype == LYS_CHOICE);
651
652 if (choic->dflt && (choic->dflt == (struct lysc_node_case *)node->schema->parent)) {
653 /* data of a default case, keep them */
654 return;
655 }
656
657 /* try to find an explicit node of the case */
658 while ((iter = lys_getnext_data(iter, *first, &slast, node->schema->parent, NULL))) {
659 if (!(iter->flags & LYD_DEFAULT)) {
660 break;
661 }
662 }
663
664 if (!iter) {
665 /* there are only default nodes of the case meaning it does not exist and neither should any default nodes
666 * of the case, remove this one default node */
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100667 lyd_validate_autodel_node_del(first, node, mod, next_p, diff);
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100668 }
669}
670
Michal Vasko17f76642021-08-03 17:01:30 +0200671/**
672 * @brief Validate new siblings in choices, recursively for nested choices.
673 *
674 * @param[in,out] first First sibling.
675 * @param[in] sparent Schema parent of the siblings, NULL for top-level siblings.
676 * @param[in] mod Module of the siblings, NULL for nested siblings.
677 * @param[in,out] diff Validation diff.
678 * @return LY_ERR value.
679 */
680static LY_ERR
681lyd_validate_choice_r(struct lyd_node **first, const struct lysc_node *sparent, const struct lys_module *mod,
Radek Krejci0f969882020-08-21 16:56:47 +0200682 struct lyd_node **diff)
Michal Vaskob1b5c262020-03-05 14:29:47 +0100683{
Michal Vaskob1b5c262020-03-05 14:29:47 +0100684 const struct lysc_node *snode = NULL;
685
Michal Vaskob1b5c262020-03-05 14:29:47 +0100686 while (*first && (snode = lys_getnext(snode, sparent, mod ? mod->compiled : NULL, LYS_GETNEXT_WITHCHOICE))) {
687 /* check case duplicites */
688 if (snode->nodetype == LYS_CHOICE) {
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100689 LY_CHECK_RET(lyd_validate_cases(first, mod, (struct lysc_node_choice *)snode, diff));
Michal Vasko17f76642021-08-03 17:01:30 +0200690
691 /* check for nested choice */
692 LY_CHECK_RET(lyd_validate_choice_r(first, snode, mod, diff));
Michal Vaskob1b5c262020-03-05 14:29:47 +0100693 }
694 }
695
Michal Vasko17f76642021-08-03 17:01:30 +0200696 return LY_SUCCESS;
697}
698
699LY_ERR
700lyd_validate_new(struct lyd_node **first, const struct lysc_node *sparent, const struct lys_module *mod,
701 struct lyd_node **diff)
702{
703 struct lyd_node *next, *node;
704
705 assert(first && (sparent || mod));
706
707 /* validate choices */
708 LY_CHECK_RET(lyd_validate_choice_r(first, sparent, mod, diff));
709
Michal Vaskob1b5c262020-03-05 14:29:47 +0100710 LY_LIST_FOR_SAFE(*first, next, node) {
Michal Vaskoc193ce92020-03-06 11:04:48 +0100711 if (mod && (lyd_owner_module(node) != mod)) {
Michal Vaskob1b5c262020-03-05 14:29:47 +0100712 /* all top-level data from this module checked */
713 break;
714 }
715
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100716 if (!(node->flags & (LYD_NEW | LYD_DEFAULT))) {
717 /* check only new and default nodes */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100718 continue;
719 }
720
Radek Krejciddace2c2021-01-08 11:30:56 +0100721 LOG_LOCSET(node->schema, node, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100722
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100723 if (node->flags & LYD_NEW) {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100724 LY_ERR ret;
725
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100726 /* remove old default(s) of the new node if it exists */
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100727 lyd_validate_autodel_dup(first, node, mod, &next, diff);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100728
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100729 /* then check new node instance duplicities */
Radek Krejci2efc45b2020-12-22 16:25:44 +0100730 ret = lyd_validate_duplicates(*first, node);
Radek Krejciddace2c2021-01-08 11:30:56 +0100731 LY_CHECK_ERR_RET(ret, LOG_LOCBACK(node->schema ? 1 : 0, 1, 0, 0), ret);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100732
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100733 /* this node is valid */
734 node->flags &= ~LYD_NEW;
735 }
736
Michal Vasko0e6de512021-01-11 13:39:44 +0100737 LOG_LOCBACK(node->schema ? 1 : 0, 1, 0, 0);
738
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100739 if (node->flags & LYD_DEFAULT) {
740 /* remove leftover default nodes from a no-longer existing case */
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100741 lyd_validate_autodel_case_dflt(first, node, mod, &next, diff);
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100742 }
Michal Vaskob1b5c262020-03-05 14:29:47 +0100743 }
744
745 return LY_SUCCESS;
746}
747
Michal Vaskobb844672020-07-03 11:06:12 +0200748/**
Michal Vaskobd4db892020-11-23 16:58:20 +0100749 * @brief Evaluate any "when" conditions of a non-existent data node with existing parent.
750 *
751 * @param[in] first First data sibling of the non-existing node.
752 * @param[in] parent Data parent of the non-existing node.
753 * @param[in] snode Schema node of the non-existing node.
754 * @param[out] disabled First when that evaluated false, if any.
755 * @return LY_ERR value.
756 */
757static LY_ERR
758lyd_validate_dummy_when(const struct lyd_node *first, const struct lyd_node *parent, const struct lysc_node *snode,
759 const struct lysc_when **disabled)
760{
761 LY_ERR ret = LY_SUCCESS;
762 struct lyd_node *tree, *dummy = NULL;
763
764 /* find root */
765 if (parent) {
766 tree = (struct lyd_node *)parent;
767 while (tree->parent) {
768 tree = lyd_parent(tree);
769 }
770 tree = lyd_first_sibling(tree);
771 } else {
772 assert(!first || !first->prev->next);
773 tree = (struct lyd_node *)first;
774 }
775
776 /* create dummy opaque node */
Michal Vasko0ab974d2021-02-24 13:18:26 +0100777 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 +0100778 LY_CHECK_GOTO(ret, cleanup);
779
780 /* connect it if needed */
781 if (!parent) {
782 if (first) {
783 lyd_insert_sibling((struct lyd_node *)first, dummy, &tree);
784 } else {
785 assert(!tree);
786 tree = dummy;
787 }
788 }
789
790 /* evaluate all when */
Michal Vasko976ec432021-12-06 15:42:22 +0100791 ret = lyd_validate_node_when(tree, dummy, snode, 0, disabled);
Michal Vaskobd4db892020-11-23 16:58:20 +0100792 if (ret == LY_EINCOMPLETE) {
793 /* all other when must be resolved by now */
794 LOGINT(snode->module->ctx);
795 ret = LY_EINT;
796 goto cleanup;
797 } else if (ret) {
798 /* error */
799 goto cleanup;
800 }
801
802cleanup:
803 lyd_free_tree(dummy);
804 return ret;
805}
806
807/**
Michal Vaskobb844672020-07-03 11:06:12 +0200808 * @brief Validate mandatory node existence.
809 *
810 * @param[in] first First sibling to search in.
Michal Vaskobd4db892020-11-23 16:58:20 +0100811 * @param[in] parent Data parent.
Michal Vaskobb844672020-07-03 11:06:12 +0200812 * @param[in] snode Schema node to validate.
813 * @return LY_ERR value.
814 */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100815static LY_ERR
Michal Vaskobd4db892020-11-23 16:58:20 +0100816lyd_validate_mandatory(const struct lyd_node *first, const struct lyd_node *parent, const struct lysc_node *snode)
Michal Vaskoa3881362020-01-21 15:57:35 +0100817{
Michal Vaskobd4db892020-11-23 16:58:20 +0100818 const struct lysc_when *disabled;
819
Michal Vaskoa3881362020-01-21 15:57:35 +0100820 if (snode->nodetype == LYS_CHOICE) {
Michal Vasko9b368d32020-02-14 13:53:31 +0100821 /* some data of a choice case exist */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100822 if (lys_getnext_data(NULL, first, NULL, snode, NULL)) {
Michal Vasko9b368d32020-02-14 13:53:31 +0100823 return LY_SUCCESS;
824 }
825 } else {
826 assert(snode->nodetype & (LYS_LEAF | LYS_CONTAINER | LYD_NODE_ANY));
Michal Vaskoa3881362020-01-21 15:57:35 +0100827
Michal Vaskob1b5c262020-03-05 14:29:47 +0100828 if (!lyd_find_sibling_val(first, snode, NULL, 0, NULL)) {
Michal Vasko9b368d32020-02-14 13:53:31 +0100829 /* data instance found */
830 return LY_SUCCESS;
Michal Vaskoa3881362020-01-21 15:57:35 +0100831 }
832 }
833
Michal Vaskobd4db892020-11-23 16:58:20 +0100834 disabled = NULL;
835 if (lysc_has_when(snode)) {
836 /* if there are any when conditions, they must be true for a validation error */
837 LY_CHECK_RET(lyd_validate_dummy_when(first, parent, snode, &disabled));
838 }
839
840 if (!disabled) {
841 /* node instance not found */
Michal Vasko538b8952021-02-17 11:27:26 +0100842 if (snode->nodetype == LYS_CHOICE) {
Michal Vaskoe9391c72021-10-05 10:04:56 +0200843 LOGVAL_APPTAG(snode->module->ctx, "missing-choice", LY_VCODE_NOMAND_CHOIC, snode->name);
Michal Vasko538b8952021-02-17 11:27:26 +0100844 } else {
845 LOGVAL(snode->module->ctx, LY_VCODE_NOMAND, snode->name);
846 }
Michal Vaskobd4db892020-11-23 16:58:20 +0100847 return LY_EVALID;
848 }
849
850 return LY_SUCCESS;
Michal Vaskoa3881362020-01-21 15:57:35 +0100851}
852
Michal Vaskobb844672020-07-03 11:06:12 +0200853/**
854 * @brief Validate min/max-elements constraints, if any.
855 *
856 * @param[in] first First sibling to search in.
Michal Vaskobd4db892020-11-23 16:58:20 +0100857 * @param[in] parent Data parent.
Michal Vaskobb844672020-07-03 11:06:12 +0200858 * @param[in] snode Schema node to validate.
859 * @param[in] min Minimum number of elements, 0 for no restriction.
860 * @param[in] max Max number of elements, 0 for no restriction.
861 * @return LY_ERR value.
862 */
Michal Vaskoa3881362020-01-21 15:57:35 +0100863static LY_ERR
Michal Vaskobd4db892020-11-23 16:58:20 +0100864lyd_validate_minmax(const struct lyd_node *first, const struct lyd_node *parent, const struct lysc_node *snode,
865 uint32_t min, uint32_t max)
Michal Vaskoa3881362020-01-21 15:57:35 +0100866{
Michal Vaskoacd83e72020-02-04 14:12:01 +0100867 uint32_t count = 0;
Michal Vasko4c583e82020-07-17 12:16:14 +0200868 struct lyd_node *iter;
Michal Vaskobd4db892020-11-23 16:58:20 +0100869 const struct lysc_when *disabled;
Radek Krejci2efc45b2020-12-22 16:25:44 +0100870 ly_bool invalid_instance = 0;
Michal Vaskoacd83e72020-02-04 14:12:01 +0100871
Michal Vasko9b368d32020-02-14 13:53:31 +0100872 assert(min || max);
873
Michal Vasko4c583e82020-07-17 12:16:14 +0200874 LYD_LIST_FOR_INST(first, snode, iter) {
875 ++count;
Michal Vasko9b368d32020-02-14 13:53:31 +0100876
Michal Vasko4c583e82020-07-17 12:16:14 +0200877 if (min && (count == min)) {
878 /* satisfied */
879 min = 0;
880 if (!max) {
881 /* nothing more to check */
Michal Vasko9b368d32020-02-14 13:53:31 +0100882 break;
883 }
Michal Vaskoacd83e72020-02-04 14:12:01 +0100884 }
Michal Vasko4c583e82020-07-17 12:16:14 +0200885 if (max && (count > max)) {
886 /* not satisifed */
Radek Krejciddace2c2021-01-08 11:30:56 +0100887 LOG_LOCSET(NULL, iter, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100888 invalid_instance = 1;
Michal Vasko4c583e82020-07-17 12:16:14 +0200889 break;
890 }
Michal Vaskoacd83e72020-02-04 14:12:01 +0100891 }
892
Michal Vasko9b368d32020-02-14 13:53:31 +0100893 if (min) {
894 assert(count < min);
Michal Vaskobd4db892020-11-23 16:58:20 +0100895
896 disabled = NULL;
897 if (lysc_has_when(snode)) {
898 /* if there are any when conditions, they must be true for a validation error */
899 LY_CHECK_RET(lyd_validate_dummy_when(first, parent, snode, &disabled));
900 }
901
902 if (!disabled) {
Michal Vaskoe9391c72021-10-05 10:04:56 +0200903 LOGVAL_APPTAG(snode->module->ctx, "too-few-elements", LY_VCODE_NOMIN, snode->name);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100904 goto failure;
Michal Vaskobd4db892020-11-23 16:58:20 +0100905 }
Michal Vaskoacd83e72020-02-04 14:12:01 +0100906 } else if (max && (count > max)) {
Michal Vaskoe9391c72021-10-05 10:04:56 +0200907 LOGVAL_APPTAG(snode->module->ctx, "too-many-elements", LY_VCODE_NOMAX, snode->name);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100908 goto failure;
Michal Vaskoacd83e72020-02-04 14:12:01 +0100909 }
910
Michal Vaskoa3881362020-01-21 15:57:35 +0100911 return LY_SUCCESS;
Radek Krejci2efc45b2020-12-22 16:25:44 +0100912
913failure:
Radek Krejciddace2c2021-01-08 11:30:56 +0100914 LOG_LOCBACK(0, invalid_instance, 0, 0);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100915 return LY_EVALID;
Michal Vaskoa3881362020-01-21 15:57:35 +0100916}
917
Michal Vaskobb844672020-07-03 11:06:12 +0200918/**
919 * @brief Find node referenced by a list unique statement.
920 *
921 * @param[in] uniq_leaf Unique leaf to find.
922 * @param[in] list List instance to use for the search.
923 * @return Found leaf,
924 * @return NULL if no leaf found.
925 */
Michal Vasko14654712020-02-06 08:35:21 +0100926static struct lyd_node *
Michal Vaskobb844672020-07-03 11:06:12 +0200927lyd_val_uniq_find_leaf(const struct lysc_node_leaf *uniq_leaf, const struct lyd_node *list)
Michal Vasko14654712020-02-06 08:35:21 +0100928{
Michal Vasko9b368d32020-02-14 13:53:31 +0100929 struct lyd_node *node;
930 const struct lysc_node *iter;
931 size_t depth = 0, i;
Michal Vasko14654712020-02-06 08:35:21 +0100932
Michal Vasko9b368d32020-02-14 13:53:31 +0100933 /* get leaf depth */
Michal Vasko14ed9cd2021-01-28 14:16:25 +0100934 for (iter = &uniq_leaf->node; iter && (iter != list->schema); iter = lysc_data_parent(iter)) {
Michal Vasko62ed12d2020-05-21 10:08:25 +0200935 ++depth;
Michal Vasko14654712020-02-06 08:35:21 +0100936 }
Michal Vasko9b368d32020-02-14 13:53:31 +0100937
Michal Vaskobb844672020-07-03 11:06:12 +0200938 node = (struct lyd_node *)list;
Michal Vasko9b368d32020-02-14 13:53:31 +0100939 while (node && depth) {
940 /* find schema node with this depth */
Michal Vasko14ed9cd2021-01-28 14:16:25 +0100941 for (i = depth - 1, iter = &uniq_leaf->node; i; iter = lysc_data_parent(iter)) {
Michal Vasko62ed12d2020-05-21 10:08:25 +0200942 --i;
Michal Vasko9b368d32020-02-14 13:53:31 +0100943 }
944
945 /* find iter instance in children */
946 assert(iter->nodetype & (LYS_CONTAINER | LYS_LEAF));
Radek Krejcia1c1e542020-09-29 16:06:52 +0200947 lyd_find_sibling_val(lyd_child(node), iter, NULL, 0, &node);
Michal Vasko9b368d32020-02-14 13:53:31 +0100948 --depth;
949 }
950
Michal Vasko14654712020-02-06 08:35:21 +0100951 return node;
952}
953
Michal Vaskobb844672020-07-03 11:06:12 +0200954/**
955 * @brief Callback for comparing 2 list unique leaf values.
956 *
Michal Vasko62524a92021-02-26 10:08:50 +0100957 * Implementation of ::lyht_value_equal_cb.
Radek Krejci857189e2020-09-01 13:26:36 +0200958 *
Michal Vaskobb844672020-07-03 11:06:12 +0200959 * @param[in] cb_data 0 to compare all uniques, n to compare only n-th unique.
Michal Vasko14654712020-02-06 08:35:21 +0100960 */
Radek Krejci857189e2020-09-01 13:26:36 +0200961static ly_bool
962lyd_val_uniq_list_equal(void *val1_p, void *val2_p, ly_bool UNUSED(mod), void *cb_data)
Michal Vasko14654712020-02-06 08:35:21 +0100963{
964 struct ly_ctx *ctx;
965 struct lysc_node_list *slist;
966 struct lyd_node *diter, *first, *second;
967 struct lyd_value *val1, *val2;
968 char *path1, *path2, *uniq_str, *ptr;
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200969 LY_ARRAY_COUNT_TYPE u, v, action;
Michal Vasko14654712020-02-06 08:35:21 +0100970
971 assert(val1_p && val2_p);
972
973 first = *((struct lyd_node **)val1_p);
974 second = *((struct lyd_node **)val2_p);
Michal Vasko41e630c2021-07-23 12:47:18 +0200975 action = (uintptr_t)cb_data;
Michal Vasko14654712020-02-06 08:35:21 +0100976
977 assert(first && (first->schema->nodetype == LYS_LIST));
978 assert(second && (second->schema == first->schema));
979
980 ctx = first->schema->module->ctx;
981
982 slist = (struct lysc_node_list *)first->schema;
983
984 /* compare unique leaves */
985 if (action > 0) {
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200986 u = action - 1;
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200987 if (u < LY_ARRAY_COUNT(slist->uniques)) {
Michal Vasko14654712020-02-06 08:35:21 +0100988 goto uniquecheck;
989 }
990 }
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200991 LY_ARRAY_FOR(slist->uniques, u) {
Michal Vasko14654712020-02-06 08:35:21 +0100992uniquecheck:
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200993 LY_ARRAY_FOR(slist->uniques[u], v) {
Michal Vasko14654712020-02-06 08:35:21 +0100994 /* first */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200995 diter = lyd_val_uniq_find_leaf(slist->uniques[u][v], first);
Michal Vasko14654712020-02-06 08:35:21 +0100996 if (diter) {
997 val1 = &((struct lyd_node_term *)diter)->value;
998 } else {
999 /* use default value */
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001000 val1 = slist->uniques[u][v]->dflt;
Michal Vasko14654712020-02-06 08:35:21 +01001001 }
1002
1003 /* second */
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001004 diter = lyd_val_uniq_find_leaf(slist->uniques[u][v], second);
Michal Vasko14654712020-02-06 08:35:21 +01001005 if (diter) {
1006 val2 = &((struct lyd_node_term *)diter)->value;
1007 } else {
1008 /* use default value */
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001009 val2 = slist->uniques[u][v]->dflt;
Michal Vasko14654712020-02-06 08:35:21 +01001010 }
1011
1012 if (!val1 || !val2 || val1->realtype->plugin->compare(val1, val2)) {
1013 /* values differ or either one is not set */
1014 break;
1015 }
1016 }
Michal Vaskofd69e1d2020-07-03 11:57:17 +02001017 if (v && (v == LY_ARRAY_COUNT(slist->uniques[u]))) {
Michal Vasko14654712020-02-06 08:35:21 +01001018 /* all unique leafs are the same in this set, create this nice error */
Radek Krejci635d2b82021-01-04 11:26:51 +01001019 path1 = lyd_path(first, LYD_PATH_STD, NULL, 0);
1020 path2 = lyd_path(second, LYD_PATH_STD, NULL, 0);
Michal Vasko14654712020-02-06 08:35:21 +01001021
1022 /* use buffer to rebuild the unique string */
Radek Krejcif13b87b2020-12-01 22:02:17 +01001023#define UNIQ_BUF_SIZE 1024
1024 uniq_str = malloc(UNIQ_BUF_SIZE);
Michal Vasko14654712020-02-06 08:35:21 +01001025 uniq_str[0] = '\0';
1026 ptr = uniq_str;
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001027 LY_ARRAY_FOR(slist->uniques[u], v) {
1028 if (v) {
Michal Vasko14654712020-02-06 08:35:21 +01001029 strcpy(ptr, " ");
1030 ++ptr;
1031 }
Michal Vasko14ed9cd2021-01-28 14:16:25 +01001032 ptr = lysc_path_until((struct lysc_node *)slist->uniques[u][v], &slist->node, LYSC_PATH_LOG,
Radek Krejcif13b87b2020-12-01 22:02:17 +01001033 ptr, UNIQ_BUF_SIZE - (ptr - uniq_str));
Michal Vasko14654712020-02-06 08:35:21 +01001034 if (!ptr) {
1035 /* path will be incomplete, whatever */
1036 break;
1037 }
1038
1039 ptr += strlen(ptr);
1040 }
Radek Krejciddace2c2021-01-08 11:30:56 +01001041 LOG_LOCSET(NULL, second, NULL, NULL);
Michal Vaskoe9391c72021-10-05 10:04:56 +02001042 LOGVAL_APPTAG(ctx, "data-not-unique", LY_VCODE_NOUNIQ, uniq_str, path1, path2);
Radek Krejciddace2c2021-01-08 11:30:56 +01001043 LOG_LOCBACK(0, 1, 0, 0);
Michal Vasko14654712020-02-06 08:35:21 +01001044
1045 free(path1);
1046 free(path2);
1047 free(uniq_str);
Radek Krejcif13b87b2020-12-01 22:02:17 +01001048#undef UNIQ_BUF_SIZE
1049
Michal Vasko14654712020-02-06 08:35:21 +01001050 return 1;
1051 }
1052
1053 if (action > 0) {
1054 /* done */
1055 return 0;
1056 }
1057 }
1058
1059 return 0;
1060}
1061
Michal Vaskobb844672020-07-03 11:06:12 +02001062/**
1063 * @brief Validate list unique leaves.
1064 *
1065 * @param[in] first First sibling to search in.
1066 * @param[in] snode Schema node to validate.
1067 * @param[in] uniques List unique arrays to validate.
1068 * @return LY_ERR value.
1069 */
Michal Vaskoa3881362020-01-21 15:57:35 +01001070static LY_ERR
Michal Vaskobb844672020-07-03 11:06:12 +02001071lyd_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 +01001072{
Michal Vaskob1b5c262020-03-05 14:29:47 +01001073 const struct lyd_node *diter;
Michal Vasko14654712020-02-06 08:35:21 +01001074 struct ly_set *set;
Michal Vaskofd69e1d2020-07-03 11:57:17 +02001075 LY_ARRAY_COUNT_TYPE u, v, x = 0;
Michal Vasko14654712020-02-06 08:35:21 +01001076 LY_ERR ret = LY_SUCCESS;
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001077 uint32_t hash, i, size = 0;
Radek Krejci813c02d2021-04-26 10:29:19 +02001078 size_t key_len;
1079 ly_bool dyn;
1080 const void *hash_key;
Michal Vasko41e630c2021-07-23 12:47:18 +02001081 void *cb_data;
Michal Vasko14654712020-02-06 08:35:21 +01001082 struct hash_table **uniqtables = NULL;
1083 struct lyd_value *val;
1084 struct ly_ctx *ctx = snode->module->ctx;
1085
1086 assert(uniques);
1087
1088 /* get all list instances */
Radek Krejciba03a5a2020-08-27 14:40:41 +02001089 LY_CHECK_RET(ly_set_new(&set));
Michal Vaskob1b5c262020-03-05 14:29:47 +01001090 LY_LIST_FOR(first, diter) {
Michal Vasko9b368d32020-02-14 13:53:31 +01001091 if (diter->schema == snode) {
Radek Krejci3d92e442020-10-12 12:48:13 +02001092 ret = ly_set_add(set, (void *)diter, 1, NULL);
Michal Vaskob0099a92020-08-31 14:55:23 +02001093 LY_CHECK_GOTO(ret, cleanup);
Michal Vasko9b368d32020-02-14 13:53:31 +01001094 }
1095 }
Michal Vasko14654712020-02-06 08:35:21 +01001096
1097 if (set->count == 2) {
1098 /* simple comparison */
1099 if (lyd_val_uniq_list_equal(&set->objs[0], &set->objs[1], 0, (void *)0)) {
1100 /* instance duplication */
1101 ret = LY_EVALID;
1102 goto cleanup;
1103 }
1104 } else if (set->count > 2) {
1105 /* use hashes for comparison */
Radek Krejcif13b87b2020-12-01 22:02:17 +01001106 /* first, allocate the table, the size depends on number of items in the set,
1107 * the following code detects number of upper zero bits in the items' counter value ... */
1108 for (i = (sizeof set->count * CHAR_BIT) - 1; i > 0; i--) {
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001109 size = set->count << i;
1110 size = size >> i;
1111 if (size == set->count) {
Michal Vasko14654712020-02-06 08:35:21 +01001112 break;
1113 }
1114 }
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001115 LY_CHECK_ERR_GOTO(!i, LOGINT(ctx); ret = LY_EINT, cleanup);
Radek Krejcif13b87b2020-12-01 22:02:17 +01001116 /* ... and then we convert it to the position of the highest non-zero bit ... */
1117 i = (sizeof set->count * CHAR_BIT) - i;
1118 /* ... and by using it to shift 1 to the left we get the closest sufficient hash table size */
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001119 size = 1 << i;
Michal Vasko14654712020-02-06 08:35:21 +01001120
Michal Vaskofd69e1d2020-07-03 11:57:17 +02001121 uniqtables = malloc(LY_ARRAY_COUNT(uniques) * sizeof *uniqtables);
Michal Vasko14654712020-02-06 08:35:21 +01001122 LY_CHECK_ERR_GOTO(!uniqtables, LOGMEM(ctx); ret = LY_EMEM, cleanup);
Michal Vaskofd69e1d2020-07-03 11:57:17 +02001123 x = LY_ARRAY_COUNT(uniques);
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001124 for (v = 0; v < x; v++) {
Michal Vasko41e630c2021-07-23 12:47:18 +02001125 cb_data = (void *)(uintptr_t)(v + 1L);
1126 uniqtables[v] = lyht_new(size, sizeof(struct lyd_node *), lyd_val_uniq_list_equal, cb_data, 0);
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001127 LY_CHECK_ERR_GOTO(!uniqtables[v], LOGMEM(ctx); ret = LY_EMEM, cleanup);
Michal Vasko14654712020-02-06 08:35:21 +01001128 }
1129
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001130 for (i = 0; i < set->count; i++) {
Michal Vasko14654712020-02-06 08:35:21 +01001131 /* loop for unique - get the hash for the instances */
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001132 for (u = 0; u < x; u++) {
Michal Vasko14654712020-02-06 08:35:21 +01001133 val = NULL;
Michal Vaskofd69e1d2020-07-03 11:57:17 +02001134 for (v = hash = 0; v < LY_ARRAY_COUNT(uniques[u]); v++) {
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001135 diter = lyd_val_uniq_find_leaf(uniques[u][v], set->objs[i]);
Michal Vasko14654712020-02-06 08:35:21 +01001136 if (diter) {
1137 val = &((struct lyd_node_term *)diter)->value;
1138 } else {
1139 /* use default value */
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001140 val = uniques[u][v]->dflt;
Michal Vasko14654712020-02-06 08:35:21 +01001141 }
1142 if (!val) {
1143 /* unique item not present nor has default value */
1144 break;
1145 }
1146
Radek Krejci813c02d2021-04-26 10:29:19 +02001147 /* get hash key */
Michal Vaskodcfac2c2021-05-10 11:36:37 +02001148 hash_key = val->realtype->plugin->print(NULL, val, LY_VALUE_LYB, NULL, &dyn, &key_len);
Radek Krejci813c02d2021-04-26 10:29:19 +02001149 hash = dict_hash_multi(hash, hash_key, key_len);
1150 if (dyn) {
1151 free((void *)hash_key);
Michal Vasko14654712020-02-06 08:35:21 +01001152 }
1153 }
1154 if (!val) {
1155 /* skip this list instance since its unique set is incomplete */
1156 continue;
1157 }
1158
1159 /* finish the hash value */
1160 hash = dict_hash_multi(hash, NULL, 0);
1161
1162 /* insert into the hashtable */
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001163 ret = lyht_insert(uniqtables[u], &set->objs[i], hash, NULL);
Michal Vasko14654712020-02-06 08:35:21 +01001164 if (ret == LY_EEXIST) {
1165 /* instance duplication */
1166 ret = LY_EVALID;
1167 }
1168 LY_CHECK_GOTO(ret != LY_SUCCESS, cleanup);
1169 }
1170 }
1171 }
1172
1173cleanup:
1174 ly_set_free(set, NULL);
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001175 for (v = 0; v < x; v++) {
1176 if (!uniqtables[v]) {
Michal Vasko14654712020-02-06 08:35:21 +01001177 /* failed when allocating uniquetables[j], following j are not allocated */
1178 break;
1179 }
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001180 lyht_free(uniqtables[v]);
Michal Vasko14654712020-02-06 08:35:21 +01001181 }
1182 free(uniqtables);
1183
1184 return ret;
Michal Vaskoa3881362020-01-21 15:57:35 +01001185}
1186
Michal Vaskobb844672020-07-03 11:06:12 +02001187/**
1188 * @brief Validate data siblings based on generic schema node restrictions, recursively for schema-only nodes.
1189 *
1190 * @param[in] first First sibling to search in.
Michal Vaskobd4db892020-11-23 16:58:20 +01001191 * @param[in] parent Data parent.
Michal Vaskobb844672020-07-03 11:06:12 +02001192 * @param[in] sparent Schema parent of the nodes to check.
1193 * @param[in] mod Module of the nodes to check.
1194 * @param[in] val_opts Validation options, see @ref datavalidationoptions.
Michal Vaskoe0665742021-02-11 11:08:44 +01001195 * @param[in] int_opts Internal parser options.
Michal Vaskobb844672020-07-03 11:06:12 +02001196 * @return LY_ERR value.
1197 */
Michal Vaskoa3881362020-01-21 15:57:35 +01001198static LY_ERR
Michal Vaskobd4db892020-11-23 16:58:20 +01001199lyd_validate_siblings_schema_r(const struct lyd_node *first, const struct lyd_node *parent,
Michal Vaskoe0665742021-02-11 11:08:44 +01001200 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 +01001201{
Radek Krejci2efc45b2020-12-22 16:25:44 +01001202 LY_ERR ret = LY_SUCCESS;
Michal Vasko6c16cda2021-02-04 11:05:52 +01001203 const struct lysc_node *snode = NULL, *scase;
Michal Vaskoa3881362020-01-21 15:57:35 +01001204 struct lysc_node_list *slist;
Michal Vaskod8958df2020-08-05 13:27:36 +02001205 struct lysc_node_leaflist *sllist;
Radek Krejci1deb5be2020-08-26 16:43:36 +02001206 uint32_t getnext_opts;
Michal Vaskocb7526d2020-03-30 15:08:26 +02001207
Michal Vaskoe0665742021-02-11 11:08:44 +01001208 getnext_opts = LYS_GETNEXT_WITHCHOICE | (int_opts & LYD_INTOPT_REPLY ? LYS_GETNEXT_OUTPUT : 0);
Michal Vaskocde73ac2019-11-14 16:10:27 +01001209
Michal Vaskoa3881362020-01-21 15:57:35 +01001210 /* disabled nodes are skipped by lys_getnext */
Michal Vaskocb7526d2020-03-30 15:08:26 +02001211 while ((snode = lys_getnext(snode, sparent, mod, getnext_opts))) {
Radek Krejci7931b192020-06-25 17:05:03 +02001212 if ((val_opts & LYD_VALIDATE_NO_STATE) && (snode->flags & LYS_CONFIG_R)) {
Michal Vaskoe75ecfd2020-03-06 14:12:28 +01001213 continue;
1214 }
1215
Radek Krejciddace2c2021-01-08 11:30:56 +01001216 LOG_LOCSET(snode, NULL, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +01001217
Michal Vaskoa3881362020-01-21 15:57:35 +01001218 /* check min-elements and max-elements */
Michal Vaskod8958df2020-08-05 13:27:36 +02001219 if (snode->nodetype == LYS_LIST) {
Michal Vaskoa3881362020-01-21 15:57:35 +01001220 slist = (struct lysc_node_list *)snode;
1221 if (slist->min || slist->max) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001222 ret = lyd_validate_minmax(first, parent, snode, slist->min, slist->max);
1223 LY_CHECK_GOTO(ret, error);
Michal Vaskoa3881362020-01-21 15:57:35 +01001224 }
Michal Vaskod8958df2020-08-05 13:27:36 +02001225 } else if (snode->nodetype == LYS_LEAFLIST) {
1226 sllist = (struct lysc_node_leaflist *)snode;
1227 if (sllist->min || sllist->max) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001228 ret = lyd_validate_minmax(first, parent, snode, sllist->min, sllist->max);
1229 LY_CHECK_GOTO(ret, error);
Michal Vaskod8958df2020-08-05 13:27:36 +02001230 }
Michal Vaskoacd83e72020-02-04 14:12:01 +01001231
Michal Vaskoacd83e72020-02-04 14:12:01 +01001232 } else if (snode->flags & LYS_MAND_TRUE) {
Radek Krejcif6a11002020-08-21 13:29:07 +02001233 /* check generic mandatory existence */
Radek Krejci2efc45b2020-12-22 16:25:44 +01001234 ret = lyd_validate_mandatory(first, parent, snode);
1235 LY_CHECK_GOTO(ret, error);
Michal Vaskoa3881362020-01-21 15:57:35 +01001236 }
1237
1238 /* check unique */
1239 if (snode->nodetype == LYS_LIST) {
1240 slist = (struct lysc_node_list *)snode;
1241 if (slist->uniques) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001242 ret = lyd_validate_unique(first, snode, (const struct lysc_node_leaf ***)slist->uniques);
1243 LY_CHECK_GOTO(ret, error);
Michal Vaskoa3881362020-01-21 15:57:35 +01001244 }
1245 }
1246
Michal Vasko6c16cda2021-02-04 11:05:52 +01001247 if (snode->nodetype == LYS_CHOICE) {
1248 /* find the existing case, if any */
1249 LY_LIST_FOR(lysc_node_child(snode), scase) {
1250 if (lys_getnext_data(NULL, first, NULL, scase, NULL)) {
1251 /* validate only this case */
Michal Vaskoe0665742021-02-11 11:08:44 +01001252 ret = lyd_validate_siblings_schema_r(first, parent, scase, mod, val_opts, int_opts);
Michal Vasko6c16cda2021-02-04 11:05:52 +01001253 LY_CHECK_GOTO(ret, error);
1254 break;
1255 }
1256 }
Michal Vaskoacd83e72020-02-04 14:12:01 +01001257 }
Radek Krejci2efc45b2020-12-22 16:25:44 +01001258
Radek Krejciddace2c2021-01-08 11:30:56 +01001259 LOG_LOCBACK(1, 0, 0, 0);
Michal Vaskocde73ac2019-11-14 16:10:27 +01001260 }
1261
Michal Vaskoacd83e72020-02-04 14:12:01 +01001262 return LY_SUCCESS;
Radek Krejci2efc45b2020-12-22 16:25:44 +01001263
1264error:
Radek Krejciddace2c2021-01-08 11:30:56 +01001265 LOG_LOCBACK(1, 0, 0, 0);
Radek Krejci2efc45b2020-12-22 16:25:44 +01001266 return ret;
Michal Vaskoacd83e72020-02-04 14:12:01 +01001267}
1268
Michal Vaskobb844672020-07-03 11:06:12 +02001269/**
1270 * @brief Validate obsolete nodes, only warnings are printed.
1271 *
1272 * @param[in] node Node to check.
1273 */
Michal Vaskoe75ecfd2020-03-06 14:12:28 +01001274static void
1275lyd_validate_obsolete(const struct lyd_node *node)
1276{
1277 const struct lysc_node *snode;
1278
1279 snode = node->schema;
1280 do {
1281 if (snode->flags & LYS_STATUS_OBSLT) {
1282 LOGWRN(snode->module->ctx, "Obsolete schema node \"%s\" instantiated in data.", snode->name);
1283 break;
1284 }
1285
1286 snode = snode->parent;
1287 } while (snode && (snode->nodetype & (LYS_CHOICE | LYS_CASE)));
1288}
1289
Michal Vaskobb844672020-07-03 11:06:12 +02001290/**
1291 * @brief Validate must conditions of a data node.
1292 *
1293 * @param[in] node Node to validate.
Michal Vaskoe0665742021-02-11 11:08:44 +01001294 * @param[in] int_opts Internal parser options.
Michal Vaskobb844672020-07-03 11:06:12 +02001295 * @return LY_ERR value.
1296 */
Michal Vaskocc048b22020-03-27 15:52:38 +01001297static LY_ERR
Michal Vaskoe0665742021-02-11 11:08:44 +01001298lyd_validate_must(const struct lyd_node *node, uint32_t int_opts)
Michal Vaskocc048b22020-03-27 15:52:38 +01001299{
Michal Vaskoa1db2342021-07-19 12:23:23 +02001300 LY_ERR ret;
Michal Vaskocc048b22020-03-27 15:52:38 +01001301 struct lyxp_set xp_set;
1302 struct lysc_must *musts;
1303 const struct lyd_node *tree;
Radek Krejci9a3823e2021-01-27 20:26:46 +01001304 const struct lysc_node *schema;
Michal Vaskoe9391c72021-10-05 10:04:56 +02001305 const char *emsg, *eapptag;
Michal Vaskofd69e1d2020-07-03 11:57:17 +02001306 LY_ARRAY_COUNT_TYPE u;
Michal Vaskocc048b22020-03-27 15:52:38 +01001307
Michal Vaskoe0665742021-02-11 11:08:44 +01001308 assert((int_opts & (LYD_INTOPT_RPC | LYD_INTOPT_REPLY)) != (LYD_INTOPT_RPC | LYD_INTOPT_REPLY));
1309 assert((int_opts & (LYD_INTOPT_ACTION | LYD_INTOPT_REPLY)) != (LYD_INTOPT_ACTION | LYD_INTOPT_REPLY));
1310
Radek Krejci9a3823e2021-01-27 20:26:46 +01001311 if (node->schema->nodetype & (LYS_ACTION | LYS_RPC)) {
Michal Vaskoe0665742021-02-11 11:08:44 +01001312 if (int_opts & (LYD_INTOPT_RPC | LYD_INTOPT_ACTION)) {
Radek Krejci9a3823e2021-01-27 20:26:46 +01001313 schema = &((struct lysc_node_action *)node->schema)->input.node;
Michal Vaskoe0665742021-02-11 11:08:44 +01001314 } else if (int_opts & LYD_INTOPT_REPLY) {
Radek Krejci9a3823e2021-01-27 20:26:46 +01001315 schema = &((struct lysc_node_action *)node->schema)->output.node;
Michal Vaskocb7526d2020-03-30 15:08:26 +02001316 } else {
Michal Vaskoa1db2342021-07-19 12:23:23 +02001317 LOGINT_RET(LYD_CTX(node));
Michal Vaskocb7526d2020-03-30 15:08:26 +02001318 }
Radek Krejci9a3823e2021-01-27 20:26:46 +01001319 } else {
1320 schema = node->schema;
Michal Vaskocc048b22020-03-27 15:52:38 +01001321 }
Radek Krejci9a3823e2021-01-27 20:26:46 +01001322 musts = lysc_node_musts(schema);
Michal Vaskocc048b22020-03-27 15:52:38 +01001323 if (!musts) {
1324 /* no must to evaluate */
1325 return LY_SUCCESS;
1326 }
1327
1328 /* find first top-level node */
Michal Vasko9e685082021-01-29 14:49:09 +01001329 for (tree = node; tree->parent; tree = lyd_parent(tree)) {}
Michal Vaskof9221e62021-02-04 12:10:14 +01001330 tree = lyd_first_sibling(tree);
Michal Vaskocc048b22020-03-27 15:52:38 +01001331
1332 LY_ARRAY_FOR(musts, u) {
1333 memset(&xp_set, 0, sizeof xp_set);
1334
1335 /* evaluate must */
Michal Vaskoa1db2342021-07-19 12:23:23 +02001336 ret = lyxp_eval(LYD_CTX(node), musts[u].cond, node->schema->module, LY_VALUE_SCHEMA_RESOLVED,
aPiecekfba75362021-10-07 12:39:48 +02001337 musts[u].prefixes, node, tree, NULL, &xp_set, LYXP_SCHEMA);
Michal Vaskoa1db2342021-07-19 12:23:23 +02001338 if (ret == LY_EINCOMPLETE) {
1339 LOGINT_RET(LYD_CTX(node));
1340 } else if (ret) {
1341 return ret;
1342 }
Michal Vaskocc048b22020-03-27 15:52:38 +01001343
1344 /* check the result */
1345 lyxp_set_cast(&xp_set, LYXP_SET_BOOLEAN);
Michal Vasko004d3152020-06-11 19:59:22 +02001346 if (!xp_set.val.bln) {
Michal Vaskoe9391c72021-10-05 10:04:56 +02001347 /* use specific error information */
1348 emsg = musts[u].emsg;
1349 eapptag = musts[u].eapptag ? musts[u].eapptag : "must-violation";
1350 if (emsg) {
1351 LOGVAL_APPTAG(LYD_CTX(node), eapptag, LYVE_DATA, "%s", emsg);
1352 } else {
1353 LOGVAL_APPTAG(LYD_CTX(node), eapptag, LY_VCODE_NOMUST, musts[u].cond->expr);
1354 }
Michal Vaskocc048b22020-03-27 15:52:38 +01001355 return LY_EVALID;
1356 }
1357 }
1358
1359 return LY_SUCCESS;
1360}
1361
Michal Vaskoe0665742021-02-11 11:08:44 +01001362/**
1363 * @brief Perform all remaining validation tasks, the data tree must be final when calling this function.
1364 *
1365 * @param[in] first First sibling.
1366 * @param[in] parent Data parent.
1367 * @param[in] sparent Schema parent of the siblings, NULL for top-level siblings.
1368 * @param[in] mod Module of the siblings, NULL for nested siblings.
1369 * @param[in] val_opts Validation options (@ref datavalidationoptions).
1370 * @param[in] int_opts Internal parser options.
1371 * @return LY_ERR value.
1372 */
1373static LY_ERR
Michal Vaskobd4db892020-11-23 16:58:20 +01001374lyd_validate_final_r(struct lyd_node *first, const struct lyd_node *parent, const struct lysc_node *sparent,
Michal Vaskoe0665742021-02-11 11:08:44 +01001375 const struct lys_module *mod, uint32_t val_opts, uint32_t int_opts)
Michal Vaskoacd83e72020-02-04 14:12:01 +01001376{
Michal Vasko22e8f1f2021-12-02 09:26:06 +01001377 LY_ERR r;
1378 const char *innode;
Radek Krejci7f769d72020-07-11 23:13:56 +02001379 struct lyd_node *next = NULL, *node;
Michal Vaskoacd83e72020-02-04 14:12:01 +01001380
Michal Vasko14654712020-02-06 08:35:21 +01001381 /* validate all restrictions of nodes themselves */
Michal Vaskob1b5c262020-03-05 14:29:47 +01001382 LY_LIST_FOR_SAFE(first, next, node) {
Michal Vasko19034e22021-07-19 12:24:14 +02001383 if (!node->parent && mod && (lyd_owner_module(node) != mod)) {
Michal Vaskob1b5c262020-03-05 14:29:47 +01001384 /* all top-level data from this module checked */
1385 break;
Michal Vaskof03ed032020-03-04 13:31:44 +01001386 }
1387
Radek Krejciddace2c2021-01-08 11:30:56 +01001388 LOG_LOCSET(node->schema, node, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +01001389
Michal Vaskoa8c61722020-03-27 16:59:32 +01001390 /* opaque data */
1391 if (!node->schema) {
Michal Vasko5900da42021-08-04 11:02:43 +02001392 LOGVAL(LYD_CTX(node), LYVE_DATA, "Invalid opaque node \"%s\" found.", ((struct lyd_node_opaq *)node)->name.name);
Michal Vasko22e8f1f2021-12-02 09:26:06 +01001393 LOG_LOCBACK(1, 1, 0, 0);
Michal Vaskoa8c61722020-03-27 16:59:32 +01001394 return LY_EVALID;
1395 }
1396
Michal Vasko8d289f92021-12-02 10:11:00 +01001397 /* no state/input/output/op data */
Michal Vasko22e8f1f2021-12-02 09:26:06 +01001398 innode = NULL;
Radek Krejci7931b192020-06-25 17:05:03 +02001399 if ((val_opts & LYD_VALIDATE_NO_STATE) && (node->schema->flags & LYS_CONFIG_R)) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001400 innode = "state";
Michal Vaskoe0665742021-02-11 11:08:44 +01001401 } else if ((int_opts & (LYD_INTOPT_RPC | LYD_INTOPT_ACTION)) && (node->schema->flags & LYS_IS_OUTPUT)) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001402 innode = "output";
Michal Vaskoe0665742021-02-11 11:08:44 +01001403 } else if ((int_opts & LYD_INTOPT_REPLY) && (node->schema->flags & LYS_IS_INPUT)) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001404 innode = "input";
Michal Vasko8d289f92021-12-02 10:11:00 +01001405 } else if (!(int_opts & (LYD_INTOPT_RPC | LYD_INTOPT_REPLY)) && (node->schema->nodetype == LYS_RPC)) {
1406 innode = "rpc";
1407 } else if (!(int_opts & (LYD_INTOPT_ACTION | LYD_INTOPT_REPLY)) && (node->schema->nodetype == LYS_ACTION)) {
1408 innode = "action";
1409 } else if (!(int_opts & LYD_INTOPT_NOTIF) && (node->schema->nodetype == LYS_NOTIF)) {
1410 innode = "notification";
Michal Vasko22e8f1f2021-12-02 09:26:06 +01001411 }
1412 if (innode) {
1413 LOGVAL(LYD_CTX(node), LY_VCODE_UNEXPNODE, innode, node->schema->name);
1414 LOG_LOCBACK(1, 1, 0, 0);
1415 return LY_EVALID;
Michal Vasko5b37a352020-03-06 13:38:33 +01001416 }
1417
Michal Vaskoe75ecfd2020-03-06 14:12:28 +01001418 /* obsolete data */
1419 lyd_validate_obsolete(node);
1420
Michal Vaskocc048b22020-03-27 15:52:38 +01001421 /* node's musts */
Michal Vasko22e8f1f2021-12-02 09:26:06 +01001422 if ((r = lyd_validate_must(node, int_opts))) {
1423 LOG_LOCBACK(1, 1, 0, 0);
1424 return r;
1425 }
Michal Vaskocc048b22020-03-27 15:52:38 +01001426
Michal Vasko53d97a12020-11-05 17:39:10 +01001427 /* node value was checked by plugins */
Radek Krejci2efc45b2020-12-22 16:25:44 +01001428
Michal Vasko22e8f1f2021-12-02 09:26:06 +01001429 /* next iter */
Radek Krejciddace2c2021-01-08 11:30:56 +01001430 LOG_LOCBACK(1, 1, 0, 0);
Michal Vasko14654712020-02-06 08:35:21 +01001431 }
Michal Vaskocde73ac2019-11-14 16:10:27 +01001432
Michal Vasko14654712020-02-06 08:35:21 +01001433 /* validate schema-based restrictions */
Michal Vaskoe0665742021-02-11 11:08:44 +01001434 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 +01001435
Michal Vaskob1b5c262020-03-05 14:29:47 +01001436 LY_LIST_FOR(first, node) {
Michal Vasko19034e22021-07-19 12:24:14 +02001437 if (!node->parent && mod && (lyd_owner_module(node) != mod)) {
1438 /* all top-level data from this module checked */
1439 break;
1440 }
1441
Michal Vasko14654712020-02-06 08:35:21 +01001442 /* validate all children recursively */
Michal Vaskoe0665742021-02-11 11:08:44 +01001443 LY_CHECK_RET(lyd_validate_final_r(lyd_child(node), node, node->schema, NULL, val_opts, int_opts));
Michal Vaskocde73ac2019-11-14 16:10:27 +01001444
Michal Vaskob1b5c262020-03-05 14:29:47 +01001445 /* set default for containers */
aPiecekc5f36a72021-05-18 14:12:31 +02001446 if (node->schema && (node->schema->nodetype == LYS_CONTAINER) && !(node->schema->flags & LYS_PRESENCE)) {
Radek Krejcia1c1e542020-09-29 16:06:52 +02001447 LY_LIST_FOR(lyd_child(node), next) {
Michal Vaskob1b5c262020-03-05 14:29:47 +01001448 if (!(next->flags & LYD_DEFAULT)) {
1449 break;
1450 }
Michal Vaskoa3881362020-01-21 15:57:35 +01001451 }
Michal Vaskob1b5c262020-03-05 14:29:47 +01001452 if (!next) {
1453 node->flags |= LYD_DEFAULT;
1454 }
Michal Vasko9b368d32020-02-14 13:53:31 +01001455 }
1456 }
1457
1458 return LY_SUCCESS;
1459}
1460
Radek Krejci7931b192020-06-25 17:05:03 +02001461/**
Michal Vaskobb844672020-07-03 11:06:12 +02001462 * @brief Validate the whole data subtree.
1463 *
1464 * @param[in] root Subtree root.
Michal Vaskoe0665742021-02-11 11:08:44 +01001465 * @param[in,out] node_when Set for nodes with when conditions.
Radek Krejci4f2e3e52021-03-30 14:20:28 +02001466 * @param[in,out] node_exts Set for nodes and extension instances with validation plugin callback.
Michal Vasko32711382020-12-03 14:14:31 +01001467 * @param[in,out] node_types Set for unres node types.
1468 * @param[in,out] meta_types Set for unres metadata types.
Michal Vasko29adfbe2020-12-08 17:12:03 +01001469 * @param[in] impl_opts Implicit options, see @ref implicitoptions.
Michal Vasko8104fd42020-07-13 11:09:51 +02001470 * @param[in,out] diff Validation diff.
Michal Vaskobb844672020-07-03 11:06:12 +02001471 * @return LY_ERR value.
Radek Krejci7931b192020-06-25 17:05:03 +02001472 */
Michal Vaskob1b5c262020-03-05 14:29:47 +01001473static LY_ERR
Radek Krejci4f2e3e52021-03-30 14:20:28 +02001474lyd_validate_subtree(struct lyd_node *root, struct ly_set *node_when, struct ly_set *node_exts, struct ly_set *node_types,
Michal Vaskoe0665742021-02-11 11:08:44 +01001475 struct ly_set *meta_types, uint32_t impl_opts, struct lyd_node **diff)
Michal Vaskofea12c62020-03-30 11:00:15 +02001476{
1477 const struct lyd_meta *meta;
Michal Vasko56daf732020-08-10 10:57:18 +02001478 struct lyd_node *node;
Michal Vaskofea12c62020-03-30 11:00:15 +02001479
Michal Vasko56daf732020-08-10 10:57:18 +02001480 LYD_TREE_DFS_BEGIN(root, node) {
Michal Vasko5900da42021-08-04 11:02:43 +02001481 if (!node->schema) {
aPiecek18a844e2021-08-10 11:06:24 +02001482 goto next_node;
Michal Vasko5900da42021-08-04 11:02:43 +02001483 }
1484
Michal Vasko0275cf62020-11-05 17:40:30 +01001485 LY_LIST_FOR(node->meta, meta) {
Radek Krejci1b2eef82021-02-17 11:17:27 +01001486 if ((*(const struct lysc_type **)meta->annotation->substmts[ANNOTATION_SUBSTMT_TYPE].storage)->plugin->validate) {
Michal Vasko0275cf62020-11-05 17:40:30 +01001487 /* metadata type resolution */
Michal Vasko32711382020-12-03 14:14:31 +01001488 LY_CHECK_RET(ly_set_add(meta_types, (void *)meta, 1, NULL));
Michal Vaskofea12c62020-03-30 11:00:15 +02001489 }
Michal Vasko0275cf62020-11-05 17:40:30 +01001490 }
Michal Vaskofea12c62020-03-30 11:00:15 +02001491
Michal Vasko0275cf62020-11-05 17:40:30 +01001492 if ((node->schema->nodetype & LYD_NODE_TERM) && ((struct lysc_node_leaf *)node->schema)->type->plugin->validate) {
1493 /* node type resolution */
Michal Vasko32711382020-12-03 14:14:31 +01001494 LY_CHECK_RET(ly_set_add(node_types, (void *)node, 1, NULL));
Michal Vasko0275cf62020-11-05 17:40:30 +01001495 } else if (node->schema->nodetype & LYD_NODE_INNER) {
1496 /* new node validation, autodelete */
Michal Vaskoe0665742021-02-11 11:08:44 +01001497 LY_CHECK_RET(lyd_validate_new(lyd_node_child_p(node), node->schema, NULL, diff));
Michal Vaskofea12c62020-03-30 11:00:15 +02001498
Michal Vasko0275cf62020-11-05 17:40:30 +01001499 /* add nested defaults */
Radek Krejci4f2e3e52021-03-30 14:20:28 +02001500 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 +01001501 }
Michal Vaskofea12c62020-03-30 11:00:15 +02001502
Michal Vaskof4d67ea2021-03-31 13:53:21 +02001503 if (lysc_has_when(node->schema)) {
Michal Vasko0275cf62020-11-05 17:40:30 +01001504 /* when evaluation */
Michal Vasko32711382020-12-03 14:14:31 +01001505 LY_CHECK_RET(ly_set_add(node_when, (void *)node, 1, NULL));
Michal Vaskofea12c62020-03-30 11:00:15 +02001506 }
Radek Krejci4f2e3e52021-03-30 14:20:28 +02001507 LY_CHECK_RET(lysc_node_ext_tovalidate(node_exts, node));
Michal Vaskofea12c62020-03-30 11:00:15 +02001508
aPiecek18a844e2021-08-10 11:06:24 +02001509next_node:
Michal Vasko56daf732020-08-10 10:57:18 +02001510 LYD_TREE_DFS_END(root, node);
Michal Vaskofea12c62020-03-30 11:00:15 +02001511 }
1512
1513 return LY_SUCCESS;
1514}
1515
Michal Vaskoe0665742021-02-11 11:08:44 +01001516LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02001517lyd_validate(struct lyd_node **tree, const struct lys_module *module, const struct ly_ctx *ctx, uint32_t val_opts,
Radek Krejci4f2e3e52021-03-30 14:20:28 +02001518 ly_bool validate_subtree, struct ly_set *node_when_p, struct ly_set *node_exts_p,
1519 struct ly_set *node_types_p, struct ly_set *meta_types_p, struct lyd_node **diff)
Michal Vaskof03ed032020-03-04 13:31:44 +01001520{
1521 LY_ERR ret = LY_SUCCESS;
Michal Vasko73e47212020-12-03 14:20:16 +01001522 struct lyd_node *first, *next, **first2, *iter;
Michal Vaskob1b5c262020-03-05 14:29:47 +01001523 const struct lys_module *mod;
Radek Krejci4f2e3e52021-03-30 14:20:28 +02001524 struct ly_set node_types = {0}, meta_types = {0}, node_when = {0}, node_exts = {0};
Michal Vaskob1b5c262020-03-05 14:29:47 +01001525 uint32_t i = 0;
Michal Vaskof03ed032020-03-04 13:31:44 +01001526
Michal Vaskoe0665742021-02-11 11:08:44 +01001527 assert(tree && ctx);
Radek Krejci4f2e3e52021-03-30 14:20:28 +02001528 assert((node_when_p && node_exts_p && node_types_p && meta_types_p) ||
1529 (!node_when_p && !node_exts_p && !node_types_p && !meta_types_p));
Michal Vaskoe0665742021-02-11 11:08:44 +01001530
1531 if (!node_when_p) {
1532 node_when_p = &node_when;
Radek Krejci4f2e3e52021-03-30 14:20:28 +02001533 node_exts_p = &node_exts;
Michal Vaskoe0665742021-02-11 11:08:44 +01001534 node_types_p = &node_types;
1535 meta_types_p = &meta_types;
Michal Vasko8104fd42020-07-13 11:09:51 +02001536 }
Michal Vaskof03ed032020-03-04 13:31:44 +01001537
Michal Vaskob1b5c262020-03-05 14:29:47 +01001538 next = *tree;
1539 while (1) {
Radek Krejci7931b192020-06-25 17:05:03 +02001540 if (val_opts & LYD_VALIDATE_PRESENT) {
Michal Vaskob1b5c262020-03-05 14:29:47 +01001541 mod = lyd_data_next_module(&next, &first);
1542 } else {
Michal Vasko26e80012020-07-08 10:55:46 +02001543 mod = lyd_mod_next_module(next, module, ctx, &i, &first);
Michal Vaskof03ed032020-03-04 13:31:44 +01001544 }
Michal Vaskob1b5c262020-03-05 14:29:47 +01001545 if (!mod) {
1546 break;
1547 }
Michal Vasko7c4cf1e2020-06-22 10:04:30 +02001548 if (!first || (first == *tree)) {
Michal Vaskob1b5c262020-03-05 14:29:47 +01001549 /* make sure first2 changes are carried to tree */
1550 first2 = tree;
1551 } else {
1552 first2 = &first;
1553 }
1554
1555 /* validate new top-level nodes of this module, autodelete */
Michal Vasko8104fd42020-07-13 11:09:51 +02001556 ret = lyd_validate_new(first2, NULL, mod, diff);
1557 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskob1b5c262020-03-05 14:29:47 +01001558
Radek Krejci7be7b9f2021-02-24 11:46:27 +01001559 /* add all top-level defaults for this module, if going to validate subtree, do not add into unres sets
1560 * (lyd_validate_subtree() adds all the nodes in that case) */
Radek Krejci4f2e3e52021-03-30 14:20:28 +02001561 ret = lyd_new_implicit_r(NULL, first2, NULL, mod, validate_subtree ? NULL : node_when_p, validate_subtree ? NULL : node_exts_p,
Michal Vaskoc43c8ab2021-03-05 13:32:44 +01001562 validate_subtree ? NULL : node_types_p, (val_opts & LYD_VALIDATE_NO_STATE) ? LYD_IMPLICIT_NO_STATE : 0, diff);
Michal Vasko8104fd42020-07-13 11:09:51 +02001563 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskob1b5c262020-03-05 14:29:47 +01001564
Michal Vaskod3bb12f2020-12-04 14:33:09 +01001565 /* our first module node pointer may no longer be the first */
Michal Vasko598063b2021-07-19 11:39:05 +02001566 first = *first2;
1567 lyd_first_module_sibling(&first, mod);
1568 if (!first || (first == *tree)) {
1569 first2 = tree;
1570 } else {
1571 first2 = &first;
Michal Vaskod3bb12f2020-12-04 14:33:09 +01001572 }
1573
Michal Vaskoe0665742021-02-11 11:08:44 +01001574 if (validate_subtree) {
1575 /* process nested nodes */
1576 LY_LIST_FOR(*first2, iter) {
Michal Vasko0e72b7a2021-07-16 14:53:27 +02001577 if (lyd_owner_module(iter) != mod) {
1578 break;
1579 }
1580
Radek Krejci4f2e3e52021-03-30 14:20:28 +02001581 ret = lyd_validate_subtree(iter, node_when_p, node_exts_p, node_types_p, meta_types_p,
Michal Vaskoe0665742021-02-11 11:08:44 +01001582 (val_opts & LYD_VALIDATE_NO_STATE) ? LYD_IMPLICIT_NO_STATE : 0, diff);
1583 LY_CHECK_GOTO(ret, cleanup);
1584 }
Michal Vaskob1b5c262020-03-05 14:29:47 +01001585 }
1586
1587 /* finish incompletely validated terminal values/attributes and when conditions */
Michal Vasko976ec432021-12-06 15:42:22 +01001588 ret = lyd_validate_unres(first2, mod, node_when_p, 0, node_exts_p, node_types_p, meta_types_p, diff);
Michal Vaskob1b5c262020-03-05 14:29:47 +01001589 LY_CHECK_GOTO(ret, cleanup);
1590
1591 /* perform final validation that assumes the data tree is final */
Michal Vaskobd4db892020-11-23 16:58:20 +01001592 ret = lyd_validate_final_r(*first2, NULL, NULL, mod, val_opts, 0);
Michal Vasko8104fd42020-07-13 11:09:51 +02001593 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskof03ed032020-03-04 13:31:44 +01001594 }
1595
Michal Vaskof03ed032020-03-04 13:31:44 +01001596cleanup:
Michal Vaskoe0665742021-02-11 11:08:44 +01001597 ly_set_erase(&node_when, NULL);
Radek Krejci4f2e3e52021-03-30 14:20:28 +02001598 ly_set_erase(&node_exts, NULL);
Michal Vasko32711382020-12-03 14:14:31 +01001599 ly_set_erase(&node_types, NULL);
1600 ly_set_erase(&meta_types, NULL);
Michal Vaskof03ed032020-03-04 13:31:44 +01001601 return ret;
1602}
Michal Vaskob1b5c262020-03-05 14:29:47 +01001603
1604API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02001605lyd_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 +01001606{
Michal Vaskoe0665742021-02-11 11:08:44 +01001607 LY_CHECK_ARG_RET(NULL, tree, *tree || ctx, LY_EINVAL);
Michal Vasko892f5bf2021-11-24 10:41:05 +01001608 LY_CHECK_CTX_EQUAL_RET(*tree ? LYD_CTX(*tree) : NULL, ctx, LY_EINVAL);
Michal Vaskoe0665742021-02-11 11:08:44 +01001609 if (!ctx) {
1610 ctx = LYD_CTX(*tree);
1611 }
1612 if (diff) {
1613 *diff = NULL;
1614 }
1615
Radek Krejci4f2e3e52021-03-30 14:20:28 +02001616 return lyd_validate(tree, NULL, ctx, val_opts, 1, NULL, NULL, NULL, NULL, diff);
Michal Vaskob1b5c262020-03-05 14:29:47 +01001617}
1618
1619API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02001620lyd_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 +01001621{
Michal Vaskoe0665742021-02-11 11:08:44 +01001622 LY_CHECK_ARG_RET(NULL, tree, *tree || module, LY_EINVAL);
Michal Vasko892f5bf2021-11-24 10:41:05 +01001623 LY_CHECK_CTX_EQUAL_RET(*tree ? LYD_CTX(*tree) : NULL, module ? module->ctx : NULL, LY_EINVAL);
Michal Vaskoe0665742021-02-11 11:08:44 +01001624 if (diff) {
1625 *diff = NULL;
1626 }
1627
Radek Krejci4f2e3e52021-03-30 14:20:28 +02001628 return lyd_validate(tree, module, (*tree) ? LYD_CTX(*tree) : module->ctx, val_opts, 1, NULL, NULL, NULL, NULL, diff);
Michal Vaskob1b5c262020-03-05 14:29:47 +01001629}
Michal Vaskofea12c62020-03-30 11:00:15 +02001630
Michal Vaskobb844672020-07-03 11:06:12 +02001631/**
1632 * @brief Find nodes for merging an operation into data tree for validation.
1633 *
1634 * @param[in] op_tree Full operation data tree.
1635 * @param[in] op_node Operation node itself.
1636 * @param[in] tree Data tree to be merged into.
1637 * @param[out] op_subtree Operation subtree to merge.
Michal Vasko2f03d222020-12-09 18:15:51 +01001638 * @param[out] tree_sibling Data tree sibling to merge next to, is set if @p tree_parent is NULL.
1639 * @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 +02001640 */
Michal Vaskocb7526d2020-03-30 15:08:26 +02001641static void
Michal Vaskobb844672020-07-03 11:06:12 +02001642lyd_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 +01001643 struct lyd_node **op_subtree, struct lyd_node **tree_sibling, struct lyd_node **tree_parent)
Michal Vaskofea12c62020-03-30 11:00:15 +02001644{
Michal Vaskocb7526d2020-03-30 15:08:26 +02001645 const struct lyd_node *tree_iter, *op_iter;
1646 struct lyd_node *match;
Michal Vaskofea12c62020-03-30 11:00:15 +02001647 uint32_t i, cur_depth, op_depth;
Michal Vaskofea12c62020-03-30 11:00:15 +02001648
Michal Vasko2f03d222020-12-09 18:15:51 +01001649 *op_subtree = NULL;
1650 *tree_sibling = NULL;
1651 *tree_parent = NULL;
1652
Michal Vaskocb7526d2020-03-30 15:08:26 +02001653 /* learn op depth (top-level being depth 0) */
Michal Vaskofea12c62020-03-30 11:00:15 +02001654 op_depth = 0;
Michal Vasko9e685082021-01-29 14:49:09 +01001655 for (op_iter = op_node; op_iter != op_tree; op_iter = lyd_parent(op_iter)) {
Michal Vaskofea12c62020-03-30 11:00:15 +02001656 ++op_depth;
1657 }
1658
1659 /* find where to merge op */
1660 tree_iter = tree;
1661 cur_depth = op_depth;
Michal Vasko2f03d222020-12-09 18:15:51 +01001662 while (cur_depth && tree_iter) {
Michal Vaskofea12c62020-03-30 11:00:15 +02001663 /* find op iter in tree */
1664 lyd_find_sibling_first(tree_iter, op_iter, &match);
1665 if (!match) {
1666 break;
1667 }
1668
1669 /* move tree_iter */
Radek Krejcia1c1e542020-09-29 16:06:52 +02001670 tree_iter = lyd_child(match);
Michal Vaskofea12c62020-03-30 11:00:15 +02001671
1672 /* move depth */
1673 --cur_depth;
Michal Vasko2f03d222020-12-09 18:15:51 +01001674
1675 /* find next op parent */
1676 op_iter = op_node;
1677 for (i = 0; i < cur_depth; ++i) {
Michal Vasko9e685082021-01-29 14:49:09 +01001678 op_iter = lyd_parent(op_iter);
Michal Vasko2f03d222020-12-09 18:15:51 +01001679 }
Michal Vaskofea12c62020-03-30 11:00:15 +02001680 }
1681
Michal Vasko2f03d222020-12-09 18:15:51 +01001682 assert(op_iter);
Michal Vaskobb844672020-07-03 11:06:12 +02001683 *op_subtree = (struct lyd_node *)op_iter;
Michal Vasko2f03d222020-12-09 18:15:51 +01001684 if (!tree || tree_iter) {
1685 /* there is no tree whatsoever or this is the last found sibling */
1686 *tree_sibling = (struct lyd_node *)tree_iter;
1687 } else {
1688 /* matching parent was found but it has no children to insert next to */
1689 assert(match);
1690 *tree_parent = match;
1691 }
Michal Vaskocb7526d2020-03-30 15:08:26 +02001692}
1693
Michal Vaskoe0665742021-02-11 11:08:44 +01001694/**
1695 * @brief Validate an RPC/action request, reply, or notification.
1696 *
1697 * @param[in] op_tree Full operation data tree.
1698 * @param[in] op_node Operation node itself.
1699 * @param[in] dep_tree Tree to be used for validating references from the operation subtree.
1700 * @param[in] int_opts Internal parser options.
1701 * @param[in] validate_subtree Whether subtree was already validated (as part of data parsing) or not (separate validation).
1702 * @param[in] node_when_p Set of nodes with when conditions, if NULL a local set is used.
Radek Krejci4f2e3e52021-03-30 14:20:28 +02001703 * @param[in] node_exts Set of nodes with extension instances with validation plugin callback, if NULL a local set is used.
Michal Vaskoe0665742021-02-11 11:08:44 +01001704 * @param[in] node_types_p Set of unres node types, if NULL a local set is used.
1705 * @param[in] meta_types_p Set of unres metadata types, if NULL a local set is used.
1706 * @param[out] diff Optional diff with any changes made by the validation.
1707 * @return LY_SUCCESS on success.
1708 * @return LY_ERR error on error.
1709 */
1710static LY_ERR
1711_lyd_validate_op(struct lyd_node *op_tree, struct lyd_node *op_node, const struct lyd_node *dep_tree,
Radek Krejci4f2e3e52021-03-30 14:20:28 +02001712 uint32_t int_opts, ly_bool validate_subtree, struct ly_set *node_when_p, struct ly_set *node_exts_p,
1713 struct ly_set *node_types_p, struct ly_set *meta_types_p, struct lyd_node **diff)
Michal Vaskocb7526d2020-03-30 15:08:26 +02001714{
Michal Vaskoe0665742021-02-11 11:08:44 +01001715 LY_ERR rc = LY_SUCCESS;
1716 struct lyd_node *tree_sibling, *tree_parent, *op_subtree, *op_parent, *child;
Radek Krejci4f2e3e52021-03-30 14:20:28 +02001717 struct ly_set node_types = {0}, meta_types = {0}, node_when = {0}, node_exts = {0};
Michal Vaskocb7526d2020-03-30 15:08:26 +02001718
Michal Vaskoe0665742021-02-11 11:08:44 +01001719 assert(op_tree && op_node);
Radek Krejci4f2e3e52021-03-30 14:20:28 +02001720 assert((node_when_p && node_exts_p && node_types_p && meta_types_p) ||
1721 (!node_when_p && !node_exts_p && !node_types_p && !meta_types_p));
Michal Vaskoe0665742021-02-11 11:08:44 +01001722
1723 if (!node_when_p) {
1724 node_when_p = &node_when;
Radek Krejci4f2e3e52021-03-30 14:20:28 +02001725 node_exts_p = &node_exts;
Michal Vaskoe0665742021-02-11 11:08:44 +01001726 node_types_p = &node_types;
1727 meta_types_p = &meta_types;
1728 }
1729
1730 /* merge op_tree into dep_tree */
1731 lyd_val_op_merge_find(op_tree, op_node, dep_tree, &op_subtree, &tree_sibling, &tree_parent);
1732 op_parent = lyd_parent(op_subtree);
1733 lyd_unlink_tree(op_subtree);
Michal Vasko6ee6f432021-07-16 09:49:14 +02001734 lyd_insert_node(tree_parent, &tree_sibling, op_subtree, 0);
Michal Vaskoe0665742021-02-11 11:08:44 +01001735 if (!dep_tree) {
1736 dep_tree = tree_sibling;
1737 }
1738
1739 LOG_LOCSET(NULL, op_node, NULL, NULL);
1740
1741 if (int_opts & LYD_INTOPT_REPLY) {
1742 /* add output children defaults */
Radek Krejci4f2e3e52021-03-30 14:20:28 +02001743 rc = lyd_new_implicit_r(op_node, lyd_node_child_p(op_node), NULL, NULL, node_when_p, node_exts_p, node_types_p,
Michal Vaskoe0665742021-02-11 11:08:44 +01001744 LYD_IMPLICIT_OUTPUT, diff);
1745 LY_CHECK_GOTO(rc, cleanup);
1746
1747 if (validate_subtree) {
1748 /* skip validating the operation itself, go to children directly */
1749 LY_LIST_FOR(lyd_child(op_node), child) {
Radek Krejci4f2e3e52021-03-30 14:20:28 +02001750 rc = lyd_validate_subtree(child, node_when_p, node_exts_p, node_types_p, meta_types_p, 0, diff);
1751 LY_CHECK_GOTO(rc, cleanup);
Michal Vaskoe0665742021-02-11 11:08:44 +01001752 }
1753 }
1754 } else {
1755 if (validate_subtree) {
1756 /* prevalidate whole operation subtree */
Radek Krejci4f2e3e52021-03-30 14:20:28 +02001757 rc = lyd_validate_subtree(op_node, node_when_p, node_exts_p, node_types_p, meta_types_p, 0, diff);
1758 LY_CHECK_GOTO(rc, cleanup);
Michal Vaskoe0665742021-02-11 11:08:44 +01001759 }
1760 }
1761
1762 /* finish incompletely validated terminal values/attributes and when conditions on the full tree */
Radek Krejci4f2e3e52021-03-30 14:20:28 +02001763 LY_CHECK_GOTO(rc = lyd_validate_unres((struct lyd_node **)&dep_tree, NULL,
Michal Vasko976ec432021-12-06 15:42:22 +01001764 node_when_p, 0, node_exts_p, node_types_p, meta_types_p, diff), cleanup);
Michal Vaskoe0665742021-02-11 11:08:44 +01001765
1766 /* perform final validation of the operation/notification */
1767 lyd_validate_obsolete(op_node);
1768 LY_CHECK_GOTO(rc = lyd_validate_must(op_node, int_opts), cleanup);
1769
1770 /* final validation of all the descendants */
1771 LY_CHECK_GOTO(rc = lyd_validate_final_r(lyd_child(op_node), op_node, op_node->schema, NULL, 0, int_opts), cleanup);
1772
1773cleanup:
1774 LOG_LOCBACK(0, 1, 0, 0);
1775 /* restore operation tree */
1776 lyd_unlink_tree(op_subtree);
1777 if (op_parent) {
Michal Vasko6ee6f432021-07-16 09:49:14 +02001778 lyd_insert_node(op_parent, NULL, op_subtree, 0);
Michal Vaskoe0665742021-02-11 11:08:44 +01001779 }
1780
1781 ly_set_erase(&node_when, NULL);
Radek Krejci4f2e3e52021-03-30 14:20:28 +02001782 ly_set_erase(&node_exts, NULL);
Michal Vaskoe0665742021-02-11 11:08:44 +01001783 ly_set_erase(&node_types, NULL);
1784 ly_set_erase(&meta_types, NULL);
1785 return rc;
1786}
1787
1788API LY_ERR
1789lyd_validate_op(struct lyd_node *op_tree, const struct lyd_node *dep_tree, enum lyd_type data_type, struct lyd_node **diff)
1790{
1791 struct lyd_node *op_node;
1792 uint32_t int_opts;
1793
Michal Vasko1e4c68e2021-02-18 15:03:01 +01001794 LY_CHECK_ARG_RET(NULL, op_tree, !op_tree->parent, !dep_tree || !dep_tree->parent, (data_type == LYD_TYPE_RPC_YANG) ||
1795 (data_type == LYD_TYPE_NOTIF_YANG) || (data_type == LYD_TYPE_REPLY_YANG), LY_EINVAL);
Michal Vasko892f5bf2021-11-24 10:41:05 +01001796 LY_CHECK_CTX_EQUAL_RET(LYD_CTX(op_tree), dep_tree ? LYD_CTX(dep_tree) : NULL, LY_EINVAL);
Michal Vasko8104fd42020-07-13 11:09:51 +02001797 if (diff) {
1798 *diff = NULL;
1799 }
Michal Vasko1e4c68e2021-02-18 15:03:01 +01001800 if (data_type == LYD_TYPE_RPC_YANG) {
Michal Vaskoe0665742021-02-11 11:08:44 +01001801 int_opts = LYD_INTOPT_RPC | LYD_INTOPT_ACTION;
Michal Vasko1e4c68e2021-02-18 15:03:01 +01001802 } else if (data_type == LYD_TYPE_NOTIF_YANG) {
Michal Vaskoe0665742021-02-11 11:08:44 +01001803 int_opts = LYD_INTOPT_NOTIF;
1804 } else {
1805 int_opts = LYD_INTOPT_REPLY;
1806 }
Michal Vaskocb7526d2020-03-30 15:08:26 +02001807
1808 /* find the operation/notification */
Michal Vasko56daf732020-08-10 10:57:18 +02001809 LYD_TREE_DFS_BEGIN(op_tree, op_node) {
Michal Vaskoe0665742021-02-11 11:08:44 +01001810 if ((int_opts & (LYD_INTOPT_RPC | LYD_INTOPT_ACTION | LYD_INTOPT_REPLY)) &&
1811 (op_node->schema->nodetype & (LYS_RPC | LYS_ACTION))) {
Michal Vaskocb7526d2020-03-30 15:08:26 +02001812 break;
Michal Vaskoe0665742021-02-11 11:08:44 +01001813 } else if ((int_opts & LYD_INTOPT_NOTIF) && (op_node->schema->nodetype == LYS_NOTIF)) {
Michal Vaskocb7526d2020-03-30 15:08:26 +02001814 break;
1815 }
Michal Vasko56daf732020-08-10 10:57:18 +02001816 LYD_TREE_DFS_END(op_tree, op_node);
Michal Vaskocb7526d2020-03-30 15:08:26 +02001817 }
Michal Vaskoe0665742021-02-11 11:08:44 +01001818 if (int_opts & (LYD_INTOPT_RPC | LYD_INTOPT_ACTION | LYD_INTOPT_REPLY)) {
Radek Krejci7931b192020-06-25 17:05:03 +02001819 if (!(op_node->schema->nodetype & (LYS_RPC | LYS_ACTION))) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001820 LOGERR(LYD_CTX(op_tree), LY_EINVAL, "No RPC/action to validate found.");
Michal Vaskocb7526d2020-03-30 15:08:26 +02001821 return LY_EINVAL;
1822 }
1823 } else {
Radek Krejci7931b192020-06-25 17:05:03 +02001824 if (op_node->schema->nodetype != LYS_NOTIF) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001825 LOGERR(LYD_CTX(op_tree), LY_EINVAL, "No notification to validate found.");
Michal Vaskocb7526d2020-03-30 15:08:26 +02001826 return LY_EINVAL;
1827 }
1828 }
1829
Michal Vaskoe0665742021-02-11 11:08:44 +01001830 /* validate */
Radek Krejci4f2e3e52021-03-30 14:20:28 +02001831 return _lyd_validate_op(op_tree, op_node, dep_tree, int_opts, 1, NULL, NULL, NULL, NULL, diff);
Michal Vaskofea12c62020-03-30 11:00:15 +02001832}