1/*
2 * Copyright (C) 2013, 2014 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#include "config.h"
27#include "DFGBlockInsertionSet.h"
28
29#if ENABLE(DFG_JIT)
30
31#include "JSCInlines.h"
32
33namespace JSC { namespace DFG {
34
35BlockInsertionSet::BlockInsertionSet(Graph& graph)
36 : m_graph(graph)
37{
38}
39
40BlockInsertionSet::~BlockInsertionSet() { }
41
42void BlockInsertionSet::insert(const BlockInsertion& insertion)
43{
44 m_insertions.append(insertion);
45}
46
47void BlockInsertionSet::insert(size_t index, Ref<BasicBlock>&& block)
48{
49 insert(BlockInsertion(index, WTFMove(block)));
50}
51
52BasicBlock* BlockInsertionSet::insert(size_t index, float executionCount)
53{
54 Ref<BasicBlock> block = adoptRef(*new BasicBlock(BytecodeIndex(), m_graph.block(0)->variablesAtHead.numberOfArguments(), m_graph.block(0)->variablesAtHead.numberOfLocals(), executionCount));
55 block->isReachable = true;
56 auto* result = block.ptr();
57 insert(index, WTFMove(block));
58 return result;
59}
60
61BasicBlock* BlockInsertionSet::insertBefore(BasicBlock* before, float executionCount)
62{
63 return insert(before->index, executionCount);
64}
65
66bool BlockInsertionSet::execute()
67{
68 if (m_insertions.isEmpty())
69 return false;
70
71 // We allow insertions to be given to us in any order. So, we need to sort them before
72 // running WTF::executeInsertions. Also, we don't really care if the sort is stable since
73 // basic block order doesn't have semantics - it's just to make code easier to read.
74 std::sort(m_insertions.begin(), m_insertions.end());
75
76 executeInsertions(m_graph.m_blocks, m_insertions);
77
78 // Prune out empty entries. This isn't strictly necessary but it's
79 // healthy to keep the block list from growing.
80 unsigned targetIndex = 0;
81 for (unsigned sourceIndex = 0; sourceIndex < m_graph.m_blocks.size();) {
82 RefPtr<BasicBlock> block = m_graph.m_blocks[sourceIndex++];
83 if (!block)
84 continue;
85 m_graph.m_blocks[targetIndex++] = block;
86 }
87 m_graph.m_blocks.shrink(targetIndex);
88
89 // Make sure that the blocks know their new indices.
90 for (unsigned i = 0; i < m_graph.m_blocks.size(); ++i)
91 m_graph.m_blocks[i]->index = i;
92
93 // And finally, invalidate all analyses that rely on the CFG.
94 m_graph.invalidateCFG();
95 m_graph.dethread();
96
97 return true;
98}
99
100} } // namespace JSC::DFG
101
102#endif // ENABLE(DFG_JIT)
103
104