blob: 6bbba7f58e3d58b1af71d329c0d129387390b3c8 [file] [log] [blame]
Michal Vaskod59035b2020-07-08 12:00:06 +02001/**
2 * @file diff.c
3 * @author Michal Vasko <mvasko@cesnet.cz>
4 * @brief diff functions
5 *
Michal Vaskoe78faec2021-04-08 17:24:43 +02006 * Copyright (c) 2020 - 2021 CESNET, z.s.p.o.
Michal Vaskod59035b2020-07-08 12:00:06 +02007 *
8 * This source code is licensed under BSD 3-Clause License (the "License").
9 * You may not use this file except in compliance with the License.
10 * You may obtain a copy of the License at
11 *
12 * https://opensource.org/licenses/BSD-3-Clause
13 */
Christian Hopps32874e12021-05-01 09:43:54 -040014#define _GNU_SOURCE /* asprintf, strdup */
Michal Vaskod59035b2020-07-08 12:00:06 +020015
16#include "diff.h"
17
18#include <assert.h>
19#include <stddef.h>
Michal Vaskoe78faec2021-04-08 17:24:43 +020020#include <stdint.h>
21#include <stdio.h>
Radek Krejci47fab892020-11-05 17:02:41 +010022#include <stdlib.h>
Michal Vaskod59035b2020-07-08 12:00:06 +020023#include <string.h>
24
25#include "common.h"
Michal Vaskoe78faec2021-04-08 17:24:43 +020026#include "compat.h"
Radek Krejci47fab892020-11-05 17:02:41 +010027#include "context.h"
Michal Vaskod59035b2020-07-08 12:00:06 +020028#include "log.h"
Radek Krejci47fab892020-11-05 17:02:41 +010029#include "plugins_types.h"
30#include "set.h"
31#include "tree.h"
32#include "tree_data.h"
Michal Vaskod59035b2020-07-08 12:00:06 +020033#include "tree_data_internal.h"
Radek Krejci859a15a2021-03-05 20:56:59 +010034#include "tree_edit.h"
Michal Vaskod59035b2020-07-08 12:00:06 +020035#include "tree_schema.h"
36#include "tree_schema_internal.h"
37
Michal Vasko10765282022-01-18 14:08:34 +010038#define LOGERR_META(ctx, meta_name, node) \
39 { \
40 char *__path = lyd_path(node, LYD_PATH_STD, NULL, 0); \
41 LOGERR(ctx, LY_EINVAL, "Failed to find metadata \"%s\" for node \"%s\".", meta_name, __path); \
42 free(__path); \
43 }
44
45#define LOGERR_NOINST(ctx, node) \
46 { \
47 char *__path = lyd_path(node, LYD_PATH_STD, NULL, 0); \
48 LOGERR(ctx, LY_EINVAL, "Failed to find node \"%s\" instance in data.", __path); \
49 free(__path); \
50 }
51
52#define LOGERR_UNEXPVAL(ctx, node, data_source) \
53 { \
54 char *__path = lyd_path(node, LYD_PATH_STD, NULL, 0); \
55 LOGERR(ctx, LY_EINVAL, "Unexpected value of node \"%s\" in %s.", __path, data_source); \
56 free(__path); \
57 }
58
59#define LOGERR_MERGEOP(ctx, node, src_op, trg_op) \
60 { \
61 char *__path = lyd_path(node, LYD_PATH_STD, NULL, 0); \
62 LOGERR(ctx, LY_EINVAL, "Unable to merge operation \"%s\" with \"%s\" for node \"%s\".", \
63 lyd_diff_op2str(trg_op), lyd_diff_op2str(src_op), __path); \
64 free(__path); \
65 }
66
Michal Vaskod59035b2020-07-08 12:00:06 +020067static const char *
68lyd_diff_op2str(enum lyd_diff_op op)
69{
70 switch (op) {
71 case LYD_DIFF_OP_CREATE:
72 return "create";
73 case LYD_DIFF_OP_DELETE:
74 return "delete";
75 case LYD_DIFF_OP_REPLACE:
76 return "replace";
77 case LYD_DIFF_OP_NONE:
78 return "none";
79 }
80
81 LOGINT(NULL);
82 return NULL;
83}
84
Michal Vaskoe6323f62020-07-09 15:49:02 +020085static enum lyd_diff_op
86lyd_diff_str2op(const char *str)
87{
88 switch (str[0]) {
89 case 'c':
90 assert(!strcmp(str, "create"));
91 return LYD_DIFF_OP_CREATE;
92 case 'd':
93 assert(!strcmp(str, "delete"));
94 return LYD_DIFF_OP_DELETE;
95 case 'r':
96 assert(!strcmp(str, "replace"));
97 return LYD_DIFF_OP_REPLACE;
98 case 'n':
99 assert(!strcmp(str, "none"));
100 return LYD_DIFF_OP_NONE;
101 }
102
103 LOGINT(NULL);
104 return 0;
105}
106
Michal Vaskod59035b2020-07-08 12:00:06 +0200107LY_ERR
108lyd_diff_add(const struct lyd_node *node, enum lyd_diff_op op, const char *orig_default, const char *orig_value,
Michal Vaskoe78faec2021-04-08 17:24:43 +0200109 const char *key, const char *value, const char *position, const char *orig_key, const char *orig_position,
110 struct lyd_node **diff)
Michal Vaskod59035b2020-07-08 12:00:06 +0200111{
112 struct lyd_node *dup, *siblings, *match = NULL, *diff_parent = NULL;
113 const struct lyd_node *parent = NULL;
114 const struct lys_module *yang_mod;
115
116 assert(diff);
117
Michal Vasko53d48422020-11-13 18:02:29 +0100118 /* replace leaf always needs orig-default and orig-value */
119 assert((node->schema->nodetype != LYS_LEAF) || (op != LYD_DIFF_OP_REPLACE) || (orig_default && orig_value));
120
121 /* create on userord needs key/value */
122 assert((node->schema->nodetype != LYS_LIST) || !(node->schema->flags & LYS_ORDBY_USER) || (op != LYD_DIFF_OP_CREATE) ||
Michal Vaskoe78faec2021-04-08 17:24:43 +0200123 (lysc_is_dup_inst_list(node->schema) && position) || key);
Michal Vasko53d48422020-11-13 18:02:29 +0100124 assert((node->schema->nodetype != LYS_LEAFLIST) || !(node->schema->flags & LYS_ORDBY_USER) ||
Michal Vaskoe78faec2021-04-08 17:24:43 +0200125 (op != LYD_DIFF_OP_CREATE) || (lysc_is_dup_inst_list(node->schema) && position) || value);
Michal Vasko53d48422020-11-13 18:02:29 +0100126
127 /* move on userord needs both key and orig-key/value and orig-value */
128 assert((node->schema->nodetype != LYS_LIST) || !(node->schema->flags & LYS_ORDBY_USER) || (op != LYD_DIFF_OP_REPLACE) ||
Michal Vaskoe78faec2021-04-08 17:24:43 +0200129 (lysc_is_dup_inst_list(node->schema) && position && orig_position) || (key && orig_key));
Michal Vasko53d48422020-11-13 18:02:29 +0100130 assert((node->schema->nodetype != LYS_LEAFLIST) || !(node->schema->flags & LYS_ORDBY_USER) ||
Michal Vaskoe78faec2021-04-08 17:24:43 +0200131 (op != LYD_DIFF_OP_REPLACE) || (lysc_is_dup_inst_list(node->schema) && position && orig_position) ||
132 (value && orig_value));
Michal Vasko53d48422020-11-13 18:02:29 +0100133
Michal Vaskod59035b2020-07-08 12:00:06 +0200134 /* find the first existing parent */
135 siblings = *diff;
136 while (1) {
137 /* find next node parent */
138 parent = node;
139 while (parent->parent && (!diff_parent || (parent->parent->schema != diff_parent->schema))) {
Michal Vasko9e685082021-01-29 14:49:09 +0100140 parent = lyd_parent(parent);
Michal Vaskod59035b2020-07-08 12:00:06 +0200141 }
142 if (parent == node) {
143 /* no more parents to find */
144 break;
145 }
146
147 /* check whether it exists in the diff */
148 if (lyd_find_sibling_first(siblings, parent, &match)) {
149 break;
150 }
151
152 /* another parent found */
153 diff_parent = match;
154
155 /* move down in the diff */
Radek Krejcia1c1e542020-09-29 16:06:52 +0200156 siblings = lyd_child_no_keys(match);
Michal Vaskod59035b2020-07-08 12:00:06 +0200157 }
158
159 /* duplicate the subtree (and connect to the diff if possible) */
Michal Vasko3a41dff2020-07-15 14:30:28 +0200160 LY_CHECK_RET(lyd_dup_single(node, (struct lyd_node_inner *)diff_parent,
Michal Vasko871a0252020-11-11 18:35:24 +0100161 LYD_DUP_RECURSIVE | LYD_DUP_NO_META | LYD_DUP_WITH_PARENTS | LYD_DUP_WITH_FLAGS, &dup));
Michal Vaskod59035b2020-07-08 12:00:06 +0200162
163 /* find the first duplicated parent */
164 if (!diff_parent) {
Michal Vasko9e685082021-01-29 14:49:09 +0100165 diff_parent = lyd_parent(dup);
Michal Vaskod59035b2020-07-08 12:00:06 +0200166 while (diff_parent && diff_parent->parent) {
Michal Vasko9e685082021-01-29 14:49:09 +0100167 diff_parent = lyd_parent(diff_parent);
Michal Vaskod59035b2020-07-08 12:00:06 +0200168 }
169 } else {
Michal Vasko9e685082021-01-29 14:49:09 +0100170 diff_parent = dup;
Michal Vaskod59035b2020-07-08 12:00:06 +0200171 while (diff_parent->parent && (diff_parent->parent->schema == parent->schema)) {
Michal Vasko9e685082021-01-29 14:49:09 +0100172 diff_parent = lyd_parent(diff_parent);
Michal Vaskod59035b2020-07-08 12:00:06 +0200173 }
174 }
175
176 /* no parent existed, must be manually connected */
177 if (!diff_parent) {
178 /* there actually was no parent to duplicate */
Michal Vaskob104f112020-07-17 09:54:54 +0200179 lyd_insert_sibling(*diff, dup, diff);
Michal Vaskod59035b2020-07-08 12:00:06 +0200180 } else if (!diff_parent->parent) {
Michal Vaskob104f112020-07-17 09:54:54 +0200181 lyd_insert_sibling(*diff, diff_parent, diff);
Michal Vaskod59035b2020-07-08 12:00:06 +0200182 }
183
184 /* get module with the operation metadata */
Michal Vaskob7be7a82020-08-20 09:09:04 +0200185 yang_mod = LYD_CTX(node)->list.objs[1];
Michal Vaskod59035b2020-07-08 12:00:06 +0200186 assert(!strcmp(yang_mod->name, "yang"));
187
188 /* add parent operation, if any */
Michal Vasko3a41dff2020-07-15 14:30:28 +0200189 if (diff_parent && (diff_parent != dup)) {
Michal Vasko871a0252020-11-11 18:35:24 +0100190 LY_CHECK_RET(lyd_new_meta(LYD_CTX(node), diff_parent, yang_mod, "operation", "none", 0, NULL));
Michal Vaskod59035b2020-07-08 12:00:06 +0200191 }
192
193 /* add subtree operation */
Michal Vasko871a0252020-11-11 18:35:24 +0100194 LY_CHECK_RET(lyd_new_meta(LYD_CTX(node), dup, yang_mod, "operation", lyd_diff_op2str(op), 0, NULL));
Michal Vaskod59035b2020-07-08 12:00:06 +0200195
196 /* orig-default */
Michal Vasko3a41dff2020-07-15 14:30:28 +0200197 if (orig_default) {
Michal Vasko871a0252020-11-11 18:35:24 +0100198 LY_CHECK_RET(lyd_new_meta(LYD_CTX(node), dup, yang_mod, "orig-default", orig_default, 0, NULL));
Michal Vaskod59035b2020-07-08 12:00:06 +0200199 }
200
201 /* orig-value */
Michal Vasko3a41dff2020-07-15 14:30:28 +0200202 if (orig_value) {
Michal Vasko871a0252020-11-11 18:35:24 +0100203 LY_CHECK_RET(lyd_new_meta(LYD_CTX(node), dup, yang_mod, "orig-value", orig_value, 0, NULL));
Michal Vaskod59035b2020-07-08 12:00:06 +0200204 }
205
206 /* key */
Michal Vasko3a41dff2020-07-15 14:30:28 +0200207 if (key) {
Michal Vasko871a0252020-11-11 18:35:24 +0100208 LY_CHECK_RET(lyd_new_meta(LYD_CTX(node), dup, yang_mod, "key", key, 0, NULL));
Michal Vaskod59035b2020-07-08 12:00:06 +0200209 }
210
211 /* value */
Michal Vasko3a41dff2020-07-15 14:30:28 +0200212 if (value) {
Michal Vasko871a0252020-11-11 18:35:24 +0100213 LY_CHECK_RET(lyd_new_meta(LYD_CTX(node), dup, yang_mod, "value", value, 0, NULL));
Michal Vaskod59035b2020-07-08 12:00:06 +0200214 }
215
Michal Vaskoe78faec2021-04-08 17:24:43 +0200216 /* position */
217 if (position) {
218 LY_CHECK_RET(lyd_new_meta(LYD_CTX(node), dup, yang_mod, "position", position, 0, NULL));
219 }
220
Michal Vaskod59035b2020-07-08 12:00:06 +0200221 /* orig-key */
Michal Vasko3a41dff2020-07-15 14:30:28 +0200222 if (orig_key) {
Michal Vasko871a0252020-11-11 18:35:24 +0100223 LY_CHECK_RET(lyd_new_meta(LYD_CTX(node), dup, yang_mod, "orig-key", orig_key, 0, NULL));
Michal Vaskod59035b2020-07-08 12:00:06 +0200224 }
225
Michal Vaskoe78faec2021-04-08 17:24:43 +0200226 /* orig-position */
227 if (orig_position) {
228 LY_CHECK_RET(lyd_new_meta(LYD_CTX(node), dup, yang_mod, "orig-position", orig_position, 0, NULL));
229 }
230
Michal Vaskod59035b2020-07-08 12:00:06 +0200231 return LY_SUCCESS;
232}
233
234/**
235 * @brief Get a userord entry for a specific user-ordered list/leaf-list. Create if does not exist yet.
236 *
Michal Vasko1dcd73b2020-12-08 10:04:33 +0100237 * @param[in] first Node from the first tree, can be NULL (on create).
Michal Vaskod59035b2020-07-08 12:00:06 +0200238 * @param[in] schema Schema node of the list/leaf-list.
239 * @param[in,out] userord Sized array of userord items.
240 * @return Userord item for all the user-ordered list/leaf-list instances.
241 */
242static struct lyd_diff_userord *
243lyd_diff_userord_get(const struct lyd_node *first, const struct lysc_node *schema, struct lyd_diff_userord **userord)
244{
245 struct lyd_diff_userord *item;
Michal Vaskoe78faec2021-04-08 17:24:43 +0200246 struct lyd_node *iter;
247 const struct lyd_node **node;
Michal Vaskod59035b2020-07-08 12:00:06 +0200248 LY_ARRAY_COUNT_TYPE u;
249
250 LY_ARRAY_FOR(*userord, u) {
251 if ((*userord)[u].schema == schema) {
252 return &(*userord)[u];
253 }
254 }
255
256 /* it was not added yet, add it now */
257 LY_ARRAY_NEW_RET(schema->module->ctx, *userord, item, NULL);
258
259 item->schema = schema;
260 item->pos = 0;
261 item->inst = NULL;
262
263 /* store all the instance pointers in the current order */
264 if (first) {
Michal Vaskoe78faec2021-04-08 17:24:43 +0200265 LYD_LIST_FOR_INST(lyd_first_sibling(first), first->schema, iter) {
266 LY_ARRAY_NEW_RET(schema->module->ctx, item->inst, node, NULL);
267 *node = iter;
Michal Vaskod59035b2020-07-08 12:00:06 +0200268 }
269 }
270
271 return item;
272}
273
274/**
275 * @brief Get all the metadata to be stored in a diff for the 2 nodes. Can be used only for user-ordered
276 * lists/leaf-lists.
277 *
278 * @param[in] first Node from the first tree, can be NULL (on create).
279 * @param[in] second Node from the second tree, can be NULL (on delete).
280 * @param[in] options Diff options.
281 * @param[in,out] userord Sized array of userord items for keeping the current node order.
282 * @param[out] op Operation.
283 * @param[out] orig_default Original default metadata.
284 * @param[out] value Value metadata.
285 * @param[out] orig_value Original value metadata
286 * @param[out] key Key metadata.
287 * @param[out] orig_key Original key metadata.
Michal Vaskoe78faec2021-04-08 17:24:43 +0200288 * @param[out] position Position metadata.
289 * @param[out] orig_position Original position metadata.
Michal Vaskod59035b2020-07-08 12:00:06 +0200290 * @return LY_SUCCESS on success,
291 * @return LY_ENOT if there is no change to be added into diff,
292 * @return LY_ERR value on other errors.
293 */
294static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +0200295lyd_diff_userord_attrs(const struct lyd_node *first, const struct lyd_node *second, uint16_t options,
Radek Krejci0f969882020-08-21 16:56:47 +0200296 struct lyd_diff_userord **userord, enum lyd_diff_op *op, const char **orig_default, char **value,
Michal Vaskoe78faec2021-04-08 17:24:43 +0200297 char **orig_value, char **key, char **orig_key, char **position, char **orig_position)
Michal Vaskod59035b2020-07-08 12:00:06 +0200298{
299 const struct lysc_node *schema;
Michal Vaskoe78faec2021-04-08 17:24:43 +0200300 size_t buflen, bufused;
301 uint32_t first_pos, second_pos;
Michal Vaskod59035b2020-07-08 12:00:06 +0200302 struct lyd_diff_userord *userord_item;
303
304 assert(first || second);
305
306 *orig_default = NULL;
307 *value = NULL;
308 *orig_value = NULL;
309 *key = NULL;
310 *orig_key = NULL;
Michal Vaskoe78faec2021-04-08 17:24:43 +0200311 *position = NULL;
312 *orig_position = NULL;
Michal Vaskod59035b2020-07-08 12:00:06 +0200313
314 schema = first ? first->schema : second->schema;
315 assert(lysc_is_userordered(schema));
316
317 /* get userord entry */
318 userord_item = lyd_diff_userord_get(first, schema, userord);
319 LY_CHECK_RET(!userord_item, LY_EMEM);
320
Michal Vaskod59035b2020-07-08 12:00:06 +0200321 /* find user-ordered first position */
322 if (first) {
Michal Vaskoe78faec2021-04-08 17:24:43 +0200323 for (first_pos = 0; first_pos < LY_ARRAY_COUNT(userord_item->inst); ++first_pos) {
Michal Vaskod59035b2020-07-08 12:00:06 +0200324 if (userord_item->inst[first_pos] == first) {
325 break;
326 }
327 }
328 assert(first_pos < LY_ARRAY_COUNT(userord_item->inst));
329 } else {
330 first_pos = 0;
331 }
332
Michal Vaskoe78faec2021-04-08 17:24:43 +0200333 /* prepare position of the next instance */
334 second_pos = userord_item->pos++;
335
Michal Vaskod59035b2020-07-08 12:00:06 +0200336 /* learn operation first */
337 if (!second) {
338 *op = LYD_DIFF_OP_DELETE;
339 } else if (!first) {
340 *op = LYD_DIFF_OP_CREATE;
341 } else {
Michal Vasko8f359bf2020-07-28 10:41:15 +0200342 if (lyd_compare_single(second, userord_item->inst[second_pos], 0)) {
Michal Vaskod59035b2020-07-08 12:00:06 +0200343 /* in first, there is a different instance on the second position, we are going to move 'first' node */
344 *op = LYD_DIFF_OP_REPLACE;
Michal Vasko3a41dff2020-07-15 14:30:28 +0200345 } else if ((options & LYD_DIFF_DEFAULTS) && ((first->flags & LYD_DEFAULT) != (second->flags & LYD_DEFAULT))) {
Michal Vaskod59035b2020-07-08 12:00:06 +0200346 /* default flag change */
347 *op = LYD_DIFF_OP_NONE;
348 } else {
349 /* no changes */
350 return LY_ENOT;
351 }
352 }
353
354 /*
355 * set each attribute correctly based on the operation and node type
356 */
357
358 /* orig-default */
Michal Vasko4b715ca2020-11-11 18:39:57 +0100359 if ((schema->nodetype == LYS_LEAFLIST) && ((*op == LYD_DIFF_OP_REPLACE) || (*op == LYD_DIFF_OP_NONE))) {
Michal Vaskod59035b2020-07-08 12:00:06 +0200360 if (first->flags & LYD_DEFAULT) {
361 *orig_default = "true";
362 } else {
363 *orig_default = "false";
364 }
365 }
366
367 /* value */
Michal Vaskoe78faec2021-04-08 17:24:43 +0200368 if ((schema->nodetype == LYS_LEAFLIST) && !lysc_is_dup_inst_list(schema) &&
369 ((*op == LYD_DIFF_OP_REPLACE) || (*op == LYD_DIFF_OP_CREATE))) {
Michal Vaskod59035b2020-07-08 12:00:06 +0200370 if (second_pos) {
Radek Krejci6d5ba0c2021-04-26 07:49:59 +0200371 *value = strdup(lyd_get_value(userord_item->inst[second_pos - 1]));
Michal Vaskoba99a3e2020-08-18 15:50:05 +0200372 LY_CHECK_ERR_RET(!*value, LOGMEM(schema->module->ctx), LY_EMEM);
Michal Vaskod59035b2020-07-08 12:00:06 +0200373 } else {
374 *value = strdup("");
375 LY_CHECK_ERR_RET(!*value, LOGMEM(schema->module->ctx), LY_EMEM);
376 }
377 }
378
379 /* orig-value */
Michal Vaskoe78faec2021-04-08 17:24:43 +0200380 if ((schema->nodetype == LYS_LEAFLIST) && !lysc_is_dup_inst_list(schema) &&
381 ((*op == LYD_DIFF_OP_REPLACE) || (*op == LYD_DIFF_OP_DELETE))) {
Michal Vaskod59035b2020-07-08 12:00:06 +0200382 if (first_pos) {
Radek Krejci6d5ba0c2021-04-26 07:49:59 +0200383 *orig_value = strdup(lyd_get_value(userord_item->inst[first_pos - 1]));
Michal Vaskoba99a3e2020-08-18 15:50:05 +0200384 LY_CHECK_ERR_RET(!*orig_value, LOGMEM(schema->module->ctx), LY_EMEM);
Michal Vaskod59035b2020-07-08 12:00:06 +0200385 } else {
386 *orig_value = strdup("");
387 LY_CHECK_ERR_RET(!*orig_value, LOGMEM(schema->module->ctx), LY_EMEM);
388 }
389 }
390
391 /* key */
Michal Vaskoe78faec2021-04-08 17:24:43 +0200392 if ((schema->nodetype == LYS_LIST) && !lysc_is_dup_inst_list(schema) &&
393 ((*op == LYD_DIFF_OP_REPLACE) || (*op == LYD_DIFF_OP_CREATE))) {
Michal Vaskod59035b2020-07-08 12:00:06 +0200394 if (second_pos) {
395 buflen = bufused = 0;
396 LY_CHECK_RET(lyd_path_list_predicate(userord_item->inst[second_pos - 1], key, &buflen, &bufused, 0));
397 } else {
398 *key = strdup("");
399 LY_CHECK_ERR_RET(!*key, LOGMEM(schema->module->ctx), LY_EMEM);
400 }
401 }
402
403 /* orig-key */
Michal Vaskoe78faec2021-04-08 17:24:43 +0200404 if ((schema->nodetype == LYS_LIST) && !lysc_is_dup_inst_list(schema) &&
405 ((*op == LYD_DIFF_OP_REPLACE) || (*op == LYD_DIFF_OP_DELETE))) {
Michal Vaskod59035b2020-07-08 12:00:06 +0200406 if (first_pos) {
407 buflen = bufused = 0;
408 LY_CHECK_RET(lyd_path_list_predicate(userord_item->inst[first_pos - 1], orig_key, &buflen, &bufused, 0));
409 } else {
410 *orig_key = strdup("");
411 LY_CHECK_ERR_RET(!*orig_key, LOGMEM(schema->module->ctx), LY_EMEM);
412 }
413 }
414
Michal Vaskoe78faec2021-04-08 17:24:43 +0200415 /* position */
416 if (lysc_is_dup_inst_list(schema) && ((*op == LYD_DIFF_OP_REPLACE) || (*op == LYD_DIFF_OP_CREATE))) {
417 if (second_pos) {
418 if (asprintf(position, "%" PRIu32, second_pos) == -1) {
419 LOGMEM(schema->module->ctx);
420 return LY_EMEM;
421 }
422 } else {
423 *position = strdup("");
424 LY_CHECK_ERR_RET(!*position, LOGMEM(schema->module->ctx), LY_EMEM);
425 }
426 }
427
428 /* orig-position */
429 if (lysc_is_dup_inst_list(schema) && ((*op == LYD_DIFF_OP_REPLACE) || (*op == LYD_DIFF_OP_DELETE))) {
430 if (first_pos) {
431 if (asprintf(orig_position, "%" PRIu32, first_pos) == -1) {
432 LOGMEM(schema->module->ctx);
433 return LY_EMEM;
434 }
435 } else {
436 *orig_position = strdup("");
437 LY_CHECK_ERR_RET(!*orig_position, LOGMEM(schema->module->ctx), LY_EMEM);
438 }
439 }
440
Michal Vaskod59035b2020-07-08 12:00:06 +0200441 /*
442 * update our instances - apply the change
443 */
444 if (*op == LYD_DIFF_OP_CREATE) {
445 /* insert the instance */
Michal Vasko5cde11b2020-12-08 10:04:48 +0100446 LY_ARRAY_CREATE_RET(schema->module->ctx, userord_item->inst, 1, LY_EMEM);
Michal Vaskod59035b2020-07-08 12:00:06 +0200447 if (second_pos < LY_ARRAY_COUNT(userord_item->inst)) {
448 memmove(userord_item->inst + second_pos + 1, userord_item->inst + second_pos,
449 (LY_ARRAY_COUNT(userord_item->inst) - second_pos) * sizeof *userord_item->inst);
450 }
451 LY_ARRAY_INCREMENT(userord_item->inst);
452 userord_item->inst[second_pos] = second;
453
454 } else if (*op == LYD_DIFF_OP_DELETE) {
455 /* remove the instance */
456 if (first_pos + 1 < LY_ARRAY_COUNT(userord_item->inst)) {
457 memmove(userord_item->inst + first_pos, userord_item->inst + first_pos + 1,
458 (LY_ARRAY_COUNT(userord_item->inst) - first_pos - 1) * sizeof *userord_item->inst);
459 }
460 LY_ARRAY_DECREMENT(userord_item->inst);
461
462 } else if (*op == LYD_DIFF_OP_REPLACE) {
463 /* move the instances */
464 memmove(userord_item->inst + second_pos + 1, userord_item->inst + second_pos,
465 (first_pos - second_pos) * sizeof *userord_item->inst);
466 userord_item->inst[second_pos] = first;
467 }
468
469 return LY_SUCCESS;
470}
471
472/**
473 * @brief Get all the metadata to be stored in a diff for the 2 nodes. Cannot be used for user-ordered
474 * lists/leaf-lists.
475 *
476 * @param[in] first Node from the first tree, can be NULL (on create).
477 * @param[in] second Node from the second tree, can be NULL (on delete).
478 * @param[in] options Diff options.
479 * @param[out] op Operation.
480 * @param[out] orig_default Original default metadata.
481 * @param[out] orig_value Original value metadata.
482 * @return LY_SUCCESS on success,
483 * @return LY_ENOT if there is no change to be added into diff,
484 * @return LY_ERR value on other errors.
485 */
486static LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +0200487lyd_diff_attrs(const struct lyd_node *first, const struct lyd_node *second, uint16_t options, enum lyd_diff_op *op,
Radek Krejci0f969882020-08-21 16:56:47 +0200488 const char **orig_default, char **orig_value)
Michal Vaskod59035b2020-07-08 12:00:06 +0200489{
490 const struct lysc_node *schema;
Michal Vasko6ea6fe22021-10-08 09:57:01 +0200491 const char *str_val;
Michal Vaskod59035b2020-07-08 12:00:06 +0200492
493 assert(first || second);
494
495 *orig_default = NULL;
496 *orig_value = NULL;
497
498 schema = first ? first->schema : second->schema;
499 assert(!lysc_is_userordered(schema));
500
501 /* learn operation first */
502 if (!second) {
503 *op = LYD_DIFF_OP_DELETE;
504 } else if (!first) {
505 *op = LYD_DIFF_OP_CREATE;
506 } else {
507 switch (schema->nodetype) {
508 case LYS_CONTAINER:
509 case LYS_RPC:
510 case LYS_ACTION:
511 case LYS_NOTIF:
512 /* no changes */
513 return LY_ENOT;
514 case LYS_LIST:
515 case LYS_LEAFLIST:
Michal Vasko3a41dff2020-07-15 14:30:28 +0200516 if ((options & LYD_DIFF_DEFAULTS) && ((first->flags & LYD_DEFAULT) != (second->flags & LYD_DEFAULT))) {
Michal Vaskod59035b2020-07-08 12:00:06 +0200517 /* default flag change */
518 *op = LYD_DIFF_OP_NONE;
519 } else {
520 /* no changes */
521 return LY_ENOT;
522 }
523 break;
524 case LYS_LEAF:
525 case LYS_ANYXML:
526 case LYS_ANYDATA:
Michal Vasko8f359bf2020-07-28 10:41:15 +0200527 if (lyd_compare_single(first, second, 0)) {
Michal Vaskod59035b2020-07-08 12:00:06 +0200528 /* different values */
529 *op = LYD_DIFF_OP_REPLACE;
Michal Vasko3a41dff2020-07-15 14:30:28 +0200530 } else if ((options & LYD_DIFF_DEFAULTS) && ((first->flags & LYD_DEFAULT) != (second->flags & LYD_DEFAULT))) {
Michal Vaskod59035b2020-07-08 12:00:06 +0200531 /* default flag change */
532 *op = LYD_DIFF_OP_NONE;
533 } else {
534 /* no changes */
535 return LY_ENOT;
536 }
537 break;
538 default:
539 LOGINT_RET(schema->module->ctx);
540 }
541 }
542
543 /*
544 * set each attribute correctly based on the operation and node type
545 */
546
547 /* orig-default */
Michal Vasko4b715ca2020-11-11 18:39:57 +0100548 if ((schema->nodetype & LYD_NODE_TERM) && ((*op == LYD_DIFF_OP_REPLACE) || (*op == LYD_DIFF_OP_NONE))) {
Michal Vaskod59035b2020-07-08 12:00:06 +0200549 if (first->flags & LYD_DEFAULT) {
550 *orig_default = "true";
551 } else {
552 *orig_default = "false";
553 }
554 }
555
556 /* orig-value */
Michal Vaskobaba84e2021-02-05 16:33:30 +0100557 if ((schema->nodetype & (LYS_LEAF | LYS_ANYDATA)) && (*op == LYD_DIFF_OP_REPLACE)) {
558 if (schema->nodetype == LYS_LEAF) {
Michal Vasko6ea6fe22021-10-08 09:57:01 +0200559 str_val = lyd_get_value(first);
560 *orig_value = strdup(str_val ? str_val : "");
Michal Vaskobaba84e2021-02-05 16:33:30 +0100561 LY_CHECK_ERR_RET(!*orig_value, LOGMEM(schema->module->ctx), LY_EMEM);
562 } else {
563 LY_CHECK_RET(lyd_any_value_str(first, orig_value));
564 }
Michal Vaskod59035b2020-07-08 12:00:06 +0200565 }
566
567 return LY_SUCCESS;
568}
569
570/**
Michal Vaskoe78faec2021-04-08 17:24:43 +0200571 * @brief Find a matching instance of a node in a data tree.
572 *
573 * @param[in] siblings Siblings to search in.
574 * @param[in] target Target node to search for.
575 * @param[in] defaults Whether to consider (or ignore) default values.
576 * @param[in,out] dup_inst_cache Duplicate instance cache.
577 * @param[out] match Found match, NULL if no matching node found.
578 * @return LY_ERR value.
579 */
580static LY_ERR
581lyd_diff_find_match(const struct lyd_node *siblings, const struct lyd_node *target, ly_bool defaults,
Michal Vaskod7c048c2021-05-18 16:12:55 +0200582 struct lyd_dup_inst **dup_inst_cache, struct lyd_node **match)
Michal Vaskoe78faec2021-04-08 17:24:43 +0200583{
Michal Vaskoe78faec2021-04-08 17:24:43 +0200584 if (target->schema->nodetype & (LYS_LIST | LYS_LEAFLIST)) {
585 /* try to find the exact instance */
586 lyd_find_sibling_first(siblings, target, match);
587 } else {
588 /* try to simply find the node, there cannot be more instances */
589 lyd_find_sibling_val(siblings, target->schema, NULL, 0, match);
590 }
591
Michal Vaskod7c048c2021-05-18 16:12:55 +0200592 /* update match as needed */
593 LY_CHECK_RET(lyd_dup_inst_next(match, siblings, dup_inst_cache));
Michal Vaskoe78faec2021-04-08 17:24:43 +0200594
595 if (*match && ((*match)->flags & LYD_DEFAULT) && !defaults) {
596 /* ignore default nodes */
597 *match = NULL;
598 }
599 return LY_SUCCESS;
600}
601
602/**
Michal Vaskod59035b2020-07-08 12:00:06 +0200603 * @brief Perform diff for all siblings at certain depth, recursively.
604 *
605 * For user-ordered lists/leaf-lists a specific structure is used for storing
606 * the current order. The idea is to apply all the generated diff changes
607 * virtually on the first tree so that we can continue to generate correct
608 * changes after some were already generated.
609 *
610 * The algorithm then uses second tree position-based changes with a before
611 * (preceding) item anchor.
612 *
613 * Example:
614 *
615 * Virtual first tree leaf-list order:
616 * 1 2 [3] 4 5
617 *
618 * Second tree leaf-list order:
619 * 1 2 [5] 3 4
620 *
621 * We are at the 3rd node now. We look at whether the nodes on the 3rd position
622 * match - they do not - move nodes so that the 3rd position node is final ->
623 * -> move node 5 to the 3rd position -> move node 5 after node 2.
624 *
625 * Required properties:
626 * Stored operations (move) should not be affected by later operations -
627 * - would cause a redundantly long list of operations, possibly inifinite.
628 *
629 * Implemenation justification:
630 * First, all delete operations and only then move/create operations are stored.
631 * Also, preceding anchor is used and after each iteration another node is
632 * at its final position. That results in the invariant that all preceding
633 * nodes are final and will not be changed by the later operations, meaning
634 * they can safely be used as anchors for the later operations.
635 *
636 * @param[in] first First tree first sibling.
637 * @param[in] second Second tree first sibling.
638 * @param[in] options Diff options.
Michal Vasko3a41dff2020-07-15 14:30:28 +0200639 * @param[in] nosiblings Whether to skip following siblings.
Michal Vaskod59035b2020-07-08 12:00:06 +0200640 * @param[in,out] diff Diff to append to.
641 * @return LY_ERR value.
642 */
643static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +0200644lyd_diff_siblings_r(const struct lyd_node *first, const struct lyd_node *second, uint16_t options, ly_bool nosiblings,
Radek Krejci0f969882020-08-21 16:56:47 +0200645 struct lyd_node **diff)
Michal Vaskod59035b2020-07-08 12:00:06 +0200646{
647 LY_ERR ret = LY_SUCCESS;
648 const struct lyd_node *iter_first, *iter_second;
649 struct lyd_node *match_second, *match_first;
Michal Vaskod59035b2020-07-08 12:00:06 +0200650 struct lyd_diff_userord *userord = NULL;
Michal Vaskod7c048c2021-05-18 16:12:55 +0200651 struct lyd_dup_inst *dup_inst_first = NULL, *dup_inst_second = NULL;
Michal Vaskod59035b2020-07-08 12:00:06 +0200652 LY_ARRAY_COUNT_TYPE u;
653 enum lyd_diff_op op;
654 const char *orig_default;
Michal Vaskoe78faec2021-04-08 17:24:43 +0200655 char *orig_value, *key, *value, *position, *orig_key, *orig_position;
Michal Vaskod59035b2020-07-08 12:00:06 +0200656
Michal Vaskod59035b2020-07-08 12:00:06 +0200657 /* compare first tree to the second tree - delete, replace, none */
658 LY_LIST_FOR(first, iter_first) {
Michal Vaskoc825ed72021-07-21 16:05:59 +0200659 if (!iter_first->schema) {
660 continue;
661 }
662
Michal Vaskod59035b2020-07-08 12:00:06 +0200663 assert(!(iter_first->schema->flags & LYS_KEY));
Michal Vasko3a41dff2020-07-15 14:30:28 +0200664 if ((iter_first->flags & LYD_DEFAULT) && !(options & LYD_DIFF_DEFAULTS)) {
Michal Vaskod59035b2020-07-08 12:00:06 +0200665 /* skip default nodes */
666 continue;
667 }
668
Michal Vaskoe78faec2021-04-08 17:24:43 +0200669 /* find a match in the second tree */
670 LY_CHECK_GOTO(ret = lyd_diff_find_match(second, iter_first, options & LYD_DIFF_DEFAULTS, &dup_inst_second,
671 &match_second), cleanup);
Michal Vaskod59035b2020-07-08 12:00:06 +0200672
673 if (lysc_is_userordered(iter_first->schema)) {
Michal Vaskoe78faec2021-04-08 17:24:43 +0200674 /* we are handling only user-ordered node delete now */
675 if (!match_second) {
676 /* get all the attributes */
677 LY_CHECK_GOTO(ret = lyd_diff_userord_attrs(iter_first, match_second, options, &userord, &op, &orig_default,
678 &value, &orig_value, &key, &orig_key, &position, &orig_position), cleanup);
679
680 /* there must be changes, it is deleted */
681 assert(op == LYD_DIFF_OP_DELETE);
682 ret = lyd_diff_add(iter_first, op, orig_default, orig_value, key, value, position, orig_key, orig_position, diff);
683
684 free(orig_value);
685 free(key);
686 free(value);
687 free(position);
688 free(orig_key);
689 free(orig_position);
690 LY_CHECK_GOTO(ret, cleanup);
Michal Vaskod59035b2020-07-08 12:00:06 +0200691 }
Michal Vaskod59035b2020-07-08 12:00:06 +0200692 } else {
693 /* get all the attributes */
694 ret = lyd_diff_attrs(iter_first, match_second, options, &op, &orig_default, &orig_value);
695
696 /* add into diff if there are any changes */
697 if (!ret) {
698 if (op == LYD_DIFF_OP_DELETE) {
Michal Vaskoe78faec2021-04-08 17:24:43 +0200699 ret = lyd_diff_add(iter_first, op, orig_default, orig_value, NULL, NULL, NULL, NULL, NULL, diff);
Michal Vaskod59035b2020-07-08 12:00:06 +0200700 } else {
Michal Vasko3c2dd6c2020-11-06 17:38:55 +0100701 assert(match_second);
Michal Vaskoe78faec2021-04-08 17:24:43 +0200702 ret = lyd_diff_add(match_second, op, orig_default, orig_value, NULL, NULL, NULL, NULL, NULL, diff);
Michal Vaskod59035b2020-07-08 12:00:06 +0200703 }
704
705 free(orig_value);
706 LY_CHECK_GOTO(ret, cleanup);
707 } else if (ret == LY_ENOT) {
708 ret = LY_SUCCESS;
709 } else {
710 goto cleanup;
711 }
712 }
713
714 /* check descendants, if any, recursively */
715 if (match_second) {
Michal Vaskoe78faec2021-04-08 17:24:43 +0200716 LY_CHECK_GOTO(ret = lyd_diff_siblings_r(lyd_child_no_keys(iter_first), lyd_child_no_keys(match_second),
717 options, 0, diff), cleanup);
Michal Vaskod59035b2020-07-08 12:00:06 +0200718 }
719
720 if (nosiblings) {
721 break;
722 }
723 }
724
725 /* reset all cached positions */
726 LY_ARRAY_FOR(userord, u) {
727 userord[u].pos = 0;
728 }
729
730 /* compare second tree to the first tree - create, user-ordered move */
731 LY_LIST_FOR(second, iter_second) {
Michal Vaskoc825ed72021-07-21 16:05:59 +0200732 if (!iter_second->schema) {
733 continue;
734 }
735
Michal Vaskod59035b2020-07-08 12:00:06 +0200736 assert(!(iter_second->schema->flags & LYS_KEY));
Michal Vasko3a41dff2020-07-15 14:30:28 +0200737 if ((iter_second->flags & LYD_DEFAULT) && !(options & LYD_DIFF_DEFAULTS)) {
Michal Vaskod59035b2020-07-08 12:00:06 +0200738 /* skip default nodes */
739 continue;
740 }
741
Michal Vaskoe78faec2021-04-08 17:24:43 +0200742 /* find a match in the first tree */
743 LY_CHECK_GOTO(ret = lyd_diff_find_match(first, iter_second, options & LYD_DIFF_DEFAULTS, &dup_inst_first,
744 &match_first), cleanup);
Michal Vaskod59035b2020-07-08 12:00:06 +0200745
746 if (lysc_is_userordered(iter_second->schema)) {
747 /* get all the attributes */
748 ret = lyd_diff_userord_attrs(match_first, iter_second, options, &userord, &op, &orig_default,
Michal Vaskoe78faec2021-04-08 17:24:43 +0200749 &value, &orig_value, &key, &orig_key, &position, &orig_position);
Michal Vaskod59035b2020-07-08 12:00:06 +0200750
751 /* add into diff if there are any changes */
752 if (!ret) {
Michal Vaskoe78faec2021-04-08 17:24:43 +0200753 ret = lyd_diff_add(iter_second, op, orig_default, orig_value, key, value, position, orig_key,
754 orig_position, diff);
Michal Vaskod59035b2020-07-08 12:00:06 +0200755
756 free(orig_value);
757 free(key);
758 free(value);
Michal Vaskoe78faec2021-04-08 17:24:43 +0200759 free(position);
Michal Vaskod59035b2020-07-08 12:00:06 +0200760 free(orig_key);
Michal Vaskoe78faec2021-04-08 17:24:43 +0200761 free(orig_position);
Michal Vaskod59035b2020-07-08 12:00:06 +0200762 LY_CHECK_GOTO(ret, cleanup);
763 } else if (ret == LY_ENOT) {
764 ret = LY_SUCCESS;
765 } else {
766 goto cleanup;
767 }
768 } else if (!match_first) {
769 /* get all the attributes */
Michal Vaskoe78faec2021-04-08 17:24:43 +0200770 LY_CHECK_GOTO(ret = lyd_diff_attrs(match_first, iter_second, options, &op, &orig_default, &orig_value), cleanup);
Michal Vaskod59035b2020-07-08 12:00:06 +0200771
772 /* there must be changes, it is created */
773 assert(op == LYD_DIFF_OP_CREATE);
Michal Vaskoe78faec2021-04-08 17:24:43 +0200774 ret = lyd_diff_add(iter_second, op, orig_default, orig_value, NULL, NULL, NULL, NULL, NULL, diff);
Michal Vaskod59035b2020-07-08 12:00:06 +0200775
776 free(orig_value);
777 LY_CHECK_GOTO(ret, cleanup);
778 } /* else was handled */
779
780 if (nosiblings) {
781 break;
782 }
783 }
784
785cleanup:
Michal Vaskod7c048c2021-05-18 16:12:55 +0200786 lyd_dup_inst_free(dup_inst_first);
787 lyd_dup_inst_free(dup_inst_second);
Michal Vaskod59035b2020-07-08 12:00:06 +0200788 LY_ARRAY_FOR(userord, u) {
789 LY_ARRAY_FREE(userord[u].inst);
790 }
791 LY_ARRAY_FREE(userord);
792 return ret;
793}
794
Michal Vasko3a41dff2020-07-15 14:30:28 +0200795static LY_ERR
Radek Krejci857189e2020-09-01 13:26:36 +0200796lyd_diff(const struct lyd_node *first, const struct lyd_node *second, uint16_t options, ly_bool nosiblings, struct lyd_node **diff)
Michal Vaskod59035b2020-07-08 12:00:06 +0200797{
798 const struct ly_ctx *ctx;
799
800 LY_CHECK_ARG_RET(NULL, diff, LY_EINVAL);
801
802 if (first) {
Michal Vaskob7be7a82020-08-20 09:09:04 +0200803 ctx = LYD_CTX(first);
Michal Vaskod59035b2020-07-08 12:00:06 +0200804 } else if (second) {
Michal Vaskob7be7a82020-08-20 09:09:04 +0200805 ctx = LYD_CTX(second);
Michal Vaskod59035b2020-07-08 12:00:06 +0200806 } else {
807 ctx = NULL;
808 }
809
810 if (first && second && (lysc_data_parent(first->schema) != lysc_data_parent(second->schema))) {
811 LOGERR(ctx, LY_EINVAL, "Invalid arguments - cannot create diff for unrelated data (%s()).", __func__);
812 return LY_EINVAL;
813 }
814
815 *diff = NULL;
816
Michal Vasko3a41dff2020-07-15 14:30:28 +0200817 return lyd_diff_siblings_r(first, second, options, nosiblings, diff);
818}
819
Jan Kundrátc6e39de2021-12-09 16:01:19 +0100820LIBYANG_API_DEF LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +0200821lyd_diff_tree(const struct lyd_node *first, const struct lyd_node *second, uint16_t options, struct lyd_node **diff)
Michal Vasko3a41dff2020-07-15 14:30:28 +0200822{
823 return lyd_diff(first, second, options, 1, diff);
824}
825
Jan Kundrátc6e39de2021-12-09 16:01:19 +0100826LIBYANG_API_DEF LY_ERR
Radek Krejci1deb5be2020-08-26 16:43:36 +0200827lyd_diff_siblings(const struct lyd_node *first, const struct lyd_node *second, uint16_t options, struct lyd_node **diff)
Michal Vasko3a41dff2020-07-15 14:30:28 +0200828{
829 return lyd_diff(first, second, options, 0, diff);
Michal Vaskod59035b2020-07-08 12:00:06 +0200830}
831
832/**
Michal Vaskod59035b2020-07-08 12:00:06 +0200833 * @brief Learn operation of a diff node.
834 *
835 * @param[in] diff_node Diff node.
836 * @param[out] op Operation.
Michal Vaskod59035b2020-07-08 12:00:06 +0200837 * @return LY_ERR value.
838 */
839static LY_ERR
Michal Vaskoe6323f62020-07-09 15:49:02 +0200840lyd_diff_get_op(const struct lyd_node *diff_node, enum lyd_diff_op *op)
Michal Vaskod59035b2020-07-08 12:00:06 +0200841{
842 struct lyd_meta *meta = NULL;
843 const struct lyd_node *diff_parent;
Michal Vaskoe6323f62020-07-09 15:49:02 +0200844 const char *str;
Michal Vasko10765282022-01-18 14:08:34 +0100845 char *path;
Michal Vaskod59035b2020-07-08 12:00:06 +0200846
Michal Vasko9e685082021-01-29 14:49:09 +0100847 for (diff_parent = diff_node; diff_parent; diff_parent = lyd_parent(diff_parent)) {
Michal Vaskod59035b2020-07-08 12:00:06 +0200848 LY_LIST_FOR(diff_parent->meta, meta) {
849 if (!strcmp(meta->name, "operation") && !strcmp(meta->annotation->module->name, "yang")) {
Radek Krejci6d5ba0c2021-04-26 07:49:59 +0200850 str = lyd_get_meta_value(meta);
Michal Vaskod59035b2020-07-08 12:00:06 +0200851 if ((str[0] == 'r') && (diff_parent != diff_node)) {
852 /* we do not care about this operation if it's in our parent */
853 continue;
854 }
Michal Vaskoe6323f62020-07-09 15:49:02 +0200855 *op = lyd_diff_str2op(str);
Michal Vaskod59035b2020-07-08 12:00:06 +0200856 break;
857 }
858 }
859 if (meta) {
860 break;
861 }
862 }
Michal Vasko10765282022-01-18 14:08:34 +0100863
864 if (!meta) {
865 path = lyd_path(diff_node, LYD_PATH_STD, NULL, 0);
866 LOGERR(LYD_CTX(diff_node), LY_EINVAL, "Node \"%s\" without an operation.", path);
867 free(path);
868 return LY_EINT;
869 }
Michal Vaskod59035b2020-07-08 12:00:06 +0200870
Michal Vaskod59035b2020-07-08 12:00:06 +0200871 return LY_SUCCESS;
872}
873
874/**
875 * @brief Insert a diff node into a data tree.
876 *
877 * @param[in,out] first_node First sibling of the data tree.
878 * @param[in] parent_node Data tree sibling parent node.
879 * @param[in] new_node Node to insert.
Michal Vaskoe78faec2021-04-08 17:24:43 +0200880 * @param[in] userord_anchor Optional anchor (key, value, or position) of relative (leaf-)list instance. If not set,
881 * the user-ordered instance will be inserted at the first position.
Michal Vaskod59035b2020-07-08 12:00:06 +0200882 * @return err_info, NULL on success.
883 */
884static LY_ERR
885lyd_diff_insert(struct lyd_node **first_node, struct lyd_node *parent_node, struct lyd_node *new_node,
Michal Vaskoe78faec2021-04-08 17:24:43 +0200886 const char *userord_anchor)
Michal Vaskod59035b2020-07-08 12:00:06 +0200887{
888 LY_ERR ret;
889 struct lyd_node *anchor;
Michal Vaskoe78faec2021-04-08 17:24:43 +0200890 uint32_t pos, anchor_pos;
891 int found;
Michal Vaskod59035b2020-07-08 12:00:06 +0200892
893 assert(new_node);
894
895 if (!*first_node) {
896 if (!parent_node) {
897 /* no parent or siblings */
898 *first_node = new_node;
899 return LY_SUCCESS;
900 }
901
902 /* simply insert into parent, no other children */
Michal Vaskoe78faec2021-04-08 17:24:43 +0200903 if (userord_anchor) {
Michal Vaskob7be7a82020-08-20 09:09:04 +0200904 LOGERR(LYD_CTX(new_node), LY_EINVAL, "Node \"%s\" instance to insert next to not found.",
Michal Vasko69730152020-10-09 16:30:07 +0200905 new_node->schema->name);
Michal Vaskod59035b2020-07-08 12:00:06 +0200906 return LY_EINVAL;
907 }
Michal Vaskob104f112020-07-17 09:54:54 +0200908 return lyd_insert_child(parent_node, new_node);
Michal Vaskod59035b2020-07-08 12:00:06 +0200909 }
910
Michal Vasko9e685082021-01-29 14:49:09 +0100911 assert(!(*first_node)->parent || (lyd_parent(*first_node) == parent_node));
Michal Vaskod59035b2020-07-08 12:00:06 +0200912
Michal Vaskod59035b2020-07-08 12:00:06 +0200913 if (!lysc_is_userordered(new_node->schema)) {
Michal Vaskob104f112020-07-17 09:54:54 +0200914 /* simple insert */
915 return lyd_insert_sibling(*first_node, new_node, first_node);
Michal Vaskod59035b2020-07-08 12:00:06 +0200916 }
917
Michal Vaskoe78faec2021-04-08 17:24:43 +0200918 if (userord_anchor) {
Michal Vaskod59035b2020-07-08 12:00:06 +0200919 /* find the anchor sibling */
Michal Vaskoe78faec2021-04-08 17:24:43 +0200920 if (lysc_is_dup_inst_list(new_node->schema)) {
921 anchor_pos = atoi(userord_anchor);
922 LY_CHECK_ERR_RET(!anchor_pos, LOGINT(LYD_CTX(new_node)), LY_EINT);
923
924 found = 0;
925 pos = 1;
926 LYD_LIST_FOR_INST(*first_node, new_node->schema, anchor) {
927 if (pos == anchor_pos) {
928 found = 1;
929 break;
930 }
931 ++pos;
932 }
933 if (!found) {
934 LOGERR(LYD_CTX(new_node), LY_EINVAL, "Node \"%s\" instance to insert next to not found.",
935 new_node->schema->name);
936 return LY_EINVAL;
937 }
938 } else {
939 ret = lyd_find_sibling_val(*first_node, new_node->schema, userord_anchor, 0, &anchor);
940 if (ret == LY_ENOTFOUND) {
941 LOGERR(LYD_CTX(new_node), LY_EINVAL, "Node \"%s\" instance to insert next to not found.",
942 new_node->schema->name);
943 return LY_EINVAL;
944 } else if (ret) {
945 return ret;
946 }
Michal Vaskod59035b2020-07-08 12:00:06 +0200947 }
948
949 /* insert after */
950 LY_CHECK_RET(lyd_insert_after(anchor, new_node));
951 assert(new_node->prev == anchor);
952 if (*first_node == new_node) {
953 *first_node = anchor;
954 }
955 } else {
956 if ((*first_node)->schema->flags & LYS_KEY) {
957 assert(parent_node && (parent_node->schema->nodetype == LYS_LIST));
958
959 /* find last key */
960 anchor = *first_node;
961 while (anchor->next && (anchor->next->schema->flags & LYS_KEY)) {
962 anchor = anchor->next;
963 }
964 /* insert after the last key */
965 LY_CHECK_RET(lyd_insert_after(anchor, new_node));
966 } else {
967 /* insert at the beginning */
968 LY_CHECK_RET(lyd_insert_before(*first_node, new_node));
969 *first_node = new_node;
970 }
971 }
972
973 return LY_SUCCESS;
974}
975
976/**
977 * @brief Apply diff subtree on data tree nodes, recursively.
978 *
979 * @param[in,out] first_node First sibling of the data tree.
980 * @param[in] parent_node Parent of the first sibling.
981 * @param[in] diff_node Current diff node.
Michal Vaskoe6323f62020-07-09 15:49:02 +0200982 * @param[in] diff_cb Optional diff callback.
983 * @param[in] cb_data User data for @p diff_cb.
Michal Vaskoe78faec2021-04-08 17:24:43 +0200984 * @param[in,out] dup_inst Duplicate instance cache for all @p diff_node siblings.
Michal Vaskod59035b2020-07-08 12:00:06 +0200985 * @return LY_ERR value.
986 */
987static LY_ERR
988lyd_diff_apply_r(struct lyd_node **first_node, struct lyd_node *parent_node, const struct lyd_node *diff_node,
Michal Vaskod7c048c2021-05-18 16:12:55 +0200989 lyd_diff_cb diff_cb, void *cb_data, struct lyd_dup_inst **dup_inst)
Michal Vaskod59035b2020-07-08 12:00:06 +0200990{
991 LY_ERR ret;
992 struct lyd_node *match, *diff_child;
Michal Vaskoe78faec2021-04-08 17:24:43 +0200993 const char *str_val, *meta_str;
Michal Vaskoe6323f62020-07-09 15:49:02 +0200994 enum lyd_diff_op op;
995 struct lyd_meta *meta;
Michal Vaskod7c048c2021-05-18 16:12:55 +0200996 struct lyd_dup_inst *child_dup_inst = NULL;
Michal Vaskob7be7a82020-08-20 09:09:04 +0200997 const struct ly_ctx *ctx = LYD_CTX(diff_node);
Michal Vaskod59035b2020-07-08 12:00:06 +0200998
999 /* read all the valid attributes */
Michal Vaskoe6323f62020-07-09 15:49:02 +02001000 LY_CHECK_RET(lyd_diff_get_op(diff_node, &op));
Michal Vaskod59035b2020-07-08 12:00:06 +02001001
Michal Vaskoe6323f62020-07-09 15:49:02 +02001002 /* handle specific user-ordered (leaf-)lists operations separately */
1003 if (lysc_is_userordered(diff_node->schema) && ((op == LYD_DIFF_OP_CREATE) || (op == LYD_DIFF_OP_REPLACE))) {
1004 if (op == LYD_DIFF_OP_REPLACE) {
Michal Vaskod59035b2020-07-08 12:00:06 +02001005 /* find the node (we must have some siblings because the node was only moved) */
Michal Vaskoe78faec2021-04-08 17:24:43 +02001006 LY_CHECK_RET(lyd_diff_find_match(*first_node, diff_node, 1, dup_inst, &match));
Michal Vasko10765282022-01-18 14:08:34 +01001007 LY_CHECK_ERR_RET(!match, LOGERR_NOINST(ctx, diff_node), LY_EINVAL);
Michal Vaskod59035b2020-07-08 12:00:06 +02001008 } else {
Michal Vasko3a41dff2020-07-15 14:30:28 +02001009 /* duplicate the node */
1010 LY_CHECK_RET(lyd_dup_single(diff_node, NULL, LYD_DUP_NO_META, &match));
Michal Vaskod59035b2020-07-08 12:00:06 +02001011 }
1012
Michal Vaskoe78faec2021-04-08 17:24:43 +02001013 /* get "key", "value", or "position" metadata string value */
1014 if (lysc_is_dup_inst_list(diff_node->schema)) {
1015 meta_str = "yang:position";
1016 } else if (diff_node->schema->nodetype == LYS_LIST) {
1017 meta_str = "yang:key";
1018 } else {
1019 meta_str = "yang:value";
1020 }
1021 meta = lyd_find_meta(diff_node->meta, NULL, meta_str);
Michal Vasko10765282022-01-18 14:08:34 +01001022 LY_CHECK_ERR_RET(!meta, LOGERR_META(ctx, meta_str, diff_node), LY_EINVAL);
Radek Krejci6d5ba0c2021-04-26 07:49:59 +02001023 str_val = lyd_get_meta_value(meta);
Michal Vaskoe6323f62020-07-09 15:49:02 +02001024
Michal Vaskod59035b2020-07-08 12:00:06 +02001025 /* insert/move the node */
Michal Vaskoe6323f62020-07-09 15:49:02 +02001026 if (str_val[0]) {
1027 ret = lyd_diff_insert(first_node, parent_node, match, str_val);
Michal Vaskod59035b2020-07-08 12:00:06 +02001028 } else {
1029 ret = lyd_diff_insert(first_node, parent_node, match, NULL);
1030 }
1031 if (ret) {
Michal Vaskoe6323f62020-07-09 15:49:02 +02001032 if (op == LYD_DIFF_OP_CREATE) {
Michal Vaskod59035b2020-07-08 12:00:06 +02001033 lyd_free_tree(match);
1034 }
1035 return ret;
1036 }
1037
1038 goto next_iter_r;
1039 }
1040
1041 /* apply operation */
Michal Vaskoe6323f62020-07-09 15:49:02 +02001042 switch (op) {
1043 case LYD_DIFF_OP_NONE:
Michal Vaskod59035b2020-07-08 12:00:06 +02001044 /* find the node */
Michal Vaskoe78faec2021-04-08 17:24:43 +02001045 LY_CHECK_RET(lyd_diff_find_match(*first_node, diff_node, 1, dup_inst, &match));
Michal Vasko10765282022-01-18 14:08:34 +01001046 LY_CHECK_ERR_RET(!match, LOGERR_NOINST(ctx, diff_node), LY_EINVAL);
Michal Vaskod59035b2020-07-08 12:00:06 +02001047
1048 if (match->schema->nodetype & LYD_NODE_TERM) {
1049 /* special case of only dflt flag change */
1050 if (diff_node->flags & LYD_DEFAULT) {
1051 match->flags |= LYD_DEFAULT;
1052 } else {
1053 match->flags &= ~LYD_DEFAULT;
1054 }
1055 } else {
1056 /* none operation on nodes without children is redundant and hence forbidden */
Radek Krejcia1c1e542020-09-29 16:06:52 +02001057 if (!lyd_child_no_keys(diff_node)) {
Michal Vaskod59035b2020-07-08 12:00:06 +02001058 LOGINT_RET(ctx);
1059 }
1060 }
1061 break;
Michal Vaskoe6323f62020-07-09 15:49:02 +02001062 case LYD_DIFF_OP_CREATE:
Michal Vaskod59035b2020-07-08 12:00:06 +02001063 /* duplicate the node */
Michal Vasko3a41dff2020-07-15 14:30:28 +02001064 LY_CHECK_RET(lyd_dup_single(diff_node, NULL, LYD_DUP_NO_META, &match));
Michal Vaskod59035b2020-07-08 12:00:06 +02001065
1066 /* insert it at the end */
1067 ret = 0;
Michal Vaskob104f112020-07-17 09:54:54 +02001068 if (parent_node) {
1069 ret = lyd_insert_child(parent_node, match);
Michal Vaskod59035b2020-07-08 12:00:06 +02001070 } else {
Michal Vaskob104f112020-07-17 09:54:54 +02001071 ret = lyd_insert_sibling(*first_node, match, first_node);
Michal Vaskod59035b2020-07-08 12:00:06 +02001072 }
1073 if (ret) {
1074 lyd_free_tree(match);
1075 return ret;
1076 }
1077
1078 break;
Michal Vaskoe6323f62020-07-09 15:49:02 +02001079 case LYD_DIFF_OP_DELETE:
Michal Vaskod59035b2020-07-08 12:00:06 +02001080 /* find the node */
Michal Vaskoe78faec2021-04-08 17:24:43 +02001081 LY_CHECK_RET(lyd_diff_find_match(*first_node, diff_node, 1, dup_inst, &match));
Michal Vasko10765282022-01-18 14:08:34 +01001082 LY_CHECK_ERR_RET(!match, LOGERR_NOINST(ctx, diff_node), LY_EINVAL);
Michal Vaskod59035b2020-07-08 12:00:06 +02001083
1084 /* remove it */
1085 if ((match == *first_node) && !match->parent) {
1086 assert(!parent_node);
1087 /* we have removed the top-level node */
1088 *first_node = (*first_node)->next;
1089 }
1090 lyd_free_tree(match);
1091
1092 /* we are not going recursively in this case, the whole subtree was already deleted */
1093 return LY_SUCCESS;
Michal Vaskoe6323f62020-07-09 15:49:02 +02001094 case LYD_DIFF_OP_REPLACE:
Michal Vaskobaba84e2021-02-05 16:33:30 +01001095 LY_CHECK_ERR_RET(!(diff_node->schema->nodetype & (LYS_LEAF | LYS_ANYDATA)), LOGINT(ctx), LY_EINT);
Michal Vaskod59035b2020-07-08 12:00:06 +02001096
1097 /* find the node */
Michal Vaskoe78faec2021-04-08 17:24:43 +02001098 LY_CHECK_RET(lyd_diff_find_match(*first_node, diff_node, 1, dup_inst, &match));
Michal Vasko10765282022-01-18 14:08:34 +01001099 LY_CHECK_ERR_RET(!match, LOGERR_NOINST(ctx, diff_node), LY_EINVAL);
Michal Vaskod59035b2020-07-08 12:00:06 +02001100
Michal Vaskobaba84e2021-02-05 16:33:30 +01001101 /* update the value */
1102 if (diff_node->schema->nodetype == LYS_LEAF) {
Radek Krejci6d5ba0c2021-04-26 07:49:59 +02001103 ret = lyd_change_term(match, lyd_get_value(diff_node));
Michal Vasko10765282022-01-18 14:08:34 +01001104 LY_CHECK_ERR_RET(ret && (ret != LY_EEXIST), LOGERR_UNEXPVAL(ctx, match, "data"), LY_EINVAL);
Michal Vaskobaba84e2021-02-05 16:33:30 +01001105 } else {
1106 struct lyd_node_any *any = (struct lyd_node_any *)diff_node;
Michal Vaskoe78faec2021-04-08 17:24:43 +02001107 LY_CHECK_RET(lyd_any_copy_value(match, &any->value, any->value_type));
Michal Vaskod59035b2020-07-08 12:00:06 +02001108 }
1109
1110 /* with flags */
1111 match->flags = diff_node->flags;
1112 break;
1113 default:
1114 LOGINT_RET(ctx);
1115 }
1116
1117next_iter_r:
1118 if (diff_cb) {
1119 /* call callback */
1120 LY_CHECK_RET(diff_cb(diff_node, match, cb_data));
1121 }
1122
1123 /* apply diff recursively */
Michal Vaskoe78faec2021-04-08 17:24:43 +02001124 ret = LY_SUCCESS;
Radek Krejcia1c1e542020-09-29 16:06:52 +02001125 LY_LIST_FOR(lyd_child_no_keys(diff_node), diff_child) {
Michal Vaskoe78faec2021-04-08 17:24:43 +02001126 ret = lyd_diff_apply_r(lyd_node_child_p(match), match, diff_child, diff_cb, cb_data, &child_dup_inst);
1127 if (ret) {
1128 break;
1129 }
Michal Vaskod59035b2020-07-08 12:00:06 +02001130 }
1131
Michal Vaskod7c048c2021-05-18 16:12:55 +02001132 lyd_dup_inst_free(child_dup_inst);
Michal Vaskoe78faec2021-04-08 17:24:43 +02001133 return ret;
Michal Vaskod59035b2020-07-08 12:00:06 +02001134}
1135
Jan Kundrátc6e39de2021-12-09 16:01:19 +01001136LIBYANG_API_DEF LY_ERR
Michal Vaskod59035b2020-07-08 12:00:06 +02001137lyd_diff_apply_module(struct lyd_node **data, const struct lyd_node *diff, const struct lys_module *mod,
Radek Krejci0f969882020-08-21 16:56:47 +02001138 lyd_diff_cb diff_cb, void *cb_data)
Michal Vaskod59035b2020-07-08 12:00:06 +02001139{
1140 const struct lyd_node *root;
Michal Vaskod7c048c2021-05-18 16:12:55 +02001141 struct lyd_dup_inst *dup_inst = NULL;
Michal Vaskoe78faec2021-04-08 17:24:43 +02001142 LY_ERR ret = LY_SUCCESS;
Michal Vaskod59035b2020-07-08 12:00:06 +02001143
1144 LY_LIST_FOR(diff, root) {
1145 if (mod && (lyd_owner_module(root) != mod)) {
1146 /* skip data nodes from different modules */
1147 continue;
1148 }
1149
1150 /* apply relevant nodes from the diff datatree */
Michal Vaskoe78faec2021-04-08 17:24:43 +02001151 ret = lyd_diff_apply_r(data, NULL, root, diff_cb, cb_data, &dup_inst);
1152 if (ret) {
1153 break;
1154 }
Michal Vaskod59035b2020-07-08 12:00:06 +02001155 }
1156
Michal Vaskod7c048c2021-05-18 16:12:55 +02001157 lyd_dup_inst_free(dup_inst);
Michal Vaskoe78faec2021-04-08 17:24:43 +02001158 return ret;
Michal Vaskod59035b2020-07-08 12:00:06 +02001159}
1160
Jan Kundrátc6e39de2021-12-09 16:01:19 +01001161LIBYANG_API_DEF LY_ERR
Michal Vasko3a41dff2020-07-15 14:30:28 +02001162lyd_diff_apply_all(struct lyd_node **data, const struct lyd_node *diff)
Michal Vaskod59035b2020-07-08 12:00:06 +02001163{
1164 return lyd_diff_apply_module(data, diff, NULL, NULL, NULL);
1165}
Michal Vaskoe6323f62020-07-09 15:49:02 +02001166
1167/**
1168 * @brief Update operations on a diff node when the new operation is NONE.
1169 *
1170 * @param[in] diff_match Node from the diff.
Michal Vaskoe78faec2021-04-08 17:24:43 +02001171 * @param[in] cur_op Current operation of @p diff_match.
Michal Vaskoe6323f62020-07-09 15:49:02 +02001172 * @param[in] src_diff Current source diff node.
1173 * @return LY_ERR value.
1174 */
1175static LY_ERR
1176lyd_diff_merge_none(struct lyd_node *diff_match, enum lyd_diff_op cur_op, const struct lyd_node *src_diff)
1177{
1178 switch (cur_op) {
1179 case LYD_DIFF_OP_NONE:
1180 case LYD_DIFF_OP_CREATE:
1181 case LYD_DIFF_OP_REPLACE:
1182 if (src_diff->schema->nodetype & LYD_NODE_TERM) {
1183 /* NONE on a term means only its dflt flag was changed */
1184 diff_match->flags &= ~LYD_DEFAULT;
1185 diff_match->flags |= src_diff->flags & LYD_DEFAULT;
1186 }
1187 break;
1188 default:
1189 /* delete operation is not valid */
Michal Vasko10765282022-01-18 14:08:34 +01001190 LOGERR_MERGEOP(LYD_CTX(diff_match), diff_match, cur_op, LYD_DIFF_OP_NONE);
1191 return LY_EINVAL;
Michal Vaskoe6323f62020-07-09 15:49:02 +02001192 }
1193
1194 return LY_SUCCESS;
1195}
1196
1197/**
1198 * @brief Remove an attribute from a node.
1199 *
1200 * @param[in] node Node with the metadata.
1201 * @param[in] name Metadata name.
1202 */
1203static void
1204lyd_diff_del_meta(struct lyd_node *node, const char *name)
1205{
1206 struct lyd_meta *meta;
1207
1208 LY_LIST_FOR(node->meta, meta) {
1209 if (!strcmp(meta->name, name) && !strcmp(meta->annotation->module->name, "yang")) {
Michal Vasko3a41dff2020-07-15 14:30:28 +02001210 lyd_free_meta_single(meta);
Michal Vaskoe6323f62020-07-09 15:49:02 +02001211 return;
1212 }
1213 }
1214
1215 assert(0);
1216}
1217
1218/**
1219 * @brief Set a specific operation of a node. Delete the previous operation, if any.
Michal Vasko871a0252020-11-11 18:35:24 +01001220 * Does not change the default flag.
Michal Vaskoe6323f62020-07-09 15:49:02 +02001221 *
1222 * @param[in] node Node to change.
1223 * @param[in] op Operation to set.
1224 * @return LY_ERR value.
1225 */
1226static LY_ERR
1227lyd_diff_change_op(struct lyd_node *node, enum lyd_diff_op op)
1228{
1229 struct lyd_meta *meta;
1230
1231 LY_LIST_FOR(node->meta, meta) {
1232 if (!strcmp(meta->name, "operation") && !strcmp(meta->annotation->module->name, "yang")) {
Michal Vasko3a41dff2020-07-15 14:30:28 +02001233 lyd_free_meta_single(meta);
Michal Vaskoe6323f62020-07-09 15:49:02 +02001234 break;
1235 }
1236 }
1237
Michal Vasko871a0252020-11-11 18:35:24 +01001238 return lyd_new_meta(LYD_CTX(node), node, NULL, "yang:operation", lyd_diff_op2str(op), 0, NULL);
Michal Vaskoe6323f62020-07-09 15:49:02 +02001239}
1240
1241/**
1242 * @brief Update operations on a diff node when the new operation is REPLACE.
1243 *
1244 * @param[in] diff_match Node from the diff.
Michal Vaskoe78faec2021-04-08 17:24:43 +02001245 * @param[in] cur_op Current operation of @p diff_match.
Michal Vaskoe6323f62020-07-09 15:49:02 +02001246 * @param[in] src_diff Current source diff node.
1247 * @return LY_ERR value.
1248 */
1249static LY_ERR
1250lyd_diff_merge_replace(struct lyd_node *diff_match, enum lyd_diff_op cur_op, const struct lyd_node *src_diff)
1251{
1252 LY_ERR ret;
Michal Vaskoe78faec2021-04-08 17:24:43 +02001253 const char *str_val, *meta_name, *orig_meta_name;
Michal Vaskoe6323f62020-07-09 15:49:02 +02001254 struct lyd_meta *meta;
1255 const struct lys_module *mod;
1256 const struct lyd_node_any *any;
Michal Vasko10765282022-01-18 14:08:34 +01001257 const struct ly_ctx *ctx = LYD_CTX(diff_match);
Michal Vaskoe6323f62020-07-09 15:49:02 +02001258
1259 /* get "yang" module for the metadata */
Michal Vaskob7be7a82020-08-20 09:09:04 +02001260 mod = ly_ctx_get_module_latest(LYD_CTX(diff_match), "yang");
Michal Vaskoe6323f62020-07-09 15:49:02 +02001261 assert(mod);
1262
1263 switch (cur_op) {
1264 case LYD_DIFF_OP_REPLACE:
1265 case LYD_DIFF_OP_CREATE:
1266 switch (diff_match->schema->nodetype) {
1267 case LYS_LIST:
1268 case LYS_LEAFLIST:
Michal Vasko4231fb62020-07-13 13:54:47 +02001269 /* it was created/moved somewhere, but now it will be created/moved somewhere else,
Michal Vaskoe6323f62020-07-09 15:49:02 +02001270 * keep orig_key/orig_value (only replace oper) and replace key/value */
1271 assert(lysc_is_userordered(diff_match->schema));
Michal Vaskoe78faec2021-04-08 17:24:43 +02001272 if (lysc_is_dup_inst_list(diff_match->schema)) {
1273 meta_name = "position";
1274 } else if (diff_match->schema->nodetype == LYS_LIST) {
1275 meta_name = "key";
1276 } else {
1277 meta_name = "value";
1278 }
Michal Vaskoe6323f62020-07-09 15:49:02 +02001279
1280 lyd_diff_del_meta(diff_match, meta_name);
1281 meta = lyd_find_meta(src_diff->meta, mod, meta_name);
Michal Vasko10765282022-01-18 14:08:34 +01001282 LY_CHECK_ERR_RET(!meta, LOGERR_META(ctx, meta_name, src_diff), LY_EINVAL);
Michal Vasko3a41dff2020-07-15 14:30:28 +02001283 LY_CHECK_RET(lyd_dup_meta_single(meta, diff_match, NULL));
Michal Vaskoe6323f62020-07-09 15:49:02 +02001284 break;
1285 case LYS_LEAF:
1286 /* replaced with the exact same value, impossible */
Michal Vasko8f359bf2020-07-28 10:41:15 +02001287 if (!lyd_compare_single(diff_match, src_diff, 0)) {
Michal Vasko10765282022-01-18 14:08:34 +01001288 LOGERR_UNEXPVAL(ctx, diff_match, "target diff");
1289 return LY_EINVAL;
Michal Vaskoe6323f62020-07-09 15:49:02 +02001290 }
1291
Michal Vaskoe6323f62020-07-09 15:49:02 +02001292 /* modify the node value */
Radek Krejci6d5ba0c2021-04-26 07:49:59 +02001293 if (lyd_change_term(diff_match, lyd_get_value(src_diff))) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001294 LOGINT_RET(LYD_CTX(src_diff));
Michal Vaskoe6323f62020-07-09 15:49:02 +02001295 }
1296
Michal Vasko8caadab2020-11-05 17:38:15 +01001297 if (cur_op == LYD_DIFF_OP_REPLACE) {
1298 /* compare values whether there is any change at all */
1299 meta = lyd_find_meta(diff_match->meta, mod, "orig-value");
Michal Vasko10765282022-01-18 14:08:34 +01001300 LY_CHECK_ERR_RET(!meta, LOGERR_META(ctx, "orig-value", diff_match), LY_EINVAL);
Radek Krejci6d5ba0c2021-04-26 07:49:59 +02001301 str_val = lyd_get_meta_value(meta);
Michal Vasko8caadab2020-11-05 17:38:15 +01001302 ret = lyd_value_compare((struct lyd_node_term *)diff_match, str_val, strlen(str_val));
1303 if (!ret) {
1304 /* values are the same, remove orig-value meta and set oper to NONE */
1305 lyd_free_meta_single(meta);
1306 LY_CHECK_RET(lyd_diff_change_op(diff_match, LYD_DIFF_OP_NONE));
1307 }
Michal Vaskoe6323f62020-07-09 15:49:02 +02001308 }
1309
1310 /* modify the default flag */
1311 diff_match->flags &= ~LYD_DEFAULT;
1312 diff_match->flags |= src_diff->flags & LYD_DEFAULT;
1313 break;
1314 case LYS_ANYXML:
1315 case LYS_ANYDATA:
Michal Vasko8f359bf2020-07-28 10:41:15 +02001316 if (!lyd_compare_single(diff_match, src_diff, 0)) {
Michal Vasko10765282022-01-18 14:08:34 +01001317 LOGERR_UNEXPVAL(ctx, diff_match, "target diff");
1318 return LY_EINVAL;
Michal Vaskoe6323f62020-07-09 15:49:02 +02001319 }
1320
1321 /* modify the node value */
1322 any = (struct lyd_node_any *)src_diff;
1323 LY_CHECK_RET(lyd_any_copy_value(diff_match, &any->value, any->value_type));
1324 break;
1325 default:
Michal Vaskob7be7a82020-08-20 09:09:04 +02001326 LOGINT_RET(LYD_CTX(src_diff));
Michal Vaskoe6323f62020-07-09 15:49:02 +02001327 }
1328 break;
1329 case LYD_DIFF_OP_NONE:
1330 /* it is moved now */
1331 assert(lysc_is_userordered(diff_match->schema) && (diff_match->schema->nodetype == LYS_LIST));
1332
1333 /* change the operation */
1334 LY_CHECK_RET(lyd_diff_change_op(diff_match, LYD_DIFF_OP_REPLACE));
1335
Michal Vaskoe78faec2021-04-08 17:24:43 +02001336 /* set orig-meta and meta */
1337 if (lysc_is_dup_inst_list(diff_match->schema)) {
1338 meta_name = "position";
1339 orig_meta_name = "orig-position";
1340 } else {
1341 meta_name = "key";
1342 orig_meta_name = "orig-key";
1343 }
1344
1345 meta = lyd_find_meta(src_diff->meta, mod, orig_meta_name);
Michal Vasko10765282022-01-18 14:08:34 +01001346 LY_CHECK_ERR_RET(!meta, LOGERR_META(ctx, orig_meta_name, src_diff), LY_EINVAL);
Michal Vasko3a41dff2020-07-15 14:30:28 +02001347 LY_CHECK_RET(lyd_dup_meta_single(meta, diff_match, NULL));
Michal Vaskoe6323f62020-07-09 15:49:02 +02001348
Michal Vaskoe78faec2021-04-08 17:24:43 +02001349 meta = lyd_find_meta(src_diff->meta, mod, meta_name);
Michal Vasko10765282022-01-18 14:08:34 +01001350 LY_CHECK_ERR_RET(!meta, LOGERR_META(ctx, meta_name, src_diff), LY_EINVAL);
Michal Vasko3a41dff2020-07-15 14:30:28 +02001351 LY_CHECK_RET(lyd_dup_meta_single(meta, diff_match, NULL));
Michal Vaskoe6323f62020-07-09 15:49:02 +02001352 break;
1353 default:
1354 /* delete operation is not valid */
Michal Vasko10765282022-01-18 14:08:34 +01001355 LOGERR_MERGEOP(ctx, diff_match, cur_op, LYD_DIFF_OP_REPLACE);
1356 return LY_EINVAL;
Michal Vaskoe6323f62020-07-09 15:49:02 +02001357 }
1358
1359 return LY_SUCCESS;
1360}
1361
1362/**
1363 * @brief Update operations in a diff node when the new operation is CREATE.
1364 *
1365 * @param[in] diff_match Node from the diff.
Michal Vaskoe78faec2021-04-08 17:24:43 +02001366 * @param[in] cur_op Current operation of @p diff_match.
Michal Vaskoe6323f62020-07-09 15:49:02 +02001367 * @param[in] src_diff Current source diff node.
Michal Vaskoc0e58e82020-11-11 19:04:33 +01001368 * @param[in] options Diff merge options.
Michal Vaskoe6323f62020-07-09 15:49:02 +02001369 * @return LY_ERR value.
1370 */
1371static LY_ERR
Michal Vaskoc0e58e82020-11-11 19:04:33 +01001372lyd_diff_merge_create(struct lyd_node *diff_match, enum lyd_diff_op cur_op, const struct lyd_node *src_diff, uint16_t options)
Michal Vaskoe6323f62020-07-09 15:49:02 +02001373{
1374 struct lyd_node *child;
Michal Vaskoc0e58e82020-11-11 19:04:33 +01001375 const struct lysc_node_leaf *sleaf = NULL;
Michal Vasko871a0252020-11-11 18:35:24 +01001376 uint32_t trg_flags;
Michal Vaskoe78faec2021-04-08 17:24:43 +02001377 const char *meta_name, *orig_meta_name;
1378 struct lyd_meta *meta, *orig_meta;
Michal Vasko10765282022-01-18 14:08:34 +01001379 const struct ly_ctx *ctx = LYD_CTX(diff_match);
Michal Vaskoe6323f62020-07-09 15:49:02 +02001380
1381 switch (cur_op) {
1382 case LYD_DIFF_OP_DELETE:
Michal Vasko871a0252020-11-11 18:35:24 +01001383 /* remember current flags */
1384 trg_flags = diff_match->flags;
1385
Michal Vaskoe78faec2021-04-08 17:24:43 +02001386 if (lysc_is_userordered(diff_match->schema)) {
1387 /* get anchor metadata */
1388 if (lysc_is_dup_inst_list(diff_match->schema)) {
1389 meta_name = "yang:position";
1390 orig_meta_name = "yang:orig-position";
1391 } else if (diff_match->schema->nodetype == LYS_LIST) {
1392 meta_name = "yang:key";
1393 orig_meta_name = "yang:orig-key";
1394 } else {
1395 meta_name = "yang:value";
1396 orig_meta_name = "yang:orig-value";
1397 }
1398 meta = lyd_find_meta(src_diff->meta, NULL, meta_name);
Michal Vasko10765282022-01-18 14:08:34 +01001399 LY_CHECK_ERR_RET(!meta, LOGERR_META(ctx, meta_name, src_diff), LY_EINVAL);
Michal Vaskoe78faec2021-04-08 17:24:43 +02001400 orig_meta = lyd_find_meta(diff_match->meta, NULL, orig_meta_name);
Michal Vasko10765282022-01-18 14:08:34 +01001401 LY_CHECK_ERR_RET(!orig_meta, LOGERR_META(ctx, orig_meta_name, diff_match), LY_EINVAL);
Michal Vaskoe78faec2021-04-08 17:24:43 +02001402
1403 /* the (incorrect) assumption made here is that there are no previous diff nodes that would affect
1404 * the anchors stored in the metadata */
Radek Krejci6d5ba0c2021-04-26 07:49:59 +02001405 if (strcmp(lyd_get_meta_value(meta), lyd_get_meta_value(orig_meta))) {
Michal Vaskoe78faec2021-04-08 17:24:43 +02001406 /* deleted + created at another position -> operation REPLACE */
1407 LY_CHECK_RET(lyd_diff_change_op(diff_match, LYD_DIFF_OP_REPLACE));
1408
1409 /* add anchor metadata */
1410 LY_CHECK_RET(lyd_dup_meta_single(meta, diff_match, NULL));
1411 } else {
1412 /* deleted + created at the same position -> operation NONE */
1413 LY_CHECK_RET(lyd_diff_change_op(diff_match, LYD_DIFF_OP_NONE));
1414
1415 /* delete anchor metadata */
1416 lyd_free_meta_single(orig_meta);
1417 }
1418 } else if (diff_match->schema->nodetype == LYS_LEAF) {
1419 if (options & LYD_DIFF_MERGE_DEFAULTS) {
1420 /* we are dealing with a leaf and are handling default values specially (as explicit nodes) */
1421 sleaf = (struct lysc_node_leaf *)diff_match->schema;
1422 }
1423
Radek Krejci55c4bd22021-04-26 08:09:04 +02001424 if (sleaf && sleaf->dflt && !sleaf->dflt->realtype->plugin->compare(sleaf->dflt,
1425 &((struct lyd_node_term *)src_diff)->value)) {
Michal Vaskoe78faec2021-04-08 17:24:43 +02001426 /* we deleted it, so a default value was in-use, and it matches the created value -> operation NONE */
1427 LY_CHECK_RET(lyd_diff_change_op(diff_match, LYD_DIFF_OP_NONE));
1428 } else if (!lyd_compare_single(diff_match, src_diff, 0)) {
1429 /* deleted + created -> operation NONE */
1430 LY_CHECK_RET(lyd_diff_change_op(diff_match, LYD_DIFF_OP_NONE));
1431 } else {
1432 /* we deleted it, but it was created with a different value -> operation REPLACE */
1433 LY_CHECK_RET(lyd_diff_change_op(diff_match, LYD_DIFF_OP_REPLACE));
1434
1435 /* current value is the previous one (meta) */
1436 LY_CHECK_RET(lyd_new_meta(LYD_CTX(src_diff), diff_match, NULL, "yang:orig-value",
Radek Krejci6d5ba0c2021-04-26 07:49:59 +02001437 lyd_get_value(diff_match), 0, NULL));
Michal Vaskoe78faec2021-04-08 17:24:43 +02001438
1439 /* update the value itself */
Radek Krejci6d5ba0c2021-04-26 07:49:59 +02001440 LY_CHECK_RET(lyd_change_term(diff_match, lyd_get_value(src_diff)));
Michal Vaskoe78faec2021-04-08 17:24:43 +02001441 }
1442 } else {
Michal Vaskoe6323f62020-07-09 15:49:02 +02001443 /* deleted + created -> operation NONE */
1444 LY_CHECK_RET(lyd_diff_change_op(diff_match, LYD_DIFF_OP_NONE));
Michal Vaskoe6323f62020-07-09 15:49:02 +02001445 }
1446
1447 if (diff_match->schema->nodetype & LYD_NODE_TERM) {
Michal Vasko4b715ca2020-11-11 18:39:57 +01001448 /* add orig-dflt metadata */
1449 LY_CHECK_RET(lyd_new_meta(LYD_CTX(src_diff), diff_match, NULL, "yang:orig-default",
1450 trg_flags & LYD_DEFAULT ? "true" : "false", 0, NULL));
1451
Michal Vaskoe6323f62020-07-09 15:49:02 +02001452 /* update dflt flag itself */
1453 diff_match->flags &= ~LYD_DEFAULT;
1454 diff_match->flags |= src_diff->flags & LYD_DEFAULT;
Michal Vaskoe78faec2021-04-08 17:24:43 +02001455 }
1456
1457 /* but the operation of its children should remain DELETE */
1458 LY_LIST_FOR(lyd_child_no_keys(diff_match), child) {
1459 LY_CHECK_RET(lyd_diff_change_op(child, LYD_DIFF_OP_DELETE));
Michal Vaskoe6323f62020-07-09 15:49:02 +02001460 }
1461 break;
1462 default:
1463 /* create and replace operations are not valid */
Michal Vasko10765282022-01-18 14:08:34 +01001464 LOGERR_MERGEOP(LYD_CTX(src_diff), diff_match, cur_op, LYD_DIFF_OP_CREATE);
1465 return LY_EINVAL;
Michal Vaskoe6323f62020-07-09 15:49:02 +02001466 }
1467
1468 return LY_SUCCESS;
1469}
1470
1471/**
1472 * @brief Update operations on a diff node when the new operation is DELETE.
1473 *
1474 * @param[in] diff_match Node from the diff.
Michal Vaskoe78faec2021-04-08 17:24:43 +02001475 * @param[in] cur_op Current operation of @p diff_match.
Michal Vaskoe6323f62020-07-09 15:49:02 +02001476 * @param[in] src_diff Current source diff node.
1477 * @return LY_ERR value.
1478 */
1479static LY_ERR
1480lyd_diff_merge_delete(struct lyd_node *diff_match, enum lyd_diff_op cur_op, const struct lyd_node *src_diff)
1481{
Michal Vasko17d0c5c2021-11-01 11:31:11 +01001482 struct lyd_node *child;
Michal Vaskoe78faec2021-04-08 17:24:43 +02001483 struct lyd_meta *meta;
1484 const char *meta_name;
Michal Vasko10765282022-01-18 14:08:34 +01001485 const struct ly_ctx *ctx = LYD_CTX(diff_match);
Michal Vaskoe6323f62020-07-09 15:49:02 +02001486
1487 /* we can delete only exact existing nodes */
Michal Vaskob7be7a82020-08-20 09:09:04 +02001488 LY_CHECK_ERR_RET(lyd_compare_single(diff_match, src_diff, 0), LOGINT(LYD_CTX(src_diff)), LY_EINT);
Michal Vaskoe6323f62020-07-09 15:49:02 +02001489
1490 switch (cur_op) {
1491 case LYD_DIFF_OP_CREATE:
1492 /* it was created, but then deleted -> set NONE operation */
1493 LY_CHECK_RET(lyd_diff_change_op(diff_match, LYD_DIFF_OP_NONE));
1494
1495 if (diff_match->schema->nodetype & LYD_NODE_TERM) {
1496 /* add orig-default meta because it is expected */
Michal Vasko871a0252020-11-11 18:35:24 +01001497 LY_CHECK_RET(lyd_new_meta(LYD_CTX(src_diff), diff_match, NULL, "yang:orig-default",
1498 diff_match->flags & LYD_DEFAULT ? "true" : "false", 0, NULL));
Michal Vaskoe78faec2021-04-08 17:24:43 +02001499 } else if (!lysc_is_dup_inst_list(diff_match->schema)) {
Michal Vaskoe6323f62020-07-09 15:49:02 +02001500 /* keep operation for all descendants (for now) */
Radek Krejcia1c1e542020-09-29 16:06:52 +02001501 LY_LIST_FOR(lyd_child_no_keys(diff_match), child) {
Michal Vaskoe6323f62020-07-09 15:49:02 +02001502 LY_CHECK_RET(lyd_diff_change_op(child, cur_op));
1503 }
Michal Vaskoe78faec2021-04-08 17:24:43 +02001504 } /* else key-less list, for which all the descendants act as keys */
Michal Vaskoe6323f62020-07-09 15:49:02 +02001505 break;
1506 case LYD_DIFF_OP_REPLACE:
Michal Vasko17d0c5c2021-11-01 11:31:11 +01001507 /* remove the redundant metadata */
Michal Vaskoe78faec2021-04-08 17:24:43 +02001508 if (lysc_is_userordered(diff_match->schema)) {
1509 if (lysc_is_dup_inst_list(diff_match->schema)) {
1510 meta_name = "position";
1511 } else if (diff_match->schema->nodetype == LYS_LIST) {
1512 meta_name = "key";
1513 } else {
1514 meta_name = "value";
1515 }
1516 } else {
1517 assert(diff_match->schema->nodetype == LYS_LEAF);
1518
1519 /* switch value for the original one */
1520 meta = lyd_find_meta(diff_match->meta, NULL, "yang:orig-value");
Michal Vasko10765282022-01-18 14:08:34 +01001521 LY_CHECK_ERR_RET(!meta, LOGERR_META(ctx, "yang:orig-value", diff_match), LY_EINVAL);
Radek Krejci6d5ba0c2021-04-26 07:49:59 +02001522 if (lyd_change_term(diff_match, lyd_get_meta_value(meta))) {
Michal Vasko10765282022-01-18 14:08:34 +01001523 LOGERR_UNEXPVAL(ctx, diff_match, "target diff");
1524 return LY_EINVAL;
Michal Vaskoe78faec2021-04-08 17:24:43 +02001525 }
1526
1527 /* switch default for the original one, then remove the meta */
1528 meta = lyd_find_meta(diff_match->meta, NULL, "yang:orig-default");
Michal Vasko10765282022-01-18 14:08:34 +01001529 LY_CHECK_ERR_RET(!meta, LOGERR_META(ctx, "yang:orig-default", diff_match), LY_EINVAL);
Michal Vaskoe78faec2021-04-08 17:24:43 +02001530 diff_match->flags &= ~LYD_DEFAULT;
1531 if (meta->value.boolean) {
1532 diff_match->flags |= LYD_DEFAULT;
1533 }
1534 lyd_free_meta_single(meta);
1535
1536 meta_name = "orig-value";
1537 }
1538 lyd_diff_del_meta(diff_match, meta_name);
1539
Michal Vasko17d0c5c2021-11-01 11:31:11 +01001540 /* it was being changed, but should be deleted instead -> set DELETE operation */
1541 LY_CHECK_RET(lyd_diff_change_op(diff_match, LYD_DIFF_OP_DELETE));
1542 break;
Michal Vaskoe6323f62020-07-09 15:49:02 +02001543 case LYD_DIFF_OP_NONE:
1544 /* it was not modified, but should be deleted -> set DELETE operation */
1545 LY_CHECK_RET(lyd_diff_change_op(diff_match, LYD_DIFF_OP_DELETE));
Michal Vaskoe6323f62020-07-09 15:49:02 +02001546 break;
1547 default:
1548 /* delete operation is not valid */
Michal Vasko10765282022-01-18 14:08:34 +01001549 LOGERR_MERGEOP(LYD_CTX(diff_match), diff_match, cur_op, LYD_DIFF_OP_DELETE);
1550 return LY_EINVAL;
Michal Vaskoe6323f62020-07-09 15:49:02 +02001551 }
1552
1553 return LY_SUCCESS;
1554}
1555
1556/**
1557 * @brief Check whether this diff node is redundant (does not change data).
1558 *
1559 * @param[in] diff Diff node.
1560 * @return 0 if not, non-zero if it is.
1561 */
1562static int
1563lyd_diff_is_redundant(struct lyd_node *diff)
1564{
1565 enum lyd_diff_op op;
1566 struct lyd_meta *meta, *orig_val_meta = NULL, *val_meta = NULL;
1567 struct lyd_node *child;
1568 const struct lys_module *mod;
Michal Vaskoe78faec2021-04-08 17:24:43 +02001569 const char *str, *orig_meta_name, *meta_name;
Michal Vaskoe6323f62020-07-09 15:49:02 +02001570
1571 assert(diff);
1572
Michal Vaskoe78faec2021-04-08 17:24:43 +02001573 if (lysc_is_dup_inst_list(diff->schema)) {
1574 /* all descendants are keys */
1575 child = NULL;
1576 } else {
1577 child = lyd_child_no_keys(diff);
1578 }
Michal Vaskob7be7a82020-08-20 09:09:04 +02001579 mod = ly_ctx_get_module_latest(LYD_CTX(diff), "yang");
Michal Vaskoe6323f62020-07-09 15:49:02 +02001580 assert(mod);
1581
1582 /* get node operation */
Michal Vasko53bf6f22020-07-14 08:23:40 +02001583 LY_CHECK_RET(lyd_diff_get_op(diff, &op), 0);
Michal Vaskoe6323f62020-07-09 15:49:02 +02001584
1585 if ((op == LYD_DIFF_OP_REPLACE) && lysc_is_userordered(diff->schema)) {
Michal Vaskoe78faec2021-04-08 17:24:43 +02001586 /* get metadata names */
1587 if (lysc_is_dup_inst_list(diff->schema)) {
1588 meta_name = "position";
1589 orig_meta_name = "orig-position";
1590 } else if (diff->schema->nodetype == LYS_LIST) {
1591 meta_name = "key";
1592 orig_meta_name = "orig-key";
1593 } else {
1594 meta_name = "value";
1595 orig_meta_name = "orig-value";
1596 }
1597
Michal Vaskoe6323f62020-07-09 15:49:02 +02001598 /* check for redundant move */
Michal Vaskoe78faec2021-04-08 17:24:43 +02001599 orig_val_meta = lyd_find_meta(diff->meta, mod, orig_meta_name);
1600 val_meta = lyd_find_meta(diff->meta, mod, meta_name);
Michal Vaskoe6323f62020-07-09 15:49:02 +02001601 assert(orig_val_meta && val_meta);
1602
1603 if (!lyd_compare_meta(orig_val_meta, val_meta)) {
1604 /* there is actually no move */
Michal Vasko3a41dff2020-07-15 14:30:28 +02001605 lyd_free_meta_single(orig_val_meta);
1606 lyd_free_meta_single(val_meta);
Michal Vaskoe6323f62020-07-09 15:49:02 +02001607 if (child) {
1608 /* change operation to NONE, we have siblings */
1609 lyd_diff_change_op(diff, LYD_DIFF_OP_NONE);
1610 return 0;
1611 }
1612
1613 /* redundant node, BUT !!
1614 * In diff the move operation is always converted to be INSERT_AFTER, which is fine
1615 * because the data that this is applied on should not change for the diff lifetime.
1616 * However, when we are merging 2 diffs, this conversion is actually lossy because
1617 * if the data change, the move operation can also change its meaning. In this specific
1618 * case the move operation will be lost. But it can be considered a feature, it is not supported.
1619 */
1620 return 1;
1621 }
1622 } else if ((op == LYD_DIFF_OP_NONE) && (diff->schema->nodetype & LYD_NODE_TERM)) {
1623 /* check whether at least the default flags are different */
1624 meta = lyd_find_meta(diff->meta, mod, "orig-default");
1625 assert(meta);
Radek Krejci6d5ba0c2021-04-26 07:49:59 +02001626 str = lyd_get_meta_value(meta);
Michal Vaskoe6323f62020-07-09 15:49:02 +02001627
1628 /* if previous and current dflt flags are the same, this node is redundant */
1629 if ((!strcmp(str, "true") && (diff->flags & LYD_DEFAULT)) || (!strcmp(str, "false") && !(diff->flags & LYD_DEFAULT))) {
1630 return 1;
1631 }
1632 return 0;
1633 }
1634
1635 if (!child && (op == LYD_DIFF_OP_NONE)) {
1636 return 1;
1637 }
1638
1639 return 0;
1640}
1641
1642/**
Michal Vaskoe78faec2021-04-08 17:24:43 +02001643 * @brief Merge sysrepo diff subtree with another diff, recursively.
Michal Vaskoe6323f62020-07-09 15:49:02 +02001644 *
1645 * @param[in] src_diff Source diff node.
1646 * @param[in] diff_parent Current sysrepo diff parent.
1647 * @param[in] diff_cb Optional diff callback.
1648 * @param[in] cb_data User data for @p diff_cb.
Michal Vaskoe78faec2021-04-08 17:24:43 +02001649 * @param[in,out] dup_inst Duplicate instance cache for all @p src_diff siblings.
Michal Vaskoc0e58e82020-11-11 19:04:33 +01001650 * @param[in] options Diff merge options.
Michal Vaskoe6323f62020-07-09 15:49:02 +02001651 * @param[in,out] diff Diff root node.
1652 * @return LY_ERR value.
1653 */
1654static LY_ERR
1655lyd_diff_merge_r(const struct lyd_node *src_diff, struct lyd_node *diff_parent, lyd_diff_cb diff_cb, void *cb_data,
Michal Vaskod7c048c2021-05-18 16:12:55 +02001656 struct lyd_dup_inst **dup_inst, uint16_t options, struct lyd_node **diff)
Michal Vaskoe6323f62020-07-09 15:49:02 +02001657{
1658 LY_ERR ret = LY_SUCCESS;
1659 struct lyd_node *child, *diff_node = NULL;
1660 enum lyd_diff_op src_op, cur_op;
Michal Vaskod7c048c2021-05-18 16:12:55 +02001661 struct lyd_dup_inst *child_dup_inst = NULL;
Michal Vaskoe6323f62020-07-09 15:49:02 +02001662
1663 /* get source node operation */
1664 LY_CHECK_RET(lyd_diff_get_op(src_diff, &src_op));
1665
1666 /* find an equal node in the current diff */
Michal Vaskoe78faec2021-04-08 17:24:43 +02001667 LY_CHECK_RET(lyd_diff_find_match(diff_parent ? lyd_child_no_keys(diff_parent) : *diff, src_diff, 1, dup_inst, &diff_node));
Michal Vaskoe6323f62020-07-09 15:49:02 +02001668
1669 if (diff_node) {
1670 /* get target (current) operation */
1671 LY_CHECK_RET(lyd_diff_get_op(diff_node, &cur_op));
1672
1673 /* merge operations */
1674 switch (src_op) {
1675 case LYD_DIFF_OP_REPLACE:
1676 ret = lyd_diff_merge_replace(diff_node, cur_op, src_diff);
1677 break;
1678 case LYD_DIFF_OP_CREATE:
Michal Vasko1dc0a842021-02-04 11:04:57 +01001679 if ((cur_op == LYD_DIFF_OP_CREATE) && lysc_is_dup_inst_list(diff_node->schema)) {
Michal Vaskoe78faec2021-04-08 17:24:43 +02001680 /* special case of creating duplicate (leaf-)list instances */
Michal Vasko1dc0a842021-02-04 11:04:57 +01001681 goto add_diff;
1682 }
1683
Michal Vaskoc0e58e82020-11-11 19:04:33 +01001684 ret = lyd_diff_merge_create(diff_node, cur_op, src_diff, options);
Michal Vaskoe6323f62020-07-09 15:49:02 +02001685 break;
1686 case LYD_DIFF_OP_DELETE:
1687 ret = lyd_diff_merge_delete(diff_node, cur_op, src_diff);
1688 break;
1689 case LYD_DIFF_OP_NONE:
Michal Vaskoe78faec2021-04-08 17:24:43 +02001690 /* key-less list can never have "none" operation since all its descendants are acting as "keys" */
1691 assert((src_diff->schema->nodetype != LYS_LIST) || !lysc_is_dup_inst_list(src_diff->schema));
Michal Vaskoe6323f62020-07-09 15:49:02 +02001692 ret = lyd_diff_merge_none(diff_node, cur_op, src_diff);
1693 break;
1694 default:
Michal Vaskob7be7a82020-08-20 09:09:04 +02001695 LOGINT_RET(LYD_CTX(src_diff));
Michal Vaskoe6323f62020-07-09 15:49:02 +02001696 }
1697 if (ret) {
Michal Vaskob7be7a82020-08-20 09:09:04 +02001698 LOGERR(LYD_CTX(src_diff), LY_EOTHER, "Merging operation \"%s\" failed.", lyd_diff_op2str(src_op));
Michal Vaskoe6323f62020-07-09 15:49:02 +02001699 return ret;
1700 }
1701
1702 if (diff_cb) {
1703 /* call callback */
Michal Vaskobc5fba92020-08-07 12:14:39 +02001704 LY_CHECK_RET(diff_cb(src_diff, diff_node, cb_data));
Michal Vaskoe6323f62020-07-09 15:49:02 +02001705 }
1706
1707 /* update diff parent */
1708 diff_parent = diff_node;
1709
Michal Vaskoe78faec2021-04-08 17:24:43 +02001710 /* for diff purposes, all key-less list descendants actually act as keys (identifying the same instances),
1711 * so there is nothing to merge for these "keys" */
1712 if (!lysc_is_dup_inst_list(src_diff->schema)) {
1713 /* merge src_diff recursively */
1714 LY_LIST_FOR(lyd_child_no_keys(src_diff), child) {
1715 ret = lyd_diff_merge_r(child, diff_parent, diff_cb, cb_data, &child_dup_inst, options, diff);
1716 if (ret) {
1717 break;
1718 }
1719 }
Michal Vaskod7c048c2021-05-18 16:12:55 +02001720 lyd_dup_inst_free(child_dup_inst);
Michal Vaskoe78faec2021-04-08 17:24:43 +02001721 LY_CHECK_RET(ret);
Michal Vaskoe6323f62020-07-09 15:49:02 +02001722 }
1723 } else {
Michal Vasko1dc0a842021-02-04 11:04:57 +01001724add_diff:
Michal Vaskoe6323f62020-07-09 15:49:02 +02001725 /* add new diff node with all descendants */
Michal Vasko871a0252020-11-11 18:35:24 +01001726 LY_CHECK_RET(lyd_dup_single(src_diff, (struct lyd_node_inner *)diff_parent, LYD_DUP_RECURSIVE | LYD_DUP_WITH_FLAGS,
1727 &diff_node));
Michal Vaskoe6323f62020-07-09 15:49:02 +02001728
1729 /* insert node into diff if not already */
1730 if (!diff_parent) {
Michal Vaskob104f112020-07-17 09:54:54 +02001731 lyd_insert_sibling(*diff, diff_node, diff);
Michal Vaskoe6323f62020-07-09 15:49:02 +02001732 }
1733
1734 /* update operation */
1735 LY_CHECK_RET(lyd_diff_change_op(diff_node, src_op));
1736
1737 if (diff_cb) {
Michal Vaskoe2af8412020-12-03 14:11:38 +01001738 /* call callback with no source diff node since it was duplicated and just added */
1739 LY_CHECK_RET(diff_cb(NULL, diff_node, cb_data));
Michal Vaskoe6323f62020-07-09 15:49:02 +02001740 }
1741
1742 /* update diff parent */
1743 diff_parent = diff_node;
1744 }
1745
1746 /* remove any redundant nodes */
Michal Vaskob98d7082020-07-15 16:38:36 +02001747 if (lyd_diff_is_redundant(diff_parent)) {
Michal Vaskoe6323f62020-07-09 15:49:02 +02001748 if (diff_parent == *diff) {
1749 *diff = (*diff)->next;
1750 }
1751 lyd_free_tree(diff_parent);
1752 }
1753
1754 return LY_SUCCESS;
1755}
1756
Jan Kundrátc6e39de2021-12-09 16:01:19 +01001757LIBYANG_API_DEF LY_ERR
Michal Vaskofb737aa2020-08-06 13:53:53 +02001758lyd_diff_merge_module(struct lyd_node **diff, const struct lyd_node *src_diff, const struct lys_module *mod,
Michal Vaskoc0e58e82020-11-11 19:04:33 +01001759 lyd_diff_cb diff_cb, void *cb_data, uint16_t options)
Michal Vaskoe6323f62020-07-09 15:49:02 +02001760{
1761 const struct lyd_node *src_root;
Michal Vaskod7c048c2021-05-18 16:12:55 +02001762 struct lyd_dup_inst *dup_inst = NULL;
Michal Vaskoe78faec2021-04-08 17:24:43 +02001763 LY_ERR ret = LY_SUCCESS;
Michal Vaskoe6323f62020-07-09 15:49:02 +02001764
1765 LY_LIST_FOR(src_diff, src_root) {
1766 if (mod && (lyd_owner_module(src_root) != mod)) {
1767 /* skip data nodes from different modules */
1768 continue;
1769 }
1770
1771 /* apply relevant nodes from the diff datatree */
Michal Vaskoe78faec2021-04-08 17:24:43 +02001772 LY_CHECK_GOTO(ret = lyd_diff_merge_r(src_root, NULL, diff_cb, cb_data, &dup_inst, options, diff), cleanup);
Michal Vaskoe6323f62020-07-09 15:49:02 +02001773 }
1774
Michal Vaskoe78faec2021-04-08 17:24:43 +02001775cleanup:
Michal Vaskod7c048c2021-05-18 16:12:55 +02001776 lyd_dup_inst_free(dup_inst);
Michal Vaskoe78faec2021-04-08 17:24:43 +02001777 return ret;
Michal Vaskoe6323f62020-07-09 15:49:02 +02001778}
1779
Jan Kundrátc6e39de2021-12-09 16:01:19 +01001780LIBYANG_API_DEF LY_ERR
Michal Vasko04f85912020-08-07 12:14:58 +02001781lyd_diff_merge_tree(struct lyd_node **diff_first, struct lyd_node *diff_parent, const struct lyd_node *src_sibling,
Michal Vaskoc0e58e82020-11-11 19:04:33 +01001782 lyd_diff_cb diff_cb, void *cb_data, uint16_t options)
Michal Vasko04f85912020-08-07 12:14:58 +02001783{
Michal Vaskoe78faec2021-04-08 17:24:43 +02001784 LY_ERR ret;
Michal Vaskod7c048c2021-05-18 16:12:55 +02001785 struct lyd_dup_inst *dup_inst = NULL;
Michal Vaskoe78faec2021-04-08 17:24:43 +02001786
Michal Vasko04f85912020-08-07 12:14:58 +02001787 if (!src_sibling) {
1788 return LY_SUCCESS;
1789 }
1790
Michal Vaskoe78faec2021-04-08 17:24:43 +02001791 ret = lyd_diff_merge_r(src_sibling, diff_parent, diff_cb, cb_data, &dup_inst, options, diff_first);
Michal Vaskod7c048c2021-05-18 16:12:55 +02001792 lyd_dup_inst_free(dup_inst);
Michal Vaskoe78faec2021-04-08 17:24:43 +02001793 return ret;
Michal Vasko04f85912020-08-07 12:14:58 +02001794}
1795
Jan Kundrátc6e39de2021-12-09 16:01:19 +01001796LIBYANG_API_DEF LY_ERR
Michal Vaskoc0e58e82020-11-11 19:04:33 +01001797lyd_diff_merge_all(struct lyd_node **diff, const struct lyd_node *src_diff, uint16_t options)
Michal Vaskoe6323f62020-07-09 15:49:02 +02001798{
Michal Vaskoc0e58e82020-11-11 19:04:33 +01001799 return lyd_diff_merge_module(diff, src_diff, NULL, NULL, NULL, options);
Michal Vaskoe6323f62020-07-09 15:49:02 +02001800}
Michal Vasko4231fb62020-07-13 13:54:47 +02001801
1802static LY_ERR
Michal Vaskobaba84e2021-02-05 16:33:30 +01001803lyd_diff_reverse_value(struct lyd_node *node, const struct lys_module *mod)
Michal Vasko4231fb62020-07-13 13:54:47 +02001804{
1805 LY_ERR ret = LY_SUCCESS;
1806 struct lyd_meta *meta;
Michal Vaskoba99a3e2020-08-18 15:50:05 +02001807 const char *val1 = NULL;
1808 char *val2;
Radek Krejci1deb5be2020-08-26 16:43:36 +02001809 uint32_t flags;
Michal Vasko4231fb62020-07-13 13:54:47 +02001810
Michal Vaskobaba84e2021-02-05 16:33:30 +01001811 assert(node->schema->nodetype & (LYS_LEAF | LYS_ANYDATA));
1812
1813 meta = lyd_find_meta(node->meta, mod, "orig-value");
Michal Vasko10765282022-01-18 14:08:34 +01001814 LY_CHECK_ERR_RET(!meta, LOGERR_META(LYD_CTX(node), "orig-value", node), LY_EINVAL);
Michal Vasko4231fb62020-07-13 13:54:47 +02001815
1816 /* orig-value */
Radek Krejci6d5ba0c2021-04-26 07:49:59 +02001817 val1 = lyd_get_meta_value(meta);
Michal Vasko4231fb62020-07-13 13:54:47 +02001818
1819 /* current value */
Michal Vaskobaba84e2021-02-05 16:33:30 +01001820 if (node->schema->nodetype == LYS_LEAF) {
Radek Krejci6d5ba0c2021-04-26 07:49:59 +02001821 val2 = strdup(lyd_get_value(node));
Michal Vaskobaba84e2021-02-05 16:33:30 +01001822 } else {
1823 LY_CHECK_RET(lyd_any_value_str(node, &val2));
1824 }
Michal Vasko4231fb62020-07-13 13:54:47 +02001825
1826 /* switch values, keep default flag */
Michal Vaskobaba84e2021-02-05 16:33:30 +01001827 flags = node->flags;
1828 if (node->schema->nodetype == LYS_LEAF) {
1829 LY_CHECK_GOTO(ret = lyd_change_term(node, val1), cleanup);
1830 } else {
1831 union lyd_any_value anyval = {.str = val1};
1832 LY_CHECK_GOTO(ret = lyd_any_copy_value(node, &anyval, LYD_ANYDATA_STRING), cleanup);
1833 }
1834 node->flags = flags;
Michal Vasko4231fb62020-07-13 13:54:47 +02001835 LY_CHECK_GOTO(ret = lyd_change_meta(meta, val2), cleanup);
1836
1837cleanup:
Michal Vaskoba99a3e2020-08-18 15:50:05 +02001838 free(val2);
Michal Vasko4231fb62020-07-13 13:54:47 +02001839 return ret;
1840}
1841
1842static LY_ERR
1843lyd_diff_reverse_default(struct lyd_node *node, const struct lys_module *mod)
1844{
1845 struct lyd_meta *meta;
Radek Krejci1deb5be2020-08-26 16:43:36 +02001846 uint32_t flag1, flag2;
Michal Vasko4231fb62020-07-13 13:54:47 +02001847
1848 meta = lyd_find_meta(node->meta, mod, "orig-default");
Michal Vasko610e93b2020-11-09 20:58:32 +01001849 LY_CHECK_ERR_RET(!meta, LOGINT(mod->ctx), LY_EINT);
Michal Vasko4231fb62020-07-13 13:54:47 +02001850
1851 /* orig-default */
Michal Vaskoba99a3e2020-08-18 15:50:05 +02001852 if (meta->value.boolean) {
Michal Vasko4231fb62020-07-13 13:54:47 +02001853 flag1 = LYD_DEFAULT;
1854 } else {
1855 flag1 = 0;
1856 }
1857
1858 /* current default */
1859 flag2 = node->flags & LYD_DEFAULT;
1860
Michal Vasko610e93b2020-11-09 20:58:32 +01001861 if (flag1 == flag2) {
1862 /* no default state change so nothing to reverse */
1863 return LY_SUCCESS;
1864 }
1865
Michal Vasko4231fb62020-07-13 13:54:47 +02001866 /* switch defaults */
1867 node->flags &= ~LYD_DEFAULT;
1868 node->flags |= flag1;
1869 LY_CHECK_RET(lyd_change_meta(meta, flag2 ? "true" : "false"));
1870
1871 return LY_SUCCESS;
1872}
1873
1874static LY_ERR
1875lyd_diff_reverse_meta(struct lyd_node *node, const struct lys_module *mod, const char *name1, const char *name2)
1876{
1877 LY_ERR ret = LY_SUCCESS;
1878 struct lyd_meta *meta1, *meta2;
Michal Vaskoba99a3e2020-08-18 15:50:05 +02001879 const char *val1 = NULL;
1880 char *val2 = NULL;
Michal Vasko4231fb62020-07-13 13:54:47 +02001881
1882 meta1 = lyd_find_meta(node->meta, mod, name1);
Michal Vasko10765282022-01-18 14:08:34 +01001883 LY_CHECK_ERR_RET(!meta1, LOGERR_META(LYD_CTX(node), name1, node), LY_EINVAL);
Michal Vasko4231fb62020-07-13 13:54:47 +02001884
1885 meta2 = lyd_find_meta(node->meta, mod, name2);
Michal Vasko10765282022-01-18 14:08:34 +01001886 LY_CHECK_ERR_RET(!meta2, LOGERR_META(LYD_CTX(node), name2, node), LY_EINVAL);
Michal Vasko4231fb62020-07-13 13:54:47 +02001887
1888 /* value1 */
Radek Krejci6d5ba0c2021-04-26 07:49:59 +02001889 val1 = lyd_get_meta_value(meta1);
Michal Vasko4231fb62020-07-13 13:54:47 +02001890
1891 /* value2 */
Radek Krejci6d5ba0c2021-04-26 07:49:59 +02001892 val2 = strdup(lyd_get_meta_value(meta2));
Michal Vasko4231fb62020-07-13 13:54:47 +02001893
1894 /* switch values */
1895 LY_CHECK_GOTO(ret = lyd_change_meta(meta1, val2), cleanup);
1896 LY_CHECK_GOTO(ret = lyd_change_meta(meta2, val1), cleanup);
1897
1898cleanup:
Michal Vaskoba99a3e2020-08-18 15:50:05 +02001899 free(val2);
Michal Vasko4231fb62020-07-13 13:54:47 +02001900 return ret;
1901}
1902
Michal Vasko9a7e9d02021-03-09 13:52:25 +01001903/**
1904 * @brief Remove specific operation from all the nodes in a subtree.
1905 *
1906 * @param[in] diff Diff subtree to process.
1907 * @param[in] op Only expected operation.
1908 * @return LY_ERR value.
1909 */
1910static LY_ERR
1911lyd_diff_reverse_remove_op_r(struct lyd_node *diff, enum lyd_diff_op op)
1912{
1913 struct lyd_node *elem;
1914 struct lyd_meta *meta;
1915
1916 LYD_TREE_DFS_BEGIN(diff, elem) {
1917 meta = lyd_find_meta(elem->meta, NULL, "yang:operation");
1918 if (meta) {
Radek Krejci6d5ba0c2021-04-26 07:49:59 +02001919 LY_CHECK_ERR_RET(lyd_diff_str2op(lyd_get_meta_value(meta)) != op, LOGINT(LYD_CTX(diff)), LY_EINT);
Michal Vasko9a7e9d02021-03-09 13:52:25 +01001920 lyd_free_meta_single(meta);
1921 }
1922
1923 LYD_TREE_DFS_END(diff, elem);
1924 }
1925
1926 return LY_SUCCESS;
1927}
1928
Jan Kundrátc6e39de2021-12-09 16:01:19 +01001929LIBYANG_API_DEF LY_ERR
Michal Vasko66535812020-08-11 08:44:22 +02001930lyd_diff_reverse_all(const struct lyd_node *src_diff, struct lyd_node **diff)
Michal Vasko4231fb62020-07-13 13:54:47 +02001931{
1932 LY_ERR ret = LY_SUCCESS;
1933 const struct lys_module *mod;
Michal Vasko9a7e9d02021-03-09 13:52:25 +01001934 struct lyd_node *root, *elem, *iter;
Michal Vasko4231fb62020-07-13 13:54:47 +02001935 enum lyd_diff_op op;
1936
1937 LY_CHECK_ARG_RET(NULL, diff, LY_EINVAL);
1938
1939 if (!src_diff) {
1940 *diff = NULL;
1941 return LY_SUCCESS;
1942 }
1943
1944 /* duplicate diff */
Michal Vasko3a41dff2020-07-15 14:30:28 +02001945 LY_CHECK_RET(lyd_dup_siblings(src_diff, NULL, LYD_DUP_RECURSIVE, diff));
Michal Vasko4231fb62020-07-13 13:54:47 +02001946
1947 /* find module with metadata needed for later */
Michal Vaskob7be7a82020-08-20 09:09:04 +02001948 mod = ly_ctx_get_module_latest(LYD_CTX(src_diff), "yang");
1949 LY_CHECK_ERR_GOTO(!mod, LOGINT(LYD_CTX(src_diff)); ret = LY_EINT, cleanup);
Michal Vasko4231fb62020-07-13 13:54:47 +02001950
1951 LY_LIST_FOR(*diff, root) {
Michal Vasko56daf732020-08-10 10:57:18 +02001952 LYD_TREE_DFS_BEGIN(root, elem) {
Michal Vasko0f5c6a52020-11-06 17:18:03 +01001953 /* skip all keys */
1954 if (!lysc_is_key(elem->schema)) {
1955 /* find operation attribute, if any */
1956 LY_CHECK_GOTO(ret = lyd_diff_get_op(elem, &op), cleanup);
Michal Vasko4231fb62020-07-13 13:54:47 +02001957
Michal Vasko0f5c6a52020-11-06 17:18:03 +01001958 switch (op) {
1959 case LYD_DIFF_OP_CREATE:
1960 /* reverse create to delete */
1961 LY_CHECK_GOTO(ret = lyd_diff_change_op(elem, LYD_DIFF_OP_DELETE), cleanup);
Michal Vasko9e070522021-03-05 14:00:14 +01001962
Michal Vasko9a7e9d02021-03-09 13:52:25 +01001963 /* check all the children for the same operation, nothing else is expected */
1964 LY_LIST_FOR(lyd_child(elem), iter) {
1965 lyd_diff_reverse_remove_op_r(iter, LYD_DIFF_OP_CREATE);
1966 }
1967
Michal Vasko9e070522021-03-05 14:00:14 +01001968 LYD_TREE_DFS_continue = 1;
Michal Vasko4231fb62020-07-13 13:54:47 +02001969 break;
Michal Vasko0f5c6a52020-11-06 17:18:03 +01001970 case LYD_DIFF_OP_DELETE:
1971 /* reverse delete to create */
1972 LY_CHECK_GOTO(ret = lyd_diff_change_op(elem, LYD_DIFF_OP_CREATE), cleanup);
Michal Vasko9e070522021-03-05 14:00:14 +01001973
Michal Vasko9a7e9d02021-03-09 13:52:25 +01001974 /* check all the children for the same operation, nothing else is expected */
1975 LY_LIST_FOR(lyd_child(elem), iter) {
1976 lyd_diff_reverse_remove_op_r(iter, LYD_DIFF_OP_DELETE);
1977 }
1978
Michal Vasko9e070522021-03-05 14:00:14 +01001979 LYD_TREE_DFS_continue = 1;
Michal Vasko4231fb62020-07-13 13:54:47 +02001980 break;
Michal Vasko0f5c6a52020-11-06 17:18:03 +01001981 case LYD_DIFF_OP_REPLACE:
1982 switch (elem->schema->nodetype) {
1983 case LYS_LEAF:
1984 /* leaf value change */
1985 LY_CHECK_GOTO(ret = lyd_diff_reverse_value(elem, mod), cleanup);
1986 LY_CHECK_GOTO(ret = lyd_diff_reverse_default(elem, mod), cleanup);
1987 break;
Michal Vaskobaba84e2021-02-05 16:33:30 +01001988 case LYS_ANYXML:
1989 case LYS_ANYDATA:
1990 /* any value change */
1991 LY_CHECK_GOTO(ret = lyd_diff_reverse_value(elem, mod), cleanup);
1992 break;
Michal Vasko0f5c6a52020-11-06 17:18:03 +01001993 case LYS_LEAFLIST:
1994 /* leaf-list move */
1995 LY_CHECK_GOTO(ret = lyd_diff_reverse_default(elem, mod), cleanup);
Michal Vaskoe78faec2021-04-08 17:24:43 +02001996 if (lysc_is_dup_inst_list(elem->schema)) {
1997 LY_CHECK_GOTO(ret = lyd_diff_reverse_meta(elem, mod, "orig-position", "position"), cleanup);
1998 } else {
1999 LY_CHECK_GOTO(ret = lyd_diff_reverse_meta(elem, mod, "orig-value", "value"), cleanup);
2000 }
Michal Vasko0f5c6a52020-11-06 17:18:03 +01002001 break;
2002 case LYS_LIST:
2003 /* list move */
Michal Vaskoe78faec2021-04-08 17:24:43 +02002004 if (lysc_is_dup_inst_list(elem->schema)) {
2005 LY_CHECK_GOTO(ret = lyd_diff_reverse_meta(elem, mod, "orig-position", "position"), cleanup);
2006 } else {
2007 LY_CHECK_GOTO(ret = lyd_diff_reverse_meta(elem, mod, "orig-key", "key"), cleanup);
2008 }
Michal Vasko0f5c6a52020-11-06 17:18:03 +01002009 break;
2010 default:
2011 LOGINT(LYD_CTX(src_diff));
2012 ret = LY_EINT;
2013 goto cleanup;
2014 }
Michal Vasko4231fb62020-07-13 13:54:47 +02002015 break;
Michal Vasko0f5c6a52020-11-06 17:18:03 +01002016 case LYD_DIFF_OP_NONE:
2017 switch (elem->schema->nodetype) {
2018 case LYS_LEAF:
2019 case LYS_LEAFLIST:
2020 /* default flag change */
2021 LY_CHECK_GOTO(ret = lyd_diff_reverse_default(elem, mod), cleanup);
2022 break;
2023 default:
2024 /* nothing to do */
2025 break;
2026 }
Michal Vasko4231fb62020-07-13 13:54:47 +02002027 break;
2028 }
Michal Vasko4231fb62020-07-13 13:54:47 +02002029 }
2030
Michal Vasko56daf732020-08-10 10:57:18 +02002031 LYD_TREE_DFS_END(root, elem);
Michal Vasko4231fb62020-07-13 13:54:47 +02002032 }
2033 }
2034
2035cleanup:
2036 if (ret) {
2037 lyd_free_siblings(*diff);
2038 *diff = NULL;
2039 }
2040 return ret;
2041}