blob: 0181bc6f9f3c80e1e2567933a9f8cccb45c1aeaa [file] [log] [blame]
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001/**
2 * @file tree_schema.h
3 * @author Radek Krejci <rkrejci@cesnet.cz>
Michal Vaskoedb0fa52022-10-04 10:36:00 +02004 * @author Michal Vasko <mvasko@cesnet.cz>
Radek Krejci5aeea3a2018-09-05 13:29:36 +02005 * @brief libyang representation of YANG schema trees.
6 *
Michal Vaskoedb0fa52022-10-04 10:36:00 +02007 * Copyright (c) 2015 - 2022 CESNET, z.s.p.o.
Radek Krejci5aeea3a2018-09-05 13:29:36 +02008 *
9 * This source code is licensed under BSD 3-Clause License (the "License").
10 * You may not use this file except in compliance with the License.
11 * You may obtain a copy of the License at
12 *
13 * https://opensource.org/licenses/BSD-3-Clause
14 */
15
16#ifndef LY_TREE_SCHEMA_H_
17#define LY_TREE_SCHEMA_H_
18
Radek Krejci54579462019-04-30 12:47:06 +020019#define PCRE2_CODE_UNIT_WIDTH 8
20
21#include <pcre2.h>
Radek Krejci535ea9f2020-05-29 16:01:05 +020022
Radek Krejci5aeea3a2018-09-05 13:29:36 +020023#include <stdint.h>
Radek Krejcid3ca0632019-04-16 16:54:54 +020024#include <stdio.h>
Radek Krejci5aeea3a2018-09-05 13:29:36 +020025
Radek Krejcie7b95092019-05-15 11:03:07 +020026#include "log.h"
Michal Vasko8f702ee2024-02-20 15:44:24 +010027#include "ly_config.h"
Radek Krejcie7b95092019-05-15 11:03:07 +020028#include "tree.h"
Radek Krejcice8c1592018-10-29 15:35:51 +010029
Radek Krejci70853c52018-10-15 14:46:16 +020030#ifdef __cplusplus
31extern "C" {
32#endif
33
Radek Krejcica376bd2020-06-11 16:04:06 +020034struct ly_ctx;
Radek Krejci47fab892020-11-05 17:02:41 +010035struct ly_path;
Radek Krejcica376bd2020-06-11 16:04:06 +020036struct ly_set;
Radek Krejci47fab892020-11-05 17:02:41 +010037struct lys_module;
38struct lysc_node;
39struct lyxp_expr;
Radek Krejcica376bd2020-06-11 16:04:06 +020040
Radek Krejci5aeea3a2018-09-05 13:29:36 +020041/**
Radek Krejci8678fa42020-08-18 16:07:28 +020042 * @page howtoSchema YANG Modules
43 *
44 * To be able to work with YANG data instances, libyang has to represent YANG data models. All the processed modules are stored
45 * in libyang [context](@ref howtoContext) and loaded using [parser functions](@ref howtoSchemaParsers). It means, that there is
46 * no way to create/change YANG module programmatically. However, all the YANG model definitions are available and can be examined
47 * through the C structures. All the context's modules together form YANG Schema for the data being instantiated.
48 *
49 * Any YANG module is represented as ::lys_module. In fact, the module is represented in two different formats. As ::lys_module.parsed,
50 * there is a parsed schema reflecting the source YANG module. It is exactly what is read from the input. This format is good for
51 * converting from one format to another (YANG to YIN and vice versa), but it is not very useful for validating/manipulating YANG
52 * data. Therefore, there is ::lys_module.compiled storing the compiled YANG module. It is based on the parsed module, but all the
53 * 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
54 * `uses` or `type` references. This split also means, that the YANG module is fully validated after compilation of the parsed
55 * representation of the module. YANG submodules are available only in the parsed representation. When a submodule is compiled, it
56 * is fully integrated into its main module.
57 *
58 * The context can contain even modules without the compiled representation. Such modules are still useful as imports of other
59 * modules. The grouping or typedef definition can be even compiled into the importing modules. This is actually the main
60 * difference between the imported and implemented modules in the libyang context. The implemented modules are compiled while the
61 * imported modules are only parsed.
62 *
Radek Krejcib100b192020-10-26 08:37:45 +010063 * By default, the module is implemented (and compiled) in case it is explicitly loaded or referenced in another module as
64 * target of leafref, augment or deviation. This behavior can be changed via context options ::LY_CTX_ALL_IMPLEMENTED, when
65 * all the modules in the context are marked as implemented (note the problem with multiple revisions of a single module),
66 * or by ::LY_CTX_REF_IMPLEMENTED option, extending the set of references making the module implemented by when, must and
67 * default statements.
Radek Krejci8678fa42020-08-18 16:07:28 +020068 *
69 * All modules with deviation definition are always marked as implemented. The imported (not implemented) module can be set implemented by ::lys_set_implemented(). But
70 * the implemented module cannot be changed back to just imported module. Note also that only one revision of a specific module
71 * can be implemented in a single context. The imported modules are used only as a
72 * source of definitions for types and groupings for uses statements. The data in such modules are ignored - caller
73 * is not allowed to create the data (including instantiating identities) defined in the model via data parsers,
74 * the default nodes are not added into any data tree and mandatory nodes are not checked in the data trees.
75 *
Michal Vasko14ed9cd2021-01-28 14:16:25 +010076 * The compiled schema tree nodes are able to hold private objects (::lysc_node.priv as a pointer to a structure,
aPiecek9922ea92021-04-12 07:59:20 +020077 * function, variable, ...) used by a caller application unless ::LY_CTX_SET_PRIV_PARSED is set, in that case
78 * the ::lysc_node.priv pointers are used by libyang.
Radek Krejci8678fa42020-08-18 16:07:28 +020079 * Note that the object is not freed by libyang when the context is being destroyed. So the caller is responsible
80 * for freeing the provided structure after the context is destroyed or the private pointer is set to NULL in
Radek Krejci90ed21e2021-04-12 14:47:46 +020081 * appropriate schema nodes where the object was previously set. Also ::lysc_tree_dfs_full() can be useful to manage
82 * the private data.
Radek Krejci8678fa42020-08-18 16:07:28 +020083 *
84 * Despite all the schema structures and their members are available as part of the libyang API and callers can use
85 * it to navigate through the schema tree structure or to obtain various information, we recommend to use the following
86 * macros for the specific actions.
87 * - ::LYSC_TREE_DFS_BEGIN and ::LYSC_TREE_DFS_END to traverse the schema tree (depth-first).
88 * - ::LY_LIST_FOR and ::LY_ARRAY_FOR as described on @ref howtoStructures page.
89 *
90 * Further information about modules handling can be found on the following pages:
91 * - @subpage howtoSchemaParsers
92 * - @subpage howtoSchemaFeatures
93 * - @subpage howtoPlugins
94 * - @subpage howtoSchemaPrinters
95 *
96 * \note There are many functions to access information from the schema trees. Details are available in
97 * the [Schema Tree module](@ref schematree).
98 *
99 * For information about difference between implemented and imported modules, see the
100 * [context description](@ref howtoContext).
101 *
102 * Functions List (not assigned to above subsections)
103 * --------------------------------------------------
104 * - ::lys_getnext()
105 * - ::lys_nodetype2str()
106 * - ::lys_set_implemented()
Radek Krejci8678fa42020-08-18 16:07:28 +0200107 *
Michal Vaskod5cfa6e2020-11-23 16:56:08 +0100108 * - ::lysc_has_when()
Michal Vaskoef53c812021-10-13 10:21:03 +0200109 * - ::lysc_owner_module()
Michal Vaskod5cfa6e2020-11-23 16:56:08 +0100110 *
Michal Vasko544e58a2021-01-28 14:33:41 +0100111 * - ::lysc_node_child()
Radek Krejci8678fa42020-08-18 16:07:28 +0200112 * - ::lysc_node_actions()
113 * - ::lysc_node_notifs()
114 *
Michal Vasko544e58a2021-01-28 14:33:41 +0100115 * - ::lysp_node_child()
Radek Krejci8678fa42020-08-18 16:07:28 +0200116 * - ::lysp_node_actions()
117 * - ::lysp_node_notifs()
118 * - ::lysp_node_groupings()
119 * - ::lysp_node_typedefs()
120 */
121
122/**
123 * @page howtoSchemaFeatures YANG Features
124 *
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100125 * YANG feature statement is an important part of the language which can significantly affect the meaning of the schemas.
126 * Modifying features may have similar effects as loading/removing schema from the context so it is limited to context
127 * preparation period before working with data. YANG features, respectively their use in if-feature
128 * statements, are evaluated as part of schema compilation so a feature-specific compiled schema tree is generated
129 * as a result.
Radek Krejci8678fa42020-08-18 16:07:28 +0200130 *
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100131 * To enable any features, they must currently be specified when implementing a new schema with ::lys_parse() or
132 * ::ly_ctx_load_module(). To later examine what the status of a feature is, check its ::LYS_FENABLED flag or
133 * 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 +0200134 *
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100135 * To iterate over all features of a particular YANG module, use ::lysp_feature_next().
Radek Krejci8678fa42020-08-18 16:07:28 +0200136 *
137 * Note, that the feature's state can affect some of the output formats (e.g. Tree format).
138 *
139 * Functions List
140 * --------------
Radek Krejci8678fa42020-08-18 16:07:28 +0200141 * - ::lys_feature_value()
Radek Krejci8678fa42020-08-18 16:07:28 +0200142 * - ::lysc_iffeature_value()
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100143 * - ::lysp_feature_next()
Radek Krejci8678fa42020-08-18 16:07:28 +0200144 */
145
146/**
Radek Krejci2ff0d572020-05-21 15:27:28 +0200147 * @ingroup trees
Radek Krejci8678fa42020-08-18 16:07:28 +0200148 * @defgroup schematree Schema Tree
Radek Krejci2ff0d572020-05-21 15:27:28 +0200149 * @{
150 *
151 * Data structures and functions to manipulate and access schema tree.
152 */
153
Michal Vasko64246d82020-08-19 12:35:00 +0200154/* *INDENT-OFF* */
155
Radek Krejci2ff0d572020-05-21 15:27:28 +0200156/**
Michal Vasko208a04a2020-10-21 15:17:12 +0200157 * @brief Macro to iterate via all elements in a schema (sub)tree including input and output.
158 * Note that __actions__ and __notifications__ of traversed nodes __are ignored__! To traverse
159 * on all the nodes including those, use ::lysc_tree_dfs_full() instead.
160 *
161 * 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 +0200162 *
163 * The function follows deep-first search algorithm:
164 * <pre>
165 * 1
166 * / \
167 * 2 4
168 * / / \
169 * 3 5 6
170 * </pre>
171 *
172 * Use the same parameters for #LYSC_TREE_DFS_BEGIN and #LYSC_TREE_DFS_END. While
Radek Krejci2a9fc652021-01-22 17:44:34 +0100173 * START can be any of the lysc_node* types (including lysc_node_action and lysc_node_notif),
Radek Krejci0935f412019-08-20 16:15:18 +0200174 * ELEM variable must be of the struct lysc_node* type.
175 *
176 * To skip a particular subtree, instead of the continue statement, set LYSC_TREE_DFS_continue
177 * variable to non-zero value.
178 *
179 * Use with opening curly bracket '{' after the macro.
180 *
181 * @param START Pointer to the starting element processed first.
182 * @param ELEM Iterator intended for use in the block.
183 */
184#define LYSC_TREE_DFS_BEGIN(START, ELEM) \
Radek Krejci857189e2020-09-01 13:26:36 +0200185 { ly_bool LYSC_TREE_DFS_continue = 0; struct lysc_node *LYSC_TREE_DFS_next; \
Michal Vasko14ed9cd2021-01-28 14:16:25 +0100186 for ((ELEM) = (LYSC_TREE_DFS_next) = (struct lysc_node *)(START); \
Radek Krejci0935f412019-08-20 16:15:18 +0200187 (ELEM); \
188 (ELEM) = (LYSC_TREE_DFS_next), LYSC_TREE_DFS_continue = 0)
189
190/**
191 * @brief Macro to iterate via all elements in a (sub)tree. This is the closing part
192 * to the #LYSC_TREE_DFS_BEGIN - they always have to be used together.
193 *
194 * Use the same parameters for #LYSC_TREE_DFS_BEGIN and #LYSC_TREE_DFS_END. While
Radek Krejci2a9fc652021-01-22 17:44:34 +0100195 * START can be a pointer to any of the lysc_node* types (including lysc_node_action and lysc_node_notif),
Radek Krejci0935f412019-08-20 16:15:18 +0200196 * ELEM variable must be pointer to the lysc_node type.
197 *
198 * Use with closing curly bracket '}' after the macro.
199 *
200 * @param START Pointer to the starting element processed first.
201 * @param ELEM Iterator intended for use in the block.
202 */
Radek Krejci0935f412019-08-20 16:15:18 +0200203#define LYSC_TREE_DFS_END(START, ELEM) \
204 /* select element for the next run - children first */ \
205 if (LYSC_TREE_DFS_continue) { \
206 (LYSC_TREE_DFS_next) = NULL; \
207 } else { \
Michal Vasko544e58a2021-01-28 14:33:41 +0100208 (LYSC_TREE_DFS_next) = (struct lysc_node *)lysc_node_child(ELEM); \
Michal Vasko208a04a2020-10-21 15:17:12 +0200209 } \
Radek Krejci0935f412019-08-20 16:15:18 +0200210 if (!(LYSC_TREE_DFS_next)) { \
Michal Vasko208a04a2020-10-21 15:17:12 +0200211 /* no children, try siblings */ \
212 _LYSC_TREE_DFS_NEXT(START, ELEM, LYSC_TREE_DFS_next); \
Radek Krejci0935f412019-08-20 16:15:18 +0200213 } \
214 while (!(LYSC_TREE_DFS_next)) { \
215 /* parent is already processed, go to its sibling */ \
Radek Krejci7d95fbb2021-01-26 17:33:13 +0100216 (ELEM) = (ELEM)->parent; \
Michal Vasko208a04a2020-10-21 15:17:12 +0200217 _LYSC_TREE_DFS_NEXT(START, ELEM, LYSC_TREE_DFS_next); \
218 } }
219
220/**
221 * @brief Helper macro for #LYSC_TREE_DFS_END, should not be used directly!
222 */
223#define _LYSC_TREE_DFS_NEXT(START, ELEM, NEXT) \
224 if ((ELEM) == (struct lysc_node *)(START)) { \
225 /* we are done, no next element to process */ \
226 break; \
227 } \
Michal Vasko544e58a2021-01-28 14:33:41 +0100228 (NEXT) = (ELEM)->next;
Radek Krejci0935f412019-08-20 16:15:18 +0200229
Michal Vasko64246d82020-08-19 12:35:00 +0200230/* *INDENT-ON* */
231
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200232#define LY_REV_SIZE 11 /**< revision data string length (including terminating NULL byte) */
233
Radek Krejcide7a9c42021-03-10 13:13:06 +0100234/**
235 * @defgroup schemanodetypes Schema Node Types
236 * Values of the ::lysp_node.nodetype and ::lysc_node.nodetype members.
237 * @{
238 */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200239#define LYS_UNKNOWN 0x0000 /**< uninitalized unknown statement node */
240#define LYS_CONTAINER 0x0001 /**< container statement node */
241#define LYS_CHOICE 0x0002 /**< choice statement node */
242#define LYS_LEAF 0x0004 /**< leaf statement node */
243#define LYS_LEAFLIST 0x0008 /**< leaf-list statement node */
244#define LYS_LIST 0x0010 /**< list statement node */
245#define LYS_ANYXML 0x0020 /**< anyxml statement node */
246#define LYS_ANYDATA 0x0060 /**< anydata statement node, in tests it can be used for both #LYS_ANYXML and #LYS_ANYDATA */
247#define LYS_CASE 0x0080 /**< case statement node */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200248
Michal Vasko7f45cf22020-10-01 12:49:44 +0200249#define LYS_RPC 0x0100 /**< RPC statement node */
250#define LYS_ACTION 0x0200 /**< action statement node */
251#define LYS_NOTIF 0x0400 /**< notification statement node */
Radek Krejcie7b95092019-05-15 11:03:07 +0200252
Michal Vasko7f45cf22020-10-01 12:49:44 +0200253#define LYS_USES 0x0800 /**< uses statement node */
254#define LYS_INPUT 0x1000 /**< RPC/action input node */
255#define LYS_OUTPUT 0x2000 /**< RPC/action output node */
256#define LYS_GROUPING 0x4000
257#define LYS_AUGMENT 0x8000
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100258
Radek Krejcif13b87b2020-12-01 22:02:17 +0100259#define LYS_NODETYPE_MASK 0xffff /**< Mask for nodetypes, the value is limited for 16 bits */
Radek Krejcide7a9c42021-03-10 13:13:06 +0100260/** @} schemanodetypes */
Radek Krejcif13b87b2020-12-01 22:02:17 +0100261
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200262/**
263 * @brief YANG import-stmt
264 */
265struct lysp_import {
Radek Krejci086c7132018-10-26 15:29:04 +0200266 struct lys_module *module; /**< pointer to the imported module
267 (mandatory, but resolved when the referring module is completely parsed) */
268 const char *name; /**< name of the imported module (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200269 const char *prefix; /**< prefix for the data from the imported schema (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200270 const char *dsc; /**< description */
271 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200272 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vasko3e9bc2f2020-11-04 17:13:56 +0100273 uint16_t flags; /**< LYS_INTERNAL value (@ref snodeflags) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200274 char rev[LY_REV_SIZE]; /**< revision-date of the imported module */
275};
276
277/**
278 * @brief YANG include-stmt
279 */
280struct lysp_include {
Radek Krejci0bcdaed2019-01-10 10:21:34 +0100281 struct lysp_submodule *submodule;/**< pointer to the parsed submodule structure
Radek Krejci086c7132018-10-26 15:29:04 +0200282 (mandatory, but resolved when the referring module is completely parsed) */
283 const char *name; /**< name of the included submodule (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200284 const char *dsc; /**< description */
285 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200286 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200287 char rev[LY_REV_SIZE]; /**< revision-date of the included submodule */
Radek Krejci771928a2021-01-19 13:42:36 +0100288 ly_bool injected; /**< flag to mark includes copied into main module from submodules,
289 only for backward compatibility with YANG 1.0, which does not require the
290 main module to include all submodules. */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200291};
292
293/**
294 * @brief YANG extension-stmt
295 */
296struct lysp_ext {
297 const char *name; /**< extension name */
Radek Krejci9f87b0c2021-03-05 14:45:26 +0100298 const char *argname; /**< argument name, NULL if not specified */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200299 const char *dsc; /**< description statement */
300 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200301 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcif56e2a42019-09-09 14:15:25 +0200302 uint16_t flags; /**< LYS_STATUS_* and LYS_YINELEM_* values (@ref snodeflags) */
Michal Vasko5fe75f12020-03-02 13:52:37 +0100303
Radek Krejci720d2612021-03-03 19:44:22 +0100304 struct lysc_ext *compiled; /**< pointer to the compiled extension definition.
305 The extension definition is compiled only if there is compiled extension instance,
306 otherwise this pointer remains NULL. The compiled extension definition is shared
307 among all extension instances. */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200308};
309
310/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200311 * @brief YANG feature-stmt
312 */
313struct lysp_feature {
314 const char *name; /**< feature name (mandatory) */
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100315 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
316 struct lysc_iffeature *iffeatures_c; /**< compiled if-features */
317 struct lysp_feature **depfeatures; /**< list of pointers to other features depending on this one
318 ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200319 const char *dsc; /**< description statement */
320 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200321 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100322 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values and
323 LYS_FENABLED are allowed */
324};
325
326/**
327 * @brief Compiled YANG if-feature-stmt
328 */
329struct lysc_iffeature {
330 uint8_t *expr; /**< 2bits array describing the if-feature expression in prefix format, see @ref ifftokens */
331 struct lysp_feature **features; /**< array of pointers to the features used in expression ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200332};
333
334/**
Michal Vasko7f45cf22020-10-01 12:49:44 +0200335 * @brief Qualified name (optional prefix followed by an identifier).
336 */
337struct lysp_qname {
338 const char *str; /**< qualified name string */
Michal Vasko5d24f6c2020-10-13 13:49:06 +0200339 const struct lysp_module *mod; /**< module to resolve any prefixes found in the string, it must be
Michal Vasko7f45cf22020-10-01 12:49:44 +0200340 stored explicitly because of deviations/refines */
Michal Vasko72c6d642024-02-27 14:59:01 +0100341 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_SINGLEQUOTED and
342 LYS_DOUBLEQUOTED values allowed */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200343};
344
345/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200346 * @brief YANG identity-stmt
347 */
348struct lysp_ident {
349 const char *name; /**< identity name (mandatory), including possible prefix */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200350 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200351 const char **bases; /**< list of base identifiers ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200352 const char *dsc; /**< description statement */
353 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200354 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200355 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_ values are allowed */
356};
357
Michal Vasko71e64ca2018-09-07 16:30:29 +0200358/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200359 * @brief Covers restrictions: range, length, pattern, must
360 */
361struct lysp_restr {
Radek Krejcif13b87b2020-12-01 22:02:17 +0100362#define LYSP_RESTR_PATTERN_ACK 0x06
363#define LYSP_RESTR_PATTERN_NACK 0x15
Michal Vasko7f45cf22020-10-01 12:49:44 +0200364 struct lysp_qname arg; /**< The restriction expression/value (mandatory);
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200365 in case of pattern restriction, the first byte has a special meaning:
366 0x06 (ACK) for regular match and 0x15 (NACK) for invert-match */
367 const char *emsg; /**< error-message */
368 const char *eapptag; /**< error-app-tag value */
369 const char *dsc; /**< description */
370 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200371 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200372};
373
374/**
Michal Vasko71e64ca2018-09-07 16:30:29 +0200375 * @brief YANG revision-stmt
376 */
377struct lysp_revision {
Radek Krejcicb3e6472021-01-06 08:19:01 +0100378 char date[LY_REV_SIZE]; /**< revision date (madatory) */
Michal Vasko71e64ca2018-09-07 16:30:29 +0200379 const char *dsc; /**< description statement */
380 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200381 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vasko71e64ca2018-09-07 16:30:29 +0200382};
383
384/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200385 * @brief Enumeration/Bit value definition
386 */
387struct lysp_type_enum {
388 const char *name; /**< name (mandatory) */
389 const char *dsc; /**< description statement */
390 const char *ref; /**< reference statement */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200391 int64_t value; /**< enum's value or bit's position */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200392 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200393 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200394 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_ and LYS_SET_VALUE
395 values are allowed */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200396};
397
398/**
399 * @brief YANG type-stmt
400 *
401 * Some of the items in the structure may be mandatory, but it is necessary to resolve the type's base type first
402 */
403struct lysp_type {
404 const char *name; /**< name of the type (mandatory) */
405 struct lysp_restr *range; /**< allowed values range - numerical, decimal64 */
406 struct lysp_restr *length; /**< allowed length of the value - string, binary */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200407 struct lysp_restr *patterns; /**< list of patterns ([sized array](@ref sizedarrays)) - string */
408 struct lysp_type_enum *enums; /**< list of enum-stmts ([sized array](@ref sizedarrays)) - enum */
409 struct lysp_type_enum *bits; /**< list of bit-stmts ([sized array](@ref sizedarrays)) - bits */
Michal Vasko004d3152020-06-11 19:59:22 +0200410 struct lyxp_expr *path; /**< parsed path - leafref */
Radek Krejci151a5b72018-10-19 14:21:44 +0200411 const char **bases; /**< list of base identifiers ([sized array](@ref sizedarrays)) - identityref */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200412 struct lysp_type *types; /**< list of sub-types ([sized array](@ref sizedarrays)) - union */
413 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200414
Michal Vasko5d24f6c2020-10-13 13:49:06 +0200415 const struct lysp_module *pmod; /**< (sub)module where the type is defined (needed for deviations) */
Michal Vasko00e8e652022-06-08 10:09:18 +0200416 struct lysc_type *compiled; /**< pointer to the compiled custom type, not used for built-in types */
Radek Krejci2167ee12018-11-02 16:09:07 +0100417
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200418 uint8_t fraction_digits; /**< number of fraction digits - decimal64 */
419 uint8_t require_instance; /**< require-instance flag - leafref, instance */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100420 uint16_t flags; /**< [schema node flags](@ref spnodeflags) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200421};
422
423/**
424 * @brief YANG typedef-stmt
425 */
426struct lysp_tpdf {
427 const char *name; /**< name of the newly defined type (mandatory) */
428 const char *units; /**< units of the newly defined type */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200429 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 +0200430 const char *dsc; /**< description statement */
431 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200432 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200433 struct lysp_type type; /**< base type from which the typedef is derived (mandatory) */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100434 uint16_t flags; /**< [schema node flags](@ref spnodeflags) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200435};
436
437/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200438 * @brief YANG when-stmt
439 */
440struct lysp_when {
441 const char *cond; /**< specified condition (mandatory) */
442 const char *dsc; /**< description statement */
443 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200444 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200445};
446
447/**
448 * @brief YANG refine-stmt
449 */
450struct lysp_refine {
451 const char *nodeid; /**< target descendant schema nodeid (mandatory) */
452 const char *dsc; /**< description statement */
453 const char *ref; /**< reference statement */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200454 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200455 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200456 const char *presence; /**< presence description */
Michal Vasko5d24f6c2020-10-13 13:49:06 +0200457 struct lysp_qname *dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200458 uint32_t min; /**< min-elements constraint */
459 uint32_t max; /**< max-elements constraint, 0 means unbounded */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200460 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200461 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
462};
463
464/**
Radek Krejci8678fa42020-08-18 16:07:28 +0200465 * @ingroup schematree
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200466 * @defgroup deviatetypes Deviate types
Radek Krejci8678fa42020-08-18 16:07:28 +0200467 *
468 * Type of the deviate operation (used as ::lysp_deviate.mod)
469 *
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200470 * @{
471 */
472#define LYS_DEV_NOT_SUPPORTED 1 /**< deviate type not-supported */
473#define LYS_DEV_ADD 2 /**< deviate type add */
474#define LYS_DEV_DELETE 3 /**< deviate type delete */
475#define LYS_DEV_REPLACE 4 /**< deviate type replace */
Radek Krejci2ff0d572020-05-21 15:27:28 +0200476/** @} deviatetypes */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200477
478/**
479 * @brief Generic deviate structure to get type and cast to lysp_deviate_* structure
480 */
481struct lysp_deviate {
482 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
483 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200484 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200485};
486
487struct lysp_deviate_add {
488 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
489 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200490 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200491 const char *units; /**< units of the values */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200492 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Michal Vasko5d24f6c2020-10-13 13:49:06 +0200493 struct lysp_qname *uniques; /**< list of uniques specifications ([sized array](@ref sizedarrays)) */
494 struct lysp_qname *dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200495 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
496 uint32_t min; /**< min-elements constraint */
497 uint32_t max; /**< max-elements constraint, 0 means unbounded */
498};
499
500struct lysp_deviate_del {
501 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
502 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200503 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200504 const char *units; /**< units of the values */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200505 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Michal Vasko5d24f6c2020-10-13 13:49:06 +0200506 struct lysp_qname *uniques; /**< list of uniques specifications ([sized array](@ref sizedarrays)) */
507 struct lysp_qname *dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200508};
509
510struct lysp_deviate_rpl {
511 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
512 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200513 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200514 struct lysp_type *type; /**< type of the node */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200515 const char *units; /**< units of the values */
Michal Vasko5d24f6c2020-10-13 13:49:06 +0200516 struct lysp_qname dflt; /**< default value */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200517 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
518 uint32_t min; /**< min-elements constraint */
519 uint32_t max; /**< max-elements constraint, 0 means unbounded */
520};
521
522struct lysp_deviation {
Michal Vaskob55f6c12018-09-12 11:13:15 +0200523 const char *nodeid; /**< target absolute schema nodeid (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200524 const char *dsc; /**< description statement */
525 const char *ref; /**< reference statement */
Michal Vasko22df3f02020-08-24 13:29:22 +0200526 struct lysp_deviate *deviates; /**< list of deviate specifications (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200527 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200528};
529
Radek Krejci4f28eda2018-11-12 11:46:16 +0100530/**
Radek Krejci4f28eda2018-11-12 11:46:16 +0100531 * @ingroup snodeflags
Radek Krejci8678fa42020-08-18 16:07:28 +0200532 * @defgroup spnodeflags Parsed schema nodes flags
Radek Krejci4f28eda2018-11-12 11:46:16 +0100533 *
Radek Krejci8678fa42020-08-18 16:07:28 +0200534 * Various flags for parsed schema nodes (used as ::lysp_node.flags).
Radek Krejci4f28eda2018-11-12 11:46:16 +0100535 *
536 * 1 - container 6 - anydata/anyxml 11 - output 16 - grouping 21 - enum
537 * 2 - choice 7 - case 12 - feature 17 - uses 22 - type
Radek Krejcid3ca0632019-04-16 16:54:54 +0200538 * 3 - leaf 8 - notification 13 - identity 18 - refine 23 - stmt
Michal Vaskoa0ba01e2022-10-19 13:26:57 +0200539 * 4 - leaflist 9 - rpc 14 - extension 19 - augment
Radek Krejci4f28eda2018-11-12 11:46:16 +0100540 * 5 - list 10 - input 15 - typedef 20 - deviate
541 *
Radek Krejcid3ca0632019-04-16 16:54:54 +0200542 * 1 1 1 1 1 1 1 1 1 1 2 2 2 2
543 * 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
Michal Vaskoa0ba01e2022-10-19 13:26:57 +0200544 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
545 * 1 LYS_CONFIG_W |x|x|x|x|x|x| | | | | | | | | | | |x| |x| | | |
546 * LYS_SET_BASE | | | | | | | | | | | | | | | | | | | | | |x| |
547 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
548 * 2 LYS_CONFIG_R |x|x|x|x|x|x| | | | | | | | | | | |x| |x| | | |
549 * LYS_SET_BIT | | | | | | | | | | | | | | | | | | | | | |x| |
550 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
551 * 3 LYS_STATUS_CURR |x|x|x|x|x|x|x|x|x| | |x|x|x|x|x|x| |x|x|x| | |
552 * LYS_SET_ENUM | | | | | | | | | | | | | | | | | | | | | |x| |
553 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
554 * 4 LYS_STATUS_DEPRC |x|x|x|x|x|x|x|x|x| | |x|x|x|x|x|x| |x|x|x| | |
555 * LYS_SET_FRDIGITS | | | | | | | | | | | | | | | | | | | | | |x| |
556 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
557 * 5 LYS_STATUS_OBSLT |x|x|x|x|x|x|x|x|x| | |x|x|x|x|x|x| |x|x|x| | |
558 * LYS_SET_LENGTH | | | | | | | | | | | | | | | | | | | | | |x| |
559 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
560 * 6 LYS_MAND_TRUE | |x|x| | |x| | | | | | | | | | | |x| |x| | | |
561 * LYS_SET_PATH | | | | | | | | | | | | | | | | | | | | | |x| |
562 * LYS_FENABLED | | | | | | | | | | | |x| | | | | | | | | | | |
563 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
564 * 7 LYS_MAND_FALSE | |x|x| | |x| | | | | | | | | | | |x| |x| | | |
565 * LYS_ORDBY_USER | | | |x|x| | | | | | | | | | | | | | | | | | |
566 * LYS_SET_PATTERN | | | | | | | | | | | | | | | | | | | | | |x| |
567 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
568 * 8 LYS_ORDBY_SYSTEM | | | |x|x| | | | | | | | | | | | | | | | | | |
569 * LYS_YINELEM_TRUE | | | | | | | | | | | | | |x| | | | | | | | | |
570 * LYS_SET_RANGE | | | | | | | | | | | | | | | | | | | | | |x| |
571 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
572 * 9 LYS_YINELEM_FALSE| | | | | | | | | | | | | |x| | | | | | | | | |
573 * LYS_SET_TYPE | | | | | | | | | | | | | | | | | | | | | |x| |
574 * LYS_SINGLEQUOTED | | | | | | | | | | | | | | | | | | | | | | |x|
575 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
576 * 10 LYS_SET_VALUE | | | | | | | | | | | | | | | | | | | | |x| | |
577 * LYS_SET_REQINST | | | | | | | | | | | | | | | | | | | | | |x| |
578 * LYS_SET_MIN | | | |x|x| | | | | | | | | | | | |x| |x| | | |
579 * LYS_DOUBLEQUOTED | | | | | | | | | | | | | | | | | | | | | | |x|
580 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
581 * 11 LYS_SET_MAX | | | |x|x| | | | | | | | | | | | |x| |x| | | |
582 * LYS_USED_GRP | | | | | | | | | | | | | | | |x| | | | | | | |
583 * LYS_YIN_ATTR | | | | | | | | | | | | | | | | | | | | | | |x|
584 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
585 * 12 LYS_YIN_ARGUMENT | | | | | | | | | | | | | | | | | | | | | | |x|
586 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
587 * 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|
588 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Radek Krejci4f28eda2018-11-12 11:46:16 +0100589 *
590 */
591
592/**
Radek Krejci4f28eda2018-11-12 11:46:16 +0100593 * @ingroup snodeflags
Radek Krejci8678fa42020-08-18 16:07:28 +0200594 * @defgroup scnodeflags Compiled schema nodes flags
Radek Krejci4f28eda2018-11-12 11:46:16 +0100595 *
Radek Krejci8678fa42020-08-18 16:07:28 +0200596 * Various flags for compiled schema nodes (used as ::lysc_node.flags).
Radek Krejci4f28eda2018-11-12 11:46:16 +0100597 *
Radek Krejci61e042e2019-09-10 15:53:09 +0200598 * 1 - container 6 - anydata/anyxml 11 - identity
599 * 2 - choice 7 - case 12 - extension
600 * 3 - leaf 8 - notification 13 - bitenum
Michal Vasko03ff5a72019-09-11 13:49:33 +0200601 * 4 - leaflist 9 - rpc/action 14 - when
Michal Vaskoecd62de2019-11-13 12:35:11 +0100602 * 5 - list 10 - feature
Radek Krejci4f28eda2018-11-12 11:46:16 +0100603 *
Michal Vaskoecd62de2019-11-13 12:35:11 +0100604 * 1 1 1 1 1
605 * bit name 1 2 3 4 5 6 7 8 9 0 1 2 3 4
606 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Michal Vaskod09b7622021-01-26 09:14:13 +0100607 * 1 LYS_CONFIG_W |x|x|x|x|x|x|x| | | | | | | |
Michal Vaskoecd62de2019-11-13 12:35:11 +0100608 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Michal Vaskod09b7622021-01-26 09:14:13 +0100609 * 2 LYS_CONFIG_R |x|x|x|x|x|x|x| | | | | | | |
Michal Vaskoecd62de2019-11-13 12:35:11 +0100610 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Michal Vaskof4fa90d2021-11-11 15:05:19 +0100611 * 3 LYS_STATUS_CURR |x|x|x|x|x|x|x|x|x|x|x|x|x|x|
Michal Vaskoecd62de2019-11-13 12:35:11 +0100612 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Michal Vaskof4fa90d2021-11-11 15:05:19 +0100613 * 4 LYS_STATUS_DEPRC |x|x|x|x|x|x|x|x|x|x|x|x|x|x|
Michal Vaskoecd62de2019-11-13 12:35:11 +0100614 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Michal Vaskof4fa90d2021-11-11 15:05:19 +0100615 * 5 LYS_STATUS_OBSLT |x|x|x|x|x|x|x|x|x|x|x|x|x|x|
Michal Vaskoecd62de2019-11-13 12:35:11 +0100616 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
617 * 6 LYS_MAND_TRUE |x|x|x|x|x|x| | | | | | | | |
618 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
619 * 7 LYS_ORDBY_USER | | | |x|x| | | | | | | | | |
620 * LYS_MAND_FALSE | |x|x| | |x| | | | | | | | |
621 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
622 * 8 LYS_ORDBY_SYSTEM | | | |x|x| | | | | | | | | |
623 * LYS_PRESENCE |x| | | | | | | | | | | | | |
624 * LYS_UNIQUE | | |x| | | | | | | | | | | |
625 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
626 * 9 LYS_KEY | | |x| | | | | | | | | | | |
Michal Vaskof4fa90d2021-11-11 15:05:19 +0100627 * LYS_DISABLED | | | | | | | | | | | | |x| |
Michal Vaskoecd62de2019-11-13 12:35:11 +0100628 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
629 * 10 LYS_SET_DFLT | | |x|x| | |x| | | | | | | |
Michal Vaskod1e53b92021-01-28 13:11:06 +0100630 * LYS_IS_ENUM | | | | | | | | | | | | |x| |
Michal Vaskoecd62de2019-11-13 12:35:11 +0100631 * LYS_KEYLESS | | | | |x| | | | | | | | | |
632 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
633 * 11 LYS_SET_UNITS | | |x|x| | | | | | | | | | |
634 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
635 * 12 LYS_SET_CONFIG |x|x|x|x|x|x| | | | | | | | |
Michal Vaskod1e53b92021-01-28 13:11:06 +0100636 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
637 * 13 LYS_IS_INPUT |x|x|x|x|x|x|x| | | | | | | |
638 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
639 * 14 LYS_IS_OUTPUT |x|x|x|x|x|x|x| | | | | | | |
640 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
641 * 15 LYS_IS_NOTIF |x|x|x|x|x|x|x| | | | | | | |
Michal Vaskoecd62de2019-11-13 12:35:11 +0100642 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Radek Krejci4f28eda2018-11-12 11:46:16 +0100643 *
644 */
645
646/**
647 * @defgroup snodeflags Schema nodes flags
Radek Krejci8678fa42020-08-18 16:07:28 +0200648 *
649 * Various flags for schema nodes ([parsed](@ref spnodeflags) as well as [compiled](@ref scnodeflags)).
650 *
Radek Krejci4f28eda2018-11-12 11:46:16 +0100651 * @{
652 */
Michal Vaskod1e53b92021-01-28 13:11:06 +0100653#define LYS_CONFIG_W 0x01 /**< config true; */
654#define LYS_CONFIG_R 0x02 /**< config false; */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200655#define LYS_CONFIG_MASK 0x03 /**< mask for config value */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100656#define LYS_STATUS_CURR 0x04 /**< status current; */
657#define LYS_STATUS_DEPRC 0x08 /**< status deprecated; */
658#define LYS_STATUS_OBSLT 0x10 /**< status obsolete; */
659#define LYS_STATUS_MASK 0x1C /**< mask for status value */
660#define LYS_MAND_TRUE 0x20 /**< mandatory true; applicable only to ::lysp_node_choice/::lysc_node_choice,
Radek Krejcife909632019-02-12 15:34:42 +0100661 ::lysp_node_leaf/::lysc_node_leaf and ::lysp_node_anydata/::lysc_node_anydata.
662 The ::lysc_node_leaflist and ::lysc_node_leaflist have this flag in case that min-elements > 0.
663 The ::lysc_node_container has this flag if it is not a presence container and it has at least one
664 child with LYS_MAND_TRUE. */
Radek Krejcif1421c22019-02-19 13:05:20 +0100665#define LYS_MAND_FALSE 0x40 /**< mandatory false; applicable only to ::lysp_node_choice/::lysc_node_choice,
666 ::lysp_node_leaf/::lysc_node_leaf and ::lysp_node_anydata/::lysc_node_anydata.
667 This flag is present only in case the mandatory false statement was explicitly specified. */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100668#define LYS_MAND_MASK 0x60 /**< mask for mandatory values */
Michal Vaskoc118ae22020-08-06 14:51:09 +0200669#define LYS_PRESENCE 0x80 /**< flag for presence property of a container, but it is not only for explicit presence
670 containers, but also for NP containers with some meaning, applicable only to
671 ::lysc_node_container */
Radek Krejci7adf4ff2018-12-05 08:55:00 +0100672#define LYS_UNIQUE 0x80 /**< flag for leafs being part of a unique set, applicable only to ::lysc_node_leaf */
Michal Vaskod1e53b92021-01-28 13:11:06 +0100673#define LYS_KEY 0x0100 /**< flag for leafs being a key of a list, applicable only to ::lysc_node_leaf */
674#define LYS_KEYLESS 0x0200 /**< flag for list without any key, applicable only to ::lysc_node_list */
Michal Vaskof4fa90d2021-11-11 15:05:19 +0100675#define LYS_DISABLED 0x0100 /**< internal flag for a disabled statement, used only for bits/enums */
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100676#define LYS_FENABLED 0x20 /**< feature enabled flag, applicable only to ::lysp_feature. */
Michal Vaskoe78faec2021-04-08 17:24:43 +0200677#define LYS_ORDBY_SYSTEM 0x80 /**< ordered-by system configuration lists, applicable only to
678 ::lysc_node_leaflist/::lysp_node_leaflist and ::lysc_node_list/::lysp_node_list */
679#define LYS_ORDBY_USER 0x40 /**< ordered-by user configuration lists, applicable only to
680 ::lysc_node_leaflist/::lysp_node_leaflist and ::lysc_node_list/::lysp_node_list;
681 is always set for state leaf-lists, and key-less lists */
aPiecek847cdcf2023-11-06 16:08:56 +0100682#define LYS_ORDBY_MASK 0xC0 /**< mask for ordered-by values */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100683#define LYS_YINELEM_TRUE 0x80 /**< yin-element true for extension's argument */
Michal Vaskod1e53b92021-01-28 13:11:06 +0100684#define LYS_YINELEM_FALSE 0x0100 /**< yin-element false for extension's argument */
685#define LYS_YINELEM_MASK 0x0180 /**< mask for yin-element value */
686#define LYS_USED_GRP 0x0400 /**< internal flag for validating not-instantiated groupings
Radek Krejcif2de0ed2019-05-02 14:13:18 +0200687 (resp. do not validate again the instantiated groupings). */
Michal Vaskod1e53b92021-01-28 13:11:06 +0100688#define LYS_SET_VALUE 0x0200 /**< value attribute is set */
689#define LYS_SET_MIN 0x0200 /**< min attribute is set */
690#define LYS_SET_MAX 0x0400 /**< max attribute is set */
Radek Krejcid505e3d2018-11-13 09:04:17 +0100691
692#define LYS_SET_BASE 0x0001 /**< type's flag for present base substatement */
693#define LYS_SET_BIT 0x0002 /**< type's flag for present bit substatement */
694#define LYS_SET_ENUM 0x0004 /**< type's flag for present enum substatement */
695#define LYS_SET_FRDIGITS 0x0008 /**< type's flag for present fraction-digits substatement */
696#define LYS_SET_LENGTH 0x0010 /**< type's flag for present length substatement */
697#define LYS_SET_PATH 0x0020 /**< type's flag for present path substatement */
698#define LYS_SET_PATTERN 0x0040 /**< type's flag for present pattern substatement */
699#define LYS_SET_RANGE 0x0080 /**< type's flag for present range substatement */
700#define LYS_SET_TYPE 0x0100 /**< type's flag for present type substatement */
701#define LYS_SET_REQINST 0x0200 /**< type's flag for present require-instance substatement */
Radek Krejciccd20f12019-02-15 14:12:27 +0100702#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 +0100703 cases of choice. This information is important for refines, since it is prohibited to make leafs
704 with default statement mandatory. In case the default leaf value is taken from type, it is thrown
Radek Krejciccd20f12019-02-15 14:12:27 +0100705 away when it is refined to be mandatory node. Similarly it is used for deviations to distinguish
706 between own default or the default values taken from the type. */
707#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 +0100708#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 +0100709
Michal Vasko72c6d642024-02-27 14:59:01 +0100710#define LYS_SINGLEQUOTED 0x0100 /**< flag for single-quoted string (argument of an extension instance's substatement),
711 only when the source is YANG */
712#define LYS_DOUBLEQUOTED 0x0200 /**< flag for double-quoted string (argument of an extension instance's substatement),
713 only when the source is YANG */
Radek Krejcid3ca0632019-04-16 16:54:54 +0200714
Michal Vaskod1e53b92021-01-28 13:11:06 +0100715#define LYS_YIN_ATTR 0x0400 /**< flag to identify YIN attribute parsed as extension's substatement, only when the source is YIN */
716#define LYS_YIN_ARGUMENT 0x0800 /**< flag to identify statement representing extension's argument, only when the source is YIN */
David Sedlákbbd06ca2019-06-27 14:15:38 +0200717
Michal Vasko3e9bc2f2020-11-04 17:13:56 +0100718#define LYS_INTERNAL 0x1000 /**< flag to identify internal parsed statements that should not be printed */
719
Michal Vaskod1e53b92021-01-28 13:11:06 +0100720#define LYS_IS_ENUM 0x0200 /**< flag to simply distinguish type in struct lysc_type_bitenum_item */
721
722#define LYS_IS_INPUT 0x1000 /**< flag for nodes that are in the subtree of an input statement */
723
724#define LYS_IS_OUTPUT 0x2000 /**< flag for nodes that are in the subtree of an output statement */
725
726#define LYS_IS_NOTIF 0x4000 /**< flag for nodes that are in the subtree of a notification statement */
Radek Krejci693262f2019-04-29 15:23:20 +0200727
Radek Krejcife909632019-02-12 15:34:42 +0100728#define LYS_FLAGS_COMPILED_MASK 0xff /**< mask for flags that maps to the compiled structures */
Radek Krejci2ff0d572020-05-21 15:27:28 +0200729/** @} snodeflags */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200730
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200731/**
732 * @brief Generic YANG data node
733 */
734struct lysp_node {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100735 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejcide7a9c42021-03-10 13:13:06 +0100736 uint16_t nodetype; /**< [type of the node](@ref schemanodetypes) (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200737 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100738 struct lysp_node *next; /**< next sibling node (NULL if there is no one) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200739 const char *name; /**< node name (mandatory) */
740 const char *dsc; /**< description statement */
741 const char *ref; /**< reference statement */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200742 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)),
743 must be qname because of refines */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200744 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200745};
746
747/**
748 * @brief Extension structure of the lysp_node for YANG container
749 */
750struct lysp_node_container {
Radek Krejci2a9fc652021-01-22 17:44:34 +0100751 union {
752 struct lysp_node node; /**< implicit cast for the members compatible with ::lysp_node */
Michal Vasko26bbb272022-08-02 14:54:33 +0200753
Radek Krejci2a9fc652021-01-22 17:44:34 +0100754 struct {
755 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
756 uint16_t nodetype; /**< LYS_CONTAINER */
757 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
758 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
759 const char *name; /**< node name (mandatory) */
760 const char *dsc; /**< description statement */
761 const char *ref; /**< reference statement */
Radek Krejci2a9fc652021-01-22 17:44:34 +0100762 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
763 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
764 };
765 }; /**< common part corresponding to ::lysp_node */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200766
767 /* container */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200768 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci9a3823e2021-01-27 20:26:46 +0100769 struct lysp_when *when; /**< when statement */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200770 const char *presence; /**< presence description */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200771 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
Radek Krejci2a9fc652021-01-22 17:44:34 +0100772 struct lysp_node_grp *groupings; /**< list of groupings (linked list) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200773 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejci2a9fc652021-01-22 17:44:34 +0100774 struct lysp_node_action *actions;/**< list of actions (linked list) */
775 struct lysp_node_notif *notifs; /**< list of notifications (linked list) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200776};
777
778struct lysp_node_leaf {
Radek Krejci2a9fc652021-01-22 17:44:34 +0100779 union {
780 struct lysp_node node; /**< implicit cast for the members compatible with ::lysp_node */
Michal Vasko26bbb272022-08-02 14:54:33 +0200781
Radek Krejci2a9fc652021-01-22 17:44:34 +0100782 struct {
783 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
784 uint16_t nodetype; /**< LYS_LEAF */
785 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
786 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
787 const char *name; /**< node name (mandatory) */
788 const char *dsc; /**< description statement */
789 const char *ref; /**< reference statement */
Radek Krejci2a9fc652021-01-22 17:44:34 +0100790 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
791 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
792 };
793 }; /**< common part corresponding to ::lysp_node */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200794
795 /* leaf */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200796 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci9a3823e2021-01-27 20:26:46 +0100797 struct lysp_when *when; /**< when statement */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200798 struct lysp_type type; /**< type of the leaf node (mandatory) */
799 const char *units; /**< units of the leaf's type */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200800 struct lysp_qname dflt; /**< default value, it may or may not be a qualified name */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200801};
802
803struct lysp_node_leaflist {
Radek Krejci2a9fc652021-01-22 17:44:34 +0100804 union {
805 struct lysp_node node; /**< implicit cast for the members compatible with ::lysp_node */
Michal Vasko26bbb272022-08-02 14:54:33 +0200806
Radek Krejci2a9fc652021-01-22 17:44:34 +0100807 struct {
808 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
809 uint16_t nodetype; /**< LYS_LEAFLIST */
810 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
811 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
812 const char *name; /**< node name (mandatory) */
813 const char *dsc; /**< description statement */
814 const char *ref; /**< reference statement */
Radek Krejci2a9fc652021-01-22 17:44:34 +0100815 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
816 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
817 };
818 }; /**< common part corresponding to ::lysp_node */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200819
820 /* leaf-list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200821 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci9a3823e2021-01-27 20:26:46 +0100822 struct lysp_when *when; /**< when statement */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200823 struct lysp_type type; /**< type of the leaf node (mandatory) */
824 const char *units; /**< units of the leaf's type */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200825 struct lysp_qname *dflts; /**< list of default values ([sized array](@ref sizedarrays)), they may or
826 may not be qualified names */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200827 uint32_t min; /**< min-elements constraint */
828 uint32_t max; /**< max-elements constraint, 0 means unbounded */
829};
830
831struct lysp_node_list {
Radek Krejci2a9fc652021-01-22 17:44:34 +0100832 union {
833 struct lysp_node node; /**< implicit cast for the members compatible with ::lysp_node */
Michal Vasko26bbb272022-08-02 14:54:33 +0200834
Radek Krejci2a9fc652021-01-22 17:44:34 +0100835 struct {
836 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
837 uint16_t nodetype; /**< LYS_LIST */
838 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
839 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
840 const char *name; /**< node name (mandatory) */
841 const char *dsc; /**< description statement */
842 const char *ref; /**< reference statement */
Radek Krejci2a9fc652021-01-22 17:44:34 +0100843 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
844 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
845 };
846 }; /**< common part corresponding to ::lysp_node */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200847
848 /* list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200849 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci9a3823e2021-01-27 20:26:46 +0100850 struct lysp_when *when; /**< when statement */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200851 const char *key; /**< keys specification */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200852 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
Radek Krejci2a9fc652021-01-22 17:44:34 +0100853 struct lysp_node_grp *groupings; /**< list of groupings (linked list) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200854 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejci2a9fc652021-01-22 17:44:34 +0100855 struct lysp_node_action *actions;/**< list of actions (linked list) */
856 struct lysp_node_notif *notifs; /**< list of notifications (linked list) */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200857 struct lysp_qname *uniques; /**< list of unique specifications ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200858 uint32_t min; /**< min-elements constraint */
859 uint32_t max; /**< max-elements constraint, 0 means unbounded */
860};
861
862struct lysp_node_choice {
Radek Krejci2a9fc652021-01-22 17:44:34 +0100863 union {
864 struct lysp_node node; /**< implicit cast for the members compatible with ::lysp_node */
Michal Vasko26bbb272022-08-02 14:54:33 +0200865
Radek Krejci2a9fc652021-01-22 17:44:34 +0100866 struct {
867 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
868 uint16_t nodetype; /**< LYS_CHOICE */
869 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
870 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
871 const char *name; /**< node name (mandatory) */
872 const char *dsc; /**< description statement */
873 const char *ref; /**< reference statement */
Radek Krejci2a9fc652021-01-22 17:44:34 +0100874 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
875 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
876 };
877 }; /**< common part corresponding to ::lysp_node */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200878
879 /* choice */
880 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejci9a3823e2021-01-27 20:26:46 +0100881 struct lysp_when *when; /**< when statement */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200882 struct lysp_qname dflt; /**< default case */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200883};
884
885struct lysp_node_case {
Radek Krejci2a9fc652021-01-22 17:44:34 +0100886 union {
887 struct lysp_node node; /**< implicit cast for the members compatible with ::lysp_node */
Michal Vasko26bbb272022-08-02 14:54:33 +0200888
Radek Krejci2a9fc652021-01-22 17:44:34 +0100889 struct {
890 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
891 uint16_t nodetype; /**< LYS_CASE */
892 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
893 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
894 const char *name; /**< node name (mandatory) */
895 const char *dsc; /**< description statement */
896 const char *ref; /**< reference statement */
Radek Krejci2a9fc652021-01-22 17:44:34 +0100897 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
898 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
899 };
900 }; /**< common part corresponding to ::lysp_node */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200901
902 /* case */
903 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejci9a3823e2021-01-27 20:26:46 +0100904 struct lysp_when *when; /**< when statement */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200905};
906
907struct lysp_node_anydata {
Radek Krejci2a9fc652021-01-22 17:44:34 +0100908 union {
909 struct lysp_node node; /**< implicit cast for the members compatible with ::lysp_node */
Michal Vasko26bbb272022-08-02 14:54:33 +0200910
Radek Krejci2a9fc652021-01-22 17:44:34 +0100911 struct {
912 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
913 uint16_t nodetype; /**< LYS_ANYXML or LYS_ANYDATA */
914 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
915 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
916 const char *name; /**< node name (mandatory) */
917 const char *dsc; /**< description statement */
918 const char *ref; /**< reference statement */
Radek Krejci2a9fc652021-01-22 17:44:34 +0100919 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
920 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
921 };
922 }; /**< common part corresponding to ::lysp_node */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200923
924 /* anyxml/anydata */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200925 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci9a3823e2021-01-27 20:26:46 +0100926 struct lysp_when *when; /**< when statement */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200927};
928
929struct lysp_node_uses {
Radek Krejci2a9fc652021-01-22 17:44:34 +0100930 union {
931 struct lysp_node node; /**< implicit cast for the members compatible with ::lysp_node */
Michal Vasko26bbb272022-08-02 14:54:33 +0200932
Radek Krejci2a9fc652021-01-22 17:44:34 +0100933 struct {
934 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
935 uint16_t nodetype; /**< LYS_USES */
936 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
937 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
938 const char *name; /**< grouping name reference (mandatory) */
939 const char *dsc; /**< description statement */
940 const char *ref; /**< reference statement */
Radek Krejci2a9fc652021-01-22 17:44:34 +0100941 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
942 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
943 };
944 }; /**< common part corresponding to ::lysp_node */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200945
946 /* uses */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200947 struct lysp_refine *refines; /**< list of uses's refines ([sized array](@ref sizedarrays)) */
Radek Krejci2a9fc652021-01-22 17:44:34 +0100948 struct lysp_node_augment *augments; /**< list of augments (linked list) */
Radek Krejci9a3823e2021-01-27 20:26:46 +0100949 struct lysp_when *when; /**< when statement */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200950};
951
952/**
953 * @brief YANG input-stmt and output-stmt
954 */
Radek Krejci2a9fc652021-01-22 17:44:34 +0100955struct lysp_node_action_inout {
956 union {
957 struct lysp_node node; /**< implicit cast for the members compatible with ::lysp_node */
Michal Vasko26bbb272022-08-02 14:54:33 +0200958
Radek Krejci2a9fc652021-01-22 17:44:34 +0100959 struct {
960 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
961 uint16_t nodetype; /**< LYS_INPUT or LYS_OUTPUT */
962 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
963 struct lysp_node *next; /**< NULL */
964 const char *name; /**< empty string */
965 const char *dsc; /**< ALWAYS NULL, compatibility member with ::lysp_node */
966 const char *ref; /**< ALWAYS NULL, compatibility member with ::lysp_node */
Radek Krejci2a9fc652021-01-22 17:44:34 +0100967 struct lysp_qname *iffeatures; /**< ALWAYS NULL, compatibility member with ::lysp_node */
968 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
969 };
970 }; /**< common part corresponding to ::lysp_node */
971
972 /* inout */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200973 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
974 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
Radek Krejci2a9fc652021-01-22 17:44:34 +0100975 struct lysp_node_grp *groupings; /**< list of groupings (linked list) */
Radek Krejci01180ac2021-01-27 08:48:22 +0100976 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200977};
978
979/**
980 * @brief YANG rpc-stmt and action-stmt
981 */
Radek Krejci2a9fc652021-01-22 17:44:34 +0100982struct lysp_node_action {
983 union {
984 struct lysp_node node; /**< implicit cast for the members compatible with ::lysp_node */
Michal Vasko26bbb272022-08-02 14:54:33 +0200985
Radek Krejci2a9fc652021-01-22 17:44:34 +0100986 struct {
987 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
988 uint16_t nodetype; /**< LYS_RPC or LYS_ACTION */
989 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
990 struct lysp_node_action *next; /**< pointer to the next action (NULL if there is no one) */
991 const char *name; /**< grouping name reference (mandatory) */
992 const char *dsc; /**< description statement */
993 const char *ref; /**< reference statement */
Radek Krejci2a9fc652021-01-22 17:44:34 +0100994 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
995 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
996 };
997 }; /**< common part corresponding to ::lysp_node */
Michal Vasko7f45cf22020-10-01 12:49:44 +0200998
999 /* action */
Radek Krejci2a9fc652021-01-22 17:44:34 +01001000 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
1001 struct lysp_node_grp *groupings; /**< list of groupings (linked list) */
1002
1003 struct lysp_node_action_inout input; /**< RPC's/Action's input */
1004 struct lysp_node_action_inout output; /**< RPC's/Action's output */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001005};
1006
1007/**
1008 * @brief YANG notification-stmt
1009 */
Radek Krejci2a9fc652021-01-22 17:44:34 +01001010struct lysp_node_notif {
1011 union {
1012 struct lysp_node node; /**< implicit cast for the members compatible with ::lysp_node */
Michal Vasko26bbb272022-08-02 14:54:33 +02001013
Radek Krejci2a9fc652021-01-22 17:44:34 +01001014 struct {
1015 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
1016 uint16_t nodetype; /**< LYS_NOTIF */
1017 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values are allowed */
1018 struct lysp_node_notif *next; /**< pointer to the next notification (NULL if there is no one) */
1019 const char *name; /**< grouping name reference (mandatory) */
1020 const char *dsc; /**< description statement */
1021 const char *ref; /**< reference statement */
Radek Krejci2a9fc652021-01-22 17:44:34 +01001022 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1023 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1024 };
1025 }; /**< common part corresponding to ::lysp_node */
Michal Vasko7f45cf22020-10-01 12:49:44 +02001026
1027 /* notif */
1028 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci2a9fc652021-01-22 17:44:34 +01001029 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
1030 struct lysp_node_grp *groupings; /**< list of groupings (linked list) */
Radek Krejci01180ac2021-01-27 08:48:22 +01001031 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001032};
1033
1034/**
Radek Krejci2a9fc652021-01-22 17:44:34 +01001035 * @brief YANG grouping-stmt
1036 */
1037struct lysp_node_grp {
1038 union {
1039 struct lysp_node node; /**< implicit cast for the members compatible with ::lysp_node */
Michal Vasko26bbb272022-08-02 14:54:33 +02001040
Radek Krejci2a9fc652021-01-22 17:44:34 +01001041 struct {
1042 struct lysp_node *parent;/**< parent node (NULL if this is a top-level grouping) */
1043 uint16_t nodetype; /**< LYS_GROUPING */
1044 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values are allowed */
1045 struct lysp_node_grp *next; /**< pointer to the next grouping (NULL if there is no one) */
1046 const char *name; /**< grouping name (mandatory) */
1047 const char *dsc; /**< description statement */
1048 const char *ref; /**< reference statement */
Radek Krejci2a9fc652021-01-22 17:44:34 +01001049 struct lysp_qname *iffeatures; /**< ALWAYS NULL, compatibility member with ::lysp_node */
1050 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1051 };
1052 }; /**< common part corresponding to ::lysp_node */
1053
1054 /* grp */
1055 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
1056 struct lysp_node_grp *groupings; /**< list of groupings (linked list) */
Radek Krejci01180ac2021-01-27 08:48:22 +01001057 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejci2a9fc652021-01-22 17:44:34 +01001058 struct lysp_node_action *actions; /**< list of actions (linked list) */
1059 struct lysp_node_notif *notifs; /**< list of notifications (linked list) */
1060};
1061
1062/**
1063 * @brief YANG uses-augment-stmt and augment-stmt (compatible with struct lysp_node )
1064 */
1065struct lysp_node_augment {
1066 union {
1067 struct lysp_node node; /**< implicit cast for the members compatible with ::lysp_node */
Michal Vasko26bbb272022-08-02 14:54:33 +02001068
Radek Krejci2a9fc652021-01-22 17:44:34 +01001069 struct {
1070 struct lysp_node *parent;/**< parent node (NULL if this is a top-level augment) */
1071 uint16_t nodetype; /**< LYS_AUGMENT */
1072 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values are allowed */
1073 struct lysp_node_augment *next; /**< pointer to the next augment (NULL if there is no one) */
1074 const char *nodeid; /**< target schema nodeid (mandatory) - absolute for global augments, descendant for uses's augments */
1075 const char *dsc; /**< description statement */
1076 const char *ref; /**< reference statement */
Radek Krejci2a9fc652021-01-22 17:44:34 +01001077 struct lysp_qname *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1078 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1079 };
1080 }; /**< common part corresponding to ::lysp_node */
1081
1082 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejci9a3823e2021-01-27 20:26:46 +01001083 struct lysp_when *when; /**< when statement */
Radek Krejci2a9fc652021-01-22 17:44:34 +01001084 struct lysp_node_action *actions;/**< list of actions (linked list) */
1085 struct lysp_node_notif *notifs; /**< list of notifications (linked list) */
1086};
1087
1088/**
Radek Krejcif0fceb62018-09-05 14:58:45 +02001089 * @brief supported YANG schema version values
1090 */
1091typedef enum LYS_VERSION {
1092 LYS_VERSION_UNDEF = 0, /**< no specific version, YANG 1.0 as default */
Radek Krejci96e48da2020-09-04 13:18:06 +02001093 LYS_VERSION_1_0 = 1, /**< YANG 1 (1.0) */
Radek Krejcif0fceb62018-09-05 14:58:45 +02001094 LYS_VERSION_1_1 = 2 /**< YANG 1.1 */
1095} LYS_VERSION;
1096
1097/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001098 * @brief Printable YANG schema tree structure representing YANG module.
1099 *
1100 * Simple structure corresponding to the YANG format. The schema is only syntactically validated.
1101 */
1102struct lysp_module {
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001103 struct lys_module *mod; /**< covering module structure */
1104
Radek Krejcib7db73a2018-10-24 14:18:40 +02001105 struct lysp_revision *revs; /**< list of the module revisions ([sized array](@ref sizedarrays)), the first revision
1106 in the list is always the last (newest) revision of the module */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001107 struct lysp_import *imports; /**< list of imported modules ([sized array](@ref sizedarrays)) */
1108 struct lysp_include *includes; /**< list of included submodules ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001109 struct lysp_ext *extensions; /**< list of extension statements ([sized array](@ref sizedarrays)) */
1110 struct lysp_feature *features; /**< list of feature definitions ([sized array](@ref sizedarrays)) */
1111 struct lysp_ident *identities; /**< list of identities ([sized array](@ref sizedarrays)) */
1112 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
Radek Krejci2a9fc652021-01-22 17:44:34 +01001113 struct lysp_node_grp *groupings; /**< list of groupings (linked list) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001114 struct lysp_node *data; /**< list of module's top-level data nodes (linked list) */
Radek Krejci2a9fc652021-01-22 17:44:34 +01001115 struct lysp_node_augment *augments; /**< list of augments (linked list) */
1116 struct lysp_node_action *rpcs; /**< list of RPCs (linked list) */
1117 struct lysp_node_notif *notifs; /**< list of notifications (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001118 struct lysp_deviation *deviations; /**< list of deviations ([sized array](@ref sizedarrays)) */
Michal Vaskoc3781c32020-10-06 14:04:08 +02001119 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001120
Michal Vasko5d24f6c2020-10-13 13:49:06 +02001121 uint8_t version; /**< yang-version (LYS_VERSION values) */
Michal Vaskoc3781c32020-10-06 14:04:08 +02001122 uint8_t parsing : 1; /**< flag for circular check */
1123 uint8_t is_submod : 1; /**< always 0 */
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001124};
1125
1126struct lysp_submodule {
Michal Vaskoc3781c32020-10-06 14:04:08 +02001127 struct lys_module *mod; /**< belongs to parent module (submodule - mandatory) */
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001128
1129 struct lysp_revision *revs; /**< list of the module revisions ([sized array](@ref sizedarrays)), the first revision
1130 in the list is always the last (newest) revision of the module */
1131 struct lysp_import *imports; /**< list of imported modules ([sized array](@ref sizedarrays)) */
1132 struct lysp_include *includes; /**< list of included submodules ([sized array](@ref sizedarrays)) */
1133 struct lysp_ext *extensions; /**< list of extension statements ([sized array](@ref sizedarrays)) */
1134 struct lysp_feature *features; /**< list of feature definitions ([sized array](@ref sizedarrays)) */
1135 struct lysp_ident *identities; /**< list of identities ([sized array](@ref sizedarrays)) */
1136 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
Radek Krejci2a9fc652021-01-22 17:44:34 +01001137 struct lysp_node_grp *groupings; /**< list of groupings (linked list) */
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001138 struct lysp_node *data; /**< list of module's top-level data nodes (linked list) */
Radek Krejci2a9fc652021-01-22 17:44:34 +01001139 struct lysp_node_augment *augments; /**< list of augments (linked list) */
1140 struct lysp_node_action *rpcs; /**< list of RPCs (linked list) */
1141 struct lysp_node_notif *notifs; /**< list of notifications (linked list) */
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001142 struct lysp_deviation *deviations; /**< list of deviations ([sized array](@ref sizedarrays)) */
Michal Vaskoc3781c32020-10-06 14:04:08 +02001143 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001144
Michal Vasko5d24f6c2020-10-13 13:49:06 +02001145 uint8_t version; /**< yang-version (LYS_VERSION values) */
Michal Vaskoc3781c32020-10-06 14:04:08 +02001146 uint8_t parsing : 1; /**< flag for circular check */
1147 uint8_t is_submod : 1; /**< always 1 */
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001148
Michal Vaskoc3781c32020-10-06 14:04:08 +02001149 uint8_t latest_revision : 2; /**< flag to mark the latest available revision:
Radek Krejci086c7132018-10-26 15:29:04 +02001150 1 - the latest revision in searchdirs was not searched yet and this is the
1151 latest revision in the current context
1152 2 - searchdirs were searched and this is the latest available revision */
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001153 const char *name; /**< name of the module (mandatory) */
1154 const char *filepath; /**< path, if the schema was read from a file, NULL in case of reading from memory */
1155 const char *prefix; /**< submodule belongsto prefix of main module (mandatory) */
1156 const char *org; /**< party/company responsible for the module */
1157 const char *contact; /**< contact information for the module */
1158 const char *dsc; /**< description of the module */
1159 const char *ref; /**< cross-reference for the module */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001160};
1161
1162/**
Michal Vasko5d24f6c2020-10-13 13:49:06 +02001163 * @brief Get the parsed module or submodule name.
1164 *
1165 * @param[in] PMOD Parsed module or submodule.
1166 * @return Module or submodule name.
1167 */
1168#define LYSP_MODULE_NAME(PMOD) (PMOD->is_submod ? ((struct lysp_submodule *)PMOD)->name : ((struct lysp_module *)PMOD)->mod->name)
1169
1170/**
Radek Krejci8df109d2021-04-23 12:19:08 +02001171 * @brief Compiled prefix data pair mapping of prefixes to modules. In case the format is ::LY_VALUE_SCHEMA_RESOLVED,
Michal Vasko5d24f6c2020-10-13 13:49:06 +02001172 * the expected prefix data is a sized array of these structures.
1173 */
1174struct lysc_prefix {
1175 char *prefix; /**< used prefix */
1176 const struct lys_module *mod; /**< mapping to a module */
1177};
1178
1179/**
Radek Krejci0e59c312019-08-15 15:34:15 +02001180 * @brief Compiled YANG extension-stmt
Radek Krejci9f87b0c2021-03-05 14:45:26 +01001181 *
1182 * Note that the compiled extension definition is created only in case the extension is instantiated. It is not available
1183 * from the compiled schema, but from the parsed extension definition which is being searched when an extension instance
1184 * is being compiled.
Radek Krejci0e59c312019-08-15 15:34:15 +02001185 */
1186struct lysc_ext {
1187 const char *name; /**< extension name */
Radek Krejci9f87b0c2021-03-05 14:45:26 +01001188 const char *argname; /**< argument name, NULL if not specified */
Radek Krejci0e59c312019-08-15 15:34:15 +02001189 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcicc9e30f2021-03-29 12:45:08 +02001190 struct lyplg_ext *plugin; /**< Plugin implementing the specific extension */
Radek Krejci0935f412019-08-20 16:15:18 +02001191 struct lys_module *module; /**< module structure */
Radek Krejci0e59c312019-08-15 15:34:15 +02001192 uint16_t flags; /**< LYS_STATUS_* value (@ref snodeflags) */
1193};
1194
1195/**
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001196 * @brief YANG when-stmt
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001197 */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001198struct lysc_when {
1199 struct lyxp_expr *cond; /**< XPath when condition */
Michal Vasko175012e2019-11-06 15:49:14 +01001200 struct lysc_node *context; /**< context node for evaluating the expression, NULL if the context is root node */
Michal Vasko5d24f6c2020-10-13 13:49:06 +02001201 struct lysc_prefix *prefixes; /**< compiled used prefixes in the condition */
Radek Krejcic8b31002019-01-08 10:24:45 +01001202 const char *dsc; /**< description */
1203 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001204 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci00b874b2019-02-12 10:54:50 +01001205 uint32_t refcount; /**< reference counter since some of the when statements are shared among several nodes */
Michal Vaskoecd62de2019-11-13 12:35:11 +01001206 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS is allowed */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001207};
1208
1209/**
Radek Krejci2a408df2018-10-29 16:32:26 +01001210 * @brief YANG identity-stmt
1211 */
1212struct lysc_ident {
Michal Vaskoe313c382022-03-14 13:04:47 +01001213 const char *name; /**< identity name (mandatory, no prefix) */
Radek Krejcic8b31002019-01-08 10:24:45 +01001214 const char *dsc; /**< description */
1215 const char *ref; /**< reference */
Radek Krejci693262f2019-04-29 15:23:20 +02001216 struct lys_module *module; /**< module structure */
aPiecek6b3d5422021-07-30 15:55:43 +02001217 struct lysc_ident **derived; /**< list of (pointers to the) derived identities ([sized array](@ref sizedarrays))
1218 It also contains references to identities located in unimplemented modules. */
Radek Krejci2a408df2018-10-29 16:32:26 +01001219 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1220 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_ values are allowed */
1221};
1222
1223/**
Radek Krejci151a5b72018-10-19 14:21:44 +02001224 * @defgroup ifftokens if-feature expression tokens
Radek Krejci8678fa42020-08-18 16:07:28 +02001225 * Tokens of if-feature expression used in ::lysc_iffeature.expr.
Radek Krejci151a5b72018-10-19 14:21:44 +02001226 *
1227 * @{
1228 */
1229#define LYS_IFF_NOT 0x00 /**< operand "not" */
1230#define LYS_IFF_AND 0x01 /**< operand "and" */
1231#define LYS_IFF_OR 0x02 /**< operand "or" */
1232#define LYS_IFF_F 0x03 /**< feature */
Radek Krejci2ff0d572020-05-21 15:27:28 +02001233/** @} ifftokens */
Radek Krejci151a5b72018-10-19 14:21:44 +02001234
1235/**
Radek Krejcib7db73a2018-10-24 14:18:40 +02001236 * @brief Compiled YANG revision statement
1237 */
1238struct lysc_revision {
1239 char date[LY_REV_SIZE]; /**< revision-date (mandatory) */
1240 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1241};
1242
Radek Krejci2167ee12018-11-02 16:09:07 +01001243struct lysc_range {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001244 struct lysc_range_part {
Radek Krejci693262f2019-04-29 15:23:20 +02001245 union { /**< min boundary */
Radek Krejcie7b95092019-05-15 11:03:07 +02001246 int64_t min_64; /**< for int8, int16, int32, int64 and decimal64 ( >= LY_TYPE_DEC64) */
1247 uint64_t min_u64; /**< for uint8, uint16, uint32, uint64, string and binary ( < LY_TYPE_DEC64) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001248 };
Radek Krejci693262f2019-04-29 15:23:20 +02001249 union { /**< max boundary */
Radek Krejcie7b95092019-05-15 11:03:07 +02001250 int64_t max_64; /**< for int8, int16, int32, int64 and decimal64 ( >= LY_TYPE_DEC64) */
1251 uint64_t max_u64; /**< for uint8, uint16, uint32, uint64, string and binary ( < LY_TYPE_DEC64) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001252 };
Radek Krejci4f28eda2018-11-12 11:46:16 +01001253 } *parts; /**< compiled range expression ([sized array](@ref sizedarrays)) */
Radek Krejcic8b31002019-01-08 10:24:45 +01001254 const char *dsc; /**< description */
1255 const char *ref; /**< reference */
Radek Krejci2167ee12018-11-02 16:09:07 +01001256 const char *emsg; /**< error-message */
1257 const char *eapptag; /**< error-app-tag value */
1258 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1259};
1260
1261struct lysc_pattern {
Radek Krejci54579462019-04-30 12:47:06 +02001262 const char *expr; /**< original, not compiled, regular expression */
1263 pcre2_code *code; /**< compiled regular expression */
Radek Krejcic8b31002019-01-08 10:24:45 +01001264 const char *dsc; /**< description */
1265 const char *ref; /**< reference */
Radek Krejci2167ee12018-11-02 16:09:07 +01001266 const char *emsg; /**< error-message */
1267 const char *eapptag; /**< error-app-tag value */
1268 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci0f969882020-08-21 16:56:47 +02001269 uint32_t inverted : 1; /**< invert-match flag */
1270 uint32_t refcount : 31; /**< reference counter */
Radek Krejci2167ee12018-11-02 16:09:07 +01001271};
1272
1273struct lysc_must {
Radek Krejci2167ee12018-11-02 16:09:07 +01001274 struct lyxp_expr *cond; /**< XPath when condition */
Michal Vasko5d24f6c2020-10-13 13:49:06 +02001275 struct lysc_prefix *prefixes; /**< compiled used prefixes in the condition */
Radek Krejcic8b31002019-01-08 10:24:45 +01001276 const char *dsc; /**< description */
1277 const char *ref; /**< reference */
Radek Krejci2167ee12018-11-02 16:09:07 +01001278 const char *emsg; /**< error-message */
1279 const char *eapptag; /**< error-app-tag value */
1280 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1281};
1282
1283struct lysc_type {
Michal Vaskof309c482024-01-22 12:07:00 +01001284 const char *name; /**< referenced typedef name (without prefix, if any), NULL for built-in types */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001285 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskof309c482024-01-22 12:07:00 +01001286 struct lyplg_type *plugin; /**< type's manipulation callbacks plugin */
1287 LY_DATA_TYPE basetype; /**< base type of the type */
Michal Vasko080064b2021-08-31 15:20:44 +02001288 uint32_t refcount; /**< reference counter for type sharing, it may be accessed concurrently when
Michal Vaskobabf0bd2021-08-31 14:55:39 +02001289 creating/freeing data node values that reference it (instance-identifier) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001290};
1291
1292struct lysc_type_num {
Michal Vaskof309c482024-01-22 12:07:00 +01001293 const char *name; /**< referenced typedef name (without prefix, if any), NULL for built-in types */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001294 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskof309c482024-01-22 12:07:00 +01001295 struct lyplg_type *plugin; /**< type's manipulation callbacks plugin */
1296 LY_DATA_TYPE basetype; /**< base type of the type */
Michal Vasko080064b2021-08-31 15:20:44 +02001297 uint32_t refcount; /**< reference counter for type sharing */
Michal Vaskof309c482024-01-22 12:07:00 +01001298
Radek Krejci2167ee12018-11-02 16:09:07 +01001299 struct lysc_range *range; /**< Optional range limitation */
1300};
1301
1302struct lysc_type_dec {
Michal Vaskof309c482024-01-22 12:07:00 +01001303 const char *name; /**< referenced typedef name (without prefix, if any), NULL for built-in types */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001304 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskof309c482024-01-22 12:07:00 +01001305 struct lyplg_type *plugin; /**< type's manipulation callbacks plugin */
1306 LY_DATA_TYPE basetype; /**< base type of the type */
Michal Vasko080064b2021-08-31 15:20:44 +02001307 uint32_t refcount; /**< reference counter for type sharing */
Michal Vaskof309c482024-01-22 12:07:00 +01001308
Radek Krejci6cba4292018-11-15 17:33:29 +01001309 uint8_t fraction_digits; /**< fraction digits specification */
Radek Krejci2167ee12018-11-02 16:09:07 +01001310 struct lysc_range *range; /**< Optional range limitation */
1311};
1312
1313struct lysc_type_str {
Michal Vaskof309c482024-01-22 12:07:00 +01001314 const char *name; /**< referenced typedef name (without prefix, if any), NULL for built-in types */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001315 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskof309c482024-01-22 12:07:00 +01001316 struct lyplg_type *plugin; /**< type's manipulation callbacks plugin */
1317 LY_DATA_TYPE basetype; /**< base type of the type */
Michal Vasko080064b2021-08-31 15:20:44 +02001318 uint32_t refcount; /**< reference counter for type sharing */
Michal Vaskof309c482024-01-22 12:07:00 +01001319
1320 struct lysc_range *length; /**< optional length limitation */
1321 struct lysc_pattern **patterns; /**< optional list of pointers to pattern limitations ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001322};
1323
Radek Krejci693262f2019-04-29 15:23:20 +02001324struct lysc_type_bitenum_item {
1325 const char *name; /**< enumeration identifier */
1326 const char *dsc; /**< description */
1327 const char *ref; /**< reference */
1328 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vasko26bbb272022-08-02 14:54:33 +02001329
Radek Krejci693262f2019-04-29 15:23:20 +02001330 union {
1331 int32_t value; /**< integer value associated with the enumeration */
1332 uint32_t position; /**< non-negative integer value associated with the bit */
1333 };
Michal Vaskof4fa90d2021-11-11 15:05:19 +01001334 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_ and LYS_IS_ENUM values
1335 are allowed */
Radek Krejci693262f2019-04-29 15:23:20 +02001336};
1337
Radek Krejci2167ee12018-11-02 16:09:07 +01001338struct lysc_type_enum {
Michal Vaskof309c482024-01-22 12:07:00 +01001339 const char *name; /**< referenced typedef name (without prefix, if any), NULL for built-in types */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001340 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskof309c482024-01-22 12:07:00 +01001341 struct lyplg_type *plugin; /**< type's manipulation callbacks plugin */
1342 LY_DATA_TYPE basetype; /**< base type of the type */
Michal Vasko080064b2021-08-31 15:20:44 +02001343 uint32_t refcount; /**< reference counter for type sharing */
Michal Vaskof309c482024-01-22 12:07:00 +01001344
Radek Krejci693262f2019-04-29 15:23:20 +02001345 struct lysc_type_bitenum_item *enums; /**< enumerations list ([sized array](@ref sizedarrays)), mandatory (at least 1 item) */
1346};
1347
1348struct lysc_type_bits {
Michal Vaskof309c482024-01-22 12:07:00 +01001349 const char *name; /**< referenced typedef name (without prefix, if any), NULL for built-in types */
Radek Krejci693262f2019-04-29 15:23:20 +02001350 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskof309c482024-01-22 12:07:00 +01001351 struct lyplg_type *plugin; /**< type's manipulation callbacks plugin */
1352 LY_DATA_TYPE basetype; /**< base type of the type */
Michal Vasko080064b2021-08-31 15:20:44 +02001353 uint32_t refcount; /**< reference counter for type sharing */
Michal Vaskof309c482024-01-22 12:07:00 +01001354
Radek Krejci849a62a2019-05-22 15:29:05 +02001355 struct lysc_type_bitenum_item *bits; /**< bits list ([sized array](@ref sizedarrays)), mandatory (at least 1 item),
1356 the items are ordered by their position value. */
Radek Krejci2167ee12018-11-02 16:09:07 +01001357};
1358
1359struct lysc_type_leafref {
Michal Vaskof309c482024-01-22 12:07:00 +01001360 const char *name; /**< referenced typedef name (without prefix, if any), NULL for built-in types */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001361 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskof309c482024-01-22 12:07:00 +01001362 struct lyplg_type *plugin; /**< type's manipulation callbacks plugin */
1363 LY_DATA_TYPE basetype; /**< base type of the type */
Michal Vasko080064b2021-08-31 15:20:44 +02001364 uint32_t refcount; /**< reference counter for type sharing */
Michal Vaskof309c482024-01-22 12:07:00 +01001365
Michal Vasko004d3152020-06-11 19:59:22 +02001366 struct lyxp_expr *path; /**< parsed target path, compiled path cannot be stored because of type sharing */
Michal Vasko5d24f6c2020-10-13 13:49:06 +02001367 struct lysc_prefix *prefixes; /**< resolved prefixes used in the path */
Radek Krejci412ddfa2018-11-23 11:44:11 +01001368 struct lysc_type *realtype; /**< pointer to the real (first non-leafref in possible leafrefs chain) type. */
Radek Krejci2167ee12018-11-02 16:09:07 +01001369 uint8_t require_instance; /**< require-instance flag */
1370};
1371
1372struct lysc_type_identityref {
Michal Vaskof309c482024-01-22 12:07:00 +01001373 const char *name; /**< referenced typedef name (without prefix, if any), NULL for built-in types */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001374 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskof309c482024-01-22 12:07:00 +01001375 struct lyplg_type *plugin; /**< type's manipulation callbacks plugin */
1376 LY_DATA_TYPE basetype; /**< base type of the type */
Michal Vasko080064b2021-08-31 15:20:44 +02001377 uint32_t refcount; /**< reference counter for type sharing */
Michal Vaskof309c482024-01-22 12:07:00 +01001378
Radek Krejci555cb5b2018-11-16 14:54:33 +01001379 struct lysc_ident **bases; /**< list of pointers to the base identities ([sized array](@ref sizedarrays)),
Radek Krejci2167ee12018-11-02 16:09:07 +01001380 mandatory (at least 1 item) */
1381};
1382
1383struct lysc_type_instanceid {
Michal Vaskof309c482024-01-22 12:07:00 +01001384 const char *name; /**< referenced typedef name (without prefix, if any), NULL for built-in types */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001385 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskof309c482024-01-22 12:07:00 +01001386 struct lyplg_type *plugin; /**< type's manipulation callbacks plugin */
1387 LY_DATA_TYPE basetype; /**< base type of the type */
Michal Vasko080064b2021-08-31 15:20:44 +02001388 uint32_t refcount; /**< reference counter for type sharing */
Michal Vaskof309c482024-01-22 12:07:00 +01001389
Radek Krejci2167ee12018-11-02 16:09:07 +01001390 uint8_t require_instance; /**< require-instance flag */
1391};
1392
Radek Krejci2167ee12018-11-02 16:09:07 +01001393struct lysc_type_union {
Michal Vaskof309c482024-01-22 12:07:00 +01001394 const char *name; /**< referenced typedef name (without prefix, if any), NULL for built-in types */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001395 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskof309c482024-01-22 12:07:00 +01001396 struct lyplg_type *plugin; /**< type's manipulation callbacks plugin */
1397 LY_DATA_TYPE basetype; /**< base type of the type */
Michal Vasko080064b2021-08-31 15:20:44 +02001398 uint32_t refcount; /**< reference counter for type sharing */
Michal Vaskof309c482024-01-22 12:07:00 +01001399
Radek Krejci2167ee12018-11-02 16:09:07 +01001400 struct lysc_type **types; /**< list of types in the union ([sized array](@ref sizedarrays)), mandatory (at least 1 item) */
1401};
1402
1403struct lysc_type_bin {
Michal Vaskof309c482024-01-22 12:07:00 +01001404 const char *name; /**< referenced typedef name (without prefix, if any), NULL for built-in types */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001405 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskof309c482024-01-22 12:07:00 +01001406 struct lyplg_type *plugin; /**< type's manipulation callbacks plugin */
1407 LY_DATA_TYPE basetype; /**< base type of the type */
Michal Vasko080064b2021-08-31 15:20:44 +02001408 uint32_t refcount; /**< reference counter for type sharing */
Michal Vaskof309c482024-01-22 12:07:00 +01001409
1410 struct lysc_range *length; /**< optional length limitation */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001411};
1412
Michal Vasko60ea6352020-06-29 13:39:39 +02001413/**
1414 * @brief Maximum number of hashes stored in a schema node.
1415 */
1416#define LYS_NODE_HASH_COUNT 4
1417
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001418/**
Radek Krejci0af5f5d2018-09-07 15:00:30 +02001419 * @brief Compiled YANG data node
1420 */
1421struct lysc_node {
Radek Krejcide7a9c42021-03-10 13:13:06 +01001422 uint16_t nodetype; /**< [type of the node](@ref schemanodetypes) (mandatory) */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001423 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Michal Vasko60ea6352020-06-29 13:39:39 +02001424 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001425 struct lys_module *module; /**< module structure */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001426 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1427 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1428 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1429 never NULL. If there is no sibling node, pointer points to the node
1430 itself. In case of the first node, this pointer points to the last
1431 node in the list. */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001432 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001433 const char *dsc; /**< description */
1434 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001435 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
aPiecek9922ea92021-04-12 07:59:20 +02001436 void *priv; /**< private arbitrary user data, not used by libyang unless ::LY_CTX_SET_PRIV_PARSED is set */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001437};
1438
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001439struct lysc_node_action_inout {
1440 union {
1441 struct lysc_node node; /**< implicit cast for the members compatible with ::lysc_node */
Michal Vasko26bbb272022-08-02 14:54:33 +02001442
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001443 struct {
1444 uint16_t nodetype; /**< LYS_INPUT or LYS_OUTPUT */
1445 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1446 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser */
1447 struct lys_module *module; /**< module structure */
Radek Krejci5960c312021-01-27 20:24:22 +01001448 struct lysc_node *parent;/**< parent node (NULL in case of top level node) */
Michal Vasko544e58a2021-01-28 14:33:41 +01001449 struct lysc_node *next; /**< next sibling node (output node for input, NULL for output) */
1450 struct lysc_node *prev; /**< pointer to the previous sibling node (input and output node pointing to each other) */
Radek Krejci5960c312021-01-27 20:24:22 +01001451 const char *name; /**< "input" or "output" */
1452 const char *dsc; /**< ALWAYS NULL, compatibility member with ::lysc_node */
1453 const char *ref; /**< ALWAYS NULL, compatibility member with ::lysc_node */
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001454 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
aPiecek9922ea92021-04-12 07:59:20 +02001455 void *priv; /** private arbitrary user data, not used by libyang unless ::LY_CTX_SET_PRIV_PARSED is set */
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001456 };
1457 };
1458
Radek Krejci9a3823e2021-01-27 20:26:46 +01001459 struct lysc_node *child; /**< first child node (linked list) */
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001460 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1461};
1462
1463struct lysc_node_action {
1464 union {
1465 struct lysc_node node; /**< implicit cast for the members compatible with ::lysc_node */
Michal Vasko26bbb272022-08-02 14:54:33 +02001466
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001467 struct {
1468 uint16_t nodetype; /**< LYS_RPC or LYS_ACTION */
1469 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1470 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser */
1471 struct lys_module *module; /**< module structure */
1472 struct lysc_node *parent; /**< parent node (NULL in case of top level node - RPC) */
1473 struct lysc_node_action *next; /**< next sibling node (NULL if there is no one) */
1474 struct lysc_node_action *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1475 never NULL. If there is no sibling node, pointer points to the node
1476 itself. In case of the first node, this pointer points to the last
1477 node in the list. */
1478 const char *name; /**< action/RPC name (mandatory) */
1479 const char *dsc; /**< description */
1480 const char *ref; /**< reference */
1481 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
aPiecek9922ea92021-04-12 07:59:20 +02001482 void *priv; /** private arbitrary user data, not used by libyang unless ::LY_CTX_SET_PRIV_PARSED is set */
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001483 };
1484 };
1485
Radek Krejci9a3823e2021-01-27 20:26:46 +01001486 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)),
1487 the action/RPC nodes do not contain the when statement on their own, but they can
1488 inherit it from the parent's uses. */
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001489 struct lysc_node_action_inout input; /**< RPC's/action's input */
1490 struct lysc_node_action_inout output; /**< RPC's/action's output */
1491
1492};
1493
1494struct lysc_node_notif {
1495 union {
1496 struct lysc_node node; /**< implicit cast for the members compatible with ::lysc_node */
Michal Vasko26bbb272022-08-02 14:54:33 +02001497
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001498 struct {
1499 uint16_t nodetype; /**< LYS_NOTIF */
1500 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1501 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser */
1502 struct lys_module *module; /**< module structure */
1503 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1504 struct lysc_node_notif *next; /**< next sibling node (NULL if there is no one) */
1505 struct lysc_node_notif *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1506 never NULL. If there is no sibling node, pointer points to the node
1507 itself. In case of the first node, this pointer points to the last
1508 node in the list. */
1509 const char *name; /**< Notification name (mandatory) */
1510 const char *dsc; /**< description */
1511 const char *ref; /**< reference */
1512 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
aPiecek9922ea92021-04-12 07:59:20 +02001513 void *priv; /** private arbitrary user data, not used by libyang unless ::LY_CTX_SET_PRIV_PARSED is set */
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001514 };
1515 };
1516
Radek Krejci9a3823e2021-01-27 20:26:46 +01001517 struct lysc_node *child; /**< first child node (linked list) */
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001518 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci9a3823e2021-01-27 20:26:46 +01001519 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)),
1520 the notification nodes do not contain the when statement on their own, but they can
1521 inherit it from the parent's uses. */
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001522};
1523
1524struct lysc_node_container {
1525 union {
1526 struct lysc_node node; /**< implicit cast for the members compatible with ::lysc_node */
Michal Vasko26bbb272022-08-02 14:54:33 +02001527
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001528 struct {
1529 uint16_t nodetype; /**< LYS_CONTAINER */
1530 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1531 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser */
1532 struct lys_module *module; /**< module structure */
1533 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1534 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1535 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1536 never NULL. If there is no sibling node, pointer points to the node
1537 itself. In case of the first node, this pointer points to the last
1538 node in the list. */
1539 const char *name; /**< node name (mandatory) */
1540 const char *dsc; /**< description */
1541 const char *ref; /**< reference */
1542 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
aPiecek9922ea92021-04-12 07:59:20 +02001543 void *priv; /**< private arbitrary user data, not used by libyang unless ::LY_CTX_SET_PRIV_PARSED is set */
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001544 };
1545 };
Radek Krejci4f28eda2018-11-12 11:46:16 +01001546
1547 struct lysc_node *child; /**< first child node (linked list) */
1548 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci9a3823e2021-01-27 20:26:46 +01001549 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Radek Krejci2a9fc652021-01-22 17:44:34 +01001550 struct lysc_node_action *actions;/**< first of actions nodes (linked list) */
1551 struct lysc_node_notif *notifs; /**< first of notifications nodes (linked list) */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001552};
1553
Radek Krejcia3045382018-11-22 14:30:31 +01001554struct lysc_node_case {
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001555 union {
1556 struct lysc_node node; /**< implicit cast for the members compatible with ::lysc_node */
Michal Vasko26bbb272022-08-02 14:54:33 +02001557
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001558 struct {
1559 uint16_t nodetype; /**< LYS_CASE */
1560 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1561 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser, unused */
1562 struct lys_module *module; /**< module structure */
1563 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1564 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1565 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
Radek Krejci056d0a82018-12-06 16:57:25 +01001566 never NULL. If there is no sibling node, pointer points to the node
1567 itself. In case of the first node, this pointer points to the last
1568 node in the list. */
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001569 const char *name; /**< name of the case, including the implicit case */
1570 const char *dsc; /**< description */
1571 const char *ref; /**< reference */
1572 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
aPiecek9922ea92021-04-12 07:59:20 +02001573 void *priv; /**< private arbitrary user data, not used by libyang unless ::LY_CTX_SET_PRIV_PARSED is set */
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001574 };
1575 };
Radek Krejci056d0a82018-12-06 16:57:25 +01001576
Radek Krejcia3045382018-11-22 14:30:31 +01001577 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 +01001578 each other as siblings with the parent pointer pointing to appropriate case node. */
Radek Krejci9a3823e2021-01-27 20:26:46 +01001579 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Radek Krejcia3045382018-11-22 14:30:31 +01001580};
1581
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001582struct lysc_node_choice {
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001583 union {
1584 struct lysc_node node; /**< implicit cast for the members compatible with ::lysc_node */
Michal Vasko26bbb272022-08-02 14:54:33 +02001585
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001586 struct {
1587 uint16_t nodetype; /**< LYS_CHOICE */
1588 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1589 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser, unused */
1590 struct lys_module *module; /**< module structure */
1591 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1592 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1593 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001594 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 Krejci00a3e8a2021-01-27 08:24:49 +01001597 const char *name; /**< node name (mandatory) */
1598 const char *dsc; /**< description */
1599 const char *ref; /**< reference */
1600 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
aPiecek9922ea92021-04-12 07:59:20 +02001601 void *priv; /**< private arbitrary user data, not used by libyang unless ::LY_CTX_SET_PRIV_PARSED is set */
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001602 };
1603 };
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001604
Michal Vaskod098f5d2024-01-11 08:51:31 +01001605 struct lysc_node_case *cases; /**< list of all the cases (linked list) */
Radek Krejci9a3823e2021-01-27 20:26:46 +01001606 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Radek Krejci056d0a82018-12-06 16:57:25 +01001607 struct lysc_node_case *dflt; /**< default case of the choice, only a pointer into the cases array. */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001608};
1609
1610struct lysc_node_leaf {
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001611 union {
1612 struct lysc_node node; /**< implicit cast for the members compatible with ::lysc_node */
Michal Vasko26bbb272022-08-02 14:54:33 +02001613
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001614 struct {
1615 uint16_t nodetype; /**< LYS_LEAF */
1616 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1617 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser */
1618 struct lys_module *module; /**< module structure */
1619 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1620 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1621 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001622 never NULL. If there is no sibling node, pointer points to the node
1623 itself. In case of the first node, this pointer points to the last
1624 node in the list. */
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001625 const char *name; /**< node name (mandatory) */
1626 const char *dsc; /**< description */
1627 const char *ref; /**< reference */
1628 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
aPiecek9922ea92021-04-12 07:59:20 +02001629 void *priv; /**< private arbitrary user data, not used by libyang unless ::LY_CTX_SET_PRIV_PARSED is set */
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001630 };
1631 };
Radek Krejci4f28eda2018-11-12 11:46:16 +01001632
1633 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci9a3823e2021-01-27 20:26:46 +01001634 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001635 struct lysc_type *type; /**< type of the leaf node (mandatory) */
Radek Krejcib57cf1e2018-11-23 14:07:05 +01001636
Radek Krejci4f28eda2018-11-12 11:46:16 +01001637 const char *units; /**< units of the leaf's type */
Michal Vasko33876022021-04-27 16:42:24 +02001638 struct lyd_value *dflt; /**< default value, use ::lyd_value_get_canonical() to get the canonical string */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001639};
1640
1641struct lysc_node_leaflist {
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001642 union {
1643 struct lysc_node node; /**< implicit cast for the members compatible with ::lysc_node */
Michal Vasko26bbb272022-08-02 14:54:33 +02001644
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001645 struct {
1646 uint16_t nodetype; /**< LYS_LEAFLIST */
1647 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1648 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser */
1649 struct lys_module *module; /**< module structure */
1650 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1651 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1652 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001653 never NULL. If there is no sibling node, pointer points to the node
1654 itself. In case of the first node, this pointer points to the last
1655 node in the list. */
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001656 const char *name; /**< node name (mandatory) */
1657 const char *dsc; /**< description */
1658 const char *ref; /**< reference */
1659 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
aPiecek9922ea92021-04-12 07:59:20 +02001660 void *priv; /**< private arbitrary user data, not used by libyang unless ::LY_CTX_SET_PRIV_PARSED is set */
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001661 };
1662 };
Radek Krejcib57cf1e2018-11-23 14:07:05 +01001663
1664 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci9a3823e2021-01-27 20:26:46 +01001665 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Radek Krejcib57cf1e2018-11-23 14:07:05 +01001666 struct lysc_type *type; /**< type of the leaf node (mandatory) */
1667
Radek Krejci0e5d8382018-11-28 16:37:53 +01001668 const char *units; /**< units of the leaf's type */
Michal Vasko33876022021-04-27 16:42:24 +02001669 struct lyd_value **dflts; /**< list ([sized array](@ref sizedarrays)) of default values, use
1670 ::lyd_value_get_canonical() to get the canonical strings */
Michal Vaskoba99a3e2020-08-18 15:50:05 +02001671
Radek Krejci0e5d8382018-11-28 16:37:53 +01001672 uint32_t min; /**< min-elements constraint */
1673 uint32_t max; /**< max-elements constraint */
1674
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001675};
1676
1677struct lysc_node_list {
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001678 union {
1679 struct lysc_node node; /**< implicit cast for the members compatible with ::lysc_node */
Michal Vasko26bbb272022-08-02 14:54:33 +02001680
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001681 struct {
1682 uint16_t nodetype; /**< LYS_LIST */
1683 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1684 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser */
1685 struct lys_module *module; /**< module structure */
1686 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1687 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1688 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001689 never NULL. If there is no sibling node, pointer points to the node
1690 itself. In case of the first node, this pointer points to the last
1691 node in the list. */
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001692 const char *name; /**< node name (mandatory) */
1693 const char *dsc; /**< description */
1694 const char *ref; /**< reference */
1695 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
aPiecek9922ea92021-04-12 07:59:20 +02001696 void *priv; /**< private arbitrary user data, not used by libyang unless ::LY_CTX_SET_PRIV_PARSED is set */
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001697 };
1698 };
Radek Krejci9bb94eb2018-12-04 16:48:35 +01001699
1700 struct lysc_node *child; /**< first child node (linked list) */
1701 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci9a3823e2021-01-27 20:26:46 +01001702 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Radek Krejci2a9fc652021-01-22 17:44:34 +01001703 struct lysc_node_action *actions;/**< first of actions nodes (linked list) */
1704 struct lysc_node_notif *notifs; /**< first of notifications nodes (linked list) */
Radek Krejci9bb94eb2018-12-04 16:48:35 +01001705
Radek Krejci2a9fc652021-01-22 17:44:34 +01001706 struct lysc_node_leaf ***uniques;/**< list of sized arrays of pointers to the unique nodes ([sized array](@ref sizedarrays)) */
Radek Krejci9bb94eb2018-12-04 16:48:35 +01001707 uint32_t min; /**< min-elements constraint */
1708 uint32_t max; /**< max-elements constraint */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001709};
1710
1711struct lysc_node_anydata {
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001712 union {
1713 struct lysc_node node; /**< implicit cast for the members compatible with ::lysc_node */
Michal Vasko26bbb272022-08-02 14:54:33 +02001714
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001715 struct {
1716 uint16_t nodetype; /**< LYS_ANYXML or LYS_ANYDATA */
1717 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1718 uint8_t hash[LYS_NODE_HASH_COUNT]; /**< schema hash required for LYB printer/parser */
1719 struct lys_module *module; /**< module structure */
1720 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1721 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1722 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001723 never NULL. If there is no sibling node, pointer points to the node
1724 itself. In case of the first node, this pointer points to the last
1725 node in the list. */
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001726 const char *name; /**< node name (mandatory) */
1727 const char *dsc; /**< description */
1728 const char *ref; /**< reference */
1729 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
aPiecek9922ea92021-04-12 07:59:20 +02001730 void *priv; /**< private arbitrary user data, not used by libyang unless ::LY_CTX_SET_PRIV_PARSED is set */
Radek Krejci00a3e8a2021-01-27 08:24:49 +01001731 };
1732 };
Radek Krejci9800fb82018-12-13 14:26:23 +01001733
1734 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci9a3823e2021-01-27 20:26:46 +01001735 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001736};
1737
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001738/**
1739 * @brief Compiled YANG schema tree structure representing YANG module.
1740 *
1741 * Semantically validated YANG schema tree for data tree parsing.
1742 * Contains only the necessary information for the data validation.
1743 */
1744struct lysc_module {
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001745 struct lys_module *mod; /**< covering module structure */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001746
Radek Krejci2a408df2018-10-29 16:32:26 +01001747 struct lysc_node *data; /**< list of module's top-level data nodes (linked list) */
Radek Krejci2a9fc652021-01-22 17:44:34 +01001748 struct lysc_node_action *rpcs; /**< first of actions nodes (linked list) */
1749 struct lysc_node_notif *notifs; /**< first of notifications nodes (linked list) */
Radek Krejcice8c1592018-10-29 15:35:51 +01001750 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci0af5f5d2018-09-07 15:00:30 +02001751};
1752
1753/**
Radek Krejci490a5462020-11-05 08:44:42 +01001754 * @brief Examine whether a node is user-ordered list or leaf-list.
1755 *
1756 * @param[in] lysc_node Schema node to examine.
1757 * @return Boolean value whether the @p node is user-ordered or not.
1758 */
1759#define lysc_is_userordered(lysc_node) \
1760 ((!lysc_node || !(lysc_node->nodetype & (LYS_LEAFLIST | LYS_LIST)) || !(lysc_node->flags & LYS_ORDBY_USER)) ? 0 : 1)
1761
1762/**
1763 * @brief Examine whether a node is a list's key.
1764 *
1765 * @param[in] lysc_node Schema node to examine.
1766 * @return Boolean value whether the @p node is a key or not.
1767 */
1768#define lysc_is_key(lysc_node) \
Michal Vaskobce7ee32021-02-04 11:05:25 +01001769 ((!lysc_node || (lysc_node->nodetype != LYS_LEAF) || !(lysc_node->flags & LYS_KEY)) ? 0 : 1)
Radek Krejci490a5462020-11-05 08:44:42 +01001770
1771/**
Michal Vasko5c123b02020-12-04 14:34:04 +01001772 * @brief Examine whether a node is a non-presence container.
1773 *
1774 * @param[in] lysc_node Schema node to examine.
1775 * @return Boolean value whether the @p node is a NP container or not.
1776 */
1777#define lysc_is_np_cont(lysc_node) \
Michal Vaskobce7ee32021-02-04 11:05:25 +01001778 ((!lysc_node || (lysc_node->nodetype != LYS_CONTAINER) || (lysc_node->flags & LYS_PRESENCE)) ? 0 : 1)
1779
1780/**
Michal Vaskoe78faec2021-04-08 17:24:43 +02001781 * @brief Examine whether a node is a key-less list or a non-configuration leaf-list.
Michal Vaskobce7ee32021-02-04 11:05:25 +01001782 *
1783 * @param[in] lysc_node Schema node to examine.
1784 * @return Boolean value whether the @p node is a list with duplicate instances allowed.
1785 */
1786#define lysc_is_dup_inst_list(lysc_node) \
1787 ((lysc_node && (((lysc_node->nodetype == LYS_LIST) && (lysc_node->flags & LYS_KEYLESS)) || \
Michal Vaskoe78faec2021-04-08 17:24:43 +02001788 ((lysc_node->nodetype == LYS_LEAFLIST) && !(lysc_node->flags & LYS_CONFIG_W)))) ? 1 : 0)
Michal Vasko5c123b02020-12-04 14:34:04 +01001789
1790/**
Michal Vaskof8ded142022-02-17 10:48:01 +01001791 * @brief Get nearest @p schema parent (including the node itself) that can be instantiated in data.
1792 *
1793 * @param[in] schema Schema node to get the nearest data node for.
1794 * @return Schema data node, NULL if top-level (in data).
1795 */
1796LIBYANG_API_DECL const struct lysc_node *lysc_data_node(const struct lysc_node *schema);
1797
1798/**
1799 * @brief Same as ::lysc_data_node() but never returns the node itself.
1800 */
1801#define lysc_data_parent(SCHEMA) lysc_data_node((SCHEMA) ? (SCHEMA)->parent : NULL)
1802
1803/**
Michal Vaskod5cfa6e2020-11-23 16:56:08 +01001804 * @brief Check whether the schema node data instance existence depends on any when conditions.
1805 * This node and any direct parent choice and case schema nodes are also examined for when conditions.
1806 *
1807 * Be careful, this function is not recursive and checks only conditions that apply to this node directly.
1808 * Meaning if there are any conditions associated with any data parent instance of @p node, they are not returned.
1809 *
1810 * @param[in] node Schema node to examine.
1811 * @return When condition associated with the node data instance, NULL if there is none.
1812 */
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001813LIBYANG_API_DECL const struct lysc_when *lysc_has_when(const struct lysc_node *node);
Michal Vaskod5cfa6e2020-11-23 16:56:08 +01001814
1815/**
Michal Vaskoef53c812021-10-13 10:21:03 +02001816 * @brief Get the owner module of the schema node. It is the module of the top-level node. Generally,
1817 * in case of augments it is the target module, recursively, otherwise it is the module where the node is defined.
1818 *
1819 * @param[in] node Schema node to examine.
1820 * @return Module owner of the node.
1821 */
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001822LIBYANG_API_DECL const struct lys_module *lysc_owner_module(const struct lysc_node *node);
Michal Vaskoef53c812021-10-13 10:21:03 +02001823
1824/**
Radek Krejci2a9fc652021-01-22 17:44:34 +01001825 * @brief Get the groupings linked list of the given (parsed) schema node.
Radek Krejci53ea6152018-12-13 15:21:15 +01001826 * Decides the node's type and in case it has a groupings array, returns it.
1827 * @param[in] node Node to examine.
Radek Krejci2a9fc652021-01-22 17:44:34 +01001828 * @return The node's groupings linked list if any, NULL otherwise.
Radek Krejci53ea6152018-12-13 15:21:15 +01001829 */
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001830LIBYANG_API_DECL const struct lysp_node_grp *lysp_node_groupings(const struct lysp_node *node);
Radek Krejci53ea6152018-12-13 15:21:15 +01001831
1832/**
Radek Krejci056d0a82018-12-06 16:57:25 +01001833 * @brief Get the typedefs sized array of the given (parsed) schema node.
1834 * Decides the node's type and in case it has a typedefs array, returns it.
1835 * @param[in] node Node to examine.
1836 * @return The node's typedefs sized array if any, NULL otherwise.
1837 */
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001838LIBYANG_API_DECL const struct lysp_tpdf *lysp_node_typedefs(const struct lysp_node *node);
Radek Krejci056d0a82018-12-06 16:57:25 +01001839
1840/**
Radek Krejci2a9fc652021-01-22 17:44:34 +01001841 * @brief Get the actions/RPCs linked list of the given (parsed) schema node.
Radek Krejci056d0a82018-12-06 16:57:25 +01001842 * Decides the node's type and in case it has a actions/RPCs array, returns it.
1843 * @param[in] node Node to examine.
Radek Krejci2a9fc652021-01-22 17:44:34 +01001844 * @return The node's actions/RPCs linked list if any, NULL otherwise.
Radek Krejci056d0a82018-12-06 16:57:25 +01001845 */
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001846LIBYANG_API_DECL const struct lysp_node_action *lysp_node_actions(const struct lysp_node *node);
Radek Krejci056d0a82018-12-06 16:57:25 +01001847
1848/**
Radek Krejci2a9fc652021-01-22 17:44:34 +01001849 * @brief Get the Notifications linked list of the given (parsed) schema node.
Radek Krejci056d0a82018-12-06 16:57:25 +01001850 * Decides the node's type and in case it has a Notifications array, returns it.
1851 * @param[in] node Node to examine.
Radek Krejci2a9fc652021-01-22 17:44:34 +01001852 * @return The node's Notifications linked list if any, NULL otherwise.
Radek Krejci056d0a82018-12-06 16:57:25 +01001853 */
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001854LIBYANG_API_DECL const struct lysp_node_notif *lysp_node_notifs(const struct lysp_node *node);
Radek Krejci056d0a82018-12-06 16:57:25 +01001855
1856/**
1857 * @brief Get the children linked list of the given (parsed) schema node.
1858 * Decides the node's type and in case it has a children list, returns it.
1859 * @param[in] node Node to examine.
1860 * @return The node's children linked list if any, NULL otherwise.
1861 */
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001862LIBYANG_API_DECL const struct lysp_node *lysp_node_child(const struct lysp_node *node);
Radek Krejci056d0a82018-12-06 16:57:25 +01001863
1864/**
Radek Krejci2a9fc652021-01-22 17:44:34 +01001865 * @brief Get the actions/RPCs linked list of the given (compiled) schema node.
Radek Krejci056d0a82018-12-06 16:57:25 +01001866 * Decides the node's type and in case it has a actions/RPCs array, returns it.
1867 * @param[in] node Node to examine.
Radek Krejci2a9fc652021-01-22 17:44:34 +01001868 * @return The node's actions/RPCs linked list if any, NULL otherwise.
Radek Krejci056d0a82018-12-06 16:57:25 +01001869 */
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001870LIBYANG_API_DECL const struct lysc_node_action *lysc_node_actions(const struct lysc_node *node);
Radek Krejci056d0a82018-12-06 16:57:25 +01001871
1872/**
Radek Krejci2a9fc652021-01-22 17:44:34 +01001873 * @brief Get the Notifications linked list of the given (compiled) schema node.
Radek Krejci056d0a82018-12-06 16:57:25 +01001874 * Decides the node's type and in case it has a Notifications array, returns it.
1875 * @param[in] node Node to examine.
Radek Krejci2a9fc652021-01-22 17:44:34 +01001876 * @return The node's Notifications linked list if any, NULL otherwise.
Radek Krejci056d0a82018-12-06 16:57:25 +01001877 */
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001878LIBYANG_API_DECL const struct lysc_node_notif *lysc_node_notifs(const struct lysc_node *node);
Radek Krejci056d0a82018-12-06 16:57:25 +01001879
1880/**
1881 * @brief Get the children linked list of the given (compiled) schema node.
Michal Vasko2a668712020-10-21 11:48:09 +02001882 *
Michal Vasko544e58a2021-01-28 14:33:41 +01001883 * Note that ::LYS_CHOICE has only ::LYS_CASE children.
1884 * Also, ::LYS_RPC and ::LYS_ACTION have the first child ::LYS_INPUT, its sibling is ::LYS_OUTPUT.
1885 *
Michal Vasko2a668712020-10-21 11:48:09 +02001886 * @param[in] node Node to examine.
Michal Vasko2a668712020-10-21 11:48:09 +02001887 * @return Children linked list if any,
1888 * @return NULL otherwise.
1889 */
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001890LIBYANG_API_DECL const struct lysc_node *lysc_node_child(const struct lysc_node *node);
Michal Vasko2a668712020-10-21 11:48:09 +02001891
1892/**
Radek Krejci9a3823e2021-01-27 20:26:46 +01001893 * @brief Get the must statements list if present in the @p node
1894 *
1895 * @param[in] node Node to examine.
1896 * @return Pointer to the list of must restrictions ([sized array](@ref sizedarrays))
1897 * @return NULL if there is no must statement in the node, no matter if it is not even allowed or just present
1898 */
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001899LIBYANG_API_DECL struct lysc_must *lysc_node_musts(const struct lysc_node *node);
Radek Krejci9a3823e2021-01-27 20:26:46 +01001900
1901/**
1902 * @brief Get the when statements list if present in the @p node
1903 *
1904 * @param[in] node Node to examine.
1905 * @return Pointer to the list of pointers to when statements ([sized array](@ref sizedarrays))
1906 * @return NULL if there is no when statement in the node, no matter if it is not even allowed or just present
1907 */
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001908LIBYANG_API_DECL struct lysc_when **lysc_node_when(const struct lysc_node *node);
Radek Krejci9a3823e2021-01-27 20:26:46 +01001909
1910/**
Michal Vasko510554a2023-09-11 09:03:29 +02001911 * @brief Get the target node of a leafref node.
1912 *
1913 * @param[in] node Leafref node.
1914 * @return Leafref target, NULL on any error.
1915 */
1916LIBYANG_API_DECL const struct lysc_node *lysc_node_lref_target(const struct lysc_node *node);
1917
1918/**
Michal Vaskof1ab44f2020-10-22 08:58:32 +02001919 * @brief Callback to be called for every schema node in a DFS traversal.
1920 *
1921 * @param[in] node Current node.
1922 * @param[in] data Arbitrary user data.
1923 * @param[out] dfs_continue Set to true if the current subtree should be skipped and continue with siblings instead.
1924 * @return LY_SUCCESS on success,
1925 * @return LY_ERR value to terminate DFS and return this value.
1926 */
Michal Vasko8f07dfe2021-03-02 16:10:24 +01001927typedef LY_ERR (*lysc_dfs_clb)(struct lysc_node *node, void *data, ly_bool *dfs_continue);
Michal Vaskof1ab44f2020-10-22 08:58:32 +02001928
1929/**
1930 * @brief DFS traversal of all the schema nodes in a (sub)tree including any actions and nested notifications.
1931 *
1932 * Node with children, actions, and notifications is traversed in this order:
1933 * 1) each child subtree;
1934 * 2) each action subtree;
1935 * 3) each notification subtree.
1936 *
1937 * For algorithm illustration or traversal with actions and notifications skipped, see ::LYSC_TREE_DFS_BEGIN.
1938 *
1939 * @param[in] root Schema root to fully traverse.
1940 * @param[in] dfs_clb Callback to call for each node.
1941 * @param[in] data Arbitrary user data passed to @p dfs_clb.
1942 * @return LY_SUCCESS on success,
1943 * @return LY_ERR value returned by @p dfs_clb.
1944 */
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001945LIBYANG_API_DECL LY_ERR lysc_tree_dfs_full(const struct lysc_node *root, lysc_dfs_clb dfs_clb, void *data);
Michal Vaskof1ab44f2020-10-22 08:58:32 +02001946
1947/**
1948 * @brief DFS traversal of all the schema nodes in a module including RPCs and notifications.
1949 *
1950 * For more details, see ::lysc_tree_dfs_full().
1951 *
1952 * @param[in] mod Module to fully traverse.
1953 * @param[in] dfs_clb Callback to call for each node.
1954 * @param[in] data Arbitrary user data passed to @p dfs_clb.
1955 * @return LY_SUCCESS on success,
1956 * @return LY_ERR value returned by @p dfs_clb.
1957 */
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001958LIBYANG_API_DECL LY_ERR lysc_module_dfs_full(const struct lys_module *mod, lysc_dfs_clb dfs_clb, void *data);
Michal Vaskof1ab44f2020-10-22 08:58:32 +02001959
1960/**
Radek Krejci151a5b72018-10-19 14:21:44 +02001961 * @brief Get how the if-feature statement currently evaluates.
1962 *
1963 * @param[in] iff Compiled if-feature statement to evaluate.
Michal Vasko28d78432020-05-26 13:10:53 +02001964 * @return LY_SUCCESS if the statement evaluates to true,
1965 * @return LY_ENOT if it evaluates to false,
1966 * @return LY_ERR on error.
Radek Krejci151a5b72018-10-19 14:21:44 +02001967 */
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001968LIBYANG_API_DECL LY_ERR lysc_iffeature_value(const struct lysc_iffeature *iff);
Radek Krejci151a5b72018-10-19 14:21:44 +02001969
1970/**
aPiecekf4a0a192021-08-03 15:14:17 +02001971 * @brief Get how the if-feature statement is evaluated for certain identity.
1972 *
1973 * The function can be called even if the identity does not contain
1974 * if-features, in which case ::LY_SUCCESS is returned.
1975 *
1976 * @param[in] ident Compiled identity statement to evaluate.
1977 * @return LY_SUCCESS if the statement evaluates to true,
1978 * @return LY_ENOT if it evaluates to false,
1979 * @return LY_ERR on error.
1980 */
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001981LIBYANG_API_DECL LY_ERR lys_identity_iffeature_value(const struct lysc_ident *ident);
aPiecekf4a0a192021-08-03 15:14:17 +02001982
1983/**
Michal Vasko7b1ad1a2020-11-02 15:41:27 +01001984 * @brief Get the next feature in the module or submodules.
Radek Krejci151a5b72018-10-19 14:21:44 +02001985 *
Michal Vasko7b1ad1a2020-11-02 15:41:27 +01001986 * @param[in] last Last returned feature.
Michal Vasko4ec4bc02021-10-12 10:17:28 +02001987 * @param[in] pmod Parsed module and submodules whose features to iterate over.
Michal Vasko7b1ad1a2020-11-02 15:41:27 +01001988 * @param[in,out] idx Submodule index, set to 0 on first call.
1989 * @return Next found feature, NULL if the last has already been returned.
Radek Krejci151a5b72018-10-19 14:21:44 +02001990 */
Michal Vaskoc1a0ff62022-02-28 14:27:16 +01001991LIBYANG_API_DECL struct lysp_feature *lysp_feature_next(const struct lysp_feature *last, const struct lysp_module *pmod,
1992 uint32_t *idx);
Radek Krejci151a5b72018-10-19 14:21:44 +02001993
Radek Krejcibed13942020-10-19 16:06:28 +02001994/**
1995 * @defgroup findxpathoptions Atomize XPath options
1996 * Options to modify behavior of ::lys_find_xpath() and ::lys_find_xpath_atoms() searching for schema nodes in schema tree.
1997 * @{
1998 */
Michal Vasko4ad69e72021-10-26 16:25:55 +02001999#define LYS_FIND_XP_SCHEMA 0x08 /**< Apply node access restrictions defined for 'when' and 'must' evaluation. */
2000#define LYS_FIND_XP_OUTPUT 0x10 /**< Search RPC/action output nodes instead of input ones. */
Michal Vaskoa2fe0812022-05-26 09:24:32 +02002001#define LYS_FIND_NO_MATCH_ERROR 0x40 /**< Return error if a path segment matches no nodes, otherwise only warning
Michal Vasko4ad69e72021-10-26 16:25:55 +02002002 is printed. */
Michal Vaskoe482bb92023-02-01 11:41:41 +01002003#define LYS_FIND_SCHEMAMOUNT 0x0200 /**< Traverse also nodes from mounted modules. If any such nodes are returned,
2004 the caller **must free** their context! */
Radek Krejci576f8fa2020-10-26 21:23:58 +01002005/** @} findxpathoptions */
Michal Vasko072de482020-08-05 13:27:21 +02002006
Radek Krejci151a5b72018-10-19 14:21:44 +02002007/**
Michal Vasko40308e72020-10-20 16:38:40 +02002008 * @brief Get all the schema nodes that are required for @p xpath to be evaluated (atoms).
Michal Vasko519fd602020-05-26 12:17:39 +02002009 *
Michal Vasko26512682021-01-11 11:35:40 +01002010 * @param[in] ctx libyang context to use. May be NULL if @p ctx_node is set.
2011 * @param[in] ctx_node XPath schema context node. Use NULL for the root node.
Radek Krejci8df109d2021-04-23 12:19:08 +02002012 * @param[in] xpath Data XPath expression filtering the matching nodes. ::LY_VALUE_JSON prefix format is expected.
Radek Krejcibed13942020-10-19 16:06:28 +02002013 * @param[in] options Whether to apply some node access restrictions, see @ref findxpathoptions.
Michal Vasko519fd602020-05-26 12:17:39 +02002014 * @param[out] set Set of found atoms (schema nodes).
2015 * @return LY_SUCCESS on success, @p set is returned.
Michal Vasko40308e72020-10-20 16:38:40 +02002016 * @return LY_ERR value on error.
Michal Vasko519fd602020-05-26 12:17:39 +02002017 */
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01002018LIBYANG_API_DECL LY_ERR lys_find_xpath_atoms(const struct ly_ctx *ctx, const struct lysc_node *ctx_node, const char *xpath,
Michal Vasko26512682021-01-11 11:35:40 +01002019 uint32_t options, struct ly_set **set);
Michal Vasko519fd602020-05-26 12:17:39 +02002020
Michal Vasko072de482020-08-05 13:27:21 +02002021/**
Michal Vasko40308e72020-10-20 16:38:40 +02002022 * @brief Get all the schema nodes that are required for @p expr to be evaluated (atoms).
Michal Vasko072de482020-08-05 13:27:21 +02002023 *
Michal Vasko26512682021-01-11 11:35:40 +01002024 * @param[in] ctx_node XPath schema context node. Use NULL for the root node.
Michal Vasko40308e72020-10-20 16:38:40 +02002025 * @param[in] cur_mod Current module for the expression (where it was "instantiated").
2026 * @param[in] expr Parsed expression to use.
2027 * @param[in] prefixes Sized array of compiled prefixes.
2028 * @param[in] options Whether to apply some node access restrictions, see @ref findxpathoptions.
2029 * @param[out] set Set of found atoms (schema nodes).
2030 * @return LY_SUCCESS on success, @p set is returned.
2031 * @return LY_ERR value on error.
2032 */
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01002033LIBYANG_API_DECL LY_ERR lys_find_expr_atoms(const struct lysc_node *ctx_node, const struct lys_module *cur_mod,
Michal Vasko40308e72020-10-20 16:38:40 +02002034 const struct lyxp_expr *expr, const struct lysc_prefix *prefixes, uint32_t options, struct ly_set **set);
2035
2036/**
2037 * @brief Evaluate an @p xpath expression on schema nodes.
2038 *
Michal Vasko26512682021-01-11 11:35:40 +01002039 * @param[in] ctx libyang context to use for absolute @p xpath. May be NULL if @p ctx_node is set.
2040 * @param[in] ctx_node XPath schema context node for relative @p xpath. Use NULL for the root node.
Radek Krejci8df109d2021-04-23 12:19:08 +02002041 * @param[in] xpath Data XPath expression filtering the matching nodes. ::LY_VALUE_JSON prefix format is expected.
Radek Krejcibed13942020-10-19 16:06:28 +02002042 * @param[in] options Whether to apply some node access restrictions, see @ref findxpathoptions.
Michal Vasko072de482020-08-05 13:27:21 +02002043 * @param[out] set Set of found schema nodes.
2044 * @return LY_SUCCESS on success, @p set is returned.
2045 * @return LY_ERR value if an error occurred.
2046 */
Michal Vaskoc1a0ff62022-02-28 14:27:16 +01002047LIBYANG_API_DECL LY_ERR lys_find_xpath(const struct ly_ctx *ctx, const struct lysc_node *ctx_node, const char *xpath,
2048 uint32_t options, struct ly_set **set);
Michal Vasko519fd602020-05-26 12:17:39 +02002049
2050/**
Radek Krejcibc5644c2020-10-27 14:53:17 +01002051 * @brief Get all the schema nodes that are required for @p path to be evaluated (atoms).
2052 *
2053 * @param[in] path Compiled path to use.
2054 * @param[out] set Set of found atoms (schema nodes).
2055 * @return LY_SUCCESS on success, @p set is returned.
2056 * @return LY_ERR value on error.
2057 */
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01002058LIBYANG_API_DECL LY_ERR lys_find_lypath_atoms(const struct ly_path *path, struct ly_set **set);
Radek Krejcibc5644c2020-10-27 14:53:17 +01002059
2060/**
2061 * @brief Get all the schema nodes that are required for @p path to be evaluated (atoms).
2062 *
Michal Vasko26512682021-01-11 11:35:40 +01002063 * @param[in] ctx libyang context to use for absolute @p path. May be NULL if @p ctx_node is set.
2064 * @param[in] ctx_node XPath schema context node for relative @p path. Use NULL for the root node.
Radek Krejcibc5644c2020-10-27 14:53:17 +01002065 * @param[in] path JSON path to examine.
2066 * @param[in] output Search operation output instead of input.
2067 * @param[out] set Set of found atoms (schema nodes).
2068 * @return LY_ERR value on error.
2069 */
Michal Vaskoc1a0ff62022-02-28 14:27:16 +01002070LIBYANG_API_DECL LY_ERR lys_find_path_atoms(const struct ly_ctx *ctx, const struct lysc_node *ctx_node, const char *path,
2071 ly_bool output, struct ly_set **set);
Radek Krejcibc5644c2020-10-27 14:53:17 +01002072
2073/**
2074 * @brief Get a schema node based on the given data path (JSON format, see @ref howtoXPath).
2075 *
Michal Vasko26512682021-01-11 11:35:40 +01002076 * @param[in] ctx libyang context to use for absolute @p path. May be NULL if @p ctx_node is set.
2077 * @param[in] ctx_node XPath schema context node for relative @p path. Use NULL for the root node.
Radek Krejcibc5644c2020-10-27 14:53:17 +01002078 * @param[in] path JSON path of the node to get.
2079 * @param[in] output Search operation output instead of input.
2080 * @return Found schema node or NULL.
2081 */
Michal Vaskoc1a0ff62022-02-28 14:27:16 +01002082LIBYANG_API_DECL const struct lysc_node *lys_find_path(const struct ly_ctx *ctx, const struct lysc_node *ctx_node,
2083 const char *path, ly_bool output);
Radek Krejcibc5644c2020-10-27 14:53:17 +01002084
2085/**
Michal Vasko03ff5a72019-09-11 13:49:33 +02002086 * @brief Types of the different schema paths.
2087 */
2088typedef enum {
Michal Vasko65de0402020-08-03 16:34:19 +02002089 LYSC_PATH_LOG, /**< Descriptive path format used in log messages */
Michal Vaskobde22b62022-03-22 15:32:56 +01002090 LYSC_PATH_DATA, /**< Similar to ::LYSC_PATH_LOG except that schema-only nodes (choice, case) are skipped */
2091 LYSC_PATH_DATA_PATTERN /**< Similar to ::LYSC_PATH_DATA but there are predicates for all list keys added with
2092 "%s" where their values should be so that they can be printed there */
Michal Vasko03ff5a72019-09-11 13:49:33 +02002093} LYSC_PATH_TYPE;
2094
2095/**
Radek Krejci327de162019-06-14 12:52:07 +02002096 * @brief Generate path of the given node in the requested format.
2097 *
2098 * @param[in] node Schema path of this node will be generated.
2099 * @param[in] pathtype Format of the path to generate.
Radek Krejci1c0c3442019-07-23 16:08:47 +02002100 * @param[in,out] buffer Prepared buffer of the @p buflen length to store the generated path.
2101 * If NULL, memory for the complete path is allocated.
2102 * @param[in] buflen Size of the provided @p buffer.
Radek Krejci327de162019-06-14 12:52:07 +02002103 * @return NULL in case of memory allocation error, path of the node otherwise.
Radek Krejci1c0c3442019-07-23 16:08:47 +02002104 * 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 +02002105 */
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01002106LIBYANG_API_DECL char *lysc_path(const struct lysc_node *node, LYSC_PATH_TYPE pathtype, char *buffer, size_t buflen);
Radek Krejci327de162019-06-14 12:52:07 +02002107
2108/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +02002109 * @brief Available YANG schema tree structures representing YANG module.
2110 */
2111struct lys_module {
Radek Krejci0bcdaed2019-01-10 10:21:34 +01002112 struct ly_ctx *ctx; /**< libyang context of the module (mandatory) */
2113 const char *name; /**< name of the module (mandatory) */
Radek Krejci0af46292019-01-11 16:02:31 +01002114 const char *revision; /**< revision of the module (if present) */
Radek Krejci0bcdaed2019-01-10 10:21:34 +01002115 const char *ns; /**< namespace of the module (module - mandatory) */
2116 const char *prefix; /**< module prefix or submodule belongsto prefix of main module (mandatory) */
2117 const char *filepath; /**< path, if the schema was read from a file, NULL in case of reading from memory */
2118 const char *org; /**< party/company responsible for the module */
2119 const char *contact; /**< contact information for the module */
2120 const char *dsc; /**< description of the module */
2121 const char *ref; /**< cross-reference for the module */
2122
Radek Krejci5aeea3a2018-09-05 13:29:36 +02002123 struct lysp_module *parsed; /**< Simply parsed (unresolved) YANG schema tree */
Radek Krejci0af46292019-01-11 16:02:31 +01002124 struct lysc_module *compiled; /**< Compiled and fully validated YANG schema tree for data parsing.
2125 Available only for implemented modules. */
Michal Vasko7f45cf22020-10-01 12:49:44 +02002126
Radek Krejci80d281e2020-09-14 17:42:54 +02002127 struct lysc_ident *identities; /**< List of compiled identities of the module ([sized array](@ref sizedarrays))
aPiecek6b3d5422021-07-30 15:55:43 +02002128 also contains the disabled identities when their if-feature(s) are evaluated to \"false\",
2129 and also the list is filled even if the module is not implemented.
2130 The list is located here because it avoids problems when the module became implemented in
Radek Krejci80d281e2020-09-14 17:42:54 +02002131 future (no matter if implicitly via augment/deviate or explicitly via
2132 ::lys_set_implemented()). Note that if the module is not implemented (compiled), the
2133 identities cannot be instantiated in data (in identityrefs). */
Michal Vasko7f45cf22020-10-01 12:49:44 +02002134
2135 struct lys_module **augmented_by;/**< List of modules that augment this module ([sized array](@ref sizedarrays)) */
2136 struct lys_module **deviated_by; /**< List of modules that deviate this module ([sized array](@ref sizedarrays)) */
2137
Michal Vasko89b5c072020-10-06 13:52:44 +02002138 ly_bool implemented; /**< flag if the module is implemented, not just imported */
Michal Vasko01db7de2021-04-16 12:23:30 +02002139 ly_bool to_compile; /**< flag marking a module that was changed but not (re)compiled, see
2140 ::LY_CTX_EXPLICIT_COMPILE. */
aPiecek8ca21bd2021-07-26 14:31:01 +02002141 uint8_t latest_revision; /**< Flag to mark the latest available revision, see [latest_revision options](@ref latestrevflags). */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02002142};
2143
Radek Krejci151a5b72018-10-19 14:21:44 +02002144/**
aPiecek8ca21bd2021-07-26 14:31:01 +02002145 * @defgroup latestrevflags Options for ::lys_module.latest_revision.
2146 *
2147 * Various information bits of ::lys_module.latest_revision.
2148 *
2149 * @{
2150 */
aPiecek94d330b2021-08-04 11:57:31 +02002151#define LYS_MOD_LATEST_REV 0x01 /**< This is the latest revision of the module in the current context. */
2152#define LYS_MOD_LATEST_SEARCHDIRS 0x02 /**< This is the latest revision of the module found in searchdirs. */
Michal Vaskobdac23f2022-01-12 14:02:35 +01002153#define LYS_MOD_IMPORTED_REV 0x04 /**< This is the module revision used when importing the module without
2154 an explicit revision-date. It is used for all such imports regardless of
2155 any changes made in the context. */
2156#define LYS_MOD_LATEST_IMPCLB 0x08 /**< This is the latest revision of the module obtained from import callback. */
aPiecek8ca21bd2021-07-26 14:31:01 +02002157/** @} latestrevflags */
2158
2159/**
Michal Vasko82c31e62020-07-17 15:30:40 +02002160 * @brief Get the current real status of the specified feature in the module.
2161 *
2162 * If the feature is enabled, but some of its if-features are false, the feature is considered
2163 * disabled.
Radek Krejci151a5b72018-10-19 14:21:44 +02002164 *
2165 * @param[in] module Module where the feature is defined.
2166 * @param[in] feature Name of the feature to inspect.
Michal Vasko82c31e62020-07-17 15:30:40 +02002167 * @return LY_SUCCESS if the feature is enabled,
2168 * @return LY_ENOT if the feature is disabled,
2169 * @return LY_ENOTFOUND if the feature was not found.
Radek Krejci151a5b72018-10-19 14:21:44 +02002170 */
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01002171LIBYANG_API_DECL LY_ERR lys_feature_value(const struct lys_module *module, const char *feature);
Radek Krejcidd4e8d42018-10-16 14:55:43 +02002172
2173/**
Michal Vasko3608d252022-02-28 14:28:12 +01002174 * @brief Get next schema (sibling) node element in the schema order that can be instantiated in a data tree.
2175 * Returned node may be from an augment.
Radek Krejcia3045382018-11-22 14:30:31 +01002176 *
Michal Vasko3608d252022-02-28 14:28:12 +01002177 * ::lys_getnext() is supposed to be called sequentially. In the first call, the @p last parameter is usually NULL
2178 * and function starts returning 1) the first @p parent child (if it is set) or 2) the first top level element of
2179 * @p module. Consequent calls should provide the previously returned node as @p last and the same @p parent and
2180 * @p module parameters.
Radek Krejcia3045382018-11-22 14:30:31 +01002181 *
2182 * Without options, the function is used to traverse only the schema nodes that can be paired with corresponding
Michal Vasko3608d252022-02-28 14:28:12 +01002183 * data nodes in a data tree. By setting some @p options the behavior can be modified to the extent that
Radek Krejcia3045382018-11-22 14:30:31 +01002184 * all the schema nodes are iteratively returned.
2185 *
2186 * @param[in] last Previously returned schema tree node, or NULL in case of the first call.
Michal Vasko3608d252022-02-28 14:28:12 +01002187 * @param[in] parent Parent of the subtree to iterate over. If set, @p module is ignored.
2188 * @param[in] module Module of the top level elements to iterate over. If @p parent is NULL, it must be specified.
Radek Krejcia3045382018-11-22 14:30:31 +01002189 * @param[in] options [ORed options](@ref sgetnextflags).
Michal Vasko3608d252022-02-28 14:28:12 +01002190 * @return Next schema tree node, NULL in case there are no more.
Radek Krejcia3045382018-11-22 14:30:31 +01002191 */
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01002192LIBYANG_API_DECL const struct lysc_node *lys_getnext(const struct lysc_node *last, const struct lysc_node *parent,
Radek Krejci1deb5be2020-08-26 16:43:36 +02002193 const struct lysc_module *module, uint32_t options);
Radek Krejcia3045382018-11-22 14:30:31 +01002194
2195/**
Michal Vasko3608d252022-02-28 14:28:12 +01002196 * @brief Get next schema (sibling) node element in the schema order of an extension that can be instantiated in
2197 * a data tree.
Radek Krejci8678fa42020-08-18 16:07:28 +02002198 *
Michal Vasko3608d252022-02-28 14:28:12 +01002199 * It is just ::lys_getnext() for extensions.
Radek Krejci035dacf2021-02-12 18:25:53 +01002200 *
2201 * @param[in] last Previously returned schema tree node, or NULL in case of the first call.
Michal Vasko3608d252022-02-28 14:28:12 +01002202 * @param[in] parent Parent of the subtree to iterate over. If set, @p ext is ignored.
2203 * @param[in] ext Extension instance with schema nodes to iterate over. If @p parent is NULL, it must be specified.
Radek Krejci035dacf2021-02-12 18:25:53 +01002204 * @param[in] options [ORed options](@ref sgetnextflags).
Michal Vasko3608d252022-02-28 14:28:12 +01002205 * @return Next schema tree node, NULL in case there are no more.
Radek Krejci035dacf2021-02-12 18:25:53 +01002206 */
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01002207LIBYANG_API_DECL const struct lysc_node *lys_getnext_ext(const struct lysc_node *last, const struct lysc_node *parent,
Radek Krejci035dacf2021-02-12 18:25:53 +01002208 const struct lysc_ext_instance *ext, uint32_t options);
2209
2210/**
2211 * @defgroup sgetnextflags Options for ::lys_getnext() and ::lys_getnext_ext().
2212 *
2213 * Various options setting behavior of ::lys_getnext() and ::lys_getnext_ext().
Radek Krejci8678fa42020-08-18 16:07:28 +02002214 *
Radek Krejcia3045382018-11-22 14:30:31 +01002215 * @{
2216 */
Radek Krejci8678fa42020-08-18 16:07:28 +02002217#define LYS_GETNEXT_WITHCHOICE 0x01 /**< ::lys_getnext() option to allow returning #LYS_CHOICE nodes instead of looking into them */
2218#define LYS_GETNEXT_NOCHOICE 0x02 /**< ::lys_getnext() option to ignore (kind of conditional) nodes within choice node */
2219#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 +01002220#define LYS_GETNEXT_INTONPCONT 0x08 /**< ::lys_getnext() option to look into non-presence container, instead of returning container itself */
2221#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 +01002222 provided by default */
Michal Vaskoe482bb92023-02-01 11:41:41 +01002223#define LYS_GETNEXT_WITHSCHEMAMOUNT 0x20 /**< ::lys_getnext() option to also traverse top-level nodes of all the mounted modules
2224 on the parent mount point but note that if any such nodes are returned,
2225 the caller **must free** their context */
Radek Krejcia3045382018-11-22 14:30:31 +01002226/** @} sgetnextflags */
2227
2228/**
2229 * @brief Get child node according to the specified criteria.
2230 *
2231 * @param[in] parent Optional parent of the node to find. If not specified, the module's top-level nodes are searched.
2232 * @param[in] module module of the node to find. It is also limitation for the children node of the given parent.
2233 * @param[in] name Name of the node to find.
2234 * @param[in] name_len Optional length of the name in case it is not NULL-terminated string.
2235 * @param[in] nodetype Optional criteria (to speedup) specifying nodetype(s) of the node to find.
2236 * Used as a bitmask, so multiple nodetypes can be specified.
2237 * @param[in] options [ORed options](@ref sgetnextflags).
2238 * @return Found node if any.
2239 */
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01002240LIBYANG_API_DECL const struct lysc_node *lys_find_child(const struct lysc_node *parent, const struct lys_module *module,
Radek Krejci1deb5be2020-08-26 16:43:36 +02002241 const char *name, size_t name_len, uint16_t nodetype, uint32_t options);
Radek Krejcia3045382018-11-22 14:30:31 +01002242
2243/**
Radek Krejci77a8bcd2019-09-11 11:20:02 +02002244 * @brief Make the specific module implemented.
2245 *
Michal Vaskoe8988e92021-01-25 11:26:29 +01002246 * If the module is already implemented but with a different set of features, the whole context is recompiled.
2247 *
Radek Krejci77a8bcd2019-09-11 11:20:02 +02002248 * @param[in] mod Module to make implemented. It is not an error
2249 * to provide already implemented module, it just does nothing.
Michal Vaskoe8988e92021-01-25 11:26:29 +01002250 * @param[in] features Optional array specifying the enabled features terminated with NULL overriding any previous
2251 * feature setting. The feature string '*' enables all the features and array of length 1 with only the terminating
2252 * NULL explicitly disables all the features. In case the parameter is NULL, the features are untouched - left disabled
2253 * in a newly implemented module or with the current features settings in case the module is already implemented.
Michal Vaskoe444f752020-02-10 12:20:06 +01002254 * @return LY_SUCCESS on success.
2255 * @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 +01002256 * @return LY_ERR on other errors during module compilation.
Radek Krejci77a8bcd2019-09-11 11:20:02 +02002257 */
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01002258LIBYANG_API_DECL LY_ERR lys_set_implemented(struct lys_module *mod, const char **features);
Radek Krejcia3045382018-11-22 14:30:31 +01002259
Radek Krejci084289f2019-07-09 17:35:30 +02002260/**
Radek Krejci0935f412019-08-20 16:15:18 +02002261 * @brief Stringify schema nodetype.
Michal Vaskod43d71a2020-08-07 14:54:58 +02002262 *
Radek Krejci0935f412019-08-20 16:15:18 +02002263 * @param[in] nodetype Nodetype to stringify.
2264 * @return Constant string with the name of the node's type.
2265 */
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01002266LIBYANG_API_DECL const char *lys_nodetype2str(uint16_t nodetype);
Radek Krejci0935f412019-08-20 16:15:18 +02002267
Michal Vaskod43d71a2020-08-07 14:54:58 +02002268/**
2269 * @brief Getter for original XPath expression from a parsed expression.
2270 *
2271 * @param[in] path Parsed expression.
2272 * @return Original string expression.
2273 */
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01002274LIBYANG_API_DECL const char *lyxp_get_expr(const struct lyxp_expr *path);
Michal Vaskod43d71a2020-08-07 14:54:58 +02002275
Radek Krejci2ff0d572020-05-21 15:27:28 +02002276/** @} schematree */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02002277
Radek Krejci70853c52018-10-15 14:46:16 +02002278#ifdef __cplusplus
2279}
2280#endif
2281
Radek Krejci5aeea3a2018-09-05 13:29:36 +02002282#endif /* LY_TREE_SCHEMA_H_ */