#ifndef PUGIXML_NO_XPATH #include "common.hpp" #include #include #include #include #include #include static void load_document_copy(xml_document& doc, const char_t* text) { xml_document source; CHECK(source.load(text)); doc.append_copy(source.first_child()); } TEST(xpath_allocator_many_pages) { std::basic_string query = STR("0"); for (int i = 0; i < 128; ++i) query += STR("+string-length('abcdefgh')"); CHECK_XPATH_NUMBER(xml_node(), query.c_str(), 1024); } TEST(xpath_allocator_large_page) { std::basic_string query; for (int i = 0; i < 1024; ++i) query += STR("abcdefgh"); CHECK_XPATH_NUMBER(xml_node(), (STR("string-length('") + query + STR("')")).c_str(), 8192); } TEST_XML(xpath_sort_complex, "test") { // just some random union order, it should not matter probably? xpath_node_set ns = doc.child(STR("node")).select_nodes(STR("child1 | child2 | child1/@* | . | child2/@* | child2/text()")); ns.sort(false); xpath_node_set sorted = ns; ns.sort(true); xpath_node_set reverse_sorted = ns; xpath_node_set_tester(sorted, "sorted order failed") % 2 % 3 % 4 % 5 % 6 % 7 % 8; xpath_node_set_tester(reverse_sorted, "reverse sorted order failed") % 8 % 7 % 6 % 5 % 4 % 3 % 2; } TEST(xpath_sort_complex_copy) // copy the document so that document order optimization does not work { xml_document doc; load_document_copy(doc, STR("test")); // just some random union order, it should not matter probably? xpath_node_set ns = doc.child(STR("node")).select_nodes(STR("child1 | child2 | child1/@* | . | child2/@* | child2/text()")); ns.sort(false); xpath_node_set sorted = ns; ns.sort(true); xpath_node_set reverse_sorted = ns; xpath_node_set_tester(sorted, "sorted order failed") % 2 % 3 % 4 % 5 % 6 % 7 % 8; xpath_node_set_tester(reverse_sorted, "reverse sorted order failed") % 8 % 7 % 6 % 5 % 4 % 3 % 2; } TEST_XML(xpath_sort_children, "") { xpath_node_set ns = doc.child(STR("node")).select_nodes(STR("child/subchild[@id=1] | child/subchild[@id=2]")); ns.sort(false); xpath_node_set sorted = ns; ns.sort(true); xpath_node_set reverse_sorted = ns; xpath_node_set_tester(sorted, "sorted order failed") % 4 % 7; xpath_node_set_tester(reverse_sorted, "reverse sorted order failed") % 7 % 4; } TEST(xpath_sort_children_copy) // copy the document so that document order optimization does not work { xml_document doc; load_document_copy(doc, STR("")); xpath_node_set ns = doc.child(STR("node")).select_nodes(STR("child/subchild[@id=1] | child/subchild[@id=2]")); ns.sort(false); xpath_node_set sorted = ns; ns.sort(true); xpath_node_set reverse_sorted = ns; xpath_node_set_tester(sorted, "sorted order failed") % 4 % 7; xpath_node_set_tester(reverse_sorted, "reverse sorted order failed") % 7 % 4; } TEST_XML(xpath_sort_attributes, "") { xml_node n = doc.child(STR("node")); // we need to insert attributes manually since unsorted node sets are (always?) sorted via pointers because of remove_duplicates, // so we need to have different document and pointer order to cover all comparator cases n.append_attribute(STR("attr2")); n.append_attribute(STR("attr3")); n.insert_attribute_before(STR("attr1"), n.attribute(STR("attr2"))); xpath_node_set ns = n.select_nodes(STR("@*")); ns.sort(true); xpath_node_set reverse_sorted = ns; ns.sort(false); xpath_node_set sorted = ns; xpath_node_set_tester(sorted, "sorted order failed") % 3 % 4 % 5; xpath_node_set_tester(reverse_sorted, "reverse sorted order failed") % 5 % 4 % 3; } TEST(xpath_sort_random_medium) { xml_document doc; load_document_copy(doc, STR("") STR("testtest") STR("testtest") STR("testtest") STR("")); xpath_node_set ns = doc.select_nodes(STR("//node() | //@*")); std::vector nsv(ns.begin(), ns.end()); std::random_shuffle(nsv.begin(), nsv.end()); xpath_node_set copy(&nsv[0], &nsv[0] + nsv.size()); copy.sort(); xpath_node_set_tester tester(copy, "sorted order failed"); for (unsigned int i = 2; i < 39; ++i) tester % i; } TEST(xpath_sort_random_large) { xml_document doc; load_document_copy(doc, STR("") STR("testtest") STR("testtest") STR("testtest") STR("testtest") STR("testtest") STR("testtest") STR("testtest") STR("testtest") STR("testtest") STR("testtest") STR("test")); xpath_node_set ns = doc.select_nodes(STR("//node() | //@*")); std::vector nsv(ns.begin(), ns.end()); std::random_shuffle(nsv.begin(), nsv.end()); xpath_node_set copy(&nsv[0], &nsv[0] + nsv.size()); copy.sort(); xpath_node_set_tester tester(copy, "sorted order failed"); for (unsigned int i = 2; i < 129; ++i) tester % i; } TEST(xpath_long_numbers_parse) { const pugi::char_t* str_flt_max = STR("340282346638528860000000000000000000000"); const pugi::char_t* str_flt_max_dec = STR("340282346638528860000000000000000000000.000000"); const pugi::char_t* str_dbl_max = STR("179769313486231570000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000"); const pugi::char_t* str_dbl_max_dec = STR("179769313486231570000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.000000"); xml_node c; // check parsing CHECK_XPATH_NUMBER(c, str_flt_max, std::numeric_limits::max()); CHECK_XPATH_NUMBER(c, str_flt_max_dec, std::numeric_limits::max()); CHECK_XPATH_NUMBER(c, str_dbl_max, std::numeric_limits::max()); CHECK_XPATH_NUMBER(c, str_dbl_max_dec, std::numeric_limits::max()); } static bool test_xpath_string_prefix(const pugi::xml_node& node, const pugi::char_t* query, const pugi::char_t* expected, size_t match_length) { pugi::xpath_query q(query); pugi::char_t result[32]; size_t size = q.evaluate_string(result, sizeof(result) / sizeof(result[0]), node); size_t expected_length = std::char_traits::length(expected); return size == expected_length + 1 && std::char_traits::compare(result, expected, match_length) == 0; } TEST(xpath_long_numbers_stringize) { const pugi::char_t* str_flt_max = STR("340282346638528860000000000000000000000"); const pugi::char_t* str_flt_max_dec = STR("340282346638528860000000000000000000000.000000"); const pugi::char_t* str_dbl_max = STR("179769313486231570000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000"); const pugi::char_t* str_dbl_max_dec = STR("179769313486231570000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.000000"); xml_node c; CHECK(test_xpath_string_prefix(c, str_flt_max, str_flt_max, 15)); CHECK(test_xpath_string_prefix(c, str_flt_max_dec, str_flt_max, 15)); CHECK(test_xpath_string_prefix(c, str_dbl_max, str_dbl_max, 15)); CHECK(test_xpath_string_prefix(c, str_dbl_max_dec, str_dbl_max, 15)); } TEST(xpath_denorm_numbers) { std::basic_string query; // 10^-318 - double denormal for (int i = 0; i < 106; ++i) { if (i != 0) query += STR(" * "); query += STR("0.001"); } CHECK_XPATH_STRING(xml_node(), query.c_str(), STR("0.0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000009999987484955998")); } TEST_XML(xpath_rexml_1, "") { CHECK_XPATH_NODESET(doc, STR("//*[local-name()='c' and @id='b']")) % 6; CHECK_XPATH_NODESET(doc, STR("//*[ local-name()='c' and @id='b' ]")) % 6; CHECK_XPATH_NODESET(doc, STR("/a/c[@id]")) % 6; CHECK_XPATH_NODESET(doc, STR("/a/c[(@id)]")) % 6; CHECK_XPATH_NODESET(doc, STR("/a/c[ @id ]")) % 6; CHECK_XPATH_NODESET(doc, STR("/a/c[ (@id) ]")) % 6; CHECK_XPATH_NODESET(doc, STR("/a/c[( @id )]")) % 6; CHECK_XPATH_NODESET(doc, STR("/a/c[ ( @id ) ]")) % 6; CHECK_XPATH_NODESET(doc, STR("/a/c [ ( @id ) ] ")) % 6; CHECK_XPATH_NODESET(doc, STR(" / a / c [ ( @id ) ] ")) % 6; } TEST_XML(xpath_rexml_2, "zzz") { CHECK_XPATH_NODESET(doc, STR("a:x/a:y[@p='p' and @q='q']/a:z/text()")) % 8; } TEST_XML(xpath_rexml_3, "
free flowing text.
free flowing text.
free flowing text.
") { CHECK_XPATH_NODESET(doc, STR("//section[../self::section[@role=\"division\"]]")) % 10 % 15; CHECK_XPATH_NODESET(doc, STR("//section[@role=\"subdivision\" and not(../self::section[@role=\"division\"])]")) % 3; CHECK_XPATH_NODESET(doc, STR("//section[@role=\"subdivision\"][not(../self::section[@role=\"division\"])]")) % 3; } TEST_XML_FLAGS(xpath_rexml_4, "TEXT1TEXT2", parse_default | parse_comments) { CHECK_XPATH_NODESET(doc, STR("/descendant-or-self::node()[count(child::node()|following-sibling::node()|preceding-sibling::node())=0]")) % 6 % 17 % 20; } TEST_XML(xpath_rexml_5, "") { CHECK_XPATH_FAIL(STR(".//[@id]")); CHECK_XPATH_NODESET(doc, STR(".//self::*[@id]")) % 4 % 6; CHECK_XPATH_NODESET(doc, STR(".//node()[@id]")) % 4 % 6; } TEST_XML(xpath_rexml_6, "
ab
") { CHECK_XPATH_NODESET(doc, STR("//em|//strong")) % 4 % 6; CHECK_XPATH_NODESET(doc, STR("//*[self::em | self::strong]")) % 4 % 6; CHECK_XPATH_NODESET(doc, STR("//*[name()=\"em\" or name()=\"strong\"]")) % 4 % 6; CHECK_XPATH_NODESET(doc, STR("//*[self::em or self::strong]")) % 4 % 6; } TEST_XML(xpath_xsl_list_1, "whatevertextselectsomething") { // if I'm not last, and the next input/type isn't select CHECK_XPATH_NODESET(doc, STR("input[type[parent::input/following-sibling::input[1]/type != 'select']]")) % 2 % 8; CHECK_XPATH_NODESET(doc, STR("input[type[../following-sibling::input[1]/type != 'select']]")) % 2 % 8; CHECK_XPATH_NODESET(doc, STR("input[position()+1]")); } TEST_XML(xpath_xsl_list_2, "text1text2text3text4") { CHECK_XPATH_FAIL(STR(".[not(.=ancestor::TR/TD[15]/node())]")); CHECK_XPATH_NODESET(doc.child(STR("TR")).find_child_by_attribute(STR("TD"), STR("id"), STR("1")).first_child(), STR("self::node()[not(.=ancestor::TR/TD[3]/node())]")) % 5; CHECK_XPATH_NODESET(doc.child(STR("TR")).find_child_by_attribute(STR("TD"), STR("id"), STR("2")).first_child(), STR("self::node()[not(.=ancestor::TR/TD[3]/node())]")) % 8; CHECK_XPATH_NODESET(doc.child(STR("TR")).find_child_by_attribute(STR("TD"), STR("id"), STR("3")).first_child(), STR("self::node()[not(.=ancestor::TR/TD[3]/node())]")); CHECK_XPATH_NODESET(doc.child(STR("TR")).find_child_by_attribute(STR("TD"), STR("id"), STR("4")).first_child(), STR("self::node()[not(.=ancestor::TR/TD[3]/node())]")) % 14; CHECK_XPATH_NODESET(doc.child(STR("TR")).find_child_by_attribute(STR("TD"), STR("id"), STR("1")), STR("node()[not(.=ancestor::TR/TD[3]/node())]")) % 5; CHECK_XPATH_NODESET(doc.child(STR("TR")).find_child_by_attribute(STR("TD"), STR("id"), STR("2")), STR("node()[not(.=ancestor::TR/TD[3]/node())]")) % 8; CHECK_XPATH_NODESET(doc.child(STR("TR")).find_child_by_attribute(STR("TD"), STR("id"), STR("3")), STR("node()[not(.=ancestor::TR/TD[3]/node())]")); CHECK_XPATH_NODESET(doc.child(STR("TR")).find_child_by_attribute(STR("TD"), STR("id"), STR("4")), STR("node()[not(.=ancestor::TR/TD[3]/node())]")) % 14; } TEST_XML(xpath_star_token, "0.5
") { CHECK_XPATH_NODESET(doc, STR("//*[/* * 4]")) % 6 % 9; CHECK_XPATH_NODESET(doc, STR("//*[/**4]")) % 6 % 9; CHECK_XPATH_FAIL(STR("//*[/***4]")); } TEST(xpath_miscellaneous) { CHECK_XPATH_FAIL(STR("/root/child[a=3]/substring(child::text())")); CHECK_XPATH_NODESET(xml_node(), STR("foo/@FOO/@bar")); } TEST_XML(xpath_context_node, "5") { CHECK_XPATH_NODESET(doc, STR("node")) % 2; CHECK_XPATH_BOOLEAN(doc, STR("node"), true); CHECK_XPATH_NUMBER(doc, STR("node"), 5); CHECK_XPATH_STRING(doc, STR("node"), STR("5")); } TEST_XML(xpath_context_position, "5") { CHECK_XPATH_NODESET(doc, STR("id(position() + last())")); CHECK_XPATH_BOOLEAN(doc, STR("position() + last() = 2"), true); CHECK_XPATH_NUMBER(doc, STR("position() + last()"), 2); CHECK_XPATH_STRING(doc, STR("position() + last()"), STR("2")); } TEST(xpath_lexer_unknown_lexeme) { CHECK_XPATH_FAIL(STR("(^3))")); CHECK_XPATH_FAIL(STR("(!3))")); } TEST(xpath_large_node_set) { xml_document doc; CHECK(doc.load_file("tests/data/large.xml")); xpath_node_set ns = doc.select_nodes(STR("//*")); CHECK(ns.size() == 10001); } TEST(xpath_out_of_memory_evaluate_concat) { test_runner::_memory_fail_threshold = 4196 * sizeof(char_t) + 4096 * 2; std::basic_string query = STR("concat(\"a\", \""); query.resize(4196, 'a'); query += STR("\")"); pugi::xpath_query q(query.c_str()); #ifdef PUGIXML_NO_EXCEPTIONS CHECK(q.evaluate_string(0, 0, xml_node()) == 1); #else try { q.evaluate_string(0, 0, xml_node()); CHECK_FORCE_FAIL("Expected out of memory exception"); } catch (const std::bad_alloc&) { } #endif } TEST(xpath_out_of_memory_evaluate_substring) { test_runner::_memory_fail_threshold = 4196 * sizeof(char_t) + 4096 * 2; std::basic_string query = STR("substring(\""); query.resize(4196, 'a'); query += STR("\", 1, 4097)"); pugi::xpath_query q(query.c_str()); #ifdef PUGIXML_NO_EXCEPTIONS CHECK(q.evaluate_string(0, 0, xml_node()) == 1); #else try { q.evaluate_string(0, 0, xml_node()); CHECK_FORCE_FAIL("Expected out of memory exception"); } catch (const std::bad_alloc&) { } #endif } TEST_XML(xpath_out_of_memory_evaluate_union, "") { test_runner::_memory_fail_threshold = 32768 + 4096 * 2; pugi::xpath_query q(STR("a|(a|(a|(a|(a|(a|(a|(a|(a|(a|(a|(a|(a|(a|(a|(a|(a|(a|(a|(a|a)))))))))))))))))))")); #ifdef PUGIXML_NO_EXCEPTIONS CHECK(q.evaluate_node_set(doc.child(STR("node"))).empty()); #else try { q.evaluate_node_set(doc.child(STR("node"))); CHECK_FORCE_FAIL("Expected out of memory exception"); } catch (const std::bad_alloc&) { } #endif } TEST_XML(xpath_out_of_memory_evaluate_predicate, "") { test_runner::_memory_fail_threshold = 32768 + 4096 * 2; pugi::xpath_query q(STR("//a[//a[//a[//a[//a[//a[//a[//a[//a[//a[//a[//a[//a[//a[true()]]]]]]]]]]]]]]")); #ifdef PUGIXML_NO_EXCEPTIONS CHECK(q.evaluate_node_set(doc).empty()); #else try { q.evaluate_node_set(doc); CHECK_FORCE_FAIL("Expected out of memory exception"); } catch (const std::bad_alloc&) { } #endif } TEST(xpath_memory_concat_massive) { pugi::xml_document doc; pugi::xml_node node = doc.append_child(STR("node")); for (int i = 0; i < 5000; ++i) node.append_child(STR("c")).text().set(i % 10); pugi::xpath_query q(STR("/")); size_t size = q.evaluate_string(0, 0, node); CHECK(size == 5001); } TEST_XML(xpath_sort_copy_share, "test") { // copy sharing shares the name/value data for nodes that can potentially make document order optimization invalid (silently) xml_node node = doc.child(STR("node")); xml_node child1 = node.child(STR("child1")); xml_node child2 = node.child(STR("child2")); // swap child1 & child2 node.prepend_copy(child2); node.append_copy(child1); node.remove_child(child1); node.remove_child(child2); // just some random union order, it should not matter probably? xpath_node_set ns = doc.child(STR("node")).select_nodes(STR("child1 | child2 | child1/@* | . | child2/@* | child2/text()")); ns.sort(false); xpath_node_set sorted = ns; ns.sort(true); xpath_node_set reverse_sorted = ns; xpath_node_set_tester(sorted, "sorted order failed") % 2 % 3 % 4 % 5 % 6 % 7 % 8; xpath_node_set_tester(reverse_sorted, "reverse sorted order failed") % 8 % 7 % 6 % 5 % 4 % 3 % 2; } TEST_XML(xpath_sort_move_share, "test") { // moving changes the relation between name/value data and document order, this can potentially make document order optimization invalid (silently) xml_node node = doc.child(STR("node")); xml_node child1 = node.child(STR("child1")); xml_node child2 = node.child(STR("child2")); // swap child1 & child2 node.prepend_move(child2); node.append_move(child1); // just some random union order, it should not matter probably? xpath_node_set ns = doc.child(STR("node")).select_nodes(STR("child1 | child2 | child1/@* | . | child2/@* | child2/text()")); ns.sort(false); xpath_node_set sorted = ns; ns.sort(true); xpath_node_set reverse_sorted = ns; xpath_node_set_tester(sorted, "sorted order failed") % 2 % 3 % 4 % 5 % 6 % 7 % 8; xpath_node_set_tester(reverse_sorted, "reverse sorted order failed") % 8 % 7 % 6 % 5 % 4 % 3 % 2; } TEST_XML(xpath_sort_append_buffer, "") { // append_buffer changes the relation between name/value data and document order, this can potentially make document order optimization invalid (silently) const char* child1 = ""; const char* child2 = "test "; doc.last_child().append_buffer(child2, strlen(child2)); doc.first_child().append_buffer(child1, strlen(child1)); // just some random union order, it should not matter probably? xpath_node_set ns = doc.select_nodes(STR("node/child1 | node/child2 | node/child1/@* | node/. | node/child2/@* | node/child2/text()")); ns.sort(false); xpath_node_set sorted = ns; ns.sort(true); xpath_node_set reverse_sorted = ns; xpath_node_set_tester(sorted, "sorted order failed") % 2 % 3 % 4 % 5 % 6 % 7 % 8 % 9; xpath_node_set_tester(reverse_sorted, "reverse sorted order failed") % 9 % 8 % 7 % 6 % 5 % 4 % 3 % 2; } TEST(xpath_sort_crossdoc) { xml_document doc1; CHECK(doc1.load(STR(""))); xml_document doc2; CHECK(doc2.load(STR(""))); xpath_node_set ns1 = doc1.select_nodes(STR("*")); CHECK(ns1.size() == 1); xpath_node_set ns2 = doc2.select_nodes(STR("*")); CHECK(ns2.size() == 1); xpath_variable_set set; set.set(STR("ns1"), ns1); set.set(STR("ns2"), ns2); xpath_node_set ns = xpath_query(STR("$ns1 | $ns2"), &set).evaluate_node_set(xpath_node()); ns.sort(); CHECK(ns.size() == 2); CHECK((ns[0] == ns1[0] && ns[1] == ns2[0]) || (ns[0] == ns2[0] && ns[1] == ns1[0])); } TEST(xpath_sort_crossdoc_dynamic) { xml_document doc1; doc1.append_child(STR("node")); xml_document doc2; doc2.append_child(STR("node")); xpath_node_set ns1 = doc1.select_nodes(STR("*")); CHECK(ns1.size() == 1); xpath_node_set ns2 = doc2.select_nodes(STR("*")); CHECK(ns2.size() == 1); xpath_variable_set set; set.set(STR("ns1"), ns1); set.set(STR("ns2"), ns2); xpath_node_set ns = xpath_query(STR("$ns1 | $ns2"), &set).evaluate_node_set(xpath_node()); ns.sort(); CHECK(ns.size() == 2); CHECK((ns[0] == ns1[0] && ns[1] == ns2[0]) || (ns[0] == ns2[0] && ns[1] == ns1[0])); } TEST(xpath_sort_crossdoc_different_depth) { xml_document doc1; doc1.append_child(STR("node")); xml_document doc2; doc2.append_child(STR("node")).append_child(STR("node")); xpath_node_set ns1 = doc1.select_nodes(STR("*")); CHECK(ns1.size() == 1); xpath_node_set ns2 = doc2.select_nodes(STR("*/*")); CHECK(ns2.size() == 1); xpath_variable_set set; set.set(STR("ns1"), ns1); set.set(STR("ns2"), ns2); xpath_node_set ns = xpath_query(STR("$ns1 | $ns2"), &set).evaluate_node_set(xpath_node()); ns.sort(); CHECK(ns.size() == 2); CHECK((ns[0] == ns1[0] && ns[1] == ns2[0]) || (ns[0] == ns2[0] && ns[1] == ns1[0])); } TEST(xpath_allocate_string_out_of_memory) { std::basic_string query; for (int i = 0; i < 1024; ++i) query += STR("abcdefgh"); test_runner::_memory_fail_threshold = 8*1024; #ifdef PUGIXML_NO_EXCEPTIONS CHECK(!xpath_query(query.c_str())); #else try { xpath_query q(query.c_str()); CHECK_FORCE_FAIL("Expected out of memory exception"); } catch (const std::bad_alloc&) { } #endif } #endif