blob: 0bc5ac46cc6ac9940feabc382d1da8443b407702 [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);
131 ret = lyxp_eval(when->cond, schema->module, LY_PREF_SCHEMA_RESOLVED, when->prefixes, ctx_node, tree,
132 &xp_set, LYXP_SCHEMA);
133 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;
170 struct lyd_node *node;
171
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];
180
181 /* evaluate all when expressions that affect this node's existence */
182 ret = lyd_validate_node_when(*tree, node, node->schema, &disabled);
183 if (!ret) {
184 if (disabled) {
185 /* when false */
186 if (node->flags & LYD_WHEN_TRUE) {
187 /* autodelete */
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100188 lyd_del_move_root(tree, node, mod);
Michal Vaskobd4db892020-11-23 16:58:20 +0100189 if (diff) {
190 /* add into diff */
191 LY_CHECK_RET(lyd_val_diff_add(node, LYD_DIFF_OP_DELETE, diff));
192 }
193 lyd_free_tree(node);
194 } else {
195 /* invalid data */
196 LOGVAL(LYD_CTX(node), LY_VLOG_LYD, node, LY_VCODE_NOWHEN, disabled->cond->expr);
197 return LY_EVALID;
198 }
199 } else {
200 /* when true */
201 node->flags |= LYD_WHEN_TRUE;
202 }
203
204 /* remove this node from the set, its when was resolved */
205 ly_set_rm_index(node_when, i, NULL);
206 } else if (ret != LY_EINCOMPLETE) {
207 /* error */
208 return ret;
209 }
210 } while (i);
211
212 return LY_SUCCESS;
Michal Vaskocde73ac2019-11-14 16:10:27 +0100213}
214
215LY_ERR
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100216lyd_validate_unres(struct lyd_node **tree, const struct lys_module *mod, struct ly_set *node_when,
217 struct ly_set *node_types, struct ly_set *meta_types, struct lyd_node **diff)
Michal Vaskocde73ac2019-11-14 16:10:27 +0100218{
219 LY_ERR ret = LY_SUCCESS;
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200220 uint32_t i;
Michal Vaskocde73ac2019-11-14 16:10:27 +0100221
Michal Vaskob1b5c262020-03-05 14:29:47 +0100222 if (node_when) {
223 /* evaluate all when conditions */
224 uint32_t prev_count;
225 do {
226 prev_count = node_when->count;
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100227 LY_CHECK_RET(lyd_validate_unres_when(tree, mod, node_when, diff));
Radek Krejci0f969882020-08-21 16:56:47 +0200228 /* there must have been some when conditions resolved */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100229 } while (prev_count > node_when->count);
Michal Vaskocde73ac2019-11-14 16:10:27 +0100230
Michal Vaskob1b5c262020-03-05 14:29:47 +0100231 /* there could have been no cyclic when dependencies, checked during compilation */
232 assert(!node_when->count);
233 }
234
235 if (node_types && node_types->count) {
236 /* finish incompletely validated terminal values (traverse from the end for efficient set removal) */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200237 i = node_types->count;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100238 do {
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200239 --i;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100240
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200241 struct lyd_node_term *node = (struct lyd_node_term *)node_types->objs[i];
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200242 struct lysc_type *type = ((struct lysc_node_leaf *)node->schema)->type;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100243
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200244 /* resolve the value of the node */
245 ret = lyd_value_validate_incomplete(LYD_CTX(node), type, &node->value, (struct lyd_node *)node, *tree,
246 LY_VLOG_LYD, node);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100247 LY_CHECK_RET(ret);
248
249 /* remove this node from the set */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200250 ly_set_rm_index(node_types, i, NULL);
251 } while (i);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100252 }
253
Michal Vasko9f96a052020-03-10 09:41:45 +0100254 if (meta_types && meta_types->count) {
255 /* ... and metadata values */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200256 i = meta_types->count;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100257 do {
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200258 --i;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100259
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200260 struct lyd_meta *meta = (struct lyd_meta *)meta_types->objs[i];
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200261 struct lysc_type *type = ((struct lyext_metadata *)meta->annotation->data)->type;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100262
Michal Vasko9f96a052020-03-10 09:41:45 +0100263 /* validate and store the value of the metadata */
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200264 ret = lyd_value_validate_incomplete(LYD_CTX(meta->parent), type, &meta->value, meta->parent, *tree,
265 LY_VLOG_NONE, NULL);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100266 LY_CHECK_RET(ret);
267
268 /* remove this attr from the set */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200269 ly_set_rm_index(meta_types, i, NULL);
270 } while (i);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100271 }
Michal Vaskocde73ac2019-11-14 16:10:27 +0100272
273 return ret;
274}
275
Michal Vaskobb844672020-07-03 11:06:12 +0200276/**
277 * @brief Validate instance duplication.
278 *
279 * @param[in] first First sibling to search in.
280 * @param[in] node Data node instance to check.
281 * @return LY_ERR value.
282 */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100283static LY_ERR
284lyd_validate_duplicates(const struct lyd_node *first, const struct lyd_node *node)
Michal Vaskocde73ac2019-11-14 16:10:27 +0100285{
Michal Vaskob1b5c262020-03-05 14:29:47 +0100286 struct lyd_node **match_p;
Radek Krejci857189e2020-09-01 13:26:36 +0200287 ly_bool fail = 0;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100288
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100289 assert(node->flags & LYD_NEW);
290
Michal Vaskob1b5c262020-03-05 14:29:47 +0100291 if ((node->schema->nodetype & (LYS_LIST | LYS_LEAFLIST)) && (node->schema->flags & LYS_CONFIG_R)) {
292 /* duplicate instances allowed */
293 return LY_SUCCESS;
Michal Vaskocde73ac2019-11-14 16:10:27 +0100294 }
295
Michal Vaskob1b5c262020-03-05 14:29:47 +0100296 /* find exactly the same next instance using hashes if possible */
297 if (node->parent && node->parent->children_ht) {
298 if (!lyht_find_next(node->parent->children_ht, &node, node->hash, (void **)&match_p)) {
299 fail = 1;
300 }
301 } else {
Michal Vaskod989ba02020-08-24 10:59:24 +0200302 for ( ; first; first = first->next) {
Michal Vaskob1b5c262020-03-05 14:29:47 +0100303 if (first == node) {
304 continue;
305 }
306
307 if (node->schema->nodetype & (LYD_NODE_ANY | LYS_LEAF)) {
308 if (first->schema == node->schema) {
309 fail = 1;
310 break;
311 }
Michal Vasko8f359bf2020-07-28 10:41:15 +0200312 } else if (!lyd_compare_single(first, node, 0)) {
Michal Vaskob1b5c262020-03-05 14:29:47 +0100313 fail = 1;
314 break;
315 }
316 }
317 }
318
319 if (fail) {
320 LOGVAL(node->schema->module->ctx, LY_VLOG_LYD, node, LY_VCODE_DUP, node->schema->name);
321 return LY_EVALID;
322 }
323 return LY_SUCCESS;
Michal Vaskocde73ac2019-11-14 16:10:27 +0100324}
325
Michal Vaskobb844672020-07-03 11:06:12 +0200326/**
327 * @brief Validate multiple case data existence with possible autodelete.
328 *
329 * @param[in,out] first First sibling to search in, is updated if needed.
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100330 * @param[in] mod Module of the siblings, NULL for nested siblings.
Michal Vaskobb844672020-07-03 11:06:12 +0200331 * @param[in] choic Choice node whose cases to check.
Michal Vasko8104fd42020-07-13 11:09:51 +0200332 * @param[in,out] diff Validation diff.
Michal Vaskobb844672020-07-03 11:06:12 +0200333 * @return LY_ERR value.
334 */
Michal Vaskocde73ac2019-11-14 16:10:27 +0100335static LY_ERR
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100336lyd_validate_cases(struct lyd_node **first, const struct lys_module *mod, const struct lysc_node_choice *choic,
337 struct lyd_node **diff)
Michal Vaskob1b5c262020-03-05 14:29:47 +0100338{
339 const struct lysc_node *scase, *iter, *old_case = NULL, *new_case = NULL;
340 struct lyd_node *match, *to_del;
Radek Krejci857189e2020-09-01 13:26:36 +0200341 ly_bool found;
Michal Vaskob1b5c262020-03-05 14:29:47 +0100342
343 LY_LIST_FOR((struct lysc_node *)choic->cases, scase) {
344 found = 0;
345 iter = NULL;
346 match = NULL;
347 while ((match = lys_getnext_data(match, *first, &iter, scase, NULL))) {
348 if (match->flags & LYD_NEW) {
349 /* a new case data found, nothing more to look for */
350 found = 2;
351 break;
352 } else {
353 /* and old case data found */
354 if (found == 0) {
355 found = 1;
356 }
357 }
358 }
359
360 if (found == 1) {
361 /* there should not be 2 old cases */
362 if (old_case) {
363 /* old data from 2 cases */
364 LOGVAL(choic->module->ctx, LY_VLOG_LYSC, choic, LY_VCODE_DUPCASE, old_case->name, scase->name);
365 return LY_EVALID;
366 }
367
368 /* remember an old existing case */
369 old_case = scase;
370 } else if (found == 2) {
371 if (new_case) {
372 /* new data from 2 cases */
373 LOGVAL(choic->module->ctx, LY_VLOG_LYSC, choic, LY_VCODE_DUPCASE, new_case->name, scase->name);
374 return LY_EVALID;
375 }
376
377 /* remember a new existing case */
378 new_case = scase;
379 }
380 }
381
382 if (old_case && new_case) {
383 /* auto-delete old case */
384 iter = NULL;
385 match = NULL;
386 to_del = NULL;
387 while ((match = lys_getnext_data(match, *first, &iter, old_case, NULL))) {
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100388 lyd_del_move_root(first, to_del, mod);
389
Michal Vasko8104fd42020-07-13 11:09:51 +0200390 /* free previous node */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100391 lyd_free_tree(to_del);
Michal Vasko8104fd42020-07-13 11:09:51 +0200392 if (diff) {
393 /* add into diff */
394 LY_CHECK_RET(lyd_val_diff_add(match, LYD_DIFF_OP_DELETE, diff));
395 }
Michal Vaskob1b5c262020-03-05 14:29:47 +0100396 to_del = match;
397 }
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100398 lyd_del_move_root(first, to_del, mod);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100399 lyd_free_tree(to_del);
400 }
401
402 return LY_SUCCESS;
403}
404
Michal Vaskobb844672020-07-03 11:06:12 +0200405/**
406 * @brief Check whether a schema node can have some default values (true for NP containers as well).
407 *
408 * @param[in] schema Schema node to check.
409 * @return non-zero if yes,
410 * @return 0 otherwise.
411 */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100412static int
413lyd_val_has_default(const struct lysc_node *schema)
414{
415 switch (schema->nodetype) {
416 case LYS_LEAF:
417 if (((struct lysc_node_leaf *)schema)->dflt) {
418 return 1;
419 }
420 break;
421 case LYS_LEAFLIST:
422 if (((struct lysc_node_leaflist *)schema)->dflts) {
423 return 1;
424 }
425 break;
426 case LYS_CONTAINER:
427 if (!(schema->flags & LYS_PRESENCE)) {
428 return 1;
429 }
430 break;
431 default:
432 break;
433 }
434
435 return 0;
436}
437
Michal Vaskobb844672020-07-03 11:06:12 +0200438/**
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100439 * @brief Properly delete a node as part of autodelete validation tasks.
440 *
441 * @param[in,out] first First sibling, is updated if needed.
442 * @param[in] node Node instance to delete.
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100443 * @param[in] mod Module of the siblings, NULL for nested siblings.
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100444 * @param[in,out] next_p Temporary LY_LIST_FOR_SAFE next pointer, is updated if needed.
445 * @param[in,out] diff Validation diff.
446 */
447static void
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100448lyd_validate_autodel_node_del(struct lyd_node **first, struct lyd_node *node, const struct lys_module *mod,
449 struct lyd_node **next_p, struct lyd_node **diff)
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100450{
451 struct lyd_node *iter;
452
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100453 lyd_del_move_root(first, node, mod);
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100454 if (node == *next_p) {
455 *next_p = (*next_p)->next;
456 }
457 if (diff) {
458 /* add into diff */
459 if ((node->schema->nodetype == LYS_CONTAINER) && !(node->schema->flags & LYS_PRESENCE)) {
460 /* we do not want to track NP container changes, but remember any removed children */
461 LY_LIST_FOR(lyd_child(node), iter) {
462 lyd_val_diff_add(iter, LYD_DIFF_OP_DELETE, diff);
463 }
464 } else {
465 lyd_val_diff_add(node, LYD_DIFF_OP_DELETE, diff);
466 }
467 }
468 lyd_free_tree(node);
469}
470
471/**
Michal Vaskobb844672020-07-03 11:06:12 +0200472 * @brief Autodelete old instances to prevent validation errors.
473 *
474 * @param[in,out] first First sibling to search in, is updated if needed.
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100475 * @param[in] node New data node instance to check.
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100476 * @param[in] mod Module of the siblings, NULL for nested siblings.
Michal Vaskobb844672020-07-03 11:06:12 +0200477 * @param[in,out] next_p Temporary LY_LIST_FOR_SAFE next pointer, is updated if needed.
Michal Vasko8104fd42020-07-13 11:09:51 +0200478 * @param[in,out] diff Validation diff.
Michal Vaskobb844672020-07-03 11:06:12 +0200479 */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100480static void
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100481lyd_validate_autodel_dup(struct lyd_node **first, struct lyd_node *node, const struct lys_module *mod,
482 struct lyd_node **next_p, struct lyd_node **diff)
Michal Vaskob1b5c262020-03-05 14:29:47 +0100483{
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100484 struct lyd_node *match, *next;
485
486 assert(node->flags & LYD_NEW);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100487
488 if (lyd_val_has_default(node->schema)) {
489 assert(node->schema->nodetype & (LYS_LEAF | LYS_LEAFLIST | LYS_CONTAINER));
Michal Vasko4c583e82020-07-17 12:16:14 +0200490 LYD_LIST_FOR_INST_SAFE(*first, node->schema, next, match) {
Michal Vaskob1b5c262020-03-05 14:29:47 +0100491 if ((match->flags & LYD_DEFAULT) && !(match->flags & LYD_NEW)) {
492 /* default instance found, remove it */
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100493 lyd_validate_autodel_node_del(first, match, mod, next_p, diff);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100494
495 /* remove only a single container/leaf default instance, if there are more, it is an error */
496 if (node->schema->nodetype & (LYS_LEAF | LYS_CONTAINER)) {
497 break;
498 }
499 }
Michal Vaskob1b5c262020-03-05 14:29:47 +0100500 }
501 }
502}
503
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100504/**
505 * @brief Autodelete leftover default nodes of deleted cases (that have no existing explicit data).
506 *
507 * @param[in,out] first First sibling to search in, is updated if needed.
508 * @param[in] node Default data node instance to check.
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100509 * @param[in] mod Module of the siblings, NULL for nested siblings.
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100510 * @param[in,out] next_p Temporary LY_LIST_FOR_SAFE next pointer, is updated if needed.
511 * @param[in,out] diff Validation diff.
512 */
513static void
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100514lyd_validate_autodel_case_dflt(struct lyd_node **first, struct lyd_node *node, const struct lys_module *mod,
515 struct lyd_node **next_p, struct lyd_node **diff)
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100516{
517 struct lysc_node_choice *choic;
518 struct lyd_node *iter = NULL;
519 const struct lysc_node *slast = NULL;
520
521 assert(node->flags & LYD_DEFAULT);
522
523 if (!node->schema->parent || (node->schema->parent->nodetype != LYS_CASE)) {
524 /* the default node is not a descendant of a case */
525 return;
526 }
527
528 choic = (struct lysc_node_choice *)node->schema->parent->parent;
529 assert(choic->nodetype == LYS_CHOICE);
530
531 if (choic->dflt && (choic->dflt == (struct lysc_node_case *)node->schema->parent)) {
532 /* data of a default case, keep them */
533 return;
534 }
535
536 /* try to find an explicit node of the case */
537 while ((iter = lys_getnext_data(iter, *first, &slast, node->schema->parent, NULL))) {
538 if (!(iter->flags & LYD_DEFAULT)) {
539 break;
540 }
541 }
542
543 if (!iter) {
544 /* there are only default nodes of the case meaning it does not exist and neither should any default nodes
545 * of the case, remove this one default node */
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100546 lyd_validate_autodel_node_del(first, node, mod, next_p, diff);
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100547 }
548}
549
Michal Vaskob1b5c262020-03-05 14:29:47 +0100550LY_ERR
Michal Vasko8104fd42020-07-13 11:09:51 +0200551lyd_validate_new(struct lyd_node **first, const struct lysc_node *sparent, const struct lys_module *mod,
Radek Krejci0f969882020-08-21 16:56:47 +0200552 struct lyd_node **diff)
Michal Vaskob1b5c262020-03-05 14:29:47 +0100553{
554 struct lyd_node *next, *node;
555 const struct lysc_node *snode = NULL;
556
557 assert(first && (sparent || mod));
558
559 while (*first && (snode = lys_getnext(snode, sparent, mod ? mod->compiled : NULL, LYS_GETNEXT_WITHCHOICE))) {
560 /* check case duplicites */
561 if (snode->nodetype == LYS_CHOICE) {
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100562 LY_CHECK_RET(lyd_validate_cases(first, mod, (struct lysc_node_choice *)snode, diff));
Michal Vaskob1b5c262020-03-05 14:29:47 +0100563 }
564 }
565
566 LY_LIST_FOR_SAFE(*first, next, node) {
Michal Vaskoc193ce92020-03-06 11:04:48 +0100567 if (mod && (lyd_owner_module(node) != mod)) {
Michal Vaskob1b5c262020-03-05 14:29:47 +0100568 /* all top-level data from this module checked */
569 break;
570 }
571
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100572 if (!(node->flags & (LYD_NEW | LYD_DEFAULT))) {
573 /* check only new and default nodes */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100574 continue;
575 }
576
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100577 if (node->flags & LYD_NEW) {
578 /* remove old default(s) of the new node if it exists */
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100579 lyd_validate_autodel_dup(first, node, mod, &next, diff);
Michal Vaskob1b5c262020-03-05 14:29:47 +0100580
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100581 /* then check new node instance duplicities */
582 LY_CHECK_RET(lyd_validate_duplicates(*first, node));
Michal Vaskob1b5c262020-03-05 14:29:47 +0100583
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100584 /* this node is valid */
585 node->flags &= ~LYD_NEW;
586 }
587
588 if (node->flags & LYD_DEFAULT) {
589 /* remove leftover default nodes from a no-longer existing case */
Michal Vaskod3bb12f2020-12-04 14:33:09 +0100590 lyd_validate_autodel_case_dflt(first, node, mod, &next, diff);
Michal Vaskodcacf2f2020-11-18 18:18:15 +0100591 }
Michal Vaskob1b5c262020-03-05 14:29:47 +0100592 }
593
594 return LY_SUCCESS;
595}
596
Michal Vaskobb844672020-07-03 11:06:12 +0200597/**
Michal Vaskobd4db892020-11-23 16:58:20 +0100598 * @brief Evaluate any "when" conditions of a non-existent data node with existing parent.
599 *
600 * @param[in] first First data sibling of the non-existing node.
601 * @param[in] parent Data parent of the non-existing node.
602 * @param[in] snode Schema node of the non-existing node.
603 * @param[out] disabled First when that evaluated false, if any.
604 * @return LY_ERR value.
605 */
606static LY_ERR
607lyd_validate_dummy_when(const struct lyd_node *first, const struct lyd_node *parent, const struct lysc_node *snode,
608 const struct lysc_when **disabled)
609{
610 LY_ERR ret = LY_SUCCESS;
611 struct lyd_node *tree, *dummy = NULL;
612
613 /* find root */
614 if (parent) {
615 tree = (struct lyd_node *)parent;
616 while (tree->parent) {
617 tree = lyd_parent(tree);
618 }
619 tree = lyd_first_sibling(tree);
620 } else {
621 assert(!first || !first->prev->next);
622 tree = (struct lyd_node *)first;
623 }
624
625 /* create dummy opaque node */
626 ret = lyd_new_opaq((struct lyd_node *)parent, snode->module->ctx, snode->name, NULL, snode->module->name, &dummy);
627 LY_CHECK_GOTO(ret, cleanup);
628
629 /* connect it if needed */
630 if (!parent) {
631 if (first) {
632 lyd_insert_sibling((struct lyd_node *)first, dummy, &tree);
633 } else {
634 assert(!tree);
635 tree = dummy;
636 }
637 }
638
639 /* evaluate all when */
640 ret = lyd_validate_node_when(tree, dummy, snode, disabled);
641 if (ret == LY_EINCOMPLETE) {
642 /* all other when must be resolved by now */
643 LOGINT(snode->module->ctx);
644 ret = LY_EINT;
645 goto cleanup;
646 } else if (ret) {
647 /* error */
648 goto cleanup;
649 }
650
651cleanup:
652 lyd_free_tree(dummy);
653 return ret;
654}
655
656/**
Michal Vaskobb844672020-07-03 11:06:12 +0200657 * @brief Validate mandatory node existence.
658 *
659 * @param[in] first First sibling to search in.
Michal Vaskobd4db892020-11-23 16:58:20 +0100660 * @param[in] parent Data parent.
Michal Vaskobb844672020-07-03 11:06:12 +0200661 * @param[in] snode Schema node to validate.
662 * @return LY_ERR value.
663 */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100664static LY_ERR
Michal Vaskobd4db892020-11-23 16:58:20 +0100665lyd_validate_mandatory(const struct lyd_node *first, const struct lyd_node *parent, const struct lysc_node *snode)
Michal Vaskoa3881362020-01-21 15:57:35 +0100666{
Michal Vaskobd4db892020-11-23 16:58:20 +0100667 const struct lysc_when *disabled;
668
Michal Vaskoa3881362020-01-21 15:57:35 +0100669 if (snode->nodetype == LYS_CHOICE) {
Michal Vasko9b368d32020-02-14 13:53:31 +0100670 /* some data of a choice case exist */
Michal Vaskob1b5c262020-03-05 14:29:47 +0100671 if (lys_getnext_data(NULL, first, NULL, snode, NULL)) {
Michal Vasko9b368d32020-02-14 13:53:31 +0100672 return LY_SUCCESS;
673 }
674 } else {
675 assert(snode->nodetype & (LYS_LEAF | LYS_CONTAINER | LYD_NODE_ANY));
Michal Vaskoa3881362020-01-21 15:57:35 +0100676
Michal Vaskob1b5c262020-03-05 14:29:47 +0100677 if (!lyd_find_sibling_val(first, snode, NULL, 0, NULL)) {
Michal Vasko9b368d32020-02-14 13:53:31 +0100678 /* data instance found */
679 return LY_SUCCESS;
Michal Vaskoa3881362020-01-21 15:57:35 +0100680 }
681 }
682
Michal Vaskobd4db892020-11-23 16:58:20 +0100683 disabled = NULL;
684 if (lysc_has_when(snode)) {
685 /* if there are any when conditions, they must be true for a validation error */
686 LY_CHECK_RET(lyd_validate_dummy_when(first, parent, snode, &disabled));
687 }
688
689 if (!disabled) {
690 /* node instance not found */
691 LOGVAL(snode->module->ctx, LY_VLOG_LYSC, snode, LY_VCODE_NOMAND, snode->name);
692 return LY_EVALID;
693 }
694
695 return LY_SUCCESS;
Michal Vaskoa3881362020-01-21 15:57:35 +0100696}
697
Michal Vaskobb844672020-07-03 11:06:12 +0200698/**
699 * @brief Validate min/max-elements constraints, if any.
700 *
701 * @param[in] first First sibling to search in.
Michal Vaskobd4db892020-11-23 16:58:20 +0100702 * @param[in] parent Data parent.
Michal Vaskobb844672020-07-03 11:06:12 +0200703 * @param[in] snode Schema node to validate.
704 * @param[in] min Minimum number of elements, 0 for no restriction.
705 * @param[in] max Max number of elements, 0 for no restriction.
706 * @return LY_ERR value.
707 */
Michal Vaskoa3881362020-01-21 15:57:35 +0100708static LY_ERR
Michal Vaskobd4db892020-11-23 16:58:20 +0100709lyd_validate_minmax(const struct lyd_node *first, const struct lyd_node *parent, const struct lysc_node *snode,
710 uint32_t min, uint32_t max)
Michal Vaskoa3881362020-01-21 15:57:35 +0100711{
Michal Vaskoacd83e72020-02-04 14:12:01 +0100712 uint32_t count = 0;
Michal Vasko4c583e82020-07-17 12:16:14 +0200713 struct lyd_node *iter;
Michal Vaskobd4db892020-11-23 16:58:20 +0100714 const struct lysc_when *disabled;
Michal Vaskoacd83e72020-02-04 14:12:01 +0100715
Michal Vasko9b368d32020-02-14 13:53:31 +0100716 assert(min || max);
717
Michal Vasko4c583e82020-07-17 12:16:14 +0200718 LYD_LIST_FOR_INST(first, snode, iter) {
719 ++count;
Michal Vasko9b368d32020-02-14 13:53:31 +0100720
Michal Vasko4c583e82020-07-17 12:16:14 +0200721 if (min && (count == min)) {
722 /* satisfied */
723 min = 0;
724 if (!max) {
725 /* nothing more to check */
Michal Vasko9b368d32020-02-14 13:53:31 +0100726 break;
727 }
Michal Vaskoacd83e72020-02-04 14:12:01 +0100728 }
Michal Vasko4c583e82020-07-17 12:16:14 +0200729 if (max && (count > max)) {
730 /* not satisifed */
731 break;
732 }
Michal Vaskoacd83e72020-02-04 14:12:01 +0100733 }
734
Michal Vasko9b368d32020-02-14 13:53:31 +0100735 if (min) {
736 assert(count < min);
Michal Vaskobd4db892020-11-23 16:58:20 +0100737
738 disabled = NULL;
739 if (lysc_has_when(snode)) {
740 /* if there are any when conditions, they must be true for a validation error */
741 LY_CHECK_RET(lyd_validate_dummy_when(first, parent, snode, &disabled));
742 }
743
744 if (!disabled) {
745 LOGVAL(snode->module->ctx, LY_VLOG_LYSC, snode, LY_VCODE_NOMIN, snode->name);
746 return LY_EVALID;
747 }
Michal Vaskoacd83e72020-02-04 14:12:01 +0100748 } else if (max && (count > max)) {
749 LOGVAL(snode->module->ctx, LY_VLOG_LYSC, snode, LY_VCODE_NOMAX, snode->name);
750 return LY_EVALID;
751 }
752
Michal Vaskoa3881362020-01-21 15:57:35 +0100753 return LY_SUCCESS;
754}
755
Michal Vaskobb844672020-07-03 11:06:12 +0200756/**
757 * @brief Find node referenced by a list unique statement.
758 *
759 * @param[in] uniq_leaf Unique leaf to find.
760 * @param[in] list List instance to use for the search.
761 * @return Found leaf,
762 * @return NULL if no leaf found.
763 */
Michal Vasko14654712020-02-06 08:35:21 +0100764static struct lyd_node *
Michal Vaskobb844672020-07-03 11:06:12 +0200765lyd_val_uniq_find_leaf(const struct lysc_node_leaf *uniq_leaf, const struct lyd_node *list)
Michal Vasko14654712020-02-06 08:35:21 +0100766{
Michal Vasko9b368d32020-02-14 13:53:31 +0100767 struct lyd_node *node;
768 const struct lysc_node *iter;
769 size_t depth = 0, i;
Michal Vasko14654712020-02-06 08:35:21 +0100770
Michal Vasko9b368d32020-02-14 13:53:31 +0100771 /* get leaf depth */
Michal Vasko62ed12d2020-05-21 10:08:25 +0200772 for (iter = (struct lysc_node *)uniq_leaf; iter && (iter != list->schema); iter = lysc_data_parent(iter)) {
773 ++depth;
Michal Vasko14654712020-02-06 08:35:21 +0100774 }
Michal Vasko9b368d32020-02-14 13:53:31 +0100775
Michal Vaskobb844672020-07-03 11:06:12 +0200776 node = (struct lyd_node *)list;
Michal Vasko9b368d32020-02-14 13:53:31 +0100777 while (node && depth) {
778 /* find schema node with this depth */
Michal Vasko62ed12d2020-05-21 10:08:25 +0200779 for (i = depth - 1, iter = (struct lysc_node *)uniq_leaf; i; iter = lysc_data_parent(iter)) {
780 --i;
Michal Vasko9b368d32020-02-14 13:53:31 +0100781 }
782
783 /* find iter instance in children */
784 assert(iter->nodetype & (LYS_CONTAINER | LYS_LEAF));
Radek Krejcia1c1e542020-09-29 16:06:52 +0200785 lyd_find_sibling_val(lyd_child(node), iter, NULL, 0, &node);
Michal Vasko9b368d32020-02-14 13:53:31 +0100786 --depth;
787 }
788
Michal Vasko14654712020-02-06 08:35:21 +0100789 return node;
790}
791
Michal Vaskobb844672020-07-03 11:06:12 +0200792/**
793 * @brief Callback for comparing 2 list unique leaf values.
794 *
Radek Krejci857189e2020-09-01 13:26:36 +0200795 * Implementation of ::values_equal_cb.
796 *
Michal Vaskobb844672020-07-03 11:06:12 +0200797 * @param[in] cb_data 0 to compare all uniques, n to compare only n-th unique.
Michal Vasko14654712020-02-06 08:35:21 +0100798 */
Radek Krejci857189e2020-09-01 13:26:36 +0200799static ly_bool
800lyd_val_uniq_list_equal(void *val1_p, void *val2_p, ly_bool UNUSED(mod), void *cb_data)
Michal Vasko14654712020-02-06 08:35:21 +0100801{
802 struct ly_ctx *ctx;
803 struct lysc_node_list *slist;
804 struct lyd_node *diter, *first, *second;
805 struct lyd_value *val1, *val2;
806 char *path1, *path2, *uniq_str, *ptr;
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200807 LY_ARRAY_COUNT_TYPE u, v, action;
Michal Vasko14654712020-02-06 08:35:21 +0100808
809 assert(val1_p && val2_p);
810
811 first = *((struct lyd_node **)val1_p);
812 second = *((struct lyd_node **)val2_p);
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200813 action = (LY_ARRAY_COUNT_TYPE)cb_data;
Michal Vasko14654712020-02-06 08:35:21 +0100814
815 assert(first && (first->schema->nodetype == LYS_LIST));
816 assert(second && (second->schema == first->schema));
817
818 ctx = first->schema->module->ctx;
819
820 slist = (struct lysc_node_list *)first->schema;
821
822 /* compare unique leaves */
823 if (action > 0) {
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200824 u = action - 1;
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200825 if (u < LY_ARRAY_COUNT(slist->uniques)) {
Michal Vasko14654712020-02-06 08:35:21 +0100826 goto uniquecheck;
827 }
828 }
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200829 LY_ARRAY_FOR(slist->uniques, u) {
Michal Vasko14654712020-02-06 08:35:21 +0100830uniquecheck:
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200831 LY_ARRAY_FOR(slist->uniques[u], v) {
Michal Vasko14654712020-02-06 08:35:21 +0100832 /* first */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200833 diter = lyd_val_uniq_find_leaf(slist->uniques[u][v], first);
Michal Vasko14654712020-02-06 08:35:21 +0100834 if (diter) {
835 val1 = &((struct lyd_node_term *)diter)->value;
836 } else {
837 /* use default value */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200838 val1 = slist->uniques[u][v]->dflt;
Michal Vasko14654712020-02-06 08:35:21 +0100839 }
840
841 /* second */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200842 diter = lyd_val_uniq_find_leaf(slist->uniques[u][v], second);
Michal Vasko14654712020-02-06 08:35:21 +0100843 if (diter) {
844 val2 = &((struct lyd_node_term *)diter)->value;
845 } else {
846 /* use default value */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200847 val2 = slist->uniques[u][v]->dflt;
Michal Vasko14654712020-02-06 08:35:21 +0100848 }
849
850 if (!val1 || !val2 || val1->realtype->plugin->compare(val1, val2)) {
851 /* values differ or either one is not set */
852 break;
853 }
854 }
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200855 if (v && (v == LY_ARRAY_COUNT(slist->uniques[u]))) {
Michal Vasko14654712020-02-06 08:35:21 +0100856 /* all unique leafs are the same in this set, create this nice error */
Radek Krejci635d2b82021-01-04 11:26:51 +0100857 path1 = lyd_path(first, LYD_PATH_STD, NULL, 0);
858 path2 = lyd_path(second, LYD_PATH_STD, NULL, 0);
Michal Vasko14654712020-02-06 08:35:21 +0100859
860 /* use buffer to rebuild the unique string */
Radek Krejcif13b87b2020-12-01 22:02:17 +0100861#define UNIQ_BUF_SIZE 1024
862 uniq_str = malloc(UNIQ_BUF_SIZE);
Michal Vasko14654712020-02-06 08:35:21 +0100863 uniq_str[0] = '\0';
864 ptr = uniq_str;
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200865 LY_ARRAY_FOR(slist->uniques[u], v) {
866 if (v) {
Michal Vasko14654712020-02-06 08:35:21 +0100867 strcpy(ptr, " ");
868 ++ptr;
869 }
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200870 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 +0100871 ptr, UNIQ_BUF_SIZE - (ptr - uniq_str));
Michal Vasko14654712020-02-06 08:35:21 +0100872 if (!ptr) {
873 /* path will be incomplete, whatever */
874 break;
875 }
876
877 ptr += strlen(ptr);
878 }
879 LOGVAL(ctx, LY_VLOG_LYD, second, LY_VCODE_NOUNIQ, uniq_str, path1, path2);
880
881 free(path1);
882 free(path2);
883 free(uniq_str);
Radek Krejcif13b87b2020-12-01 22:02:17 +0100884#undef UNIQ_BUF_SIZE
885
Michal Vasko14654712020-02-06 08:35:21 +0100886 return 1;
887 }
888
889 if (action > 0) {
890 /* done */
891 return 0;
892 }
893 }
894
895 return 0;
896}
897
Michal Vaskobb844672020-07-03 11:06:12 +0200898/**
899 * @brief Validate list unique leaves.
900 *
901 * @param[in] first First sibling to search in.
902 * @param[in] snode Schema node to validate.
903 * @param[in] uniques List unique arrays to validate.
904 * @return LY_ERR value.
905 */
Michal Vaskoa3881362020-01-21 15:57:35 +0100906static LY_ERR
Michal Vaskobb844672020-07-03 11:06:12 +0200907lyd_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 +0100908{
Michal Vaskob1b5c262020-03-05 14:29:47 +0100909 const struct lyd_node *diter;
Michal Vasko14654712020-02-06 08:35:21 +0100910 struct ly_set *set;
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200911 LY_ARRAY_COUNT_TYPE u, v, x = 0;
Michal Vasko14654712020-02-06 08:35:21 +0100912 LY_ERR ret = LY_SUCCESS;
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200913 uint32_t hash, i, size = 0;
Radek Krejci857189e2020-09-01 13:26:36 +0200914 ly_bool dynamic;
Michal Vasko14654712020-02-06 08:35:21 +0100915 const char *str;
916 struct hash_table **uniqtables = NULL;
917 struct lyd_value *val;
918 struct ly_ctx *ctx = snode->module->ctx;
919
920 assert(uniques);
921
922 /* get all list instances */
Radek Krejciba03a5a2020-08-27 14:40:41 +0200923 LY_CHECK_RET(ly_set_new(&set));
Michal Vaskob1b5c262020-03-05 14:29:47 +0100924 LY_LIST_FOR(first, diter) {
Michal Vasko9b368d32020-02-14 13:53:31 +0100925 if (diter->schema == snode) {
Radek Krejci3d92e442020-10-12 12:48:13 +0200926 ret = ly_set_add(set, (void *)diter, 1, NULL);
Michal Vaskob0099a92020-08-31 14:55:23 +0200927 LY_CHECK_GOTO(ret, cleanup);
Michal Vasko9b368d32020-02-14 13:53:31 +0100928 }
929 }
Michal Vasko14654712020-02-06 08:35:21 +0100930
931 if (set->count == 2) {
932 /* simple comparison */
933 if (lyd_val_uniq_list_equal(&set->objs[0], &set->objs[1], 0, (void *)0)) {
934 /* instance duplication */
935 ret = LY_EVALID;
936 goto cleanup;
937 }
938 } else if (set->count > 2) {
939 /* use hashes for comparison */
Radek Krejcif13b87b2020-12-01 22:02:17 +0100940 /* first, allocate the table, the size depends on number of items in the set,
941 * the following code detects number of upper zero bits in the items' counter value ... */
942 for (i = (sizeof set->count * CHAR_BIT) - 1; i > 0; i--) {
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200943 size = set->count << i;
944 size = size >> i;
945 if (size == set->count) {
Michal Vasko14654712020-02-06 08:35:21 +0100946 break;
947 }
948 }
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200949 LY_CHECK_ERR_GOTO(!i, LOGINT(ctx); ret = LY_EINT, cleanup);
Radek Krejcif13b87b2020-12-01 22:02:17 +0100950 /* ... and then we convert it to the position of the highest non-zero bit ... */
951 i = (sizeof set->count * CHAR_BIT) - i;
952 /* ... 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 +0200953 size = 1 << i;
Michal Vasko14654712020-02-06 08:35:21 +0100954
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200955 uniqtables = malloc(LY_ARRAY_COUNT(uniques) * sizeof *uniqtables);
Michal Vasko14654712020-02-06 08:35:21 +0100956 LY_CHECK_ERR_GOTO(!uniqtables, LOGMEM(ctx); ret = LY_EMEM, cleanup);
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200957 x = LY_ARRAY_COUNT(uniques);
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200958 for (v = 0; v < x; v++) {
959 uniqtables[v] = lyht_new(size, sizeof(struct lyd_node *), lyd_val_uniq_list_equal, (void *)(v + 1L), 0);
960 LY_CHECK_ERR_GOTO(!uniqtables[v], LOGMEM(ctx); ret = LY_EMEM, cleanup);
Michal Vasko14654712020-02-06 08:35:21 +0100961 }
962
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200963 for (i = 0; i < set->count; i++) {
Michal Vasko14654712020-02-06 08:35:21 +0100964 /* loop for unique - get the hash for the instances */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200965 for (u = 0; u < x; u++) {
Michal Vasko14654712020-02-06 08:35:21 +0100966 val = NULL;
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200967 for (v = hash = 0; v < LY_ARRAY_COUNT(uniques[u]); v++) {
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200968 diter = lyd_val_uniq_find_leaf(uniques[u][v], set->objs[i]);
Michal Vasko14654712020-02-06 08:35:21 +0100969 if (diter) {
970 val = &((struct lyd_node_term *)diter)->value;
971 } else {
972 /* use default value */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200973 val = uniques[u][v]->dflt;
Michal Vasko14654712020-02-06 08:35:21 +0100974 }
975 if (!val) {
976 /* unique item not present nor has default value */
977 break;
978 }
979
980 /* get canonical string value */
Michal Vaskoc8a230d2020-08-14 12:17:10 +0200981 str = val->realtype->plugin->print(val, LY_PREF_JSON, NULL, &dynamic);
Michal Vasko14654712020-02-06 08:35:21 +0100982 hash = dict_hash_multi(hash, str, strlen(str));
983 if (dynamic) {
984 free((char *)str);
985 }
986 }
987 if (!val) {
988 /* skip this list instance since its unique set is incomplete */
989 continue;
990 }
991
992 /* finish the hash value */
993 hash = dict_hash_multi(hash, NULL, 0);
994
995 /* insert into the hashtable */
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200996 ret = lyht_insert(uniqtables[u], &set->objs[i], hash, NULL);
Michal Vasko14654712020-02-06 08:35:21 +0100997 if (ret == LY_EEXIST) {
998 /* instance duplication */
999 ret = LY_EVALID;
1000 }
1001 LY_CHECK_GOTO(ret != LY_SUCCESS, cleanup);
1002 }
1003 }
1004 }
1005
1006cleanup:
1007 ly_set_free(set, NULL);
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001008 for (v = 0; v < x; v++) {
1009 if (!uniqtables[v]) {
Michal Vasko14654712020-02-06 08:35:21 +01001010 /* failed when allocating uniquetables[j], following j are not allocated */
1011 break;
1012 }
Radek Krejci7eb54ba2020-05-18 16:30:04 +02001013 lyht_free(uniqtables[v]);
Michal Vasko14654712020-02-06 08:35:21 +01001014 }
1015 free(uniqtables);
1016
1017 return ret;
Michal Vaskoa3881362020-01-21 15:57:35 +01001018}
1019
Michal Vaskobb844672020-07-03 11:06:12 +02001020/**
1021 * @brief Validate data siblings based on generic schema node restrictions, recursively for schema-only nodes.
1022 *
1023 * @param[in] first First sibling to search in.
Michal Vaskobd4db892020-11-23 16:58:20 +01001024 * @param[in] parent Data parent.
Michal Vaskobb844672020-07-03 11:06:12 +02001025 * @param[in] sparent Schema parent of the nodes to check.
1026 * @param[in] mod Module of the nodes to check.
1027 * @param[in] val_opts Validation options, see @ref datavalidationoptions.
1028 * @param[in] op Operation being validated, if any.
1029 * @return LY_ERR value.
1030 */
Michal Vaskoa3881362020-01-21 15:57:35 +01001031static LY_ERR
Michal Vaskobd4db892020-11-23 16:58:20 +01001032lyd_validate_siblings_schema_r(const struct lyd_node *first, const struct lyd_node *parent,
1033 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 +01001034{
Michal Vaskocde73ac2019-11-14 16:10:27 +01001035 const struct lysc_node *snode = NULL;
Michal Vaskoa3881362020-01-21 15:57:35 +01001036 struct lysc_node_list *slist;
Michal Vaskod8958df2020-08-05 13:27:36 +02001037 struct lysc_node_leaflist *sllist;
Radek Krejci1deb5be2020-08-26 16:43:36 +02001038 uint32_t getnext_opts;
Michal Vaskocb7526d2020-03-30 15:08:26 +02001039
Radek Krejci7931b192020-06-25 17:05:03 +02001040 getnext_opts = LYS_GETNEXT_WITHCHOICE | LYS_GETNEXT_WITHCASE | (op == LYD_VALIDATE_OP_REPLY ? LYS_GETNEXT_OUTPUT : 0);
Michal Vaskocde73ac2019-11-14 16:10:27 +01001041
Michal Vaskoa3881362020-01-21 15:57:35 +01001042 /* disabled nodes are skipped by lys_getnext */
Michal Vaskocb7526d2020-03-30 15:08:26 +02001043 while ((snode = lys_getnext(snode, sparent, mod, getnext_opts))) {
Radek Krejci7931b192020-06-25 17:05:03 +02001044 if ((val_opts & LYD_VALIDATE_NO_STATE) && (snode->flags & LYS_CONFIG_R)) {
Michal Vaskoe75ecfd2020-03-06 14:12:28 +01001045 continue;
1046 }
1047
Michal Vaskoa3881362020-01-21 15:57:35 +01001048 /* check min-elements and max-elements */
Michal Vaskod8958df2020-08-05 13:27:36 +02001049 if (snode->nodetype == LYS_LIST) {
Michal Vaskoa3881362020-01-21 15:57:35 +01001050 slist = (struct lysc_node_list *)snode;
1051 if (slist->min || slist->max) {
Michal Vaskobd4db892020-11-23 16:58:20 +01001052 LY_CHECK_RET(lyd_validate_minmax(first, parent, snode, slist->min, slist->max));
Michal Vaskoa3881362020-01-21 15:57:35 +01001053 }
Michal Vaskod8958df2020-08-05 13:27:36 +02001054 } else if (snode->nodetype == LYS_LEAFLIST) {
1055 sllist = (struct lysc_node_leaflist *)snode;
1056 if (sllist->min || sllist->max) {
Michal Vaskobd4db892020-11-23 16:58:20 +01001057 LY_CHECK_RET(lyd_validate_minmax(first, parent, snode, sllist->min, sllist->max));
Michal Vaskod8958df2020-08-05 13:27:36 +02001058 }
Michal Vaskoacd83e72020-02-04 14:12:01 +01001059
Michal Vaskoacd83e72020-02-04 14:12:01 +01001060 } else if (snode->flags & LYS_MAND_TRUE) {
Radek Krejcif6a11002020-08-21 13:29:07 +02001061 /* check generic mandatory existence */
Michal Vaskobd4db892020-11-23 16:58:20 +01001062 LY_CHECK_RET(lyd_validate_mandatory(first, parent, snode));
Michal Vaskoa3881362020-01-21 15:57:35 +01001063 }
1064
1065 /* check unique */
1066 if (snode->nodetype == LYS_LIST) {
1067 slist = (struct lysc_node_list *)snode;
1068 if (slist->uniques) {
Michal Vaskobb844672020-07-03 11:06:12 +02001069 LY_CHECK_RET(lyd_validate_unique(first, snode, (const struct lysc_node_leaf ***)slist->uniques));
Michal Vaskoa3881362020-01-21 15:57:35 +01001070 }
1071 }
1072
Michal Vaskoacd83e72020-02-04 14:12:01 +01001073 if (snode->nodetype & (LYS_CHOICE | LYS_CASE)) {
1074 /* go recursively for schema-only nodes */
Michal Vaskobd4db892020-11-23 16:58:20 +01001075 LY_CHECK_RET(lyd_validate_siblings_schema_r(first, parent, snode, mod, val_opts, op));
Michal Vaskoacd83e72020-02-04 14:12:01 +01001076 }
Michal Vaskocde73ac2019-11-14 16:10:27 +01001077 }
1078
Michal Vaskoacd83e72020-02-04 14:12:01 +01001079 return LY_SUCCESS;
1080}
1081
Michal Vaskobb844672020-07-03 11:06:12 +02001082/**
1083 * @brief Validate obsolete nodes, only warnings are printed.
1084 *
1085 * @param[in] node Node to check.
1086 */
Michal Vaskoe75ecfd2020-03-06 14:12:28 +01001087static void
1088lyd_validate_obsolete(const struct lyd_node *node)
1089{
1090 const struct lysc_node *snode;
1091
1092 snode = node->schema;
1093 do {
1094 if (snode->flags & LYS_STATUS_OBSLT) {
1095 LOGWRN(snode->module->ctx, "Obsolete schema node \"%s\" instantiated in data.", snode->name);
1096 break;
1097 }
1098
1099 snode = snode->parent;
1100 } while (snode && (snode->nodetype & (LYS_CHOICE | LYS_CASE)));
1101}
1102
Michal Vaskobb844672020-07-03 11:06:12 +02001103/**
1104 * @brief Validate must conditions of a data node.
1105 *
1106 * @param[in] node Node to validate.
1107 * @param[in] op Operation being validated, if any.
1108 * @return LY_ERR value.
1109 */
Michal Vaskocc048b22020-03-27 15:52:38 +01001110static LY_ERR
Radek Krejci7931b192020-06-25 17:05:03 +02001111lyd_validate_must(const struct lyd_node *node, LYD_VALIDATE_OP op)
Michal Vaskocc048b22020-03-27 15:52:38 +01001112{
1113 struct lyxp_set xp_set;
1114 struct lysc_must *musts;
1115 const struct lyd_node *tree;
Michal Vaskofd69e1d2020-07-03 11:57:17 +02001116 LY_ARRAY_COUNT_TYPE u;
Michal Vaskocc048b22020-03-27 15:52:38 +01001117
1118 switch (node->schema->nodetype) {
1119 case LYS_CONTAINER:
1120 musts = ((struct lysc_node_container *)node->schema)->musts;
1121 break;
1122 case LYS_LEAF:
1123 musts = ((struct lysc_node_leaf *)node->schema)->musts;
1124 break;
1125 case LYS_LEAFLIST:
1126 musts = ((struct lysc_node_leaflist *)node->schema)->musts;
1127 break;
1128 case LYS_LIST:
1129 musts = ((struct lysc_node_list *)node->schema)->musts;
1130 break;
1131 case LYS_ANYXML:
1132 case LYS_ANYDATA:
1133 musts = ((struct lysc_node_anydata *)node->schema)->musts;
1134 break;
1135 case LYS_NOTIF:
1136 musts = ((struct lysc_notif *)node->schema)->musts;
1137 break;
1138 case LYS_RPC:
1139 case LYS_ACTION:
Radek Krejci7931b192020-06-25 17:05:03 +02001140 if (op == LYD_VALIDATE_OP_RPC) {
Michal Vaskocb7526d2020-03-30 15:08:26 +02001141 musts = ((struct lysc_action *)node->schema)->input.musts;
Radek Krejci7931b192020-06-25 17:05:03 +02001142 } else if (op == LYD_VALIDATE_OP_REPLY) {
Michal Vaskocb7526d2020-03-30 15:08:26 +02001143 musts = ((struct lysc_action *)node->schema)->output.musts;
1144 } else {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001145 LOGINT(LYD_CTX(node));
Michal Vaskocb7526d2020-03-30 15:08:26 +02001146 return LY_EINT;
1147 }
Michal Vaskocc048b22020-03-27 15:52:38 +01001148 break;
1149 default:
Michal Vaskob7be7a82020-08-20 09:09:04 +02001150 LOGINT(LYD_CTX(node));
Michal Vaskocc048b22020-03-27 15:52:38 +01001151 return LY_EINT;
1152 }
1153
1154 if (!musts) {
1155 /* no must to evaluate */
1156 return LY_SUCCESS;
1157 }
1158
1159 /* find first top-level node */
Radek Krejci1e008d22020-08-17 11:37:37 +02001160 for (tree = node; tree->parent; tree = (struct lyd_node *)tree->parent) {}
Michal Vaskocc048b22020-03-27 15:52:38 +01001161 while (tree->prev->next) {
1162 tree = tree->prev;
1163 }
1164
1165 LY_ARRAY_FOR(musts, u) {
1166 memset(&xp_set, 0, sizeof xp_set);
1167
1168 /* evaluate must */
Michal Vasko5d24f6c2020-10-13 13:49:06 +02001169 LY_CHECK_RET(lyxp_eval(musts[u].cond, node->schema->module, LY_PREF_SCHEMA_RESOLVED, musts[u].prefixes, node,
1170 tree, &xp_set, LYXP_SCHEMA));
Michal Vaskocc048b22020-03-27 15:52:38 +01001171
1172 /* check the result */
1173 lyxp_set_cast(&xp_set, LYXP_SET_BOOLEAN);
Michal Vasko004d3152020-06-11 19:59:22 +02001174 if (!xp_set.val.bln) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001175 LOGVAL(LYD_CTX(node), LY_VLOG_LYD, node, LY_VCODE_NOMUST, musts[u].cond->expr);
Michal Vaskocc048b22020-03-27 15:52:38 +01001176 return LY_EVALID;
1177 }
1178 }
1179
1180 return LY_SUCCESS;
1181}
1182
Michal Vaskob1b5c262020-03-05 14:29:47 +01001183LY_ERR
Michal Vaskobd4db892020-11-23 16:58:20 +01001184lyd_validate_final_r(struct lyd_node *first, const struct lyd_node *parent, const struct lysc_node *sparent,
1185 const struct lys_module *mod, uint32_t val_opts, LYD_VALIDATE_OP op)
Michal Vaskoacd83e72020-02-04 14:12:01 +01001186{
Radek Krejci7f769d72020-07-11 23:13:56 +02001187 struct lyd_node *next = NULL, *node;
Michal Vaskoacd83e72020-02-04 14:12:01 +01001188
Michal Vasko14654712020-02-06 08:35:21 +01001189 /* validate all restrictions of nodes themselves */
Michal Vaskob1b5c262020-03-05 14:29:47 +01001190 LY_LIST_FOR_SAFE(first, next, node) {
Michal Vaskoc193ce92020-03-06 11:04:48 +01001191 if (mod && (lyd_owner_module(node) != mod)) {
Michal Vaskob1b5c262020-03-05 14:29:47 +01001192 /* all top-level data from this module checked */
1193 break;
Michal Vaskof03ed032020-03-04 13:31:44 +01001194 }
1195
Michal Vaskoa8c61722020-03-27 16:59:32 +01001196 /* opaque data */
1197 if (!node->schema) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001198 LOGVAL(LYD_CTX(node), LY_VLOG_LYD, node, LYVE_DATA, "Opaque node \"%s\" found.",
Michal Vasko6a66ffb2020-11-23 16:59:22 +01001199 ((struct lyd_node_opaq *)node)->name.name);
Michal Vaskoa8c61722020-03-27 16:59:32 +01001200 return LY_EVALID;
1201 }
1202
Michal Vaskocb7526d2020-03-30 15:08:26 +02001203 /* no state/input/output data */
Radek Krejci7931b192020-06-25 17:05:03 +02001204 if ((val_opts & LYD_VALIDATE_NO_STATE) && (node->schema->flags & LYS_CONFIG_R)) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001205 LOGVAL(LYD_CTX(node), LY_VLOG_LYD, node, LY_VCODE_INNODE, "state", node->schema->name);
Michal Vaskocb7526d2020-03-30 15:08:26 +02001206 return LY_EVALID;
Radek Krejci7931b192020-06-25 17:05:03 +02001207 } else if ((op == LYD_VALIDATE_OP_RPC) && (node->schema->flags & LYS_CONFIG_R)) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001208 LOGVAL(LYD_CTX(node), LY_VLOG_LYD, node, LY_VCODE_INNODE, "output", node->schema->name);
Michal Vaskocb7526d2020-03-30 15:08:26 +02001209 return LY_EVALID;
Radek Krejci7931b192020-06-25 17:05:03 +02001210 } else if ((op == LYD_VALIDATE_OP_REPLY) && (node->schema->flags & LYS_CONFIG_W)) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001211 LOGVAL(LYD_CTX(node), LY_VLOG_LYD, node, LY_VCODE_INNODE, "input", node->schema->name);
Michal Vasko5b37a352020-03-06 13:38:33 +01001212 return LY_EVALID;
1213 }
1214
Michal Vaskoe75ecfd2020-03-06 14:12:28 +01001215 /* obsolete data */
1216 lyd_validate_obsolete(node);
1217
Michal Vaskocc048b22020-03-27 15:52:38 +01001218 /* node's musts */
Radek Krejci7931b192020-06-25 17:05:03 +02001219 LY_CHECK_RET(lyd_validate_must(node, op));
Michal Vaskocc048b22020-03-27 15:52:38 +01001220
Michal Vasko53d97a12020-11-05 17:39:10 +01001221 /* node value was checked by plugins */
Michal Vasko14654712020-02-06 08:35:21 +01001222 }
Michal Vaskocde73ac2019-11-14 16:10:27 +01001223
Michal Vasko14654712020-02-06 08:35:21 +01001224 /* validate schema-based restrictions */
Michal Vaskobd4db892020-11-23 16:58:20 +01001225 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 +01001226
Michal Vaskob1b5c262020-03-05 14:29:47 +01001227 LY_LIST_FOR(first, node) {
Michal Vasko14654712020-02-06 08:35:21 +01001228 /* validate all children recursively */
Michal Vaskobd4db892020-11-23 16:58:20 +01001229 LY_CHECK_RET(lyd_validate_final_r(lyd_child(node), node, node->schema, NULL, val_opts, op));
Michal Vaskocde73ac2019-11-14 16:10:27 +01001230
Michal Vaskob1b5c262020-03-05 14:29:47 +01001231 /* set default for containers */
1232 if ((node->schema->nodetype == LYS_CONTAINER) && !(node->schema->flags & LYS_PRESENCE)) {
Radek Krejcia1c1e542020-09-29 16:06:52 +02001233 LY_LIST_FOR(lyd_child(node), next) {
Michal Vaskob1b5c262020-03-05 14:29:47 +01001234 if (!(next->flags & LYD_DEFAULT)) {
1235 break;
1236 }
Michal Vaskoa3881362020-01-21 15:57:35 +01001237 }
Michal Vaskob1b5c262020-03-05 14:29:47 +01001238 if (!next) {
1239 node->flags |= LYD_DEFAULT;
1240 }
Michal Vasko9b368d32020-02-14 13:53:31 +01001241 }
1242 }
1243
1244 return LY_SUCCESS;
1245}
1246
Radek Krejci7931b192020-06-25 17:05:03 +02001247/**
Michal Vaskobb844672020-07-03 11:06:12 +02001248 * @brief Validate the whole data subtree.
1249 *
1250 * @param[in] root Subtree root.
Michal Vasko32711382020-12-03 14:14:31 +01001251 * @param[in,out] node_types Set for unres node types.
1252 * @param[in,out] meta_types Set for unres metadata types.
1253 * @param[in,out] node_when Set for nodes with when conditions.
Michal Vasko29adfbe2020-12-08 17:12:03 +01001254 * @param[in] impl_opts Implicit options, see @ref implicitoptions.
Michal Vasko8104fd42020-07-13 11:09:51 +02001255 * @param[in,out] diff Validation diff.
Michal Vaskobb844672020-07-03 11:06:12 +02001256 * @return LY_ERR value.
Radek Krejci7931b192020-06-25 17:05:03 +02001257 */
Michal Vaskob1b5c262020-03-05 14:29:47 +01001258static LY_ERR
Michal Vasko32711382020-12-03 14:14:31 +01001259lyd_validate_subtree(struct lyd_node *root, struct ly_set *node_types, struct ly_set *meta_types,
Michal Vasko29adfbe2020-12-08 17:12:03 +01001260 struct ly_set *node_when, uint32_t impl_opts, struct lyd_node **diff)
Michal Vaskofea12c62020-03-30 11:00:15 +02001261{
1262 const struct lyd_meta *meta;
Michal Vasko56daf732020-08-10 10:57:18 +02001263 struct lyd_node *node;
Michal Vaskofea12c62020-03-30 11:00:15 +02001264
Michal Vasko56daf732020-08-10 10:57:18 +02001265 LYD_TREE_DFS_BEGIN(root, node) {
Michal Vasko0275cf62020-11-05 17:40:30 +01001266 LY_LIST_FOR(node->meta, meta) {
1267 if (((struct lyext_metadata *)meta->annotation->data)->type->plugin->validate) {
1268 /* metadata type resolution */
Michal Vasko32711382020-12-03 14:14:31 +01001269 LY_CHECK_RET(ly_set_add(meta_types, (void *)meta, 1, NULL));
Michal Vaskofea12c62020-03-30 11:00:15 +02001270 }
Michal Vasko0275cf62020-11-05 17:40:30 +01001271 }
Michal Vaskofea12c62020-03-30 11:00:15 +02001272
Michal Vasko0275cf62020-11-05 17:40:30 +01001273 if ((node->schema->nodetype & LYD_NODE_TERM) && ((struct lysc_node_leaf *)node->schema)->type->plugin->validate) {
1274 /* node type resolution */
Michal Vasko32711382020-12-03 14:14:31 +01001275 LY_CHECK_RET(ly_set_add(node_types, (void *)node, 1, NULL));
Michal Vasko0275cf62020-11-05 17:40:30 +01001276 } else if (node->schema->nodetype & LYD_NODE_INNER) {
1277 /* new node validation, autodelete */
1278 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 +02001279
Michal Vasko0275cf62020-11-05 17:40:30 +01001280 /* add nested defaults */
Michal Vaskobd4db892020-11-23 16:58:20 +01001281 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 +01001282 NULL, impl_opts, diff));
Michal Vasko0275cf62020-11-05 17:40:30 +01001283 }
Michal Vaskofea12c62020-03-30 11:00:15 +02001284
Michal Vasko0275cf62020-11-05 17:40:30 +01001285 if (!(node->schema->nodetype & (LYS_RPC | LYS_ACTION | LYS_NOTIF)) && node->schema->when) {
1286 /* when evaluation */
Michal Vasko32711382020-12-03 14:14:31 +01001287 LY_CHECK_RET(ly_set_add(node_when, (void *)node, 1, NULL));
Michal Vaskofea12c62020-03-30 11:00:15 +02001288 }
1289
Michal Vasko56daf732020-08-10 10:57:18 +02001290 LYD_TREE_DFS_END(root, node);
Michal Vaskofea12c62020-03-30 11:00:15 +02001291 }
1292
1293 return LY_SUCCESS;
1294}
1295
Michal Vaskobb844672020-07-03 11:06:12 +02001296/**
1297 * @brief Validate data tree.
1298 *
1299 * @param[in,out] tree Data tree to validate, nodes may be autodeleted.
1300 * @param[in] modules Array of modules to validate, NULL for all modules.
1301 * @param[in] mod_count Count of @p modules.
1302 * @param[in] ly_ctx libyang context.
1303 * @param[in] val_opts Validation options, see @ref datavalidationoptions.
Michal Vasko8104fd42020-07-13 11:09:51 +02001304 * @param[out] diff Generated validation diff, not generated if NULL.
Michal Vaskobb844672020-07-03 11:06:12 +02001305 * @return LY_ERR value.
1306 */
Michal Vaskofea12c62020-03-30 11:00:15 +02001307static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02001308lyd_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 +02001309 struct lyd_node **diff)
Michal Vaskof03ed032020-03-04 13:31:44 +01001310{
1311 LY_ERR ret = LY_SUCCESS;
Michal Vasko73e47212020-12-03 14:20:16 +01001312 struct lyd_node *first, *next, **first2, *iter;
Michal Vaskob1b5c262020-03-05 14:29:47 +01001313 const struct lys_module *mod;
Michal Vasko32711382020-12-03 14:14:31 +01001314 struct ly_set node_types = {0}, meta_types = {0}, node_when = {0};
Michal Vaskob1b5c262020-03-05 14:29:47 +01001315 uint32_t i = 0;
Michal Vaskof03ed032020-03-04 13:31:44 +01001316
Michal Vasko26e80012020-07-08 10:55:46 +02001317 LY_CHECK_ARG_RET(NULL, tree, *tree || ctx || module, LY_EINVAL);
Michal Vasko5a532f32020-12-10 12:18:47 +01001318 if (!ctx && !module) {
1319 ctx = LYD_CTX(*tree);
1320 }
Michal Vasko8104fd42020-07-13 11:09:51 +02001321 if (diff) {
1322 *diff = NULL;
1323 }
Michal Vaskof03ed032020-03-04 13:31:44 +01001324
Michal Vaskob1b5c262020-03-05 14:29:47 +01001325 next = *tree;
1326 while (1) {
Radek Krejci7931b192020-06-25 17:05:03 +02001327 if (val_opts & LYD_VALIDATE_PRESENT) {
Michal Vaskob1b5c262020-03-05 14:29:47 +01001328 mod = lyd_data_next_module(&next, &first);
1329 } else {
Michal Vasko26e80012020-07-08 10:55:46 +02001330 mod = lyd_mod_next_module(next, module, ctx, &i, &first);
Michal Vaskof03ed032020-03-04 13:31:44 +01001331 }
Michal Vaskob1b5c262020-03-05 14:29:47 +01001332 if (!mod) {
1333 break;
1334 }
Michal Vasko7c4cf1e2020-06-22 10:04:30 +02001335 if (!first || (first == *tree)) {
Michal Vaskob1b5c262020-03-05 14:29:47 +01001336 /* make sure first2 changes are carried to tree */
1337 first2 = tree;
1338 } else {
1339 first2 = &first;
1340 }
1341
1342 /* validate new top-level nodes of this module, autodelete */
Michal Vasko8104fd42020-07-13 11:09:51 +02001343 ret = lyd_validate_new(first2, NULL, mod, diff);
1344 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskob1b5c262020-03-05 14:29:47 +01001345
Michal Vasko0275cf62020-11-05 17:40:30 +01001346 /* add all top-level defaults for this module, do not add into unres sets, will occur in the next step */
1347 ret = lyd_new_implicit_r(NULL, first2, NULL, mod, NULL, NULL, val_opts & LYD_VALIDATE_NO_STATE ?
Michal Vasko69730152020-10-09 16:30:07 +02001348 LYD_IMPLICIT_NO_STATE : 0, diff);
Michal Vasko8104fd42020-07-13 11:09:51 +02001349 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskob1b5c262020-03-05 14:29:47 +01001350
Michal Vaskod3bb12f2020-12-04 14:33:09 +01001351 /* our first module node pointer may no longer be the first */
1352 while (*first2 && (*first2)->prev->next && (lyd_owner_module(*first2) == lyd_owner_module((*first2)->prev))) {
1353 *first2 = (*first2)->prev;
1354 }
1355
Michal Vaskob1b5c262020-03-05 14:29:47 +01001356 /* process nested nodes */
Michal Vasko73e47212020-12-03 14:20:16 +01001357 LY_LIST_FOR(*first2, iter) {
Michal Vasko79135ae2020-12-16 10:08:35 +01001358 ret = lyd_validate_subtree(iter, &node_types, &meta_types, &node_when, val_opts & LYD_VALIDATE_NO_STATE ?
1359 LYD_IMPLICIT_NO_STATE : 0, diff);
Michal Vasko8104fd42020-07-13 11:09:51 +02001360 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskob1b5c262020-03-05 14:29:47 +01001361 }
1362
1363 /* finish incompletely validated terminal values/attributes and when conditions */
Michal Vaskod3bb12f2020-12-04 14:33:09 +01001364 ret = lyd_validate_unres(first2, mod, &node_when, &node_types, &meta_types, diff);
Michal Vaskob1b5c262020-03-05 14:29:47 +01001365 LY_CHECK_GOTO(ret, cleanup);
1366
1367 /* perform final validation that assumes the data tree is final */
Michal Vaskobd4db892020-11-23 16:58:20 +01001368 ret = lyd_validate_final_r(*first2, NULL, NULL, mod, val_opts, 0);
Michal Vasko8104fd42020-07-13 11:09:51 +02001369 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskof03ed032020-03-04 13:31:44 +01001370 }
1371
Michal Vaskof03ed032020-03-04 13:31:44 +01001372cleanup:
Michal Vasko32711382020-12-03 14:14:31 +01001373 ly_set_erase(&node_types, NULL);
1374 ly_set_erase(&meta_types, NULL);
1375 ly_set_erase(&node_when, NULL);
Michal Vaskof03ed032020-03-04 13:31:44 +01001376 return ret;
1377}
Michal Vaskob1b5c262020-03-05 14:29:47 +01001378
1379API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02001380lyd_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 +01001381{
Michal Vasko3a41dff2020-07-15 14:30:28 +02001382 return lyd_validate(tree, NULL, ctx, val_opts, diff);
Michal Vaskob1b5c262020-03-05 14:29:47 +01001383}
1384
1385API LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02001386lyd_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 +01001387{
Michal Vasko3a41dff2020-07-15 14:30:28 +02001388 return lyd_validate(tree, module, NULL, val_opts, diff);
Michal Vaskob1b5c262020-03-05 14:29:47 +01001389}
Michal Vaskofea12c62020-03-30 11:00:15 +02001390
Michal Vaskobb844672020-07-03 11:06:12 +02001391/**
1392 * @brief Find nodes for merging an operation into data tree for validation.
1393 *
1394 * @param[in] op_tree Full operation data tree.
1395 * @param[in] op_node Operation node itself.
1396 * @param[in] tree Data tree to be merged into.
1397 * @param[out] op_subtree Operation subtree to merge.
Michal Vasko2f03d222020-12-09 18:15:51 +01001398 * @param[out] tree_sibling Data tree sibling to merge next to, is set if @p tree_parent is NULL.
1399 * @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 +02001400 */
Michal Vaskocb7526d2020-03-30 15:08:26 +02001401static void
Michal Vaskobb844672020-07-03 11:06:12 +02001402lyd_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 +01001403 struct lyd_node **op_subtree, struct lyd_node **tree_sibling, struct lyd_node **tree_parent)
Michal Vaskofea12c62020-03-30 11:00:15 +02001404{
Michal Vaskocb7526d2020-03-30 15:08:26 +02001405 const struct lyd_node *tree_iter, *op_iter;
1406 struct lyd_node *match;
Michal Vaskofea12c62020-03-30 11:00:15 +02001407 uint32_t i, cur_depth, op_depth;
Michal Vaskofea12c62020-03-30 11:00:15 +02001408
Michal Vasko2f03d222020-12-09 18:15:51 +01001409 *op_subtree = NULL;
1410 *tree_sibling = NULL;
1411 *tree_parent = NULL;
1412
Michal Vaskocb7526d2020-03-30 15:08:26 +02001413 /* learn op depth (top-level being depth 0) */
Michal Vaskofea12c62020-03-30 11:00:15 +02001414 op_depth = 0;
Michal Vaskobb844672020-07-03 11:06:12 +02001415 for (op_iter = op_node; op_iter != op_tree; op_iter = (struct lyd_node *)op_iter->parent) {
Michal Vaskofea12c62020-03-30 11:00:15 +02001416 ++op_depth;
1417 }
1418
1419 /* find where to merge op */
1420 tree_iter = tree;
1421 cur_depth = op_depth;
Michal Vasko2f03d222020-12-09 18:15:51 +01001422 while (cur_depth && tree_iter) {
Michal Vaskofea12c62020-03-30 11:00:15 +02001423 /* find op iter in tree */
1424 lyd_find_sibling_first(tree_iter, op_iter, &match);
1425 if (!match) {
1426 break;
1427 }
1428
1429 /* move tree_iter */
Radek Krejcia1c1e542020-09-29 16:06:52 +02001430 tree_iter = lyd_child(match);
Michal Vaskofea12c62020-03-30 11:00:15 +02001431
1432 /* move depth */
1433 --cur_depth;
Michal Vasko2f03d222020-12-09 18:15:51 +01001434
1435 /* find next op parent */
1436 op_iter = op_node;
1437 for (i = 0; i < cur_depth; ++i) {
1438 op_iter = (struct lyd_node *)op_iter->parent;
1439 }
Michal Vaskofea12c62020-03-30 11:00:15 +02001440 }
1441
Michal Vasko2f03d222020-12-09 18:15:51 +01001442 assert(op_iter);
Michal Vaskobb844672020-07-03 11:06:12 +02001443 *op_subtree = (struct lyd_node *)op_iter;
Michal Vasko2f03d222020-12-09 18:15:51 +01001444 if (!tree || tree_iter) {
1445 /* there is no tree whatsoever or this is the last found sibling */
1446 *tree_sibling = (struct lyd_node *)tree_iter;
1447 } else {
1448 /* matching parent was found but it has no children to insert next to */
1449 assert(match);
1450 *tree_parent = match;
1451 }
Michal Vaskocb7526d2020-03-30 15:08:26 +02001452}
1453
1454API LY_ERR
Michal Vasko8104fd42020-07-13 11:09:51 +02001455lyd_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 +02001456{
1457 LY_ERR ret;
Michal Vasko2f03d222020-12-09 18:15:51 +01001458 struct lyd_node *tree_sibling, *tree_parent, *op_subtree, *op_node, *op_parent;
Michal Vaskocb7526d2020-03-30 15:08:26 +02001459 struct ly_set type_check = {0}, type_meta_check = {0}, when_check = {0};
1460
1461 LY_CHECK_ARG_RET(NULL, op_tree, !op_tree->parent, !tree || !tree->parent,
Radek Krejci0f969882020-08-21 16:56:47 +02001462 (op == LYD_VALIDATE_OP_NOTIF) || (op == LYD_VALIDATE_OP_RPC) || (op == LYD_VALIDATE_OP_REPLY), LY_EINVAL);
Michal Vasko8104fd42020-07-13 11:09:51 +02001463 if (diff) {
1464 *diff = NULL;
1465 }
Michal Vaskocb7526d2020-03-30 15:08:26 +02001466
1467 /* find the operation/notification */
Michal Vasko56daf732020-08-10 10:57:18 +02001468 LYD_TREE_DFS_BEGIN(op_tree, op_node) {
Michal Vasko69730152020-10-09 16:30:07 +02001469 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 +02001470 break;
Radek Krejci7931b192020-06-25 17:05:03 +02001471 } else if ((op == LYD_VALIDATE_OP_NOTIF) && (op_node->schema->nodetype == LYS_NOTIF)) {
Michal Vaskocb7526d2020-03-30 15:08:26 +02001472 break;
1473 }
Michal Vasko56daf732020-08-10 10:57:18 +02001474 LYD_TREE_DFS_END(op_tree, op_node);
Michal Vaskocb7526d2020-03-30 15:08:26 +02001475 }
Michal Vasko69730152020-10-09 16:30:07 +02001476 if ((op == LYD_VALIDATE_OP_RPC) || (op == LYD_VALIDATE_OP_REPLY)) {
Radek Krejci7931b192020-06-25 17:05:03 +02001477 if (!(op_node->schema->nodetype & (LYS_RPC | LYS_ACTION))) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001478 LOGERR(LYD_CTX(op_tree), LY_EINVAL, "No RPC/action to validate found.");
Michal Vaskocb7526d2020-03-30 15:08:26 +02001479 return LY_EINVAL;
1480 }
1481 } else {
Radek Krejci7931b192020-06-25 17:05:03 +02001482 if (op_node->schema->nodetype != LYS_NOTIF) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001483 LOGERR(LYD_CTX(op_tree), LY_EINVAL, "No notification to validate found.");
Michal Vaskocb7526d2020-03-30 15:08:26 +02001484 return LY_EINVAL;
1485 }
1486 }
1487
1488 /* move op_tree to top-level node */
1489 while (op_tree->parent) {
1490 op_tree = (struct lyd_node *)op_tree->parent;
1491 }
1492
1493 /* merge op_tree into tree */
Michal Vasko2f03d222020-12-09 18:15:51 +01001494 lyd_val_op_merge_find(op_tree, op_node, tree, &op_subtree, &tree_sibling, &tree_parent);
1495 op_parent = lyd_parent(op_subtree);
Radek Krejci7931b192020-06-25 17:05:03 +02001496 lyd_unlink_tree(op_subtree);
Michal Vasko2f03d222020-12-09 18:15:51 +01001497 lyd_insert_node(tree_parent, &tree_sibling, op_subtree);
Michal Vaskofea12c62020-03-30 11:00:15 +02001498 if (!tree) {
Michal Vaskocb7526d2020-03-30 15:08:26 +02001499 tree = tree_sibling;
Michal Vaskofea12c62020-03-30 11:00:15 +02001500 }
1501
1502 /* prevalidate whole operation subtree */
Michal Vasko29adfbe2020-12-08 17:12:03 +01001503 LY_CHECK_GOTO(ret = lyd_validate_subtree(op_node, &type_check, &type_meta_check, &when_check,
1504 op == LYD_VALIDATE_OP_REPLY ? LYD_IMPLICIT_OUTPUT : 0, diff), cleanup);
Michal Vaskofea12c62020-03-30 11:00:15 +02001505
1506 /* finish incompletely validated terminal values/attributes and when conditions on the full tree */
Michal Vaskod3bb12f2020-12-04 14:33:09 +01001507 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 +02001508 diff), cleanup);
Michal Vaskofea12c62020-03-30 11:00:15 +02001509
1510 /* perform final validation of the operation/notification */
Radek Krejci7931b192020-06-25 17:05:03 +02001511 lyd_validate_obsolete(op_node);
Radek Krejci7931b192020-06-25 17:05:03 +02001512 LY_CHECK_GOTO(ret = lyd_validate_must(op_node, op), cleanup);
Michal Vaskofea12c62020-03-30 11:00:15 +02001513
1514 /* final validation of all the descendants */
Michal Vaskobd4db892020-11-23 16:58:20 +01001515 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 +02001516
1517cleanup:
1518 /* restore operation tree */
Radek Krejci7931b192020-06-25 17:05:03 +02001519 lyd_unlink_tree(op_subtree);
Michal Vaskocb7526d2020-03-30 15:08:26 +02001520 if (op_parent) {
Radek Krejci7931b192020-06-25 17:05:03 +02001521 lyd_insert_node(op_parent, NULL, op_subtree);
Michal Vaskofea12c62020-03-30 11:00:15 +02001522 }
1523
1524 ly_set_erase(&type_check, NULL);
1525 ly_set_erase(&type_meta_check, NULL);
1526 ly_set_erase(&when_check, NULL);
1527 return ret;
1528}