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
|
/*
* Copyright (C) 2014, 2015 Apple Inc. 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 APPLE INC. AND ITS 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 APPLE INC. OR ITS 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 "DFA.h"
#if ENABLE(CONTENT_EXTENSIONS)
#include "DFAMinimizer.h"
#include <wtf/DataLog.h>
namespace WebCore {
namespace ContentExtensions {
DFA DFA::empty()
{
DFA newDFA;
newDFA.nodes.append(DFANode());
return newDFA;
}
size_t DFA::memoryUsed() const
{
return sizeof(DFA)
+ actions.capacity() * sizeof(uint64_t)
+ transitionRanges.capacity() * sizeof(CharRange)
+ transitionDestinations.capacity() * sizeof(uint32_t)
+ nodes.capacity() * sizeof(DFANode);
}
void DFA::shrinkToFit()
{
nodes.shrinkToFit();
actions.shrinkToFit();
transitionRanges.shrinkToFit();
transitionDestinations.shrinkToFit();
}
void DFA::minimize()
{
DFAMinimizer::minimize(*this);
}
unsigned DFA::graphSize() const
{
unsigned count = 0;
for (const DFANode& node : nodes) {
if (!node.isKilled())
++count;
}
return count;
}
#if CONTENT_EXTENSIONS_STATE_MACHINE_DEBUGGING
static void printRange(bool firstRange, char rangeStart, char rangeEnd)
{
if (!firstRange)
dataLogF(", ");
if (rangeStart == rangeEnd) {
if (rangeStart == '"' || rangeStart == '\\')
dataLogF("\\%c", rangeStart);
else if (rangeStart >= '!' && rangeStart <= '~')
dataLogF("%c", rangeStart);
else
dataLogF("\\\\%d", rangeStart);
} else
dataLogF("\\\\%d-\\\\%d", rangeStart, rangeEnd);
}
static void printTransitions(const DFA& dfa, unsigned sourceNodeId)
{
const DFANode& sourceNode = dfa.nodes[sourceNodeId];
auto transitions = sourceNode.transitions(dfa);
if (transitions.begin() == transitions.end())
return;
HashMap<unsigned, Vector<uint16_t>, DefaultHash<unsigned>::Hash, WTF::UnsignedWithZeroKeyHashTraits<unsigned>> transitionsPerTarget;
// First, we build the list of transitions coming to each target node.
for (const auto& transition : transitions) {
unsigned target = transition.target();
transitionsPerTarget.add(target, Vector<uint16_t>());
for (unsigned offset = 0; offset < transition.range().size(); ++offset)
transitionsPerTarget.find(target)->value.append(transition.first() + offset);
}
// Then we go over each one an display the ranges one by one.
for (const auto& transitionPerTarget : transitionsPerTarget) {
dataLogF(" %d -> %d [label=\"", sourceNodeId, transitionPerTarget.key);
Vector<uint16_t> incommingCharacters = transitionPerTarget.value;
std::sort(incommingCharacters.begin(), incommingCharacters.end());
char rangeStart = incommingCharacters.first();
char rangeEnd = rangeStart;
bool first = true;
for (unsigned sortedTransitionIndex = 1; sortedTransitionIndex < incommingCharacters.size(); ++sortedTransitionIndex) {
char nextChar = incommingCharacters[sortedTransitionIndex];
if (nextChar == rangeEnd+1) {
rangeEnd = nextChar;
continue;
}
printRange(first, rangeStart, rangeEnd);
rangeStart = rangeEnd = nextChar;
first = false;
}
printRange(first, rangeStart, rangeEnd);
dataLogF("\"];\n");
}
}
void DFA::debugPrintDot() const
{
dataLogF("digraph DFA_Transitions {\n");
dataLogF(" rankdir=LR;\n");
dataLogF(" node [shape=circle];\n");
dataLogF(" {\n");
for (unsigned i = 0; i < nodes.size(); ++i) {
if (nodes[i].isKilled())
continue;
dataLogF(" %d [label=<Node %d", i, i);
const Vector<uint64_t>& actions = nodes[i].actions(*this);
if (!actions.isEmpty()) {
dataLogF("<BR/>Actions: ");
for (unsigned actionIndex = 0; actionIndex < actions.size(); ++actionIndex) {
if (actionIndex)
dataLogF(", ");
dataLogF("%llu", actions[actionIndex]);
}
}
dataLogF(">]");
if (!actions.isEmpty())
dataLogF(" [shape=doublecircle]");
dataLogF(";\n");
}
dataLogF(" }\n");
dataLogF(" {\n");
for (unsigned i = 0; i < nodes.size(); ++i)
printTransitions(*this, i);
dataLogF(" }\n");
dataLogF("}\n");
}
#endif
} // namespace ContentExtensions
} // namespace WebCore
#endif // ENABLE(CONTENT_EXTENSIONS)
|
