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
|
/*
* Copyright (C) 2013 Adobe Systems Incorporated. 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 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 HOLDER 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 "config.h"
#include "core/rendering/shapes/RasterShape.h"
#include "wtf/MathExtras.h"
namespace WebCore {
class MarginIntervalGenerator {
public:
MarginIntervalGenerator(unsigned radius);
void set(int y, const IntShapeInterval&);
IntShapeInterval intervalAt(int y) const;
private:
Vector<int> m_xIntercepts;
int m_y;
int m_x1;
int m_x2;
};
MarginIntervalGenerator::MarginIntervalGenerator(unsigned radius)
: m_y(0)
, m_x1(0)
, m_x2(0)
{
m_xIntercepts.resize(radius + 1);
unsigned radiusSquared = radius * radius;
for (unsigned y = 0; y <= radius; y++)
m_xIntercepts[y] = sqrt(static_cast<double>(radiusSquared - y * y));
}
void MarginIntervalGenerator::set(int y, const IntShapeInterval& interval)
{
ASSERT(y >= 0 && interval.x1() >= 0);
m_y = y;
m_x1 = interval.x1();
m_x2 = interval.x2();
}
IntShapeInterval MarginIntervalGenerator::intervalAt(int y) const
{
unsigned xInterceptsIndex = abs(y - m_y);
int dx = (xInterceptsIndex >= m_xIntercepts.size()) ? 0 : m_xIntercepts[xInterceptsIndex];
return IntShapeInterval(m_x1 - dx, m_x2 + dx);
}
PassOwnPtr<RasterShapeIntervals> RasterShapeIntervals::computeShapeMarginIntervals(int shapeMargin) const
{
int marginIntervalsSize = (offset() > shapeMargin) ? size() : size() - offset() * 2 + shapeMargin * 2;
OwnPtr<RasterShapeIntervals> result = adoptPtr(new RasterShapeIntervals(marginIntervalsSize, std::max(shapeMargin, offset())));
MarginIntervalGenerator marginIntervalGenerator(shapeMargin);
for (int y = bounds().y(); y < bounds().maxY(); ++y) {
const IntShapeInterval& intervalAtY = intervalAt(y);
if (intervalAtY.isEmpty())
continue;
marginIntervalGenerator.set(y, intervalAtY);
int marginY0 = std::max(minY(), y - shapeMargin);
int marginY1 = std::min(maxY(), y + shapeMargin + 1);
for (int marginY = y - 1; marginY >= marginY0; --marginY) {
if (marginY > bounds().y() && intervalAt(marginY).contains(intervalAtY))
break;
result->intervalAt(marginY).unite(marginIntervalGenerator.intervalAt(marginY));
}
result->intervalAt(y).unite(marginIntervalGenerator.intervalAt(y));
for (int marginY = y + 1; marginY < marginY1; ++marginY) {
if (marginY < bounds().maxY() && intervalAt(marginY).contains(intervalAtY))
break;
result->intervalAt(marginY).unite(marginIntervalGenerator.intervalAt(marginY));
}
}
result->initializeBounds();
return result.release();
}
void RasterShapeIntervals::initializeBounds()
{
m_bounds = IntRect();
for (int y = minY(); y < maxY(); ++y) {
const IntShapeInterval& intervalAtY = intervalAt(y);
if (intervalAtY.isEmpty())
continue;
m_bounds.unite(IntRect(intervalAtY.x1(), y, intervalAtY.width(), 1));
}
}
void RasterShapeIntervals::buildBoundsPath(Path& path) const
{
int maxY = bounds().maxY();
for (int y = bounds().y(); y < maxY; y++) {
if (intervalAt(y).isEmpty())
continue;
IntShapeInterval extent = intervalAt(y);
int endY = y + 1;
for (; endY < maxY; endY++) {
if (intervalAt(endY).isEmpty() || intervalAt(endY) != extent)
break;
}
path.addRect(FloatRect(extent.x1(), y, extent.width(), endY - y));
y = endY - 1;
}
}
const RasterShapeIntervals& RasterShape::marginIntervals() const
{
ASSERT(shapeMargin() >= 0);
if (!shapeMargin())
return *m_intervals;
int shapeMarginInt = clampToPositiveInteger(ceil(shapeMargin()));
int maxShapeMarginInt = std::max(m_marginRectSize.width(), m_marginRectSize.height()) * sqrtf(2);
if (!m_marginIntervals)
m_marginIntervals = m_intervals->computeShapeMarginIntervals(std::min(shapeMarginInt, maxShapeMarginInt));
return *m_marginIntervals;
}
void RasterShape::getExcludedIntervals(LayoutUnit logicalTop, LayoutUnit logicalHeight, SegmentList& result) const
{
const RasterShapeIntervals& intervals = marginIntervals();
if (intervals.isEmpty())
return;
int y1 = logicalTop;
int y2 = logicalTop + logicalHeight;
ASSERT(y2 >= y1);
if (y2 < intervals.bounds().y() || y1 >= intervals.bounds().maxY())
return;
y1 = std::max(y1, intervals.bounds().y());
y2 = std::min(y2, intervals.bounds().maxY());
IntShapeInterval excludedInterval;
for (int y = y1; y < y2; y++)
excludedInterval.unite(intervals.intervalAt(y));
// Note: |marginIntervals()| returns end-point exclusive
// intervals. |excludedInterval.x2()| contains the left-most pixel
// offset to the right of the calculated union.
result.append(LineSegment(excludedInterval.x1(), excludedInterval.x2()));
}
} // namespace WebCore
|
