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
221
|
/*
* Copyright (C) 1999 Lars Knoll (knoll@kde.org)
* (C) 1999 Antti Koivisto (koivisto@kde.org)
* (C) 2001 Dirk Mueller ( mueller@kde.org )
* Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008 Apple Inc. All rights reserved.
* Copyright (C) 2006 Andrew Wellington (proton@wiretapped.net)
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Library General Public
* License as published by the Free Software Foundation; either
* version 2 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Library General Public License for more details.
*
* You should have received a copy of the GNU Library General Public License
* along with this library; see the file COPYING.LIB. If not, write to
* the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*
*/
#include "config.h"
#include "platform/Length.h"
#include "platform/CalculationValue.h"
#include "wtf/ASCIICType.h"
#include "wtf/text/StringBuffer.h"
#include "wtf/text/WTFString.h"
using namespace WTF;
namespace WebCore {
template<typename CharType>
static unsigned splitLength(const CharType* data, unsigned length, unsigned& intLength, unsigned& doubleLength)
{
ASSERT(length);
unsigned i = 0;
while (i < length && isSpaceOrNewline(data[i]))
++i;
if (i < length && (data[i] == '+' || data[i] == '-'))
++i;
while (i < length && isASCIIDigit(data[i]))
++i;
intLength = i;
while (i < length && (isASCIIDigit(data[i]) || data[i] == '.'))
++i;
doubleLength = i;
// IE quirk: Skip whitespace between the number and the % character (20 % => 20%).
while (i < length && isSpaceOrNewline(data[i]))
++i;
return i;
}
template<typename CharType>
static Length parseHTMLAreaCoordinate(const CharType* data, unsigned length)
{
unsigned intLength;
unsigned doubleLength;
splitLength(data, length, intLength, doubleLength);
bool ok;
int r = charactersToIntStrict(data, intLength, &ok);
if (ok)
return Length(r, Fixed);
return Length(0, Fixed);
}
// FIXME: Per HTML5, this should follow the "rules for parsing a list of integers".
Vector<Length> parseHTMLAreaElementCoords(const String& string)
{
unsigned length = string.length();
StringBuffer<LChar> spacified(length);
for (unsigned i = 0; i < length; i++) {
UChar cc = string[i];
if (cc > '9' || (cc < '0' && cc != '-' && cc != '.'))
spacified[i] = ' ';
else
spacified[i] = cc;
}
RefPtr<StringImpl> str = spacified.release();
str = str->simplifyWhiteSpace();
ASSERT(str->is8Bit());
if (!str->length())
return Vector<Length>();
unsigned len = str->count(' ') + 1;
Vector<Length> r(len);
unsigned i = 0;
unsigned pos = 0;
size_t pos2;
while ((pos2 = str->find(' ', pos)) != kNotFound) {
r[i++] = parseHTMLAreaCoordinate(str->characters8() + pos, pos2 - pos);
pos = pos2 + 1;
}
r[i] = parseHTMLAreaCoordinate(str->characters8() + pos, str->length() - pos);
ASSERT(i == len - 1);
return r;
}
class CalculationValueHandleMap {
WTF_MAKE_FAST_ALLOCATED;
public:
CalculationValueHandleMap()
: m_index(1)
{
}
int insert(PassRefPtr<CalculationValue> calcValue)
{
ASSERT(m_index);
// FIXME calc(): https://bugs.webkit.org/show_bug.cgi?id=80489
// This monotonically increasing handle generation scheme is potentially wasteful
// of the handle space. Consider reusing empty handles.
while (m_map.contains(m_index))
m_index++;
m_map.set(m_index, calcValue);
return m_index;
}
void remove(int index)
{
ASSERT(m_map.contains(index));
m_map.remove(index);
}
CalculationValue* get(int index)
{
ASSERT(m_map.contains(index));
return m_map.get(index);
}
void decrementRef(int index)
{
ASSERT(m_map.contains(index));
CalculationValue* value = m_map.get(index);
if (value->hasOneRef()) {
// Force the CalculationValue destructor early to avoid a potential recursive call inside HashMap remove().
m_map.set(index, 0);
m_map.remove(index);
} else {
value->deref();
}
}
private:
int m_index;
HashMap<int, RefPtr<CalculationValue> > m_map;
};
static CalculationValueHandleMap& calcHandles()
{
DEFINE_STATIC_LOCAL(CalculationValueHandleMap, handleMap, ());
return handleMap;
}
Length::Length(PassRefPtr<CalculationValue> calc)
: m_quirk(false)
, m_type(Calculated)
, m_isFloat(false)
{
m_intValue = calcHandles().insert(calc);
}
Length Length::blendMixedTypes(const Length& from, double progress, ValueRange range) const
{
return Length(CalculationValue::create(adoptPtr(new CalcExpressionBlendLength(from, *this, progress)), range));
}
CalculationValue* Length::calculationValue() const
{
ASSERT(isCalculated());
return calcHandles().get(calculationHandle());
}
void Length::incrementCalculatedRef() const
{
ASSERT(isCalculated());
calculationValue()->ref();
}
void Length::decrementCalculatedRef() const
{
ASSERT(isCalculated());
calcHandles().decrementRef(calculationHandle());
}
float Length::nonNanCalculatedValue(int maxValue) const
{
ASSERT(isCalculated());
float result = calculationValue()->evaluate(maxValue);
if (std::isnan(result))
return 0;
return result;
}
bool Length::isCalculatedEqual(const Length& o) const
{
return isCalculated() && (calculationValue() == o.calculationValue() || *calculationValue() == *o.calculationValue());
}
struct SameSizeAsLength {
int32_t value;
int32_t metaData;
};
COMPILE_ASSERT(sizeof(Length) == sizeof(SameSizeAsLength), length_should_stay_small);
} // namespace WebCore
|
