blob: bcf92d4488ac2200b69e5be56d9810b1b9c6f575 [file] [log] [blame]
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001/**
2 * @file tree_schema.h
3 * @author Radek Krejci <rkrejci@cesnet.cz>
4 * @brief libyang representation of YANG schema trees.
5 *
6 * Copyright (c) 2015 - 2018 CESNET, z.s.p.o.
7 *
8 * This source code is licensed under BSD 3-Clause License (the "License").
9 * You may not use this file except in compliance with the License.
10 * You may obtain a copy of the License at
11 *
12 * https://opensource.org/licenses/BSD-3-Clause
13 */
14
15#ifndef LY_TREE_SCHEMA_H_
16#define LY_TREE_SCHEMA_H_
17
Radek Krejci2167ee12018-11-02 16:09:07 +010018#include <pcre.h>
Radek Krejci5aeea3a2018-09-05 13:29:36 +020019#include <stdint.h>
20
Radek Krejcice8c1592018-10-29 15:35:51 +010021#include "extensions.h"
22
Radek Krejci70853c52018-10-15 14:46:16 +020023#ifdef __cplusplus
24extern "C" {
25#endif
26
Radek Krejci5aeea3a2018-09-05 13:29:36 +020027/**
Radek Krejcidd4e8d42018-10-16 14:55:43 +020028 * @brief XPath representation.
29 */
30struct lyxp_expr;
31
32/**
Radek Krejcie53a8dc2018-10-17 12:52:40 +020033 * @brief Macro selector for other LY_ARRAY_* macros, do not use directly!
34 */
35#define LY_ARRAY_SELECT(_1, _2, NAME, ...) NAME
36
37/**
Radek Krejcie53a8dc2018-10-17 12:52:40 +020038 * @brief Helper macro to go through sized-arrays with a pointer iterator.
39 *
40 * Use with opening curly bracket (`{`).
41 *
42 * @param[in] ARRAY Array to go through
43 * @param[in] TYPE Type of the records in the ARRAY
44 * @param[out] ITER Iterating pointer to the item being processed in each loop
45 */
46#define LY_ARRAY_FOR_ITER(ARRAY, TYPE, ITER) \
Radek Krejci2c4e7172018-10-19 15:56:26 +020047 for (ITER = ARRAY; \
48 (ARRAY) && ((void*)ITER - (void*)ARRAY)/(sizeof(TYPE)) < (*((uint32_t*)(ARRAY) - 1)); \
Radek Krejcie53a8dc2018-10-17 12:52:40 +020049 ITER = (void*)((TYPE*)ITER + 1))
50
51/**
52 * @brief Helper macro to go through sized-arrays with a numeric iterator.
53 *
54 * Use with opening curly bracket (`{`).
55 *
56 * To access an item with the INDEX value, use always LY_ARRAY_INDEX macro!
57 *
58 * @param[in] ARRAY Array to go through
59 * @param[out] INDEX Iterating index of the item being processed in each loop
60 */
61#define LY_ARRAY_FOR_INDEX(ARRAY, INDEX) \
62 for (INDEX = 0; \
Radek Krejci2c4e7172018-10-19 15:56:26 +020063 ARRAY && INDEX < (*((uint32_t*)(ARRAY) - 1)); \
Radek Krejcie53a8dc2018-10-17 12:52:40 +020064 ++INDEX)
65
66/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +020067 * @defgroup schematree Schema Tree
68 * @{
69 *
70 * Data structures and functions to manipulate and access schema tree.
71 */
72
Radek Krejci0af5f5d2018-09-07 15:00:30 +020073/**
Radek Krejcie53a8dc2018-10-17 12:52:40 +020074 * @brief Get a number of records in the ARRAY.
Radek Krejci86d106e2018-10-18 09:53:19 +020075 *
76 * Does not check if array exists!
Radek Krejcie53a8dc2018-10-17 12:52:40 +020077 */
Radek Krejci2c4e7172018-10-19 15:56:26 +020078#define LY_ARRAY_SIZE(ARRAY) (*((uint32_t*)(ARRAY) - 1))
Radek Krejcie53a8dc2018-10-17 12:52:40 +020079
80/**
81 * @brief Sized-array iterator (for-loop).
82 *
83 * Use with opening curly bracket (`{`).
84 *
85 * There are 2 variants:
86 *
87 * LY_ARRAY_FOR(ARRAY, TYPE, ITER)
88 *
89 * Where ARRAY is a sized-array to go through, TYPE is the type of the items in the ARRAY and ITER is a pointer variable
90 * providing the items of the ARRAY in the loops. This functionality is provided by LY_ARRAY_FOR_ITER macro
91 *
92 * LY_ARRAY_FOR(ARRAY, INDEX)
93 *
94 * The ARRAY is again a sized-array to go through, the INDEX is a variable (unsigned integer) for storing iterating ARRAY's index
Radek Krejci2c4e7172018-10-19 15:56:26 +020095 * to access the items of ARRAY in the loops. This functionality is provided by LY_ARRAY_FOR_INDEX macro.
Radek Krejcie53a8dc2018-10-17 12:52:40 +020096 */
97#define LY_ARRAY_FOR(ARRAY, ...) LY_ARRAY_SELECT(__VA_ARGS__, LY_ARRAY_FOR_ITER, LY_ARRAY_FOR_INDEX)(ARRAY, __VA_ARGS__)
Radek Krejci5fac3592018-10-12 15:23:45 +020098
99/**
100 * @brief Macro to iterate via all sibling elements without affecting the list itself
101 *
102 * Works for all types of nodes despite it is data or schema tree, but all the
103 * parameters must be pointers to the same type.
104 *
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200105 * Use with opening curly bracket (`{`). All parameters must be of the same type.
Radek Krejci5fac3592018-10-12 15:23:45 +0200106 *
107 * @param START Pointer to the starting element.
108 * @param ELEM Iterator.
109 */
110#define LY_LIST_FOR(START, ELEM) \
111 for ((ELEM) = (START); \
112 (ELEM); \
113 (ELEM) = (ELEM)->next)
114
115/**
Radek Krejci5fac3592018-10-12 15:23:45 +0200116 * @brief Macro to iterate via all sibling elements allowing to modify the list itself (e.g. removing elements)
117 *
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200118 * Use with opening curly bracket (`{`). All parameters must be of the same type.
Radek Krejci5fac3592018-10-12 15:23:45 +0200119 *
120 * @param START Pointer to the starting element.
121 * @param NEXT Temporary storage to allow removing of the current iterator content.
122 * @param ELEM Iterator.
123 */
124#define LY_LIST_FOR_SAFE(START, NEXT, ELEM) \
125 for ((ELEM) = (START); \
126 (ELEM) ? (NEXT = (ELEM)->next, 1) : 0; \
127 (ELEM) = (NEXT))
128
129/**
Radek Krejci0af5f5d2018-09-07 15:00:30 +0200130 * @brief Schema input formats accepted by libyang [parser functions](@ref howtoschemasparsers).
131 */
132typedef enum {
133 LYS_IN_UNKNOWN = 0, /**< unknown format, used as return value in case of error */
134 LYS_IN_YANG = 1, /**< YANG schema input format */
135 LYS_IN_YIN = 2 /**< YIN schema input format */
136} LYS_INFORMAT;
137
138/**
139 * @brief Schema output formats accepted by libyang [printer functions](@ref howtoschemasprinters).
140 */
141typedef enum {
142 LYS_OUT_UNKNOWN = 0, /**< unknown format, used as return value in case of error */
143 LYS_OUT_YANG = 1, /**< YANG schema output format */
144 LYS_OUT_YIN = 2, /**< YIN schema output format */
145 LYS_OUT_TREE, /**< Tree schema output format, for more information see the [printers](@ref howtoschemasprinters) page */
146 LYS_OUT_INFO, /**< Info schema output format, for more information see the [printers](@ref howtoschemasprinters) page */
147 LYS_OUT_JSON, /**< JSON schema output format, reflecting YIN format with conversion of attributes to object's members */
148} LYS_OUTFORMAT;
149
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200150#define LY_REV_SIZE 11 /**< revision data string length (including terminating NULL byte) */
151
Michal Vaskob55f6c12018-09-12 11:13:15 +0200152#define LYS_UNKNOWN 0x0000 /**< uninitalized unknown statement node */
153#define LYS_CONTAINER 0x0001 /**< container statement node */
154#define LYS_CHOICE 0x0002 /**< choice statement node */
155#define LYS_LEAF 0x0004 /**< leaf statement node */
156#define LYS_LEAFLIST 0x0008 /**< leaf-list statement node */
157#define LYS_LIST 0x0010 /**< list statement node */
158#define LYS_ANYXML 0x0020 /**< anyxml statement node */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200159#define LYS_ANYDATA 0x0120 /**< anydata statement node, in tests it can be used for both #LYS_ANYXML and #LYS_ANYDATA */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200160
Radek Krejcia3045382018-11-22 14:30:31 +0100161#define LYS_CASE 0x0040 /**< case statement node */
162#define LYS_USES 0x0080 /**< uses statement node */
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100163#define LYS_INOUT 0x200
164#define LYS_ACTION 0x400
165#define LYS_NOTIF 0x800
166#define LYS_GROUPING 0x1000
167#define LYS_AUGMENT 0x2000
168
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200169/**
Radek Krejci2167ee12018-11-02 16:09:07 +0100170 * @brief YANG built-in types
171 */
172typedef enum {
173 LY_TYPE_UNKNOWN = 0, /**< Unknown type */
174 LY_TYPE_BINARY, /**< Any binary data ([RFC 6020 sec 9.8](http://tools.ietf.org/html/rfc6020#section-9.8)) */
Radek Krejci5969f272018-11-23 10:03:58 +0100175 LY_TYPE_UINT8, /**< 8-bit unsigned integer ([RFC 6020 sec 9.2](http://tools.ietf.org/html/rfc6020#section-9.2)) */
176 LY_TYPE_UINT16, /**< 16-bit unsigned integer ([RFC 6020 sec 9.2](http://tools.ietf.org/html/rfc6020#section-9.2)) */
177 LY_TYPE_UINT32, /**< 32-bit unsigned integer ([RFC 6020 sec 9.2](http://tools.ietf.org/html/rfc6020#section-9.2)) */
178 LY_TYPE_UINT64, /**< 64-bit unsigned integer ([RFC 6020 sec 9.2](http://tools.ietf.org/html/rfc6020#section-9.2)) */
179 LY_TYPE_STRING, /**< Human-readable string ([RFC 6020 sec 9.4](http://tools.ietf.org/html/rfc6020#section-9.4)) */
Radek Krejci2167ee12018-11-02 16:09:07 +0100180 LY_TYPE_BITS, /**< A set of bits or flags ([RFC 6020 sec 9.7](http://tools.ietf.org/html/rfc6020#section-9.7)) */
181 LY_TYPE_BOOL, /**< "true" or "false" ([RFC 6020 sec 9.5](http://tools.ietf.org/html/rfc6020#section-9.5)) */
182 LY_TYPE_DEC64, /**< 64-bit signed decimal number ([RFC 6020 sec 9.3](http://tools.ietf.org/html/rfc6020#section-9.3))*/
183 LY_TYPE_EMPTY, /**< A leaf that does not have any value ([RFC 6020 sec 9.11](http://tools.ietf.org/html/rfc6020#section-9.11)) */
184 LY_TYPE_ENUM, /**< Enumerated strings ([RFC 6020 sec 9.6](http://tools.ietf.org/html/rfc6020#section-9.6)) */
185 LY_TYPE_IDENT, /**< A reference to an abstract identity ([RFC 6020 sec 9.10](http://tools.ietf.org/html/rfc6020#section-9.10)) */
186 LY_TYPE_INST, /**< References a data tree node ([RFC 6020 sec 9.13](http://tools.ietf.org/html/rfc6020#section-9.13)) */
187 LY_TYPE_LEAFREF, /**< A reference to a leaf instance ([RFC 6020 sec 9.9](http://tools.ietf.org/html/rfc6020#section-9.9))*/
Radek Krejci2167ee12018-11-02 16:09:07 +0100188 LY_TYPE_UNION, /**< Choice of member types ([RFC 6020 sec 9.12](http://tools.ietf.org/html/rfc6020#section-9.12)) */
189 LY_TYPE_INT8, /**< 8-bit signed integer ([RFC 6020 sec 9.2](http://tools.ietf.org/html/rfc6020#section-9.2)) */
Radek Krejci2167ee12018-11-02 16:09:07 +0100190 LY_TYPE_INT16, /**< 16-bit signed integer ([RFC 6020 sec 9.2](http://tools.ietf.org/html/rfc6020#section-9.2)) */
Radek Krejci2167ee12018-11-02 16:09:07 +0100191 LY_TYPE_INT32, /**< 32-bit signed integer ([RFC 6020 sec 9.2](http://tools.ietf.org/html/rfc6020#section-9.2)) */
Radek Krejci2167ee12018-11-02 16:09:07 +0100192 LY_TYPE_INT64, /**< 64-bit signed integer ([RFC 6020 sec 9.2](http://tools.ietf.org/html/rfc6020#section-9.2)) */
Radek Krejci2167ee12018-11-02 16:09:07 +0100193} LY_DATA_TYPE;
194#define LY_DATA_TYPE_COUNT 20 /**< Number of different types */
195
Radek Krejci5969f272018-11-23 10:03:58 +0100196/**
197 * @brief Stringified YANG built-in data types
198 */
Radek Krejcid505e3d2018-11-13 09:04:17 +0100199extern const char* ly_data_type2str[LY_DATA_TYPE_COUNT];
200
Radek Krejci2167ee12018-11-02 16:09:07 +0100201/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200202 * @brief YANG import-stmt
203 */
204struct lysp_import {
Radek Krejci086c7132018-10-26 15:29:04 +0200205 struct lys_module *module; /**< pointer to the imported module
206 (mandatory, but resolved when the referring module is completely parsed) */
207 const char *name; /**< name of the imported module (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200208 const char *prefix; /**< prefix for the data from the imported schema (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200209 const char *dsc; /**< description */
210 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200211 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200212 char rev[LY_REV_SIZE]; /**< revision-date of the imported module */
213};
214
215/**
216 * @brief YANG include-stmt
217 */
218struct lysp_include {
Radek Krejci0bcdaed2019-01-10 10:21:34 +0100219 struct lysp_submodule *submodule;/**< pointer to the parsed submodule structure
Radek Krejci086c7132018-10-26 15:29:04 +0200220 (mandatory, but resolved when the referring module is completely parsed) */
221 const char *name; /**< name of the included submodule (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200222 const char *dsc; /**< description */
223 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200224 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200225 char rev[LY_REV_SIZE]; /**< revision-date of the included submodule */
226};
227
228/**
229 * @brief YANG extension-stmt
230 */
231struct lysp_ext {
232 const char *name; /**< extension name */
233 const char *argument; /**< argument name, NULL if not specified */
234 const char *dsc; /**< description statement */
235 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200236 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200237 uint16_t flags; /**< LYS_STATUS_* and LYS_YINELEM values (@ref snodeflags) */
238};
239
240/**
241 * @brief Helper structure for generic storage of the extension instances content.
242 */
243struct lysp_stmt {
244 const char *stmt; /**< identifier of the statement */
245 const char *arg; /**< statement's argument */
246 struct lysp_stmt *next; /**< link to the next statement */
Michal Vaskobc2559f2018-09-07 10:17:50 +0200247 struct lysp_stmt *child; /**< list of the statement's substatements (linked list) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200248};
249
250/**
251 * @brief YANG extension instance
252 */
253struct lysp_ext_instance {
254 const char *name; /**< extension identifier, including possible prefix */
255 const char *argument; /**< optional value of the extension's argument */
Michal Vaskod92e42a2018-09-07 08:35:02 +0200256 LYEXT_SUBSTMT insubstmt; /**< value identifying placement of the extension instance */
257 uint32_t insubstmt_index; /**< in case the instance is in a substatement, this identifies
258 the index of that substatement */
Michal Vaskobc2559f2018-09-07 10:17:50 +0200259 struct lysp_stmt *child; /**< list of the extension's substatements (linked list) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200260};
261
262/**
263 * @brief YANG feature-stmt
264 */
265struct lysp_feature {
266 const char *name; /**< feature name (mandatory) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200267 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200268 const char *dsc; /**< description statement */
269 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200270 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200271 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values allowed */
272};
273
274/**
275 * @brief YANG identity-stmt
276 */
277struct lysp_ident {
278 const char *name; /**< identity name (mandatory), including possible prefix */
Radek Krejci151a5b72018-10-19 14:21:44 +0200279 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
280 const char **bases; /**< list of base identifiers ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200281 const char *dsc; /**< description statement */
282 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200283 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200284 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_ values are allowed */
285};
286
Michal Vasko71e64ca2018-09-07 16:30:29 +0200287/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200288 * @brief Covers restrictions: range, length, pattern, must
289 */
290struct lysp_restr {
291 const char *arg; /**< The restriction expression/value (mandatory);
292 in case of pattern restriction, the first byte has a special meaning:
293 0x06 (ACK) for regular match and 0x15 (NACK) for invert-match */
294 const char *emsg; /**< error-message */
295 const char *eapptag; /**< error-app-tag value */
296 const char *dsc; /**< description */
297 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200298 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200299};
300
301/**
Michal Vasko71e64ca2018-09-07 16:30:29 +0200302 * @brief YANG revision-stmt
303 */
304struct lysp_revision {
Radek Krejcib7db73a2018-10-24 14:18:40 +0200305 char date[LY_REV_SIZE]; /**< revision date (madatory) */
Michal Vasko71e64ca2018-09-07 16:30:29 +0200306 const char *dsc; /**< description statement */
307 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200308 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vasko71e64ca2018-09-07 16:30:29 +0200309};
310
311/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200312 * @brief Enumeration/Bit value definition
313 */
314struct lysp_type_enum {
315 const char *name; /**< name (mandatory) */
316 const char *dsc; /**< description statement */
317 const char *ref; /**< reference statement */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200318 int64_t value; /**< enum's value or bit's position */
Radek Krejci151a5b72018-10-19 14:21:44 +0200319 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200320 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200321 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_ and LYS_SET_VALUE
322 values are allowed */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200323};
324
325/**
326 * @brief YANG type-stmt
327 *
328 * Some of the items in the structure may be mandatory, but it is necessary to resolve the type's base type first
329 */
330struct lysp_type {
331 const char *name; /**< name of the type (mandatory) */
332 struct lysp_restr *range; /**< allowed values range - numerical, decimal64 */
333 struct lysp_restr *length; /**< allowed length of the value - string, binary */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200334 struct lysp_restr *patterns; /**< list of patterns ([sized array](@ref sizedarrays)) - string */
335 struct lysp_type_enum *enums; /**< list of enum-stmts ([sized array](@ref sizedarrays)) - enum */
336 struct lysp_type_enum *bits; /**< list of bit-stmts ([sized array](@ref sizedarrays)) - bits */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200337 const char *path; /**< path - leafref */
Radek Krejci151a5b72018-10-19 14:21:44 +0200338 const char **bases; /**< list of base identifiers ([sized array](@ref sizedarrays)) - identityref */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200339 struct lysp_type *types; /**< list of sub-types ([sized array](@ref sizedarrays)) - union */
340 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200341
Radek Krejci2167ee12018-11-02 16:09:07 +0100342 struct lysc_type *compiled; /**< pointer to the compiled type */
343
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200344 uint8_t fraction_digits; /**< number of fraction digits - decimal64 */
345 uint8_t require_instance; /**< require-instance flag - leafref, instance */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100346 uint16_t flags; /**< [schema node flags](@ref spnodeflags) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200347};
348
349/**
350 * @brief YANG typedef-stmt
351 */
352struct lysp_tpdf {
353 const char *name; /**< name of the newly defined type (mandatory) */
354 const char *units; /**< units of the newly defined type */
355 const char *dflt; /**< default value of the newly defined type */
356 const char *dsc; /**< description statement */
357 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200358 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200359 struct lysp_type type; /**< base type from which the typedef is derived (mandatory) */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100360 uint16_t flags; /**< [schema node flags](@ref spnodeflags) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200361};
362
363/**
364 * @brief YANG grouping-stmt
365 */
366struct lysp_grp {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100367 struct lysp_node *parent; /**< parent node (NULL if this is a top-level grouping) */
368 uint16_t nodetype; /**< LYS_GROUPING */
369 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values are allowed */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200370 const char *name; /**< grouping name (mandatory) */
371 const char *dsc; /**< description statement */
372 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200373 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
374 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200375 struct lysp_node *data; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200376 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
377 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
378 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200379};
380
381/**
382 * @brief YANG when-stmt
383 */
384struct lysp_when {
385 const char *cond; /**< specified condition (mandatory) */
386 const char *dsc; /**< description statement */
387 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200388 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200389};
390
391/**
392 * @brief YANG refine-stmt
393 */
394struct lysp_refine {
395 const char *nodeid; /**< target descendant schema nodeid (mandatory) */
396 const char *dsc; /**< description statement */
397 const char *ref; /**< reference statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200398 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200399 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200400 const char *presence; /**< presence description */
Radek Krejci151a5b72018-10-19 14:21:44 +0200401 const char **dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200402 uint32_t min; /**< min-elements constraint */
403 uint32_t max; /**< max-elements constraint, 0 means unbounded */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200404 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200405 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
406};
407
408/**
409 * @brief YANG uses-augment-stmt and augment-stmt
410 */
411struct lysp_augment {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100412 struct lysp_node *parent; /**< parent node (NULL if this is a top-level augment) */
413 uint16_t nodetype; /**< LYS_AUGMENT */
414 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values are allowed */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200415 const char *nodeid; /**< target schema nodeid (mandatory) - absolute for global augments, descendant for uses's augments */
416 const char *dsc; /**< description statement */
417 const char *ref; /**< reference statement */
418 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200419 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200420 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200421 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
422 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
423 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200424};
425
426/**
427 * @defgroup deviatetypes Deviate types
428 * @{
429 */
430#define LYS_DEV_NOT_SUPPORTED 1 /**< deviate type not-supported */
431#define LYS_DEV_ADD 2 /**< deviate type add */
432#define LYS_DEV_DELETE 3 /**< deviate type delete */
433#define LYS_DEV_REPLACE 4 /**< deviate type replace */
434/** @} */
435
436/**
437 * @brief Generic deviate structure to get type and cast to lysp_deviate_* structure
438 */
439struct lysp_deviate {
440 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
441 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200442 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200443};
444
445struct lysp_deviate_add {
446 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
447 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200448 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200449 const char *units; /**< units of the values */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200450 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200451 const char **uniques; /**< list of uniques specifications ([sized array](@ref sizedarrays)) */
452 const char **dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200453 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
454 uint32_t min; /**< min-elements constraint */
455 uint32_t max; /**< max-elements constraint, 0 means unbounded */
456};
457
458struct lysp_deviate_del {
459 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
460 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200461 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200462 const char *units; /**< units of the values */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200463 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200464 const char **uniques; /**< list of uniques specifications ([sized array](@ref sizedarrays)) */
465 const char **dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200466 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200467};
468
469struct lysp_deviate_rpl {
470 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
471 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200472 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200473 struct lysp_type *type; /**< type of the node */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200474 const char *units; /**< units of the values */
475 const char *dflt; /**< default value */
476 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
477 uint32_t min; /**< min-elements constraint */
478 uint32_t max; /**< max-elements constraint, 0 means unbounded */
479};
480
481struct lysp_deviation {
Michal Vaskob55f6c12018-09-12 11:13:15 +0200482 const char *nodeid; /**< target absolute schema nodeid (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200483 const char *dsc; /**< description statement */
484 const char *ref; /**< reference statement */
485 struct lysp_deviate* deviates; /**< list of deviate specifications (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200486 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200487};
488
Radek Krejci4f28eda2018-11-12 11:46:16 +0100489/**
490 * @defgroup spnodeflags Parsed schema nodes flags
491 * @ingroup snodeflags
492 *
493 * Various flags for parsed schema nodes.
494 *
495 * 1 - container 6 - anydata/anyxml 11 - output 16 - grouping 21 - enum
496 * 2 - choice 7 - case 12 - feature 17 - uses 22 - type
497 * 3 - leaf 8 - notification 13 - identity 18 - refine
498 * 4 - leaflist 9 - rpc 14 - extension 19 - augment
499 * 5 - list 10 - input 15 - typedef 20 - deviate
500 *
501 * 1 1 1 1 1 1 1 1 1 1 2 2 2
502 * bit name 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2
503 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
504 * 1 LYS_CONFIG_W |x|x|x|x|x|x|x| | | | | | | | | | |x| |x| | |
Radek Krejcid505e3d2018-11-13 09:04:17 +0100505 * LYS_SET_BASE | | | | | | | | | | | | | | | | | | | | | |x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100506 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
507 * 2 LYS_CONFIG_R |x|x|x|x|x|x|x| | | | | | | | | | |x| |x| | |
Radek Krejcid505e3d2018-11-13 09:04:17 +0100508 * LYS_SET_BIT | | | | | | | | | | | | | | | | | | | | | |x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100509 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
510 * 3 LYS_STATUS_CURR |x|x|x|x|x|x|x|x|x| | |x|x|x|x|x|x| |x|x|x| |
Radek Krejcid505e3d2018-11-13 09:04:17 +0100511 * LYS_SET_ENUM | | | | | | | | | | | | | | | | | | | | | |x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100512 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
513 * 4 LYS_STATUS_DEPRC |x|x|x|x|x|x|x|x|x| | |x|x|x|x|x|x| |x|x|x| |
Radek Krejcid505e3d2018-11-13 09:04:17 +0100514 * LYS_SET_FRDIGITS | | | | | | | | | | | | | | | | | | | | | |x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100515 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
516 * 5 LYS_STATUS_OBSLT |x|x|x|x|x|x|x|x|x| | |x|x|x|x|x|x| |x|x|x| |
Radek Krejcid505e3d2018-11-13 09:04:17 +0100517 * LYS_SET_LENGTH | | | | | | | | | | | | | | | | | | | | | |x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100518 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
519 * 6 LYS_MAND_TRUE | |x|x| | |x| | | | | | | | | | | |x| |x| | |
520 * LYS_ORDBY_SYSTEM | | | |x|x| | | | | | | | | | | | | | | | | |
Radek Krejcid505e3d2018-11-13 09:04:17 +0100521 * LYS_SET_PATH | | | | | | | | | | | | | | | | | | | | | |x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100522 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
523 * 7 LYS_MAND_FALSE | |x|x| | |x| | | | | | | | | | | |x| |x| | |
524 * LYS_ORDBY_USER | | | |x|x| | | | | | | | | | | | | | | | | |
Radek Krejcid505e3d2018-11-13 09:04:17 +0100525 * LYS_SET_PATTERN | | | | | | | | | | | | | | | | | | | | | |x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100526 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
527 * 8 LYS_YINELEM_TRUE | | | | | | | | | | | | | |x| | | | | | | | |
Radek Krejcid505e3d2018-11-13 09:04:17 +0100528 * LYS_SET_RANGE | | | | | | | | | | | | | | | | | | | | | |x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100529 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
530 * 9 LYS_YINELEM_FALSE| | | | | | | | | | | | | |x| | | | | | | | |
Radek Krejcid505e3d2018-11-13 09:04:17 +0100531 * LYS_SET_TYPE | | | | | | | | | | | | | | | | | | | | | |x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100532 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
533 * 10 LYS_SET_VALUE | | | | | | | | | | | | | | | | | | | | |x| |
534 * LYS_SET_REQINST | | | | | | | | | | | | | | | | | | | | | |x|
535 * LYS_SET_MIN | | | |x|x| | | | | | | | | | | | |x| |x| | |
536 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
537 * 11 LYS_SET_MAX | | | |x|x| | | | | | | | | | | | |x| |x| | |
Radek Krejci4f28eda2018-11-12 11:46:16 +0100538 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
539 *
540 */
541
542/**
543 * @defgroup scnodeflags Compiled schema nodes flags
544 * @ingroup snodeflags
545 *
546 * Various flags for compiled schema nodes.
547 *
548 * 1 - container 6 - anydata/anyxml 11 - output
549 * 2 - choice 7 - case 12 - feature
550 * 3 - leaf 8 - notification 13 - identity
551 * 4 - leaflist 9 - rpc 14 - extension
552 * 5 - list 10 - input
553 *
554 * 1 1 1 1 1
555 * bit name 1 2 3 4 5 6 7 8 9 0 1 2 3 4
556 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
557 * 1 LYS_CONFIG_W |x|x|x|x|x|x|x| | |x| | | | |
558 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
559 * 2 LYS_CONFIG_R |x|x|x|x|x|x|x| | | |x| | | |
560 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Radek Krejci7adf4ff2018-12-05 08:55:00 +0100561 * 3 LYS_STATUS_CURR |x|x|x|x|x|x|x|x|x| | |x|x|x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100562 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Radek Krejci7adf4ff2018-12-05 08:55:00 +0100563 * 4 LYS_STATUS_DEPRC |x|x|x|x|x|x|x|x|x| | |x|x|x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100564 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Radek Krejci7adf4ff2018-12-05 08:55:00 +0100565 * 5 LYS_STATUS_OBSLT |x|x|x|x|x|x|x|x|x| | |x|x|x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100566 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
567 * 6 LYS_MAND_TRUE | |x|x| | |x| | | | | | | | |
Radek Krejci0e5d8382018-11-28 16:37:53 +0100568 * LYS_ORDBY_SYSTEM | | | |x|x| | | | | | | | | |
Radek Krejci4f28eda2018-11-12 11:46:16 +0100569 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
570 * 7 LYS_ORDBY_USER | | | |x|x| | | | | | | | | |
Radek Krejci7adf4ff2018-12-05 08:55:00 +0100571 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
572 * 8 LYS_PRESENCE |x| | | | | | | | | | | | | |
573 * LYS_UNIQUE | | |x| | | | | | | | | | | |
574 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
575 * 9 LYS_KEY | | |x| | | | | | | | | | | |
576 * LYS_FENABLED | | | | | | | | | | | |x| | |
Radek Krejci76b3e962018-12-14 17:01:25 +0100577 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
578 * 10 LYS_SET_DFLT | | |x| | | |x| | | | | | | |
Radek Krejci4f28eda2018-11-12 11:46:16 +0100579 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
580 *
581 */
582
583/**
584 * @defgroup snodeflags Schema nodes flags
585 * @ingroup schematree
586 * @{
587 */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200588#define LYS_CONFIG_W 0x01 /**< config true; */
589#define LYS_CONFIG_R 0x02 /**< config false; */
590#define LYS_CONFIG_MASK 0x03 /**< mask for config value */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100591#define LYS_STATUS_CURR 0x04 /**< status current; */
592#define LYS_STATUS_DEPRC 0x08 /**< status deprecated; */
593#define LYS_STATUS_OBSLT 0x10 /**< status obsolete; */
594#define LYS_STATUS_MASK 0x1C /**< mask for status value */
595#define LYS_MAND_TRUE 0x20 /**< mandatory true; applicable only to ::lysp_node_choice/::lysc_node_choice,
596 ::lysp_node_leaf/::lysc_node_leaf and ::lysp_node_anydata/::lysc_node_anydata */
Radek Krejci01342af2019-01-03 15:18:08 +0100597#define LYS_MAND_FALSE 0x40 /**< mandatory false; applicable only to ::lysp_node_choice, ::lysp_node_leaf and ::lysp_node_anydata */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100598#define LYS_MAND_MASK 0x60 /**< mask for mandatory values */
Radek Krejci7adf4ff2018-12-05 08:55:00 +0100599#define LYS_PRESENCE 0x80 /**< flag for presence property of a container, applicable only to ::lysc_node_container */
600#define LYS_UNIQUE 0x80 /**< flag for leafs being part of a unique set, applicable only to ::lysc_node_leaf */
601#define LYS_KEY 0x100 /**< flag for leafs being a key of a list, applicable only to ::lysc_node_leaf */
602#define LYS_FENABLED 0x100 /**< feature enabled flag, applicable only to ::lysc_feature */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100603#define LYS_ORDBY_SYSTEM 0x20 /**< ordered-by user lists, applicable only to ::lysc_node_leaflist/::lysp_node_leaflist and
604 ::lysc_node_list/::lysp_node_list */
605#define LYS_ORDBY_USER 0x40 /**< ordered-by user lists, applicable only to ::lysc_node_leaflist/::lysp_node_leaflist and
606 ::lysc_node_list/::lysp_node_list */
607#define LYS_ORDBY_MASK 0x60 /**< mask for ordered-by values */
608#define LYS_YINELEM_TRUE 0x80 /**< yin-element true for extension's argument */
609#define LYS_YINELEM_FALSE 0x100 /**< yin-element false for extension's argument */
610#define LYS_YINELEM_MASK 0x180 /**< mask for yin-element value */
611#define LYS_SET_VALUE 0x200 /**< value attribute is set */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100612#define LYS_SET_MIN 0x200 /**< min attribute is set */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200613#define LYS_SET_MAX 0x400 /**< max attribute is set */
Radek Krejcid505e3d2018-11-13 09:04:17 +0100614
615#define LYS_SET_BASE 0x0001 /**< type's flag for present base substatement */
616#define LYS_SET_BIT 0x0002 /**< type's flag for present bit substatement */
617#define LYS_SET_ENUM 0x0004 /**< type's flag for present enum substatement */
618#define LYS_SET_FRDIGITS 0x0008 /**< type's flag for present fraction-digits substatement */
619#define LYS_SET_LENGTH 0x0010 /**< type's flag for present length substatement */
620#define LYS_SET_PATH 0x0020 /**< type's flag for present path substatement */
621#define LYS_SET_PATTERN 0x0040 /**< type's flag for present pattern substatement */
622#define LYS_SET_RANGE 0x0080 /**< type's flag for present range substatement */
623#define LYS_SET_TYPE 0x0100 /**< type's flag for present type substatement */
624#define LYS_SET_REQINST 0x0200 /**< type's flag for present require-instance substatement */
Radek Krejci01342af2019-01-03 15:18:08 +0100625#define LYS_SET_DFLT 0x0200 /**< flag to mark leaf with own (or refined) default value, not a default value taken from its type, and default
Radek Krejci76b3e962018-12-14 17:01:25 +0100626 cases of choice. This information is important for refines, since it is prohibited to make leafs
627 with default statement mandatory. In case the default leaf value is taken from type, it is thrown
628 away when it is refined to be mandatory node. */
Radek Krejci0e5d8382018-11-28 16:37:53 +0100629
630#define LYS_FLAGS_COMPILED_MASK 0x7f /**< mask for flags that maps to the compiled structures */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100631/** @} */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200632
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200633/**
634 * @brief Generic YANG data node
635 */
636struct lysp_node {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100637 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200638 uint16_t nodetype; /**< type of the node (mandatory) */
639 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100640 struct lysp_node *next; /**< next sibling node (NULL if there is no one) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200641 const char *name; /**< node name (mandatory) */
642 const char *dsc; /**< description statement */
643 const char *ref; /**< reference statement */
644 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200645 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200646 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200647};
648
649/**
650 * @brief Extension structure of the lysp_node for YANG container
651 */
652struct lysp_node_container {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100653 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200654 uint16_t nodetype; /**< LYS_CONTAINER */
655 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
656 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
657 const char *name; /**< node name (mandatory) */
658 const char *dsc; /**< description statement */
659 const char *ref; /**< reference statement */
660 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200661 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200662 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200663
664 /* container */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200665 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200666 const char *presence; /**< presence description */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200667 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
668 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200669 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200670 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
671 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200672};
673
674struct lysp_node_leaf {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100675 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200676 uint16_t nodetype; /**< LYS_LEAF */
677 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
678 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
679 const char *name; /**< node name (mandatory) */
680 const char *dsc; /**< description statement */
681 const char *ref; /**< reference statement */
682 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200683 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200684 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200685
686 /* leaf */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200687 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200688 struct lysp_type type; /**< type of the leaf node (mandatory) */
689 const char *units; /**< units of the leaf's type */
690 const char *dflt; /**< default value */
691};
692
693struct lysp_node_leaflist {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100694 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200695 uint16_t nodetype; /**< LYS_LEAFLIST */
696 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
697 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
698 const char *name; /**< node name (mandatory) */
699 const char *dsc; /**< description statement */
700 const char *ref; /**< reference statement */
701 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200702 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200703 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200704
705 /* leaf-list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200706 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200707 struct lysp_type type; /**< type of the leaf node (mandatory) */
708 const char *units; /**< units of the leaf's type */
Radek Krejci151a5b72018-10-19 14:21:44 +0200709 const char **dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200710 uint32_t min; /**< min-elements constraint */
711 uint32_t max; /**< max-elements constraint, 0 means unbounded */
712};
713
714struct lysp_node_list {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100715 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200716 uint16_t nodetype; /**< LYS_LIST */
717 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
718 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
719 const char *name; /**< node name (mandatory) */
720 const char *dsc; /**< description statement */
721 const char *ref; /**< reference statement */
722 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200723 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200724 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200725
726 /* list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200727 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200728 const char *key; /**< keys specification */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200729 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
730 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200731 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200732 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
733 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200734 const char **uniques; /**< list of unique specifications ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200735 uint32_t min; /**< min-elements constraint */
736 uint32_t max; /**< max-elements constraint, 0 means unbounded */
737};
738
739struct lysp_node_choice {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100740 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200741 uint16_t nodetype; /**< LYS_CHOICE */
742 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
743 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
744 const char *name; /**< node name (mandatory) */
745 const char *dsc; /**< description statement */
746 const char *ref; /**< reference statement */
747 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200748 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200749 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200750
751 /* choice */
752 struct lysp_node *child; /**< list of data nodes (linked list) */
753 const char* dflt; /**< default case */
754};
755
756struct lysp_node_case {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100757 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200758 uint16_t nodetype; /**< LYS_CASE */
759 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
760 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
761 const char *name; /**< node name (mandatory) */
762 const char *dsc; /**< description statement */
763 const char *ref; /**< reference statement */
764 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200765 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200766 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200767
768 /* case */
769 struct lysp_node *child; /**< list of data nodes (linked list) */
770};
771
772struct lysp_node_anydata {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100773 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200774 uint16_t nodetype; /**< LYS_ANYXML || LYS_ANYDATA */
775 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
776 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
777 const char *name; /**< node name (mandatory) */
778 const char *dsc; /**< description statement */
779 const char *ref; /**< reference statement */
780 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200781 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200782 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200783
784 /* anyxml/anydata */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200785 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200786};
787
788struct lysp_node_uses {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100789 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200790 uint16_t nodetype; /**< LYS_USES */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200791 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
792 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
793 const char *name; /**< grouping name reference (mandatory) */
794 const char *dsc; /**< description statement */
795 const char *ref; /**< reference statement */
796 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200797 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200798 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200799
800 /* uses */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200801 struct lysp_refine *refines; /**< list of uses's refines ([sized array](@ref sizedarrays)) */
802 struct lysp_augment *augments; /**< list of uses's augment ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200803};
804
805/**
806 * @brief YANG input-stmt and output-stmt
807 */
808struct lysp_action_inout {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100809 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
810 uint16_t nodetype; /**< LYS_INOUT */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200811 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
812 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
813 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200814 struct lysp_node *data; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200815 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200816};
817
818/**
819 * @brief YANG rpc-stmt and action-stmt
820 */
821struct lysp_action {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100822 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
823 uint16_t nodetype; /**< LYS_ACTION */
824 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200825 const char *name; /**< grouping name reference (mandatory) */
826 const char *dsc; /**< description statement */
827 const char *ref; /**< reference statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200828 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200829 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
830 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200831 struct lysp_action_inout *input; /**< RPC's/Action's input */
832 struct lysp_action_inout *output;/**< RPC's/Action's output */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200833 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200834};
835
836/**
837 * @brief YANG notification-stmt
838 */
839struct lysp_notif {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100840 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
841 uint16_t nodetype; /**< LYS_NOTIF */
842 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values are allowed */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200843 const char *name; /**< grouping name reference (mandatory) */
844 const char *dsc; /**< description statement */
845 const char *ref; /**< reference statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200846 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200847 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
848 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
849 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200850 struct lysp_node *data; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200851 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200852};
853
854/**
Radek Krejcif0fceb62018-09-05 14:58:45 +0200855 * @brief supported YANG schema version values
856 */
857typedef enum LYS_VERSION {
858 LYS_VERSION_UNDEF = 0, /**< no specific version, YANG 1.0 as default */
859 LYS_VERSION_1_0 = 1, /**< YANG 1.0 */
860 LYS_VERSION_1_1 = 2 /**< YANG 1.1 */
861} LYS_VERSION;
862
863/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200864 * @brief Printable YANG schema tree structure representing YANG module.
865 *
866 * Simple structure corresponding to the YANG format. The schema is only syntactically validated.
867 */
868struct lysp_module {
Radek Krejci0bcdaed2019-01-10 10:21:34 +0100869 struct lys_module *mod; /**< covering module structure */
870
Radek Krejcib7db73a2018-10-24 14:18:40 +0200871 struct lysp_revision *revs; /**< list of the module revisions ([sized array](@ref sizedarrays)), the first revision
872 in the list is always the last (newest) revision of the module */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200873 struct lysp_import *imports; /**< list of imported modules ([sized array](@ref sizedarrays)) */
874 struct lysp_include *includes; /**< list of included submodules ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200875 struct lysp_ext *extensions; /**< list of extension statements ([sized array](@ref sizedarrays)) */
876 struct lysp_feature *features; /**< list of feature definitions ([sized array](@ref sizedarrays)) */
877 struct lysp_ident *identities; /**< list of identities ([sized array](@ref sizedarrays)) */
878 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
879 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200880 struct lysp_node *data; /**< list of module's top-level data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200881 struct lysp_augment *augments; /**< list of augments ([sized array](@ref sizedarrays)) */
882 struct lysp_action *rpcs; /**< list of RPCs ([sized array](@ref sizedarrays)) */
883 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
884 struct lysp_deviation *deviations; /**< list of deviations ([sized array](@ref sizedarrays)) */
885 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200886
Radek Krejci0bcdaed2019-01-10 10:21:34 +0100887 uint8_t parsing:1; /**< flag for circular check */
888};
889
890struct lysp_submodule {
891 const char *belongsto; /**< belongs to parent module (submodule - mandatory) */
892
893 struct lysp_revision *revs; /**< list of the module revisions ([sized array](@ref sizedarrays)), the first revision
894 in the list is always the last (newest) revision of the module */
895 struct lysp_import *imports; /**< list of imported modules ([sized array](@ref sizedarrays)) */
896 struct lysp_include *includes; /**< list of included submodules ([sized array](@ref sizedarrays)) */
897 struct lysp_ext *extensions; /**< list of extension statements ([sized array](@ref sizedarrays)) */
898 struct lysp_feature *features; /**< list of feature definitions ([sized array](@ref sizedarrays)) */
899 struct lysp_ident *identities; /**< list of identities ([sized array](@ref sizedarrays)) */
900 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
901 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
902 struct lysp_node *data; /**< list of module's top-level data nodes (linked list) */
903 struct lysp_augment *augments; /**< list of augments ([sized array](@ref sizedarrays)) */
904 struct lysp_action *rpcs; /**< list of RPCs ([sized array](@ref sizedarrays)) */
905 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
906 struct lysp_deviation *deviations; /**< list of deviations ([sized array](@ref sizedarrays)) */
907 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
908
909 uint8_t parsing:1; /**< flag for circular check */
910
Radek Krejci086c7132018-10-26 15:29:04 +0200911 uint8_t latest_revision:2; /**< flag to mark the latest available revision:
912 1 - the latest revision in searchdirs was not searched yet and this is the
913 latest revision in the current context
914 2 - searchdirs were searched and this is the latest available revision */
Radek Krejci0bcdaed2019-01-10 10:21:34 +0100915 const char *name; /**< name of the module (mandatory) */
916 const char *filepath; /**< path, if the schema was read from a file, NULL in case of reading from memory */
917 const char *prefix; /**< submodule belongsto prefix of main module (mandatory) */
918 const char *org; /**< party/company responsible for the module */
919 const char *contact; /**< contact information for the module */
920 const char *dsc; /**< description of the module */
921 const char *ref; /**< cross-reference for the module */
Radek Krejci086c7132018-10-26 15:29:04 +0200922 uint8_t version; /**< yang-version (LYS_VERSION values) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200923};
924
925/**
Radek Krejci3f5e3db2018-10-11 15:57:47 +0200926 * @brief Free the printable YANG schema tree structure.
927 *
928 * @param[in] module Printable YANG schema tree structure to free.
929 */
930void lysp_module_free(struct lysp_module *module);
931
932/**
Radek Krejcice8c1592018-10-29 15:35:51 +0100933 * @brief YANG extension instance
934 */
935struct lysc_ext_instance {
936 struct lyext_plugin *plugin; /**< pointer to the plugin implementing the extension (if present) */
937 void *parent; /**< pointer to the parent element holding the extension instance(s), use
938 ::lysc_ext_instance#parent_type to access the schema element */
939 const char *argument; /**< optional value of the extension's argument */
940 LYEXT_SUBSTMT insubstmt; /**< value identifying placement of the extension instance */
941 uint32_t insubstmt_index; /**< in case the instance is in a substatement that can appear multiple times,
942 this identifies the index of the substatement for this extension instance */
Radek Krejci2a408df2018-10-29 16:32:26 +0100943 LYEXT_PARENT parent_type; /**< type of the parent structure */
Radek Krejcice8c1592018-10-29 15:35:51 +0100944#if 0
Radek Krejcice8c1592018-10-29 15:35:51 +0100945 uint8_t ext_type; /**< extension type (#LYEXT_TYPE) */
946 uint8_t padding; /**< 32b padding */
Radek Krejcice8c1592018-10-29 15:35:51 +0100947 struct lys_module *module; /**< pointer to the extension instance's module (mandatory) */
948 LYS_NODE nodetype; /**< LYS_EXT */
949#endif
Radek Krejci2a408df2018-10-29 16:32:26 +0100950 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
951 void *priv; /**< private caller's data, not used by libyang */
Radek Krejcice8c1592018-10-29 15:35:51 +0100952};
953
954/**
Radek Krejcibd8d9ba2018-11-02 16:06:26 +0100955 * @brief Compiled YANG if-feature-stmt
956 */
957struct lysc_iffeature {
958 uint8_t *expr; /**< 2bits array describing the if-feature expression in prefix format, see @ref ifftokens */
959 struct lysc_feature **features; /**< array of pointers to the features used in expression ([sized array](@ref sizedarrays)) */
960};
961
962/**
Radek Krejci151a5b72018-10-19 14:21:44 +0200963 * @brief YANG import-stmt
964 */
965struct lysc_import {
Radek Krejci6d6e4e42018-10-29 13:28:19 +0100966 struct lys_module *module; /**< link to the imported module */
Radek Krejci151a5b72018-10-19 14:21:44 +0200967 const char *prefix; /**< prefix for the data from the imported schema (mandatory) */
Radek Krejcice8c1592018-10-29 15:35:51 +0100968 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200969};
970
971/**
Radek Krejcidd4e8d42018-10-16 14:55:43 +0200972 * @brief YANG when-stmt
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200973 */
Radek Krejcidd4e8d42018-10-16 14:55:43 +0200974struct lysc_when {
975 struct lyxp_expr *cond; /**< XPath when condition */
Radek Krejcic8b31002019-01-08 10:24:45 +0100976 const char *dsc; /**< description */
977 const char *ref; /**< reference */
Radek Krejcia3045382018-11-22 14:30:31 +0100978 struct lysc_node *context; /**< context node of the expression */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200979 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcidd4e8d42018-10-16 14:55:43 +0200980};
981
982/**
Radek Krejci2a408df2018-10-29 16:32:26 +0100983 * @brief YANG identity-stmt
984 */
985struct lysc_ident {
986 const char *name; /**< identity name (mandatory), including possible prefix */
Radek Krejcic8b31002019-01-08 10:24:45 +0100987 const char *dsc; /**< description */
988 const char *ref; /**< reference */
Radek Krejci2a408df2018-10-29 16:32:26 +0100989 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
990 struct lysc_ident **derived; /**< list of (pointers to the) derived identities ([sized array](@ref sizedarrays)) */
991 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
992 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_ values are allowed */
993};
994
995/**
Radek Krejcidd4e8d42018-10-16 14:55:43 +0200996 * @brief YANG feature-stmt
997 */
998struct lysc_feature {
999 const char *name; /**< feature name (mandatory) */
Radek Krejcic8b31002019-01-08 10:24:45 +01001000 const char *dsc; /**< description */
1001 const char *ref; /**< reference */
Radek Krejci151a5b72018-10-19 14:21:44 +02001002 struct lysc_feature **depfeatures;/**< list of pointers to other features depending on this one ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001003 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcice8c1592018-10-29 15:35:51 +01001004 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001005 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* and
1006 #LYS_FENABLED values allowed */
1007};
1008
Radek Krejci151a5b72018-10-19 14:21:44 +02001009/**
1010 * @defgroup ifftokens if-feature expression tokens
1011 * Tokens of if-feature expression used in ::lysc_iffeature#expr
1012 *
1013 * @{
1014 */
1015#define LYS_IFF_NOT 0x00 /**< operand "not" */
1016#define LYS_IFF_AND 0x01 /**< operand "and" */
1017#define LYS_IFF_OR 0x02 /**< operand "or" */
1018#define LYS_IFF_F 0x03 /**< feature */
1019/**
1020 * @}
1021 */
1022
1023/**
Radek Krejcib7db73a2018-10-24 14:18:40 +02001024 * @brief Compiled YANG revision statement
1025 */
1026struct lysc_revision {
1027 char date[LY_REV_SIZE]; /**< revision-date (mandatory) */
1028 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1029};
1030
Radek Krejci2167ee12018-11-02 16:09:07 +01001031struct lysc_range {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001032 struct lysc_range_part {
Radek Krejci2167ee12018-11-02 16:09:07 +01001033 union { /**< min boundary TODO decimal */
1034 int64_t min_64; /**< for int8, int16, int32 and int64 */
1035 uint64_t min_u64; /**< for uint8, uint16, uint32 and uint64 */
1036 };
1037 union { /**< max boundary TODO decimal */
1038 int64_t max_64; /**< for int8, int16, int32 and int64 */
1039 uint64_t max_u64; /**< for uint8, uint16, uint32 and uint64 */
1040 };
Radek Krejci4f28eda2018-11-12 11:46:16 +01001041 } *parts; /**< compiled range expression ([sized array](@ref sizedarrays)) */
Radek Krejcic8b31002019-01-08 10:24:45 +01001042 const char *dsc; /**< description */
1043 const char *ref; /**< reference */
Radek Krejci2167ee12018-11-02 16:09:07 +01001044 const char *emsg; /**< error-message */
1045 const char *eapptag; /**< error-app-tag value */
1046 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1047};
1048
1049struct lysc_pattern {
1050 pcre *expr; /**< compiled regular expression */
1051 pcre_extra *expr_extra; /**< additional information to speed up matching */
Radek Krejcic8b31002019-01-08 10:24:45 +01001052 const char *dsc; /**< description */
1053 const char *ref; /**< reference */
Radek Krejci2167ee12018-11-02 16:09:07 +01001054 const char *emsg; /**< error-message */
1055 const char *eapptag; /**< error-app-tag value */
1056 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci4586a022018-11-13 11:29:26 +01001057 uint32_t inverted:1; /**< invert-match flag */
1058 uint32_t refcount:31; /**< reference counter */
Radek Krejci2167ee12018-11-02 16:09:07 +01001059};
1060
1061struct lysc_must {
1062 struct lys_module *module; /**< module where the must was defined */
1063 struct lyxp_expr *cond; /**< XPath when condition */
Radek Krejcic8b31002019-01-08 10:24:45 +01001064 const char *dsc; /**< description */
1065 const char *ref; /**< reference */
Radek Krejci2167ee12018-11-02 16:09:07 +01001066 const char *emsg; /**< error-message */
1067 const char *eapptag; /**< error-app-tag value */
1068 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1069};
1070
1071struct lysc_type {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001072 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001073 const char *dflt; /**< type's default value if any */
Radek Krejci2167ee12018-11-02 16:09:07 +01001074 LY_DATA_TYPE basetype; /**< Base type of the type */
1075 uint32_t refcount; /**< reference counter for type sharing */
1076};
1077
1078struct lysc_type_num {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001079 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001080 const char *dflt; /**< type's default value if any */
Radek Krejci2167ee12018-11-02 16:09:07 +01001081 LY_DATA_TYPE basetype; /**< Base type of the type */
1082 uint32_t refcount; /**< reference counter for type sharing */
1083 struct lysc_range *range; /**< Optional range limitation */
1084};
1085
1086struct lysc_type_dec {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001087 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001088 const char *dflt; /**< type's default value if any */
Radek Krejci2167ee12018-11-02 16:09:07 +01001089 LY_DATA_TYPE basetype; /**< Base type of the type */
1090 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci6cba4292018-11-15 17:33:29 +01001091 uint8_t fraction_digits; /**< fraction digits specification */
Radek Krejci2167ee12018-11-02 16:09:07 +01001092 struct lysc_range *range; /**< Optional range limitation */
1093};
1094
1095struct lysc_type_str {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001096 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001097 const char *dflt; /**< type's default value if any */
Radek Krejci2167ee12018-11-02 16:09:07 +01001098 LY_DATA_TYPE basetype; /**< Base type of the type */
1099 uint32_t refcount; /**< reference counter for type sharing */
1100 struct lysc_range *length; /**< Optional length limitation */
Radek Krejci4586a022018-11-13 11:29:26 +01001101 struct lysc_pattern **patterns; /**< Optional list of pointers to pattern limitations ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001102};
1103
1104struct lysc_type_enum {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001105 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001106 const char *dflt; /**< type's default value if any */
Radek Krejci2167ee12018-11-02 16:09:07 +01001107 LY_DATA_TYPE basetype; /**< Base type of the type */
1108 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci8b764662018-11-14 14:15:13 +01001109 struct lysc_type_enum_item {
Radek Krejci2167ee12018-11-02 16:09:07 +01001110 const char *name; /**< enumeration identifier */
Radek Krejcic8b31002019-01-08 10:24:45 +01001111 const char *dsc; /**< description */
1112 const char *ref; /**< reference */
Radek Krejci2167ee12018-11-02 16:09:07 +01001113 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejci8b764662018-11-14 14:15:13 +01001114 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001115 int32_t value; /**< integer value associated with the enumeration */
1116 } *enums; /**< enumerations list ([sized array](@ref sizedarrays)), mandatory (at least 1 item) */
1117};
1118
1119struct lysc_type_leafref {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001120 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001121 const char *dflt; /**< type's default value if any */
Radek Krejci2167ee12018-11-02 16:09:07 +01001122 LY_DATA_TYPE basetype; /**< Base type of the type */
1123 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejcia3045382018-11-22 14:30:31 +01001124 const char* path; /**< target path */
Radek Krejci96a0bfd2018-11-22 15:25:06 +01001125 struct lys_module *path_context; /**< module where the path is defined, so it provides context to resolve prefixes */
Radek Krejci412ddfa2018-11-23 11:44:11 +01001126 struct lysc_type *realtype; /**< pointer to the real (first non-leafref in possible leafrefs chain) type. */
Radek Krejci2167ee12018-11-02 16:09:07 +01001127 uint8_t require_instance; /**< require-instance flag */
1128};
1129
1130struct lysc_type_identityref {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001131 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001132 const char *dflt; /**< type's default value if any */
Radek Krejci2167ee12018-11-02 16:09:07 +01001133 LY_DATA_TYPE basetype; /**< Base type of the type */
1134 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci555cb5b2018-11-16 14:54:33 +01001135 struct lysc_ident **bases; /**< list of pointers to the base identities ([sized array](@ref sizedarrays)),
Radek Krejci2167ee12018-11-02 16:09:07 +01001136 mandatory (at least 1 item) */
1137};
1138
1139struct lysc_type_instanceid {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001140 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001141 const char *dflt; /**< type's default value if any */
Radek Krejci2167ee12018-11-02 16:09:07 +01001142 LY_DATA_TYPE basetype; /**< Base type of the type */
1143 uint32_t refcount; /**< reference counter for type sharing */
1144 uint8_t require_instance; /**< require-instance flag */
1145};
1146
1147struct lysc_type_bits {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001148 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001149 const char *dflt; /**< type's default value if any */
Radek Krejci2167ee12018-11-02 16:09:07 +01001150 LY_DATA_TYPE basetype; /**< Base type of the type */
1151 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci8b764662018-11-14 14:15:13 +01001152 struct lysc_type_bits_item {
Radek Krejci2167ee12018-11-02 16:09:07 +01001153 const char *name; /**< bit identifier */
Radek Krejcic8b31002019-01-08 10:24:45 +01001154 const char *dsc; /**< description */
1155 const char *ref; /**< reference */
Radek Krejci2167ee12018-11-02 16:09:07 +01001156 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejci8b764662018-11-14 14:15:13 +01001157 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001158 uint32_t position; /**< non-negative integer value associated with the bit */
1159 } *bits; /**< bits list ([sized array](@ref sizedarrays)), mandatory (at least 1 item) */
1160};
1161
1162struct lysc_type_union {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001163 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001164 const char *dflt; /**< type's default value if any */
Radek Krejci2167ee12018-11-02 16:09:07 +01001165 LY_DATA_TYPE basetype; /**< Base type of the type */
1166 uint32_t refcount; /**< reference counter for type sharing */
1167 struct lysc_type **types; /**< list of types in the union ([sized array](@ref sizedarrays)), mandatory (at least 1 item) */
1168};
1169
1170struct lysc_type_bin {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001171 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001172 const char *dflt; /**< type's default value if any */
Radek Krejci2167ee12018-11-02 16:09:07 +01001173 LY_DATA_TYPE basetype; /**< Base type of the type */
1174 uint32_t refcount; /**< reference counter for type sharing */
1175 struct lysc_range *length; /**< Optional length limitation */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001176};
1177
Radek Krejci056d0a82018-12-06 16:57:25 +01001178struct lysc_action {
1179 uint16_t nodetype; /**< LYS_ACTION */
1180 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1181 const char *name; /**< action/RPC name (mandatory) */
1182 /* TODO */
1183};
1184
1185struct lysc_notif {
1186 uint16_t nodetype; /**< LYS_NOTIF */
1187 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1188 const char *name; /**< Notification name (mandatory) */
1189 /* TODO */
1190};
1191
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001192/**
Radek Krejci0af5f5d2018-09-07 15:00:30 +02001193 * @brief Compiled YANG data node
1194 */
1195struct lysc_node {
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001196 uint16_t nodetype; /**< type of the node (mandatory) */
1197 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001198 struct lys_module *module; /**< module structure */
1199 struct lysp_node *sp; /**< simply parsed (SP) original of the node, NULL if the SP schema was removed or in case of implicit case node. */
1200 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1201 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1202 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1203 never NULL. If there is no sibling node, pointer points to the node
1204 itself. In case of the first node, this pointer points to the last
1205 node in the list. */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001206 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001207 const char *dsc; /**< description */
1208 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001209 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci056d0a82018-12-06 16:57:25 +01001210 struct lysc_when *when; /**< when statement */
1211 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001212};
1213
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001214struct lysc_node_container {
1215 uint16_t nodetype; /**< LYS_CONTAINER */
1216 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1217 struct lys_module *module; /**< module structure */
1218 struct lysp_node *sp; /**< simply parsed (SP) original of the node, NULL if the SP schema was removed or in case of implicit case node. */
1219 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1220 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1221 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1222 never NULL. If there is no sibling node, pointer points to the node
1223 itself. In case of the first node, this pointer points to the last
1224 node in the list. */
1225 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001226 const char *dsc; /**< description */
1227 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001228 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001229 struct lysc_when *when; /**< when statement */
1230 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1231
1232 struct lysc_node *child; /**< first child node (linked list) */
1233 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1234 struct lysc_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
1235 struct lysc_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001236};
1237
Radek Krejcia3045382018-11-22 14:30:31 +01001238struct lysc_node_case {
Radek Krejci056d0a82018-12-06 16:57:25 +01001239 uint16_t nodetype; /**< LYS_CASE */
1240 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1241 struct lys_module *module; /**< module structure */
1242 struct lysp_node *sp; /**< simply parsed (SP) original of the node, NULL if the SP schema was removed or in case of implicit case node. */
1243 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1244 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1245 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1246 never NULL. If there is no sibling node, pointer points to the node
1247 itself. In case of the first node, this pointer points to the last
1248 node in the list. */
Radek Krejcia3045382018-11-22 14:30:31 +01001249 const char *name; /**< name of the case, including the implicit case */
Radek Krejci12fb9142019-01-08 09:45:30 +01001250 const char *dsc; /**< description */
1251 const char *ref; /**< reference */
Radek Krejci056d0a82018-12-06 16:57:25 +01001252 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1253 struct lysc_when *when; /**< when statement */
1254 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1255
Radek Krejcia3045382018-11-22 14:30:31 +01001256 struct lysc_node *child; /**< first child node of the case (linked list). Note that all the children of all the sibling cases are linked
1257 each other as siblings with the parent pointer pointing to the choice node holding the case. To distinguish
1258 which children node belongs to which case, it is needed to match the first children of the cases while going
1259 through the children linked list. */
1260};
1261
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001262struct lysc_node_choice {
1263 uint16_t nodetype; /**< LYS_CHOICE */
1264 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1265 struct lys_module *module; /**< module structure */
1266 struct lysp_node *sp; /**< simply parsed (SP) original of the node, NULL if the SP schema was removed or in case of implicit case node. */
1267 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1268 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1269 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1270 never NULL. If there is no sibling node, pointer points to the node
1271 itself. In case of the first node, this pointer points to the last
1272 node in the list. */
1273 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001274 const char *dsc; /**< description */
1275 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001276 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci056d0a82018-12-06 16:57:25 +01001277 struct lysc_when *when; /**< when statement */
1278 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001279
Radek Krejcia9026eb2018-12-12 16:04:47 +01001280 struct lysc_node_case *cases; /**< list of the cases (linked list). Note that all the children of all the cases are linked each other
1281 as siblings. Their parent pointers points to the specific case they belongs to, so distinguish the
1282 case is simple. */
Radek Krejci056d0a82018-12-06 16:57:25 +01001283 struct lysc_node_case *dflt; /**< default case of the choice, only a pointer into the cases array. */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001284};
1285
1286struct lysc_node_leaf {
1287 uint16_t nodetype; /**< LYS_LEAF */
1288 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1289 struct lys_module *module; /**< module structure */
1290 struct lysp_node *sp; /**< simply parsed (SP) original of the node, NULL if the SP schema was removed or in case of implicit case node. */
1291 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1292 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1293 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1294 never NULL. If there is no sibling node, pointer points to the node
1295 itself. In case of the first node, this pointer points to the last
1296 node in the list. */
1297 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001298 const char *dsc; /**< description */
1299 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001300 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001301 struct lysc_when *when; /**< when statement */
1302 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1303
1304 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1305 struct lysc_type *type; /**< type of the leaf node (mandatory) */
Radek Krejcib57cf1e2018-11-23 14:07:05 +01001306
Radek Krejci4f28eda2018-11-12 11:46:16 +01001307 const char *units; /**< units of the leaf's type */
1308 const char *dflt; /**< default value */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001309};
1310
1311struct lysc_node_leaflist {
1312 uint16_t nodetype; /**< LYS_LEAFLIST */
1313 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1314 struct lys_module *module; /**< module structure */
1315 struct lysp_node *sp; /**< simply parsed (SP) original of the node, NULL if the SP schema was removed or in case of implicit case node. */
1316 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1317 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1318 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1319 never NULL. If there is no sibling node, pointer points to the node
1320 itself. In case of the first node, this pointer points to the last
1321 node in the list. */
1322 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001323 const char *dsc; /**< description */
1324 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001325 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcib57cf1e2018-11-23 14:07:05 +01001326 struct lysc_when *when; /**< when statement */
1327 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1328
1329 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1330 struct lysc_type *type; /**< type of the leaf node (mandatory) */
1331
Radek Krejci0e5d8382018-11-28 16:37:53 +01001332 const char *units; /**< units of the leaf's type */
1333 const char **dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
1334 uint32_t min; /**< min-elements constraint */
1335 uint32_t max; /**< max-elements constraint */
1336
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001337};
1338
1339struct lysc_node_list {
1340 uint16_t nodetype; /**< LYS_LIST */
1341 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1342 struct lys_module *module; /**< module structure */
1343 struct lysp_node *sp; /**< simply parsed (SP) original of the node, NULL if the SP schema was removed or in case of implicit case node. */
1344 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1345 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1346 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1347 never NULL. If there is no sibling node, pointer points to the node
1348 itself. In case of the first node, this pointer points to the last
1349 node in the list. */
1350 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001351 const char *dsc; /**< description */
1352 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001353 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci9bb94eb2018-12-04 16:48:35 +01001354 struct lysc_when *when; /**< when statement */
1355 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1356
1357 struct lysc_node *child; /**< first child node (linked list) */
1358 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1359 struct lysc_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
1360 struct lysc_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
1361
1362 struct lysc_node_leaf **keys; /**< list of pointers to the keys ([sized array](@ref sizedarrays)) */
1363 struct lysc_node_leaf ***uniques; /**< list of sized arrays of pointers to the unique nodes ([sized array](@ref sizedarrays)) */
1364 uint32_t min; /**< min-elements constraint */
1365 uint32_t max; /**< max-elements constraint */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001366};
1367
1368struct lysc_node_anydata {
1369 uint16_t nodetype; /**< LYS_ANYXML or LYS_ANYDATA */
1370 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1371 struct lys_module *module; /**< module structure */
1372 struct lysp_node *sp; /**< simply parsed (SP) original of the node, NULL if the SP schema was removed or in case of implicit case node. */
1373 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1374 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1375 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1376 never NULL. If there is no sibling node, pointer points to the node
1377 itself. In case of the first node, this pointer points to the last
1378 node in the list. */
1379 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001380 const char *dsc; /**< description */
1381 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001382 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci056d0a82018-12-06 16:57:25 +01001383 struct lysc_when *when; /**< when statement */
1384 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejci9800fb82018-12-13 14:26:23 +01001385
1386 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001387};
1388
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001389/**
1390 * @brief Compiled YANG schema tree structure representing YANG module.
1391 *
1392 * Semantically validated YANG schema tree for data tree parsing.
1393 * Contains only the necessary information for the data validation.
1394 */
1395struct lysc_module {
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001396 struct lys_module *mod; /**< covering module structure */
Radek Krejci151a5b72018-10-19 14:21:44 +02001397 struct lysc_import *imports; /**< list of imported modules ([sized array](@ref sizedarrays)) */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001398
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001399 struct lysc_feature *features; /**< list of feature definitions ([sized array](@ref sizedarrays)) */
Radek Krejci2a408df2018-10-29 16:32:26 +01001400 struct lysc_ident *identities; /**< list of identities ([sized array](@ref sizedarrays)) */
1401 struct lysc_node *data; /**< list of module's top-level data nodes (linked list) */
1402 struct lysc_action *rpcs; /**< list of RPCs ([sized array](@ref sizedarrays)) */
1403 struct lysc_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejcice8c1592018-10-29 15:35:51 +01001404 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci0af5f5d2018-09-07 15:00:30 +02001405};
1406
1407/**
Radek Krejci53ea6152018-12-13 15:21:15 +01001408 * @brief Get the groupings sized array of the given (parsed) schema node.
1409 * Decides the node's type and in case it has a groupings array, returns it.
1410 * @param[in] node Node to examine.
1411 * @return The node's groupings sized array if any, NULL otherwise.
1412 */
1413const struct lysp_grp *lysp_node_groupings(const struct lysp_node *node);
1414
1415/**
Radek Krejci056d0a82018-12-06 16:57:25 +01001416 * @brief Get the typedefs sized array of the given (parsed) schema node.
1417 * Decides the node's type and in case it has a typedefs array, returns it.
1418 * @param[in] node Node to examine.
1419 * @return The node's typedefs sized array if any, NULL otherwise.
1420 */
1421const struct lysp_tpdf *lysp_node_typedefs(const struct lysp_node *node);
1422
1423/**
1424 * @brief Get the actions/RPCs sized array of the given (parsed) schema node.
1425 * Decides the node's type and in case it has a actions/RPCs array, returns it.
1426 * @param[in] node Node to examine.
1427 * @return The node's actions/RPCs sized array if any, NULL otherwise.
1428 */
1429const struct lysp_action *lysp_node_actions(const struct lysp_node *node);
1430
1431/**
1432 * @brief Get the Notifications sized array of the given (parsed) schema node.
1433 * Decides the node's type and in case it has a Notifications array, returns it.
1434 * @param[in] node Node to examine.
1435 * @return The node's Notifications sized array if any, NULL otherwise.
1436 */
1437const struct lysp_notif *lysp_node_notifs(const struct lysp_node *node);
1438
1439/**
1440 * @brief Get the children linked list of the given (parsed) schema node.
1441 * Decides the node's type and in case it has a children list, returns it.
1442 * @param[in] node Node to examine.
1443 * @return The node's children linked list if any, NULL otherwise.
1444 */
1445const struct lysp_node *lysp_node_children(const struct lysp_node *node);
1446
1447/**
1448 * @brief Get the actions/RPCs sized array of the given (compiled) schema node.
1449 * Decides the node's type and in case it has a actions/RPCs array, returns it.
1450 * @param[in] node Node to examine.
1451 * @return The node's actions/RPCs sized array if any, NULL otherwise.
1452 */
1453const struct lysc_action *lysc_node_actions(const struct lysc_node *node);
1454
1455/**
1456 * @brief Get the Notifications sized array of the given (compiled) schema node.
1457 * Decides the node's type and in case it has a Notifications array, returns it.
1458 * @param[in] node Node to examine.
1459 * @return The node's Notifications sized array if any, NULL otherwise.
1460 */
1461const struct lysc_notif *lysc_node_notifs(const struct lysc_node *node);
1462
1463/**
1464 * @brief Get the children linked list of the given (compiled) schema node.
1465 * Decides the node's type and in case it has a children list, returns it.
1466 * @param[in] node Node to examine.
1467 * @return The node's children linked list if any, NULL otherwise.
1468 */
1469const struct lysc_node *lysc_node_children(const struct lysc_node *node);
1470
1471/**
Radek Krejci151a5b72018-10-19 14:21:44 +02001472 * @brief Get how the if-feature statement currently evaluates.
1473 *
1474 * @param[in] iff Compiled if-feature statement to evaluate.
1475 * @return If the statement evaluates to true, 1 is returned. 0 is returned when the statement evaluates to false.
1476 */
1477int lysc_iffeature_value(const struct lysc_iffeature *iff);
1478
1479/**
1480 * @brief Get the current status of the provided feature.
1481 *
1482 * @param[in] feature Compiled feature statement to examine.
1483 * @return
1484 * - 1 if feature is enabled,
1485 * - 0 if feature is disabled,
1486 * - -1 in case of error (invalid argument)
1487 */
1488int lysc_feature_value(const struct lysc_feature *feature);
1489
1490/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001491 * @brief Available YANG schema tree structures representing YANG module.
1492 */
1493struct lys_module {
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001494 struct ly_ctx *ctx; /**< libyang context of the module (mandatory) */
1495 const char *name; /**< name of the module (mandatory) */
Radek Krejci0af46292019-01-11 16:02:31 +01001496 const char *revision; /**< revision of the module (if present) */
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001497 const char *ns; /**< namespace of the module (module - mandatory) */
1498 const char *prefix; /**< module prefix or submodule belongsto prefix of main module (mandatory) */
1499 const char *filepath; /**< path, if the schema was read from a file, NULL in case of reading from memory */
1500 const char *org; /**< party/company responsible for the module */
1501 const char *contact; /**< contact information for the module */
1502 const char *dsc; /**< description of the module */
1503 const char *ref; /**< cross-reference for the module */
1504
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001505 struct lysp_module *parsed; /**< Simply parsed (unresolved) YANG schema tree */
Radek Krejci0af46292019-01-11 16:02:31 +01001506 struct lysc_module *compiled; /**< Compiled and fully validated YANG schema tree for data parsing.
1507 Available only for implemented modules. */
1508 struct lysc_feature *off_features;/**< List of pre-compiled features of the module in non implemented modules ([sized array](@ref sizedarrays)).
1509 These features are always disabled and cannot be enabled until the module
1510 become implemented. The features are present in this form to allow their linkage
1511 from if-feature statements of the compiled schemas and their proper use in case
1512 the module became implemented in future (no matter if implicitly via augment/deviate
1513 or explicitly via ly_ctx_module_implement()). */
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001514
1515 uint8_t implemented:1; /**< flag if the module is implemented, not just imported */
1516 uint8_t latest_revision:2; /**< flag to mark the latest available revision:
1517 1 - the latest revision in searchdirs was not searched yet and this is the
1518 latest revision in the current context
1519 2 - searchdirs were searched and this is the latest available revision */
1520 uint8_t version; /**< yang-version (LYS_VERSION values) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001521};
1522
Radek Krejci151a5b72018-10-19 14:21:44 +02001523/**
1524 * @brief Enable specified feature in the module
1525 *
1526 * By default, when the module is loaded by libyang parser, all features are disabled.
1527 *
Radek Krejcica3db002018-11-01 10:31:01 +01001528 * If all features are being enabled, it must be possible respecting their if-feature conditions. For example,
1529 * enabling all features on the following feature set will fail since it is not possible to enable both features
1530 * (and it is unclear which of them should be enabled then). In this case the LY_EDENIED is returned and the feature
1531 * is untouched.
1532 *
1533 * feature f1;
1534 * feature f2 { if-feature 'not f1';}
1535 *
Radek Krejci151a5b72018-10-19 14:21:44 +02001536 * @param[in] module Module where the feature will be enabled.
1537 * @param[in] feature Name of the feature to enable. To enable all features at once, use asterisk (`*`) character.
1538 * @return LY_ERR value.
1539 */
1540LY_ERR lys_feature_enable(struct lys_module *module, const char *feature);
1541
1542/**
1543 * @brief Disable specified feature in the module
1544 *
1545 * By default, when the module is loaded by libyang parser, all features are disabled.
1546 *
1547 * @param[in] module Module where the feature will be disabled.
1548 * @param[in] feature Name of the feature to disable. To disable all features at once, use asterisk (`*`) character.
1549 * @return LY_ERR value
1550 */
1551LY_ERR lys_feature_disable(struct lys_module *module, const char *feature);
1552
1553/**
1554 * @brief Get the current status of the specified feature in the module.
1555 *
1556 * @param[in] module Module where the feature is defined.
1557 * @param[in] feature Name of the feature to inspect.
1558 * @return
1559 * - 1 if feature is enabled,
1560 * - 0 if feature is disabled,
1561 * - -1 in case of error (e.g. feature is not defined or invalid arguments)
1562 */
1563int lys_feature_value(const struct lys_module *module, const char *feature);
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001564
1565/**
Radek Krejci86d106e2018-10-18 09:53:19 +02001566 * @brief Load a schema into the specified context.
1567 *
1568 * @param[in] ctx libyang context where to process the data model.
1569 * @param[in] data The string containing the dumped data model in the specified
1570 * format.
1571 * @param[in] format Format of the input data (YANG or YIN).
1572 * @return Pointer to the data model structure or NULL on error.
1573 */
Radek Krejcid14e9692018-11-01 11:00:37 +01001574struct lys_module *lys_parse_mem(struct ly_ctx *ctx, const char *data, LYS_INFORMAT format);
Radek Krejci86d106e2018-10-18 09:53:19 +02001575
1576/**
1577 * @brief Read a schema from file descriptor into the specified context.
1578 *
1579 * \note Current implementation supports only reading data from standard (disk) file, not from sockets, pipes, etc.
1580 *
1581 * @param[in] ctx libyang context where to process the data model.
1582 * @param[in] fd File descriptor of a regular file (e.g. sockets are not supported) containing the schema
1583 * in the specified format.
1584 * @param[in] format Format of the input data (YANG or YIN).
1585 * @return Pointer to the data model structure or NULL on error.
1586 */
Radek Krejcid14e9692018-11-01 11:00:37 +01001587struct lys_module *lys_parse_fd(struct ly_ctx *ctx, int fd, LYS_INFORMAT format);
Radek Krejci86d106e2018-10-18 09:53:19 +02001588
1589/**
Radek Krejcid33273d2018-10-25 14:55:52 +02001590 * @brief Read a schema into the specified context from a file.
Radek Krejci86d106e2018-10-18 09:53:19 +02001591 *
1592 * @param[in] ctx libyang context where to process the data model.
1593 * @param[in] path Path to the file with the model in the specified format.
1594 * @param[in] format Format of the input data (YANG or YIN).
1595 * @return Pointer to the data model structure or NULL on error.
1596 */
Radek Krejcid14e9692018-11-01 11:00:37 +01001597struct lys_module *lys_parse_path(struct ly_ctx *ctx, const char *path, LYS_INFORMAT format);
Radek Krejci86d106e2018-10-18 09:53:19 +02001598
1599/**
Radek Krejcid33273d2018-10-25 14:55:52 +02001600 * @brief Search for the schema file in the specified searchpaths.
1601 *
1602 * @param[in] searchpaths NULL-terminated array of paths to be searched (recursively). Current working
1603 * directory is searched automatically (but non-recursively if not in the provided list). Caller can use
1604 * result of the ly_ctx_get_searchdirs().
1605 * @param[in] cwd Flag to implicitly search also in the current working directory (non-recursively).
1606 * @param[in] name Name of the schema to find.
1607 * @param[in] revision Revision of the schema to find. If NULL, the newest found schema filepath is returned.
1608 * @param[out] localfile Mandatory output variable containing absolute path of the found schema. If no schema
1609 * complying the provided restriction is found, NULL is set.
1610 * @param[out] format Optional output variable containing expected format of the schema document according to the
1611 * file suffix.
1612 * @return LY_ERR value (LY_SUCCESS is returned even if the file is not found, then the *localfile is NULL).
1613 */
1614LY_ERR lys_search_localfile(const char * const *searchpaths, int cwd, const char *name, const char *revision, char **localfile, LYS_INFORMAT *format);
1615
1616/**
Radek Krejcia3045382018-11-22 14:30:31 +01001617 * @brief Get next schema tree (sibling) node element that can be instantiated in a data tree. Returned node can
1618 * be from an augment.
1619 *
1620 * lys_getnext() is supposed to be called sequentially. In the first call, the \p last parameter is usually NULL
1621 * and function starts returning i) the first \p parent's child or ii) the first top level element of the \p module.
1622 * Consequent calls suppose to provide the previously returned node as the \p last parameter and still the same
1623 * \p parent and \p module parameters.
1624 *
1625 * Without options, the function is used to traverse only the schema nodes that can be paired with corresponding
1626 * data nodes in a data tree. By setting some \p options the behavior can be modified to the extent that
1627 * all the schema nodes are iteratively returned.
1628 *
1629 * @param[in] last Previously returned schema tree node, or NULL in case of the first call.
1630 * @param[in] parent Parent of the subtree where the function starts processing.
1631 * @param[in] module In case of iterating on top level elements, the \p parent is NULL and
1632 * module must be specified.
1633 * @param[in] options [ORed options](@ref sgetnextflags).
1634 * @return Next schema tree node that can be instantiated in a data tree, NULL in case there is no such element.
1635 */
1636const struct lysc_node *lys_getnext(const struct lysc_node *last, const struct lysc_node *parent,
1637 const struct lysc_module *module, int options);
1638
1639/**
1640 * @defgroup sgetnextflags lys_getnext() flags
1641 * @ingroup schematree
1642 *
1643 * @{
1644 */
1645#define LYS_GETNEXT_WITHCHOICE 0x01 /**< lys_getnext() option to allow returning #LYS_CHOICE nodes instead of looking into them */
Radek Krejci9bb94eb2018-12-04 16:48:35 +01001646#define LYS_GETNEXT_NOCHOICE 0x02 /**< lys_getnext() option to ignore (kind of conditional) nodes within choice node */
Radek Krejci056d0a82018-12-06 16:57:25 +01001647#define LYS_GETNEXT_WITHCASE 0x04 /**< lys_getnext() option to allow returning #LYS_CASE nodes instead of looking into them */
Radek Krejcia3045382018-11-22 14:30:31 +01001648#define LYS_GETNEXT_INTONPCONT 0x40 /**< lys_getnext() option to look into non-presence container, instead of returning container itself */
1649#define LYS_GETNEXT_NOSTATECHECK 0x100 /**< lys_getnext() option to skip checking module validity (import-only, disabled) and
1650 relevant if-feature conditions state */
1651/** @} sgetnextflags */
1652
1653/**
1654 * @brief Get child node according to the specified criteria.
1655 *
1656 * @param[in] parent Optional parent of the node to find. If not specified, the module's top-level nodes are searched.
1657 * @param[in] module module of the node to find. It is also limitation for the children node of the given parent.
1658 * @param[in] name Name of the node to find.
1659 * @param[in] name_len Optional length of the name in case it is not NULL-terminated string.
1660 * @param[in] nodetype Optional criteria (to speedup) specifying nodetype(s) of the node to find.
1661 * Used as a bitmask, so multiple nodetypes can be specified.
1662 * @param[in] options [ORed options](@ref sgetnextflags).
1663 * @return Found node if any.
1664 */
1665const struct lysc_node *lys_child(const struct lysc_node *parent, const struct lys_module *module,
1666 const char *name, size_t name_len, uint16_t nodetype, int options);
1667
1668/**
1669 * @brief Check if the schema node is disabled in the schema tree, i.e. there is any disabled if-feature statement
1670 * affecting the node.
1671 *
1672 * @param[in] node Schema node to check.
1673 * @param[in] recursive - 0 to check if-feature only in the \p node schema node,
1674 * - 1 to check if-feature in all ascendant schema nodes until there is a node possibly having an instance in a data tree
1675 * @return - NULL if enabled,
1676 * - pointer to the node with the unsatisfied (disabling) if-feature expression.
1677 */
1678const struct lysc_iffeature *lys_is_disabled(const struct lysc_node *node, int recursive);
1679
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001680/** @} */
1681
Radek Krejci70853c52018-10-15 14:46:16 +02001682#ifdef __cplusplus
1683}
1684#endif
1685
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001686#endif /* LY_TREE_SCHEMA_H_ */