blob: 760c0524e6bda8dd29bc08d9d384c77024fa1605 [file] [log] [blame]
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001/**
2 * @file schema_compile.c
3 * @author Radek Krejci <rkrejci@cesnet.cz>
Michal Vasko19a09022021-06-15 11:54:08 +02004 * @author Michal Vasko <mvasko@cesnet.cz>
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02005 * @brief Schema compilation.
6 *
Michal Vasko19a09022021-06-15 11:54:08 +02007 * Copyright (c) 2015 - 2021 CESNET, z.s.p.o.
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02008 *
9 * This source code is licensed under BSD 3-Clause License (the "License").
10 * You may not use this file except in compliance with the License.
11 * You may obtain a copy of the License at
12 *
13 * https://opensource.org/licenses/BSD-3-Clause
14 */
15
16#define _GNU_SOURCE
17
18#include "schema_compile.h"
19
20#include <assert.h>
Michal Vasko1a7a7bd2020-10-16 14:39:15 +020021#include <stddef.h>
22#include <stdint.h>
23#include <stdio.h>
24#include <stdlib.h>
25#include <string.h>
26
27#include "common.h"
28#include "compat.h"
29#include "context.h"
30#include "dict.h"
Michal Vaskoafac7822020-10-20 14:22:26 +020031#include "in.h"
Radek Krejci47fab892020-11-05 17:02:41 +010032#include "log.h"
Michal Vasko1a7a7bd2020-10-16 14:39:15 +020033#include "parser_schema.h"
34#include "path.h"
Radek Krejci0aa1f702021-04-01 16:16:19 +020035#include "plugins.h"
Michal Vasko1a7a7bd2020-10-16 14:39:15 +020036#include "plugins_exts.h"
Radek Krejci77114102021-03-10 15:21:57 +010037#include "plugins_exts_compile.h"
Radek Krejci3e6632f2021-03-22 22:08:21 +010038#include "plugins_internal.h"
Michal Vasko1a7a7bd2020-10-16 14:39:15 +020039#include "plugins_types.h"
40#include "schema_compile_amend.h"
41#include "schema_compile_node.h"
Michal Vasko7b1ad1a2020-11-02 15:41:27 +010042#include "schema_features.h"
Michal Vasko1a7a7bd2020-10-16 14:39:15 +020043#include "set.h"
44#include "tree.h"
45#include "tree_data.h"
Michal Vasko1a7a7bd2020-10-16 14:39:15 +020046#include "tree_schema.h"
47#include "tree_schema_internal.h"
48#include "xpath.h"
49
Michal Vasko1a7a7bd2020-10-16 14:39:15 +020050/**
51 * @brief Fill in the prepared compiled extensions definition structure according to the parsed extension definition.
52 */
53static LY_ERR
54lys_compile_extension(struct lysc_ctx *ctx, const struct lys_module *ext_mod, struct lysp_ext *ext_p, struct lysc_ext **ext)
55{
56 LY_ERR ret = LY_SUCCESS;
57
Radek Krejci720d2612021-03-03 19:44:22 +010058 if (ext_p->compiled && (ext_p->compiled->refcount == 1)) {
59 /* context recompilation - all the extension instances were previously freed (the last link to the compiled extension
60 * remains from the parsed extension definition) and now we are recompiling them again, to have the up-to-date
61 * extension definition, we have to recompile it as well now */
62 lysc_extension_free(ctx->ctx, &ext_p->compiled);
63 }
64
Michal Vasko1a7a7bd2020-10-16 14:39:15 +020065 if (!ext_p->compiled) {
66 lysc_update_path(ctx, NULL, "{extension}");
67 lysc_update_path(ctx, NULL, ext_p->name);
68
69 /* compile the extension definition */
70 ext_p->compiled = calloc(1, sizeof **ext);
71 ext_p->compiled->refcount = 1;
72 DUP_STRING_GOTO(ctx->ctx, ext_p->name, ext_p->compiled->name, ret, done);
Radek Krejci9f87b0c2021-03-05 14:45:26 +010073 DUP_STRING_GOTO(ctx->ctx, ext_p->argname, ext_p->compiled->argname, ret, done);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +020074 ext_p->compiled->module = (struct lys_module *)ext_mod;
Radek Krejciab430862021-03-02 20:13:40 +010075 COMPILE_EXTS_GOTO(ctx, ext_p->exts, ext_p->compiled->exts, *ext, ret, done);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +020076
77 lysc_update_path(ctx, NULL, NULL);
78 lysc_update_path(ctx, NULL, NULL);
79
80 /* find extension definition plugin */
Radek Krejci3e6632f2021-03-22 22:08:21 +010081 ext_p->compiled->plugin = lyplg_find(LYPLG_EXTENSION, ext_p->compiled->module->name,
82 ext_p->compiled->module->revision, ext_p->compiled->name);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +020083 }
84
85 *ext = lysc_ext_dup(ext_p->compiled);
86
87done:
Radek Krejci2efc45b2020-12-22 16:25:44 +010088 if (ret) {
89 lysc_update_path(ctx, NULL, NULL);
90 lysc_update_path(ctx, NULL, NULL);
91 }
Michal Vasko1a7a7bd2020-10-16 14:39:15 +020092 return ret;
93}
94
95LY_ERR
96lys_compile_ext(struct lysc_ctx *ctx, struct lysp_ext_instance *ext_p, struct lysc_ext_instance *ext, void *parent,
Radek Krejciab430862021-03-02 20:13:40 +010097 const struct lys_module *ext_mod)
Michal Vasko1a7a7bd2020-10-16 14:39:15 +020098{
Radek Krejci85ac8312021-03-03 20:21:33 +010099 LY_ERR ret = LY_SUCCESS;
100 struct lysp_ext *ext_def;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200101
Radek Krejciab430862021-03-02 20:13:40 +0100102 ext->parent_stmt = ext_p->parent_stmt;
103 ext->parent_stmt_index = ext_p->parent_stmt_index;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200104 ext->module = ctx->cur_mod;
105 ext->parent = parent;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200106
Radek Krejciab430862021-03-02 20:13:40 +0100107 lysc_update_path(ctx, LY_STMT_IS_NODE(ext->parent_stmt) ? ((struct lysc_node *)ext->parent)->module : NULL, "{extension}");
Michal Vaskofc2cd072021-02-24 13:17:17 +0100108 lysc_update_path(ctx, NULL, ext_p->name);
109
Radek Krejci85ac8312021-03-03 20:21:33 +0100110 LY_CHECK_GOTO(ret = lysp_ext_find_definition(ctx->ctx, ext_p, &ext_mod, &ext_def), cleanup);
111 LY_CHECK_GOTO(ret = lys_compile_extension(ctx, ext_mod, ext_def, &ext->def), cleanup);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200112
Radek Krejci9f87b0c2021-03-05 14:45:26 +0100113 if (ext_def->argname) {
Radek Krejci85ac8312021-03-03 20:21:33 +0100114 LY_CHECK_GOTO(ret = lysp_ext_instance_resolve_argument(ctx->ctx, ext_p, ext_def), cleanup);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200115 }
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200116
Radek Krejci85ac8312021-03-03 20:21:33 +0100117 DUP_STRING(ctx->ctx, ext_p->argument, ext->argument, ret);
118 LY_CHECK_RET(ret);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200119
120 if (ext->def->plugin && ext->def->plugin->compile) {
121 if (ext->argument) {
Radek Krejcia6016992021-03-03 10:13:41 +0100122 lysc_update_path(ctx, ext->module, ext->argument);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200123 }
Michal Vaskofc2cd072021-02-24 13:17:17 +0100124 ret = ext->def->plugin->compile(ctx, ext_p, ext);
Radek Krejcicc21a4f2021-02-09 15:23:31 +0100125 if (ret == LY_ENOT) {
126 lysc_ext_instance_free(ctx->ctx, ext);
127 }
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200128 if (ext->argument) {
129 lysc_update_path(ctx, NULL, NULL);
130 }
Michal Vaskofc2cd072021-02-24 13:17:17 +0100131 LY_CHECK_GOTO(ret, cleanup);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200132 }
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200133
134cleanup:
Radek Krejci2efc45b2020-12-22 16:25:44 +0100135 lysc_update_path(ctx, NULL, NULL);
Michal Vaskofc2cd072021-02-24 13:17:17 +0100136 lysc_update_path(ctx, NULL, NULL);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200137
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200138 return ret;
139}
140
141struct lysc_ext *
142lysc_ext_dup(struct lysc_ext *orig)
143{
144 ++orig->refcount;
145 return orig;
146}
147
Jan Kundrátc6e39de2021-12-09 16:01:19 +0100148LIBYANG_API_DEF LY_ERR
Michal Vaskod57b6642022-02-02 09:11:53 +0100149lysc_ext_substmt(const struct lysc_ext_instance *ext, enum ly_stmt substmt, void **instance_p,
150 enum ly_stmt_cardinality *cardinality_p)
Radek Krejci1b2eef82021-02-17 11:17:27 +0100151{
152 LY_ARRAY_COUNT_TYPE u;
153
Michal Vaskob670ff52022-02-15 10:46:08 +0100154 if (instance_p) {
155 *instance_p = NULL;
156 }
157 if (cardinality_p) {
158 *cardinality_p = 0;
159 }
160
Radek Krejci1b2eef82021-02-17 11:17:27 +0100161 LY_ARRAY_FOR(ext->substmts, u) {
Radek Krejci61837f72021-03-02 19:53:59 +0100162 if (LY_STMT_IS_DATA_NODE(substmt)) {
163 if (!LY_STMT_IS_DATA_NODE(ext->substmts[u].stmt)) {
Radek Krejci1b2eef82021-02-17 11:17:27 +0100164 continue;
165 }
166 } else if (LY_STMT_IS_OP(substmt)) {
167 if (!LY_STMT_IS_OP(ext->substmts[u].stmt)) {
168 continue;
169 }
170 } else if (ext->substmts[u].stmt != substmt) {
171 continue;
172 }
173
174 /* match */
175 if (cardinality_p) {
176 *cardinality_p = ext->substmts[u].cardinality;
177 }
178 if (instance_p) {
179 *instance_p = ext->substmts[u].storage;
180 }
181 return LY_SUCCESS;
182 }
183
184 return LY_ENOT;
185}
186
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200187static void
Michal Vaskoc130e162021-10-19 11:30:00 +0200188lysc_unres_must_free(struct lysc_unres_must *m)
189{
190 LY_ARRAY_FREE(m->local_mods);
191 free(m);
192}
193
194static void
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200195lysc_unres_dflt_free(const struct ly_ctx *ctx, struct lysc_unres_dflt *r)
196{
197 assert(!r->dflt || !r->dflts);
198 if (r->dflt) {
199 lysp_qname_free((struct ly_ctx *)ctx, r->dflt);
200 free(r->dflt);
201 } else {
202 FREE_ARRAY((struct ly_ctx *)ctx, r->dflts, lysp_qname_free);
203 }
204 free(r);
205}
206
207void
Radek Krejcia6016992021-03-03 10:13:41 +0100208lysc_update_path(struct lysc_ctx *ctx, struct lys_module *parent_module, const char *name)
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200209{
210 int len;
211 uint8_t nextlevel = 0; /* 0 - no starttag, 1 - '/' starttag, 2 - '=' starttag + '}' endtag */
212
213 if (!name) {
214 /* removing last path segment */
215 if (ctx->path[ctx->path_len - 1] == '}') {
216 for ( ; ctx->path[ctx->path_len] != '=' && ctx->path[ctx->path_len] != '{'; --ctx->path_len) {}
217 if (ctx->path[ctx->path_len] == '=') {
218 ctx->path[ctx->path_len++] = '}';
219 } else {
220 /* not a top-level special tag, remove also preceiding '/' */
221 goto remove_nodelevel;
222 }
223 } else {
224remove_nodelevel:
225 for ( ; ctx->path[ctx->path_len] != '/'; --ctx->path_len) {}
226 if (ctx->path_len == 0) {
227 /* top-level (last segment) */
228 ctx->path_len = 1;
229 }
230 }
231 /* set new terminating NULL-byte */
232 ctx->path[ctx->path_len] = '\0';
233 } else {
234 if (ctx->path_len > 1) {
Radek Krejcia6016992021-03-03 10:13:41 +0100235 if (!parent_module && (ctx->path[ctx->path_len - 1] == '}') && (ctx->path[ctx->path_len - 2] != '\'')) {
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200236 /* extension of the special tag */
237 nextlevel = 2;
238 --ctx->path_len;
239 } else {
240 /* there is already some path, so add next level */
241 nextlevel = 1;
242 }
243 } /* else the path is just initiated with '/', so do not add additional slash in case of top-level nodes */
244
245 if (nextlevel != 2) {
Radek Krejcia6016992021-03-03 10:13:41 +0100246 if ((parent_module && (parent_module == ctx->cur_mod)) || (!parent_module && (ctx->path_len > 1) && (name[0] == '{'))) {
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200247 /* module not changed, print the name unprefixed */
248 len = snprintf(&ctx->path[ctx->path_len], LYSC_CTX_BUFSIZE - ctx->path_len, "%s%s", nextlevel ? "/" : "", name);
249 } else {
250 len = snprintf(&ctx->path[ctx->path_len], LYSC_CTX_BUFSIZE - ctx->path_len, "%s%s:%s", nextlevel ? "/" : "", ctx->cur_mod->name, name);
251 }
252 } else {
253 len = snprintf(&ctx->path[ctx->path_len], LYSC_CTX_BUFSIZE - ctx->path_len, "='%s'}", name);
254 }
255 if (len >= LYSC_CTX_BUFSIZE - (int)ctx->path_len) {
256 /* output truncated */
257 ctx->path_len = LYSC_CTX_BUFSIZE - 1;
258 } else {
259 ctx->path_len += len;
260 }
261 }
Radek Krejci2efc45b2020-12-22 16:25:44 +0100262
Radek Krejciddace2c2021-01-08 11:30:56 +0100263 LOG_LOCBACK(0, 0, 1, 0);
264 LOG_LOCSET(NULL, NULL, ctx->path, NULL);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200265}
266
aPiecek6b3d5422021-07-30 15:55:43 +0200267/**
268 * @brief Compile information from the identity statement
269 *
270 * The backlinks to the identities derived from this one are supposed to be filled later via ::lys_compile_identity_bases().
271 *
272 * @param[in] ctx_sc Compile context - alternative to the combination of @p ctx and @p parsed_mod.
273 * @param[in] ctx libyang context.
274 * @param[in] parsed_mod Module with the identities.
275 * @param[in] identities_p Array of the parsed identity definitions to precompile.
276 * @param[in,out] identities Pointer to the storage of the (pre)compiled identities array where the new identities are
277 * supposed to be added. The storage is supposed to be initiated to NULL when the first parsed identities are going
278 * to be processed.
279 * @return LY_ERR value.
280 */
281static LY_ERR
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200282lys_identity_precompile(struct lysc_ctx *ctx_sc, struct ly_ctx *ctx, struct lysp_module *parsed_mod,
283 struct lysp_ident *identities_p, struct lysc_ident **identities)
284{
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100285 LY_ARRAY_COUNT_TYPE u;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200286 struct lysc_ctx context = {0};
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100287 struct lysc_ident *ident;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200288 LY_ERR ret = LY_SUCCESS;
289
290 assert(ctx_sc || ctx);
291
292 if (!ctx_sc) {
293 context.ctx = ctx;
Radek Krejci3aac9a72020-12-01 12:24:26 +0100294 context.cur_mod = parsed_mod ? parsed_mod->mod : NULL;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200295 context.pmod = parsed_mod;
296 context.path_len = 1;
297 context.path[0] = '/';
298 ctx_sc = &context;
299 }
300
301 if (!identities_p) {
302 return LY_SUCCESS;
303 }
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200304
305 lysc_update_path(ctx_sc, NULL, "{identity}");
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200306 LY_ARRAY_FOR(identities_p, u) {
307 lysc_update_path(ctx_sc, NULL, identities_p[u].name);
308
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100309 /* add new compiled identity */
310 LY_ARRAY_NEW_RET(ctx_sc->ctx, *identities, ident, LY_EMEM);
311
312 DUP_STRING_GOTO(ctx_sc->ctx, identities_p[u].name, ident->name, ret, done);
313 DUP_STRING_GOTO(ctx_sc->ctx, identities_p[u].dsc, ident->dsc, ret, done);
314 DUP_STRING_GOTO(ctx_sc->ctx, identities_p[u].ref, ident->ref, ret, done);
315 ident->module = ctx_sc->cur_mod;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200316 /* backlinks (derived) can be added no sooner than when all the identities in the current module are present */
Radek Krejciab430862021-03-02 20:13:40 +0100317 COMPILE_EXTS_GOTO(ctx_sc, identities_p[u].exts, ident->exts, ident, ret, done);
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100318 ident->flags = identities_p[u].flags;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200319
320 lysc_update_path(ctx_sc, NULL, NULL);
321 }
322 lysc_update_path(ctx_sc, NULL, NULL);
323done:
324 return ret;
325}
326
327/**
328 * @brief Check circular dependency of identities - identity MUST NOT reference itself (via their base statement).
329 *
330 * The function works in the same way as lys_compile_feature_circular_check() with different structures and error messages.
331 *
332 * @param[in] ctx Compile context for logging.
333 * @param[in] ident The base identity (its derived list is being extended by the identity being currently processed).
334 * @param[in] derived The list of derived identities of the identity being currently processed (not the one provided as @p ident)
335 * @return LY_SUCCESS if everything is ok.
336 * @return LY_EVALID if the identity is derived from itself.
337 */
338static LY_ERR
339lys_compile_identity_circular_check(struct lysc_ctx *ctx, struct lysc_ident *ident, struct lysc_ident **derived)
340{
341 LY_ERR ret = LY_SUCCESS;
342 LY_ARRAY_COUNT_TYPE u, v;
343 struct ly_set recursion = {0};
344 struct lysc_ident *drv;
345
346 if (!derived) {
347 return LY_SUCCESS;
348 }
349
350 for (u = 0; u < LY_ARRAY_COUNT(derived); ++u) {
351 if (ident == derived[u]) {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100352 LOGVAL(ctx->ctx, LYVE_REFERENCE,
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200353 "Identity \"%s\" is indirectly derived from itself.", ident->name);
354 ret = LY_EVALID;
355 goto cleanup;
356 }
357 ret = ly_set_add(&recursion, derived[u], 0, NULL);
358 LY_CHECK_GOTO(ret, cleanup);
359 }
360
361 for (v = 0; v < recursion.count; ++v) {
362 drv = recursion.objs[v];
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200363 for (u = 0; u < LY_ARRAY_COUNT(drv->derived); ++u) {
364 if (ident == drv->derived[u]) {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100365 LOGVAL(ctx->ctx, LYVE_REFERENCE,
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200366 "Identity \"%s\" is indirectly derived from itself.", ident->name);
367 ret = LY_EVALID;
368 goto cleanup;
369 }
370 ret = ly_set_add(&recursion, drv->derived[u], 0, NULL);
371 LY_CHECK_GOTO(ret, cleanup);
372 }
373 }
374
375cleanup:
376 ly_set_erase(&recursion, NULL);
377 return ret;
378}
379
380LY_ERR
381lys_compile_identity_bases(struct lysc_ctx *ctx, const struct lysp_module *base_pmod, const char **bases_p,
aPiecekf4a0a192021-08-03 15:14:17 +0200382 struct lysc_ident *ident, struct lysc_ident ***bases)
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200383{
384 LY_ARRAY_COUNT_TYPE u, v;
385 const char *s, *name;
386 const struct lys_module *mod;
387 struct lysc_ident **idref;
388
aPiecekf4a0a192021-08-03 15:14:17 +0200389 assert(ident || bases);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200390
391 if ((LY_ARRAY_COUNT(bases_p) > 1) && (ctx->pmod->version < LYS_VERSION_1_1)) {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100392 LOGVAL(ctx->ctx, LYVE_SYNTAX_YANG,
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200393 "Multiple bases in %s are allowed only in YANG 1.1 modules.", ident ? "identity" : "identityref type");
394 return LY_EVALID;
395 }
396
397 LY_ARRAY_FOR(bases_p, u) {
398 s = strchr(bases_p[u], ':');
399 if (s) {
400 /* prefixed identity */
401 name = &s[1];
Radek Krejci8df109d2021-04-23 12:19:08 +0200402 mod = ly_resolve_prefix(ctx->ctx, bases_p[u], s - bases_p[u], LY_VALUE_SCHEMA, (void *)base_pmod);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200403 } else {
404 name = bases_p[u];
405 mod = base_pmod->mod;
406 }
407 if (!mod) {
408 if (ident) {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100409 LOGVAL(ctx->ctx, LYVE_SYNTAX_YANG,
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200410 "Invalid prefix used for base (%s) of identity \"%s\".", bases_p[u], ident->name);
411 } else {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100412 LOGVAL(ctx->ctx, LYVE_SYNTAX_YANG,
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200413 "Invalid prefix used for base (%s) of identityref.", bases_p[u]);
414 }
415 return LY_EVALID;
416 }
417
418 idref = NULL;
419 LY_ARRAY_FOR(mod->identities, v) {
420 if (!strcmp(name, mod->identities[v].name)) {
421 if (ident) {
422 if (ident == &mod->identities[v]) {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100423 LOGVAL(ctx->ctx, LYVE_REFERENCE,
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200424 "Identity \"%s\" is derived from itself.", ident->name);
425 return LY_EVALID;
426 }
427 LY_CHECK_RET(lys_compile_identity_circular_check(ctx, &mod->identities[v], ident->derived));
428 /* we have match! store the backlink */
429 LY_ARRAY_NEW_RET(ctx->ctx, mod->identities[v].derived, idref, LY_EMEM);
430 *idref = ident;
431 } else {
432 /* we have match! store the found identity */
433 LY_ARRAY_NEW_RET(ctx->ctx, *bases, idref, LY_EMEM);
434 *idref = &mod->identities[v];
435 }
436 break;
437 }
438 }
aPiecekf4a0a192021-08-03 15:14:17 +0200439 if (!idref) {
Radek Krejci10443f42021-03-28 17:40:35 +0200440 if (ident) {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100441 LOGVAL(ctx->ctx, LYVE_SYNTAX_YANG,
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200442 "Unable to find base (%s) of identity \"%s\".", bases_p[u], ident->name);
443 } else {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100444 LOGVAL(ctx->ctx, LYVE_SYNTAX_YANG,
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200445 "Unable to find base (%s) of identityref.", bases_p[u]);
446 }
447 return LY_EVALID;
448 }
449 }
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100450
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200451 return LY_SUCCESS;
452}
453
454/**
455 * @brief For the given array of identities, set the backlinks from all their base identities.
456 * @param[in] ctx Compile context, not only for logging but also to get the current module to resolve prefixes.
457 * @param[in] idents_p Array of identities definitions from the parsed schema structure.
aPiecekf4a0a192021-08-03 15:14:17 +0200458 * @param[in,out] idents Array of referencing identities to which the backlinks are supposed to be set.
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200459 * @return LY_ERR value - LY_SUCCESS or LY_EVALID.
460 */
461static LY_ERR
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100462lys_compile_identities_derived(struct lysc_ctx *ctx, struct lysp_ident *idents_p, struct lysc_ident **idents)
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200463{
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100464 LY_ARRAY_COUNT_TYPE u, v;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200465
466 lysc_update_path(ctx, NULL, "{identity}");
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100467
aPiecekf3e2db82021-08-05 10:18:43 +0200468 for (u = 0; u < LY_ARRAY_COUNT(*idents); ++u) {
aPiecekf4a0a192021-08-03 15:14:17 +0200469 /* find matching parsed identity */
aPiecekf3e2db82021-08-05 10:18:43 +0200470 for (v = 0; v < LY_ARRAY_COUNT(idents_p); ++v) {
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100471 if (idents_p[v].name == (*idents)[u].name) {
472 break;
473 }
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100474 }
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100475
Michal Vaskodc6f84c2021-06-15 14:50:27 +0200476 if ((v == LY_ARRAY_COUNT(idents_p)) || !idents_p[v].bases) {
477 /* identity not found (it may be from a submodule) or identity without bases */
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200478 continue;
479 }
Michal Vaskodc6f84c2021-06-15 14:50:27 +0200480
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100481 lysc_update_path(ctx, NULL, (*idents)[u].name);
aPiecekf4a0a192021-08-03 15:14:17 +0200482 LY_CHECK_RET(lys_compile_identity_bases(ctx, ctx->pmod, idents_p[v].bases, &(*idents)[u], NULL));
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200483 lysc_update_path(ctx, NULL, NULL);
484 }
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100485
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200486 lysc_update_path(ctx, NULL, NULL);
487 return LY_SUCCESS;
488}
489
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200490static void *
491lys_compile_extension_instance_storage(enum ly_stmt stmt, struct lysc_ext_substmt *substmts)
492{
493 for (LY_ARRAY_COUNT_TYPE u = 0; substmts[u].stmt; ++u) {
494 if (substmts[u].stmt == stmt) {
495 return substmts[u].storage;
496 }
497 }
498 return NULL;
499}
500
501LY_ERR
Radek Krejci6b88a462021-02-17 12:39:34 +0100502lys_compile_extension_instance(struct lysc_ctx *ctx, const struct lysp_ext_instance *ext_p, struct lysc_ext_instance *ext)
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200503{
aPiecek1c4da362021-04-29 14:26:34 +0200504 LY_ERR ret = LY_SUCCESS, r;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200505 LY_ARRAY_COUNT_TYPE u;
506 struct lysp_stmt *stmt;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200507 void *parsed = NULL, **compiled = NULL;
508
509 /* check for invalid substatements */
Radek Krejci6b88a462021-02-17 12:39:34 +0100510 for (stmt = ext_p->child; stmt; stmt = stmt->next) {
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200511 if (stmt->flags & (LYS_YIN_ATTR | LYS_YIN_ARGUMENT)) {
512 continue;
513 }
Radek Krejci6b88a462021-02-17 12:39:34 +0100514 LY_ARRAY_FOR(ext->substmts, u) {
515 if (ext->substmts[u].stmt == stmt->kw) {
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200516 break;
517 }
518 }
Radek Krejci6b88a462021-02-17 12:39:34 +0100519 if (u == LY_ARRAY_COUNT(ext->substmts)) {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100520 LOGVAL(ctx->ctx, LYVE_SYNTAX_YANG, "Invalid keyword \"%s\" as a child of \"%s%s%s\" extension instance.",
Radek Krejci6b88a462021-02-17 12:39:34 +0100521 stmt->stmt, ext_p->name, ext_p->argument ? " " : "", ext_p->argument ? ext_p->argument : "");
aPiecek1c4da362021-04-29 14:26:34 +0200522 ret = LY_EVALID;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200523 goto cleanup;
524 }
525 }
526
527 /* TODO store inherited data, e.g. status first, but mark them somehow to allow to overwrite them and not detect duplicity */
528
Radek Krejci6b88a462021-02-17 12:39:34 +0100529 /* note into the compile context that we are processing extension now */
530 ctx->ext = ext;
531
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200532 /* keep order of the processing the same as the order in the defined substmts,
533 * the order is important for some of the statements depending on others (e.g. type needs status and units) */
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200534
Radek Krejci6b88a462021-02-17 12:39:34 +0100535 LY_ARRAY_FOR(ext->substmts, u) {
536 uint64_t stmt_counter = 0;
537
538 for (stmt = ext_p->child; stmt; stmt = stmt->next) {
539 if (ext->substmts[u].stmt != stmt->kw) {
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200540 continue;
541 }
542
Radek Krejci6b88a462021-02-17 12:39:34 +0100543 parsed = NULL;
544 stmt_counter++;
545 if (ext->substmts[u].storage) {
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200546 switch (stmt->kw) {
Radek Krejci6b88a462021-02-17 12:39:34 +0100547 case LY_STMT_ACTION:
548 case LY_STMT_ANYDATA:
549 case LY_STMT_ANYXML:
550 case LY_STMT_CONTAINER:
551 case LY_STMT_CHOICE:
552 case LY_STMT_LEAF:
553 case LY_STMT_LEAF_LIST:
554 case LY_STMT_LIST:
555 case LY_STMT_NOTIFICATION:
556 case LY_STMT_RPC:
557 case LY_STMT_USES:
aPiecek60d9d672021-04-27 15:49:57 +0200558 if (!ext_p->parsed) {
559 struct lysp_ext_instance *unconst_ext_p;
560 r = lysp_stmt_parse(ctx, stmt, &parsed, NULL);
561 LY_CHECK_ERR_GOTO(r, ret = r, cleanup);
562 unconst_ext_p = (struct lysp_ext_instance *)ext_p;
563 unconst_ext_p->parsed = parsed;
564 } else {
Michal Vaskoa9309bb2021-07-09 09:31:55 +0200565 struct lysp_node *node, *last_node = NULL;
aPiecek60d9d672021-04-27 15:49:57 +0200566 /* get last parsed node */
567 LY_LIST_FOR(ext_p->parsed, node) {
568 last_node = node;
569 }
570 /* create and link sibling */
571 r = lysp_stmt_parse(ctx, stmt, &parsed, NULL);
572 LY_CHECK_ERR_GOTO(r, ret = r, cleanup);
573 last_node->next = parsed;
574 }
Radek Krejci6b88a462021-02-17 12:39:34 +0100575
576 /* set storage as an alternative document root in the compile context */
577 r = lys_compile_node(ctx, parsed, NULL, 0, NULL);
Radek Krejci6b88a462021-02-17 12:39:34 +0100578 LY_CHECK_ERR_GOTO(r, ret = r, cleanup);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200579 break;
Radek Krejci1b2eef82021-02-17 11:17:27 +0100580 case LY_STMT_DESCRIPTION:
581 case LY_STMT_REFERENCE:
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200582 case LY_STMT_UNITS: {
Radek Krejci6b88a462021-02-17 12:39:34 +0100583 const char **str_p;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200584
Radek Krejci6b88a462021-02-17 12:39:34 +0100585 if (ext->substmts[u].cardinality < LY_STMT_CARD_SOME) {
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200586 /* single item */
Radek Krejci6b88a462021-02-17 12:39:34 +0100587 if (*((const char **)ext->substmts[u].storage)) {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100588 LOGVAL(ctx->ctx, LY_VCODE_DUPSTMT, stmt->stmt);
aPiecek1c4da362021-04-29 14:26:34 +0200589 ret = LY_EVALID;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200590 goto cleanup;
591 }
Radek Krejci6b88a462021-02-17 12:39:34 +0100592 str_p = (const char **)ext->substmts[u].storage;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200593 } else {
594 /* sized array */
Radek Krejci6b88a462021-02-17 12:39:34 +0100595 const char ***strings_array = (const char ***)ext->substmts[u].storage;
596 LY_ARRAY_NEW_GOTO(ctx->ctx, *strings_array, str_p, ret, cleanup);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200597 }
Radek Krejci6b88a462021-02-17 12:39:34 +0100598 r = lydict_insert(ctx->ctx, stmt->arg, 0, str_p);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200599 LY_CHECK_ERR_GOTO(r, ret = r, cleanup);
600 break;
601 }
Radek Krejci6b88a462021-02-17 12:39:34 +0100602 case LY_STMT_IF_FEATURE: {
603 ly_bool enabled;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200604
Radek Krejci76c8c4e2021-02-17 10:16:48 +0100605 r = lysp_stmt_parse(ctx, stmt, &parsed, NULL);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200606 LY_CHECK_ERR_GOTO(r, ret = r, cleanup);
Radek Krejci6b88a462021-02-17 12:39:34 +0100607
608 r = lys_eval_iffeatures(ctx->ctx, parsed, &enabled);
609 FREE_ARRAY(ctx->ctx, (struct lysp_qname *)parsed, lysp_qname_free);
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100610 LY_CHECK_ERR_GOTO(r, ret = r, cleanup);
611 if (!enabled) {
612 /* it is disabled, remove the whole extension instance */
613 return LY_ENOT;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200614 }
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200615 break;
Radek Krejci6b88a462021-02-17 12:39:34 +0100616 }
617 case LY_STMT_STATUS:
618 assert(ext->substmts[u].cardinality < LY_STMT_CARD_SOME);
619 LY_CHECK_ERR_GOTO(r = lysp_stmt_parse(ctx, stmt, &ext->substmts[u].storage, /* TODO */ NULL), ret = r, cleanup);
620 break;
621 case LY_STMT_TYPE: {
622 uint16_t *flags = lys_compile_extension_instance_storage(LY_STMT_STATUS, ext->substmts);
623 const char **units = lys_compile_extension_instance_storage(LY_STMT_UNITS, ext->substmts);
624
625 if (ext->substmts[u].cardinality < LY_STMT_CARD_SOME) {
626 /* single item */
627 if (*(struct lysc_type **)ext->substmts[u].storage) {
628 LOGVAL(ctx->ctx, LY_VCODE_DUPSTMT, stmt->stmt);
aPiecek1c4da362021-04-29 14:26:34 +0200629 ret = LY_EVALID;
Radek Krejci6b88a462021-02-17 12:39:34 +0100630 goto cleanup;
631 }
632 compiled = ext->substmts[u].storage;
633 } else {
634 /* sized array */
635 struct lysc_type ***types = (struct lysc_type ***)ext->substmts[u].storage, **type = NULL;
636 LY_ARRAY_NEW_GOTO(ctx->ctx, *types, type, ret, cleanup);
637 compiled = (void *)type;
638 }
639
640 r = lysp_stmt_parse(ctx, stmt, &parsed, NULL);
641 LY_CHECK_ERR_GOTO(r, ret = r, cleanup);
642 r = lys_compile_type(ctx, NULL, flags ? *flags : 0, ext_p->name, parsed, (struct lysc_type **)compiled,
643 units && !*units ? units : NULL, NULL);
644 lysp_type_free(ctx->ctx, parsed);
645 free(parsed);
646 LY_CHECK_ERR_GOTO(r, ret = r, cleanup);
647 break;
648 }
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200649 /* TODO support other substatements (parse stmt to lysp and then compile lysp to lysc),
650 * also note that in many statements their extensions are not taken into account */
651 default:
Radek Krejci2efc45b2020-12-22 16:25:44 +0100652 LOGVAL(ctx->ctx, LYVE_SYNTAX_YANG, "Statement \"%s\" is not supported as an extension (found in \"%s%s%s\") substatement.",
Radek Krejci6b88a462021-02-17 12:39:34 +0100653 stmt->stmt, ext_p->name, ext_p->argument ? " " : "", ext_p->argument ? ext_p->argument : "");
aPiecek1c4da362021-04-29 14:26:34 +0200654 ret = LY_EVALID;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200655 goto cleanup;
656 }
657 }
658 }
659
Radek Krejci6b88a462021-02-17 12:39:34 +0100660 if (((ext->substmts[u].cardinality == LY_STMT_CARD_MAND) || (ext->substmts[u].cardinality == LY_STMT_CARD_SOME)) && !stmt_counter) {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100661 LOGVAL(ctx->ctx, LYVE_SYNTAX_YANG, "Missing mandatory keyword \"%s\" as a child of \"%s%s%s\".",
Radek Krejci6b88a462021-02-17 12:39:34 +0100662 ly_stmt2str(ext->substmts[u].stmt), ext_p->name, ext_p->argument ? " " : "", ext_p->argument ? ext_p->argument : "");
aPiecek1c4da362021-04-29 14:26:34 +0200663 ret = LY_EVALID;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200664 goto cleanup;
665 }
666 }
667
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200668cleanup:
Radek Krejci6b88a462021-02-17 12:39:34 +0100669 ctx->ext = NULL;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200670 return ret;
671}
672
673/**
674 * @brief Check when for cyclic dependencies.
675 *
676 * @param[in] set Set with all the referenced nodes.
677 * @param[in] node Node whose "when" referenced nodes are in @p set.
678 * @return LY_ERR value
679 */
680static LY_ERR
681lys_compile_unres_when_cyclic(struct lyxp_set *set, const struct lysc_node *node)
682{
683 struct lyxp_set tmp_set;
684 struct lyxp_set_scnode *xp_scnode;
685 uint32_t i, j;
686 LY_ARRAY_COUNT_TYPE u;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200687 LY_ERR ret = LY_SUCCESS;
688
689 memset(&tmp_set, 0, sizeof tmp_set);
690
691 /* prepare in_ctx of the set */
692 for (i = 0; i < set->used; ++i) {
693 xp_scnode = &set->val.scnodes[i];
694
Radek Krejcif13b87b2020-12-01 22:02:17 +0100695 if (xp_scnode->in_ctx != LYXP_SET_SCNODE_START_USED) {
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200696 /* check node when, skip the context node (it was just checked) */
Radek Krejcif13b87b2020-12-01 22:02:17 +0100697 xp_scnode->in_ctx = LYXP_SET_SCNODE_ATOM_CTX;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200698 }
699 }
700
701 for (i = 0; i < set->used; ++i) {
702 xp_scnode = &set->val.scnodes[i];
Radek Krejcif13b87b2020-12-01 22:02:17 +0100703 if (xp_scnode->in_ctx != LYXP_SET_SCNODE_ATOM_CTX) {
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200704 /* already checked */
705 continue;
706 }
707
Michal Vasko1a09b212021-05-06 13:00:10 +0200708 if ((xp_scnode->type != LYXP_NODE_ELEM) || !lysc_node_when(xp_scnode->scnode)) {
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200709 /* no when to check */
Michal Vasko1a09b212021-05-06 13:00:10 +0200710 xp_scnode->in_ctx = LYXP_SET_SCNODE_ATOM_NODE;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200711 continue;
712 }
713
714 node = xp_scnode->scnode;
715 do {
Radek Krejci9a3823e2021-01-27 20:26:46 +0100716 struct lysc_when **when_list, *when;
717
Radek Krejciddace2c2021-01-08 11:30:56 +0100718 LOG_LOCSET(node, NULL, NULL, NULL);
Radek Krejci9a3823e2021-01-27 20:26:46 +0100719 when_list = lysc_node_when(node);
720 LY_ARRAY_FOR(when_list, u) {
721 when = when_list[u];
Radek Krejci8df109d2021-04-23 12:19:08 +0200722 ret = lyxp_atomize(set->ctx, when->cond, node->module, LY_VALUE_SCHEMA_RESOLVED, when->prefixes,
Michal Vasko400e9672021-01-11 13:39:17 +0100723 when->context, &tmp_set, LYXP_SCNODE_SCHEMA);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200724 if (ret != LY_SUCCESS) {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100725 LOGVAL(set->ctx, LYVE_SEMANTICS, "Invalid when condition \"%s\".", when->cond->expr);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200726 goto cleanup;
727 }
728
729 for (j = 0; j < tmp_set.used; ++j) {
730 /* skip roots'n'stuff */
731 if (tmp_set.val.scnodes[j].type == LYXP_NODE_ELEM) {
732 /* try to find this node in our set */
733 uint32_t idx;
Radek Krejcif13b87b2020-12-01 22:02:17 +0100734 if (lyxp_set_scnode_contains(set, tmp_set.val.scnodes[j].scnode, LYXP_NODE_ELEM, -1, &idx) &&
735 (set->val.scnodes[idx].in_ctx == LYXP_SET_SCNODE_START_USED)) {
Michal Vasko2c4d9152021-07-20 09:17:28 +0200736 LOGVAL(set->ctx, LYVE_SEMANTICS, "When condition cyclic dependency on the node \"%s\".",
737 tmp_set.val.scnodes[j].scnode->name);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200738 ret = LY_EVALID;
739 goto cleanup;
740 }
741
742 /* needs to be checked, if in both sets, will be ignored */
Radek Krejcif13b87b2020-12-01 22:02:17 +0100743 tmp_set.val.scnodes[j].in_ctx = LYXP_SET_SCNODE_ATOM_CTX;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200744 } else {
745 /* no when, nothing to check */
Michal Vasko1a09b212021-05-06 13:00:10 +0200746 tmp_set.val.scnodes[j].in_ctx = LYXP_SET_SCNODE_ATOM_NODE;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200747 }
748 }
749
750 /* merge this set into the global when set */
751 lyxp_set_scnode_merge(set, &tmp_set);
752 }
753
754 /* check when of non-data parents as well */
755 node = node->parent;
Radek Krejci2efc45b2020-12-22 16:25:44 +0100756
Radek Krejciddace2c2021-01-08 11:30:56 +0100757 LOG_LOCBACK(1, 0, 0, 0);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200758 } while (node && (node->nodetype & (LYS_CASE | LYS_CHOICE)));
759
760 /* this node when was checked (xp_scnode could have been reallocd) */
Michal Vasko60edc2f2021-07-20 09:18:02 +0200761 set->val.scnodes[i].in_ctx = LYXP_SET_SCNODE_ATOM_NODE;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200762 }
763
764cleanup:
765 lyxp_set_free_content(&tmp_set);
766 return ret;
767}
768
769LY_ERR
770lysc_check_status(struct lysc_ctx *ctx, uint16_t flags1, void *mod1, const char *name1, uint16_t flags2, void *mod2,
771 const char *name2)
772{
773 uint16_t flg1, flg2;
774
775 flg1 = (flags1 & LYS_STATUS_MASK) ? (flags1 & LYS_STATUS_MASK) : LYS_STATUS_CURR;
776 flg2 = (flags2 & LYS_STATUS_MASK) ? (flags2 & LYS_STATUS_MASK) : LYS_STATUS_CURR;
777
778 if ((flg1 < flg2) && (mod1 == mod2)) {
779 if (ctx) {
Michal Vasko23864e02021-06-24 09:23:58 +0200780 LOGVAL(ctx->ctx, LYVE_REFERENCE, "A %s definition \"%s\" is not allowed to reference %s definition \"%s\".",
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200781 flg1 == LYS_STATUS_CURR ? "current" : "deprecated", name1,
782 flg2 == LYS_STATUS_OBSLT ? "obsolete" : "deprecated", name2);
783 }
784 return LY_EVALID;
785 }
786
787 return LY_SUCCESS;
788}
789
Michal Vasko25d6ad02020-10-22 12:20:22 +0200790LY_ERR
Radek Krejci8df109d2021-04-23 12:19:08 +0200791lys_compile_expr_implement(const struct ly_ctx *ctx, const struct lyxp_expr *expr, LY_VALUE_FORMAT format,
Michal Vasko405cc9e2020-12-01 12:01:27 +0100792 void *prefix_data, ly_bool implement, struct lys_glob_unres *unres, const struct lys_module **mod_p)
Michal Vaskocfaff232020-10-20 09:35:14 +0200793{
794 uint32_t i;
Michal Vaskoc56d6372021-10-19 12:29:00 +0200795 const char *ptr, *start, **imp_f, *all_f[] = {"*", NULL};
Michal Vaskocfaff232020-10-20 09:35:14 +0200796 const struct lys_module *mod;
797
Michal Vasko25d6ad02020-10-22 12:20:22 +0200798 assert(implement || mod_p);
799
Michal Vaskocfaff232020-10-20 09:35:14 +0200800 for (i = 0; i < expr->used; ++i) {
801 if ((expr->tokens[i] != LYXP_TOKEN_NAMETEST) && (expr->tokens[i] != LYXP_TOKEN_LITERAL)) {
802 /* token cannot have a prefix */
803 continue;
804 }
805
806 start = expr->expr + expr->tok_pos[i];
807 if (!(ptr = ly_strnchr(start, ':', expr->tok_len[i]))) {
808 /* token without a prefix */
809 continue;
810 }
811
812 if (!(mod = ly_resolve_prefix(ctx, start, ptr - start, format, prefix_data))) {
813 /* unknown prefix, do not care right now */
814 continue;
815 }
816
Michal Vasko0c296722021-07-14 08:53:16 +0200817 /* unimplemented module found */
818 if (!mod->implemented && !implement) {
819 /* should not be implemented now */
820 *mod_p = mod;
821 break;
822 }
823
Michal Vaskocfaff232020-10-20 09:35:14 +0200824 if (!mod->implemented) {
Michal Vasko0c296722021-07-14 08:53:16 +0200825 /* implement if not implemented */
Michal Vaskoc56d6372021-10-19 12:29:00 +0200826 imp_f = (ctx->flags & LY_CTX_ENABLE_IMP_FEATURES) ? all_f : NULL;
827 LY_CHECK_RET(lys_implement((struct lys_module *)mod, imp_f, unres));
Michal Vasko0c296722021-07-14 08:53:16 +0200828 }
829 if (!mod->compiled) {
830 /* compile if not implemented before or only marked for compilation */
831 LY_CHECK_RET(lys_compile((struct lys_module *)mod, &unres->ds_unres));
Michal Vaskocfaff232020-10-20 09:35:14 +0200832 }
833 }
834
Michal Vasko25d6ad02020-10-22 12:20:22 +0200835 return LY_SUCCESS;
Michal Vaskocfaff232020-10-20 09:35:14 +0200836}
837
838/**
Michal Vaskoc130e162021-10-19 11:30:00 +0200839 * @brief Check when expressions of a node on a complete compiled schema tree.
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200840 *
841 * @param[in] ctx Compile context.
842 * @param[in] node Node to check.
Michal Vasko405cc9e2020-12-01 12:01:27 +0100843 * @param[in,out] unres Global unres structure.
Michal Vasko40c158c2021-04-28 17:01:03 +0200844 * @return LY_ERECOMPILE
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200845 * @return LY_ERR value
846 */
847static LY_ERR
Michal Vaskoc130e162021-10-19 11:30:00 +0200848lys_compile_unres_when(struct lysc_ctx *ctx, const struct lysc_node *node, struct lys_glob_unres *unres)
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200849{
850 struct lyxp_set tmp_set;
851 uint32_t i, opts;
852 LY_ARRAY_COUNT_TYPE u;
Radek Krejci9a3823e2021-01-27 20:26:46 +0100853 struct lysc_when **whens = NULL;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200854 LY_ERR ret = LY_SUCCESS;
Michal Vaskocfaff232020-10-20 09:35:14 +0200855 const struct lys_module *mod;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200856
Radek Krejciddace2c2021-01-08 11:30:56 +0100857 LOG_LOCSET(node, NULL, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100858
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200859 memset(&tmp_set, 0, sizeof tmp_set);
Michal Vaskod1e53b92021-01-28 13:11:06 +0100860 opts = LYXP_SCNODE_SCHEMA | ((node->flags & LYS_IS_OUTPUT) ? LYXP_SCNODE_OUTPUT : 0);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200861
Radek Krejci9a3823e2021-01-27 20:26:46 +0100862 whens = lysc_node_when(node);
Radek Krejci9a3823e2021-01-27 20:26:46 +0100863 LY_ARRAY_FOR(whens, u) {
Michal Vaskocfaff232020-10-20 09:35:14 +0200864 /* first check whether all the referenced modules are implemented */
Michal Vasko25d6ad02020-10-22 12:20:22 +0200865 mod = NULL;
Radek Krejci8df109d2021-04-23 12:19:08 +0200866 ret = lys_compile_expr_implement(ctx->ctx, whens[u]->cond, LY_VALUE_SCHEMA_RESOLVED, whens[u]->prefixes,
Michal Vasko405cc9e2020-12-01 12:01:27 +0100867 ctx->ctx->flags & LY_CTX_REF_IMPLEMENTED, unres, &mod);
Michal Vasko25d6ad02020-10-22 12:20:22 +0200868 if (ret) {
869 goto cleanup;
870 } else if (mod) {
Michal Vaskocfaff232020-10-20 09:35:14 +0200871 LOGWRN(ctx->ctx, "When condition \"%s\" check skipped because referenced module \"%s\" is not implemented.",
Radek Krejci9a3823e2021-01-27 20:26:46 +0100872 whens[u]->cond->expr, mod->name);
Michal Vaskocfaff232020-10-20 09:35:14 +0200873 continue;
874 }
875
876 /* check "when" */
Radek Krejci8df109d2021-04-23 12:19:08 +0200877 ret = lyxp_atomize(ctx->ctx, whens[u]->cond, node->module, LY_VALUE_SCHEMA_RESOLVED, whens[u]->prefixes,
Radek Krejci9a3823e2021-01-27 20:26:46 +0100878 whens[u]->context, &tmp_set, opts);
Michal Vasko25d6ad02020-10-22 12:20:22 +0200879 if (ret) {
Radek Krejci9a3823e2021-01-27 20:26:46 +0100880 LOGVAL(ctx->ctx, LYVE_SEMANTICS, "Invalid when condition \"%s\".", whens[u]->cond->expr);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200881 goto cleanup;
882 }
883
884 ctx->path[0] = '\0';
Michal Vasko14ed9cd2021-01-28 14:16:25 +0100885 lysc_path(node, LYSC_PATH_LOG, ctx->path, LYSC_CTX_BUFSIZE);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200886 for (i = 0; i < tmp_set.used; ++i) {
887 /* skip roots'n'stuff */
Michal Vasko6b8c5102021-10-19 11:29:32 +0200888 if ((tmp_set.val.scnodes[i].type == LYXP_NODE_ELEM) &&
889 (tmp_set.val.scnodes[i].in_ctx != LYXP_SET_SCNODE_START_USED)) {
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200890 struct lysc_node *schema = tmp_set.val.scnodes[i].scnode;
891
892 /* XPath expression cannot reference "lower" status than the node that has the definition */
Radek Krejci9a3823e2021-01-27 20:26:46 +0100893 ret = lysc_check_status(ctx, whens[u]->flags, node->module, node->name, schema->flags, schema->module,
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200894 schema->name);
895 LY_CHECK_GOTO(ret, cleanup);
896
Michal Vasko1a09b212021-05-06 13:00:10 +0200897 /* check dummy node children/value accessing */
898 if (lysc_data_parent(schema) == node) {
899 LOGVAL(ctx->ctx, LYVE_SEMANTICS, "When condition is accessing its own conditional node children.");
900 ret = LY_EVALID;
901 goto cleanup;
902 } else if ((schema == node) && (tmp_set.val.scnodes[i].in_ctx == LYXP_SET_SCNODE_ATOM_VAL)) {
903 LOGVAL(ctx->ctx, LYVE_SEMANTICS, "When condition is accessing its own conditional node value.");
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200904 ret = LY_EVALID;
905 goto cleanup;
906 }
907 }
908 }
909
910 /* check cyclic dependencies */
911 ret = lys_compile_unres_when_cyclic(&tmp_set, node);
912 LY_CHECK_GOTO(ret, cleanup);
913
914 lyxp_set_free_content(&tmp_set);
915 }
916
Michal Vaskoc130e162021-10-19 11:30:00 +0200917cleanup:
918 lyxp_set_free_content(&tmp_set);
919 LOG_LOCBACK(1, 0, 0, 0);
920 return ret;
921}
922
923/**
924 * @brief Check must expressions of a node on a complete compiled schema tree.
925 *
926 * @param[in] ctx Compile context.
927 * @param[in] node Node to check.
928 * @param[in] local_mods Sized array of local modules for musts of @p node at the same index.
929 * @param[in,out] unres Global unres structure.
930 * @return LY_ERECOMPILE
931 * @return LY_ERR value
932 */
933static LY_ERR
934lys_compile_unres_must(struct lysc_ctx *ctx, const struct lysc_node *node, const struct lysp_module **local_mods,
935 struct lys_glob_unres *unres)
936{
937 struct lyxp_set tmp_set;
938 uint32_t i, opts;
939 LY_ARRAY_COUNT_TYPE u;
940 struct lysc_must *musts = NULL;
941 LY_ERR ret = LY_SUCCESS;
942 const struct lys_module *mod;
943 uint16_t flg;
944
945 LOG_LOCSET(node, NULL, NULL, NULL);
946
947 memset(&tmp_set, 0, sizeof tmp_set);
948 opts = LYXP_SCNODE_SCHEMA | ((node->flags & LYS_IS_OUTPUT) ? LYXP_SCNODE_OUTPUT : 0);
949
950 musts = lysc_node_musts(node);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200951 LY_ARRAY_FOR(musts, u) {
Michal Vaskocfaff232020-10-20 09:35:14 +0200952 /* first check whether all the referenced modules are implemented */
Michal Vasko25d6ad02020-10-22 12:20:22 +0200953 mod = NULL;
Radek Krejci8df109d2021-04-23 12:19:08 +0200954 ret = lys_compile_expr_implement(ctx->ctx, musts[u].cond, LY_VALUE_SCHEMA_RESOLVED, musts[u].prefixes,
Michal Vasko405cc9e2020-12-01 12:01:27 +0100955 ctx->ctx->flags & LY_CTX_REF_IMPLEMENTED, unres, &mod);
Michal Vasko25d6ad02020-10-22 12:20:22 +0200956 if (ret) {
957 goto cleanup;
958 } else if (mod) {
Michal Vaskocfaff232020-10-20 09:35:14 +0200959 LOGWRN(ctx->ctx, "Must condition \"%s\" check skipped because referenced module \"%s\" is not implemented.",
960 musts[u].cond->expr, mod->name);
961 continue;
962 }
963
964 /* check "must" */
Radek Krejci8df109d2021-04-23 12:19:08 +0200965 ret = lyxp_atomize(ctx->ctx, musts[u].cond, node->module, LY_VALUE_SCHEMA_RESOLVED, musts[u].prefixes, node,
Michal Vasko400e9672021-01-11 13:39:17 +0100966 &tmp_set, opts);
Michal Vasko25d6ad02020-10-22 12:20:22 +0200967 if (ret) {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100968 LOGVAL(ctx->ctx, LYVE_SEMANTICS, "Invalid must restriction \"%s\".", musts[u].cond->expr);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200969 goto cleanup;
970 }
971
972 ctx->path[0] = '\0';
Michal Vasko14ed9cd2021-01-28 14:16:25 +0100973 lysc_path(node, LYSC_PATH_LOG, ctx->path, LYSC_CTX_BUFSIZE);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200974 for (i = 0; i < tmp_set.used; ++i) {
975 /* skip roots'n'stuff */
976 if (tmp_set.val.scnodes[i].type == LYXP_NODE_ELEM) {
977 /* XPath expression cannot reference "lower" status than the node that has the definition */
Michal Vaskoc130e162021-10-19 11:30:00 +0200978 if (local_mods[u]->mod == node->module) {
979 /* use flags of the context node since the definition is local */
980 flg = node->flags;
981 } else {
982 /* definition is foreign (deviation, refine), always current */
983 flg = LYS_STATUS_CURR;
984 }
985 ret = lysc_check_status(ctx, flg, local_mods[u]->mod, node->name, tmp_set.val.scnodes[i].scnode->flags,
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200986 tmp_set.val.scnodes[i].scnode->module, tmp_set.val.scnodes[i].scnode->name);
987 LY_CHECK_GOTO(ret, cleanup);
988 }
989 }
990
991 lyxp_set_free_content(&tmp_set);
992 }
993
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200994cleanup:
995 lyxp_set_free_content(&tmp_set);
Radek Krejciddace2c2021-01-08 11:30:56 +0100996 LOG_LOCBACK(1, 0, 0, 0);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200997 return ret;
998}
999
1000/**
Michal Vaskof4fa90d2021-11-11 15:05:19 +01001001 * @brief Remove all disabled bits/enums from a sized array.
1002 *
1003 * @param[in] ctx Context with the dictionary.
1004 * @param[in] items Sized array of bits/enums.
1005 */
1006static void
1007lys_compile_unres_disabled_bitenum_remove(struct ly_ctx *ctx, struct lysc_type_bitenum_item *items)
1008{
1009 LY_ARRAY_COUNT_TYPE u = 0, last_u;
1010
1011 while (u < LY_ARRAY_COUNT(items)) {
1012 if (items[u].flags & LYS_DISABLED) {
1013 /* free the disabled item */
1014 lysc_enum_item_free(ctx, &items[u]);
1015
1016 /* replace it with the following items */
1017 last_u = LY_ARRAY_COUNT(items) - 1;
1018 if (u < last_u) {
1019 memmove(items + u, items + u + 1, (last_u - u) * sizeof *items);
1020 }
1021
1022 /* one item less */
1023 LY_ARRAY_DECREMENT(items);
1024 continue;
1025 }
1026
1027 ++u;
1028 }
1029}
1030
1031/**
1032 * @brief Find and remove all disabled bits/enums in a leaf/leaf-list type.
1033 *
1034 * @param[in] ctx Compile context.
1035 * @param[in] leaf Leaf/leaf-list to check.
1036 * @return LY_ERR value
1037 */
1038static LY_ERR
1039lys_compile_unres_disabled_bitenum(struct lysc_ctx *ctx, struct lysc_node_leaf *leaf)
1040{
1041 struct lysc_type **t;
1042 LY_ARRAY_COUNT_TYPE u, count;
1043 struct lysc_type_enum *ent;
1044
1045 if (leaf->type->basetype == LY_TYPE_UNION) {
1046 t = ((struct lysc_type_union *)leaf->type)->types;
1047 count = LY_ARRAY_COUNT(t);
1048 } else {
1049 t = &leaf->type;
1050 count = 1;
1051 }
1052 for (u = 0; u < count; ++u) {
1053 if ((t[u]->basetype == LY_TYPE_BITS) || (t[u]->basetype == LY_TYPE_ENUM)) {
1054 /* remove all disabled items */
1055 ent = (struct lysc_type_enum *)(t[u]);
1056 lys_compile_unres_disabled_bitenum_remove(ctx->ctx, ent->enums);
1057
1058 if (!LY_ARRAY_COUNT(ent->enums)) {
1059 LOGVAL(ctx->ctx, LYVE_SEMANTICS, "%s type of node \"%s\" without any (or all disabled) valid values.",
1060 (ent->basetype == LY_TYPE_BITS) ? "Bits" : "Enumeration", leaf->name);
1061 return LY_EVALID;
1062 }
1063 }
1064 }
1065
1066 return LY_SUCCESS;
1067}
1068
1069/**
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001070 * @brief Check leafref for its target existence on a complete compiled schema tree.
1071 *
1072 * @param[in] ctx Compile context.
1073 * @param[in] node Context node for the leafref.
1074 * @param[in] lref Leafref to check/resolve.
Michal Vaskoc130e162021-10-19 11:30:00 +02001075 * @param[in] local_mod Local module for the leafref type.
Michal Vasko405cc9e2020-12-01 12:01:27 +01001076 * @param[in,out] unres Global unres structure.
Michal Vasko40c158c2021-04-28 17:01:03 +02001077 * @return LY_ERECOMPILE if context recompilation is needed,
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001078 * @return LY_ERR value.
1079 */
1080static LY_ERR
Michal Vasko405cc9e2020-12-01 12:01:27 +01001081lys_compile_unres_leafref(struct lysc_ctx *ctx, const struct lysc_node *node, struct lysc_type_leafref *lref,
Michal Vaskoc130e162021-10-19 11:30:00 +02001082 const struct lysp_module *local_mod, struct lys_glob_unres *unres)
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001083{
Michal Vaskod1e53b92021-01-28 13:11:06 +01001084 const struct lysc_node *target = NULL;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001085 struct ly_path *p;
1086 struct lysc_type *type;
Michal Vaskoc130e162021-10-19 11:30:00 +02001087 uint16_t flg;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001088
1089 assert(node->nodetype & (LYS_LEAF | LYS_LEAFLIST));
1090
Michal Vasko24fc4d12021-07-12 14:41:20 +02001091 /* first implement all the modules in the path */
1092 LY_CHECK_RET(lys_compile_expr_implement(ctx->ctx, lref->path, LY_VALUE_SCHEMA_RESOLVED, lref->prefixes, 1, unres, NULL));
1093
Michal Vaskoed725d72021-06-23 12:03:45 +02001094 /* try to find the target, current module is that of the context node (RFC 7950 6.4.1 second bullet) */
1095 LY_CHECK_RET(ly_path_compile_leafref(ctx->ctx, node, NULL, lref->path,
Michal Vaskod1e53b92021-01-28 13:11:06 +01001096 (node->flags & LYS_IS_OUTPUT) ? LY_PATH_OPER_OUTPUT : LY_PATH_OPER_INPUT, LY_PATH_TARGET_MANY,
Michal Vasko24fc4d12021-07-12 14:41:20 +02001097 LY_VALUE_SCHEMA_RESOLVED, lref->prefixes, &p));
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001098
1099 /* get the target node */
1100 target = p[LY_ARRAY_COUNT(p) - 1].node;
1101 ly_path_free(node->module->ctx, p);
1102
1103 if (!(target->nodetype & (LYS_LEAF | LYS_LEAFLIST))) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001104 LOGVAL(ctx->ctx, LYVE_REFERENCE, "Invalid leafref path \"%s\" - target node is %s instead of leaf or leaf-list.",
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001105 lref->path->expr, lys_nodetype2str(target->nodetype));
1106 return LY_EVALID;
1107 }
1108
1109 /* check status */
1110 ctx->path[0] = '\0';
1111 lysc_path(node, LYSC_PATH_LOG, ctx->path, LYSC_CTX_BUFSIZE);
1112 ctx->path_len = strlen(ctx->path);
Michal Vaskoc130e162021-10-19 11:30:00 +02001113 if (node->module == local_mod->mod) {
1114 /* use flags of the context node since the definition is local */
1115 flg = node->flags;
1116 } else {
1117 /* definition is foreign (deviation), always current */
1118 flg = LYS_STATUS_CURR;
1119 }
1120 if (lysc_check_status(ctx, flg, local_mod->mod, node->name, target->flags, target->module, target->name)) {
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001121 return LY_EVALID;
1122 }
1123 ctx->path_len = 1;
1124 ctx->path[1] = '\0';
1125
1126 /* check config */
1127 if (lref->require_instance) {
Michal Vaskod1e53b92021-01-28 13:11:06 +01001128 if ((node->flags & LYS_CONFIG_W) && (target->flags & LYS_CONFIG_R)) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001129 LOGVAL(ctx->ctx, LYVE_REFERENCE, "Invalid leafref path \"%s\" - target is supposed"
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001130 " to represent configuration data (as the leafref does), but it does not.", lref->path->expr);
1131 return LY_EVALID;
1132 }
1133 }
1134
1135 /* store the target's type and check for circular chain of leafrefs */
1136 lref->realtype = ((struct lysc_node_leaf *)target)->type;
1137 for (type = lref->realtype; type && type->basetype == LY_TYPE_LEAFREF; type = ((struct lysc_type_leafref *)type)->realtype) {
1138 if (type == (struct lysc_type *)lref) {
1139 /* circular chain detected */
Radek Krejci2efc45b2020-12-22 16:25:44 +01001140 LOGVAL(ctx->ctx, LYVE_REFERENCE, "Invalid leafref path \"%s\" - circular chain of leafrefs detected.",
1141 lref->path->expr);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001142 return LY_EVALID;
1143 }
1144 }
1145
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001146 return LY_SUCCESS;
1147}
1148
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001149/**
1150 * @brief Compile default value(s) for leaf or leaf-list expecting a complete compiled schema tree.
1151 *
1152 * @param[in] ctx Compile context.
1153 * @param[in] node Leaf or leaf-list to compile the default value(s) for.
1154 * @param[in] type Type of the default value.
1155 * @param[in] dflt Default value.
1156 * @param[in] dflt_pmod Parsed module of the @p dflt to resolve possible prefixes.
1157 * @param[in,out] storage Storage for the compiled default value.
Michal Vasko405cc9e2020-12-01 12:01:27 +01001158 * @param[in,out] unres Global unres structure for newly implemented modules.
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001159 * @return LY_ERR value.
1160 */
1161static LY_ERR
1162lys_compile_unres_dflt(struct lysc_ctx *ctx, struct lysc_node *node, struct lysc_type *type, const char *dflt,
Michal Vasko405cc9e2020-12-01 12:01:27 +01001163 const struct lysp_module *dflt_pmod, struct lyd_value *storage, struct lys_glob_unres *unres)
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001164{
1165 LY_ERR ret;
Michal Vasko25d6ad02020-10-22 12:20:22 +02001166 uint32_t options;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001167 struct ly_err_item *err = NULL;
1168
Radek Krejci0b013302021-03-29 15:22:32 +02001169 options = (ctx->ctx->flags & LY_CTX_REF_IMPLEMENTED) ? LYPLG_TYPE_STORE_IMPLEMENT : 0;
Radek Krejci8df109d2021-04-23 12:19:08 +02001170 ret = type->plugin->store(ctx->ctx, type, dflt, strlen(dflt), options, LY_VALUE_SCHEMA, (void *)dflt_pmod,
Michal Vasko405cc9e2020-12-01 12:01:27 +01001171 LYD_HINT_SCHEMA, node, storage, unres, &err);
Michal Vasko1ccbf542021-04-19 11:35:00 +02001172 if (ret == LY_ERECOMPILE) {
1173 /* fine, but we need to recompile */
1174 return LY_ERECOMPILE;
1175 } else if (ret == LY_EINCOMPLETE) {
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001176 /* we have no data so we will not be resolving it */
1177 ret = LY_SUCCESS;
1178 }
1179
1180 if (ret) {
Radek Krejciddace2c2021-01-08 11:30:56 +01001181 LOG_LOCSET(node, NULL, NULL, NULL);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001182 if (err) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001183 LOGVAL(ctx->ctx, LYVE_SEMANTICS, "Invalid default - value does not fit the type (%s).", err->msg);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001184 ly_err_free(err);
1185 } else {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001186 LOGVAL(ctx->ctx, LYVE_SEMANTICS, "Invalid default - value does not fit the type.");
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001187 }
Radek Krejciddace2c2021-01-08 11:30:56 +01001188 LOG_LOCBACK(1, 0, 0, 0);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001189 return ret;
1190 }
1191
Michal Vasko04338d92021-09-01 07:58:14 +02001192 LY_ATOMIC_INC_BARRIER(((struct lysc_type *)storage->realtype)->refcount);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001193 return LY_SUCCESS;
1194}
1195
1196/**
1197 * @brief Compile default value of a leaf expecting a complete compiled schema tree.
1198 *
1199 * @param[in] ctx Compile context.
1200 * @param[in] leaf Leaf that the default value is for.
1201 * @param[in] dflt Default value to compile.
Michal Vasko405cc9e2020-12-01 12:01:27 +01001202 * @param[in,out] unres Global unres structure for newly implemented modules.
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001203 * @return LY_ERR value.
1204 */
1205static LY_ERR
Michal Vasko405cc9e2020-12-01 12:01:27 +01001206lys_compile_unres_leaf_dlft(struct lysc_ctx *ctx, struct lysc_node_leaf *leaf, struct lysp_qname *dflt,
1207 struct lys_glob_unres *unres)
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001208{
1209 LY_ERR ret;
1210
1211 assert(!leaf->dflt);
1212
1213 if (leaf->flags & (LYS_MAND_TRUE | LYS_KEY)) {
1214 /* ignore default values for keys and mandatory leaves */
1215 return LY_SUCCESS;
1216 }
1217
1218 /* allocate the default value */
1219 leaf->dflt = calloc(1, sizeof *leaf->dflt);
1220 LY_CHECK_ERR_RET(!leaf->dflt, LOGMEM(ctx->ctx), LY_EMEM);
1221
1222 /* store the default value */
Michal Vasko14ed9cd2021-01-28 14:16:25 +01001223 ret = lys_compile_unres_dflt(ctx, &leaf->node, leaf->type, dflt->str, dflt->mod, leaf->dflt, unres);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001224 if (ret) {
1225 free(leaf->dflt);
1226 leaf->dflt = NULL;
1227 }
1228
1229 return ret;
1230}
1231
1232/**
1233 * @brief Compile default values of a leaf-list expecting a complete compiled schema tree.
1234 *
1235 * @param[in] ctx Compile context.
1236 * @param[in] llist Leaf-list that the default value(s) are for.
1237 * @param[in] dflt Default value to compile, in case of a single value.
1238 * @param[in] dflts Sized array of default values, in case of more values.
Michal Vasko405cc9e2020-12-01 12:01:27 +01001239 * @param[in,out] unres Global unres structure for newly implemented modules.
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001240 * @return LY_ERR value.
1241 */
1242static LY_ERR
1243lys_compile_unres_llist_dflts(struct lysc_ctx *ctx, struct lysc_node_leaflist *llist, struct lysp_qname *dflt,
Michal Vasko405cc9e2020-12-01 12:01:27 +01001244 struct lysp_qname *dflts, struct lys_glob_unres *unres)
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001245{
1246 LY_ERR ret;
1247 LY_ARRAY_COUNT_TYPE orig_count, u, v;
1248
1249 assert(dflt || dflts);
1250
Radek Krejcic7d13e32020-12-09 12:32:24 +01001251 /* in case there were already some defaults and we are adding new by deviations */
1252 orig_count = LY_ARRAY_COUNT(llist->dflts);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001253
1254 /* allocate new items */
Radek Krejcic7d13e32020-12-09 12:32:24 +01001255 LY_ARRAY_CREATE_RET(ctx->ctx, llist->dflts, orig_count + (dflts ? LY_ARRAY_COUNT(dflts) : 1), LY_EMEM);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001256
1257 /* fill each new default value */
1258 if (dflts) {
1259 LY_ARRAY_FOR(dflts, u) {
1260 llist->dflts[orig_count + u] = calloc(1, sizeof **llist->dflts);
Michal Vasko14ed9cd2021-01-28 14:16:25 +01001261 ret = lys_compile_unres_dflt(ctx, &llist->node, llist->type, dflts[u].str, dflts[u].mod,
Michal Vasko405cc9e2020-12-01 12:01:27 +01001262 llist->dflts[orig_count + u], unres);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001263 LY_CHECK_ERR_RET(ret, free(llist->dflts[orig_count + u]), ret);
1264 LY_ARRAY_INCREMENT(llist->dflts);
1265 }
1266 } else {
1267 llist->dflts[orig_count] = calloc(1, sizeof **llist->dflts);
Michal Vasko14ed9cd2021-01-28 14:16:25 +01001268 ret = lys_compile_unres_dflt(ctx, &llist->node, llist->type, dflt->str, dflt->mod,
Michal Vasko405cc9e2020-12-01 12:01:27 +01001269 llist->dflts[orig_count], unres);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001270 LY_CHECK_ERR_RET(ret, free(llist->dflts[orig_count]), ret);
1271 LY_ARRAY_INCREMENT(llist->dflts);
1272 }
1273
1274 /* check default value uniqueness */
1275 if (llist->flags & LYS_CONFIG_W) {
1276 /* configuration data values must be unique - so check the default values */
1277 for (u = orig_count; u < LY_ARRAY_COUNT(llist->dflts); ++u) {
1278 for (v = 0; v < u; ++v) {
1279 if (!llist->dflts[u]->realtype->plugin->compare(llist->dflts[u], llist->dflts[v])) {
Radek Krejcia6016992021-03-03 10:13:41 +01001280 lysc_update_path(ctx, llist->parent ? llist->parent->module : NULL, llist->name);
Radek Krejci2efc45b2020-12-22 16:25:44 +01001281 LOGVAL(ctx->ctx, LYVE_SEMANTICS, "Configuration leaf-list has multiple defaults of the same value \"%s\".",
Radek Krejci6d5ba0c2021-04-26 07:49:59 +02001282 llist->dflts[u]->realtype->plugin->print(ctx->ctx, llist->dflts[u], LY_VALUE_CANON, NULL, NULL, NULL));
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001283 lysc_update_path(ctx, NULL, NULL);
1284 return LY_EVALID;
1285 }
1286 }
1287 }
1288 }
1289
1290 return LY_SUCCESS;
1291}
1292
Michal Vaskof4258e12021-06-15 12:11:42 +02001293/**
aPiecek732cd142021-07-07 16:29:59 +02001294 * @brief Iteratively get all leafrefs from @p node
1295 * if the node is of type union, otherwise just return the leafref.
1296 *
1297 * @param[in] node Node that may contain the leafref.
1298 * @param[in,out] index Value that is passed between function calls.
1299 * For each new node, initialize value of the @p index to 0, otherwise
1300 * do not modify the value between calls.
1301 * @return Pointer to the leafref or next leafref, otherwise NULL.
1302 */
1303static struct lysc_type_leafref *
1304lys_type_leafref_next(const struct lysc_node *node, uint64_t *index)
1305{
1306 struct lysc_type_leafref *ret = NULL;
1307 struct lysc_type_union *uni;
1308 struct lysc_type *leaf_type;
1309
1310 assert(node->nodetype & LYD_NODE_TERM);
1311
1312 leaf_type = ((struct lysc_node_leaf *)node)->type;
1313 if (leaf_type->basetype == LY_TYPE_UNION) {
1314 uni = (struct lysc_type_union *)leaf_type;
1315
1316 /* find next union leafref */
1317 while (*index < LY_ARRAY_COUNT(uni->types)) {
1318 if (uni->types[*index]->basetype == LY_TYPE_LEAFREF) {
1319 ret = (struct lysc_type_leafref *)uni->types[*index];
1320 ++(*index);
1321 break;
1322 }
1323
1324 ++(*index);
1325 }
1326 } else {
1327 /* return just the single leafref */
1328 if (*index == 0) {
1329 ++(*index);
1330 assert(leaf_type->basetype == LY_TYPE_LEAFREF);
1331 ret = (struct lysc_type_leafref *)leaf_type;
1332 }
1333 }
1334
1335 return ret;
1336}
1337
1338/**
Michal Vaskof4258e12021-06-15 12:11:42 +02001339 * @brief Finish dependency set compilation by resolving all the unres sets.
1340 *
1341 * @param[in] ctx libyang context.
1342 * @param[in] unres Global unres structure with the sets to resolve.
1343 * @return LY_SUCCESS on success.
1344 * @return LY_ERECOMPILE if the dep set needs to be recompiled.
1345 * @return LY_ERR value on error.
1346 */
1347static LY_ERR
1348lys_compile_unres_depset(struct ly_ctx *ctx, struct lys_glob_unres *unres)
Michal Vasko405cc9e2020-12-01 12:01:27 +01001349{
aPiecek732cd142021-07-07 16:29:59 +02001350 LY_ERR ret = LY_SUCCESS;
Michal Vasko405cc9e2020-12-01 12:01:27 +01001351 struct lysc_node *node;
aPiecek732cd142021-07-07 16:29:59 +02001352 struct lysc_type *typeiter;
Michal Vasko405cc9e2020-12-01 12:01:27 +01001353 struct lysc_type_leafref *lref;
aPiecekd7bd52d2021-07-08 08:59:59 +02001354 struct lysc_ctx cctx;
Michal Vaskof4258e12021-06-15 12:11:42 +02001355 struct lys_depset_unres *ds_unres;
aPiecekd7bd52d2021-07-08 08:59:59 +02001356 struct ly_path *path;
Michal Vasko405cc9e2020-12-01 12:01:27 +01001357 LY_ARRAY_COUNT_TYPE v;
Michal Vaskoa91d87e2021-10-19 11:58:57 +02001358 struct lysc_unres_leafref *l;
aPiecekd7bd52d2021-07-08 08:59:59 +02001359 uint32_t i, processed_leafrefs = 0;
Michal Vasko405cc9e2020-12-01 12:01:27 +01001360
Michal Vaskof4258e12021-06-15 12:11:42 +02001361 ds_unres = &unres->ds_unres;
1362
Michal Vasko405cc9e2020-12-01 12:01:27 +01001363 /* fake compile context */
aPiecekd7bd52d2021-07-08 08:59:59 +02001364resolve_all:
1365 memset(&cctx, 0, sizeof cctx);
Michal Vasko405cc9e2020-12-01 12:01:27 +01001366 cctx.ctx = ctx;
1367 cctx.path_len = 1;
1368 cctx.path[0] = '/';
1369
1370 /* for leafref, we need 2 rounds - first detects circular chain by storing the first referred type (which
1371 * can be also leafref, in case it is already resolved, go through the chain and check that it does not
aPiecekc6526b42021-07-12 15:21:39 +02001372 * point to the starting leafref type). The second round stores the first non-leafref type for later data validation.
1373 * Also do the same check for set of the disabled leafrefs, but without the second round. */
1374 while (ds_unres->disabled_leafrefs.count) {
Michal Vaskoa91d87e2021-10-19 11:58:57 +02001375 /* remember index, it can change before we get to free this item */
1376 i = ds_unres->disabled_leafrefs.count - 1;
1377 l = ds_unres->disabled_leafrefs.objs[i];
Michal Vaskoc130e162021-10-19 11:30:00 +02001378 cctx.cur_mod = l->node->module;
1379 cctx.pmod = l->node->module->parsed;
aPiecekc6526b42021-07-12 15:21:39 +02001380
Michal Vaskoa91d87e2021-10-19 11:58:57 +02001381 LOG_LOCSET(l->node, NULL, NULL, NULL);
aPiecekc6526b42021-07-12 15:21:39 +02001382 v = 0;
Michal Vaskoc130e162021-10-19 11:30:00 +02001383 while ((ret == LY_SUCCESS) && (lref = lys_type_leafref_next(l->node, &v))) {
1384 ret = lys_compile_unres_leafref(&cctx, l->node, lref, l->local_mod, unres);
aPiecekc6526b42021-07-12 15:21:39 +02001385 }
aPiecekc6526b42021-07-12 15:21:39 +02001386 LOG_LOCBACK(1, 0, 0, 0);
1387 LY_CHECK_RET(ret);
Michal Vaskoa91d87e2021-10-19 11:58:57 +02001388
1389 ly_set_rm_index(&ds_unres->disabled_leafrefs, i, free);
aPiecekc6526b42021-07-12 15:21:39 +02001390 }
Michal Vaskoa23e1d92021-07-13 12:04:16 +02001391
aPiecekd7bd52d2021-07-08 08:59:59 +02001392 for (i = processed_leafrefs; i < ds_unres->leafrefs.count; ++i) {
Michal Vaskoa91d87e2021-10-19 11:58:57 +02001393 l = ds_unres->leafrefs.objs[i];
Michal Vaskoc130e162021-10-19 11:30:00 +02001394 cctx.cur_mod = l->node->module;
1395 cctx.pmod = l->node->module->parsed;
1396 LOG_LOCSET(l->node, NULL, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +01001397
aPiecek732cd142021-07-07 16:29:59 +02001398 v = 0;
Michal Vaskoc130e162021-10-19 11:30:00 +02001399 while ((ret == LY_SUCCESS) && (lref = lys_type_leafref_next(l->node, &v))) {
1400 ret = lys_compile_unres_leafref(&cctx, l->node, lref, l->local_mod, unres);
Michal Vasko405cc9e2020-12-01 12:01:27 +01001401 }
Radek Krejci2efc45b2020-12-22 16:25:44 +01001402
Radek Krejciddace2c2021-01-08 11:30:56 +01001403 LOG_LOCBACK(1, 0, 0, 0);
Michal Vasko7213ac52021-06-15 11:52:13 +02001404 LY_CHECK_RET(ret);
Michal Vasko405cc9e2020-12-01 12:01:27 +01001405 }
aPiecekd7bd52d2021-07-08 08:59:59 +02001406 for (i = processed_leafrefs; i < ds_unres->leafrefs.count; ++i) {
Michal Vaskoa91d87e2021-10-19 11:58:57 +02001407 l = ds_unres->leafrefs.objs[i];
Radek Krejci2efc45b2020-12-22 16:25:44 +01001408
Michal Vasko405cc9e2020-12-01 12:01:27 +01001409 /* store pointer to the real type */
aPiecek732cd142021-07-07 16:29:59 +02001410 v = 0;
Michal Vaskoc130e162021-10-19 11:30:00 +02001411 while ((lref = lys_type_leafref_next(l->node, &v))) {
aPiecek732cd142021-07-07 16:29:59 +02001412 for (typeiter = lref->realtype;
Michal Vasko405cc9e2020-12-01 12:01:27 +01001413 typeiter->basetype == LY_TYPE_LEAFREF;
1414 typeiter = ((struct lysc_type_leafref *)typeiter)->realtype) {}
aPiecek732cd142021-07-07 16:29:59 +02001415 lref->realtype = typeiter;
Michal Vasko405cc9e2020-12-01 12:01:27 +01001416 }
1417
Michal Vaskoa23e1d92021-07-13 12:04:16 +02001418 /* If 'goto' will be used on the 'resolve_all' label, then
aPiecekd7bd52d2021-07-08 08:59:59 +02001419 * the current leafref will not be processed again.
1420 */
1421 processed_leafrefs++;
Michal Vasko405cc9e2020-12-01 12:01:27 +01001422 }
1423
Michal Vaskoc130e162021-10-19 11:30:00 +02001424 /* check when */
1425 while (ds_unres->whens.count) {
Michal Vaskoa91d87e2021-10-19 11:58:57 +02001426 i = ds_unres->whens.count - 1;
1427 node = ds_unres->whens.objs[i];
Michal Vasko405cc9e2020-12-01 12:01:27 +01001428 cctx.cur_mod = node->module;
1429 cctx.pmod = node->module->parsed;
1430
Radek Krejciddace2c2021-01-08 11:30:56 +01001431 LOG_LOCSET(node, NULL, NULL, NULL);
Michal Vaskoc130e162021-10-19 11:30:00 +02001432 ret = lys_compile_unres_when(&cctx, node, unres);
Radek Krejciddace2c2021-01-08 11:30:56 +01001433 LOG_LOCBACK(1, 0, 0, 0);
Michal Vasko7213ac52021-06-15 11:52:13 +02001434 LY_CHECK_RET(ret);
Michal Vasko405cc9e2020-12-01 12:01:27 +01001435
Michal Vaskoa91d87e2021-10-19 11:58:57 +02001436 ly_set_rm_index(&ds_unres->whens, i, NULL);
Michal Vaskoc130e162021-10-19 11:30:00 +02001437 }
1438
1439 /* check must */
1440 while (ds_unres->musts.count) {
Michal Vaskoa91d87e2021-10-19 11:58:57 +02001441 i = ds_unres->musts.count - 1;
1442 struct lysc_unres_must *m = ds_unres->musts.objs[i];
Michal Vaskoc130e162021-10-19 11:30:00 +02001443 cctx.cur_mod = m->node->module;
1444 cctx.pmod = m->node->module->parsed;
1445
1446 LOG_LOCSET(m->node, NULL, NULL, NULL);
1447 ret = lys_compile_unres_must(&cctx, m->node, m->local_mods, unres);
1448 LOG_LOCBACK(1, 0, 0, 0);
1449 LY_CHECK_RET(ret);
1450
1451 lysc_unres_must_free(m);
Michal Vaskoa91d87e2021-10-19 11:58:57 +02001452 ly_set_rm_index(&ds_unres->musts, i, NULL);
Michal Vasko405cc9e2020-12-01 12:01:27 +01001453 }
1454
Michal Vaskof4fa90d2021-11-11 15:05:19 +01001455 /* remove disabled enums/bits */
Michal Vaskocc2d75e2021-11-22 15:58:26 +01001456 while (ds_unres->disabled_bitenums.count) {
1457 i = ds_unres->disabled_bitenums.count - 1;
Michal Vaskof4fa90d2021-11-11 15:05:19 +01001458 node = ds_unres->disabled_bitenums.objs[i];
1459 cctx.cur_mod = node->module;
1460 cctx.pmod = node->module->parsed;
1461
1462 LOG_LOCSET(node, NULL, NULL, NULL);
1463 ret = lys_compile_unres_disabled_bitenum(&cctx, (struct lysc_node_leaf *)node);
1464 LOG_LOCBACK(1, 0, 0, 0);
1465 LY_CHECK_RET(ret);
1466
1467 ly_set_rm_index(&ds_unres->disabled_bitenums, i, NULL);
1468 }
1469
Michal Vasko405cc9e2020-12-01 12:01:27 +01001470 /* finish incomplete default values compilation */
Michal Vaskof4258e12021-06-15 12:11:42 +02001471 while (ds_unres->dflts.count) {
Michal Vaskoa91d87e2021-10-19 11:58:57 +02001472 i = ds_unres->dflts.count - 1;
1473 struct lysc_unres_dflt *r = ds_unres->dflts.objs[i];
Michal Vasko405cc9e2020-12-01 12:01:27 +01001474 cctx.cur_mod = r->leaf->module;
1475 cctx.pmod = r->leaf->module->parsed;
1476
Michal Vasko14ed9cd2021-01-28 14:16:25 +01001477 LOG_LOCSET(&r->leaf->node, NULL, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +01001478 if (r->leaf->nodetype == LYS_LEAF) {
1479 ret = lys_compile_unres_leaf_dlft(&cctx, r->leaf, r->dflt, unres);
1480 } else {
1481 ret = lys_compile_unres_llist_dflts(&cctx, r->llist, r->dflt, r->dflts, unres);
1482 }
Radek Krejciddace2c2021-01-08 11:30:56 +01001483 LOG_LOCBACK(1, 0, 0, 0);
Michal Vasko7213ac52021-06-15 11:52:13 +02001484 LY_CHECK_RET(ret);
Radek Krejci2efc45b2020-12-22 16:25:44 +01001485
1486 lysc_unres_dflt_free(ctx, r);
Michal Vaskoa91d87e2021-10-19 11:58:57 +02001487 ly_set_rm_index(&ds_unres->dflts, i, NULL);
Michal Vasko405cc9e2020-12-01 12:01:27 +01001488 }
1489
Michal Vasko40c158c2021-04-28 17:01:03 +02001490 /* some unres items may have been added */
aPiecekc6526b42021-07-12 15:21:39 +02001491 if ((processed_leafrefs != ds_unres->leafrefs.count) || ds_unres->disabled_leafrefs.count ||
Michal Vaskoc130e162021-10-19 11:30:00 +02001492 ds_unres->whens.count || ds_unres->musts.count || ds_unres->dflts.count) {
aPiecekd7bd52d2021-07-08 08:59:59 +02001493 goto resolve_all;
Michal Vasko405cc9e2020-12-01 12:01:27 +01001494 }
1495
Michal Vasko30ab8e72021-04-19 12:47:52 +02001496 /* finally, remove all disabled nodes */
Michal Vaskof4258e12021-06-15 12:11:42 +02001497 for (i = 0; i < ds_unres->disabled.count; ++i) {
1498 node = ds_unres->disabled.snodes[i];
Michal Vasko30ab8e72021-04-19 12:47:52 +02001499 if (node->flags & LYS_KEY) {
1500 LOG_LOCSET(node, NULL, NULL, NULL);
Michal Vaskoe02e7402021-07-23 08:29:28 +02001501 LOGVAL(ctx, LYVE_REFERENCE, "Key \"%s\" is disabled.", node->name);
Michal Vasko30ab8e72021-04-19 12:47:52 +02001502 LOG_LOCBACK(1, 0, 0, 0);
1503 return LY_EVALID;
1504 }
1505
1506 lysc_node_free(ctx, node, 1);
1507 }
1508
aPiecekd7bd52d2021-07-08 08:59:59 +02001509 /* also check if the leafref target has not been disabled */
1510 for (i = 0; i < ds_unres->leafrefs.count; ++i) {
Michal Vaskoa91d87e2021-10-19 11:58:57 +02001511 l = ds_unres->leafrefs.objs[i];
Michal Vaskoc130e162021-10-19 11:30:00 +02001512 cctx.cur_mod = l->node->module;
1513 cctx.pmod = l->node->module->parsed;
aPiecekd7bd52d2021-07-08 08:59:59 +02001514
1515 v = 0;
Michal Vaskoc130e162021-10-19 11:30:00 +02001516 while ((lref = lys_type_leafref_next(l->node, &v))) {
1517 ret = ly_path_compile_leafref(cctx.ctx, l->node, NULL, lref->path,
1518 (l->node->flags & LYS_IS_OUTPUT) ? LY_PATH_OPER_OUTPUT : LY_PATH_OPER_INPUT, LY_PATH_TARGET_MANY,
aPiecekd7bd52d2021-07-08 08:59:59 +02001519 LY_VALUE_SCHEMA_RESOLVED, lref->prefixes, &path);
Michal Vaskoc130e162021-10-19 11:30:00 +02001520 ly_path_free(l->node->module->ctx, path);
aPiecekd7bd52d2021-07-08 08:59:59 +02001521
1522 assert(ret != LY_ERECOMPILE);
1523 if (ret) {
Michal Vaskoc130e162021-10-19 11:30:00 +02001524 LOG_LOCSET(l->node, NULL, NULL, NULL);
Michal Vaskoe02e7402021-07-23 08:29:28 +02001525 LOGVAL(ctx, LYVE_REFERENCE, "Target of leafref \"%s\" cannot be referenced because it is disabled.",
Michal Vaskoc130e162021-10-19 11:30:00 +02001526 l->node->name);
aPiecekd7bd52d2021-07-08 08:59:59 +02001527 LOG_LOCBACK(1, 0, 0, 0);
1528 return LY_EVALID;
1529 }
1530 }
1531 }
1532
Michal Vasko405cc9e2020-12-01 12:01:27 +01001533 return LY_SUCCESS;
1534}
1535
Michal Vaskof4258e12021-06-15 12:11:42 +02001536/**
1537 * @brief Erase dep set unres.
1538 *
1539 * @param[in] ctx libyang context.
1540 * @param[in] unres Global unres structure with the sets to resolve.
1541 */
1542static void
1543lys_compile_unres_depset_erase(const struct ly_ctx *ctx, struct lys_glob_unres *unres)
Michal Vasko405cc9e2020-12-01 12:01:27 +01001544{
1545 uint32_t i;
1546
Michal Vaskoc130e162021-10-19 11:30:00 +02001547 ly_set_erase(&unres->ds_unres.whens, NULL);
1548 for (i = 0; i < unres->ds_unres.musts.count; ++i) {
1549 lysc_unres_must_free(unres->ds_unres.musts.objs[i]);
1550 }
1551 ly_set_erase(&unres->ds_unres.musts, NULL);
1552 ly_set_erase(&unres->ds_unres.leafrefs, free);
Michal Vaskof4258e12021-06-15 12:11:42 +02001553 for (i = 0; i < unres->ds_unres.dflts.count; ++i) {
1554 lysc_unres_dflt_free(ctx, unres->ds_unres.dflts.objs[i]);
Michal Vaskodf6319c2021-06-10 14:41:05 +02001555 }
Michal Vaskof4258e12021-06-15 12:11:42 +02001556 ly_set_erase(&unres->ds_unres.dflts, NULL);
Michal Vaskof4258e12021-06-15 12:11:42 +02001557 ly_set_erase(&unres->ds_unres.disabled, NULL);
Michal Vaskof4fa90d2021-11-11 15:05:19 +01001558 ly_set_erase(&unres->ds_unres.disabled_leafrefs, free);
1559 ly_set_erase(&unres->ds_unres.disabled_bitenums, NULL);
Michal Vaskof4258e12021-06-15 12:11:42 +02001560}
1561
Michal Vasko709f9a52021-07-21 10:51:59 +02001562/**
1563 * @brief Compile all flagged modules in a dependency set, recursively if recompilation is needed.
1564 *
1565 * @param[in] ctx libyang context.
1566 * @param[in] dep_set Dependency set to compile.
1567 * @param[in,out] unres Global unres to use.
1568 * @return LY_ERR value.
1569 */
1570static LY_ERR
1571lys_compile_depset_r(struct ly_ctx *ctx, struct ly_set *dep_set, struct lys_glob_unres *unres)
Michal Vaskof4258e12021-06-15 12:11:42 +02001572{
1573 LY_ERR ret = LY_SUCCESS;
1574 struct lys_module *mod;
1575 uint32_t i;
1576
1577 for (i = 0; i < dep_set->count; ++i) {
1578 mod = dep_set->objs[i];
1579 if (!mod->to_compile) {
1580 /* skip */
1581 continue;
1582 }
1583 assert(mod->implemented);
1584
1585 /* free the compiled module, if any */
1586 lysc_module_free(mod->compiled);
1587 mod->compiled = NULL;
1588
1589 /* (re)compile the module */
1590 LY_CHECK_GOTO(ret = lys_compile(mod, &unres->ds_unres), cleanup);
Michal Vasko405cc9e2020-12-01 12:01:27 +01001591 }
Michal Vaskof4258e12021-06-15 12:11:42 +02001592
1593 /* resolve dep set unres */
1594 ret = lys_compile_unres_depset(ctx, unres);
1595 if (ret == LY_ERECOMPILE) {
1596 /* new module is implemented, discard current dep set unres and recompile the whole dep set */
1597 lys_compile_unres_depset_erase(ctx, unres);
Michal Vasko709f9a52021-07-21 10:51:59 +02001598 return lys_compile_depset_r(ctx, dep_set, unres);
Michal Vaskof4258e12021-06-15 12:11:42 +02001599 } else if (ret) {
1600 /* error */
1601 goto cleanup;
1602 }
1603
1604 /* success, unset the flags of all the modules in the dep set */
1605 for (i = 0; i < dep_set->count; ++i) {
1606 mod = dep_set->objs[i];
1607 mod->to_compile = 0;
1608 }
1609
1610cleanup:
1611 lys_compile_unres_depset_erase(ctx, unres);
1612 return ret;
Michal Vasko405cc9e2020-12-01 12:01:27 +01001613}
1614
Michal Vasko45092a92022-02-08 15:07:44 +01001615/**
1616 * @brief Check if-feature of all features of all modules in a dep set.
1617 *
1618 * @param[in] dep_set Dep set to check.
1619 * @return LY_ERR value.
1620 */
1621static LY_ERR
1622lys_compile_depset_check_features(struct ly_set *dep_set)
1623{
1624 struct lys_module *mod;
1625 uint32_t i;
1626
1627 for (i = 0; i < dep_set->count; ++i) {
1628 mod = dep_set->objs[i];
1629 if (!mod->to_compile) {
1630 /* skip */
1631 continue;
1632 }
1633
1634 /* check features of this module */
1635 LY_CHECK_RET(lys_check_features(mod->parsed));
1636 }
1637
1638 return LY_SUCCESS;
1639}
1640
Michal Vasko709f9a52021-07-21 10:51:59 +02001641LY_ERR
1642lys_compile_depset_all(struct ly_ctx *ctx, struct lys_glob_unres *unres)
1643{
1644 uint32_t i;
1645
1646 for (i = 0; i < unres->dep_sets.count; ++i) {
Michal Vasko45092a92022-02-08 15:07:44 +01001647 LY_CHECK_RET(lys_compile_depset_check_features(unres->dep_sets.objs[i]));
Michal Vasko709f9a52021-07-21 10:51:59 +02001648 LY_CHECK_RET(lys_compile_depset_r(ctx, unres->dep_sets.objs[i], unres));
1649 }
1650
1651 return LY_SUCCESS;
1652}
1653
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001654/**
Michal Vasko405cc9e2020-12-01 12:01:27 +01001655 * @brief Finish compilation of all the module unres sets in a compile context.
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001656 *
1657 * @param[in] ctx Compile context with unres sets.
1658 * @return LY_ERR value.
1659 */
1660static LY_ERR
Michal Vasko405cc9e2020-12-01 12:01:27 +01001661lys_compile_unres_mod(struct lysc_ctx *ctx)
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001662{
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001663 struct lysc_augment *aug;
1664 struct lysc_deviation *dev;
Michal Vasko1ade6f12021-04-19 11:32:45 +02001665 struct lys_module *orig_mod = ctx->cur_mod;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001666 uint32_t i;
1667
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001668 /* check that all augments were applied */
1669 for (i = 0; i < ctx->augs.count; ++i) {
1670 aug = ctx->augs.objs[i];
Michal Vasko1ade6f12021-04-19 11:32:45 +02001671 ctx->cur_mod = aug->aug_pmod->mod;
Radek Krejci2efc45b2020-12-22 16:25:44 +01001672 lysc_update_path(ctx, NULL, "{augment}");
1673 lysc_update_path(ctx, NULL, aug->nodeid->expr);
1674 LOGVAL(ctx->ctx, LYVE_REFERENCE, "Augment target node \"%s\" from module \"%s\" was not found.",
Michal Vasko28fe5f62021-03-03 16:37:39 +01001675 aug->nodeid->expr, LYSP_MODULE_NAME(aug->aug_pmod));
Michal Vasko1ade6f12021-04-19 11:32:45 +02001676 ctx->cur_mod = orig_mod;
Radek Krejci2efc45b2020-12-22 16:25:44 +01001677 lysc_update_path(ctx, NULL, NULL);
1678 lysc_update_path(ctx, NULL, NULL);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001679 }
1680 if (ctx->augs.count) {
1681 return LY_ENOTFOUND;
1682 }
1683
1684 /* check that all deviations were applied */
1685 for (i = 0; i < ctx->devs.count; ++i) {
1686 dev = ctx->devs.objs[i];
Radek Krejci2efc45b2020-12-22 16:25:44 +01001687 lysc_update_path(ctx, NULL, "{deviation}");
1688 lysc_update_path(ctx, NULL, dev->nodeid->expr);
1689 LOGVAL(ctx->ctx, LYVE_REFERENCE, "Deviation(s) target node \"%s\" from module \"%s\" was not found.",
1690 dev->nodeid->expr, LYSP_MODULE_NAME(dev->dev_pmods[0]));
1691 lysc_update_path(ctx, NULL, NULL);
1692 lysc_update_path(ctx, NULL, NULL);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001693 }
1694 if (ctx->devs.count) {
1695 return LY_ENOTFOUND;
1696 }
1697
1698 return LY_SUCCESS;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001699}
1700
1701/**
Michal Vasko405cc9e2020-12-01 12:01:27 +01001702 * @brief Erase all the module unres sets in a compile context.
1703 *
1704 * @param[in] ctx Compile context with unres sets.
1705 * @param[in] error Whether the compilation finished with an error or not.
1706 */
1707static void
1708lys_compile_unres_mod_erase(struct lysc_ctx *ctx, ly_bool error)
1709{
1710 uint32_t i;
1711
1712 ly_set_erase(&ctx->groupings, NULL);
1713 ly_set_erase(&ctx->tpdf_chain, NULL);
Michal Vasko405cc9e2020-12-01 12:01:27 +01001714
1715 if (!error) {
1716 /* there can be no leftover deviations or augments */
1717 LY_CHECK_ERR_RET(ctx->augs.count, LOGINT(ctx->ctx), );
1718 LY_CHECK_ERR_RET(ctx->devs.count, LOGINT(ctx->ctx), );
1719
1720 ly_set_erase(&ctx->augs, NULL);
1721 ly_set_erase(&ctx->devs, NULL);
1722 ly_set_erase(&ctx->uses_augs, NULL);
1723 ly_set_erase(&ctx->uses_rfns, NULL);
1724 } else {
1725 for (i = 0; i < ctx->augs.count; ++i) {
1726 lysc_augment_free(ctx->ctx, ctx->augs.objs[i]);
1727 }
1728 ly_set_erase(&ctx->augs, NULL);
1729 for (i = 0; i < ctx->devs.count; ++i) {
1730 lysc_deviation_free(ctx->ctx, ctx->devs.objs[i]);
1731 }
1732 ly_set_erase(&ctx->devs, NULL);
1733 for (i = 0; i < ctx->uses_augs.count; ++i) {
1734 lysc_augment_free(ctx->ctx, ctx->uses_augs.objs[i]);
1735 }
1736 ly_set_erase(&ctx->uses_augs, NULL);
1737 for (i = 0; i < ctx->uses_rfns.count; ++i) {
1738 lysc_refine_free(ctx->ctx, ctx->uses_rfns.objs[i]);
1739 }
1740 ly_set_erase(&ctx->uses_rfns, NULL);
1741 }
1742}
1743
Michal Vaskod39bea42021-06-14 10:42:49 +02001744LY_ERR
Michal Vaskof4258e12021-06-15 12:11:42 +02001745lys_compile(struct lys_module *mod, struct lys_depset_unres *unres)
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001746{
1747 struct lysc_ctx ctx = {0};
Michal Vasko0b395e12021-04-23 13:43:07 +02001748 struct lysc_module *mod_c = NULL;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001749 struct lysp_module *sp;
1750 struct lysp_submodule *submod;
1751 struct lysp_node *pnode;
Radek Krejci2a9fc652021-01-22 17:44:34 +01001752 struct lysp_node_grp *grp;
1753 LY_ARRAY_COUNT_TYPE u;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001754 LY_ERR ret = LY_SUCCESS;
1755
1756 LY_CHECK_ARG_RET(NULL, mod, mod->parsed, !mod->compiled, mod->ctx, LY_EINVAL);
1757
Michal Vaskof4258e12021-06-15 12:11:42 +02001758 assert(mod->implemented && mod->to_compile);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001759
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001760 sp = mod->parsed;
1761
1762 ctx.ctx = mod->ctx;
1763 ctx.cur_mod = mod;
1764 ctx.pmod = sp;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001765 ctx.path_len = 1;
1766 ctx.path[0] = '/';
Michal Vasko405cc9e2020-12-01 12:01:27 +01001767 ctx.unres = unres;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001768
Michal Vasko0b395e12021-04-23 13:43:07 +02001769 ++mod->ctx->change_count;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001770 mod->compiled = mod_c = calloc(1, sizeof *mod_c);
1771 LY_CHECK_ERR_RET(!mod_c, LOGMEM(mod->ctx), LY_EMEM);
1772 mod_c->mod = mod;
1773
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001774 /* compile augments and deviations of our module from other modules so they can be applied during compilation */
Michal Vasko1ccbf542021-04-19 11:35:00 +02001775 LY_CHECK_GOTO(ret = lys_precompile_own_augments(&ctx), cleanup);
1776 LY_CHECK_GOTO(ret = lys_precompile_own_deviations(&ctx), cleanup);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001777
1778 /* data nodes */
1779 LY_LIST_FOR(sp->data, pnode) {
Michal Vasko1ccbf542021-04-19 11:35:00 +02001780 LY_CHECK_GOTO(ret = lys_compile_node(&ctx, pnode, NULL, 0, NULL), cleanup);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001781 }
1782
Radek Krejci2a9fc652021-01-22 17:44:34 +01001783 /* top-level RPCs */
1784 LY_LIST_FOR((struct lysp_node *)sp->rpcs, pnode) {
Michal Vasko1ccbf542021-04-19 11:35:00 +02001785 LY_CHECK_GOTO(ret = lys_compile_node(&ctx, pnode, NULL, 0, NULL), cleanup);
Radek Krejci2a9fc652021-01-22 17:44:34 +01001786 }
1787
1788 /* top-level notifications */
1789 LY_LIST_FOR((struct lysp_node *)sp->notifs, pnode) {
Michal Vasko1ccbf542021-04-19 11:35:00 +02001790 LY_CHECK_GOTO(ret = lys_compile_node(&ctx, pnode, NULL, 0, NULL), cleanup);
Radek Krejci2a9fc652021-01-22 17:44:34 +01001791 }
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001792
1793 /* extension instances */
Michal Vasko1ccbf542021-04-19 11:35:00 +02001794 COMPILE_EXTS_GOTO(&ctx, sp->exts, mod_c->exts, mod_c, ret, cleanup);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001795
1796 /* the same for submodules */
1797 LY_ARRAY_FOR(sp->includes, u) {
1798 submod = sp->includes[u].submodule;
1799 ctx.pmod = (struct lysp_module *)submod;
1800
1801 LY_LIST_FOR(submod->data, pnode) {
1802 ret = lys_compile_node(&ctx, pnode, NULL, 0, NULL);
Michal Vasko1ccbf542021-04-19 11:35:00 +02001803 LY_CHECK_GOTO(ret, cleanup);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001804 }
1805
Radek Krejci2a9fc652021-01-22 17:44:34 +01001806 LY_LIST_FOR((struct lysp_node *)submod->rpcs, pnode) {
1807 ret = lys_compile_node(&ctx, pnode, NULL, 0, NULL);
Michal Vasko1ccbf542021-04-19 11:35:00 +02001808 LY_CHECK_GOTO(ret, cleanup);
Radek Krejci2a9fc652021-01-22 17:44:34 +01001809 }
1810
1811 LY_LIST_FOR((struct lysp_node *)submod->notifs, pnode) {
1812 ret = lys_compile_node(&ctx, pnode, NULL, 0, NULL);
Michal Vasko1ccbf542021-04-19 11:35:00 +02001813 LY_CHECK_GOTO(ret, cleanup);
Radek Krejci2a9fc652021-01-22 17:44:34 +01001814 }
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001815
Michal Vasko1ccbf542021-04-19 11:35:00 +02001816 COMPILE_EXTS_GOTO(&ctx, submod->exts, mod_c->exts, mod_c, ret, cleanup);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001817 }
Michal Vasko12606ee2020-11-25 17:05:11 +01001818 ctx.pmod = sp;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001819
1820 /* validate non-instantiated groupings from the parsed schema,
1821 * without it we would accept even the schemas with invalid grouping specification */
Michal Vasko7c565922021-06-10 14:58:27 +02001822 ctx.compile_opts |= LYS_COMPILE_GROUPING;
Radek Krejci2a9fc652021-01-22 17:44:34 +01001823 LY_LIST_FOR(sp->groupings, grp) {
1824 if (!(grp->flags & LYS_USED_GRP)) {
Michal Vasko1ccbf542021-04-19 11:35:00 +02001825 LY_CHECK_GOTO(ret = lys_compile_grouping(&ctx, NULL, grp), cleanup);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001826 }
1827 }
1828 LY_LIST_FOR(sp->data, pnode) {
Radek Krejci2a9fc652021-01-22 17:44:34 +01001829 LY_LIST_FOR((struct lysp_node_grp *)lysp_node_groupings(pnode), grp) {
1830 if (!(grp->flags & LYS_USED_GRP)) {
Michal Vasko1ccbf542021-04-19 11:35:00 +02001831 LY_CHECK_GOTO(ret = lys_compile_grouping(&ctx, pnode, grp), cleanup);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001832 }
1833 }
1834 }
1835 LY_ARRAY_FOR(sp->includes, u) {
1836 submod = sp->includes[u].submodule;
1837 ctx.pmod = (struct lysp_module *)submod;
1838
Radek Krejci2a9fc652021-01-22 17:44:34 +01001839 LY_LIST_FOR(submod->groupings, grp) {
1840 if (!(grp->flags & LYS_USED_GRP)) {
Michal Vasko1ccbf542021-04-19 11:35:00 +02001841 LY_CHECK_GOTO(ret = lys_compile_grouping(&ctx, NULL, grp), cleanup);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001842 }
1843 }
1844 LY_LIST_FOR(submod->data, pnode) {
Radek Krejci2a9fc652021-01-22 17:44:34 +01001845 LY_LIST_FOR((struct lysp_node_grp *)lysp_node_groupings(pnode), grp) {
1846 if (!(grp->flags & LYS_USED_GRP)) {
Michal Vasko1ccbf542021-04-19 11:35:00 +02001847 LY_CHECK_GOTO(ret = lys_compile_grouping(&ctx, pnode, grp), cleanup);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001848 }
1849 }
1850 }
1851 }
1852 ctx.pmod = sp;
1853
Radek Krejciddace2c2021-01-08 11:30:56 +01001854 LOG_LOCBACK(0, 0, 1, 0);
Radek Krejci2efc45b2020-12-22 16:25:44 +01001855
Michal Vasko405cc9e2020-12-01 12:01:27 +01001856 /* finish compilation for all unresolved module items in the context */
Michal Vasko1ccbf542021-04-19 11:35:00 +02001857 LY_CHECK_GOTO(ret = lys_compile_unres_mod(&ctx), cleanup);
Michal Vasko12606ee2020-11-25 17:05:11 +01001858
Michal Vasko1ccbf542021-04-19 11:35:00 +02001859cleanup:
Radek Krejciddace2c2021-01-08 11:30:56 +01001860 LOG_LOCBACK(0, 0, 1, 0);
Michal Vasko1ccbf542021-04-19 11:35:00 +02001861 lys_compile_unres_mod_erase(&ctx, ret);
1862 if (ret) {
Michal Vasko1ccbf542021-04-19 11:35:00 +02001863 lysc_module_free(mod_c);
1864 mod->compiled = NULL;
1865 }
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001866 return ret;
1867}
Michal Vasko65333882021-06-10 14:12:16 +02001868
aPiecek6b3d5422021-07-30 15:55:43 +02001869LY_ERR
Michal Vaskofa5a7d72021-06-15 11:41:20 +02001870lys_compile_identities(struct lys_module *mod)
1871{
1872 struct lysc_ctx ctx = {0};
1873 struct lysp_submodule *submod;
1874 LY_ARRAY_COUNT_TYPE u;
1875
aPiecek6b3d5422021-07-30 15:55:43 +02001876 /* pre-compile identities of the module and any submodules */
1877 LY_CHECK_RET(lys_identity_precompile(NULL, mod->ctx, mod->parsed, mod->parsed->identities, &mod->identities));
1878 LY_ARRAY_FOR(mod->parsed->includes, u) {
1879 submod = mod->parsed->includes[u].submodule;
1880 LY_CHECK_RET(lys_identity_precompile(NULL, mod->ctx, (struct lysp_module *)submod, submod->identities, &mod->identities));
1881 }
1882
Michal Vaskofa5a7d72021-06-15 11:41:20 +02001883 /* prepare context */
1884 ctx.ctx = mod->ctx;
1885 ctx.cur_mod = mod;
1886 ctx.pmod = mod->parsed;
1887 ctx.path_len = 1;
1888 ctx.path[0] = '/';
1889
1890 if (mod->parsed->identities) {
1891 LY_CHECK_RET(lys_compile_identities_derived(&ctx, mod->parsed->identities, &mod->identities));
1892 }
1893 lysc_update_path(&ctx, NULL, "{submodule}");
1894 LY_ARRAY_FOR(mod->parsed->includes, u) {
1895 submod = mod->parsed->includes[u].submodule;
1896 if (submod->identities) {
1897 ctx.pmod = (struct lysp_module *)submod;
1898 lysc_update_path(&ctx, NULL, submod->name);
1899 LY_CHECK_RET(lys_compile_identities_derived(&ctx, submod->identities, &mod->identities));
1900 lysc_update_path(&ctx, NULL, NULL);
1901 }
1902 }
1903 lysc_update_path(&ctx, NULL, NULL);
1904
1905 return LY_SUCCESS;
1906}
1907
1908/**
Michal Vasko65333882021-06-10 14:12:16 +02001909 * @brief Check whether a module does not have any (recursive) compiled import.
1910 *
1911 * @param[in] mod Module to examine.
1912 * @return LY_SUCCESS on success.
Michal Vaskof4258e12021-06-15 12:11:42 +02001913 * @return LY_ERECOMPILE on required recompilation of the dep set.
Michal Vasko65333882021-06-10 14:12:16 +02001914 * @return LY_ERR on error.
1915 */
1916static LY_ERR
1917lys_has_compiled_import_r(struct lys_module *mod)
1918{
1919 LY_ARRAY_COUNT_TYPE u;
Michal Vaskoe7927122021-06-15 12:00:04 +02001920 struct lys_module *m;
Michal Vasko65333882021-06-10 14:12:16 +02001921
1922 LY_ARRAY_FOR(mod->parsed->imports, u) {
Michal Vaskoe7927122021-06-15 12:00:04 +02001923 m = mod->parsed->imports[u].module;
1924 if (!m->implemented) {
Michal Vasko65333882021-06-10 14:12:16 +02001925 continue;
1926 }
1927
Michal Vaskoe7927122021-06-15 12:00:04 +02001928 if (!m->to_compile) {
Michal Vaskod39bea42021-06-14 10:42:49 +02001929 /* module was not/will not be compiled in this compilation (so disabled nodes are not present) */
Michal Vaskof4258e12021-06-15 12:11:42 +02001930 m->to_compile = 1;
Michal Vasko65333882021-06-10 14:12:16 +02001931 return LY_ERECOMPILE;
1932 }
1933
1934 /* recursive */
Michal Vaskoe7927122021-06-15 12:00:04 +02001935 LY_CHECK_RET(lys_has_compiled_import_r(m));
Michal Vasko65333882021-06-10 14:12:16 +02001936 }
1937
1938 return LY_SUCCESS;
1939}
1940
1941LY_ERR
1942lys_implement(struct lys_module *mod, const char **features, struct lys_glob_unres *unres)
1943{
1944 LY_ERR ret;
1945 struct lys_module *m;
1946
1947 assert(!mod->implemented);
1948
Michal Vaskofda52ac2022-01-21 14:13:40 +01001949 /* check collision with other implemented revision */
Michal Vasko65333882021-06-10 14:12:16 +02001950 m = ly_ctx_get_module_implemented(mod->ctx, mod->name);
1951 if (m) {
1952 assert(m != mod);
Michal Vaskofda52ac2022-01-21 14:13:40 +01001953 if (!strcmp(mod->name, "yang") && (strcmp(m->revision, mod->revision) > 0)) {
1954 /* special case for newer internal module, continue */
1955 LOGVRB("Internal module \"%s@%s\" is already implemented in revision \"%s\", using it instead.",
1956 mod->name, mod->revision ? mod->revision : "<none>", m->revision ? m->revision : "<none>");
1957 } else {
1958 LOGERR(mod->ctx, LY_EDENIED, "Module \"%s@%s\" is already implemented in revision \"%s\".",
1959 mod->name, mod->revision ? mod->revision : "<none>", m->revision ? m->revision : "<none>");
1960 return LY_EDENIED;
1961 }
Michal Vasko65333882021-06-10 14:12:16 +02001962 }
1963
1964 /* set features */
1965 ret = lys_set_features(mod->parsed, features);
1966 if (ret && (ret != LY_EEXIST)) {
1967 return ret;
1968 }
1969
Michal Vasko65333882021-06-10 14:12:16 +02001970 /*
1971 * mark the module implemented, which means
1972 * 1) to (re)compile it only ::lys_compile() call is needed
1973 * 2) its compilation will never cause new modules to be implemented (::lys_compile() does not return ::LY_ERECOMPILE)
1974 * but there can be some unres items added that do
1975 */
1976 mod->implemented = 1;
1977
Michal Vaskoa9f807e2021-06-15 12:07:16 +02001978 /* this module is compiled in this compilation */
1979 mod->to_compile = 1;
1980
Michal Vasko65333882021-06-10 14:12:16 +02001981 /* add the module into newly implemented module set */
1982 LY_CHECK_RET(ly_set_add(&unres->implementing, mod, 1, NULL));
1983
Michal Vaskoa9f807e2021-06-15 12:07:16 +02001984 /* mark target modules with our augments and deviations */
1985 LY_CHECK_RET(lys_precompile_augments_deviations(mod, unres));
Michal Vasko65333882021-06-10 14:12:16 +02001986
Michal Vaskod39bea42021-06-14 10:42:49 +02001987 /* check whether this module may reference any modules compiled previously */
1988 LY_CHECK_RET(lys_has_compiled_import_r(mod));
Michal Vasko65333882021-06-10 14:12:16 +02001989
Michal Vasko65333882021-06-10 14:12:16 +02001990 return LY_SUCCESS;
1991}