1 /*
2 * Copyright (C) 2005 Frerich Raabe <raabe@kde.org>
3 * Copyright (C) 2006, 2009 Apple Inc.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 *
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
14 *
15 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
16 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
17 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
18 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
19 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
20 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
21 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
22 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
24 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
25 */
26
27 #include "config.h"
28 #include "core/xml/XPathUtil.h"
29
30 #include "core/dom/ContainerNode.h"
31 #include "core/dom/NodeTraversal.h"
32 #include "wtf/text/StringBuilder.h"
33
34 namespace blink {
35 namespace XPath {
36
isRootDomNode(Node * node)37 bool isRootDomNode(Node* node)
38 {
39 return node && !node->parentNode();
40 }
41
stringValue(Node * node)42 String stringValue(Node* node)
43 {
44 switch (node->nodeType()) {
45 case Node::ATTRIBUTE_NODE:
46 case Node::PROCESSING_INSTRUCTION_NODE:
47 case Node::COMMENT_NODE:
48 case Node::TEXT_NODE:
49 case Node::CDATA_SECTION_NODE:
50 return node->nodeValue();
51 default:
52 if (isRootDomNode(node) || node->isElementNode()) {
53 StringBuilder result;
54 result.reserveCapacity(1024);
55
56 for (Node* n = node->firstChild(); n; n = NodeTraversal::next(*n, node)) {
57 if (n->isTextNode()) {
58 const String& nodeValue = n->nodeValue();
59 result.append(nodeValue);
60 }
61 }
62
63 return result.toString();
64 }
65 }
66
67 return String();
68 }
69
isValidContextNode(Node * node)70 bool isValidContextNode(Node* node)
71 {
72 if (!node)
73 return false;
74 switch (node->nodeType()) {
75 case Node::ATTRIBUTE_NODE:
76 case Node::CDATA_SECTION_NODE:
77 case Node::COMMENT_NODE:
78 case Node::DOCUMENT_NODE:
79 case Node::ELEMENT_NODE:
80 case Node::PROCESSING_INSTRUCTION_NODE:
81 return true;
82 case Node::DOCUMENT_FRAGMENT_NODE:
83 case Node::DOCUMENT_TYPE_NODE:
84 return false;
85 case Node::TEXT_NODE:
86 return !(node->parentNode() && node->parentNode()->isAttributeNode());
87 }
88 ASSERT_NOT_REACHED();
89 return false;
90 }
91
92 }
93 }
94