blob: 66b62e58cc680f0e4759060284cdc331257b6c56 [file] [log] [blame]
Radek Krejci0af5f5d2018-09-07 15:00:30 +02001/**
2 * @file context.c
3 * @author Radek Krejci <rkrejci@cesnet.cz>
4 * @brief Context implementations
5 *
6 * Copyright (c) 2015 - 2018 CESNET, z.s.p.o.
7 *
8 * This source code is licensed under BSD 3-Clause License (the "License").
9 * You may not use this file except in compliance with the License.
10 * You may obtain a copy of the License at
11 *
12 * https://opensource.org/licenses/BSD-3-Clause
13 */
14
Radek Krejcib7db73a2018-10-24 14:18:40 +020015#include "common.h"
16
Radek Krejci0af5f5d2018-09-07 15:00:30 +020017#include <errno.h>
Radek Krejci7ada9a02018-09-07 15:34:05 +020018#include <limits.h>
19#include <stdlib.h>
20#include <string.h>
Radek Krejci0e212402018-09-20 11:29:38 +020021#include <sys/stat.h>
22#include <sys/types.h>
Radek Krejci0af5f5d2018-09-07 15:00:30 +020023#include <unistd.h>
24
Radek Krejci0af5f5d2018-09-07 15:00:30 +020025#include "context.h"
Radek Krejci86d106e2018-10-18 09:53:19 +020026#include "tree_schema_internal.h"
Radek Krejciad573502018-09-07 15:26:55 +020027#include "libyang.h"
Radek Krejci0af5f5d2018-09-07 15:00:30 +020028
Radek Krejci86d106e2018-10-18 09:53:19 +020029#define LY_INTERNAL_MODS_COUNT 6
Radek Krejci0af5f5d2018-09-07 15:00:30 +020030
Radek Krejcif3f47842018-11-15 11:22:15 +010031#include "../models/ietf-yang-metadata@2016-08-05.h"
32#include "../models/yang@2017-02-20.h"
33#include "../models/ietf-inet-types@2013-07-15.h"
34#include "../models/ietf-yang-types@2013-07-15.h"
35#include "../models/ietf-datastores@2017-08-17.h"
36#include "../models/ietf-yang-library@2018-01-17.h"
Radek Krejci0af5f5d2018-09-07 15:00:30 +020037#define IETF_YANG_LIB_REV "2018-01-17"
38
Radek Krejci0af5f5d2018-09-07 15:00:30 +020039static struct internal_modules_s {
40 const char *name;
41 const char *revision;
42 const char *data;
43 uint8_t implemented;
44 LYS_INFORMAT format;
45} internal_modules[LY_INTERNAL_MODS_COUNT] = {
Radek Krejci86d106e2018-10-18 09:53:19 +020046 {"ietf-yang-metadata", "2016-08-05", (const char*)ietf_yang_metadata_2016_08_05_yang, 0, LYS_IN_YANG},
47 {"yang", "2017-02-20", (const char*)yang_2017_02_20_yang, 1, LYS_IN_YANG},
48 {"ietf-inet-types", "2013-07-15", (const char*)ietf_inet_types_2013_07_15_yang, 0, LYS_IN_YANG},
49 {"ietf-yang-types", "2013-07-15", (const char*)ietf_yang_types_2013_07_15_yang, 0, LYS_IN_YANG},
Radek Krejci0af5f5d2018-09-07 15:00:30 +020050 /* ietf-datastores and ietf-yang-library must be right here at the end of the list! */
Radek Krejci86d106e2018-10-18 09:53:19 +020051 {"ietf-datastores", "2017-08-17", (const char*)ietf_datastores_2017_08_17_yang, 0, LYS_IN_YANG},
52 {"ietf-yang-library", IETF_YANG_LIB_REV, (const char*)ietf_yang_library_2018_01_17_yang, 1, LYS_IN_YANG}
Radek Krejci0af5f5d2018-09-07 15:00:30 +020053};
54
55API LY_ERR
56ly_ctx_set_searchdir(struct ly_ctx *ctx, const char *search_dir)
57{
Radek Krejci0e212402018-09-20 11:29:38 +020058 struct stat st;
Radek Krejci0af5f5d2018-09-07 15:00:30 +020059 char *new_dir = NULL;
Radek Krejci0e212402018-09-20 11:29:38 +020060 unsigned int u;
Radek Krejci0af5f5d2018-09-07 15:00:30 +020061
62 LY_CHECK_ARG_RET(ctx, ctx, LY_EINVAL);
63
64 if (search_dir) {
Radek Krejci0e212402018-09-20 11:29:38 +020065 LY_CHECK_ERR_RET(access(search_dir, R_OK | X_OK),
66 LOGERR(ctx, LY_ESYS, "Unable to use search directory \"%s\" (%s)", search_dir, strerror(errno)),
67 LY_EINVAL);
68 LY_CHECK_ERR_RET(stat(search_dir, &st),
69 LOGERR(ctx, LY_ESYS, "stat() failed for \"%s\" (%s)", search_dir, strerror(errno)),
70 LY_ESYS);
71 LY_CHECK_ERR_RET(!S_ISDIR(st.st_mode),
72 LOGERR(ctx, LY_ESYS, "Given search directory \"%s\" is not a directory.", search_dir),
73 LY_EINVAL);
Radek Krejci0af5f5d2018-09-07 15:00:30 +020074 new_dir = realpath(search_dir, NULL);
Radek Krejcia77e0e12018-09-20 12:39:15 +020075 LY_CHECK_ERR_RET(!new_dir,
76 LOGERR(ctx, LY_ESYS, "realpath() call failed for \"%s\" (%s).", search_dir, strerror(errno)),
77 LY_ESYS);
Radek Krejci0e212402018-09-20 11:29:38 +020078 /* avoid path duplication */
79 for (u = 0; u < ctx->search_paths.count; ++u) {
Radek Krejci14946ab2018-09-20 13:42:06 +020080 if (!strcmp(new_dir, ctx->search_paths.objs[u])) {
Radek Krejci0e212402018-09-20 11:29:38 +020081 free(new_dir);
Radek Krejci14946ab2018-09-20 13:42:06 +020082 return LY_EEXIST;
Radek Krejci0e212402018-09-20 11:29:38 +020083 }
84 }
85 if (ly_set_add(&ctx->search_paths, new_dir, LY_SET_OPT_USEASLIST) == -1) {
Radek Krejci0af5f5d2018-09-07 15:00:30 +020086 free(new_dir);
87 return LY_EMEM;
88 }
89
Radek Krejcie9e987e2018-10-31 12:50:27 +010090 /* new searchdir - possibly more latest revision available */
91 ly_ctx_reset_latests(ctx);
92
Radek Krejci0e212402018-09-20 11:29:38 +020093 return LY_SUCCESS;
Radek Krejci0af5f5d2018-09-07 15:00:30 +020094 } else {
95 /* consider that no change is not actually an error */
96 return LY_SUCCESS;
97 }
Radek Krejci0af5f5d2018-09-07 15:00:30 +020098}
99
100API const char * const *
101ly_ctx_get_searchdirs(const struct ly_ctx *ctx)
102{
Radek Krejci05026432018-09-20 12:13:43 +0200103 void **new;
104
Radek Krejci0af5f5d2018-09-07 15:00:30 +0200105 LY_CHECK_ARG_RET(ctx, ctx, NULL);
Radek Krejci05026432018-09-20 12:13:43 +0200106
107 if (ctx->search_paths.count == ctx->search_paths.size) {
108 /* not enough space for terminating NULL byte */
109 new = realloc(((struct ly_ctx *)ctx)->search_paths.objs, (ctx->search_paths.size + 8) * sizeof *ctx->search_paths.objs);
110 LY_CHECK_ERR_RET(!new, LOGMEM(NULL), NULL);
111 ((struct ly_ctx *)ctx)->search_paths.size += 8;
112 ((struct ly_ctx *)ctx)->search_paths.objs = new;
113 }
114 /* set terminating NULL byte to the strings list */
115 ctx->search_paths.objs[ctx->search_paths.count] = NULL;
116
Radek Krejci0af5f5d2018-09-07 15:00:30 +0200117 return (const char * const *)ctx->search_paths.objs;
118}
119
120API LY_ERR
Radek Krejci0759b792018-09-20 13:53:15 +0200121ly_ctx_unset_searchdirs(struct ly_ctx *ctx, const char *value)
Radek Krejci0af5f5d2018-09-07 15:00:30 +0200122{
Radek Krejci0759b792018-09-20 13:53:15 +0200123 unsigned int index;
124
Radek Krejcicd649072018-09-20 12:14:45 +0200125 LY_CHECK_ARG_RET(ctx, ctx, LY_EINVAL);
Radek Krejcicd649072018-09-20 12:14:45 +0200126
Michal Vaskob34480a2018-09-17 10:34:45 +0200127 if (!ctx->search_paths.count) {
Radek Krejci0af5f5d2018-09-07 15:00:30 +0200128 return LY_SUCCESS;
129 }
130
Radek Krejci0759b792018-09-20 13:53:15 +0200131 if (value) {
Radek Krejci0af5f5d2018-09-07 15:00:30 +0200132 /* remove specific search directory */
Radek Krejci0759b792018-09-20 13:53:15 +0200133 for (index = 0; index < ctx->search_paths.count; ++index) {
134 if (!strcmp(value, ctx->search_paths.objs[index])) {
135 break;
136 }
137 }
138 if (index == ctx->search_paths.count) {
139 LOGARG(ctx, value);
140 return LY_EINVAL;
141 } else {
142 return ly_set_rm_index(&ctx->search_paths, index, free);
143 }
Radek Krejci0af5f5d2018-09-07 15:00:30 +0200144 } else {
145 /* remove them all */
Radek Krejcia40f21b2018-09-18 10:42:08 +0200146 ly_set_erase(&ctx->search_paths, free);
Radek Krejci0af5f5d2018-09-07 15:00:30 +0200147 memset(&ctx->search_paths, 0, sizeof ctx->search_paths);
148 }
149
150 return LY_SUCCESS;
151}
152
153API LY_ERR
154ly_ctx_new(const char *search_dir, int options, struct ly_ctx **new_ctx)
155{
156 struct ly_ctx *ctx = NULL;
157 struct lys_module *module;
158 char *search_dir_list;
159 char *sep, *dir;
Radek Krejci86d106e2018-10-18 09:53:19 +0200160 int i;
Radek Krejci0af5f5d2018-09-07 15:00:30 +0200161 LY_ERR rc = LY_SUCCESS;
Radek Krejci0af5f5d2018-09-07 15:00:30 +0200162
163 ctx = calloc(1, sizeof *ctx);
Radek Krejciad573502018-09-07 15:26:55 +0200164 LY_CHECK_ERR_RET(!ctx, LOGMEM(NULL), LY_EMEM);
Radek Krejci0af5f5d2018-09-07 15:00:30 +0200165
166 /* dictionary */
167 lydict_init(&ctx->dict);
168
Radek Krejciad573502018-09-07 15:26:55 +0200169#if 0 /* TODO when plugins implemented */
Radek Krejci0af5f5d2018-09-07 15:00:30 +0200170 /* plugins */
171 ly_load_plugins();
Radek Krejciad573502018-09-07 15:26:55 +0200172#endif
Radek Krejci0af5f5d2018-09-07 15:00:30 +0200173
174 /* initialize thread-specific key */
Radek Krejciad573502018-09-07 15:26:55 +0200175 while ((pthread_key_create(&ctx->errlist_key, ly_err_free)) == EAGAIN);
Radek Krejci0af5f5d2018-09-07 15:00:30 +0200176
177 /* models list */
178 ctx->flags = options;
179 if (search_dir) {
180 search_dir_list = strdup(search_dir);
181 LY_CHECK_ERR_GOTO(!search_dir_list, LOGMEM(NULL); rc = LY_EMEM, error);
182
183 for (dir = search_dir_list; (sep = strchr(dir, ':')) != NULL && rc == LY_SUCCESS; dir = sep + 1) {
184 *sep = 0;
185 rc = ly_ctx_set_searchdir(ctx, dir);
Radek Krejci14946ab2018-09-20 13:42:06 +0200186 if (rc == LY_EEXIST) {
187 /* ignore duplication */
188 rc = LY_SUCCESS;
189 }
Radek Krejci0af5f5d2018-09-07 15:00:30 +0200190 }
191 if (*dir && rc == LY_SUCCESS) {
192 rc = ly_ctx_set_searchdir(ctx, dir);
Radek Krejci14946ab2018-09-20 13:42:06 +0200193 if (rc == LY_EEXIST) {
194 /* ignore duplication */
195 rc = LY_SUCCESS;
196 }
Radek Krejci0af5f5d2018-09-07 15:00:30 +0200197 }
198 free(search_dir_list);
199
200 /* If ly_ctx_set_searchdir() failed, the error is already logged. Just exit */
201 if (rc != LY_SUCCESS) {
202 goto error;
203 }
204 }
205 ctx->module_set_id = 1;
206
207 /* load internal modules */
Radek Krejci86d106e2018-10-18 09:53:19 +0200208 for (i = 0; i < ((options & LY_CTX_NOYANGLIBRARY) ? (LY_INTERNAL_MODS_COUNT - 2) : LY_INTERNAL_MODS_COUNT); i++) {
Radek Krejci0af5f5d2018-09-07 15:00:30 +0200209 module = (struct lys_module *)lys_parse_mem(ctx, internal_modules[i].data, internal_modules[i].format);
Radek Krejci0e75e6f2018-11-08 09:40:02 +0100210 LY_CHECK_ERR_GOTO(!module, rc = ly_errcode(ctx), error);
Radek Krejci0af5f5d2018-09-07 15:00:30 +0200211 module->parsed->implemented = internal_modules[i].implemented;
212 }
213
214 *new_ctx = ctx;
215 return rc;
216
217error:
218 ly_ctx_destroy(ctx, NULL);
219 return rc;
220}
Radek Krejci0af5f5d2018-09-07 15:00:30 +0200221API int
Radek Krejci3fbe89a2018-09-20 13:54:46 +0200222ly_ctx_get_options(const struct ly_ctx *ctx)
Radek Krejci0af5f5d2018-09-07 15:00:30 +0200223{
Radek Krejci3fbe89a2018-09-20 13:54:46 +0200224 LY_CHECK_ARG_RET(ctx, ctx, 0);
Radek Krejci0af5f5d2018-09-07 15:00:30 +0200225 return ctx->flags;
226}
227
Radek Krejcica828d92018-09-20 14:19:43 +0200228API LY_ERR
229ly_ctx_set_option(struct ly_ctx *ctx, int option)
230{
231 LY_CHECK_ARG_RET(ctx, ctx, LY_EINVAL);
232 LY_CHECK_ERR_RET(option & LY_CTX_NOYANGLIBRARY, LOGARG(ctx, option), LY_EINVAL);
233
234 /* set the option(s) */
235 ctx->flags |= option;
236
237 return LY_SUCCESS;
238}
239
240API LY_ERR
241ly_ctx_unset_option(struct ly_ctx *ctx, int option)
242{
243 LY_CHECK_ARG_RET(ctx, ctx, LY_EINVAL);
244 LY_CHECK_ERR_RET(option & LY_CTX_NOYANGLIBRARY, LOGARG(ctx, option), LY_EINVAL);
245
246 /* unset the option(s) */
247 ctx->flags &= ~option;
248
249 return LY_SUCCESS;
250}
251
Radek Krejci0af5f5d2018-09-07 15:00:30 +0200252API uint16_t
253ly_ctx_get_module_set_id(const struct ly_ctx *ctx)
254{
Radek Krejci3fbe89a2018-09-20 13:54:46 +0200255 LY_CHECK_ARG_RET(ctx, ctx, 0);
Radek Krejci0af5f5d2018-09-07 15:00:30 +0200256 return ctx->module_set_id;
257}
258
Radek Krejcid33273d2018-10-25 14:55:52 +0200259API void
260ly_ctx_set_module_imp_clb(struct ly_ctx *ctx, ly_module_imp_clb clb, void *user_data)
261{
262 LY_CHECK_ARG_RET(ctx, ctx,);
263
264 ctx->imp_clb = clb;
265 ctx->imp_clb_data = user_data;
266}
267
268API ly_module_imp_clb
269ly_ctx_get_module_imp_clb(const struct ly_ctx *ctx, void **user_data)
270{
271 LY_CHECK_ARG_RET(ctx, ctx, NULL);
272
273 if (user_data) {
274 *user_data = ctx->imp_clb_data;
275 }
276 return ctx->imp_clb;
277}
278
Radek Krejcib7db73a2018-10-24 14:18:40 +0200279/**
280 * @brief Iterate over the modules in the given context. Returned modules must match the given key at the offset of
281 * lysp_module and lysc_module structures (they are supposed to be placed at the same offset in both structures).
282 *
283 * @param[in] ctx Context where to iterate.
284 * @param[in] key Key value to search for.
285 * @param[in] key_offset Key's offset in struct lysp_module and struct lysc_module to get value from the context's
286 * modules to match with the key.
287 * @param[in,out] Iterator to pass between the function calls. On the first call, the variable is supposed to be
288 * initiated to 0. After each call returning a module, the value is greater by 1 than the index of the returned
289 * module in the context.
290 * @return Module matching the given key, NULL if no such module found.
291 */
292static const struct lys_module *
293ly_ctx_get_module_by_iter(const struct ly_ctx *ctx, const char *key, size_t key_offset, unsigned int *index)
294{
295 const struct lys_module *mod;
296 const char *value;
297
298 for (; *index < ctx->list.count; ++(*index)) {
299 mod = ctx->list.objs[*index];
300 if (mod->compiled) {
301 value = *(const char**)(((int8_t*)(mod->compiled)) + key_offset);
302 } else {
303 value = *(const char**)(((int8_t*)(mod->parsed)) + key_offset);
304 }
305 if (!strcmp(key, value)) {
306 /* increment index for the next run */
307 ++(*index);
308 return mod;
309 }
310 }
311 /* done */
312 return NULL;
313}
314
315/**
316 * @brief Unifying function for ly_ctx_get_module() and ly_ctx_get_module_ns()
317 * @param[in] ctx Context where to search.
318 * @param[in] key Name or Namespace as a search key.
319 * @param[in] key_offset Key's offset in struct lysp_module to get value from the context's modules to match with the key.
320 * @param[in] revision Revision date to match. If NULL, the matching module must have no revision. To search for the latest
321 * revision module, use ly_ctx_get_module_latest_by().
322 * @return Matching module if any.
323 */
324static const struct lys_module *
325ly_ctx_get_module_by(const struct ly_ctx *ctx, const char *key, size_t key_offset, const char *revision)
326{
327 const struct lys_module *mod;
328 unsigned int index = 0;
329
330 while ((mod = ly_ctx_get_module_by_iter(ctx, key, key_offset, &index))) {
331 if (!revision) {
Radek Krejcif8f882a2018-10-31 14:51:15 +0100332 if ((mod->compiled && !mod->compiled->revision) || (!mod->compiled && !mod->parsed->revs)) {
Radek Krejcib7db73a2018-10-24 14:18:40 +0200333 /* found requested module without revision */
334 return mod;
335 }
336 } else {
Radek Krejcif8f882a2018-10-31 14:51:15 +0100337 if ((mod->compiled && mod->compiled->revision && !strcmp(mod->compiled->revision, revision)) ||
Radek Krejcib7db73a2018-10-24 14:18:40 +0200338 (!mod->compiled && mod->parsed->revs && !strcmp(mod->parsed->revs[0].date, revision))) {
339 /* found requested module of the specific revision */
340 return mod;
341 }
342 }
343 }
344
345 return NULL;
346}
347
348API const struct lys_module *
349ly_ctx_get_module_ns(const struct ly_ctx *ctx, const char *ns, const char *revision)
350{
351 LY_CHECK_ARG_RET(ctx, ctx, ns, NULL);
352 return ly_ctx_get_module_by(ctx, ns, offsetof(struct lysp_module, ns), revision);
353}
354
355API const struct lys_module *
356ly_ctx_get_module(const struct ly_ctx *ctx, const char *name, const char *revision)
357{
358 LY_CHECK_ARG_RET(ctx, ctx, name, NULL);
359 return ly_ctx_get_module_by(ctx, name, offsetof(struct lysp_module, name), revision);
360}
361
362/**
363 * @brief Unifying function for ly_ctx_get_module_latest() and ly_ctx_get_module_latest_ns()
364 * @param[in] ctx Context where to search.
365 * @param[in] key Name or Namespace as a search key.
366 * @param[in] key_offset Key's offset in struct lysp_module to get value from the context's modules to match with the key.
367 * @return Matching module if any.
368 */
369static const struct lys_module *
370ly_ctx_get_module_latest_by(const struct ly_ctx *ctx, const char *key, size_t key_offset)
371{
Radek Krejci9f5e6fb2018-10-25 09:26:12 +0200372 const struct lys_module *mod;
Radek Krejcib7db73a2018-10-24 14:18:40 +0200373 unsigned int index = 0;
Radek Krejcib7db73a2018-10-24 14:18:40 +0200374
375 while ((mod = ly_ctx_get_module_by_iter(ctx, key, key_offset, &index))) {
Radek Krejci9f5e6fb2018-10-25 09:26:12 +0200376 if ((mod->compiled && mod->compiled->latest_revision) || (!mod->compiled && mod->parsed->latest_revision)) {
377 return mod;
Radek Krejcib7db73a2018-10-24 14:18:40 +0200378 }
379 }
380
Radek Krejci9f5e6fb2018-10-25 09:26:12 +0200381 return NULL;
Radek Krejcib7db73a2018-10-24 14:18:40 +0200382}
383
384API const struct lys_module *
385ly_ctx_get_module_latest(const struct ly_ctx *ctx, const char *name)
386{
387 LY_CHECK_ARG_RET(ctx, ctx, name, NULL);
388 return ly_ctx_get_module_latest_by(ctx, name, offsetof(struct lysp_module, name));
389}
390
391const struct lys_module *
392ly_ctx_get_module_latest_ns(const struct ly_ctx *ctx, const char *ns)
393{
394 LY_CHECK_ARG_RET(ctx, ctx, ns, NULL);
395 return ly_ctx_get_module_latest_by(ctx, ns, offsetof(struct lysp_module, ns));
396}
397
398/**
399 * @brief Unifying function for ly_ctx_get_module_implemented() and ly_ctx_get_module_implemented_ns()
400 * @param[in] ctx Context where to search.
401 * @param[in] key Name or Namespace as a search key.
402 * @param[in] key_offset Key's offset in struct lysp_module to get value from the context's modules to match with the key.
403 * @return Matching module if any.
404 */
405static const struct lys_module *
406ly_ctx_get_module_implemented_by(const struct ly_ctx *ctx, const char *key, size_t key_offset)
407{
408 const struct lys_module *mod;
409 unsigned int index = 0;
410
411 while ((mod = ly_ctx_get_module_by_iter(ctx, key, key_offset, &index))) {
412 if ((mod->compiled && mod->compiled->implemented) || (!mod->compiled && mod->parsed->implemented)) {
413 return mod;
414 }
415 }
416
417 return NULL;
418}
419
420API const struct lys_module *
421ly_ctx_get_module_implemented(const struct ly_ctx *ctx, const char *name)
422{
423 LY_CHECK_ARG_RET(ctx, ctx, name, NULL);
424 return ly_ctx_get_module_implemented_by(ctx, name, offsetof(struct lysp_module, name));
425}
426
427API const struct lys_module *
428ly_ctx_get_module_implemented_ns(const struct ly_ctx *ctx, const char *ns)
429{
430 LY_CHECK_ARG_RET(ctx, ctx, ns, NULL);
431 return ly_ctx_get_module_implemented_by(ctx, ns, offsetof(struct lysp_module, ns));
432}
433
Radek Krejcid33273d2018-10-25 14:55:52 +0200434struct lysp_module *
435ly_ctx_get_submodule(const struct ly_ctx *ctx, const char *module, const char *submodule, const char *revision)
436{
437 const struct lys_module *mod;
438 struct lysp_include *inc;
Radek Krejcifaa1eac2018-10-30 14:34:55 +0100439 unsigned int v, u;
Radek Krejcid33273d2018-10-25 14:55:52 +0200440
Radek Krejcifaa1eac2018-10-30 14:34:55 +0100441 assert(submodule);
442
443 for (v = 0; v < ctx->list.count; ++v) {
444 mod = ctx->list.objs[v];
Radek Krejcid33273d2018-10-25 14:55:52 +0200445 if (!mod->parsed) {
446 continue;
447 }
Radek Krejcifaa1eac2018-10-30 14:34:55 +0100448 if (module && strcmp(module, mod->parsed->name)) {
449 continue;
450 }
Radek Krejcid33273d2018-10-25 14:55:52 +0200451
452 LY_ARRAY_FOR(mod->parsed->includes, u) {
Radek Krejci086c7132018-10-26 15:29:04 +0200453 if (mod->parsed->includes[u].submodule && !strcmp(submodule, mod->parsed->includes[u].submodule->name)) {
Radek Krejcid33273d2018-10-25 14:55:52 +0200454 inc = &mod->parsed->includes[u];
455 if (!revision) {
456 if (inc->submodule->latest_revision) {
457 return inc->submodule;
458 }
459 } else if (inc->submodule->revs && !strcmp(revision, inc->submodule->revs[0].date)) {
460 return inc->submodule;
461 }
462 }
463 }
464 }
465
466 return NULL;
467}
468
Radek Krejci0af5f5d2018-09-07 15:00:30 +0200469API void
Radek Krejcie9e987e2018-10-31 12:50:27 +0100470ly_ctx_reset_latests(struct ly_ctx *ctx)
471{
472 unsigned int u,v ;
473 struct lys_module *mod;
474
475 for (u = 0; u < ctx->list.count; ++u) {
476 mod = ctx->list.objs[u];
477 if (mod->compiled && mod->compiled->latest_revision == 2) {
478 mod->compiled->latest_revision = 1;
479 }
480 if (mod->parsed) {
481 if (mod->parsed->latest_revision == 2) {
482 mod->parsed->latest_revision = 1;
483 }
484 if (mod->parsed->includes) {
485 for (v = 0; v < LY_ARRAY_SIZE(mod->parsed->includes); ++v) {
486 if (mod->parsed->includes[v].submodule->latest_revision == 2) {
487 mod->parsed->includes[v].submodule->latest_revision = 1;
488 }
489 }
490 }
491 }
492 }
493}
494
495API void
Radek Krejciad573502018-09-07 15:26:55 +0200496ly_ctx_destroy(struct ly_ctx *ctx, void (*private_destructor)(const struct lysc_node *node, void *priv))
Radek Krejci0af5f5d2018-09-07 15:00:30 +0200497{
Radek Krejci418823a2018-09-20 16:42:13 +0200498 if (!ctx) {
499 return;
500 }
Radek Krejci0af5f5d2018-09-07 15:00:30 +0200501
502 /* models list */
Michal Vaskob34480a2018-09-17 10:34:45 +0200503 for (; ctx->list.count; ctx->list.count--) {
Radek Krejci0af5f5d2018-09-07 15:00:30 +0200504 /* remove the module */
Radek Krejci86d106e2018-10-18 09:53:19 +0200505 lys_module_free(ctx->list.objs[ctx->list.count - 1], private_destructor);
Radek Krejci0af5f5d2018-09-07 15:00:30 +0200506 }
507 free(ctx->list.objs);
508
509 /* search paths list */
Radek Krejcia40f21b2018-09-18 10:42:08 +0200510 ly_set_erase(&ctx->search_paths, free);
Radek Krejci0af5f5d2018-09-07 15:00:30 +0200511
512 /* clean the error list */
513 ly_err_clean(ctx, 0);
514 pthread_key_delete(ctx->errlist_key);
515
516 /* dictionary */
517 lydict_clean(&ctx->dict);
518
519#if 0 /* TODO when plugins implemented */
520 /* plugins - will be removed only if this is the last context */
521 ly_clean_plugins();
522#endif
523
524 free(ctx);
525}