tests/utests/basic/test_xpath.c - github/CESNET/libyang - Gitiles

 /**
  * @file test_xpath.c
  * @author: Michal Vasko <mvasko@cesnet.cz>
  * @brief unit tests for XPath evaluation
  *
  * Copyright (c) 2020 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
  */
 #define _UTEST_MAIN_
 #include "utests.h"

 #include <string.h>

 #include "context.h"
 #include "parser_data.h"
 #include "set.h"
 #include "tests_config.h"
 #include "tree_data.h"
 #include "tree_schema.h"

 const char *schema_a =
         "module a {\n"
         "    namespace urn:tests:a;\n"
         "    prefix a;\n"
         "    yang-version 1.1;\n"
         "\n"
         "    identity id_a;\n"
         "    identity id_b {\n"
         "        base id_a;\n"
         "    }\n"
         "    identity id_c {\n"
         "        base id_b;\n"
         "    }\n"
         "\n"
         "    list l1 {\n"
         "        key \"a b\";\n"
         "        leaf a {\n"
         "            type string;\n"
         "        }\n"
         "        leaf b {\n"
         "            type string;\n"
         "        }\n"
         "        leaf c {\n"
         "            type string;\n"
         "        }\n"
         "    }\n"
         "    leaf foo {\n"
         "        type string;\n"
         "    }\n"
         "    leaf foo2 {\n"
         "        type uint8;\n"
         "    }\n"
         "    leaf foo3 {\n"
         "        type identityref {\n"
         "            base id_a;\n"
         "        }\n"
         "    }\n"
         "    container c {\n"
         "        leaf x {\n"
         "            type string;\n"
         "        }\n"
         "        list ll {\n"
         "            key \"a\";\n"
         "            leaf a {\n"
         "                type string;\n"
         "            }\n"
         "            list ll {\n"
         "                key \"a\";\n"
         "                leaf a {\n"
         "                    type string;\n"
         "                }\n"
         "                leaf b {\n"
         "                    type string;\n"
         "                }\n"
         "            }\n"
         "        }\n"
         "        leaf-list ll2 {\n"
         "            type string;\n"
         "        }\n"
         "    }\n"
         "}";

 static int
 setup(void **state)
 {
     UTEST_SETUP;

     UTEST_ADD_MODULE(schema_a, LYS_IN_YANG, NULL, NULL);

     return 0;
 }

 static void
 test_hash(void **state)
 {
     const char *data =
             "<l1 xmlns=\"urn:tests:a\">\n"
             "    <a>a1</a>\n"
             "    <b>b1</b>\n"
             "    <c>c1</c>\n"
             "</l1>\n"
             "<l1 xmlns=\"urn:tests:a\">\n"
             "    <a>a2</a>\n"
             "    <b>b2</b>\n"
             "</l1>\n"
             "<l1 xmlns=\"urn:tests:a\">\n"
             "    <a>a3</a>\n"
             "    <b>b3</b>\n"
             "    <c>c3</c>\n"
             "</l1>\n"
             "<foo xmlns=\"urn:tests:a\">foo value</foo>\n"
             "<c xmlns=\"urn:tests:a\">\n"
             "    <x>val</x>\n"
             "    <ll>\n"
             "        <a>val_a</a>\n"
             "        <ll>\n"
             "            <a>val_a</a>\n"
             "            <b>val</b>\n"
             "        </ll>\n"
             "        <ll>\n"
             "            <a>val_b</a>\n"
             "        </ll>\n"
             "    </ll>\n"
             "    <ll>\n"
             "        <a>val_b</a>\n"
             "        <ll>\n"
             "            <a>val_a</a>\n"
             "        </ll>\n"
             "        <ll>\n"
             "            <a>val_b</a>\n"
             "            <b>val</b>\n"
             "        </ll>\n"
             "    </ll>\n"
             "    <ll>\n"
             "        <a>val_c</a>\n"
             "        <ll>\n"
             "            <a>val_a</a>\n"
             "        </ll>\n"
             "        <ll>\n"
             "            <a>val_b</a>\n"
             "        </ll>\n"
             "    </ll>\n"
             "    <ll2>one</ll2>\n"
             "    <ll2>two</ll2>\n"
             "    <ll2>three</ll2>\n"
             "    <ll2>four</ll2>\n"
             "</c>";
     struct lyd_node *tree, *node;
     struct ly_set *set;

     assert_int_equal(LY_SUCCESS, lyd_parse_data_mem(UTEST_LYCTX, data, LYD_XML, LYD_PARSE_STRICT, LYD_VALIDATE_PRESENT, &tree));
     assert_non_null(tree);

     /* top-level, so hash table is not ultimately used but instances can be compared based on hashes */
     assert_int_equal(LY_SUCCESS, lyd_find_xpath(tree, "/a:l1[a='a3'][b='b3']", &set));
     assert_int_equal(1, set->count);

     node = set->objs[0];
     assert_string_equal(node->schema->name, "l1");
     node = lyd_child(node);
     assert_string_equal(node->schema->name, "a");
     assert_string_equal(lyd_get_value(node), "a3");

     ly_set_free(set, NULL);

     /* hashes should be used for both searches (well, there are not enough nested ll instances, so technically not true) */
     assert_int_equal(LY_SUCCESS, lyd_find_xpath(tree, "/a:c/ll[a='val_b']/ll[a='val_b']", &set));
     assert_int_equal(1, set->count);

     node = set->objs[0];
     assert_string_equal(node->schema->name, "ll");
     node = lyd_child(node);
     assert_string_equal(node->schema->name, "a");
     assert_string_equal(lyd_get_value(node), "val_b");
     node = node->next;
     assert_string_equal(node->schema->name, "b");
     assert_null(node->next);

     ly_set_free(set, NULL);

     /* hashes are not used */
     assert_int_equal(LY_SUCCESS, lyd_find_xpath(tree, "/a:c//ll[a='val_b']", &set));
     assert_int_equal(4, set->count);

     ly_set_free(set, NULL);

     /* hashes used even for leaf-lists */
     assert_int_equal(LY_SUCCESS, lyd_find_xpath(tree, "/a:c/ll2[. = 'three']", &set));
     assert_int_equal(1, set->count);

     node = set->objs[0];
     assert_string_equal(node->schema->name, "ll2");
     assert_string_equal(lyd_get_value(node), "three");

     ly_set_free(set, NULL);

     /* not found using hashes */
     assert_int_equal(LY_SUCCESS, lyd_find_xpath(tree, "/a:c/ll[a='val_d']", &set));
     assert_int_equal(0, set->count);

     ly_set_free(set, NULL);

     /* white-spaces are also ok */
     assert_int_equal(LY_SUCCESS, lyd_find_xpath(tree, "/a:c/ll[ \na = 'val_c' ]", &set));
     assert_int_equal(1, set->count);

     ly_set_free(set, NULL);

     lyd_free_all(tree);
 }

 static void
 test_toplevel(void **state)
 {
     const char *schema_b =
             "module b {\n"
             "    namespace urn:tests:b;\n"
             "    prefix b;\n"
             "    yang-version 1.1;\n"
             "\n"
             "    list l2 {\n"
             "        key \"a\";\n"
             "        leaf a {\n"
             "            type uint16;\n"
             "        }\n"
             "        leaf b {\n"
             "            type uint16;\n"
             "        }\n"
             "    }\n"
             "}";
     const char *data =
             "<l1 xmlns=\"urn:tests:a\">\n"
             "    <a>a1</a>\n"
             "    <b>b1</b>\n"
             "    <c>c1</c>\n"
             "</l1>\n"
             "<l1 xmlns=\"urn:tests:a\">\n"
             "    <a>a2</a>\n"
             "    <b>b2</b>\n"
             "</l1>\n"
             "<l1 xmlns=\"urn:tests:a\">\n"
             "    <a>a3</a>\n"
             "    <b>b3</b>\n"
             "    <c>c3</c>\n"
             "</l1>\n"
             "<foo xmlns=\"urn:tests:a\">foo value</foo>\n"
             "<l2 xmlns=\"urn:tests:b\">\n"
             "    <a>1</a>\n"
             "    <b>1</b>\n"
             "</l2>\n"
             "<l2 xmlns=\"urn:tests:b\">\n"
             "    <a>2</a>\n"
             "    <b>1</b>\n"
             "</l2>\n"
             "<l2 xmlns=\"urn:tests:b\">\n"
             "    <a>3</a>\n"
             "    <b>1</b>\n"
             "</l2>";
     struct lyd_node *tree;
     struct ly_set *set;

     UTEST_ADD_MODULE(schema_b, LYS_IN_YANG, NULL, NULL);

     assert_int_equal(LY_SUCCESS, lyd_parse_data_mem(UTEST_LYCTX, data, LYD_XML, LYD_PARSE_STRICT, LYD_VALIDATE_PRESENT, &tree));
     assert_non_null(tree);

     /* all top-level nodes from one module (default container as well) */
     assert_int_equal(LY_SUCCESS, lyd_find_xpath(tree, "/a:*", &set));
     assert_int_equal(5, set->count);

     ly_set_free(set, NULL);

     /* all top-level nodes from all modules */
     assert_int_equal(LY_SUCCESS, lyd_find_xpath(tree, "/*", &set));
     assert_int_equal(8, set->count);

     ly_set_free(set, NULL);

     /* all nodes from one module */
     assert_int_equal(LY_SUCCESS, lyd_find_xpath(tree, "//a:*", &set));
     assert_int_equal(13, set->count);

     ly_set_free(set, NULL);

     /* all nodes from all modules */
     assert_int_equal(LY_SUCCESS, lyd_find_xpath(tree, "//*", &set));
     assert_int_equal(22, set->count);

     ly_set_free(set, NULL);

     /* all nodes from all modules #2 */
     assert_int_equal(LY_SUCCESS, lyd_find_xpath(tree, "//.", &set));
     assert_int_equal(22, set->count);

     ly_set_free(set, NULL);

     lyd_free_all(tree);
 }

 static void
 test_atomize(void **state)
 {
     struct ly_set *set;
     const struct lys_module *mod;

     mod = ly_ctx_get_module_latest(UTEST_LYCTX, "a");
     assert_non_null(mod);

     /* some random paths just making sure the API function works */
     assert_int_equal(LY_SUCCESS, lys_find_xpath_atoms(UTEST_LYCTX, NULL, "/a:*", 0, &set));
     assert_int_equal(5, set->count);

     ly_set_free(set, NULL);

     /* all nodes from all modules (including internal, which can change easily, so check just the test modules) */
     assert_int_equal(LY_SUCCESS, lys_find_xpath_atoms(UTEST_LYCTX, NULL, "//.", 0, &set));
     assert_in_range(set->count, 17, UINT32_MAX);

     ly_set_free(set, NULL);

     assert_int_equal(LY_SUCCESS, lys_find_xpath_atoms(UTEST_LYCTX, NULL, "/a:c/ll[a='val1']/ll[a='val2']/b", 0, &set));
     assert_int_equal(6, set->count);

     ly_set_free(set, NULL);
 }

 static void
 test_canonize(void **state)
 {
     const char *data =
             "<foo2 xmlns=\"urn:tests:a\">50</foo2>";
     struct lyd_node *tree;
     struct ly_set *set;

     assert_int_equal(LY_SUCCESS, lyd_parse_data_mem(UTEST_LYCTX, data, LYD_XML, LYD_PARSE_STRICT, LYD_VALIDATE_PRESENT, &tree));
     assert_non_null(tree);

     assert_int_equal(LY_SUCCESS, lyd_find_xpath(tree, "/a:foo2[.='050']", &set));
     assert_int_equal(1, set->count);
     ly_set_free(set, NULL);

     /* TODO more use-cases once there are some type plugins that have canonical values */

     lyd_free_all(tree);
 }

 static void
 test_derived_from(void **state)
 {
     const char *data =
             "<foo3 xmlns=\"urn:tests:a\">id_c</foo3>";
     struct lyd_node *tree;
     struct ly_set *set;

     assert_int_equal(LY_SUCCESS, lyd_parse_data_mem(UTEST_LYCTX, data, LYD_XML, LYD_PARSE_STRICT, LYD_VALIDATE_PRESENT, &tree));
     assert_non_null(tree);

     assert_int_equal(LY_SUCCESS, lyd_find_xpath(tree, "/a:foo3[derived-from(., 'a:id_b')]", &set));
     assert_int_equal(1, set->count);
     ly_set_free(set, NULL);

     assert_int_equal(LY_SUCCESS, lyd_find_xpath(tree, "/a:foo3[derived-from(., 'a:id_a')]", &set));
     assert_int_equal(1, set->count);
     ly_set_free(set, NULL);

     lyd_free_all(tree);
 }

 int
 main(void)
 {
     const struct CMUnitTest tests[] = {
         UTEST(test_hash, setup),
         UTEST(test_toplevel, setup),
         UTEST(test_atomize, setup),
         UTEST(test_canonize, setup),
         UTEST(test_derived_from, setup),
     };

     return cmocka_run_group_tests(tests, NULL, NULL);
 }
	/**
	* @file test_xpath.c
	* @author: Michal Vasko <mvasko@cesnet.cz>
	* @brief unit tests for XPath evaluation
	*
	* Copyright (c) 2020 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
	*/
	#define _UTEST_MAIN_
	#include "utests.h"

	#include <string.h>

	#include "context.h"
	#include "parser_data.h"
	#include "set.h"
	#include "tests_config.h"
	#include "tree_data.h"
	#include "tree_schema.h"

	const char *schema_a =
	"module a {\n"
	" namespace urn:tests:a;\n"
	" prefix a;\n"
	" yang-version 1.1;\n"
	"\n"
	" identity id_a;\n"
	" identity id_b {\n"
	" base id_a;\n"
	" }\n"
	" identity id_c {\n"
	" base id_b;\n"
	" }\n"
	"\n"
	" list l1 {\n"
	" key \"a b\";\n"
	" leaf a {\n"
	" type string;\n"
	" }\n"
	" leaf b {\n"
	" type string;\n"
	" }\n"
	" leaf c {\n"
	" type string;\n"
	" }\n"
	" }\n"
	" leaf foo {\n"
	" type string;\n"
	" }\n"
	" leaf foo2 {\n"
	" type uint8;\n"
	" }\n"
	" leaf foo3 {\n"
	" type identityref {\n"
	" base id_a;\n"
	" }\n"
	" }\n"
	" container c {\n"
	" leaf x {\n"
	" type string;\n"
	" }\n"
	" list ll {\n"
	" key \"a\";\n"
	" leaf a {\n"
	" type string;\n"
	" }\n"
	" list ll {\n"
	" key \"a\";\n"
	" leaf a {\n"
	" type string;\n"
	" }\n"
	" leaf b {\n"
	" type string;\n"
	" }\n"
	" }\n"
	" }\n"
	" leaf-list ll2 {\n"
	" type string;\n"
	" }\n"
	" }\n"
	"}";

	static int
	setup(void **state)
	{
	UTEST_SETUP;

	UTEST_ADD_MODULE(schema_a, LYS_IN_YANG, NULL, NULL);

	return 0;
	}

	static void
	test_hash(void **state)
	{
	const char *data =
	"<l1 xmlns=\"urn:tests:a\">\n"
	" <a>a1</a>\n"
	" <b>b1</b>\n"
	" <c>c1</c>\n"
	"</l1>\n"
	"<l1 xmlns=\"urn:tests:a\">\n"
	" <a>a2</a>\n"
	" <b>b2</b>\n"
	"</l1>\n"
	"<l1 xmlns=\"urn:tests:a\">\n"
	" <a>a3</a>\n"
	" <b>b3</b>\n"
	" <c>c3</c>\n"
	"</l1>\n"
	"<foo xmlns=\"urn:tests:a\">foo value</foo>\n"
	"<c xmlns=\"urn:tests:a\">\n"
	" <x>val</x>\n"
	" <ll>\n"
	" <a>val_a</a>\n"
	" <ll>\n"
	" <a>val_a</a>\n"
	" <b>val</b>\n"
	" </ll>\n"
	" <ll>\n"
	" <a>val_b</a>\n"
	" </ll>\n"
	" </ll>\n"
	" <ll>\n"
	" <a>val_b</a>\n"
	" <ll>\n"
	" <a>val_a</a>\n"
	" </ll>\n"
	" <ll>\n"
	" <a>val_b</a>\n"
	" <b>val</b>\n"
	" </ll>\n"
	" </ll>\n"
	" <ll>\n"
	" <a>val_c</a>\n"
	" <ll>\n"
	" <a>val_a</a>\n"
	" </ll>\n"
	" <ll>\n"
	" <a>val_b</a>\n"
	" </ll>\n"
	" </ll>\n"
	" <ll2>one</ll2>\n"
	" <ll2>two</ll2>\n"
	" <ll2>three</ll2>\n"
	" <ll2>four</ll2>\n"
	"</c>";
	struct lyd_node tree, node;
	struct ly_set *set;

	assert_int_equal(LY_SUCCESS, lyd_parse_data_mem(UTEST_LYCTX, data, LYD_XML, LYD_PARSE_STRICT, LYD_VALIDATE_PRESENT, &tree));
	assert_non_null(tree);

	/* top-level, so hash table is not ultimately used but instances can be compared based on hashes */
	assert_int_equal(LY_SUCCESS, lyd_find_xpath(tree, "/a:l1[a='a3'][b='b3']", &set));
	assert_int_equal(1, set->count);

	node = set->objs[0];
	assert_string_equal(node->schema->name, "l1");
	node = lyd_child(node);
	assert_string_equal(node->schema->name, "a");
	assert_string_equal(lyd_get_value(node), "a3");

	ly_set_free(set, NULL);

	/* hashes should be used for both searches (well, there are not enough nested ll instances, so technically not true) */
	assert_int_equal(LY_SUCCESS, lyd_find_xpath(tree, "/a:c/ll[a='val_b']/ll[a='val_b']", &set));
	assert_int_equal(1, set->count);

	node = set->objs[0];
	assert_string_equal(node->schema->name, "ll");
	node = lyd_child(node);
	assert_string_equal(node->schema->name, "a");
	assert_string_equal(lyd_get_value(node), "val_b");
	node = node->next;
	assert_string_equal(node->schema->name, "b");
	assert_null(node->next);

	ly_set_free(set, NULL);

	/* hashes are not used */
	assert_int_equal(LY_SUCCESS, lyd_find_xpath(tree, "/a:c//ll[a='val_b']", &set));
	assert_int_equal(4, set->count);

	ly_set_free(set, NULL);

	/* hashes used even for leaf-lists */
	assert_int_equal(LY_SUCCESS, lyd_find_xpath(tree, "/a:c/ll2[. = 'three']", &set));
	assert_int_equal(1, set->count);

	node = set->objs[0];
	assert_string_equal(node->schema->name, "ll2");
	assert_string_equal(lyd_get_value(node), "three");

	ly_set_free(set, NULL);

	/* not found using hashes */
	assert_int_equal(LY_SUCCESS, lyd_find_xpath(tree, "/a:c/ll[a='val_d']", &set));
	assert_int_equal(0, set->count);

	ly_set_free(set, NULL);

	/* white-spaces are also ok */
	assert_int_equal(LY_SUCCESS, lyd_find_xpath(tree, "/a:c/ll[ \na = 'val_c' ]", &set));
	assert_int_equal(1, set->count);

	ly_set_free(set, NULL);

	lyd_free_all(tree);
	}

	static void
	test_toplevel(void **state)
	{
	const char *schema_b =
	"module b {\n"
	" namespace urn:tests:b;\n"
	" prefix b;\n"
	" yang-version 1.1;\n"
	"\n"
	" list l2 {\n"
	" key \"a\";\n"
	" leaf a {\n"
	" type uint16;\n"
	" }\n"
	" leaf b {\n"
	" type uint16;\n"
	" }\n"
	" }\n"
	"}";
	const char *data =
	"<l1 xmlns=\"urn:tests:a\">\n"
	" <a>a1</a>\n"
	" <b>b1</b>\n"
	" <c>c1</c>\n"
	"</l1>\n"
	"<l1 xmlns=\"urn:tests:a\">\n"
	" <a>a2</a>\n"
	" <b>b2</b>\n"
	"</l1>\n"
	"<l1 xmlns=\"urn:tests:a\">\n"
	" <a>a3</a>\n"
	" <b>b3</b>\n"
	" <c>c3</c>\n"
	"</l1>\n"
	"<foo xmlns=\"urn:tests:a\">foo value</foo>\n"
	"<l2 xmlns=\"urn:tests:b\">\n"
	" <a>1</a>\n"
	" <b>1</b>\n"
	"</l2>\n"
	"<l2 xmlns=\"urn:tests:b\">\n"
	" <a>2</a>\n"
	" <b>1</b>\n"
	"</l2>\n"
	"<l2 xmlns=\"urn:tests:b\">\n"
	" <a>3</a>\n"
	" <b>1</b>\n"
	"</l2>";
	struct lyd_node *tree;
	struct ly_set *set;

	UTEST_ADD_MODULE(schema_b, LYS_IN_YANG, NULL, NULL);

	assert_int_equal(LY_SUCCESS, lyd_parse_data_mem(UTEST_LYCTX, data, LYD_XML, LYD_PARSE_STRICT, LYD_VALIDATE_PRESENT, &tree));
	assert_non_null(tree);

	/* all top-level nodes from one module (default container as well) */
	assert_int_equal(LY_SUCCESS, lyd_find_xpath(tree, "/a:*", &set));
	assert_int_equal(5, set->count);

	ly_set_free(set, NULL);

	/* all top-level nodes from all modules */
	assert_int_equal(LY_SUCCESS, lyd_find_xpath(tree, "/*", &set));
	assert_int_equal(8, set->count);

	ly_set_free(set, NULL);

	/* all nodes from one module */
	assert_int_equal(LY_SUCCESS, lyd_find_xpath(tree, "//a:*", &set));
	assert_int_equal(13, set->count);

	ly_set_free(set, NULL);

	/* all nodes from all modules */
	assert_int_equal(LY_SUCCESS, lyd_find_xpath(tree, "//*", &set));
	assert_int_equal(22, set->count);

	ly_set_free(set, NULL);

	/* all nodes from all modules #2 */
	assert_int_equal(LY_SUCCESS, lyd_find_xpath(tree, "//.", &set));
	assert_int_equal(22, set->count);

	ly_set_free(set, NULL);

	lyd_free_all(tree);
	}

	static void
	test_atomize(void **state)
	{
	struct ly_set *set;
	const struct lys_module *mod;

	mod = ly_ctx_get_module_latest(UTEST_LYCTX, "a");
	assert_non_null(mod);

	/* some random paths just making sure the API function works */
	assert_int_equal(LY_SUCCESS, lys_find_xpath_atoms(UTEST_LYCTX, NULL, "/a:*", 0, &set));
	assert_int_equal(5, set->count);

	ly_set_free(set, NULL);

	/* all nodes from all modules (including internal, which can change easily, so check just the test modules) */
	assert_int_equal(LY_SUCCESS, lys_find_xpath_atoms(UTEST_LYCTX, NULL, "//.", 0, &set));
	assert_in_range(set->count, 17, UINT32_MAX);

	ly_set_free(set, NULL);

	assert_int_equal(LY_SUCCESS, lys_find_xpath_atoms(UTEST_LYCTX, NULL, "/a:c/ll[a='val1']/ll[a='val2']/b", 0, &set));
	assert_int_equal(6, set->count);

	ly_set_free(set, NULL);
	}

	static void
	test_canonize(void **state)
	{
	const char *data =
	"<foo2 xmlns=\"urn:tests:a\">50</foo2>";
	struct lyd_node *tree;
	struct ly_set *set;

	assert_int_equal(LY_SUCCESS, lyd_parse_data_mem(UTEST_LYCTX, data, LYD_XML, LYD_PARSE_STRICT, LYD_VALIDATE_PRESENT, &tree));
	assert_non_null(tree);

	assert_int_equal(LY_SUCCESS, lyd_find_xpath(tree, "/a:foo2[.='050']", &set));
	assert_int_equal(1, set->count);
	ly_set_free(set, NULL);

	/* TODO more use-cases once there are some type plugins that have canonical values */

	lyd_free_all(tree);
	}

	static void
	test_derived_from(void **state)
	{
	const char *data =
	"<foo3 xmlns=\"urn:tests:a\">id_c</foo3>";
	struct lyd_node *tree;
	struct ly_set *set;

	assert_int_equal(LY_SUCCESS, lyd_parse_data_mem(UTEST_LYCTX, data, LYD_XML, LYD_PARSE_STRICT, LYD_VALIDATE_PRESENT, &tree));
	assert_non_null(tree);

	assert_int_equal(LY_SUCCESS, lyd_find_xpath(tree, "/a:foo3[derived-from(., 'a:id_b')]", &set));
	assert_int_equal(1, set->count);
	ly_set_free(set, NULL);

	assert_int_equal(LY_SUCCESS, lyd_find_xpath(tree, "/a:foo3[derived-from(., 'a:id_a')]", &set));
	assert_int_equal(1, set->count);
	ly_set_free(set, NULL);

	lyd_free_all(tree);
	}

	int
	main(void)
	{
	const struct CMUnitTest tests[] = {
	UTEST(test_hash, setup),
	UTEST(test_toplevel, setup),
	UTEST(test_atomize, setup),
	UTEST(test_canonize, setup),
	UTEST(test_derived_from, setup),
	};

	return cmocka_run_group_tests(tests, NULL, NULL);
	}