forked from WebKit/WebKit
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathNFA.cpp
More file actions
126 lines (105 loc) · 4.64 KB
/
NFA.cpp
File metadata and controls
126 lines (105 loc) · 4.64 KB
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
/*
* 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 "NFA.h"
#if ENABLE(CONTENT_EXTENSIONS)
#include <wtf/ASCIICType.h>
#include <wtf/DataLog.h>
namespace WebCore {
namespace ContentExtensions {
#if CONTENT_EXTENSIONS_STATE_MACHINE_DEBUGGING
void NFA::debugPrintDot() const
{
dataLogF("digraph NFA_Transitions {\n");
dataLogF(" rankdir=LR;\n");
dataLogF(" node [shape=circle];\n");
dataLogF(" {\n");
for (unsigned i = 0; i < nodes.size(); ++i) {
dataLogF(" %d [label=<Node %d", i, i);
const auto& node = nodes[i];
if (node.actionStart != node.actionEnd) {
dataLogF("<BR/>(Final: ");
bool isFirst = true;
for (unsigned actionIndex = node.actionStart; actionIndex < node.actionEnd; ++actionIndex) {
if (!isFirst)
dataLogF(", ");
dataLogF("%" PRIu64, actions[actionIndex]);
isFirst = false;
}
dataLogF(")");
}
dataLogF(">]");
if (node.actionStart != node.actionEnd)
dataLogF(" [shape=doublecircle]");
dataLogF(";\n");
}
dataLogF(" }\n");
dataLogF(" {\n");
for (unsigned i = 0; i < nodes.size(); ++i) {
const auto& node = nodes[i];
HashMap<uint32_t, Vector<uint32_t>, DefaultHash<unsigned>, WTF::UnsignedWithZeroKeyHashTraits<unsigned>> transitionsPerTarget;
for (uint32_t transitionIndex = node.rangesStart; transitionIndex < node.rangesEnd; ++transitionIndex) {
const ImmutableCharRange& range = transitions[transitionIndex];
for (uint32_t targetIndex = range.targetStart; targetIndex < range.targetEnd; ++targetIndex) {
uint32_t target = targets[targetIndex];
auto addResult = transitionsPerTarget.add(target, Vector<uint32_t>());
addResult.iterator->value.append(transitionIndex);
}
}
for (const auto& slot : transitionsPerTarget) {
dataLogF(" %d -> %d [label=\"", i, slot.key);
bool isFirst = true;
for (uint32_t rangeIndex : slot.value) {
if (!isFirst)
dataLogF(", ");
else
isFirst = false;
const ImmutableCharRange& range = transitions[rangeIndex];
if (range.first == range.last) {
if (isASCIIPrintable(range.first))
dataLogF("%c", range.first);
else
dataLogF("%d", range.first);
} else {
if (isASCIIPrintable(range.first) && isASCIIPrintable(range.last))
dataLogF("%c-%c", range.first, range.last);
else
dataLogF("%d-%d", range.first, range.last);
}
}
dataLogF("\"]\n");
}
for (uint32_t epsilonTargetIndex = node.epsilonTransitionTargetsStart; epsilonTargetIndex < node.epsilonTransitionTargetsEnd; ++epsilonTargetIndex) {
uint32_t target = epsilonTransitionsTargets[epsilonTargetIndex];
dataLogF(" %d -> %d [label=\"ɛ\"]\n", i, target);
}
}
dataLogF(" }\n");
dataLogF("}\n");
}
#endif
} // namespace ContentExtensions
} // namespace WebCore
#endif // ENABLE(CONTENT_EXTENSIONS)