blob: 0dbfefa9d62a870de8f3276fc6454cf69a91251e [file] [log] [blame]
Radek Krejci86d106e2018-10-18 09:53:19 +02001/**
2 * @file tree_schema_helpers.c
3 * @author Radek Krejci <rkrejci@cesnet.cz>
Radek Krejcie7b95092019-05-15 11:03:07 +02004 * @brief Parsing and validation helper functions for schema trees
Radek Krejci86d106e2018-10-18 09:53:19 +02005 *
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 */
Radek Krejci535ea9f2020-05-29 16:01:05 +020014
15#define _GNU_SOURCE
Radek Krejci86d106e2018-10-18 09:53:19 +020016
Radek Krejcie7b95092019-05-15 11:03:07 +020017#include <assert.h>
Radek Krejci86d106e2018-10-18 09:53:19 +020018#include <ctype.h>
Radek Krejci47fab892020-11-05 17:02:41 +010019#include <stddef.h>
Radek Krejcie7b95092019-05-15 11:03:07 +020020#include <stdint.h>
Radek Krejci9ed7a192018-10-31 16:23:51 +010021#include <stdlib.h>
Radek Krejcie7b95092019-05-15 11:03:07 +020022#include <string.h>
Radek Krejci86d106e2018-10-18 09:53:19 +020023#include <time.h>
24
Radek Krejci535ea9f2020-05-29 16:01:05 +020025#include "common.h"
Michal Vasko69730152020-10-09 16:30:07 +020026#include "compat.h"
Radek Krejcie7b95092019-05-15 11:03:07 +020027#include "context.h"
Radek Krejci77114102021-03-10 15:21:57 +010028#include "dict.h"
Radek Krejcie7b95092019-05-15 11:03:07 +020029#include "hash_table.h"
Radek Krejci47fab892020-11-05 17:02:41 +010030#include "in.h"
Michal Vaskoafac7822020-10-20 14:22:26 +020031#include "in_internal.h"
Radek Krejci47fab892020-11-05 17:02:41 +010032#include "log.h"
Michal Vasko69730152020-10-09 16:30:07 +020033#include "parser_schema.h"
Michal Vasko962b6cd2020-12-08 10:07:49 +010034#include "schema_compile.h"
Michal Vasko79135ae2020-12-16 10:08:35 +010035#include "schema_features.h"
Radek Krejcie7b95092019-05-15 11:03:07 +020036#include "set.h"
37#include "tree.h"
Radek Krejci859a15a2021-03-05 20:56:59 +010038#include "tree_edit.h"
Radek Krejcie7b95092019-05-15 11:03:07 +020039#include "tree_schema.h"
Radek Krejci86d106e2018-10-18 09:53:19 +020040#include "tree_schema_internal.h"
41
Radek Krejci85747952019-06-07 16:43:43 +020042LY_ERR
Radek Krejcie7b95092019-05-15 11:03:07 +020043lysp_check_prefix(struct lys_parser_ctx *ctx, struct lysp_import *imports, const char *module_prefix, const char **value)
Radek Krejci86d106e2018-10-18 09:53:19 +020044{
45 struct lysp_import *i;
46
Michal Vasko69730152020-10-09 16:30:07 +020047 if (module_prefix && (&module_prefix != value) && !strcmp(module_prefix, *value)) {
Michal Vaskob36053d2020-03-26 15:49:30 +010048 LOGVAL_PARSER(ctx, LYVE_REFERENCE, "Prefix \"%s\" already used as module prefix.", *value);
Radek Krejci86d106e2018-10-18 09:53:19 +020049 return LY_EEXIST;
50 }
Radek Krejci0bcdaed2019-01-10 10:21:34 +010051 LY_ARRAY_FOR(imports, struct lysp_import, i) {
Michal Vasko69730152020-10-09 16:30:07 +020052 if (i->prefix && (&i->prefix != value) && !strcmp(i->prefix, *value)) {
Michal Vaskob36053d2020-03-26 15:49:30 +010053 LOGVAL_PARSER(ctx, LYVE_REFERENCE, "Prefix \"%s\" already used to import \"%s\" module.", *value, i->name);
Radek Krejci0bcdaed2019-01-10 10:21:34 +010054 return LY_EEXIST;
Radek Krejci86d106e2018-10-18 09:53:19 +020055 }
56 }
57 return LY_SUCCESS;
58}
59
60LY_ERR
Juraj Vijtiuk74dad9e2021-05-26 12:42:14 +020061lysp_check_date(struct lys_parser_ctx *ctx, const char *date, size_t date_len, const char *stmt)
Radek Krejci86d106e2018-10-18 09:53:19 +020062{
Radek Krejci86d106e2018-10-18 09:53:19 +020063 struct tm tm, tm_;
64 char *r;
65
Michal Vaskob36053d2020-03-26 15:49:30 +010066 LY_CHECK_ARG_RET(ctx ? PARSER_CTX(ctx) : NULL, date, LY_EINVAL);
67 LY_CHECK_ERR_RET(date_len != LY_REV_SIZE - 1, LOGARG(ctx ? PARSER_CTX(ctx) : NULL, date_len), LY_EINVAL);
Radek Krejci86d106e2018-10-18 09:53:19 +020068
Radek Krejcif13b87b2020-12-01 22:02:17 +010069 /* check format: YYYY-MM-DD */
Radek Krejci1deb5be2020-08-26 16:43:36 +020070 for (uint8_t i = 0; i < date_len; i++) {
Michal Vasko69730152020-10-09 16:30:07 +020071 if ((i == 4) || (i == 7)) {
Radek Krejci86d106e2018-10-18 09:53:19 +020072 if (date[i] != '-') {
73 goto error;
74 }
75 } else if (!isdigit(date[i])) {
76 goto error;
77 }
78 }
79
80 /* check content, e.g. 2018-02-31 */
81 memset(&tm, 0, sizeof tm);
82 r = strptime(date, "%Y-%m-%d", &tm);
Michal Vasko69730152020-10-09 16:30:07 +020083 if (!r || (r != &date[LY_REV_SIZE - 1])) {
Radek Krejci86d106e2018-10-18 09:53:19 +020084 goto error;
85 }
86 memcpy(&tm_, &tm, sizeof tm);
87 mktime(&tm_); /* mktime modifies tm_ if it refers invalid date */
88 if (tm.tm_mday != tm_.tm_mday) { /* e.g 2018-02-29 -> 2018-03-01 */
89 /* checking days is enough, since other errors
90 * have been checked by strptime() */
91 goto error;
92 }
93
94 return LY_SUCCESS;
95
96error:
Radek Krejcid33273d2018-10-25 14:55:52 +020097 if (stmt) {
Radek Krejci2efc45b2020-12-22 16:25:44 +010098 LOGVAL_PARSER(ctx, LY_VCODE_INVAL, date_len, date, stmt);
Radek Krejcid33273d2018-10-25 14:55:52 +020099 }
Radek Krejci86d106e2018-10-18 09:53:19 +0200100 return LY_EINVAL;
101}
102
103void
104lysp_sort_revisions(struct lysp_revision *revs)
105{
Radek Krejci857189e2020-09-01 13:26:36 +0200106 LY_ARRAY_COUNT_TYPE i, r;
Radek Krejci86d106e2018-10-18 09:53:19 +0200107 struct lysp_revision rev;
108
Radek Krejcic7d13e32020-12-09 12:32:24 +0100109 for (i = 1, r = 0; i < LY_ARRAY_COUNT(revs); i++) {
Radek Krejcib7db73a2018-10-24 14:18:40 +0200110 if (strcmp(revs[i].date, revs[r].date) > 0) {
Radek Krejci86d106e2018-10-18 09:53:19 +0200111 r = i;
112 }
113 }
114
115 if (r) {
116 /* the newest revision is not on position 0, switch them */
Radek Krejci2c4e7172018-10-19 15:56:26 +0200117 memcpy(&rev, &revs[0], sizeof rev);
118 memcpy(&revs[0], &revs[r], sizeof rev);
119 memcpy(&revs[r], &rev, sizeof rev);
Radek Krejci86d106e2018-10-18 09:53:19 +0200120 }
121}
Radek Krejci151a5b72018-10-19 14:21:44 +0200122
Radek Krejcibbe09a92018-11-08 09:36:54 +0100123static const struct lysp_tpdf *
124lysp_type_match(const char *name, struct lysp_node *node)
125{
Radek Krejci0fb28562018-12-13 15:17:37 +0100126 const struct lysp_tpdf *typedefs;
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200127 LY_ARRAY_COUNT_TYPE u;
Radek Krejcibbe09a92018-11-08 09:36:54 +0100128
Radek Krejci0fb28562018-12-13 15:17:37 +0100129 typedefs = lysp_node_typedefs(node);
130 LY_ARRAY_FOR(typedefs, u) {
131 if (!strcmp(name, typedefs[u].name)) {
132 /* match */
133 return &typedefs[u];
Radek Krejcibbe09a92018-11-08 09:36:54 +0100134 }
135 }
136
137 return NULL;
138}
139
aPiecek63e080d2021-06-29 13:53:28 +0200140static const struct lysp_node_grp *
141lysp_grouping_match(const char *name, struct lysp_node *node)
142{
143 const struct lysp_node_grp *groupings, *grp_iter;
144
145 groupings = lysp_node_groupings(node);
146 LY_LIST_FOR(groupings, grp_iter) {
147 if (!strcmp(name, grp_iter->name)) {
148 /* match */
149 return grp_iter;
150 }
151 }
152
153 return NULL;
154}
155
Radek Krejci4f28eda2018-11-12 11:46:16 +0100156static LY_DATA_TYPE
157lysp_type_str2builtin(const char *name, size_t len)
158{
159 if (len >= 4) { /* otherwise it does not match any built-in type */
160 if (name[0] == 'b') {
161 if (name[1] == 'i') {
Michal Vasko69730152020-10-09 16:30:07 +0200162 if ((len == 6) && !strncmp(&name[2], "nary", 4)) {
Radek Krejci4f28eda2018-11-12 11:46:16 +0100163 return LY_TYPE_BINARY;
Michal Vasko69730152020-10-09 16:30:07 +0200164 } else if ((len == 4) && !strncmp(&name[2], "ts", 2)) {
Radek Krejci4f28eda2018-11-12 11:46:16 +0100165 return LY_TYPE_BITS;
166 }
Michal Vasko69730152020-10-09 16:30:07 +0200167 } else if ((len == 7) && !strncmp(&name[1], "oolean", 6)) {
Radek Krejci4f28eda2018-11-12 11:46:16 +0100168 return LY_TYPE_BOOL;
169 }
170 } else if (name[0] == 'd') {
Michal Vasko69730152020-10-09 16:30:07 +0200171 if ((len == 9) && !strncmp(&name[1], "ecimal64", 8)) {
Radek Krejci4f28eda2018-11-12 11:46:16 +0100172 return LY_TYPE_DEC64;
173 }
174 } else if (name[0] == 'e') {
Michal Vasko69730152020-10-09 16:30:07 +0200175 if ((len == 5) && !strncmp(&name[1], "mpty", 4)) {
Radek Krejci4f28eda2018-11-12 11:46:16 +0100176 return LY_TYPE_EMPTY;
Michal Vasko69730152020-10-09 16:30:07 +0200177 } else if ((len == 11) && !strncmp(&name[1], "numeration", 10)) {
Radek Krejci4f28eda2018-11-12 11:46:16 +0100178 return LY_TYPE_ENUM;
179 }
180 } else if (name[0] == 'i') {
181 if (name[1] == 'n') {
Michal Vasko69730152020-10-09 16:30:07 +0200182 if ((len == 4) && !strncmp(&name[2], "t8", 2)) {
Radek Krejci4f28eda2018-11-12 11:46:16 +0100183 return LY_TYPE_INT8;
184 } else if (len == 5) {
185 if (!strncmp(&name[2], "t16", 3)) {
186 return LY_TYPE_INT16;
187 } else if (!strncmp(&name[2], "t32", 3)) {
188 return LY_TYPE_INT32;
189 } else if (!strncmp(&name[2], "t64", 3)) {
190 return LY_TYPE_INT64;
191 }
Michal Vasko69730152020-10-09 16:30:07 +0200192 } else if ((len == 19) && !strncmp(&name[2], "stance-identifier", 17)) {
Radek Krejci4f28eda2018-11-12 11:46:16 +0100193 return LY_TYPE_INST;
194 }
Michal Vasko69730152020-10-09 16:30:07 +0200195 } else if ((len == 11) && !strncmp(&name[1], "dentityref", 10)) {
Radek Krejci4f28eda2018-11-12 11:46:16 +0100196 return LY_TYPE_IDENT;
197 }
198 } else if (name[0] == 'l') {
Michal Vasko69730152020-10-09 16:30:07 +0200199 if ((len == 7) && !strncmp(&name[1], "eafref", 6)) {
Radek Krejci4f28eda2018-11-12 11:46:16 +0100200 return LY_TYPE_LEAFREF;
201 }
202 } else if (name[0] == 's') {
Michal Vasko69730152020-10-09 16:30:07 +0200203 if ((len == 6) && !strncmp(&name[1], "tring", 5)) {
Radek Krejci4f28eda2018-11-12 11:46:16 +0100204 return LY_TYPE_STRING;
205 }
206 } else if (name[0] == 'u') {
207 if (name[1] == 'n') {
Michal Vasko69730152020-10-09 16:30:07 +0200208 if ((len == 5) && !strncmp(&name[2], "ion", 3)) {
Radek Krejci4f28eda2018-11-12 11:46:16 +0100209 return LY_TYPE_UNION;
210 }
Michal Vasko69730152020-10-09 16:30:07 +0200211 } else if ((name[1] == 'i') && (name[2] == 'n') && (name[3] == 't')) {
212 if ((len == 5) && (name[4] == '8')) {
Radek Krejci4f28eda2018-11-12 11:46:16 +0100213 return LY_TYPE_UINT8;
214 } else if (len == 6) {
215 if (!strncmp(&name[4], "16", 2)) {
216 return LY_TYPE_UINT16;
217 } else if (!strncmp(&name[4], "32", 2)) {
218 return LY_TYPE_UINT32;
219 } else if (!strncmp(&name[4], "64", 2)) {
220 return LY_TYPE_UINT64;
221 }
222 }
223 }
224 }
225 }
226
227 return LY_TYPE_UNKNOWN;
228}
229
Radek Krejcibbe09a92018-11-08 09:36:54 +0100230LY_ERR
Michal Vaskoa99b3572021-02-01 11:54:58 +0100231lysp_type_find(const char *id, struct lysp_node *start_node, const struct lysp_module *start_module,
232 LY_DATA_TYPE *type, const struct lysp_tpdf **tpdf, struct lysp_node **node)
Radek Krejcibbe09a92018-11-08 09:36:54 +0100233{
234 const char *str, *name;
235 struct lysp_tpdf *typedefs;
Michal Vaskob2d55bf2020-11-02 15:42:43 +0100236 const struct lys_module *mod;
Michal Vaskoa99b3572021-02-01 11:54:58 +0100237 const struct lysp_module *local_module;
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200238 LY_ARRAY_COUNT_TYPE u, v;
Radek Krejcibbe09a92018-11-08 09:36:54 +0100239
240 assert(id);
241 assert(start_module);
242 assert(tpdf);
243 assert(node);
Radek Krejcibbe09a92018-11-08 09:36:54 +0100244
Radek Krejci4f28eda2018-11-12 11:46:16 +0100245 *node = NULL;
Radek Krejcibbe09a92018-11-08 09:36:54 +0100246 str = strchr(id, ':');
247 if (str) {
Radek Krejci8df109d2021-04-23 12:19:08 +0200248 mod = ly_resolve_prefix(start_module->mod->ctx, id, str - id, LY_VALUE_SCHEMA, (void *)start_module);
Michal Vaskoa99b3572021-02-01 11:54:58 +0100249 local_module = mod ? mod->parsed : NULL;
Radek Krejcibbe09a92018-11-08 09:36:54 +0100250 name = str + 1;
Radek Krejci4f28eda2018-11-12 11:46:16 +0100251 *type = LY_TYPE_UNKNOWN;
Radek Krejcibbe09a92018-11-08 09:36:54 +0100252 } else {
Michal Vaskoa99b3572021-02-01 11:54:58 +0100253 local_module = start_module;
Radek Krejcibbe09a92018-11-08 09:36:54 +0100254 name = id;
Radek Krejci4f28eda2018-11-12 11:46:16 +0100255
256 /* check for built-in types */
257 *type = lysp_type_str2builtin(name, strlen(name));
258 if (*type) {
259 *tpdf = NULL;
260 return LY_SUCCESS;
261 }
Radek Krejcibbe09a92018-11-08 09:36:54 +0100262 }
Michal Vaskoa99b3572021-02-01 11:54:58 +0100263 LY_CHECK_RET(!local_module, LY_ENOTFOUND);
Radek Krejcibbe09a92018-11-08 09:36:54 +0100264
Michal Vaskoa99b3572021-02-01 11:54:58 +0100265 if (start_node && (local_module == start_module)) {
Radek Krejcibbe09a92018-11-08 09:36:54 +0100266 /* search typedefs in parent's nodes */
267 *node = start_node;
268 while (*node) {
269 *tpdf = lysp_type_match(name, *node);
270 if (*tpdf) {
271 /* match */
272 return LY_SUCCESS;
273 }
274 *node = (*node)->parent;
275 }
276 }
277
Michal Vasko915e5442021-06-08 14:59:21 +0200278 /* go to main module if in submodule */
279 local_module = local_module->mod->parsed;
280
Radek Krejcibbe09a92018-11-08 09:36:54 +0100281 /* search in top-level typedefs */
Michal Vaskoa99b3572021-02-01 11:54:58 +0100282 if (local_module->typedefs) {
283 LY_ARRAY_FOR(local_module->typedefs, u) {
284 if (!strcmp(name, local_module->typedefs[u].name)) {
Radek Krejcibbe09a92018-11-08 09:36:54 +0100285 /* match */
Michal Vaskoa99b3572021-02-01 11:54:58 +0100286 *tpdf = &local_module->typedefs[u];
Radek Krejcibbe09a92018-11-08 09:36:54 +0100287 return LY_SUCCESS;
288 }
289 }
290 }
291
Michal Vasko915e5442021-06-08 14:59:21 +0200292 /* search in all submodules' typedefs */
Michal Vaskoa99b3572021-02-01 11:54:58 +0100293 LY_ARRAY_FOR(local_module->includes, u) {
294 typedefs = local_module->includes[u].submodule->typedefs;
Radek Krejci76b3e962018-12-14 17:01:25 +0100295 LY_ARRAY_FOR(typedefs, v) {
296 if (!strcmp(name, typedefs[v].name)) {
297 /* match */
298 *tpdf = &typedefs[v];
299 return LY_SUCCESS;
Radek Krejcibbe09a92018-11-08 09:36:54 +0100300 }
301 }
302 }
303
304 return LY_ENOTFOUND;
305}
306
David Sedlák6544c182019-07-12 13:17:33 +0200307LY_ERR
David Sedlák07869a52019-07-12 14:28:19 +0200308lysp_check_enum_name(struct lys_parser_ctx *ctx, const char *name, size_t name_len)
David Sedlák6544c182019-07-12 13:17:33 +0200309{
310 if (!name_len) {
311 LOGVAL_PARSER(ctx, LYVE_SYNTAX_YANG, "Enum name must not be zero-length.");
312 return LY_EVALID;
313 } else if (isspace(name[0]) || isspace(name[name_len - 1])) {
314 LOGVAL_PARSER(ctx, LYVE_SYNTAX_YANG, "Enum name must not have any leading or trailing whitespaces (\"%.*s\").",
Radek Krejci422afb12021-03-04 16:38:16 +0100315 (int)name_len, name);
David Sedlák6544c182019-07-12 13:17:33 +0200316 return LY_EVALID;
317 } else {
318 for (size_t u = 0; u < name_len; ++u) {
319 if (iscntrl(name[u])) {
Michal Vaskob36053d2020-03-26 15:49:30 +0100320 LOGWRN(PARSER_CTX(ctx), "Control characters in enum name should be avoided (\"%.*s\", character number %d).",
Radek Krejci422afb12021-03-04 16:38:16 +0100321 (int)name_len, name, u + 1);
David Sedlák6544c182019-07-12 13:17:33 +0200322 break;
323 }
324 }
325 }
326
327 return LY_SUCCESS;
328}
329
Michal Vaskob36053d2020-03-26 15:49:30 +0100330/**
aPiecekdc12b9f2021-06-25 10:55:47 +0200331 * @brief Insert @p name to hash table and if @p name has already
332 * been added, then log an error.
333 *
334 * This function is used to detect duplicate names.
335 *
336 * @param[in,out] ctx Context to log the error.
337 * @param[in,out] ht Hash table with top-level names.
338 * @param[in] name Inserted top-level identifier.
339 * @param[in] statement The name of the statement type from which
340 * @p name originated (eg typedef, feature, ...).
341 * @param[in] err_detail Optional error specification.
342 * @return LY_ERR, but LY_EEXIST is mapped to LY_EVALID.
343 */
344static LY_ERR
345lysp_check_dup_ht_insert(struct lys_parser_ctx *ctx, struct hash_table *ht,
346 const char *name, const char *statement, const char *err_detail)
347{
348 LY_ERR ret;
349 uint32_t hash;
350
351 hash = dict_hash(name, strlen(name));
352 ret = lyht_insert(ht, &name, hash, NULL);
353 if (ret == LY_EEXIST) {
354 if (err_detail) {
355 LOGVAL_PARSER(ctx, LY_VCODE_DUPIDENT2, name, statement, err_detail);
356 } else {
357 LOGVAL_PARSER(ctx, LY_VCODE_DUPIDENT, name, statement);
358 }
359 ret = LY_EVALID;
360 }
361
362 return ret;
363}
364
365/**
Radek Krejcibbe09a92018-11-08 09:36:54 +0100366 * @brief Check name of a new type to avoid name collisions.
367 *
368 * @param[in] ctx Parser context, module where the type is being defined is taken from here.
369 * @param[in] node Schema node where the type is being defined, NULL in case of a top-level typedef.
370 * @param[in] tpdf Typedef definition to check.
371 * @param[in,out] tpdfs_global Initialized hash table to store temporary data between calls. When the module's
aPiecekc7594b72021-06-29 09:00:03 +0200372 * typedefs are checked, caller is supposed to free the table.
373 * @return LY_EVALID in case of collision, LY_SUCCESS otherwise.
Radek Krejcibbe09a92018-11-08 09:36:54 +0100374 */
375static LY_ERR
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100376lysp_check_dup_typedef(struct lys_parser_ctx *ctx, struct lysp_node *node, const struct lysp_tpdf *tpdf,
aPieceke1fbd952021-06-29 08:12:55 +0200377 struct hash_table *tpdfs_global)
Radek Krejcibbe09a92018-11-08 09:36:54 +0100378{
379 struct lysp_node *parent;
380 uint32_t hash;
381 size_t name_len;
382 const char *name;
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200383 LY_ARRAY_COUNT_TYPE u;
Radek Krejci0fb28562018-12-13 15:17:37 +0100384 const struct lysp_tpdf *typedefs;
Radek Krejcibbe09a92018-11-08 09:36:54 +0100385
386 assert(ctx);
387 assert(tpdf);
388
389 name = tpdf->name;
390 name_len = strlen(name);
391
Radek Krejci4f28eda2018-11-12 11:46:16 +0100392 if (lysp_type_str2builtin(name, name_len)) {
aPiecekc7594b72021-06-29 09:00:03 +0200393 LOGVAL_PARSER(ctx, LYVE_SYNTAX_YANG,
394 "Duplicate identifier \"%s\" of typedef statement - name collision with a built-in type.", name);
395 return LY_EVALID;
Radek Krejcibbe09a92018-11-08 09:36:54 +0100396 }
397
398 /* check locally scoped typedefs (avoid name shadowing) */
399 if (node) {
Radek Krejci0fb28562018-12-13 15:17:37 +0100400 typedefs = lysp_node_typedefs(node);
401 LY_ARRAY_FOR(typedefs, u) {
402 if (&typedefs[u] == tpdf) {
403 break;
404 }
405 if (!strcmp(name, typedefs[u].name)) {
aPiecekc7594b72021-06-29 09:00:03 +0200406 LOGVAL_PARSER(ctx, LYVE_SYNTAX_YANG,
407 "Duplicate identifier \"%s\" of typedef statement - name collision with sibling type.", name);
408 return LY_EVALID;
Radek Krejcibbe09a92018-11-08 09:36:54 +0100409 }
410 }
411 /* search typedefs in parent's nodes */
Radek Krejci87e78ca2019-05-02 09:51:29 +0200412 for (parent = node->parent; parent; parent = parent->parent) {
Radek Krejcibbe09a92018-11-08 09:36:54 +0100413 if (lysp_type_match(name, parent)) {
aPiecekc7594b72021-06-29 09:00:03 +0200414 LOGVAL_PARSER(ctx, LYVE_SYNTAX_YANG,
415 "Duplicate identifier \"%s\" of typedef statement - name collision with another scoped type.", name);
416 return LY_EVALID;
Radek Krejcibbe09a92018-11-08 09:36:54 +0100417 }
418 }
419 }
420
421 /* check collision with the top-level typedefs */
Radek Krejcibbe09a92018-11-08 09:36:54 +0100422 if (node) {
aPiecekc7594b72021-06-29 09:00:03 +0200423 hash = dict_hash(name, name_len);
Radek Krejcibbe09a92018-11-08 09:36:54 +0100424 if (!lyht_find(tpdfs_global, &name, hash, NULL)) {
aPiecekc7594b72021-06-29 09:00:03 +0200425 LOGVAL_PARSER(ctx, LYVE_SYNTAX_YANG,
426 "Duplicate identifier \"%s\" of typedef statement - scoped type collide with a top-level type.", name);
427 return LY_EVALID;
Radek Krejcibbe09a92018-11-08 09:36:54 +0100428 }
429 } else {
aPiecekc7594b72021-06-29 09:00:03 +0200430 LY_CHECK_RET(lysp_check_dup_ht_insert(ctx, tpdfs_global, name, "typedef",
431 "name collision with another top-level type"));
Radek Krejci3b1f9292018-11-08 10:58:35 +0100432 /* it is not necessary to test collision with the scoped types - in lysp_check_typedefs, all the
433 * top-level typedefs are inserted into the tables before the scoped typedefs, so the collision
434 * is detected in the first branch few lines above */
Radek Krejcibbe09a92018-11-08 09:36:54 +0100435 }
436
437 return LY_SUCCESS;
438}
439
Radek Krejci857189e2020-09-01 13:26:36 +0200440/**
441 * @brief Compare identifiers.
Michal Vasko62524a92021-02-26 10:08:50 +0100442 * Implementation of ::lyht_value_equal_cb.
Radek Krejci857189e2020-09-01 13:26:36 +0200443 */
444static ly_bool
445lysp_id_cmp(void *val1, void *val2, ly_bool UNUSED(mod), void *UNUSED(cb_data))
Radek Krejcibbe09a92018-11-08 09:36:54 +0100446{
Michal Vasko11ac39a2021-07-23 12:46:56 +0200447 char *id1, *id2;
448
449 id1 = *(char **)val1;
450 id2 = *(char **)val2;
451
452 return strcmp(id1, id2) == 0 ? 1 : 0;
Radek Krejcibbe09a92018-11-08 09:36:54 +0100453}
454
455LY_ERR
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100456lysp_check_dup_typedefs(struct lys_parser_ctx *ctx, struct lysp_module *mod)
Radek Krejcibbe09a92018-11-08 09:36:54 +0100457{
458 struct hash_table *ids_global;
Radek Krejci0fb28562018-12-13 15:17:37 +0100459 const struct lysp_tpdf *typedefs;
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200460 LY_ARRAY_COUNT_TYPE u, v;
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200461 uint32_t i;
Michal Vasko405cc9e2020-12-01 12:01:27 +0100462 LY_ERR ret = LY_SUCCESS;
Radek Krejcibbe09a92018-11-08 09:36:54 +0100463
464 /* check name collisions - typedefs and groupings */
Radek Krejcif13b87b2020-12-01 22:02:17 +0100465 ids_global = lyht_new(LYHT_MIN_SIZE, sizeof(char *), lysp_id_cmp, NULL, 1);
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200466 LY_ARRAY_FOR(mod->typedefs, v) {
aPieceke1fbd952021-06-29 08:12:55 +0200467 ret = lysp_check_dup_typedef(ctx, NULL, &mod->typedefs[v], ids_global);
Michal Vasko405cc9e2020-12-01 12:01:27 +0100468 LY_CHECK_GOTO(ret, cleanup);
Radek Krejcibbe09a92018-11-08 09:36:54 +0100469 }
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200470 LY_ARRAY_FOR(mod->includes, v) {
471 LY_ARRAY_FOR(mod->includes[v].submodule->typedefs, u) {
aPieceke1fbd952021-06-29 08:12:55 +0200472 ret = lysp_check_dup_typedef(ctx, NULL, &mod->includes[v].submodule->typedefs[u], ids_global);
Michal Vasko405cc9e2020-12-01 12:01:27 +0100473 LY_CHECK_GOTO(ret, cleanup);
Radek Krejci3b1f9292018-11-08 10:58:35 +0100474 }
475 }
Radek Krejci7eb54ba2020-05-18 16:30:04 +0200476 for (i = 0; i < ctx->tpdfs_nodes.count; ++i) {
477 typedefs = lysp_node_typedefs((struct lysp_node *)ctx->tpdfs_nodes.objs[i]);
478 LY_ARRAY_FOR(typedefs, u) {
aPieceke1fbd952021-06-29 08:12:55 +0200479 ret = lysp_check_dup_typedef(ctx, (struct lysp_node *)ctx->tpdfs_nodes.objs[i], &typedefs[u], ids_global);
Michal Vasko405cc9e2020-12-01 12:01:27 +0100480 LY_CHECK_GOTO(ret, cleanup);
Radek Krejcibbe09a92018-11-08 09:36:54 +0100481 }
482 }
Michal Vasko405cc9e2020-12-01 12:01:27 +0100483
Radek Krejcibbe09a92018-11-08 09:36:54 +0100484cleanup:
485 lyht_free(ids_global);
Radek Krejcibbe09a92018-11-08 09:36:54 +0100486 return ret;
487}
488
aPiecek63e080d2021-06-29 13:53:28 +0200489/**
490 * @brief Check name of a new grouping to avoid name collisions.
491 *
492 * @param[in] ctx Parser context, module where the grouping is being defined is taken from here.
493 * @param[in] node Schema node where the grouping is being defined, NULL in case of a top-level grouping.
494 * @param[in] grp Grouping definition to check.
495 * @param[in,out] grps_global Initialized hash table to store temporary data between calls. When the module's
496 * groupings are checked, caller is supposed to free the table.
497 * @return LY_EVALID in case of collision, LY_SUCCESS otherwise.
498 */
499static LY_ERR
500lysp_check_dup_grouping(struct lys_parser_ctx *ctx, struct lysp_node *node, const struct lysp_node_grp *grp,
501 struct hash_table *grps_global)
502{
503 struct lysp_node *parent;
504 uint32_t hash;
505 size_t name_len;
506 const char *name;
507 const struct lysp_node_grp *groupings, *grp_iter;
508
509 assert(ctx);
510 assert(grp);
511
512 name = grp->name;
513 name_len = strlen(name);
514
515 /* check locally scoped groupings (avoid name shadowing) */
516 if (node) {
517 groupings = lysp_node_groupings(node);
518 LY_LIST_FOR(groupings, grp_iter) {
519 if (grp_iter == grp) {
520 break;
521 }
522 if (!strcmp(name, grp_iter->name)) {
523 LOGVAL_PARSER(ctx, LYVE_SYNTAX_YANG,
524 "Duplicate identifier \"%s\" of grouping statement - name collision with sibling grouping.", name);
525 return LY_EVALID;
526 }
527 }
528 /* search grouping in parent's nodes */
529 for (parent = node->parent; parent; parent = parent->parent) {
530 if (lysp_grouping_match(name, parent)) {
531 LOGVAL_PARSER(ctx, LYVE_SYNTAX_YANG,
532 "Duplicate identifier \"%s\" of grouping statement - name collision with another scoped grouping.", name);
533 return LY_EVALID;
534 }
535 }
536 }
537
538 /* check collision with the top-level groupings */
539 if (node) {
540 hash = dict_hash(name, name_len);
541 if (!lyht_find(grps_global, &name, hash, NULL)) {
542 LOGVAL_PARSER(ctx, LYVE_SYNTAX_YANG,
543 "Duplicate identifier \"%s\" of grouping statement - scoped grouping collide with a top-level grouping.", name);
544 return LY_EVALID;
545 }
546 } else {
547 LY_CHECK_RET(lysp_check_dup_ht_insert(ctx, grps_global, name, "grouping",
548 "name collision with another top-level grouping"));
549 }
550
551 return LY_SUCCESS;
552}
553
554LY_ERR
555lysp_check_dup_groupings(struct lys_parser_ctx *ctx, struct lysp_module *mod)
556{
557 struct hash_table *ids_global;
558 const struct lysp_node_grp *groupings, *grp_iter;
559 LY_ARRAY_COUNT_TYPE u;
560 uint32_t i;
561 LY_ERR ret = LY_SUCCESS;
562
563 ids_global = lyht_new(LYHT_MIN_SIZE, sizeof(char *), lysp_id_cmp, NULL, 1);
564 LY_LIST_FOR(mod->groupings, grp_iter) {
565 ret = lysp_check_dup_grouping(ctx, NULL, grp_iter, ids_global);
566 LY_CHECK_GOTO(ret, cleanup);
567 }
568 LY_ARRAY_FOR(mod->includes, u) {
569 LY_LIST_FOR(mod->includes[u].submodule->groupings, grp_iter) {
570 ret = lysp_check_dup_grouping(ctx, NULL, grp_iter, ids_global);
571 LY_CHECK_GOTO(ret, cleanup);
572 }
573 }
574 for (i = 0; i < ctx->grps_nodes.count; ++i) {
575 groupings = lysp_node_groupings((struct lysp_node *)ctx->grps_nodes.objs[i]);
576 LY_LIST_FOR(groupings, grp_iter) {
577 ret = lysp_check_dup_grouping(ctx, (struct lysp_node *)ctx->grps_nodes.objs[i], grp_iter, ids_global);
578 LY_CHECK_GOTO(ret, cleanup);
579 }
580 }
581
582cleanup:
583 lyht_free(ids_global);
584 return ret;
585}
586
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100587static ly_bool
588ly_ptrequal_cb(void *val1_p, void *val2_p, ly_bool UNUSED(mod), void *UNUSED(cb_data))
589{
590 void *ptr1 = *((void **)val1_p), *ptr2 = *((void **)val2_p);
591
592 return ptr1 == ptr2 ? 1 : 0;
593}
594
595LY_ERR
596lysp_check_dup_features(struct lys_parser_ctx *ctx, struct lysp_module *mod)
597{
598 LY_ARRAY_COUNT_TYPE u;
599 struct hash_table *ht;
600 struct lysp_feature *f;
aPiecekdc12b9f2021-06-25 10:55:47 +0200601 LY_ERR ret = LY_SUCCESS;
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100602
aPiecekf6203072021-06-25 10:58:26 +0200603 ht = lyht_new(LYHT_MIN_SIZE, sizeof(void *), ly_ptrequal_cb, NULL, 1);
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100604 LY_CHECK_RET(!ht, LY_EMEM);
605
606 /* add all module features into a hash table */
607 LY_ARRAY_FOR(mod->features, struct lysp_feature, f) {
aPiecekea147b32021-06-29 07:52:47 +0200608 ret = lysp_check_dup_ht_insert(ctx, ht, f->name, "feature",
609 "name collision with another top-level feature");
aPiecekdc12b9f2021-06-25 10:55:47 +0200610 LY_CHECK_GOTO(ret, cleanup);
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100611 }
612
613 /* add all submodule features into a hash table */
614 LY_ARRAY_FOR(mod->includes, u) {
615 LY_ARRAY_FOR(mod->includes[u].submodule->features, struct lysp_feature, f) {
aPiecekea147b32021-06-29 07:52:47 +0200616 ret = lysp_check_dup_ht_insert(ctx, ht, f->name, "feature",
617 "name collision with another top-level feature");
aPiecekdc12b9f2021-06-25 10:55:47 +0200618 LY_CHECK_GOTO(ret, cleanup);
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100619 }
620 }
621
622cleanup:
623 lyht_free(ht);
624 return ret;
625}
626
627LY_ERR
628lysp_check_dup_identities(struct lys_parser_ctx *ctx, struct lysp_module *mod)
629{
630 LY_ARRAY_COUNT_TYPE u;
631 struct hash_table *ht;
632 struct lysp_ident *i;
aPiecekdc12b9f2021-06-25 10:55:47 +0200633 LY_ERR ret = LY_SUCCESS;
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100634
aPiecekf6203072021-06-25 10:58:26 +0200635 ht = lyht_new(LYHT_MIN_SIZE, sizeof(void *), ly_ptrequal_cb, NULL, 1);
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100636 LY_CHECK_RET(!ht, LY_EMEM);
637
638 /* add all module identities into a hash table */
639 LY_ARRAY_FOR(mod->identities, struct lysp_ident, i) {
aPiecekea147b32021-06-29 07:52:47 +0200640 ret = lysp_check_dup_ht_insert(ctx, ht, i->name, "identity",
641 "name collision with another top-level identity");
aPiecekdc12b9f2021-06-25 10:55:47 +0200642 LY_CHECK_GOTO(ret, cleanup);
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100643 }
644
645 /* add all submodule identities into a hash table */
646 LY_ARRAY_FOR(mod->includes, u) {
647 LY_ARRAY_FOR(mod->includes[u].submodule->identities, struct lysp_ident, i) {
aPiecekea147b32021-06-29 07:52:47 +0200648 ret = lysp_check_dup_ht_insert(ctx, ht, i->name, "identity",
649 "name collision with another top-level identity");
aPiecekdc12b9f2021-06-25 10:55:47 +0200650 LY_CHECK_GOTO(ret, cleanup);
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100651 }
652 }
653
654cleanup:
655 lyht_free(ht);
656 return ret;
657}
658
Radek Krejci9ed7a192018-10-31 16:23:51 +0100659struct lysp_load_module_check_data {
660 const char *name;
661 const char *revision;
662 const char *path;
Michal Vasko22df3f02020-08-24 13:29:22 +0200663 const char *submoduleof;
Radek Krejci9ed7a192018-10-31 16:23:51 +0100664};
665
666static LY_ERR
Michal Vaskob36053d2020-03-26 15:49:30 +0100667lysp_load_module_check(const struct ly_ctx *ctx, struct lysp_module *mod, struct lysp_submodule *submod, void *data)
Radek Krejci9ed7a192018-10-31 16:23:51 +0100668{
669 struct lysp_load_module_check_data *info = data;
Radek Krejci0bcdaed2019-01-10 10:21:34 +0100670 const char *filename, *dot, *rev, *name;
Radek Krejcib3289d62019-09-18 12:21:39 +0200671 uint8_t latest_revision;
Radek Krejci9ed7a192018-10-31 16:23:51 +0100672 size_t len;
Radek Krejci0bcdaed2019-01-10 10:21:34 +0100673 struct lysp_revision *revs;
674
675 name = mod ? mod->mod->name : submod->name;
676 revs = mod ? mod->revs : submod->revs;
Radek Krejcib3289d62019-09-18 12:21:39 +0200677 latest_revision = mod ? mod->mod->latest_revision : submod->latest_revision;
Radek Krejci9ed7a192018-10-31 16:23:51 +0100678
679 if (info->name) {
680 /* check name of the parsed model */
Radek Krejci0bcdaed2019-01-10 10:21:34 +0100681 if (strcmp(info->name, name)) {
682 LOGERR(ctx, LY_EINVAL, "Unexpected module \"%s\" parsed instead of \"%s\").", name, info->name);
Radek Krejci9ed7a192018-10-31 16:23:51 +0100683 return LY_EINVAL;
684 }
685 }
686 if (info->revision) {
687 /* check revision of the parsed model */
Radek Krejci0bcdaed2019-01-10 10:21:34 +0100688 if (!revs || strcmp(info->revision, revs[0].date)) {
689 LOGERR(ctx, LY_EINVAL, "Module \"%s\" parsed with the wrong revision (\"%s\" instead \"%s\").", name,
Michal Vasko69730152020-10-09 16:30:07 +0200690 revs ? revs[0].date : "none", info->revision);
Radek Krejci9ed7a192018-10-31 16:23:51 +0100691 return LY_EINVAL;
692 }
Radek Krejcib3289d62019-09-18 12:21:39 +0200693 } else if (!latest_revision) {
694 /* do not log, we just need to drop the schema and use the latest revision from the context */
695 return LY_EEXIST;
Radek Krejci9ed7a192018-10-31 16:23:51 +0100696 }
Radek Krejci0bcdaed2019-01-10 10:21:34 +0100697 if (submod) {
698 assert(info->submoduleof);
699
Radek Krejci9ed7a192018-10-31 16:23:51 +0100700 /* check that the submodule belongs-to our module */
Michal Vaskoc3781c32020-10-06 14:04:08 +0200701 if (strcmp(info->submoduleof, submod->mod->name)) {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100702 LOGVAL(ctx, LYVE_REFERENCE, "Included \"%s\" submodule from \"%s\" belongs-to a different module \"%s\".",
Michal Vasko69730152020-10-09 16:30:07 +0200703 submod->name, info->submoduleof, submod->mod->name);
Radek Krejci9ed7a192018-10-31 16:23:51 +0100704 return LY_EVALID;
705 }
706 /* check circular dependency */
Radek Krejci0bcdaed2019-01-10 10:21:34 +0100707 if (submod->parsing) {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100708 LOGVAL(ctx, LYVE_REFERENCE, "A circular dependency (include) for module \"%s\".", submod->name);
Radek Krejci9ed7a192018-10-31 16:23:51 +0100709 return LY_EVALID;
710 }
711 }
712 if (info->path) {
713 /* check that name and revision match filename */
714 filename = strrchr(info->path, '/');
715 if (!filename) {
716 filename = info->path;
717 } else {
718 filename++;
719 }
720 /* name */
Radek Krejci0bcdaed2019-01-10 10:21:34 +0100721 len = strlen(name);
Radek Krejci9ed7a192018-10-31 16:23:51 +0100722 rev = strchr(filename, '@');
723 dot = strrchr(info->path, '.');
Radek Krejci0bcdaed2019-01-10 10:21:34 +0100724 if (strncmp(filename, name, len) ||
Michal Vasko69730152020-10-09 16:30:07 +0200725 ((rev && (rev != &filename[len])) || (!rev && (dot != &filename[len])))) {
Radek Krejci0bcdaed2019-01-10 10:21:34 +0100726 LOGWRN(ctx, "File name \"%s\" does not match module name \"%s\".", filename, name);
Radek Krejci9ed7a192018-10-31 16:23:51 +0100727 }
728 /* revision */
729 if (rev) {
730 len = dot - ++rev;
Radek Krejcif13b87b2020-12-01 22:02:17 +0100731 if (!revs || (len != LY_REV_SIZE - 1) || strncmp(revs[0].date, rev, len)) {
Radek Krejci9ed7a192018-10-31 16:23:51 +0100732 LOGWRN(ctx, "File name \"%s\" does not match module revision \"%s\".", filename,
Michal Vasko69730152020-10-09 16:30:07 +0200733 revs ? revs[0].date : "none");
Radek Krejci9ed7a192018-10-31 16:23:51 +0100734 }
735 }
736 }
737 return LY_SUCCESS;
738}
739
Michal Vaskoe7a1daf2021-04-19 18:04:27 +0200740/**
Michal Vasko4e205e82021-06-08 14:01:47 +0200741 * @brief Parse a (sub)module from a local file and add into the context.
Michal Vaskoe7a1daf2021-04-19 18:04:27 +0200742 *
743 * This function does not check the presence of the (sub)module in context, it should be done before calling this function.
744 *
Michal Vaskoe7a1daf2021-04-19 18:04:27 +0200745 * @param[in] ctx libyang context where to work.
746 * @param[in] name Name of the (sub)module to load.
747 * @param[in] revision Optional revision of the (sub)module to load, if NULL the newest revision is being loaded.
Michal Vaskoe7a1daf2021-04-19 18:04:27 +0200748 * @param[in] main_ctx Parser context of the main module in case of loading submodule.
749 * @param[in] main_name Main module name in case of loading submodule.
750 * @param[in] required Module is required so error (even if the input file not found) are important. If 0, there is some
751 * backup and it is actually ok if the input data are not found. However, parser reports errors even in this case.
Michal Vaskodd992582021-06-10 14:34:57 +0200752 * @param[in,out] new_mods Set of all the new mods added to the context. Includes this module and all of its imports.
Michal Vaskoe7a1daf2021-04-19 18:04:27 +0200753 * @param[out] result Parsed YANG schema tree of the requested module (struct lys_module*) or submodule (struct lysp_submodule*).
754 * If it is a module, it is already in the context!
Michal Vasko4e205e82021-06-08 14:01:47 +0200755 * @return LY_SUCCESS on success.
Michal Vasko4e205e82021-06-08 14:01:47 +0200756 * @return LY_ERR on error.
Michal Vaskoe7a1daf2021-04-19 18:04:27 +0200757 */
758static LY_ERR
Michal Vasko4e205e82021-06-08 14:01:47 +0200759lys_parse_localfile(struct ly_ctx *ctx, const char *name, const char *revision, struct lys_parser_ctx *main_ctx,
Michal Vaskodd992582021-06-10 14:34:57 +0200760 const char *main_name, ly_bool required, struct ly_set *new_mods, void **result)
Radek Krejci9ed7a192018-10-31 16:23:51 +0100761{
Radek Krejcif0e1ba52020-05-22 15:14:35 +0200762 struct ly_in *in;
Radek Krejci9ed7a192018-10-31 16:23:51 +0100763 char *filepath = NULL;
764 LYS_INFORMAT format;
Radek Krejci0bcdaed2019-01-10 10:21:34 +0100765 void *mod = NULL;
Radek Krejci9ed7a192018-10-31 16:23:51 +0100766 LY_ERR ret = LY_SUCCESS;
767 struct lysp_load_module_check_data check_data = {0};
768
Michal Vasko87f1cf02021-06-08 14:02:47 +0200769 LY_CHECK_RET(lys_search_localfile(ly_ctx_get_searchdirs(ctx), !(ctx->flags & LY_CTX_DISABLE_SEARCHDIR_CWD), name,
770 revision, &filepath, &format));
Michal Vasko3a41dff2020-07-15 14:30:28 +0200771 if (!filepath) {
772 if (required) {
773 LOGERR(ctx, LY_ENOTFOUND, "Data model \"%s%s%s\" not found in local searchdirs.", name, revision ? "@" : "",
Michal Vasko69730152020-10-09 16:30:07 +0200774 revision ? revision : "");
Michal Vasko3a41dff2020-07-15 14:30:28 +0200775 }
776 return LY_ENOTFOUND;
777 }
Radek Krejci9ed7a192018-10-31 16:23:51 +0100778
779 LOGVRB("Loading schema from \"%s\" file.", filepath);
780
Radek Krejcif0e1ba52020-05-22 15:14:35 +0200781 /* get the (sub)module */
Michal Vasko3a41dff2020-07-15 14:30:28 +0200782 LY_CHECK_ERR_GOTO(ret = ly_in_new_filepath(filepath, 0, &in),
Michal Vasko69730152020-10-09 16:30:07 +0200783 LOGERR(ctx, ret, "Unable to create input handler for filepath %s.", filepath), cleanup);
Radek Krejci9ed7a192018-10-31 16:23:51 +0100784 check_data.name = name;
785 check_data.revision = revision;
786 check_data.path = filepath;
fredgancd485b82019-10-18 15:00:17 +0800787 check_data.submoduleof = main_name;
Radek Krejcif0e1ba52020-05-22 15:14:35 +0200788 if (main_ctx) {
aPiecekc3e26142021-06-22 14:25:49 +0200789 ret = lys_parse_submodule(ctx, in, format, main_ctx, lysp_load_module_check, &check_data, new_mods,
Michal Vasko69730152020-10-09 16:30:07 +0200790 (struct lysp_submodule **)&mod);
Radek Krejcif0e1ba52020-05-22 15:14:35 +0200791 } else {
Michal Vaskodd992582021-06-10 14:34:57 +0200792 ret = lys_parse_in(ctx, in, format, lysp_load_module_check, &check_data, new_mods, (struct lys_module **)&mod);
Radek Krejcif0e1ba52020-05-22 15:14:35 +0200793
794 }
Radek Krejcif0e1ba52020-05-22 15:14:35 +0200795 ly_in_free(in, 1);
Michal Vasko7a0b0762020-09-02 16:37:01 +0200796 LY_CHECK_GOTO(ret, cleanup);
Radek Krejci9ed7a192018-10-31 16:23:51 +0100797
798 *result = mod;
799
800 /* success */
Michal Vasko7a0b0762020-09-02 16:37:01 +0200801
Radek Krejci9ed7a192018-10-31 16:23:51 +0100802cleanup:
803 free(filepath);
804 return ret;
805}
806
aPiecek4725aea2021-07-28 10:18:33 +0200807/**
808 * @brief Load module from searchdirs or from callback.
809 *
810 * @param[in] ctx libyang context where to work.
811 * @param[in] name Name of module to load.
812 * @param[in] revision Revision of module to load.
813 * @param[in] mod_latest Module with the latest revision found in
814 * context and the searchdirs should be searched, otherwise set to NULL.
815 * @param[in,out] new_mods Set of all the new mods added to the context.
816 * Includes this module and all of its imports.
817 * @param[out] mod Loaded module.
818 * @return LY_SUCCESS on success.
819 * @return LY_ERR on error.
820 */
821static LY_ERR
822lys_parse_load_from_clb_or_file(struct ly_ctx *ctx, const char *name, const char *revision,
823 struct lys_module *mod_latest, struct ly_set *new_mods, struct lys_module **mod)
Radek Krejci086c7132018-10-26 15:29:04 +0200824{
Radek Krejci9ed7a192018-10-31 16:23:51 +0100825 const char *module_data = NULL;
Radek Krejci086c7132018-10-26 15:29:04 +0200826 LYS_INFORMAT format = LYS_IN_UNKNOWN;
Michal Vasko69730152020-10-09 16:30:07 +0200827
Radek Krejci9ed7a192018-10-31 16:23:51 +0100828 void (*module_data_free)(void *module_data, void *user_data) = NULL;
829 struct lysp_load_module_check_data check_data = {0};
Michal Vasko63f3d842020-07-08 10:10:14 +0200830 struct ly_in *in;
Radek Krejci086c7132018-10-26 15:29:04 +0200831
aPiecek4725aea2021-07-28 10:18:33 +0200832 /* Module not present in the context, get the input data and parse it. */
833 if (!(ctx->flags & LY_CTX_PREFER_SEARCHDIRS)) {
834search_clb:
835 if (ctx->imp_clb && !ctx->imp_clb(name, revision, NULL, NULL, ctx->imp_clb_data, &format, &module_data,
836 &module_data_free)) {
837 LY_CHECK_RET(ly_in_new_memory(module_data, &in));
838 check_data.name = name;
839 check_data.revision = revision;
840 lys_parse_in(ctx, in, format, lysp_load_module_check, &check_data, new_mods, mod);
841 ly_in_free(in, 0);
842 if (module_data_free) {
843 module_data_free((void *)module_data, ctx->imp_clb_data);
Radek Krejcib3289d62019-09-18 12:21:39 +0200844 }
Radek Krejci0af46292019-01-11 16:02:31 +0100845 }
aPiecek4725aea2021-07-28 10:18:33 +0200846 if (!(*mod) && !(ctx->flags & LY_CTX_PREFER_SEARCHDIRS)) {
847 goto search_file;
848 }
849 } else {
850search_file:
851 if (!(ctx->flags & LY_CTX_DISABLE_SEARCHDIRS)) {
852 /* Module was not received from the callback or there is no callback set. */
853 lys_parse_localfile(ctx, name, revision, NULL, NULL, mod_latest ? 0 : 1, new_mods, (void **)mod);
854 }
855 if (!*mod && (ctx->flags & LY_CTX_PREFER_SEARCHDIRS)) {
856 goto search_clb;
857 }
Radek Krejci086c7132018-10-26 15:29:04 +0200858 }
859
aPiecek4725aea2021-07-28 10:18:33 +0200860 return LY_SUCCESS;
861}
862
863/**
aPiecekd4911ee2021-07-30 07:40:24 +0200864 * @brief Get module without revision according to priorities.
865 *
866 * 1. Search for the module with LYS_MOD_IMPORTED_REV.
867 * 2. Search for the implemented module.
868 * 3. Search for the latest module in the context.
869 *
870 * @param[in] ctx libyang context where module is searched.
871 * @param[in] name Name of the searched module.
872 * @param[out] keep_search Flag set to 1 if searchpaths or module
873 * callback must be searched to obtain latest available revision.
874 * @return Found module from context or NULL.
875 */
876static struct lys_module *
877lys_get_module_without_revision(struct ly_ctx *ctx, const char *name, ly_bool *keep_search)
878{
879 struct lys_module *mod, *mod_impl;
880 uint32_t index;
881
882 *keep_search = 0;
883
884 /* Try to find module with LYS_MOD_IMPORTED_REV flag. */
885 index = 0;
886 while ((mod = ly_ctx_get_module_iter(ctx, &index))) {
887 if (!strcmp(mod->name, name) && (mod->latest_revision & LYS_MOD_IMPORTED_REV)) {
888 break;
889 }
890 }
891
892 /* Try to find the implemented module. */
893 mod_impl = ly_ctx_get_module_implemented(ctx, name);
894 if (mod && mod_impl) {
895 LOGVRB("Implemented module \"%s@%s\" is not used for import, "
896 "revision \"%s\" is imported instead.",
897 mod_impl->name, mod_impl->revision, mod->revision);
898 return mod;
899 } else if (mod_impl) {
900 return mod_impl;
901 }
902
903 /* Try to find the latest module in the current context. */
904 mod = ly_ctx_get_module_latest(ctx, name);
905 *keep_search = 1;
906
907 return mod;
908}
909
910/**
aPiecek4725aea2021-07-28 10:18:33 +0200911 * @brief Check if a circular dependency exists between modules.
912 *
913 * @param[in] ctx libyang context for log an error.
914 * @param[in,out] mod Examined module which is set to NULL
915 * if the circular dependency is detected.
916 * @return LY_SUCCESS if no circular dependecy is detected,
917 * otherwise LY_EVALID.
918 */
919static LY_ERR
920lys_check_circular_dependency(struct ly_ctx *ctx, struct lys_module **mod)
921{
922 if ((*mod) && (*mod)->parsed->parsing) {
923 LOGVAL(ctx, LYVE_REFERENCE, "A circular dependency (import) for module \"%s\".", (*mod)->name);
Michal Vasko4e205e82021-06-08 14:01:47 +0200924 *mod = NULL;
925 return LY_EVALID;
Michal Vasko0550b762020-11-24 18:04:08 +0100926 }
Radek Krejci086c7132018-10-26 15:29:04 +0200927
aPiecek4725aea2021-07-28 10:18:33 +0200928 return LY_SUCCESS;
929}
930
931LY_ERR
932lys_parse_load(struct ly_ctx *ctx, const char *name, const char *revision, struct ly_set *new_mods,
933 struct lys_module **mod)
934{
aPiecekd4911ee2021-07-30 07:40:24 +0200935 ly_bool keep_search;
aPiecek4725aea2021-07-28 10:18:33 +0200936 struct lys_module *mod_latest = NULL;
937
938 assert(mod && new_mods);
939
Michal Vasko0550b762020-11-24 18:04:08 +0100940 /*
aPiecek4725aea2021-07-28 10:18:33 +0200941 * Try to get the module from the context.
Michal Vasko0550b762020-11-24 18:04:08 +0100942 */
aPiecek4725aea2021-07-28 10:18:33 +0200943 if (revision) {
944 /* Get the specific revision. */
945 *mod = ly_ctx_get_module(ctx, name, revision);
946 } else {
947 /* Get the requested module of the latest revision in the context. */
aPiecekd4911ee2021-07-30 07:40:24 +0200948 *mod = lys_get_module_without_revision(ctx, name, &keep_search);
949 if (keep_search) {
aPiecek4725aea2021-07-28 10:18:33 +0200950 /* Let us now search with callback and searchpaths to check
951 * if there is newer revision outside the context.
952 */
953 mod_latest = *mod;
954 *mod = NULL;
955 }
956 }
957
Michal Vasko0550b762020-11-24 18:04:08 +0100958 if (!*mod) {
aPiecek4725aea2021-07-28 10:18:33 +0200959 /* No suitable module in the context, try to load it. */
960 LY_CHECK_RET(lys_parse_load_from_clb_or_file(ctx, name, revision,
961 mod_latest, new_mods, mod));
Radek Krejci9ed7a192018-10-31 16:23:51 +0100962
aPiecek4725aea2021-07-28 10:18:33 +0200963 if (!*mod && !mod_latest) {
Michal Vasko4e205e82021-06-08 14:01:47 +0200964 LOGVAL(ctx, LYVE_REFERENCE, "Loading \"%s\" module failed.", name);
Michal Vasko0550b762020-11-24 18:04:08 +0100965 return LY_EVALID;
966 }
aPiecek4725aea2021-07-28 10:18:33 +0200967
968 /* Update the latest_revision flag - here we have selected the latest available schema,
969 * consider that even the callback provides correct latest revision.
970 */
971 if (!*mod) {
972 LOGVRB("Newer revision than \"%s@%s\" not found, using this as the latest revision.",
973 mod_latest->name, mod_latest->revision);
974 assert(mod_latest->latest_revision & LYS_MOD_LATEST_REV);
975 mod_latest->latest_revision |= LYS_MOD_LATEST_SEARCHDIRS;
976 *mod = mod_latest;
977 } else if (*mod && !revision && ((*mod)->latest_revision & LYS_MOD_LATEST_REV)) {
978 (*mod)->latest_revision |= LYS_MOD_LATEST_SEARCHDIRS;
979 }
Radek Krejci086c7132018-10-26 15:29:04 +0200980 }
Radek Krejci086c7132018-10-26 15:29:04 +0200981
aPiecek9f8c7e72021-07-28 12:01:56 +0200982 /* Checking the circular dependence of imported modules. */
983 LY_CHECK_RET(lys_check_circular_dependency(ctx, mod));
984
Radek Krejci086c7132018-10-26 15:29:04 +0200985 return LY_SUCCESS;
986}
987
988LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +0200989lysp_check_stringchar(struct lys_parser_ctx *ctx, uint32_t c)
David Sedlák4a650532019-07-10 11:55:18 +0200990{
991 if (!is_yangutf8char(c)) {
992 LOGVAL_PARSER(ctx, LY_VCODE_INCHAR, c);
993 return LY_EVALID;
994 }
995 return LY_SUCCESS;
996}
997
998LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +0200999lysp_check_identifierchar(struct lys_parser_ctx *ctx, uint32_t c, ly_bool first, uint8_t *prefix)
David Sedlák4a650532019-07-10 11:55:18 +02001000{
Michal Vasko69730152020-10-09 16:30:07 +02001001 if (first || (prefix && ((*prefix) == 1))) {
David Sedlák4a650532019-07-10 11:55:18 +02001002 if (!is_yangidentstartchar(c)) {
aPiecekc89b2242021-05-14 14:19:11 +02001003 if ((c < UCHAR_MAX) && isprint(c)) {
Michal Vasko7c769042021-03-25 12:20:49 +01001004 LOGVAL_PARSER(ctx, LYVE_SYNTAX_YANG, "Invalid identifier first character '%c' (0x%04x).", (char)c, c);
1005 } else {
1006 LOGVAL_PARSER(ctx, LYVE_SYNTAX_YANG, "Invalid identifier first character 0x%04x.", c);
1007 }
David Sedlák4a650532019-07-10 11:55:18 +02001008 return LY_EVALID;
1009 }
1010 if (prefix) {
1011 if (first) {
1012 (*prefix) = 0;
1013 } else {
1014 (*prefix) = 2;
1015 }
1016 }
Michal Vasko69730152020-10-09 16:30:07 +02001017 } else if ((c == ':') && prefix && ((*prefix) == 0)) {
David Sedlák4a650532019-07-10 11:55:18 +02001018 (*prefix) = 1;
1019 } else if (!is_yangidentchar(c)) {
Radek Krejci1deb5be2020-08-26 16:43:36 +02001020 LOGVAL_PARSER(ctx, LYVE_SYNTAX_YANG, "Invalid identifier character '%c' (0x%04x).", (char)c, c);
David Sedlák4a650532019-07-10 11:55:18 +02001021 return LY_EVALID;
1022 }
1023
1024 return LY_SUCCESS;
1025}
1026
Radek Krejci771928a2021-01-19 13:42:36 +01001027/**
1028 * @brief Try to find the parsed submodule in main module for the given include record.
1029 *
1030 * @param[in] pctx main parser context
1031 * @param[in] inc The include record with missing parsed submodule. According to include info try to find
1032 * the corresponding parsed submodule in main module's includes.
1033 * @return LY_SUCCESS - the parsed submodule was found and inserted into the @p inc record
1034 * @return LY_ENOT - the parsed module was not found.
1035 * @return LY_EVALID - YANG rule violation
1036 */
1037static LY_ERR
1038lysp_get_submodule(struct lys_parser_ctx *pctx, struct lysp_include *inc)
Radek Krejcid33273d2018-10-25 14:55:52 +02001039{
Radek Krejci771928a2021-01-19 13:42:36 +01001040 LY_ARRAY_COUNT_TYPE i;
1041 struct lysp_module *main_pmod = pctx->parsed_mod->mod->parsed;
Michal Vasko69730152020-10-09 16:30:07 +02001042
Radek Krejci771928a2021-01-19 13:42:36 +01001043 LY_ARRAY_FOR(main_pmod->includes, i) {
1044 if (strcmp(main_pmod->includes[i].name, inc->name)) {
1045 continue;
1046 }
Radek Krejcid33273d2018-10-25 14:55:52 +02001047
Radek Krejci771928a2021-01-19 13:42:36 +01001048 if (inc->rev[0] && strncmp(inc->rev, main_pmod->includes[i].rev, LY_REV_SIZE)) {
1049 LOGVAL(PARSER_CTX(pctx), LYVE_REFERENCE,
1050 "Submodule %s includes different revision (%s) of the submodule %s:%s included by the main module %s.",
1051 ((struct lysp_submodule *)pctx->parsed_mod)->name, inc->rev,
1052 main_pmod->includes[i].name, main_pmod->includes[i].rev, main_pmod->mod->name);
1053 return LY_EVALID;
1054 }
1055
1056 inc->submodule = main_pmod->includes[i].submodule;
1057 return inc->submodule ? LY_SUCCESS : LY_ENOT;
1058 }
1059
1060 if (main_pmod->version == LYS_VERSION_1_1) {
1061 LOGVAL(PARSER_CTX(pctx), LYVE_REFERENCE,
1062 "YANG 1.1 requires all submodules to be included from main module. "
1063 "But submodule \"%s\" includes submodule \"%s\" which is not included by main module \"%s\".",
1064 ((struct lysp_submodule *)pctx->parsed_mod)->name, inc->name, main_pmod->mod->name);
1065 return LY_EVALID;
1066 } else {
1067 return LY_ENOT;
1068 }
1069}
1070
1071/**
1072 * @brief Make the copy of the given include record into the main module.
1073 *
1074 * YANG 1.0 does not require the main module to include all the submodules. Therefore, parsing submodules can cause
1075 * reallocating and extending the includes array in the main module by the submodules included only in submodules.
1076 *
1077 * @param[in] pctx main parser context
1078 * @param[in] inc Include record to copy into main module taken from @p pctx.
1079 * @return LY_ERR value.
1080 */
1081static LY_ERR
1082lysp_inject_submodule(struct lys_parser_ctx *pctx, struct lysp_include *inc)
1083{
1084 LY_ARRAY_COUNT_TYPE i;
1085 struct lysp_include *inc_new, *inc_tofill = NULL;
1086 struct lysp_module *main_pmod = pctx->parsed_mod->mod->parsed;
1087
1088 /* first, try to find the corresponding record with missing parsed submodule */
1089 LY_ARRAY_FOR(main_pmod->includes, i) {
1090 if (strcmp(main_pmod->includes[i].name, inc->name)) {
1091 continue;
1092 }
1093 inc_tofill = &main_pmod->includes[i];
1094 break;
1095 }
1096
1097 if (inc_tofill) {
1098 inc_tofill->submodule = inc->submodule;
1099 } else {
1100 LY_ARRAY_NEW_RET(PARSER_CTX(pctx), main_pmod->includes, inc_new, LY_EMEM);
1101
1102 inc_new->submodule = inc->submodule;
1103 DUP_STRING_RET(PARSER_CTX(pctx), inc->name, inc_new->name);
1104 DUP_STRING_RET(PARSER_CTX(pctx), inc->dsc, inc_new->dsc);
1105 DUP_STRING_RET(PARSER_CTX(pctx), inc->ref, inc_new->ref);
1106 /* TODO duplicate extensions */
1107 memcpy(inc_new->rev, inc->rev, LY_REV_SIZE);
1108 inc_new->injected = 1;
1109 }
1110 return LY_SUCCESS;
1111}
1112
1113LY_ERR
aPiecekc3e26142021-06-22 14:25:49 +02001114lysp_load_submodules(struct lys_parser_ctx *pctx, struct lysp_module *pmod, struct ly_set *new_mods)
Radek Krejci771928a2021-01-19 13:42:36 +01001115{
1116 LY_ARRAY_COUNT_TYPE u;
1117 struct ly_ctx *ctx = PARSER_CTX(pctx);
1118
1119 LY_ARRAY_FOR(pmod->includes, u) {
1120 LY_ERR ret = LY_SUCCESS;
1121 struct lysp_submodule *submod = NULL;
1122 struct lysp_include *inc = &pmod->includes[u];
1123
1124 if (inc->submodule) {
1125 continue;
1126 }
1127
1128 if (pmod->is_submod) {
1129 /* try to find the submodule in the main module or its submodules */
1130 ret = lysp_get_submodule(pctx, inc);
1131 LY_CHECK_RET(ret && ret != LY_ENOT, ret);
1132 LY_CHECK_RET(ret == LY_SUCCESS, LY_SUCCESS); /* submodule found in linked with the inc */
1133 }
1134
1135 /* submodule not present in the main module, get the input data and parse it */
1136 if (!(ctx->flags & LY_CTX_PREFER_SEARCHDIRS)) {
Radek Krejcidf549132021-01-21 10:32:32 +01001137search_clb:
Radek Krejci771928a2021-01-19 13:42:36 +01001138 if (ctx->imp_clb) {
1139 const char *submodule_data = NULL;
1140 LYS_INFORMAT format = LYS_IN_UNKNOWN;
1141 void (*submodule_data_free)(void *module_data, void *user_data) = NULL;
1142 struct lysp_load_module_check_data check_data = {0};
1143 struct ly_in *in;
1144
1145 if (ctx->imp_clb(pctx->parsed_mod->mod->name, NULL, inc->name,
1146 inc->rev[0] ? inc->rev : NULL, ctx->imp_clb_data,
1147 &format, &submodule_data, &submodule_data_free) == LY_SUCCESS) {
1148 LY_CHECK_RET(ly_in_new_memory(submodule_data, &in));
1149 check_data.name = inc->name;
1150 check_data.revision = inc->rev[0] ? inc->rev : NULL;
1151 check_data.submoduleof = pctx->parsed_mod->mod->name;
aPiecekc3e26142021-06-22 14:25:49 +02001152 lys_parse_submodule(ctx, in, format, pctx, lysp_load_module_check, &check_data, new_mods, &submod);
Radek Krejci771928a2021-01-19 13:42:36 +01001153
1154 /* update inc pointer - parsing another (YANG 1.0) submodule can cause injecting
1155 * submodule's include into main module, where it is missing */
1156 inc = &pmod->includes[u];
1157
1158 ly_in_free(in, 0);
1159 if (submodule_data_free) {
1160 submodule_data_free((void *)submodule_data, ctx->imp_clb_data);
1161 }
Radek Krejcid33273d2018-10-25 14:55:52 +02001162 }
1163 }
Radek Krejci771928a2021-01-19 13:42:36 +01001164 if (!submod && !(ctx->flags & LY_CTX_PREFER_SEARCHDIRS)) {
1165 goto search_file;
1166 }
1167 } else {
Radek Krejcidf549132021-01-21 10:32:32 +01001168search_file:
Radek Krejci771928a2021-01-19 13:42:36 +01001169 if (!(ctx->flags & LY_CTX_DISABLE_SEARCHDIRS)) {
1170 /* submodule was not received from the callback or there is no callback set */
Michal Vasko4e205e82021-06-08 14:01:47 +02001171 lys_parse_localfile(ctx, inc->name, inc->rev[0] ? inc->rev : NULL, pctx,
Michal Vasko2c1ff6a2021-07-08 12:30:07 +02001172 pctx->parsed_mod->mod->name, 1, new_mods, (void **)&submod);
Radek Krejcibbe09a92018-11-08 09:36:54 +01001173
Radek Krejci771928a2021-01-19 13:42:36 +01001174 /* update inc pointer - parsing another (YANG 1.0) submodule can cause injecting
1175 * submodule's include into main module, where it is missing */
1176 inc = &pmod->includes[u];
1177 }
1178 if (!submod && (ctx->flags & LY_CTX_PREFER_SEARCHDIRS)) {
1179 goto search_clb;
1180 }
1181 }
1182 if (submod) {
1183 if (!inc->rev[0] && (submod->latest_revision == 1)) {
1184 /* update the latest_revision flag - here we have selected the latest available schema,
1185 * consider that even the callback provides correct latest revision */
1186 submod->latest_revision = 2;
1187 }
1188
1189 inc->submodule = submod;
1190 if (ret == LY_ENOT) {
1191 /* the submodule include is not present in YANG 1.0 main module - add it there */
1192 LY_CHECK_RET(lysp_inject_submodule(pctx, &pmod->includes[u]));
1193 }
1194 }
1195 if (!inc->submodule) {
1196 LOGVAL(ctx, LYVE_REFERENCE, "Including \"%s\" submodule into \"%s\" failed.", inc->name,
1197 pctx->parsed_mod->is_submod ? ((struct lysp_submodule *)pctx->parsed_mod)->name : pctx->parsed_mod->mod->name);
1198 return LY_EVALID;
1199 }
Radek Krejcid33273d2018-10-25 14:55:52 +02001200 }
1201
1202 return LY_SUCCESS;
1203}
1204
Michal Vaskod5cfa6e2020-11-23 16:56:08 +01001205API const struct lysc_when *
1206lysc_has_when(const struct lysc_node *node)
1207{
Radek Krejci9a3823e2021-01-27 20:26:46 +01001208 struct lysc_when **when;
1209
Michal Vaskod5cfa6e2020-11-23 16:56:08 +01001210 if (!node) {
1211 return NULL;
1212 }
1213
1214 do {
Radek Krejci9a3823e2021-01-27 20:26:46 +01001215 when = lysc_node_when(node);
1216 if (when) {
1217 return when[0];
Michal Vaskod5cfa6e2020-11-23 16:56:08 +01001218 }
1219 node = node->parent;
1220 } while (node && (node->nodetype & (LYS_CASE | LYS_CHOICE)));
1221
1222 return NULL;
1223}
1224
Radek Krejci0935f412019-08-20 16:15:18 +02001225API const char *
Radek Krejcia3045382018-11-22 14:30:31 +01001226lys_nodetype2str(uint16_t nodetype)
1227{
Michal Vaskod989ba02020-08-24 10:59:24 +02001228 switch (nodetype) {
Radek Krejcia3045382018-11-22 14:30:31 +01001229 case LYS_CONTAINER:
1230 return "container";
1231 case LYS_CHOICE:
1232 return "choice";
1233 case LYS_LEAF:
1234 return "leaf";
1235 case LYS_LEAFLIST:
1236 return "leaf-list";
1237 case LYS_LIST:
1238 return "list";
1239 case LYS_ANYXML:
1240 return "anyxml";
1241 case LYS_ANYDATA:
1242 return "anydata";
Radek Krejcif12a1f02019-02-11 16:42:08 +01001243 case LYS_CASE:
1244 return "case";
Michal Vasko1bf09392020-03-27 12:38:10 +01001245 case LYS_RPC:
1246 return "RPC";
Radek Krejcif538ce52019-03-05 10:46:14 +01001247 case LYS_ACTION:
Michal Vasko1bf09392020-03-27 12:38:10 +01001248 return "action";
Radek Krejcif538ce52019-03-05 10:46:14 +01001249 case LYS_NOTIF:
Michal Vaskoa3881362020-01-21 15:57:35 +01001250 return "notification";
Radek Krejcifc81ea82019-04-18 13:27:22 +02001251 case LYS_USES:
1252 return "uses";
Radek Krejcia3045382018-11-22 14:30:31 +01001253 default:
1254 return "unknown";
1255 }
1256}
1257
Radek Krejci39b7fc22021-02-26 23:29:18 +01001258API enum ly_stmt
1259lys_nodetype2stmt(uint16_t nodetype)
1260{
1261 switch (nodetype) {
1262 case LYS_CONTAINER:
1263 return LY_STMT_CONTAINER;
1264 case LYS_CHOICE:
1265 return LY_STMT_CHOICE;
1266 case LYS_LEAF:
1267 return LY_STMT_LEAF;
1268 case LYS_LEAFLIST:
1269 return LY_STMT_LEAF_LIST;
1270 case LYS_LIST:
1271 return LY_STMT_LIST;
1272 case LYS_ANYXML:
1273 return LY_STMT_ANYXML;
1274 case LYS_ANYDATA:
1275 return LY_STMT_ANYDATA;
1276 case LYS_CASE:
1277 return LY_STMT_CASE;
1278 case LYS_RPC:
1279 return LY_STMT_RPC;
1280 case LYS_ACTION:
1281 return LY_STMT_ACTION;
1282 case LYS_NOTIF:
1283 return LY_STMT_NOTIFICATION;
1284 case LYS_USES:
1285 return LY_STMT_USES;
1286 case LYS_INPUT:
1287 return LY_STMT_INPUT;
1288 case LYS_OUTPUT:
1289 return LY_STMT_OUTPUT;
1290 default:
1291 return LY_STMT_NONE;
1292 }
1293}
1294
Radek Krejci693262f2019-04-29 15:23:20 +02001295const char *
1296lys_datatype2str(LY_DATA_TYPE basetype)
1297{
Michal Vaskod989ba02020-08-24 10:59:24 +02001298 switch (basetype) {
Radek Krejci693262f2019-04-29 15:23:20 +02001299 case LY_TYPE_BINARY:
1300 return "binary";
1301 case LY_TYPE_UINT8:
1302 return "uint8";
1303 case LY_TYPE_UINT16:
1304 return "uint16";
1305 case LY_TYPE_UINT32:
1306 return "uint32";
1307 case LY_TYPE_UINT64:
1308 return "uint64";
1309 case LY_TYPE_STRING:
1310 return "string";
1311 case LY_TYPE_BITS:
1312 return "bits";
1313 case LY_TYPE_BOOL:
1314 return "boolean";
1315 case LY_TYPE_DEC64:
1316 return "decimal64";
1317 case LY_TYPE_EMPTY:
1318 return "empty";
1319 case LY_TYPE_ENUM:
1320 return "enumeration";
1321 case LY_TYPE_IDENT:
1322 return "identityref";
1323 case LY_TYPE_INST:
1324 return "instance-identifier";
1325 case LY_TYPE_LEAFREF:
1326 return "leafref";
1327 case LY_TYPE_UNION:
1328 return "union";
1329 case LY_TYPE_INT8:
1330 return "int8";
1331 case LY_TYPE_INT16:
1332 return "int16";
1333 case LY_TYPE_INT32:
1334 return "int32";
1335 case LY_TYPE_INT64:
1336 return "int64";
1337 default:
1338 return "unknown";
1339 }
1340}
1341
Radek Krejci056d0a82018-12-06 16:57:25 +01001342API const struct lysp_tpdf *
1343lysp_node_typedefs(const struct lysp_node *node)
1344{
Radek Krejci0fb28562018-12-13 15:17:37 +01001345 switch (node->nodetype) {
1346 case LYS_CONTAINER:
Michal Vasko22df3f02020-08-24 13:29:22 +02001347 return ((struct lysp_node_container *)node)->typedefs;
Radek Krejci0fb28562018-12-13 15:17:37 +01001348 case LYS_LIST:
Michal Vasko22df3f02020-08-24 13:29:22 +02001349 return ((struct lysp_node_list *)node)->typedefs;
Radek Krejci0fb28562018-12-13 15:17:37 +01001350 case LYS_GROUPING:
Radek Krejci2a9fc652021-01-22 17:44:34 +01001351 return ((struct lysp_node_grp *)node)->typedefs;
Michal Vasko1bf09392020-03-27 12:38:10 +01001352 case LYS_RPC:
Radek Krejci0fb28562018-12-13 15:17:37 +01001353 case LYS_ACTION:
Radek Krejci2a9fc652021-01-22 17:44:34 +01001354 return ((struct lysp_node_action *)node)->typedefs;
Michal Vasko7f45cf22020-10-01 12:49:44 +02001355 case LYS_INPUT:
1356 case LYS_OUTPUT:
Radek Krejci2a9fc652021-01-22 17:44:34 +01001357 return ((struct lysp_node_action_inout *)node)->typedefs;
Radek Krejci0fb28562018-12-13 15:17:37 +01001358 case LYS_NOTIF:
Radek Krejci2a9fc652021-01-22 17:44:34 +01001359 return ((struct lysp_node_notif *)node)->typedefs;
Radek Krejci0fb28562018-12-13 15:17:37 +01001360 default:
Radek Krejci056d0a82018-12-06 16:57:25 +01001361 return NULL;
1362 }
1363}
1364
Radek Krejci2a9fc652021-01-22 17:44:34 +01001365API const struct lysp_node_grp *
Radek Krejci53ea6152018-12-13 15:21:15 +01001366lysp_node_groupings(const struct lysp_node *node)
1367{
1368 switch (node->nodetype) {
1369 case LYS_CONTAINER:
Michal Vasko22df3f02020-08-24 13:29:22 +02001370 return ((struct lysp_node_container *)node)->groupings;
Radek Krejci53ea6152018-12-13 15:21:15 +01001371 case LYS_LIST:
Michal Vasko22df3f02020-08-24 13:29:22 +02001372 return ((struct lysp_node_list *)node)->groupings;
Radek Krejci53ea6152018-12-13 15:21:15 +01001373 case LYS_GROUPING:
Radek Krejci2a9fc652021-01-22 17:44:34 +01001374 return ((struct lysp_node_grp *)node)->groupings;
Michal Vasko1bf09392020-03-27 12:38:10 +01001375 case LYS_RPC:
Radek Krejci53ea6152018-12-13 15:21:15 +01001376 case LYS_ACTION:
Radek Krejci2a9fc652021-01-22 17:44:34 +01001377 return ((struct lysp_node_action *)node)->groupings;
Michal Vasko7f45cf22020-10-01 12:49:44 +02001378 case LYS_INPUT:
1379 case LYS_OUTPUT:
Radek Krejci2a9fc652021-01-22 17:44:34 +01001380 return ((struct lysp_node_action_inout *)node)->groupings;
Radek Krejci53ea6152018-12-13 15:21:15 +01001381 case LYS_NOTIF:
Radek Krejci2a9fc652021-01-22 17:44:34 +01001382 return ((struct lysp_node_notif *)node)->groupings;
Radek Krejci53ea6152018-12-13 15:21:15 +01001383 default:
1384 return NULL;
1385 }
1386}
1387
Radek Krejci2a9fc652021-01-22 17:44:34 +01001388struct lysp_node_action **
Radek Krejci056d0a82018-12-06 16:57:25 +01001389lysp_node_actions_p(struct lysp_node *node)
Radek Krejcibbe09a92018-11-08 09:36:54 +01001390{
1391 assert(node);
Michal Vasko7f45cf22020-10-01 12:49:44 +02001392
Radek Krejcibbe09a92018-11-08 09:36:54 +01001393 switch (node->nodetype) {
1394 case LYS_CONTAINER:
Michal Vasko22df3f02020-08-24 13:29:22 +02001395 return &((struct lysp_node_container *)node)->actions;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001396 case LYS_LIST:
Michal Vasko22df3f02020-08-24 13:29:22 +02001397 return &((struct lysp_node_list *)node)->actions;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001398 case LYS_GROUPING:
Radek Krejci2a9fc652021-01-22 17:44:34 +01001399 return &((struct lysp_node_grp *)node)->actions;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001400 case LYS_AUGMENT:
Radek Krejci2a9fc652021-01-22 17:44:34 +01001401 return &((struct lysp_node_augment *)node)->actions;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001402 default:
1403 return NULL;
1404 }
1405}
1406
Radek Krejci2a9fc652021-01-22 17:44:34 +01001407API const struct lysp_node_action *
Radek Krejci056d0a82018-12-06 16:57:25 +01001408lysp_node_actions(const struct lysp_node *node)
1409{
Radek Krejci2a9fc652021-01-22 17:44:34 +01001410 struct lysp_node_action **actions;
Michal Vasko69730152020-10-09 16:30:07 +02001411
Michal Vasko22df3f02020-08-24 13:29:22 +02001412 actions = lysp_node_actions_p((struct lysp_node *)node);
Radek Krejci056d0a82018-12-06 16:57:25 +01001413 if (actions) {
1414 return *actions;
1415 } else {
1416 return NULL;
1417 }
1418}
1419
Radek Krejci2a9fc652021-01-22 17:44:34 +01001420struct lysp_node_notif **
Radek Krejci056d0a82018-12-06 16:57:25 +01001421lysp_node_notifs_p(struct lysp_node *node)
Radek Krejcibbe09a92018-11-08 09:36:54 +01001422{
1423 assert(node);
1424 switch (node->nodetype) {
1425 case LYS_CONTAINER:
Michal Vasko22df3f02020-08-24 13:29:22 +02001426 return &((struct lysp_node_container *)node)->notifs;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001427 case LYS_LIST:
Michal Vasko22df3f02020-08-24 13:29:22 +02001428 return &((struct lysp_node_list *)node)->notifs;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001429 case LYS_GROUPING:
Radek Krejci2a9fc652021-01-22 17:44:34 +01001430 return &((struct lysp_node_grp *)node)->notifs;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001431 case LYS_AUGMENT:
Radek Krejci2a9fc652021-01-22 17:44:34 +01001432 return &((struct lysp_node_augment *)node)->notifs;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001433 default:
1434 return NULL;
1435 }
1436}
1437
Radek Krejci2a9fc652021-01-22 17:44:34 +01001438API const struct lysp_node_notif *
Radek Krejci056d0a82018-12-06 16:57:25 +01001439lysp_node_notifs(const struct lysp_node *node)
1440{
Radek Krejci2a9fc652021-01-22 17:44:34 +01001441 struct lysp_node_notif **notifs;
Michal Vasko69730152020-10-09 16:30:07 +02001442
Michal Vasko22df3f02020-08-24 13:29:22 +02001443 notifs = lysp_node_notifs_p((struct lysp_node *)node);
Radek Krejci056d0a82018-12-06 16:57:25 +01001444 if (notifs) {
1445 return *notifs;
1446 } else {
1447 return NULL;
1448 }
1449}
1450
Radek Krejcibbe09a92018-11-08 09:36:54 +01001451struct lysp_node **
Michal Vasko544e58a2021-01-28 14:33:41 +01001452lysp_node_child_p(struct lysp_node *node)
Radek Krejcibbe09a92018-11-08 09:36:54 +01001453{
1454 assert(node);
1455 switch (node->nodetype) {
1456 case LYS_CONTAINER:
Michal Vasko22df3f02020-08-24 13:29:22 +02001457 return &((struct lysp_node_container *)node)->child;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001458 case LYS_CHOICE:
Michal Vasko22df3f02020-08-24 13:29:22 +02001459 return &((struct lysp_node_choice *)node)->child;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001460 case LYS_LIST:
Michal Vasko22df3f02020-08-24 13:29:22 +02001461 return &((struct lysp_node_list *)node)->child;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001462 case LYS_CASE:
Michal Vasko22df3f02020-08-24 13:29:22 +02001463 return &((struct lysp_node_case *)node)->child;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001464 case LYS_GROUPING:
Radek Krejci01180ac2021-01-27 08:48:22 +01001465 return &((struct lysp_node_grp *)node)->child;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001466 case LYS_AUGMENT:
Radek Krejci2a9fc652021-01-22 17:44:34 +01001467 return &((struct lysp_node_augment *)node)->child;
Michal Vasko7f45cf22020-10-01 12:49:44 +02001468 case LYS_INPUT:
1469 case LYS_OUTPUT:
Radek Krejci01180ac2021-01-27 08:48:22 +01001470 return &((struct lysp_node_action_inout *)node)->child;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001471 case LYS_NOTIF:
Radek Krejci01180ac2021-01-27 08:48:22 +01001472 return &((struct lysp_node_notif *)node)->child;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001473 default:
1474 return NULL;
1475 }
1476}
1477
Radek Krejci056d0a82018-12-06 16:57:25 +01001478API const struct lysp_node *
Michal Vasko544e58a2021-01-28 14:33:41 +01001479lysp_node_child(const struct lysp_node *node)
Radek Krejci056d0a82018-12-06 16:57:25 +01001480{
Michal Vasko544e58a2021-01-28 14:33:41 +01001481 struct lysp_node **child;
Radek Krejcie7b95092019-05-15 11:03:07 +02001482
1483 if (!node) {
1484 return NULL;
1485 }
1486
Michal Vasko544e58a2021-01-28 14:33:41 +01001487 child = lysp_node_child_p((struct lysp_node *)node);
1488 if (child) {
1489 return *child;
Radek Krejci056d0a82018-12-06 16:57:25 +01001490 } else {
1491 return NULL;
1492 }
1493}
1494
Radek Krejci9a3823e2021-01-27 20:26:46 +01001495struct lysp_restr **
1496lysp_node_musts_p(const struct lysp_node *node)
1497{
1498 if (!node) {
1499 return NULL;
1500 }
1501
Radek Krejci2d5f6df2021-01-28 14:00:13 +01001502 switch (node->nodetype) {
Radek Krejci9a3823e2021-01-27 20:26:46 +01001503 case LYS_CONTAINER:
1504 return &((struct lysp_node_container *)node)->musts;
1505 case LYS_LEAF:
1506 return &((struct lysp_node_leaf *)node)->musts;
1507 case LYS_LEAFLIST:
1508 return &((struct lysp_node_leaflist *)node)->musts;
1509 case LYS_LIST:
1510 return &((struct lysp_node_list *)node)->musts;
1511 case LYS_ANYXML:
1512 case LYS_ANYDATA:
1513 return &((struct lysp_node_anydata *)node)->musts;
1514 case LYS_NOTIF:
1515 return &((struct lysp_node_notif *)node)->musts;
1516 case LYS_INPUT:
1517 case LYS_OUTPUT:
1518 return &((struct lysp_node_action_inout *)node)->musts;
1519 default:
1520 return NULL;
1521 }
1522}
1523
1524struct lysp_restr *
1525lysp_node_musts(const struct lysp_node *node)
1526{
1527 struct lysp_restr **musts;
1528
1529 musts = lysp_node_musts_p(node);
1530 if (musts) {
1531 return *musts;
1532 } else {
1533 return NULL;
1534 }
1535}
1536
1537struct lysp_when **
1538lysp_node_when_p(const struct lysp_node *node)
1539{
1540 if (!node) {
1541 return NULL;
1542 }
1543
Radek Krejci2d5f6df2021-01-28 14:00:13 +01001544 switch (node->nodetype) {
Radek Krejci9a3823e2021-01-27 20:26:46 +01001545 case LYS_CONTAINER:
1546 return &((struct lysp_node_container *)node)->when;
1547 case LYS_CHOICE:
1548 return &((struct lysp_node_choice *)node)->when;
1549 case LYS_LEAF:
1550 return &((struct lysp_node_leaf *)node)->when;
1551 case LYS_LEAFLIST:
1552 return &((struct lysp_node_leaflist *)node)->when;
1553 case LYS_LIST:
1554 return &((struct lysp_node_list *)node)->when;
1555 case LYS_ANYXML:
1556 case LYS_ANYDATA:
1557 return &((struct lysp_node_anydata *)node)->when;
1558 case LYS_CASE:
1559 return &((struct lysp_node_case *)node)->when;
1560 case LYS_USES:
1561 return &((struct lysp_node_uses *)node)->when;
1562 case LYS_AUGMENT:
1563 return &((struct lysp_node_augment *)node)->when;
1564 default:
1565 return NULL;
1566 }
1567}
1568
1569struct lysp_when *
1570lysp_node_when(const struct lysp_node *node)
1571{
1572 struct lysp_when **when;
1573
1574 when = lysp_node_when_p(node);
1575 if (when) {
1576 return *when;
1577 } else {
1578 return NULL;
1579 }
1580}
1581
Radek Krejci2a9fc652021-01-22 17:44:34 +01001582struct lysc_node_action **
Radek Krejci056d0a82018-12-06 16:57:25 +01001583lysc_node_actions_p(struct lysc_node *node)
1584{
1585 assert(node);
1586 switch (node->nodetype) {
1587 case LYS_CONTAINER:
Michal Vasko22df3f02020-08-24 13:29:22 +02001588 return &((struct lysc_node_container *)node)->actions;
Radek Krejci056d0a82018-12-06 16:57:25 +01001589 case LYS_LIST:
Michal Vasko22df3f02020-08-24 13:29:22 +02001590 return &((struct lysc_node_list *)node)->actions;
Radek Krejci056d0a82018-12-06 16:57:25 +01001591 default:
1592 return NULL;
1593 }
1594}
1595
Radek Krejci2a9fc652021-01-22 17:44:34 +01001596API const struct lysc_node_action *
Radek Krejci056d0a82018-12-06 16:57:25 +01001597lysc_node_actions(const struct lysc_node *node)
1598{
Radek Krejci2a9fc652021-01-22 17:44:34 +01001599 struct lysc_node_action **actions;
Michal Vasko69730152020-10-09 16:30:07 +02001600
Michal Vasko22df3f02020-08-24 13:29:22 +02001601 actions = lysc_node_actions_p((struct lysc_node *)node);
Radek Krejci056d0a82018-12-06 16:57:25 +01001602 if (actions) {
1603 return *actions;
1604 } else {
1605 return NULL;
1606 }
1607}
1608
Radek Krejci2a9fc652021-01-22 17:44:34 +01001609struct lysc_node_notif **
Radek Krejci056d0a82018-12-06 16:57:25 +01001610lysc_node_notifs_p(struct lysc_node *node)
1611{
1612 assert(node);
1613 switch (node->nodetype) {
1614 case LYS_CONTAINER:
Michal Vasko22df3f02020-08-24 13:29:22 +02001615 return &((struct lysc_node_container *)node)->notifs;
Radek Krejci056d0a82018-12-06 16:57:25 +01001616 case LYS_LIST:
Michal Vasko22df3f02020-08-24 13:29:22 +02001617 return &((struct lysc_node_list *)node)->notifs;
Radek Krejci056d0a82018-12-06 16:57:25 +01001618 default:
1619 return NULL;
1620 }
1621}
1622
Radek Krejci2a9fc652021-01-22 17:44:34 +01001623API const struct lysc_node_notif *
Radek Krejci056d0a82018-12-06 16:57:25 +01001624lysc_node_notifs(const struct lysc_node *node)
1625{
Radek Krejci2a9fc652021-01-22 17:44:34 +01001626 struct lysc_node_notif **notifs;
Michal Vasko69730152020-10-09 16:30:07 +02001627
Michal Vasko22df3f02020-08-24 13:29:22 +02001628 notifs = lysc_node_notifs_p((struct lysc_node *)node);
Radek Krejci056d0a82018-12-06 16:57:25 +01001629 if (notifs) {
1630 return *notifs;
1631 } else {
1632 return NULL;
1633 }
1634}
1635
Radek Krejcibbe09a92018-11-08 09:36:54 +01001636struct lysc_node **
Michal Vasko544e58a2021-01-28 14:33:41 +01001637lysc_node_child_p(const struct lysc_node *node)
Radek Krejcibbe09a92018-11-08 09:36:54 +01001638{
Michal Vasko544e58a2021-01-28 14:33:41 +01001639 assert(node && !(node->nodetype & (LYS_RPC | LYS_ACTION)));
1640
Radek Krejcibbe09a92018-11-08 09:36:54 +01001641 switch (node->nodetype) {
1642 case LYS_CONTAINER:
Michal Vasko22df3f02020-08-24 13:29:22 +02001643 return &((struct lysc_node_container *)node)->child;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001644 case LYS_CHOICE:
Michal Vasko20424b42020-08-31 12:29:38 +02001645 return (struct lysc_node **)&((struct lysc_node_choice *)node)->cases;
Radek Krejci01342af2019-01-03 15:18:08 +01001646 case LYS_CASE:
Michal Vasko22df3f02020-08-24 13:29:22 +02001647 return &((struct lysc_node_case *)node)->child;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001648 case LYS_LIST:
Michal Vasko22df3f02020-08-24 13:29:22 +02001649 return &((struct lysc_node_list *)node)->child;
Michal Vasko7f45cf22020-10-01 12:49:44 +02001650 case LYS_INPUT:
1651 case LYS_OUTPUT:
Radek Krejci01180ac2021-01-27 08:48:22 +01001652 return &((struct lysc_node_action_inout *)node)->child;
Radek Krejcifc11bd72019-04-11 16:00:05 +02001653 case LYS_NOTIF:
Radek Krejci01180ac2021-01-27 08:48:22 +01001654 return &((struct lysc_node_notif *)node)->child;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001655 default:
1656 return NULL;
1657 }
1658}
1659
Radek Krejci056d0a82018-12-06 16:57:25 +01001660API const struct lysc_node *
Michal Vasko544e58a2021-01-28 14:33:41 +01001661lysc_node_child(const struct lysc_node *node)
Radek Krejcia3045382018-11-22 14:30:31 +01001662{
Michal Vasko544e58a2021-01-28 14:33:41 +01001663 struct lysc_node **child;
Radek Krejcie7b95092019-05-15 11:03:07 +02001664
1665 if (!node) {
1666 return NULL;
1667 }
1668
Michal Vasko544e58a2021-01-28 14:33:41 +01001669 if (node->nodetype & (LYS_RPC | LYS_ACTION)) {
1670 return &((struct lysc_node_action *)node)->input.node;
Radek Krejcibe154442021-01-21 11:06:36 +01001671 } else {
Michal Vasko544e58a2021-01-28 14:33:41 +01001672 child = lysc_node_child_p(node);
1673 if (child) {
1674 return *child;
Radek Krejci2a9fc652021-01-22 17:44:34 +01001675 }
Michal Vasko2a668712020-10-21 11:48:09 +02001676 }
Michal Vasko544e58a2021-01-28 14:33:41 +01001677
1678 return NULL;
Michal Vasko2a668712020-10-21 11:48:09 +02001679}
1680
Radek Krejci9a3823e2021-01-27 20:26:46 +01001681struct lysc_must **
1682lysc_node_musts_p(const struct lysc_node *node)
1683{
1684 if (!node) {
1685 return NULL;
1686 }
1687
Radek Krejci2d5f6df2021-01-28 14:00:13 +01001688 switch (node->nodetype) {
Radek Krejci9a3823e2021-01-27 20:26:46 +01001689 case LYS_CONTAINER:
1690 return &((struct lysc_node_container *)node)->musts;
1691 case LYS_LEAF:
1692 return &((struct lysc_node_leaf *)node)->musts;
1693 case LYS_LEAFLIST:
1694 return &((struct lysc_node_leaflist *)node)->musts;
1695 case LYS_LIST:
1696 return &((struct lysc_node_list *)node)->musts;
1697 case LYS_ANYXML:
1698 case LYS_ANYDATA:
1699 return &((struct lysc_node_anydata *)node)->musts;
1700 case LYS_NOTIF:
1701 return &((struct lysc_node_notif *)node)->musts;
1702 case LYS_INPUT:
1703 case LYS_OUTPUT:
1704 return &((struct lysc_node_action_inout *)node)->musts;
1705 default:
1706 return NULL;
1707 }
1708}
1709
1710API struct lysc_must *
1711lysc_node_musts(const struct lysc_node *node)
1712{
1713 struct lysc_must **must_p;
1714
1715 must_p = lysc_node_musts_p(node);
1716 if (must_p) {
1717 return *must_p;
1718 } else {
1719 return NULL;
1720 }
1721}
1722
1723struct lysc_when ***
1724lysc_node_when_p(const struct lysc_node *node)
1725{
1726 if (!node) {
1727 return NULL;
1728 }
1729
Radek Krejci2d5f6df2021-01-28 14:00:13 +01001730 switch (node->nodetype) {
Radek Krejci9a3823e2021-01-27 20:26:46 +01001731 case LYS_CONTAINER:
1732 return &((struct lysc_node_container *)node)->when;
1733 case LYS_CHOICE:
1734 return &((struct lysc_node_choice *)node)->when;
1735 case LYS_LEAF:
1736 return &((struct lysc_node_leaf *)node)->when;
1737 case LYS_LEAFLIST:
1738 return &((struct lysc_node_leaflist *)node)->when;
1739 case LYS_LIST:
1740 return &((struct lysc_node_list *)node)->when;
1741 case LYS_ANYXML:
1742 case LYS_ANYDATA:
1743 return &((struct lysc_node_anydata *)node)->when;
1744 case LYS_CASE:
1745 return &((struct lysc_node_case *)node)->when;
1746 case LYS_NOTIF:
1747 return &((struct lysc_node_notif *)node)->when;
1748 case LYS_RPC:
1749 case LYS_ACTION:
1750 return &((struct lysc_node_action *)node)->when;
1751 default:
1752 return NULL;
1753 }
1754}
1755
1756API struct lysc_when **
1757lysc_node_when(const struct lysc_node *node)
1758{
1759 struct lysc_when ***when_p;
1760
1761 when_p = lysc_node_when_p(node);
1762 if (when_p) {
1763 return *when_p;
1764 } else {
1765 return NULL;
1766 }
1767}
1768
Radek Krejci96a0bfd2018-11-22 15:25:06 +01001769struct lys_module *
1770lysp_find_module(struct ly_ctx *ctx, const struct lysp_module *mod)
1771{
Radek Krejci1deb5be2020-08-26 16:43:36 +02001772 for (uint32_t u = 0; u < ctx->list.count; ++u) {
Michal Vasko22df3f02020-08-24 13:29:22 +02001773 if (((struct lys_module *)ctx->list.objs[u])->parsed == mod) {
Michal Vasko69730152020-10-09 16:30:07 +02001774 return (struct lys_module *)ctx->list.objs[u];
Radek Krejci96a0bfd2018-11-22 15:25:06 +01001775 }
1776 }
1777 return NULL;
1778}
1779
Radek Krejcid6b76452019-09-03 17:03:03 +02001780enum ly_stmt
Radek Krejcid54412f2020-12-17 20:25:35 +01001781lysp_match_kw(struct ly_in *in, uint64_t *indent)
David Sedlákc10e7902018-12-17 02:17:59 +01001782{
David Sedlák1bccdfa2019-06-17 15:55:27 +02001783/**
Radek Krejcid54412f2020-12-17 20:25:35 +01001784 * @brief Move the input by COUNT items. Also updates the indent value in yang parser context
David Sedlák1bccdfa2019-06-17 15:55:27 +02001785 * @param[in] COUNT number of items for which the DATA pointer is supposed to move on.
Michal Vasko64246d82020-08-19 12:35:00 +02001786 *
1787 * *INDENT-OFF*
David Sedlák1bccdfa2019-06-17 15:55:27 +02001788 */
Radek Krejcid54412f2020-12-17 20:25:35 +01001789#define MOVE_IN(COUNT) \
1790 ly_in_skip(in, COUNT); \
1791 if (indent) { \
1792 (*indent)+=COUNT; \
1793 }
1794#define IF_KW(STR, LEN, STMT) \
1795 if (!strncmp(in->current, STR, LEN)) { \
1796 MOVE_IN(LEN); \
1797 (*kw)=STMT; \
1798 }
1799#define IF_KW_PREFIX(STR, LEN) \
1800 if (!strncmp(in->current, STR, LEN)) { \
1801 MOVE_IN(LEN);
1802#define IF_KW_PREFIX_END \
1803 }
David Sedlák572e7ab2019-06-04 16:01:58 +02001804
Michal Vasko63f3d842020-07-08 10:10:14 +02001805 const char *start = in->current;
Radek Krejcid6b76452019-09-03 17:03:03 +02001806 enum ly_stmt result = LY_STMT_NONE;
1807 enum ly_stmt *kw = &result;
David Sedlák1bccdfa2019-06-17 15:55:27 +02001808 /* read the keyword itself */
Michal Vasko63f3d842020-07-08 10:10:14 +02001809 switch (in->current[0]) {
David Sedlák23a59a62018-10-26 13:08:02 +02001810 case 'a':
Radek Krejcid54412f2020-12-17 20:25:35 +01001811 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02001812 IF_KW("rgument", 7, LY_STMT_ARGUMENT)
1813 else IF_KW("ugment", 6, LY_STMT_AUGMENT)
1814 else IF_KW("ction", 5, LY_STMT_ACTION)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001815 else IF_KW_PREFIX("ny", 2)
Radek Krejcid6b76452019-09-03 17:03:03 +02001816 IF_KW("data", 4, LY_STMT_ANYDATA)
1817 else IF_KW("xml", 3, LY_STMT_ANYXML)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001818 IF_KW_PREFIX_END
David Sedlák23a59a62018-10-26 13:08:02 +02001819 break;
1820 case 'b':
Radek Krejcid54412f2020-12-17 20:25:35 +01001821 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02001822 IF_KW("ase", 3, LY_STMT_BASE)
1823 else IF_KW("elongs-to", 9, LY_STMT_BELONGS_TO)
1824 else IF_KW("it", 2, LY_STMT_BIT)
David Sedlák23a59a62018-10-26 13:08:02 +02001825 break;
1826 case 'c':
Radek Krejcid54412f2020-12-17 20:25:35 +01001827 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02001828 IF_KW("ase", 3, LY_STMT_CASE)
1829 else IF_KW("hoice", 5, LY_STMT_CHOICE)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001830 else IF_KW_PREFIX("on", 2)
Radek Krejcid6b76452019-09-03 17:03:03 +02001831 IF_KW("fig", 3, LY_STMT_CONFIG)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001832 else IF_KW_PREFIX("ta", 2)
Radek Krejcid6b76452019-09-03 17:03:03 +02001833 IF_KW("ct", 2, LY_STMT_CONTACT)
1834 else IF_KW("iner", 4, LY_STMT_CONTAINER)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001835 IF_KW_PREFIX_END
1836 IF_KW_PREFIX_END
David Sedlák23a59a62018-10-26 13:08:02 +02001837 break;
1838 case 'd':
Radek Krejcid54412f2020-12-17 20:25:35 +01001839 MOVE_IN(1);
David Sedlák1bccdfa2019-06-17 15:55:27 +02001840 IF_KW_PREFIX("e", 1)
Radek Krejcid6b76452019-09-03 17:03:03 +02001841 IF_KW("fault", 5, LY_STMT_DEFAULT)
1842 else IF_KW("scription", 9, LY_STMT_DESCRIPTION)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001843 else IF_KW_PREFIX("viat", 4)
Radek Krejcid6b76452019-09-03 17:03:03 +02001844 IF_KW("e", 1, LY_STMT_DEVIATE)
1845 else IF_KW("ion", 3, LY_STMT_DEVIATION)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001846 IF_KW_PREFIX_END
1847 IF_KW_PREFIX_END
David Sedlák23a59a62018-10-26 13:08:02 +02001848 break;
1849 case 'e':
Radek Krejcid54412f2020-12-17 20:25:35 +01001850 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02001851 IF_KW("num", 3, LY_STMT_ENUM)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001852 else IF_KW_PREFIX("rror-", 5)
Radek Krejcid6b76452019-09-03 17:03:03 +02001853 IF_KW("app-tag", 7, LY_STMT_ERROR_APP_TAG)
1854 else IF_KW("message", 7, LY_STMT_ERROR_MESSAGE)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001855 IF_KW_PREFIX_END
Radek Krejcid6b76452019-09-03 17:03:03 +02001856 else IF_KW("xtension", 8, LY_STMT_EXTENSION)
David Sedlák23a59a62018-10-26 13:08:02 +02001857 break;
1858 case 'f':
Radek Krejcid54412f2020-12-17 20:25:35 +01001859 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02001860 IF_KW("eature", 6, LY_STMT_FEATURE)
1861 else IF_KW("raction-digits", 14, LY_STMT_FRACTION_DIGITS)
David Sedlák23a59a62018-10-26 13:08:02 +02001862 break;
1863 case 'g':
Radek Krejcid54412f2020-12-17 20:25:35 +01001864 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02001865 IF_KW("rouping", 7, LY_STMT_GROUPING)
David Sedlák23a59a62018-10-26 13:08:02 +02001866 break;
1867 case 'i':
Radek Krejcid54412f2020-12-17 20:25:35 +01001868 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02001869 IF_KW("dentity", 7, LY_STMT_IDENTITY)
1870 else IF_KW("f-feature", 9, LY_STMT_IF_FEATURE)
1871 else IF_KW("mport", 5, LY_STMT_IMPORT)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001872 else IF_KW_PREFIX("n", 1)
Radek Krejcid6b76452019-09-03 17:03:03 +02001873 IF_KW("clude", 5, LY_STMT_INCLUDE)
1874 else IF_KW("put", 3, LY_STMT_INPUT)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001875 IF_KW_PREFIX_END
David Sedlák23a59a62018-10-26 13:08:02 +02001876 break;
1877 case 'k':
Radek Krejcid54412f2020-12-17 20:25:35 +01001878 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02001879 IF_KW("ey", 2, LY_STMT_KEY)
David Sedlák23a59a62018-10-26 13:08:02 +02001880 break;
1881 case 'l':
Radek Krejcid54412f2020-12-17 20:25:35 +01001882 MOVE_IN(1);
David Sedlák1bccdfa2019-06-17 15:55:27 +02001883 IF_KW_PREFIX("e", 1)
Radek Krejcid6b76452019-09-03 17:03:03 +02001884 IF_KW("af-list", 7, LY_STMT_LEAF_LIST)
1885 else IF_KW("af", 2, LY_STMT_LEAF)
1886 else IF_KW("ngth", 4, LY_STMT_LENGTH)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001887 IF_KW_PREFIX_END
Radek Krejcid6b76452019-09-03 17:03:03 +02001888 else IF_KW("ist", 3, LY_STMT_LIST)
David Sedlák23a59a62018-10-26 13:08:02 +02001889 break;
1890 case 'm':
Radek Krejcid54412f2020-12-17 20:25:35 +01001891 MOVE_IN(1);
David Sedlák1bccdfa2019-06-17 15:55:27 +02001892 IF_KW_PREFIX("a", 1)
Radek Krejcid6b76452019-09-03 17:03:03 +02001893 IF_KW("ndatory", 7, LY_STMT_MANDATORY)
1894 else IF_KW("x-elements", 10, LY_STMT_MAX_ELEMENTS)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001895 IF_KW_PREFIX_END
Radek Krejcid6b76452019-09-03 17:03:03 +02001896 else IF_KW("in-elements", 11, LY_STMT_MIN_ELEMENTS)
1897 else IF_KW("ust", 3, LY_STMT_MUST)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001898 else IF_KW_PREFIX("od", 2)
Radek Krejcid6b76452019-09-03 17:03:03 +02001899 IF_KW("ule", 3, LY_STMT_MODULE)
1900 else IF_KW("ifier", 5, LY_STMT_MODIFIER)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001901 IF_KW_PREFIX_END
David Sedlák23a59a62018-10-26 13:08:02 +02001902 break;
1903 case 'n':
Radek Krejcid54412f2020-12-17 20:25:35 +01001904 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02001905 IF_KW("amespace", 8, LY_STMT_NAMESPACE)
1906 else IF_KW("otification", 11, LY_STMT_NOTIFICATION)
David Sedlák23a59a62018-10-26 13:08:02 +02001907 break;
1908 case 'o':
Radek Krejcid54412f2020-12-17 20:25:35 +01001909 MOVE_IN(1);
David Sedlák1bccdfa2019-06-17 15:55:27 +02001910 IF_KW_PREFIX("r", 1)
Radek Krejcid6b76452019-09-03 17:03:03 +02001911 IF_KW("dered-by", 8, LY_STMT_ORDERED_BY)
1912 else IF_KW("ganization", 10, LY_STMT_ORGANIZATION)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001913 IF_KW_PREFIX_END
Radek Krejcid6b76452019-09-03 17:03:03 +02001914 else IF_KW("utput", 5, LY_STMT_OUTPUT)
David Sedlák23a59a62018-10-26 13:08:02 +02001915 break;
1916 case 'p':
Radek Krejcid54412f2020-12-17 20:25:35 +01001917 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02001918 IF_KW("ath", 3, LY_STMT_PATH)
1919 else IF_KW("attern", 6, LY_STMT_PATTERN)
1920 else IF_KW("osition", 7, LY_STMT_POSITION)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001921 else IF_KW_PREFIX("re", 2)
Radek Krejcid6b76452019-09-03 17:03:03 +02001922 IF_KW("fix", 3, LY_STMT_PREFIX)
1923 else IF_KW("sence", 5, LY_STMT_PRESENCE)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001924 IF_KW_PREFIX_END
David Sedlák23a59a62018-10-26 13:08:02 +02001925 break;
1926 case 'r':
Radek Krejcid54412f2020-12-17 20:25:35 +01001927 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02001928 IF_KW("ange", 4, LY_STMT_RANGE)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001929 else IF_KW_PREFIX("e", 1)
1930 IF_KW_PREFIX("f", 1)
Radek Krejcid6b76452019-09-03 17:03:03 +02001931 IF_KW("erence", 6, LY_STMT_REFERENCE)
1932 else IF_KW("ine", 3, LY_STMT_REFINE)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001933 IF_KW_PREFIX_END
Radek Krejcid6b76452019-09-03 17:03:03 +02001934 else IF_KW("quire-instance", 14, LY_STMT_REQUIRE_INSTANCE)
1935 else IF_KW("vision-date", 11, LY_STMT_REVISION_DATE)
1936 else IF_KW("vision", 6, LY_STMT_REVISION)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001937 IF_KW_PREFIX_END
Radek Krejcid6b76452019-09-03 17:03:03 +02001938 else IF_KW("pc", 2, LY_STMT_RPC)
David Sedlák23a59a62018-10-26 13:08:02 +02001939 break;
1940 case 's':
Radek Krejcid54412f2020-12-17 20:25:35 +01001941 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02001942 IF_KW("tatus", 5, LY_STMT_STATUS)
1943 else IF_KW("ubmodule", 8, LY_STMT_SUBMODULE)
David Sedlák23a59a62018-10-26 13:08:02 +02001944 break;
1945 case 't':
Radek Krejcid54412f2020-12-17 20:25:35 +01001946 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02001947 IF_KW("ypedef", 6, LY_STMT_TYPEDEF)
1948 else IF_KW("ype", 3, LY_STMT_TYPE)
David Sedlák23a59a62018-10-26 13:08:02 +02001949 break;
1950 case 'u':
Radek Krejcid54412f2020-12-17 20:25:35 +01001951 MOVE_IN(1);
David Sedlák1bccdfa2019-06-17 15:55:27 +02001952 IF_KW_PREFIX("ni", 2)
Radek Krejcid6b76452019-09-03 17:03:03 +02001953 IF_KW("que", 3, LY_STMT_UNIQUE)
1954 else IF_KW("ts", 2, LY_STMT_UNITS)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001955 IF_KW_PREFIX_END
Radek Krejcid6b76452019-09-03 17:03:03 +02001956 else IF_KW("ses", 3, LY_STMT_USES)
David Sedlák23a59a62018-10-26 13:08:02 +02001957 break;
1958 case 'v':
Radek Krejcid54412f2020-12-17 20:25:35 +01001959 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02001960 IF_KW("alue", 4, LY_STMT_VALUE)
David Sedlák23a59a62018-10-26 13:08:02 +02001961 break;
1962 case 'w':
Radek Krejcid54412f2020-12-17 20:25:35 +01001963 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02001964 IF_KW("hen", 3, LY_STMT_WHEN)
David Sedlák23a59a62018-10-26 13:08:02 +02001965 break;
1966 case 'y':
Radek Krejcid54412f2020-12-17 20:25:35 +01001967 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02001968 IF_KW("ang-version", 11, LY_STMT_YANG_VERSION)
1969 else IF_KW("in-element", 10, LY_STMT_YIN_ELEMENT)
David Sedlák23a59a62018-10-26 13:08:02 +02001970 break;
David Sedlák23a59a62018-10-26 13:08:02 +02001971 default:
Radek Krejcid54412f2020-12-17 20:25:35 +01001972 /* if indent is not NULL we are matching keyword from YANG data */
1973 if (indent) {
Michal Vasko63f3d842020-07-08 10:10:14 +02001974 if (in->current[0] == ';') {
Radek Krejcid54412f2020-12-17 20:25:35 +01001975 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02001976 *kw = LY_STMT_SYNTAX_SEMICOLON;
Michal Vasko63f3d842020-07-08 10:10:14 +02001977 } else if (in->current[0] == '{') {
Radek Krejcid54412f2020-12-17 20:25:35 +01001978 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02001979 *kw = LY_STMT_SYNTAX_LEFT_BRACE;
Michal Vasko63f3d842020-07-08 10:10:14 +02001980 } else if (in->current[0] == '}') {
Radek Krejcid54412f2020-12-17 20:25:35 +01001981 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02001982 *kw = LY_STMT_SYNTAX_RIGHT_BRACE;
David Sedlák1bccdfa2019-06-17 15:55:27 +02001983 }
1984 }
David Sedlák23a59a62018-10-26 13:08:02 +02001985 break;
1986 }
1987
Michal Vasko63f3d842020-07-08 10:10:14 +02001988 if ((*kw < LY_STMT_SYNTAX_SEMICOLON) && isalnum(in->current[0])) {
Radek Krejci6e546bf2020-05-19 16:16:19 +02001989 /* the keyword is not terminated */
1990 *kw = LY_STMT_NONE;
Michal Vasko63f3d842020-07-08 10:10:14 +02001991 in->current = start;
Radek Krejci6e546bf2020-05-19 16:16:19 +02001992 }
1993
David Sedlák1bccdfa2019-06-17 15:55:27 +02001994#undef IF_KW
1995#undef IF_KW_PREFIX
1996#undef IF_KW_PREFIX_END
David Sedlák18730132019-03-15 15:51:34 +01001997#undef MOVE_IN
Michal Vasko64246d82020-08-19 12:35:00 +02001998 /* *INDENT-ON* */
David Sedlák18730132019-03-15 15:51:34 +01001999
David Sedlák1bccdfa2019-06-17 15:55:27 +02002000 return result;
David Sedlák23a59a62018-10-26 13:08:02 +02002001}
David Sedlákecf5eb82019-06-03 14:12:44 +02002002
Radek Krejci85ac8312021-03-03 20:21:33 +01002003LY_ERR
2004lysp_ext_find_definition(const struct ly_ctx *ctx, const struct lysp_ext_instance *ext, const struct lys_module **ext_mod,
2005 struct lysp_ext **ext_def)
2006{
Radek Krejci85ac8312021-03-03 20:21:33 +01002007 const char *tmp, *name, *prefix;
2008 size_t pref_len, name_len;
2009 LY_ARRAY_COUNT_TYPE v;
2010 const struct lys_module *mod = NULL;
2011
Radek Krejcicbb62422021-03-15 09:29:21 +01002012 assert(ext_def);
2013
Radek Krejci85ac8312021-03-03 20:21:33 +01002014 *ext_def = NULL;
2015 if (ext_mod) {
2016 *ext_mod = NULL;
2017 }
2018
Radek Krejci677abea2021-03-05 14:24:53 +01002019 /* parse the prefix, the nodeid was previously already parsed and checked */
Radek Krejci85ac8312021-03-03 20:21:33 +01002020 tmp = ext->name;
Radek Krejci677abea2021-03-05 14:24:53 +01002021 ly_parse_nodeid(&tmp, &prefix, &pref_len, &name, &name_len);
Radek Krejci85ac8312021-03-03 20:21:33 +01002022
2023 /* get module where the extension definition should be placed */
2024 mod = ly_resolve_prefix(ctx, prefix, pref_len, ext->format, ext->prefix_data);
2025 if (!mod) {
Radek Krejci422afb12021-03-04 16:38:16 +01002026 LOGVAL(ctx, LYVE_REFERENCE, "Invalid prefix \"%.*s\" used for extension instance identifier.", (int)pref_len, prefix);
Radek Krejci85ac8312021-03-03 20:21:33 +01002027 return LY_EVALID;
2028 } else if (!mod->parsed->extensions) {
2029 LOGVAL(ctx, LYVE_REFERENCE, "Extension instance \"%s\" refers \"%s\" module that does not contain extension definitions.",
2030 ext->name, mod->name);
2031 return LY_EVALID;
2032 }
2033
2034 /* find the parsed extension definition there */
2035 LY_ARRAY_FOR(mod->parsed->extensions, v) {
2036 if (!strcmp(name, mod->parsed->extensions[v].name)) {
2037 *ext_def = &mod->parsed->extensions[v];
2038 break;
2039 }
2040 }
2041
Radek Krejcicbb62422021-03-15 09:29:21 +01002042 if (!(*ext_def)) {
Radek Krejci85ac8312021-03-03 20:21:33 +01002043 LOGVAL(ctx, LYVE_REFERENCE, "Extension definition of extension instance \"%s\" not found.", ext->name);
2044 return LY_EVALID;
2045 }
2046
2047 if (ext_mod) {
2048 *ext_mod = mod;
2049 }
2050 return LY_SUCCESS;
2051}
2052
2053LY_ERR
2054lysp_ext_instance_resolve_argument(struct ly_ctx *ctx, struct lysp_ext_instance *ext_p, struct lysp_ext *ext_def)
2055{
Radek Krejci9f87b0c2021-03-05 14:45:26 +01002056 if (!ext_def->argname || ext_p->argument) {
Radek Krejci85ac8312021-03-03 20:21:33 +01002057 /* nothing to do */
2058 return LY_SUCCESS;
2059 }
2060
Radek Krejci8df109d2021-04-23 12:19:08 +02002061 if (ext_p->format == LY_VALUE_XML) {
Radek Krejci85ac8312021-03-03 20:21:33 +01002062 /* Schema was parsed from YIN and an argument is expected, ... */
2063 struct lysp_stmt *stmt = NULL;
2064
2065 if (ext_def->flags & LYS_YINELEM_TRUE) {
2066 /* ... argument was the first XML child element */
2067 for (stmt = ext_p->child; stmt && (stmt->flags & LYS_YIN_ATTR); stmt = stmt->next) {}
2068 if (stmt) {
2069 const char *arg, *ext, *name_arg, *name_ext, *prefix_arg, *prefix_ext;
2070 size_t name_arg_len, name_ext_len, prefix_arg_len, prefix_ext_len;
2071
2072 stmt = ext_p->child;
2073
2074 arg = stmt->stmt;
2075 ly_parse_nodeid(&arg, &prefix_arg, &prefix_arg_len, &name_arg, &name_arg_len);
Radek Krejci9f87b0c2021-03-05 14:45:26 +01002076 if (ly_strncmp(ext_def->argname, name_arg, name_arg_len)) {
Radek Krejci85ac8312021-03-03 20:21:33 +01002077 LOGVAL(ctx, LYVE_SEMANTICS, "Extension instance \"%s\" expects argument element \"%s\" as its first XML child, "
Radek Krejci9f87b0c2021-03-05 14:45:26 +01002078 "but \"%.*s\" element found.", ext_p->name, ext_def->argname, (int)name_arg_len, name_arg);
Radek Krejci85ac8312021-03-03 20:21:33 +01002079 return LY_EVALID;
2080 }
2081
2082 /* check namespace - all the extension instances must be qualified and argument element is expected in the same
2083 * namespace. Do not check just prefixes, there can be different prefixes pointing to the same namespace */
2084 ext = ext_p->name; /* include prefix */
2085 ly_parse_nodeid(&ext, &prefix_ext, &prefix_ext_len, &name_ext, &name_ext_len);
2086
2087 if (ly_resolve_prefix(ctx, prefix_ext, prefix_ext_len, ext_p->format, ext_p->prefix_data) !=
2088 ly_resolve_prefix(ctx, prefix_arg, prefix_arg_len, stmt->format, stmt->prefix_data)) {
2089 LOGVAL(ctx, LYVE_SEMANTICS, "Extension instance \"%s\" element and its argument element \"%s\" are "
Radek Krejci9f87b0c2021-03-05 14:45:26 +01002090 "expected in the same namespace, but they differ.", ext_p->name, ext_def->argname);
Radek Krejci85ac8312021-03-03 20:21:33 +01002091 return LY_EVALID;
2092 }
2093 }
2094 } else {
2095 /* ... argument was one of the XML attributes which are represented as child stmt
2096 * with LYS_YIN_ATTR flag */
2097 for (stmt = ext_p->child; stmt && (stmt->flags & LYS_YIN_ATTR); stmt = stmt->next) {
Radek Krejci9f87b0c2021-03-05 14:45:26 +01002098 if (!strcmp(stmt->stmt, ext_def->argname)) {
Radek Krejci85ac8312021-03-03 20:21:33 +01002099 /* this is the extension's argument */
2100 break;
2101 }
2102 }
2103 }
2104
2105 if (stmt) {
2106 LY_CHECK_RET(lydict_insert(ctx, stmt->arg, 0, &ext_p->argument));
2107 stmt->flags |= LYS_YIN_ARGUMENT;
2108 }
2109 }
2110
2111 if (!ext_p->argument) {
2112 /* missing extension's argument */
2113 LOGVAL(ctx, LYVE_SEMANTICS, "Extension instance \"%s\" misses argument %s\"%s\".",
Radek Krejci9f87b0c2021-03-05 14:45:26 +01002114 ext_p->name, (ext_def->flags & LYS_YINELEM_TRUE) ? "element " : "", ext_def->argname);
Radek Krejci85ac8312021-03-03 20:21:33 +01002115 return LY_EVALID;
2116 }
2117
2118 return LY_SUCCESS;
2119}
2120
Michal Vaskofd69e1d2020-07-03 11:57:17 +02002121LY_ARRAY_COUNT_TYPE
Radek Krejcifc596f92021-02-26 22:40:26 +01002122lysp_ext_instance_iter(struct lysp_ext_instance *ext, LY_ARRAY_COUNT_TYPE index, enum ly_stmt substmt)
Radek Krejcid3ca0632019-04-16 16:54:54 +02002123{
2124 LY_CHECK_ARG_RET(NULL, ext, LY_EINVAL);
2125
Michal Vaskod989ba02020-08-24 10:59:24 +02002126 for ( ; index < LY_ARRAY_COUNT(ext); index++) {
Radek Krejciab430862021-03-02 20:13:40 +01002127 if (ext[index].parent_stmt == substmt) {
Radek Krejcid3ca0632019-04-16 16:54:54 +02002128 return index;
2129 }
2130 }
2131
Michal Vaskofd69e1d2020-07-03 11:57:17 +02002132 return LY_ARRAY_COUNT(ext);
Radek Krejcid3ca0632019-04-16 16:54:54 +02002133}
2134
Michal Vasko62ed12d2020-05-21 10:08:25 +02002135const struct lysc_node *
Michal Vasko72244882021-01-12 15:21:05 +01002136lysc_data_node(const struct lysc_node *schema)
Michal Vasko62ed12d2020-05-21 10:08:25 +02002137{
2138 const struct lysc_node *parent;
2139
Michal Vasko72244882021-01-12 15:21:05 +01002140 parent = schema;
Radek Krejcidf549132021-01-21 10:32:32 +01002141 while (parent && !(parent->nodetype & (LYS_CONTAINER | LYS_LEAF | LYS_LEAFLIST | LYS_LIST | LYS_ANYDATA | LYS_RPC |
2142 LYS_ACTION | LYS_NOTIF))) {
Radek Krejci7d95fbb2021-01-26 17:33:13 +01002143 parent = parent->parent;
Michal Vasko72244882021-01-12 15:21:05 +01002144 }
Michal Vasko62ed12d2020-05-21 10:08:25 +02002145
2146 return parent;
2147}
Michal Vaskof4258e12021-06-15 12:11:42 +02002148
2149ly_bool
2150lys_has_recompiled(const struct lys_module *mod)
2151{
2152 LY_ARRAY_COUNT_TYPE u;
2153
2154 if (LYSP_HAS_RECOMPILED(mod->parsed)) {
2155 return 1;
2156 }
2157
2158 LY_ARRAY_FOR(mod->parsed->includes, u) {
2159 if (LYSP_HAS_RECOMPILED(mod->parsed->includes[u].submodule)) {
2160 return 1;
2161 }
2162 }
2163
2164 return 0;
2165}
2166
2167ly_bool
2168lys_has_compiled(const struct lys_module *mod)
2169{
2170 LY_ARRAY_COUNT_TYPE u;
2171
2172 if (LYSP_HAS_COMPILED(mod->parsed)) {
2173 return 1;
2174 }
2175
2176 LY_ARRAY_FOR(mod->parsed->includes, u) {
2177 if (LYSP_HAS_COMPILED(mod->parsed->includes[u].submodule)) {
2178 return 1;
2179 }
2180 }
2181
2182 return 0;
2183}
Michal Vasko7ee5be22021-06-16 17:03:34 +02002184
2185ly_bool
2186lys_has_groupings(const struct lys_module *mod)
2187{
2188 LY_ARRAY_COUNT_TYPE u;
2189
2190 if (mod->parsed->groupings) {
2191 return 1;
2192 }
2193
2194 LY_ARRAY_FOR(mod->parsed->includes, u) {
2195 if (mod->parsed->includes[u].submodule->groupings) {
2196 return 1;
2197 }
2198 }
2199
2200 return 0;
2201}