blob: faa487dad325f55e1043df0c7f081887c3b87c9a [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
154 LY_ARRAY_FOR(ext->substmts, u) {
Radek Krejci61837f72021-03-02 19:53:59 +0100155 if (LY_STMT_IS_DATA_NODE(substmt)) {
156 if (!LY_STMT_IS_DATA_NODE(ext->substmts[u].stmt)) {
Radek Krejci1b2eef82021-02-17 11:17:27 +0100157 continue;
158 }
159 } else if (LY_STMT_IS_OP(substmt)) {
160 if (!LY_STMT_IS_OP(ext->substmts[u].stmt)) {
161 continue;
162 }
163 } else if (ext->substmts[u].stmt != substmt) {
164 continue;
165 }
166
167 /* match */
168 if (cardinality_p) {
169 *cardinality_p = ext->substmts[u].cardinality;
170 }
171 if (instance_p) {
172 *instance_p = ext->substmts[u].storage;
173 }
174 return LY_SUCCESS;
175 }
176
177 return LY_ENOT;
178}
179
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200180static void
Michal Vaskoc130e162021-10-19 11:30:00 +0200181lysc_unres_must_free(struct lysc_unres_must *m)
182{
183 LY_ARRAY_FREE(m->local_mods);
184 free(m);
185}
186
187static void
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200188lysc_unres_dflt_free(const struct ly_ctx *ctx, struct lysc_unres_dflt *r)
189{
190 assert(!r->dflt || !r->dflts);
191 if (r->dflt) {
192 lysp_qname_free((struct ly_ctx *)ctx, r->dflt);
193 free(r->dflt);
194 } else {
195 FREE_ARRAY((struct ly_ctx *)ctx, r->dflts, lysp_qname_free);
196 }
197 free(r);
198}
199
200void
Radek Krejcia6016992021-03-03 10:13:41 +0100201lysc_update_path(struct lysc_ctx *ctx, struct lys_module *parent_module, const char *name)
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200202{
203 int len;
204 uint8_t nextlevel = 0; /* 0 - no starttag, 1 - '/' starttag, 2 - '=' starttag + '}' endtag */
205
206 if (!name) {
207 /* removing last path segment */
208 if (ctx->path[ctx->path_len - 1] == '}') {
209 for ( ; ctx->path[ctx->path_len] != '=' && ctx->path[ctx->path_len] != '{'; --ctx->path_len) {}
210 if (ctx->path[ctx->path_len] == '=') {
211 ctx->path[ctx->path_len++] = '}';
212 } else {
213 /* not a top-level special tag, remove also preceiding '/' */
214 goto remove_nodelevel;
215 }
216 } else {
217remove_nodelevel:
218 for ( ; ctx->path[ctx->path_len] != '/'; --ctx->path_len) {}
219 if (ctx->path_len == 0) {
220 /* top-level (last segment) */
221 ctx->path_len = 1;
222 }
223 }
224 /* set new terminating NULL-byte */
225 ctx->path[ctx->path_len] = '\0';
226 } else {
227 if (ctx->path_len > 1) {
Radek Krejcia6016992021-03-03 10:13:41 +0100228 if (!parent_module && (ctx->path[ctx->path_len - 1] == '}') && (ctx->path[ctx->path_len - 2] != '\'')) {
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200229 /* extension of the special tag */
230 nextlevel = 2;
231 --ctx->path_len;
232 } else {
233 /* there is already some path, so add next level */
234 nextlevel = 1;
235 }
236 } /* else the path is just initiated with '/', so do not add additional slash in case of top-level nodes */
237
238 if (nextlevel != 2) {
Radek Krejcia6016992021-03-03 10:13:41 +0100239 if ((parent_module && (parent_module == ctx->cur_mod)) || (!parent_module && (ctx->path_len > 1) && (name[0] == '{'))) {
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200240 /* module not changed, print the name unprefixed */
241 len = snprintf(&ctx->path[ctx->path_len], LYSC_CTX_BUFSIZE - ctx->path_len, "%s%s", nextlevel ? "/" : "", name);
242 } else {
243 len = snprintf(&ctx->path[ctx->path_len], LYSC_CTX_BUFSIZE - ctx->path_len, "%s%s:%s", nextlevel ? "/" : "", ctx->cur_mod->name, name);
244 }
245 } else {
246 len = snprintf(&ctx->path[ctx->path_len], LYSC_CTX_BUFSIZE - ctx->path_len, "='%s'}", name);
247 }
248 if (len >= LYSC_CTX_BUFSIZE - (int)ctx->path_len) {
249 /* output truncated */
250 ctx->path_len = LYSC_CTX_BUFSIZE - 1;
251 } else {
252 ctx->path_len += len;
253 }
254 }
Radek Krejci2efc45b2020-12-22 16:25:44 +0100255
Radek Krejciddace2c2021-01-08 11:30:56 +0100256 LOG_LOCBACK(0, 0, 1, 0);
257 LOG_LOCSET(NULL, NULL, ctx->path, NULL);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200258}
259
aPiecek6b3d5422021-07-30 15:55:43 +0200260/**
261 * @brief Compile information from the identity statement
262 *
263 * The backlinks to the identities derived from this one are supposed to be filled later via ::lys_compile_identity_bases().
264 *
265 * @param[in] ctx_sc Compile context - alternative to the combination of @p ctx and @p parsed_mod.
266 * @param[in] ctx libyang context.
267 * @param[in] parsed_mod Module with the identities.
268 * @param[in] identities_p Array of the parsed identity definitions to precompile.
269 * @param[in,out] identities Pointer to the storage of the (pre)compiled identities array where the new identities are
270 * supposed to be added. The storage is supposed to be initiated to NULL when the first parsed identities are going
271 * to be processed.
272 * @return LY_ERR value.
273 */
274static LY_ERR
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200275lys_identity_precompile(struct lysc_ctx *ctx_sc, struct ly_ctx *ctx, struct lysp_module *parsed_mod,
276 struct lysp_ident *identities_p, struct lysc_ident **identities)
277{
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100278 LY_ARRAY_COUNT_TYPE u;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200279 struct lysc_ctx context = {0};
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100280 struct lysc_ident *ident;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200281 LY_ERR ret = LY_SUCCESS;
282
283 assert(ctx_sc || ctx);
284
285 if (!ctx_sc) {
286 context.ctx = ctx;
Radek Krejci3aac9a72020-12-01 12:24:26 +0100287 context.cur_mod = parsed_mod ? parsed_mod->mod : NULL;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200288 context.pmod = parsed_mod;
289 context.path_len = 1;
290 context.path[0] = '/';
291 ctx_sc = &context;
292 }
293
294 if (!identities_p) {
295 return LY_SUCCESS;
296 }
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200297
298 lysc_update_path(ctx_sc, NULL, "{identity}");
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200299 LY_ARRAY_FOR(identities_p, u) {
300 lysc_update_path(ctx_sc, NULL, identities_p[u].name);
301
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100302 /* add new compiled identity */
303 LY_ARRAY_NEW_RET(ctx_sc->ctx, *identities, ident, LY_EMEM);
304
305 DUP_STRING_GOTO(ctx_sc->ctx, identities_p[u].name, ident->name, ret, done);
306 DUP_STRING_GOTO(ctx_sc->ctx, identities_p[u].dsc, ident->dsc, ret, done);
307 DUP_STRING_GOTO(ctx_sc->ctx, identities_p[u].ref, ident->ref, ret, done);
308 ident->module = ctx_sc->cur_mod;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200309 /* 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 +0100310 COMPILE_EXTS_GOTO(ctx_sc, identities_p[u].exts, ident->exts, ident, ret, done);
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100311 ident->flags = identities_p[u].flags;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200312
313 lysc_update_path(ctx_sc, NULL, NULL);
314 }
315 lysc_update_path(ctx_sc, NULL, NULL);
316done:
317 return ret;
318}
319
320/**
321 * @brief Check circular dependency of identities - identity MUST NOT reference itself (via their base statement).
322 *
323 * The function works in the same way as lys_compile_feature_circular_check() with different structures and error messages.
324 *
325 * @param[in] ctx Compile context for logging.
326 * @param[in] ident The base identity (its derived list is being extended by the identity being currently processed).
327 * @param[in] derived The list of derived identities of the identity being currently processed (not the one provided as @p ident)
328 * @return LY_SUCCESS if everything is ok.
329 * @return LY_EVALID if the identity is derived from itself.
330 */
331static LY_ERR
332lys_compile_identity_circular_check(struct lysc_ctx *ctx, struct lysc_ident *ident, struct lysc_ident **derived)
333{
334 LY_ERR ret = LY_SUCCESS;
335 LY_ARRAY_COUNT_TYPE u, v;
336 struct ly_set recursion = {0};
337 struct lysc_ident *drv;
338
339 if (!derived) {
340 return LY_SUCCESS;
341 }
342
343 for (u = 0; u < LY_ARRAY_COUNT(derived); ++u) {
344 if (ident == derived[u]) {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100345 LOGVAL(ctx->ctx, LYVE_REFERENCE,
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200346 "Identity \"%s\" is indirectly derived from itself.", ident->name);
347 ret = LY_EVALID;
348 goto cleanup;
349 }
350 ret = ly_set_add(&recursion, derived[u], 0, NULL);
351 LY_CHECK_GOTO(ret, cleanup);
352 }
353
354 for (v = 0; v < recursion.count; ++v) {
355 drv = recursion.objs[v];
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200356 for (u = 0; u < LY_ARRAY_COUNT(drv->derived); ++u) {
357 if (ident == drv->derived[u]) {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100358 LOGVAL(ctx->ctx, LYVE_REFERENCE,
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200359 "Identity \"%s\" is indirectly derived from itself.", ident->name);
360 ret = LY_EVALID;
361 goto cleanup;
362 }
363 ret = ly_set_add(&recursion, drv->derived[u], 0, NULL);
364 LY_CHECK_GOTO(ret, cleanup);
365 }
366 }
367
368cleanup:
369 ly_set_erase(&recursion, NULL);
370 return ret;
371}
372
373LY_ERR
374lys_compile_identity_bases(struct lysc_ctx *ctx, const struct lysp_module *base_pmod, const char **bases_p,
aPiecekf4a0a192021-08-03 15:14:17 +0200375 struct lysc_ident *ident, struct lysc_ident ***bases)
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200376{
377 LY_ARRAY_COUNT_TYPE u, v;
378 const char *s, *name;
379 const struct lys_module *mod;
380 struct lysc_ident **idref;
381
aPiecekf4a0a192021-08-03 15:14:17 +0200382 assert(ident || bases);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200383
384 if ((LY_ARRAY_COUNT(bases_p) > 1) && (ctx->pmod->version < LYS_VERSION_1_1)) {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100385 LOGVAL(ctx->ctx, LYVE_SYNTAX_YANG,
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200386 "Multiple bases in %s are allowed only in YANG 1.1 modules.", ident ? "identity" : "identityref type");
387 return LY_EVALID;
388 }
389
390 LY_ARRAY_FOR(bases_p, u) {
391 s = strchr(bases_p[u], ':');
392 if (s) {
393 /* prefixed identity */
394 name = &s[1];
Radek Krejci8df109d2021-04-23 12:19:08 +0200395 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 +0200396 } else {
397 name = bases_p[u];
398 mod = base_pmod->mod;
399 }
400 if (!mod) {
401 if (ident) {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100402 LOGVAL(ctx->ctx, LYVE_SYNTAX_YANG,
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200403 "Invalid prefix used for base (%s) of identity \"%s\".", bases_p[u], ident->name);
404 } else {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100405 LOGVAL(ctx->ctx, LYVE_SYNTAX_YANG,
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200406 "Invalid prefix used for base (%s) of identityref.", bases_p[u]);
407 }
408 return LY_EVALID;
409 }
410
411 idref = NULL;
412 LY_ARRAY_FOR(mod->identities, v) {
413 if (!strcmp(name, mod->identities[v].name)) {
414 if (ident) {
415 if (ident == &mod->identities[v]) {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100416 LOGVAL(ctx->ctx, LYVE_REFERENCE,
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200417 "Identity \"%s\" is derived from itself.", ident->name);
418 return LY_EVALID;
419 }
420 LY_CHECK_RET(lys_compile_identity_circular_check(ctx, &mod->identities[v], ident->derived));
421 /* we have match! store the backlink */
422 LY_ARRAY_NEW_RET(ctx->ctx, mod->identities[v].derived, idref, LY_EMEM);
423 *idref = ident;
424 } else {
425 /* we have match! store the found identity */
426 LY_ARRAY_NEW_RET(ctx->ctx, *bases, idref, LY_EMEM);
427 *idref = &mod->identities[v];
428 }
429 break;
430 }
431 }
aPiecekf4a0a192021-08-03 15:14:17 +0200432 if (!idref) {
Radek Krejci10443f42021-03-28 17:40:35 +0200433 if (ident) {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100434 LOGVAL(ctx->ctx, LYVE_SYNTAX_YANG,
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200435 "Unable to find base (%s) of identity \"%s\".", bases_p[u], ident->name);
436 } else {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100437 LOGVAL(ctx->ctx, LYVE_SYNTAX_YANG,
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200438 "Unable to find base (%s) of identityref.", bases_p[u]);
439 }
440 return LY_EVALID;
441 }
442 }
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100443
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200444 return LY_SUCCESS;
445}
446
447/**
448 * @brief For the given array of identities, set the backlinks from all their base identities.
449 * @param[in] ctx Compile context, not only for logging but also to get the current module to resolve prefixes.
450 * @param[in] idents_p Array of identities definitions from the parsed schema structure.
aPiecekf4a0a192021-08-03 15:14:17 +0200451 * @param[in,out] idents Array of referencing identities to which the backlinks are supposed to be set.
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200452 * @return LY_ERR value - LY_SUCCESS or LY_EVALID.
453 */
454static LY_ERR
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100455lys_compile_identities_derived(struct lysc_ctx *ctx, struct lysp_ident *idents_p, struct lysc_ident **idents)
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200456{
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100457 LY_ARRAY_COUNT_TYPE u, v;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200458
459 lysc_update_path(ctx, NULL, "{identity}");
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100460
aPiecekf3e2db82021-08-05 10:18:43 +0200461 for (u = 0; u < LY_ARRAY_COUNT(*idents); ++u) {
aPiecekf4a0a192021-08-03 15:14:17 +0200462 /* find matching parsed identity */
aPiecekf3e2db82021-08-05 10:18:43 +0200463 for (v = 0; v < LY_ARRAY_COUNT(idents_p); ++v) {
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100464 if (idents_p[v].name == (*idents)[u].name) {
465 break;
466 }
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100467 }
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100468
Michal Vaskodc6f84c2021-06-15 14:50:27 +0200469 if ((v == LY_ARRAY_COUNT(idents_p)) || !idents_p[v].bases) {
470 /* identity not found (it may be from a submodule) or identity without bases */
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200471 continue;
472 }
Michal Vaskodc6f84c2021-06-15 14:50:27 +0200473
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100474 lysc_update_path(ctx, NULL, (*idents)[u].name);
aPiecekf4a0a192021-08-03 15:14:17 +0200475 LY_CHECK_RET(lys_compile_identity_bases(ctx, ctx->pmod, idents_p[v].bases, &(*idents)[u], NULL));
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200476 lysc_update_path(ctx, NULL, NULL);
477 }
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100478
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200479 lysc_update_path(ctx, NULL, NULL);
480 return LY_SUCCESS;
481}
482
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200483static void *
484lys_compile_extension_instance_storage(enum ly_stmt stmt, struct lysc_ext_substmt *substmts)
485{
486 for (LY_ARRAY_COUNT_TYPE u = 0; substmts[u].stmt; ++u) {
487 if (substmts[u].stmt == stmt) {
488 return substmts[u].storage;
489 }
490 }
491 return NULL;
492}
493
494LY_ERR
Radek Krejci6b88a462021-02-17 12:39:34 +0100495lys_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 +0200496{
aPiecek1c4da362021-04-29 14:26:34 +0200497 LY_ERR ret = LY_SUCCESS, r;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200498 LY_ARRAY_COUNT_TYPE u;
499 struct lysp_stmt *stmt;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200500 void *parsed = NULL, **compiled = NULL;
501
502 /* check for invalid substatements */
Radek Krejci6b88a462021-02-17 12:39:34 +0100503 for (stmt = ext_p->child; stmt; stmt = stmt->next) {
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200504 if (stmt->flags & (LYS_YIN_ATTR | LYS_YIN_ARGUMENT)) {
505 continue;
506 }
Radek Krejci6b88a462021-02-17 12:39:34 +0100507 LY_ARRAY_FOR(ext->substmts, u) {
508 if (ext->substmts[u].stmt == stmt->kw) {
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200509 break;
510 }
511 }
Radek Krejci6b88a462021-02-17 12:39:34 +0100512 if (u == LY_ARRAY_COUNT(ext->substmts)) {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100513 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 +0100514 stmt->stmt, ext_p->name, ext_p->argument ? " " : "", ext_p->argument ? ext_p->argument : "");
aPiecek1c4da362021-04-29 14:26:34 +0200515 ret = LY_EVALID;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200516 goto cleanup;
517 }
518 }
519
520 /* TODO store inherited data, e.g. status first, but mark them somehow to allow to overwrite them and not detect duplicity */
521
Radek Krejci6b88a462021-02-17 12:39:34 +0100522 /* note into the compile context that we are processing extension now */
523 ctx->ext = ext;
524
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200525 /* keep order of the processing the same as the order in the defined substmts,
526 * 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 +0200527
Radek Krejci6b88a462021-02-17 12:39:34 +0100528 LY_ARRAY_FOR(ext->substmts, u) {
529 uint64_t stmt_counter = 0;
530
531 for (stmt = ext_p->child; stmt; stmt = stmt->next) {
532 if (ext->substmts[u].stmt != stmt->kw) {
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200533 continue;
534 }
535
Radek Krejci6b88a462021-02-17 12:39:34 +0100536 parsed = NULL;
537 stmt_counter++;
538 if (ext->substmts[u].storage) {
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200539 switch (stmt->kw) {
Radek Krejci6b88a462021-02-17 12:39:34 +0100540 case LY_STMT_ACTION:
541 case LY_STMT_ANYDATA:
542 case LY_STMT_ANYXML:
543 case LY_STMT_CONTAINER:
544 case LY_STMT_CHOICE:
545 case LY_STMT_LEAF:
546 case LY_STMT_LEAF_LIST:
547 case LY_STMT_LIST:
548 case LY_STMT_NOTIFICATION:
549 case LY_STMT_RPC:
550 case LY_STMT_USES:
aPiecek60d9d672021-04-27 15:49:57 +0200551 if (!ext_p->parsed) {
552 struct lysp_ext_instance *unconst_ext_p;
553 r = lysp_stmt_parse(ctx, stmt, &parsed, NULL);
554 LY_CHECK_ERR_GOTO(r, ret = r, cleanup);
555 unconst_ext_p = (struct lysp_ext_instance *)ext_p;
556 unconst_ext_p->parsed = parsed;
557 } else {
Michal Vaskoa9309bb2021-07-09 09:31:55 +0200558 struct lysp_node *node, *last_node = NULL;
aPiecek60d9d672021-04-27 15:49:57 +0200559 /* get last parsed node */
560 LY_LIST_FOR(ext_p->parsed, node) {
561 last_node = node;
562 }
563 /* create and link sibling */
564 r = lysp_stmt_parse(ctx, stmt, &parsed, NULL);
565 LY_CHECK_ERR_GOTO(r, ret = r, cleanup);
566 last_node->next = parsed;
567 }
Radek Krejci6b88a462021-02-17 12:39:34 +0100568
569 /* set storage as an alternative document root in the compile context */
570 r = lys_compile_node(ctx, parsed, NULL, 0, NULL);
Radek Krejci6b88a462021-02-17 12:39:34 +0100571 LY_CHECK_ERR_GOTO(r, ret = r, cleanup);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200572 break;
Radek Krejci1b2eef82021-02-17 11:17:27 +0100573 case LY_STMT_DESCRIPTION:
574 case LY_STMT_REFERENCE:
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200575 case LY_STMT_UNITS: {
Radek Krejci6b88a462021-02-17 12:39:34 +0100576 const char **str_p;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200577
Radek Krejci6b88a462021-02-17 12:39:34 +0100578 if (ext->substmts[u].cardinality < LY_STMT_CARD_SOME) {
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200579 /* single item */
Radek Krejci6b88a462021-02-17 12:39:34 +0100580 if (*((const char **)ext->substmts[u].storage)) {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100581 LOGVAL(ctx->ctx, LY_VCODE_DUPSTMT, stmt->stmt);
aPiecek1c4da362021-04-29 14:26:34 +0200582 ret = LY_EVALID;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200583 goto cleanup;
584 }
Radek Krejci6b88a462021-02-17 12:39:34 +0100585 str_p = (const char **)ext->substmts[u].storage;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200586 } else {
587 /* sized array */
Radek Krejci6b88a462021-02-17 12:39:34 +0100588 const char ***strings_array = (const char ***)ext->substmts[u].storage;
589 LY_ARRAY_NEW_GOTO(ctx->ctx, *strings_array, str_p, ret, cleanup);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200590 }
Radek Krejci6b88a462021-02-17 12:39:34 +0100591 r = lydict_insert(ctx->ctx, stmt->arg, 0, str_p);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200592 LY_CHECK_ERR_GOTO(r, ret = r, cleanup);
593 break;
594 }
Radek Krejci6b88a462021-02-17 12:39:34 +0100595 case LY_STMT_IF_FEATURE: {
596 ly_bool enabled;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200597
Radek Krejci76c8c4e2021-02-17 10:16:48 +0100598 r = lysp_stmt_parse(ctx, stmt, &parsed, NULL);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200599 LY_CHECK_ERR_GOTO(r, ret = r, cleanup);
Radek Krejci6b88a462021-02-17 12:39:34 +0100600
601 r = lys_eval_iffeatures(ctx->ctx, parsed, &enabled);
602 FREE_ARRAY(ctx->ctx, (struct lysp_qname *)parsed, lysp_qname_free);
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100603 LY_CHECK_ERR_GOTO(r, ret = r, cleanup);
604 if (!enabled) {
605 /* it is disabled, remove the whole extension instance */
606 return LY_ENOT;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200607 }
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200608 break;
Radek Krejci6b88a462021-02-17 12:39:34 +0100609 }
610 case LY_STMT_STATUS:
611 assert(ext->substmts[u].cardinality < LY_STMT_CARD_SOME);
612 LY_CHECK_ERR_GOTO(r = lysp_stmt_parse(ctx, stmt, &ext->substmts[u].storage, /* TODO */ NULL), ret = r, cleanup);
613 break;
614 case LY_STMT_TYPE: {
615 uint16_t *flags = lys_compile_extension_instance_storage(LY_STMT_STATUS, ext->substmts);
616 const char **units = lys_compile_extension_instance_storage(LY_STMT_UNITS, ext->substmts);
617
618 if (ext->substmts[u].cardinality < LY_STMT_CARD_SOME) {
619 /* single item */
620 if (*(struct lysc_type **)ext->substmts[u].storage) {
621 LOGVAL(ctx->ctx, LY_VCODE_DUPSTMT, stmt->stmt);
aPiecek1c4da362021-04-29 14:26:34 +0200622 ret = LY_EVALID;
Radek Krejci6b88a462021-02-17 12:39:34 +0100623 goto cleanup;
624 }
625 compiled = ext->substmts[u].storage;
626 } else {
627 /* sized array */
628 struct lysc_type ***types = (struct lysc_type ***)ext->substmts[u].storage, **type = NULL;
629 LY_ARRAY_NEW_GOTO(ctx->ctx, *types, type, ret, cleanup);
630 compiled = (void *)type;
631 }
632
633 r = lysp_stmt_parse(ctx, stmt, &parsed, NULL);
634 LY_CHECK_ERR_GOTO(r, ret = r, cleanup);
635 r = lys_compile_type(ctx, NULL, flags ? *flags : 0, ext_p->name, parsed, (struct lysc_type **)compiled,
636 units && !*units ? units : NULL, NULL);
637 lysp_type_free(ctx->ctx, parsed);
638 free(parsed);
639 LY_CHECK_ERR_GOTO(r, ret = r, cleanup);
640 break;
641 }
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200642 /* TODO support other substatements (parse stmt to lysp and then compile lysp to lysc),
643 * also note that in many statements their extensions are not taken into account */
644 default:
Radek Krejci2efc45b2020-12-22 16:25:44 +0100645 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 +0100646 stmt->stmt, ext_p->name, ext_p->argument ? " " : "", ext_p->argument ? ext_p->argument : "");
aPiecek1c4da362021-04-29 14:26:34 +0200647 ret = LY_EVALID;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200648 goto cleanup;
649 }
650 }
651 }
652
Radek Krejci6b88a462021-02-17 12:39:34 +0100653 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 +0100654 LOGVAL(ctx->ctx, LYVE_SYNTAX_YANG, "Missing mandatory keyword \"%s\" as a child of \"%s%s%s\".",
Radek Krejci6b88a462021-02-17 12:39:34 +0100655 ly_stmt2str(ext->substmts[u].stmt), ext_p->name, ext_p->argument ? " " : "", ext_p->argument ? ext_p->argument : "");
aPiecek1c4da362021-04-29 14:26:34 +0200656 ret = LY_EVALID;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200657 goto cleanup;
658 }
659 }
660
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200661cleanup:
Radek Krejci6b88a462021-02-17 12:39:34 +0100662 ctx->ext = NULL;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200663 return ret;
664}
665
666/**
667 * @brief Check when for cyclic dependencies.
668 *
669 * @param[in] set Set with all the referenced nodes.
670 * @param[in] node Node whose "when" referenced nodes are in @p set.
671 * @return LY_ERR value
672 */
673static LY_ERR
674lys_compile_unres_when_cyclic(struct lyxp_set *set, const struct lysc_node *node)
675{
676 struct lyxp_set tmp_set;
677 struct lyxp_set_scnode *xp_scnode;
678 uint32_t i, j;
679 LY_ARRAY_COUNT_TYPE u;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200680 LY_ERR ret = LY_SUCCESS;
681
682 memset(&tmp_set, 0, sizeof tmp_set);
683
684 /* prepare in_ctx of the set */
685 for (i = 0; i < set->used; ++i) {
686 xp_scnode = &set->val.scnodes[i];
687
Radek Krejcif13b87b2020-12-01 22:02:17 +0100688 if (xp_scnode->in_ctx != LYXP_SET_SCNODE_START_USED) {
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200689 /* check node when, skip the context node (it was just checked) */
Radek Krejcif13b87b2020-12-01 22:02:17 +0100690 xp_scnode->in_ctx = LYXP_SET_SCNODE_ATOM_CTX;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200691 }
692 }
693
694 for (i = 0; i < set->used; ++i) {
695 xp_scnode = &set->val.scnodes[i];
Radek Krejcif13b87b2020-12-01 22:02:17 +0100696 if (xp_scnode->in_ctx != LYXP_SET_SCNODE_ATOM_CTX) {
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200697 /* already checked */
698 continue;
699 }
700
Michal Vasko1a09b212021-05-06 13:00:10 +0200701 if ((xp_scnode->type != LYXP_NODE_ELEM) || !lysc_node_when(xp_scnode->scnode)) {
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200702 /* no when to check */
Michal Vasko1a09b212021-05-06 13:00:10 +0200703 xp_scnode->in_ctx = LYXP_SET_SCNODE_ATOM_NODE;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200704 continue;
705 }
706
707 node = xp_scnode->scnode;
708 do {
Radek Krejci9a3823e2021-01-27 20:26:46 +0100709 struct lysc_when **when_list, *when;
710
Radek Krejciddace2c2021-01-08 11:30:56 +0100711 LOG_LOCSET(node, NULL, NULL, NULL);
Radek Krejci9a3823e2021-01-27 20:26:46 +0100712 when_list = lysc_node_when(node);
713 LY_ARRAY_FOR(when_list, u) {
714 when = when_list[u];
Radek Krejci8df109d2021-04-23 12:19:08 +0200715 ret = lyxp_atomize(set->ctx, when->cond, node->module, LY_VALUE_SCHEMA_RESOLVED, when->prefixes,
Michal Vasko400e9672021-01-11 13:39:17 +0100716 when->context, &tmp_set, LYXP_SCNODE_SCHEMA);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200717 if (ret != LY_SUCCESS) {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100718 LOGVAL(set->ctx, LYVE_SEMANTICS, "Invalid when condition \"%s\".", when->cond->expr);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200719 goto cleanup;
720 }
721
722 for (j = 0; j < tmp_set.used; ++j) {
723 /* skip roots'n'stuff */
724 if (tmp_set.val.scnodes[j].type == LYXP_NODE_ELEM) {
725 /* try to find this node in our set */
726 uint32_t idx;
Radek Krejcif13b87b2020-12-01 22:02:17 +0100727 if (lyxp_set_scnode_contains(set, tmp_set.val.scnodes[j].scnode, LYXP_NODE_ELEM, -1, &idx) &&
728 (set->val.scnodes[idx].in_ctx == LYXP_SET_SCNODE_START_USED)) {
Michal Vasko2c4d9152021-07-20 09:17:28 +0200729 LOGVAL(set->ctx, LYVE_SEMANTICS, "When condition cyclic dependency on the node \"%s\".",
730 tmp_set.val.scnodes[j].scnode->name);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200731 ret = LY_EVALID;
732 goto cleanup;
733 }
734
735 /* needs to be checked, if in both sets, will be ignored */
Radek Krejcif13b87b2020-12-01 22:02:17 +0100736 tmp_set.val.scnodes[j].in_ctx = LYXP_SET_SCNODE_ATOM_CTX;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200737 } else {
738 /* no when, nothing to check */
Michal Vasko1a09b212021-05-06 13:00:10 +0200739 tmp_set.val.scnodes[j].in_ctx = LYXP_SET_SCNODE_ATOM_NODE;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200740 }
741 }
742
743 /* merge this set into the global when set */
744 lyxp_set_scnode_merge(set, &tmp_set);
745 }
746
747 /* check when of non-data parents as well */
748 node = node->parent;
Radek Krejci2efc45b2020-12-22 16:25:44 +0100749
Radek Krejciddace2c2021-01-08 11:30:56 +0100750 LOG_LOCBACK(1, 0, 0, 0);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200751 } while (node && (node->nodetype & (LYS_CASE | LYS_CHOICE)));
752
753 /* this node when was checked (xp_scnode could have been reallocd) */
Michal Vasko60edc2f2021-07-20 09:18:02 +0200754 set->val.scnodes[i].in_ctx = LYXP_SET_SCNODE_ATOM_NODE;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200755 }
756
757cleanup:
758 lyxp_set_free_content(&tmp_set);
759 return ret;
760}
761
762LY_ERR
763lysc_check_status(struct lysc_ctx *ctx, uint16_t flags1, void *mod1, const char *name1, uint16_t flags2, void *mod2,
764 const char *name2)
765{
766 uint16_t flg1, flg2;
767
768 flg1 = (flags1 & LYS_STATUS_MASK) ? (flags1 & LYS_STATUS_MASK) : LYS_STATUS_CURR;
769 flg2 = (flags2 & LYS_STATUS_MASK) ? (flags2 & LYS_STATUS_MASK) : LYS_STATUS_CURR;
770
771 if ((flg1 < flg2) && (mod1 == mod2)) {
772 if (ctx) {
Michal Vasko23864e02021-06-24 09:23:58 +0200773 LOGVAL(ctx->ctx, LYVE_REFERENCE, "A %s definition \"%s\" is not allowed to reference %s definition \"%s\".",
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200774 flg1 == LYS_STATUS_CURR ? "current" : "deprecated", name1,
775 flg2 == LYS_STATUS_OBSLT ? "obsolete" : "deprecated", name2);
776 }
777 return LY_EVALID;
778 }
779
780 return LY_SUCCESS;
781}
782
Michal Vasko25d6ad02020-10-22 12:20:22 +0200783LY_ERR
Radek Krejci8df109d2021-04-23 12:19:08 +0200784lys_compile_expr_implement(const struct ly_ctx *ctx, const struct lyxp_expr *expr, LY_VALUE_FORMAT format,
Michal Vasko405cc9e2020-12-01 12:01:27 +0100785 void *prefix_data, ly_bool implement, struct lys_glob_unres *unres, const struct lys_module **mod_p)
Michal Vaskocfaff232020-10-20 09:35:14 +0200786{
787 uint32_t i;
Michal Vaskoc56d6372021-10-19 12:29:00 +0200788 const char *ptr, *start, **imp_f, *all_f[] = {"*", NULL};
Michal Vaskocfaff232020-10-20 09:35:14 +0200789 const struct lys_module *mod;
790
Michal Vasko25d6ad02020-10-22 12:20:22 +0200791 assert(implement || mod_p);
792
Michal Vaskocfaff232020-10-20 09:35:14 +0200793 for (i = 0; i < expr->used; ++i) {
794 if ((expr->tokens[i] != LYXP_TOKEN_NAMETEST) && (expr->tokens[i] != LYXP_TOKEN_LITERAL)) {
795 /* token cannot have a prefix */
796 continue;
797 }
798
799 start = expr->expr + expr->tok_pos[i];
800 if (!(ptr = ly_strnchr(start, ':', expr->tok_len[i]))) {
801 /* token without a prefix */
802 continue;
803 }
804
805 if (!(mod = ly_resolve_prefix(ctx, start, ptr - start, format, prefix_data))) {
806 /* unknown prefix, do not care right now */
807 continue;
808 }
809
Michal Vasko0c296722021-07-14 08:53:16 +0200810 /* unimplemented module found */
811 if (!mod->implemented && !implement) {
812 /* should not be implemented now */
813 *mod_p = mod;
814 break;
815 }
816
Michal Vaskocfaff232020-10-20 09:35:14 +0200817 if (!mod->implemented) {
Michal Vasko0c296722021-07-14 08:53:16 +0200818 /* implement if not implemented */
Michal Vaskoc56d6372021-10-19 12:29:00 +0200819 imp_f = (ctx->flags & LY_CTX_ENABLE_IMP_FEATURES) ? all_f : NULL;
820 LY_CHECK_RET(lys_implement((struct lys_module *)mod, imp_f, unres));
Michal Vasko0c296722021-07-14 08:53:16 +0200821 }
822 if (!mod->compiled) {
823 /* compile if not implemented before or only marked for compilation */
824 LY_CHECK_RET(lys_compile((struct lys_module *)mod, &unres->ds_unres));
Michal Vaskocfaff232020-10-20 09:35:14 +0200825 }
826 }
827
Michal Vasko25d6ad02020-10-22 12:20:22 +0200828 return LY_SUCCESS;
Michal Vaskocfaff232020-10-20 09:35:14 +0200829}
830
831/**
Michal Vaskoc130e162021-10-19 11:30:00 +0200832 * @brief Check when expressions of a node on a complete compiled schema tree.
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200833 *
834 * @param[in] ctx Compile context.
835 * @param[in] node Node to check.
Michal Vasko405cc9e2020-12-01 12:01:27 +0100836 * @param[in,out] unres Global unres structure.
Michal Vasko40c158c2021-04-28 17:01:03 +0200837 * @return LY_ERECOMPILE
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200838 * @return LY_ERR value
839 */
840static LY_ERR
Michal Vaskoc130e162021-10-19 11:30:00 +0200841lys_compile_unres_when(struct lysc_ctx *ctx, const struct lysc_node *node, struct lys_glob_unres *unres)
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200842{
843 struct lyxp_set tmp_set;
844 uint32_t i, opts;
845 LY_ARRAY_COUNT_TYPE u;
Radek Krejci9a3823e2021-01-27 20:26:46 +0100846 struct lysc_when **whens = NULL;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200847 LY_ERR ret = LY_SUCCESS;
Michal Vaskocfaff232020-10-20 09:35:14 +0200848 const struct lys_module *mod;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200849
Radek Krejciddace2c2021-01-08 11:30:56 +0100850 LOG_LOCSET(node, NULL, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +0100851
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200852 memset(&tmp_set, 0, sizeof tmp_set);
Michal Vaskod1e53b92021-01-28 13:11:06 +0100853 opts = LYXP_SCNODE_SCHEMA | ((node->flags & LYS_IS_OUTPUT) ? LYXP_SCNODE_OUTPUT : 0);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200854
Radek Krejci9a3823e2021-01-27 20:26:46 +0100855 whens = lysc_node_when(node);
Radek Krejci9a3823e2021-01-27 20:26:46 +0100856 LY_ARRAY_FOR(whens, u) {
Michal Vaskocfaff232020-10-20 09:35:14 +0200857 /* first check whether all the referenced modules are implemented */
Michal Vasko25d6ad02020-10-22 12:20:22 +0200858 mod = NULL;
Radek Krejci8df109d2021-04-23 12:19:08 +0200859 ret = lys_compile_expr_implement(ctx->ctx, whens[u]->cond, LY_VALUE_SCHEMA_RESOLVED, whens[u]->prefixes,
Michal Vasko405cc9e2020-12-01 12:01:27 +0100860 ctx->ctx->flags & LY_CTX_REF_IMPLEMENTED, unres, &mod);
Michal Vasko25d6ad02020-10-22 12:20:22 +0200861 if (ret) {
862 goto cleanup;
863 } else if (mod) {
Michal Vaskocfaff232020-10-20 09:35:14 +0200864 LOGWRN(ctx->ctx, "When condition \"%s\" check skipped because referenced module \"%s\" is not implemented.",
Radek Krejci9a3823e2021-01-27 20:26:46 +0100865 whens[u]->cond->expr, mod->name);
Michal Vaskocfaff232020-10-20 09:35:14 +0200866 continue;
867 }
868
869 /* check "when" */
Radek Krejci8df109d2021-04-23 12:19:08 +0200870 ret = lyxp_atomize(ctx->ctx, whens[u]->cond, node->module, LY_VALUE_SCHEMA_RESOLVED, whens[u]->prefixes,
Radek Krejci9a3823e2021-01-27 20:26:46 +0100871 whens[u]->context, &tmp_set, opts);
Michal Vasko25d6ad02020-10-22 12:20:22 +0200872 if (ret) {
Radek Krejci9a3823e2021-01-27 20:26:46 +0100873 LOGVAL(ctx->ctx, LYVE_SEMANTICS, "Invalid when condition \"%s\".", whens[u]->cond->expr);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200874 goto cleanup;
875 }
876
877 ctx->path[0] = '\0';
Michal Vasko14ed9cd2021-01-28 14:16:25 +0100878 lysc_path(node, LYSC_PATH_LOG, ctx->path, LYSC_CTX_BUFSIZE);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200879 for (i = 0; i < tmp_set.used; ++i) {
880 /* skip roots'n'stuff */
Michal Vasko6b8c5102021-10-19 11:29:32 +0200881 if ((tmp_set.val.scnodes[i].type == LYXP_NODE_ELEM) &&
882 (tmp_set.val.scnodes[i].in_ctx != LYXP_SET_SCNODE_START_USED)) {
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200883 struct lysc_node *schema = tmp_set.val.scnodes[i].scnode;
884
885 /* XPath expression cannot reference "lower" status than the node that has the definition */
Radek Krejci9a3823e2021-01-27 20:26:46 +0100886 ret = lysc_check_status(ctx, whens[u]->flags, node->module, node->name, schema->flags, schema->module,
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200887 schema->name);
888 LY_CHECK_GOTO(ret, cleanup);
889
Michal Vasko1a09b212021-05-06 13:00:10 +0200890 /* check dummy node children/value accessing */
891 if (lysc_data_parent(schema) == node) {
892 LOGVAL(ctx->ctx, LYVE_SEMANTICS, "When condition is accessing its own conditional node children.");
893 ret = LY_EVALID;
894 goto cleanup;
895 } else if ((schema == node) && (tmp_set.val.scnodes[i].in_ctx == LYXP_SET_SCNODE_ATOM_VAL)) {
896 LOGVAL(ctx->ctx, LYVE_SEMANTICS, "When condition is accessing its own conditional node value.");
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200897 ret = LY_EVALID;
898 goto cleanup;
899 }
900 }
901 }
902
903 /* check cyclic dependencies */
904 ret = lys_compile_unres_when_cyclic(&tmp_set, node);
905 LY_CHECK_GOTO(ret, cleanup);
906
907 lyxp_set_free_content(&tmp_set);
908 }
909
Michal Vaskoc130e162021-10-19 11:30:00 +0200910cleanup:
911 lyxp_set_free_content(&tmp_set);
912 LOG_LOCBACK(1, 0, 0, 0);
913 return ret;
914}
915
916/**
917 * @brief Check must expressions of a node on a complete compiled schema tree.
918 *
919 * @param[in] ctx Compile context.
920 * @param[in] node Node to check.
921 * @param[in] local_mods Sized array of local modules for musts of @p node at the same index.
922 * @param[in,out] unres Global unres structure.
923 * @return LY_ERECOMPILE
924 * @return LY_ERR value
925 */
926static LY_ERR
927lys_compile_unres_must(struct lysc_ctx *ctx, const struct lysc_node *node, const struct lysp_module **local_mods,
928 struct lys_glob_unres *unres)
929{
930 struct lyxp_set tmp_set;
931 uint32_t i, opts;
932 LY_ARRAY_COUNT_TYPE u;
933 struct lysc_must *musts = NULL;
934 LY_ERR ret = LY_SUCCESS;
935 const struct lys_module *mod;
936 uint16_t flg;
937
938 LOG_LOCSET(node, NULL, NULL, NULL);
939
940 memset(&tmp_set, 0, sizeof tmp_set);
941 opts = LYXP_SCNODE_SCHEMA | ((node->flags & LYS_IS_OUTPUT) ? LYXP_SCNODE_OUTPUT : 0);
942
943 musts = lysc_node_musts(node);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200944 LY_ARRAY_FOR(musts, u) {
Michal Vaskocfaff232020-10-20 09:35:14 +0200945 /* first check whether all the referenced modules are implemented */
Michal Vasko25d6ad02020-10-22 12:20:22 +0200946 mod = NULL;
Radek Krejci8df109d2021-04-23 12:19:08 +0200947 ret = lys_compile_expr_implement(ctx->ctx, musts[u].cond, LY_VALUE_SCHEMA_RESOLVED, musts[u].prefixes,
Michal Vasko405cc9e2020-12-01 12:01:27 +0100948 ctx->ctx->flags & LY_CTX_REF_IMPLEMENTED, unres, &mod);
Michal Vasko25d6ad02020-10-22 12:20:22 +0200949 if (ret) {
950 goto cleanup;
951 } else if (mod) {
Michal Vaskocfaff232020-10-20 09:35:14 +0200952 LOGWRN(ctx->ctx, "Must condition \"%s\" check skipped because referenced module \"%s\" is not implemented.",
953 musts[u].cond->expr, mod->name);
954 continue;
955 }
956
957 /* check "must" */
Radek Krejci8df109d2021-04-23 12:19:08 +0200958 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 +0100959 &tmp_set, opts);
Michal Vasko25d6ad02020-10-22 12:20:22 +0200960 if (ret) {
Radek Krejci2efc45b2020-12-22 16:25:44 +0100961 LOGVAL(ctx->ctx, LYVE_SEMANTICS, "Invalid must restriction \"%s\".", musts[u].cond->expr);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200962 goto cleanup;
963 }
964
965 ctx->path[0] = '\0';
Michal Vasko14ed9cd2021-01-28 14:16:25 +0100966 lysc_path(node, LYSC_PATH_LOG, ctx->path, LYSC_CTX_BUFSIZE);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200967 for (i = 0; i < tmp_set.used; ++i) {
968 /* skip roots'n'stuff */
969 if (tmp_set.val.scnodes[i].type == LYXP_NODE_ELEM) {
970 /* XPath expression cannot reference "lower" status than the node that has the definition */
Michal Vaskoc130e162021-10-19 11:30:00 +0200971 if (local_mods[u]->mod == node->module) {
972 /* use flags of the context node since the definition is local */
973 flg = node->flags;
974 } else {
975 /* definition is foreign (deviation, refine), always current */
976 flg = LYS_STATUS_CURR;
977 }
978 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 +0200979 tmp_set.val.scnodes[i].scnode->module, tmp_set.val.scnodes[i].scnode->name);
980 LY_CHECK_GOTO(ret, cleanup);
981 }
982 }
983
984 lyxp_set_free_content(&tmp_set);
985 }
986
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200987cleanup:
988 lyxp_set_free_content(&tmp_set);
Radek Krejciddace2c2021-01-08 11:30:56 +0100989 LOG_LOCBACK(1, 0, 0, 0);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +0200990 return ret;
991}
992
993/**
Michal Vaskof4fa90d2021-11-11 15:05:19 +0100994 * @brief Remove all disabled bits/enums from a sized array.
995 *
996 * @param[in] ctx Context with the dictionary.
997 * @param[in] items Sized array of bits/enums.
998 */
999static void
1000lys_compile_unres_disabled_bitenum_remove(struct ly_ctx *ctx, struct lysc_type_bitenum_item *items)
1001{
1002 LY_ARRAY_COUNT_TYPE u = 0, last_u;
1003
1004 while (u < LY_ARRAY_COUNT(items)) {
1005 if (items[u].flags & LYS_DISABLED) {
1006 /* free the disabled item */
1007 lysc_enum_item_free(ctx, &items[u]);
1008
1009 /* replace it with the following items */
1010 last_u = LY_ARRAY_COUNT(items) - 1;
1011 if (u < last_u) {
1012 memmove(items + u, items + u + 1, (last_u - u) * sizeof *items);
1013 }
1014
1015 /* one item less */
1016 LY_ARRAY_DECREMENT(items);
1017 continue;
1018 }
1019
1020 ++u;
1021 }
1022}
1023
1024/**
1025 * @brief Find and remove all disabled bits/enums in a leaf/leaf-list type.
1026 *
1027 * @param[in] ctx Compile context.
1028 * @param[in] leaf Leaf/leaf-list to check.
1029 * @return LY_ERR value
1030 */
1031static LY_ERR
1032lys_compile_unres_disabled_bitenum(struct lysc_ctx *ctx, struct lysc_node_leaf *leaf)
1033{
1034 struct lysc_type **t;
1035 LY_ARRAY_COUNT_TYPE u, count;
1036 struct lysc_type_enum *ent;
1037
1038 if (leaf->type->basetype == LY_TYPE_UNION) {
1039 t = ((struct lysc_type_union *)leaf->type)->types;
1040 count = LY_ARRAY_COUNT(t);
1041 } else {
1042 t = &leaf->type;
1043 count = 1;
1044 }
1045 for (u = 0; u < count; ++u) {
1046 if ((t[u]->basetype == LY_TYPE_BITS) || (t[u]->basetype == LY_TYPE_ENUM)) {
1047 /* remove all disabled items */
1048 ent = (struct lysc_type_enum *)(t[u]);
1049 lys_compile_unres_disabled_bitenum_remove(ctx->ctx, ent->enums);
1050
1051 if (!LY_ARRAY_COUNT(ent->enums)) {
1052 LOGVAL(ctx->ctx, LYVE_SEMANTICS, "%s type of node \"%s\" without any (or all disabled) valid values.",
1053 (ent->basetype == LY_TYPE_BITS) ? "Bits" : "Enumeration", leaf->name);
1054 return LY_EVALID;
1055 }
1056 }
1057 }
1058
1059 return LY_SUCCESS;
1060}
1061
1062/**
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001063 * @brief Check leafref for its target existence on a complete compiled schema tree.
1064 *
1065 * @param[in] ctx Compile context.
1066 * @param[in] node Context node for the leafref.
1067 * @param[in] lref Leafref to check/resolve.
Michal Vaskoc130e162021-10-19 11:30:00 +02001068 * @param[in] local_mod Local module for the leafref type.
Michal Vasko405cc9e2020-12-01 12:01:27 +01001069 * @param[in,out] unres Global unres structure.
Michal Vasko40c158c2021-04-28 17:01:03 +02001070 * @return LY_ERECOMPILE if context recompilation is needed,
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001071 * @return LY_ERR value.
1072 */
1073static LY_ERR
Michal Vasko405cc9e2020-12-01 12:01:27 +01001074lys_compile_unres_leafref(struct lysc_ctx *ctx, const struct lysc_node *node, struct lysc_type_leafref *lref,
Michal Vaskoc130e162021-10-19 11:30:00 +02001075 const struct lysp_module *local_mod, struct lys_glob_unres *unres)
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001076{
Michal Vaskod1e53b92021-01-28 13:11:06 +01001077 const struct lysc_node *target = NULL;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001078 struct ly_path *p;
1079 struct lysc_type *type;
Michal Vaskoc130e162021-10-19 11:30:00 +02001080 uint16_t flg;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001081
1082 assert(node->nodetype & (LYS_LEAF | LYS_LEAFLIST));
1083
Michal Vasko24fc4d12021-07-12 14:41:20 +02001084 /* first implement all the modules in the path */
1085 LY_CHECK_RET(lys_compile_expr_implement(ctx->ctx, lref->path, LY_VALUE_SCHEMA_RESOLVED, lref->prefixes, 1, unres, NULL));
1086
Michal Vaskoed725d72021-06-23 12:03:45 +02001087 /* try to find the target, current module is that of the context node (RFC 7950 6.4.1 second bullet) */
1088 LY_CHECK_RET(ly_path_compile_leafref(ctx->ctx, node, NULL, lref->path,
Michal Vaskod1e53b92021-01-28 13:11:06 +01001089 (node->flags & LYS_IS_OUTPUT) ? LY_PATH_OPER_OUTPUT : LY_PATH_OPER_INPUT, LY_PATH_TARGET_MANY,
Michal Vasko24fc4d12021-07-12 14:41:20 +02001090 LY_VALUE_SCHEMA_RESOLVED, lref->prefixes, &p));
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001091
1092 /* get the target node */
1093 target = p[LY_ARRAY_COUNT(p) - 1].node;
1094 ly_path_free(node->module->ctx, p);
1095
1096 if (!(target->nodetype & (LYS_LEAF | LYS_LEAFLIST))) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001097 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 +02001098 lref->path->expr, lys_nodetype2str(target->nodetype));
1099 return LY_EVALID;
1100 }
1101
1102 /* check status */
1103 ctx->path[0] = '\0';
1104 lysc_path(node, LYSC_PATH_LOG, ctx->path, LYSC_CTX_BUFSIZE);
1105 ctx->path_len = strlen(ctx->path);
Michal Vaskoc130e162021-10-19 11:30:00 +02001106 if (node->module == local_mod->mod) {
1107 /* use flags of the context node since the definition is local */
1108 flg = node->flags;
1109 } else {
1110 /* definition is foreign (deviation), always current */
1111 flg = LYS_STATUS_CURR;
1112 }
1113 if (lysc_check_status(ctx, flg, local_mod->mod, node->name, target->flags, target->module, target->name)) {
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001114 return LY_EVALID;
1115 }
1116 ctx->path_len = 1;
1117 ctx->path[1] = '\0';
1118
1119 /* check config */
1120 if (lref->require_instance) {
Michal Vaskod1e53b92021-01-28 13:11:06 +01001121 if ((node->flags & LYS_CONFIG_W) && (target->flags & LYS_CONFIG_R)) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001122 LOGVAL(ctx->ctx, LYVE_REFERENCE, "Invalid leafref path \"%s\" - target is supposed"
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001123 " to represent configuration data (as the leafref does), but it does not.", lref->path->expr);
1124 return LY_EVALID;
1125 }
1126 }
1127
1128 /* store the target's type and check for circular chain of leafrefs */
1129 lref->realtype = ((struct lysc_node_leaf *)target)->type;
1130 for (type = lref->realtype; type && type->basetype == LY_TYPE_LEAFREF; type = ((struct lysc_type_leafref *)type)->realtype) {
1131 if (type == (struct lysc_type *)lref) {
1132 /* circular chain detected */
Radek Krejci2efc45b2020-12-22 16:25:44 +01001133 LOGVAL(ctx->ctx, LYVE_REFERENCE, "Invalid leafref path \"%s\" - circular chain of leafrefs detected.",
1134 lref->path->expr);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001135 return LY_EVALID;
1136 }
1137 }
1138
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001139 return LY_SUCCESS;
1140}
1141
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001142/**
1143 * @brief Compile default value(s) for leaf or leaf-list expecting a complete compiled schema tree.
1144 *
1145 * @param[in] ctx Compile context.
1146 * @param[in] node Leaf or leaf-list to compile the default value(s) for.
1147 * @param[in] type Type of the default value.
1148 * @param[in] dflt Default value.
1149 * @param[in] dflt_pmod Parsed module of the @p dflt to resolve possible prefixes.
1150 * @param[in,out] storage Storage for the compiled default value.
Michal Vasko405cc9e2020-12-01 12:01:27 +01001151 * @param[in,out] unres Global unres structure for newly implemented modules.
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001152 * @return LY_ERR value.
1153 */
1154static LY_ERR
1155lys_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 +01001156 const struct lysp_module *dflt_pmod, struct lyd_value *storage, struct lys_glob_unres *unres)
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001157{
1158 LY_ERR ret;
Michal Vasko25d6ad02020-10-22 12:20:22 +02001159 uint32_t options;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001160 struct ly_err_item *err = NULL;
1161
Radek Krejci0b013302021-03-29 15:22:32 +02001162 options = (ctx->ctx->flags & LY_CTX_REF_IMPLEMENTED) ? LYPLG_TYPE_STORE_IMPLEMENT : 0;
Radek Krejci8df109d2021-04-23 12:19:08 +02001163 ret = type->plugin->store(ctx->ctx, type, dflt, strlen(dflt), options, LY_VALUE_SCHEMA, (void *)dflt_pmod,
Michal Vasko405cc9e2020-12-01 12:01:27 +01001164 LYD_HINT_SCHEMA, node, storage, unres, &err);
Michal Vasko1ccbf542021-04-19 11:35:00 +02001165 if (ret == LY_ERECOMPILE) {
1166 /* fine, but we need to recompile */
1167 return LY_ERECOMPILE;
1168 } else if (ret == LY_EINCOMPLETE) {
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001169 /* we have no data so we will not be resolving it */
1170 ret = LY_SUCCESS;
1171 }
1172
1173 if (ret) {
Radek Krejciddace2c2021-01-08 11:30:56 +01001174 LOG_LOCSET(node, NULL, NULL, NULL);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001175 if (err) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001176 LOGVAL(ctx->ctx, LYVE_SEMANTICS, "Invalid default - value does not fit the type (%s).", err->msg);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001177 ly_err_free(err);
1178 } else {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001179 LOGVAL(ctx->ctx, LYVE_SEMANTICS, "Invalid default - value does not fit the type.");
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001180 }
Radek Krejciddace2c2021-01-08 11:30:56 +01001181 LOG_LOCBACK(1, 0, 0, 0);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001182 return ret;
1183 }
1184
Michal Vasko04338d92021-09-01 07:58:14 +02001185 LY_ATOMIC_INC_BARRIER(((struct lysc_type *)storage->realtype)->refcount);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001186 return LY_SUCCESS;
1187}
1188
1189/**
1190 * @brief Compile default value of a leaf expecting a complete compiled schema tree.
1191 *
1192 * @param[in] ctx Compile context.
1193 * @param[in] leaf Leaf that the default value is for.
1194 * @param[in] dflt Default value to compile.
Michal Vasko405cc9e2020-12-01 12:01:27 +01001195 * @param[in,out] unres Global unres structure for newly implemented modules.
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001196 * @return LY_ERR value.
1197 */
1198static LY_ERR
Michal Vasko405cc9e2020-12-01 12:01:27 +01001199lys_compile_unres_leaf_dlft(struct lysc_ctx *ctx, struct lysc_node_leaf *leaf, struct lysp_qname *dflt,
1200 struct lys_glob_unres *unres)
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001201{
1202 LY_ERR ret;
1203
1204 assert(!leaf->dflt);
1205
1206 if (leaf->flags & (LYS_MAND_TRUE | LYS_KEY)) {
1207 /* ignore default values for keys and mandatory leaves */
1208 return LY_SUCCESS;
1209 }
1210
1211 /* allocate the default value */
1212 leaf->dflt = calloc(1, sizeof *leaf->dflt);
1213 LY_CHECK_ERR_RET(!leaf->dflt, LOGMEM(ctx->ctx), LY_EMEM);
1214
1215 /* store the default value */
Michal Vasko14ed9cd2021-01-28 14:16:25 +01001216 ret = lys_compile_unres_dflt(ctx, &leaf->node, leaf->type, dflt->str, dflt->mod, leaf->dflt, unres);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001217 if (ret) {
1218 free(leaf->dflt);
1219 leaf->dflt = NULL;
1220 }
1221
1222 return ret;
1223}
1224
1225/**
1226 * @brief Compile default values of a leaf-list expecting a complete compiled schema tree.
1227 *
1228 * @param[in] ctx Compile context.
1229 * @param[in] llist Leaf-list that the default value(s) are for.
1230 * @param[in] dflt Default value to compile, in case of a single value.
1231 * @param[in] dflts Sized array of default values, in case of more values.
Michal Vasko405cc9e2020-12-01 12:01:27 +01001232 * @param[in,out] unres Global unres structure for newly implemented modules.
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001233 * @return LY_ERR value.
1234 */
1235static LY_ERR
1236lys_compile_unres_llist_dflts(struct lysc_ctx *ctx, struct lysc_node_leaflist *llist, struct lysp_qname *dflt,
Michal Vasko405cc9e2020-12-01 12:01:27 +01001237 struct lysp_qname *dflts, struct lys_glob_unres *unres)
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001238{
1239 LY_ERR ret;
1240 LY_ARRAY_COUNT_TYPE orig_count, u, v;
1241
1242 assert(dflt || dflts);
1243
Radek Krejcic7d13e32020-12-09 12:32:24 +01001244 /* in case there were already some defaults and we are adding new by deviations */
1245 orig_count = LY_ARRAY_COUNT(llist->dflts);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001246
1247 /* allocate new items */
Radek Krejcic7d13e32020-12-09 12:32:24 +01001248 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 +02001249
1250 /* fill each new default value */
1251 if (dflts) {
1252 LY_ARRAY_FOR(dflts, u) {
1253 llist->dflts[orig_count + u] = calloc(1, sizeof **llist->dflts);
Michal Vasko14ed9cd2021-01-28 14:16:25 +01001254 ret = lys_compile_unres_dflt(ctx, &llist->node, llist->type, dflts[u].str, dflts[u].mod,
Michal Vasko405cc9e2020-12-01 12:01:27 +01001255 llist->dflts[orig_count + u], unres);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001256 LY_CHECK_ERR_RET(ret, free(llist->dflts[orig_count + u]), ret);
1257 LY_ARRAY_INCREMENT(llist->dflts);
1258 }
1259 } else {
1260 llist->dflts[orig_count] = calloc(1, sizeof **llist->dflts);
Michal Vasko14ed9cd2021-01-28 14:16:25 +01001261 ret = lys_compile_unres_dflt(ctx, &llist->node, llist->type, dflt->str, dflt->mod,
Michal Vasko405cc9e2020-12-01 12:01:27 +01001262 llist->dflts[orig_count], unres);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001263 LY_CHECK_ERR_RET(ret, free(llist->dflts[orig_count]), ret);
1264 LY_ARRAY_INCREMENT(llist->dflts);
1265 }
1266
1267 /* check default value uniqueness */
1268 if (llist->flags & LYS_CONFIG_W) {
1269 /* configuration data values must be unique - so check the default values */
1270 for (u = orig_count; u < LY_ARRAY_COUNT(llist->dflts); ++u) {
1271 for (v = 0; v < u; ++v) {
1272 if (!llist->dflts[u]->realtype->plugin->compare(llist->dflts[u], llist->dflts[v])) {
Radek Krejcia6016992021-03-03 10:13:41 +01001273 lysc_update_path(ctx, llist->parent ? llist->parent->module : NULL, llist->name);
Radek Krejci2efc45b2020-12-22 16:25:44 +01001274 LOGVAL(ctx->ctx, LYVE_SEMANTICS, "Configuration leaf-list has multiple defaults of the same value \"%s\".",
Radek Krejci6d5ba0c2021-04-26 07:49:59 +02001275 llist->dflts[u]->realtype->plugin->print(ctx->ctx, llist->dflts[u], LY_VALUE_CANON, NULL, NULL, NULL));
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001276 lysc_update_path(ctx, NULL, NULL);
1277 return LY_EVALID;
1278 }
1279 }
1280 }
1281 }
1282
1283 return LY_SUCCESS;
1284}
1285
Michal Vaskof4258e12021-06-15 12:11:42 +02001286/**
aPiecek732cd142021-07-07 16:29:59 +02001287 * @brief Iteratively get all leafrefs from @p node
1288 * if the node is of type union, otherwise just return the leafref.
1289 *
1290 * @param[in] node Node that may contain the leafref.
1291 * @param[in,out] index Value that is passed between function calls.
1292 * For each new node, initialize value of the @p index to 0, otherwise
1293 * do not modify the value between calls.
1294 * @return Pointer to the leafref or next leafref, otherwise NULL.
1295 */
1296static struct lysc_type_leafref *
1297lys_type_leafref_next(const struct lysc_node *node, uint64_t *index)
1298{
1299 struct lysc_type_leafref *ret = NULL;
1300 struct lysc_type_union *uni;
1301 struct lysc_type *leaf_type;
1302
1303 assert(node->nodetype & LYD_NODE_TERM);
1304
1305 leaf_type = ((struct lysc_node_leaf *)node)->type;
1306 if (leaf_type->basetype == LY_TYPE_UNION) {
1307 uni = (struct lysc_type_union *)leaf_type;
1308
1309 /* find next union leafref */
1310 while (*index < LY_ARRAY_COUNT(uni->types)) {
1311 if (uni->types[*index]->basetype == LY_TYPE_LEAFREF) {
1312 ret = (struct lysc_type_leafref *)uni->types[*index];
1313 ++(*index);
1314 break;
1315 }
1316
1317 ++(*index);
1318 }
1319 } else {
1320 /* return just the single leafref */
1321 if (*index == 0) {
1322 ++(*index);
1323 assert(leaf_type->basetype == LY_TYPE_LEAFREF);
1324 ret = (struct lysc_type_leafref *)leaf_type;
1325 }
1326 }
1327
1328 return ret;
1329}
1330
1331/**
Michal Vaskof4258e12021-06-15 12:11:42 +02001332 * @brief Finish dependency set compilation by resolving all the unres sets.
1333 *
1334 * @param[in] ctx libyang context.
1335 * @param[in] unres Global unres structure with the sets to resolve.
1336 * @return LY_SUCCESS on success.
1337 * @return LY_ERECOMPILE if the dep set needs to be recompiled.
1338 * @return LY_ERR value on error.
1339 */
1340static LY_ERR
1341lys_compile_unres_depset(struct ly_ctx *ctx, struct lys_glob_unres *unres)
Michal Vasko405cc9e2020-12-01 12:01:27 +01001342{
aPiecek732cd142021-07-07 16:29:59 +02001343 LY_ERR ret = LY_SUCCESS;
Michal Vasko405cc9e2020-12-01 12:01:27 +01001344 struct lysc_node *node;
aPiecek732cd142021-07-07 16:29:59 +02001345 struct lysc_type *typeiter;
Michal Vasko405cc9e2020-12-01 12:01:27 +01001346 struct lysc_type_leafref *lref;
aPiecekd7bd52d2021-07-08 08:59:59 +02001347 struct lysc_ctx cctx;
Michal Vaskof4258e12021-06-15 12:11:42 +02001348 struct lys_depset_unres *ds_unres;
aPiecekd7bd52d2021-07-08 08:59:59 +02001349 struct ly_path *path;
Michal Vasko405cc9e2020-12-01 12:01:27 +01001350 LY_ARRAY_COUNT_TYPE v;
Michal Vaskoa91d87e2021-10-19 11:58:57 +02001351 struct lysc_unres_leafref *l;
aPiecekd7bd52d2021-07-08 08:59:59 +02001352 uint32_t i, processed_leafrefs = 0;
Michal Vasko405cc9e2020-12-01 12:01:27 +01001353
Michal Vaskof4258e12021-06-15 12:11:42 +02001354 ds_unres = &unres->ds_unres;
1355
Michal Vasko405cc9e2020-12-01 12:01:27 +01001356 /* fake compile context */
aPiecekd7bd52d2021-07-08 08:59:59 +02001357resolve_all:
1358 memset(&cctx, 0, sizeof cctx);
Michal Vasko405cc9e2020-12-01 12:01:27 +01001359 cctx.ctx = ctx;
1360 cctx.path_len = 1;
1361 cctx.path[0] = '/';
1362
1363 /* for leafref, we need 2 rounds - first detects circular chain by storing the first referred type (which
1364 * 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 +02001365 * point to the starting leafref type). The second round stores the first non-leafref type for later data validation.
1366 * Also do the same check for set of the disabled leafrefs, but without the second round. */
1367 while (ds_unres->disabled_leafrefs.count) {
Michal Vaskoa91d87e2021-10-19 11:58:57 +02001368 /* remember index, it can change before we get to free this item */
1369 i = ds_unres->disabled_leafrefs.count - 1;
1370 l = ds_unres->disabled_leafrefs.objs[i];
Michal Vaskoc130e162021-10-19 11:30:00 +02001371 cctx.cur_mod = l->node->module;
1372 cctx.pmod = l->node->module->parsed;
aPiecekc6526b42021-07-12 15:21:39 +02001373
Michal Vaskoa91d87e2021-10-19 11:58:57 +02001374 LOG_LOCSET(l->node, NULL, NULL, NULL);
aPiecekc6526b42021-07-12 15:21:39 +02001375 v = 0;
Michal Vaskoc130e162021-10-19 11:30:00 +02001376 while ((ret == LY_SUCCESS) && (lref = lys_type_leafref_next(l->node, &v))) {
1377 ret = lys_compile_unres_leafref(&cctx, l->node, lref, l->local_mod, unres);
aPiecekc6526b42021-07-12 15:21:39 +02001378 }
aPiecekc6526b42021-07-12 15:21:39 +02001379 LOG_LOCBACK(1, 0, 0, 0);
1380 LY_CHECK_RET(ret);
Michal Vaskoa91d87e2021-10-19 11:58:57 +02001381
1382 ly_set_rm_index(&ds_unres->disabled_leafrefs, i, free);
aPiecekc6526b42021-07-12 15:21:39 +02001383 }
Michal Vaskoa23e1d92021-07-13 12:04:16 +02001384
aPiecekd7bd52d2021-07-08 08:59:59 +02001385 for (i = processed_leafrefs; i < ds_unres->leafrefs.count; ++i) {
Michal Vaskoa91d87e2021-10-19 11:58:57 +02001386 l = ds_unres->leafrefs.objs[i];
Michal Vaskoc130e162021-10-19 11:30:00 +02001387 cctx.cur_mod = l->node->module;
1388 cctx.pmod = l->node->module->parsed;
1389 LOG_LOCSET(l->node, NULL, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +01001390
aPiecek732cd142021-07-07 16:29:59 +02001391 v = 0;
Michal Vaskoc130e162021-10-19 11:30:00 +02001392 while ((ret == LY_SUCCESS) && (lref = lys_type_leafref_next(l->node, &v))) {
1393 ret = lys_compile_unres_leafref(&cctx, l->node, lref, l->local_mod, unres);
Michal Vasko405cc9e2020-12-01 12:01:27 +01001394 }
Radek Krejci2efc45b2020-12-22 16:25:44 +01001395
Radek Krejciddace2c2021-01-08 11:30:56 +01001396 LOG_LOCBACK(1, 0, 0, 0);
Michal Vasko7213ac52021-06-15 11:52:13 +02001397 LY_CHECK_RET(ret);
Michal Vasko405cc9e2020-12-01 12:01:27 +01001398 }
aPiecekd7bd52d2021-07-08 08:59:59 +02001399 for (i = processed_leafrefs; i < ds_unres->leafrefs.count; ++i) {
Michal Vaskoa91d87e2021-10-19 11:58:57 +02001400 l = ds_unres->leafrefs.objs[i];
Radek Krejci2efc45b2020-12-22 16:25:44 +01001401
Michal Vasko405cc9e2020-12-01 12:01:27 +01001402 /* store pointer to the real type */
aPiecek732cd142021-07-07 16:29:59 +02001403 v = 0;
Michal Vaskoc130e162021-10-19 11:30:00 +02001404 while ((lref = lys_type_leafref_next(l->node, &v))) {
aPiecek732cd142021-07-07 16:29:59 +02001405 for (typeiter = lref->realtype;
Michal Vasko405cc9e2020-12-01 12:01:27 +01001406 typeiter->basetype == LY_TYPE_LEAFREF;
1407 typeiter = ((struct lysc_type_leafref *)typeiter)->realtype) {}
aPiecek732cd142021-07-07 16:29:59 +02001408 lref->realtype = typeiter;
Michal Vasko405cc9e2020-12-01 12:01:27 +01001409 }
1410
Michal Vaskoa23e1d92021-07-13 12:04:16 +02001411 /* If 'goto' will be used on the 'resolve_all' label, then
aPiecekd7bd52d2021-07-08 08:59:59 +02001412 * the current leafref will not be processed again.
1413 */
1414 processed_leafrefs++;
Michal Vasko405cc9e2020-12-01 12:01:27 +01001415 }
1416
Michal Vaskoc130e162021-10-19 11:30:00 +02001417 /* check when */
1418 while (ds_unres->whens.count) {
Michal Vaskoa91d87e2021-10-19 11:58:57 +02001419 i = ds_unres->whens.count - 1;
1420 node = ds_unres->whens.objs[i];
Michal Vasko405cc9e2020-12-01 12:01:27 +01001421 cctx.cur_mod = node->module;
1422 cctx.pmod = node->module->parsed;
1423
Radek Krejciddace2c2021-01-08 11:30:56 +01001424 LOG_LOCSET(node, NULL, NULL, NULL);
Michal Vaskoc130e162021-10-19 11:30:00 +02001425 ret = lys_compile_unres_when(&cctx, node, unres);
Radek Krejciddace2c2021-01-08 11:30:56 +01001426 LOG_LOCBACK(1, 0, 0, 0);
Michal Vasko7213ac52021-06-15 11:52:13 +02001427 LY_CHECK_RET(ret);
Michal Vasko405cc9e2020-12-01 12:01:27 +01001428
Michal Vaskoa91d87e2021-10-19 11:58:57 +02001429 ly_set_rm_index(&ds_unres->whens, i, NULL);
Michal Vaskoc130e162021-10-19 11:30:00 +02001430 }
1431
1432 /* check must */
1433 while (ds_unres->musts.count) {
Michal Vaskoa91d87e2021-10-19 11:58:57 +02001434 i = ds_unres->musts.count - 1;
1435 struct lysc_unres_must *m = ds_unres->musts.objs[i];
Michal Vaskoc130e162021-10-19 11:30:00 +02001436 cctx.cur_mod = m->node->module;
1437 cctx.pmod = m->node->module->parsed;
1438
1439 LOG_LOCSET(m->node, NULL, NULL, NULL);
1440 ret = lys_compile_unres_must(&cctx, m->node, m->local_mods, unres);
1441 LOG_LOCBACK(1, 0, 0, 0);
1442 LY_CHECK_RET(ret);
1443
1444 lysc_unres_must_free(m);
Michal Vaskoa91d87e2021-10-19 11:58:57 +02001445 ly_set_rm_index(&ds_unres->musts, i, NULL);
Michal Vasko405cc9e2020-12-01 12:01:27 +01001446 }
1447
Michal Vaskof4fa90d2021-11-11 15:05:19 +01001448 /* remove disabled enums/bits */
Michal Vaskocc2d75e2021-11-22 15:58:26 +01001449 while (ds_unres->disabled_bitenums.count) {
1450 i = ds_unres->disabled_bitenums.count - 1;
Michal Vaskof4fa90d2021-11-11 15:05:19 +01001451 node = ds_unres->disabled_bitenums.objs[i];
1452 cctx.cur_mod = node->module;
1453 cctx.pmod = node->module->parsed;
1454
1455 LOG_LOCSET(node, NULL, NULL, NULL);
1456 ret = lys_compile_unres_disabled_bitenum(&cctx, (struct lysc_node_leaf *)node);
1457 LOG_LOCBACK(1, 0, 0, 0);
1458 LY_CHECK_RET(ret);
1459
1460 ly_set_rm_index(&ds_unres->disabled_bitenums, i, NULL);
1461 }
1462
Michal Vasko405cc9e2020-12-01 12:01:27 +01001463 /* finish incomplete default values compilation */
Michal Vaskof4258e12021-06-15 12:11:42 +02001464 while (ds_unres->dflts.count) {
Michal Vaskoa91d87e2021-10-19 11:58:57 +02001465 i = ds_unres->dflts.count - 1;
1466 struct lysc_unres_dflt *r = ds_unres->dflts.objs[i];
Michal Vasko405cc9e2020-12-01 12:01:27 +01001467 cctx.cur_mod = r->leaf->module;
1468 cctx.pmod = r->leaf->module->parsed;
1469
Michal Vasko14ed9cd2021-01-28 14:16:25 +01001470 LOG_LOCSET(&r->leaf->node, NULL, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +01001471 if (r->leaf->nodetype == LYS_LEAF) {
1472 ret = lys_compile_unres_leaf_dlft(&cctx, r->leaf, r->dflt, unres);
1473 } else {
1474 ret = lys_compile_unres_llist_dflts(&cctx, r->llist, r->dflt, r->dflts, unres);
1475 }
Radek Krejciddace2c2021-01-08 11:30:56 +01001476 LOG_LOCBACK(1, 0, 0, 0);
Michal Vasko7213ac52021-06-15 11:52:13 +02001477 LY_CHECK_RET(ret);
Radek Krejci2efc45b2020-12-22 16:25:44 +01001478
1479 lysc_unres_dflt_free(ctx, r);
Michal Vaskoa91d87e2021-10-19 11:58:57 +02001480 ly_set_rm_index(&ds_unres->dflts, i, NULL);
Michal Vasko405cc9e2020-12-01 12:01:27 +01001481 }
1482
Michal Vasko40c158c2021-04-28 17:01:03 +02001483 /* some unres items may have been added */
aPiecekc6526b42021-07-12 15:21:39 +02001484 if ((processed_leafrefs != ds_unres->leafrefs.count) || ds_unres->disabled_leafrefs.count ||
Michal Vaskoc130e162021-10-19 11:30:00 +02001485 ds_unres->whens.count || ds_unres->musts.count || ds_unres->dflts.count) {
aPiecekd7bd52d2021-07-08 08:59:59 +02001486 goto resolve_all;
Michal Vasko405cc9e2020-12-01 12:01:27 +01001487 }
1488
Michal Vasko30ab8e72021-04-19 12:47:52 +02001489 /* finally, remove all disabled nodes */
Michal Vaskof4258e12021-06-15 12:11:42 +02001490 for (i = 0; i < ds_unres->disabled.count; ++i) {
1491 node = ds_unres->disabled.snodes[i];
Michal Vasko30ab8e72021-04-19 12:47:52 +02001492 if (node->flags & LYS_KEY) {
1493 LOG_LOCSET(node, NULL, NULL, NULL);
Michal Vaskoe02e7402021-07-23 08:29:28 +02001494 LOGVAL(ctx, LYVE_REFERENCE, "Key \"%s\" is disabled.", node->name);
Michal Vasko30ab8e72021-04-19 12:47:52 +02001495 LOG_LOCBACK(1, 0, 0, 0);
1496 return LY_EVALID;
1497 }
1498
1499 lysc_node_free(ctx, node, 1);
1500 }
1501
aPiecekd7bd52d2021-07-08 08:59:59 +02001502 /* also check if the leafref target has not been disabled */
1503 for (i = 0; i < ds_unres->leafrefs.count; ++i) {
Michal Vaskoa91d87e2021-10-19 11:58:57 +02001504 l = ds_unres->leafrefs.objs[i];
Michal Vaskoc130e162021-10-19 11:30:00 +02001505 cctx.cur_mod = l->node->module;
1506 cctx.pmod = l->node->module->parsed;
aPiecekd7bd52d2021-07-08 08:59:59 +02001507
1508 v = 0;
Michal Vaskoc130e162021-10-19 11:30:00 +02001509 while ((lref = lys_type_leafref_next(l->node, &v))) {
1510 ret = ly_path_compile_leafref(cctx.ctx, l->node, NULL, lref->path,
1511 (l->node->flags & LYS_IS_OUTPUT) ? LY_PATH_OPER_OUTPUT : LY_PATH_OPER_INPUT, LY_PATH_TARGET_MANY,
aPiecekd7bd52d2021-07-08 08:59:59 +02001512 LY_VALUE_SCHEMA_RESOLVED, lref->prefixes, &path);
Michal Vaskoc130e162021-10-19 11:30:00 +02001513 ly_path_free(l->node->module->ctx, path);
aPiecekd7bd52d2021-07-08 08:59:59 +02001514
1515 assert(ret != LY_ERECOMPILE);
1516 if (ret) {
Michal Vaskoc130e162021-10-19 11:30:00 +02001517 LOG_LOCSET(l->node, NULL, NULL, NULL);
Michal Vaskoe02e7402021-07-23 08:29:28 +02001518 LOGVAL(ctx, LYVE_REFERENCE, "Target of leafref \"%s\" cannot be referenced because it is disabled.",
Michal Vaskoc130e162021-10-19 11:30:00 +02001519 l->node->name);
aPiecekd7bd52d2021-07-08 08:59:59 +02001520 LOG_LOCBACK(1, 0, 0, 0);
1521 return LY_EVALID;
1522 }
1523 }
1524 }
1525
Michal Vasko405cc9e2020-12-01 12:01:27 +01001526 return LY_SUCCESS;
1527}
1528
Michal Vaskof4258e12021-06-15 12:11:42 +02001529/**
1530 * @brief Erase dep set unres.
1531 *
1532 * @param[in] ctx libyang context.
1533 * @param[in] unres Global unres structure with the sets to resolve.
1534 */
1535static void
1536lys_compile_unres_depset_erase(const struct ly_ctx *ctx, struct lys_glob_unres *unres)
Michal Vasko405cc9e2020-12-01 12:01:27 +01001537{
1538 uint32_t i;
1539
Michal Vaskoc130e162021-10-19 11:30:00 +02001540 ly_set_erase(&unres->ds_unres.whens, NULL);
1541 for (i = 0; i < unres->ds_unres.musts.count; ++i) {
1542 lysc_unres_must_free(unres->ds_unres.musts.objs[i]);
1543 }
1544 ly_set_erase(&unres->ds_unres.musts, NULL);
1545 ly_set_erase(&unres->ds_unres.leafrefs, free);
Michal Vaskof4258e12021-06-15 12:11:42 +02001546 for (i = 0; i < unres->ds_unres.dflts.count; ++i) {
1547 lysc_unres_dflt_free(ctx, unres->ds_unres.dflts.objs[i]);
Michal Vaskodf6319c2021-06-10 14:41:05 +02001548 }
Michal Vaskof4258e12021-06-15 12:11:42 +02001549 ly_set_erase(&unres->ds_unres.dflts, NULL);
Michal Vaskof4258e12021-06-15 12:11:42 +02001550 ly_set_erase(&unres->ds_unres.disabled, NULL);
Michal Vaskof4fa90d2021-11-11 15:05:19 +01001551 ly_set_erase(&unres->ds_unres.disabled_leafrefs, free);
1552 ly_set_erase(&unres->ds_unres.disabled_bitenums, NULL);
Michal Vaskof4258e12021-06-15 12:11:42 +02001553}
1554
Michal Vasko709f9a52021-07-21 10:51:59 +02001555/**
1556 * @brief Compile all flagged modules in a dependency set, recursively if recompilation is needed.
1557 *
1558 * @param[in] ctx libyang context.
1559 * @param[in] dep_set Dependency set to compile.
1560 * @param[in,out] unres Global unres to use.
1561 * @return LY_ERR value.
1562 */
1563static LY_ERR
1564lys_compile_depset_r(struct ly_ctx *ctx, struct ly_set *dep_set, struct lys_glob_unres *unres)
Michal Vaskof4258e12021-06-15 12:11:42 +02001565{
1566 LY_ERR ret = LY_SUCCESS;
1567 struct lys_module *mod;
1568 uint32_t i;
1569
1570 for (i = 0; i < dep_set->count; ++i) {
1571 mod = dep_set->objs[i];
1572 if (!mod->to_compile) {
1573 /* skip */
1574 continue;
1575 }
1576 assert(mod->implemented);
1577
1578 /* free the compiled module, if any */
1579 lysc_module_free(mod->compiled);
1580 mod->compiled = NULL;
1581
1582 /* (re)compile the module */
1583 LY_CHECK_GOTO(ret = lys_compile(mod, &unres->ds_unres), cleanup);
Michal Vasko405cc9e2020-12-01 12:01:27 +01001584 }
Michal Vaskof4258e12021-06-15 12:11:42 +02001585
1586 /* resolve dep set unres */
1587 ret = lys_compile_unres_depset(ctx, unres);
1588 if (ret == LY_ERECOMPILE) {
1589 /* new module is implemented, discard current dep set unres and recompile the whole dep set */
1590 lys_compile_unres_depset_erase(ctx, unres);
Michal Vasko709f9a52021-07-21 10:51:59 +02001591 return lys_compile_depset_r(ctx, dep_set, unres);
Michal Vaskof4258e12021-06-15 12:11:42 +02001592 } else if (ret) {
1593 /* error */
1594 goto cleanup;
1595 }
1596
1597 /* success, unset the flags of all the modules in the dep set */
1598 for (i = 0; i < dep_set->count; ++i) {
1599 mod = dep_set->objs[i];
1600 mod->to_compile = 0;
1601 }
1602
1603cleanup:
1604 lys_compile_unres_depset_erase(ctx, unres);
1605 return ret;
Michal Vasko405cc9e2020-12-01 12:01:27 +01001606}
1607
Michal Vasko709f9a52021-07-21 10:51:59 +02001608LY_ERR
1609lys_compile_depset_all(struct ly_ctx *ctx, struct lys_glob_unres *unres)
1610{
1611 uint32_t i;
1612
1613 for (i = 0; i < unres->dep_sets.count; ++i) {
1614 LY_CHECK_RET(lys_compile_depset_r(ctx, unres->dep_sets.objs[i], unres));
1615 }
1616
1617 return LY_SUCCESS;
1618}
1619
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001620/**
Michal Vasko405cc9e2020-12-01 12:01:27 +01001621 * @brief Finish compilation of all the module unres sets in a compile context.
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001622 *
1623 * @param[in] ctx Compile context with unres sets.
1624 * @return LY_ERR value.
1625 */
1626static LY_ERR
Michal Vasko405cc9e2020-12-01 12:01:27 +01001627lys_compile_unres_mod(struct lysc_ctx *ctx)
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001628{
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001629 struct lysc_augment *aug;
1630 struct lysc_deviation *dev;
Michal Vasko1ade6f12021-04-19 11:32:45 +02001631 struct lys_module *orig_mod = ctx->cur_mod;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001632 uint32_t i;
1633
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001634 /* check that all augments were applied */
1635 for (i = 0; i < ctx->augs.count; ++i) {
1636 aug = ctx->augs.objs[i];
Michal Vasko1ade6f12021-04-19 11:32:45 +02001637 ctx->cur_mod = aug->aug_pmod->mod;
Radek Krejci2efc45b2020-12-22 16:25:44 +01001638 lysc_update_path(ctx, NULL, "{augment}");
1639 lysc_update_path(ctx, NULL, aug->nodeid->expr);
1640 LOGVAL(ctx->ctx, LYVE_REFERENCE, "Augment target node \"%s\" from module \"%s\" was not found.",
Michal Vasko28fe5f62021-03-03 16:37:39 +01001641 aug->nodeid->expr, LYSP_MODULE_NAME(aug->aug_pmod));
Michal Vasko1ade6f12021-04-19 11:32:45 +02001642 ctx->cur_mod = orig_mod;
Radek Krejci2efc45b2020-12-22 16:25:44 +01001643 lysc_update_path(ctx, NULL, NULL);
1644 lysc_update_path(ctx, NULL, NULL);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001645 }
1646 if (ctx->augs.count) {
1647 return LY_ENOTFOUND;
1648 }
1649
1650 /* check that all deviations were applied */
1651 for (i = 0; i < ctx->devs.count; ++i) {
1652 dev = ctx->devs.objs[i];
Radek Krejci2efc45b2020-12-22 16:25:44 +01001653 lysc_update_path(ctx, NULL, "{deviation}");
1654 lysc_update_path(ctx, NULL, dev->nodeid->expr);
1655 LOGVAL(ctx->ctx, LYVE_REFERENCE, "Deviation(s) target node \"%s\" from module \"%s\" was not found.",
1656 dev->nodeid->expr, LYSP_MODULE_NAME(dev->dev_pmods[0]));
1657 lysc_update_path(ctx, NULL, NULL);
1658 lysc_update_path(ctx, NULL, NULL);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001659 }
1660 if (ctx->devs.count) {
1661 return LY_ENOTFOUND;
1662 }
1663
1664 return LY_SUCCESS;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001665}
1666
1667/**
Michal Vasko405cc9e2020-12-01 12:01:27 +01001668 * @brief Erase all the module unres sets in a compile context.
1669 *
1670 * @param[in] ctx Compile context with unres sets.
1671 * @param[in] error Whether the compilation finished with an error or not.
1672 */
1673static void
1674lys_compile_unres_mod_erase(struct lysc_ctx *ctx, ly_bool error)
1675{
1676 uint32_t i;
1677
1678 ly_set_erase(&ctx->groupings, NULL);
1679 ly_set_erase(&ctx->tpdf_chain, NULL);
Michal Vasko405cc9e2020-12-01 12:01:27 +01001680
1681 if (!error) {
1682 /* there can be no leftover deviations or augments */
1683 LY_CHECK_ERR_RET(ctx->augs.count, LOGINT(ctx->ctx), );
1684 LY_CHECK_ERR_RET(ctx->devs.count, LOGINT(ctx->ctx), );
1685
1686 ly_set_erase(&ctx->augs, NULL);
1687 ly_set_erase(&ctx->devs, NULL);
1688 ly_set_erase(&ctx->uses_augs, NULL);
1689 ly_set_erase(&ctx->uses_rfns, NULL);
1690 } else {
1691 for (i = 0; i < ctx->augs.count; ++i) {
1692 lysc_augment_free(ctx->ctx, ctx->augs.objs[i]);
1693 }
1694 ly_set_erase(&ctx->augs, NULL);
1695 for (i = 0; i < ctx->devs.count; ++i) {
1696 lysc_deviation_free(ctx->ctx, ctx->devs.objs[i]);
1697 }
1698 ly_set_erase(&ctx->devs, NULL);
1699 for (i = 0; i < ctx->uses_augs.count; ++i) {
1700 lysc_augment_free(ctx->ctx, ctx->uses_augs.objs[i]);
1701 }
1702 ly_set_erase(&ctx->uses_augs, NULL);
1703 for (i = 0; i < ctx->uses_rfns.count; ++i) {
1704 lysc_refine_free(ctx->ctx, ctx->uses_rfns.objs[i]);
1705 }
1706 ly_set_erase(&ctx->uses_rfns, NULL);
1707 }
1708}
1709
Michal Vaskod39bea42021-06-14 10:42:49 +02001710LY_ERR
Michal Vaskof4258e12021-06-15 12:11:42 +02001711lys_compile(struct lys_module *mod, struct lys_depset_unres *unres)
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001712{
1713 struct lysc_ctx ctx = {0};
Michal Vasko0b395e12021-04-23 13:43:07 +02001714 struct lysc_module *mod_c = NULL;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001715 struct lysp_module *sp;
1716 struct lysp_submodule *submod;
1717 struct lysp_node *pnode;
Radek Krejci2a9fc652021-01-22 17:44:34 +01001718 struct lysp_node_grp *grp;
1719 LY_ARRAY_COUNT_TYPE u;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001720 LY_ERR ret = LY_SUCCESS;
1721
1722 LY_CHECK_ARG_RET(NULL, mod, mod->parsed, !mod->compiled, mod->ctx, LY_EINVAL);
1723
Michal Vaskof4258e12021-06-15 12:11:42 +02001724 assert(mod->implemented && mod->to_compile);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001725
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001726 sp = mod->parsed;
1727
1728 ctx.ctx = mod->ctx;
1729 ctx.cur_mod = mod;
1730 ctx.pmod = sp;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001731 ctx.path_len = 1;
1732 ctx.path[0] = '/';
Michal Vasko405cc9e2020-12-01 12:01:27 +01001733 ctx.unres = unres;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001734
Michal Vasko0b395e12021-04-23 13:43:07 +02001735 ++mod->ctx->change_count;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001736 mod->compiled = mod_c = calloc(1, sizeof *mod_c);
1737 LY_CHECK_ERR_RET(!mod_c, LOGMEM(mod->ctx), LY_EMEM);
1738 mod_c->mod = mod;
1739
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001740 /* compile augments and deviations of our module from other modules so they can be applied during compilation */
Michal Vasko1ccbf542021-04-19 11:35:00 +02001741 LY_CHECK_GOTO(ret = lys_precompile_own_augments(&ctx), cleanup);
1742 LY_CHECK_GOTO(ret = lys_precompile_own_deviations(&ctx), cleanup);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001743
1744 /* data nodes */
1745 LY_LIST_FOR(sp->data, pnode) {
Michal Vasko1ccbf542021-04-19 11:35:00 +02001746 LY_CHECK_GOTO(ret = lys_compile_node(&ctx, pnode, NULL, 0, NULL), cleanup);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001747 }
1748
Radek Krejci2a9fc652021-01-22 17:44:34 +01001749 /* top-level RPCs */
1750 LY_LIST_FOR((struct lysp_node *)sp->rpcs, pnode) {
Michal Vasko1ccbf542021-04-19 11:35:00 +02001751 LY_CHECK_GOTO(ret = lys_compile_node(&ctx, pnode, NULL, 0, NULL), cleanup);
Radek Krejci2a9fc652021-01-22 17:44:34 +01001752 }
1753
1754 /* top-level notifications */
1755 LY_LIST_FOR((struct lysp_node *)sp->notifs, pnode) {
Michal Vasko1ccbf542021-04-19 11:35:00 +02001756 LY_CHECK_GOTO(ret = lys_compile_node(&ctx, pnode, NULL, 0, NULL), cleanup);
Radek Krejci2a9fc652021-01-22 17:44:34 +01001757 }
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001758
1759 /* extension instances */
Michal Vasko1ccbf542021-04-19 11:35:00 +02001760 COMPILE_EXTS_GOTO(&ctx, sp->exts, mod_c->exts, mod_c, ret, cleanup);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001761
1762 /* the same for submodules */
1763 LY_ARRAY_FOR(sp->includes, u) {
1764 submod = sp->includes[u].submodule;
1765 ctx.pmod = (struct lysp_module *)submod;
1766
1767 LY_LIST_FOR(submod->data, pnode) {
1768 ret = lys_compile_node(&ctx, pnode, NULL, 0, NULL);
Michal Vasko1ccbf542021-04-19 11:35:00 +02001769 LY_CHECK_GOTO(ret, cleanup);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001770 }
1771
Radek Krejci2a9fc652021-01-22 17:44:34 +01001772 LY_LIST_FOR((struct lysp_node *)submod->rpcs, pnode) {
1773 ret = lys_compile_node(&ctx, pnode, NULL, 0, NULL);
Michal Vasko1ccbf542021-04-19 11:35:00 +02001774 LY_CHECK_GOTO(ret, cleanup);
Radek Krejci2a9fc652021-01-22 17:44:34 +01001775 }
1776
1777 LY_LIST_FOR((struct lysp_node *)submod->notifs, pnode) {
1778 ret = lys_compile_node(&ctx, pnode, NULL, 0, NULL);
Michal Vasko1ccbf542021-04-19 11:35:00 +02001779 LY_CHECK_GOTO(ret, cleanup);
Radek Krejci2a9fc652021-01-22 17:44:34 +01001780 }
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001781
Michal Vasko1ccbf542021-04-19 11:35:00 +02001782 COMPILE_EXTS_GOTO(&ctx, submod->exts, mod_c->exts, mod_c, ret, cleanup);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001783 }
Michal Vasko12606ee2020-11-25 17:05:11 +01001784 ctx.pmod = sp;
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001785
1786 /* validate non-instantiated groupings from the parsed schema,
1787 * without it we would accept even the schemas with invalid grouping specification */
Michal Vasko7c565922021-06-10 14:58:27 +02001788 ctx.compile_opts |= LYS_COMPILE_GROUPING;
Radek Krejci2a9fc652021-01-22 17:44:34 +01001789 LY_LIST_FOR(sp->groupings, grp) {
1790 if (!(grp->flags & LYS_USED_GRP)) {
Michal Vasko1ccbf542021-04-19 11:35:00 +02001791 LY_CHECK_GOTO(ret = lys_compile_grouping(&ctx, NULL, grp), cleanup);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001792 }
1793 }
1794 LY_LIST_FOR(sp->data, pnode) {
Radek Krejci2a9fc652021-01-22 17:44:34 +01001795 LY_LIST_FOR((struct lysp_node_grp *)lysp_node_groupings(pnode), grp) {
1796 if (!(grp->flags & LYS_USED_GRP)) {
Michal Vasko1ccbf542021-04-19 11:35:00 +02001797 LY_CHECK_GOTO(ret = lys_compile_grouping(&ctx, pnode, grp), cleanup);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001798 }
1799 }
1800 }
1801 LY_ARRAY_FOR(sp->includes, u) {
1802 submod = sp->includes[u].submodule;
1803 ctx.pmod = (struct lysp_module *)submod;
1804
Radek Krejci2a9fc652021-01-22 17:44:34 +01001805 LY_LIST_FOR(submod->groupings, grp) {
1806 if (!(grp->flags & LYS_USED_GRP)) {
Michal Vasko1ccbf542021-04-19 11:35:00 +02001807 LY_CHECK_GOTO(ret = lys_compile_grouping(&ctx, NULL, grp), cleanup);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001808 }
1809 }
1810 LY_LIST_FOR(submod->data, pnode) {
Radek Krejci2a9fc652021-01-22 17:44:34 +01001811 LY_LIST_FOR((struct lysp_node_grp *)lysp_node_groupings(pnode), grp) {
1812 if (!(grp->flags & LYS_USED_GRP)) {
Michal Vasko1ccbf542021-04-19 11:35:00 +02001813 LY_CHECK_GOTO(ret = lys_compile_grouping(&ctx, pnode, grp), cleanup);
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001814 }
1815 }
1816 }
1817 }
1818 ctx.pmod = sp;
1819
Radek Krejciddace2c2021-01-08 11:30:56 +01001820 LOG_LOCBACK(0, 0, 1, 0);
Radek Krejci2efc45b2020-12-22 16:25:44 +01001821
Michal Vasko405cc9e2020-12-01 12:01:27 +01001822 /* finish compilation for all unresolved module items in the context */
Michal Vasko1ccbf542021-04-19 11:35:00 +02001823 LY_CHECK_GOTO(ret = lys_compile_unres_mod(&ctx), cleanup);
Michal Vasko12606ee2020-11-25 17:05:11 +01001824
Michal Vasko1ccbf542021-04-19 11:35:00 +02001825cleanup:
Radek Krejciddace2c2021-01-08 11:30:56 +01001826 LOG_LOCBACK(0, 0, 1, 0);
Michal Vasko1ccbf542021-04-19 11:35:00 +02001827 lys_compile_unres_mod_erase(&ctx, ret);
1828 if (ret) {
Michal Vasko1ccbf542021-04-19 11:35:00 +02001829 lysc_module_free(mod_c);
1830 mod->compiled = NULL;
1831 }
Michal Vasko1a7a7bd2020-10-16 14:39:15 +02001832 return ret;
1833}
Michal Vasko65333882021-06-10 14:12:16 +02001834
aPiecek6b3d5422021-07-30 15:55:43 +02001835LY_ERR
Michal Vaskofa5a7d72021-06-15 11:41:20 +02001836lys_compile_identities(struct lys_module *mod)
1837{
1838 struct lysc_ctx ctx = {0};
1839 struct lysp_submodule *submod;
1840 LY_ARRAY_COUNT_TYPE u;
1841
aPiecek6b3d5422021-07-30 15:55:43 +02001842 /* pre-compile identities of the module and any submodules */
1843 LY_CHECK_RET(lys_identity_precompile(NULL, mod->ctx, mod->parsed, mod->parsed->identities, &mod->identities));
1844 LY_ARRAY_FOR(mod->parsed->includes, u) {
1845 submod = mod->parsed->includes[u].submodule;
1846 LY_CHECK_RET(lys_identity_precompile(NULL, mod->ctx, (struct lysp_module *)submod, submod->identities, &mod->identities));
1847 }
1848
Michal Vaskofa5a7d72021-06-15 11:41:20 +02001849 /* prepare context */
1850 ctx.ctx = mod->ctx;
1851 ctx.cur_mod = mod;
1852 ctx.pmod = mod->parsed;
1853 ctx.path_len = 1;
1854 ctx.path[0] = '/';
1855
1856 if (mod->parsed->identities) {
1857 LY_CHECK_RET(lys_compile_identities_derived(&ctx, mod->parsed->identities, &mod->identities));
1858 }
1859 lysc_update_path(&ctx, NULL, "{submodule}");
1860 LY_ARRAY_FOR(mod->parsed->includes, u) {
1861 submod = mod->parsed->includes[u].submodule;
1862 if (submod->identities) {
1863 ctx.pmod = (struct lysp_module *)submod;
1864 lysc_update_path(&ctx, NULL, submod->name);
1865 LY_CHECK_RET(lys_compile_identities_derived(&ctx, submod->identities, &mod->identities));
1866 lysc_update_path(&ctx, NULL, NULL);
1867 }
1868 }
1869 lysc_update_path(&ctx, NULL, NULL);
1870
1871 return LY_SUCCESS;
1872}
1873
1874/**
Michal Vasko65333882021-06-10 14:12:16 +02001875 * @brief Check whether a module does not have any (recursive) compiled import.
1876 *
1877 * @param[in] mod Module to examine.
1878 * @return LY_SUCCESS on success.
Michal Vaskof4258e12021-06-15 12:11:42 +02001879 * @return LY_ERECOMPILE on required recompilation of the dep set.
Michal Vasko65333882021-06-10 14:12:16 +02001880 * @return LY_ERR on error.
1881 */
1882static LY_ERR
1883lys_has_compiled_import_r(struct lys_module *mod)
1884{
1885 LY_ARRAY_COUNT_TYPE u;
Michal Vaskoe7927122021-06-15 12:00:04 +02001886 struct lys_module *m;
Michal Vasko65333882021-06-10 14:12:16 +02001887
1888 LY_ARRAY_FOR(mod->parsed->imports, u) {
Michal Vaskoe7927122021-06-15 12:00:04 +02001889 m = mod->parsed->imports[u].module;
1890 if (!m->implemented) {
Michal Vasko65333882021-06-10 14:12:16 +02001891 continue;
1892 }
1893
Michal Vaskoe7927122021-06-15 12:00:04 +02001894 if (!m->to_compile) {
Michal Vaskod39bea42021-06-14 10:42:49 +02001895 /* module was not/will not be compiled in this compilation (so disabled nodes are not present) */
Michal Vaskof4258e12021-06-15 12:11:42 +02001896 m->to_compile = 1;
Michal Vasko65333882021-06-10 14:12:16 +02001897 return LY_ERECOMPILE;
1898 }
1899
1900 /* recursive */
Michal Vaskoe7927122021-06-15 12:00:04 +02001901 LY_CHECK_RET(lys_has_compiled_import_r(m));
Michal Vasko65333882021-06-10 14:12:16 +02001902 }
1903
1904 return LY_SUCCESS;
1905}
1906
1907LY_ERR
1908lys_implement(struct lys_module *mod, const char **features, struct lys_glob_unres *unres)
1909{
1910 LY_ERR ret;
1911 struct lys_module *m;
1912
1913 assert(!mod->implemented);
1914
Michal Vaskofda52ac2022-01-21 14:13:40 +01001915 /* check collision with other implemented revision */
Michal Vasko65333882021-06-10 14:12:16 +02001916 m = ly_ctx_get_module_implemented(mod->ctx, mod->name);
1917 if (m) {
1918 assert(m != mod);
Michal Vaskofda52ac2022-01-21 14:13:40 +01001919 if (!strcmp(mod->name, "yang") && (strcmp(m->revision, mod->revision) > 0)) {
1920 /* special case for newer internal module, continue */
1921 LOGVRB("Internal module \"%s@%s\" is already implemented in revision \"%s\", using it instead.",
1922 mod->name, mod->revision ? mod->revision : "<none>", m->revision ? m->revision : "<none>");
1923 } else {
1924 LOGERR(mod->ctx, LY_EDENIED, "Module \"%s@%s\" is already implemented in revision \"%s\".",
1925 mod->name, mod->revision ? mod->revision : "<none>", m->revision ? m->revision : "<none>");
1926 return LY_EDENIED;
1927 }
Michal Vasko65333882021-06-10 14:12:16 +02001928 }
1929
1930 /* set features */
1931 ret = lys_set_features(mod->parsed, features);
1932 if (ret && (ret != LY_EEXIST)) {
1933 return ret;
1934 }
1935
Michal Vasko65333882021-06-10 14:12:16 +02001936 /*
1937 * mark the module implemented, which means
1938 * 1) to (re)compile it only ::lys_compile() call is needed
1939 * 2) its compilation will never cause new modules to be implemented (::lys_compile() does not return ::LY_ERECOMPILE)
1940 * but there can be some unres items added that do
1941 */
1942 mod->implemented = 1;
1943
Michal Vaskoa9f807e2021-06-15 12:07:16 +02001944 /* this module is compiled in this compilation */
1945 mod->to_compile = 1;
1946
Michal Vasko65333882021-06-10 14:12:16 +02001947 /* add the module into newly implemented module set */
1948 LY_CHECK_RET(ly_set_add(&unres->implementing, mod, 1, NULL));
1949
Michal Vaskoa9f807e2021-06-15 12:07:16 +02001950 /* mark target modules with our augments and deviations */
1951 LY_CHECK_RET(lys_precompile_augments_deviations(mod, unres));
Michal Vasko65333882021-06-10 14:12:16 +02001952
Michal Vaskod39bea42021-06-14 10:42:49 +02001953 /* check whether this module may reference any modules compiled previously */
1954 LY_CHECK_RET(lys_has_compiled_import_r(mod));
Michal Vasko65333882021-06-10 14:12:16 +02001955
Michal Vasko65333882021-06-10 14:12:16 +02001956 return LY_SUCCESS;
1957}