blob: d57cd3145903bacd5cd44ec1e7724cf27ff69978 [file] [log] [blame]
Michal Vasko004d3152020-06-11 19:59:22 +02001/**
2 * @file path.h
3 * @author Michal Vasko <mvasko@cesnet.cz>
4 * @brief Path structure and manipulation routines.
5 *
6 * Copyright (c) 2020 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_PATH_H_
16#define LY_PATH_H_
17
Radek Krejciad97c5f2020-06-30 09:19:28 +020018#include <stddef.h>
Michal Vasko004d3152020-06-11 19:59:22 +020019#include <stdint.h>
20
21#include "log.h"
Michal Vaskof937cfe2020-08-03 16:07:12 +020022#include "plugins_types.h"
Michal Vasko00cbf532020-06-15 13:58:47 +020023#include "tree.h"
Michal Vasko004d3152020-06-11 19:59:22 +020024#include "tree_data.h"
25
Radek Krejciad97c5f2020-06-30 09:19:28 +020026struct ly_ctx;
27struct lys_module;
Michal Vasko004d3152020-06-11 19:59:22 +020028struct lysc_node;
29struct lyxp_expr;
30
31enum ly_path_pred_type {
32 LY_PATH_PREDTYPE_NONE = 0, /**< no predicate */
33 LY_PATH_PREDTYPE_POSITION, /**< position predicate - [2] */
34 LY_PATH_PREDTYPE_LIST, /**< keys predicate - [key1='val1'][key2='val2']... */
35 LY_PATH_PREDTYPE_LEAFLIST /**< leaflist value predicate - [.='value'] */
36};
37
38/**
39 * @brief Structure for holding one segment of resolved path on schema including simple predicates.
40 * Is used as a [sized array](@ref sizedarrays).
41 */
42struct ly_path {
43 const struct lysc_node *node; /**< Schema node representing the path segment, first node has special meaning:
44 - is a top-level node - path is absolute,
45 - is inner node - path is relative */
46 struct ly_path_predicate {
47 union {
48 uint64_t position; /**< position value for the position-predicate */
49 struct {
50 const struct lysc_node *key; /**< key node of the predicate, NULL in case of a leaf-list predicate */
51 struct lyd_value value; /**< value representation according to the key's type */
52 };
53 };
54 } *predicates; /**< [Sized array](@ref sizedarrays) of the path segment's predicates */
55 enum ly_path_pred_type pred_type; /**< Predicate type (see YANG ABNF) */
56};
57
58/**
59 * @defgroup path_begin_options Path begin options.
60 * @{
61 */
62#define LY_PATH_BEGIN_ABSOLUTE 0x01 /**< path must be absolute */
63#define LY_PATH_BEGIN_EITHER 0x02 /**< path be be iether absolute or relative */
64/** @} */
65
66/**
67 * @defgroup path_lref_options Path leafref options.
68 * @{
69 */
70#define LY_PATH_LREF_FALSE 0x04 /**< path does not represent leafref */
71#define LY_PATH_LREF_TRUE 0x08 /* '..' in path allowed, special leafref predicates expected (but are not compiled),
72 implement traversed modules */
73/** @} */
74
75/**
76 * @defgroup path_prefix_options Path prefix options.
77 * @{
78 */
79#define LY_PATH_PREFIX_OPTIONAL 0x10 /**< prefixes in the path are optional */
80#define LY_PATH_PREFIX_MANDATORY 0x20 /**< prefixes in the path are mandatory (XML insatnce-identifier) */
81/** @} */
82
83/**
84 * @defgroup path_pred_options Path predicate options.
85 * @{
86 */
87#define LY_PATH_PRED_KEYS 0x40 /* expected predicate only - [node='value']* */
88#define LY_PATH_PRED_SIMPLE 0x80 /* expected predicates - [node='value']*; [.='value']; [1] */
89#define LY_PATH_PRED_LEAFREF 0xC0 /* expected predicates only leafref - [node=current()/../../../node/node];
90 at least 1 ".." and 1 "node" after */
91/** @} */
92
93/**
94 * @brief Parse path into XPath token structure and perform all additional checks.
95 *
96 * @param[in] ctx libyang context.
Michal Vasko6b26e742020-07-17 15:02:10 +020097 * @param[in] ctx_node Optional context node.
Michal Vasko004d3152020-06-11 19:59:22 +020098 * @param[in] str_path Path to parse.
99 * @param[in] path_len Length of @p str_path.
100 * @param[in] begin Begin option (@ref path_begin_options).
101 * @param[in] lref Lref option (@ref path_lref_options).
102 * @param[in] prefix Prefix option (@ref path_prefix_options).
103 * @param[in] pred Predicate option (@ref path_pred_options).
104 * @param[out] expr Parsed path.
105 * @return LY_ERR value.
106 */
Michal Vasko6b26e742020-07-17 15:02:10 +0200107LY_ERR ly_path_parse(const struct ly_ctx *ctx, const struct lysc_node *ctx_node, const char *str_path, size_t path_len,
108 uint8_t begin, uint8_t lref, uint8_t prefix, uint8_t pred, struct lyxp_expr **expr);
Michal Vasko004d3152020-06-11 19:59:22 +0200109
110/**
111 * @brief Parse predicate into XPath token structure and perform all additional checks.
112 *
113 * @param[in] ctx libyang context.
Michal Vasko6b26e742020-07-17 15:02:10 +0200114 * @param[in] cur_node Optional current (original context) node.
Michal Vasko004d3152020-06-11 19:59:22 +0200115 * @param[in] str_path Path to parse.
116 * @param[in] path_len Length of @p str_path.
117 * @param[in] prefix Prefix option (@ref path_prefix_options).
118 * @param[in] pred Predicate option (@ref path_pred_options).
119 * @param[out] expr Parsed path.
120 * @return LY_ERR value.
121 */
Michal Vasko6b26e742020-07-17 15:02:10 +0200122LY_ERR ly_path_parse_predicate(const struct ly_ctx *ctx, const struct lysc_node *cur_node, const char *str_path,
123 size_t path_len, uint8_t prefix, uint8_t pred, struct lyxp_expr **expr);
Michal Vasko004d3152020-06-11 19:59:22 +0200124
125/**
Michal Vasko00cbf532020-06-15 13:58:47 +0200126 * @defgroup path_oper_options Path operation options.
127 * @{
128 */
129#define LY_PATH_OPER_INPUT 0x01 /**< if any RPC/action is traversed, its input nodes are used */
130#define LY_PATH_OPER_OUTPUT 0x02 /**< if any RPC/action is traversed, its output nodes are used */
131/** @} */
132
133/* lref */
134
135/**
136 * @defgroup path_target_options Path target options.
137 * @{
138 */
139#define LY_PATH_TARGET_SINGLE 0x10 /**< last (target) node must identify an exact instance */
140#define LY_PATH_TARGET_MANY 0x20 /**< last (target) node may identify all instances (of leaf-list/list) */
141/** @} */
142
143/**
Michal Vasko004d3152020-06-11 19:59:22 +0200144 * @brief Compile path into ly_path structure. Any predicates of a leafref are only checked, not compiled.
145 *
Michal Vasko00cbf532020-06-15 13:58:47 +0200146 * @param[in] ctx libyang context.
Michal Vasko004d3152020-06-11 19:59:22 +0200147 * @param[in] cur_mod Module of the current (original context) node. Used for nodes without prefix for ::LYD_SCHEMA format.
Michal Vasko6b26e742020-07-17 15:02:10 +0200148 * @param[in] ctx_node Optional context node.
Michal Vasko004d3152020-06-11 19:59:22 +0200149 * @param[in] expr Parsed path.
150 * @param[in] lref Lref option (@ref path_lref_options).
Michal Vasko00cbf532020-06-15 13:58:47 +0200151 * @param[in] oper Oper option (@ref path_oper_options).
152 * @param[in] target Target option (@ref path_target_options).
Michal Vasko004d3152020-06-11 19:59:22 +0200153 * @param[in] resolve_prefix Callback for prefix resolution.
154 * @param[in] prefix_data Data for @p resolve_prefix.
155 * @param[in] format Format of the path.
156 * @param[out] path Compiled path.
157 * @return LY_ERR value.
158 */
Michal Vasko00cbf532020-06-15 13:58:47 +0200159LY_ERR ly_path_compile(const struct ly_ctx *ctx, const struct lys_module *cur_mod, const struct lysc_node *ctx_node,
160 const struct lyxp_expr *expr, uint8_t lref, uint8_t oper, uint8_t target,
161 ly_clb_resolve_prefix resolve_prefix, void *prefix_data, LYD_FORMAT format, struct ly_path **path);
Michal Vasko004d3152020-06-11 19:59:22 +0200162
163/**
164 * @brief Compile predicate into ly_path_predicate structure. Only simple predicates (not leafref) are supported.
165 *
Michal Vasko00cbf532020-06-15 13:58:47 +0200166 * @param[in] ctx libyang context.
Michal Vasko6b26e742020-07-17 15:02:10 +0200167 * @param[in] cur_node Optional current (original context) node.
Michal Vasko004d3152020-06-11 19:59:22 +0200168 * @param[in] cur_mod Module of the current (original context) node. Used for nodes without prefix for ::LYD_SCHEMA format.
169 * @param[in] ctx_node Context node, node for which the predicate is defined.
170 * @param[in] expr Parsed path.
171 * @param[in,out] tok_idx Index in @p expr, is adjusted for parsed tokens.
172 * @param[in] resolve_prefix Callback for prefix resolution.
173 * @param[in] prefix_data Data for @p resolve_prefix.
174 * @param[in] format Format of the path.
175 * @param[out] predicates Compiled predicates.
176 * @param[out] pred_type Type of the compiled predicate(s).
177 * @return LY_ERR value.
178 */
Michal Vasko6b26e742020-07-17 15:02:10 +0200179LY_ERR ly_path_compile_predicate(const struct ly_ctx *ctx, const struct lysc_node *cur_node, const struct lys_module *cur_mod,
Michal Vasko00cbf532020-06-15 13:58:47 +0200180 const struct lysc_node *ctx_node, const struct lyxp_expr *expr, uint16_t *tok_idx,
181 ly_clb_resolve_prefix resolve_prefix, void *prefix_data, LYD_FORMAT format,
182 struct ly_path_predicate **predicates, enum ly_path_pred_type *pred_type);
183
184/**
185 * @brief Resolve at least partially the target defined by ly_path structure. Not supported for leafref!
186 *
187 * @param[in] path Path structure specifying the target.
188 * @param[in] start Starting node for relative paths, can be any for absolute paths.
189 * @param[out] path_idx Last found path segment index, can be NULL, set to 0 if not found.
190 * @param[out] match Last found matching node, can be NULL, set to NULL if not found.
191 * @return LY_ENOTFOUND if no nodes were found,
192 * @return LY_EINCOMPLETE if some node was found but not the last one,
193 * @return LY_SUCCESS when the last node in the path was found,
194 * @return LY_ERR on another error.
195 */
Michal Vaskofd69e1d2020-07-03 11:57:17 +0200196LY_ERR ly_path_eval_partial(const struct ly_path *path, const struct lyd_node *start, LY_ARRAY_COUNT_TYPE *path_idx,
Michal Vasko00cbf532020-06-15 13:58:47 +0200197 struct lyd_node **match);
Michal Vasko004d3152020-06-11 19:59:22 +0200198
199/**
200 * @brief Resolve the target defined by ly_path structure. Not supported for leafref!
201 *
202 * @param[in] path Path structure specifying the target.
203 * @param[in] start Starting node for relative paths, can be any for absolute paths.
204 * @param[out] match Found matching node, can be NULL, set to NULL if not found.
205 * @return LY_ENOTFOUND if no nodes were found,
206 * @return LY_SUCCESS when the last node in the path was found,
207 * @return LY_ERR on another error.
208 */
209LY_ERR ly_path_eval(const struct ly_path *path, const struct lyd_node *start, struct lyd_node **match);
210
211/**
212 * @brief Duplicate ly_path structure.
213 *
214 * @param[in] ctx libyang context.
215 * @param[in] path Path to duplicate.
216 * @param[out] dup Duplicated path.
217 * @return LY_ERR value.
218 */
219LY_ERR ly_path_dup(const struct ly_ctx *ctx, const struct ly_path *path, struct ly_path **dup);
220
221/**
222 * @brief Free ly_path_predicate structure.
223 *
224 * @param[in] ctx libyang context.
225 * @param[in] pred_type Predicate type.
226 * @param[in] llist Leaf-list in case of leaf-list predicate.
227 * @param[in] predicates Predicates ([sized array](@ref sizedarrays)) to free.
228 */
229void ly_path_predicates_free(const struct ly_ctx *ctx, enum ly_path_pred_type pred_type, const struct lysc_node *llist,
230 struct ly_path_predicate *predicates);
231
232/**
233 * @brief Free ly_path structure.
234 *
235 * @param[in] ctx libyang context.
236 * @param[in] path The structure ([sized array](@ref sizedarrays)) to free.
237 */
238void ly_path_free(const struct ly_ctx *ctx, struct ly_path *path);
239
240#endif /* LY_PATH_H_ */