blob: 122787c7455699d3ada542c154eb86164346e22a [file] [log] [blame]
Radek Krejci5aeea3a2018-09-05 13:29:36 +02001/**
2 * @file common.h
3 * @author Radek Krejci <rkrejci@cesnet.cz>
4 * @brief common internal definitions for libyang
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
15#ifndef LY_COMMON_H_
16#define LY_COMMON_H_
17
Radek Krejci6caa6ab2018-10-24 10:04:48 +020018#include <pthread.h>
Radek Krejcie7b95092019-05-15 11:03:07 +020019#include <stddef.h>
Radek Krejci5aeea3a2018-09-05 13:29:36 +020020#include <stdint.h>
Radek Krejci5aeea3a2018-09-05 13:29:36 +020021
Radek Krejcid33273d2018-10-25 14:55:52 +020022#include "context.h"
Radek Krejcie7b95092019-05-15 11:03:07 +020023#include "dict.h"
Radek Krejci6caa6ab2018-10-24 10:04:48 +020024#include "hash_table.h"
Radek Krejcie7b95092019-05-15 11:03:07 +020025#include "log.h"
26#include "set.h"
Radek Krejcic4fa0292020-05-14 10:54:49 +020027#include "tree.h"
Radek Krejci535ea9f2020-05-29 16:01:05 +020028#include "tree_data.h"
Radek Krejcie7b95092019-05-15 11:03:07 +020029
30struct ly_ctx;
Radek Krejci535ea9f2020-05-29 16:01:05 +020031struct lys_module;
Radek Krejci5aeea3a2018-09-05 13:29:36 +020032
33#if __STDC_VERSION__ >= 201112 && !defined __STDC_NO_THREADS__
34# define THREAD_LOCAL _Thread_local
35#elif defined __GNUC__ || \
Radek Krejci0f969882020-08-21 16:56:47 +020036 defined __SUNPRO_C || \
37 defined __xlC__
Radek Krejci5aeea3a2018-09-05 13:29:36 +020038# define THREAD_LOCAL __thread
39#else
40# error "Cannot define THREAD_LOCAL"
41#endif
42
Radek Krejcic59bc972018-09-17 16:13:06 +020043#define GETMACRO1(_1, NAME, ...) NAME
Radek Krejci5aeea3a2018-09-05 13:29:36 +020044#define GETMACRO2(_1, _2, NAME, ...) NAME
45#define GETMACRO3(_1, _2, _3, NAME, ...) NAME
46#define GETMACRO4(_1, _2, _3, _4, NAME, ...) NAME
Michal Vaskodc779a82019-11-06 15:44:06 +010047#define GETMACRO5(_1, _2, _3, _4, _5, NAME, ...) NAME
Radek Krejci5aeea3a2018-09-05 13:29:36 +020048
49/*
Radek Krejcic59bc972018-09-17 16:13:06 +020050 * If the compiler supports attribute to mark objects as hidden, mark all
51 * objects as hidden and export only objects explicitly marked to be part of
52 * the public API.
Radek Krejci5aeea3a2018-09-05 13:29:36 +020053 */
Radek Krejcic59bc972018-09-17 16:13:06 +020054#define API __attribute__((visibility("default")))
55
56/******************************************************************************
57 * Logger
58 *****************************************************************************/
Radek Krejci5aeea3a2018-09-05 13:29:36 +020059
Radek Krejci94aa9942018-09-07 17:12:17 +020060enum LY_VLOG_ELEM {
61 LY_VLOG_NONE = 0,
Michal Vaskof6e51882019-12-16 09:59:45 +010062 LY_VLOG_LINE, /* line number (uint64_t*) */
63 LY_VLOG_LYSC, /* struct lysc_node* */
64 LY_VLOG_LYD, /* struct lyd_node* */
65 LY_VLOG_STR, /* const char* */
66 LY_VLOG_PREV /* use exact same previous path */
Radek Krejci94aa9942018-09-07 17:12:17 +020067};
68
Radek Krejci5aeea3a2018-09-05 13:29:36 +020069extern THREAD_LOCAL enum int_log_opts log_opt;
Radek Krejci52b6d512020-10-12 12:33:17 +020070extern volatile LY_LOG_LEVEL ly_ll;
Radek Krejci1deb5be2020-08-26 16:43:36 +020071extern volatile uint32_t ly_log_opts;
Radek Krejci5aeea3a2018-09-05 13:29:36 +020072
Radek Krejcie7b95092019-05-15 11:03:07 +020073/**
Radek Krejcie7b95092019-05-15 11:03:07 +020074 * @brief Print a log message and store it into the context (if provided).
75 *
76 * @param[in] ctx libyang context to store the error record. If not provided, the error is just printed.
77 * @param[in] level Log message level (error, warning, etc.)
78 * @param[in] no Error type code.
79 * @param[in] format Format string to print.
80 */
Radek Krejci5aeea3a2018-09-05 13:29:36 +020081void ly_log(const struct ly_ctx *ctx, LY_LOG_LEVEL level, LY_ERR no, const char *format, ...);
Radek Krejcie7b95092019-05-15 11:03:07 +020082
83/**
84 * @brief Print Validation error and store it into the context (if provided).
85 *
86 * @param[in] ctx libyang context to store the error record. If not provided, the error is just printed.
87 * @param[in] elem_type Type of the data in @p elem variable.
88 * @param[in] elem Object to provide more information about the place where the error appeared.
89 * @param[in] code Validation error code.
90 * @param[in] format Format string to print.
91 */
Radek Krejci94aa9942018-09-07 17:12:17 +020092void ly_vlog(const struct ly_ctx *ctx, enum LY_VLOG_ELEM elem_type, const void *elem, LY_VECODE code, const char *format, ...);
Radek Krejci5aeea3a2018-09-05 13:29:36 +020093
Radek Krejcic0c66412020-08-21 13:53:50 +020094#define LOGERR(ctx, errno, str, ...) ly_log(ctx, LY_LLERR, errno, str, ##__VA_ARGS__)
Radek Krejcif3f47842018-11-15 11:22:15 +010095#define LOGWRN(ctx, str, ...) ly_log(ctx, LY_LLWRN, 0, str, ##__VA_ARGS__)
Radek Krejcic0c66412020-08-21 13:53:50 +020096#define LOGVRB(str, ...) ly_log(NULL, LY_LLVRB, 0, str, ##__VA_ARGS__)
Radek Krejci5aeea3a2018-09-05 13:29:36 +020097
Radek Krejci4ab61562018-09-05 15:00:37 +020098#ifdef NDEBUG
Radek Krejcic0c66412020-08-21 13:53:50 +020099# define LOGDBG(dbg_group, str, ...)
Radek Krejci4ab61562018-09-05 15:00:37 +0200100#else
Radek Krejci1deb5be2020-08-26 16:43:36 +0200101void ly_log_dbg(uint32_t group, const char *format, ...);
Radek Krejcic0c66412020-08-21 13:53:50 +0200102# define LOGDBG(dbg_group, str, ...) ly_log_dbg(dbg_group, str, ##__VA_ARGS__);
Radek Krejci4ab61562018-09-05 15:00:37 +0200103#endif
104
Radek Krejcie2692202020-12-01 14:21:12 +0100105/**
106 * Simple EMEM message, it can be safely stored in ::ly_err_item structures without problems when freeing.
107 */
108#define LY_EMEM_MSG "Memory allocation failed."
109
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200110#define LOGMEM(CTX) LOGERR(CTX, LY_EMEM, "Memory allocation failed (%s()).", __func__)
111#define LOGINT(CTX) LOGERR(CTX, LY_EINT, "Internal error (%s:%d).", __FILE__, __LINE__)
112#define LOGARG(CTX, ARG) LOGERR(CTX, LY_EINVAL, "Invalid argument %s (%s()).", #ARG, __func__)
Radek Krejcic0c66412020-08-21 13:53:50 +0200113#define LOGVAL(CTX, ELEM_TYPE, ELEM, CODE, ...) ly_vlog(CTX, ELEM_TYPE, ELEM, CODE, ##__VA_ARGS__)
Radek Krejci94aa9942018-09-07 17:12:17 +0200114
115#define LOGMEM_RET(CTX) LOGMEM(CTX); return LY_EMEM
116#define LOGINT_RET(CTX) LOGINT(CTX); return LY_EINT
117#define LOGARG_RET(CTX) LOGARG(CTX); return LY_EINVAL
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200118
119/*
120 * Common code to check return value and perform appropriate action.
121 */
Radek Krejcie88beef2019-05-30 15:47:19 +0200122#define LY_CHECK_GOTO(COND, GOTO) if ((COND)) {goto GOTO;}
123#define LY_CHECK_ERR_GOTO(COND, ERR, GOTO) if ((COND)) {ERR; goto GOTO;}
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100124#define LY_CHECK_RET1(RETVAL) {LY_ERR ret__ = RETVAL;if (ret__ != LY_SUCCESS) {return ret__;}}
Radek Krejcie88beef2019-05-30 15:47:19 +0200125#define LY_CHECK_RET2(COND, RETVAL) if ((COND)) {return RETVAL;}
Radek Krejcic59bc972018-09-17 16:13:06 +0200126#define LY_CHECK_RET(...) GETMACRO2(__VA_ARGS__, LY_CHECK_RET2, LY_CHECK_RET1)(__VA_ARGS__)
Radek Krejcie88beef2019-05-30 15:47:19 +0200127#define LY_CHECK_ERR_RET(COND, ERR, RETVAL) if ((COND)) {ERR; return RETVAL;}
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200128
Radek Krejcia3045382018-11-22 14:30:31 +0100129#define LY_CHECK_ARG_GOTO1(CTX, ARG, GOTO) if (!(ARG)) {LOGARG(CTX, ARG);goto GOTO;}
Michal Vaskob3d0d6b2018-09-07 10:17:33 +0200130#define LY_CHECK_ARG_GOTO2(CTX, ARG1, ARG2, GOTO) LY_CHECK_ARG_GOTO1(CTX, ARG1, GOTO);LY_CHECK_ARG_GOTO1(CTX, ARG2, GOTO)
131#define LY_CHECK_ARG_GOTO3(CTX, ARG1, ARG2, ARG3, GOTO) LY_CHECK_ARG_GOTO2(CTX, ARG1, ARG2, GOTO);LY_CHECK_ARG_GOTO1(CTX, ARG3, GOTO)
Michal Vaskodc779a82019-11-06 15:44:06 +0100132#define LY_CHECK_ARG_GOTO4(CTX, ARG1, ARG2, ARG3, ARG4, GOTO) LY_CHECK_ARG_GOTO3(CTX, ARG1, ARG2, ARG3, GOTO);\
133 LY_CHECK_ARG_GOTO1(CTX, ARG4, GOTO)
134#define LY_CHECK_ARG_GOTO(CTX, ...) GETMACRO5(__VA_ARGS__, LY_CHECK_ARG_GOTO4, LY_CHECK_ARG_GOTO3, LY_CHECK_ARG_GOTO2, \
135 LY_CHECK_ARG_GOTO1)(CTX, __VA_ARGS__)
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200136
Radek Krejcia3045382018-11-22 14:30:31 +0100137#define LY_CHECK_ARG_RET1(CTX, ARG, RETVAL) if (!(ARG)) {LOGARG(CTX, ARG);return RETVAL;}
Michal Vaskob3d0d6b2018-09-07 10:17:33 +0200138#define LY_CHECK_ARG_RET2(CTX, ARG1, ARG2, RETVAL) LY_CHECK_ARG_RET1(CTX, ARG1, RETVAL);LY_CHECK_ARG_RET1(CTX, ARG2, RETVAL)
139#define LY_CHECK_ARG_RET3(CTX, ARG1, ARG2, ARG3, RETVAL) LY_CHECK_ARG_RET2(CTX, ARG1, ARG2, RETVAL);LY_CHECK_ARG_RET1(CTX, ARG3, RETVAL)
Michal Vaskodc779a82019-11-06 15:44:06 +0100140#define LY_CHECK_ARG_RET4(CTX, ARG1, ARG2, ARG3, ARG4, RETVAL) LY_CHECK_ARG_RET3(CTX, ARG1, ARG2, ARG3, RETVAL);\
141 LY_CHECK_ARG_RET1(CTX, ARG4, RETVAL)
142#define LY_CHECK_ARG_RET(CTX, ...) GETMACRO5(__VA_ARGS__, LY_CHECK_ARG_RET4, LY_CHECK_ARG_RET3, LY_CHECK_ARG_RET2, LY_CHECK_ARG_RET1)\
143 (CTX, __VA_ARGS__)
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200144
Radek Krejcid972c252018-09-25 13:23:39 +0200145/* count sequence size for LY_VCODE_INCHILDSTMT validation error code */
146size_t LY_VCODE_INSTREXP_len(const char *str);
147/* default maximum characters to print in LY_VCODE_INCHILDSTMT */
148#define LY_VCODE_INSTREXP_MAXLEN 20
149
Michal Vaskoecd62de2019-11-13 12:35:11 +0100150#define LY_VCODE_INCHAR LYVE_SYNTAX, "Invalid character 0x%x."
151#define LY_VCODE_INSTREXP LYVE_SYNTAX, "Invalid character sequence \"%.*s\", expected %s."
152#define LY_VCODE_EOF LYVE_SYNTAX, "Unexpected end-of-input."
153#define LY_VCODE_NTERM LYVE_SYNTAX, "%s not terminated."
154#define LY_VCODE_NSUPP LYVE_SYNTAX, "%s not supported."
155#define LY_VCODE_MOD_SUBOMD LYVE_SYNTAX, "Invalid keyword \"%s\", expected \"module\" or \"submodule\"."
156#define LY_VCODE_TRAILING_MOD LYVE_SYNTAX, "Trailing garbage \"%.*s%s\" after module, expected end-of-input."
David Sedlák1538a842019-08-08 15:38:51 +0200157#define LY_VCODE_TRAILING_SUBMOD LYVE_SYNTAX, "Trailing garbage \"%.*s%s\" after submodule, expected end-of-input."
158
Michal Vaskoecd62de2019-11-13 12:35:11 +0100159#define LY_VCODE_INVAL_MINMAX LYVE_SEMANTICS, "Invalid combination of min-elements and max-elements: min value %u is bigger than the max value %u."
160#define LY_VCODE_CIRC_WHEN LYVE_SEMANTICS, "When condition of \"%s\" includes a self-reference (referenced by when of \"%s\")."
Michal Vasko5c4e5892019-11-14 12:31:38 +0100161#define LY_VCODE_DUMMY_WHEN LYVE_SEMANTICS, "When condition of \"%s\" is accessing its own conditional node."
David Sedlák0c2bab92019-07-22 15:33:19 +0200162
Michal Vaskoecd62de2019-11-13 12:35:11 +0100163#define LY_VCODE_INSTMT LYVE_SYNTAX_YANG, "Invalid keyword \"%s\"."
164#define LY_VCODE_INCHILDSTMT LYVE_SYNTAX_YANG, "Invalid keyword \"%s\" as a child of \"%s\"."
165#define LY_VCODE_INCHILDSTMT2 LYVE_SYNTAX_YANG, "Invalid keyword \"%s\" as a child of \"%s\" - the statement is allowed only in YANG 1.1 modules."
Radek Krejcia9026eb2018-12-12 16:04:47 +0100166#define LY_VCODE_INCHILDSTMSCOMB LYVE_SYNTAX_YANG, "Invalid combination of keywords \"%s\" and \"%s\" as substatements of \"%s\"."
Michal Vaskoecd62de2019-11-13 12:35:11 +0100167#define LY_VCODE_DUPSTMT LYVE_SYNTAX_YANG, "Duplicate keyword \"%s\"."
168#define LY_VCODE_DUPIDENT LYVE_SYNTAX_YANG, "Duplicate identifier \"%s\" of %s statement."
169#define LY_VCODE_INVAL LYVE_SYNTAX_YANG, "Invalid value \"%.*s\" of \"%s\"."
170#define LY_VCODE_MISSTMT LYVE_SYNTAX_YANG, "Missing mandatory keyword \"%s\" as a child of \"%s\"."
171#define LY_VCODE_MISSCHILDSTMT LYVE_SYNTAX_YANG, "Missing %s substatement for %s%s."
172#define LY_VCODE_INORD LYVE_SYNTAX_YANG, "Invalid keyword \"%s\", it cannot appear after \"%s\"."
173#define LY_VCODE_OOB LYVE_SYNTAX_YANG, "Value \"%.*s\" is out of \"%s\" bounds."
174#define LY_VCODE_INDEV LYVE_SYNTAX_YANG, "Deviate \"%s\" does not support keyword \"%s\"."
175#define LY_VCODE_INREGEXP LYVE_SYNTAX_YANG, "Regular expression \"%s\" is not valid (\"%s\": %s)."
David Sedlák0c2bab92019-07-22 15:33:19 +0200176
Michal Vaskoecd62de2019-11-13 12:35:11 +0100177#define LY_VCODE_INSUBELEM2 LYVE_SYNTAX_YIN, "Invalid sub-elemnt \"%s\" of \"%s\" element - this sub-element is allowed only in modules with version 1.1 or newer."
178#define LY_VCODE_INVAL_YIN LYVE_SYNTAX_YIN, "Invalid value \"%s\" of \"%s\" attribute in \"%s\" element."
179#define LY_VCODE_UNEXP_SUBELEM LYVE_SYNTAX_YIN, "Unexpected sub-element \"%.*s\" of \"%s\" element."
180#define LY_VCODE_INDEV_YIN LYVE_SYNTAX_YIN, "Deviate of this type doesn't allow \"%s\" as it's sub-element."
181#define LY_VCODE_INORDER_YIN LYVE_SYNTAX_YIN, "Invalid order of %s\'s sub-elements \"%s\" can't appear after \"%s\"."
182#define LY_VCODE_OOB_YIN LYVE_SYNTAX_YIN, "Value \"%s\" of \"%s\" attribute in \"%s\" element is out of bounds."
David Sedlák1538a842019-08-08 15:38:51 +0200183#define LY_VCODE_INCHILDSTMSCOMB_YIN LYVE_SYNTAX_YIN, "Invalid combination of sub-elemnts \"%s\" and \"%s\" in \"%s\" element."
Michal Vaskoecd62de2019-11-13 12:35:11 +0100184#define LY_VCODE_DUP_ATTR LYVE_SYNTAX_YIN, "Duplicit definition of \"%s\" attribute in \"%s\" element."
185#define LY_VCODE_UNEXP_ATTR LYVE_SYNTAX_YIN, "Unexpected attribute \"%.*s\" of \"%s\" element."
186#define LY_VCODE_MAND_SUBELEM LYVE_SYNTAX_YIN, "Missing mandatory sub-element \"%s\" of \"%s\" element."
187#define LY_VCODE_FIRT_SUBELEM LYVE_SYNTAX_YIN, "Sub-element \"%s\" of \"%s\" element must be defined as it's first sub-element."
188#define LY_VCODE_NAME_COL LYVE_SYNTAX_YIN, "Name collision between module and submodule of name \"%s\"."
189#define LY_VCODE_SUBELEM_REDEF LYVE_SYNTAX_YIN, "Redefinition of \"%s\" sub-element in \"%s\" element."
David Sedlák0c2bab92019-07-22 15:33:19 +0200190
Michal Vaskoecd62de2019-11-13 12:35:11 +0100191#define LY_VCODE_XP_EOE LYVE_XPATH, "Unterminated string delimited with %c (%.15s)."
192#define LY_VCODE_XP_INEXPR LYVE_XPATH, "Invalid character number %u of expression \'%s\'."
193#define LY_VCODE_XP_EOF LYVE_XPATH, "Unexpected XPath expression end."
Michal Vasko0b468e62020-10-19 09:33:04 +0200194#define LY_VCODE_XP_INTOK LYVE_XPATH, "Unexpected XPath token \"%s\" (\"%.15s\")."
195#define LY_VCODE_XP_INTOK2 LYVE_XPATH, "Unexpected XPath token \"%s\" (\"%.15s\"), expected \"%s\"."
Michal Vaskoecd62de2019-11-13 12:35:11 +0100196#define LY_VCODE_XP_INFUNC LYVE_XPATH, "Unknown XPath function \"%.*s\"."
197#define LY_VCODE_XP_INARGCOUNT LYVE_XPATH, "Invalid number of arguments (%d) for the XPath function %.*s."
198#define LY_VCODE_XP_INARGTYPE LYVE_XPATH, "Wrong type of argument #%d (%s) for the XPath function %s."
199#define LY_VCODE_XP_INCTX LYVE_XPATH, "Invalid context type %s in %s."
Michal Vaskoecd62de2019-11-13 12:35:11 +0100200#define LY_VCODE_XP_INOP_1 LYVE_XPATH, "Cannot apply XPath operation %s on %s."
201#define LY_VCODE_XP_INOP_2 LYVE_XPATH, "Cannot apply XPath operation %s on %s and %s."
Michal Vasko004d3152020-06-11 19:59:22 +0200202#define LY_VCODE_XP_INMOD LYVE_XPATH, "Unknown/non-implemented module \"%.*s\"."
David Sedlák0c2bab92019-07-22 15:33:19 +0200203
Radek Krejci327de162019-06-14 12:52:07 +0200204#define LY_VCODE_DEV_NOT_PRESENT LYVE_REFERENCE, "Invalid deviation %s \"%s\" property \"%s\" which is not present."
Radek Krejci94aa9942018-09-07 17:12:17 +0200205
Michal Vaskoecd62de2019-11-13 12:35:11 +0100206#define LY_VCODE_NOWHEN LYVE_DATA, "When condition \"%s\" not satisfied."
Michal Vaskocc048b22020-03-27 15:52:38 +0100207#define LY_VCODE_NOMUST LYVE_DATA, "Must condition \"%s\" not satisfied."
Michal Vaskoa3881362020-01-21 15:57:35 +0100208#define LY_VCODE_NOMAND LYVE_DATA, "Mandatory node \"%s\" instance does not exist."
Michal Vaskoacd83e72020-02-04 14:12:01 +0100209#define LY_VCODE_NOMIN LYVE_DATA, "Too few \"%s\" instances."
210#define LY_VCODE_NOMAX LYVE_DATA, "Too many \"%s\" instances."
Michal Vasko14654712020-02-06 08:35:21 +0100211#define LY_VCODE_NOUNIQ LYVE_DATA, "Unique data leaf(s) \"%s\" not satisfied in \"%s\" and \"%s\"."
Michal Vaskof03ed032020-03-04 13:31:44 +0100212#define LY_VCODE_DUP LYVE_DATA, "Duplicate instance of \"%s\"."
213#define LY_VCODE_DUPCASE LYVE_DATA, "Data for both cases \"%s\" and \"%s\" exist."
Michal Vaskocb7526d2020-03-30 15:08:26 +0200214#define LY_VCODE_INNODE LYVE_DATA, "Invalid %s data node \"%s\" found."
Michal Vasko9f96a052020-03-10 09:41:45 +0100215#define LY_VCODE_NOKEY LYVE_DATA, "List instance is missing its key \"%s\"."
Michal Vaskoecd62de2019-11-13 12:35:11 +0100216
Radek Krejcic59bc972018-09-17 16:13:06 +0200217/******************************************************************************
Radek Krejci6caa6ab2018-10-24 10:04:48 +0200218 * Context
219 *****************************************************************************/
220
221/**
222 * @brief Context of the YANG schemas
223 */
224struct ly_ctx {
225 struct dict_table dict; /**< dictionary to effectively store strings used in the context related structures */
226 struct ly_set search_paths; /**< set of directories where to search for schema's imports/includes */
Michal Vasko89b5c072020-10-06 13:52:44 +0200227 struct ly_set list; /**< set of loaded YANG schemas */
Radek Krejcid33273d2018-10-25 14:55:52 +0200228 ly_module_imp_clb imp_clb; /**< Optional callback for retrieving missing included or imported models in a custom way. */
Radek Krejci8678fa42020-08-18 16:07:28 +0200229 void *imp_clb_data; /**< Optional private data for ::ly_ctx.imp_clb */
Radek Krejci6caa6ab2018-10-24 10:04:48 +0200230 uint16_t module_set_id; /**< ID of the current set of schemas */
231 uint16_t flags; /**< context settings, see @ref contextoptions. */
232 pthread_key_t errlist_key; /**< key for the thread-specific list of errors related to the context */
233};
234
Radek Krejcid33273d2018-10-25 14:55:52 +0200235/**
236 * @brief Try to find submodule in the context. Submodules are present only in the parsed (lysp_) schema trees, if only
237 * the compiled versions of the schemas are present, the submodule cannot be returned even if it was used to compile
238 * some of the currently present schemas.
239 *
Michal Vaskoc3781c32020-10-06 14:04:08 +0200240 * @param[in] ctx Context where to search in case @p module is NULL.
241 * @param[in] module Submodule parent (belongs-to) module in case @p ctx is NULL.
Radek Krejcid33273d2018-10-25 14:55:52 +0200242 * @param[in] submodule Name of the submodule to find.
243 * @param[in] revision Optional revision of the submodule to find. If not specified, the latest revision is returned.
244 * @return Pointer to the specified submodule if it is present in the context.
245 */
Michal Vaskoc3781c32020-10-06 14:04:08 +0200246struct lysp_submodule *ly_ctx_get_submodule(const struct ly_ctx *ctx, const struct lys_module *module,
247 const char *submodule, const char *revision);
Radek Krejcid33273d2018-10-25 14:55:52 +0200248
Radek Krejci0ad51f12020-07-16 12:08:12 +0200249/**
250 * @brief Get the (only) implemented YANG module specified by its name.
251 *
252 * @param[in] ctx Context where to search.
253 * @param[in] name Name of the YANG module to get.
254 * @param[in] name_len Optional length of the @p name. If zero, NULL-terminated name is expected.
255 * @return The only implemented YANG module revision of the given name in the given context. NULL if there is no
256 * implemented module of the given name.
257 */
258struct lys_module *ly_ctx_get_module_implemented2(const struct ly_ctx *ctx, const char *name, size_t name_len);
259
Radek Krejci6caa6ab2018-10-24 10:04:48 +0200260/******************************************************************************
Radek Krejcic59bc972018-09-17 16:13:06 +0200261 * Parsers
262 *****************************************************************************/
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200263
Radek Krejcic59bc972018-09-17 16:13:06 +0200264/* list of the YANG statements strings */
Michal Vasko22df3f02020-08-24 13:29:22 +0200265extern const char * const ly_stmt_list[];
Radek Krejcic59bc972018-09-17 16:13:06 +0200266#define ly_stmt2str(STMT) ly_stmt_list[STMT]
267
268/* list of the extensions' substatements strings */
Michal Vasko22df3f02020-08-24 13:29:22 +0200269extern const char * const lyext_substmt_list[];
Radek Krejcic59bc972018-09-17 16:13:06 +0200270#define lyext_substmt2str(STMT) lyext_substmt_list[STMT]
271
272/* list of the deviate modifications strings */
Michal Vasko22df3f02020-08-24 13:29:22 +0200273extern const char * const ly_devmod_list[];
Radek Krejcic59bc972018-09-17 16:13:06 +0200274#define ly_devmod2str(TYPE) ly_devmod_list[TYPE]
275
276/******************************************************************************
Michal Vasko1324b6c2018-09-07 11:16:23 +0200277 * Generic useful functions.
Radek Krejcic59bc972018-09-17 16:13:06 +0200278 *****************************************************************************/
Michal Vasko1324b6c2018-09-07 11:16:23 +0200279
Michal Vaskob36053d2020-03-26 15:49:30 +0100280/**
281 * @brief Insert string into dictionary.
282 *
283 * @param[in] CTX libyang context.
284 * @param[in] STRING string to store.
285 * @param[in] LEN length of the string in WORD to store.
286 * @param[in,out] DYNAMIC Set to 1 if STR is dynamically allocated, 0 otherwise. If set to 1, zerocopy version of lydict_insert is used.
287 */
Radek Krejci011e4aa2020-09-04 15:22:31 +0200288#define INSERT_STRING_RET(CTX, STRING, LEN, DYNAMIC, TARGET) \
289 if (DYNAMIC) { \
290 LY_CHECK_RET(lydict_insert_zc(CTX, (char *)(STRING), &(TARGET))); \
291 } else { \
292 LY_CHECK_RET(lydict_insert(CTX, LEN ? (STRING) : "", LEN, &(TARGET))); \
293 } \
294 DYNAMIC = 0
Michal Vaskob36053d2020-03-26 15:49:30 +0100295
Radek Krejci76b3e962018-12-14 17:01:25 +0100296#define FREE_STRING(CTX, STRING) if (STRING) {lydict_remove(CTX, STRING);}
297
Michal Vasko1324b6c2018-09-07 11:16:23 +0200298/**
299 * @brief Wrapper for realloc() call. The only difference is that if it fails to
300 * allocate the requested memory, the original memory is freed as well.
301 *
302 * @param[in] ptr Memory to reallocate.
303 * @param[in] size New size of the memory block.
304 *
305 * @return Pointer to the new memory, NULL on error.
306 */
307void *ly_realloc(void *ptr, size_t size);
308
Radek Krejcif345c012018-09-19 11:12:59 +0200309/**
Michal Vasko03ff5a72019-09-11 13:49:33 +0200310 * @brief Just like strchr() function except limit the number of examined characters.
311 *
312 * @param[in] s String to search in.
313 * @param[in] c Character to search for.
314 * @param[in] len Limit the search to this number of characters in @p s.
315 * @return Pointer to first @p c occurence in @p s, NULL if not found in first @p len characters.
316 */
Radek Krejci1deb5be2020-08-26 16:43:36 +0200317char *ly_strnchr(const char *s, int c, size_t len);
Michal Vasko03ff5a72019-09-11 13:49:33 +0200318
319/**
Radek Krejci7f9b6512019-09-18 13:11:09 +0200320 * @brief Compare NULL-terminated @p refstr with @str_len bytes from @p str.
321 *
322 * @param[in] refstr NULL-terminated string which must match @str_len bytes from @str followed by NULL-byte.
323 * @param[in] str String to compare
324 * @param[in] str_len Number of bytes to take into comparison from @p str.
325 * @return An integer less than, equal to, or greater than zero if @p refstr matches,
326 * respectively, to be less than, to match, or be greater than @p str.
327 */
328int ly_strncmp(const char *refstr, const char *str, size_t str_len);
329
330/**
Radek Krejci1798aae2020-07-14 13:26:06 +0200331 * @brief Wrapper around strlen() to handle NULL strings.
332 */
333#define ly_strlen(STR) (STR ? strlen(STR) : 0)
334
335/**
Radek Krejcif13b87b2020-12-01 22:02:17 +0100336 * @brief Compile-time strlen() for string contants.
337 *
338 * Use to avoid magic numbers usage
339 */
340#define ly_strlen_const(STR) (sizeof STR - 1)
341
342#define ly_sizeofarray(ARRAY) (sizeof ARRAY / sizeof *ARRAY)
343
344/*
345 * Numerical bases for use in functions like strtoll() instead of magic numbers
346 */
347#define LY_BASE_DEC 10 /**< Decimal numeral base */
348#define LY_BASE_OCT 8 /**< Octal numeral base */
349#define LY_BASE_HEX 16 /**< Hexadecimal numeral base */
350
351/**
352 * Maximal length of (needed storage for) a number encoded as a string.
353 *
354 * Applies not only for standard numbers, but also for YANG's decimal64.
355 */
356#define LY_NUMBER_MAXLEN 22
357
358/**
Radek Krejcib416be62018-10-01 14:51:45 +0200359 * @brief Get UTF8 code point of the next character in the input string.
360 *
361 * @param[in,out] input Input string to process, updated according to the processed/read data.
362 * @param[out] utf8_char UTF8 code point of the next character.
363 * @param[out] bytes_read Number of bytes used to encode the read utf8_char.
364 * @return LY_ERR value
365 */
Michal Vaskob36053d2020-03-26 15:49:30 +0100366LY_ERR ly_getutf8(const char **input, uint32_t *utf8_char, size_t *bytes_read);
Radek Krejcib416be62018-10-01 14:51:45 +0200367
368/**
Radek Krejci50f0c6b2020-06-18 16:31:48 +0200369 * Store UTF-8 character specified as 4byte integer into the dst buffer.
370 *
371 * UTF-8 mapping:
372 * 00000000 -- 0000007F: 0xxxxxxx
373 * 00000080 -- 000007FF: 110xxxxx 10xxxxxx
374 * 00000800 -- 0000FFFF: 1110xxxx 10xxxxxx 10xxxxxx
375 * 00010000 -- 001FFFFF: 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx
376 *
377 * Includes checking for valid characters (following RFC 7950, sec 9.4)
378 *
379 * @param[in, out] dst Destination buffer to store the UTF-8 character, must provide enough space (up to 4 bytes) for storing the UTF-8 character.
380 * @param[in] value 32b value of the UTF-8 character to store.
381 * @param[out] bytes_written Number of bytes written into @p dst (size of the written UTF-8 character).
382 * @return LY_SUCCESS on success
383 * @return LY_EINVAL in case of invalid UTF-8 @p value to store.
384 */
385LY_ERR ly_pututf8(char *dst, uint32_t value, size_t *bytes_written);
386
387/**
Radek Krejci76c98012019-08-14 11:23:24 +0200388 * @brief Get number of characters in the @p str, taking multibyte characters into account.
389 * @param[in] str String to examine.
390 * @param[in] bytes Number of valid bytes that are supposed to be taken into account in @p str.
391 * This parameter is useful mainly for non NULL-terminated strings. In case of NULL-terminated
392 * string, strlen() can be used.
393 * @return Number of characters in (possibly) multibyte characters string.
394 */
395size_t ly_utf8len(const char *str, size_t bytes);
396
397/**
Radek Krejci4f28eda2018-11-12 11:46:16 +0100398 * @brief Parse signed integer with possible limitation.
399 * @param[in] val_str String value containing signed integer, note that
400 * nothing else than whitespaces are expected after the value itself.
Radek Krejci249973a2019-06-10 10:50:54 +0200401 * @param[in] val_len Length of the @p val_str string.
Radek Krejci4f28eda2018-11-12 11:46:16 +0100402 * @param[in] min Limitation for the value which must not be lower than min.
403 * @param[in] max Limitation for the value which must not be higher than max.
404 * @param[in] base Numeric base for parsing:
405 * 0 - to accept decimal, octal, hexadecimal (e.g. in default value)
406 * 10 - to accept only decimal (e.g. data instance value)
407 * @param[out] ret Resulting value.
408 * @return LY_ERR value:
409 * LY_EDENIED - the value breaks the limits,
410 * LY_EVALID - string contains invalid value,
411 * LY_SUCCESS - successful parsing.
412 */
Radek Krejci249973a2019-06-10 10:50:54 +0200413LY_ERR ly_parse_int(const char *val_str, size_t val_len, int64_t min, int64_t max, int base, int64_t *ret);
Radek Krejci4f28eda2018-11-12 11:46:16 +0100414
415/**
416 * @brief Parse unsigned integer with possible limitation.
417 * @param[in] val_str String value containing unsigned integer, note that
418 * nothing else than whitespaces are expected after the value itself.
Radek Krejci249973a2019-06-10 10:50:54 +0200419 * @param[in] val_len Length of the @p val_str string.
Radek Krejci4f28eda2018-11-12 11:46:16 +0100420 * @param[in] max Limitation for the value which must not be higher than max.
421 * @param[in] base Numeric base for parsing:
422 * 0 - to accept decimal, octal, hexadecimal (e.g. in default value)
423 * 10 - to accept only decimal (e.g. data instance value)
424 * @param[out] ret Resulting value.
425 * @return LY_ERR value:
426 * LY_EDENIED - the value breaks the limits,
427 * LY_EVALID - string contains invalid value,
428 * LY_SUCCESS - successful parsing.
429 */
Radek Krejci249973a2019-06-10 10:50:54 +0200430LY_ERR ly_parse_uint(const char *val_str, size_t val_len, uint64_t max, int base, uint64_t *ret);
Radek Krejci4f28eda2018-11-12 11:46:16 +0100431
432/**
Radek Krejcib4a4a272019-06-10 12:44:52 +0200433 * @brief Parse a node-identifier.
434 *
435 * node-identifier = [prefix ":"] identifier
436 *
437 * @param[in, out] id Identifier to parse. When returned, it points to the first character which is not part of the identifier.
438 * @param[out] prefix Node's prefix, NULL if there is not any.
439 * @param[out] prefix_len Length of the node's prefix, 0 if there is not any.
440 * @param[out] name Node's name.
441 * @param[out] nam_len Length of the node's name.
442 * @return LY_ERR value: LY_SUCCESS or LY_EINVAL in case of invalid character in the id.
443 */
444LY_ERR ly_parse_nodeid(const char **id, const char **prefix, size_t *prefix_len, const char **name, size_t *name_len);
445
446/**
447 * @brief parse instance-identifier's predicate, supports key-predicate, leaf-list-predicate and pos rules from YANG ABNF Grammar.
448 *
449 * @param[in, out] pred Predicate string (including the leading '[') to parse. The string is updated according to what was parsed
450 * (even for error case, so it can be used to determine which substring caused failure).
451 * @param[in] limit Limiting length of the @p pred. Function expects NULL terminated string which is not overread.
452 * The limit value is not checked with each character, so it can be overread and the failure is detected later.
Radek Krejci084289f2019-07-09 17:35:30 +0200453 * @param[in] format Input format of the data containing the @p pred.
Radek Krejcib4a4a272019-06-10 12:44:52 +0200454 * @param[out] prefix Start of the node-identifier's prefix if any, NULL in case of pos or leaf-list-predicate rules.
455 * @param[out] prefix_len Length of the parsed @p prefix.
456 * @param[out] id Start of the node-identifier's identifier string, NULL in case of pos rule, "." in case of leaf-list-predicate rule.
457 * @param[out] id_len Length of the parsed @p id.
Radek Krejci084289f2019-07-09 17:35:30 +0200458 * @param[out] value Start of the quoted-string (without quotation marks), not NULL in case of success.
Radek Krejcib4a4a272019-06-10 12:44:52 +0200459 * @param[out] value_len Length of the parsed @p value.
460 * @param[out] errmsg Error message string in case of error.
461 * @return LY_SUCCESS in case a complete predicate was parsed.
462 * @return LY_EVALID in case of invalid predicate form.
463 * @return LY_EINVAL in case of reaching @p limit when parsing @p pred.
464 */
Radek Krejci084289f2019-07-09 17:35:30 +0200465LY_ERR ly_parse_instance_predicate(const char **pred, size_t limit, LYD_FORMAT format,
Radek Krejci0f969882020-08-21 16:56:47 +0200466 const char **prefix, size_t *prefix_len, const char **id, size_t *id_len,
467 const char **value, size_t *value_len, const char **errmsg);
Michal Vasko1324b6c2018-09-07 11:16:23 +0200468
Radek Krejcif345c012018-09-19 11:12:59 +0200469/**
Radek Krejci86d106e2018-10-18 09:53:19 +0200470 * @brief mmap(2) wrapper to map input files into memory to unify parsing.
Radek Krejcif345c012018-09-19 11:12:59 +0200471 *
Radek Krejci86d106e2018-10-18 09:53:19 +0200472 * The address space is allocate only for reading.
473 *
474 * @param[in] ctx libyang context for logging
475 * @param[in] fd Open file descriptor of a file to map.
476 * @param[out] length Allocated size.
477 * @param[out] addr Address where the file is mapped.
Radek Krejcif345c012018-09-19 11:12:59 +0200478 * @return LY_ERR value.
479 */
Radek Krejci86d106e2018-10-18 09:53:19 +0200480LY_ERR ly_mmap(struct ly_ctx *ctx, int fd, size_t *length, void **addr);
Michal Vasko841d1a92018-09-07 15:40:31 +0200481
Radek Krejci86d106e2018-10-18 09:53:19 +0200482/**
Radek Krejci8678fa42020-08-18 16:07:28 +0200483 * @brief munmap(2) wrapper to free the memory mapped by ::ly_mmap()
Michal Vasko1324b6c2018-09-07 11:16:23 +0200484 *
Radek Krejci86d106e2018-10-18 09:53:19 +0200485 * @param[in] addr Address where the input file is mapped.
486 * @param[in] length Allocated size of the address space.
487 * @return LY_ERR value.
488 */
489LY_ERR ly_munmap(void *addr, size_t length);
490
491/**
Radek Krejci4546aa62019-07-15 16:53:32 +0200492 * @brief Concatenate formating string to the @p dest.
493 *
494 * @param[in, out] dest String to be concatenated by @p format.
495 * Note that the input string can be reallocated during concatenation.
496 * @param[in] format Formating string (as for printf) which is supposed to be added after @p dest.
497 * @return LY_SUCCESS or LY_EMEM.
498 */
499LY_ERR ly_strcat(char **dest, const char *format, ...);
500
501/**
Radek Krejci86d106e2018-10-18 09:53:19 +0200502 * @brief (Re-)Allocation of a ([sized array](@ref sizedarrays)).
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200503 *
Radek Krejci2c4e7172018-10-19 15:56:26 +0200504 * Increases the size information.
505 *
Radek Krejci86d106e2018-10-18 09:53:19 +0200506 * @param[in] CTX libyang context for logging.
Radek Krejci2c4e7172018-10-19 15:56:26 +0200507 * @param[in,out] ARRAY Pointer to the array to allocate/resize. The size of the allocated
508 * space is counted from the type of the ARRAY, so do not provide placeholder void pointers.
Radek Krejci86d106e2018-10-18 09:53:19 +0200509 * @param[out] NEW_ITEM Returning pointer to the newly allocated record in the ARRAY.
510 * @param[in] RETVAL Return value for the case of error (memory allocation failure).
Michal Vasko1324b6c2018-09-07 11:16:23 +0200511 */
Radek Krejci2c4e7172018-10-19 15:56:26 +0200512#define LY_ARRAY_NEW_RET(CTX, ARRAY, NEW_ITEM, RETVAL) \
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200513 if (!(ARRAY)) { \
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200514 ARRAY = malloc(sizeof(LY_ARRAY_COUNT_TYPE) + sizeof *(ARRAY)); \
515 *((LY_ARRAY_COUNT_TYPE*)(ARRAY)) = 1; \
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200516 } else { \
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200517 ++(*((LY_ARRAY_COUNT_TYPE*)(ARRAY) - 1)); \
518 ARRAY = ly_realloc(((LY_ARRAY_COUNT_TYPE*)(ARRAY) - 1), sizeof(LY_ARRAY_COUNT_TYPE) + (*((LY_ARRAY_COUNT_TYPE*)(ARRAY) - 1) * sizeof *(ARRAY))); \
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200519 LY_CHECK_ERR_RET(!(ARRAY), LOGMEM(CTX), RETVAL); \
520 } \
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200521 ARRAY = (void*)((LY_ARRAY_COUNT_TYPE*)(ARRAY) + 1); \
522 (NEW_ITEM) = &(ARRAY)[*((LY_ARRAY_COUNT_TYPE*)(ARRAY) - 1) - 1]; \
Radek Krejci2c4e7172018-10-19 15:56:26 +0200523 memset(NEW_ITEM, 0, sizeof *(NEW_ITEM))
Michal Vasko1324b6c2018-09-07 11:16:23 +0200524
Radek Krejci2c4e7172018-10-19 15:56:26 +0200525/**
Radek Krejci4f28eda2018-11-12 11:46:16 +0100526 * @brief (Re-)Allocation of a ([sized array](@ref sizedarrays)).
527 *
528 * Increases the size information.
529 *
530 * @param[in] CTX libyang context for logging.
531 * @param[in,out] ARRAY Pointer to the array to allocate/resize. The size of the allocated
532 * space is counted from the type of the ARRAY, so do not provide placeholder void pointers.
533 * @param[out] NEW_ITEM Returning pointer to the newly allocated record in the ARRAY.
534 * @param[out] RET Variable to store error code.
535 * @param[in] GOTO Label to go in case of error (memory allocation failure).
536 */
537#define LY_ARRAY_NEW_GOTO(CTX, ARRAY, NEW_ITEM, RET, GOTO) \
538 if (!(ARRAY)) { \
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200539 ARRAY = malloc(sizeof(LY_ARRAY_COUNT_TYPE) + sizeof *(ARRAY)); \
540 *((LY_ARRAY_COUNT_TYPE*)(ARRAY)) = 1; \
Radek Krejci4f28eda2018-11-12 11:46:16 +0100541 } else { \
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200542 ++(*((LY_ARRAY_COUNT_TYPE*)(ARRAY) - 1)); \
543 ARRAY = ly_realloc(((LY_ARRAY_COUNT_TYPE*)(ARRAY) - 1), sizeof(LY_ARRAY_COUNT_TYPE) + (*((LY_ARRAY_COUNT_TYPE*)(ARRAY) - 1) * sizeof *(ARRAY))); \
Radek Krejci4f28eda2018-11-12 11:46:16 +0100544 LY_CHECK_ERR_GOTO(!(ARRAY), LOGMEM(CTX); RET = LY_EMEM, GOTO); \
545 } \
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200546 ARRAY = (void*)((LY_ARRAY_COUNT_TYPE*)(ARRAY) + 1); \
547 (NEW_ITEM) = &(ARRAY)[*((LY_ARRAY_COUNT_TYPE*)(ARRAY) - 1) - 1]; \
Radek Krejci4f28eda2018-11-12 11:46:16 +0100548 memset(NEW_ITEM, 0, sizeof *(NEW_ITEM))
549
550/**
Radek Krejci2c4e7172018-10-19 15:56:26 +0200551 * @brief Allocate a ([sized array](@ref sizedarrays)) for the specified number of items.
Radek Krejcic4fa0292020-05-14 10:54:49 +0200552 * If the ARRAY already exists, it is resized (space for SIZE items is added and zeroed).
Radek Krejci2c4e7172018-10-19 15:56:26 +0200553 *
554 * Does not set the size information, it is supposed to be incremented via ::LY_ARRAY_INCREMENT
555 * when the items are filled.
556 *
557 * @param[in] CTX libyang context for logging.
558 * @param[in,out] ARRAY Pointer to the array to create.
559 * @param[in] SIZE Number of items the array is supposed to hold. The size of the allocated
560 * space is then counted from the type of the ARRAY, so do not provide placeholder void pointers.
561 * @param[in] RETVAL Return value for the case of error (memory allocation failure).
562 */
563#define LY_ARRAY_CREATE_RET(CTX, ARRAY, SIZE, RETVAL) \
Radek Krejcid05cbd92018-12-05 14:26:40 +0100564 if (ARRAY) { \
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200565 ARRAY = ly_realloc(((LY_ARRAY_COUNT_TYPE*)(ARRAY) - 1), sizeof(LY_ARRAY_COUNT_TYPE) + ((*((LY_ARRAY_COUNT_TYPE*)(ARRAY) - 1) + SIZE) * sizeof *(ARRAY))); \
Radek Krejcid05cbd92018-12-05 14:26:40 +0100566 LY_CHECK_ERR_RET(!(ARRAY), LOGMEM(CTX), RETVAL); \
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200567 ARRAY = (void*)((LY_ARRAY_COUNT_TYPE*)(ARRAY) + 1); \
568 memset(&(ARRAY)[*((LY_ARRAY_COUNT_TYPE*)(ARRAY) - 1)], 0, SIZE * sizeof *(ARRAY)); \
Radek Krejcid05cbd92018-12-05 14:26:40 +0100569 } else { \
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200570 ARRAY = calloc(1, sizeof(LY_ARRAY_COUNT_TYPE) + SIZE * sizeof *(ARRAY)); \
Radek Krejcid05cbd92018-12-05 14:26:40 +0100571 LY_CHECK_ERR_RET(!(ARRAY), LOGMEM(CTX), RETVAL); \
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200572 ARRAY = (void*)((LY_ARRAY_COUNT_TYPE*)(ARRAY) + 1); \
Radek Krejcid05cbd92018-12-05 14:26:40 +0100573 }
Radek Krejci2c4e7172018-10-19 15:56:26 +0200574
Radek Krejci6d6e4e42018-10-29 13:28:19 +0100575/**
576 * @brief Allocate a ([sized array](@ref sizedarrays)) for the specified number of items.
Radek Krejcid05cbd92018-12-05 14:26:40 +0100577 * If the ARRAY already exists, it is resized (space for SIZE items is added).
Radek Krejci6d6e4e42018-10-29 13:28:19 +0100578 *
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200579 * Does not set the count information, it is supposed to be incremented via ::LY_ARRAY_INCREMENT
Radek Krejci6d6e4e42018-10-29 13:28:19 +0100580 * when the items are filled.
581 *
582 * @param[in] CTX libyang context for logging.
583 * @param[in,out] ARRAY Pointer to the array to create.
Radek Krejci00b874b2019-02-12 10:54:50 +0100584 * @param[in] SIZE Number of the new items the array is supposed to hold. The size of the allocated
Radek Krejci6d6e4e42018-10-29 13:28:19 +0100585 * space is then counted from the type of the ARRAY, so do not provide placeholder void pointers.
586 * @param[out] RET Variable to store error code.
587 * @param[in] GOTO Label to go in case of error (memory allocation failure).
588 */
589#define LY_ARRAY_CREATE_GOTO(CTX, ARRAY, SIZE, RET, GOTO) \
Radek Krejcid05cbd92018-12-05 14:26:40 +0100590 if (ARRAY) { \
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200591 ARRAY = ly_realloc(((LY_ARRAY_COUNT_TYPE*)(ARRAY) - 1), sizeof(LY_ARRAY_COUNT_TYPE) + ((*((LY_ARRAY_COUNT_TYPE*)(ARRAY) - 1) + (SIZE)) * sizeof *(ARRAY))); \
Radek Krejcid05cbd92018-12-05 14:26:40 +0100592 LY_CHECK_ERR_GOTO(!(ARRAY), LOGMEM(CTX); RET = LY_EMEM, GOTO); \
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200593 ARRAY = (void*)((LY_ARRAY_COUNT_TYPE*)(ARRAY) + 1); \
594 memset(&(ARRAY)[*((LY_ARRAY_COUNT_TYPE*)(ARRAY) - 1)], 0, (SIZE) * sizeof *(ARRAY)); \
Radek Krejcid05cbd92018-12-05 14:26:40 +0100595 } else { \
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200596 ARRAY = calloc(1, sizeof(LY_ARRAY_COUNT_TYPE) + (SIZE) * sizeof *(ARRAY)); \
Radek Krejcid05cbd92018-12-05 14:26:40 +0100597 LY_CHECK_ERR_GOTO(!(ARRAY), LOGMEM(CTX); RET = LY_EMEM, GOTO); \
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200598 ARRAY = (void*)((LY_ARRAY_COUNT_TYPE*)(ARRAY) + 1); \
Radek Krejcid05cbd92018-12-05 14:26:40 +0100599 }
Radek Krejci6d6e4e42018-10-29 13:28:19 +0100600
Radek Krejcic4fa0292020-05-14 10:54:49 +0200601/**
602 * @brief Resize a ([sized array](@ref sizedarrays)) to the the specified number of items.
603 *
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200604 * Does not change the count information, it is supposed to be incremented via ::LY_ARRAY_INCREMENT
Radek Krejcic4fa0292020-05-14 10:54:49 +0200605 * when the items are filled.
606 *
607 * @param[in] CTX libyang context for logging.
608 * @param[in,out] ARRAY Pointer to the array to create.
609 * @param[in] SIZE Number of items the array is supposed to hold. The size of the allocated
610 * space is then counted from the type of the ARRAY, so do not provide placeholder void pointers.
611 * @param[in] ERR Additional action(s) in case of error (passed to LY_CHECK_ERR_RET).
612 * @param[in] RETVAL Return value for the case of error (memory allocation failure).
613 */
614#define LY_ARRAY_RESIZE_ERR_RET(CTX, ARRAY, SIZE, ERR, RETVAL) \
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200615 ARRAY = ly_realloc(((LY_ARRAY_COUNT_TYPE*)(ARRAY) - 1), sizeof(LY_ARRAY_COUNT_TYPE) + ((SIZE) * sizeof *(ARRAY))); \
Radek Krejcic4fa0292020-05-14 10:54:49 +0200616 LY_CHECK_ERR_RET(!(ARRAY), LOGMEM(CTX); ERR, RETVAL); \
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200617 ARRAY = (void*)((LY_ARRAY_COUNT_TYPE*)(ARRAY) + 1);
Radek Krejciccd20f12019-02-15 14:12:27 +0100618
Radek Krejcic4fa0292020-05-14 10:54:49 +0200619/**
620 * @brief Increment the items counter in a ([sized array](@ref sizedarrays)).
621 *
622 * Does not change the allocated memory used by the ARRAY. To do so, use LY_ARRAY_CREATE_RET,
623 * LY_ARRAY_CREATE_GOTO or LY_ARRAY_RESIZE_ERR_RET.
624 *
625 * @param[in] ARRAY Pointer to the array to affect.
626 */
627#define LY_ARRAY_INCREMENT(ARRAY) \
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200628 ++(*((LY_ARRAY_COUNT_TYPE*)(ARRAY) - 1))
Radek Krejcic4fa0292020-05-14 10:54:49 +0200629
630/**
631 * @brief Decrement the items counter in a ([sized array](@ref sizedarrays)).
632 *
633 * Does not change the allocated memory used by the ARRAY. To do so, use LY_ARRAY_CREATE_RET,
634 * LY_ARRAY_CREATE_GOTO or LY_ARRAY_RESIZE_ERR_RET.
635 *
636 * @param[in] ARRAY Pointer to the array to affect.
637 */
Radek Krejciccd20f12019-02-15 14:12:27 +0100638#define LY_ARRAY_DECREMENT(ARRAY) \
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200639 --(*((LY_ARRAY_COUNT_TYPE*)(ARRAY) - 1))
Radek Krejciccd20f12019-02-15 14:12:27 +0100640
Radek Krejci2c4e7172018-10-19 15:56:26 +0200641/**
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100642 * @brief Decrement the items counter in a ([sized array](@ref sizedarrays)) and free the whole array
643 * in case it was decremented to 0.
644 *
645 * @param[in] ARRAY Pointer to the array to affect.
646 */
647#define LY_ARRAY_DECREMENT_FREE(ARRAY) \
648 --(*((LY_ARRAY_COUNT_TYPE*)(ARRAY) - 1)); \
649 if (!LY_ARRAY_COUNT(ARRAY)) { \
650 LY_ARRAY_FREE(ARRAY); \
651 (ARRAY) = NULL; \
652 }
653
654/**
Radek Krejci2c4e7172018-10-19 15:56:26 +0200655 * @brief Free the space allocated for the ([sized array](@ref sizedarrays)).
656 *
657 * The items inside the array are not freed.
658 *
659 * @param[in] ARRAY A ([sized array](@ref sizedarrays)) to be freed.
660 */
661#define LY_ARRAY_FREE(ARRAY) \
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200662 if (ARRAY){free((LY_ARRAY_COUNT_TYPE*)(ARRAY) - 1);}
David Sedlák8d552d62019-08-06 15:29:05 +0200663
David Sedlák26ea1432019-08-14 13:42:23 +0200664/**
David Sedlákaa98bba2019-09-12 11:52:14 +0200665 * @brief Insert item into linked list.
David Sedlák26ea1432019-08-14 13:42:23 +0200666 *
667 * @param[in,out] LIST Linked list to add to.
668 * @param[in] NEW_ITEM New item, that will be appended to the list, must be already allocated.
669 * @param[in] LINKER name of structuin member that is used to connect items together.
670 */
David Sedlák8d552d62019-08-06 15:29:05 +0200671#define LY_LIST_INSERT(LIST, NEW_ITEM, LINKER)\
672 if (!(*LIST)) { \
673 *LIST = (__typeof__(*(LIST)))NEW_ITEM; \
674 } else { \
675 do { \
676 __typeof__(*(LIST)) iterator; \
Radek Krejci1e008d22020-08-17 11:37:37 +0200677 for (iterator = *(LIST); iterator->LINKER; iterator = iterator->LINKER) {} \
David Sedlák8d552d62019-08-06 15:29:05 +0200678 iterator->LINKER = (__typeof__(*(LIST)))NEW_ITEM; \
679 } while (0); \
680 }
681
David Sedlák26ea1432019-08-14 13:42:23 +0200682/**
David Sedlákaa98bba2019-09-12 11:52:14 +0200683 * @brief Allocate and insert new item into linked list, return in case of error.
David Sedlák26ea1432019-08-14 13:42:23 +0200684 *
David Sedláke6284fc2019-09-10 11:57:02 +0200685 * @param[in] CTX used for logging.
686 * @param[in,out] LIST Linked list to add to.
687 * @param[out] NEW_ITEM New item that is appended to the list.
688 * @param[in] LINKER name of structure member that is used to connect items together.
David Sedlákfbe240f2019-09-13 11:18:53 +0200689 * @param[in] RETVAL Return value for the case of error (memory allocation failure).
David Sedlák26ea1432019-08-14 13:42:23 +0200690 */
David Sedlákb9eeb9c2019-09-13 11:17:19 +0200691#define LY_LIST_NEW_RET(CTX, LIST, NEW_ITEM, LINKER, RETVAL) \
David Sedlák8d552d62019-08-06 15:29:05 +0200692 NEW_ITEM = calloc(1, sizeof *NEW_ITEM); \
David Sedlákb9eeb9c2019-09-13 11:17:19 +0200693 LY_CHECK_ERR_RET(!(NEW_ITEM), LOGMEM(CTX), RETVAL); \
David Sedlák8d552d62019-08-06 15:29:05 +0200694 LY_LIST_INSERT(LIST, NEW_ITEM, LINKER)
695
David Sedláke6284fc2019-09-10 11:57:02 +0200696/**
David Sedlákaa98bba2019-09-12 11:52:14 +0200697 * @brief Allocate and insert new item into linked list, goto specified label in case of error.
David Sedláke6284fc2019-09-10 11:57:02 +0200698 *
699 * @param[in] CTX used for logging.
700 * @param[in,out] LIST Linked list to add to.
701 * @param[out] NEW_ITEM New item that is appended to the list.
702 * @param[in] LINKER name of structure member that is used to connect items together.
703 * @param[in] RET variable to store returned error type.
704 * @param[in] LABEL label to goto in case of error.
705 */
706#define LY_LIST_NEW_GOTO(CTX, LIST, NEW_ITEM, LINKER, RET, LABEL) \
707 NEW_ITEM = calloc(1, sizeof *NEW_ITEM); \
708 LY_CHECK_ERR_GOTO(!(NEW_ITEM), RET = LY_EMEM; LOGMEM(CTX), LABEL); \
709 LY_LIST_INSERT(LIST, NEW_ITEM, LINKER)
710
David Sedláke6cd89e2019-08-07 12:46:02 +0200711#endif /* LY_COMMON_H_ */