blob: 9262440ae2e3efd9a8d1e74bac3cdc261254a2f2 (
plain)
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
|
/*
* 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 "post_opt_passes.h"
#include "dataflow_iterator-inl.h"
namespace art {
bool ClearPhiInstructions::Worker(PassDataHolder* data) const {
DCHECK(data != nullptr);
PassMEDataHolder* pass_me_data_holder = down_cast<PassMEDataHolder*>(data);
CompilationUnit* c_unit = pass_me_data_holder->c_unit;
DCHECK(c_unit != nullptr);
BasicBlock* bb = pass_me_data_holder->bb;
DCHECK(bb != nullptr);
MIR* mir = bb->first_mir_insn;
while (mir != nullptr) {
MIR* next = mir->next;
Instruction::Code opcode = mir->dalvikInsn.opcode;
if (opcode == static_cast<Instruction::Code> (kMirOpPhi)) {
bb->RemoveMIR(mir);
}
mir = next;
}
// We do not care in reporting a change or not in the MIR.
return false;
}
void CalculatePredecessors::Start(PassDataHolder* data) const {
DCHECK(data != nullptr);
CompilationUnit* c_unit = down_cast<PassMEDataHolder*>(data)->c_unit;
DCHECK(c_unit != nullptr);
// First get the MIRGraph here to factorize a bit the code.
MIRGraph *mir_graph = c_unit->mir_graph.get();
// First clear all predecessors.
AllNodesIterator first(mir_graph);
for (BasicBlock* bb = first.Next(); bb != nullptr; bb = first.Next()) {
bb->predecessors.clear();
}
// Now calculate all predecessors.
AllNodesIterator second(mir_graph);
for (BasicBlock* bb = second.Next(); bb != nullptr; bb = second.Next()) {
// We only care about non hidden blocks.
if (bb->hidden == true) {
continue;
}
// Create iterator for visiting children.
ChildBlockIterator child_iter(bb, mir_graph);
// Now iterate through the children to set the predecessor bits.
for (BasicBlock* child = child_iter.Next(); child != nullptr; child = child_iter.Next()) {
child->predecessors.push_back(bb->id);
}
}
}
} // namespace art
|
