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
|
/*
* Copyright (C) Research In Motion Limited 2010. 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 "SVGResourcesCycleSolver.h"
#include "LegacyRenderSVGResourceFilter.h"
#include "LegacyRenderSVGResourceMarker.h"
#include "LegacyRenderSVGResourceMasker.h"
#include "Logging.h"
#include "RenderAncestorIterator.h"
#include "SVGGradientElement.h"
#include "SVGPatternElement.h"
#include "SVGResources.h"
#include "SVGResourcesCache.h"
#include <wtf/Scope.h>
namespace WebCore {
bool SVGResourcesCycleSolver::resourceContainsCycles(LegacyRenderSVGResourceContainer& resource,
SingleThreadWeakHashSet<LegacyRenderSVGResourceContainer>& activeResources, SingleThreadWeakHashSet<LegacyRenderSVGResourceContainer>& acyclicResources)
{
if (acyclicResources.contains(resource))
return false;
activeResources.add(resource);
auto activeResourceAcquisition = WTF::makeScopeExit([&]() {
activeResources.remove(resource);
});
RenderObject* node = &resource;
while (node) {
if (node != &resource && node->isLegacyRenderSVGResourceContainer()) {
node = node->nextInPreOrderAfterChildren(&resource);
continue;
}
if (auto* element = dynamicDowncast<RenderElement>(*node)) {
if (auto* resources = SVGResourcesCache::cachedResourcesForRenderer(*element)) {
SingleThreadWeakHashSet<LegacyRenderSVGResourceContainer> resourceSet;
resources->buildSetOfResources(resourceSet);
for (auto& resource : resourceSet) {
if (activeResources.contains(resource) || resourceContainsCycles(resource, activeResources, acyclicResources))
return true;
}
}
}
node = node->nextInPreOrder(&resource);
}
acyclicResources.add(resource);
return false;
}
void SVGResourcesCycleSolver::resolveCycles(RenderElement& renderer, SVGResources& resources)
{
// Verify that LBSE does not make use of SVGResourcesCache.
if (renderer.document().settings().layerBasedSVGEngineEnabled())
RELEASE_ASSERT_NOT_REACHED();
SingleThreadWeakHashSet<LegacyRenderSVGResourceContainer> localResources;
resources.buildSetOfResources(localResources);
SingleThreadWeakHashSet<LegacyRenderSVGResourceContainer> activeResources;
SingleThreadWeakHashSet<LegacyRenderSVGResourceContainer> acyclicResources;
if (auto* container = dynamicDowncast<LegacyRenderSVGResourceContainer>(renderer))
activeResources.add(*container);
// The job of this function is to determine wheter any of the 'resources' associated with the given 'renderer'
// references us (or whether any of its kids references us) -> that's a cycle, we need to find and break it.
for (auto& resource : localResources) {
if (activeResources.contains(resource) || resourceContainsCycles(resource, activeResources, acyclicResources))
breakCycle(resource, resources);
}
}
void SVGResourcesCycleSolver::breakCycle(LegacyRenderSVGResourceContainer& resourceLeadingToCycle, SVGResources& resources)
{
if (&resourceLeadingToCycle == resources.linkedResource()) {
resources.resetLinkedResource();
return;
}
switch (resourceLeadingToCycle.resourceType()) {
case MaskerResourceType:
ASSERT(&resourceLeadingToCycle == resources.masker());
resources.resetMasker();
break;
case MarkerResourceType:
ASSERT(&resourceLeadingToCycle == resources.markerStart() || &resourceLeadingToCycle == resources.markerMid() || &resourceLeadingToCycle == resources.markerEnd());
if (resources.markerStart() == &resourceLeadingToCycle)
resources.resetMarkerStart();
if (resources.markerMid() == &resourceLeadingToCycle)
resources.resetMarkerMid();
if (resources.markerEnd() == &resourceLeadingToCycle)
resources.resetMarkerEnd();
break;
case PatternResourceType:
case LinearGradientResourceType:
case RadialGradientResourceType:
ASSERT(&resourceLeadingToCycle == resources.fill() || &resourceLeadingToCycle == resources.stroke());
if (resources.fill() == &resourceLeadingToCycle)
resources.resetFill();
if (resources.stroke() == &resourceLeadingToCycle)
resources.resetStroke();
break;
case FilterResourceType:
ASSERT(&resourceLeadingToCycle == resources.filter());
resources.resetFilter();
break;
case ClipperResourceType:
ASSERT(&resourceLeadingToCycle == resources.clipper());
resources.resetClipper();
break;
case SolidColorResourceType:
ASSERT_NOT_REACHED();
break;
}
}
}
|
