-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathast.cpp
More file actions
138 lines (108 loc) · 3.46 KB
/
Copy pathast.cpp
File metadata and controls
138 lines (108 loc) · 3.46 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
124
125
126
127
128
129
130
131
132
133
134
135
136
137
#include "brainfxxck/ast.hpp"
namespace brainfxxck {
void Add::accept(InstructionVisitor& visitor) {
visitor.visit(*this);
}
void Add::accept(ConstInstructionVisitor& visitor) const {
visitor.visit(*this);
}
void Move::accept(InstructionVisitor& visitor) {
visitor.visit(*this);
}
void Move::accept(ConstInstructionVisitor& visitor) const {
visitor.visit(*this);
}
void Input::accept(InstructionVisitor& visitor) {
visitor.visit(*this);
}
void Input::accept(ConstInstructionVisitor& visitor) const {
visitor.visit(*this);
}
void Output::accept(InstructionVisitor& visitor) {
visitor.visit(*this);
}
void Output::accept(ConstInstructionVisitor& visitor) const {
visitor.visit(*this);
}
void Loop::accept(InstructionVisitor& visitor) {
visitor.visit(*this);
}
void Loop::accept(ConstInstructionVisitor& visitor) const {
visitor.visit(*this);
}
void Set::accept(InstructionVisitor& visitor) {
visitor.visit(*this);
}
void Set::accept(ConstInstructionVisitor& visitor) const {
visitor.visit(*this);
}
bool ASTOptimizer::isSimpleClear(const Loop& loop) {
const auto& body = loop.getBody();
if (body.size() == 1) {
if (auto* add = dynamic_cast<Add*>(body[0].get())) {
return add->getValue() == -1 || add->getValue() == 1;
}
}
return false;
}
InstructionList ASTOptimizer::optimizeLoop(Loop& loop) {
InstructionList result;
if (isSimpleClear(loop)) {
result.push_back(makeInstruction<Set>(0));
return result;
}
loop.getBody() = optimize(std::move(loop.getBody()));
result.push_back(makeInstruction<Loop>(std::move(loop.getBody())));
return result;
}
InstructionList ASTOptimizer::optimize(InstructionList instructions) {
InstructionList result;
size_t i = 0;
while (i < instructions.size()) {
auto& instr = instructions[i];
if (auto* add = dynamic_cast<Add*>(instr.get())) {
int total = add->getValue();
size_t j = i + 1;
while (j < instructions.size()) {
if (const auto* next_add = dynamic_cast<const Add*>(instructions[j].get())) {
total += next_add->getValue();
j++;
} else {
break;
}
}
if (total != 0) {
result.push_back(makeInstruction<Add>(total));
}
i = j;
}
else if (auto* move = dynamic_cast<Move*>(instr.get())) {
int total = move->getOffset();
size_t j = i + 1;
while (j < instructions.size()) {
if (const auto* next_move = dynamic_cast<const Move*>(instructions[j].get())) {
total += next_move->getOffset();
j++;
} else {
break;
}
}
if (total != 0) {
result.push_back(makeInstruction<Move>(total));
}
i = j;
}
else if (auto* loop = dynamic_cast<Loop*>(instr.get())) {
auto optimized = optimizeLoop(*loop);
result.reserve(result.size() + optimized.size());
std::move(optimized.begin(), optimized.end(), std::back_inserter(result));
i++;
}
else {
result.push_back(std::move(instr));
i++;
}
}
return result;
}
}