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
|
/*
* Copyright (C) 2016-2023 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. ``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
* 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 "DFGFlowIndexing.h"
#if ENABLE(DFG_JIT)
#include "JSCJSValueInlines.h"
#include <wtf/TZoneMallocInlines.h>
namespace JSC { namespace DFG {
WTF_MAKE_TZONE_ALLOCATED_IMPL(FlowIndexing);
FlowIndexing::FlowIndexing(Graph& graph)
: m_graph(graph)
, m_numIndices(0)
{
recompute();
}
FlowIndexing::~FlowIndexing() = default;
void FlowIndexing::recompute()
{
unsigned numNodeIndices = m_graph.maxNodeCount();
m_nodeIndexToShadowIndex.resize(numNodeIndices);
m_nodeIndexToShadowIndex.fill(UINT_MAX);
m_shadowIndexToNodeIndex.shrink(0);
m_numIndices = numNodeIndices;
for (BasicBlock* block : m_graph.blocksInNaturalOrder()) {
for (Node* node : *block) {
if (node->op() != Phi)
continue;
unsigned nodeIndex = node->index();
unsigned shadowIndex = m_numIndices++;
m_nodeIndexToShadowIndex[nodeIndex] = shadowIndex;
m_shadowIndexToNodeIndex.append(nodeIndex);
DFG_ASSERT(m_graph, nullptr, m_shadowIndexToNodeIndex.size() + numNodeIndices == m_numIndices);
DFG_ASSERT(m_graph, nullptr, m_shadowIndexToNodeIndex[shadowIndex - numNodeIndices] == nodeIndex);
}
}
}
} } // namespace JSC::DFG
#endif // ENABLE(DFG_JIT)
|
