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
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
|
/*
* 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.
*/
#ifndef ART_COMPILER_OPTIMIZING_PRETTY_PRINTER_H_
#define ART_COMPILER_OPTIMIZING_PRETTY_PRINTER_H_
#include "base/stringprintf.h"
#include "nodes.h"
namespace art {
class HPrettyPrinter : public HGraphVisitor {
public:
explicit HPrettyPrinter(HGraph* graph) : HGraphVisitor(graph) { }
void PrintPreInstruction(HInstruction* instruction) {
PrintString(" ");
PrintInt(instruction->GetId());
PrintString(": ");
}
virtual void VisitInstruction(HInstruction* instruction) {
PrintPreInstruction(instruction);
PrintString(instruction->DebugName());
PrintPostInstruction(instruction);
}
void PrintPostInstruction(HInstruction* instruction) {
if (instruction->InputCount() != 0) {
PrintString("(");
bool first = true;
for (HInputIterator it(instruction); !it.Done(); it.Advance()) {
if (first) {
first = false;
} else {
PrintString(", ");
}
PrintInt(it.Current()->GetId());
}
PrintString(")");
}
if (instruction->HasUses()) {
PrintString(" [");
bool first = true;
for (HUseIterator<HInstruction> it(instruction->GetUses()); !it.Done(); it.Advance()) {
if (first) {
first = false;
} else {
PrintString(", ");
}
PrintInt(it.Current()->GetUser()->GetId());
}
PrintString("]");
}
PrintNewLine();
}
virtual void VisitBasicBlock(HBasicBlock* block) {
PrintString("BasicBlock ");
PrintInt(block->GetBlockId());
const GrowableArray<HBasicBlock*>& predecessors = block->GetPredecessors();
if (!predecessors.IsEmpty()) {
PrintString(", pred: ");
for (size_t i = 0; i < predecessors.Size() -1; i++) {
PrintInt(predecessors.Get(i)->GetBlockId());
PrintString(", ");
}
PrintInt(predecessors.Peek()->GetBlockId());
}
const GrowableArray<HBasicBlock*>& successors = block->GetSuccessors();
if (!successors.IsEmpty()) {
PrintString(", succ: ");
for (size_t i = 0; i < successors.Size() - 1; i++) {
PrintInt(successors.Get(i)->GetBlockId());
PrintString(", ");
}
PrintInt(successors.Peek()->GetBlockId());
}
PrintNewLine();
HGraphVisitor::VisitBasicBlock(block);
}
virtual void PrintNewLine() = 0;
virtual void PrintInt(int value) = 0;
virtual void PrintString(const char* value) = 0;
private:
DISALLOW_COPY_AND_ASSIGN(HPrettyPrinter);
};
class StringPrettyPrinter : public HPrettyPrinter {
public:
explicit StringPrettyPrinter(HGraph* graph)
: HPrettyPrinter(graph), str_(""), current_block_(nullptr) { }
virtual void PrintInt(int value) {
str_ += StringPrintf("%d", value);
}
virtual void PrintString(const char* value) {
str_ += value;
}
virtual void PrintNewLine() {
str_ += '\n';
}
void Clear() { str_.clear(); }
std::string str() const { return str_; }
virtual void VisitBasicBlock(HBasicBlock* block) {
current_block_ = block;
HPrettyPrinter::VisitBasicBlock(block);
}
virtual void VisitGoto(HGoto* gota) {
PrintString(" ");
PrintInt(gota->GetId());
PrintString(": Goto ");
PrintInt(current_block_->GetSuccessors().Get(0)->GetBlockId());
PrintNewLine();
}
private:
std::string str_;
HBasicBlock* current_block_;
DISALLOW_COPY_AND_ASSIGN(StringPrettyPrinter);
};
} // namespace art
#endif // ART_COMPILER_OPTIMIZING_PRETTY_PRINTER_H_
|
