blob: 15404c7f038712507f4bc5e1f9c6feaaa8b114a1 [file] [log] [blame]
Radek Krejcib1646a92018-11-02 16:08:26 +01001/**
2 * @file xpath.c
3 * @author Michal Vasko <mvasko@cesnet.cz>
4 * @brief YANG XPath evaluation functions
5 *
Michal Vasko61ac2f62020-05-25 12:39:51 +02006 * Copyright (c) 2015 - 2020 CESNET, z.s.p.o.
Radek Krejcib1646a92018-11-02 16:08:26 +01007 *
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 */
Christian Hopps32874e12021-05-01 09:43:54 -040014#define _GNU_SOURCE /* asprintf, strdup */
Radek Krejcib1646a92018-11-02 16:08:26 +010015
Radek Krejci535ea9f2020-05-29 16:01:05 +020016#include "xpath.h"
Radek Krejcib1646a92018-11-02 16:08:26 +010017
Radek Krejci535ea9f2020-05-29 16:01:05 +020018#include <assert.h>
Radek Krejcib1646a92018-11-02 16:08:26 +010019#include <ctype.h>
Radek Krejci535ea9f2020-05-29 16:01:05 +020020#include <errno.h>
Radek Krejci535ea9f2020-05-29 16:01:05 +020021#include <math.h>
Radek Krejcie7b95092019-05-15 11:03:07 +020022#include <stdint.h>
Radek Krejcib1646a92018-11-02 16:08:26 +010023#include <stdio.h>
24#include <stdlib.h>
Radek Krejcib1646a92018-11-02 16:08:26 +010025#include <string.h>
Radek Krejcib1646a92018-11-02 16:08:26 +010026
Radek Krejci535ea9f2020-05-29 16:01:05 +020027#include "common.h"
Michal Vasko5aa44c02020-06-29 11:47:02 +020028#include "compat.h"
Radek Krejci535ea9f2020-05-29 16:01:05 +020029#include "context.h"
Radek Krejcie7b95092019-05-15 11:03:07 +020030#include "dict.h"
Radek Krejci535ea9f2020-05-29 16:01:05 +020031#include "hash_table.h"
Radek Krejci47fab892020-11-05 17:02:41 +010032#include "out.h"
Radek Krejci7931b192020-06-25 17:05:03 +020033#include "parser_data.h"
Michal Vasko004d3152020-06-11 19:59:22 +020034#include "path.h"
Michal Vasko03ff5a72019-09-11 13:49:33 +020035#include "plugins_types.h"
Radek Krejci535ea9f2020-05-29 16:01:05 +020036#include "printer_data.h"
Michal Vasko1a7a7bd2020-10-16 14:39:15 +020037#include "schema_compile_node.h"
Radek Krejci535ea9f2020-05-29 16:01:05 +020038#include "tree.h"
Radek Krejci77114102021-03-10 15:21:57 +010039#include "tree_data.h"
Radek Krejci535ea9f2020-05-29 16:01:05 +020040#include "tree_data_internal.h"
Radek Krejci859a15a2021-03-05 20:56:59 +010041#include "tree_edit.h"
Radek Krejci535ea9f2020-05-29 16:01:05 +020042#include "tree_schema_internal.h"
43#include "xml.h"
Michal Vasko03ff5a72019-09-11 13:49:33 +020044
aPiecekbf968d92021-05-27 14:35:05 +020045static LY_ERR reparse_or_expr(const struct ly_ctx *ctx, struct lyxp_expr *exp, uint16_t *tok_idx, uint16_t depth);
Michal Vasko40308e72020-10-20 16:38:40 +020046static LY_ERR eval_expr_select(const struct lyxp_expr *exp, uint16_t *tok_idx, enum lyxp_expr_type etype,
47 struct lyxp_set *set, uint32_t options);
Michal Vasko93923692021-05-07 15:28:02 +020048static LY_ERR moveto_resolve_model(const char **qname, uint16_t *qname_len, const struct lyxp_set *set,
49 const struct lysc_node *ctx_scnode, const struct lys_module **moveto_mod);
Michal Vasko03ff5a72019-09-11 13:49:33 +020050
aPiecek96dc1e32021-10-08 15:45:59 +020051/* Functions are divided into the following basic classes:
52 *
53 * (re)parse functions:
54 * Parse functions parse the expression into
55 * tokens (syntactic analysis).
56 * Reparse functions perform semantic analysis
57 * (do not save the result, just a check) of
58 * the expression and fill repeat indices.
59 *
60 * warn functions:
61 * Warn functions check specific reasonable conditions for schema XPath
62 * and print a warning if they are not satisfied.
63 *
64 * moveto functions:
65 * They and only they actually change the context (set).
66 *
67 * eval functions:
68 * They execute a parsed XPath expression on some data subtree.
69 */
70
Michal Vasko03ff5a72019-09-11 13:49:33 +020071/**
72 * @brief Print the type of an XPath \p set.
73 *
74 * @param[in] set Set to use.
75 * @return Set type string.
76 */
77static const char *
78print_set_type(struct lyxp_set *set)
79{
80 switch (set->type) {
Michal Vasko03ff5a72019-09-11 13:49:33 +020081 case LYXP_SET_NODE_SET:
82 return "node set";
83 case LYXP_SET_SCNODE_SET:
84 return "schema node set";
85 case LYXP_SET_BOOLEAN:
86 return "boolean";
87 case LYXP_SET_NUMBER:
88 return "number";
89 case LYXP_SET_STRING:
90 return "string";
91 }
92
93 return NULL;
94}
95
Michal Vasko24cddf82020-06-01 08:17:01 +020096const char *
97lyxp_print_token(enum lyxp_token tok)
Michal Vasko03ff5a72019-09-11 13:49:33 +020098{
99 switch (tok) {
100 case LYXP_TOKEN_PAR1:
101 return "(";
102 case LYXP_TOKEN_PAR2:
103 return ")";
104 case LYXP_TOKEN_BRACK1:
105 return "[";
106 case LYXP_TOKEN_BRACK2:
107 return "]";
108 case LYXP_TOKEN_DOT:
109 return ".";
110 case LYXP_TOKEN_DDOT:
111 return "..";
112 case LYXP_TOKEN_AT:
113 return "@";
114 case LYXP_TOKEN_COMMA:
115 return ",";
116 case LYXP_TOKEN_NAMETEST:
117 return "NameTest";
118 case LYXP_TOKEN_NODETYPE:
119 return "NodeType";
aPiecekfba75362021-10-07 12:39:48 +0200120 case LYXP_TOKEN_VARREF:
121 return "VariableReference";
Michal Vasko03ff5a72019-09-11 13:49:33 +0200122 case LYXP_TOKEN_FUNCNAME:
123 return "FunctionName";
Michal Vasko3e48bf32020-06-01 08:39:07 +0200124 case LYXP_TOKEN_OPER_LOG:
Michal Vasko03ff5a72019-09-11 13:49:33 +0200125 return "Operator(Logic)";
Michal Vasko3e48bf32020-06-01 08:39:07 +0200126 case LYXP_TOKEN_OPER_EQUAL:
127 return "Operator(Equal)";
128 case LYXP_TOKEN_OPER_NEQUAL:
129 return "Operator(Non-equal)";
130 case LYXP_TOKEN_OPER_COMP:
Michal Vasko03ff5a72019-09-11 13:49:33 +0200131 return "Operator(Comparison)";
Michal Vasko3e48bf32020-06-01 08:39:07 +0200132 case LYXP_TOKEN_OPER_MATH:
Michal Vasko03ff5a72019-09-11 13:49:33 +0200133 return "Operator(Math)";
Michal Vasko3e48bf32020-06-01 08:39:07 +0200134 case LYXP_TOKEN_OPER_UNI:
Michal Vasko03ff5a72019-09-11 13:49:33 +0200135 return "Operator(Union)";
Michal Vasko3e48bf32020-06-01 08:39:07 +0200136 case LYXP_TOKEN_OPER_PATH:
Michal Vasko03ff5a72019-09-11 13:49:33 +0200137 return "Operator(Path)";
Michal Vasko3e48bf32020-06-01 08:39:07 +0200138 case LYXP_TOKEN_OPER_RPATH:
Michal Vasko14676352020-05-29 11:35:55 +0200139 return "Operator(Recursive Path)";
Michal Vasko03ff5a72019-09-11 13:49:33 +0200140 case LYXP_TOKEN_LITERAL:
141 return "Literal";
142 case LYXP_TOKEN_NUMBER:
143 return "Number";
144 default:
145 LOGINT(NULL);
146 return "";
147 }
148}
149
150/**
151 * @brief Print the whole expression \p exp to debug output.
152 *
153 * @param[in] exp Expression to use.
154 */
155static void
Michal Vasko40308e72020-10-20 16:38:40 +0200156print_expr_struct_debug(const struct lyxp_expr *exp)
Michal Vasko03ff5a72019-09-11 13:49:33 +0200157{
Radek Krejcif13b87b2020-12-01 22:02:17 +0100158#define MSG_BUFFER_SIZE 128
159 char tmp[MSG_BUFFER_SIZE];
Michal Vasko1fdd8fa2021-01-08 09:21:45 +0100160 uint32_t i, j;
Michal Vasko03ff5a72019-09-11 13:49:33 +0200161
Radek Krejci52b6d512020-10-12 12:33:17 +0200162 if (!exp || (ly_ll < LY_LLDBG)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +0200163 return;
164 }
165
166 LOGDBG(LY_LDGXPATH, "expression \"%s\":", exp->expr);
167 for (i = 0; i < exp->used; ++i) {
Michal Vasko24cddf82020-06-01 08:17:01 +0200168 sprintf(tmp, "\ttoken %s, in expression \"%.*s\"", lyxp_print_token(exp->tokens[i]), exp->tok_len[i],
Michal Vasko69730152020-10-09 16:30:07 +0200169 &exp->expr[exp->tok_pos[i]]);
Michal Vasko23049552021-03-04 15:57:44 +0100170 if (exp->repeat && exp->repeat[i]) {
Michal Vasko03ff5a72019-09-11 13:49:33 +0200171 sprintf(tmp + strlen(tmp), " (repeat %d", exp->repeat[i][0]);
172 for (j = 1; exp->repeat[i][j]; ++j) {
173 sprintf(tmp + strlen(tmp), ", %d", exp->repeat[i][j]);
174 }
175 strcat(tmp, ")");
176 }
177 LOGDBG(LY_LDGXPATH, tmp);
178 }
Radek Krejcif13b87b2020-12-01 22:02:17 +0100179#undef MSG_BUFFER_SIZE
Michal Vasko03ff5a72019-09-11 13:49:33 +0200180}
181
182#ifndef NDEBUG
183
184/**
185 * @brief Print XPath set content to debug output.
186 *
187 * @param[in] set Set to print.
188 */
189static void
190print_set_debug(struct lyxp_set *set)
191{
192 uint32_t i;
193 char *str;
Michal Vasko03ff5a72019-09-11 13:49:33 +0200194 struct lyxp_set_node *item;
195 struct lyxp_set_scnode *sitem;
196
Radek Krejci52b6d512020-10-12 12:33:17 +0200197 if (ly_ll < LY_LLDBG) {
Michal Vasko03ff5a72019-09-11 13:49:33 +0200198 return;
199 }
200
201 switch (set->type) {
202 case LYXP_SET_NODE_SET:
203 LOGDBG(LY_LDGXPATH, "set NODE SET:");
204 for (i = 0; i < set->used; ++i) {
205 item = &set->val.nodes[i];
206
207 switch (item->type) {
Michal Vasko2caefc12019-11-14 16:07:56 +0100208 case LYXP_NODE_NONE:
209 LOGDBG(LY_LDGXPATH, "\t%d (pos %u): NONE", i + 1, item->pos);
210 break;
Michal Vasko03ff5a72019-09-11 13:49:33 +0200211 case LYXP_NODE_ROOT:
212 LOGDBG(LY_LDGXPATH, "\t%d (pos %u): ROOT", i + 1, item->pos);
213 break;
214 case LYXP_NODE_ROOT_CONFIG:
215 LOGDBG(LY_LDGXPATH, "\t%d (pos %u): ROOT CONFIG", i + 1, item->pos);
216 break;
217 case LYXP_NODE_ELEM:
Michal Vasko9e685082021-01-29 14:49:09 +0100218 if ((item->node->schema->nodetype == LYS_LIST) && (lyd_child(item->node)->schema->nodetype == LYS_LEAF)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +0200219 LOGDBG(LY_LDGXPATH, "\t%d (pos %u): ELEM %s (1st child val: %s)", i + 1, item->pos,
Radek Krejci6d5ba0c2021-04-26 07:49:59 +0200220 item->node->schema->name, lyd_get_value(lyd_child(item->node)));
Michal Vasko9e685082021-01-29 14:49:09 +0100221 } else if (item->node->schema->nodetype == LYS_LEAFLIST) {
Michal Vasko03ff5a72019-09-11 13:49:33 +0200222 LOGDBG(LY_LDGXPATH, "\t%d (pos %u): ELEM %s (val: %s)", i + 1, item->pos,
Radek Krejci6d5ba0c2021-04-26 07:49:59 +0200223 item->node->schema->name, lyd_get_value(item->node));
Michal Vasko03ff5a72019-09-11 13:49:33 +0200224 } else {
225 LOGDBG(LY_LDGXPATH, "\t%d (pos %u): ELEM %s", i + 1, item->pos, item->node->schema->name);
226 }
227 break;
228 case LYXP_NODE_TEXT:
229 if (item->node->schema->nodetype & LYS_ANYDATA) {
230 LOGDBG(LY_LDGXPATH, "\t%d (pos %u): TEXT <%s>", i + 1, item->pos,
Michal Vasko69730152020-10-09 16:30:07 +0200231 item->node->schema->nodetype == LYS_ANYXML ? "anyxml" : "anydata");
Michal Vasko03ff5a72019-09-11 13:49:33 +0200232 } else {
Radek Krejci6d5ba0c2021-04-26 07:49:59 +0200233 LOGDBG(LY_LDGXPATH, "\t%d (pos %u): TEXT %s", i + 1, item->pos, lyd_get_value(item->node));
Michal Vasko03ff5a72019-09-11 13:49:33 +0200234 }
235 break;
Michal Vasko9f96a052020-03-10 09:41:45 +0100236 case LYXP_NODE_META:
237 LOGDBG(LY_LDGXPATH, "\t%d (pos %u): META %s = %s", i + 1, item->pos, set->val.meta[i].meta->name,
Michal Vasko69730152020-10-09 16:30:07 +0200238 set->val.meta[i].meta->value);
Michal Vasko03ff5a72019-09-11 13:49:33 +0200239 break;
240 }
241 }
242 break;
243
244 case LYXP_SET_SCNODE_SET:
245 LOGDBG(LY_LDGXPATH, "set SCNODE SET:");
246 for (i = 0; i < set->used; ++i) {
247 sitem = &set->val.scnodes[i];
248
249 switch (sitem->type) {
250 case LYXP_NODE_ROOT:
251 LOGDBG(LY_LDGXPATH, "\t%d (%u): ROOT", i + 1, sitem->in_ctx);
252 break;
253 case LYXP_NODE_ROOT_CONFIG:
254 LOGDBG(LY_LDGXPATH, "\t%d (%u): ROOT CONFIG", i + 1, sitem->in_ctx);
255 break;
256 case LYXP_NODE_ELEM:
257 LOGDBG(LY_LDGXPATH, "\t%d (%u): ELEM %s", i + 1, sitem->in_ctx, sitem->scnode->name);
258 break;
259 default:
260 LOGINT(NULL);
261 break;
262 }
263 }
264 break;
265
Michal Vasko03ff5a72019-09-11 13:49:33 +0200266 case LYXP_SET_BOOLEAN:
267 LOGDBG(LY_LDGXPATH, "set BOOLEAN");
Michal Vasko004d3152020-06-11 19:59:22 +0200268 LOGDBG(LY_LDGXPATH, "\t%s", (set->val.bln ? "true" : "false"));
Michal Vasko03ff5a72019-09-11 13:49:33 +0200269 break;
270
271 case LYXP_SET_STRING:
272 LOGDBG(LY_LDGXPATH, "set STRING");
273 LOGDBG(LY_LDGXPATH, "\t%s", set->val.str);
274 break;
275
276 case LYXP_SET_NUMBER:
277 LOGDBG(LY_LDGXPATH, "set NUMBER");
278
279 if (isnan(set->val.num)) {
280 str = strdup("NaN");
281 } else if ((set->val.num == 0) || (set->val.num == -0.0f)) {
282 str = strdup("0");
283 } else if (isinf(set->val.num) && !signbit(set->val.num)) {
284 str = strdup("Infinity");
285 } else if (isinf(set->val.num) && signbit(set->val.num)) {
286 str = strdup("-Infinity");
287 } else if ((long long)set->val.num == set->val.num) {
288 if (asprintf(&str, "%lld", (long long)set->val.num) == -1) {
289 str = NULL;
290 }
291 } else {
292 if (asprintf(&str, "%03.1Lf", set->val.num) == -1) {
293 str = NULL;
294 }
295 }
296 LY_CHECK_ERR_RET(!str, LOGMEM(NULL), );
297
298 LOGDBG(LY_LDGXPATH, "\t%s", str);
299 free(str);
300 }
301}
302
303#endif
304
305/**
306 * @brief Realloc the string \p str.
307 *
308 * @param[in] ctx libyang context for logging.
309 * @param[in] needed How much free space is required.
310 * @param[in,out] str Pointer to the string to use.
311 * @param[in,out] used Used bytes in \p str.
312 * @param[in,out] size Allocated bytes in \p str.
313 * @return LY_ERR
314 */
315static LY_ERR
Michal Vasko52927e22020-03-16 17:26:14 +0100316cast_string_realloc(const struct ly_ctx *ctx, uint16_t needed, char **str, uint16_t *used, uint16_t *size)
Michal Vasko03ff5a72019-09-11 13:49:33 +0200317{
318 if (*size - *used < needed) {
319 do {
320 if ((UINT16_MAX - *size) < LYXP_STRING_CAST_SIZE_STEP) {
321 LOGERR(ctx, LY_EINVAL, "XPath string length limit (%u) reached.", UINT16_MAX);
322 return LY_EINVAL;
323 }
324 *size += LYXP_STRING_CAST_SIZE_STEP;
325 } while (*size - *used < needed);
326 *str = ly_realloc(*str, *size * sizeof(char));
327 LY_CHECK_ERR_RET(!(*str), LOGMEM(ctx), LY_EMEM);
328 }
329
330 return LY_SUCCESS;
331}
332
333/**
334 * @brief Cast nodes recursively to one string @p str.
335 *
336 * @param[in] node Node to cast.
337 * @param[in] fake_cont Whether to put the data into a "fake" container.
338 * @param[in] root_type Type of the XPath root.
339 * @param[in] indent Current indent.
340 * @param[in,out] str Resulting string.
341 * @param[in,out] used Used bytes in @p str.
342 * @param[in,out] size Allocated bytes in @p str.
343 * @return LY_ERR
344 */
345static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +0200346cast_string_recursive(const struct lyd_node *node, ly_bool fake_cont, enum lyxp_node_type root_type, uint16_t indent, char **str,
Radek Krejci0f969882020-08-21 16:56:47 +0200347 uint16_t *used, uint16_t *size)
Michal Vasko03ff5a72019-09-11 13:49:33 +0200348{
Radek Krejci7f769d72020-07-11 23:13:56 +0200349 char *buf, *line, *ptr = NULL;
Michal Vasko03ff5a72019-09-11 13:49:33 +0200350 const char *value_str;
Michal Vasko03ff5a72019-09-11 13:49:33 +0200351 const struct lyd_node *child;
Michal Vasko60ea6352020-06-29 13:39:39 +0200352 struct lyd_node *tree;
Michal Vasko03ff5a72019-09-11 13:49:33 +0200353 struct lyd_node_any *any;
354 LY_ERR rc;
355
356 if ((root_type == LYXP_NODE_ROOT_CONFIG) && (node->schema->flags & LYS_CONFIG_R)) {
357 return LY_SUCCESS;
358 }
359
360 if (fake_cont) {
Michal Vaskob7be7a82020-08-20 09:09:04 +0200361 rc = cast_string_realloc(LYD_CTX(node), 1, str, used, size);
Michal Vasko03ff5a72019-09-11 13:49:33 +0200362 LY_CHECK_RET(rc);
363 strcpy(*str + (*used - 1), "\n");
364 ++(*used);
365
366 ++indent;
367 }
368
369 switch (node->schema->nodetype) {
370 case LYS_CONTAINER:
371 case LYS_LIST:
372 case LYS_RPC:
373 case LYS_NOTIF:
Michal Vaskob7be7a82020-08-20 09:09:04 +0200374 rc = cast_string_realloc(LYD_CTX(node), 1, str, used, size);
Michal Vasko03ff5a72019-09-11 13:49:33 +0200375 LY_CHECK_RET(rc);
376 strcpy(*str + (*used - 1), "\n");
377 ++(*used);
378
Radek Krejcia1c1e542020-09-29 16:06:52 +0200379 for (child = lyd_child(node); child; child = child->next) {
Michal Vasko03ff5a72019-09-11 13:49:33 +0200380 rc = cast_string_recursive(child, 0, root_type, indent + 1, str, used, size);
381 LY_CHECK_RET(rc);
382 }
383
384 break;
385
386 case LYS_LEAF:
387 case LYS_LEAFLIST:
Radek Krejci6d5ba0c2021-04-26 07:49:59 +0200388 value_str = lyd_get_value(node);
Michal Vasko03ff5a72019-09-11 13:49:33 +0200389
390 /* print indent */
Michal Vaskob7be7a82020-08-20 09:09:04 +0200391 LY_CHECK_RET(cast_string_realloc(LYD_CTX(node), indent * 2 + strlen(value_str) + 1, str, used, size));
Michal Vasko03ff5a72019-09-11 13:49:33 +0200392 memset(*str + (*used - 1), ' ', indent * 2);
393 *used += indent * 2;
394
395 /* print value */
396 if (*used == 1) {
397 sprintf(*str + (*used - 1), "%s", value_str);
398 *used += strlen(value_str);
399 } else {
400 sprintf(*str + (*used - 1), "%s\n", value_str);
401 *used += strlen(value_str) + 1;
402 }
Michal Vasko03ff5a72019-09-11 13:49:33 +0200403
404 break;
405
406 case LYS_ANYXML:
407 case LYS_ANYDATA:
408 any = (struct lyd_node_any *)node;
409 if (!(void *)any->value.tree) {
410 /* no content */
411 buf = strdup("");
Michal Vaskob7be7a82020-08-20 09:09:04 +0200412 LY_CHECK_ERR_RET(!buf, LOGMEM(LYD_CTX(node)), LY_EMEM);
Michal Vasko03ff5a72019-09-11 13:49:33 +0200413 } else {
Radek Krejci241f6b52020-05-21 18:13:49 +0200414 struct ly_out *out;
Radek Krejcia5bba312020-01-09 15:41:20 +0100415
Michal Vasko60ea6352020-06-29 13:39:39 +0200416 if (any->value_type == LYD_ANYDATA_LYB) {
417 /* try to parse it into a data tree */
Michal Vaskob7be7a82020-08-20 09:09:04 +0200418 if (lyd_parse_data_mem((struct ly_ctx *)LYD_CTX(node), any->value.mem, LYD_LYB, LYD_PARSE_ONLY | LYD_PARSE_STRICT, 0, &tree) == LY_SUCCESS) {
Michal Vasko60ea6352020-06-29 13:39:39 +0200419 /* successfully parsed */
420 free(any->value.mem);
421 any->value.tree = tree;
422 any->value_type = LYD_ANYDATA_DATATREE;
423 }
Radek Krejci7931b192020-06-25 17:05:03 +0200424 /* error is covered by the following switch where LYD_ANYDATA_LYB causes failure */
Michal Vasko60ea6352020-06-29 13:39:39 +0200425 }
426
Michal Vasko03ff5a72019-09-11 13:49:33 +0200427 switch (any->value_type) {
428 case LYD_ANYDATA_STRING:
429 case LYD_ANYDATA_XML:
430 case LYD_ANYDATA_JSON:
431 buf = strdup(any->value.json);
Michal Vaskob7be7a82020-08-20 09:09:04 +0200432 LY_CHECK_ERR_RET(!buf, LOGMEM(LYD_CTX(node)), LY_EMEM);
Michal Vasko03ff5a72019-09-11 13:49:33 +0200433 break;
434 case LYD_ANYDATA_DATATREE:
Radek Krejci84ce7b12020-06-11 17:28:25 +0200435 LY_CHECK_RET(ly_out_new_memory(&buf, 0, &out));
Michal Vasko3a41dff2020-07-15 14:30:28 +0200436 rc = lyd_print_all(out, any->value.tree, LYD_XML, 0);
Radek Krejci241f6b52020-05-21 18:13:49 +0200437 ly_out_free(out, NULL, 0);
Radek Krejcia5bba312020-01-09 15:41:20 +0100438 LY_CHECK_RET(rc < 0, -rc);
Michal Vasko03ff5a72019-09-11 13:49:33 +0200439 break;
Michal Vasko60ea6352020-06-29 13:39:39 +0200440 case LYD_ANYDATA_LYB:
Michal Vaskob7be7a82020-08-20 09:09:04 +0200441 LOGERR(LYD_CTX(node), LY_EINVAL, "Cannot convert LYB anydata into string.");
Michal Vasko60ea6352020-06-29 13:39:39 +0200442 return LY_EINVAL;
Michal Vasko03ff5a72019-09-11 13:49:33 +0200443 }
444 }
445
446 line = strtok_r(buf, "\n", &ptr);
447 do {
Michal Vaskob7be7a82020-08-20 09:09:04 +0200448 rc = cast_string_realloc(LYD_CTX(node), indent * 2 + strlen(line) + 1, str, used, size);
Michal Vasko03ff5a72019-09-11 13:49:33 +0200449 if (rc != LY_SUCCESS) {
450 free(buf);
451 return rc;
452 }
453 memset(*str + (*used - 1), ' ', indent * 2);
454 *used += indent * 2;
455
456 strcpy(*str + (*used - 1), line);
457 *used += strlen(line);
458
459 strcpy(*str + (*used - 1), "\n");
460 *used += 1;
461 } while ((line = strtok_r(NULL, "\n", &ptr)));
462
463 free(buf);
464 break;
465
466 default:
Michal Vaskob7be7a82020-08-20 09:09:04 +0200467 LOGINT_RET(LYD_CTX(node));
Michal Vasko03ff5a72019-09-11 13:49:33 +0200468 }
469
470 if (fake_cont) {
Michal Vaskob7be7a82020-08-20 09:09:04 +0200471 rc = cast_string_realloc(LYD_CTX(node), 1, str, used, size);
Michal Vasko03ff5a72019-09-11 13:49:33 +0200472 LY_CHECK_RET(rc);
473 strcpy(*str + (*used - 1), "\n");
474 ++(*used);
475
476 --indent;
477 }
478
479 return LY_SUCCESS;
480}
481
482/**
483 * @brief Cast an element into a string.
484 *
485 * @param[in] node Node to cast.
486 * @param[in] fake_cont Whether to put the data into a "fake" container.
487 * @param[in] root_type Type of the XPath root.
488 * @param[out] str Element cast to dynamically-allocated string.
489 * @return LY_ERR
490 */
491static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +0200492cast_string_elem(struct lyd_node *node, ly_bool fake_cont, enum lyxp_node_type root_type, char **str)
Michal Vasko03ff5a72019-09-11 13:49:33 +0200493{
494 uint16_t used, size;
495 LY_ERR rc;
496
497 *str = malloc(LYXP_STRING_CAST_SIZE_START * sizeof(char));
Michal Vaskob7be7a82020-08-20 09:09:04 +0200498 LY_CHECK_ERR_RET(!*str, LOGMEM(LYD_CTX(node)), LY_EMEM);
Michal Vasko03ff5a72019-09-11 13:49:33 +0200499 (*str)[0] = '\0';
500 used = 1;
501 size = LYXP_STRING_CAST_SIZE_START;
502
503 rc = cast_string_recursive(node, fake_cont, root_type, 0, str, &used, &size);
504 if (rc != LY_SUCCESS) {
505 free(*str);
506 return rc;
507 }
508
509 if (size > used) {
510 *str = ly_realloc(*str, used * sizeof(char));
Michal Vaskob7be7a82020-08-20 09:09:04 +0200511 LY_CHECK_ERR_RET(!*str, LOGMEM(LYD_CTX(node)), LY_EMEM);
Michal Vasko03ff5a72019-09-11 13:49:33 +0200512 }
513 return LY_SUCCESS;
514}
515
516/**
517 * @brief Cast a LYXP_SET_NODE_SET set into a string.
518 * Context position aware.
519 *
520 * @param[in] set Set to cast.
Michal Vasko03ff5a72019-09-11 13:49:33 +0200521 * @param[out] str Cast dynamically-allocated string.
522 * @return LY_ERR
523 */
524static LY_ERR
Michal Vasko5e0e6eb2019-11-06 15:47:50 +0100525cast_node_set_to_string(struct lyxp_set *set, char **str)
Michal Vasko03ff5a72019-09-11 13:49:33 +0200526{
Michal Vaskoaa677062021-03-09 13:52:53 +0100527 if (!set->used) {
528 *str = strdup("");
529 if (!*str) {
530 LOGMEM_RET(set->ctx);
531 }
532 return LY_SUCCESS;
533 }
534
Michal Vasko03ff5a72019-09-11 13:49:33 +0200535 switch (set->val.nodes[0].type) {
Michal Vasko2caefc12019-11-14 16:07:56 +0100536 case LYXP_NODE_NONE:
537 /* invalid */
538 LOGINT_RET(set->ctx);
Michal Vasko03ff5a72019-09-11 13:49:33 +0200539 case LYXP_NODE_ROOT:
540 case LYXP_NODE_ROOT_CONFIG:
Michal Vasko5e0e6eb2019-11-06 15:47:50 +0100541 return cast_string_elem(set->val.nodes[0].node, 1, set->root_type, str);
Michal Vasko03ff5a72019-09-11 13:49:33 +0200542 case LYXP_NODE_ELEM:
543 case LYXP_NODE_TEXT:
Michal Vasko5e0e6eb2019-11-06 15:47:50 +0100544 return cast_string_elem(set->val.nodes[0].node, 0, set->root_type, str);
Michal Vasko9f96a052020-03-10 09:41:45 +0100545 case LYXP_NODE_META:
Radek Krejci6d5ba0c2021-04-26 07:49:59 +0200546 *str = strdup(lyd_get_meta_value(set->val.meta[0].meta));
Michal Vaskoba99a3e2020-08-18 15:50:05 +0200547 if (!*str) {
548 LOGMEM_RET(set->ctx);
Michal Vasko03ff5a72019-09-11 13:49:33 +0200549 }
550 return LY_SUCCESS;
551 }
552
553 LOGINT_RET(set->ctx);
554}
555
556/**
557 * @brief Cast a string into an XPath number.
558 *
559 * @param[in] str String to use.
560 * @return Cast number.
561 */
562static long double
563cast_string_to_number(const char *str)
564{
565 long double num;
566 char *ptr;
567
568 errno = 0;
569 num = strtold(str, &ptr);
570 if (errno || *ptr) {
571 num = NAN;
572 }
573 return num;
574}
575
576/**
577 * @brief Callback for checking value equality.
578 *
Michal Vasko62524a92021-02-26 10:08:50 +0100579 * Implementation of ::lyht_value_equal_cb.
Radek Krejci857189e2020-09-01 13:26:36 +0200580 *
Michal Vasko03ff5a72019-09-11 13:49:33 +0200581 * @param[in] val1_p First value.
582 * @param[in] val2_p Second value.
583 * @param[in] mod Whether hash table is being modified.
584 * @param[in] cb_data Callback data.
Radek Krejci857189e2020-09-01 13:26:36 +0200585 * @return Boolean value whether values are equal or not.
Michal Vasko03ff5a72019-09-11 13:49:33 +0200586 */
Radek Krejci857189e2020-09-01 13:26:36 +0200587static ly_bool
588set_values_equal_cb(void *val1_p, void *val2_p, ly_bool UNUSED(mod), void *UNUSED(cb_data))
Michal Vasko03ff5a72019-09-11 13:49:33 +0200589{
590 struct lyxp_set_hash_node *val1, *val2;
591
592 val1 = (struct lyxp_set_hash_node *)val1_p;
593 val2 = (struct lyxp_set_hash_node *)val2_p;
594
595 if ((val1->node == val2->node) && (val1->type == val2->type)) {
596 return 1;
597 }
598
599 return 0;
600}
601
602/**
603 * @brief Insert node and its hash into set.
604 *
605 * @param[in] set et to insert to.
606 * @param[in] node Node with hash.
607 * @param[in] type Node type.
608 */
609static void
610set_insert_node_hash(struct lyxp_set *set, struct lyd_node *node, enum lyxp_node_type type)
611{
Radek Krejci1deb5be2020-08-26 16:43:36 +0200612 LY_ERR r;
Michal Vasko03ff5a72019-09-11 13:49:33 +0200613 uint32_t i, hash;
614 struct lyxp_set_hash_node hnode;
615
616 if (!set->ht && (set->used >= LYD_HT_MIN_ITEMS)) {
617 /* create hash table and add all the nodes */
618 set->ht = lyht_new(1, sizeof(struct lyxp_set_hash_node), set_values_equal_cb, NULL, 1);
619 for (i = 0; i < set->used; ++i) {
620 hnode.node = set->val.nodes[i].node;
621 hnode.type = set->val.nodes[i].type;
622
623 hash = dict_hash_multi(0, (const char *)&hnode.node, sizeof hnode.node);
624 hash = dict_hash_multi(hash, (const char *)&hnode.type, sizeof hnode.type);
625 hash = dict_hash_multi(hash, NULL, 0);
626
627 r = lyht_insert(set->ht, &hnode, hash, NULL);
628 assert(!r);
629 (void)r;
Michal Vasko03ff5a72019-09-11 13:49:33 +0200630
Michal Vasko9d6befd2019-12-11 14:56:56 +0100631 if (hnode.node == node) {
632 /* it was just added, do not add it twice */
633 node = NULL;
634 }
635 }
636 }
637
638 if (set->ht && node) {
Michal Vasko03ff5a72019-09-11 13:49:33 +0200639 /* add the new node into hash table */
640 hnode.node = node;
641 hnode.type = type;
642
643 hash = dict_hash_multi(0, (const char *)&hnode.node, sizeof hnode.node);
644 hash = dict_hash_multi(hash, (const char *)&hnode.type, sizeof hnode.type);
645 hash = dict_hash_multi(hash, NULL, 0);
646
647 r = lyht_insert(set->ht, &hnode, hash, NULL);
648 assert(!r);
649 (void)r;
650 }
651}
652
653/**
654 * @brief Remove node and its hash from set.
655 *
656 * @param[in] set Set to remove from.
657 * @param[in] node Node to remove.
658 * @param[in] type Node type.
659 */
660static void
661set_remove_node_hash(struct lyxp_set *set, struct lyd_node *node, enum lyxp_node_type type)
662{
Radek Krejci1deb5be2020-08-26 16:43:36 +0200663 LY_ERR r;
Michal Vasko03ff5a72019-09-11 13:49:33 +0200664 struct lyxp_set_hash_node hnode;
665 uint32_t hash;
666
667 if (set->ht) {
668 hnode.node = node;
669 hnode.type = type;
670
671 hash = dict_hash_multi(0, (const char *)&hnode.node, sizeof hnode.node);
672 hash = dict_hash_multi(hash, (const char *)&hnode.type, sizeof hnode.type);
673 hash = dict_hash_multi(hash, NULL, 0);
674
675 r = lyht_remove(set->ht, &hnode, hash);
676 assert(!r);
677 (void)r;
678
679 if (!set->ht->used) {
680 lyht_free(set->ht);
681 set->ht = NULL;
682 }
683 }
684}
685
686/**
687 * @brief Check whether node is in set based on its hash.
688 *
689 * @param[in] set Set to search in.
690 * @param[in] node Node to search for.
691 * @param[in] type Node type.
692 * @param[in] skip_idx Index in @p set to skip.
693 * @return LY_ERR
694 */
695static LY_ERR
696set_dup_node_hash_check(const struct lyxp_set *set, struct lyd_node *node, enum lyxp_node_type type, int skip_idx)
697{
698 struct lyxp_set_hash_node hnode, *match_p;
699 uint32_t hash;
700
701 hnode.node = node;
702 hnode.type = type;
703
704 hash = dict_hash_multi(0, (const char *)&hnode.node, sizeof hnode.node);
705 hash = dict_hash_multi(hash, (const char *)&hnode.type, sizeof hnode.type);
706 hash = dict_hash_multi(hash, NULL, 0);
707
708 if (!lyht_find(set->ht, &hnode, hash, (void **)&match_p)) {
709 if ((skip_idx > -1) && (set->val.nodes[skip_idx].node == match_p->node) && (set->val.nodes[skip_idx].type == match_p->type)) {
710 /* we found it on the index that should be skipped, find another */
711 hnode = *match_p;
712 if (lyht_find_next(set->ht, &hnode, hash, (void **)&match_p)) {
713 /* none other found */
714 return LY_SUCCESS;
715 }
716 }
717
718 return LY_EEXIST;
719 }
720
721 /* not found */
722 return LY_SUCCESS;
723}
724
Michal Vaskod3678892020-05-21 10:06:58 +0200725void
726lyxp_set_free_content(struct lyxp_set *set)
Michal Vasko03ff5a72019-09-11 13:49:33 +0200727{
728 if (!set) {
729 return;
730 }
731
732 if (set->type == LYXP_SET_NODE_SET) {
733 free(set->val.nodes);
734 lyht_free(set->ht);
Michal Vasko03ff5a72019-09-11 13:49:33 +0200735 } else if (set->type == LYXP_SET_SCNODE_SET) {
736 free(set->val.scnodes);
Michal Vaskod3678892020-05-21 10:06:58 +0200737 lyht_free(set->ht);
738 } else {
739 if (set->type == LYXP_SET_STRING) {
740 free(set->val.str);
741 }
742 set->type = LYXP_SET_NODE_SET;
Michal Vasko03ff5a72019-09-11 13:49:33 +0200743 }
Michal Vaskod3678892020-05-21 10:06:58 +0200744
745 set->val.nodes = NULL;
746 set->used = 0;
747 set->size = 0;
748 set->ht = NULL;
749 set->ctx_pos = 0;
aPiecek748da732021-06-01 09:56:43 +0200750 set->ctx_size = 0;
Michal Vasko03ff5a72019-09-11 13:49:33 +0200751}
752
Michal Vasko5e0e6eb2019-11-06 15:47:50 +0100753/**
754 * @brief Free dynamically-allocated set.
755 *
756 * @param[in] set Set to free.
757 */
758static void
Michal Vasko03ff5a72019-09-11 13:49:33 +0200759lyxp_set_free(struct lyxp_set *set)
760{
761 if (!set) {
762 return;
763 }
764
Michal Vaskod3678892020-05-21 10:06:58 +0200765 lyxp_set_free_content(set);
Michal Vasko03ff5a72019-09-11 13:49:33 +0200766 free(set);
767}
768
769/**
770 * @brief Initialize set context.
771 *
772 * @param[in] new Set to initialize.
773 * @param[in] set Arbitrary initialized set.
774 */
775static void
Michal Vasko4c7763f2020-07-27 17:40:37 +0200776set_init(struct lyxp_set *new, const struct lyxp_set *set)
Michal Vasko03ff5a72019-09-11 13:49:33 +0200777{
778 memset(new, 0, sizeof *new);
Michal Vasko02a77382019-09-12 11:47:35 +0200779 if (set) {
780 new->ctx = set->ctx;
Michal Vasko5d24f6c2020-10-13 13:49:06 +0200781 new->cur_node = set->cur_node;
Michal Vasko588112f2019-12-10 14:51:53 +0100782 new->root_type = set->root_type;
Michal Vasko6b26e742020-07-17 15:02:10 +0200783 new->context_op = set->context_op;
Michal Vaskof03ed032020-03-04 13:31:44 +0100784 new->tree = set->tree;
Michal Vasko5d24f6c2020-10-13 13:49:06 +0200785 new->cur_mod = set->cur_mod;
Michal Vasko02a77382019-09-12 11:47:35 +0200786 new->format = set->format;
Michal Vasko5d24f6c2020-10-13 13:49:06 +0200787 new->prefix_data = set->prefix_data;
aPiecekfba75362021-10-07 12:39:48 +0200788 new->vars = set->vars;
Michal Vasko02a77382019-09-12 11:47:35 +0200789 }
Michal Vasko03ff5a72019-09-11 13:49:33 +0200790}
791
792/**
793 * @brief Create a deep copy of a set.
794 *
795 * @param[in] set Set to copy.
796 * @return Copy of @p set.
797 */
798static struct lyxp_set *
799set_copy(struct lyxp_set *set)
800{
801 struct lyxp_set *ret;
Michal Vasko1fdd8fa2021-01-08 09:21:45 +0100802 uint32_t i;
Michal Vasko03ff5a72019-09-11 13:49:33 +0200803
804 if (!set) {
805 return NULL;
806 }
807
808 ret = malloc(sizeof *ret);
809 LY_CHECK_ERR_RET(!ret, LOGMEM(set->ctx), NULL);
810 set_init(ret, set);
811
812 if (set->type == LYXP_SET_SCNODE_SET) {
813 ret->type = set->type;
814
815 for (i = 0; i < set->used; ++i) {
Radek Krejcif13b87b2020-12-01 22:02:17 +0100816 if ((set->val.scnodes[i].in_ctx == LYXP_SET_SCNODE_ATOM_CTX) ||
817 (set->val.scnodes[i].in_ctx == LYXP_SET_SCNODE_START)) {
Radek Krejciaa6b53f2020-08-27 15:19:03 +0200818 uint32_t idx;
819 LY_CHECK_ERR_RET(lyxp_set_scnode_insert_node(ret, set->val.scnodes[i].scnode, set->val.scnodes[i].type, &idx),
820 lyxp_set_free(ret), NULL);
Michal Vasko3f27c522020-01-06 08:37:49 +0100821 /* coverity seems to think scnodes can be NULL */
Radek Krejciaa6b53f2020-08-27 15:19:03 +0200822 if (!ret->val.scnodes) {
Michal Vasko03ff5a72019-09-11 13:49:33 +0200823 lyxp_set_free(ret);
824 return NULL;
825 }
Michal Vaskoba716542019-12-16 10:01:58 +0100826 ret->val.scnodes[idx].in_ctx = set->val.scnodes[i].in_ctx;
Michal Vasko03ff5a72019-09-11 13:49:33 +0200827 }
828 }
829 } else if (set->type == LYXP_SET_NODE_SET) {
830 ret->type = set->type;
Michal Vasko08e9b112021-06-11 15:41:17 +0200831 if (set->used) {
832 ret->val.nodes = malloc(set->used * sizeof *ret->val.nodes);
833 LY_CHECK_ERR_RET(!ret->val.nodes, LOGMEM(set->ctx); free(ret), NULL);
834 memcpy(ret->val.nodes, set->val.nodes, set->used * sizeof *ret->val.nodes);
835 } else {
836 ret->val.nodes = NULL;
837 }
Michal Vasko03ff5a72019-09-11 13:49:33 +0200838
839 ret->used = ret->size = set->used;
840 ret->ctx_pos = set->ctx_pos;
841 ret->ctx_size = set->ctx_size;
Michal Vasko4a04e542021-02-01 08:58:30 +0100842 if (set->ht) {
843 ret->ht = lyht_dup(set->ht);
844 }
Michal Vasko03ff5a72019-09-11 13:49:33 +0200845 } else {
Radek Krejci0f969882020-08-21 16:56:47 +0200846 memcpy(ret, set, sizeof *ret);
847 if (set->type == LYXP_SET_STRING) {
848 ret->val.str = strdup(set->val.str);
849 LY_CHECK_ERR_RET(!ret->val.str, LOGMEM(set->ctx); free(ret), NULL);
850 }
Michal Vasko03ff5a72019-09-11 13:49:33 +0200851 }
852
853 return ret;
854}
855
856/**
857 * @brief Fill XPath set with a string. Any current data are disposed of.
858 *
859 * @param[in] set Set to fill.
860 * @param[in] string String to fill into \p set.
861 * @param[in] str_len Length of \p string. 0 is a valid value!
862 */
863static void
864set_fill_string(struct lyxp_set *set, const char *string, uint16_t str_len)
865{
Michal Vaskod3678892020-05-21 10:06:58 +0200866 lyxp_set_free_content(set);
Michal Vasko03ff5a72019-09-11 13:49:33 +0200867
868 set->type = LYXP_SET_STRING;
869 if ((str_len == 0) && (string[0] != '\0')) {
870 string = "";
871 }
872 set->val.str = strndup(string, str_len);
873}
874
875/**
876 * @brief Fill XPath set with a number. Any current data are disposed of.
877 *
878 * @param[in] set Set to fill.
879 * @param[in] number Number to fill into \p set.
880 */
881static void
882set_fill_number(struct lyxp_set *set, long double number)
883{
Michal Vaskod3678892020-05-21 10:06:58 +0200884 lyxp_set_free_content(set);
Michal Vasko03ff5a72019-09-11 13:49:33 +0200885
886 set->type = LYXP_SET_NUMBER;
887 set->val.num = number;
888}
889
890/**
891 * @brief Fill XPath set with a boolean. Any current data are disposed of.
892 *
893 * @param[in] set Set to fill.
894 * @param[in] boolean Boolean to fill into \p set.
895 */
896static void
Radek Krejci857189e2020-09-01 13:26:36 +0200897set_fill_boolean(struct lyxp_set *set, ly_bool boolean)
Michal Vasko03ff5a72019-09-11 13:49:33 +0200898{
Michal Vaskod3678892020-05-21 10:06:58 +0200899 lyxp_set_free_content(set);
Michal Vasko03ff5a72019-09-11 13:49:33 +0200900
901 set->type = LYXP_SET_BOOLEAN;
Michal Vasko004d3152020-06-11 19:59:22 +0200902 set->val.bln = boolean;
Michal Vasko03ff5a72019-09-11 13:49:33 +0200903}
904
905/**
906 * @brief Fill XPath set with the value from another set (deep assign).
907 * Any current data are disposed of.
908 *
909 * @param[in] trg Set to fill.
910 * @param[in] src Source set to copy into \p trg.
911 */
912static void
Michal Vasko4c7763f2020-07-27 17:40:37 +0200913set_fill_set(struct lyxp_set *trg, const struct lyxp_set *src)
Michal Vasko03ff5a72019-09-11 13:49:33 +0200914{
915 if (!trg || !src) {
916 return;
917 }
918
919 if (trg->type == LYXP_SET_NODE_SET) {
920 free(trg->val.nodes);
921 } else if (trg->type == LYXP_SET_STRING) {
922 free(trg->val.str);
923 }
924 set_init(trg, src);
925
926 if (src->type == LYXP_SET_SCNODE_SET) {
927 trg->type = LYXP_SET_SCNODE_SET;
928 trg->used = src->used;
929 trg->size = src->used;
930
Michal Vasko08e9b112021-06-11 15:41:17 +0200931 if (trg->size) {
932 trg->val.scnodes = ly_realloc(trg->val.scnodes, trg->size * sizeof *trg->val.scnodes);
933 LY_CHECK_ERR_RET(!trg->val.scnodes, LOGMEM(src->ctx); memset(trg, 0, sizeof *trg), );
934 memcpy(trg->val.scnodes, src->val.scnodes, src->used * sizeof *src->val.scnodes);
935 } else {
936 trg->val.scnodes = NULL;
937 }
Michal Vasko03ff5a72019-09-11 13:49:33 +0200938 } else if (src->type == LYXP_SET_BOOLEAN) {
Michal Vasko004d3152020-06-11 19:59:22 +0200939 set_fill_boolean(trg, src->val.bln);
Michal Vasko44f3d2c2020-08-24 09:49:38 +0200940 } else if (src->type == LYXP_SET_NUMBER) {
Michal Vasko03ff5a72019-09-11 13:49:33 +0200941 set_fill_number(trg, src->val.num);
942 } else if (src->type == LYXP_SET_STRING) {
943 set_fill_string(trg, src->val.str, strlen(src->val.str));
944 } else {
945 if (trg->type == LYXP_SET_NODE_SET) {
946 free(trg->val.nodes);
947 } else if (trg->type == LYXP_SET_STRING) {
948 free(trg->val.str);
949 }
950
Michal Vaskod3678892020-05-21 10:06:58 +0200951 assert(src->type == LYXP_SET_NODE_SET);
952
953 trg->type = LYXP_SET_NODE_SET;
954 trg->used = src->used;
955 trg->size = src->used;
956 trg->ctx_pos = src->ctx_pos;
957 trg->ctx_size = src->ctx_size;
958
Michal Vasko08e9b112021-06-11 15:41:17 +0200959 if (trg->size) {
960 trg->val.nodes = malloc(trg->size * sizeof *trg->val.nodes);
961 LY_CHECK_ERR_RET(!trg->val.nodes, LOGMEM(src->ctx); memset(trg, 0, sizeof *trg), );
962 memcpy(trg->val.nodes, src->val.nodes, src->used * sizeof *src->val.nodes);
963 } else {
964 trg->val.nodes = NULL;
965 }
Michal Vaskod3678892020-05-21 10:06:58 +0200966 if (src->ht) {
967 trg->ht = lyht_dup(src->ht);
Michal Vasko03ff5a72019-09-11 13:49:33 +0200968 } else {
Michal Vaskod3678892020-05-21 10:06:58 +0200969 trg->ht = NULL;
Michal Vasko03ff5a72019-09-11 13:49:33 +0200970 }
971 }
972}
973
974/**
975 * @brief Clear context of all schema nodes.
976 *
977 * @param[in] set Set to clear.
Michal Vasko1a09b212021-05-06 13:00:10 +0200978 * @param[in] new_ctx New context state for all the nodes currently in the context.
Michal Vasko03ff5a72019-09-11 13:49:33 +0200979 */
980static void
Michal Vasko1a09b212021-05-06 13:00:10 +0200981set_scnode_clear_ctx(struct lyxp_set *set, int32_t new_ctx)
Michal Vasko03ff5a72019-09-11 13:49:33 +0200982{
983 uint32_t i;
984
985 for (i = 0; i < set->used; ++i) {
Radek Krejcif13b87b2020-12-01 22:02:17 +0100986 if (set->val.scnodes[i].in_ctx == LYXP_SET_SCNODE_ATOM_CTX) {
Michal Vasko1a09b212021-05-06 13:00:10 +0200987 set->val.scnodes[i].in_ctx = new_ctx;
Radek Krejcif13b87b2020-12-01 22:02:17 +0100988 } else if (set->val.scnodes[i].in_ctx == LYXP_SET_SCNODE_START) {
989 set->val.scnodes[i].in_ctx = LYXP_SET_SCNODE_START_USED;
Michal Vasko03ff5a72019-09-11 13:49:33 +0200990 }
991 }
992}
993
994/**
995 * @brief Remove a node from a set. Removing last node changes
996 * set into LYXP_SET_EMPTY. Context position aware.
997 *
998 * @param[in] set Set to use.
999 * @param[in] idx Index from @p set of the node to be removed.
1000 */
1001static void
1002set_remove_node(struct lyxp_set *set, uint32_t idx)
1003{
1004 assert(set && (set->type == LYXP_SET_NODE_SET));
1005 assert(idx < set->used);
1006
1007 set_remove_node_hash(set, set->val.nodes[idx].node, set->val.nodes[idx].type);
1008
1009 --set->used;
Michal Vasko08e9b112021-06-11 15:41:17 +02001010 if (idx < set->used) {
1011 memmove(&set->val.nodes[idx], &set->val.nodes[idx + 1], (set->used - idx) * sizeof *set->val.nodes);
1012 } else if (!set->used) {
Michal Vaskod3678892020-05-21 10:06:58 +02001013 lyxp_set_free_content(set);
Michal Vasko03ff5a72019-09-11 13:49:33 +02001014 }
1015}
1016
1017/**
Michal Vasko2caefc12019-11-14 16:07:56 +01001018 * @brief Remove a node from a set by setting its type to LYXP_NODE_NONE.
Michal Vasko57eab132019-09-24 11:46:26 +02001019 *
1020 * @param[in] set Set to use.
1021 * @param[in] idx Index from @p set of the node to be removed.
1022 */
1023static void
Michal Vasko2caefc12019-11-14 16:07:56 +01001024set_remove_node_none(struct lyxp_set *set, uint32_t idx)
Michal Vasko57eab132019-09-24 11:46:26 +02001025{
1026 assert(set && (set->type == LYXP_SET_NODE_SET));
1027 assert(idx < set->used);
1028
Michal Vasko2caefc12019-11-14 16:07:56 +01001029 if (set->val.nodes[idx].type == LYXP_NODE_ELEM) {
1030 set_remove_node_hash(set, set->val.nodes[idx].node, set->val.nodes[idx].type);
1031 }
1032 set->val.nodes[idx].type = LYXP_NODE_NONE;
Michal Vasko57eab132019-09-24 11:46:26 +02001033}
1034
1035/**
Michal Vasko2caefc12019-11-14 16:07:56 +01001036 * @brief Remove all LYXP_NODE_NONE nodes from a set. Removing last node changes
Michal Vasko57eab132019-09-24 11:46:26 +02001037 * set into LYXP_SET_EMPTY. Context position aware.
1038 *
1039 * @param[in] set Set to consolidate.
1040 */
1041static void
Michal Vasko2caefc12019-11-14 16:07:56 +01001042set_remove_nodes_none(struct lyxp_set *set)
Michal Vasko57eab132019-09-24 11:46:26 +02001043{
Michal Vasko1fdd8fa2021-01-08 09:21:45 +01001044 uint32_t i, orig_used, end = 0;
1045 int64_t start;
Michal Vasko57eab132019-09-24 11:46:26 +02001046
Michal Vaskod3678892020-05-21 10:06:58 +02001047 assert(set);
Michal Vasko57eab132019-09-24 11:46:26 +02001048
1049 orig_used = set->used;
1050 set->used = 0;
Michal Vaskod989ba02020-08-24 10:59:24 +02001051 for (i = 0; i < orig_used; ) {
Michal Vasko57eab132019-09-24 11:46:26 +02001052 start = -1;
1053 do {
Michal Vasko2caefc12019-11-14 16:07:56 +01001054 if ((set->val.nodes[i].type != LYXP_NODE_NONE) && (start == -1)) {
Michal Vasko57eab132019-09-24 11:46:26 +02001055 start = i;
Michal Vasko2caefc12019-11-14 16:07:56 +01001056 } else if ((start > -1) && (set->val.nodes[i].type == LYXP_NODE_NONE)) {
Michal Vasko57eab132019-09-24 11:46:26 +02001057 end = i;
1058 ++i;
1059 break;
1060 }
1061
1062 ++i;
1063 if (i == orig_used) {
1064 end = i;
1065 }
1066 } while (i < orig_used);
1067
1068 if (start > -1) {
1069 /* move the whole chunk of valid nodes together */
1070 if (set->used != (unsigned)start) {
1071 memmove(&set->val.nodes[set->used], &set->val.nodes[start], (end - start) * sizeof *set->val.nodes);
1072 }
1073 set->used += end - start;
1074 }
1075 }
Michal Vasko57eab132019-09-24 11:46:26 +02001076}
1077
1078/**
Michal Vasko03ff5a72019-09-11 13:49:33 +02001079 * @brief Check for duplicates in a node set.
1080 *
1081 * @param[in] set Set to check.
1082 * @param[in] node Node to look for in @p set.
1083 * @param[in] node_type Type of @p node.
1084 * @param[in] skip_idx Index from @p set to skip.
1085 * @return LY_ERR
1086 */
1087static LY_ERR
1088set_dup_node_check(const struct lyxp_set *set, const struct lyd_node *node, enum lyxp_node_type node_type, int skip_idx)
1089{
1090 uint32_t i;
1091
Michal Vasko2caefc12019-11-14 16:07:56 +01001092 if (set->ht && node) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02001093 return set_dup_node_hash_check(set, (struct lyd_node *)node, node_type, skip_idx);
1094 }
1095
1096 for (i = 0; i < set->used; ++i) {
1097 if ((skip_idx > -1) && (i == (unsigned)skip_idx)) {
1098 continue;
1099 }
1100
1101 if ((set->val.nodes[i].node == node) && (set->val.nodes[i].type == node_type)) {
1102 return LY_EEXIST;
1103 }
1104 }
1105
1106 return LY_SUCCESS;
1107}
1108
Radek Krejci857189e2020-09-01 13:26:36 +02001109ly_bool
Radek Krejciaa6b53f2020-08-27 15:19:03 +02001110lyxp_set_scnode_contains(struct lyxp_set *set, const struct lysc_node *node, enum lyxp_node_type node_type, int skip_idx,
1111 uint32_t *index_p)
Michal Vasko03ff5a72019-09-11 13:49:33 +02001112{
1113 uint32_t i;
1114
1115 for (i = 0; i < set->used; ++i) {
1116 if ((skip_idx > -1) && (i == (unsigned)skip_idx)) {
1117 continue;
1118 }
1119
1120 if ((set->val.scnodes[i].scnode == node) && (set->val.scnodes[i].type == node_type)) {
Radek Krejciaa6b53f2020-08-27 15:19:03 +02001121 if (index_p) {
1122 *index_p = i;
1123 }
1124 return 1;
Michal Vasko03ff5a72019-09-11 13:49:33 +02001125 }
1126 }
1127
Radek Krejciaa6b53f2020-08-27 15:19:03 +02001128 return 0;
Michal Vasko03ff5a72019-09-11 13:49:33 +02001129}
1130
Michal Vaskoecd62de2019-11-13 12:35:11 +01001131void
1132lyxp_set_scnode_merge(struct lyxp_set *set1, struct lyxp_set *set2)
Michal Vasko03ff5a72019-09-11 13:49:33 +02001133{
1134 uint32_t orig_used, i, j;
1135
Michal Vaskod3678892020-05-21 10:06:58 +02001136 assert((set1->type == LYXP_SET_SCNODE_SET) && (set2->type == LYXP_SET_SCNODE_SET));
Michal Vasko03ff5a72019-09-11 13:49:33 +02001137
Michal Vaskod3678892020-05-21 10:06:58 +02001138 if (!set2->used) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02001139 return;
1140 }
1141
Michal Vaskod3678892020-05-21 10:06:58 +02001142 if (!set1->used) {
aPiecekadc1e4f2021-10-07 11:15:12 +02001143 /* release hidden allocated data (lyxp_set.size) */
1144 lyxp_set_free_content(set1);
1145 /* direct copying of the entire structure */
Michal Vasko03ff5a72019-09-11 13:49:33 +02001146 memcpy(set1, set2, sizeof *set1);
1147 return;
1148 }
1149
1150 if (set1->used + set2->used > set1->size) {
1151 set1->size = set1->used + set2->used;
1152 set1->val.scnodes = ly_realloc(set1->val.scnodes, set1->size * sizeof *set1->val.scnodes);
1153 LY_CHECK_ERR_RET(!set1->val.scnodes, LOGMEM(set1->ctx), );
1154 }
1155
1156 orig_used = set1->used;
1157
1158 for (i = 0; i < set2->used; ++i) {
1159 for (j = 0; j < orig_used; ++j) {
1160 /* detect duplicities */
1161 if (set1->val.scnodes[j].scnode == set2->val.scnodes[i].scnode) {
1162 break;
1163 }
1164 }
1165
Michal Vasko0587bce2020-12-10 12:19:21 +01001166 if (j < orig_used) {
1167 /* node is there, but update its status if needed */
1168 if (set1->val.scnodes[j].in_ctx == LYXP_SET_SCNODE_START_USED) {
1169 set1->val.scnodes[j].in_ctx = set2->val.scnodes[i].in_ctx;
Michal Vasko1a09b212021-05-06 13:00:10 +02001170 } else if ((set1->val.scnodes[j].in_ctx == LYXP_SET_SCNODE_ATOM_NODE) &&
1171 (set2->val.scnodes[i].in_ctx == LYXP_SET_SCNODE_ATOM_VAL)) {
1172 set1->val.scnodes[j].in_ctx = set2->val.scnodes[i].in_ctx;
Michal Vasko0587bce2020-12-10 12:19:21 +01001173 }
1174 } else {
Michal Vasko03ff5a72019-09-11 13:49:33 +02001175 memcpy(&set1->val.scnodes[set1->used], &set2->val.scnodes[i], sizeof *set2->val.scnodes);
1176 ++set1->used;
1177 }
1178 }
1179
Michal Vaskod3678892020-05-21 10:06:58 +02001180 lyxp_set_free_content(set2);
1181 set2->type = LYXP_SET_SCNODE_SET;
Michal Vasko03ff5a72019-09-11 13:49:33 +02001182}
1183
1184/**
1185 * @brief Insert a node into a set. Context position aware.
1186 *
1187 * @param[in] set Set to use.
1188 * @param[in] node Node to insert to @p set.
1189 * @param[in] pos Sort position of @p node. If left 0, it is filled just before sorting.
1190 * @param[in] node_type Node type of @p node.
1191 * @param[in] idx Index in @p set to insert into.
1192 */
1193static void
1194set_insert_node(struct lyxp_set *set, const struct lyd_node *node, uint32_t pos, enum lyxp_node_type node_type, uint32_t idx)
1195{
Michal Vaskod3678892020-05-21 10:06:58 +02001196 assert(set && (set->type == LYXP_SET_NODE_SET));
Michal Vasko03ff5a72019-09-11 13:49:33 +02001197
Michal Vaskod3678892020-05-21 10:06:58 +02001198 if (!set->size) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02001199 /* first item */
1200 if (idx) {
1201 /* no real harm done, but it is a bug */
1202 LOGINT(set->ctx);
1203 idx = 0;
1204 }
1205 set->val.nodes = malloc(LYXP_SET_SIZE_START * sizeof *set->val.nodes);
1206 LY_CHECK_ERR_RET(!set->val.nodes, LOGMEM(set->ctx), );
1207 set->type = LYXP_SET_NODE_SET;
1208 set->used = 0;
1209 set->size = LYXP_SET_SIZE_START;
1210 set->ctx_pos = 1;
1211 set->ctx_size = 1;
1212 set->ht = NULL;
1213 } else {
1214 /* not an empty set */
1215 if (set->used == set->size) {
1216
1217 /* set is full */
1218 set->val.nodes = ly_realloc(set->val.nodes, (set->size + LYXP_SET_SIZE_STEP) * sizeof *set->val.nodes);
1219 LY_CHECK_ERR_RET(!set->val.nodes, LOGMEM(set->ctx), );
1220 set->size += LYXP_SET_SIZE_STEP;
1221 }
1222
1223 if (idx > set->used) {
1224 LOGINT(set->ctx);
1225 idx = set->used;
1226 }
1227
1228 /* make space for the new node */
1229 if (idx < set->used) {
1230 memmove(&set->val.nodes[idx + 1], &set->val.nodes[idx], (set->used - idx) * sizeof *set->val.nodes);
1231 }
1232 }
1233
1234 /* finally assign the value */
1235 set->val.nodes[idx].node = (struct lyd_node *)node;
1236 set->val.nodes[idx].type = node_type;
1237 set->val.nodes[idx].pos = pos;
1238 ++set->used;
1239
Michal Vasko2416fdd2021-10-01 11:07:10 +02001240 /* add into hash table */
1241 set_insert_node_hash(set, (struct lyd_node *)node, node_type);
Michal Vasko03ff5a72019-09-11 13:49:33 +02001242}
1243
Radek Krejciaa6b53f2020-08-27 15:19:03 +02001244LY_ERR
1245lyxp_set_scnode_insert_node(struct lyxp_set *set, const struct lysc_node *node, enum lyxp_node_type node_type, uint32_t *index_p)
Michal Vasko03ff5a72019-09-11 13:49:33 +02001246{
Radek Krejciaa6b53f2020-08-27 15:19:03 +02001247 uint32_t index;
Michal Vasko03ff5a72019-09-11 13:49:33 +02001248
1249 assert(set->type == LYXP_SET_SCNODE_SET);
1250
Radek Krejciaa6b53f2020-08-27 15:19:03 +02001251 if (lyxp_set_scnode_contains(set, node, node_type, -1, &index)) {
Radek Krejcif13b87b2020-12-01 22:02:17 +01001252 set->val.scnodes[index].in_ctx = LYXP_SET_SCNODE_ATOM_CTX;
Michal Vasko03ff5a72019-09-11 13:49:33 +02001253 } else {
1254 if (set->used == set->size) {
1255 set->val.scnodes = ly_realloc(set->val.scnodes, (set->size + LYXP_SET_SIZE_STEP) * sizeof *set->val.scnodes);
Radek Krejciaa6b53f2020-08-27 15:19:03 +02001256 LY_CHECK_ERR_RET(!set->val.scnodes, LOGMEM(set->ctx), LY_EMEM);
Michal Vasko03ff5a72019-09-11 13:49:33 +02001257 set->size += LYXP_SET_SIZE_STEP;
1258 }
1259
Radek Krejciaa6b53f2020-08-27 15:19:03 +02001260 index = set->used;
1261 set->val.scnodes[index].scnode = (struct lysc_node *)node;
1262 set->val.scnodes[index].type = node_type;
Radek Krejcif13b87b2020-12-01 22:02:17 +01001263 set->val.scnodes[index].in_ctx = LYXP_SET_SCNODE_ATOM_CTX;
Michal Vasko03ff5a72019-09-11 13:49:33 +02001264 ++set->used;
1265 }
1266
Radek Krejciaa6b53f2020-08-27 15:19:03 +02001267 if (index_p) {
1268 *index_p = index;
1269 }
1270
1271 return LY_SUCCESS;
Michal Vasko03ff5a72019-09-11 13:49:33 +02001272}
1273
1274/**
Michal Vasko03ff5a72019-09-11 13:49:33 +02001275 * @brief Set all nodes with ctx 1 to a new unique context value.
1276 *
1277 * @param[in] set Set to modify.
1278 * @return New context value.
1279 */
Michal Vasko5c4e5892019-11-14 12:31:38 +01001280static int32_t
Michal Vasko03ff5a72019-09-11 13:49:33 +02001281set_scnode_new_in_ctx(struct lyxp_set *set)
1282{
Michal Vasko5c4e5892019-11-14 12:31:38 +01001283 uint32_t i;
1284 int32_t ret_ctx;
Michal Vasko03ff5a72019-09-11 13:49:33 +02001285
1286 assert(set->type == LYXP_SET_SCNODE_SET);
1287
Radek Krejcif13b87b2020-12-01 22:02:17 +01001288 ret_ctx = LYXP_SET_SCNODE_ATOM_PRED_CTX;
Michal Vasko03ff5a72019-09-11 13:49:33 +02001289retry:
1290 for (i = 0; i < set->used; ++i) {
1291 if (set->val.scnodes[i].in_ctx >= ret_ctx) {
1292 ret_ctx = set->val.scnodes[i].in_ctx + 1;
1293 goto retry;
1294 }
1295 }
1296 for (i = 0; i < set->used; ++i) {
Radek Krejcif13b87b2020-12-01 22:02:17 +01001297 if (set->val.scnodes[i].in_ctx == LYXP_SET_SCNODE_ATOM_CTX) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02001298 set->val.scnodes[i].in_ctx = ret_ctx;
1299 }
1300 }
1301
1302 return ret_ctx;
1303}
1304
1305/**
1306 * @brief Get unique @p node position in the data.
1307 *
1308 * @param[in] node Node to find.
1309 * @param[in] node_type Node type of @p node.
1310 * @param[in] root Root node.
1311 * @param[in] root_type Type of the XPath @p root node.
1312 * @param[in] prev Node that we think is before @p node in DFS from @p root. Can optionally
1313 * be used to increase efficiency and start the DFS from this node.
1314 * @param[in] prev_pos Node @p prev position. Optional, but must be set if @p prev is set.
1315 * @return Node position.
1316 */
1317static uint32_t
1318get_node_pos(const struct lyd_node *node, enum lyxp_node_type node_type, const struct lyd_node *root,
Radek Krejci0f969882020-08-21 16:56:47 +02001319 enum lyxp_node_type root_type, const struct lyd_node **prev, uint32_t *prev_pos)
Michal Vasko03ff5a72019-09-11 13:49:33 +02001320{
Michal Vasko56daf732020-08-10 10:57:18 +02001321 const struct lyd_node *elem = NULL, *top_sibling;
Michal Vasko03ff5a72019-09-11 13:49:33 +02001322 uint32_t pos = 1;
Michal Vaskofb6c9dd2020-11-18 18:18:47 +01001323 ly_bool found = 0;
Michal Vasko03ff5a72019-09-11 13:49:33 +02001324
1325 assert(prev && prev_pos && !root->prev->next);
1326
1327 if ((node_type == LYXP_NODE_ROOT) || (node_type == LYXP_NODE_ROOT_CONFIG)) {
1328 return 0;
1329 }
1330
1331 if (*prev) {
1332 /* start from the previous element instead from the root */
Michal Vasko03ff5a72019-09-11 13:49:33 +02001333 pos = *prev_pos;
Michal Vaskofb6c9dd2020-11-18 18:18:47 +01001334 for (top_sibling = *prev; top_sibling->parent; top_sibling = lyd_parent(top_sibling)) {}
Michal Vasko03ff5a72019-09-11 13:49:33 +02001335 goto dfs_search;
1336 }
1337
Michal Vaskofb6c9dd2020-11-18 18:18:47 +01001338 LY_LIST_FOR(root, top_sibling) {
Michal Vasko56daf732020-08-10 10:57:18 +02001339 LYD_TREE_DFS_BEGIN(top_sibling, elem) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02001340dfs_search:
Michal Vaskoa9309bb2021-07-09 09:31:55 +02001341 LYD_TREE_DFS_continue = 0;
1342
Michal Vasko56daf732020-08-10 10:57:18 +02001343 if (*prev && !elem) {
1344 /* resume previous DFS */
1345 elem = LYD_TREE_DFS_next = (struct lyd_node *)*prev;
1346 LYD_TREE_DFS_continue = 0;
1347 }
1348
Michal Vasko03ff5a72019-09-11 13:49:33 +02001349 if ((root_type == LYXP_NODE_ROOT_CONFIG) && (elem->schema->flags & LYS_CONFIG_R)) {
Michal Vasko56daf732020-08-10 10:57:18 +02001350 /* skip */
1351 LYD_TREE_DFS_continue = 1;
Michal Vasko03ff5a72019-09-11 13:49:33 +02001352 } else {
Michal Vasko56daf732020-08-10 10:57:18 +02001353 if (elem == node) {
Michal Vaskofb6c9dd2020-11-18 18:18:47 +01001354 found = 1;
Michal Vasko03ff5a72019-09-11 13:49:33 +02001355 break;
1356 }
Michal Vasko56daf732020-08-10 10:57:18 +02001357 ++pos;
Michal Vasko03ff5a72019-09-11 13:49:33 +02001358 }
Michal Vasko56daf732020-08-10 10:57:18 +02001359
1360 LYD_TREE_DFS_END(top_sibling, elem);
Michal Vasko03ff5a72019-09-11 13:49:33 +02001361 }
1362
1363 /* node found */
Michal Vaskofb6c9dd2020-11-18 18:18:47 +01001364 if (found) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02001365 break;
1366 }
1367 }
1368
Michal Vaskofb6c9dd2020-11-18 18:18:47 +01001369 if (!found) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02001370 if (!(*prev)) {
1371 /* we went from root and failed to find it, cannot be */
Michal Vaskob7be7a82020-08-20 09:09:04 +02001372 LOGINT(LYD_CTX(node));
Michal Vasko03ff5a72019-09-11 13:49:33 +02001373 return 0;
1374 } else {
Michal Vasko56daf732020-08-10 10:57:18 +02001375 /* start the search again from the beginning */
1376 *prev = root;
Michal Vasko03ff5a72019-09-11 13:49:33 +02001377
Michal Vasko56daf732020-08-10 10:57:18 +02001378 top_sibling = root;
Michal Vasko03ff5a72019-09-11 13:49:33 +02001379 pos = 1;
1380 goto dfs_search;
1381 }
1382 }
1383
1384 /* remember the last found node for next time */
1385 *prev = node;
1386 *prev_pos = pos;
1387
1388 return pos;
1389}
1390
1391/**
1392 * @brief Assign (fill) missing node positions.
1393 *
1394 * @param[in] set Set to fill positions in.
1395 * @param[in] root Context root node.
1396 * @param[in] root_type Context root type.
1397 * @return LY_ERR
1398 */
1399static LY_ERR
1400set_assign_pos(struct lyxp_set *set, const struct lyd_node *root, enum lyxp_node_type root_type)
1401{
1402 const struct lyd_node *prev = NULL, *tmp_node;
1403 uint32_t i, tmp_pos = 0;
1404
1405 for (i = 0; i < set->used; ++i) {
1406 if (!set->val.nodes[i].pos) {
1407 tmp_node = NULL;
1408 switch (set->val.nodes[i].type) {
Michal Vasko9f96a052020-03-10 09:41:45 +01001409 case LYXP_NODE_META:
1410 tmp_node = set->val.meta[i].meta->parent;
Michal Vasko03ff5a72019-09-11 13:49:33 +02001411 if (!tmp_node) {
1412 LOGINT_RET(root->schema->module->ctx);
1413 }
Radek Krejcif13b87b2020-12-01 22:02:17 +01001414 /* fall through */
Michal Vasko03ff5a72019-09-11 13:49:33 +02001415 case LYXP_NODE_ELEM:
1416 case LYXP_NODE_TEXT:
1417 if (!tmp_node) {
1418 tmp_node = set->val.nodes[i].node;
1419 }
1420 set->val.nodes[i].pos = get_node_pos(tmp_node, set->val.nodes[i].type, root, root_type, &prev, &tmp_pos);
1421 break;
1422 default:
1423 /* all roots have position 0 */
1424 break;
1425 }
1426 }
1427 }
1428
1429 return LY_SUCCESS;
1430}
1431
1432/**
Michal Vasko9f96a052020-03-10 09:41:45 +01001433 * @brief Get unique @p meta position in the parent metadata.
Michal Vasko03ff5a72019-09-11 13:49:33 +02001434 *
Michal Vasko9f96a052020-03-10 09:41:45 +01001435 * @param[in] meta Metadata to use.
1436 * @return Metadata position.
Michal Vasko03ff5a72019-09-11 13:49:33 +02001437 */
1438static uint16_t
Michal Vasko9f96a052020-03-10 09:41:45 +01001439get_meta_pos(struct lyd_meta *meta)
Michal Vasko03ff5a72019-09-11 13:49:33 +02001440{
1441 uint16_t pos = 0;
Michal Vasko9f96a052020-03-10 09:41:45 +01001442 struct lyd_meta *meta2;
Michal Vasko03ff5a72019-09-11 13:49:33 +02001443
Michal Vasko9f96a052020-03-10 09:41:45 +01001444 for (meta2 = meta->parent->meta; meta2 && (meta2 != meta); meta2 = meta2->next) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02001445 ++pos;
1446 }
1447
Michal Vasko9f96a052020-03-10 09:41:45 +01001448 assert(meta2);
Michal Vasko03ff5a72019-09-11 13:49:33 +02001449 return pos;
1450}
1451
1452/**
1453 * @brief Compare 2 nodes in respect to XPath document order.
1454 *
1455 * @param[in] item1 1st node.
1456 * @param[in] item2 2nd node.
1457 * @return If 1st > 2nd returns 1, 1st == 2nd returns 0, and 1st < 2nd returns -1.
1458 */
1459static int
1460set_sort_compare(struct lyxp_set_node *item1, struct lyxp_set_node *item2)
1461{
Michal Vasko9f96a052020-03-10 09:41:45 +01001462 uint32_t meta_pos1 = 0, meta_pos2 = 0;
Michal Vasko03ff5a72019-09-11 13:49:33 +02001463
1464 if (item1->pos < item2->pos) {
1465 return -1;
1466 }
1467
1468 if (item1->pos > item2->pos) {
1469 return 1;
1470 }
1471
1472 /* node positions are equal, the fun case */
1473
1474 /* 1st ELEM - == - 2nd TEXT, 1st TEXT - == - 2nd ELEM */
1475 /* special case since text nodes are actually saved as their parents */
1476 if ((item1->node == item2->node) && (item1->type != item2->type)) {
1477 if (item1->type == LYXP_NODE_ELEM) {
1478 assert(item2->type == LYXP_NODE_TEXT);
1479 return -1;
1480 } else {
1481 assert((item1->type == LYXP_NODE_TEXT) && (item2->type == LYXP_NODE_ELEM));
1482 return 1;
1483 }
1484 }
1485
Michal Vasko9f96a052020-03-10 09:41:45 +01001486 /* we need meta positions now */
1487 if (item1->type == LYXP_NODE_META) {
1488 meta_pos1 = get_meta_pos((struct lyd_meta *)item1->node);
Michal Vasko03ff5a72019-09-11 13:49:33 +02001489 }
Michal Vasko9f96a052020-03-10 09:41:45 +01001490 if (item2->type == LYXP_NODE_META) {
1491 meta_pos2 = get_meta_pos((struct lyd_meta *)item2->node);
Michal Vasko03ff5a72019-09-11 13:49:33 +02001492 }
1493
Michal Vasko9f96a052020-03-10 09:41:45 +01001494 /* 1st ROOT - 2nd ROOT, 1st ELEM - 2nd ELEM, 1st TEXT - 2nd TEXT, 1st META - =pos= - 2nd META */
Michal Vasko03ff5a72019-09-11 13:49:33 +02001495 /* check for duplicates */
1496 if (item1->node == item2->node) {
Michal Vasko9f96a052020-03-10 09:41:45 +01001497 assert((item1->type == item2->type) && ((item1->type != LYXP_NODE_META) || (meta_pos1 == meta_pos2)));
Michal Vasko03ff5a72019-09-11 13:49:33 +02001498 return 0;
1499 }
1500
Michal Vasko9f96a052020-03-10 09:41:45 +01001501 /* 1st ELEM - 2nd TEXT, 1st ELEM - any pos - 2nd META */
Michal Vasko03ff5a72019-09-11 13:49:33 +02001502 /* elem is always first, 2nd node is after it */
1503 if (item1->type == LYXP_NODE_ELEM) {
1504 assert(item2->type != LYXP_NODE_ELEM);
1505 return -1;
1506 }
1507
Michal Vasko9f96a052020-03-10 09:41:45 +01001508 /* 1st TEXT - 2nd ELEM, 1st TEXT - any pos - 2nd META, 1st META - any pos - 2nd ELEM, 1st META - >pos> - 2nd META */
Michal Vasko03ff5a72019-09-11 13:49:33 +02001509 /* 2nd is before 1st */
Michal Vasko69730152020-10-09 16:30:07 +02001510 if (((item1->type == LYXP_NODE_TEXT) &&
1511 ((item2->type == LYXP_NODE_ELEM) || (item2->type == LYXP_NODE_META))) ||
1512 ((item1->type == LYXP_NODE_META) && (item2->type == LYXP_NODE_ELEM)) ||
1513 (((item1->type == LYXP_NODE_META) && (item2->type == LYXP_NODE_META)) &&
1514 (meta_pos1 > meta_pos2))) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02001515 return 1;
1516 }
1517
Michal Vasko9f96a052020-03-10 09:41:45 +01001518 /* 1st META - any pos - 2nd TEXT, 1st META <pos< - 2nd META */
Michal Vasko03ff5a72019-09-11 13:49:33 +02001519 /* 2nd is after 1st */
1520 return -1;
1521}
1522
1523/**
1524 * @brief Set cast for comparisons.
1525 *
1526 * @param[in] trg Target set to cast source into.
1527 * @param[in] src Source set.
1528 * @param[in] type Target set type.
1529 * @param[in] src_idx Source set node index.
Michal Vasko03ff5a72019-09-11 13:49:33 +02001530 * @return LY_ERR
1531 */
1532static LY_ERR
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01001533set_comp_cast(struct lyxp_set *trg, struct lyxp_set *src, enum lyxp_set_type type, uint32_t src_idx)
Michal Vasko03ff5a72019-09-11 13:49:33 +02001534{
1535 assert(src->type == LYXP_SET_NODE_SET);
1536
1537 set_init(trg, src);
1538
1539 /* insert node into target set */
1540 set_insert_node(trg, src->val.nodes[src_idx].node, src->val.nodes[src_idx].pos, src->val.nodes[src_idx].type, 0);
1541
1542 /* cast target set appropriately */
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01001543 return lyxp_set_cast(trg, type);
Michal Vasko03ff5a72019-09-11 13:49:33 +02001544}
1545
Michal Vasko4c7763f2020-07-27 17:40:37 +02001546/**
1547 * @brief Set content canonization for comparisons.
1548 *
1549 * @param[in] trg Target set to put the canononized source into.
1550 * @param[in] src Source set.
1551 * @param[in] xp_node Source XPath node/meta to use for canonization.
1552 * @return LY_ERR
1553 */
1554static LY_ERR
1555set_comp_canonize(struct lyxp_set *trg, const struct lyxp_set *src, const struct lyxp_set_node *xp_node)
1556{
Michal Vaskofeca4fb2020-10-05 08:58:40 +02001557 const struct lysc_type *type = NULL;
Michal Vasko4c7763f2020-07-27 17:40:37 +02001558 struct lyd_value val;
1559 struct ly_err_item *err = NULL;
1560 char *str, *ptr;
Michal Vasko4c7763f2020-07-27 17:40:37 +02001561 LY_ERR rc;
1562
1563 /* is there anything to canonize even? */
1564 if ((src->type == LYXP_SET_NUMBER) || (src->type == LYXP_SET_STRING)) {
1565 /* do we have a type to use for canonization? */
1566 if ((xp_node->type == LYXP_NODE_ELEM) && (xp_node->node->schema->nodetype & LYD_NODE_TERM)) {
1567 type = ((struct lyd_node_term *)xp_node->node)->value.realtype;
1568 } else if (xp_node->type == LYXP_NODE_META) {
1569 type = ((struct lyd_meta *)xp_node->node)->value.realtype;
1570 }
1571 }
1572 if (!type) {
1573 goto fill;
1574 }
1575
1576 if (src->type == LYXP_SET_NUMBER) {
1577 /* canonize number */
1578 if (asprintf(&str, "%Lf", src->val.num) == -1) {
1579 LOGMEM(src->ctx);
1580 return LY_EMEM;
1581 }
1582 } else {
1583 /* canonize string */
1584 str = strdup(src->val.str);
1585 }
1586
1587 /* ignore errors, the value may not satisfy schema constraints */
Radek Krejci0b013302021-03-29 15:22:32 +02001588 rc = type->plugin->store(src->ctx, type, str, strlen(str), LYPLG_TYPE_STORE_DYNAMIC, src->format, src->prefix_data,
Michal Vasko405cc9e2020-12-01 12:01:27 +01001589 LYD_HINT_DATA, xp_node->node->schema, &val, NULL, &err);
Michal Vasko4c7763f2020-07-27 17:40:37 +02001590 ly_err_free(err);
1591 if (rc) {
1592 /* invalid value */
Radek IÅ¡a48460222021-03-02 15:18:32 +01001593 /* function store automaticaly dealloc value when fail */
Michal Vasko4c7763f2020-07-27 17:40:37 +02001594 goto fill;
1595 }
1596
Michal Vasko4c7763f2020-07-27 17:40:37 +02001597 /* use the canonized value */
1598 set_init(trg, src);
1599 trg->type = src->type;
1600 if (src->type == LYXP_SET_NUMBER) {
Radek Krejci6d5ba0c2021-04-26 07:49:59 +02001601 trg->val.num = strtold(type->plugin->print(src->ctx, &val, LY_VALUE_CANON, NULL, NULL, NULL), &ptr);
Michal Vasko4c7763f2020-07-27 17:40:37 +02001602 LY_CHECK_ERR_RET(ptr[0], LOGINT(src->ctx), LY_EINT);
1603 } else {
Radek Krejci6d5ba0c2021-04-26 07:49:59 +02001604 trg->val.str = strdup(type->plugin->print(src->ctx, &val, LY_VALUE_CANON, NULL, NULL, NULL));
Michal Vasko4c7763f2020-07-27 17:40:37 +02001605 }
1606 type->plugin->free(src->ctx, &val);
1607 return LY_SUCCESS;
1608
1609fill:
1610 /* no canonization needed/possible */
1611 set_fill_set(trg, src);
1612 return LY_SUCCESS;
1613}
1614
Michal Vasko03ff5a72019-09-11 13:49:33 +02001615#ifndef NDEBUG
1616
1617/**
1618 * @brief Bubble sort @p set into XPath document order.
1619 * Context position aware. Unused in the 'Release' build target.
1620 *
1621 * @param[in] set Set to sort.
Michal Vasko03ff5a72019-09-11 13:49:33 +02001622 * @return How many times the whole set was traversed - 1 (if set was sorted, returns 0).
1623 */
1624static int
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01001625set_sort(struct lyxp_set *set)
Michal Vasko03ff5a72019-09-11 13:49:33 +02001626{
1627 uint32_t i, j;
Radek Krejci1deb5be2020-08-26 16:43:36 +02001628 int ret = 0, cmp;
Radek Krejci857189e2020-09-01 13:26:36 +02001629 ly_bool inverted, change;
Michal Vasko03ff5a72019-09-11 13:49:33 +02001630 const struct lyd_node *root;
Michal Vasko03ff5a72019-09-11 13:49:33 +02001631 struct lyxp_set_node item;
1632 struct lyxp_set_hash_node hnode;
1633 uint64_t hash;
1634
Michal Vasko3cf8fbf2020-05-27 15:21:21 +02001635 if ((set->type != LYXP_SET_NODE_SET) || (set->used < 2)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02001636 return 0;
1637 }
1638
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01001639 /* find first top-level node to be used as anchor for positions */
Michal Vasko9e685082021-01-29 14:49:09 +01001640 for (root = set->cur_node; root->parent; root = lyd_parent(root)) {}
Michal Vaskod989ba02020-08-24 10:59:24 +02001641 for ( ; root->prev->next; root = root->prev) {}
Michal Vasko03ff5a72019-09-11 13:49:33 +02001642
1643 /* fill positions */
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01001644 if (set_assign_pos(set, root, set->root_type)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02001645 return -1;
1646 }
1647
1648 LOGDBG(LY_LDGXPATH, "SORT BEGIN");
1649 print_set_debug(set);
1650
1651 for (i = 0; i < set->used; ++i) {
1652 inverted = 0;
1653 change = 0;
1654
1655 for (j = 1; j < set->used - i; ++j) {
1656 /* compare node positions */
1657 if (inverted) {
1658 cmp = set_sort_compare(&set->val.nodes[j], &set->val.nodes[j - 1]);
1659 } else {
1660 cmp = set_sort_compare(&set->val.nodes[j - 1], &set->val.nodes[j]);
1661 }
1662
1663 /* swap if needed */
1664 if ((inverted && (cmp < 0)) || (!inverted && (cmp > 0))) {
1665 change = 1;
1666
1667 item = set->val.nodes[j - 1];
1668 set->val.nodes[j - 1] = set->val.nodes[j];
1669 set->val.nodes[j] = item;
1670 } else {
1671 /* whether node_pos1 should be smaller than node_pos2 or the other way around */
1672 inverted = !inverted;
1673 }
1674 }
1675
1676 ++ret;
1677
1678 if (!change) {
1679 break;
1680 }
1681 }
1682
1683 LOGDBG(LY_LDGXPATH, "SORT END %d", ret);
1684 print_set_debug(set);
1685
1686 /* check node hashes */
1687 if (set->used >= LYD_HT_MIN_ITEMS) {
1688 assert(set->ht);
1689 for (i = 0; i < set->used; ++i) {
1690 hnode.node = set->val.nodes[i].node;
1691 hnode.type = set->val.nodes[i].type;
1692
1693 hash = dict_hash_multi(0, (const char *)&hnode.node, sizeof hnode.node);
1694 hash = dict_hash_multi(hash, (const char *)&hnode.type, sizeof hnode.type);
1695 hash = dict_hash_multi(hash, NULL, 0);
1696
1697 assert(!lyht_find(set->ht, &hnode, hash, NULL));
1698 }
1699 }
1700
1701 return ret - 1;
1702}
1703
Michal Vasko03ff5a72019-09-11 13:49:33 +02001704#endif
1705
1706/**
1707 * @brief Merge 2 sorted sets into one.
1708 *
1709 * @param[in,out] trg Set to merge into. Duplicates are removed.
1710 * @param[in] src Set to be merged into @p trg. It is cast to #LYXP_SET_EMPTY on success.
Michal Vasko03ff5a72019-09-11 13:49:33 +02001711 * @return LY_ERR
1712 */
1713static LY_ERR
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01001714set_sorted_merge(struct lyxp_set *trg, struct lyxp_set *src)
Michal Vasko03ff5a72019-09-11 13:49:33 +02001715{
1716 uint32_t i, j, k, count, dup_count;
1717 int cmp;
1718 const struct lyd_node *root;
Michal Vasko03ff5a72019-09-11 13:49:33 +02001719
Michal Vaskod3678892020-05-21 10:06:58 +02001720 if ((trg->type != LYXP_SET_NODE_SET) || (src->type != LYXP_SET_NODE_SET)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02001721 return LY_EINVAL;
1722 }
1723
Michal Vaskod3678892020-05-21 10:06:58 +02001724 if (!src->used) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02001725 return LY_SUCCESS;
Michal Vaskod3678892020-05-21 10:06:58 +02001726 } else if (!trg->used) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02001727 set_fill_set(trg, src);
Michal Vaskod3678892020-05-21 10:06:58 +02001728 lyxp_set_free_content(src);
Michal Vasko03ff5a72019-09-11 13:49:33 +02001729 return LY_SUCCESS;
1730 }
1731
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01001732 /* find first top-level node to be used as anchor for positions */
Michal Vasko9e685082021-01-29 14:49:09 +01001733 for (root = trg->cur_node; root->parent; root = lyd_parent(root)) {}
Michal Vaskod989ba02020-08-24 10:59:24 +02001734 for ( ; root->prev->next; root = root->prev) {}
Michal Vasko03ff5a72019-09-11 13:49:33 +02001735
1736 /* fill positions */
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01001737 if (set_assign_pos(trg, root, trg->root_type) || set_assign_pos(src, root, src->root_type)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02001738 return LY_EINT;
1739 }
1740
1741#ifndef NDEBUG
1742 LOGDBG(LY_LDGXPATH, "MERGE target");
1743 print_set_debug(trg);
1744 LOGDBG(LY_LDGXPATH, "MERGE source");
1745 print_set_debug(src);
1746#endif
1747
1748 /* make memory for the merge (duplicates are not detected yet, so space
1749 * will likely be wasted on them, too bad) */
1750 if (trg->size - trg->used < src->used) {
1751 trg->size = trg->used + src->used;
1752
1753 trg->val.nodes = ly_realloc(trg->val.nodes, trg->size * sizeof *trg->val.nodes);
1754 LY_CHECK_ERR_RET(!trg->val.nodes, LOGMEM(src->ctx), LY_EMEM);
1755 }
1756
1757 i = 0;
1758 j = 0;
1759 count = 0;
1760 dup_count = 0;
1761 do {
1762 cmp = set_sort_compare(&src->val.nodes[i], &trg->val.nodes[j]);
1763 if (!cmp) {
1764 if (!count) {
1765 /* duplicate, just skip it */
1766 ++i;
1767 ++j;
1768 } else {
1769 /* we are copying something already, so let's copy the duplicate too,
1770 * we are hoping that afterwards there are some more nodes to
1771 * copy and this way we can copy them all together */
1772 ++count;
1773 ++dup_count;
1774 ++i;
1775 ++j;
1776 }
1777 } else if (cmp < 0) {
1778 /* inserting src node into trg, just remember it for now */
1779 ++count;
1780 ++i;
1781
1782 /* insert the hash now */
1783 set_insert_node_hash(trg, src->val.nodes[i - 1].node, src->val.nodes[i - 1].type);
1784 } else if (count) {
1785copy_nodes:
1786 /* time to actually copy the nodes, we have found the largest block of nodes */
1787 memmove(&trg->val.nodes[j + (count - dup_count)],
1788 &trg->val.nodes[j],
1789 (trg->used - j) * sizeof *trg->val.nodes);
1790 memcpy(&trg->val.nodes[j - dup_count], &src->val.nodes[i - count], count * sizeof *src->val.nodes);
1791
1792 trg->used += count - dup_count;
1793 /* do not change i, except the copying above, we are basically doing exactly what is in the else branch below */
1794 j += count - dup_count;
1795
1796 count = 0;
1797 dup_count = 0;
1798 } else {
1799 ++j;
1800 }
1801 } while ((i < src->used) && (j < trg->used));
1802
1803 if ((i < src->used) || count) {
1804 /* insert all the hashes first */
1805 for (k = i; k < src->used; ++k) {
1806 set_insert_node_hash(trg, src->val.nodes[k].node, src->val.nodes[k].type);
1807 }
1808
1809 /* loop ended, but we need to copy something at trg end */
1810 count += src->used - i;
1811 i = src->used;
1812 goto copy_nodes;
1813 }
1814
1815 /* we are inserting hashes before the actual node insert, which causes
1816 * situations when there were initially not enough items for a hash table,
1817 * but even after some were inserted, hash table was not created (during
1818 * insertion the number of items is not updated yet) */
1819 if (!trg->ht && (trg->used >= LYD_HT_MIN_ITEMS)) {
1820 set_insert_node_hash(trg, NULL, 0);
1821 }
1822
1823#ifndef NDEBUG
1824 LOGDBG(LY_LDGXPATH, "MERGE result");
1825 print_set_debug(trg);
1826#endif
1827
Michal Vaskod3678892020-05-21 10:06:58 +02001828 lyxp_set_free_content(src);
Michal Vasko03ff5a72019-09-11 13:49:33 +02001829 return LY_SUCCESS;
1830}
1831
Michal Vasko14676352020-05-29 11:35:55 +02001832LY_ERR
Michal Vasko004d3152020-06-11 19:59:22 +02001833lyxp_check_token(const struct ly_ctx *ctx, const struct lyxp_expr *exp, uint16_t tok_idx, enum lyxp_token want_tok)
Michal Vasko03ff5a72019-09-11 13:49:33 +02001834{
Michal Vasko004d3152020-06-11 19:59:22 +02001835 if (exp->used == tok_idx) {
Michal Vasko14676352020-05-29 11:35:55 +02001836 if (ctx) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001837 LOGVAL(ctx, LY_VCODE_XP_EOF);
Michal Vasko03ff5a72019-09-11 13:49:33 +02001838 }
Michal Vasko14676352020-05-29 11:35:55 +02001839 return LY_EINCOMPLETE;
Michal Vasko03ff5a72019-09-11 13:49:33 +02001840 }
1841
Michal Vasko004d3152020-06-11 19:59:22 +02001842 if (want_tok && (exp->tokens[tok_idx] != want_tok)) {
Michal Vasko14676352020-05-29 11:35:55 +02001843 if (ctx) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001844 LOGVAL(ctx, LY_VCODE_XP_INTOK2, lyxp_print_token(exp->tokens[tok_idx]),
Michal Vasko0b468e62020-10-19 09:33:04 +02001845 &exp->expr[exp->tok_pos[tok_idx]], lyxp_print_token(want_tok));
Michal Vasko03ff5a72019-09-11 13:49:33 +02001846 }
Michal Vasko14676352020-05-29 11:35:55 +02001847 return LY_ENOT;
1848 }
1849
1850 return LY_SUCCESS;
1851}
1852
Michal Vasko004d3152020-06-11 19:59:22 +02001853LY_ERR
1854lyxp_next_token(const struct ly_ctx *ctx, const struct lyxp_expr *exp, uint16_t *tok_idx, enum lyxp_token want_tok)
1855{
1856 LY_CHECK_RET(lyxp_check_token(ctx, exp, *tok_idx, want_tok));
1857
1858 /* skip the token */
1859 ++(*tok_idx);
1860
1861 return LY_SUCCESS;
1862}
1863
Michal Vasko14676352020-05-29 11:35:55 +02001864/* just like lyxp_check_token() but tests for 2 tokens */
1865static LY_ERR
Michal Vasko40308e72020-10-20 16:38:40 +02001866exp_check_token2(const struct ly_ctx *ctx, const struct lyxp_expr *exp, uint16_t tok_idx, enum lyxp_token want_tok1,
Radek Krejci0f969882020-08-21 16:56:47 +02001867 enum lyxp_token want_tok2)
Michal Vasko14676352020-05-29 11:35:55 +02001868{
Michal Vasko004d3152020-06-11 19:59:22 +02001869 if (exp->used == tok_idx) {
Michal Vasko14676352020-05-29 11:35:55 +02001870 if (ctx) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001871 LOGVAL(ctx, LY_VCODE_XP_EOF);
Michal Vasko14676352020-05-29 11:35:55 +02001872 }
1873 return LY_EINCOMPLETE;
1874 }
1875
Michal Vasko004d3152020-06-11 19:59:22 +02001876 if ((exp->tokens[tok_idx] != want_tok1) && (exp->tokens[tok_idx] != want_tok2)) {
Michal Vasko14676352020-05-29 11:35:55 +02001877 if (ctx) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001878 LOGVAL(ctx, LY_VCODE_XP_INTOK, lyxp_print_token(exp->tokens[tok_idx]),
Michal Vasko0b468e62020-10-19 09:33:04 +02001879 &exp->expr[exp->tok_pos[tok_idx]]);
Michal Vasko14676352020-05-29 11:35:55 +02001880 }
1881 return LY_ENOT;
Michal Vasko03ff5a72019-09-11 13:49:33 +02001882 }
1883
1884 return LY_SUCCESS;
1885}
1886
Michal Vasko4911eeb2021-06-28 11:23:05 +02001887LY_ERR
1888lyxp_next_token2(const struct ly_ctx *ctx, const struct lyxp_expr *exp, uint16_t *tok_idx, enum lyxp_token want_tok1,
1889 enum lyxp_token want_tok2)
1890{
1891 LY_CHECK_RET(exp_check_token2(ctx, exp, *tok_idx, want_tok1, want_tok2));
1892
1893 /* skip the token */
1894 ++(*tok_idx);
1895
1896 return LY_SUCCESS;
1897}
1898
Michal Vasko03ff5a72019-09-11 13:49:33 +02001899/**
1900 * @brief Stack operation push on the repeat array.
1901 *
1902 * @param[in] exp Expression to use.
Michal Vasko004d3152020-06-11 19:59:22 +02001903 * @param[in] tok_idx Position in the expresion \p exp.
Michal Vasko03ff5a72019-09-11 13:49:33 +02001904 * @param[in] repeat_op_idx Index from \p exp of the operator token. This value is pushed.
1905 */
1906static void
Michal Vasko004d3152020-06-11 19:59:22 +02001907exp_repeat_push(struct lyxp_expr *exp, uint16_t tok_idx, uint16_t repeat_op_idx)
Michal Vasko03ff5a72019-09-11 13:49:33 +02001908{
1909 uint16_t i;
1910
Michal Vasko004d3152020-06-11 19:59:22 +02001911 if (exp->repeat[tok_idx]) {
Radek Krejci1e008d22020-08-17 11:37:37 +02001912 for (i = 0; exp->repeat[tok_idx][i]; ++i) {}
Michal Vasko004d3152020-06-11 19:59:22 +02001913 exp->repeat[tok_idx] = realloc(exp->repeat[tok_idx], (i + 2) * sizeof *exp->repeat[tok_idx]);
1914 LY_CHECK_ERR_RET(!exp->repeat[tok_idx], LOGMEM(NULL), );
1915 exp->repeat[tok_idx][i] = repeat_op_idx;
1916 exp->repeat[tok_idx][i + 1] = 0;
Michal Vasko03ff5a72019-09-11 13:49:33 +02001917 } else {
Michal Vasko004d3152020-06-11 19:59:22 +02001918 exp->repeat[tok_idx] = calloc(2, sizeof *exp->repeat[tok_idx]);
1919 LY_CHECK_ERR_RET(!exp->repeat[tok_idx], LOGMEM(NULL), );
1920 exp->repeat[tok_idx][0] = repeat_op_idx;
Michal Vasko03ff5a72019-09-11 13:49:33 +02001921 }
1922}
1923
1924/**
1925 * @brief Reparse Predicate. Logs directly on error.
1926 *
1927 * [7] Predicate ::= '[' Expr ']'
1928 *
1929 * @param[in] ctx Context for logging.
1930 * @param[in] exp Parsed XPath expression.
Michal Vasko004d3152020-06-11 19:59:22 +02001931 * @param[in] tok_idx Position in the expression @p exp.
aPiecekbf968d92021-05-27 14:35:05 +02001932 * @param[in] depth Current number of nested expressions.
Michal Vasko03ff5a72019-09-11 13:49:33 +02001933 * @return LY_ERR
1934 */
1935static LY_ERR
aPiecekbf968d92021-05-27 14:35:05 +02001936reparse_predicate(const struct ly_ctx *ctx, struct lyxp_expr *exp, uint16_t *tok_idx, uint16_t depth)
Michal Vasko03ff5a72019-09-11 13:49:33 +02001937{
1938 LY_ERR rc;
1939
Michal Vasko004d3152020-06-11 19:59:22 +02001940 rc = lyxp_check_token(ctx, exp, *tok_idx, LYXP_TOKEN_BRACK1);
Michal Vasko03ff5a72019-09-11 13:49:33 +02001941 LY_CHECK_RET(rc);
Michal Vasko004d3152020-06-11 19:59:22 +02001942 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02001943
aPiecekbf968d92021-05-27 14:35:05 +02001944 rc = reparse_or_expr(ctx, exp, tok_idx, depth);
Michal Vasko03ff5a72019-09-11 13:49:33 +02001945 LY_CHECK_RET(rc);
1946
Michal Vasko004d3152020-06-11 19:59:22 +02001947 rc = lyxp_check_token(ctx, exp, *tok_idx, LYXP_TOKEN_BRACK2);
Michal Vasko03ff5a72019-09-11 13:49:33 +02001948 LY_CHECK_RET(rc);
Michal Vasko004d3152020-06-11 19:59:22 +02001949 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02001950
1951 return LY_SUCCESS;
1952}
1953
1954/**
1955 * @brief Reparse RelativeLocationPath. Logs directly on error.
1956 *
1957 * [4] RelativeLocationPath ::= Step | RelativeLocationPath '/' Step | RelativeLocationPath '//' Step
1958 * [5] Step ::= '@'? NodeTest Predicate* | '.' | '..'
1959 * [6] NodeTest ::= NameTest | NodeType '(' ')'
1960 *
1961 * @param[in] ctx Context for logging.
1962 * @param[in] exp Parsed XPath expression.
Michal Vasko004d3152020-06-11 19:59:22 +02001963 * @param[in] tok_idx Position in the expression \p exp.
aPiecekbf968d92021-05-27 14:35:05 +02001964 * @param[in] depth Current number of nested expressions.
Michal Vasko03ff5a72019-09-11 13:49:33 +02001965 * @return LY_ERR (LY_EINCOMPLETE on forward reference)
1966 */
1967static LY_ERR
aPiecekbf968d92021-05-27 14:35:05 +02001968reparse_relative_location_path(const struct ly_ctx *ctx, struct lyxp_expr *exp, uint16_t *tok_idx, uint16_t depth)
Michal Vasko03ff5a72019-09-11 13:49:33 +02001969{
1970 LY_ERR rc;
1971
Michal Vasko004d3152020-06-11 19:59:22 +02001972 rc = lyxp_check_token(ctx, exp, *tok_idx, LYXP_TOKEN_NONE);
Michal Vasko03ff5a72019-09-11 13:49:33 +02001973 LY_CHECK_RET(rc);
1974
1975 goto step;
1976 do {
1977 /* '/' or '//' */
Michal Vasko004d3152020-06-11 19:59:22 +02001978 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02001979
Michal Vasko004d3152020-06-11 19:59:22 +02001980 rc = lyxp_check_token(ctx, exp, *tok_idx, LYXP_TOKEN_NONE);
Michal Vasko03ff5a72019-09-11 13:49:33 +02001981 LY_CHECK_RET(rc);
1982step:
1983 /* Step */
Michal Vasko004d3152020-06-11 19:59:22 +02001984 switch (exp->tokens[*tok_idx]) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02001985 case LYXP_TOKEN_DOT:
Michal Vasko004d3152020-06-11 19:59:22 +02001986 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02001987 break;
1988
1989 case LYXP_TOKEN_DDOT:
Michal Vasko004d3152020-06-11 19:59:22 +02001990 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02001991 break;
1992
1993 case LYXP_TOKEN_AT:
Michal Vasko004d3152020-06-11 19:59:22 +02001994 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02001995
Michal Vasko004d3152020-06-11 19:59:22 +02001996 rc = lyxp_check_token(ctx, exp, *tok_idx, LYXP_TOKEN_NONE);
Michal Vasko03ff5a72019-09-11 13:49:33 +02001997 LY_CHECK_RET(rc);
Michal Vasko004d3152020-06-11 19:59:22 +02001998 if ((exp->tokens[*tok_idx] != LYXP_TOKEN_NAMETEST) && (exp->tokens[*tok_idx] != LYXP_TOKEN_NODETYPE)) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01001999 LOGVAL(ctx, LY_VCODE_XP_INTOK, lyxp_print_token(exp->tokens[*tok_idx]), &exp->expr[exp->tok_pos[*tok_idx]]);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002000 return LY_EVALID;
2001 }
Radek Krejci0f969882020-08-21 16:56:47 +02002002 /* fall through */
Michal Vasko03ff5a72019-09-11 13:49:33 +02002003 case LYXP_TOKEN_NAMETEST:
Michal Vasko004d3152020-06-11 19:59:22 +02002004 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002005 goto reparse_predicate;
Michal Vasko03ff5a72019-09-11 13:49:33 +02002006
2007 case LYXP_TOKEN_NODETYPE:
Michal Vasko004d3152020-06-11 19:59:22 +02002008 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002009
2010 /* '(' */
Michal Vasko004d3152020-06-11 19:59:22 +02002011 rc = lyxp_check_token(ctx, exp, *tok_idx, LYXP_TOKEN_PAR1);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002012 LY_CHECK_RET(rc);
Michal Vasko004d3152020-06-11 19:59:22 +02002013 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002014
2015 /* ')' */
Michal Vasko004d3152020-06-11 19:59:22 +02002016 rc = lyxp_check_token(ctx, exp, *tok_idx, LYXP_TOKEN_PAR2);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002017 LY_CHECK_RET(rc);
Michal Vasko004d3152020-06-11 19:59:22 +02002018 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002019
2020reparse_predicate:
2021 /* Predicate* */
Michal Vasko004d3152020-06-11 19:59:22 +02002022 while (!lyxp_check_token(NULL, exp, *tok_idx, LYXP_TOKEN_BRACK1)) {
aPiecekbf968d92021-05-27 14:35:05 +02002023 rc = reparse_predicate(ctx, exp, tok_idx, depth);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002024 LY_CHECK_RET(rc);
2025 }
2026 break;
2027 default:
Radek Krejci2efc45b2020-12-22 16:25:44 +01002028 LOGVAL(ctx, LY_VCODE_XP_INTOK, lyxp_print_token(exp->tokens[*tok_idx]), &exp->expr[exp->tok_pos[*tok_idx]]);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002029 return LY_EVALID;
2030 }
Michal Vasko004d3152020-06-11 19:59:22 +02002031 } while (!exp_check_token2(NULL, exp, *tok_idx, LYXP_TOKEN_OPER_PATH, LYXP_TOKEN_OPER_RPATH));
Michal Vasko03ff5a72019-09-11 13:49:33 +02002032
2033 return LY_SUCCESS;
2034}
2035
2036/**
2037 * @brief Reparse AbsoluteLocationPath. Logs directly on error.
2038 *
2039 * [3] AbsoluteLocationPath ::= '/' RelativeLocationPath? | '//' RelativeLocationPath
2040 *
2041 * @param[in] ctx Context for logging.
2042 * @param[in] exp Parsed XPath expression.
Michal Vasko004d3152020-06-11 19:59:22 +02002043 * @param[in] tok_idx Position in the expression \p exp.
aPiecekbf968d92021-05-27 14:35:05 +02002044 * @param[in] depth Current number of nested expressions.
Michal Vasko03ff5a72019-09-11 13:49:33 +02002045 * @return LY_ERR
2046 */
2047static LY_ERR
aPiecekbf968d92021-05-27 14:35:05 +02002048reparse_absolute_location_path(const struct ly_ctx *ctx, struct lyxp_expr *exp, uint16_t *tok_idx, uint16_t depth)
Michal Vasko03ff5a72019-09-11 13:49:33 +02002049{
2050 LY_ERR rc;
2051
Michal Vasko004d3152020-06-11 19:59:22 +02002052 LY_CHECK_RET(exp_check_token2(ctx, exp, *tok_idx, LYXP_TOKEN_OPER_PATH, LYXP_TOKEN_OPER_RPATH));
Michal Vasko03ff5a72019-09-11 13:49:33 +02002053
2054 /* '/' RelativeLocationPath? */
Michal Vasko004d3152020-06-11 19:59:22 +02002055 if (exp->tokens[*tok_idx] == LYXP_TOKEN_OPER_PATH) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002056 /* '/' */
Michal Vasko004d3152020-06-11 19:59:22 +02002057 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002058
Michal Vasko004d3152020-06-11 19:59:22 +02002059 if (lyxp_check_token(NULL, exp, *tok_idx, LYXP_TOKEN_NONE)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002060 return LY_SUCCESS;
2061 }
Michal Vasko004d3152020-06-11 19:59:22 +02002062 switch (exp->tokens[*tok_idx]) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002063 case LYXP_TOKEN_DOT:
2064 case LYXP_TOKEN_DDOT:
2065 case LYXP_TOKEN_AT:
2066 case LYXP_TOKEN_NAMETEST:
2067 case LYXP_TOKEN_NODETYPE:
aPiecekbf968d92021-05-27 14:35:05 +02002068 rc = reparse_relative_location_path(ctx, exp, tok_idx, depth);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002069 LY_CHECK_RET(rc);
Radek Krejci0f969882020-08-21 16:56:47 +02002070 /* fall through */
Michal Vasko03ff5a72019-09-11 13:49:33 +02002071 default:
2072 break;
2073 }
2074
Michal Vasko03ff5a72019-09-11 13:49:33 +02002075 } else {
Radek Krejcif6a11002020-08-21 13:29:07 +02002076 /* '//' RelativeLocationPath */
Michal Vasko004d3152020-06-11 19:59:22 +02002077 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002078
aPiecekbf968d92021-05-27 14:35:05 +02002079 rc = reparse_relative_location_path(ctx, exp, tok_idx, depth);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002080 LY_CHECK_RET(rc);
2081 }
2082
2083 return LY_SUCCESS;
2084}
2085
2086/**
2087 * @brief Reparse FunctionCall. Logs directly on error.
2088 *
2089 * [9] FunctionCall ::= FunctionName '(' ( Expr ( ',' Expr )* )? ')'
2090 *
2091 * @param[in] ctx Context for logging.
2092 * @param[in] exp Parsed XPath expression.
Michal Vasko004d3152020-06-11 19:59:22 +02002093 * @param[in] tok_idx Position in the expression @p exp.
aPiecekbf968d92021-05-27 14:35:05 +02002094 * @param[in] depth Current number of nested expressions.
Michal Vasko03ff5a72019-09-11 13:49:33 +02002095 * @return LY_ERR
2096 */
2097static LY_ERR
aPiecekbf968d92021-05-27 14:35:05 +02002098reparse_function_call(const struct ly_ctx *ctx, struct lyxp_expr *exp, uint16_t *tok_idx, uint16_t depth)
Michal Vasko03ff5a72019-09-11 13:49:33 +02002099{
Radek Krejci1deb5be2020-08-26 16:43:36 +02002100 int8_t min_arg_count = -1;
2101 uint32_t arg_count, max_arg_count = 0;
Michal Vasko004d3152020-06-11 19:59:22 +02002102 uint16_t func_tok_idx;
Michal Vasko03ff5a72019-09-11 13:49:33 +02002103 LY_ERR rc;
2104
Michal Vasko004d3152020-06-11 19:59:22 +02002105 rc = lyxp_check_token(ctx, exp, *tok_idx, LYXP_TOKEN_FUNCNAME);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002106 LY_CHECK_RET(rc);
Michal Vasko004d3152020-06-11 19:59:22 +02002107 func_tok_idx = *tok_idx;
2108 switch (exp->tok_len[*tok_idx]) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002109 case 3:
Michal Vasko004d3152020-06-11 19:59:22 +02002110 if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "not", 3)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002111 min_arg_count = 1;
2112 max_arg_count = 1;
Michal Vasko004d3152020-06-11 19:59:22 +02002113 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "sum", 3)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002114 min_arg_count = 1;
2115 max_arg_count = 1;
2116 }
2117 break;
2118 case 4:
Michal Vasko004d3152020-06-11 19:59:22 +02002119 if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "lang", 4)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002120 min_arg_count = 1;
2121 max_arg_count = 1;
Michal Vasko004d3152020-06-11 19:59:22 +02002122 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "last", 4)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002123 min_arg_count = 0;
2124 max_arg_count = 0;
Michal Vasko004d3152020-06-11 19:59:22 +02002125 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "name", 4)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002126 min_arg_count = 0;
2127 max_arg_count = 1;
Michal Vasko004d3152020-06-11 19:59:22 +02002128 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "true", 4)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002129 min_arg_count = 0;
2130 max_arg_count = 0;
2131 }
2132 break;
2133 case 5:
Michal Vasko004d3152020-06-11 19:59:22 +02002134 if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "count", 5)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002135 min_arg_count = 1;
2136 max_arg_count = 1;
Michal Vasko004d3152020-06-11 19:59:22 +02002137 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "false", 5)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002138 min_arg_count = 0;
2139 max_arg_count = 0;
Michal Vasko004d3152020-06-11 19:59:22 +02002140 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "floor", 5)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002141 min_arg_count = 1;
2142 max_arg_count = 1;
Michal Vasko004d3152020-06-11 19:59:22 +02002143 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "round", 5)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002144 min_arg_count = 1;
2145 max_arg_count = 1;
Michal Vasko004d3152020-06-11 19:59:22 +02002146 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "deref", 5)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002147 min_arg_count = 1;
2148 max_arg_count = 1;
2149 }
2150 break;
2151 case 6:
Michal Vasko004d3152020-06-11 19:59:22 +02002152 if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "concat", 6)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002153 min_arg_count = 2;
Radek Krejci1deb5be2020-08-26 16:43:36 +02002154 max_arg_count = UINT32_MAX;
Michal Vasko004d3152020-06-11 19:59:22 +02002155 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "number", 6)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002156 min_arg_count = 0;
2157 max_arg_count = 1;
Michal Vasko004d3152020-06-11 19:59:22 +02002158 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "string", 6)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002159 min_arg_count = 0;
2160 max_arg_count = 1;
2161 }
2162 break;
2163 case 7:
Michal Vasko004d3152020-06-11 19:59:22 +02002164 if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "boolean", 7)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002165 min_arg_count = 1;
2166 max_arg_count = 1;
Michal Vasko004d3152020-06-11 19:59:22 +02002167 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "ceiling", 7)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002168 min_arg_count = 1;
2169 max_arg_count = 1;
Michal Vasko004d3152020-06-11 19:59:22 +02002170 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "current", 7)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002171 min_arg_count = 0;
2172 max_arg_count = 0;
2173 }
2174 break;
2175 case 8:
Michal Vasko004d3152020-06-11 19:59:22 +02002176 if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "contains", 8)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002177 min_arg_count = 2;
2178 max_arg_count = 2;
Michal Vasko004d3152020-06-11 19:59:22 +02002179 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "position", 8)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002180 min_arg_count = 0;
2181 max_arg_count = 0;
Michal Vasko004d3152020-06-11 19:59:22 +02002182 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "re-match", 8)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002183 min_arg_count = 2;
2184 max_arg_count = 2;
2185 }
2186 break;
2187 case 9:
Michal Vasko004d3152020-06-11 19:59:22 +02002188 if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "substring", 9)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002189 min_arg_count = 2;
2190 max_arg_count = 3;
Michal Vasko004d3152020-06-11 19:59:22 +02002191 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "translate", 9)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002192 min_arg_count = 3;
2193 max_arg_count = 3;
2194 }
2195 break;
2196 case 10:
Michal Vasko004d3152020-06-11 19:59:22 +02002197 if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "local-name", 10)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002198 min_arg_count = 0;
2199 max_arg_count = 1;
Michal Vasko004d3152020-06-11 19:59:22 +02002200 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "enum-value", 10)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002201 min_arg_count = 1;
2202 max_arg_count = 1;
Michal Vasko004d3152020-06-11 19:59:22 +02002203 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "bit-is-set", 10)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002204 min_arg_count = 2;
2205 max_arg_count = 2;
2206 }
2207 break;
2208 case 11:
Michal Vasko004d3152020-06-11 19:59:22 +02002209 if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "starts-with", 11)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002210 min_arg_count = 2;
2211 max_arg_count = 2;
2212 }
2213 break;
2214 case 12:
Michal Vasko004d3152020-06-11 19:59:22 +02002215 if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "derived-from", 12)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002216 min_arg_count = 2;
2217 max_arg_count = 2;
2218 }
2219 break;
2220 case 13:
Michal Vasko004d3152020-06-11 19:59:22 +02002221 if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "namespace-uri", 13)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002222 min_arg_count = 0;
2223 max_arg_count = 1;
Michal Vasko004d3152020-06-11 19:59:22 +02002224 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "string-length", 13)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002225 min_arg_count = 0;
2226 max_arg_count = 1;
2227 }
2228 break;
2229 case 15:
Michal Vasko004d3152020-06-11 19:59:22 +02002230 if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "normalize-space", 15)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002231 min_arg_count = 0;
2232 max_arg_count = 1;
Michal Vasko004d3152020-06-11 19:59:22 +02002233 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "substring-after", 15)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002234 min_arg_count = 2;
2235 max_arg_count = 2;
2236 }
2237 break;
2238 case 16:
Michal Vasko004d3152020-06-11 19:59:22 +02002239 if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "substring-before", 16)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002240 min_arg_count = 2;
2241 max_arg_count = 2;
2242 }
2243 break;
2244 case 20:
Michal Vasko004d3152020-06-11 19:59:22 +02002245 if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "derived-from-or-self", 20)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002246 min_arg_count = 2;
2247 max_arg_count = 2;
2248 }
2249 break;
2250 }
2251 if (min_arg_count == -1) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01002252 LOGVAL(ctx, LY_VCODE_XP_INFUNC, exp->tok_len[*tok_idx], &exp->expr[exp->tok_pos[*tok_idx]]);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002253 return LY_EINVAL;
2254 }
Michal Vasko004d3152020-06-11 19:59:22 +02002255 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002256
2257 /* '(' */
Michal Vasko004d3152020-06-11 19:59:22 +02002258 rc = lyxp_check_token(ctx, exp, *tok_idx, LYXP_TOKEN_PAR1);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002259 LY_CHECK_RET(rc);
Michal Vasko004d3152020-06-11 19:59:22 +02002260 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002261
2262 /* ( Expr ( ',' Expr )* )? */
2263 arg_count = 0;
Michal Vasko004d3152020-06-11 19:59:22 +02002264 rc = lyxp_check_token(ctx, exp, *tok_idx, LYXP_TOKEN_NONE);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002265 LY_CHECK_RET(rc);
Michal Vasko004d3152020-06-11 19:59:22 +02002266 if (exp->tokens[*tok_idx] != LYXP_TOKEN_PAR2) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002267 ++arg_count;
aPiecekbf968d92021-05-27 14:35:05 +02002268 rc = reparse_or_expr(ctx, exp, tok_idx, depth);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002269 LY_CHECK_RET(rc);
2270 }
Michal Vasko004d3152020-06-11 19:59:22 +02002271 while (!lyxp_check_token(NULL, exp, *tok_idx, LYXP_TOKEN_COMMA)) {
2272 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002273
2274 ++arg_count;
aPiecekbf968d92021-05-27 14:35:05 +02002275 rc = reparse_or_expr(ctx, exp, tok_idx, depth);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002276 LY_CHECK_RET(rc);
2277 }
2278
2279 /* ')' */
Michal Vasko004d3152020-06-11 19:59:22 +02002280 rc = lyxp_check_token(ctx, exp, *tok_idx, LYXP_TOKEN_PAR2);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002281 LY_CHECK_RET(rc);
Michal Vasko004d3152020-06-11 19:59:22 +02002282 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002283
Radek Krejci857189e2020-09-01 13:26:36 +02002284 if ((arg_count < (uint32_t)min_arg_count) || (arg_count > max_arg_count)) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01002285 LOGVAL(ctx, LY_VCODE_XP_INARGCOUNT, arg_count, exp->tok_len[func_tok_idx], &exp->expr[exp->tok_pos[func_tok_idx]]);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002286 return LY_EVALID;
2287 }
2288
2289 return LY_SUCCESS;
2290}
2291
2292/**
2293 * @brief Reparse PathExpr. Logs directly on error.
2294 *
2295 * [10] PathExpr ::= LocationPath | PrimaryExpr Predicate*
2296 * | PrimaryExpr Predicate* '/' RelativeLocationPath
2297 * | PrimaryExpr Predicate* '//' RelativeLocationPath
2298 * [2] LocationPath ::= RelativeLocationPath | AbsoluteLocationPath
aPiecekfba75362021-10-07 12:39:48 +02002299 * [8] PrimaryExpr ::= VariableReference | '(' Expr ')' | Literal | Number | FunctionCall
Michal Vasko03ff5a72019-09-11 13:49:33 +02002300 *
2301 * @param[in] ctx Context for logging.
2302 * @param[in] exp Parsed XPath expression.
Michal Vasko004d3152020-06-11 19:59:22 +02002303 * @param[in] tok_idx Position in the expression @p exp.
aPiecekbf968d92021-05-27 14:35:05 +02002304 * @param[in] depth Current number of nested expressions.
Michal Vasko03ff5a72019-09-11 13:49:33 +02002305 * @return LY_ERR
2306 */
2307static LY_ERR
aPiecekbf968d92021-05-27 14:35:05 +02002308reparse_path_expr(const struct ly_ctx *ctx, struct lyxp_expr *exp, uint16_t *tok_idx, uint16_t depth)
Michal Vasko03ff5a72019-09-11 13:49:33 +02002309{
2310 LY_ERR rc;
2311
Michal Vasko004d3152020-06-11 19:59:22 +02002312 if (lyxp_check_token(ctx, exp, *tok_idx, LYXP_TOKEN_NONE)) {
Michal Vasko14676352020-05-29 11:35:55 +02002313 return LY_EVALID;
Michal Vasko03ff5a72019-09-11 13:49:33 +02002314 }
2315
Michal Vasko004d3152020-06-11 19:59:22 +02002316 switch (exp->tokens[*tok_idx]) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002317 case LYXP_TOKEN_PAR1:
2318 /* '(' Expr ')' Predicate* */
Michal Vasko004d3152020-06-11 19:59:22 +02002319 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002320
aPiecekbf968d92021-05-27 14:35:05 +02002321 rc = reparse_or_expr(ctx, exp, tok_idx, depth);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002322 LY_CHECK_RET(rc);
2323
Michal Vasko004d3152020-06-11 19:59:22 +02002324 rc = lyxp_check_token(ctx, exp, *tok_idx, LYXP_TOKEN_PAR2);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002325 LY_CHECK_RET(rc);
Michal Vasko004d3152020-06-11 19:59:22 +02002326 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002327 goto predicate;
Michal Vasko03ff5a72019-09-11 13:49:33 +02002328 case LYXP_TOKEN_DOT:
2329 case LYXP_TOKEN_DDOT:
2330 case LYXP_TOKEN_AT:
2331 case LYXP_TOKEN_NAMETEST:
2332 case LYXP_TOKEN_NODETYPE:
2333 /* RelativeLocationPath */
aPiecekbf968d92021-05-27 14:35:05 +02002334 rc = reparse_relative_location_path(ctx, exp, tok_idx, depth);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002335 LY_CHECK_RET(rc);
2336 break;
aPiecekfba75362021-10-07 12:39:48 +02002337 case LYXP_TOKEN_VARREF:
2338 /* VariableReference */
2339 ++(*tok_idx);
2340 goto predicate;
Michal Vasko03ff5a72019-09-11 13:49:33 +02002341 case LYXP_TOKEN_FUNCNAME:
2342 /* FunctionCall */
aPiecekbf968d92021-05-27 14:35:05 +02002343 rc = reparse_function_call(ctx, exp, tok_idx, depth);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002344 LY_CHECK_RET(rc);
2345 goto predicate;
Michal Vasko3e48bf32020-06-01 08:39:07 +02002346 case LYXP_TOKEN_OPER_PATH:
2347 case LYXP_TOKEN_OPER_RPATH:
Michal Vasko03ff5a72019-09-11 13:49:33 +02002348 /* AbsoluteLocationPath */
aPiecekbf968d92021-05-27 14:35:05 +02002349 rc = reparse_absolute_location_path(ctx, exp, tok_idx, depth);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002350 LY_CHECK_RET(rc);
2351 break;
2352 case LYXP_TOKEN_LITERAL:
2353 /* Literal */
Michal Vasko004d3152020-06-11 19:59:22 +02002354 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002355 goto predicate;
Michal Vasko03ff5a72019-09-11 13:49:33 +02002356 case LYXP_TOKEN_NUMBER:
2357 /* Number */
Michal Vasko004d3152020-06-11 19:59:22 +02002358 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002359 goto predicate;
Michal Vasko03ff5a72019-09-11 13:49:33 +02002360 default:
Radek Krejci2efc45b2020-12-22 16:25:44 +01002361 LOGVAL(ctx, LY_VCODE_XP_INTOK, lyxp_print_token(exp->tokens[*tok_idx]), &exp->expr[exp->tok_pos[*tok_idx]]);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002362 return LY_EVALID;
2363 }
2364
2365 return LY_SUCCESS;
2366
2367predicate:
2368 /* Predicate* */
Michal Vasko004d3152020-06-11 19:59:22 +02002369 while (!lyxp_check_token(NULL, exp, *tok_idx, LYXP_TOKEN_BRACK1)) {
aPiecekbf968d92021-05-27 14:35:05 +02002370 rc = reparse_predicate(ctx, exp, tok_idx, depth);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002371 LY_CHECK_RET(rc);
2372 }
2373
2374 /* ('/' or '//') RelativeLocationPath */
Michal Vasko004d3152020-06-11 19:59:22 +02002375 if (!exp_check_token2(NULL, exp, *tok_idx, LYXP_TOKEN_OPER_PATH, LYXP_TOKEN_OPER_RPATH)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002376
2377 /* '/' or '//' */
Michal Vasko004d3152020-06-11 19:59:22 +02002378 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002379
aPiecekbf968d92021-05-27 14:35:05 +02002380 rc = reparse_relative_location_path(ctx, exp, tok_idx, depth);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002381 LY_CHECK_RET(rc);
2382 }
2383
2384 return LY_SUCCESS;
2385}
2386
2387/**
2388 * @brief Reparse UnaryExpr. Logs directly on error.
2389 *
2390 * [17] UnaryExpr ::= UnionExpr | '-' UnaryExpr
2391 * [18] UnionExpr ::= PathExpr | UnionExpr '|' PathExpr
2392 *
2393 * @param[in] ctx Context for logging.
2394 * @param[in] exp Parsed XPath expression.
Michal Vasko004d3152020-06-11 19:59:22 +02002395 * @param[in] tok_idx Position in the expression @p exp.
aPiecekbf968d92021-05-27 14:35:05 +02002396 * @param[in] depth Current number of nested expressions.
Michal Vasko03ff5a72019-09-11 13:49:33 +02002397 * @return LY_ERR
2398 */
2399static LY_ERR
aPiecekbf968d92021-05-27 14:35:05 +02002400reparse_unary_expr(const struct ly_ctx *ctx, struct lyxp_expr *exp, uint16_t *tok_idx, uint16_t depth)
Michal Vasko03ff5a72019-09-11 13:49:33 +02002401{
2402 uint16_t prev_exp;
2403 LY_ERR rc;
2404
2405 /* ('-')* */
Michal Vasko004d3152020-06-11 19:59:22 +02002406 prev_exp = *tok_idx;
Michal Vasko69730152020-10-09 16:30:07 +02002407 while (!lyxp_check_token(NULL, exp, *tok_idx, LYXP_TOKEN_OPER_MATH) &&
2408 (exp->expr[exp->tok_pos[*tok_idx]] == '-')) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002409 exp_repeat_push(exp, prev_exp, LYXP_EXPR_UNARY);
Michal Vasko004d3152020-06-11 19:59:22 +02002410 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002411 }
2412
2413 /* PathExpr */
Michal Vasko004d3152020-06-11 19:59:22 +02002414 prev_exp = *tok_idx;
aPiecekbf968d92021-05-27 14:35:05 +02002415 rc = reparse_path_expr(ctx, exp, tok_idx, depth);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002416 LY_CHECK_RET(rc);
2417
2418 /* ('|' PathExpr)* */
Michal Vasko004d3152020-06-11 19:59:22 +02002419 while (!lyxp_check_token(NULL, exp, *tok_idx, LYXP_TOKEN_OPER_UNI)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002420 exp_repeat_push(exp, prev_exp, LYXP_EXPR_UNION);
Michal Vasko004d3152020-06-11 19:59:22 +02002421 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002422
aPiecekbf968d92021-05-27 14:35:05 +02002423 rc = reparse_path_expr(ctx, exp, tok_idx, depth);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002424 LY_CHECK_RET(rc);
2425 }
2426
2427 return LY_SUCCESS;
2428}
2429
2430/**
2431 * @brief Reparse AdditiveExpr. Logs directly on error.
2432 *
2433 * [15] AdditiveExpr ::= MultiplicativeExpr
2434 * | AdditiveExpr '+' MultiplicativeExpr
2435 * | AdditiveExpr '-' MultiplicativeExpr
2436 * [16] MultiplicativeExpr ::= UnaryExpr
2437 * | MultiplicativeExpr '*' UnaryExpr
2438 * | MultiplicativeExpr 'div' UnaryExpr
2439 * | MultiplicativeExpr 'mod' UnaryExpr
2440 *
2441 * @param[in] ctx Context for logging.
2442 * @param[in] exp Parsed XPath expression.
Michal Vasko004d3152020-06-11 19:59:22 +02002443 * @param[in] tok_idx Position in the expression @p exp.
aPiecekbf968d92021-05-27 14:35:05 +02002444 * @param[in] depth Current number of nested expressions.
Michal Vasko03ff5a72019-09-11 13:49:33 +02002445 * @return LY_ERR
2446 */
2447static LY_ERR
aPiecekbf968d92021-05-27 14:35:05 +02002448reparse_additive_expr(const struct ly_ctx *ctx, struct lyxp_expr *exp, uint16_t *tok_idx, uint16_t depth)
Michal Vasko03ff5a72019-09-11 13:49:33 +02002449{
2450 uint16_t prev_add_exp, prev_mul_exp;
2451 LY_ERR rc;
2452
Michal Vasko004d3152020-06-11 19:59:22 +02002453 prev_add_exp = *tok_idx;
Michal Vasko03ff5a72019-09-11 13:49:33 +02002454 goto reparse_multiplicative_expr;
2455
2456 /* ('+' / '-' MultiplicativeExpr)* */
Michal Vasko69730152020-10-09 16:30:07 +02002457 while (!lyxp_check_token(NULL, exp, *tok_idx, LYXP_TOKEN_OPER_MATH) &&
2458 ((exp->expr[exp->tok_pos[*tok_idx]] == '+') || (exp->expr[exp->tok_pos[*tok_idx]] == '-'))) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002459 exp_repeat_push(exp, prev_add_exp, LYXP_EXPR_ADDITIVE);
Michal Vasko004d3152020-06-11 19:59:22 +02002460 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002461
2462reparse_multiplicative_expr:
2463 /* UnaryExpr */
Michal Vasko004d3152020-06-11 19:59:22 +02002464 prev_mul_exp = *tok_idx;
aPiecekbf968d92021-05-27 14:35:05 +02002465 rc = reparse_unary_expr(ctx, exp, tok_idx, depth);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002466 LY_CHECK_RET(rc);
2467
2468 /* ('*' / 'div' / 'mod' UnaryExpr)* */
Michal Vasko69730152020-10-09 16:30:07 +02002469 while (!lyxp_check_token(NULL, exp, *tok_idx, LYXP_TOKEN_OPER_MATH) &&
2470 ((exp->expr[exp->tok_pos[*tok_idx]] == '*') || (exp->tok_len[*tok_idx] == 3))) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002471 exp_repeat_push(exp, prev_mul_exp, LYXP_EXPR_MULTIPLICATIVE);
Michal Vasko004d3152020-06-11 19:59:22 +02002472 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002473
aPiecekbf968d92021-05-27 14:35:05 +02002474 rc = reparse_unary_expr(ctx, exp, tok_idx, depth);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002475 LY_CHECK_RET(rc);
2476 }
2477 }
2478
2479 return LY_SUCCESS;
2480}
2481
2482/**
2483 * @brief Reparse EqualityExpr. Logs directly on error.
2484 *
2485 * [13] EqualityExpr ::= RelationalExpr | EqualityExpr '=' RelationalExpr
2486 * | EqualityExpr '!=' RelationalExpr
2487 * [14] RelationalExpr ::= AdditiveExpr
2488 * | RelationalExpr '<' AdditiveExpr
2489 * | RelationalExpr '>' AdditiveExpr
2490 * | RelationalExpr '<=' AdditiveExpr
2491 * | RelationalExpr '>=' AdditiveExpr
2492 *
2493 * @param[in] ctx Context for logging.
2494 * @param[in] exp Parsed XPath expression.
Michal Vasko004d3152020-06-11 19:59:22 +02002495 * @param[in] tok_idx Position in the expression @p exp.
aPiecekbf968d92021-05-27 14:35:05 +02002496 * @param[in] depth Current number of nested expressions.
Michal Vasko03ff5a72019-09-11 13:49:33 +02002497 * @return LY_ERR
2498 */
2499static LY_ERR
aPiecekbf968d92021-05-27 14:35:05 +02002500reparse_equality_expr(const struct ly_ctx *ctx, struct lyxp_expr *exp, uint16_t *tok_idx, uint16_t depth)
Michal Vasko03ff5a72019-09-11 13:49:33 +02002501{
2502 uint16_t prev_eq_exp, prev_rel_exp;
2503 LY_ERR rc;
2504
Michal Vasko004d3152020-06-11 19:59:22 +02002505 prev_eq_exp = *tok_idx;
Michal Vasko03ff5a72019-09-11 13:49:33 +02002506 goto reparse_additive_expr;
2507
2508 /* ('=' / '!=' RelationalExpr)* */
Michal Vasko004d3152020-06-11 19:59:22 +02002509 while (!exp_check_token2(NULL, exp, *tok_idx, LYXP_TOKEN_OPER_EQUAL, LYXP_TOKEN_OPER_NEQUAL)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002510 exp_repeat_push(exp, prev_eq_exp, LYXP_EXPR_EQUALITY);
Michal Vasko004d3152020-06-11 19:59:22 +02002511 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002512
2513reparse_additive_expr:
2514 /* AdditiveExpr */
Michal Vasko004d3152020-06-11 19:59:22 +02002515 prev_rel_exp = *tok_idx;
aPiecekbf968d92021-05-27 14:35:05 +02002516 rc = reparse_additive_expr(ctx, exp, tok_idx, depth);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002517 LY_CHECK_RET(rc);
2518
2519 /* ('<' / '>' / '<=' / '>=' AdditiveExpr)* */
Michal Vasko004d3152020-06-11 19:59:22 +02002520 while (!lyxp_check_token(NULL, exp, *tok_idx, LYXP_TOKEN_OPER_COMP)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002521 exp_repeat_push(exp, prev_rel_exp, LYXP_EXPR_RELATIONAL);
Michal Vasko004d3152020-06-11 19:59:22 +02002522 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002523
aPiecekbf968d92021-05-27 14:35:05 +02002524 rc = reparse_additive_expr(ctx, exp, tok_idx, depth);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002525 LY_CHECK_RET(rc);
2526 }
2527 }
2528
2529 return LY_SUCCESS;
2530}
2531
2532/**
2533 * @brief Reparse OrExpr. Logs directly on error.
2534 *
2535 * [11] OrExpr ::= AndExpr | OrExpr 'or' AndExpr
2536 * [12] AndExpr ::= EqualityExpr | AndExpr 'and' EqualityExpr
2537 *
2538 * @param[in] ctx Context for logging.
2539 * @param[in] exp Parsed XPath expression.
Michal Vasko004d3152020-06-11 19:59:22 +02002540 * @param[in] tok_idx Position in the expression @p exp.
aPiecekbf968d92021-05-27 14:35:05 +02002541 * @param[in] depth Current number of nested expressions.
Michal Vasko03ff5a72019-09-11 13:49:33 +02002542 * @return LY_ERR
2543 */
2544static LY_ERR
aPiecekbf968d92021-05-27 14:35:05 +02002545reparse_or_expr(const struct ly_ctx *ctx, struct lyxp_expr *exp, uint16_t *tok_idx, uint16_t depth)
Michal Vasko03ff5a72019-09-11 13:49:33 +02002546{
2547 uint16_t prev_or_exp, prev_and_exp;
2548 LY_ERR rc;
2549
aPiecekbf968d92021-05-27 14:35:05 +02002550 ++depth;
2551 LY_CHECK_ERR_RET(depth > LYXP_MAX_BLOCK_DEPTH, LOGVAL(ctx, LY_VCODE_XP_DEPTH), LY_EINVAL);
2552
Michal Vasko004d3152020-06-11 19:59:22 +02002553 prev_or_exp = *tok_idx;
Michal Vasko03ff5a72019-09-11 13:49:33 +02002554 goto reparse_equality_expr;
2555
2556 /* ('or' AndExpr)* */
Michal Vasko004d3152020-06-11 19:59:22 +02002557 while (!lyxp_check_token(NULL, exp, *tok_idx, LYXP_TOKEN_OPER_LOG) && (exp->tok_len[*tok_idx] == 2)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002558 exp_repeat_push(exp, prev_or_exp, LYXP_EXPR_OR);
Michal Vasko004d3152020-06-11 19:59:22 +02002559 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002560
2561reparse_equality_expr:
2562 /* EqualityExpr */
Michal Vasko004d3152020-06-11 19:59:22 +02002563 prev_and_exp = *tok_idx;
aPiecekbf968d92021-05-27 14:35:05 +02002564 rc = reparse_equality_expr(ctx, exp, tok_idx, depth);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002565 LY_CHECK_RET(rc);
2566
2567 /* ('and' EqualityExpr)* */
Michal Vasko004d3152020-06-11 19:59:22 +02002568 while (!lyxp_check_token(NULL, exp, *tok_idx, LYXP_TOKEN_OPER_LOG) && (exp->tok_len[*tok_idx] == 3)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02002569 exp_repeat_push(exp, prev_and_exp, LYXP_EXPR_AND);
Michal Vasko004d3152020-06-11 19:59:22 +02002570 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002571
aPiecekbf968d92021-05-27 14:35:05 +02002572 rc = reparse_equality_expr(ctx, exp, tok_idx, depth);
Michal Vasko03ff5a72019-09-11 13:49:33 +02002573 LY_CHECK_RET(rc);
2574 }
2575 }
2576
2577 return LY_SUCCESS;
2578}
Radek Krejcib1646a92018-11-02 16:08:26 +01002579
2580/**
2581 * @brief Parse NCName.
2582 *
2583 * @param[in] ncname Name to parse.
Michal Vasko03ff5a72019-09-11 13:49:33 +02002584 * @return Length of @p ncname valid bytes.
Radek Krejcib1646a92018-11-02 16:08:26 +01002585 */
Radek Krejcid4270262019-01-07 15:07:25 +01002586static long int
Radek Krejcib1646a92018-11-02 16:08:26 +01002587parse_ncname(const char *ncname)
2588{
Radek Krejci1deb5be2020-08-26 16:43:36 +02002589 uint32_t uc;
Radek Krejcid4270262019-01-07 15:07:25 +01002590 size_t size;
2591 long int len = 0;
Radek Krejcib1646a92018-11-02 16:08:26 +01002592
2593 LY_CHECK_RET(ly_getutf8(&ncname, &uc, &size), 0);
2594 if (!is_xmlqnamestartchar(uc) || (uc == ':')) {
2595 return len;
2596 }
2597
2598 do {
2599 len += size;
Radek Krejci9a564c92019-01-07 14:53:57 +01002600 if (!*ncname) {
2601 break;
2602 }
Radek Krejcid4270262019-01-07 15:07:25 +01002603 LY_CHECK_RET(ly_getutf8(&ncname, &uc, &size), -len);
Radek Krejcib1646a92018-11-02 16:08:26 +01002604 } while (is_xmlqnamechar(uc) && (uc != ':'));
2605
2606 return len;
2607}
2608
2609/**
Michal Vasko03ff5a72019-09-11 13:49:33 +02002610 * @brief Add @p token into the expression @p exp.
Radek Krejcib1646a92018-11-02 16:08:26 +01002611 *
Michal Vasko03ff5a72019-09-11 13:49:33 +02002612 * @param[in] ctx Context for logging.
Radek Krejcib1646a92018-11-02 16:08:26 +01002613 * @param[in] exp Expression to use.
2614 * @param[in] token Token to add.
Michal Vasko03ff5a72019-09-11 13:49:33 +02002615 * @param[in] tok_pos Token position in the XPath expression.
Radek Krejcib1646a92018-11-02 16:08:26 +01002616 * @param[in] tok_len Token length in the XPath expression.
Michal Vasko03ff5a72019-09-11 13:49:33 +02002617 * @return LY_ERR
Radek Krejcib1646a92018-11-02 16:08:26 +01002618 */
2619static LY_ERR
Michal Vasko14676352020-05-29 11:35:55 +02002620exp_add_token(const struct ly_ctx *ctx, struct lyxp_expr *exp, enum lyxp_token token, uint16_t tok_pos, uint16_t tok_len)
Radek Krejcib1646a92018-11-02 16:08:26 +01002621{
2622 uint32_t prev;
2623
2624 if (exp->used == exp->size) {
2625 prev = exp->size;
2626 exp->size += LYXP_EXPR_SIZE_STEP;
2627 if (prev > exp->size) {
2628 LOGINT(ctx);
2629 return LY_EINT;
2630 }
2631
2632 exp->tokens = ly_realloc(exp->tokens, exp->size * sizeof *exp->tokens);
2633 LY_CHECK_ERR_RET(!exp->tokens, LOGMEM(ctx), LY_EMEM);
2634 exp->tok_pos = ly_realloc(exp->tok_pos, exp->size * sizeof *exp->tok_pos);
2635 LY_CHECK_ERR_RET(!exp->tok_pos, LOGMEM(ctx), LY_EMEM);
2636 exp->tok_len = ly_realloc(exp->tok_len, exp->size * sizeof *exp->tok_len);
2637 LY_CHECK_ERR_RET(!exp->tok_len, LOGMEM(ctx), LY_EMEM);
2638 }
2639
2640 exp->tokens[exp->used] = token;
Michal Vasko03ff5a72019-09-11 13:49:33 +02002641 exp->tok_pos[exp->used] = tok_pos;
Radek Krejcib1646a92018-11-02 16:08:26 +01002642 exp->tok_len[exp->used] = tok_len;
2643 ++exp->used;
2644 return LY_SUCCESS;
2645}
2646
2647void
Michal Vasko14676352020-05-29 11:35:55 +02002648lyxp_expr_free(const struct ly_ctx *ctx, struct lyxp_expr *expr)
Radek Krejcib1646a92018-11-02 16:08:26 +01002649{
2650 uint16_t i;
2651
2652 if (!expr) {
2653 return;
2654 }
2655
2656 lydict_remove(ctx, expr->expr);
2657 free(expr->tokens);
2658 free(expr->tok_pos);
2659 free(expr->tok_len);
2660 if (expr->repeat) {
2661 for (i = 0; i < expr->used; ++i) {
2662 free(expr->repeat[i]);
2663 }
2664 }
2665 free(expr->repeat);
2666 free(expr);
2667}
2668
Radek Krejcif03a9e22020-09-18 20:09:31 +02002669LY_ERR
2670lyxp_expr_parse(const struct ly_ctx *ctx, const char *expr_str, size_t expr_len, ly_bool reparse, struct lyxp_expr **expr_p)
Radek Krejcib1646a92018-11-02 16:08:26 +01002671{
Radek Krejcif03a9e22020-09-18 20:09:31 +02002672 LY_ERR ret = LY_SUCCESS;
2673 struct lyxp_expr *expr;
Radek Krejcid4270262019-01-07 15:07:25 +01002674 size_t parsed = 0, tok_len;
Radek Krejcib1646a92018-11-02 16:08:26 +01002675 enum lyxp_token tok_type;
Radek Krejci857189e2020-09-01 13:26:36 +02002676 ly_bool prev_function_check = 0;
Michal Vasko004d3152020-06-11 19:59:22 +02002677 uint16_t tok_idx = 0;
Radek Krejcib1646a92018-11-02 16:08:26 +01002678
Radek Krejcif03a9e22020-09-18 20:09:31 +02002679 assert(expr_p);
2680
2681 if (!expr_str[0]) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01002682 LOGVAL(ctx, LY_VCODE_XP_EOF);
Radek Krejcif03a9e22020-09-18 20:09:31 +02002683 return LY_EVALID;
Michal Vasko004d3152020-06-11 19:59:22 +02002684 }
2685
2686 if (!expr_len) {
Radek Krejcif03a9e22020-09-18 20:09:31 +02002687 expr_len = strlen(expr_str);
Michal Vasko004d3152020-06-11 19:59:22 +02002688 }
2689 if (expr_len > UINT16_MAX) {
Michal Vasko623ac7b2021-04-09 12:44:23 +02002690 LOGVAL(ctx, LYVE_XPATH, "XPath expression cannot be longer than %u characters.", UINT16_MAX);
Radek Krejcif03a9e22020-09-18 20:09:31 +02002691 return LY_EVALID;
Radek Krejcib1646a92018-11-02 16:08:26 +01002692 }
2693
2694 /* init lyxp_expr structure */
Radek Krejcif03a9e22020-09-18 20:09:31 +02002695 expr = calloc(1, sizeof *expr);
2696 LY_CHECK_ERR_GOTO(!expr, LOGMEM(ctx); ret = LY_EMEM, error);
2697 LY_CHECK_GOTO(ret = lydict_insert(ctx, expr_str, expr_len, &expr->expr), error);
2698 expr->used = 0;
2699 expr->size = LYXP_EXPR_SIZE_START;
2700 expr->tokens = malloc(expr->size * sizeof *expr->tokens);
2701 LY_CHECK_ERR_GOTO(!expr->tokens, LOGMEM(ctx); ret = LY_EMEM, error);
Radek Krejcib1646a92018-11-02 16:08:26 +01002702
Radek Krejcif03a9e22020-09-18 20:09:31 +02002703 expr->tok_pos = malloc(expr->size * sizeof *expr->tok_pos);
2704 LY_CHECK_ERR_GOTO(!expr->tok_pos, LOGMEM(ctx); ret = LY_EMEM, error);
Radek Krejcib1646a92018-11-02 16:08:26 +01002705
Radek Krejcif03a9e22020-09-18 20:09:31 +02002706 expr->tok_len = malloc(expr->size * sizeof *expr->tok_len);
2707 LY_CHECK_ERR_GOTO(!expr->tok_len, LOGMEM(ctx); ret = LY_EMEM, error);
Radek Krejcib1646a92018-11-02 16:08:26 +01002708
Michal Vasko004d3152020-06-11 19:59:22 +02002709 /* make expr 0-terminated */
Radek Krejcif03a9e22020-09-18 20:09:31 +02002710 expr_str = expr->expr;
Michal Vasko004d3152020-06-11 19:59:22 +02002711
Radek Krejcif03a9e22020-09-18 20:09:31 +02002712 while (is_xmlws(expr_str[parsed])) {
Radek Krejcib1646a92018-11-02 16:08:26 +01002713 ++parsed;
2714 }
2715
2716 do {
Radek Krejcif03a9e22020-09-18 20:09:31 +02002717 if (expr_str[parsed] == '(') {
Radek Krejcib1646a92018-11-02 16:08:26 +01002718
2719 /* '(' */
2720 tok_len = 1;
2721 tok_type = LYXP_TOKEN_PAR1;
2722
Radek Krejcif03a9e22020-09-18 20:09:31 +02002723 if (prev_function_check && expr->used && (expr->tokens[expr->used - 1] == LYXP_TOKEN_NAMETEST)) {
Radek Krejcib1646a92018-11-02 16:08:26 +01002724 /* it is a NodeType/FunctionName after all */
Michal Vasko69730152020-10-09 16:30:07 +02002725 if (((expr->tok_len[expr->used - 1] == 4) &&
2726 (!strncmp(&expr_str[expr->tok_pos[expr->used - 1]], "node", 4) ||
2727 !strncmp(&expr_str[expr->tok_pos[expr->used - 1]], "text", 4))) ||
2728 ((expr->tok_len[expr->used - 1] == 7) &&
2729 !strncmp(&expr_str[expr->tok_pos[expr->used - 1]], "comment", 7))) {
Radek Krejcif03a9e22020-09-18 20:09:31 +02002730 expr->tokens[expr->used - 1] = LYXP_TOKEN_NODETYPE;
Radek Krejcib1646a92018-11-02 16:08:26 +01002731 } else {
Radek Krejcif03a9e22020-09-18 20:09:31 +02002732 expr->tokens[expr->used - 1] = LYXP_TOKEN_FUNCNAME;
Radek Krejcib1646a92018-11-02 16:08:26 +01002733 }
2734 prev_function_check = 0;
2735 }
2736
Radek Krejcif03a9e22020-09-18 20:09:31 +02002737 } else if (expr_str[parsed] == ')') {
Radek Krejcib1646a92018-11-02 16:08:26 +01002738
2739 /* ')' */
2740 tok_len = 1;
2741 tok_type = LYXP_TOKEN_PAR2;
2742
Radek Krejcif03a9e22020-09-18 20:09:31 +02002743 } else if (expr_str[parsed] == '[') {
Radek Krejcib1646a92018-11-02 16:08:26 +01002744
2745 /* '[' */
2746 tok_len = 1;
2747 tok_type = LYXP_TOKEN_BRACK1;
2748
Radek Krejcif03a9e22020-09-18 20:09:31 +02002749 } else if (expr_str[parsed] == ']') {
Radek Krejcib1646a92018-11-02 16:08:26 +01002750
2751 /* ']' */
2752 tok_len = 1;
2753 tok_type = LYXP_TOKEN_BRACK2;
2754
Radek Krejcif03a9e22020-09-18 20:09:31 +02002755 } else if (!strncmp(&expr_str[parsed], "..", 2)) {
Radek Krejcib1646a92018-11-02 16:08:26 +01002756
2757 /* '..' */
2758 tok_len = 2;
2759 tok_type = LYXP_TOKEN_DDOT;
2760
Radek Krejcif03a9e22020-09-18 20:09:31 +02002761 } else if ((expr_str[parsed] == '.') && (!isdigit(expr_str[parsed + 1]))) {
Radek Krejcib1646a92018-11-02 16:08:26 +01002762
2763 /* '.' */
2764 tok_len = 1;
2765 tok_type = LYXP_TOKEN_DOT;
2766
Radek Krejcif03a9e22020-09-18 20:09:31 +02002767 } else if (expr_str[parsed] == '@') {
Radek Krejcib1646a92018-11-02 16:08:26 +01002768
2769 /* '@' */
2770 tok_len = 1;
2771 tok_type = LYXP_TOKEN_AT;
2772
Radek Krejcif03a9e22020-09-18 20:09:31 +02002773 } else if (expr_str[parsed] == ',') {
Radek Krejcib1646a92018-11-02 16:08:26 +01002774
2775 /* ',' */
2776 tok_len = 1;
2777 tok_type = LYXP_TOKEN_COMMA;
2778
Radek Krejcif03a9e22020-09-18 20:09:31 +02002779 } else if (expr_str[parsed] == '\'') {
Radek Krejcib1646a92018-11-02 16:08:26 +01002780
2781 /* Literal with ' */
Radek Krejcif03a9e22020-09-18 20:09:31 +02002782 for (tok_len = 1; (expr_str[parsed + tok_len] != '\0') && (expr_str[parsed + tok_len] != '\''); ++tok_len) {}
2783 LY_CHECK_ERR_GOTO(expr_str[parsed + tok_len] == '\0',
Radek Krejci2efc45b2020-12-22 16:25:44 +01002784 LOGVAL(ctx, LY_VCODE_XP_EOE, expr_str[parsed], &expr_str[parsed]); ret = LY_EVALID,
Michal Vasko69730152020-10-09 16:30:07 +02002785 error);
Radek Krejcib1646a92018-11-02 16:08:26 +01002786 ++tok_len;
2787 tok_type = LYXP_TOKEN_LITERAL;
2788
Radek Krejcif03a9e22020-09-18 20:09:31 +02002789 } else if (expr_str[parsed] == '\"') {
Radek Krejcib1646a92018-11-02 16:08:26 +01002790
2791 /* Literal with " */
Radek Krejcif03a9e22020-09-18 20:09:31 +02002792 for (tok_len = 1; (expr_str[parsed + tok_len] != '\0') && (expr_str[parsed + tok_len] != '\"'); ++tok_len) {}
2793 LY_CHECK_ERR_GOTO(expr_str[parsed + tok_len] == '\0',
Radek Krejci2efc45b2020-12-22 16:25:44 +01002794 LOGVAL(ctx, LY_VCODE_XP_EOE, expr_str[parsed], &expr_str[parsed]); ret = LY_EVALID,
Michal Vasko69730152020-10-09 16:30:07 +02002795 error);
Radek Krejcib1646a92018-11-02 16:08:26 +01002796 ++tok_len;
2797 tok_type = LYXP_TOKEN_LITERAL;
2798
Radek Krejcif03a9e22020-09-18 20:09:31 +02002799 } else if ((expr_str[parsed] == '.') || (isdigit(expr_str[parsed]))) {
Radek Krejcib1646a92018-11-02 16:08:26 +01002800
2801 /* Number */
Radek Krejcif03a9e22020-09-18 20:09:31 +02002802 for (tok_len = 0; isdigit(expr_str[parsed + tok_len]); ++tok_len) {}
2803 if (expr_str[parsed + tok_len] == '.') {
Radek Krejcib1646a92018-11-02 16:08:26 +01002804 ++tok_len;
Radek Krejcif03a9e22020-09-18 20:09:31 +02002805 for ( ; isdigit(expr_str[parsed + tok_len]); ++tok_len) {}
Radek Krejcib1646a92018-11-02 16:08:26 +01002806 }
2807 tok_type = LYXP_TOKEN_NUMBER;
2808
aPiecekfba75362021-10-07 12:39:48 +02002809 } else if (expr_str[parsed] == '$') {
2810
2811 /* VariableReference */
2812 parsed++;
2813 long int ncname_len = parse_ncname(&expr_str[parsed]);
2814 LY_CHECK_ERR_GOTO(ncname_len < 1, LOGVAL(ctx, LY_VCODE_XP_INEXPR, expr_str[parsed - ncname_len],
2815 parsed - ncname_len + 1, expr_str); ret = LY_EVALID, error);
2816 tok_len = ncname_len;
2817 LY_CHECK_ERR_GOTO(expr_str[parsed + tok_len] == ':',
2818 LOGVAL(ctx, LYVE_XPATH, "Variable with prefix is not supported."); ret = LY_EVALID,
2819 error);
2820 tok_type = LYXP_TOKEN_VARREF;
2821
Radek Krejcif03a9e22020-09-18 20:09:31 +02002822 } else if (expr_str[parsed] == '/') {
Radek Krejcib1646a92018-11-02 16:08:26 +01002823
2824 /* Operator '/', '//' */
Radek Krejcif03a9e22020-09-18 20:09:31 +02002825 if (!strncmp(&expr_str[parsed], "//", 2)) {
Radek Krejcib1646a92018-11-02 16:08:26 +01002826 tok_len = 2;
Michal Vasko3e48bf32020-06-01 08:39:07 +02002827 tok_type = LYXP_TOKEN_OPER_RPATH;
Radek Krejcib1646a92018-11-02 16:08:26 +01002828 } else {
2829 tok_len = 1;
Michal Vasko3e48bf32020-06-01 08:39:07 +02002830 tok_type = LYXP_TOKEN_OPER_PATH;
Radek Krejcib1646a92018-11-02 16:08:26 +01002831 }
Radek Krejcib1646a92018-11-02 16:08:26 +01002832
Radek Krejcif03a9e22020-09-18 20:09:31 +02002833 } else if (!strncmp(&expr_str[parsed], "!=", 2)) {
Radek Krejcib1646a92018-11-02 16:08:26 +01002834
Michal Vasko3e48bf32020-06-01 08:39:07 +02002835 /* Operator '!=' */
Radek Krejcib1646a92018-11-02 16:08:26 +01002836 tok_len = 2;
Michal Vasko3e48bf32020-06-01 08:39:07 +02002837 tok_type = LYXP_TOKEN_OPER_NEQUAL;
2838
Radek Krejcif03a9e22020-09-18 20:09:31 +02002839 } else if (!strncmp(&expr_str[parsed], "<=", 2) || !strncmp(&expr_str[parsed], ">=", 2)) {
Michal Vasko3e48bf32020-06-01 08:39:07 +02002840
2841 /* Operator '<=', '>=' */
2842 tok_len = 2;
2843 tok_type = LYXP_TOKEN_OPER_COMP;
Radek Krejcib1646a92018-11-02 16:08:26 +01002844
Radek Krejcif03a9e22020-09-18 20:09:31 +02002845 } else if (expr_str[parsed] == '|') {
Radek Krejcib1646a92018-11-02 16:08:26 +01002846
2847 /* Operator '|' */
2848 tok_len = 1;
Michal Vasko3e48bf32020-06-01 08:39:07 +02002849 tok_type = LYXP_TOKEN_OPER_UNI;
Radek Krejcib1646a92018-11-02 16:08:26 +01002850
Radek Krejcif03a9e22020-09-18 20:09:31 +02002851 } else if ((expr_str[parsed] == '+') || (expr_str[parsed] == '-')) {
Radek Krejcib1646a92018-11-02 16:08:26 +01002852
2853 /* Operator '+', '-' */
2854 tok_len = 1;
Michal Vasko3e48bf32020-06-01 08:39:07 +02002855 tok_type = LYXP_TOKEN_OPER_MATH;
Radek Krejcib1646a92018-11-02 16:08:26 +01002856
Radek Krejcif03a9e22020-09-18 20:09:31 +02002857 } else if (expr_str[parsed] == '=') {
Radek Krejcib1646a92018-11-02 16:08:26 +01002858
Michal Vasko3e48bf32020-06-01 08:39:07 +02002859 /* Operator '=' */
Radek Krejcib1646a92018-11-02 16:08:26 +01002860 tok_len = 1;
Michal Vasko3e48bf32020-06-01 08:39:07 +02002861 tok_type = LYXP_TOKEN_OPER_EQUAL;
2862
Radek Krejcif03a9e22020-09-18 20:09:31 +02002863 } else if ((expr_str[parsed] == '<') || (expr_str[parsed] == '>')) {
Michal Vasko3e48bf32020-06-01 08:39:07 +02002864
2865 /* Operator '<', '>' */
2866 tok_len = 1;
2867 tok_type = LYXP_TOKEN_OPER_COMP;
Radek Krejcib1646a92018-11-02 16:08:26 +01002868
Michal Vasko69730152020-10-09 16:30:07 +02002869 } else if (expr->used && (expr->tokens[expr->used - 1] != LYXP_TOKEN_AT) &&
2870 (expr->tokens[expr->used - 1] != LYXP_TOKEN_PAR1) &&
2871 (expr->tokens[expr->used - 1] != LYXP_TOKEN_BRACK1) &&
2872 (expr->tokens[expr->used - 1] != LYXP_TOKEN_COMMA) &&
2873 (expr->tokens[expr->used - 1] != LYXP_TOKEN_OPER_LOG) &&
2874 (expr->tokens[expr->used - 1] != LYXP_TOKEN_OPER_EQUAL) &&
2875 (expr->tokens[expr->used - 1] != LYXP_TOKEN_OPER_NEQUAL) &&
2876 (expr->tokens[expr->used - 1] != LYXP_TOKEN_OPER_COMP) &&
2877 (expr->tokens[expr->used - 1] != LYXP_TOKEN_OPER_MATH) &&
2878 (expr->tokens[expr->used - 1] != LYXP_TOKEN_OPER_UNI) &&
2879 (expr->tokens[expr->used - 1] != LYXP_TOKEN_OPER_PATH) &&
2880 (expr->tokens[expr->used - 1] != LYXP_TOKEN_OPER_RPATH)) {
Radek Krejcib1646a92018-11-02 16:08:26 +01002881
2882 /* Operator '*', 'or', 'and', 'mod', or 'div' */
Radek Krejcif03a9e22020-09-18 20:09:31 +02002883 if (expr_str[parsed] == '*') {
Radek Krejcib1646a92018-11-02 16:08:26 +01002884 tok_len = 1;
Michal Vasko3e48bf32020-06-01 08:39:07 +02002885 tok_type = LYXP_TOKEN_OPER_MATH;
Radek Krejcib1646a92018-11-02 16:08:26 +01002886
Radek Krejcif03a9e22020-09-18 20:09:31 +02002887 } else if (!strncmp(&expr_str[parsed], "or", 2)) {
Radek Krejcib1646a92018-11-02 16:08:26 +01002888 tok_len = 2;
Michal Vasko3e48bf32020-06-01 08:39:07 +02002889 tok_type = LYXP_TOKEN_OPER_LOG;
Radek Krejcib1646a92018-11-02 16:08:26 +01002890
Radek Krejcif03a9e22020-09-18 20:09:31 +02002891 } else if (!strncmp(&expr_str[parsed], "and", 3)) {
Radek Krejcib1646a92018-11-02 16:08:26 +01002892 tok_len = 3;
Michal Vasko3e48bf32020-06-01 08:39:07 +02002893 tok_type = LYXP_TOKEN_OPER_LOG;
Radek Krejcib1646a92018-11-02 16:08:26 +01002894
Radek Krejcif03a9e22020-09-18 20:09:31 +02002895 } else if (!strncmp(&expr_str[parsed], "mod", 3) || !strncmp(&expr_str[parsed], "div", 3)) {
Radek Krejcib1646a92018-11-02 16:08:26 +01002896 tok_len = 3;
Michal Vasko3e48bf32020-06-01 08:39:07 +02002897 tok_type = LYXP_TOKEN_OPER_MATH;
Radek Krejcib1646a92018-11-02 16:08:26 +01002898
2899 } else if (prev_function_check) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01002900 LOGVAL(ctx, LYVE_XPATH, "Invalid character 0x%x ('%c'), perhaps \"%.*s\" is supposed to be a function call.",
Michal Vasko69730152020-10-09 16:30:07 +02002901 expr_str[parsed], expr_str[parsed], expr->tok_len[expr->used - 1], &expr->expr[expr->tok_pos[expr->used - 1]]);
Radek Krejcif03a9e22020-09-18 20:09:31 +02002902 ret = LY_EVALID;
Radek Krejcib1646a92018-11-02 16:08:26 +01002903 goto error;
2904 } else {
Michal Vasko774ce402021-04-14 15:35:06 +02002905 LOGVAL(ctx, LY_VCODE_XP_INEXPR, expr_str[parsed], parsed + 1, expr_str);
Radek Krejcif03a9e22020-09-18 20:09:31 +02002906 ret = LY_EVALID;
Radek Krejcib1646a92018-11-02 16:08:26 +01002907 goto error;
2908 }
Radek Krejcif03a9e22020-09-18 20:09:31 +02002909 } else if (expr_str[parsed] == '*') {
Radek Krejcib1646a92018-11-02 16:08:26 +01002910
2911 /* NameTest '*' */
2912 tok_len = 1;
2913 tok_type = LYXP_TOKEN_NAMETEST;
2914
2915 } else {
2916
2917 /* NameTest (NCName ':' '*' | QName) or NodeType/FunctionName */
Radek Krejcif03a9e22020-09-18 20:09:31 +02002918 long int ncname_len = parse_ncname(&expr_str[parsed]);
Michal Vaskoe2be5462021-08-04 10:49:42 +02002919 LY_CHECK_ERR_GOTO(ncname_len < 1, LOGVAL(ctx, LY_VCODE_XP_INEXPR, expr_str[parsed - ncname_len],
Michal Vasko774ce402021-04-14 15:35:06 +02002920 parsed - ncname_len + 1, expr_str); ret = LY_EVALID, error);
Radek Krejcib1646a92018-11-02 16:08:26 +01002921 tok_len = ncname_len;
2922
Radek Krejcif03a9e22020-09-18 20:09:31 +02002923 if (expr_str[parsed + tok_len] == ':') {
Radek Krejcib1646a92018-11-02 16:08:26 +01002924 ++tok_len;
Radek Krejcif03a9e22020-09-18 20:09:31 +02002925 if (expr_str[parsed + tok_len] == '*') {
Radek Krejcib1646a92018-11-02 16:08:26 +01002926 ++tok_len;
2927 } else {
Radek Krejcif03a9e22020-09-18 20:09:31 +02002928 ncname_len = parse_ncname(&expr_str[parsed + tok_len]);
Michal Vaskoe2be5462021-08-04 10:49:42 +02002929 LY_CHECK_ERR_GOTO(ncname_len < 1, LOGVAL(ctx, LY_VCODE_XP_INEXPR, expr_str[parsed - ncname_len],
Michal Vasko774ce402021-04-14 15:35:06 +02002930 parsed - ncname_len + 1, expr_str); ret = LY_EVALID, error);
Radek Krejcib1646a92018-11-02 16:08:26 +01002931 tok_len += ncname_len;
2932 }
2933 /* remove old flag to prevent ambiguities */
2934 prev_function_check = 0;
2935 tok_type = LYXP_TOKEN_NAMETEST;
2936 } else {
2937 /* there is no prefix so it can still be NodeType/FunctionName, we can't finally decide now */
2938 prev_function_check = 1;
2939 tok_type = LYXP_TOKEN_NAMETEST;
2940 }
2941 }
2942
2943 /* store the token, move on to the next one */
Radek Krejcif03a9e22020-09-18 20:09:31 +02002944 LY_CHECK_GOTO(ret = exp_add_token(ctx, expr, tok_type, parsed, tok_len), error);
Radek Krejcib1646a92018-11-02 16:08:26 +01002945 parsed += tok_len;
Radek Krejcif03a9e22020-09-18 20:09:31 +02002946 while (is_xmlws(expr_str[parsed])) {
Radek Krejcib1646a92018-11-02 16:08:26 +01002947 ++parsed;
2948 }
2949
Radek Krejcif03a9e22020-09-18 20:09:31 +02002950 } while (expr_str[parsed]);
Radek Krejcib1646a92018-11-02 16:08:26 +01002951
Michal Vasko004d3152020-06-11 19:59:22 +02002952 if (reparse) {
2953 /* prealloc repeat */
Radek Krejcif03a9e22020-09-18 20:09:31 +02002954 expr->repeat = calloc(expr->size, sizeof *expr->repeat);
2955 LY_CHECK_ERR_GOTO(!expr->repeat, LOGMEM(ctx); ret = LY_EMEM, error);
Radek Krejcib1646a92018-11-02 16:08:26 +01002956
Michal Vasko004d3152020-06-11 19:59:22 +02002957 /* fill repeat */
aPiecekbf968d92021-05-27 14:35:05 +02002958 LY_CHECK_ERR_GOTO(reparse_or_expr(ctx, expr, &tok_idx, 0), ret = LY_EVALID, error);
Radek Krejcif03a9e22020-09-18 20:09:31 +02002959 if (expr->used > tok_idx) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01002960 LOGVAL(ctx, LYVE_XPATH, "Unparsed characters \"%s\" left at the end of an XPath expression.",
Michal Vasko69730152020-10-09 16:30:07 +02002961 &expr->expr[expr->tok_pos[tok_idx]]);
Radek Krejcif03a9e22020-09-18 20:09:31 +02002962 ret = LY_EVALID;
Michal Vasko004d3152020-06-11 19:59:22 +02002963 goto error;
2964 }
Michal Vasko03ff5a72019-09-11 13:49:33 +02002965 }
2966
Radek Krejcif03a9e22020-09-18 20:09:31 +02002967 print_expr_struct_debug(expr);
2968 *expr_p = expr;
2969 return LY_SUCCESS;
Radek Krejcib1646a92018-11-02 16:08:26 +01002970
2971error:
Radek Krejcif03a9e22020-09-18 20:09:31 +02002972 lyxp_expr_free(ctx, expr);
2973 return ret;
Radek Krejcib1646a92018-11-02 16:08:26 +01002974}
2975
Michal Vasko1734be92020-09-22 08:55:10 +02002976LY_ERR
2977lyxp_expr_dup(const struct ly_ctx *ctx, const struct lyxp_expr *exp, struct lyxp_expr **dup_p)
Michal Vasko004d3152020-06-11 19:59:22 +02002978{
Michal Vasko1734be92020-09-22 08:55:10 +02002979 LY_ERR ret = LY_SUCCESS;
2980 struct lyxp_expr *dup = NULL;
Michal Vasko004d3152020-06-11 19:59:22 +02002981 uint32_t i, j;
2982
Michal Vasko7f45cf22020-10-01 12:49:44 +02002983 if (!exp) {
2984 goto cleanup;
2985 }
2986
Michal Vasko004d3152020-06-11 19:59:22 +02002987 dup = calloc(1, sizeof *dup);
Michal Vasko1734be92020-09-22 08:55:10 +02002988 LY_CHECK_ERR_GOTO(!dup, LOGMEM(ctx); ret = LY_EMEM, cleanup);
Michal Vasko004d3152020-06-11 19:59:22 +02002989
Michal Vasko08e9b112021-06-11 15:41:17 +02002990 if (exp->used) {
2991 dup->tokens = malloc(exp->used * sizeof *dup->tokens);
2992 LY_CHECK_ERR_GOTO(!dup->tokens, LOGMEM(ctx); ret = LY_EMEM, cleanup);
2993 memcpy(dup->tokens, exp->tokens, exp->used * sizeof *dup->tokens);
Michal Vasko004d3152020-06-11 19:59:22 +02002994
Michal Vasko08e9b112021-06-11 15:41:17 +02002995 dup->tok_pos = malloc(exp->used * sizeof *dup->tok_pos);
2996 LY_CHECK_ERR_GOTO(!dup->tok_pos, LOGMEM(ctx); ret = LY_EMEM, cleanup);
2997 memcpy(dup->tok_pos, exp->tok_pos, exp->used * sizeof *dup->tok_pos);
Michal Vasko004d3152020-06-11 19:59:22 +02002998
Michal Vasko08e9b112021-06-11 15:41:17 +02002999 dup->tok_len = malloc(exp->used * sizeof *dup->tok_len);
3000 LY_CHECK_ERR_GOTO(!dup->tok_len, LOGMEM(ctx); ret = LY_EMEM, cleanup);
3001 memcpy(dup->tok_len, exp->tok_len, exp->used * sizeof *dup->tok_len);
Michal Vasko004d3152020-06-11 19:59:22 +02003002
Michal Vasko08e9b112021-06-11 15:41:17 +02003003 dup->repeat = malloc(exp->used * sizeof *dup->repeat);
3004 LY_CHECK_ERR_GOTO(!dup->repeat, LOGMEM(ctx); ret = LY_EMEM, cleanup);
3005 for (i = 0; i < exp->used; ++i) {
3006 if (!exp->repeat[i]) {
3007 dup->repeat[i] = NULL;
3008 } else {
3009 for (j = 0; exp->repeat[i][j]; ++j) {}
3010 /* the ending 0 as well */
3011 ++j;
Michal Vasko004d3152020-06-11 19:59:22 +02003012
Michal Vasko08e9b112021-06-11 15:41:17 +02003013 dup->repeat[i] = malloc(j * sizeof **dup->repeat);
3014 LY_CHECK_ERR_GOTO(!dup->repeat[i], LOGMEM(ctx); ret = LY_EMEM, cleanup);
3015 memcpy(dup->repeat[i], exp->repeat[i], j * sizeof **dup->repeat);
3016 dup->repeat[i][j - 1] = 0;
3017 }
Michal Vasko004d3152020-06-11 19:59:22 +02003018 }
3019 }
3020
3021 dup->used = exp->used;
3022 dup->size = exp->used;
Michal Vasko1734be92020-09-22 08:55:10 +02003023 LY_CHECK_GOTO(ret = lydict_insert(ctx, exp->expr, 0, &dup->expr), cleanup);
Michal Vasko004d3152020-06-11 19:59:22 +02003024
Michal Vasko1734be92020-09-22 08:55:10 +02003025cleanup:
3026 if (ret) {
3027 lyxp_expr_free(ctx, dup);
3028 } else {
3029 *dup_p = dup;
3030 }
3031 return ret;
Michal Vasko004d3152020-06-11 19:59:22 +02003032}
3033
Michal Vasko03ff5a72019-09-11 13:49:33 +02003034/**
3035 * @brief Get the last-added schema node that is currently in the context.
3036 *
3037 * @param[in] set Set to search in.
3038 * @return Last-added schema context node, NULL if no node is in context.
3039 */
3040static struct lysc_node *
3041warn_get_scnode_in_ctx(struct lyxp_set *set)
3042{
3043 uint32_t i;
3044
3045 if (!set || (set->type != LYXP_SET_SCNODE_SET)) {
3046 return NULL;
3047 }
3048
3049 i = set->used;
3050 do {
3051 --i;
Radek Krejcif13b87b2020-12-01 22:02:17 +01003052 if (set->val.scnodes[i].in_ctx == LYXP_SET_SCNODE_ATOM_CTX) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02003053 /* if there are more, simply return the first found (last added) */
3054 return set->val.scnodes[i].scnode;
3055 }
3056 } while (i);
3057
3058 return NULL;
3059}
3060
3061/**
3062 * @brief Test whether a type is numeric - integer type or decimal64.
3063 *
3064 * @param[in] type Type to test.
Radek Krejci857189e2020-09-01 13:26:36 +02003065 * @return Boolean value whether @p type is numeric type or not.
Michal Vasko03ff5a72019-09-11 13:49:33 +02003066 */
Radek Krejci857189e2020-09-01 13:26:36 +02003067static ly_bool
Michal Vasko03ff5a72019-09-11 13:49:33 +02003068warn_is_numeric_type(struct lysc_type *type)
3069{
3070 struct lysc_type_union *uni;
Radek Krejci857189e2020-09-01 13:26:36 +02003071 ly_bool ret;
Michal Vaskofd69e1d2020-07-03 11:57:17 +02003072 LY_ARRAY_COUNT_TYPE u;
Michal Vasko03ff5a72019-09-11 13:49:33 +02003073
3074 switch (type->basetype) {
3075 case LY_TYPE_DEC64:
3076 case LY_TYPE_INT8:
3077 case LY_TYPE_UINT8:
3078 case LY_TYPE_INT16:
3079 case LY_TYPE_UINT16:
3080 case LY_TYPE_INT32:
3081 case LY_TYPE_UINT32:
3082 case LY_TYPE_INT64:
3083 case LY_TYPE_UINT64:
3084 return 1;
3085 case LY_TYPE_UNION:
3086 uni = (struct lysc_type_union *)type;
Radek Krejci7eb54ba2020-05-18 16:30:04 +02003087 LY_ARRAY_FOR(uni->types, u) {
3088 ret = warn_is_numeric_type(uni->types[u]);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003089 if (ret) {
3090 /* found a suitable type */
Radek Krejci857189e2020-09-01 13:26:36 +02003091 return ret;
Michal Vasko03ff5a72019-09-11 13:49:33 +02003092 }
3093 }
3094 /* did not find any suitable type */
3095 return 0;
3096 case LY_TYPE_LEAFREF:
3097 return warn_is_numeric_type(((struct lysc_type_leafref *)type)->realtype);
3098 default:
3099 return 0;
3100 }
3101}
3102
3103/**
3104 * @brief Test whether a type is string-like - no integers, decimal64 or binary.
3105 *
3106 * @param[in] type Type to test.
Radek Krejci857189e2020-09-01 13:26:36 +02003107 * @return Boolean value whether @p type's basetype is string type or not.
Michal Vasko03ff5a72019-09-11 13:49:33 +02003108 */
Radek Krejci857189e2020-09-01 13:26:36 +02003109static ly_bool
Michal Vasko03ff5a72019-09-11 13:49:33 +02003110warn_is_string_type(struct lysc_type *type)
3111{
3112 struct lysc_type_union *uni;
Radek Krejci857189e2020-09-01 13:26:36 +02003113 ly_bool ret;
Michal Vaskofd69e1d2020-07-03 11:57:17 +02003114 LY_ARRAY_COUNT_TYPE u;
Michal Vasko03ff5a72019-09-11 13:49:33 +02003115
3116 switch (type->basetype) {
3117 case LY_TYPE_BITS:
3118 case LY_TYPE_ENUM:
3119 case LY_TYPE_IDENT:
3120 case LY_TYPE_INST:
3121 case LY_TYPE_STRING:
3122 return 1;
3123 case LY_TYPE_UNION:
3124 uni = (struct lysc_type_union *)type;
Radek Krejci7eb54ba2020-05-18 16:30:04 +02003125 LY_ARRAY_FOR(uni->types, u) {
3126 ret = warn_is_string_type(uni->types[u]);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003127 if (ret) {
3128 /* found a suitable type */
Radek Krejci857189e2020-09-01 13:26:36 +02003129 return ret;
Michal Vasko03ff5a72019-09-11 13:49:33 +02003130 }
3131 }
3132 /* did not find any suitable type */
3133 return 0;
3134 case LY_TYPE_LEAFREF:
3135 return warn_is_string_type(((struct lysc_type_leafref *)type)->realtype);
3136 default:
3137 return 0;
3138 }
3139}
3140
3141/**
3142 * @brief Test whether a type is one specific type.
3143 *
3144 * @param[in] type Type to test.
3145 * @param[in] base Expected type.
Radek Krejci857189e2020-09-01 13:26:36 +02003146 * @return Boolean value whether the given @p type is of the specific basetype @p base.
Michal Vasko03ff5a72019-09-11 13:49:33 +02003147 */
Radek Krejci857189e2020-09-01 13:26:36 +02003148static ly_bool
Michal Vasko03ff5a72019-09-11 13:49:33 +02003149warn_is_specific_type(struct lysc_type *type, LY_DATA_TYPE base)
3150{
3151 struct lysc_type_union *uni;
Radek Krejci857189e2020-09-01 13:26:36 +02003152 ly_bool ret;
Michal Vaskofd69e1d2020-07-03 11:57:17 +02003153 LY_ARRAY_COUNT_TYPE u;
Michal Vasko03ff5a72019-09-11 13:49:33 +02003154
3155 if (type->basetype == base) {
3156 return 1;
3157 } else if (type->basetype == LY_TYPE_UNION) {
3158 uni = (struct lysc_type_union *)type;
Radek Krejci7eb54ba2020-05-18 16:30:04 +02003159 LY_ARRAY_FOR(uni->types, u) {
3160 ret = warn_is_specific_type(uni->types[u], base);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003161 if (ret) {
3162 /* found a suitable type */
Radek Krejci857189e2020-09-01 13:26:36 +02003163 return ret;
Michal Vasko03ff5a72019-09-11 13:49:33 +02003164 }
3165 }
3166 /* did not find any suitable type */
3167 return 0;
3168 } else if (type->basetype == LY_TYPE_LEAFREF) {
3169 return warn_is_specific_type(((struct lysc_type_leafref *)type)->realtype, base);
3170 }
3171
3172 return 0;
3173}
3174
3175/**
3176 * @brief Get next type of a (union) type.
3177 *
3178 * @param[in] type Base type.
3179 * @param[in] prev_type Previously returned type.
3180 * @return Next type or NULL.
3181 */
3182static struct lysc_type *
3183warn_is_equal_type_next_type(struct lysc_type *type, struct lysc_type *prev_type)
3184{
3185 struct lysc_type_union *uni;
Radek Krejci857189e2020-09-01 13:26:36 +02003186 ly_bool found = 0;
Michal Vaskofd69e1d2020-07-03 11:57:17 +02003187 LY_ARRAY_COUNT_TYPE u;
Michal Vasko03ff5a72019-09-11 13:49:33 +02003188
3189 switch (type->basetype) {
3190 case LY_TYPE_UNION:
3191 uni = (struct lysc_type_union *)type;
3192 if (!prev_type) {
3193 return uni->types[0];
3194 }
Radek Krejci7eb54ba2020-05-18 16:30:04 +02003195 LY_ARRAY_FOR(uni->types, u) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02003196 if (found) {
Radek Krejci7eb54ba2020-05-18 16:30:04 +02003197 return uni->types[u];
Michal Vasko03ff5a72019-09-11 13:49:33 +02003198 }
Radek Krejci7eb54ba2020-05-18 16:30:04 +02003199 if (prev_type == uni->types[u]) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02003200 found = 1;
3201 }
3202 }
3203 return NULL;
3204 default:
3205 if (prev_type) {
3206 assert(type == prev_type);
3207 return NULL;
3208 } else {
3209 return type;
3210 }
3211 }
3212}
3213
3214/**
3215 * @brief Test whether 2 types have a common type.
3216 *
3217 * @param[in] type1 First type.
3218 * @param[in] type2 Second type.
3219 * @return 1 if they do, 0 otherwise.
3220 */
3221static int
3222warn_is_equal_type(struct lysc_type *type1, struct lysc_type *type2)
3223{
3224 struct lysc_type *t1, *rt1, *t2, *rt2;
3225
3226 t1 = NULL;
3227 while ((t1 = warn_is_equal_type_next_type(type1, t1))) {
3228 if (t1->basetype == LY_TYPE_LEAFREF) {
3229 rt1 = ((struct lysc_type_leafref *)t1)->realtype;
3230 } else {
3231 rt1 = t1;
3232 }
3233
3234 t2 = NULL;
3235 while ((t2 = warn_is_equal_type_next_type(type2, t2))) {
3236 if (t2->basetype == LY_TYPE_LEAFREF) {
3237 rt2 = ((struct lysc_type_leafref *)t2)->realtype;
3238 } else {
3239 rt2 = t2;
3240 }
3241
3242 if (rt2->basetype == rt1->basetype) {
3243 /* match found */
3244 return 1;
3245 }
3246 }
3247 }
3248
3249 return 0;
3250}
3251
3252/**
Michal Vaskoaa956522021-11-11 10:45:34 +01003253 * @brief Print warning with information about the XPath subexpression that caused previous warning.
3254 *
3255 * @param[in] ctx Context for logging.
3256 * @param[in] tok_pos Index of the subexpression in the whole expression.
3257 * @param[in] subexpr Subexpression start.
3258 * @param[in] subexpr_len Length of @p subexpr to print.
3259 * @param[in] cur_scnode Expression context node.
3260 */
3261static void
3262warn_subexpr_log(const struct ly_ctx *ctx, uint16_t tok_pos, const char *subexpr, int subexpr_len,
3263 const struct lysc_node *cur_scnode)
3264{
3265 char *path;
3266
3267 path = lysc_path(cur_scnode, LYSC_PATH_LOG, NULL, 0);
3268 LOGWRN(ctx, "Previous warning generated by XPath subexpression[%" PRIu16 "] \"%.*s\" with context node \"%s\".",
3269 tok_pos, subexpr_len, subexpr, path);
3270 free(path);
3271}
3272
3273/**
Michal Vasko03ff5a72019-09-11 13:49:33 +02003274 * @brief Check both operands of comparison operators.
3275 *
3276 * @param[in] ctx Context for errors.
3277 * @param[in] set1 First operand set.
3278 * @param[in] set2 Second operand set.
3279 * @param[in] numbers_only Whether accept only numbers or other types are fine too (for '=' and '!=').
3280 * @param[in] expr Start of the expression to print with the warning.
3281 * @param[in] tok_pos Token position.
3282 */
3283static void
Michal Vaskoaa956522021-11-11 10:45:34 +01003284warn_operands(struct ly_ctx *ctx, struct lyxp_set *set1, struct lyxp_set *set2, ly_bool numbers_only, const char *expr,
3285 uint16_t tok_pos)
Michal Vasko03ff5a72019-09-11 13:49:33 +02003286{
3287 struct lysc_node_leaf *node1, *node2;
Radek Krejci857189e2020-09-01 13:26:36 +02003288 ly_bool leaves = 1, warning = 0;
Michal Vasko03ff5a72019-09-11 13:49:33 +02003289
3290 node1 = (struct lysc_node_leaf *)warn_get_scnode_in_ctx(set1);
3291 node2 = (struct lysc_node_leaf *)warn_get_scnode_in_ctx(set2);
3292
3293 if (!node1 && !node2) {
3294 /* no node-sets involved, nothing to do */
3295 return;
3296 }
3297
3298 if (node1) {
3299 if (!(node1->nodetype & (LYS_LEAF | LYS_LEAFLIST))) {
3300 LOGWRN(ctx, "Node type %s \"%s\" used as operand.", lys_nodetype2str(node1->nodetype), node1->name);
3301 warning = 1;
3302 leaves = 0;
3303 } else if (numbers_only && !warn_is_numeric_type(node1->type)) {
3304 LOGWRN(ctx, "Node \"%s\" is not of a numeric type, but used where it was expected.", node1->name);
3305 warning = 1;
3306 }
3307 }
3308
3309 if (node2) {
3310 if (!(node2->nodetype & (LYS_LEAF | LYS_LEAFLIST))) {
3311 LOGWRN(ctx, "Node type %s \"%s\" used as operand.", lys_nodetype2str(node2->nodetype), node2->name);
3312 warning = 1;
3313 leaves = 0;
3314 } else if (numbers_only && !warn_is_numeric_type(node2->type)) {
3315 LOGWRN(ctx, "Node \"%s\" is not of a numeric type, but used where it was expected.", node2->name);
3316 warning = 1;
3317 }
3318 }
3319
3320 if (node1 && node2 && leaves && !numbers_only) {
Michal Vasko69730152020-10-09 16:30:07 +02003321 if ((warn_is_numeric_type(node1->type) && !warn_is_numeric_type(node2->type)) ||
3322 (!warn_is_numeric_type(node1->type) && warn_is_numeric_type(node2->type)) ||
3323 (!warn_is_numeric_type(node1->type) && !warn_is_numeric_type(node2->type) &&
3324 !warn_is_equal_type(node1->type, node2->type))) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02003325 LOGWRN(ctx, "Incompatible types of operands \"%s\" and \"%s\" for comparison.", node1->name, node2->name);
3326 warning = 1;
3327 }
3328 }
3329
3330 if (warning) {
Michal Vaskoaa956522021-11-11 10:45:34 +01003331 warn_subexpr_log(ctx, tok_pos, expr + tok_pos, 20, set1->cur_scnode);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003332 }
3333}
3334
3335/**
3336 * @brief Check that a value is valid for a leaf. If not applicable, does nothing.
3337 *
3338 * @param[in] exp Parsed XPath expression.
3339 * @param[in] set Set with the leaf/leaf-list.
3340 * @param[in] val_exp Index of the value (literal/number) in @p exp.
3341 * @param[in] equal_exp Index of the start of the equality expression in @p exp.
3342 * @param[in] last_equal_exp Index of the end of the equality expression in @p exp.
3343 */
3344static void
Michal Vasko40308e72020-10-20 16:38:40 +02003345warn_equality_value(const struct lyxp_expr *exp, struct lyxp_set *set, uint16_t val_exp, uint16_t equal_exp,
3346 uint16_t last_equal_exp)
Michal Vasko03ff5a72019-09-11 13:49:33 +02003347{
3348 struct lysc_node *scnode;
3349 struct lysc_type *type;
3350 char *value;
Michal Vaskoba99a3e2020-08-18 15:50:05 +02003351 struct lyd_value storage;
Michal Vasko03ff5a72019-09-11 13:49:33 +02003352 LY_ERR rc;
3353 struct ly_err_item *err = NULL;
3354
Michal Vasko69730152020-10-09 16:30:07 +02003355 if ((scnode = warn_get_scnode_in_ctx(set)) && (scnode->nodetype & (LYS_LEAF | LYS_LEAFLIST)) &&
3356 ((exp->tokens[val_exp] == LYXP_TOKEN_LITERAL) || (exp->tokens[val_exp] == LYXP_TOKEN_NUMBER))) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02003357 /* check that the node can have the specified value */
3358 if (exp->tokens[val_exp] == LYXP_TOKEN_LITERAL) {
3359 value = strndup(exp->expr + exp->tok_pos[val_exp] + 1, exp->tok_len[val_exp] - 2);
3360 } else {
3361 value = strndup(exp->expr + exp->tok_pos[val_exp], exp->tok_len[val_exp]);
3362 }
3363 if (!value) {
3364 LOGMEM(set->ctx);
3365 return;
3366 }
3367
3368 if ((((struct lysc_node_leaf *)scnode)->type->basetype == LY_TYPE_IDENT) && !strchr(value, ':')) {
3369 LOGWRN(set->ctx, "Identityref \"%s\" comparison with identity \"%s\" without prefix, consider adding"
Michal Vasko69730152020-10-09 16:30:07 +02003370 " a prefix or best using \"derived-from(-or-self)()\" functions.", scnode->name, value);
Michal Vaskoaa956522021-11-11 10:45:34 +01003371 warn_subexpr_log(set->ctx, exp->tok_pos[equal_exp], exp->expr + exp->tok_pos[equal_exp],
Radek Krejci0f969882020-08-21 16:56:47 +02003372 (exp->tok_pos[last_equal_exp] - exp->tok_pos[equal_exp]) + exp->tok_len[last_equal_exp],
Michal Vaskoaa956522021-11-11 10:45:34 +01003373 set->cur_scnode);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003374 }
3375
3376 type = ((struct lysc_node_leaf *)scnode)->type;
3377 if (type->basetype != LY_TYPE_IDENT) {
Michal Vasko5d24f6c2020-10-13 13:49:06 +02003378 rc = type->plugin->store(set->ctx, type, value, strlen(value), 0, set->format, set->prefix_data,
Michal Vasko405cc9e2020-12-01 12:01:27 +01003379 LYD_HINT_DATA, scnode, &storage, NULL, &err);
Michal Vaskobf42e832020-11-23 16:59:42 +01003380 if (rc == LY_EINCOMPLETE) {
3381 rc = LY_SUCCESS;
3382 }
Michal Vasko03ff5a72019-09-11 13:49:33 +02003383
3384 if (err) {
3385 LOGWRN(set->ctx, "Invalid value \"%s\" which does not fit the type (%s).", value, err->msg);
3386 ly_err_free(err);
3387 } else if (rc != LY_SUCCESS) {
3388 LOGWRN(set->ctx, "Invalid value \"%s\" which does not fit the type.", value);
3389 }
3390 if (rc != LY_SUCCESS) {
Michal Vaskoaa956522021-11-11 10:45:34 +01003391 warn_subexpr_log(set->ctx, exp->tok_pos[equal_exp], exp->expr + exp->tok_pos[equal_exp],
Radek Krejci0f969882020-08-21 16:56:47 +02003392 (exp->tok_pos[last_equal_exp] - exp->tok_pos[equal_exp]) + exp->tok_len[last_equal_exp],
Michal Vaskoaa956522021-11-11 10:45:34 +01003393 set->cur_scnode);
Michal Vaskoba99a3e2020-08-18 15:50:05 +02003394 } else {
3395 type->plugin->free(set->ctx, &storage);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003396 }
3397 }
3398 free(value);
3399 }
3400}
3401
3402/*
3403 * XPath functions
3404 */
3405
3406/**
3407 * @brief Execute the YANG 1.1 bit-is-set(node-set, string) function. Returns LYXP_SET_BOOLEAN
3408 * depending on whether the first node bit value from the second argument is set.
3409 *
3410 * @param[in] args Array of arguments.
3411 * @param[in] arg_count Count of elements in @p args.
3412 * @param[in,out] set Context and result set at the same time.
3413 * @param[in] options XPath options.
Michal Vasko0cbf54f2019-12-16 10:01:06 +01003414 * @return LY_ERR
Michal Vasko03ff5a72019-09-11 13:49:33 +02003415 */
3416static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02003417xpath_bit_is_set(struct lyxp_set **args, uint16_t UNUSED(arg_count), struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02003418{
3419 struct lyd_node_term *leaf;
3420 struct lysc_node_leaf *sleaf;
Michal Vasko2588b952021-07-29 07:43:26 +02003421 struct lyd_value_bits *bits;
Michal Vasko03ff5a72019-09-11 13:49:33 +02003422 LY_ERR rc = LY_SUCCESS;
Michal Vaskofd69e1d2020-07-03 11:57:17 +02003423 LY_ARRAY_COUNT_TYPE u;
Michal Vasko03ff5a72019-09-11 13:49:33 +02003424
3425 if (options & LYXP_SCNODE_ALL) {
Michal Vasko5676f4e2021-04-06 17:14:45 +02003426 if (args[0]->type != LYXP_SET_SCNODE_SET) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02003427 LOGWRN(set->ctx, "Argument #1 of %s not a node-set as expected.", __func__);
Michal Vasko5676f4e2021-04-06 17:14:45 +02003428 } else if ((sleaf = (struct lysc_node_leaf *)warn_get_scnode_in_ctx(args[0]))) {
3429 if (!(sleaf->nodetype & (LYS_LEAF | LYS_LEAFLIST))) {
3430 LOGWRN(set->ctx, "Argument #1 of %s is a %s node \"%s\".", __func__, lys_nodetype2str(sleaf->nodetype),
3431 sleaf->name);
3432 } else if (!warn_is_specific_type(sleaf->type, LY_TYPE_BITS)) {
3433 LOGWRN(set->ctx, "Argument #1 of %s is node \"%s\", not of type \"bits\".", __func__, sleaf->name);
3434 }
Michal Vasko03ff5a72019-09-11 13:49:33 +02003435 }
3436
3437 if ((args[1]->type == LYXP_SET_SCNODE_SET) && (sleaf = (struct lysc_node_leaf *)warn_get_scnode_in_ctx(args[1]))) {
3438 if (!(sleaf->nodetype & (LYS_LEAF | LYS_LEAFLIST))) {
Michal Vasko5676f4e2021-04-06 17:14:45 +02003439 LOGWRN(set->ctx, "Argument #2 of %s is a %s node \"%s\".", __func__, lys_nodetype2str(sleaf->nodetype),
3440 sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003441 } else if (!warn_is_string_type(sleaf->type)) {
3442 LOGWRN(set->ctx, "Argument #2 of %s is node \"%s\", not of string-type.", __func__, sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003443 }
3444 }
Michal Vasko1a09b212021-05-06 13:00:10 +02003445 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_VAL);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003446 return rc;
3447 }
3448
Michal Vaskod3678892020-05-21 10:06:58 +02003449 if (args[0]->type != LYXP_SET_NODE_SET) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01003450 LOGVAL(set->ctx, LY_VCODE_XP_INARGTYPE, 1, print_set_type(args[0]), "bit-is-set(node-set, string)");
Michal Vasko03ff5a72019-09-11 13:49:33 +02003451 return LY_EVALID;
3452 }
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01003453 rc = lyxp_set_cast(args[1], LYXP_SET_STRING);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003454 LY_CHECK_RET(rc);
3455
3456 set_fill_boolean(set, 0);
Michal Vaskod3678892020-05-21 10:06:58 +02003457 if (args[0]->used) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02003458 leaf = (struct lyd_node_term *)args[0]->val.nodes[0].node;
Michal Vasko2588b952021-07-29 07:43:26 +02003459 if ((leaf->schema->nodetype & (LYS_LEAF | LYS_LEAFLIST)) && (leaf->value.realtype->basetype == LY_TYPE_BITS)) {
3460 LYD_VALUE_GET(&leaf->value, bits);
3461 LY_ARRAY_FOR(bits->items, u) {
3462 if (!strcmp(bits->items[u]->name, args[1]->val.str)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02003463 set_fill_boolean(set, 1);
3464 break;
3465 }
3466 }
3467 }
3468 }
3469
3470 return LY_SUCCESS;
3471}
3472
3473/**
3474 * @brief Execute the XPath boolean(object) function. Returns LYXP_SET_BOOLEAN
3475 * with the argument converted to boolean.
3476 *
3477 * @param[in] args Array of arguments.
3478 * @param[in] arg_count Count of elements in @p args.
3479 * @param[in,out] set Context and result set at the same time.
3480 * @param[in] options XPath options.
Michal Vasko0cbf54f2019-12-16 10:01:06 +01003481 * @return LY_ERR
Michal Vasko03ff5a72019-09-11 13:49:33 +02003482 */
3483static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02003484xpath_boolean(struct lyxp_set **args, uint16_t UNUSED(arg_count), struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02003485{
3486 LY_ERR rc;
3487
3488 if (options & LYXP_SCNODE_ALL) {
Michal Vasko1a09b212021-05-06 13:00:10 +02003489 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_NODE);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003490 return LY_SUCCESS;
3491 }
3492
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01003493 rc = lyxp_set_cast(args[0], LYXP_SET_BOOLEAN);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003494 LY_CHECK_RET(rc);
3495 set_fill_set(set, args[0]);
3496
3497 return LY_SUCCESS;
3498}
3499
3500/**
3501 * @brief Execute the XPath ceiling(number) function. Returns LYXP_SET_NUMBER
3502 * with the first argument rounded up to the nearest integer.
3503 *
3504 * @param[in] args Array of arguments.
3505 * @param[in] arg_count Count of elements in @p args.
3506 * @param[in,out] set Context and result set at the same time.
3507 * @param[in] options XPath options.
Michal Vasko0cbf54f2019-12-16 10:01:06 +01003508 * @return LY_ERR
Michal Vasko03ff5a72019-09-11 13:49:33 +02003509 */
3510static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02003511xpath_ceiling(struct lyxp_set **args, uint16_t UNUSED(arg_count), struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02003512{
3513 struct lysc_node_leaf *sleaf;
3514 LY_ERR rc = LY_SUCCESS;
3515
3516 if (options & LYXP_SCNODE_ALL) {
Michal Vasko5676f4e2021-04-06 17:14:45 +02003517 if (args[0]->type != LYXP_SET_SCNODE_SET) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02003518 LOGWRN(set->ctx, "Argument #1 of %s not a node-set as expected.", __func__);
Michal Vasko5676f4e2021-04-06 17:14:45 +02003519 } else if ((sleaf = (struct lysc_node_leaf *)warn_get_scnode_in_ctx(args[0]))) {
3520 if (!(sleaf->nodetype & (LYS_LEAF | LYS_LEAFLIST))) {
3521 LOGWRN(set->ctx, "Argument #1 of %s is a %s node \"%s\".", __func__, lys_nodetype2str(sleaf->nodetype),
3522 sleaf->name);
3523 } else if (!warn_is_specific_type(sleaf->type, LY_TYPE_DEC64)) {
3524 LOGWRN(set->ctx, "Argument #1 of %s is node \"%s\", not of type \"decimal64\".", __func__, sleaf->name);
3525 }
Michal Vasko03ff5a72019-09-11 13:49:33 +02003526 }
Michal Vasko1a09b212021-05-06 13:00:10 +02003527 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_VAL);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003528 return rc;
3529 }
3530
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01003531 rc = lyxp_set_cast(args[0], LYXP_SET_NUMBER);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003532 LY_CHECK_RET(rc);
3533 if ((long long)args[0]->val.num != args[0]->val.num) {
3534 set_fill_number(set, ((long long)args[0]->val.num) + 1);
3535 } else {
3536 set_fill_number(set, args[0]->val.num);
3537 }
3538
3539 return LY_SUCCESS;
3540}
3541
3542/**
3543 * @brief Execute the XPath concat(string, string, string*) function.
3544 * Returns LYXP_SET_STRING with the concatenation of all the arguments.
3545 *
3546 * @param[in] args Array of arguments.
3547 * @param[in] arg_count Count of elements in @p args.
3548 * @param[in,out] set Context and result set at the same time.
3549 * @param[in] options XPath options.
Michal Vasko0cbf54f2019-12-16 10:01:06 +01003550 * @return LY_ERR
Michal Vasko03ff5a72019-09-11 13:49:33 +02003551 */
3552static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02003553xpath_concat(struct lyxp_set **args, uint16_t arg_count, struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02003554{
3555 uint16_t i;
3556 char *str = NULL;
3557 size_t used = 1;
3558 LY_ERR rc = LY_SUCCESS;
3559 struct lysc_node_leaf *sleaf;
3560
3561 if (options & LYXP_SCNODE_ALL) {
3562 for (i = 0; i < arg_count; ++i) {
3563 if ((args[i]->type == LYXP_SET_SCNODE_SET) && (sleaf = (struct lysc_node_leaf *)warn_get_scnode_in_ctx(args[i]))) {
3564 if (!(sleaf->nodetype & (LYS_LEAF | LYS_LEAFLIST))) {
3565 LOGWRN(set->ctx, "Argument #%u of %s is a %s node \"%s\".",
Michal Vasko69730152020-10-09 16:30:07 +02003566 i + 1, __func__, lys_nodetype2str(sleaf->nodetype), sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003567 } else if (!warn_is_string_type(sleaf->type)) {
Radek Krejci70124c82020-08-14 22:17:03 +02003568 LOGWRN(set->ctx, "Argument #%u of %s is node \"%s\", not of string-type.", i + 1, __func__, sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003569 }
3570 }
3571 }
Michal Vasko1a09b212021-05-06 13:00:10 +02003572 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_VAL);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003573 return rc;
3574 }
3575
3576 for (i = 0; i < arg_count; ++i) {
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01003577 rc = lyxp_set_cast(args[i], LYXP_SET_STRING);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003578 if (rc != LY_SUCCESS) {
3579 free(str);
3580 return rc;
3581 }
3582
3583 str = ly_realloc(str, (used + strlen(args[i]->val.str)) * sizeof(char));
3584 LY_CHECK_ERR_RET(!str, LOGMEM(set->ctx), LY_EMEM);
3585 strcpy(str + used - 1, args[i]->val.str);
3586 used += strlen(args[i]->val.str);
3587 }
3588
3589 /* free, kind of */
Michal Vaskod3678892020-05-21 10:06:58 +02003590 lyxp_set_free_content(set);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003591 set->type = LYXP_SET_STRING;
3592 set->val.str = str;
3593
3594 return LY_SUCCESS;
3595}
3596
3597/**
3598 * @brief Execute the XPath contains(string, string) function.
3599 * Returns LYXP_SET_BOOLEAN whether the second argument can
3600 * be found in the first or not.
3601 *
3602 * @param[in] args Array of arguments.
3603 * @param[in] arg_count Count of elements in @p args.
3604 * @param[in,out] set Context and result set at the same time.
3605 * @param[in] options XPath options.
Michal Vasko0cbf54f2019-12-16 10:01:06 +01003606 * @return LY_ERR
Michal Vasko03ff5a72019-09-11 13:49:33 +02003607 */
3608static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02003609xpath_contains(struct lyxp_set **args, uint16_t UNUSED(arg_count), struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02003610{
3611 struct lysc_node_leaf *sleaf;
3612 LY_ERR rc = LY_SUCCESS;
3613
3614 if (options & LYXP_SCNODE_ALL) {
3615 if ((args[0]->type == LYXP_SET_SCNODE_SET) && (sleaf = (struct lysc_node_leaf *)warn_get_scnode_in_ctx(args[0]))) {
3616 if (!(sleaf->nodetype & (LYS_LEAF | LYS_LEAFLIST))) {
Michal Vasko5676f4e2021-04-06 17:14:45 +02003617 LOGWRN(set->ctx, "Argument #1 of %s is a %s node \"%s\".", __func__, lys_nodetype2str(sleaf->nodetype),
3618 sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003619 } else if (!warn_is_string_type(sleaf->type)) {
3620 LOGWRN(set->ctx, "Argument #1 of %s is node \"%s\", not of string-type.", __func__, sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003621 }
3622 }
3623
3624 if ((args[1]->type == LYXP_SET_SCNODE_SET) && (sleaf = (struct lysc_node_leaf *)warn_get_scnode_in_ctx(args[1]))) {
3625 if (!(sleaf->nodetype & (LYS_LEAF | LYS_LEAFLIST))) {
Michal Vasko5676f4e2021-04-06 17:14:45 +02003626 LOGWRN(set->ctx, "Argument #2 of %s is a %s node \"%s\".", __func__, lys_nodetype2str(sleaf->nodetype),
3627 sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003628 } else if (!warn_is_string_type(sleaf->type)) {
3629 LOGWRN(set->ctx, "Argument #2 of %s is node \"%s\", not of string-type.", __func__, sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003630 }
3631 }
Michal Vasko1a09b212021-05-06 13:00:10 +02003632 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_VAL);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003633 return rc;
3634 }
3635
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01003636 rc = lyxp_set_cast(args[0], LYXP_SET_STRING);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003637 LY_CHECK_RET(rc);
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01003638 rc = lyxp_set_cast(args[1], LYXP_SET_STRING);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003639 LY_CHECK_RET(rc);
3640
3641 if (strstr(args[0]->val.str, args[1]->val.str)) {
3642 set_fill_boolean(set, 1);
3643 } else {
3644 set_fill_boolean(set, 0);
3645 }
3646
3647 return LY_SUCCESS;
3648}
3649
3650/**
3651 * @brief Execute the XPath count(node-set) function. Returns LYXP_SET_NUMBER
3652 * with the size of the node-set from the argument.
3653 *
3654 * @param[in] args Array of arguments.
3655 * @param[in] arg_count Count of elements in @p args.
3656 * @param[in,out] set Context and result set at the same time.
3657 * @param[in] options XPath options.
Michal Vasko0cbf54f2019-12-16 10:01:06 +01003658 * @return LY_ERR
Michal Vasko03ff5a72019-09-11 13:49:33 +02003659 */
3660static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02003661xpath_count(struct lyxp_set **args, uint16_t UNUSED(arg_count), struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02003662{
Michal Vasko03ff5a72019-09-11 13:49:33 +02003663 LY_ERR rc = LY_SUCCESS;
3664
3665 if (options & LYXP_SCNODE_ALL) {
Michal Vasko5676f4e2021-04-06 17:14:45 +02003666 if (args[0]->type != LYXP_SET_SCNODE_SET) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02003667 LOGWRN(set->ctx, "Argument #1 of %s not a node-set as expected.", __func__);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003668 }
Michal Vasko1a09b212021-05-06 13:00:10 +02003669 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_NODE);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003670 return rc;
3671 }
3672
Michal Vasko03ff5a72019-09-11 13:49:33 +02003673 if (args[0]->type != LYXP_SET_NODE_SET) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01003674 LOGVAL(set->ctx, LY_VCODE_XP_INARGTYPE, 1, print_set_type(args[0]), "count(node-set)");
Michal Vasko03ff5a72019-09-11 13:49:33 +02003675 return LY_EVALID;
3676 }
3677
3678 set_fill_number(set, args[0]->used);
3679 return LY_SUCCESS;
3680}
3681
3682/**
3683 * @brief Execute the XPath current() function. Returns LYXP_SET_NODE_SET
3684 * with the context with the intial node.
3685 *
3686 * @param[in] args Array of arguments.
3687 * @param[in] arg_count Count of elements in @p args.
3688 * @param[in,out] set Context and result set at the same time.
3689 * @param[in] options XPath options.
Michal Vasko0cbf54f2019-12-16 10:01:06 +01003690 * @return LY_ERR
Michal Vasko03ff5a72019-09-11 13:49:33 +02003691 */
3692static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02003693xpath_current(struct lyxp_set **args, uint16_t arg_count, struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02003694{
3695 if (arg_count || args) {
Radek Krejcie87c7dc2021-06-02 21:25:42 +02003696 LOGVAL(set->ctx, LY_VCODE_XP_INARGCOUNT, arg_count, LY_PRI_LENSTR("current()"));
Michal Vasko03ff5a72019-09-11 13:49:33 +02003697 return LY_EVALID;
3698 }
3699
3700 if (options & LYXP_SCNODE_ALL) {
Michal Vasko1a09b212021-05-06 13:00:10 +02003701 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_NODE);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003702
Michal Vasko5d24f6c2020-10-13 13:49:06 +02003703 LY_CHECK_RET(lyxp_set_scnode_insert_node(set, set->cur_scnode, LYXP_NODE_ELEM, NULL));
Michal Vasko03ff5a72019-09-11 13:49:33 +02003704 } else {
Michal Vaskod3678892020-05-21 10:06:58 +02003705 lyxp_set_free_content(set);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003706
3707 /* position is filled later */
Michal Vasko5d24f6c2020-10-13 13:49:06 +02003708 set_insert_node(set, set->cur_node, 0, LYXP_NODE_ELEM, 0);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003709 }
3710
3711 return LY_SUCCESS;
3712}
3713
3714/**
3715 * @brief Execute the YANG 1.1 deref(node-set) function. Returns LYXP_SET_NODE_SET with either
3716 * leafref or instance-identifier target node(s).
3717 *
3718 * @param[in] args Array of arguments.
3719 * @param[in] arg_count Count of elements in @p args.
3720 * @param[in,out] set Context and result set at the same time.
3721 * @param[in] options XPath options.
Michal Vasko0cbf54f2019-12-16 10:01:06 +01003722 * @return LY_ERR
Michal Vasko03ff5a72019-09-11 13:49:33 +02003723 */
3724static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02003725xpath_deref(struct lyxp_set **args, uint16_t UNUSED(arg_count), struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02003726{
3727 struct lyd_node_term *leaf;
Michal Vasko42e497c2020-01-06 08:38:25 +01003728 struct lysc_node_leaf *sleaf = NULL;
Michal Vasko004d3152020-06-11 19:59:22 +02003729 struct lysc_type_leafref *lref;
Michal Vaskoae9e4cb2019-09-25 08:43:05 +02003730 const struct lysc_node *target;
Michal Vasko004d3152020-06-11 19:59:22 +02003731 struct ly_path *p;
3732 struct lyd_node *node;
Michal Vasko03ff5a72019-09-11 13:49:33 +02003733 char *errmsg = NULL;
Michal Vasko00cbf532020-06-15 13:58:47 +02003734 uint8_t oper;
Michal Vasko741bb562021-06-24 11:59:50 +02003735 LY_ERR r;
Michal Vasko03ff5a72019-09-11 13:49:33 +02003736
3737 if (options & LYXP_SCNODE_ALL) {
Michal Vasko5676f4e2021-04-06 17:14:45 +02003738 if (args[0]->type != LYXP_SET_SCNODE_SET) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02003739 LOGWRN(set->ctx, "Argument #1 of %s not a node-set as expected.", __func__);
Michal Vasko5676f4e2021-04-06 17:14:45 +02003740 } else if ((sleaf = (struct lysc_node_leaf *)warn_get_scnode_in_ctx(args[0]))) {
Michal Vasko423ba3f2021-07-19 13:08:50 +02003741 if (!(sleaf->nodetype & LYD_NODE_TERM)) {
Michal Vasko5676f4e2021-04-06 17:14:45 +02003742 LOGWRN(set->ctx, "Argument #1 of %s is a %s node \"%s\".", __func__, lys_nodetype2str(sleaf->nodetype),
3743 sleaf->name);
Michal Vaskoed725d72021-06-23 12:03:45 +02003744 } else if (!warn_is_specific_type(sleaf->type, LY_TYPE_LEAFREF) &&
3745 !warn_is_specific_type(sleaf->type, LY_TYPE_INST)) {
Michal Vasko5676f4e2021-04-06 17:14:45 +02003746 LOGWRN(set->ctx, "Argument #1 of %s is node \"%s\", not of type \"leafref\" nor \"instance-identifier\".",
3747 __func__, sleaf->name);
3748 }
Michal Vasko03ff5a72019-09-11 13:49:33 +02003749 }
Michal Vasko1a09b212021-05-06 13:00:10 +02003750 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_VAL);
Michal Vasko423ba3f2021-07-19 13:08:50 +02003751 if (sleaf && (sleaf->nodetype & LYD_NODE_TERM) && (sleaf->type->basetype == LY_TYPE_LEAFREF)) {
Michal Vasko004d3152020-06-11 19:59:22 +02003752 lref = (struct lysc_type_leafref *)sleaf->type;
Michal Vaskod1e53b92021-01-28 13:11:06 +01003753 oper = (sleaf->flags & LYS_IS_OUTPUT) ? LY_PATH_OPER_OUTPUT : LY_PATH_OPER_INPUT;
Michal Vasko004d3152020-06-11 19:59:22 +02003754
3755 /* it was already evaluated on schema, it must succeed */
Michal Vasko741bb562021-06-24 11:59:50 +02003756 r = ly_path_compile_leafref(set->ctx, &sleaf->node, NULL, lref->path, oper, LY_PATH_TARGET_MANY,
Michal Vasko24fc4d12021-07-12 14:41:20 +02003757 LY_VALUE_SCHEMA_RESOLVED, lref->prefixes, &p);
Michal Vasko741bb562021-06-24 11:59:50 +02003758 if (!r) {
3759 /* get the target node */
3760 target = p[LY_ARRAY_COUNT(p) - 1].node;
3761 ly_path_free(set->ctx, p);
Michal Vasko004d3152020-06-11 19:59:22 +02003762
Michal Vasko741bb562021-06-24 11:59:50 +02003763 LY_CHECK_RET(lyxp_set_scnode_insert_node(set, target, LYXP_NODE_ELEM, NULL));
3764 } /* else the target was found before but is disabled so it was removed */
Michal Vaskoae9e4cb2019-09-25 08:43:05 +02003765 }
3766
Michal Vasko741bb562021-06-24 11:59:50 +02003767 return LY_SUCCESS;
Michal Vasko03ff5a72019-09-11 13:49:33 +02003768 }
3769
Michal Vaskod3678892020-05-21 10:06:58 +02003770 if (args[0]->type != LYXP_SET_NODE_SET) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01003771 LOGVAL(set->ctx, LY_VCODE_XP_INARGTYPE, 1, print_set_type(args[0]), "deref(node-set)");
Michal Vasko03ff5a72019-09-11 13:49:33 +02003772 return LY_EVALID;
3773 }
3774
Michal Vaskod3678892020-05-21 10:06:58 +02003775 lyxp_set_free_content(set);
3776 if (args[0]->used) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02003777 leaf = (struct lyd_node_term *)args[0]->val.nodes[0].node;
3778 sleaf = (struct lysc_node_leaf *)leaf->schema;
3779 if (sleaf->nodetype & (LYS_LEAF | LYS_LEAFLIST)) {
3780 if (sleaf->type->basetype == LY_TYPE_LEAFREF) {
3781 /* find leafref target */
Radek Krejci0b013302021-03-29 15:22:32 +02003782 if (lyplg_type_resolve_leafref((struct lysc_type_leafref *)sleaf->type, &leaf->node, &leaf->value, set->tree,
Michal Vasko9e685082021-01-29 14:49:09 +01003783 &node, &errmsg)) {
Michal Vasko004d3152020-06-11 19:59:22 +02003784 LOGERR(set->ctx, LY_EVALID, errmsg);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003785 free(errmsg);
Michal Vasko004d3152020-06-11 19:59:22 +02003786 return LY_EVALID;
Michal Vasko03ff5a72019-09-11 13:49:33 +02003787 }
Michal Vasko03ff5a72019-09-11 13:49:33 +02003788 } else {
3789 assert(sleaf->type->basetype == LY_TYPE_INST);
Michal Vasko004d3152020-06-11 19:59:22 +02003790 if (ly_path_eval(leaf->value.target, set->tree, &node)) {
Michal Vaskoba99a3e2020-08-18 15:50:05 +02003791 LOGERR(set->ctx, LY_EVALID, "Invalid instance-identifier \"%s\" value - required instance not found.",
Radek Krejci6d5ba0c2021-04-26 07:49:59 +02003792 lyd_get_value(&leaf->node));
Michal Vasko03ff5a72019-09-11 13:49:33 +02003793 return LY_EVALID;
3794 }
3795 }
Michal Vasko004d3152020-06-11 19:59:22 +02003796
3797 /* insert it */
3798 set_insert_node(set, node, 0, LYXP_NODE_ELEM, 0);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003799 }
3800 }
3801
3802 return LY_SUCCESS;
3803}
3804
Michal Vaskoe0dd59d2020-07-17 16:10:23 +02003805static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02003806xpath_derived_(struct lyxp_set **args, struct lyxp_set *set, uint32_t options, ly_bool self_match, const char *func)
Michal Vaskoe0dd59d2020-07-17 16:10:23 +02003807{
Michal Vasko1fdd8fa2021-01-08 09:21:45 +01003808 uint32_t i;
Michal Vaskoe0dd59d2020-07-17 16:10:23 +02003809 LY_ARRAY_COUNT_TYPE u;
3810 struct lyd_node_term *leaf;
3811 struct lysc_node_leaf *sleaf;
3812 struct lyd_meta *meta;
Michal Vasko93923692021-05-07 15:28:02 +02003813 struct lyd_value *val;
3814 const struct lys_module *mod;
3815 const char *id_name;
3816 uint16_t id_len;
3817 struct lysc_ident *id;
Michal Vaskoe0dd59d2020-07-17 16:10:23 +02003818 LY_ERR rc = LY_SUCCESS;
Radek Krejci857189e2020-09-01 13:26:36 +02003819 ly_bool found;
Michal Vaskoe0dd59d2020-07-17 16:10:23 +02003820
3821 if (options & LYXP_SCNODE_ALL) {
Michal Vasko5676f4e2021-04-06 17:14:45 +02003822 if (args[0]->type != LYXP_SET_SCNODE_SET) {
Michal Vaskoe0dd59d2020-07-17 16:10:23 +02003823 LOGWRN(set->ctx, "Argument #1 of %s not a node-set as expected.", func);
Michal Vasko5676f4e2021-04-06 17:14:45 +02003824 } else if ((sleaf = (struct lysc_node_leaf *)warn_get_scnode_in_ctx(args[0]))) {
3825 if (!(sleaf->nodetype & (LYS_LEAF | LYS_LEAFLIST))) {
3826 LOGWRN(set->ctx, "Argument #1 of %s is a %s node \"%s\".", func, lys_nodetype2str(sleaf->nodetype),
3827 sleaf->name);
3828 } else if (!warn_is_specific_type(sleaf->type, LY_TYPE_IDENT)) {
3829 LOGWRN(set->ctx, "Argument #1 of %s is node \"%s\", not of type \"identityref\".", func, sleaf->name);
3830 }
Michal Vaskoe0dd59d2020-07-17 16:10:23 +02003831 }
3832
3833 if ((args[1]->type == LYXP_SET_SCNODE_SET) && (sleaf = (struct lysc_node_leaf *)warn_get_scnode_in_ctx(args[1]))) {
3834 if (!(sleaf->nodetype & (LYS_LEAF | LYS_LEAFLIST))) {
3835 LOGWRN(set->ctx, "Argument #2 of %s is a %s node \"%s\".", func, lys_nodetype2str(sleaf->nodetype),
Michal Vasko69730152020-10-09 16:30:07 +02003836 sleaf->name);
Michal Vaskoe0dd59d2020-07-17 16:10:23 +02003837 } else if (!warn_is_string_type(sleaf->type)) {
3838 LOGWRN(set->ctx, "Argument #2 of %s is node \"%s\", not of string-type.", func, sleaf->name);
3839 }
3840 }
Michal Vasko1a09b212021-05-06 13:00:10 +02003841 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_VAL);
Michal Vaskoe0dd59d2020-07-17 16:10:23 +02003842 return rc;
3843 }
3844
3845 if (args[0]->type != LYXP_SET_NODE_SET) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01003846 LOGVAL(set->ctx, LY_VCODE_XP_INARGTYPE, 1, print_set_type(args[0]), "derived-from(-or-self)(node-set, string)");
Michal Vaskoe0dd59d2020-07-17 16:10:23 +02003847 return LY_EVALID;
3848 }
3849 rc = lyxp_set_cast(args[1], LYXP_SET_STRING);
3850 LY_CHECK_RET(rc);
3851
Michal Vasko93923692021-05-07 15:28:02 +02003852 /* parse the identity */
3853 id_name = args[1]->val.str;
3854 id_len = strlen(id_name);
3855 rc = moveto_resolve_model(&id_name, &id_len, set, set->cur_node ? set->cur_node->schema : NULL, &mod);
3856 LY_CHECK_RET(rc);
3857 if (!mod) {
3858 LOGVAL(set->ctx, LYVE_XPATH, "Identity \"%.*s\" without a prefix.", (int)id_len, id_name);
3859 return LY_EVALID;
3860 }
3861
3862 /* find the identity */
3863 found = 0;
3864 LY_ARRAY_FOR(mod->identities, u) {
3865 if (!ly_strncmp(mod->identities[u].name, id_name, id_len)) {
3866 /* we have match */
3867 found = 1;
3868 break;
3869 }
3870 }
3871 if (!found) {
3872 LOGVAL(set->ctx, LYVE_XPATH, "Identity \"%.*s\" not found in module \"%s\".", (int)id_len, id_name, mod->name);
3873 return LY_EVALID;
3874 }
3875 id = &mod->identities[u];
3876
Michal Vaskoe0dd59d2020-07-17 16:10:23 +02003877 set_fill_boolean(set, 0);
3878 found = 0;
3879 for (i = 0; i < args[0]->used; ++i) {
3880 if ((args[0]->val.nodes[i].type != LYXP_NODE_ELEM) && (args[0]->val.nodes[i].type != LYXP_NODE_META)) {
3881 continue;
3882 }
3883
3884 if (args[0]->val.nodes[i].type == LYXP_NODE_ELEM) {
3885 leaf = (struct lyd_node_term *)args[0]->val.nodes[i].node;
3886 sleaf = (struct lysc_node_leaf *)leaf->schema;
3887 val = &leaf->value;
3888 if (!(sleaf->nodetype & LYD_NODE_TERM) || (leaf->value.realtype->basetype != LY_TYPE_IDENT)) {
3889 /* uninteresting */
3890 continue;
3891 }
Michal Vaskoe0dd59d2020-07-17 16:10:23 +02003892 } else {
3893 meta = args[0]->val.meta[i].meta;
3894 val = &meta->value;
3895 if (val->realtype->basetype != LY_TYPE_IDENT) {
3896 /* uninteresting */
3897 continue;
3898 }
Michal Vaskoe0dd59d2020-07-17 16:10:23 +02003899 }
3900
Michal Vasko93923692021-05-07 15:28:02 +02003901 /* check the identity itself */
3902 if (self_match && (id == val->ident)) {
Michal Vaskoe0dd59d2020-07-17 16:10:23 +02003903 set_fill_boolean(set, 1);
3904 found = 1;
3905 }
Michal Vasko93923692021-05-07 15:28:02 +02003906 if (!found && !lyplg_type_identity_isderived(id, val->ident)) {
3907 set_fill_boolean(set, 1);
3908 found = 1;
Michal Vaskoe0dd59d2020-07-17 16:10:23 +02003909 }
3910
Michal Vaskoe0dd59d2020-07-17 16:10:23 +02003911 if (found) {
3912 break;
3913 }
3914 }
3915
3916 return LY_SUCCESS;
3917}
3918
Michal Vasko03ff5a72019-09-11 13:49:33 +02003919/**
3920 * @brief Execute the YANG 1.1 derived-from(node-set, string) function. Returns LYXP_SET_BOOLEAN depending
3921 * on whether the first argument nodes contain a node of an identity derived from the second
3922 * argument identity.
3923 *
3924 * @param[in] args Array of arguments.
3925 * @param[in] arg_count Count of elements in @p args.
3926 * @param[in,out] set Context and result set at the same time.
3927 * @param[in] options XPath options.
Michal Vasko0cbf54f2019-12-16 10:01:06 +01003928 * @return LY_ERR
Michal Vasko03ff5a72019-09-11 13:49:33 +02003929 */
3930static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02003931xpath_derived_from(struct lyxp_set **args, uint16_t UNUSED(arg_count), struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02003932{
Michal Vaskoe0dd59d2020-07-17 16:10:23 +02003933 return xpath_derived_(args, set, options, 0, __func__);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003934}
3935
3936/**
3937 * @brief Execute the YANG 1.1 derived-from-or-self(node-set, string) function. Returns LYXP_SET_BOOLEAN depending
3938 * on whether the first argument nodes contain a node of an identity that either is or is derived from
3939 * the second argument identity.
3940 *
3941 * @param[in] args Array of arguments.
3942 * @param[in] arg_count Count of elements in @p args.
3943 * @param[in,out] set Context and result set at the same time.
3944 * @param[in] options XPath options.
Michal Vasko0cbf54f2019-12-16 10:01:06 +01003945 * @return LY_ERR
Michal Vasko03ff5a72019-09-11 13:49:33 +02003946 */
3947static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02003948xpath_derived_from_or_self(struct lyxp_set **args, uint16_t UNUSED(arg_count), struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02003949{
Michal Vaskoe0dd59d2020-07-17 16:10:23 +02003950 return xpath_derived_(args, set, options, 1, __func__);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003951}
3952
3953/**
3954 * @brief Execute the YANG 1.1 enum-value(node-set) function. Returns LYXP_SET_NUMBER
3955 * with the integer value of the first node's enum value, otherwise NaN.
3956 *
3957 * @param[in] args Array of arguments.
3958 * @param[in] arg_count Count of elements in @p args.
3959 * @param[in,out] set Context and result set at the same time.
3960 * @param[in] options XPath options.
Michal Vasko0cbf54f2019-12-16 10:01:06 +01003961 * @return LY_ERR
Michal Vasko03ff5a72019-09-11 13:49:33 +02003962 */
3963static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02003964xpath_enum_value(struct lyxp_set **args, uint16_t UNUSED(arg_count), struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02003965{
3966 struct lyd_node_term *leaf;
3967 struct lysc_node_leaf *sleaf;
3968 LY_ERR rc = LY_SUCCESS;
3969
3970 if (options & LYXP_SCNODE_ALL) {
Michal Vasko5676f4e2021-04-06 17:14:45 +02003971 if (args[0]->type != LYXP_SET_SCNODE_SET) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02003972 LOGWRN(set->ctx, "Argument #1 of %s not a node-set as expected.", __func__);
Michal Vasko5676f4e2021-04-06 17:14:45 +02003973 } else if ((sleaf = (struct lysc_node_leaf *)warn_get_scnode_in_ctx(args[0]))) {
3974 if (!(sleaf->nodetype & (LYS_LEAF | LYS_LEAFLIST))) {
3975 LOGWRN(set->ctx, "Argument #1 of %s is a %s node \"%s\".", __func__, lys_nodetype2str(sleaf->nodetype),
3976 sleaf->name);
3977 } else if (!warn_is_specific_type(sleaf->type, LY_TYPE_ENUM)) {
3978 LOGWRN(set->ctx, "Argument #1 of %s is node \"%s\", not of type \"enumeration\".", __func__, sleaf->name);
3979 }
Michal Vasko03ff5a72019-09-11 13:49:33 +02003980 }
Michal Vasko1a09b212021-05-06 13:00:10 +02003981 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_VAL);
Michal Vasko03ff5a72019-09-11 13:49:33 +02003982 return rc;
3983 }
3984
Michal Vaskod3678892020-05-21 10:06:58 +02003985 if (args[0]->type != LYXP_SET_NODE_SET) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01003986 LOGVAL(set->ctx, LY_VCODE_XP_INARGTYPE, 1, print_set_type(args[0]), "enum-value(node-set)");
Michal Vasko03ff5a72019-09-11 13:49:33 +02003987 return LY_EVALID;
3988 }
3989
3990 set_fill_number(set, NAN);
Michal Vaskod3678892020-05-21 10:06:58 +02003991 if (args[0]->used) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02003992 leaf = (struct lyd_node_term *)args[0]->val.nodes[0].node;
3993 sleaf = (struct lysc_node_leaf *)leaf->schema;
3994 if ((sleaf->nodetype & (LYS_LEAF | LYS_LEAFLIST)) && (sleaf->type->basetype == LY_TYPE_ENUM)) {
3995 set_fill_number(set, leaf->value.enum_item->value);
3996 }
3997 }
3998
3999 return LY_SUCCESS;
4000}
4001
4002/**
4003 * @brief Execute the XPath false() function. Returns LYXP_SET_BOOLEAN
4004 * with false value.
4005 *
4006 * @param[in] args Array of arguments.
4007 * @param[in] arg_count Count of elements in @p args.
4008 * @param[in,out] set Context and result set at the same time.
4009 * @param[in] options XPath options.
Michal Vasko0cbf54f2019-12-16 10:01:06 +01004010 * @return LY_ERR
Michal Vasko03ff5a72019-09-11 13:49:33 +02004011 */
4012static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02004013xpath_false(struct lyxp_set **UNUSED(args), uint16_t UNUSED(arg_count), struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02004014{
4015 if (options & LYXP_SCNODE_ALL) {
Michal Vasko1a09b212021-05-06 13:00:10 +02004016 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_NODE);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004017 return LY_SUCCESS;
4018 }
4019
4020 set_fill_boolean(set, 0);
4021 return LY_SUCCESS;
4022}
4023
4024/**
4025 * @brief Execute the XPath floor(number) function. Returns LYXP_SET_NUMBER
4026 * with the first argument floored (truncated).
4027 *
4028 * @param[in] args Array of arguments.
4029 * @param[in] arg_count Count of elements in @p args.
4030 * @param[in,out] set Context and result set at the same time.
4031 * @param[in] options XPath options.
Michal Vasko0cbf54f2019-12-16 10:01:06 +01004032 * @return LY_ERR
Michal Vasko03ff5a72019-09-11 13:49:33 +02004033 */
4034static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02004035xpath_floor(struct lyxp_set **args, uint16_t UNUSED(arg_count), struct lyxp_set *set, uint32_t UNUSED(options))
Michal Vasko03ff5a72019-09-11 13:49:33 +02004036{
4037 LY_ERR rc;
4038
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01004039 rc = lyxp_set_cast(args[0], LYXP_SET_NUMBER);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004040 LY_CHECK_RET(rc);
4041 if (isfinite(args[0]->val.num)) {
4042 set_fill_number(set, (long long)args[0]->val.num);
4043 }
4044
4045 return LY_SUCCESS;
4046}
4047
4048/**
4049 * @brief Execute the XPath lang(string) function. Returns LYXP_SET_BOOLEAN
4050 * whether the language of the text matches the one from the argument.
4051 *
4052 * @param[in] args Array of arguments.
4053 * @param[in] arg_count Count of elements in @p args.
4054 * @param[in,out] set Context and result set at the same time.
4055 * @param[in] options XPath options.
Michal Vasko0cbf54f2019-12-16 10:01:06 +01004056 * @return LY_ERR
Michal Vasko03ff5a72019-09-11 13:49:33 +02004057 */
4058static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02004059xpath_lang(struct lyxp_set **args, uint16_t UNUSED(arg_count), struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02004060{
4061 const struct lyd_node *node;
4062 struct lysc_node_leaf *sleaf;
Michal Vasko9f96a052020-03-10 09:41:45 +01004063 struct lyd_meta *meta = NULL;
Michal Vasko03ff5a72019-09-11 13:49:33 +02004064 const char *val;
Michal Vasko03ff5a72019-09-11 13:49:33 +02004065 LY_ERR rc = LY_SUCCESS;
4066
4067 if (options & LYXP_SCNODE_ALL) {
4068 if ((args[0]->type == LYXP_SET_SCNODE_SET) && (sleaf = (struct lysc_node_leaf *)warn_get_scnode_in_ctx(args[0]))) {
4069 if (!(sleaf->nodetype & (LYS_LEAF | LYS_LEAFLIST))) {
Michal Vasko1a09b212021-05-06 13:00:10 +02004070 LOGWRN(set->ctx, "Argument #1 of %s is a %s node \"%s\".", __func__, lys_nodetype2str(sleaf->nodetype),
4071 sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004072 } else if (!warn_is_string_type(sleaf->type)) {
4073 LOGWRN(set->ctx, "Argument #1 of %s is node \"%s\", not of string-type.", __func__, sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004074 }
4075 }
Michal Vasko1a09b212021-05-06 13:00:10 +02004076 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_VAL);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004077 return rc;
4078 }
4079
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01004080 rc = lyxp_set_cast(args[0], LYXP_SET_STRING);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004081 LY_CHECK_RET(rc);
4082
Michal Vasko03ff5a72019-09-11 13:49:33 +02004083 if (set->type != LYXP_SET_NODE_SET) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01004084 LOGVAL(set->ctx, LY_VCODE_XP_INCTX, print_set_type(set), "lang(string)");
Michal Vasko03ff5a72019-09-11 13:49:33 +02004085 return LY_EVALID;
Michal Vaskod3678892020-05-21 10:06:58 +02004086 } else if (!set->used) {
4087 set_fill_boolean(set, 0);
4088 return LY_SUCCESS;
Michal Vasko03ff5a72019-09-11 13:49:33 +02004089 }
4090
4091 switch (set->val.nodes[0].type) {
4092 case LYXP_NODE_ELEM:
4093 case LYXP_NODE_TEXT:
4094 node = set->val.nodes[0].node;
4095 break;
Michal Vasko9f96a052020-03-10 09:41:45 +01004096 case LYXP_NODE_META:
4097 node = set->val.meta[0].meta->parent;
Michal Vasko03ff5a72019-09-11 13:49:33 +02004098 break;
4099 default:
4100 /* nothing to do with roots */
4101 set_fill_boolean(set, 0);
4102 return LY_SUCCESS;
4103 }
4104
Michal Vasko9f96a052020-03-10 09:41:45 +01004105 /* find lang metadata */
Michal Vasko9e685082021-01-29 14:49:09 +01004106 for ( ; node; node = lyd_parent(node)) {
Michal Vasko9f96a052020-03-10 09:41:45 +01004107 for (meta = node->meta; meta; meta = meta->next) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02004108 /* annotations */
Michal Vasko9f96a052020-03-10 09:41:45 +01004109 if (meta->name && !strcmp(meta->name, "lang") && !strcmp(meta->annotation->module->name, "xml")) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02004110 break;
4111 }
4112 }
4113
Michal Vasko9f96a052020-03-10 09:41:45 +01004114 if (meta) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02004115 break;
4116 }
4117 }
4118
4119 /* compare languages */
Michal Vasko9f96a052020-03-10 09:41:45 +01004120 if (!meta) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02004121 set_fill_boolean(set, 0);
4122 } else {
Radek Krejci1deb5be2020-08-26 16:43:36 +02004123 uint64_t i;
4124
Radek Krejci6d5ba0c2021-04-26 07:49:59 +02004125 val = lyd_get_meta_value(meta);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004126 for (i = 0; args[0]->val.str[i]; ++i) {
4127 if (tolower(args[0]->val.str[i]) != tolower(val[i])) {
4128 set_fill_boolean(set, 0);
4129 break;
4130 }
4131 }
4132 if (!args[0]->val.str[i]) {
4133 if (!val[i] || (val[i] == '-')) {
4134 set_fill_boolean(set, 1);
4135 } else {
4136 set_fill_boolean(set, 0);
4137 }
4138 }
Michal Vasko03ff5a72019-09-11 13:49:33 +02004139 }
4140
4141 return LY_SUCCESS;
4142}
4143
4144/**
4145 * @brief Execute the XPath last() function. Returns LYXP_SET_NUMBER
4146 * with the context size.
4147 *
4148 * @param[in] args Array of arguments.
4149 * @param[in] arg_count Count of elements in @p args.
4150 * @param[in,out] set Context and result set at the same time.
4151 * @param[in] options XPath options.
Michal Vasko0cbf54f2019-12-16 10:01:06 +01004152 * @return LY_ERR
Michal Vasko03ff5a72019-09-11 13:49:33 +02004153 */
4154static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02004155xpath_last(struct lyxp_set **UNUSED(args), uint16_t UNUSED(arg_count), struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02004156{
4157 if (options & LYXP_SCNODE_ALL) {
Michal Vasko1a09b212021-05-06 13:00:10 +02004158 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_NODE);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004159 return LY_SUCCESS;
4160 }
4161
Michal Vasko03ff5a72019-09-11 13:49:33 +02004162 if (set->type != LYXP_SET_NODE_SET) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01004163 LOGVAL(set->ctx, LY_VCODE_XP_INCTX, print_set_type(set), "last()");
Michal Vasko03ff5a72019-09-11 13:49:33 +02004164 return LY_EVALID;
Michal Vaskod3678892020-05-21 10:06:58 +02004165 } else if (!set->used) {
4166 set_fill_number(set, 0);
4167 return LY_SUCCESS;
Michal Vasko03ff5a72019-09-11 13:49:33 +02004168 }
4169
4170 set_fill_number(set, set->ctx_size);
4171 return LY_SUCCESS;
4172}
4173
4174/**
4175 * @brief Execute the XPath local-name(node-set?) function. Returns LYXP_SET_STRING
4176 * with the node name without namespace from the argument or the context.
4177 *
4178 * @param[in] args Array of arguments.
4179 * @param[in] arg_count Count of elements in @p args.
4180 * @param[in,out] set Context and result set at the same time.
4181 * @param[in] options XPath options.
Michal Vasko0cbf54f2019-12-16 10:01:06 +01004182 * @return LY_ERR
Michal Vasko03ff5a72019-09-11 13:49:33 +02004183 */
4184static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02004185xpath_local_name(struct lyxp_set **args, uint16_t arg_count, struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02004186{
4187 struct lyxp_set_node *item;
Michal Vasko69730152020-10-09 16:30:07 +02004188
Michal Vasko03ff5a72019-09-11 13:49:33 +02004189 /* suppress unused variable warning */
4190 (void)options;
4191
4192 if (options & LYXP_SCNODE_ALL) {
Michal Vasko1a09b212021-05-06 13:00:10 +02004193 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_NODE);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004194 return LY_SUCCESS;
4195 }
4196
4197 if (arg_count) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02004198 if (args[0]->type != LYXP_SET_NODE_SET) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01004199 LOGVAL(set->ctx, LY_VCODE_XP_INARGTYPE, 1, print_set_type(args[0]),
Michal Vasko5d24f6c2020-10-13 13:49:06 +02004200 "local-name(node-set?)");
Michal Vasko03ff5a72019-09-11 13:49:33 +02004201 return LY_EVALID;
Michal Vaskod3678892020-05-21 10:06:58 +02004202 } else if (!args[0]->used) {
4203 set_fill_string(set, "", 0);
4204 return LY_SUCCESS;
Michal Vasko03ff5a72019-09-11 13:49:33 +02004205 }
4206
4207 /* we need the set sorted, it affects the result */
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01004208 assert(!set_sort(args[0]));
Michal Vasko03ff5a72019-09-11 13:49:33 +02004209
4210 item = &args[0]->val.nodes[0];
4211 } else {
Michal Vasko03ff5a72019-09-11 13:49:33 +02004212 if (set->type != LYXP_SET_NODE_SET) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01004213 LOGVAL(set->ctx, LY_VCODE_XP_INCTX, print_set_type(set), "local-name(node-set?)");
Michal Vasko03ff5a72019-09-11 13:49:33 +02004214 return LY_EVALID;
Michal Vaskod3678892020-05-21 10:06:58 +02004215 } else if (!set->used) {
4216 set_fill_string(set, "", 0);
4217 return LY_SUCCESS;
Michal Vasko03ff5a72019-09-11 13:49:33 +02004218 }
4219
4220 /* we need the set sorted, it affects the result */
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01004221 assert(!set_sort(set));
Michal Vasko03ff5a72019-09-11 13:49:33 +02004222
4223 item = &set->val.nodes[0];
4224 }
4225
4226 switch (item->type) {
Michal Vasko2caefc12019-11-14 16:07:56 +01004227 case LYXP_NODE_NONE:
4228 LOGINT_RET(set->ctx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004229 case LYXP_NODE_ROOT:
4230 case LYXP_NODE_ROOT_CONFIG:
4231 case LYXP_NODE_TEXT:
4232 set_fill_string(set, "", 0);
4233 break;
4234 case LYXP_NODE_ELEM:
4235 set_fill_string(set, item->node->schema->name, strlen(item->node->schema->name));
4236 break;
Michal Vasko9f96a052020-03-10 09:41:45 +01004237 case LYXP_NODE_META:
4238 set_fill_string(set, ((struct lyd_meta *)item->node)->name, strlen(((struct lyd_meta *)item->node)->name));
Michal Vasko03ff5a72019-09-11 13:49:33 +02004239 break;
4240 }
4241
4242 return LY_SUCCESS;
4243}
4244
4245/**
4246 * @brief Execute the XPath name(node-set?) function. Returns LYXP_SET_STRING
4247 * with the node name fully qualified (with namespace) from the argument or the context.
4248 *
4249 * @param[in] args Array of arguments.
4250 * @param[in] arg_count Count of elements in @p args.
4251 * @param[in,out] set Context and result set at the same time.
4252 * @param[in] options XPath options.
Michal Vasko0cbf54f2019-12-16 10:01:06 +01004253 * @return LY_ERR
Michal Vasko03ff5a72019-09-11 13:49:33 +02004254 */
4255static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02004256xpath_name(struct lyxp_set **args, uint16_t arg_count, struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02004257{
4258 struct lyxp_set_node *item;
Michal Vaskoed4fcfe2020-07-08 10:38:56 +02004259 struct lys_module *mod = NULL;
Michal Vasko03ff5a72019-09-11 13:49:33 +02004260 char *str;
Michal Vaskoed4fcfe2020-07-08 10:38:56 +02004261 const char *name = NULL;
Michal Vasko03ff5a72019-09-11 13:49:33 +02004262
4263 if (options & LYXP_SCNODE_ALL) {
Michal Vasko1a09b212021-05-06 13:00:10 +02004264 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_NODE);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004265 return LY_SUCCESS;
4266 }
4267
4268 if (arg_count) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02004269 if (args[0]->type != LYXP_SET_NODE_SET) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01004270 LOGVAL(set->ctx, LY_VCODE_XP_INARGTYPE, 1, print_set_type(args[0]), "name(node-set?)");
Michal Vasko03ff5a72019-09-11 13:49:33 +02004271 return LY_EVALID;
Michal Vaskod3678892020-05-21 10:06:58 +02004272 } else if (!args[0]->used) {
4273 set_fill_string(set, "", 0);
4274 return LY_SUCCESS;
Michal Vasko03ff5a72019-09-11 13:49:33 +02004275 }
4276
4277 /* we need the set sorted, it affects the result */
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01004278 assert(!set_sort(args[0]));
Michal Vasko03ff5a72019-09-11 13:49:33 +02004279
4280 item = &args[0]->val.nodes[0];
4281 } else {
Michal Vasko03ff5a72019-09-11 13:49:33 +02004282 if (set->type != LYXP_SET_NODE_SET) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01004283 LOGVAL(set->ctx, LY_VCODE_XP_INCTX, print_set_type(set), "name(node-set?)");
Michal Vasko03ff5a72019-09-11 13:49:33 +02004284 return LY_EVALID;
Michal Vaskod3678892020-05-21 10:06:58 +02004285 } else if (!set->used) {
4286 set_fill_string(set, "", 0);
4287 return LY_SUCCESS;
Michal Vasko03ff5a72019-09-11 13:49:33 +02004288 }
4289
4290 /* we need the set sorted, it affects the result */
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01004291 assert(!set_sort(set));
Michal Vasko03ff5a72019-09-11 13:49:33 +02004292
4293 item = &set->val.nodes[0];
4294 }
4295
4296 switch (item->type) {
Michal Vasko2caefc12019-11-14 16:07:56 +01004297 case LYXP_NODE_NONE:
4298 LOGINT_RET(set->ctx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004299 case LYXP_NODE_ROOT:
4300 case LYXP_NODE_ROOT_CONFIG:
4301 case LYXP_NODE_TEXT:
Michal Vaskoed4fcfe2020-07-08 10:38:56 +02004302 /* keep NULL */
Michal Vasko03ff5a72019-09-11 13:49:33 +02004303 break;
4304 case LYXP_NODE_ELEM:
4305 mod = item->node->schema->module;
4306 name = item->node->schema->name;
4307 break;
Michal Vasko9f96a052020-03-10 09:41:45 +01004308 case LYXP_NODE_META:
4309 mod = ((struct lyd_meta *)item->node)->annotation->module;
4310 name = ((struct lyd_meta *)item->node)->name;
Michal Vasko03ff5a72019-09-11 13:49:33 +02004311 break;
4312 }
4313
4314 if (mod && name) {
Michal Vasko5d24f6c2020-10-13 13:49:06 +02004315 int rc = asprintf(&str, "%s:%s", ly_get_prefix(mod, set->format, set->prefix_data), name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004316 LY_CHECK_ERR_RET(rc == -1, LOGMEM(set->ctx), LY_EMEM);
4317 set_fill_string(set, str, strlen(str));
4318 free(str);
4319 } else {
4320 set_fill_string(set, "", 0);
4321 }
4322
4323 return LY_SUCCESS;
4324}
4325
4326/**
4327 * @brief Execute the XPath namespace-uri(node-set?) function. Returns LYXP_SET_STRING
4328 * with the namespace of the node from the argument or the context.
4329 *
4330 * @param[in] args Array of arguments.
4331 * @param[in] arg_count Count of elements in @p args.
4332 * @param[in,out] set Context and result set at the same time.
4333 * @param[in] options XPath options.
4334 * @return LY_ERR (LY_EINVAL for wrong arguments on schema)
4335 */
4336static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02004337xpath_namespace_uri(struct lyxp_set **args, uint16_t arg_count, struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02004338{
4339 struct lyxp_set_node *item;
4340 struct lys_module *mod;
Michal Vasko69730152020-10-09 16:30:07 +02004341
Michal Vasko03ff5a72019-09-11 13:49:33 +02004342 /* suppress unused variable warning */
4343 (void)options;
4344
4345 if (options & LYXP_SCNODE_ALL) {
Michal Vasko1a09b212021-05-06 13:00:10 +02004346 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_VAL);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004347 return LY_SUCCESS;
4348 }
4349
4350 if (arg_count) {
Michal Vaskod3678892020-05-21 10:06:58 +02004351 if (args[0]->type != LYXP_SET_NODE_SET) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01004352 LOGVAL(set->ctx, LY_VCODE_XP_INARGTYPE, 1, print_set_type(args[0]),
Michal Vasko69730152020-10-09 16:30:07 +02004353 "namespace-uri(node-set?)");
Michal Vaskod3678892020-05-21 10:06:58 +02004354 return LY_EVALID;
4355 } else if (!args[0]->used) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02004356 set_fill_string(set, "", 0);
4357 return LY_SUCCESS;
4358 }
Michal Vasko03ff5a72019-09-11 13:49:33 +02004359
4360 /* we need the set sorted, it affects the result */
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01004361 assert(!set_sort(args[0]));
Michal Vasko03ff5a72019-09-11 13:49:33 +02004362
4363 item = &args[0]->val.nodes[0];
4364 } else {
Michal Vasko03ff5a72019-09-11 13:49:33 +02004365 if (set->type != LYXP_SET_NODE_SET) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01004366 LOGVAL(set->ctx, LY_VCODE_XP_INCTX, print_set_type(set), "namespace-uri(node-set?)");
Michal Vasko03ff5a72019-09-11 13:49:33 +02004367 return LY_EVALID;
Michal Vaskod3678892020-05-21 10:06:58 +02004368 } else if (!set->used) {
4369 set_fill_string(set, "", 0);
4370 return LY_SUCCESS;
Michal Vasko03ff5a72019-09-11 13:49:33 +02004371 }
4372
4373 /* we need the set sorted, it affects the result */
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01004374 assert(!set_sort(set));
Michal Vasko03ff5a72019-09-11 13:49:33 +02004375
4376 item = &set->val.nodes[0];
4377 }
4378
4379 switch (item->type) {
Michal Vasko2caefc12019-11-14 16:07:56 +01004380 case LYXP_NODE_NONE:
4381 LOGINT_RET(set->ctx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004382 case LYXP_NODE_ROOT:
4383 case LYXP_NODE_ROOT_CONFIG:
4384 case LYXP_NODE_TEXT:
4385 set_fill_string(set, "", 0);
4386 break;
4387 case LYXP_NODE_ELEM:
Michal Vasko9f96a052020-03-10 09:41:45 +01004388 case LYXP_NODE_META:
Michal Vasko03ff5a72019-09-11 13:49:33 +02004389 if (item->type == LYXP_NODE_ELEM) {
4390 mod = item->node->schema->module;
Michal Vasko9f96a052020-03-10 09:41:45 +01004391 } else { /* LYXP_NODE_META */
Michal Vasko03ff5a72019-09-11 13:49:33 +02004392 /* annotations */
Michal Vasko9f96a052020-03-10 09:41:45 +01004393 mod = ((struct lyd_meta *)item->node)->annotation->module;
Michal Vasko03ff5a72019-09-11 13:49:33 +02004394 }
4395
4396 set_fill_string(set, mod->ns, strlen(mod->ns));
4397 break;
4398 }
4399
4400 return LY_SUCCESS;
4401}
4402
4403/**
4404 * @brief Execute the XPath node() function (node type). Returns LYXP_SET_NODE_SET
4405 * with only nodes from the context. In practice it either leaves the context
4406 * as it is or returns an empty node set.
4407 *
4408 * @param[in] args Array of arguments.
4409 * @param[in] arg_count Count of elements in @p args.
4410 * @param[in,out] set Context and result set at the same time.
4411 * @param[in] options XPath options.
Michal Vasko0cbf54f2019-12-16 10:01:06 +01004412 * @return LY_ERR
Michal Vasko03ff5a72019-09-11 13:49:33 +02004413 */
4414static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02004415xpath_node(struct lyxp_set **UNUSED(args), uint16_t UNUSED(arg_count), struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02004416{
4417 if (options & LYXP_SCNODE_ALL) {
Michal Vasko1a09b212021-05-06 13:00:10 +02004418 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_NODE);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004419 return LY_SUCCESS;
4420 }
4421
4422 if (set->type != LYXP_SET_NODE_SET) {
Michal Vaskod3678892020-05-21 10:06:58 +02004423 lyxp_set_free_content(set);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004424 }
4425 return LY_SUCCESS;
4426}
4427
4428/**
4429 * @brief Execute the XPath normalize-space(string?) function. Returns LYXP_SET_STRING
4430 * with normalized value (no leading, trailing, double white spaces) of the node
4431 * from the argument or the context.
4432 *
4433 * @param[in] args Array of arguments.
4434 * @param[in] arg_count Count of elements in @p args.
4435 * @param[in,out] set Context and result set at the same time.
4436 * @param[in] options XPath options.
Michal Vasko0cbf54f2019-12-16 10:01:06 +01004437 * @return LY_ERR
Michal Vasko03ff5a72019-09-11 13:49:33 +02004438 */
4439static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02004440xpath_normalize_space(struct lyxp_set **args, uint16_t arg_count, struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02004441{
4442 uint16_t i, new_used;
4443 char *new;
Radek Krejci857189e2020-09-01 13:26:36 +02004444 ly_bool have_spaces = 0, space_before = 0;
Michal Vasko03ff5a72019-09-11 13:49:33 +02004445 struct lysc_node_leaf *sleaf;
4446 LY_ERR rc = LY_SUCCESS;
4447
4448 if (options & LYXP_SCNODE_ALL) {
Michal Vasko1a09b212021-05-06 13:00:10 +02004449 if (arg_count && (args[0]->type == LYXP_SET_SCNODE_SET) &&
4450 (sleaf = (struct lysc_node_leaf *)warn_get_scnode_in_ctx(args[0]))) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02004451 if (!(sleaf->nodetype & (LYS_LEAF | LYS_LEAFLIST))) {
Michal Vasko1a09b212021-05-06 13:00:10 +02004452 LOGWRN(set->ctx, "Argument #1 of %s is a %s node \"%s\".", __func__, lys_nodetype2str(sleaf->nodetype),
4453 sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004454 } else if (!warn_is_string_type(sleaf->type)) {
4455 LOGWRN(set->ctx, "Argument #1 of %s is node \"%s\", not of string-type.", __func__, sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004456 }
4457 }
Michal Vasko1a09b212021-05-06 13:00:10 +02004458 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_VAL);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004459 return rc;
4460 }
4461
4462 if (arg_count) {
4463 set_fill_set(set, args[0]);
4464 }
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01004465 rc = lyxp_set_cast(set, LYXP_SET_STRING);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004466 LY_CHECK_RET(rc);
4467
4468 /* is there any normalization necessary? */
4469 for (i = 0; set->val.str[i]; ++i) {
4470 if (is_xmlws(set->val.str[i])) {
4471 if ((i == 0) || space_before || (!set->val.str[i + 1])) {
4472 have_spaces = 1;
4473 break;
4474 }
4475 space_before = 1;
4476 } else {
4477 space_before = 0;
4478 }
4479 }
4480
4481 /* yep, there is */
4482 if (have_spaces) {
4483 /* it's enough, at least one character will go, makes space for ending '\0' */
4484 new = malloc(strlen(set->val.str) * sizeof(char));
4485 LY_CHECK_ERR_RET(!new, LOGMEM(set->ctx), LY_EMEM);
4486 new_used = 0;
4487
4488 space_before = 0;
4489 for (i = 0; set->val.str[i]; ++i) {
4490 if (is_xmlws(set->val.str[i])) {
4491 if ((i == 0) || space_before) {
4492 space_before = 1;
4493 continue;
4494 } else {
4495 space_before = 1;
4496 }
4497 } else {
4498 space_before = 0;
4499 }
4500
4501 new[new_used] = (space_before ? ' ' : set->val.str[i]);
4502 ++new_used;
4503 }
4504
4505 /* at worst there is one trailing space now */
4506 if (new_used && is_xmlws(new[new_used - 1])) {
4507 --new_used;
4508 }
4509
4510 new = ly_realloc(new, (new_used + 1) * sizeof(char));
4511 LY_CHECK_ERR_RET(!new, LOGMEM(set->ctx), LY_EMEM);
4512 new[new_used] = '\0';
4513
4514 free(set->val.str);
4515 set->val.str = new;
4516 }
4517
4518 return LY_SUCCESS;
4519}
4520
4521/**
4522 * @brief Execute the XPath not(boolean) function. Returns LYXP_SET_BOOLEAN
4523 * with the argument converted to boolean and logically inverted.
4524 *
4525 * @param[in] args Array of arguments.
4526 * @param[in] arg_count Count of elements in @p args.
4527 * @param[in,out] set Context and result set at the same time.
4528 * @param[in] options XPath options.
Michal Vasko0cbf54f2019-12-16 10:01:06 +01004529 * @return LY_ERR
Michal Vasko03ff5a72019-09-11 13:49:33 +02004530 */
4531static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02004532xpath_not(struct lyxp_set **args, uint16_t UNUSED(arg_count), struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02004533{
4534 if (options & LYXP_SCNODE_ALL) {
Michal Vasko1a09b212021-05-06 13:00:10 +02004535 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_NODE);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004536 return LY_SUCCESS;
4537 }
4538
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01004539 lyxp_set_cast(args[0], LYXP_SET_BOOLEAN);
Michal Vasko004d3152020-06-11 19:59:22 +02004540 if (args[0]->val.bln) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02004541 set_fill_boolean(set, 0);
4542 } else {
4543 set_fill_boolean(set, 1);
4544 }
4545
4546 return LY_SUCCESS;
4547}
4548
4549/**
4550 * @brief Execute the XPath number(object?) function. Returns LYXP_SET_NUMBER
4551 * with the number representation of either the argument or the context.
4552 *
4553 * @param[in] args Array of arguments.
4554 * @param[in] arg_count Count of elements in @p args.
4555 * @param[in,out] set Context and result set at the same time.
4556 * @param[in] options XPath options.
Michal Vasko0cbf54f2019-12-16 10:01:06 +01004557 * @return LY_ERR
Michal Vasko03ff5a72019-09-11 13:49:33 +02004558 */
4559static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02004560xpath_number(struct lyxp_set **args, uint16_t arg_count, struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02004561{
4562 LY_ERR rc;
4563
4564 if (options & LYXP_SCNODE_ALL) {
Michal Vasko1a09b212021-05-06 13:00:10 +02004565 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_VAL);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004566 return LY_SUCCESS;
4567 }
4568
4569 if (arg_count) {
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01004570 rc = lyxp_set_cast(args[0], LYXP_SET_NUMBER);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004571 LY_CHECK_RET(rc);
4572 set_fill_set(set, args[0]);
4573 } else {
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01004574 rc = lyxp_set_cast(set, LYXP_SET_NUMBER);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004575 LY_CHECK_RET(rc);
4576 }
4577
4578 return LY_SUCCESS;
4579}
4580
4581/**
4582 * @brief Execute the XPath position() function. Returns LYXP_SET_NUMBER
4583 * with the context position.
4584 *
4585 * @param[in] args Array of arguments.
4586 * @param[in] arg_count Count of elements in @p args.
4587 * @param[in,out] set Context and result set at the same time.
4588 * @param[in] options XPath options.
Michal Vasko0cbf54f2019-12-16 10:01:06 +01004589 * @return LY_ERR
Michal Vasko03ff5a72019-09-11 13:49:33 +02004590 */
4591static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02004592xpath_position(struct lyxp_set **UNUSED(args), uint16_t UNUSED(arg_count), struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02004593{
4594 if (options & LYXP_SCNODE_ALL) {
Michal Vasko1a09b212021-05-06 13:00:10 +02004595 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_NODE);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004596 return LY_SUCCESS;
4597 }
4598
Michal Vasko03ff5a72019-09-11 13:49:33 +02004599 if (set->type != LYXP_SET_NODE_SET) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01004600 LOGVAL(set->ctx, LY_VCODE_XP_INCTX, print_set_type(set), "position()");
Michal Vasko03ff5a72019-09-11 13:49:33 +02004601 return LY_EVALID;
Michal Vaskod3678892020-05-21 10:06:58 +02004602 } else if (!set->used) {
4603 set_fill_number(set, 0);
4604 return LY_SUCCESS;
Michal Vasko03ff5a72019-09-11 13:49:33 +02004605 }
4606
4607 set_fill_number(set, set->ctx_pos);
4608
4609 /* UNUSED in 'Release' build type */
4610 (void)options;
4611 return LY_SUCCESS;
4612}
4613
4614/**
4615 * @brief Execute the YANG 1.1 re-match(string, string) function. Returns LYXP_SET_BOOLEAN
4616 * depending on whether the second argument regex matches the first argument string. For details refer to
4617 * YANG 1.1 RFC section 10.2.1.
4618 *
4619 * @param[in] args Array of arguments.
4620 * @param[in] arg_count Count of elements in @p args.
4621 * @param[in,out] set Context and result set at the same time.
4622 * @param[in] options XPath options.
Michal Vasko0cbf54f2019-12-16 10:01:06 +01004623 * @return LY_ERR
Michal Vasko03ff5a72019-09-11 13:49:33 +02004624 */
4625static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02004626xpath_re_match(struct lyxp_set **args, uint16_t UNUSED(arg_count), struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02004627{
4628 struct lysc_pattern **patterns = NULL, **pattern;
4629 struct lysc_node_leaf *sleaf;
Michal Vasko03ff5a72019-09-11 13:49:33 +02004630 LY_ERR rc = LY_SUCCESS;
4631 struct ly_err_item *err;
4632
4633 if (options & LYXP_SCNODE_ALL) {
4634 if ((args[0]->type == LYXP_SET_SCNODE_SET) && (sleaf = (struct lysc_node_leaf *)warn_get_scnode_in_ctx(args[0]))) {
4635 if (!(sleaf->nodetype & (LYS_LEAF | LYS_LEAFLIST))) {
4636 LOGWRN(set->ctx, "Argument #1 of %s is a %s node \"%s\".", __func__, lys_nodetype2str(sleaf->nodetype), sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004637 } else if (!warn_is_string_type(sleaf->type)) {
4638 LOGWRN(set->ctx, "Argument #1 of %s is node \"%s\", not of string-type.", __func__, sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004639 }
4640 }
4641
4642 if ((args[1]->type == LYXP_SET_SCNODE_SET) && (sleaf = (struct lysc_node_leaf *)warn_get_scnode_in_ctx(args[1]))) {
4643 if (!(sleaf->nodetype & (LYS_LEAF | LYS_LEAFLIST))) {
4644 LOGWRN(set->ctx, "Argument #2 of %s is a %s node \"%s\".", __func__, lys_nodetype2str(sleaf->nodetype), sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004645 } else if (!warn_is_string_type(sleaf->type)) {
4646 LOGWRN(set->ctx, "Argument #2 of %s is node \"%s\", not of string-type.", __func__, sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004647 }
4648 }
Michal Vasko1a09b212021-05-06 13:00:10 +02004649 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_VAL);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004650 return rc;
4651 }
4652
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01004653 rc = lyxp_set_cast(args[0], LYXP_SET_STRING);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004654 LY_CHECK_RET(rc);
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01004655 rc = lyxp_set_cast(args[1], LYXP_SET_STRING);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004656 LY_CHECK_RET(rc);
4657
4658 LY_ARRAY_NEW_RET(set->ctx, patterns, pattern, LY_EMEM);
Radek IÅ¡a45802b52021-02-09 09:21:58 +01004659 *pattern = calloc(1, sizeof **pattern);
Radek Krejciddace2c2021-01-08 11:30:56 +01004660 LOG_LOCSET(NULL, set->cur_node, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +01004661 rc = lys_compile_type_pattern_check(set->ctx, args[1]->val.str, &(*pattern)->code);
Radek Krejciddace2c2021-01-08 11:30:56 +01004662 LOG_LOCBACK(0, 1, 0, 0);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004663 if (rc != LY_SUCCESS) {
4664 LY_ARRAY_FREE(patterns);
4665 return rc;
4666 }
4667
Radek Krejci0b013302021-03-29 15:22:32 +02004668 rc = lyplg_type_validate_patterns(patterns, args[0]->val.str, strlen(args[0]->val.str), &err);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004669 pcre2_code_free((*pattern)->code);
4670 free(*pattern);
4671 LY_ARRAY_FREE(patterns);
4672 if (rc && (rc != LY_EVALID)) {
Michal Vasko177d0ed2020-11-23 16:43:03 +01004673 ly_err_print(set->ctx, err);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004674 ly_err_free(err);
4675 return rc;
4676 }
4677
4678 if (rc == LY_EVALID) {
4679 ly_err_free(err);
4680 set_fill_boolean(set, 0);
4681 } else {
4682 set_fill_boolean(set, 1);
4683 }
4684
4685 return LY_SUCCESS;
4686}
4687
4688/**
4689 * @brief Execute the XPath round(number) function. Returns LYXP_SET_NUMBER
4690 * with the rounded first argument. For details refer to
4691 * http://www.w3.org/TR/1999/REC-xpath-19991116/#function-round.
4692 *
4693 * @param[in] args Array of arguments.
4694 * @param[in] arg_count Count of elements in @p args.
4695 * @param[in,out] set Context and result set at the same time.
4696 * @param[in] options XPath options.
Michal Vasko0cbf54f2019-12-16 10:01:06 +01004697 * @return LY_ERR
Michal Vasko03ff5a72019-09-11 13:49:33 +02004698 */
4699static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02004700xpath_round(struct lyxp_set **args, uint16_t UNUSED(arg_count), struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02004701{
4702 struct lysc_node_leaf *sleaf;
4703 LY_ERR rc = LY_SUCCESS;
4704
4705 if (options & LYXP_SCNODE_ALL) {
Michal Vasko5676f4e2021-04-06 17:14:45 +02004706 if (args[0]->type != LYXP_SET_SCNODE_SET) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02004707 LOGWRN(set->ctx, "Argument #1 of %s not a node-set as expected.", __func__);
Michal Vasko5676f4e2021-04-06 17:14:45 +02004708 } else if ((sleaf = (struct lysc_node_leaf *)warn_get_scnode_in_ctx(args[0]))) {
4709 if (!(sleaf->nodetype & (LYS_LEAF | LYS_LEAFLIST))) {
4710 LOGWRN(set->ctx, "Argument #1 of %s is a %s node \"%s\".", __func__, lys_nodetype2str(sleaf->nodetype),
4711 sleaf->name);
4712 } else if (!warn_is_specific_type(sleaf->type, LY_TYPE_DEC64)) {
4713 LOGWRN(set->ctx, "Argument #1 of %s is node \"%s\", not of type \"decimal64\".", __func__, sleaf->name);
4714 }
Michal Vasko03ff5a72019-09-11 13:49:33 +02004715 }
Michal Vasko1a09b212021-05-06 13:00:10 +02004716 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_VAL);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004717 return rc;
4718 }
4719
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01004720 rc = lyxp_set_cast(args[0], LYXP_SET_NUMBER);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004721 LY_CHECK_RET(rc);
4722
4723 /* cover only the cases where floor can't be used */
4724 if ((args[0]->val.num == -0.0f) || ((args[0]->val.num < 0) && (args[0]->val.num >= -0.5))) {
4725 set_fill_number(set, -0.0f);
4726 } else {
4727 args[0]->val.num += 0.5;
4728 rc = xpath_floor(args, 1, args[0], options);
4729 LY_CHECK_RET(rc);
4730 set_fill_number(set, args[0]->val.num);
4731 }
4732
4733 return LY_SUCCESS;
4734}
4735
4736/**
4737 * @brief Execute the XPath starts-with(string, string) function.
4738 * Returns LYXP_SET_BOOLEAN whether the second argument is
4739 * the prefix of the first or not.
4740 *
4741 * @param[in] args Array of arguments.
4742 * @param[in] arg_count Count of elements in @p args.
4743 * @param[in,out] set Context and result set at the same time.
4744 * @param[in] options XPath options.
Michal Vasko0cbf54f2019-12-16 10:01:06 +01004745 * @return LY_ERR
Michal Vasko03ff5a72019-09-11 13:49:33 +02004746 */
4747static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02004748xpath_starts_with(struct lyxp_set **args, uint16_t UNUSED(arg_count), struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02004749{
4750 struct lysc_node_leaf *sleaf;
4751 LY_ERR rc = LY_SUCCESS;
4752
4753 if (options & LYXP_SCNODE_ALL) {
4754 if ((args[0]->type == LYXP_SET_SCNODE_SET) && (sleaf = (struct lysc_node_leaf *)warn_get_scnode_in_ctx(args[0]))) {
4755 if (!(sleaf->nodetype & (LYS_LEAF | LYS_LEAFLIST))) {
4756 LOGWRN(set->ctx, "Argument #1 of %s is a %s node \"%s\".", __func__, lys_nodetype2str(sleaf->nodetype), sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004757 } else if (!warn_is_string_type(sleaf->type)) {
4758 LOGWRN(set->ctx, "Argument #1 of %s is node \"%s\", not of string-type.", __func__, sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004759 }
4760 }
4761
4762 if ((args[1]->type == LYXP_SET_SCNODE_SET) && (sleaf = (struct lysc_node_leaf *)warn_get_scnode_in_ctx(args[1]))) {
4763 if (!(sleaf->nodetype & (LYS_LEAF | LYS_LEAFLIST))) {
4764 LOGWRN(set->ctx, "Argument #2 of %s is a %s node \"%s\".", __func__, lys_nodetype2str(sleaf->nodetype), sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004765 } else if (!warn_is_string_type(sleaf->type)) {
4766 LOGWRN(set->ctx, "Argument #2 of %s is node \"%s\", not of string-type.", __func__, sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004767 }
4768 }
Michal Vasko1a09b212021-05-06 13:00:10 +02004769 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_VAL);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004770 return rc;
4771 }
4772
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01004773 rc = lyxp_set_cast(args[0], LYXP_SET_STRING);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004774 LY_CHECK_RET(rc);
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01004775 rc = lyxp_set_cast(args[1], LYXP_SET_STRING);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004776 LY_CHECK_RET(rc);
4777
4778 if (strncmp(args[0]->val.str, args[1]->val.str, strlen(args[1]->val.str))) {
4779 set_fill_boolean(set, 0);
4780 } else {
4781 set_fill_boolean(set, 1);
4782 }
4783
4784 return LY_SUCCESS;
4785}
4786
4787/**
4788 * @brief Execute the XPath string(object?) function. Returns LYXP_SET_STRING
4789 * with the string representation of either the argument or the context.
4790 *
4791 * @param[in] args Array of arguments.
4792 * @param[in] arg_count Count of elements in @p args.
4793 * @param[in,out] set Context and result set at the same time.
4794 * @param[in] options XPath options.
Michal Vasko0cbf54f2019-12-16 10:01:06 +01004795 * @return LY_ERR
Michal Vasko03ff5a72019-09-11 13:49:33 +02004796 */
4797static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02004798xpath_string(struct lyxp_set **args, uint16_t arg_count, struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02004799{
4800 LY_ERR rc;
4801
4802 if (options & LYXP_SCNODE_ALL) {
Michal Vasko1a09b212021-05-06 13:00:10 +02004803 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_VAL);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004804 return LY_SUCCESS;
4805 }
4806
4807 if (arg_count) {
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01004808 rc = lyxp_set_cast(args[0], LYXP_SET_STRING);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004809 LY_CHECK_RET(rc);
4810 set_fill_set(set, args[0]);
4811 } else {
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01004812 rc = lyxp_set_cast(set, LYXP_SET_STRING);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004813 LY_CHECK_RET(rc);
4814 }
4815
4816 return LY_SUCCESS;
4817}
4818
4819/**
4820 * @brief Execute the XPath string-length(string?) function. Returns LYXP_SET_NUMBER
4821 * with the length of the string in either the argument or the context.
4822 *
4823 * @param[in] args Array of arguments.
4824 * @param[in] arg_count Count of elements in @p args.
4825 * @param[in,out] set Context and result set at the same time.
4826 * @param[in] options XPath options.
Michal Vasko0cbf54f2019-12-16 10:01:06 +01004827 * @return LY_ERR
Michal Vasko03ff5a72019-09-11 13:49:33 +02004828 */
4829static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02004830xpath_string_length(struct lyxp_set **args, uint16_t arg_count, struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02004831{
4832 struct lysc_node_leaf *sleaf;
4833 LY_ERR rc = LY_SUCCESS;
4834
4835 if (options & LYXP_SCNODE_ALL) {
4836 if (arg_count && (args[0]->type == LYXP_SET_SCNODE_SET) && (sleaf = (struct lysc_node_leaf *)warn_get_scnode_in_ctx(args[0]))) {
4837 if (!(sleaf->nodetype & (LYS_LEAF | LYS_LEAFLIST))) {
4838 LOGWRN(set->ctx, "Argument #1 of %s is a %s node \"%s\".", __func__, lys_nodetype2str(sleaf->nodetype), sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004839 } else if (!warn_is_string_type(sleaf->type)) {
4840 LOGWRN(set->ctx, "Argument #1 of %s is node \"%s\", not of string-type.", __func__, sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004841 }
4842 }
4843 if (!arg_count && (set->type == LYXP_SET_SCNODE_SET) && (sleaf = (struct lysc_node_leaf *)warn_get_scnode_in_ctx(set))) {
4844 if (!(sleaf->nodetype & (LYS_LEAF | LYS_LEAFLIST))) {
4845 LOGWRN(set->ctx, "Argument #0 of %s is a %s node \"%s\".", __func__, lys_nodetype2str(sleaf->nodetype), sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004846 } else if (!warn_is_string_type(sleaf->type)) {
4847 LOGWRN(set->ctx, "Argument #0 of %s is node \"%s\", not of string-type.", __func__, sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004848 }
4849 }
Michal Vasko1a09b212021-05-06 13:00:10 +02004850 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_VAL);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004851 return rc;
4852 }
4853
4854 if (arg_count) {
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01004855 rc = lyxp_set_cast(args[0], LYXP_SET_STRING);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004856 LY_CHECK_RET(rc);
4857 set_fill_number(set, strlen(args[0]->val.str));
4858 } else {
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01004859 rc = lyxp_set_cast(set, LYXP_SET_STRING);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004860 LY_CHECK_RET(rc);
4861 set_fill_number(set, strlen(set->val.str));
4862 }
4863
4864 return LY_SUCCESS;
4865}
4866
4867/**
4868 * @brief Execute the XPath substring(string, number, number?) function.
4869 * Returns LYXP_SET_STRING substring of the first argument starting
4870 * on the second argument index ending on the third argument index,
4871 * indexed from 1. For exact definition refer to
4872 * http://www.w3.org/TR/1999/REC-xpath-19991116/#function-substring.
4873 *
4874 * @param[in] args Array of arguments.
4875 * @param[in] arg_count Count of elements in @p args.
4876 * @param[in,out] set Context and result set at the same time.
4877 * @param[in] options XPath options.
Michal Vasko0cbf54f2019-12-16 10:01:06 +01004878 * @return LY_ERR
Michal Vasko03ff5a72019-09-11 13:49:33 +02004879 */
4880static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02004881xpath_substring(struct lyxp_set **args, uint16_t arg_count, struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02004882{
Radek Krejci1deb5be2020-08-26 16:43:36 +02004883 int32_t start, len;
Michal Vasko03ff5a72019-09-11 13:49:33 +02004884 uint16_t str_start, str_len, pos;
4885 struct lysc_node_leaf *sleaf;
4886 LY_ERR rc = LY_SUCCESS;
4887
4888 if (options & LYXP_SCNODE_ALL) {
4889 if ((args[0]->type == LYXP_SET_SCNODE_SET) && (sleaf = (struct lysc_node_leaf *)warn_get_scnode_in_ctx(args[0]))) {
4890 if (!(sleaf->nodetype & (LYS_LEAF | LYS_LEAFLIST))) {
4891 LOGWRN(set->ctx, "Argument #1 of %s is a %s node \"%s\".", __func__, lys_nodetype2str(sleaf->nodetype), sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004892 } else if (!warn_is_string_type(sleaf->type)) {
4893 LOGWRN(set->ctx, "Argument #1 of %s is node \"%s\", not of string-type.", __func__, sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004894 }
4895 }
4896
4897 if ((args[1]->type == LYXP_SET_SCNODE_SET) && (sleaf = (struct lysc_node_leaf *)warn_get_scnode_in_ctx(args[1]))) {
4898 if (!(sleaf->nodetype & (LYS_LEAF | LYS_LEAFLIST))) {
4899 LOGWRN(set->ctx, "Argument #2 of %s is a %s node \"%s\".", __func__, lys_nodetype2str(sleaf->nodetype), sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004900 } else if (!warn_is_numeric_type(sleaf->type)) {
4901 LOGWRN(set->ctx, "Argument #2 of %s is node \"%s\", not of numeric type.", __func__, sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004902 }
4903 }
4904
Michal Vasko69730152020-10-09 16:30:07 +02004905 if ((arg_count == 3) && (args[2]->type == LYXP_SET_SCNODE_SET) &&
4906 (sleaf = (struct lysc_node_leaf *)warn_get_scnode_in_ctx(args[2]))) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02004907 if (!(sleaf->nodetype & (LYS_LEAF | LYS_LEAFLIST))) {
4908 LOGWRN(set->ctx, "Argument #3 of %s is a %s node \"%s\".", __func__, lys_nodetype2str(sleaf->nodetype), sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004909 } else if (!warn_is_numeric_type(sleaf->type)) {
4910 LOGWRN(set->ctx, "Argument #3 of %s is node \"%s\", not of numeric type.", __func__, sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004911 }
4912 }
Michal Vasko1a09b212021-05-06 13:00:10 +02004913 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_VAL);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004914 return rc;
4915 }
4916
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01004917 rc = lyxp_set_cast(args[0], LYXP_SET_STRING);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004918 LY_CHECK_RET(rc);
4919
4920 /* start */
4921 if (xpath_round(&args[1], 1, args[1], options)) {
4922 return -1;
4923 }
4924 if (isfinite(args[1]->val.num)) {
4925 start = args[1]->val.num - 1;
4926 } else if (isinf(args[1]->val.num) && signbit(args[1]->val.num)) {
Radek Krejci1deb5be2020-08-26 16:43:36 +02004927 start = INT32_MIN;
Michal Vasko03ff5a72019-09-11 13:49:33 +02004928 } else {
Radek Krejci1deb5be2020-08-26 16:43:36 +02004929 start = INT32_MAX;
Michal Vasko03ff5a72019-09-11 13:49:33 +02004930 }
4931
4932 /* len */
4933 if (arg_count == 3) {
4934 rc = xpath_round(&args[2], 1, args[2], options);
4935 LY_CHECK_RET(rc);
Radek Krejci1deb5be2020-08-26 16:43:36 +02004936 if (isnan(args[2]->val.num) || signbit(args[2]->val.num)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02004937 len = 0;
Radek Krejci1deb5be2020-08-26 16:43:36 +02004938 } else if (isfinite(args[2]->val.num)) {
4939 len = args[2]->val.num;
Michal Vasko03ff5a72019-09-11 13:49:33 +02004940 } else {
Radek Krejci1deb5be2020-08-26 16:43:36 +02004941 len = INT32_MAX;
Michal Vasko03ff5a72019-09-11 13:49:33 +02004942 }
4943 } else {
Radek Krejci1deb5be2020-08-26 16:43:36 +02004944 len = INT32_MAX;
Michal Vasko03ff5a72019-09-11 13:49:33 +02004945 }
4946
4947 /* find matching character positions */
4948 str_start = 0;
4949 str_len = 0;
4950 for (pos = 0; args[0]->val.str[pos]; ++pos) {
4951 if (pos < start) {
4952 ++str_start;
4953 } else if (pos < start + len) {
4954 ++str_len;
4955 } else {
4956 break;
4957 }
4958 }
4959
4960 set_fill_string(set, args[0]->val.str + str_start, str_len);
4961 return LY_SUCCESS;
4962}
4963
4964/**
4965 * @brief Execute the XPath substring-after(string, string) function.
4966 * Returns LYXP_SET_STRING with the string succeeding the occurance
4967 * of the second argument in the first or an empty string.
4968 *
4969 * @param[in] args Array of arguments.
4970 * @param[in] arg_count Count of elements in @p args.
4971 * @param[in,out] set Context and result set at the same time.
4972 * @param[in] options XPath options.
Michal Vasko0cbf54f2019-12-16 10:01:06 +01004973 * @return LY_ERR
Michal Vasko03ff5a72019-09-11 13:49:33 +02004974 */
4975static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02004976xpath_substring_after(struct lyxp_set **args, uint16_t UNUSED(arg_count), struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02004977{
4978 char *ptr;
4979 struct lysc_node_leaf *sleaf;
4980 LY_ERR rc = LY_SUCCESS;
4981
4982 if (options & LYXP_SCNODE_ALL) {
4983 if ((args[0]->type == LYXP_SET_SCNODE_SET) && (sleaf = (struct lysc_node_leaf *)warn_get_scnode_in_ctx(args[0]))) {
4984 if (!(sleaf->nodetype & (LYS_LEAF | LYS_LEAFLIST))) {
4985 LOGWRN(set->ctx, "Argument #1 of %s is a %s node \"%s\".", __func__, lys_nodetype2str(sleaf->nodetype), sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004986 } else if (!warn_is_string_type(sleaf->type)) {
4987 LOGWRN(set->ctx, "Argument #1 of %s is node \"%s\", not of string-type.", __func__, sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004988 }
4989 }
4990
4991 if ((args[1]->type == LYXP_SET_SCNODE_SET) && (sleaf = (struct lysc_node_leaf *)warn_get_scnode_in_ctx(args[1]))) {
4992 if (!(sleaf->nodetype & (LYS_LEAF | LYS_LEAFLIST))) {
4993 LOGWRN(set->ctx, "Argument #2 of %s is a %s node \"%s\".", __func__, lys_nodetype2str(sleaf->nodetype), sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004994 } else if (!warn_is_string_type(sleaf->type)) {
4995 LOGWRN(set->ctx, "Argument #2 of %s is node \"%s\", not of string-type.", __func__, sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004996 }
4997 }
Michal Vasko1a09b212021-05-06 13:00:10 +02004998 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_VAL);
Michal Vasko03ff5a72019-09-11 13:49:33 +02004999 return rc;
5000 }
5001
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01005002 rc = lyxp_set_cast(args[0], LYXP_SET_STRING);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005003 LY_CHECK_RET(rc);
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01005004 rc = lyxp_set_cast(args[1], LYXP_SET_STRING);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005005 LY_CHECK_RET(rc);
5006
5007 ptr = strstr(args[0]->val.str, args[1]->val.str);
5008 if (ptr) {
5009 set_fill_string(set, ptr + strlen(args[1]->val.str), strlen(ptr + strlen(args[1]->val.str)));
5010 } else {
5011 set_fill_string(set, "", 0);
5012 }
5013
5014 return LY_SUCCESS;
5015}
5016
5017/**
5018 * @brief Execute the XPath substring-before(string, string) function.
5019 * Returns LYXP_SET_STRING with the string preceding the occurance
5020 * of the second argument in the first or an empty string.
5021 *
5022 * @param[in] args Array of arguments.
5023 * @param[in] arg_count Count of elements in @p args.
5024 * @param[in,out] set Context and result set at the same time.
5025 * @param[in] options XPath options.
Michal Vasko0cbf54f2019-12-16 10:01:06 +01005026 * @return LY_ERR
Michal Vasko03ff5a72019-09-11 13:49:33 +02005027 */
5028static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02005029xpath_substring_before(struct lyxp_set **args, uint16_t UNUSED(arg_count), struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02005030{
5031 char *ptr;
5032 struct lysc_node_leaf *sleaf;
5033 LY_ERR rc = LY_SUCCESS;
5034
5035 if (options & LYXP_SCNODE_ALL) {
5036 if ((args[0]->type == LYXP_SET_SCNODE_SET) && (sleaf = (struct lysc_node_leaf *)warn_get_scnode_in_ctx(args[0]))) {
5037 if (!(sleaf->nodetype & (LYS_LEAF | LYS_LEAFLIST))) {
5038 LOGWRN(set->ctx, "Argument #1 of %s is a %s node \"%s\".", __func__, lys_nodetype2str(sleaf->nodetype), sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005039 } else if (!warn_is_string_type(sleaf->type)) {
5040 LOGWRN(set->ctx, "Argument #1 of %s is node \"%s\", not of string-type.", __func__, sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005041 }
5042 }
5043
5044 if ((args[1]->type == LYXP_SET_SCNODE_SET) && (sleaf = (struct lysc_node_leaf *)warn_get_scnode_in_ctx(args[1]))) {
5045 if (!(sleaf->nodetype & (LYS_LEAF | LYS_LEAFLIST))) {
5046 LOGWRN(set->ctx, "Argument #2 of %s is a %s node \"%s\".", __func__, lys_nodetype2str(sleaf->nodetype), sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005047 } else if (!warn_is_string_type(sleaf->type)) {
5048 LOGWRN(set->ctx, "Argument #2 of %s is node \"%s\", not of string-type.", __func__, sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005049 }
5050 }
Michal Vasko1a09b212021-05-06 13:00:10 +02005051 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_VAL);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005052 return rc;
5053 }
5054
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01005055 rc = lyxp_set_cast(args[0], LYXP_SET_STRING);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005056 LY_CHECK_RET(rc);
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01005057 rc = lyxp_set_cast(args[1], LYXP_SET_STRING);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005058 LY_CHECK_RET(rc);
5059
5060 ptr = strstr(args[0]->val.str, args[1]->val.str);
5061 if (ptr) {
5062 set_fill_string(set, args[0]->val.str, ptr - args[0]->val.str);
5063 } else {
5064 set_fill_string(set, "", 0);
5065 }
5066
5067 return LY_SUCCESS;
5068}
5069
5070/**
5071 * @brief Execute the XPath sum(node-set) function. Returns LYXP_SET_NUMBER
5072 * with the sum of all the nodes in the context.
5073 *
5074 * @param[in] args Array of arguments.
5075 * @param[in] arg_count Count of elements in @p args.
5076 * @param[in,out] set Context and result set at the same time.
5077 * @param[in] options XPath options.
Michal Vasko0cbf54f2019-12-16 10:01:06 +01005078 * @return LY_ERR
Michal Vasko03ff5a72019-09-11 13:49:33 +02005079 */
5080static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02005081xpath_sum(struct lyxp_set **args, uint16_t UNUSED(arg_count), struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02005082{
5083 long double num;
5084 char *str;
Michal Vasko1fdd8fa2021-01-08 09:21:45 +01005085 uint32_t i;
Michal Vasko03ff5a72019-09-11 13:49:33 +02005086 struct lyxp_set set_item;
5087 struct lysc_node_leaf *sleaf;
5088 LY_ERR rc = LY_SUCCESS;
5089
5090 if (options & LYXP_SCNODE_ALL) {
5091 if (args[0]->type == LYXP_SET_SCNODE_SET) {
5092 for (i = 0; i < args[0]->used; ++i) {
Radek Krejcif13b87b2020-12-01 22:02:17 +01005093 if (args[0]->val.scnodes[i].in_ctx == LYXP_SET_SCNODE_ATOM_CTX) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02005094 sleaf = (struct lysc_node_leaf *)args[0]->val.scnodes[i].scnode;
5095 if (!(sleaf->nodetype & (LYS_LEAF | LYS_LEAFLIST))) {
5096 LOGWRN(set->ctx, "Argument #1 of %s is a %s node \"%s\".", __func__,
Michal Vasko69730152020-10-09 16:30:07 +02005097 lys_nodetype2str(sleaf->nodetype), sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005098 } else if (!warn_is_numeric_type(sleaf->type)) {
5099 LOGWRN(set->ctx, "Argument #1 of %s is node \"%s\", not of numeric type.", __func__, sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005100 }
5101 }
5102 }
5103 }
Michal Vasko1a09b212021-05-06 13:00:10 +02005104 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_VAL);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005105 return rc;
5106 }
5107
5108 set_fill_number(set, 0);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005109
5110 if (args[0]->type != LYXP_SET_NODE_SET) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01005111 LOGVAL(set->ctx, LY_VCODE_XP_INARGTYPE, 1, print_set_type(args[0]), "sum(node-set)");
Michal Vasko03ff5a72019-09-11 13:49:33 +02005112 return LY_EVALID;
Michal Vaskod3678892020-05-21 10:06:58 +02005113 } else if (!args[0]->used) {
5114 return LY_SUCCESS;
Michal Vasko03ff5a72019-09-11 13:49:33 +02005115 }
5116
Michal Vasko5c4e5892019-11-14 12:31:38 +01005117 set_init(&set_item, set);
5118
Michal Vasko03ff5a72019-09-11 13:49:33 +02005119 set_item.type = LYXP_SET_NODE_SET;
Michal Vasko41decbf2021-11-02 11:50:21 +01005120 set_item.val.nodes = calloc(1, sizeof *set_item.val.nodes);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005121 LY_CHECK_ERR_RET(!set_item.val.nodes, LOGMEM(set->ctx), LY_EMEM);
5122
5123 set_item.used = 1;
5124 set_item.size = 1;
5125
5126 for (i = 0; i < args[0]->used; ++i) {
5127 set_item.val.nodes[0] = args[0]->val.nodes[i];
5128
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01005129 rc = cast_node_set_to_string(&set_item, &str);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005130 LY_CHECK_RET(rc);
5131 num = cast_string_to_number(str);
5132 free(str);
5133 set->val.num += num;
5134 }
5135
5136 free(set_item.val.nodes);
5137
5138 return LY_SUCCESS;
5139}
5140
5141/**
5142 * @brief Execute the XPath text() function (node type). Returns LYXP_SET_NODE_SET
5143 * with the text content of the nodes in the context.
5144 *
5145 * @param[in] args Array of arguments.
5146 * @param[in] arg_count Count of elements in @p args.
5147 * @param[in,out] set Context and result set at the same time.
5148 * @param[in] options XPath options.
Michal Vasko0cbf54f2019-12-16 10:01:06 +01005149 * @return LY_ERR
Michal Vasko03ff5a72019-09-11 13:49:33 +02005150 */
5151static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02005152xpath_text(struct lyxp_set **UNUSED(args), uint16_t UNUSED(arg_count), struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02005153{
5154 uint32_t i;
5155
5156 if (options & LYXP_SCNODE_ALL) {
Michal Vasko1a09b212021-05-06 13:00:10 +02005157 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_VAL);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005158 return LY_SUCCESS;
5159 }
5160
Michal Vasko03ff5a72019-09-11 13:49:33 +02005161 if (set->type != LYXP_SET_NODE_SET) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01005162 LOGVAL(set->ctx, LY_VCODE_XP_INCTX, print_set_type(set), "text()");
Michal Vasko03ff5a72019-09-11 13:49:33 +02005163 return LY_EVALID;
5164 }
5165
Michal Vaskod989ba02020-08-24 10:59:24 +02005166 for (i = 0; i < set->used; ) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02005167 switch (set->val.nodes[i].type) {
Michal Vasko2caefc12019-11-14 16:07:56 +01005168 case LYXP_NODE_NONE:
5169 LOGINT_RET(set->ctx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005170 case LYXP_NODE_ELEM:
Michal Vasko03ff5a72019-09-11 13:49:33 +02005171 if (set->val.nodes[i].node->schema->nodetype & (LYS_LEAF | LYS_LEAFLIST)) {
5172 set->val.nodes[i].type = LYXP_NODE_TEXT;
5173 ++i;
5174 break;
5175 }
Radek Krejci0f969882020-08-21 16:56:47 +02005176 /* fall through */
Michal Vasko03ff5a72019-09-11 13:49:33 +02005177 case LYXP_NODE_ROOT:
5178 case LYXP_NODE_ROOT_CONFIG:
5179 case LYXP_NODE_TEXT:
Michal Vasko9f96a052020-03-10 09:41:45 +01005180 case LYXP_NODE_META:
Michal Vasko03ff5a72019-09-11 13:49:33 +02005181 set_remove_node(set, i);
5182 break;
5183 }
5184 }
5185
5186 return LY_SUCCESS;
5187}
5188
5189/**
5190 * @brief Execute the XPath translate(string, string, string) function.
5191 * Returns LYXP_SET_STRING with the first argument with the characters
5192 * from the second argument replaced by those on the corresponding
5193 * positions in the third argument.
5194 *
5195 * @param[in] args Array of arguments.
5196 * @param[in] arg_count Count of elements in @p args.
5197 * @param[in,out] set Context and result set at the same time.
5198 * @param[in] options XPath options.
Michal Vasko0cbf54f2019-12-16 10:01:06 +01005199 * @return LY_ERR
Michal Vasko03ff5a72019-09-11 13:49:33 +02005200 */
5201static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02005202xpath_translate(struct lyxp_set **args, uint16_t UNUSED(arg_count), struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02005203{
5204 uint16_t i, j, new_used;
5205 char *new;
Radek Krejci857189e2020-09-01 13:26:36 +02005206 ly_bool have_removed;
Michal Vasko03ff5a72019-09-11 13:49:33 +02005207 struct lysc_node_leaf *sleaf;
5208 LY_ERR rc = LY_SUCCESS;
5209
5210 if (options & LYXP_SCNODE_ALL) {
5211 if ((args[0]->type == LYXP_SET_SCNODE_SET) && (sleaf = (struct lysc_node_leaf *)warn_get_scnode_in_ctx(args[0]))) {
5212 if (!(sleaf->nodetype & (LYS_LEAF | LYS_LEAFLIST))) {
5213 LOGWRN(set->ctx, "Argument #1 of %s is a %s node \"%s\".", __func__, lys_nodetype2str(sleaf->nodetype), sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005214 } else if (!warn_is_string_type(sleaf->type)) {
5215 LOGWRN(set->ctx, "Argument #1 of %s is node \"%s\", not of string-type.", __func__, sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005216 }
5217 }
5218
5219 if ((args[1]->type == LYXP_SET_SCNODE_SET) && (sleaf = (struct lysc_node_leaf *)warn_get_scnode_in_ctx(args[1]))) {
5220 if (!(sleaf->nodetype & (LYS_LEAF | LYS_LEAFLIST))) {
5221 LOGWRN(set->ctx, "Argument #2 of %s is a %s node \"%s\".", __func__, lys_nodetype2str(sleaf->nodetype), sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005222 } else if (!warn_is_string_type(sleaf->type)) {
5223 LOGWRN(set->ctx, "Argument #2 of %s is node \"%s\", not of string-type.", __func__, sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005224 }
5225 }
5226
5227 if ((args[2]->type == LYXP_SET_SCNODE_SET) && (sleaf = (struct lysc_node_leaf *)warn_get_scnode_in_ctx(args[2]))) {
5228 if (!(sleaf->nodetype & (LYS_LEAF | LYS_LEAFLIST))) {
5229 LOGWRN(set->ctx, "Argument #3 of %s is a %s node \"%s\".", __func__, lys_nodetype2str(sleaf->nodetype), sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005230 } else if (!warn_is_string_type(sleaf->type)) {
5231 LOGWRN(set->ctx, "Argument #3 of %s is node \"%s\", not of string-type.", __func__, sleaf->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005232 }
5233 }
Michal Vasko1a09b212021-05-06 13:00:10 +02005234 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_VAL);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005235 return rc;
5236 }
5237
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01005238 rc = lyxp_set_cast(args[0], LYXP_SET_STRING);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005239 LY_CHECK_RET(rc);
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01005240 rc = lyxp_set_cast(args[1], LYXP_SET_STRING);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005241 LY_CHECK_RET(rc);
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01005242 rc = lyxp_set_cast(args[2], LYXP_SET_STRING);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005243 LY_CHECK_RET(rc);
5244
5245 new = malloc((strlen(args[0]->val.str) + 1) * sizeof(char));
5246 LY_CHECK_ERR_RET(!new, LOGMEM(set->ctx), LY_EMEM);
5247 new_used = 0;
5248
5249 have_removed = 0;
5250 for (i = 0; args[0]->val.str[i]; ++i) {
Radek Krejci857189e2020-09-01 13:26:36 +02005251 ly_bool found = 0;
Michal Vasko03ff5a72019-09-11 13:49:33 +02005252
5253 for (j = 0; args[1]->val.str[j]; ++j) {
5254 if (args[0]->val.str[i] == args[1]->val.str[j]) {
5255 /* removing this char */
5256 if (j >= strlen(args[2]->val.str)) {
5257 have_removed = 1;
5258 found = 1;
5259 break;
5260 }
5261 /* replacing this char */
5262 new[new_used] = args[2]->val.str[j];
5263 ++new_used;
5264 found = 1;
5265 break;
5266 }
5267 }
5268
5269 /* copying this char */
5270 if (!found) {
5271 new[new_used] = args[0]->val.str[i];
5272 ++new_used;
5273 }
5274 }
5275
5276 if (have_removed) {
5277 new = ly_realloc(new, (new_used + 1) * sizeof(char));
5278 LY_CHECK_ERR_RET(!new, LOGMEM(set->ctx), LY_EMEM);
5279 }
5280 new[new_used] = '\0';
5281
Michal Vaskod3678892020-05-21 10:06:58 +02005282 lyxp_set_free_content(set);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005283 set->type = LYXP_SET_STRING;
5284 set->val.str = new;
5285
5286 return LY_SUCCESS;
5287}
5288
5289/**
5290 * @brief Execute the XPath true() function. Returns LYXP_SET_BOOLEAN
5291 * with true value.
5292 *
5293 * @param[in] args Array of arguments.
5294 * @param[in] arg_count Count of elements in @p args.
5295 * @param[in,out] set Context and result set at the same time.
5296 * @param[in] options XPath options.
Michal Vasko0cbf54f2019-12-16 10:01:06 +01005297 * @return LY_ERR
Michal Vasko03ff5a72019-09-11 13:49:33 +02005298 */
5299static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02005300xpath_true(struct lyxp_set **UNUSED(args), uint16_t UNUSED(arg_count), struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02005301{
5302 if (options & LYXP_SCNODE_ALL) {
Michal Vasko1a09b212021-05-06 13:00:10 +02005303 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_NODE);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005304 return LY_SUCCESS;
5305 }
5306
5307 set_fill_boolean(set, 1);
5308 return LY_SUCCESS;
5309}
5310
Michal Vasko03ff5a72019-09-11 13:49:33 +02005311/**
Michal Vasko6346ece2019-09-24 13:12:53 +02005312 * @brief Skip prefix and return corresponding model if there is a prefix. Logs directly.
Michal Vasko03ff5a72019-09-11 13:49:33 +02005313 *
Michal Vasko2104e9f2020-03-06 08:23:25 +01005314 * XPath @p set is expected to be a (sc)node set!
5315 *
Michal Vasko6346ece2019-09-24 13:12:53 +02005316 * @param[in,out] qname Qualified node name. If includes prefix, it is skipped.
5317 * @param[in,out] qname_len Length of @p qname, is updated accordingly.
Michal Vasko5d24f6c2020-10-13 13:49:06 +02005318 * @param[in] set Set with general XPath context.
5319 * @param[in] ctx_scnode Context node to inherit module for unprefixed node for ::LY_PREF_JSON.
Michal Vasko6346ece2019-09-24 13:12:53 +02005320 * @param[out] moveto_mod Expected module of a matching node.
5321 * @return LY_ERR
Michal Vasko03ff5a72019-09-11 13:49:33 +02005322 */
Michal Vasko6346ece2019-09-24 13:12:53 +02005323static LY_ERR
Michal Vasko5d24f6c2020-10-13 13:49:06 +02005324moveto_resolve_model(const char **qname, uint16_t *qname_len, const struct lyxp_set *set,
5325 const struct lysc_node *ctx_scnode, const struct lys_module **moveto_mod)
Michal Vasko03ff5a72019-09-11 13:49:33 +02005326{
Michal Vaskoed4fcfe2020-07-08 10:38:56 +02005327 const struct lys_module *mod = NULL;
Michal Vasko6346ece2019-09-24 13:12:53 +02005328 const char *ptr;
Radek Krejci1deb5be2020-08-26 16:43:36 +02005329 size_t pref_len;
Michal Vasko03ff5a72019-09-11 13:49:33 +02005330
Michal Vasko2104e9f2020-03-06 08:23:25 +01005331 assert((set->type == LYXP_SET_NODE_SET) || (set->type == LYXP_SET_SCNODE_SET));
5332
Michal Vasko6346ece2019-09-24 13:12:53 +02005333 if ((ptr = ly_strnchr(*qname, ':', *qname_len))) {
5334 /* specific module */
5335 pref_len = ptr - *qname;
Michal Vasko5d24f6c2020-10-13 13:49:06 +02005336 mod = ly_resolve_prefix(set->ctx, *qname, pref_len, set->format, set->prefix_data);
Michal Vasko6346ece2019-09-24 13:12:53 +02005337
Michal Vasko004d3152020-06-11 19:59:22 +02005338 /* check for errors and non-implemented modules, as they are not valid */
Juraj Vijtiukd75faa62019-11-26 14:10:10 +01005339 if (!mod || !mod->implemented) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01005340 LOGVAL(set->ctx, LY_VCODE_XP_INMOD, pref_len, *qname);
Michal Vasko6346ece2019-09-24 13:12:53 +02005341 return LY_EVALID;
5342 }
Juraj Vijtiukd75faa62019-11-26 14:10:10 +01005343
Michal Vasko6346ece2019-09-24 13:12:53 +02005344 *qname += pref_len + 1;
5345 *qname_len -= pref_len + 1;
5346 } else if (((*qname)[0] == '*') && (*qname_len == 1)) {
5347 /* all modules - special case */
Michal Vasko03ff5a72019-09-11 13:49:33 +02005348 mod = NULL;
Michal Vasko6346ece2019-09-24 13:12:53 +02005349 } else {
Michal Vasko5d24f6c2020-10-13 13:49:06 +02005350 switch (set->format) {
Radek Krejci8df109d2021-04-23 12:19:08 +02005351 case LY_VALUE_SCHEMA:
5352 case LY_VALUE_SCHEMA_RESOLVED:
Michal Vasko5d24f6c2020-10-13 13:49:06 +02005353 /* current module */
5354 mod = set->cur_mod;
5355 break;
Radek Krejci224d4b42021-04-23 13:54:59 +02005356 case LY_VALUE_CANON:
Radek Krejci8df109d2021-04-23 12:19:08 +02005357 case LY_VALUE_JSON:
Radek Krejcif9943642021-04-26 10:18:21 +02005358 case LY_VALUE_LYB:
Michal Vasko5d24f6c2020-10-13 13:49:06 +02005359 /* inherit parent (context node) module */
5360 if (ctx_scnode) {
5361 mod = ctx_scnode->module;
5362 } else {
5363 mod = NULL;
5364 }
5365 break;
Radek Krejci8df109d2021-04-23 12:19:08 +02005366 case LY_VALUE_XML:
Michal Vasko52143d12021-04-14 15:36:39 +02005367 /* all nodes need to be prefixed */
5368 LOGVAL(set->ctx, LYVE_DATA, "Non-prefixed node \"%.*s\" in XML xpath found.", *qname_len, *qname);
5369 return LY_EVALID;
Michal Vasko5d24f6c2020-10-13 13:49:06 +02005370 }
Michal Vasko03ff5a72019-09-11 13:49:33 +02005371 }
5372
Michal Vasko6346ece2019-09-24 13:12:53 +02005373 *moveto_mod = mod;
5374 return LY_SUCCESS;
Michal Vasko03ff5a72019-09-11 13:49:33 +02005375}
5376
5377/**
Michal Vasko03ff5a72019-09-11 13:49:33 +02005378 * @brief Move context @p set to the root. Handles absolute path.
5379 * Result is LYXP_SET_NODE_SET.
5380 *
5381 * @param[in,out] set Set to use.
5382 * @param[in] options Xpath options.
Michal Vaskob0099a92020-08-31 14:55:23 +02005383 * @return LY_ERR value.
Michal Vasko03ff5a72019-09-11 13:49:33 +02005384 */
Michal Vaskob0099a92020-08-31 14:55:23 +02005385static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02005386moveto_root(struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02005387{
aPiecek8b0cc152021-05-31 16:40:31 +02005388 assert(!(options & LYXP_SKIP_EXPR));
Michal Vasko03ff5a72019-09-11 13:49:33 +02005389
5390 if (options & LYXP_SCNODE_ALL) {
Michal Vasko1a09b212021-05-06 13:00:10 +02005391 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_NODE);
Michal Vaskob0099a92020-08-31 14:55:23 +02005392 LY_CHECK_RET(lyxp_set_scnode_insert_node(set, NULL, set->root_type, NULL));
Michal Vasko03ff5a72019-09-11 13:49:33 +02005393 } else {
Michal Vaskod3678892020-05-21 10:06:58 +02005394 set->type = LYXP_SET_NODE_SET;
5395 set->used = 0;
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01005396 set_insert_node(set, NULL, 0, set->root_type, 0);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005397 }
Michal Vaskob0099a92020-08-31 14:55:23 +02005398
5399 return LY_SUCCESS;
Michal Vasko03ff5a72019-09-11 13:49:33 +02005400}
5401
5402/**
5403 * @brief Check @p node as a part of NameTest processing.
5404 *
5405 * @param[in] node Node to check.
Michal Vasko5d24f6c2020-10-13 13:49:06 +02005406 * @param[in] set Set to read general context from.
Michal Vaskod3678892020-05-21 10:06:58 +02005407 * @param[in] node_name Node name in the dictionary to move to, NULL for any node.
Michal Vasko5d24f6c2020-10-13 13:49:06 +02005408 * @param[in] moveto_mod Expected module of the node, NULL for no prefix.
Michal Vaskocdad7122020-11-09 21:04:44 +01005409 * @param[in] options XPath options.
Michal Vasko6346ece2019-09-24 13:12:53 +02005410 * @return LY_ERR (LY_ENOT if node does not match, LY_EINCOMPLETE on unresolved when,
5411 * LY_EINVAL if netither node nor any children match)
Michal Vasko03ff5a72019-09-11 13:49:33 +02005412 */
5413static LY_ERR
Michal Vaskodb08ce52021-10-06 08:57:49 +02005414moveto_node_check(const struct lyd_node *node, const struct lyxp_set *set, const char *node_name,
5415 const struct lys_module *moveto_mod, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02005416{
Michal Vaskodca9f122021-07-16 13:56:22 +02005417 if (!node->schema) {
5418 /* opaque node never matches */
5419 return LY_ENOT;
5420 }
5421
Michal Vasko03ff5a72019-09-11 13:49:33 +02005422 /* module check */
5423 if (moveto_mod && (node->schema->module != moveto_mod)) {
Michal Vasko6346ece2019-09-24 13:12:53 +02005424 return LY_ENOT;
Michal Vasko03ff5a72019-09-11 13:49:33 +02005425 }
5426
Michal Vasko5c4e5892019-11-14 12:31:38 +01005427 /* context check */
Michal Vasko5d24f6c2020-10-13 13:49:06 +02005428 if ((set->root_type == LYXP_NODE_ROOT_CONFIG) && (node->schema->flags & LYS_CONFIG_R)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02005429 return LY_EINVAL;
Michal Vasko5d24f6c2020-10-13 13:49:06 +02005430 } else if (set->context_op && (node->schema->nodetype & (LYS_RPC | LYS_ACTION | LYS_NOTIF)) &&
5431 (node->schema != set->context_op)) {
Michal Vasko6b26e742020-07-17 15:02:10 +02005432 return LY_EINVAL;
Michal Vasko03ff5a72019-09-11 13:49:33 +02005433 }
5434
5435 /* name check */
Michal Vasko61ac2f62020-05-25 12:39:51 +02005436 if (node_name && strcmp(node_name, "*") && (node->schema->name != node_name)) {
Michal Vasko6346ece2019-09-24 13:12:53 +02005437 return LY_ENOT;
Michal Vasko03ff5a72019-09-11 13:49:33 +02005438 }
5439
Michal Vaskoa1424542019-11-14 16:08:52 +01005440 /* when check */
Michal Vaskod5cfa6e2020-11-23 16:56:08 +01005441 if (!(options & LYXP_IGNORE_WHEN) && lysc_has_when(node->schema) && !(node->flags & LYD_WHEN_TRUE)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02005442 return LY_EINCOMPLETE;
Michal Vaskoa1424542019-11-14 16:08:52 +01005443 }
Michal Vasko03ff5a72019-09-11 13:49:33 +02005444
5445 /* match */
5446 return LY_SUCCESS;
5447}
5448
5449/**
5450 * @brief Check @p node as a part of schema NameTest processing.
5451 *
5452 * @param[in] node Schema node to check.
Michal Vasko5d24f6c2020-10-13 13:49:06 +02005453 * @param[in] ctx_scnode Context node.
5454 * @param[in] set Set to read general context from.
Michal Vaskod3678892020-05-21 10:06:58 +02005455 * @param[in] node_name Node name in the dictionary to move to, NULL for any nodes.
Michal Vasko5d24f6c2020-10-13 13:49:06 +02005456 * @param[in] moveto_mod Expected module of the node, NULL for no prefix.
Michal Vasko6346ece2019-09-24 13:12:53 +02005457 * @return LY_ERR (LY_ENOT if node does not match, LY_EINVAL if neither node nor any children match)
Michal Vasko03ff5a72019-09-11 13:49:33 +02005458 */
5459static LY_ERR
Michal Vasko5d24f6c2020-10-13 13:49:06 +02005460moveto_scnode_check(const struct lysc_node *node, const struct lysc_node *ctx_scnode, const struct lyxp_set *set,
Radek Krejci0f969882020-08-21 16:56:47 +02005461 const char *node_name, const struct lys_module *moveto_mod)
Michal Vasko03ff5a72019-09-11 13:49:33 +02005462{
Michal Vasko5d24f6c2020-10-13 13:49:06 +02005463 if (!moveto_mod && (!node_name || strcmp(node_name, "*"))) {
5464 switch (set->format) {
Radek Krejci8df109d2021-04-23 12:19:08 +02005465 case LY_VALUE_SCHEMA:
5466 case LY_VALUE_SCHEMA_RESOLVED:
Michal Vasko5d24f6c2020-10-13 13:49:06 +02005467 /* use current module */
5468 moveto_mod = set->cur_mod;
5469 break;
Radek Krejci8df109d2021-04-23 12:19:08 +02005470 case LY_VALUE_JSON:
Radek Krejcif9943642021-04-26 10:18:21 +02005471 case LY_VALUE_LYB:
Michal Vasko5d24f6c2020-10-13 13:49:06 +02005472 /* inherit module of the context node, if any */
5473 if (ctx_scnode) {
5474 moveto_mod = ctx_scnode->module;
5475 }
5476 break;
Radek Krejci224d4b42021-04-23 13:54:59 +02005477 case LY_VALUE_CANON:
Radek Krejci8df109d2021-04-23 12:19:08 +02005478 case LY_VALUE_XML:
Michal Vasko5d24f6c2020-10-13 13:49:06 +02005479 /* not defined */
5480 LOGINT(set->ctx);
5481 return LY_EINVAL;
5482 }
5483 }
5484
Michal Vasko03ff5a72019-09-11 13:49:33 +02005485 /* module check */
Michal Vaskod3678892020-05-21 10:06:58 +02005486 if (moveto_mod && (node->module != moveto_mod)) {
Michal Vasko6346ece2019-09-24 13:12:53 +02005487 return LY_ENOT;
Michal Vasko03ff5a72019-09-11 13:49:33 +02005488 }
5489
5490 /* context check */
Michal Vasko5d24f6c2020-10-13 13:49:06 +02005491 if ((set->root_type == LYXP_NODE_ROOT_CONFIG) && (node->flags & LYS_CONFIG_R)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02005492 return LY_EINVAL;
Michal Vasko5d24f6c2020-10-13 13:49:06 +02005493 } else if (set->context_op && (node->nodetype & (LYS_RPC | LYS_ACTION | LYS_NOTIF)) && (node != set->context_op)) {
Michal Vasko6b26e742020-07-17 15:02:10 +02005494 return LY_EINVAL;
Michal Vasko03ff5a72019-09-11 13:49:33 +02005495 }
5496
5497 /* name check */
Michal Vasko61ac2f62020-05-25 12:39:51 +02005498 if (node_name && strcmp(node_name, "*") && (node->name != node_name)) {
Michal Vasko6346ece2019-09-24 13:12:53 +02005499 return LY_ENOT;
Michal Vasko03ff5a72019-09-11 13:49:33 +02005500 }
5501
5502 /* match */
5503 return LY_SUCCESS;
5504}
5505
5506/**
Michal Vaskod3678892020-05-21 10:06:58 +02005507 * @brief Move context @p set to a node. Result is LYXP_SET_NODE_SET (or LYXP_SET_EMPTY). Context position aware.
Michal Vasko03ff5a72019-09-11 13:49:33 +02005508 *
5509 * @param[in,out] set Set to use.
Michal Vasko5d24f6c2020-10-13 13:49:06 +02005510 * @param[in] moveto_mod Matching node module, NULL for no prefix.
Michal Vaskod3678892020-05-21 10:06:58 +02005511 * @param[in] ncname Matching node name in the dictionary, NULL for any.
Michal Vaskocdad7122020-11-09 21:04:44 +01005512 * @param[in] options XPath options.
Michal Vasko03ff5a72019-09-11 13:49:33 +02005513 * @return LY_ERR (LY_EINCOMPLETE on unresolved when)
5514 */
5515static LY_ERR
Michal Vaskocdad7122020-11-09 21:04:44 +01005516moveto_node(struct lyxp_set *set, const struct lys_module *moveto_mod, const char *ncname, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02005517{
Michal Vasko9d414112021-12-02 12:31:00 +01005518 LY_ERR r, rc = LY_SUCCESS;
Michal Vaskodb08ce52021-10-06 08:57:49 +02005519 const struct lyd_node *siblings, *sub;
Michal Vasko9d414112021-12-02 12:31:00 +01005520 struct lyxp_set result;
Michal Vasko03ff5a72019-09-11 13:49:33 +02005521
aPiecek8b0cc152021-05-31 16:40:31 +02005522 if (options & LYXP_SKIP_EXPR) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02005523 return LY_SUCCESS;
5524 }
5525
5526 if (set->type != LYXP_SET_NODE_SET) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01005527 LOGVAL(set->ctx, LY_VCODE_XP_INOP_1, "path operator", print_set_type(set));
Michal Vasko03ff5a72019-09-11 13:49:33 +02005528 return LY_EVALID;
5529 }
5530
Michal Vasko9d414112021-12-02 12:31:00 +01005531 /* init result set */
5532 set_init(&result, set);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005533
Michal Vasko9d414112021-12-02 12:31:00 +01005534 for (uint32_t i = 0; i < set->used; ++i) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02005535 if ((set->val.nodes[i].type == LYXP_NODE_ROOT_CONFIG) || (set->val.nodes[i].type == LYXP_NODE_ROOT)) {
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01005536 assert(!set->val.nodes[i].node);
Michal Vaskod3678892020-05-21 10:06:58 +02005537
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01005538 /* search in all the trees */
Michal Vaskod3678892020-05-21 10:06:58 +02005539 siblings = set->tree;
Michal Vasko5bfd4be2020-06-23 13:26:19 +02005540 } else {
Michal Vaskod3678892020-05-21 10:06:58 +02005541 /* search in children */
Michal Vaskodb08ce52021-10-06 08:57:49 +02005542 siblings = lyd_child(set->val.nodes[i].node);
Michal Vaskod3678892020-05-21 10:06:58 +02005543 }
Michal Vasko03ff5a72019-09-11 13:49:33 +02005544
Michal Vaskod3678892020-05-21 10:06:58 +02005545 for (sub = siblings; sub; sub = sub->next) {
Michal Vasko9d414112021-12-02 12:31:00 +01005546 r = moveto_node_check(sub, set, ncname, moveto_mod, options);
5547 if (r == LY_SUCCESS) {
5548 /* matching node */
5549 set_insert_node(&result, sub, 0, LYXP_NODE_ELEM, result.used);
5550 } else if (r == LY_EINCOMPLETE) {
5551 rc = r;
5552 goto cleanup;
Michal Vasko03ff5a72019-09-11 13:49:33 +02005553 }
5554 }
Michal Vasko03ff5a72019-09-11 13:49:33 +02005555 }
Michal Vasko03ff5a72019-09-11 13:49:33 +02005556
Michal Vasko9d414112021-12-02 12:31:00 +01005557 /* move result to the set */
5558 lyxp_set_free_content(set);
5559 *set = result;
5560 result.type = LYXP_SET_NUMBER;
5561 assert(!set_sort(set));
5562
5563cleanup:
5564 lyxp_set_free_content(&result);
5565 return rc;
Michal Vasko03ff5a72019-09-11 13:49:33 +02005566}
5567
5568/**
Michal Vaskod3678892020-05-21 10:06:58 +02005569 * @brief Move context @p set to a node using hashes. Result is LYXP_SET_NODE_SET (or LYXP_SET_EMPTY).
5570 * Context position aware.
Michal Vasko03ff5a72019-09-11 13:49:33 +02005571 *
5572 * @param[in,out] set Set to use.
Michal Vaskod3678892020-05-21 10:06:58 +02005573 * @param[in] scnode Matching node schema.
Michal Vasko004d3152020-06-11 19:59:22 +02005574 * @param[in] predicates If @p scnode is ::LYS_LIST or ::LYS_LEAFLIST, the predicates specifying a single instance.
Michal Vaskocdad7122020-11-09 21:04:44 +01005575 * @param[in] options XPath options.
Michal Vaskod3678892020-05-21 10:06:58 +02005576 * @return LY_ERR (LY_EINCOMPLETE on unresolved when)
5577 */
5578static LY_ERR
Michal Vaskocdad7122020-11-09 21:04:44 +01005579moveto_node_hash(struct lyxp_set *set, const struct lysc_node *scnode, const struct ly_path_predicate *predicates,
5580 uint32_t options)
Michal Vaskod3678892020-05-21 10:06:58 +02005581{
Michal Vasko004d3152020-06-11 19:59:22 +02005582 LY_ERR ret = LY_SUCCESS;
Michal Vaskod3678892020-05-21 10:06:58 +02005583 uint32_t i;
Michal Vaskod3678892020-05-21 10:06:58 +02005584 const struct lyd_node *siblings;
Michal Vasko9d414112021-12-02 12:31:00 +01005585 struct lyxp_set result;
Michal Vasko004d3152020-06-11 19:59:22 +02005586 struct lyd_node *sub, *inst = NULL;
Michal Vaskod3678892020-05-21 10:06:58 +02005587
Michal Vasko004d3152020-06-11 19:59:22 +02005588 assert(scnode && (!(scnode->nodetype & (LYS_LIST | LYS_LEAFLIST)) || predicates));
Michal Vaskod3678892020-05-21 10:06:58 +02005589
Michal Vaskoa5af7762021-12-02 13:11:56 +01005590 /* init result set */
5591 set_init(&result, set);
5592
aPiecek8b0cc152021-05-31 16:40:31 +02005593 if (options & LYXP_SKIP_EXPR) {
Michal Vasko004d3152020-06-11 19:59:22 +02005594 goto cleanup;
Michal Vaskod3678892020-05-21 10:06:58 +02005595 }
5596
5597 if (set->type != LYXP_SET_NODE_SET) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01005598 LOGVAL(set->ctx, LY_VCODE_XP_INOP_1, "path operator", print_set_type(set));
Michal Vasko004d3152020-06-11 19:59:22 +02005599 ret = LY_EVALID;
5600 goto cleanup;
Michal Vaskod3678892020-05-21 10:06:58 +02005601 }
5602
5603 /* context check for all the nodes since we have the schema node */
5604 if ((set->root_type == LYXP_NODE_ROOT_CONFIG) && (scnode->flags & LYS_CONFIG_R)) {
5605 lyxp_set_free_content(set);
Michal Vasko004d3152020-06-11 19:59:22 +02005606 goto cleanup;
Michal Vasko69730152020-10-09 16:30:07 +02005607 } else if (set->context_op && (scnode->nodetype & (LYS_RPC | LYS_ACTION | LYS_NOTIF)) &&
5608 (scnode != set->context_op)) {
Michal Vasko6b26e742020-07-17 15:02:10 +02005609 lyxp_set_free_content(set);
5610 goto cleanup;
Michal Vasko004d3152020-06-11 19:59:22 +02005611 }
5612
5613 /* create specific data instance if needed */
5614 if (scnode->nodetype == LYS_LIST) {
5615 LY_CHECK_GOTO(ret = lyd_create_list(scnode, predicates, &inst), cleanup);
5616 } else if (scnode->nodetype == LYS_LEAFLIST) {
5617 LY_CHECK_GOTO(ret = lyd_create_term2(scnode, &predicates[0].value, &inst), cleanup);
Michal Vaskod3678892020-05-21 10:06:58 +02005618 }
5619
Michal Vasko9d414112021-12-02 12:31:00 +01005620 for (i = 0; i < set->used; ++i) {
Michal Vaskod3678892020-05-21 10:06:58 +02005621 siblings = NULL;
5622
5623 if ((set->val.nodes[i].type == LYXP_NODE_ROOT_CONFIG) || (set->val.nodes[i].type == LYXP_NODE_ROOT)) {
5624 assert(!set->val.nodes[i].node);
5625
5626 /* search in all the trees */
5627 siblings = set->tree;
5628 } else if (set->val.nodes[i].type == LYXP_NODE_ELEM) {
5629 /* search in children */
Radek Krejcia1c1e542020-09-29 16:06:52 +02005630 siblings = lyd_child(set->val.nodes[i].node);
Michal Vaskod3678892020-05-21 10:06:58 +02005631 }
5632
5633 /* find the node using hashes */
Michal Vasko004d3152020-06-11 19:59:22 +02005634 if (inst) {
5635 lyd_find_sibling_first(siblings, inst, &sub);
Michal Vaskod3678892020-05-21 10:06:58 +02005636 } else {
Michal Vasko004d3152020-06-11 19:59:22 +02005637 lyd_find_sibling_val(siblings, scnode, NULL, 0, &sub);
Michal Vaskod3678892020-05-21 10:06:58 +02005638 }
5639
5640 /* when check */
Michal Vaskod5cfa6e2020-11-23 16:56:08 +01005641 if (!(options & LYXP_IGNORE_WHEN) && sub && lysc_has_when(sub->schema) && !(sub->flags & LYD_WHEN_TRUE)) {
Michal Vasko004d3152020-06-11 19:59:22 +02005642 ret = LY_EINCOMPLETE;
5643 goto cleanup;
Michal Vaskod3678892020-05-21 10:06:58 +02005644 }
5645
5646 if (sub) {
5647 /* pos filled later */
Michal Vasko9d414112021-12-02 12:31:00 +01005648 set_insert_node(&result, sub, 0, LYXP_NODE_ELEM, result.used);
Michal Vaskod3678892020-05-21 10:06:58 +02005649 }
5650 }
5651
Michal Vasko9d414112021-12-02 12:31:00 +01005652 /* move result to the set */
5653 lyxp_set_free_content(set);
5654 *set = result;
5655 result.type = LYXP_SET_NUMBER;
5656 assert(!set_sort(set));
5657
Michal Vasko004d3152020-06-11 19:59:22 +02005658cleanup:
Michal Vasko9d414112021-12-02 12:31:00 +01005659 lyxp_set_free_content(&result);
Michal Vasko004d3152020-06-11 19:59:22 +02005660 lyd_free_tree(inst);
5661 return ret;
Michal Vaskod3678892020-05-21 10:06:58 +02005662}
5663
5664/**
5665 * @brief Move context @p set to a schema node. Result is LYXP_SET_SCNODE_SET (or LYXP_SET_EMPTY).
5666 *
5667 * @param[in,out] set Set to use.
Michal Vasko5d24f6c2020-10-13 13:49:06 +02005668 * @param[in] moveto_mod Matching node module, NULL for no prefix.
Michal Vaskod3678892020-05-21 10:06:58 +02005669 * @param[in] ncname Matching node name in the dictionary, NULL for any.
Michal Vasko03ff5a72019-09-11 13:49:33 +02005670 * @param[in] options XPath options.
5671 * @return LY_ERR
5672 */
5673static LY_ERR
Michal Vasko5d24f6c2020-10-13 13:49:06 +02005674moveto_scnode(struct lyxp_set *set, const struct lys_module *moveto_mod, const char *ncname, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02005675{
Radek Krejci857189e2020-09-01 13:26:36 +02005676 ly_bool temp_ctx = 0;
Radek Krejci1deb5be2020-08-26 16:43:36 +02005677 uint32_t getnext_opts;
5678 uint32_t orig_used, i;
Michal Vasko03ff5a72019-09-11 13:49:33 +02005679 uint32_t mod_idx;
Michal Vasko519fd602020-05-26 12:17:39 +02005680 const struct lysc_node *iter, *start_parent;
Michal Vasko5d24f6c2020-10-13 13:49:06 +02005681 const struct lys_module *mod;
Michal Vasko03ff5a72019-09-11 13:49:33 +02005682
aPiecek8b0cc152021-05-31 16:40:31 +02005683 if (options & LYXP_SKIP_EXPR) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02005684 return LY_SUCCESS;
5685 }
5686
5687 if (set->type != LYXP_SET_SCNODE_SET) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01005688 LOGVAL(set->ctx, LY_VCODE_XP_INOP_1, "path operator", print_set_type(set));
Michal Vasko03ff5a72019-09-11 13:49:33 +02005689 return LY_EVALID;
5690 }
5691
Michal Vaskocafad9d2019-11-07 15:20:03 +01005692 /* getnext opts */
Michal Vasko7b1ad1a2020-11-02 15:41:27 +01005693 getnext_opts = 0;
Michal Vaskocafad9d2019-11-07 15:20:03 +01005694 if (options & LYXP_SCNODE_OUTPUT) {
5695 getnext_opts |= LYS_GETNEXT_OUTPUT;
5696 }
5697
Michal Vasko03ff5a72019-09-11 13:49:33 +02005698 orig_used = set->used;
5699 for (i = 0; i < orig_used; ++i) {
Radek Krejciaa6b53f2020-08-27 15:19:03 +02005700 uint32_t idx;
5701
Radek Krejcif13b87b2020-12-01 22:02:17 +01005702 if (set->val.scnodes[i].in_ctx != LYXP_SET_SCNODE_ATOM_CTX) {
5703 if (set->val.scnodes[i].in_ctx != LYXP_SET_SCNODE_START) {
Michal Vasko5c4e5892019-11-14 12:31:38 +01005704 continue;
5705 }
5706
5707 /* remember context node */
Radek Krejcif13b87b2020-12-01 22:02:17 +01005708 set->val.scnodes[i].in_ctx = LYXP_SET_SCNODE_START_USED;
Michal Vaskoec4df482019-12-16 10:02:18 +01005709 } else {
Michal Vasko1a09b212021-05-06 13:00:10 +02005710 set->val.scnodes[i].in_ctx = LYXP_SET_SCNODE_ATOM_NODE;
Michal Vasko03ff5a72019-09-11 13:49:33 +02005711 }
Michal Vasko03ff5a72019-09-11 13:49:33 +02005712
5713 start_parent = set->val.scnodes[i].scnode;
5714
5715 if ((set->val.scnodes[i].type == LYXP_NODE_ROOT_CONFIG) || (set->val.scnodes[i].type == LYXP_NODE_ROOT)) {
Michal Vasko5d24f6c2020-10-13 13:49:06 +02005716 /* it can actually be in any module, it's all <running>, and even if it's moveto_mod (if set),
Michal Vasko9e9f26d2020-10-12 16:31:33 +02005717 * it can be in a top-level augment (the root node itself is useless in this case) */
Michal Vasko03ff5a72019-09-11 13:49:33 +02005718 mod_idx = 0;
Michal Vaskoa51ef072021-07-02 10:40:30 +02005719 while ((mod = ly_ctx_get_module_iter(set->ctx, &mod_idx))) {
Michal Vasko519fd602020-05-26 12:17:39 +02005720 iter = NULL;
Michal Vasko919954a2021-07-26 09:21:42 +02005721 /* module may not be implemented or not compiled yet */
5722 while (mod->compiled && (iter = lys_getnext(iter, NULL, mod->compiled, getnext_opts))) {
Michal Vasko5d24f6c2020-10-13 13:49:06 +02005723 if (!moveto_scnode_check(iter, NULL, set, ncname, moveto_mod)) {
Radek Krejciaa6b53f2020-08-27 15:19:03 +02005724 LY_CHECK_RET(lyxp_set_scnode_insert_node(set, iter, LYXP_NODE_ELEM, &idx));
5725
Michal Vasko03ff5a72019-09-11 13:49:33 +02005726 /* we need to prevent these nodes from being considered in this moveto */
Radek Krejciaa6b53f2020-08-27 15:19:03 +02005727 if ((idx < orig_used) && (idx > i)) {
Radek Krejcif13b87b2020-12-01 22:02:17 +01005728 set->val.scnodes[idx].in_ctx = LYXP_SET_SCNODE_ATOM_NEW_CTX;
Michal Vasko03ff5a72019-09-11 13:49:33 +02005729 temp_ctx = 1;
5730 }
5731 }
5732 }
Michal Vasko03ff5a72019-09-11 13:49:33 +02005733 }
5734
Michal Vasko519fd602020-05-26 12:17:39 +02005735 } else if (set->val.scnodes[i].type == LYXP_NODE_ELEM) {
5736 iter = NULL;
5737 while ((iter = lys_getnext(iter, start_parent, NULL, getnext_opts))) {
Michal Vasko5d24f6c2020-10-13 13:49:06 +02005738 if (!moveto_scnode_check(iter, start_parent, set, ncname, moveto_mod)) {
Radek Krejciaa6b53f2020-08-27 15:19:03 +02005739 LY_CHECK_RET(lyxp_set_scnode_insert_node(set, iter, LYXP_NODE_ELEM, &idx));
5740
5741 if ((idx < orig_used) && (idx > i)) {
Radek Krejcif13b87b2020-12-01 22:02:17 +01005742 set->val.scnodes[idx].in_ctx = LYXP_SET_SCNODE_ATOM_NEW_CTX;
Michal Vasko03ff5a72019-09-11 13:49:33 +02005743 temp_ctx = 1;
5744 }
5745 }
5746 }
5747 }
5748 }
Michal Vasko03ff5a72019-09-11 13:49:33 +02005749
5750 /* correct temporary in_ctx values */
5751 if (temp_ctx) {
5752 for (i = 0; i < orig_used; ++i) {
Radek Krejcif13b87b2020-12-01 22:02:17 +01005753 if (set->val.scnodes[i].in_ctx == LYXP_SET_SCNODE_ATOM_NEW_CTX) {
5754 set->val.scnodes[i].in_ctx = LYXP_SET_SCNODE_ATOM_CTX;
Michal Vasko03ff5a72019-09-11 13:49:33 +02005755 }
5756 }
5757 }
5758
5759 return LY_SUCCESS;
5760}
5761
5762/**
Michal Vaskod3678892020-05-21 10:06:58 +02005763 * @brief Move context @p set to a node and all its descendants. Result is LYXP_SET_NODE_SET (or LYXP_SET_EMPTY).
Michal Vasko03ff5a72019-09-11 13:49:33 +02005764 * Context position aware.
5765 *
5766 * @param[in] set Set to use.
Michal Vasko5d24f6c2020-10-13 13:49:06 +02005767 * @param[in] moveto_mod Matching node module, NULL for no prefix.
Michal Vaskod3678892020-05-21 10:06:58 +02005768 * @param[in] ncname Matching node name in the dictionary, NULL for any.
Michal Vaskocdad7122020-11-09 21:04:44 +01005769 * @param[in] options XPath options.
Michal Vasko03ff5a72019-09-11 13:49:33 +02005770 * @return LY_ERR (LY_EINCOMPLETE on unresolved when)
5771 */
5772static LY_ERR
Michal Vaskocdad7122020-11-09 21:04:44 +01005773moveto_node_alldesc(struct lyxp_set *set, const struct lys_module *moveto_mod, const char *ncname, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02005774{
5775 uint32_t i;
Michal Vasko03ff5a72019-09-11 13:49:33 +02005776 const struct lyd_node *next, *elem, *start;
Michal Vasko03ff5a72019-09-11 13:49:33 +02005777 struct lyxp_set ret_set;
5778 LY_ERR rc;
5779
aPiecek8b0cc152021-05-31 16:40:31 +02005780 if (options & LYXP_SKIP_EXPR) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02005781 return LY_SUCCESS;
5782 }
5783
5784 if (set->type != LYXP_SET_NODE_SET) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01005785 LOGVAL(set->ctx, LY_VCODE_XP_INOP_1, "path operator", print_set_type(set));
Michal Vasko03ff5a72019-09-11 13:49:33 +02005786 return LY_EVALID;
5787 }
5788
Michal Vasko9f96a052020-03-10 09:41:45 +01005789 /* replace the original nodes (and throws away all text and meta nodes, root is replaced by a child) */
Michal Vaskocdad7122020-11-09 21:04:44 +01005790 rc = moveto_node(set, NULL, NULL, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005791 LY_CHECK_RET(rc);
5792
Michal Vasko6346ece2019-09-24 13:12:53 +02005793 /* this loop traverses all the nodes in the set and adds/keeps only those that match qname */
Michal Vasko03ff5a72019-09-11 13:49:33 +02005794 set_init(&ret_set, set);
5795 for (i = 0; i < set->used; ++i) {
5796
5797 /* TREE DFS */
5798 start = set->val.nodes[i].node;
5799 for (elem = next = start; elem; elem = next) {
Michal Vaskodb08ce52021-10-06 08:57:49 +02005800 rc = moveto_node_check(elem, set, ncname, moveto_mod, options);
Michal Vasko6346ece2019-09-24 13:12:53 +02005801 if (!rc) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02005802 /* add matching node into result set */
5803 set_insert_node(&ret_set, elem, 0, LYXP_NODE_ELEM, ret_set.used);
5804 if (set_dup_node_check(set, elem, LYXP_NODE_ELEM, i)) {
5805 /* the node is a duplicate, we'll process it later in the set */
5806 goto skip_children;
5807 }
Michal Vasko6346ece2019-09-24 13:12:53 +02005808 } else if (rc == LY_EINCOMPLETE) {
Michal Vasko6346ece2019-09-24 13:12:53 +02005809 return rc;
5810 } else if (rc == LY_EINVAL) {
5811 goto skip_children;
Michal Vasko03ff5a72019-09-11 13:49:33 +02005812 }
5813
5814 /* TREE DFS NEXT ELEM */
5815 /* select element for the next run - children first */
Radek Krejcia1c1e542020-09-29 16:06:52 +02005816 next = lyd_child(elem);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005817 if (!next) {
5818skip_children:
5819 /* no children, so try siblings, but only if it's not the start,
5820 * that is considered to be the root and it's siblings are not traversed */
5821 if (elem != start) {
5822 next = elem->next;
5823 } else {
5824 break;
5825 }
5826 }
5827 while (!next) {
5828 /* no siblings, go back through the parents */
Michal Vasko9e685082021-01-29 14:49:09 +01005829 if (lyd_parent(elem) == start) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02005830 /* we are done, no next element to process */
5831 break;
5832 }
5833 /* parent is already processed, go to its sibling */
Michal Vasko9e685082021-01-29 14:49:09 +01005834 elem = lyd_parent(elem);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005835 next = elem->next;
5836 }
5837 }
5838 }
5839
5840 /* make the temporary set the current one */
5841 ret_set.ctx_pos = set->ctx_pos;
5842 ret_set.ctx_size = set->ctx_size;
Michal Vaskod3678892020-05-21 10:06:58 +02005843 lyxp_set_free_content(set);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005844 memcpy(set, &ret_set, sizeof *set);
5845
5846 return LY_SUCCESS;
5847}
5848
5849/**
Michal Vasko61ac2f62020-05-25 12:39:51 +02005850 * @brief Move context @p set to a schema node and all its descendants. Result is LYXP_SET_NODE_SET.
Michal Vasko03ff5a72019-09-11 13:49:33 +02005851 *
5852 * @param[in] set Set to use.
Michal Vasko5d24f6c2020-10-13 13:49:06 +02005853 * @param[in] moveto_mod Matching node module, NULL for no prefix.
Michal Vaskod3678892020-05-21 10:06:58 +02005854 * @param[in] ncname Matching node name in the dictionary, NULL for any.
Michal Vasko03ff5a72019-09-11 13:49:33 +02005855 * @param[in] options XPath options.
5856 * @return LY_ERR
5857 */
5858static LY_ERR
Michal Vasko5d24f6c2020-10-13 13:49:06 +02005859moveto_scnode_alldesc(struct lyxp_set *set, const struct lys_module *moveto_mod, const char *ncname, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02005860{
Radek Krejci1deb5be2020-08-26 16:43:36 +02005861 uint32_t i, orig_used;
Michal Vasko03ff5a72019-09-11 13:49:33 +02005862 const struct lysc_node *next, *elem, *start;
Michal Vasko6346ece2019-09-24 13:12:53 +02005863 LY_ERR rc;
Michal Vasko03ff5a72019-09-11 13:49:33 +02005864
aPiecek8b0cc152021-05-31 16:40:31 +02005865 if (options & LYXP_SKIP_EXPR) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02005866 return LY_SUCCESS;
5867 }
5868
5869 if (set->type != LYXP_SET_SCNODE_SET) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01005870 LOGVAL(set->ctx, LY_VCODE_XP_INOP_1, "path operator", print_set_type(set));
Michal Vasko03ff5a72019-09-11 13:49:33 +02005871 return LY_EVALID;
5872 }
5873
Michal Vasko03ff5a72019-09-11 13:49:33 +02005874 orig_used = set->used;
5875 for (i = 0; i < orig_used; ++i) {
Radek Krejcif13b87b2020-12-01 22:02:17 +01005876 if (set->val.scnodes[i].in_ctx != LYXP_SET_SCNODE_ATOM_CTX) {
5877 if (set->val.scnodes[i].in_ctx != LYXP_SET_SCNODE_START) {
Michal Vasko5c4e5892019-11-14 12:31:38 +01005878 continue;
5879 }
5880
5881 /* remember context node */
Radek Krejcif13b87b2020-12-01 22:02:17 +01005882 set->val.scnodes[i].in_ctx = LYXP_SET_SCNODE_START_USED;
Michal Vaskoec4df482019-12-16 10:02:18 +01005883 } else {
Michal Vasko1a09b212021-05-06 13:00:10 +02005884 set->val.scnodes[i].in_ctx = LYXP_SET_SCNODE_ATOM_NODE;
Michal Vasko03ff5a72019-09-11 13:49:33 +02005885 }
Michal Vasko03ff5a72019-09-11 13:49:33 +02005886
5887 /* TREE DFS */
5888 start = set->val.scnodes[i].scnode;
5889 for (elem = next = start; elem; elem = next) {
Michal Vasko6346ece2019-09-24 13:12:53 +02005890 if ((elem == start) || (elem->nodetype & (LYS_CHOICE | LYS_CASE))) {
5891 /* schema-only nodes, skip root */
Michal Vasko03ff5a72019-09-11 13:49:33 +02005892 goto next_iter;
Michal Vasko03ff5a72019-09-11 13:49:33 +02005893 }
5894
Michal Vasko5d24f6c2020-10-13 13:49:06 +02005895 rc = moveto_scnode_check(elem, start, set, ncname, moveto_mod);
Michal Vasko6346ece2019-09-24 13:12:53 +02005896 if (!rc) {
Radek Krejciaa6b53f2020-08-27 15:19:03 +02005897 uint32_t idx;
5898
5899 if (lyxp_set_scnode_contains(set, elem, LYXP_NODE_ELEM, i, &idx)) {
Radek Krejcif13b87b2020-12-01 22:02:17 +01005900 set->val.scnodes[idx].in_ctx = LYXP_SET_SCNODE_ATOM_CTX;
Radek Krejci1deb5be2020-08-26 16:43:36 +02005901 if ((uint32_t)idx > i) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02005902 /* we will process it later in the set */
5903 goto skip_children;
5904 }
5905 } else {
Radek Krejciaa6b53f2020-08-27 15:19:03 +02005906 LY_CHECK_RET(lyxp_set_scnode_insert_node(set, elem, LYXP_NODE_ELEM, NULL));
Michal Vasko03ff5a72019-09-11 13:49:33 +02005907 }
Michal Vasko6346ece2019-09-24 13:12:53 +02005908 } else if (rc == LY_EINVAL) {
5909 goto skip_children;
Michal Vasko03ff5a72019-09-11 13:49:33 +02005910 }
5911
5912next_iter:
5913 /* TREE DFS NEXT ELEM */
5914 /* select element for the next run - children first */
Michal Vasko544e58a2021-01-28 14:33:41 +01005915 next = lysc_node_child(elem);
5916 if (next && (next->nodetype == LYS_INPUT) && (options & LYXP_SCNODE_OUTPUT)) {
5917 next = next->next;
5918 } else if (next && (next->nodetype == LYS_OUTPUT) && !(options & LYXP_SCNODE_OUTPUT)) {
5919 next = next->next;
5920 }
Michal Vasko03ff5a72019-09-11 13:49:33 +02005921 if (!next) {
5922skip_children:
5923 /* no children, so try siblings, but only if it's not the start,
5924 * that is considered to be the root and it's siblings are not traversed */
5925 if (elem != start) {
5926 next = elem->next;
5927 } else {
5928 break;
5929 }
5930 }
5931 while (!next) {
5932 /* no siblings, go back through the parents */
5933 if (elem->parent == start) {
5934 /* we are done, no next element to process */
5935 break;
5936 }
5937 /* parent is already processed, go to its sibling */
5938 elem = elem->parent;
5939 next = elem->next;
5940 }
5941 }
5942 }
5943
5944 return LY_SUCCESS;
5945}
5946
5947/**
Michal Vasko61ac2f62020-05-25 12:39:51 +02005948 * @brief Move context @p set to an attribute. Result is LYXP_SET_NODE_SET.
Michal Vasko03ff5a72019-09-11 13:49:33 +02005949 * Indirectly context position aware.
5950 *
5951 * @param[in,out] set Set to use.
Michal Vaskod3678892020-05-21 10:06:58 +02005952 * @param[in] mod Matching metadata module, NULL for any.
5953 * @param[in] ncname Matching metadata name in the dictionary, NULL for any.
aPiecek8b0cc152021-05-31 16:40:31 +02005954 * @param[in] options XPath options.
Michal Vasko03ff5a72019-09-11 13:49:33 +02005955 * @return LY_ERR
5956 */
5957static LY_ERR
aPiecek8b0cc152021-05-31 16:40:31 +02005958moveto_attr(struct lyxp_set *set, const struct lys_module *mod, const char *ncname, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02005959{
Michal Vasko9f96a052020-03-10 09:41:45 +01005960 struct lyd_meta *sub;
Michal Vasko03ff5a72019-09-11 13:49:33 +02005961
aPiecek8b0cc152021-05-31 16:40:31 +02005962 if (options & LYXP_SKIP_EXPR) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02005963 return LY_SUCCESS;
5964 }
5965
5966 if (set->type != LYXP_SET_NODE_SET) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01005967 LOGVAL(set->ctx, LY_VCODE_XP_INOP_1, "path operator", print_set_type(set));
Michal Vasko03ff5a72019-09-11 13:49:33 +02005968 return LY_EVALID;
5969 }
5970
Radek Krejci1deb5be2020-08-26 16:43:36 +02005971 for (uint32_t i = 0; i < set->used; ) {
Radek Krejci857189e2020-09-01 13:26:36 +02005972 ly_bool replaced = 0;
Michal Vasko03ff5a72019-09-11 13:49:33 +02005973
5974 /* only attributes of an elem (not dummy) can be in the result, skip all the rest;
5975 * our attributes are always qualified */
Michal Vasko5c4e5892019-11-14 12:31:38 +01005976 if (set->val.nodes[i].type == LYXP_NODE_ELEM) {
Michal Vasko9f96a052020-03-10 09:41:45 +01005977 for (sub = set->val.nodes[i].node->meta; sub; sub = sub->next) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02005978
5979 /* check "namespace" */
Michal Vaskod3678892020-05-21 10:06:58 +02005980 if (mod && (sub->annotation->module != mod)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02005981 continue;
5982 }
5983
Michal Vaskod3678892020-05-21 10:06:58 +02005984 if (!ncname || (sub->name == ncname)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02005985 /* match */
5986 if (!replaced) {
Michal Vasko9f96a052020-03-10 09:41:45 +01005987 set->val.meta[i].meta = sub;
5988 set->val.meta[i].type = LYXP_NODE_META;
Michal Vasko03ff5a72019-09-11 13:49:33 +02005989 /* pos does not change */
5990 replaced = 1;
5991 } else {
Michal Vasko9f96a052020-03-10 09:41:45 +01005992 set_insert_node(set, (struct lyd_node *)sub, set->val.nodes[i].pos, LYXP_NODE_META, i + 1);
Michal Vasko03ff5a72019-09-11 13:49:33 +02005993 }
5994 ++i;
5995 }
5996 }
5997 }
5998
5999 if (!replaced) {
6000 /* no match */
6001 set_remove_node(set, i);
6002 }
6003 }
6004
6005 return LY_SUCCESS;
6006}
6007
6008/**
6009 * @brief Move context @p set1 to union with @p set2. @p set2 is emptied afterwards.
Michal Vasko61ac2f62020-05-25 12:39:51 +02006010 * Result is LYXP_SET_NODE_SET. Context position aware.
Michal Vasko03ff5a72019-09-11 13:49:33 +02006011 *
6012 * @param[in,out] set1 Set to use for the result.
6013 * @param[in] set2 Set that is copied to @p set1.
Michal Vasko03ff5a72019-09-11 13:49:33 +02006014 * @return LY_ERR
6015 */
6016static LY_ERR
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01006017moveto_union(struct lyxp_set *set1, struct lyxp_set *set2)
Michal Vasko03ff5a72019-09-11 13:49:33 +02006018{
6019 LY_ERR rc;
6020
Michal Vaskod3678892020-05-21 10:06:58 +02006021 if ((set1->type != LYXP_SET_NODE_SET) || (set2->type != LYXP_SET_NODE_SET)) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01006022 LOGVAL(set1->ctx, LY_VCODE_XP_INOP_2, "union", print_set_type(set1), print_set_type(set2));
Michal Vasko03ff5a72019-09-11 13:49:33 +02006023 return LY_EVALID;
6024 }
6025
6026 /* set2 is empty or both set1 and set2 */
Michal Vaskod3678892020-05-21 10:06:58 +02006027 if (!set2->used) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02006028 return LY_SUCCESS;
6029 }
6030
Michal Vaskod3678892020-05-21 10:06:58 +02006031 if (!set1->used) {
aPiecekadc1e4f2021-10-07 11:15:12 +02006032 /* release hidden allocated data (lyxp_set.size) */
6033 lyxp_set_free_content(set1);
6034 /* direct copying of the entire structure */
Michal Vasko03ff5a72019-09-11 13:49:33 +02006035 memcpy(set1, set2, sizeof *set1);
6036 /* dynamic memory belongs to set1 now, do not free */
Michal Vaskod3678892020-05-21 10:06:58 +02006037 memset(set2, 0, sizeof *set2);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006038 return LY_SUCCESS;
6039 }
6040
6041 /* we assume sets are sorted */
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01006042 assert(!set_sort(set1) && !set_sort(set2));
Michal Vasko03ff5a72019-09-11 13:49:33 +02006043
6044 /* sort, remove duplicates */
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01006045 rc = set_sorted_merge(set1, set2);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006046 LY_CHECK_RET(rc);
6047
6048 /* final set must be sorted */
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01006049 assert(!set_sort(set1));
Michal Vasko03ff5a72019-09-11 13:49:33 +02006050
6051 return LY_SUCCESS;
6052}
6053
6054/**
Michal Vasko61ac2f62020-05-25 12:39:51 +02006055 * @brief Move context @p set to an attribute in any of the descendants. Result is LYXP_SET_NODE_SET.
Michal Vasko03ff5a72019-09-11 13:49:33 +02006056 * Context position aware.
6057 *
6058 * @param[in,out] set Set to use.
Michal Vaskod3678892020-05-21 10:06:58 +02006059 * @param[in] mod Matching metadata module, NULL for any.
6060 * @param[in] ncname Matching metadata name in the dictionary, NULL for any.
Michal Vaskocdad7122020-11-09 21:04:44 +01006061 * @param[in] options XPath options.
Michal Vasko03ff5a72019-09-11 13:49:33 +02006062 * @return LY_ERR (LY_EINCOMPLETE on unresolved when)
6063 */
6064static int
Michal Vaskocdad7122020-11-09 21:04:44 +01006065moveto_attr_alldesc(struct lyxp_set *set, const struct lys_module *mod, const char *ncname, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02006066{
Michal Vasko9f96a052020-03-10 09:41:45 +01006067 struct lyd_meta *sub;
Michal Vasko03ff5a72019-09-11 13:49:33 +02006068 struct lyxp_set *set_all_desc = NULL;
6069 LY_ERR rc;
6070
aPiecek8b0cc152021-05-31 16:40:31 +02006071 if (options & LYXP_SKIP_EXPR) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02006072 return LY_SUCCESS;
6073 }
6074
6075 if (set->type != LYXP_SET_NODE_SET) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01006076 LOGVAL(set->ctx, LY_VCODE_XP_INOP_1, "path operator", print_set_type(set));
Michal Vasko03ff5a72019-09-11 13:49:33 +02006077 return LY_EVALID;
6078 }
6079
Michal Vasko03ff5a72019-09-11 13:49:33 +02006080 /* can be optimized similarly to moveto_node_alldesc() and save considerable amount of memory,
6081 * but it likely won't be used much, so it's a waste of time */
6082 /* copy the context */
6083 set_all_desc = set_copy(set);
6084 /* get all descendant nodes (the original context nodes are removed) */
Michal Vaskocdad7122020-11-09 21:04:44 +01006085 rc = moveto_node_alldesc(set_all_desc, NULL, NULL, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006086 if (rc != LY_SUCCESS) {
6087 lyxp_set_free(set_all_desc);
6088 return rc;
6089 }
6090 /* prepend the original context nodes */
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01006091 rc = moveto_union(set, set_all_desc);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006092 if (rc != LY_SUCCESS) {
6093 lyxp_set_free(set_all_desc);
6094 return rc;
6095 }
6096 lyxp_set_free(set_all_desc);
6097
Radek Krejci1deb5be2020-08-26 16:43:36 +02006098 for (uint32_t i = 0; i < set->used; ) {
Radek Krejci857189e2020-09-01 13:26:36 +02006099 ly_bool replaced = 0;
Michal Vasko03ff5a72019-09-11 13:49:33 +02006100
6101 /* only attributes of an elem can be in the result, skip all the rest,
6102 * we have all attributes qualified in lyd tree */
6103 if (set->val.nodes[i].type == LYXP_NODE_ELEM) {
Michal Vasko9f96a052020-03-10 09:41:45 +01006104 for (sub = set->val.nodes[i].node->meta; sub; sub = sub->next) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02006105 /* check "namespace" */
Michal Vaskod3678892020-05-21 10:06:58 +02006106 if (mod && (sub->annotation->module != mod)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02006107 continue;
6108 }
6109
Michal Vaskod3678892020-05-21 10:06:58 +02006110 if (!ncname || (sub->name == ncname)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02006111 /* match */
6112 if (!replaced) {
Michal Vasko9f96a052020-03-10 09:41:45 +01006113 set->val.meta[i].meta = sub;
6114 set->val.meta[i].type = LYXP_NODE_META;
Michal Vasko03ff5a72019-09-11 13:49:33 +02006115 /* pos does not change */
6116 replaced = 1;
6117 } else {
Michal Vasko9f96a052020-03-10 09:41:45 +01006118 set_insert_node(set, (struct lyd_node *)sub, set->val.meta[i].pos, LYXP_NODE_META, i + 1);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006119 }
6120 ++i;
6121 }
6122 }
6123 }
6124
6125 if (!replaced) {
6126 /* no match */
6127 set_remove_node(set, i);
6128 }
6129 }
6130
6131 return LY_SUCCESS;
6132}
6133
6134/**
Michal Vasko61ac2f62020-05-25 12:39:51 +02006135 * @brief Move context @p set to self and al chilren, recursively. Handles '/' or '//' and '.'. Result is LYXP_SET_NODE_SET.
6136 * Context position aware.
Michal Vasko03ff5a72019-09-11 13:49:33 +02006137 *
6138 * @param[in] parent Current parent.
6139 * @param[in] parent_pos Position of @p parent.
6140 * @param[in] parent_type Node type of @p parent.
6141 * @param[in,out] to_set Set to use.
6142 * @param[in] dup_check_set Set for checking duplicities.
Michal Vasko03ff5a72019-09-11 13:49:33 +02006143 * @param[in] options XPath options.
6144 * @return LY_ERR (LY_EINCOMPLETE on unresolved when)
6145 */
6146static LY_ERR
6147moveto_self_add_children_r(const struct lyd_node *parent, uint32_t parent_pos, enum lyxp_node_type parent_type,
Radek Krejci1deb5be2020-08-26 16:43:36 +02006148 struct lyxp_set *to_set, const struct lyxp_set *dup_check_set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02006149{
Michal Vasko61ac2f62020-05-25 12:39:51 +02006150 const struct lyd_node *iter, *first;
Michal Vasko03ff5a72019-09-11 13:49:33 +02006151 LY_ERR rc;
6152
6153 switch (parent_type) {
6154 case LYXP_NODE_ROOT:
6155 case LYXP_NODE_ROOT_CONFIG:
Michal Vasko61ac2f62020-05-25 12:39:51 +02006156 assert(!parent);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006157
Michal Vasko61ac2f62020-05-25 12:39:51 +02006158 /* add all top-level nodes as elements */
6159 first = to_set->tree;
Michal Vasko03ff5a72019-09-11 13:49:33 +02006160 break;
6161 case LYXP_NODE_ELEM:
Michal Vasko61ac2f62020-05-25 12:39:51 +02006162 /* add just the text node of this term element node */
6163 if (parent->schema->nodetype & (LYD_NODE_TERM | LYD_NODE_ANY)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02006164 if (!set_dup_node_check(dup_check_set, parent, LYXP_NODE_TEXT, -1)) {
6165 set_insert_node(to_set, parent, parent_pos, LYXP_NODE_TEXT, to_set->used);
6166 }
Michal Vasko61ac2f62020-05-25 12:39:51 +02006167 return LY_SUCCESS;
Michal Vasko03ff5a72019-09-11 13:49:33 +02006168 }
Michal Vasko61ac2f62020-05-25 12:39:51 +02006169
6170 /* add all the children of this node */
Radek Krejcia1c1e542020-09-29 16:06:52 +02006171 first = lyd_child(parent);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006172 break;
6173 default:
6174 LOGINT_RET(parent->schema->module->ctx);
6175 }
6176
Michal Vasko61ac2f62020-05-25 12:39:51 +02006177 /* add all top-level nodes as elements */
6178 LY_LIST_FOR(first, iter) {
6179 /* context check */
6180 if ((parent_type == LYXP_NODE_ROOT_CONFIG) && (iter->schema->flags & LYS_CONFIG_R)) {
6181 continue;
6182 }
6183
6184 /* when check */
Michal Vaskod5cfa6e2020-11-23 16:56:08 +01006185 if (!(options & LYXP_IGNORE_WHEN) && lysc_has_when(iter->schema) && !(iter->flags & LYD_WHEN_TRUE)) {
Michal Vasko61ac2f62020-05-25 12:39:51 +02006186 return LY_EINCOMPLETE;
6187 }
6188
6189 if (!set_dup_node_check(dup_check_set, iter, LYXP_NODE_ELEM, -1)) {
6190 set_insert_node(to_set, iter, 0, LYXP_NODE_ELEM, to_set->used);
6191
6192 /* also add all the children of this node, recursively */
6193 rc = moveto_self_add_children_r(iter, 0, LYXP_NODE_ELEM, to_set, dup_check_set, options);
6194 LY_CHECK_RET(rc);
6195 }
6196 }
6197
Michal Vasko03ff5a72019-09-11 13:49:33 +02006198 return LY_SUCCESS;
6199}
6200
6201/**
6202 * @brief Move context @p set to self. Handles '/' or '//' and '.'. Result is LYXP_SET_NODE_SET
6203 * (or LYXP_SET_EMPTY). Context position aware.
6204 *
6205 * @param[in,out] set Set to use.
6206 * @param[in] all_desc Whether to go to all descendants ('//') or not ('/').
6207 * @param[in] options XPath options.
6208 * @return LY_ERR (LY_EINCOMPLETE on unresolved when)
6209 */
6210static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02006211moveto_self(struct lyxp_set *set, ly_bool all_desc, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02006212{
Michal Vasko03ff5a72019-09-11 13:49:33 +02006213 struct lyxp_set ret_set;
6214 LY_ERR rc;
6215
aPiecek8b0cc152021-05-31 16:40:31 +02006216 if (options & LYXP_SKIP_EXPR) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02006217 return LY_SUCCESS;
6218 }
6219
6220 if (set->type != LYXP_SET_NODE_SET) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01006221 LOGVAL(set->ctx, LY_VCODE_XP_INOP_1, "path operator", print_set_type(set));
Michal Vasko03ff5a72019-09-11 13:49:33 +02006222 return LY_EVALID;
6223 }
6224
6225 /* nothing to do */
6226 if (!all_desc) {
6227 return LY_SUCCESS;
6228 }
6229
Michal Vasko03ff5a72019-09-11 13:49:33 +02006230 /* add all the children, they get added recursively */
6231 set_init(&ret_set, set);
Radek Krejci1deb5be2020-08-26 16:43:36 +02006232 for (uint32_t i = 0; i < set->used; ++i) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02006233 /* copy the current node to tmp */
6234 set_insert_node(&ret_set, set->val.nodes[i].node, set->val.nodes[i].pos, set->val.nodes[i].type, ret_set.used);
6235
6236 /* do not touch attributes and text nodes */
Michal Vasko9f96a052020-03-10 09:41:45 +01006237 if ((set->val.nodes[i].type == LYXP_NODE_TEXT) || (set->val.nodes[i].type == LYXP_NODE_META)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02006238 continue;
6239 }
6240
Michal Vasko03ff5a72019-09-11 13:49:33 +02006241 /* add all the children */
6242 rc = moveto_self_add_children_r(set->val.nodes[i].node, set->val.nodes[i].pos, set->val.nodes[i].type, &ret_set,
Michal Vasko69730152020-10-09 16:30:07 +02006243 set, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006244 if (rc != LY_SUCCESS) {
Michal Vaskod3678892020-05-21 10:06:58 +02006245 lyxp_set_free_content(&ret_set);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006246 return rc;
6247 }
6248 }
6249
6250 /* use the temporary set as the current one */
6251 ret_set.ctx_pos = set->ctx_pos;
6252 ret_set.ctx_size = set->ctx_size;
Michal Vaskod3678892020-05-21 10:06:58 +02006253 lyxp_set_free_content(set);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006254 memcpy(set, &ret_set, sizeof *set);
6255
6256 return LY_SUCCESS;
6257}
6258
6259/**
6260 * @brief Move context schema @p set to self. Handles '/' or '//' and '.'. Result is LYXP_SET_SCNODE_SET
6261 * (or LYXP_SET_EMPTY).
6262 *
6263 * @param[in,out] set Set to use.
6264 * @param[in] all_desc Whether to go to all descendants ('//') or not ('/').
6265 * @param[in] options XPath options.
6266 * @return LY_ERR
6267 */
6268static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02006269moveto_scnode_self(struct lyxp_set *set, ly_bool all_desc, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02006270{
Radek Krejci1deb5be2020-08-26 16:43:36 +02006271 uint32_t getnext_opts;
6272 uint32_t mod_idx;
Michal Vasko519fd602020-05-26 12:17:39 +02006273 const struct lysc_node *iter, *start_parent;
6274 const struct lys_module *mod;
Michal Vasko03ff5a72019-09-11 13:49:33 +02006275
aPiecek8b0cc152021-05-31 16:40:31 +02006276 if (options & LYXP_SKIP_EXPR) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02006277 return LY_SUCCESS;
6278 }
6279
6280 if (set->type != LYXP_SET_SCNODE_SET) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01006281 LOGVAL(set->ctx, LY_VCODE_XP_INOP_1, "path operator", print_set_type(set));
Michal Vasko03ff5a72019-09-11 13:49:33 +02006282 return LY_EVALID;
6283 }
6284
Michal Vasko519fd602020-05-26 12:17:39 +02006285 /* getnext opts */
Michal Vasko7b1ad1a2020-11-02 15:41:27 +01006286 getnext_opts = 0;
Michal Vasko519fd602020-05-26 12:17:39 +02006287 if (options & LYXP_SCNODE_OUTPUT) {
6288 getnext_opts |= LYS_GETNEXT_OUTPUT;
6289 }
6290
6291 /* add all the children, recursively as they are being added into the same set */
Radek Krejci1deb5be2020-08-26 16:43:36 +02006292 for (uint32_t i = 0; i < set->used; ++i) {
Michal Vaskoe657f962020-12-10 12:19:48 +01006293 if (!all_desc) {
6294 /* traverse the start node */
6295 if (set->val.scnodes[i].in_ctx == LYXP_SET_SCNODE_START) {
6296 set->val.scnodes[i].in_ctx = LYXP_SET_SCNODE_ATOM_CTX;
6297 }
6298 continue;
6299 }
6300
Radek Krejcif13b87b2020-12-01 22:02:17 +01006301 if (set->val.scnodes[i].in_ctx != LYXP_SET_SCNODE_ATOM_CTX) {
6302 if (set->val.scnodes[i].in_ctx != LYXP_SET_SCNODE_START) {
Michal Vasko5c4e5892019-11-14 12:31:38 +01006303 continue;
6304 }
6305
Michal Vasko519fd602020-05-26 12:17:39 +02006306 /* remember context node */
Radek Krejcif13b87b2020-12-01 22:02:17 +01006307 set->val.scnodes[i].in_ctx = LYXP_SET_SCNODE_START_USED;
Michal Vasko519fd602020-05-26 12:17:39 +02006308 } else {
Michal Vasko1a09b212021-05-06 13:00:10 +02006309 set->val.scnodes[i].in_ctx = LYXP_SET_SCNODE_ATOM_NODE;
Michal Vasko03ff5a72019-09-11 13:49:33 +02006310 }
6311
Michal Vasko519fd602020-05-26 12:17:39 +02006312 start_parent = set->val.scnodes[i].scnode;
Michal Vasko03ff5a72019-09-11 13:49:33 +02006313
Michal Vasko519fd602020-05-26 12:17:39 +02006314 if ((set->val.scnodes[i].type == LYXP_NODE_ROOT_CONFIG) || (set->val.scnodes[i].type == LYXP_NODE_ROOT)) {
6315 /* it can actually be in any module, it's all <running> */
6316 mod_idx = 0;
Michal Vaskoa51ef072021-07-02 10:40:30 +02006317 while ((mod = ly_ctx_get_module_iter(set->ctx, &mod_idx))) {
Michal Vasko519fd602020-05-26 12:17:39 +02006318 iter = NULL;
6319 /* module may not be implemented */
6320 while (mod->implemented && (iter = lys_getnext(iter, NULL, mod->compiled, getnext_opts))) {
6321 /* context check */
6322 if ((set->root_type == LYXP_NODE_ROOT_CONFIG) && (iter->flags & LYS_CONFIG_R)) {
6323 continue;
6324 }
6325
Radek Krejciaa6b53f2020-08-27 15:19:03 +02006326 LY_CHECK_RET(lyxp_set_scnode_insert_node(set, iter, LYXP_NODE_ELEM, NULL));
Michal Vasko519fd602020-05-26 12:17:39 +02006327 /* throw away the insert index, we want to consider that node again, recursively */
6328 }
6329 }
6330
6331 } else if (set->val.scnodes[i].type == LYXP_NODE_ELEM) {
6332 iter = NULL;
6333 while ((iter = lys_getnext(iter, start_parent, NULL, getnext_opts))) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02006334 /* context check */
Michal Vasko519fd602020-05-26 12:17:39 +02006335 if ((set->root_type == LYXP_NODE_ROOT_CONFIG) && (iter->flags & LYS_CONFIG_R)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02006336 continue;
6337 }
6338
Radek Krejciaa6b53f2020-08-27 15:19:03 +02006339 LY_CHECK_RET(lyxp_set_scnode_insert_node(set, iter, LYXP_NODE_ELEM, NULL));
Michal Vasko03ff5a72019-09-11 13:49:33 +02006340 }
6341 }
6342 }
6343
6344 return LY_SUCCESS;
6345}
6346
6347/**
6348 * @brief Move context @p set to parent. Handles '/' or '//' and '..'. Result is LYXP_SET_NODE_SET
6349 * (or LYXP_SET_EMPTY). Context position aware.
6350 *
6351 * @param[in] set Set to use.
6352 * @param[in] all_desc Whether to go to all descendants ('//') or not ('/').
6353 * @param[in] options XPath options.
6354 * @return LY_ERR (LY_EINCOMPLETE on unresolved when)
6355 */
6356static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02006357moveto_parent(struct lyxp_set *set, ly_bool all_desc, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02006358{
Michal Vasko9d414112021-12-02 12:31:00 +01006359 LY_ERR rc = LY_SUCCESS;
Michal Vasko03ff5a72019-09-11 13:49:33 +02006360 struct lyd_node *node, *new_node;
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01006361 enum lyxp_node_type new_type;
Michal Vasko9d414112021-12-02 12:31:00 +01006362 struct lyxp_set result;
Michal Vasko03ff5a72019-09-11 13:49:33 +02006363
aPiecek8b0cc152021-05-31 16:40:31 +02006364 if (options & LYXP_SKIP_EXPR) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02006365 return LY_SUCCESS;
6366 }
6367
6368 if (set->type != LYXP_SET_NODE_SET) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01006369 LOGVAL(set->ctx, LY_VCODE_XP_INOP_1, "path operator", print_set_type(set));
Michal Vasko03ff5a72019-09-11 13:49:33 +02006370 return LY_EVALID;
6371 }
6372
6373 if (all_desc) {
6374 /* <path>//.. == <path>//./.. */
6375 rc = moveto_self(set, 1, options);
6376 LY_CHECK_RET(rc);
6377 }
6378
Michal Vasko9d414112021-12-02 12:31:00 +01006379 /* init result set */
6380 set_init(&result, set);
6381
Radek Krejci1deb5be2020-08-26 16:43:36 +02006382 for (uint32_t i = 0; i < set->used; ++i) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02006383 node = set->val.nodes[i].node;
6384
6385 if (set->val.nodes[i].type == LYXP_NODE_ELEM) {
Michal Vasko9e685082021-01-29 14:49:09 +01006386 new_node = lyd_parent(node);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006387 } else if (set->val.nodes[i].type == LYXP_NODE_TEXT) {
6388 new_node = node;
Michal Vasko9f96a052020-03-10 09:41:45 +01006389 } else if (set->val.nodes[i].type == LYXP_NODE_META) {
6390 new_node = set->val.meta[i].meta->parent;
Michal Vasko03ff5a72019-09-11 13:49:33 +02006391 if (!new_node) {
Michal Vasko9d414112021-12-02 12:31:00 +01006392 LOGINT(set->ctx);
6393 rc = LY_EINT;
6394 goto cleanup;
Michal Vasko03ff5a72019-09-11 13:49:33 +02006395 }
6396 } else {
6397 /* root does not have a parent */
Michal Vasko03ff5a72019-09-11 13:49:33 +02006398 continue;
6399 }
6400
Michal Vaskoa1424542019-11-14 16:08:52 +01006401 /* when check */
Michal Vasko9d414112021-12-02 12:31:00 +01006402 if (!(options & LYXP_IGNORE_WHEN) && new_node && lysc_has_when(new_node->schema) &&
6403 !(new_node->flags & LYD_WHEN_TRUE)) {
6404 rc = LY_EINCOMPLETE;
6405 goto cleanup;
Michal Vaskoa1424542019-11-14 16:08:52 +01006406 }
Michal Vasko03ff5a72019-09-11 13:49:33 +02006407
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01006408 if (!new_node) {
Radek Krejcif6a11002020-08-21 13:29:07 +02006409 /* node already there can also be the root */
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01006410 new_type = set->root_type;
Michal Vasko03ff5a72019-09-11 13:49:33 +02006411 } else {
Radek Krejcif6a11002020-08-21 13:29:07 +02006412 /* node has a standard parent (it can equal the root, it's not the root yet since they are fake) */
Michal Vasko03ff5a72019-09-11 13:49:33 +02006413 new_type = LYXP_NODE_ELEM;
6414 }
6415
Michal Vasko9d414112021-12-02 12:31:00 +01006416 /* check for duplicates, several nodes may have the same parent */
6417 if (!set_dup_node_check(&result, new_node, new_type, -1)) {
6418 set_insert_node(&result, new_node, 0, new_type, result.used);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006419 }
6420 }
6421
Michal Vasko9d414112021-12-02 12:31:00 +01006422 /* move result to the set */
6423 lyxp_set_free_content(set);
6424 *set = result;
6425 result.type = LYXP_SET_NUMBER;
6426 assert(!set_sort(set));
Michal Vasko03ff5a72019-09-11 13:49:33 +02006427
Michal Vasko9d414112021-12-02 12:31:00 +01006428cleanup:
6429 lyxp_set_free_content(&result);
6430 return rc;
Michal Vasko03ff5a72019-09-11 13:49:33 +02006431}
6432
6433/**
6434 * @brief Move context schema @p set to parent. Handles '/' or '//' and '..'. Result is LYXP_SET_SCNODE_SET
6435 * (or LYXP_SET_EMPTY).
6436 *
6437 * @param[in] set Set to use.
6438 * @param[in] all_desc Whether to go to all descendants ('//') or not ('/').
6439 * @param[in] options XPath options.
6440 * @return LY_ERR
6441 */
6442static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +02006443moveto_scnode_parent(struct lyxp_set *set, ly_bool all_desc, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02006444{
Radek Krejciaa6b53f2020-08-27 15:19:03 +02006445 uint32_t i, orig_used, idx;
Radek Krejci857189e2020-09-01 13:26:36 +02006446 ly_bool temp_ctx = 0;
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01006447 const struct lysc_node *node, *new_node;
6448 enum lyxp_node_type new_type;
Michal Vasko03ff5a72019-09-11 13:49:33 +02006449
aPiecek8b0cc152021-05-31 16:40:31 +02006450 if (options & LYXP_SKIP_EXPR) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02006451 return LY_SUCCESS;
6452 }
6453
6454 if (set->type != LYXP_SET_SCNODE_SET) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01006455 LOGVAL(set->ctx, LY_VCODE_XP_INOP_1, "path operator", print_set_type(set));
Michal Vasko03ff5a72019-09-11 13:49:33 +02006456 return LY_EVALID;
6457 }
6458
6459 if (all_desc) {
6460 /* <path>//.. == <path>//./.. */
Radek Krejci1deb5be2020-08-26 16:43:36 +02006461 LY_CHECK_RET(moveto_scnode_self(set, 1, options));
Michal Vasko03ff5a72019-09-11 13:49:33 +02006462 }
6463
Michal Vasko03ff5a72019-09-11 13:49:33 +02006464 orig_used = set->used;
6465 for (i = 0; i < orig_used; ++i) {
Radek Krejcif13b87b2020-12-01 22:02:17 +01006466 if (set->val.scnodes[i].in_ctx != LYXP_SET_SCNODE_ATOM_CTX) {
6467 if (set->val.scnodes[i].in_ctx != LYXP_SET_SCNODE_START) {
Michal Vasko5c4e5892019-11-14 12:31:38 +01006468 continue;
6469 }
6470
6471 /* remember context node */
Radek Krejcif13b87b2020-12-01 22:02:17 +01006472 set->val.scnodes[i].in_ctx = LYXP_SET_SCNODE_START_USED;
Michal Vaskoec4df482019-12-16 10:02:18 +01006473 } else {
Michal Vasko1a09b212021-05-06 13:00:10 +02006474 set->val.scnodes[i].in_ctx = LYXP_SET_SCNODE_ATOM_NODE;
Michal Vasko03ff5a72019-09-11 13:49:33 +02006475 }
Michal Vasko03ff5a72019-09-11 13:49:33 +02006476
6477 node = set->val.scnodes[i].scnode;
6478
6479 if (set->val.scnodes[i].type == LYXP_NODE_ELEM) {
Michal Vaskod3678892020-05-21 10:06:58 +02006480 new_node = lysc_data_parent(node);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006481 } else {
6482 /* root does not have a parent */
6483 continue;
6484 }
6485
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01006486 if (!new_node) {
Radek Krejcif6a11002020-08-21 13:29:07 +02006487 /* node has no parent */
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01006488 new_type = set->root_type;
Michal Vasko03ff5a72019-09-11 13:49:33 +02006489
Michal Vasko03ff5a72019-09-11 13:49:33 +02006490 } else {
Radek Krejcif6a11002020-08-21 13:29:07 +02006491 /* node has a standard parent (it can equal the root, it's not the root yet since they are fake) */
Michal Vasko03ff5a72019-09-11 13:49:33 +02006492 new_type = LYXP_NODE_ELEM;
6493 }
6494
Radek Krejciaa6b53f2020-08-27 15:19:03 +02006495 LY_CHECK_RET(lyxp_set_scnode_insert_node(set, new_node, new_type, &idx));
6496 if ((idx < orig_used) && (idx > i)) {
Radek Krejcif13b87b2020-12-01 22:02:17 +01006497 set->val.scnodes[idx].in_ctx = LYXP_SET_SCNODE_ATOM_NEW_CTX;
Michal Vasko03ff5a72019-09-11 13:49:33 +02006498 temp_ctx = 1;
6499 }
6500 }
6501
6502 if (temp_ctx) {
6503 for (i = 0; i < orig_used; ++i) {
Radek Krejcif13b87b2020-12-01 22:02:17 +01006504 if (set->val.scnodes[i].in_ctx == LYXP_SET_SCNODE_ATOM_NEW_CTX) {
6505 set->val.scnodes[i].in_ctx = LYXP_SET_SCNODE_ATOM_CTX;
Michal Vasko03ff5a72019-09-11 13:49:33 +02006506 }
6507 }
6508 }
6509
6510 return LY_SUCCESS;
6511}
6512
6513/**
6514 * @brief Move context @p set to the result of a comparison. Handles '=', '!=', '<=', '<', '>=', or '>'.
6515 * Result is LYXP_SET_BOOLEAN. Indirectly context position aware.
6516 *
6517 * @param[in,out] set1 Set to use for the result.
6518 * @param[in] set2 Set acting as the second operand for @p op.
6519 * @param[in] op Comparison operator to process.
6520 * @param[in] options XPath options.
6521 * @return LY_ERR
6522 */
6523static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +02006524moveto_op_comp(struct lyxp_set *set1, struct lyxp_set *set2, const char *op, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02006525{
6526 /*
6527 * NODE SET + NODE SET = NODE SET + STRING /(1 NODE SET) 2 STRING
6528 * NODE SET + STRING = STRING + STRING /1 STRING (2 STRING)
6529 * NODE SET + NUMBER = NUMBER + NUMBER /1 NUMBER (2 NUMBER)
6530 * NODE SET + BOOLEAN = BOOLEAN + BOOLEAN /1 BOOLEAN (2 BOOLEAN)
6531 * STRING + NODE SET = STRING + STRING /(1 STRING) 2 STRING
6532 * NUMBER + NODE SET = NUMBER + NUMBER /(1 NUMBER) 2 NUMBER
6533 * BOOLEAN + NODE SET = BOOLEAN + BOOLEAN /(1 BOOLEAN) 2 BOOLEAN
6534 *
6535 * '=' or '!='
6536 * BOOLEAN + BOOLEAN
6537 * BOOLEAN + STRING = BOOLEAN + BOOLEAN /(1 BOOLEAN) 2 BOOLEAN
6538 * BOOLEAN + NUMBER = BOOLEAN + BOOLEAN /(1 BOOLEAN) 2 BOOLEAN
6539 * STRING + BOOLEAN = BOOLEAN + BOOLEAN /1 BOOLEAN (2 BOOLEAN)
6540 * NUMBER + BOOLEAN = BOOLEAN + BOOLEAN /1 BOOLEAN (2 BOOLEAN)
6541 * NUMBER + NUMBER
6542 * NUMBER + STRING = NUMBER + NUMBER /(1 NUMBER) 2 NUMBER
6543 * STRING + NUMBER = NUMBER + NUMBER /1 NUMBER (2 NUMBER)
6544 * STRING + STRING
6545 *
6546 * '<=', '<', '>=', '>'
6547 * NUMBER + NUMBER
6548 * BOOLEAN + BOOLEAN = NUMBER + NUMBER /1 NUMBER, 2 NUMBER
6549 * BOOLEAN + NUMBER = NUMBER + NUMBER /1 NUMBER (2 NUMBER)
6550 * BOOLEAN + STRING = NUMBER + NUMBER /1 NUMBER, 2 NUMBER
6551 * NUMBER + STRING = NUMBER + NUMBER /(1 NUMBER) 2 NUMBER
6552 * STRING + STRING = NUMBER + NUMBER /1 NUMBER, 2 NUMBER
6553 * STRING + NUMBER = NUMBER + NUMBER /1 NUMBER (2 NUMBER)
6554 * NUMBER + BOOLEAN = NUMBER + NUMBER /(1 NUMBER) 2 NUMBER
6555 * STRING + BOOLEAN = NUMBER + NUMBER /(1 NUMBER) 2 NUMBER
6556 */
6557 struct lyxp_set iter1, iter2;
6558 int result;
6559 int64_t i;
6560 LY_ERR rc;
6561
Michal Vasko004d3152020-06-11 19:59:22 +02006562 memset(&iter1, 0, sizeof iter1);
6563 memset(&iter2, 0, sizeof iter2);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006564
6565 /* iterative evaluation with node-sets */
6566 if ((set1->type == LYXP_SET_NODE_SET) || (set2->type == LYXP_SET_NODE_SET)) {
6567 if (set1->type == LYXP_SET_NODE_SET) {
6568 for (i = 0; i < set1->used; ++i) {
Michal Vasko4c7763f2020-07-27 17:40:37 +02006569 /* cast set1 */
Michal Vasko03ff5a72019-09-11 13:49:33 +02006570 switch (set2->type) {
6571 case LYXP_SET_NUMBER:
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01006572 rc = set_comp_cast(&iter1, set1, LYXP_SET_NUMBER, i);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006573 break;
6574 case LYXP_SET_BOOLEAN:
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01006575 rc = set_comp_cast(&iter1, set1, LYXP_SET_BOOLEAN, i);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006576 break;
6577 default:
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01006578 rc = set_comp_cast(&iter1, set1, LYXP_SET_STRING, i);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006579 break;
6580 }
6581 LY_CHECK_RET(rc);
6582
Michal Vasko4c7763f2020-07-27 17:40:37 +02006583 /* canonize set2 */
6584 LY_CHECK_ERR_RET(rc = set_comp_canonize(&iter2, set2, &set1->val.nodes[i]), lyxp_set_free_content(&iter1), rc);
6585
6586 /* compare recursively */
6587 rc = moveto_op_comp(&iter1, &iter2, op, options);
6588 lyxp_set_free_content(&iter2);
6589 LY_CHECK_ERR_RET(rc, lyxp_set_free_content(&iter1), rc);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006590
6591 /* lazy evaluation until true */
Michal Vasko004d3152020-06-11 19:59:22 +02006592 if (iter1.val.bln) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02006593 set_fill_boolean(set1, 1);
6594 return LY_SUCCESS;
6595 }
6596 }
6597 } else {
6598 for (i = 0; i < set2->used; ++i) {
Michal Vasko4c7763f2020-07-27 17:40:37 +02006599 /* set set2 */
Michal Vasko03ff5a72019-09-11 13:49:33 +02006600 switch (set1->type) {
Michal Vasko4c7763f2020-07-27 17:40:37 +02006601 case LYXP_SET_NUMBER:
6602 rc = set_comp_cast(&iter2, set2, LYXP_SET_NUMBER, i);
6603 break;
6604 case LYXP_SET_BOOLEAN:
6605 rc = set_comp_cast(&iter2, set2, LYXP_SET_BOOLEAN, i);
6606 break;
6607 default:
6608 rc = set_comp_cast(&iter2, set2, LYXP_SET_STRING, i);
6609 break;
Michal Vasko03ff5a72019-09-11 13:49:33 +02006610 }
6611 LY_CHECK_RET(rc);
6612
Michal Vasko4c7763f2020-07-27 17:40:37 +02006613 /* canonize set1 */
6614 LY_CHECK_ERR_RET(rc = set_comp_canonize(&iter1, set1, &set2->val.nodes[i]), lyxp_set_free_content(&iter2), rc);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006615
Michal Vasko4c7763f2020-07-27 17:40:37 +02006616 /* compare recursively */
Michal Vasko03ff5a72019-09-11 13:49:33 +02006617 rc = moveto_op_comp(&iter1, &iter2, op, options);
Michal Vaskod3678892020-05-21 10:06:58 +02006618 lyxp_set_free_content(&iter2);
Michal Vasko4c7763f2020-07-27 17:40:37 +02006619 LY_CHECK_ERR_RET(rc, lyxp_set_free_content(&iter1), rc);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006620
6621 /* lazy evaluation until true */
Michal Vasko004d3152020-06-11 19:59:22 +02006622 if (iter1.val.bln) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02006623 set_fill_boolean(set1, 1);
6624 return LY_SUCCESS;
6625 }
6626 }
6627 }
6628
6629 /* false for all nodes */
6630 set_fill_boolean(set1, 0);
6631 return LY_SUCCESS;
6632 }
6633
6634 /* first convert properly */
6635 if ((op[0] == '=') || (op[0] == '!')) {
6636 if ((set1->type == LYXP_SET_BOOLEAN) || (set2->type == LYXP_SET_BOOLEAN)) {
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01006637 lyxp_set_cast(set1, LYXP_SET_BOOLEAN);
6638 lyxp_set_cast(set2, LYXP_SET_BOOLEAN);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006639 } else if ((set1->type == LYXP_SET_NUMBER) || (set2->type == LYXP_SET_NUMBER)) {
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01006640 rc = lyxp_set_cast(set1, LYXP_SET_NUMBER);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006641 LY_CHECK_RET(rc);
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01006642 rc = lyxp_set_cast(set2, LYXP_SET_NUMBER);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006643 LY_CHECK_RET(rc);
6644 } /* else we have 2 strings */
6645 } else {
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01006646 rc = lyxp_set_cast(set1, LYXP_SET_NUMBER);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006647 LY_CHECK_RET(rc);
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01006648 rc = lyxp_set_cast(set2, LYXP_SET_NUMBER);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006649 LY_CHECK_RET(rc);
6650 }
6651
6652 assert(set1->type == set2->type);
6653
6654 /* compute result */
6655 if (op[0] == '=') {
6656 if (set1->type == LYXP_SET_BOOLEAN) {
Michal Vasko004d3152020-06-11 19:59:22 +02006657 result = (set1->val.bln == set2->val.bln);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006658 } else if (set1->type == LYXP_SET_NUMBER) {
6659 result = (set1->val.num == set2->val.num);
6660 } else {
6661 assert(set1->type == LYXP_SET_STRING);
Michal Vaskoac6c72f2019-11-14 16:09:34 +01006662 result = !strcmp(set1->val.str, set2->val.str);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006663 }
6664 } else if (op[0] == '!') {
6665 if (set1->type == LYXP_SET_BOOLEAN) {
Michal Vasko004d3152020-06-11 19:59:22 +02006666 result = (set1->val.bln != set2->val.bln);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006667 } else if (set1->type == LYXP_SET_NUMBER) {
6668 result = (set1->val.num != set2->val.num);
6669 } else {
6670 assert(set1->type == LYXP_SET_STRING);
Michal Vaskoc2058432020-11-06 17:26:21 +01006671 result = strcmp(set1->val.str, set2->val.str);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006672 }
6673 } else {
6674 assert(set1->type == LYXP_SET_NUMBER);
6675 if (op[0] == '<') {
6676 if (op[1] == '=') {
6677 result = (set1->val.num <= set2->val.num);
6678 } else {
6679 result = (set1->val.num < set2->val.num);
6680 }
6681 } else {
6682 if (op[1] == '=') {
6683 result = (set1->val.num >= set2->val.num);
6684 } else {
6685 result = (set1->val.num > set2->val.num);
6686 }
6687 }
6688 }
6689
6690 /* assign result */
6691 if (result) {
6692 set_fill_boolean(set1, 1);
6693 } else {
6694 set_fill_boolean(set1, 0);
6695 }
6696
6697 return LY_SUCCESS;
6698}
6699
6700/**
6701 * @brief Move context @p set to the result of a basic operation. Handles '+', '-', unary '-', '*', 'div',
6702 * or 'mod'. Result is LYXP_SET_NUMBER. Indirectly context position aware.
6703 *
6704 * @param[in,out] set1 Set to use for the result.
6705 * @param[in] set2 Set acting as the second operand for @p op.
6706 * @param[in] op Operator to process.
Michal Vasko03ff5a72019-09-11 13:49:33 +02006707 * @return LY_ERR
6708 */
6709static LY_ERR
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01006710moveto_op_math(struct lyxp_set *set1, struct lyxp_set *set2, const char *op)
Michal Vasko03ff5a72019-09-11 13:49:33 +02006711{
6712 LY_ERR rc;
6713
6714 /* unary '-' */
6715 if (!set2 && (op[0] == '-')) {
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01006716 rc = lyxp_set_cast(set1, LYXP_SET_NUMBER);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006717 LY_CHECK_RET(rc);
6718 set1->val.num *= -1;
6719 lyxp_set_free(set2);
6720 return LY_SUCCESS;
6721 }
6722
6723 assert(set1 && set2);
6724
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01006725 rc = lyxp_set_cast(set1, LYXP_SET_NUMBER);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006726 LY_CHECK_RET(rc);
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01006727 rc = lyxp_set_cast(set2, LYXP_SET_NUMBER);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006728 LY_CHECK_RET(rc);
6729
6730 switch (op[0]) {
6731 /* '+' */
6732 case '+':
6733 set1->val.num += set2->val.num;
6734 break;
6735
6736 /* '-' */
6737 case '-':
6738 set1->val.num -= set2->val.num;
6739 break;
6740
6741 /* '*' */
6742 case '*':
6743 set1->val.num *= set2->val.num;
6744 break;
6745
6746 /* 'div' */
6747 case 'd':
6748 set1->val.num /= set2->val.num;
6749 break;
6750
6751 /* 'mod' */
6752 case 'm':
6753 set1->val.num = ((long long)set1->val.num) % ((long long)set2->val.num);
6754 break;
6755
6756 default:
6757 LOGINT_RET(set1->ctx);
6758 }
6759
6760 return LY_SUCCESS;
6761}
6762
Michal Vasko03ff5a72019-09-11 13:49:33 +02006763/**
Michal Vasko03ff5a72019-09-11 13:49:33 +02006764 * @brief Evaluate Predicate. Logs directly on error.
6765 *
Michal Vaskod3678892020-05-21 10:06:58 +02006766 * [9] Predicate ::= '[' Expr ']'
Michal Vasko03ff5a72019-09-11 13:49:33 +02006767 *
6768 * @param[in] exp Parsed XPath expression.
Michal Vasko004d3152020-06-11 19:59:22 +02006769 * @param[in] tok_idx Position in the expression @p exp.
aPiecek8b0cc152021-05-31 16:40:31 +02006770 * @param[in,out] set Context and result set.
Michal Vasko03ff5a72019-09-11 13:49:33 +02006771 * @param[in] options XPath options.
6772 * @param[in] parent_pos_pred Whether parent predicate was a positional one.
6773 * @return LY_ERR (LY_EINCOMPLETE on unresolved when)
6774 */
6775static LY_ERR
Michal Vasko40308e72020-10-20 16:38:40 +02006776eval_predicate(const struct lyxp_expr *exp, uint16_t *tok_idx, struct lyxp_set *set, uint32_t options, ly_bool parent_pos_pred)
Michal Vasko03ff5a72019-09-11 13:49:33 +02006777{
6778 LY_ERR rc;
Michal Vasko1fdd8fa2021-01-08 09:21:45 +01006779 uint16_t orig_exp;
6780 uint32_t i, orig_pos, orig_size;
Michal Vasko5c4e5892019-11-14 12:31:38 +01006781 int32_t pred_in_ctx;
aPiecekfff4dca2021-10-07 10:59:53 +02006782 struct lyxp_set set2 = {0};
Michal Vasko03ff5a72019-09-11 13:49:33 +02006783 struct lyd_node *orig_parent;
6784
6785 /* '[' */
aPiecek8b0cc152021-05-31 16:40:31 +02006786 LOGDBG(LY_LDGXPATH, "%-27s %s %s[%u]", __func__, (options & LYXP_SKIP_EXPR ? "skipped" : "parsed"),
Michal Vasko69730152020-10-09 16:30:07 +02006787 lyxp_print_token(exp->tokens[*tok_idx]), exp->tok_pos[*tok_idx]);
Michal Vasko004d3152020-06-11 19:59:22 +02006788 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006789
aPiecek8b0cc152021-05-31 16:40:31 +02006790 if (options & LYXP_SKIP_EXPR) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02006791only_parse:
aPiecek8b0cc152021-05-31 16:40:31 +02006792 rc = eval_expr_select(exp, tok_idx, 0, set, options | LYXP_SKIP_EXPR);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006793 LY_CHECK_RET(rc);
6794 } else if (set->type == LYXP_SET_NODE_SET) {
6795 /* we (possibly) need the set sorted, it can affect the result (if the predicate result is a number) */
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01006796 assert(!set_sort(set));
Michal Vasko03ff5a72019-09-11 13:49:33 +02006797
6798 /* empty set, nothing to evaluate */
6799 if (!set->used) {
6800 goto only_parse;
6801 }
6802
Michal Vasko004d3152020-06-11 19:59:22 +02006803 orig_exp = *tok_idx;
Michal Vasko03ff5a72019-09-11 13:49:33 +02006804 orig_pos = 0;
6805 orig_size = set->used;
6806 orig_parent = NULL;
Michal Vasko39dbf352020-05-21 10:08:59 +02006807 for (i = 0; i < set->used; ++i) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02006808 set_init(&set2, set);
6809 set_insert_node(&set2, set->val.nodes[i].node, set->val.nodes[i].pos, set->val.nodes[i].type, 0);
6810 /* remember the node context position for position() and context size for last(),
6811 * predicates should always be evaluated with respect to the child axis (since we do
6812 * not support explicit axes) so we assign positions based on their parents */
Michal Vasko9e685082021-01-29 14:49:09 +01006813 if (parent_pos_pred && (lyd_parent(set->val.nodes[i].node) != orig_parent)) {
6814 orig_parent = lyd_parent(set->val.nodes[i].node);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006815 orig_pos = 1;
6816 } else {
6817 ++orig_pos;
6818 }
6819
6820 set2.ctx_pos = orig_pos;
6821 set2.ctx_size = orig_size;
Michal Vasko004d3152020-06-11 19:59:22 +02006822 *tok_idx = orig_exp;
Michal Vasko03ff5a72019-09-11 13:49:33 +02006823
Michal Vasko004d3152020-06-11 19:59:22 +02006824 rc = eval_expr_select(exp, tok_idx, 0, &set2, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006825 if (rc != LY_SUCCESS) {
Michal Vaskod3678892020-05-21 10:06:58 +02006826 lyxp_set_free_content(&set2);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006827 return rc;
6828 }
6829
6830 /* number is a position */
6831 if (set2.type == LYXP_SET_NUMBER) {
6832 if ((long long)set2.val.num == orig_pos) {
6833 set2.val.num = 1;
6834 } else {
6835 set2.val.num = 0;
6836 }
6837 }
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01006838 lyxp_set_cast(&set2, LYXP_SET_BOOLEAN);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006839
6840 /* predicate satisfied or not? */
Michal Vasko004d3152020-06-11 19:59:22 +02006841 if (!set2.val.bln) {
Michal Vasko2caefc12019-11-14 16:07:56 +01006842 set_remove_node_none(set, i);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006843 }
6844 }
Michal Vasko2caefc12019-11-14 16:07:56 +01006845 set_remove_nodes_none(set);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006846
6847 } else if (set->type == LYXP_SET_SCNODE_SET) {
6848 for (i = 0; i < set->used; ++i) {
Radek Krejcif13b87b2020-12-01 22:02:17 +01006849 if (set->val.scnodes[i].in_ctx == LYXP_SET_SCNODE_ATOM_CTX) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02006850 /* there is a currently-valid node */
6851 break;
6852 }
6853 }
6854 /* empty set, nothing to evaluate */
6855 if (i == set->used) {
6856 goto only_parse;
6857 }
6858
Michal Vasko004d3152020-06-11 19:59:22 +02006859 orig_exp = *tok_idx;
Michal Vasko03ff5a72019-09-11 13:49:33 +02006860
Michal Vasko03ff5a72019-09-11 13:49:33 +02006861 /* set special in_ctx to all the valid snodes */
6862 pred_in_ctx = set_scnode_new_in_ctx(set);
6863
6864 /* use the valid snodes one-by-one */
6865 for (i = 0; i < set->used; ++i) {
6866 if (set->val.scnodes[i].in_ctx != pred_in_ctx) {
6867 continue;
6868 }
Radek Krejcif13b87b2020-12-01 22:02:17 +01006869 set->val.scnodes[i].in_ctx = LYXP_SET_SCNODE_ATOM_CTX;
Michal Vasko03ff5a72019-09-11 13:49:33 +02006870
Michal Vasko004d3152020-06-11 19:59:22 +02006871 *tok_idx = orig_exp;
Michal Vasko03ff5a72019-09-11 13:49:33 +02006872
Michal Vasko004d3152020-06-11 19:59:22 +02006873 rc = eval_expr_select(exp, tok_idx, 0, set, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006874 LY_CHECK_RET(rc);
6875
6876 set->val.scnodes[i].in_ctx = pred_in_ctx;
6877 }
6878
6879 /* restore the state as it was before the predicate */
6880 for (i = 0; i < set->used; ++i) {
Radek Krejcif13b87b2020-12-01 22:02:17 +01006881 if (set->val.scnodes[i].in_ctx == LYXP_SET_SCNODE_ATOM_CTX) {
Michal Vasko1a09b212021-05-06 13:00:10 +02006882 set->val.scnodes[i].in_ctx = LYXP_SET_SCNODE_ATOM_NODE;
Michal Vasko03ff5a72019-09-11 13:49:33 +02006883 } else if (set->val.scnodes[i].in_ctx == pred_in_ctx) {
Radek Krejcif13b87b2020-12-01 22:02:17 +01006884 set->val.scnodes[i].in_ctx = LYXP_SET_SCNODE_ATOM_CTX;
Michal Vasko03ff5a72019-09-11 13:49:33 +02006885 }
6886 }
6887
6888 } else {
Michal Vaskod3678892020-05-21 10:06:58 +02006889 set2.type = LYXP_SET_NODE_SET;
Michal Vasko03ff5a72019-09-11 13:49:33 +02006890 set_fill_set(&set2, set);
6891
Michal Vasko004d3152020-06-11 19:59:22 +02006892 rc = eval_expr_select(exp, tok_idx, 0, &set2, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006893 if (rc != LY_SUCCESS) {
Michal Vaskod3678892020-05-21 10:06:58 +02006894 lyxp_set_free_content(&set2);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006895 return rc;
6896 }
6897
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01006898 lyxp_set_cast(&set2, LYXP_SET_BOOLEAN);
Michal Vasko004d3152020-06-11 19:59:22 +02006899 if (!set2.val.bln) {
Michal Vaskod3678892020-05-21 10:06:58 +02006900 lyxp_set_free_content(set);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006901 }
Michal Vaskod3678892020-05-21 10:06:58 +02006902 lyxp_set_free_content(&set2);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006903 }
6904
6905 /* ']' */
Michal Vasko004d3152020-06-11 19:59:22 +02006906 assert(exp->tokens[*tok_idx] == LYXP_TOKEN_BRACK2);
aPiecek8b0cc152021-05-31 16:40:31 +02006907 LOGDBG(LY_LDGXPATH, "%-27s %s %s[%u]", __func__, (options & LYXP_SKIP_EXPR ? "skipped" : "parsed"),
Michal Vasko69730152020-10-09 16:30:07 +02006908 lyxp_print_token(exp->tokens[*tok_idx]), exp->tok_pos[*tok_idx]);
Michal Vasko004d3152020-06-11 19:59:22 +02006909 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02006910
6911 return LY_SUCCESS;
6912}
6913
6914/**
Michal Vaskod3678892020-05-21 10:06:58 +02006915 * @brief Evaluate Literal. Logs directly on error.
6916 *
6917 * @param[in] exp Parsed XPath expression.
Michal Vasko004d3152020-06-11 19:59:22 +02006918 * @param[in] tok_idx Position in the expression @p exp.
Michal Vaskod3678892020-05-21 10:06:58 +02006919 * @param[in,out] set Context and result set. On NULL the rule is only parsed.
6920 */
6921static void
Michal Vasko40308e72020-10-20 16:38:40 +02006922eval_literal(const struct lyxp_expr *exp, uint16_t *tok_idx, struct lyxp_set *set)
Michal Vaskod3678892020-05-21 10:06:58 +02006923{
6924 if (set) {
Michal Vasko004d3152020-06-11 19:59:22 +02006925 if (exp->tok_len[*tok_idx] == 2) {
Michal Vaskod3678892020-05-21 10:06:58 +02006926 set_fill_string(set, "", 0);
6927 } else {
Michal Vasko004d3152020-06-11 19:59:22 +02006928 set_fill_string(set, &exp->expr[exp->tok_pos[*tok_idx] + 1], exp->tok_len[*tok_idx] - 2);
Michal Vaskod3678892020-05-21 10:06:58 +02006929 }
6930 }
6931 LOGDBG(LY_LDGXPATH, "%-27s %s %s[%u]", __func__, (set ? "parsed" : "skipped"),
Michal Vasko69730152020-10-09 16:30:07 +02006932 lyxp_print_token(exp->tokens[*tok_idx]), exp->tok_pos[*tok_idx]);
Michal Vasko004d3152020-06-11 19:59:22 +02006933 ++(*tok_idx);
Michal Vaskod3678892020-05-21 10:06:58 +02006934}
6935
6936/**
Michal Vasko004d3152020-06-11 19:59:22 +02006937 * @brief Try to compile list or leaf-list predicate in the known format to be used for hash-based instance search.
Michal Vaskod3678892020-05-21 10:06:58 +02006938 *
Michal Vasko004d3152020-06-11 19:59:22 +02006939 * @param[in] exp Full parsed XPath expression.
6940 * @param[in,out] tok_idx Index in @p exp at the beginning of the predicate, is updated on success.
Michal Vasko5d24f6c2020-10-13 13:49:06 +02006941 * @param[in] ctx_node Found schema node as the context for the predicate.
6942 * @param[in] cur_mod Current module for the expression.
6943 * @param[in] cur_node Current (original context) node.
Michal Vasko004d3152020-06-11 19:59:22 +02006944 * @param[in] format Format of any prefixes in key names/values.
Michal Vasko5d24f6c2020-10-13 13:49:06 +02006945 * @param[in] prefix_data Format-specific prefix data (see ::ly_resolve_prefix).
Michal Vasko004d3152020-06-11 19:59:22 +02006946 * @param[out] predicates Parsed predicates.
6947 * @param[out] pred_type Type of @p predicates.
6948 * @return LY_SUCCESS on success,
6949 * @return LY_ERR on any error.
Michal Vaskod3678892020-05-21 10:06:58 +02006950 */
6951static LY_ERR
Michal Vasko40308e72020-10-20 16:38:40 +02006952eval_name_test_try_compile_predicates(const struct lyxp_expr *exp, uint16_t *tok_idx, const struct lysc_node *ctx_node,
Radek Krejci8df109d2021-04-23 12:19:08 +02006953 const struct lys_module *cur_mod, const struct lysc_node *cur_node, LY_VALUE_FORMAT format, void *prefix_data,
Michal Vasko5d24f6c2020-10-13 13:49:06 +02006954 struct ly_path_predicate **predicates, enum ly_path_pred_type *pred_type)
Michal Vaskod3678892020-05-21 10:06:58 +02006955{
Michal Vasko004d3152020-06-11 19:59:22 +02006956 LY_ERR ret = LY_SUCCESS;
6957 uint16_t key_count, e_idx, pred_idx = 0;
Michal Vaskod3678892020-05-21 10:06:58 +02006958 const struct lysc_node *key;
Michal Vasko004d3152020-06-11 19:59:22 +02006959 size_t pred_len;
Radek Krejci1deb5be2020-08-26 16:43:36 +02006960 uint32_t prev_lo;
Michal Vasko004d3152020-06-11 19:59:22 +02006961 struct lyxp_expr *exp2 = NULL;
Michal Vaskod3678892020-05-21 10:06:58 +02006962
Michal Vasko5d24f6c2020-10-13 13:49:06 +02006963 assert(ctx_node->nodetype & (LYS_LIST | LYS_LEAFLIST));
Michal Vaskod3678892020-05-21 10:06:58 +02006964
Michal Vasko5d24f6c2020-10-13 13:49:06 +02006965 if (ctx_node->nodetype == LYS_LIST) {
Michal Vasko004d3152020-06-11 19:59:22 +02006966 /* get key count */
Michal Vasko5d24f6c2020-10-13 13:49:06 +02006967 if (ctx_node->flags & LYS_KEYLESS) {
Michal Vasko004d3152020-06-11 19:59:22 +02006968 return LY_EINVAL;
6969 }
Michal Vasko544e58a2021-01-28 14:33:41 +01006970 for (key_count = 0, key = lysc_node_child(ctx_node); key && (key->flags & LYS_KEY); key = key->next, ++key_count) {}
Michal Vasko004d3152020-06-11 19:59:22 +02006971 assert(key_count);
Michal Vaskod3678892020-05-21 10:06:58 +02006972
Michal Vasko004d3152020-06-11 19:59:22 +02006973 /* learn where the predicates end */
6974 e_idx = *tok_idx;
6975 while (key_count) {
6976 /* '[' */
6977 if (lyxp_check_token(NULL, exp, e_idx, LYXP_TOKEN_BRACK1)) {
6978 return LY_EINVAL;
6979 }
6980 ++e_idx;
6981
Michal Vasko3354d272021-04-06 09:40:06 +02006982 if (lyxp_check_token(NULL, exp, e_idx, LYXP_TOKEN_NAMETEST)) {
6983 /* definitely not a key */
6984 return LY_EINVAL;
6985 }
6986
Michal Vasko004d3152020-06-11 19:59:22 +02006987 /* ']' */
6988 while (lyxp_check_token(NULL, exp, e_idx, LYXP_TOKEN_BRACK2)) {
6989 ++e_idx;
6990 }
6991 ++e_idx;
6992
6993 /* another presumably key predicate parsed */
6994 --key_count;
6995 }
Michal Vasko004d3152020-06-11 19:59:22 +02006996 } else {
6997 /* learn just where this single predicate ends */
6998 e_idx = *tok_idx;
6999
Michal Vaskod3678892020-05-21 10:06:58 +02007000 /* '[' */
Michal Vasko004d3152020-06-11 19:59:22 +02007001 if (lyxp_check_token(NULL, exp, e_idx, LYXP_TOKEN_BRACK1)) {
7002 return LY_EINVAL;
7003 }
7004 ++e_idx;
Michal Vaskod3678892020-05-21 10:06:58 +02007005
Michal Vasko3354d272021-04-06 09:40:06 +02007006 if (lyxp_check_token(NULL, exp, e_idx, LYXP_TOKEN_DOT)) {
7007 /* definitely not the value */
7008 return LY_EINVAL;
7009 }
7010
Michal Vaskod3678892020-05-21 10:06:58 +02007011 /* ']' */
Michal Vasko004d3152020-06-11 19:59:22 +02007012 while (lyxp_check_token(NULL, exp, e_idx, LYXP_TOKEN_BRACK2)) {
7013 ++e_idx;
7014 }
7015 ++e_idx;
Michal Vaskod3678892020-05-21 10:06:58 +02007016 }
7017
Michal Vasko004d3152020-06-11 19:59:22 +02007018 /* get the joined length of all the keys predicates/of the single leaf-list predicate */
7019 pred_len = (exp->tok_pos[e_idx - 1] + exp->tok_len[e_idx - 1]) - exp->tok_pos[*tok_idx];
7020
7021 /* turn logging off */
7022 prev_lo = ly_log_options(0);
7023
7024 /* parse the predicate(s) */
Michal Vasko5d24f6c2020-10-13 13:49:06 +02007025 LY_CHECK_GOTO(ret = ly_path_parse_predicate(ctx_node->module->ctx, ctx_node, exp->expr + exp->tok_pos[*tok_idx],
7026 pred_len, LY_PATH_PREFIX_OPTIONAL, LY_PATH_PRED_SIMPLE, &exp2), cleanup);
Michal Vasko004d3152020-06-11 19:59:22 +02007027
7028 /* compile */
Michal Vasko5d24f6c2020-10-13 13:49:06 +02007029 ret = ly_path_compile_predicate(ctx_node->module->ctx, cur_node, cur_mod, ctx_node, exp2, &pred_idx, format,
7030 prefix_data, predicates, pred_type);
Michal Vasko004d3152020-06-11 19:59:22 +02007031 LY_CHECK_GOTO(ret, cleanup);
7032
7033 /* success, the predicate must include all the needed information for hash-based search */
7034 *tok_idx = e_idx;
7035
7036cleanup:
7037 ly_log_options(prev_lo);
Michal Vasko5d24f6c2020-10-13 13:49:06 +02007038 lyxp_expr_free(ctx_node->module->ctx, exp2);
Michal Vasko004d3152020-06-11 19:59:22 +02007039 return ret;
Michal Vaskod3678892020-05-21 10:06:58 +02007040}
7041
7042/**
Michal Vasko5d24f6c2020-10-13 13:49:06 +02007043 * @brief Search for/check the next schema node that could be the only matching schema node meaning the
7044 * data node(s) could be found using a single hash-based search.
7045 *
Michal Vaskoc71c37b2021-01-11 13:40:02 +01007046 * @param[in] ctx libyang context.
Michal Vasko5d24f6c2020-10-13 13:49:06 +02007047 * @param[in] node Next context node to check.
7048 * @param[in] name Expected node name.
7049 * @param[in] name_len Length of @p name.
Michal Vaskoc71c37b2021-01-11 13:40:02 +01007050 * @param[in] moveto_mod Expected node module, can be NULL for JSON format with no prefix.
Michal Vasko5d24f6c2020-10-13 13:49:06 +02007051 * @param[in] root_type XPath root type.
Michal Vasko5d24f6c2020-10-13 13:49:06 +02007052 * @param[in] format Prefix format.
7053 * @param[in,out] found Previously found node, is updated.
7054 * @return LY_SUCCESS on success,
7055 * @return LY_ENOT if the whole check failed and hashes cannot be used.
7056 */
7057static LY_ERR
Michal Vaskoc71c37b2021-01-11 13:40:02 +01007058eval_name_test_with_predicate_get_scnode(const struct ly_ctx *ctx, const struct lyd_node *node, const char *name,
Radek Krejci8df109d2021-04-23 12:19:08 +02007059 uint16_t name_len, const struct lys_module *moveto_mod, enum lyxp_node_type root_type, LY_VALUE_FORMAT format,
Michal Vasko5d24f6c2020-10-13 13:49:06 +02007060 const struct lysc_node **found)
7061{
7062 const struct lysc_node *scnode;
7063 const struct lys_module *mod;
7064 uint32_t idx = 0;
7065
Radek Krejci8df109d2021-04-23 12:19:08 +02007066 assert((format == LY_VALUE_JSON) || moveto_mod);
Michal Vaskoc71c37b2021-01-11 13:40:02 +01007067
Michal Vasko5d24f6c2020-10-13 13:49:06 +02007068continue_search:
Michal Vasko7d1d0912020-10-16 08:38:30 +02007069 scnode = NULL;
Michal Vasko5d24f6c2020-10-13 13:49:06 +02007070 if (!node) {
Radek Krejci8df109d2021-04-23 12:19:08 +02007071 if ((format == LY_VALUE_JSON) && !moveto_mod) {
Michal Vasko5d24f6c2020-10-13 13:49:06 +02007072 /* search all modules for a single match */
Michal Vaskoc71c37b2021-01-11 13:40:02 +01007073 while ((mod = ly_ctx_get_module_iter(ctx, &idx))) {
Michal Vasko35a3b1d2021-07-14 09:34:16 +02007074 if (!mod->implemented) {
7075 continue;
7076 }
7077
Michal Vasko5d24f6c2020-10-13 13:49:06 +02007078 scnode = lys_find_child(NULL, mod, name, name_len, 0, 0);
7079 if (scnode) {
7080 /* we have found a match */
7081 break;
7082 }
7083 }
7084
Michal Vasko7d1d0912020-10-16 08:38:30 +02007085 if (!scnode) {
7086 /* all modules searched */
7087 idx = 0;
7088 }
Michal Vasko5d24f6c2020-10-13 13:49:06 +02007089 } else {
7090 /* search in top-level */
7091 scnode = lys_find_child(NULL, moveto_mod, name, name_len, 0, 0);
7092 }
7093 } else if (!*found || (lysc_data_parent(*found) != node->schema)) {
Radek Krejci8df109d2021-04-23 12:19:08 +02007094 if ((format == LY_VALUE_JSON) && !moveto_mod) {
Michal Vasko5d24f6c2020-10-13 13:49:06 +02007095 /* we must adjust the module to inherit the one from the context node */
7096 moveto_mod = node->schema->module;
7097 }
7098
7099 /* search in children, do not repeat the same search */
7100 scnode = lys_find_child(node->schema, moveto_mod, name, name_len, 0, 0);
Michal Vasko7d1d0912020-10-16 08:38:30 +02007101 } /* else skip redundant search */
Michal Vasko5d24f6c2020-10-13 13:49:06 +02007102
7103 /* additional context check */
7104 if (scnode && (root_type == LYXP_NODE_ROOT_CONFIG) && (scnode->flags & LYS_CONFIG_R)) {
7105 scnode = NULL;
7106 }
7107
7108 if (scnode) {
7109 if (*found) {
7110 /* we found a schema node with the same name but at different level, give up, too complicated
7111 * (more hash-based searches would be required, not supported) */
7112 return LY_ENOT;
7113 } else {
7114 /* remember the found schema node and continue to make sure it can be used */
7115 *found = scnode;
7116 }
7117 }
7118
7119 if (idx) {
7120 /* continue searching all the following models */
7121 goto continue_search;
7122 }
7123
7124 return LY_SUCCESS;
7125}
7126
7127/**
Michal Vasko4ad69e72021-10-26 16:25:55 +02007128 * @brief Generate message when no matching schema nodes were found for a path segment.
7129 *
7130 * @param[in] set XPath set.
7131 * @param[in] scparent Previous schema parent in the context, if only one.
7132 * @param[in] ncname XPath NCName being evaluated.
7133 * @param[in] ncname_len Length of @p ncname.
7134 * @param[in] expr Whole XPath expression.
7135 * @param[in] options XPath options.
7136 */
7137static void
7138eval_name_test_scnode_no_match_msg(struct lyxp_set *set, const struct lyxp_set_scnode *scparent, const char *ncname,
7139 uint16_t ncname_len, const char *expr, uint32_t options)
7140{
7141 const char *format;
7142 char *path = NULL, *ppath = NULL;
7143
7144 path = lysc_path(set->cur_scnode, LYSC_PATH_LOG, NULL, 0);
7145 if (scparent) {
7146 /* generate path for the parent */
7147 if (scparent->type == LYXP_NODE_ELEM) {
7148 ppath = lysc_path(scparent->scnode, LYSC_PATH_LOG, NULL, 0);
7149 } else if (scparent->type == LYXP_NODE_ROOT) {
7150 ppath = strdup("<root>");
7151 } else if (scparent->type == LYXP_NODE_ROOT_CONFIG) {
7152 ppath = strdup("<config-root>");
7153 }
7154 }
7155 if (ppath) {
7156 format = "Schema node \"%.*s\" for parent \"%s\" not found; in expr \"%.*s\" with context node \"%s\".";
7157 if (options & LYXP_SCNODE_ERROR) {
7158 LOGERR(set->ctx, LY_EVALID, format, ncname_len, ncname, ppath, (ncname - expr) + ncname_len, expr, path);
7159 } else {
7160 LOGWRN(set->ctx, format, ncname_len, ncname, ppath, (ncname - expr) + ncname_len, expr, path);
7161 }
7162 } else {
7163 format = "Schema node \"%.*s\" not found; in expr \"%.*s\" with context node \"%s\".";
7164 if (options & LYXP_SCNODE_ERROR) {
7165 LOGERR(set->ctx, LY_EVALID, format, ncname_len, ncname, (ncname - expr) + ncname_len, expr, path);
7166 } else {
7167 LOGWRN(set->ctx, format, ncname_len, ncname, (ncname - expr) + ncname_len, expr, path);
7168 }
7169 }
7170 free(path);
7171 free(ppath);
7172}
7173
7174/**
Michal Vaskod3678892020-05-21 10:06:58 +02007175 * @brief Evaluate NameTest and any following Predicates. Logs directly on error.
7176 *
7177 * [5] Step ::= '@'? NodeTest Predicate* | '.' | '..'
7178 * [6] NodeTest ::= NameTest | NodeType '(' ')'
7179 * [7] NameTest ::= '*' | NCName ':' '*' | QName
7180 *
7181 * @param[in] exp Parsed XPath expression.
Michal Vasko004d3152020-06-11 19:59:22 +02007182 * @param[in] tok_idx Position in the expression @p exp.
Michal Vaskod3678892020-05-21 10:06:58 +02007183 * @param[in] attr_axis Whether to search attributes or standard nodes.
7184 * @param[in] all_desc Whether to search all the descendants or children only.
aPiecek8b0cc152021-05-31 16:40:31 +02007185 * @param[in,out] set Context and result set.
Michal Vaskod3678892020-05-21 10:06:58 +02007186 * @param[in] options XPath options.
Michal Vaskoa036a6b2021-10-12 16:05:23 +02007187 * @return LY_ERR (LY_EINCOMPLETE on unresolved when, LY_ENOT for not found schema node)
Michal Vaskod3678892020-05-21 10:06:58 +02007188 */
7189static LY_ERR
Michal Vasko40308e72020-10-20 16:38:40 +02007190eval_name_test_with_predicate(const struct lyxp_expr *exp, uint16_t *tok_idx, ly_bool attr_axis, ly_bool all_desc,
Michal Vasko5d24f6c2020-10-13 13:49:06 +02007191 struct lyxp_set *set, uint32_t options)
Michal Vaskod3678892020-05-21 10:06:58 +02007192{
Michal Vaskoa036a6b2021-10-12 16:05:23 +02007193 LY_ERR rc = LY_SUCCESS, r;
Michal Vasko004d3152020-06-11 19:59:22 +02007194 const char *ncname, *ncname_dict = NULL;
7195 uint16_t ncname_len;
Michal Vasko5d24f6c2020-10-13 13:49:06 +02007196 const struct lys_module *moveto_mod = NULL;
Michal Vaskoc71c37b2021-01-11 13:40:02 +01007197 const struct lysc_node *scnode = NULL;
Michal Vasko004d3152020-06-11 19:59:22 +02007198 struct ly_path_predicate *predicates = NULL;
7199 enum ly_path_pred_type pred_type = 0;
Michal Vaskoa036a6b2021-10-12 16:05:23 +02007200 int scnode_skip_pred = 0;
Michal Vaskod3678892020-05-21 10:06:58 +02007201
aPiecek8b0cc152021-05-31 16:40:31 +02007202 LOGDBG(LY_LDGXPATH, "%-27s %s %s[%u]", __func__, (options & LYXP_SKIP_EXPR ? "skipped" : "parsed"),
Michal Vasko69730152020-10-09 16:30:07 +02007203 lyxp_print_token(exp->tokens[*tok_idx]), exp->tok_pos[*tok_idx]);
Michal Vasko004d3152020-06-11 19:59:22 +02007204 ++(*tok_idx);
Michal Vaskod3678892020-05-21 10:06:58 +02007205
aPiecek8b0cc152021-05-31 16:40:31 +02007206 if (options & LYXP_SKIP_EXPR) {
Michal Vaskod3678892020-05-21 10:06:58 +02007207 goto moveto;
7208 }
7209
Michal Vasko004d3152020-06-11 19:59:22 +02007210 ncname = &exp->expr[exp->tok_pos[*tok_idx - 1]];
7211 ncname_len = exp->tok_len[*tok_idx - 1];
Michal Vaskod3678892020-05-21 10:06:58 +02007212
Michal Vaskoc71c37b2021-01-11 13:40:02 +01007213 if ((ncname[0] == '*') && (ncname_len == 1)) {
7214 /* all nodes will match */
7215 goto moveto;
Michal Vasko5d24f6c2020-10-13 13:49:06 +02007216 }
7217
Michal Vaskoc71c37b2021-01-11 13:40:02 +01007218 /* parse (and skip) module name */
7219 rc = moveto_resolve_model(&ncname, &ncname_len, set, NULL, &moveto_mod);
Michal Vaskod3678892020-05-21 10:06:58 +02007220 LY_CHECK_GOTO(rc, cleanup);
7221
Radek Krejci8df109d2021-04-23 12:19:08 +02007222 if (((set->format == LY_VALUE_JSON) || moveto_mod) && !attr_axis && !all_desc && (set->type == LYXP_SET_NODE_SET)) {
Michal Vaskod3678892020-05-21 10:06:58 +02007223 /* find the matching schema node in some parent in the context */
Radek Krejci1deb5be2020-08-26 16:43:36 +02007224 for (uint32_t i = 0; i < set->used; ++i) {
Michal Vaskoc71c37b2021-01-11 13:40:02 +01007225 if (eval_name_test_with_predicate_get_scnode(set->ctx, set->val.nodes[i].node, ncname, ncname_len,
7226 moveto_mod, set->root_type, set->format, &scnode)) {
Michal Vasko5d24f6c2020-10-13 13:49:06 +02007227 /* check failed */
7228 scnode = NULL;
7229 break;
Michal Vaskod3678892020-05-21 10:06:58 +02007230 }
7231 }
7232
Michal Vasko004d3152020-06-11 19:59:22 +02007233 if (scnode && (scnode->nodetype & (LYS_LIST | LYS_LEAFLIST))) {
7234 /* try to create the predicates */
Michal Vasko5d24f6c2020-10-13 13:49:06 +02007235 if (eval_name_test_try_compile_predicates(exp, tok_idx, scnode, set->cur_mod, set->cur_node ?
7236 set->cur_node->schema : NULL, set->format, set->prefix_data, &predicates, &pred_type)) {
Michal Vasko004d3152020-06-11 19:59:22 +02007237 /* hashes cannot be used */
Michal Vaskod3678892020-05-21 10:06:58 +02007238 scnode = NULL;
7239 }
7240 }
7241 }
7242
Michal Vaskoc71c37b2021-01-11 13:40:02 +01007243 if (!scnode) {
7244 /* we are not able to match based on a schema node and not all the modules match ("*"),
Michal Vasko004d3152020-06-11 19:59:22 +02007245 * use dictionary for efficient comparison */
Radek Krejci011e4aa2020-09-04 15:22:31 +02007246 LY_CHECK_GOTO(rc = lydict_insert(set->ctx, ncname, ncname_len, &ncname_dict), cleanup);
Michal Vaskod3678892020-05-21 10:06:58 +02007247 }
7248
7249moveto:
7250 /* move to the attribute(s), data node(s), or schema node(s) */
7251 if (attr_axis) {
aPiecek8b0cc152021-05-31 16:40:31 +02007252 if (!(options & LYXP_SKIP_EXPR) && (options & LYXP_SCNODE_ALL)) {
Michal Vasko1a09b212021-05-06 13:00:10 +02007253 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_NODE);
Michal Vaskod3678892020-05-21 10:06:58 +02007254 } else {
7255 if (all_desc) {
Michal Vaskocdad7122020-11-09 21:04:44 +01007256 rc = moveto_attr_alldesc(set, moveto_mod, ncname_dict, options);
Michal Vaskod3678892020-05-21 10:06:58 +02007257 } else {
aPiecek8b0cc152021-05-31 16:40:31 +02007258 rc = moveto_attr(set, moveto_mod, ncname_dict, options);
Michal Vaskod3678892020-05-21 10:06:58 +02007259 }
7260 LY_CHECK_GOTO(rc, cleanup);
7261 }
7262 } else {
aPiecek8b0cc152021-05-31 16:40:31 +02007263 if (!(options & LYXP_SKIP_EXPR) && (options & LYXP_SCNODE_ALL)) {
Radek Krejci1deb5be2020-08-26 16:43:36 +02007264 int64_t i;
Michal Vaskoa036a6b2021-10-12 16:05:23 +02007265 const struct lyxp_set_scnode *scparent = NULL;
Michal Vaskoa036a6b2021-10-12 16:05:23 +02007266
7267 /* remember parent if there is only one, to print in the warning */
7268 for (i = 0; i < set->used; ++i) {
7269 if (set->val.scnodes[i].in_ctx == LYXP_SET_SCNODE_ATOM_CTX) {
7270 if (!scparent) {
7271 /* remember the context node */
7272 scparent = &set->val.scnodes[i];
7273 } else {
7274 /* several context nodes, no reasonable error possible */
7275 scparent = NULL;
7276 break;
7277 }
7278 }
7279 }
Radek Krejci1deb5be2020-08-26 16:43:36 +02007280
Michal Vaskod3678892020-05-21 10:06:58 +02007281 if (all_desc) {
Michal Vasko004d3152020-06-11 19:59:22 +02007282 rc = moveto_scnode_alldesc(set, moveto_mod, ncname_dict, options);
Michal Vaskod3678892020-05-21 10:06:58 +02007283 } else {
Michal Vasko004d3152020-06-11 19:59:22 +02007284 rc = moveto_scnode(set, moveto_mod, ncname_dict, options);
Michal Vaskod3678892020-05-21 10:06:58 +02007285 }
7286 LY_CHECK_GOTO(rc, cleanup);
7287
7288 for (i = set->used - 1; i > -1; --i) {
Michal Vasko1a09b212021-05-06 13:00:10 +02007289 if (set->val.scnodes[i].in_ctx > LYXP_SET_SCNODE_ATOM_NODE) {
Michal Vaskod3678892020-05-21 10:06:58 +02007290 break;
7291 }
7292 }
7293 if (i == -1) {
Michal Vasko4ad69e72021-10-26 16:25:55 +02007294 /* generate message */
7295 eval_name_test_scnode_no_match_msg(set, scparent, ncname, ncname_len, exp->expr, options);
7296
7297 if (options & LYXP_SCNODE_ERROR) {
7298 /* error */
7299 rc = LY_EVALID;
7300 goto cleanup;
Michal Vaskoa036a6b2021-10-12 16:05:23 +02007301 }
Michal Vaskoa036a6b2021-10-12 16:05:23 +02007302
7303 /* skip the predicates and the rest of this path to not generate invalid warnings */
7304 rc = LY_ENOT;
7305 scnode_skip_pred = 1;
Michal Vaskod3678892020-05-21 10:06:58 +02007306 }
7307 } else {
7308 if (all_desc) {
Michal Vaskocdad7122020-11-09 21:04:44 +01007309 rc = moveto_node_alldesc(set, moveto_mod, ncname_dict, options);
Michal Vaskod3678892020-05-21 10:06:58 +02007310 } else {
7311 if (scnode) {
7312 /* we can find the nodes using hashes */
Michal Vaskocdad7122020-11-09 21:04:44 +01007313 rc = moveto_node_hash(set, scnode, predicates, options);
Michal Vaskod3678892020-05-21 10:06:58 +02007314 } else {
Michal Vaskocdad7122020-11-09 21:04:44 +01007315 rc = moveto_node(set, moveto_mod, ncname_dict, options);
Michal Vaskod3678892020-05-21 10:06:58 +02007316 }
7317 }
7318 LY_CHECK_GOTO(rc, cleanup);
7319 }
7320 }
7321
Michal Vaskoa036a6b2021-10-12 16:05:23 +02007322 if (scnode_skip_pred) {
7323 /* skip predicates */
7324 options |= LYXP_SKIP_EXPR;
7325 }
7326
Michal Vaskod3678892020-05-21 10:06:58 +02007327 /* Predicate* */
Michal Vasko004d3152020-06-11 19:59:22 +02007328 while (!lyxp_check_token(NULL, exp, *tok_idx, LYXP_TOKEN_BRACK1)) {
Michal Vaskoa036a6b2021-10-12 16:05:23 +02007329 r = eval_predicate(exp, tok_idx, set, options, 1);
7330 LY_CHECK_ERR_GOTO(r, rc = r, cleanup);
Michal Vaskod3678892020-05-21 10:06:58 +02007331 }
7332
7333cleanup:
Michal Vaskoa036a6b2021-10-12 16:05:23 +02007334 if (scnode_skip_pred) {
7335 /* restore options */
7336 options &= ~LYXP_SKIP_EXPR;
7337 }
aPiecek8b0cc152021-05-31 16:40:31 +02007338 if (!(options & LYXP_SKIP_EXPR)) {
Michal Vasko004d3152020-06-11 19:59:22 +02007339 lydict_remove(set->ctx, ncname_dict);
Michal Vaskof7e16e22020-10-21 09:24:39 +02007340 ly_path_predicates_free(set->ctx, pred_type, predicates);
Michal Vaskodb51a8d2020-05-27 15:22:29 +02007341 }
Michal Vaskod3678892020-05-21 10:06:58 +02007342 return rc;
7343}
7344
7345/**
7346 * @brief Evaluate NodeType and any following Predicates. Logs directly on error.
7347 *
7348 * [5] Step ::= '@'? NodeTest Predicate* | '.' | '..'
7349 * [6] NodeTest ::= NameTest | NodeType '(' ')'
7350 * [8] NodeType ::= 'text' | 'node'
7351 *
7352 * @param[in] exp Parsed XPath expression.
Michal Vasko004d3152020-06-11 19:59:22 +02007353 * @param[in] tok_idx Position in the expression @p exp.
Michal Vaskod3678892020-05-21 10:06:58 +02007354 * @param[in] attr_axis Whether to search attributes or standard nodes.
7355 * @param[in] all_desc Whether to search all the descendants or children only.
aPiecek8b0cc152021-05-31 16:40:31 +02007356 * @param[in,out] set Context and result set.
Michal Vaskod3678892020-05-21 10:06:58 +02007357 * @param[in] options XPath options.
7358 * @return LY_ERR (LY_EINCOMPLETE on unresolved when)
7359 */
7360static LY_ERR
Michal Vasko40308e72020-10-20 16:38:40 +02007361eval_node_type_with_predicate(const struct lyxp_expr *exp, uint16_t *tok_idx, ly_bool attr_axis, ly_bool all_desc,
Radek Krejci1deb5be2020-08-26 16:43:36 +02007362 struct lyxp_set *set, uint32_t options)
Michal Vaskod3678892020-05-21 10:06:58 +02007363{
7364 LY_ERR rc;
7365
7366 /* TODO */
7367 (void)attr_axis;
7368 (void)all_desc;
7369
aPiecek8b0cc152021-05-31 16:40:31 +02007370 if (!(options & LYXP_SKIP_EXPR)) {
Michal Vasko004d3152020-06-11 19:59:22 +02007371 assert(exp->tok_len[*tok_idx] == 4);
Michal Vaskod3678892020-05-21 10:06:58 +02007372 if (set->type == LYXP_SET_SCNODE_SET) {
Michal Vasko1a09b212021-05-06 13:00:10 +02007373 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_NODE);
aPiecek8b0cc152021-05-31 16:40:31 +02007374 options |= LYXP_SKIP_EXPR;
Michal Vaskod3678892020-05-21 10:06:58 +02007375 } else {
Michal Vasko004d3152020-06-11 19:59:22 +02007376 if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "node", 4)) {
Michal Vaskod3678892020-05-21 10:06:58 +02007377 rc = xpath_node(NULL, 0, set, options);
7378 } else {
Michal Vasko004d3152020-06-11 19:59:22 +02007379 assert(!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "text", 4));
Michal Vaskod3678892020-05-21 10:06:58 +02007380 rc = xpath_text(NULL, 0, set, options);
7381 }
7382 LY_CHECK_RET(rc);
7383 }
7384 }
aPiecek8b0cc152021-05-31 16:40:31 +02007385 LOGDBG(LY_LDGXPATH, "%-27s %s %s[%u]", __func__, (options & LYXP_SKIP_EXPR ? "skipped" : "parsed"),
Michal Vasko69730152020-10-09 16:30:07 +02007386 lyxp_print_token(exp->tokens[*tok_idx]), exp->tok_pos[*tok_idx]);
Michal Vasko004d3152020-06-11 19:59:22 +02007387 ++(*tok_idx);
Michal Vaskod3678892020-05-21 10:06:58 +02007388
7389 /* '(' */
Michal Vasko004d3152020-06-11 19:59:22 +02007390 assert(exp->tokens[*tok_idx] == LYXP_TOKEN_PAR1);
aPiecek8b0cc152021-05-31 16:40:31 +02007391 LOGDBG(LY_LDGXPATH, "%-27s %s %s[%u]", __func__, (options & LYXP_SKIP_EXPR ? "skipped" : "parsed"),
Michal Vasko69730152020-10-09 16:30:07 +02007392 lyxp_print_token(exp->tokens[*tok_idx]), exp->tok_pos[*tok_idx]);
Michal Vasko004d3152020-06-11 19:59:22 +02007393 ++(*tok_idx);
Michal Vaskod3678892020-05-21 10:06:58 +02007394
7395 /* ')' */
Michal Vasko004d3152020-06-11 19:59:22 +02007396 assert(exp->tokens[*tok_idx] == LYXP_TOKEN_PAR2);
aPiecek8b0cc152021-05-31 16:40:31 +02007397 LOGDBG(LY_LDGXPATH, "%-27s %s %s[%u]", __func__, (options & LYXP_SKIP_EXPR ? "skipped" : "parsed"),
Michal Vasko69730152020-10-09 16:30:07 +02007398 lyxp_print_token(exp->tokens[*tok_idx]), exp->tok_pos[*tok_idx]);
Michal Vasko004d3152020-06-11 19:59:22 +02007399 ++(*tok_idx);
Michal Vaskod3678892020-05-21 10:06:58 +02007400
7401 /* Predicate* */
Michal Vasko004d3152020-06-11 19:59:22 +02007402 while (!lyxp_check_token(NULL, exp, *tok_idx, LYXP_TOKEN_BRACK1)) {
7403 rc = eval_predicate(exp, tok_idx, set, options, 1);
Michal Vaskod3678892020-05-21 10:06:58 +02007404 LY_CHECK_RET(rc);
7405 }
7406
7407 return LY_SUCCESS;
7408}
7409
7410/**
Michal Vasko03ff5a72019-09-11 13:49:33 +02007411 * @brief Evaluate RelativeLocationPath. Logs directly on error.
7412 *
7413 * [4] RelativeLocationPath ::= Step | RelativeLocationPath '/' Step | RelativeLocationPath '//' Step
7414 * [5] Step ::= '@'? NodeTest Predicate* | '.' | '..'
Michal Vaskod3678892020-05-21 10:06:58 +02007415 * [6] NodeTest ::= NameTest | NodeType '(' ')'
Michal Vasko03ff5a72019-09-11 13:49:33 +02007416 *
7417 * @param[in] exp Parsed XPath expression.
Michal Vasko004d3152020-06-11 19:59:22 +02007418 * @param[in] tok_idx Position in the expression @p exp.
Michal Vasko03ff5a72019-09-11 13:49:33 +02007419 * @param[in] all_desc Whether to search all the descendants or children only.
aPiecek8b0cc152021-05-31 16:40:31 +02007420 * @param[in,out] set Context and result set.
Michal Vasko03ff5a72019-09-11 13:49:33 +02007421 * @param[in] options XPath options.
7422 * @return LY_ERR (YL_EINCOMPLETE on unresolved when)
7423 */
7424static LY_ERR
Michal Vasko40308e72020-10-20 16:38:40 +02007425eval_relative_location_path(const struct lyxp_expr *exp, uint16_t *tok_idx, ly_bool all_desc, struct lyxp_set *set,
7426 uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02007427{
Radek Krejci857189e2020-09-01 13:26:36 +02007428 ly_bool attr_axis;
Michal Vaskoa036a6b2021-10-12 16:05:23 +02007429 LY_ERR rc = LY_SUCCESS;
7430 int scnode_skip_path = 0;
Michal Vasko03ff5a72019-09-11 13:49:33 +02007431
7432 goto step;
7433 do {
7434 /* evaluate '/' or '//' */
Michal Vasko004d3152020-06-11 19:59:22 +02007435 if (exp->tok_len[*tok_idx] == 1) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007436 all_desc = 0;
7437 } else {
Michal Vasko004d3152020-06-11 19:59:22 +02007438 assert(exp->tok_len[*tok_idx] == 2);
Michal Vasko03ff5a72019-09-11 13:49:33 +02007439 all_desc = 1;
7440 }
aPiecek8b0cc152021-05-31 16:40:31 +02007441 LOGDBG(LY_LDGXPATH, "%-27s %s %s[%u]", __func__, (options & LYXP_SKIP_EXPR ? "skipped" : "parsed"),
Michal Vasko69730152020-10-09 16:30:07 +02007442 lyxp_print_token(exp->tokens[*tok_idx]), exp->tok_pos[*tok_idx]);
Michal Vasko004d3152020-06-11 19:59:22 +02007443 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02007444
7445step:
Michal Vaskod3678892020-05-21 10:06:58 +02007446 /* evaluate abbreviated axis '@'? if any */
Michal Vasko004d3152020-06-11 19:59:22 +02007447 if (exp->tokens[*tok_idx] == LYXP_TOKEN_AT) {
Michal Vaskod3678892020-05-21 10:06:58 +02007448 attr_axis = 1;
7449
aPiecek8b0cc152021-05-31 16:40:31 +02007450 LOGDBG(LY_LDGXPATH, "%-27s %s %s[%u]", __func__, (options & LYXP_SKIP_EXPR ? "skipped" : "parsed"),
Michal Vasko69730152020-10-09 16:30:07 +02007451 lyxp_print_token(exp->tokens[*tok_idx]), exp->tok_pos[*tok_idx]);
Michal Vasko004d3152020-06-11 19:59:22 +02007452 ++(*tok_idx);
Michal Vaskod3678892020-05-21 10:06:58 +02007453 } else {
7454 attr_axis = 0;
7455 }
7456
Michal Vasko03ff5a72019-09-11 13:49:33 +02007457 /* Step */
Michal Vasko004d3152020-06-11 19:59:22 +02007458 switch (exp->tokens[*tok_idx]) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007459 case LYXP_TOKEN_DOT:
7460 /* evaluate '.' */
aPiecek8b0cc152021-05-31 16:40:31 +02007461 if (!(options & LYXP_SKIP_EXPR) && (options & LYXP_SCNODE_ALL)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007462 rc = moveto_scnode_self(set, all_desc, options);
7463 } else {
7464 rc = moveto_self(set, all_desc, options);
7465 }
Michal Vaskoa036a6b2021-10-12 16:05:23 +02007466 LY_CHECK_GOTO(rc, cleanup);
Michal Vasko03ff5a72019-09-11 13:49:33 +02007467 LOGDBG(LY_LDGXPATH, "%-27s %s %s[%u]", __func__, (set ? "parsed" : "skipped"),
Michal Vasko69730152020-10-09 16:30:07 +02007468 lyxp_print_token(exp->tokens[*tok_idx]), exp->tok_pos[*tok_idx]);
Michal Vasko004d3152020-06-11 19:59:22 +02007469 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02007470 break;
7471
7472 case LYXP_TOKEN_DDOT:
7473 /* evaluate '..' */
aPiecek8b0cc152021-05-31 16:40:31 +02007474 if (!(options & LYXP_SKIP_EXPR) && (options & LYXP_SCNODE_ALL)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007475 rc = moveto_scnode_parent(set, all_desc, options);
7476 } else {
7477 rc = moveto_parent(set, all_desc, options);
7478 }
Michal Vaskoa036a6b2021-10-12 16:05:23 +02007479 LY_CHECK_GOTO(rc, cleanup);
aPiecek8b0cc152021-05-31 16:40:31 +02007480 LOGDBG(LY_LDGXPATH, "%-27s %s %s[%u]", __func__, (options & LYXP_SKIP_EXPR ? "skipped" : "parsed"),
Michal Vasko69730152020-10-09 16:30:07 +02007481 lyxp_print_token(exp->tokens[*tok_idx]), exp->tok_pos[*tok_idx]);
Michal Vasko004d3152020-06-11 19:59:22 +02007482 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02007483 break;
7484
Michal Vasko03ff5a72019-09-11 13:49:33 +02007485 case LYXP_TOKEN_NAMETEST:
Michal Vaskod3678892020-05-21 10:06:58 +02007486 /* evaluate NameTest Predicate* */
Michal Vasko004d3152020-06-11 19:59:22 +02007487 rc = eval_name_test_with_predicate(exp, tok_idx, attr_axis, all_desc, set, options);
Michal Vaskoa036a6b2021-10-12 16:05:23 +02007488 if (rc == LY_ENOT) {
7489 assert(options & LYXP_SCNODE_ALL);
7490 /* skip the rest of this path */
7491 rc = LY_SUCCESS;
7492 scnode_skip_path = 1;
7493 options |= LYXP_SKIP_EXPR;
7494 }
7495 LY_CHECK_GOTO(rc, cleanup);
Michal Vaskod3678892020-05-21 10:06:58 +02007496 break;
Michal Vasko03ff5a72019-09-11 13:49:33 +02007497
Michal Vaskod3678892020-05-21 10:06:58 +02007498 case LYXP_TOKEN_NODETYPE:
7499 /* evaluate NodeType Predicate* */
Michal Vasko004d3152020-06-11 19:59:22 +02007500 rc = eval_node_type_with_predicate(exp, tok_idx, attr_axis, all_desc, set, options);
Michal Vaskoa036a6b2021-10-12 16:05:23 +02007501 LY_CHECK_GOTO(rc, cleanup);
Michal Vasko03ff5a72019-09-11 13:49:33 +02007502 break;
7503
7504 default:
Michal Vaskoa036a6b2021-10-12 16:05:23 +02007505 LOGINT(set->ctx);
7506 rc = LY_EINT;
7507 goto cleanup;
Michal Vasko03ff5a72019-09-11 13:49:33 +02007508 }
Michal Vasko004d3152020-06-11 19:59:22 +02007509 } while (!exp_check_token2(NULL, exp, *tok_idx, LYXP_TOKEN_OPER_PATH, LYXP_TOKEN_OPER_RPATH));
Michal Vasko03ff5a72019-09-11 13:49:33 +02007510
Michal Vaskoa036a6b2021-10-12 16:05:23 +02007511cleanup:
7512 if (scnode_skip_path) {
7513 options &= ~LYXP_SKIP_EXPR;
7514 }
7515 return rc;
Michal Vasko03ff5a72019-09-11 13:49:33 +02007516}
7517
7518/**
7519 * @brief Evaluate AbsoluteLocationPath. Logs directly on error.
7520 *
7521 * [3] AbsoluteLocationPath ::= '/' RelativeLocationPath? | '//' RelativeLocationPath
7522 *
7523 * @param[in] exp Parsed XPath expression.
Michal Vasko004d3152020-06-11 19:59:22 +02007524 * @param[in] tok_idx Position in the expression @p exp.
aPiecek8b0cc152021-05-31 16:40:31 +02007525 * @param[in,out] set Context and result set.
Michal Vasko03ff5a72019-09-11 13:49:33 +02007526 * @param[in] options XPath options.
7527 * @return LY_ERR (LY_EINCOMPLETE on unresolved when)
7528 */
7529static LY_ERR
Michal Vasko40308e72020-10-20 16:38:40 +02007530eval_absolute_location_path(const struct lyxp_expr *exp, uint16_t *tok_idx, struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02007531{
Radek Krejci857189e2020-09-01 13:26:36 +02007532 ly_bool all_desc;
Michal Vasko03ff5a72019-09-11 13:49:33 +02007533
aPiecek8b0cc152021-05-31 16:40:31 +02007534 if (!(options & LYXP_SKIP_EXPR)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007535 /* no matter what tokens follow, we need to be at the root */
Michal Vaskob0099a92020-08-31 14:55:23 +02007536 LY_CHECK_RET(moveto_root(set, options));
Michal Vasko03ff5a72019-09-11 13:49:33 +02007537 }
7538
7539 /* '/' RelativeLocationPath? */
Michal Vasko004d3152020-06-11 19:59:22 +02007540 if (exp->tok_len[*tok_idx] == 1) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007541 /* evaluate '/' - deferred */
7542 all_desc = 0;
aPiecek8b0cc152021-05-31 16:40:31 +02007543 LOGDBG(LY_LDGXPATH, "%-27s %s %s[%u]", __func__, (options & LYXP_SKIP_EXPR ? "skipped" : "parsed"),
Michal Vasko69730152020-10-09 16:30:07 +02007544 lyxp_print_token(exp->tokens[*tok_idx]), exp->tok_pos[*tok_idx]);
Michal Vasko004d3152020-06-11 19:59:22 +02007545 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02007546
Michal Vasko004d3152020-06-11 19:59:22 +02007547 if (lyxp_check_token(NULL, exp, *tok_idx, LYXP_TOKEN_NONE)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007548 return LY_SUCCESS;
7549 }
Michal Vasko004d3152020-06-11 19:59:22 +02007550 switch (exp->tokens[*tok_idx]) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007551 case LYXP_TOKEN_DOT:
7552 case LYXP_TOKEN_DDOT:
7553 case LYXP_TOKEN_AT:
7554 case LYXP_TOKEN_NAMETEST:
7555 case LYXP_TOKEN_NODETYPE:
Michal Vaskob0099a92020-08-31 14:55:23 +02007556 LY_CHECK_RET(eval_relative_location_path(exp, tok_idx, all_desc, set, options));
Michal Vasko03ff5a72019-09-11 13:49:33 +02007557 break;
7558 default:
7559 break;
7560 }
7561
Michal Vasko03ff5a72019-09-11 13:49:33 +02007562 } else {
Radek Krejcif6a11002020-08-21 13:29:07 +02007563 /* '//' RelativeLocationPath */
Michal Vasko03ff5a72019-09-11 13:49:33 +02007564 /* evaluate '//' - deferred so as not to waste memory by remembering all the nodes */
7565 all_desc = 1;
aPiecek8b0cc152021-05-31 16:40:31 +02007566 LOGDBG(LY_LDGXPATH, "%-27s %s %s[%u]", __func__, (options & LYXP_SKIP_EXPR ? "skipped" : "parsed"),
Michal Vasko69730152020-10-09 16:30:07 +02007567 lyxp_print_token(exp->tokens[*tok_idx]), exp->tok_pos[*tok_idx]);
Michal Vasko004d3152020-06-11 19:59:22 +02007568 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02007569
Michal Vaskob0099a92020-08-31 14:55:23 +02007570 LY_CHECK_RET(eval_relative_location_path(exp, tok_idx, all_desc, set, options));
Michal Vasko03ff5a72019-09-11 13:49:33 +02007571 }
7572
7573 return LY_SUCCESS;
7574}
7575
7576/**
7577 * @brief Evaluate FunctionCall. Logs directly on error.
7578 *
Michal Vaskod3678892020-05-21 10:06:58 +02007579 * [11] FunctionCall ::= FunctionName '(' ( Expr ( ',' Expr )* )? ')'
Michal Vasko03ff5a72019-09-11 13:49:33 +02007580 *
7581 * @param[in] exp Parsed XPath expression.
Michal Vasko004d3152020-06-11 19:59:22 +02007582 * @param[in] tok_idx Position in the expression @p exp.
aPiecek8b0cc152021-05-31 16:40:31 +02007583 * @param[in,out] set Context and result set.
Michal Vasko03ff5a72019-09-11 13:49:33 +02007584 * @param[in] options XPath options.
7585 * @return LY_ERR (LY_EINCOMPLETE on unresolved when)
7586 */
7587static LY_ERR
Michal Vasko40308e72020-10-20 16:38:40 +02007588eval_function_call(const struct lyxp_expr *exp, uint16_t *tok_idx, struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02007589{
7590 LY_ERR rc;
Michal Vasko69730152020-10-09 16:30:07 +02007591
Radek Krejci1deb5be2020-08-26 16:43:36 +02007592 LY_ERR (*xpath_func)(struct lyxp_set **, uint16_t, struct lyxp_set *, uint32_t) = NULL;
Michal Vasko0cbf54f2019-12-16 10:01:06 +01007593 uint16_t arg_count = 0, i;
Michal Vasko03ff5a72019-09-11 13:49:33 +02007594 struct lyxp_set **args = NULL, **args_aux;
7595
aPiecek8b0cc152021-05-31 16:40:31 +02007596 if (!(options & LYXP_SKIP_EXPR)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007597 /* FunctionName */
Michal Vasko004d3152020-06-11 19:59:22 +02007598 switch (exp->tok_len[*tok_idx]) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007599 case 3:
Michal Vasko004d3152020-06-11 19:59:22 +02007600 if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "not", 3)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007601 xpath_func = &xpath_not;
Michal Vasko004d3152020-06-11 19:59:22 +02007602 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "sum", 3)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007603 xpath_func = &xpath_sum;
7604 }
7605 break;
7606 case 4:
Michal Vasko004d3152020-06-11 19:59:22 +02007607 if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "lang", 4)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007608 xpath_func = &xpath_lang;
Michal Vasko004d3152020-06-11 19:59:22 +02007609 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "last", 4)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007610 xpath_func = &xpath_last;
Michal Vasko004d3152020-06-11 19:59:22 +02007611 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "name", 4)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007612 xpath_func = &xpath_name;
Michal Vasko004d3152020-06-11 19:59:22 +02007613 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "true", 4)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007614 xpath_func = &xpath_true;
7615 }
7616 break;
7617 case 5:
Michal Vasko004d3152020-06-11 19:59:22 +02007618 if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "count", 5)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007619 xpath_func = &xpath_count;
Michal Vasko004d3152020-06-11 19:59:22 +02007620 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "false", 5)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007621 xpath_func = &xpath_false;
Michal Vasko004d3152020-06-11 19:59:22 +02007622 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "floor", 5)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007623 xpath_func = &xpath_floor;
Michal Vasko004d3152020-06-11 19:59:22 +02007624 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "round", 5)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007625 xpath_func = &xpath_round;
Michal Vasko004d3152020-06-11 19:59:22 +02007626 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "deref", 5)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007627 xpath_func = &xpath_deref;
7628 }
7629 break;
7630 case 6:
Michal Vasko004d3152020-06-11 19:59:22 +02007631 if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "concat", 6)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007632 xpath_func = &xpath_concat;
Michal Vasko004d3152020-06-11 19:59:22 +02007633 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "number", 6)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007634 xpath_func = &xpath_number;
Michal Vasko004d3152020-06-11 19:59:22 +02007635 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "string", 6)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007636 xpath_func = &xpath_string;
7637 }
7638 break;
7639 case 7:
Michal Vasko004d3152020-06-11 19:59:22 +02007640 if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "boolean", 7)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007641 xpath_func = &xpath_boolean;
Michal Vasko004d3152020-06-11 19:59:22 +02007642 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "ceiling", 7)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007643 xpath_func = &xpath_ceiling;
Michal Vasko004d3152020-06-11 19:59:22 +02007644 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "current", 7)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007645 xpath_func = &xpath_current;
7646 }
7647 break;
7648 case 8:
Michal Vasko004d3152020-06-11 19:59:22 +02007649 if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "contains", 8)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007650 xpath_func = &xpath_contains;
Michal Vasko004d3152020-06-11 19:59:22 +02007651 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "position", 8)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007652 xpath_func = &xpath_position;
Michal Vasko004d3152020-06-11 19:59:22 +02007653 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "re-match", 8)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007654 xpath_func = &xpath_re_match;
7655 }
7656 break;
7657 case 9:
Michal Vasko004d3152020-06-11 19:59:22 +02007658 if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "substring", 9)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007659 xpath_func = &xpath_substring;
Michal Vasko004d3152020-06-11 19:59:22 +02007660 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "translate", 9)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007661 xpath_func = &xpath_translate;
7662 }
7663 break;
7664 case 10:
Michal Vasko004d3152020-06-11 19:59:22 +02007665 if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "local-name", 10)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007666 xpath_func = &xpath_local_name;
Michal Vasko004d3152020-06-11 19:59:22 +02007667 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "enum-value", 10)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007668 xpath_func = &xpath_enum_value;
Michal Vasko004d3152020-06-11 19:59:22 +02007669 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "bit-is-set", 10)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007670 xpath_func = &xpath_bit_is_set;
7671 }
7672 break;
7673 case 11:
Michal Vasko004d3152020-06-11 19:59:22 +02007674 if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "starts-with", 11)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007675 xpath_func = &xpath_starts_with;
7676 }
7677 break;
7678 case 12:
Michal Vasko004d3152020-06-11 19:59:22 +02007679 if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "derived-from", 12)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007680 xpath_func = &xpath_derived_from;
7681 }
7682 break;
7683 case 13:
Michal Vasko004d3152020-06-11 19:59:22 +02007684 if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "namespace-uri", 13)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007685 xpath_func = &xpath_namespace_uri;
Michal Vasko004d3152020-06-11 19:59:22 +02007686 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "string-length", 13)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007687 xpath_func = &xpath_string_length;
7688 }
7689 break;
7690 case 15:
Michal Vasko004d3152020-06-11 19:59:22 +02007691 if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "normalize-space", 15)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007692 xpath_func = &xpath_normalize_space;
Michal Vasko004d3152020-06-11 19:59:22 +02007693 } else if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "substring-after", 15)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007694 xpath_func = &xpath_substring_after;
7695 }
7696 break;
7697 case 16:
Michal Vasko004d3152020-06-11 19:59:22 +02007698 if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "substring-before", 16)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007699 xpath_func = &xpath_substring_before;
7700 }
7701 break;
7702 case 20:
Michal Vasko004d3152020-06-11 19:59:22 +02007703 if (!strncmp(&exp->expr[exp->tok_pos[*tok_idx]], "derived-from-or-self", 20)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007704 xpath_func = &xpath_derived_from_or_self;
7705 }
7706 break;
7707 }
7708
7709 if (!xpath_func) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01007710 LOGVAL(set->ctx, LY_VCODE_XP_INFUNC, exp->tok_len[*tok_idx], &exp->expr[exp->tok_pos[*tok_idx]]);
Michal Vasko03ff5a72019-09-11 13:49:33 +02007711 return LY_EVALID;
7712 }
7713 }
7714
aPiecek8b0cc152021-05-31 16:40:31 +02007715 LOGDBG(LY_LDGXPATH, "%-27s %s %s[%u]", __func__, (options & LYXP_SKIP_EXPR ? "skipped" : "parsed"),
Michal Vasko69730152020-10-09 16:30:07 +02007716 lyxp_print_token(exp->tokens[*tok_idx]), exp->tok_pos[*tok_idx]);
Michal Vasko004d3152020-06-11 19:59:22 +02007717 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02007718
7719 /* '(' */
Michal Vasko004d3152020-06-11 19:59:22 +02007720 assert(exp->tokens[*tok_idx] == LYXP_TOKEN_PAR1);
aPiecek8b0cc152021-05-31 16:40:31 +02007721 LOGDBG(LY_LDGXPATH, "%-27s %s %s[%u]", __func__, (options & LYXP_SKIP_EXPR ? "skipped" : "parsed"),
Michal Vasko69730152020-10-09 16:30:07 +02007722 lyxp_print_token(exp->tokens[*tok_idx]), exp->tok_pos[*tok_idx]);
Michal Vasko004d3152020-06-11 19:59:22 +02007723 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02007724
7725 /* ( Expr ( ',' Expr )* )? */
Michal Vasko004d3152020-06-11 19:59:22 +02007726 if (exp->tokens[*tok_idx] != LYXP_TOKEN_PAR2) {
aPiecek8b0cc152021-05-31 16:40:31 +02007727 if (!(options & LYXP_SKIP_EXPR)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007728 args = malloc(sizeof *args);
7729 LY_CHECK_ERR_GOTO(!args, LOGMEM(set->ctx); rc = LY_EMEM, cleanup);
7730 arg_count = 1;
7731 args[0] = set_copy(set);
7732 if (!args[0]) {
7733 rc = LY_EMEM;
7734 goto cleanup;
7735 }
7736
Michal Vasko004d3152020-06-11 19:59:22 +02007737 rc = eval_expr_select(exp, tok_idx, 0, args[0], options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02007738 LY_CHECK_GOTO(rc, cleanup);
7739 } else {
aPiecek8b0cc152021-05-31 16:40:31 +02007740 rc = eval_expr_select(exp, tok_idx, 0, set, options | LYXP_SKIP_EXPR);
Michal Vasko03ff5a72019-09-11 13:49:33 +02007741 LY_CHECK_GOTO(rc, cleanup);
7742 }
7743 }
Michal Vasko004d3152020-06-11 19:59:22 +02007744 while (!lyxp_check_token(NULL, exp, *tok_idx, LYXP_TOKEN_COMMA)) {
aPiecek8b0cc152021-05-31 16:40:31 +02007745 LOGDBG(LY_LDGXPATH, "%-27s %s %s[%u]", __func__, (options & LYXP_SKIP_EXPR ? "skipped" : "parsed"),
Michal Vasko69730152020-10-09 16:30:07 +02007746 lyxp_print_token(exp->tokens[*tok_idx]), exp->tok_pos[*tok_idx]);
Michal Vasko004d3152020-06-11 19:59:22 +02007747 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02007748
aPiecek8b0cc152021-05-31 16:40:31 +02007749 if (!(options & LYXP_SKIP_EXPR)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007750 ++arg_count;
7751 args_aux = realloc(args, arg_count * sizeof *args);
7752 LY_CHECK_ERR_GOTO(!args_aux, arg_count--; LOGMEM(set->ctx); rc = LY_EMEM, cleanup);
7753 args = args_aux;
7754 args[arg_count - 1] = set_copy(set);
7755 if (!args[arg_count - 1]) {
7756 rc = LY_EMEM;
7757 goto cleanup;
7758 }
7759
Michal Vasko004d3152020-06-11 19:59:22 +02007760 rc = eval_expr_select(exp, tok_idx, 0, args[arg_count - 1], options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02007761 LY_CHECK_GOTO(rc, cleanup);
7762 } else {
aPiecek8b0cc152021-05-31 16:40:31 +02007763 rc = eval_expr_select(exp, tok_idx, 0, set, options | LYXP_SKIP_EXPR);
Michal Vasko03ff5a72019-09-11 13:49:33 +02007764 LY_CHECK_GOTO(rc, cleanup);
7765 }
7766 }
7767
7768 /* ')' */
Michal Vasko004d3152020-06-11 19:59:22 +02007769 assert(exp->tokens[*tok_idx] == LYXP_TOKEN_PAR2);
aPiecek8b0cc152021-05-31 16:40:31 +02007770 LOGDBG(LY_LDGXPATH, "%-27s %s %s[%u]", __func__, (options & LYXP_SKIP_EXPR ? "skipped" : "parsed"),
Michal Vasko69730152020-10-09 16:30:07 +02007771 lyxp_print_token(exp->tokens[*tok_idx]), exp->tok_pos[*tok_idx]);
Michal Vasko004d3152020-06-11 19:59:22 +02007772 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02007773
aPiecek8b0cc152021-05-31 16:40:31 +02007774 if (!(options & LYXP_SKIP_EXPR)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007775 /* evaluate function */
7776 rc = xpath_func(args, arg_count, set, options);
7777
7778 if (options & LYXP_SCNODE_ALL) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007779 /* merge all nodes from arg evaluations */
7780 for (i = 0; i < arg_count; ++i) {
Michal Vasko1a09b212021-05-06 13:00:10 +02007781 set_scnode_clear_ctx(args[i], LYXP_SET_SCNODE_ATOM_NODE);
Michal Vaskoecd62de2019-11-13 12:35:11 +01007782 lyxp_set_scnode_merge(set, args[i]);
Michal Vasko03ff5a72019-09-11 13:49:33 +02007783 }
7784 }
7785 } else {
7786 rc = LY_SUCCESS;
7787 }
7788
7789cleanup:
7790 for (i = 0; i < arg_count; ++i) {
7791 lyxp_set_free(args[i]);
7792 }
7793 free(args);
Michal Vasko03ff5a72019-09-11 13:49:33 +02007794 return rc;
7795}
7796
7797/**
7798 * @brief Evaluate Number. Logs directly on error.
7799 *
7800 * @param[in] ctx Context for errors.
7801 * @param[in] exp Parsed XPath expression.
Michal Vasko004d3152020-06-11 19:59:22 +02007802 * @param[in] tok_idx Position in the expression @p exp.
Michal Vasko03ff5a72019-09-11 13:49:33 +02007803 * @param[in,out] set Context and result set. On NULL the rule is only parsed.
7804 * @return LY_ERR
7805 */
7806static LY_ERR
Michal Vasko40308e72020-10-20 16:38:40 +02007807eval_number(struct ly_ctx *ctx, const struct lyxp_expr *exp, uint16_t *tok_idx, struct lyxp_set *set)
Michal Vasko03ff5a72019-09-11 13:49:33 +02007808{
7809 long double num;
7810 char *endptr;
7811
7812 if (set) {
7813 errno = 0;
Michal Vasko004d3152020-06-11 19:59:22 +02007814 num = strtold(&exp->expr[exp->tok_pos[*tok_idx]], &endptr);
Michal Vasko03ff5a72019-09-11 13:49:33 +02007815 if (errno) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01007816 LOGVAL(ctx, LY_VCODE_XP_INTOK, "Unknown", &exp->expr[exp->tok_pos[*tok_idx]]);
7817 LOGVAL(ctx, LYVE_XPATH, "Failed to convert \"%.*s\" into a long double (%s).",
Michal Vasko69730152020-10-09 16:30:07 +02007818 exp->tok_len[*tok_idx], &exp->expr[exp->tok_pos[*tok_idx]], strerror(errno));
Michal Vasko03ff5a72019-09-11 13:49:33 +02007819 return LY_EVALID;
Michal Vasko004d3152020-06-11 19:59:22 +02007820 } else if (endptr - &exp->expr[exp->tok_pos[*tok_idx]] != exp->tok_len[*tok_idx]) {
Radek Krejci2efc45b2020-12-22 16:25:44 +01007821 LOGVAL(ctx, LY_VCODE_XP_INTOK, "Unknown", &exp->expr[exp->tok_pos[*tok_idx]]);
7822 LOGVAL(ctx, LYVE_XPATH, "Failed to convert \"%.*s\" into a long double.",
Michal Vasko69730152020-10-09 16:30:07 +02007823 exp->tok_len[*tok_idx], &exp->expr[exp->tok_pos[*tok_idx]]);
Michal Vasko03ff5a72019-09-11 13:49:33 +02007824 return LY_EVALID;
7825 }
7826
7827 set_fill_number(set, num);
7828 }
7829
7830 LOGDBG(LY_LDGXPATH, "%-27s %s %s[%u]", __func__, (set ? "parsed" : "skipped"),
Michal Vasko69730152020-10-09 16:30:07 +02007831 lyxp_print_token(exp->tokens[*tok_idx]), exp->tok_pos[*tok_idx]);
Michal Vasko004d3152020-06-11 19:59:22 +02007832 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02007833 return LY_SUCCESS;
7834}
7835
aPiecekdf23eee2021-10-07 12:21:50 +02007836LY_ERR
7837lyxp_vars_find(struct lyxp_var *vars, const char *name, size_t name_len, struct lyxp_var **var)
7838{
7839 LY_ERR ret = LY_ENOTFOUND;
7840 LY_ARRAY_COUNT_TYPE u;
7841
7842 assert(vars && name);
7843
7844 name_len = name_len ? name_len : strlen(name);
7845
7846 LY_ARRAY_FOR(vars, u) {
7847 if (!strncmp(vars[u].name, name, name_len)) {
7848 ret = LY_SUCCESS;
7849 break;
7850 }
7851 }
7852
7853 if (var && !ret) {
7854 *var = &vars[u];
7855 }
7856
7857 return ret;
7858}
7859
Michal Vasko03ff5a72019-09-11 13:49:33 +02007860/**
aPiecekfba75362021-10-07 12:39:48 +02007861 * @brief Evaluate VariableReference.
7862 *
7863 * @param[in] exp Parsed XPath expression.
7864 * @param[in] tok_idx Position in the expression @p exp.
7865 * @param[in] vars [Sized array](@ref sizedarrays) of XPath variables.
7866 * @param[in,out] set Context and result set.
7867 * @param[in] options XPath options.
7868 * @return LY_ERR value.
7869 */
7870static LY_ERR
7871eval_variable_reference(const struct lyxp_expr *exp, uint16_t *tok_idx, struct lyxp_set *set, uint32_t options)
7872{
7873 LY_ERR ret;
7874 const char *name;
7875 struct lyxp_var *var;
7876 const struct lyxp_var *vars;
7877 struct lyxp_expr *tokens = NULL;
7878 uint16_t token_index;
7879
7880 vars = set->vars;
7881
7882 /* Find out the name and value of the variable. */
7883 name = &exp->expr[exp->tok_pos[*tok_idx]];
7884 ret = lyxp_vars_find((struct lyxp_var *)vars, name, exp->tok_len[*tok_idx], &var);
7885 LY_CHECK_ERR_RET(ret, LOGERR(set->ctx, ret,
7886 "XPath variable \"%s\" not defined.", name), ret);
7887
7888 /* Parse value. */
7889 ret = lyxp_expr_parse(set->ctx, var->value, 0, 1, &tokens);
7890 LY_CHECK_GOTO(ret, cleanup);
7891
7892 /* Evaluate value. */
7893 token_index = 0;
7894 ret = eval_expr_select(tokens, &token_index, 0, set, options);
7895 LY_CHECK_GOTO(ret, cleanup);
7896
7897cleanup:
7898 lyxp_expr_free(set->ctx, tokens);
7899
7900 return ret;
7901}
7902
7903/**
Michal Vasko03ff5a72019-09-11 13:49:33 +02007904 * @brief Evaluate PathExpr. Logs directly on error.
7905 *
Michal Vaskod3678892020-05-21 10:06:58 +02007906 * [12] PathExpr ::= LocationPath | PrimaryExpr Predicate*
Michal Vasko03ff5a72019-09-11 13:49:33 +02007907 * | PrimaryExpr Predicate* '/' RelativeLocationPath
7908 * | PrimaryExpr Predicate* '//' RelativeLocationPath
7909 * [2] LocationPath ::= RelativeLocationPath | AbsoluteLocationPath
aPiecekfba75362021-10-07 12:39:48 +02007910 * [10] PrimaryExpr ::= VariableReference | '(' Expr ')' | Literal | Number | FunctionCall
Michal Vasko03ff5a72019-09-11 13:49:33 +02007911 *
7912 * @param[in] exp Parsed XPath expression.
Michal Vasko004d3152020-06-11 19:59:22 +02007913 * @param[in] tok_idx Position in the expression @p exp.
aPiecek8b0cc152021-05-31 16:40:31 +02007914 * @param[in,out] set Context and result set.
Michal Vasko03ff5a72019-09-11 13:49:33 +02007915 * @param[in] options XPath options.
7916 * @return LY_ERR (LY_EINCOMPLETE on unresolved when)
7917 */
7918static LY_ERR
Michal Vasko40308e72020-10-20 16:38:40 +02007919eval_path_expr(const struct lyxp_expr *exp, uint16_t *tok_idx, struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02007920{
Radek Krejci857189e2020-09-01 13:26:36 +02007921 ly_bool all_desc, parent_pos_pred;
Michal Vasko03ff5a72019-09-11 13:49:33 +02007922 LY_ERR rc;
7923
Michal Vasko004d3152020-06-11 19:59:22 +02007924 switch (exp->tokens[*tok_idx]) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02007925 case LYXP_TOKEN_PAR1:
7926 /* '(' Expr ')' */
7927
7928 /* '(' */
aPiecek8b0cc152021-05-31 16:40:31 +02007929 LOGDBG(LY_LDGXPATH, "%-27s %s %s[%u]", __func__, (options & LYXP_SKIP_EXPR ? "skipped" : "parsed"),
Michal Vasko69730152020-10-09 16:30:07 +02007930 lyxp_print_token(exp->tokens[*tok_idx]), exp->tok_pos[*tok_idx]);
Michal Vasko004d3152020-06-11 19:59:22 +02007931 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02007932
7933 /* Expr */
Michal Vasko004d3152020-06-11 19:59:22 +02007934 rc = eval_expr_select(exp, tok_idx, 0, set, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02007935 LY_CHECK_RET(rc);
7936
7937 /* ')' */
Michal Vasko004d3152020-06-11 19:59:22 +02007938 assert(exp->tokens[*tok_idx] == LYXP_TOKEN_PAR2);
aPiecek8b0cc152021-05-31 16:40:31 +02007939 LOGDBG(LY_LDGXPATH, "%-27s %s %s[%u]", __func__, (options & LYXP_SKIP_EXPR ? "skipped" : "parsed"),
Michal Vasko69730152020-10-09 16:30:07 +02007940 lyxp_print_token(exp->tokens[*tok_idx]), exp->tok_pos[*tok_idx]);
Michal Vasko004d3152020-06-11 19:59:22 +02007941 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02007942
7943 parent_pos_pred = 0;
7944 goto predicate;
7945
7946 case LYXP_TOKEN_DOT:
7947 case LYXP_TOKEN_DDOT:
7948 case LYXP_TOKEN_AT:
7949 case LYXP_TOKEN_NAMETEST:
7950 case LYXP_TOKEN_NODETYPE:
7951 /* RelativeLocationPath */
Michal Vasko004d3152020-06-11 19:59:22 +02007952 rc = eval_relative_location_path(exp, tok_idx, 0, set, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02007953 LY_CHECK_RET(rc);
7954 break;
7955
aPiecekfba75362021-10-07 12:39:48 +02007956 case LYXP_TOKEN_VARREF:
7957 /* VariableReference */
7958 rc = eval_variable_reference(exp, tok_idx, set, options);
7959 LY_CHECK_RET(rc);
7960 ++(*tok_idx);
7961
7962 parent_pos_pred = 1;
7963 goto predicate;
7964
Michal Vasko03ff5a72019-09-11 13:49:33 +02007965 case LYXP_TOKEN_FUNCNAME:
7966 /* FunctionCall */
aPiecek8b0cc152021-05-31 16:40:31 +02007967 rc = eval_function_call(exp, tok_idx, set, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02007968 LY_CHECK_RET(rc);
7969
7970 parent_pos_pred = 1;
7971 goto predicate;
7972
Michal Vasko3e48bf32020-06-01 08:39:07 +02007973 case LYXP_TOKEN_OPER_PATH:
7974 case LYXP_TOKEN_OPER_RPATH:
Michal Vasko03ff5a72019-09-11 13:49:33 +02007975 /* AbsoluteLocationPath */
Michal Vasko004d3152020-06-11 19:59:22 +02007976 rc = eval_absolute_location_path(exp, tok_idx, set, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02007977 LY_CHECK_RET(rc);
7978 break;
7979
7980 case LYXP_TOKEN_LITERAL:
7981 /* Literal */
aPiecek8b0cc152021-05-31 16:40:31 +02007982 if ((options & LYXP_SKIP_EXPR) || (options & LYXP_SCNODE_ALL)) {
7983 if (!(options & LYXP_SKIP_EXPR)) {
Michal Vasko1a09b212021-05-06 13:00:10 +02007984 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_VAL);
Michal Vasko03ff5a72019-09-11 13:49:33 +02007985 }
Michal Vasko004d3152020-06-11 19:59:22 +02007986 eval_literal(exp, tok_idx, NULL);
Michal Vasko03ff5a72019-09-11 13:49:33 +02007987 } else {
Michal Vasko004d3152020-06-11 19:59:22 +02007988 eval_literal(exp, tok_idx, set);
Michal Vasko03ff5a72019-09-11 13:49:33 +02007989 }
7990
7991 parent_pos_pred = 1;
7992 goto predicate;
7993
7994 case LYXP_TOKEN_NUMBER:
7995 /* Number */
aPiecek8b0cc152021-05-31 16:40:31 +02007996 if ((options & LYXP_SKIP_EXPR) || (options & LYXP_SCNODE_ALL)) {
7997 if (!(options & LYXP_SKIP_EXPR)) {
Michal Vasko1a09b212021-05-06 13:00:10 +02007998 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_VAL);
Michal Vasko03ff5a72019-09-11 13:49:33 +02007999 }
Michal Vasko004d3152020-06-11 19:59:22 +02008000 rc = eval_number(NULL, exp, tok_idx, NULL);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008001 } else {
Michal Vasko004d3152020-06-11 19:59:22 +02008002 rc = eval_number(set->ctx, exp, tok_idx, set);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008003 }
8004 LY_CHECK_RET(rc);
8005
8006 parent_pos_pred = 1;
8007 goto predicate;
8008
8009 default:
Radek Krejci2efc45b2020-12-22 16:25:44 +01008010 LOGVAL(set->ctx, LY_VCODE_XP_INTOK, lyxp_print_token(exp->tokens[*tok_idx]), &exp->expr[exp->tok_pos[*tok_idx]]);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008011 return LY_EVALID;
8012 }
8013
8014 return LY_SUCCESS;
8015
8016predicate:
8017 /* Predicate* */
Michal Vasko004d3152020-06-11 19:59:22 +02008018 while (!lyxp_check_token(NULL, exp, *tok_idx, LYXP_TOKEN_BRACK1)) {
8019 rc = eval_predicate(exp, tok_idx, set, options, parent_pos_pred);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008020 LY_CHECK_RET(rc);
8021 }
8022
8023 /* ('/' or '//') RelativeLocationPath */
Michal Vasko004d3152020-06-11 19:59:22 +02008024 if (!exp_check_token2(NULL, exp, *tok_idx, LYXP_TOKEN_OPER_PATH, LYXP_TOKEN_OPER_RPATH)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02008025
8026 /* evaluate '/' or '//' */
Michal Vasko004d3152020-06-11 19:59:22 +02008027 if (exp->tokens[*tok_idx] == LYXP_TOKEN_OPER_PATH) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02008028 all_desc = 0;
8029 } else {
Michal Vasko03ff5a72019-09-11 13:49:33 +02008030 all_desc = 1;
8031 }
8032
aPiecek8b0cc152021-05-31 16:40:31 +02008033 LOGDBG(LY_LDGXPATH, "%-27s %s %s[%u]", __func__, (options & LYXP_SKIP_EXPR ? "skipped" : "parsed"),
Michal Vasko69730152020-10-09 16:30:07 +02008034 lyxp_print_token(exp->tokens[*tok_idx]), exp->tok_pos[*tok_idx]);
Michal Vasko004d3152020-06-11 19:59:22 +02008035 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008036
Michal Vasko004d3152020-06-11 19:59:22 +02008037 rc = eval_relative_location_path(exp, tok_idx, all_desc, set, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008038 LY_CHECK_RET(rc);
8039 }
8040
8041 return LY_SUCCESS;
8042}
8043
8044/**
8045 * @brief Evaluate UnionExpr. Logs directly on error.
8046 *
Michal Vaskod3678892020-05-21 10:06:58 +02008047 * [20] UnionExpr ::= PathExpr | UnionExpr '|' PathExpr
Michal Vasko03ff5a72019-09-11 13:49:33 +02008048 *
8049 * @param[in] exp Parsed XPath expression.
Michal Vasko004d3152020-06-11 19:59:22 +02008050 * @param[in] tok_idx Position in the expression @p exp.
Michal Vasko03ff5a72019-09-11 13:49:33 +02008051 * @param[in] repeat How many times this expression is repeated.
aPiecek8b0cc152021-05-31 16:40:31 +02008052 * @param[in,out] set Context and result set.
Michal Vasko03ff5a72019-09-11 13:49:33 +02008053 * @param[in] options XPath options.
8054 * @return LY_ERR (LY_EINCOMPLETE on unresolved when)
8055 */
8056static LY_ERR
Michal Vasko40308e72020-10-20 16:38:40 +02008057eval_union_expr(const struct lyxp_expr *exp, uint16_t *tok_idx, uint16_t repeat, struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02008058{
8059 LY_ERR rc = LY_SUCCESS;
8060 struct lyxp_set orig_set, set2;
8061 uint16_t i;
8062
8063 assert(repeat);
8064
8065 set_init(&orig_set, set);
8066 set_init(&set2, set);
8067
8068 set_fill_set(&orig_set, set);
8069
Michal Vasko004d3152020-06-11 19:59:22 +02008070 rc = eval_expr_select(exp, tok_idx, LYXP_EXPR_UNION, set, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008071 LY_CHECK_GOTO(rc, cleanup);
8072
8073 /* ('|' PathExpr)* */
8074 for (i = 0; i < repeat; ++i) {
Michal Vasko004d3152020-06-11 19:59:22 +02008075 assert(exp->tokens[*tok_idx] == LYXP_TOKEN_OPER_UNI);
aPiecek8b0cc152021-05-31 16:40:31 +02008076 LOGDBG(LY_LDGXPATH, "%-27s %s %s[%u]", __func__, (options & LYXP_SKIP_EXPR ? "skipped" : "parsed"),
Michal Vasko69730152020-10-09 16:30:07 +02008077 lyxp_print_token(exp->tokens[*tok_idx]), exp->tok_pos[*tok_idx]);
Michal Vasko004d3152020-06-11 19:59:22 +02008078 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008079
aPiecek8b0cc152021-05-31 16:40:31 +02008080 if (options & LYXP_SKIP_EXPR) {
8081 rc = eval_expr_select(exp, tok_idx, LYXP_EXPR_UNION, set, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008082 LY_CHECK_GOTO(rc, cleanup);
8083 continue;
8084 }
8085
8086 set_fill_set(&set2, &orig_set);
Michal Vasko004d3152020-06-11 19:59:22 +02008087 rc = eval_expr_select(exp, tok_idx, LYXP_EXPR_UNION, &set2, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008088 LY_CHECK_GOTO(rc, cleanup);
8089
8090 /* eval */
8091 if (options & LYXP_SCNODE_ALL) {
Michal Vaskoecd62de2019-11-13 12:35:11 +01008092 lyxp_set_scnode_merge(set, &set2);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008093 } else {
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01008094 rc = moveto_union(set, &set2);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008095 LY_CHECK_GOTO(rc, cleanup);
8096 }
8097 }
8098
8099cleanup:
Michal Vaskod3678892020-05-21 10:06:58 +02008100 lyxp_set_free_content(&orig_set);
8101 lyxp_set_free_content(&set2);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008102 return rc;
8103}
8104
8105/**
8106 * @brief Evaluate UnaryExpr. Logs directly on error.
8107 *
Michal Vaskod3678892020-05-21 10:06:58 +02008108 * [19] UnaryExpr ::= UnionExpr | '-' UnaryExpr
Michal Vasko03ff5a72019-09-11 13:49:33 +02008109 *
8110 * @param[in] exp Parsed XPath expression.
Michal Vasko004d3152020-06-11 19:59:22 +02008111 * @param[in] tok_idx Position in the expression @p exp.
Michal Vasko03ff5a72019-09-11 13:49:33 +02008112 * @param[in] repeat How many times this expression is repeated.
aPiecek8b0cc152021-05-31 16:40:31 +02008113 * @param[in,out] set Context and result set.
Michal Vasko03ff5a72019-09-11 13:49:33 +02008114 * @param[in] options XPath options.
8115 * @return LY_ERR (LY_EINCOMPLETE on unresolved when)
8116 */
8117static LY_ERR
Michal Vasko40308e72020-10-20 16:38:40 +02008118eval_unary_expr(const struct lyxp_expr *exp, uint16_t *tok_idx, uint16_t repeat, struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02008119{
8120 LY_ERR rc;
8121 uint16_t this_op, i;
8122
8123 assert(repeat);
8124
8125 /* ('-')+ */
Michal Vasko004d3152020-06-11 19:59:22 +02008126 this_op = *tok_idx;
Michal Vasko03ff5a72019-09-11 13:49:33 +02008127 for (i = 0; i < repeat; ++i) {
Michal Vasko004d3152020-06-11 19:59:22 +02008128 assert(!lyxp_check_token(NULL, exp, *tok_idx, LYXP_TOKEN_OPER_MATH) && (exp->expr[exp->tok_pos[*tok_idx]] == '-'));
Michal Vasko03ff5a72019-09-11 13:49:33 +02008129
aPiecek8b0cc152021-05-31 16:40:31 +02008130 LOGDBG(LY_LDGXPATH, "%-27s %s %s[%u]", __func__, (options & LYXP_SKIP_EXPR ? "skipped" : "parsed"),
Michal Vasko69730152020-10-09 16:30:07 +02008131 lyxp_print_token(exp->tokens[*tok_idx]), exp->tok_pos[*tok_idx]);
Michal Vasko004d3152020-06-11 19:59:22 +02008132 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008133 }
8134
Michal Vasko004d3152020-06-11 19:59:22 +02008135 rc = eval_expr_select(exp, tok_idx, LYXP_EXPR_UNARY, set, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008136 LY_CHECK_RET(rc);
8137
aPiecek8b0cc152021-05-31 16:40:31 +02008138 if (!(options & LYXP_SKIP_EXPR) && (repeat % 2)) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02008139 if (options & LYXP_SCNODE_ALL) {
8140 warn_operands(set->ctx, set, NULL, 1, exp->expr, exp->tok_pos[this_op]);
8141 } else {
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01008142 rc = moveto_op_math(set, NULL, &exp->expr[exp->tok_pos[this_op]]);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008143 LY_CHECK_RET(rc);
8144 }
8145 }
8146
8147 return LY_SUCCESS;
8148}
8149
8150/**
8151 * @brief Evaluate MultiplicativeExpr. Logs directly on error.
8152 *
Michal Vaskod3678892020-05-21 10:06:58 +02008153 * [18] MultiplicativeExpr ::= UnaryExpr
Michal Vasko03ff5a72019-09-11 13:49:33 +02008154 * | MultiplicativeExpr '*' UnaryExpr
8155 * | MultiplicativeExpr 'div' UnaryExpr
8156 * | MultiplicativeExpr 'mod' UnaryExpr
8157 *
8158 * @param[in] exp Parsed XPath expression.
Michal Vasko004d3152020-06-11 19:59:22 +02008159 * @param[in] tok_idx Position in the expression @p exp.
Michal Vasko03ff5a72019-09-11 13:49:33 +02008160 * @param[in] repeat How many times this expression is repeated.
aPiecek8b0cc152021-05-31 16:40:31 +02008161 * @param[in,out] set Context and result set.
Michal Vasko03ff5a72019-09-11 13:49:33 +02008162 * @param[in] options XPath options.
8163 * @return LY_ERR (LY_EINCOMPLETE on unresolved when)
8164 */
8165static LY_ERR
Michal Vasko40308e72020-10-20 16:38:40 +02008166eval_multiplicative_expr(const struct lyxp_expr *exp, uint16_t *tok_idx, uint16_t repeat, struct lyxp_set *set,
8167 uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02008168{
8169 LY_ERR rc;
8170 uint16_t this_op;
8171 struct lyxp_set orig_set, set2;
8172 uint16_t i;
8173
8174 assert(repeat);
8175
8176 set_init(&orig_set, set);
8177 set_init(&set2, set);
8178
8179 set_fill_set(&orig_set, set);
8180
Michal Vasko004d3152020-06-11 19:59:22 +02008181 rc = eval_expr_select(exp, tok_idx, LYXP_EXPR_MULTIPLICATIVE, set, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008182 LY_CHECK_GOTO(rc, cleanup);
8183
8184 /* ('*' / 'div' / 'mod' UnaryExpr)* */
8185 for (i = 0; i < repeat; ++i) {
Michal Vasko004d3152020-06-11 19:59:22 +02008186 this_op = *tok_idx;
Michal Vasko03ff5a72019-09-11 13:49:33 +02008187
Michal Vasko004d3152020-06-11 19:59:22 +02008188 assert(exp->tokens[*tok_idx] == LYXP_TOKEN_OPER_MATH);
aPiecek8b0cc152021-05-31 16:40:31 +02008189 LOGDBG(LY_LDGXPATH, "%-27s %s %s[%u]", __func__, (options & LYXP_SKIP_EXPR ? "skipped" : "parsed"),
Michal Vasko69730152020-10-09 16:30:07 +02008190 lyxp_print_token(exp->tokens[*tok_idx]), exp->tok_pos[*tok_idx]);
Michal Vasko004d3152020-06-11 19:59:22 +02008191 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008192
aPiecek8b0cc152021-05-31 16:40:31 +02008193 if (options & LYXP_SKIP_EXPR) {
8194 rc = eval_expr_select(exp, tok_idx, LYXP_EXPR_MULTIPLICATIVE, set, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008195 LY_CHECK_GOTO(rc, cleanup);
8196 continue;
8197 }
8198
8199 set_fill_set(&set2, &orig_set);
Michal Vasko004d3152020-06-11 19:59:22 +02008200 rc = eval_expr_select(exp, tok_idx, LYXP_EXPR_MULTIPLICATIVE, &set2, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008201 LY_CHECK_GOTO(rc, cleanup);
8202
8203 /* eval */
8204 if (options & LYXP_SCNODE_ALL) {
8205 warn_operands(set->ctx, set, &set2, 1, exp->expr, exp->tok_pos[this_op - 1]);
Michal Vaskoecd62de2019-11-13 12:35:11 +01008206 lyxp_set_scnode_merge(set, &set2);
Michal Vasko1a09b212021-05-06 13:00:10 +02008207 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_VAL);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008208 } else {
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01008209 rc = moveto_op_math(set, &set2, &exp->expr[exp->tok_pos[this_op]]);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008210 LY_CHECK_GOTO(rc, cleanup);
8211 }
8212 }
8213
8214cleanup:
Michal Vaskod3678892020-05-21 10:06:58 +02008215 lyxp_set_free_content(&orig_set);
8216 lyxp_set_free_content(&set2);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008217 return rc;
8218}
8219
8220/**
8221 * @brief Evaluate AdditiveExpr. Logs directly on error.
8222 *
Michal Vaskod3678892020-05-21 10:06:58 +02008223 * [17] AdditiveExpr ::= MultiplicativeExpr
Michal Vasko03ff5a72019-09-11 13:49:33 +02008224 * | AdditiveExpr '+' MultiplicativeExpr
8225 * | AdditiveExpr '-' MultiplicativeExpr
8226 *
8227 * @param[in] exp Parsed XPath expression.
Michal Vasko004d3152020-06-11 19:59:22 +02008228 * @param[in] tok_idx Position in the expression @p exp.
Michal Vasko03ff5a72019-09-11 13:49:33 +02008229 * @param[in] repeat How many times this expression is repeated.
aPiecek8b0cc152021-05-31 16:40:31 +02008230 * @param[in,out] set Context and result set.
Michal Vasko03ff5a72019-09-11 13:49:33 +02008231 * @param[in] options XPath options.
8232 * @return LY_ERR (LY_EINCOMPLETE on unresolved when)
8233 */
8234static LY_ERR
Michal Vasko40308e72020-10-20 16:38:40 +02008235eval_additive_expr(const struct lyxp_expr *exp, uint16_t *tok_idx, uint16_t repeat, struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02008236{
8237 LY_ERR rc;
8238 uint16_t this_op;
8239 struct lyxp_set orig_set, set2;
8240 uint16_t i;
8241
8242 assert(repeat);
8243
8244 set_init(&orig_set, set);
8245 set_init(&set2, set);
8246
8247 set_fill_set(&orig_set, set);
8248
Michal Vasko004d3152020-06-11 19:59:22 +02008249 rc = eval_expr_select(exp, tok_idx, LYXP_EXPR_ADDITIVE, set, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008250 LY_CHECK_GOTO(rc, cleanup);
8251
8252 /* ('+' / '-' MultiplicativeExpr)* */
8253 for (i = 0; i < repeat; ++i) {
Michal Vasko004d3152020-06-11 19:59:22 +02008254 this_op = *tok_idx;
Michal Vasko03ff5a72019-09-11 13:49:33 +02008255
Michal Vasko004d3152020-06-11 19:59:22 +02008256 assert(exp->tokens[*tok_idx] == LYXP_TOKEN_OPER_MATH);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008257 LOGDBG(LY_LDGXPATH, "%-27s %s %s[%u]", __func__, (set ? "parsed" : "skipped"),
Michal Vasko69730152020-10-09 16:30:07 +02008258 lyxp_print_token(exp->tokens[*tok_idx]), exp->tok_pos[*tok_idx]);
Michal Vasko004d3152020-06-11 19:59:22 +02008259 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008260
aPiecek8b0cc152021-05-31 16:40:31 +02008261 if (options & LYXP_SKIP_EXPR) {
8262 rc = eval_expr_select(exp, tok_idx, LYXP_EXPR_ADDITIVE, set, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008263 LY_CHECK_GOTO(rc, cleanup);
8264 continue;
8265 }
8266
8267 set_fill_set(&set2, &orig_set);
Michal Vasko004d3152020-06-11 19:59:22 +02008268 rc = eval_expr_select(exp, tok_idx, LYXP_EXPR_ADDITIVE, &set2, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008269 LY_CHECK_GOTO(rc, cleanup);
8270
8271 /* eval */
8272 if (options & LYXP_SCNODE_ALL) {
8273 warn_operands(set->ctx, set, &set2, 1, exp->expr, exp->tok_pos[this_op - 1]);
Michal Vaskoecd62de2019-11-13 12:35:11 +01008274 lyxp_set_scnode_merge(set, &set2);
Michal Vasko1a09b212021-05-06 13:00:10 +02008275 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_VAL);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008276 } else {
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01008277 rc = moveto_op_math(set, &set2, &exp->expr[exp->tok_pos[this_op]]);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008278 LY_CHECK_GOTO(rc, cleanup);
8279 }
8280 }
8281
8282cleanup:
Michal Vaskod3678892020-05-21 10:06:58 +02008283 lyxp_set_free_content(&orig_set);
8284 lyxp_set_free_content(&set2);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008285 return rc;
8286}
8287
8288/**
8289 * @brief Evaluate RelationalExpr. Logs directly on error.
8290 *
Michal Vaskod3678892020-05-21 10:06:58 +02008291 * [16] RelationalExpr ::= AdditiveExpr
Michal Vasko03ff5a72019-09-11 13:49:33 +02008292 * | RelationalExpr '<' AdditiveExpr
8293 * | RelationalExpr '>' AdditiveExpr
8294 * | RelationalExpr '<=' AdditiveExpr
8295 * | RelationalExpr '>=' AdditiveExpr
8296 *
8297 * @param[in] exp Parsed XPath expression.
Michal Vasko004d3152020-06-11 19:59:22 +02008298 * @param[in] tok_idx Position in the expression @p exp.
Michal Vasko03ff5a72019-09-11 13:49:33 +02008299 * @param[in] repeat How many times this expression is repeated.
aPiecek8b0cc152021-05-31 16:40:31 +02008300 * @param[in,out] set Context and result set.
Michal Vasko03ff5a72019-09-11 13:49:33 +02008301 * @param[in] options XPath options.
8302 * @return LY_ERR (LY_EINCOMPLETE on unresolved when)
8303 */
8304static LY_ERR
Michal Vasko40308e72020-10-20 16:38:40 +02008305eval_relational_expr(const struct lyxp_expr *exp, uint16_t *tok_idx, uint16_t repeat, struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02008306{
8307 LY_ERR rc;
8308 uint16_t this_op;
8309 struct lyxp_set orig_set, set2;
8310 uint16_t i;
8311
8312 assert(repeat);
8313
8314 set_init(&orig_set, set);
8315 set_init(&set2, set);
8316
8317 set_fill_set(&orig_set, set);
8318
Michal Vasko004d3152020-06-11 19:59:22 +02008319 rc = eval_expr_select(exp, tok_idx, LYXP_EXPR_RELATIONAL, set, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008320 LY_CHECK_GOTO(rc, cleanup);
8321
8322 /* ('<' / '>' / '<=' / '>=' AdditiveExpr)* */
8323 for (i = 0; i < repeat; ++i) {
Michal Vasko004d3152020-06-11 19:59:22 +02008324 this_op = *tok_idx;
Michal Vasko03ff5a72019-09-11 13:49:33 +02008325
Michal Vasko004d3152020-06-11 19:59:22 +02008326 assert(exp->tokens[*tok_idx] == LYXP_TOKEN_OPER_COMP);
aPiecek8b0cc152021-05-31 16:40:31 +02008327 LOGDBG(LY_LDGXPATH, "%-27s %s %s[%u]", __func__, (options & LYXP_SKIP_EXPR ? "skipped" : "parsed"),
Michal Vasko69730152020-10-09 16:30:07 +02008328 lyxp_print_token(exp->tokens[*tok_idx]), exp->tok_pos[*tok_idx]);
Michal Vasko004d3152020-06-11 19:59:22 +02008329 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008330
aPiecek8b0cc152021-05-31 16:40:31 +02008331 if (options & LYXP_SKIP_EXPR) {
8332 rc = eval_expr_select(exp, tok_idx, LYXP_EXPR_RELATIONAL, set, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008333 LY_CHECK_GOTO(rc, cleanup);
8334 continue;
8335 }
8336
8337 set_fill_set(&set2, &orig_set);
Michal Vasko004d3152020-06-11 19:59:22 +02008338 rc = eval_expr_select(exp, tok_idx, LYXP_EXPR_RELATIONAL, &set2, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008339 LY_CHECK_GOTO(rc, cleanup);
8340
8341 /* eval */
8342 if (options & LYXP_SCNODE_ALL) {
8343 warn_operands(set->ctx, set, &set2, 1, exp->expr, exp->tok_pos[this_op - 1]);
Michal Vaskoecd62de2019-11-13 12:35:11 +01008344 lyxp_set_scnode_merge(set, &set2);
Michal Vasko1a09b212021-05-06 13:00:10 +02008345 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_VAL);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008346 } else {
8347 rc = moveto_op_comp(set, &set2, &exp->expr[exp->tok_pos[this_op]], options);
8348 LY_CHECK_GOTO(rc, cleanup);
8349 }
8350 }
8351
8352cleanup:
Michal Vaskod3678892020-05-21 10:06:58 +02008353 lyxp_set_free_content(&orig_set);
8354 lyxp_set_free_content(&set2);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008355 return rc;
8356}
8357
8358/**
8359 * @brief Evaluate EqualityExpr. Logs directly on error.
8360 *
Michal Vaskod3678892020-05-21 10:06:58 +02008361 * [15] EqualityExpr ::= RelationalExpr | EqualityExpr '=' RelationalExpr
Michal Vasko03ff5a72019-09-11 13:49:33 +02008362 * | EqualityExpr '!=' RelationalExpr
8363 *
8364 * @param[in] exp Parsed XPath expression.
Michal Vasko004d3152020-06-11 19:59:22 +02008365 * @param[in] tok_idx Position in the expression @p exp.
Michal Vasko03ff5a72019-09-11 13:49:33 +02008366 * @param[in] repeat How many times this expression is repeated.
aPiecek8b0cc152021-05-31 16:40:31 +02008367 * @param[in,out] set Context and result set.
Michal Vasko03ff5a72019-09-11 13:49:33 +02008368 * @param[in] options XPath options.
8369 * @return LY_ERR (LY_EINCOMPLETE on unresolved when)
8370 */
8371static LY_ERR
Michal Vasko40308e72020-10-20 16:38:40 +02008372eval_equality_expr(const struct lyxp_expr *exp, uint16_t *tok_idx, uint16_t repeat, struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02008373{
8374 LY_ERR rc;
8375 uint16_t this_op;
8376 struct lyxp_set orig_set, set2;
8377 uint16_t i;
8378
8379 assert(repeat);
8380
8381 set_init(&orig_set, set);
8382 set_init(&set2, set);
8383
8384 set_fill_set(&orig_set, set);
8385
Michal Vasko004d3152020-06-11 19:59:22 +02008386 rc = eval_expr_select(exp, tok_idx, LYXP_EXPR_EQUALITY, set, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008387 LY_CHECK_GOTO(rc, cleanup);
8388
8389 /* ('=' / '!=' RelationalExpr)* */
8390 for (i = 0; i < repeat; ++i) {
Michal Vasko004d3152020-06-11 19:59:22 +02008391 this_op = *tok_idx;
Michal Vasko03ff5a72019-09-11 13:49:33 +02008392
Michal Vasko004d3152020-06-11 19:59:22 +02008393 assert((exp->tokens[*tok_idx] == LYXP_TOKEN_OPER_EQUAL) || (exp->tokens[*tok_idx] == LYXP_TOKEN_OPER_NEQUAL));
aPiecek8b0cc152021-05-31 16:40:31 +02008394 LOGDBG(LY_LDGXPATH, "%-27s %s %s[%u]", __func__, (options & LYXP_SKIP_EXPR ? "skipped" : "parsed"),
Michal Vasko69730152020-10-09 16:30:07 +02008395 lyxp_print_token(exp->tokens[*tok_idx]), exp->tok_pos[*tok_idx]);
Michal Vasko004d3152020-06-11 19:59:22 +02008396 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008397
aPiecek8b0cc152021-05-31 16:40:31 +02008398 if (options & LYXP_SKIP_EXPR) {
8399 rc = eval_expr_select(exp, tok_idx, LYXP_EXPR_EQUALITY, set, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008400 LY_CHECK_GOTO(rc, cleanup);
8401 continue;
8402 }
8403
8404 set_fill_set(&set2, &orig_set);
Michal Vasko004d3152020-06-11 19:59:22 +02008405 rc = eval_expr_select(exp, tok_idx, LYXP_EXPR_EQUALITY, &set2, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008406 LY_CHECK_GOTO(rc, cleanup);
8407
8408 /* eval */
8409 if (options & LYXP_SCNODE_ALL) {
8410 warn_operands(set->ctx, set, &set2, 0, exp->expr, exp->tok_pos[this_op - 1]);
Michal Vasko004d3152020-06-11 19:59:22 +02008411 warn_equality_value(exp, set, *tok_idx - 1, this_op - 1, *tok_idx - 1);
8412 warn_equality_value(exp, &set2, this_op - 1, this_op - 1, *tok_idx - 1);
Michal Vaskoecd62de2019-11-13 12:35:11 +01008413 lyxp_set_scnode_merge(set, &set2);
Michal Vasko1a09b212021-05-06 13:00:10 +02008414 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_VAL);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008415 } else {
Michal Vasko03ff5a72019-09-11 13:49:33 +02008416 rc = moveto_op_comp(set, &set2, &exp->expr[exp->tok_pos[this_op]], options);
8417 LY_CHECK_GOTO(rc, cleanup);
8418 }
8419 }
8420
8421cleanup:
Michal Vaskod3678892020-05-21 10:06:58 +02008422 lyxp_set_free_content(&orig_set);
8423 lyxp_set_free_content(&set2);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008424 return rc;
8425}
8426
8427/**
8428 * @brief Evaluate AndExpr. Logs directly on error.
8429 *
Michal Vaskod3678892020-05-21 10:06:58 +02008430 * [14] AndExpr ::= EqualityExpr | AndExpr 'and' EqualityExpr
Michal Vasko03ff5a72019-09-11 13:49:33 +02008431 *
8432 * @param[in] exp Parsed XPath expression.
Michal Vasko004d3152020-06-11 19:59:22 +02008433 * @param[in] tok_idx Position in the expression @p exp.
Michal Vasko03ff5a72019-09-11 13:49:33 +02008434 * @param[in] repeat How many times this expression is repeated.
aPiecek8b0cc152021-05-31 16:40:31 +02008435 * @param[in,out] set Context and result set.
Michal Vasko03ff5a72019-09-11 13:49:33 +02008436 * @param[in] options XPath options.
8437 * @return LY_ERR (LY_EINCOMPLETE on unresolved when)
8438 */
8439static LY_ERR
Michal Vasko40308e72020-10-20 16:38:40 +02008440eval_and_expr(const struct lyxp_expr *exp, uint16_t *tok_idx, uint16_t repeat, struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02008441{
8442 LY_ERR rc;
8443 struct lyxp_set orig_set, set2;
8444 uint16_t i;
8445
8446 assert(repeat);
8447
8448 set_init(&orig_set, set);
8449 set_init(&set2, set);
8450
8451 set_fill_set(&orig_set, set);
8452
Michal Vasko004d3152020-06-11 19:59:22 +02008453 rc = eval_expr_select(exp, tok_idx, LYXP_EXPR_AND, set, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008454 LY_CHECK_GOTO(rc, cleanup);
8455
8456 /* cast to boolean, we know that will be the final result */
aPiecek8b0cc152021-05-31 16:40:31 +02008457 if (!(options & LYXP_SKIP_EXPR) && (options & LYXP_SCNODE_ALL)) {
Michal Vasko1a09b212021-05-06 13:00:10 +02008458 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_NODE);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008459 } else {
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01008460 lyxp_set_cast(set, LYXP_SET_BOOLEAN);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008461 }
8462
8463 /* ('and' EqualityExpr)* */
8464 for (i = 0; i < repeat; ++i) {
Michal Vasko004d3152020-06-11 19:59:22 +02008465 assert(exp->tokens[*tok_idx] == LYXP_TOKEN_OPER_LOG);
aPiecek8b0cc152021-05-31 16:40:31 +02008466 LOGDBG(LY_LDGXPATH, "%-27s %s %s[%u]", __func__, ((options & LYXP_SKIP_EXPR) || !set->val.bln ? "skipped" : "parsed"),
Michal Vasko69730152020-10-09 16:30:07 +02008467 lyxp_print_token(exp->tokens[*tok_idx]), exp->tok_pos[*tok_idx]);
Michal Vasko004d3152020-06-11 19:59:22 +02008468 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008469
8470 /* lazy evaluation */
aPiecek8b0cc152021-05-31 16:40:31 +02008471 if ((options & LYXP_SKIP_EXPR) || ((set->type == LYXP_SET_BOOLEAN) && !set->val.bln)) {
8472 rc = eval_expr_select(exp, tok_idx, LYXP_EXPR_AND, set, options | LYXP_SKIP_EXPR);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008473 LY_CHECK_GOTO(rc, cleanup);
8474 continue;
8475 }
8476
8477 set_fill_set(&set2, &orig_set);
Michal Vasko004d3152020-06-11 19:59:22 +02008478 rc = eval_expr_select(exp, tok_idx, LYXP_EXPR_AND, &set2, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008479 LY_CHECK_GOTO(rc, cleanup);
8480
8481 /* eval - just get boolean value actually */
8482 if (set->type == LYXP_SET_SCNODE_SET) {
Michal Vasko1a09b212021-05-06 13:00:10 +02008483 set_scnode_clear_ctx(&set2, LYXP_SET_SCNODE_ATOM_NODE);
Michal Vaskoecd62de2019-11-13 12:35:11 +01008484 lyxp_set_scnode_merge(set, &set2);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008485 } else {
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01008486 lyxp_set_cast(&set2, LYXP_SET_BOOLEAN);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008487 set_fill_set(set, &set2);
8488 }
8489 }
8490
8491cleanup:
Michal Vaskod3678892020-05-21 10:06:58 +02008492 lyxp_set_free_content(&orig_set);
8493 lyxp_set_free_content(&set2);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008494 return rc;
8495}
8496
8497/**
8498 * @brief Evaluate OrExpr. Logs directly on error.
8499 *
Michal Vaskod3678892020-05-21 10:06:58 +02008500 * [13] OrExpr ::= AndExpr | OrExpr 'or' AndExpr
Michal Vasko03ff5a72019-09-11 13:49:33 +02008501 *
8502 * @param[in] exp Parsed XPath expression.
Michal Vasko004d3152020-06-11 19:59:22 +02008503 * @param[in] tok_idx Position in the expression @p exp.
Michal Vasko03ff5a72019-09-11 13:49:33 +02008504 * @param[in] repeat How many times this expression is repeated.
aPiecek8b0cc152021-05-31 16:40:31 +02008505 * @param[in,out] set Context and result set.
Michal Vasko03ff5a72019-09-11 13:49:33 +02008506 * @param[in] options XPath options.
8507 * @return LY_ERR (LY_EINCOMPLETE on unresolved when)
8508 */
8509static LY_ERR
Michal Vasko40308e72020-10-20 16:38:40 +02008510eval_or_expr(const struct lyxp_expr *exp, uint16_t *tok_idx, uint16_t repeat, struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02008511{
8512 LY_ERR rc;
8513 struct lyxp_set orig_set, set2;
8514 uint16_t i;
8515
8516 assert(repeat);
8517
8518 set_init(&orig_set, set);
8519 set_init(&set2, set);
8520
8521 set_fill_set(&orig_set, set);
8522
Michal Vasko004d3152020-06-11 19:59:22 +02008523 rc = eval_expr_select(exp, tok_idx, LYXP_EXPR_OR, set, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008524 LY_CHECK_GOTO(rc, cleanup);
8525
8526 /* cast to boolean, we know that will be the final result */
aPiecek8b0cc152021-05-31 16:40:31 +02008527 if (!(options & LYXP_SKIP_EXPR) && (options & LYXP_SCNODE_ALL)) {
Michal Vasko1a09b212021-05-06 13:00:10 +02008528 set_scnode_clear_ctx(set, LYXP_SET_SCNODE_ATOM_NODE);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008529 } else {
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01008530 lyxp_set_cast(set, LYXP_SET_BOOLEAN);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008531 }
8532
8533 /* ('or' AndExpr)* */
8534 for (i = 0; i < repeat; ++i) {
Michal Vasko004d3152020-06-11 19:59:22 +02008535 assert(exp->tokens[*tok_idx] == LYXP_TOKEN_OPER_LOG);
aPiecek8b0cc152021-05-31 16:40:31 +02008536 LOGDBG(LY_LDGXPATH, "%-27s %s %s[%u]", __func__, ((options & LYXP_SKIP_EXPR) || set->val.bln ? "skipped" : "parsed"),
Michal Vasko69730152020-10-09 16:30:07 +02008537 lyxp_print_token(exp->tokens[*tok_idx]), exp->tok_pos[*tok_idx]);
Michal Vasko004d3152020-06-11 19:59:22 +02008538 ++(*tok_idx);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008539
8540 /* lazy evaluation */
aPiecek8b0cc152021-05-31 16:40:31 +02008541 if ((options & LYXP_SKIP_EXPR) || ((set->type == LYXP_SET_BOOLEAN) && set->val.bln)) {
8542 rc = eval_expr_select(exp, tok_idx, LYXP_EXPR_OR, set, options | LYXP_SKIP_EXPR);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008543 LY_CHECK_GOTO(rc, cleanup);
8544 continue;
8545 }
8546
8547 set_fill_set(&set2, &orig_set);
8548 /* expr_type cound have been LYXP_EXPR_NONE in all these later calls (except for the first one),
8549 * but it does not matter */
Michal Vasko004d3152020-06-11 19:59:22 +02008550 rc = eval_expr_select(exp, tok_idx, LYXP_EXPR_OR, &set2, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008551 LY_CHECK_GOTO(rc, cleanup);
8552
8553 /* eval - just get boolean value actually */
8554 if (set->type == LYXP_SET_SCNODE_SET) {
Michal Vasko1a09b212021-05-06 13:00:10 +02008555 set_scnode_clear_ctx(&set2, LYXP_SET_SCNODE_ATOM_NODE);
Michal Vaskoecd62de2019-11-13 12:35:11 +01008556 lyxp_set_scnode_merge(set, &set2);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008557 } else {
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01008558 lyxp_set_cast(&set2, LYXP_SET_BOOLEAN);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008559 set_fill_set(set, &set2);
8560 }
8561 }
8562
8563cleanup:
Michal Vaskod3678892020-05-21 10:06:58 +02008564 lyxp_set_free_content(&orig_set);
8565 lyxp_set_free_content(&set2);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008566 return rc;
8567}
8568
8569/**
Michal Vasko004d3152020-06-11 19:59:22 +02008570 * @brief Decide what expression is at the pointer @p tok_idx and evaluate it accordingly.
Michal Vasko03ff5a72019-09-11 13:49:33 +02008571 *
8572 * @param[in] exp Parsed XPath expression.
Michal Vasko004d3152020-06-11 19:59:22 +02008573 * @param[in] tok_idx Position in the expression @p exp.
Michal Vasko03ff5a72019-09-11 13:49:33 +02008574 * @param[in] etype Expression type to evaluate.
aPiecek8b0cc152021-05-31 16:40:31 +02008575 * @param[in,out] set Context and result set.
Michal Vasko03ff5a72019-09-11 13:49:33 +02008576 * @param[in] options XPath options.
8577 * @return LY_ERR (LY_EINCOMPLETE on unresolved when)
8578 */
8579static LY_ERR
Michal Vasko40308e72020-10-20 16:38:40 +02008580eval_expr_select(const struct lyxp_expr *exp, uint16_t *tok_idx, enum lyxp_expr_type etype, struct lyxp_set *set,
8581 uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02008582{
8583 uint16_t i, count;
8584 enum lyxp_expr_type next_etype;
8585 LY_ERR rc;
8586
8587 /* process operator repeats */
Michal Vasko004d3152020-06-11 19:59:22 +02008588 if (!exp->repeat[*tok_idx]) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02008589 next_etype = LYXP_EXPR_NONE;
8590 } else {
8591 /* find etype repeat */
Radek Krejci1e008d22020-08-17 11:37:37 +02008592 for (i = 0; exp->repeat[*tok_idx][i] > etype; ++i) {}
Michal Vasko03ff5a72019-09-11 13:49:33 +02008593
8594 /* select one-priority lower because etype expression called us */
8595 if (i) {
Michal Vasko004d3152020-06-11 19:59:22 +02008596 next_etype = exp->repeat[*tok_idx][i - 1];
Michal Vasko03ff5a72019-09-11 13:49:33 +02008597 /* count repeats for that expression */
Radek Krejci1e008d22020-08-17 11:37:37 +02008598 for (count = 0; i && exp->repeat[*tok_idx][i - 1] == next_etype; ++count, --i) {}
Michal Vasko03ff5a72019-09-11 13:49:33 +02008599 } else {
8600 next_etype = LYXP_EXPR_NONE;
8601 }
8602 }
8603
8604 /* decide what expression are we parsing based on the repeat */
8605 switch (next_etype) {
8606 case LYXP_EXPR_OR:
Michal Vasko004d3152020-06-11 19:59:22 +02008607 rc = eval_or_expr(exp, tok_idx, count, set, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008608 break;
8609 case LYXP_EXPR_AND:
Michal Vasko004d3152020-06-11 19:59:22 +02008610 rc = eval_and_expr(exp, tok_idx, count, set, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008611 break;
8612 case LYXP_EXPR_EQUALITY:
Michal Vasko004d3152020-06-11 19:59:22 +02008613 rc = eval_equality_expr(exp, tok_idx, count, set, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008614 break;
8615 case LYXP_EXPR_RELATIONAL:
Michal Vasko004d3152020-06-11 19:59:22 +02008616 rc = eval_relational_expr(exp, tok_idx, count, set, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008617 break;
8618 case LYXP_EXPR_ADDITIVE:
Michal Vasko004d3152020-06-11 19:59:22 +02008619 rc = eval_additive_expr(exp, tok_idx, count, set, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008620 break;
8621 case LYXP_EXPR_MULTIPLICATIVE:
Michal Vasko004d3152020-06-11 19:59:22 +02008622 rc = eval_multiplicative_expr(exp, tok_idx, count, set, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008623 break;
8624 case LYXP_EXPR_UNARY:
Michal Vasko004d3152020-06-11 19:59:22 +02008625 rc = eval_unary_expr(exp, tok_idx, count, set, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008626 break;
8627 case LYXP_EXPR_UNION:
Michal Vasko004d3152020-06-11 19:59:22 +02008628 rc = eval_union_expr(exp, tok_idx, count, set, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008629 break;
8630 case LYXP_EXPR_NONE:
Michal Vasko004d3152020-06-11 19:59:22 +02008631 rc = eval_path_expr(exp, tok_idx, set, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008632 break;
8633 default:
8634 LOGINT_RET(set->ctx);
8635 }
8636
8637 return rc;
8638}
8639
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01008640/**
8641 * @brief Get root type.
8642 *
8643 * @param[in] ctx_node Context node.
8644 * @param[in] ctx_scnode Schema context node.
8645 * @param[in] options XPath options.
8646 * @return Root type.
8647 */
8648static enum lyxp_node_type
Radek Krejci1deb5be2020-08-26 16:43:36 +02008649lyxp_get_root_type(const struct lyd_node *ctx_node, const struct lysc_node *ctx_scnode, uint32_t options)
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01008650{
Michal Vasko6b26e742020-07-17 15:02:10 +02008651 const struct lysc_node *op;
8652
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01008653 if (options & LYXP_SCNODE_ALL) {
Michal Vasko5d24f6c2020-10-13 13:49:06 +02008654 /* schema */
Radek Krejci1e008d22020-08-17 11:37:37 +02008655 for (op = ctx_scnode; op && !(op->nodetype & (LYS_RPC | LYS_ACTION | LYS_NOTIF)); op = op->parent) {}
Michal Vasko6b26e742020-07-17 15:02:10 +02008656
8657 if (op || (options & LYXP_SCNODE)) {
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01008658 /* general root that can access everything */
8659 return LYXP_NODE_ROOT;
8660 } else if (!ctx_scnode || (ctx_scnode->flags & LYS_CONFIG_W)) {
8661 /* root context node can access only config data (because we said so, it is unspecified) */
8662 return LYXP_NODE_ROOT_CONFIG;
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01008663 }
Michal Vasko6b26e742020-07-17 15:02:10 +02008664 return LYXP_NODE_ROOT;
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01008665 }
8666
Michal Vasko5d24f6c2020-10-13 13:49:06 +02008667 /* data */
Michal Vasko6b26e742020-07-17 15:02:10 +02008668 op = ctx_node ? ctx_node->schema : NULL;
Michal Vaskod989ba02020-08-24 10:59:24 +02008669 for ( ; op && !(op->nodetype & (LYS_RPC | LYS_ACTION | LYS_NOTIF)); op = op->parent) {}
Michal Vasko6b26e742020-07-17 15:02:10 +02008670
Michal Vasko5d24f6c2020-10-13 13:49:06 +02008671 if (op || !(options & LYXP_SCHEMA)) {
8672 /* general root that can access everything */
8673 return LYXP_NODE_ROOT;
Christian Hoppsb6ecaea2021-02-06 09:45:38 -05008674 } else if (!ctx_node || !ctx_node->schema || (ctx_node->schema->flags & LYS_CONFIG_W)) {
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01008675 /* root context node can access only config data (because we said so, it is unspecified) */
8676 return LYXP_NODE_ROOT_CONFIG;
8677 }
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01008678 return LYXP_NODE_ROOT;
8679}
8680
Michal Vasko03ff5a72019-09-11 13:49:33 +02008681LY_ERR
Michal Vasko400e9672021-01-11 13:39:17 +01008682lyxp_eval(const struct ly_ctx *ctx, const struct lyxp_expr *exp, const struct lys_module *cur_mod,
Radek Krejci8df109d2021-04-23 12:19:08 +02008683 LY_VALUE_FORMAT format, void *prefix_data, const struct lyd_node *ctx_node, const struct lyd_node *tree,
aPiecekfba75362021-10-07 12:39:48 +02008684 const struct lyxp_var *vars, struct lyxp_set *set, uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02008685{
Michal Vasko004d3152020-06-11 19:59:22 +02008686 uint16_t tok_idx = 0;
Michal Vasko03ff5a72019-09-11 13:49:33 +02008687 LY_ERR rc;
8688
Michal Vasko400e9672021-01-11 13:39:17 +01008689 LY_CHECK_ARG_RET(ctx, ctx, exp, set, LY_EINVAL);
Radek Krejci8df109d2021-04-23 12:19:08 +02008690 if (!cur_mod && ((format == LY_VALUE_SCHEMA) || (format == LY_VALUE_SCHEMA_RESOLVED))) {
Michal Vasko5d24f6c2020-10-13 13:49:06 +02008691 LOGARG(NULL, "Current module must be set if schema format is used.");
8692 return LY_EINVAL;
Michal Vasko004d3152020-06-11 19:59:22 +02008693 }
Michal Vasko03ff5a72019-09-11 13:49:33 +02008694
Michal Vaskod3bb12f2020-12-04 14:33:09 +01008695 if (tree) {
8696 /* adjust the pointer to be the first top-level sibling */
8697 while (tree->parent) {
8698 tree = lyd_parent(tree);
8699 }
8700 tree = lyd_first_sibling(tree);
8701 }
8702
Michal Vasko03ff5a72019-09-11 13:49:33 +02008703 /* prepare set for evaluation */
Michal Vasko03ff5a72019-09-11 13:49:33 +02008704 memset(set, 0, sizeof *set);
Michal Vaskod3678892020-05-21 10:06:58 +02008705 set->type = LYXP_SET_NODE_SET;
Michal Vasko5d24f6c2020-10-13 13:49:06 +02008706 set->root_type = lyxp_get_root_type(ctx_node, NULL, options);
8707 set_insert_node(set, (struct lyd_node *)ctx_node, 0, ctx_node ? LYXP_NODE_ELEM : set->root_type, 0);
8708
Michal Vasko400e9672021-01-11 13:39:17 +01008709 set->ctx = (struct ly_ctx *)ctx;
Michal Vasko5d24f6c2020-10-13 13:49:06 +02008710 set->cur_node = ctx_node;
8711 for (set->context_op = ctx_node ? ctx_node->schema : NULL;
Radek Krejci0f969882020-08-21 16:56:47 +02008712 set->context_op && !(set->context_op->nodetype & (LYS_RPC | LYS_ACTION | LYS_NOTIF));
8713 set->context_op = set->context_op->parent) {}
Michal Vaskof03ed032020-03-04 13:31:44 +01008714 set->tree = tree;
Michal Vasko5d24f6c2020-10-13 13:49:06 +02008715 set->cur_mod = cur_mod;
Michal Vasko03ff5a72019-09-11 13:49:33 +02008716 set->format = format;
Michal Vasko5d24f6c2020-10-13 13:49:06 +02008717 set->prefix_data = prefix_data;
aPiecekfba75362021-10-07 12:39:48 +02008718 set->vars = vars;
Michal Vasko03ff5a72019-09-11 13:49:33 +02008719
Radek Krejciddace2c2021-01-08 11:30:56 +01008720 LOG_LOCSET(NULL, set->cur_node, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +01008721
Michal Vasko03ff5a72019-09-11 13:49:33 +02008722 /* evaluate */
Michal Vasko004d3152020-06-11 19:59:22 +02008723 rc = eval_expr_select(exp, &tok_idx, 0, set, options);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008724 if (rc != LY_SUCCESS) {
Michal Vaskod3678892020-05-21 10:06:58 +02008725 lyxp_set_free_content(set);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008726 }
8727
Radek Krejciddace2c2021-01-08 11:30:56 +01008728 LOG_LOCBACK(0, 1, 0, 0);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008729 return rc;
8730}
8731
8732#if 0
8733
8734/* full xml printing of set elements, not used currently */
8735
8736void
8737lyxp_set_print_xml(FILE *f, struct lyxp_set *set)
8738{
8739 uint32_t i;
8740 char *str_num;
8741 struct lyout out;
8742
8743 memset(&out, 0, sizeof out);
8744
8745 out.type = LYOUT_STREAM;
8746 out.method.f = f;
8747
8748 switch (set->type) {
8749 case LYXP_SET_EMPTY:
Michal Vasko5233e962020-08-14 14:26:20 +02008750 ly_print_(&out, "Empty XPath set\n\n");
Michal Vasko03ff5a72019-09-11 13:49:33 +02008751 break;
8752 case LYXP_SET_BOOLEAN:
Michal Vasko5233e962020-08-14 14:26:20 +02008753 ly_print_(&out, "Boolean XPath set:\n");
8754 ly_print_(&out, "%s\n\n", set->value.bool ? "true" : "false");
Michal Vasko03ff5a72019-09-11 13:49:33 +02008755 break;
8756 case LYXP_SET_STRING:
Michal Vasko5233e962020-08-14 14:26:20 +02008757 ly_print_(&out, "String XPath set:\n");
8758 ly_print_(&out, "\"%s\"\n\n", set->value.str);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008759 break;
8760 case LYXP_SET_NUMBER:
Michal Vasko5233e962020-08-14 14:26:20 +02008761 ly_print_(&out, "Number XPath set:\n");
Michal Vasko03ff5a72019-09-11 13:49:33 +02008762
8763 if (isnan(set->value.num)) {
8764 str_num = strdup("NaN");
8765 } else if ((set->value.num == 0) || (set->value.num == -0.0f)) {
8766 str_num = strdup("0");
8767 } else if (isinf(set->value.num) && !signbit(set->value.num)) {
8768 str_num = strdup("Infinity");
8769 } else if (isinf(set->value.num) && signbit(set->value.num)) {
8770 str_num = strdup("-Infinity");
8771 } else if ((long long)set->value.num == set->value.num) {
8772 if (asprintf(&str_num, "%lld", (long long)set->value.num) == -1) {
8773 str_num = NULL;
8774 }
8775 } else {
8776 if (asprintf(&str_num, "%03.1Lf", set->value.num) == -1) {
8777 str_num = NULL;
8778 }
8779 }
8780 if (!str_num) {
8781 LOGMEM;
8782 return;
8783 }
Michal Vasko5233e962020-08-14 14:26:20 +02008784 ly_print_(&out, "%s\n\n", str_num);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008785 free(str_num);
8786 break;
8787 case LYXP_SET_NODE_SET:
Michal Vasko5233e962020-08-14 14:26:20 +02008788 ly_print_(&out, "Node XPath set:\n");
Michal Vasko03ff5a72019-09-11 13:49:33 +02008789
8790 for (i = 0; i < set->used; ++i) {
Michal Vasko5233e962020-08-14 14:26:20 +02008791 ly_print_(&out, "%d. ", i + 1);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008792 switch (set->node_type[i]) {
8793 case LYXP_NODE_ROOT_ALL:
Michal Vasko5233e962020-08-14 14:26:20 +02008794 ly_print_(&out, "ROOT all\n\n");
Michal Vasko03ff5a72019-09-11 13:49:33 +02008795 break;
8796 case LYXP_NODE_ROOT_CONFIG:
Michal Vasko5233e962020-08-14 14:26:20 +02008797 ly_print_(&out, "ROOT config\n\n");
Michal Vasko03ff5a72019-09-11 13:49:33 +02008798 break;
8799 case LYXP_NODE_ROOT_STATE:
Michal Vasko5233e962020-08-14 14:26:20 +02008800 ly_print_(&out, "ROOT state\n\n");
Michal Vasko03ff5a72019-09-11 13:49:33 +02008801 break;
8802 case LYXP_NODE_ROOT_NOTIF:
Michal Vasko5233e962020-08-14 14:26:20 +02008803 ly_print_(&out, "ROOT notification \"%s\"\n\n", set->value.nodes[i]->schema->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008804 break;
8805 case LYXP_NODE_ROOT_RPC:
Michal Vasko5233e962020-08-14 14:26:20 +02008806 ly_print_(&out, "ROOT rpc \"%s\"\n\n", set->value.nodes[i]->schema->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008807 break;
8808 case LYXP_NODE_ROOT_OUTPUT:
Michal Vasko5233e962020-08-14 14:26:20 +02008809 ly_print_(&out, "ROOT output \"%s\"\n\n", set->value.nodes[i]->schema->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008810 break;
8811 case LYXP_NODE_ELEM:
Michal Vasko5233e962020-08-14 14:26:20 +02008812 ly_print_(&out, "ELEM \"%s\"\n", set->value.nodes[i]->schema->name);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008813 xml_print_node(&out, 1, set->value.nodes[i], 1, LYP_FORMAT);
Michal Vasko5233e962020-08-14 14:26:20 +02008814 ly_print_(&out, "\n");
Michal Vasko03ff5a72019-09-11 13:49:33 +02008815 break;
8816 case LYXP_NODE_TEXT:
Michal Vasko5233e962020-08-14 14:26:20 +02008817 ly_print_(&out, "TEXT \"%s\"\n\n", ((struct lyd_node_leaf_list *)set->value.nodes[i])->value_str);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008818 break;
8819 case LYXP_NODE_ATTR:
Michal Vasko5233e962020-08-14 14:26:20 +02008820 ly_print_(&out, "ATTR \"%s\" = \"%s\"\n\n", set->value.attrs[i]->name, set->value.attrs[i]->value);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008821 break;
8822 }
8823 }
8824 break;
8825 }
8826}
8827
8828#endif
8829
8830LY_ERR
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01008831lyxp_set_cast(struct lyxp_set *set, enum lyxp_set_type target)
Michal Vasko03ff5a72019-09-11 13:49:33 +02008832{
8833 long double num;
8834 char *str;
8835 LY_ERR rc;
8836
8837 if (!set || (set->type == target)) {
8838 return LY_SUCCESS;
8839 }
8840
8841 /* it's not possible to convert anything into a node set */
Michal Vaskod3678892020-05-21 10:06:58 +02008842 assert(target != LYXP_SET_NODE_SET);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008843
8844 if (set->type == LYXP_SET_SCNODE_SET) {
Michal Vaskod3678892020-05-21 10:06:58 +02008845 lyxp_set_free_content(set);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008846 return LY_EINVAL;
8847 }
8848
8849 /* to STRING */
Michal Vaskod3678892020-05-21 10:06:58 +02008850 if ((target == LYXP_SET_STRING) || ((target == LYXP_SET_NUMBER) && (set->type == LYXP_SET_NODE_SET))) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02008851 switch (set->type) {
8852 case LYXP_SET_NUMBER:
8853 if (isnan(set->val.num)) {
8854 set->val.str = strdup("NaN");
8855 LY_CHECK_ERR_RET(!set->val.str, LOGMEM(set->ctx), -1);
8856 } else if ((set->val.num == 0) || (set->val.num == -0.0f)) {
8857 set->val.str = strdup("0");
8858 LY_CHECK_ERR_RET(!set->val.str, LOGMEM(set->ctx), -1);
8859 } else if (isinf(set->val.num) && !signbit(set->val.num)) {
8860 set->val.str = strdup("Infinity");
8861 LY_CHECK_ERR_RET(!set->val.str, LOGMEM(set->ctx), -1);
8862 } else if (isinf(set->val.num) && signbit(set->val.num)) {
8863 set->val.str = strdup("-Infinity");
8864 LY_CHECK_ERR_RET(!set->val.str, LOGMEM(set->ctx), -1);
8865 } else if ((long long)set->val.num == set->val.num) {
8866 if (asprintf(&str, "%lld", (long long)set->val.num) == -1) {
8867 LOGMEM_RET(set->ctx);
8868 }
8869 set->val.str = str;
8870 } else {
8871 if (asprintf(&str, "%03.1Lf", set->val.num) == -1) {
8872 LOGMEM_RET(set->ctx);
8873 }
8874 set->val.str = str;
8875 }
8876 break;
8877 case LYXP_SET_BOOLEAN:
Michal Vasko004d3152020-06-11 19:59:22 +02008878 if (set->val.bln) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02008879 set->val.str = strdup("true");
8880 } else {
8881 set->val.str = strdup("false");
8882 }
8883 LY_CHECK_ERR_RET(!set->val.str, LOGMEM(set->ctx), LY_EMEM);
8884 break;
8885 case LYXP_SET_NODE_SET:
Michal Vasko03ff5a72019-09-11 13:49:33 +02008886 /* we need the set sorted, it affects the result */
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01008887 assert(!set_sort(set));
Michal Vasko03ff5a72019-09-11 13:49:33 +02008888
Michal Vasko5e0e6eb2019-11-06 15:47:50 +01008889 rc = cast_node_set_to_string(set, &str);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008890 LY_CHECK_RET(rc);
Michal Vaskod3678892020-05-21 10:06:58 +02008891 lyxp_set_free_content(set);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008892 set->val.str = str;
8893 break;
Michal Vasko03ff5a72019-09-11 13:49:33 +02008894 default:
8895 LOGINT_RET(set->ctx);
8896 }
8897 set->type = LYXP_SET_STRING;
8898 }
8899
8900 /* to NUMBER */
8901 if (target == LYXP_SET_NUMBER) {
8902 switch (set->type) {
8903 case LYXP_SET_STRING:
8904 num = cast_string_to_number(set->val.str);
Michal Vaskod3678892020-05-21 10:06:58 +02008905 lyxp_set_free_content(set);
Michal Vasko03ff5a72019-09-11 13:49:33 +02008906 set->val.num = num;
8907 break;
8908 case LYXP_SET_BOOLEAN:
Michal Vasko004d3152020-06-11 19:59:22 +02008909 if (set->val.bln) {
Michal Vasko03ff5a72019-09-11 13:49:33 +02008910 set->val.num = 1;
8911 } else {
8912 set->val.num = 0;
8913 }
8914 break;
8915 default:
8916 LOGINT_RET(set->ctx);
8917 }
8918 set->type = LYXP_SET_NUMBER;
8919 }
8920
8921 /* to BOOLEAN */
8922 if (target == LYXP_SET_BOOLEAN) {
8923 switch (set->type) {
8924 case LYXP_SET_NUMBER:
8925 if ((set->val.num == 0) || (set->val.num == -0.0f) || isnan(set->val.num)) {
Michal Vasko004d3152020-06-11 19:59:22 +02008926 set->val.bln = 0;
Michal Vasko03ff5a72019-09-11 13:49:33 +02008927 } else {
Michal Vasko004d3152020-06-11 19:59:22 +02008928 set->val.bln = 1;
Michal Vasko03ff5a72019-09-11 13:49:33 +02008929 }
8930 break;
8931 case LYXP_SET_STRING:
8932 if (set->val.str[0]) {
Michal Vaskod3678892020-05-21 10:06:58 +02008933 lyxp_set_free_content(set);
Michal Vasko004d3152020-06-11 19:59:22 +02008934 set->val.bln = 1;
Michal Vasko03ff5a72019-09-11 13:49:33 +02008935 } else {
Michal Vaskod3678892020-05-21 10:06:58 +02008936 lyxp_set_free_content(set);
Michal Vasko004d3152020-06-11 19:59:22 +02008937 set->val.bln = 0;
Michal Vasko03ff5a72019-09-11 13:49:33 +02008938 }
8939 break;
8940 case LYXP_SET_NODE_SET:
Michal Vaskod3678892020-05-21 10:06:58 +02008941 if (set->used) {
8942 lyxp_set_free_content(set);
Michal Vasko004d3152020-06-11 19:59:22 +02008943 set->val.bln = 1;
Michal Vaskod3678892020-05-21 10:06:58 +02008944 } else {
8945 lyxp_set_free_content(set);
Michal Vasko004d3152020-06-11 19:59:22 +02008946 set->val.bln = 0;
Michal Vaskod3678892020-05-21 10:06:58 +02008947 }
Michal Vasko03ff5a72019-09-11 13:49:33 +02008948 break;
8949 default:
8950 LOGINT_RET(set->ctx);
8951 }
8952 set->type = LYXP_SET_BOOLEAN;
8953 }
8954
Michal Vasko03ff5a72019-09-11 13:49:33 +02008955 return LY_SUCCESS;
8956}
8957
8958LY_ERR
Michal Vasko400e9672021-01-11 13:39:17 +01008959lyxp_atomize(const struct ly_ctx *ctx, const struct lyxp_expr *exp, const struct lys_module *cur_mod,
Radek Krejci8df109d2021-04-23 12:19:08 +02008960 LY_VALUE_FORMAT format, void *prefix_data, const struct lysc_node *ctx_scnode, struct lyxp_set *set,
Michal Vasko400e9672021-01-11 13:39:17 +01008961 uint32_t options)
Michal Vasko03ff5a72019-09-11 13:49:33 +02008962{
Radek Krejci2efc45b2020-12-22 16:25:44 +01008963 LY_ERR ret;
Michal Vasko004d3152020-06-11 19:59:22 +02008964 uint16_t tok_idx = 0;
Michal Vasko03ff5a72019-09-11 13:49:33 +02008965
Michal Vasko400e9672021-01-11 13:39:17 +01008966 LY_CHECK_ARG_RET(ctx, ctx, exp, set, LY_EINVAL);
Radek Krejci8df109d2021-04-23 12:19:08 +02008967 if (!cur_mod && ((format == LY_VALUE_SCHEMA) || (format == LY_VALUE_SCHEMA_RESOLVED))) {
Michal Vasko5d24f6c2020-10-13 13:49:06 +02008968 LOGARG(NULL, "Current module must be set if schema format is used.");
8969 return LY_EINVAL;
Michal Vasko004d3152020-06-11 19:59:22 +02008970 }
Michal Vasko03ff5a72019-09-11 13:49:33 +02008971
8972 /* prepare set for evaluation */
Michal Vasko03ff5a72019-09-11 13:49:33 +02008973 memset(set, 0, sizeof *set);
8974 set->type = LYXP_SET_SCNODE_SET;
Michal Vasko5d24f6c2020-10-13 13:49:06 +02008975 set->root_type = lyxp_get_root_type(NULL, ctx_scnode, options);
8976 LY_CHECK_RET(lyxp_set_scnode_insert_node(set, ctx_scnode, ctx_scnode ? LYXP_NODE_ELEM : set->root_type, NULL));
Radek Krejcif13b87b2020-12-01 22:02:17 +01008977 set->val.scnodes[0].in_ctx = LYXP_SET_SCNODE_START;
Michal Vasko5d24f6c2020-10-13 13:49:06 +02008978
Michal Vasko400e9672021-01-11 13:39:17 +01008979 set->ctx = (struct ly_ctx *)ctx;
Michal Vasko5d24f6c2020-10-13 13:49:06 +02008980 set->cur_scnode = ctx_scnode;
Michal Vasko6b26e742020-07-17 15:02:10 +02008981 for (set->context_op = ctx_scnode;
Radek Krejci0f969882020-08-21 16:56:47 +02008982 set->context_op && !(set->context_op->nodetype & (LYS_RPC | LYS_ACTION | LYS_NOTIF));
8983 set->context_op = set->context_op->parent) {}
Michal Vasko5d24f6c2020-10-13 13:49:06 +02008984 set->cur_mod = cur_mod;
Michal Vasko03ff5a72019-09-11 13:49:33 +02008985 set->format = format;
Michal Vasko5d24f6c2020-10-13 13:49:06 +02008986 set->prefix_data = prefix_data;
Michal Vasko03ff5a72019-09-11 13:49:33 +02008987
Radek Krejciddace2c2021-01-08 11:30:56 +01008988 LOG_LOCSET(set->cur_scnode, NULL, NULL, NULL);
Radek Krejci2efc45b2020-12-22 16:25:44 +01008989
Michal Vasko03ff5a72019-09-11 13:49:33 +02008990 /* evaluate */
Radek Krejci2efc45b2020-12-22 16:25:44 +01008991 ret = eval_expr_select(exp, &tok_idx, 0, set, options);
8992
Radek Krejciddace2c2021-01-08 11:30:56 +01008993 LOG_LOCBACK(1, 0, 0, 0);
Radek Krejci2efc45b2020-12-22 16:25:44 +01008994 return ret;
Michal Vasko03ff5a72019-09-11 13:49:33 +02008995}
Michal Vaskod43d71a2020-08-07 14:54:58 +02008996
8997API const char *
8998lyxp_get_expr(const struct lyxp_expr *path)
8999{
9000 if (!path) {
9001 return NULL;
9002 }
9003
9004 return path->expr;
9005}