data tree FEATURE use hashes of data nodes to be able to compare them effectively
diff --git a/tests/src/CMakeLists.txt b/tests/src/CMakeLists.txt
index a1aa577..7c20ce4 100644
--- a/tests/src/CMakeLists.txt
+++ b/tests/src/CMakeLists.txt
@@ -9,6 +9,7 @@
src_tree_schema_compile
src_tree_schema_helpers
src_printer_yang
+ src_tree_data
src_parser_xml)
set(local_tests_wraps
" "
@@ -21,6 +22,7 @@
" "
" "
" "
+ " "
" ")
set(tests ${tests} ${local_tests} PARENT_SCOPE)
set(tests_wraps ${tests_wraps} ${local_tests_wraps} PARENT_SCOPE)
diff --git a/tests/src/test_parser_xml.c b/tests/src/test_parser_xml.c
index 66ad1b0..9ade723 100644
--- a/tests/src/test_parser_xml.c
+++ b/tests/src/test_parser_xml.c
@@ -56,6 +56,7 @@
(void) state; /* unused */
const char *schema_a = "module a {namespace urn:tests:a;prefix a;yang-version 1.1;"
+ "list l1 { key \"a b\"; leaf a {type string;} leaf b {type string;} leaf c {type string;}}"
"leaf foo { type string;}"
"anydata any {config false;} }";
@@ -141,11 +142,34 @@
*state = NULL;
}
+static void
+test_list(void **state)
+{
+ *state = test_list;
+
+ const char *data = "<l1 xmlns=\"urn:tests:a\"><a>one</a><b>one</b><c>one</c></l1>";
+ struct lyd_node *tree, *iter;
+ struct lyd_node_inner *list;
+
+ assert_int_equal(LY_SUCCESS, lyd_parse_xml(ctx, data, 0, &tree));
+ assert_non_null(tree);
+ assert_int_equal(LYS_LIST, tree->schema->nodetype);
+ assert_string_equal("l1", tree->schema->name);
+ list = (struct lyd_node_inner*)tree;
+ LY_LIST_FOR(list->child, iter) {
+ assert_int_not_equal(0, iter->hash);
+ }
+
+ lyd_free_all(tree);
+ *state = NULL;
+}
+
int main(void)
{
const struct CMUnitTest tests[] = {
cmocka_unit_test_setup_teardown(test_leaf, setup, teardown),
cmocka_unit_test_setup_teardown(test_anydata, setup, teardown),
+ cmocka_unit_test_setup_teardown(test_list, setup, teardown),
};
return cmocka_run_group_tests(tests, NULL, NULL);
diff --git a/tests/src/test_tree_data.c b/tests/src/test_tree_data.c
new file mode 100644
index 0000000..dbc26ea
--- /dev/null
+++ b/tests/src/test_tree_data.c
@@ -0,0 +1,182 @@
+/*
+ * @file test_tree_schema.c
+ * @author: Radek Krejci <rkrejci@cesnet.cz>
+ * @brief unit tests for functions from tress_data.c
+ *
+ * Copyright (c) 2018-2019 CESNET, z.s.p.o.
+ *
+ * This source code is licensed under BSD 3-Clause License (the "License").
+ * You may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ * https://opensource.org/licenses/BSD-3-Clause
+ */
+
+#include <stdarg.h>
+#include <stddef.h>
+#include <stdio.h>
+#include <setjmp.h>
+#include <cmocka.h>
+
+#include "../../src/libyang.h"
+
+#define BUFSIZE 1024
+char logbuf[BUFSIZE] = {0};
+int store = -1; /* negative for infinite logging, positive for limited logging */
+
+struct ly_ctx *ctx; /* context for tests */
+
+/* set to 0 to printing error messages to stderr instead of checking them in code */
+#define ENABLE_LOGGER_CHECKING 1
+
+#if ENABLE_LOGGER_CHECKING
+static void
+logger(LY_LOG_LEVEL level, const char *msg, const char *path)
+{
+ (void) level; /* unused */
+ if (store) {
+ if (path && path[0]) {
+ snprintf(logbuf, BUFSIZE - 1, "%s %s", msg, path);
+ } else {
+ strncpy(logbuf, msg, BUFSIZE - 1);
+ }
+ if (store > 0) {
+ --store;
+ }
+ }
+}
+#endif
+
+static int
+setup(void **state)
+{
+ (void) state; /* unused */
+
+ const char *schema_a = "module a {namespace urn:tests:a;prefix a;yang-version 1.1;"
+ "list l1 { key \"a b\"; leaf a {type string;} leaf b {type string;} leaf c {type string;}}"
+ "leaf foo { type string;}"
+ "leaf-list ll { type string;}"
+ "container c {leaf-list x {type string;}}"
+ "anydata any {config false;}"
+ "list l2 {config false; container c{leaf x {type string;}}}}";
+
+#if ENABLE_LOGGER_CHECKING
+ ly_set_log_clb(logger, 1);
+#endif
+
+ assert_int_equal(LY_SUCCESS, ly_ctx_new(NULL, 0, &ctx));
+ assert_non_null(lys_parse_mem(ctx, schema_a, LYS_IN_YANG));
+
+ return 0;
+}
+
+static int
+teardown(void **state)
+{
+#if ENABLE_LOGGER_CHECKING
+ if (*state) {
+ fprintf(stderr, "%s\n", logbuf);
+ }
+#else
+ (void) state; /* unused */
+#endif
+
+ ly_ctx_destroy(ctx, NULL);
+ ctx = NULL;
+
+ return 0;
+}
+
+void
+logbuf_clean(void)
+{
+ logbuf[0] = '\0';
+}
+
+#if ENABLE_LOGGER_CHECKING
+# define logbuf_assert(str) assert_string_equal(logbuf, str)
+#else
+# define logbuf_assert(str)
+#endif
+
+static void
+test_compare(void **state)
+{
+ *state = test_compare;
+
+ struct lyd_node *tree1, *tree2;
+
+ const char *data1 = "<l1 xmlns=\"urn:tests:a\"><a>a</a><b>b</b><c>x</c></l1>";
+ const char *data2 = "<l1 xmlns=\"urn:tests:a\"><a>a</a><b>b</b><c>y</c></l1>";
+
+ assert_int_equal(LY_SUCCESS, lyd_compare(NULL, NULL, 0));
+
+ assert_non_null(tree1 = lyd_parse_mem(ctx, data1, LYD_XML, LYD_OPT_DATA));
+ assert_non_null(tree2 = lyd_parse_mem(ctx, data2, LYD_XML, LYD_OPT_DATA));
+ assert_int_equal(LY_SUCCESS, lyd_compare(tree1, tree2, 0));
+ assert_int_equal(LY_ENOT, lyd_compare(tree1, tree2, LYD_COMPARE_FULL_RECURSION));
+ assert_int_equal(LY_ENOT, lyd_compare(((struct lyd_node_inner*)tree1)->child, tree2, 0));
+ lyd_free_all(tree1);
+ lyd_free_all(tree2);
+
+ data1 = "<l2 xmlns=\"urn:tests:a\"><c><x>a</x></c></l2><l2 xmlns=\"urn:tests:a\"><c><x>b</x></c></l2>";
+ data2 = "<l2 xmlns=\"urn:tests:a\"><c><x>b</x></c></l2>";
+ assert_non_null(tree1 = lyd_parse_mem(ctx, data1, LYD_XML, LYD_OPT_DATA));
+ assert_non_null(tree2 = lyd_parse_mem(ctx, data2, LYD_XML, LYD_OPT_DATA));
+ assert_int_equal(LY_ENOT, lyd_compare(tree1, tree2, 0));
+ assert_int_equal(LY_SUCCESS, lyd_compare(tree1->next, tree2, 0));
+ lyd_free_all(tree1);
+ lyd_free_all(tree2);
+
+ data1 = "<ll xmlns=\"urn:tests:a\">a</ll><ll xmlns=\"urn:tests:a\">b</ll>";
+ data2 = "<ll xmlns=\"urn:tests:a\">b</ll>";
+ assert_non_null(tree1 = lyd_parse_mem(ctx, data1, LYD_XML, LYD_OPT_DATA));
+ assert_non_null(tree2 = lyd_parse_mem(ctx, data2, LYD_XML, LYD_OPT_DATA));
+ assert_int_equal(LY_ENOT, lyd_compare(tree1, tree2, 0));
+ assert_int_equal(LY_ENOT, lyd_compare(NULL, tree2, 0));
+ assert_int_equal(LY_ENOT, lyd_compare(tree1, NULL, 0));
+ assert_int_equal(LY_SUCCESS, lyd_compare(tree1->next, tree2, 0));
+ lyd_free_all(tree1);
+ lyd_free_all(tree2);
+
+ data1 = "<c xmlns=\"urn:tests:a\"><x>x</x></c>";
+ data2 = "<c xmlns=\"urn:tests:a\"><x>y</x></c>";
+ assert_non_null(tree1 = lyd_parse_mem(ctx, data1, LYD_XML, LYD_OPT_DATA));
+ assert_non_null(tree2 = lyd_parse_mem(ctx, data2, LYD_XML, LYD_OPT_DATA));
+ assert_int_equal(LY_SUCCESS, lyd_compare(tree1, tree2, 0));
+ assert_int_equal(LY_ENOT, lyd_compare(tree1, tree2, LYD_COMPARE_FULL_RECURSION));
+ lyd_free_all(tree1);
+ lyd_free_all(tree2);
+
+ data1 = "<c xmlns=\"urn:tests:a\"><x>x</x></c>";
+ data2 = "<c xmlns=\"urn:tests:a\"><x>x</x><x>y</x></c>";
+ assert_non_null(tree1 = lyd_parse_mem(ctx, data1, LYD_XML, LYD_OPT_DATA));
+ assert_non_null(tree2 = lyd_parse_mem(ctx, data2, LYD_XML, LYD_OPT_DATA));
+ assert_int_equal(LY_SUCCESS, lyd_compare(tree1, tree2, 0));
+ assert_int_equal(LY_ENOT, lyd_compare(tree1, tree2, LYD_COMPARE_FULL_RECURSION));
+ lyd_free_all(tree1);
+ lyd_free_all(tree2);
+
+ data1 = "<any xmlns=\"urn:tests:a\"><x>x</x></any>";
+ data2 = "<any xmlns=\"urn:tests:a\"><x>x</x><x>y</x></any>";
+ assert_non_null(tree1 = lyd_parse_mem(ctx, data1, LYD_XML, LYD_OPT_DATA));
+ assert_non_null(tree2 = lyd_parse_mem(ctx, data2, LYD_XML, LYD_OPT_DATA));
+ assert_int_equal(LY_ENOT, lyd_compare(tree1, tree2, 0));
+ lyd_free_all(tree1);
+ data1 = "<any xmlns=\"urn:tests:a\"><x>x</x><x>y</x></any>";
+ assert_non_null(tree1 = lyd_parse_mem(ctx, data1, LYD_XML, LYD_OPT_DATA));
+ assert_int_equal(LY_SUCCESS, lyd_compare(tree1, tree2, 0));
+ lyd_free_all(tree1);
+ lyd_free_all(tree2);
+
+ *state = NULL;
+}
+
+int main(void)
+{
+ const struct CMUnitTest tests[] = {
+ cmocka_unit_test_setup_teardown(test_compare, setup, teardown),
+ };
+
+ return cmocka_run_group_tests(tests, NULL, NULL);
+}