blob: b5f54108ced0300b5411e02afe7a7bb75af0d3f3 [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 Krejci4f28eda2018-11-12 11:46:16 +0100577 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
578 *
579 */
580
581/**
582 * @defgroup snodeflags Schema nodes flags
583 * @ingroup schematree
584 * @{
585 */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200586#define LYS_CONFIG_W 0x01 /**< config true; */
587#define LYS_CONFIG_R 0x02 /**< config false; */
588#define LYS_CONFIG_MASK 0x03 /**< mask for config value */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100589#define LYS_STATUS_CURR 0x04 /**< status current; */
590#define LYS_STATUS_DEPRC 0x08 /**< status deprecated; */
591#define LYS_STATUS_OBSLT 0x10 /**< status obsolete; */
592#define LYS_STATUS_MASK 0x1C /**< mask for status value */
593#define LYS_MAND_TRUE 0x20 /**< mandatory true; applicable only to ::lysp_node_choice/::lysc_node_choice,
594 ::lysp_node_leaf/::lysc_node_leaf and ::lysp_node_anydata/::lysc_node_anydata */
595#define LYS_MAND_FALSE 0x40 /**< mandatory false; applicable only to
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200596 ::lysp_node_choice/::lysc_node_choice, ::lysp_node_leaf/::lysc_node_leaf
597 and ::lysp_node_anydata/::lysc_node_anydata */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100598#define LYS_MAND_MASK 0x60 /**< mask for mandatory values */
Radek Krejci7adf4ff2018-12-05 08:55:00 +0100599#define LYS_PRESENCE 0x80 /**< flag for presence property of a container, applicable only to ::lysc_node_container */
600#define LYS_UNIQUE 0x80 /**< flag for leafs being part of a unique set, applicable only to ::lysc_node_leaf */
601#define LYS_KEY 0x100 /**< flag for leafs being a key of a list, applicable only to ::lysc_node_leaf */
602#define LYS_FENABLED 0x100 /**< feature enabled flag, applicable only to ::lysc_feature */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100603#define LYS_ORDBY_SYSTEM 0x20 /**< ordered-by user lists, applicable only to ::lysc_node_leaflist/::lysp_node_leaflist and
604 ::lysc_node_list/::lysp_node_list */
605#define LYS_ORDBY_USER 0x40 /**< ordered-by user lists, applicable only to ::lysc_node_leaflist/::lysp_node_leaflist and
606 ::lysc_node_list/::lysp_node_list */
607#define LYS_ORDBY_MASK 0x60 /**< mask for ordered-by values */
608#define LYS_YINELEM_TRUE 0x80 /**< yin-element true for extension's argument */
609#define LYS_YINELEM_FALSE 0x100 /**< yin-element false for extension's argument */
610#define LYS_YINELEM_MASK 0x180 /**< mask for yin-element value */
611#define LYS_SET_VALUE 0x200 /**< value attribute is set */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100612#define LYS_SET_MIN 0x200 /**< min attribute is set */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200613#define LYS_SET_MAX 0x400 /**< max attribute is set */
Radek Krejcid505e3d2018-11-13 09:04:17 +0100614
615#define LYS_SET_BASE 0x0001 /**< type's flag for present base substatement */
616#define LYS_SET_BIT 0x0002 /**< type's flag for present bit substatement */
617#define LYS_SET_ENUM 0x0004 /**< type's flag for present enum substatement */
618#define LYS_SET_FRDIGITS 0x0008 /**< type's flag for present fraction-digits substatement */
619#define LYS_SET_LENGTH 0x0010 /**< type's flag for present length substatement */
620#define LYS_SET_PATH 0x0020 /**< type's flag for present path substatement */
621#define LYS_SET_PATTERN 0x0040 /**< type's flag for present pattern substatement */
622#define LYS_SET_RANGE 0x0080 /**< type's flag for present range substatement */
623#define LYS_SET_TYPE 0x0100 /**< type's flag for present type substatement */
624#define LYS_SET_REQINST 0x0200 /**< type's flag for present require-instance substatement */
Radek Krejci0e5d8382018-11-28 16:37:53 +0100625
626#define LYS_FLAGS_COMPILED_MASK 0x7f /**< mask for flags that maps to the compiled structures */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100627/** @} */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200628
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200629/**
630 * @brief Generic YANG data node
631 */
632struct lysp_node {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100633 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200634 uint16_t nodetype; /**< type of the node (mandatory) */
635 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100636 struct lysp_node *next; /**< next sibling node (NULL if there is no one) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200637 const char *name; /**< node name (mandatory) */
638 const char *dsc; /**< description statement */
639 const char *ref; /**< reference statement */
640 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200641 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200642 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200643};
644
645/**
646 * @brief Extension structure of the lysp_node for YANG container
647 */
648struct lysp_node_container {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100649 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200650 uint16_t nodetype; /**< LYS_CONTAINER */
651 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
652 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
653 const char *name; /**< node name (mandatory) */
654 const char *dsc; /**< description statement */
655 const char *ref; /**< reference statement */
656 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200657 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200658 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200659
660 /* container */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200661 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200662 const char *presence; /**< presence description */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200663 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
664 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200665 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200666 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
667 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200668};
669
670struct lysp_node_leaf {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100671 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200672 uint16_t nodetype; /**< LYS_LEAF */
673 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
674 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
675 const char *name; /**< node name (mandatory) */
676 const char *dsc; /**< description statement */
677 const char *ref; /**< reference statement */
678 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200679 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200680 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200681
682 /* leaf */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200683 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200684 struct lysp_type type; /**< type of the leaf node (mandatory) */
685 const char *units; /**< units of the leaf's type */
686 const char *dflt; /**< default value */
687};
688
689struct lysp_node_leaflist {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100690 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200691 uint16_t nodetype; /**< LYS_LEAFLIST */
692 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
693 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
694 const char *name; /**< node name (mandatory) */
695 const char *dsc; /**< description statement */
696 const char *ref; /**< reference statement */
697 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200698 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200699 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200700
701 /* leaf-list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200702 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200703 struct lysp_type type; /**< type of the leaf node (mandatory) */
704 const char *units; /**< units of the leaf's type */
Radek Krejci151a5b72018-10-19 14:21:44 +0200705 const char **dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200706 uint32_t min; /**< min-elements constraint */
707 uint32_t max; /**< max-elements constraint, 0 means unbounded */
708};
709
710struct lysp_node_list {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100711 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200712 uint16_t nodetype; /**< LYS_LIST */
713 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
714 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
715 const char *name; /**< node name (mandatory) */
716 const char *dsc; /**< description statement */
717 const char *ref; /**< reference statement */
718 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200719 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200720 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200721
722 /* list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200723 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200724 const char *key; /**< keys specification */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200725 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
726 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200727 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200728 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
729 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200730 const char **uniques; /**< list of unique specifications ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200731 uint32_t min; /**< min-elements constraint */
732 uint32_t max; /**< max-elements constraint, 0 means unbounded */
733};
734
735struct lysp_node_choice {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100736 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200737 uint16_t nodetype; /**< LYS_CHOICE */
738 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
739 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
740 const char *name; /**< node name (mandatory) */
741 const char *dsc; /**< description statement */
742 const char *ref; /**< reference statement */
743 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200744 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200745 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200746
747 /* choice */
748 struct lysp_node *child; /**< list of data nodes (linked list) */
749 const char* dflt; /**< default case */
750};
751
752struct lysp_node_case {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100753 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200754 uint16_t nodetype; /**< LYS_CASE */
755 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
756 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
757 const char *name; /**< node name (mandatory) */
758 const char *dsc; /**< description statement */
759 const char *ref; /**< reference statement */
760 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200761 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200762 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200763
764 /* case */
765 struct lysp_node *child; /**< list of data nodes (linked list) */
766};
767
768struct lysp_node_anydata {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100769 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200770 uint16_t nodetype; /**< LYS_ANYXML || LYS_ANYDATA */
771 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
772 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
773 const char *name; /**< node name (mandatory) */
774 const char *dsc; /**< description statement */
775 const char *ref; /**< reference statement */
776 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200777 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200778 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200779
780 /* anyxml/anydata */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200781 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200782};
783
784struct lysp_node_uses {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100785 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200786 uint16_t nodetype; /**< LYS_USES */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200787 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
788 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
789 const char *name; /**< grouping name reference (mandatory) */
790 const char *dsc; /**< description statement */
791 const char *ref; /**< reference statement */
792 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200793 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200794 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200795
796 /* uses */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200797 struct lysp_refine *refines; /**< list of uses's refines ([sized array](@ref sizedarrays)) */
798 struct lysp_augment *augments; /**< list of uses's augment ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200799};
800
801/**
802 * @brief YANG input-stmt and output-stmt
803 */
804struct lysp_action_inout {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100805 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
806 uint16_t nodetype; /**< LYS_INOUT */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200807 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
808 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
809 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200810 struct lysp_node *data; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200811 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200812};
813
814/**
815 * @brief YANG rpc-stmt and action-stmt
816 */
817struct lysp_action {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100818 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
819 uint16_t nodetype; /**< LYS_ACTION */
820 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200821 const char *name; /**< grouping name reference (mandatory) */
822 const char *dsc; /**< description statement */
823 const char *ref; /**< reference statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200824 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200825 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
826 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200827 struct lysp_action_inout *input; /**< RPC's/Action's input */
828 struct lysp_action_inout *output;/**< RPC's/Action's output */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200829 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200830};
831
832/**
833 * @brief YANG notification-stmt
834 */
835struct lysp_notif {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100836 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
837 uint16_t nodetype; /**< LYS_NOTIF */
838 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values are allowed */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200839 const char *name; /**< grouping name reference (mandatory) */
840 const char *dsc; /**< description statement */
841 const char *ref; /**< reference statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200842 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200843 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
844 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
845 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200846 struct lysp_node *data; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200847 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200848};
849
850/**
Radek Krejcif0fceb62018-09-05 14:58:45 +0200851 * @brief supported YANG schema version values
852 */
853typedef enum LYS_VERSION {
854 LYS_VERSION_UNDEF = 0, /**< no specific version, YANG 1.0 as default */
855 LYS_VERSION_1_0 = 1, /**< YANG 1.0 */
856 LYS_VERSION_1_1 = 2 /**< YANG 1.1 */
857} LYS_VERSION;
858
859/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200860 * @brief Printable YANG schema tree structure representing YANG module.
861 *
862 * Simple structure corresponding to the YANG format. The schema is only syntactically validated.
863 */
864struct lysp_module {
865 struct ly_ctx *ctx; /**< libyang context of the module (mandatory) */
866 const char *name; /**< name of the module (mandatory) */
Radek Krejci6d6e4e42018-10-29 13:28:19 +0100867 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 +0200868 union {
869 /* module */
Michal Vaskod5927ca2018-09-07 15:05:32 +0200870 const char *ns; /**< namespace of the module (module - mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200871 /* submodule */
Michal Vaskod5927ca2018-09-07 15:05:32 +0200872 const char *belongsto; /**< belongs to parent module (submodule - mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200873 };
Michal Vaskod5927ca2018-09-07 15:05:32 +0200874 const char *prefix; /**< module prefix or submodule belongsto prefix of main module (mandatory) */
Radek Krejcib7db73a2018-10-24 14:18:40 +0200875 struct lysp_revision *revs; /**< list of the module revisions ([sized array](@ref sizedarrays)), the first revision
876 in the list is always the last (newest) revision of the module */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200877 struct lysp_import *imports; /**< list of imported modules ([sized array](@ref sizedarrays)) */
878 struct lysp_include *includes; /**< list of included submodules ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200879 const char *org; /**< party/company responsible for the module */
880 const char *contact; /**< contact information for the module */
881 const char *dsc; /**< description of the module */
882 const char *ref; /**< cross-reference for the module */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200883 struct lysp_ext *extensions; /**< list of extension statements ([sized array](@ref sizedarrays)) */
884 struct lysp_feature *features; /**< list of feature definitions ([sized array](@ref sizedarrays)) */
885 struct lysp_ident *identities; /**< list of identities ([sized array](@ref sizedarrays)) */
886 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
887 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200888 struct lysp_node *data; /**< list of module's top-level data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200889 struct lysp_augment *augments; /**< list of augments ([sized array](@ref sizedarrays)) */
890 struct lysp_action *rpcs; /**< list of RPCs ([sized array](@ref sizedarrays)) */
891 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
892 struct lysp_deviation *deviations; /**< list of deviations ([sized array](@ref sizedarrays)) */
893 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200894
Radek Krejcif0fceb62018-09-05 14:58:45 +0200895 uint8_t submodule:1; /**< flag to distinguish main modules and submodules */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200896 uint8_t implemented:1; /**< flag if the module is implemented, not just imported */
Radek Krejci086c7132018-10-26 15:29:04 +0200897 uint8_t latest_revision:2; /**< flag to mark the latest available revision:
898 1 - the latest revision in searchdirs was not searched yet and this is the
899 latest revision in the current context
900 2 - searchdirs were searched and this is the latest available revision */
901 uint8_t parsing:1; /**< flag for circular check */
902 uint8_t version; /**< yang-version (LYS_VERSION values) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200903};
904
905/**
Radek Krejci3f5e3db2018-10-11 15:57:47 +0200906 * @brief Free the printable YANG schema tree structure.
907 *
908 * @param[in] module Printable YANG schema tree structure to free.
909 */
910void lysp_module_free(struct lysp_module *module);
911
912/**
Radek Krejcice8c1592018-10-29 15:35:51 +0100913 * @brief YANG extension instance
914 */
915struct lysc_ext_instance {
916 struct lyext_plugin *plugin; /**< pointer to the plugin implementing the extension (if present) */
917 void *parent; /**< pointer to the parent element holding the extension instance(s), use
918 ::lysc_ext_instance#parent_type to access the schema element */
919 const char *argument; /**< optional value of the extension's argument */
920 LYEXT_SUBSTMT insubstmt; /**< value identifying placement of the extension instance */
921 uint32_t insubstmt_index; /**< in case the instance is in a substatement that can appear multiple times,
922 this identifies the index of the substatement for this extension instance */
Radek Krejci2a408df2018-10-29 16:32:26 +0100923 LYEXT_PARENT parent_type; /**< type of the parent structure */
Radek Krejcice8c1592018-10-29 15:35:51 +0100924#if 0
Radek Krejcice8c1592018-10-29 15:35:51 +0100925 uint8_t ext_type; /**< extension type (#LYEXT_TYPE) */
926 uint8_t padding; /**< 32b padding */
Radek Krejcice8c1592018-10-29 15:35:51 +0100927 struct lys_module *module; /**< pointer to the extension instance's module (mandatory) */
928 LYS_NODE nodetype; /**< LYS_EXT */
929#endif
Radek Krejci2a408df2018-10-29 16:32:26 +0100930 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
931 void *priv; /**< private caller's data, not used by libyang */
Radek Krejcice8c1592018-10-29 15:35:51 +0100932};
933
934/**
Radek Krejcibd8d9ba2018-11-02 16:06:26 +0100935 * @brief Compiled YANG if-feature-stmt
936 */
937struct lysc_iffeature {
938 uint8_t *expr; /**< 2bits array describing the if-feature expression in prefix format, see @ref ifftokens */
939 struct lysc_feature **features; /**< array of pointers to the features used in expression ([sized array](@ref sizedarrays)) */
940};
941
942/**
Radek Krejci151a5b72018-10-19 14:21:44 +0200943 * @brief YANG import-stmt
944 */
945struct lysc_import {
Radek Krejci6d6e4e42018-10-29 13:28:19 +0100946 struct lys_module *module; /**< link to the imported module */
Radek Krejci151a5b72018-10-19 14:21:44 +0200947 const char *prefix; /**< prefix for the data from the imported schema (mandatory) */
Radek Krejcice8c1592018-10-29 15:35:51 +0100948 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200949};
950
951/**
Radek Krejcidd4e8d42018-10-16 14:55:43 +0200952 * @brief YANG when-stmt
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200953 */
Radek Krejcidd4e8d42018-10-16 14:55:43 +0200954struct lysc_when {
955 struct lyxp_expr *cond; /**< XPath when condition */
Radek Krejcia3045382018-11-22 14:30:31 +0100956 struct lysc_node *context; /**< context node of the expression */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200957 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcidd4e8d42018-10-16 14:55:43 +0200958};
959
960/**
Radek Krejci2a408df2018-10-29 16:32:26 +0100961 * @brief YANG identity-stmt
962 */
963struct lysc_ident {
964 const char *name; /**< identity name (mandatory), including possible prefix */
965 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
966 struct lysc_ident **derived; /**< list of (pointers to the) derived identities ([sized array](@ref sizedarrays)) */
967 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
968 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_ values are allowed */
969};
970
971/**
Radek Krejcidd4e8d42018-10-16 14:55:43 +0200972 * @brief YANG feature-stmt
973 */
974struct lysc_feature {
975 const char *name; /**< feature name (mandatory) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200976 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 +0200977 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcice8c1592018-10-29 15:35:51 +0100978 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcidd4e8d42018-10-16 14:55:43 +0200979 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* and
980 #LYS_FENABLED values allowed */
981};
982
Radek Krejci151a5b72018-10-19 14:21:44 +0200983/**
984 * @defgroup ifftokens if-feature expression tokens
985 * Tokens of if-feature expression used in ::lysc_iffeature#expr
986 *
987 * @{
988 */
989#define LYS_IFF_NOT 0x00 /**< operand "not" */
990#define LYS_IFF_AND 0x01 /**< operand "and" */
991#define LYS_IFF_OR 0x02 /**< operand "or" */
992#define LYS_IFF_F 0x03 /**< feature */
993/**
994 * @}
995 */
996
997/**
Radek Krejcib7db73a2018-10-24 14:18:40 +0200998 * @brief Compiled YANG revision statement
999 */
1000struct lysc_revision {
1001 char date[LY_REV_SIZE]; /**< revision-date (mandatory) */
1002 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1003};
1004
Radek Krejci2167ee12018-11-02 16:09:07 +01001005struct lysc_default {
1006 struct lys_module *module; /**< module where the default was defined */
1007 const char *value; /**< default value (with possible prefixes from the module where defined) */
1008};
1009
1010struct lysc_range {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001011 struct lysc_range_part {
Radek Krejci2167ee12018-11-02 16:09:07 +01001012 union { /**< min boundary TODO decimal */
1013 int64_t min_64; /**< for int8, int16, int32 and int64 */
1014 uint64_t min_u64; /**< for uint8, uint16, uint32 and uint64 */
1015 };
1016 union { /**< max boundary TODO decimal */
1017 int64_t max_64; /**< for int8, int16, int32 and int64 */
1018 uint64_t max_u64; /**< for uint8, uint16, uint32 and uint64 */
1019 };
Radek Krejci4f28eda2018-11-12 11:46:16 +01001020 } *parts; /**< compiled range expression ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001021 const char *emsg; /**< error-message */
1022 const char *eapptag; /**< error-app-tag value */
1023 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1024};
1025
1026struct lysc_pattern {
1027 pcre *expr; /**< compiled regular expression */
1028 pcre_extra *expr_extra; /**< additional information to speed up matching */
1029 const char *emsg; /**< error-message */
1030 const char *eapptag; /**< error-app-tag value */
1031 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci4586a022018-11-13 11:29:26 +01001032 uint32_t inverted:1; /**< invert-match flag */
1033 uint32_t refcount:31; /**< reference counter */
Radek Krejci2167ee12018-11-02 16:09:07 +01001034};
1035
1036struct lysc_must {
1037 struct lys_module *module; /**< module where the must was defined */
1038 struct lyxp_expr *cond; /**< XPath when condition */
1039 const char *emsg; /**< error-message */
1040 const char *eapptag; /**< error-app-tag value */
1041 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1042};
1043
1044struct lysc_type {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001045 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001046 LY_DATA_TYPE basetype; /**< Base type of the type */
1047 uint32_t refcount; /**< reference counter for type sharing */
1048};
1049
1050struct lysc_type_num {
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 struct lysc_range *range; /**< Optional range limitation */
1055};
1056
1057struct lysc_type_dec {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001058 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001059 LY_DATA_TYPE basetype; /**< Base type of the type */
1060 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci6cba4292018-11-15 17:33:29 +01001061 uint8_t fraction_digits; /**< fraction digits specification */
Radek Krejci2167ee12018-11-02 16:09:07 +01001062 struct lysc_range *range; /**< Optional range limitation */
1063};
1064
1065struct lysc_type_str {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001066 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001067 LY_DATA_TYPE basetype; /**< Base type of the type */
1068 uint32_t refcount; /**< reference counter for type sharing */
1069 struct lysc_range *length; /**< Optional length limitation */
Radek Krejci4586a022018-11-13 11:29:26 +01001070 struct lysc_pattern **patterns; /**< Optional list of pointers to pattern limitations ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001071};
1072
1073struct lysc_type_enum {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001074 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001075 LY_DATA_TYPE basetype; /**< Base type of the type */
1076 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci8b764662018-11-14 14:15:13 +01001077 struct lysc_type_enum_item {
Radek Krejci2167ee12018-11-02 16:09:07 +01001078 const char *name; /**< enumeration identifier */
1079 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejci8b764662018-11-14 14:15:13 +01001080 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001081 int32_t value; /**< integer value associated with the enumeration */
1082 } *enums; /**< enumerations list ([sized array](@ref sizedarrays)), mandatory (at least 1 item) */
1083};
1084
1085struct lysc_type_leafref {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001086 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001087 LY_DATA_TYPE basetype; /**< Base type of the type */
1088 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejcia3045382018-11-22 14:30:31 +01001089 const char* path; /**< target path */
Radek Krejci96a0bfd2018-11-22 15:25:06 +01001090 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 +01001091 struct lysc_type *realtype; /**< pointer to the real (first non-leafref in possible leafrefs chain) type. */
Radek Krejci2167ee12018-11-02 16:09:07 +01001092 uint8_t require_instance; /**< require-instance flag */
1093};
1094
1095struct lysc_type_identityref {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001096 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001097 LY_DATA_TYPE basetype; /**< Base type of the type */
1098 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci555cb5b2018-11-16 14:54:33 +01001099 struct lysc_ident **bases; /**< list of pointers to the base identities ([sized array](@ref sizedarrays)),
Radek Krejci2167ee12018-11-02 16:09:07 +01001100 mandatory (at least 1 item) */
1101};
1102
1103struct lysc_type_instanceid {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001104 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001105 LY_DATA_TYPE basetype; /**< Base type of the type */
1106 uint32_t refcount; /**< reference counter for type sharing */
1107 uint8_t require_instance; /**< require-instance flag */
1108};
1109
1110struct lysc_type_bits {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001111 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001112 LY_DATA_TYPE basetype; /**< Base type of the type */
1113 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci8b764662018-11-14 14:15:13 +01001114 struct lysc_type_bits_item {
Radek Krejci2167ee12018-11-02 16:09:07 +01001115 const char *name; /**< bit identifier */
1116 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejci8b764662018-11-14 14:15:13 +01001117 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001118 uint32_t position; /**< non-negative integer value associated with the bit */
1119 } *bits; /**< bits list ([sized array](@ref sizedarrays)), mandatory (at least 1 item) */
1120};
1121
1122struct lysc_type_union {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001123 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001124 LY_DATA_TYPE basetype; /**< Base type of the type */
1125 uint32_t refcount; /**< reference counter for type sharing */
1126 struct lysc_type **types; /**< list of types in the union ([sized array](@ref sizedarrays)), mandatory (at least 1 item) */
1127};
1128
1129struct lysc_type_bin {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001130 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001131 LY_DATA_TYPE basetype; /**< Base type of the type */
1132 uint32_t refcount; /**< reference counter for type sharing */
1133 struct lysc_range *length; /**< Optional length limitation */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001134};
1135
Radek Krejci056d0a82018-12-06 16:57:25 +01001136struct lysc_action {
1137 uint16_t nodetype; /**< LYS_ACTION */
1138 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1139 const char *name; /**< action/RPC name (mandatory) */
1140 /* TODO */
1141};
1142
1143struct lysc_notif {
1144 uint16_t nodetype; /**< LYS_NOTIF */
1145 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1146 const char *name; /**< Notification name (mandatory) */
1147 /* TODO */
1148};
1149
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001150/**
Radek Krejci0af5f5d2018-09-07 15:00:30 +02001151 * @brief Compiled YANG data node
1152 */
1153struct lysc_node {
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001154 uint16_t nodetype; /**< type of the node (mandatory) */
1155 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001156 struct lys_module *module; /**< module structure */
1157 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. */
1158 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1159 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1160 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1161 never NULL. If there is no sibling node, pointer points to the node
1162 itself. In case of the first node, this pointer points to the last
1163 node in the list. */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001164 const char *name; /**< node name (mandatory) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001165 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci056d0a82018-12-06 16:57:25 +01001166 struct lysc_when *when; /**< when statement */
1167 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001168};
1169
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001170struct lysc_node_container {
1171 uint16_t nodetype; /**< LYS_CONTAINER */
1172 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1173 struct lys_module *module; /**< module structure */
1174 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. */
1175 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1176 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1177 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1178 never NULL. If there is no sibling node, pointer points to the node
1179 itself. In case of the first node, this pointer points to the last
1180 node in the list. */
1181 const char *name; /**< node name (mandatory) */
1182 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001183 struct lysc_when *when; /**< when statement */
1184 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1185
1186 struct lysc_node *child; /**< first child node (linked list) */
1187 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1188 struct lysc_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
1189 struct lysc_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001190};
1191
Radek Krejcia3045382018-11-22 14:30:31 +01001192struct lysc_node_case {
Radek Krejci056d0a82018-12-06 16:57:25 +01001193 uint16_t nodetype; /**< LYS_CASE */
1194 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1195 struct lys_module *module; /**< module structure */
1196 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. */
1197 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1198 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1199 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1200 never NULL. If there is no sibling node, pointer points to the node
1201 itself. In case of the first node, this pointer points to the last
1202 node in the list. */
Radek Krejcia3045382018-11-22 14:30:31 +01001203 const char *name; /**< name of the case, including the implicit case */
Radek Krejci056d0a82018-12-06 16:57:25 +01001204 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1205 struct lysc_when *when; /**< when statement */
1206 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1207
Radek Krejcia3045382018-11-22 14:30:31 +01001208 struct lysc_node *child; /**< first child node of the case (linked list). Note that all the children of all the sibling cases are linked
1209 each other as siblings with the parent pointer pointing to the choice node holding the case. To distinguish
1210 which children node belongs to which case, it is needed to match the first children of the cases while going
1211 through the children linked list. */
1212};
1213
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001214struct lysc_node_choice {
1215 uint16_t nodetype; /**< LYS_CHOICE */
1216 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1217 struct lys_module *module; /**< module structure */
1218 struct lysp_node *sp; /**< simply parsed (SP) original of the node, NULL if the SP schema was removed or in case of implicit case node. */
1219 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1220 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1221 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1222 never NULL. If there is no sibling node, pointer points to the node
1223 itself. In case of the first node, this pointer points to the last
1224 node in the list. */
1225 const char *name; /**< node name (mandatory) */
1226 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci056d0a82018-12-06 16:57:25 +01001227 struct lysc_when *when; /**< when statement */
1228 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001229
Radek Krejcia9026eb2018-12-12 16:04:47 +01001230 struct lysc_node_case *cases; /**< list of the cases (linked list). Note that all the children of all the cases are linked each other
1231 as siblings. Their parent pointers points to the specific case they belongs to, so distinguish the
1232 case is simple. */
Radek Krejci056d0a82018-12-06 16:57:25 +01001233 struct lysc_node_case *dflt; /**< default case of the choice, only a pointer into the cases array. */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001234};
1235
1236struct lysc_node_leaf {
1237 uint16_t nodetype; /**< LYS_LEAF */
1238 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1239 struct lys_module *module; /**< module structure */
1240 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. */
1241 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1242 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1243 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1244 never NULL. If there is no sibling node, pointer points to the node
1245 itself. In case of the first node, this pointer points to the last
1246 node in the list. */
1247 const char *name; /**< node name (mandatory) */
1248 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001249 struct lysc_when *when; /**< when statement */
1250 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1251
1252 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1253 struct lysc_type *type; /**< type of the leaf node (mandatory) */
Radek Krejcib57cf1e2018-11-23 14:07:05 +01001254
Radek Krejci4f28eda2018-11-12 11:46:16 +01001255 const char *units; /**< units of the leaf's type */
1256 const char *dflt; /**< default value */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001257};
1258
1259struct lysc_node_leaflist {
1260 uint16_t nodetype; /**< LYS_LEAFLIST */
1261 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1262 struct lys_module *module; /**< module structure */
1263 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. */
1264 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1265 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1266 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1267 never NULL. If there is no sibling node, pointer points to the node
1268 itself. In case of the first node, this pointer points to the last
1269 node in the list. */
1270 const char *name; /**< node name (mandatory) */
1271 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcib57cf1e2018-11-23 14:07:05 +01001272 struct lysc_when *when; /**< when statement */
1273 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1274
1275 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1276 struct lysc_type *type; /**< type of the leaf node (mandatory) */
1277
Radek Krejci0e5d8382018-11-28 16:37:53 +01001278 const char *units; /**< units of the leaf's type */
1279 const char **dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
1280 uint32_t min; /**< min-elements constraint */
1281 uint32_t max; /**< max-elements constraint */
1282
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001283};
1284
1285struct lysc_node_list {
1286 uint16_t nodetype; /**< LYS_LIST */
1287 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1288 struct lys_module *module; /**< module structure */
1289 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. */
1290 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1291 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1292 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1293 never NULL. If there is no sibling node, pointer points to the node
1294 itself. In case of the first node, this pointer points to the last
1295 node in the list. */
1296 const char *name; /**< node name (mandatory) */
1297 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci9bb94eb2018-12-04 16:48:35 +01001298 struct lysc_when *when; /**< when statement */
1299 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1300
1301 struct lysc_node *child; /**< first child node (linked list) */
1302 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1303 struct lysc_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
1304 struct lysc_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
1305
1306 struct lysc_node_leaf **keys; /**< list of pointers to the keys ([sized array](@ref sizedarrays)) */
1307 struct lysc_node_leaf ***uniques; /**< list of sized arrays of pointers to the unique nodes ([sized array](@ref sizedarrays)) */
1308 uint32_t min; /**< min-elements constraint */
1309 uint32_t max; /**< max-elements constraint */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001310};
1311
1312struct lysc_node_anydata {
1313 uint16_t nodetype; /**< LYS_ANYXML or LYS_ANYDATA */
1314 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1315 struct lys_module *module; /**< module structure */
1316 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. */
1317 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1318 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1319 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1320 never NULL. If there is no sibling node, pointer points to the node
1321 itself. In case of the first node, this pointer points to the last
1322 node in the list. */
1323 const char *name; /**< node name (mandatory) */
1324 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci056d0a82018-12-06 16:57:25 +01001325 struct lysc_when *when; /**< when statement */
1326 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejci9800fb82018-12-13 14:26:23 +01001327
1328 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001329};
1330
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001331/**
1332 * @brief Compiled YANG schema tree structure representing YANG module.
1333 *
1334 * Semantically validated YANG schema tree for data tree parsing.
1335 * Contains only the necessary information for the data validation.
1336 */
1337struct lysc_module {
1338 struct ly_ctx *ctx; /**< libyang context of the module (mandatory) */
1339 const char *name; /**< name of the module (mandatory) */
Radek Krejci6d6e4e42018-10-29 13:28:19 +01001340 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 +02001341 const char *ns; /**< namespace of the module (mandatory) */
1342 const char *prefix; /**< module prefix (mandatory) */
Radek Krejcif8f882a2018-10-31 14:51:15 +01001343 const char *revision; /**< the revision of the module */
Radek Krejci151a5b72018-10-19 14:21:44 +02001344 struct lysc_import *imports; /**< list of imported modules ([sized array](@ref sizedarrays)) */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001345
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001346 struct lysc_feature *features; /**< list of feature definitions ([sized array](@ref sizedarrays)) */
Radek Krejci2a408df2018-10-29 16:32:26 +01001347 struct lysc_ident *identities; /**< list of identities ([sized array](@ref sizedarrays)) */
1348 struct lysc_node *data; /**< list of module's top-level data nodes (linked list) */
1349 struct lysc_action *rpcs; /**< list of RPCs ([sized array](@ref sizedarrays)) */
1350 struct lysc_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejcice8c1592018-10-29 15:35:51 +01001351 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001352
1353 uint8_t implemented:1; /**< flag if the module is implemented, not just imported */
Radek Krejcifaa1eac2018-10-30 14:34:55 +01001354 uint8_t latest_revision:2; /**< flag to mark the latest available revision:
1355 1 - the latest revision in searchdirs was not searched yet and this is the
1356 latest revision in the current context
1357 2 - searchdirs were searched and this is the latest available revision */
Radek Krejci086c7132018-10-26 15:29:04 +02001358 uint8_t version; /**< yang-version (LYS_VERSION values) */
Radek Krejci0af5f5d2018-09-07 15:00:30 +02001359};
1360
1361/**
Radek Krejci53ea6152018-12-13 15:21:15 +01001362 * @brief Get the groupings sized array of the given (parsed) schema node.
1363 * Decides the node's type and in case it has a groupings array, returns it.
1364 * @param[in] node Node to examine.
1365 * @return The node's groupings sized array if any, NULL otherwise.
1366 */
1367const struct lysp_grp *lysp_node_groupings(const struct lysp_node *node);
1368
1369/**
Radek Krejci056d0a82018-12-06 16:57:25 +01001370 * @brief Get the typedefs sized array of the given (parsed) schema node.
1371 * Decides the node's type and in case it has a typedefs array, returns it.
1372 * @param[in] node Node to examine.
1373 * @return The node's typedefs sized array if any, NULL otherwise.
1374 */
1375const struct lysp_tpdf *lysp_node_typedefs(const struct lysp_node *node);
1376
1377/**
1378 * @brief Get the actions/RPCs sized array of the given (parsed) schema node.
1379 * Decides the node's type and in case it has a actions/RPCs array, returns it.
1380 * @param[in] node Node to examine.
1381 * @return The node's actions/RPCs sized array if any, NULL otherwise.
1382 */
1383const struct lysp_action *lysp_node_actions(const struct lysp_node *node);
1384
1385/**
1386 * @brief Get the Notifications sized array of the given (parsed) schema node.
1387 * Decides the node's type and in case it has a Notifications array, returns it.
1388 * @param[in] node Node to examine.
1389 * @return The node's Notifications sized array if any, NULL otherwise.
1390 */
1391const struct lysp_notif *lysp_node_notifs(const struct lysp_node *node);
1392
1393/**
1394 * @brief Get the children linked list of the given (parsed) schema node.
1395 * Decides the node's type and in case it has a children list, returns it.
1396 * @param[in] node Node to examine.
1397 * @return The node's children linked list if any, NULL otherwise.
1398 */
1399const struct lysp_node *lysp_node_children(const struct lysp_node *node);
1400
1401/**
1402 * @brief Get the actions/RPCs sized array of the given (compiled) schema node.
1403 * Decides the node's type and in case it has a actions/RPCs array, returns it.
1404 * @param[in] node Node to examine.
1405 * @return The node's actions/RPCs sized array if any, NULL otherwise.
1406 */
1407const struct lysc_action *lysc_node_actions(const struct lysc_node *node);
1408
1409/**
1410 * @brief Get the Notifications sized array of the given (compiled) schema node.
1411 * Decides the node's type and in case it has a Notifications array, returns it.
1412 * @param[in] node Node to examine.
1413 * @return The node's Notifications sized array if any, NULL otherwise.
1414 */
1415const struct lysc_notif *lysc_node_notifs(const struct lysc_node *node);
1416
1417/**
1418 * @brief Get the children linked list of the given (compiled) schema node.
1419 * Decides the node's type and in case it has a children list, returns it.
1420 * @param[in] node Node to examine.
1421 * @return The node's children linked list if any, NULL otherwise.
1422 */
1423const struct lysc_node *lysc_node_children(const struct lysc_node *node);
1424
1425/**
Radek Krejci151a5b72018-10-19 14:21:44 +02001426 * @brief Get how the if-feature statement currently evaluates.
1427 *
1428 * @param[in] iff Compiled if-feature statement to evaluate.
1429 * @return If the statement evaluates to true, 1 is returned. 0 is returned when the statement evaluates to false.
1430 */
1431int lysc_iffeature_value(const struct lysc_iffeature *iff);
1432
1433/**
1434 * @brief Get the current status of the provided feature.
1435 *
1436 * @param[in] feature Compiled feature statement to examine.
1437 * @return
1438 * - 1 if feature is enabled,
1439 * - 0 if feature is disabled,
1440 * - -1 in case of error (invalid argument)
1441 */
1442int lysc_feature_value(const struct lysc_feature *feature);
1443
1444/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001445 * @brief Available YANG schema tree structures representing YANG module.
1446 */
1447struct lys_module {
1448 struct lysp_module *parsed; /**< Simply parsed (unresolved) YANG schema tree */
1449 struct lysc_module *compiled; /**< Compiled and fully validated YANG schema tree for data parsing */
1450};
1451
Radek Krejci151a5b72018-10-19 14:21:44 +02001452/**
1453 * @brief Enable specified feature in the module
1454 *
1455 * By default, when the module is loaded by libyang parser, all features are disabled.
1456 *
Radek Krejcica3db002018-11-01 10:31:01 +01001457 * If all features are being enabled, it must be possible respecting their if-feature conditions. For example,
1458 * enabling all features on the following feature set will fail since it is not possible to enable both features
1459 * (and it is unclear which of them should be enabled then). In this case the LY_EDENIED is returned and the feature
1460 * is untouched.
1461 *
1462 * feature f1;
1463 * feature f2 { if-feature 'not f1';}
1464 *
Radek Krejci151a5b72018-10-19 14:21:44 +02001465 * @param[in] module Module where the feature will be enabled.
1466 * @param[in] feature Name of the feature to enable. To enable all features at once, use asterisk (`*`) character.
1467 * @return LY_ERR value.
1468 */
1469LY_ERR lys_feature_enable(struct lys_module *module, const char *feature);
1470
1471/**
1472 * @brief Disable specified feature in the module
1473 *
1474 * By default, when the module is loaded by libyang parser, all features are disabled.
1475 *
1476 * @param[in] module Module where the feature will be disabled.
1477 * @param[in] feature Name of the feature to disable. To disable all features at once, use asterisk (`*`) character.
1478 * @return LY_ERR value
1479 */
1480LY_ERR lys_feature_disable(struct lys_module *module, const char *feature);
1481
1482/**
1483 * @brief Get the current status of the specified feature in the module.
1484 *
1485 * @param[in] module Module where the feature is defined.
1486 * @param[in] feature Name of the feature to inspect.
1487 * @return
1488 * - 1 if feature is enabled,
1489 * - 0 if feature is disabled,
1490 * - -1 in case of error (e.g. feature is not defined or invalid arguments)
1491 */
1492int lys_feature_value(const struct lys_module *module, const char *feature);
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001493
1494/**
Radek Krejci86d106e2018-10-18 09:53:19 +02001495 * @brief Load a schema into the specified context.
1496 *
1497 * @param[in] ctx libyang context where to process the data model.
1498 * @param[in] data The string containing the dumped data model in the specified
1499 * format.
1500 * @param[in] format Format of the input data (YANG or YIN).
1501 * @return Pointer to the data model structure or NULL on error.
1502 */
Radek Krejcid14e9692018-11-01 11:00:37 +01001503struct lys_module *lys_parse_mem(struct ly_ctx *ctx, const char *data, LYS_INFORMAT format);
Radek Krejci86d106e2018-10-18 09:53:19 +02001504
1505/**
1506 * @brief Read a schema from file descriptor into the specified context.
1507 *
1508 * \note Current implementation supports only reading data from standard (disk) file, not from sockets, pipes, etc.
1509 *
1510 * @param[in] ctx libyang context where to process the data model.
1511 * @param[in] fd File descriptor of a regular file (e.g. sockets are not supported) containing the schema
1512 * in the specified format.
1513 * @param[in] format Format of the input data (YANG or YIN).
1514 * @return Pointer to the data model structure or NULL on error.
1515 */
Radek Krejcid14e9692018-11-01 11:00:37 +01001516struct lys_module *lys_parse_fd(struct ly_ctx *ctx, int fd, LYS_INFORMAT format);
Radek Krejci86d106e2018-10-18 09:53:19 +02001517
1518/**
Radek Krejcid33273d2018-10-25 14:55:52 +02001519 * @brief Read a schema into the specified context from a file.
Radek Krejci86d106e2018-10-18 09:53:19 +02001520 *
1521 * @param[in] ctx libyang context where to process the data model.
1522 * @param[in] path Path to the file with the model in the specified format.
1523 * @param[in] format Format of the input data (YANG or YIN).
1524 * @return Pointer to the data model structure or NULL on error.
1525 */
Radek Krejcid14e9692018-11-01 11:00:37 +01001526struct lys_module *lys_parse_path(struct ly_ctx *ctx, const char *path, LYS_INFORMAT format);
Radek Krejci86d106e2018-10-18 09:53:19 +02001527
1528/**
Radek Krejcid33273d2018-10-25 14:55:52 +02001529 * @brief Search for the schema file in the specified searchpaths.
1530 *
1531 * @param[in] searchpaths NULL-terminated array of paths to be searched (recursively). Current working
1532 * directory is searched automatically (but non-recursively if not in the provided list). Caller can use
1533 * result of the ly_ctx_get_searchdirs().
1534 * @param[in] cwd Flag to implicitly search also in the current working directory (non-recursively).
1535 * @param[in] name Name of the schema to find.
1536 * @param[in] revision Revision of the schema to find. If NULL, the newest found schema filepath is returned.
1537 * @param[out] localfile Mandatory output variable containing absolute path of the found schema. If no schema
1538 * complying the provided restriction is found, NULL is set.
1539 * @param[out] format Optional output variable containing expected format of the schema document according to the
1540 * file suffix.
1541 * @return LY_ERR value (LY_SUCCESS is returned even if the file is not found, then the *localfile is NULL).
1542 */
1543LY_ERR lys_search_localfile(const char * const *searchpaths, int cwd, const char *name, const char *revision, char **localfile, LYS_INFORMAT *format);
1544
1545/**
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001546 * @defgroup scflags Schema compile flags
1547 * @ingroup schematree
1548 *
1549 * @{
1550 */
1551#define LYSC_OPT_FREE_SP 1 /**< Free the input printable schema */
Radek Krejcia3045382018-11-22 14:30:31 +01001552/** @} scflags */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001553
1554/**
1555 * @brief Compile printable schema into a validated schema linking all the references.
1556 *
Radek Krejcif8f882a2018-10-31 14:51:15 +01001557 * @param[in, out] mod Schema structure holding pointers to both schema structure types. The ::lys_module#parsed
1558 * 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 +02001559 * @param[in] options Various options to modify compiler behavior, see [compile flags](@ref scflags).
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001560 * @return LY_ERR value.
1561 */
Radek Krejcid14e9692018-11-01 11:00:37 +01001562LY_ERR lys_compile(struct lys_module *mod, int options);
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001563
Radek Krejcia3045382018-11-22 14:30:31 +01001564/**
1565 * @brief Get next schema tree (sibling) node element that can be instantiated in a data tree. Returned node can
1566 * be from an augment.
1567 *
1568 * lys_getnext() is supposed to be called sequentially. In the first call, the \p last parameter is usually NULL
1569 * and function starts returning i) the first \p parent's child or ii) the first top level element of the \p module.
1570 * Consequent calls suppose to provide the previously returned node as the \p last parameter and still the same
1571 * \p parent and \p module parameters.
1572 *
1573 * Without options, the function is used to traverse only the schema nodes that can be paired with corresponding
1574 * data nodes in a data tree. By setting some \p options the behavior can be modified to the extent that
1575 * all the schema nodes are iteratively returned.
1576 *
1577 * @param[in] last Previously returned schema tree node, or NULL in case of the first call.
1578 * @param[in] parent Parent of the subtree where the function starts processing.
1579 * @param[in] module In case of iterating on top level elements, the \p parent is NULL and
1580 * module must be specified.
1581 * @param[in] options [ORed options](@ref sgetnextflags).
1582 * @return Next schema tree node that can be instantiated in a data tree, NULL in case there is no such element.
1583 */
1584const struct lysc_node *lys_getnext(const struct lysc_node *last, const struct lysc_node *parent,
1585 const struct lysc_module *module, int options);
1586
1587/**
1588 * @defgroup sgetnextflags lys_getnext() flags
1589 * @ingroup schematree
1590 *
1591 * @{
1592 */
1593#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 +01001594#define LYS_GETNEXT_NOCHOICE 0x02 /**< lys_getnext() option to ignore (kind of conditional) nodes within choice node */
Radek Krejci056d0a82018-12-06 16:57:25 +01001595#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 +01001596#define LYS_GETNEXT_INTONPCONT 0x40 /**< lys_getnext() option to look into non-presence container, instead of returning container itself */
1597#define LYS_GETNEXT_NOSTATECHECK 0x100 /**< lys_getnext() option to skip checking module validity (import-only, disabled) and
1598 relevant if-feature conditions state */
1599/** @} sgetnextflags */
1600
1601/**
1602 * @brief Get child node according to the specified criteria.
1603 *
1604 * @param[in] parent Optional parent of the node to find. If not specified, the module's top-level nodes are searched.
1605 * @param[in] module module of the node to find. It is also limitation for the children node of the given parent.
1606 * @param[in] name Name of the node to find.
1607 * @param[in] name_len Optional length of the name in case it is not NULL-terminated string.
1608 * @param[in] nodetype Optional criteria (to speedup) specifying nodetype(s) of the node to find.
1609 * Used as a bitmask, so multiple nodetypes can be specified.
1610 * @param[in] options [ORed options](@ref sgetnextflags).
1611 * @return Found node if any.
1612 */
1613const struct lysc_node *lys_child(const struct lysc_node *parent, const struct lys_module *module,
1614 const char *name, size_t name_len, uint16_t nodetype, int options);
1615
1616/**
1617 * @brief Check if the schema node is disabled in the schema tree, i.e. there is any disabled if-feature statement
1618 * affecting the node.
1619 *
1620 * @param[in] node Schema node to check.
1621 * @param[in] recursive - 0 to check if-feature only in the \p node schema node,
1622 * - 1 to check if-feature in all ascendant schema nodes until there is a node possibly having an instance in a data tree
1623 * @return - NULL if enabled,
1624 * - pointer to the node with the unsatisfied (disabling) if-feature expression.
1625 */
1626const struct lysc_iffeature *lys_is_disabled(const struct lysc_node *node, int recursive);
1627
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001628/** @} */
1629
Radek Krejci70853c52018-10-15 14:46:16 +02001630#ifdef __cplusplus
1631}
1632#endif
1633
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001634#endif /* LY_TREE_SCHEMA_H_ */