blob: 56cd450181202edf77581857dd4479a1869c558c [file] [log] [blame]
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001/**
2 * @file tree_schema.h
3 * @author Radek Krejci <rkrejci@cesnet.cz>
4 * @brief libyang representation of YANG schema trees.
5 *
6 * Copyright (c) 2015 - 2018 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 */
14
15#ifndef LY_TREE_SCHEMA_H_
16#define LY_TREE_SCHEMA_H_
17
Radek Krejci54579462019-04-30 12:47:06 +020018#define PCRE2_CODE_UNIT_WIDTH 8
19
20#include <pcre2.h>
Radek Krejci535ea9f2020-05-29 16:01:05 +020021
Radek Krejci5aeea3a2018-09-05 13:29:36 +020022#include <stdint.h>
Radek Krejcid3ca0632019-04-16 16:54:54 +020023#include <stdio.h>
Radek Krejci5aeea3a2018-09-05 13:29:36 +020024
Radek Krejcie7b95092019-05-15 11:03:07 +020025#include "log.h"
26#include "tree.h"
Radek Krejci535ea9f2020-05-29 16:01:05 +020027#include "tree_data.h"
Radek Krejcice8c1592018-10-29 15:35:51 +010028
Radek Krejci70853c52018-10-15 14:46:16 +020029#ifdef __cplusplus
30extern "C" {
31#endif
32
Radek Krejcica376bd2020-06-11 16:04:06 +020033struct ly_ctx;
34struct ly_set;
35
Radek Krejci5aeea3a2018-09-05 13:29:36 +020036/**
Radek Krejci2ff0d572020-05-21 15:27:28 +020037 * @defgroup schematree Schema Tree
38 * @ingroup trees
39 * @{
40 *
41 * Data structures and functions to manipulate and access schema tree.
42 */
43
Michal Vasko64246d82020-08-19 12:35:00 +020044/* *INDENT-OFF* */
45
Radek Krejci2ff0d572020-05-21 15:27:28 +020046/**
Radek Krejci0935f412019-08-20 16:15:18 +020047 * @brief Macro to iterate via all elements in a schema tree which can be instantiated in data tree
Radek Krejciad5963b2019-09-06 16:03:05 +020048 * (skips cases, input, output). This is the opening part to the #LYSC_TREE_DFS_END - they always have to be used together.
Radek Krejci0935f412019-08-20 16:15:18 +020049 *
50 * The function follows deep-first search algorithm:
51 * <pre>
52 * 1
53 * / \
54 * 2 4
55 * / / \
56 * 3 5 6
57 * </pre>
58 *
59 * Use the same parameters for #LYSC_TREE_DFS_BEGIN and #LYSC_TREE_DFS_END. While
60 * START can be any of the lysc_node* types (including lysc_action and lysc_notif),
61 * ELEM variable must be of the struct lysc_node* type.
62 *
63 * To skip a particular subtree, instead of the continue statement, set LYSC_TREE_DFS_continue
64 * variable to non-zero value.
65 *
66 * Use with opening curly bracket '{' after the macro.
67 *
68 * @param START Pointer to the starting element processed first.
69 * @param ELEM Iterator intended for use in the block.
70 */
71#define LYSC_TREE_DFS_BEGIN(START, ELEM) \
72 { int LYSC_TREE_DFS_continue = 0; struct lysc_node *LYSC_TREE_DFS_next; \
Michal Vasko1c9e79f2020-08-10 11:08:03 +020073 for ((ELEM) = (LYSC_TREE_DFS_next) = (struct lysc_node*)(START); \
Radek Krejci0935f412019-08-20 16:15:18 +020074 (ELEM); \
75 (ELEM) = (LYSC_TREE_DFS_next), LYSC_TREE_DFS_continue = 0)
76
77/**
78 * @brief Macro to iterate via all elements in a (sub)tree. This is the closing part
79 * to the #LYSC_TREE_DFS_BEGIN - they always have to be used together.
80 *
81 * Use the same parameters for #LYSC_TREE_DFS_BEGIN and #LYSC_TREE_DFS_END. While
82 * START can be a pointer to any of the lysc_node* types (including lysc_action and lysc_notif),
83 * ELEM variable must be pointer to the lysc_node type.
84 *
85 * Use with closing curly bracket '}' after the macro.
86 *
87 * @param START Pointer to the starting element processed first.
88 * @param ELEM Iterator intended for use in the block.
89 */
90
91#define LYSC_TREE_DFS_END(START, ELEM) \
92 /* select element for the next run - children first */ \
93 if (LYSC_TREE_DFS_continue) { \
94 (LYSC_TREE_DFS_next) = NULL; \
95 } else { \
96 (LYSC_TREE_DFS_next) = (struct lysc_node*)lysc_node_children(ELEM, 0); \
97 }\
98 if (!(LYSC_TREE_DFS_next)) { \
99 /* in case of RPC/action, get also the output children */ \
Michal Vasko1bf09392020-03-27 12:38:10 +0100100 if (!LYSC_TREE_DFS_continue && (ELEM)->nodetype & (LYS_RPC | LYS_ACTION)) { \
Radek Krejci0935f412019-08-20 16:15:18 +0200101 (LYSC_TREE_DFS_next) = (struct lysc_node*)lysc_node_children(ELEM, LYS_CONFIG_R); \
102 } \
103 if (!(LYSC_TREE_DFS_next)) { \
104 /* no children */ \
105 if ((ELEM) == (struct lysc_node*)(START)) { \
106 /* we are done, (START) has no children */ \
107 break; \
108 } \
109 /* try siblings */ \
110 (LYSC_TREE_DFS_next) = (ELEM)->next; \
111 } \
112 } \
113 while (!(LYSC_TREE_DFS_next)) { \
114 /* parent is already processed, go to its sibling */ \
115 (ELEM) = (ELEM)->parent; \
116 /* no siblings, go back through parents */ \
117 if ((ELEM) == (struct lysc_node*)(START)) { \
118 /* we are done, no next element to process */ \
119 break; \
120 } \
Michal Vasko1bf09392020-03-27 12:38:10 +0100121 if ((ELEM)->nodetype & (LYS_RPC | LYS_ACTION)) { \
Radek Krejci0935f412019-08-20 16:15:18 +0200122 /* there is actually next node as a child of action's output */ \
123 (LYSC_TREE_DFS_next) = (struct lysc_node*)lysc_node_children(ELEM, LYS_CONFIG_R); \
124 } \
125 if (!(LYSC_TREE_DFS_next)) { \
126 (LYSC_TREE_DFS_next) = (ELEM)->next; \
127 } \
128 } } \
129
Michal Vasko64246d82020-08-19 12:35:00 +0200130/* *INDENT-ON* */
131
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200132#define LY_REV_SIZE 11 /**< revision data string length (including terminating NULL byte) */
133
Michal Vaskob55f6c12018-09-12 11:13:15 +0200134#define LYS_UNKNOWN 0x0000 /**< uninitalized unknown statement node */
135#define LYS_CONTAINER 0x0001 /**< container statement node */
136#define LYS_CHOICE 0x0002 /**< choice statement node */
137#define LYS_LEAF 0x0004 /**< leaf statement node */
138#define LYS_LEAFLIST 0x0008 /**< leaf-list statement node */
139#define LYS_LIST 0x0010 /**< list statement node */
140#define LYS_ANYXML 0x0020 /**< anyxml statement node */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200141#define LYS_ANYDATA 0x0120 /**< anydata statement node, in tests it can be used for both #LYS_ANYXML and #LYS_ANYDATA */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200142
Michal Vasko1bf09392020-03-27 12:38:10 +0100143#define LYS_RPC 0x400 /**< RPC statement node */
144#define LYS_ACTION 0x800 /**< action statement node */
145#define LYS_NOTIF 0x1000 /**< notification statement node */
Radek Krejcie7b95092019-05-15 11:03:07 +0200146
Radek Krejcia3045382018-11-22 14:30:31 +0100147#define LYS_CASE 0x0040 /**< case statement node */
148#define LYS_USES 0x0080 /**< uses statement node */
Radek Krejcid3ca0632019-04-16 16:54:54 +0200149#define LYS_INPUT 0x100
150#define LYS_OUTPUT 0x200
151#define LYS_INOUT 0x300
Michal Vasko1bf09392020-03-27 12:38:10 +0100152#define LYS_GROUPING 0x2000
153#define LYS_AUGMENT 0x4000
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100154
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200155/**
Radek Krejcid6b76452019-09-03 17:03:03 +0200156 * @brief List of YANG statements
157 */
158enum ly_stmt {
159 LY_STMT_NONE = 0,
Radek Krejciad5963b2019-09-06 16:03:05 +0200160 LY_STMT_STATUS, /**< in lysc_ext_substmt::storage stored as a pointer to `uint16_t`, only cardinality < #LY_STMT_CARD_SOME is allowed */
161 LY_STMT_CONFIG, /**< in lysc_ext_substmt::storage stored as a pointer to `uint16_t`, only cardinality < #LY_STMT_CARD_SOME is allowed */
Radek Krejci335332a2019-09-05 13:03:35 +0200162 LY_STMT_MANDATORY,
Radek Krejciad5963b2019-09-06 16:03:05 +0200163 LY_STMT_UNITS, /**< in lysc_ext_substmt::storage stored as a pointer to `const char *` (cardinality < #LY_STMT_CARD_SOME)
164 or as a pointer to a [sized array](@ref sizedarrays) `const char **` */
Radek Krejci335332a2019-09-05 13:03:35 +0200165 LY_STMT_DEFAULT,
Radek Krejciad5963b2019-09-06 16:03:05 +0200166 LY_STMT_TYPE, /**< in lysc_ext_substmt::storage stored as a pointer to `struct lysc_type *` (cardinality < #LY_STMT_CARD_SOME)
167 or as a pointer to a [sized array](@ref sizedarrays) `struct lysc_type **` */
Radek Krejci335332a2019-09-05 13:03:35 +0200168
Radek Krejcid6b76452019-09-03 17:03:03 +0200169 LY_STMT_ACTION,
170 LY_STMT_ANYDATA,
171 LY_STMT_ANYXML,
172 LY_STMT_ARGUMENT,
173 LY_STMT_AUGMENT,
174 LY_STMT_BASE,
175 LY_STMT_BELONGS_TO,
176 LY_STMT_BIT,
177 LY_STMT_CASE,
178 LY_STMT_CHOICE,
Radek Krejcid6b76452019-09-03 17:03:03 +0200179 LY_STMT_CONTACT,
180 LY_STMT_CONTAINER,
Radek Krejcid6b76452019-09-03 17:03:03 +0200181 LY_STMT_DESCRIPTION,
182 LY_STMT_DEVIATE,
183 LY_STMT_DEVIATION,
184 LY_STMT_ENUM,
185 LY_STMT_ERROR_APP_TAG,
186 LY_STMT_ERROR_MESSAGE,
187 LY_STMT_EXTENSION,
188 LY_STMT_FEATURE,
189 LY_STMT_FRACTION_DIGITS,
190 LY_STMT_GROUPING,
191 LY_STMT_IDENTITY,
Radek Krejciad5963b2019-09-06 16:03:05 +0200192 LY_STMT_IF_FEATURE, /**< in lysc_ext_substmt::storage stored as a pointer to `struct lysc_iffeature` (cardinality < #LY_STMT_CARD_SOME)
193 or as a pointer to a [sized array](@ref sizedarrays) `struct lysc_iffeature *` */
Radek Krejcid6b76452019-09-03 17:03:03 +0200194 LY_STMT_IMPORT,
195 LY_STMT_INCLUDE,
196 LY_STMT_INPUT,
197 LY_STMT_KEY,
198 LY_STMT_LEAF,
199 LY_STMT_LEAF_LIST,
200 LY_STMT_LENGTH,
201 LY_STMT_LIST,
Radek Krejcid6b76452019-09-03 17:03:03 +0200202 LY_STMT_MAX_ELEMENTS,
203 LY_STMT_MIN_ELEMENTS,
204 LY_STMT_MODIFIER,
205 LY_STMT_MODULE,
206 LY_STMT_MUST,
207 LY_STMT_NAMESPACE,
208 LY_STMT_NOTIFICATION,
209 LY_STMT_ORDERED_BY,
210 LY_STMT_ORGANIZATION,
211 LY_STMT_OUTPUT,
212 LY_STMT_PATH,
213 LY_STMT_PATTERN,
214 LY_STMT_POSITION,
215 LY_STMT_PREFIX,
216 LY_STMT_PRESENCE,
217 LY_STMT_RANGE,
218 LY_STMT_REFERENCE,
219 LY_STMT_REFINE,
220 LY_STMT_REQUIRE_INSTANCE,
221 LY_STMT_REVISION,
222 LY_STMT_REVISION_DATE,
223 LY_STMT_RPC,
Radek Krejcid6b76452019-09-03 17:03:03 +0200224 LY_STMT_SUBMODULE,
Radek Krejcid6b76452019-09-03 17:03:03 +0200225 LY_STMT_TYPEDEF,
226 LY_STMT_UNIQUE,
Radek Krejcid6b76452019-09-03 17:03:03 +0200227 LY_STMT_USES,
228 LY_STMT_VALUE,
229 LY_STMT_WHEN,
230 LY_STMT_YANG_VERSION,
231 LY_STMT_YIN_ELEMENT,
232 LY_STMT_EXTENSION_INSTANCE,
233
234 LY_STMT_SYNTAX_SEMICOLON,
235 LY_STMT_SYNTAX_LEFT_BRACE,
236 LY_STMT_SYNTAX_RIGHT_BRACE,
237
238 LY_STMT_ARG_TEXT,
239 LY_STMT_ARG_VALUE
240};
241
242/**
Radek Krejci0e59c312019-08-15 15:34:15 +0200243 * @brief Extension instance structure parent enumeration
244 */
245typedef enum {
Radek Krejci0935f412019-08-20 16:15:18 +0200246 LYEXT_PAR_MODULE, /**< ::lysc_module */
247 LYEXT_PAR_NODE, /**< ::lysc_node (and the derived structures including ::lysc_action and ::lysc_notif) */
248 LYEXT_PAR_INPUT, /**< ::lysc_action_inout */
249 LYEXT_PAR_OUTPUT, /**< ::lysc_action_inout */
250 LYEXT_PAR_TYPE, /**< ::lysc_type */
251 LYEXT_PAR_TYPE_BIT, /**< ::lysc_type_bitenum_item */
252 LYEXT_PAR_TYPE_ENUM, /**< ::lysc_type_bitenum_item */
253 LYEXT_PAR_FEATURE, /**< ::lysc_feature */
254 LYEXT_PAR_MUST, /**< ::lysc_must */
255 LYEXT_PAR_PATTERN, /**< ::lysc_pattern */
256 LYEXT_PAR_LENGTH, /**< ::lysc_range */
257 LYEXT_PAR_RANGE, /**< ::lysc_range */
258 LYEXT_PAR_WHEN, /**< ::lysc_when */
259 LYEXT_PAR_IDENT, /**< ::lysc_ident */
260 LYEXT_PAR_EXT, /**< ::lysc_ext */
Michal Vasko7c8439f2020-08-05 13:25:19 +0200261 LYEXT_PAR_IMPORT, /**< ::lysp_import */
Michal Vasko033278d2020-08-24 11:24:52 +0200262// LYEXT_PAR_TPDF, /**< ::lysp_tpdf */
263// LYEXT_PAR_EXTINST, /**< ::lysp_ext_instance */
264// LYEXT_PAR_REFINE, /**< ::lysp_refine */
265// LYEXT_PAR_DEVIATION, /**< ::lysp_deviation */
266// LYEXT_PAR_DEVIATE, /**< ::lysp_deviate */
267// LYEXT_PAR_INCLUDE, /**< ::lysp_include */
268// LYEXT_PAR_REVISION, /**< ::lysp_revision */
Radek Krejci0e59c312019-08-15 15:34:15 +0200269} LYEXT_PARENT;
270
271/**
Radek Krejci0935f412019-08-20 16:15:18 +0200272 * @brief Stringify extension instance parent type.
273 * @param[in] type Parent type to stringify.
274 * @return Constant string with the name of the parent statement.
275 */
276const char *lyext_parent2str(LYEXT_PARENT type);
277
278/**
Radek Krejci0e59c312019-08-15 15:34:15 +0200279 * @brief Enum of substatements in which extension instances can appear.
280 */
281typedef enum {
282 LYEXT_SUBSTMT_SELF = 0, /**< extension of the structure itself, not substatement's */
283 LYEXT_SUBSTMT_ARGUMENT, /**< extension of the argument statement, can appear in lys_ext */
284 LYEXT_SUBSTMT_BASE, /**< extension of the base statement, can appear (repeatedly) in lys_type and lys_ident */
285 LYEXT_SUBSTMT_BELONGSTO, /**< extension of the belongs-to statement, can appear in lys_submodule */
286 LYEXT_SUBSTMT_CONTACT, /**< extension of the contact statement, can appear in lys_module */
287 LYEXT_SUBSTMT_DEFAULT, /**< extension of the default statement, can appear in lys_node_leaf, lys_node_leaflist,
288 lys_node_choice and lys_deviate */
289 LYEXT_SUBSTMT_DESCRIPTION, /**< extension of the description statement, can appear in lys_module, lys_submodule,
290 lys_node, lys_import, lys_include, lys_ext, lys_feature, lys_tpdf, lys_restr,
291 lys_ident, lys_deviation, lys_type_enum, lys_type_bit, lys_when and lys_revision */
292 LYEXT_SUBSTMT_ERRTAG, /**< extension of the error-app-tag statement, can appear in lys_restr */
293 LYEXT_SUBSTMT_ERRMSG, /**< extension of the error-message statement, can appear in lys_restr */
294 LYEXT_SUBSTMT_KEY, /**< extension of the key statement, can appear in lys_node_list */
295 LYEXT_SUBSTMT_NAMESPACE, /**< extension of the namespace statement, can appear in lys_module */
296 LYEXT_SUBSTMT_ORGANIZATION, /**< extension of the organization statement, can appear in lys_module and lys_submodule */
297 LYEXT_SUBSTMT_PATH, /**< extension of the path statement, can appear in lys_type */
298 LYEXT_SUBSTMT_PREFIX, /**< extension of the prefix statement, can appear in lys_module, lys_submodule (for
299 belongs-to's prefix) and lys_import */
300 LYEXT_SUBSTMT_PRESENCE, /**< extension of the presence statement, can appear in lys_node_container */
301 LYEXT_SUBSTMT_REFERENCE, /**< extension of the reference statement, can appear in lys_module, lys_submodule,
302 lys_node, lys_import, lys_include, lys_revision, lys_tpdf, lys_restr, lys_ident,
303 lys_ext, lys_feature, lys_deviation, lys_type_enum, lys_type_bit and lys_when */
304 LYEXT_SUBSTMT_REVISIONDATE, /**< extension of the revision-date statement, can appear in lys_import and lys_include */
305 LYEXT_SUBSTMT_UNITS, /**< extension of the units statement, can appear in lys_tpdf, lys_node_leaf,
306 lys_node_leaflist and lys_deviate */
307 LYEXT_SUBSTMT_VALUE, /**< extension of the value statement, can appear in lys_type_enum */
308 LYEXT_SUBSTMT_VERSION, /**< extension of the yang-version statement, can appear in lys_module and lys_submodule */
309 LYEXT_SUBSTMT_MODIFIER, /**< extension of the modifier statement, can appear in lys_restr */
310 LYEXT_SUBSTMT_REQINSTANCE, /**< extension of the require-instance statement, can appear in lys_type */
311 LYEXT_SUBSTMT_YINELEM, /**< extension of the yin-element statement, can appear in lys_ext */
312 LYEXT_SUBSTMT_CONFIG, /**< extension of the config statement, can appear in lys_node and lys_deviate */
313 LYEXT_SUBSTMT_MANDATORY, /**< extension of the mandatory statement, can appear in lys_node_leaf, lys_node_choice,
314 lys_node_anydata and lys_deviate */
315 LYEXT_SUBSTMT_ORDEREDBY, /**< extension of the ordered-by statement, can appear in lys_node_list and lys_node_leaflist */
316 LYEXT_SUBSTMT_STATUS, /**< extension of the status statement, can appear in lys_tpdf, lys_node, lys_ident,
317 lys_ext, lys_feature, lys_type_enum and lys_type_bit */
318 LYEXT_SUBSTMT_FRACDIGITS, /**< extension of the fraction-digits statement, can appear in lys_type */
319 LYEXT_SUBSTMT_MAX, /**< extension of the max-elements statement, can appear in lys_node_list,
320 lys_node_leaflist and lys_deviate */
321 LYEXT_SUBSTMT_MIN, /**< extension of the min-elements statement, can appear in lys_node_list,
322 lys_node_leaflist and lys_deviate */
323 LYEXT_SUBSTMT_POSITION, /**< extension of the position statement, can appear in lys_type_bit */
324 LYEXT_SUBSTMT_UNIQUE, /**< extension of the unique statement, can appear in lys_node_list and lys_deviate */
325 LYEXT_SUBSTMT_IFFEATURE, /**< extension of the if-feature statement */
326} LYEXT_SUBSTMT;
327
328/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200329 * @brief YANG import-stmt
330 */
331struct lysp_import {
Radek Krejci086c7132018-10-26 15:29:04 +0200332 struct lys_module *module; /**< pointer to the imported module
333 (mandatory, but resolved when the referring module is completely parsed) */
334 const char *name; /**< name of the imported module (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200335 const char *prefix; /**< prefix for the data from the imported schema (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200336 const char *dsc; /**< description */
337 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200338 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200339 char rev[LY_REV_SIZE]; /**< revision-date of the imported module */
340};
341
342/**
343 * @brief YANG include-stmt
344 */
345struct lysp_include {
Radek Krejci0bcdaed2019-01-10 10:21:34 +0100346 struct lysp_submodule *submodule;/**< pointer to the parsed submodule structure
Radek Krejci086c7132018-10-26 15:29:04 +0200347 (mandatory, but resolved when the referring module is completely parsed) */
348 const char *name; /**< name of the included submodule (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200349 const char *dsc; /**< description */
350 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200351 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200352 char rev[LY_REV_SIZE]; /**< revision-date of the included submodule */
353};
354
355/**
356 * @brief YANG extension-stmt
357 */
358struct lysp_ext {
359 const char *name; /**< extension name */
360 const char *argument; /**< argument name, NULL if not specified */
361 const char *dsc; /**< description statement */
362 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200363 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcif56e2a42019-09-09 14:15:25 +0200364 uint16_t flags; /**< LYS_STATUS_* and LYS_YINELEM_* values (@ref snodeflags) */
Michal Vasko5fe75f12020-03-02 13:52:37 +0100365
366 struct lysc_ext *compiled; /**< pointer to the compiled extension definition */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200367};
368
369/**
370 * @brief Helper structure for generic storage of the extension instances content.
371 */
372struct lysp_stmt {
373 const char *stmt; /**< identifier of the statement */
374 const char *arg; /**< statement's argument */
375 struct lysp_stmt *next; /**< link to the next statement */
Michal Vaskobc2559f2018-09-07 10:17:50 +0200376 struct lysp_stmt *child; /**< list of the statement's substatements (linked list) */
David Sedlákb9d75c42019-08-14 10:49:42 +0200377 uint16_t flags; /**< statement flags, can be set to LYS_YIN_ATTR */
Radek Krejci335332a2019-09-05 13:03:35 +0200378 enum ly_stmt kw; /**< numeric respresentation of the stmt value */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200379};
380
David Sedlákae4b4512019-08-14 10:45:56 +0200381#define LYS_YIN 0x1 /**< used to specify input format of extension instance */
382
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200383/**
384 * @brief YANG extension instance
385 */
386struct lysp_ext_instance {
David Sedlákbbd06ca2019-06-27 14:15:38 +0200387 const char *name; /**< extension identifier, including possible prefix */
388 const char *argument; /**< optional value of the extension's argument */
Radek Krejci335332a2019-09-05 13:03:35 +0200389 void *parent; /**< pointer to the parent element holding the extension instance(s), use
390 ::lysp_ext_instance#parent_type to access the schema element */
David Sedlákbbd06ca2019-06-27 14:15:38 +0200391 struct lysp_stmt *child; /**< list of the extension's substatements (linked list) */
Radek Krejcif56e2a42019-09-09 14:15:25 +0200392 struct lysc_ext_instance *compiled; /**< pointer to the compiled data if any - in case the source format is YIN,
393 some of the information (argument) are available only after compilation */
David Sedlákbbd06ca2019-06-27 14:15:38 +0200394 LYEXT_SUBSTMT insubstmt; /**< value identifying placement of the extension instance */
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200395 LY_ARRAY_COUNT_TYPE insubstmt_index; /**< in case the instance is in a substatement, this identifies
David Sedlákbbd06ca2019-06-27 14:15:38 +0200396 the index of that substatement */
David Sedlákae4b4512019-08-14 10:45:56 +0200397 uint8_t yin; /** flag for YIN source format, can be set to LYS_YIN */
Radek Krejci335332a2019-09-05 13:03:35 +0200398 LYEXT_PARENT parent_type; /**< type of the parent structure */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200399};
400
401/**
402 * @brief YANG feature-stmt
403 */
404struct lysp_feature {
405 const char *name; /**< feature name (mandatory) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200406 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200407 const char *dsc; /**< description statement */
408 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200409 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200410 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values allowed */
411};
412
413/**
414 * @brief YANG identity-stmt
415 */
416struct lysp_ident {
417 const char *name; /**< identity name (mandatory), including possible prefix */
Radek Krejci151a5b72018-10-19 14:21:44 +0200418 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
419 const char **bases; /**< list of base identifiers ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200420 const char *dsc; /**< description statement */
421 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200422 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200423 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_ values are allowed */
424};
425
Michal Vasko71e64ca2018-09-07 16:30:29 +0200426/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200427 * @brief Covers restrictions: range, length, pattern, must
428 */
429struct lysp_restr {
430 const char *arg; /**< The restriction expression/value (mandatory);
431 in case of pattern restriction, the first byte has a special meaning:
432 0x06 (ACK) for regular match and 0x15 (NACK) for invert-match */
433 const char *emsg; /**< error-message */
434 const char *eapptag; /**< error-app-tag value */
435 const char *dsc; /**< description */
436 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200437 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200438};
439
440/**
Michal Vasko71e64ca2018-09-07 16:30:29 +0200441 * @brief YANG revision-stmt
442 */
443struct lysp_revision {
Radek Krejcib7db73a2018-10-24 14:18:40 +0200444 char date[LY_REV_SIZE]; /**< revision date (madatory) */
Michal Vasko71e64ca2018-09-07 16:30:29 +0200445 const char *dsc; /**< description statement */
446 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200447 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vasko71e64ca2018-09-07 16:30:29 +0200448};
449
450/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200451 * @brief Enumeration/Bit value definition
452 */
453struct lysp_type_enum {
454 const char *name; /**< name (mandatory) */
455 const char *dsc; /**< description statement */
456 const char *ref; /**< reference statement */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200457 int64_t value; /**< enum's value or bit's position */
Radek Krejci151a5b72018-10-19 14:21:44 +0200458 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200459 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200460 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_ and LYS_SET_VALUE
461 values are allowed */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200462};
463
464/**
465 * @brief YANG type-stmt
466 *
467 * Some of the items in the structure may be mandatory, but it is necessary to resolve the type's base type first
468 */
469struct lysp_type {
470 const char *name; /**< name of the type (mandatory) */
471 struct lysp_restr *range; /**< allowed values range - numerical, decimal64 */
472 struct lysp_restr *length; /**< allowed length of the value - string, binary */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200473 struct lysp_restr *patterns; /**< list of patterns ([sized array](@ref sizedarrays)) - string */
474 struct lysp_type_enum *enums; /**< list of enum-stmts ([sized array](@ref sizedarrays)) - enum */
475 struct lysp_type_enum *bits; /**< list of bit-stmts ([sized array](@ref sizedarrays)) - bits */
Michal Vasko004d3152020-06-11 19:59:22 +0200476 struct lyxp_expr *path; /**< parsed path - leafref */
Radek Krejci151a5b72018-10-19 14:21:44 +0200477 const char **bases; /**< list of base identifiers ([sized array](@ref sizedarrays)) - identityref */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200478 struct lysp_type *types; /**< list of sub-types ([sized array](@ref sizedarrays)) - union */
479 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200480
Radek Krejci2167ee12018-11-02 16:09:07 +0100481 struct lysc_type *compiled; /**< pointer to the compiled type */
482
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200483 uint8_t fraction_digits; /**< number of fraction digits - decimal64 */
484 uint8_t require_instance; /**< require-instance flag - leafref, instance */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100485 uint16_t flags; /**< [schema node flags](@ref spnodeflags) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200486};
487
488/**
489 * @brief YANG typedef-stmt
490 */
491struct lysp_tpdf {
492 const char *name; /**< name of the newly defined type (mandatory) */
493 const char *units; /**< units of the newly defined type */
494 const char *dflt; /**< default value of the newly defined type */
495 const char *dsc; /**< description statement */
496 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200497 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200498 struct lysp_type type; /**< base type from which the typedef is derived (mandatory) */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100499 uint16_t flags; /**< [schema node flags](@ref spnodeflags) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200500};
501
502/**
503 * @brief YANG grouping-stmt
504 */
505struct lysp_grp {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100506 struct lysp_node *parent; /**< parent node (NULL if this is a top-level grouping) */
507 uint16_t nodetype; /**< LYS_GROUPING */
508 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values are allowed */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200509 const char *name; /**< grouping name (mandatory) */
510 const char *dsc; /**< description statement */
511 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200512 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
513 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200514 struct lysp_node *data; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200515 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
516 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
517 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200518};
519
520/**
521 * @brief YANG when-stmt
522 */
523struct lysp_when {
524 const char *cond; /**< specified condition (mandatory) */
525 const char *dsc; /**< description statement */
526 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200527 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200528};
529
530/**
531 * @brief YANG refine-stmt
532 */
533struct lysp_refine {
534 const char *nodeid; /**< target descendant schema nodeid (mandatory) */
535 const char *dsc; /**< description statement */
536 const char *ref; /**< reference statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200537 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200538 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200539 const char *presence; /**< presence description */
Radek Krejci151a5b72018-10-19 14:21:44 +0200540 const char **dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200541 uint32_t min; /**< min-elements constraint */
542 uint32_t max; /**< max-elements constraint, 0 means unbounded */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200543 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200544 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
545};
546
547/**
Michal Vasko82a83432019-11-14 12:33:04 +0100548 * @brief YANG uses-augment-stmt and augment-stmt (compatible with struct lysp_node )
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200549 */
550struct lysp_augment {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100551 struct lysp_node *parent; /**< parent node (NULL if this is a top-level augment) */
552 uint16_t nodetype; /**< LYS_AUGMENT */
553 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values are allowed */
Michal Vasko82a83432019-11-14 12:33:04 +0100554 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200555 const char *nodeid; /**< target schema nodeid (mandatory) - absolute for global augments, descendant for uses's augments */
556 const char *dsc; /**< description statement */
557 const char *ref; /**< reference statement */
558 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200559 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Michal Vasko82a83432019-11-14 12:33:04 +0100560 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200561 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
562 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200563};
564
565/**
566 * @defgroup deviatetypes Deviate types
567 * @{
568 */
569#define LYS_DEV_NOT_SUPPORTED 1 /**< deviate type not-supported */
570#define LYS_DEV_ADD 2 /**< deviate type add */
571#define LYS_DEV_DELETE 3 /**< deviate type delete */
572#define LYS_DEV_REPLACE 4 /**< deviate type replace */
Radek Krejci2ff0d572020-05-21 15:27:28 +0200573/** @} deviatetypes */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200574
575/**
576 * @brief Generic deviate structure to get type and cast to lysp_deviate_* structure
577 */
578struct lysp_deviate {
579 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
580 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200581 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200582};
583
584struct lysp_deviate_add {
585 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
586 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200587 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200588 const char *units; /**< units of the values */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200589 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200590 const char **uniques; /**< list of uniques specifications ([sized array](@ref sizedarrays)) */
591 const char **dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200592 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
593 uint32_t min; /**< min-elements constraint */
594 uint32_t max; /**< max-elements constraint, 0 means unbounded */
595};
596
597struct lysp_deviate_del {
598 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
599 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200600 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200601 const char *units; /**< units of the values */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200602 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200603 const char **uniques; /**< list of uniques specifications ([sized array](@ref sizedarrays)) */
604 const char **dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200605};
606
607struct lysp_deviate_rpl {
608 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
609 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200610 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200611 struct lysp_type *type; /**< type of the node */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200612 const char *units; /**< units of the values */
613 const char *dflt; /**< default value */
614 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
615 uint32_t min; /**< min-elements constraint */
616 uint32_t max; /**< max-elements constraint, 0 means unbounded */
617};
618
619struct lysp_deviation {
Michal Vaskob55f6c12018-09-12 11:13:15 +0200620 const char *nodeid; /**< target absolute schema nodeid (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200621 const char *dsc; /**< description statement */
622 const char *ref; /**< reference statement */
623 struct lysp_deviate* deviates; /**< list of deviate specifications (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200624 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200625};
626
Radek Krejci4f28eda2018-11-12 11:46:16 +0100627/**
628 * @defgroup spnodeflags Parsed schema nodes flags
629 * @ingroup snodeflags
630 *
631 * Various flags for parsed schema nodes.
632 *
633 * 1 - container 6 - anydata/anyxml 11 - output 16 - grouping 21 - enum
634 * 2 - choice 7 - case 12 - feature 17 - uses 22 - type
Radek Krejcid3ca0632019-04-16 16:54:54 +0200635 * 3 - leaf 8 - notification 13 - identity 18 - refine 23 - stmt
Radek Krejci4f28eda2018-11-12 11:46:16 +0100636 * 4 - leaflist 9 - rpc 14 - extension 19 - augment
637 * 5 - list 10 - input 15 - typedef 20 - deviate
638 *
Radek Krejcid3ca0632019-04-16 16:54:54 +0200639 * 1 1 1 1 1 1 1 1 1 1 2 2 2 2
640 * bit name 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3
641 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
642 * 1 LYS_CONFIG_W |x|x|x|x|x|x|x| | | | | | | | | | |x| |x| | | |
643 * LYS_SET_BASE | | | | | | | | | | | | | | | | | | | | | |x| |
644 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
645 * 2 LYS_CONFIG_R |x|x|x|x|x|x|x| | | | | | | | | | |x| |x| | | |
646 * LYS_SET_BIT | | | | | | | | | | | | | | | | | | | | | |x| |
647 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
648 * 3 LYS_STATUS_CURR |x|x|x|x|x|x|x|x|x| | |x|x|x|x|x|x| |x|x|x| | |
649 * LYS_SET_ENUM | | | | | | | | | | | | | | | | | | | | | |x| |
650 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
651 * 4 LYS_STATUS_DEPRC |x|x|x|x|x|x|x|x|x| | |x|x|x|x|x|x| |x|x|x| | |
652 * LYS_SET_FRDIGITS | | | | | | | | | | | | | | | | | | | | | |x| |
653 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
654 * 5 LYS_STATUS_OBSLT |x|x|x|x|x|x|x|x|x| | |x|x|x|x|x|x| |x|x|x| | |
655 * LYS_SET_LENGTH | | | | | | | | | | | | | | | | | | | | | |x| |
656 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
657 * 6 LYS_MAND_TRUE | |x|x| | |x| | | | | | | | | | | |x| |x| | | |
658 * LYS_SET_PATH | | | | | | | | | | | | | | | | | | | | | |x| |
659 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
660 * 7 LYS_MAND_FALSE | |x|x| | |x| | | | | | | | | | | |x| |x| | | |
661 * LYS_ORDBY_USER | | | |x|x| | | | | | | | | | | | | | | | | | |
662 * LYS_SET_PATTERN | | | | | | | | | | | | | | | | | | | | | |x| |
663 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
664 * 8 LYS_ORDBY_SYSTEM | | | |x|x| | | | | | | | | | | | | | | | | | |
665 * LYS_YINELEM_TRUE | | | | | | | | | | | | | |x| | | | | | | | | |
666 * LYS_SET_RANGE | | | | | | | | | | | | | | | | | | | | | |x| |
667 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
668 * 9 LYS_YINELEM_FALSE| | | | | | | | | | | | | |x| | | | | | | | | |
669 * LYS_SET_TYPE | | | | | | | | | | | | | | | | | | | | | |x| |
670 * LYS_SINGLEQUOTED | | | | | | | | | | | | | | | | | | | | | | |x|
671 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
672 * 10 LYS_SET_VALUE | | | | | | | | | | | | | | | | | | | | |x| | |
673 * LYS_SET_REQINST | | | | | | | | | | | | | | | | | | | | | |x| |
674 * LYS_SET_MIN | | | |x|x| | | | | | | | | | | | |x| |x| | | |
675 * LYS_DOUBLEQUOTED | | | | | | | | | | | | | | | | | | | | | | |x|
676 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
677 * 11 LYS_SET_MAX | | | |x|x| | | | | | | | | | | | |x| |x| | | |
Radek Krejcif2de0ed2019-05-02 14:13:18 +0200678 * LYS_USED_GRP | | | | | | | | | | | | | | | |x| | | | | | | |
David Sedlákae4b4512019-08-14 10:45:56 +0200679 * LYS_YIN_ATTR | | | | | | | | | | | | | | | | | | | | | | |x|
Radek Krejcid3ca0632019-04-16 16:54:54 +0200680 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Radek Krejcif56e2a42019-09-09 14:15:25 +0200681 * 12 LYS_YIN_ARGUMENT | | | | | | | | | | | | | | | | | | | | | | |x|
682 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Radek Krejci4f28eda2018-11-12 11:46:16 +0100683 *
684 */
685
686/**
687 * @defgroup scnodeflags Compiled schema nodes flags
688 * @ingroup snodeflags
689 *
690 * Various flags for compiled schema nodes.
691 *
Radek Krejci61e042e2019-09-10 15:53:09 +0200692 * 1 - container 6 - anydata/anyxml 11 - identity
693 * 2 - choice 7 - case 12 - extension
694 * 3 - leaf 8 - notification 13 - bitenum
Michal Vasko03ff5a72019-09-11 13:49:33 +0200695 * 4 - leaflist 9 - rpc/action 14 - when
Michal Vaskoecd62de2019-11-13 12:35:11 +0100696 * 5 - list 10 - feature
Radek Krejci4f28eda2018-11-12 11:46:16 +0100697 *
Michal Vaskoecd62de2019-11-13 12:35:11 +0100698 * 1 1 1 1 1
699 * bit name 1 2 3 4 5 6 7 8 9 0 1 2 3 4
700 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
701 * 1 LYS_CONFIG_W |x|x|x|x|x|x|x| | | | | | | |
702 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
703 * 2 LYS_CONFIG_R |x|x|x|x|x|x|x| | | | | | | |
704 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
705 * 3 LYS_STATUS_CURR |x|x|x|x|x|x|x|x|x|x|x|x| |x|
706 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
707 * 4 LYS_STATUS_DEPRC |x|x|x|x|x|x|x|x|x|x|x|x| |x|
708 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
709 * 5 LYS_STATUS_OBSLT |x|x|x|x|x|x|x|x|x|x|x|x| |x|
710 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
711 * 6 LYS_MAND_TRUE |x|x|x|x|x|x| | | | | | | | |
712 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
713 * 7 LYS_ORDBY_USER | | | |x|x| | | | | | | | | |
714 * LYS_MAND_FALSE | |x|x| | |x| | | | | | | | |
715 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
716 * 8 LYS_ORDBY_SYSTEM | | | |x|x| | | | | | | | | |
717 * LYS_PRESENCE |x| | | | | | | | | | | | | |
718 * LYS_UNIQUE | | |x| | | | | | | | | | | |
719 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
720 * 9 LYS_KEY | | |x| | | | | | | | | | | |
721 * LYS_FENABLED | | | | | | | | | |x| | | | |
722 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
723 * 10 LYS_SET_DFLT | | |x|x| | |x| | | | | | | |
724 * LYS_ISENUM | | | | | | | | | | | | |x| |
725 * LYS_KEYLESS | | | | |x| | | | | | | | | |
726 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
727 * 11 LYS_SET_UNITS | | |x|x| | | | | | | | | | |
728 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
729 * 12 LYS_SET_CONFIG |x|x|x|x|x|x| | | | | | | | |
730 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Radek Krejci4f28eda2018-11-12 11:46:16 +0100731 *
732 */
733
734/**
735 * @defgroup snodeflags Schema nodes flags
Radek Krejci4f28eda2018-11-12 11:46:16 +0100736 * @{
737 */
Michal Vasko1bf09392020-03-27 12:38:10 +0100738#define LYS_CONFIG_W 0x01 /**< config true; also set for input children nodes */
739#define LYS_CONFIG_R 0x02 /**< config false; also set for output and notification children nodes */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200740#define LYS_CONFIG_MASK 0x03 /**< mask for config value */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100741#define LYS_STATUS_CURR 0x04 /**< status current; */
742#define LYS_STATUS_DEPRC 0x08 /**< status deprecated; */
743#define LYS_STATUS_OBSLT 0x10 /**< status obsolete; */
744#define LYS_STATUS_MASK 0x1C /**< mask for status value */
745#define LYS_MAND_TRUE 0x20 /**< mandatory true; applicable only to ::lysp_node_choice/::lysc_node_choice,
Radek Krejcife909632019-02-12 15:34:42 +0100746 ::lysp_node_leaf/::lysc_node_leaf and ::lysp_node_anydata/::lysc_node_anydata.
747 The ::lysc_node_leaflist and ::lysc_node_leaflist have this flag in case that min-elements > 0.
748 The ::lysc_node_container has this flag if it is not a presence container and it has at least one
749 child with LYS_MAND_TRUE. */
Radek Krejcif1421c22019-02-19 13:05:20 +0100750#define LYS_MAND_FALSE 0x40 /**< mandatory false; applicable only to ::lysp_node_choice/::lysc_node_choice,
751 ::lysp_node_leaf/::lysc_node_leaf and ::lysp_node_anydata/::lysc_node_anydata.
752 This flag is present only in case the mandatory false statement was explicitly specified. */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100753#define LYS_MAND_MASK 0x60 /**< mask for mandatory values */
Michal Vaskoc118ae22020-08-06 14:51:09 +0200754#define LYS_PRESENCE 0x80 /**< flag for presence property of a container, but it is not only for explicit presence
755 containers, but also for NP containers with some meaning, applicable only to
756 ::lysc_node_container */
Radek Krejci7adf4ff2018-12-05 08:55:00 +0100757#define LYS_UNIQUE 0x80 /**< flag for leafs being part of a unique set, applicable only to ::lysc_node_leaf */
758#define LYS_KEY 0x100 /**< flag for leafs being a key of a list, applicable only to ::lysc_node_leaf */
Radek Krejci0fe9b512019-07-26 17:51:05 +0200759#define LYS_KEYLESS 0x200 /**< flag for list without any key, applicable only to ::lysc_node_list */
Radek Krejci7adf4ff2018-12-05 08:55:00 +0100760#define LYS_FENABLED 0x100 /**< feature enabled flag, applicable only to ::lysc_feature */
Radek Krejcife909632019-02-12 15:34:42 +0100761#define LYS_ORDBY_SYSTEM 0x80 /**< ordered-by user lists, applicable only to ::lysc_node_leaflist/::lysp_node_leaflist and
Radek Krejci4f28eda2018-11-12 11:46:16 +0100762 ::lysc_node_list/::lysp_node_list */
763#define LYS_ORDBY_USER 0x40 /**< ordered-by user lists, applicable only to ::lysc_node_leaflist/::lysp_node_leaflist and
764 ::lysc_node_list/::lysp_node_list */
765#define LYS_ORDBY_MASK 0x60 /**< mask for ordered-by values */
766#define LYS_YINELEM_TRUE 0x80 /**< yin-element true for extension's argument */
767#define LYS_YINELEM_FALSE 0x100 /**< yin-element false for extension's argument */
768#define LYS_YINELEM_MASK 0x180 /**< mask for yin-element value */
Radek Krejcif2de0ed2019-05-02 14:13:18 +0200769#define LYS_USED_GRP 0x400 /**< internal flag for validating not-instantiated groupings
770 (resp. do not validate again the instantiated groupings). */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100771#define LYS_SET_VALUE 0x200 /**< value attribute is set */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100772#define LYS_SET_MIN 0x200 /**< min attribute is set */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200773#define LYS_SET_MAX 0x400 /**< max attribute is set */
Radek Krejcid505e3d2018-11-13 09:04:17 +0100774
775#define LYS_SET_BASE 0x0001 /**< type's flag for present base substatement */
776#define LYS_SET_BIT 0x0002 /**< type's flag for present bit substatement */
777#define LYS_SET_ENUM 0x0004 /**< type's flag for present enum substatement */
778#define LYS_SET_FRDIGITS 0x0008 /**< type's flag for present fraction-digits substatement */
779#define LYS_SET_LENGTH 0x0010 /**< type's flag for present length substatement */
780#define LYS_SET_PATH 0x0020 /**< type's flag for present path substatement */
781#define LYS_SET_PATTERN 0x0040 /**< type's flag for present pattern substatement */
782#define LYS_SET_RANGE 0x0080 /**< type's flag for present range substatement */
783#define LYS_SET_TYPE 0x0100 /**< type's flag for present type substatement */
784#define LYS_SET_REQINST 0x0200 /**< type's flag for present require-instance substatement */
Radek Krejciccd20f12019-02-15 14:12:27 +0100785#define LYS_SET_DFLT 0x0200 /**< flag to mark leaf/leaflist with own (or refined) default value, not a default value taken from its type, and default
Radek Krejci76b3e962018-12-14 17:01:25 +0100786 cases of choice. This information is important for refines, since it is prohibited to make leafs
787 with default statement mandatory. In case the default leaf value is taken from type, it is thrown
Radek Krejciccd20f12019-02-15 14:12:27 +0100788 away when it is refined to be mandatory node. Similarly it is used for deviations to distinguish
789 between own default or the default values taken from the type. */
790#define LYS_SET_UNITS 0x0400 /**< flag to know if the leaf's/leaflist's units are their own (flag set) or it is taken from the type. */
Radek Krejcif1421c22019-02-19 13:05:20 +0100791#define LYS_SET_CONFIG 0x0800 /**< flag to know if the config property was set explicitly (flag set) or it is inherited. */
Radek Krejci0e5d8382018-11-28 16:37:53 +0100792
Radek Krejcif56e2a42019-09-09 14:15:25 +0200793#define LYS_SINGLEQUOTED 0x100 /**< flag for single-quoted argument of an extension instance's substatement, only when the source is YANG */
794#define LYS_DOUBLEQUOTED 0x200 /**< flag for double-quoted argument of an extension instance's substatement, only when the source is YANG */
Radek Krejcid3ca0632019-04-16 16:54:54 +0200795
Radek Krejcif56e2a42019-09-09 14:15:25 +0200796#define LYS_YIN_ATTR 0x400 /**< flag to identify YIN attribute parsed as extension's substatement, only when the source is YIN */
797#define LYS_YIN_ARGUMENT 0x800 /**< flag to identify statement representing extension's argument, only when the source is YIN */
David Sedlákbbd06ca2019-06-27 14:15:38 +0200798
Radek Krejci693262f2019-04-29 15:23:20 +0200799#define LYS_ISENUM 0x200 /**< flag to simply distinguish type in struct lysc_type_bitenum_item */
800
Radek Krejcife909632019-02-12 15:34:42 +0100801#define LYS_FLAGS_COMPILED_MASK 0xff /**< mask for flags that maps to the compiled structures */
Radek Krejci2ff0d572020-05-21 15:27:28 +0200802/** @} snodeflags */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200803
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200804/**
805 * @brief Generic YANG data node
806 */
807struct lysp_node {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100808 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200809 uint16_t nodetype; /**< type of the node (mandatory) */
810 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100811 struct lysp_node *next; /**< next sibling node (NULL if there is no one) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200812 const char *name; /**< node name (mandatory) */
813 const char *dsc; /**< description statement */
814 const char *ref; /**< reference statement */
815 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200816 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200817 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200818};
819
820/**
821 * @brief Extension structure of the lysp_node for YANG container
822 */
823struct lysp_node_container {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100824 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200825 uint16_t nodetype; /**< LYS_CONTAINER */
826 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
827 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
828 const char *name; /**< node name (mandatory) */
829 const char *dsc; /**< description statement */
830 const char *ref; /**< reference statement */
831 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200832 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200833 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200834
835 /* container */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200836 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200837 const char *presence; /**< presence description */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200838 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
839 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200840 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200841 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
842 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200843};
844
845struct lysp_node_leaf {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100846 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200847 uint16_t nodetype; /**< LYS_LEAF */
848 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
849 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
850 const char *name; /**< node name (mandatory) */
851 const char *dsc; /**< description statement */
852 const char *ref; /**< reference statement */
853 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200854 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200855 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200856
857 /* leaf */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200858 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200859 struct lysp_type type; /**< type of the leaf node (mandatory) */
860 const char *units; /**< units of the leaf's type */
861 const char *dflt; /**< default value */
862};
863
864struct lysp_node_leaflist {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100865 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200866 uint16_t nodetype; /**< LYS_LEAFLIST */
867 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
868 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
869 const char *name; /**< node name (mandatory) */
870 const char *dsc; /**< description statement */
871 const char *ref; /**< reference statement */
872 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200873 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200874 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200875
876 /* leaf-list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200877 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200878 struct lysp_type type; /**< type of the leaf node (mandatory) */
879 const char *units; /**< units of the leaf's type */
Radek Krejci151a5b72018-10-19 14:21:44 +0200880 const char **dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200881 uint32_t min; /**< min-elements constraint */
882 uint32_t max; /**< max-elements constraint, 0 means unbounded */
883};
884
885struct lysp_node_list {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100886 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200887 uint16_t nodetype; /**< LYS_LIST */
888 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
889 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
890 const char *name; /**< node name (mandatory) */
891 const char *dsc; /**< description statement */
892 const char *ref; /**< reference statement */
893 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200894 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200895 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200896
897 /* list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200898 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200899 const char *key; /**< keys specification */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200900 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
901 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200902 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200903 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
904 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200905 const char **uniques; /**< list of unique specifications ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200906 uint32_t min; /**< min-elements constraint */
907 uint32_t max; /**< max-elements constraint, 0 means unbounded */
908};
909
910struct lysp_node_choice {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100911 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200912 uint16_t nodetype; /**< LYS_CHOICE */
913 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
914 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
915 const char *name; /**< node name (mandatory) */
916 const char *dsc; /**< description statement */
917 const char *ref; /**< reference statement */
918 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200919 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200920 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200921
922 /* choice */
923 struct lysp_node *child; /**< list of data nodes (linked list) */
924 const char* dflt; /**< default case */
925};
926
927struct lysp_node_case {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100928 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200929 uint16_t nodetype; /**< LYS_CASE */
930 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
931 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
932 const char *name; /**< node name (mandatory) */
933 const char *dsc; /**< description statement */
934 const char *ref; /**< reference statement */
935 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200936 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200937 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200938
939 /* case */
940 struct lysp_node *child; /**< list of data nodes (linked list) */
941};
942
943struct lysp_node_anydata {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100944 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200945 uint16_t nodetype; /**< LYS_ANYXML || LYS_ANYDATA */
946 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
947 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
948 const char *name; /**< node name (mandatory) */
949 const char *dsc; /**< description statement */
950 const char *ref; /**< reference statement */
951 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200952 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200953 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200954
955 /* anyxml/anydata */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200956 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200957};
958
959struct lysp_node_uses {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100960 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200961 uint16_t nodetype; /**< LYS_USES */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200962 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
963 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
964 const char *name; /**< grouping name reference (mandatory) */
965 const char *dsc; /**< description statement */
966 const char *ref; /**< reference statement */
967 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200968 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200969 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200970
971 /* uses */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200972 struct lysp_refine *refines; /**< list of uses's refines ([sized array](@ref sizedarrays)) */
973 struct lysp_augment *augments; /**< list of uses's augment ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200974};
975
976/**
977 * @brief YANG input-stmt and output-stmt
978 */
979struct lysp_action_inout {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100980 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
981 uint16_t nodetype; /**< LYS_INOUT */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200982 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
983 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
984 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200985 struct lysp_node *data; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200986 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200987};
988
989/**
990 * @brief YANG rpc-stmt and action-stmt
991 */
992struct lysp_action {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100993 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Michal Vasko1bf09392020-03-27 12:38:10 +0100994 uint16_t nodetype; /**< LYS_RPC or LYS_ACTION */
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100995 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200996 const char *name; /**< grouping name reference (mandatory) */
997 const char *dsc; /**< description statement */
998 const char *ref; /**< reference statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200999 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001000 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
1001 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001002 struct lysp_action_inout input; /**< RPC's/Action's input */
1003 struct lysp_action_inout output; /**< RPC's/Action's output */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001004 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001005};
1006
1007/**
1008 * @brief YANG notification-stmt
1009 */
1010struct lysp_notif {
Radek Krejci6d9b9b52018-11-02 12:43:39 +01001011 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
1012 uint16_t nodetype; /**< LYS_NOTIF */
1013 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values are allowed */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001014 const char *name; /**< grouping name reference (mandatory) */
1015 const char *dsc; /**< description statement */
1016 const char *ref; /**< reference statement */
Radek Krejci151a5b72018-10-19 14:21:44 +02001017 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001018 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1019 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
1020 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001021 struct lysp_node *data; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001022 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001023};
1024
1025/**
Radek Krejcif0fceb62018-09-05 14:58:45 +02001026 * @brief supported YANG schema version values
1027 */
1028typedef enum LYS_VERSION {
1029 LYS_VERSION_UNDEF = 0, /**< no specific version, YANG 1.0 as default */
1030 LYS_VERSION_1_0 = 1, /**< YANG 1.0 */
1031 LYS_VERSION_1_1 = 2 /**< YANG 1.1 */
1032} LYS_VERSION;
1033
1034/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001035 * @brief Printable YANG schema tree structure representing YANG module.
1036 *
1037 * Simple structure corresponding to the YANG format. The schema is only syntactically validated.
1038 */
1039struct lysp_module {
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001040 struct lys_module *mod; /**< covering module structure */
1041
Radek Krejcib7db73a2018-10-24 14:18:40 +02001042 struct lysp_revision *revs; /**< list of the module revisions ([sized array](@ref sizedarrays)), the first revision
1043 in the list is always the last (newest) revision of the module */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001044 struct lysp_import *imports; /**< list of imported modules ([sized array](@ref sizedarrays)) */
1045 struct lysp_include *includes; /**< list of included submodules ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001046 struct lysp_ext *extensions; /**< list of extension statements ([sized array](@ref sizedarrays)) */
1047 struct lysp_feature *features; /**< list of feature definitions ([sized array](@ref sizedarrays)) */
1048 struct lysp_ident *identities; /**< list of identities ([sized array](@ref sizedarrays)) */
1049 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
1050 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001051 struct lysp_node *data; /**< list of module's top-level data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001052 struct lysp_augment *augments; /**< list of augments ([sized array](@ref sizedarrays)) */
1053 struct lysp_action *rpcs; /**< list of RPCs ([sized array](@ref sizedarrays)) */
1054 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
1055 struct lysp_deviation *deviations; /**< list of deviations ([sized array](@ref sizedarrays)) */
1056 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001057
Radek Krejci0f969882020-08-21 16:56:47 +02001058 uint8_t parsing : 1; /**< flag for circular check */
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001059};
1060
1061struct lysp_submodule {
1062 const char *belongsto; /**< belongs to parent module (submodule - mandatory) */
1063
1064 struct lysp_revision *revs; /**< list of the module revisions ([sized array](@ref sizedarrays)), the first revision
1065 in the list is always the last (newest) revision of the module */
1066 struct lysp_import *imports; /**< list of imported modules ([sized array](@ref sizedarrays)) */
1067 struct lysp_include *includes; /**< list of included submodules ([sized array](@ref sizedarrays)) */
1068 struct lysp_ext *extensions; /**< list of extension statements ([sized array](@ref sizedarrays)) */
1069 struct lysp_feature *features; /**< list of feature definitions ([sized array](@ref sizedarrays)) */
1070 struct lysp_ident *identities; /**< list of identities ([sized array](@ref sizedarrays)) */
1071 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
1072 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
1073 struct lysp_node *data; /**< list of module's top-level data nodes (linked list) */
1074 struct lysp_augment *augments; /**< list of augments ([sized array](@ref sizedarrays)) */
1075 struct lysp_action *rpcs; /**< list of RPCs ([sized array](@ref sizedarrays)) */
1076 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
1077 struct lysp_deviation *deviations; /**< list of deviations ([sized array](@ref sizedarrays)) */
1078 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1079
Radek Krejci0f969882020-08-21 16:56:47 +02001080 uint8_t parsing : 1; /**< flag for circular check */
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001081
Radek Krejci0f969882020-08-21 16:56:47 +02001082 uint8_t latest_revision : 2; /**< flag to mark the latest available revision:
Radek Krejci086c7132018-10-26 15:29:04 +02001083 1 - the latest revision in searchdirs was not searched yet and this is the
1084 latest revision in the current context
1085 2 - searchdirs were searched and this is the latest available revision */
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001086 const char *name; /**< name of the module (mandatory) */
1087 const char *filepath; /**< path, if the schema was read from a file, NULL in case of reading from memory */
1088 const char *prefix; /**< submodule belongsto prefix of main module (mandatory) */
1089 const char *org; /**< party/company responsible for the module */
1090 const char *contact; /**< contact information for the module */
1091 const char *dsc; /**< description of the module */
1092 const char *ref; /**< cross-reference for the module */
Radek Krejci086c7132018-10-26 15:29:04 +02001093 uint8_t version; /**< yang-version (LYS_VERSION values) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001094};
1095
1096/**
Radek Krejci3f5e3db2018-10-11 15:57:47 +02001097 * @brief Free the printable YANG schema tree structure.
1098 *
1099 * @param[in] module Printable YANG schema tree structure to free.
1100 */
1101void lysp_module_free(struct lysp_module *module);
1102
1103/**
Radek Krejci535ea9f2020-05-29 16:01:05 +02001104 * @defgroup scflags Schema compile flags
1105 * @ingroup schematree
1106 *
1107 * @{
1108 */
1109#define LYSC_OPT_RPC_INPUT LYS_CONFIG_W /**< Internal option when compiling schema tree of RPC/action input */
1110#define LYSC_OPT_RPC_OUTPUT LYS_CONFIG_R /**< Internal option when compiling schema tree of RPC/action output */
1111#define LYSC_OPT_RPC_MASK LYS_CONFIG_MASK /**< mask for the internal RPC options */
1112#define LYSC_OPT_FREE_SP 0x04 /**< Free the input printable schema */
1113#define LYSC_OPT_INTERNAL 0x08 /**< Internal compilation caused by dependency */
1114#define LYSC_OPT_NOTIFICATION 0x10 /**< Internal option when compiling schema tree of Notification */
1115
1116#define LYSC_OPT_GROUPING 0x20 /** Compiling (validation) of a non-instantiated grouping.
1117 In this case not all the restrictions are checked since they can be valid only
1118 in the real placement of the grouping. TODO - what specifically is not done */
1119/** @} scflags */
1120
1121/**
Radek Krejci0e59c312019-08-15 15:34:15 +02001122 * @brief Compiled YANG extension-stmt
1123 */
1124struct lysc_ext {
1125 const char *name; /**< extension name */
1126 const char *argument; /**< argument name, NULL if not specified */
Radek Krejci0e59c312019-08-15 15:34:15 +02001127 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1128 struct lyext_plugin *plugin; /**< Plugin implementing the specific extension */
Radek Krejci0935f412019-08-20 16:15:18 +02001129 struct lys_module *module; /**< module structure */
Michal Vasko6f4cbb62020-02-28 11:15:47 +01001130 uint32_t refcount; /**< reference counter since extension definition is shared among all its instances */
Radek Krejci0e59c312019-08-15 15:34:15 +02001131 uint16_t flags; /**< LYS_STATUS_* value (@ref snodeflags) */
1132};
1133
1134/**
Radek Krejcice8c1592018-10-29 15:35:51 +01001135 * @brief YANG extension instance
1136 */
1137struct lysc_ext_instance {
Radek Krejciad5963b2019-09-06 16:03:05 +02001138 uint32_t insubstmt_index; /**< in case the instance is in a substatement that can appear multiple times,
1139 this identifies the index of the substatement for this extension instance */
Radek Krejci28681fa2019-09-06 13:08:45 +02001140 struct lys_module *module; /**< module where the extension instantiated is defined */
Radek Krejciad5963b2019-09-06 16:03:05 +02001141 struct lysc_ext *def; /**< pointer to the extension definition */
Radek Krejcice8c1592018-10-29 15:35:51 +01001142 void *parent; /**< pointer to the parent element holding the extension instance(s), use
1143 ::lysc_ext_instance#parent_type to access the schema element */
1144 const char *argument; /**< optional value of the extension's argument */
1145 LYEXT_SUBSTMT insubstmt; /**< value identifying placement of the extension instance */
Radek Krejci2a408df2018-10-29 16:32:26 +01001146 LYEXT_PARENT parent_type; /**< type of the parent structure */
Radek Krejci2a408df2018-10-29 16:32:26 +01001147 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci0e59c312019-08-15 15:34:15 +02001148 void *data; /**< private plugins's data, not used by libyang */
Radek Krejcice8c1592018-10-29 15:35:51 +01001149};
1150
1151/**
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001152 * @brief Compiled YANG if-feature-stmt
1153 */
1154struct lysc_iffeature {
1155 uint8_t *expr; /**< 2bits array describing the if-feature expression in prefix format, see @ref ifftokens */
1156 struct lysc_feature **features; /**< array of pointers to the features used in expression ([sized array](@ref sizedarrays)) */
1157};
1158
1159/**
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001160 * @brief YANG when-stmt
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001161 */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001162struct lysc_when {
Radek Krejcia0f704a2019-09-09 16:12:23 +02001163 struct lys_module *module; /**< module where the must was defined */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001164 struct lyxp_expr *cond; /**< XPath when condition */
Michal Vasko175012e2019-11-06 15:49:14 +01001165 struct lysc_node *context; /**< context node for evaluating the expression, NULL if the context is root node */
Radek Krejcic8b31002019-01-08 10:24:45 +01001166 const char *dsc; /**< description */
1167 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001168 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci00b874b2019-02-12 10:54:50 +01001169 uint32_t refcount; /**< reference counter since some of the when statements are shared among several nodes */
Michal Vaskoecd62de2019-11-13 12:35:11 +01001170 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS is allowed */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001171};
1172
1173/**
Radek Krejci2a408df2018-10-29 16:32:26 +01001174 * @brief YANG identity-stmt
1175 */
1176struct lysc_ident {
1177 const char *name; /**< identity name (mandatory), including possible prefix */
Radek Krejcic8b31002019-01-08 10:24:45 +01001178 const char *dsc; /**< description */
1179 const char *ref; /**< reference */
Radek Krejci693262f2019-04-29 15:23:20 +02001180 struct lys_module *module; /**< module structure */
Radek Krejci2a408df2018-10-29 16:32:26 +01001181 struct lysc_ident **derived; /**< list of (pointers to the) derived identities ([sized array](@ref sizedarrays)) */
1182 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001183 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejci2a408df2018-10-29 16:32:26 +01001184 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_ values are allowed */
1185};
1186
1187/**
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001188 * @brief YANG feature-stmt
1189 */
1190struct lysc_feature {
1191 const char *name; /**< feature name (mandatory) */
Radek Krejcic8b31002019-01-08 10:24:45 +01001192 const char *dsc; /**< description */
1193 const char *ref; /**< reference */
Radek Krejci693262f2019-04-29 15:23:20 +02001194 struct lys_module *module; /**< module structure */
Radek Krejci151a5b72018-10-19 14:21:44 +02001195 struct lysc_feature **depfeatures;/**< list of pointers to other features depending on this one ([sized array](@ref sizedarrays)) */
Radek Krejcice8c1592018-10-29 15:35:51 +01001196 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001197 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001198 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* and
1199 #LYS_FENABLED values allowed */
1200};
1201
Radek Krejci151a5b72018-10-19 14:21:44 +02001202/**
1203 * @defgroup ifftokens if-feature expression tokens
1204 * Tokens of if-feature expression used in ::lysc_iffeature#expr
1205 *
1206 * @{
1207 */
1208#define LYS_IFF_NOT 0x00 /**< operand "not" */
1209#define LYS_IFF_AND 0x01 /**< operand "and" */
1210#define LYS_IFF_OR 0x02 /**< operand "or" */
1211#define LYS_IFF_F 0x03 /**< feature */
Radek Krejci2ff0d572020-05-21 15:27:28 +02001212/** @} ifftokens */
Radek Krejci151a5b72018-10-19 14:21:44 +02001213
1214/**
Radek Krejcib7db73a2018-10-24 14:18:40 +02001215 * @brief Compiled YANG revision statement
1216 */
1217struct lysc_revision {
1218 char date[LY_REV_SIZE]; /**< revision-date (mandatory) */
1219 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1220};
1221
Radek Krejci2167ee12018-11-02 16:09:07 +01001222struct lysc_range {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001223 struct lysc_range_part {
Radek Krejci693262f2019-04-29 15:23:20 +02001224 union { /**< min boundary */
Radek Krejcie7b95092019-05-15 11:03:07 +02001225 int64_t min_64; /**< for int8, int16, int32, int64 and decimal64 ( >= LY_TYPE_DEC64) */
1226 uint64_t min_u64; /**< for uint8, uint16, uint32, uint64, string and binary ( < LY_TYPE_DEC64) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001227 };
Radek Krejci693262f2019-04-29 15:23:20 +02001228 union { /**< max boundary */
Radek Krejcie7b95092019-05-15 11:03:07 +02001229 int64_t max_64; /**< for int8, int16, int32, int64 and decimal64 ( >= LY_TYPE_DEC64) */
1230 uint64_t max_u64; /**< for uint8, uint16, uint32, uint64, string and binary ( < LY_TYPE_DEC64) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001231 };
Radek Krejci4f28eda2018-11-12 11:46:16 +01001232 } *parts; /**< compiled range expression ([sized array](@ref sizedarrays)) */
Radek Krejcic8b31002019-01-08 10:24:45 +01001233 const char *dsc; /**< description */
1234 const char *ref; /**< reference */
Radek Krejci2167ee12018-11-02 16:09:07 +01001235 const char *emsg; /**< error-message */
1236 const char *eapptag; /**< error-app-tag value */
1237 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1238};
1239
1240struct lysc_pattern {
Radek Krejci54579462019-04-30 12:47:06 +02001241 const char *expr; /**< original, not compiled, regular expression */
1242 pcre2_code *code; /**< compiled regular expression */
Radek Krejcic8b31002019-01-08 10:24:45 +01001243 const char *dsc; /**< description */
1244 const char *ref; /**< reference */
Radek Krejci2167ee12018-11-02 16:09:07 +01001245 const char *emsg; /**< error-message */
1246 const char *eapptag; /**< error-app-tag value */
1247 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci0f969882020-08-21 16:56:47 +02001248 uint32_t inverted : 1; /**< invert-match flag */
1249 uint32_t refcount : 31; /**< reference counter */
Radek Krejci2167ee12018-11-02 16:09:07 +01001250};
1251
1252struct lysc_must {
1253 struct lys_module *module; /**< module where the must was defined */
1254 struct lyxp_expr *cond; /**< XPath when condition */
Radek Krejcic8b31002019-01-08 10:24:45 +01001255 const char *dsc; /**< description */
1256 const char *ref; /**< reference */
Radek Krejci2167ee12018-11-02 16:09:07 +01001257 const char *emsg; /**< error-message */
1258 const char *eapptag; /**< error-app-tag value */
1259 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1260};
1261
1262struct lysc_type {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001263 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie7b95092019-05-15 11:03:07 +02001264 struct lysc_type_plugin *plugin; /**< type's plugin with built-in as well as user functions to canonize or validate the value of the type */
Radek Krejci2167ee12018-11-02 16:09:07 +01001265 LY_DATA_TYPE basetype; /**< Base type of the type */
1266 uint32_t refcount; /**< reference counter for type sharing */
1267};
1268
1269struct lysc_type_num {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001270 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie7b95092019-05-15 11:03:07 +02001271 struct lysc_type_plugin *plugin; /**< type's plugin with built-in as well as user functions to canonize or validate the value of the type */
Radek Krejci2167ee12018-11-02 16:09:07 +01001272 LY_DATA_TYPE basetype; /**< Base type of the type */
1273 uint32_t refcount; /**< reference counter for type sharing */
1274 struct lysc_range *range; /**< Optional range limitation */
1275};
1276
1277struct lysc_type_dec {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001278 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie7b95092019-05-15 11:03:07 +02001279 struct lysc_type_plugin *plugin; /**< type's plugin with built-in as well as user functions to canonize or validate the value of the type */
Radek Krejci2167ee12018-11-02 16:09:07 +01001280 LY_DATA_TYPE basetype; /**< Base type of the type */
1281 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci6cba4292018-11-15 17:33:29 +01001282 uint8_t fraction_digits; /**< fraction digits specification */
Radek Krejci2167ee12018-11-02 16:09:07 +01001283 struct lysc_range *range; /**< Optional range limitation */
1284};
1285
1286struct lysc_type_str {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001287 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie7b95092019-05-15 11:03:07 +02001288 struct lysc_type_plugin *plugin; /**< type's plugin with built-in as well as user functions to canonize or validate the value of the type */
Radek Krejci2167ee12018-11-02 16:09:07 +01001289 LY_DATA_TYPE basetype; /**< Base type of the type */
1290 uint32_t refcount; /**< reference counter for type sharing */
1291 struct lysc_range *length; /**< Optional length limitation */
Radek Krejci4586a022018-11-13 11:29:26 +01001292 struct lysc_pattern **patterns; /**< Optional list of pointers to pattern limitations ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001293};
1294
Radek Krejci693262f2019-04-29 15:23:20 +02001295struct lysc_type_bitenum_item {
1296 const char *name; /**< enumeration identifier */
1297 const char *dsc; /**< description */
1298 const char *ref; /**< reference */
1299 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1300 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1301 union {
1302 int32_t value; /**< integer value associated with the enumeration */
1303 uint32_t position; /**< non-negative integer value associated with the bit */
1304 };
1305 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_ and LYS_SET_VALUE
1306 values are allowed */
1307};
1308
Radek Krejci2167ee12018-11-02 16:09:07 +01001309struct lysc_type_enum {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001310 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie7b95092019-05-15 11:03:07 +02001311 struct lysc_type_plugin *plugin; /**< type's plugin with built-in as well as user functions to canonize or validate the value of the type */
Radek Krejci2167ee12018-11-02 16:09:07 +01001312 LY_DATA_TYPE basetype; /**< Base type of the type */
1313 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci693262f2019-04-29 15:23:20 +02001314 struct lysc_type_bitenum_item *enums; /**< enumerations list ([sized array](@ref sizedarrays)), mandatory (at least 1 item) */
1315};
1316
1317struct lysc_type_bits {
1318 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie7b95092019-05-15 11:03:07 +02001319 struct lysc_type_plugin *plugin; /**< type's plugin with built-in as well as user functions to canonize or validate the value of the type */
Radek Krejci693262f2019-04-29 15:23:20 +02001320 LY_DATA_TYPE basetype; /**< Base type of the type */
1321 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci849a62a2019-05-22 15:29:05 +02001322 struct lysc_type_bitenum_item *bits; /**< bits list ([sized array](@ref sizedarrays)), mandatory (at least 1 item),
1323 the items are ordered by their position value. */
Radek Krejci2167ee12018-11-02 16:09:07 +01001324};
1325
1326struct lysc_type_leafref {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001327 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie7b95092019-05-15 11:03:07 +02001328 struct lysc_type_plugin *plugin; /**< type's plugin with built-in as well as user functions to canonize or validate the value of the type */
Radek Krejci2167ee12018-11-02 16:09:07 +01001329 LY_DATA_TYPE basetype; /**< Base type of the type */
1330 uint32_t refcount; /**< reference counter for type sharing */
Michal Vasko004d3152020-06-11 19:59:22 +02001331 struct lyxp_expr *path; /**< parsed target path, compiled path cannot be stored because of type sharing */
Radek Krejci96a0bfd2018-11-22 15:25:06 +01001332 struct lys_module *path_context; /**< module where the path is defined, so it provides context to resolve prefixes */
Radek Krejci412ddfa2018-11-23 11:44:11 +01001333 struct lysc_type *realtype; /**< pointer to the real (first non-leafref in possible leafrefs chain) type. */
Radek Krejci2167ee12018-11-02 16:09:07 +01001334 uint8_t require_instance; /**< require-instance flag */
1335};
1336
1337struct lysc_type_identityref {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001338 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie7b95092019-05-15 11:03:07 +02001339 struct lysc_type_plugin *plugin; /**< type's plugin with built-in as well as user functions to canonize or validate the value of the type */
Radek Krejci2167ee12018-11-02 16:09:07 +01001340 LY_DATA_TYPE basetype; /**< Base type of the type */
1341 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci555cb5b2018-11-16 14:54:33 +01001342 struct lysc_ident **bases; /**< list of pointers to the base identities ([sized array](@ref sizedarrays)),
Radek Krejci2167ee12018-11-02 16:09:07 +01001343 mandatory (at least 1 item) */
1344};
1345
1346struct lysc_type_instanceid {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001347 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie7b95092019-05-15 11:03:07 +02001348 struct lysc_type_plugin *plugin; /**< type's plugin with built-in as well as user functions to canonize or validate the value of the type */
Radek Krejci2167ee12018-11-02 16:09:07 +01001349 LY_DATA_TYPE basetype; /**< Base type of the type */
1350 uint32_t refcount; /**< reference counter for type sharing */
1351 uint8_t require_instance; /**< require-instance flag */
1352};
1353
Radek Krejci2167ee12018-11-02 16:09:07 +01001354struct lysc_type_union {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001355 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie7b95092019-05-15 11:03:07 +02001356 struct lysc_type_plugin *plugin; /**< type's plugin with built-in as well as user functions to canonize or validate the value of the type */
Radek Krejci2167ee12018-11-02 16:09:07 +01001357 LY_DATA_TYPE basetype; /**< Base type of the type */
1358 uint32_t refcount; /**< reference counter for type sharing */
1359 struct lysc_type **types; /**< list of types in the union ([sized array](@ref sizedarrays)), mandatory (at least 1 item) */
1360};
1361
1362struct lysc_type_bin {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001363 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie7b95092019-05-15 11:03:07 +02001364 struct lysc_type_plugin *plugin; /**< type's plugin with built-in as well as user functions to canonize or validate the value of the type */
Radek Krejci2167ee12018-11-02 16:09:07 +01001365 LY_DATA_TYPE basetype; /**< Base type of the type */
1366 uint32_t refcount; /**< reference counter for type sharing */
1367 struct lysc_range *length; /**< Optional length limitation */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001368};
1369
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001370struct lysc_action_inout {
1371 struct lysc_node *data; /**< first child node (linked list) */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001372 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1373};
1374
Michal Vasko60ea6352020-06-29 13:39:39 +02001375/**
1376 * @brief Maximum number of hashes stored in a schema node.
1377 */
1378#define LYS_NODE_HASH_COUNT 4
1379
Radek Krejci056d0a82018-12-06 16:57:25 +01001380struct lysc_action {
Michal Vasko1bf09392020-03-27 12:38:10 +01001381 uint16_t nodetype; /**< LYS_RPC or LYS_ACTION */
Radek Krejci056d0a82018-12-06 16:57:25 +01001382 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Michal Vasko60ea6352020-06-29 13:39:39 +02001383 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser */
Radek Krejci95710c92019-02-11 15:49:55 +01001384 struct lys_module *module; /**< module structure */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001385 struct lysp_action *sp; /**< simply parsed (SP) original of the node, NULL if the SP schema was removed or in case of implicit case node. */
1386 struct lysc_node *parent; /**< parent node (NULL in case of top level node - RPC) */
1387
Radek Krejcifc11bd72019-04-11 16:00:05 +02001388 struct lysc_ext_instance *input_exts; /**< list of the extension instances of input ([sized array](@ref sizedarrays)) */
1389 struct lysc_ext_instance *output_exts; /**< list of the extension instances of outpu ([sized array](@ref sizedarrays)) */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001390
Radek Krejci056d0a82018-12-06 16:57:25 +01001391 const char *name; /**< action/RPC name (mandatory) */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001392 const char *dsc; /**< description */
1393 const char *ref; /**< reference */
1394
Radek Krejcifc11bd72019-04-11 16:00:05 +02001395 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1396 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1397
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001398 struct lysc_action_inout input; /**< RPC's/action's input */
1399 struct lysc_action_inout output; /**< RPC's/action's output */
1400
Michal Vasko2fd91b92020-07-17 16:39:02 +02001401 void *priv; /** private arbitrary user data, not used by libyang */
1402
Radek Krejci056d0a82018-12-06 16:57:25 +01001403};
1404
1405struct lysc_notif {
1406 uint16_t nodetype; /**< LYS_NOTIF */
1407 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Michal Vasko60ea6352020-06-29 13:39:39 +02001408 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser */
Radek Krejci95710c92019-02-11 15:49:55 +01001409 struct lys_module *module; /**< module structure */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001410 struct lysp_notif *sp; /**< simply parsed (SP) original of the node, NULL if the SP schema was removed or in case of implicit case node. */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001411 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1412
Radek Krejcifc11bd72019-04-11 16:00:05 +02001413 struct lysc_node *data; /**< first child node (linked list) */
1414 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1415
Radek Krejci056d0a82018-12-06 16:57:25 +01001416 const char *name; /**< Notification name (mandatory) */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001417 const char *dsc; /**< description */
1418 const char *ref; /**< reference */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001419
1420 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1421 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Michal Vasko2fd91b92020-07-17 16:39:02 +02001422
1423 void *priv; /** private arbitrary user data, not used by libyang */
Radek Krejci056d0a82018-12-06 16:57:25 +01001424};
1425
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001426/**
Radek Krejci0af5f5d2018-09-07 15:00:30 +02001427 * @brief Compiled YANG data node
1428 */
1429struct lysc_node {
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001430 uint16_t nodetype; /**< type of the node (mandatory) */
1431 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Michal Vasko60ea6352020-06-29 13:39:39 +02001432 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001433 struct lys_module *module; /**< module structure */
Michal Vaskocc048b22020-03-27 15:52:38 +01001434 struct lysp_node *sp; /**< simply parsed (SP) original of the node, NULL if the SP schema was removed or
1435 in case of implicit case node. */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001436 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1437 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1438 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1439 never NULL. If there is no sibling node, pointer points to the node
1440 itself. In case of the first node, this pointer points to the last
1441 node in the list. */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001442 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001443 const char *dsc; /**< description */
1444 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001445 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci056d0a82018-12-06 16:57:25 +01001446 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001447 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Michal Vasko2fd91b92020-07-17 16:39:02 +02001448 void *priv; /**< private arbitrary user data, not used by libyang */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001449};
1450
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001451struct lysc_node_container {
1452 uint16_t nodetype; /**< LYS_CONTAINER */
1453 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Michal Vasko60ea6352020-06-29 13:39:39 +02001454 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001455 struct lys_module *module; /**< module structure */
1456 struct lysp_node *sp; /**< simply parsed (SP) original of the node, NULL if the SP schema was removed or in case of implicit case node. */
1457 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1458 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1459 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1460 never NULL. If there is no sibling node, pointer points to the node
1461 itself. In case of the first node, this pointer points to the last
1462 node in the list. */
1463 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001464 const char *dsc; /**< description */
1465 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001466 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001467 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001468 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Michal Vasko2fd91b92020-07-17 16:39:02 +02001469 void *priv; /**< private arbitrary user data, not used by libyang */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001470
1471 struct lysc_node *child; /**< first child node (linked list) */
1472 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1473 struct lysc_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
1474 struct lysc_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001475};
1476
Radek Krejcia3045382018-11-22 14:30:31 +01001477struct lysc_node_case {
Radek Krejci056d0a82018-12-06 16:57:25 +01001478 uint16_t nodetype; /**< LYS_CASE */
1479 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Michal Vasko60ea6352020-06-29 13:39:39 +02001480 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser, unused */
Radek Krejci056d0a82018-12-06 16:57:25 +01001481 struct lys_module *module; /**< module structure */
1482 struct lysp_node *sp; /**< simply parsed (SP) original of the node, NULL if the SP schema was removed or in case of implicit case node. */
1483 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1484 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1485 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1486 never NULL. If there is no sibling node, pointer points to the node
1487 itself. In case of the first node, this pointer points to the last
1488 node in the list. */
Radek Krejcia3045382018-11-22 14:30:31 +01001489 const char *name; /**< name of the case, including the implicit case */
Radek Krejci12fb9142019-01-08 09:45:30 +01001490 const char *dsc; /**< description */
1491 const char *ref; /**< reference */
Radek Krejci056d0a82018-12-06 16:57:25 +01001492 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci056d0a82018-12-06 16:57:25 +01001493 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001494 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Michal Vasko2fd91b92020-07-17 16:39:02 +02001495 void *priv; /**< private arbitrary user data, not used by libyang */
Radek Krejci056d0a82018-12-06 16:57:25 +01001496
Radek Krejcia3045382018-11-22 14:30:31 +01001497 struct lysc_node *child; /**< first child node of the case (linked list). Note that all the children of all the sibling cases are linked
Radek Krejcife13da42019-02-15 14:51:01 +01001498 each other as siblings with the parent pointer pointing to appropriate case node. */
Radek Krejcia3045382018-11-22 14:30:31 +01001499};
1500
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001501struct lysc_node_choice {
1502 uint16_t nodetype; /**< LYS_CHOICE */
1503 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Michal Vasko60ea6352020-06-29 13:39:39 +02001504 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser, unused */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001505 struct lys_module *module; /**< module structure */
1506 struct lysp_node *sp; /**< simply parsed (SP) original of the node, NULL if the SP schema was removed or in case of implicit case node. */
1507 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1508 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1509 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1510 never NULL. If there is no sibling node, pointer points to the node
1511 itself. In case of the first node, this pointer points to the last
1512 node in the list. */
1513 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001514 const char *dsc; /**< description */
1515 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001516 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci056d0a82018-12-06 16:57:25 +01001517 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001518 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Michal Vasko2fd91b92020-07-17 16:39:02 +02001519 void *priv; /**< private arbitrary user data, not used by libyang */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001520
Radek Krejcia9026eb2018-12-12 16:04:47 +01001521 struct lysc_node_case *cases; /**< list of the cases (linked list). Note that all the children of all the cases are linked each other
1522 as siblings. Their parent pointers points to the specific case they belongs to, so distinguish the
1523 case is simple. */
Radek Krejci056d0a82018-12-06 16:57:25 +01001524 struct lysc_node_case *dflt; /**< default case of the choice, only a pointer into the cases array. */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001525};
1526
1527struct lysc_node_leaf {
1528 uint16_t nodetype; /**< LYS_LEAF */
1529 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Michal Vasko60ea6352020-06-29 13:39:39 +02001530 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001531 struct lys_module *module; /**< module structure */
1532 struct lysp_node *sp; /**< simply parsed (SP) original of the node, NULL if the SP schema was removed or in case of implicit case node. */
1533 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1534 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1535 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1536 never NULL. If there is no sibling node, pointer points to the node
1537 itself. In case of the first node, this pointer points to the last
1538 node in the list. */
1539 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001540 const char *dsc; /**< description */
1541 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001542 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001543 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001544 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Michal Vasko2fd91b92020-07-17 16:39:02 +02001545 void *priv; /**< private arbitrary user data, not used by libyang */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001546
1547 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1548 struct lysc_type *type; /**< type of the leaf node (mandatory) */
Radek Krejcib57cf1e2018-11-23 14:07:05 +01001549
Radek Krejci4f28eda2018-11-12 11:46:16 +01001550 const char *units; /**< units of the leaf's type */
Radek Krejcia1911222019-07-22 17:24:50 +02001551 struct lyd_value *dflt; /**< default value */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001552};
1553
1554struct lysc_node_leaflist {
1555 uint16_t nodetype; /**< LYS_LEAFLIST */
1556 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Michal Vasko60ea6352020-06-29 13:39:39 +02001557 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001558 struct lys_module *module; /**< module structure */
1559 struct lysp_node *sp; /**< simply parsed (SP) original of the node, NULL if the SP schema was removed or in case of implicit case node. */
1560 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1561 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1562 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1563 never NULL. If there is no sibling node, pointer points to the node
1564 itself. In case of the first node, this pointer points to the last
1565 node in the list. */
1566 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001567 const char *dsc; /**< description */
1568 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001569 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcib57cf1e2018-11-23 14:07:05 +01001570 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001571 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Michal Vasko2fd91b92020-07-17 16:39:02 +02001572 void *priv; /**< private arbitrary user data, not used by libyang */
Radek Krejcib57cf1e2018-11-23 14:07:05 +01001573
1574 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1575 struct lysc_type *type; /**< type of the leaf node (mandatory) */
1576
Radek Krejci0e5d8382018-11-28 16:37:53 +01001577 const char *units; /**< units of the leaf's type */
Radek Krejcid0ef1af2019-07-23 12:22:05 +02001578 struct lyd_value **dflts; /**< list ([sized array](@ref sizedarrays)) of default values */
Michal Vaskoba99a3e2020-08-18 15:50:05 +02001579
Radek Krejci0e5d8382018-11-28 16:37:53 +01001580 uint32_t min; /**< min-elements constraint */
1581 uint32_t max; /**< max-elements constraint */
1582
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001583};
1584
1585struct lysc_node_list {
1586 uint16_t nodetype; /**< LYS_LIST */
1587 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Michal Vasko60ea6352020-06-29 13:39:39 +02001588 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001589 struct lys_module *module; /**< module structure */
1590 struct lysp_node *sp; /**< simply parsed (SP) original of the node, NULL if the SP schema was removed or in case of implicit case node. */
1591 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1592 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1593 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1594 never NULL. If there is no sibling node, pointer points to the node
1595 itself. In case of the first node, this pointer points to the last
1596 node in the list. */
1597 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001598 const char *dsc; /**< description */
1599 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001600 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci9bb94eb2018-12-04 16:48:35 +01001601 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001602 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Michal Vasko2fd91b92020-07-17 16:39:02 +02001603 void *priv; /**< private arbitrary user data, not used by libyang */
Radek Krejci9bb94eb2018-12-04 16:48:35 +01001604
1605 struct lysc_node *child; /**< first child node (linked list) */
1606 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1607 struct lysc_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
1608 struct lysc_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
1609
Radek Krejci9bb94eb2018-12-04 16:48:35 +01001610 struct lysc_node_leaf ***uniques; /**< list of sized arrays of pointers to the unique nodes ([sized array](@ref sizedarrays)) */
1611 uint32_t min; /**< min-elements constraint */
1612 uint32_t max; /**< max-elements constraint */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001613};
1614
1615struct lysc_node_anydata {
1616 uint16_t nodetype; /**< LYS_ANYXML or LYS_ANYDATA */
1617 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Michal Vasko60ea6352020-06-29 13:39:39 +02001618 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001619 struct lys_module *module; /**< module structure */
1620 struct lysp_node *sp; /**< simply parsed (SP) original of the node, NULL if the SP schema was removed or in case of implicit case node. */
1621 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1622 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1623 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1624 never NULL. If there is no sibling node, pointer points to the node
1625 itself. In case of the first node, this pointer points to the last
1626 node in the list. */
1627 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001628 const char *dsc; /**< description */
1629 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001630 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci056d0a82018-12-06 16:57:25 +01001631 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001632 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Michal Vasko2fd91b92020-07-17 16:39:02 +02001633 void *priv; /**< private arbitrary user data, not used by libyang */
Radek Krejci9800fb82018-12-13 14:26:23 +01001634
1635 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001636};
1637
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001638/**
1639 * @brief Compiled YANG schema tree structure representing YANG module.
1640 *
1641 * Semantically validated YANG schema tree for data tree parsing.
1642 * Contains only the necessary information for the data validation.
1643 */
1644struct lysc_module {
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001645 struct lys_module *mod; /**< covering module structure */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001646
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001647 struct lysc_feature *features; /**< list of feature definitions ([sized array](@ref sizedarrays)) */
Radek Krejci2a408df2018-10-29 16:32:26 +01001648 struct lysc_ident *identities; /**< list of identities ([sized array](@ref sizedarrays)) */
1649 struct lysc_node *data; /**< list of module's top-level data nodes (linked list) */
1650 struct lysc_action *rpcs; /**< list of RPCs ([sized array](@ref sizedarrays)) */
1651 struct lysc_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejcice8c1592018-10-29 15:35:51 +01001652 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vasko57c10cd2020-05-27 15:57:11 +02001653 struct lys_module **deviated_by; /**< List of modules that deviate this module ([sized array](@ref sizedarrays)) */
Michal Vaskoa3af5982020-06-29 11:51:37 +02001654 struct lys_module **augmented_by;/**< List of modules that augment this module ([sized array](@ref sizedarrays)) */
Radek Krejci0af5f5d2018-09-07 15:00:30 +02001655};
1656
1657/**
Radek Krejci53ea6152018-12-13 15:21:15 +01001658 * @brief Get the groupings sized array of the given (parsed) schema node.
1659 * Decides the node's type and in case it has a groupings array, returns it.
1660 * @param[in] node Node to examine.
1661 * @return The node's groupings sized array if any, NULL otherwise.
1662 */
1663const struct lysp_grp *lysp_node_groupings(const struct lysp_node *node);
1664
1665/**
Radek Krejci056d0a82018-12-06 16:57:25 +01001666 * @brief Get the typedefs sized array of the given (parsed) schema node.
1667 * Decides the node's type and in case it has a typedefs array, returns it.
1668 * @param[in] node Node to examine.
1669 * @return The node's typedefs sized array if any, NULL otherwise.
1670 */
1671const struct lysp_tpdf *lysp_node_typedefs(const struct lysp_node *node);
1672
1673/**
1674 * @brief Get the actions/RPCs sized array of the given (parsed) schema node.
1675 * Decides the node's type and in case it has a actions/RPCs array, returns it.
1676 * @param[in] node Node to examine.
1677 * @return The node's actions/RPCs sized array if any, NULL otherwise.
1678 */
1679const struct lysp_action *lysp_node_actions(const struct lysp_node *node);
1680
1681/**
1682 * @brief Get the Notifications sized array of the given (parsed) schema node.
1683 * Decides the node's type and in case it has a Notifications array, returns it.
1684 * @param[in] node Node to examine.
1685 * @return The node's Notifications sized array if any, NULL otherwise.
1686 */
1687const struct lysp_notif *lysp_node_notifs(const struct lysp_node *node);
1688
1689/**
1690 * @brief Get the children linked list of the given (parsed) schema node.
1691 * Decides the node's type and in case it has a children list, returns it.
1692 * @param[in] node Node to examine.
1693 * @return The node's children linked list if any, NULL otherwise.
1694 */
1695const struct lysp_node *lysp_node_children(const struct lysp_node *node);
1696
1697/**
1698 * @brief Get the actions/RPCs sized array of the given (compiled) schema node.
1699 * Decides the node's type and in case it has a actions/RPCs array, returns it.
1700 * @param[in] node Node to examine.
1701 * @return The node's actions/RPCs sized array if any, NULL otherwise.
1702 */
1703const struct lysc_action *lysc_node_actions(const struct lysc_node *node);
1704
1705/**
1706 * @brief Get the Notifications sized array of the given (compiled) schema node.
1707 * Decides the node's type and in case it has a Notifications array, returns it.
1708 * @param[in] node Node to examine.
1709 * @return The node's Notifications sized array if any, NULL otherwise.
1710 */
1711const struct lysc_notif *lysc_node_notifs(const struct lysc_node *node);
1712
1713/**
1714 * @brief Get the children linked list of the given (compiled) schema node.
1715 * Decides the node's type and in case it has a children list, returns it.
1716 * @param[in] node Node to examine.
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001717 * @param[in] flags Config flag to distinguish input (LYS_CONFIG_W) and output (LYS_CONFIG_R) data in case of RPC/action node.
Radek Krejci056d0a82018-12-06 16:57:25 +01001718 * @return The node's children linked list if any, NULL otherwise.
1719 */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001720const struct lysc_node *lysc_node_children(const struct lysc_node *node, uint16_t flags);
Radek Krejci056d0a82018-12-06 16:57:25 +01001721
1722/**
Michal Vaskod975f862020-06-23 13:29:28 +02001723 * @brief Examine whether a node is user-ordered list or leaf-list.
1724 *
1725 * @param[in] node Node to examine.
1726 * @return non-zero if it is,
1727 * @return 0 if not.
1728 */
1729int lysc_is_userordered(const struct lysc_node *schema);
1730
1731/**
Michal Vasko2fd91b92020-07-17 16:39:02 +02001732 * @brief Set a schema private pointer to a user pointer.
1733 *
1734 * @param[in] node Node, whose private field will be assigned. Works also for RPCs, actions, and notifications.
1735 * @param[in] priv Arbitrary user-specified pointer.
1736 * @param[out] prev Optional previous private object of the \p node. Note, that
1737 * the caller is in this case responsible (if it is necessary) for freeing the replaced private object.
1738 * @return LY_ERR value.
1739 */
1740LY_ERR lysc_set_private(const struct lysc_node *node, void *priv, void **prev);
1741
1742/**
Radek Krejci151a5b72018-10-19 14:21:44 +02001743 * @brief Get how the if-feature statement currently evaluates.
1744 *
1745 * @param[in] iff Compiled if-feature statement to evaluate.
Michal Vasko28d78432020-05-26 13:10:53 +02001746 * @return LY_SUCCESS if the statement evaluates to true,
1747 * @return LY_ENOT if it evaluates to false,
1748 * @return LY_ERR on error.
Radek Krejci151a5b72018-10-19 14:21:44 +02001749 */
Michal Vasko28d78432020-05-26 13:10:53 +02001750LY_ERR lysc_iffeature_value(const struct lysc_iffeature *iff);
Radek Krejci151a5b72018-10-19 14:21:44 +02001751
1752/**
1753 * @brief Get the current status of the provided feature.
1754 *
1755 * @param[in] feature Compiled feature statement to examine.
Michal Vasko28d78432020-05-26 13:10:53 +02001756 * @return LY_SUCCESS if feature is enabled,
1757 * @return LY_ENOT if feature is disabled,
1758 * @return LY_ERR in case of error (invalid argument)
Radek Krejci151a5b72018-10-19 14:21:44 +02001759 */
Michal Vasko28d78432020-05-26 13:10:53 +02001760LY_ERR lysc_feature_value(const struct lysc_feature *feature);
Radek Krejci151a5b72018-10-19 14:21:44 +02001761
Michal Vasko072de482020-08-05 13:27:21 +02001762#define LYXP_SCNODE 0x02 /**< No special tree access modifiers. */
1763#define LYXP_SCNODE_SCHEMA 0x04 /**< Apply node access restrictions defined for 'when' and 'must' evaluation. */
1764#define LYXP_SCNODE_OUTPUT 0x08 /**< Search RPC/action output nodes instead of input ones. */
1765
Radek Krejci151a5b72018-10-19 14:21:44 +02001766/**
Michal Vasko519fd602020-05-26 12:17:39 +02001767 * @brief Get all the schema nodes (atoms) that are required for \p xpath to be evaluated.
1768 *
1769 * @param[in] ctx_node XPath schema context node.
1770 * @param[in] xpath Data XPath expression filtering the matching nodes. ::LYD_JSON format is expected.
1771 * @param[in] options Whether to apply some node access restrictions, one of the options should always be used.
1772 * If none is set, ::LYXP_SCNODE is used.
1773 * @param[out] set Set of found atoms (schema nodes).
1774 * @return LY_SUCCESS on success, @p set is returned.
1775 * @return LY_ERR value if an error occurred.
1776 */
1777LY_ERR lys_atomize_xpath(const struct lysc_node *ctx_node, const char *xpath, int options, struct ly_set **set);
1778
Michal Vasko072de482020-08-05 13:27:21 +02001779/**
1780 * @brief Evaluate an \p xpath expression on schema nodes.
1781 *
1782 * @param[in] ctx_node XPath schema context node.
1783 * @param[in] xpath Data XPath expression filtering the matching nodes. ::LYD_JSON format is expected.
1784 * @param[in] options Whether to apply some node access restrictions, one of the options should always be used.
1785 * If none is set, ::LYXP_SCNODE is used.
1786 * @param[out] set Set of found schema nodes.
1787 * @return LY_SUCCESS on success, @p set is returned.
1788 * @return LY_ERR value if an error occurred.
1789 */
1790LY_ERR lys_find_xpath(const struct lysc_node *ctx_node, const char *xpath, int options, struct ly_set **set);
Michal Vasko519fd602020-05-26 12:17:39 +02001791
1792/**
Michal Vasko03ff5a72019-09-11 13:49:33 +02001793 * @brief Types of the different schema paths.
1794 */
1795typedef enum {
Michal Vasko65de0402020-08-03 16:34:19 +02001796 LYSC_PATH_LOG, /**< Descriptive path format used in log messages */
1797 LYSC_PATH_DATA /**< Similar to ::LYSC_PATH_LOG except that schema-only nodes (choice, case) are skipped */
Michal Vasko03ff5a72019-09-11 13:49:33 +02001798} LYSC_PATH_TYPE;
1799
1800/**
Radek Krejci327de162019-06-14 12:52:07 +02001801 * @brief Generate path of the given node in the requested format.
1802 *
1803 * @param[in] node Schema path of this node will be generated.
1804 * @param[in] pathtype Format of the path to generate.
Radek Krejci1c0c3442019-07-23 16:08:47 +02001805 * @param[in,out] buffer Prepared buffer of the @p buflen length to store the generated path.
1806 * If NULL, memory for the complete path is allocated.
1807 * @param[in] buflen Size of the provided @p buffer.
Radek Krejci327de162019-06-14 12:52:07 +02001808 * @return NULL in case of memory allocation error, path of the node otherwise.
Radek Krejci1c0c3442019-07-23 16:08:47 +02001809 * In case the @p buffer is NULL, the returned string is dynamically allocated and caller is responsible to free it.
Radek Krejci327de162019-06-14 12:52:07 +02001810 */
Michal Vasko03ff5a72019-09-11 13:49:33 +02001811char *lysc_path(const struct lysc_node *node, LYSC_PATH_TYPE pathtype, char *buffer, size_t buflen);
Radek Krejci327de162019-06-14 12:52:07 +02001812
1813/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001814 * @brief Available YANG schema tree structures representing YANG module.
1815 */
1816struct lys_module {
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001817 struct ly_ctx *ctx; /**< libyang context of the module (mandatory) */
1818 const char *name; /**< name of the module (mandatory) */
Radek Krejci0af46292019-01-11 16:02:31 +01001819 const char *revision; /**< revision of the module (if present) */
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001820 const char *ns; /**< namespace of the module (module - mandatory) */
1821 const char *prefix; /**< module prefix or submodule belongsto prefix of main module (mandatory) */
1822 const char *filepath; /**< path, if the schema was read from a file, NULL in case of reading from memory */
1823 const char *org; /**< party/company responsible for the module */
1824 const char *contact; /**< contact information for the module */
1825 const char *dsc; /**< description of the module */
1826 const char *ref; /**< cross-reference for the module */
1827
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001828 struct lysp_module *parsed; /**< Simply parsed (unresolved) YANG schema tree */
Radek Krejci0af46292019-01-11 16:02:31 +01001829 struct lysc_module *compiled; /**< Compiled and fully validated YANG schema tree for data parsing.
1830 Available only for implemented modules. */
Michal Vasko33ff9422020-07-03 09:50:39 +02001831 struct lysc_feature *dis_features;/**< List of pre-compiled features in a non implemented module ([sized array](@ref sizedarrays)).
Radek Krejci0af46292019-01-11 16:02:31 +01001832 These features are always disabled and cannot be enabled until the module
Michal Vasko33ff9422020-07-03 09:50:39 +02001833 is implemented. The features are present in this form to allow their linkage
Radek Krejci0af46292019-01-11 16:02:31 +01001834 from if-feature statements of the compiled schemas and their proper use in case
1835 the module became implemented in future (no matter if implicitly via augment/deviate
1836 or explicitly via ly_ctx_module_implement()). */
Michal Vasko33ff9422020-07-03 09:50:39 +02001837 struct lysc_ident *dis_identities;/**< List of pre-compiled identities in a non-implemented module ([sized array](@ref sizedarrays))
1838 These identities cannot be instantiated in data (in identityrefs) until
1839 the module is implemented but can be linked by identities in implemented
1840 modules. */
Radek Krejci95710c92019-02-11 15:49:55 +01001841 uint8_t implemented; /**< flag if the module is implemented, not just imported. The module is implemented if
1842 the flag has non-zero value. Specific values are used internally:
1843 1 - implemented module
Radek Krejcia46012b2020-08-12 15:41:04 +02001844 >1 - recently implemented module by dependency, it can be reverted in rollback procedure */
Radek Krejci95710c92019-02-11 15:49:55 +01001845 uint8_t latest_revision; /**< flag to mark the latest available revision:
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001846 1 - the latest revision in searchdirs was not searched yet and this is the
1847 latest revision in the current context
1848 2 - searchdirs were searched and this is the latest available revision */
1849 uint8_t version; /**< yang-version (LYS_VERSION values) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001850};
1851
Radek Krejci151a5b72018-10-19 14:21:44 +02001852/**
1853 * @brief Enable specified feature in the module
1854 *
1855 * By default, when the module is loaded by libyang parser, all features are disabled.
1856 *
Radek Krejcica3db002018-11-01 10:31:01 +01001857 * If all features are being enabled, it must be possible respecting their if-feature conditions. For example,
1858 * enabling all features on the following feature set will fail since it is not possible to enable both features
1859 * (and it is unclear which of them should be enabled then). In this case the LY_EDENIED is returned and the feature
1860 * is untouched.
1861 *
1862 * feature f1;
1863 * feature f2 { if-feature 'not f1';}
1864 *
Radek Krejci151a5b72018-10-19 14:21:44 +02001865 * @param[in] module Module where the feature will be enabled.
1866 * @param[in] feature Name of the feature to enable. To enable all features at once, use asterisk (`*`) character.
Michal Vasko82c31e62020-07-17 15:30:40 +02001867 * @return LY_SUCCESS on success,
1868 * @return LY_EINVAL if @p module is not implemented,
1869 * @return LY_ENOTFOUND if @p feature was not found,
1870 * @return LY_EDENIED if @p feature could not be enabled because it has some false if-feature statements.
Radek Krejci151a5b72018-10-19 14:21:44 +02001871 */
Radek Krejcied5acc52019-04-25 15:57:04 +02001872LY_ERR lys_feature_enable(const struct lys_module *module, const char *feature);
Radek Krejci151a5b72018-10-19 14:21:44 +02001873
1874/**
1875 * @brief Disable specified feature in the module
1876 *
1877 * By default, when the module is loaded by libyang parser, all features are disabled.
1878 *
Michal Vasko82c31e62020-07-17 15:30:40 +02001879 * If disabling a feature causes some other features that depend on this feature to become disabled.
1880 *
Radek Krejci151a5b72018-10-19 14:21:44 +02001881 * @param[in] module Module where the feature will be disabled.
1882 * @param[in] feature Name of the feature to disable. To disable all features at once, use asterisk (`*`) character.
Michal Vasko82c31e62020-07-17 15:30:40 +02001883 * @return LY_SUCCESS on success,
1884 * @return LY_EINVAL if @p module is not implemented,
1885 * @return LY_ENOTFOUND if @p feature was not found.
Radek Krejci151a5b72018-10-19 14:21:44 +02001886 */
Radek Krejcied5acc52019-04-25 15:57:04 +02001887LY_ERR lys_feature_disable(const struct lys_module *module, const char *feature);
Radek Krejci151a5b72018-10-19 14:21:44 +02001888
1889/**
Michal Vasko82c31e62020-07-17 15:30:40 +02001890 * @brief Enable specified feature in the module disregarding its if-features.
1891 *
1892 * @param[in] module Module where the feature will be enabled.
1893 * @param[in] feature Name of the feature to enable. To enable all features at once, use asterisk character.
1894 * @return LY_SUCCESS on success,
1895 * @return LY_EINVAL if @p module is not implemented,
1896 * @return LY_ENOTFOUND if @p feature was not found.
1897 */
1898LY_ERR lys_feature_enable_force(const struct lys_module *module, const char *feature);
1899
1900/**
1901 * @brief Disable specified feature in the module disregarding dependant features.
1902 *
1903 * By default, when the module is loaded by libyang parser, all features are disabled.
1904 *
1905 * @param[in] module Module where the feature will be disabled.
1906 * @param[in] feature Name of the feature to disable. To disable all features at once, use asterisk character.
1907 * @return LY_SUCCESS on success,
1908 * @return LY_EINVAL if @p module is not implemented,
1909 * @return LY_ENOTFOUND if @p feature was not found.
1910 */
1911LY_ERR lys_feature_disable_force(const struct lys_module *module, const char *feature);
1912
1913/**
1914 * @brief Get the current real status of the specified feature in the module.
1915 *
1916 * If the feature is enabled, but some of its if-features are false, the feature is considered
1917 * disabled.
Radek Krejci151a5b72018-10-19 14:21:44 +02001918 *
1919 * @param[in] module Module where the feature is defined.
1920 * @param[in] feature Name of the feature to inspect.
Michal Vasko82c31e62020-07-17 15:30:40 +02001921 * @return LY_SUCCESS if the feature is enabled,
1922 * @return LY_ENOT if the feature is disabled,
1923 * @return LY_ENOTFOUND if the feature was not found.
Radek Krejci151a5b72018-10-19 14:21:44 +02001924 */
Michal Vasko82c31e62020-07-17 15:30:40 +02001925LY_ERR lys_feature_value(const struct lys_module *module, const char *feature);
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001926
1927/**
Radek Krejcia3045382018-11-22 14:30:31 +01001928 * @brief Get next schema tree (sibling) node element that can be instantiated in a data tree. Returned node can
1929 * be from an augment.
1930 *
1931 * lys_getnext() is supposed to be called sequentially. In the first call, the \p last parameter is usually NULL
1932 * and function starts returning i) the first \p parent's child or ii) the first top level element of the \p module.
1933 * Consequent calls suppose to provide the previously returned node as the \p last parameter and still the same
1934 * \p parent and \p module parameters.
1935 *
1936 * Without options, the function is used to traverse only the schema nodes that can be paired with corresponding
1937 * data nodes in a data tree. By setting some \p options the behavior can be modified to the extent that
1938 * all the schema nodes are iteratively returned.
1939 *
1940 * @param[in] last Previously returned schema tree node, or NULL in case of the first call.
1941 * @param[in] parent Parent of the subtree where the function starts processing.
1942 * @param[in] module In case of iterating on top level elements, the \p parent is NULL and
1943 * module must be specified.
1944 * @param[in] options [ORed options](@ref sgetnextflags).
1945 * @return Next schema tree node that can be instantiated in a data tree, NULL in case there is no such element.
1946 */
1947const struct lysc_node *lys_getnext(const struct lysc_node *last, const struct lysc_node *parent,
Radek Krejci0f969882020-08-21 16:56:47 +02001948 const struct lysc_module *module, int options);
Radek Krejcia3045382018-11-22 14:30:31 +01001949
1950/**
1951 * @defgroup sgetnextflags lys_getnext() flags
Radek Krejcia3045382018-11-22 14:30:31 +01001952 * @{
1953 */
1954#define LYS_GETNEXT_WITHCHOICE 0x01 /**< lys_getnext() option to allow returning #LYS_CHOICE nodes instead of looking into them */
Radek Krejci9bb94eb2018-12-04 16:48:35 +01001955#define LYS_GETNEXT_NOCHOICE 0x02 /**< lys_getnext() option to ignore (kind of conditional) nodes within choice node */
Radek Krejci056d0a82018-12-06 16:57:25 +01001956#define LYS_GETNEXT_WITHCASE 0x04 /**< lys_getnext() option to allow returning #LYS_CASE nodes instead of looking into them */
Radek Krejcia3045382018-11-22 14:30:31 +01001957#define LYS_GETNEXT_INTONPCONT 0x40 /**< lys_getnext() option to look into non-presence container, instead of returning container itself */
1958#define LYS_GETNEXT_NOSTATECHECK 0x100 /**< lys_getnext() option to skip checking module validity (import-only, disabled) and
1959 relevant if-feature conditions state */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001960#define LYS_GETNEXT_OUTPUT 0x200 /**< lys_getnext() option to provide RPC's/action's output schema nodes instead of input schema nodes
1961 provided by default */
Radek Krejcia3045382018-11-22 14:30:31 +01001962/** @} sgetnextflags */
1963
1964/**
1965 * @brief Get child node according to the specified criteria.
1966 *
1967 * @param[in] parent Optional parent of the node to find. If not specified, the module's top-level nodes are searched.
1968 * @param[in] module module of the node to find. It is also limitation for the children node of the given parent.
1969 * @param[in] name Name of the node to find.
1970 * @param[in] name_len Optional length of the name in case it is not NULL-terminated string.
1971 * @param[in] nodetype Optional criteria (to speedup) specifying nodetype(s) of the node to find.
1972 * Used as a bitmask, so multiple nodetypes can be specified.
1973 * @param[in] options [ORed options](@ref sgetnextflags).
1974 * @return Found node if any.
1975 */
Michal Vaskoe444f752020-02-10 12:20:06 +01001976const struct lysc_node *lys_find_child(const struct lysc_node *parent, const struct lys_module *module,
Radek Krejci0f969882020-08-21 16:56:47 +02001977 const char *name, size_t name_len, uint16_t nodetype, int options);
Radek Krejcia3045382018-11-22 14:30:31 +01001978
1979/**
Radek Krejci09e8d0a2019-11-17 12:14:15 +08001980 * @brief Get schema node specified by the schema path.
1981 *
1982 * In case the @p qpath uses prefixes (from imports or of the schema itself), the @p context_node must be specified
1983 * even if the path is absolute. In case the @p context_node is not provided, the names of the schemas are expected as the
1984 * node's prefixes in the @qpath. It also means that the relative paths are accepted only with the schema prefixes,
1985 * not the full names.
1986 *
1987 * @param[in] ctx libyang context for logging and getting the correct schema if @p contet_node not provided.
1988 * @param[in] context_node Context node for relative paths and/or as a source of the context module to resolve node's
1989 * prefixes in @qpath.
1990 * @param[in] qpath Schema path to be resolved. Not prefixed nodes inherits the prefix from its parent nodes. It means
1991 * that the first node in the path must be prefixed. Both, import prefixes as well as full schema names are accepted as
1992 * prefixes according to the @p context_node parameter presence.
1993 * @return NULL in case of invalid path.
1994 * @return found schema node.
1995 */
1996const struct lysc_node *lys_find_node(struct ly_ctx *ctx, const struct lysc_node *context_node, const char *qpath);
1997
1998/**
Radek Krejci77a8bcd2019-09-11 11:20:02 +02001999 * @brief Make the specific module implemented.
2000 *
2001 * @param[in] mod Module to make implemented. It is not an error
2002 * to provide already implemented module, it just does nothing.
Michal Vaskoe444f752020-02-10 12:20:06 +01002003 * @return LY_SUCCESS on success.
2004 * @return LY_EDENIED in case the context contains some other revision of the same module which is already implemented.
Radek Krejci77a8bcd2019-09-11 11:20:02 +02002005 */
2006LY_ERR lys_set_implemented(struct lys_module *mod);
2007
2008/**
Radek Krejcia3045382018-11-22 14:30:31 +01002009 * @brief Check if the schema node is disabled in the schema tree, i.e. there is any disabled if-feature statement
2010 * affecting the node.
2011 *
2012 * @param[in] node Schema node to check.
2013 * @param[in] recursive - 0 to check if-feature only in the \p node schema node,
2014 * - 1 to check if-feature in all ascendant schema nodes until there is a node possibly having an instance in a data tree
Michal Vaskoe444f752020-02-10 12:20:06 +01002015 * @return NULL if enabled,
Michal Vaskoc193ce92020-03-06 11:04:48 +01002016 * @return pointer to the node with the unsatisfied (disabled) if-feature expression.
Radek Krejcia3045382018-11-22 14:30:31 +01002017 */
Michal Vaskoc193ce92020-03-06 11:04:48 +01002018const struct lysc_node *lysc_node_is_disabled(const struct lysc_node *node, int recursive);
Radek Krejcia3045382018-11-22 14:30:31 +01002019
Radek Krejci084289f2019-07-09 17:35:30 +02002020/**
Radek Krejci19cf8052020-08-18 15:02:38 +02002021 * @brief Set a schema private pointer to a user pointer.
2022 *
2023 * @param[in] node Node, whose private field will be assigned.
2024 * @param[in] priv Arbitrary user-specified pointer.
2025 * @param[out] prev_priv_p Pointer to the previous private data being returned after replacinf by @p priv.
2026 * @return LY_EINVAL in case of invalid @p node.
2027 * @return LY_SUCCESS on success.
2028 */
2029LY_ERR lysc_node_set_private(const struct lysc_node *node, void *priv, void **prev_priv_p);
2030
2031/**
Radek Krejci084289f2019-07-09 17:35:30 +02002032 * @brief Check type restrictions applicable to the particular leaf/leaf-list with the given string @p value.
2033 *
2034 * This function check just the type's restriction, if you want to check also the data tree context (e.g. in case of
2035 * require-instance restriction), use lyd_value_validate().
2036 *
2037 * @param[in] ctx libyang context for logging (function does not log errors when @p ctx is NULL)
2038 * @param[in] node Schema node for the @p value.
Michal Vaskof937cfe2020-08-03 16:07:12 +02002039 * @param[in] value String value to be checked, expected to be in JSON format.
Radek Krejci084289f2019-07-09 17:35:30 +02002040 * @param[in] value_len Length of the given @p value (mandatory).
Radek Krejci084289f2019-07-09 17:35:30 +02002041 * @return LY_SUCCESS on success
2042 * @return LY_ERR value if an error occurred.
2043 */
Michal Vaskof937cfe2020-08-03 16:07:12 +02002044LY_ERR lys_value_validate(const struct ly_ctx *ctx, const struct lysc_node *node, const char *value, size_t value_len);
Radek Krejci084289f2019-07-09 17:35:30 +02002045
Radek Krejci0935f412019-08-20 16:15:18 +02002046/**
2047 * @brief Stringify schema nodetype.
Michal Vaskod43d71a2020-08-07 14:54:58 +02002048 *
Radek Krejci0935f412019-08-20 16:15:18 +02002049 * @param[in] nodetype Nodetype to stringify.
2050 * @return Constant string with the name of the node's type.
2051 */
2052const char *lys_nodetype2str(uint16_t nodetype);
2053
Michal Vaskod43d71a2020-08-07 14:54:58 +02002054/**
2055 * @brief Getter for original XPath expression from a parsed expression.
2056 *
2057 * @param[in] path Parsed expression.
2058 * @return Original string expression.
2059 */
2060const char *lyxp_get_expr(const struct lyxp_expr *path);
2061
Radek Krejci2ff0d572020-05-21 15:27:28 +02002062/** @} schematree */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02002063
Radek Krejci70853c52018-10-15 14:46:16 +02002064#ifdef __cplusplus
2065}
2066#endif
2067
Radek Krejci5aeea3a2018-09-05 13:29:36 +02002068#endif /* LY_TREE_SCHEMA_H_ */