15c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles)/* 25c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) * Copyright (C) 2005 Frerich Raabe <raabe@kde.org> 35c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) * Copyright (C) 2006, 2009 Apple Inc. All rights reserved. 45c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) * Copyright (C) 2007 Alexey Proskuryakov <ap@webkit.org> 55c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) * 65c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) * Redistribution and use in source and binary forms, with or without 75c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) * modification, are permitted provided that the following conditions 85c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) * are met: 902772c6a72f1ee0b226341a4f4439970c29fc861Ben Murdoch * 105c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) * 1. Redistributions of source code must retain the above copyright 115c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) * notice, this list of conditions and the following disclaimer. 125c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) * 2. Redistributions in binary form must reproduce the above copyright 135c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) * notice, this list of conditions and the following disclaimer in the 145c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) * documentation and/or other materials provided with the distribution. 1502772c6a72f1ee0b226341a4f4439970c29fc861Ben Murdoch * 165c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 175c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 185c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 195c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 205c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 215c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 225c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 235c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 245c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 255c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 265c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) */ 275c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 285c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles)#include "config.h" 2953e740f4a82e17f3ae59772501622dc354e42336Torne (Richard Coles)#include "core/xml/XPathStep.h" 305c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 315c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles)#include "XMLNSNames.h" 3253e740f4a82e17f3ae59772501622dc354e42336Torne (Richard Coles)#include "core/dom/Attr.h" 3353e740f4a82e17f3ae59772501622dc354e42336Torne (Richard Coles)#include "core/dom/Document.h" 3453e740f4a82e17f3ae59772501622dc354e42336Torne (Richard Coles)#include "core/dom/Element.h" 3553e740f4a82e17f3ae59772501622dc354e42336Torne (Richard Coles)#include "core/dom/NodeTraversal.h" 3653e740f4a82e17f3ae59772501622dc354e42336Torne (Richard Coles)#include "core/xml/XPathParser.h" 3753e740f4a82e17f3ae59772501622dc354e42336Torne (Richard Coles)#include "core/xml/XPathUtil.h" 385c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 395c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles)namespace WebCore { 405c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles)namespace XPath { 415c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 425c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles)Step::Step(Axis axis, const NodeTest& nodeTest, const Vector<Predicate*>& predicates) 435c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) : m_axis(axis) 445c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) , m_nodeTest(nodeTest) 455c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) , m_predicates(predicates) 465c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles){ 475c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles)} 485c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 495c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles)Step::~Step() 505c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles){ 515c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) deleteAllValues(m_predicates); 525c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) deleteAllValues(m_nodeTest.mergedPredicates()); 535c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles)} 545c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 555c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles)void Step::optimize() 565c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles){ 575c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) // Evaluate predicates as part of node test if possible to avoid building unnecessary NodeSets. 585c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) // E.g., there is no need to build a set of all "foo" nodes to evaluate "foo[@bar]", we can check the predicate while enumerating. 595c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) // This optimization can be applied to predicates that are not context node list sensitive, or to first predicate that is only context position sensitive, e.g. foo[position() mod 2 = 0]. 605c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) Vector<Predicate*> remainingPredicates; 615c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) for (size_t i = 0; i < m_predicates.size(); ++i) { 625c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) Predicate* predicate = m_predicates[i]; 635c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if ((!predicate->isContextPositionSensitive() || m_nodeTest.mergedPredicates().isEmpty()) && !predicate->isContextSizeSensitive() && remainingPredicates.isEmpty()) { 645c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) m_nodeTest.mergedPredicates().append(predicate); 655c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) } else 665c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) remainingPredicates.append(predicate); 675c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) } 685c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) swap(remainingPredicates, m_predicates); 695c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles)} 705c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 715c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles)void optimizeStepPair(Step* first, Step* second, bool& dropSecondStep) 725c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles){ 735c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) dropSecondStep = false; 745c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 755c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (first->m_axis == Step::DescendantOrSelfAxis 765c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) && first->m_nodeTest.kind() == Step::NodeTest::AnyNodeTest 775c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) && !first->m_predicates.size() 785c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) && !first->m_nodeTest.mergedPredicates().size()) { 795c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 805c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) ASSERT(first->m_nodeTest.data().isEmpty()); 815c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) ASSERT(first->m_nodeTest.namespaceURI().isEmpty()); 825c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 835c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) // Optimize the common case of "//" AKA /descendant-or-self::node()/child::NodeTest to /descendant::NodeTest. 845c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (second->m_axis == Step::ChildAxis && second->predicatesAreContextListInsensitive()) { 855c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) first->m_axis = Step::DescendantAxis; 865c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) first->m_nodeTest = Step::NodeTest(second->m_nodeTest.kind(), second->m_nodeTest.data(), second->m_nodeTest.namespaceURI()); 875c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) swap(second->m_nodeTest.mergedPredicates(), first->m_nodeTest.mergedPredicates()); 885c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) swap(second->m_predicates, first->m_predicates); 895c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) first->optimize(); 905c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) dropSecondStep = true; 915c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) } 925c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) } 935c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles)} 945c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 955c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles)bool Step::predicatesAreContextListInsensitive() const 965c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles){ 975c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) for (size_t i = 0; i < m_predicates.size(); ++i) { 985c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) Predicate* predicate = m_predicates[i]; 995c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (predicate->isContextPositionSensitive() || predicate->isContextSizeSensitive()) 1005c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return false; 1015c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) } 1025c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 1035c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) for (size_t i = 0; i < m_nodeTest.mergedPredicates().size(); ++i) { 1045c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) Predicate* predicate = m_nodeTest.mergedPredicates()[i]; 1055c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (predicate->isContextPositionSensitive() || predicate->isContextSizeSensitive()) 1065c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return false; 1075c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) } 1085c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 1095c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return true; 1105c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles)} 1115c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 1125c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles)void Step::evaluate(Node* context, NodeSet& nodes) const 1135c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles){ 1145c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) EvaluationContext& evaluationContext = Expression::evaluationContext(); 1155c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) evaluationContext.position = 0; 1165c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 1175c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) nodesInAxis(context, nodes); 1185c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 1195c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) // Check predicates that couldn't be merged into node test. 1205c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) for (unsigned i = 0; i < m_predicates.size(); i++) { 1215c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) Predicate* predicate = m_predicates[i]; 1225c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 1235c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) NodeSet newNodes; 1245c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (!nodes.isSorted()) 1255c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) newNodes.markSorted(false); 1265c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 1275c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) for (unsigned j = 0; j < nodes.size(); j++) { 1285c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) Node* node = nodes[j]; 1295c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 1305c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) evaluationContext.node = node; 1315c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) evaluationContext.size = nodes.size(); 1325c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) evaluationContext.position = j + 1; 1335c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (predicate->evaluate()) 1345c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) newNodes.append(node); 1355c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) } 1365c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 1375c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) nodes.swap(newNodes); 1385c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) } 1395c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles)} 1405c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 1415c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles)static inline Node::NodeType primaryNodeType(Step::Axis axis) 1425c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles){ 1435c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) switch (axis) { 1445c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) case Step::AttributeAxis: 1455c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return Node::ATTRIBUTE_NODE; 1465c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) case Step::NamespaceAxis: 1475c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return Node::XPATH_NAMESPACE_NODE; 1485c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) default: 1495c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return Node::ELEMENT_NODE; 1505c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) } 1515c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles)} 1525c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 1535c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles)// Evaluate NodeTest without considering merged predicates. 1545c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles)static inline bool nodeMatchesBasicTest(Node* node, Step::Axis axis, const Step::NodeTest& nodeTest) 1555c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles){ 1565c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) switch (nodeTest.kind()) { 1575c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) case Step::NodeTest::TextNodeTest: 1585c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return node->nodeType() == Node::TEXT_NODE || node->nodeType() == Node::CDATA_SECTION_NODE; 1595c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) case Step::NodeTest::CommentNodeTest: 1605c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return node->nodeType() == Node::COMMENT_NODE; 1615c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) case Step::NodeTest::ProcessingInstructionNodeTest: { 1625c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) const AtomicString& name = nodeTest.data(); 1635c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return node->nodeType() == Node::PROCESSING_INSTRUCTION_NODE && (name.isEmpty() || node->nodeName() == name); 1645c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) } 1655c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) case Step::NodeTest::AnyNodeTest: 1665c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return true; 1675c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) case Step::NodeTest::NameTest: { 1685c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) const AtomicString& name = nodeTest.data(); 1695c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) const AtomicString& namespaceURI = nodeTest.namespaceURI(); 1705c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 1715c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (axis == Step::AttributeAxis) { 1725c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) ASSERT(node->isAttributeNode()); 1735c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 1745c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) // In XPath land, namespace nodes are not accessible on the attribute axis. 1755c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (node->namespaceURI() == XMLNSNames::xmlnsNamespaceURI) 1765c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return false; 1775c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 1785c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (name == starAtom) 1795c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return namespaceURI.isEmpty() || node->namespaceURI() == namespaceURI; 1805c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 1815c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return node->localName() == name && node->namespaceURI() == namespaceURI; 1825c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) } 1835c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 1845c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) // Node test on the namespace axis is not implemented yet, the caller has a check for it. 1855c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) ASSERT(axis != Step::NamespaceAxis); 1865c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 1875c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) // For other axes, the principal node type is element. 1885c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) ASSERT(primaryNodeType(axis) == Node::ELEMENT_NODE); 1895c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (node->nodeType() != Node::ELEMENT_NODE) 1905c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return false; 1915c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 1925c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (name == starAtom) 1935c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return namespaceURI.isEmpty() || namespaceURI == node->namespaceURI(); 1945c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 1955c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (node->document()->isHTMLDocument()) { 1965c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (node->isHTMLElement()) { 1975c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) // Paths without namespaces should match HTML elements in HTML documents despite those having an XHTML namespace. Names are compared case-insensitively. 198926b001d589ce2f10facb93dd4b87578ea35a855Torne (Richard Coles) return equalIgnoringCase(toElement(node)->localName(), name) && (namespaceURI.isNull() || namespaceURI == node->namespaceURI()); 1995c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) } 2005c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) // An expression without any prefix shouldn't match no-namespace nodes (because HTML5 says so). 201926b001d589ce2f10facb93dd4b87578ea35a855Torne (Richard Coles) return toElement(node)->hasLocalName(name) && namespaceURI == node->namespaceURI() && !namespaceURI.isNull(); 2025c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) } 203926b001d589ce2f10facb93dd4b87578ea35a855Torne (Richard Coles) return toElement(node)->hasLocalName(name) && namespaceURI == node->namespaceURI(); 2045c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) } 2055c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) } 2065c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) ASSERT_NOT_REACHED(); 2075c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return false; 2085c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles)} 2095c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 2105c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles)static inline bool nodeMatches(Node* node, Step::Axis axis, const Step::NodeTest& nodeTest) 2115c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles){ 2125c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (!nodeMatchesBasicTest(node, axis, nodeTest)) 2135c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return false; 2145c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 2155c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) EvaluationContext& evaluationContext = Expression::evaluationContext(); 2165c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 2175c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) // Only the first merged predicate may depend on position. 2185c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) ++evaluationContext.position; 2195c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 2205c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) const Vector<Predicate*>& mergedPredicates = nodeTest.mergedPredicates(); 2215c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) for (unsigned i = 0; i < mergedPredicates.size(); i++) { 2225c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) Predicate* predicate = mergedPredicates[i]; 2235c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 2245c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) evaluationContext.node = node; 2255c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) // No need to set context size - we only get here when evaluating predicates that do not depend on it. 2265c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (!predicate->evaluate()) 2275c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return false; 2285c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) } 2295c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 2305c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return true; 2315c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles)} 2325c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 2335c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles)// Result nodes are ordered in axis order. Node test (including merged predicates) is applied. 2345c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles)void Step::nodesInAxis(Node* context, NodeSet& nodes) const 2355c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles){ 2365c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) ASSERT(nodes.isEmpty()); 2375c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) switch (m_axis) { 2385c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) case ChildAxis: 2395c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (context->isAttributeNode()) // In XPath model, attribute nodes do not have children. 2405c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return; 2415c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 2425c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) for (Node* n = context->firstChild(); n; n = n->nextSibling()) 2435c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (nodeMatches(n, ChildAxis, m_nodeTest)) 2445c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) nodes.append(n); 2455c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return; 2465c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) case DescendantAxis: 2475c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (context->isAttributeNode()) // In XPath model, attribute nodes do not have children. 2485c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return; 2495c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 250926b001d589ce2f10facb93dd4b87578ea35a855Torne (Richard Coles) for (Node* n = context->firstChild(); n; n = NodeTraversal::next(n, context)) 2515c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (nodeMatches(n, DescendantAxis, m_nodeTest)) 2525c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) nodes.append(n); 2535c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return; 2545c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) case ParentAxis: 2555c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (context->isAttributeNode()) { 256591b958dee2cf159d33a0b931e6231072eaf38d5Ben Murdoch Element* n = toAttr(context)->ownerElement(); 2575c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (nodeMatches(n, ParentAxis, m_nodeTest)) 2585c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) nodes.append(n); 2595c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) } else { 2605c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) ContainerNode* n = context->parentNode(); 2615c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (n && nodeMatches(n, ParentAxis, m_nodeTest)) 2625c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) nodes.append(n); 2635c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) } 2645c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return; 2655c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) case AncestorAxis: { 2665c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) Node* n = context; 2675c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (context->isAttributeNode()) { 268591b958dee2cf159d33a0b931e6231072eaf38d5Ben Murdoch n = toAttr(context)->ownerElement(); 2695c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (nodeMatches(n, AncestorAxis, m_nodeTest)) 2705c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) nodes.append(n); 2715c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) } 2725c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) for (n = n->parentNode(); n; n = n->parentNode()) 2735c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (nodeMatches(n, AncestorAxis, m_nodeTest)) 2745c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) nodes.append(n); 2755c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) nodes.markSorted(false); 2765c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return; 2775c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) } 2785c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) case FollowingSiblingAxis: 2795c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (context->nodeType() == Node::ATTRIBUTE_NODE || 28002772c6a72f1ee0b226341a4f4439970c29fc861Ben Murdoch context->nodeType() == Node::XPATH_NAMESPACE_NODE) 2815c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return; 28202772c6a72f1ee0b226341a4f4439970c29fc861Ben Murdoch 2835c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) for (Node* n = context->nextSibling(); n; n = n->nextSibling()) 2845c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (nodeMatches(n, FollowingSiblingAxis, m_nodeTest)) 2855c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) nodes.append(n); 2865c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return; 2875c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) case PrecedingSiblingAxis: 2885c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (context->nodeType() == Node::ATTRIBUTE_NODE || 2895c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) context->nodeType() == Node::XPATH_NAMESPACE_NODE) 2905c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return; 29102772c6a72f1ee0b226341a4f4439970c29fc861Ben Murdoch 2925c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) for (Node* n = context->previousSibling(); n; n = n->previousSibling()) 2935c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (nodeMatches(n, PrecedingSiblingAxis, m_nodeTest)) 2945c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) nodes.append(n); 2955c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 2965c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) nodes.markSorted(false); 2975c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return; 2985c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) case FollowingAxis: 2995c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (context->isAttributeNode()) { 300591b958dee2cf159d33a0b931e6231072eaf38d5Ben Murdoch Node* p = toAttr(context)->ownerElement(); 301591b958dee2cf159d33a0b931e6231072eaf38d5Ben Murdoch while ((p = NodeTraversal::next(p))) { 3025c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (nodeMatches(p, FollowingAxis, m_nodeTest)) 3035c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) nodes.append(p); 304591b958dee2cf159d33a0b931e6231072eaf38d5Ben Murdoch } 3055c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) } else { 3065c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) for (Node* p = context; !isRootDomNode(p); p = p->parentNode()) { 3075c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) for (Node* n = p->nextSibling(); n; n = n->nextSibling()) { 3085c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (nodeMatches(n, FollowingAxis, m_nodeTest)) 3095c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) nodes.append(n); 310926b001d589ce2f10facb93dd4b87578ea35a855Torne (Richard Coles) for (Node* c = n->firstChild(); c; c = NodeTraversal::next(c, n)) 3115c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (nodeMatches(c, FollowingAxis, m_nodeTest)) 3125c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) nodes.append(c); 3135c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) } 3145c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) } 3155c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) } 3165c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return; 3175c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) case PrecedingAxis: { 3185c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (context->isAttributeNode()) 319591b958dee2cf159d33a0b931e6231072eaf38d5Ben Murdoch context = toAttr(context)->ownerElement(); 3205c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 3215c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) Node* n = context; 3225c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) while (ContainerNode* parent = n->parentNode()) { 323926b001d589ce2f10facb93dd4b87578ea35a855Torne (Richard Coles) for (n = NodeTraversal::previous(n); n != parent; n = NodeTraversal::previous(n)) 3245c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (nodeMatches(n, PrecedingAxis, m_nodeTest)) 3255c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) nodes.append(n); 3265c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) n = parent; 3275c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) } 3285c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) nodes.markSorted(false); 3295c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return; 3305c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) } 3315c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) case AttributeAxis: { 3325c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (!context->isElementNode()) 3335c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return; 3345c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 3355c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) Element* contextElement = toElement(context); 3365c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 3375c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) // Avoid lazily creating attribute nodes for attributes that we do not need anyway. 3385c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (m_nodeTest.kind() == NodeTest::NameTest && m_nodeTest.data() != starAtom) { 3395c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) RefPtr<Node> n = contextElement->getAttributeNodeNS(m_nodeTest.namespaceURI(), m_nodeTest.data()); 3405c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (n && n->namespaceURI() != XMLNSNames::xmlnsNamespaceURI) { // In XPath land, namespace nodes are not accessible on the attribute axis. 3415c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (nodeMatches(n.get(), AttributeAxis, m_nodeTest)) // Still need to check merged predicates. 3425c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) nodes.append(n.release()); 3435c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) } 3445c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return; 3455c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) } 34602772c6a72f1ee0b226341a4f4439970c29fc861Ben Murdoch 3475c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (!contextElement->hasAttributes()) 3485c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return; 3495c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 3505c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) for (unsigned i = 0; i < contextElement->attributeCount(); ++i) { 3515c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) RefPtr<Attr> attr = contextElement->ensureAttr(contextElement->attributeItem(i)->name()); 3525c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (nodeMatches(attr.get(), AttributeAxis, m_nodeTest)) 3535c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) nodes.append(attr.release()); 3545c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) } 3555c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return; 3565c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) } 3575c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) case NamespaceAxis: 3585c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) // XPath namespace nodes are not implemented yet. 3595c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return; 3605c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) case SelfAxis: 3615c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (nodeMatches(context, SelfAxis, m_nodeTest)) 3625c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) nodes.append(context); 3635c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return; 3645c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) case DescendantOrSelfAxis: 3655c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (nodeMatches(context, DescendantOrSelfAxis, m_nodeTest)) 3665c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) nodes.append(context); 3675c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (context->isAttributeNode()) // In XPath model, attribute nodes do not have children. 3685c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return; 3695c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 370926b001d589ce2f10facb93dd4b87578ea35a855Torne (Richard Coles) for (Node* n = context->firstChild(); n; n = NodeTraversal::next(n, context)) 3715c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (nodeMatches(n, DescendantOrSelfAxis, m_nodeTest)) 3725c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) nodes.append(n); 3735c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return; 3745c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) case AncestorOrSelfAxis: { 3755c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (nodeMatches(context, AncestorOrSelfAxis, m_nodeTest)) 3765c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) nodes.append(context); 3775c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) Node* n = context; 3785c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (context->isAttributeNode()) { 379591b958dee2cf159d33a0b931e6231072eaf38d5Ben Murdoch n = toAttr(context)->ownerElement(); 3805c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (nodeMatches(n, AncestorOrSelfAxis, m_nodeTest)) 3815c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) nodes.append(n); 3825c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) } 3835c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) for (n = n->parentNode(); n; n = n->parentNode()) 3845c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) if (nodeMatches(n, AncestorOrSelfAxis, m_nodeTest)) 3855c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) nodes.append(n); 3865c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 3875c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) nodes.markSorted(false); 3885c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) return; 3895c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) } 3905c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) } 3915c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) ASSERT_NOT_REACHED(); 3925c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles)} 3935c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 3945c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles) 3955c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles)} 3965c87bf8b86a7c82ef50fb7a89697d8e02e2553beTorne (Richard Coles)} 397