blob: a6ed85e59c49d958356c5774a6bd761a7cdf93c9 [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 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Radek Krejci7adf4ff2018-12-05 08:55:00 +0100561 * 3 LYS_STATUS_CURR |x|x|x|x|x|x|x|x|x| | |x|x|x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100562 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Radek Krejci7adf4ff2018-12-05 08:55:00 +0100563 * 4 LYS_STATUS_DEPRC |x|x|x|x|x|x|x|x|x| | |x|x|x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100564 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Radek Krejci7adf4ff2018-12-05 08:55:00 +0100565 * 5 LYS_STATUS_OBSLT |x|x|x|x|x|x|x|x|x| | |x|x|x|
Radek Krejci4f28eda2018-11-12 11:46:16 +0100566 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
567 * 6 LYS_MAND_TRUE | |x|x| | |x| | | | | | | | |
Radek Krejci0e5d8382018-11-28 16:37:53 +0100568 * LYS_ORDBY_SYSTEM | | | |x|x| | | | | | | | | |
Radek Krejci4f28eda2018-11-12 11:46:16 +0100569 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
570 * 7 LYS_ORDBY_USER | | | |x|x| | | | | | | | | |
Radek Krejci7adf4ff2018-12-05 08:55:00 +0100571 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
572 * 8 LYS_PRESENCE |x| | | | | | | | | | | | | |
573 * LYS_UNIQUE | | |x| | | | | | | | | | | |
574 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
575 * 9 LYS_KEY | | |x| | | | | | | | | | | |
576 * LYS_FENABLED | | | | | | | | | | | |x| | |
Radek Krejci76b3e962018-12-14 17:01:25 +0100577 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+
578 * 10 LYS_SET_DFLT | | |x| | | |x| | | | | | | |
Radek Krejci4f28eda2018-11-12 11:46:16 +0100579 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
580 *
581 */
582
583/**
584 * @defgroup snodeflags Schema nodes flags
585 * @ingroup schematree
586 * @{
587 */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200588#define LYS_CONFIG_W 0x01 /**< config true; */
589#define LYS_CONFIG_R 0x02 /**< config false; */
590#define LYS_CONFIG_MASK 0x03 /**< mask for config value */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100591#define LYS_STATUS_CURR 0x04 /**< status current; */
592#define LYS_STATUS_DEPRC 0x08 /**< status deprecated; */
593#define LYS_STATUS_OBSLT 0x10 /**< status obsolete; */
594#define LYS_STATUS_MASK 0x1C /**< mask for status value */
595#define LYS_MAND_TRUE 0x20 /**< mandatory true; applicable only to ::lysp_node_choice/::lysc_node_choice,
596 ::lysp_node_leaf/::lysc_node_leaf and ::lysp_node_anydata/::lysc_node_anydata */
597#define LYS_MAND_FALSE 0x40 /**< mandatory false; applicable only to
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200598 ::lysp_node_choice/::lysc_node_choice, ::lysp_node_leaf/::lysc_node_leaf
599 and ::lysp_node_anydata/::lysc_node_anydata */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100600#define LYS_MAND_MASK 0x60 /**< mask for mandatory values */
Radek Krejci7adf4ff2018-12-05 08:55:00 +0100601#define LYS_PRESENCE 0x80 /**< flag for presence property of a container, applicable only to ::lysc_node_container */
602#define LYS_UNIQUE 0x80 /**< flag for leafs being part of a unique set, applicable only to ::lysc_node_leaf */
603#define LYS_KEY 0x100 /**< flag for leafs being a key of a list, applicable only to ::lysc_node_leaf */
604#define LYS_FENABLED 0x100 /**< feature enabled flag, applicable only to ::lysc_feature */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100605#define LYS_ORDBY_SYSTEM 0x20 /**< ordered-by user lists, applicable only to ::lysc_node_leaflist/::lysp_node_leaflist and
606 ::lysc_node_list/::lysp_node_list */
607#define LYS_ORDBY_USER 0x40 /**< ordered-by user lists, applicable only to ::lysc_node_leaflist/::lysp_node_leaflist and
608 ::lysc_node_list/::lysp_node_list */
609#define LYS_ORDBY_MASK 0x60 /**< mask for ordered-by values */
610#define LYS_YINELEM_TRUE 0x80 /**< yin-element true for extension's argument */
611#define LYS_YINELEM_FALSE 0x100 /**< yin-element false for extension's argument */
612#define LYS_YINELEM_MASK 0x180 /**< mask for yin-element value */
613#define LYS_SET_VALUE 0x200 /**< value attribute is set */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100614#define LYS_SET_MIN 0x200 /**< min attribute is set */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200615#define LYS_SET_MAX 0x400 /**< max attribute is set */
Radek Krejcid505e3d2018-11-13 09:04:17 +0100616
617#define LYS_SET_BASE 0x0001 /**< type's flag for present base substatement */
618#define LYS_SET_BIT 0x0002 /**< type's flag for present bit substatement */
619#define LYS_SET_ENUM 0x0004 /**< type's flag for present enum substatement */
620#define LYS_SET_FRDIGITS 0x0008 /**< type's flag for present fraction-digits substatement */
621#define LYS_SET_LENGTH 0x0010 /**< type's flag for present length substatement */
622#define LYS_SET_PATH 0x0020 /**< type's flag for present path substatement */
623#define LYS_SET_PATTERN 0x0040 /**< type's flag for present pattern substatement */
624#define LYS_SET_RANGE 0x0080 /**< type's flag for present range substatement */
625#define LYS_SET_TYPE 0x0100 /**< type's flag for present type substatement */
626#define LYS_SET_REQINST 0x0200 /**< type's flag for present require-instance substatement */
Radek Krejci76b3e962018-12-14 17:01:25 +0100627#define LYS_SET_DFLT 0x0200 /**< flag to mark leaf with own default value, not a default value taken from its type, and default
628 cases of choice. This information is important for refines, since it is prohibited to make leafs
629 with default statement mandatory. In case the default leaf value is taken from type, it is thrown
630 away when it is refined to be mandatory node. */
Radek Krejci0e5d8382018-11-28 16:37:53 +0100631
632#define LYS_FLAGS_COMPILED_MASK 0x7f /**< mask for flags that maps to the compiled structures */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100633/** @} */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200634
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200635/**
636 * @brief Generic YANG data node
637 */
638struct lysp_node {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100639 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200640 uint16_t nodetype; /**< type of the node (mandatory) */
641 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100642 struct lysp_node *next; /**< next sibling node (NULL if there is no one) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200643 const char *name; /**< node name (mandatory) */
644 const char *dsc; /**< description statement */
645 const char *ref; /**< reference statement */
646 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200647 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200648 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200649};
650
651/**
652 * @brief Extension structure of the lysp_node for YANG container
653 */
654struct lysp_node_container {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100655 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200656 uint16_t nodetype; /**< LYS_CONTAINER */
657 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
658 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
659 const char *name; /**< node name (mandatory) */
660 const char *dsc; /**< description statement */
661 const char *ref; /**< reference statement */
662 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200663 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200664 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200665
666 /* container */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200667 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200668 const char *presence; /**< presence description */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200669 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
670 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200671 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200672 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
673 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200674};
675
676struct lysp_node_leaf {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100677 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200678 uint16_t nodetype; /**< LYS_LEAF */
679 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
680 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
681 const char *name; /**< node name (mandatory) */
682 const char *dsc; /**< description statement */
683 const char *ref; /**< reference statement */
684 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200685 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200686 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200687
688 /* leaf */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200689 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200690 struct lysp_type type; /**< type of the leaf node (mandatory) */
691 const char *units; /**< units of the leaf's type */
692 const char *dflt; /**< default value */
693};
694
695struct lysp_node_leaflist {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100696 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200697 uint16_t nodetype; /**< LYS_LEAFLIST */
698 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
699 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
700 const char *name; /**< node name (mandatory) */
701 const char *dsc; /**< description statement */
702 const char *ref; /**< reference statement */
703 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200704 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200705 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200706
707 /* leaf-list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200708 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200709 struct lysp_type type; /**< type of the leaf node (mandatory) */
710 const char *units; /**< units of the leaf's type */
Radek Krejci151a5b72018-10-19 14:21:44 +0200711 const char **dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200712 uint32_t min; /**< min-elements constraint */
713 uint32_t max; /**< max-elements constraint, 0 means unbounded */
714};
715
716struct lysp_node_list {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100717 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200718 uint16_t nodetype; /**< LYS_LIST */
719 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
720 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
721 const char *name; /**< node name (mandatory) */
722 const char *dsc; /**< description statement */
723 const char *ref; /**< reference statement */
724 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200725 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200726 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200727
728 /* list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200729 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200730 const char *key; /**< keys specification */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200731 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
732 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200733 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200734 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
735 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200736 const char **uniques; /**< list of unique specifications ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200737 uint32_t min; /**< min-elements constraint */
738 uint32_t max; /**< max-elements constraint, 0 means unbounded */
739};
740
741struct lysp_node_choice {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100742 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200743 uint16_t nodetype; /**< LYS_CHOICE */
744 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
745 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
746 const char *name; /**< node name (mandatory) */
747 const char *dsc; /**< description statement */
748 const char *ref; /**< reference statement */
749 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200750 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200751 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200752
753 /* choice */
754 struct lysp_node *child; /**< list of data nodes (linked list) */
755 const char* dflt; /**< default case */
756};
757
758struct lysp_node_case {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100759 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200760 uint16_t nodetype; /**< LYS_CASE */
761 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
762 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
763 const char *name; /**< node name (mandatory) */
764 const char *dsc; /**< description statement */
765 const char *ref; /**< reference statement */
766 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200767 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200768 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200769
770 /* case */
771 struct lysp_node *child; /**< list of data nodes (linked list) */
772};
773
774struct lysp_node_anydata {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100775 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200776 uint16_t nodetype; /**< LYS_ANYXML || LYS_ANYDATA */
777 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
778 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
779 const char *name; /**< node name (mandatory) */
780 const char *dsc; /**< description statement */
781 const char *ref; /**< reference statement */
782 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200783 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200784 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200785
786 /* anyxml/anydata */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200787 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200788};
789
790struct lysp_node_uses {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100791 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200792 uint16_t nodetype; /**< LYS_USES */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200793 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
794 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
795 const char *name; /**< grouping name reference (mandatory) */
796 const char *dsc; /**< description statement */
797 const char *ref; /**< reference statement */
798 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200799 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200800 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200801
802 /* uses */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200803 struct lysp_refine *refines; /**< list of uses's refines ([sized array](@ref sizedarrays)) */
804 struct lysp_augment *augments; /**< list of uses's augment ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200805};
806
807/**
808 * @brief YANG input-stmt and output-stmt
809 */
810struct lysp_action_inout {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100811 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
812 uint16_t nodetype; /**< LYS_INOUT */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200813 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
814 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
815 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200816 struct lysp_node *data; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200817 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200818};
819
820/**
821 * @brief YANG rpc-stmt and action-stmt
822 */
823struct lysp_action {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100824 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
825 uint16_t nodetype; /**< LYS_ACTION */
826 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200827 const char *name; /**< grouping name reference (mandatory) */
828 const char *dsc; /**< description statement */
829 const char *ref; /**< reference statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200830 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200831 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
832 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200833 struct lysp_action_inout *input; /**< RPC's/Action's input */
834 struct lysp_action_inout *output;/**< RPC's/Action's output */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200835 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200836};
837
838/**
839 * @brief YANG notification-stmt
840 */
841struct lysp_notif {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100842 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
843 uint16_t nodetype; /**< LYS_NOTIF */
844 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values are allowed */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200845 const char *name; /**< grouping name reference (mandatory) */
846 const char *dsc; /**< description statement */
847 const char *ref; /**< reference statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200848 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200849 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
850 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
851 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200852 struct lysp_node *data; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200853 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200854};
855
856/**
Radek Krejcif0fceb62018-09-05 14:58:45 +0200857 * @brief supported YANG schema version values
858 */
859typedef enum LYS_VERSION {
860 LYS_VERSION_UNDEF = 0, /**< no specific version, YANG 1.0 as default */
861 LYS_VERSION_1_0 = 1, /**< YANG 1.0 */
862 LYS_VERSION_1_1 = 2 /**< YANG 1.1 */
863} LYS_VERSION;
864
865/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200866 * @brief Printable YANG schema tree structure representing YANG module.
867 *
868 * Simple structure corresponding to the YANG format. The schema is only syntactically validated.
869 */
870struct lysp_module {
871 struct ly_ctx *ctx; /**< libyang context of the module (mandatory) */
872 const char *name; /**< name of the module (mandatory) */
Radek Krejci6d6e4e42018-10-29 13:28:19 +0100873 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 +0200874 union {
875 /* module */
Michal Vaskod5927ca2018-09-07 15:05:32 +0200876 const char *ns; /**< namespace of the module (module - mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200877 /* submodule */
Michal Vaskod5927ca2018-09-07 15:05:32 +0200878 const char *belongsto; /**< belongs to parent module (submodule - mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200879 };
Michal Vaskod5927ca2018-09-07 15:05:32 +0200880 const char *prefix; /**< module prefix or submodule belongsto prefix of main module (mandatory) */
Radek Krejcib7db73a2018-10-24 14:18:40 +0200881 struct lysp_revision *revs; /**< list of the module revisions ([sized array](@ref sizedarrays)), the first revision
882 in the list is always the last (newest) revision of the module */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200883 struct lysp_import *imports; /**< list of imported modules ([sized array](@ref sizedarrays)) */
884 struct lysp_include *includes; /**< list of included submodules ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200885 const char *org; /**< party/company responsible for the module */
886 const char *contact; /**< contact information for the module */
887 const char *dsc; /**< description of the module */
888 const char *ref; /**< cross-reference for the module */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200889 struct lysp_ext *extensions; /**< list of extension statements ([sized array](@ref sizedarrays)) */
890 struct lysp_feature *features; /**< list of feature definitions ([sized array](@ref sizedarrays)) */
891 struct lysp_ident *identities; /**< list of identities ([sized array](@ref sizedarrays)) */
892 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
893 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200894 struct lysp_node *data; /**< list of module's top-level data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200895 struct lysp_augment *augments; /**< list of augments ([sized array](@ref sizedarrays)) */
896 struct lysp_action *rpcs; /**< list of RPCs ([sized array](@ref sizedarrays)) */
897 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
898 struct lysp_deviation *deviations; /**< list of deviations ([sized array](@ref sizedarrays)) */
899 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200900
Radek Krejcif0fceb62018-09-05 14:58:45 +0200901 uint8_t submodule:1; /**< flag to distinguish main modules and submodules */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200902 uint8_t implemented:1; /**< flag if the module is implemented, not just imported */
Radek Krejci086c7132018-10-26 15:29:04 +0200903 uint8_t latest_revision:2; /**< flag to mark the latest available revision:
904 1 - the latest revision in searchdirs was not searched yet and this is the
905 latest revision in the current context
906 2 - searchdirs were searched and this is the latest available revision */
907 uint8_t parsing:1; /**< flag for circular check */
908 uint8_t version; /**< yang-version (LYS_VERSION values) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200909};
910
911/**
Radek Krejci3f5e3db2018-10-11 15:57:47 +0200912 * @brief Free the printable YANG schema tree structure.
913 *
914 * @param[in] module Printable YANG schema tree structure to free.
915 */
916void lysp_module_free(struct lysp_module *module);
917
918/**
Radek Krejcice8c1592018-10-29 15:35:51 +0100919 * @brief YANG extension instance
920 */
921struct lysc_ext_instance {
922 struct lyext_plugin *plugin; /**< pointer to the plugin implementing the extension (if present) */
923 void *parent; /**< pointer to the parent element holding the extension instance(s), use
924 ::lysc_ext_instance#parent_type to access the schema element */
925 const char *argument; /**< optional value of the extension's argument */
926 LYEXT_SUBSTMT insubstmt; /**< value identifying placement of the extension instance */
927 uint32_t insubstmt_index; /**< in case the instance is in a substatement that can appear multiple times,
928 this identifies the index of the substatement for this extension instance */
Radek Krejci2a408df2018-10-29 16:32:26 +0100929 LYEXT_PARENT parent_type; /**< type of the parent structure */
Radek Krejcice8c1592018-10-29 15:35:51 +0100930#if 0
Radek Krejcice8c1592018-10-29 15:35:51 +0100931 uint8_t ext_type; /**< extension type (#LYEXT_TYPE) */
932 uint8_t padding; /**< 32b padding */
Radek Krejcice8c1592018-10-29 15:35:51 +0100933 struct lys_module *module; /**< pointer to the extension instance's module (mandatory) */
934 LYS_NODE nodetype; /**< LYS_EXT */
935#endif
Radek Krejci2a408df2018-10-29 16:32:26 +0100936 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
937 void *priv; /**< private caller's data, not used by libyang */
Radek Krejcice8c1592018-10-29 15:35:51 +0100938};
939
940/**
Radek Krejcibd8d9ba2018-11-02 16:06:26 +0100941 * @brief Compiled YANG if-feature-stmt
942 */
943struct lysc_iffeature {
944 uint8_t *expr; /**< 2bits array describing the if-feature expression in prefix format, see @ref ifftokens */
945 struct lysc_feature **features; /**< array of pointers to the features used in expression ([sized array](@ref sizedarrays)) */
946};
947
948/**
Radek Krejci151a5b72018-10-19 14:21:44 +0200949 * @brief YANG import-stmt
950 */
951struct lysc_import {
Radek Krejci6d6e4e42018-10-29 13:28:19 +0100952 struct lys_module *module; /**< link to the imported module */
Radek Krejci151a5b72018-10-19 14:21:44 +0200953 const char *prefix; /**< prefix for the data from the imported schema (mandatory) */
Radek Krejcice8c1592018-10-29 15:35:51 +0100954 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200955};
956
957/**
Radek Krejcidd4e8d42018-10-16 14:55:43 +0200958 * @brief YANG when-stmt
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200959 */
Radek Krejcidd4e8d42018-10-16 14:55:43 +0200960struct lysc_when {
961 struct lyxp_expr *cond; /**< XPath when condition */
Radek Krejcia3045382018-11-22 14:30:31 +0100962 struct lysc_node *context; /**< context node of the expression */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200963 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcidd4e8d42018-10-16 14:55:43 +0200964};
965
966/**
Radek Krejci2a408df2018-10-29 16:32:26 +0100967 * @brief YANG identity-stmt
968 */
969struct lysc_ident {
970 const char *name; /**< identity name (mandatory), including possible prefix */
971 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
972 struct lysc_ident **derived; /**< list of (pointers to the) derived identities ([sized array](@ref sizedarrays)) */
973 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
974 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_ values are allowed */
975};
976
977/**
Radek Krejcidd4e8d42018-10-16 14:55:43 +0200978 * @brief YANG feature-stmt
979 */
980struct lysc_feature {
981 const char *name; /**< feature name (mandatory) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200982 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 +0200983 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcice8c1592018-10-29 15:35:51 +0100984 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcidd4e8d42018-10-16 14:55:43 +0200985 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* and
986 #LYS_FENABLED values allowed */
987};
988
Radek Krejci151a5b72018-10-19 14:21:44 +0200989/**
990 * @defgroup ifftokens if-feature expression tokens
991 * Tokens of if-feature expression used in ::lysc_iffeature#expr
992 *
993 * @{
994 */
995#define LYS_IFF_NOT 0x00 /**< operand "not" */
996#define LYS_IFF_AND 0x01 /**< operand "and" */
997#define LYS_IFF_OR 0x02 /**< operand "or" */
998#define LYS_IFF_F 0x03 /**< feature */
999/**
1000 * @}
1001 */
1002
1003/**
Radek Krejcib7db73a2018-10-24 14:18:40 +02001004 * @brief Compiled YANG revision statement
1005 */
1006struct lysc_revision {
1007 char date[LY_REV_SIZE]; /**< revision-date (mandatory) */
1008 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1009};
1010
Radek Krejci2167ee12018-11-02 16:09:07 +01001011struct lysc_default {
1012 struct lys_module *module; /**< module where the default was defined */
1013 const char *value; /**< default value (with possible prefixes from the module where defined) */
1014};
1015
1016struct lysc_range {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001017 struct lysc_range_part {
Radek Krejci2167ee12018-11-02 16:09:07 +01001018 union { /**< min boundary TODO decimal */
1019 int64_t min_64; /**< for int8, int16, int32 and int64 */
1020 uint64_t min_u64; /**< for uint8, uint16, uint32 and uint64 */
1021 };
1022 union { /**< max boundary TODO decimal */
1023 int64_t max_64; /**< for int8, int16, int32 and int64 */
1024 uint64_t max_u64; /**< for uint8, uint16, uint32 and uint64 */
1025 };
Radek Krejci4f28eda2018-11-12 11:46:16 +01001026 } *parts; /**< compiled range expression ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001027 const char *emsg; /**< error-message */
1028 const char *eapptag; /**< error-app-tag value */
1029 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1030};
1031
1032struct lysc_pattern {
1033 pcre *expr; /**< compiled regular expression */
1034 pcre_extra *expr_extra; /**< additional information to speed up matching */
1035 const char *emsg; /**< error-message */
1036 const char *eapptag; /**< error-app-tag value */
1037 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci4586a022018-11-13 11:29:26 +01001038 uint32_t inverted:1; /**< invert-match flag */
1039 uint32_t refcount:31; /**< reference counter */
Radek Krejci2167ee12018-11-02 16:09:07 +01001040};
1041
1042struct lysc_must {
1043 struct lys_module *module; /**< module where the must was defined */
1044 struct lyxp_expr *cond; /**< XPath when condition */
1045 const char *emsg; /**< error-message */
1046 const char *eapptag; /**< error-app-tag value */
1047 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1048};
1049
1050struct lysc_type {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001051 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001052 LY_DATA_TYPE basetype; /**< Base type of the type */
1053 uint32_t refcount; /**< reference counter for type sharing */
1054};
1055
1056struct lysc_type_num {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001057 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001058 LY_DATA_TYPE basetype; /**< Base type of the type */
1059 uint32_t refcount; /**< reference counter for type sharing */
1060 struct lysc_range *range; /**< Optional range limitation */
1061};
1062
1063struct lysc_type_dec {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001064 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001065 LY_DATA_TYPE basetype; /**< Base type of the type */
1066 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci6cba4292018-11-15 17:33:29 +01001067 uint8_t fraction_digits; /**< fraction digits specification */
Radek Krejci2167ee12018-11-02 16:09:07 +01001068 struct lysc_range *range; /**< Optional range limitation */
1069};
1070
1071struct lysc_type_str {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001072 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001073 LY_DATA_TYPE basetype; /**< Base type of the type */
1074 uint32_t refcount; /**< reference counter for type sharing */
1075 struct lysc_range *length; /**< Optional length limitation */
Radek Krejci4586a022018-11-13 11:29:26 +01001076 struct lysc_pattern **patterns; /**< Optional list of pointers to pattern limitations ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001077};
1078
1079struct lysc_type_enum {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001080 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001081 LY_DATA_TYPE basetype; /**< Base type of the type */
1082 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci8b764662018-11-14 14:15:13 +01001083 struct lysc_type_enum_item {
Radek Krejci2167ee12018-11-02 16:09:07 +01001084 const char *name; /**< enumeration identifier */
1085 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejci8b764662018-11-14 14:15:13 +01001086 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001087 int32_t value; /**< integer value associated with the enumeration */
1088 } *enums; /**< enumerations list ([sized array](@ref sizedarrays)), mandatory (at least 1 item) */
1089};
1090
1091struct lysc_type_leafref {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001092 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001093 LY_DATA_TYPE basetype; /**< Base type of the type */
1094 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejcia3045382018-11-22 14:30:31 +01001095 const char* path; /**< target path */
Radek Krejci96a0bfd2018-11-22 15:25:06 +01001096 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 +01001097 struct lysc_type *realtype; /**< pointer to the real (first non-leafref in possible leafrefs chain) type. */
Radek Krejci2167ee12018-11-02 16:09:07 +01001098 uint8_t require_instance; /**< require-instance flag */
1099};
1100
1101struct lysc_type_identityref {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001102 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001103 LY_DATA_TYPE basetype; /**< Base type of the type */
1104 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci555cb5b2018-11-16 14:54:33 +01001105 struct lysc_ident **bases; /**< list of pointers to the base identities ([sized array](@ref sizedarrays)),
Radek Krejci2167ee12018-11-02 16:09:07 +01001106 mandatory (at least 1 item) */
1107};
1108
1109struct lysc_type_instanceid {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001110 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001111 LY_DATA_TYPE basetype; /**< Base type of the type */
1112 uint32_t refcount; /**< reference counter for type sharing */
1113 uint8_t require_instance; /**< require-instance flag */
1114};
1115
1116struct lysc_type_bits {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001117 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001118 LY_DATA_TYPE basetype; /**< Base type of the type */
1119 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci8b764662018-11-14 14:15:13 +01001120 struct lysc_type_bits_item {
Radek Krejci2167ee12018-11-02 16:09:07 +01001121 const char *name; /**< bit identifier */
1122 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejci8b764662018-11-14 14:15:13 +01001123 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001124 uint32_t position; /**< non-negative integer value associated with the bit */
1125 } *bits; /**< bits list ([sized array](@ref sizedarrays)), mandatory (at least 1 item) */
1126};
1127
1128struct lysc_type_union {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001129 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001130 LY_DATA_TYPE basetype; /**< Base type of the type */
1131 uint32_t refcount; /**< reference counter for type sharing */
1132 struct lysc_type **types; /**< list of types in the union ([sized array](@ref sizedarrays)), mandatory (at least 1 item) */
1133};
1134
1135struct lysc_type_bin {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001136 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001137 LY_DATA_TYPE basetype; /**< Base type of the type */
1138 uint32_t refcount; /**< reference counter for type sharing */
1139 struct lysc_range *length; /**< Optional length limitation */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001140};
1141
Radek Krejci056d0a82018-12-06 16:57:25 +01001142struct lysc_action {
1143 uint16_t nodetype; /**< LYS_ACTION */
1144 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1145 const char *name; /**< action/RPC name (mandatory) */
1146 /* TODO */
1147};
1148
1149struct lysc_notif {
1150 uint16_t nodetype; /**< LYS_NOTIF */
1151 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1152 const char *name; /**< Notification name (mandatory) */
1153 /* TODO */
1154};
1155
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001156/**
Radek Krejci0af5f5d2018-09-07 15:00:30 +02001157 * @brief Compiled YANG data node
1158 */
1159struct lysc_node {
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001160 uint16_t nodetype; /**< type of the node (mandatory) */
1161 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001162 struct lys_module *module; /**< module structure */
1163 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. */
1164 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1165 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1166 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1167 never NULL. If there is no sibling node, pointer points to the node
1168 itself. In case of the first node, this pointer points to the last
1169 node in the list. */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001170 const char *name; /**< node name (mandatory) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001171 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci056d0a82018-12-06 16:57:25 +01001172 struct lysc_when *when; /**< when statement */
1173 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001174};
1175
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001176struct lysc_node_container {
1177 uint16_t nodetype; /**< LYS_CONTAINER */
1178 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1179 struct lys_module *module; /**< module structure */
1180 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. */
1181 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1182 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1183 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1184 never NULL. If there is no sibling node, pointer points to the node
1185 itself. In case of the first node, this pointer points to the last
1186 node in the list. */
1187 const char *name; /**< node name (mandatory) */
1188 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001189 struct lysc_when *when; /**< when statement */
1190 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1191
1192 struct lysc_node *child; /**< first child node (linked list) */
1193 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1194 struct lysc_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
1195 struct lysc_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001196};
1197
Radek Krejcia3045382018-11-22 14:30:31 +01001198struct lysc_node_case {
Radek Krejci056d0a82018-12-06 16:57:25 +01001199 uint16_t nodetype; /**< LYS_CASE */
1200 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1201 struct lys_module *module; /**< module structure */
1202 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. */
1203 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1204 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1205 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1206 never NULL. If there is no sibling node, pointer points to the node
1207 itself. In case of the first node, this pointer points to the last
1208 node in the list. */
Radek Krejcia3045382018-11-22 14:30:31 +01001209 const char *name; /**< name of the case, including the implicit case */
Radek Krejci056d0a82018-12-06 16:57:25 +01001210 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1211 struct lysc_when *when; /**< when statement */
1212 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1213
Radek Krejcia3045382018-11-22 14:30:31 +01001214 struct lysc_node *child; /**< first child node of the case (linked list). Note that all the children of all the sibling cases are linked
1215 each other as siblings with the parent pointer pointing to the choice node holding the case. To distinguish
1216 which children node belongs to which case, it is needed to match the first children of the cases while going
1217 through the children linked list. */
1218};
1219
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001220struct lysc_node_choice {
1221 uint16_t nodetype; /**< LYS_CHOICE */
1222 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1223 struct lys_module *module; /**< module structure */
1224 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. */
1225 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1226 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1227 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1228 never NULL. If there is no sibling node, pointer points to the node
1229 itself. In case of the first node, this pointer points to the last
1230 node in the list. */
1231 const char *name; /**< node name (mandatory) */
1232 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci056d0a82018-12-06 16:57:25 +01001233 struct lysc_when *when; /**< when statement */
1234 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001235
Radek Krejcia9026eb2018-12-12 16:04:47 +01001236 struct lysc_node_case *cases; /**< list of the cases (linked list). Note that all the children of all the cases are linked each other
1237 as siblings. Their parent pointers points to the specific case they belongs to, so distinguish the
1238 case is simple. */
Radek Krejci056d0a82018-12-06 16:57:25 +01001239 struct lysc_node_case *dflt; /**< default case of the choice, only a pointer into the cases array. */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001240};
1241
1242struct lysc_node_leaf {
1243 uint16_t nodetype; /**< LYS_LEAF */
1244 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1245 struct lys_module *module; /**< module structure */
1246 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. */
1247 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1248 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1249 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1250 never NULL. If there is no sibling node, pointer points to the node
1251 itself. In case of the first node, this pointer points to the last
1252 node in the list. */
1253 const char *name; /**< node name (mandatory) */
1254 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001255 struct lysc_when *when; /**< when statement */
1256 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1257
1258 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1259 struct lysc_type *type; /**< type of the leaf node (mandatory) */
Radek Krejcib57cf1e2018-11-23 14:07:05 +01001260
Radek Krejci4f28eda2018-11-12 11:46:16 +01001261 const char *units; /**< units of the leaf's type */
1262 const char *dflt; /**< default value */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001263};
1264
1265struct lysc_node_leaflist {
1266 uint16_t nodetype; /**< LYS_LEAFLIST */
1267 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1268 struct lys_module *module; /**< module structure */
1269 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. */
1270 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1271 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1272 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1273 never NULL. If there is no sibling node, pointer points to the node
1274 itself. In case of the first node, this pointer points to the last
1275 node in the list. */
1276 const char *name; /**< node name (mandatory) */
1277 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcib57cf1e2018-11-23 14:07:05 +01001278 struct lysc_when *when; /**< when statement */
1279 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1280
1281 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1282 struct lysc_type *type; /**< type of the leaf node (mandatory) */
1283
Radek Krejci0e5d8382018-11-28 16:37:53 +01001284 const char *units; /**< units of the leaf's type */
1285 const char **dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
1286 uint32_t min; /**< min-elements constraint */
1287 uint32_t max; /**< max-elements constraint */
1288
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001289};
1290
1291struct lysc_node_list {
1292 uint16_t nodetype; /**< LYS_LIST */
1293 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1294 struct lys_module *module; /**< module structure */
1295 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. */
1296 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1297 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1298 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1299 never NULL. If there is no sibling node, pointer points to the node
1300 itself. In case of the first node, this pointer points to the last
1301 node in the list. */
1302 const char *name; /**< node name (mandatory) */
1303 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci9bb94eb2018-12-04 16:48:35 +01001304 struct lysc_when *when; /**< when statement */
1305 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1306
1307 struct lysc_node *child; /**< first child node (linked list) */
1308 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1309 struct lysc_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
1310 struct lysc_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
1311
1312 struct lysc_node_leaf **keys; /**< list of pointers to the keys ([sized array](@ref sizedarrays)) */
1313 struct lysc_node_leaf ***uniques; /**< list of sized arrays of pointers to the unique nodes ([sized array](@ref sizedarrays)) */
1314 uint32_t min; /**< min-elements constraint */
1315 uint32_t max; /**< max-elements constraint */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001316};
1317
1318struct lysc_node_anydata {
1319 uint16_t nodetype; /**< LYS_ANYXML or LYS_ANYDATA */
1320 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1321 struct lys_module *module; /**< module structure */
1322 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. */
1323 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1324 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1325 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1326 never NULL. If there is no sibling node, pointer points to the node
1327 itself. In case of the first node, this pointer points to the last
1328 node in the list. */
1329 const char *name; /**< node name (mandatory) */
1330 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci056d0a82018-12-06 16:57:25 +01001331 struct lysc_when *when; /**< when statement */
1332 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejci9800fb82018-12-13 14:26:23 +01001333
1334 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001335};
1336
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001337/**
1338 * @brief Compiled YANG schema tree structure representing YANG module.
1339 *
1340 * Semantically validated YANG schema tree for data tree parsing.
1341 * Contains only the necessary information for the data validation.
1342 */
1343struct lysc_module {
1344 struct ly_ctx *ctx; /**< libyang context of the module (mandatory) */
1345 const char *name; /**< name of the module (mandatory) */
Radek Krejci6d6e4e42018-10-29 13:28:19 +01001346 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 +02001347 const char *ns; /**< namespace of the module (mandatory) */
1348 const char *prefix; /**< module prefix (mandatory) */
Radek Krejcif8f882a2018-10-31 14:51:15 +01001349 const char *revision; /**< the revision of the module */
Radek Krejci151a5b72018-10-19 14:21:44 +02001350 struct lysc_import *imports; /**< list of imported modules ([sized array](@ref sizedarrays)) */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001351
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001352 struct lysc_feature *features; /**< list of feature definitions ([sized array](@ref sizedarrays)) */
Radek Krejci2a408df2018-10-29 16:32:26 +01001353 struct lysc_ident *identities; /**< list of identities ([sized array](@ref sizedarrays)) */
1354 struct lysc_node *data; /**< list of module's top-level data nodes (linked list) */
1355 struct lysc_action *rpcs; /**< list of RPCs ([sized array](@ref sizedarrays)) */
1356 struct lysc_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejcice8c1592018-10-29 15:35:51 +01001357 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001358
1359 uint8_t implemented:1; /**< flag if the module is implemented, not just imported */
Radek Krejcifaa1eac2018-10-30 14:34:55 +01001360 uint8_t latest_revision:2; /**< flag to mark the latest available revision:
1361 1 - the latest revision in searchdirs was not searched yet and this is the
1362 latest revision in the current context
1363 2 - searchdirs were searched and this is the latest available revision */
Radek Krejci086c7132018-10-26 15:29:04 +02001364 uint8_t version; /**< yang-version (LYS_VERSION values) */
Radek Krejci0af5f5d2018-09-07 15:00:30 +02001365};
1366
1367/**
Radek Krejci53ea6152018-12-13 15:21:15 +01001368 * @brief Get the groupings sized array of the given (parsed) schema node.
1369 * Decides the node's type and in case it has a groupings array, returns it.
1370 * @param[in] node Node to examine.
1371 * @return The node's groupings sized array if any, NULL otherwise.
1372 */
1373const struct lysp_grp *lysp_node_groupings(const struct lysp_node *node);
1374
1375/**
Radek Krejci056d0a82018-12-06 16:57:25 +01001376 * @brief Get the typedefs sized array of the given (parsed) schema node.
1377 * Decides the node's type and in case it has a typedefs array, returns it.
1378 * @param[in] node Node to examine.
1379 * @return The node's typedefs sized array if any, NULL otherwise.
1380 */
1381const struct lysp_tpdf *lysp_node_typedefs(const struct lysp_node *node);
1382
1383/**
1384 * @brief Get the actions/RPCs sized array of the given (parsed) schema node.
1385 * Decides the node's type and in case it has a actions/RPCs array, returns it.
1386 * @param[in] node Node to examine.
1387 * @return The node's actions/RPCs sized array if any, NULL otherwise.
1388 */
1389const struct lysp_action *lysp_node_actions(const struct lysp_node *node);
1390
1391/**
1392 * @brief Get the Notifications sized array of the given (parsed) schema node.
1393 * Decides the node's type and in case it has a Notifications array, returns it.
1394 * @param[in] node Node to examine.
1395 * @return The node's Notifications sized array if any, NULL otherwise.
1396 */
1397const struct lysp_notif *lysp_node_notifs(const struct lysp_node *node);
1398
1399/**
1400 * @brief Get the children linked list of the given (parsed) schema node.
1401 * Decides the node's type and in case it has a children list, returns it.
1402 * @param[in] node Node to examine.
1403 * @return The node's children linked list if any, NULL otherwise.
1404 */
1405const struct lysp_node *lysp_node_children(const struct lysp_node *node);
1406
1407/**
1408 * @brief Get the actions/RPCs sized array of the given (compiled) schema node.
1409 * Decides the node's type and in case it has a actions/RPCs array, returns it.
1410 * @param[in] node Node to examine.
1411 * @return The node's actions/RPCs sized array if any, NULL otherwise.
1412 */
1413const struct lysc_action *lysc_node_actions(const struct lysc_node *node);
1414
1415/**
1416 * @brief Get the Notifications sized array of the given (compiled) schema node.
1417 * Decides the node's type and in case it has a Notifications array, returns it.
1418 * @param[in] node Node to examine.
1419 * @return The node's Notifications sized array if any, NULL otherwise.
1420 */
1421const struct lysc_notif *lysc_node_notifs(const struct lysc_node *node);
1422
1423/**
1424 * @brief Get the children linked list of the given (compiled) schema node.
1425 * Decides the node's type and in case it has a children list, returns it.
1426 * @param[in] node Node to examine.
1427 * @return The node's children linked list if any, NULL otherwise.
1428 */
1429const struct lysc_node *lysc_node_children(const struct lysc_node *node);
1430
1431/**
Radek Krejci151a5b72018-10-19 14:21:44 +02001432 * @brief Get how the if-feature statement currently evaluates.
1433 *
1434 * @param[in] iff Compiled if-feature statement to evaluate.
1435 * @return If the statement evaluates to true, 1 is returned. 0 is returned when the statement evaluates to false.
1436 */
1437int lysc_iffeature_value(const struct lysc_iffeature *iff);
1438
1439/**
1440 * @brief Get the current status of the provided feature.
1441 *
1442 * @param[in] feature Compiled feature statement to examine.
1443 * @return
1444 * - 1 if feature is enabled,
1445 * - 0 if feature is disabled,
1446 * - -1 in case of error (invalid argument)
1447 */
1448int lysc_feature_value(const struct lysc_feature *feature);
1449
1450/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001451 * @brief Available YANG schema tree structures representing YANG module.
1452 */
1453struct lys_module {
1454 struct lysp_module *parsed; /**< Simply parsed (unresolved) YANG schema tree */
1455 struct lysc_module *compiled; /**< Compiled and fully validated YANG schema tree for data parsing */
1456};
1457
Radek Krejci151a5b72018-10-19 14:21:44 +02001458/**
1459 * @brief Enable specified feature in the module
1460 *
1461 * By default, when the module is loaded by libyang parser, all features are disabled.
1462 *
Radek Krejcica3db002018-11-01 10:31:01 +01001463 * If all features are being enabled, it must be possible respecting their if-feature conditions. For example,
1464 * enabling all features on the following feature set will fail since it is not possible to enable both features
1465 * (and it is unclear which of them should be enabled then). In this case the LY_EDENIED is returned and the feature
1466 * is untouched.
1467 *
1468 * feature f1;
1469 * feature f2 { if-feature 'not f1';}
1470 *
Radek Krejci151a5b72018-10-19 14:21:44 +02001471 * @param[in] module Module where the feature will be enabled.
1472 * @param[in] feature Name of the feature to enable. To enable all features at once, use asterisk (`*`) character.
1473 * @return LY_ERR value.
1474 */
1475LY_ERR lys_feature_enable(struct lys_module *module, const char *feature);
1476
1477/**
1478 * @brief Disable specified feature in the module
1479 *
1480 * By default, when the module is loaded by libyang parser, all features are disabled.
1481 *
1482 * @param[in] module Module where the feature will be disabled.
1483 * @param[in] feature Name of the feature to disable. To disable all features at once, use asterisk (`*`) character.
1484 * @return LY_ERR value
1485 */
1486LY_ERR lys_feature_disable(struct lys_module *module, const char *feature);
1487
1488/**
1489 * @brief Get the current status of the specified feature in the module.
1490 *
1491 * @param[in] module Module where the feature is defined.
1492 * @param[in] feature Name of the feature to inspect.
1493 * @return
1494 * - 1 if feature is enabled,
1495 * - 0 if feature is disabled,
1496 * - -1 in case of error (e.g. feature is not defined or invalid arguments)
1497 */
1498int lys_feature_value(const struct lys_module *module, const char *feature);
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001499
1500/**
Radek Krejci86d106e2018-10-18 09:53:19 +02001501 * @brief Load a schema into the specified context.
1502 *
1503 * @param[in] ctx libyang context where to process the data model.
1504 * @param[in] data The string containing the dumped data model in the specified
1505 * format.
1506 * @param[in] format Format of the input data (YANG or YIN).
1507 * @return Pointer to the data model structure or NULL on error.
1508 */
Radek Krejcid14e9692018-11-01 11:00:37 +01001509struct lys_module *lys_parse_mem(struct ly_ctx *ctx, const char *data, LYS_INFORMAT format);
Radek Krejci86d106e2018-10-18 09:53:19 +02001510
1511/**
1512 * @brief Read a schema from file descriptor into the specified context.
1513 *
1514 * \note Current implementation supports only reading data from standard (disk) file, not from sockets, pipes, etc.
1515 *
1516 * @param[in] ctx libyang context where to process the data model.
1517 * @param[in] fd File descriptor of a regular file (e.g. sockets are not supported) containing the schema
1518 * in the specified format.
1519 * @param[in] format Format of the input data (YANG or YIN).
1520 * @return Pointer to the data model structure or NULL on error.
1521 */
Radek Krejcid14e9692018-11-01 11:00:37 +01001522struct lys_module *lys_parse_fd(struct ly_ctx *ctx, int fd, LYS_INFORMAT format);
Radek Krejci86d106e2018-10-18 09:53:19 +02001523
1524/**
Radek Krejcid33273d2018-10-25 14:55:52 +02001525 * @brief Read a schema into the specified context from a file.
Radek Krejci86d106e2018-10-18 09:53:19 +02001526 *
1527 * @param[in] ctx libyang context where to process the data model.
1528 * @param[in] path Path to the file with the model in the specified format.
1529 * @param[in] format Format of the input data (YANG or YIN).
1530 * @return Pointer to the data model structure or NULL on error.
1531 */
Radek Krejcid14e9692018-11-01 11:00:37 +01001532struct lys_module *lys_parse_path(struct ly_ctx *ctx, const char *path, LYS_INFORMAT format);
Radek Krejci86d106e2018-10-18 09:53:19 +02001533
1534/**
Radek Krejcid33273d2018-10-25 14:55:52 +02001535 * @brief Search for the schema file in the specified searchpaths.
1536 *
1537 * @param[in] searchpaths NULL-terminated array of paths to be searched (recursively). Current working
1538 * directory is searched automatically (but non-recursively if not in the provided list). Caller can use
1539 * result of the ly_ctx_get_searchdirs().
1540 * @param[in] cwd Flag to implicitly search also in the current working directory (non-recursively).
1541 * @param[in] name Name of the schema to find.
1542 * @param[in] revision Revision of the schema to find. If NULL, the newest found schema filepath is returned.
1543 * @param[out] localfile Mandatory output variable containing absolute path of the found schema. If no schema
1544 * complying the provided restriction is found, NULL is set.
1545 * @param[out] format Optional output variable containing expected format of the schema document according to the
1546 * file suffix.
1547 * @return LY_ERR value (LY_SUCCESS is returned even if the file is not found, then the *localfile is NULL).
1548 */
1549LY_ERR lys_search_localfile(const char * const *searchpaths, int cwd, const char *name, const char *revision, char **localfile, LYS_INFORMAT *format);
1550
1551/**
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001552 * @defgroup scflags Schema compile flags
1553 * @ingroup schematree
1554 *
1555 * @{
1556 */
1557#define LYSC_OPT_FREE_SP 1 /**< Free the input printable schema */
Radek Krejcia3045382018-11-22 14:30:31 +01001558/** @} scflags */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001559
1560/**
1561 * @brief Compile printable schema into a validated schema linking all the references.
1562 *
Radek Krejcif8f882a2018-10-31 14:51:15 +01001563 * @param[in, out] mod Schema structure holding pointers to both schema structure types. The ::lys_module#parsed
1564 * 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 +02001565 * @param[in] options Various options to modify compiler behavior, see [compile flags](@ref scflags).
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001566 * @return LY_ERR value.
1567 */
Radek Krejcid14e9692018-11-01 11:00:37 +01001568LY_ERR lys_compile(struct lys_module *mod, int options);
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001569
Radek Krejcia3045382018-11-22 14:30:31 +01001570/**
1571 * @brief Get next schema tree (sibling) node element that can be instantiated in a data tree. Returned node can
1572 * be from an augment.
1573 *
1574 * lys_getnext() is supposed to be called sequentially. In the first call, the \p last parameter is usually NULL
1575 * and function starts returning i) the first \p parent's child or ii) the first top level element of the \p module.
1576 * Consequent calls suppose to provide the previously returned node as the \p last parameter and still the same
1577 * \p parent and \p module parameters.
1578 *
1579 * Without options, the function is used to traverse only the schema nodes that can be paired with corresponding
1580 * data nodes in a data tree. By setting some \p options the behavior can be modified to the extent that
1581 * all the schema nodes are iteratively returned.
1582 *
1583 * @param[in] last Previously returned schema tree node, or NULL in case of the first call.
1584 * @param[in] parent Parent of the subtree where the function starts processing.
1585 * @param[in] module In case of iterating on top level elements, the \p parent is NULL and
1586 * module must be specified.
1587 * @param[in] options [ORed options](@ref sgetnextflags).
1588 * @return Next schema tree node that can be instantiated in a data tree, NULL in case there is no such element.
1589 */
1590const struct lysc_node *lys_getnext(const struct lysc_node *last, const struct lysc_node *parent,
1591 const struct lysc_module *module, int options);
1592
1593/**
1594 * @defgroup sgetnextflags lys_getnext() flags
1595 * @ingroup schematree
1596 *
1597 * @{
1598 */
1599#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 +01001600#define LYS_GETNEXT_NOCHOICE 0x02 /**< lys_getnext() option to ignore (kind of conditional) nodes within choice node */
Radek Krejci056d0a82018-12-06 16:57:25 +01001601#define LYS_GETNEXT_WITHCASE 0x04 /**< lys_getnext() option to allow returning #LYS_CASE nodes instead of looking into them */
Radek Krejcia3045382018-11-22 14:30:31 +01001602#define LYS_GETNEXT_INTONPCONT 0x40 /**< lys_getnext() option to look into non-presence container, instead of returning container itself */
1603#define LYS_GETNEXT_NOSTATECHECK 0x100 /**< lys_getnext() option to skip checking module validity (import-only, disabled) and
1604 relevant if-feature conditions state */
1605/** @} sgetnextflags */
1606
1607/**
1608 * @brief Get child node according to the specified criteria.
1609 *
1610 * @param[in] parent Optional parent of the node to find. If not specified, the module's top-level nodes are searched.
1611 * @param[in] module module of the node to find. It is also limitation for the children node of the given parent.
1612 * @param[in] name Name of the node to find.
1613 * @param[in] name_len Optional length of the name in case it is not NULL-terminated string.
1614 * @param[in] nodetype Optional criteria (to speedup) specifying nodetype(s) of the node to find.
1615 * Used as a bitmask, so multiple nodetypes can be specified.
1616 * @param[in] options [ORed options](@ref sgetnextflags).
1617 * @return Found node if any.
1618 */
1619const struct lysc_node *lys_child(const struct lysc_node *parent, const struct lys_module *module,
1620 const char *name, size_t name_len, uint16_t nodetype, int options);
1621
1622/**
1623 * @brief Check if the schema node is disabled in the schema tree, i.e. there is any disabled if-feature statement
1624 * affecting the node.
1625 *
1626 * @param[in] node Schema node to check.
1627 * @param[in] recursive - 0 to check if-feature only in the \p node schema node,
1628 * - 1 to check if-feature in all ascendant schema nodes until there is a node possibly having an instance in a data tree
1629 * @return - NULL if enabled,
1630 * - pointer to the node with the unsatisfied (disabling) if-feature expression.
1631 */
1632const struct lysc_iffeature *lys_is_disabled(const struct lysc_node *node, int recursive);
1633
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001634/** @} */
1635
Radek Krejci70853c52018-10-15 14:46:16 +02001636#ifdef __cplusplus
1637}
1638#endif
1639
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001640#endif /* LY_TREE_SCHEMA_H_ */