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
|
/*
* Copyright (C) 1999 Antti Koivisto (koivisto@kde.org)
* Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved.
*
* 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 "ShadowData.h"
#include <wtf/PointerComparison.h>
#include <wtf/text/TextStream.h>
namespace WebCore {
ShadowData::ShadowData(const ShadowData& o)
: m_location(o.m_location.x(), o.m_location.y())
, m_spread(o.m_spread)
, m_radius(o.m_radius)
, m_color(o.m_color)
, m_style(o.m_style)
, m_isWebkitBoxShadow(o.m_isWebkitBoxShadow)
, m_next(o.m_next ? makeUnique<ShadowData>(*o.m_next) : nullptr)
{
}
void ShadowData::deleteNextLinkedListWithoutRecursion()
{
// Avoid recursion errors when the linked list is too long.
for (auto next = std::exchange(m_next, nullptr); (next = std::exchange(next->m_next, nullptr));) { }
}
std::optional<ShadowData> ShadowData::clone(const ShadowData* data)
{
if (!data)
return std::nullopt;
return *data;
}
bool ShadowData::operator==(const ShadowData& o) const
{
auto comparison = [](const auto& a, const auto& b) {
return a.m_location == b.m_location
&& a.m_radius == b.m_radius
&& a.m_spread == b.m_spread
&& a.m_style == b.m_style
&& a.m_color == b.m_color
&& a.m_isWebkitBoxShadow == b.m_isWebkitBoxShadow;
};
if (!comparison(*this, o))
return false;
// Avoid relying on recursion in case the linked list is very long.
auto* next = m_next.get();
auto* oNext = o.m_next.get();
while (next || oNext) {
if (!next || !oNext || !comparison(*next, *oNext))
return false;
next = next->m_next.get();
oNext = oNext->m_next.get();
}
return true;
}
LayoutBoxExtent ShadowData::shadowOutsetExtent() const
{
LayoutUnit top;
LayoutUnit right;
LayoutUnit bottom;
LayoutUnit left;
for (auto* shadow = this; shadow; shadow = shadow->next()) {
auto extentAndSpread = shadow->paintingExtent() + LayoutUnit(shadow->spread().value());
if (shadow->style() == ShadowStyle::Inset)
continue;
left = std::min(LayoutUnit(shadow->x().value()) - extentAndSpread, left);
right = std::max(LayoutUnit(shadow->x().value()) + extentAndSpread, right);
top = std::min(LayoutUnit(shadow->y().value()) - extentAndSpread, top);
bottom = std::max(LayoutUnit(shadow->y().value()) + extentAndSpread, bottom);
}
return { top, right, bottom, left };
}
LayoutBoxExtent ShadowData::shadowInsetExtent() const
{
LayoutUnit top;
LayoutUnit right;
LayoutUnit bottom;
LayoutUnit left;
for (auto* shadow = this; shadow; shadow = shadow->next()) {
if (shadow->style() == ShadowStyle::Normal)
continue;
auto extentAndSpread = shadow->paintingExtent() + LayoutUnit(shadow->spread().value());
top = std::max<LayoutUnit>(top, LayoutUnit(shadow->y().value()) + extentAndSpread);
right = std::min<LayoutUnit>(right, LayoutUnit(shadow->x().value()) - extentAndSpread);
bottom = std::min<LayoutUnit>(bottom, LayoutUnit(shadow->y().value()) - extentAndSpread);
left = std::max<LayoutUnit>(left, LayoutUnit(shadow->x().value()) + extentAndSpread);
}
return { top, right, bottom, left };
}
void ShadowData::adjustRectForShadow(LayoutRect& rect) const
{
auto shadowExtent = shadowOutsetExtent();
rect.move(shadowExtent.left(), shadowExtent.top());
rect.setWidth(rect.width() - shadowExtent.left() + shadowExtent.right());
rect.setHeight(rect.height() - shadowExtent.top() + shadowExtent.bottom());
}
void ShadowData::adjustRectForShadow(FloatRect& rect) const
{
auto shadowExtent = shadowOutsetExtent();
rect.move(shadowExtent.left(), shadowExtent.top());
rect.setWidth(rect.width() - shadowExtent.left() + shadowExtent.right());
rect.setHeight(rect.height() - shadowExtent.top() + shadowExtent.bottom());
}
TextStream& operator<<(TextStream& ts, const ShadowData& data)
{
ts.dumpProperty("location", data.location());
ts.dumpProperty("radius", data.radius());
ts.dumpProperty("spread", data.spread());
ts.dumpProperty("color", data.color());
return ts;
}
} // namespace WebCore
|
