1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
|
/*
* Copyright (C) 2013 Adobe Systems Inc. All rights reserved.
* Copyright (C) 2009 Apple Inc. All rights reserved.
* Copyright (C) 2011 Google Inc. All rights reserved.
* Copyright (C) 2009 Joseph Pecoraro
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of Apple Inc. ("Apple") nor the names of
* its contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY APPLE AND ITS CONTRIBUTORS "AS IS" AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL APPLE OR ITS CONTRIBUTORS BE LIABLE FOR ANY
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "config.h"
#include "InspectorNodeFinder.h"
#include "Attr.h"
#include "Document.h"
#include "Element.h"
#include "HTMLFrameOwnerElement.h"
#include "NodeList.h"
#include "NodeTraversal.h"
#include "XPathResult.h"
namespace WebCore {
static String stripCharacters(const String& string, const char startCharacter, const char endCharacter, bool& startCharFound, bool& endCharFound)
{
startCharFound = string.startsWith(startCharacter);
endCharFound = string.endsWith(endCharacter);
unsigned start = startCharFound ? 1 : 0;
unsigned end = string.length() - (endCharFound ? 1 : 0);
return string.substring(start, end - start);
}
InspectorNodeFinder::InspectorNodeFinder(const String& whitespaceTrimmedQuery)
: m_whitespaceTrimmedQuery(whitespaceTrimmedQuery)
{
m_tagNameQuery = stripCharacters(whitespaceTrimmedQuery, '<', '>', m_startTagFound, m_endTagFound);
bool startQuoteFound, endQuoteFound;
m_attributeQuery = stripCharacters(whitespaceTrimmedQuery, '"', '"', startQuoteFound, endQuoteFound);
m_exactAttributeMatch = startQuoteFound && endQuoteFound;
}
void InspectorNodeFinder::performSearch(Node* parentNode)
{
searchUsingXPath(parentNode);
searchUsingCSSSelectors(parentNode);
// Keep the DOM tree traversal last. This way iframe content will come after their parents.
searchUsingDOMTreeTraversal(parentNode);
}
void InspectorNodeFinder::searchUsingDOMTreeTraversal(Node* parentNode)
{
// Manual plain text search.
for (auto* node = parentNode; node; node = NodeTraversal::next(*node, parentNode)) {
switch (node->nodeType()) {
case Node::TEXT_NODE:
case Node::COMMENT_NODE:
case Node::CDATA_SECTION_NODE: {
if (node->nodeValue().findIgnoringCase(m_whitespaceTrimmedQuery) != notFound)
m_results.add(node);
break;
}
case Node::ELEMENT_NODE: {
if (matchesElement(downcast<Element>(*node)))
m_results.add(node);
// Search inside frame elements.
if (is<HTMLFrameOwnerElement>(*node)) {
HTMLFrameOwnerElement& frameOwner = downcast<HTMLFrameOwnerElement>(*node);
if (Document* document = frameOwner.contentDocument())
performSearch(document);
}
break;
}
default:
break;
}
}
}
bool InspectorNodeFinder::matchesAttribute(const Attribute& attribute)
{
if (attribute.localName().string().findIgnoringCase(m_whitespaceTrimmedQuery) != notFound)
return true;
return m_exactAttributeMatch ? attribute.value() == m_attributeQuery : attribute.value().string().findIgnoringCase(m_attributeQuery) != notFound;
}
bool InspectorNodeFinder::matchesElement(const Element& element)
{
String nodeName = element.nodeName();
if ((!m_startTagFound && !m_endTagFound && (nodeName.findIgnoringCase(m_tagNameQuery) != notFound))
|| (m_startTagFound && m_endTagFound && equalIgnoringASCIICase(nodeName, m_tagNameQuery))
|| (m_startTagFound && !m_endTagFound && nodeName.startsWith(m_tagNameQuery, false))
|| (!m_startTagFound && m_endTagFound && nodeName.endsWith(m_tagNameQuery, false)))
return true;
if (!element.hasAttributes())
return false;
for (const Attribute& attribute : element.attributesIterator()) {
if (matchesAttribute(attribute))
return true;
}
return false;
}
void InspectorNodeFinder::searchUsingXPath(Node* parentNode)
{
ExceptionCode ec = 0;
RefPtr<XPathResult> result = parentNode->document().evaluate(m_whitespaceTrimmedQuery, parentNode, nullptr, XPathResult::ORDERED_NODE_SNAPSHOT_TYPE, nullptr, ec);
if (ec || !result)
return;
unsigned long size = result->snapshotLength(ec);
if (ec)
return;
for (unsigned long i = 0; i < size; ++i) {
Node* node = result->snapshotItem(i, ec);
if (ec)
return;
if (is<Attr>(*node))
node = downcast<Attr>(*node).ownerElement();
// XPath can get out of the context node that we pass as the starting point to evaluate, so we need to filter for just the nodes we care about.
if (node == parentNode || node->isDescendantOf(parentNode))
m_results.add(node);
}
}
void InspectorNodeFinder::searchUsingCSSSelectors(Node* parentNode)
{
ASSERT(parentNode);
if (!is<ContainerNode>(*parentNode))
return;
ExceptionCode ec = 0;
RefPtr<NodeList> nodeList = downcast<ContainerNode>(*parentNode).querySelectorAll(m_whitespaceTrimmedQuery, ec);
if (ec || !nodeList)
return;
unsigned size = nodeList->length();
for (unsigned i = 0; i < size; ++i)
m_results.add(nodeList->item(i));
}
} // namespace WebCore
|
