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
|
/*
* Copyright (C) 2011 University of Szeged
* Copyright (C) 2011 Renata Hodovan <reni@webkit.org>
* Copyright (C) 2020, 2021, 2022 Igalia S.L.
* 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 UNIVERSITY OF SZEGED ``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 UNIVERSITY OF SZEGED 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 "RenderSVGRect.h"
#include "RenderSVGShapeInlines.h"
#include "SVGElementTypeHelpers.h"
#include "SVGRectElement.h"
#include <wtf/TZoneMallocInlines.h>
namespace WebCore {
WTF_MAKE_TZONE_OR_ISO_ALLOCATED_IMPL(RenderSVGRect);
RenderSVGRect::RenderSVGRect(SVGRectElement& element, RenderStyle&& style)
: RenderSVGShape(Type::SVGRect, element, WTFMove(style))
{
}
RenderSVGRect::~RenderSVGRect() = default;
SVGRectElement& RenderSVGRect::rectElement() const
{
return downcast<SVGRectElement>(RenderSVGShape::graphicsElement());
}
void RenderSVGRect::updateShapeFromElement()
{
// Before creating a new object we need to clear the cached bounding box
// to avoid using garbage.
clearPath();
m_shapeType = ShapeType::Empty;
m_fillBoundingBox = FloatRect();
m_strokeBoundingBox = std::nullopt;
m_approximateStrokeBoundingBox = std::nullopt;
Ref rectElement = this->rectElement();
SVGLengthContext lengthContext(rectElement.ptr());
FloatSize boundingBoxSize(lengthContext.valueForLength(style().width(), SVGLengthMode::Width), lengthContext.valueForLength(style().height(), SVGLengthMode::Height));
// Spec: "A negative value is illegal. A value of zero disables rendering of the element."
if (boundingBoxSize.isEmpty())
return;
Ref svgStyle = style().svgStyle();
if (lengthContext.valueForLength(svgStyle->rx(), SVGLengthMode::Width) > 0
|| lengthContext.valueForLength(svgStyle->ry(), SVGLengthMode::Height) > 0)
m_shapeType = ShapeType::RoundedRectangle;
else
m_shapeType = ShapeType::Rectangle;
if (m_shapeType != ShapeType::Rectangle || hasNonScalingStroke()) {
// Fallback to path-based approach.
m_fillBoundingBox = ensurePath().boundingRect();
return;
}
m_fillBoundingBox = FloatRect(FloatPoint(lengthContext.valueForLength(svgStyle->x(), SVGLengthMode::Width),
lengthContext.valueForLength(svgStyle->y(), SVGLengthMode::Height)),
boundingBoxSize);
auto strokeBoundingBox = m_fillBoundingBox;
if (svgStyle->hasStroke())
strokeBoundingBox.inflate(this->strokeWidth() / 2);
#if USE(CG)
// CoreGraphics can inflate the stroke by 1px when drawing a rectangle with antialiasing disabled at non-integer coordinates, we need to compensate.
if (svgStyle->shapeRendering() == ShapeRendering::CrispEdges)
strokeBoundingBox.inflate(1);
#endif
m_strokeBoundingBox = strokeBoundingBox;
}
void RenderSVGRect::fillShape(GraphicsContext& context) const
{
if (hasPath()) {
RenderSVGShape::fillShape(context);
return;
}
#if USE(CG)
// FIXME: CG implementation of GraphicsContextCG::fillRect has an own
// shadow drawing method, which draws an extra shadow.
// This is a workaround for switching off the extra shadow.
// https://bugs.webkit.org/show_bug.cgi?id=68899
if (context.hasDropShadow()) {
GraphicsContextStateSaver stateSaver(context);
context.clearDropShadow();
context.fillRect(m_fillBoundingBox);
return;
}
#endif
context.fillRect(m_fillBoundingBox);
}
bool RenderSVGRect::canUseStrokeHitTestFastPath() const
{
// Non-scaling-stroke needs special handling.
if (hasNonScalingStroke())
return false;
// We can compute intersections with simple, continuous strokes on
// regular rectangles without using a Path.
return m_shapeType == ShapeType::Rectangle && definitelyHasSimpleStroke();
}
// Returns true if the stroke is continuous and definitely uses miter joins.
bool RenderSVGRect::definitelyHasSimpleStroke() const
{
// The four angles of a rect are 90 degrees. Using the formula at:
// http://www.w3.org/TR/SVG/painting.html#StrokeMiterlimitProperty
// when the join style of the rect is "miter", the ratio of the miterLength
// to the stroke-width is found to be
// miterLength / stroke-width = 1 / sin(45 degrees)
// = 1 / (1 / sqrt(2))
// = sqrt(2)
// = 1.414213562373095...
// When sqrt(2) exceeds the miterlimit, then the join style switches to
// "bevel". When the miterlimit is greater than or equal to sqrt(2) then
// the join style remains "miter".
//
// An approximation of sqrt(2) is used here because at certain precise
// miterlimits, the join style used might not be correct (e.g. a miterlimit
// of 1.4142135 should result in bevel joins, but may be drawn using miter
// joins).
return style().svgStyle().strokeDashArray().isEmpty() && style().joinStyle() == LineJoin::Miter && style().strokeMiterLimit() >= 1.5;
}
void RenderSVGRect::strokeShape(GraphicsContext& context) const
{
if (!style().hasVisibleStroke())
return;
if (hasPath()) {
RenderSVGShape::strokeShape(context);
return;
}
context.strokeRect(m_fillBoundingBox, strokeWidth());
}
bool RenderSVGRect::shapeDependentStrokeContains(const FloatPoint& point, PointCoordinateSpace pointCoordinateSpace)
{
if (!canUseStrokeHitTestFastPath()) {
ensurePath();
return RenderSVGShape::shapeDependentStrokeContains(point, pointCoordinateSpace);
}
auto halfStrokeWidth = strokeWidth() / 2;
auto halfWidth = m_fillBoundingBox.width() / 2;
auto halfHeight = m_fillBoundingBox.height() / 2;
auto fillBoundingBoxCenter = FloatPoint(m_fillBoundingBox.x() + halfWidth, m_fillBoundingBox.y() + halfHeight);
auto absDeltaX = std::abs(point.x() - fillBoundingBoxCenter.x());
auto absDeltaY = std::abs(point.y() - fillBoundingBoxCenter.y());
if (!(absDeltaX <= halfWidth + halfStrokeWidth && absDeltaY <= halfHeight + halfStrokeWidth))
return false;
return (halfWidth - halfStrokeWidth <= absDeltaX) || (halfHeight - halfStrokeWidth <= absDeltaY);
}
bool RenderSVGRect::shapeDependentFillContains(const FloatPoint& point, const WindRule fillRule) const
{
if (m_shapeType == ShapeType::Empty)
return false;
if (m_shapeType != ShapeType::Rectangle)
return RenderSVGShape::shapeDependentFillContains(point, fillRule);
return m_fillBoundingBox.contains(point.x(), point.y());
}
bool RenderSVGRect::isRenderingDisabled() const
{
// A width or height of zero disables rendering for the element, and results in an empty bounding box.
return m_fillBoundingBox.isEmpty();
}
}
|
