blob: ea5d3e164df1941b7bf4d0f14b6b9c7370034959 [file] [log] [blame]
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001/**
2 * @file tree_schema.h
3 * @author Radek Krejci <rkrejci@cesnet.cz>
4 * @brief libyang representation of YANG schema trees.
5 *
6 * Copyright (c) 2015 - 2018 CESNET, z.s.p.o.
7 *
8 * This source code is licensed under BSD 3-Clause License (the "License").
9 * You may not use this file except in compliance with the License.
10 * You may obtain a copy of the License at
11 *
12 * https://opensource.org/licenses/BSD-3-Clause
13 */
14
15#ifndef LY_TREE_SCHEMA_H_
16#define LY_TREE_SCHEMA_H_
17
Radek Krejci2167ee12018-11-02 16:09:07 +010018#include <pcre.h>
Radek Krejci5aeea3a2018-09-05 13:29:36 +020019#include <stdint.h>
20
Radek Krejcice8c1592018-10-29 15:35:51 +010021#include "extensions.h"
22
Radek Krejci70853c52018-10-15 14:46:16 +020023#ifdef __cplusplus
24extern "C" {
25#endif
26
Radek Krejci5aeea3a2018-09-05 13:29:36 +020027/**
Radek Krejcidd4e8d42018-10-16 14:55:43 +020028 * @brief XPath representation.
29 */
30struct lyxp_expr;
31
32/**
Radek Krejcie53a8dc2018-10-17 12:52:40 +020033 * @brief Macro selector for other LY_ARRAY_* macros, do not use directly!
34 */
35#define LY_ARRAY_SELECT(_1, _2, NAME, ...) NAME
36
37/**
Radek Krejcie53a8dc2018-10-17 12:52:40 +020038 * @brief Helper macro to go through sized-arrays with a pointer iterator.
39 *
40 * Use with opening curly bracket (`{`).
41 *
42 * @param[in] ARRAY Array to go through
43 * @param[in] TYPE Type of the records in the ARRAY
44 * @param[out] ITER Iterating pointer to the item being processed in each loop
45 */
46#define LY_ARRAY_FOR_ITER(ARRAY, TYPE, ITER) \
Radek Krejci2c4e7172018-10-19 15:56:26 +020047 for (ITER = ARRAY; \
48 (ARRAY) && ((void*)ITER - (void*)ARRAY)/(sizeof(TYPE)) < (*((uint32_t*)(ARRAY) - 1)); \
Radek Krejcie53a8dc2018-10-17 12:52:40 +020049 ITER = (void*)((TYPE*)ITER + 1))
50
51/**
52 * @brief Helper macro to go through sized-arrays with a numeric iterator.
53 *
54 * Use with opening curly bracket (`{`).
55 *
56 * To access an item with the INDEX value, use always LY_ARRAY_INDEX macro!
57 *
58 * @param[in] ARRAY Array to go through
59 * @param[out] INDEX Iterating index of the item being processed in each loop
60 */
61#define LY_ARRAY_FOR_INDEX(ARRAY, INDEX) \
62 for (INDEX = 0; \
Radek Krejci2c4e7172018-10-19 15:56:26 +020063 ARRAY && INDEX < (*((uint32_t*)(ARRAY) - 1)); \
Radek Krejcie53a8dc2018-10-17 12:52:40 +020064 ++INDEX)
65
66/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +020067 * @defgroup schematree Schema Tree
68 * @{
69 *
70 * Data structures and functions to manipulate and access schema tree.
71 */
72
Radek Krejci0af5f5d2018-09-07 15:00:30 +020073/**
Radek Krejcie53a8dc2018-10-17 12:52:40 +020074 * @brief Get a number of records in the ARRAY.
Radek Krejci86d106e2018-10-18 09:53:19 +020075 *
76 * Does not check if array exists!
Radek Krejcie53a8dc2018-10-17 12:52:40 +020077 */
Radek Krejci2c4e7172018-10-19 15:56:26 +020078#define LY_ARRAY_SIZE(ARRAY) (*((uint32_t*)(ARRAY) - 1))
Radek Krejcie53a8dc2018-10-17 12:52:40 +020079
80/**
81 * @brief Sized-array iterator (for-loop).
82 *
83 * Use with opening curly bracket (`{`).
84 *
85 * There are 2 variants:
86 *
87 * LY_ARRAY_FOR(ARRAY, TYPE, ITER)
88 *
89 * Where ARRAY is a sized-array to go through, TYPE is the type of the items in the ARRAY and ITER is a pointer variable
90 * providing the items of the ARRAY in the loops. This functionality is provided by LY_ARRAY_FOR_ITER macro
91 *
92 * LY_ARRAY_FOR(ARRAY, INDEX)
93 *
94 * The ARRAY is again a sized-array to go through, the INDEX is a variable (unsigned integer) for storing iterating ARRAY's index
Radek Krejci2c4e7172018-10-19 15:56:26 +020095 * to access the items of ARRAY in the loops. This functionality is provided by LY_ARRAY_FOR_INDEX macro.
Radek Krejcie53a8dc2018-10-17 12:52:40 +020096 */
97#define LY_ARRAY_FOR(ARRAY, ...) LY_ARRAY_SELECT(__VA_ARGS__, LY_ARRAY_FOR_ITER, LY_ARRAY_FOR_INDEX)(ARRAY, __VA_ARGS__)
Radek Krejci5fac3592018-10-12 15:23:45 +020098
99/**
100 * @brief Macro to iterate via all sibling elements without affecting the list itself
101 *
102 * Works for all types of nodes despite it is data or schema tree, but all the
103 * parameters must be pointers to the same type.
104 *
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200105 * Use with opening curly bracket (`{`). All parameters must be of the same type.
Radek Krejci5fac3592018-10-12 15:23:45 +0200106 *
107 * @param START Pointer to the starting element.
108 * @param ELEM Iterator.
109 */
110#define LY_LIST_FOR(START, ELEM) \
111 for ((ELEM) = (START); \
112 (ELEM); \
113 (ELEM) = (ELEM)->next)
114
115/**
Radek Krejci5fac3592018-10-12 15:23:45 +0200116 * @brief Macro to iterate via all sibling elements allowing to modify the list itself (e.g. removing elements)
117 *
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200118 * Use with opening curly bracket (`{`). All parameters must be of the same type.
Radek Krejci5fac3592018-10-12 15:23:45 +0200119 *
120 * @param START Pointer to the starting element.
121 * @param NEXT Temporary storage to allow removing of the current iterator content.
122 * @param ELEM Iterator.
123 */
124#define LY_LIST_FOR_SAFE(START, NEXT, ELEM) \
125 for ((ELEM) = (START); \
126 (ELEM) ? (NEXT = (ELEM)->next, 1) : 0; \
127 (ELEM) = (NEXT))
128
129/**
Radek Krejci0af5f5d2018-09-07 15:00:30 +0200130 * @brief Schema input formats accepted by libyang [parser functions](@ref howtoschemasparsers).
131 */
132typedef enum {
133 LYS_IN_UNKNOWN = 0, /**< unknown format, used as return value in case of error */
134 LYS_IN_YANG = 1, /**< YANG schema input format */
135 LYS_IN_YIN = 2 /**< YIN schema input format */
136} LYS_INFORMAT;
137
138/**
139 * @brief Schema output formats accepted by libyang [printer functions](@ref howtoschemasprinters).
140 */
141typedef enum {
142 LYS_OUT_UNKNOWN = 0, /**< unknown format, used as return value in case of error */
143 LYS_OUT_YANG = 1, /**< YANG schema output format */
144 LYS_OUT_YIN = 2, /**< YIN schema output format */
145 LYS_OUT_TREE, /**< Tree schema output format, for more information see the [printers](@ref howtoschemasprinters) page */
146 LYS_OUT_INFO, /**< Info schema output format, for more information see the [printers](@ref howtoschemasprinters) page */
147 LYS_OUT_JSON, /**< JSON schema output format, reflecting YIN format with conversion of attributes to object's members */
148} LYS_OUTFORMAT;
149
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200150#define LY_REV_SIZE 11 /**< revision data string length (including terminating NULL byte) */
151
Michal Vaskob55f6c12018-09-12 11:13:15 +0200152#define LYS_UNKNOWN 0x0000 /**< uninitalized unknown statement node */
153#define LYS_CONTAINER 0x0001 /**< container statement node */
154#define LYS_CHOICE 0x0002 /**< choice statement node */
155#define LYS_LEAF 0x0004 /**< leaf statement node */
156#define LYS_LEAFLIST 0x0008 /**< leaf-list statement node */
157#define LYS_LIST 0x0010 /**< list statement node */
158#define LYS_ANYXML 0x0020 /**< anyxml statement node */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200159#define LYS_ANYDATA 0x0120 /**< anydata statement node, in tests it can be used for both #LYS_ANYXML and #LYS_ANYDATA */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200160
Radek Krejcia3045382018-11-22 14:30:31 +0100161#define LYS_CASE 0x0040 /**< case statement node */
162#define LYS_USES 0x0080 /**< uses statement node */
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100163#define LYS_INOUT 0x200
Radek Krejci6eeb58f2019-02-22 16:29:37 +0100164#define LYS_ACTION 0x400 /**< RPC or action */
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100165#define LYS_NOTIF 0x800
166#define LYS_GROUPING 0x1000
167#define LYS_AUGMENT 0x2000
168
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200169/**
Radek Krejci2167ee12018-11-02 16:09:07 +0100170 * @brief YANG built-in types
171 */
172typedef enum {
173 LY_TYPE_UNKNOWN = 0, /**< Unknown type */
174 LY_TYPE_BINARY, /**< Any binary data ([RFC 6020 sec 9.8](http://tools.ietf.org/html/rfc6020#section-9.8)) */
Radek Krejci5969f272018-11-23 10:03:58 +0100175 LY_TYPE_UINT8, /**< 8-bit unsigned integer ([RFC 6020 sec 9.2](http://tools.ietf.org/html/rfc6020#section-9.2)) */
176 LY_TYPE_UINT16, /**< 16-bit unsigned integer ([RFC 6020 sec 9.2](http://tools.ietf.org/html/rfc6020#section-9.2)) */
177 LY_TYPE_UINT32, /**< 32-bit unsigned integer ([RFC 6020 sec 9.2](http://tools.ietf.org/html/rfc6020#section-9.2)) */
178 LY_TYPE_UINT64, /**< 64-bit unsigned integer ([RFC 6020 sec 9.2](http://tools.ietf.org/html/rfc6020#section-9.2)) */
179 LY_TYPE_STRING, /**< Human-readable string ([RFC 6020 sec 9.4](http://tools.ietf.org/html/rfc6020#section-9.4)) */
Radek Krejci2167ee12018-11-02 16:09:07 +0100180 LY_TYPE_BITS, /**< A set of bits or flags ([RFC 6020 sec 9.7](http://tools.ietf.org/html/rfc6020#section-9.7)) */
181 LY_TYPE_BOOL, /**< "true" or "false" ([RFC 6020 sec 9.5](http://tools.ietf.org/html/rfc6020#section-9.5)) */
182 LY_TYPE_DEC64, /**< 64-bit signed decimal number ([RFC 6020 sec 9.3](http://tools.ietf.org/html/rfc6020#section-9.3))*/
183 LY_TYPE_EMPTY, /**< A leaf that does not have any value ([RFC 6020 sec 9.11](http://tools.ietf.org/html/rfc6020#section-9.11)) */
184 LY_TYPE_ENUM, /**< Enumerated strings ([RFC 6020 sec 9.6](http://tools.ietf.org/html/rfc6020#section-9.6)) */
185 LY_TYPE_IDENT, /**< A reference to an abstract identity ([RFC 6020 sec 9.10](http://tools.ietf.org/html/rfc6020#section-9.10)) */
186 LY_TYPE_INST, /**< References a data tree node ([RFC 6020 sec 9.13](http://tools.ietf.org/html/rfc6020#section-9.13)) */
187 LY_TYPE_LEAFREF, /**< A reference to a leaf instance ([RFC 6020 sec 9.9](http://tools.ietf.org/html/rfc6020#section-9.9))*/
Radek Krejci2167ee12018-11-02 16:09:07 +0100188 LY_TYPE_UNION, /**< Choice of member types ([RFC 6020 sec 9.12](http://tools.ietf.org/html/rfc6020#section-9.12)) */
189 LY_TYPE_INT8, /**< 8-bit signed integer ([RFC 6020 sec 9.2](http://tools.ietf.org/html/rfc6020#section-9.2)) */
Radek Krejci2167ee12018-11-02 16:09:07 +0100190 LY_TYPE_INT16, /**< 16-bit signed integer ([RFC 6020 sec 9.2](http://tools.ietf.org/html/rfc6020#section-9.2)) */
Radek Krejci2167ee12018-11-02 16:09:07 +0100191 LY_TYPE_INT32, /**< 32-bit signed integer ([RFC 6020 sec 9.2](http://tools.ietf.org/html/rfc6020#section-9.2)) */
Radek Krejci2167ee12018-11-02 16:09:07 +0100192 LY_TYPE_INT64, /**< 64-bit signed integer ([RFC 6020 sec 9.2](http://tools.ietf.org/html/rfc6020#section-9.2)) */
Radek Krejci2167ee12018-11-02 16:09:07 +0100193} LY_DATA_TYPE;
194#define LY_DATA_TYPE_COUNT 20 /**< Number of different types */
195
Radek Krejci5969f272018-11-23 10:03:58 +0100196/**
197 * @brief Stringified YANG built-in data types
198 */
Radek Krejcid505e3d2018-11-13 09:04:17 +0100199extern const char* ly_data_type2str[LY_DATA_TYPE_COUNT];
200
Radek Krejci2167ee12018-11-02 16:09:07 +0100201/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200202 * @brief YANG import-stmt
203 */
204struct lysp_import {
Radek Krejci086c7132018-10-26 15:29:04 +0200205 struct lys_module *module; /**< pointer to the imported module
206 (mandatory, but resolved when the referring module is completely parsed) */
207 const char *name; /**< name of the imported module (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200208 const char *prefix; /**< prefix for the data from the imported schema (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200209 const char *dsc; /**< description */
210 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200211 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200212 char rev[LY_REV_SIZE]; /**< revision-date of the imported module */
213};
214
215/**
216 * @brief YANG include-stmt
217 */
218struct lysp_include {
Radek Krejci0bcdaed2019-01-10 10:21:34 +0100219 struct lysp_submodule *submodule;/**< pointer to the parsed submodule structure
Radek Krejci086c7132018-10-26 15:29:04 +0200220 (mandatory, but resolved when the referring module is completely parsed) */
221 const char *name; /**< name of the included submodule (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200222 const char *dsc; /**< description */
223 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200224 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200225 char rev[LY_REV_SIZE]; /**< revision-date of the included submodule */
226};
227
228/**
229 * @brief YANG extension-stmt
230 */
231struct lysp_ext {
232 const char *name; /**< extension name */
233 const char *argument; /**< argument name, NULL if not specified */
234 const char *dsc; /**< description statement */
235 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200236 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200237 uint16_t flags; /**< LYS_STATUS_* and LYS_YINELEM values (@ref snodeflags) */
238};
239
240/**
241 * @brief Helper structure for generic storage of the extension instances content.
242 */
243struct lysp_stmt {
244 const char *stmt; /**< identifier of the statement */
245 const char *arg; /**< statement's argument */
246 struct lysp_stmt *next; /**< link to the next statement */
Michal Vaskobc2559f2018-09-07 10:17:50 +0200247 struct lysp_stmt *child; /**< list of the statement's substatements (linked list) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200248};
249
250/**
251 * @brief YANG extension instance
252 */
253struct lysp_ext_instance {
254 const char *name; /**< extension identifier, including possible prefix */
255 const char *argument; /**< optional value of the extension's argument */
Michal Vaskod92e42a2018-09-07 08:35:02 +0200256 LYEXT_SUBSTMT insubstmt; /**< value identifying placement of the extension instance */
257 uint32_t insubstmt_index; /**< in case the instance is in a substatement, this identifies
258 the index of that substatement */
Michal Vaskobc2559f2018-09-07 10:17:50 +0200259 struct lysp_stmt *child; /**< list of the extension's substatements (linked list) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200260};
261
262/**
263 * @brief YANG feature-stmt
264 */
265struct lysp_feature {
266 const char *name; /**< feature name (mandatory) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200267 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200268 const char *dsc; /**< description statement */
269 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200270 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200271 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values allowed */
272};
273
274/**
275 * @brief YANG identity-stmt
276 */
277struct lysp_ident {
278 const char *name; /**< identity name (mandatory), including possible prefix */
Radek Krejci151a5b72018-10-19 14:21:44 +0200279 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
280 const char **bases; /**< list of base identifiers ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200281 const char *dsc; /**< description statement */
282 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200283 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200284 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_ values are allowed */
285};
286
Michal Vasko71e64ca2018-09-07 16:30:29 +0200287/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200288 * @brief Covers restrictions: range, length, pattern, must
289 */
290struct lysp_restr {
291 const char *arg; /**< The restriction expression/value (mandatory);
292 in case of pattern restriction, the first byte has a special meaning:
293 0x06 (ACK) for regular match and 0x15 (NACK) for invert-match */
294 const char *emsg; /**< error-message */
295 const char *eapptag; /**< error-app-tag value */
296 const char *dsc; /**< description */
297 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200298 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200299};
300
301/**
Michal Vasko71e64ca2018-09-07 16:30:29 +0200302 * @brief YANG revision-stmt
303 */
304struct lysp_revision {
Radek Krejcib7db73a2018-10-24 14:18:40 +0200305 char date[LY_REV_SIZE]; /**< revision date (madatory) */
Michal Vasko71e64ca2018-09-07 16:30:29 +0200306 const char *dsc; /**< description statement */
307 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200308 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vasko71e64ca2018-09-07 16:30:29 +0200309};
310
311/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200312 * @brief Enumeration/Bit value definition
313 */
314struct lysp_type_enum {
315 const char *name; /**< name (mandatory) */
316 const char *dsc; /**< description statement */
317 const char *ref; /**< reference statement */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200318 int64_t value; /**< enum's value or bit's position */
Radek Krejci151a5b72018-10-19 14:21:44 +0200319 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200320 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200321 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_ and LYS_SET_VALUE
322 values are allowed */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200323};
324
325/**
326 * @brief YANG type-stmt
327 *
328 * Some of the items in the structure may be mandatory, but it is necessary to resolve the type's base type first
329 */
330struct lysp_type {
331 const char *name; /**< name of the type (mandatory) */
332 struct lysp_restr *range; /**< allowed values range - numerical, decimal64 */
333 struct lysp_restr *length; /**< allowed length of the value - string, binary */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200334 struct lysp_restr *patterns; /**< list of patterns ([sized array](@ref sizedarrays)) - string */
335 struct lysp_type_enum *enums; /**< list of enum-stmts ([sized array](@ref sizedarrays)) - enum */
336 struct lysp_type_enum *bits; /**< list of bit-stmts ([sized array](@ref sizedarrays)) - bits */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200337 const char *path; /**< path - leafref */
Radek Krejci151a5b72018-10-19 14:21:44 +0200338 const char **bases; /**< list of base identifiers ([sized array](@ref sizedarrays)) - identityref */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200339 struct lysp_type *types; /**< list of sub-types ([sized array](@ref sizedarrays)) - union */
340 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200341
Radek Krejci2167ee12018-11-02 16:09:07 +0100342 struct lysc_type *compiled; /**< pointer to the compiled type */
343
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200344 uint8_t fraction_digits; /**< number of fraction digits - decimal64 */
345 uint8_t require_instance; /**< require-instance flag - leafref, instance */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100346 uint16_t flags; /**< [schema node flags](@ref spnodeflags) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200347};
348
349/**
350 * @brief YANG typedef-stmt
351 */
352struct lysp_tpdf {
353 const char *name; /**< name of the newly defined type (mandatory) */
354 const char *units; /**< units of the newly defined type */
355 const char *dflt; /**< default value of the newly defined type */
356 const char *dsc; /**< description statement */
357 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200358 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200359 struct lysp_type type; /**< base type from which the typedef is derived (mandatory) */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100360 uint16_t flags; /**< [schema node flags](@ref spnodeflags) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200361};
362
363/**
364 * @brief YANG grouping-stmt
365 */
366struct lysp_grp {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100367 struct lysp_node *parent; /**< parent node (NULL if this is a top-level grouping) */
368 uint16_t nodetype; /**< LYS_GROUPING */
369 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values are allowed */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200370 const char *name; /**< grouping name (mandatory) */
371 const char *dsc; /**< description statement */
372 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200373 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
374 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200375 struct lysp_node *data; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200376 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
377 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
378 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200379};
380
381/**
382 * @brief YANG when-stmt
383 */
384struct lysp_when {
385 const char *cond; /**< specified condition (mandatory) */
386 const char *dsc; /**< description statement */
387 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200388 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200389};
390
391/**
392 * @brief YANG refine-stmt
393 */
394struct lysp_refine {
395 const char *nodeid; /**< target descendant schema nodeid (mandatory) */
396 const char *dsc; /**< description statement */
397 const char *ref; /**< reference statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200398 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200399 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200400 const char *presence; /**< presence description */
Radek Krejci151a5b72018-10-19 14:21:44 +0200401 const char **dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200402 uint32_t min; /**< min-elements constraint */
403 uint32_t max; /**< max-elements constraint, 0 means unbounded */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200404 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200405 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
406};
407
408/**
409 * @brief YANG uses-augment-stmt and augment-stmt
410 */
411struct lysp_augment {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100412 struct lysp_node *parent; /**< parent node (NULL if this is a top-level augment) */
413 uint16_t nodetype; /**< LYS_AUGMENT */
414 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values are allowed */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200415 const char *nodeid; /**< target schema nodeid (mandatory) - absolute for global augments, descendant for uses's augments */
416 const char *dsc; /**< description statement */
417 const char *ref; /**< reference statement */
418 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200419 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200420 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200421 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
422 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
423 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200424};
425
426/**
427 * @defgroup deviatetypes Deviate types
428 * @{
429 */
430#define LYS_DEV_NOT_SUPPORTED 1 /**< deviate type not-supported */
431#define LYS_DEV_ADD 2 /**< deviate type add */
432#define LYS_DEV_DELETE 3 /**< deviate type delete */
433#define LYS_DEV_REPLACE 4 /**< deviate type replace */
434/** @} */
435
436/**
437 * @brief Generic deviate structure to get type and cast to lysp_deviate_* structure
438 */
439struct lysp_deviate {
440 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
441 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200442 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200443};
444
445struct lysp_deviate_add {
446 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
447 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200448 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200449 const char *units; /**< units of the values */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200450 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200451 const char **uniques; /**< list of uniques specifications ([sized array](@ref sizedarrays)) */
452 const char **dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200453 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
454 uint32_t min; /**< min-elements constraint */
455 uint32_t max; /**< max-elements constraint, 0 means unbounded */
456};
457
458struct lysp_deviate_del {
459 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
460 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200461 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200462 const char *units; /**< units of the values */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200463 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200464 const char **uniques; /**< list of uniques specifications ([sized array](@ref sizedarrays)) */
465 const char **dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200466 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200467};
468
469struct lysp_deviate_rpl {
470 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
471 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200472 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200473 struct lysp_type *type; /**< type of the node */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200474 const char *units; /**< units of the values */
475 const char *dflt; /**< default value */
476 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
477 uint32_t min; /**< min-elements constraint */
478 uint32_t max; /**< max-elements constraint, 0 means unbounded */
479};
480
481struct lysp_deviation {
Michal Vaskob55f6c12018-09-12 11:13:15 +0200482 const char *nodeid; /**< target absolute schema nodeid (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200483 const char *dsc; /**< description statement */
484 const char *ref; /**< reference statement */
485 struct lysp_deviate* deviates; /**< list of deviate specifications (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200486 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200487};
488
Radek Krejci4f28eda2018-11-12 11:46:16 +0100489/**
490 * @defgroup spnodeflags Parsed schema nodes flags
491 * @ingroup snodeflags
492 *
493 * Various flags for parsed schema nodes.
494 *
495 * 1 - container 6 - anydata/anyxml 11 - output 16 - grouping 21 - enum
496 * 2 - choice 7 - case 12 - feature 17 - uses 22 - type
497 * 3 - leaf 8 - notification 13 - identity 18 - refine
498 * 4 - leaflist 9 - rpc 14 - extension 19 - augment
499 * 5 - list 10 - input 15 - typedef 20 - deviate
500 *
501 * 1 1 1 1 1 1 1 1 1 1 2 2 2
502 * bit name 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2
503 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
504 * 1 LYS_CONFIG_W |x|x|x|x|x|x|x| | | | | | | | | | |x| |x| | |
Radek Krejcid505e3d2018-11-13 09:04:17 +0100505 * LYS_SET_BASE | | | | | | | | | | | | | | | | | | | | | |x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100506 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
507 * 2 LYS_CONFIG_R |x|x|x|x|x|x|x| | | | | | | | | | |x| |x| | |
Radek Krejcid505e3d2018-11-13 09:04:17 +0100508 * LYS_SET_BIT | | | | | | | | | | | | | | | | | | | | | |x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100509 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
510 * 3 LYS_STATUS_CURR |x|x|x|x|x|x|x|x|x| | |x|x|x|x|x|x| |x|x|x| |
Radek Krejcid505e3d2018-11-13 09:04:17 +0100511 * LYS_SET_ENUM | | | | | | | | | | | | | | | | | | | | | |x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100512 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
513 * 4 LYS_STATUS_DEPRC |x|x|x|x|x|x|x|x|x| | |x|x|x|x|x|x| |x|x|x| |
Radek Krejcid505e3d2018-11-13 09:04:17 +0100514 * LYS_SET_FRDIGITS | | | | | | | | | | | | | | | | | | | | | |x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100515 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
516 * 5 LYS_STATUS_OBSLT |x|x|x|x|x|x|x|x|x| | |x|x|x|x|x|x| |x|x|x| |
Radek Krejcid505e3d2018-11-13 09:04:17 +0100517 * LYS_SET_LENGTH | | | | | | | | | | | | | | | | | | | | | |x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100518 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
519 * 6 LYS_MAND_TRUE | |x|x| | |x| | | | | | | | | | | |x| |x| | |
Radek Krejcid505e3d2018-11-13 09:04:17 +0100520 * LYS_SET_PATH | | | | | | | | | | | | | | | | | | | | | |x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100521 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
522 * 7 LYS_MAND_FALSE | |x|x| | |x| | | | | | | | | | | |x| |x| | |
523 * LYS_ORDBY_USER | | | |x|x| | | | | | | | | | | | | | | | | |
Radek Krejcid505e3d2018-11-13 09:04:17 +0100524 * LYS_SET_PATTERN | | | | | | | | | | | | | | | | | | | | | |x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100525 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Radek Krejcife909632019-02-12 15:34:42 +0100526 * 8 LYS_ORDBY_SYSTEM | | | |x|x| | | | | | | | | | | | | | | | | |
527 * LYS_YINELEM_TRUE | | | | | | | | | | | | | |x| | | | | | | | |
Radek Krejcid505e3d2018-11-13 09:04:17 +0100528 * LYS_SET_RANGE | | | | | | | | | | | | | | | | | | | | | |x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100529 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
530 * 9 LYS_YINELEM_FALSE| | | | | | | | | | | | | |x| | | | | | | | |
Radek Krejcid505e3d2018-11-13 09:04:17 +0100531 * LYS_SET_TYPE | | | | | | | | | | | | | | | | | | | | | |x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100532 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
533 * 10 LYS_SET_VALUE | | | | | | | | | | | | | | | | | | | | |x| |
534 * LYS_SET_REQINST | | | | | | | | | | | | | | | | | | | | | |x|
535 * LYS_SET_MIN | | | |x|x| | | | | | | | | | | | |x| |x| | |
536 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
537 * 11 LYS_SET_MAX | | | |x|x| | | | | | | | | | | | |x| |x| | |
Radek Krejci4f28eda2018-11-12 11:46:16 +0100538 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
539 *
540 */
541
542/**
543 * @defgroup scnodeflags Compiled schema nodes flags
544 * @ingroup snodeflags
545 *
546 * Various flags for compiled schema nodes.
547 *
548 * 1 - container 6 - anydata/anyxml 11 - output
549 * 2 - choice 7 - case 12 - feature
550 * 3 - leaf 8 - notification 13 - identity
551 * 4 - leaflist 9 - rpc 14 - extension
552 * 5 - list 10 - input
553 *
554 * 1 1 1 1 1
555 * bit name 1 2 3 4 5 6 7 8 9 0 1 2 3 4
556 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Radek Krejci6eeb58f2019-02-22 16:29:37 +0100557 * 1 LYS_CONFIG_W |x|x|x|x|x|x|x| | | | | | | |
Radek Krejci4f28eda2018-11-12 11:46:16 +0100558 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Radek Krejci6eeb58f2019-02-22 16:29:37 +0100559 * 2 LYS_CONFIG_R |x|x|x|x|x|x|x| | | | | | | |
Radek Krejci4f28eda2018-11-12 11:46:16 +0100560 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Radek Krejci7adf4ff2018-12-05 08:55:00 +0100561 * 3 LYS_STATUS_CURR |x|x|x|x|x|x|x|x|x| | |x|x|x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100562 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Radek Krejci7adf4ff2018-12-05 08:55:00 +0100563 * 4 LYS_STATUS_DEPRC |x|x|x|x|x|x|x|x|x| | |x|x|x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100564 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Radek Krejci7adf4ff2018-12-05 08:55:00 +0100565 * 5 LYS_STATUS_OBSLT |x|x|x|x|x|x|x|x|x| | |x|x|x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100566 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Radek Krejcife909632019-02-12 15:34:42 +0100567 * 6 LYS_MAND_TRUE |x|x|x|x|x|x| | | | | | | | |
Radek Krejci4f28eda2018-11-12 11:46:16 +0100568 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
569 * 7 LYS_ORDBY_USER | | | |x|x| | | | | | | | | |
Radek Krejcif1421c22019-02-19 13:05:20 +0100570 * LYS_MAND_FALSE | |x|x| | |x| | | | | | | | |
Radek Krejci7adf4ff2018-12-05 08:55:00 +0100571 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Radek Krejcife909632019-02-12 15:34:42 +0100572 * 8 LYS_ORDBY_SYSTEM | | | |x|x| | | | | | | | | |
573 * LYS_PRESENCE |x| | | | | | | | | | | | | |
Radek Krejci7adf4ff2018-12-05 08:55:00 +0100574 * LYS_UNIQUE | | |x| | | | | | | | | | | |
575 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
576 * 9 LYS_KEY | | |x| | | | | | | | | | | |
577 * LYS_FENABLED | | | | | | | | | | | |x| | |
Radek Krejci76b3e962018-12-14 17:01:25 +0100578 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Radek Krejciccd20f12019-02-15 14:12:27 +0100579 * 10 LYS_SET_DFLT | | |x|x| | |x| | | | | | | |
580 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
581 * 11 LYS_SET_UNITS | | |x|x| | | | | | | | | | |
Radek Krejci93dcc392019-02-19 10:43:38 +0100582 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
583 * 11 LYS_SET_CONFIG |x|x|x|x|x|x|x| | |x|x| | | |
Radek Krejci4f28eda2018-11-12 11:46:16 +0100584 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
585 *
586 */
587
588/**
589 * @defgroup snodeflags Schema nodes flags
590 * @ingroup schematree
591 * @{
592 */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200593#define LYS_CONFIG_W 0x01 /**< config true; */
594#define LYS_CONFIG_R 0x02 /**< config false; */
595#define LYS_CONFIG_MASK 0x03 /**< mask for config value */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100596#define LYS_STATUS_CURR 0x04 /**< status current; */
597#define LYS_STATUS_DEPRC 0x08 /**< status deprecated; */
598#define LYS_STATUS_OBSLT 0x10 /**< status obsolete; */
599#define LYS_STATUS_MASK 0x1C /**< mask for status value */
600#define LYS_MAND_TRUE 0x20 /**< mandatory true; applicable only to ::lysp_node_choice/::lysc_node_choice,
Radek Krejcife909632019-02-12 15:34:42 +0100601 ::lysp_node_leaf/::lysc_node_leaf and ::lysp_node_anydata/::lysc_node_anydata.
602 The ::lysc_node_leaflist and ::lysc_node_leaflist have this flag in case that min-elements > 0.
603 The ::lysc_node_container has this flag if it is not a presence container and it has at least one
604 child with LYS_MAND_TRUE. */
Radek Krejcif1421c22019-02-19 13:05:20 +0100605#define LYS_MAND_FALSE 0x40 /**< mandatory false; applicable only to ::lysp_node_choice/::lysc_node_choice,
606 ::lysp_node_leaf/::lysc_node_leaf and ::lysp_node_anydata/::lysc_node_anydata.
607 This flag is present only in case the mandatory false statement was explicitly specified. */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100608#define LYS_MAND_MASK 0x60 /**< mask for mandatory values */
Radek Krejci7adf4ff2018-12-05 08:55:00 +0100609#define LYS_PRESENCE 0x80 /**< flag for presence property of a container, applicable only to ::lysc_node_container */
610#define LYS_UNIQUE 0x80 /**< flag for leafs being part of a unique set, applicable only to ::lysc_node_leaf */
611#define LYS_KEY 0x100 /**< flag for leafs being a key of a list, applicable only to ::lysc_node_leaf */
612#define LYS_FENABLED 0x100 /**< feature enabled flag, applicable only to ::lysc_feature */
Radek Krejcife909632019-02-12 15:34:42 +0100613#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 +0100614 ::lysc_node_list/::lysp_node_list */
615#define LYS_ORDBY_USER 0x40 /**< ordered-by user lists, applicable only to ::lysc_node_leaflist/::lysp_node_leaflist and
616 ::lysc_node_list/::lysp_node_list */
617#define LYS_ORDBY_MASK 0x60 /**< mask for ordered-by values */
618#define LYS_YINELEM_TRUE 0x80 /**< yin-element true for extension's argument */
619#define LYS_YINELEM_FALSE 0x100 /**< yin-element false for extension's argument */
620#define LYS_YINELEM_MASK 0x180 /**< mask for yin-element value */
621#define LYS_SET_VALUE 0x200 /**< value attribute is set */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100622#define LYS_SET_MIN 0x200 /**< min attribute is set */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200623#define LYS_SET_MAX 0x400 /**< max attribute is set */
Radek Krejcid505e3d2018-11-13 09:04:17 +0100624
625#define LYS_SET_BASE 0x0001 /**< type's flag for present base substatement */
626#define LYS_SET_BIT 0x0002 /**< type's flag for present bit substatement */
627#define LYS_SET_ENUM 0x0004 /**< type's flag for present enum substatement */
628#define LYS_SET_FRDIGITS 0x0008 /**< type's flag for present fraction-digits substatement */
629#define LYS_SET_LENGTH 0x0010 /**< type's flag for present length substatement */
630#define LYS_SET_PATH 0x0020 /**< type's flag for present path substatement */
631#define LYS_SET_PATTERN 0x0040 /**< type's flag for present pattern substatement */
632#define LYS_SET_RANGE 0x0080 /**< type's flag for present range substatement */
633#define LYS_SET_TYPE 0x0100 /**< type's flag for present type substatement */
634#define LYS_SET_REQINST 0x0200 /**< type's flag for present require-instance substatement */
Radek Krejciccd20f12019-02-15 14:12:27 +0100635#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 +0100636 cases of choice. This information is important for refines, since it is prohibited to make leafs
637 with default statement mandatory. In case the default leaf value is taken from type, it is thrown
Radek Krejciccd20f12019-02-15 14:12:27 +0100638 away when it is refined to be mandatory node. Similarly it is used for deviations to distinguish
639 between own default or the default values taken from the type. */
640#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 +0100641#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 +0100642
Radek Krejcife909632019-02-12 15:34:42 +0100643#define LYS_FLAGS_COMPILED_MASK 0xff /**< mask for flags that maps to the compiled structures */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100644/** @} */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200645
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200646/**
647 * @brief Generic YANG data node
648 */
649struct lysp_node {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100650 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200651 uint16_t nodetype; /**< type of the node (mandatory) */
652 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100653 struct lysp_node *next; /**< next sibling node (NULL if there is no one) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200654 const char *name; /**< node name (mandatory) */
655 const char *dsc; /**< description statement */
656 const char *ref; /**< reference statement */
657 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200658 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200659 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200660};
661
662/**
663 * @brief Extension structure of the lysp_node for YANG container
664 */
665struct lysp_node_container {
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; /**< LYS_CONTAINER */
668 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
669 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
670 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 /* container */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200678 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200679 const char *presence; /**< presence description */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200680 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
681 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200682 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200683 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
684 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200685};
686
687struct lysp_node_leaf {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100688 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200689 uint16_t nodetype; /**< LYS_LEAF */
690 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
691 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
692 const char *name; /**< node name (mandatory) */
693 const char *dsc; /**< description statement */
694 const char *ref; /**< reference statement */
695 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200696 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200697 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200698
699 /* leaf */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200700 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200701 struct lysp_type type; /**< type of the leaf node (mandatory) */
702 const char *units; /**< units of the leaf's type */
703 const char *dflt; /**< default value */
704};
705
706struct lysp_node_leaflist {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100707 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200708 uint16_t nodetype; /**< LYS_LEAFLIST */
709 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
710 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
711 const char *name; /**< node name (mandatory) */
712 const char *dsc; /**< description statement */
713 const char *ref; /**< reference statement */
714 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200715 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200716 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200717
718 /* leaf-list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200719 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200720 struct lysp_type type; /**< type of the leaf node (mandatory) */
721 const char *units; /**< units of the leaf's type */
Radek Krejci151a5b72018-10-19 14:21:44 +0200722 const char **dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200723 uint32_t min; /**< min-elements constraint */
724 uint32_t max; /**< max-elements constraint, 0 means unbounded */
725};
726
727struct lysp_node_list {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100728 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200729 uint16_t nodetype; /**< LYS_LIST */
730 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
731 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
732 const char *name; /**< node name (mandatory) */
733 const char *dsc; /**< description statement */
734 const char *ref; /**< reference statement */
735 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200736 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200737 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200738
739 /* list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200740 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200741 const char *key; /**< keys specification */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200742 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
743 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200744 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200745 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
746 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200747 const char **uniques; /**< list of unique specifications ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200748 uint32_t min; /**< min-elements constraint */
749 uint32_t max; /**< max-elements constraint, 0 means unbounded */
750};
751
752struct lysp_node_choice {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100753 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200754 uint16_t nodetype; /**< LYS_CHOICE */
755 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
756 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
757 const char *name; /**< node name (mandatory) */
758 const char *dsc; /**< description statement */
759 const char *ref; /**< reference statement */
760 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200761 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200762 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200763
764 /* choice */
765 struct lysp_node *child; /**< list of data nodes (linked list) */
766 const char* dflt; /**< default case */
767};
768
769struct lysp_node_case {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100770 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200771 uint16_t nodetype; /**< LYS_CASE */
772 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
773 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
774 const char *name; /**< node name (mandatory) */
775 const char *dsc; /**< description statement */
776 const char *ref; /**< reference statement */
777 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200778 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200779 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200780
781 /* case */
782 struct lysp_node *child; /**< list of data nodes (linked list) */
783};
784
785struct lysp_node_anydata {
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_ANYXML || LYS_ANYDATA */
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 /* anyxml/anydata */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200798 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200799};
800
801struct lysp_node_uses {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100802 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200803 uint16_t nodetype; /**< LYS_USES */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200804 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; /**< grouping name reference (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 /* uses */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200814 struct lysp_refine *refines; /**< list of uses's refines ([sized array](@ref sizedarrays)) */
815 struct lysp_augment *augments; /**< list of uses's augment ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200816};
817
818/**
819 * @brief YANG input-stmt and output-stmt
820 */
821struct lysp_action_inout {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100822 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
823 uint16_t nodetype; /**< LYS_INOUT */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200824 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
825 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
826 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200827 struct lysp_node *data; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200828 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200829};
830
831/**
832 * @brief YANG rpc-stmt and action-stmt
833 */
834struct lysp_action {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100835 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
836 uint16_t nodetype; /**< LYS_ACTION */
837 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200838 const char *name; /**< grouping name reference (mandatory) */
839 const char *dsc; /**< description statement */
840 const char *ref; /**< reference statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200841 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200842 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
843 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci6eeb58f2019-02-22 16:29:37 +0100844 struct lysp_action_inout input; /**< RPC's/Action's input */
845 struct lysp_action_inout output; /**< RPC's/Action's output */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200846 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200847};
848
849/**
850 * @brief YANG notification-stmt
851 */
852struct lysp_notif {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100853 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
854 uint16_t nodetype; /**< LYS_NOTIF */
855 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values are allowed */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200856 const char *name; /**< grouping name reference (mandatory) */
857 const char *dsc; /**< description statement */
858 const char *ref; /**< reference statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200859 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200860 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
861 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
862 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200863 struct lysp_node *data; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200864 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200865};
866
867/**
Radek Krejcif0fceb62018-09-05 14:58:45 +0200868 * @brief supported YANG schema version values
869 */
870typedef enum LYS_VERSION {
871 LYS_VERSION_UNDEF = 0, /**< no specific version, YANG 1.0 as default */
872 LYS_VERSION_1_0 = 1, /**< YANG 1.0 */
873 LYS_VERSION_1_1 = 2 /**< YANG 1.1 */
874} LYS_VERSION;
875
876/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200877 * @brief Printable YANG schema tree structure representing YANG module.
878 *
879 * Simple structure corresponding to the YANG format. The schema is only syntactically validated.
880 */
881struct lysp_module {
Radek Krejci0bcdaed2019-01-10 10:21:34 +0100882 struct lys_module *mod; /**< covering module structure */
883
Radek Krejcib7db73a2018-10-24 14:18:40 +0200884 struct lysp_revision *revs; /**< list of the module revisions ([sized array](@ref sizedarrays)), the first revision
885 in the list is always the last (newest) revision of the module */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200886 struct lysp_import *imports; /**< list of imported modules ([sized array](@ref sizedarrays)) */
887 struct lysp_include *includes; /**< list of included submodules ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200888 struct lysp_ext *extensions; /**< list of extension statements ([sized array](@ref sizedarrays)) */
889 struct lysp_feature *features; /**< list of feature definitions ([sized array](@ref sizedarrays)) */
890 struct lysp_ident *identities; /**< list of identities ([sized array](@ref sizedarrays)) */
891 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
892 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200893 struct lysp_node *data; /**< list of module's top-level data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200894 struct lysp_augment *augments; /**< list of augments ([sized array](@ref sizedarrays)) */
895 struct lysp_action *rpcs; /**< list of RPCs ([sized array](@ref sizedarrays)) */
896 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
897 struct lysp_deviation *deviations; /**< list of deviations ([sized array](@ref sizedarrays)) */
898 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200899
Radek Krejci0bcdaed2019-01-10 10:21:34 +0100900 uint8_t parsing:1; /**< flag for circular check */
901};
902
903struct lysp_submodule {
904 const char *belongsto; /**< belongs to parent module (submodule - mandatory) */
905
906 struct lysp_revision *revs; /**< list of the module revisions ([sized array](@ref sizedarrays)), the first revision
907 in the list is always the last (newest) revision of the module */
908 struct lysp_import *imports; /**< list of imported modules ([sized array](@ref sizedarrays)) */
909 struct lysp_include *includes; /**< list of included submodules ([sized array](@ref sizedarrays)) */
910 struct lysp_ext *extensions; /**< list of extension statements ([sized array](@ref sizedarrays)) */
911 struct lysp_feature *features; /**< list of feature definitions ([sized array](@ref sizedarrays)) */
912 struct lysp_ident *identities; /**< list of identities ([sized array](@ref sizedarrays)) */
913 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
914 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
915 struct lysp_node *data; /**< list of module's top-level data nodes (linked list) */
916 struct lysp_augment *augments; /**< list of augments ([sized array](@ref sizedarrays)) */
917 struct lysp_action *rpcs; /**< list of RPCs ([sized array](@ref sizedarrays)) */
918 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
919 struct lysp_deviation *deviations; /**< list of deviations ([sized array](@ref sizedarrays)) */
920 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
921
922 uint8_t parsing:1; /**< flag for circular check */
923
Radek Krejci086c7132018-10-26 15:29:04 +0200924 uint8_t latest_revision:2; /**< flag to mark the latest available revision:
925 1 - the latest revision in searchdirs was not searched yet and this is the
926 latest revision in the current context
927 2 - searchdirs were searched and this is the latest available revision */
Radek Krejci0bcdaed2019-01-10 10:21:34 +0100928 const char *name; /**< name of the module (mandatory) */
929 const char *filepath; /**< path, if the schema was read from a file, NULL in case of reading from memory */
930 const char *prefix; /**< submodule belongsto prefix of main module (mandatory) */
931 const char *org; /**< party/company responsible for the module */
932 const char *contact; /**< contact information for the module */
933 const char *dsc; /**< description of the module */
934 const char *ref; /**< cross-reference for the module */
Radek Krejci086c7132018-10-26 15:29:04 +0200935 uint8_t version; /**< yang-version (LYS_VERSION values) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200936};
937
938/**
Radek Krejci3f5e3db2018-10-11 15:57:47 +0200939 * @brief Free the printable YANG schema tree structure.
940 *
941 * @param[in] module Printable YANG schema tree structure to free.
942 */
943void lysp_module_free(struct lysp_module *module);
944
945/**
Radek Krejcice8c1592018-10-29 15:35:51 +0100946 * @brief YANG extension instance
947 */
948struct lysc_ext_instance {
949 struct lyext_plugin *plugin; /**< pointer to the plugin implementing the extension (if present) */
950 void *parent; /**< pointer to the parent element holding the extension instance(s), use
951 ::lysc_ext_instance#parent_type to access the schema element */
952 const char *argument; /**< optional value of the extension's argument */
953 LYEXT_SUBSTMT insubstmt; /**< value identifying placement of the extension instance */
954 uint32_t insubstmt_index; /**< in case the instance is in a substatement that can appear multiple times,
955 this identifies the index of the substatement for this extension instance */
Radek Krejci2a408df2018-10-29 16:32:26 +0100956 LYEXT_PARENT parent_type; /**< type of the parent structure */
Radek Krejcice8c1592018-10-29 15:35:51 +0100957#if 0
Radek Krejcice8c1592018-10-29 15:35:51 +0100958 uint8_t ext_type; /**< extension type (#LYEXT_TYPE) */
959 uint8_t padding; /**< 32b padding */
Radek Krejcice8c1592018-10-29 15:35:51 +0100960 struct lys_module *module; /**< pointer to the extension instance's module (mandatory) */
961 LYS_NODE nodetype; /**< LYS_EXT */
962#endif
Radek Krejci2a408df2018-10-29 16:32:26 +0100963 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
964 void *priv; /**< private caller's data, not used by libyang */
Radek Krejcice8c1592018-10-29 15:35:51 +0100965};
966
967/**
Radek Krejcibd8d9ba2018-11-02 16:06:26 +0100968 * @brief Compiled YANG if-feature-stmt
969 */
970struct lysc_iffeature {
971 uint8_t *expr; /**< 2bits array describing the if-feature expression in prefix format, see @ref ifftokens */
972 struct lysc_feature **features; /**< array of pointers to the features used in expression ([sized array](@ref sizedarrays)) */
973};
974
975/**
Radek Krejci151a5b72018-10-19 14:21:44 +0200976 * @brief YANG import-stmt
977 */
978struct lysc_import {
Radek Krejci6d6e4e42018-10-29 13:28:19 +0100979 struct lys_module *module; /**< link to the imported module */
Radek Krejci151a5b72018-10-19 14:21:44 +0200980 const char *prefix; /**< prefix for the data from the imported schema (mandatory) */
Radek Krejcice8c1592018-10-29 15:35:51 +0100981 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200982};
983
984/**
Radek Krejcidd4e8d42018-10-16 14:55:43 +0200985 * @brief YANG when-stmt
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200986 */
Radek Krejcidd4e8d42018-10-16 14:55:43 +0200987struct lysc_when {
988 struct lyxp_expr *cond; /**< XPath when condition */
Radek Krejcic8b31002019-01-08 10:24:45 +0100989 const char *dsc; /**< description */
990 const char *ref; /**< reference */
Radek Krejci00b874b2019-02-12 10:54:50 +0100991 struct lysc_node *context; /**< context node for evaluating the expression */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200992 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci00b874b2019-02-12 10:54:50 +0100993 uint32_t refcount; /**< reference counter since some of the when statements are shared among several nodes */
Radek Krejcidd4e8d42018-10-16 14:55:43 +0200994};
995
996/**
Radek Krejci2a408df2018-10-29 16:32:26 +0100997 * @brief YANG identity-stmt
998 */
999struct lysc_ident {
1000 const char *name; /**< identity name (mandatory), including possible prefix */
Radek Krejcic8b31002019-01-08 10:24:45 +01001001 const char *dsc; /**< description */
1002 const char *ref; /**< reference */
Radek Krejci2a408df2018-10-29 16:32:26 +01001003 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1004 struct lysc_ident **derived; /**< list of (pointers to the) derived identities ([sized array](@ref sizedarrays)) */
1005 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1006 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_ values are allowed */
1007};
1008
1009/**
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001010 * @brief YANG feature-stmt
1011 */
1012struct lysc_feature {
1013 const char *name; /**< feature name (mandatory) */
Radek Krejcic8b31002019-01-08 10:24:45 +01001014 const char *dsc; /**< description */
1015 const char *ref; /**< reference */
Radek Krejci151a5b72018-10-19 14:21:44 +02001016 struct lysc_feature **depfeatures;/**< list of pointers to other features depending on this one ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001017 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcice8c1592018-10-29 15:35:51 +01001018 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001019 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* and
1020 #LYS_FENABLED values allowed */
1021};
1022
Radek Krejci151a5b72018-10-19 14:21:44 +02001023/**
1024 * @defgroup ifftokens if-feature expression tokens
1025 * Tokens of if-feature expression used in ::lysc_iffeature#expr
1026 *
1027 * @{
1028 */
1029#define LYS_IFF_NOT 0x00 /**< operand "not" */
1030#define LYS_IFF_AND 0x01 /**< operand "and" */
1031#define LYS_IFF_OR 0x02 /**< operand "or" */
1032#define LYS_IFF_F 0x03 /**< feature */
1033/**
1034 * @}
1035 */
1036
1037/**
Radek Krejcib7db73a2018-10-24 14:18:40 +02001038 * @brief Compiled YANG revision statement
1039 */
1040struct lysc_revision {
1041 char date[LY_REV_SIZE]; /**< revision-date (mandatory) */
1042 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1043};
1044
Radek Krejci2167ee12018-11-02 16:09:07 +01001045struct lysc_range {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001046 struct lysc_range_part {
Radek Krejci2167ee12018-11-02 16:09:07 +01001047 union { /**< min boundary TODO decimal */
1048 int64_t min_64; /**< for int8, int16, int32 and int64 */
1049 uint64_t min_u64; /**< for uint8, uint16, uint32 and uint64 */
1050 };
1051 union { /**< max boundary TODO decimal */
1052 int64_t max_64; /**< for int8, int16, int32 and int64 */
1053 uint64_t max_u64; /**< for uint8, uint16, uint32 and uint64 */
1054 };
Radek Krejci4f28eda2018-11-12 11:46:16 +01001055 } *parts; /**< compiled range expression ([sized array](@ref sizedarrays)) */
Radek Krejcic8b31002019-01-08 10:24:45 +01001056 const char *dsc; /**< description */
1057 const char *ref; /**< reference */
Radek Krejci2167ee12018-11-02 16:09:07 +01001058 const char *emsg; /**< error-message */
1059 const char *eapptag; /**< error-app-tag value */
1060 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1061};
1062
1063struct lysc_pattern {
1064 pcre *expr; /**< compiled regular expression */
1065 pcre_extra *expr_extra; /**< additional information to speed up matching */
Radek Krejcic8b31002019-01-08 10:24:45 +01001066 const char *dsc; /**< description */
1067 const char *ref; /**< reference */
Radek Krejci2167ee12018-11-02 16:09:07 +01001068 const char *emsg; /**< error-message */
1069 const char *eapptag; /**< error-app-tag value */
1070 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci4586a022018-11-13 11:29:26 +01001071 uint32_t inverted:1; /**< invert-match flag */
1072 uint32_t refcount:31; /**< reference counter */
Radek Krejci2167ee12018-11-02 16:09:07 +01001073};
1074
1075struct lysc_must {
1076 struct lys_module *module; /**< module where the must was defined */
1077 struct lyxp_expr *cond; /**< XPath when condition */
Radek Krejcic8b31002019-01-08 10:24:45 +01001078 const char *dsc; /**< description */
1079 const char *ref; /**< reference */
Radek Krejci2167ee12018-11-02 16:09:07 +01001080 const char *emsg; /**< error-message */
1081 const char *eapptag; /**< error-app-tag value */
1082 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1083};
1084
1085struct lysc_type {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001086 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001087 const char *dflt; /**< type's default value if any */
Radek Krejci2167ee12018-11-02 16:09:07 +01001088 LY_DATA_TYPE basetype; /**< Base type of the type */
1089 uint32_t refcount; /**< reference counter for type sharing */
1090};
1091
1092struct lysc_type_num {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001093 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001094 const char *dflt; /**< type's default value if any */
Radek Krejci2167ee12018-11-02 16:09:07 +01001095 LY_DATA_TYPE basetype; /**< Base type of the type */
1096 uint32_t refcount; /**< reference counter for type sharing */
1097 struct lysc_range *range; /**< Optional range limitation */
1098};
1099
1100struct lysc_type_dec {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001101 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001102 const char *dflt; /**< type's default value if any */
Radek Krejci2167ee12018-11-02 16:09:07 +01001103 LY_DATA_TYPE basetype; /**< Base type of the type */
1104 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci6cba4292018-11-15 17:33:29 +01001105 uint8_t fraction_digits; /**< fraction digits specification */
Radek Krejci2167ee12018-11-02 16:09:07 +01001106 struct lysc_range *range; /**< Optional range limitation */
1107};
1108
1109struct lysc_type_str {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001110 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001111 const char *dflt; /**< type's default value if any */
Radek Krejci2167ee12018-11-02 16:09:07 +01001112 LY_DATA_TYPE basetype; /**< Base type of the type */
1113 uint32_t refcount; /**< reference counter for type sharing */
1114 struct lysc_range *length; /**< Optional length limitation */
Radek Krejci4586a022018-11-13 11:29:26 +01001115 struct lysc_pattern **patterns; /**< Optional list of pointers to pattern limitations ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001116};
1117
1118struct lysc_type_enum {
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 Krejci8b764662018-11-14 14:15:13 +01001123 struct lysc_type_enum_item {
Radek Krejci2167ee12018-11-02 16:09:07 +01001124 const char *name; /**< enumeration identifier */
Radek Krejcic8b31002019-01-08 10:24:45 +01001125 const char *dsc; /**< description */
1126 const char *ref; /**< reference */
Radek Krejci2167ee12018-11-02 16:09:07 +01001127 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejci8b764662018-11-14 14:15:13 +01001128 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001129 int32_t value; /**< integer value associated with the enumeration */
1130 } *enums; /**< enumerations list ([sized array](@ref sizedarrays)), mandatory (at least 1 item) */
1131};
1132
1133struct lysc_type_leafref {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001134 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001135 const char *dflt; /**< type's default value if any */
Radek Krejci2167ee12018-11-02 16:09:07 +01001136 LY_DATA_TYPE basetype; /**< Base type of the type */
1137 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejcia3045382018-11-22 14:30:31 +01001138 const char* path; /**< target path */
Radek Krejci96a0bfd2018-11-22 15:25:06 +01001139 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 +01001140 struct lysc_type *realtype; /**< pointer to the real (first non-leafref in possible leafrefs chain) type. */
Radek Krejci2167ee12018-11-02 16:09:07 +01001141 uint8_t require_instance; /**< require-instance flag */
1142};
1143
1144struct lysc_type_identityref {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001145 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001146 const char *dflt; /**< type's default value if any */
Radek Krejci2167ee12018-11-02 16:09:07 +01001147 LY_DATA_TYPE basetype; /**< Base type of the type */
1148 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci555cb5b2018-11-16 14:54:33 +01001149 struct lysc_ident **bases; /**< list of pointers to the base identities ([sized array](@ref sizedarrays)),
Radek Krejci2167ee12018-11-02 16:09:07 +01001150 mandatory (at least 1 item) */
1151};
1152
1153struct lysc_type_instanceid {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001154 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001155 const char *dflt; /**< type's default value if any */
Radek Krejci2167ee12018-11-02 16:09:07 +01001156 LY_DATA_TYPE basetype; /**< Base type of the type */
1157 uint32_t refcount; /**< reference counter for type sharing */
1158 uint8_t require_instance; /**< require-instance flag */
1159};
1160
1161struct lysc_type_bits {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001162 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001163 const char *dflt; /**< type's default value if any */
Radek Krejci2167ee12018-11-02 16:09:07 +01001164 LY_DATA_TYPE basetype; /**< Base type of the type */
1165 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci8b764662018-11-14 14:15:13 +01001166 struct lysc_type_bits_item {
Radek Krejci2167ee12018-11-02 16:09:07 +01001167 const char *name; /**< bit identifier */
Radek Krejcic8b31002019-01-08 10:24:45 +01001168 const char *dsc; /**< description */
1169 const char *ref; /**< reference */
Radek Krejci2167ee12018-11-02 16:09:07 +01001170 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejci8b764662018-11-14 14:15:13 +01001171 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001172 uint32_t position; /**< non-negative integer value associated with the bit */
1173 } *bits; /**< bits list ([sized array](@ref sizedarrays)), mandatory (at least 1 item) */
1174};
1175
1176struct lysc_type_union {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001177 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001178 const char *dflt; /**< type's default value if any */
Radek Krejci2167ee12018-11-02 16:09:07 +01001179 LY_DATA_TYPE basetype; /**< Base type of the type */
1180 uint32_t refcount; /**< reference counter for type sharing */
1181 struct lysc_type **types; /**< list of types in the union ([sized array](@ref sizedarrays)), mandatory (at least 1 item) */
1182};
1183
1184struct lysc_type_bin {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001185 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001186 const char *dflt; /**< type's default value if any */
Radek Krejci2167ee12018-11-02 16:09:07 +01001187 LY_DATA_TYPE basetype; /**< Base type of the type */
1188 uint32_t refcount; /**< reference counter for type sharing */
1189 struct lysc_range *length; /**< Optional length limitation */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001190};
1191
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001192struct lysc_action_inout {
1193 struct lysc_node *data; /**< first child node (linked list) */
1194 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1195 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1196};
1197
Radek Krejci056d0a82018-12-06 16:57:25 +01001198struct lysc_action {
1199 uint16_t nodetype; /**< LYS_ACTION */
1200 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejci95710c92019-02-11 15:49:55 +01001201 struct lys_module *module; /**< module structure */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001202 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. */
1203 struct lysc_node *parent; /**< parent node (NULL in case of top level node - RPC) */
1204
1205 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1206 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1207
Radek Krejci056d0a82018-12-06 16:57:25 +01001208 const char *name; /**< action/RPC name (mandatory) */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001209 const char *dsc; /**< description */
1210 const char *ref; /**< reference */
1211
1212 struct lysc_action_inout input; /**< RPC's/action's input */
1213 struct lysc_action_inout output; /**< RPC's/action's output */
1214
Radek Krejci056d0a82018-12-06 16:57:25 +01001215};
1216
1217struct lysc_notif {
1218 uint16_t nodetype; /**< LYS_NOTIF */
1219 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejci95710c92019-02-11 15:49:55 +01001220 struct lys_module *module; /**< module structure */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001221 struct lysp_notification *sp; /**< simply parsed (SP) original of the node, NULL if the SP schema was removed or in case of implicit case node. */
1222 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1223
Radek Krejci056d0a82018-12-06 16:57:25 +01001224 const char *name; /**< Notification name (mandatory) */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001225 const char *dsc; /**< description */
1226 const char *ref; /**< reference */
Radek Krejci056d0a82018-12-06 16:57:25 +01001227 /* TODO */
1228};
1229
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001230/**
Radek Krejci0af5f5d2018-09-07 15:00:30 +02001231 * @brief Compiled YANG data node
1232 */
1233struct lysc_node {
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001234 uint16_t nodetype; /**< type of the node (mandatory) */
1235 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001236 struct lys_module *module; /**< module structure */
1237 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. */
1238 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1239 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1240 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1241 never NULL. If there is no sibling node, pointer points to the node
1242 itself. In case of the first node, this pointer points to the last
1243 node in the list. */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001244 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001245 const char *dsc; /**< description */
1246 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001247 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci00b874b2019-02-12 10:54:50 +01001248 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Radek Krejci056d0a82018-12-06 16:57:25 +01001249 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001250};
1251
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001252struct lysc_node_container {
1253 uint16_t nodetype; /**< LYS_CONTAINER */
1254 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1255 struct lys_module *module; /**< module structure */
1256 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. */
1257 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1258 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1259 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1260 never NULL. If there is no sibling node, pointer points to the node
1261 itself. In case of the first node, this pointer points to the last
1262 node in the list. */
1263 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001264 const char *dsc; /**< description */
1265 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001266 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci00b874b2019-02-12 10:54:50 +01001267 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001268 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1269
1270 struct lysc_node *child; /**< first child node (linked list) */
1271 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1272 struct lysc_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
1273 struct lysc_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001274};
1275
Radek Krejcia3045382018-11-22 14:30:31 +01001276struct lysc_node_case {
Radek Krejci056d0a82018-12-06 16:57:25 +01001277 uint16_t nodetype; /**< LYS_CASE */
1278 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1279 struct lys_module *module; /**< module structure */
1280 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. */
1281 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1282 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1283 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1284 never NULL. If there is no sibling node, pointer points to the node
1285 itself. In case of the first node, this pointer points to the last
1286 node in the list. */
Radek Krejcia3045382018-11-22 14:30:31 +01001287 const char *name; /**< name of the case, including the implicit case */
Radek Krejci12fb9142019-01-08 09:45:30 +01001288 const char *dsc; /**< description */
1289 const char *ref; /**< reference */
Radek Krejci056d0a82018-12-06 16:57:25 +01001290 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci00b874b2019-02-12 10:54:50 +01001291 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Radek Krejci056d0a82018-12-06 16:57:25 +01001292 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1293
Radek Krejcia3045382018-11-22 14:30:31 +01001294 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 +01001295 each other as siblings with the parent pointer pointing to appropriate case node. */
Radek Krejcia3045382018-11-22 14:30:31 +01001296};
1297
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001298struct lysc_node_choice {
1299 uint16_t nodetype; /**< LYS_CHOICE */
1300 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1301 struct lys_module *module; /**< module structure */
1302 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. */
1303 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1304 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1305 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1306 never NULL. If there is no sibling node, pointer points to the node
1307 itself. In case of the first node, this pointer points to the last
1308 node in the list. */
1309 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001310 const char *dsc; /**< description */
1311 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001312 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci00b874b2019-02-12 10:54:50 +01001313 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Radek Krejci056d0a82018-12-06 16:57:25 +01001314 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001315
Radek Krejcia9026eb2018-12-12 16:04:47 +01001316 struct lysc_node_case *cases; /**< list of the cases (linked list). Note that all the children of all the cases are linked each other
1317 as siblings. Their parent pointers points to the specific case they belongs to, so distinguish the
1318 case is simple. */
Radek Krejci056d0a82018-12-06 16:57:25 +01001319 struct lysc_node_case *dflt; /**< default case of the choice, only a pointer into the cases array. */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001320};
1321
1322struct lysc_node_leaf {
1323 uint16_t nodetype; /**< LYS_LEAF */
1324 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1325 struct lys_module *module; /**< module structure */
1326 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. */
1327 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1328 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1329 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1330 never NULL. If there is no sibling node, pointer points to the node
1331 itself. In case of the first node, this pointer points to the last
1332 node in the list. */
1333 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001334 const char *dsc; /**< description */
1335 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001336 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci00b874b2019-02-12 10:54:50 +01001337 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001338 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1339
1340 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1341 struct lysc_type *type; /**< type of the leaf node (mandatory) */
Radek Krejcib57cf1e2018-11-23 14:07:05 +01001342
Radek Krejci4f28eda2018-11-12 11:46:16 +01001343 const char *units; /**< units of the leaf's type */
1344 const char *dflt; /**< default value */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001345};
1346
1347struct lysc_node_leaflist {
1348 uint16_t nodetype; /**< LYS_LEAFLIST */
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 Krejci00b874b2019-02-12 10:54:50 +01001362 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Radek Krejcib57cf1e2018-11-23 14:07:05 +01001363 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1364
1365 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1366 struct lysc_type *type; /**< type of the leaf node (mandatory) */
1367
Radek Krejci0e5d8382018-11-28 16:37:53 +01001368 const char *units; /**< units of the leaf's type */
1369 const char **dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
1370 uint32_t min; /**< min-elements constraint */
1371 uint32_t max; /**< max-elements constraint */
1372
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001373};
1374
1375struct lysc_node_list {
1376 uint16_t nodetype; /**< LYS_LIST */
1377 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1378 struct lys_module *module; /**< module structure */
1379 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. */
1380 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1381 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1382 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1383 never NULL. If there is no sibling node, pointer points to the node
1384 itself. In case of the first node, this pointer points to the last
1385 node in the list. */
1386 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001387 const char *dsc; /**< description */
1388 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001389 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci00b874b2019-02-12 10:54:50 +01001390 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Radek Krejci9bb94eb2018-12-04 16:48:35 +01001391 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1392
1393 struct lysc_node *child; /**< first child node (linked list) */
1394 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1395 struct lysc_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
1396 struct lysc_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
1397
1398 struct lysc_node_leaf **keys; /**< list of pointers to the keys ([sized array](@ref sizedarrays)) */
1399 struct lysc_node_leaf ***uniques; /**< list of sized arrays of pointers to the unique nodes ([sized array](@ref sizedarrays)) */
1400 uint32_t min; /**< min-elements constraint */
1401 uint32_t max; /**< max-elements constraint */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001402};
1403
1404struct lysc_node_anydata {
1405 uint16_t nodetype; /**< LYS_ANYXML or LYS_ANYDATA */
1406 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1407 struct lys_module *module; /**< module structure */
1408 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. */
1409 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1410 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1411 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1412 never NULL. If there is no sibling node, pointer points to the node
1413 itself. In case of the first node, this pointer points to the last
1414 node in the list. */
1415 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001416 const char *dsc; /**< description */
1417 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001418 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci00b874b2019-02-12 10:54:50 +01001419 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Radek Krejci056d0a82018-12-06 16:57:25 +01001420 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejci9800fb82018-12-13 14:26:23 +01001421
1422 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001423};
1424
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001425/**
1426 * @brief Compiled YANG schema tree structure representing YANG module.
1427 *
1428 * Semantically validated YANG schema tree for data tree parsing.
1429 * Contains only the necessary information for the data validation.
1430 */
1431struct lysc_module {
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001432 struct lys_module *mod; /**< covering module structure */
Radek Krejci151a5b72018-10-19 14:21:44 +02001433 struct lysc_import *imports; /**< list of imported modules ([sized array](@ref sizedarrays)) */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001434
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001435 struct lysc_feature *features; /**< list of feature definitions ([sized array](@ref sizedarrays)) */
Radek Krejci2a408df2018-10-29 16:32:26 +01001436 struct lysc_ident *identities; /**< list of identities ([sized array](@ref sizedarrays)) */
1437 struct lysc_node *data; /**< list of module's top-level data nodes (linked list) */
1438 struct lysc_action *rpcs; /**< list of RPCs ([sized array](@ref sizedarrays)) */
1439 struct lysc_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejcice8c1592018-10-29 15:35:51 +01001440 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci0af5f5d2018-09-07 15:00:30 +02001441};
1442
1443/**
Radek Krejci53ea6152018-12-13 15:21:15 +01001444 * @brief Get the groupings sized array of the given (parsed) schema node.
1445 * Decides the node's type and in case it has a groupings array, returns it.
1446 * @param[in] node Node to examine.
1447 * @return The node's groupings sized array if any, NULL otherwise.
1448 */
1449const struct lysp_grp *lysp_node_groupings(const struct lysp_node *node);
1450
1451/**
Radek Krejci056d0a82018-12-06 16:57:25 +01001452 * @brief Get the typedefs sized array of the given (parsed) schema node.
1453 * Decides the node's type and in case it has a typedefs array, returns it.
1454 * @param[in] node Node to examine.
1455 * @return The node's typedefs sized array if any, NULL otherwise.
1456 */
1457const struct lysp_tpdf *lysp_node_typedefs(const struct lysp_node *node);
1458
1459/**
1460 * @brief Get the actions/RPCs sized array of the given (parsed) schema node.
1461 * Decides the node's type and in case it has a actions/RPCs array, returns it.
1462 * @param[in] node Node to examine.
1463 * @return The node's actions/RPCs sized array if any, NULL otherwise.
1464 */
1465const struct lysp_action *lysp_node_actions(const struct lysp_node *node);
1466
1467/**
1468 * @brief Get the Notifications sized array of the given (parsed) schema node.
1469 * Decides the node's type and in case it has a Notifications array, returns it.
1470 * @param[in] node Node to examine.
1471 * @return The node's Notifications sized array if any, NULL otherwise.
1472 */
1473const struct lysp_notif *lysp_node_notifs(const struct lysp_node *node);
1474
1475/**
1476 * @brief Get the children linked list of the given (parsed) schema node.
1477 * Decides the node's type and in case it has a children list, returns it.
1478 * @param[in] node Node to examine.
1479 * @return The node's children linked list if any, NULL otherwise.
1480 */
1481const struct lysp_node *lysp_node_children(const struct lysp_node *node);
1482
1483/**
1484 * @brief Get the actions/RPCs sized array of the given (compiled) schema node.
1485 * Decides the node's type and in case it has a actions/RPCs array, returns it.
1486 * @param[in] node Node to examine.
1487 * @return The node's actions/RPCs sized array if any, NULL otherwise.
1488 */
1489const struct lysc_action *lysc_node_actions(const struct lysc_node *node);
1490
1491/**
1492 * @brief Get the Notifications sized array of the given (compiled) schema node.
1493 * Decides the node's type and in case it has a Notifications array, returns it.
1494 * @param[in] node Node to examine.
1495 * @return The node's Notifications sized array if any, NULL otherwise.
1496 */
1497const struct lysc_notif *lysc_node_notifs(const struct lysc_node *node);
1498
1499/**
1500 * @brief Get the children linked list of the given (compiled) schema node.
1501 * Decides the node's type and in case it has a children list, returns it.
1502 * @param[in] node Node to examine.
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001503 * @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 +01001504 * @return The node's children linked list if any, NULL otherwise.
1505 */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001506const struct lysc_node *lysc_node_children(const struct lysc_node *node, uint16_t flags);
Radek Krejci056d0a82018-12-06 16:57:25 +01001507
1508/**
Radek Krejci151a5b72018-10-19 14:21:44 +02001509 * @brief Get how the if-feature statement currently evaluates.
1510 *
1511 * @param[in] iff Compiled if-feature statement to evaluate.
1512 * @return If the statement evaluates to true, 1 is returned. 0 is returned when the statement evaluates to false.
1513 */
1514int lysc_iffeature_value(const struct lysc_iffeature *iff);
1515
1516/**
1517 * @brief Get the current status of the provided feature.
1518 *
1519 * @param[in] feature Compiled feature statement to examine.
1520 * @return
1521 * - 1 if feature is enabled,
1522 * - 0 if feature is disabled,
1523 * - -1 in case of error (invalid argument)
1524 */
1525int lysc_feature_value(const struct lysc_feature *feature);
1526
1527/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001528 * @brief Available YANG schema tree structures representing YANG module.
1529 */
1530struct lys_module {
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001531 struct ly_ctx *ctx; /**< libyang context of the module (mandatory) */
1532 const char *name; /**< name of the module (mandatory) */
Radek Krejci0af46292019-01-11 16:02:31 +01001533 const char *revision; /**< revision of the module (if present) */
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001534 const char *ns; /**< namespace of the module (module - mandatory) */
1535 const char *prefix; /**< module prefix or submodule belongsto prefix of main module (mandatory) */
1536 const char *filepath; /**< path, if the schema was read from a file, NULL in case of reading from memory */
1537 const char *org; /**< party/company responsible for the module */
1538 const char *contact; /**< contact information for the module */
1539 const char *dsc; /**< description of the module */
1540 const char *ref; /**< cross-reference for the module */
1541
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001542 struct lysp_module *parsed; /**< Simply parsed (unresolved) YANG schema tree */
Radek Krejci0af46292019-01-11 16:02:31 +01001543 struct lysc_module *compiled; /**< Compiled and fully validated YANG schema tree for data parsing.
1544 Available only for implemented modules. */
1545 struct lysc_feature *off_features;/**< List of pre-compiled features of the module in non implemented modules ([sized array](@ref sizedarrays)).
1546 These features are always disabled and cannot be enabled until the module
1547 become implemented. The features are present in this form to allow their linkage
1548 from if-feature statements of the compiled schemas and their proper use in case
1549 the module became implemented in future (no matter if implicitly via augment/deviate
1550 or explicitly via ly_ctx_module_implement()). */
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001551
Radek Krejci95710c92019-02-11 15:49:55 +01001552 uint8_t implemented; /**< flag if the module is implemented, not just imported. The module is implemented if
1553 the flag has non-zero value. Specific values are used internally:
1554 1 - implemented module
1555 2 - recently implemented module by dependency, it can be reverted in rollback procedure */
1556 uint8_t latest_revision; /**< flag to mark the latest available revision:
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001557 1 - the latest revision in searchdirs was not searched yet and this is the
1558 latest revision in the current context
1559 2 - searchdirs were searched and this is the latest available revision */
1560 uint8_t version; /**< yang-version (LYS_VERSION values) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001561};
1562
Radek Krejci151a5b72018-10-19 14:21:44 +02001563/**
1564 * @brief Enable specified feature in the module
1565 *
1566 * By default, when the module is loaded by libyang parser, all features are disabled.
1567 *
Radek Krejcica3db002018-11-01 10:31:01 +01001568 * If all features are being enabled, it must be possible respecting their if-feature conditions. For example,
1569 * enabling all features on the following feature set will fail since it is not possible to enable both features
1570 * (and it is unclear which of them should be enabled then). In this case the LY_EDENIED is returned and the feature
1571 * is untouched.
1572 *
1573 * feature f1;
1574 * feature f2 { if-feature 'not f1';}
1575 *
Radek Krejci151a5b72018-10-19 14:21:44 +02001576 * @param[in] module Module where the feature will be enabled.
1577 * @param[in] feature Name of the feature to enable. To enable all features at once, use asterisk (`*`) character.
1578 * @return LY_ERR value.
1579 */
1580LY_ERR lys_feature_enable(struct lys_module *module, const char *feature);
1581
1582/**
1583 * @brief Disable specified feature in the module
1584 *
1585 * By default, when the module is loaded by libyang parser, all features are disabled.
1586 *
1587 * @param[in] module Module where the feature will be disabled.
1588 * @param[in] feature Name of the feature to disable. To disable all features at once, use asterisk (`*`) character.
1589 * @return LY_ERR value
1590 */
1591LY_ERR lys_feature_disable(struct lys_module *module, const char *feature);
1592
1593/**
1594 * @brief Get the current status of the specified feature in the module.
1595 *
1596 * @param[in] module Module where the feature is defined.
1597 * @param[in] feature Name of the feature to inspect.
1598 * @return
1599 * - 1 if feature is enabled,
1600 * - 0 if feature is disabled,
1601 * - -1 in case of error (e.g. feature is not defined or invalid arguments)
1602 */
1603int lys_feature_value(const struct lys_module *module, const char *feature);
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001604
1605/**
Radek Krejci86d106e2018-10-18 09:53:19 +02001606 * @brief Load a schema into the specified context.
1607 *
1608 * @param[in] ctx libyang context where to process the data model.
1609 * @param[in] data The string containing the dumped data model in the specified
1610 * format.
1611 * @param[in] format Format of the input data (YANG or YIN).
1612 * @return Pointer to the data model structure or NULL on error.
1613 */
Radek Krejcid14e9692018-11-01 11:00:37 +01001614struct lys_module *lys_parse_mem(struct ly_ctx *ctx, const char *data, LYS_INFORMAT format);
Radek Krejci86d106e2018-10-18 09:53:19 +02001615
1616/**
1617 * @brief Read a schema from file descriptor into the specified context.
1618 *
1619 * \note Current implementation supports only reading data from standard (disk) file, not from sockets, pipes, etc.
1620 *
1621 * @param[in] ctx libyang context where to process the data model.
1622 * @param[in] fd File descriptor of a regular file (e.g. sockets are not supported) containing the schema
1623 * in the specified format.
1624 * @param[in] format Format of the input data (YANG or YIN).
1625 * @return Pointer to the data model structure or NULL on error.
1626 */
Radek Krejcid14e9692018-11-01 11:00:37 +01001627struct lys_module *lys_parse_fd(struct ly_ctx *ctx, int fd, LYS_INFORMAT format);
Radek Krejci86d106e2018-10-18 09:53:19 +02001628
1629/**
Radek Krejcid33273d2018-10-25 14:55:52 +02001630 * @brief Read a schema into the specified context from a file.
Radek Krejci86d106e2018-10-18 09:53:19 +02001631 *
1632 * @param[in] ctx libyang context where to process the data model.
1633 * @param[in] path Path to the file with the model in the specified format.
1634 * @param[in] format Format of the input data (YANG or YIN).
1635 * @return Pointer to the data model structure or NULL on error.
1636 */
Radek Krejcid14e9692018-11-01 11:00:37 +01001637struct lys_module *lys_parse_path(struct ly_ctx *ctx, const char *path, LYS_INFORMAT format);
Radek Krejci86d106e2018-10-18 09:53:19 +02001638
1639/**
Radek Krejcid33273d2018-10-25 14:55:52 +02001640 * @brief Search for the schema file in the specified searchpaths.
1641 *
1642 * @param[in] searchpaths NULL-terminated array of paths to be searched (recursively). Current working
1643 * directory is searched automatically (but non-recursively if not in the provided list). Caller can use
1644 * result of the ly_ctx_get_searchdirs().
1645 * @param[in] cwd Flag to implicitly search also in the current working directory (non-recursively).
1646 * @param[in] name Name of the schema to find.
1647 * @param[in] revision Revision of the schema to find. If NULL, the newest found schema filepath is returned.
1648 * @param[out] localfile Mandatory output variable containing absolute path of the found schema. If no schema
1649 * complying the provided restriction is found, NULL is set.
1650 * @param[out] format Optional output variable containing expected format of the schema document according to the
1651 * file suffix.
1652 * @return LY_ERR value (LY_SUCCESS is returned even if the file is not found, then the *localfile is NULL).
1653 */
1654LY_ERR lys_search_localfile(const char * const *searchpaths, int cwd, const char *name, const char *revision, char **localfile, LYS_INFORMAT *format);
1655
1656/**
Radek Krejcia3045382018-11-22 14:30:31 +01001657 * @brief Get next schema tree (sibling) node element that can be instantiated in a data tree. Returned node can
1658 * be from an augment.
1659 *
1660 * lys_getnext() is supposed to be called sequentially. In the first call, the \p last parameter is usually NULL
1661 * and function starts returning i) the first \p parent's child or ii) the first top level element of the \p module.
1662 * Consequent calls suppose to provide the previously returned node as the \p last parameter and still the same
1663 * \p parent and \p module parameters.
1664 *
1665 * Without options, the function is used to traverse only the schema nodes that can be paired with corresponding
1666 * data nodes in a data tree. By setting some \p options the behavior can be modified to the extent that
1667 * all the schema nodes are iteratively returned.
1668 *
1669 * @param[in] last Previously returned schema tree node, or NULL in case of the first call.
1670 * @param[in] parent Parent of the subtree where the function starts processing.
1671 * @param[in] module In case of iterating on top level elements, the \p parent is NULL and
1672 * module must be specified.
1673 * @param[in] options [ORed options](@ref sgetnextflags).
1674 * @return Next schema tree node that can be instantiated in a data tree, NULL in case there is no such element.
1675 */
1676const struct lysc_node *lys_getnext(const struct lysc_node *last, const struct lysc_node *parent,
1677 const struct lysc_module *module, int options);
1678
1679/**
1680 * @defgroup sgetnextflags lys_getnext() flags
1681 * @ingroup schematree
1682 *
1683 * @{
1684 */
1685#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 +01001686#define LYS_GETNEXT_NOCHOICE 0x02 /**< lys_getnext() option to ignore (kind of conditional) nodes within choice node */
Radek Krejci056d0a82018-12-06 16:57:25 +01001687#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 +01001688#define LYS_GETNEXT_INTONPCONT 0x40 /**< lys_getnext() option to look into non-presence container, instead of returning container itself */
1689#define LYS_GETNEXT_NOSTATECHECK 0x100 /**< lys_getnext() option to skip checking module validity (import-only, disabled) and
1690 relevant if-feature conditions state */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001691#define LYS_GETNEXT_OUTPUT 0x200 /**< lys_getnext() option to provide RPC's/action's output schema nodes instead of input schema nodes
1692 provided by default */
Radek Krejcia3045382018-11-22 14:30:31 +01001693/** @} sgetnextflags */
1694
1695/**
1696 * @brief Get child node according to the specified criteria.
1697 *
1698 * @param[in] parent Optional parent of the node to find. If not specified, the module's top-level nodes are searched.
1699 * @param[in] module module of the node to find. It is also limitation for the children node of the given parent.
1700 * @param[in] name Name of the node to find.
1701 * @param[in] name_len Optional length of the name in case it is not NULL-terminated string.
1702 * @param[in] nodetype Optional criteria (to speedup) specifying nodetype(s) of the node to find.
1703 * Used as a bitmask, so multiple nodetypes can be specified.
1704 * @param[in] options [ORed options](@ref sgetnextflags).
1705 * @return Found node if any.
1706 */
1707const struct lysc_node *lys_child(const struct lysc_node *parent, const struct lys_module *module,
1708 const char *name, size_t name_len, uint16_t nodetype, int options);
1709
1710/**
1711 * @brief Check if the schema node is disabled in the schema tree, i.e. there is any disabled if-feature statement
1712 * affecting the node.
1713 *
1714 * @param[in] node Schema node to check.
1715 * @param[in] recursive - 0 to check if-feature only in the \p node schema node,
1716 * - 1 to check if-feature in all ascendant schema nodes until there is a node possibly having an instance in a data tree
1717 * @return - NULL if enabled,
1718 * - pointer to the node with the unsatisfied (disabling) if-feature expression.
1719 */
1720const struct lysc_iffeature *lys_is_disabled(const struct lysc_node *node, int recursive);
1721
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001722/** @} */
1723
Radek Krejci70853c52018-10-15 14:46:16 +02001724#ifdef __cplusplus
1725}
1726#endif
1727
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001728#endif /* LY_TREE_SCHEMA_H_ */