blob: a9e100ec4115430c0275f1dd9fd00c566cb216bb [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 Krejciaddfc9a2020-12-17 20:46:35 +010031struct ly_in;
Radek Krejci535ea9f2020-05-29 16:01:05 +020032struct lys_module;
Radek Krejci5aeea3a2018-09-05 13:29:36 +020033
34#if __STDC_VERSION__ >= 201112 && !defined __STDC_NO_THREADS__
35# define THREAD_LOCAL _Thread_local
36#elif defined __GNUC__ || \
Radek Krejci0f969882020-08-21 16:56:47 +020037 defined __SUNPRO_C || \
38 defined __xlC__
Radek Krejci5aeea3a2018-09-05 13:29:36 +020039# define THREAD_LOCAL __thread
40#else
41# error "Cannot define THREAD_LOCAL"
42#endif
43
Radek Krejcic59bc972018-09-17 16:13:06 +020044#define GETMACRO1(_1, NAME, ...) NAME
Radek Krejci5aeea3a2018-09-05 13:29:36 +020045#define GETMACRO2(_1, _2, NAME, ...) NAME
46#define GETMACRO3(_1, _2, _3, NAME, ...) NAME
47#define GETMACRO4(_1, _2, _3, _4, NAME, ...) NAME
Michal Vaskodc779a82019-11-06 15:44:06 +010048#define GETMACRO5(_1, _2, _3, _4, _5, NAME, ...) NAME
Radek Krejci5aeea3a2018-09-05 13:29:36 +020049
50/*
Radek Krejcic59bc972018-09-17 16:13:06 +020051 * If the compiler supports attribute to mark objects as hidden, mark all
52 * objects as hidden and export only objects explicitly marked to be part of
53 * the public API.
Radek Krejci5aeea3a2018-09-05 13:29:36 +020054 */
Radek Krejcic59bc972018-09-17 16:13:06 +020055#define API __attribute__((visibility("default")))
56
57/******************************************************************************
58 * Logger
59 *****************************************************************************/
Radek Krejci5aeea3a2018-09-05 13:29:36 +020060
Radek Krejci52b6d512020-10-12 12:33:17 +020061extern volatile LY_LOG_LEVEL ly_ll;
Radek Krejci1deb5be2020-08-26 16:43:36 +020062extern volatile uint32_t ly_log_opts;
Radek Krejci5aeea3a2018-09-05 13:29:36 +020063
Radek Krejciaddfc9a2020-12-17 20:46:35 +010064struct ly_log_location_s {
65 uint64_t line; /**< One-time line value being reset after use - replaces whatever is in inputs */
66 struct ly_set inputs; /**< Set of const struct ly_in *in pointers providing the input handler with the line information (LIFO) */
67 struct ly_set scnodes; /**< Set of const struct lysc_node *scnode pointers providing the compiled schema node to generate path (LIFO) */
68 struct ly_set dnodes; /**< Set of const struct lyd_node *dnode pointers providing the data node to generate path (LIFO) */
69 struct ly_set paths; /**< Set of path strings (LIFO) */
70};
71
72/**
Radek Krejcie7b95092019-05-15 11:03:07 +020073 * @brief Print a log message and store it into the context (if provided).
74 *
75 * @param[in] ctx libyang context to store the error record. If not provided, the error is just printed.
76 * @param[in] level Log message level (error, warning, etc.)
77 * @param[in] no Error type code.
78 * @param[in] format Format string to print.
79 */
Radek Krejci5aeea3a2018-09-05 13:29:36 +020080void ly_log(const struct ly_ctx *ctx, LY_LOG_LEVEL level, LY_ERR no, const char *format, ...);
Radek Krejcie7b95092019-05-15 11:03:07 +020081
82/**
83 * @brief Print Validation error and store it into the context (if provided).
84 *
85 * @param[in] ctx libyang context to store the error record. If not provided, the error is just printed.
Radek Krejcie7b95092019-05-15 11:03:07 +020086 * @param[in] code Validation error code.
87 * @param[in] format Format string to print.
88 */
Radek Krejci2efc45b2020-12-22 16:25:44 +010089void ly_vlog(const struct ly_ctx *ctx, LY_VECODE code, const char *format, ...);
Radek Krejci5aeea3a2018-09-05 13:29:36 +020090
Radek Krejciaddfc9a2020-12-17 20:46:35 +010091/**
92 * @brief Logger's location data setter.
93 *
Radek Krejciaddfc9a2020-12-17 20:46:35 +010094 * @param[in] scnode Compiled schema node.
95 * @param[in] dnode Data node.
96 * @param[in] path Direct path string to print.
97 * @param[in] in Input handler (providing line number)
98 * @param[in] line One-time line value to be reset when used.
99 * @param[in] reset Flag to indicate if the not set arguments (NULLs) are intended to rewrite the current values or if they
100 * are supposed to be ignored and the previous values should be kept.
101 */
Radek Krejciddace2c2021-01-08 11:30:56 +0100102void ly_log_location(const struct lysc_node *scnode, const struct lyd_node *dnode,
Radek Krejciaddfc9a2020-12-17 20:46:35 +0100103 const char *path, const struct ly_in *in, uint64_t line, ly_bool reset);
104
105/**
106 * @brief Revert the specific logger's location data by number of changes made by ::ly_log_location().
107 *
Radek Krejciddace2c2021-01-08 11:30:56 +0100108 * @param[in] scnode_steps Number of items in ::log_location.scnodes to forget.
109 * @param[in] dnode_steps Number of items in ::log_location.dnodes to forget.
110 * @param[in] path_steps Number of path strings in ::log_location.paths to forget.
111 * @param[in] in_steps Number of input handlers ::log_location.inputs to forget.
Radek Krejciaddfc9a2020-12-17 20:46:35 +0100112 */
Radek Krejciddace2c2021-01-08 11:30:56 +0100113void ly_log_location_revert(uint32_t scnode_steps, uint32_t dnode_steps, uint32_t path_steps, uint32_t in_steps);
Radek Krejciaddfc9a2020-12-17 20:46:35 +0100114
115/**
116 * @brief Initiate location data for logger, all arguments are set as provided (even NULLs) - overrides the current values.
117 *
Radek Krejciaddfc9a2020-12-17 20:46:35 +0100118 * @param[in] SCNODE Compiled schema node.
119 * @param[in] DNODE Data node.
120 * @param[in] PATH Direct path string to print.
121 * @param[in] IN Input handler (providing line number)
122 */
Radek Krejciddace2c2021-01-08 11:30:56 +0100123#define LOG_LOCINIT(SCNODE, DNODE, PATH, IN) \
124 ly_log_location(SCNODE, DNODE, PATH, IN, 0, 1)
Radek Krejciaddfc9a2020-12-17 20:46:35 +0100125
126/**
127 * @brief Update location data for logger, not provided arguments (NULLs) are kept (does not override).
128 *
Radek Krejciaddfc9a2020-12-17 20:46:35 +0100129 * @param[in] SCNODE Compiled schema node.
130 * @param[in] DNODE Data node.
131 * @param[in] PATH Direct path string to print.
132 * @param[in] IN Input handler (providing line number)
133 */
Radek Krejciddace2c2021-01-08 11:30:56 +0100134#define LOG_LOCSET(SCNODE, DNODE, PATH, IN) \
135 ly_log_location(SCNODE, DNODE, PATH, IN, 0, 0)
Radek Krejciaddfc9a2020-12-17 20:46:35 +0100136
Radek Krejciddace2c2021-01-08 11:30:56 +0100137/**
138 * @brief Update location data for logger, not provided arguments (NULLs) are kept (does not override).
139 *
140 * @param[in] SCNODE_STEPS Number of the compiled schema nodes to remove from the stack.
141 * @param[in] DNODE_STEPS Number of the data nodes to remove from the stack.
142 * @param[in] PATH_STEPS Number of the direct path strings to remove from the stack.
143 * @param[in] IN_STEPS Number of the input handlers (providing line number) to remove from the stack.
144 */
145#define LOG_LOCBACK(SCNODE_STEPS, DNODE_STEPS, PATH_STEPS, IN_STEPS) \
146 ly_log_location_revert(SCNODE_STEPS, DNODE_STEPS, PATH_STEPS, IN_STEPS)
Radek Krejciaddfc9a2020-12-17 20:46:35 +0100147
Radek Krejcic0c66412020-08-21 13:53:50 +0200148#define LOGERR(ctx, errno, str, ...) ly_log(ctx, LY_LLERR, errno, str, ##__VA_ARGS__)
Radek Krejcif3f47842018-11-15 11:22:15 +0100149#define LOGWRN(ctx, str, ...) ly_log(ctx, LY_LLWRN, 0, str, ##__VA_ARGS__)
Radek Krejcic0c66412020-08-21 13:53:50 +0200150#define LOGVRB(str, ...) ly_log(NULL, LY_LLVRB, 0, str, ##__VA_ARGS__)
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200151
Radek Krejci4ab61562018-09-05 15:00:37 +0200152#ifdef NDEBUG
Radek Krejcic0c66412020-08-21 13:53:50 +0200153# define LOGDBG(dbg_group, str, ...)
Radek Krejci4ab61562018-09-05 15:00:37 +0200154#else
Radek Krejci1deb5be2020-08-26 16:43:36 +0200155void ly_log_dbg(uint32_t group, const char *format, ...);
Radek Krejcic0c66412020-08-21 13:53:50 +0200156# define LOGDBG(dbg_group, str, ...) ly_log_dbg(dbg_group, str, ##__VA_ARGS__);
Radek Krejci4ab61562018-09-05 15:00:37 +0200157#endif
158
Radek Krejcie2692202020-12-01 14:21:12 +0100159/**
160 * Simple EMEM message, it can be safely stored in ::ly_err_item structures without problems when freeing.
161 */
162#define LY_EMEM_MSG "Memory allocation failed."
163
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200164#define LOGMEM(CTX) LOGERR(CTX, LY_EMEM, "Memory allocation failed (%s()).", __func__)
165#define LOGINT(CTX) LOGERR(CTX, LY_EINT, "Internal error (%s:%d).", __FILE__, __LINE__)
166#define LOGARG(CTX, ARG) LOGERR(CTX, LY_EINVAL, "Invalid argument %s (%s()).", #ARG, __func__)
Radek Krejci2efc45b2020-12-22 16:25:44 +0100167#define LOGVAL(CTX, CODE, ...) ly_vlog(CTX, CODE, ##__VA_ARGS__)
168#define LOGVAL_LINE(CTX, LINE, CODE, ...) \
Radek Krejciddace2c2021-01-08 11:30:56 +0100169 ly_log_location(NULL, NULL, NULL, NULL, LINE, 0); \
Radek Krejci2efc45b2020-12-22 16:25:44 +0100170 ly_vlog(CTX, CODE, ##__VA_ARGS__)
Radek Krejci94aa9942018-09-07 17:12:17 +0200171
172#define LOGMEM_RET(CTX) LOGMEM(CTX); return LY_EMEM
173#define LOGINT_RET(CTX) LOGINT(CTX); return LY_EINT
174#define LOGARG_RET(CTX) LOGARG(CTX); return LY_EINVAL
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200175
176/*
177 * Common code to check return value and perform appropriate action.
178 */
Radek Krejcie88beef2019-05-30 15:47:19 +0200179#define LY_CHECK_GOTO(COND, GOTO) if ((COND)) {goto GOTO;}
180#define LY_CHECK_ERR_GOTO(COND, ERR, GOTO) if ((COND)) {ERR; goto GOTO;}
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100181#define LY_CHECK_RET1(RETVAL) {LY_ERR ret__ = RETVAL;if (ret__ != LY_SUCCESS) {return ret__;}}
Radek Krejcie88beef2019-05-30 15:47:19 +0200182#define LY_CHECK_RET2(COND, RETVAL) if ((COND)) {return RETVAL;}
Radek Krejcic59bc972018-09-17 16:13:06 +0200183#define LY_CHECK_RET(...) GETMACRO2(__VA_ARGS__, LY_CHECK_RET2, LY_CHECK_RET1)(__VA_ARGS__)
Radek Krejcie88beef2019-05-30 15:47:19 +0200184#define LY_CHECK_ERR_RET(COND, ERR, RETVAL) if ((COND)) {ERR; return RETVAL;}
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200185
Radek Krejcia3045382018-11-22 14:30:31 +0100186#define LY_CHECK_ARG_GOTO1(CTX, ARG, GOTO) if (!(ARG)) {LOGARG(CTX, ARG);goto GOTO;}
Michal Vaskob3d0d6b2018-09-07 10:17:33 +0200187#define LY_CHECK_ARG_GOTO2(CTX, ARG1, ARG2, GOTO) LY_CHECK_ARG_GOTO1(CTX, ARG1, GOTO);LY_CHECK_ARG_GOTO1(CTX, ARG2, GOTO)
188#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 +0100189#define LY_CHECK_ARG_GOTO4(CTX, ARG1, ARG2, ARG3, ARG4, GOTO) LY_CHECK_ARG_GOTO3(CTX, ARG1, ARG2, ARG3, GOTO);\
190 LY_CHECK_ARG_GOTO1(CTX, ARG4, GOTO)
191#define LY_CHECK_ARG_GOTO(CTX, ...) GETMACRO5(__VA_ARGS__, LY_CHECK_ARG_GOTO4, LY_CHECK_ARG_GOTO3, LY_CHECK_ARG_GOTO2, \
192 LY_CHECK_ARG_GOTO1)(CTX, __VA_ARGS__)
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200193
Radek Krejcia3045382018-11-22 14:30:31 +0100194#define LY_CHECK_ARG_RET1(CTX, ARG, RETVAL) if (!(ARG)) {LOGARG(CTX, ARG);return RETVAL;}
Michal Vaskob3d0d6b2018-09-07 10:17:33 +0200195#define LY_CHECK_ARG_RET2(CTX, ARG1, ARG2, RETVAL) LY_CHECK_ARG_RET1(CTX, ARG1, RETVAL);LY_CHECK_ARG_RET1(CTX, ARG2, RETVAL)
196#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 +0100197#define LY_CHECK_ARG_RET4(CTX, ARG1, ARG2, ARG3, ARG4, RETVAL) LY_CHECK_ARG_RET3(CTX, ARG1, ARG2, ARG3, RETVAL);\
198 LY_CHECK_ARG_RET1(CTX, ARG4, RETVAL)
199#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)\
200 (CTX, __VA_ARGS__)
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200201
Radek Krejcid972c252018-09-25 13:23:39 +0200202/* count sequence size for LY_VCODE_INCHILDSTMT validation error code */
203size_t LY_VCODE_INSTREXP_len(const char *str);
204/* default maximum characters to print in LY_VCODE_INCHILDSTMT */
205#define LY_VCODE_INSTREXP_MAXLEN 20
206
Michal Vaskoecd62de2019-11-13 12:35:11 +0100207#define LY_VCODE_INCHAR LYVE_SYNTAX, "Invalid character 0x%x."
208#define LY_VCODE_INSTREXP LYVE_SYNTAX, "Invalid character sequence \"%.*s\", expected %s."
209#define LY_VCODE_EOF LYVE_SYNTAX, "Unexpected end-of-input."
210#define LY_VCODE_NTERM LYVE_SYNTAX, "%s not terminated."
211#define LY_VCODE_NSUPP LYVE_SYNTAX, "%s not supported."
212#define LY_VCODE_MOD_SUBOMD LYVE_SYNTAX, "Invalid keyword \"%s\", expected \"module\" or \"submodule\"."
213#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 +0200214#define LY_VCODE_TRAILING_SUBMOD LYVE_SYNTAX, "Trailing garbage \"%.*s%s\" after submodule, expected end-of-input."
215
Michal Vaskoecd62de2019-11-13 12:35:11 +0100216#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."
Radek Krejci854e1552020-12-21 15:05:23 +0100217#define LY_VCODE_NAME_COL LYVE_SEMANTICS, "Name collision between %s of name \"%s\"."
218#define LY_VCODE_NAME2_COL LYVE_SEMANTICS, "Name collision between %s and %s of name \"%s\"."
David Sedlák0c2bab92019-07-22 15:33:19 +0200219
Michal Vaskoecd62de2019-11-13 12:35:11 +0100220#define LY_VCODE_INSTMT LYVE_SYNTAX_YANG, "Invalid keyword \"%s\"."
221#define LY_VCODE_INCHILDSTMT LYVE_SYNTAX_YANG, "Invalid keyword \"%s\" as a child of \"%s\"."
222#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 +0100223#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 +0100224#define LY_VCODE_DUPSTMT LYVE_SYNTAX_YANG, "Duplicate keyword \"%s\"."
225#define LY_VCODE_DUPIDENT LYVE_SYNTAX_YANG, "Duplicate identifier \"%s\" of %s statement."
226#define LY_VCODE_INVAL LYVE_SYNTAX_YANG, "Invalid value \"%.*s\" of \"%s\"."
227#define LY_VCODE_MISSTMT LYVE_SYNTAX_YANG, "Missing mandatory keyword \"%s\" as a child of \"%s\"."
228#define LY_VCODE_MISSCHILDSTMT LYVE_SYNTAX_YANG, "Missing %s substatement for %s%s."
229#define LY_VCODE_INORD LYVE_SYNTAX_YANG, "Invalid keyword \"%s\", it cannot appear after \"%s\"."
230#define LY_VCODE_OOB LYVE_SYNTAX_YANG, "Value \"%.*s\" is out of \"%s\" bounds."
231#define LY_VCODE_INDEV LYVE_SYNTAX_YANG, "Deviate \"%s\" does not support keyword \"%s\"."
232#define LY_VCODE_INREGEXP LYVE_SYNTAX_YANG, "Regular expression \"%s\" is not valid (\"%s\": %s)."
David Sedlák0c2bab92019-07-22 15:33:19 +0200233
Michal Vaskoecd62de2019-11-13 12:35:11 +0100234#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."
235#define LY_VCODE_INVAL_YIN LYVE_SYNTAX_YIN, "Invalid value \"%s\" of \"%s\" attribute in \"%s\" element."
236#define LY_VCODE_UNEXP_SUBELEM LYVE_SYNTAX_YIN, "Unexpected sub-element \"%.*s\" of \"%s\" element."
237#define LY_VCODE_INDEV_YIN LYVE_SYNTAX_YIN, "Deviate of this type doesn't allow \"%s\" as it's sub-element."
238#define LY_VCODE_INORDER_YIN LYVE_SYNTAX_YIN, "Invalid order of %s\'s sub-elements \"%s\" can't appear after \"%s\"."
239#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 +0200240#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 +0100241#define LY_VCODE_DUP_ATTR LYVE_SYNTAX_YIN, "Duplicit definition of \"%s\" attribute in \"%s\" element."
242#define LY_VCODE_UNEXP_ATTR LYVE_SYNTAX_YIN, "Unexpected attribute \"%.*s\" of \"%s\" element."
243#define LY_VCODE_MAND_SUBELEM LYVE_SYNTAX_YIN, "Missing mandatory sub-element \"%s\" of \"%s\" element."
244#define LY_VCODE_FIRT_SUBELEM LYVE_SYNTAX_YIN, "Sub-element \"%s\" of \"%s\" element must be defined as it's first sub-element."
Michal Vaskoecd62de2019-11-13 12:35:11 +0100245#define LY_VCODE_SUBELEM_REDEF LYVE_SYNTAX_YIN, "Redefinition of \"%s\" sub-element in \"%s\" element."
David Sedlák0c2bab92019-07-22 15:33:19 +0200246
Michal Vaskoecd62de2019-11-13 12:35:11 +0100247#define LY_VCODE_XP_EOE LYVE_XPATH, "Unterminated string delimited with %c (%.15s)."
248#define LY_VCODE_XP_INEXPR LYVE_XPATH, "Invalid character number %u of expression \'%s\'."
249#define LY_VCODE_XP_EOF LYVE_XPATH, "Unexpected XPath expression end."
Michal Vasko0b468e62020-10-19 09:33:04 +0200250#define LY_VCODE_XP_INTOK LYVE_XPATH, "Unexpected XPath token \"%s\" (\"%.15s\")."
251#define LY_VCODE_XP_INTOK2 LYVE_XPATH, "Unexpected XPath token \"%s\" (\"%.15s\"), expected \"%s\"."
Michal Vaskoecd62de2019-11-13 12:35:11 +0100252#define LY_VCODE_XP_INFUNC LYVE_XPATH, "Unknown XPath function \"%.*s\"."
253#define LY_VCODE_XP_INARGCOUNT LYVE_XPATH, "Invalid number of arguments (%d) for the XPath function %.*s."
254#define LY_VCODE_XP_INARGTYPE LYVE_XPATH, "Wrong type of argument #%d (%s) for the XPath function %s."
255#define LY_VCODE_XP_INCTX LYVE_XPATH, "Invalid context type %s in %s."
Michal Vaskoecd62de2019-11-13 12:35:11 +0100256#define LY_VCODE_XP_INOP_1 LYVE_XPATH, "Cannot apply XPath operation %s on %s."
257#define LY_VCODE_XP_INOP_2 LYVE_XPATH, "Cannot apply XPath operation %s on %s and %s."
Michal Vasko004d3152020-06-11 19:59:22 +0200258#define LY_VCODE_XP_INMOD LYVE_XPATH, "Unknown/non-implemented module \"%.*s\"."
David Sedlák0c2bab92019-07-22 15:33:19 +0200259
Radek Krejci327de162019-06-14 12:52:07 +0200260#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 +0200261
Michal Vaskoecd62de2019-11-13 12:35:11 +0100262#define LY_VCODE_NOWHEN LYVE_DATA, "When condition \"%s\" not satisfied."
Michal Vaskocc048b22020-03-27 15:52:38 +0100263#define LY_VCODE_NOMUST LYVE_DATA, "Must condition \"%s\" not satisfied."
Michal Vaskoa3881362020-01-21 15:57:35 +0100264#define LY_VCODE_NOMAND LYVE_DATA, "Mandatory node \"%s\" instance does not exist."
Michal Vaskoacd83e72020-02-04 14:12:01 +0100265#define LY_VCODE_NOMIN LYVE_DATA, "Too few \"%s\" instances."
266#define LY_VCODE_NOMAX LYVE_DATA, "Too many \"%s\" instances."
Michal Vasko14654712020-02-06 08:35:21 +0100267#define LY_VCODE_NOUNIQ LYVE_DATA, "Unique data leaf(s) \"%s\" not satisfied in \"%s\" and \"%s\"."
Michal Vaskof03ed032020-03-04 13:31:44 +0100268#define LY_VCODE_DUP LYVE_DATA, "Duplicate instance of \"%s\"."
269#define LY_VCODE_DUPCASE LYVE_DATA, "Data for both cases \"%s\" and \"%s\" exist."
Michal Vaskocb7526d2020-03-30 15:08:26 +0200270#define LY_VCODE_INNODE LYVE_DATA, "Invalid %s data node \"%s\" found."
Michal Vasko9f96a052020-03-10 09:41:45 +0100271#define LY_VCODE_NOKEY LYVE_DATA, "List instance is missing its key \"%s\"."
Michal Vaskoecd62de2019-11-13 12:35:11 +0100272
Radek Krejcic59bc972018-09-17 16:13:06 +0200273/******************************************************************************
Radek Krejci6caa6ab2018-10-24 10:04:48 +0200274 * Context
275 *****************************************************************************/
276
277/**
278 * @brief Context of the YANG schemas
279 */
280struct ly_ctx {
281 struct dict_table dict; /**< dictionary to effectively store strings used in the context related structures */
282 struct ly_set search_paths; /**< set of directories where to search for schema's imports/includes */
Michal Vasko89b5c072020-10-06 13:52:44 +0200283 struct ly_set list; /**< set of loaded YANG schemas */
Radek Krejcid33273d2018-10-25 14:55:52 +0200284 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 +0200285 void *imp_clb_data; /**< Optional private data for ::ly_ctx.imp_clb */
Radek Krejci6caa6ab2018-10-24 10:04:48 +0200286 uint16_t module_set_id; /**< ID of the current set of schemas */
287 uint16_t flags; /**< context settings, see @ref contextoptions. */
288 pthread_key_t errlist_key; /**< key for the thread-specific list of errors related to the context */
289};
290
Radek Krejcid33273d2018-10-25 14:55:52 +0200291/**
292 * @brief Try to find submodule in the context. Submodules are present only in the parsed (lysp_) schema trees, if only
293 * the compiled versions of the schemas are present, the submodule cannot be returned even if it was used to compile
294 * some of the currently present schemas.
295 *
Michal Vaskoc3781c32020-10-06 14:04:08 +0200296 * @param[in] ctx Context where to search in case @p module is NULL.
297 * @param[in] module Submodule parent (belongs-to) module in case @p ctx is NULL.
Radek Krejcid33273d2018-10-25 14:55:52 +0200298 * @param[in] submodule Name of the submodule to find.
299 * @param[in] revision Optional revision of the submodule to find. If not specified, the latest revision is returned.
300 * @return Pointer to the specified submodule if it is present in the context.
301 */
Michal Vaskoc3781c32020-10-06 14:04:08 +0200302struct lysp_submodule *ly_ctx_get_submodule(const struct ly_ctx *ctx, const struct lys_module *module,
303 const char *submodule, const char *revision);
Radek Krejcid33273d2018-10-25 14:55:52 +0200304
Radek Krejci0ad51f12020-07-16 12:08:12 +0200305/**
306 * @brief Get the (only) implemented YANG module specified by its name.
307 *
308 * @param[in] ctx Context where to search.
309 * @param[in] name Name of the YANG module to get.
310 * @param[in] name_len Optional length of the @p name. If zero, NULL-terminated name is expected.
311 * @return The only implemented YANG module revision of the given name in the given context. NULL if there is no
312 * implemented module of the given name.
313 */
314struct lys_module *ly_ctx_get_module_implemented2(const struct ly_ctx *ctx, const char *name, size_t name_len);
315
Radek Krejci6caa6ab2018-10-24 10:04:48 +0200316/******************************************************************************
Michal Vasko1324b6c2018-09-07 11:16:23 +0200317 * Generic useful functions.
Radek Krejcic59bc972018-09-17 16:13:06 +0200318 *****************************************************************************/
Michal Vasko1324b6c2018-09-07 11:16:23 +0200319
Michal Vaskob36053d2020-03-26 15:49:30 +0100320/**
321 * @brief Insert string into dictionary.
322 *
323 * @param[in] CTX libyang context.
324 * @param[in] STRING string to store.
325 * @param[in] LEN length of the string in WORD to store.
326 * @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.
327 */
Radek Krejci011e4aa2020-09-04 15:22:31 +0200328#define INSERT_STRING_RET(CTX, STRING, LEN, DYNAMIC, TARGET) \
329 if (DYNAMIC) { \
330 LY_CHECK_RET(lydict_insert_zc(CTX, (char *)(STRING), &(TARGET))); \
331 } else { \
332 LY_CHECK_RET(lydict_insert(CTX, LEN ? (STRING) : "", LEN, &(TARGET))); \
333 } \
334 DYNAMIC = 0
Michal Vaskob36053d2020-03-26 15:49:30 +0100335
Michal Vasko1324b6c2018-09-07 11:16:23 +0200336/**
337 * @brief Wrapper for realloc() call. The only difference is that if it fails to
338 * allocate the requested memory, the original memory is freed as well.
339 *
340 * @param[in] ptr Memory to reallocate.
341 * @param[in] size New size of the memory block.
342 *
343 * @return Pointer to the new memory, NULL on error.
344 */
345void *ly_realloc(void *ptr, size_t size);
346
Radek Krejcif345c012018-09-19 11:12:59 +0200347/**
Michal Vasko03ff5a72019-09-11 13:49:33 +0200348 * @brief Just like strchr() function except limit the number of examined characters.
349 *
350 * @param[in] s String to search in.
351 * @param[in] c Character to search for.
352 * @param[in] len Limit the search to this number of characters in @p s.
353 * @return Pointer to first @p c occurence in @p s, NULL if not found in first @p len characters.
354 */
Radek Krejci1deb5be2020-08-26 16:43:36 +0200355char *ly_strnchr(const char *s, int c, size_t len);
Michal Vasko03ff5a72019-09-11 13:49:33 +0200356
357/**
Radek Krejci7f9b6512019-09-18 13:11:09 +0200358 * @brief Compare NULL-terminated @p refstr with @str_len bytes from @p str.
359 *
360 * @param[in] refstr NULL-terminated string which must match @str_len bytes from @str followed by NULL-byte.
361 * @param[in] str String to compare
362 * @param[in] str_len Number of bytes to take into comparison from @p str.
363 * @return An integer less than, equal to, or greater than zero if @p refstr matches,
364 * respectively, to be less than, to match, or be greater than @p str.
365 */
366int ly_strncmp(const char *refstr, const char *str, size_t str_len);
367
368/**
Radek Krejci1798aae2020-07-14 13:26:06 +0200369 * @brief Wrapper around strlen() to handle NULL strings.
370 */
371#define ly_strlen(STR) (STR ? strlen(STR) : 0)
372
373/**
Radek Krejcif13b87b2020-12-01 22:02:17 +0100374 * @brief Compile-time strlen() for string contants.
375 *
376 * Use to avoid magic numbers usage
377 */
378#define ly_strlen_const(STR) (sizeof STR - 1)
379
380#define ly_sizeofarray(ARRAY) (sizeof ARRAY / sizeof *ARRAY)
381
382/*
383 * Numerical bases for use in functions like strtoll() instead of magic numbers
384 */
385#define LY_BASE_DEC 10 /**< Decimal numeral base */
386#define LY_BASE_OCT 8 /**< Octal numeral base */
387#define LY_BASE_HEX 16 /**< Hexadecimal numeral base */
388
389/**
390 * Maximal length of (needed storage for) a number encoded as a string.
391 *
392 * Applies not only for standard numbers, but also for YANG's decimal64.
393 */
394#define LY_NUMBER_MAXLEN 22
395
396/**
Radek Krejcib416be62018-10-01 14:51:45 +0200397 * @brief Get UTF8 code point of the next character in the input string.
398 *
399 * @param[in,out] input Input string to process, updated according to the processed/read data.
400 * @param[out] utf8_char UTF8 code point of the next character.
401 * @param[out] bytes_read Number of bytes used to encode the read utf8_char.
402 * @return LY_ERR value
403 */
Michal Vaskob36053d2020-03-26 15:49:30 +0100404LY_ERR ly_getutf8(const char **input, uint32_t *utf8_char, size_t *bytes_read);
Radek Krejcib416be62018-10-01 14:51:45 +0200405
406/**
Radek Krejci50f0c6b2020-06-18 16:31:48 +0200407 * Store UTF-8 character specified as 4byte integer into the dst buffer.
408 *
409 * UTF-8 mapping:
410 * 00000000 -- 0000007F: 0xxxxxxx
411 * 00000080 -- 000007FF: 110xxxxx 10xxxxxx
412 * 00000800 -- 0000FFFF: 1110xxxx 10xxxxxx 10xxxxxx
413 * 00010000 -- 001FFFFF: 11110xxx 10xxxxxx 10xxxxxx 10xxxxxx
414 *
415 * Includes checking for valid characters (following RFC 7950, sec 9.4)
416 *
417 * @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.
418 * @param[in] value 32b value of the UTF-8 character to store.
419 * @param[out] bytes_written Number of bytes written into @p dst (size of the written UTF-8 character).
420 * @return LY_SUCCESS on success
421 * @return LY_EINVAL in case of invalid UTF-8 @p value to store.
422 */
423LY_ERR ly_pututf8(char *dst, uint32_t value, size_t *bytes_written);
424
425/**
Radek Krejci76c98012019-08-14 11:23:24 +0200426 * @brief Get number of characters in the @p str, taking multibyte characters into account.
427 * @param[in] str String to examine.
428 * @param[in] bytes Number of valid bytes that are supposed to be taken into account in @p str.
429 * This parameter is useful mainly for non NULL-terminated strings. In case of NULL-terminated
430 * string, strlen() can be used.
431 * @return Number of characters in (possibly) multibyte characters string.
432 */
433size_t ly_utf8len(const char *str, size_t bytes);
434
435/**
Radek Krejci4f28eda2018-11-12 11:46:16 +0100436 * @brief Parse signed integer with possible limitation.
437 * @param[in] val_str String value containing signed integer, note that
438 * nothing else than whitespaces are expected after the value itself.
Radek Krejci249973a2019-06-10 10:50:54 +0200439 * @param[in] val_len Length of the @p val_str string.
Radek Krejci4f28eda2018-11-12 11:46:16 +0100440 * @param[in] min Limitation for the value which must not be lower than min.
441 * @param[in] max Limitation for the value which must not be higher than max.
442 * @param[in] base Numeric base for parsing:
443 * 0 - to accept decimal, octal, hexadecimal (e.g. in default value)
444 * 10 - to accept only decimal (e.g. data instance value)
445 * @param[out] ret Resulting value.
446 * @return LY_ERR value:
447 * LY_EDENIED - the value breaks the limits,
448 * LY_EVALID - string contains invalid value,
449 * LY_SUCCESS - successful parsing.
450 */
Radek Krejci249973a2019-06-10 10:50:54 +0200451LY_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 +0100452
453/**
454 * @brief Parse unsigned integer with possible limitation.
455 * @param[in] val_str String value containing unsigned integer, note that
456 * nothing else than whitespaces are expected after the value itself.
Radek Krejci249973a2019-06-10 10:50:54 +0200457 * @param[in] val_len Length of the @p val_str string.
Radek Krejci4f28eda2018-11-12 11:46:16 +0100458 * @param[in] max Limitation for the value which must not be higher than max.
459 * @param[in] base Numeric base for parsing:
460 * 0 - to accept decimal, octal, hexadecimal (e.g. in default value)
461 * 10 - to accept only decimal (e.g. data instance value)
462 * @param[out] ret Resulting value.
463 * @return LY_ERR value:
464 * LY_EDENIED - the value breaks the limits,
465 * LY_EVALID - string contains invalid value,
466 * LY_SUCCESS - successful parsing.
467 */
Radek Krejci249973a2019-06-10 10:50:54 +0200468LY_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 +0100469
470/**
Radek Krejcib4a4a272019-06-10 12:44:52 +0200471 * @brief Parse a node-identifier.
472 *
473 * node-identifier = [prefix ":"] identifier
474 *
475 * @param[in, out] id Identifier to parse. When returned, it points to the first character which is not part of the identifier.
476 * @param[out] prefix Node's prefix, NULL if there is not any.
477 * @param[out] prefix_len Length of the node's prefix, 0 if there is not any.
478 * @param[out] name Node's name.
479 * @param[out] nam_len Length of the node's name.
480 * @return LY_ERR value: LY_SUCCESS or LY_EINVAL in case of invalid character in the id.
481 */
482LY_ERR ly_parse_nodeid(const char **id, const char **prefix, size_t *prefix_len, const char **name, size_t *name_len);
483
484/**
485 * @brief parse instance-identifier's predicate, supports key-predicate, leaf-list-predicate and pos rules from YANG ABNF Grammar.
486 *
487 * @param[in, out] pred Predicate string (including the leading '[') to parse. The string is updated according to what was parsed
488 * (even for error case, so it can be used to determine which substring caused failure).
489 * @param[in] limit Limiting length of the @p pred. Function expects NULL terminated string which is not overread.
490 * 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 +0200491 * @param[in] format Input format of the data containing the @p pred.
Radek Krejcib4a4a272019-06-10 12:44:52 +0200492 * @param[out] prefix Start of the node-identifier's prefix if any, NULL in case of pos or leaf-list-predicate rules.
493 * @param[out] prefix_len Length of the parsed @p prefix.
494 * @param[out] id Start of the node-identifier's identifier string, NULL in case of pos rule, "." in case of leaf-list-predicate rule.
495 * @param[out] id_len Length of the parsed @p id.
Radek Krejci084289f2019-07-09 17:35:30 +0200496 * @param[out] value Start of the quoted-string (without quotation marks), not NULL in case of success.
Radek Krejcib4a4a272019-06-10 12:44:52 +0200497 * @param[out] value_len Length of the parsed @p value.
498 * @param[out] errmsg Error message string in case of error.
499 * @return LY_SUCCESS in case a complete predicate was parsed.
500 * @return LY_EVALID in case of invalid predicate form.
501 * @return LY_EINVAL in case of reaching @p limit when parsing @p pred.
502 */
Radek Krejci084289f2019-07-09 17:35:30 +0200503LY_ERR ly_parse_instance_predicate(const char **pred, size_t limit, LYD_FORMAT format,
Radek Krejci0f969882020-08-21 16:56:47 +0200504 const char **prefix, size_t *prefix_len, const char **id, size_t *id_len,
505 const char **value, size_t *value_len, const char **errmsg);
Michal Vasko1324b6c2018-09-07 11:16:23 +0200506
Radek Krejcif345c012018-09-19 11:12:59 +0200507/**
Radek Krejci86d106e2018-10-18 09:53:19 +0200508 * @brief mmap(2) wrapper to map input files into memory to unify parsing.
Radek Krejcif345c012018-09-19 11:12:59 +0200509 *
Radek Krejci86d106e2018-10-18 09:53:19 +0200510 * The address space is allocate only for reading.
511 *
512 * @param[in] ctx libyang context for logging
513 * @param[in] fd Open file descriptor of a file to map.
514 * @param[out] length Allocated size.
515 * @param[out] addr Address where the file is mapped.
Radek Krejcif345c012018-09-19 11:12:59 +0200516 * @return LY_ERR value.
517 */
Radek Krejci86d106e2018-10-18 09:53:19 +0200518LY_ERR ly_mmap(struct ly_ctx *ctx, int fd, size_t *length, void **addr);
Michal Vasko841d1a92018-09-07 15:40:31 +0200519
Radek Krejci86d106e2018-10-18 09:53:19 +0200520/**
Radek Krejci8678fa42020-08-18 16:07:28 +0200521 * @brief munmap(2) wrapper to free the memory mapped by ::ly_mmap()
Michal Vasko1324b6c2018-09-07 11:16:23 +0200522 *
Radek Krejci86d106e2018-10-18 09:53:19 +0200523 * @param[in] addr Address where the input file is mapped.
524 * @param[in] length Allocated size of the address space.
525 * @return LY_ERR value.
526 */
527LY_ERR ly_munmap(void *addr, size_t length);
528
529/**
Radek Krejci4546aa62019-07-15 16:53:32 +0200530 * @brief Concatenate formating string to the @p dest.
531 *
532 * @param[in, out] dest String to be concatenated by @p format.
533 * Note that the input string can be reallocated during concatenation.
534 * @param[in] format Formating string (as for printf) which is supposed to be added after @p dest.
535 * @return LY_SUCCESS or LY_EMEM.
536 */
537LY_ERR ly_strcat(char **dest, const char *format, ...);
538
539/**
Radek Krejci86d106e2018-10-18 09:53:19 +0200540 * @brief (Re-)Allocation of a ([sized array](@ref sizedarrays)).
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200541 *
Radek Krejci2c4e7172018-10-19 15:56:26 +0200542 * Increases the size information.
543 *
Radek Krejci86d106e2018-10-18 09:53:19 +0200544 * @param[in] CTX libyang context for logging.
Radek Krejci2c4e7172018-10-19 15:56:26 +0200545 * @param[in,out] ARRAY Pointer to the array to allocate/resize. The size of the allocated
546 * space is counted from the type of the ARRAY, so do not provide placeholder void pointers.
Radek Krejci86d106e2018-10-18 09:53:19 +0200547 * @param[out] NEW_ITEM Returning pointer to the newly allocated record in the ARRAY.
548 * @param[in] RETVAL Return value for the case of error (memory allocation failure).
Michal Vasko1324b6c2018-09-07 11:16:23 +0200549 */
Radek Krejci2c4e7172018-10-19 15:56:26 +0200550#define LY_ARRAY_NEW_RET(CTX, ARRAY, NEW_ITEM, RETVAL) \
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200551 if (!(ARRAY)) { \
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200552 ARRAY = malloc(sizeof(LY_ARRAY_COUNT_TYPE) + sizeof *(ARRAY)); \
553 *((LY_ARRAY_COUNT_TYPE*)(ARRAY)) = 1; \
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200554 } else { \
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200555 ++(*((LY_ARRAY_COUNT_TYPE*)(ARRAY) - 1)); \
556 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 +0200557 LY_CHECK_ERR_RET(!(ARRAY), LOGMEM(CTX), RETVAL); \
558 } \
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200559 ARRAY = (void*)((LY_ARRAY_COUNT_TYPE*)(ARRAY) + 1); \
560 (NEW_ITEM) = &(ARRAY)[*((LY_ARRAY_COUNT_TYPE*)(ARRAY) - 1) - 1]; \
Radek Krejci2c4e7172018-10-19 15:56:26 +0200561 memset(NEW_ITEM, 0, sizeof *(NEW_ITEM))
Michal Vasko1324b6c2018-09-07 11:16:23 +0200562
Radek Krejci2c4e7172018-10-19 15:56:26 +0200563/**
Radek Krejci4f28eda2018-11-12 11:46:16 +0100564 * @brief (Re-)Allocation of a ([sized array](@ref sizedarrays)).
565 *
566 * Increases the size information.
567 *
568 * @param[in] CTX libyang context for logging.
569 * @param[in,out] ARRAY Pointer to the array to allocate/resize. The size of the allocated
570 * space is counted from the type of the ARRAY, so do not provide placeholder void pointers.
571 * @param[out] NEW_ITEM Returning pointer to the newly allocated record in the ARRAY.
572 * @param[out] RET Variable to store error code.
573 * @param[in] GOTO Label to go in case of error (memory allocation failure).
574 */
575#define LY_ARRAY_NEW_GOTO(CTX, ARRAY, NEW_ITEM, RET, GOTO) \
576 if (!(ARRAY)) { \
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200577 ARRAY = malloc(sizeof(LY_ARRAY_COUNT_TYPE) + sizeof *(ARRAY)); \
578 *((LY_ARRAY_COUNT_TYPE*)(ARRAY)) = 1; \
Radek Krejci4f28eda2018-11-12 11:46:16 +0100579 } else { \
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200580 ++(*((LY_ARRAY_COUNT_TYPE*)(ARRAY) - 1)); \
581 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 +0100582 LY_CHECK_ERR_GOTO(!(ARRAY), LOGMEM(CTX); RET = LY_EMEM, GOTO); \
583 } \
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200584 ARRAY = (void*)((LY_ARRAY_COUNT_TYPE*)(ARRAY) + 1); \
585 (NEW_ITEM) = &(ARRAY)[*((LY_ARRAY_COUNT_TYPE*)(ARRAY) - 1) - 1]; \
Radek Krejci4f28eda2018-11-12 11:46:16 +0100586 memset(NEW_ITEM, 0, sizeof *(NEW_ITEM))
587
588/**
Radek Krejci2c4e7172018-10-19 15:56:26 +0200589 * @brief Allocate a ([sized array](@ref sizedarrays)) for the specified number of items.
Radek Krejcic4fa0292020-05-14 10:54:49 +0200590 * If the ARRAY already exists, it is resized (space for SIZE items is added and zeroed).
Radek Krejci2c4e7172018-10-19 15:56:26 +0200591 *
592 * Does not set the size information, it is supposed to be incremented via ::LY_ARRAY_INCREMENT
593 * when the items are filled.
594 *
595 * @param[in] CTX libyang context for logging.
596 * @param[in,out] ARRAY Pointer to the array to create.
Radek Krejcid552f1b2020-12-09 13:56:01 +0100597 * @param[in] SIZE Number of the new items the array is supposed to hold. The size of the allocated
Radek Krejci2c4e7172018-10-19 15:56:26 +0200598 * space is then counted from the type of the ARRAY, so do not provide placeholder void pointers.
599 * @param[in] RETVAL Return value for the case of error (memory allocation failure).
600 */
601#define LY_ARRAY_CREATE_RET(CTX, ARRAY, SIZE, RETVAL) \
Radek Krejcid05cbd92018-12-05 14:26:40 +0100602 if (ARRAY) { \
Radek Krejcid552f1b2020-12-09 13:56:01 +0100603 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 +0100604 LY_CHECK_ERR_RET(!(ARRAY), LOGMEM(CTX), RETVAL); \
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200605 ARRAY = (void*)((LY_ARRAY_COUNT_TYPE*)(ARRAY) + 1); \
Radek Krejcid552f1b2020-12-09 13:56:01 +0100606 memset(&(ARRAY)[*((LY_ARRAY_COUNT_TYPE*)(ARRAY) - 1)], 0, (SIZE) * sizeof *(ARRAY)); \
Radek Krejcid05cbd92018-12-05 14:26:40 +0100607 } else { \
Radek Krejcid552f1b2020-12-09 13:56:01 +0100608 ARRAY = calloc(1, sizeof(LY_ARRAY_COUNT_TYPE) + (SIZE) * sizeof *(ARRAY)); \
Radek Krejcid05cbd92018-12-05 14:26:40 +0100609 LY_CHECK_ERR_RET(!(ARRAY), LOGMEM(CTX), RETVAL); \
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200610 ARRAY = (void*)((LY_ARRAY_COUNT_TYPE*)(ARRAY) + 1); \
Radek Krejcid05cbd92018-12-05 14:26:40 +0100611 }
Radek Krejci2c4e7172018-10-19 15:56:26 +0200612
Radek Krejci6d6e4e42018-10-29 13:28:19 +0100613/**
614 * @brief Allocate a ([sized array](@ref sizedarrays)) for the specified number of items.
Radek Krejcid05cbd92018-12-05 14:26:40 +0100615 * If the ARRAY already exists, it is resized (space for SIZE items is added).
Radek Krejci6d6e4e42018-10-29 13:28:19 +0100616 *
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200617 * Does not set the count information, it is supposed to be incremented via ::LY_ARRAY_INCREMENT
Radek Krejci6d6e4e42018-10-29 13:28:19 +0100618 * when the items are filled.
619 *
620 * @param[in] CTX libyang context for logging.
621 * @param[in,out] ARRAY Pointer to the array to create.
Radek Krejci00b874b2019-02-12 10:54:50 +0100622 * @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 +0100623 * space is then counted from the type of the ARRAY, so do not provide placeholder void pointers.
624 * @param[out] RET Variable to store error code.
625 * @param[in] GOTO Label to go in case of error (memory allocation failure).
626 */
627#define LY_ARRAY_CREATE_GOTO(CTX, ARRAY, SIZE, RET, GOTO) \
Radek Krejcid05cbd92018-12-05 14:26:40 +0100628 if (ARRAY) { \
Radek Krejci6a205692020-12-09 13:58:22 +0100629 ARRAY = ly_realloc(((LY_ARRAY_COUNT_TYPE*)(ARRAY) - 1), sizeof(LY_ARRAY_COUNT_TYPE) + ((LY_ARRAY_COUNT(ARRAY) + (SIZE)) * sizeof *(ARRAY))); \
Radek Krejcid05cbd92018-12-05 14:26:40 +0100630 LY_CHECK_ERR_GOTO(!(ARRAY), LOGMEM(CTX); RET = LY_EMEM, GOTO); \
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200631 ARRAY = (void*)((LY_ARRAY_COUNT_TYPE*)(ARRAY) + 1); \
632 memset(&(ARRAY)[*((LY_ARRAY_COUNT_TYPE*)(ARRAY) - 1)], 0, (SIZE) * sizeof *(ARRAY)); \
Radek Krejcid05cbd92018-12-05 14:26:40 +0100633 } else { \
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200634 ARRAY = calloc(1, sizeof(LY_ARRAY_COUNT_TYPE) + (SIZE) * sizeof *(ARRAY)); \
Radek Krejcid05cbd92018-12-05 14:26:40 +0100635 LY_CHECK_ERR_GOTO(!(ARRAY), LOGMEM(CTX); RET = LY_EMEM, GOTO); \
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200636 ARRAY = (void*)((LY_ARRAY_COUNT_TYPE*)(ARRAY) + 1); \
Radek Krejcid05cbd92018-12-05 14:26:40 +0100637 }
Radek Krejci6d6e4e42018-10-29 13:28:19 +0100638
Radek Krejcic4fa0292020-05-14 10:54:49 +0200639/**
Radek Krejcic4fa0292020-05-14 10:54:49 +0200640 * @brief Increment the items counter in a ([sized array](@ref sizedarrays)).
641 *
642 * Does not change the allocated memory used by the ARRAY. To do so, use LY_ARRAY_CREATE_RET,
643 * LY_ARRAY_CREATE_GOTO or LY_ARRAY_RESIZE_ERR_RET.
644 *
645 * @param[in] ARRAY Pointer to the array to affect.
646 */
647#define LY_ARRAY_INCREMENT(ARRAY) \
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200648 ++(*((LY_ARRAY_COUNT_TYPE*)(ARRAY) - 1))
Radek Krejcic4fa0292020-05-14 10:54:49 +0200649
650/**
651 * @brief Decrement the items counter in a ([sized array](@ref sizedarrays)).
652 *
653 * Does not change the allocated memory used by the ARRAY. To do so, use LY_ARRAY_CREATE_RET,
654 * LY_ARRAY_CREATE_GOTO or LY_ARRAY_RESIZE_ERR_RET.
655 *
656 * @param[in] ARRAY Pointer to the array to affect.
657 */
Radek Krejciccd20f12019-02-15 14:12:27 +0100658#define LY_ARRAY_DECREMENT(ARRAY) \
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200659 --(*((LY_ARRAY_COUNT_TYPE*)(ARRAY) - 1))
Radek Krejciccd20f12019-02-15 14:12:27 +0100660
Radek Krejci2c4e7172018-10-19 15:56:26 +0200661/**
Michal Vasko7b1ad1a2020-11-02 15:41:27 +0100662 * @brief Decrement the items counter in a ([sized array](@ref sizedarrays)) and free the whole array
663 * in case it was decremented to 0.
664 *
665 * @param[in] ARRAY Pointer to the array to affect.
666 */
667#define LY_ARRAY_DECREMENT_FREE(ARRAY) \
668 --(*((LY_ARRAY_COUNT_TYPE*)(ARRAY) - 1)); \
669 if (!LY_ARRAY_COUNT(ARRAY)) { \
670 LY_ARRAY_FREE(ARRAY); \
671 (ARRAY) = NULL; \
672 }
673
674/**
Radek Krejci2c4e7172018-10-19 15:56:26 +0200675 * @brief Free the space allocated for the ([sized array](@ref sizedarrays)).
676 *
677 * The items inside the array are not freed.
678 *
679 * @param[in] ARRAY A ([sized array](@ref sizedarrays)) to be freed.
680 */
681#define LY_ARRAY_FREE(ARRAY) \
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200682 if (ARRAY){free((LY_ARRAY_COUNT_TYPE*)(ARRAY) - 1);}
David Sedlák8d552d62019-08-06 15:29:05 +0200683
David Sedlák26ea1432019-08-14 13:42:23 +0200684/**
David Sedlákaa98bba2019-09-12 11:52:14 +0200685 * @brief Insert item into linked list.
David Sedlák26ea1432019-08-14 13:42:23 +0200686 *
687 * @param[in,out] LIST Linked list to add to.
688 * @param[in] NEW_ITEM New item, that will be appended to the list, must be already allocated.
689 * @param[in] LINKER name of structuin member that is used to connect items together.
690 */
David Sedlák8d552d62019-08-06 15:29:05 +0200691#define LY_LIST_INSERT(LIST, NEW_ITEM, LINKER)\
692 if (!(*LIST)) { \
693 *LIST = (__typeof__(*(LIST)))NEW_ITEM; \
694 } else { \
695 do { \
696 __typeof__(*(LIST)) iterator; \
Radek Krejci1e008d22020-08-17 11:37:37 +0200697 for (iterator = *(LIST); iterator->LINKER; iterator = iterator->LINKER) {} \
David Sedlák8d552d62019-08-06 15:29:05 +0200698 iterator->LINKER = (__typeof__(*(LIST)))NEW_ITEM; \
699 } while (0); \
700 }
701
David Sedlák26ea1432019-08-14 13:42:23 +0200702/**
David Sedlákaa98bba2019-09-12 11:52:14 +0200703 * @brief Allocate and insert new item into linked list, return in case of error.
David Sedlák26ea1432019-08-14 13:42:23 +0200704 *
David Sedláke6284fc2019-09-10 11:57:02 +0200705 * @param[in] CTX used for logging.
706 * @param[in,out] LIST Linked list to add to.
707 * @param[out] NEW_ITEM New item that is appended to the list.
708 * @param[in] LINKER name of structure member that is used to connect items together.
David Sedlákfbe240f2019-09-13 11:18:53 +0200709 * @param[in] RETVAL Return value for the case of error (memory allocation failure).
David Sedlák26ea1432019-08-14 13:42:23 +0200710 */
David Sedlákb9eeb9c2019-09-13 11:17:19 +0200711#define LY_LIST_NEW_RET(CTX, LIST, NEW_ITEM, LINKER, RETVAL) \
David Sedlák8d552d62019-08-06 15:29:05 +0200712 NEW_ITEM = calloc(1, sizeof *NEW_ITEM); \
David Sedlákb9eeb9c2019-09-13 11:17:19 +0200713 LY_CHECK_ERR_RET(!(NEW_ITEM), LOGMEM(CTX), RETVAL); \
David Sedlák8d552d62019-08-06 15:29:05 +0200714 LY_LIST_INSERT(LIST, NEW_ITEM, LINKER)
715
David Sedláke6284fc2019-09-10 11:57:02 +0200716/**
David Sedlákaa98bba2019-09-12 11:52:14 +0200717 * @brief Allocate and insert new item into linked list, goto specified label in case of error.
David Sedláke6284fc2019-09-10 11:57:02 +0200718 *
719 * @param[in] CTX used for logging.
720 * @param[in,out] LIST Linked list to add to.
721 * @param[out] NEW_ITEM New item that is appended to the list.
722 * @param[in] LINKER name of structure member that is used to connect items together.
723 * @param[in] RET variable to store returned error type.
724 * @param[in] LABEL label to goto in case of error.
725 */
726#define LY_LIST_NEW_GOTO(CTX, LIST, NEW_ITEM, LINKER, RET, LABEL) \
727 NEW_ITEM = calloc(1, sizeof *NEW_ITEM); \
728 LY_CHECK_ERR_GOTO(!(NEW_ITEM), RET = LY_EMEM; LOGMEM(CTX), LABEL); \
729 LY_LIST_INSERT(LIST, NEW_ITEM, LINKER)
730
David Sedláke6cd89e2019-08-07 12:46:02 +0200731#endif /* LY_COMMON_H_ */