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
|
/*
* Copyright (C) 2013 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:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * 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.
* * Neither the name of Google Inc. 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 THE COPYRIGHT HOLDERS AND 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 THE COPYRIGHT
* OWNER OR 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 "core/html/HTMLDimension.h"
#include "core/html/parser/HTMLParserIdioms.h"
#include "wtf/MathExtras.h"
#include "wtf/text/ParsingUtilities.h"
#include "wtf/text/StringToNumber.h"
#include "wtf/text/WTFString.h"
namespace blink {
template <typename CharacterType>
static HTMLDimension parseDimension(const CharacterType* characters,
size_t lastParsedIndex,
size_t endOfCurrentToken) {
HTMLDimension::HTMLDimensionType type = HTMLDimension::Absolute;
double value = 0.;
// HTML5's split removes leading and trailing spaces so we need to skip the
// leading spaces here.
while (lastParsedIndex < endOfCurrentToken &&
isASCIISpace((characters[lastParsedIndex])))
++lastParsedIndex;
// This is Step 5.5. in the algorithm. Going to the last step would make the
// code less readable.
if (lastParsedIndex >= endOfCurrentToken)
return HTMLDimension(value, HTMLDimension::Relative);
size_t position = lastParsedIndex;
while (position < endOfCurrentToken && isASCIIDigit(characters[position]))
++position;
if (position > lastParsedIndex) {
bool ok = false;
unsigned integerValue = charactersToUIntStrict(
characters + lastParsedIndex, position - lastParsedIndex, &ok);
if (!ok)
return HTMLDimension(0., HTMLDimension::Relative);
value += integerValue;
if (position < endOfCurrentToken && characters[position] == '.') {
++position;
Vector<CharacterType> fractionNumbers;
while (position < endOfCurrentToken &&
(isASCIIDigit(characters[position]) ||
isASCIISpace(characters[position]))) {
if (isASCIIDigit(characters[position]))
fractionNumbers.push_back(characters[position]);
++position;
}
if (fractionNumbers.size()) {
double fractionValue = charactersToUIntStrict(
fractionNumbers.data(), fractionNumbers.size(), &ok);
if (!ok)
return HTMLDimension(0., HTMLDimension::Relative);
value += fractionValue /
pow(10., static_cast<double>(fractionNumbers.size()));
}
}
}
while (position < endOfCurrentToken && isASCIISpace(characters[position]))
++position;
if (position < endOfCurrentToken) {
if (characters[position] == '*')
type = HTMLDimension::Relative;
else if (characters[position] == '%')
type = HTMLDimension::Percentage;
}
return HTMLDimension(value, type);
}
static HTMLDimension parseDimension(const String& rawToken,
size_t lastParsedIndex,
size_t endOfCurrentToken) {
if (rawToken.is8Bit())
return parseDimension<LChar>(rawToken.characters8(), lastParsedIndex,
endOfCurrentToken);
return parseDimension<UChar>(rawToken.characters16(), lastParsedIndex,
endOfCurrentToken);
}
// This implements the "rules for parsing a list of dimensions" per HTML5.
// http://www.whatwg.org/specs/web-apps/current-work/multipage/common-microsyntaxes.html#rules-for-parsing-a-list-of-dimensions
Vector<HTMLDimension> parseListOfDimensions(const String& input) {
static const char comma = ',';
// Step 2. Remove the last character if it's a comma.
String trimmedString = input;
if (trimmedString.endsWith(comma))
trimmedString.truncate(trimmedString.length() - 1);
// HTML5's split doesn't return a token for an empty string so
// we need to match them here.
if (trimmedString.isEmpty())
return Vector<HTMLDimension>();
// Step 3. To avoid String copies, we just look for commas instead of
// splitting.
Vector<HTMLDimension> parsedDimensions;
size_t lastParsedIndex = 0;
while (true) {
size_t nextComma = trimmedString.find(comma, lastParsedIndex);
if (nextComma == kNotFound)
break;
parsedDimensions.push_back(
parseDimension(trimmedString, lastParsedIndex, nextComma));
lastParsedIndex = nextComma + 1;
}
parsedDimensions.push_back(
parseDimension(trimmedString, lastParsedIndex, trimmedString.length()));
return parsedDimensions;
}
template <typename CharacterType>
static bool parseDimensionValue(const CharacterType* current,
const CharacterType* end,
HTMLDimension& dimension) {
skipWhile<CharacterType, isHTMLSpace>(current, end);
// Deviation: HTML allows '+' here.
const CharacterType* numberStart = current;
if (!skipExactly<CharacterType, isASCIIDigit>(current, end))
return false;
skipWhile<CharacterType, isASCIIDigit>(current, end);
if (skipExactly<CharacterType>(current, end, '.')) {
// Deviation: HTML requires a digit after the full stop to be able to treat
// the value as a percentage (if not, the '.' will considered "garbage",
// yielding a regular length.) Gecko and Edge does not.
skipWhile<CharacterType, isASCIIDigit>(current, end);
}
bool ok;
double value = charactersToDouble(numberStart, current - numberStart, &ok);
if (!ok)
return false;
HTMLDimension::HTMLDimensionType type = HTMLDimension::Absolute;
if (current < end) {
if (*current == '%') {
type = HTMLDimension::Percentage;
} else if (*current == '*') {
// Deviation: HTML does not recognize '*' in this context, and we don't
// treat it as a valid value. We do count it though, so this is purely
// for statistics. Note though that per the specced behavior, "<number>*"
// would be the same as "<number>" (i.e '*' would just be trailing
// garbage.)
type = HTMLDimension::Relative;
}
}
dimension = HTMLDimension(value, type);
return true;
}
// https://html.spec.whatwg.org/multipage/infrastructure.html#rules-for-parsing-dimension-values
bool parseDimensionValue(const String& input, HTMLDimension& dimension) {
if (input.isEmpty())
return false;
if (input.is8Bit()) {
return parseDimensionValue(input.characters8(),
input.characters8() + input.length(), dimension);
}
return parseDimensionValue(input.characters16(),
input.characters16() + input.length(), dimension);
}
} // namespace blink
|