blob: 99f5ec693299086c1e8e45267f76a67c8e549dc7 [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 Krejcib7db73a2018-10-24 14:18:40 +020018#define _DEFAULT_SOURCE
19#define _GNU_SOURCE
Radek Krejcib7db73a2018-10-24 14:18:40 +020020
Radek Krejci6caa6ab2018-10-24 10:04:48 +020021#include <pthread.h>
Radek Krejcie7b95092019-05-15 11:03:07 +020022#include <stddef.h>
Radek Krejci5aeea3a2018-09-05 13:29:36 +020023#include <stdint.h>
Radek Krejci5aeea3a2018-09-05 13:29:36 +020024
Radek Krejci2c22f122018-09-05 15:08:03 +020025#include "config.h"
Radek Krejcie7b95092019-05-15 11:03:07 +020026
Radek Krejcid33273d2018-10-25 14:55:52 +020027#include "context.h"
Radek Krejcie7b95092019-05-15 11:03:07 +020028#include "dict.h"
Radek Krejci6caa6ab2018-10-24 10:04:48 +020029#include "hash_table.h"
Radek Krejcie7b95092019-05-15 11:03:07 +020030#include "log.h"
31#include "set.h"
32
33struct ly_ctx;
Radek Krejci5aeea3a2018-09-05 13:29:36 +020034
35#if __STDC_VERSION__ >= 201112 && !defined __STDC_NO_THREADS__
36# define THREAD_LOCAL _Thread_local
37#elif defined __GNUC__ || \
38 defined __SUNPRO_C || \
39 defined __xlC__
40# define THREAD_LOCAL __thread
41#else
42# error "Cannot define THREAD_LOCAL"
43#endif
44
Radek Krejcic59bc972018-09-17 16:13:06 +020045#define GETMACRO1(_1, NAME, ...) NAME
Radek Krejci5aeea3a2018-09-05 13:29:36 +020046#define GETMACRO2(_1, _2, NAME, ...) NAME
47#define GETMACRO3(_1, _2, _3, NAME, ...) NAME
48#define GETMACRO4(_1, _2, _3, _4, NAME, ...) NAME
Michal Vaskodc779a82019-11-06 15:44:06 +010049#define GETMACRO5(_1, _2, _3, _4, _5, NAME, ...) NAME
Radek Krejci5aeea3a2018-09-05 13:29:36 +020050
51/*
Radek Krejcic59bc972018-09-17 16:13:06 +020052 * If the compiler supports attribute to mark objects as hidden, mark all
53 * objects as hidden and export only objects explicitly marked to be part of
54 * the public API.
Radek Krejci5aeea3a2018-09-05 13:29:36 +020055 */
Radek Krejcic59bc972018-09-17 16:13:06 +020056#define API __attribute__((visibility("default")))
57
Radek Krejcicad716e2018-11-26 15:18:27 +010058
Radek Krejcic59bc972018-09-17 16:13:06 +020059/******************************************************************************
Radek Krejcie7b95092019-05-15 11:03:07 +020060 * Compatibility functions
61 *****************************************************************************/
62
Radek Krejcia9dc4ab2019-05-16 11:13:17 +020063#ifndef HAVE_GET_CURRENT_DIR_NAME
64/**
65 * @brief Return a malloc'd string containing the current directory name.
66 */
67char *get_current_dir_name(void);
68#endif
69
Radek Krejcie7b95092019-05-15 11:03:07 +020070#ifndef HAVE_STRNSTR
71/**
72 * @brief Find the first occurrence of find in s, where the search is limited to the
73 * first slen characters of s.
74 */
75char *strnstr(const char *s, const char *find, size_t slen);
76#endif
77
78
79/******************************************************************************
Radek Krejcic59bc972018-09-17 16:13:06 +020080 * Logger
81 *****************************************************************************/
Radek Krejci5aeea3a2018-09-05 13:29:36 +020082
Radek Krejci94aa9942018-09-07 17:12:17 +020083enum LY_VLOG_ELEM {
84 LY_VLOG_NONE = 0,
Michal Vaskof6e51882019-12-16 09:59:45 +010085 LY_VLOG_LINE, /* line number (uint64_t*) */
86 LY_VLOG_LYSC, /* struct lysc_node* */
87 LY_VLOG_LYD, /* struct lyd_node* */
88 LY_VLOG_STR, /* const char* */
89 LY_VLOG_PREV /* use exact same previous path */
Radek Krejci94aa9942018-09-07 17:12:17 +020090};
91
Radek Krejci5aeea3a2018-09-05 13:29:36 +020092extern THREAD_LOCAL enum int_log_opts log_opt;
93extern volatile uint8_t ly_log_level;
94extern volatile uint8_t ly_log_opts;
95
Radek Krejcie7b95092019-05-15 11:03:07 +020096/**
97 * @brief Set error-app-tag to the last error record in the context.
98 * @param[in] ctx libyang context where the error records are present.
99 * @param[in] apptag The error-app-tag value to store.
100 */
101void ly_err_last_set_apptag(const struct ly_ctx *ctx, const char *apptag);
102
103/**
104 * @brief Print a log message and store it into the context (if provided).
105 *
106 * @param[in] ctx libyang context to store the error record. If not provided, the error is just printed.
107 * @param[in] level Log message level (error, warning, etc.)
108 * @param[in] no Error type code.
109 * @param[in] format Format string to print.
110 */
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200111void ly_log(const struct ly_ctx *ctx, LY_LOG_LEVEL level, LY_ERR no, const char *format, ...);
Radek Krejcie7b95092019-05-15 11:03:07 +0200112
113/**
114 * @brief Print Validation error and store it into the context (if provided).
115 *
116 * @param[in] ctx libyang context to store the error record. If not provided, the error is just printed.
117 * @param[in] elem_type Type of the data in @p elem variable.
118 * @param[in] elem Object to provide more information about the place where the error appeared.
119 * @param[in] code Validation error code.
120 * @param[in] format Format string to print.
121 */
Radek Krejci94aa9942018-09-07 17:12:17 +0200122void 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 +0200123
124#define LOGERR(ctx, errno, str, args...) ly_log(ctx, LY_LLERR, errno, str, ##args)
Radek Krejcif3f47842018-11-15 11:22:15 +0100125#define LOGWRN(ctx, str, ...) ly_log(ctx, LY_LLWRN, 0, str, ##__VA_ARGS__)
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200126#define LOGVRB(str, args...) ly_log(NULL, LY_LLVRB, 0, str, ##args)
127
Radek Krejci4ab61562018-09-05 15:00:37 +0200128#ifdef NDEBUG
129# define LOGDBG(dbg_group, str, args...)
130#else
131 void ly_log_dbg(int group, const char *format, ...);
132# define LOGDBG(dbg_group, str, args...) ly_log_dbg(dbg_group, str, ##args);
133#endif
134
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200135#define LOGMEM(CTX) LOGERR(CTX, LY_EMEM, "Memory allocation failed (%s()).", __func__)
136#define LOGINT(CTX) LOGERR(CTX, LY_EINT, "Internal error (%s:%d).", __FILE__, __LINE__)
137#define LOGARG(CTX, ARG) LOGERR(CTX, LY_EINVAL, "Invalid argument %s (%s()).", #ARG, __func__)
Radek Krejcic07921a2018-09-17 11:40:15 +0200138#define LOGVAL(CTX, ELEM_TYPE, ELEM, CODE, FORMAT...) ly_vlog(CTX, ELEM_TYPE, ELEM, CODE, ##FORMAT)
Radek Krejci94aa9942018-09-07 17:12:17 +0200139
140#define LOGMEM_RET(CTX) LOGMEM(CTX); return LY_EMEM
141#define LOGINT_RET(CTX) LOGINT(CTX); return LY_EINT
142#define LOGARG_RET(CTX) LOGARG(CTX); return LY_EINVAL
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200143
144/*
145 * Common code to check return value and perform appropriate action.
146 */
Radek Krejcie88beef2019-05-30 15:47:19 +0200147#define LY_CHECK_GOTO(COND, GOTO) if ((COND)) {goto GOTO;}
148#define LY_CHECK_ERR_GOTO(COND, ERR, GOTO) if ((COND)) {ERR; goto GOTO;}
Radek Krejci6d9b9b52018-11-02 12:43:39 +0100149#define LY_CHECK_RET1(RETVAL) {LY_ERR ret__ = RETVAL;if (ret__ != LY_SUCCESS) {return ret__;}}
Radek Krejcie88beef2019-05-30 15:47:19 +0200150#define LY_CHECK_RET2(COND, RETVAL) if ((COND)) {return RETVAL;}
Radek Krejcic59bc972018-09-17 16:13:06 +0200151#define LY_CHECK_RET(...) GETMACRO2(__VA_ARGS__, LY_CHECK_RET2, LY_CHECK_RET1)(__VA_ARGS__)
Radek Krejcie88beef2019-05-30 15:47:19 +0200152#define LY_CHECK_ERR_RET(COND, ERR, RETVAL) if ((COND)) {ERR; return RETVAL;}
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200153
Radek Krejcia3045382018-11-22 14:30:31 +0100154#define LY_CHECK_ARG_GOTO1(CTX, ARG, GOTO) if (!(ARG)) {LOGARG(CTX, ARG);goto GOTO;}
Michal Vaskob3d0d6b2018-09-07 10:17:33 +0200155#define LY_CHECK_ARG_GOTO2(CTX, ARG1, ARG2, GOTO) LY_CHECK_ARG_GOTO1(CTX, ARG1, GOTO);LY_CHECK_ARG_GOTO1(CTX, ARG2, GOTO)
156#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 +0100157#define LY_CHECK_ARG_GOTO4(CTX, ARG1, ARG2, ARG3, ARG4, GOTO) LY_CHECK_ARG_GOTO3(CTX, ARG1, ARG2, ARG3, GOTO);\
158 LY_CHECK_ARG_GOTO1(CTX, ARG4, GOTO)
159#define LY_CHECK_ARG_GOTO(CTX, ...) GETMACRO5(__VA_ARGS__, LY_CHECK_ARG_GOTO4, LY_CHECK_ARG_GOTO3, LY_CHECK_ARG_GOTO2, \
160 LY_CHECK_ARG_GOTO1)(CTX, __VA_ARGS__)
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200161
Radek Krejcia3045382018-11-22 14:30:31 +0100162#define LY_CHECK_ARG_RET1(CTX, ARG, RETVAL) if (!(ARG)) {LOGARG(CTX, ARG);return RETVAL;}
Michal Vaskob3d0d6b2018-09-07 10:17:33 +0200163#define LY_CHECK_ARG_RET2(CTX, ARG1, ARG2, RETVAL) LY_CHECK_ARG_RET1(CTX, ARG1, RETVAL);LY_CHECK_ARG_RET1(CTX, ARG2, RETVAL)
164#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 +0100165#define LY_CHECK_ARG_RET4(CTX, ARG1, ARG2, ARG3, ARG4, RETVAL) LY_CHECK_ARG_RET3(CTX, ARG1, ARG2, ARG3, RETVAL);\
166 LY_CHECK_ARG_RET1(CTX, ARG4, RETVAL)
167#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)\
168 (CTX, __VA_ARGS__)
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200169
Radek Krejcid972c252018-09-25 13:23:39 +0200170/* count sequence size for LY_VCODE_INCHILDSTMT validation error code */
171size_t LY_VCODE_INSTREXP_len(const char *str);
172/* default maximum characters to print in LY_VCODE_INCHILDSTMT */
173#define LY_VCODE_INSTREXP_MAXLEN 20
174
Michal Vaskoecd62de2019-11-13 12:35:11 +0100175#define LY_VCODE_INCHAR LYVE_SYNTAX, "Invalid character 0x%x."
176#define LY_VCODE_INSTREXP LYVE_SYNTAX, "Invalid character sequence \"%.*s\", expected %s."
177#define LY_VCODE_EOF LYVE_SYNTAX, "Unexpected end-of-input."
178#define LY_VCODE_NTERM LYVE_SYNTAX, "%s not terminated."
179#define LY_VCODE_NSUPP LYVE_SYNTAX, "%s not supported."
180#define LY_VCODE_MOD_SUBOMD LYVE_SYNTAX, "Invalid keyword \"%s\", expected \"module\" or \"submodule\"."
181#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 +0200182#define LY_VCODE_TRAILING_SUBMOD LYVE_SYNTAX, "Trailing garbage \"%.*s%s\" after submodule, expected end-of-input."
183
Michal Vaskoecd62de2019-11-13 12:35:11 +0100184#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."
185#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 +0100186#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 +0200187
Michal Vaskoecd62de2019-11-13 12:35:11 +0100188#define LY_VCODE_INSTMT LYVE_SYNTAX_YANG, "Invalid keyword \"%s\"."
189#define LY_VCODE_INCHILDSTMT LYVE_SYNTAX_YANG, "Invalid keyword \"%s\" as a child of \"%s\"."
190#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 +0100191#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 +0100192#define LY_VCODE_DUPSTMT LYVE_SYNTAX_YANG, "Duplicate keyword \"%s\"."
193#define LY_VCODE_DUPIDENT LYVE_SYNTAX_YANG, "Duplicate identifier \"%s\" of %s statement."
194#define LY_VCODE_INVAL LYVE_SYNTAX_YANG, "Invalid value \"%.*s\" of \"%s\"."
195#define LY_VCODE_MISSTMT LYVE_SYNTAX_YANG, "Missing mandatory keyword \"%s\" as a child of \"%s\"."
196#define LY_VCODE_MISSCHILDSTMT LYVE_SYNTAX_YANG, "Missing %s substatement for %s%s."
197#define LY_VCODE_INORD LYVE_SYNTAX_YANG, "Invalid keyword \"%s\", it cannot appear after \"%s\"."
198#define LY_VCODE_OOB LYVE_SYNTAX_YANG, "Value \"%.*s\" is out of \"%s\" bounds."
199#define LY_VCODE_INDEV LYVE_SYNTAX_YANG, "Deviate \"%s\" does not support keyword \"%s\"."
200#define LY_VCODE_INREGEXP LYVE_SYNTAX_YANG, "Regular expression \"%s\" is not valid (\"%s\": %s)."
David Sedlák0c2bab92019-07-22 15:33:19 +0200201
Michal Vaskoecd62de2019-11-13 12:35:11 +0100202#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."
203#define LY_VCODE_INVAL_YIN LYVE_SYNTAX_YIN, "Invalid value \"%s\" of \"%s\" attribute in \"%s\" element."
204#define LY_VCODE_UNEXP_SUBELEM LYVE_SYNTAX_YIN, "Unexpected sub-element \"%.*s\" of \"%s\" element."
205#define LY_VCODE_INDEV_YIN LYVE_SYNTAX_YIN, "Deviate of this type doesn't allow \"%s\" as it's sub-element."
206#define LY_VCODE_INORDER_YIN LYVE_SYNTAX_YIN, "Invalid order of %s\'s sub-elements \"%s\" can't appear after \"%s\"."
207#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 +0200208#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 +0100209#define LY_VCODE_DUP_ATTR LYVE_SYNTAX_YIN, "Duplicit definition of \"%s\" attribute in \"%s\" element."
210#define LY_VCODE_UNEXP_ATTR LYVE_SYNTAX_YIN, "Unexpected attribute \"%.*s\" of \"%s\" element."
211#define LY_VCODE_MAND_SUBELEM LYVE_SYNTAX_YIN, "Missing mandatory sub-element \"%s\" of \"%s\" element."
212#define LY_VCODE_FIRT_SUBELEM LYVE_SYNTAX_YIN, "Sub-element \"%s\" of \"%s\" element must be defined as it's first sub-element."
213#define LY_VCODE_NAME_COL LYVE_SYNTAX_YIN, "Name collision between module and submodule of name \"%s\"."
214#define LY_VCODE_SUBELEM_REDEF LYVE_SYNTAX_YIN, "Redefinition of \"%s\" sub-element in \"%s\" element."
David Sedlák0c2bab92019-07-22 15:33:19 +0200215
Michal Vaskoecd62de2019-11-13 12:35:11 +0100216#define LY_VCODE_XP_EOE LYVE_XPATH, "Unterminated string delimited with %c (%.15s)."
217#define LY_VCODE_XP_INEXPR LYVE_XPATH, "Invalid character number %u of expression \'%s\'."
218#define LY_VCODE_XP_EOF LYVE_XPATH, "Unexpected XPath expression end."
219#define LY_VCODE_XP_INTOK LYVE_XPATH, "Unexpected XPath token %s (%.15s)."
220#define LY_VCODE_XP_INFUNC LYVE_XPATH, "Unknown XPath function \"%.*s\"."
221#define LY_VCODE_XP_INARGCOUNT LYVE_XPATH, "Invalid number of arguments (%d) for the XPath function %.*s."
222#define LY_VCODE_XP_INARGTYPE LYVE_XPATH, "Wrong type of argument #%d (%s) for the XPath function %s."
223#define LY_VCODE_XP_INCTX LYVE_XPATH, "Invalid context type %s in %s."
Michal Vaskoecd62de2019-11-13 12:35:11 +0100224#define LY_VCODE_XP_INOP_1 LYVE_XPATH, "Cannot apply XPath operation %s on %s."
225#define LY_VCODE_XP_INOP_2 LYVE_XPATH, "Cannot apply XPath operation %s on %s and %s."
226#define LY_VCODE_XP_INMOD LYVE_XPATH, "Unknown module \"%.*s\"."
David Sedlák0c2bab92019-07-22 15:33:19 +0200227
Michal Vaskoecd62de2019-11-13 12:35:11 +0100228#define LY_VCODE_DEV_NODETYPE LYVE_REFERENCE, "Invalid deviation of %s node - it is not possible to %s \"%s\" property."
Radek Krejci327de162019-06-14 12:52:07 +0200229#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 +0200230
Michal Vaskoecd62de2019-11-13 12:35:11 +0100231#define LY_VCODE_NOWHEN LYVE_DATA, "When condition \"%s\" not satisfied."
Michal Vaskoa3881362020-01-21 15:57:35 +0100232#define LY_VCODE_NOMAND LYVE_DATA, "Mandatory node \"%s\" instance does not exist."
Michal Vaskoacd83e72020-02-04 14:12:01 +0100233#define LY_VCODE_NOMIN LYVE_DATA, "Too few \"%s\" instances."
234#define LY_VCODE_NOMAX LYVE_DATA, "Too many \"%s\" instances."
Michal Vasko14654712020-02-06 08:35:21 +0100235#define LY_VCODE_NOUNIQ LYVE_DATA, "Unique data leaf(s) \"%s\" not satisfied in \"%s\" and \"%s\"."
Michal Vaskoecd62de2019-11-13 12:35:11 +0100236
Radek Krejcic59bc972018-09-17 16:13:06 +0200237/******************************************************************************
Radek Krejci6caa6ab2018-10-24 10:04:48 +0200238 * Context
239 *****************************************************************************/
240
241/**
242 * @brief Context of the YANG schemas
243 */
244struct ly_ctx {
245 struct dict_table dict; /**< dictionary to effectively store strings used in the context related structures */
246 struct ly_set search_paths; /**< set of directories where to search for schema's imports/includes */
247 struct ly_set list; /**< set of YANG schemas */
Radek Krejcid33273d2018-10-25 14:55:52 +0200248 ly_module_imp_clb imp_clb; /**< Optional callback for retrieving missing included or imported models in a custom way. */
249 void *imp_clb_data; /**< Optional private data for imp_clb() */
Radek Krejci6caa6ab2018-10-24 10:04:48 +0200250 uint16_t module_set_id; /**< ID of the current set of schemas */
251 uint16_t flags; /**< context settings, see @ref contextoptions. */
252 pthread_key_t errlist_key; /**< key for the thread-specific list of errors related to the context */
253};
254
Radek Krejcid33273d2018-10-25 14:55:52 +0200255/**
Radek Krejci474f9b82019-07-24 11:36:37 +0200256 * @defgroup contextflags Context flags
257 * @ingroup context
258 *
259 * Internal context flags.
260 *
261 * Note that the flags 0x00FF are reserved for @ref contextoptions.
262 * @{
263 */
264
265#define LY_CTX_CHANGED_TREE 0x8000 /**< Deviation changed tree of a module(s) in the context, it is necessary to recompile
266 leafref paths, default values and must/when expressions to check that they are still valid */
267
268/**@} contextflags */
269
270/**
Radek Krejcid33273d2018-10-25 14:55:52 +0200271 * @brief Try to find submodule in the context. Submodules are present only in the parsed (lysp_) schema trees, if only
272 * the compiled versions of the schemas are present, the submodule cannot be returned even if it was used to compile
273 * some of the currently present schemas.
274 *
275 * @param[in] ctx Context where to search
Radek Krejcifaa1eac2018-10-30 14:34:55 +0100276 * @param[in] module Name of the module where the submodule is supposed to belongs-to. If NULL, the module name is not checked.
Radek Krejcid33273d2018-10-25 14:55:52 +0200277 * @param[in] submodule Name of the submodule to find.
278 * @param[in] revision Optional revision of the submodule to find. If not specified, the latest revision is returned.
279 * @return Pointer to the specified submodule if it is present in the context.
280 */
Radek Krejci0bcdaed2019-01-10 10:21:34 +0100281struct lysp_submodule *ly_ctx_get_submodule(const struct ly_ctx *ctx, const char *module, const char *submodule, const char *revision);
Radek Krejcid33273d2018-10-25 14:55:52 +0200282
Radek Krejci6caa6ab2018-10-24 10:04:48 +0200283/******************************************************************************
Radek Krejcic59bc972018-09-17 16:13:06 +0200284 * Parsers
285 *****************************************************************************/
Radek Krejci5aeea3a2018-09-05 13:29:36 +0200286
Radek Krejcic59bc972018-09-17 16:13:06 +0200287/* list of the YANG statements strings */
288extern const char *const ly_stmt_list[];
289#define ly_stmt2str(STMT) ly_stmt_list[STMT]
290
291/* list of the extensions' substatements strings */
292extern const char *const lyext_substmt_list[];
293#define lyext_substmt2str(STMT) lyext_substmt_list[STMT]
294
295/* list of the deviate modifications strings */
296extern const char *const ly_devmod_list[];
297#define ly_devmod2str(TYPE) ly_devmod_list[TYPE]
298
299/******************************************************************************
Michal Vasko1324b6c2018-09-07 11:16:23 +0200300 * Generic useful functions.
Radek Krejcic59bc972018-09-17 16:13:06 +0200301 *****************************************************************************/
Michal Vasko1324b6c2018-09-07 11:16:23 +0200302
Radek Krejci76b3e962018-12-14 17:01:25 +0100303#define FREE_STRING(CTX, STRING) if (STRING) {lydict_remove(CTX, STRING);}
304
Michal Vasko1324b6c2018-09-07 11:16:23 +0200305/**
306 * @brief Wrapper for realloc() call. The only difference is that if it fails to
307 * allocate the requested memory, the original memory is freed as well.
308 *
309 * @param[in] ptr Memory to reallocate.
310 * @param[in] size New size of the memory block.
311 *
312 * @return Pointer to the new memory, NULL on error.
313 */
314void *ly_realloc(void *ptr, size_t size);
315
Radek Krejcif345c012018-09-19 11:12:59 +0200316/**
Michal Vasko03ff5a72019-09-11 13:49:33 +0200317 * @brief Just like strchr() function except limit the number of examined characters.
318 *
319 * @param[in] s String to search in.
320 * @param[in] c Character to search for.
321 * @param[in] len Limit the search to this number of characters in @p s.
322 * @return Pointer to first @p c occurence in @p s, NULL if not found in first @p len characters.
323 */
324char *ly_strnchr(const char *s, int c, unsigned int len);
325
326/**
Radek Krejci7f9b6512019-09-18 13:11:09 +0200327 * @brief Compare NULL-terminated @p refstr with @str_len bytes from @p str.
328 *
329 * @param[in] refstr NULL-terminated string which must match @str_len bytes from @str followed by NULL-byte.
330 * @param[in] str String to compare
331 * @param[in] str_len Number of bytes to take into comparison from @p str.
332 * @return An integer less than, equal to, or greater than zero if @p refstr matches,
333 * respectively, to be less than, to match, or be greater than @p str.
334 */
335int ly_strncmp(const char *refstr, const char *str, size_t str_len);
336
337/**
Radek Krejcib416be62018-10-01 14:51:45 +0200338 * @brief Get UTF8 code point of the next character in the input string.
339 *
340 * @param[in,out] input Input string to process, updated according to the processed/read data.
341 * @param[out] utf8_char UTF8 code point of the next character.
342 * @param[out] bytes_read Number of bytes used to encode the read utf8_char.
343 * @return LY_ERR value
344 */
345LY_ERR ly_getutf8(const char **input, unsigned int *utf8_char, size_t *bytes_read);
346
347/**
Radek Krejci76c98012019-08-14 11:23:24 +0200348 * @brief Get number of characters in the @p str, taking multibyte characters into account.
349 * @param[in] str String to examine.
350 * @param[in] bytes Number of valid bytes that are supposed to be taken into account in @p str.
351 * This parameter is useful mainly for non NULL-terminated strings. In case of NULL-terminated
352 * string, strlen() can be used.
353 * @return Number of characters in (possibly) multibyte characters string.
354 */
355size_t ly_utf8len(const char *str, size_t bytes);
356
357/**
Radek Krejci4f28eda2018-11-12 11:46:16 +0100358 * @brief Parse signed integer with possible limitation.
359 * @param[in] val_str String value containing signed integer, note that
360 * nothing else than whitespaces are expected after the value itself.
Radek Krejci249973a2019-06-10 10:50:54 +0200361 * @param[in] val_len Length of the @p val_str string.
Radek Krejci4f28eda2018-11-12 11:46:16 +0100362 * @param[in] min Limitation for the value which must not be lower than min.
363 * @param[in] max Limitation for the value which must not be higher than max.
364 * @param[in] base Numeric base for parsing:
365 * 0 - to accept decimal, octal, hexadecimal (e.g. in default value)
366 * 10 - to accept only decimal (e.g. data instance value)
367 * @param[out] ret Resulting value.
368 * @return LY_ERR value:
369 * LY_EDENIED - the value breaks the limits,
370 * LY_EVALID - string contains invalid value,
371 * LY_SUCCESS - successful parsing.
372 */
Radek Krejci249973a2019-06-10 10:50:54 +0200373LY_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 +0100374
375/**
376 * @brief Parse unsigned integer with possible limitation.
377 * @param[in] val_str String value containing unsigned integer, note that
378 * nothing else than whitespaces are expected after the value itself.
Radek Krejci249973a2019-06-10 10:50:54 +0200379 * @param[in] val_len Length of the @p val_str string.
Radek Krejci4f28eda2018-11-12 11:46:16 +0100380 * @param[in] max Limitation for the value which must not be higher than max.
381 * @param[in] base Numeric base for parsing:
382 * 0 - to accept decimal, octal, hexadecimal (e.g. in default value)
383 * 10 - to accept only decimal (e.g. data instance value)
384 * @param[out] ret Resulting value.
385 * @return LY_ERR value:
386 * LY_EDENIED - the value breaks the limits,
387 * LY_EVALID - string contains invalid value,
388 * LY_SUCCESS - successful parsing.
389 */
Radek Krejci249973a2019-06-10 10:50:54 +0200390LY_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 +0100391
392/**
Radek Krejcib4a4a272019-06-10 12:44:52 +0200393 * @brief Parse a node-identifier.
394 *
395 * node-identifier = [prefix ":"] identifier
396 *
397 * @param[in, out] id Identifier to parse. When returned, it points to the first character which is not part of the identifier.
398 * @param[out] prefix Node's prefix, NULL if there is not any.
399 * @param[out] prefix_len Length of the node's prefix, 0 if there is not any.
400 * @param[out] name Node's name.
401 * @param[out] nam_len Length of the node's name.
402 * @return LY_ERR value: LY_SUCCESS or LY_EINVAL in case of invalid character in the id.
403 */
404LY_ERR ly_parse_nodeid(const char **id, const char **prefix, size_t *prefix_len, const char **name, size_t *name_len);
405
406/**
407 * @brief parse instance-identifier's predicate, supports key-predicate, leaf-list-predicate and pos rules from YANG ABNF Grammar.
408 *
409 * @param[in, out] pred Predicate string (including the leading '[') to parse. The string is updated according to what was parsed
410 * (even for error case, so it can be used to determine which substring caused failure).
411 * @param[in] limit Limiting length of the @p pred. Function expects NULL terminated string which is not overread.
412 * 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 +0200413 * @param[in] format Input format of the data containing the @p pred.
Radek Krejcib4a4a272019-06-10 12:44:52 +0200414 * @param[out] prefix Start of the node-identifier's prefix if any, NULL in case of pos or leaf-list-predicate rules.
415 * @param[out] prefix_len Length of the parsed @p prefix.
416 * @param[out] id Start of the node-identifier's identifier string, NULL in case of pos rule, "." in case of leaf-list-predicate rule.
417 * @param[out] id_len Length of the parsed @p id.
Radek Krejci084289f2019-07-09 17:35:30 +0200418 * @param[out] value Start of the quoted-string (without quotation marks), not NULL in case of success.
Radek Krejcib4a4a272019-06-10 12:44:52 +0200419 * @param[out] value_len Length of the parsed @p value.
420 * @param[out] errmsg Error message string in case of error.
421 * @return LY_SUCCESS in case a complete predicate was parsed.
422 * @return LY_EVALID in case of invalid predicate form.
423 * @return LY_EINVAL in case of reaching @p limit when parsing @p pred.
424 */
Radek Krejci084289f2019-07-09 17:35:30 +0200425LY_ERR ly_parse_instance_predicate(const char **pred, size_t limit, LYD_FORMAT format,
Radek Krejcib4a4a272019-06-10 12:44:52 +0200426 const char **prefix, size_t *prefix_len, const char **id, size_t *id_len,
427 const char **value, size_t *value_len, const char **errmsg);
Michal Vasko1324b6c2018-09-07 11:16:23 +0200428
Radek Krejcif345c012018-09-19 11:12:59 +0200429/**
Radek Krejci13a57b62019-07-19 13:04:09 +0200430 * @brief ly_clb_get_prefix implementation for JSON. For its simplicity, this implementation is used
431 * internally for various purposes.
432 *
433 * Implemented in printer_json.c
434 */
435const char *json_print_get_prefix(const struct lys_module *mod, void *private);
436
437/**
Michal Vasko90932a92020-02-12 14:33:03 +0100438 * @brief ly_type_resolve_prefix implementation for JSON. For its simplicity, this implementation is used
439 * internally for various purposes.
440 *
441 * Implemented in parser_json.c
442 */
443const struct lys_module *lydjson_resolve_prefix(struct ly_ctx *ctx, const char *prefix, size_t prefix_len, void *parser);
444
445/**
Radek Krejci86d106e2018-10-18 09:53:19 +0200446 * @brief mmap(2) wrapper to map input files into memory to unify parsing.
Radek Krejcif345c012018-09-19 11:12:59 +0200447 *
Radek Krejci86d106e2018-10-18 09:53:19 +0200448 * The address space is allocate only for reading.
449 *
450 * @param[in] ctx libyang context for logging
451 * @param[in] fd Open file descriptor of a file to map.
452 * @param[out] length Allocated size.
453 * @param[out] addr Address where the file is mapped.
Radek Krejcif345c012018-09-19 11:12:59 +0200454 * @return LY_ERR value.
455 */
Radek Krejci86d106e2018-10-18 09:53:19 +0200456LY_ERR ly_mmap(struct ly_ctx *ctx, int fd, size_t *length, void **addr);
Michal Vasko841d1a92018-09-07 15:40:31 +0200457
Radek Krejci86d106e2018-10-18 09:53:19 +0200458/**
459 * @brief munmap(2) wrapper to free the memory mapped by ly_mmap()
Michal Vasko1324b6c2018-09-07 11:16:23 +0200460 *
Radek Krejci86d106e2018-10-18 09:53:19 +0200461 * @param[in] addr Address where the input file is mapped.
462 * @param[in] length Allocated size of the address space.
463 * @return LY_ERR value.
464 */
465LY_ERR ly_munmap(void *addr, size_t length);
466
467/**
Radek Krejci4546aa62019-07-15 16:53:32 +0200468 * @brief Concatenate formating string to the @p dest.
469 *
470 * @param[in, out] dest String to be concatenated by @p format.
471 * Note that the input string can be reallocated during concatenation.
472 * @param[in] format Formating string (as for printf) which is supposed to be added after @p dest.
473 * @return LY_SUCCESS or LY_EMEM.
474 */
475LY_ERR ly_strcat(char **dest, const char *format, ...);
476
477/**
Radek Krejci86d106e2018-10-18 09:53:19 +0200478 * @brief (Re-)Allocation of a ([sized array](@ref sizedarrays)).
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200479 *
Radek Krejci2c4e7172018-10-19 15:56:26 +0200480 * Increases the size information.
481 *
Radek Krejci86d106e2018-10-18 09:53:19 +0200482 * @param[in] CTX libyang context for logging.
Radek Krejci2c4e7172018-10-19 15:56:26 +0200483 * @param[in,out] ARRAY Pointer to the array to allocate/resize. The size of the allocated
484 * space is counted from the type of the ARRAY, so do not provide placeholder void pointers.
Radek Krejci86d106e2018-10-18 09:53:19 +0200485 * @param[out] NEW_ITEM Returning pointer to the newly allocated record in the ARRAY.
486 * @param[in] RETVAL Return value for the case of error (memory allocation failure).
Michal Vasko1324b6c2018-09-07 11:16:23 +0200487 */
Radek Krejci2c4e7172018-10-19 15:56:26 +0200488#define LY_ARRAY_NEW_RET(CTX, ARRAY, NEW_ITEM, RETVAL) \
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200489 if (!(ARRAY)) { \
490 ARRAY = malloc(sizeof(uint32_t) + sizeof *(ARRAY)); \
491 *((uint32_t*)(ARRAY)) = 1; \
492 } else { \
Radek Krejci2c4e7172018-10-19 15:56:26 +0200493 ++(*((uint32_t*)(ARRAY) - 1)); \
494 ARRAY = ly_realloc(((uint32_t*)(ARRAY) - 1), sizeof(uint32_t) + (*((uint32_t*)(ARRAY) - 1) * sizeof *(ARRAY))); \
Radek Krejcie53a8dc2018-10-17 12:52:40 +0200495 LY_CHECK_ERR_RET(!(ARRAY), LOGMEM(CTX), RETVAL); \
496 } \
Radek Krejci2c4e7172018-10-19 15:56:26 +0200497 ARRAY = (void*)((uint32_t*)(ARRAY) + 1); \
498 (NEW_ITEM) = &(ARRAY)[*((uint32_t*)(ARRAY) - 1) - 1]; \
499 memset(NEW_ITEM, 0, sizeof *(NEW_ITEM))
Michal Vasko1324b6c2018-09-07 11:16:23 +0200500
Radek Krejci2c4e7172018-10-19 15:56:26 +0200501/**
Radek Krejci4f28eda2018-11-12 11:46:16 +0100502 * @brief (Re-)Allocation of a ([sized array](@ref sizedarrays)).
503 *
504 * Increases the size information.
505 *
506 * @param[in] CTX libyang context for logging.
507 * @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.
509 * @param[out] NEW_ITEM Returning pointer to the newly allocated record in the ARRAY.
510 * @param[out] RET Variable to store error code.
511 * @param[in] GOTO Label to go in case of error (memory allocation failure).
512 */
513#define LY_ARRAY_NEW_GOTO(CTX, ARRAY, NEW_ITEM, RET, GOTO) \
514 if (!(ARRAY)) { \
515 ARRAY = malloc(sizeof(uint32_t) + sizeof *(ARRAY)); \
516 *((uint32_t*)(ARRAY)) = 1; \
517 } else { \
518 ++(*((uint32_t*)(ARRAY) - 1)); \
519 ARRAY = ly_realloc(((uint32_t*)(ARRAY) - 1), sizeof(uint32_t) + (*((uint32_t*)(ARRAY) - 1) * sizeof *(ARRAY))); \
520 LY_CHECK_ERR_GOTO(!(ARRAY), LOGMEM(CTX); RET = LY_EMEM, GOTO); \
521 } \
522 ARRAY = (void*)((uint32_t*)(ARRAY) + 1); \
523 (NEW_ITEM) = &(ARRAY)[*((uint32_t*)(ARRAY) - 1) - 1]; \
524 memset(NEW_ITEM, 0, sizeof *(NEW_ITEM))
525
526/**
Radek Krejci2c4e7172018-10-19 15:56:26 +0200527 * @brief Allocate a ([sized array](@ref sizedarrays)) for the specified number of items.
Radek Krejcid05cbd92018-12-05 14:26:40 +0100528 * If the ARRAY already exists, it is resized (space for SIZE items is added).
Radek Krejci2c4e7172018-10-19 15:56:26 +0200529 *
530 * Does not set the size information, it is supposed to be incremented via ::LY_ARRAY_INCREMENT
531 * when the items are filled.
532 *
533 * @param[in] CTX libyang context for logging.
534 * @param[in,out] ARRAY Pointer to the array to create.
535 * @param[in] SIZE Number of items the array is supposed to hold. The size of the allocated
536 * space is then counted from the type of the ARRAY, so do not provide placeholder void pointers.
537 * @param[in] RETVAL Return value for the case of error (memory allocation failure).
538 */
539#define LY_ARRAY_CREATE_RET(CTX, ARRAY, SIZE, RETVAL) \
Radek Krejcid05cbd92018-12-05 14:26:40 +0100540 if (ARRAY) { \
541 ARRAY = ly_realloc(((uint32_t*)(ARRAY) - 1), sizeof(uint32_t) + ((*((uint32_t*)(ARRAY) - 1) + SIZE) * sizeof *(ARRAY))); \
542 LY_CHECK_ERR_RET(!(ARRAY), LOGMEM(CTX), RETVAL); \
543 ARRAY = (void*)((uint32_t*)(ARRAY) + 1); \
544 memset(&(ARRAY)[*((uint32_t*)(ARRAY) - 1)], 0, SIZE * sizeof *(ARRAY)); \
545 } else { \
546 ARRAY = calloc(1, sizeof(uint32_t) + SIZE * sizeof *(ARRAY)); \
547 LY_CHECK_ERR_RET(!(ARRAY), LOGMEM(CTX), RETVAL); \
548 ARRAY = (void*)((uint32_t*)(ARRAY) + 1); \
549 }
Radek Krejci2c4e7172018-10-19 15:56:26 +0200550
Radek Krejci6d6e4e42018-10-29 13:28:19 +0100551/**
552 * @brief Allocate a ([sized array](@ref sizedarrays)) for the specified number of items.
Radek Krejcid05cbd92018-12-05 14:26:40 +0100553 * If the ARRAY already exists, it is resized (space for SIZE items is added).
Radek Krejci6d6e4e42018-10-29 13:28:19 +0100554 *
555 * Does not set the size information, it is supposed to be incremented via ::LY_ARRAY_INCREMENT
556 * when the items are filled.
557 *
558 * @param[in] CTX libyang context for logging.
559 * @param[in,out] ARRAY Pointer to the array to create.
Radek Krejci00b874b2019-02-12 10:54:50 +0100560 * @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 +0100561 * space is then counted from the type of the ARRAY, so do not provide placeholder void pointers.
562 * @param[out] RET Variable to store error code.
563 * @param[in] GOTO Label to go in case of error (memory allocation failure).
564 */
565#define LY_ARRAY_CREATE_GOTO(CTX, ARRAY, SIZE, RET, GOTO) \
Radek Krejcid05cbd92018-12-05 14:26:40 +0100566 if (ARRAY) { \
Radek Krejci58dca372019-04-12 10:38:06 +0200567 ARRAY = ly_realloc(((uint32_t*)(ARRAY) - 1), sizeof(uint32_t) + ((*((uint32_t*)(ARRAY) - 1) + (SIZE)) * sizeof *(ARRAY))); \
Radek Krejcid05cbd92018-12-05 14:26:40 +0100568 LY_CHECK_ERR_GOTO(!(ARRAY), LOGMEM(CTX); RET = LY_EMEM, GOTO); \
569 ARRAY = (void*)((uint32_t*)(ARRAY) + 1); \
Radek Krejci58dca372019-04-12 10:38:06 +0200570 memset(&(ARRAY)[*((uint32_t*)(ARRAY) - 1)], 0, (SIZE) * sizeof *(ARRAY)); \
Radek Krejcid05cbd92018-12-05 14:26:40 +0100571 } else { \
Radek Krejci58dca372019-04-12 10:38:06 +0200572 ARRAY = calloc(1, sizeof(uint32_t) + (SIZE) * sizeof *(ARRAY)); \
Radek Krejcid05cbd92018-12-05 14:26:40 +0100573 LY_CHECK_ERR_GOTO(!(ARRAY), LOGMEM(CTX); RET = LY_EMEM, GOTO); \
574 ARRAY = (void*)((uint32_t*)(ARRAY) + 1); \
575 }
Radek Krejci6d6e4e42018-10-29 13:28:19 +0100576
Radek Krejci2c4e7172018-10-19 15:56:26 +0200577#define LY_ARRAY_INCREMENT(ARRAY) \
578 ++(*((uint32_t*)(ARRAY) - 1))
Radek Krejciccd20f12019-02-15 14:12:27 +0100579
580#define LY_ARRAY_DECREMENT(ARRAY) \
581 --(*((uint32_t*)(ARRAY) - 1))
582
Radek Krejci2c4e7172018-10-19 15:56:26 +0200583/**
584 * @brief Free the space allocated for the ([sized array](@ref sizedarrays)).
585 *
586 * The items inside the array are not freed.
587 *
588 * @param[in] ARRAY A ([sized array](@ref sizedarrays)) to be freed.
589 */
590#define LY_ARRAY_FREE(ARRAY) \
591 if (ARRAY){free((uint32_t*)(ARRAY) - 1);}
David Sedlák8d552d62019-08-06 15:29:05 +0200592
David Sedlák26ea1432019-08-14 13:42:23 +0200593/**
David Sedlákaa98bba2019-09-12 11:52:14 +0200594 * @brief Insert item into linked list.
David Sedlák26ea1432019-08-14 13:42:23 +0200595 *
596 * @param[in,out] LIST Linked list to add to.
597 * @param[in] NEW_ITEM New item, that will be appended to the list, must be already allocated.
598 * @param[in] LINKER name of structuin member that is used to connect items together.
599 */
David Sedlák8d552d62019-08-06 15:29:05 +0200600#define LY_LIST_INSERT(LIST, NEW_ITEM, LINKER)\
601 if (!(*LIST)) { \
602 *LIST = (__typeof__(*(LIST)))NEW_ITEM; \
603 } else { \
604 do { \
605 __typeof__(*(LIST)) iterator; \
606 for (iterator = *(LIST); iterator->LINKER; iterator = iterator->LINKER); \
607 iterator->LINKER = (__typeof__(*(LIST)))NEW_ITEM; \
608 } while (0); \
609 }
610
David Sedlák26ea1432019-08-14 13:42:23 +0200611/**
David Sedlákaa98bba2019-09-12 11:52:14 +0200612 * @brief Allocate and insert new item into linked list, return in case of error.
David Sedlák26ea1432019-08-14 13:42:23 +0200613 *
David Sedláke6284fc2019-09-10 11:57:02 +0200614 * @param[in] CTX used for logging.
615 * @param[in,out] LIST Linked list to add to.
616 * @param[out] NEW_ITEM New item that is appended to the list.
617 * @param[in] LINKER name of structure member that is used to connect items together.
David Sedlákfbe240f2019-09-13 11:18:53 +0200618 * @param[in] RETVAL Return value for the case of error (memory allocation failure).
David Sedlák26ea1432019-08-14 13:42:23 +0200619 */
David Sedlákb9eeb9c2019-09-13 11:17:19 +0200620#define LY_LIST_NEW_RET(CTX, LIST, NEW_ITEM, LINKER, RETVAL) \
David Sedlák8d552d62019-08-06 15:29:05 +0200621 NEW_ITEM = calloc(1, sizeof *NEW_ITEM); \
David Sedlákb9eeb9c2019-09-13 11:17:19 +0200622 LY_CHECK_ERR_RET(!(NEW_ITEM), LOGMEM(CTX), RETVAL); \
David Sedlák8d552d62019-08-06 15:29:05 +0200623 LY_LIST_INSERT(LIST, NEW_ITEM, LINKER)
624
David Sedláke6284fc2019-09-10 11:57:02 +0200625/**
David Sedlákaa98bba2019-09-12 11:52:14 +0200626 * @brief Allocate and insert new item into linked list, goto specified label in case of error.
David Sedláke6284fc2019-09-10 11:57:02 +0200627 *
628 * @param[in] CTX used for logging.
629 * @param[in,out] LIST Linked list to add to.
630 * @param[out] NEW_ITEM New item that is appended to the list.
631 * @param[in] LINKER name of structure member that is used to connect items together.
632 * @param[in] RET variable to store returned error type.
633 * @param[in] LABEL label to goto in case of error.
634 */
635#define LY_LIST_NEW_GOTO(CTX, LIST, NEW_ITEM, LINKER, RET, LABEL) \
636 NEW_ITEM = calloc(1, sizeof *NEW_ITEM); \
637 LY_CHECK_ERR_GOTO(!(NEW_ITEM), RET = LY_EMEM; LOGMEM(CTX), LABEL); \
638 LY_LIST_INSERT(LIST, NEW_ITEM, LINKER)
639
David Sedláke6cd89e2019-08-07 12:46:02 +0200640#endif /* LY_COMMON_H_ */