tree data UPDATE lyd_find_sibling_* must ignore opaque nodes
They cannot be returned because hash search will
never find them so there would be a functional
difference when hashes are used and when not.
diff --git a/src/tree_data.c b/src/tree_data.c
index 72f9fd5..7cd608e 100644
--- a/src/tree_data.c
+++ b/src/tree_data.c
@@ -2655,7 +2655,7 @@
break;
}
} else {
- if (!lyd_compare_single(siblings, target, LYD_COMPARE_OPAQ)) {
+ if (!lyd_compare_single(siblings, target, 0)) {
break;
}
}
@@ -2757,7 +2757,7 @@
}
/* set options */
- comp_opts = LYD_COMPARE_OPAQ | (lysc_is_dup_inst_list(target->schema) ? LYD_COMPARE_FULL_RECURSION : 0);
+ comp_opts = (lysc_is_dup_inst_list(target->schema) ? LYD_COMPARE_FULL_RECURSION : 0);
/* get first sibling */
siblings = lyd_first_sibling(siblings);