blob: 668f9a009f8e36e17c6ea3190dac2e0376e9cb55 [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 *
6 * Copyright (c) 2015 - 2019 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_TREE_DATA_INTERNAL_H_
16#define LY_TREE_DATA_INTERNAL_H_
17
18#include "tree_data.h"
Radek Krejciaca74032019-06-04 08:53:06 +020019#include "plugins_types.h"
Radek Krejcie7b95092019-05-15 11:03:07 +020020
21/**
22 * @brief Get address of a node's child pointer if any.
23 *
24 * Decides the node's type and in case it has a children list, returns its address.
25 * @param[in] node Node to check.
26 * @return Address of the node's child member if any, NULL otherwise.
27 */
28struct lyd_node **lyd_node_children_p(struct lyd_node *node);
29
30/**
31 * @brief Check validity of data parser options.
32 *
33 * @param ctx libyang context
34 * @param options Data parser options to check
35 * @param func name of the function where called
36 * @return LY_SUCCESS when options are ok
37 * @return LY_EINVAL when multiple data types bits are set, or incompatible options are used together.
38 */
39LY_ERR lyd_parse_check_options(struct ly_ctx *ctx, int options, const char *func);
40
41/**
Radek Krejci5819f7c2019-05-31 14:53:29 +020042 * @brief Validate, canonize and store the given @p value into the node according to the node's type's rules.
Radek Krejcie7b95092019-05-15 11:03:07 +020043 *
Radek Krejci5819f7c2019-05-31 14:53:29 +020044 * @param[in] node Data node for with the @p value.
Radek Krejci084289f2019-07-09 17:35:30 +020045 * @param[in] value String value to be parsed, must not be NULL.
Radek Krejci5819f7c2019-05-31 14:53:29 +020046 * @param[in] value_len Length of the give @p value (mandatory).
47 * @param[in] dynamic Flag if @p value is a dynamically allocated memory and should be directly consumed/freed inside the function.
Radek Krejci084289f2019-07-09 17:35:30 +020048 * @param[in] get_prefix Parser-specific getter to resolve prefixes used in the @p value string.
Radek Krejciaca74032019-06-04 08:53:06 +020049 * @param[in] parser Parser's data for @p get_prefix
Radek Krejci084289f2019-07-09 17:35:30 +020050 * @param[in] format Input format of the data.
Radek Krejcie553e6d2019-06-07 15:33:18 +020051 * @param[in] trees ([Sized array](@ref sizedarrays)) of data trees (e.g. when validating RPC/Notification) where the required
52 * data instance (leafref target, instance-identifier) can be placed. NULL in case the data tree are not yet complete,
53 * then LY_EINCOMPLETE can be returned.
54 * @return LY_SUCCESS on success
55 * @return LY_EINCOMPLETE in case the @p trees is not provided and it was needed to finish the validation.
56 * @return LY_ERR value if an error occurred.
Radek Krejcie7b95092019-05-15 11:03:07 +020057 */
Radek Krejcie553e6d2019-06-07 15:33:18 +020058LY_ERR lyd_value_parse(struct lyd_node_term *node, const char *value, size_t value_len, int dynamic,
Radek Krejci084289f2019-07-09 17:35:30 +020059 ly_clb_resolve_prefix get_prefix, void *parser, LYD_FORMAT format,struct lyd_node **trees);
Radek Krejcie7b95092019-05-15 11:03:07 +020060
61/**
62 * @brief Parse XML string as YANG data tree.
63 *
64 * @param[in] ctx libyang context
65 * @param[in] data Pointer to the XML string representation of the YANG data to parse.
66 * @param[in] options @ref dataparseroptions
67 * @param[out] result Resulting list of the parsed data trees. Note that NULL can be a valid result.
68 * @reutn LY_ERR value.
69 */
70LY_ERR lyd_parse_xml(struct ly_ctx *ctx, const char *data, int options, struct lyd_node **result);
71
72/**
73 * @defgroup datahash Data nodes hash manipulation
74 * @ingroup datatree
75 */
76
77/**
78 * @brief Maintain node's parent's children hash table when unlinking the node.
79 *
80 * When completely freeing data tree, it is expected to free the parent's children hash table first, at once.
81 *
82 * @param[in] node The data node being unlinked from its parent.
83 */
84void lyd_unlink_hash(struct lyd_node *node);
85
86/** @} datahash */
87
Radek Krejci084289f2019-07-09 17:35:30 +020088/**
89 * @brief Free path (target) structure of the lyd_value.
90 *
91 * @param[in] ctx libyang context.
92 * @param[in] path The structure ([sized array](@ref sizedarrays)) to free.
93 */
94void lyd_value_free_path(struct ly_ctx *ctx, struct lyd_value_path *path);
95
Radek Krejcie7b95092019-05-15 11:03:07 +020096#endif /* LY_TREE_DATA_INTERNAL_H_ */