| 1 | /* |
| 2 | * Copyright (C) 2013-2015 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 "DFGBasicBlock.h" |
| 28 | |
| 29 | #if ENABLE(DFG_JIT) |
| 30 | |
| 31 | #include "JSCInlines.h" |
| 32 | |
| 33 | namespace JSC { namespace DFG { |
| 34 | |
| 35 | BasicBlock::BasicBlock( |
| 36 | unsigned bytecodeBegin, unsigned numArguments, unsigned numLocals, float executionCount) |
| 37 | : bytecodeBegin(bytecodeBegin) |
| 38 | , index(NoBlock) |
| 39 | , cfaStructureClobberStateAtHead(StructuresAreWatched) |
| 40 | , cfaStructureClobberStateAtTail(StructuresAreWatched) |
| 41 | , cfaBranchDirection(InvalidBranchDirection) |
| 42 | , cfaHasVisited(false) |
| 43 | , cfaShouldRevisit(false) |
| 44 | , cfaFoundConstants(false) |
| 45 | , cfaDidFinish(true) |
| 46 | , intersectionOfCFAHasVisited(true) |
| 47 | , isOSRTarget(false) |
| 48 | , isCatchEntrypoint(false) |
| 49 | #if !ASSERT_DISABLED |
| 50 | , isLinked(false) |
| 51 | #endif |
| 52 | , isReachable(false) |
| 53 | , variablesAtHead(numArguments, numLocals) |
| 54 | , variablesAtTail(numArguments, numLocals) |
| 55 | , valuesAtHead(numArguments, numLocals) |
| 56 | , valuesAtTail(numArguments, numLocals) |
| 57 | , intersectionOfPastValuesAtHead(numArguments, numLocals, AbstractValue::fullTop()) |
| 58 | , executionCount(executionCount) |
| 59 | { |
| 60 | } |
| 61 | |
| 62 | BasicBlock::~BasicBlock() |
| 63 | { |
| 64 | } |
| 65 | |
| 66 | void BasicBlock::ensureLocals(unsigned newNumLocals) |
| 67 | { |
| 68 | variablesAtHead.ensureLocals(newNumLocals); |
| 69 | variablesAtTail.ensureLocals(newNumLocals); |
| 70 | valuesAtHead.ensureLocals(newNumLocals); |
| 71 | valuesAtTail.ensureLocals(newNumLocals); |
| 72 | intersectionOfPastValuesAtHead.ensureLocals(newNumLocals, AbstractValue::fullTop()); |
| 73 | } |
| 74 | |
| 75 | void BasicBlock::replaceTerminal(Graph& graph, Node* node) |
| 76 | { |
| 77 | NodeAndIndex result = findTerminal(); |
| 78 | if (!result) |
| 79 | append(node); |
| 80 | else { |
| 81 | m_nodes.insert(result.index + 1, node); |
| 82 | result.node->remove(graph); |
| 83 | } |
| 84 | |
| 85 | ASSERT(terminal()); |
| 86 | } |
| 87 | |
| 88 | bool BasicBlock::isInPhis(Node* node) const |
| 89 | { |
| 90 | for (size_t i = 0; i < phis.size(); ++i) { |
| 91 | if (phis[i] == node) |
| 92 | return true; |
| 93 | } |
| 94 | return false; |
| 95 | } |
| 96 | |
| 97 | bool BasicBlock::isInBlock(Node* myNode) const |
| 98 | { |
| 99 | for (size_t i = 0; i < numNodes(); ++i) { |
| 100 | if (node(i) == myNode) |
| 101 | return true; |
| 102 | } |
| 103 | return false; |
| 104 | } |
| 105 | |
| 106 | void BasicBlock::removePredecessor(BasicBlock* block) |
| 107 | { |
| 108 | for (unsigned i = 0; i < predecessors.size(); ++i) { |
| 109 | if (predecessors[i] != block) |
| 110 | continue; |
| 111 | predecessors[i] = predecessors.last(); |
| 112 | predecessors.removeLast(); |
| 113 | return; |
| 114 | } |
| 115 | RELEASE_ASSERT_NOT_REACHED(); |
| 116 | } |
| 117 | |
| 118 | void BasicBlock::replacePredecessor(BasicBlock* from, BasicBlock* to) |
| 119 | { |
| 120 | for (unsigned i = predecessors.size(); i--;) { |
| 121 | if (predecessors[i] != from) |
| 122 | continue; |
| 123 | predecessors[i] = to; |
| 124 | return; |
| 125 | } |
| 126 | RELEASE_ASSERT_NOT_REACHED(); |
| 127 | } |
| 128 | |
| 129 | void BasicBlock::dump(PrintStream& out) const |
| 130 | { |
| 131 | out.print("#" , index); |
| 132 | } |
| 133 | |
| 134 | BasicBlock::SSAData::SSAData(BasicBlock* block) |
| 135 | { |
| 136 | availabilityAtHead.m_locals = Operands<Availability>(OperandsLike, block->variablesAtHead); |
| 137 | availabilityAtTail.m_locals = Operands<Availability>(OperandsLike, block->variablesAtHead); |
| 138 | } |
| 139 | |
| 140 | BasicBlock::SSAData::~SSAData() { } |
| 141 | |
| 142 | } } // namespace JSC::DFG |
| 143 | |
| 144 | #endif // ENABLE(DFG_JIT) |
| 145 | |
| 146 | |