blob: f7b854be4aede0ccdb24c2a9b78b71810c1211ad [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 Krejcice8c1592018-10-29 15:35:51 +010027
Radek Krejci70853c52018-10-15 14:46:16 +020028#ifdef __cplusplus
29extern "C" {
30#endif
31
Radek Krejcica376bd2020-06-11 16:04:06 +020032struct ly_ctx;
Radek Krejci47fab892020-11-05 17:02:41 +010033struct ly_path;
Radek Krejcica376bd2020-06-11 16:04:06 +020034struct ly_set;
Radek Krejci47fab892020-11-05 17:02:41 +010035struct lys_module;
36struct lysc_node;
37struct lyxp_expr;
Radek Krejcica376bd2020-06-11 16:04:06 +020038
Radek Krejci5aeea3a2018-09-05 13:29:36 +020039/**
Radek Krejci8678fa42020-08-18 16:07:28 +020040 * @page howtoSchema YANG Modules
41 *
42 * To be able to work with YANG data instances, libyang has to represent YANG data models. All the processed modules are stored
43 * in libyang [context](@ref howtoContext) and loaded using [parser functions](@ref howtoSchemaParsers). It means, that there is
44 * no way to create/change YANG module programmatically. However, all the YANG model definitions are available and can be examined
45 * through the C structures. All the context's modules together form YANG Schema for the data being instantiated.
46 *
47 * Any YANG module is represented as ::lys_module. In fact, the module is represented in two different formats. As ::lys_module.parsed,
48 * there is a parsed schema reflecting the source YANG module. It is exactly what is read from the input. This format is good for
49 * converting from one format to another (YANG to YIN and vice versa), but it is not very useful for validating/manipulating YANG
50 * data. Therefore, there is ::lys_module.compiled storing the compiled YANG module. It is based on the parsed module, but all the
51 * references are resolved. It means that, for example, there are no `grouping`s or `typedef`s since they are supposed to be placed instead of
52 * `uses` or `type` references. This split also means, that the YANG module is fully validated after compilation of the parsed
53 * representation of the module. YANG submodules are available only in the parsed representation. When a submodule is compiled, it
54 * is fully integrated into its main module.
55 *
56 * The context can contain even modules without the compiled representation. Such modules are still useful as imports of other
57 * modules. The grouping or typedef definition can be even compiled into the importing modules. This is actually the main
58 * difference between the imported and implemented modules in the libyang context. The implemented modules are compiled while the
59 * imported modules are only parsed.
60 *
Radek Krejcib100b192020-10-26 08:37:45 +010061 * By default, the module is implemented (and compiled) in case it is explicitly loaded or referenced in another module as
62 * target of leafref, augment or deviation. This behavior can be changed via context options ::LY_CTX_ALL_IMPLEMENTED, when
63 * all the modules in the context are marked as implemented (note the problem with multiple revisions of a single module),
64 * or by ::LY_CTX_REF_IMPLEMENTED option, extending the set of references making the module implemented by when, must and
65 * default statements.
Radek Krejci8678fa42020-08-18 16:07:28 +020066 *
67 * All modules with deviation definition are always marked as implemented. The imported (not implemented) module can be set implemented by ::lys_set_implemented(). But
68 * the implemented module cannot be changed back to just imported module. Note also that only one revision of a specific module
69 * can be implemented in a single context. The imported modules are used only as a
70 * source of definitions for types and groupings for uses statements. The data in such modules are ignored - caller
71 * is not allowed to create the data (including instantiating identities) defined in the model via data parsers,
72 * the default nodes are not added into any data tree and mandatory nodes are not checked in the data trees.
73 *
74 * The compiled schema tree nodes are able to hold private objects (::lysc_node.priv as a pointer to a structure, function, variable, ...) used by
75 * a caller application. Such an object can be assigned to a specific node using ::lysc_set_private() function.
76 * Note that the object is not freed by libyang when the context is being destroyed. So the caller is responsible
77 * for freeing the provided structure after the context is destroyed or the private pointer is set to NULL in
78 * appropriate schema nodes where the object was previously set. This can be automated via destructor function
79 * to free these private objects. The destructor is passed to the ::ly_ctx_destroy() function.
80 *
81 * Despite all the schema structures and their members are available as part of the libyang API and callers can use
82 * it to navigate through the schema tree structure or to obtain various information, we recommend to use the following
83 * macros for the specific actions.
84 * - ::LYSC_TREE_DFS_BEGIN and ::LYSC_TREE_DFS_END to traverse the schema tree (depth-first).
85 * - ::LY_LIST_FOR and ::LY_ARRAY_FOR as described on @ref howtoStructures page.
86 *
87 * Further information about modules handling can be found on the following pages:
88 * - @subpage howtoSchemaParsers
89 * - @subpage howtoSchemaFeatures
90 * - @subpage howtoPlugins
91 * - @subpage howtoSchemaPrinters
92 *
93 * \note There are many functions to access information from the schema trees. Details are available in
94 * the [Schema Tree module](@ref schematree).
95 *
96 * For information about difference between implemented and imported modules, see the
97 * [context description](@ref howtoContext).
98 *
99 * Functions List (not assigned to above subsections)
100 * --------------------------------------------------
101 * - ::lys_getnext()
102 * - ::lys_nodetype2str()
103 * - ::lys_set_implemented()
104 * - ::lys_value_validate()
105 *
106 * - ::lysc_set_private()
107 *
Michal Vaskod5cfa6e2020-11-23 16:56:08 +0100108 * - ::lysc_has_when()
109 *
Radek Krejci8678fa42020-08-18 16:07:28 +0200110 * - ::lysc_node_children()
Michal Vasko208a04a2020-10-21 15:17:12 +0200111 * - ::lysc_node_children_full()
112 * - ::lysc_node_parent_full()
Radek Krejci8678fa42020-08-18 16:07:28 +0200113 * - ::lysc_node_actions()
114 * - ::lysc_node_notifs()
115 *
116 * - ::lysp_node_children()
117 * - ::lysp_node_actions()
118 * - ::lysp_node_notifs()
119 * - ::lysp_node_groupings()
120 * - ::lysp_node_typedefs()
121 */
122
123/**
124 * @page howtoSchemaFeatures YANG Features
125 *
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100126 * YANG feature statement is an important part of the language which can significantly affect the meaning of the schemas.
127 * Modifying features may have similar effects as loading/removing schema from the context so it is limited to context
128 * preparation period before working with data. YANG features, respectively their use in if-feature
129 * statements, are evaluated as part of schema compilation so a feature-specific compiled schema tree is generated
130 * as a result.
Radek Krejci8678fa42020-08-18 16:07:28 +0200131 *
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100132 * To enable any features, they must currently be specified when implementing a new schema with ::lys_parse() or
133 * ::ly_ctx_load_module(). To later examine what the status of a feature is, check its ::LYS_FENABLED flag or
134 * search for it first with ::lys_feature_value(). Lastly, to evaluate compiled if-features, use ::lysc_iffeature_value().
Radek Krejci8678fa42020-08-18 16:07:28 +0200135 *
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100136 * To iterate over all features of a particular YANG module, use ::lysp_feature_next().
Radek Krejci8678fa42020-08-18 16:07:28 +0200137 *
138 * Note, that the feature's state can affect some of the output formats (e.g. Tree format).
139 *
140 * Functions List
141 * --------------
Radek Krejci8678fa42020-08-18 16:07:28 +0200142 * - ::lys_feature_value()
Radek Krejci8678fa42020-08-18 16:07:28 +0200143 * - ::lysc_iffeature_value()
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100144 * - ::lysp_feature_next()
Radek Krejci8678fa42020-08-18 16:07:28 +0200145 */
146
147/**
Radek Krejci2ff0d572020-05-21 15:27:28 +0200148 * @ingroup trees
Radek Krejci8678fa42020-08-18 16:07:28 +0200149 * @defgroup schematree Schema Tree
Radek Krejci2ff0d572020-05-21 15:27:28 +0200150 * @{
151 *
152 * Data structures and functions to manipulate and access schema tree.
153 */
154
Michal Vasko64246d82020-08-19 12:35:00 +0200155/* *INDENT-OFF* */
156
Radek Krejci2ff0d572020-05-21 15:27:28 +0200157/**
Michal Vasko208a04a2020-10-21 15:17:12 +0200158 * @brief Macro to iterate via all elements in a schema (sub)tree including input and output.
159 * Note that __actions__ and __notifications__ of traversed nodes __are ignored__! To traverse
160 * on all the nodes including those, use ::lysc_tree_dfs_full() instead.
161 *
162 * 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 +0200163 *
164 * The function follows deep-first search algorithm:
165 * <pre>
166 * 1
167 * / \
168 * 2 4
169 * / / \
170 * 3 5 6
171 * </pre>
172 *
173 * Use the same parameters for #LYSC_TREE_DFS_BEGIN and #LYSC_TREE_DFS_END. While
174 * START can be any of the lysc_node* types (including lysc_action and lysc_notif),
175 * ELEM variable must be of the struct lysc_node* type.
176 *
177 * To skip a particular subtree, instead of the continue statement, set LYSC_TREE_DFS_continue
178 * variable to non-zero value.
179 *
180 * Use with opening curly bracket '{' after the macro.
181 *
182 * @param START Pointer to the starting element processed first.
183 * @param ELEM Iterator intended for use in the block.
184 */
185#define LYSC_TREE_DFS_BEGIN(START, ELEM) \
Radek Krejci857189e2020-09-01 13:26:36 +0200186 { ly_bool LYSC_TREE_DFS_continue = 0; struct lysc_node *LYSC_TREE_DFS_next; \
Michal Vasko1c9e79f2020-08-10 11:08:03 +0200187 for ((ELEM) = (LYSC_TREE_DFS_next) = (struct lysc_node*)(START); \
Radek Krejci0935f412019-08-20 16:15:18 +0200188 (ELEM); \
189 (ELEM) = (LYSC_TREE_DFS_next), LYSC_TREE_DFS_continue = 0)
190
191/**
192 * @brief Macro to iterate via all elements in a (sub)tree. This is the closing part
193 * to the #LYSC_TREE_DFS_BEGIN - they always have to be used together.
194 *
195 * Use the same parameters for #LYSC_TREE_DFS_BEGIN and #LYSC_TREE_DFS_END. While
196 * START can be a pointer to any of the lysc_node* types (including lysc_action and lysc_notif),
197 * ELEM variable must be pointer to the lysc_node type.
198 *
199 * Use with closing curly bracket '}' after the macro.
200 *
201 * @param START Pointer to the starting element processed first.
202 * @param ELEM Iterator intended for use in the block.
203 */
Radek Krejci0935f412019-08-20 16:15:18 +0200204#define LYSC_TREE_DFS_END(START, ELEM) \
205 /* select element for the next run - children first */ \
206 if (LYSC_TREE_DFS_continue) { \
207 (LYSC_TREE_DFS_next) = NULL; \
208 } else { \
Michal Vasko208a04a2020-10-21 15:17:12 +0200209 (LYSC_TREE_DFS_next) = (struct lysc_node *)lysc_node_children_full(ELEM, 0); \
210 } \
Radek Krejci0935f412019-08-20 16:15:18 +0200211 if (!(LYSC_TREE_DFS_next)) { \
Michal Vasko208a04a2020-10-21 15:17:12 +0200212 /* no children, try siblings */ \
213 _LYSC_TREE_DFS_NEXT(START, ELEM, LYSC_TREE_DFS_next); \
Radek Krejci0935f412019-08-20 16:15:18 +0200214 } \
215 while (!(LYSC_TREE_DFS_next)) { \
216 /* parent is already processed, go to its sibling */ \
Michal Vasko208a04a2020-10-21 15:17:12 +0200217 (ELEM) = (struct lysc_node *)lysc_node_parent_full(ELEM); \
218 _LYSC_TREE_DFS_NEXT(START, ELEM, LYSC_TREE_DFS_next); \
219 } }
220
221/**
222 * @brief Helper macro for #LYSC_TREE_DFS_END, should not be used directly!
223 */
224#define _LYSC_TREE_DFS_NEXT(START, ELEM, NEXT) \
225 if ((ELEM) == (struct lysc_node *)(START)) { \
226 /* we are done, no next element to process */ \
227 break; \
228 } \
229 if ((ELEM)->nodetype == LYS_INPUT) { \
230 /* after input, get output */ \
231 (NEXT) = (struct lysc_node *)lysc_node_children_full(lysc_node_parent_full(ELEM), LYS_CONFIG_R); \
232 } else if ((ELEM)->nodetype == LYS_OUTPUT) { \
233 /* no sibling of output */ \
234 (NEXT) = NULL; \
235 } else { \
236 (NEXT) = (ELEM)->next; \
237 }
Radek Krejci0935f412019-08-20 16:15:18 +0200238
Michal Vasko64246d82020-08-19 12:35:00 +0200239/* *INDENT-ON* */
240
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200241#define LY_REV_SIZE 11 /**< revision data string length (including terminating NULL byte) */
242
Michal Vasko7f45cf22020-10-01 12:49:44 +0200243#define LYS_UNKNOWN 0x0000 /**< uninitalized unknown statement node */
244#define LYS_CONTAINER 0x0001 /**< container statement node */
245#define LYS_CHOICE 0x0002 /**< choice statement node */
246#define LYS_LEAF 0x0004 /**< leaf statement node */
247#define LYS_LEAFLIST 0x0008 /**< leaf-list statement node */
248#define LYS_LIST 0x0010 /**< list statement node */
249#define LYS_ANYXML 0x0020 /**< anyxml statement node */
250#define LYS_ANYDATA 0x0060 /**< anydata statement node, in tests it can be used for both #LYS_ANYXML and #LYS_ANYDATA */
251#define LYS_CASE 0x0080 /**< case statement node */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200252
Michal Vasko7f45cf22020-10-01 12:49:44 +0200253#define LYS_RPC 0x0100 /**< RPC statement node */
254#define LYS_ACTION 0x0200 /**< action statement node */
255#define LYS_NOTIF 0x0400 /**< notification statement node */
Radek Krejcie7b95092019-05-15 11:03:07 +0200256
Michal Vasko7f45cf22020-10-01 12:49:44 +0200257#define LYS_USES 0x0800 /**< uses statement node */
258#define LYS_INPUT 0x1000 /**< RPC/action input node */
259#define LYS_OUTPUT 0x2000 /**< RPC/action output node */
260#define LYS_GROUPING 0x4000
261#define LYS_AUGMENT 0x8000
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100262
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200263/**
Radek Krejcid6b76452019-09-03 17:03:03 +0200264 * @brief List of YANG statements
265 */
266enum ly_stmt {
267 LY_STMT_NONE = 0,
Radek Krejci8678fa42020-08-18 16:07:28 +0200268 LY_STMT_STATUS, /**< in ::lysc_ext_substmt.storage stored as a pointer to `uint16_t`, only cardinality < #LY_STMT_CARD_SOME is allowed */
269 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 +0200270 LY_STMT_MANDATORY,
Radek Krejci8678fa42020-08-18 16:07:28 +0200271 LY_STMT_UNITS, /**< in ::lysc_ext_substmt.storage stored as a pointer to `const char *` (cardinality < #LY_STMT_CARD_SOME)
Radek Krejciad5963b2019-09-06 16:03:05 +0200272 or as a pointer to a [sized array](@ref sizedarrays) `const char **` */
Radek Krejci335332a2019-09-05 13:03:35 +0200273 LY_STMT_DEFAULT,
Radek Krejci8678fa42020-08-18 16:07:28 +0200274 LY_STMT_TYPE, /**< in ::lysc_ext_substmt.storage stored as a pointer to `struct lysc_type *` (cardinality < #LY_STMT_CARD_SOME)
Radek Krejciad5963b2019-09-06 16:03:05 +0200275 or as a pointer to a [sized array](@ref sizedarrays) `struct lysc_type **` */
Radek Krejci335332a2019-09-05 13:03:35 +0200276
Radek Krejcid6b76452019-09-03 17:03:03 +0200277 LY_STMT_ACTION,
278 LY_STMT_ANYDATA,
279 LY_STMT_ANYXML,
280 LY_STMT_ARGUMENT,
281 LY_STMT_AUGMENT,
282 LY_STMT_BASE,
283 LY_STMT_BELONGS_TO,
284 LY_STMT_BIT,
285 LY_STMT_CASE,
286 LY_STMT_CHOICE,
Radek Krejcid6b76452019-09-03 17:03:03 +0200287 LY_STMT_CONTACT,
288 LY_STMT_CONTAINER,
Radek Krejcid6b76452019-09-03 17:03:03 +0200289 LY_STMT_DESCRIPTION,
290 LY_STMT_DEVIATE,
291 LY_STMT_DEVIATION,
292 LY_STMT_ENUM,
293 LY_STMT_ERROR_APP_TAG,
294 LY_STMT_ERROR_MESSAGE,
295 LY_STMT_EXTENSION,
296 LY_STMT_FEATURE,
297 LY_STMT_FRACTION_DIGITS,
298 LY_STMT_GROUPING,
299 LY_STMT_IDENTITY,
Radek Krejci8678fa42020-08-18 16:07:28 +0200300 LY_STMT_IF_FEATURE, /**< in ::lysc_ext_substmt.storage stored as a pointer to `struct lysc_iffeature` (cardinality < #LY_STMT_CARD_SOME)
Radek Krejciad5963b2019-09-06 16:03:05 +0200301 or as a pointer to a [sized array](@ref sizedarrays) `struct lysc_iffeature *` */
Radek Krejcid6b76452019-09-03 17:03:03 +0200302 LY_STMT_IMPORT,
303 LY_STMT_INCLUDE,
304 LY_STMT_INPUT,
305 LY_STMT_KEY,
306 LY_STMT_LEAF,
307 LY_STMT_LEAF_LIST,
308 LY_STMT_LENGTH,
309 LY_STMT_LIST,
Radek Krejcid6b76452019-09-03 17:03:03 +0200310 LY_STMT_MAX_ELEMENTS,
311 LY_STMT_MIN_ELEMENTS,
312 LY_STMT_MODIFIER,
313 LY_STMT_MODULE,
314 LY_STMT_MUST,
315 LY_STMT_NAMESPACE,
316 LY_STMT_NOTIFICATION,
317 LY_STMT_ORDERED_BY,
318 LY_STMT_ORGANIZATION,
319 LY_STMT_OUTPUT,
320 LY_STMT_PATH,
321 LY_STMT_PATTERN,
322 LY_STMT_POSITION,
323 LY_STMT_PREFIX,
324 LY_STMT_PRESENCE,
325 LY_STMT_RANGE,
326 LY_STMT_REFERENCE,
327 LY_STMT_REFINE,
328 LY_STMT_REQUIRE_INSTANCE,
329 LY_STMT_REVISION,
330 LY_STMT_REVISION_DATE,
331 LY_STMT_RPC,
Radek Krejcid6b76452019-09-03 17:03:03 +0200332 LY_STMT_SUBMODULE,
Radek Krejcid6b76452019-09-03 17:03:03 +0200333 LY_STMT_TYPEDEF,
334 LY_STMT_UNIQUE,
Radek Krejcid6b76452019-09-03 17:03:03 +0200335 LY_STMT_USES,
336 LY_STMT_VALUE,
337 LY_STMT_WHEN,
338 LY_STMT_YANG_VERSION,
339 LY_STMT_YIN_ELEMENT,
340 LY_STMT_EXTENSION_INSTANCE,
341
342 LY_STMT_SYNTAX_SEMICOLON,
343 LY_STMT_SYNTAX_LEFT_BRACE,
344 LY_STMT_SYNTAX_RIGHT_BRACE,
345
346 LY_STMT_ARG_TEXT,
347 LY_STMT_ARG_VALUE
348};
349
350/**
Radek Krejci0e59c312019-08-15 15:34:15 +0200351 * @brief Extension instance structure parent enumeration
352 */
353typedef enum {
Radek Krejci0935f412019-08-20 16:15:18 +0200354 LYEXT_PAR_MODULE, /**< ::lysc_module */
355 LYEXT_PAR_NODE, /**< ::lysc_node (and the derived structures including ::lysc_action and ::lysc_notif) */
356 LYEXT_PAR_INPUT, /**< ::lysc_action_inout */
357 LYEXT_PAR_OUTPUT, /**< ::lysc_action_inout */
358 LYEXT_PAR_TYPE, /**< ::lysc_type */
359 LYEXT_PAR_TYPE_BIT, /**< ::lysc_type_bitenum_item */
360 LYEXT_PAR_TYPE_ENUM, /**< ::lysc_type_bitenum_item */
Radek Krejci0935f412019-08-20 16:15:18 +0200361 LYEXT_PAR_MUST, /**< ::lysc_must */
362 LYEXT_PAR_PATTERN, /**< ::lysc_pattern */
363 LYEXT_PAR_LENGTH, /**< ::lysc_range */
364 LYEXT_PAR_RANGE, /**< ::lysc_range */
365 LYEXT_PAR_WHEN, /**< ::lysc_when */
366 LYEXT_PAR_IDENT, /**< ::lysc_ident */
367 LYEXT_PAR_EXT, /**< ::lysc_ext */
Michal Vasko69730152020-10-09 16:30:07 +0200368 LYEXT_PAR_IMPORT /**< ::lysp_import */
Michal Vasko033278d2020-08-24 11:24:52 +0200369// LYEXT_PAR_TPDF, /**< ::lysp_tpdf */
370// LYEXT_PAR_EXTINST, /**< ::lysp_ext_instance */
371// LYEXT_PAR_REFINE, /**< ::lysp_refine */
372// LYEXT_PAR_DEVIATION, /**< ::lysp_deviation */
373// LYEXT_PAR_DEVIATE, /**< ::lysp_deviate */
374// LYEXT_PAR_INCLUDE, /**< ::lysp_include */
375// LYEXT_PAR_REVISION, /**< ::lysp_revision */
Radek Krejci0e59c312019-08-15 15:34:15 +0200376} LYEXT_PARENT;
377
378/**
Radek Krejci0935f412019-08-20 16:15:18 +0200379 * @brief Stringify extension instance parent type.
380 * @param[in] type Parent type to stringify.
381 * @return Constant string with the name of the parent statement.
382 */
383const char *lyext_parent2str(LYEXT_PARENT type);
384
385/**
Radek Krejci0e59c312019-08-15 15:34:15 +0200386 * @brief Enum of substatements in which extension instances can appear.
387 */
388typedef enum {
389 LYEXT_SUBSTMT_SELF = 0, /**< extension of the structure itself, not substatement's */
390 LYEXT_SUBSTMT_ARGUMENT, /**< extension of the argument statement, can appear in lys_ext */
391 LYEXT_SUBSTMT_BASE, /**< extension of the base statement, can appear (repeatedly) in lys_type and lys_ident */
392 LYEXT_SUBSTMT_BELONGSTO, /**< extension of the belongs-to statement, can appear in lys_submodule */
393 LYEXT_SUBSTMT_CONTACT, /**< extension of the contact statement, can appear in lys_module */
394 LYEXT_SUBSTMT_DEFAULT, /**< extension of the default statement, can appear in lys_node_leaf, lys_node_leaflist,
395 lys_node_choice and lys_deviate */
396 LYEXT_SUBSTMT_DESCRIPTION, /**< extension of the description statement, can appear in lys_module, lys_submodule,
397 lys_node, lys_import, lys_include, lys_ext, lys_feature, lys_tpdf, lys_restr,
398 lys_ident, lys_deviation, lys_type_enum, lys_type_bit, lys_when and lys_revision */
399 LYEXT_SUBSTMT_ERRTAG, /**< extension of the error-app-tag statement, can appear in lys_restr */
400 LYEXT_SUBSTMT_ERRMSG, /**< extension of the error-message statement, can appear in lys_restr */
401 LYEXT_SUBSTMT_KEY, /**< extension of the key statement, can appear in lys_node_list */
402 LYEXT_SUBSTMT_NAMESPACE, /**< extension of the namespace statement, can appear in lys_module */
403 LYEXT_SUBSTMT_ORGANIZATION, /**< extension of the organization statement, can appear in lys_module and lys_submodule */
404 LYEXT_SUBSTMT_PATH, /**< extension of the path statement, can appear in lys_type */
405 LYEXT_SUBSTMT_PREFIX, /**< extension of the prefix statement, can appear in lys_module, lys_submodule (for
406 belongs-to's prefix) and lys_import */
407 LYEXT_SUBSTMT_PRESENCE, /**< extension of the presence statement, can appear in lys_node_container */
408 LYEXT_SUBSTMT_REFERENCE, /**< extension of the reference statement, can appear in lys_module, lys_submodule,
409 lys_node, lys_import, lys_include, lys_revision, lys_tpdf, lys_restr, lys_ident,
410 lys_ext, lys_feature, lys_deviation, lys_type_enum, lys_type_bit and lys_when */
411 LYEXT_SUBSTMT_REVISIONDATE, /**< extension of the revision-date statement, can appear in lys_import and lys_include */
412 LYEXT_SUBSTMT_UNITS, /**< extension of the units statement, can appear in lys_tpdf, lys_node_leaf,
413 lys_node_leaflist and lys_deviate */
414 LYEXT_SUBSTMT_VALUE, /**< extension of the value statement, can appear in lys_type_enum */
415 LYEXT_SUBSTMT_VERSION, /**< extension of the yang-version statement, can appear in lys_module and lys_submodule */
416 LYEXT_SUBSTMT_MODIFIER, /**< extension of the modifier statement, can appear in lys_restr */
417 LYEXT_SUBSTMT_REQINSTANCE, /**< extension of the require-instance statement, can appear in lys_type */
418 LYEXT_SUBSTMT_YINELEM, /**< extension of the yin-element statement, can appear in lys_ext */
419 LYEXT_SUBSTMT_CONFIG, /**< extension of the config statement, can appear in lys_node and lys_deviate */
420 LYEXT_SUBSTMT_MANDATORY, /**< extension of the mandatory statement, can appear in lys_node_leaf, lys_node_choice,
421 lys_node_anydata and lys_deviate */
422 LYEXT_SUBSTMT_ORDEREDBY, /**< extension of the ordered-by statement, can appear in lys_node_list and lys_node_leaflist */
423 LYEXT_SUBSTMT_STATUS, /**< extension of the status statement, can appear in lys_tpdf, lys_node, lys_ident,
424 lys_ext, lys_feature, lys_type_enum and lys_type_bit */
425 LYEXT_SUBSTMT_FRACDIGITS, /**< extension of the fraction-digits statement, can appear in lys_type */
426 LYEXT_SUBSTMT_MAX, /**< extension of the max-elements statement, can appear in lys_node_list,
427 lys_node_leaflist and lys_deviate */
428 LYEXT_SUBSTMT_MIN, /**< extension of the min-elements statement, can appear in lys_node_list,
429 lys_node_leaflist and lys_deviate */
430 LYEXT_SUBSTMT_POSITION, /**< extension of the position statement, can appear in lys_type_bit */
431 LYEXT_SUBSTMT_UNIQUE, /**< extension of the unique statement, can appear in lys_node_list and lys_deviate */
Michal Vasko69730152020-10-09 16:30:07 +0200432 LYEXT_SUBSTMT_IFFEATURE /**< extension of the if-feature statement */
Radek Krejci0e59c312019-08-15 15:34:15 +0200433} LYEXT_SUBSTMT;
434
435/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200436 * @brief YANG import-stmt
437 */
438struct lysp_import {
Radek Krejci086c7132018-10-26 15:29:04 +0200439 struct lys_module *module; /**< pointer to the imported module
440 (mandatory, but resolved when the referring module is completely parsed) */
441 const char *name; /**< name of the imported module (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200442 const char *prefix; /**< prefix for the data from the imported schema (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200443 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)) */
Michal Vasko3e9bc2f2020-11-04 17:13:56 +0100446 uint16_t flags; /**< LYS_INTERNAL value (@ref snodeflags) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200447 char rev[LY_REV_SIZE]; /**< revision-date of the imported module */
448};
449
450/**
451 * @brief YANG include-stmt
452 */
453struct lysp_include {
Radek Krejci0bcdaed2019-01-10 10:21:34 +0100454 struct lysp_submodule *submodule;/**< pointer to the parsed submodule structure
Radek Krejci086c7132018-10-26 15:29:04 +0200455 (mandatory, but resolved when the referring module is completely parsed) */
456 const char *name; /**< name of the included submodule (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200457 const char *dsc; /**< description */
458 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200459 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200460 char rev[LY_REV_SIZE]; /**< revision-date of the included submodule */
461};
462
463/**
464 * @brief YANG extension-stmt
465 */
466struct lysp_ext {
467 const char *name; /**< extension name */
468 const char *argument; /**< argument name, NULL if not specified */
469 const char *dsc; /**< description statement */
470 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200471 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcif56e2a42019-09-09 14:15:25 +0200472 uint16_t flags; /**< LYS_STATUS_* and LYS_YINELEM_* values (@ref snodeflags) */
Michal Vasko5fe75f12020-03-02 13:52:37 +0100473
474 struct lysc_ext *compiled; /**< pointer to the compiled extension definition */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200475};
476
477/**
478 * @brief Helper structure for generic storage of the extension instances content.
479 */
480struct lysp_stmt {
481 const char *stmt; /**< identifier of the statement */
482 const char *arg; /**< statement's argument */
483 struct lysp_stmt *next; /**< link to the next statement */
Michal Vaskobc2559f2018-09-07 10:17:50 +0200484 struct lysp_stmt *child; /**< list of the statement's substatements (linked list) */
David Sedlákb9d75c42019-08-14 10:49:42 +0200485 uint16_t flags; /**< statement flags, can be set to LYS_YIN_ATTR */
Radek Krejci335332a2019-09-05 13:03:35 +0200486 enum ly_stmt kw; /**< numeric respresentation of the stmt value */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200487};
488
David Sedlákae4b4512019-08-14 10:45:56 +0200489#define LYS_YIN 0x1 /**< used to specify input format of extension instance */
490
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200491/**
492 * @brief YANG extension instance
493 */
494struct lysp_ext_instance {
David Sedlákbbd06ca2019-06-27 14:15:38 +0200495 const char *name; /**< extension identifier, including possible prefix */
496 const char *argument; /**< optional value of the extension's argument */
Radek Krejci335332a2019-09-05 13:03:35 +0200497 void *parent; /**< pointer to the parent element holding the extension instance(s), use
498 ::lysp_ext_instance#parent_type to access the schema element */
David Sedlákbbd06ca2019-06-27 14:15:38 +0200499 struct lysp_stmt *child; /**< list of the extension's substatements (linked list) */
Radek Krejcif56e2a42019-09-09 14:15:25 +0200500 struct lysc_ext_instance *compiled; /**< pointer to the compiled data if any - in case the source format is YIN,
501 some of the information (argument) are available only after compilation */
David Sedlákbbd06ca2019-06-27 14:15:38 +0200502 LYEXT_SUBSTMT insubstmt; /**< value identifying placement of the extension instance */
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200503 LY_ARRAY_COUNT_TYPE insubstmt_index; /**< in case the instance is in a substatement, this identifies
David Sedlákbbd06ca2019-06-27 14:15:38 +0200504 the index of that substatement */
Michal Vasko3e9bc2f2020-11-04 17:13:56 +0100505 uint16_t flags; /**< LYS_INTERNAL value (@ref snodeflags) */
506 uint8_t yin; /**< flag for YIN source format, can be set to LYS_YIN */
Radek Krejci335332a2019-09-05 13:03:35 +0200507 LYEXT_PARENT parent_type; /**< type of the parent structure */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200508};
509
510/**
511 * @brief YANG feature-stmt
512 */
513struct lysp_feature {
514 const char *name; /**< feature name (mandatory) */
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100515 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
516 struct lysc_iffeature *iffeatures_c; /**< compiled if-features */
517 struct lysp_feature **depfeatures; /**< list of pointers to other features depending on this one
518 ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200519 const char *dsc; /**< description statement */
520 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200521 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100522 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values and
523 LYS_FENABLED are allowed */
524};
525
526/**
527 * @brief Compiled YANG if-feature-stmt
528 */
529struct lysc_iffeature {
530 uint8_t *expr; /**< 2bits array describing the if-feature expression in prefix format, see @ref ifftokens */
531 struct lysp_feature **features; /**< array of pointers to the features used in expression ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200532};
533
534/**
Michal Vasko7f45cf22020-10-01 12:49:44 +0200535 * @brief Qualified name (optional prefix followed by an identifier).
536 */
537struct lysp_qname {
538 const char *str; /**< qualified name string */
Michal Vasko5d24f6c2020-10-13 13:49:06 +0200539 const struct lysp_module *mod; /**< module to resolve any prefixes found in the string, it must be
Michal Vasko7f45cf22020-10-01 12:49:44 +0200540 stored explicitly because of deviations/refines */
541};
542
543/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200544 * @brief YANG identity-stmt
545 */
546struct lysp_ident {
547 const char *name; /**< identity name (mandatory), including possible prefix */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200548 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200549 const char **bases; /**< list of base identifiers ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200550 const char *dsc; /**< description statement */
551 const char *ref; /**< reference statement */
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) - only LYS_STATUS_ values are allowed */
554};
555
Michal Vasko71e64ca2018-09-07 16:30:29 +0200556/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200557 * @brief Covers restrictions: range, length, pattern, must
558 */
559struct lysp_restr {
Michal Vasko7f45cf22020-10-01 12:49:44 +0200560 struct lysp_qname arg; /**< The restriction expression/value (mandatory);
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200561 in case of pattern restriction, the first byte has a special meaning:
562 0x06 (ACK) for regular match and 0x15 (NACK) for invert-match */
563 const char *emsg; /**< error-message */
564 const char *eapptag; /**< error-app-tag value */
565 const char *dsc; /**< description */
566 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200567 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200568};
569
570/**
Michal Vasko71e64ca2018-09-07 16:30:29 +0200571 * @brief YANG revision-stmt
572 */
573struct lysp_revision {
Radek Krejcib7db73a2018-10-24 14:18:40 +0200574 char date[LY_REV_SIZE]; /**< revision date (madatory) */
Michal Vasko71e64ca2018-09-07 16:30:29 +0200575 const char *dsc; /**< description statement */
576 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200577 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vasko71e64ca2018-09-07 16:30:29 +0200578};
579
580/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200581 * @brief Enumeration/Bit value definition
582 */
583struct lysp_type_enum {
584 const char *name; /**< name (mandatory) */
585 const char *dsc; /**< description statement */
586 const char *ref; /**< reference statement */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200587 int64_t value; /**< enum's value or bit's position */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200588 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200589 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200590 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_ and LYS_SET_VALUE
591 values are allowed */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200592};
593
594/**
595 * @brief YANG type-stmt
596 *
597 * Some of the items in the structure may be mandatory, but it is necessary to resolve the type's base type first
598 */
599struct lysp_type {
600 const char *name; /**< name of the type (mandatory) */
601 struct lysp_restr *range; /**< allowed values range - numerical, decimal64 */
602 struct lysp_restr *length; /**< allowed length of the value - string, binary */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200603 struct lysp_restr *patterns; /**< list of patterns ([sized array](@ref sizedarrays)) - string */
604 struct lysp_type_enum *enums; /**< list of enum-stmts ([sized array](@ref sizedarrays)) - enum */
605 struct lysp_type_enum *bits; /**< list of bit-stmts ([sized array](@ref sizedarrays)) - bits */
Michal Vasko004d3152020-06-11 19:59:22 +0200606 struct lyxp_expr *path; /**< parsed path - leafref */
Radek Krejci151a5b72018-10-19 14:21:44 +0200607 const char **bases; /**< list of base identifiers ([sized array](@ref sizedarrays)) - identityref */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200608 struct lysp_type *types; /**< list of sub-types ([sized array](@ref sizedarrays)) - union */
609 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200610
Michal Vasko5d24f6c2020-10-13 13:49:06 +0200611 const struct lysp_module *pmod; /**< (sub)module where the type is defined (needed for deviations) */
Radek Krejci2167ee12018-11-02 16:09:07 +0100612 struct lysc_type *compiled; /**< pointer to the compiled type */
613
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200614 uint8_t fraction_digits; /**< number of fraction digits - decimal64 */
615 uint8_t require_instance; /**< require-instance flag - leafref, instance */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100616 uint16_t flags; /**< [schema node flags](@ref spnodeflags) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200617};
618
619/**
620 * @brief YANG typedef-stmt
621 */
622struct lysp_tpdf {
623 const char *name; /**< name of the newly defined type (mandatory) */
624 const char *units; /**< units of the newly defined type */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200625 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 +0200626 const char *dsc; /**< description statement */
627 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200628 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200629 struct lysp_type type; /**< base type from which the typedef is derived (mandatory) */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100630 uint16_t flags; /**< [schema node flags](@ref spnodeflags) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200631};
632
633/**
634 * @brief YANG grouping-stmt
635 */
636struct lysp_grp {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100637 struct lysp_node *parent; /**< parent node (NULL if this is a top-level grouping) */
638 uint16_t nodetype; /**< LYS_GROUPING */
639 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values are allowed */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200640 const char *name; /**< grouping name (mandatory) */
641 const char *dsc; /**< description statement */
642 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200643 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
644 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200645 struct lysp_node *data; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200646 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
647 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
648 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200649};
650
651/**
652 * @brief YANG when-stmt
653 */
654struct lysp_when {
655 const char *cond; /**< specified condition (mandatory) */
656 const char *dsc; /**< description statement */
657 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200658 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200659};
660
661/**
662 * @brief YANG refine-stmt
663 */
664struct lysp_refine {
665 const char *nodeid; /**< target descendant schema nodeid (mandatory) */
666 const char *dsc; /**< description statement */
667 const char *ref; /**< reference statement */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200668 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200669 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200670 const char *presence; /**< presence description */
Michal Vasko5d24f6c2020-10-13 13:49:06 +0200671 struct lysp_qname *dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200672 uint32_t min; /**< min-elements constraint */
673 uint32_t max; /**< max-elements constraint, 0 means unbounded */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200674 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200675 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
676};
677
678/**
Michal Vasko82a83432019-11-14 12:33:04 +0100679 * @brief YANG uses-augment-stmt and augment-stmt (compatible with struct lysp_node )
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200680 */
681struct lysp_augment {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100682 struct lysp_node *parent; /**< parent node (NULL if this is a top-level augment) */
683 uint16_t nodetype; /**< LYS_AUGMENT */
684 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values are allowed */
Michal Vasko82a83432019-11-14 12:33:04 +0100685 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200686 const char *nodeid; /**< target schema nodeid (mandatory) - absolute for global augments, descendant for uses's augments */
687 const char *dsc; /**< description statement */
688 const char *ref; /**< reference statement */
689 struct lysp_when *when; /**< when statement */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200690 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Michal Vasko82a83432019-11-14 12:33:04 +0100691 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200692 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
693 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200694};
695
696/**
Radek Krejci8678fa42020-08-18 16:07:28 +0200697 * @ingroup schematree
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200698 * @defgroup deviatetypes Deviate types
Radek Krejci8678fa42020-08-18 16:07:28 +0200699 *
700 * Type of the deviate operation (used as ::lysp_deviate.mod)
701 *
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200702 * @{
703 */
704#define LYS_DEV_NOT_SUPPORTED 1 /**< deviate type not-supported */
705#define LYS_DEV_ADD 2 /**< deviate type add */
706#define LYS_DEV_DELETE 3 /**< deviate type delete */
707#define LYS_DEV_REPLACE 4 /**< deviate type replace */
Radek Krejci2ff0d572020-05-21 15:27:28 +0200708/** @} deviatetypes */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200709
710/**
711 * @brief Generic deviate structure to get type and cast to lysp_deviate_* structure
712 */
713struct lysp_deviate {
714 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
715 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200716 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200717};
718
719struct lysp_deviate_add {
720 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
721 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200722 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200723 const char *units; /**< units of the values */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200724 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Michal Vasko5d24f6c2020-10-13 13:49:06 +0200725 struct lysp_qname *uniques; /**< list of uniques specifications ([sized array](@ref sizedarrays)) */
726 struct lysp_qname *dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200727 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
728 uint32_t min; /**< min-elements constraint */
729 uint32_t max; /**< max-elements constraint, 0 means unbounded */
730};
731
732struct lysp_deviate_del {
733 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
734 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200735 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200736 const char *units; /**< units of the values */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200737 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Michal Vasko5d24f6c2020-10-13 13:49:06 +0200738 struct lysp_qname *uniques; /**< list of uniques specifications ([sized array](@ref sizedarrays)) */
739 struct lysp_qname *dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200740};
741
742struct lysp_deviate_rpl {
743 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
744 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200745 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200746 struct lysp_type *type; /**< type of the node */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200747 const char *units; /**< units of the values */
Michal Vasko5d24f6c2020-10-13 13:49:06 +0200748 struct lysp_qname dflt; /**< default value */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200749 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
750 uint32_t min; /**< min-elements constraint */
751 uint32_t max; /**< max-elements constraint, 0 means unbounded */
752};
753
754struct lysp_deviation {
Michal Vaskob55f6c12018-09-12 11:13:15 +0200755 const char *nodeid; /**< target absolute schema nodeid (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200756 const char *dsc; /**< description statement */
757 const char *ref; /**< reference statement */
Michal Vasko22df3f02020-08-24 13:29:22 +0200758 struct lysp_deviate *deviates; /**< list of deviate specifications (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200759 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200760};
761
Radek Krejci4f28eda2018-11-12 11:46:16 +0100762/**
Radek Krejci4f28eda2018-11-12 11:46:16 +0100763 * @ingroup snodeflags
Radek Krejci8678fa42020-08-18 16:07:28 +0200764 * @defgroup spnodeflags Parsed schema nodes flags
Radek Krejci4f28eda2018-11-12 11:46:16 +0100765 *
Radek Krejci8678fa42020-08-18 16:07:28 +0200766 * Various flags for parsed schema nodes (used as ::lysp_node.flags).
Radek Krejci4f28eda2018-11-12 11:46:16 +0100767 *
768 * 1 - container 6 - anydata/anyxml 11 - output 16 - grouping 21 - enum
769 * 2 - choice 7 - case 12 - feature 17 - uses 22 - type
Radek Krejcid3ca0632019-04-16 16:54:54 +0200770 * 3 - leaf 8 - notification 13 - identity 18 - refine 23 - stmt
Radek Krejci4f28eda2018-11-12 11:46:16 +0100771 * 4 - leaflist 9 - rpc 14 - extension 19 - augment
772 * 5 - list 10 - input 15 - typedef 20 - deviate
773 *
Radek Krejcid3ca0632019-04-16 16:54:54 +0200774 * 1 1 1 1 1 1 1 1 1 1 2 2 2 2
775 * 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
776 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Michal Vasko5297a432020-08-31 12:27:51 +0200777 * 1 LYS_CONFIG_W |x|x|x|x|x|x| | | | | | | | | | | |x| |x| | | |
Radek Krejcid3ca0632019-04-16 16:54:54 +0200778 * LYS_SET_BASE | | | | | | | | | | | | | | | | | | | | | |x| |
779 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Michal Vasko5297a432020-08-31 12:27:51 +0200780 * 2 LYS_CONFIG_R |x|x|x|x|x|x| | | | | | | | | | | |x| |x| | | |
Radek Krejcid3ca0632019-04-16 16:54:54 +0200781 * LYS_SET_BIT | | | | | | | | | | | | | | | | | | | | | |x| |
782 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
783 * 3 LYS_STATUS_CURR |x|x|x|x|x|x|x|x|x| | |x|x|x|x|x|x| |x|x|x| | |
784 * LYS_SET_ENUM | | | | | | | | | | | | | | | | | | | | | |x| |
785 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
786 * 4 LYS_STATUS_DEPRC |x|x|x|x|x|x|x|x|x| | |x|x|x|x|x|x| |x|x|x| | |
787 * LYS_SET_FRDIGITS | | | | | | | | | | | | | | | | | | | | | |x| |
788 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
789 * 5 LYS_STATUS_OBSLT |x|x|x|x|x|x|x|x|x| | |x|x|x|x|x|x| |x|x|x| | |
790 * LYS_SET_LENGTH | | | | | | | | | | | | | | | | | | | | | |x| |
791 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
792 * 6 LYS_MAND_TRUE | |x|x| | |x| | | | | | | | | | | |x| |x| | | |
793 * LYS_SET_PATH | | | | | | | | | | | | | | | | | | | | | |x| |
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100794 * LYS_FENABLED | | | | | | | | | | | |x| | | | | | | | | | | |
Radek Krejcid3ca0632019-04-16 16:54:54 +0200795 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
796 * 7 LYS_MAND_FALSE | |x|x| | |x| | | | | | | | | | | |x| |x| | | |
797 * LYS_ORDBY_USER | | | |x|x| | | | | | | | | | | | | | | | | | |
798 * LYS_SET_PATTERN | | | | | | | | | | | | | | | | | | | | | |x| |
799 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
800 * 8 LYS_ORDBY_SYSTEM | | | |x|x| | | | | | | | | | | | | | | | | | |
801 * LYS_YINELEM_TRUE | | | | | | | | | | | | | |x| | | | | | | | | |
802 * LYS_SET_RANGE | | | | | | | | | | | | | | | | | | | | | |x| |
803 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
804 * 9 LYS_YINELEM_FALSE| | | | | | | | | | | | | |x| | | | | | | | | |
805 * LYS_SET_TYPE | | | | | | | | | | | | | | | | | | | | | |x| |
806 * LYS_SINGLEQUOTED | | | | | | | | | | | | | | | | | | | | | | |x|
807 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
808 * 10 LYS_SET_VALUE | | | | | | | | | | | | | | | | | | | | |x| | |
809 * LYS_SET_REQINST | | | | | | | | | | | | | | | | | | | | | |x| |
810 * LYS_SET_MIN | | | |x|x| | | | | | | | | | | | |x| |x| | | |
811 * LYS_DOUBLEQUOTED | | | | | | | | | | | | | | | | | | | | | | |x|
812 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
813 * 11 LYS_SET_MAX | | | |x|x| | | | | | | | | | | | |x| |x| | | |
Radek Krejcif2de0ed2019-05-02 14:13:18 +0200814 * LYS_USED_GRP | | | | | | | | | | | | | | | |x| | | | | | | |
David Sedlákae4b4512019-08-14 10:45:56 +0200815 * LYS_YIN_ATTR | | | | | | | | | | | | | | | | | | | | | | |x|
Michal Vasko5297a432020-08-31 12:27:51 +0200816 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
817 * 12 LYS_YIN_ARGUMENT | | | | | | | | | | | | | | | | | | | | | | |x|
Michal Vasko3e9bc2f2020-11-04 17:13:56 +0100818 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
819 * 13 LYS_INTERNAL |x|x|x|x|x|x|x|x|x|x|x|x|x|x|x|x|x|x|x|x|x|x|x|
Radek Krejcif56e2a42019-09-09 14:15:25 +0200820 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Radek Krejci4f28eda2018-11-12 11:46:16 +0100821 *
822 */
823
824/**
Radek Krejci4f28eda2018-11-12 11:46:16 +0100825 * @ingroup snodeflags
Radek Krejci8678fa42020-08-18 16:07:28 +0200826 * @defgroup scnodeflags Compiled schema nodes flags
Radek Krejci4f28eda2018-11-12 11:46:16 +0100827 *
Radek Krejci8678fa42020-08-18 16:07:28 +0200828 * Various flags for compiled schema nodes (used as ::lysc_node.flags).
Radek Krejci4f28eda2018-11-12 11:46:16 +0100829 *
Radek Krejci61e042e2019-09-10 15:53:09 +0200830 * 1 - container 6 - anydata/anyxml 11 - identity
831 * 2 - choice 7 - case 12 - extension
832 * 3 - leaf 8 - notification 13 - bitenum
Michal Vasko03ff5a72019-09-11 13:49:33 +0200833 * 4 - leaflist 9 - rpc/action 14 - when
Michal Vaskoecd62de2019-11-13 12:35:11 +0100834 * 5 - list 10 - feature
Radek Krejci4f28eda2018-11-12 11:46:16 +0100835 *
Michal Vaskoecd62de2019-11-13 12:35:11 +0100836 * 1 1 1 1 1
837 * bit name 1 2 3 4 5 6 7 8 9 0 1 2 3 4
838 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
839 * 1 LYS_CONFIG_W |x|x|x|x|x|x|x| | | | | | | |
840 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
841 * 2 LYS_CONFIG_R |x|x|x|x|x|x|x| | | | | | | |
842 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
843 * 3 LYS_STATUS_CURR |x|x|x|x|x|x|x|x|x|x|x|x| |x|
844 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
845 * 4 LYS_STATUS_DEPRC |x|x|x|x|x|x|x|x|x|x|x|x| |x|
846 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
847 * 5 LYS_STATUS_OBSLT |x|x|x|x|x|x|x|x|x|x|x|x| |x|
848 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
849 * 6 LYS_MAND_TRUE |x|x|x|x|x|x| | | | | | | | |
850 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
851 * 7 LYS_ORDBY_USER | | | |x|x| | | | | | | | | |
852 * LYS_MAND_FALSE | |x|x| | |x| | | | | | | | |
853 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
854 * 8 LYS_ORDBY_SYSTEM | | | |x|x| | | | | | | | | |
855 * LYS_PRESENCE |x| | | | | | | | | | | | | |
856 * LYS_UNIQUE | | |x| | | | | | | | | | | |
857 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
858 * 9 LYS_KEY | | |x| | | | | | | | | | | |
Michal Vaskoecd62de2019-11-13 12:35:11 +0100859 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
860 * 10 LYS_SET_DFLT | | |x|x| | |x| | | | | | | |
861 * LYS_ISENUM | | | | | | | | | | | | |x| |
862 * LYS_KEYLESS | | | | |x| | | | | | | | | |
863 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
864 * 11 LYS_SET_UNITS | | |x|x| | | | | | | | | | |
865 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
866 * 12 LYS_SET_CONFIG |x|x|x|x|x|x| | | | | | | | |
867 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Radek Krejci4f28eda2018-11-12 11:46:16 +0100868 *
869 */
870
871/**
872 * @defgroup snodeflags Schema nodes flags
Radek Krejci8678fa42020-08-18 16:07:28 +0200873 *
874 * Various flags for schema nodes ([parsed](@ref spnodeflags) as well as [compiled](@ref scnodeflags)).
875 *
Radek Krejci4f28eda2018-11-12 11:46:16 +0100876 * @{
877 */
Michal Vasko1bf09392020-03-27 12:38:10 +0100878#define LYS_CONFIG_W 0x01 /**< config true; also set for input children nodes */
879#define LYS_CONFIG_R 0x02 /**< config false; also set for output and notification children nodes */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200880#define LYS_CONFIG_MASK 0x03 /**< mask for config value */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100881#define LYS_STATUS_CURR 0x04 /**< status current; */
882#define LYS_STATUS_DEPRC 0x08 /**< status deprecated; */
883#define LYS_STATUS_OBSLT 0x10 /**< status obsolete; */
884#define LYS_STATUS_MASK 0x1C /**< mask for status value */
885#define LYS_MAND_TRUE 0x20 /**< mandatory true; applicable only to ::lysp_node_choice/::lysc_node_choice,
Radek Krejcife909632019-02-12 15:34:42 +0100886 ::lysp_node_leaf/::lysc_node_leaf and ::lysp_node_anydata/::lysc_node_anydata.
887 The ::lysc_node_leaflist and ::lysc_node_leaflist have this flag in case that min-elements > 0.
888 The ::lysc_node_container has this flag if it is not a presence container and it has at least one
889 child with LYS_MAND_TRUE. */
Radek Krejcif1421c22019-02-19 13:05:20 +0100890#define LYS_MAND_FALSE 0x40 /**< mandatory false; applicable only to ::lysp_node_choice/::lysc_node_choice,
891 ::lysp_node_leaf/::lysc_node_leaf and ::lysp_node_anydata/::lysc_node_anydata.
892 This flag is present only in case the mandatory false statement was explicitly specified. */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100893#define LYS_MAND_MASK 0x60 /**< mask for mandatory values */
Michal Vaskoc118ae22020-08-06 14:51:09 +0200894#define LYS_PRESENCE 0x80 /**< flag for presence property of a container, but it is not only for explicit presence
895 containers, but also for NP containers with some meaning, applicable only to
896 ::lysc_node_container */
Radek Krejci7adf4ff2018-12-05 08:55:00 +0100897#define LYS_UNIQUE 0x80 /**< flag for leafs being part of a unique set, applicable only to ::lysc_node_leaf */
898#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 +0200899#define LYS_KEYLESS 0x200 /**< flag for list without any key, applicable only to ::lysc_node_list */
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100900#define LYS_FENABLED 0x20 /**< feature enabled flag, applicable only to ::lysp_feature. */
Radek Krejcife909632019-02-12 15:34:42 +0100901#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 +0100902 ::lysc_node_list/::lysp_node_list */
903#define LYS_ORDBY_USER 0x40 /**< ordered-by user lists, applicable only to ::lysc_node_leaflist/::lysp_node_leaflist and
904 ::lysc_node_list/::lysp_node_list */
905#define LYS_ORDBY_MASK 0x60 /**< mask for ordered-by values */
906#define LYS_YINELEM_TRUE 0x80 /**< yin-element true for extension's argument */
907#define LYS_YINELEM_FALSE 0x100 /**< yin-element false for extension's argument */
908#define LYS_YINELEM_MASK 0x180 /**< mask for yin-element value */
Radek Krejcif2de0ed2019-05-02 14:13:18 +0200909#define LYS_USED_GRP 0x400 /**< internal flag for validating not-instantiated groupings
910 (resp. do not validate again the instantiated groupings). */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100911#define LYS_SET_VALUE 0x200 /**< value attribute is set */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100912#define LYS_SET_MIN 0x200 /**< min attribute is set */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200913#define LYS_SET_MAX 0x400 /**< max attribute is set */
Radek Krejcid505e3d2018-11-13 09:04:17 +0100914
915#define LYS_SET_BASE 0x0001 /**< type's flag for present base substatement */
916#define LYS_SET_BIT 0x0002 /**< type's flag for present bit substatement */
917#define LYS_SET_ENUM 0x0004 /**< type's flag for present enum substatement */
918#define LYS_SET_FRDIGITS 0x0008 /**< type's flag for present fraction-digits substatement */
919#define LYS_SET_LENGTH 0x0010 /**< type's flag for present length substatement */
920#define LYS_SET_PATH 0x0020 /**< type's flag for present path substatement */
921#define LYS_SET_PATTERN 0x0040 /**< type's flag for present pattern substatement */
922#define LYS_SET_RANGE 0x0080 /**< type's flag for present range substatement */
923#define LYS_SET_TYPE 0x0100 /**< type's flag for present type substatement */
924#define LYS_SET_REQINST 0x0200 /**< type's flag for present require-instance substatement */
Radek Krejciccd20f12019-02-15 14:12:27 +0100925#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 +0100926 cases of choice. This information is important for refines, since it is prohibited to make leafs
927 with default statement mandatory. In case the default leaf value is taken from type, it is thrown
Radek Krejciccd20f12019-02-15 14:12:27 +0100928 away when it is refined to be mandatory node. Similarly it is used for deviations to distinguish
929 between own default or the default values taken from the type. */
930#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 +0100931#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 +0100932
Radek Krejcif56e2a42019-09-09 14:15:25 +0200933#define LYS_SINGLEQUOTED 0x100 /**< flag for single-quoted argument of an extension instance's substatement, only when the source is YANG */
934#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 +0200935
Radek Krejcif56e2a42019-09-09 14:15:25 +0200936#define LYS_YIN_ATTR 0x400 /**< flag to identify YIN attribute parsed as extension's substatement, only when the source is YIN */
937#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 +0200938
Michal Vasko3e9bc2f2020-11-04 17:13:56 +0100939#define LYS_INTERNAL 0x1000 /**< flag to identify internal parsed statements that should not be printed */
940
Radek Krejci693262f2019-04-29 15:23:20 +0200941#define LYS_ISENUM 0x200 /**< flag to simply distinguish type in struct lysc_type_bitenum_item */
942
Radek Krejcife909632019-02-12 15:34:42 +0100943#define LYS_FLAGS_COMPILED_MASK 0xff /**< mask for flags that maps to the compiled structures */
Radek Krejci2ff0d572020-05-21 15:27:28 +0200944/** @} snodeflags */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200945
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200946/**
947 * @brief Generic YANG data node
948 */
949struct lysp_node {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100950 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200951 uint16_t nodetype; /**< type of the node (mandatory) */
952 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100953 struct lysp_node *next; /**< next sibling node (NULL if there is no one) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200954 const char *name; /**< node name (mandatory) */
955 const char *dsc; /**< description statement */
956 const char *ref; /**< reference statement */
957 struct lysp_when *when; /**< when statement */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200958 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)),
959 must be qname because of refines */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200960 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200961};
962
963/**
964 * @brief Extension structure of the lysp_node for YANG container
965 */
966struct lysp_node_container {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100967 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200968 uint16_t nodetype; /**< LYS_CONTAINER */
969 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
970 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
971 const char *name; /**< node name (mandatory) */
972 const char *dsc; /**< description statement */
973 const char *ref; /**< reference statement */
974 struct lysp_when *when; /**< when statement */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200975 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200976 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200977
978 /* container */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200979 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200980 const char *presence; /**< presence description */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200981 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
982 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200983 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200984 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
985 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200986};
987
988struct lysp_node_leaf {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100989 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200990 uint16_t nodetype; /**< LYS_LEAF */
991 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
992 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
993 const char *name; /**< node name (mandatory) */
994 const char *dsc; /**< description statement */
995 const char *ref; /**< reference statement */
996 struct lysp_when *when; /**< when statement */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200997 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200998 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200999
1000 /* leaf */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001001 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001002 struct lysp_type type; /**< type of the leaf node (mandatory) */
1003 const char *units; /**< units of the leaf's type */
Michal Vasko7f45cf22020-10-01 12:49:44 +02001004 struct lysp_qname dflt; /**< default value, it may or may not be a qualified name */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001005};
1006
1007struct lysp_node_leaflist {
Radek Krejci6d9b9b52018-11-02 12:43:39 +01001008 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001009 uint16_t nodetype; /**< LYS_LEAFLIST */
1010 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1011 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
1012 const char *name; /**< node name (mandatory) */
1013 const char *dsc; /**< description statement */
1014 const char *ref; /**< reference statement */
1015 struct lysp_when *when; /**< when statement */
Michal Vasko7f45cf22020-10-01 12:49:44 +02001016 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001017 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001018
1019 /* leaf-list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001020 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001021 struct lysp_type type; /**< type of the leaf node (mandatory) */
1022 const char *units; /**< units of the leaf's type */
Michal Vasko7f45cf22020-10-01 12:49:44 +02001023 struct lysp_qname *dflts; /**< list of default values ([sized array](@ref sizedarrays)), they may or
1024 may not be qualified names */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001025 uint32_t min; /**< min-elements constraint */
1026 uint32_t max; /**< max-elements constraint, 0 means unbounded */
1027};
1028
1029struct lysp_node_list {
Radek Krejci6d9b9b52018-11-02 12:43:39 +01001030 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001031 uint16_t nodetype; /**< LYS_LIST */
1032 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1033 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
1034 const char *name; /**< node name (mandatory) */
1035 const char *dsc; /**< description statement */
1036 const char *ref; /**< reference statement */
1037 struct lysp_when *when; /**< when statement */
Michal Vasko7f45cf22020-10-01 12:49:44 +02001038 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001039 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001040
1041 /* list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001042 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001043 const char *key; /**< keys specification */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001044 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
1045 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001046 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001047 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
1048 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Michal Vasko7f45cf22020-10-01 12:49:44 +02001049 struct lysp_qname *uniques; /**< list of unique specifications ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001050 uint32_t min; /**< min-elements constraint */
1051 uint32_t max; /**< max-elements constraint, 0 means unbounded */
1052};
1053
1054struct lysp_node_choice {
Radek Krejci6d9b9b52018-11-02 12:43:39 +01001055 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001056 uint16_t nodetype; /**< LYS_CHOICE */
1057 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1058 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
1059 const char *name; /**< node name (mandatory) */
1060 const char *dsc; /**< description statement */
1061 const char *ref; /**< reference statement */
1062 struct lysp_when *when; /**< when statement */
Michal Vasko7f45cf22020-10-01 12:49:44 +02001063 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001064 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001065
1066 /* choice */
1067 struct lysp_node *child; /**< list of data nodes (linked list) */
Michal Vasko7f45cf22020-10-01 12:49:44 +02001068 struct lysp_qname dflt; /**< default case */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001069};
1070
1071struct lysp_node_case {
Radek Krejci6d9b9b52018-11-02 12:43:39 +01001072 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001073 uint16_t nodetype; /**< LYS_CASE */
1074 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1075 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
1076 const char *name; /**< node name (mandatory) */
1077 const char *dsc; /**< description statement */
1078 const char *ref; /**< reference statement */
1079 struct lysp_when *when; /**< when statement */
Michal Vasko7f45cf22020-10-01 12:49:44 +02001080 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001081 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001082
1083 /* case */
1084 struct lysp_node *child; /**< list of data nodes (linked list) */
1085};
1086
1087struct lysp_node_anydata {
Radek Krejci6d9b9b52018-11-02 12:43:39 +01001088 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Michal Vasko7f45cf22020-10-01 12:49:44 +02001089 uint16_t nodetype; /**< LYS_ANYXML or LYS_ANYDATA */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001090 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1091 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
1092 const char *name; /**< node name (mandatory) */
1093 const char *dsc; /**< description statement */
1094 const char *ref; /**< reference statement */
1095 struct lysp_when *when; /**< when statement */
Michal Vasko7f45cf22020-10-01 12:49:44 +02001096 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001097 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001098
1099 /* anyxml/anydata */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001100 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001101};
1102
1103struct lysp_node_uses {
Radek Krejci6d9b9b52018-11-02 12:43:39 +01001104 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Michal Vaskob55f6c12018-09-12 11:13:15 +02001105 uint16_t nodetype; /**< LYS_USES */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001106 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1107 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
1108 const char *name; /**< grouping name reference (mandatory) */
1109 const char *dsc; /**< description statement */
1110 const char *ref; /**< reference statement */
1111 struct lysp_when *when; /**< when statement */
Michal Vasko7f45cf22020-10-01 12:49:44 +02001112 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001113 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001114
1115 /* uses */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001116 struct lysp_refine *refines; /**< list of uses's refines ([sized array](@ref sizedarrays)) */
1117 struct lysp_augment *augments; /**< list of uses's augment ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001118};
1119
1120/**
1121 * @brief YANG input-stmt and output-stmt
1122 */
1123struct lysp_action_inout {
Radek Krejci6d9b9b52018-11-02 12:43:39 +01001124 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Michal Vasko7f45cf22020-10-01 12:49:44 +02001125 uint16_t nodetype; /**< LYS_INPUT or LYS_OUTPUT */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001126 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1127 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
1128 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001129 struct lysp_node *data; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001130 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001131};
1132
1133/**
1134 * @brief YANG rpc-stmt and action-stmt
1135 */
1136struct lysp_action {
Radek Krejci6d9b9b52018-11-02 12:43:39 +01001137 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Michal Vasko1bf09392020-03-27 12:38:10 +01001138 uint16_t nodetype; /**< LYS_RPC or LYS_ACTION */
Radek Krejci6d9b9b52018-11-02 12:43:39 +01001139 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Michal Vasko7f45cf22020-10-01 12:49:44 +02001140 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001141 const char *name; /**< grouping name reference (mandatory) */
1142 const char *dsc; /**< description statement */
1143 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001144 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Michal Vasko7f45cf22020-10-01 12:49:44 +02001145 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1146 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1147
1148 /* action */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001149 struct lysp_action_inout input; /**< RPC's/Action's input */
1150 struct lysp_action_inout output; /**< RPC's/Action's output */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001151};
1152
1153/**
1154 * @brief YANG notification-stmt
1155 */
1156struct lysp_notif {
Radek Krejci6d9b9b52018-11-02 12:43:39 +01001157 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
1158 uint16_t nodetype; /**< LYS_NOTIF */
1159 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values are allowed */
Michal Vasko7f45cf22020-10-01 12:49:44 +02001160 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001161 const char *name; /**< grouping name reference (mandatory) */
1162 const char *dsc; /**< description statement */
1163 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001164 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Michal Vasko7f45cf22020-10-01 12:49:44 +02001165 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001166 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vasko7f45cf22020-10-01 12:49:44 +02001167
1168 /* notif */
1169 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1170 struct lysp_node *data; /**< list of data nodes (linked list) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001171};
1172
1173/**
Radek Krejcif0fceb62018-09-05 14:58:45 +02001174 * @brief supported YANG schema version values
1175 */
1176typedef enum LYS_VERSION {
1177 LYS_VERSION_UNDEF = 0, /**< no specific version, YANG 1.0 as default */
Radek Krejci96e48da2020-09-04 13:18:06 +02001178 LYS_VERSION_1_0 = 1, /**< YANG 1 (1.0) */
Radek Krejcif0fceb62018-09-05 14:58:45 +02001179 LYS_VERSION_1_1 = 2 /**< YANG 1.1 */
1180} LYS_VERSION;
1181
1182/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001183 * @brief Printable YANG schema tree structure representing YANG module.
1184 *
1185 * Simple structure corresponding to the YANG format. The schema is only syntactically validated.
1186 */
1187struct lysp_module {
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001188 struct lys_module *mod; /**< covering module structure */
1189
Radek Krejcib7db73a2018-10-24 14:18:40 +02001190 struct lysp_revision *revs; /**< list of the module revisions ([sized array](@ref sizedarrays)), the first revision
1191 in the list is always the last (newest) revision of the module */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001192 struct lysp_import *imports; /**< list of imported modules ([sized array](@ref sizedarrays)) */
1193 struct lysp_include *includes; /**< list of included submodules ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001194 struct lysp_ext *extensions; /**< list of extension statements ([sized array](@ref sizedarrays)) */
1195 struct lysp_feature *features; /**< list of feature definitions ([sized array](@ref sizedarrays)) */
1196 struct lysp_ident *identities; /**< list of identities ([sized array](@ref sizedarrays)) */
1197 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
1198 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001199 struct lysp_node *data; /**< list of module's top-level data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001200 struct lysp_augment *augments; /**< list of augments ([sized array](@ref sizedarrays)) */
1201 struct lysp_action *rpcs; /**< list of RPCs ([sized array](@ref sizedarrays)) */
1202 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
1203 struct lysp_deviation *deviations; /**< list of deviations ([sized array](@ref sizedarrays)) */
Michal Vaskoc3781c32020-10-06 14:04:08 +02001204 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001205
Michal Vasko5d24f6c2020-10-13 13:49:06 +02001206 uint8_t version; /**< yang-version (LYS_VERSION values) */
Michal Vaskoc3781c32020-10-06 14:04:08 +02001207 uint8_t parsing : 1; /**< flag for circular check */
1208 uint8_t is_submod : 1; /**< always 0 */
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001209};
1210
1211struct lysp_submodule {
Michal Vaskoc3781c32020-10-06 14:04:08 +02001212 struct lys_module *mod; /**< belongs to parent module (submodule - mandatory) */
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001213
1214 struct lysp_revision *revs; /**< list of the module revisions ([sized array](@ref sizedarrays)), the first revision
1215 in the list is always the last (newest) revision of the module */
1216 struct lysp_import *imports; /**< list of imported modules ([sized array](@ref sizedarrays)) */
1217 struct lysp_include *includes; /**< list of included submodules ([sized array](@ref sizedarrays)) */
1218 struct lysp_ext *extensions; /**< list of extension statements ([sized array](@ref sizedarrays)) */
1219 struct lysp_feature *features; /**< list of feature definitions ([sized array](@ref sizedarrays)) */
1220 struct lysp_ident *identities; /**< list of identities ([sized array](@ref sizedarrays)) */
1221 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
1222 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
1223 struct lysp_node *data; /**< list of module's top-level data nodes (linked list) */
1224 struct lysp_augment *augments; /**< list of augments ([sized array](@ref sizedarrays)) */
1225 struct lysp_action *rpcs; /**< list of RPCs ([sized array](@ref sizedarrays)) */
1226 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
1227 struct lysp_deviation *deviations; /**< list of deviations ([sized array](@ref sizedarrays)) */
Michal Vaskoc3781c32020-10-06 14:04:08 +02001228 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001229
Michal Vasko5d24f6c2020-10-13 13:49:06 +02001230 uint8_t version; /**< yang-version (LYS_VERSION values) */
Michal Vaskoc3781c32020-10-06 14:04:08 +02001231 uint8_t parsing : 1; /**< flag for circular check */
1232 uint8_t is_submod : 1; /**< always 1 */
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001233
Michal Vaskoc3781c32020-10-06 14:04:08 +02001234 uint8_t latest_revision : 2; /**< flag to mark the latest available revision:
Radek Krejci086c7132018-10-26 15:29:04 +02001235 1 - the latest revision in searchdirs was not searched yet and this is the
1236 latest revision in the current context
1237 2 - searchdirs were searched and this is the latest available revision */
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001238 const char *name; /**< name of the module (mandatory) */
1239 const char *filepath; /**< path, if the schema was read from a file, NULL in case of reading from memory */
1240 const char *prefix; /**< submodule belongsto prefix of main module (mandatory) */
1241 const char *org; /**< party/company responsible for the module */
1242 const char *contact; /**< contact information for the module */
1243 const char *dsc; /**< description of the module */
1244 const char *ref; /**< cross-reference for the module */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001245};
1246
1247/**
Michal Vasko5d24f6c2020-10-13 13:49:06 +02001248 * @brief Get the parsed module or submodule name.
1249 *
1250 * @param[in] PMOD Parsed module or submodule.
1251 * @return Module or submodule name.
1252 */
1253#define LYSP_MODULE_NAME(PMOD) (PMOD->is_submod ? ((struct lysp_submodule *)PMOD)->name : ((struct lysp_module *)PMOD)->mod->name)
1254
1255/**
Michal Vasko5d24f6c2020-10-13 13:49:06 +02001256 * @brief Compiled prefix data pair mapping of prefixes to modules. In case the format is ::LY_PREF_SCHEMA_RESOLVED,
1257 * the expected prefix data is a sized array of these structures.
1258 */
1259struct lysc_prefix {
1260 char *prefix; /**< used prefix */
1261 const struct lys_module *mod; /**< mapping to a module */
1262};
1263
1264/**
Radek Krejci0e59c312019-08-15 15:34:15 +02001265 * @brief Compiled YANG extension-stmt
1266 */
1267struct lysc_ext {
1268 const char *name; /**< extension name */
1269 const char *argument; /**< argument name, NULL if not specified */
Radek Krejci0e59c312019-08-15 15:34:15 +02001270 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1271 struct lyext_plugin *plugin; /**< Plugin implementing the specific extension */
Radek Krejci0935f412019-08-20 16:15:18 +02001272 struct lys_module *module; /**< module structure */
Michal Vasko6f4cbb62020-02-28 11:15:47 +01001273 uint32_t refcount; /**< reference counter since extension definition is shared among all its instances */
Radek Krejci0e59c312019-08-15 15:34:15 +02001274 uint16_t flags; /**< LYS_STATUS_* value (@ref snodeflags) */
1275};
1276
1277/**
Radek Krejcice8c1592018-10-29 15:35:51 +01001278 * @brief YANG extension instance
1279 */
1280struct lysc_ext_instance {
Radek Krejciad5963b2019-09-06 16:03:05 +02001281 uint32_t insubstmt_index; /**< in case the instance is in a substatement that can appear multiple times,
1282 this identifies the index of the substatement for this extension instance */
Radek Krejci28681fa2019-09-06 13:08:45 +02001283 struct lys_module *module; /**< module where the extension instantiated is defined */
Radek Krejciad5963b2019-09-06 16:03:05 +02001284 struct lysc_ext *def; /**< pointer to the extension definition */
Radek Krejcice8c1592018-10-29 15:35:51 +01001285 void *parent; /**< pointer to the parent element holding the extension instance(s), use
1286 ::lysc_ext_instance#parent_type to access the schema element */
1287 const char *argument; /**< optional value of the extension's argument */
1288 LYEXT_SUBSTMT insubstmt; /**< value identifying placement of the extension instance */
Radek Krejci2a408df2018-10-29 16:32:26 +01001289 LYEXT_PARENT parent_type; /**< type of the parent structure */
Radek Krejci2a408df2018-10-29 16:32:26 +01001290 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci0e59c312019-08-15 15:34:15 +02001291 void *data; /**< private plugins's data, not used by libyang */
Radek Krejcice8c1592018-10-29 15:35:51 +01001292};
1293
1294/**
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001295 * @brief YANG when-stmt
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001296 */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001297struct lysc_when {
1298 struct lyxp_expr *cond; /**< XPath when condition */
Michal Vasko175012e2019-11-06 15:49:14 +01001299 struct lysc_node *context; /**< context node for evaluating the expression, NULL if the context is root node */
Michal Vasko5d24f6c2020-10-13 13:49:06 +02001300 struct lysc_prefix *prefixes; /**< compiled used prefixes in the condition */
Radek Krejcic8b31002019-01-08 10:24:45 +01001301 const char *dsc; /**< description */
1302 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001303 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci00b874b2019-02-12 10:54:50 +01001304 uint32_t refcount; /**< reference counter since some of the when statements are shared among several nodes */
Michal Vaskoecd62de2019-11-13 12:35:11 +01001305 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS is allowed */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001306};
1307
1308/**
Radek Krejci2a408df2018-10-29 16:32:26 +01001309 * @brief YANG identity-stmt
1310 */
1311struct lysc_ident {
1312 const char *name; /**< identity name (mandatory), including possible prefix */
Radek Krejcic8b31002019-01-08 10:24:45 +01001313 const char *dsc; /**< description */
1314 const char *ref; /**< reference */
Radek Krejci693262f2019-04-29 15:23:20 +02001315 struct lys_module *module; /**< module structure */
Radek Krejci2a408df2018-10-29 16:32:26 +01001316 struct lysc_ident **derived; /**< list of (pointers to the) derived identities ([sized array](@ref sizedarrays)) */
1317 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1318 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_ values are allowed */
1319};
1320
1321/**
Radek Krejci151a5b72018-10-19 14:21:44 +02001322 * @defgroup ifftokens if-feature expression tokens
Radek Krejci8678fa42020-08-18 16:07:28 +02001323 * Tokens of if-feature expression used in ::lysc_iffeature.expr.
Radek Krejci151a5b72018-10-19 14:21:44 +02001324 *
1325 * @{
1326 */
1327#define LYS_IFF_NOT 0x00 /**< operand "not" */
1328#define LYS_IFF_AND 0x01 /**< operand "and" */
1329#define LYS_IFF_OR 0x02 /**< operand "or" */
1330#define LYS_IFF_F 0x03 /**< feature */
Radek Krejci2ff0d572020-05-21 15:27:28 +02001331/** @} ifftokens */
Radek Krejci151a5b72018-10-19 14:21:44 +02001332
1333/**
Radek Krejcib7db73a2018-10-24 14:18:40 +02001334 * @brief Compiled YANG revision statement
1335 */
1336struct lysc_revision {
1337 char date[LY_REV_SIZE]; /**< revision-date (mandatory) */
1338 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1339};
1340
Radek Krejci2167ee12018-11-02 16:09:07 +01001341struct lysc_range {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001342 struct lysc_range_part {
Radek Krejci693262f2019-04-29 15:23:20 +02001343 union { /**< min boundary */
Radek Krejcie7b95092019-05-15 11:03:07 +02001344 int64_t min_64; /**< for int8, int16, int32, int64 and decimal64 ( >= LY_TYPE_DEC64) */
1345 uint64_t min_u64; /**< for uint8, uint16, uint32, uint64, string and binary ( < LY_TYPE_DEC64) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001346 };
Radek Krejci693262f2019-04-29 15:23:20 +02001347 union { /**< max boundary */
Radek Krejcie7b95092019-05-15 11:03:07 +02001348 int64_t max_64; /**< for int8, int16, int32, int64 and decimal64 ( >= LY_TYPE_DEC64) */
1349 uint64_t max_u64; /**< for uint8, uint16, uint32, uint64, string and binary ( < LY_TYPE_DEC64) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001350 };
Radek Krejci4f28eda2018-11-12 11:46:16 +01001351 } *parts; /**< compiled range expression ([sized array](@ref sizedarrays)) */
Radek Krejcic8b31002019-01-08 10:24:45 +01001352 const char *dsc; /**< description */
1353 const char *ref; /**< reference */
Radek Krejci2167ee12018-11-02 16:09:07 +01001354 const char *emsg; /**< error-message */
1355 const char *eapptag; /**< error-app-tag value */
1356 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1357};
1358
1359struct lysc_pattern {
Radek Krejci54579462019-04-30 12:47:06 +02001360 const char *expr; /**< original, not compiled, regular expression */
1361 pcre2_code *code; /**< compiled regular expression */
Radek Krejcic8b31002019-01-08 10:24:45 +01001362 const char *dsc; /**< description */
1363 const char *ref; /**< reference */
Radek Krejci2167ee12018-11-02 16:09:07 +01001364 const char *emsg; /**< error-message */
1365 const char *eapptag; /**< error-app-tag value */
1366 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci0f969882020-08-21 16:56:47 +02001367 uint32_t inverted : 1; /**< invert-match flag */
1368 uint32_t refcount : 31; /**< reference counter */
Radek Krejci2167ee12018-11-02 16:09:07 +01001369};
1370
1371struct lysc_must {
Radek Krejci2167ee12018-11-02 16:09:07 +01001372 struct lyxp_expr *cond; /**< XPath when condition */
Michal Vasko5d24f6c2020-10-13 13:49:06 +02001373 struct lysc_prefix *prefixes; /**< compiled used prefixes in the condition */
Radek Krejcic8b31002019-01-08 10:24:45 +01001374 const char *dsc; /**< description */
1375 const char *ref; /**< reference */
Radek Krejci2167ee12018-11-02 16:09:07 +01001376 const char *emsg; /**< error-message */
1377 const char *eapptag; /**< error-app-tag value */
1378 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1379};
1380
1381struct lysc_type {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001382 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie7b95092019-05-15 11:03:07 +02001383 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 +01001384 LY_DATA_TYPE basetype; /**< Base type of the type */
1385 uint32_t refcount; /**< reference counter for type sharing */
1386};
1387
1388struct lysc_type_num {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001389 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie7b95092019-05-15 11:03:07 +02001390 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 +01001391 LY_DATA_TYPE basetype; /**< Base type of the type */
1392 uint32_t refcount; /**< reference counter for type sharing */
1393 struct lysc_range *range; /**< Optional range limitation */
1394};
1395
1396struct lysc_type_dec {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001397 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie7b95092019-05-15 11:03:07 +02001398 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 +01001399 LY_DATA_TYPE basetype; /**< Base type of the type */
1400 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci6cba4292018-11-15 17:33:29 +01001401 uint8_t fraction_digits; /**< fraction digits specification */
Radek Krejci2167ee12018-11-02 16:09:07 +01001402 struct lysc_range *range; /**< Optional range limitation */
1403};
1404
1405struct lysc_type_str {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001406 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie7b95092019-05-15 11:03:07 +02001407 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 +01001408 LY_DATA_TYPE basetype; /**< Base type of the type */
1409 uint32_t refcount; /**< reference counter for type sharing */
1410 struct lysc_range *length; /**< Optional length limitation */
Radek Krejci4586a022018-11-13 11:29:26 +01001411 struct lysc_pattern **patterns; /**< Optional list of pointers to pattern limitations ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001412};
1413
Radek Krejci693262f2019-04-29 15:23:20 +02001414struct lysc_type_bitenum_item {
1415 const char *name; /**< enumeration identifier */
1416 const char *dsc; /**< description */
1417 const char *ref; /**< reference */
1418 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci693262f2019-04-29 15:23:20 +02001419 union {
1420 int32_t value; /**< integer value associated with the enumeration */
1421 uint32_t position; /**< non-negative integer value associated with the bit */
1422 };
1423 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_ and LYS_SET_VALUE
1424 values are allowed */
1425};
1426
Radek Krejci2167ee12018-11-02 16:09:07 +01001427struct lysc_type_enum {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001428 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie7b95092019-05-15 11:03:07 +02001429 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 +01001430 LY_DATA_TYPE basetype; /**< Base type of the type */
1431 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci693262f2019-04-29 15:23:20 +02001432 struct lysc_type_bitenum_item *enums; /**< enumerations list ([sized array](@ref sizedarrays)), mandatory (at least 1 item) */
1433};
1434
1435struct lysc_type_bits {
1436 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie7b95092019-05-15 11:03:07 +02001437 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 +02001438 LY_DATA_TYPE basetype; /**< Base type of the type */
1439 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci849a62a2019-05-22 15:29:05 +02001440 struct lysc_type_bitenum_item *bits; /**< bits list ([sized array](@ref sizedarrays)), mandatory (at least 1 item),
1441 the items are ordered by their position value. */
Radek Krejci2167ee12018-11-02 16:09:07 +01001442};
1443
1444struct lysc_type_leafref {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001445 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie7b95092019-05-15 11:03:07 +02001446 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 +01001447 LY_DATA_TYPE basetype; /**< Base type of the type */
1448 uint32_t refcount; /**< reference counter for type sharing */
Michal Vasko004d3152020-06-11 19:59:22 +02001449 struct lyxp_expr *path; /**< parsed target path, compiled path cannot be stored because of type sharing */
Michal Vasko5d24f6c2020-10-13 13:49:06 +02001450 struct lysc_prefix *prefixes; /**< resolved prefixes used in the path */
Michal Vaskoc0792ca2020-12-01 12:03:21 +01001451 const struct lys_module *cur_mod;/**< current module for the leafref (path) */
Radek Krejci412ddfa2018-11-23 11:44:11 +01001452 struct lysc_type *realtype; /**< pointer to the real (first non-leafref in possible leafrefs chain) type. */
Radek Krejci2167ee12018-11-02 16:09:07 +01001453 uint8_t require_instance; /**< require-instance flag */
1454};
1455
1456struct lysc_type_identityref {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001457 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie7b95092019-05-15 11:03:07 +02001458 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 +01001459 LY_DATA_TYPE basetype; /**< Base type of the type */
1460 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci555cb5b2018-11-16 14:54:33 +01001461 struct lysc_ident **bases; /**< list of pointers to the base identities ([sized array](@ref sizedarrays)),
Radek Krejci2167ee12018-11-02 16:09:07 +01001462 mandatory (at least 1 item) */
1463};
1464
1465struct lysc_type_instanceid {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001466 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie7b95092019-05-15 11:03:07 +02001467 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 +01001468 LY_DATA_TYPE basetype; /**< Base type of the type */
1469 uint32_t refcount; /**< reference counter for type sharing */
1470 uint8_t require_instance; /**< require-instance flag */
1471};
1472
Radek Krejci2167ee12018-11-02 16:09:07 +01001473struct lysc_type_union {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001474 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie7b95092019-05-15 11:03:07 +02001475 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 +01001476 LY_DATA_TYPE basetype; /**< Base type of the type */
1477 uint32_t refcount; /**< reference counter for type sharing */
1478 struct lysc_type **types; /**< list of types in the union ([sized array](@ref sizedarrays)), mandatory (at least 1 item) */
1479};
1480
1481struct lysc_type_bin {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001482 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcie7b95092019-05-15 11:03:07 +02001483 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 +01001484 LY_DATA_TYPE basetype; /**< Base type of the type */
1485 uint32_t refcount; /**< reference counter for type sharing */
1486 struct lysc_range *length; /**< Optional length limitation */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001487};
1488
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001489struct lysc_action_inout {
Michal Vasko7f45cf22020-10-01 12:49:44 +02001490 uint16_t nodetype; /**< LYS_INPUT or LYS_OUTPUT */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001491 struct lysc_node *data; /**< first child node (linked list) */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001492 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1493};
1494
Michal Vasko60ea6352020-06-29 13:39:39 +02001495/**
1496 * @brief Maximum number of hashes stored in a schema node.
1497 */
1498#define LYS_NODE_HASH_COUNT 4
1499
Radek Krejci056d0a82018-12-06 16:57:25 +01001500struct lysc_action {
Michal Vasko1bf09392020-03-27 12:38:10 +01001501 uint16_t nodetype; /**< LYS_RPC or LYS_ACTION */
Radek Krejci056d0a82018-12-06 16:57:25 +01001502 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Michal Vasko60ea6352020-06-29 13:39:39 +02001503 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser */
Radek Krejci95710c92019-02-11 15:49:55 +01001504 struct lys_module *module; /**< module structure */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001505 struct lysc_node *parent; /**< parent node (NULL in case of top level node - RPC) */
1506
Radek Krejcifc11bd72019-04-11 16:00:05 +02001507 struct lysc_ext_instance *input_exts; /**< list of the extension instances of input ([sized array](@ref sizedarrays)) */
1508 struct lysc_ext_instance *output_exts; /**< list of the extension instances of outpu ([sized array](@ref sizedarrays)) */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001509
Radek Krejci056d0a82018-12-06 16:57:25 +01001510 const char *name; /**< action/RPC name (mandatory) */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001511 const char *dsc; /**< description */
1512 const char *ref; /**< reference */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001513 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001514
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001515 struct lysc_action_inout input; /**< RPC's/action's input */
1516 struct lysc_action_inout output; /**< RPC's/action's output */
Michal Vaskoceab6dd2020-10-09 16:53:36 +02001517 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Michal Vasko2fd91b92020-07-17 16:39:02 +02001518 void *priv; /** private arbitrary user data, not used by libyang */
1519
Radek Krejci056d0a82018-12-06 16:57:25 +01001520};
1521
1522struct lysc_notif {
1523 uint16_t nodetype; /**< LYS_NOTIF */
1524 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Michal Vasko60ea6352020-06-29 13:39:39 +02001525 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser */
Radek Krejci95710c92019-02-11 15:49:55 +01001526 struct lys_module *module; /**< module structure */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001527 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1528
Radek Krejcifc11bd72019-04-11 16:00:05 +02001529 struct lysc_node *data; /**< first child node (linked list) */
1530 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1531
Radek Krejci056d0a82018-12-06 16:57:25 +01001532 const char *name; /**< Notification name (mandatory) */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001533 const char *dsc; /**< description */
1534 const char *ref; /**< reference */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001535 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskoceab6dd2020-10-09 16:53:36 +02001536 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Michal Vasko2fd91b92020-07-17 16:39:02 +02001537 void *priv; /** private arbitrary user data, not used by libyang */
Radek Krejci056d0a82018-12-06 16:57:25 +01001538};
1539
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001540/**
Radek Krejci0af5f5d2018-09-07 15:00:30 +02001541 * @brief Compiled YANG data node
1542 */
1543struct lysc_node {
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001544 uint16_t nodetype; /**< type of the node (mandatory) */
1545 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Michal Vasko60ea6352020-06-29 13:39:39 +02001546 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001547 struct lys_module *module; /**< module structure */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001548 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1549 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1550 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1551 never NULL. If there is no sibling node, pointer points to the node
1552 itself. In case of the first node, this pointer points to the last
1553 node in the list. */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001554 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001555 const char *dsc; /**< description */
1556 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001557 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001558 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Michal Vasko2fd91b92020-07-17 16:39:02 +02001559 void *priv; /**< private arbitrary user data, not used by libyang */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001560};
1561
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001562struct lysc_node_container {
1563 uint16_t nodetype; /**< LYS_CONTAINER */
1564 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Michal Vasko60ea6352020-06-29 13:39:39 +02001565 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001566 struct lys_module *module; /**< module structure */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001567 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1568 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1569 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1570 never NULL. If there is no sibling node, pointer points to the node
1571 itself. In case of the first node, this pointer points to the last
1572 node in the list. */
1573 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001574 const char *dsc; /**< description */
1575 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001576 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001577 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Michal Vasko2fd91b92020-07-17 16:39:02 +02001578 void *priv; /**< private arbitrary user data, not used by libyang */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001579
1580 struct lysc_node *child; /**< first child node (linked list) */
1581 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1582 struct lysc_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
1583 struct lysc_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001584};
1585
Radek Krejcia3045382018-11-22 14:30:31 +01001586struct lysc_node_case {
Radek Krejci056d0a82018-12-06 16:57:25 +01001587 uint16_t nodetype; /**< LYS_CASE */
1588 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Michal Vasko60ea6352020-06-29 13:39:39 +02001589 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser, unused */
Radek Krejci056d0a82018-12-06 16:57:25 +01001590 struct lys_module *module; /**< module structure */
Radek Krejci056d0a82018-12-06 16:57:25 +01001591 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1592 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1593 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1594 never NULL. If there is no sibling node, pointer points to the node
1595 itself. In case of the first node, this pointer points to the last
1596 node in the list. */
Radek Krejcia3045382018-11-22 14:30:31 +01001597 const char *name; /**< name of the case, including the implicit case */
Radek Krejci12fb9142019-01-08 09:45:30 +01001598 const char *dsc; /**< description */
1599 const char *ref; /**< reference */
Radek Krejci056d0a82018-12-06 16:57:25 +01001600 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001601 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Michal Vasko2fd91b92020-07-17 16:39:02 +02001602 void *priv; /**< private arbitrary user data, not used by libyang */
Radek Krejci056d0a82018-12-06 16:57:25 +01001603
Radek Krejcia3045382018-11-22 14:30:31 +01001604 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 +01001605 each other as siblings with the parent pointer pointing to appropriate case node. */
Radek Krejcia3045382018-11-22 14:30:31 +01001606};
1607
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001608struct lysc_node_choice {
1609 uint16_t nodetype; /**< LYS_CHOICE */
1610 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Michal Vasko60ea6352020-06-29 13:39:39 +02001611 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser, unused */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001612 struct lys_module *module; /**< module structure */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001613 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1614 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1615 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1616 never NULL. If there is no sibling node, pointer points to the node
1617 itself. In case of the first node, this pointer points to the last
1618 node in the list. */
1619 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001620 const char *dsc; /**< description */
1621 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001622 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001623 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Michal Vasko2fd91b92020-07-17 16:39:02 +02001624 void *priv; /**< private arbitrary user data, not used by libyang */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001625
Radek Krejcia9026eb2018-12-12 16:04:47 +01001626 struct lysc_node_case *cases; /**< list of the cases (linked list). Note that all the children of all the cases are linked each other
1627 as siblings. Their parent pointers points to the specific case they belongs to, so distinguish the
1628 case is simple. */
Radek Krejci056d0a82018-12-06 16:57:25 +01001629 struct lysc_node_case *dflt; /**< default case of the choice, only a pointer into the cases array. */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001630};
1631
1632struct lysc_node_leaf {
1633 uint16_t nodetype; /**< LYS_LEAF */
1634 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Michal Vasko60ea6352020-06-29 13:39:39 +02001635 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001636 struct lys_module *module; /**< module structure */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001637 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1638 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1639 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1640 never NULL. If there is no sibling node, pointer points to the node
1641 itself. In case of the first node, this pointer points to the last
1642 node in the list. */
1643 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001644 const char *dsc; /**< description */
1645 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001646 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001647 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Michal Vasko2fd91b92020-07-17 16:39:02 +02001648 void *priv; /**< private arbitrary user data, not used by libyang */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001649
1650 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1651 struct lysc_type *type; /**< type of the leaf node (mandatory) */
Radek Krejcib57cf1e2018-11-23 14:07:05 +01001652
Radek Krejci4f28eda2018-11-12 11:46:16 +01001653 const char *units; /**< units of the leaf's type */
Radek Krejcia1911222019-07-22 17:24:50 +02001654 struct lyd_value *dflt; /**< default value */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001655};
1656
1657struct lysc_node_leaflist {
1658 uint16_t nodetype; /**< LYS_LEAFLIST */
1659 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Michal Vasko60ea6352020-06-29 13:39:39 +02001660 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001661 struct lys_module *module; /**< module structure */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001662 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1663 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1664 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1665 never NULL. If there is no sibling node, pointer points to the node
1666 itself. In case of the first node, this pointer points to the last
1667 node in the list. */
1668 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001669 const char *dsc; /**< description */
1670 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001671 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001672 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Michal Vasko2fd91b92020-07-17 16:39:02 +02001673 void *priv; /**< private arbitrary user data, not used by libyang */
Radek Krejcib57cf1e2018-11-23 14:07:05 +01001674
1675 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1676 struct lysc_type *type; /**< type of the leaf node (mandatory) */
1677
Radek Krejci0e5d8382018-11-28 16:37:53 +01001678 const char *units; /**< units of the leaf's type */
Radek Krejcid0ef1af2019-07-23 12:22:05 +02001679 struct lyd_value **dflts; /**< list ([sized array](@ref sizedarrays)) of default values */
Michal Vaskoba99a3e2020-08-18 15:50:05 +02001680
Radek Krejci0e5d8382018-11-28 16:37:53 +01001681 uint32_t min; /**< min-elements constraint */
1682 uint32_t max; /**< max-elements constraint */
1683
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001684};
1685
1686struct lysc_node_list {
1687 uint16_t nodetype; /**< LYS_LIST */
1688 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Michal Vasko60ea6352020-06-29 13:39:39 +02001689 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001690 struct lys_module *module; /**< module structure */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001691 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1692 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1693 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1694 never NULL. If there is no sibling node, pointer points to the node
1695 itself. In case of the first node, this pointer points to the last
1696 node in the list. */
1697 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001698 const char *dsc; /**< description */
1699 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001700 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001701 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Michal Vasko2fd91b92020-07-17 16:39:02 +02001702 void *priv; /**< private arbitrary user data, not used by libyang */
Radek Krejci9bb94eb2018-12-04 16:48:35 +01001703
1704 struct lysc_node *child; /**< first child node (linked list) */
1705 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1706 struct lysc_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
1707 struct lysc_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
1708
Radek Krejci9bb94eb2018-12-04 16:48:35 +01001709 struct lysc_node_leaf ***uniques; /**< list of sized arrays of pointers to the unique nodes ([sized array](@ref sizedarrays)) */
1710 uint32_t min; /**< min-elements constraint */
1711 uint32_t max; /**< max-elements constraint */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001712};
1713
1714struct lysc_node_anydata {
1715 uint16_t nodetype; /**< LYS_ANYXML or LYS_ANYDATA */
1716 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Michal Vasko60ea6352020-06-29 13:39:39 +02001717 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001718 struct lys_module *module; /**< module structure */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001719 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1720 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1721 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1722 never NULL. If there is no sibling node, pointer points to the node
1723 itself. In case of the first node, this pointer points to the last
1724 node in the list. */
1725 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001726 const char *dsc; /**< description */
1727 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001728 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001729 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Michal Vasko2fd91b92020-07-17 16:39:02 +02001730 void *priv; /**< private arbitrary user data, not used by libyang */
Radek Krejci9800fb82018-12-13 14:26:23 +01001731
1732 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001733};
1734
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001735/**
1736 * @brief Compiled YANG schema tree structure representing YANG module.
1737 *
1738 * Semantically validated YANG schema tree for data tree parsing.
1739 * Contains only the necessary information for the data validation.
1740 */
1741struct lysc_module {
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001742 struct lys_module *mod; /**< covering module structure */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001743
Radek Krejci2a408df2018-10-29 16:32:26 +01001744 struct lysc_node *data; /**< list of module's top-level data nodes (linked list) */
1745 struct lysc_action *rpcs; /**< list of RPCs ([sized array](@ref sizedarrays)) */
1746 struct lysc_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejcice8c1592018-10-29 15:35:51 +01001747 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci0af5f5d2018-09-07 15:00:30 +02001748};
1749
1750/**
Radek Krejci490a5462020-11-05 08:44:42 +01001751 * @brief Examine whether a node is user-ordered list or leaf-list.
1752 *
1753 * @param[in] lysc_node Schema node to examine.
1754 * @return Boolean value whether the @p node is user-ordered or not.
1755 */
1756#define lysc_is_userordered(lysc_node) \
1757 ((!lysc_node || !(lysc_node->nodetype & (LYS_LEAFLIST | LYS_LIST)) || !(lysc_node->flags & LYS_ORDBY_USER)) ? 0 : 1)
1758
1759/**
1760 * @brief Examine whether a node is a list's key.
1761 *
1762 * @param[in] lysc_node Schema node to examine.
1763 * @return Boolean value whether the @p node is a key or not.
1764 */
1765#define lysc_is_key(lysc_node) \
1766 ((!lysc_node || !(lysc_node->nodetype & (LYS_LEAF)) || !(lysc_node->flags & LYS_KEY)) ? 0 : 1)
1767
1768/**
Michal Vaskod5cfa6e2020-11-23 16:56:08 +01001769 * @brief Check whether the schema node data instance existence depends on any when conditions.
1770 * This node and any direct parent choice and case schema nodes are also examined for when conditions.
1771 *
1772 * Be careful, this function is not recursive and checks only conditions that apply to this node directly.
1773 * Meaning if there are any conditions associated with any data parent instance of @p node, they are not returned.
1774 *
1775 * @param[in] node Schema node to examine.
1776 * @return When condition associated with the node data instance, NULL if there is none.
1777 */
1778const struct lysc_when *lysc_has_when(const struct lysc_node *node);
1779
1780/**
Radek Krejci53ea6152018-12-13 15:21:15 +01001781 * @brief Get the groupings sized array of the given (parsed) schema node.
1782 * Decides the node's type and in case it has a groupings array, returns it.
1783 * @param[in] node Node to examine.
1784 * @return The node's groupings sized array if any, NULL otherwise.
1785 */
1786const struct lysp_grp *lysp_node_groupings(const struct lysp_node *node);
1787
1788/**
Radek Krejci056d0a82018-12-06 16:57:25 +01001789 * @brief Get the typedefs sized array of the given (parsed) schema node.
1790 * Decides the node's type and in case it has a typedefs array, returns it.
1791 * @param[in] node Node to examine.
1792 * @return The node's typedefs sized array if any, NULL otherwise.
1793 */
1794const struct lysp_tpdf *lysp_node_typedefs(const struct lysp_node *node);
1795
1796/**
1797 * @brief Get the actions/RPCs sized array of the given (parsed) schema node.
1798 * Decides the node's type and in case it has a actions/RPCs array, returns it.
1799 * @param[in] node Node to examine.
1800 * @return The node's actions/RPCs sized array if any, NULL otherwise.
1801 */
1802const struct lysp_action *lysp_node_actions(const struct lysp_node *node);
1803
1804/**
1805 * @brief Get the Notifications sized array of the given (parsed) schema node.
1806 * Decides the node's type and in case it has a Notifications array, returns it.
1807 * @param[in] node Node to examine.
1808 * @return The node's Notifications sized array if any, NULL otherwise.
1809 */
1810const struct lysp_notif *lysp_node_notifs(const struct lysp_node *node);
1811
1812/**
1813 * @brief Get the children linked list of the given (parsed) schema node.
1814 * Decides the node's type and in case it has a children list, returns it.
1815 * @param[in] node Node to examine.
1816 * @return The node's children linked list if any, NULL otherwise.
1817 */
1818const struct lysp_node *lysp_node_children(const struct lysp_node *node);
1819
1820/**
1821 * @brief Get the actions/RPCs sized array of the given (compiled) schema node.
1822 * Decides the node's type and in case it has a actions/RPCs array, returns it.
1823 * @param[in] node Node to examine.
1824 * @return The node's actions/RPCs sized array if any, NULL otherwise.
1825 */
1826const struct lysc_action *lysc_node_actions(const struct lysc_node *node);
1827
1828/**
1829 * @brief Get the Notifications sized array of the given (compiled) schema node.
1830 * Decides the node's type and in case it has a Notifications array, returns it.
1831 * @param[in] node Node to examine.
1832 * @return The node's Notifications sized array if any, NULL otherwise.
1833 */
1834const struct lysc_notif *lysc_node_notifs(const struct lysc_node *node);
1835
1836/**
1837 * @brief Get the children linked list of the given (compiled) schema node.
Michal Vasko208a04a2020-10-21 15:17:12 +02001838 * Skips over input and output nodes. To return them, use ::lysc_node_children_full().
Michal Vasko2a668712020-10-21 11:48:09 +02001839 *
Radek Krejci056d0a82018-12-06 16:57:25 +01001840 * @param[in] node Node to examine.
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001841 * @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 +01001842 * @return The node's children linked list if any, NULL otherwise.
1843 */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001844const struct lysc_node *lysc_node_children(const struct lysc_node *node, uint16_t flags);
Radek Krejci056d0a82018-12-06 16:57:25 +01001845
1846/**
Michal Vasko2a668712020-10-21 11:48:09 +02001847 * @brief Get the children linked list of the given (compiled) schema node.
Michal Vasko208a04a2020-10-21 15:17:12 +02001848 * Returns all children node types including input and output. To skip them, use ::lysc_node_children().
Michal Vasko2a668712020-10-21 11:48:09 +02001849 *
1850 * @param[in] node Node to examine.
1851 * @param[in] flags Config flag to distinguish input (LYS_CONFIG_W) and output (LYS_CONFIG_R) child in case of RPC/action node.
1852 * @return Children linked list if any,
1853 * @return NULL otherwise.
1854 */
Michal Vasko208a04a2020-10-21 15:17:12 +02001855const struct lysc_node *lysc_node_children_full(const struct lysc_node *node, uint16_t flags);
Michal Vasko2a668712020-10-21 11:48:09 +02001856
1857/**
1858 * @brief Get the parent pointer from any type of (compiled) schema node.
Michal Vasko208a04a2020-10-21 15:17:12 +02001859 * Returns input or output for direct descendants of RPC/action nodes.
1860 * To skip them, use ::lysc_node.parent pointer directly.
Michal Vasko2a668712020-10-21 11:48:09 +02001861 *
1862 * @param[in] node Node whose parent to get.
1863 * @return Node parent.
1864 * @return NULL is there is none.
1865 */
Michal Vasko208a04a2020-10-21 15:17:12 +02001866const struct lysc_node *lysc_node_parent_full(const struct lysc_node *node);
Michal Vasko2a668712020-10-21 11:48:09 +02001867
1868/**
Michal Vaskof1ab44f2020-10-22 08:58:32 +02001869 * @brief Callback to be called for every schema node in a DFS traversal.
1870 *
1871 * @param[in] node Current node.
1872 * @param[in] data Arbitrary user data.
1873 * @param[out] dfs_continue Set to true if the current subtree should be skipped and continue with siblings instead.
1874 * @return LY_SUCCESS on success,
1875 * @return LY_ERR value to terminate DFS and return this value.
1876 */
1877typedef LY_ERR (*lysc_dfs_clb)(struct lysc_node *node, void *data, ly_bool *dfs_continue);
1878
1879/**
1880 * @brief DFS traversal of all the schema nodes in a (sub)tree including any actions and nested notifications.
1881 *
1882 * Node with children, actions, and notifications is traversed in this order:
1883 * 1) each child subtree;
1884 * 2) each action subtree;
1885 * 3) each notification subtree.
1886 *
1887 * For algorithm illustration or traversal with actions and notifications skipped, see ::LYSC_TREE_DFS_BEGIN.
1888 *
1889 * @param[in] root Schema root to fully traverse.
1890 * @param[in] dfs_clb Callback to call for each node.
1891 * @param[in] data Arbitrary user data passed to @p dfs_clb.
1892 * @return LY_SUCCESS on success,
1893 * @return LY_ERR value returned by @p dfs_clb.
1894 */
1895LY_ERR lysc_tree_dfs_full(const struct lysc_node *root, lysc_dfs_clb dfs_clb, void *data);
1896
1897/**
1898 * @brief DFS traversal of all the schema nodes in a module including RPCs and notifications.
1899 *
1900 * For more details, see ::lysc_tree_dfs_full().
1901 *
1902 * @param[in] mod Module to fully traverse.
1903 * @param[in] dfs_clb Callback to call for each node.
1904 * @param[in] data Arbitrary user data passed to @p dfs_clb.
1905 * @return LY_SUCCESS on success,
1906 * @return LY_ERR value returned by @p dfs_clb.
1907 */
1908LY_ERR lysc_module_dfs_full(const struct lys_module *mod, lysc_dfs_clb dfs_clb, void *data);
1909
1910/**
Michal Vasko2fd91b92020-07-17 16:39:02 +02001911 * @brief Set a schema private pointer to a user pointer.
1912 *
1913 * @param[in] node Node, whose private field will be assigned. Works also for RPCs, actions, and notifications.
1914 * @param[in] priv Arbitrary user-specified pointer.
Radek Krejciaf9cd802020-10-06 21:59:47 +02001915 * @param[out] prev_priv_p Optional previous private object of the \p node. Note, that
Michal Vasko2fd91b92020-07-17 16:39:02 +02001916 * the caller is in this case responsible (if it is necessary) for freeing the replaced private object.
1917 * @return LY_ERR value.
1918 */
Radek Krejciaf9cd802020-10-06 21:59:47 +02001919LY_ERR lysc_set_private(const struct lysc_node *node, void *priv, void **prev_priv_p);
Michal Vasko2fd91b92020-07-17 16:39:02 +02001920
1921/**
Radek Krejci151a5b72018-10-19 14:21:44 +02001922 * @brief Get how the if-feature statement currently evaluates.
1923 *
1924 * @param[in] iff Compiled if-feature statement to evaluate.
Michal Vasko28d78432020-05-26 13:10:53 +02001925 * @return LY_SUCCESS if the statement evaluates to true,
1926 * @return LY_ENOT if it evaluates to false,
1927 * @return LY_ERR on error.
Radek Krejci151a5b72018-10-19 14:21:44 +02001928 */
Michal Vasko28d78432020-05-26 13:10:53 +02001929LY_ERR lysc_iffeature_value(const struct lysc_iffeature *iff);
Radek Krejci151a5b72018-10-19 14:21:44 +02001930
1931/**
Michal Vasko7b1ad1a2020-11-02 15:41:27 +01001932 * @brief Get the next feature in the module or submodules.
Radek Krejci151a5b72018-10-19 14:21:44 +02001933 *
Michal Vasko7b1ad1a2020-11-02 15:41:27 +01001934 * @param[in] last Last returned feature.
1935 * @param[in] pmod Parsed module and submodoules whose features to iterate over.
1936 * @param[in,out] idx Submodule index, set to 0 on first call.
1937 * @return Next found feature, NULL if the last has already been returned.
Radek Krejci151a5b72018-10-19 14:21:44 +02001938 */
Michal Vasko7b1ad1a2020-11-02 15:41:27 +01001939struct lysp_feature *lysp_feature_next(const struct lysp_feature *last, const struct lysp_module *pmod, uint32_t *idx);
Radek Krejci151a5b72018-10-19 14:21:44 +02001940
Radek Krejcibed13942020-10-19 16:06:28 +02001941/**
1942 * @defgroup findxpathoptions Atomize XPath options
1943 * Options to modify behavior of ::lys_find_xpath() and ::lys_find_xpath_atoms() searching for schema nodes in schema tree.
1944 * @{
1945 */
Michal Vaskocdad7122020-11-09 21:04:44 +01001946#define LYS_FIND_XP_SCHEMA 0x08 /**< Apply node access restrictions defined for 'when' and 'must' evaluation. */
1947#define LYS_FIND_XP_OUTPUT 0x10 /**< Search RPC/action output nodes instead of input ones. */
Radek Krejci576f8fa2020-10-26 21:23:58 +01001948/** @} findxpathoptions */
Michal Vasko072de482020-08-05 13:27:21 +02001949
Radek Krejci151a5b72018-10-19 14:21:44 +02001950/**
Michal Vasko40308e72020-10-20 16:38:40 +02001951 * @brief Get all the schema nodes that are required for @p xpath to be evaluated (atoms).
Michal Vasko519fd602020-05-26 12:17:39 +02001952 *
1953 * @param[in] ctx_node XPath schema context node.
Michal Vasko40308e72020-10-20 16:38:40 +02001954 * @param[in] xpath Data XPath expression filtering the matching nodes. ::LY_PREF_JSON prefix format is expected.
Radek Krejcibed13942020-10-19 16:06:28 +02001955 * @param[in] options Whether to apply some node access restrictions, see @ref findxpathoptions.
Michal Vasko519fd602020-05-26 12:17:39 +02001956 * @param[out] set Set of found atoms (schema nodes).
1957 * @return LY_SUCCESS on success, @p set is returned.
Michal Vasko40308e72020-10-20 16:38:40 +02001958 * @return LY_ERR value on error.
Michal Vasko519fd602020-05-26 12:17:39 +02001959 */
Radek Krejcibed13942020-10-19 16:06:28 +02001960LY_ERR lys_find_xpath_atoms(const struct lysc_node *ctx_node, const char *xpath, uint32_t options, struct ly_set **set);
Michal Vasko519fd602020-05-26 12:17:39 +02001961
Michal Vasko072de482020-08-05 13:27:21 +02001962/**
Michal Vasko40308e72020-10-20 16:38:40 +02001963 * @brief Get all the schema nodes that are required for @p expr to be evaluated (atoms).
Michal Vasko072de482020-08-05 13:27:21 +02001964 *
1965 * @param[in] ctx_node XPath schema context node.
Michal Vasko40308e72020-10-20 16:38:40 +02001966 * @param[in] cur_mod Current module for the expression (where it was "instantiated").
1967 * @param[in] expr Parsed expression to use.
1968 * @param[in] prefixes Sized array of compiled prefixes.
1969 * @param[in] options Whether to apply some node access restrictions, see @ref findxpathoptions.
1970 * @param[out] set Set of found atoms (schema nodes).
1971 * @return LY_SUCCESS on success, @p set is returned.
1972 * @return LY_ERR value on error.
1973 */
1974LY_ERR lys_find_expr_atoms(const struct lysc_node *ctx_node, const struct lys_module *cur_mod,
1975 const struct lyxp_expr *expr, const struct lysc_prefix *prefixes, uint32_t options, struct ly_set **set);
1976
1977/**
1978 * @brief Evaluate an @p xpath expression on schema nodes.
1979 *
1980 * @param[in] ctx_node XPath schema context node.
1981 * @param[in] xpath Data XPath expression filtering the matching nodes. ::LY_PREF_JSON prefix format is expected.
Radek Krejcibed13942020-10-19 16:06:28 +02001982 * @param[in] options Whether to apply some node access restrictions, see @ref findxpathoptions.
Michal Vasko072de482020-08-05 13:27:21 +02001983 * @param[out] set Set of found schema nodes.
1984 * @return LY_SUCCESS on success, @p set is returned.
1985 * @return LY_ERR value if an error occurred.
1986 */
Radek Krejci1deb5be2020-08-26 16:43:36 +02001987LY_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 +02001988
1989/**
Radek Krejcibc5644c2020-10-27 14:53:17 +01001990 * @brief Get all the schema nodes that are required for @p path to be evaluated (atoms).
1991 *
1992 * @param[in] path Compiled path to use.
1993 * @param[out] set Set of found atoms (schema nodes).
1994 * @return LY_SUCCESS on success, @p set is returned.
1995 * @return LY_ERR value on error.
1996 */
1997LY_ERR lys_find_lypath_atoms(const struct ly_path *path, struct ly_set **set);
1998
1999/**
2000 * @brief Get all the schema nodes that are required for @p path to be evaluated (atoms).
2001 *
2002 * @param[in] ctx libyang context, set for absolute paths.
2003 * @param[in] ctx_node Starting context node for a relative data path, set for relative paths.
2004 * @param[in] path JSON path to examine.
2005 * @param[in] output Search operation output instead of input.
2006 * @param[out] set Set of found atoms (schema nodes).
2007 * @return LY_ERR value on error.
2008 */
2009LY_ERR lys_find_path_atoms(const struct ly_ctx *ctx, const struct lysc_node *ctx_node, const char *path, ly_bool output,
2010 struct ly_set **set);
2011
2012/**
2013 * @brief Get a schema node based on the given data path (JSON format, see @ref howtoXPath).
2014 *
2015 * @param[in] ctx libyang context, set for absolute paths.
2016 * @param[in] ctx_node Starting context node for a relative data path, set for relative paths.
2017 * @param[in] path JSON path of the node to get.
2018 * @param[in] output Search operation output instead of input.
2019 * @return Found schema node or NULL.
2020 */
2021const struct lysc_node *lys_find_path(const struct ly_ctx *ctx, const struct lysc_node *ctx_node, const char *path,
2022 ly_bool output);
2023
2024/**
Michal Vasko03ff5a72019-09-11 13:49:33 +02002025 * @brief Types of the different schema paths.
2026 */
2027typedef enum {
Michal Vasko65de0402020-08-03 16:34:19 +02002028 LYSC_PATH_LOG, /**< Descriptive path format used in log messages */
2029 LYSC_PATH_DATA /**< Similar to ::LYSC_PATH_LOG except that schema-only nodes (choice, case) are skipped */
Michal Vasko03ff5a72019-09-11 13:49:33 +02002030} LYSC_PATH_TYPE;
2031
2032/**
Radek Krejci327de162019-06-14 12:52:07 +02002033 * @brief Generate path of the given node in the requested format.
2034 *
2035 * @param[in] node Schema path of this node will be generated.
2036 * @param[in] pathtype Format of the path to generate.
Radek Krejci1c0c3442019-07-23 16:08:47 +02002037 * @param[in,out] buffer Prepared buffer of the @p buflen length to store the generated path.
2038 * If NULL, memory for the complete path is allocated.
2039 * @param[in] buflen Size of the provided @p buffer.
Radek Krejci327de162019-06-14 12:52:07 +02002040 * @return NULL in case of memory allocation error, path of the node otherwise.
Radek Krejci1c0c3442019-07-23 16:08:47 +02002041 * 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 +02002042 */
Michal Vasko03ff5a72019-09-11 13:49:33 +02002043char *lysc_path(const struct lysc_node *node, LYSC_PATH_TYPE pathtype, char *buffer, size_t buflen);
Radek Krejci327de162019-06-14 12:52:07 +02002044
2045/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +02002046 * @brief Available YANG schema tree structures representing YANG module.
2047 */
2048struct lys_module {
Radek Krejci0bcdaed2019-01-10 10:21:34 +01002049 struct ly_ctx *ctx; /**< libyang context of the module (mandatory) */
2050 const char *name; /**< name of the module (mandatory) */
Radek Krejci0af46292019-01-11 16:02:31 +01002051 const char *revision; /**< revision of the module (if present) */
Radek Krejci0bcdaed2019-01-10 10:21:34 +01002052 const char *ns; /**< namespace of the module (module - mandatory) */
2053 const char *prefix; /**< module prefix or submodule belongsto prefix of main module (mandatory) */
2054 const char *filepath; /**< path, if the schema was read from a file, NULL in case of reading from memory */
2055 const char *org; /**< party/company responsible for the module */
2056 const char *contact; /**< contact information for the module */
2057 const char *dsc; /**< description of the module */
2058 const char *ref; /**< cross-reference for the module */
2059
Radek Krejci5aeea3a2018-09-05 13:29:36 +02002060 struct lysp_module *parsed; /**< Simply parsed (unresolved) YANG schema tree */
Radek Krejci0af46292019-01-11 16:02:31 +01002061 struct lysc_module *compiled; /**< Compiled and fully validated YANG schema tree for data parsing.
2062 Available only for implemented modules. */
Michal Vasko7f45cf22020-10-01 12:49:44 +02002063
Radek Krejci80d281e2020-09-14 17:42:54 +02002064 struct lysc_ident *identities; /**< List of compiled identities of the module ([sized array](@ref sizedarrays))
2065 Identities are outside the compiled tree to allow their linkage to the identities from
2066 the implemented modules. This avoids problems when the module became implemented in
2067 future (no matter if implicitly via augment/deviate or explicitly via
2068 ::lys_set_implemented()). Note that if the module is not implemented (compiled), the
2069 identities cannot be instantiated in data (in identityrefs). */
Michal Vasko7f45cf22020-10-01 12:49:44 +02002070
2071 struct lys_module **augmented_by;/**< List of modules that augment this module ([sized array](@ref sizedarrays)) */
2072 struct lys_module **deviated_by; /**< List of modules that deviate this module ([sized array](@ref sizedarrays)) */
2073
Michal Vasko89b5c072020-10-06 13:52:44 +02002074 ly_bool implemented; /**< flag if the module is implemented, not just imported */
Radek Krejci95710c92019-02-11 15:49:55 +01002075 uint8_t latest_revision; /**< flag to mark the latest available revision:
Radek Krejci0bcdaed2019-01-10 10:21:34 +01002076 1 - the latest revision in searchdirs was not searched yet and this is the
2077 latest revision in the current context
2078 2 - searchdirs were searched and this is the latest available revision */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02002079};
2080
Radek Krejci151a5b72018-10-19 14:21:44 +02002081/**
Michal Vasko82c31e62020-07-17 15:30:40 +02002082 * @brief Get the current real status of the specified feature in the module.
2083 *
2084 * If the feature is enabled, but some of its if-features are false, the feature is considered
2085 * disabled.
Radek Krejci151a5b72018-10-19 14:21:44 +02002086 *
2087 * @param[in] module Module where the feature is defined.
2088 * @param[in] feature Name of the feature to inspect.
Michal Vasko82c31e62020-07-17 15:30:40 +02002089 * @return LY_SUCCESS if the feature is enabled,
2090 * @return LY_ENOT if the feature is disabled,
2091 * @return LY_ENOTFOUND if the feature was not found.
Radek Krejci151a5b72018-10-19 14:21:44 +02002092 */
Michal Vasko82c31e62020-07-17 15:30:40 +02002093LY_ERR lys_feature_value(const struct lys_module *module, const char *feature);
Radek Krejcidd4e8d42018-10-16 14:55:43 +02002094
2095/**
Radek Krejcia3045382018-11-22 14:30:31 +01002096 * @brief Get next schema tree (sibling) node element that can be instantiated in a data tree. Returned node can
2097 * be from an augment.
2098 *
Radek Krejci8678fa42020-08-18 16:07:28 +02002099 * ::lys_getnext() is supposed to be called sequentially. In the first call, the \p last parameter is usually NULL
Radek Krejcia3045382018-11-22 14:30:31 +01002100 * and function starts returning i) the first \p parent's child or ii) the first top level element of the \p module.
2101 * Consequent calls suppose to provide the previously returned node as the \p last parameter and still the same
2102 * \p parent and \p module parameters.
2103 *
2104 * Without options, the function is used to traverse only the schema nodes that can be paired with corresponding
2105 * data nodes in a data tree. By setting some \p options the behavior can be modified to the extent that
2106 * all the schema nodes are iteratively returned.
2107 *
2108 * @param[in] last Previously returned schema tree node, or NULL in case of the first call.
2109 * @param[in] parent Parent of the subtree where the function starts processing.
2110 * @param[in] module In case of iterating on top level elements, the \p parent is NULL and
2111 * module must be specified.
2112 * @param[in] options [ORed options](@ref sgetnextflags).
2113 * @return Next schema tree node that can be instantiated in a data tree, NULL in case there is no such element.
2114 */
2115const struct lysc_node *lys_getnext(const struct lysc_node *last, const struct lysc_node *parent,
Radek Krejci1deb5be2020-08-26 16:43:36 +02002116 const struct lysc_module *module, uint32_t options);
Radek Krejcia3045382018-11-22 14:30:31 +01002117
2118/**
Radek Krejci8678fa42020-08-18 16:07:28 +02002119 * @defgroup sgetnextflags Options for ::lys_getnext().
2120 *
2121 * Various options setting behavior of ::lys_getnext().
2122 *
Radek Krejcia3045382018-11-22 14:30:31 +01002123 * @{
2124 */
Radek Krejci8678fa42020-08-18 16:07:28 +02002125#define LYS_GETNEXT_WITHCHOICE 0x01 /**< ::lys_getnext() option to allow returning #LYS_CHOICE nodes instead of looking into them */
2126#define LYS_GETNEXT_NOCHOICE 0x02 /**< ::lys_getnext() option to ignore (kind of conditional) nodes within choice node */
2127#define LYS_GETNEXT_WITHCASE 0x04 /**< ::lys_getnext() option to allow returning #LYS_CASE nodes instead of looking into them */
Michal Vasko7b1ad1a2020-11-02 15:41:27 +01002128#define LYS_GETNEXT_INTONPCONT 0x08 /**< ::lys_getnext() option to look into non-presence container, instead of returning container itself */
2129#define LYS_GETNEXT_OUTPUT 0x10 /**< ::lys_getnext() option to provide RPC's/action's output schema nodes instead of input schema nodes
Radek Krejci6eeb58f2019-02-22 16:29:37 +01002130 provided by default */
Radek Krejcia3045382018-11-22 14:30:31 +01002131/** @} sgetnextflags */
2132
2133/**
2134 * @brief Get child node according to the specified criteria.
2135 *
2136 * @param[in] parent Optional parent of the node to find. If not specified, the module's top-level nodes are searched.
2137 * @param[in] module module of the node to find. It is also limitation for the children node of the given parent.
2138 * @param[in] name Name of the node to find.
2139 * @param[in] name_len Optional length of the name in case it is not NULL-terminated string.
2140 * @param[in] nodetype Optional criteria (to speedup) specifying nodetype(s) of the node to find.
2141 * Used as a bitmask, so multiple nodetypes can be specified.
2142 * @param[in] options [ORed options](@ref sgetnextflags).
2143 * @return Found node if any.
2144 */
Michal Vaskoe444f752020-02-10 12:20:06 +01002145const struct lysc_node *lys_find_child(const struct lysc_node *parent, const struct lys_module *module,
Radek Krejci1deb5be2020-08-26 16:43:36 +02002146 const char *name, size_t name_len, uint16_t nodetype, uint32_t options);
Radek Krejcia3045382018-11-22 14:30:31 +01002147
2148/**
Radek Krejci77a8bcd2019-09-11 11:20:02 +02002149 * @brief Make the specific module implemented.
2150 *
2151 * @param[in] mod Module to make implemented. It is not an error
2152 * to provide already implemented module, it just does nothing.
Michal Vasko08c8b272020-11-24 18:11:30 +01002153 * @param[in] features Optional array of features ended with NULL to be enabled. NULL for all features disabled
2154 * and '*' for all enabled. If the module is already implemented, these features are still correctly set and all
2155 * the modules recompiled.
Michal Vaskoe444f752020-02-10 12:20:06 +01002156 * @return LY_SUCCESS on success.
2157 * @return LY_EDENIED in case the context contains some other revision of the same module which is already implemented.
Michal Vasko7b1ad1a2020-11-02 15:41:27 +01002158 * @return LY_ERR on other errors during module compilation.
Radek Krejci77a8bcd2019-09-11 11:20:02 +02002159 */
Michal Vasko7b1ad1a2020-11-02 15:41:27 +01002160LY_ERR lys_set_implemented(struct lys_module *mod, const char **features);
Radek Krejcia3045382018-11-22 14:30:31 +01002161
Radek Krejci084289f2019-07-09 17:35:30 +02002162/**
2163 * @brief Check type restrictions applicable to the particular leaf/leaf-list with the given string @p value.
2164 *
2165 * This function check just the type's restriction, if you want to check also the data tree context (e.g. in case of
Radek Krejci8678fa42020-08-18 16:07:28 +02002166 * require-instance restriction), use ::lyd_value_validate().
Radek Krejci084289f2019-07-09 17:35:30 +02002167 *
2168 * @param[in] ctx libyang context for logging (function does not log errors when @p ctx is NULL)
2169 * @param[in] node Schema node for the @p value.
Michal Vaskof937cfe2020-08-03 16:07:12 +02002170 * @param[in] value String value to be checked, expected to be in JSON format.
Radek Krejci084289f2019-07-09 17:35:30 +02002171 * @param[in] value_len Length of the given @p value (mandatory).
Radek Krejci084289f2019-07-09 17:35:30 +02002172 * @return LY_SUCCESS on success
2173 * @return LY_ERR value if an error occurred.
2174 */
Michal Vaskof937cfe2020-08-03 16:07:12 +02002175LY_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 +02002176
Radek Krejci0935f412019-08-20 16:15:18 +02002177/**
2178 * @brief Stringify schema nodetype.
Michal Vaskod43d71a2020-08-07 14:54:58 +02002179 *
Radek Krejci0935f412019-08-20 16:15:18 +02002180 * @param[in] nodetype Nodetype to stringify.
2181 * @return Constant string with the name of the node's type.
2182 */
2183const char *lys_nodetype2str(uint16_t nodetype);
2184
Michal Vaskod43d71a2020-08-07 14:54:58 +02002185/**
2186 * @brief Getter for original XPath expression from a parsed expression.
2187 *
2188 * @param[in] path Parsed expression.
2189 * @return Original string expression.
2190 */
2191const char *lyxp_get_expr(const struct lyxp_expr *path);
2192
Radek Krejci2ff0d572020-05-21 15:27:28 +02002193/** @} schematree */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02002194
Radek Krejci70853c52018-10-15 14:46:16 +02002195#ifdef __cplusplus
2196}
2197#endif
2198
Radek Krejci5aeea3a2018-09-05 13:29:36 +02002199#endif /* LY_TREE_SCHEMA_H_ */