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 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220
|
/*
* Copyright (C) 2011 Google Inc. All rights reserved.
*
* 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.
*
* THIS SOFTWARE IS PROVIDED BY GOOGLE INC. 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 GOOGLE INC.
* 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"
#if ENABLE(INSPECTOR)
#include "ContentSearchUtils.h"
#include "InspectorValues.h"
#include "RegularExpression.h"
#include <wtf/BumpPointerAllocator.h>
#include <wtf/StdLibExtras.h>
#include <yarr/Yarr.h>
using namespace std;
namespace WebCore {
namespace ContentSearchUtils {
namespace {
// This should be kept the same as the one in front-end/utilities.js
static const char regexSpecialCharacters[] = "[](){}+-*.,?\\^$|";
}
static String createSearchRegexSource(const String& text)
{
String result;
const UChar* characters = text.characters();
String specials(regexSpecialCharacters);
for (unsigned i = 0; i < text.length(); i++) {
if (specials.find(characters[i]) != notFound)
result.append("\\");
result.append(characters[i]);
}
return result;
}
static inline size_t sizetExtractor(const size_t* value)
{
return *value;
}
TextPosition textPositionFromOffset(size_t offset, const Vector<size_t>& lineEndings)
{
const size_t* foundLineEnding = approximateBinarySearch<size_t, size_t>(lineEndings, lineEndings.size(), offset, sizetExtractor);
size_t lineIndex = foundLineEnding - &lineEndings.at(0);
if (offset > *foundLineEnding)
++lineIndex;
size_t lineStartOffset = lineIndex > 0 ? lineEndings.at(lineIndex - 1) + 1 : 0;
size_t column = offset - lineStartOffset;
return TextPosition(OrdinalNumber::fromZeroBasedInt(lineIndex), OrdinalNumber::fromZeroBasedInt(column));
}
static Vector<pair<int, String> > getRegularExpressionMatchesByLines(const RegularExpression& regex, const String& text)
{
Vector<pair<int, String> > result;
if (text.isEmpty())
return result;
OwnPtr<Vector<size_t> > endings(lineEndings(text));
size_t size = endings->size();
unsigned start = 0;
for (size_t lineNumber = 0; lineNumber < size; ++lineNumber) {
size_t lineEnd = endings->at(lineNumber);
String line = text.substring(start, lineEnd - start);
if (line.endsWith('\r'))
line = line.left(line.length() - 1);
int matchLength;
if (regex.match(line, 0, &matchLength) != -1)
result.append(pair<int, String>(lineNumber, line));
start = lineEnd + 1;
}
return result;
}
PassOwnPtr<Vector<size_t> > lineEndings(const String& text)
{
OwnPtr<Vector<size_t> > result(adoptPtr(new Vector<size_t>()));
unsigned start = 0;
while (start < text.length()) {
size_t lineEnd = text.find('\n', start);
if (lineEnd == notFound)
break;
result->append(lineEnd);
start = lineEnd + 1;
}
result->append(text.length());
return result.release();
}
static PassRefPtr<TypeBuilder::Page::SearchMatch> buildObjectForSearchMatch(int lineNumber, const String& lineContent)
{
return TypeBuilder::Page::SearchMatch::create()
.setLineNumber(lineNumber)
.setLineContent(lineContent)
.release();
}
RegularExpression createSearchRegex(const String& query, bool caseSensitive, bool isRegex)
{
String regexSource = isRegex ? query : createSearchRegexSource(query);
return RegularExpression(regexSource, caseSensitive ? TextCaseSensitive : TextCaseInsensitive);
}
int countRegularExpressionMatches(const RegularExpression& regex, const String& content)
{
if (content.isEmpty())
return 0;
int result = 0;
int position;
unsigned start = 0;
int matchLength;
while ((position = regex.match(content, start, &matchLength)) != -1) {
if (start >= content.length())
break;
if (matchLength > 0)
++result;
start = position + 1;
}
return result;
}
PassRefPtr<TypeBuilder::Array<TypeBuilder::Page::SearchMatch> > searchInTextByLines(const String& text, const String& query, const bool caseSensitive, const bool isRegex)
{
RefPtr<TypeBuilder::Array<TypeBuilder::Page::SearchMatch> > result = TypeBuilder::Array<TypeBuilder::Page::SearchMatch>::create();
RegularExpression regex = ContentSearchUtils::createSearchRegex(query, caseSensitive, isRegex);
Vector<pair<int, String> > matches = getRegularExpressionMatchesByLines(regex, text);
for (Vector<pair<int, String> >::const_iterator it = matches.begin(); it != matches.end(); ++it)
result->addItem(buildObjectForSearchMatch(it->first, it->second));
return result;
}
static String scriptCommentPattern(const String& name)
{
// "//# <name>=<value>" and deprecated "//@"
return "//[#@][\040\t]" + name + "=[\040\t]*([^\\s\'\"]*)[\040\t]*$";
}
static String stylesheetCommentPattern(const String& name)
{
// "/*# <name>=<value> */" and deprecated "/*@"
return "/\\*[#@][\040\t]" + name + "=[\040\t]*([^\\s\'\"]*)[\040\t]*\\*/";
}
static String findMagicComment(const String& content, const String& patternString)
{
const char* error = 0;
JSC::Yarr::YarrPattern pattern(patternString, false, true, &error);
ASSERT(!error);
BumpPointerAllocator regexAllocator;
OwnPtr<JSC::Yarr::BytecodePattern> bytecodePattern = JSC::Yarr::byteCompile(pattern, ®exAllocator);
ASSERT(bytecodePattern);
ASSERT(pattern.m_numSubpatterns == 1);
Vector<int, 4> matches;
matches.resize(4);
unsigned result = JSC::Yarr::interpret(bytecodePattern.get(), content, 0, reinterpret_cast<unsigned*>(matches.data()));
if (result == JSC::Yarr::offsetNoMatch)
return String();
ASSERT(matches[2] > 0 && matches[3] > 0);
return content.substring(matches[2], matches[3] - matches[2]);
}
String findScriptSourceURL(const String& content)
{
return findMagicComment(content, scriptCommentPattern("sourceURL"));
}
String findScriptSourceMapURL(const String& content)
{
return findMagicComment(content, scriptCommentPattern("sourceMappingURL"));
}
String findStylesheetSourceMapURL(const String& content)
{
return findMagicComment(content, stylesheetCommentPattern("sourceMappingURL"));
}
} // namespace ContentSearchUtils
} // namespace WebCore
#endif // ENABLE(INSPECTOR)
|