blob: 40f7eff0df7051b70b7ece9b6296d43dd6a6294b [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) \
Radek Krejci857189e2020-09-01 13:26:36 +020072 { ly_bool 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 Vasko7f45cf22020-10-01 12:49:44 +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 */
141#define LYS_ANYDATA 0x0060 /**< anydata statement node, in tests it can be used for both #LYS_ANYXML and #LYS_ANYDATA */
142#define LYS_CASE 0x0080 /**< case statement node */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200143
Michal Vasko7f45cf22020-10-01 12:49:44 +0200144#define LYS_RPC 0x0100 /**< RPC statement node */
145#define LYS_ACTION 0x0200 /**< action statement node */
146#define LYS_NOTIF 0x0400 /**< notification statement node */
Radek Krejcie7b95092019-05-15 11:03:07 +0200147
Michal Vasko7f45cf22020-10-01 12:49:44 +0200148#define LYS_USES 0x0800 /**< uses statement node */
149#define LYS_INPUT 0x1000 /**< RPC/action input node */
150#define LYS_OUTPUT 0x2000 /**< RPC/action output node */
151#define LYS_GROUPING 0x4000
152#define LYS_AUGMENT 0x8000
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100153
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200154/**
Radek Krejcid6b76452019-09-03 17:03:03 +0200155 * @brief List of YANG statements
156 */
157enum ly_stmt {
158 LY_STMT_NONE = 0,
Radek Krejciad5963b2019-09-06 16:03:05 +0200159 LY_STMT_STATUS, /**< in lysc_ext_substmt::storage stored as a pointer to `uint16_t`, only cardinality < #LY_STMT_CARD_SOME is allowed */
160 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 +0200161 LY_STMT_MANDATORY,
Radek Krejciad5963b2019-09-06 16:03:05 +0200162 LY_STMT_UNITS, /**< in lysc_ext_substmt::storage stored as a pointer to `const char *` (cardinality < #LY_STMT_CARD_SOME)
163 or as a pointer to a [sized array](@ref sizedarrays) `const char **` */
Radek Krejci335332a2019-09-05 13:03:35 +0200164 LY_STMT_DEFAULT,
Radek Krejciad5963b2019-09-06 16:03:05 +0200165 LY_STMT_TYPE, /**< in lysc_ext_substmt::storage stored as a pointer to `struct lysc_type *` (cardinality < #LY_STMT_CARD_SOME)
166 or as a pointer to a [sized array](@ref sizedarrays) `struct lysc_type **` */
Radek Krejci335332a2019-09-05 13:03:35 +0200167
Radek Krejcid6b76452019-09-03 17:03:03 +0200168 LY_STMT_ACTION,
169 LY_STMT_ANYDATA,
170 LY_STMT_ANYXML,
171 LY_STMT_ARGUMENT,
172 LY_STMT_AUGMENT,
173 LY_STMT_BASE,
174 LY_STMT_BELONGS_TO,
175 LY_STMT_BIT,
176 LY_STMT_CASE,
177 LY_STMT_CHOICE,
Radek Krejcid6b76452019-09-03 17:03:03 +0200178 LY_STMT_CONTACT,
179 LY_STMT_CONTAINER,
Radek Krejcid6b76452019-09-03 17:03:03 +0200180 LY_STMT_DESCRIPTION,
181 LY_STMT_DEVIATE,
182 LY_STMT_DEVIATION,
183 LY_STMT_ENUM,
184 LY_STMT_ERROR_APP_TAG,
185 LY_STMT_ERROR_MESSAGE,
186 LY_STMT_EXTENSION,
187 LY_STMT_FEATURE,
188 LY_STMT_FRACTION_DIGITS,
189 LY_STMT_GROUPING,
190 LY_STMT_IDENTITY,
Radek Krejciad5963b2019-09-06 16:03:05 +0200191 LY_STMT_IF_FEATURE, /**< in lysc_ext_substmt::storage stored as a pointer to `struct lysc_iffeature` (cardinality < #LY_STMT_CARD_SOME)
192 or as a pointer to a [sized array](@ref sizedarrays) `struct lysc_iffeature *` */
Radek Krejcid6b76452019-09-03 17:03:03 +0200193 LY_STMT_IMPORT,
194 LY_STMT_INCLUDE,
195 LY_STMT_INPUT,
196 LY_STMT_KEY,
197 LY_STMT_LEAF,
198 LY_STMT_LEAF_LIST,
199 LY_STMT_LENGTH,
200 LY_STMT_LIST,
Radek Krejcid6b76452019-09-03 17:03:03 +0200201 LY_STMT_MAX_ELEMENTS,
202 LY_STMT_MIN_ELEMENTS,
203 LY_STMT_MODIFIER,
204 LY_STMT_MODULE,
205 LY_STMT_MUST,
206 LY_STMT_NAMESPACE,
207 LY_STMT_NOTIFICATION,
208 LY_STMT_ORDERED_BY,
209 LY_STMT_ORGANIZATION,
210 LY_STMT_OUTPUT,
211 LY_STMT_PATH,
212 LY_STMT_PATTERN,
213 LY_STMT_POSITION,
214 LY_STMT_PREFIX,
215 LY_STMT_PRESENCE,
216 LY_STMT_RANGE,
217 LY_STMT_REFERENCE,
218 LY_STMT_REFINE,
219 LY_STMT_REQUIRE_INSTANCE,
220 LY_STMT_REVISION,
221 LY_STMT_REVISION_DATE,
222 LY_STMT_RPC,
Radek Krejcid6b76452019-09-03 17:03:03 +0200223 LY_STMT_SUBMODULE,
Radek Krejcid6b76452019-09-03 17:03:03 +0200224 LY_STMT_TYPEDEF,
225 LY_STMT_UNIQUE,
Radek Krejcid6b76452019-09-03 17:03:03 +0200226 LY_STMT_USES,
227 LY_STMT_VALUE,
228 LY_STMT_WHEN,
229 LY_STMT_YANG_VERSION,
230 LY_STMT_YIN_ELEMENT,
231 LY_STMT_EXTENSION_INSTANCE,
232
233 LY_STMT_SYNTAX_SEMICOLON,
234 LY_STMT_SYNTAX_LEFT_BRACE,
235 LY_STMT_SYNTAX_RIGHT_BRACE,
236
237 LY_STMT_ARG_TEXT,
238 LY_STMT_ARG_VALUE
239};
240
241/**
Radek Krejci0e59c312019-08-15 15:34:15 +0200242 * @brief Extension instance structure parent enumeration
243 */
244typedef enum {
Radek Krejci0935f412019-08-20 16:15:18 +0200245 LYEXT_PAR_MODULE, /**< ::lysc_module */
246 LYEXT_PAR_NODE, /**< ::lysc_node (and the derived structures including ::lysc_action and ::lysc_notif) */
247 LYEXT_PAR_INPUT, /**< ::lysc_action_inout */
248 LYEXT_PAR_OUTPUT, /**< ::lysc_action_inout */
249 LYEXT_PAR_TYPE, /**< ::lysc_type */
250 LYEXT_PAR_TYPE_BIT, /**< ::lysc_type_bitenum_item */
251 LYEXT_PAR_TYPE_ENUM, /**< ::lysc_type_bitenum_item */
252 LYEXT_PAR_FEATURE, /**< ::lysc_feature */
253 LYEXT_PAR_MUST, /**< ::lysc_must */
254 LYEXT_PAR_PATTERN, /**< ::lysc_pattern */
255 LYEXT_PAR_LENGTH, /**< ::lysc_range */
256 LYEXT_PAR_RANGE, /**< ::lysc_range */
257 LYEXT_PAR_WHEN, /**< ::lysc_when */
258 LYEXT_PAR_IDENT, /**< ::lysc_ident */
259 LYEXT_PAR_EXT, /**< ::lysc_ext */
Michal Vasko69730152020-10-09 16:30:07 +0200260 LYEXT_PAR_IMPORT /**< ::lysp_import */
Michal Vasko033278d2020-08-24 11:24:52 +0200261// LYEXT_PAR_TPDF, /**< ::lysp_tpdf */
262// LYEXT_PAR_EXTINST, /**< ::lysp_ext_instance */
263// LYEXT_PAR_REFINE, /**< ::lysp_refine */
264// LYEXT_PAR_DEVIATION, /**< ::lysp_deviation */
265// LYEXT_PAR_DEVIATE, /**< ::lysp_deviate */
266// LYEXT_PAR_INCLUDE, /**< ::lysp_include */
267// LYEXT_PAR_REVISION, /**< ::lysp_revision */
Radek Krejci0e59c312019-08-15 15:34:15 +0200268} LYEXT_PARENT;
269
270/**
Radek Krejci0935f412019-08-20 16:15:18 +0200271 * @brief Stringify extension instance parent type.
272 * @param[in] type Parent type to stringify.
273 * @return Constant string with the name of the parent statement.
274 */
275const char *lyext_parent2str(LYEXT_PARENT type);
276
277/**
Radek Krejci0e59c312019-08-15 15:34:15 +0200278 * @brief Enum of substatements in which extension instances can appear.
279 */
280typedef enum {
281 LYEXT_SUBSTMT_SELF = 0, /**< extension of the structure itself, not substatement's */
282 LYEXT_SUBSTMT_ARGUMENT, /**< extension of the argument statement, can appear in lys_ext */
283 LYEXT_SUBSTMT_BASE, /**< extension of the base statement, can appear (repeatedly) in lys_type and lys_ident */
284 LYEXT_SUBSTMT_BELONGSTO, /**< extension of the belongs-to statement, can appear in lys_submodule */
285 LYEXT_SUBSTMT_CONTACT, /**< extension of the contact statement, can appear in lys_module */
286 LYEXT_SUBSTMT_DEFAULT, /**< extension of the default statement, can appear in lys_node_leaf, lys_node_leaflist,
287 lys_node_choice and lys_deviate */
288 LYEXT_SUBSTMT_DESCRIPTION, /**< extension of the description statement, can appear in lys_module, lys_submodule,
289 lys_node, lys_import, lys_include, lys_ext, lys_feature, lys_tpdf, lys_restr,
290 lys_ident, lys_deviation, lys_type_enum, lys_type_bit, lys_when and lys_revision */
291 LYEXT_SUBSTMT_ERRTAG, /**< extension of the error-app-tag statement, can appear in lys_restr */
292 LYEXT_SUBSTMT_ERRMSG, /**< extension of the error-message statement, can appear in lys_restr */
293 LYEXT_SUBSTMT_KEY, /**< extension of the key statement, can appear in lys_node_list */
294 LYEXT_SUBSTMT_NAMESPACE, /**< extension of the namespace statement, can appear in lys_module */
295 LYEXT_SUBSTMT_ORGANIZATION, /**< extension of the organization statement, can appear in lys_module and lys_submodule */
296 LYEXT_SUBSTMT_PATH, /**< extension of the path statement, can appear in lys_type */
297 LYEXT_SUBSTMT_PREFIX, /**< extension of the prefix statement, can appear in lys_module, lys_submodule (for
298 belongs-to's prefix) and lys_import */
299 LYEXT_SUBSTMT_PRESENCE, /**< extension of the presence statement, can appear in lys_node_container */
300 LYEXT_SUBSTMT_REFERENCE, /**< extension of the reference statement, can appear in lys_module, lys_submodule,
301 lys_node, lys_import, lys_include, lys_revision, lys_tpdf, lys_restr, lys_ident,
302 lys_ext, lys_feature, lys_deviation, lys_type_enum, lys_type_bit and lys_when */
303 LYEXT_SUBSTMT_REVISIONDATE, /**< extension of the revision-date statement, can appear in lys_import and lys_include */
304 LYEXT_SUBSTMT_UNITS, /**< extension of the units statement, can appear in lys_tpdf, lys_node_leaf,
305 lys_node_leaflist and lys_deviate */
306 LYEXT_SUBSTMT_VALUE, /**< extension of the value statement, can appear in lys_type_enum */
307 LYEXT_SUBSTMT_VERSION, /**< extension of the yang-version statement, can appear in lys_module and lys_submodule */
308 LYEXT_SUBSTMT_MODIFIER, /**< extension of the modifier statement, can appear in lys_restr */
309 LYEXT_SUBSTMT_REQINSTANCE, /**< extension of the require-instance statement, can appear in lys_type */
310 LYEXT_SUBSTMT_YINELEM, /**< extension of the yin-element statement, can appear in lys_ext */
311 LYEXT_SUBSTMT_CONFIG, /**< extension of the config statement, can appear in lys_node and lys_deviate */
312 LYEXT_SUBSTMT_MANDATORY, /**< extension of the mandatory statement, can appear in lys_node_leaf, lys_node_choice,
313 lys_node_anydata and lys_deviate */
314 LYEXT_SUBSTMT_ORDEREDBY, /**< extension of the ordered-by statement, can appear in lys_node_list and lys_node_leaflist */
315 LYEXT_SUBSTMT_STATUS, /**< extension of the status statement, can appear in lys_tpdf, lys_node, lys_ident,
316 lys_ext, lys_feature, lys_type_enum and lys_type_bit */
317 LYEXT_SUBSTMT_FRACDIGITS, /**< extension of the fraction-digits statement, can appear in lys_type */
318 LYEXT_SUBSTMT_MAX, /**< extension of the max-elements statement, can appear in lys_node_list,
319 lys_node_leaflist and lys_deviate */
320 LYEXT_SUBSTMT_MIN, /**< extension of the min-elements statement, can appear in lys_node_list,
321 lys_node_leaflist and lys_deviate */
322 LYEXT_SUBSTMT_POSITION, /**< extension of the position statement, can appear in lys_type_bit */
323 LYEXT_SUBSTMT_UNIQUE, /**< extension of the unique statement, can appear in lys_node_list and lys_deviate */
Michal Vasko69730152020-10-09 16:30:07 +0200324 LYEXT_SUBSTMT_IFFEATURE /**< extension of the if-feature statement */
Radek Krejci0e59c312019-08-15 15:34:15 +0200325} LYEXT_SUBSTMT;
326
327/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200328 * @brief YANG import-stmt
329 */
330struct lysp_import {
Radek Krejci086c7132018-10-26 15:29:04 +0200331 struct lys_module *module; /**< pointer to the imported module
332 (mandatory, but resolved when the referring module is completely parsed) */
333 const char *name; /**< name of the imported module (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200334 const char *prefix; /**< prefix for the data from the imported schema (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200335 const char *dsc; /**< description */
336 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200337 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200338 char rev[LY_REV_SIZE]; /**< revision-date of the imported module */
339};
340
341/**
342 * @brief YANG include-stmt
343 */
344struct lysp_include {
Radek Krejci0bcdaed2019-01-10 10:21:34 +0100345 struct lysp_submodule *submodule;/**< pointer to the parsed submodule structure
Radek Krejci086c7132018-10-26 15:29:04 +0200346 (mandatory, but resolved when the referring module is completely parsed) */
347 const char *name; /**< name of the included submodule (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200348 const char *dsc; /**< description */
349 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200350 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200351 char rev[LY_REV_SIZE]; /**< revision-date of the included submodule */
352};
353
354/**
355 * @brief YANG extension-stmt
356 */
357struct lysp_ext {
358 const char *name; /**< extension name */
359 const char *argument; /**< argument name, NULL if not specified */
360 const char *dsc; /**< description statement */
361 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200362 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcif56e2a42019-09-09 14:15:25 +0200363 uint16_t flags; /**< LYS_STATUS_* and LYS_YINELEM_* values (@ref snodeflags) */
Michal Vasko5fe75f12020-03-02 13:52:37 +0100364
365 struct lysc_ext *compiled; /**< pointer to the compiled extension definition */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200366};
367
368/**
369 * @brief Helper structure for generic storage of the extension instances content.
370 */
371struct lysp_stmt {
372 const char *stmt; /**< identifier of the statement */
373 const char *arg; /**< statement's argument */
374 struct lysp_stmt *next; /**< link to the next statement */
Michal Vaskobc2559f2018-09-07 10:17:50 +0200375 struct lysp_stmt *child; /**< list of the statement's substatements (linked list) */
David Sedlákb9d75c42019-08-14 10:49:42 +0200376 uint16_t flags; /**< statement flags, can be set to LYS_YIN_ATTR */
Radek Krejci335332a2019-09-05 13:03:35 +0200377 enum ly_stmt kw; /**< numeric respresentation of the stmt value */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200378};
379
David Sedlákae4b4512019-08-14 10:45:56 +0200380#define LYS_YIN 0x1 /**< used to specify input format of extension instance */
381
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200382/**
383 * @brief YANG extension instance
384 */
385struct lysp_ext_instance {
David Sedlákbbd06ca2019-06-27 14:15:38 +0200386 const char *name; /**< extension identifier, including possible prefix */
387 const char *argument; /**< optional value of the extension's argument */
Radek Krejci335332a2019-09-05 13:03:35 +0200388 void *parent; /**< pointer to the parent element holding the extension instance(s), use
389 ::lysp_ext_instance#parent_type to access the schema element */
David Sedlákbbd06ca2019-06-27 14:15:38 +0200390 struct lysp_stmt *child; /**< list of the extension's substatements (linked list) */
Radek Krejcif56e2a42019-09-09 14:15:25 +0200391 struct lysc_ext_instance *compiled; /**< pointer to the compiled data if any - in case the source format is YIN,
392 some of the information (argument) are available only after compilation */
David Sedlákbbd06ca2019-06-27 14:15:38 +0200393 LYEXT_SUBSTMT insubstmt; /**< value identifying placement of the extension instance */
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200394 LY_ARRAY_COUNT_TYPE insubstmt_index; /**< in case the instance is in a substatement, this identifies
David Sedlákbbd06ca2019-06-27 14:15:38 +0200395 the index of that substatement */
David Sedlákae4b4512019-08-14 10:45:56 +0200396 uint8_t yin; /** flag for YIN source format, can be set to LYS_YIN */
Radek Krejci335332a2019-09-05 13:03:35 +0200397 LYEXT_PARENT parent_type; /**< type of the parent structure */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200398};
399
400/**
401 * @brief YANG feature-stmt
402 */
403struct lysp_feature {
404 const char *name; /**< feature name (mandatory) */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200405 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200406 const char *dsc; /**< description statement */
407 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200408 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200409 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values allowed */
410};
411
412/**
Michal Vasko7f45cf22020-10-01 12:49:44 +0200413 * @brief Qualified name (optional prefix followed by an identifier).
414 */
415struct lysp_qname {
416 const char *str; /**< qualified name string */
417 const struct lys_module *mod; /**< local module for any prefixes found in the string, it must be
418 stored explicitly because of deviations/refines */
419};
420
421/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200422 * @brief YANG identity-stmt
423 */
424struct lysp_ident {
425 const char *name; /**< identity name (mandatory), including possible prefix */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200426 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200427 const char **bases; /**< list of base identifiers ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200428 const char *dsc; /**< description statement */
429 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200430 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200431 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_ values are allowed */
432};
433
Michal Vasko71e64ca2018-09-07 16:30:29 +0200434/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200435 * @brief Covers restrictions: range, length, pattern, must
436 */
437struct lysp_restr {
Michal Vasko7f45cf22020-10-01 12:49:44 +0200438 struct lysp_qname arg; /**< The restriction expression/value (mandatory);
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200439 in case of pattern restriction, the first byte has a special meaning:
440 0x06 (ACK) for regular match and 0x15 (NACK) for invert-match */
441 const char *emsg; /**< error-message */
442 const char *eapptag; /**< error-app-tag value */
443 const char *dsc; /**< description */
444 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200445 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200446};
447
448/**
Michal Vasko71e64ca2018-09-07 16:30:29 +0200449 * @brief YANG revision-stmt
450 */
451struct lysp_revision {
Radek Krejcib7db73a2018-10-24 14:18:40 +0200452 char date[LY_REV_SIZE]; /**< revision date (madatory) */
Michal Vasko71e64ca2018-09-07 16:30:29 +0200453 const char *dsc; /**< description statement */
454 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200455 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vasko71e64ca2018-09-07 16:30:29 +0200456};
457
458/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200459 * @brief Enumeration/Bit value definition
460 */
461struct lysp_type_enum {
462 const char *name; /**< name (mandatory) */
463 const char *dsc; /**< description statement */
464 const char *ref; /**< reference statement */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200465 int64_t value; /**< enum's value or bit's position */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200466 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200467 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200468 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_ and LYS_SET_VALUE
469 values are allowed */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200470};
471
472/**
473 * @brief YANG type-stmt
474 *
475 * Some of the items in the structure may be mandatory, but it is necessary to resolve the type's base type first
476 */
477struct lysp_type {
478 const char *name; /**< name of the type (mandatory) */
479 struct lysp_restr *range; /**< allowed values range - numerical, decimal64 */
480 struct lysp_restr *length; /**< allowed length of the value - string, binary */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200481 struct lysp_restr *patterns; /**< list of patterns ([sized array](@ref sizedarrays)) - string */
482 struct lysp_type_enum *enums; /**< list of enum-stmts ([sized array](@ref sizedarrays)) - enum */
483 struct lysp_type_enum *bits; /**< list of bit-stmts ([sized array](@ref sizedarrays)) - bits */
Michal Vasko004d3152020-06-11 19:59:22 +0200484 struct lyxp_expr *path; /**< parsed path - leafref */
Radek Krejci151a5b72018-10-19 14:21:44 +0200485 const char **bases; /**< list of base identifiers ([sized array](@ref sizedarrays)) - identityref */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200486 struct lysp_type *types; /**< list of sub-types ([sized array](@ref sizedarrays)) - union */
487 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200488
Michal Vaskoe9c050f2020-10-06 14:01:23 +0200489 const struct lys_module *mod; /**< local module of the type (needed for deviations) */
Radek Krejci2167ee12018-11-02 16:09:07 +0100490 struct lysc_type *compiled; /**< pointer to the compiled type */
491
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200492 uint8_t fraction_digits; /**< number of fraction digits - decimal64 */
493 uint8_t require_instance; /**< require-instance flag - leafref, instance */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100494 uint16_t flags; /**< [schema node flags](@ref spnodeflags) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200495};
496
497/**
498 * @brief YANG typedef-stmt
499 */
500struct lysp_tpdf {
501 const char *name; /**< name of the newly defined type (mandatory) */
502 const char *units; /**< units of the newly defined type */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200503 struct lysp_qname dflt; /**< default value of the newly defined type, it may or may not be a qualified name */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200504 const char *dsc; /**< description statement */
505 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200506 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200507 struct lysp_type type; /**< base type from which the typedef is derived (mandatory) */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100508 uint16_t flags; /**< [schema node flags](@ref spnodeflags) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200509};
510
511/**
512 * @brief YANG grouping-stmt
513 */
514struct lysp_grp {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100515 struct lysp_node *parent; /**< parent node (NULL if this is a top-level grouping) */
516 uint16_t nodetype; /**< LYS_GROUPING */
517 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values are allowed */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200518 const char *name; /**< grouping name (mandatory) */
519 const char *dsc; /**< description statement */
520 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200521 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
522 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200523 struct lysp_node *data; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200524 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
525 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
526 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200527};
528
529/**
530 * @brief YANG when-stmt
531 */
532struct lysp_when {
533 const char *cond; /**< specified condition (mandatory) */
534 const char *dsc; /**< description statement */
535 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200536 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200537};
538
539/**
540 * @brief YANG refine-stmt
541 */
542struct lysp_refine {
543 const char *nodeid; /**< target descendant schema nodeid (mandatory) */
544 const char *dsc; /**< description statement */
545 const char *ref; /**< reference statement */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200546 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200547 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200548 const char *presence; /**< presence description */
Radek Krejci151a5b72018-10-19 14:21:44 +0200549 const char **dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200550 uint32_t min; /**< min-elements constraint */
551 uint32_t max; /**< max-elements constraint, 0 means unbounded */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200552 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200553 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
554};
555
556/**
Michal Vasko82a83432019-11-14 12:33:04 +0100557 * @brief YANG uses-augment-stmt and augment-stmt (compatible with struct lysp_node )
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200558 */
559struct lysp_augment {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100560 struct lysp_node *parent; /**< parent node (NULL if this is a top-level augment) */
561 uint16_t nodetype; /**< LYS_AUGMENT */
562 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values are allowed */
Michal Vasko82a83432019-11-14 12:33:04 +0100563 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200564 const char *nodeid; /**< target schema nodeid (mandatory) - absolute for global augments, descendant for uses's augments */
565 const char *dsc; /**< description statement */
566 const char *ref; /**< reference statement */
567 struct lysp_when *when; /**< when statement */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200568 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Michal Vasko82a83432019-11-14 12:33:04 +0100569 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200570 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
571 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200572};
573
574/**
575 * @defgroup deviatetypes Deviate types
576 * @{
577 */
578#define LYS_DEV_NOT_SUPPORTED 1 /**< deviate type not-supported */
579#define LYS_DEV_ADD 2 /**< deviate type add */
580#define LYS_DEV_DELETE 3 /**< deviate type delete */
581#define LYS_DEV_REPLACE 4 /**< deviate type replace */
Radek Krejci2ff0d572020-05-21 15:27:28 +0200582/** @} deviatetypes */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200583
584/**
585 * @brief Generic deviate structure to get type and cast to lysp_deviate_* structure
586 */
587struct lysp_deviate {
588 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
589 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200590 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200591};
592
593struct lysp_deviate_add {
594 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
595 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200596 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200597 const char *units; /**< units of the values */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200598 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200599 const char **uniques; /**< list of uniques specifications ([sized array](@ref sizedarrays)) */
600 const char **dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200601 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
602 uint32_t min; /**< min-elements constraint */
603 uint32_t max; /**< max-elements constraint, 0 means unbounded */
604};
605
606struct lysp_deviate_del {
607 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
608 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200609 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200610 const char *units; /**< units of the values */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200611 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200612 const char **uniques; /**< list of uniques specifications ([sized array](@ref sizedarrays)) */
613 const char **dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200614};
615
616struct lysp_deviate_rpl {
617 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
618 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200619 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200620 struct lysp_type *type; /**< type of the node */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200621 const char *units; /**< units of the values */
622 const char *dflt; /**< default value */
623 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
624 uint32_t min; /**< min-elements constraint */
625 uint32_t max; /**< max-elements constraint, 0 means unbounded */
626};
627
628struct lysp_deviation {
Michal Vaskob55f6c12018-09-12 11:13:15 +0200629 const char *nodeid; /**< target absolute schema nodeid (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200630 const char *dsc; /**< description statement */
631 const char *ref; /**< reference statement */
Michal Vasko22df3f02020-08-24 13:29:22 +0200632 struct lysp_deviate *deviates; /**< list of deviate specifications (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200633 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200634};
635
Radek Krejci4f28eda2018-11-12 11:46:16 +0100636/**
637 * @defgroup spnodeflags Parsed schema nodes flags
638 * @ingroup snodeflags
639 *
640 * Various flags for parsed schema nodes.
641 *
642 * 1 - container 6 - anydata/anyxml 11 - output 16 - grouping 21 - enum
643 * 2 - choice 7 - case 12 - feature 17 - uses 22 - type
Radek Krejcid3ca0632019-04-16 16:54:54 +0200644 * 3 - leaf 8 - notification 13 - identity 18 - refine 23 - stmt
Radek Krejci4f28eda2018-11-12 11:46:16 +0100645 * 4 - leaflist 9 - rpc 14 - extension 19 - augment
646 * 5 - list 10 - input 15 - typedef 20 - deviate
647 *
Radek Krejcid3ca0632019-04-16 16:54:54 +0200648 * 1 1 1 1 1 1 1 1 1 1 2 2 2 2
649 * 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
650 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Michal Vasko5297a432020-08-31 12:27:51 +0200651 * 1 LYS_CONFIG_W |x|x|x|x|x|x| | | | | | | | | | | |x| |x| | | |
Radek Krejcid3ca0632019-04-16 16:54:54 +0200652 * LYS_SET_BASE | | | | | | | | | | | | | | | | | | | | | |x| |
653 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Michal Vasko5297a432020-08-31 12:27:51 +0200654 * 2 LYS_CONFIG_R |x|x|x|x|x|x| | | | | | | | | | | |x| |x| | | |
Radek Krejcid3ca0632019-04-16 16:54:54 +0200655 * LYS_SET_BIT | | | | | | | | | | | | | | | | | | | | | |x| |
656 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
657 * 3 LYS_STATUS_CURR |x|x|x|x|x|x|x|x|x| | |x|x|x|x|x|x| |x|x|x| | |
658 * LYS_SET_ENUM | | | | | | | | | | | | | | | | | | | | | |x| |
659 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
660 * 4 LYS_STATUS_DEPRC |x|x|x|x|x|x|x|x|x| | |x|x|x|x|x|x| |x|x|x| | |
661 * LYS_SET_FRDIGITS | | | | | | | | | | | | | | | | | | | | | |x| |
662 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
663 * 5 LYS_STATUS_OBSLT |x|x|x|x|x|x|x|x|x| | |x|x|x|x|x|x| |x|x|x| | |
664 * LYS_SET_LENGTH | | | | | | | | | | | | | | | | | | | | | |x| |
665 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
666 * 6 LYS_MAND_TRUE | |x|x| | |x| | | | | | | | | | | |x| |x| | | |
667 * LYS_SET_PATH | | | | | | | | | | | | | | | | | | | | | |x| |
668 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
669 * 7 LYS_MAND_FALSE | |x|x| | |x| | | | | | | | | | | |x| |x| | | |
670 * LYS_ORDBY_USER | | | |x|x| | | | | | | | | | | | | | | | | | |
671 * LYS_SET_PATTERN | | | | | | | | | | | | | | | | | | | | | |x| |
672 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
673 * 8 LYS_ORDBY_SYSTEM | | | |x|x| | | | | | | | | | | | | | | | | | |
674 * LYS_YINELEM_TRUE | | | | | | | | | | | | | |x| | | | | | | | | |
675 * LYS_SET_RANGE | | | | | | | | | | | | | | | | | | | | | |x| |
676 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
677 * 9 LYS_YINELEM_FALSE| | | | | | | | | | | | | |x| | | | | | | | | |
678 * LYS_SET_TYPE | | | | | | | | | | | | | | | | | | | | | |x| |
679 * LYS_SINGLEQUOTED | | | | | | | | | | | | | | | | | | | | | | |x|
680 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
681 * 10 LYS_SET_VALUE | | | | | | | | | | | | | | | | | | | | |x| | |
682 * LYS_SET_REQINST | | | | | | | | | | | | | | | | | | | | | |x| |
683 * LYS_SET_MIN | | | |x|x| | | | | | | | | | | | |x| |x| | | |
684 * LYS_DOUBLEQUOTED | | | | | | | | | | | | | | | | | | | | | | |x|
685 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
686 * 11 LYS_SET_MAX | | | |x|x| | | | | | | | | | | | |x| |x| | | |
Radek Krejcif2de0ed2019-05-02 14:13:18 +0200687 * LYS_USED_GRP | | | | | | | | | | | | | | | |x| | | | | | | |
David Sedlákae4b4512019-08-14 10:45:56 +0200688 * LYS_YIN_ATTR | | | | | | | | | | | | | | | | | | | | | | |x|
Michal Vasko5297a432020-08-31 12:27:51 +0200689 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
690 * 12 LYS_YIN_ARGUMENT | | | | | | | | | | | | | | | | | | | | | | |x|
Radek Krejcif56e2a42019-09-09 14:15:25 +0200691 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Radek Krejci4f28eda2018-11-12 11:46:16 +0100692 *
693 */
694
695/**
696 * @defgroup scnodeflags Compiled schema nodes flags
697 * @ingroup snodeflags
698 *
699 * Various flags for compiled schema nodes.
700 *
Radek Krejci61e042e2019-09-10 15:53:09 +0200701 * 1 - container 6 - anydata/anyxml 11 - identity
702 * 2 - choice 7 - case 12 - extension
703 * 3 - leaf 8 - notification 13 - bitenum
Michal Vasko03ff5a72019-09-11 13:49:33 +0200704 * 4 - leaflist 9 - rpc/action 14 - when
Michal Vaskoecd62de2019-11-13 12:35:11 +0100705 * 5 - list 10 - feature
Radek Krejci4f28eda2018-11-12 11:46:16 +0100706 *
Michal Vaskoecd62de2019-11-13 12:35:11 +0100707 * 1 1 1 1 1
708 * bit name 1 2 3 4 5 6 7 8 9 0 1 2 3 4
709 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
710 * 1 LYS_CONFIG_W |x|x|x|x|x|x|x| | | | | | | |
711 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
712 * 2 LYS_CONFIG_R |x|x|x|x|x|x|x| | | | | | | |
713 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
714 * 3 LYS_STATUS_CURR |x|x|x|x|x|x|x|x|x|x|x|x| |x|
715 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
716 * 4 LYS_STATUS_DEPRC |x|x|x|x|x|x|x|x|x|x|x|x| |x|
717 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
718 * 5 LYS_STATUS_OBSLT |x|x|x|x|x|x|x|x|x|x|x|x| |x|
719 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
720 * 6 LYS_MAND_TRUE |x|x|x|x|x|x| | | | | | | | |
721 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
722 * 7 LYS_ORDBY_USER | | | |x|x| | | | | | | | | |
723 * LYS_MAND_FALSE | |x|x| | |x| | | | | | | | |
724 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
725 * 8 LYS_ORDBY_SYSTEM | | | |x|x| | | | | | | | | |
726 * LYS_PRESENCE |x| | | | | | | | | | | | | |
727 * LYS_UNIQUE | | |x| | | | | | | | | | | |
728 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
729 * 9 LYS_KEY | | |x| | | | | | | | | | | |
730 * LYS_FENABLED | | | | | | | | | |x| | | | |
731 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
732 * 10 LYS_SET_DFLT | | |x|x| | |x| | | | | | | |
733 * LYS_ISENUM | | | | | | | | | | | | |x| |
734 * LYS_KEYLESS | | | | |x| | | | | | | | | |
735 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
736 * 11 LYS_SET_UNITS | | |x|x| | | | | | | | | | |
737 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
738 * 12 LYS_SET_CONFIG |x|x|x|x|x|x| | | | | | | | |
739 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Radek Krejci4f28eda2018-11-12 11:46:16 +0100740 *
741 */
742
743/**
744 * @defgroup snodeflags Schema nodes flags
Radek Krejci4f28eda2018-11-12 11:46:16 +0100745 * @{
746 */
Michal Vasko1bf09392020-03-27 12:38:10 +0100747#define LYS_CONFIG_W 0x01 /**< config true; also set for input children nodes */
748#define LYS_CONFIG_R 0x02 /**< config false; also set for output and notification children nodes */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200749#define LYS_CONFIG_MASK 0x03 /**< mask for config value */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100750#define LYS_STATUS_CURR 0x04 /**< status current; */
751#define LYS_STATUS_DEPRC 0x08 /**< status deprecated; */
752#define LYS_STATUS_OBSLT 0x10 /**< status obsolete; */
753#define LYS_STATUS_MASK 0x1C /**< mask for status value */
754#define LYS_MAND_TRUE 0x20 /**< mandatory true; applicable only to ::lysp_node_choice/::lysc_node_choice,
Radek Krejcife909632019-02-12 15:34:42 +0100755 ::lysp_node_leaf/::lysc_node_leaf and ::lysp_node_anydata/::lysc_node_anydata.
756 The ::lysc_node_leaflist and ::lysc_node_leaflist have this flag in case that min-elements > 0.
757 The ::lysc_node_container has this flag if it is not a presence container and it has at least one
758 child with LYS_MAND_TRUE. */
Radek Krejcif1421c22019-02-19 13:05:20 +0100759#define LYS_MAND_FALSE 0x40 /**< mandatory false; applicable only to ::lysp_node_choice/::lysc_node_choice,
760 ::lysp_node_leaf/::lysc_node_leaf and ::lysp_node_anydata/::lysc_node_anydata.
761 This flag is present only in case the mandatory false statement was explicitly specified. */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100762#define LYS_MAND_MASK 0x60 /**< mask for mandatory values */
Michal Vaskoc118ae22020-08-06 14:51:09 +0200763#define LYS_PRESENCE 0x80 /**< flag for presence property of a container, but it is not only for explicit presence
764 containers, but also for NP containers with some meaning, applicable only to
765 ::lysc_node_container */
Radek Krejci7adf4ff2018-12-05 08:55:00 +0100766#define LYS_UNIQUE 0x80 /**< flag for leafs being part of a unique set, applicable only to ::lysc_node_leaf */
767#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 +0200768#define LYS_KEYLESS 0x200 /**< flag for list without any key, applicable only to ::lysc_node_list */
Radek Krejci7adf4ff2018-12-05 08:55:00 +0100769#define LYS_FENABLED 0x100 /**< feature enabled flag, applicable only to ::lysc_feature */
Radek Krejcife909632019-02-12 15:34:42 +0100770#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 +0100771 ::lysc_node_list/::lysp_node_list */
772#define LYS_ORDBY_USER 0x40 /**< ordered-by user lists, applicable only to ::lysc_node_leaflist/::lysp_node_leaflist and
773 ::lysc_node_list/::lysp_node_list */
774#define LYS_ORDBY_MASK 0x60 /**< mask for ordered-by values */
775#define LYS_YINELEM_TRUE 0x80 /**< yin-element true for extension's argument */
776#define LYS_YINELEM_FALSE 0x100 /**< yin-element false for extension's argument */
777#define LYS_YINELEM_MASK 0x180 /**< mask for yin-element value */
Radek Krejcif2de0ed2019-05-02 14:13:18 +0200778#define LYS_USED_GRP 0x400 /**< internal flag for validating not-instantiated groupings
779 (resp. do not validate again the instantiated groupings). */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100780#define LYS_SET_VALUE 0x200 /**< value attribute is set */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100781#define LYS_SET_MIN 0x200 /**< min attribute is set */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200782#define LYS_SET_MAX 0x400 /**< max attribute is set */
Radek Krejcid505e3d2018-11-13 09:04:17 +0100783
784#define LYS_SET_BASE 0x0001 /**< type's flag for present base substatement */
785#define LYS_SET_BIT 0x0002 /**< type's flag for present bit substatement */
786#define LYS_SET_ENUM 0x0004 /**< type's flag for present enum substatement */
787#define LYS_SET_FRDIGITS 0x0008 /**< type's flag for present fraction-digits substatement */
788#define LYS_SET_LENGTH 0x0010 /**< type's flag for present length substatement */
789#define LYS_SET_PATH 0x0020 /**< type's flag for present path substatement */
790#define LYS_SET_PATTERN 0x0040 /**< type's flag for present pattern substatement */
791#define LYS_SET_RANGE 0x0080 /**< type's flag for present range substatement */
792#define LYS_SET_TYPE 0x0100 /**< type's flag for present type substatement */
793#define LYS_SET_REQINST 0x0200 /**< type's flag for present require-instance substatement */
Radek Krejciccd20f12019-02-15 14:12:27 +0100794#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 +0100795 cases of choice. This information is important for refines, since it is prohibited to make leafs
796 with default statement mandatory. In case the default leaf value is taken from type, it is thrown
Radek Krejciccd20f12019-02-15 14:12:27 +0100797 away when it is refined to be mandatory node. Similarly it is used for deviations to distinguish
798 between own default or the default values taken from the type. */
799#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 +0100800#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 +0100801
Radek Krejcif56e2a42019-09-09 14:15:25 +0200802#define LYS_SINGLEQUOTED 0x100 /**< flag for single-quoted argument of an extension instance's substatement, only when the source is YANG */
803#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 +0200804
Radek Krejcif56e2a42019-09-09 14:15:25 +0200805#define LYS_YIN_ATTR 0x400 /**< flag to identify YIN attribute parsed as extension's substatement, only when the source is YIN */
806#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 +0200807
Radek Krejci693262f2019-04-29 15:23:20 +0200808#define LYS_ISENUM 0x200 /**< flag to simply distinguish type in struct lysc_type_bitenum_item */
809
Radek Krejcife909632019-02-12 15:34:42 +0100810#define LYS_FLAGS_COMPILED_MASK 0xff /**< mask for flags that maps to the compiled structures */
Radek Krejci2ff0d572020-05-21 15:27:28 +0200811/** @} snodeflags */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200812
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200813/**
814 * @brief Generic YANG data node
815 */
816struct lysp_node {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100817 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200818 uint16_t nodetype; /**< type of the node (mandatory) */
819 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100820 struct lysp_node *next; /**< next sibling node (NULL if there is no one) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200821 const char *name; /**< node name (mandatory) */
822 const char *dsc; /**< description statement */
823 const char *ref; /**< reference statement */
824 struct lysp_when *when; /**< when statement */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200825 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)),
826 must be qname because of refines */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200827 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200828};
829
830/**
831 * @brief Extension structure of the lysp_node for YANG container
832 */
833struct lysp_node_container {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100834 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200835 uint16_t nodetype; /**< LYS_CONTAINER */
836 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
837 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
838 const char *name; /**< node name (mandatory) */
839 const char *dsc; /**< description statement */
840 const char *ref; /**< reference statement */
841 struct lysp_when *when; /**< when statement */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200842 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200843 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200844
845 /* container */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200846 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200847 const char *presence; /**< presence description */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200848 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
849 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200850 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200851 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
852 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200853};
854
855struct lysp_node_leaf {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100856 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200857 uint16_t nodetype; /**< LYS_LEAF */
858 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
859 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
860 const char *name; /**< node name (mandatory) */
861 const char *dsc; /**< description statement */
862 const char *ref; /**< reference statement */
863 struct lysp_when *when; /**< when statement */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200864 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200865 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200866
867 /* leaf */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200868 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200869 struct lysp_type type; /**< type of the leaf node (mandatory) */
870 const char *units; /**< units of the leaf's type */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200871 struct lysp_qname dflt; /**< default value, it may or may not be a qualified name */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200872};
873
874struct lysp_node_leaflist {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100875 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200876 uint16_t nodetype; /**< LYS_LEAFLIST */
877 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
878 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
879 const char *name; /**< node name (mandatory) */
880 const char *dsc; /**< description statement */
881 const char *ref; /**< reference statement */
882 struct lysp_when *when; /**< when statement */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200883 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200884 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200885
886 /* leaf-list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200887 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200888 struct lysp_type type; /**< type of the leaf node (mandatory) */
889 const char *units; /**< units of the leaf's type */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200890 struct lysp_qname *dflts; /**< list of default values ([sized array](@ref sizedarrays)), they may or
891 may not be qualified names */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200892 uint32_t min; /**< min-elements constraint */
893 uint32_t max; /**< max-elements constraint, 0 means unbounded */
894};
895
896struct lysp_node_list {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100897 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200898 uint16_t nodetype; /**< LYS_LIST */
899 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
900 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
901 const char *name; /**< node name (mandatory) */
902 const char *dsc; /**< description statement */
903 const char *ref; /**< reference statement */
904 struct lysp_when *when; /**< when statement */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200905 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200906 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200907
908 /* list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200909 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200910 const char *key; /**< keys specification */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200911 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
912 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200913 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200914 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
915 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200916 struct lysp_qname *uniques; /**< list of unique specifications ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200917 uint32_t min; /**< min-elements constraint */
918 uint32_t max; /**< max-elements constraint, 0 means unbounded */
919};
920
921struct lysp_node_choice {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100922 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200923 uint16_t nodetype; /**< LYS_CHOICE */
924 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
925 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
926 const char *name; /**< node name (mandatory) */
927 const char *dsc; /**< description statement */
928 const char *ref; /**< reference statement */
929 struct lysp_when *when; /**< when statement */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200930 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200931 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200932
933 /* choice */
934 struct lysp_node *child; /**< list of data nodes (linked list) */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200935 struct lysp_qname dflt; /**< default case */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200936};
937
938struct lysp_node_case {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100939 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200940 uint16_t nodetype; /**< LYS_CASE */
941 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
942 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
943 const char *name; /**< node name (mandatory) */
944 const char *dsc; /**< description statement */
945 const char *ref; /**< reference statement */
946 struct lysp_when *when; /**< when statement */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200947 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200948 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200949
950 /* case */
951 struct lysp_node *child; /**< list of data nodes (linked list) */
952};
953
954struct lysp_node_anydata {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100955 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200956 uint16_t nodetype; /**< LYS_ANYXML or LYS_ANYDATA */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200957 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
958 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
959 const char *name; /**< node name (mandatory) */
960 const char *dsc; /**< description statement */
961 const char *ref; /**< reference statement */
962 struct lysp_when *when; /**< when statement */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200963 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200964 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200965
966 /* anyxml/anydata */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200967 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200968};
969
970struct lysp_node_uses {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100971 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200972 uint16_t nodetype; /**< LYS_USES */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200973 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
974 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
975 const char *name; /**< grouping name reference (mandatory) */
976 const char *dsc; /**< description statement */
977 const char *ref; /**< reference statement */
978 struct lysp_when *when; /**< when statement */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200979 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200980 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200981
982 /* uses */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200983 struct lysp_refine *refines; /**< list of uses's refines ([sized array](@ref sizedarrays)) */
984 struct lysp_augment *augments; /**< list of uses's augment ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200985};
986
987/**
988 * @brief YANG input-stmt and output-stmt
989 */
990struct lysp_action_inout {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100991 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200992 uint16_t nodetype; /**< LYS_INPUT or LYS_OUTPUT */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200993 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
994 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
995 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200996 struct lysp_node *data; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200997 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200998};
999
1000/**
1001 * @brief YANG rpc-stmt and action-stmt
1002 */
1003struct lysp_action {
Radek Krejci6d9b9b52018-11-02 12:43:39 +01001004 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Michal Vasko1bf09392020-03-27 12:38:10 +01001005 uint16_t nodetype; /**< LYS_RPC or LYS_ACTION */
Radek Krejci6d9b9b52018-11-02 12:43:39 +01001006 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Michal Vasko7f45cf22020-10-01 12:49:44 +02001007 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001008 const char *name; /**< grouping name reference (mandatory) */
1009 const char *dsc; /**< description statement */
1010 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001011 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Michal Vasko7f45cf22020-10-01 12:49:44 +02001012 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1013 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1014
1015 /* action */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001016 struct lysp_action_inout input; /**< RPC's/Action's input */
1017 struct lysp_action_inout output; /**< RPC's/Action's output */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001018};
1019
1020/**
1021 * @brief YANG notification-stmt
1022 */
1023struct lysp_notif {
Radek Krejci6d9b9b52018-11-02 12:43:39 +01001024 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
1025 uint16_t nodetype; /**< LYS_NOTIF */
1026 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values are allowed */
Michal Vasko7f45cf22020-10-01 12:49:44 +02001027 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001028 const char *name; /**< grouping name reference (mandatory) */
1029 const char *dsc; /**< description statement */
1030 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001031 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Michal Vasko7f45cf22020-10-01 12:49:44 +02001032 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001033 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vasko7f45cf22020-10-01 12:49:44 +02001034
1035 /* notif */
1036 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1037 struct lysp_node *data; /**< list of data nodes (linked list) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001038};
1039
1040/**
Radek Krejcif0fceb62018-09-05 14:58:45 +02001041 * @brief supported YANG schema version values
1042 */
1043typedef enum LYS_VERSION {
1044 LYS_VERSION_UNDEF = 0, /**< no specific version, YANG 1.0 as default */
Radek Krejci96e48da2020-09-04 13:18:06 +02001045 LYS_VERSION_1_0 = 1, /**< YANG 1 (1.0) */
Radek Krejcif0fceb62018-09-05 14:58:45 +02001046 LYS_VERSION_1_1 = 2 /**< YANG 1.1 */
1047} LYS_VERSION;
1048
1049/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001050 * @brief Printable YANG schema tree structure representing YANG module.
1051 *
1052 * Simple structure corresponding to the YANG format. The schema is only syntactically validated.
1053 */
1054struct lysp_module {
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001055 struct lys_module *mod; /**< covering module structure */
1056
Radek Krejcib7db73a2018-10-24 14:18:40 +02001057 struct lysp_revision *revs; /**< list of the module revisions ([sized array](@ref sizedarrays)), the first revision
1058 in the list is always the last (newest) revision of the module */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001059 struct lysp_import *imports; /**< list of imported modules ([sized array](@ref sizedarrays)) */
1060 struct lysp_include *includes; /**< list of included submodules ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001061 struct lysp_ext *extensions; /**< list of extension statements ([sized array](@ref sizedarrays)) */
1062 struct lysp_feature *features; /**< list of feature definitions ([sized array](@ref sizedarrays)) */
1063 struct lysp_ident *identities; /**< list of identities ([sized array](@ref sizedarrays)) */
1064 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
1065 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001066 struct lysp_node *data; /**< list of module's top-level data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001067 struct lysp_augment *augments; /**< list of augments ([sized array](@ref sizedarrays)) */
1068 struct lysp_action *rpcs; /**< list of RPCs ([sized array](@ref sizedarrays)) */
1069 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
1070 struct lysp_deviation *deviations; /**< list of deviations ([sized array](@ref sizedarrays)) */
Michal Vaskoc3781c32020-10-06 14:04:08 +02001071 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001072
Michal Vaskoc3781c32020-10-06 14:04:08 +02001073 uint8_t parsing : 1; /**< flag for circular check */
1074 uint8_t is_submod : 1; /**< always 0 */
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001075};
1076
1077struct lysp_submodule {
Michal Vaskoc3781c32020-10-06 14:04:08 +02001078 struct lys_module *mod; /**< belongs to parent module (submodule - mandatory) */
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001079
1080 struct lysp_revision *revs; /**< list of the module revisions ([sized array](@ref sizedarrays)), the first revision
1081 in the list is always the last (newest) revision of the module */
1082 struct lysp_import *imports; /**< list of imported modules ([sized array](@ref sizedarrays)) */
1083 struct lysp_include *includes; /**< list of included submodules ([sized array](@ref sizedarrays)) */
1084 struct lysp_ext *extensions; /**< list of extension statements ([sized array](@ref sizedarrays)) */
1085 struct lysp_feature *features; /**< list of feature definitions ([sized array](@ref sizedarrays)) */
1086 struct lysp_ident *identities; /**< list of identities ([sized array](@ref sizedarrays)) */
1087 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
1088 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
1089 struct lysp_node *data; /**< list of module's top-level data nodes (linked list) */
1090 struct lysp_augment *augments; /**< list of augments ([sized array](@ref sizedarrays)) */
1091 struct lysp_action *rpcs; /**< list of RPCs ([sized array](@ref sizedarrays)) */
1092 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
1093 struct lysp_deviation *deviations; /**< list of deviations ([sized array](@ref sizedarrays)) */
Michal Vaskoc3781c32020-10-06 14:04:08 +02001094 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001095
Michal Vaskoc3781c32020-10-06 14:04:08 +02001096 uint8_t parsing : 1; /**< flag for circular check */
1097 uint8_t is_submod : 1; /**< always 1 */
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001098
Michal Vaskoc3781c32020-10-06 14:04:08 +02001099 uint8_t latest_revision : 2; /**< flag to mark the latest available revision:
Radek Krejci086c7132018-10-26 15:29:04 +02001100 1 - the latest revision in searchdirs was not searched yet and this is the
1101 latest revision in the current context
1102 2 - searchdirs were searched and this is the latest available revision */
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001103 const char *name; /**< name of the module (mandatory) */
1104 const char *filepath; /**< path, if the schema was read from a file, NULL in case of reading from memory */
1105 const char *prefix; /**< submodule belongsto prefix of main module (mandatory) */
1106 const char *org; /**< party/company responsible for the module */
1107 const char *contact; /**< contact information for the module */
1108 const char *dsc; /**< description of the module */
1109 const char *ref; /**< cross-reference for the module */
Radek Krejci086c7132018-10-26 15:29:04 +02001110 uint8_t version; /**< yang-version (LYS_VERSION values) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001111};
1112
1113/**
Radek Krejci3f5e3db2018-10-11 15:57:47 +02001114 * @brief Free the printable YANG schema tree structure.
1115 *
1116 * @param[in] module Printable YANG schema tree structure to free.
1117 */
1118void lysp_module_free(struct lysp_module *module);
1119
1120/**
Radek Krejci0e59c312019-08-15 15:34:15 +02001121 * @brief Compiled YANG extension-stmt
1122 */
1123struct lysc_ext {
1124 const char *name; /**< extension name */
1125 const char *argument; /**< argument name, NULL if not specified */
Radek Krejci0e59c312019-08-15 15:34:15 +02001126 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1127 struct lyext_plugin *plugin; /**< Plugin implementing the specific extension */
Radek Krejci0935f412019-08-20 16:15:18 +02001128 struct lys_module *module; /**< module structure */
Michal Vasko6f4cbb62020-02-28 11:15:47 +01001129 uint32_t refcount; /**< reference counter since extension definition is shared among all its instances */
Radek Krejci0e59c312019-08-15 15:34:15 +02001130 uint16_t flags; /**< LYS_STATUS_* value (@ref snodeflags) */
1131};
1132
1133/**
Radek Krejcice8c1592018-10-29 15:35:51 +01001134 * @brief YANG extension instance
1135 */
1136struct lysc_ext_instance {
Radek Krejciad5963b2019-09-06 16:03:05 +02001137 uint32_t insubstmt_index; /**< in case the instance is in a substatement that can appear multiple times,
1138 this identifies the index of the substatement for this extension instance */
Radek Krejci28681fa2019-09-06 13:08:45 +02001139 struct lys_module *module; /**< module where the extension instantiated is defined */
Radek Krejciad5963b2019-09-06 16:03:05 +02001140 struct lysc_ext *def; /**< pointer to the extension definition */
Radek Krejcice8c1592018-10-29 15:35:51 +01001141 void *parent; /**< pointer to the parent element holding the extension instance(s), use
1142 ::lysc_ext_instance#parent_type to access the schema element */
1143 const char *argument; /**< optional value of the extension's argument */
1144 LYEXT_SUBSTMT insubstmt; /**< value identifying placement of the extension instance */
Radek Krejci2a408df2018-10-29 16:32:26 +01001145 LYEXT_PARENT parent_type; /**< type of the parent structure */
Radek Krejci2a408df2018-10-29 16:32:26 +01001146 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci0e59c312019-08-15 15:34:15 +02001147 void *data; /**< private plugins's data, not used by libyang */
Radek Krejcice8c1592018-10-29 15:35:51 +01001148};
1149
1150/**
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001151 * @brief Compiled YANG if-feature-stmt
1152 */
1153struct lysc_iffeature {
1154 uint8_t *expr; /**< 2bits array describing the if-feature expression in prefix format, see @ref ifftokens */
1155 struct lysc_feature **features; /**< array of pointers to the features used in expression ([sized array](@ref sizedarrays)) */
1156};
1157
1158/**
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001159 * @brief YANG when-stmt
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001160 */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001161struct lysc_when {
Michal Vasko5516b702020-10-06 14:07:11 +02001162 struct lys_module *module; /**< module where the when was defined */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001163 struct lyxp_expr *cond; /**< XPath when condition */
Michal Vasko175012e2019-11-06 15:49:14 +01001164 struct lysc_node *context; /**< context node for evaluating the expression, NULL if the context is root node */
Radek Krejcic8b31002019-01-08 10:24:45 +01001165 const char *dsc; /**< description */
1166 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001167 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci00b874b2019-02-12 10:54:50 +01001168 uint32_t refcount; /**< reference counter since some of the when statements are shared among several nodes */
Michal Vaskoecd62de2019-11-13 12:35:11 +01001169 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS is allowed */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001170};
1171
1172/**
Radek Krejci2a408df2018-10-29 16:32:26 +01001173 * @brief YANG identity-stmt
1174 */
1175struct lysc_ident {
1176 const char *name; /**< identity name (mandatory), including possible prefix */
Radek Krejcic8b31002019-01-08 10:24:45 +01001177 const char *dsc; /**< description */
1178 const char *ref; /**< reference */
Radek Krejci693262f2019-04-29 15:23:20 +02001179 struct lys_module *module; /**< module structure */
Radek Krejci2a408df2018-10-29 16:32:26 +01001180 struct lysc_ident **derived; /**< list of (pointers to the) derived identities ([sized array](@ref sizedarrays)) */
1181 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001182 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejci2a408df2018-10-29 16:32:26 +01001183 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_ values are allowed */
1184};
1185
1186/**
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001187 * @brief YANG feature-stmt
1188 */
1189struct lysc_feature {
1190 const char *name; /**< feature name (mandatory) */
Radek Krejcic8b31002019-01-08 10:24:45 +01001191 const char *dsc; /**< description */
1192 const char *ref; /**< reference */
Radek Krejci693262f2019-04-29 15:23:20 +02001193 struct lys_module *module; /**< module structure */
Radek Krejci151a5b72018-10-19 14:21:44 +02001194 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 +01001195 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001196 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001197 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* and
1198 #LYS_FENABLED values allowed */
1199};
1200
Radek Krejci151a5b72018-10-19 14:21:44 +02001201/**
1202 * @defgroup ifftokens if-feature expression tokens
1203 * Tokens of if-feature expression used in ::lysc_iffeature#expr
1204 *
1205 * @{
1206 */
1207#define LYS_IFF_NOT 0x00 /**< operand "not" */
1208#define LYS_IFF_AND 0x01 /**< operand "and" */
1209#define LYS_IFF_OR 0x02 /**< operand "or" */
1210#define LYS_IFF_F 0x03 /**< feature */
Radek Krejci2ff0d572020-05-21 15:27:28 +02001211/** @} ifftokens */
Radek Krejci151a5b72018-10-19 14:21:44 +02001212
1213/**
Radek Krejcib7db73a2018-10-24 14:18:40 +02001214 * @brief Compiled YANG revision statement
1215 */
1216struct lysc_revision {
1217 char date[LY_REV_SIZE]; /**< revision-date (mandatory) */
1218 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1219};
1220
Radek Krejci2167ee12018-11-02 16:09:07 +01001221struct lysc_range {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001222 struct lysc_range_part {
Radek Krejci693262f2019-04-29 15:23:20 +02001223 union { /**< min boundary */
Radek Krejcie7b95092019-05-15 11:03:07 +02001224 int64_t min_64; /**< for int8, int16, int32, int64 and decimal64 ( >= LY_TYPE_DEC64) */
1225 uint64_t min_u64; /**< for uint8, uint16, uint32, uint64, string and binary ( < LY_TYPE_DEC64) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001226 };
Radek Krejci693262f2019-04-29 15:23:20 +02001227 union { /**< max boundary */
Radek Krejcie7b95092019-05-15 11:03:07 +02001228 int64_t max_64; /**< for int8, int16, int32, int64 and decimal64 ( >= LY_TYPE_DEC64) */
1229 uint64_t max_u64; /**< for uint8, uint16, uint32, uint64, string and binary ( < LY_TYPE_DEC64) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001230 };
Radek Krejci4f28eda2018-11-12 11:46:16 +01001231 } *parts; /**< compiled range expression ([sized array](@ref sizedarrays)) */
Radek Krejcic8b31002019-01-08 10:24:45 +01001232 const char *dsc; /**< description */
1233 const char *ref; /**< reference */
Radek Krejci2167ee12018-11-02 16:09:07 +01001234 const char *emsg; /**< error-message */
1235 const char *eapptag; /**< error-app-tag value */
1236 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1237};
1238
1239struct lysc_pattern {
Radek Krejci54579462019-04-30 12:47:06 +02001240 const char *expr; /**< original, not compiled, regular expression */
1241 pcre2_code *code; /**< compiled regular expression */
Radek Krejcic8b31002019-01-08 10:24:45 +01001242 const char *dsc; /**< description */
1243 const char *ref; /**< reference */
Radek Krejci2167ee12018-11-02 16:09:07 +01001244 const char *emsg; /**< error-message */
1245 const char *eapptag; /**< error-app-tag value */
1246 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci0f969882020-08-21 16:56:47 +02001247 uint32_t inverted : 1; /**< invert-match flag */
1248 uint32_t refcount : 31; /**< reference counter */
Radek Krejci2167ee12018-11-02 16:09:07 +01001249};
1250
1251struct lysc_must {
1252 struct lys_module *module; /**< module where the must was defined */
1253 struct lyxp_expr *cond; /**< XPath when condition */
Radek Krejcic8b31002019-01-08 10:24:45 +01001254 const char *dsc; /**< description */
1255 const char *ref; /**< reference */
Radek Krejci2167ee12018-11-02 16:09:07 +01001256 const char *emsg; /**< error-message */
1257 const char *eapptag; /**< error-app-tag value */
1258 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1259};
1260
1261struct lysc_type {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001262 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie7b95092019-05-15 11:03:07 +02001263 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 +01001264 LY_DATA_TYPE basetype; /**< Base type of the type */
1265 uint32_t refcount; /**< reference counter for type sharing */
1266};
1267
1268struct lysc_type_num {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001269 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie7b95092019-05-15 11:03:07 +02001270 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 +01001271 LY_DATA_TYPE basetype; /**< Base type of the type */
1272 uint32_t refcount; /**< reference counter for type sharing */
1273 struct lysc_range *range; /**< Optional range limitation */
1274};
1275
1276struct lysc_type_dec {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001277 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie7b95092019-05-15 11:03:07 +02001278 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 +01001279 LY_DATA_TYPE basetype; /**< Base type of the type */
1280 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci6cba4292018-11-15 17:33:29 +01001281 uint8_t fraction_digits; /**< fraction digits specification */
Radek Krejci2167ee12018-11-02 16:09:07 +01001282 struct lysc_range *range; /**< Optional range limitation */
1283};
1284
1285struct lysc_type_str {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001286 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie7b95092019-05-15 11:03:07 +02001287 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 +01001288 LY_DATA_TYPE basetype; /**< Base type of the type */
1289 uint32_t refcount; /**< reference counter for type sharing */
1290 struct lysc_range *length; /**< Optional length limitation */
Radek Krejci4586a022018-11-13 11:29:26 +01001291 struct lysc_pattern **patterns; /**< Optional list of pointers to pattern limitations ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001292};
1293
Radek Krejci693262f2019-04-29 15:23:20 +02001294struct lysc_type_bitenum_item {
1295 const char *name; /**< enumeration identifier */
1296 const char *dsc; /**< description */
1297 const char *ref; /**< reference */
1298 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1299 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1300 union {
1301 int32_t value; /**< integer value associated with the enumeration */
1302 uint32_t position; /**< non-negative integer value associated with the bit */
1303 };
1304 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_ and LYS_SET_VALUE
1305 values are allowed */
1306};
1307
Radek Krejci2167ee12018-11-02 16:09:07 +01001308struct lysc_type_enum {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001309 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie7b95092019-05-15 11:03:07 +02001310 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 +01001311 LY_DATA_TYPE basetype; /**< Base type of the type */
1312 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci693262f2019-04-29 15:23:20 +02001313 struct lysc_type_bitenum_item *enums; /**< enumerations list ([sized array](@ref sizedarrays)), mandatory (at least 1 item) */
1314};
1315
1316struct lysc_type_bits {
1317 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie7b95092019-05-15 11:03:07 +02001318 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 +02001319 LY_DATA_TYPE basetype; /**< Base type of the type */
1320 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci849a62a2019-05-22 15:29:05 +02001321 struct lysc_type_bitenum_item *bits; /**< bits list ([sized array](@ref sizedarrays)), mandatory (at least 1 item),
1322 the items are ordered by their position value. */
Radek Krejci2167ee12018-11-02 16:09:07 +01001323};
1324
1325struct lysc_type_leafref {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001326 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie7b95092019-05-15 11:03:07 +02001327 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 +01001328 LY_DATA_TYPE basetype; /**< Base type of the type */
1329 uint32_t refcount; /**< reference counter for type sharing */
Michal Vasko004d3152020-06-11 19:59:22 +02001330 struct lyxp_expr *path; /**< parsed target path, compiled path cannot be stored because of type sharing */
Michal Vasko72619ce2020-10-06 14:05:32 +02001331 const struct lys_module *path_mod; /**< module where the path is defined, so it provides context to resolve prefixes */
Radek Krejci412ddfa2018-11-23 11:44:11 +01001332 struct lysc_type *realtype; /**< pointer to the real (first non-leafref in possible leafrefs chain) type. */
Radek Krejci2167ee12018-11-02 16:09:07 +01001333 uint8_t require_instance; /**< require-instance flag */
1334};
1335
1336struct lysc_type_identityref {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001337 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie7b95092019-05-15 11:03:07 +02001338 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 +01001339 LY_DATA_TYPE basetype; /**< Base type of the type */
1340 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci555cb5b2018-11-16 14:54:33 +01001341 struct lysc_ident **bases; /**< list of pointers to the base identities ([sized array](@ref sizedarrays)),
Radek Krejci2167ee12018-11-02 16:09:07 +01001342 mandatory (at least 1 item) */
1343};
1344
1345struct lysc_type_instanceid {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001346 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie7b95092019-05-15 11:03:07 +02001347 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 +01001348 LY_DATA_TYPE basetype; /**< Base type of the type */
1349 uint32_t refcount; /**< reference counter for type sharing */
1350 uint8_t require_instance; /**< require-instance flag */
1351};
1352
Radek Krejci2167ee12018-11-02 16:09:07 +01001353struct lysc_type_union {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001354 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie7b95092019-05-15 11:03:07 +02001355 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 +01001356 LY_DATA_TYPE basetype; /**< Base type of the type */
1357 uint32_t refcount; /**< reference counter for type sharing */
1358 struct lysc_type **types; /**< list of types in the union ([sized array](@ref sizedarrays)), mandatory (at least 1 item) */
1359};
1360
1361struct lysc_type_bin {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001362 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie7b95092019-05-15 11:03:07 +02001363 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 +01001364 LY_DATA_TYPE basetype; /**< Base type of the type */
1365 uint32_t refcount; /**< reference counter for type sharing */
1366 struct lysc_range *length; /**< Optional length limitation */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001367};
1368
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001369struct lysc_action_inout {
Michal Vasko7f45cf22020-10-01 12:49:44 +02001370 uint16_t nodetype; /**< LYS_INPUT or LYS_OUTPUT */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001371 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 */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001394 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1395 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1396
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001397 struct lysc_action_inout input; /**< RPC's/action's input */
1398 struct lysc_action_inout output; /**< RPC's/action's output */
Michal Vaskoceab6dd2020-10-09 16:53:36 +02001399 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Michal Vasko2fd91b92020-07-17 16:39:02 +02001400 void *priv; /** private arbitrary user data, not used by libyang */
1401
Radek Krejci056d0a82018-12-06 16:57:25 +01001402};
1403
1404struct lysc_notif {
1405 uint16_t nodetype; /**< LYS_NOTIF */
1406 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Michal Vasko60ea6352020-06-29 13:39:39 +02001407 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser */
Radek Krejci95710c92019-02-11 15:49:55 +01001408 struct lys_module *module; /**< module structure */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001409 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 +01001410 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1411
Radek Krejcifc11bd72019-04-11 16:00:05 +02001412 struct lysc_node *data; /**< first child node (linked list) */
1413 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1414
Radek Krejci056d0a82018-12-06 16:57:25 +01001415 const char *name; /**< Notification name (mandatory) */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001416 const char *dsc; /**< description */
1417 const char *ref; /**< reference */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001418 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1419 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Michal Vaskoceab6dd2020-10-09 16:53:36 +02001420 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Michal Vasko2fd91b92020-07-17 16:39:02 +02001421 void *priv; /** private arbitrary user data, not used by libyang */
Radek Krejci056d0a82018-12-06 16:57:25 +01001422};
1423
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001424/**
Radek Krejci0af5f5d2018-09-07 15:00:30 +02001425 * @brief Compiled YANG data node
1426 */
1427struct lysc_node {
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001428 uint16_t nodetype; /**< type of the node (mandatory) */
1429 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Michal Vasko60ea6352020-06-29 13:39:39 +02001430 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001431 struct lys_module *module; /**< module structure */
Michal Vaskocc048b22020-03-27 15:52:38 +01001432 struct lysp_node *sp; /**< simply parsed (SP) original of the node, NULL if the SP schema was removed or
1433 in case of implicit case node. */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001434 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1435 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1436 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1437 never NULL. If there is no sibling node, pointer points to the node
1438 itself. In case of the first node, this pointer points to the last
1439 node in the list. */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001440 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001441 const char *dsc; /**< description */
1442 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001443 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci056d0a82018-12-06 16:57:25 +01001444 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001445 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Michal Vasko2fd91b92020-07-17 16:39:02 +02001446 void *priv; /**< private arbitrary user data, not used by libyang */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001447};
1448
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001449struct lysc_node_container {
1450 uint16_t nodetype; /**< LYS_CONTAINER */
1451 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Michal Vasko60ea6352020-06-29 13:39:39 +02001452 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001453 struct lys_module *module; /**< module structure */
1454 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. */
1455 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1456 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1457 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1458 never NULL. If there is no sibling node, pointer points to the node
1459 itself. In case of the first node, this pointer points to the last
1460 node in the list. */
1461 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001462 const char *dsc; /**< description */
1463 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001464 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001465 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001466 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Michal Vasko2fd91b92020-07-17 16:39:02 +02001467 void *priv; /**< private arbitrary user data, not used by libyang */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001468
1469 struct lysc_node *child; /**< first child node (linked list) */
1470 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1471 struct lysc_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
1472 struct lysc_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001473};
1474
Radek Krejcia3045382018-11-22 14:30:31 +01001475struct lysc_node_case {
Radek Krejci056d0a82018-12-06 16:57:25 +01001476 uint16_t nodetype; /**< LYS_CASE */
1477 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Michal Vasko60ea6352020-06-29 13:39:39 +02001478 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser, unused */
Radek Krejci056d0a82018-12-06 16:57:25 +01001479 struct lys_module *module; /**< module structure */
1480 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. */
1481 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1482 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1483 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1484 never NULL. If there is no sibling node, pointer points to the node
1485 itself. In case of the first node, this pointer points to the last
1486 node in the list. */
Radek Krejcia3045382018-11-22 14:30:31 +01001487 const char *name; /**< name of the case, including the implicit case */
Radek Krejci12fb9142019-01-08 09:45:30 +01001488 const char *dsc; /**< description */
1489 const char *ref; /**< reference */
Radek Krejci056d0a82018-12-06 16:57:25 +01001490 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci056d0a82018-12-06 16:57:25 +01001491 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001492 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Michal Vasko2fd91b92020-07-17 16:39:02 +02001493 void *priv; /**< private arbitrary user data, not used by libyang */
Radek Krejci056d0a82018-12-06 16:57:25 +01001494
Radek Krejcia3045382018-11-22 14:30:31 +01001495 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 +01001496 each other as siblings with the parent pointer pointing to appropriate case node. */
Radek Krejcia3045382018-11-22 14:30:31 +01001497};
1498
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001499struct lysc_node_choice {
1500 uint16_t nodetype; /**< LYS_CHOICE */
1501 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Michal Vasko60ea6352020-06-29 13:39:39 +02001502 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser, unused */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001503 struct lys_module *module; /**< module structure */
1504 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. */
1505 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1506 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1507 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1508 never NULL. If there is no sibling node, pointer points to the node
1509 itself. In case of the first node, this pointer points to the last
1510 node in the list. */
1511 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001512 const char *dsc; /**< description */
1513 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001514 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci056d0a82018-12-06 16:57:25 +01001515 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001516 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Michal Vasko2fd91b92020-07-17 16:39:02 +02001517 void *priv; /**< private arbitrary user data, not used by libyang */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001518
Radek Krejcia9026eb2018-12-12 16:04:47 +01001519 struct lysc_node_case *cases; /**< list of the cases (linked list). Note that all the children of all the cases are linked each other
1520 as siblings. Their parent pointers points to the specific case they belongs to, so distinguish the
1521 case is simple. */
Radek Krejci056d0a82018-12-06 16:57:25 +01001522 struct lysc_node_case *dflt; /**< default case of the choice, only a pointer into the cases array. */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001523};
1524
1525struct lysc_node_leaf {
1526 uint16_t nodetype; /**< LYS_LEAF */
1527 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Michal Vasko60ea6352020-06-29 13:39:39 +02001528 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001529 struct lys_module *module; /**< module structure */
1530 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. */
1531 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1532 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1533 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1534 never NULL. If there is no sibling node, pointer points to the node
1535 itself. In case of the first node, this pointer points to the last
1536 node in the list. */
1537 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001538 const char *dsc; /**< description */
1539 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001540 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001541 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001542 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Michal Vasko2fd91b92020-07-17 16:39:02 +02001543 void *priv; /**< private arbitrary user data, not used by libyang */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001544
1545 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1546 struct lysc_type *type; /**< type of the leaf node (mandatory) */
Radek Krejcib57cf1e2018-11-23 14:07:05 +01001547
Radek Krejci4f28eda2018-11-12 11:46:16 +01001548 const char *units; /**< units of the leaf's type */
Radek Krejcia1911222019-07-22 17:24:50 +02001549 struct lyd_value *dflt; /**< default value */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001550};
1551
1552struct lysc_node_leaflist {
1553 uint16_t nodetype; /**< LYS_LEAFLIST */
1554 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Michal Vasko60ea6352020-06-29 13:39:39 +02001555 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001556 struct lys_module *module; /**< module structure */
1557 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. */
1558 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1559 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1560 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1561 never NULL. If there is no sibling node, pointer points to the node
1562 itself. In case of the first node, this pointer points to the last
1563 node in the list. */
1564 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001565 const char *dsc; /**< description */
1566 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001567 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcib57cf1e2018-11-23 14:07:05 +01001568 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001569 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Michal Vasko2fd91b92020-07-17 16:39:02 +02001570 void *priv; /**< private arbitrary user data, not used by libyang */
Radek Krejcib57cf1e2018-11-23 14:07:05 +01001571
1572 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1573 struct lysc_type *type; /**< type of the leaf node (mandatory) */
1574
Radek Krejci0e5d8382018-11-28 16:37:53 +01001575 const char *units; /**< units of the leaf's type */
Radek Krejcid0ef1af2019-07-23 12:22:05 +02001576 struct lyd_value **dflts; /**< list ([sized array](@ref sizedarrays)) of default values */
Michal Vaskoba99a3e2020-08-18 15:50:05 +02001577
Radek Krejci0e5d8382018-11-28 16:37:53 +01001578 uint32_t min; /**< min-elements constraint */
1579 uint32_t max; /**< max-elements constraint */
1580
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001581};
1582
1583struct lysc_node_list {
1584 uint16_t nodetype; /**< LYS_LIST */
1585 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Michal Vasko60ea6352020-06-29 13:39:39 +02001586 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001587 struct lys_module *module; /**< module structure */
1588 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. */
1589 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1590 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1591 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1592 never NULL. If there is no sibling node, pointer points to the node
1593 itself. In case of the first node, this pointer points to the last
1594 node in the list. */
1595 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001596 const char *dsc; /**< description */
1597 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001598 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci9bb94eb2018-12-04 16:48:35 +01001599 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001600 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Michal Vasko2fd91b92020-07-17 16:39:02 +02001601 void *priv; /**< private arbitrary user data, not used by libyang */
Radek Krejci9bb94eb2018-12-04 16:48:35 +01001602
1603 struct lysc_node *child; /**< first child node (linked list) */
1604 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1605 struct lysc_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
1606 struct lysc_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
1607
Radek Krejci9bb94eb2018-12-04 16:48:35 +01001608 struct lysc_node_leaf ***uniques; /**< list of sized arrays of pointers to the unique nodes ([sized array](@ref sizedarrays)) */
1609 uint32_t min; /**< min-elements constraint */
1610 uint32_t max; /**< max-elements constraint */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001611};
1612
1613struct lysc_node_anydata {
1614 uint16_t nodetype; /**< LYS_ANYXML or LYS_ANYDATA */
1615 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Michal Vasko60ea6352020-06-29 13:39:39 +02001616 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001617 struct lys_module *module; /**< module structure */
1618 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. */
1619 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1620 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1621 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1622 never NULL. If there is no sibling node, pointer points to the node
1623 itself. In case of the first node, this pointer points to the last
1624 node in the list. */
1625 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001626 const char *dsc; /**< description */
1627 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001628 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci056d0a82018-12-06 16:57:25 +01001629 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001630 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Michal Vasko2fd91b92020-07-17 16:39:02 +02001631 void *priv; /**< private arbitrary user data, not used by libyang */
Radek Krejci9800fb82018-12-13 14:26:23 +01001632
1633 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001634};
1635
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001636/**
1637 * @brief Compiled YANG schema tree structure representing YANG module.
1638 *
1639 * Semantically validated YANG schema tree for data tree parsing.
1640 * Contains only the necessary information for the data validation.
1641 */
1642struct lysc_module {
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001643 struct lys_module *mod; /**< covering module structure */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001644
Radek Krejci2a408df2018-10-29 16:32:26 +01001645 struct lysc_node *data; /**< list of module's top-level data nodes (linked list) */
1646 struct lysc_action *rpcs; /**< list of RPCs ([sized array](@ref sizedarrays)) */
1647 struct lysc_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejcice8c1592018-10-29 15:35:51 +01001648 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci0af5f5d2018-09-07 15:00:30 +02001649};
1650
1651/**
Radek Krejci53ea6152018-12-13 15:21:15 +01001652 * @brief Get the groupings sized array of the given (parsed) schema node.
1653 * Decides the node's type and in case it has a groupings array, returns it.
1654 * @param[in] node Node to examine.
1655 * @return The node's groupings sized array if any, NULL otherwise.
1656 */
1657const struct lysp_grp *lysp_node_groupings(const struct lysp_node *node);
1658
1659/**
Radek Krejci056d0a82018-12-06 16:57:25 +01001660 * @brief Get the typedefs sized array of the given (parsed) schema node.
1661 * Decides the node's type and in case it has a typedefs array, returns it.
1662 * @param[in] node Node to examine.
1663 * @return The node's typedefs sized array if any, NULL otherwise.
1664 */
1665const struct lysp_tpdf *lysp_node_typedefs(const struct lysp_node *node);
1666
1667/**
1668 * @brief Get the actions/RPCs sized array of the given (parsed) schema node.
1669 * Decides the node's type and in case it has a actions/RPCs array, returns it.
1670 * @param[in] node Node to examine.
1671 * @return The node's actions/RPCs sized array if any, NULL otherwise.
1672 */
1673const struct lysp_action *lysp_node_actions(const struct lysp_node *node);
1674
1675/**
1676 * @brief Get the Notifications sized array of the given (parsed) schema node.
1677 * Decides the node's type and in case it has a Notifications array, returns it.
1678 * @param[in] node Node to examine.
1679 * @return The node's Notifications sized array if any, NULL otherwise.
1680 */
1681const struct lysp_notif *lysp_node_notifs(const struct lysp_node *node);
1682
1683/**
1684 * @brief Get the children linked list of the given (parsed) schema node.
1685 * Decides the node's type and in case it has a children list, returns it.
1686 * @param[in] node Node to examine.
1687 * @return The node's children linked list if any, NULL otherwise.
1688 */
1689const struct lysp_node *lysp_node_children(const struct lysp_node *node);
1690
1691/**
1692 * @brief Get the actions/RPCs sized array of the given (compiled) schema node.
1693 * Decides the node's type and in case it has a actions/RPCs array, returns it.
1694 * @param[in] node Node to examine.
1695 * @return The node's actions/RPCs sized array if any, NULL otherwise.
1696 */
1697const struct lysc_action *lysc_node_actions(const struct lysc_node *node);
1698
1699/**
1700 * @brief Get the Notifications sized array of the given (compiled) schema node.
1701 * Decides the node's type and in case it has a Notifications array, returns it.
1702 * @param[in] node Node to examine.
1703 * @return The node's Notifications sized array if any, NULL otherwise.
1704 */
1705const struct lysc_notif *lysc_node_notifs(const struct lysc_node *node);
1706
1707/**
1708 * @brief Get the children linked list of the given (compiled) schema node.
1709 * Decides the node's type and in case it has a children list, returns it.
1710 * @param[in] node Node to examine.
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001711 * @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 +01001712 * @return The node's children linked list if any, NULL otherwise.
1713 */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001714const struct lysc_node *lysc_node_children(const struct lysc_node *node, uint16_t flags);
Radek Krejci056d0a82018-12-06 16:57:25 +01001715
1716/**
Michal Vaskod975f862020-06-23 13:29:28 +02001717 * @brief Examine whether a node is user-ordered list or leaf-list.
1718 *
1719 * @param[in] node Node to examine.
1720 * @return non-zero if it is,
Radek Krejci857189e2020-09-01 13:26:36 +02001721 * @return Boolean value whether the @p node is user-ordered or not.
Michal Vaskod975f862020-06-23 13:29:28 +02001722 */
Radek Krejci857189e2020-09-01 13:26:36 +02001723ly_bool lysc_is_userordered(const struct lysc_node *schema);
Michal Vaskod975f862020-06-23 13:29:28 +02001724
1725/**
Michal Vasko2fd91b92020-07-17 16:39:02 +02001726 * @brief Set a schema private pointer to a user pointer.
1727 *
1728 * @param[in] node Node, whose private field will be assigned. Works also for RPCs, actions, and notifications.
1729 * @param[in] priv Arbitrary user-specified pointer.
Radek Krejciaf9cd802020-10-06 21:59:47 +02001730 * @param[out] prev_priv_p Optional previous private object of the \p node. Note, that
Michal Vasko2fd91b92020-07-17 16:39:02 +02001731 * the caller is in this case responsible (if it is necessary) for freeing the replaced private object.
1732 * @return LY_ERR value.
1733 */
Radek Krejciaf9cd802020-10-06 21:59:47 +02001734LY_ERR lysc_set_private(const struct lysc_node *node, void *priv, void **prev_priv_p);
Michal Vasko2fd91b92020-07-17 16:39:02 +02001735
1736/**
Radek Krejci151a5b72018-10-19 14:21:44 +02001737 * @brief Get how the if-feature statement currently evaluates.
1738 *
1739 * @param[in] iff Compiled if-feature statement to evaluate.
Michal Vasko28d78432020-05-26 13:10:53 +02001740 * @return LY_SUCCESS if the statement evaluates to true,
1741 * @return LY_ENOT if it evaluates to false,
1742 * @return LY_ERR on error.
Radek Krejci151a5b72018-10-19 14:21:44 +02001743 */
Michal Vasko28d78432020-05-26 13:10:53 +02001744LY_ERR lysc_iffeature_value(const struct lysc_iffeature *iff);
Radek Krejci151a5b72018-10-19 14:21:44 +02001745
1746/**
1747 * @brief Get the current status of the provided feature.
1748 *
1749 * @param[in] feature Compiled feature statement to examine.
Michal Vasko28d78432020-05-26 13:10:53 +02001750 * @return LY_SUCCESS if feature is enabled,
1751 * @return LY_ENOT if feature is disabled,
1752 * @return LY_ERR in case of error (invalid argument)
Radek Krejci151a5b72018-10-19 14:21:44 +02001753 */
Michal Vasko28d78432020-05-26 13:10:53 +02001754LY_ERR lysc_feature_value(const struct lysc_feature *feature);
Radek Krejci151a5b72018-10-19 14:21:44 +02001755
Michal Vasko072de482020-08-05 13:27:21 +02001756#define LYXP_SCNODE 0x02 /**< No special tree access modifiers. */
1757#define LYXP_SCNODE_SCHEMA 0x04 /**< Apply node access restrictions defined for 'when' and 'must' evaluation. */
1758#define LYXP_SCNODE_OUTPUT 0x08 /**< Search RPC/action output nodes instead of input ones. */
1759
Radek Krejci151a5b72018-10-19 14:21:44 +02001760/**
Michal Vasko519fd602020-05-26 12:17:39 +02001761 * @brief Get all the schema nodes (atoms) that are required for \p xpath to be evaluated.
1762 *
1763 * @param[in] ctx_node XPath schema context node.
1764 * @param[in] xpath Data XPath expression filtering the matching nodes. ::LYD_JSON format is expected.
1765 * @param[in] options Whether to apply some node access restrictions, one of the options should always be used.
1766 * If none is set, ::LYXP_SCNODE is used.
1767 * @param[out] set Set of found atoms (schema nodes).
1768 * @return LY_SUCCESS on success, @p set is returned.
1769 * @return LY_ERR value if an error occurred.
1770 */
Radek Krejci1deb5be2020-08-26 16:43:36 +02001771LY_ERR lys_atomize_xpath(const struct lysc_node *ctx_node, const char *xpath, uint32_t options, struct ly_set **set);
Michal Vasko519fd602020-05-26 12:17:39 +02001772
Michal Vasko072de482020-08-05 13:27:21 +02001773/**
1774 * @brief Evaluate an \p xpath expression on schema nodes.
1775 *
1776 * @param[in] ctx_node XPath schema context node.
1777 * @param[in] xpath Data XPath expression filtering the matching nodes. ::LYD_JSON format is expected.
1778 * @param[in] options Whether to apply some node access restrictions, one of the options should always be used.
1779 * If none is set, ::LYXP_SCNODE is used.
1780 * @param[out] set Set of found schema nodes.
1781 * @return LY_SUCCESS on success, @p set is returned.
1782 * @return LY_ERR value if an error occurred.
1783 */
Radek Krejci1deb5be2020-08-26 16:43:36 +02001784LY_ERR lys_find_xpath(const struct lysc_node *ctx_node, const char *xpath, uint32_t options, struct ly_set **set);
Michal Vasko519fd602020-05-26 12:17:39 +02001785
1786/**
Michal Vasko03ff5a72019-09-11 13:49:33 +02001787 * @brief Types of the different schema paths.
1788 */
1789typedef enum {
Michal Vasko65de0402020-08-03 16:34:19 +02001790 LYSC_PATH_LOG, /**< Descriptive path format used in log messages */
1791 LYSC_PATH_DATA /**< Similar to ::LYSC_PATH_LOG except that schema-only nodes (choice, case) are skipped */
Michal Vasko03ff5a72019-09-11 13:49:33 +02001792} LYSC_PATH_TYPE;
1793
1794/**
Radek Krejci327de162019-06-14 12:52:07 +02001795 * @brief Generate path of the given node in the requested format.
1796 *
1797 * @param[in] node Schema path of this node will be generated.
1798 * @param[in] pathtype Format of the path to generate.
Radek Krejci1c0c3442019-07-23 16:08:47 +02001799 * @param[in,out] buffer Prepared buffer of the @p buflen length to store the generated path.
1800 * If NULL, memory for the complete path is allocated.
1801 * @param[in] buflen Size of the provided @p buffer.
Radek Krejci327de162019-06-14 12:52:07 +02001802 * @return NULL in case of memory allocation error, path of the node otherwise.
Radek Krejci1c0c3442019-07-23 16:08:47 +02001803 * 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 +02001804 */
Michal Vasko03ff5a72019-09-11 13:49:33 +02001805char *lysc_path(const struct lysc_node *node, LYSC_PATH_TYPE pathtype, char *buffer, size_t buflen);
Radek Krejci327de162019-06-14 12:52:07 +02001806
1807/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001808 * @brief Available YANG schema tree structures representing YANG module.
1809 */
1810struct lys_module {
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001811 struct ly_ctx *ctx; /**< libyang context of the module (mandatory) */
1812 const char *name; /**< name of the module (mandatory) */
Radek Krejci0af46292019-01-11 16:02:31 +01001813 const char *revision; /**< revision of the module (if present) */
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001814 const char *ns; /**< namespace of the module (module - mandatory) */
1815 const char *prefix; /**< module prefix or submodule belongsto prefix of main module (mandatory) */
1816 const char *filepath; /**< path, if the schema was read from a file, NULL in case of reading from memory */
1817 const char *org; /**< party/company responsible for the module */
1818 const char *contact; /**< contact information for the module */
1819 const char *dsc; /**< description of the module */
1820 const char *ref; /**< cross-reference for the module */
1821
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001822 struct lysp_module *parsed; /**< Simply parsed (unresolved) YANG schema tree */
Radek Krejci0af46292019-01-11 16:02:31 +01001823 struct lysc_module *compiled; /**< Compiled and fully validated YANG schema tree for data parsing.
1824 Available only for implemented modules. */
Michal Vasko7f45cf22020-10-01 12:49:44 +02001825
Radek Krejci14915cc2020-09-14 17:28:13 +02001826 struct lysc_feature *features; /**< List of compiled features of the module ([sized array](@ref sizedarrays)).
1827 Features are outside the compiled tree since they are needed even the module is not
1828 compiled. In such a case, the features are always disabled and cannot be enabled until
1829 the module is implemented. The features are present in this form to allow their linkage
Radek Krejci0af46292019-01-11 16:02:31 +01001830 from if-feature statements of the compiled schemas and their proper use in case
1831 the module became implemented in future (no matter if implicitly via augment/deviate
Radek Krejci14915cc2020-09-14 17:28:13 +02001832 or explicitly via ::lys_set_implemented()). */
Radek Krejci80d281e2020-09-14 17:42:54 +02001833 struct lysc_ident *identities; /**< List of compiled identities of the module ([sized array](@ref sizedarrays))
1834 Identities are outside the compiled tree to allow their linkage to the identities from
1835 the implemented modules. This avoids problems when the module became implemented in
1836 future (no matter if implicitly via augment/deviate or explicitly via
1837 ::lys_set_implemented()). Note that if the module is not implemented (compiled), the
1838 identities cannot be instantiated in data (in identityrefs). */
Michal Vasko7f45cf22020-10-01 12:49:44 +02001839
1840 struct lys_module **augmented_by;/**< List of modules that augment this module ([sized array](@ref sizedarrays)) */
1841 struct lys_module **deviated_by; /**< List of modules that deviate this module ([sized array](@ref sizedarrays)) */
1842
Michal Vasko89b5c072020-10-06 13:52:44 +02001843 ly_bool implemented; /**< flag if the module is implemented, not just imported */
Radek Krejci95710c92019-02-11 15:49:55 +01001844 uint8_t latest_revision; /**< flag to mark the latest available revision:
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001845 1 - the latest revision in searchdirs was not searched yet and this is the
1846 latest revision in the current context
1847 2 - searchdirs were searched and this is the latest available revision */
1848 uint8_t version; /**< yang-version (LYS_VERSION values) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001849};
1850
Radek Krejci151a5b72018-10-19 14:21:44 +02001851/**
1852 * @brief Enable specified feature in the module
1853 *
1854 * By default, when the module is loaded by libyang parser, all features are disabled.
1855 *
Radek Krejcica3db002018-11-01 10:31:01 +01001856 * If all features are being enabled, it must be possible respecting their if-feature conditions. For example,
1857 * enabling all features on the following feature set will fail since it is not possible to enable both features
1858 * (and it is unclear which of them should be enabled then). In this case the LY_EDENIED is returned and the feature
1859 * is untouched.
1860 *
1861 * feature f1;
1862 * feature f2 { if-feature 'not f1';}
1863 *
Radek Krejci151a5b72018-10-19 14:21:44 +02001864 * @param[in] module Module where the feature will be enabled.
1865 * @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 +02001866 * @return LY_SUCCESS on success,
1867 * @return LY_EINVAL if @p module is not implemented,
1868 * @return LY_ENOTFOUND if @p feature was not found,
1869 * @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 +02001870 */
Radek Krejcied5acc52019-04-25 15:57:04 +02001871LY_ERR lys_feature_enable(const struct lys_module *module, const char *feature);
Radek Krejci151a5b72018-10-19 14:21:44 +02001872
1873/**
1874 * @brief Disable specified feature in the module
1875 *
1876 * By default, when the module is loaded by libyang parser, all features are disabled.
1877 *
Michal Vasko82c31e62020-07-17 15:30:40 +02001878 * If disabling a feature causes some other features that depend on this feature to become disabled.
1879 *
Radek Krejci151a5b72018-10-19 14:21:44 +02001880 * @param[in] module Module where the feature will be disabled.
1881 * @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 +02001882 * @return LY_SUCCESS on success,
1883 * @return LY_EINVAL if @p module is not implemented,
1884 * @return LY_ENOTFOUND if @p feature was not found.
Radek Krejci151a5b72018-10-19 14:21:44 +02001885 */
Radek Krejcied5acc52019-04-25 15:57:04 +02001886LY_ERR lys_feature_disable(const struct lys_module *module, const char *feature);
Radek Krejci151a5b72018-10-19 14:21:44 +02001887
1888/**
Michal Vasko82c31e62020-07-17 15:30:40 +02001889 * @brief Enable specified feature in the module disregarding its if-features.
1890 *
1891 * @param[in] module Module where the feature will be enabled.
1892 * @param[in] feature Name of the feature to enable. To enable all features at once, use asterisk character.
1893 * @return LY_SUCCESS on success,
1894 * @return LY_EINVAL if @p module is not implemented,
1895 * @return LY_ENOTFOUND if @p feature was not found.
1896 */
1897LY_ERR lys_feature_enable_force(const struct lys_module *module, const char *feature);
1898
1899/**
1900 * @brief Disable specified feature in the module disregarding dependant features.
1901 *
1902 * By default, when the module is loaded by libyang parser, all features are disabled.
1903 *
1904 * @param[in] module Module where the feature will be disabled.
1905 * @param[in] feature Name of the feature to disable. To disable all features at once, use asterisk character.
1906 * @return LY_SUCCESS on success,
1907 * @return LY_EINVAL if @p module is not implemented,
1908 * @return LY_ENOTFOUND if @p feature was not found.
1909 */
1910LY_ERR lys_feature_disable_force(const struct lys_module *module, const char *feature);
1911
1912/**
1913 * @brief Get the current real status of the specified feature in the module.
1914 *
1915 * If the feature is enabled, but some of its if-features are false, the feature is considered
1916 * disabled.
Radek Krejci151a5b72018-10-19 14:21:44 +02001917 *
1918 * @param[in] module Module where the feature is defined.
1919 * @param[in] feature Name of the feature to inspect.
Michal Vasko82c31e62020-07-17 15:30:40 +02001920 * @return LY_SUCCESS if the feature is enabled,
1921 * @return LY_ENOT if the feature is disabled,
1922 * @return LY_ENOTFOUND if the feature was not found.
Radek Krejci151a5b72018-10-19 14:21:44 +02001923 */
Michal Vasko82c31e62020-07-17 15:30:40 +02001924LY_ERR lys_feature_value(const struct lys_module *module, const char *feature);
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001925
1926/**
Radek Krejcia3045382018-11-22 14:30:31 +01001927 * @brief Get next schema tree (sibling) node element that can be instantiated in a data tree. Returned node can
1928 * be from an augment.
1929 *
1930 * lys_getnext() is supposed to be called sequentially. In the first call, the \p last parameter is usually NULL
1931 * and function starts returning i) the first \p parent's child or ii) the first top level element of the \p module.
1932 * Consequent calls suppose to provide the previously returned node as the \p last parameter and still the same
1933 * \p parent and \p module parameters.
1934 *
1935 * Without options, the function is used to traverse only the schema nodes that can be paired with corresponding
1936 * data nodes in a data tree. By setting some \p options the behavior can be modified to the extent that
1937 * all the schema nodes are iteratively returned.
1938 *
1939 * @param[in] last Previously returned schema tree node, or NULL in case of the first call.
1940 * @param[in] parent Parent of the subtree where the function starts processing.
1941 * @param[in] module In case of iterating on top level elements, the \p parent is NULL and
1942 * module must be specified.
1943 * @param[in] options [ORed options](@ref sgetnextflags).
1944 * @return Next schema tree node that can be instantiated in a data tree, NULL in case there is no such element.
1945 */
1946const struct lysc_node *lys_getnext(const struct lysc_node *last, const struct lysc_node *parent,
Radek Krejci1deb5be2020-08-26 16:43:36 +02001947 const struct lysc_module *module, uint32_t options);
Radek Krejcia3045382018-11-22 14:30:31 +01001948
1949/**
1950 * @defgroup sgetnextflags lys_getnext() flags
Radek Krejcia3045382018-11-22 14:30:31 +01001951 * @{
1952 */
1953#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 +01001954#define LYS_GETNEXT_NOCHOICE 0x02 /**< lys_getnext() option to ignore (kind of conditional) nodes within choice node */
Radek Krejci056d0a82018-12-06 16:57:25 +01001955#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 +01001956#define LYS_GETNEXT_INTONPCONT 0x40 /**< lys_getnext() option to look into non-presence container, instead of returning container itself */
1957#define LYS_GETNEXT_NOSTATECHECK 0x100 /**< lys_getnext() option to skip checking module validity (import-only, disabled) and
1958 relevant if-feature conditions state */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001959#define LYS_GETNEXT_OUTPUT 0x200 /**< lys_getnext() option to provide RPC's/action's output schema nodes instead of input schema nodes
1960 provided by default */
Radek Krejcia3045382018-11-22 14:30:31 +01001961/** @} sgetnextflags */
1962
1963/**
1964 * @brief Get child node according to the specified criteria.
1965 *
1966 * @param[in] parent Optional parent of the node to find. If not specified, the module's top-level nodes are searched.
1967 * @param[in] module module of the node to find. It is also limitation for the children node of the given parent.
1968 * @param[in] name Name of the node to find.
1969 * @param[in] name_len Optional length of the name in case it is not NULL-terminated string.
1970 * @param[in] nodetype Optional criteria (to speedup) specifying nodetype(s) of the node to find.
1971 * Used as a bitmask, so multiple nodetypes can be specified.
1972 * @param[in] options [ORed options](@ref sgetnextflags).
1973 * @return Found node if any.
1974 */
Michal Vaskoe444f752020-02-10 12:20:06 +01001975const struct lysc_node *lys_find_child(const struct lysc_node *parent, const struct lys_module *module,
Radek Krejci1deb5be2020-08-26 16:43:36 +02001976 const char *name, size_t name_len, uint16_t nodetype, uint32_t options);
Radek Krejcia3045382018-11-22 14:30:31 +01001977
1978/**
Radek Krejci77a8bcd2019-09-11 11:20:02 +02001979 * @brief Make the specific module implemented.
1980 *
1981 * @param[in] mod Module to make implemented. It is not an error
1982 * to provide already implemented module, it just does nothing.
Michal Vaskoe444f752020-02-10 12:20:06 +01001983 * @return LY_SUCCESS on success.
1984 * @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 +02001985 */
1986LY_ERR lys_set_implemented(struct lys_module *mod);
1987
1988/**
Radek Krejcia3045382018-11-22 14:30:31 +01001989 * @brief Check if the schema node is disabled in the schema tree, i.e. there is any disabled if-feature statement
1990 * affecting the node.
1991 *
1992 * @param[in] node Schema node to check.
1993 * @param[in] recursive - 0 to check if-feature only in the \p node schema node,
1994 * - 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 +01001995 * @return NULL if enabled,
Michal Vaskoc193ce92020-03-06 11:04:48 +01001996 * @return pointer to the node with the unsatisfied (disabled) if-feature expression.
Radek Krejcia3045382018-11-22 14:30:31 +01001997 */
Radek Krejci857189e2020-09-01 13:26:36 +02001998const struct lysc_node *lysc_node_is_disabled(const struct lysc_node *node, ly_bool recursive);
Radek Krejcia3045382018-11-22 14:30:31 +01001999
Radek Krejci084289f2019-07-09 17:35:30 +02002000/**
2001 * @brief Check type restrictions applicable to the particular leaf/leaf-list with the given string @p value.
2002 *
2003 * This function check just the type's restriction, if you want to check also the data tree context (e.g. in case of
2004 * require-instance restriction), use lyd_value_validate().
2005 *
2006 * @param[in] ctx libyang context for logging (function does not log errors when @p ctx is NULL)
2007 * @param[in] node Schema node for the @p value.
Michal Vaskof937cfe2020-08-03 16:07:12 +02002008 * @param[in] value String value to be checked, expected to be in JSON format.
Radek Krejci084289f2019-07-09 17:35:30 +02002009 * @param[in] value_len Length of the given @p value (mandatory).
Radek Krejci084289f2019-07-09 17:35:30 +02002010 * @return LY_SUCCESS on success
2011 * @return LY_ERR value if an error occurred.
2012 */
Michal Vaskof937cfe2020-08-03 16:07:12 +02002013LY_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 +02002014
Radek Krejci0935f412019-08-20 16:15:18 +02002015/**
2016 * @brief Stringify schema nodetype.
Michal Vaskod43d71a2020-08-07 14:54:58 +02002017 *
Radek Krejci0935f412019-08-20 16:15:18 +02002018 * @param[in] nodetype Nodetype to stringify.
2019 * @return Constant string with the name of the node's type.
2020 */
2021const char *lys_nodetype2str(uint16_t nodetype);
2022
Michal Vaskod43d71a2020-08-07 14:54:58 +02002023/**
2024 * @brief Getter for original XPath expression from a parsed expression.
2025 *
2026 * @param[in] path Parsed expression.
2027 * @return Original string expression.
2028 */
2029const char *lyxp_get_expr(const struct lyxp_expr *path);
2030
Radek Krejci2ff0d572020-05-21 15:27:28 +02002031/** @} schematree */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02002032
Radek Krejci70853c52018-10-15 14:46:16 +02002033#ifdef __cplusplus
2034}
2035#endif
2036
Radek Krejci5aeea3a2018-09-05 13:29:36 +02002037#endif /* LY_TREE_SCHEMA_H_ */