blob: ae4f1ff75017738fb0e40a6ee103ed5767e6bf8f [file] [log] [blame]
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001/**
2 * @file tree_schema.h
3 * @author Radek Krejci <rkrejci@cesnet.cz>
4 * @brief libyang representation of YANG schema trees.
5 *
6 * Copyright (c) 2015 - 2018 CESNET, z.s.p.o.
7 *
8 * This source code is licensed under BSD 3-Clause License (the "License").
9 * You may not use this file except in compliance with the License.
10 * You may obtain a copy of the License at
11 *
12 * https://opensource.org/licenses/BSD-3-Clause
13 */
14
15#ifndef LY_TREE_SCHEMA_H_
16#define LY_TREE_SCHEMA_H_
17
Radek Krejci2167ee12018-11-02 16:09:07 +010018#include <pcre.h>
Radek Krejci5aeea3a2018-09-05 13:29:36 +020019#include <stdint.h>
20
Radek Krejcice8c1592018-10-29 15:35:51 +010021#include "extensions.h"
22
Radek Krejci70853c52018-10-15 14:46:16 +020023#ifdef __cplusplus
24extern "C" {
25#endif
26
Radek Krejci5aeea3a2018-09-05 13:29:36 +020027/**
Radek Krejcidd4e8d42018-10-16 14:55:43 +020028 * @brief XPath representation.
29 */
30struct lyxp_expr;
31
32/**
Radek Krejcie53a8dc2018-10-17 12:52:40 +020033 * @brief Macro selector for other LY_ARRAY_* macros, do not use directly!
34 */
35#define LY_ARRAY_SELECT(_1, _2, NAME, ...) NAME
36
37/**
Radek Krejcie53a8dc2018-10-17 12:52:40 +020038 * @brief Helper macro to go through sized-arrays with a pointer iterator.
39 *
40 * Use with opening curly bracket (`{`).
41 *
42 * @param[in] ARRAY Array to go through
43 * @param[in] TYPE Type of the records in the ARRAY
44 * @param[out] ITER Iterating pointer to the item being processed in each loop
45 */
46#define LY_ARRAY_FOR_ITER(ARRAY, TYPE, ITER) \
Radek Krejci2c4e7172018-10-19 15:56:26 +020047 for (ITER = ARRAY; \
48 (ARRAY) && ((void*)ITER - (void*)ARRAY)/(sizeof(TYPE)) < (*((uint32_t*)(ARRAY) - 1)); \
Radek Krejcie53a8dc2018-10-17 12:52:40 +020049 ITER = (void*)((TYPE*)ITER + 1))
50
51/**
52 * @brief Helper macro to go through sized-arrays with a numeric iterator.
53 *
54 * Use with opening curly bracket (`{`).
55 *
56 * To access an item with the INDEX value, use always LY_ARRAY_INDEX macro!
57 *
58 * @param[in] ARRAY Array to go through
59 * @param[out] INDEX Iterating index of the item being processed in each loop
60 */
61#define LY_ARRAY_FOR_INDEX(ARRAY, INDEX) \
62 for (INDEX = 0; \
Radek Krejci2c4e7172018-10-19 15:56:26 +020063 ARRAY && INDEX < (*((uint32_t*)(ARRAY) - 1)); \
Radek Krejcie53a8dc2018-10-17 12:52:40 +020064 ++INDEX)
65
66/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +020067 * @defgroup schematree Schema Tree
68 * @{
69 *
70 * Data structures and functions to manipulate and access schema tree.
71 */
72
Radek Krejci0af5f5d2018-09-07 15:00:30 +020073/**
Radek Krejcie53a8dc2018-10-17 12:52:40 +020074 * @brief Get a number of records in the ARRAY.
Radek Krejci86d106e2018-10-18 09:53:19 +020075 *
76 * Does not check if array exists!
Radek Krejcie53a8dc2018-10-17 12:52:40 +020077 */
Radek Krejci2c4e7172018-10-19 15:56:26 +020078#define LY_ARRAY_SIZE(ARRAY) (*((uint32_t*)(ARRAY) - 1))
Radek Krejcie53a8dc2018-10-17 12:52:40 +020079
80/**
81 * @brief Sized-array iterator (for-loop).
82 *
83 * Use with opening curly bracket (`{`).
84 *
85 * There are 2 variants:
86 *
87 * LY_ARRAY_FOR(ARRAY, TYPE, ITER)
88 *
89 * Where ARRAY is a sized-array to go through, TYPE is the type of the items in the ARRAY and ITER is a pointer variable
90 * providing the items of the ARRAY in the loops. This functionality is provided by LY_ARRAY_FOR_ITER macro
91 *
92 * LY_ARRAY_FOR(ARRAY, INDEX)
93 *
94 * The ARRAY is again a sized-array to go through, the INDEX is a variable (unsigned integer) for storing iterating ARRAY's index
Radek Krejci2c4e7172018-10-19 15:56:26 +020095 * to access the items of ARRAY in the loops. This functionality is provided by LY_ARRAY_FOR_INDEX macro.
Radek Krejcie53a8dc2018-10-17 12:52:40 +020096 */
97#define LY_ARRAY_FOR(ARRAY, ...) LY_ARRAY_SELECT(__VA_ARGS__, LY_ARRAY_FOR_ITER, LY_ARRAY_FOR_INDEX)(ARRAY, __VA_ARGS__)
Radek Krejci5fac3592018-10-12 15:23:45 +020098
99/**
100 * @brief Macro to iterate via all sibling elements without affecting the list itself
101 *
102 * Works for all types of nodes despite it is data or schema tree, but all the
103 * parameters must be pointers to the same type.
104 *
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200105 * Use with opening curly bracket (`{`). All parameters must be of the same type.
Radek Krejci5fac3592018-10-12 15:23:45 +0200106 *
107 * @param START Pointer to the starting element.
108 * @param ELEM Iterator.
109 */
110#define LY_LIST_FOR(START, ELEM) \
111 for ((ELEM) = (START); \
112 (ELEM); \
113 (ELEM) = (ELEM)->next)
114
115/**
Radek Krejci5fac3592018-10-12 15:23:45 +0200116 * @brief Macro to iterate via all sibling elements allowing to modify the list itself (e.g. removing elements)
117 *
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200118 * Use with opening curly bracket (`{`). All parameters must be of the same type.
Radek Krejci5fac3592018-10-12 15:23:45 +0200119 *
120 * @param START Pointer to the starting element.
121 * @param NEXT Temporary storage to allow removing of the current iterator content.
122 * @param ELEM Iterator.
123 */
124#define LY_LIST_FOR_SAFE(START, NEXT, ELEM) \
125 for ((ELEM) = (START); \
126 (ELEM) ? (NEXT = (ELEM)->next, 1) : 0; \
127 (ELEM) = (NEXT))
128
129/**
Radek Krejci0af5f5d2018-09-07 15:00:30 +0200130 * @brief Schema input formats accepted by libyang [parser functions](@ref howtoschemasparsers).
131 */
132typedef enum {
133 LYS_IN_UNKNOWN = 0, /**< unknown format, used as return value in case of error */
134 LYS_IN_YANG = 1, /**< YANG schema input format */
135 LYS_IN_YIN = 2 /**< YIN schema input format */
136} LYS_INFORMAT;
137
138/**
139 * @brief Schema output formats accepted by libyang [printer functions](@ref howtoschemasprinters).
140 */
141typedef enum {
142 LYS_OUT_UNKNOWN = 0, /**< unknown format, used as return value in case of error */
143 LYS_OUT_YANG = 1, /**< YANG schema output format */
144 LYS_OUT_YIN = 2, /**< YIN schema output format */
145 LYS_OUT_TREE, /**< Tree schema output format, for more information see the [printers](@ref howtoschemasprinters) page */
146 LYS_OUT_INFO, /**< Info schema output format, for more information see the [printers](@ref howtoschemasprinters) page */
147 LYS_OUT_JSON, /**< JSON schema output format, reflecting YIN format with conversion of attributes to object's members */
148} LYS_OUTFORMAT;
149
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200150#define LY_REV_SIZE 11 /**< revision data string length (including terminating NULL byte) */
151
Michal Vaskob55f6c12018-09-12 11:13:15 +0200152#define LYS_UNKNOWN 0x0000 /**< uninitalized unknown statement node */
153#define LYS_CONTAINER 0x0001 /**< container statement node */
154#define LYS_CHOICE 0x0002 /**< choice statement node */
155#define LYS_LEAF 0x0004 /**< leaf statement node */
156#define LYS_LEAFLIST 0x0008 /**< leaf-list statement node */
157#define LYS_LIST 0x0010 /**< list statement node */
158#define LYS_ANYXML 0x0020 /**< anyxml statement node */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200159#define LYS_ANYDATA 0x0120 /**< anydata statement node, in tests it can be used for both #LYS_ANYXML and #LYS_ANYDATA */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200160
Radek Krejcia3045382018-11-22 14:30:31 +0100161#define LYS_CASE 0x0040 /**< case statement node */
162#define LYS_USES 0x0080 /**< uses statement node */
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100163#define LYS_INOUT 0x200
164#define LYS_ACTION 0x400
165#define LYS_NOTIF 0x800
166#define LYS_GROUPING 0x1000
167#define LYS_AUGMENT 0x2000
168
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200169/**
Radek Krejci2167ee12018-11-02 16:09:07 +0100170 * @brief YANG built-in types
171 */
172typedef enum {
173 LY_TYPE_UNKNOWN = 0, /**< Unknown type */
174 LY_TYPE_BINARY, /**< Any binary data ([RFC 6020 sec 9.8](http://tools.ietf.org/html/rfc6020#section-9.8)) */
Radek Krejci5969f272018-11-23 10:03:58 +0100175 LY_TYPE_UINT8, /**< 8-bit unsigned integer ([RFC 6020 sec 9.2](http://tools.ietf.org/html/rfc6020#section-9.2)) */
176 LY_TYPE_UINT16, /**< 16-bit unsigned integer ([RFC 6020 sec 9.2](http://tools.ietf.org/html/rfc6020#section-9.2)) */
177 LY_TYPE_UINT32, /**< 32-bit unsigned integer ([RFC 6020 sec 9.2](http://tools.ietf.org/html/rfc6020#section-9.2)) */
178 LY_TYPE_UINT64, /**< 64-bit unsigned integer ([RFC 6020 sec 9.2](http://tools.ietf.org/html/rfc6020#section-9.2)) */
179 LY_TYPE_STRING, /**< Human-readable string ([RFC 6020 sec 9.4](http://tools.ietf.org/html/rfc6020#section-9.4)) */
Radek Krejci2167ee12018-11-02 16:09:07 +0100180 LY_TYPE_BITS, /**< A set of bits or flags ([RFC 6020 sec 9.7](http://tools.ietf.org/html/rfc6020#section-9.7)) */
181 LY_TYPE_BOOL, /**< "true" or "false" ([RFC 6020 sec 9.5](http://tools.ietf.org/html/rfc6020#section-9.5)) */
182 LY_TYPE_DEC64, /**< 64-bit signed decimal number ([RFC 6020 sec 9.3](http://tools.ietf.org/html/rfc6020#section-9.3))*/
183 LY_TYPE_EMPTY, /**< A leaf that does not have any value ([RFC 6020 sec 9.11](http://tools.ietf.org/html/rfc6020#section-9.11)) */
184 LY_TYPE_ENUM, /**< Enumerated strings ([RFC 6020 sec 9.6](http://tools.ietf.org/html/rfc6020#section-9.6)) */
185 LY_TYPE_IDENT, /**< A reference to an abstract identity ([RFC 6020 sec 9.10](http://tools.ietf.org/html/rfc6020#section-9.10)) */
186 LY_TYPE_INST, /**< References a data tree node ([RFC 6020 sec 9.13](http://tools.ietf.org/html/rfc6020#section-9.13)) */
187 LY_TYPE_LEAFREF, /**< A reference to a leaf instance ([RFC 6020 sec 9.9](http://tools.ietf.org/html/rfc6020#section-9.9))*/
Radek Krejci2167ee12018-11-02 16:09:07 +0100188 LY_TYPE_UNION, /**< Choice of member types ([RFC 6020 sec 9.12](http://tools.ietf.org/html/rfc6020#section-9.12)) */
189 LY_TYPE_INT8, /**< 8-bit signed integer ([RFC 6020 sec 9.2](http://tools.ietf.org/html/rfc6020#section-9.2)) */
Radek Krejci2167ee12018-11-02 16:09:07 +0100190 LY_TYPE_INT16, /**< 16-bit signed integer ([RFC 6020 sec 9.2](http://tools.ietf.org/html/rfc6020#section-9.2)) */
Radek Krejci2167ee12018-11-02 16:09:07 +0100191 LY_TYPE_INT32, /**< 32-bit signed integer ([RFC 6020 sec 9.2](http://tools.ietf.org/html/rfc6020#section-9.2)) */
Radek Krejci2167ee12018-11-02 16:09:07 +0100192 LY_TYPE_INT64, /**< 64-bit signed integer ([RFC 6020 sec 9.2](http://tools.ietf.org/html/rfc6020#section-9.2)) */
Radek Krejci2167ee12018-11-02 16:09:07 +0100193} LY_DATA_TYPE;
194#define LY_DATA_TYPE_COUNT 20 /**< Number of different types */
195
Radek Krejci5969f272018-11-23 10:03:58 +0100196/**
197 * @brief Stringified YANG built-in data types
198 */
Radek Krejcid505e3d2018-11-13 09:04:17 +0100199extern const char* ly_data_type2str[LY_DATA_TYPE_COUNT];
200
Radek Krejci2167ee12018-11-02 16:09:07 +0100201/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200202 * @brief YANG import-stmt
203 */
204struct lysp_import {
Radek Krejci086c7132018-10-26 15:29:04 +0200205 struct lys_module *module; /**< pointer to the imported module
206 (mandatory, but resolved when the referring module is completely parsed) */
207 const char *name; /**< name of the imported module (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200208 const char *prefix; /**< prefix for the data from the imported schema (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200209 const char *dsc; /**< description */
210 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200211 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200212 char rev[LY_REV_SIZE]; /**< revision-date of the imported module */
213};
214
215/**
216 * @brief YANG include-stmt
217 */
218struct lysp_include {
Radek Krejci086c7132018-10-26 15:29:04 +0200219 struct lysp_module *submodule; /**< pointer to the parsed submodule structure
220 (mandatory, but resolved when the referring module is completely parsed) */
221 const char *name; /**< name of the included submodule (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200222 const char *dsc; /**< description */
223 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200224 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200225 char rev[LY_REV_SIZE]; /**< revision-date of the included submodule */
226};
227
228/**
229 * @brief YANG extension-stmt
230 */
231struct lysp_ext {
232 const char *name; /**< extension name */
233 const char *argument; /**< argument name, NULL if not specified */
234 const char *dsc; /**< description statement */
235 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200236 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200237 uint16_t flags; /**< LYS_STATUS_* and LYS_YINELEM values (@ref snodeflags) */
238};
239
240/**
241 * @brief Helper structure for generic storage of the extension instances content.
242 */
243struct lysp_stmt {
244 const char *stmt; /**< identifier of the statement */
245 const char *arg; /**< statement's argument */
246 struct lysp_stmt *next; /**< link to the next statement */
Michal Vaskobc2559f2018-09-07 10:17:50 +0200247 struct lysp_stmt *child; /**< list of the statement's substatements (linked list) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200248};
249
250/**
251 * @brief YANG extension instance
252 */
253struct lysp_ext_instance {
254 const char *name; /**< extension identifier, including possible prefix */
255 const char *argument; /**< optional value of the extension's argument */
Michal Vaskod92e42a2018-09-07 08:35:02 +0200256 LYEXT_SUBSTMT insubstmt; /**< value identifying placement of the extension instance */
257 uint32_t insubstmt_index; /**< in case the instance is in a substatement, this identifies
258 the index of that substatement */
Michal Vaskobc2559f2018-09-07 10:17:50 +0200259 struct lysp_stmt *child; /**< list of the extension's substatements (linked list) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200260};
261
262/**
263 * @brief YANG feature-stmt
264 */
265struct lysp_feature {
266 const char *name; /**< feature name (mandatory) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200267 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200268 const char *dsc; /**< description statement */
269 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200270 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200271 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values allowed */
272};
273
274/**
275 * @brief YANG identity-stmt
276 */
277struct lysp_ident {
278 const char *name; /**< identity name (mandatory), including possible prefix */
Radek Krejci151a5b72018-10-19 14:21:44 +0200279 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
280 const char **bases; /**< list of base identifiers ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200281 const char *dsc; /**< description statement */
282 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200283 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200284 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_ values are allowed */
285};
286
Michal Vasko71e64ca2018-09-07 16:30:29 +0200287/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200288 * @brief Covers restrictions: range, length, pattern, must
289 */
290struct lysp_restr {
291 const char *arg; /**< The restriction expression/value (mandatory);
292 in case of pattern restriction, the first byte has a special meaning:
293 0x06 (ACK) for regular match and 0x15 (NACK) for invert-match */
294 const char *emsg; /**< error-message */
295 const char *eapptag; /**< error-app-tag value */
296 const char *dsc; /**< description */
297 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200298 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200299};
300
301/**
Michal Vasko71e64ca2018-09-07 16:30:29 +0200302 * @brief YANG revision-stmt
303 */
304struct lysp_revision {
Radek Krejcib7db73a2018-10-24 14:18:40 +0200305 char date[LY_REV_SIZE]; /**< revision date (madatory) */
Michal Vasko71e64ca2018-09-07 16:30:29 +0200306 const char *dsc; /**< description statement */
307 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200308 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vasko71e64ca2018-09-07 16:30:29 +0200309};
310
311/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200312 * @brief Enumeration/Bit value definition
313 */
314struct lysp_type_enum {
315 const char *name; /**< name (mandatory) */
316 const char *dsc; /**< description statement */
317 const char *ref; /**< reference statement */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200318 int64_t value; /**< enum's value or bit's position */
Radek Krejci151a5b72018-10-19 14:21:44 +0200319 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200320 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200321 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_ and LYS_SET_VALUE
322 values are allowed */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200323};
324
325/**
326 * @brief YANG type-stmt
327 *
328 * Some of the items in the structure may be mandatory, but it is necessary to resolve the type's base type first
329 */
330struct lysp_type {
331 const char *name; /**< name of the type (mandatory) */
332 struct lysp_restr *range; /**< allowed values range - numerical, decimal64 */
333 struct lysp_restr *length; /**< allowed length of the value - string, binary */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200334 struct lysp_restr *patterns; /**< list of patterns ([sized array](@ref sizedarrays)) - string */
335 struct lysp_type_enum *enums; /**< list of enum-stmts ([sized array](@ref sizedarrays)) - enum */
336 struct lysp_type_enum *bits; /**< list of bit-stmts ([sized array](@ref sizedarrays)) - bits */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200337 const char *path; /**< path - leafref */
Radek Krejci151a5b72018-10-19 14:21:44 +0200338 const char **bases; /**< list of base identifiers ([sized array](@ref sizedarrays)) - identityref */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200339 struct lysp_type *types; /**< list of sub-types ([sized array](@ref sizedarrays)) - union */
340 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200341
Radek Krejci2167ee12018-11-02 16:09:07 +0100342 struct lysc_type *compiled; /**< pointer to the compiled type */
343
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200344 uint8_t fraction_digits; /**< number of fraction digits - decimal64 */
345 uint8_t require_instance; /**< require-instance flag - leafref, instance */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100346 uint16_t flags; /**< [schema node flags](@ref spnodeflags) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200347};
348
349/**
350 * @brief YANG typedef-stmt
351 */
352struct lysp_tpdf {
353 const char *name; /**< name of the newly defined type (mandatory) */
354 const char *units; /**< units of the newly defined type */
355 const char *dflt; /**< default value of the newly defined type */
356 const char *dsc; /**< description statement */
357 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200358 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200359 struct lysp_type type; /**< base type from which the typedef is derived (mandatory) */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100360 uint16_t flags; /**< [schema node flags](@ref spnodeflags) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200361};
362
363/**
364 * @brief YANG grouping-stmt
365 */
366struct lysp_grp {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100367 struct lysp_node *parent; /**< parent node (NULL if this is a top-level grouping) */
368 uint16_t nodetype; /**< LYS_GROUPING */
369 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values are allowed */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200370 const char *name; /**< grouping name (mandatory) */
371 const char *dsc; /**< description statement */
372 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200373 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
374 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200375 struct lysp_node *data; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200376 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
377 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
378 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200379};
380
381/**
382 * @brief YANG when-stmt
383 */
384struct lysp_when {
385 const char *cond; /**< specified condition (mandatory) */
386 const char *dsc; /**< description statement */
387 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200388 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200389};
390
391/**
392 * @brief YANG refine-stmt
393 */
394struct lysp_refine {
395 const char *nodeid; /**< target descendant schema nodeid (mandatory) */
396 const char *dsc; /**< description statement */
397 const char *ref; /**< reference statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200398 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200399 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200400 const char *presence; /**< presence description */
Radek Krejci151a5b72018-10-19 14:21:44 +0200401 const char **dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200402 uint32_t min; /**< min-elements constraint */
403 uint32_t max; /**< max-elements constraint, 0 means unbounded */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200404 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200405 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
406};
407
408/**
409 * @brief YANG uses-augment-stmt and augment-stmt
410 */
411struct lysp_augment {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100412 struct lysp_node *parent; /**< parent node (NULL if this is a top-level augment) */
413 uint16_t nodetype; /**< LYS_AUGMENT */
414 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values are allowed */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200415 const char *nodeid; /**< target schema nodeid (mandatory) - absolute for global augments, descendant for uses's augments */
416 const char *dsc; /**< description statement */
417 const char *ref; /**< reference statement */
418 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200419 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200420 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200421 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
422 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
423 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200424};
425
426/**
427 * @defgroup deviatetypes Deviate types
428 * @{
429 */
430#define LYS_DEV_NOT_SUPPORTED 1 /**< deviate type not-supported */
431#define LYS_DEV_ADD 2 /**< deviate type add */
432#define LYS_DEV_DELETE 3 /**< deviate type delete */
433#define LYS_DEV_REPLACE 4 /**< deviate type replace */
434/** @} */
435
436/**
437 * @brief Generic deviate structure to get type and cast to lysp_deviate_* structure
438 */
439struct lysp_deviate {
440 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
441 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200442 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200443};
444
445struct lysp_deviate_add {
446 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
447 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200448 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200449 const char *units; /**< units of the values */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200450 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200451 const char **uniques; /**< list of uniques specifications ([sized array](@ref sizedarrays)) */
452 const char **dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200453 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
454 uint32_t min; /**< min-elements constraint */
455 uint32_t max; /**< max-elements constraint, 0 means unbounded */
456};
457
458struct lysp_deviate_del {
459 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
460 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200461 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200462 const char *units; /**< units of the values */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200463 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200464 const char **uniques; /**< list of uniques specifications ([sized array](@ref sizedarrays)) */
465 const char **dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200466 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200467};
468
469struct lysp_deviate_rpl {
470 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
471 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200472 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200473 struct lysp_type *type; /**< type of the node */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200474 const char *units; /**< units of the values */
475 const char *dflt; /**< default value */
476 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
477 uint32_t min; /**< min-elements constraint */
478 uint32_t max; /**< max-elements constraint, 0 means unbounded */
479};
480
481struct lysp_deviation {
Michal Vaskob55f6c12018-09-12 11:13:15 +0200482 const char *nodeid; /**< target absolute schema nodeid (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200483 const char *dsc; /**< description statement */
484 const char *ref; /**< reference statement */
485 struct lysp_deviate* deviates; /**< list of deviate specifications (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200486 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200487};
488
Radek Krejci4f28eda2018-11-12 11:46:16 +0100489/**
490 * @defgroup spnodeflags Parsed schema nodes flags
491 * @ingroup snodeflags
492 *
493 * Various flags for parsed schema nodes.
494 *
495 * 1 - container 6 - anydata/anyxml 11 - output 16 - grouping 21 - enum
496 * 2 - choice 7 - case 12 - feature 17 - uses 22 - type
497 * 3 - leaf 8 - notification 13 - identity 18 - refine
498 * 4 - leaflist 9 - rpc 14 - extension 19 - augment
499 * 5 - list 10 - input 15 - typedef 20 - deviate
500 *
501 * 1 1 1 1 1 1 1 1 1 1 2 2 2
502 * bit name 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2
503 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
504 * 1 LYS_CONFIG_W |x|x|x|x|x|x|x| | | | | | | | | | |x| |x| | |
Radek Krejcid505e3d2018-11-13 09:04:17 +0100505 * LYS_SET_BASE | | | | | | | | | | | | | | | | | | | | | |x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100506 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
507 * 2 LYS_CONFIG_R |x|x|x|x|x|x|x| | | | | | | | | | |x| |x| | |
Radek Krejcid505e3d2018-11-13 09:04:17 +0100508 * LYS_SET_BIT | | | | | | | | | | | | | | | | | | | | | |x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100509 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
510 * 3 LYS_STATUS_CURR |x|x|x|x|x|x|x|x|x| | |x|x|x|x|x|x| |x|x|x| |
Radek Krejcid505e3d2018-11-13 09:04:17 +0100511 * LYS_SET_ENUM | | | | | | | | | | | | | | | | | | | | | |x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100512 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
513 * 4 LYS_STATUS_DEPRC |x|x|x|x|x|x|x|x|x| | |x|x|x|x|x|x| |x|x|x| |
Radek Krejcid505e3d2018-11-13 09:04:17 +0100514 * LYS_SET_FRDIGITS | | | | | | | | | | | | | | | | | | | | | |x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100515 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
516 * 5 LYS_STATUS_OBSLT |x|x|x|x|x|x|x|x|x| | |x|x|x|x|x|x| |x|x|x| |
Radek Krejcid505e3d2018-11-13 09:04:17 +0100517 * LYS_SET_LENGTH | | | | | | | | | | | | | | | | | | | | | |x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100518 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
519 * 6 LYS_MAND_TRUE | |x|x| | |x| | | | | | | | | | | |x| |x| | |
520 * LYS_ORDBY_SYSTEM | | | |x|x| | | | | | | | | | | | | | | | | |
Radek Krejcid505e3d2018-11-13 09:04:17 +0100521 * LYS_SET_PATH | | | | | | | | | | | | | | | | | | | | | |x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100522 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
523 * 7 LYS_MAND_FALSE | |x|x| | |x| | | | | | | | | | | |x| |x| | |
524 * LYS_ORDBY_USER | | | |x|x| | | | | | | | | | | | | | | | | |
Radek Krejcid505e3d2018-11-13 09:04:17 +0100525 * LYS_SET_PATTERN | | | | | | | | | | | | | | | | | | | | | |x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100526 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
527 * 8 LYS_YINELEM_TRUE | | | | | | | | | | | | | |x| | | | | | | | |
Radek Krejcid505e3d2018-11-13 09:04:17 +0100528 * LYS_SET_RANGE | | | | | | | | | | | | | | | | | | | | | |x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100529 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
530 * 9 LYS_YINELEM_FALSE| | | | | | | | | | | | | |x| | | | | | | | |
Radek Krejcid505e3d2018-11-13 09:04:17 +0100531 * LYS_SET_TYPE | | | | | | | | | | | | | | | | | | | | | |x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100532 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
533 * 10 LYS_SET_VALUE | | | | | | | | | | | | | | | | | | | | |x| |
534 * LYS_SET_REQINST | | | | | | | | | | | | | | | | | | | | | |x|
535 * LYS_SET_MIN | | | |x|x| | | | | | | | | | | | |x| |x| | |
536 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
537 * 11 LYS_SET_MAX | | | |x|x| | | | | | | | | | | | |x| |x| | |
Radek Krejci4f28eda2018-11-12 11:46:16 +0100538 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
539 *
540 */
541
542/**
543 * @defgroup scnodeflags Compiled schema nodes flags
544 * @ingroup snodeflags
545 *
546 * Various flags for compiled schema nodes.
547 *
548 * 1 - container 6 - anydata/anyxml 11 - output
549 * 2 - choice 7 - case 12 - feature
550 * 3 - leaf 8 - notification 13 - identity
551 * 4 - leaflist 9 - rpc 14 - extension
552 * 5 - list 10 - input
553 *
554 * 1 1 1 1 1
555 * bit name 1 2 3 4 5 6 7 8 9 0 1 2 3 4
556 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
557 * 1 LYS_CONFIG_W |x|x|x|x|x|x|x| | |x| | | | |
558 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
559 * 2 LYS_CONFIG_R |x|x|x|x|x|x|x| | | |x| | | |
560 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
561 * 3 LYS_PRESENCE |x| | | | | | | | | | | | | |
562 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
563 * 4 LYS_UNIQUE | | |x| | | | | | | | | | | |
564 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Radek Krejci9bb94eb2018-12-04 16:48:35 +0100565 * 5 LYS_KEY | | |x| | | | | | | | | | | |
566 * LYS_FENABLED | | | | | | | | | | | |x| | |
Radek Krejci4f28eda2018-11-12 11:46:16 +0100567 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
568 * 6 LYS_MAND_TRUE | |x|x| | |x| | | | | | | | |
Radek Krejci0e5d8382018-11-28 16:37:53 +0100569 * LYS_ORDBY_SYSTEM | | | |x|x| | | | | | | | | |
Radek Krejci4f28eda2018-11-12 11:46:16 +0100570 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
571 * 7 LYS_ORDBY_USER | | | |x|x| | | | | | | | | |
572 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
573 *
574 */
575
576/**
577 * @defgroup snodeflags Schema nodes flags
578 * @ingroup schematree
579 * @{
580 */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200581#define LYS_CONFIG_W 0x01 /**< config true; */
582#define LYS_CONFIG_R 0x02 /**< config false; */
583#define LYS_CONFIG_MASK 0x03 /**< mask for config value */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100584#define LYS_STATUS_CURR 0x04 /**< status current; */
585#define LYS_STATUS_DEPRC 0x08 /**< status deprecated; */
586#define LYS_STATUS_OBSLT 0x10 /**< status obsolete; */
587#define LYS_STATUS_MASK 0x1C /**< mask for status value */
588#define LYS_MAND_TRUE 0x20 /**< mandatory true; applicable only to ::lysp_node_choice/::lysc_node_choice,
589 ::lysp_node_leaf/::lysc_node_leaf and ::lysp_node_anydata/::lysc_node_anydata */
590#define LYS_MAND_FALSE 0x40 /**< mandatory false; applicable only to
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200591 ::lysp_node_choice/::lysc_node_choice, ::lysp_node_leaf/::lysc_node_leaf
592 and ::lysp_node_anydata/::lysc_node_anydata */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100593#define LYS_MAND_MASK 0x60 /**< mask for mandatory values */
594#define LYS_PRESENCE 0x04 /**< flag for presence property of a container, applicable only to ::lysc_node_container */
595#define LYS_UNIQUE 0x08 /**< flag for leafs being part of a unique set, applicable only to ::lysc_node_leaf */
Radek Krejci9bb94eb2018-12-04 16:48:35 +0100596#define LYS_KEY 0x10 /**< flag for leafs being a key of a list, applicable only to ::lysc_node_leaf */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100597#define LYS_FENABLED 0x10 /**< feature enabled flag, applicable only to ::lysc_feature */
598#define LYS_ORDBY_SYSTEM 0x20 /**< ordered-by user lists, applicable only to ::lysc_node_leaflist/::lysp_node_leaflist and
599 ::lysc_node_list/::lysp_node_list */
600#define LYS_ORDBY_USER 0x40 /**< ordered-by user lists, applicable only to ::lysc_node_leaflist/::lysp_node_leaflist and
601 ::lysc_node_list/::lysp_node_list */
602#define LYS_ORDBY_MASK 0x60 /**< mask for ordered-by values */
603#define LYS_YINELEM_TRUE 0x80 /**< yin-element true for extension's argument */
604#define LYS_YINELEM_FALSE 0x100 /**< yin-element false for extension's argument */
605#define LYS_YINELEM_MASK 0x180 /**< mask for yin-element value */
606#define LYS_SET_VALUE 0x200 /**< value attribute is set */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100607#define LYS_SET_MIN 0x200 /**< min attribute is set */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200608#define LYS_SET_MAX 0x400 /**< max attribute is set */
Radek Krejcid505e3d2018-11-13 09:04:17 +0100609
610#define LYS_SET_BASE 0x0001 /**< type's flag for present base substatement */
611#define LYS_SET_BIT 0x0002 /**< type's flag for present bit substatement */
612#define LYS_SET_ENUM 0x0004 /**< type's flag for present enum substatement */
613#define LYS_SET_FRDIGITS 0x0008 /**< type's flag for present fraction-digits substatement */
614#define LYS_SET_LENGTH 0x0010 /**< type's flag for present length substatement */
615#define LYS_SET_PATH 0x0020 /**< type's flag for present path substatement */
616#define LYS_SET_PATTERN 0x0040 /**< type's flag for present pattern substatement */
617#define LYS_SET_RANGE 0x0080 /**< type's flag for present range substatement */
618#define LYS_SET_TYPE 0x0100 /**< type's flag for present type substatement */
619#define LYS_SET_REQINST 0x0200 /**< type's flag for present require-instance substatement */
Radek Krejci0e5d8382018-11-28 16:37:53 +0100620
621#define LYS_FLAGS_COMPILED_MASK 0x7f /**< mask for flags that maps to the compiled structures */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100622/** @} */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200623
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200624/**
625 * @brief Generic YANG data node
626 */
627struct lysp_node {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100628 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200629 uint16_t nodetype; /**< type of the node (mandatory) */
630 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100631 struct lysp_node *next; /**< next sibling node (NULL if there is no one) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200632 const char *name; /**< node name (mandatory) */
633 const char *dsc; /**< description statement */
634 const char *ref; /**< reference statement */
635 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200636 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200637 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200638};
639
640/**
641 * @brief Extension structure of the lysp_node for YANG container
642 */
643struct lysp_node_container {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100644 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200645 uint16_t nodetype; /**< LYS_CONTAINER */
646 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
647 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
648 const char *name; /**< node name (mandatory) */
649 const char *dsc; /**< description statement */
650 const char *ref; /**< reference statement */
651 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200652 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200653 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200654
655 /* container */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200656 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200657 const char *presence; /**< presence description */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200658 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
659 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200660 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200661 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
662 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200663};
664
665struct lysp_node_leaf {
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_LEAF */
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 /* leaf */
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 struct lysp_type type; /**< type of the leaf node (mandatory) */
680 const char *units; /**< units of the leaf's type */
681 const char *dflt; /**< default value */
682};
683
684struct lysp_node_leaflist {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100685 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200686 uint16_t nodetype; /**< LYS_LEAFLIST */
687 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
688 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
689 const char *name; /**< node name (mandatory) */
690 const char *dsc; /**< description statement */
691 const char *ref; /**< reference statement */
692 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200693 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200694 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200695
696 /* leaf-list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200697 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200698 struct lysp_type type; /**< type of the leaf node (mandatory) */
699 const char *units; /**< units of the leaf's type */
Radek Krejci151a5b72018-10-19 14:21:44 +0200700 const char **dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200701 uint32_t min; /**< min-elements constraint */
702 uint32_t max; /**< max-elements constraint, 0 means unbounded */
703};
704
705struct lysp_node_list {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100706 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200707 uint16_t nodetype; /**< LYS_LIST */
708 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
709 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
710 const char *name; /**< node name (mandatory) */
711 const char *dsc; /**< description statement */
712 const char *ref; /**< reference statement */
713 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200714 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200715 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200716
717 /* list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200718 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200719 const char *key; /**< keys specification */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200720 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
721 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200722 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200723 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
724 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200725 const char **uniques; /**< list of unique specifications ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200726 uint32_t min; /**< min-elements constraint */
727 uint32_t max; /**< max-elements constraint, 0 means unbounded */
728};
729
730struct lysp_node_choice {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100731 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200732 uint16_t nodetype; /**< LYS_CHOICE */
733 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
734 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
735 const char *name; /**< node name (mandatory) */
736 const char *dsc; /**< description statement */
737 const char *ref; /**< reference statement */
738 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200739 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200740 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200741
742 /* choice */
743 struct lysp_node *child; /**< list of data nodes (linked list) */
744 const char* dflt; /**< default case */
745};
746
747struct lysp_node_case {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100748 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200749 uint16_t nodetype; /**< LYS_CASE */
750 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
751 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
752 const char *name; /**< node name (mandatory) */
753 const char *dsc; /**< description statement */
754 const char *ref; /**< reference statement */
755 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200756 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200757 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200758
759 /* case */
760 struct lysp_node *child; /**< list of data nodes (linked list) */
761};
762
763struct lysp_node_anydata {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100764 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200765 uint16_t nodetype; /**< LYS_ANYXML || LYS_ANYDATA */
766 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
767 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
768 const char *name; /**< node name (mandatory) */
769 const char *dsc; /**< description statement */
770 const char *ref; /**< reference statement */
771 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200772 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200773 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200774
775 /* anyxml/anydata */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200776 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200777};
778
779struct lysp_node_uses {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100780 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200781 uint16_t nodetype; /**< LYS_USES */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200782 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
783 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
784 const char *name; /**< grouping name reference (mandatory) */
785 const char *dsc; /**< description statement */
786 const char *ref; /**< reference statement */
787 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200788 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200789 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200790
791 /* uses */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200792 struct lysp_refine *refines; /**< list of uses's refines ([sized array](@ref sizedarrays)) */
793 struct lysp_augment *augments; /**< list of uses's augment ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200794};
795
796/**
797 * @brief YANG input-stmt and output-stmt
798 */
799struct lysp_action_inout {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100800 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
801 uint16_t nodetype; /**< LYS_INOUT */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200802 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
803 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
804 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200805 struct lysp_node *data; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200806 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200807};
808
809/**
810 * @brief YANG rpc-stmt and action-stmt
811 */
812struct lysp_action {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100813 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
814 uint16_t nodetype; /**< LYS_ACTION */
815 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200816 const char *name; /**< grouping name reference (mandatory) */
817 const char *dsc; /**< description statement */
818 const char *ref; /**< reference statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200819 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200820 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
821 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200822 struct lysp_action_inout *input; /**< RPC's/Action's input */
823 struct lysp_action_inout *output;/**< RPC's/Action's output */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200824 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200825};
826
827/**
828 * @brief YANG notification-stmt
829 */
830struct lysp_notif {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100831 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
832 uint16_t nodetype; /**< LYS_NOTIF */
833 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values are allowed */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200834 const char *name; /**< grouping name reference (mandatory) */
835 const char *dsc; /**< description statement */
836 const char *ref; /**< reference statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200837 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200838 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
839 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
840 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200841 struct lysp_node *data; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200842 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200843};
844
845/**
Radek Krejcif0fceb62018-09-05 14:58:45 +0200846 * @brief supported YANG schema version values
847 */
848typedef enum LYS_VERSION {
849 LYS_VERSION_UNDEF = 0, /**< no specific version, YANG 1.0 as default */
850 LYS_VERSION_1_0 = 1, /**< YANG 1.0 */
851 LYS_VERSION_1_1 = 2 /**< YANG 1.1 */
852} LYS_VERSION;
853
854/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200855 * @brief Printable YANG schema tree structure representing YANG module.
856 *
857 * Simple structure corresponding to the YANG format. The schema is only syntactically validated.
858 */
859struct lysp_module {
860 struct ly_ctx *ctx; /**< libyang context of the module (mandatory) */
861 const char *name; /**< name of the module (mandatory) */
Radek Krejci6d6e4e42018-10-29 13:28:19 +0100862 const char *filepath; /**< path, if the schema was read from a file, NULL in case of reading from memory */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200863 union {
864 /* module */
Michal Vaskod5927ca2018-09-07 15:05:32 +0200865 const char *ns; /**< namespace of the module (module - mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200866 /* submodule */
Michal Vaskod5927ca2018-09-07 15:05:32 +0200867 const char *belongsto; /**< belongs to parent module (submodule - mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200868 };
Michal Vaskod5927ca2018-09-07 15:05:32 +0200869 const char *prefix; /**< module prefix or submodule belongsto prefix of main module (mandatory) */
Radek Krejcib7db73a2018-10-24 14:18:40 +0200870 struct lysp_revision *revs; /**< list of the module revisions ([sized array](@ref sizedarrays)), the first revision
871 in the list is always the last (newest) revision of the module */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200872 struct lysp_import *imports; /**< list of imported modules ([sized array](@ref sizedarrays)) */
873 struct lysp_include *includes; /**< list of included submodules ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200874 const char *org; /**< party/company responsible for the module */
875 const char *contact; /**< contact information for the module */
876 const char *dsc; /**< description of the module */
877 const char *ref; /**< cross-reference for the module */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200878 struct lysp_ext *extensions; /**< list of extension statements ([sized array](@ref sizedarrays)) */
879 struct lysp_feature *features; /**< list of feature definitions ([sized array](@ref sizedarrays)) */
880 struct lysp_ident *identities; /**< list of identities ([sized array](@ref sizedarrays)) */
881 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
882 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200883 struct lysp_node *data; /**< list of module's top-level data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200884 struct lysp_augment *augments; /**< list of augments ([sized array](@ref sizedarrays)) */
885 struct lysp_action *rpcs; /**< list of RPCs ([sized array](@ref sizedarrays)) */
886 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
887 struct lysp_deviation *deviations; /**< list of deviations ([sized array](@ref sizedarrays)) */
888 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200889
Radek Krejcif0fceb62018-09-05 14:58:45 +0200890 uint8_t submodule:1; /**< flag to distinguish main modules and submodules */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200891 uint8_t implemented:1; /**< flag if the module is implemented, not just imported */
Radek Krejci086c7132018-10-26 15:29:04 +0200892 uint8_t latest_revision:2; /**< flag to mark the latest available revision:
893 1 - the latest revision in searchdirs was not searched yet and this is the
894 latest revision in the current context
895 2 - searchdirs were searched and this is the latest available revision */
896 uint8_t parsing:1; /**< flag for circular check */
897 uint8_t version; /**< yang-version (LYS_VERSION values) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200898};
899
900/**
Radek Krejci3f5e3db2018-10-11 15:57:47 +0200901 * @brief Free the printable YANG schema tree structure.
902 *
903 * @param[in] module Printable YANG schema tree structure to free.
904 */
905void lysp_module_free(struct lysp_module *module);
906
907/**
Radek Krejcice8c1592018-10-29 15:35:51 +0100908 * @brief YANG extension instance
909 */
910struct lysc_ext_instance {
911 struct lyext_plugin *plugin; /**< pointer to the plugin implementing the extension (if present) */
912 void *parent; /**< pointer to the parent element holding the extension instance(s), use
913 ::lysc_ext_instance#parent_type to access the schema element */
914 const char *argument; /**< optional value of the extension's argument */
915 LYEXT_SUBSTMT insubstmt; /**< value identifying placement of the extension instance */
916 uint32_t insubstmt_index; /**< in case the instance is in a substatement that can appear multiple times,
917 this identifies the index of the substatement for this extension instance */
Radek Krejci2a408df2018-10-29 16:32:26 +0100918 LYEXT_PARENT parent_type; /**< type of the parent structure */
Radek Krejcice8c1592018-10-29 15:35:51 +0100919#if 0
Radek Krejcice8c1592018-10-29 15:35:51 +0100920 uint8_t ext_type; /**< extension type (#LYEXT_TYPE) */
921 uint8_t padding; /**< 32b padding */
Radek Krejcice8c1592018-10-29 15:35:51 +0100922 struct lys_module *module; /**< pointer to the extension instance's module (mandatory) */
923 LYS_NODE nodetype; /**< LYS_EXT */
924#endif
Radek Krejci2a408df2018-10-29 16:32:26 +0100925 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
926 void *priv; /**< private caller's data, not used by libyang */
Radek Krejcice8c1592018-10-29 15:35:51 +0100927};
928
929/**
Radek Krejcibd8d9ba2018-11-02 16:06:26 +0100930 * @brief Compiled YANG if-feature-stmt
931 */
932struct lysc_iffeature {
933 uint8_t *expr; /**< 2bits array describing the if-feature expression in prefix format, see @ref ifftokens */
934 struct lysc_feature **features; /**< array of pointers to the features used in expression ([sized array](@ref sizedarrays)) */
935};
936
937/**
Radek Krejci151a5b72018-10-19 14:21:44 +0200938 * @brief YANG import-stmt
939 */
940struct lysc_import {
Radek Krejci6d6e4e42018-10-29 13:28:19 +0100941 struct lys_module *module; /**< link to the imported module */
Radek Krejci151a5b72018-10-19 14:21:44 +0200942 const char *prefix; /**< prefix for the data from the imported schema (mandatory) */
Radek Krejcice8c1592018-10-29 15:35:51 +0100943 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200944};
945
946/**
Radek Krejcidd4e8d42018-10-16 14:55:43 +0200947 * @brief YANG when-stmt
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200948 */
Radek Krejcidd4e8d42018-10-16 14:55:43 +0200949struct lysc_when {
950 struct lyxp_expr *cond; /**< XPath when condition */
Radek Krejcia3045382018-11-22 14:30:31 +0100951 struct lysc_node *context; /**< context node of the expression */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200952 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcidd4e8d42018-10-16 14:55:43 +0200953};
954
955/**
Radek Krejci2a408df2018-10-29 16:32:26 +0100956 * @brief YANG identity-stmt
957 */
958struct lysc_ident {
959 const char *name; /**< identity name (mandatory), including possible prefix */
960 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
961 struct lysc_ident **derived; /**< list of (pointers to the) derived identities ([sized array](@ref sizedarrays)) */
962 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
963 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_ values are allowed */
964};
965
966/**
Radek Krejcidd4e8d42018-10-16 14:55:43 +0200967 * @brief YANG feature-stmt
968 */
969struct lysc_feature {
970 const char *name; /**< feature name (mandatory) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200971 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 +0200972 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcice8c1592018-10-29 15:35:51 +0100973 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcidd4e8d42018-10-16 14:55:43 +0200974 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* and
975 #LYS_FENABLED values allowed */
976};
977
Radek Krejci151a5b72018-10-19 14:21:44 +0200978/**
979 * @defgroup ifftokens if-feature expression tokens
980 * Tokens of if-feature expression used in ::lysc_iffeature#expr
981 *
982 * @{
983 */
984#define LYS_IFF_NOT 0x00 /**< operand "not" */
985#define LYS_IFF_AND 0x01 /**< operand "and" */
986#define LYS_IFF_OR 0x02 /**< operand "or" */
987#define LYS_IFF_F 0x03 /**< feature */
988/**
989 * @}
990 */
991
992/**
Radek Krejcib7db73a2018-10-24 14:18:40 +0200993 * @brief Compiled YANG revision statement
994 */
995struct lysc_revision {
996 char date[LY_REV_SIZE]; /**< revision-date (mandatory) */
997 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
998};
999
Radek Krejci2167ee12018-11-02 16:09:07 +01001000struct lysc_default {
1001 struct lys_module *module; /**< module where the default was defined */
1002 const char *value; /**< default value (with possible prefixes from the module where defined) */
1003};
1004
1005struct lysc_range {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001006 struct lysc_range_part {
Radek Krejci2167ee12018-11-02 16:09:07 +01001007 union { /**< min boundary TODO decimal */
1008 int64_t min_64; /**< for int8, int16, int32 and int64 */
1009 uint64_t min_u64; /**< for uint8, uint16, uint32 and uint64 */
1010 };
1011 union { /**< max boundary TODO decimal */
1012 int64_t max_64; /**< for int8, int16, int32 and int64 */
1013 uint64_t max_u64; /**< for uint8, uint16, uint32 and uint64 */
1014 };
Radek Krejci4f28eda2018-11-12 11:46:16 +01001015 } *parts; /**< compiled range expression ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001016 const char *emsg; /**< error-message */
1017 const char *eapptag; /**< error-app-tag value */
1018 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1019};
1020
1021struct lysc_pattern {
1022 pcre *expr; /**< compiled regular expression */
1023 pcre_extra *expr_extra; /**< additional information to speed up matching */
1024 const char *emsg; /**< error-message */
1025 const char *eapptag; /**< error-app-tag value */
1026 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci4586a022018-11-13 11:29:26 +01001027 uint32_t inverted:1; /**< invert-match flag */
1028 uint32_t refcount:31; /**< reference counter */
Radek Krejci2167ee12018-11-02 16:09:07 +01001029};
1030
1031struct lysc_must {
1032 struct lys_module *module; /**< module where the must was defined */
1033 struct lyxp_expr *cond; /**< XPath when condition */
1034 const char *emsg; /**< error-message */
1035 const char *eapptag; /**< error-app-tag value */
1036 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1037};
1038
1039struct lysc_type {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001040 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001041 LY_DATA_TYPE basetype; /**< Base type of the type */
1042 uint32_t refcount; /**< reference counter for type sharing */
1043};
1044
1045struct lysc_type_num {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001046 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001047 LY_DATA_TYPE basetype; /**< Base type of the type */
1048 uint32_t refcount; /**< reference counter for type sharing */
1049 struct lysc_range *range; /**< Optional range limitation */
1050};
1051
1052struct lysc_type_dec {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001053 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001054 LY_DATA_TYPE basetype; /**< Base type of the type */
1055 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci6cba4292018-11-15 17:33:29 +01001056 uint8_t fraction_digits; /**< fraction digits specification */
Radek Krejci2167ee12018-11-02 16:09:07 +01001057 struct lysc_range *range; /**< Optional range limitation */
1058};
1059
1060struct lysc_type_str {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001061 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001062 LY_DATA_TYPE basetype; /**< Base type of the type */
1063 uint32_t refcount; /**< reference counter for type sharing */
1064 struct lysc_range *length; /**< Optional length limitation */
Radek Krejci4586a022018-11-13 11:29:26 +01001065 struct lysc_pattern **patterns; /**< Optional list of pointers to pattern limitations ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001066};
1067
1068struct lysc_type_enum {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001069 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001070 LY_DATA_TYPE basetype; /**< Base type of the type */
1071 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci8b764662018-11-14 14:15:13 +01001072 struct lysc_type_enum_item {
Radek Krejci2167ee12018-11-02 16:09:07 +01001073 const char *name; /**< enumeration identifier */
1074 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejci8b764662018-11-14 14:15:13 +01001075 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001076 int32_t value; /**< integer value associated with the enumeration */
1077 } *enums; /**< enumerations list ([sized array](@ref sizedarrays)), mandatory (at least 1 item) */
1078};
1079
1080struct lysc_type_leafref {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001081 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001082 LY_DATA_TYPE basetype; /**< Base type of the type */
1083 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejcia3045382018-11-22 14:30:31 +01001084 const char* path; /**< target path */
Radek Krejci96a0bfd2018-11-22 15:25:06 +01001085 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 +01001086 struct lysc_type *realtype; /**< pointer to the real (first non-leafref in possible leafrefs chain) type. */
Radek Krejci2167ee12018-11-02 16:09:07 +01001087 uint8_t require_instance; /**< require-instance flag */
1088};
1089
1090struct lysc_type_identityref {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001091 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001092 LY_DATA_TYPE basetype; /**< Base type of the type */
1093 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci555cb5b2018-11-16 14:54:33 +01001094 struct lysc_ident **bases; /**< list of pointers to the base identities ([sized array](@ref sizedarrays)),
Radek Krejci2167ee12018-11-02 16:09:07 +01001095 mandatory (at least 1 item) */
1096};
1097
1098struct lysc_type_instanceid {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001099 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001100 LY_DATA_TYPE basetype; /**< Base type of the type */
1101 uint32_t refcount; /**< reference counter for type sharing */
1102 uint8_t require_instance; /**< require-instance flag */
1103};
1104
1105struct lysc_type_bits {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001106 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001107 LY_DATA_TYPE basetype; /**< Base type of the type */
1108 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci8b764662018-11-14 14:15:13 +01001109 struct lysc_type_bits_item {
Radek Krejci2167ee12018-11-02 16:09:07 +01001110 const char *name; /**< bit identifier */
1111 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejci8b764662018-11-14 14:15:13 +01001112 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001113 uint32_t position; /**< non-negative integer value associated with the bit */
1114 } *bits; /**< bits list ([sized array](@ref sizedarrays)), mandatory (at least 1 item) */
1115};
1116
1117struct lysc_type_union {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001118 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001119 LY_DATA_TYPE basetype; /**< Base type of the type */
1120 uint32_t refcount; /**< reference counter for type sharing */
1121 struct lysc_type **types; /**< list of types in the union ([sized array](@ref sizedarrays)), mandatory (at least 1 item) */
1122};
1123
1124struct lysc_type_bin {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001125 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001126 LY_DATA_TYPE basetype; /**< Base type of the type */
1127 uint32_t refcount; /**< reference counter for type sharing */
1128 struct lysc_range *length; /**< Optional length limitation */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001129};
1130
1131/**
Radek Krejci0af5f5d2018-09-07 15:00:30 +02001132 * @brief Compiled YANG data node
1133 */
1134struct lysc_node {
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001135 uint16_t nodetype; /**< type of the node (mandatory) */
1136 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001137 struct lys_module *module; /**< module structure */
1138 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. */
1139 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1140 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1141 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1142 never NULL. If there is no sibling node, pointer points to the node
1143 itself. In case of the first node, this pointer points to the last
1144 node in the list. */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001145 const char *name; /**< node name (mandatory) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001146 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001147};
1148
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001149struct lysc_node_container {
1150 uint16_t nodetype; /**< LYS_CONTAINER */
1151 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1152 struct lys_module *module; /**< module structure */
1153 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. */
1154 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1155 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1156 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1157 never NULL. If there is no sibling node, pointer points to the node
1158 itself. In case of the first node, this pointer points to the last
1159 node in the list. */
1160 const char *name; /**< node name (mandatory) */
1161 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1162
Radek Krejci4f28eda2018-11-12 11:46:16 +01001163 struct lysc_when *when; /**< when statement */
1164 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1165
1166 struct lysc_node *child; /**< first child node (linked list) */
1167 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1168 struct lysc_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
1169 struct lysc_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001170};
1171
Radek Krejcia3045382018-11-22 14:30:31 +01001172struct lysc_node_case {
1173 const char *name; /**< name of the case, including the implicit case */
1174 struct lysc_node *child; /**< first child node of the case (linked list). Note that all the children of all the sibling cases are linked
1175 each other as siblings with the parent pointer pointing to the choice node holding the case. To distinguish
1176 which children node belongs to which case, it is needed to match the first children of the cases while going
1177 through the children linked list. */
1178};
1179
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001180struct lysc_node_choice {
1181 uint16_t nodetype; /**< LYS_CHOICE */
1182 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1183 struct lys_module *module; /**< module structure */
1184 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. */
1185 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1186 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1187 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1188 never NULL. If there is no sibling node, pointer points to the node
1189 itself. In case of the first node, this pointer points to the last
1190 node in the list. */
1191 const char *name; /**< node name (mandatory) */
1192 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1193
Radek Krejcia3045382018-11-22 14:30:31 +01001194 struct lysc_node_case *cases; /**< list of the cases with their name and pointer to the first children of each case ([sized array](@ref sizedarrays))
1195 Note that all the children of all the cases are linked each other as siblings with the parent pointer pointing
1196 to this choice node. To distinguish which children node belongs to which case, it is needed to match the first
1197 children of the cases while going through the children linked list. */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001198};
1199
1200struct lysc_node_leaf {
1201 uint16_t nodetype; /**< LYS_LEAF */
1202 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1203 struct lys_module *module; /**< module structure */
1204 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. */
1205 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1206 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1207 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1208 never NULL. If there is no sibling node, pointer points to the node
1209 itself. In case of the first node, this pointer points to the last
1210 node in the list. */
1211 const char *name; /**< node name (mandatory) */
1212 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1213
Radek Krejci4f28eda2018-11-12 11:46:16 +01001214 struct lysc_when *when; /**< when statement */
1215 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1216
1217 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1218 struct lysc_type *type; /**< type of the leaf node (mandatory) */
Radek Krejcib57cf1e2018-11-23 14:07:05 +01001219
Radek Krejci4f28eda2018-11-12 11:46:16 +01001220 const char *units; /**< units of the leaf's type */
1221 const char *dflt; /**< default value */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001222};
1223
1224struct lysc_node_leaflist {
1225 uint16_t nodetype; /**< LYS_LEAFLIST */
1226 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1227 struct lys_module *module; /**< module structure */
1228 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. */
1229 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1230 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1231 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1232 never NULL. If there is no sibling node, pointer points to the node
1233 itself. In case of the first node, this pointer points to the last
1234 node in the list. */
1235 const char *name; /**< node name (mandatory) */
1236 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1237
Radek Krejcib57cf1e2018-11-23 14:07:05 +01001238 struct lysc_when *when; /**< when statement */
1239 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1240
1241 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1242 struct lysc_type *type; /**< type of the leaf node (mandatory) */
1243
Radek Krejci0e5d8382018-11-28 16:37:53 +01001244 const char *units; /**< units of the leaf's type */
1245 const char **dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
1246 uint32_t min; /**< min-elements constraint */
1247 uint32_t max; /**< max-elements constraint */
1248
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001249};
1250
1251struct lysc_node_list {
1252 uint16_t nodetype; /**< LYS_LIST */
1253 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1254 struct lys_module *module; /**< module structure */
1255 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. */
1256 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1257 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1258 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1259 never NULL. If there is no sibling node, pointer points to the node
1260 itself. In case of the first node, this pointer points to the last
1261 node in the list. */
1262 const char *name; /**< node name (mandatory) */
1263 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1264
Radek Krejci9bb94eb2018-12-04 16:48:35 +01001265 struct lysc_when *when; /**< when statement */
1266 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1267
1268 struct lysc_node *child; /**< first child node (linked list) */
1269 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1270 struct lysc_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
1271 struct lysc_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
1272
1273 struct lysc_node_leaf **keys; /**< list of pointers to the keys ([sized array](@ref sizedarrays)) */
1274 struct lysc_node_leaf ***uniques; /**< list of sized arrays of pointers to the unique nodes ([sized array](@ref sizedarrays)) */
1275 uint32_t min; /**< min-elements constraint */
1276 uint32_t max; /**< max-elements constraint */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001277};
1278
1279struct lysc_node_anydata {
1280 uint16_t nodetype; /**< LYS_ANYXML or LYS_ANYDATA */
1281 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1282 struct lys_module *module; /**< module structure */
1283 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. */
1284 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1285 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1286 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1287 never NULL. If there is no sibling node, pointer points to the node
1288 itself. In case of the first node, this pointer points to the last
1289 node in the list. */
1290 const char *name; /**< node name (mandatory) */
1291 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1292
1293};
1294
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001295/**
1296 * @brief Compiled YANG schema tree structure representing YANG module.
1297 *
1298 * Semantically validated YANG schema tree for data tree parsing.
1299 * Contains only the necessary information for the data validation.
1300 */
1301struct lysc_module {
1302 struct ly_ctx *ctx; /**< libyang context of the module (mandatory) */
1303 const char *name; /**< name of the module (mandatory) */
Radek Krejci6d6e4e42018-10-29 13:28:19 +01001304 const char *filepath; /**< path, if the schema was read from a file, NULL in case of reading from memory */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001305 const char *ns; /**< namespace of the module (mandatory) */
1306 const char *prefix; /**< module prefix (mandatory) */
Radek Krejcif8f882a2018-10-31 14:51:15 +01001307 const char *revision; /**< the revision of the module */
Radek Krejci151a5b72018-10-19 14:21:44 +02001308 struct lysc_import *imports; /**< list of imported modules ([sized array](@ref sizedarrays)) */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001309
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001310 struct lysc_feature *features; /**< list of feature definitions ([sized array](@ref sizedarrays)) */
Radek Krejci2a408df2018-10-29 16:32:26 +01001311 struct lysc_ident *identities; /**< list of identities ([sized array](@ref sizedarrays)) */
1312 struct lysc_node *data; /**< list of module's top-level data nodes (linked list) */
1313 struct lysc_action *rpcs; /**< list of RPCs ([sized array](@ref sizedarrays)) */
1314 struct lysc_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejcice8c1592018-10-29 15:35:51 +01001315 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001316
1317 uint8_t implemented:1; /**< flag if the module is implemented, not just imported */
Radek Krejcifaa1eac2018-10-30 14:34:55 +01001318 uint8_t latest_revision:2; /**< flag to mark the latest available revision:
1319 1 - the latest revision in searchdirs was not searched yet and this is the
1320 latest revision in the current context
1321 2 - searchdirs were searched and this is the latest available revision */
Radek Krejci086c7132018-10-26 15:29:04 +02001322 uint8_t version; /**< yang-version (LYS_VERSION values) */
Radek Krejci0af5f5d2018-09-07 15:00:30 +02001323};
1324
1325/**
Radek Krejci151a5b72018-10-19 14:21:44 +02001326 * @brief Get how the if-feature statement currently evaluates.
1327 *
1328 * @param[in] iff Compiled if-feature statement to evaluate.
1329 * @return If the statement evaluates to true, 1 is returned. 0 is returned when the statement evaluates to false.
1330 */
1331int lysc_iffeature_value(const struct lysc_iffeature *iff);
1332
1333/**
1334 * @brief Get the current status of the provided feature.
1335 *
1336 * @param[in] feature Compiled feature statement to examine.
1337 * @return
1338 * - 1 if feature is enabled,
1339 * - 0 if feature is disabled,
1340 * - -1 in case of error (invalid argument)
1341 */
1342int lysc_feature_value(const struct lysc_feature *feature);
1343
1344/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001345 * @brief Available YANG schema tree structures representing YANG module.
1346 */
1347struct lys_module {
1348 struct lysp_module *parsed; /**< Simply parsed (unresolved) YANG schema tree */
1349 struct lysc_module *compiled; /**< Compiled and fully validated YANG schema tree for data parsing */
1350};
1351
Radek Krejci151a5b72018-10-19 14:21:44 +02001352/**
1353 * @brief Enable specified feature in the module
1354 *
1355 * By default, when the module is loaded by libyang parser, all features are disabled.
1356 *
Radek Krejcica3db002018-11-01 10:31:01 +01001357 * If all features are being enabled, it must be possible respecting their if-feature conditions. For example,
1358 * enabling all features on the following feature set will fail since it is not possible to enable both features
1359 * (and it is unclear which of them should be enabled then). In this case the LY_EDENIED is returned and the feature
1360 * is untouched.
1361 *
1362 * feature f1;
1363 * feature f2 { if-feature 'not f1';}
1364 *
Radek Krejci151a5b72018-10-19 14:21:44 +02001365 * @param[in] module Module where the feature will be enabled.
1366 * @param[in] feature Name of the feature to enable. To enable all features at once, use asterisk (`*`) character.
1367 * @return LY_ERR value.
1368 */
1369LY_ERR lys_feature_enable(struct lys_module *module, const char *feature);
1370
1371/**
1372 * @brief Disable specified feature in the module
1373 *
1374 * By default, when the module is loaded by libyang parser, all features are disabled.
1375 *
1376 * @param[in] module Module where the feature will be disabled.
1377 * @param[in] feature Name of the feature to disable. To disable all features at once, use asterisk (`*`) character.
1378 * @return LY_ERR value
1379 */
1380LY_ERR lys_feature_disable(struct lys_module *module, const char *feature);
1381
1382/**
1383 * @brief Get the current status of the specified feature in the module.
1384 *
1385 * @param[in] module Module where the feature is defined.
1386 * @param[in] feature Name of the feature to inspect.
1387 * @return
1388 * - 1 if feature is enabled,
1389 * - 0 if feature is disabled,
1390 * - -1 in case of error (e.g. feature is not defined or invalid arguments)
1391 */
1392int lys_feature_value(const struct lys_module *module, const char *feature);
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001393
1394/**
Radek Krejci86d106e2018-10-18 09:53:19 +02001395 * @brief Load a schema into the specified context.
1396 *
1397 * @param[in] ctx libyang context where to process the data model.
1398 * @param[in] data The string containing the dumped data model in the specified
1399 * format.
1400 * @param[in] format Format of the input data (YANG or YIN).
1401 * @return Pointer to the data model structure or NULL on error.
1402 */
Radek Krejcid14e9692018-11-01 11:00:37 +01001403struct lys_module *lys_parse_mem(struct ly_ctx *ctx, const char *data, LYS_INFORMAT format);
Radek Krejci86d106e2018-10-18 09:53:19 +02001404
1405/**
1406 * @brief Read a schema from file descriptor into the specified context.
1407 *
1408 * \note Current implementation supports only reading data from standard (disk) file, not from sockets, pipes, etc.
1409 *
1410 * @param[in] ctx libyang context where to process the data model.
1411 * @param[in] fd File descriptor of a regular file (e.g. sockets are not supported) containing the schema
1412 * in the specified format.
1413 * @param[in] format Format of the input data (YANG or YIN).
1414 * @return Pointer to the data model structure or NULL on error.
1415 */
Radek Krejcid14e9692018-11-01 11:00:37 +01001416struct lys_module *lys_parse_fd(struct ly_ctx *ctx, int fd, LYS_INFORMAT format);
Radek Krejci86d106e2018-10-18 09:53:19 +02001417
1418/**
Radek Krejcid33273d2018-10-25 14:55:52 +02001419 * @brief Read a schema into the specified context from a file.
Radek Krejci86d106e2018-10-18 09:53:19 +02001420 *
1421 * @param[in] ctx libyang context where to process the data model.
1422 * @param[in] path Path to the file with the model in the specified format.
1423 * @param[in] format Format of the input data (YANG or YIN).
1424 * @return Pointer to the data model structure or NULL on error.
1425 */
Radek Krejcid14e9692018-11-01 11:00:37 +01001426struct lys_module *lys_parse_path(struct ly_ctx *ctx, const char *path, LYS_INFORMAT format);
Radek Krejci86d106e2018-10-18 09:53:19 +02001427
1428/**
Radek Krejcid33273d2018-10-25 14:55:52 +02001429 * @brief Search for the schema file in the specified searchpaths.
1430 *
1431 * @param[in] searchpaths NULL-terminated array of paths to be searched (recursively). Current working
1432 * directory is searched automatically (but non-recursively if not in the provided list). Caller can use
1433 * result of the ly_ctx_get_searchdirs().
1434 * @param[in] cwd Flag to implicitly search also in the current working directory (non-recursively).
1435 * @param[in] name Name of the schema to find.
1436 * @param[in] revision Revision of the schema to find. If NULL, the newest found schema filepath is returned.
1437 * @param[out] localfile Mandatory output variable containing absolute path of the found schema. If no schema
1438 * complying the provided restriction is found, NULL is set.
1439 * @param[out] format Optional output variable containing expected format of the schema document according to the
1440 * file suffix.
1441 * @return LY_ERR value (LY_SUCCESS is returned even if the file is not found, then the *localfile is NULL).
1442 */
1443LY_ERR lys_search_localfile(const char * const *searchpaths, int cwd, const char *name, const char *revision, char **localfile, LYS_INFORMAT *format);
1444
1445/**
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001446 * @defgroup scflags Schema compile flags
1447 * @ingroup schematree
1448 *
1449 * @{
1450 */
1451#define LYSC_OPT_FREE_SP 1 /**< Free the input printable schema */
Radek Krejcia3045382018-11-22 14:30:31 +01001452/** @} scflags */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001453
1454/**
1455 * @brief Compile printable schema into a validated schema linking all the references.
1456 *
Radek Krejcif8f882a2018-10-31 14:51:15 +01001457 * @param[in, out] mod Schema structure holding pointers to both schema structure types. The ::lys_module#parsed
1458 * member is used as input and ::lys_module#compiled is used to hold the result of the compilation.
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001459 * @param[in] options Various options to modify compiler behavior, see [compile flags](@ref scflags).
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001460 * @return LY_ERR value.
1461 */
Radek Krejcid14e9692018-11-01 11:00:37 +01001462LY_ERR lys_compile(struct lys_module *mod, int options);
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001463
Radek Krejcia3045382018-11-22 14:30:31 +01001464/**
1465 * @brief Get next schema tree (sibling) node element that can be instantiated in a data tree. Returned node can
1466 * be from an augment.
1467 *
1468 * lys_getnext() is supposed to be called sequentially. In the first call, the \p last parameter is usually NULL
1469 * and function starts returning i) the first \p parent's child or ii) the first top level element of the \p module.
1470 * Consequent calls suppose to provide the previously returned node as the \p last parameter and still the same
1471 * \p parent and \p module parameters.
1472 *
1473 * Without options, the function is used to traverse only the schema nodes that can be paired with corresponding
1474 * data nodes in a data tree. By setting some \p options the behavior can be modified to the extent that
1475 * all the schema nodes are iteratively returned.
1476 *
1477 * @param[in] last Previously returned schema tree node, or NULL in case of the first call.
1478 * @param[in] parent Parent of the subtree where the function starts processing.
1479 * @param[in] module In case of iterating on top level elements, the \p parent is NULL and
1480 * module must be specified.
1481 * @param[in] options [ORed options](@ref sgetnextflags).
1482 * @return Next schema tree node that can be instantiated in a data tree, NULL in case there is no such element.
1483 */
1484const struct lysc_node *lys_getnext(const struct lysc_node *last, const struct lysc_node *parent,
1485 const struct lysc_module *module, int options);
1486
1487/**
1488 * @defgroup sgetnextflags lys_getnext() flags
1489 * @ingroup schematree
1490 *
1491 * @{
1492 */
1493#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 +01001494#define LYS_GETNEXT_NOCHOICE 0x02 /**< lys_getnext() option to ignore (kind of conditional) nodes within choice node */
Radek Krejcia3045382018-11-22 14:30:31 +01001495#define LYS_GETNEXT_INTONPCONT 0x40 /**< lys_getnext() option to look into non-presence container, instead of returning container itself */
1496#define LYS_GETNEXT_NOSTATECHECK 0x100 /**< lys_getnext() option to skip checking module validity (import-only, disabled) and
1497 relevant if-feature conditions state */
1498/** @} sgetnextflags */
1499
1500/**
1501 * @brief Get child node according to the specified criteria.
1502 *
1503 * @param[in] parent Optional parent of the node to find. If not specified, the module's top-level nodes are searched.
1504 * @param[in] module module of the node to find. It is also limitation for the children node of the given parent.
1505 * @param[in] name Name of the node to find.
1506 * @param[in] name_len Optional length of the name in case it is not NULL-terminated string.
1507 * @param[in] nodetype Optional criteria (to speedup) specifying nodetype(s) of the node to find.
1508 * Used as a bitmask, so multiple nodetypes can be specified.
1509 * @param[in] options [ORed options](@ref sgetnextflags).
1510 * @return Found node if any.
1511 */
1512const struct lysc_node *lys_child(const struct lysc_node *parent, const struct lys_module *module,
1513 const char *name, size_t name_len, uint16_t nodetype, int options);
1514
1515/**
1516 * @brief Check if the schema node is disabled in the schema tree, i.e. there is any disabled if-feature statement
1517 * affecting the node.
1518 *
1519 * @param[in] node Schema node to check.
1520 * @param[in] recursive - 0 to check if-feature only in the \p node schema node,
1521 * - 1 to check if-feature in all ascendant schema nodes until there is a node possibly having an instance in a data tree
1522 * @return - NULL if enabled,
1523 * - pointer to the node with the unsatisfied (disabling) if-feature expression.
1524 */
1525const struct lysc_iffeature *lys_is_disabled(const struct lysc_node *node, int recursive);
1526
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001527/** @} */
1528
Radek Krejci70853c52018-10-15 14:46:16 +02001529#ifdef __cplusplus
1530}
1531#endif
1532
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001533#endif /* LY_TREE_SCHEMA_H_ */