blob: e8b3f75541b55d2b79c5d8d2a9236e1c064f6051 [file] [log] [blame]
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001/**
2 * @file tree_schema.h
3 * @author Radek Krejci <rkrejci@cesnet.cz>
4 * @brief libyang representation of YANG schema trees.
5 *
6 * Copyright (c) 2015 - 2018 CESNET, z.s.p.o.
7 *
8 * This source code is licensed under BSD 3-Clause License (the "License").
9 * You may not use this file except in compliance with the License.
10 * You may obtain a copy of the License at
11 *
12 * https://opensource.org/licenses/BSD-3-Clause
13 */
14
15#ifndef LY_TREE_SCHEMA_H_
16#define LY_TREE_SCHEMA_H_
17
Radek Krejci54579462019-04-30 12:47:06 +020018#define PCRE2_CODE_UNIT_WIDTH 8
19
20#include <pcre2.h>
Radek Krejci5aeea3a2018-09-05 13:29:36 +020021#include <stdint.h>
Radek Krejcid3ca0632019-04-16 16:54:54 +020022#include <stdio.h>
Radek Krejci5aeea3a2018-09-05 13:29:36 +020023
Radek Krejcie7b95092019-05-15 11:03:07 +020024#include "log.h"
25#include "tree.h"
Radek Krejcice8c1592018-10-29 15:35:51 +010026#include "extensions.h"
Radek Krejci084289f2019-07-09 17:35:30 +020027#include "tree_data.h"
Radek Krejcice8c1592018-10-29 15:35:51 +010028
Radek Krejcie7b95092019-05-15 11:03:07 +020029struct ly_ctx;
30
Radek Krejci70853c52018-10-15 14:46:16 +020031#ifdef __cplusplus
32extern "C" {
33#endif
34
Radek Krejci5aeea3a2018-09-05 13:29:36 +020035/**
Radek Krejci0af5f5d2018-09-07 15:00:30 +020036 * @brief Schema input formats accepted by libyang [parser functions](@ref howtoschemasparsers).
37 */
38typedef enum {
39 LYS_IN_UNKNOWN = 0, /**< unknown format, used as return value in case of error */
40 LYS_IN_YANG = 1, /**< YANG schema input format */
Radek Krejci693262f2019-04-29 15:23:20 +020041 LYS_IN_YIN = 3 /**< YIN schema input format */
Radek Krejci0af5f5d2018-09-07 15:00:30 +020042} LYS_INFORMAT;
43
44/**
45 * @brief Schema output formats accepted by libyang [printer functions](@ref howtoschemasprinters).
46 */
47typedef enum {
48 LYS_OUT_UNKNOWN = 0, /**< unknown format, used as return value in case of error */
49 LYS_OUT_YANG = 1, /**< YANG schema output format */
Radek Krejci693262f2019-04-29 15:23:20 +020050 LYS_OUT_YIN = 3, /**< YIN schema output format */
51 LYS_OUT_YANG_COMPILED = 2, /**< YANG schema output format of the compiled schema tree */
Radek Krejcid3ca0632019-04-16 16:54:54 +020052
Radek Krejci0af5f5d2018-09-07 15:00:30 +020053 LYS_OUT_TREE, /**< Tree schema output format, for more information see the [printers](@ref howtoschemasprinters) page */
54 LYS_OUT_INFO, /**< Info schema output format, for more information see the [printers](@ref howtoschemasprinters) page */
55 LYS_OUT_JSON, /**< JSON schema output format, reflecting YIN format with conversion of attributes to object's members */
56} LYS_OUTFORMAT;
57
Radek Krejci5aeea3a2018-09-05 13:29:36 +020058#define LY_REV_SIZE 11 /**< revision data string length (including terminating NULL byte) */
59
Michal Vaskob55f6c12018-09-12 11:13:15 +020060#define LYS_UNKNOWN 0x0000 /**< uninitalized unknown statement node */
61#define LYS_CONTAINER 0x0001 /**< container statement node */
62#define LYS_CHOICE 0x0002 /**< choice statement node */
63#define LYS_LEAF 0x0004 /**< leaf statement node */
64#define LYS_LEAFLIST 0x0008 /**< leaf-list statement node */
65#define LYS_LIST 0x0010 /**< list statement node */
66#define LYS_ANYXML 0x0020 /**< anyxml statement node */
Michal Vaskob55f6c12018-09-12 11:13:15 +020067#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 +020068
Radek Krejcie7b95092019-05-15 11:03:07 +020069#define LYS_ACTION 0x400 /**< RPC or action */
70#define LYS_NOTIF 0x800
71
Radek Krejcia3045382018-11-22 14:30:31 +010072#define LYS_CASE 0x0040 /**< case statement node */
73#define LYS_USES 0x0080 /**< uses statement node */
Radek Krejcid3ca0632019-04-16 16:54:54 +020074#define LYS_INPUT 0x100
75#define LYS_OUTPUT 0x200
76#define LYS_INOUT 0x300
Radek Krejci6d9b9b52018-11-02 12:43:39 +010077#define LYS_GROUPING 0x1000
78#define LYS_AUGMENT 0x2000
79
Radek Krejci5aeea3a2018-09-05 13:29:36 +020080/**
81 * @brief YANG import-stmt
82 */
83struct lysp_import {
Radek Krejci086c7132018-10-26 15:29:04 +020084 struct lys_module *module; /**< pointer to the imported module
85 (mandatory, but resolved when the referring module is completely parsed) */
86 const char *name; /**< name of the imported module (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +020087 const char *prefix; /**< prefix for the data from the imported schema (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +020088 const char *dsc; /**< description */
89 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +020090 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +020091 char rev[LY_REV_SIZE]; /**< revision-date of the imported module */
92};
93
94/**
95 * @brief YANG include-stmt
96 */
97struct lysp_include {
Radek Krejci0bcdaed2019-01-10 10:21:34 +010098 struct lysp_submodule *submodule;/**< pointer to the parsed submodule structure
Radek Krejci086c7132018-10-26 15:29:04 +020099 (mandatory, but resolved when the referring module is completely parsed) */
100 const char *name; /**< name of the included submodule (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200101 const char *dsc; /**< description */
102 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200103 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200104 char rev[LY_REV_SIZE]; /**< revision-date of the included submodule */
105};
106
107/**
108 * @brief YANG extension-stmt
109 */
110struct lysp_ext {
111 const char *name; /**< extension name */
112 const char *argument; /**< argument name, NULL if not specified */
113 const char *dsc; /**< description statement */
114 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200115 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200116 uint16_t flags; /**< LYS_STATUS_* and LYS_YINELEM values (@ref snodeflags) */
117};
118
119/**
120 * @brief Helper structure for generic storage of the extension instances content.
121 */
122struct lysp_stmt {
123 const char *stmt; /**< identifier of the statement */
124 const char *arg; /**< statement's argument */
125 struct lysp_stmt *next; /**< link to the next statement */
Michal Vaskobc2559f2018-09-07 10:17:50 +0200126 struct lysp_stmt *child; /**< list of the statement's substatements (linked list) */
Radek Krejcid3ca0632019-04-16 16:54:54 +0200127 uint16_t flags;
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200128};
129
130/**
131 * @brief YANG extension instance
132 */
133struct lysp_ext_instance {
134 const char *name; /**< extension identifier, including possible prefix */
135 const char *argument; /**< optional value of the extension's argument */
Radek Krejci693262f2019-04-29 15:23:20 +0200136 struct lysp_stmt *child; /**< list of the extension's substatements (linked list) */
Michal Vaskod92e42a2018-09-07 08:35:02 +0200137 LYEXT_SUBSTMT insubstmt; /**< value identifying placement of the extension instance */
138 uint32_t insubstmt_index; /**< in case the instance is in a substatement, this identifies
139 the index of that substatement */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200140};
141
142/**
143 * @brief YANG feature-stmt
144 */
145struct lysp_feature {
146 const char *name; /**< feature name (mandatory) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200147 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200148 const char *dsc; /**< description statement */
149 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200150 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200151 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values allowed */
152};
153
154/**
155 * @brief YANG identity-stmt
156 */
157struct lysp_ident {
158 const char *name; /**< identity name (mandatory), including possible prefix */
Radek Krejci151a5b72018-10-19 14:21:44 +0200159 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
160 const char **bases; /**< list of base identifiers ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200161 const char *dsc; /**< description statement */
162 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200163 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200164 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_ values are allowed */
165};
166
Michal Vasko71e64ca2018-09-07 16:30:29 +0200167/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200168 * @brief Covers restrictions: range, length, pattern, must
169 */
170struct lysp_restr {
171 const char *arg; /**< The restriction expression/value (mandatory);
172 in case of pattern restriction, the first byte has a special meaning:
173 0x06 (ACK) for regular match and 0x15 (NACK) for invert-match */
174 const char *emsg; /**< error-message */
175 const char *eapptag; /**< error-app-tag value */
176 const char *dsc; /**< description */
177 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200178 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200179};
180
181/**
Michal Vasko71e64ca2018-09-07 16:30:29 +0200182 * @brief YANG revision-stmt
183 */
184struct lysp_revision {
Radek Krejcib7db73a2018-10-24 14:18:40 +0200185 char date[LY_REV_SIZE]; /**< revision date (madatory) */
Michal Vasko71e64ca2018-09-07 16:30:29 +0200186 const char *dsc; /**< description statement */
187 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200188 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vasko71e64ca2018-09-07 16:30:29 +0200189};
190
191/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200192 * @brief Enumeration/Bit value definition
193 */
194struct lysp_type_enum {
195 const char *name; /**< name (mandatory) */
196 const char *dsc; /**< description statement */
197 const char *ref; /**< reference statement */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200198 int64_t value; /**< enum's value or bit's position */
Radek Krejci151a5b72018-10-19 14:21:44 +0200199 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200200 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200201 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_ and LYS_SET_VALUE
202 values are allowed */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200203};
204
205/**
206 * @brief YANG type-stmt
207 *
208 * Some of the items in the structure may be mandatory, but it is necessary to resolve the type's base type first
209 */
210struct lysp_type {
211 const char *name; /**< name of the type (mandatory) */
212 struct lysp_restr *range; /**< allowed values range - numerical, decimal64 */
213 struct lysp_restr *length; /**< allowed length of the value - string, binary */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200214 struct lysp_restr *patterns; /**< list of patterns ([sized array](@ref sizedarrays)) - string */
215 struct lysp_type_enum *enums; /**< list of enum-stmts ([sized array](@ref sizedarrays)) - enum */
216 struct lysp_type_enum *bits; /**< list of bit-stmts ([sized array](@ref sizedarrays)) - bits */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200217 const char *path; /**< path - leafref */
Radek Krejci151a5b72018-10-19 14:21:44 +0200218 const char **bases; /**< list of base identifiers ([sized array](@ref sizedarrays)) - identityref */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200219 struct lysp_type *types; /**< list of sub-types ([sized array](@ref sizedarrays)) - union */
220 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200221
Radek Krejci2167ee12018-11-02 16:09:07 +0100222 struct lysc_type *compiled; /**< pointer to the compiled type */
223
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200224 uint8_t fraction_digits; /**< number of fraction digits - decimal64 */
225 uint8_t require_instance; /**< require-instance flag - leafref, instance */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100226 uint16_t flags; /**< [schema node flags](@ref spnodeflags) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200227};
228
229/**
230 * @brief YANG typedef-stmt
231 */
232struct lysp_tpdf {
233 const char *name; /**< name of the newly defined type (mandatory) */
234 const char *units; /**< units of the newly defined type */
235 const char *dflt; /**< default value of the newly defined type */
236 const char *dsc; /**< description statement */
237 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200238 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200239 struct lysp_type type; /**< base type from which the typedef is derived (mandatory) */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100240 uint16_t flags; /**< [schema node flags](@ref spnodeflags) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200241};
242
243/**
244 * @brief YANG grouping-stmt
245 */
246struct lysp_grp {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100247 struct lysp_node *parent; /**< parent node (NULL if this is a top-level grouping) */
248 uint16_t nodetype; /**< LYS_GROUPING */
249 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values are allowed */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200250 const char *name; /**< grouping name (mandatory) */
251 const char *dsc; /**< description statement */
252 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200253 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
254 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200255 struct lysp_node *data; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200256 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
257 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
258 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200259};
260
261/**
262 * @brief YANG when-stmt
263 */
264struct lysp_when {
265 const char *cond; /**< specified condition (mandatory) */
266 const char *dsc; /**< description statement */
267 const char *ref; /**< reference statement */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200268 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200269};
270
271/**
272 * @brief YANG refine-stmt
273 */
274struct lysp_refine {
275 const char *nodeid; /**< target descendant schema nodeid (mandatory) */
276 const char *dsc; /**< description statement */
277 const char *ref; /**< reference statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200278 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200279 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200280 const char *presence; /**< presence description */
Radek Krejci151a5b72018-10-19 14:21:44 +0200281 const char **dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200282 uint32_t min; /**< min-elements constraint */
283 uint32_t max; /**< max-elements constraint, 0 means unbounded */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200284 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200285 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
286};
287
288/**
289 * @brief YANG uses-augment-stmt and augment-stmt
290 */
291struct lysp_augment {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100292 struct lysp_node *parent; /**< parent node (NULL if this is a top-level augment) */
293 uint16_t nodetype; /**< LYS_AUGMENT */
294 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values are allowed */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200295 const char *nodeid; /**< target schema nodeid (mandatory) - absolute for global augments, descendant for uses's augments */
296 const char *dsc; /**< description statement */
297 const char *ref; /**< reference statement */
298 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200299 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200300 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200301 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
302 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
303 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200304};
305
306/**
307 * @defgroup deviatetypes Deviate types
308 * @{
309 */
310#define LYS_DEV_NOT_SUPPORTED 1 /**< deviate type not-supported */
311#define LYS_DEV_ADD 2 /**< deviate type add */
312#define LYS_DEV_DELETE 3 /**< deviate type delete */
313#define LYS_DEV_REPLACE 4 /**< deviate type replace */
314/** @} */
315
316/**
317 * @brief Generic deviate structure to get type and cast to lysp_deviate_* structure
318 */
319struct lysp_deviate {
320 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
321 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200322 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200323};
324
325struct lysp_deviate_add {
326 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
327 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200328 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200329 const char *units; /**< units of the values */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200330 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200331 const char **uniques; /**< list of uniques specifications ([sized array](@ref sizedarrays)) */
332 const char **dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200333 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
334 uint32_t min; /**< min-elements constraint */
335 uint32_t max; /**< max-elements constraint, 0 means unbounded */
336};
337
338struct lysp_deviate_del {
339 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
340 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200341 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200342 const char *units; /**< units of the values */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200343 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200344 const char **uniques; /**< list of uniques specifications ([sized array](@ref sizedarrays)) */
345 const char **dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200346 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200347};
348
349struct lysp_deviate_rpl {
350 uint8_t mod; /**< [type](@ref deviatetypes) of the deviate modification */
351 struct lysp_deviate *next; /**< next deviate structure in the list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200352 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200353 struct lysp_type *type; /**< type of the node */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200354 const char *units; /**< units of the values */
355 const char *dflt; /**< default value */
356 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
357 uint32_t min; /**< min-elements constraint */
358 uint32_t max; /**< max-elements constraint, 0 means unbounded */
359};
360
361struct lysp_deviation {
Michal Vaskob55f6c12018-09-12 11:13:15 +0200362 const char *nodeid; /**< target absolute schema nodeid (mandatory) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200363 const char *dsc; /**< description statement */
364 const char *ref; /**< reference statement */
365 struct lysp_deviate* deviates; /**< list of deviate specifications (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200366 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200367};
368
Radek Krejci4f28eda2018-11-12 11:46:16 +0100369/**
370 * @defgroup spnodeflags Parsed schema nodes flags
371 * @ingroup snodeflags
372 *
373 * Various flags for parsed schema nodes.
374 *
375 * 1 - container 6 - anydata/anyxml 11 - output 16 - grouping 21 - enum
376 * 2 - choice 7 - case 12 - feature 17 - uses 22 - type
Radek Krejcid3ca0632019-04-16 16:54:54 +0200377 * 3 - leaf 8 - notification 13 - identity 18 - refine 23 - stmt
Radek Krejci4f28eda2018-11-12 11:46:16 +0100378 * 4 - leaflist 9 - rpc 14 - extension 19 - augment
379 * 5 - list 10 - input 15 - typedef 20 - deviate
380 *
Radek Krejcid3ca0632019-04-16 16:54:54 +0200381 * 1 1 1 1 1 1 1 1 1 1 2 2 2 2
382 * bit name 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3
383 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
384 * 1 LYS_CONFIG_W |x|x|x|x|x|x|x| | | | | | | | | | |x| |x| | | |
385 * LYS_SET_BASE | | | | | | | | | | | | | | | | | | | | | |x| |
386 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
387 * 2 LYS_CONFIG_R |x|x|x|x|x|x|x| | | | | | | | | | |x| |x| | | |
388 * LYS_SET_BIT | | | | | | | | | | | | | | | | | | | | | |x| |
389 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
390 * 3 LYS_STATUS_CURR |x|x|x|x|x|x|x|x|x| | |x|x|x|x|x|x| |x|x|x| | |
391 * LYS_SET_ENUM | | | | | | | | | | | | | | | | | | | | | |x| |
392 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
393 * 4 LYS_STATUS_DEPRC |x|x|x|x|x|x|x|x|x| | |x|x|x|x|x|x| |x|x|x| | |
394 * LYS_SET_FRDIGITS | | | | | | | | | | | | | | | | | | | | | |x| |
395 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
396 * 5 LYS_STATUS_OBSLT |x|x|x|x|x|x|x|x|x| | |x|x|x|x|x|x| |x|x|x| | |
397 * LYS_SET_LENGTH | | | | | | | | | | | | | | | | | | | | | |x| |
398 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
399 * 6 LYS_MAND_TRUE | |x|x| | |x| | | | | | | | | | | |x| |x| | | |
400 * LYS_SET_PATH | | | | | | | | | | | | | | | | | | | | | |x| |
401 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
402 * 7 LYS_MAND_FALSE | |x|x| | |x| | | | | | | | | | | |x| |x| | | |
403 * LYS_ORDBY_USER | | | |x|x| | | | | | | | | | | | | | | | | | |
404 * LYS_SET_PATTERN | | | | | | | | | | | | | | | | | | | | | |x| |
405 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
406 * 8 LYS_ORDBY_SYSTEM | | | |x|x| | | | | | | | | | | | | | | | | | |
407 * LYS_YINELEM_TRUE | | | | | | | | | | | | | |x| | | | | | | | | |
408 * LYS_SET_RANGE | | | | | | | | | | | | | | | | | | | | | |x| |
409 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
410 * 9 LYS_YINELEM_FALSE| | | | | | | | | | | | | |x| | | | | | | | | |
411 * LYS_SET_TYPE | | | | | | | | | | | | | | | | | | | | | |x| |
412 * LYS_SINGLEQUOTED | | | | | | | | | | | | | | | | | | | | | | |x|
413 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
414 * 10 LYS_SET_VALUE | | | | | | | | | | | | | | | | | | | | |x| | |
415 * LYS_SET_REQINST | | | | | | | | | | | | | | | | | | | | | |x| |
416 * LYS_SET_MIN | | | |x|x| | | | | | | | | | | | |x| |x| | | |
417 * LYS_DOUBLEQUOTED | | | | | | | | | | | | | | | | | | | | | | |x|
418 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
419 * 11 LYS_SET_MAX | | | |x|x| | | | | | | | | | | | |x| |x| | | |
Radek Krejcif2de0ed2019-05-02 14:13:18 +0200420 * LYS_USED_GRP | | | | | | | | | | | | | | | |x| | | | | | | |
Radek Krejcid3ca0632019-04-16 16:54:54 +0200421 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Radek Krejci4f28eda2018-11-12 11:46:16 +0100422 *
423 */
424
425/**
426 * @defgroup scnodeflags Compiled schema nodes flags
427 * @ingroup snodeflags
428 *
429 * Various flags for compiled schema nodes.
430 *
431 * 1 - container 6 - anydata/anyxml 11 - output
432 * 2 - choice 7 - case 12 - feature
433 * 3 - leaf 8 - notification 13 - identity
434 * 4 - leaflist 9 - rpc 14 - extension
Radek Krejci693262f2019-04-29 15:23:20 +0200435 * 5 - list 10 - input 15 - bitenum
Radek Krejci4f28eda2018-11-12 11:46:16 +0100436 *
Radek Krejci693262f2019-04-29 15:23:20 +0200437 * 1 1 1 1 1 1
438 * bit name 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5
439 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
440 * 1 LYS_CONFIG_W |x|x|x|x|x|x|x| | | | | | | | |
441 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
442 * 2 LYS_CONFIG_R |x|x|x|x|x|x|x| | | | | | | | |
443 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
444 * 3 LYS_STATUS_CURR |x|x|x|x|x|x|x|x|x| | |x|x|x| |
445 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
446 * 4 LYS_STATUS_DEPRC |x|x|x|x|x|x|x|x|x| | |x|x|x| |
447 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
448 * 5 LYS_STATUS_OBSLT |x|x|x|x|x|x|x|x|x| | |x|x|x| |
449 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
450 * 6 LYS_MAND_TRUE |x|x|x|x|x|x| | | | | | | | | |
451 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
452 * 7 LYS_ORDBY_USER | | | |x|x| | | | | | | | | | |
453 * LYS_MAND_FALSE | |x|x| | |x| | | | | | | | | |
454 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
455 * 8 LYS_ORDBY_SYSTEM | | | |x|x| | | | | | | | | | |
456 * LYS_PRESENCE |x| | | | | | | | | | | | | | |
457 * LYS_UNIQUE | | |x| | | | | | | | | | | | |
458 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
459 * 9 LYS_KEY | | |x| | | | | | | | | | | | |
460 * LYS_FENABLED | | | | | | | | | | | |x| | | |
461 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
462 * 10 LYS_SET_DFLT | | |x|x| | |x| | | | | | | | |
463 * LYS_ISENUM | | | | | | | | | | | | | | |x|
464 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
465 * 11 LYS_SET_UNITS | | |x|x| | | | | | | | | | | |
466 * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Radek Krejci1c0c3442019-07-23 16:08:47 +0200467 * 12 LYS_SET_CONFIG |x|x|x|x|x|x|x| | |x|x| | | | |
Radek Krejci693262f2019-04-29 15:23:20 +0200468 * ---------------------+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Radek Krejci4f28eda2018-11-12 11:46:16 +0100469 *
470 */
471
472/**
473 * @defgroup snodeflags Schema nodes flags
474 * @ingroup schematree
475 * @{
476 */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200477#define LYS_CONFIG_W 0x01 /**< config true; */
478#define LYS_CONFIG_R 0x02 /**< config false; */
479#define LYS_CONFIG_MASK 0x03 /**< mask for config value */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100480#define LYS_STATUS_CURR 0x04 /**< status current; */
481#define LYS_STATUS_DEPRC 0x08 /**< status deprecated; */
482#define LYS_STATUS_OBSLT 0x10 /**< status obsolete; */
483#define LYS_STATUS_MASK 0x1C /**< mask for status value */
484#define LYS_MAND_TRUE 0x20 /**< mandatory true; applicable only to ::lysp_node_choice/::lysc_node_choice,
Radek Krejcife909632019-02-12 15:34:42 +0100485 ::lysp_node_leaf/::lysc_node_leaf and ::lysp_node_anydata/::lysc_node_anydata.
486 The ::lysc_node_leaflist and ::lysc_node_leaflist have this flag in case that min-elements > 0.
487 The ::lysc_node_container has this flag if it is not a presence container and it has at least one
488 child with LYS_MAND_TRUE. */
Radek Krejcif1421c22019-02-19 13:05:20 +0100489#define LYS_MAND_FALSE 0x40 /**< mandatory false; applicable only to ::lysp_node_choice/::lysc_node_choice,
490 ::lysp_node_leaf/::lysc_node_leaf and ::lysp_node_anydata/::lysc_node_anydata.
491 This flag is present only in case the mandatory false statement was explicitly specified. */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100492#define LYS_MAND_MASK 0x60 /**< mask for mandatory values */
Radek Krejci7adf4ff2018-12-05 08:55:00 +0100493#define LYS_PRESENCE 0x80 /**< flag for presence property of a container, applicable only to ::lysc_node_container */
494#define LYS_UNIQUE 0x80 /**< flag for leafs being part of a unique set, applicable only to ::lysc_node_leaf */
495#define LYS_KEY 0x100 /**< flag for leafs being a key of a list, applicable only to ::lysc_node_leaf */
496#define LYS_FENABLED 0x100 /**< feature enabled flag, applicable only to ::lysc_feature */
Radek Krejcife909632019-02-12 15:34:42 +0100497#define LYS_ORDBY_SYSTEM 0x80 /**< ordered-by user lists, applicable only to ::lysc_node_leaflist/::lysp_node_leaflist and
Radek Krejci4f28eda2018-11-12 11:46:16 +0100498 ::lysc_node_list/::lysp_node_list */
499#define LYS_ORDBY_USER 0x40 /**< ordered-by user lists, applicable only to ::lysc_node_leaflist/::lysp_node_leaflist and
500 ::lysc_node_list/::lysp_node_list */
501#define LYS_ORDBY_MASK 0x60 /**< mask for ordered-by values */
502#define LYS_YINELEM_TRUE 0x80 /**< yin-element true for extension's argument */
503#define LYS_YINELEM_FALSE 0x100 /**< yin-element false for extension's argument */
504#define LYS_YINELEM_MASK 0x180 /**< mask for yin-element value */
Radek Krejcif2de0ed2019-05-02 14:13:18 +0200505#define LYS_USED_GRP 0x400 /**< internal flag for validating not-instantiated groupings
506 (resp. do not validate again the instantiated groupings). */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100507#define LYS_SET_VALUE 0x200 /**< value attribute is set */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100508#define LYS_SET_MIN 0x200 /**< min attribute is set */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200509#define LYS_SET_MAX 0x400 /**< max attribute is set */
Radek Krejcid505e3d2018-11-13 09:04:17 +0100510
511#define LYS_SET_BASE 0x0001 /**< type's flag for present base substatement */
512#define LYS_SET_BIT 0x0002 /**< type's flag for present bit substatement */
513#define LYS_SET_ENUM 0x0004 /**< type's flag for present enum substatement */
514#define LYS_SET_FRDIGITS 0x0008 /**< type's flag for present fraction-digits substatement */
515#define LYS_SET_LENGTH 0x0010 /**< type's flag for present length substatement */
516#define LYS_SET_PATH 0x0020 /**< type's flag for present path substatement */
517#define LYS_SET_PATTERN 0x0040 /**< type's flag for present pattern substatement */
518#define LYS_SET_RANGE 0x0080 /**< type's flag for present range substatement */
519#define LYS_SET_TYPE 0x0100 /**< type's flag for present type substatement */
520#define LYS_SET_REQINST 0x0200 /**< type's flag for present require-instance substatement */
Radek Krejciccd20f12019-02-15 14:12:27 +0100521#define LYS_SET_DFLT 0x0200 /**< flag to mark leaf/leaflist with own (or refined) default value, not a default value taken from its type, and default
Radek Krejci76b3e962018-12-14 17:01:25 +0100522 cases of choice. This information is important for refines, since it is prohibited to make leafs
523 with default statement mandatory. In case the default leaf value is taken from type, it is thrown
Radek Krejciccd20f12019-02-15 14:12:27 +0100524 away when it is refined to be mandatory node. Similarly it is used for deviations to distinguish
525 between own default or the default values taken from the type. */
526#define LYS_SET_UNITS 0x0400 /**< flag to know if the leaf's/leaflist's units are their own (flag set) or it is taken from the type. */
Radek Krejcif1421c22019-02-19 13:05:20 +0100527#define LYS_SET_CONFIG 0x0800 /**< flag to know if the config property was set explicitly (flag set) or it is inherited. */
Radek Krejci0e5d8382018-11-28 16:37:53 +0100528
Radek Krejcid3ca0632019-04-16 16:54:54 +0200529#define LYS_SINGLEQUOTED 0x100 /**< flag for single-quoted argument of an extension instance's substatement */
530#define LYS_DOUBLEQUOTED 0x200 /**< flag for double-quoted argument of an extension instance's substatement */
531
Radek Krejci693262f2019-04-29 15:23:20 +0200532#define LYS_ISENUM 0x200 /**< flag to simply distinguish type in struct lysc_type_bitenum_item */
533
Radek Krejcife909632019-02-12 15:34:42 +0100534#define LYS_FLAGS_COMPILED_MASK 0xff /**< mask for flags that maps to the compiled structures */
Radek Krejci4f28eda2018-11-12 11:46:16 +0100535/** @} */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200536
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200537/**
538 * @brief Generic YANG data node
539 */
540struct lysp_node {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100541 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200542 uint16_t nodetype; /**< type of the node (mandatory) */
543 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100544 struct lysp_node *next; /**< next sibling node (NULL if there is no one) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200545 const char *name; /**< node name (mandatory) */
546 const char *dsc; /**< description statement */
547 const char *ref; /**< reference statement */
548 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200549 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200550 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200551};
552
553/**
554 * @brief Extension structure of the lysp_node for YANG container
555 */
556struct lysp_node_container {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100557 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200558 uint16_t nodetype; /**< LYS_CONTAINER */
559 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
560 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
561 const char *name; /**< node name (mandatory) */
562 const char *dsc; /**< description statement */
563 const char *ref; /**< reference statement */
564 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200565 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200566 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200567
568 /* container */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200569 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200570 const char *presence; /**< presence description */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200571 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
572 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200573 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200574 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
575 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200576};
577
578struct lysp_node_leaf {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100579 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200580 uint16_t nodetype; /**< LYS_LEAF */
581 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
582 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
583 const char *name; /**< node name (mandatory) */
584 const char *dsc; /**< description statement */
585 const char *ref; /**< reference statement */
586 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200587 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200588 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200589
590 /* leaf */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200591 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200592 struct lysp_type type; /**< type of the leaf node (mandatory) */
593 const char *units; /**< units of the leaf's type */
594 const char *dflt; /**< default value */
595};
596
597struct lysp_node_leaflist {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100598 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200599 uint16_t nodetype; /**< LYS_LEAFLIST */
600 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
601 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
602 const char *name; /**< node name (mandatory) */
603 const char *dsc; /**< description statement */
604 const char *ref; /**< reference statement */
605 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200606 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200607 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200608
609 /* leaf-list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200610 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200611 struct lysp_type type; /**< type of the leaf node (mandatory) */
612 const char *units; /**< units of the leaf's type */
Radek Krejci151a5b72018-10-19 14:21:44 +0200613 const char **dflts; /**< list of default values ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200614 uint32_t min; /**< min-elements constraint */
615 uint32_t max; /**< max-elements constraint, 0 means unbounded */
616};
617
618struct lysp_node_list {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100619 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200620 uint16_t nodetype; /**< LYS_LIST */
621 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
622 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
623 const char *name; /**< node name (mandatory) */
624 const char *dsc; /**< description statement */
625 const char *ref; /**< reference statement */
626 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200627 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200628 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200629
630 /* list */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200631 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200632 const char *key; /**< keys specification */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200633 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
634 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200635 struct lysp_node *child; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200636 struct lysp_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
637 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200638 const char **uniques; /**< list of unique specifications ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200639 uint32_t min; /**< min-elements constraint */
640 uint32_t max; /**< max-elements constraint, 0 means unbounded */
641};
642
643struct lysp_node_choice {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100644 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200645 uint16_t nodetype; /**< LYS_CHOICE */
646 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
647 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
648 const char *name; /**< node name (mandatory) */
649 const char *dsc; /**< description statement */
650 const char *ref; /**< reference statement */
651 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200652 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200653 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200654
655 /* choice */
656 struct lysp_node *child; /**< list of data nodes (linked list) */
657 const char* dflt; /**< default case */
658};
659
660struct lysp_node_case {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100661 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200662 uint16_t nodetype; /**< LYS_CASE */
663 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
664 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
665 const char *name; /**< node name (mandatory) */
666 const char *dsc; /**< description statement */
667 const char *ref; /**< reference statement */
668 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200669 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200670 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200671
672 /* case */
673 struct lysp_node *child; /**< list of data nodes (linked list) */
674};
675
676struct lysp_node_anydata {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100677 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200678 uint16_t nodetype; /**< LYS_ANYXML || LYS_ANYDATA */
679 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
680 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
681 const char *name; /**< node name (mandatory) */
682 const char *dsc; /**< description statement */
683 const char *ref; /**< reference statement */
684 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200685 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200686 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200687
688 /* anyxml/anydata */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200689 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200690};
691
692struct lysp_node_uses {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100693 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
Michal Vaskob55f6c12018-09-12 11:13:15 +0200694 uint16_t nodetype; /**< LYS_USES */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200695 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
696 struct lysp_node *next; /**< pointer to the next sibling node (NULL if there is no one) */
697 const char *name; /**< grouping name reference (mandatory) */
698 const char *dsc; /**< description statement */
699 const char *ref; /**< reference statement */
700 struct lysp_when *when; /**< when statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200701 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200702 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200703
704 /* uses */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200705 struct lysp_refine *refines; /**< list of uses's refines ([sized array](@ref sizedarrays)) */
706 struct lysp_augment *augments; /**< list of uses's augment ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200707};
708
709/**
710 * @brief YANG input-stmt and output-stmt
711 */
712struct lysp_action_inout {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100713 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
714 uint16_t nodetype; /**< LYS_INOUT */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200715 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
716 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
717 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200718 struct lysp_node *data; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200719 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200720};
721
722/**
723 * @brief YANG rpc-stmt and action-stmt
724 */
725struct lysp_action {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100726 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
727 uint16_t nodetype; /**< LYS_ACTION */
728 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200729 const char *name; /**< grouping name reference (mandatory) */
730 const char *dsc; /**< description statement */
731 const char *ref; /**< reference statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200732 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200733 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
734 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci6eeb58f2019-02-22 16:29:37 +0100735 struct lysp_action_inout input; /**< RPC's/Action's input */
736 struct lysp_action_inout output; /**< RPC's/Action's output */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200737 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200738};
739
740/**
741 * @brief YANG notification-stmt
742 */
743struct lysp_notif {
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100744 struct lysp_node *parent; /**< parent node (NULL if this is a top-level node) */
745 uint16_t nodetype; /**< LYS_NOTIF */
746 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* values are allowed */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200747 const char *name; /**< grouping name reference (mandatory) */
748 const char *dsc; /**< description statement */
749 const char *ref; /**< reference statement */
Radek Krejci151a5b72018-10-19 14:21:44 +0200750 const char **iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200751 struct lysp_restr *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
752 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
753 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200754 struct lysp_node *data; /**< list of data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200755 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200756};
757
758/**
Radek Krejcif0fceb62018-09-05 14:58:45 +0200759 * @brief supported YANG schema version values
760 */
761typedef enum LYS_VERSION {
762 LYS_VERSION_UNDEF = 0, /**< no specific version, YANG 1.0 as default */
763 LYS_VERSION_1_0 = 1, /**< YANG 1.0 */
764 LYS_VERSION_1_1 = 2 /**< YANG 1.1 */
765} LYS_VERSION;
766
767/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200768 * @brief Printable YANG schema tree structure representing YANG module.
769 *
770 * Simple structure corresponding to the YANG format. The schema is only syntactically validated.
771 */
772struct lysp_module {
Radek Krejci0bcdaed2019-01-10 10:21:34 +0100773 struct lys_module *mod; /**< covering module structure */
774
Radek Krejcib7db73a2018-10-24 14:18:40 +0200775 struct lysp_revision *revs; /**< list of the module revisions ([sized array](@ref sizedarrays)), the first revision
776 in the list is always the last (newest) revision of the module */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200777 struct lysp_import *imports; /**< list of imported modules ([sized array](@ref sizedarrays)) */
778 struct lysp_include *includes; /**< list of included submodules ([sized array](@ref sizedarrays)) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200779 struct lysp_ext *extensions; /**< list of extension statements ([sized array](@ref sizedarrays)) */
780 struct lysp_feature *features; /**< list of feature definitions ([sized array](@ref sizedarrays)) */
781 struct lysp_ident *identities; /**< list of identities ([sized array](@ref sizedarrays)) */
782 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
783 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200784 struct lysp_node *data; /**< list of module's top-level data nodes (linked list) */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200785 struct lysp_augment *augments; /**< list of augments ([sized array](@ref sizedarrays)) */
786 struct lysp_action *rpcs; /**< list of RPCs ([sized array](@ref sizedarrays)) */
787 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
788 struct lysp_deviation *deviations; /**< list of deviations ([sized array](@ref sizedarrays)) */
789 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200790
Radek Krejci0bcdaed2019-01-10 10:21:34 +0100791 uint8_t parsing:1; /**< flag for circular check */
792};
793
794struct lysp_submodule {
795 const char *belongsto; /**< belongs to parent module (submodule - mandatory) */
796
797 struct lysp_revision *revs; /**< list of the module revisions ([sized array](@ref sizedarrays)), the first revision
798 in the list is always the last (newest) revision of the module */
799 struct lysp_import *imports; /**< list of imported modules ([sized array](@ref sizedarrays)) */
800 struct lysp_include *includes; /**< list of included submodules ([sized array](@ref sizedarrays)) */
801 struct lysp_ext *extensions; /**< list of extension statements ([sized array](@ref sizedarrays)) */
802 struct lysp_feature *features; /**< list of feature definitions ([sized array](@ref sizedarrays)) */
803 struct lysp_ident *identities; /**< list of identities ([sized array](@ref sizedarrays)) */
804 struct lysp_tpdf *typedefs; /**< list of typedefs ([sized array](@ref sizedarrays)) */
805 struct lysp_grp *groupings; /**< list of groupings ([sized array](@ref sizedarrays)) */
806 struct lysp_node *data; /**< list of module's top-level data nodes (linked list) */
807 struct lysp_augment *augments; /**< list of augments ([sized array](@ref sizedarrays)) */
808 struct lysp_action *rpcs; /**< list of RPCs ([sized array](@ref sizedarrays)) */
809 struct lysp_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
810 struct lysp_deviation *deviations; /**< list of deviations ([sized array](@ref sizedarrays)) */
811 struct lysp_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
812
813 uint8_t parsing:1; /**< flag for circular check */
814
Radek Krejci086c7132018-10-26 15:29:04 +0200815 uint8_t latest_revision:2; /**< flag to mark the latest available revision:
816 1 - the latest revision in searchdirs was not searched yet and this is the
817 latest revision in the current context
818 2 - searchdirs were searched and this is the latest available revision */
Radek Krejci0bcdaed2019-01-10 10:21:34 +0100819 const char *name; /**< name of the module (mandatory) */
820 const char *filepath; /**< path, if the schema was read from a file, NULL in case of reading from memory */
821 const char *prefix; /**< submodule belongsto prefix of main module (mandatory) */
822 const char *org; /**< party/company responsible for the module */
823 const char *contact; /**< contact information for the module */
824 const char *dsc; /**< description of the module */
825 const char *ref; /**< cross-reference for the module */
Radek Krejci086c7132018-10-26 15:29:04 +0200826 uint8_t version; /**< yang-version (LYS_VERSION values) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200827};
828
829/**
Radek Krejci3f5e3db2018-10-11 15:57:47 +0200830 * @brief Free the printable YANG schema tree structure.
831 *
832 * @param[in] module Printable YANG schema tree structure to free.
833 */
834void lysp_module_free(struct lysp_module *module);
835
836/**
Radek Krejcice8c1592018-10-29 15:35:51 +0100837 * @brief YANG extension instance
838 */
839struct lysc_ext_instance {
840 struct lyext_plugin *plugin; /**< pointer to the plugin implementing the extension (if present) */
841 void *parent; /**< pointer to the parent element holding the extension instance(s), use
842 ::lysc_ext_instance#parent_type to access the schema element */
843 const char *argument; /**< optional value of the extension's argument */
844 LYEXT_SUBSTMT insubstmt; /**< value identifying placement of the extension instance */
845 uint32_t insubstmt_index; /**< in case the instance is in a substatement that can appear multiple times,
846 this identifies the index of the substatement for this extension instance */
Radek Krejci2a408df2018-10-29 16:32:26 +0100847 LYEXT_PARENT parent_type; /**< type of the parent structure */
Radek Krejcice8c1592018-10-29 15:35:51 +0100848#if 0
Radek Krejcice8c1592018-10-29 15:35:51 +0100849 uint8_t ext_type; /**< extension type (#LYEXT_TYPE) */
850 uint8_t padding; /**< 32b padding */
Radek Krejcice8c1592018-10-29 15:35:51 +0100851 struct lys_module *module; /**< pointer to the extension instance's module (mandatory) */
852 LYS_NODE nodetype; /**< LYS_EXT */
853#endif
Radek Krejci2a408df2018-10-29 16:32:26 +0100854 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
855 void *priv; /**< private caller's data, not used by libyang */
Radek Krejcice8c1592018-10-29 15:35:51 +0100856};
857
858/**
Radek Krejcibd8d9ba2018-11-02 16:06:26 +0100859 * @brief Compiled YANG if-feature-stmt
860 */
861struct lysc_iffeature {
862 uint8_t *expr; /**< 2bits array describing the if-feature expression in prefix format, see @ref ifftokens */
863 struct lysc_feature **features; /**< array of pointers to the features used in expression ([sized array](@ref sizedarrays)) */
864};
865
866/**
Radek Krejci151a5b72018-10-19 14:21:44 +0200867 * @brief YANG import-stmt
868 */
869struct lysc_import {
Radek Krejci6d6e4e42018-10-29 13:28:19 +0100870 struct lys_module *module; /**< link to the imported module */
Radek Krejci151a5b72018-10-19 14:21:44 +0200871 const char *prefix; /**< prefix for the data from the imported schema (mandatory) */
Radek Krejcice8c1592018-10-29 15:35:51 +0100872 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci151a5b72018-10-19 14:21:44 +0200873};
874
875/**
Radek Krejcidd4e8d42018-10-16 14:55:43 +0200876 * @brief YANG when-stmt
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200877 */
Radek Krejcidd4e8d42018-10-16 14:55:43 +0200878struct lysc_when {
879 struct lyxp_expr *cond; /**< XPath when condition */
Radek Krejcic8b31002019-01-08 10:24:45 +0100880 const char *dsc; /**< description */
881 const char *ref; /**< reference */
Radek Krejci00b874b2019-02-12 10:54:50 +0100882 struct lysc_node *context; /**< context node for evaluating the expression */
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200883 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci00b874b2019-02-12 10:54:50 +0100884 uint32_t refcount; /**< reference counter since some of the when statements are shared among several nodes */
Radek Krejcidd4e8d42018-10-16 14:55:43 +0200885};
886
887/**
Radek Krejci2a408df2018-10-29 16:32:26 +0100888 * @brief YANG identity-stmt
889 */
890struct lysc_ident {
891 const char *name; /**< identity name (mandatory), including possible prefix */
Radek Krejcic8b31002019-01-08 10:24:45 +0100892 const char *dsc; /**< description */
893 const char *ref; /**< reference */
Radek Krejci693262f2019-04-29 15:23:20 +0200894 struct lys_module *module; /**< module structure */
Radek Krejci2a408df2018-10-29 16:32:26 +0100895 struct lysc_ident **derived; /**< list of (pointers to the) derived identities ([sized array](@ref sizedarrays)) */
896 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +0200897 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejci2a408df2018-10-29 16:32:26 +0100898 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_ values are allowed */
899};
900
901/**
Radek Krejcidd4e8d42018-10-16 14:55:43 +0200902 * @brief YANG feature-stmt
903 */
904struct lysc_feature {
905 const char *name; /**< feature name (mandatory) */
Radek Krejcic8b31002019-01-08 10:24:45 +0100906 const char *dsc; /**< description */
907 const char *ref; /**< reference */
Radek Krejci693262f2019-04-29 15:23:20 +0200908 struct lys_module *module; /**< module structure */
Radek Krejci151a5b72018-10-19 14:21:44 +0200909 struct lysc_feature **depfeatures;/**< list of pointers to other features depending on this one ([sized array](@ref sizedarrays)) */
Radek Krejcice8c1592018-10-29 15:35:51 +0100910 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +0200911 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcidd4e8d42018-10-16 14:55:43 +0200912 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_* and
913 #LYS_FENABLED values allowed */
914};
915
Radek Krejci151a5b72018-10-19 14:21:44 +0200916/**
917 * @defgroup ifftokens if-feature expression tokens
918 * Tokens of if-feature expression used in ::lysc_iffeature#expr
919 *
920 * @{
921 */
922#define LYS_IFF_NOT 0x00 /**< operand "not" */
923#define LYS_IFF_AND 0x01 /**< operand "and" */
924#define LYS_IFF_OR 0x02 /**< operand "or" */
925#define LYS_IFF_F 0x03 /**< feature */
926/**
927 * @}
928 */
929
930/**
Radek Krejcib7db73a2018-10-24 14:18:40 +0200931 * @brief Compiled YANG revision statement
932 */
933struct lysc_revision {
934 char date[LY_REV_SIZE]; /**< revision-date (mandatory) */
935 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
936};
937
Radek Krejci2167ee12018-11-02 16:09:07 +0100938struct lysc_range {
Radek Krejci4f28eda2018-11-12 11:46:16 +0100939 struct lysc_range_part {
Radek Krejci693262f2019-04-29 15:23:20 +0200940 union { /**< min boundary */
Radek Krejcie7b95092019-05-15 11:03:07 +0200941 int64_t min_64; /**< for int8, int16, int32, int64 and decimal64 ( >= LY_TYPE_DEC64) */
942 uint64_t min_u64; /**< for uint8, uint16, uint32, uint64, string and binary ( < LY_TYPE_DEC64) */
Radek Krejci2167ee12018-11-02 16:09:07 +0100943 };
Radek Krejci693262f2019-04-29 15:23:20 +0200944 union { /**< max boundary */
Radek Krejcie7b95092019-05-15 11:03:07 +0200945 int64_t max_64; /**< for int8, int16, int32, int64 and decimal64 ( >= LY_TYPE_DEC64) */
946 uint64_t max_u64; /**< for uint8, uint16, uint32, uint64, string and binary ( < LY_TYPE_DEC64) */
Radek Krejci2167ee12018-11-02 16:09:07 +0100947 };
Radek Krejci4f28eda2018-11-12 11:46:16 +0100948 } *parts; /**< compiled range expression ([sized array](@ref sizedarrays)) */
Radek Krejcic8b31002019-01-08 10:24:45 +0100949 const char *dsc; /**< description */
950 const char *ref; /**< reference */
Radek Krejci2167ee12018-11-02 16:09:07 +0100951 const char *emsg; /**< error-message */
952 const char *eapptag; /**< error-app-tag value */
953 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
954};
955
956struct lysc_pattern {
Radek Krejci54579462019-04-30 12:47:06 +0200957 const char *expr; /**< original, not compiled, regular expression */
958 pcre2_code *code; /**< compiled regular expression */
Radek Krejcic8b31002019-01-08 10:24:45 +0100959 const char *dsc; /**< description */
960 const char *ref; /**< reference */
Radek Krejci2167ee12018-11-02 16:09:07 +0100961 const char *emsg; /**< error-message */
962 const char *eapptag; /**< error-app-tag value */
963 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci4586a022018-11-13 11:29:26 +0100964 uint32_t inverted:1; /**< invert-match flag */
965 uint32_t refcount:31; /**< reference counter */
Radek Krejci2167ee12018-11-02 16:09:07 +0100966};
967
968struct lysc_must {
969 struct lys_module *module; /**< module where the must was defined */
970 struct lyxp_expr *cond; /**< XPath when condition */
Radek Krejcic8b31002019-01-08 10:24:45 +0100971 const char *dsc; /**< description */
972 const char *ref; /**< reference */
Radek Krejci2167ee12018-11-02 16:09:07 +0100973 const char *emsg; /**< error-message */
974 const char *eapptag; /**< error-app-tag value */
975 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
976};
977
978struct lysc_type {
Radek Krejci4f28eda2018-11-12 11:46:16 +0100979 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcia1911222019-07-22 17:24:50 +0200980 struct lyd_value *dflt; /**< type's default value if any */
Radek Krejcid0ef1af2019-07-23 12:22:05 +0200981 struct lys_module *dflt_mod; /**< module where the lysc_type::dflt value was defined (needed to correctly map prefixes). */
Radek Krejcie7b95092019-05-15 11:03:07 +0200982 struct lysc_type_plugin *plugin; /**< type's plugin with built-in as well as user functions to canonize or validate the value of the type */
Radek Krejci2167ee12018-11-02 16:09:07 +0100983 LY_DATA_TYPE basetype; /**< Base type of the type */
984 uint32_t refcount; /**< reference counter for type sharing */
985};
986
987struct lysc_type_num {
Radek Krejci4f28eda2018-11-12 11:46:16 +0100988 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcia1911222019-07-22 17:24:50 +0200989 struct lyd_value *dflt; /**< type's default value if any */
Radek Krejcid0ef1af2019-07-23 12:22:05 +0200990 struct lys_module *dflt_mod; /**< module where the lysc_type::dflt value was defined (needed to correctly map prefixes). */
Radek Krejcie7b95092019-05-15 11:03:07 +0200991 struct lysc_type_plugin *plugin; /**< type's plugin with built-in as well as user functions to canonize or validate the value of the type */
Radek Krejci2167ee12018-11-02 16:09:07 +0100992 LY_DATA_TYPE basetype; /**< Base type of the type */
993 uint32_t refcount; /**< reference counter for type sharing */
994 struct lysc_range *range; /**< Optional range limitation */
995};
996
997struct lysc_type_dec {
Radek Krejci4f28eda2018-11-12 11:46:16 +0100998 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcia1911222019-07-22 17:24:50 +0200999 struct lyd_value *dflt; /**< type's default value if any */
Radek Krejcid0ef1af2019-07-23 12:22:05 +02001000 struct lys_module *dflt_mod; /**< module where the lysc_type::dflt value was defined (needed to correctly map prefixes). */
Radek Krejcie7b95092019-05-15 11:03:07 +02001001 struct lysc_type_plugin *plugin; /**< type's plugin with built-in as well as user functions to canonize or validate the value of the type */
Radek Krejci2167ee12018-11-02 16:09:07 +01001002 LY_DATA_TYPE basetype; /**< Base type of the type */
1003 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci6cba4292018-11-15 17:33:29 +01001004 uint8_t fraction_digits; /**< fraction digits specification */
Radek Krejci2167ee12018-11-02 16:09:07 +01001005 struct lysc_range *range; /**< Optional range limitation */
1006};
1007
1008struct lysc_type_str {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001009 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcia1911222019-07-22 17:24:50 +02001010 struct lyd_value *dflt; /**< type's default value if any */
Radek Krejcid0ef1af2019-07-23 12:22:05 +02001011 struct lys_module *dflt_mod; /**< module where the lysc_type::dflt value was defined (needed to correctly map prefixes). */
Radek Krejcie7b95092019-05-15 11:03:07 +02001012 struct lysc_type_plugin *plugin; /**< type's plugin with built-in as well as user functions to canonize or validate the value of the type */
Radek Krejci2167ee12018-11-02 16:09:07 +01001013 LY_DATA_TYPE basetype; /**< Base type of the type */
1014 uint32_t refcount; /**< reference counter for type sharing */
1015 struct lysc_range *length; /**< Optional length limitation */
Radek Krejci4586a022018-11-13 11:29:26 +01001016 struct lysc_pattern **patterns; /**< Optional list of pointers to pattern limitations ([sized array](@ref sizedarrays)) */
Radek Krejci2167ee12018-11-02 16:09:07 +01001017};
1018
Radek Krejci693262f2019-04-29 15:23:20 +02001019struct lysc_type_bitenum_item {
1020 const char *name; /**< enumeration identifier */
1021 const char *dsc; /**< description */
1022 const char *ref; /**< reference */
1023 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1024 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1025 union {
1026 int32_t value; /**< integer value associated with the enumeration */
1027 uint32_t position; /**< non-negative integer value associated with the bit */
1028 };
1029 uint16_t flags; /**< [schema node flags](@ref snodeflags) - only LYS_STATUS_ and LYS_SET_VALUE
1030 values are allowed */
1031};
1032
Radek Krejci2167ee12018-11-02 16:09:07 +01001033struct lysc_type_enum {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001034 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001035 const char *dflt; /**< type's default value if any */
Radek Krejcid0ef1af2019-07-23 12:22:05 +02001036 struct lys_module *dflt_mod; /**< module where the lysc_type::dflt value was defined (needed to correctly map prefixes). */
Radek Krejcie7b95092019-05-15 11:03:07 +02001037 struct lysc_type_plugin *plugin; /**< type's plugin with built-in as well as user functions to canonize or validate the value of the type */
Radek Krejci2167ee12018-11-02 16:09:07 +01001038 LY_DATA_TYPE basetype; /**< Base type of the type */
1039 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci693262f2019-04-29 15:23:20 +02001040 struct lysc_type_bitenum_item *enums; /**< enumerations list ([sized array](@ref sizedarrays)), mandatory (at least 1 item) */
1041};
1042
1043struct lysc_type_bits {
1044 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1045 const char *dflt; /**< type's default value if any */
Radek Krejcid0ef1af2019-07-23 12:22:05 +02001046 struct lys_module *dflt_mod; /**< module where the lysc_type::dflt value was defined (needed to correctly map prefixes). */
Radek Krejcie7b95092019-05-15 11:03:07 +02001047 struct lysc_type_plugin *plugin; /**< type's plugin with built-in as well as user functions to canonize or validate the value of the type */
Radek Krejci693262f2019-04-29 15:23:20 +02001048 LY_DATA_TYPE basetype; /**< Base type of the type */
1049 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci849a62a2019-05-22 15:29:05 +02001050 struct lysc_type_bitenum_item *bits; /**< bits list ([sized array](@ref sizedarrays)), mandatory (at least 1 item),
1051 the items are ordered by their position value. */
Radek Krejci2167ee12018-11-02 16:09:07 +01001052};
1053
1054struct lysc_type_leafref {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001055 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001056 const char *dflt; /**< type's default value if any */
Radek Krejcid0ef1af2019-07-23 12:22:05 +02001057 struct lys_module *dflt_mod; /**< module where the lysc_type::dflt value was defined (needed to correctly map prefixes). */
Radek Krejcie7b95092019-05-15 11:03:07 +02001058 struct lysc_type_plugin *plugin; /**< type's plugin with built-in as well as user functions to canonize or validate the value of the type */
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 Krejcia3045382018-11-22 14:30:31 +01001061 const char* path; /**< target path */
Radek Krejci96a0bfd2018-11-22 15:25:06 +01001062 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 +01001063 struct lysc_type *realtype; /**< pointer to the real (first non-leafref in possible leafrefs chain) type. */
Radek Krejci2167ee12018-11-02 16:09:07 +01001064 uint8_t require_instance; /**< require-instance flag */
1065};
1066
1067struct lysc_type_identityref {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001068 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001069 const char *dflt; /**< type's default value if any */
Radek Krejcid0ef1af2019-07-23 12:22:05 +02001070 struct lys_module *dflt_mod; /**< module where the lysc_type::dflt value was defined (needed to correctly map prefixes). */
Radek Krejcie7b95092019-05-15 11:03:07 +02001071 struct lysc_type_plugin *plugin; /**< type's plugin with built-in as well as user functions to canonize or validate the value of the type */
Radek Krejci2167ee12018-11-02 16:09:07 +01001072 LY_DATA_TYPE basetype; /**< Base type of the type */
1073 uint32_t refcount; /**< reference counter for type sharing */
Radek Krejci555cb5b2018-11-16 14:54:33 +01001074 struct lysc_ident **bases; /**< list of pointers to the base identities ([sized array](@ref sizedarrays)),
Radek Krejci2167ee12018-11-02 16:09:07 +01001075 mandatory (at least 1 item) */
1076};
1077
1078struct lysc_type_instanceid {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001079 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001080 const char *dflt; /**< type's default value if any */
Radek Krejcid0ef1af2019-07-23 12:22:05 +02001081 struct lys_module *dflt_mod; /**< module where the lysc_type::dflt value was defined (needed to correctly map prefixes). */
Radek Krejcie7b95092019-05-15 11:03:07 +02001082 struct lysc_type_plugin *plugin; /**< type's plugin with built-in as well as user functions to canonize or validate the value of the type */
Radek Krejci2167ee12018-11-02 16:09:07 +01001083 LY_DATA_TYPE basetype; /**< Base type of the type */
1084 uint32_t refcount; /**< reference counter for type sharing */
1085 uint8_t require_instance; /**< require-instance flag */
1086};
1087
Radek Krejci2167ee12018-11-02 16:09:07 +01001088struct lysc_type_union {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001089 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001090 const char *dflt; /**< type's default value if any */
Radek Krejcid0ef1af2019-07-23 12:22:05 +02001091 struct lys_module *dflt_mod; /**< module where the lysc_type::dflt value was defined (needed to correctly map prefixes). */
Radek Krejcie7b95092019-05-15 11:03:07 +02001092 struct lysc_type_plugin *plugin; /**< type's plugin with built-in as well as user functions to canonize or validate the value of the type */
Radek Krejci2167ee12018-11-02 16:09:07 +01001093 LY_DATA_TYPE basetype; /**< Base type of the type */
1094 uint32_t refcount; /**< reference counter for type sharing */
1095 struct lysc_type **types; /**< list of types in the union ([sized array](@ref sizedarrays)), mandatory (at least 1 item) */
1096};
1097
1098struct lysc_type_bin {
Radek Krejci4f28eda2018-11-12 11:46:16 +01001099 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci01342af2019-01-03 15:18:08 +01001100 const char *dflt; /**< type's default value if any */
Radek Krejcid0ef1af2019-07-23 12:22:05 +02001101 struct lys_module *dflt_mod; /**< module where the lysc_type::dflt value was defined (needed to correctly map prefixes). */
Radek Krejcie7b95092019-05-15 11:03:07 +02001102 struct lysc_type_plugin *plugin; /**< type's plugin with built-in as well as user functions to canonize or validate the value of the type */
Radek Krejci2167ee12018-11-02 16:09:07 +01001103 LY_DATA_TYPE basetype; /**< Base type of the type */
1104 uint32_t refcount; /**< reference counter for type sharing */
1105 struct lysc_range *length; /**< Optional length limitation */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001106};
1107
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001108struct lysc_action_inout {
1109 struct lysc_node *data; /**< first child node (linked list) */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001110 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1111};
1112
Radek Krejci056d0a82018-12-06 16:57:25 +01001113struct lysc_action {
1114 uint16_t nodetype; /**< LYS_ACTION */
1115 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejci95710c92019-02-11 15:49:55 +01001116 struct lys_module *module; /**< module structure */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001117 struct lysp_action *sp; /**< simply parsed (SP) original of the node, NULL if the SP schema was removed or in case of implicit case node. */
1118 struct lysc_node *parent; /**< parent node (NULL in case of top level node - RPC) */
1119
Radek Krejcifc11bd72019-04-11 16:00:05 +02001120 struct lysc_ext_instance *input_exts; /**< list of the extension instances of input ([sized array](@ref sizedarrays)) */
1121 struct lysc_ext_instance *output_exts; /**< list of the extension instances of outpu ([sized array](@ref sizedarrays)) */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001122
Radek Krejci056d0a82018-12-06 16:57:25 +01001123 const char *name; /**< action/RPC name (mandatory) */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001124 const char *dsc; /**< description */
1125 const char *ref; /**< reference */
1126
Radek Krejcifc11bd72019-04-11 16:00:05 +02001127 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1128 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
1129
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001130 struct lysc_action_inout input; /**< RPC's/action's input */
1131 struct lysc_action_inout output; /**< RPC's/action's output */
1132
Radek Krejci056d0a82018-12-06 16:57:25 +01001133};
1134
1135struct lysc_notif {
1136 uint16_t nodetype; /**< LYS_NOTIF */
1137 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejci95710c92019-02-11 15:49:55 +01001138 struct lys_module *module; /**< module structure */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001139 struct lysp_notif *sp; /**< simply parsed (SP) original of the node, NULL if the SP schema was removed or in case of implicit case node. */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001140 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1141
Radek Krejcifc11bd72019-04-11 16:00:05 +02001142 struct lysc_node *data; /**< first child node (linked list) */
1143 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1144
Radek Krejci056d0a82018-12-06 16:57:25 +01001145 const char *name; /**< Notification name (mandatory) */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001146 const char *dsc; /**< description */
1147 const char *ref; /**< reference */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001148
1149 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
1150 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejci056d0a82018-12-06 16:57:25 +01001151};
1152
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001153/**
Radek Krejci0af5f5d2018-09-07 15:00:30 +02001154 * @brief Compiled YANG data node
1155 */
1156struct lysc_node {
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001157 uint16_t nodetype; /**< type of the node (mandatory) */
1158 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001159 struct lys_module *module; /**< module structure */
1160 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. */
1161 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1162 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1163 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1164 never NULL. If there is no sibling node, pointer points to the node
1165 itself. In case of the first node, this pointer points to the last
1166 node in the list. */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001167 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001168 const char *dsc; /**< description */
1169 const char *ref; /**< reference */
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001170 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci056d0a82018-12-06 16:57:25 +01001171 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001172 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001173};
1174
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001175struct lysc_node_container {
1176 uint16_t nodetype; /**< LYS_CONTAINER */
1177 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1178 struct lys_module *module; /**< module structure */
1179 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. */
1180 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1181 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1182 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1183 never NULL. If there is no sibling node, pointer points to the node
1184 itself. In case of the first node, this pointer points to the last
1185 node in the list. */
1186 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001187 const char *dsc; /**< description */
1188 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001189 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001190 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001191 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001192
1193 struct lysc_node *child; /**< first child node (linked list) */
1194 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1195 struct lysc_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
1196 struct lysc_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001197};
1198
Radek Krejcia3045382018-11-22 14:30:31 +01001199struct lysc_node_case {
Radek Krejci056d0a82018-12-06 16:57:25 +01001200 uint16_t nodetype; /**< LYS_CASE */
1201 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1202 struct lys_module *module; /**< module structure */
1203 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. */
1204 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1205 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1206 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1207 never NULL. If there is no sibling node, pointer points to the node
1208 itself. In case of the first node, this pointer points to the last
1209 node in the list. */
Radek Krejcia3045382018-11-22 14:30:31 +01001210 const char *name; /**< name of the case, including the implicit case */
Radek Krejci12fb9142019-01-08 09:45:30 +01001211 const char *dsc; /**< description */
1212 const char *ref; /**< reference */
Radek Krejci056d0a82018-12-06 16:57:25 +01001213 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci056d0a82018-12-06 16:57:25 +01001214 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001215 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Radek Krejci056d0a82018-12-06 16:57:25 +01001216
Radek Krejcia3045382018-11-22 14:30:31 +01001217 struct lysc_node *child; /**< first child node of the case (linked list). Note that all the children of all the sibling cases are linked
Radek Krejcife13da42019-02-15 14:51:01 +01001218 each other as siblings with the parent pointer pointing to appropriate case node. */
Radek Krejcia3045382018-11-22 14:30:31 +01001219};
1220
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001221struct lysc_node_choice {
1222 uint16_t nodetype; /**< LYS_CHOICE */
1223 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1224 struct lys_module *module; /**< module structure */
1225 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. */
1226 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1227 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1228 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1229 never NULL. If there is no sibling node, pointer points to the node
1230 itself. In case of the first node, this pointer points to the last
1231 node in the list. */
1232 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001233 const char *dsc; /**< description */
1234 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001235 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci056d0a82018-12-06 16:57:25 +01001236 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001237 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001238
Radek Krejcia9026eb2018-12-12 16:04:47 +01001239 struct lysc_node_case *cases; /**< list of the cases (linked list). Note that all the children of all the cases are linked each other
1240 as siblings. Their parent pointers points to the specific case they belongs to, so distinguish the
1241 case is simple. */
Radek Krejci056d0a82018-12-06 16:57:25 +01001242 struct lysc_node_case *dflt; /**< default case of the choice, only a pointer into the cases array. */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001243};
1244
1245struct lysc_node_leaf {
1246 uint16_t nodetype; /**< LYS_LEAF */
1247 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1248 struct lys_module *module; /**< module structure */
1249 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. */
1250 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1251 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1252 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1253 never NULL. If there is no sibling node, pointer points to the node
1254 itself. In case of the first node, this pointer points to the last
1255 node in the list. */
1256 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001257 const char *dsc; /**< description */
1258 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001259 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001260 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001261 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Radek Krejci4f28eda2018-11-12 11:46:16 +01001262
1263 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1264 struct lysc_type *type; /**< type of the leaf node (mandatory) */
Radek Krejcib57cf1e2018-11-23 14:07:05 +01001265
Radek Krejci4f28eda2018-11-12 11:46:16 +01001266 const char *units; /**< units of the leaf's type */
Radek Krejcia1911222019-07-22 17:24:50 +02001267 struct lyd_value *dflt; /**< default value */
Radek Krejcid0ef1af2019-07-23 12:22:05 +02001268 struct lys_module *dflt_mod; /**< module where the lysc_node_leaf::dflt value was defined (needed to correctly map prefixes). */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001269};
1270
1271struct lysc_node_leaflist {
1272 uint16_t nodetype; /**< LYS_LEAFLIST */
1273 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1274 struct lys_module *module; /**< module structure */
1275 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. */
1276 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1277 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1278 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1279 never NULL. If there is no sibling node, pointer points to the node
1280 itself. In case of the first node, this pointer points to the last
1281 node in the list. */
1282 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001283 const char *dsc; /**< description */
1284 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001285 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejcib57cf1e2018-11-23 14:07:05 +01001286 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001287 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Radek Krejcib57cf1e2018-11-23 14:07:05 +01001288
1289 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1290 struct lysc_type *type; /**< type of the leaf node (mandatory) */
1291
Radek Krejci0e5d8382018-11-28 16:37:53 +01001292 const char *units; /**< units of the leaf's type */
Radek Krejcid0ef1af2019-07-23 12:22:05 +02001293 struct lyd_value **dflts; /**< list ([sized array](@ref sizedarrays)) of default values */
1294 struct lys_module **dflts_mods; /**< list ([sized array](@ref sizedarrays)) of modules where the lysc_node_leaflist::dflts values were defined
1295 (needed to correctly map prefixes). */
Radek Krejci0e5d8382018-11-28 16:37:53 +01001296 uint32_t min; /**< min-elements constraint */
1297 uint32_t max; /**< max-elements constraint */
1298
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001299};
1300
1301struct lysc_node_list {
1302 uint16_t nodetype; /**< LYS_LIST */
1303 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1304 struct lys_module *module; /**< module structure */
1305 struct lysp_node *sp; /**< simply parsed (SP) original of the node, NULL if the SP schema was removed or in case of implicit case node. */
1306 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1307 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1308 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1309 never NULL. If there is no sibling node, pointer points to the node
1310 itself. In case of the first node, this pointer points to the last
1311 node in the list. */
1312 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001313 const char *dsc; /**< description */
1314 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001315 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci9bb94eb2018-12-04 16:48:35 +01001316 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001317 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Radek Krejci9bb94eb2018-12-04 16:48:35 +01001318
1319 struct lysc_node *child; /**< first child node (linked list) */
1320 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
1321 struct lysc_action *actions; /**< list of actions ([sized array](@ref sizedarrays)) */
1322 struct lysc_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
1323
1324 struct lysc_node_leaf **keys; /**< list of pointers to the keys ([sized array](@ref sizedarrays)) */
1325 struct lysc_node_leaf ***uniques; /**< list of sized arrays of pointers to the unique nodes ([sized array](@ref sizedarrays)) */
1326 uint32_t min; /**< min-elements constraint */
1327 uint32_t max; /**< max-elements constraint */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001328};
1329
1330struct lysc_node_anydata {
1331 uint16_t nodetype; /**< LYS_ANYXML or LYS_ANYDATA */
1332 uint16_t flags; /**< [schema node flags](@ref snodeflags) */
1333 struct lys_module *module; /**< module structure */
1334 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. */
1335 struct lysc_node *parent; /**< parent node (NULL in case of top level node) */
1336 struct lysc_node *next; /**< next sibling node (NULL if there is no one) */
1337 struct lysc_node *prev; /**< pointer to the previous sibling node \note Note that this pointer is
1338 never NULL. If there is no sibling node, pointer points to the node
1339 itself. In case of the first node, this pointer points to the last
1340 node in the list. */
1341 const char *name; /**< node name (mandatory) */
Radek Krejci12fb9142019-01-08 09:45:30 +01001342 const char *dsc; /**< description */
1343 const char *ref; /**< reference */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001344 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci056d0a82018-12-06 16:57:25 +01001345 struct lysc_iffeature *iffeatures; /**< list of if-feature expressions ([sized array](@ref sizedarrays)) */
Radek Krejcifc11bd72019-04-11 16:00:05 +02001346 struct lysc_when **when; /**< list of pointers to when statements ([sized array](@ref sizedarrays)) */
Radek Krejci9800fb82018-12-13 14:26:23 +01001347
1348 struct lysc_must *musts; /**< list of must restrictions ([sized array](@ref sizedarrays)) */
Radek Krejcibd8d9ba2018-11-02 16:06:26 +01001349};
1350
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001351/**
1352 * @brief Compiled YANG schema tree structure representing YANG module.
1353 *
1354 * Semantically validated YANG schema tree for data tree parsing.
1355 * Contains only the necessary information for the data validation.
1356 */
1357struct lysc_module {
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001358 struct lys_module *mod; /**< covering module structure */
Radek Krejci151a5b72018-10-19 14:21:44 +02001359 struct lysc_import *imports; /**< list of imported modules ([sized array](@ref sizedarrays)) */
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001360
Radek Krejcie53a8dc2018-10-17 12:52:40 +02001361 struct lysc_feature *features; /**< list of feature definitions ([sized array](@ref sizedarrays)) */
Radek Krejci2a408df2018-10-29 16:32:26 +01001362 struct lysc_ident *identities; /**< list of identities ([sized array](@ref sizedarrays)) */
1363 struct lysc_node *data; /**< list of module's top-level data nodes (linked list) */
1364 struct lysc_action *rpcs; /**< list of RPCs ([sized array](@ref sizedarrays)) */
1365 struct lysc_notif *notifs; /**< list of notifications ([sized array](@ref sizedarrays)) */
Radek Krejcice8c1592018-10-29 15:35:51 +01001366 struct lysc_ext_instance *exts; /**< list of the extension instances ([sized array](@ref sizedarrays)) */
Radek Krejci0af5f5d2018-09-07 15:00:30 +02001367};
1368
1369/**
Radek Krejci53ea6152018-12-13 15:21:15 +01001370 * @brief Get the groupings sized array of the given (parsed) schema node.
1371 * Decides the node's type and in case it has a groupings array, returns it.
1372 * @param[in] node Node to examine.
1373 * @return The node's groupings sized array if any, NULL otherwise.
1374 */
1375const struct lysp_grp *lysp_node_groupings(const struct lysp_node *node);
1376
1377/**
Radek Krejci056d0a82018-12-06 16:57:25 +01001378 * @brief Get the typedefs sized array of the given (parsed) schema node.
1379 * Decides the node's type and in case it has a typedefs array, returns it.
1380 * @param[in] node Node to examine.
1381 * @return The node's typedefs sized array if any, NULL otherwise.
1382 */
1383const struct lysp_tpdf *lysp_node_typedefs(const struct lysp_node *node);
1384
1385/**
1386 * @brief Get the actions/RPCs sized array of the given (parsed) schema node.
1387 * Decides the node's type and in case it has a actions/RPCs array, returns it.
1388 * @param[in] node Node to examine.
1389 * @return The node's actions/RPCs sized array if any, NULL otherwise.
1390 */
1391const struct lysp_action *lysp_node_actions(const struct lysp_node *node);
1392
1393/**
1394 * @brief Get the Notifications sized array of the given (parsed) schema node.
1395 * Decides the node's type and in case it has a Notifications array, returns it.
1396 * @param[in] node Node to examine.
1397 * @return The node's Notifications sized array if any, NULL otherwise.
1398 */
1399const struct lysp_notif *lysp_node_notifs(const struct lysp_node *node);
1400
1401/**
1402 * @brief Get the children linked list of the given (parsed) schema node.
1403 * Decides the node's type and in case it has a children list, returns it.
1404 * @param[in] node Node to examine.
1405 * @return The node's children linked list if any, NULL otherwise.
1406 */
1407const struct lysp_node *lysp_node_children(const struct lysp_node *node);
1408
1409/**
1410 * @brief Get the actions/RPCs sized array of the given (compiled) schema node.
1411 * Decides the node's type and in case it has a actions/RPCs array, returns it.
1412 * @param[in] node Node to examine.
1413 * @return The node's actions/RPCs sized array if any, NULL otherwise.
1414 */
1415const struct lysc_action *lysc_node_actions(const struct lysc_node *node);
1416
1417/**
1418 * @brief Get the Notifications sized array of the given (compiled) schema node.
1419 * Decides the node's type and in case it has a Notifications array, returns it.
1420 * @param[in] node Node to examine.
1421 * @return The node's Notifications sized array if any, NULL otherwise.
1422 */
1423const struct lysc_notif *lysc_node_notifs(const struct lysc_node *node);
1424
1425/**
1426 * @brief Get the children linked list of the given (compiled) schema node.
1427 * Decides the node's type and in case it has a children list, returns it.
1428 * @param[in] node Node to examine.
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001429 * @param[in] flags Config flag to distinguish input (LYS_CONFIG_W) and output (LYS_CONFIG_R) data in case of RPC/action node.
Radek Krejci056d0a82018-12-06 16:57:25 +01001430 * @return The node's children linked list if any, NULL otherwise.
1431 */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001432const struct lysc_node *lysc_node_children(const struct lysc_node *node, uint16_t flags);
Radek Krejci056d0a82018-12-06 16:57:25 +01001433
1434/**
Radek Krejci151a5b72018-10-19 14:21:44 +02001435 * @brief Get how the if-feature statement currently evaluates.
1436 *
1437 * @param[in] iff Compiled if-feature statement to evaluate.
1438 * @return If the statement evaluates to true, 1 is returned. 0 is returned when the statement evaluates to false.
1439 */
1440int lysc_iffeature_value(const struct lysc_iffeature *iff);
1441
1442/**
1443 * @brief Get the current status of the provided feature.
1444 *
1445 * @param[in] feature Compiled feature statement to examine.
1446 * @return
1447 * - 1 if feature is enabled,
1448 * - 0 if feature is disabled,
1449 * - -1 in case of error (invalid argument)
1450 */
1451int lysc_feature_value(const struct lysc_feature *feature);
1452
1453/**
Radek Krejci327de162019-06-14 12:52:07 +02001454 * @brief Generate path of the given node in the requested format.
1455 *
1456 * @param[in] node Schema path of this node will be generated.
1457 * @param[in] pathtype Format of the path to generate.
Radek Krejci1c0c3442019-07-23 16:08:47 +02001458 * @param[in,out] buffer Prepared buffer of the @p buflen length to store the generated path.
1459 * If NULL, memory for the complete path is allocated.
1460 * @param[in] buflen Size of the provided @p buffer.
Radek Krejci327de162019-06-14 12:52:07 +02001461 * @return NULL in case of memory allocation error, path of the node otherwise.
Radek Krejci1c0c3442019-07-23 16:08:47 +02001462 * In case the @p buffer is NULL, the returned string is dynamically allocated and caller is responsible to free it.
Radek Krejci327de162019-06-14 12:52:07 +02001463 */
Radek Krejci1c0c3442019-07-23 16:08:47 +02001464char *lysc_path(struct lysc_node *node, LY_PATH_TYPE pathtype, char *buffer, size_t buflen);
Radek Krejci327de162019-06-14 12:52:07 +02001465
1466/**
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001467 * @brief Available YANG schema tree structures representing YANG module.
1468 */
1469struct lys_module {
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001470 struct ly_ctx *ctx; /**< libyang context of the module (mandatory) */
1471 const char *name; /**< name of the module (mandatory) */
Radek Krejci0af46292019-01-11 16:02:31 +01001472 const char *revision; /**< revision of the module (if present) */
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001473 const char *ns; /**< namespace of the module (module - mandatory) */
1474 const char *prefix; /**< module prefix or submodule belongsto prefix of main module (mandatory) */
1475 const char *filepath; /**< path, if the schema was read from a file, NULL in case of reading from memory */
1476 const char *org; /**< party/company responsible for the module */
1477 const char *contact; /**< contact information for the module */
1478 const char *dsc; /**< description of the module */
1479 const char *ref; /**< cross-reference for the module */
1480
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001481 struct lysp_module *parsed; /**< Simply parsed (unresolved) YANG schema tree */
Radek Krejci0af46292019-01-11 16:02:31 +01001482 struct lysc_module *compiled; /**< Compiled and fully validated YANG schema tree for data parsing.
1483 Available only for implemented modules. */
1484 struct lysc_feature *off_features;/**< List of pre-compiled features of the module in non implemented modules ([sized array](@ref sizedarrays)).
1485 These features are always disabled and cannot be enabled until the module
1486 become implemented. The features are present in this form to allow their linkage
1487 from if-feature statements of the compiled schemas and their proper use in case
1488 the module became implemented in future (no matter if implicitly via augment/deviate
1489 or explicitly via ly_ctx_module_implement()). */
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001490
Radek Krejci95710c92019-02-11 15:49:55 +01001491 uint8_t implemented; /**< flag if the module is implemented, not just imported. The module is implemented if
1492 the flag has non-zero value. Specific values are used internally:
1493 1 - implemented module
1494 2 - recently implemented module by dependency, it can be reverted in rollback procedure */
1495 uint8_t latest_revision; /**< flag to mark the latest available revision:
Radek Krejci0bcdaed2019-01-10 10:21:34 +01001496 1 - the latest revision in searchdirs was not searched yet and this is the
1497 latest revision in the current context
1498 2 - searchdirs were searched and this is the latest available revision */
1499 uint8_t version; /**< yang-version (LYS_VERSION values) */
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001500};
1501
Radek Krejci151a5b72018-10-19 14:21:44 +02001502/**
1503 * @brief Enable specified feature in the module
1504 *
1505 * By default, when the module is loaded by libyang parser, all features are disabled.
1506 *
Radek Krejcica3db002018-11-01 10:31:01 +01001507 * If all features are being enabled, it must be possible respecting their if-feature conditions. For example,
1508 * enabling all features on the following feature set will fail since it is not possible to enable both features
1509 * (and it is unclear which of them should be enabled then). In this case the LY_EDENIED is returned and the feature
1510 * is untouched.
1511 *
1512 * feature f1;
1513 * feature f2 { if-feature 'not f1';}
1514 *
Radek Krejci151a5b72018-10-19 14:21:44 +02001515 * @param[in] module Module where the feature will be enabled.
1516 * @param[in] feature Name of the feature to enable. To enable all features at once, use asterisk (`*`) character.
1517 * @return LY_ERR value.
1518 */
Radek Krejcied5acc52019-04-25 15:57:04 +02001519LY_ERR lys_feature_enable(const struct lys_module *module, const char *feature);
Radek Krejci151a5b72018-10-19 14:21:44 +02001520
1521/**
1522 * @brief Disable specified feature in the module
1523 *
1524 * By default, when the module is loaded by libyang parser, all features are disabled.
1525 *
1526 * @param[in] module Module where the feature will be disabled.
1527 * @param[in] feature Name of the feature to disable. To disable all features at once, use asterisk (`*`) character.
1528 * @return LY_ERR value
1529 */
Radek Krejcied5acc52019-04-25 15:57:04 +02001530LY_ERR lys_feature_disable(const struct lys_module *module, const char *feature);
Radek Krejci151a5b72018-10-19 14:21:44 +02001531
1532/**
1533 * @brief Get the current status of the specified feature in the module.
1534 *
1535 * @param[in] module Module where the feature is defined.
1536 * @param[in] feature Name of the feature to inspect.
1537 * @return
1538 * - 1 if feature is enabled,
1539 * - 0 if feature is disabled,
1540 * - -1 in case of error (e.g. feature is not defined or invalid arguments)
1541 */
1542int lys_feature_value(const struct lys_module *module, const char *feature);
Radek Krejcidd4e8d42018-10-16 14:55:43 +02001543
1544/**
Radek Krejci86d106e2018-10-18 09:53:19 +02001545 * @brief Load a schema into the specified context.
1546 *
1547 * @param[in] ctx libyang context where to process the data model.
1548 * @param[in] data The string containing the dumped data model in the specified
1549 * format.
1550 * @param[in] format Format of the input data (YANG or YIN).
1551 * @return Pointer to the data model structure or NULL on error.
1552 */
Radek Krejcid14e9692018-11-01 11:00:37 +01001553struct lys_module *lys_parse_mem(struct ly_ctx *ctx, const char *data, LYS_INFORMAT format);
Radek Krejci86d106e2018-10-18 09:53:19 +02001554
1555/**
1556 * @brief Read a schema from file descriptor into the specified context.
1557 *
1558 * \note Current implementation supports only reading data from standard (disk) file, not from sockets, pipes, etc.
1559 *
1560 * @param[in] ctx libyang context where to process the data model.
1561 * @param[in] fd File descriptor of a regular file (e.g. sockets are not supported) containing the schema
1562 * in the specified format.
1563 * @param[in] format Format of the input data (YANG or YIN).
1564 * @return Pointer to the data model structure or NULL on error.
1565 */
Radek Krejcid14e9692018-11-01 11:00:37 +01001566struct lys_module *lys_parse_fd(struct ly_ctx *ctx, int fd, LYS_INFORMAT format);
Radek Krejci86d106e2018-10-18 09:53:19 +02001567
1568/**
Radek Krejcid33273d2018-10-25 14:55:52 +02001569 * @brief Read a schema into the specified context from a file.
Radek Krejci86d106e2018-10-18 09:53:19 +02001570 *
1571 * @param[in] ctx libyang context where to process the data model.
1572 * @param[in] path Path to the file with the model in the specified format.
1573 * @param[in] format Format of the input data (YANG or YIN).
1574 * @return Pointer to the data model structure or NULL on error.
1575 */
Radek Krejcid14e9692018-11-01 11:00:37 +01001576struct lys_module *lys_parse_path(struct ly_ctx *ctx, const char *path, LYS_INFORMAT format);
Radek Krejci86d106e2018-10-18 09:53:19 +02001577
1578/**
Radek Krejcid33273d2018-10-25 14:55:52 +02001579 * @brief Search for the schema file in the specified searchpaths.
1580 *
1581 * @param[in] searchpaths NULL-terminated array of paths to be searched (recursively). Current working
1582 * directory is searched automatically (but non-recursively if not in the provided list). Caller can use
1583 * result of the ly_ctx_get_searchdirs().
1584 * @param[in] cwd Flag to implicitly search also in the current working directory (non-recursively).
1585 * @param[in] name Name of the schema to find.
1586 * @param[in] revision Revision of the schema to find. If NULL, the newest found schema filepath is returned.
1587 * @param[out] localfile Mandatory output variable containing absolute path of the found schema. If no schema
1588 * complying the provided restriction is found, NULL is set.
1589 * @param[out] format Optional output variable containing expected format of the schema document according to the
1590 * file suffix.
1591 * @return LY_ERR value (LY_SUCCESS is returned even if the file is not found, then the *localfile is NULL).
1592 */
1593LY_ERR lys_search_localfile(const char * const *searchpaths, int cwd, const char *name, const char *revision, char **localfile, LYS_INFORMAT *format);
1594
1595/**
Radek Krejcia3045382018-11-22 14:30:31 +01001596 * @brief Get next schema tree (sibling) node element that can be instantiated in a data tree. Returned node can
1597 * be from an augment.
1598 *
1599 * lys_getnext() is supposed to be called sequentially. In the first call, the \p last parameter is usually NULL
1600 * and function starts returning i) the first \p parent's child or ii) the first top level element of the \p module.
1601 * Consequent calls suppose to provide the previously returned node as the \p last parameter and still the same
1602 * \p parent and \p module parameters.
1603 *
1604 * Without options, the function is used to traverse only the schema nodes that can be paired with corresponding
1605 * data nodes in a data tree. By setting some \p options the behavior can be modified to the extent that
1606 * all the schema nodes are iteratively returned.
1607 *
1608 * @param[in] last Previously returned schema tree node, or NULL in case of the first call.
1609 * @param[in] parent Parent of the subtree where the function starts processing.
1610 * @param[in] module In case of iterating on top level elements, the \p parent is NULL and
1611 * module must be specified.
1612 * @param[in] options [ORed options](@ref sgetnextflags).
1613 * @return Next schema tree node that can be instantiated in a data tree, NULL in case there is no such element.
1614 */
1615const struct lysc_node *lys_getnext(const struct lysc_node *last, const struct lysc_node *parent,
1616 const struct lysc_module *module, int options);
1617
1618/**
1619 * @defgroup sgetnextflags lys_getnext() flags
1620 * @ingroup schematree
1621 *
1622 * @{
1623 */
1624#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 +01001625#define LYS_GETNEXT_NOCHOICE 0x02 /**< lys_getnext() option to ignore (kind of conditional) nodes within choice node */
Radek Krejci056d0a82018-12-06 16:57:25 +01001626#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 +01001627#define LYS_GETNEXT_INTONPCONT 0x40 /**< lys_getnext() option to look into non-presence container, instead of returning container itself */
1628#define LYS_GETNEXT_NOSTATECHECK 0x100 /**< lys_getnext() option to skip checking module validity (import-only, disabled) and
1629 relevant if-feature conditions state */
Radek Krejci6eeb58f2019-02-22 16:29:37 +01001630#define LYS_GETNEXT_OUTPUT 0x200 /**< lys_getnext() option to provide RPC's/action's output schema nodes instead of input schema nodes
1631 provided by default */
Radek Krejcia3045382018-11-22 14:30:31 +01001632/** @} sgetnextflags */
1633
1634/**
1635 * @brief Get child node according to the specified criteria.
1636 *
1637 * @param[in] parent Optional parent of the node to find. If not specified, the module's top-level nodes are searched.
1638 * @param[in] module module of the node to find. It is also limitation for the children node of the given parent.
1639 * @param[in] name Name of the node to find.
1640 * @param[in] name_len Optional length of the name in case it is not NULL-terminated string.
1641 * @param[in] nodetype Optional criteria (to speedup) specifying nodetype(s) of the node to find.
1642 * Used as a bitmask, so multiple nodetypes can be specified.
1643 * @param[in] options [ORed options](@ref sgetnextflags).
1644 * @return Found node if any.
1645 */
1646const struct lysc_node *lys_child(const struct lysc_node *parent, const struct lys_module *module,
1647 const char *name, size_t name_len, uint16_t nodetype, int options);
1648
1649/**
1650 * @brief Check if the schema node is disabled in the schema tree, i.e. there is any disabled if-feature statement
1651 * affecting the node.
1652 *
1653 * @param[in] node Schema node to check.
1654 * @param[in] recursive - 0 to check if-feature only in the \p node schema node,
1655 * - 1 to check if-feature in all ascendant schema nodes until there is a node possibly having an instance in a data tree
1656 * @return - NULL if enabled,
1657 * - pointer to the node with the unsatisfied (disabling) if-feature expression.
1658 */
1659const struct lysc_iffeature *lys_is_disabled(const struct lysc_node *node, int recursive);
1660
Radek Krejci084289f2019-07-09 17:35:30 +02001661/**
1662 * @brief Check type restrictions applicable to the particular leaf/leaf-list with the given string @p value.
1663 *
1664 * This function check just the type's restriction, if you want to check also the data tree context (e.g. in case of
1665 * require-instance restriction), use lyd_value_validate().
1666 *
1667 * @param[in] ctx libyang context for logging (function does not log errors when @p ctx is NULL)
1668 * @param[in] node Schema node for the @p value.
1669 * @param[in] value String value to be checked.
1670 * @param[in] value_len Length of the given @p value (mandatory).
1671 * @param[in] get_prefix Callback function to resolve prefixes used in the @p value string.
1672 * @param[in] get_prefix_data Private data for the @p get_prefix callback.
1673 * @param[in] format Input format of the @p value.
1674 * @return LY_SUCCESS on success
1675 * @return LY_ERR value if an error occurred.
1676 */
1677LY_ERR lys_value_validate(struct ly_ctx *ctx, const struct lysc_node *node, const char *value, size_t value_len,
1678 ly_clb_resolve_prefix get_prefix, void *get_prefix_data, LYD_FORMAT format);
1679
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001680/** @} */
1681
Radek Krejci70853c52018-10-15 14:46:16 +02001682#ifdef __cplusplus
1683}
1684#endif
1685
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001686#endif /* LY_TREE_SCHEMA_H_ */