blob: 6340e1c7be2b462760819f891d3afe3bec7d207f [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
Michal Vasko8a67eff2021-12-07 14:04:47 +01001038lysp_main_pmod_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;
Michal Vasko8a67eff2021-12-07 14:04:47 +01001041 struct lysp_module *main_pmod = PARSER_CUR_PMOD(pctx)->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.",
Michal Vasko8a67eff2021-12-07 14:04:47 +01001051 ((struct lysp_submodule *)PARSER_CUR_PMOD(pctx))->name, inc->rev,
Radek Krejci771928a2021-01-19 13:42:36 +01001052 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\".",
Michal Vasko8a67eff2021-12-07 14:04:47 +01001064 ((struct lysp_submodule *)PARSER_CUR_PMOD(pctx))->name, inc->name, main_pmod->mod->name);
Radek Krejci771928a2021-01-19 13:42:36 +01001065 return LY_EVALID;
1066 } else {
1067 return LY_ENOT;
1068 }
1069}
1070
1071/**
Michal Vasko8a67eff2021-12-07 14:04:47 +01001072 * @brief Try to find the parsed submodule in currenlty parsed modules for the given include record.
1073 *
1074 * @param[in] pctx main parser context
1075 * @param[in] inc The include record with missing parsed submodule.
1076 * @return LY_SUCCESS - the parsed submodule was found and inserted into the @p inc record
1077 * @return LY_ENOT - the parsed module was not found.
1078 * @return LY_EVALID - YANG rule violation
1079 */
1080static LY_ERR
1081lysp_parsed_mods_get_submodule(struct lys_parser_ctx *pctx, struct lysp_include *inc)
1082{
1083 uint32_t i;
1084 struct lysp_submodule *submod;
1085
1086 for (i = 0; i < pctx->parsed_mods->count - 1; ++i) {
1087 submod = pctx->parsed_mods->objs[i];
1088 if (!submod->is_submod) {
1089 continue;
1090 }
1091
1092 if (strcmp(submod->name, inc->name)) {
1093 continue;
1094 }
1095
1096 if (inc->rev[0] && submod->revs && strncmp(inc->rev, submod->revs[0].date, LY_REV_SIZE)) {
1097 LOGVAL(PARSER_CTX(pctx), LYVE_REFERENCE,
1098 "Submodule %s includes different revision (%s) of the submodule %s:%s included by the main module %s.",
1099 ((struct lysp_submodule *)PARSER_CUR_PMOD(pctx))->name, inc->rev,
1100 submod->name, submod->revs[0].date, PARSER_CUR_PMOD(pctx)->mod->name);
1101 return LY_EVALID;
1102 }
1103
1104 inc->submodule = submod;
1105 return LY_SUCCESS;
1106 }
1107
1108 return LY_ENOT;
1109}
1110
1111/**
Radek Krejci771928a2021-01-19 13:42:36 +01001112 * @brief Make the copy of the given include record into the main module.
1113 *
1114 * YANG 1.0 does not require the main module to include all the submodules. Therefore, parsing submodules can cause
1115 * reallocating and extending the includes array in the main module by the submodules included only in submodules.
1116 *
1117 * @param[in] pctx main parser context
1118 * @param[in] inc Include record to copy into main module taken from @p pctx.
1119 * @return LY_ERR value.
1120 */
1121static LY_ERR
1122lysp_inject_submodule(struct lys_parser_ctx *pctx, struct lysp_include *inc)
1123{
1124 LY_ARRAY_COUNT_TYPE i;
1125 struct lysp_include *inc_new, *inc_tofill = NULL;
Michal Vasko8a67eff2021-12-07 14:04:47 +01001126 struct lysp_module *main_pmod = PARSER_CUR_PMOD(pctx)->mod->parsed;
Radek Krejci771928a2021-01-19 13:42:36 +01001127
1128 /* first, try to find the corresponding record with missing parsed submodule */
1129 LY_ARRAY_FOR(main_pmod->includes, i) {
1130 if (strcmp(main_pmod->includes[i].name, inc->name)) {
1131 continue;
1132 }
1133 inc_tofill = &main_pmod->includes[i];
1134 break;
1135 }
1136
1137 if (inc_tofill) {
1138 inc_tofill->submodule = inc->submodule;
1139 } else {
1140 LY_ARRAY_NEW_RET(PARSER_CTX(pctx), main_pmod->includes, inc_new, LY_EMEM);
1141
1142 inc_new->submodule = inc->submodule;
1143 DUP_STRING_RET(PARSER_CTX(pctx), inc->name, inc_new->name);
1144 DUP_STRING_RET(PARSER_CTX(pctx), inc->dsc, inc_new->dsc);
1145 DUP_STRING_RET(PARSER_CTX(pctx), inc->ref, inc_new->ref);
1146 /* TODO duplicate extensions */
1147 memcpy(inc_new->rev, inc->rev, LY_REV_SIZE);
1148 inc_new->injected = 1;
1149 }
1150 return LY_SUCCESS;
1151}
1152
1153LY_ERR
aPiecekc3e26142021-06-22 14:25:49 +02001154lysp_load_submodules(struct lys_parser_ctx *pctx, struct lysp_module *pmod, struct ly_set *new_mods)
Radek Krejci771928a2021-01-19 13:42:36 +01001155{
1156 LY_ARRAY_COUNT_TYPE u;
1157 struct ly_ctx *ctx = PARSER_CTX(pctx);
1158
1159 LY_ARRAY_FOR(pmod->includes, u) {
Michal Vasko8a67eff2021-12-07 14:04:47 +01001160 LY_ERR ret = LY_SUCCESS, r;
Radek Krejci771928a2021-01-19 13:42:36 +01001161 struct lysp_submodule *submod = NULL;
1162 struct lysp_include *inc = &pmod->includes[u];
1163
1164 if (inc->submodule) {
1165 continue;
1166 }
1167
1168 if (pmod->is_submod) {
1169 /* try to find the submodule in the main module or its submodules */
Michal Vasko8a67eff2021-12-07 14:04:47 +01001170 ret = lysp_main_pmod_get_submodule(pctx, inc);
1171 LY_CHECK_RET(ret != LY_ENOT, ret);
Radek Krejci771928a2021-01-19 13:42:36 +01001172 }
1173
Michal Vasko8a67eff2021-12-07 14:04:47 +01001174 /* try to use currently parsed submodule */
1175 r = lysp_parsed_mods_get_submodule(pctx, inc);
1176 LY_CHECK_RET(r != LY_ENOT, r);
1177
Radek Krejci771928a2021-01-19 13:42:36 +01001178 /* submodule not present in the main module, get the input data and parse it */
1179 if (!(ctx->flags & LY_CTX_PREFER_SEARCHDIRS)) {
Radek Krejcidf549132021-01-21 10:32:32 +01001180search_clb:
Radek Krejci771928a2021-01-19 13:42:36 +01001181 if (ctx->imp_clb) {
1182 const char *submodule_data = NULL;
1183 LYS_INFORMAT format = LYS_IN_UNKNOWN;
1184 void (*submodule_data_free)(void *module_data, void *user_data) = NULL;
1185 struct lysp_load_module_check_data check_data = {0};
1186 struct ly_in *in;
1187
Michal Vasko8a67eff2021-12-07 14:04:47 +01001188 if (ctx->imp_clb(PARSER_CUR_PMOD(pctx)->mod->name, NULL, inc->name,
Radek Krejci771928a2021-01-19 13:42:36 +01001189 inc->rev[0] ? inc->rev : NULL, ctx->imp_clb_data,
1190 &format, &submodule_data, &submodule_data_free) == LY_SUCCESS) {
1191 LY_CHECK_RET(ly_in_new_memory(submodule_data, &in));
1192 check_data.name = inc->name;
1193 check_data.revision = inc->rev[0] ? inc->rev : NULL;
Michal Vasko8a67eff2021-12-07 14:04:47 +01001194 check_data.submoduleof = PARSER_CUR_PMOD(pctx)->mod->name;
aPiecekc3e26142021-06-22 14:25:49 +02001195 lys_parse_submodule(ctx, in, format, pctx, lysp_load_module_check, &check_data, new_mods, &submod);
Radek Krejci771928a2021-01-19 13:42:36 +01001196
1197 /* update inc pointer - parsing another (YANG 1.0) submodule can cause injecting
1198 * submodule's include into main module, where it is missing */
1199 inc = &pmod->includes[u];
1200
1201 ly_in_free(in, 0);
1202 if (submodule_data_free) {
1203 submodule_data_free((void *)submodule_data, ctx->imp_clb_data);
1204 }
Radek Krejcid33273d2018-10-25 14:55:52 +02001205 }
1206 }
Radek Krejci771928a2021-01-19 13:42:36 +01001207 if (!submod && !(ctx->flags & LY_CTX_PREFER_SEARCHDIRS)) {
1208 goto search_file;
1209 }
1210 } else {
Radek Krejcidf549132021-01-21 10:32:32 +01001211search_file:
Radek Krejci771928a2021-01-19 13:42:36 +01001212 if (!(ctx->flags & LY_CTX_DISABLE_SEARCHDIRS)) {
1213 /* submodule was not received from the callback or there is no callback set */
Michal Vasko4e205e82021-06-08 14:01:47 +02001214 lys_parse_localfile(ctx, inc->name, inc->rev[0] ? inc->rev : NULL, pctx,
Michal Vasko8a67eff2021-12-07 14:04:47 +01001215 PARSER_CUR_PMOD(pctx)->mod->name, 1, new_mods, (void **)&submod);
Radek Krejcibbe09a92018-11-08 09:36:54 +01001216
Radek Krejci771928a2021-01-19 13:42:36 +01001217 /* update inc pointer - parsing another (YANG 1.0) submodule can cause injecting
1218 * submodule's include into main module, where it is missing */
1219 inc = &pmod->includes[u];
1220 }
1221 if (!submod && (ctx->flags & LY_CTX_PREFER_SEARCHDIRS)) {
1222 goto search_clb;
1223 }
1224 }
1225 if (submod) {
1226 if (!inc->rev[0] && (submod->latest_revision == 1)) {
1227 /* update the latest_revision flag - here we have selected the latest available schema,
1228 * consider that even the callback provides correct latest revision */
1229 submod->latest_revision = 2;
1230 }
1231
1232 inc->submodule = submod;
1233 if (ret == LY_ENOT) {
1234 /* the submodule include is not present in YANG 1.0 main module - add it there */
1235 LY_CHECK_RET(lysp_inject_submodule(pctx, &pmod->includes[u]));
1236 }
1237 }
1238 if (!inc->submodule) {
1239 LOGVAL(ctx, LYVE_REFERENCE, "Including \"%s\" submodule into \"%s\" failed.", inc->name,
Michal Vasko8a67eff2021-12-07 14:04:47 +01001240 PARSER_CUR_PMOD(pctx)->is_submod ? ((struct lysp_submodule *)PARSER_CUR_PMOD(pctx))->name :
1241 PARSER_CUR_PMOD(pctx)->mod->name);
Radek Krejci771928a2021-01-19 13:42:36 +01001242 return LY_EVALID;
1243 }
Radek Krejcid33273d2018-10-25 14:55:52 +02001244 }
1245
1246 return LY_SUCCESS;
1247}
1248
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001249LIBYANG_API_DEF const struct lysc_when *
Michal Vaskod5cfa6e2020-11-23 16:56:08 +01001250lysc_has_when(const struct lysc_node *node)
1251{
Radek Krejci9a3823e2021-01-27 20:26:46 +01001252 struct lysc_when **when;
1253
Michal Vaskod5cfa6e2020-11-23 16:56:08 +01001254 if (!node) {
1255 return NULL;
1256 }
1257
1258 do {
Radek Krejci9a3823e2021-01-27 20:26:46 +01001259 when = lysc_node_when(node);
1260 if (when) {
1261 return when[0];
Michal Vaskod5cfa6e2020-11-23 16:56:08 +01001262 }
1263 node = node->parent;
1264 } while (node && (node->nodetype & (LYS_CASE | LYS_CHOICE)));
1265
1266 return NULL;
1267}
1268
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001269LIBYANG_API_DEF const struct lys_module *
Michal Vaskoef53c812021-10-13 10:21:03 +02001270lysc_owner_module(const struct lysc_node *node)
1271{
1272 if (!node) {
1273 return NULL;
1274 }
1275
1276 for ( ; node->parent; node = node->parent) {}
1277 return node->module;
1278}
1279
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001280LIBYANG_API_DEF const char *
Radek Krejcia3045382018-11-22 14:30:31 +01001281lys_nodetype2str(uint16_t nodetype)
1282{
Michal Vaskod989ba02020-08-24 10:59:24 +02001283 switch (nodetype) {
Radek Krejcia3045382018-11-22 14:30:31 +01001284 case LYS_CONTAINER:
1285 return "container";
1286 case LYS_CHOICE:
1287 return "choice";
1288 case LYS_LEAF:
1289 return "leaf";
1290 case LYS_LEAFLIST:
1291 return "leaf-list";
1292 case LYS_LIST:
1293 return "list";
1294 case LYS_ANYXML:
1295 return "anyxml";
1296 case LYS_ANYDATA:
1297 return "anydata";
Radek Krejcif12a1f02019-02-11 16:42:08 +01001298 case LYS_CASE:
1299 return "case";
Michal Vasko1bf09392020-03-27 12:38:10 +01001300 case LYS_RPC:
1301 return "RPC";
Radek Krejcif538ce52019-03-05 10:46:14 +01001302 case LYS_ACTION:
Michal Vasko1bf09392020-03-27 12:38:10 +01001303 return "action";
Radek Krejcif538ce52019-03-05 10:46:14 +01001304 case LYS_NOTIF:
Michal Vaskoa3881362020-01-21 15:57:35 +01001305 return "notification";
Radek Krejcifc81ea82019-04-18 13:27:22 +02001306 case LYS_USES:
1307 return "uses";
Radek Krejcia3045382018-11-22 14:30:31 +01001308 default:
1309 return "unknown";
1310 }
1311}
1312
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001313LIBYANG_API_DEF enum ly_stmt
Radek Krejci39b7fc22021-02-26 23:29:18 +01001314lys_nodetype2stmt(uint16_t nodetype)
1315{
1316 switch (nodetype) {
1317 case LYS_CONTAINER:
1318 return LY_STMT_CONTAINER;
1319 case LYS_CHOICE:
1320 return LY_STMT_CHOICE;
1321 case LYS_LEAF:
1322 return LY_STMT_LEAF;
1323 case LYS_LEAFLIST:
1324 return LY_STMT_LEAF_LIST;
1325 case LYS_LIST:
1326 return LY_STMT_LIST;
1327 case LYS_ANYXML:
1328 return LY_STMT_ANYXML;
1329 case LYS_ANYDATA:
1330 return LY_STMT_ANYDATA;
1331 case LYS_CASE:
1332 return LY_STMT_CASE;
1333 case LYS_RPC:
1334 return LY_STMT_RPC;
1335 case LYS_ACTION:
1336 return LY_STMT_ACTION;
1337 case LYS_NOTIF:
1338 return LY_STMT_NOTIFICATION;
1339 case LYS_USES:
1340 return LY_STMT_USES;
1341 case LYS_INPUT:
1342 return LY_STMT_INPUT;
1343 case LYS_OUTPUT:
1344 return LY_STMT_OUTPUT;
1345 default:
1346 return LY_STMT_NONE;
1347 }
1348}
1349
Radek Krejci693262f2019-04-29 15:23:20 +02001350const char *
1351lys_datatype2str(LY_DATA_TYPE basetype)
1352{
Michal Vaskod989ba02020-08-24 10:59:24 +02001353 switch (basetype) {
Radek Krejci693262f2019-04-29 15:23:20 +02001354 case LY_TYPE_BINARY:
1355 return "binary";
1356 case LY_TYPE_UINT8:
1357 return "uint8";
1358 case LY_TYPE_UINT16:
1359 return "uint16";
1360 case LY_TYPE_UINT32:
1361 return "uint32";
1362 case LY_TYPE_UINT64:
1363 return "uint64";
1364 case LY_TYPE_STRING:
1365 return "string";
1366 case LY_TYPE_BITS:
1367 return "bits";
1368 case LY_TYPE_BOOL:
1369 return "boolean";
1370 case LY_TYPE_DEC64:
1371 return "decimal64";
1372 case LY_TYPE_EMPTY:
1373 return "empty";
1374 case LY_TYPE_ENUM:
1375 return "enumeration";
1376 case LY_TYPE_IDENT:
1377 return "identityref";
1378 case LY_TYPE_INST:
1379 return "instance-identifier";
1380 case LY_TYPE_LEAFREF:
1381 return "leafref";
1382 case LY_TYPE_UNION:
1383 return "union";
1384 case LY_TYPE_INT8:
1385 return "int8";
1386 case LY_TYPE_INT16:
1387 return "int16";
1388 case LY_TYPE_INT32:
1389 return "int32";
1390 case LY_TYPE_INT64:
1391 return "int64";
1392 default:
1393 return "unknown";
1394 }
1395}
1396
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001397LIBYANG_API_DEF const struct lysp_tpdf *
Radek Krejci056d0a82018-12-06 16:57:25 +01001398lysp_node_typedefs(const struct lysp_node *node)
1399{
Radek Krejci0fb28562018-12-13 15:17:37 +01001400 switch (node->nodetype) {
1401 case LYS_CONTAINER:
Michal Vasko22df3f02020-08-24 13:29:22 +02001402 return ((struct lysp_node_container *)node)->typedefs;
Radek Krejci0fb28562018-12-13 15:17:37 +01001403 case LYS_LIST:
Michal Vasko22df3f02020-08-24 13:29:22 +02001404 return ((struct lysp_node_list *)node)->typedefs;
Radek Krejci0fb28562018-12-13 15:17:37 +01001405 case LYS_GROUPING:
Radek Krejci2a9fc652021-01-22 17:44:34 +01001406 return ((struct lysp_node_grp *)node)->typedefs;
Michal Vasko1bf09392020-03-27 12:38:10 +01001407 case LYS_RPC:
Radek Krejci0fb28562018-12-13 15:17:37 +01001408 case LYS_ACTION:
Radek Krejci2a9fc652021-01-22 17:44:34 +01001409 return ((struct lysp_node_action *)node)->typedefs;
Michal Vasko7f45cf22020-10-01 12:49:44 +02001410 case LYS_INPUT:
1411 case LYS_OUTPUT:
Radek Krejci2a9fc652021-01-22 17:44:34 +01001412 return ((struct lysp_node_action_inout *)node)->typedefs;
Radek Krejci0fb28562018-12-13 15:17:37 +01001413 case LYS_NOTIF:
Radek Krejci2a9fc652021-01-22 17:44:34 +01001414 return ((struct lysp_node_notif *)node)->typedefs;
Radek Krejci0fb28562018-12-13 15:17:37 +01001415 default:
Radek Krejci056d0a82018-12-06 16:57:25 +01001416 return NULL;
1417 }
1418}
1419
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001420LIBYANG_API_DEF const struct lysp_node_grp *
Radek Krejci53ea6152018-12-13 15:21:15 +01001421lysp_node_groupings(const struct lysp_node *node)
1422{
1423 switch (node->nodetype) {
1424 case LYS_CONTAINER:
Michal Vasko22df3f02020-08-24 13:29:22 +02001425 return ((struct lysp_node_container *)node)->groupings;
Radek Krejci53ea6152018-12-13 15:21:15 +01001426 case LYS_LIST:
Michal Vasko22df3f02020-08-24 13:29:22 +02001427 return ((struct lysp_node_list *)node)->groupings;
Radek Krejci53ea6152018-12-13 15:21:15 +01001428 case LYS_GROUPING:
Radek Krejci2a9fc652021-01-22 17:44:34 +01001429 return ((struct lysp_node_grp *)node)->groupings;
Michal Vasko1bf09392020-03-27 12:38:10 +01001430 case LYS_RPC:
Radek Krejci53ea6152018-12-13 15:21:15 +01001431 case LYS_ACTION:
Radek Krejci2a9fc652021-01-22 17:44:34 +01001432 return ((struct lysp_node_action *)node)->groupings;
Michal Vasko7f45cf22020-10-01 12:49:44 +02001433 case LYS_INPUT:
1434 case LYS_OUTPUT:
Radek Krejci2a9fc652021-01-22 17:44:34 +01001435 return ((struct lysp_node_action_inout *)node)->groupings;
Radek Krejci53ea6152018-12-13 15:21:15 +01001436 case LYS_NOTIF:
Radek Krejci2a9fc652021-01-22 17:44:34 +01001437 return ((struct lysp_node_notif *)node)->groupings;
Radek Krejci53ea6152018-12-13 15:21:15 +01001438 default:
1439 return NULL;
1440 }
1441}
1442
Radek Krejci2a9fc652021-01-22 17:44:34 +01001443struct lysp_node_action **
Radek Krejci056d0a82018-12-06 16:57:25 +01001444lysp_node_actions_p(struct lysp_node *node)
Radek Krejcibbe09a92018-11-08 09:36:54 +01001445{
1446 assert(node);
Michal Vasko7f45cf22020-10-01 12:49:44 +02001447
Radek Krejcibbe09a92018-11-08 09:36:54 +01001448 switch (node->nodetype) {
1449 case LYS_CONTAINER:
Michal Vasko22df3f02020-08-24 13:29:22 +02001450 return &((struct lysp_node_container *)node)->actions;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001451 case LYS_LIST:
Michal Vasko22df3f02020-08-24 13:29:22 +02001452 return &((struct lysp_node_list *)node)->actions;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001453 case LYS_GROUPING:
Radek Krejci2a9fc652021-01-22 17:44:34 +01001454 return &((struct lysp_node_grp *)node)->actions;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001455 case LYS_AUGMENT:
Radek Krejci2a9fc652021-01-22 17:44:34 +01001456 return &((struct lysp_node_augment *)node)->actions;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001457 default:
1458 return NULL;
1459 }
1460}
1461
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001462LIBYANG_API_DEF const struct lysp_node_action *
Radek Krejci056d0a82018-12-06 16:57:25 +01001463lysp_node_actions(const struct lysp_node *node)
1464{
Radek Krejci2a9fc652021-01-22 17:44:34 +01001465 struct lysp_node_action **actions;
Michal Vasko69730152020-10-09 16:30:07 +02001466
Michal Vasko22df3f02020-08-24 13:29:22 +02001467 actions = lysp_node_actions_p((struct lysp_node *)node);
Radek Krejci056d0a82018-12-06 16:57:25 +01001468 if (actions) {
1469 return *actions;
1470 } else {
1471 return NULL;
1472 }
1473}
1474
Radek Krejci2a9fc652021-01-22 17:44:34 +01001475struct lysp_node_notif **
Radek Krejci056d0a82018-12-06 16:57:25 +01001476lysp_node_notifs_p(struct lysp_node *node)
Radek Krejcibbe09a92018-11-08 09:36:54 +01001477{
1478 assert(node);
1479 switch (node->nodetype) {
1480 case LYS_CONTAINER:
Michal Vasko22df3f02020-08-24 13:29:22 +02001481 return &((struct lysp_node_container *)node)->notifs;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001482 case LYS_LIST:
Michal Vasko22df3f02020-08-24 13:29:22 +02001483 return &((struct lysp_node_list *)node)->notifs;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001484 case LYS_GROUPING:
Radek Krejci2a9fc652021-01-22 17:44:34 +01001485 return &((struct lysp_node_grp *)node)->notifs;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001486 case LYS_AUGMENT:
Radek Krejci2a9fc652021-01-22 17:44:34 +01001487 return &((struct lysp_node_augment *)node)->notifs;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001488 default:
1489 return NULL;
1490 }
1491}
1492
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001493LIBYANG_API_DEF const struct lysp_node_notif *
Radek Krejci056d0a82018-12-06 16:57:25 +01001494lysp_node_notifs(const struct lysp_node *node)
1495{
Radek Krejci2a9fc652021-01-22 17:44:34 +01001496 struct lysp_node_notif **notifs;
Michal Vasko69730152020-10-09 16:30:07 +02001497
Michal Vasko22df3f02020-08-24 13:29:22 +02001498 notifs = lysp_node_notifs_p((struct lysp_node *)node);
Radek Krejci056d0a82018-12-06 16:57:25 +01001499 if (notifs) {
1500 return *notifs;
1501 } else {
1502 return NULL;
1503 }
1504}
1505
Radek Krejcibbe09a92018-11-08 09:36:54 +01001506struct lysp_node **
Michal Vasko544e58a2021-01-28 14:33:41 +01001507lysp_node_child_p(struct lysp_node *node)
Radek Krejcibbe09a92018-11-08 09:36:54 +01001508{
1509 assert(node);
1510 switch (node->nodetype) {
1511 case LYS_CONTAINER:
Michal Vasko22df3f02020-08-24 13:29:22 +02001512 return &((struct lysp_node_container *)node)->child;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001513 case LYS_CHOICE:
Michal Vasko22df3f02020-08-24 13:29:22 +02001514 return &((struct lysp_node_choice *)node)->child;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001515 case LYS_LIST:
Michal Vasko22df3f02020-08-24 13:29:22 +02001516 return &((struct lysp_node_list *)node)->child;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001517 case LYS_CASE:
Michal Vasko22df3f02020-08-24 13:29:22 +02001518 return &((struct lysp_node_case *)node)->child;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001519 case LYS_GROUPING:
Radek Krejci01180ac2021-01-27 08:48:22 +01001520 return &((struct lysp_node_grp *)node)->child;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001521 case LYS_AUGMENT:
Radek Krejci2a9fc652021-01-22 17:44:34 +01001522 return &((struct lysp_node_augment *)node)->child;
Michal Vasko7f45cf22020-10-01 12:49:44 +02001523 case LYS_INPUT:
1524 case LYS_OUTPUT:
Radek Krejci01180ac2021-01-27 08:48:22 +01001525 return &((struct lysp_node_action_inout *)node)->child;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001526 case LYS_NOTIF:
Radek Krejci01180ac2021-01-27 08:48:22 +01001527 return &((struct lysp_node_notif *)node)->child;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001528 default:
1529 return NULL;
1530 }
1531}
1532
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001533LIBYANG_API_DEF const struct lysp_node *
Michal Vasko544e58a2021-01-28 14:33:41 +01001534lysp_node_child(const struct lysp_node *node)
Radek Krejci056d0a82018-12-06 16:57:25 +01001535{
Michal Vasko544e58a2021-01-28 14:33:41 +01001536 struct lysp_node **child;
Radek Krejcie7b95092019-05-15 11:03:07 +02001537
1538 if (!node) {
1539 return NULL;
1540 }
1541
Michal Vasko544e58a2021-01-28 14:33:41 +01001542 child = lysp_node_child_p((struct lysp_node *)node);
1543 if (child) {
1544 return *child;
Radek Krejci056d0a82018-12-06 16:57:25 +01001545 } else {
1546 return NULL;
1547 }
1548}
1549
Radek Krejci9a3823e2021-01-27 20:26:46 +01001550struct lysp_restr **
1551lysp_node_musts_p(const struct lysp_node *node)
1552{
1553 if (!node) {
1554 return NULL;
1555 }
1556
Radek Krejci2d5f6df2021-01-28 14:00:13 +01001557 switch (node->nodetype) {
Radek Krejci9a3823e2021-01-27 20:26:46 +01001558 case LYS_CONTAINER:
1559 return &((struct lysp_node_container *)node)->musts;
1560 case LYS_LEAF:
1561 return &((struct lysp_node_leaf *)node)->musts;
1562 case LYS_LEAFLIST:
1563 return &((struct lysp_node_leaflist *)node)->musts;
1564 case LYS_LIST:
1565 return &((struct lysp_node_list *)node)->musts;
1566 case LYS_ANYXML:
1567 case LYS_ANYDATA:
1568 return &((struct lysp_node_anydata *)node)->musts;
1569 case LYS_NOTIF:
1570 return &((struct lysp_node_notif *)node)->musts;
1571 case LYS_INPUT:
1572 case LYS_OUTPUT:
1573 return &((struct lysp_node_action_inout *)node)->musts;
1574 default:
1575 return NULL;
1576 }
1577}
1578
1579struct lysp_restr *
1580lysp_node_musts(const struct lysp_node *node)
1581{
1582 struct lysp_restr **musts;
1583
1584 musts = lysp_node_musts_p(node);
1585 if (musts) {
1586 return *musts;
1587 } else {
1588 return NULL;
1589 }
1590}
1591
1592struct lysp_when **
1593lysp_node_when_p(const struct lysp_node *node)
1594{
1595 if (!node) {
1596 return NULL;
1597 }
1598
Radek Krejci2d5f6df2021-01-28 14:00:13 +01001599 switch (node->nodetype) {
Radek Krejci9a3823e2021-01-27 20:26:46 +01001600 case LYS_CONTAINER:
1601 return &((struct lysp_node_container *)node)->when;
1602 case LYS_CHOICE:
1603 return &((struct lysp_node_choice *)node)->when;
1604 case LYS_LEAF:
1605 return &((struct lysp_node_leaf *)node)->when;
1606 case LYS_LEAFLIST:
1607 return &((struct lysp_node_leaflist *)node)->when;
1608 case LYS_LIST:
1609 return &((struct lysp_node_list *)node)->when;
1610 case LYS_ANYXML:
1611 case LYS_ANYDATA:
1612 return &((struct lysp_node_anydata *)node)->when;
1613 case LYS_CASE:
1614 return &((struct lysp_node_case *)node)->when;
1615 case LYS_USES:
1616 return &((struct lysp_node_uses *)node)->when;
1617 case LYS_AUGMENT:
1618 return &((struct lysp_node_augment *)node)->when;
1619 default:
1620 return NULL;
1621 }
1622}
1623
1624struct lysp_when *
1625lysp_node_when(const struct lysp_node *node)
1626{
1627 struct lysp_when **when;
1628
1629 when = lysp_node_when_p(node);
1630 if (when) {
1631 return *when;
1632 } else {
1633 return NULL;
1634 }
1635}
1636
Radek Krejci2a9fc652021-01-22 17:44:34 +01001637struct lysc_node_action **
Radek Krejci056d0a82018-12-06 16:57:25 +01001638lysc_node_actions_p(struct lysc_node *node)
1639{
1640 assert(node);
1641 switch (node->nodetype) {
1642 case LYS_CONTAINER:
Michal Vasko22df3f02020-08-24 13:29:22 +02001643 return &((struct lysc_node_container *)node)->actions;
Radek Krejci056d0a82018-12-06 16:57:25 +01001644 case LYS_LIST:
Michal Vasko22df3f02020-08-24 13:29:22 +02001645 return &((struct lysc_node_list *)node)->actions;
Radek Krejci056d0a82018-12-06 16:57:25 +01001646 default:
1647 return NULL;
1648 }
1649}
1650
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001651LIBYANG_API_DEF const struct lysc_node_action *
Radek Krejci056d0a82018-12-06 16:57:25 +01001652lysc_node_actions(const struct lysc_node *node)
1653{
Radek Krejci2a9fc652021-01-22 17:44:34 +01001654 struct lysc_node_action **actions;
Michal Vasko69730152020-10-09 16:30:07 +02001655
Michal Vasko22df3f02020-08-24 13:29:22 +02001656 actions = lysc_node_actions_p((struct lysc_node *)node);
Radek Krejci056d0a82018-12-06 16:57:25 +01001657 if (actions) {
1658 return *actions;
1659 } else {
1660 return NULL;
1661 }
1662}
1663
Radek Krejci2a9fc652021-01-22 17:44:34 +01001664struct lysc_node_notif **
Radek Krejci056d0a82018-12-06 16:57:25 +01001665lysc_node_notifs_p(struct lysc_node *node)
1666{
1667 assert(node);
1668 switch (node->nodetype) {
1669 case LYS_CONTAINER:
Michal Vasko22df3f02020-08-24 13:29:22 +02001670 return &((struct lysc_node_container *)node)->notifs;
Radek Krejci056d0a82018-12-06 16:57:25 +01001671 case LYS_LIST:
Michal Vasko22df3f02020-08-24 13:29:22 +02001672 return &((struct lysc_node_list *)node)->notifs;
Radek Krejci056d0a82018-12-06 16:57:25 +01001673 default:
1674 return NULL;
1675 }
1676}
1677
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001678LIBYANG_API_DEF const struct lysc_node_notif *
Radek Krejci056d0a82018-12-06 16:57:25 +01001679lysc_node_notifs(const struct lysc_node *node)
1680{
Radek Krejci2a9fc652021-01-22 17:44:34 +01001681 struct lysc_node_notif **notifs;
Michal Vasko69730152020-10-09 16:30:07 +02001682
Michal Vasko22df3f02020-08-24 13:29:22 +02001683 notifs = lysc_node_notifs_p((struct lysc_node *)node);
Radek Krejci056d0a82018-12-06 16:57:25 +01001684 if (notifs) {
1685 return *notifs;
1686 } else {
1687 return NULL;
1688 }
1689}
1690
Radek Krejcibbe09a92018-11-08 09:36:54 +01001691struct lysc_node **
Michal Vasko544e58a2021-01-28 14:33:41 +01001692lysc_node_child_p(const struct lysc_node *node)
Radek Krejcibbe09a92018-11-08 09:36:54 +01001693{
Michal Vasko544e58a2021-01-28 14:33:41 +01001694 assert(node && !(node->nodetype & (LYS_RPC | LYS_ACTION)));
1695
Radek Krejcibbe09a92018-11-08 09:36:54 +01001696 switch (node->nodetype) {
1697 case LYS_CONTAINER:
Michal Vasko22df3f02020-08-24 13:29:22 +02001698 return &((struct lysc_node_container *)node)->child;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001699 case LYS_CHOICE:
Michal Vasko20424b42020-08-31 12:29:38 +02001700 return (struct lysc_node **)&((struct lysc_node_choice *)node)->cases;
Radek Krejci01342af2019-01-03 15:18:08 +01001701 case LYS_CASE:
Michal Vasko22df3f02020-08-24 13:29:22 +02001702 return &((struct lysc_node_case *)node)->child;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001703 case LYS_LIST:
Michal Vasko22df3f02020-08-24 13:29:22 +02001704 return &((struct lysc_node_list *)node)->child;
Michal Vasko7f45cf22020-10-01 12:49:44 +02001705 case LYS_INPUT:
1706 case LYS_OUTPUT:
Radek Krejci01180ac2021-01-27 08:48:22 +01001707 return &((struct lysc_node_action_inout *)node)->child;
Radek Krejcifc11bd72019-04-11 16:00:05 +02001708 case LYS_NOTIF:
Radek Krejci01180ac2021-01-27 08:48:22 +01001709 return &((struct lysc_node_notif *)node)->child;
Radek Krejcibbe09a92018-11-08 09:36:54 +01001710 default:
1711 return NULL;
1712 }
1713}
1714
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001715LIBYANG_API_DEF const struct lysc_node *
Michal Vasko544e58a2021-01-28 14:33:41 +01001716lysc_node_child(const struct lysc_node *node)
Radek Krejcia3045382018-11-22 14:30:31 +01001717{
Michal Vasko544e58a2021-01-28 14:33:41 +01001718 struct lysc_node **child;
Radek Krejcie7b95092019-05-15 11:03:07 +02001719
1720 if (!node) {
1721 return NULL;
1722 }
1723
Michal Vasko544e58a2021-01-28 14:33:41 +01001724 if (node->nodetype & (LYS_RPC | LYS_ACTION)) {
1725 return &((struct lysc_node_action *)node)->input.node;
Radek Krejcibe154442021-01-21 11:06:36 +01001726 } else {
Michal Vasko544e58a2021-01-28 14:33:41 +01001727 child = lysc_node_child_p(node);
1728 if (child) {
1729 return *child;
Radek Krejci2a9fc652021-01-22 17:44:34 +01001730 }
Michal Vasko2a668712020-10-21 11:48:09 +02001731 }
Michal Vasko544e58a2021-01-28 14:33:41 +01001732
1733 return NULL;
Michal Vasko2a668712020-10-21 11:48:09 +02001734}
1735
Radek Krejci9a3823e2021-01-27 20:26:46 +01001736struct lysc_must **
1737lysc_node_musts_p(const struct lysc_node *node)
1738{
1739 if (!node) {
1740 return NULL;
1741 }
1742
Radek Krejci2d5f6df2021-01-28 14:00:13 +01001743 switch (node->nodetype) {
Radek Krejci9a3823e2021-01-27 20:26:46 +01001744 case LYS_CONTAINER:
1745 return &((struct lysc_node_container *)node)->musts;
1746 case LYS_LEAF:
1747 return &((struct lysc_node_leaf *)node)->musts;
1748 case LYS_LEAFLIST:
1749 return &((struct lysc_node_leaflist *)node)->musts;
1750 case LYS_LIST:
1751 return &((struct lysc_node_list *)node)->musts;
1752 case LYS_ANYXML:
1753 case LYS_ANYDATA:
1754 return &((struct lysc_node_anydata *)node)->musts;
1755 case LYS_NOTIF:
1756 return &((struct lysc_node_notif *)node)->musts;
1757 case LYS_INPUT:
1758 case LYS_OUTPUT:
1759 return &((struct lysc_node_action_inout *)node)->musts;
1760 default:
1761 return NULL;
1762 }
1763}
1764
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001765LIBYANG_API_DEF struct lysc_must *
Radek Krejci9a3823e2021-01-27 20:26:46 +01001766lysc_node_musts(const struct lysc_node *node)
1767{
1768 struct lysc_must **must_p;
1769
1770 must_p = lysc_node_musts_p(node);
1771 if (must_p) {
1772 return *must_p;
1773 } else {
1774 return NULL;
1775 }
1776}
1777
1778struct lysc_when ***
1779lysc_node_when_p(const struct lysc_node *node)
1780{
1781 if (!node) {
1782 return NULL;
1783 }
1784
Radek Krejci2d5f6df2021-01-28 14:00:13 +01001785 switch (node->nodetype) {
Radek Krejci9a3823e2021-01-27 20:26:46 +01001786 case LYS_CONTAINER:
1787 return &((struct lysc_node_container *)node)->when;
1788 case LYS_CHOICE:
1789 return &((struct lysc_node_choice *)node)->when;
1790 case LYS_LEAF:
1791 return &((struct lysc_node_leaf *)node)->when;
1792 case LYS_LEAFLIST:
1793 return &((struct lysc_node_leaflist *)node)->when;
1794 case LYS_LIST:
1795 return &((struct lysc_node_list *)node)->when;
1796 case LYS_ANYXML:
1797 case LYS_ANYDATA:
1798 return &((struct lysc_node_anydata *)node)->when;
1799 case LYS_CASE:
1800 return &((struct lysc_node_case *)node)->when;
1801 case LYS_NOTIF:
1802 return &((struct lysc_node_notif *)node)->when;
1803 case LYS_RPC:
1804 case LYS_ACTION:
1805 return &((struct lysc_node_action *)node)->when;
1806 default:
1807 return NULL;
1808 }
1809}
1810
Jan Kundrátc53a7ec2021-12-09 16:01:19 +01001811LIBYANG_API_DEF struct lysc_when **
Radek Krejci9a3823e2021-01-27 20:26:46 +01001812lysc_node_when(const struct lysc_node *node)
1813{
1814 struct lysc_when ***when_p;
1815
1816 when_p = lysc_node_when_p(node);
1817 if (when_p) {
1818 return *when_p;
1819 } else {
1820 return NULL;
1821 }
1822}
1823
Radek Krejci96a0bfd2018-11-22 15:25:06 +01001824struct lys_module *
1825lysp_find_module(struct ly_ctx *ctx, const struct lysp_module *mod)
1826{
Radek Krejci1deb5be2020-08-26 16:43:36 +02001827 for (uint32_t u = 0; u < ctx->list.count; ++u) {
Michal Vasko22df3f02020-08-24 13:29:22 +02001828 if (((struct lys_module *)ctx->list.objs[u])->parsed == mod) {
Michal Vasko69730152020-10-09 16:30:07 +02001829 return (struct lys_module *)ctx->list.objs[u];
Radek Krejci96a0bfd2018-11-22 15:25:06 +01001830 }
1831 }
1832 return NULL;
1833}
1834
Radek Krejcid6b76452019-09-03 17:03:03 +02001835enum ly_stmt
Radek Krejcid54412f2020-12-17 20:25:35 +01001836lysp_match_kw(struct ly_in *in, uint64_t *indent)
David Sedlákc10e7902018-12-17 02:17:59 +01001837{
David Sedlák1bccdfa2019-06-17 15:55:27 +02001838/**
Radek Krejcid54412f2020-12-17 20:25:35 +01001839 * @brief Move the input by COUNT items. Also updates the indent value in yang parser context
David Sedlák1bccdfa2019-06-17 15:55:27 +02001840 * @param[in] COUNT number of items for which the DATA pointer is supposed to move on.
Michal Vasko64246d82020-08-19 12:35:00 +02001841 *
1842 * *INDENT-OFF*
David Sedlák1bccdfa2019-06-17 15:55:27 +02001843 */
Radek Krejcid54412f2020-12-17 20:25:35 +01001844#define MOVE_IN(COUNT) \
1845 ly_in_skip(in, COUNT); \
1846 if (indent) { \
1847 (*indent)+=COUNT; \
1848 }
1849#define IF_KW(STR, LEN, STMT) \
1850 if (!strncmp(in->current, STR, LEN)) { \
1851 MOVE_IN(LEN); \
1852 (*kw)=STMT; \
1853 }
1854#define IF_KW_PREFIX(STR, LEN) \
1855 if (!strncmp(in->current, STR, LEN)) { \
1856 MOVE_IN(LEN);
1857#define IF_KW_PREFIX_END \
1858 }
David Sedlák572e7ab2019-06-04 16:01:58 +02001859
Michal Vasko63f3d842020-07-08 10:10:14 +02001860 const char *start = in->current;
Radek Krejcid6b76452019-09-03 17:03:03 +02001861 enum ly_stmt result = LY_STMT_NONE;
1862 enum ly_stmt *kw = &result;
David Sedlák1bccdfa2019-06-17 15:55:27 +02001863 /* read the keyword itself */
Michal Vasko63f3d842020-07-08 10:10:14 +02001864 switch (in->current[0]) {
David Sedlák23a59a62018-10-26 13:08:02 +02001865 case 'a':
Radek Krejcid54412f2020-12-17 20:25:35 +01001866 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02001867 IF_KW("rgument", 7, LY_STMT_ARGUMENT)
1868 else IF_KW("ugment", 6, LY_STMT_AUGMENT)
1869 else IF_KW("ction", 5, LY_STMT_ACTION)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001870 else IF_KW_PREFIX("ny", 2)
Radek Krejcid6b76452019-09-03 17:03:03 +02001871 IF_KW("data", 4, LY_STMT_ANYDATA)
1872 else IF_KW("xml", 3, LY_STMT_ANYXML)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001873 IF_KW_PREFIX_END
David Sedlák23a59a62018-10-26 13:08:02 +02001874 break;
1875 case 'b':
Radek Krejcid54412f2020-12-17 20:25:35 +01001876 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02001877 IF_KW("ase", 3, LY_STMT_BASE)
1878 else IF_KW("elongs-to", 9, LY_STMT_BELONGS_TO)
1879 else IF_KW("it", 2, LY_STMT_BIT)
David Sedlák23a59a62018-10-26 13:08:02 +02001880 break;
1881 case 'c':
Radek Krejcid54412f2020-12-17 20:25:35 +01001882 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02001883 IF_KW("ase", 3, LY_STMT_CASE)
1884 else IF_KW("hoice", 5, LY_STMT_CHOICE)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001885 else IF_KW_PREFIX("on", 2)
Radek Krejcid6b76452019-09-03 17:03:03 +02001886 IF_KW("fig", 3, LY_STMT_CONFIG)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001887 else IF_KW_PREFIX("ta", 2)
Radek Krejcid6b76452019-09-03 17:03:03 +02001888 IF_KW("ct", 2, LY_STMT_CONTACT)
1889 else IF_KW("iner", 4, LY_STMT_CONTAINER)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001890 IF_KW_PREFIX_END
1891 IF_KW_PREFIX_END
David Sedlák23a59a62018-10-26 13:08:02 +02001892 break;
1893 case 'd':
Radek Krejcid54412f2020-12-17 20:25:35 +01001894 MOVE_IN(1);
David Sedlák1bccdfa2019-06-17 15:55:27 +02001895 IF_KW_PREFIX("e", 1)
Radek Krejcid6b76452019-09-03 17:03:03 +02001896 IF_KW("fault", 5, LY_STMT_DEFAULT)
1897 else IF_KW("scription", 9, LY_STMT_DESCRIPTION)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001898 else IF_KW_PREFIX("viat", 4)
Radek Krejcid6b76452019-09-03 17:03:03 +02001899 IF_KW("e", 1, LY_STMT_DEVIATE)
1900 else IF_KW("ion", 3, LY_STMT_DEVIATION)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001901 IF_KW_PREFIX_END
1902 IF_KW_PREFIX_END
David Sedlák23a59a62018-10-26 13:08:02 +02001903 break;
1904 case 'e':
Radek Krejcid54412f2020-12-17 20:25:35 +01001905 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02001906 IF_KW("num", 3, LY_STMT_ENUM)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001907 else IF_KW_PREFIX("rror-", 5)
Radek Krejcid6b76452019-09-03 17:03:03 +02001908 IF_KW("app-tag", 7, LY_STMT_ERROR_APP_TAG)
1909 else IF_KW("message", 7, LY_STMT_ERROR_MESSAGE)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001910 IF_KW_PREFIX_END
Radek Krejcid6b76452019-09-03 17:03:03 +02001911 else IF_KW("xtension", 8, LY_STMT_EXTENSION)
David Sedlák23a59a62018-10-26 13:08:02 +02001912 break;
1913 case 'f':
Radek Krejcid54412f2020-12-17 20:25:35 +01001914 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02001915 IF_KW("eature", 6, LY_STMT_FEATURE)
1916 else IF_KW("raction-digits", 14, LY_STMT_FRACTION_DIGITS)
David Sedlák23a59a62018-10-26 13:08:02 +02001917 break;
1918 case 'g':
Radek Krejcid54412f2020-12-17 20:25:35 +01001919 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02001920 IF_KW("rouping", 7, LY_STMT_GROUPING)
David Sedlák23a59a62018-10-26 13:08:02 +02001921 break;
1922 case 'i':
Radek Krejcid54412f2020-12-17 20:25:35 +01001923 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02001924 IF_KW("dentity", 7, LY_STMT_IDENTITY)
1925 else IF_KW("f-feature", 9, LY_STMT_IF_FEATURE)
1926 else IF_KW("mport", 5, LY_STMT_IMPORT)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001927 else IF_KW_PREFIX("n", 1)
Radek Krejcid6b76452019-09-03 17:03:03 +02001928 IF_KW("clude", 5, LY_STMT_INCLUDE)
1929 else IF_KW("put", 3, LY_STMT_INPUT)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001930 IF_KW_PREFIX_END
David Sedlák23a59a62018-10-26 13:08:02 +02001931 break;
1932 case 'k':
Radek Krejcid54412f2020-12-17 20:25:35 +01001933 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02001934 IF_KW("ey", 2, LY_STMT_KEY)
David Sedlák23a59a62018-10-26 13:08:02 +02001935 break;
1936 case 'l':
Radek Krejcid54412f2020-12-17 20:25:35 +01001937 MOVE_IN(1);
David Sedlák1bccdfa2019-06-17 15:55:27 +02001938 IF_KW_PREFIX("e", 1)
Radek Krejcid6b76452019-09-03 17:03:03 +02001939 IF_KW("af-list", 7, LY_STMT_LEAF_LIST)
1940 else IF_KW("af", 2, LY_STMT_LEAF)
1941 else IF_KW("ngth", 4, LY_STMT_LENGTH)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001942 IF_KW_PREFIX_END
Radek Krejcid6b76452019-09-03 17:03:03 +02001943 else IF_KW("ist", 3, LY_STMT_LIST)
David Sedlák23a59a62018-10-26 13:08:02 +02001944 break;
1945 case 'm':
Radek Krejcid54412f2020-12-17 20:25:35 +01001946 MOVE_IN(1);
David Sedlák1bccdfa2019-06-17 15:55:27 +02001947 IF_KW_PREFIX("a", 1)
Radek Krejcid6b76452019-09-03 17:03:03 +02001948 IF_KW("ndatory", 7, LY_STMT_MANDATORY)
1949 else IF_KW("x-elements", 10, LY_STMT_MAX_ELEMENTS)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001950 IF_KW_PREFIX_END
Radek Krejcid6b76452019-09-03 17:03:03 +02001951 else IF_KW("in-elements", 11, LY_STMT_MIN_ELEMENTS)
1952 else IF_KW("ust", 3, LY_STMT_MUST)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001953 else IF_KW_PREFIX("od", 2)
Radek Krejcid6b76452019-09-03 17:03:03 +02001954 IF_KW("ule", 3, LY_STMT_MODULE)
1955 else IF_KW("ifier", 5, LY_STMT_MODIFIER)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001956 IF_KW_PREFIX_END
David Sedlák23a59a62018-10-26 13:08:02 +02001957 break;
1958 case 'n':
Radek Krejcid54412f2020-12-17 20:25:35 +01001959 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02001960 IF_KW("amespace", 8, LY_STMT_NAMESPACE)
1961 else IF_KW("otification", 11, LY_STMT_NOTIFICATION)
David Sedlák23a59a62018-10-26 13:08:02 +02001962 break;
1963 case 'o':
Radek Krejcid54412f2020-12-17 20:25:35 +01001964 MOVE_IN(1);
David Sedlák1bccdfa2019-06-17 15:55:27 +02001965 IF_KW_PREFIX("r", 1)
Radek Krejcid6b76452019-09-03 17:03:03 +02001966 IF_KW("dered-by", 8, LY_STMT_ORDERED_BY)
1967 else IF_KW("ganization", 10, LY_STMT_ORGANIZATION)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001968 IF_KW_PREFIX_END
Radek Krejcid6b76452019-09-03 17:03:03 +02001969 else IF_KW("utput", 5, LY_STMT_OUTPUT)
David Sedlák23a59a62018-10-26 13:08:02 +02001970 break;
1971 case 'p':
Radek Krejcid54412f2020-12-17 20:25:35 +01001972 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02001973 IF_KW("ath", 3, LY_STMT_PATH)
1974 else IF_KW("attern", 6, LY_STMT_PATTERN)
1975 else IF_KW("osition", 7, LY_STMT_POSITION)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001976 else IF_KW_PREFIX("re", 2)
Radek Krejcid6b76452019-09-03 17:03:03 +02001977 IF_KW("fix", 3, LY_STMT_PREFIX)
1978 else IF_KW("sence", 5, LY_STMT_PRESENCE)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001979 IF_KW_PREFIX_END
David Sedlák23a59a62018-10-26 13:08:02 +02001980 break;
1981 case 'r':
Radek Krejcid54412f2020-12-17 20:25:35 +01001982 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02001983 IF_KW("ange", 4, LY_STMT_RANGE)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001984 else IF_KW_PREFIX("e", 1)
1985 IF_KW_PREFIX("f", 1)
Radek Krejcid6b76452019-09-03 17:03:03 +02001986 IF_KW("erence", 6, LY_STMT_REFERENCE)
1987 else IF_KW("ine", 3, LY_STMT_REFINE)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001988 IF_KW_PREFIX_END
Radek Krejcid6b76452019-09-03 17:03:03 +02001989 else IF_KW("quire-instance", 14, LY_STMT_REQUIRE_INSTANCE)
1990 else IF_KW("vision-date", 11, LY_STMT_REVISION_DATE)
1991 else IF_KW("vision", 6, LY_STMT_REVISION)
David Sedlák1bccdfa2019-06-17 15:55:27 +02001992 IF_KW_PREFIX_END
Radek Krejcid6b76452019-09-03 17:03:03 +02001993 else IF_KW("pc", 2, LY_STMT_RPC)
David Sedlák23a59a62018-10-26 13:08:02 +02001994 break;
1995 case 's':
Radek Krejcid54412f2020-12-17 20:25:35 +01001996 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02001997 IF_KW("tatus", 5, LY_STMT_STATUS)
1998 else IF_KW("ubmodule", 8, LY_STMT_SUBMODULE)
David Sedlák23a59a62018-10-26 13:08:02 +02001999 break;
2000 case 't':
Radek Krejcid54412f2020-12-17 20:25:35 +01002001 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02002002 IF_KW("ypedef", 6, LY_STMT_TYPEDEF)
2003 else IF_KW("ype", 3, LY_STMT_TYPE)
David Sedlák23a59a62018-10-26 13:08:02 +02002004 break;
2005 case 'u':
Radek Krejcid54412f2020-12-17 20:25:35 +01002006 MOVE_IN(1);
David Sedlák1bccdfa2019-06-17 15:55:27 +02002007 IF_KW_PREFIX("ni", 2)
Radek Krejcid6b76452019-09-03 17:03:03 +02002008 IF_KW("que", 3, LY_STMT_UNIQUE)
2009 else IF_KW("ts", 2, LY_STMT_UNITS)
David Sedlák1bccdfa2019-06-17 15:55:27 +02002010 IF_KW_PREFIX_END
Radek Krejcid6b76452019-09-03 17:03:03 +02002011 else IF_KW("ses", 3, LY_STMT_USES)
David Sedlák23a59a62018-10-26 13:08:02 +02002012 break;
2013 case 'v':
Radek Krejcid54412f2020-12-17 20:25:35 +01002014 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02002015 IF_KW("alue", 4, LY_STMT_VALUE)
David Sedlák23a59a62018-10-26 13:08:02 +02002016 break;
2017 case 'w':
Radek Krejcid54412f2020-12-17 20:25:35 +01002018 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02002019 IF_KW("hen", 3, LY_STMT_WHEN)
David Sedlák23a59a62018-10-26 13:08:02 +02002020 break;
2021 case 'y':
Radek Krejcid54412f2020-12-17 20:25:35 +01002022 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02002023 IF_KW("ang-version", 11, LY_STMT_YANG_VERSION)
2024 else IF_KW("in-element", 10, LY_STMT_YIN_ELEMENT)
David Sedlák23a59a62018-10-26 13:08:02 +02002025 break;
David Sedlák23a59a62018-10-26 13:08:02 +02002026 default:
Radek Krejcid54412f2020-12-17 20:25:35 +01002027 /* if indent is not NULL we are matching keyword from YANG data */
2028 if (indent) {
Michal Vasko63f3d842020-07-08 10:10:14 +02002029 if (in->current[0] == ';') {
Radek Krejcid54412f2020-12-17 20:25:35 +01002030 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02002031 *kw = LY_STMT_SYNTAX_SEMICOLON;
Michal Vasko63f3d842020-07-08 10:10:14 +02002032 } else if (in->current[0] == '{') {
Radek Krejcid54412f2020-12-17 20:25:35 +01002033 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02002034 *kw = LY_STMT_SYNTAX_LEFT_BRACE;
Michal Vasko63f3d842020-07-08 10:10:14 +02002035 } else if (in->current[0] == '}') {
Radek Krejcid54412f2020-12-17 20:25:35 +01002036 MOVE_IN(1);
Radek Krejcid6b76452019-09-03 17:03:03 +02002037 *kw = LY_STMT_SYNTAX_RIGHT_BRACE;
David Sedlák1bccdfa2019-06-17 15:55:27 +02002038 }
2039 }
David Sedlák23a59a62018-10-26 13:08:02 +02002040 break;
2041 }
2042
Michal Vasko63f3d842020-07-08 10:10:14 +02002043 if ((*kw < LY_STMT_SYNTAX_SEMICOLON) && isalnum(in->current[0])) {
Radek Krejci6e546bf2020-05-19 16:16:19 +02002044 /* the keyword is not terminated */
2045 *kw = LY_STMT_NONE;
Michal Vasko63f3d842020-07-08 10:10:14 +02002046 in->current = start;
Radek Krejci6e546bf2020-05-19 16:16:19 +02002047 }
2048
David Sedlák1bccdfa2019-06-17 15:55:27 +02002049#undef IF_KW
2050#undef IF_KW_PREFIX
2051#undef IF_KW_PREFIX_END
David Sedlák18730132019-03-15 15:51:34 +01002052#undef MOVE_IN
Michal Vasko64246d82020-08-19 12:35:00 +02002053 /* *INDENT-ON* */
David Sedlák18730132019-03-15 15:51:34 +01002054
David Sedlák1bccdfa2019-06-17 15:55:27 +02002055 return result;
David Sedlák23a59a62018-10-26 13:08:02 +02002056}
David Sedlákecf5eb82019-06-03 14:12:44 +02002057
Radek Krejci85ac8312021-03-03 20:21:33 +01002058LY_ERR
2059lysp_ext_find_definition(const struct ly_ctx *ctx, const struct lysp_ext_instance *ext, const struct lys_module **ext_mod,
2060 struct lysp_ext **ext_def)
2061{
Radek Krejci85ac8312021-03-03 20:21:33 +01002062 const char *tmp, *name, *prefix;
2063 size_t pref_len, name_len;
2064 LY_ARRAY_COUNT_TYPE v;
2065 const struct lys_module *mod = NULL;
2066
Radek Krejcicbb62422021-03-15 09:29:21 +01002067 assert(ext_def);
2068
Radek Krejci85ac8312021-03-03 20:21:33 +01002069 *ext_def = NULL;
2070 if (ext_mod) {
2071 *ext_mod = NULL;
2072 }
2073
Radek Krejci677abea2021-03-05 14:24:53 +01002074 /* parse the prefix, the nodeid was previously already parsed and checked */
Radek Krejci85ac8312021-03-03 20:21:33 +01002075 tmp = ext->name;
Radek Krejci677abea2021-03-05 14:24:53 +01002076 ly_parse_nodeid(&tmp, &prefix, &pref_len, &name, &name_len);
Radek Krejci85ac8312021-03-03 20:21:33 +01002077
2078 /* get module where the extension definition should be placed */
2079 mod = ly_resolve_prefix(ctx, prefix, pref_len, ext->format, ext->prefix_data);
2080 if (!mod) {
Radek Krejci422afb12021-03-04 16:38:16 +01002081 LOGVAL(ctx, LYVE_REFERENCE, "Invalid prefix \"%.*s\" used for extension instance identifier.", (int)pref_len, prefix);
Radek Krejci85ac8312021-03-03 20:21:33 +01002082 return LY_EVALID;
2083 } else if (!mod->parsed->extensions) {
2084 LOGVAL(ctx, LYVE_REFERENCE, "Extension instance \"%s\" refers \"%s\" module that does not contain extension definitions.",
2085 ext->name, mod->name);
2086 return LY_EVALID;
2087 }
2088
2089 /* find the parsed extension definition there */
2090 LY_ARRAY_FOR(mod->parsed->extensions, v) {
2091 if (!strcmp(name, mod->parsed->extensions[v].name)) {
2092 *ext_def = &mod->parsed->extensions[v];
2093 break;
2094 }
2095 }
2096
Radek Krejcicbb62422021-03-15 09:29:21 +01002097 if (!(*ext_def)) {
Radek Krejci85ac8312021-03-03 20:21:33 +01002098 LOGVAL(ctx, LYVE_REFERENCE, "Extension definition of extension instance \"%s\" not found.", ext->name);
2099 return LY_EVALID;
2100 }
2101
2102 if (ext_mod) {
2103 *ext_mod = mod;
2104 }
2105 return LY_SUCCESS;
2106}
2107
2108LY_ERR
2109lysp_ext_instance_resolve_argument(struct ly_ctx *ctx, struct lysp_ext_instance *ext_p, struct lysp_ext *ext_def)
2110{
Radek Krejci9f87b0c2021-03-05 14:45:26 +01002111 if (!ext_def->argname || ext_p->argument) {
Radek Krejci85ac8312021-03-03 20:21:33 +01002112 /* nothing to do */
2113 return LY_SUCCESS;
2114 }
2115
Radek Krejci8df109d2021-04-23 12:19:08 +02002116 if (ext_p->format == LY_VALUE_XML) {
Radek Krejci85ac8312021-03-03 20:21:33 +01002117 /* Schema was parsed from YIN and an argument is expected, ... */
2118 struct lysp_stmt *stmt = NULL;
2119
2120 if (ext_def->flags & LYS_YINELEM_TRUE) {
2121 /* ... argument was the first XML child element */
2122 for (stmt = ext_p->child; stmt && (stmt->flags & LYS_YIN_ATTR); stmt = stmt->next) {}
2123 if (stmt) {
2124 const char *arg, *ext, *name_arg, *name_ext, *prefix_arg, *prefix_ext;
2125 size_t name_arg_len, name_ext_len, prefix_arg_len, prefix_ext_len;
2126
2127 stmt = ext_p->child;
2128
2129 arg = stmt->stmt;
2130 ly_parse_nodeid(&arg, &prefix_arg, &prefix_arg_len, &name_arg, &name_arg_len);
Radek Krejci9f87b0c2021-03-05 14:45:26 +01002131 if (ly_strncmp(ext_def->argname, name_arg, name_arg_len)) {
Radek Krejci85ac8312021-03-03 20:21:33 +01002132 LOGVAL(ctx, LYVE_SEMANTICS, "Extension instance \"%s\" expects argument element \"%s\" as its first XML child, "
Radek Krejci9f87b0c2021-03-05 14:45:26 +01002133 "but \"%.*s\" element found.", ext_p->name, ext_def->argname, (int)name_arg_len, name_arg);
Radek Krejci85ac8312021-03-03 20:21:33 +01002134 return LY_EVALID;
2135 }
2136
2137 /* check namespace - all the extension instances must be qualified and argument element is expected in the same
2138 * namespace. Do not check just prefixes, there can be different prefixes pointing to the same namespace */
2139 ext = ext_p->name; /* include prefix */
2140 ly_parse_nodeid(&ext, &prefix_ext, &prefix_ext_len, &name_ext, &name_ext_len);
2141
2142 if (ly_resolve_prefix(ctx, prefix_ext, prefix_ext_len, ext_p->format, ext_p->prefix_data) !=
2143 ly_resolve_prefix(ctx, prefix_arg, prefix_arg_len, stmt->format, stmt->prefix_data)) {
2144 LOGVAL(ctx, LYVE_SEMANTICS, "Extension instance \"%s\" element and its argument element \"%s\" are "
Radek Krejci9f87b0c2021-03-05 14:45:26 +01002145 "expected in the same namespace, but they differ.", ext_p->name, ext_def->argname);
Radek Krejci85ac8312021-03-03 20:21:33 +01002146 return LY_EVALID;
2147 }
2148 }
2149 } else {
2150 /* ... argument was one of the XML attributes which are represented as child stmt
2151 * with LYS_YIN_ATTR flag */
2152 for (stmt = ext_p->child; stmt && (stmt->flags & LYS_YIN_ATTR); stmt = stmt->next) {
Radek Krejci9f87b0c2021-03-05 14:45:26 +01002153 if (!strcmp(stmt->stmt, ext_def->argname)) {
Radek Krejci85ac8312021-03-03 20:21:33 +01002154 /* this is the extension's argument */
2155 break;
2156 }
2157 }
2158 }
2159
2160 if (stmt) {
2161 LY_CHECK_RET(lydict_insert(ctx, stmt->arg, 0, &ext_p->argument));
2162 stmt->flags |= LYS_YIN_ARGUMENT;
2163 }
2164 }
2165
2166 if (!ext_p->argument) {
2167 /* missing extension's argument */
2168 LOGVAL(ctx, LYVE_SEMANTICS, "Extension instance \"%s\" misses argument %s\"%s\".",
Radek Krejci9f87b0c2021-03-05 14:45:26 +01002169 ext_p->name, (ext_def->flags & LYS_YINELEM_TRUE) ? "element " : "", ext_def->argname);
Radek Krejci85ac8312021-03-03 20:21:33 +01002170 return LY_EVALID;
2171 }
2172
2173 return LY_SUCCESS;
2174}
2175
Michal Vaskofd69e1d2020-07-03 11:57:17 +02002176LY_ARRAY_COUNT_TYPE
Radek Krejcifc596f92021-02-26 22:40:26 +01002177lysp_ext_instance_iter(struct lysp_ext_instance *ext, LY_ARRAY_COUNT_TYPE index, enum ly_stmt substmt)
Radek Krejcid3ca0632019-04-16 16:54:54 +02002178{
2179 LY_CHECK_ARG_RET(NULL, ext, LY_EINVAL);
2180
Michal Vaskod989ba02020-08-24 10:59:24 +02002181 for ( ; index < LY_ARRAY_COUNT(ext); index++) {
Radek Krejciab430862021-03-02 20:13:40 +01002182 if (ext[index].parent_stmt == substmt) {
Radek Krejcid3ca0632019-04-16 16:54:54 +02002183 return index;
2184 }
2185 }
2186
Michal Vaskofd69e1d2020-07-03 11:57:17 +02002187 return LY_ARRAY_COUNT(ext);
Radek Krejcid3ca0632019-04-16 16:54:54 +02002188}
2189
Michal Vasko62ed12d2020-05-21 10:08:25 +02002190const struct lysc_node *
Michal Vasko72244882021-01-12 15:21:05 +01002191lysc_data_node(const struct lysc_node *schema)
Michal Vasko62ed12d2020-05-21 10:08:25 +02002192{
2193 const struct lysc_node *parent;
2194
Michal Vasko72244882021-01-12 15:21:05 +01002195 parent = schema;
Radek Krejcidf549132021-01-21 10:32:32 +01002196 while (parent && !(parent->nodetype & (LYS_CONTAINER | LYS_LEAF | LYS_LEAFLIST | LYS_LIST | LYS_ANYDATA | LYS_RPC |
2197 LYS_ACTION | LYS_NOTIF))) {
Radek Krejci7d95fbb2021-01-26 17:33:13 +01002198 parent = parent->parent;
Michal Vasko72244882021-01-12 15:21:05 +01002199 }
Michal Vasko62ed12d2020-05-21 10:08:25 +02002200
2201 return parent;
2202}
Michal Vaskof4258e12021-06-15 12:11:42 +02002203
2204ly_bool
2205lys_has_recompiled(const struct lys_module *mod)
2206{
2207 LY_ARRAY_COUNT_TYPE u;
2208
2209 if (LYSP_HAS_RECOMPILED(mod->parsed)) {
2210 return 1;
2211 }
2212
2213 LY_ARRAY_FOR(mod->parsed->includes, u) {
2214 if (LYSP_HAS_RECOMPILED(mod->parsed->includes[u].submodule)) {
2215 return 1;
2216 }
2217 }
2218
2219 return 0;
2220}
2221
2222ly_bool
2223lys_has_compiled(const struct lys_module *mod)
2224{
2225 LY_ARRAY_COUNT_TYPE u;
2226
2227 if (LYSP_HAS_COMPILED(mod->parsed)) {
2228 return 1;
2229 }
2230
2231 LY_ARRAY_FOR(mod->parsed->includes, u) {
2232 if (LYSP_HAS_COMPILED(mod->parsed->includes[u].submodule)) {
2233 return 1;
2234 }
2235 }
2236
2237 return 0;
2238}
Michal Vasko7ee5be22021-06-16 17:03:34 +02002239
2240ly_bool
2241lys_has_groupings(const struct lys_module *mod)
2242{
2243 LY_ARRAY_COUNT_TYPE u;
2244
2245 if (mod->parsed->groupings) {
2246 return 1;
2247 }
2248
2249 LY_ARRAY_FOR(mod->parsed->includes, u) {
2250 if (mod->parsed->includes[u].submodule->groupings) {
2251 return 1;
2252 }
2253 }
2254
2255 return 0;
2256}