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 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228
|
/*
* Copyright (C) 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.
*/
#pragma once
#include "ImmutableNFA.h"
#include "MutableRangeList.h"
#include <wtf/HashSet.h>
#if ENABLE(CONTENT_EXTENSIONS)
namespace WebCore {
namespace ContentExtensions {
// A ImmutableNFANodeBuilder let you build an NFA node by adding states and linking with other nodes.
// When a builder is destructed, all its properties are finalized into the NFA. Using the NFA with a live
// builder results in undefined behavior.
template <typename CharacterType, typename ActionType>
class ImmutableNFANodeBuilder {
typedef ImmutableNFA<CharacterType, ActionType> TypedImmutableNFA;
typedef UncheckedKeyHashSet<uint32_t, DefaultHash<uint32_t>, WTF::UnsignedWithZeroKeyHashTraits<uint32_t>> TargetSet;
public:
ImmutableNFANodeBuilder() { }
ImmutableNFANodeBuilder(TypedImmutableNFA& immutableNFA)
: m_immutableNFA(&immutableNFA)
, m_finalized(false)
{
m_nodeId = m_immutableNFA->nodes.size();
m_immutableNFA->nodes.append(ImmutableNFANode());
}
ImmutableNFANodeBuilder(ImmutableNFANodeBuilder&& other)
: m_immutableNFA(other.m_immutableNFA)
, m_ranges(WTFMove(other.m_ranges))
, m_epsilonTransitionTargets(WTFMove(other.m_epsilonTransitionTargets))
, m_actions(WTFMove(other.m_actions))
, m_nodeId(other.m_nodeId)
, m_finalized(other.m_finalized)
{
other.m_immutableNFA = nullptr;
other.m_finalized = true;
}
~ImmutableNFANodeBuilder()
{
if (!m_finalized)
finalize();
}
bool isValid() const
{
return !!m_immutableNFA;
}
uint32_t nodeId() const
{
ASSERT(isValid());
return m_nodeId;
}
struct TrivialRange {
CharacterType first;
CharacterType last;
};
struct FakeRangeIterator {
CharacterType first() const { return range.first; }
CharacterType last() const { return range.last; }
uint32_t data() const { return targetId; }
bool operator==(const FakeRangeIterator& other) const
{
return this->isEnd == other.isEnd;
}
FakeRangeIterator operator++()
{
isEnd = true;
return *this;
}
TrivialRange range;
uint32_t targetId;
bool isEnd;
};
void addTransition(CharacterType first, CharacterType last, uint32_t targetNodeId)
{
ASSERT(!m_finalized);
ASSERT(m_immutableNFA);
struct Converter {
TargetSet convert(uint32_t target)
{
return TargetSet({ target });
}
void extend(TargetSet& existingTargets, uint32_t target)
{
existingTargets.add(target);
}
};
Converter converter;
m_ranges.extend(FakeRangeIterator { { first, last }, targetNodeId, false }, FakeRangeIterator { { 0, 0 }, targetNodeId, true }, converter);
}
void addEpsilonTransition(const ImmutableNFANodeBuilder& target)
{
ASSERT(m_immutableNFA == target.m_immutableNFA);
addEpsilonTransition(target.m_nodeId);
}
void addEpsilonTransition(uint32_t targetNodeId)
{
ASSERT(!m_finalized);
ASSERT(m_immutableNFA);
m_epsilonTransitionTargets.add(targetNodeId);
}
template<typename ActionIterator>
void setActions(ActionIterator begin, ActionIterator end)
{
ASSERT(!m_finalized);
ASSERT(m_immutableNFA);
m_actions.add(begin, end);
}
ImmutableNFANodeBuilder& operator=(ImmutableNFANodeBuilder&& other)
{
if (!m_finalized)
finalize();
m_immutableNFA = other.m_immutableNFA;
m_ranges = WTFMove(other.m_ranges);
m_epsilonTransitionTargets = WTFMove(other.m_epsilonTransitionTargets);
m_actions = WTFMove(other.m_actions);
m_nodeId = other.m_nodeId;
m_finalized = other.m_finalized;
other.m_immutableNFA = nullptr;
other.m_finalized = true;
return *this;
}
private:
void finalize()
{
ASSERT_WITH_MESSAGE(!m_finalized, "The API contract is that the builder can only be finalized once.");
m_finalized = true;
ImmutableNFANode& immutableNFANode = m_immutableNFA->nodes[m_nodeId];
sinkActions(immutableNFANode);
sinkEpsilonTransitions(immutableNFANode);
sinkTransitions(immutableNFANode);
}
void sinkActions(ImmutableNFANode& immutableNFANode)
{
unsigned actionStart = m_immutableNFA->actions.size();
for (const ActionType& action : m_actions)
m_immutableNFA->actions.append(action);
unsigned actionEnd = m_immutableNFA->actions.size();
immutableNFANode.actionStart = actionStart;
immutableNFANode.actionEnd = actionEnd;
}
void sinkTransitions(ImmutableNFANode& immutableNFANode)
{
unsigned transitionsStart = m_immutableNFA->transitions.size();
for (const auto& range : m_ranges) {
unsigned targetsStart = m_immutableNFA->targets.size();
for (uint32_t target : range.data)
m_immutableNFA->targets.append(target);
unsigned targetsEnd = m_immutableNFA->targets.size();
m_immutableNFA->transitions.append(ImmutableRange<CharacterType> { targetsStart, targetsEnd, range.first, range.last });
}
unsigned transitionsEnd = m_immutableNFA->transitions.size();
immutableNFANode.rangesStart = transitionsStart;
immutableNFANode.rangesEnd = transitionsEnd;
}
void sinkEpsilonTransitions(ImmutableNFANode& immutableNFANode)
{
unsigned start = m_immutableNFA->epsilonTransitionsTargets.size();
for (uint32_t target : m_epsilonTransitionTargets)
m_immutableNFA->epsilonTransitionsTargets.append(target);
unsigned end = m_immutableNFA->epsilonTransitionsTargets.size();
immutableNFANode.epsilonTransitionTargetsStart = start;
immutableNFANode.epsilonTransitionTargetsEnd = end;
}
TypedImmutableNFA* m_immutableNFA { nullptr };
MutableRangeList<CharacterType, TargetSet> m_ranges;
TargetSet m_epsilonTransitionTargets;
UncheckedKeyHashSet<ActionType, IntHash<ActionType>, WTF::UnsignedWithZeroKeyHashTraits<ActionType>> m_actions;
uint32_t m_nodeId;
bool m_finalized { true };
};
} // namespace ContentExtensions
} // namespace WebCore
#endif // ENABLE(CONTENT_EXTENSIONS)
|