blob: a7c5017cd0b5938adde9ebad16c5789384181129 [file] [log] [blame]
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001/**
2 * @file tree_schema.h
3 * @author Radek Krejci <rkrejci@cesnet.cz>
4 * @brief libyang representation of YANG schema trees.
5 *
6 * Copyright (c) 2015 - 2018 CESNET, z.s.p.o.
7 *
8 * This source code is licensed under BSD 3-Clause License (the "License").
9 * You may not use this file except in compliance with the License.
10 * You may obtain a copy of the License at
11 *
12 * https://opensource.org/licenses/BSD-3-Clause
13 */
14
15#ifndef LY_TREE_SCHEMA_H_
16#define LY_TREE_SCHEMA_H_
17
Radek Krejci54579462019-04-30 12:47:06 +020018#define PCRE2_CODE_UNIT_WIDTH 8
19
20#include <pcre2.h>
Radek Krejci5aeea3a2018-09-05 13:29:36 +020021#include <stdint.h>
Radek Krejcid3ca0632019-04-16 16:54:54 +020022#include <stdio.h>
Radek Krejci5aeea3a2018-09-05 13:29:36 +020023
Radek Krejcice8c1592018-10-29 15:35:51 +010024#include "extensions.h"
25
Radek Krejci70853c52018-10-15 14:46:16 +020026#ifdef __cplusplus
27extern "C" {
28#endif
29
Radek Krejci5aeea3a2018-09-05 13:29:36 +020030/**
Radek Krejcidd4e8d42018-10-16 14:55:43 +020031 * @brief XPath representation.
32 */
33struct lyxp_expr;
34
35/**
Radek Krejcie53a8dc2018-10-17 12:52:40 +020036 * @brief Macro selector for other LY_ARRAY_* macros, do not use directly!
37 */
38#define LY_ARRAY_SELECT(_1, _2, NAME, ...) NAME
39
40/**
Radek Krejcie53a8dc2018-10-17 12:52:40 +020041 * @brief Helper macro to go through sized-arrays with a pointer iterator.
42 *
43 * Use with opening curly bracket (`{`).
44 *
45 * @param[in] ARRAY Array to go through
46 * @param[in] TYPE Type of the records in the ARRAY
47 * @param[out] ITER Iterating pointer to the item being processed in each loop
48 */
49#define LY_ARRAY_FOR_ITER(ARRAY, TYPE, ITER) \
Radek Krejci2c4e7172018-10-19 15:56:26 +020050 for (ITER = ARRAY; \
51 (ARRAY) && ((void*)ITER - (void*)ARRAY)/(sizeof(TYPE)) < (*((uint32_t*)(ARRAY) - 1)); \
Radek Krejcie53a8dc2018-10-17 12:52:40 +020052 ITER = (void*)((TYPE*)ITER + 1))
53
54/**
55 * @brief Helper macro to go through sized-arrays with a numeric iterator.
56 *
57 * Use with opening curly bracket (`{`).
58 *
59 * To access an item with the INDEX value, use always LY_ARRAY_INDEX macro!
60 *
61 * @param[in] ARRAY Array to go through
62 * @param[out] INDEX Iterating index of the item being processed in each loop
63 */
64#define LY_ARRAY_FOR_INDEX(ARRAY, INDEX) \
65 for (INDEX = 0; \
Radek Krejci2c4e7172018-10-19 15:56:26 +020066 ARRAY && INDEX < (*((uint32_t*)(ARRAY) - 1)); \
Radek Krejcie53a8dc2018-10-17 12:52:40 +020067 ++INDEX)
68
69/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +020070 * @defgroup schematree Schema Tree
71 * @{
72 *
73 * Data structures and functions to manipulate and access schema tree.
74 */
75
Radek Krejci0af5f5d2018-09-07 15:00:30 +020076/**
Radek Krejcie53a8dc2018-10-17 12:52:40 +020077 * @brief Get a number of records in the ARRAY.
Radek Krejci86d106e2018-10-18 09:53:19 +020078 *
79 * Does not check if array exists!
Radek Krejcie53a8dc2018-10-17 12:52:40 +020080 */
Radek Krejci2c4e7172018-10-19 15:56:26 +020081#define LY_ARRAY_SIZE(ARRAY) (*((uint32_t*)(ARRAY) - 1))
Radek Krejcie53a8dc2018-10-17 12:52:40 +020082
83/**
84 * @brief Sized-array iterator (for-loop).
85 *
86 * Use with opening curly bracket (`{`).
87 *
88 * There are 2 variants:
89 *
90 * LY_ARRAY_FOR(ARRAY, TYPE, ITER)
91 *
92 * 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
93 * providing the items of the ARRAY in the loops. This functionality is provided by LY_ARRAY_FOR_ITER macro
94 *
95 * LY_ARRAY_FOR(ARRAY, INDEX)
96 *
97 * 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 +020098 * 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 +020099 */
100#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 +0200101
102/**
103 * @brief Macro to iterate via all sibling elements without affecting the list itself
104 *
105 * Works for all types of nodes despite it is data or schema tree, but all the
106 * parameters must be pointers to the same type.
107 *
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200108 * Use with opening curly bracket (`{`). All parameters must be of the same type.
Radek Krejci5fac3592018-10-12 15:23:45 +0200109 *
110 * @param START Pointer to the starting element.
111 * @param ELEM Iterator.
112 */
113#define LY_LIST_FOR(START, ELEM) \
114 for ((ELEM) = (START); \
115 (ELEM); \
116 (ELEM) = (ELEM)->next)
117
118/**
Radek Krejci5fac3592018-10-12 15:23:45 +0200119 * @brief Macro to iterate via all sibling elements allowing to modify the list itself (e.g. removing elements)
120 *
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200121 * Use with opening curly bracket (`{`). All parameters must be of the same type.
Radek Krejci5fac3592018-10-12 15:23:45 +0200122 *
123 * @param START Pointer to the starting element.
124 * @param NEXT Temporary storage to allow removing of the current iterator content.
125 * @param ELEM Iterator.
126 */
127#define LY_LIST_FOR_SAFE(START, NEXT, ELEM) \
128 for ((ELEM) = (START); \
129 (ELEM) ? (NEXT = (ELEM)->next, 1) : 0; \
130 (ELEM) = (NEXT))
131
132/**
Radek Krejci0af5f5d2018-09-07 15:00:30 +0200133 * @brief Schema input formats accepted by libyang [parser functions](@ref howtoschemasparsers).
134 */
135typedef enum {
136 LYS_IN_UNKNOWN = 0, /**< unknown format, used as return value in case of error */
137 LYS_IN_YANG = 1, /**< YANG schema input format */
Radek Krejci693262f2019-04-29 15:23:20 +0200138 LYS_IN_YIN = 3 /**< YIN schema input format */
Radek Krejci0af5f5d2018-09-07 15:00:30 +0200139} LYS_INFORMAT;
140
141/**
142 * @brief Schema output formats accepted by libyang [printer functions](@ref howtoschemasprinters).
143 */
144typedef enum {
145 LYS_OUT_UNKNOWN = 0, /**< unknown format, used as return value in case of error */
146 LYS_OUT_YANG = 1, /**< YANG schema output format */
Radek Krejci693262f2019-04-29 15:23:20 +0200147 LYS_OUT_YIN = 3, /**< YIN schema output format */
148 LYS_OUT_YANG_COMPILED = 2, /**< YANG schema output format of the compiled schema tree */
Radek Krejcid3ca0632019-04-16 16:54:54 +0200149
Radek Krejci0af5f5d2018-09-07 15:00:30 +0200150 LYS_OUT_TREE, /**< Tree schema output format, for more information see the [printers](@ref howtoschemasprinters) page */
151 LYS_OUT_INFO, /**< Info schema output format, for more information see the [printers](@ref howtoschemasprinters) page */
152 LYS_OUT_JSON, /**< JSON schema output format, reflecting YIN format with conversion of attributes to object's members */
153} LYS_OUTFORMAT;
154
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200155#define LY_REV_SIZE 11 /**< revision data string length (including terminating NULL byte) */
156
Michal Vaskob55f6c12018-09-12 11:13:15 +0200157#define LYS_UNKNOWN 0x0000 /**< uninitalized unknown statement node */
158#define LYS_CONTAINER 0x0001 /**< container statement node */
159#define LYS_CHOICE 0x0002 /**< choice statement node */
160#define LYS_LEAF 0x0004 /**< leaf statement node */
161#define LYS_LEAFLIST 0x0008 /**< leaf-list statement node */
162#define LYS_LIST 0x0010 /**< list statement node */
163#define LYS_ANYXML 0x0020 /**< anyxml statement node */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200164#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 +0200165
Radek Krejcia3045382018-11-22 14:30:31 +0100166#define LYS_CASE 0x0040 /**< case statement node */
167#define LYS_USES 0x0080 /**< uses statement node */
Radek Krejcid3ca0632019-04-16 16:54:54 +0200168#define LYS_INPUT 0x100
169#define LYS_OUTPUT 0x200
170#define LYS_INOUT 0x300
Radek Krejci6eeb58f2019-02-22 16:29:37 +0100171#define LYS_ACTION 0x400 /**< RPC or action */
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100172#define LYS_NOTIF 0x800
173#define LYS_GROUPING 0x1000
174#define LYS_AUGMENT 0x2000
175
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200176/**
Radek Krejci2167ee12018-11-02 16:09:07 +0100177 * @brief YANG built-in types
178 */
179typedef enum {
180 LY_TYPE_UNKNOWN = 0, /**< Unknown type */
181 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 +0100182 LY_TYPE_UINT8, /**< 8-bit unsigned integer ([RFC 6020 sec 9.2](http://tools.ietf.org/html/rfc6020#section-9.2)) */
183 LY_TYPE_UINT16, /**< 16-bit unsigned integer ([RFC 6020 sec 9.2](http://tools.ietf.org/html/rfc6020#section-9.2)) */
184 LY_TYPE_UINT32, /**< 32-bit unsigned integer ([RFC 6020 sec 9.2](http://tools.ietf.org/html/rfc6020#section-9.2)) */
185 LY_TYPE_UINT64, /**< 64-bit unsigned integer ([RFC 6020 sec 9.2](http://tools.ietf.org/html/rfc6020#section-9.2)) */
186 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 +0100187 LY_TYPE_BITS, /**< A set of bits or flags ([RFC 6020 sec 9.7](http://tools.ietf.org/html/rfc6020#section-9.7)) */
188 LY_TYPE_BOOL, /**< "true" or "false" ([RFC 6020 sec 9.5](http://tools.ietf.org/html/rfc6020#section-9.5)) */
189 LY_TYPE_DEC64, /**< 64-bit signed decimal number ([RFC 6020 sec 9.3](http://tools.ietf.org/html/rfc6020#section-9.3))*/
190 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)) */
191 LY_TYPE_ENUM, /**< Enumerated strings ([RFC 6020 sec 9.6](http://tools.ietf.org/html/rfc6020#section-9.6)) */
192 LY_TYPE_IDENT, /**< A reference to an abstract identity ([RFC 6020 sec 9.10](http://tools.ietf.org/html/rfc6020#section-9.10)) */
193 LY_TYPE_INST, /**< References a data tree node ([RFC 6020 sec 9.13](http://tools.ietf.org/html/rfc6020#section-9.13)) */
194 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 +0100195 LY_TYPE_UNION, /**< Choice of member types ([RFC 6020 sec 9.12](http://tools.ietf.org/html/rfc6020#section-9.12)) */
196 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 +0100197 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 +0100198 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 +0100199 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 +0100200} LY_DATA_TYPE;
201#define LY_DATA_TYPE_COUNT 20 /**< Number of different types */
202
Radek Krejci5969f272018-11-23 10:03:58 +0100203/**
204 * @brief Stringified YANG built-in data types
205 */
Radek Krejcid505e3d2018-11-13 09:04:17 +0100206extern const char* ly_data_type2str[LY_DATA_TYPE_COUNT];
207
Radek Krejci2167ee12018-11-02 16:09:07 +0100208/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200209 * @brief YANG import-stmt
210 */
211struct lysp_import {
Radek Krejci086c7132018-10-26 15:29:04 +0200212 struct lys_module *module; /**< pointer to the imported module
213 (mandatory, but resolved when the referring module is completely parsed) */
214 const char *name; /**< name of the imported module (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200215 const char *prefix; /**< prefix for the data from the imported schema (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200216 const char *dsc; /**< description */
217 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200218 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200219 char rev[LY_REV_SIZE]; /**< revision-date of the imported module */
220};
221
222/**
223 * @brief YANG include-stmt
224 */
225struct lysp_include {
Radek Krejci0bcdaed2019-01-10 10:21:34 +0100226 struct lysp_submodule *submodule;/**< pointer to the parsed submodule structure
Radek Krejci086c7132018-10-26 15:29:04 +0200227 (mandatory, but resolved when the referring module is completely parsed) */
228 const char *name; /**< name of the included submodule (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200229 const char *dsc; /**< description */
230 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200231 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200232 char rev[LY_REV_SIZE]; /**< revision-date of the included submodule */
233};
234
235/**
236 * @brief YANG extension-stmt
237 */
238struct lysp_ext {
239 const char *name; /**< extension name */
240 const char *argument; /**< argument name, NULL if not specified */
241 const char *dsc; /**< description statement */
242 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200243 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200244 uint16_t flags; /**< LYS_STATUS_* and LYS_YINELEM values (@ref snodeflags) */
245};
246
247/**
248 * @brief Helper structure for generic storage of the extension instances content.
249 */
250struct lysp_stmt {
251 const char *stmt; /**< identifier of the statement */
252 const char *arg; /**< statement's argument */
253 struct lysp_stmt *next; /**< link to the next statement */
Michal Vaskobc2559f2018-09-07 10:17:50 +0200254 struct lysp_stmt *child; /**< list of the statement's substatements (linked list) */
Radek Krejcid3ca0632019-04-16 16:54:54 +0200255 uint16_t flags;
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200256};
257
258/**
259 * @brief YANG extension instance
260 */
261struct lysp_ext_instance {
262 const char *name; /**< extension identifier, including possible prefix */
263 const char *argument; /**< optional value of the extension's argument */
Radek Krejci693262f2019-04-29 15:23:20 +0200264 struct lysp_stmt *child; /**< list of the extension's substatements (linked list) */
Michal Vaskod92e42a2018-09-07 08:35:02 +0200265 LYEXT_SUBSTMT insubstmt; /**< value identifying placement of the extension instance */
266 uint32_t insubstmt_index; /**< in case the instance is in a substatement, this identifies
267 the index of that substatement */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200268};
269
270/**
271 * @brief YANG feature-stmt
272 */
273struct lysp_feature {
274 const char *name; /**< feature name (mandatory) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200275 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200276 const char *dsc; /**< description statement */
277 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200278 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200279 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values allowed */
280};
281
282/**
283 * @brief YANG identity-stmt
284 */
285struct lysp_ident {
286 const char *name; /**< identity name (mandatory), including possible prefix */
Radek Krejci151a5b72018-10-19 14:21:44 +0200287 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
288 const char **bases; /**< list of base identifiers ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200289 const char *dsc; /**< description statement */
290 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200291 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200292 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_ values are allowed */
293};
294
Michal Vasko71e64ca2018-09-07 16:30:29 +0200295/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200296 * @brief Covers restrictions: range, length, pattern, must
297 */
298struct lysp_restr {
299 const char *arg; /**< The restriction expression/value (mandatory);
300 in case of pattern restriction, the first byte has a special meaning:
301 0x06 (ACK) for regular match and 0x15 (NACK) for invert-match */
302 const char *emsg; /**< error-message */
303 const char *eapptag; /**< error-app-tag value */
304 const char *dsc; /**< description */
305 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200306 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200307};
308
309/**
Michal Vasko71e64ca2018-09-07 16:30:29 +0200310 * @brief YANG revision-stmt
311 */
312struct lysp_revision {
Radek Krejcib7db73a2018-10-24 14:18:40 +0200313 char date[LY_REV_SIZE]; /**< revision date (madatory) */
Michal Vasko71e64ca2018-09-07 16:30:29 +0200314 const char *dsc; /**< description statement */
315 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200316 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vasko71e64ca2018-09-07 16:30:29 +0200317};
318
319/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200320 * @brief Enumeration/Bit value definition
321 */
322struct lysp_type_enum {
323 const char *name; /**< name (mandatory) */
324 const char *dsc; /**< description statement */
325 const char *ref; /**< reference statement */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200326 int64_t value; /**< enum's value or bit's position */
Radek Krejci151a5b72018-10-19 14:21:44 +0200327 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200328 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200329 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_ and LYS_SET_VALUE
330 values are allowed */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200331};
332
333/**
334 * @brief YANG type-stmt
335 *
336 * Some of the items in the structure may be mandatory, but it is necessary to resolve the type's base type first
337 */
338struct lysp_type {
339 const char *name; /**< name of the type (mandatory) */
340 struct lysp_restr *range; /**< allowed values range - numerical, decimal64 */
341 struct lysp_restr *length; /**< allowed length of the value - string, binary */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200342 struct lysp_restr *patterns; /**< list of patterns ([sized array](@ref sizedarrays)) - string */
343 struct lysp_type_enum *enums; /**< list of enum-stmts ([sized array](@ref sizedarrays)) - enum */
344 struct lysp_type_enum *bits; /**< list of bit-stmts ([sized array](@ref sizedarrays)) - bits */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200345 const char *path; /**< path - leafref */
Radek Krejci151a5b72018-10-19 14:21:44 +0200346 const char **bases; /**< list of base identifiers ([sized array](@ref sizedarrays)) - identityref */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200347 struct lysp_type *types; /**< list of sub-types ([sized array](@ref sizedarrays)) - union */
348 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200349
Radek Krejci2167ee12018-11-02 16:09:07 +0100350 struct lysc_type *compiled; /**< pointer to the compiled type */
351
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200352 uint8_t fraction_digits; /**< number of fraction digits - decimal64 */
353 uint8_t require_instance; /**< require-instance flag - leafref, instance */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100354 uint16_t flags; /**< [schema node flags](@ref spnodeflags) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200355};
356
357/**
358 * @brief YANG typedef-stmt
359 */
360struct lysp_tpdf {
361 const char *name; /**< name of the newly defined type (mandatory) */
362 const char *units; /**< units of the newly defined type */
363 const char *dflt; /**< default value of the newly defined type */
364 const char *dsc; /**< description statement */
365 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200366 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200367 struct lysp_type type; /**< base type from which the typedef is derived (mandatory) */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100368 uint16_t flags; /**< [schema node flags](@ref spnodeflags) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200369};
370
371/**
372 * @brief YANG grouping-stmt
373 */
374struct lysp_grp {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100375 struct lysp_node *parent; /**< parent node (NULL if this is a top-level grouping) */
376 uint16_t nodetype; /**< LYS_GROUPING */
377 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values are allowed */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200378 const char *name; /**< grouping name (mandatory) */
379 const char *dsc; /**< description statement */
380 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200381 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
382 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200383 struct lysp_node *data; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200384 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
385 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
386 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200387};
388
389/**
390 * @brief YANG when-stmt
391 */
392struct lysp_when {
393 const char *cond; /**< specified condition (mandatory) */
394 const char *dsc; /**< description statement */
395 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200396 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200397};
398
399/**
400 * @brief YANG refine-stmt
401 */
402struct lysp_refine {
403 const char *nodeid; /**< target descendant schema nodeid (mandatory) */
404 const char *dsc; /**< description statement */
405 const char *ref; /**< reference statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200406 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200407 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200408 const char *presence; /**< presence description */
Radek Krejci151a5b72018-10-19 14:21:44 +0200409 const char **dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200410 uint32_t min; /**< min-elements constraint */
411 uint32_t max; /**< max-elements constraint, 0 means unbounded */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200412 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200413 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
414};
415
416/**
417 * @brief YANG uses-augment-stmt and augment-stmt
418 */
419struct lysp_augment {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100420 struct lysp_node *parent; /**< parent node (NULL if this is a top-level augment) */
421 uint16_t nodetype; /**< LYS_AUGMENT */
422 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values are allowed */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200423 const char *nodeid; /**< target schema nodeid (mandatory) - absolute for global augments, descendant for uses's augments */
424 const char *dsc; /**< description statement */
425 const char *ref; /**< reference statement */
426 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200427 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200428 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200429 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
430 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
431 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200432};
433
434/**
435 * @defgroup deviatetypes Deviate types
436 * @{
437 */
438#define LYS_DEV_NOT_SUPPORTED 1 /**< deviate type not-supported */
439#define LYS_DEV_ADD 2 /**< deviate type add */
440#define LYS_DEV_DELETE 3 /**< deviate type delete */
441#define LYS_DEV_REPLACE 4 /**< deviate type replace */
442/** @} */
443
444/**
445 * @brief Generic deviate structure to get type and cast to lysp_deviate_* structure
446 */
447struct lysp_deviate {
448 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
449 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200450 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200451};
452
453struct lysp_deviate_add {
454 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
455 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200456 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200457 const char *units; /**< units of the values */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200458 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200459 const char **uniques; /**< list of uniques specifications ([sized array](@ref sizedarrays)) */
460 const char **dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200461 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
462 uint32_t min; /**< min-elements constraint */
463 uint32_t max; /**< max-elements constraint, 0 means unbounded */
464};
465
466struct lysp_deviate_del {
467 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
468 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200469 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200470 const char *units; /**< units of the values */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200471 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200472 const char **uniques; /**< list of uniques specifications ([sized array](@ref sizedarrays)) */
473 const char **dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200474 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200475};
476
477struct lysp_deviate_rpl {
478 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
479 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200480 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200481 struct lysp_type *type; /**< type of the node */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200482 const char *units; /**< units of the values */
483 const char *dflt; /**< default value */
484 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
485 uint32_t min; /**< min-elements constraint */
486 uint32_t max; /**< max-elements constraint, 0 means unbounded */
487};
488
489struct lysp_deviation {
Michal Vaskob55f6c12018-09-12 11:13:15 +0200490 const char *nodeid; /**< target absolute schema nodeid (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200491 const char *dsc; /**< description statement */
492 const char *ref; /**< reference statement */
493 struct lysp_deviate* deviates; /**< list of deviate specifications (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200494 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200495};
496
Radek Krejci4f28eda2018-11-12 11:46:16 +0100497/**
498 * @defgroup spnodeflags Parsed schema nodes flags
499 * @ingroup snodeflags
500 *
501 * Various flags for parsed schema nodes.
502 *
503 * 1 - container 6 - anydata/anyxml 11 - output 16 - grouping 21 - enum
504 * 2 - choice 7 - case 12 - feature 17 - uses 22 - type
Radek Krejcid3ca0632019-04-16 16:54:54 +0200505 * 3 - leaf 8 - notification 13 - identity 18 - refine 23 - stmt
Radek Krejci4f28eda2018-11-12 11:46:16 +0100506 * 4 - leaflist 9 - rpc 14 - extension 19 - augment
507 * 5 - list 10 - input 15 - typedef 20 - deviate
508 *
Radek Krejcid3ca0632019-04-16 16:54:54 +0200509 * 1 1 1 1 1 1 1 1 1 1 2 2 2 2
510 * bit name 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3
511 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
512 * 1 LYS_CONFIG_W |x|x|x|x|x|x|x| | | | | | | | | | |x| |x| | | |
513 * LYS_SET_BASE | | | | | | | | | | | | | | | | | | | | | |x| |
514 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
515 * 2 LYS_CONFIG_R |x|x|x|x|x|x|x| | | | | | | | | | |x| |x| | | |
516 * LYS_SET_BIT | | | | | | | | | | | | | | | | | | | | | |x| |
517 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
518 * 3 LYS_STATUS_CURR |x|x|x|x|x|x|x|x|x| | |x|x|x|x|x|x| |x|x|x| | |
519 * LYS_SET_ENUM | | | | | | | | | | | | | | | | | | | | | |x| |
520 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
521 * 4 LYS_STATUS_DEPRC |x|x|x|x|x|x|x|x|x| | |x|x|x|x|x|x| |x|x|x| | |
522 * LYS_SET_FRDIGITS | | | | | | | | | | | | | | | | | | | | | |x| |
523 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
524 * 5 LYS_STATUS_OBSLT |x|x|x|x|x|x|x|x|x| | |x|x|x|x|x|x| |x|x|x| | |
525 * LYS_SET_LENGTH | | | | | | | | | | | | | | | | | | | | | |x| |
526 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
527 * 6 LYS_MAND_TRUE | |x|x| | |x| | | | | | | | | | | |x| |x| | | |
528 * LYS_SET_PATH | | | | | | | | | | | | | | | | | | | | | |x| |
529 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
530 * 7 LYS_MAND_FALSE | |x|x| | |x| | | | | | | | | | | |x| |x| | | |
531 * LYS_ORDBY_USER | | | |x|x| | | | | | | | | | | | | | | | | | |
532 * LYS_SET_PATTERN | | | | | | | | | | | | | | | | | | | | | |x| |
533 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
534 * 8 LYS_ORDBY_SYSTEM | | | |x|x| | | | | | | | | | | | | | | | | | |
535 * LYS_YINELEM_TRUE | | | | | | | | | | | | | |x| | | | | | | | | |
536 * LYS_SET_RANGE | | | | | | | | | | | | | | | | | | | | | |x| |
537 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
538 * 9 LYS_YINELEM_FALSE| | | | | | | | | | | | | |x| | | | | | | | | |
539 * LYS_SET_TYPE | | | | | | | | | | | | | | | | | | | | | |x| |
540 * LYS_SINGLEQUOTED | | | | | | | | | | | | | | | | | | | | | | |x|
541 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
542 * 10 LYS_SET_VALUE | | | | | | | | | | | | | | | | | | | | |x| | |
543 * LYS_SET_REQINST | | | | | | | | | | | | | | | | | | | | | |x| |
544 * LYS_SET_MIN | | | |x|x| | | | | | | | | | | | |x| |x| | | |
545 * LYS_DOUBLEQUOTED | | | | | | | | | | | | | | | | | | | | | | |x|
546 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
547 * 11 LYS_SET_MAX | | | |x|x| | | | | | | | | | | | |x| |x| | | |
548 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Radek Krejci4f28eda2018-11-12 11:46:16 +0100549 *
550 */
551
552/**
553 * @defgroup scnodeflags Compiled schema nodes flags
554 * @ingroup snodeflags
555 *
556 * Various flags for compiled schema nodes.
557 *
558 * 1 - container 6 - anydata/anyxml 11 - output
559 * 2 - choice 7 - case 12 - feature
560 * 3 - leaf 8 - notification 13 - identity
561 * 4 - leaflist 9 - rpc 14 - extension
Radek Krejci693262f2019-04-29 15:23:20 +0200562 * 5 - list 10 - input 15 - bitenum
Radek Krejci4f28eda2018-11-12 11:46:16 +0100563 *
Radek Krejci693262f2019-04-29 15:23:20 +0200564 * 1 1 1 1 1 1
565 * bit name 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5
566 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
567 * 1 LYS_CONFIG_W |x|x|x|x|x|x|x| | | | | | | | |
568 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
569 * 2 LYS_CONFIG_R |x|x|x|x|x|x|x| | | | | | | | |
570 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
571 * 3 LYS_STATUS_CURR |x|x|x|x|x|x|x|x|x| | |x|x|x| |
572 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
573 * 4 LYS_STATUS_DEPRC |x|x|x|x|x|x|x|x|x| | |x|x|x| |
574 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
575 * 5 LYS_STATUS_OBSLT |x|x|x|x|x|x|x|x|x| | |x|x|x| |
576 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
577 * 6 LYS_MAND_TRUE |x|x|x|x|x|x| | | | | | | | | |
578 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
579 * 7 LYS_ORDBY_USER | | | |x|x| | | | | | | | | | |
580 * LYS_MAND_FALSE | |x|x| | |x| | | | | | | | | |
581 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
582 * 8 LYS_ORDBY_SYSTEM | | | |x|x| | | | | | | | | | |
583 * LYS_PRESENCE |x| | | | | | | | | | | | | | |
584 * LYS_UNIQUE | | |x| | | | | | | | | | | | |
585 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
586 * 9 LYS_KEY | | |x| | | | | | | | | | | | |
587 * LYS_FENABLED | | | | | | | | | | | |x| | | |
588 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
589 * 10 LYS_SET_DFLT | | |x|x| | |x| | | | | | | | |
590 * LYS_ISENUM | | | | | | | | | | | | | | |x|
591 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
592 * 11 LYS_SET_UNITS | | |x|x| | | | | | | | | | | |
593 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
594 * 11 LYS_SET_CONFIG |x|x|x|x|x|x|x| | |x|x| | | | |
595 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Radek Krejci4f28eda2018-11-12 11:46:16 +0100596 *
597 */
598
599/**
600 * @defgroup snodeflags Schema nodes flags
601 * @ingroup schematree
602 * @{
603 */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200604#define LYS_CONFIG_W 0x01 /**< config true; */
605#define LYS_CONFIG_R 0x02 /**< config false; */
606#define LYS_CONFIG_MASK 0x03 /**< mask for config value */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100607#define LYS_STATUS_CURR 0x04 /**< status current; */
608#define LYS_STATUS_DEPRC 0x08 /**< status deprecated; */
609#define LYS_STATUS_OBSLT 0x10 /**< status obsolete; */
610#define LYS_STATUS_MASK 0x1C /**< mask for status value */
611#define LYS_MAND_TRUE 0x20 /**< mandatory true; applicable only to ::lysp_node_choice/::lysc_node_choice,
Radek Krejcife909632019-02-12 15:34:42 +0100612 ::lysp_node_leaf/::lysc_node_leaf and ::lysp_node_anydata/::lysc_node_anydata.
613 The ::lysc_node_leaflist and ::lysc_node_leaflist have this flag in case that min-elements > 0.
614 The ::lysc_node_container has this flag if it is not a presence container and it has at least one
615 child with LYS_MAND_TRUE. */
Radek Krejcif1421c22019-02-19 13:05:20 +0100616#define LYS_MAND_FALSE 0x40 /**< mandatory false; applicable only to ::lysp_node_choice/::lysc_node_choice,
617 ::lysp_node_leaf/::lysc_node_leaf and ::lysp_node_anydata/::lysc_node_anydata.
618 This flag is present only in case the mandatory false statement was explicitly specified. */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100619#define LYS_MAND_MASK 0x60 /**< mask for mandatory values */
Radek Krejci7adf4ff2018-12-05 08:55:00 +0100620#define LYS_PRESENCE 0x80 /**< flag for presence property of a container, applicable only to ::lysc_node_container */
621#define LYS_UNIQUE 0x80 /**< flag for leafs being part of a unique set, applicable only to ::lysc_node_leaf */
622#define LYS_KEY 0x100 /**< flag for leafs being a key of a list, applicable only to ::lysc_node_leaf */
623#define LYS_FENABLED 0x100 /**< feature enabled flag, applicable only to ::lysc_feature */
Radek Krejcife909632019-02-12 15:34:42 +0100624#define LYS_ORDBY_SYSTEM 0x80 /**< ordered-by user lists, applicable only to ::lysc_node_leaflist/::lysp_node_leaflist and
Radek Krejci4f28eda2018-11-12 11:46:16 +0100625 ::lysc_node_list/::lysp_node_list */
626#define LYS_ORDBY_USER 0x40 /**< ordered-by user lists, applicable only to ::lysc_node_leaflist/::lysp_node_leaflist and
627 ::lysc_node_list/::lysp_node_list */
628#define LYS_ORDBY_MASK 0x60 /**< mask for ordered-by values */
629#define LYS_YINELEM_TRUE 0x80 /**< yin-element true for extension's argument */
630#define LYS_YINELEM_FALSE 0x100 /**< yin-element false for extension's argument */
631#define LYS_YINELEM_MASK 0x180 /**< mask for yin-element value */
632#define LYS_SET_VALUE 0x200 /**< value attribute is set */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100633#define LYS_SET_MIN 0x200 /**< min attribute is set */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200634#define LYS_SET_MAX 0x400 /**< max attribute is set */
Radek Krejcid505e3d2018-11-13 09:04:17 +0100635
636#define LYS_SET_BASE 0x0001 /**< type's flag for present base substatement */
637#define LYS_SET_BIT 0x0002 /**< type's flag for present bit substatement */
638#define LYS_SET_ENUM 0x0004 /**< type's flag for present enum substatement */
639#define LYS_SET_FRDIGITS 0x0008 /**< type's flag for present fraction-digits substatement */
640#define LYS_SET_LENGTH 0x0010 /**< type's flag for present length substatement */
641#define LYS_SET_PATH 0x0020 /**< type's flag for present path substatement */
642#define LYS_SET_PATTERN 0x0040 /**< type's flag for present pattern substatement */
643#define LYS_SET_RANGE 0x0080 /**< type's flag for present range substatement */
644#define LYS_SET_TYPE 0x0100 /**< type's flag for present type substatement */
645#define LYS_SET_REQINST 0x0200 /**< type's flag for present require-instance substatement */
Radek Krejciccd20f12019-02-15 14:12:27 +0100646#define LYS_SET_DFLT 0x0200 /**< flag to mark leaf/leaflist with own (or refined) default value, not a default value taken from its type, and default
Radek Krejci76b3e962018-12-14 17:01:25 +0100647 cases of choice. This information is important for refines, since it is prohibited to make leafs
648 with default statement mandatory. In case the default leaf value is taken from type, it is thrown
Radek Krejciccd20f12019-02-15 14:12:27 +0100649 away when it is refined to be mandatory node. Similarly it is used for deviations to distinguish
650 between own default or the default values taken from the type. */
651#define LYS_SET_UNITS 0x0400 /**< flag to know if the leaf's/leaflist's units are their own (flag set) or it is taken from the type. */
Radek Krejcif1421c22019-02-19 13:05:20 +0100652#define LYS_SET_CONFIG 0x0800 /**< flag to know if the config property was set explicitly (flag set) or it is inherited. */
Radek Krejci0e5d8382018-11-28 16:37:53 +0100653
Radek Krejcid3ca0632019-04-16 16:54:54 +0200654#define LYS_SINGLEQUOTED 0x100 /**< flag for single-quoted argument of an extension instance's substatement */
655#define LYS_DOUBLEQUOTED 0x200 /**< flag for double-quoted argument of an extension instance's substatement */
656
Radek Krejci693262f2019-04-29 15:23:20 +0200657#define LYS_ISENUM 0x200 /**< flag to simply distinguish type in struct lysc_type_bitenum_item */
658
Radek Krejcife909632019-02-12 15:34:42 +0100659#define LYS_FLAGS_COMPILED_MASK 0xff /**< mask for flags that maps to the compiled structures */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100660/** @} */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200661
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200662/**
663 * @brief Generic YANG data node
664 */
665struct lysp_node {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100666 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200667 uint16_t nodetype; /**< type of the node (mandatory) */
668 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100669 struct lysp_node *next; /**< next sibling node (NULL if there is no one) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200670 const char *name; /**< node name (mandatory) */
671 const char *dsc; /**< description statement */
672 const char *ref; /**< reference statement */
673 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200674 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200675 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200676};
677
678/**
679 * @brief Extension structure of the lysp_node for YANG container
680 */
681struct lysp_node_container {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100682 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200683 uint16_t nodetype; /**< LYS_CONTAINER */
684 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
685 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
686 const char *name; /**< node name (mandatory) */
687 const char *dsc; /**< description statement */
688 const char *ref; /**< reference statement */
689 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200690 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200691 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200692
693 /* container */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200694 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200695 const char *presence; /**< presence description */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200696 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
697 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200698 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200699 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
700 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200701};
702
703struct lysp_node_leaf {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100704 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200705 uint16_t nodetype; /**< LYS_LEAF */
706 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
707 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
708 const char *name; /**< node name (mandatory) */
709 const char *dsc; /**< description statement */
710 const char *ref; /**< reference statement */
711 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200712 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200713 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200714
715 /* leaf */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200716 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200717 struct lysp_type type; /**< type of the leaf node (mandatory) */
718 const char *units; /**< units of the leaf's type */
719 const char *dflt; /**< default value */
720};
721
722struct lysp_node_leaflist {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100723 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200724 uint16_t nodetype; /**< LYS_LEAFLIST */
725 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
726 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
727 const char *name; /**< node name (mandatory) */
728 const char *dsc; /**< description statement */
729 const char *ref; /**< reference statement */
730 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200731 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200732 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200733
734 /* leaf-list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200735 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200736 struct lysp_type type; /**< type of the leaf node (mandatory) */
737 const char *units; /**< units of the leaf's type */
Radek Krejci151a5b72018-10-19 14:21:44 +0200738 const char **dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200739 uint32_t min; /**< min-elements constraint */
740 uint32_t max; /**< max-elements constraint, 0 means unbounded */
741};
742
743struct lysp_node_list {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100744 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200745 uint16_t nodetype; /**< LYS_LIST */
746 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
747 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
748 const char *name; /**< node name (mandatory) */
749 const char *dsc; /**< description statement */
750 const char *ref; /**< reference statement */
751 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200752 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200753 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200754
755 /* list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200756 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200757 const char *key; /**< keys specification */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200758 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
759 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200760 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200761 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
762 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200763 const char **uniques; /**< list of unique specifications ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200764 uint32_t min; /**< min-elements constraint */
765 uint32_t max; /**< max-elements constraint, 0 means unbounded */
766};
767
768struct lysp_node_choice {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100769 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200770 uint16_t nodetype; /**< LYS_CHOICE */
771 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
772 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
773 const char *name; /**< node name (mandatory) */
774 const char *dsc; /**< description statement */
775 const char *ref; /**< reference statement */
776 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200777 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200778 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200779
780 /* choice */
781 struct lysp_node *child; /**< list of data nodes (linked list) */
782 const char* dflt; /**< default case */
783};
784
785struct lysp_node_case {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100786 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200787 uint16_t nodetype; /**< LYS_CASE */
788 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
789 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
790 const char *name; /**< node name (mandatory) */
791 const char *dsc; /**< description statement */
792 const char *ref; /**< reference statement */
793 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200794 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200795 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200796
797 /* case */
798 struct lysp_node *child; /**< list of data nodes (linked list) */
799};
800
801struct lysp_node_anydata {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100802 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200803 uint16_t nodetype; /**< LYS_ANYXML || LYS_ANYDATA */
804 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
805 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
806 const char *name; /**< node name (mandatory) */
807 const char *dsc; /**< description statement */
808 const char *ref; /**< reference statement */
809 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200810 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200811 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200812
813 /* anyxml/anydata */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200814 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200815};
816
817struct lysp_node_uses {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100818 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200819 uint16_t nodetype; /**< LYS_USES */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200820 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
821 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
822 const char *name; /**< grouping name reference (mandatory) */
823 const char *dsc; /**< description statement */
824 const char *ref; /**< reference statement */
825 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200826 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200827 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200828
829 /* uses */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200830 struct lysp_refine *refines; /**< list of uses's refines ([sized array](@ref sizedarrays)) */
831 struct lysp_augment *augments; /**< list of uses's augment ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200832};
833
834/**
835 * @brief YANG input-stmt and output-stmt
836 */
837struct lysp_action_inout {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100838 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
839 uint16_t nodetype; /**< LYS_INOUT */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200840 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
841 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
842 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200843 struct lysp_node *data; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200844 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200845};
846
847/**
848 * @brief YANG rpc-stmt and action-stmt
849 */
850struct lysp_action {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100851 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
852 uint16_t nodetype; /**< LYS_ACTION */
853 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200854 const char *name; /**< grouping name reference (mandatory) */
855 const char *dsc; /**< description statement */
856 const char *ref; /**< reference statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200857 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200858 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
859 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci6eeb58f2019-02-22 16:29:37 +0100860 struct lysp_action_inout input; /**< RPC's/Action's input */
861 struct lysp_action_inout output; /**< RPC's/Action's output */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200862 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200863};
864
865/**
866 * @brief YANG notification-stmt
867 */
868struct lysp_notif {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100869 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
870 uint16_t nodetype; /**< LYS_NOTIF */
871 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values are allowed */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200872 const char *name; /**< grouping name reference (mandatory) */
873 const char *dsc; /**< description statement */
874 const char *ref; /**< reference statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200875 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200876 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
877 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
878 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200879 struct lysp_node *data; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200880 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200881};
882
883/**
Radek Krejcif0fceb62018-09-05 14:58:45 +0200884 * @brief supported YANG schema version values
885 */
886typedef enum LYS_VERSION {
887 LYS_VERSION_UNDEF = 0, /**< no specific version, YANG 1.0 as default */
888 LYS_VERSION_1_0 = 1, /**< YANG 1.0 */
889 LYS_VERSION_1_1 = 2 /**< YANG 1.1 */
890} LYS_VERSION;
891
892/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200893 * @brief Printable YANG schema tree structure representing YANG module.
894 *
895 * Simple structure corresponding to the YANG format. The schema is only syntactically validated.
896 */
897struct lysp_module {
Radek Krejci0bcdaed2019-01-10 10:21:34 +0100898 struct lys_module *mod; /**< covering module structure */
899
Radek Krejcib7db73a2018-10-24 14:18:40 +0200900 struct lysp_revision *revs; /**< list of the module revisions ([sized array](@ref sizedarrays)), the first revision
901 in the list is always the last (newest) revision of the module */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200902 struct lysp_import *imports; /**< list of imported modules ([sized array](@ref sizedarrays)) */
903 struct lysp_include *includes; /**< list of included submodules ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200904 struct lysp_ext *extensions; /**< list of extension statements ([sized array](@ref sizedarrays)) */
905 struct lysp_feature *features; /**< list of feature definitions ([sized array](@ref sizedarrays)) */
906 struct lysp_ident *identities; /**< list of identities ([sized array](@ref sizedarrays)) */
907 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
908 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200909 struct lysp_node *data; /**< list of module's top-level data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200910 struct lysp_augment *augments; /**< list of augments ([sized array](@ref sizedarrays)) */
911 struct lysp_action *rpcs; /**< list of RPCs ([sized array](@ref sizedarrays)) */
912 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
913 struct lysp_deviation *deviations; /**< list of deviations ([sized array](@ref sizedarrays)) */
914 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200915
Radek Krejci0bcdaed2019-01-10 10:21:34 +0100916 uint8_t parsing:1; /**< flag for circular check */
917};
918
919struct lysp_submodule {
920 const char *belongsto; /**< belongs to parent module (submodule - mandatory) */
921
922 struct lysp_revision *revs; /**< list of the module revisions ([sized array](@ref sizedarrays)), the first revision
923 in the list is always the last (newest) revision of the module */
924 struct lysp_import *imports; /**< list of imported modules ([sized array](@ref sizedarrays)) */
925 struct lysp_include *includes; /**< list of included submodules ([sized array](@ref sizedarrays)) */
926 struct lysp_ext *extensions; /**< list of extension statements ([sized array](@ref sizedarrays)) */
927 struct lysp_feature *features; /**< list of feature definitions ([sized array](@ref sizedarrays)) */
928 struct lysp_ident *identities; /**< list of identities ([sized array](@ref sizedarrays)) */
929 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
930 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
931 struct lysp_node *data; /**< list of module's top-level data nodes (linked list) */
932 struct lysp_augment *augments; /**< list of augments ([sized array](@ref sizedarrays)) */
933 struct lysp_action *rpcs; /**< list of RPCs ([sized array](@ref sizedarrays)) */
934 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
935 struct lysp_deviation *deviations; /**< list of deviations ([sized array](@ref sizedarrays)) */
936 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
937
938 uint8_t parsing:1; /**< flag for circular check */
939
Radek Krejci086c7132018-10-26 15:29:04 +0200940 uint8_t latest_revision:2; /**< flag to mark the latest available revision:
941 1 - the latest revision in searchdirs was not searched yet and this is the
942 latest revision in the current context
943 2 - searchdirs were searched and this is the latest available revision */
Radek Krejci0bcdaed2019-01-10 10:21:34 +0100944 const char *name; /**< name of the module (mandatory) */
945 const char *filepath; /**< path, if the schema was read from a file, NULL in case of reading from memory */
946 const char *prefix; /**< submodule belongsto prefix of main module (mandatory) */
947 const char *org; /**< party/company responsible for the module */
948 const char *contact; /**< contact information for the module */
949 const char *dsc; /**< description of the module */
950 const char *ref; /**< cross-reference for the module */
Radek Krejci086c7132018-10-26 15:29:04 +0200951 uint8_t version; /**< yang-version (LYS_VERSION values) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200952};
953
954/**
Radek Krejci3f5e3db2018-10-11 15:57:47 +0200955 * @brief Free the printable YANG schema tree structure.
956 *
957 * @param[in] module Printable YANG schema tree structure to free.
958 */
959void lysp_module_free(struct lysp_module *module);
960
961/**
Radek Krejcice8c1592018-10-29 15:35:51 +0100962 * @brief YANG extension instance
963 */
964struct lysc_ext_instance {
965 struct lyext_plugin *plugin; /**< pointer to the plugin implementing the extension (if present) */
966 void *parent; /**< pointer to the parent element holding the extension instance(s), use
967 ::lysc_ext_instance#parent_type to access the schema element */
968 const char *argument; /**< optional value of the extension's argument */
969 LYEXT_SUBSTMT insubstmt; /**< value identifying placement of the extension instance */
970 uint32_t insubstmt_index; /**< in case the instance is in a substatement that can appear multiple times,
971 this identifies the index of the substatement for this extension instance */
Radek Krejci2a408df2018-10-29 16:32:26 +0100972 LYEXT_PARENT parent_type; /**< type of the parent structure */
Radek Krejcice8c1592018-10-29 15:35:51 +0100973#if 0
Radek Krejcice8c1592018-10-29 15:35:51 +0100974 uint8_t ext_type; /**< extension type (#LYEXT_TYPE) */
975 uint8_t padding; /**< 32b padding */
Radek Krejcice8c1592018-10-29 15:35:51 +0100976 struct lys_module *module; /**< pointer to the extension instance's module (mandatory) */
977 LYS_NODE nodetype; /**< LYS_EXT */
978#endif
Radek Krejci2a408df2018-10-29 16:32:26 +0100979 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
980 void *priv; /**< private caller's data, not used by libyang */
Radek Krejcice8c1592018-10-29 15:35:51 +0100981};
982
983/**
Radek Krejcibd8d9ba2018-11-02 16:06:26 +0100984 * @brief Compiled YANG if-feature-stmt
985 */
986struct lysc_iffeature {
987 uint8_t *expr; /**< 2bits array describing the if-feature expression in prefix format, see @ref ifftokens */
988 struct lysc_feature **features; /**< array of pointers to the features used in expression ([sized array](@ref sizedarrays)) */
989};
990
991/**
Radek Krejci151a5b72018-10-19 14:21:44 +0200992 * @brief YANG import-stmt
993 */
994struct lysc_import {
Radek Krejci6d6e4e42018-10-29 13:28:19 +0100995 struct lys_module *module; /**< link to the imported module */
Radek Krejci151a5b72018-10-19 14:21:44 +0200996 const char *prefix; /**< prefix for the data from the imported schema (mandatory) */
Radek Krejcice8c1592018-10-29 15:35:51 +0100997 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200998};
999
1000/**
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001001 * @brief YANG when-stmt
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001002 */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001003struct lysc_when {
1004 struct lyxp_expr *cond; /**< XPath when condition */
Radek Krejcic8b31002019-01-08 10:24:45 +01001005 const char *dsc; /**< description */
1006 const char *ref; /**< reference */
Radek Krejci00b874b2019-02-12 10:54:50 +01001007 struct lysc_node *context; /**< context node for evaluating the expression */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001008 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci00b874b2019-02-12 10:54:50 +01001009 uint32_t refcount; /**< reference counter since some of the when statements are shared among several nodes */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001010};
1011
1012/**
Radek Krejci2a408df2018-10-29 16:32:26 +01001013 * @brief YANG identity-stmt
1014 */
1015struct lysc_ident {
1016 const char *name; /**< identity name (mandatory), including possible prefix */
Radek Krejcic8b31002019-01-08 10:24:45 +01001017 const char *dsc; /**< description */
1018 const char *ref; /**< reference */
Radek Krejci693262f2019-04-29 15:23:20 +02001019 struct lys_module *module; /**< module structure */
Radek Krejci2a408df2018-10-29 16:32:26 +01001020 struct lysc_ident **derived; /**< list of (pointers to the) derived identities ([sized array](@ref sizedarrays)) */
1021 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001022 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejci2a408df2018-10-29 16:32:26 +01001023 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_ values are allowed */
1024};
1025
1026/**
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001027 * @brief YANG feature-stmt
1028 */
1029struct lysc_feature {
1030 const char *name; /**< feature name (mandatory) */
Radek Krejcic8b31002019-01-08 10:24:45 +01001031 const char *dsc; /**< description */
1032 const char *ref; /**< reference */
Radek Krejci693262f2019-04-29 15:23:20 +02001033 struct lys_module *module; /**< module structure */
Radek Krejci151a5b72018-10-19 14:21:44 +02001034 struct lysc_feature **depfeatures;/**< list of pointers to other features depending on this one ([sized array](@ref sizedarrays)) */
Radek Krejcice8c1592018-10-29 15:35:51 +01001035 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001036 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001037 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* and
1038 #LYS_FENABLED values allowed */
1039};
1040
Radek Krejci151a5b72018-10-19 14:21:44 +02001041/**
1042 * @defgroup ifftokens if-feature expression tokens
1043 * Tokens of if-feature expression used in ::lysc_iffeature#expr
1044 *
1045 * @{
1046 */
1047#define LYS_IFF_NOT 0x00 /**< operand "not" */
1048#define LYS_IFF_AND 0x01 /**< operand "and" */
1049#define LYS_IFF_OR 0x02 /**< operand "or" */
1050#define LYS_IFF_F 0x03 /**< feature */
1051/**
1052 * @}
1053 */
1054
1055/**
Radek Krejcib7db73a2018-10-24 14:18:40 +02001056 * @brief Compiled YANG revision statement
1057 */
1058struct lysc_revision {
1059 char date[LY_REV_SIZE]; /**< revision-date (mandatory) */
1060 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1061};
1062
Radek Krejci2167ee12018-11-02 16:09:07 +01001063struct lysc_range {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001064 struct lysc_range_part {
Radek Krejci693262f2019-04-29 15:23:20 +02001065 union { /**< min boundary */
1066 int64_t min_64; /**< for int8, int16, int32, int64 and decimal64 */
1067 uint64_t min_u64; /**< for uint8, uint16, uint32, uint64, string and binary */
Radek Krejci2167ee12018-11-02 16:09:07 +01001068 };
Radek Krejci693262f2019-04-29 15:23:20 +02001069 union { /**< max boundary */
1070 int64_t max_64; /**< for int8, int16, int32, int64 and decimal64 */
1071 uint64_t max_u64; /**< for uint8, uint16, uint32, uint64, string and binary */
Radek Krejci2167ee12018-11-02 16:09:07 +01001072 };
Radek Krejci4f28eda2018-11-12 11:46:16 +01001073 } *parts; /**< compiled range expression ([sized array](@ref sizedarrays)) */
Radek Krejcic8b31002019-01-08 10:24:45 +01001074 const char *dsc; /**< description */
1075 const char *ref; /**< reference */
Radek Krejci2167ee12018-11-02 16:09:07 +01001076 const char *emsg; /**< error-message */
1077 const char *eapptag; /**< error-app-tag value */
1078 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1079};
1080
1081struct lysc_pattern {
Radek Krejci54579462019-04-30 12:47:06 +02001082 const char *expr; /**< original, not compiled, regular expression */
1083 pcre2_code *code; /**< compiled regular expression */
Radek Krejcic8b31002019-01-08 10:24:45 +01001084 const char *dsc; /**< description */
1085 const char *ref; /**< reference */
Radek Krejci2167ee12018-11-02 16:09:07 +01001086 const char *emsg; /**< error-message */
1087 const char *eapptag; /**< error-app-tag value */
1088 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci4586a022018-11-13 11:29:26 +01001089 uint32_t inverted:1; /**< invert-match flag */
1090 uint32_t refcount:31; /**< reference counter */
Radek Krejci2167ee12018-11-02 16:09:07 +01001091};
1092
1093struct lysc_must {
1094 struct lys_module *module; /**< module where the must was defined */
1095 struct lyxp_expr *cond; /**< XPath when condition */
Radek Krejcic8b31002019-01-08 10:24:45 +01001096 const char *dsc; /**< description */
1097 const char *ref; /**< reference */
Radek Krejci2167ee12018-11-02 16:09:07 +01001098 const char *emsg; /**< error-message */
1099 const char *eapptag; /**< error-app-tag value */
1100 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1101};
1102
1103struct lysc_type {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001104 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001105 const char *dflt; /**< type's default value if any */
Radek Krejci2167ee12018-11-02 16:09:07 +01001106 LY_DATA_TYPE basetype; /**< Base type of the type */
1107 uint32_t refcount; /**< reference counter for type sharing */
1108};
1109
1110struct lysc_type_num {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001111 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001112 const char *dflt; /**< type's default value if any */
Radek Krejci2167ee12018-11-02 16:09:07 +01001113 LY_DATA_TYPE basetype; /**< Base type of the type */
1114 uint32_t refcount; /**< reference counter for type sharing */
1115 struct lysc_range *range; /**< Optional range limitation */
1116};
1117
1118struct lysc_type_dec {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001119 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001120 const char *dflt; /**< type's default value if any */
Radek Krejci2167ee12018-11-02 16:09:07 +01001121 LY_DATA_TYPE basetype; /**< Base type of the type */
1122 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci6cba4292018-11-15 17:33:29 +01001123 uint8_t fraction_digits; /**< fraction digits specification */
Radek Krejci2167ee12018-11-02 16:09:07 +01001124 struct lysc_range *range; /**< Optional range limitation */
1125};
1126
1127struct lysc_type_str {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001128 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001129 const char *dflt; /**< type's default value if any */
Radek Krejci2167ee12018-11-02 16:09:07 +01001130 LY_DATA_TYPE basetype; /**< Base type of the type */
1131 uint32_t refcount; /**< reference counter for type sharing */
1132 struct lysc_range *length; /**< Optional length limitation */
Radek Krejci4586a022018-11-13 11:29:26 +01001133 struct lysc_pattern **patterns; /**< Optional list of pointers to pattern limitations ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001134};
1135
Radek Krejci693262f2019-04-29 15:23:20 +02001136struct lysc_type_bitenum_item {
1137 const char *name; /**< enumeration identifier */
1138 const char *dsc; /**< description */
1139 const char *ref; /**< reference */
1140 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1141 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1142 union {
1143 int32_t value; /**< integer value associated with the enumeration */
1144 uint32_t position; /**< non-negative integer value associated with the bit */
1145 };
1146 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_ and LYS_SET_VALUE
1147 values are allowed */
1148};
1149
Radek Krejci2167ee12018-11-02 16:09:07 +01001150struct lysc_type_enum {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001151 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001152 const char *dflt; /**< type's default value if any */
Radek Krejci2167ee12018-11-02 16:09:07 +01001153 LY_DATA_TYPE basetype; /**< Base type of the type */
1154 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci693262f2019-04-29 15:23:20 +02001155 struct lysc_type_bitenum_item *enums; /**< enumerations list ([sized array](@ref sizedarrays)), mandatory (at least 1 item) */
1156};
1157
1158struct lysc_type_bits {
1159 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1160 const char *dflt; /**< type's default value if any */
1161 LY_DATA_TYPE basetype; /**< Base type of the type */
1162 uint32_t refcount; /**< reference counter for type sharing */
1163 struct lysc_type_bitenum_item *bits; /**< bits list ([sized array](@ref sizedarrays)), mandatory (at least 1 item) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001164};
1165
1166struct lysc_type_leafref {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001167 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001168 const char *dflt; /**< type's default value if any */
Radek Krejci2167ee12018-11-02 16:09:07 +01001169 LY_DATA_TYPE basetype; /**< Base type of the type */
1170 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejcia3045382018-11-22 14:30:31 +01001171 const char* path; /**< target path */
Radek Krejci96a0bfd2018-11-22 15:25:06 +01001172 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 +01001173 struct lysc_type *realtype; /**< pointer to the real (first non-leafref in possible leafrefs chain) type. */
Radek Krejci2167ee12018-11-02 16:09:07 +01001174 uint8_t require_instance; /**< require-instance flag */
1175};
1176
1177struct lysc_type_identityref {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001178 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001179 const char *dflt; /**< type's default value if any */
Radek Krejci2167ee12018-11-02 16:09:07 +01001180 LY_DATA_TYPE basetype; /**< Base type of the type */
1181 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci555cb5b2018-11-16 14:54:33 +01001182 struct lysc_ident **bases; /**< list of pointers to the base identities ([sized array](@ref sizedarrays)),
Radek Krejci2167ee12018-11-02 16:09:07 +01001183 mandatory (at least 1 item) */
1184};
1185
1186struct lysc_type_instanceid {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001187 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001188 const char *dflt; /**< type's default value if any */
Radek Krejci2167ee12018-11-02 16:09:07 +01001189 LY_DATA_TYPE basetype; /**< Base type of the type */
1190 uint32_t refcount; /**< reference counter for type sharing */
1191 uint8_t require_instance; /**< require-instance flag */
1192};
1193
Radek Krejci2167ee12018-11-02 16:09:07 +01001194struct lysc_type_union {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001195 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001196 const char *dflt; /**< type's default value if any */
Radek Krejci2167ee12018-11-02 16:09:07 +01001197 LY_DATA_TYPE basetype; /**< Base type of the type */
1198 uint32_t refcount; /**< reference counter for type sharing */
1199 struct lysc_type **types; /**< list of types in the union ([sized array](@ref sizedarrays)), mandatory (at least 1 item) */
1200};
1201
1202struct lysc_type_bin {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001203 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001204 const char *dflt; /**< type's default value if any */
Radek Krejci2167ee12018-11-02 16:09:07 +01001205 LY_DATA_TYPE basetype; /**< Base type of the type */
1206 uint32_t refcount; /**< reference counter for type sharing */
1207 struct lysc_range *length; /**< Optional length limitation */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001208};
1209
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001210struct lysc_action_inout {
1211 struct lysc_node *data; /**< first child node (linked list) */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001212 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1213};
1214
Radek Krejci056d0a82018-12-06 16:57:25 +01001215struct lysc_action {
1216 uint16_t nodetype; /**< LYS_ACTION */
1217 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejci95710c92019-02-11 15:49:55 +01001218 struct lys_module *module; /**< module structure */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001219 struct lysp_action *sp; /**< simply parsed (SP) original of the node, NULL if the SP schema was removed or in case of implicit case node. */
1220 struct lysc_node *parent; /**< parent node (NULL in case of top level node - RPC) */
1221
Radek Krejcifc11bd72019-04-11 16:00:05 +02001222 struct lysc_ext_instance *input_exts; /**< list of the extension instances of input ([sized array](@ref sizedarrays)) */
1223 struct lysc_ext_instance *output_exts; /**< list of the extension instances of outpu ([sized array](@ref sizedarrays)) */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001224
Radek Krejci056d0a82018-12-06 16:57:25 +01001225 const char *name; /**< action/RPC name (mandatory) */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001226 const char *dsc; /**< description */
1227 const char *ref; /**< reference */
1228
Radek Krejcifc11bd72019-04-11 16:00:05 +02001229 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1230 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1231
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001232 struct lysc_action_inout input; /**< RPC's/action's input */
1233 struct lysc_action_inout output; /**< RPC's/action's output */
1234
Radek Krejci056d0a82018-12-06 16:57:25 +01001235};
1236
1237struct lysc_notif {
1238 uint16_t nodetype; /**< LYS_NOTIF */
1239 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejci95710c92019-02-11 15:49:55 +01001240 struct lys_module *module; /**< module structure */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001241 struct lysp_notif *sp; /**< simply parsed (SP) original of the node, NULL if the SP schema was removed or in case of implicit case node. */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001242 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1243
Radek Krejcifc11bd72019-04-11 16:00:05 +02001244 struct lysc_node *data; /**< first child node (linked list) */
1245 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1246
Radek Krejci056d0a82018-12-06 16:57:25 +01001247 const char *name; /**< Notification name (mandatory) */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001248 const char *dsc; /**< description */
1249 const char *ref; /**< reference */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001250
1251 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1252 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejci056d0a82018-12-06 16:57:25 +01001253};
1254
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001255/**
Radek Krejci0af5f5d2018-09-07 15:00:30 +02001256 * @brief Compiled YANG data node
1257 */
1258struct lysc_node {
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001259 uint16_t nodetype; /**< type of the node (mandatory) */
1260 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001261 struct lys_module *module; /**< module structure */
1262 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. */
1263 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1264 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1265 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1266 never NULL. If there is no sibling node, pointer points to the node
1267 itself. In case of the first node, this pointer points to the last
1268 node in the list. */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001269 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001270 const char *dsc; /**< description */
1271 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001272 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci056d0a82018-12-06 16:57:25 +01001273 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001274 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001275};
1276
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001277struct lysc_node_container {
1278 uint16_t nodetype; /**< LYS_CONTAINER */
1279 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1280 struct lys_module *module; /**< module structure */
1281 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. */
1282 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1283 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1284 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1285 never NULL. If there is no sibling node, pointer points to the node
1286 itself. In case of the first node, this pointer points to the last
1287 node in the list. */
1288 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001289 const char *dsc; /**< description */
1290 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001291 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001292 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001293 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001294
1295 struct lysc_node *child; /**< first child node (linked list) */
1296 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1297 struct lysc_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
1298 struct lysc_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001299};
1300
Radek Krejcia3045382018-11-22 14:30:31 +01001301struct lysc_node_case {
Radek Krejci056d0a82018-12-06 16:57:25 +01001302 uint16_t nodetype; /**< LYS_CASE */
1303 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1304 struct lys_module *module; /**< module structure */
1305 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. */
1306 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1307 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1308 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1309 never NULL. If there is no sibling node, pointer points to the node
1310 itself. In case of the first node, this pointer points to the last
1311 node in the list. */
Radek Krejcia3045382018-11-22 14:30:31 +01001312 const char *name; /**< name of the case, including the implicit case */
Radek Krejci12fb9142019-01-08 09:45:30 +01001313 const char *dsc; /**< description */
1314 const char *ref; /**< reference */
Radek Krejci056d0a82018-12-06 16:57:25 +01001315 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci056d0a82018-12-06 16:57:25 +01001316 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001317 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Radek Krejci056d0a82018-12-06 16:57:25 +01001318
Radek Krejcia3045382018-11-22 14:30:31 +01001319 struct lysc_node *child; /**< first child node of the case (linked list). Note that all the children of all the sibling cases are linked
Radek Krejcife13da42019-02-15 14:51:01 +01001320 each other as siblings with the parent pointer pointing to appropriate case node. */
Radek Krejcia3045382018-11-22 14:30:31 +01001321};
1322
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001323struct lysc_node_choice {
1324 uint16_t nodetype; /**< LYS_CHOICE */
1325 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1326 struct lys_module *module; /**< module structure */
1327 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. */
1328 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1329 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1330 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1331 never NULL. If there is no sibling node, pointer points to the node
1332 itself. In case of the first node, this pointer points to the last
1333 node in the list. */
1334 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001335 const char *dsc; /**< description */
1336 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001337 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci056d0a82018-12-06 16:57:25 +01001338 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001339 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001340
Radek Krejcia9026eb2018-12-12 16:04:47 +01001341 struct lysc_node_case *cases; /**< list of the cases (linked list). Note that all the children of all the cases are linked each other
1342 as siblings. Their parent pointers points to the specific case they belongs to, so distinguish the
1343 case is simple. */
Radek Krejci056d0a82018-12-06 16:57:25 +01001344 struct lysc_node_case *dflt; /**< default case of the choice, only a pointer into the cases array. */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001345};
1346
1347struct lysc_node_leaf {
1348 uint16_t nodetype; /**< LYS_LEAF */
1349 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1350 struct lys_module *module; /**< module structure */
1351 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. */
1352 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1353 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1354 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1355 never NULL. If there is no sibling node, pointer points to the node
1356 itself. In case of the first node, this pointer points to the last
1357 node in the list. */
1358 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001359 const char *dsc; /**< description */
1360 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001361 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001362 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001363 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001364
1365 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1366 struct lysc_type *type; /**< type of the leaf node (mandatory) */
Radek Krejcib57cf1e2018-11-23 14:07:05 +01001367
Radek Krejci4f28eda2018-11-12 11:46:16 +01001368 const char *units; /**< units of the leaf's type */
1369 const char *dflt; /**< default value */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001370};
1371
1372struct lysc_node_leaflist {
1373 uint16_t nodetype; /**< LYS_LEAFLIST */
1374 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1375 struct lys_module *module; /**< module structure */
1376 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. */
1377 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1378 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1379 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1380 never NULL. If there is no sibling node, pointer points to the node
1381 itself. In case of the first node, this pointer points to the last
1382 node in the list. */
1383 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001384 const char *dsc; /**< description */
1385 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001386 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcib57cf1e2018-11-23 14:07:05 +01001387 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001388 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Radek Krejcib57cf1e2018-11-23 14:07:05 +01001389
1390 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1391 struct lysc_type *type; /**< type of the leaf node (mandatory) */
1392
Radek Krejci0e5d8382018-11-28 16:37:53 +01001393 const char *units; /**< units of the leaf's type */
1394 const char **dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
1395 uint32_t min; /**< min-elements constraint */
1396 uint32_t max; /**< max-elements constraint */
1397
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001398};
1399
1400struct lysc_node_list {
1401 uint16_t nodetype; /**< LYS_LIST */
1402 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1403 struct lys_module *module; /**< module structure */
1404 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. */
1405 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1406 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1407 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1408 never NULL. If there is no sibling node, pointer points to the node
1409 itself. In case of the first node, this pointer points to the last
1410 node in the list. */
1411 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001412 const char *dsc; /**< description */
1413 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001414 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci9bb94eb2018-12-04 16:48:35 +01001415 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001416 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Radek Krejci9bb94eb2018-12-04 16:48:35 +01001417
1418 struct lysc_node *child; /**< first child node (linked list) */
1419 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1420 struct lysc_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
1421 struct lysc_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
1422
1423 struct lysc_node_leaf **keys; /**< list of pointers to the keys ([sized array](@ref sizedarrays)) */
1424 struct lysc_node_leaf ***uniques; /**< list of sized arrays of pointers to the unique nodes ([sized array](@ref sizedarrays)) */
1425 uint32_t min; /**< min-elements constraint */
1426 uint32_t max; /**< max-elements constraint */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001427};
1428
1429struct lysc_node_anydata {
1430 uint16_t nodetype; /**< LYS_ANYXML or LYS_ANYDATA */
1431 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1432 struct lys_module *module; /**< module structure */
1433 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. */
1434 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1435 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1436 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1437 never NULL. If there is no sibling node, pointer points to the node
1438 itself. In case of the first node, this pointer points to the last
1439 node in the list. */
1440 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001441 const char *dsc; /**< description */
1442 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001443 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci056d0a82018-12-06 16:57:25 +01001444 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001445 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Radek Krejci9800fb82018-12-13 14:26:23 +01001446
1447 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001448};
1449
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001450/**
1451 * @brief Compiled YANG schema tree structure representing YANG module.
1452 *
1453 * Semantically validated YANG schema tree for data tree parsing.
1454 * Contains only the necessary information for the data validation.
1455 */
1456struct lysc_module {
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001457 struct lys_module *mod; /**< covering module structure */
Radek Krejci151a5b72018-10-19 14:21:44 +02001458 struct lysc_import *imports; /**< list of imported modules ([sized array](@ref sizedarrays)) */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001459
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001460 struct lysc_feature *features; /**< list of feature definitions ([sized array](@ref sizedarrays)) */
Radek Krejci2a408df2018-10-29 16:32:26 +01001461 struct lysc_ident *identities; /**< list of identities ([sized array](@ref sizedarrays)) */
1462 struct lysc_node *data; /**< list of module's top-level data nodes (linked list) */
1463 struct lysc_action *rpcs; /**< list of RPCs ([sized array](@ref sizedarrays)) */
1464 struct lysc_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejcice8c1592018-10-29 15:35:51 +01001465 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci0af5f5d2018-09-07 15:00:30 +02001466};
1467
1468/**
Radek Krejci53ea6152018-12-13 15:21:15 +01001469 * @brief Get the groupings sized array of the given (parsed) schema node.
1470 * Decides the node's type and in case it has a groupings array, returns it.
1471 * @param[in] node Node to examine.
1472 * @return The node's groupings sized array if any, NULL otherwise.
1473 */
1474const struct lysp_grp *lysp_node_groupings(const struct lysp_node *node);
1475
1476/**
Radek Krejci056d0a82018-12-06 16:57:25 +01001477 * @brief Get the typedefs sized array of the given (parsed) schema node.
1478 * Decides the node's type and in case it has a typedefs array, returns it.
1479 * @param[in] node Node to examine.
1480 * @return The node's typedefs sized array if any, NULL otherwise.
1481 */
1482const struct lysp_tpdf *lysp_node_typedefs(const struct lysp_node *node);
1483
1484/**
1485 * @brief Get the actions/RPCs sized array of the given (parsed) schema node.
1486 * Decides the node's type and in case it has a actions/RPCs array, returns it.
1487 * @param[in] node Node to examine.
1488 * @return The node's actions/RPCs sized array if any, NULL otherwise.
1489 */
1490const struct lysp_action *lysp_node_actions(const struct lysp_node *node);
1491
1492/**
1493 * @brief Get the Notifications sized array of the given (parsed) schema node.
1494 * Decides the node's type and in case it has a Notifications array, returns it.
1495 * @param[in] node Node to examine.
1496 * @return The node's Notifications sized array if any, NULL otherwise.
1497 */
1498const struct lysp_notif *lysp_node_notifs(const struct lysp_node *node);
1499
1500/**
1501 * @brief Get the children linked list of the given (parsed) schema node.
1502 * Decides the node's type and in case it has a children list, returns it.
1503 * @param[in] node Node to examine.
1504 * @return The node's children linked list if any, NULL otherwise.
1505 */
1506const struct lysp_node *lysp_node_children(const struct lysp_node *node);
1507
1508/**
1509 * @brief Get the actions/RPCs sized array of the given (compiled) schema node.
1510 * Decides the node's type and in case it has a actions/RPCs array, returns it.
1511 * @param[in] node Node to examine.
1512 * @return The node's actions/RPCs sized array if any, NULL otherwise.
1513 */
1514const struct lysc_action *lysc_node_actions(const struct lysc_node *node);
1515
1516/**
1517 * @brief Get the Notifications sized array of the given (compiled) schema node.
1518 * Decides the node's type and in case it has a Notifications array, returns it.
1519 * @param[in] node Node to examine.
1520 * @return The node's Notifications sized array if any, NULL otherwise.
1521 */
1522const struct lysc_notif *lysc_node_notifs(const struct lysc_node *node);
1523
1524/**
1525 * @brief Get the children linked list of the given (compiled) schema node.
1526 * Decides the node's type and in case it has a children list, returns it.
1527 * @param[in] node Node to examine.
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001528 * @param[in] flags Config flag to distinguish input (LYS_CONFIG_W) and output (LYS_CONFIG_R) data in case of RPC/action node.
Radek Krejci056d0a82018-12-06 16:57:25 +01001529 * @return The node's children linked list if any, NULL otherwise.
1530 */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001531const struct lysc_node *lysc_node_children(const struct lysc_node *node, uint16_t flags);
Radek Krejci056d0a82018-12-06 16:57:25 +01001532
1533/**
Radek Krejci151a5b72018-10-19 14:21:44 +02001534 * @brief Get how the if-feature statement currently evaluates.
1535 *
1536 * @param[in] iff Compiled if-feature statement to evaluate.
1537 * @return If the statement evaluates to true, 1 is returned. 0 is returned when the statement evaluates to false.
1538 */
1539int lysc_iffeature_value(const struct lysc_iffeature *iff);
1540
1541/**
1542 * @brief Get the current status of the provided feature.
1543 *
1544 * @param[in] feature Compiled feature statement to examine.
1545 * @return
1546 * - 1 if feature is enabled,
1547 * - 0 if feature is disabled,
1548 * - -1 in case of error (invalid argument)
1549 */
1550int lysc_feature_value(const struct lysc_feature *feature);
1551
1552/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001553 * @brief Available YANG schema tree structures representing YANG module.
1554 */
1555struct lys_module {
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001556 struct ly_ctx *ctx; /**< libyang context of the module (mandatory) */
1557 const char *name; /**< name of the module (mandatory) */
Radek Krejci0af46292019-01-11 16:02:31 +01001558 const char *revision; /**< revision of the module (if present) */
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001559 const char *ns; /**< namespace of the module (module - mandatory) */
1560 const char *prefix; /**< module prefix or submodule belongsto prefix of main module (mandatory) */
1561 const char *filepath; /**< path, if the schema was read from a file, NULL in case of reading from memory */
1562 const char *org; /**< party/company responsible for the module */
1563 const char *contact; /**< contact information for the module */
1564 const char *dsc; /**< description of the module */
1565 const char *ref; /**< cross-reference for the module */
1566
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001567 struct lysp_module *parsed; /**< Simply parsed (unresolved) YANG schema tree */
Radek Krejci0af46292019-01-11 16:02:31 +01001568 struct lysc_module *compiled; /**< Compiled and fully validated YANG schema tree for data parsing.
1569 Available only for implemented modules. */
1570 struct lysc_feature *off_features;/**< List of pre-compiled features of the module in non implemented modules ([sized array](@ref sizedarrays)).
1571 These features are always disabled and cannot be enabled until the module
1572 become implemented. The features are present in this form to allow their linkage
1573 from if-feature statements of the compiled schemas and their proper use in case
1574 the module became implemented in future (no matter if implicitly via augment/deviate
1575 or explicitly via ly_ctx_module_implement()). */
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001576
Radek Krejci95710c92019-02-11 15:49:55 +01001577 uint8_t implemented; /**< flag if the module is implemented, not just imported. The module is implemented if
1578 the flag has non-zero value. Specific values are used internally:
1579 1 - implemented module
1580 2 - recently implemented module by dependency, it can be reverted in rollback procedure */
1581 uint8_t latest_revision; /**< flag to mark the latest available revision:
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001582 1 - the latest revision in searchdirs was not searched yet and this is the
1583 latest revision in the current context
1584 2 - searchdirs were searched and this is the latest available revision */
1585 uint8_t version; /**< yang-version (LYS_VERSION values) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001586};
1587
Radek Krejci151a5b72018-10-19 14:21:44 +02001588/**
1589 * @brief Enable specified feature in the module
1590 *
1591 * By default, when the module is loaded by libyang parser, all features are disabled.
1592 *
Radek Krejcica3db002018-11-01 10:31:01 +01001593 * If all features are being enabled, it must be possible respecting their if-feature conditions. For example,
1594 * enabling all features on the following feature set will fail since it is not possible to enable both features
1595 * (and it is unclear which of them should be enabled then). In this case the LY_EDENIED is returned and the feature
1596 * is untouched.
1597 *
1598 * feature f1;
1599 * feature f2 { if-feature 'not f1';}
1600 *
Radek Krejci151a5b72018-10-19 14:21:44 +02001601 * @param[in] module Module where the feature will be enabled.
1602 * @param[in] feature Name of the feature to enable. To enable all features at once, use asterisk (`*`) character.
1603 * @return LY_ERR value.
1604 */
Radek Krejcied5acc52019-04-25 15:57:04 +02001605LY_ERR lys_feature_enable(const struct lys_module *module, const char *feature);
Radek Krejci151a5b72018-10-19 14:21:44 +02001606
1607/**
1608 * @brief Disable specified feature in the module
1609 *
1610 * By default, when the module is loaded by libyang parser, all features are disabled.
1611 *
1612 * @param[in] module Module where the feature will be disabled.
1613 * @param[in] feature Name of the feature to disable. To disable all features at once, use asterisk (`*`) character.
1614 * @return LY_ERR value
1615 */
Radek Krejcied5acc52019-04-25 15:57:04 +02001616LY_ERR lys_feature_disable(const struct lys_module *module, const char *feature);
Radek Krejci151a5b72018-10-19 14:21:44 +02001617
1618/**
1619 * @brief Get the current status of the specified feature in the module.
1620 *
1621 * @param[in] module Module where the feature is defined.
1622 * @param[in] feature Name of the feature to inspect.
1623 * @return
1624 * - 1 if feature is enabled,
1625 * - 0 if feature is disabled,
1626 * - -1 in case of error (e.g. feature is not defined or invalid arguments)
1627 */
1628int lys_feature_value(const struct lys_module *module, const char *feature);
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001629
1630/**
Radek Krejci86d106e2018-10-18 09:53:19 +02001631 * @brief Load a schema into the specified context.
1632 *
1633 * @param[in] ctx libyang context where to process the data model.
1634 * @param[in] data The string containing the dumped data model in the specified
1635 * format.
1636 * @param[in] format Format of the input data (YANG or YIN).
1637 * @return Pointer to the data model structure or NULL on error.
1638 */
Radek Krejcid14e9692018-11-01 11:00:37 +01001639struct lys_module *lys_parse_mem(struct ly_ctx *ctx, const char *data, LYS_INFORMAT format);
Radek Krejci86d106e2018-10-18 09:53:19 +02001640
1641/**
1642 * @brief Read a schema from file descriptor into the specified context.
1643 *
1644 * \note Current implementation supports only reading data from standard (disk) file, not from sockets, pipes, etc.
1645 *
1646 * @param[in] ctx libyang context where to process the data model.
1647 * @param[in] fd File descriptor of a regular file (e.g. sockets are not supported) containing the schema
1648 * in the specified format.
1649 * @param[in] format Format of the input data (YANG or YIN).
1650 * @return Pointer to the data model structure or NULL on error.
1651 */
Radek Krejcid14e9692018-11-01 11:00:37 +01001652struct lys_module *lys_parse_fd(struct ly_ctx *ctx, int fd, LYS_INFORMAT format);
Radek Krejci86d106e2018-10-18 09:53:19 +02001653
1654/**
Radek Krejcid33273d2018-10-25 14:55:52 +02001655 * @brief Read a schema into the specified context from a file.
Radek Krejci86d106e2018-10-18 09:53:19 +02001656 *
1657 * @param[in] ctx libyang context where to process the data model.
1658 * @param[in] path Path to the file with the model in the specified format.
1659 * @param[in] format Format of the input data (YANG or YIN).
1660 * @return Pointer to the data model structure or NULL on error.
1661 */
Radek Krejcid14e9692018-11-01 11:00:37 +01001662struct lys_module *lys_parse_path(struct ly_ctx *ctx, const char *path, LYS_INFORMAT format);
Radek Krejci86d106e2018-10-18 09:53:19 +02001663
1664/**
Radek Krejcid33273d2018-10-25 14:55:52 +02001665 * @brief Search for the schema file in the specified searchpaths.
1666 *
1667 * @param[in] searchpaths NULL-terminated array of paths to be searched (recursively). Current working
1668 * directory is searched automatically (but non-recursively if not in the provided list). Caller can use
1669 * result of the ly_ctx_get_searchdirs().
1670 * @param[in] cwd Flag to implicitly search also in the current working directory (non-recursively).
1671 * @param[in] name Name of the schema to find.
1672 * @param[in] revision Revision of the schema to find. If NULL, the newest found schema filepath is returned.
1673 * @param[out] localfile Mandatory output variable containing absolute path of the found schema. If no schema
1674 * complying the provided restriction is found, NULL is set.
1675 * @param[out] format Optional output variable containing expected format of the schema document according to the
1676 * file suffix.
1677 * @return LY_ERR value (LY_SUCCESS is returned even if the file is not found, then the *localfile is NULL).
1678 */
1679LY_ERR lys_search_localfile(const char * const *searchpaths, int cwd, const char *name, const char *revision, char **localfile, LYS_INFORMAT *format);
1680
1681/**
Radek Krejcia3045382018-11-22 14:30:31 +01001682 * @brief Get next schema tree (sibling) node element that can be instantiated in a data tree. Returned node can
1683 * be from an augment.
1684 *
1685 * lys_getnext() is supposed to be called sequentially. In the first call, the \p last parameter is usually NULL
1686 * and function starts returning i) the first \p parent's child or ii) the first top level element of the \p module.
1687 * Consequent calls suppose to provide the previously returned node as the \p last parameter and still the same
1688 * \p parent and \p module parameters.
1689 *
1690 * Without options, the function is used to traverse only the schema nodes that can be paired with corresponding
1691 * data nodes in a data tree. By setting some \p options the behavior can be modified to the extent that
1692 * all the schema nodes are iteratively returned.
1693 *
1694 * @param[in] last Previously returned schema tree node, or NULL in case of the first call.
1695 * @param[in] parent Parent of the subtree where the function starts processing.
1696 * @param[in] module In case of iterating on top level elements, the \p parent is NULL and
1697 * module must be specified.
1698 * @param[in] options [ORed options](@ref sgetnextflags).
1699 * @return Next schema tree node that can be instantiated in a data tree, NULL in case there is no such element.
1700 */
1701const struct lysc_node *lys_getnext(const struct lysc_node *last, const struct lysc_node *parent,
1702 const struct lysc_module *module, int options);
1703
1704/**
1705 * @defgroup sgetnextflags lys_getnext() flags
1706 * @ingroup schematree
1707 *
1708 * @{
1709 */
1710#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 +01001711#define LYS_GETNEXT_NOCHOICE 0x02 /**< lys_getnext() option to ignore (kind of conditional) nodes within choice node */
Radek Krejci056d0a82018-12-06 16:57:25 +01001712#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 +01001713#define LYS_GETNEXT_INTONPCONT 0x40 /**< lys_getnext() option to look into non-presence container, instead of returning container itself */
1714#define LYS_GETNEXT_NOSTATECHECK 0x100 /**< lys_getnext() option to skip checking module validity (import-only, disabled) and
1715 relevant if-feature conditions state */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001716#define LYS_GETNEXT_OUTPUT 0x200 /**< lys_getnext() option to provide RPC's/action's output schema nodes instead of input schema nodes
1717 provided by default */
Radek Krejcia3045382018-11-22 14:30:31 +01001718/** @} sgetnextflags */
1719
1720/**
1721 * @brief Get child node according to the specified criteria.
1722 *
1723 * @param[in] parent Optional parent of the node to find. If not specified, the module's top-level nodes are searched.
1724 * @param[in] module module of the node to find. It is also limitation for the children node of the given parent.
1725 * @param[in] name Name of the node to find.
1726 * @param[in] name_len Optional length of the name in case it is not NULL-terminated string.
1727 * @param[in] nodetype Optional criteria (to speedup) specifying nodetype(s) of the node to find.
1728 * Used as a bitmask, so multiple nodetypes can be specified.
1729 * @param[in] options [ORed options](@ref sgetnextflags).
1730 * @return Found node if any.
1731 */
1732const struct lysc_node *lys_child(const struct lysc_node *parent, const struct lys_module *module,
1733 const char *name, size_t name_len, uint16_t nodetype, int options);
1734
1735/**
1736 * @brief Check if the schema node is disabled in the schema tree, i.e. there is any disabled if-feature statement
1737 * affecting the node.
1738 *
1739 * @param[in] node Schema node to check.
1740 * @param[in] recursive - 0 to check if-feature only in the \p node schema node,
1741 * - 1 to check if-feature in all ascendant schema nodes until there is a node possibly having an instance in a data tree
1742 * @return - NULL if enabled,
1743 * - pointer to the node with the unsatisfied (disabling) if-feature expression.
1744 */
1745const struct lysc_iffeature *lys_is_disabled(const struct lysc_node *node, int recursive);
1746
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001747/** @} */
1748
Radek Krejci70853c52018-10-15 14:46:16 +02001749#ifdef __cplusplus
1750}
1751#endif
1752
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001753#endif /* LY_TREE_SCHEMA_H_ */