blob: 13c3004538ffc0ed2cf8d7de4942cb4242011387 [file] [log] [blame]
Radek Krejcie7b95092019-05-15 11:03:07 +02001/**
2 * @file tree_data_internal.h
3 * @author Radek Krejci <rkrejci@cesnet.cz>
4 * @brief internal functions for YANG schema trees.
5 *
Michal Vasko60ea6352020-06-29 13:39:39 +02006 * Copyright (c) 2015 - 2020 CESNET, z.s.p.o.
Radek Krejcie7b95092019-05-15 11:03:07 +02007 *
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_TREE_DATA_INTERNAL_H_
16#define LY_TREE_DATA_INTERNAL_H_
17
Radek Krejci857189e2020-09-01 13:26:36 +020018#include "log.h"
Radek Krejciaca74032019-06-04 08:53:06 +020019#include "plugins_types.h"
Michal Vasko60ea6352020-06-29 13:39:39 +020020#include "tree_data.h"
Radek Krejcie7b95092019-05-15 11:03:07 +020021
Michal Vasko52927e22020-03-16 17:26:14 +010022#include <stddef.h>
23
Michal Vasko004d3152020-06-11 19:59:22 +020024struct ly_path_predicate;
Michal Vaskoa6669ba2020-08-06 16:14:26 +020025struct lysc_module;
Michal Vasko004d3152020-06-11 19:59:22 +020026
Radek Krejcif13b87b2020-12-01 22:02:17 +010027#define LY_XML_SUFFIX ".xml"
28#define LY_XML_SUFFIX_LEN 4
29#define LY_JSON_SUFFIX ".json"
30#define LY_JSON_SUFFIX_LEN 5
31#define LY_LYB_SUFFIX ".lyb"
32#define LY_LYB_SUFFIX_LEN 4
33
Radek Krejcie7b95092019-05-15 11:03:07 +020034/**
Michal Vaskod7c048c2021-05-18 16:12:55 +020035 * @brief Internal structure for remembering "used" instances of lists with duplicate instances allowed.
36 */
37struct lyd_dup_inst {
38 struct ly_set *inst_set;
39 uint32_t used;
40};
41
42/**
43 * @brief Update a found inst using a duplicate instance cache. Needs to be called for every "used"
44 * (that should not be considered next time) instance.
45 *
46 * @param[in,out] inst Found instance, is updated so that the same instance is not returned twice.
47 * @param[in] siblings Siblings where @p inst was found.
48 * @param[in,out] dup_inst_cache Duplicate instance cache.
49 * @return LY_ERR value.
50 */
51LY_ERR lyd_dup_inst_next(struct lyd_node **inst, const struct lyd_node *siblings,
52 struct lyd_dup_inst **dup_inst_cache);
53
54/**
55 * @brief Free duplicate instance cache.
56 *
57 * @param[in] dup_inst Duplicate instance cache to free.
58 */
59void lyd_dup_inst_free(struct lyd_dup_inst *dup_inst);
60
61/**
Radek Krejci8678fa42020-08-18 16:07:28 +020062 * @brief Just like ::lys_getnext() but iterates over all data instances of the schema nodes.
Michal Vaskoa6669ba2020-08-06 16:14:26 +020063 *
64 * @param[in] last Last returned data node.
65 * @param[in] sibling Data node sibling to search in.
66 * @param[in,out] slast Schema last node, set to NULL for first call and do not change afterwards.
67 * May not be set if the function is used only for any suitable node existence check (such as the existence
68 * of any choice case data).
69 * @param[in] parent Schema parent of the iterated children nodes.
70 * @param[in] module Schema module of the iterated top-level nodes.
71 * @return Next matching data node,
72 * @return NULL if last data node was already returned.
73 */
74struct lyd_node *lys_getnext_data(const struct lyd_node *last, const struct lyd_node *sibling,
Michal Vasko106f0862021-11-02 11:49:27 +010075 const struct lysc_node **slast, const struct lysc_node *parent, const struct lysc_module *module);
76
77/**
78 * @brief Get address of a node's child pointer if any.
79 *
80 * @param[in] node Node to check.
81 * @return Address of the node's child member,
82 * @return NULL if there is no child pointer.
83 */
84struct lyd_node **lyd_node_child_p(struct lyd_node *node);
85
86/**
87 * @brief Update node pointer to point to the first data node of a module, leave unchanged if there is none.
88 *
89 * @param[in,out] node Node pointer, may be updated.
90 * @param[in] mod Module whose data to search for.
91 */
92void lyd_first_module_sibling(struct lyd_node **node, const struct lys_module *mod);
93
94/**
95 * @brief Iterate over implemented modules for functions that accept specific modules or the whole context.
96 *
97 * @param[in] tree Data tree.
98 * @param[in] module Selected module, NULL for all.
99 * @param[in] ctx Context, NULL for selected modules.
100 * @param[in,out] i Iterator, set to 0 on first call.
101 * @param[out] first First sibling of the returned module.
102 * @return Next module.
103 * @return NULL if all modules were traversed.
104 */
105const struct lys_module *lyd_mod_next_module(struct lyd_node *tree, const struct lys_module *module,
106 const struct ly_ctx *ctx, uint32_t *i, struct lyd_node **first);
107
108/**
109 * @brief Iterate over modules for functions that want to traverse all the top-level data.
110 *
111 * @param[in,out] next Pointer to the next module data, set to first top-level sibling on first call.
112 * @param[out] first First sibling of the returned module.
113 * @return Next module.
114 * @return NULL if all modules were traversed.
115 */
116const struct lys_module *lyd_data_next_module(struct lyd_node **next, struct lyd_node **first);
117
118/**
119 * @brief Check that a list has all its keys.
120 *
121 * @param[in] node List to check.
122 * @return LY_SUCCESS on success.
123 * @return LY_ENOT on a missing key.
124 */
125LY_ERR lyd_parse_check_keys(struct lyd_node *node);
126
127/**
128 * @brief Set data flags for a newly parsed node.
129 *
130 * @param[in] node Node to use.
131 * @param[in,out] node_when Set of nodes with unresolved when.
132 * @param[in,out] node_exts Set of nodes and their extension instances if they have own validation callback.
133 * @param[in,out] meta Node metadata, may be removed from.
134 * @param[in] parse_opts Parse options.
135 */
136void lyd_parse_set_data_flags(struct lyd_node *node, struct ly_set *node_when, struct ly_set *node_exts,
137 struct lyd_meta **meta, uint32_t parse_opts);
138
139/**
140 * @brief Get schema node of a data node. Useful especially for opaque nodes.
141 *
142 * @param[in] node Data node to use.
143 * @return Schema node represented by data @p node, NULL if there is none.
144 */
145const struct lysc_node *lyd_node_schema(const struct lyd_node *node);
146
147/**
148 * @brief Check whether a node to be deleted is the root node, move it if it is.
149 *
150 * @param[in] root Root sibling.
151 * @param[in] to_del Node to be deleted.
152 * @param[in] mod If set, it is expected @p tree should point to the first node of @p mod. Otherwise it will simply be
153 * the first top-level sibling.
154 */
155void lyd_del_move_root(struct lyd_node **root, const struct lyd_node *to_del, const struct lys_module *mod);
156
157/**
158 * @brief Free stored prefix data.
159 *
160 * @param[in] format Format of the prefixes.
161 * @param[in] prefix_data Format-specific data to free:
162 * LY_PREF_SCHEMA - const struct lysp_module * (module used for resolving prefixes from imports)
163 * LY_PREF_SCHEMA_RESOLVED - struct lyd_value_prefix * (sized array of pairs: prefix - module)
164 * LY_PREF_XML - const struct ly_set * (set with defined namespaces stored as ::lyxml_ns)
165 * LY_PREF_JSON - NULL
166 */
167void ly_free_prefix_data(LY_VALUE_FORMAT format, void *prefix_data);
168
169/**
170 * @brief Duplicate prefix data.
171 *
172 * @param[in] ctx libyang context.
173 * @param[in] format Format of the prefixes in the value.
174 * @param[in] prefix_data Prefix data to duplicate.
175 * @param[out] prefix_data_p Duplicated prefix data.
176 * @return LY_ERR value.
177 */
178LY_ERR ly_dup_prefix_data(const struct ly_ctx *ctx, LY_VALUE_FORMAT format, const void *prefix_data, void **prefix_data_p);
179
180/**
181 * @brief Store used prefixes in a string.
182 *
183 * If @p prefix_data_p are non-NULL, they are treated as valid according to the @p format_p and new possible
184 * prefixes are simply added. This way it is possible to store prefix data for several strings together.
185 *
186 * @param[in] ctx libyang context.
187 * @param[in] value Value to be parsed.
188 * @param[in] value_len Length of the @p value.
189 * @param[in] format Format of the prefixes in the value.
190 * @param[in] prefix_data Format-specific data for resolving any prefixes (see ::ly_resolve_prefix).
191 * @param[in,out] format_p Resulting format of the prefixes.
192 * @param[in,out] prefix_data_p Resulting prefix data for the value in format @p format_p.
193 * @return LY_ERR value.
194 */
195LY_ERR ly_store_prefix_data(const struct ly_ctx *ctx, const void *value, size_t value_len, LY_VALUE_FORMAT format,
196 const void *prefix_data, LY_VALUE_FORMAT *format_p, void **prefix_data_p);
197
198/**
199 * @brief Get string name of the format.
200 *
201 * @param[in] format Format whose name to get.
202 * @return Format string name.
203 */
204const char *ly_format2str(LY_VALUE_FORMAT format);
Michal Vaskoa6669ba2020-08-06 16:14:26 +0200205
206/**
Michal Vasko9b368d32020-02-14 13:53:31 +0100207 * @brief Create a term (leaf/leaf-list) node from a string value.
208 *
209 * Hash is calculated and new node flag is set.
Michal Vasko90932a92020-02-12 14:33:03 +0100210 *
211 * @param[in] schema Schema node of the new data node.
212 * @param[in] value String value to be parsed.
Michal Vaskof03ed032020-03-04 13:31:44 +0100213 * @param[in] value_len Length of @p value, must be set correctly.
Michal Vasko90932a92020-02-12 14:33:03 +0100214 * @param[in,out] dynamic Flag if @p value is dynamically allocated, is adjusted when @p value is consumed.
Michal Vasko90932a92020-02-12 14:33:03 +0100215 * @param[in] format Input format of @p value.
Michal Vaskoc8a230d2020-08-14 12:17:10 +0200216 * @param[in] prefix_data Format-specific data for resolving any prefixes (see ::ly_resolve_prefix).
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200217 * @param[in] hints [Value hints](@ref lydvalhints) from the parser regarding the value type.
218 * @param[out] incomplete Whether the value needs to be resolved.
Michal Vasko90932a92020-02-12 14:33:03 +0100219 * @param[out] node Created node.
220 * @return LY_SUCCESS on success.
221 * @return LY_EINCOMPLETE in case data tree is needed to finish the validation.
222 * @return LY_ERR value if an error occurred.
223 */
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200224LY_ERR lyd_create_term(const struct lysc_node *schema, const char *value, size_t value_len, ly_bool *dynamic,
Radek Krejci8df109d2021-04-23 12:19:08 +0200225 LY_VALUE_FORMAT format, void *prefix_data, uint32_t hints, ly_bool *incomplete, struct lyd_node **node);
Michal Vasko90932a92020-02-12 14:33:03 +0100226
227/**
Michal Vasko9b368d32020-02-14 13:53:31 +0100228 * @brief Create a term (leaf/leaf-list) node from a parsed value by duplicating it.
229 *
230 * Hash is calculated and new node flag is set.
231 *
232 * @param[in] schema Schema node of the new data node.
233 * @param[in] val Parsed value to use.
234 * @param[out] node Created node.
235 * @return LY_SUCCESS on success.
236 * @return LY_ERR value if an error occurred.
237 */
238LY_ERR lyd_create_term2(const struct lysc_node *schema, const struct lyd_value *val, struct lyd_node **node);
239
240/**
241 * @brief Create an inner (container/list/RPC/action/notification) node.
242 *
243 * Hash is calculated and new node flag is set except
244 * for list with keys, when the hash is not calculated!
245 * Also, non-presence container has its default flag set.
Michal Vasko90932a92020-02-12 14:33:03 +0100246 *
247 * @param[in] schema Schema node of the new data node.
248 * @param[out] node Created node.
249 * @return LY_SUCCESS on success.
250 * @return LY_ERR value if an error occurred.
251 */
252LY_ERR lyd_create_inner(const struct lysc_node *schema, struct lyd_node **node);
253
254/**
Michal Vasko9b368d32020-02-14 13:53:31 +0100255 * @brief Create a list with all its keys (cannot be used for key-less list).
256 *
257 * Hash is calculated and new node flag is set.
Michal Vasko90932a92020-02-12 14:33:03 +0100258 *
259 * @param[in] schema Schema node of the new data node.
Michal Vasko004d3152020-06-11 19:59:22 +0200260 * @param[in] predicates Compiled key list predicates.
Michal Vasko90932a92020-02-12 14:33:03 +0100261 * @param[out] node Created node.
262 * @return LY_SUCCESS on success.
263 * @return LY_ERR value if an error occurred.
264 */
Michal Vasko004d3152020-06-11 19:59:22 +0200265LY_ERR lyd_create_list(const struct lysc_node *schema, const struct ly_path_predicate *predicates, struct lyd_node **node);
Michal Vasko90932a92020-02-12 14:33:03 +0100266
267/**
Michal Vasko9b368d32020-02-14 13:53:31 +0100268 * @brief Create an anyxml/anydata node.
269 *
270 * Hash is calculated and flags are properly set based on @p is_valid.
Michal Vasko90932a92020-02-12 14:33:03 +0100271 *
272 * @param[in] schema Schema node of the new data node.
Michal Vasko366a4a12020-12-04 16:23:57 +0100273 * @param[in] value Value of the any node.
Michal Vasko90932a92020-02-12 14:33:03 +0100274 * @param[in] value_type Value type of the value.
Michal Vasko366a4a12020-12-04 16:23:57 +0100275 * @param[in] use_value Whether to directly assign (eat) the value or duplicate it.
Michal Vasko90932a92020-02-12 14:33:03 +0100276 * @param[out] node Created node.
277 * @return LY_SUCCESS on success.
278 * @return LY_ERR value if an error occurred.
279 */
Michal Vasko9b368d32020-02-14 13:53:31 +0100280LY_ERR lyd_create_any(const struct lysc_node *schema, const void *value, LYD_ANYDATA_VALUETYPE value_type,
Michal Vasko366a4a12020-12-04 16:23:57 +0100281 ly_bool use_value, struct lyd_node **node);
Michal Vasko90932a92020-02-12 14:33:03 +0100282
283/**
Michal Vasko52927e22020-03-16 17:26:14 +0100284 * @brief Create an opaque node.
285 *
286 * @param[in] ctx libyang context.
287 * @param[in] name Element name.
288 * @param[in] name_len Length of @p name, must be set correctly.
Michal Vasko52927e22020-03-16 17:26:14 +0100289 * @param[in] prefix Element prefix.
290 * @param[in] pref_len Length of @p prefix, must be set correctly.
Radek Krejci1798aae2020-07-14 13:26:06 +0200291 * @param[in] module_key Mandatory key to reference module, can be namespace or name.
292 * @param[in] module_key_len Length of @p module_key, must be set correctly.
Michal Vasko501af032020-11-11 20:27:44 +0100293 * @param[in] value String value to be parsed.
294 * @param[in] value_len Length of @p value, must be set correctly.
295 * @param[in,out] dynamic Flag if @p value is dynamically allocated, is adjusted when @p value is consumed.
296 * @param[in] format Input format of @p value and @p ns.
Radek Krejciec9ad602021-01-04 10:46:30 +0100297 * @param[in] val_prefix_data Format-specific prefix data, param is spent (even in case the function fails):
298 * LY_PREF_SCHEMA - const struct lysp_module * (module used for resolving prefixes from imports)
299 * LY_PREF_SCHEMA_RESOLVED - struct lyd_value_prefix * (sized array of pairs: prefix - module)
300 * LY_PREF_XML - const struct ly_set * (set with defined namespaces stored as ::lyxml_ns)
301 * LY_PREF_JSON - NULL
Michal Vasko501af032020-11-11 20:27:44 +0100302 * @param[in] hints [Hints](@ref lydhints) from the parser regarding the node/value type.
Michal Vasko52927e22020-03-16 17:26:14 +0100303 * @param[out] node Created node.
304 * @return LY_SUCCESS on success.
305 * @return LY_ERR value if an error occurred.
306 */
Michal Vasko501af032020-11-11 20:27:44 +0100307LY_ERR lyd_create_opaq(const struct ly_ctx *ctx, const char *name, size_t name_len, const char *prefix, size_t pref_len,
308 const char *module_key, size_t module_key_len, const char *value, size_t value_len, ly_bool *dynamic,
Radek Krejci8df109d2021-04-23 12:19:08 +0200309 LY_VALUE_FORMAT format, void *val_prefix_data, uint32_t hints, struct lyd_node **node);
Michal Vasko52927e22020-03-16 17:26:14 +0100310
311/**
Michal Vaskoa6669ba2020-08-06 16:14:26 +0200312 * @brief Check the existence and create any non-existing implicit siblings, recursively for the created nodes.
313 *
314 * @param[in] parent Parent of the potential default values, NULL for top-level siblings.
315 * @param[in,out] first First sibling.
316 * @param[in] sparent Schema parent of the siblings, NULL if schema of @p parent can be used.
317 * @param[in] mod Module of the default values, NULL for nested siblings.
Michal Vaskoa6669ba2020-08-06 16:14:26 +0200318 * @param[in] node_when Optional set to add nodes with "when" conditions into.
Radek Krejci4f2e3e52021-03-30 14:20:28 +0200319 * @param[in] node_exts Optional set to add nodes and extension instances having own validation plugin callback into it.
Michal Vaskoc43c8ab2021-03-05 13:32:44 +0100320 * @param[in] node_types Optional set to add nodes with unresolved types into.
Michal Vaskoa6669ba2020-08-06 16:14:26 +0200321 * @param[in] impl_opts Implicit options (@ref implicitoptions).
322 * @param[in,out] diff Validation diff.
323 * @return LY_ERR value.
324 */
325LY_ERR lyd_new_implicit_r(struct lyd_node *parent, struct lyd_node **first, const struct lysc_node *sparent,
Radek Krejci4f2e3e52021-03-30 14:20:28 +0200326 const struct lys_module *mod, struct ly_set *node_when, struct ly_set *node_exts, struct ly_set *node_types,
Radek Krejci1deb5be2020-08-26 16:43:36 +0200327 uint32_t impl_opts, struct lyd_node **diff);
Michal Vaskoa6669ba2020-08-06 16:14:26 +0200328
329/**
Michal Vaskob104f112020-07-17 09:54:54 +0200330 * @brief Find the next node, before which to insert the new node.
Michal Vasko90932a92020-02-12 14:33:03 +0100331 *
Michal Vaskob104f112020-07-17 09:54:54 +0200332 * @param[in] first_sibling First sibling of the nodes to consider.
333 * @param[in] new_node Node that will be inserted.
334 * @return Node to insert after.
335 * @return NULL if the new node should be first.
Michal Vasko90932a92020-02-12 14:33:03 +0100336 */
Michal Vaskob104f112020-07-17 09:54:54 +0200337struct lyd_node *lyd_insert_get_next_anchor(const struct lyd_node *first_sibling, const struct lyd_node *new_node);
Michal Vasko90932a92020-02-12 14:33:03 +0100338
339/**
Michal Vaskob104f112020-07-17 09:54:54 +0200340 * @brief Insert a node into parent/siblings. Order and hashes are fully handled.
Michal Vasko90932a92020-02-12 14:33:03 +0100341 *
Michal Vasko9b368d32020-02-14 13:53:31 +0100342 * @param[in] parent Parent to insert into, NULL for top-level sibling.
343 * @param[in,out] first_sibling First sibling, NULL if no top-level sibling exist yet. Can be also NULL if @p parent is set.
Michal Vasko90932a92020-02-12 14:33:03 +0100344 * @param[in] node Individual node (without siblings) to insert.
Michal Vasko6ee6f432021-07-16 09:49:14 +0200345 * @param[in] last If set, do not search for the correct anchor but always insert at the end.
Michal Vasko90932a92020-02-12 14:33:03 +0100346 */
Michal Vasko6ee6f432021-07-16 09:49:14 +0200347void lyd_insert_node(struct lyd_node *parent, struct lyd_node **first_sibling, struct lyd_node *node, ly_bool last);
Michal Vasko90932a92020-02-12 14:33:03 +0100348
349/**
Michal Vaskoa5da3292020-08-12 13:10:50 +0200350 * @brief Insert a metadata (last) into a parent
351 *
352 * @param[in] parent Parent of the metadata.
353 * @param[in] meta Metadata (list) to be added into the @p parent.
Michal Vasko871a0252020-11-11 18:35:24 +0100354 * @param[in] clear_dflt Whether to clear dflt flag starting from @p parent, recursively all NP containers.
Michal Vaskoa5da3292020-08-12 13:10:50 +0200355 */
Michal Vasko871a0252020-11-11 18:35:24 +0100356void lyd_insert_meta(struct lyd_node *parent, struct lyd_meta *meta, ly_bool clear_dflt);
Michal Vaskoa5da3292020-08-12 13:10:50 +0200357
358/**
Michal Vasko52927e22020-03-16 17:26:14 +0100359 * @brief Create and insert a metadata (last) into a parent.
Michal Vasko90932a92020-02-12 14:33:03 +0100360 *
Michal Vasko52927e22020-03-16 17:26:14 +0100361 * @param[in] parent Parent of the metadata, can be NULL.
Michal Vasko9f96a052020-03-10 09:41:45 +0100362 * @param[in,out] meta Metadata list to add at its end if @p parent is NULL, returned created attribute.
363 * @param[in] mod Metadata module (with the annotation definition).
Michal Vasko90932a92020-02-12 14:33:03 +0100364 * @param[in] name Attribute name.
Michal Vaskof03ed032020-03-04 13:31:44 +0100365 * @param[in] name_len Length of @p name, must be set correctly.
Michal Vasko90932a92020-02-12 14:33:03 +0100366 * @param[in] value String value to be parsed.
Michal Vaskof03ed032020-03-04 13:31:44 +0100367 * @param[in] value_len Length of @p value, must be set correctly.
Michal Vasko90932a92020-02-12 14:33:03 +0100368 * @param[in,out] dynamic Flag if @p value is dynamically allocated, is adjusted when @p value is consumed.
Michal Vasko90932a92020-02-12 14:33:03 +0100369 * @param[in] format Input format of @p value.
Michal Vaskoc8a230d2020-08-14 12:17:10 +0200370 * @param[in] prefix_data Format-specific data for resolving any prefixes (see ::ly_resolve_prefix).
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200371 * @param[in] hints [Value hints](@ref lydvalhints) from the parser regarding the value type.
Michal Vasko871a0252020-11-11 18:35:24 +0100372 * @param[in] clear_dflt Whether to clear dflt flag starting from @p parent, recursively all NP containers.
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200373 * @param[out] incomplete Whether the value needs to be resolved.
Michal Vasko90932a92020-02-12 14:33:03 +0100374 * @return LY_SUCCESS on success.
375 * @return LY_EINCOMPLETE in case data tree is needed to finish the validation.
376 * @return LY_ERR value if an error occurred.
377 */
Michal Vasko9f96a052020-03-10 09:41:45 +0100378LY_ERR lyd_create_meta(struct lyd_node *parent, struct lyd_meta **meta, const struct lys_module *mod, const char *name,
Radek Krejci8df109d2021-04-23 12:19:08 +0200379 size_t name_len, const char *value, size_t value_len, ly_bool *dynamic, LY_VALUE_FORMAT format,
Radek Krejci84d7fd72021-07-14 18:32:21 +0200380 void *prefix_data, uint32_t hints, ly_bool clear_dflt, ly_bool *incomplete);
Radek Krejci1798aae2020-07-14 13:26:06 +0200381
382/**
Michal Vaskoa5da3292020-08-12 13:10:50 +0200383 * @brief Insert an attribute (last) into a parent
Radek Krejci1798aae2020-07-14 13:26:06 +0200384 *
Michal Vaskoa5da3292020-08-12 13:10:50 +0200385 * @param[in] parent Parent of the attributes.
386 * @param[in] attr Attribute (list) to be added into the @p parent.
Radek Krejci1798aae2020-07-14 13:26:06 +0200387 */
Michal Vaskoa5da3292020-08-12 13:10:50 +0200388void lyd_insert_attr(struct lyd_node *parent, struct lyd_attr *attr);
Michal Vasko90932a92020-02-12 14:33:03 +0100389
390/**
Michal Vasko52927e22020-03-16 17:26:14 +0100391 * @brief Create and insert a generic attribute (last) into a parent.
392 *
393 * @param[in] parent Parent of the attribute, can be NULL.
394 * @param[in,out] attr Attribute list to add at its end if @p parent is NULL, returned created attribute.
395 * @param[in] ctx libyang context.
396 * @param[in] name Attribute name.
397 * @param[in] name_len Length of @p name, must be set correctly.
Michal Vasko52927e22020-03-16 17:26:14 +0100398 * @param[in] prefix Attribute prefix.
399 * @param[in] prefix_len Attribute prefix length.
Radek Krejci1798aae2020-07-14 13:26:06 +0200400 * @param[in] module_key Mandatory key to reference module, can be namespace or name.
401 * @param[in] module_key_len Length of @p module_key, must be set correctly.
Michal Vasko501af032020-11-11 20:27:44 +0100402 * @param[in] value String value to be parsed.
403 * @param[in] value_len Length of @p value, must be set correctly.
404 * @param[in,out] dynamic Flag if @p value is dynamically allocated, is adjusted when @p value is consumed.
405 * @param[in] format Input format of @p value and @p ns.
406 * @param[in] val_prefix_data Format-specific prefix data, param is spent (even in case the function fails).
407 * @param[in] hints [Hints](@ref lydhints) from the parser regarding the node/value type.
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200408 * @return LY_SUCCESS on success,
409 * @return LY_ERR value on error.
Michal Vasko52927e22020-03-16 17:26:14 +0100410 */
Radek Krejci1798aae2020-07-14 13:26:06 +0200411LY_ERR lyd_create_attr(struct lyd_node *parent, struct lyd_attr **attr, const struct ly_ctx *ctx, const char *name,
Michal Vasko501af032020-11-11 20:27:44 +0100412 size_t name_len, const char *prefix, size_t prefix_len, const char *module_key, size_t module_key_len,
Radek Krejci8df109d2021-04-23 12:19:08 +0200413 const char *value, size_t value_len, ly_bool *dynamic, LY_VALUE_FORMAT format, void *val_prefix_data, uint32_t hints);
Radek Krejci1798aae2020-07-14 13:26:06 +0200414
415/**
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200416 * @brief Store and canonize the given @p value into @p val according to the schema node type rules.
Radek Krejci38d85362019-09-05 16:26:38 +0200417 *
Michal Vasko8d544252020-03-02 10:19:52 +0100418 * @param[in] ctx libyang context.
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200419 * @param[in,out] val Storage for the value.
420 * @param[in] type Type of the value.
Radek Krejcif9943642021-04-26 10:18:21 +0200421 * @param[in] value Value to be parsed, must not be NULL.
Michal Vaskof03ed032020-03-04 13:31:44 +0100422 * @param[in] value_len Length of the give @p value, must be set correctly.
Michal Vasko90932a92020-02-12 14:33:03 +0100423 * @param[in,out] dynamic Flag if @p value is dynamically allocated, is adjusted when @p value is consumed.
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200424 * @param[in] format Input format of @p value.
Michal Vaskoc8a230d2020-08-14 12:17:10 +0200425 * @param[in] prefix_data Format-specific data for resolving any prefixes (see ::ly_resolve_prefix).
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200426 * @param[in] hints [Value hints](@ref lydvalhints) from the parser.
427 * @param[in] ctx_node Context schema node.
428 * @param[out] incomplete Optional, set if the value also needs to be resolved.
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200429 * @return LY_SUCCESS on success,
430 * @return LY_ERR value on error.
Radek Krejci38d85362019-09-05 16:26:38 +0200431 */
Radek Krejcif9943642021-04-26 10:18:21 +0200432LY_ERR lyd_value_store(const struct ly_ctx *ctx, struct lyd_value *val, const struct lysc_type *type, const void *value,
Radek Krejci8df109d2021-04-23 12:19:08 +0200433 size_t value_len, ly_bool *dynamic, LY_VALUE_FORMAT format, void *prefix_data, uint32_t hints,
Radek Krejci2efc45b2020-12-22 16:25:44 +0100434 const struct lysc_node *ctx_node, ly_bool *incomplete);
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200435
436/**
437 * @brief Validate previously incompletely stored value.
438 *
439 * @param[in] ctx libyang context.
440 * @param[in] type Schema type of the value (not the stored one, but the original one).
441 * @param[in,out] val Stored value to resolve.
442 * @param[in] ctx_node Context node for the resolution.
443 * @param[in] tree Data tree for the resolution.
Michal Vaskofeca4fb2020-10-05 08:58:40 +0200444 * @return LY_SUCCESS on success,
445 * @return LY_ERR value on error.
446 */
447LY_ERR lyd_value_validate_incomplete(const struct ly_ctx *ctx, const struct lysc_type *type, struct lyd_value *val,
Radek Krejci2efc45b2020-12-22 16:25:44 +0100448 const struct lyd_node *ctx_node, const struct lyd_node *tree);
Radek Krejci38d85362019-09-05 16:26:38 +0200449
Michal Vaskoaebbce02021-04-06 09:23:37 +0200450/**
451 * @brief Check type restrictions applicable to the particular leaf/leaf-list with the given string @p value coming
452 * from a schema.
453 *
454 * This function check just the type's restriction, if you want to check also the data tree context (e.g. in case of
455 * require-instance restriction), use ::lyd_value_validate().
456 *
457 * @param[in] ctx libyang context for logging (function does not log errors when @p ctx is NULL)
458 * @param[in] node Schema node for the @p value.
459 * @param[in] value String value to be checked, expected to be in JSON format.
460 * @param[in] value_len Length of the given @p value (mandatory).
461 * @param[in] format Value prefix format.
462 * @param[in] prefix_data Format-specific data for resolving any prefixes (see ::ly_resolve_prefix).
463 * @return LY_SUCCESS on success
464 * @return LY_ERR value if an error occurred.
465 */
466LY_ERR lys_value_validate(const struct ly_ctx *ctx, const struct lysc_node *node, const char *value, size_t value_len,
Radek Krejci8df109d2021-04-23 12:19:08 +0200467 LY_VALUE_FORMAT format, void *prefix_data);
Michal Vaskof937cfe2020-08-03 16:07:12 +0200468
Radek Krejci38d85362019-09-05 16:26:38 +0200469/**
Radek Krejcie7b95092019-05-15 11:03:07 +0200470 * @defgroup datahash Data nodes hash manipulation
471 * @ingroup datatree
Michal Vasko8081a812021-07-15 09:19:43 +0200472 * @{
Radek Krejcie7b95092019-05-15 11:03:07 +0200473 */
474
475/**
Radek Krejci1f05b6a2019-07-18 16:15:06 +0200476 * @brief Generate hash for the node.
477 *
478 * @param[in] node Data node to (re)generate hash value.
479 * @return LY_ERR value.
480 */
481LY_ERR lyd_hash(struct lyd_node *node);
482
483/**
484 * @brief Insert hash of the node into the hash table of its parent.
485 *
Radek Krejci8678fa42020-08-18 16:07:28 +0200486 * @param[in] node Data node which hash will be inserted into the ::lyd_node_inner.children_ht hash table of its parent.
Radek Krejci1f05b6a2019-07-18 16:15:06 +0200487 * @return LY_ERR value.
488 */
489LY_ERR lyd_insert_hash(struct lyd_node *node);
490
491/**
Radek Krejcie7b95092019-05-15 11:03:07 +0200492 * @brief Maintain node's parent's children hash table when unlinking the node.
493 *
494 * When completely freeing data tree, it is expected to free the parent's children hash table first, at once.
495 *
496 * @param[in] node The data node being unlinked from its parent.
497 */
498void lyd_unlink_hash(struct lyd_node *node);
499
500/** @} datahash */
501
Radek Krejci084289f2019-07-09 17:35:30 +0200502/**
Michal Vaskod59035b2020-07-08 12:00:06 +0200503 * @brief Append all list key predicates to path.
504 *
505 * @param[in] node Node with keys to print.
506 * @param[in,out] buffer Buffer to print to.
507 * @param[in,out] buflen Current buffer length.
508 * @param[in,out] bufused Current number of characters used in @p buffer.
509 * @param[in] is_static Whether buffer is static or can be reallocated.
510 * @return LY_ERR
511 */
Radek Krejci857189e2020-09-01 13:26:36 +0200512LY_ERR lyd_path_list_predicate(const struct lyd_node *node, char **buffer, size_t *buflen, size_t *bufused, ly_bool is_static);
Michal Vaskod59035b2020-07-08 12:00:06 +0200513
Radek Krejcie7b95092019-05-15 11:03:07 +0200514#endif /* LY_TREE_DATA_INTERNAL_H_ */