Repository navigation
Expand file tree
/
Copy pathDFGBasicBlock.cpp
More file actions
124 lines (107 loc) · 3.6 KB
/
Copy pathDFGBasicBlock.cpp
File metadata and controls
124 lines (107 loc) · 3.6 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
/*
* Copyright (C) 2013, 2014 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "config.h"
#include "DFGBasicBlock.h"
#if ENABLE(DFG_JIT)
#include "JSCInlines.h"
namespace JSC { namespace DFG {
BasicBlock::BasicBlock(
unsigned bytecodeBegin, unsigned numArguments, unsigned numLocals, float executionCount)
: bytecodeBegin(bytecodeBegin)
, index(NoBlock)
, isOSRTarget(false)
, cfaHasVisited(false)
, cfaShouldRevisit(false)
, cfaFoundConstants(false)
, cfaDidFinish(true)
, cfaBranchDirection(InvalidBranchDirection)
#if !ASSERT_DISABLED
, isLinked(false)
#endif
, isReachable(false)
, variablesAtHead(numArguments, numLocals)
, variablesAtTail(numArguments, numLocals)
, valuesAtHead(numArguments, numLocals)
, valuesAtTail(numArguments, numLocals)
, executionCount(executionCount)
{
}
BasicBlock::~BasicBlock() { }
void BasicBlock::ensureLocals(unsigned newNumLocals)
{
variablesAtHead.ensureLocals(newNumLocals);
variablesAtTail.ensureLocals(newNumLocals);
valuesAtHead.ensureLocals(newNumLocals);
valuesAtTail.ensureLocals(newNumLocals);
}
bool BasicBlock::isInPhis(Node* node) const
{
for (size_t i = 0; i < phis.size(); ++i) {
if (phis[i] == node)
return true;
}
return false;
}
bool BasicBlock::isInBlock(Node* myNode) const
{
for (size_t i = 0; i < numNodes(); ++i) {
if (node(i) == myNode)
return true;
}
return false;
}
void BasicBlock::removePredecessor(BasicBlock* block)
{
for (unsigned i = 0; i < predecessors.size(); ++i) {
if (predecessors[i] != block)
continue;
predecessors[i] = predecessors.last();
predecessors.removeLast();
return;
}
RELEASE_ASSERT_NOT_REACHED();
}
void BasicBlock::replacePredecessor(BasicBlock* from, BasicBlock* to)
{
for (unsigned i = predecessors.size(); i--;) {
if (predecessors[i] != from)
continue;
predecessors[i] = to;
return;
}
RELEASE_ASSERT_NOT_REACHED();
}
void BasicBlock::dump(PrintStream& out) const
{
out.print("#", index);
}
BasicBlock::SSAData::SSAData(BasicBlock* block)
: availabilityAtHead(OperandsLike, block->variablesAtHead)
, availabilityAtTail(OperandsLike, block->variablesAtHead)
{
}
BasicBlock::SSAData::~SSAData() { }
} } // namespace JSC::DFG
#endif // ENABLE(DFG_JIT)