blob: bc181af91e46f35177359eac01ead607889f09e3 [file] [log] [blame]
/**
* @file tree_data_internal.h
* @author Radek Krejci <rkrejci@cesnet.cz>
* @brief internal functions for YANG schema trees.
*
* Copyright (c) 2015 - 2020 CESNET, z.s.p.o.
*
* This source code is licensed under BSD 3-Clause License (the "License").
* You may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* https://opensource.org/licenses/BSD-3-Clause
*/
#ifndef LY_TREE_DATA_INTERNAL_H_
#define LY_TREE_DATA_INTERNAL_H_
#include "log.h"
#include "lyb.h"
#include "plugins_types.h"
#include "set.h"
#include "tree_data.h"
#include <stddef.h>
struct ly_path_predicate;
struct lysc_module;
/**
* @brief Internal data parser flags.
*/
#define LYD_INTOPT_RPC 0x01 /**< RPC/action invocation is being parsed */
#define LYD_INTOPT_NOTIF 0x02 /**< notification is being parsed */
#define LYD_INTOPT_REPLY 0x04 /**< RPC/action reply is being parsed */
/**
* @brief Hash schema sibling to be used for LYB data.
*
* @param[in] sibling Sibling to hash.
* @param[in] collision_id Collision ID of the hash to generate.
* @return Generated hash.
*/
LYB_HASH lyb_hash(struct lysc_node *sibling, uint8_t collision_id);
/**
* @brief Check whether a sibling's module is in a module array.
*
* @param[in] sibling Sibling to check.
* @param[in] models Modules in a sized array.
* @return non-zero if the module was found,
* @return Boolean value whether @p sibling's module found in the given @p models array.
*/
ly_bool lyb_has_schema_model(const struct lysc_node *sibling, const struct lys_module **models);
/**
* @brief Check whether a node to be deleted is the first top-level sibling.
*
* @param[in] first First sibling.
* @param[in] to_del Node to be deleted.
*/
#define LYD_DEL_IS_ROOT(first, to_del) (((first) == (to_del)) && !(first)->parent && !(first)->prev->next)
/**
* @brief Get address of a node's child pointer if any.
*
* @param[in] node Node to check.
* @return Address of the node's child member,
* @return NULL if there is no child pointer.
*/
struct lyd_node **lyd_node_children_p(struct lyd_node *node);
/**
* @brief Just like ::lys_getnext() but iterates over all data instances of the schema nodes.
*
* @param[in] last Last returned data node.
* @param[in] sibling Data node sibling to search in.
* @param[in,out] slast Schema last node, set to NULL for first call and do not change afterwards.
* May not be set if the function is used only for any suitable node existence check (such as the existence
* of any choice case data).
* @param[in] parent Schema parent of the iterated children nodes.
* @param[in] module Schema module of the iterated top-level nodes.
* @return Next matching data node,
* @return NULL if last data node was already returned.
*/
struct lyd_node *lys_getnext_data(const struct lyd_node *last, const struct lyd_node *sibling,
const struct lysc_node **slast, const struct lysc_node *parent,
const struct lysc_module *module);
/**
* @brief Create a term (leaf/leaf-list) node from a string value.
*
* Hash is calculated and new node flag is set.
*
* @param[in] schema Schema node of the new data node.
* @param[in] value String value to be parsed.
* @param[in] value_len Length of @p value, must be set correctly.
* @param[in,out] dynamic Flag if @p value is dynamically allocated, is adjusted when @p value is consumed.
* @param[in] format Input format of @p value.
* @param[in] prefix_data Format-specific data for resolving any prefixes (see ::ly_resolve_prefix).
* @param[in] hints [Value hints](@ref lydvalhints) from the parser regarding the value type.
* @param[out] incomplete Whether the value needs to be resolved.
* @param[out] node Created node.
* @return LY_SUCCESS on success.
* @return LY_EINCOMPLETE in case data tree is needed to finish the validation.
* @return LY_ERR value if an error occurred.
*/
LY_ERR lyd_create_term(const struct lysc_node *schema, const char *value, size_t value_len, ly_bool *dynamic,
LY_PREFIX_FORMAT format, void *prefix_data, uint32_t hints, ly_bool *incomplete, struct lyd_node **node);
/**
* @brief Create a term (leaf/leaf-list) node from a parsed value by duplicating it.
*
* Hash is calculated and new node flag is set.
*
* @param[in] schema Schema node of the new data node.
* @param[in] val Parsed value to use.
* @param[out] node Created node.
* @return LY_SUCCESS on success.
* @return LY_ERR value if an error occurred.
*/
LY_ERR lyd_create_term2(const struct lysc_node *schema, const struct lyd_value *val, struct lyd_node **node);
/**
* @brief Create an inner (container/list/RPC/action/notification) node.
*
* Hash is calculated and new node flag is set except
* for list with keys, when the hash is not calculated!
* Also, non-presence container has its default flag set.
*
* @param[in] schema Schema node of the new data node.
* @param[out] node Created node.
* @return LY_SUCCESS on success.
* @return LY_ERR value if an error occurred.
*/
LY_ERR lyd_create_inner(const struct lysc_node *schema, struct lyd_node **node);
/**
* @brief Create a list with all its keys (cannot be used for key-less list).
*
* Hash is calculated and new node flag is set.
*
* @param[in] schema Schema node of the new data node.
* @param[in] predicates Compiled key list predicates.
* @param[out] node Created node.
* @return LY_SUCCESS on success.
* @return LY_ERR value if an error occurred.
*/
LY_ERR lyd_create_list(const struct lysc_node *schema, const struct ly_path_predicate *predicates, struct lyd_node **node);
/**
* @brief Create an anyxml/anydata node.
*
* Hash is calculated and flags are properly set based on @p is_valid.
*
* @param[in] schema Schema node of the new data node.
* @param[in] value Value of the any node, is directly assigned into the data node.
* @param[in] value_type Value type of the value.
* @param[out] node Created node.
* @return LY_SUCCESS on success.
* @return LY_ERR value if an error occurred.
*/
LY_ERR lyd_create_any(const struct lysc_node *schema, const void *value, LYD_ANYDATA_VALUETYPE value_type,
struct lyd_node **node);
/**
* @brief Create an opaque node.
*
* @param[in] ctx libyang context.
* @param[in] name Element name.
* @param[in] name_len Length of @p name, must be set correctly.
* @param[in] value String value to be parsed.
* @param[in] value_len Length of @p value, must be set correctly.
* @param[in,out] dynamic Flag if @p value is dynamically allocated, is adjusted when @p value is consumed.
* @param[in] format Input format of @p value and @p ns.
* @param[in] hints [Hints](@ref lydhints) from the parser regarding the node/value type.
* @param[in] val_prefs Possible value prefixes, array is spent (even in case the function fails).
* @param[in] prefix Element prefix.
* @param[in] pref_len Length of @p prefix, must be set correctly.
* @param[in] module_key Mandatory key to reference module, can be namespace or name.
* @param[in] module_key_len Length of @p module_key, must be set correctly.
* @param[out] node Created node.
* @return LY_SUCCESS on success.
* @return LY_ERR value if an error occurred.
*/
LY_ERR lyd_create_opaq(const struct ly_ctx *ctx, const char *name, size_t name_len, const char *value, size_t value_len,
ly_bool *dynamic, LYD_FORMAT format, uint32_t hints, struct ly_prefix *val_prefs, const char *prefix,
size_t pref_len, const char *module_key, size_t module_key_len, struct lyd_node **node);
/**
* @brief Check the existence and create any non-existing implicit siblings, recursively for the created nodes.
*
* @param[in] parent Parent of the potential default values, NULL for top-level siblings.
* @param[in,out] first First sibling.
* @param[in] sparent Schema parent of the siblings, NULL if schema of @p parent can be used.
* @param[in] mod Module of the default values, NULL for nested siblings.
* @param[in] node_types Optional set to add nodes with unresolved types into.
* @param[in] node_when Optional set to add nodes with "when" conditions into.
* @param[in] impl_opts Implicit options (@ref implicitoptions).
* @param[in,out] diff Validation diff.
* @return LY_ERR value.
*/
LY_ERR lyd_new_implicit_r(struct lyd_node *parent, struct lyd_node **first, const struct lysc_node *sparent,
const struct lys_module *mod, struct ly_set *node_types, struct ly_set *node_when,
uint32_t impl_opts, struct lyd_node **diff);
/**
* @brief Find the next node, before which to insert the new node.
*
* @param[in] first_sibling First sibling of the nodes to consider.
* @param[in] new_node Node that will be inserted.
* @return Node to insert after.
* @return NULL if the new node should be first.
*/
struct lyd_node *lyd_insert_get_next_anchor(const struct lyd_node *first_sibling, const struct lyd_node *new_node);
/**
* @brief Insert a node into parent/siblings. Order and hashes are fully handled.
*
* @param[in] parent Parent to insert into, NULL for top-level sibling.
* @param[in,out] first_sibling First sibling, NULL if no top-level sibling exist yet. Can be also NULL if @p parent is set.
* @param[in] node Individual node (without siblings) to insert.
*/
void lyd_insert_node(struct lyd_node *parent, struct lyd_node **first_sibling, struct lyd_node *node);
/**
* @brief Insert a metadata (last) into a parent
*
* @param[in] parent Parent of the metadata.
* @param[in] meta Metadata (list) to be added into the @p parent.
*/
void lyd_insert_meta(struct lyd_node *parent, struct lyd_meta *meta);
/**
* @brief Create and insert a metadata (last) into a parent.
*
* @param[in] parent Parent of the metadata, can be NULL.
* @param[in,out] meta Metadata list to add at its end if @p parent is NULL, returned created attribute.
* @param[in] mod Metadata module (with the annotation definition).
* @param[in] name Attribute name.
* @param[in] name_len Length of @p name, must be set correctly.
* @param[in] value String value to be parsed.
* @param[in] value_len Length of @p value, must be set correctly.
* @param[in,out] dynamic Flag if @p value is dynamically allocated, is adjusted when @p value is consumed.
* @param[in] format Input format of @p value.
* @param[in] prefix_data Format-specific data for resolving any prefixes (see ::ly_resolve_prefix).
* @param[in] hints [Value hints](@ref lydvalhints) from the parser regarding the value type.
* @param[out] incomplete Whether the value needs to be resolved.
* @return LY_SUCCESS on success.
* @return LY_EINCOMPLETE in case data tree is needed to finish the validation.
* @return LY_ERR value if an error occurred.
*/
LY_ERR lyd_create_meta(struct lyd_node *parent, struct lyd_meta **meta, const struct lys_module *mod, const char *name,
size_t name_len, const char *value, size_t value_len, ly_bool *dynamic, LY_PREFIX_FORMAT format,
void *prefix_data, uint32_t hints, ly_bool *incomplete);
/**
* @brief Insert an attribute (last) into a parent
*
* @param[in] parent Parent of the attributes.
* @param[in] attr Attribute (list) to be added into the @p parent.
*/
void lyd_insert_attr(struct lyd_node *parent, struct lyd_attr *attr);
/**
* @brief Create and insert a generic attribute (last) into a parent.
*
* @param[in] parent Parent of the attribute, can be NULL.
* @param[in,out] attr Attribute list to add at its end if @p parent is NULL, returned created attribute.
* @param[in] ctx libyang context.
* @param[in] name Attribute name.
* @param[in] name_len Length of @p name, must be set correctly.
* @param[in] value String value to be parsed.
* @param[in] value_len Length of @p value, must be set correctly.
* @param[in,out] dynamic Flag if @p value is dynamically allocated, is adjusted when @p value is consumed.
* @param[in] format Input format of @p value and @p ns.
* @param[in] hints [Hints](@ref lydhints) from the parser regarding the node/value type.
* @param[in] val_prefs Possible value prefixes, array is spent (even in case the function fails).
* @param[in] prefix Attribute prefix.
* @param[in] prefix_len Attribute prefix length.
* @param[in] module_key Mandatory key to reference module, can be namespace or name.
* @param[in] module_key_len Length of @p module_key, must be set correctly.
* @return LY_SUCCESS on success,
* @return LY_ERR value on error.
*/
LY_ERR lyd_create_attr(struct lyd_node *parent, struct lyd_attr **attr, const struct ly_ctx *ctx, const char *name,
size_t name_len, const char *value, size_t value_len, ly_bool *dynamic, LYD_FORMAT format, uint32_t hints,
struct ly_prefix *val_prefs, const char *prefix, size_t prefix_len, const char *module_key, size_t module_key_len);
/**
* @brief Store and canonize the given @p value into @p val according to the schema node type rules.
*
* @param[in] ctx libyang context.
* @param[in,out] val Storage for the value.
* @param[in] type Type of the value.
* @param[in] value String value to be parsed, must not be NULL.
* @param[in] value_len Length of the give @p value, must be set correctly.
* @param[in,out] dynamic Flag if @p value is dynamically allocated, is adjusted when @p value is consumed.
* @param[in] format Input format of @p value.
* @param[in] prefix_data Format-specific data for resolving any prefixes (see ::ly_resolve_prefix).
* @param[in] hints [Value hints](@ref lydvalhints) from the parser.
* @param[in] ctx_node Context schema node.
* @param[out] incomplete Optional, set if the value also needs to be resolved.
* @param[in] log_elem_type Elem type for logging.
* @param[in] log_elem Elem for logging.
* @return LY_SUCCESS on success,
* @return LY_ERR value on error.
*/
LY_ERR lyd_value_store(const struct ly_ctx *ctx, struct lyd_value *val, const struct lysc_type *type, const char *value,
size_t value_len, ly_bool *dynamic, LY_PREFIX_FORMAT format, void *prefix_data, uint32_t hints,
const struct lysc_node *ctx_node, ly_bool *incomplete, enum LY_VLOG_ELEM log_elem_type, const void *log_elem);
/**
* @brief Validate previously incompletely stored value.
*
* @param[in] ctx libyang context.
* @param[in] type Schema type of the value (not the stored one, but the original one).
* @param[in,out] val Stored value to resolve.
* @param[in] ctx_node Context node for the resolution.
* @param[in] tree Data tree for the resolution.
* @param[in] log_elem_type Elem type for logging.
* @param[in] log_elem Elem for logging.
* @return LY_SUCCESS on success,
* @return LY_ERR value on error.
*/
LY_ERR lyd_value_validate_incomplete(const struct ly_ctx *ctx, const struct lysc_type *type, struct lyd_value *val,
const struct lyd_node *ctx_node, const struct lyd_node *tree, enum LY_VLOG_ELEM log_elem_type, const void *log_elem);
/* generic function lys_value_validate */
LY_ERR _lys_value_validate(const struct ly_ctx *ctx, const struct lysc_node *node, const char *value, size_t value_len,
LY_PREFIX_FORMAT format, void *prefix_data);
/**
* @defgroup datahash Data nodes hash manipulation
* @ingroup datatree
*/
/**
* @brief Generate hash for the node.
*
* @param[in] node Data node to (re)generate hash value.
* @return LY_ERR value.
*/
LY_ERR lyd_hash(struct lyd_node *node);
/**
* @brief Insert hash of the node into the hash table of its parent.
*
* @param[in] node Data node which hash will be inserted into the ::lyd_node_inner.children_ht hash table of its parent.
* @return LY_ERR value.
*/
LY_ERR lyd_insert_hash(struct lyd_node *node);
/**
* @brief Maintain node's parent's children hash table when unlinking the node.
*
* When completely freeing data tree, it is expected to free the parent's children hash table first, at once.
*
* @param[in] node The data node being unlinked from its parent.
*/
void lyd_unlink_hash(struct lyd_node *node);
/** @} datahash */
/**
* @brief Iterate over implemented modules for functions that accept specific modules or the whole context.
*
* @param[in] tree Data tree.
* @param[in] module Selected module, NULL for all.
* @param[in] ctx Context, NULL for selected modules.
* @param[in,out] i Iterator, set to 0 on first call.
* @param[out] first First sibling of the returned module.
* @return Next module.
* @return NULL if all modules were traversed.
*/
const struct lys_module *lyd_mod_next_module(struct lyd_node *tree, const struct lys_module *module,
const struct ly_ctx *ctx, uint32_t *i, struct lyd_node **first);
/**
* @brief Iterate over modules for functions that want to traverse all the top-level data.
*
* @param[in,out] next Pointer to the next module data, set to first top-level sibling on first call.
* @param[out] first First sibling of the returned module.
* @return Next module.
* @return NULL if all modules were traversed.
*/
const struct lys_module *lyd_data_next_module(struct lyd_node **next, struct lyd_node **first);
/**
* @brief Check that a list has all its keys.
*
* @param[in] node List to check.
* @return LY_SUCCESS on success.
* @return LY_ENOT on a missing key.
*/
LY_ERR lyd_parse_check_keys(struct lyd_node *node);
/**
* @brief Set data flags for a newly parsed node.
*
* @param[in] node Node to use.
* @param[in] when_check Set of nodes with unresolved when.
* @param[in,out] meta Node metadata, may be removed from.
* @param[in] options Parse options.
*/
void lyd_parse_set_data_flags(struct lyd_node *node, struct ly_set *when_check, struct lyd_meta **meta, uint32_t options);
/**
* @brief Free value prefixes.
*
* @param[in] ctx libyang context.
* @param[in] val_prefis Value prefixes to free, sized array (@ref sizedarrays).
*/
void ly_free_val_prefs(const struct ly_ctx *ctx, struct ly_prefix *val_prefs);
/**
* @brief Append all list key predicates to path.
*
* @param[in] node Node with keys to print.
* @param[in,out] buffer Buffer to print to.
* @param[in,out] buflen Current buffer length.
* @param[in,out] bufused Current number of characters used in @p buffer.
* @param[in] is_static Whether buffer is static or can be reallocated.
* @return LY_ERR
*/
LY_ERR lyd_path_list_predicate(const struct lyd_node *node, char **buffer, size_t *buflen, size_t *bufused, ly_bool is_static);
#endif /* LY_TREE_DATA_INTERNAL_H_ */