1/*
2 * Copyright (C) 2015-2017 Apple Inc. All rights reserved.
3 *
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
6 * are met:
7 * 1. Redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer.
9 * 2. Redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution.
12 *
13 * THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
14 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
17 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
18 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
19 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
20 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
21 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
23 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
24 */
25
26#pragma once
27
28#if ENABLE(B3_JIT)
29
30#include "B3BasicBlock.h"
31#include "B3Procedure.h"
32#include <wtf/IndexMap.h>
33#include <wtf/IndexSet.h>
34
35namespace JSC { namespace B3 {
36
37class CFG {
38 WTF_MAKE_NONCOPYABLE(CFG);
39 WTF_MAKE_FAST_ALLOCATED;
40public:
41 typedef BasicBlock* Node;
42 typedef IndexSet<BasicBlock*> Set;
43 template<typename T> using Map = IndexMap<BasicBlock*, T>;
44 typedef Vector<BasicBlock*, 4> List;
45
46 CFG(Procedure& proc)
47 : m_proc(proc)
48 {
49 }
50
51 Node root() { return m_proc[0]; }
52
53 template<typename T>
54 Map<T> newMap() { return IndexMap<JSC::B3::BasicBlock*, T>(m_proc.size()); }
55
56 SuccessorCollection<BasicBlock, BasicBlock::SuccessorList> successors(Node node) { return node->successorBlocks(); }
57 BasicBlock::PredecessorList& predecessors(Node node) { return node->predecessors(); }
58
59 unsigned index(Node node) const { return node->index(); }
60 Node node(unsigned index) const { return m_proc[index]; }
61 unsigned numNodes() const { return m_proc.size(); }
62
63 PointerDump<BasicBlock> dump(Node node) const { return pointerDump(node); }
64
65 void dump(PrintStream& out) const
66 {
67 m_proc.dump(out);
68 }
69
70private:
71 Procedure& m_proc;
72};
73
74} } // namespace JSC::B3
75
76#endif // ENABLE(B3_JIT)
77