blob: e4c51dd1802f5e08ac0f68325b19c05364a571d5 [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 *
6 * Copyright (c) 2019 CESNET, z.s.p.o.
7 *
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 */
Radek Krejcif8dc59a2020-11-25 13:47:44 +010014#define _POSIX_C_SOURCE 200809L /* 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 Krejci535ea9f2020-05-29 16:01:05 +020019#include <stdint.h>
Michal Vasko52927e22020-03-16 17:26:14 +010020#include <stdio.h>
21#include <stdlib.h>
Radek Krejci535ea9f2020-05-29 16:01:05 +020022#include <string.h>
Michal Vaskocde73ac2019-11-14 16:10:27 +010023
Radek Krejci535ea9f2020-05-29 16:01:05 +020024#include "common.h"
Michal Vasko69730152020-10-09 16:30:07 +020025#include "compat.h"
Michal Vasko8104fd42020-07-13 11:09:51 +020026#include "diff.h"
Radek Krejci535ea9f2020-05-29 16:01:05 +020027#include "hash_table.h"
28#include "log.h"
Radek Krejci7931b192020-06-25 17:05:03 +020029#include "parser_data.h"
Michal Vaskofeca4fb2020-10-05 08:58:40 +020030#include "plugins_exts_metadata.h"
Radek Krejci535ea9f2020-05-29 16:01:05 +020031#include "plugins_types.h"
32#include "set.h"
33#include "tree.h"
Radek Krejci47fab892020-11-05 17:02:41 +010034#include "tree_data.h"
Michal Vaskocde73ac2019-11-14 16:10:27 +010035#include "tree_data_internal.h"
Radek Krejci535ea9f2020-05-29 16:01:05 +020036#include "tree_schema.h"
Michal Vasko14654712020-02-06 08:35:21 +010037#include "tree_schema_internal.h"
Radek Krejci535ea9f2020-05-29 16:01:05 +020038#include "xpath.h"
Michal Vaskocde73ac2019-11-14 16:10:27 +010039
Michal Vaskoa6669ba2020-08-06 16:14:26 +020040LY_ERR
Michal Vasko8104fd42020-07-13 11:09:51 +020041lyd_val_diff_add(const struct lyd_node *node, enum lyd_diff_op op, struct lyd_node **diff)
42{
43 LY_ERR ret = LY_SUCCESS;
44 struct lyd_node *new_diff = NULL;
Michal Vasko81bc5512020-11-13 18:05:18 +010045 const struct lyd_node *prev_inst;
46 char *key = NULL, *value = NULL;
47 size_t buflen = 0, bufused = 0;
Michal Vasko8104fd42020-07-13 11:09:51 +020048
49 assert((op == LYD_DIFF_OP_DELETE) || (op == LYD_DIFF_OP_CREATE));
50
Michal Vasko81bc5512020-11-13 18:05:18 +010051 if ((op == LYD_DIFF_OP_CREATE) && lysc_is_userordered(node->schema)) {
52 if (node->prev->next && (node->prev->schema == node->schema)) {
53 prev_inst = node->prev;
54 } else {
55 /* first instance */
56 prev_inst = NULL;
57 }
58
59 if (node->schema->nodetype == LYS_LIST) {
60 /* generate key meta */
61 if (prev_inst) {
62 LY_CHECK_GOTO(ret = lyd_path_list_predicate(prev_inst, &key, &buflen, &bufused, 0), cleanup);
63 } else {
64 key = strdup("");
65 LY_CHECK_ERR_GOTO(!key, LOGMEM(LYD_CTX(node)); ret = LY_EMEM, cleanup);
66 }
67 } else {
68 /* generate value meta */
69 if (prev_inst) {
70 value = strdup(LYD_CANON_VALUE(prev_inst));
71 LY_CHECK_ERR_GOTO(!value, LOGMEM(LYD_CTX(node)); ret = LY_EMEM, cleanup);
72 } else {
73 value = strdup("");
74 LY_CHECK_ERR_GOTO(!value, LOGMEM(LYD_CTX(node)); ret = LY_EMEM, cleanup);
75 }
76 }
77 }
78
Michal Vasko8104fd42020-07-13 11:09:51 +020079 /* create new diff tree */
Michal Vasko81bc5512020-11-13 18:05:18 +010080 LY_CHECK_GOTO(ret = lyd_diff_add(node, op, NULL, NULL, key, value, NULL, &new_diff), cleanup);
Michal Vasko8104fd42020-07-13 11:09:51 +020081
82 /* merge into existing diff */
Michal Vaskoc0e58e82020-11-11 19:04:33 +010083 ret = lyd_diff_merge_all(diff, new_diff, 0);
Michal Vasko8104fd42020-07-13 11:09:51 +020084
Michal Vasko81bc5512020-11-13 18:05:18 +010085cleanup:
Michal Vasko8104fd42020-07-13 11:09:51 +020086 lyd_free_tree(new_diff);
Michal Vasko81bc5512020-11-13 18:05:18 +010087 free(key);
88 free(value);
Michal Vasko8104fd42020-07-13 11:09:51 +020089 return ret;
90}
91
92/**
Michal Vaskobd4db892020-11-23 16:58:20 +010093 * @brief Evaluate all relevant "when" conditions of a node.
Michal Vaskocde73ac2019-11-14 16:10:27 +010094 *
Michal Vaskobd4db892020-11-23 16:58:20 +010095 * @param[in] tree Data tree.
96 * @param[in] node Node whose relevant when conditions will be evaluated.
97 * @param[in] schema Schema node of @p node. It may not be possible to use directly if @p node is opaque.
98 * @param[out] disabled First when that evaluated false, if any.
99 * @return LY_SUCCESS on success.
100 * @return LY_EINCOMPLETE if a referenced node does not have its when evaluated.
101 * @return LY_ERR value on error.
Michal Vaskocde73ac2019-11-14 16:10:27 +0100102 */
103static LY_ERR
Michal Vaskobd4db892020-11-23 16:58:20 +0100104lyd_validate_node_when(const struct lyd_node *tree, const struct lyd_node *node, const struct lysc_node *schema,
105 const struct lysc_when **disabled)
Michal Vaskocde73ac2019-11-14 16:10:27 +0100106{
Michal Vasko8104fd42020-07-13 11:09:51 +0200107 LY_ERR ret;
Michal Vaskocde73ac2019-11-14 16:10:27 +0100108 const struct lyd_node *ctx_node;
Michal Vaskobd4db892020-11-23 16:58:20 +0100109 const struct lysc_when *when;
Michal Vaskocde73ac2019-11-14 16:10:27 +0100110 struct lyxp_set xp_set;
Michal Vaskobd4db892020-11-23 16:58:20 +0100111 LY_ARRAY_COUNT_TYPE u;
Michal Vaskocde73ac2019-11-14 16:10:27 +0100112
Michal Vaskobd4db892020-11-23 16:58:20 +0100113 assert(!node->schema || (node->schema == schema));
Michal Vaskocde73ac2019-11-14 16:10:27 +0100114
Michal Vaskobd4db892020-11-23 16:58:20 +0100115 *disabled = NULL;
Michal Vaskocde73ac2019-11-14 16:10:27 +0100116
Michal Vaskobd4db892020-11-23 16:58:20 +0100117 do {
118 LY_ARRAY_FOR(schema->when, u) {
119 when = schema->when[u];
Michal Vaskocde73ac2019-11-14 16:10:27 +0100120
Michal Vaskobd4db892020-11-23 16:58:20 +0100121 /* get context node */
122 if (when->context == schema) {
123 ctx_node = node;
124 } else {
125 assert((!when->context && !node->parent) || (when->context == node->parent->schema));
126 ctx_node = (struct lyd_node *)node->parent;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100127 }
Michal Vaskobd4db892020-11-23 16:58:20 +0100128
129 /* evaluate when */
130 memset(&xp_set, 0, sizeof xp_set);
Michal Vasko400e9672021-01-11 13:39:17 +0100131 ret = lyxp_eval(LYD_CTX(node), when->cond, schema->module, LY_PREF_SCHEMA_RESOLVED, when->prefixes,
132 ctx_node, tree, &xp_set, LYXP_SCHEMA);
Michal Vaskobd4db892020-11-23 16:58:20 +0100133 lyxp_set_cast(&xp_set, LYXP_SET_BOOLEAN);
134
135 /* return error or LY_EINCOMPLETE for dependant unresolved when */
136 LY_CHECK_RET(ret);
137
138 if (!xp_set.val.bln) {
139 /* false when */
140 *disabled = when;
141 return LY_SUCCESS;
Michal Vasko8104fd42020-07-13 11:09:51 +0200142 }
Michal Vaskocde73ac2019-11-14 16:10:27 +0100143 }
Michal Vaskobd4db892020-11-23 16:58:20 +0100144
145 schema = schema->parent;
146 } while (schema && (schema->nodetype & (LYS_CASE | LYS_CHOICE)));
147
148 return LY_SUCCESS;
149}
150
151/**
152 * @brief Evaluate when conditions of collected unres nodes.
153 *
154 * @param[in,out] tree Data tree, is updated if some nodes are autodeleted.
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100155 * @param[in] mod Module of the @p tree to take into consideration when deleting @p tree and moving it.
156 * If set, it is expected @p tree should point to the first node of @p mod. Otherwise it will simply be
157 * the first top-level sibling.
Michal Vaskobd4db892020-11-23 16:58:20 +0100158 * @param[in] node_when Set with nodes with "when" conditions.
159 * @param[in,out] diff Validation diff.
160 * @return LY_SUCCESS on success.
161 * @return LY_ERR value on error.
162 */
163static LY_ERR
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100164lyd_validate_unres_when(struct lyd_node **tree, const struct lys_module *mod, struct ly_set *node_when,
165 struct lyd_node **diff)
Michal Vaskobd4db892020-11-23 16:58:20 +0100166{
167 LY_ERR ret;
168 uint32_t i;
169 const struct lysc_when *disabled;
Radek Krejci2efc45b2020-12-22 16:25:44 +0100170 struct lyd_node *node = NULL;
Michal Vaskobd4db892020-11-23 16:58:20 +0100171
172 if (!node_when->count) {
173 return LY_SUCCESS;
Michal Vaskocde73ac2019-11-14 16:10:27 +0100174 }
175
Michal Vaskobd4db892020-11-23 16:58:20 +0100176 i = node_when->count;
177 do {
178 --i;
179 node = node_when->dnodes[i];
Radek Krejciddace2c2021-01-08 11:30:56 +0100180 LOG_LOCSET(node->schema, node, NULL, NULL);
Michal Vaskobd4db892020-11-23 16:58:20 +0100181
182 /* evaluate all when expressions that affect this node's existence */
183 ret = lyd_validate_node_when(*tree, node, node->schema, &disabled);
184 if (!ret) {
185 if (disabled) {
186 /* when false */
187 if (node->flags & LYD_WHEN_TRUE) {
188 /* autodelete */
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100189 lyd_del_move_root(tree, node, mod);
Michal Vaskobd4db892020-11-23 16:58:20 +0100190 if (diff) {
191 /* add into diff */
Radek Krejci2efc45b2020-12-22 16:25:44 +0100192 ret = lyd_val_diff_add(node, LYD_DIFF_OP_DELETE, diff);
193 LY_CHECK_GOTO(ret, error);
Michal Vaskobd4db892020-11-23 16:58:20 +0100194 }
195 lyd_free_tree(node);
196 } else {
197 /* invalid data */
Radek Krejci2efc45b2020-12-22 16:25:44 +0100198 LOGVAL(LYD_CTX(node), LY_VCODE_NOWHEN, disabled->cond->expr);
199 ret = LY_EVALID;
200 goto error;
Michal Vaskobd4db892020-11-23 16:58:20 +0100201 }
202 } else {
203 /* when true */
204 node->flags |= LYD_WHEN_TRUE;
205 }
206
207 /* remove this node from the set, its when was resolved */
208 ly_set_rm_index(node_when, i, NULL);
209 } else if (ret != LY_EINCOMPLETE) {
210 /* error */
Radek Krejci2efc45b2020-12-22 16:25:44 +0100211 goto error;
Michal Vaskobd4db892020-11-23 16:58:20 +0100212 }
Radek Krejci2efc45b2020-12-22 16:25:44 +0100213
Radek Krejciddace2c2021-01-08 11:30:56 +0100214 LOG_LOCBACK(1, 1, 0, 0);
Michal Vaskobd4db892020-11-23 16:58:20 +0100215 } while (i);
216
217 return LY_SUCCESS;
Radek Krejci2efc45b2020-12-22 16:25:44 +0100218
219error:
Radek Krejciddace2c2021-01-08 11:30:56 +0100220 LOG_LOCBACK(1, 1, 0, 0);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100221 return ret;
Michal Vaskocde73ac2019-11-14 16:10:27 +0100222}
223
224LY_ERR
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100225lyd_validate_unres(struct lyd_node **tree, const struct lys_module *mod, struct ly_set *node_when,
226 struct ly_set *node_types, struct ly_set *meta_types, struct lyd_node **diff)
Michal Vaskocde73ac2019-11-14 16:10:27 +0100227{
228 LY_ERR ret = LY_SUCCESS;
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200229 uint32_t i;
Michal Vaskocde73ac2019-11-14 16:10:27 +0100230
Michal Vaskob1b5c262020-03-05 14:29:47 +0100231 if (node_when) {
232 /* evaluate all when conditions */
233 uint32_t prev_count;
234 do {
235 prev_count = node_when->count;
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100236 LY_CHECK_RET(lyd_validate_unres_when(tree, mod, node_when, diff));
Radek Krejci0f969882020-08-21 16:56:47 +0200237 /* there must have been some when conditions resolved */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100238 } while (prev_count > node_when->count);
Michal Vaskocde73ac2019-11-14 16:10:27 +0100239
Michal Vaskob1b5c262020-03-05 14:29:47 +0100240 /* there could have been no cyclic when dependencies, checked during compilation */
241 assert(!node_when->count);
242 }
243
244 if (node_types && node_types->count) {
245 /* finish incompletely validated terminal values (traverse from the end for efficient set removal) */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200246 i = node_types->count;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100247 do {
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200248 --i;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100249
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200250 struct lyd_node_term *node = (struct lyd_node_term *)node_types->objs[i];
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200251 struct lysc_type *type = ((struct lysc_node_leaf *)node->schema)->type;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100252
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200253 /* resolve the value of the node */
Radek Krejciddace2c2021-01-08 11:30:56 +0100254 LOG_LOCSET(node->schema, (struct lyd_node *)node, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100255 ret = lyd_value_validate_incomplete(LYD_CTX(node), type, &node->value, (struct lyd_node *)node, *tree);
Radek Krejciddace2c2021-01-08 11:30:56 +0100256 LOG_LOCBACK(node->schema ? 1 : 0, 1, 0, 0);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100257 LY_CHECK_RET(ret);
258
259 /* remove this node from the set */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200260 ly_set_rm_index(node_types, i, NULL);
261 } while (i);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100262 }
263
Michal Vasko9f96a052020-03-10 09:41:45 +0100264 if (meta_types && meta_types->count) {
265 /* ... and metadata values */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200266 i = meta_types->count;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100267 do {
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200268 --i;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100269
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200270 struct lyd_meta *meta = (struct lyd_meta *)meta_types->objs[i];
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200271 struct lysc_type *type = ((struct lyext_metadata *)meta->annotation->data)->type;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100272
Michal Vasko9f96a052020-03-10 09:41:45 +0100273 /* validate and store the value of the metadata */
Radek Krejci2efc45b2020-12-22 16:25:44 +0100274 ret = lyd_value_validate_incomplete(LYD_CTX(meta->parent), type, &meta->value, meta->parent, *tree);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100275 LY_CHECK_RET(ret);
276
277 /* remove this attr from the set */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200278 ly_set_rm_index(meta_types, i, NULL);
279 } while (i);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100280 }
Michal Vaskocde73ac2019-11-14 16:10:27 +0100281
282 return ret;
283}
284
Michal Vaskobb844672020-07-03 11:06:12 +0200285/**
286 * @brief Validate instance duplication.
287 *
288 * @param[in] first First sibling to search in.
289 * @param[in] node Data node instance to check.
290 * @return LY_ERR value.
291 */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100292static LY_ERR
293lyd_validate_duplicates(const struct lyd_node *first, const struct lyd_node *node)
Michal Vaskocde73ac2019-11-14 16:10:27 +0100294{
Michal Vaskob1b5c262020-03-05 14:29:47 +0100295 struct lyd_node **match_p;
Radek Krejci857189e2020-09-01 13:26:36 +0200296 ly_bool fail = 0;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100297
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100298 assert(node->flags & LYD_NEW);
299
Michal Vaskob1b5c262020-03-05 14:29:47 +0100300 if ((node->schema->nodetype & (LYS_LIST | LYS_LEAFLIST)) && (node->schema->flags & LYS_CONFIG_R)) {
301 /* duplicate instances allowed */
302 return LY_SUCCESS;
Michal Vaskocde73ac2019-11-14 16:10:27 +0100303 }
304
Michal Vaskob1b5c262020-03-05 14:29:47 +0100305 /* find exactly the same next instance using hashes if possible */
306 if (node->parent && node->parent->children_ht) {
307 if (!lyht_find_next(node->parent->children_ht, &node, node->hash, (void **)&match_p)) {
308 fail = 1;
309 }
310 } else {
Michal Vaskod989ba02020-08-24 10:59:24 +0200311 for ( ; first; first = first->next) {
Michal Vaskob1b5c262020-03-05 14:29:47 +0100312 if (first == node) {
313 continue;
314 }
315
316 if (node->schema->nodetype & (LYD_NODE_ANY | LYS_LEAF)) {
317 if (first->schema == node->schema) {
318 fail = 1;
319 break;
320 }
Michal Vasko8f359bf2020-07-28 10:41:15 +0200321 } else if (!lyd_compare_single(first, node, 0)) {
Michal Vaskob1b5c262020-03-05 14:29:47 +0100322 fail = 1;
323 break;
324 }
325 }
326 }
327
328 if (fail) {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100329 LOGVAL(node->schema->module->ctx, LY_VCODE_DUP, node->schema->name);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100330 return LY_EVALID;
331 }
332 return LY_SUCCESS;
Michal Vaskocde73ac2019-11-14 16:10:27 +0100333}
334
Michal Vaskobb844672020-07-03 11:06:12 +0200335/**
336 * @brief Validate multiple case data existence with possible autodelete.
337 *
338 * @param[in,out] first First sibling to search in, is updated if needed.
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100339 * @param[in] mod Module of the siblings, NULL for nested siblings.
Michal Vaskobb844672020-07-03 11:06:12 +0200340 * @param[in] choic Choice node whose cases to check.
Michal Vasko8104fd42020-07-13 11:09:51 +0200341 * @param[in,out] diff Validation diff.
Michal Vaskobb844672020-07-03 11:06:12 +0200342 * @return LY_ERR value.
343 */
Michal Vaskocde73ac2019-11-14 16:10:27 +0100344static LY_ERR
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100345lyd_validate_cases(struct lyd_node **first, const struct lys_module *mod, const struct lysc_node_choice *choic,
346 struct lyd_node **diff)
Michal Vaskob1b5c262020-03-05 14:29:47 +0100347{
348 const struct lysc_node *scase, *iter, *old_case = NULL, *new_case = NULL;
349 struct lyd_node *match, *to_del;
Radek Krejci857189e2020-09-01 13:26:36 +0200350 ly_bool found;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100351
Radek Krejciddace2c2021-01-08 11:30:56 +0100352 LOG_LOCSET((const struct lysc_node *)choic, NULL, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100353
Michal Vaskob1b5c262020-03-05 14:29:47 +0100354 LY_LIST_FOR((struct lysc_node *)choic->cases, scase) {
355 found = 0;
356 iter = NULL;
357 match = NULL;
358 while ((match = lys_getnext_data(match, *first, &iter, scase, NULL))) {
359 if (match->flags & LYD_NEW) {
360 /* a new case data found, nothing more to look for */
361 found = 2;
362 break;
363 } else {
364 /* and old case data found */
365 if (found == 0) {
366 found = 1;
367 }
368 }
369 }
370
371 if (found == 1) {
372 /* there should not be 2 old cases */
373 if (old_case) {
374 /* old data from 2 cases */
Radek Krejci2efc45b2020-12-22 16:25:44 +0100375 LOGVAL(choic->module->ctx, LY_VCODE_DUPCASE, old_case->name, scase->name);
Radek Krejciddace2c2021-01-08 11:30:56 +0100376 LOG_LOCBACK(1, 0, 0, 0);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100377 return LY_EVALID;
378 }
379
380 /* remember an old existing case */
381 old_case = scase;
382 } else if (found == 2) {
383 if (new_case) {
384 /* new data from 2 cases */
Radek Krejci2efc45b2020-12-22 16:25:44 +0100385 LOGVAL(choic->module->ctx, LY_VCODE_DUPCASE, new_case->name, scase->name);
Radek Krejciddace2c2021-01-08 11:30:56 +0100386 LOG_LOCBACK(1, 0, 0, 0);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100387 return LY_EVALID;
388 }
389
390 /* remember a new existing case */
391 new_case = scase;
392 }
393 }
394
Radek Krejciddace2c2021-01-08 11:30:56 +0100395 LOG_LOCBACK(1, 0, 0, 0);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100396
Michal Vaskob1b5c262020-03-05 14:29:47 +0100397 if (old_case && new_case) {
398 /* auto-delete old case */
399 iter = NULL;
400 match = NULL;
401 to_del = NULL;
402 while ((match = lys_getnext_data(match, *first, &iter, old_case, NULL))) {
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100403 lyd_del_move_root(first, to_del, mod);
404
Michal Vasko8104fd42020-07-13 11:09:51 +0200405 /* free previous node */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100406 lyd_free_tree(to_del);
Michal Vasko8104fd42020-07-13 11:09:51 +0200407 if (diff) {
408 /* add into diff */
409 LY_CHECK_RET(lyd_val_diff_add(match, LYD_DIFF_OP_DELETE, diff));
410 }
Michal Vaskob1b5c262020-03-05 14:29:47 +0100411 to_del = match;
412 }
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100413 lyd_del_move_root(first, to_del, mod);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100414 lyd_free_tree(to_del);
415 }
416
417 return LY_SUCCESS;
418}
419
Michal Vaskobb844672020-07-03 11:06:12 +0200420/**
421 * @brief Check whether a schema node can have some default values (true for NP containers as well).
422 *
423 * @param[in] schema Schema node to check.
424 * @return non-zero if yes,
425 * @return 0 otherwise.
426 */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100427static int
428lyd_val_has_default(const struct lysc_node *schema)
429{
430 switch (schema->nodetype) {
431 case LYS_LEAF:
432 if (((struct lysc_node_leaf *)schema)->dflt) {
433 return 1;
434 }
435 break;
436 case LYS_LEAFLIST:
437 if (((struct lysc_node_leaflist *)schema)->dflts) {
438 return 1;
439 }
440 break;
441 case LYS_CONTAINER:
442 if (!(schema->flags & LYS_PRESENCE)) {
443 return 1;
444 }
445 break;
446 default:
447 break;
448 }
449
450 return 0;
451}
452
Michal Vaskobb844672020-07-03 11:06:12 +0200453/**
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100454 * @brief Properly delete a node as part of autodelete validation tasks.
455 *
456 * @param[in,out] first First sibling, is updated if needed.
457 * @param[in] node Node instance to delete.
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100458 * @param[in] mod Module of the siblings, NULL for nested siblings.
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100459 * @param[in,out] next_p Temporary LY_LIST_FOR_SAFE next pointer, is updated if needed.
460 * @param[in,out] diff Validation diff.
461 */
462static void
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100463lyd_validate_autodel_node_del(struct lyd_node **first, struct lyd_node *node, const struct lys_module *mod,
464 struct lyd_node **next_p, struct lyd_node **diff)
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100465{
466 struct lyd_node *iter;
467
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100468 lyd_del_move_root(first, node, mod);
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100469 if (node == *next_p) {
470 *next_p = (*next_p)->next;
471 }
472 if (diff) {
473 /* add into diff */
474 if ((node->schema->nodetype == LYS_CONTAINER) && !(node->schema->flags & LYS_PRESENCE)) {
475 /* we do not want to track NP container changes, but remember any removed children */
476 LY_LIST_FOR(lyd_child(node), iter) {
477 lyd_val_diff_add(iter, LYD_DIFF_OP_DELETE, diff);
478 }
479 } else {
480 lyd_val_diff_add(node, LYD_DIFF_OP_DELETE, diff);
481 }
482 }
483 lyd_free_tree(node);
484}
485
486/**
Michal Vaskobb844672020-07-03 11:06:12 +0200487 * @brief Autodelete old instances to prevent validation errors.
488 *
489 * @param[in,out] first First sibling to search in, is updated if needed.
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100490 * @param[in] node New data node instance to check.
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100491 * @param[in] mod Module of the siblings, NULL for nested siblings.
Michal Vaskobb844672020-07-03 11:06:12 +0200492 * @param[in,out] next_p Temporary LY_LIST_FOR_SAFE next pointer, is updated if needed.
Michal Vasko8104fd42020-07-13 11:09:51 +0200493 * @param[in,out] diff Validation diff.
Michal Vaskobb844672020-07-03 11:06:12 +0200494 */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100495static void
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100496lyd_validate_autodel_dup(struct lyd_node **first, struct lyd_node *node, const struct lys_module *mod,
497 struct lyd_node **next_p, struct lyd_node **diff)
Michal Vaskob1b5c262020-03-05 14:29:47 +0100498{
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100499 struct lyd_node *match, *next;
500
501 assert(node->flags & LYD_NEW);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100502
503 if (lyd_val_has_default(node->schema)) {
504 assert(node->schema->nodetype & (LYS_LEAF | LYS_LEAFLIST | LYS_CONTAINER));
Michal Vasko4c583e82020-07-17 12:16:14 +0200505 LYD_LIST_FOR_INST_SAFE(*first, node->schema, next, match) {
Michal Vaskob1b5c262020-03-05 14:29:47 +0100506 if ((match->flags & LYD_DEFAULT) && !(match->flags & LYD_NEW)) {
507 /* default instance found, remove it */
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100508 lyd_validate_autodel_node_del(first, match, mod, next_p, diff);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100509
510 /* remove only a single container/leaf default instance, if there are more, it is an error */
511 if (node->schema->nodetype & (LYS_LEAF | LYS_CONTAINER)) {
512 break;
513 }
514 }
Michal Vaskob1b5c262020-03-05 14:29:47 +0100515 }
516 }
517}
518
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100519/**
520 * @brief Autodelete leftover default nodes of deleted cases (that have no existing explicit data).
521 *
522 * @param[in,out] first First sibling to search in, is updated if needed.
523 * @param[in] node Default data node instance to check.
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100524 * @param[in] mod Module of the siblings, NULL for nested siblings.
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100525 * @param[in,out] next_p Temporary LY_LIST_FOR_SAFE next pointer, is updated if needed.
526 * @param[in,out] diff Validation diff.
527 */
528static void
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100529lyd_validate_autodel_case_dflt(struct lyd_node **first, struct lyd_node *node, const struct lys_module *mod,
530 struct lyd_node **next_p, struct lyd_node **diff)
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100531{
532 struct lysc_node_choice *choic;
533 struct lyd_node *iter = NULL;
534 const struct lysc_node *slast = NULL;
535
536 assert(node->flags & LYD_DEFAULT);
537
538 if (!node->schema->parent || (node->schema->parent->nodetype != LYS_CASE)) {
539 /* the default node is not a descendant of a case */
540 return;
541 }
542
543 choic = (struct lysc_node_choice *)node->schema->parent->parent;
544 assert(choic->nodetype == LYS_CHOICE);
545
546 if (choic->dflt && (choic->dflt == (struct lysc_node_case *)node->schema->parent)) {
547 /* data of a default case, keep them */
548 return;
549 }
550
551 /* try to find an explicit node of the case */
552 while ((iter = lys_getnext_data(iter, *first, &slast, node->schema->parent, NULL))) {
553 if (!(iter->flags & LYD_DEFAULT)) {
554 break;
555 }
556 }
557
558 if (!iter) {
559 /* there are only default nodes of the case meaning it does not exist and neither should any default nodes
560 * of the case, remove this one default node */
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100561 lyd_validate_autodel_node_del(first, node, mod, next_p, diff);
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100562 }
563}
564
Michal Vaskob1b5c262020-03-05 14:29:47 +0100565LY_ERR
Michal Vasko8104fd42020-07-13 11:09:51 +0200566lyd_validate_new(struct lyd_node **first, const struct lysc_node *sparent, const struct lys_module *mod,
Radek Krejci0f969882020-08-21 16:56:47 +0200567 struct lyd_node **diff)
Michal Vaskob1b5c262020-03-05 14:29:47 +0100568{
569 struct lyd_node *next, *node;
570 const struct lysc_node *snode = NULL;
571
572 assert(first && (sparent || mod));
573
574 while (*first && (snode = lys_getnext(snode, sparent, mod ? mod->compiled : NULL, LYS_GETNEXT_WITHCHOICE))) {
575 /* check case duplicites */
576 if (snode->nodetype == LYS_CHOICE) {
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100577 LY_CHECK_RET(lyd_validate_cases(first, mod, (struct lysc_node_choice *)snode, diff));
Michal Vaskob1b5c262020-03-05 14:29:47 +0100578 }
579 }
580
581 LY_LIST_FOR_SAFE(*first, next, node) {
Michal Vaskoc193ce92020-03-06 11:04:48 +0100582 if (mod && (lyd_owner_module(node) != mod)) {
Michal Vaskob1b5c262020-03-05 14:29:47 +0100583 /* all top-level data from this module checked */
584 break;
585 }
586
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100587 if (!(node->flags & (LYD_NEW | LYD_DEFAULT))) {
588 /* check only new and default nodes */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100589 continue;
590 }
591
Radek Krejciddace2c2021-01-08 11:30:56 +0100592 LOG_LOCSET(node->schema, node, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100593
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100594 if (node->flags & LYD_NEW) {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100595 LY_ERR ret;
596
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100597 /* remove old default(s) of the new node if it exists */
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100598 lyd_validate_autodel_dup(first, node, mod, &next, diff);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100599
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100600 /* then check new node instance duplicities */
Radek Krejci2efc45b2020-12-22 16:25:44 +0100601 ret = lyd_validate_duplicates(*first, node);
Radek Krejciddace2c2021-01-08 11:30:56 +0100602 LY_CHECK_ERR_RET(ret, LOG_LOCBACK(node->schema ? 1 : 0, 1, 0, 0), ret);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100603
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100604 /* this node is valid */
605 node->flags &= ~LYD_NEW;
606 }
607
Michal Vasko0e6de512021-01-11 13:39:44 +0100608 LOG_LOCBACK(node->schema ? 1 : 0, 1, 0, 0);
609
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100610 if (node->flags & LYD_DEFAULT) {
611 /* remove leftover default nodes from a no-longer existing case */
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100612 lyd_validate_autodel_case_dflt(first, node, mod, &next, diff);
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100613 }
Michal Vaskob1b5c262020-03-05 14:29:47 +0100614 }
615
616 return LY_SUCCESS;
617}
618
Michal Vaskobb844672020-07-03 11:06:12 +0200619/**
Michal Vaskobd4db892020-11-23 16:58:20 +0100620 * @brief Evaluate any "when" conditions of a non-existent data node with existing parent.
621 *
622 * @param[in] first First data sibling of the non-existing node.
623 * @param[in] parent Data parent of the non-existing node.
624 * @param[in] snode Schema node of the non-existing node.
625 * @param[out] disabled First when that evaluated false, if any.
626 * @return LY_ERR value.
627 */
628static LY_ERR
629lyd_validate_dummy_when(const struct lyd_node *first, const struct lyd_node *parent, const struct lysc_node *snode,
630 const struct lysc_when **disabled)
631{
632 LY_ERR ret = LY_SUCCESS;
633 struct lyd_node *tree, *dummy = NULL;
634
635 /* find root */
636 if (parent) {
637 tree = (struct lyd_node *)parent;
638 while (tree->parent) {
639 tree = lyd_parent(tree);
640 }
641 tree = lyd_first_sibling(tree);
642 } else {
643 assert(!first || !first->prev->next);
644 tree = (struct lyd_node *)first;
645 }
646
647 /* create dummy opaque node */
648 ret = lyd_new_opaq((struct lyd_node *)parent, snode->module->ctx, snode->name, NULL, snode->module->name, &dummy);
649 LY_CHECK_GOTO(ret, cleanup);
650
651 /* connect it if needed */
652 if (!parent) {
653 if (first) {
654 lyd_insert_sibling((struct lyd_node *)first, dummy, &tree);
655 } else {
656 assert(!tree);
657 tree = dummy;
658 }
659 }
660
661 /* evaluate all when */
662 ret = lyd_validate_node_when(tree, dummy, snode, disabled);
663 if (ret == LY_EINCOMPLETE) {
664 /* all other when must be resolved by now */
665 LOGINT(snode->module->ctx);
666 ret = LY_EINT;
667 goto cleanup;
668 } else if (ret) {
669 /* error */
670 goto cleanup;
671 }
672
673cleanup:
674 lyd_free_tree(dummy);
675 return ret;
676}
677
678/**
Michal Vaskobb844672020-07-03 11:06:12 +0200679 * @brief Validate mandatory node existence.
680 *
681 * @param[in] first First sibling to search in.
Michal Vaskobd4db892020-11-23 16:58:20 +0100682 * @param[in] parent Data parent.
Michal Vaskobb844672020-07-03 11:06:12 +0200683 * @param[in] snode Schema node to validate.
684 * @return LY_ERR value.
685 */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100686static LY_ERR
Michal Vaskobd4db892020-11-23 16:58:20 +0100687lyd_validate_mandatory(const struct lyd_node *first, const struct lyd_node *parent, const struct lysc_node *snode)
Michal Vaskoa3881362020-01-21 15:57:35 +0100688{
Michal Vaskobd4db892020-11-23 16:58:20 +0100689 const struct lysc_when *disabled;
690
Michal Vaskoa3881362020-01-21 15:57:35 +0100691 if (snode->nodetype == LYS_CHOICE) {
Michal Vasko9b368d32020-02-14 13:53:31 +0100692 /* some data of a choice case exist */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100693 if (lys_getnext_data(NULL, first, NULL, snode, NULL)) {
Michal Vasko9b368d32020-02-14 13:53:31 +0100694 return LY_SUCCESS;
695 }
696 } else {
697 assert(snode->nodetype & (LYS_LEAF | LYS_CONTAINER | LYD_NODE_ANY));
Michal Vaskoa3881362020-01-21 15:57:35 +0100698
Michal Vaskob1b5c262020-03-05 14:29:47 +0100699 if (!lyd_find_sibling_val(first, snode, NULL, 0, NULL)) {
Michal Vasko9b368d32020-02-14 13:53:31 +0100700 /* data instance found */
701 return LY_SUCCESS;
Michal Vaskoa3881362020-01-21 15:57:35 +0100702 }
703 }
704
Michal Vaskobd4db892020-11-23 16:58:20 +0100705 disabled = NULL;
706 if (lysc_has_when(snode)) {
707 /* if there are any when conditions, they must be true for a validation error */
708 LY_CHECK_RET(lyd_validate_dummy_when(first, parent, snode, &disabled));
709 }
710
711 if (!disabled) {
712 /* node instance not found */
Radek Krejci2efc45b2020-12-22 16:25:44 +0100713 LOGVAL(snode->module->ctx, LY_VCODE_NOMAND, snode->name);
Michal Vaskobd4db892020-11-23 16:58:20 +0100714 return LY_EVALID;
715 }
716
717 return LY_SUCCESS;
Michal Vaskoa3881362020-01-21 15:57:35 +0100718}
719
Michal Vaskobb844672020-07-03 11:06:12 +0200720/**
721 * @brief Validate min/max-elements constraints, if any.
722 *
723 * @param[in] first First sibling to search in.
Michal Vaskobd4db892020-11-23 16:58:20 +0100724 * @param[in] parent Data parent.
Michal Vaskobb844672020-07-03 11:06:12 +0200725 * @param[in] snode Schema node to validate.
726 * @param[in] min Minimum number of elements, 0 for no restriction.
727 * @param[in] max Max number of elements, 0 for no restriction.
728 * @return LY_ERR value.
729 */
Michal Vaskoa3881362020-01-21 15:57:35 +0100730static LY_ERR
Michal Vaskobd4db892020-11-23 16:58:20 +0100731lyd_validate_minmax(const struct lyd_node *first, const struct lyd_node *parent, const struct lysc_node *snode,
732 uint32_t min, uint32_t max)
Michal Vaskoa3881362020-01-21 15:57:35 +0100733{
Michal Vaskoacd83e72020-02-04 14:12:01 +0100734 uint32_t count = 0;
Michal Vasko4c583e82020-07-17 12:16:14 +0200735 struct lyd_node *iter;
Michal Vaskobd4db892020-11-23 16:58:20 +0100736 const struct lysc_when *disabled;
Radek Krejci2efc45b2020-12-22 16:25:44 +0100737 ly_bool invalid_instance = 0;
Michal Vaskoacd83e72020-02-04 14:12:01 +0100738
Michal Vasko9b368d32020-02-14 13:53:31 +0100739 assert(min || max);
740
Michal Vasko4c583e82020-07-17 12:16:14 +0200741 LYD_LIST_FOR_INST(first, snode, iter) {
742 ++count;
Michal Vasko9b368d32020-02-14 13:53:31 +0100743
Michal Vasko4c583e82020-07-17 12:16:14 +0200744 if (min && (count == min)) {
745 /* satisfied */
746 min = 0;
747 if (!max) {
748 /* nothing more to check */
Michal Vasko9b368d32020-02-14 13:53:31 +0100749 break;
750 }
Michal Vaskoacd83e72020-02-04 14:12:01 +0100751 }
Michal Vasko4c583e82020-07-17 12:16:14 +0200752 if (max && (count > max)) {
753 /* not satisifed */
Radek Krejciddace2c2021-01-08 11:30:56 +0100754 LOG_LOCSET(NULL, iter, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100755 invalid_instance = 1;
Michal Vasko4c583e82020-07-17 12:16:14 +0200756 break;
757 }
Michal Vaskoacd83e72020-02-04 14:12:01 +0100758 }
759
Michal Vasko9b368d32020-02-14 13:53:31 +0100760 if (min) {
761 assert(count < min);
Michal Vaskobd4db892020-11-23 16:58:20 +0100762
763 disabled = NULL;
764 if (lysc_has_when(snode)) {
765 /* if there are any when conditions, they must be true for a validation error */
766 LY_CHECK_RET(lyd_validate_dummy_when(first, parent, snode, &disabled));
767 }
768
769 if (!disabled) {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100770 LOGVAL(snode->module->ctx, LY_VCODE_NOMIN, snode->name);
771 goto failure;
Michal Vaskobd4db892020-11-23 16:58:20 +0100772 }
Michal Vaskoacd83e72020-02-04 14:12:01 +0100773 } else if (max && (count > max)) {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100774 LOGVAL(snode->module->ctx, LY_VCODE_NOMAX, snode->name);
775 goto failure;
Michal Vaskoacd83e72020-02-04 14:12:01 +0100776 }
777
Michal Vaskoa3881362020-01-21 15:57:35 +0100778 return LY_SUCCESS;
Radek Krejci2efc45b2020-12-22 16:25:44 +0100779
780failure:
Radek Krejciddace2c2021-01-08 11:30:56 +0100781 LOG_LOCBACK(0, invalid_instance, 0, 0);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100782 return LY_EVALID;
Michal Vaskoa3881362020-01-21 15:57:35 +0100783}
784
Michal Vaskobb844672020-07-03 11:06:12 +0200785/**
786 * @brief Find node referenced by a list unique statement.
787 *
788 * @param[in] uniq_leaf Unique leaf to find.
789 * @param[in] list List instance to use for the search.
790 * @return Found leaf,
791 * @return NULL if no leaf found.
792 */
Michal Vasko14654712020-02-06 08:35:21 +0100793static struct lyd_node *
Michal Vaskobb844672020-07-03 11:06:12 +0200794lyd_val_uniq_find_leaf(const struct lysc_node_leaf *uniq_leaf, const struct lyd_node *list)
Michal Vasko14654712020-02-06 08:35:21 +0100795{
Michal Vasko9b368d32020-02-14 13:53:31 +0100796 struct lyd_node *node;
797 const struct lysc_node *iter;
798 size_t depth = 0, i;
Michal Vasko14654712020-02-06 08:35:21 +0100799
Michal Vasko9b368d32020-02-14 13:53:31 +0100800 /* get leaf depth */
Michal Vasko62ed12d2020-05-21 10:08:25 +0200801 for (iter = (struct lysc_node *)uniq_leaf; iter && (iter != list->schema); iter = lysc_data_parent(iter)) {
802 ++depth;
Michal Vasko14654712020-02-06 08:35:21 +0100803 }
Michal Vasko9b368d32020-02-14 13:53:31 +0100804
Michal Vaskobb844672020-07-03 11:06:12 +0200805 node = (struct lyd_node *)list;
Michal Vasko9b368d32020-02-14 13:53:31 +0100806 while (node && depth) {
807 /* find schema node with this depth */
Michal Vasko62ed12d2020-05-21 10:08:25 +0200808 for (i = depth - 1, iter = (struct lysc_node *)uniq_leaf; i; iter = lysc_data_parent(iter)) {
809 --i;
Michal Vasko9b368d32020-02-14 13:53:31 +0100810 }
811
812 /* find iter instance in children */
813 assert(iter->nodetype & (LYS_CONTAINER | LYS_LEAF));
Radek Krejcia1c1e542020-09-29 16:06:52 +0200814 lyd_find_sibling_val(lyd_child(node), iter, NULL, 0, &node);
Michal Vasko9b368d32020-02-14 13:53:31 +0100815 --depth;
816 }
817
Michal Vasko14654712020-02-06 08:35:21 +0100818 return node;
819}
820
Michal Vaskobb844672020-07-03 11:06:12 +0200821/**
822 * @brief Callback for comparing 2 list unique leaf values.
823 *
Radek Krejci857189e2020-09-01 13:26:36 +0200824 * Implementation of ::values_equal_cb.
825 *
Michal Vaskobb844672020-07-03 11:06:12 +0200826 * @param[in] cb_data 0 to compare all uniques, n to compare only n-th unique.
Michal Vasko14654712020-02-06 08:35:21 +0100827 */
Radek Krejci857189e2020-09-01 13:26:36 +0200828static ly_bool
829lyd_val_uniq_list_equal(void *val1_p, void *val2_p, ly_bool UNUSED(mod), void *cb_data)
Michal Vasko14654712020-02-06 08:35:21 +0100830{
831 struct ly_ctx *ctx;
832 struct lysc_node_list *slist;
833 struct lyd_node *diter, *first, *second;
834 struct lyd_value *val1, *val2;
835 char *path1, *path2, *uniq_str, *ptr;
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200836 LY_ARRAY_COUNT_TYPE u, v, action;
Michal Vasko14654712020-02-06 08:35:21 +0100837
838 assert(val1_p && val2_p);
839
840 first = *((struct lyd_node **)val1_p);
841 second = *((struct lyd_node **)val2_p);
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200842 action = (LY_ARRAY_COUNT_TYPE)cb_data;
Michal Vasko14654712020-02-06 08:35:21 +0100843
844 assert(first && (first->schema->nodetype == LYS_LIST));
845 assert(second && (second->schema == first->schema));
846
847 ctx = first->schema->module->ctx;
848
849 slist = (struct lysc_node_list *)first->schema;
850
851 /* compare unique leaves */
852 if (action > 0) {
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200853 u = action - 1;
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200854 if (u < LY_ARRAY_COUNT(slist->uniques)) {
Michal Vasko14654712020-02-06 08:35:21 +0100855 goto uniquecheck;
856 }
857 }
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200858 LY_ARRAY_FOR(slist->uniques, u) {
Michal Vasko14654712020-02-06 08:35:21 +0100859uniquecheck:
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200860 LY_ARRAY_FOR(slist->uniques[u], v) {
Michal Vasko14654712020-02-06 08:35:21 +0100861 /* first */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200862 diter = lyd_val_uniq_find_leaf(slist->uniques[u][v], first);
Michal Vasko14654712020-02-06 08:35:21 +0100863 if (diter) {
864 val1 = &((struct lyd_node_term *)diter)->value;
865 } else {
866 /* use default value */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200867 val1 = slist->uniques[u][v]->dflt;
Michal Vasko14654712020-02-06 08:35:21 +0100868 }
869
870 /* second */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200871 diter = lyd_val_uniq_find_leaf(slist->uniques[u][v], second);
Michal Vasko14654712020-02-06 08:35:21 +0100872 if (diter) {
873 val2 = &((struct lyd_node_term *)diter)->value;
874 } else {
875 /* use default value */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200876 val2 = slist->uniques[u][v]->dflt;
Michal Vasko14654712020-02-06 08:35:21 +0100877 }
878
879 if (!val1 || !val2 || val1->realtype->plugin->compare(val1, val2)) {
880 /* values differ or either one is not set */
881 break;
882 }
883 }
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200884 if (v && (v == LY_ARRAY_COUNT(slist->uniques[u]))) {
Michal Vasko14654712020-02-06 08:35:21 +0100885 /* all unique leafs are the same in this set, create this nice error */
Radek Krejci635d2b82021-01-04 11:26:51 +0100886 path1 = lyd_path(first, LYD_PATH_STD, NULL, 0);
887 path2 = lyd_path(second, LYD_PATH_STD, NULL, 0);
Michal Vasko14654712020-02-06 08:35:21 +0100888
889 /* use buffer to rebuild the unique string */
Radek Krejcif13b87b2020-12-01 22:02:17 +0100890#define UNIQ_BUF_SIZE 1024
891 uniq_str = malloc(UNIQ_BUF_SIZE);
Michal Vasko14654712020-02-06 08:35:21 +0100892 uniq_str[0] = '\0';
893 ptr = uniq_str;
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200894 LY_ARRAY_FOR(slist->uniques[u], v) {
895 if (v) {
Michal Vasko14654712020-02-06 08:35:21 +0100896 strcpy(ptr, " ");
897 ++ptr;
898 }
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200899 ptr = lysc_path_until((struct lysc_node *)slist->uniques[u][v], (struct lysc_node *)slist, LYSC_PATH_LOG,
Radek Krejcif13b87b2020-12-01 22:02:17 +0100900 ptr, UNIQ_BUF_SIZE - (ptr - uniq_str));
Michal Vasko14654712020-02-06 08:35:21 +0100901 if (!ptr) {
902 /* path will be incomplete, whatever */
903 break;
904 }
905
906 ptr += strlen(ptr);
907 }
Radek Krejciddace2c2021-01-08 11:30:56 +0100908 LOG_LOCSET(NULL, second, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100909 LOGVAL(ctx, LY_VCODE_NOUNIQ, uniq_str, path1, path2);
Radek Krejciddace2c2021-01-08 11:30:56 +0100910 LOG_LOCBACK(0, 1, 0, 0);
Michal Vasko14654712020-02-06 08:35:21 +0100911
912 free(path1);
913 free(path2);
914 free(uniq_str);
Radek Krejcif13b87b2020-12-01 22:02:17 +0100915#undef UNIQ_BUF_SIZE
916
Michal Vasko14654712020-02-06 08:35:21 +0100917 return 1;
918 }
919
920 if (action > 0) {
921 /* done */
922 return 0;
923 }
924 }
925
926 return 0;
927}
928
Michal Vaskobb844672020-07-03 11:06:12 +0200929/**
930 * @brief Validate list unique leaves.
931 *
932 * @param[in] first First sibling to search in.
933 * @param[in] snode Schema node to validate.
934 * @param[in] uniques List unique arrays to validate.
935 * @return LY_ERR value.
936 */
Michal Vaskoa3881362020-01-21 15:57:35 +0100937static LY_ERR
Michal Vaskobb844672020-07-03 11:06:12 +0200938lyd_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 +0100939{
Michal Vaskob1b5c262020-03-05 14:29:47 +0100940 const struct lyd_node *diter;
Michal Vasko14654712020-02-06 08:35:21 +0100941 struct ly_set *set;
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200942 LY_ARRAY_COUNT_TYPE u, v, x = 0;
Michal Vasko14654712020-02-06 08:35:21 +0100943 LY_ERR ret = LY_SUCCESS;
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200944 uint32_t hash, i, size = 0;
Radek Krejci857189e2020-09-01 13:26:36 +0200945 ly_bool dynamic;
Michal Vasko14654712020-02-06 08:35:21 +0100946 const char *str;
947 struct hash_table **uniqtables = NULL;
948 struct lyd_value *val;
949 struct ly_ctx *ctx = snode->module->ctx;
950
951 assert(uniques);
952
953 /* get all list instances */
Radek Krejciba03a5a2020-08-27 14:40:41 +0200954 LY_CHECK_RET(ly_set_new(&set));
Michal Vaskob1b5c262020-03-05 14:29:47 +0100955 LY_LIST_FOR(first, diter) {
Michal Vasko9b368d32020-02-14 13:53:31 +0100956 if (diter->schema == snode) {
Radek Krejci3d92e442020-10-12 12:48:13 +0200957 ret = ly_set_add(set, (void *)diter, 1, NULL);
Michal Vaskob0099a92020-08-31 14:55:23 +0200958 LY_CHECK_GOTO(ret, cleanup);
Michal Vasko9b368d32020-02-14 13:53:31 +0100959 }
960 }
Michal Vasko14654712020-02-06 08:35:21 +0100961
962 if (set->count == 2) {
963 /* simple comparison */
964 if (lyd_val_uniq_list_equal(&set->objs[0], &set->objs[1], 0, (void *)0)) {
965 /* instance duplication */
966 ret = LY_EVALID;
967 goto cleanup;
968 }
969 } else if (set->count > 2) {
970 /* use hashes for comparison */
Radek Krejcif13b87b2020-12-01 22:02:17 +0100971 /* first, allocate the table, the size depends on number of items in the set,
972 * the following code detects number of upper zero bits in the items' counter value ... */
973 for (i = (sizeof set->count * CHAR_BIT) - 1; i > 0; i--) {
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200974 size = set->count << i;
975 size = size >> i;
976 if (size == set->count) {
Michal Vasko14654712020-02-06 08:35:21 +0100977 break;
978 }
979 }
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200980 LY_CHECK_ERR_GOTO(!i, LOGINT(ctx); ret = LY_EINT, cleanup);
Radek Krejcif13b87b2020-12-01 22:02:17 +0100981 /* ... and then we convert it to the position of the highest non-zero bit ... */
982 i = (sizeof set->count * CHAR_BIT) - i;
983 /* ... 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 +0200984 size = 1 << i;
Michal Vasko14654712020-02-06 08:35:21 +0100985
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200986 uniqtables = malloc(LY_ARRAY_COUNT(uniques) * sizeof *uniqtables);
Michal Vasko14654712020-02-06 08:35:21 +0100987 LY_CHECK_ERR_GOTO(!uniqtables, LOGMEM(ctx); ret = LY_EMEM, cleanup);
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200988 x = LY_ARRAY_COUNT(uniques);
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200989 for (v = 0; v < x; v++) {
990 uniqtables[v] = lyht_new(size, sizeof(struct lyd_node *), lyd_val_uniq_list_equal, (void *)(v + 1L), 0);
991 LY_CHECK_ERR_GOTO(!uniqtables[v], LOGMEM(ctx); ret = LY_EMEM, cleanup);
Michal Vasko14654712020-02-06 08:35:21 +0100992 }
993
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200994 for (i = 0; i < set->count; i++) {
Michal Vasko14654712020-02-06 08:35:21 +0100995 /* loop for unique - get the hash for the instances */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200996 for (u = 0; u < x; u++) {
Michal Vasko14654712020-02-06 08:35:21 +0100997 val = NULL;
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200998 for (v = hash = 0; v < LY_ARRAY_COUNT(uniques[u]); v++) {
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200999 diter = lyd_val_uniq_find_leaf(uniques[u][v], set->objs[i]);
Michal Vasko14654712020-02-06 08:35:21 +01001000 if (diter) {
1001 val = &((struct lyd_node_term *)diter)->value;
1002 } else {
1003 /* use default value */
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001004 val = uniques[u][v]->dflt;
Michal Vasko14654712020-02-06 08:35:21 +01001005 }
1006 if (!val) {
1007 /* unique item not present nor has default value */
1008 break;
1009 }
1010
1011 /* get canonical string value */
Michal Vaskoc8a230d2020-08-14 12:17:10 +02001012 str = val->realtype->plugin->print(val, LY_PREF_JSON, NULL, &dynamic);
Michal Vasko14654712020-02-06 08:35:21 +01001013 hash = dict_hash_multi(hash, str, strlen(str));
1014 if (dynamic) {
1015 free((char *)str);
1016 }
1017 }
1018 if (!val) {
1019 /* skip this list instance since its unique set is incomplete */
1020 continue;
1021 }
1022
1023 /* finish the hash value */
1024 hash = dict_hash_multi(hash, NULL, 0);
1025
1026 /* insert into the hashtable */
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001027 ret = lyht_insert(uniqtables[u], &set->objs[i], hash, NULL);
Michal Vasko14654712020-02-06 08:35:21 +01001028 if (ret == LY_EEXIST) {
1029 /* instance duplication */
1030 ret = LY_EVALID;
1031 }
1032 LY_CHECK_GOTO(ret != LY_SUCCESS, cleanup);
1033 }
1034 }
1035 }
1036
1037cleanup:
1038 ly_set_free(set, NULL);
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001039 for (v = 0; v < x; v++) {
1040 if (!uniqtables[v]) {
Michal Vasko14654712020-02-06 08:35:21 +01001041 /* failed when allocating uniquetables[j], following j are not allocated */
1042 break;
1043 }
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001044 lyht_free(uniqtables[v]);
Michal Vasko14654712020-02-06 08:35:21 +01001045 }
1046 free(uniqtables);
1047
1048 return ret;
Michal Vaskoa3881362020-01-21 15:57:35 +01001049}
1050
Michal Vaskobb844672020-07-03 11:06:12 +02001051/**
1052 * @brief Validate data siblings based on generic schema node restrictions, recursively for schema-only nodes.
1053 *
1054 * @param[in] first First sibling to search in.
Michal Vaskobd4db892020-11-23 16:58:20 +01001055 * @param[in] parent Data parent.
Michal Vaskobb844672020-07-03 11:06:12 +02001056 * @param[in] sparent Schema parent of the nodes to check.
1057 * @param[in] mod Module of the nodes to check.
1058 * @param[in] val_opts Validation options, see @ref datavalidationoptions.
1059 * @param[in] op Operation being validated, if any.
1060 * @return LY_ERR value.
1061 */
Michal Vaskoa3881362020-01-21 15:57:35 +01001062static LY_ERR
Michal Vaskobd4db892020-11-23 16:58:20 +01001063lyd_validate_siblings_schema_r(const struct lyd_node *first, const struct lyd_node *parent,
1064 const struct lysc_node *sparent, const struct lysc_module *mod, uint32_t val_opts, LYD_VALIDATE_OP op)
Michal Vaskocde73ac2019-11-14 16:10:27 +01001065{
Radek Krejci2efc45b2020-12-22 16:25:44 +01001066 LY_ERR ret = LY_SUCCESS;
Michal Vaskocde73ac2019-11-14 16:10:27 +01001067 const struct lysc_node *snode = NULL;
Michal Vaskoa3881362020-01-21 15:57:35 +01001068 struct lysc_node_list *slist;
Michal Vaskod8958df2020-08-05 13:27:36 +02001069 struct lysc_node_leaflist *sllist;
Radek Krejci1deb5be2020-08-26 16:43:36 +02001070 uint32_t getnext_opts;
Michal Vaskocb7526d2020-03-30 15:08:26 +02001071
Radek Krejci7931b192020-06-25 17:05:03 +02001072 getnext_opts = LYS_GETNEXT_WITHCHOICE | LYS_GETNEXT_WITHCASE | (op == LYD_VALIDATE_OP_REPLY ? LYS_GETNEXT_OUTPUT : 0);
Michal Vaskocde73ac2019-11-14 16:10:27 +01001073
Michal Vaskoa3881362020-01-21 15:57:35 +01001074 /* disabled nodes are skipped by lys_getnext */
Michal Vaskocb7526d2020-03-30 15:08:26 +02001075 while ((snode = lys_getnext(snode, sparent, mod, getnext_opts))) {
Radek Krejci7931b192020-06-25 17:05:03 +02001076 if ((val_opts & LYD_VALIDATE_NO_STATE) && (snode->flags & LYS_CONFIG_R)) {
Michal Vaskoe75ecfd2020-03-06 14:12:28 +01001077 continue;
1078 }
1079
Radek Krejciddace2c2021-01-08 11:30:56 +01001080 LOG_LOCSET(snode, NULL, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +01001081
Michal Vaskoa3881362020-01-21 15:57:35 +01001082 /* check min-elements and max-elements */
Michal Vaskod8958df2020-08-05 13:27:36 +02001083 if (snode->nodetype == LYS_LIST) {
Michal Vaskoa3881362020-01-21 15:57:35 +01001084 slist = (struct lysc_node_list *)snode;
1085 if (slist->min || slist->max) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001086 ret = lyd_validate_minmax(first, parent, snode, slist->min, slist->max);
1087 LY_CHECK_GOTO(ret, error);
Michal Vaskoa3881362020-01-21 15:57:35 +01001088 }
Michal Vaskod8958df2020-08-05 13:27:36 +02001089 } else if (snode->nodetype == LYS_LEAFLIST) {
1090 sllist = (struct lysc_node_leaflist *)snode;
1091 if (sllist->min || sllist->max) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001092 ret = lyd_validate_minmax(first, parent, snode, sllist->min, sllist->max);
1093 LY_CHECK_GOTO(ret, error);
Michal Vaskod8958df2020-08-05 13:27:36 +02001094 }
Michal Vaskoacd83e72020-02-04 14:12:01 +01001095
Michal Vaskoacd83e72020-02-04 14:12:01 +01001096 } else if (snode->flags & LYS_MAND_TRUE) {
Radek Krejcif6a11002020-08-21 13:29:07 +02001097 /* check generic mandatory existence */
Radek Krejci2efc45b2020-12-22 16:25:44 +01001098 ret = lyd_validate_mandatory(first, parent, snode);
1099 LY_CHECK_GOTO(ret, error);
Michal Vaskoa3881362020-01-21 15:57:35 +01001100 }
1101
1102 /* check unique */
1103 if (snode->nodetype == LYS_LIST) {
1104 slist = (struct lysc_node_list *)snode;
1105 if (slist->uniques) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001106 ret = lyd_validate_unique(first, snode, (const struct lysc_node_leaf ***)slist->uniques);
1107 LY_CHECK_GOTO(ret, error);
Michal Vaskoa3881362020-01-21 15:57:35 +01001108 }
1109 }
1110
Michal Vaskoacd83e72020-02-04 14:12:01 +01001111 if (snode->nodetype & (LYS_CHOICE | LYS_CASE)) {
1112 /* go recursively for schema-only nodes */
Radek Krejci2efc45b2020-12-22 16:25:44 +01001113 ret = lyd_validate_siblings_schema_r(first, parent, snode, mod, val_opts, op);
1114 LY_CHECK_GOTO(ret, error);
Michal Vaskoacd83e72020-02-04 14:12:01 +01001115 }
Radek Krejci2efc45b2020-12-22 16:25:44 +01001116
Radek Krejciddace2c2021-01-08 11:30:56 +01001117 LOG_LOCBACK(1, 0, 0, 0);
Michal Vaskocde73ac2019-11-14 16:10:27 +01001118 }
1119
Michal Vaskoacd83e72020-02-04 14:12:01 +01001120 return LY_SUCCESS;
Radek Krejci2efc45b2020-12-22 16:25:44 +01001121
1122error:
Radek Krejciddace2c2021-01-08 11:30:56 +01001123 LOG_LOCBACK(1, 0, 0, 0);
Radek Krejci2efc45b2020-12-22 16:25:44 +01001124 return ret;
Michal Vaskoacd83e72020-02-04 14:12:01 +01001125}
1126
Michal Vaskobb844672020-07-03 11:06:12 +02001127/**
1128 * @brief Validate obsolete nodes, only warnings are printed.
1129 *
1130 * @param[in] node Node to check.
1131 */
Michal Vaskoe75ecfd2020-03-06 14:12:28 +01001132static void
1133lyd_validate_obsolete(const struct lyd_node *node)
1134{
1135 const struct lysc_node *snode;
1136
1137 snode = node->schema;
1138 do {
1139 if (snode->flags & LYS_STATUS_OBSLT) {
1140 LOGWRN(snode->module->ctx, "Obsolete schema node \"%s\" instantiated in data.", snode->name);
1141 break;
1142 }
1143
1144 snode = snode->parent;
1145 } while (snode && (snode->nodetype & (LYS_CHOICE | LYS_CASE)));
1146}
1147
Michal Vaskobb844672020-07-03 11:06:12 +02001148/**
1149 * @brief Validate must conditions of a data node.
1150 *
1151 * @param[in] node Node to validate.
1152 * @param[in] op Operation being validated, if any.
1153 * @return LY_ERR value.
1154 */
Michal Vaskocc048b22020-03-27 15:52:38 +01001155static LY_ERR
Radek Krejci7931b192020-06-25 17:05:03 +02001156lyd_validate_must(const struct lyd_node *node, LYD_VALIDATE_OP op)
Michal Vaskocc048b22020-03-27 15:52:38 +01001157{
1158 struct lyxp_set xp_set;
1159 struct lysc_must *musts;
1160 const struct lyd_node *tree;
Michal Vaskofd69e1d2020-07-03 11:57:17 +02001161 LY_ARRAY_COUNT_TYPE u;
Michal Vaskocc048b22020-03-27 15:52:38 +01001162
1163 switch (node->schema->nodetype) {
1164 case LYS_CONTAINER:
1165 musts = ((struct lysc_node_container *)node->schema)->musts;
1166 break;
1167 case LYS_LEAF:
1168 musts = ((struct lysc_node_leaf *)node->schema)->musts;
1169 break;
1170 case LYS_LEAFLIST:
1171 musts = ((struct lysc_node_leaflist *)node->schema)->musts;
1172 break;
1173 case LYS_LIST:
1174 musts = ((struct lysc_node_list *)node->schema)->musts;
1175 break;
1176 case LYS_ANYXML:
1177 case LYS_ANYDATA:
1178 musts = ((struct lysc_node_anydata *)node->schema)->musts;
1179 break;
1180 case LYS_NOTIF:
1181 musts = ((struct lysc_notif *)node->schema)->musts;
1182 break;
1183 case LYS_RPC:
1184 case LYS_ACTION:
Radek Krejci7931b192020-06-25 17:05:03 +02001185 if (op == LYD_VALIDATE_OP_RPC) {
Michal Vaskocb7526d2020-03-30 15:08:26 +02001186 musts = ((struct lysc_action *)node->schema)->input.musts;
Radek Krejci7931b192020-06-25 17:05:03 +02001187 } else if (op == LYD_VALIDATE_OP_REPLY) {
Michal Vaskocb7526d2020-03-30 15:08:26 +02001188 musts = ((struct lysc_action *)node->schema)->output.musts;
1189 } else {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001190 LOGINT(LYD_CTX(node));
Michal Vaskocb7526d2020-03-30 15:08:26 +02001191 return LY_EINT;
1192 }
Michal Vaskocc048b22020-03-27 15:52:38 +01001193 break;
1194 default:
Michal Vaskob7be7a82020-08-20 09:09:04 +02001195 LOGINT(LYD_CTX(node));
Michal Vaskocc048b22020-03-27 15:52:38 +01001196 return LY_EINT;
1197 }
1198
1199 if (!musts) {
1200 /* no must to evaluate */
1201 return LY_SUCCESS;
1202 }
1203
1204 /* find first top-level node */
Radek Krejci1e008d22020-08-17 11:37:37 +02001205 for (tree = node; tree->parent; tree = (struct lyd_node *)tree->parent) {}
Michal Vaskocc048b22020-03-27 15:52:38 +01001206 while (tree->prev->next) {
1207 tree = tree->prev;
1208 }
1209
1210 LY_ARRAY_FOR(musts, u) {
1211 memset(&xp_set, 0, sizeof xp_set);
1212
1213 /* evaluate must */
Michal Vasko400e9672021-01-11 13:39:17 +01001214 LY_CHECK_RET(lyxp_eval(LYD_CTX(node), musts[u].cond, node->schema->module, LY_PREF_SCHEMA_RESOLVED,
1215 musts[u].prefixes, node, tree, &xp_set, LYXP_SCHEMA));
Michal Vaskocc048b22020-03-27 15:52:38 +01001216
1217 /* check the result */
1218 lyxp_set_cast(&xp_set, LYXP_SET_BOOLEAN);
Michal Vasko004d3152020-06-11 19:59:22 +02001219 if (!xp_set.val.bln) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001220 LOGVAL(LYD_CTX(node), LY_VCODE_NOMUST, musts[u].cond->expr);
Michal Vaskocc048b22020-03-27 15:52:38 +01001221 return LY_EVALID;
1222 }
1223 }
1224
1225 return LY_SUCCESS;
1226}
1227
Michal Vaskob1b5c262020-03-05 14:29:47 +01001228LY_ERR
Michal Vaskobd4db892020-11-23 16:58:20 +01001229lyd_validate_final_r(struct lyd_node *first, const struct lyd_node *parent, const struct lysc_node *sparent,
1230 const struct lys_module *mod, uint32_t val_opts, LYD_VALIDATE_OP op)
Michal Vaskoacd83e72020-02-04 14:12:01 +01001231{
Radek Krejci2efc45b2020-12-22 16:25:44 +01001232 const char *innode = NULL;
Radek Krejci7f769d72020-07-11 23:13:56 +02001233 struct lyd_node *next = NULL, *node;
Michal Vaskoacd83e72020-02-04 14:12:01 +01001234
Michal Vasko14654712020-02-06 08:35:21 +01001235 /* validate all restrictions of nodes themselves */
Michal Vaskob1b5c262020-03-05 14:29:47 +01001236 LY_LIST_FOR_SAFE(first, next, node) {
Michal Vaskoc193ce92020-03-06 11:04:48 +01001237 if (mod && (lyd_owner_module(node) != mod)) {
Michal Vaskob1b5c262020-03-05 14:29:47 +01001238 /* all top-level data from this module checked */
1239 break;
Michal Vaskof03ed032020-03-04 13:31:44 +01001240 }
1241
Radek Krejciddace2c2021-01-08 11:30:56 +01001242 LOG_LOCSET(node->schema, node, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +01001243
Michal Vaskoa8c61722020-03-27 16:59:32 +01001244 /* opaque data */
1245 if (!node->schema) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001246 LOGVAL(LYD_CTX(node), LYVE_DATA, "Opaque node \"%s\" found.", ((struct lyd_node_opaq *)node)->name.name);
Radek Krejciddace2c2021-01-08 11:30:56 +01001247 LOG_LOCBACK(0, 1, 0, 0);
Michal Vaskoa8c61722020-03-27 16:59:32 +01001248 return LY_EVALID;
1249 }
1250
Michal Vaskocb7526d2020-03-30 15:08:26 +02001251 /* no state/input/output data */
Radek Krejci7931b192020-06-25 17:05:03 +02001252 if ((val_opts & LYD_VALIDATE_NO_STATE) && (node->schema->flags & LYS_CONFIG_R)) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001253 innode = "state";
1254 goto invalid_node;
Radek Krejci7931b192020-06-25 17:05:03 +02001255 } else if ((op == LYD_VALIDATE_OP_RPC) && (node->schema->flags & LYS_CONFIG_R)) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001256 innode = "output";
1257 goto invalid_node;
Radek Krejci7931b192020-06-25 17:05:03 +02001258 } else if ((op == LYD_VALIDATE_OP_REPLY) && (node->schema->flags & LYS_CONFIG_W)) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001259 innode = "input";
1260 goto invalid_node;
Michal Vasko5b37a352020-03-06 13:38:33 +01001261 }
1262
Michal Vaskoe75ecfd2020-03-06 14:12:28 +01001263 /* obsolete data */
1264 lyd_validate_obsolete(node);
1265
Michal Vaskocc048b22020-03-27 15:52:38 +01001266 /* node's musts */
Radek Krejci7931b192020-06-25 17:05:03 +02001267 LY_CHECK_RET(lyd_validate_must(node, op));
Michal Vaskocc048b22020-03-27 15:52:38 +01001268
Michal Vasko53d97a12020-11-05 17:39:10 +01001269 /* node value was checked by plugins */
Radek Krejci2efc45b2020-12-22 16:25:44 +01001270
Radek Krejciddace2c2021-01-08 11:30:56 +01001271 LOG_LOCBACK(1, 1, 0, 0);
Michal Vasko14654712020-02-06 08:35:21 +01001272 }
Michal Vaskocde73ac2019-11-14 16:10:27 +01001273
Michal Vasko14654712020-02-06 08:35:21 +01001274 /* validate schema-based restrictions */
Michal Vaskobd4db892020-11-23 16:58:20 +01001275 LY_CHECK_RET(lyd_validate_siblings_schema_r(first, parent, sparent, mod ? mod->compiled : NULL, val_opts, op));
Michal Vasko14654712020-02-06 08:35:21 +01001276
Michal Vaskob1b5c262020-03-05 14:29:47 +01001277 LY_LIST_FOR(first, node) {
Michal Vasko14654712020-02-06 08:35:21 +01001278 /* validate all children recursively */
Michal Vaskobd4db892020-11-23 16:58:20 +01001279 LY_CHECK_RET(lyd_validate_final_r(lyd_child(node), node, node->schema, NULL, val_opts, op));
Michal Vaskocde73ac2019-11-14 16:10:27 +01001280
Michal Vaskob1b5c262020-03-05 14:29:47 +01001281 /* set default for containers */
1282 if ((node->schema->nodetype == LYS_CONTAINER) && !(node->schema->flags & LYS_PRESENCE)) {
Radek Krejcia1c1e542020-09-29 16:06:52 +02001283 LY_LIST_FOR(lyd_child(node), next) {
Michal Vaskob1b5c262020-03-05 14:29:47 +01001284 if (!(next->flags & LYD_DEFAULT)) {
1285 break;
1286 }
Michal Vaskoa3881362020-01-21 15:57:35 +01001287 }
Michal Vaskob1b5c262020-03-05 14:29:47 +01001288 if (!next) {
1289 node->flags |= LYD_DEFAULT;
1290 }
Michal Vasko9b368d32020-02-14 13:53:31 +01001291 }
1292 }
1293
1294 return LY_SUCCESS;
Radek Krejci2efc45b2020-12-22 16:25:44 +01001295
1296invalid_node:
1297 LOGVAL(LYD_CTX(node), LY_VCODE_INNODE, innode, node->schema->name);
Radek Krejciddace2c2021-01-08 11:30:56 +01001298 LOG_LOCBACK(1, 1, 0, 0);
Radek Krejci2efc45b2020-12-22 16:25:44 +01001299 return LY_EVALID;
Michal Vasko9b368d32020-02-14 13:53:31 +01001300}
1301
Radek Krejci7931b192020-06-25 17:05:03 +02001302/**
Michal Vaskobb844672020-07-03 11:06:12 +02001303 * @brief Validate the whole data subtree.
1304 *
1305 * @param[in] root Subtree root.
Michal Vasko32711382020-12-03 14:14:31 +01001306 * @param[in,out] node_types Set for unres node types.
1307 * @param[in,out] meta_types Set for unres metadata types.
1308 * @param[in,out] node_when Set for nodes with when conditions.
Michal Vasko29adfbe2020-12-08 17:12:03 +01001309 * @param[in] impl_opts Implicit options, see @ref implicitoptions.
Michal Vasko8104fd42020-07-13 11:09:51 +02001310 * @param[in,out] diff Validation diff.
Michal Vaskobb844672020-07-03 11:06:12 +02001311 * @return LY_ERR value.
Radek Krejci7931b192020-06-25 17:05:03 +02001312 */
Michal Vaskob1b5c262020-03-05 14:29:47 +01001313static LY_ERR
Michal Vasko32711382020-12-03 14:14:31 +01001314lyd_validate_subtree(struct lyd_node *root, struct ly_set *node_types, struct ly_set *meta_types,
Michal Vasko29adfbe2020-12-08 17:12:03 +01001315 struct ly_set *node_when, uint32_t impl_opts, struct lyd_node **diff)
Michal Vaskofea12c62020-03-30 11:00:15 +02001316{
1317 const struct lyd_meta *meta;
Michal Vasko56daf732020-08-10 10:57:18 +02001318 struct lyd_node *node;
Michal Vaskofea12c62020-03-30 11:00:15 +02001319
Michal Vasko56daf732020-08-10 10:57:18 +02001320 LYD_TREE_DFS_BEGIN(root, node) {
Michal Vasko0275cf62020-11-05 17:40:30 +01001321 LY_LIST_FOR(node->meta, meta) {
1322 if (((struct lyext_metadata *)meta->annotation->data)->type->plugin->validate) {
1323 /* metadata type resolution */
Michal Vasko32711382020-12-03 14:14:31 +01001324 LY_CHECK_RET(ly_set_add(meta_types, (void *)meta, 1, NULL));
Michal Vaskofea12c62020-03-30 11:00:15 +02001325 }
Michal Vasko0275cf62020-11-05 17:40:30 +01001326 }
Michal Vaskofea12c62020-03-30 11:00:15 +02001327
Michal Vasko0275cf62020-11-05 17:40:30 +01001328 if ((node->schema->nodetype & LYD_NODE_TERM) && ((struct lysc_node_leaf *)node->schema)->type->plugin->validate) {
1329 /* node type resolution */
Michal Vasko32711382020-12-03 14:14:31 +01001330 LY_CHECK_RET(ly_set_add(node_types, (void *)node, 1, NULL));
Michal Vasko0275cf62020-11-05 17:40:30 +01001331 } else if (node->schema->nodetype & LYD_NODE_INNER) {
1332 /* new node validation, autodelete */
1333 LY_CHECK_RET(lyd_validate_new(lyd_node_children_p((struct lyd_node *)node), node->schema, NULL, diff));
Michal Vaskofea12c62020-03-30 11:00:15 +02001334
Michal Vasko0275cf62020-11-05 17:40:30 +01001335 /* add nested defaults */
Michal Vaskobd4db892020-11-23 16:58:20 +01001336 LY_CHECK_RET(lyd_new_implicit_r(node, lyd_node_children_p((struct lyd_node *)node), NULL, NULL, NULL,
Michal Vasko29adfbe2020-12-08 17:12:03 +01001337 NULL, impl_opts, diff));
Michal Vasko0275cf62020-11-05 17:40:30 +01001338 }
Michal Vaskofea12c62020-03-30 11:00:15 +02001339
Michal Vasko0275cf62020-11-05 17:40:30 +01001340 if (!(node->schema->nodetype & (LYS_RPC | LYS_ACTION | LYS_NOTIF)) && node->schema->when) {
1341 /* when evaluation */
Michal Vasko32711382020-12-03 14:14:31 +01001342 LY_CHECK_RET(ly_set_add(node_when, (void *)node, 1, NULL));
Michal Vaskofea12c62020-03-30 11:00:15 +02001343 }
1344
Michal Vasko56daf732020-08-10 10:57:18 +02001345 LYD_TREE_DFS_END(root, node);
Michal Vaskofea12c62020-03-30 11:00:15 +02001346 }
1347
1348 return LY_SUCCESS;
1349}
1350
Michal Vaskobb844672020-07-03 11:06:12 +02001351/**
1352 * @brief Validate data tree.
1353 *
1354 * @param[in,out] tree Data tree to validate, nodes may be autodeleted.
1355 * @param[in] modules Array of modules to validate, NULL for all modules.
1356 * @param[in] mod_count Count of @p modules.
1357 * @param[in] ly_ctx libyang context.
1358 * @param[in] val_opts Validation options, see @ref datavalidationoptions.
Michal Vasko8104fd42020-07-13 11:09:51 +02001359 * @param[out] diff Generated validation diff, not generated if NULL.
Michal Vaskobb844672020-07-03 11:06:12 +02001360 * @return LY_ERR value.
1361 */
Michal Vaskofea12c62020-03-30 11:00:15 +02001362static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02001363lyd_validate(struct lyd_node **tree, const struct lys_module *module, const struct ly_ctx *ctx, uint32_t val_opts,
Radek Krejci0f969882020-08-21 16:56:47 +02001364 struct lyd_node **diff)
Michal Vaskof03ed032020-03-04 13:31:44 +01001365{
1366 LY_ERR ret = LY_SUCCESS;
Michal Vasko73e47212020-12-03 14:20:16 +01001367 struct lyd_node *first, *next, **first2, *iter;
Michal Vaskob1b5c262020-03-05 14:29:47 +01001368 const struct lys_module *mod;
Michal Vasko32711382020-12-03 14:14:31 +01001369 struct ly_set node_types = {0}, meta_types = {0}, node_when = {0};
Michal Vaskob1b5c262020-03-05 14:29:47 +01001370 uint32_t i = 0;
Michal Vaskof03ed032020-03-04 13:31:44 +01001371
Michal Vasko26e80012020-07-08 10:55:46 +02001372 LY_CHECK_ARG_RET(NULL, tree, *tree || ctx || module, LY_EINVAL);
Michal Vasko5a532f32020-12-10 12:18:47 +01001373 if (!ctx && !module) {
1374 ctx = LYD_CTX(*tree);
1375 }
Michal Vasko8104fd42020-07-13 11:09:51 +02001376 if (diff) {
1377 *diff = NULL;
1378 }
Michal Vaskof03ed032020-03-04 13:31:44 +01001379
Michal Vaskob1b5c262020-03-05 14:29:47 +01001380 next = *tree;
1381 while (1) {
Radek Krejci7931b192020-06-25 17:05:03 +02001382 if (val_opts & LYD_VALIDATE_PRESENT) {
Michal Vaskob1b5c262020-03-05 14:29:47 +01001383 mod = lyd_data_next_module(&next, &first);
1384 } else {
Michal Vasko26e80012020-07-08 10:55:46 +02001385 mod = lyd_mod_next_module(next, module, ctx, &i, &first);
Michal Vaskof03ed032020-03-04 13:31:44 +01001386 }
Michal Vaskob1b5c262020-03-05 14:29:47 +01001387 if (!mod) {
1388 break;
1389 }
Michal Vasko7c4cf1e2020-06-22 10:04:30 +02001390 if (!first || (first == *tree)) {
Michal Vaskob1b5c262020-03-05 14:29:47 +01001391 /* make sure first2 changes are carried to tree */
1392 first2 = tree;
1393 } else {
1394 first2 = &first;
1395 }
1396
1397 /* validate new top-level nodes of this module, autodelete */
Michal Vasko8104fd42020-07-13 11:09:51 +02001398 ret = lyd_validate_new(first2, NULL, mod, diff);
1399 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskob1b5c262020-03-05 14:29:47 +01001400
Michal Vasko0275cf62020-11-05 17:40:30 +01001401 /* add all top-level defaults for this module, do not add into unres sets, will occur in the next step */
1402 ret = lyd_new_implicit_r(NULL, first2, NULL, mod, NULL, NULL, val_opts & LYD_VALIDATE_NO_STATE ?
Michal Vasko69730152020-10-09 16:30:07 +02001403 LYD_IMPLICIT_NO_STATE : 0, diff);
Michal Vasko8104fd42020-07-13 11:09:51 +02001404 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskob1b5c262020-03-05 14:29:47 +01001405
Michal Vaskod3bb12f2020-12-04 14:33:09 +01001406 /* our first module node pointer may no longer be the first */
1407 while (*first2 && (*first2)->prev->next && (lyd_owner_module(*first2) == lyd_owner_module((*first2)->prev))) {
1408 *first2 = (*first2)->prev;
1409 }
1410
Michal Vaskob1b5c262020-03-05 14:29:47 +01001411 /* process nested nodes */
Michal Vasko73e47212020-12-03 14:20:16 +01001412 LY_LIST_FOR(*first2, iter) {
Michal Vasko79135ae2020-12-16 10:08:35 +01001413 ret = lyd_validate_subtree(iter, &node_types, &meta_types, &node_when, val_opts & LYD_VALIDATE_NO_STATE ?
1414 LYD_IMPLICIT_NO_STATE : 0, diff);
Michal Vasko8104fd42020-07-13 11:09:51 +02001415 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskob1b5c262020-03-05 14:29:47 +01001416 }
1417
1418 /* finish incompletely validated terminal values/attributes and when conditions */
Michal Vaskod3bb12f2020-12-04 14:33:09 +01001419 ret = lyd_validate_unres(first2, mod, &node_when, &node_types, &meta_types, diff);
Michal Vaskob1b5c262020-03-05 14:29:47 +01001420 LY_CHECK_GOTO(ret, cleanup);
1421
1422 /* perform final validation that assumes the data tree is final */
Michal Vaskobd4db892020-11-23 16:58:20 +01001423 ret = lyd_validate_final_r(*first2, NULL, NULL, mod, val_opts, 0);
Michal Vasko8104fd42020-07-13 11:09:51 +02001424 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskof03ed032020-03-04 13:31:44 +01001425 }
1426
Michal Vaskof03ed032020-03-04 13:31:44 +01001427cleanup:
Michal Vasko32711382020-12-03 14:14:31 +01001428 ly_set_erase(&node_types, NULL);
1429 ly_set_erase(&meta_types, NULL);
1430 ly_set_erase(&node_when, NULL);
Michal Vaskof03ed032020-03-04 13:31:44 +01001431 return ret;
1432}
Michal Vaskob1b5c262020-03-05 14:29:47 +01001433
1434API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02001435lyd_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 +01001436{
Michal Vasko3a41dff2020-07-15 14:30:28 +02001437 return lyd_validate(tree, NULL, ctx, val_opts, diff);
Michal Vaskob1b5c262020-03-05 14:29:47 +01001438}
1439
1440API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02001441lyd_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 +01001442{
Michal Vasko3a41dff2020-07-15 14:30:28 +02001443 return lyd_validate(tree, module, NULL, val_opts, diff);
Michal Vaskob1b5c262020-03-05 14:29:47 +01001444}
Michal Vaskofea12c62020-03-30 11:00:15 +02001445
Michal Vaskobb844672020-07-03 11:06:12 +02001446/**
1447 * @brief Find nodes for merging an operation into data tree for validation.
1448 *
1449 * @param[in] op_tree Full operation data tree.
1450 * @param[in] op_node Operation node itself.
1451 * @param[in] tree Data tree to be merged into.
1452 * @param[out] op_subtree Operation subtree to merge.
Michal Vasko2f03d222020-12-09 18:15:51 +01001453 * @param[out] tree_sibling Data tree sibling to merge next to, is set if @p tree_parent is NULL.
1454 * @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 +02001455 */
Michal Vaskocb7526d2020-03-30 15:08:26 +02001456static void
Michal Vaskobb844672020-07-03 11:06:12 +02001457lyd_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 +01001458 struct lyd_node **op_subtree, struct lyd_node **tree_sibling, struct lyd_node **tree_parent)
Michal Vaskofea12c62020-03-30 11:00:15 +02001459{
Michal Vaskocb7526d2020-03-30 15:08:26 +02001460 const struct lyd_node *tree_iter, *op_iter;
1461 struct lyd_node *match;
Michal Vaskofea12c62020-03-30 11:00:15 +02001462 uint32_t i, cur_depth, op_depth;
Michal Vaskofea12c62020-03-30 11:00:15 +02001463
Michal Vasko2f03d222020-12-09 18:15:51 +01001464 *op_subtree = NULL;
1465 *tree_sibling = NULL;
1466 *tree_parent = NULL;
1467
Michal Vaskocb7526d2020-03-30 15:08:26 +02001468 /* learn op depth (top-level being depth 0) */
Michal Vaskofea12c62020-03-30 11:00:15 +02001469 op_depth = 0;
Michal Vaskobb844672020-07-03 11:06:12 +02001470 for (op_iter = op_node; op_iter != op_tree; op_iter = (struct lyd_node *)op_iter->parent) {
Michal Vaskofea12c62020-03-30 11:00:15 +02001471 ++op_depth;
1472 }
1473
1474 /* find where to merge op */
1475 tree_iter = tree;
1476 cur_depth = op_depth;
Michal Vasko2f03d222020-12-09 18:15:51 +01001477 while (cur_depth && tree_iter) {
Michal Vaskofea12c62020-03-30 11:00:15 +02001478 /* find op iter in tree */
1479 lyd_find_sibling_first(tree_iter, op_iter, &match);
1480 if (!match) {
1481 break;
1482 }
1483
1484 /* move tree_iter */
Radek Krejcia1c1e542020-09-29 16:06:52 +02001485 tree_iter = lyd_child(match);
Michal Vaskofea12c62020-03-30 11:00:15 +02001486
1487 /* move depth */
1488 --cur_depth;
Michal Vasko2f03d222020-12-09 18:15:51 +01001489
1490 /* find next op parent */
1491 op_iter = op_node;
1492 for (i = 0; i < cur_depth; ++i) {
1493 op_iter = (struct lyd_node *)op_iter->parent;
1494 }
Michal Vaskofea12c62020-03-30 11:00:15 +02001495 }
1496
Michal Vasko2f03d222020-12-09 18:15:51 +01001497 assert(op_iter);
Michal Vaskobb844672020-07-03 11:06:12 +02001498 *op_subtree = (struct lyd_node *)op_iter;
Michal Vasko2f03d222020-12-09 18:15:51 +01001499 if (!tree || tree_iter) {
1500 /* there is no tree whatsoever or this is the last found sibling */
1501 *tree_sibling = (struct lyd_node *)tree_iter;
1502 } else {
1503 /* matching parent was found but it has no children to insert next to */
1504 assert(match);
1505 *tree_parent = match;
1506 }
Michal Vaskocb7526d2020-03-30 15:08:26 +02001507}
1508
1509API LY_ERR
Michal Vasko8104fd42020-07-13 11:09:51 +02001510lyd_validate_op(struct lyd_node *op_tree, const struct lyd_node *tree, LYD_VALIDATE_OP op, struct lyd_node **diff)
Michal Vaskocb7526d2020-03-30 15:08:26 +02001511{
1512 LY_ERR ret;
Michal Vasko2f03d222020-12-09 18:15:51 +01001513 struct lyd_node *tree_sibling, *tree_parent, *op_subtree, *op_node, *op_parent;
Michal Vaskocb7526d2020-03-30 15:08:26 +02001514 struct ly_set type_check = {0}, type_meta_check = {0}, when_check = {0};
1515
1516 LY_CHECK_ARG_RET(NULL, op_tree, !op_tree->parent, !tree || !tree->parent,
Radek Krejci0f969882020-08-21 16:56:47 +02001517 (op == LYD_VALIDATE_OP_NOTIF) || (op == LYD_VALIDATE_OP_RPC) || (op == LYD_VALIDATE_OP_REPLY), LY_EINVAL);
Michal Vasko8104fd42020-07-13 11:09:51 +02001518 if (diff) {
1519 *diff = NULL;
1520 }
Michal Vaskocb7526d2020-03-30 15:08:26 +02001521
1522 /* find the operation/notification */
Michal Vasko56daf732020-08-10 10:57:18 +02001523 LYD_TREE_DFS_BEGIN(op_tree, op_node) {
Michal Vasko69730152020-10-09 16:30:07 +02001524 if (((op == LYD_VALIDATE_OP_RPC) || (op == LYD_VALIDATE_OP_REPLY)) && (op_node->schema->nodetype & (LYS_RPC | LYS_ACTION))) {
Michal Vaskocb7526d2020-03-30 15:08:26 +02001525 break;
Radek Krejci7931b192020-06-25 17:05:03 +02001526 } else if ((op == LYD_VALIDATE_OP_NOTIF) && (op_node->schema->nodetype == LYS_NOTIF)) {
Michal Vaskocb7526d2020-03-30 15:08:26 +02001527 break;
1528 }
Michal Vasko56daf732020-08-10 10:57:18 +02001529 LYD_TREE_DFS_END(op_tree, op_node);
Michal Vaskocb7526d2020-03-30 15:08:26 +02001530 }
Michal Vasko69730152020-10-09 16:30:07 +02001531 if ((op == LYD_VALIDATE_OP_RPC) || (op == LYD_VALIDATE_OP_REPLY)) {
Radek Krejci7931b192020-06-25 17:05:03 +02001532 if (!(op_node->schema->nodetype & (LYS_RPC | LYS_ACTION))) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001533 LOGERR(LYD_CTX(op_tree), LY_EINVAL, "No RPC/action to validate found.");
Michal Vaskocb7526d2020-03-30 15:08:26 +02001534 return LY_EINVAL;
1535 }
1536 } else {
Radek Krejci7931b192020-06-25 17:05:03 +02001537 if (op_node->schema->nodetype != LYS_NOTIF) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001538 LOGERR(LYD_CTX(op_tree), LY_EINVAL, "No notification to validate found.");
Michal Vaskocb7526d2020-03-30 15:08:26 +02001539 return LY_EINVAL;
1540 }
1541 }
1542
1543 /* move op_tree to top-level node */
1544 while (op_tree->parent) {
1545 op_tree = (struct lyd_node *)op_tree->parent;
1546 }
1547
1548 /* merge op_tree into tree */
Michal Vasko2f03d222020-12-09 18:15:51 +01001549 lyd_val_op_merge_find(op_tree, op_node, tree, &op_subtree, &tree_sibling, &tree_parent);
1550 op_parent = lyd_parent(op_subtree);
Radek Krejci7931b192020-06-25 17:05:03 +02001551 lyd_unlink_tree(op_subtree);
Michal Vasko2f03d222020-12-09 18:15:51 +01001552 lyd_insert_node(tree_parent, &tree_sibling, op_subtree);
Michal Vaskofea12c62020-03-30 11:00:15 +02001553 if (!tree) {
Michal Vaskocb7526d2020-03-30 15:08:26 +02001554 tree = tree_sibling;
Michal Vaskofea12c62020-03-30 11:00:15 +02001555 }
1556
Radek Krejciddace2c2021-01-08 11:30:56 +01001557 LOG_LOCSET(NULL, op_node, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +01001558
Michal Vaskofea12c62020-03-30 11:00:15 +02001559 /* prevalidate whole operation subtree */
Michal Vasko29adfbe2020-12-08 17:12:03 +01001560 LY_CHECK_GOTO(ret = lyd_validate_subtree(op_node, &type_check, &type_meta_check, &when_check,
1561 op == LYD_VALIDATE_OP_REPLY ? LYD_IMPLICIT_OUTPUT : 0, diff), cleanup);
Michal Vaskofea12c62020-03-30 11:00:15 +02001562
1563 /* finish incompletely validated terminal values/attributes and when conditions on the full tree */
Michal Vaskod3bb12f2020-12-04 14:33:09 +01001564 LY_CHECK_GOTO(ret = lyd_validate_unres((struct lyd_node **)&tree, NULL, &when_check, &type_check, &type_meta_check,
Michal Vaskofeca4fb2020-10-05 08:58:40 +02001565 diff), cleanup);
Michal Vaskofea12c62020-03-30 11:00:15 +02001566
1567 /* perform final validation of the operation/notification */
Radek Krejci7931b192020-06-25 17:05:03 +02001568 lyd_validate_obsolete(op_node);
Radek Krejci7931b192020-06-25 17:05:03 +02001569 LY_CHECK_GOTO(ret = lyd_validate_must(op_node, op), cleanup);
Michal Vaskofea12c62020-03-30 11:00:15 +02001570
1571 /* final validation of all the descendants */
Michal Vaskobd4db892020-11-23 16:58:20 +01001572 LY_CHECK_GOTO(ret = lyd_validate_final_r(lyd_child(op_node), op_node, op_node->schema, NULL, 0, op), cleanup);
Michal Vaskofea12c62020-03-30 11:00:15 +02001573
1574cleanup:
Radek Krejciddace2c2021-01-08 11:30:56 +01001575 LOG_LOCBACK(0, 1, 0, 0);
Michal Vaskofea12c62020-03-30 11:00:15 +02001576 /* restore operation tree */
Radek Krejci7931b192020-06-25 17:05:03 +02001577 lyd_unlink_tree(op_subtree);
Michal Vaskocb7526d2020-03-30 15:08:26 +02001578 if (op_parent) {
Radek Krejci7931b192020-06-25 17:05:03 +02001579 lyd_insert_node(op_parent, NULL, op_subtree);
Michal Vaskofea12c62020-03-30 11:00:15 +02001580 }
1581
1582 ly_set_erase(&type_check, NULL);
1583 ly_set_erase(&type_meta_check, NULL);
1584 ly_set_erase(&when_check, NULL);
1585 return ret;
1586}