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, PassRefPtr<BasicBlock> block)
48{
49    insert(BlockInsertion(index, block));
50}
51
52BasicBlock* BlockInsertionSet::insert(size_t index, float executionCount)
53{
54    RefPtr<BasicBlock> block = adoptRef(new BasicBlock(
55        UINT_MAX,
56        m_graph.block(0)->variablesAtHead.numberOfArguments(),
57        m_graph.block(0)->variablesAtHead.numberOfLocals(),
58        executionCount));
59    block->isReachable = true;
60    insert(index, block);
61    return block.get();
62}
63
64BasicBlock* BlockInsertionSet::insertBefore(BasicBlock* before, float executionCount)
65{
66    return insert(before->index, executionCount);
67}
68
69bool BlockInsertionSet::execute()
70{
71    if (m_insertions.isEmpty())
72        return false;
73
74    // We allow insertions to be given to us in any order. So, we need to
75    // sort them before running WTF::executeInsertions.
76    std::sort(m_insertions.begin(), m_insertions.end());
77
78    executeInsertions(m_graph.m_blocks, m_insertions);
79
80    // Prune out empty entries. This isn't strictly necessary but it's
81    // healthy to keep the block list from growing.
82    unsigned targetIndex = 0;
83    for (unsigned sourceIndex = 0; sourceIndex < m_graph.m_blocks.size();) {
84        RefPtr<BasicBlock> block = m_graph.m_blocks[sourceIndex++];
85        if (!block)
86            continue;
87        m_graph.m_blocks[targetIndex++] = block;
88    }
89    m_graph.m_blocks.resize(targetIndex);
90
91    // Make sure that the blocks know their new indices.
92    for (unsigned i = 0; i < m_graph.m_blocks.size(); ++i)
93        m_graph.m_blocks[i]->index = i;
94
95    // And finally, invalidate all analyses that rely on the CFG.
96    m_graph.invalidateCFG();
97    m_graph.dethread();
98
99    return true;
100}
101
102} } // namespace JSC::DFG
103
104#endif // ENABLE(DFG_JIT)
105
106