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
|
/*
* Copyright (C) 2015-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.
*/
#pragma once
#if ENABLE(DFG_JIT)
#include "DFGBasicBlock.h"
#include "DFGBlockMapInlines.h"
#include "DFGBlockSet.h"
#include "DFGGraph.h"
#include <wtf/SingleRootGraph.h>
#include <wtf/TZoneMalloc.h>
namespace JSC { namespace DFG {
class CFG {
WTF_MAKE_NONCOPYABLE(CFG);
WTF_MAKE_TZONE_ALLOCATED(CFG);
public:
typedef BasicBlock* Node;
typedef BlockSet Set;
template<typename T> using Map = BlockMap<T>;
typedef BlockList List;
CFG(Graph& graph)
: m_graph(graph)
{
}
Node root()
{
ASSERT(m_graph.m_form == SSA || m_graph.m_isInSSAConversion);
return m_graph.block(0);
}
List roots()
{
List result;
for (BasicBlock* root : m_graph.m_roots)
result.append(root);
return result;
}
template<typename T>
Map<T> newMap() { return BlockMap<T>(m_graph); }
DFG::Node::SuccessorsIterable successors(Node node) { return node->successors(); }
PredecessorList& predecessors(Node node) { return node->predecessors; }
unsigned index(Node node) const { return node->index; }
Node node(unsigned index) const { return m_graph.block(index); }
unsigned numNodes() const { return m_graph.numBlocks(); }
PointerDump<BasicBlock> dump(Node node) const { return pointerDump(node); }
void dump(PrintStream& out) const
{
m_graph.dump(out);
}
private:
Graph& m_graph;
};
class CPSCFG : public SingleRootGraph<CFG> {
public:
CPSCFG(Graph& graph)
: SingleRootGraph<CFG>(*graph.m_ssaCFG)
{
ASSERT(graph.m_roots.size());
}
};
using SSACFG = CFG;
template <typename T, typename = typename std::enable_if<std::is_same<T, CPSCFG>::value>::type>
CPSCFG& selectCFG(Graph& graph)
{
return graph.ensureCPSCFG();
}
template <typename T, typename = typename std::enable_if<std::is_same<T, SSACFG>::value>::type>
SSACFG& selectCFG(Graph& graph)
{
RELEASE_ASSERT(graph.m_ssaCFG);
return *graph.m_ssaCFG;
}
} } // namespace JSC::DFG
#endif // ENABLE(DFG_JIT)
|
