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
124
125
126
|
/*
* Copyright (C) 2014 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "dead_code_elimination.h"
#include "base/bit_vector-inl.h"
namespace art {
static void MarkReachableBlocks(HBasicBlock* block, ArenaBitVector* visited) {
int block_id = block->GetBlockId();
if (visited->IsBitSet(block_id)) {
return;
}
visited->SetBit(block_id);
HInstruction* last_instruction = block->GetLastInstruction();
if (last_instruction->IsIf()) {
HIf* if_instruction = last_instruction->AsIf();
HInstruction* condition = if_instruction->InputAt(0);
if (!condition->IsIntConstant()) {
MarkReachableBlocks(if_instruction->IfTrueSuccessor(), visited);
MarkReachableBlocks(if_instruction->IfFalseSuccessor(), visited);
} else if (condition->AsIntConstant()->IsOne()) {
MarkReachableBlocks(if_instruction->IfTrueSuccessor(), visited);
} else {
DCHECK(condition->AsIntConstant()->IsZero());
MarkReachableBlocks(if_instruction->IfFalseSuccessor(), visited);
}
} else {
for (size_t i = 0, e = block->GetSuccessors().Size(); i < e; ++i) {
MarkReachableBlocks(block->GetSuccessors().Get(i), visited);
}
}
}
void HDeadCodeElimination::MaybeRecordDeadBlock(HBasicBlock* block) {
if (stats_ != nullptr) {
stats_->RecordStat(MethodCompilationStat::kRemovedDeadInstruction,
block->GetPhis().CountSize() + block->GetInstructions().CountSize());
}
}
void HDeadCodeElimination::RemoveDeadBlocks() {
// Classify blocks as reachable/unreachable.
ArenaAllocator* allocator = graph_->GetArena();
ArenaBitVector live_blocks(allocator, graph_->GetBlocks().Size(), false);
MarkReachableBlocks(graph_->GetEntryBlock(), &live_blocks);
// Remove all dead blocks. Process blocks in post-order, because removal needs
// the block's chain of dominators.
for (HPostOrderIterator it(*graph_); !it.Done(); it.Advance()) {
HBasicBlock* block = it.Current();
if (live_blocks.IsBitSet(block->GetBlockId())) {
// If this block is part of a loop that is being dismantled, we need to
// update its loop information.
block->UpdateLoopInformation();
} else {
MaybeRecordDeadBlock(block);
block->DisconnectAndDelete();
}
}
// Connect successive blocks created by dead branches. Order does not matter.
for (HReversePostOrderIterator it(*graph_); !it.Done();) {
HBasicBlock* block = it.Current();
if (block->IsEntryBlock() || block->GetSuccessors().Size() != 1u) {
it.Advance();
continue;
}
HBasicBlock* successor = block->GetSuccessors().Get(0);
if (successor->IsExitBlock() || successor->GetPredecessors().Size() != 1u) {
it.Advance();
continue;
}
block->MergeWith(successor);
// Reiterate on this block in case it can be merged with its new successor.
}
}
void HDeadCodeElimination::RemoveDeadInstructions() {
// Process basic blocks in post-order in the dominator tree, so that
// a dead instruction depending on another dead instruction is removed.
for (HPostOrderIterator b(*graph_); !b.Done(); b.Advance()) {
HBasicBlock* block = b.Current();
// Traverse this block's instructions in backward order and remove
// the unused ones.
HBackwardInstructionIterator i(block->GetInstructions());
// Skip the first iteration, as the last instruction of a block is
// a branching instruction.
DCHECK(i.Current()->IsControlFlow());
for (i.Advance(); !i.Done(); i.Advance()) {
HInstruction* inst = i.Current();
DCHECK(!inst->IsControlFlow());
if (!inst->HasSideEffects()
&& !inst->CanThrow()
&& !inst->IsSuspendCheck()
&& !inst->IsMemoryBarrier() // If we added an explicit barrier then we should keep it.
&& !inst->HasUses()) {
block->RemoveInstruction(inst);
MaybeRecordStat(MethodCompilationStat::kRemovedDeadInstruction);
}
}
}
}
void HDeadCodeElimination::Run() {
RemoveDeadBlocks();
RemoveDeadInstructions();
}
} // namespace art
|