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#include "config.h"
27#include "B3BlockInsertionSet.h"
28
29#if ENABLE(B3_JIT)
30
31#include "B3BasicBlockInlines.h"
32#include "B3InsertionSet.h"
33#include "B3ProcedureInlines.h"
34#include <wtf/BubbleSort.h>
35
36namespace JSC { namespace B3 {
37
38BlockInsertionSet::BlockInsertionSet(Procedure &proc)
39 : GenericBlockInsertionSet(proc.m_blocks)
40 , m_proc(proc)
41{
42}
43
44BlockInsertionSet::~BlockInsertionSet() { }
45
46BasicBlock* BlockInsertionSet::splitForward(
47 BasicBlock* block, unsigned& valueIndex, InsertionSet* insertionSet, double frequency)
48{
49 Value* value = block->at(valueIndex);
50
51 // Create a new block that will go just before 'block', and make it contain everything prior
52 // to 'valueIndex'.
53 BasicBlock* result = insertBefore(block, frequency);
54 result->m_values.resize(valueIndex + 1);
55 for (unsigned i = valueIndex; i--;)
56 result->m_values[i] = block->m_values[i];
57
58 // Make the new block jump to 'block'.
59 result->m_values[valueIndex] = m_proc.add<Value>(Jump, value->origin());
60 result->setSuccessors(FrequentedBlock(block));
61
62 // If we had inserted things into 'block' before this, execute those insertions now.
63 if (insertionSet)
64 insertionSet->execute(result);
65
66 // Remove everything prior to 'valueIndex' from 'block', since those things are now in the
67 // new block.
68 block->m_values.remove(0, valueIndex);
69
70 // This is being used in a forward loop over 'block'. Update the index of the loop so that
71 // it can continue to the next block.
72 valueIndex = 0;
73
74 // Fixup the predecessors of 'block'. They now must jump to the new block.
75 result->predecessors() = WTFMove(block->predecessors());
76 block->addPredecessor(result);
77 for (BasicBlock* predecessor : result->predecessors())
78 predecessor->replaceSuccessor(block, result);
79
80 return result;
81}
82
83} } // namespace JSC::B3
84
85#endif // ENABLE(B3_JIT)
86
87