blob: 8004b4477d5bd208326effc70b710ef8184e572f [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
Michal Vasko413af592021-12-13 11:50:51 +0100244 /* remove this node from the set keeping the order, its when was resolved */
245 ly_set_rm_index_ordered(node_when, i, NULL);
Michal Vaskobd4db892020-11-23 16:58:20 +0100246 } 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 +0200261LY_ERR
Michal Vasko976ec432021-12-06 15:42:22 +0100262lyd_validate_unres(struct lyd_node **tree, const struct lys_module *mod, struct ly_set *node_when, uint32_t when_xp_opts,
Michal Vaskoddd76592022-01-17 13:34:48 +0100263 struct ly_set *node_types, struct ly_set *meta_types, struct ly_set *ext_val, uint32_t val_opts,
264 struct lyd_node **diff)
Michal Vaskocde73ac2019-11-14 16:10:27 +0100265{
266 LY_ERR ret = LY_SUCCESS;
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200267 uint32_t i;
Michal Vaskocde73ac2019-11-14 16:10:27 +0100268
Michal Vaskoddd76592022-01-17 13:34:48 +0100269 if (ext_val && ext_val->count) {
270 /* first validate parsed extension data */
271 i = ext_val->count;
272 do {
273 --i;
274
275 struct lyd_ctx_ext_val *ext_v = ext_val->objs[i];
276
277 /* validate extension data */
278 ret = ext_v->ext->def->plugin->validate(ext_v->ext, ext_v->sibling, val_opts);
279 LY_CHECK_RET(ret);
280
281 /* remove this item from the set */
282 ly_set_rm_index(node_types, i, free);
283 } while (i);
284 }
285
Michal Vaskob1b5c262020-03-05 14:29:47 +0100286 if (node_when) {
287 /* evaluate all when conditions */
288 uint32_t prev_count;
289 do {
290 prev_count = node_when->count;
Michal Vasko976ec432021-12-06 15:42:22 +0100291 LY_CHECK_RET(lyd_validate_unres_when(tree, mod, node_when, when_xp_opts, node_types, diff));
Radek Krejci0f969882020-08-21 16:56:47 +0200292 /* there must have been some when conditions resolved */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100293 } while (prev_count > node_when->count);
Michal Vaskocde73ac2019-11-14 16:10:27 +0100294
Michal Vaskob1b5c262020-03-05 14:29:47 +0100295 /* there could have been no cyclic when dependencies, checked during compilation */
296 assert(!node_when->count);
297 }
298
299 if (node_types && node_types->count) {
300 /* finish incompletely validated terminal values (traverse from the end for efficient set removal) */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200301 i = node_types->count;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100302 do {
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200303 --i;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100304
Michal Vasko14ed9cd2021-01-28 14:16:25 +0100305 struct lyd_node_term *node = node_types->objs[i];
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200306 struct lysc_type *type = ((struct lysc_node_leaf *)node->schema)->type;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100307
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200308 /* resolve the value of the node */
Michal Vasko9e685082021-01-29 14:49:09 +0100309 LOG_LOCSET(node->schema, &node->node, NULL, NULL);
310 ret = lyd_value_validate_incomplete(LYD_CTX(node), type, &node->value, &node->node, *tree);
Radek Krejciddace2c2021-01-08 11:30:56 +0100311 LOG_LOCBACK(node->schema ? 1 : 0, 1, 0, 0);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100312 LY_CHECK_RET(ret);
313
314 /* remove this node from the set */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200315 ly_set_rm_index(node_types, i, NULL);
316 } while (i);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100317 }
318
Michal Vasko9f96a052020-03-10 09:41:45 +0100319 if (meta_types && meta_types->count) {
320 /* ... and metadata values */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200321 i = meta_types->count;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100322 do {
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200323 --i;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100324
Michal Vasko14ed9cd2021-01-28 14:16:25 +0100325 struct lyd_meta *meta = meta_types->objs[i];
Radek Krejci1b2eef82021-02-17 11:17:27 +0100326 struct lysc_type *type = *(struct lysc_type **)meta->annotation->substmts[ANNOTATION_SUBSTMT_TYPE].storage;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100327
Michal Vasko9f96a052020-03-10 09:41:45 +0100328 /* validate and store the value of the metadata */
Radek Krejci2efc45b2020-12-22 16:25:44 +0100329 ret = lyd_value_validate_incomplete(LYD_CTX(meta->parent), type, &meta->value, meta->parent, *tree);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100330 LY_CHECK_RET(ret);
331
332 /* remove this attr from the set */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200333 ly_set_rm_index(meta_types, i, NULL);
334 } while (i);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100335 }
Michal Vaskocde73ac2019-11-14 16:10:27 +0100336
337 return ret;
338}
339
Michal Vaskobb844672020-07-03 11:06:12 +0200340/**
341 * @brief Validate instance duplication.
342 *
343 * @param[in] first First sibling to search in.
344 * @param[in] node Data node instance to check.
345 * @return LY_ERR value.
346 */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100347static LY_ERR
348lyd_validate_duplicates(const struct lyd_node *first, const struct lyd_node *node)
Michal Vaskocde73ac2019-11-14 16:10:27 +0100349{
Michal Vaskob1b5c262020-03-05 14:29:47 +0100350 struct lyd_node **match_p;
Radek Krejci857189e2020-09-01 13:26:36 +0200351 ly_bool fail = 0;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100352
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100353 assert(node->flags & LYD_NEW);
354
Michal Vaskod6c18af2021-02-12 12:07:31 +0100355 /* key-less list or non-configuration leaf-list */
Michal Vaskoe78faec2021-04-08 17:24:43 +0200356 if (lysc_is_dup_inst_list(node->schema)) {
Michal Vaskob1b5c262020-03-05 14:29:47 +0100357 /* duplicate instances allowed */
358 return LY_SUCCESS;
Michal Vaskocde73ac2019-11-14 16:10:27 +0100359 }
360
Michal Vaskob1b5c262020-03-05 14:29:47 +0100361 /* find exactly the same next instance using hashes if possible */
362 if (node->parent && node->parent->children_ht) {
363 if (!lyht_find_next(node->parent->children_ht, &node, node->hash, (void **)&match_p)) {
364 fail = 1;
365 }
366 } else {
Michal Vaskod989ba02020-08-24 10:59:24 +0200367 for ( ; first; first = first->next) {
Michal Vaskob1b5c262020-03-05 14:29:47 +0100368 if (first == node) {
369 continue;
370 }
371
372 if (node->schema->nodetype & (LYD_NODE_ANY | LYS_LEAF)) {
373 if (first->schema == node->schema) {
374 fail = 1;
375 break;
376 }
Michal Vasko8f359bf2020-07-28 10:41:15 +0200377 } else if (!lyd_compare_single(first, node, 0)) {
Michal Vaskob1b5c262020-03-05 14:29:47 +0100378 fail = 1;
379 break;
380 }
381 }
382 }
383
384 if (fail) {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100385 LOGVAL(node->schema->module->ctx, LY_VCODE_DUP, node->schema->name);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100386 return LY_EVALID;
387 }
388 return LY_SUCCESS;
Michal Vaskocde73ac2019-11-14 16:10:27 +0100389}
390
Michal Vaskobb844672020-07-03 11:06:12 +0200391/**
392 * @brief Validate multiple case data existence with possible autodelete.
393 *
394 * @param[in,out] first First sibling to search in, is updated if needed.
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100395 * @param[in] mod Module of the siblings, NULL for nested siblings.
Michal Vaskobb844672020-07-03 11:06:12 +0200396 * @param[in] choic Choice node whose cases to check.
Michal Vasko8104fd42020-07-13 11:09:51 +0200397 * @param[in,out] diff Validation diff.
Michal Vaskobb844672020-07-03 11:06:12 +0200398 * @return LY_ERR value.
399 */
Michal Vaskocde73ac2019-11-14 16:10:27 +0100400static LY_ERR
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100401lyd_validate_cases(struct lyd_node **first, const struct lys_module *mod, const struct lysc_node_choice *choic,
402 struct lyd_node **diff)
Michal Vaskob1b5c262020-03-05 14:29:47 +0100403{
404 const struct lysc_node *scase, *iter, *old_case = NULL, *new_case = NULL;
405 struct lyd_node *match, *to_del;
Radek Krejci857189e2020-09-01 13:26:36 +0200406 ly_bool found;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100407
Michal Vasko14ed9cd2021-01-28 14:16:25 +0100408 LOG_LOCSET(&choic->node, NULL, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100409
Michal Vaskob1b5c262020-03-05 14:29:47 +0100410 LY_LIST_FOR((struct lysc_node *)choic->cases, scase) {
411 found = 0;
412 iter = NULL;
413 match = NULL;
414 while ((match = lys_getnext_data(match, *first, &iter, scase, NULL))) {
415 if (match->flags & LYD_NEW) {
416 /* a new case data found, nothing more to look for */
417 found = 2;
418 break;
419 } else {
420 /* and old case data found */
421 if (found == 0) {
422 found = 1;
423 }
424 }
425 }
426
427 if (found == 1) {
428 /* there should not be 2 old cases */
429 if (old_case) {
430 /* old data from 2 cases */
Radek Krejci2efc45b2020-12-22 16:25:44 +0100431 LOGVAL(choic->module->ctx, LY_VCODE_DUPCASE, old_case->name, scase->name);
Radek Krejciddace2c2021-01-08 11:30:56 +0100432 LOG_LOCBACK(1, 0, 0, 0);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100433 return LY_EVALID;
434 }
435
436 /* remember an old existing case */
437 old_case = scase;
438 } else if (found == 2) {
439 if (new_case) {
440 /* new data from 2 cases */
Radek Krejci2efc45b2020-12-22 16:25:44 +0100441 LOGVAL(choic->module->ctx, LY_VCODE_DUPCASE, new_case->name, scase->name);
Radek Krejciddace2c2021-01-08 11:30:56 +0100442 LOG_LOCBACK(1, 0, 0, 0);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100443 return LY_EVALID;
444 }
445
446 /* remember a new existing case */
447 new_case = scase;
448 }
449 }
450
Radek Krejciddace2c2021-01-08 11:30:56 +0100451 LOG_LOCBACK(1, 0, 0, 0);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100452
Michal Vaskob1b5c262020-03-05 14:29:47 +0100453 if (old_case && new_case) {
454 /* auto-delete old case */
455 iter = NULL;
456 match = NULL;
457 to_del = NULL;
458 while ((match = lys_getnext_data(match, *first, &iter, old_case, NULL))) {
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100459 lyd_del_move_root(first, to_del, mod);
460
Michal Vasko8104fd42020-07-13 11:09:51 +0200461 /* free previous node */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100462 lyd_free_tree(to_del);
Michal Vasko8104fd42020-07-13 11:09:51 +0200463 if (diff) {
464 /* add into diff */
465 LY_CHECK_RET(lyd_val_diff_add(match, LYD_DIFF_OP_DELETE, diff));
466 }
Michal Vaskob1b5c262020-03-05 14:29:47 +0100467 to_del = match;
468 }
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100469 lyd_del_move_root(first, to_del, mod);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100470 lyd_free_tree(to_del);
471 }
472
473 return LY_SUCCESS;
474}
475
Michal Vaskobb844672020-07-03 11:06:12 +0200476/**
477 * @brief Check whether a schema node can have some default values (true for NP containers as well).
478 *
479 * @param[in] schema Schema node to check.
480 * @return non-zero if yes,
481 * @return 0 otherwise.
482 */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100483static int
484lyd_val_has_default(const struct lysc_node *schema)
485{
486 switch (schema->nodetype) {
487 case LYS_LEAF:
488 if (((struct lysc_node_leaf *)schema)->dflt) {
489 return 1;
490 }
491 break;
492 case LYS_LEAFLIST:
493 if (((struct lysc_node_leaflist *)schema)->dflts) {
494 return 1;
495 }
496 break;
497 case LYS_CONTAINER:
498 if (!(schema->flags & LYS_PRESENCE)) {
499 return 1;
500 }
501 break;
502 default:
503 break;
504 }
505
506 return 0;
507}
508
Michal Vaskobb844672020-07-03 11:06:12 +0200509/**
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100510 * @brief Properly delete a node as part of autodelete validation tasks.
511 *
512 * @param[in,out] first First sibling, is updated if needed.
513 * @param[in] node Node instance to delete.
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100514 * @param[in] mod Module of the siblings, NULL for nested siblings.
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100515 * @param[in,out] next_p Temporary LY_LIST_FOR_SAFE next pointer, is updated if needed.
516 * @param[in,out] diff Validation diff.
517 */
518static void
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100519lyd_validate_autodel_node_del(struct lyd_node **first, struct lyd_node *node, const struct lys_module *mod,
520 struct lyd_node **next_p, struct lyd_node **diff)
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100521{
522 struct lyd_node *iter;
523
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100524 lyd_del_move_root(first, node, mod);
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100525 if (node == *next_p) {
526 *next_p = (*next_p)->next;
527 }
528 if (diff) {
529 /* add into diff */
530 if ((node->schema->nodetype == LYS_CONTAINER) && !(node->schema->flags & LYS_PRESENCE)) {
531 /* we do not want to track NP container changes, but remember any removed children */
532 LY_LIST_FOR(lyd_child(node), iter) {
533 lyd_val_diff_add(iter, LYD_DIFF_OP_DELETE, diff);
534 }
535 } else {
536 lyd_val_diff_add(node, LYD_DIFF_OP_DELETE, diff);
537 }
538 }
539 lyd_free_tree(node);
540}
541
542/**
Michal Vaskobb844672020-07-03 11:06:12 +0200543 * @brief Autodelete old instances to prevent validation errors.
544 *
545 * @param[in,out] first First sibling to search in, is updated if needed.
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100546 * @param[in] node New data node instance to check.
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100547 * @param[in] mod Module of the siblings, NULL for nested siblings.
Michal Vaskobb844672020-07-03 11:06:12 +0200548 * @param[in,out] next_p Temporary LY_LIST_FOR_SAFE next pointer, is updated if needed.
Michal Vasko8104fd42020-07-13 11:09:51 +0200549 * @param[in,out] diff Validation diff.
Michal Vaskobb844672020-07-03 11:06:12 +0200550 */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100551static void
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100552lyd_validate_autodel_dup(struct lyd_node **first, struct lyd_node *node, const struct lys_module *mod,
553 struct lyd_node **next_p, struct lyd_node **diff)
Michal Vaskob1b5c262020-03-05 14:29:47 +0100554{
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100555 struct lyd_node *match, *next;
556
557 assert(node->flags & LYD_NEW);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100558
559 if (lyd_val_has_default(node->schema)) {
560 assert(node->schema->nodetype & (LYS_LEAF | LYS_LEAFLIST | LYS_CONTAINER));
Michal Vasko4c583e82020-07-17 12:16:14 +0200561 LYD_LIST_FOR_INST_SAFE(*first, node->schema, next, match) {
Michal Vaskob1b5c262020-03-05 14:29:47 +0100562 if ((match->flags & LYD_DEFAULT) && !(match->flags & LYD_NEW)) {
563 /* default instance found, remove it */
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100564 lyd_validate_autodel_node_del(first, match, mod, next_p, diff);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100565
566 /* remove only a single container/leaf default instance, if there are more, it is an error */
567 if (node->schema->nodetype & (LYS_LEAF | LYS_CONTAINER)) {
568 break;
569 }
570 }
Michal Vaskob1b5c262020-03-05 14:29:47 +0100571 }
572 }
573}
574
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100575/**
576 * @brief Autodelete leftover default nodes of deleted cases (that have no existing explicit data).
577 *
578 * @param[in,out] first First sibling to search in, is updated if needed.
579 * @param[in] node Default data node instance to check.
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100580 * @param[in] mod Module of the siblings, NULL for nested siblings.
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100581 * @param[in,out] next_p Temporary LY_LIST_FOR_SAFE next pointer, is updated if needed.
582 * @param[in,out] diff Validation diff.
583 */
584static void
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100585lyd_validate_autodel_case_dflt(struct lyd_node **first, struct lyd_node *node, const struct lys_module *mod,
586 struct lyd_node **next_p, struct lyd_node **diff)
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100587{
588 struct lysc_node_choice *choic;
589 struct lyd_node *iter = NULL;
590 const struct lysc_node *slast = NULL;
591
592 assert(node->flags & LYD_DEFAULT);
593
594 if (!node->schema->parent || (node->schema->parent->nodetype != LYS_CASE)) {
595 /* the default node is not a descendant of a case */
596 return;
597 }
598
599 choic = (struct lysc_node_choice *)node->schema->parent->parent;
600 assert(choic->nodetype == LYS_CHOICE);
601
602 if (choic->dflt && (choic->dflt == (struct lysc_node_case *)node->schema->parent)) {
603 /* data of a default case, keep them */
604 return;
605 }
606
607 /* try to find an explicit node of the case */
608 while ((iter = lys_getnext_data(iter, *first, &slast, node->schema->parent, NULL))) {
609 if (!(iter->flags & LYD_DEFAULT)) {
610 break;
611 }
612 }
613
614 if (!iter) {
615 /* there are only default nodes of the case meaning it does not exist and neither should any default nodes
616 * of the case, remove this one default node */
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100617 lyd_validate_autodel_node_del(first, node, mod, next_p, diff);
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100618 }
619}
620
Michal Vasko17f76642021-08-03 17:01:30 +0200621/**
622 * @brief Validate new siblings in choices, recursively for nested choices.
623 *
624 * @param[in,out] first First sibling.
625 * @param[in] sparent Schema parent of the siblings, NULL for top-level siblings.
626 * @param[in] mod Module of the siblings, NULL for nested siblings.
627 * @param[in,out] diff Validation diff.
628 * @return LY_ERR value.
629 */
630static LY_ERR
631lyd_validate_choice_r(struct lyd_node **first, const struct lysc_node *sparent, const struct lys_module *mod,
Radek Krejci0f969882020-08-21 16:56:47 +0200632 struct lyd_node **diff)
Michal Vaskob1b5c262020-03-05 14:29:47 +0100633{
Michal Vaskob1b5c262020-03-05 14:29:47 +0100634 const struct lysc_node *snode = NULL;
635
Michal Vaskob1b5c262020-03-05 14:29:47 +0100636 while (*first && (snode = lys_getnext(snode, sparent, mod ? mod->compiled : NULL, LYS_GETNEXT_WITHCHOICE))) {
637 /* check case duplicites */
638 if (snode->nodetype == LYS_CHOICE) {
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100639 LY_CHECK_RET(lyd_validate_cases(first, mod, (struct lysc_node_choice *)snode, diff));
Michal Vasko17f76642021-08-03 17:01:30 +0200640
641 /* check for nested choice */
642 LY_CHECK_RET(lyd_validate_choice_r(first, snode, mod, diff));
Michal Vaskob1b5c262020-03-05 14:29:47 +0100643 }
644 }
645
Michal Vasko17f76642021-08-03 17:01:30 +0200646 return LY_SUCCESS;
647}
648
649LY_ERR
650lyd_validate_new(struct lyd_node **first, const struct lysc_node *sparent, const struct lys_module *mod,
651 struct lyd_node **diff)
652{
653 struct lyd_node *next, *node;
654
655 assert(first && (sparent || mod));
656
657 /* validate choices */
658 LY_CHECK_RET(lyd_validate_choice_r(first, sparent, mod, diff));
659
Michal Vaskob1b5c262020-03-05 14:29:47 +0100660 LY_LIST_FOR_SAFE(*first, next, node) {
Michal Vaskoc193ce92020-03-06 11:04:48 +0100661 if (mod && (lyd_owner_module(node) != mod)) {
Michal Vaskob1b5c262020-03-05 14:29:47 +0100662 /* all top-level data from this module checked */
663 break;
664 }
665
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100666 if (!(node->flags & (LYD_NEW | LYD_DEFAULT))) {
667 /* check only new and default nodes */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100668 continue;
669 }
670
Radek Krejciddace2c2021-01-08 11:30:56 +0100671 LOG_LOCSET(node->schema, node, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100672
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100673 if (node->flags & LYD_NEW) {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100674 LY_ERR ret;
675
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100676 /* remove old default(s) of the new node if it exists */
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100677 lyd_validate_autodel_dup(first, node, mod, &next, diff);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100678
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100679 /* then check new node instance duplicities */
Radek Krejci2efc45b2020-12-22 16:25:44 +0100680 ret = lyd_validate_duplicates(*first, node);
Radek Krejciddace2c2021-01-08 11:30:56 +0100681 LY_CHECK_ERR_RET(ret, LOG_LOCBACK(node->schema ? 1 : 0, 1, 0, 0), ret);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100682
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100683 /* this node is valid */
684 node->flags &= ~LYD_NEW;
685 }
686
Michal Vasko0e6de512021-01-11 13:39:44 +0100687 LOG_LOCBACK(node->schema ? 1 : 0, 1, 0, 0);
688
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100689 if (node->flags & LYD_DEFAULT) {
690 /* remove leftover default nodes from a no-longer existing case */
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100691 lyd_validate_autodel_case_dflt(first, node, mod, &next, diff);
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100692 }
Michal Vaskob1b5c262020-03-05 14:29:47 +0100693 }
694
695 return LY_SUCCESS;
696}
697
Michal Vaskobb844672020-07-03 11:06:12 +0200698/**
Michal Vaskobd4db892020-11-23 16:58:20 +0100699 * @brief Evaluate any "when" conditions of a non-existent data node with existing parent.
700 *
701 * @param[in] first First data sibling of the non-existing node.
702 * @param[in] parent Data parent of the non-existing node.
703 * @param[in] snode Schema node of the non-existing node.
704 * @param[out] disabled First when that evaluated false, if any.
705 * @return LY_ERR value.
706 */
707static LY_ERR
708lyd_validate_dummy_when(const struct lyd_node *first, const struct lyd_node *parent, const struct lysc_node *snode,
709 const struct lysc_when **disabled)
710{
711 LY_ERR ret = LY_SUCCESS;
712 struct lyd_node *tree, *dummy = NULL;
713
714 /* find root */
715 if (parent) {
716 tree = (struct lyd_node *)parent;
717 while (tree->parent) {
718 tree = lyd_parent(tree);
719 }
720 tree = lyd_first_sibling(tree);
721 } else {
722 assert(!first || !first->prev->next);
723 tree = (struct lyd_node *)first;
724 }
725
726 /* create dummy opaque node */
Michal Vasko0ab974d2021-02-24 13:18:26 +0100727 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 +0100728 LY_CHECK_GOTO(ret, cleanup);
729
730 /* connect it if needed */
731 if (!parent) {
732 if (first) {
733 lyd_insert_sibling((struct lyd_node *)first, dummy, &tree);
734 } else {
735 assert(!tree);
736 tree = dummy;
737 }
738 }
739
740 /* evaluate all when */
Michal Vasko976ec432021-12-06 15:42:22 +0100741 ret = lyd_validate_node_when(tree, dummy, snode, 0, disabled);
Michal Vaskobd4db892020-11-23 16:58:20 +0100742 if (ret == LY_EINCOMPLETE) {
743 /* all other when must be resolved by now */
744 LOGINT(snode->module->ctx);
745 ret = LY_EINT;
746 goto cleanup;
747 } else if (ret) {
748 /* error */
749 goto cleanup;
750 }
751
752cleanup:
753 lyd_free_tree(dummy);
754 return ret;
755}
756
757/**
Michal Vaskobb844672020-07-03 11:06:12 +0200758 * @brief Validate mandatory node existence.
759 *
760 * @param[in] first First sibling to search in.
Michal Vaskobd4db892020-11-23 16:58:20 +0100761 * @param[in] parent Data parent.
Michal Vaskobb844672020-07-03 11:06:12 +0200762 * @param[in] snode Schema node to validate.
763 * @return LY_ERR value.
764 */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100765static LY_ERR
Michal Vaskobd4db892020-11-23 16:58:20 +0100766lyd_validate_mandatory(const struct lyd_node *first, const struct lyd_node *parent, const struct lysc_node *snode)
Michal Vaskoa3881362020-01-21 15:57:35 +0100767{
Michal Vaskobd4db892020-11-23 16:58:20 +0100768 const struct lysc_when *disabled;
769
Michal Vaskoa3881362020-01-21 15:57:35 +0100770 if (snode->nodetype == LYS_CHOICE) {
Michal Vasko9b368d32020-02-14 13:53:31 +0100771 /* some data of a choice case exist */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100772 if (lys_getnext_data(NULL, first, NULL, snode, NULL)) {
Michal Vasko9b368d32020-02-14 13:53:31 +0100773 return LY_SUCCESS;
774 }
775 } else {
776 assert(snode->nodetype & (LYS_LEAF | LYS_CONTAINER | LYD_NODE_ANY));
Michal Vaskoa3881362020-01-21 15:57:35 +0100777
Michal Vaskob1b5c262020-03-05 14:29:47 +0100778 if (!lyd_find_sibling_val(first, snode, NULL, 0, NULL)) {
Michal Vasko9b368d32020-02-14 13:53:31 +0100779 /* data instance found */
780 return LY_SUCCESS;
Michal Vaskoa3881362020-01-21 15:57:35 +0100781 }
782 }
783
Michal Vaskobd4db892020-11-23 16:58:20 +0100784 disabled = NULL;
785 if (lysc_has_when(snode)) {
786 /* if there are any when conditions, they must be true for a validation error */
787 LY_CHECK_RET(lyd_validate_dummy_when(first, parent, snode, &disabled));
788 }
789
790 if (!disabled) {
791 /* node instance not found */
Michal Vasko538b8952021-02-17 11:27:26 +0100792 if (snode->nodetype == LYS_CHOICE) {
Michal Vaskoe9391c72021-10-05 10:04:56 +0200793 LOGVAL_APPTAG(snode->module->ctx, "missing-choice", LY_VCODE_NOMAND_CHOIC, snode->name);
Michal Vasko538b8952021-02-17 11:27:26 +0100794 } else {
795 LOGVAL(snode->module->ctx, LY_VCODE_NOMAND, snode->name);
796 }
Michal Vaskobd4db892020-11-23 16:58:20 +0100797 return LY_EVALID;
798 }
799
800 return LY_SUCCESS;
Michal Vaskoa3881362020-01-21 15:57:35 +0100801}
802
Michal Vaskobb844672020-07-03 11:06:12 +0200803/**
804 * @brief Validate min/max-elements constraints, if any.
805 *
806 * @param[in] first First sibling to search in.
Michal Vaskobd4db892020-11-23 16:58:20 +0100807 * @param[in] parent Data parent.
Michal Vaskobb844672020-07-03 11:06:12 +0200808 * @param[in] snode Schema node to validate.
809 * @param[in] min Minimum number of elements, 0 for no restriction.
810 * @param[in] max Max number of elements, 0 for no restriction.
811 * @return LY_ERR value.
812 */
Michal Vaskoa3881362020-01-21 15:57:35 +0100813static LY_ERR
Michal Vaskobd4db892020-11-23 16:58:20 +0100814lyd_validate_minmax(const struct lyd_node *first, const struct lyd_node *parent, const struct lysc_node *snode,
815 uint32_t min, uint32_t max)
Michal Vaskoa3881362020-01-21 15:57:35 +0100816{
Michal Vaskoacd83e72020-02-04 14:12:01 +0100817 uint32_t count = 0;
Michal Vasko4c583e82020-07-17 12:16:14 +0200818 struct lyd_node *iter;
Michal Vaskobd4db892020-11-23 16:58:20 +0100819 const struct lysc_when *disabled;
Radek Krejci2efc45b2020-12-22 16:25:44 +0100820 ly_bool invalid_instance = 0;
Michal Vaskoacd83e72020-02-04 14:12:01 +0100821
Michal Vasko9b368d32020-02-14 13:53:31 +0100822 assert(min || max);
823
Michal Vasko4c583e82020-07-17 12:16:14 +0200824 LYD_LIST_FOR_INST(first, snode, iter) {
825 ++count;
Michal Vasko9b368d32020-02-14 13:53:31 +0100826
Michal Vasko4c583e82020-07-17 12:16:14 +0200827 if (min && (count == min)) {
828 /* satisfied */
829 min = 0;
830 if (!max) {
831 /* nothing more to check */
Michal Vasko9b368d32020-02-14 13:53:31 +0100832 break;
833 }
Michal Vaskoacd83e72020-02-04 14:12:01 +0100834 }
Michal Vasko4c583e82020-07-17 12:16:14 +0200835 if (max && (count > max)) {
836 /* not satisifed */
Radek Krejciddace2c2021-01-08 11:30:56 +0100837 LOG_LOCSET(NULL, iter, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100838 invalid_instance = 1;
Michal Vasko4c583e82020-07-17 12:16:14 +0200839 break;
840 }
Michal Vaskoacd83e72020-02-04 14:12:01 +0100841 }
842
Michal Vasko9b368d32020-02-14 13:53:31 +0100843 if (min) {
844 assert(count < min);
Michal Vaskobd4db892020-11-23 16:58:20 +0100845
846 disabled = NULL;
847 if (lysc_has_when(snode)) {
848 /* if there are any when conditions, they must be true for a validation error */
849 LY_CHECK_RET(lyd_validate_dummy_when(first, parent, snode, &disabled));
850 }
851
852 if (!disabled) {
Michal Vaskoe9391c72021-10-05 10:04:56 +0200853 LOGVAL_APPTAG(snode->module->ctx, "too-few-elements", LY_VCODE_NOMIN, snode->name);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100854 goto failure;
Michal Vaskobd4db892020-11-23 16:58:20 +0100855 }
Michal Vaskoacd83e72020-02-04 14:12:01 +0100856 } else if (max && (count > max)) {
Michal Vaskoe9391c72021-10-05 10:04:56 +0200857 LOGVAL_APPTAG(snode->module->ctx, "too-many-elements", LY_VCODE_NOMAX, snode->name);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100858 goto failure;
Michal Vaskoacd83e72020-02-04 14:12:01 +0100859 }
860
Michal Vaskoa3881362020-01-21 15:57:35 +0100861 return LY_SUCCESS;
Radek Krejci2efc45b2020-12-22 16:25:44 +0100862
863failure:
Radek Krejciddace2c2021-01-08 11:30:56 +0100864 LOG_LOCBACK(0, invalid_instance, 0, 0);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100865 return LY_EVALID;
Michal Vaskoa3881362020-01-21 15:57:35 +0100866}
867
Michal Vaskobb844672020-07-03 11:06:12 +0200868/**
869 * @brief Find node referenced by a list unique statement.
870 *
871 * @param[in] uniq_leaf Unique leaf to find.
872 * @param[in] list List instance to use for the search.
873 * @return Found leaf,
874 * @return NULL if no leaf found.
875 */
Michal Vasko14654712020-02-06 08:35:21 +0100876static struct lyd_node *
Michal Vaskobb844672020-07-03 11:06:12 +0200877lyd_val_uniq_find_leaf(const struct lysc_node_leaf *uniq_leaf, const struct lyd_node *list)
Michal Vasko14654712020-02-06 08:35:21 +0100878{
Michal Vasko9b368d32020-02-14 13:53:31 +0100879 struct lyd_node *node;
880 const struct lysc_node *iter;
881 size_t depth = 0, i;
Michal Vasko14654712020-02-06 08:35:21 +0100882
Michal Vasko9b368d32020-02-14 13:53:31 +0100883 /* get leaf depth */
Michal Vasko14ed9cd2021-01-28 14:16:25 +0100884 for (iter = &uniq_leaf->node; iter && (iter != list->schema); iter = lysc_data_parent(iter)) {
Michal Vasko62ed12d2020-05-21 10:08:25 +0200885 ++depth;
Michal Vasko14654712020-02-06 08:35:21 +0100886 }
Michal Vasko9b368d32020-02-14 13:53:31 +0100887
Michal Vaskobb844672020-07-03 11:06:12 +0200888 node = (struct lyd_node *)list;
Michal Vasko9b368d32020-02-14 13:53:31 +0100889 while (node && depth) {
890 /* find schema node with this depth */
Michal Vasko14ed9cd2021-01-28 14:16:25 +0100891 for (i = depth - 1, iter = &uniq_leaf->node; i; iter = lysc_data_parent(iter)) {
Michal Vasko62ed12d2020-05-21 10:08:25 +0200892 --i;
Michal Vasko9b368d32020-02-14 13:53:31 +0100893 }
894
895 /* find iter instance in children */
896 assert(iter->nodetype & (LYS_CONTAINER | LYS_LEAF));
Radek Krejcia1c1e542020-09-29 16:06:52 +0200897 lyd_find_sibling_val(lyd_child(node), iter, NULL, 0, &node);
Michal Vasko9b368d32020-02-14 13:53:31 +0100898 --depth;
899 }
900
Michal Vasko14654712020-02-06 08:35:21 +0100901 return node;
902}
903
Michal Vaskobb844672020-07-03 11:06:12 +0200904/**
905 * @brief Callback for comparing 2 list unique leaf values.
906 *
Michal Vasko62524a92021-02-26 10:08:50 +0100907 * Implementation of ::lyht_value_equal_cb.
Radek Krejci857189e2020-09-01 13:26:36 +0200908 *
Michal Vaskobb844672020-07-03 11:06:12 +0200909 * @param[in] cb_data 0 to compare all uniques, n to compare only n-th unique.
Michal Vasko14654712020-02-06 08:35:21 +0100910 */
Radek Krejci857189e2020-09-01 13:26:36 +0200911static ly_bool
912lyd_val_uniq_list_equal(void *val1_p, void *val2_p, ly_bool UNUSED(mod), void *cb_data)
Michal Vasko14654712020-02-06 08:35:21 +0100913{
914 struct ly_ctx *ctx;
915 struct lysc_node_list *slist;
916 struct lyd_node *diter, *first, *second;
917 struct lyd_value *val1, *val2;
918 char *path1, *path2, *uniq_str, *ptr;
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200919 LY_ARRAY_COUNT_TYPE u, v, action;
Michal Vasko14654712020-02-06 08:35:21 +0100920
921 assert(val1_p && val2_p);
922
923 first = *((struct lyd_node **)val1_p);
924 second = *((struct lyd_node **)val2_p);
Michal Vasko41e630c2021-07-23 12:47:18 +0200925 action = (uintptr_t)cb_data;
Michal Vasko14654712020-02-06 08:35:21 +0100926
927 assert(first && (first->schema->nodetype == LYS_LIST));
928 assert(second && (second->schema == first->schema));
929
930 ctx = first->schema->module->ctx;
931
932 slist = (struct lysc_node_list *)first->schema;
933
934 /* compare unique leaves */
935 if (action > 0) {
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200936 u = action - 1;
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200937 if (u < LY_ARRAY_COUNT(slist->uniques)) {
Michal Vasko14654712020-02-06 08:35:21 +0100938 goto uniquecheck;
939 }
940 }
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200941 LY_ARRAY_FOR(slist->uniques, u) {
Michal Vasko14654712020-02-06 08:35:21 +0100942uniquecheck:
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200943 LY_ARRAY_FOR(slist->uniques[u], v) {
Michal Vasko14654712020-02-06 08:35:21 +0100944 /* first */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200945 diter = lyd_val_uniq_find_leaf(slist->uniques[u][v], first);
Michal Vasko14654712020-02-06 08:35:21 +0100946 if (diter) {
947 val1 = &((struct lyd_node_term *)diter)->value;
948 } else {
949 /* use default value */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200950 val1 = slist->uniques[u][v]->dflt;
Michal Vasko14654712020-02-06 08:35:21 +0100951 }
952
953 /* second */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200954 diter = lyd_val_uniq_find_leaf(slist->uniques[u][v], second);
Michal Vasko14654712020-02-06 08:35:21 +0100955 if (diter) {
956 val2 = &((struct lyd_node_term *)diter)->value;
957 } else {
958 /* use default value */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200959 val2 = slist->uniques[u][v]->dflt;
Michal Vasko14654712020-02-06 08:35:21 +0100960 }
961
962 if (!val1 || !val2 || val1->realtype->plugin->compare(val1, val2)) {
963 /* values differ or either one is not set */
964 break;
965 }
966 }
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200967 if (v && (v == LY_ARRAY_COUNT(slist->uniques[u]))) {
Michal Vasko14654712020-02-06 08:35:21 +0100968 /* all unique leafs are the same in this set, create this nice error */
Radek Krejci635d2b82021-01-04 11:26:51 +0100969 path1 = lyd_path(first, LYD_PATH_STD, NULL, 0);
970 path2 = lyd_path(second, LYD_PATH_STD, NULL, 0);
Michal Vasko14654712020-02-06 08:35:21 +0100971
972 /* use buffer to rebuild the unique string */
Radek Krejcif13b87b2020-12-01 22:02:17 +0100973#define UNIQ_BUF_SIZE 1024
974 uniq_str = malloc(UNIQ_BUF_SIZE);
Michal Vasko14654712020-02-06 08:35:21 +0100975 uniq_str[0] = '\0';
976 ptr = uniq_str;
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200977 LY_ARRAY_FOR(slist->uniques[u], v) {
978 if (v) {
Michal Vasko14654712020-02-06 08:35:21 +0100979 strcpy(ptr, " ");
980 ++ptr;
981 }
Michal Vasko14ed9cd2021-01-28 14:16:25 +0100982 ptr = lysc_path_until((struct lysc_node *)slist->uniques[u][v], &slist->node, LYSC_PATH_LOG,
Radek Krejcif13b87b2020-12-01 22:02:17 +0100983 ptr, UNIQ_BUF_SIZE - (ptr - uniq_str));
Michal Vasko14654712020-02-06 08:35:21 +0100984 if (!ptr) {
985 /* path will be incomplete, whatever */
986 break;
987 }
988
989 ptr += strlen(ptr);
990 }
Radek Krejciddace2c2021-01-08 11:30:56 +0100991 LOG_LOCSET(NULL, second, NULL, NULL);
Michal Vaskoe9391c72021-10-05 10:04:56 +0200992 LOGVAL_APPTAG(ctx, "data-not-unique", LY_VCODE_NOUNIQ, uniq_str, path1, path2);
Radek Krejciddace2c2021-01-08 11:30:56 +0100993 LOG_LOCBACK(0, 1, 0, 0);
Michal Vasko14654712020-02-06 08:35:21 +0100994
995 free(path1);
996 free(path2);
997 free(uniq_str);
Radek Krejcif13b87b2020-12-01 22:02:17 +0100998#undef UNIQ_BUF_SIZE
999
Michal Vasko14654712020-02-06 08:35:21 +01001000 return 1;
1001 }
1002
1003 if (action > 0) {
1004 /* done */
1005 return 0;
1006 }
1007 }
1008
1009 return 0;
1010}
1011
Michal Vaskobb844672020-07-03 11:06:12 +02001012/**
1013 * @brief Validate list unique leaves.
1014 *
1015 * @param[in] first First sibling to search in.
1016 * @param[in] snode Schema node to validate.
1017 * @param[in] uniques List unique arrays to validate.
1018 * @return LY_ERR value.
1019 */
Michal Vaskoa3881362020-01-21 15:57:35 +01001020static LY_ERR
Michal Vaskobb844672020-07-03 11:06:12 +02001021lyd_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 +01001022{
Michal Vaskob1b5c262020-03-05 14:29:47 +01001023 const struct lyd_node *diter;
Michal Vasko14654712020-02-06 08:35:21 +01001024 struct ly_set *set;
Michal Vaskofd69e1d2020-07-03 11:57:17 +02001025 LY_ARRAY_COUNT_TYPE u, v, x = 0;
Michal Vasko14654712020-02-06 08:35:21 +01001026 LY_ERR ret = LY_SUCCESS;
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001027 uint32_t hash, i, size = 0;
Radek Krejci813c02d2021-04-26 10:29:19 +02001028 size_t key_len;
1029 ly_bool dyn;
1030 const void *hash_key;
Michal Vasko41e630c2021-07-23 12:47:18 +02001031 void *cb_data;
Michal Vasko14654712020-02-06 08:35:21 +01001032 struct hash_table **uniqtables = NULL;
1033 struct lyd_value *val;
1034 struct ly_ctx *ctx = snode->module->ctx;
1035
1036 assert(uniques);
1037
1038 /* get all list instances */
Radek Krejciba03a5a2020-08-27 14:40:41 +02001039 LY_CHECK_RET(ly_set_new(&set));
Michal Vaskob1b5c262020-03-05 14:29:47 +01001040 LY_LIST_FOR(first, diter) {
Michal Vasko9b368d32020-02-14 13:53:31 +01001041 if (diter->schema == snode) {
Radek Krejci3d92e442020-10-12 12:48:13 +02001042 ret = ly_set_add(set, (void *)diter, 1, NULL);
Michal Vaskob0099a92020-08-31 14:55:23 +02001043 LY_CHECK_GOTO(ret, cleanup);
Michal Vasko9b368d32020-02-14 13:53:31 +01001044 }
1045 }
Michal Vasko14654712020-02-06 08:35:21 +01001046
1047 if (set->count == 2) {
1048 /* simple comparison */
1049 if (lyd_val_uniq_list_equal(&set->objs[0], &set->objs[1], 0, (void *)0)) {
1050 /* instance duplication */
1051 ret = LY_EVALID;
1052 goto cleanup;
1053 }
1054 } else if (set->count > 2) {
1055 /* use hashes for comparison */
Radek Krejcif13b87b2020-12-01 22:02:17 +01001056 /* first, allocate the table, the size depends on number of items in the set,
1057 * the following code detects number of upper zero bits in the items' counter value ... */
1058 for (i = (sizeof set->count * CHAR_BIT) - 1; i > 0; i--) {
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001059 size = set->count << i;
1060 size = size >> i;
1061 if (size == set->count) {
Michal Vasko14654712020-02-06 08:35:21 +01001062 break;
1063 }
1064 }
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001065 LY_CHECK_ERR_GOTO(!i, LOGINT(ctx); ret = LY_EINT, cleanup);
Radek Krejcif13b87b2020-12-01 22:02:17 +01001066 /* ... and then we convert it to the position of the highest non-zero bit ... */
1067 i = (sizeof set->count * CHAR_BIT) - i;
1068 /* ... 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 +02001069 size = 1 << i;
Michal Vasko14654712020-02-06 08:35:21 +01001070
Michal Vaskofd69e1d2020-07-03 11:57:17 +02001071 uniqtables = malloc(LY_ARRAY_COUNT(uniques) * sizeof *uniqtables);
Michal Vasko14654712020-02-06 08:35:21 +01001072 LY_CHECK_ERR_GOTO(!uniqtables, LOGMEM(ctx); ret = LY_EMEM, cleanup);
Michal Vaskofd69e1d2020-07-03 11:57:17 +02001073 x = LY_ARRAY_COUNT(uniques);
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001074 for (v = 0; v < x; v++) {
Michal Vasko41e630c2021-07-23 12:47:18 +02001075 cb_data = (void *)(uintptr_t)(v + 1L);
1076 uniqtables[v] = lyht_new(size, sizeof(struct lyd_node *), lyd_val_uniq_list_equal, cb_data, 0);
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001077 LY_CHECK_ERR_GOTO(!uniqtables[v], LOGMEM(ctx); ret = LY_EMEM, cleanup);
Michal Vasko14654712020-02-06 08:35:21 +01001078 }
1079
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001080 for (i = 0; i < set->count; i++) {
Michal Vasko14654712020-02-06 08:35:21 +01001081 /* loop for unique - get the hash for the instances */
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001082 for (u = 0; u < x; u++) {
Michal Vasko14654712020-02-06 08:35:21 +01001083 val = NULL;
Michal Vaskofd69e1d2020-07-03 11:57:17 +02001084 for (v = hash = 0; v < LY_ARRAY_COUNT(uniques[u]); v++) {
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001085 diter = lyd_val_uniq_find_leaf(uniques[u][v], set->objs[i]);
Michal Vasko14654712020-02-06 08:35:21 +01001086 if (diter) {
1087 val = &((struct lyd_node_term *)diter)->value;
1088 } else {
1089 /* use default value */
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001090 val = uniques[u][v]->dflt;
Michal Vasko14654712020-02-06 08:35:21 +01001091 }
1092 if (!val) {
1093 /* unique item not present nor has default value */
1094 break;
1095 }
1096
Radek Krejci813c02d2021-04-26 10:29:19 +02001097 /* get hash key */
Michal Vaskodcfac2c2021-05-10 11:36:37 +02001098 hash_key = val->realtype->plugin->print(NULL, val, LY_VALUE_LYB, NULL, &dyn, &key_len);
Radek Krejci813c02d2021-04-26 10:29:19 +02001099 hash = dict_hash_multi(hash, hash_key, key_len);
1100 if (dyn) {
1101 free((void *)hash_key);
Michal Vasko14654712020-02-06 08:35:21 +01001102 }
1103 }
1104 if (!val) {
1105 /* skip this list instance since its unique set is incomplete */
1106 continue;
1107 }
1108
1109 /* finish the hash value */
1110 hash = dict_hash_multi(hash, NULL, 0);
1111
1112 /* insert into the hashtable */
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001113 ret = lyht_insert(uniqtables[u], &set->objs[i], hash, NULL);
Michal Vasko14654712020-02-06 08:35:21 +01001114 if (ret == LY_EEXIST) {
1115 /* instance duplication */
1116 ret = LY_EVALID;
1117 }
1118 LY_CHECK_GOTO(ret != LY_SUCCESS, cleanup);
1119 }
1120 }
1121 }
1122
1123cleanup:
1124 ly_set_free(set, NULL);
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001125 for (v = 0; v < x; v++) {
1126 if (!uniqtables[v]) {
Michal Vasko14654712020-02-06 08:35:21 +01001127 /* failed when allocating uniquetables[j], following j are not allocated */
1128 break;
1129 }
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001130 lyht_free(uniqtables[v]);
Michal Vasko14654712020-02-06 08:35:21 +01001131 }
1132 free(uniqtables);
1133
1134 return ret;
Michal Vaskoa3881362020-01-21 15:57:35 +01001135}
1136
Michal Vaskobb844672020-07-03 11:06:12 +02001137/**
1138 * @brief Validate data siblings based on generic schema node restrictions, recursively for schema-only nodes.
1139 *
1140 * @param[in] first First sibling to search in.
Michal Vaskobd4db892020-11-23 16:58:20 +01001141 * @param[in] parent Data parent.
Michal Vaskobb844672020-07-03 11:06:12 +02001142 * @param[in] sparent Schema parent of the nodes to check.
1143 * @param[in] mod Module of the nodes to check.
1144 * @param[in] val_opts Validation options, see @ref datavalidationoptions.
Michal Vaskoe0665742021-02-11 11:08:44 +01001145 * @param[in] int_opts Internal parser options.
Michal Vaskobb844672020-07-03 11:06:12 +02001146 * @return LY_ERR value.
1147 */
Michal Vaskoa3881362020-01-21 15:57:35 +01001148static LY_ERR
Michal Vaskobd4db892020-11-23 16:58:20 +01001149lyd_validate_siblings_schema_r(const struct lyd_node *first, const struct lyd_node *parent,
Michal Vaskoe0665742021-02-11 11:08:44 +01001150 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 +01001151{
Radek Krejci2efc45b2020-12-22 16:25:44 +01001152 LY_ERR ret = LY_SUCCESS;
Michal Vasko6c16cda2021-02-04 11:05:52 +01001153 const struct lysc_node *snode = NULL, *scase;
Michal Vaskoa3881362020-01-21 15:57:35 +01001154 struct lysc_node_list *slist;
Michal Vaskod8958df2020-08-05 13:27:36 +02001155 struct lysc_node_leaflist *sllist;
Radek Krejci1deb5be2020-08-26 16:43:36 +02001156 uint32_t getnext_opts;
Michal Vaskocb7526d2020-03-30 15:08:26 +02001157
Michal Vaskoe0665742021-02-11 11:08:44 +01001158 getnext_opts = LYS_GETNEXT_WITHCHOICE | (int_opts & LYD_INTOPT_REPLY ? LYS_GETNEXT_OUTPUT : 0);
Michal Vaskocde73ac2019-11-14 16:10:27 +01001159
Michal Vaskoa3881362020-01-21 15:57:35 +01001160 /* disabled nodes are skipped by lys_getnext */
Michal Vaskocb7526d2020-03-30 15:08:26 +02001161 while ((snode = lys_getnext(snode, sparent, mod, getnext_opts))) {
Radek Krejci7931b192020-06-25 17:05:03 +02001162 if ((val_opts & LYD_VALIDATE_NO_STATE) && (snode->flags & LYS_CONFIG_R)) {
Michal Vaskoe75ecfd2020-03-06 14:12:28 +01001163 continue;
1164 }
1165
Radek Krejciddace2c2021-01-08 11:30:56 +01001166 LOG_LOCSET(snode, NULL, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +01001167
Michal Vaskoa3881362020-01-21 15:57:35 +01001168 /* check min-elements and max-elements */
Michal Vaskod8958df2020-08-05 13:27:36 +02001169 if (snode->nodetype == LYS_LIST) {
Michal Vaskoa3881362020-01-21 15:57:35 +01001170 slist = (struct lysc_node_list *)snode;
1171 if (slist->min || slist->max) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001172 ret = lyd_validate_minmax(first, parent, snode, slist->min, slist->max);
1173 LY_CHECK_GOTO(ret, error);
Michal Vaskoa3881362020-01-21 15:57:35 +01001174 }
Michal Vaskod8958df2020-08-05 13:27:36 +02001175 } else if (snode->nodetype == LYS_LEAFLIST) {
1176 sllist = (struct lysc_node_leaflist *)snode;
1177 if (sllist->min || sllist->max) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001178 ret = lyd_validate_minmax(first, parent, snode, sllist->min, sllist->max);
1179 LY_CHECK_GOTO(ret, error);
Michal Vaskod8958df2020-08-05 13:27:36 +02001180 }
Michal Vaskoacd83e72020-02-04 14:12:01 +01001181
Michal Vaskoacd83e72020-02-04 14:12:01 +01001182 } else if (snode->flags & LYS_MAND_TRUE) {
Radek Krejcif6a11002020-08-21 13:29:07 +02001183 /* check generic mandatory existence */
Radek Krejci2efc45b2020-12-22 16:25:44 +01001184 ret = lyd_validate_mandatory(first, parent, snode);
1185 LY_CHECK_GOTO(ret, error);
Michal Vaskoa3881362020-01-21 15:57:35 +01001186 }
1187
1188 /* check unique */
1189 if (snode->nodetype == LYS_LIST) {
1190 slist = (struct lysc_node_list *)snode;
1191 if (slist->uniques) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001192 ret = lyd_validate_unique(first, snode, (const struct lysc_node_leaf ***)slist->uniques);
1193 LY_CHECK_GOTO(ret, error);
Michal Vaskoa3881362020-01-21 15:57:35 +01001194 }
1195 }
1196
Michal Vasko6c16cda2021-02-04 11:05:52 +01001197 if (snode->nodetype == LYS_CHOICE) {
1198 /* find the existing case, if any */
1199 LY_LIST_FOR(lysc_node_child(snode), scase) {
1200 if (lys_getnext_data(NULL, first, NULL, scase, NULL)) {
1201 /* validate only this case */
Michal Vaskoe0665742021-02-11 11:08:44 +01001202 ret = lyd_validate_siblings_schema_r(first, parent, scase, mod, val_opts, int_opts);
Michal Vasko6c16cda2021-02-04 11:05:52 +01001203 LY_CHECK_GOTO(ret, error);
1204 break;
1205 }
1206 }
Michal Vaskoacd83e72020-02-04 14:12:01 +01001207 }
Radek Krejci2efc45b2020-12-22 16:25:44 +01001208
Radek Krejciddace2c2021-01-08 11:30:56 +01001209 LOG_LOCBACK(1, 0, 0, 0);
Michal Vaskocde73ac2019-11-14 16:10:27 +01001210 }
1211
Michal Vaskoacd83e72020-02-04 14:12:01 +01001212 return LY_SUCCESS;
Radek Krejci2efc45b2020-12-22 16:25:44 +01001213
1214error:
Radek Krejciddace2c2021-01-08 11:30:56 +01001215 LOG_LOCBACK(1, 0, 0, 0);
Radek Krejci2efc45b2020-12-22 16:25:44 +01001216 return ret;
Michal Vaskoacd83e72020-02-04 14:12:01 +01001217}
1218
Michal Vaskobb844672020-07-03 11:06:12 +02001219/**
1220 * @brief Validate obsolete nodes, only warnings are printed.
1221 *
1222 * @param[in] node Node to check.
1223 */
Michal Vaskoe75ecfd2020-03-06 14:12:28 +01001224static void
1225lyd_validate_obsolete(const struct lyd_node *node)
1226{
1227 const struct lysc_node *snode;
1228
1229 snode = node->schema;
1230 do {
1231 if (snode->flags & LYS_STATUS_OBSLT) {
1232 LOGWRN(snode->module->ctx, "Obsolete schema node \"%s\" instantiated in data.", snode->name);
1233 break;
1234 }
1235
1236 snode = snode->parent;
1237 } while (snode && (snode->nodetype & (LYS_CHOICE | LYS_CASE)));
1238}
1239
Michal Vaskobb844672020-07-03 11:06:12 +02001240/**
1241 * @brief Validate must conditions of a data node.
1242 *
1243 * @param[in] node Node to validate.
Michal Vaskoe0665742021-02-11 11:08:44 +01001244 * @param[in] int_opts Internal parser options.
Michal Vaskobb844672020-07-03 11:06:12 +02001245 * @return LY_ERR value.
1246 */
Michal Vaskocc048b22020-03-27 15:52:38 +01001247static LY_ERR
Michal Vaskoe0665742021-02-11 11:08:44 +01001248lyd_validate_must(const struct lyd_node *node, uint32_t int_opts)
Michal Vaskocc048b22020-03-27 15:52:38 +01001249{
Michal Vaskoa1db2342021-07-19 12:23:23 +02001250 LY_ERR ret;
Michal Vaskocc048b22020-03-27 15:52:38 +01001251 struct lyxp_set xp_set;
1252 struct lysc_must *musts;
1253 const struct lyd_node *tree;
Radek Krejci9a3823e2021-01-27 20:26:46 +01001254 const struct lysc_node *schema;
Michal Vaskoe9391c72021-10-05 10:04:56 +02001255 const char *emsg, *eapptag;
Michal Vaskofd69e1d2020-07-03 11:57:17 +02001256 LY_ARRAY_COUNT_TYPE u;
Michal Vaskocc048b22020-03-27 15:52:38 +01001257
Michal Vaskoe0665742021-02-11 11:08:44 +01001258 assert((int_opts & (LYD_INTOPT_RPC | LYD_INTOPT_REPLY)) != (LYD_INTOPT_RPC | LYD_INTOPT_REPLY));
1259 assert((int_opts & (LYD_INTOPT_ACTION | LYD_INTOPT_REPLY)) != (LYD_INTOPT_ACTION | LYD_INTOPT_REPLY));
1260
Radek Krejci9a3823e2021-01-27 20:26:46 +01001261 if (node->schema->nodetype & (LYS_ACTION | LYS_RPC)) {
Michal Vaskoe0665742021-02-11 11:08:44 +01001262 if (int_opts & (LYD_INTOPT_RPC | LYD_INTOPT_ACTION)) {
Radek Krejci9a3823e2021-01-27 20:26:46 +01001263 schema = &((struct lysc_node_action *)node->schema)->input.node;
Michal Vaskoe0665742021-02-11 11:08:44 +01001264 } else if (int_opts & LYD_INTOPT_REPLY) {
Radek Krejci9a3823e2021-01-27 20:26:46 +01001265 schema = &((struct lysc_node_action *)node->schema)->output.node;
Michal Vaskocb7526d2020-03-30 15:08:26 +02001266 } else {
Michal Vaskoa1db2342021-07-19 12:23:23 +02001267 LOGINT_RET(LYD_CTX(node));
Michal Vaskocb7526d2020-03-30 15:08:26 +02001268 }
Radek Krejci9a3823e2021-01-27 20:26:46 +01001269 } else {
1270 schema = node->schema;
Michal Vaskocc048b22020-03-27 15:52:38 +01001271 }
Radek Krejci9a3823e2021-01-27 20:26:46 +01001272 musts = lysc_node_musts(schema);
Michal Vaskocc048b22020-03-27 15:52:38 +01001273 if (!musts) {
1274 /* no must to evaluate */
1275 return LY_SUCCESS;
1276 }
1277
1278 /* find first top-level node */
Michal Vasko9e685082021-01-29 14:49:09 +01001279 for (tree = node; tree->parent; tree = lyd_parent(tree)) {}
Michal Vaskof9221e62021-02-04 12:10:14 +01001280 tree = lyd_first_sibling(tree);
Michal Vaskocc048b22020-03-27 15:52:38 +01001281
1282 LY_ARRAY_FOR(musts, u) {
1283 memset(&xp_set, 0, sizeof xp_set);
1284
1285 /* evaluate must */
Michal Vaskoa1db2342021-07-19 12:23:23 +02001286 ret = lyxp_eval(LYD_CTX(node), musts[u].cond, node->schema->module, LY_VALUE_SCHEMA_RESOLVED,
aPiecekfba75362021-10-07 12:39:48 +02001287 musts[u].prefixes, node, tree, NULL, &xp_set, LYXP_SCHEMA);
Michal Vaskoa1db2342021-07-19 12:23:23 +02001288 if (ret == LY_EINCOMPLETE) {
1289 LOGINT_RET(LYD_CTX(node));
1290 } else if (ret) {
1291 return ret;
1292 }
Michal Vaskocc048b22020-03-27 15:52:38 +01001293
1294 /* check the result */
1295 lyxp_set_cast(&xp_set, LYXP_SET_BOOLEAN);
Michal Vasko004d3152020-06-11 19:59:22 +02001296 if (!xp_set.val.bln) {
Michal Vaskoe9391c72021-10-05 10:04:56 +02001297 /* use specific error information */
1298 emsg = musts[u].emsg;
1299 eapptag = musts[u].eapptag ? musts[u].eapptag : "must-violation";
1300 if (emsg) {
1301 LOGVAL_APPTAG(LYD_CTX(node), eapptag, LYVE_DATA, "%s", emsg);
1302 } else {
1303 LOGVAL_APPTAG(LYD_CTX(node), eapptag, LY_VCODE_NOMUST, musts[u].cond->expr);
1304 }
Michal Vaskocc048b22020-03-27 15:52:38 +01001305 return LY_EVALID;
1306 }
1307 }
1308
1309 return LY_SUCCESS;
1310}
1311
Michal Vaskoe0665742021-02-11 11:08:44 +01001312/**
1313 * @brief Perform all remaining validation tasks, the data tree must be final when calling this function.
1314 *
1315 * @param[in] first First sibling.
1316 * @param[in] parent Data parent.
1317 * @param[in] sparent Schema parent of the siblings, NULL for top-level siblings.
1318 * @param[in] mod Module of the siblings, NULL for nested siblings.
1319 * @param[in] val_opts Validation options (@ref datavalidationoptions).
1320 * @param[in] int_opts Internal parser options.
1321 * @return LY_ERR value.
1322 */
1323static LY_ERR
Michal Vaskobd4db892020-11-23 16:58:20 +01001324lyd_validate_final_r(struct lyd_node *first, const struct lyd_node *parent, const struct lysc_node *sparent,
Michal Vaskoe0665742021-02-11 11:08:44 +01001325 const struct lys_module *mod, uint32_t val_opts, uint32_t int_opts)
Michal Vaskoacd83e72020-02-04 14:12:01 +01001326{
Michal Vasko22e8f1f2021-12-02 09:26:06 +01001327 LY_ERR r;
1328 const char *innode;
Radek Krejci7f769d72020-07-11 23:13:56 +02001329 struct lyd_node *next = NULL, *node;
Michal Vaskoacd83e72020-02-04 14:12:01 +01001330
Michal Vasko14654712020-02-06 08:35:21 +01001331 /* validate all restrictions of nodes themselves */
Michal Vaskob1b5c262020-03-05 14:29:47 +01001332 LY_LIST_FOR_SAFE(first, next, node) {
Michal Vasko61ad1ff2022-02-10 15:48:39 +01001333 if (node->flags & LYD_EXT) {
1334 /* ext instance data should have already been validated */
1335 continue;
1336 }
1337
Michal Vasko19034e22021-07-19 12:24:14 +02001338 if (!node->parent && mod && (lyd_owner_module(node) != mod)) {
Michal Vaskob1b5c262020-03-05 14:29:47 +01001339 /* all top-level data from this module checked */
1340 break;
Michal Vaskof03ed032020-03-04 13:31:44 +01001341 }
1342
Radek Krejciddace2c2021-01-08 11:30:56 +01001343 LOG_LOCSET(node->schema, node, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +01001344
Michal Vaskoa8c61722020-03-27 16:59:32 +01001345 /* opaque data */
1346 if (!node->schema) {
Michal Vasko5900da42021-08-04 11:02:43 +02001347 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 +01001348 LOG_LOCBACK(1, 1, 0, 0);
Michal Vaskoa8c61722020-03-27 16:59:32 +01001349 return LY_EVALID;
1350 }
1351
Michal Vasko8d289f92021-12-02 10:11:00 +01001352 /* no state/input/output/op data */
Michal Vasko22e8f1f2021-12-02 09:26:06 +01001353 innode = NULL;
Radek Krejci7931b192020-06-25 17:05:03 +02001354 if ((val_opts & LYD_VALIDATE_NO_STATE) && (node->schema->flags & LYS_CONFIG_R)) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001355 innode = "state";
Michal Vaskoe0665742021-02-11 11:08:44 +01001356 } else if ((int_opts & (LYD_INTOPT_RPC | LYD_INTOPT_ACTION)) && (node->schema->flags & LYS_IS_OUTPUT)) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001357 innode = "output";
Michal Vaskoe0665742021-02-11 11:08:44 +01001358 } else if ((int_opts & LYD_INTOPT_REPLY) && (node->schema->flags & LYS_IS_INPUT)) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001359 innode = "input";
Michal Vasko8d289f92021-12-02 10:11:00 +01001360 } else if (!(int_opts & (LYD_INTOPT_RPC | LYD_INTOPT_REPLY)) && (node->schema->nodetype == LYS_RPC)) {
1361 innode = "rpc";
1362 } else if (!(int_opts & (LYD_INTOPT_ACTION | LYD_INTOPT_REPLY)) && (node->schema->nodetype == LYS_ACTION)) {
1363 innode = "action";
1364 } else if (!(int_opts & LYD_INTOPT_NOTIF) && (node->schema->nodetype == LYS_NOTIF)) {
1365 innode = "notification";
Michal Vasko22e8f1f2021-12-02 09:26:06 +01001366 }
1367 if (innode) {
1368 LOGVAL(LYD_CTX(node), LY_VCODE_UNEXPNODE, innode, node->schema->name);
1369 LOG_LOCBACK(1, 1, 0, 0);
1370 return LY_EVALID;
Michal Vasko5b37a352020-03-06 13:38:33 +01001371 }
1372
Michal Vaskoe75ecfd2020-03-06 14:12:28 +01001373 /* obsolete data */
1374 lyd_validate_obsolete(node);
1375
Michal Vaskocc048b22020-03-27 15:52:38 +01001376 /* node's musts */
Michal Vasko22e8f1f2021-12-02 09:26:06 +01001377 if ((r = lyd_validate_must(node, int_opts))) {
1378 LOG_LOCBACK(1, 1, 0, 0);
1379 return r;
1380 }
Michal Vaskocc048b22020-03-27 15:52:38 +01001381
Michal Vasko53d97a12020-11-05 17:39:10 +01001382 /* node value was checked by plugins */
Radek Krejci2efc45b2020-12-22 16:25:44 +01001383
Michal Vasko22e8f1f2021-12-02 09:26:06 +01001384 /* next iter */
Radek Krejciddace2c2021-01-08 11:30:56 +01001385 LOG_LOCBACK(1, 1, 0, 0);
Michal Vasko14654712020-02-06 08:35:21 +01001386 }
Michal Vaskocde73ac2019-11-14 16:10:27 +01001387
Michal Vasko14654712020-02-06 08:35:21 +01001388 /* validate schema-based restrictions */
Michal Vaskoe0665742021-02-11 11:08:44 +01001389 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 +01001390
Michal Vaskob1b5c262020-03-05 14:29:47 +01001391 LY_LIST_FOR(first, node) {
Michal Vasko19034e22021-07-19 12:24:14 +02001392 if (!node->parent && mod && (lyd_owner_module(node) != mod)) {
1393 /* all top-level data from this module checked */
1394 break;
1395 }
1396
Michal Vasko14654712020-02-06 08:35:21 +01001397 /* validate all children recursively */
Michal Vaskoe0665742021-02-11 11:08:44 +01001398 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 +01001399
Michal Vaskob1b5c262020-03-05 14:29:47 +01001400 /* set default for containers */
aPiecekc5f36a72021-05-18 14:12:31 +02001401 if (node->schema && (node->schema->nodetype == LYS_CONTAINER) && !(node->schema->flags & LYS_PRESENCE)) {
Radek Krejcia1c1e542020-09-29 16:06:52 +02001402 LY_LIST_FOR(lyd_child(node), next) {
Michal Vaskob1b5c262020-03-05 14:29:47 +01001403 if (!(next->flags & LYD_DEFAULT)) {
1404 break;
1405 }
Michal Vaskoa3881362020-01-21 15:57:35 +01001406 }
Michal Vaskob1b5c262020-03-05 14:29:47 +01001407 if (!next) {
1408 node->flags |= LYD_DEFAULT;
1409 }
Michal Vasko9b368d32020-02-14 13:53:31 +01001410 }
1411 }
1412
1413 return LY_SUCCESS;
1414}
1415
Radek Krejci7931b192020-06-25 17:05:03 +02001416/**
Michal Vaskoddd76592022-01-17 13:34:48 +01001417 * @brief Validate extension instance data by storing it in its unres set.
1418 *
1419 * @param[in] sibling First sibling with ::LYD_EXT flag, all the following ones are expected to have it, too.
1420 * @param[in,out] ext_val Set with parsed extension instance data to validate.
1421 * @return LY_ERR value.
1422 */
1423static LY_ERR
1424lyd_validate_nested_ext(struct lyd_node *sibling, struct ly_set *ext_val)
1425{
1426 struct lyd_node *node;
1427 struct lyd_ctx_ext_val *ext_v;
1428 struct lysc_ext_instance *nested_exts, *ext = NULL;
1429 LY_ARRAY_COUNT_TYPE u;
1430
1431 /* check of basic assumptions */
1432 if (!sibling->parent || !sibling->parent->schema) {
1433 LOGINT_RET(LYD_CTX(sibling));
1434 }
1435 LY_LIST_FOR(sibling, node) {
1436 if (!(node->flags & LYD_EXT)) {
1437 LOGINT_RET(LYD_CTX(sibling));
1438 }
1439 }
1440
1441 /* try to find the extension instance */
1442 nested_exts = sibling->parent->schema->exts;
1443 LY_ARRAY_FOR(nested_exts, u) {
1444 if (nested_exts[u].def->plugin->validate) {
1445 if (ext) {
1446 /* more extension instances with validate callback */
1447 LOGINT_RET(LYD_CTX(sibling));
1448 }
1449 ext = &nested_exts[u];
1450 }
1451 }
1452 if (!ext) {
1453 /* no extension instance with validate callback */
1454 LOGINT_RET(LYD_CTX(sibling));
1455 }
1456
1457 /* store for validation */
1458 ext_v = malloc(sizeof *ext_v);
1459 LY_CHECK_ERR_RET(!ext_v, LOGMEM(LYD_CTX(sibling)), LY_EMEM);
1460 ext_v->ext = ext;
1461 ext_v->sibling = sibling;
1462 LY_CHECK_RET(ly_set_add(ext_val, ext_v, 1, NULL));
1463
1464 return LY_SUCCESS;
1465}
1466
1467/**
Michal Vaskobb844672020-07-03 11:06:12 +02001468 * @brief Validate the whole data subtree.
1469 *
1470 * @param[in] root Subtree root.
Michal Vaskoe0665742021-02-11 11:08:44 +01001471 * @param[in,out] node_when Set for nodes with when conditions.
Michal Vasko32711382020-12-03 14:14:31 +01001472 * @param[in,out] node_types Set for unres node types.
1473 * @param[in,out] meta_types Set for unres metadata types.
Michal Vaskoddd76592022-01-17 13:34:48 +01001474 * @param[in,out] ext_val Set for parsed extension data to validate.
Michal Vasko29adfbe2020-12-08 17:12:03 +01001475 * @param[in] impl_opts Implicit options, see @ref implicitoptions.
Michal Vasko8104fd42020-07-13 11:09:51 +02001476 * @param[in,out] diff Validation diff.
Michal Vaskobb844672020-07-03 11:06:12 +02001477 * @return LY_ERR value.
Radek Krejci7931b192020-06-25 17:05:03 +02001478 */
Michal Vaskob1b5c262020-03-05 14:29:47 +01001479static LY_ERR
Michal Vaskoddd76592022-01-17 13:34:48 +01001480lyd_validate_subtree(struct lyd_node *root, struct ly_set *node_when, struct ly_set *node_types,
1481 struct ly_set *meta_types, struct ly_set *ext_val, uint32_t impl_opts, struct lyd_node **diff)
Michal Vaskofea12c62020-03-30 11:00:15 +02001482{
1483 const struct lyd_meta *meta;
Michal Vasko56daf732020-08-10 10:57:18 +02001484 struct lyd_node *node;
Michal Vaskofea12c62020-03-30 11:00:15 +02001485
Michal Vasko56daf732020-08-10 10:57:18 +02001486 LYD_TREE_DFS_BEGIN(root, node) {
Michal Vaskoddd76592022-01-17 13:34:48 +01001487 if (node->flags & LYD_EXT) {
1488 /* validate using the extension instance callback */
1489 return lyd_validate_nested_ext(node, ext_val);
1490 }
1491
Michal Vasko5900da42021-08-04 11:02:43 +02001492 if (!node->schema) {
Michal Vaskoddd76592022-01-17 13:34:48 +01001493 /* do not validate opaque nodes */
aPiecek18a844e2021-08-10 11:06:24 +02001494 goto next_node;
Michal Vasko5900da42021-08-04 11:02:43 +02001495 }
1496
Michal Vasko0275cf62020-11-05 17:40:30 +01001497 LY_LIST_FOR(node->meta, meta) {
Radek Krejci1b2eef82021-02-17 11:17:27 +01001498 if ((*(const struct lysc_type **)meta->annotation->substmts[ANNOTATION_SUBSTMT_TYPE].storage)->plugin->validate) {
Michal Vasko0275cf62020-11-05 17:40:30 +01001499 /* metadata type resolution */
Michal Vasko32711382020-12-03 14:14:31 +01001500 LY_CHECK_RET(ly_set_add(meta_types, (void *)meta, 1, NULL));
Michal Vaskofea12c62020-03-30 11:00:15 +02001501 }
Michal Vasko0275cf62020-11-05 17:40:30 +01001502 }
Michal Vaskofea12c62020-03-30 11:00:15 +02001503
Michal Vasko0275cf62020-11-05 17:40:30 +01001504 if ((node->schema->nodetype & LYD_NODE_TERM) && ((struct lysc_node_leaf *)node->schema)->type->plugin->validate) {
1505 /* node type resolution */
Michal Vasko32711382020-12-03 14:14:31 +01001506 LY_CHECK_RET(ly_set_add(node_types, (void *)node, 1, NULL));
Michal Vasko0275cf62020-11-05 17:40:30 +01001507 } else if (node->schema->nodetype & LYD_NODE_INNER) {
1508 /* new node validation, autodelete */
Michal Vaskoe0665742021-02-11 11:08:44 +01001509 LY_CHECK_RET(lyd_validate_new(lyd_node_child_p(node), node->schema, NULL, diff));
Michal Vaskofea12c62020-03-30 11:00:15 +02001510
Michal Vasko0275cf62020-11-05 17:40:30 +01001511 /* add nested defaults */
Michal Vaskoddd76592022-01-17 13:34:48 +01001512 LY_CHECK_RET(lyd_new_implicit_r(node, lyd_node_child_p(node), NULL, NULL, NULL, NULL, impl_opts, diff));
Michal Vasko0275cf62020-11-05 17:40:30 +01001513 }
Michal Vaskofea12c62020-03-30 11:00:15 +02001514
Michal Vaskof4d67ea2021-03-31 13:53:21 +02001515 if (lysc_has_when(node->schema)) {
Michal Vasko0275cf62020-11-05 17:40:30 +01001516 /* when evaluation */
Michal Vasko32711382020-12-03 14:14:31 +01001517 LY_CHECK_RET(ly_set_add(node_when, (void *)node, 1, NULL));
Michal Vaskofea12c62020-03-30 11:00:15 +02001518 }
1519
aPiecek18a844e2021-08-10 11:06:24 +02001520next_node:
Michal Vasko56daf732020-08-10 10:57:18 +02001521 LYD_TREE_DFS_END(root, node);
Michal Vaskofea12c62020-03-30 11:00:15 +02001522 }
1523
1524 return LY_SUCCESS;
1525}
1526
Michal Vaskoe0665742021-02-11 11:08:44 +01001527LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02001528lyd_validate(struct lyd_node **tree, const struct lys_module *module, const struct ly_ctx *ctx, uint32_t val_opts,
Michal Vaskoddd76592022-01-17 13:34:48 +01001529 ly_bool validate_subtree, struct ly_set *node_when_p, struct ly_set *node_types_p, struct ly_set *meta_types_p,
1530 struct ly_set *ext_val_p, struct lyd_node **diff)
Michal Vaskof03ed032020-03-04 13:31:44 +01001531{
1532 LY_ERR ret = LY_SUCCESS;
Michal Vasko73e47212020-12-03 14:20:16 +01001533 struct lyd_node *first, *next, **first2, *iter;
Michal Vaskob1b5c262020-03-05 14:29:47 +01001534 const struct lys_module *mod;
Michal Vaskoddd76592022-01-17 13:34:48 +01001535 struct ly_set node_types = {0}, meta_types = {0}, node_when = {0}, ext_val = {0};
Michal Vaskob1b5c262020-03-05 14:29:47 +01001536 uint32_t i = 0;
Michal Vaskof03ed032020-03-04 13:31:44 +01001537
Michal Vaskoe0665742021-02-11 11:08:44 +01001538 assert(tree && ctx);
Michal Vaskoddd76592022-01-17 13:34:48 +01001539 assert((node_when_p && node_types_p && meta_types_p && ext_val_p) ||
1540 (!node_when_p && !node_types_p && !meta_types_p && !ext_val_p));
Michal Vaskoe0665742021-02-11 11:08:44 +01001541
1542 if (!node_when_p) {
1543 node_when_p = &node_when;
1544 node_types_p = &node_types;
1545 meta_types_p = &meta_types;
Michal Vaskoddd76592022-01-17 13:34:48 +01001546 ext_val_p = &ext_val;
Michal Vasko8104fd42020-07-13 11:09:51 +02001547 }
Michal Vaskof03ed032020-03-04 13:31:44 +01001548
Michal Vaskob1b5c262020-03-05 14:29:47 +01001549 next = *tree;
1550 while (1) {
Radek Krejci7931b192020-06-25 17:05:03 +02001551 if (val_opts & LYD_VALIDATE_PRESENT) {
Michal Vaskob1b5c262020-03-05 14:29:47 +01001552 mod = lyd_data_next_module(&next, &first);
1553 } else {
Michal Vasko26e80012020-07-08 10:55:46 +02001554 mod = lyd_mod_next_module(next, module, ctx, &i, &first);
Michal Vaskof03ed032020-03-04 13:31:44 +01001555 }
Michal Vaskob1b5c262020-03-05 14:29:47 +01001556 if (!mod) {
1557 break;
1558 }
Michal Vasko7c4cf1e2020-06-22 10:04:30 +02001559 if (!first || (first == *tree)) {
Michal Vaskob1b5c262020-03-05 14:29:47 +01001560 /* make sure first2 changes are carried to tree */
1561 first2 = tree;
1562 } else {
1563 first2 = &first;
1564 }
1565
1566 /* validate new top-level nodes of this module, autodelete */
Michal Vasko8104fd42020-07-13 11:09:51 +02001567 ret = lyd_validate_new(first2, NULL, mod, diff);
1568 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskob1b5c262020-03-05 14:29:47 +01001569
Radek Krejci7be7b9f2021-02-24 11:46:27 +01001570 /* add all top-level defaults for this module, if going to validate subtree, do not add into unres sets
1571 * (lyd_validate_subtree() adds all the nodes in that case) */
Michal Vaskoddd76592022-01-17 13:34:48 +01001572 ret = lyd_new_implicit_r(NULL, first2, NULL, mod, validate_subtree ? NULL : node_when_p,
Michal Vaskoc43c8ab2021-03-05 13:32:44 +01001573 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 +02001574 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskob1b5c262020-03-05 14:29:47 +01001575
Michal Vaskod3bb12f2020-12-04 14:33:09 +01001576 /* our first module node pointer may no longer be the first */
Michal Vasko598063b2021-07-19 11:39:05 +02001577 first = *first2;
1578 lyd_first_module_sibling(&first, mod);
1579 if (!first || (first == *tree)) {
1580 first2 = tree;
1581 } else {
1582 first2 = &first;
Michal Vaskod3bb12f2020-12-04 14:33:09 +01001583 }
1584
Michal Vaskoe0665742021-02-11 11:08:44 +01001585 if (validate_subtree) {
1586 /* process nested nodes */
1587 LY_LIST_FOR(*first2, iter) {
Michal Vasko0e72b7a2021-07-16 14:53:27 +02001588 if (lyd_owner_module(iter) != mod) {
1589 break;
1590 }
1591
Michal Vaskoddd76592022-01-17 13:34:48 +01001592 ret = lyd_validate_subtree(iter, node_when_p, node_types_p, meta_types_p, ext_val_p,
Michal Vaskoe0665742021-02-11 11:08:44 +01001593 (val_opts & LYD_VALIDATE_NO_STATE) ? LYD_IMPLICIT_NO_STATE : 0, diff);
1594 LY_CHECK_GOTO(ret, cleanup);
1595 }
Michal Vaskob1b5c262020-03-05 14:29:47 +01001596 }
1597
1598 /* finish incompletely validated terminal values/attributes and when conditions */
Michal Vaskoddd76592022-01-17 13:34:48 +01001599 ret = lyd_validate_unres(first2, mod, node_when_p, 0, node_types_p, meta_types_p, ext_val_p, val_opts, diff);
Michal Vaskob1b5c262020-03-05 14:29:47 +01001600 LY_CHECK_GOTO(ret, cleanup);
1601
1602 /* perform final validation that assumes the data tree is final */
Michal Vaskobd4db892020-11-23 16:58:20 +01001603 ret = lyd_validate_final_r(*first2, NULL, NULL, mod, val_opts, 0);
Michal Vasko8104fd42020-07-13 11:09:51 +02001604 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskof03ed032020-03-04 13:31:44 +01001605 }
1606
Michal Vaskof03ed032020-03-04 13:31:44 +01001607cleanup:
Michal Vaskoe0665742021-02-11 11:08:44 +01001608 ly_set_erase(&node_when, NULL);
Michal Vasko32711382020-12-03 14:14:31 +01001609 ly_set_erase(&node_types, NULL);
1610 ly_set_erase(&meta_types, NULL);
Michal Vaskoddd76592022-01-17 13:34:48 +01001611 ly_set_erase(&ext_val, free);
Michal Vaskof03ed032020-03-04 13:31:44 +01001612 return ret;
1613}
Michal Vaskob1b5c262020-03-05 14:29:47 +01001614
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001615LIBYANG_API_DEF LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02001616lyd_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 +01001617{
Michal Vaskoe0665742021-02-11 11:08:44 +01001618 LY_CHECK_ARG_RET(NULL, tree, *tree || ctx, LY_EINVAL);
Michal Vasko892f5bf2021-11-24 10:41:05 +01001619 LY_CHECK_CTX_EQUAL_RET(*tree ? LYD_CTX(*tree) : NULL, ctx, LY_EINVAL);
Michal Vaskoe0665742021-02-11 11:08:44 +01001620 if (!ctx) {
1621 ctx = LYD_CTX(*tree);
1622 }
1623 if (diff) {
1624 *diff = NULL;
1625 }
1626
Radek Krejci4f2e3e52021-03-30 14:20:28 +02001627 return lyd_validate(tree, NULL, ctx, val_opts, 1, NULL, NULL, NULL, NULL, diff);
Michal Vaskob1b5c262020-03-05 14:29:47 +01001628}
1629
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001630LIBYANG_API_DEF LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02001631lyd_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 +01001632{
Michal Vaskoe0665742021-02-11 11:08:44 +01001633 LY_CHECK_ARG_RET(NULL, tree, *tree || module, LY_EINVAL);
Michal Vasko892f5bf2021-11-24 10:41:05 +01001634 LY_CHECK_CTX_EQUAL_RET(*tree ? LYD_CTX(*tree) : NULL, module ? module->ctx : NULL, LY_EINVAL);
Michal Vaskoe0665742021-02-11 11:08:44 +01001635 if (diff) {
1636 *diff = NULL;
1637 }
1638
Radek Krejci4f2e3e52021-03-30 14:20:28 +02001639 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 +01001640}
Michal Vaskofea12c62020-03-30 11:00:15 +02001641
Michal Vaskobb844672020-07-03 11:06:12 +02001642/**
1643 * @brief Find nodes for merging an operation into data tree for validation.
1644 *
1645 * @param[in] op_tree Full operation data tree.
1646 * @param[in] op_node Operation node itself.
1647 * @param[in] tree Data tree to be merged into.
1648 * @param[out] op_subtree Operation subtree to merge.
Michal Vasko2f03d222020-12-09 18:15:51 +01001649 * @param[out] tree_sibling Data tree sibling to merge next to, is set if @p tree_parent is NULL.
1650 * @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 +02001651 */
Michal Vaskocb7526d2020-03-30 15:08:26 +02001652static void
Michal Vaskobb844672020-07-03 11:06:12 +02001653lyd_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 +01001654 struct lyd_node **op_subtree, struct lyd_node **tree_sibling, struct lyd_node **tree_parent)
Michal Vaskofea12c62020-03-30 11:00:15 +02001655{
Michal Vaskocb7526d2020-03-30 15:08:26 +02001656 const struct lyd_node *tree_iter, *op_iter;
1657 struct lyd_node *match;
Michal Vaskofea12c62020-03-30 11:00:15 +02001658 uint32_t i, cur_depth, op_depth;
Michal Vaskofea12c62020-03-30 11:00:15 +02001659
Michal Vasko2f03d222020-12-09 18:15:51 +01001660 *op_subtree = NULL;
1661 *tree_sibling = NULL;
1662 *tree_parent = NULL;
1663
Michal Vaskocb7526d2020-03-30 15:08:26 +02001664 /* learn op depth (top-level being depth 0) */
Michal Vaskofea12c62020-03-30 11:00:15 +02001665 op_depth = 0;
Michal Vasko9e685082021-01-29 14:49:09 +01001666 for (op_iter = op_node; op_iter != op_tree; op_iter = lyd_parent(op_iter)) {
Michal Vaskofea12c62020-03-30 11:00:15 +02001667 ++op_depth;
1668 }
1669
1670 /* find where to merge op */
1671 tree_iter = tree;
1672 cur_depth = op_depth;
Michal Vasko2f03d222020-12-09 18:15:51 +01001673 while (cur_depth && tree_iter) {
Michal Vaskofea12c62020-03-30 11:00:15 +02001674 /* find op iter in tree */
1675 lyd_find_sibling_first(tree_iter, op_iter, &match);
1676 if (!match) {
1677 break;
1678 }
1679
1680 /* move tree_iter */
Radek Krejcia1c1e542020-09-29 16:06:52 +02001681 tree_iter = lyd_child(match);
Michal Vaskofea12c62020-03-30 11:00:15 +02001682
1683 /* move depth */
1684 --cur_depth;
Michal Vasko2f03d222020-12-09 18:15:51 +01001685
1686 /* find next op parent */
1687 op_iter = op_node;
1688 for (i = 0; i < cur_depth; ++i) {
Michal Vasko9e685082021-01-29 14:49:09 +01001689 op_iter = lyd_parent(op_iter);
Michal Vasko2f03d222020-12-09 18:15:51 +01001690 }
Michal Vaskofea12c62020-03-30 11:00:15 +02001691 }
1692
Michal Vasko2f03d222020-12-09 18:15:51 +01001693 assert(op_iter);
Michal Vaskobb844672020-07-03 11:06:12 +02001694 *op_subtree = (struct lyd_node *)op_iter;
Michal Vasko2f03d222020-12-09 18:15:51 +01001695 if (!tree || tree_iter) {
1696 /* there is no tree whatsoever or this is the last found sibling */
1697 *tree_sibling = (struct lyd_node *)tree_iter;
1698 } else {
1699 /* matching parent was found but it has no children to insert next to */
1700 assert(match);
1701 *tree_parent = match;
1702 }
Michal Vaskocb7526d2020-03-30 15:08:26 +02001703}
1704
Michal Vaskoe0665742021-02-11 11:08:44 +01001705/**
1706 * @brief Validate an RPC/action request, reply, or notification.
1707 *
1708 * @param[in] op_tree Full operation data tree.
1709 * @param[in] op_node Operation node itself.
1710 * @param[in] dep_tree Tree to be used for validating references from the operation subtree.
1711 * @param[in] int_opts Internal parser options.
1712 * @param[in] validate_subtree Whether subtree was already validated (as part of data parsing) or not (separate validation).
1713 * @param[in] node_when_p Set of nodes with when conditions, if NULL a local set is used.
1714 * @param[in] node_types_p Set of unres node types, if NULL a local set is used.
1715 * @param[in] meta_types_p Set of unres metadata types, if NULL a local set is used.
Michal Vaskoddd76592022-01-17 13:34:48 +01001716 * @param[in] ext_val_p Set of parsed extension data to validate, if NULL a local set is used.
Michal Vaskoe0665742021-02-11 11:08:44 +01001717 * @param[out] diff Optional diff with any changes made by the validation.
1718 * @return LY_SUCCESS on success.
1719 * @return LY_ERR error on error.
1720 */
1721static LY_ERR
1722_lyd_validate_op(struct lyd_node *op_tree, struct lyd_node *op_node, const struct lyd_node *dep_tree,
Michal Vaskoddd76592022-01-17 13:34:48 +01001723 uint32_t int_opts, ly_bool validate_subtree, struct ly_set *node_when_p, struct ly_set *node_types_p,
1724 struct ly_set *meta_types_p, struct ly_set *ext_val_p, struct lyd_node **diff)
Michal Vaskocb7526d2020-03-30 15:08:26 +02001725{
Michal Vaskoe0665742021-02-11 11:08:44 +01001726 LY_ERR rc = LY_SUCCESS;
1727 struct lyd_node *tree_sibling, *tree_parent, *op_subtree, *op_parent, *child;
Michal Vaskoddd76592022-01-17 13:34:48 +01001728 struct ly_set node_types = {0}, meta_types = {0}, node_when = {0}, ext_val = {0};
Michal Vaskocb7526d2020-03-30 15:08:26 +02001729
Michal Vaskoe0665742021-02-11 11:08:44 +01001730 assert(op_tree && op_node);
Michal Vaskoddd76592022-01-17 13:34:48 +01001731 assert((node_when_p && node_types_p && meta_types_p && ext_val_p) ||
1732 (!node_when_p && !node_types_p && !meta_types_p && !ext_val_p));
Michal Vaskoe0665742021-02-11 11:08:44 +01001733
1734 if (!node_when_p) {
1735 node_when_p = &node_when;
1736 node_types_p = &node_types;
1737 meta_types_p = &meta_types;
Michal Vaskoddd76592022-01-17 13:34:48 +01001738 ext_val_p = &ext_val;
Michal Vaskoe0665742021-02-11 11:08:44 +01001739 }
1740
1741 /* merge op_tree into dep_tree */
1742 lyd_val_op_merge_find(op_tree, op_node, dep_tree, &op_subtree, &tree_sibling, &tree_parent);
1743 op_parent = lyd_parent(op_subtree);
1744 lyd_unlink_tree(op_subtree);
Michal Vasko6ee6f432021-07-16 09:49:14 +02001745 lyd_insert_node(tree_parent, &tree_sibling, op_subtree, 0);
Michal Vaskoe0665742021-02-11 11:08:44 +01001746 if (!dep_tree) {
1747 dep_tree = tree_sibling;
1748 }
1749
1750 LOG_LOCSET(NULL, op_node, NULL, NULL);
1751
1752 if (int_opts & LYD_INTOPT_REPLY) {
1753 /* add output children defaults */
Michal Vaskoddd76592022-01-17 13:34:48 +01001754 rc = lyd_new_implicit_r(op_node, lyd_node_child_p(op_node), NULL, NULL, node_when_p, node_types_p,
Michal Vaskoe0665742021-02-11 11:08:44 +01001755 LYD_IMPLICIT_OUTPUT, diff);
1756 LY_CHECK_GOTO(rc, cleanup);
1757
1758 if (validate_subtree) {
1759 /* skip validating the operation itself, go to children directly */
1760 LY_LIST_FOR(lyd_child(op_node), child) {
Michal Vaskoddd76592022-01-17 13:34:48 +01001761 rc = lyd_validate_subtree(child, node_when_p, node_types_p, meta_types_p, ext_val_p, 0, diff);
Radek Krejci4f2e3e52021-03-30 14:20:28 +02001762 LY_CHECK_GOTO(rc, cleanup);
Michal Vaskoe0665742021-02-11 11:08:44 +01001763 }
1764 }
1765 } else {
1766 if (validate_subtree) {
1767 /* prevalidate whole operation subtree */
Michal Vaskoddd76592022-01-17 13:34:48 +01001768 rc = lyd_validate_subtree(op_node, node_when_p, node_types_p, meta_types_p, ext_val_p, 0, diff);
Radek Krejci4f2e3e52021-03-30 14:20:28 +02001769 LY_CHECK_GOTO(rc, cleanup);
Michal Vaskoe0665742021-02-11 11:08:44 +01001770 }
1771 }
1772
1773 /* finish incompletely validated terminal values/attributes and when conditions on the full tree */
Michal Vaskoddd76592022-01-17 13:34:48 +01001774 LY_CHECK_GOTO(rc = lyd_validate_unres((struct lyd_node **)&dep_tree, NULL, node_when_p, 0, node_types_p,
1775 meta_types_p, ext_val_p, 0, diff), cleanup);
Michal Vaskoe0665742021-02-11 11:08:44 +01001776
1777 /* perform final validation of the operation/notification */
1778 lyd_validate_obsolete(op_node);
1779 LY_CHECK_GOTO(rc = lyd_validate_must(op_node, int_opts), cleanup);
1780
1781 /* final validation of all the descendants */
1782 LY_CHECK_GOTO(rc = lyd_validate_final_r(lyd_child(op_node), op_node, op_node->schema, NULL, 0, int_opts), cleanup);
1783
1784cleanup:
1785 LOG_LOCBACK(0, 1, 0, 0);
1786 /* restore operation tree */
1787 lyd_unlink_tree(op_subtree);
1788 if (op_parent) {
Michal Vasko6ee6f432021-07-16 09:49:14 +02001789 lyd_insert_node(op_parent, NULL, op_subtree, 0);
Michal Vaskoe0665742021-02-11 11:08:44 +01001790 }
1791
1792 ly_set_erase(&node_when, NULL);
1793 ly_set_erase(&node_types, NULL);
1794 ly_set_erase(&meta_types, NULL);
Michal Vaskoddd76592022-01-17 13:34:48 +01001795 ly_set_erase(&ext_val, free);
Michal Vaskoe0665742021-02-11 11:08:44 +01001796 return rc;
1797}
1798
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001799LIBYANG_API_DEF LY_ERR
Michal Vaskoe0665742021-02-11 11:08:44 +01001800lyd_validate_op(struct lyd_node *op_tree, const struct lyd_node *dep_tree, enum lyd_type data_type, struct lyd_node **diff)
1801{
1802 struct lyd_node *op_node;
1803 uint32_t int_opts;
1804
Michal Vasko1e4c68e2021-02-18 15:03:01 +01001805 LY_CHECK_ARG_RET(NULL, op_tree, !op_tree->parent, !dep_tree || !dep_tree->parent, (data_type == LYD_TYPE_RPC_YANG) ||
1806 (data_type == LYD_TYPE_NOTIF_YANG) || (data_type == LYD_TYPE_REPLY_YANG), LY_EINVAL);
Michal Vasko892f5bf2021-11-24 10:41:05 +01001807 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 +02001808 if (diff) {
1809 *diff = NULL;
1810 }
Michal Vasko1e4c68e2021-02-18 15:03:01 +01001811 if (data_type == LYD_TYPE_RPC_YANG) {
Michal Vaskoe0665742021-02-11 11:08:44 +01001812 int_opts = LYD_INTOPT_RPC | LYD_INTOPT_ACTION;
Michal Vasko1e4c68e2021-02-18 15:03:01 +01001813 } else if (data_type == LYD_TYPE_NOTIF_YANG) {
Michal Vaskoe0665742021-02-11 11:08:44 +01001814 int_opts = LYD_INTOPT_NOTIF;
1815 } else {
1816 int_opts = LYD_INTOPT_REPLY;
1817 }
Michal Vaskocb7526d2020-03-30 15:08:26 +02001818
1819 /* find the operation/notification */
Michal Vasko56daf732020-08-10 10:57:18 +02001820 LYD_TREE_DFS_BEGIN(op_tree, op_node) {
Michal Vaskoe0665742021-02-11 11:08:44 +01001821 if ((int_opts & (LYD_INTOPT_RPC | LYD_INTOPT_ACTION | LYD_INTOPT_REPLY)) &&
1822 (op_node->schema->nodetype & (LYS_RPC | LYS_ACTION))) {
Michal Vaskocb7526d2020-03-30 15:08:26 +02001823 break;
Michal Vaskoe0665742021-02-11 11:08:44 +01001824 } else if ((int_opts & LYD_INTOPT_NOTIF) && (op_node->schema->nodetype == LYS_NOTIF)) {
Michal Vaskocb7526d2020-03-30 15:08:26 +02001825 break;
1826 }
Michal Vasko56daf732020-08-10 10:57:18 +02001827 LYD_TREE_DFS_END(op_tree, op_node);
Michal Vaskocb7526d2020-03-30 15:08:26 +02001828 }
Michal Vaskoe0665742021-02-11 11:08:44 +01001829 if (int_opts & (LYD_INTOPT_RPC | LYD_INTOPT_ACTION | LYD_INTOPT_REPLY)) {
Radek Krejci7931b192020-06-25 17:05:03 +02001830 if (!(op_node->schema->nodetype & (LYS_RPC | LYS_ACTION))) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001831 LOGERR(LYD_CTX(op_tree), LY_EINVAL, "No RPC/action to validate found.");
Michal Vaskocb7526d2020-03-30 15:08:26 +02001832 return LY_EINVAL;
1833 }
1834 } else {
Radek Krejci7931b192020-06-25 17:05:03 +02001835 if (op_node->schema->nodetype != LYS_NOTIF) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001836 LOGERR(LYD_CTX(op_tree), LY_EINVAL, "No notification to validate found.");
Michal Vaskocb7526d2020-03-30 15:08:26 +02001837 return LY_EINVAL;
1838 }
1839 }
1840
Michal Vaskoe0665742021-02-11 11:08:44 +01001841 /* validate */
Radek Krejci4f2e3e52021-03-30 14:20:28 +02001842 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 +02001843}