/
lower_ast.cpp
430 lines (385 loc) · 14.6 KB
/
lower_ast.cpp
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
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
#include "taichi/ir/ir.h"
#include "taichi/ir/transforms.h"
#include "taichi/ir/analysis.h"
#include "taichi/ir/visitors.h"
#include "taichi/ir/frontend_ir.h"
#include <unordered_set>
TLANG_NAMESPACE_BEGIN
namespace {
using FlattenContext = Expression::FlattenContext;
template <typename T>
std::vector<T *> make_raw_pointer_list(
const std::vector<std::unique_ptr<T>> &unique_pointers) {
std::vector<T *> raw_pointers;
for (auto &ptr : unique_pointers)
raw_pointers.push_back(ptr.get());
return raw_pointers;
}
} // namespace
// Lower Expr tree to a bunch of binary/unary(binary/unary) statements
// Goal: eliminate Expression, Identifiers, and mutable local variables. Make
// AST SSA.
class LowerAST : public IRVisitor {
private:
Stmt *capturing_loop;
std::unordered_set<Stmt *> detected_fors_with_break;
Block *current_block;
FlattenContext make_flatten_ctx() {
FlattenContext fctx;
fctx.current_block = this->current_block;
return fctx;
}
public:
explicit LowerAST(const std::unordered_set<Stmt *> &_detected_fors_with_break)
: detected_fors_with_break(_detected_fors_with_break),
current_block(nullptr) {
// TODO: change this to false
allow_undefined_visitor = true;
capturing_loop = nullptr;
}
Expr load_if_ptr(Expr expr) {
if (expr.is<GlobalPtrStmt>()) {
return load(expr);
} else
return expr;
}
void visit(Block *stmt_list) override {
auto backup_block = this->current_block;
this->current_block = stmt_list;
auto stmts = make_raw_pointer_list(stmt_list->statements);
for (auto &stmt : stmts) {
stmt->accept(this);
}
this->current_block = backup_block;
}
void visit(FrontendAllocaStmt *stmt) override {
auto block = stmt->parent;
auto ident = stmt->ident;
TI_ASSERT(block->local_var_to_stmt.find(ident) ==
block->local_var_to_stmt.end());
auto lowered = std::make_unique<AllocaStmt>(stmt->ret_type.data_type);
block->local_var_to_stmt.insert(std::make_pair(ident, lowered.get()));
stmt->parent->replace_with(stmt, std::move(lowered));
throw IRModified();
}
void visit(FrontendIfStmt *stmt) override {
auto fctx = make_flatten_ctx();
stmt->condition->flatten(&fctx);
auto new_if = std::make_unique<IfStmt>(stmt->condition->stmt);
new_if->true_mask = fctx.push_back<AllocaStmt>(DataType::i32);
new_if->false_mask = fctx.push_back<AllocaStmt>(DataType::i32);
fctx.push_back<LocalStoreStmt>(new_if->true_mask, stmt->condition->stmt);
auto lnot_stmt_ptr = fctx.push_back<UnaryOpStmt>(UnaryOpType::logic_not,
stmt->condition->stmt);
fctx.push_back<LocalStoreStmt>(new_if->false_mask, lnot_stmt_ptr);
if (stmt->true_statements) {
new_if->true_statements = std::move(stmt->true_statements);
new_if->true_statements->mask_var = new_if->true_mask;
}
if (stmt->false_statements) {
new_if->false_statements = std::move(stmt->false_statements);
new_if->false_statements->mask_var = new_if->false_mask;
}
fctx.push_back(std::move(new_if));
stmt->parent->replace_with(stmt, std::move(fctx.stmts));
throw IRModified();
}
void visit(IfStmt *if_stmt) override {
if (if_stmt->true_statements)
if_stmt->true_statements->accept(this);
if (if_stmt->false_statements) {
if_stmt->false_statements->accept(this);
}
}
void visit(FrontendPrintStmt *stmt) override {
// expand rhs
std::vector<Stmt *> stmts;
std::vector<std::variant<Stmt *, std::string>> new_contents;
auto fctx = make_flatten_ctx();
for (auto c : stmt->contents) {
if (std::holds_alternative<Expr>(c)) {
auto x = std::get<Expr>(c);
x->flatten(&fctx);
stmts.push_back(x->stmt);
new_contents.push_back(x->stmt);
} else {
auto x = std::get<std::string>(c);
new_contents.push_back(x);
}
}
fctx.push_back<PrintStmt>(new_contents);
stmt->parent->replace_with(stmt, std::move(fctx.stmts));
throw IRModified();
}
void visit(FrontendBreakStmt *stmt) override {
auto while_stmt = capturing_loop->as<WhileStmt>();
VecStatement stmts;
auto const_true = stmts.push_back<ConstStmt>(TypedConstant((int32)0));
stmts.push_back<WhileControlStmt>(while_stmt->mask, const_true);
stmt->parent->replace_with(stmt, std::move(stmts));
throw IRModified();
}
void visit(FrontendContinueStmt *stmt) override {
stmt->parent->replace_with(stmt, Stmt::make<ContinueStmt>());
}
void visit(FrontendWhileStmt *stmt) override {
// transform into a structure as
// while (1) { cond; if (no active) break; original body...}
auto cond = stmt->cond;
auto fctx = make_flatten_ctx();
cond->flatten(&fctx);
auto cond_stmt = fctx.back_stmt();
auto &&new_while = std::make_unique<WhileStmt>(std::move(stmt->body));
auto mask = std::make_unique<AllocaStmt>(DataType::i32);
new_while->mask = mask.get();
auto &stmts = new_while->body;
stmts->insert(std::move(fctx.stmts), /*location=*/0);
// insert break
stmts->insert(
std::make_unique<WhileControlStmt>(new_while->mask, cond_stmt),
fctx.stmts.size());
stmt->insert_before_me(std::make_unique<AllocaStmt>(DataType::i32));
auto &&const_stmt =
std::make_unique<ConstStmt>(TypedConstant((int32)0xFFFFFFFF));
auto const_stmt_ptr = const_stmt.get();
stmt->insert_before_me(std::move(mask));
stmt->insert_before_me(std::move(const_stmt));
stmt->insert_before_me(
std::make_unique<LocalStoreStmt>(new_while->mask, const_stmt_ptr));
new_while->body->mask_var = new_while->mask;
stmt->parent->replace_with(stmt, std::move(new_while));
// insert an alloca for the mask
throw IRModified();
}
void visit(WhileStmt *stmt) override {
auto old_capturing_loop = capturing_loop;
capturing_loop = stmt;
stmt->body->accept(this);
capturing_loop = old_capturing_loop;
}
void visit(LoopIndexStmt *stmt) override {
// do nothing
}
void visit(BinaryOpStmt *stmt) override {
// do nothing
}
void visit(FrontendForStmt *stmt) override {
auto fctx = make_flatten_ctx();
if (stmt->is_ranged()) {
TI_ASSERT(stmt->loop_var_id.size() == 1);
auto begin = stmt->begin;
auto end = stmt->end;
begin->flatten(&fctx);
end->flatten(&fctx);
bool is_good_range_for =
capturing_loop == nullptr ||
detected_fors_with_break.find(stmt) == detected_fors_with_break.end();
// #578: a good range for is a range for that doesn't contains a break
// statement
if (is_good_range_for) {
auto &&new_for = std::make_unique<RangeForStmt>(
begin->stmt, end->stmt, std::move(stmt->body), stmt->vectorize,
stmt->parallelize, stmt->block_dim, stmt->strictly_serialized);
new_for->body->insert(std::make_unique<LoopIndexStmt>(new_for.get(), 0),
0);
new_for->body->local_var_to_stmt[stmt->loop_var_id[0]] =
new_for->body->statements[0].get();
fctx.push_back(std::move(new_for));
} else {
// transform into a structure as
// i = begin; while (1) { if (i >= end) break; original body; i += 1; }
fctx.push_back<AllocaStmt>(DataType::i32);
auto loop_var = fctx.back_stmt();
stmt->parent->local_var_to_stmt[stmt->loop_var_id[0]] = loop_var;
fctx.push_back<LocalStoreStmt>(loop_var, begin->stmt);
auto loop_var_addr = LaneAttribute<LocalAddress>(
LocalAddress(loop_var->as<AllocaStmt>(), 0));
VecStatement load_and_compare;
auto loop_var_load_stmt =
load_and_compare.push_back<LocalLoadStmt>(loop_var_addr);
auto cond_stmt = load_and_compare.push_back<BinaryOpStmt>(
BinaryOpType::cmp_lt, loop_var_load_stmt, end->stmt);
auto &&new_while = std::make_unique<WhileStmt>(std::move(stmt->body));
auto mask = std::make_unique<AllocaStmt>(DataType::i32);
new_while->mask = mask.get();
auto &stmts = new_while->body;
for (int i = 0; i < (int)load_and_compare.size(); i++) {
stmts->insert(std::move(load_and_compare[i]), i);
}
VecStatement increase_and_store;
auto const_one =
increase_and_store.push_back<ConstStmt>(TypedConstant((int32)1));
auto loop_var_add_one = increase_and_store.push_back<BinaryOpStmt>(
BinaryOpType::add, loop_var_load_stmt, const_one);
increase_and_store.push_back<LocalStoreStmt>(loop_var,
loop_var_add_one);
for (int i = 0; i < (int)increase_and_store.size(); i++) {
stmts->insert(std::move(increase_and_store[i]), stmts->size());
}
// insert break
stmts->insert(
std::make_unique<WhileControlStmt>(new_while->mask, cond_stmt),
load_and_compare.size());
stmt->insert_before_me(std::make_unique<AllocaStmt>(DataType::i32));
auto &&const_stmt =
std::make_unique<ConstStmt>(TypedConstant((int32)0xFFFFFFFF));
auto const_stmt_ptr = const_stmt.get();
stmt->insert_before_me(std::move(mask));
stmt->insert_before_me(std::move(const_stmt));
stmt->insert_before_me(
std::make_unique<LocalStoreStmt>(new_while->mask, const_stmt_ptr));
new_while->body->mask_var = new_while->mask;
fctx.push_back(std::move(new_while));
}
} else {
auto snode = stmt->global_var.cast<GlobalVariableExpression>()->snode;
std::vector<int> offsets;
if (snode->type == SNodeType::place) {
/* Note:
* for i in x:
* x[i] = 0
*
* has the same effect as
*
* for i in x.parent():
* x[i] = 0
*
* (unless x has index offsets)*/
offsets = snode->index_offsets;
snode = snode->parent;
}
auto &&new_for = std::make_unique<StructForStmt>(
snode, std::move(stmt->body), stmt->vectorize, stmt->parallelize,
stmt->block_dim);
VecStatement new_statements;
for (int i = 0; i < (int)stmt->loop_var_id.size(); i++) {
Stmt *loop_index = new_statements.push_back<LoopIndexStmt>(
new_for.get(), snode->physical_index_position[i]);
if ((int)offsets.size() > i && offsets[i] != 0) {
auto offset_const =
new_statements.push_back<ConstStmt>(TypedConstant(offsets[i]));
auto result = new_statements.push_back<BinaryOpStmt>(
BinaryOpType::add, loop_index, offset_const);
loop_index = result;
}
new_for->body->local_var_to_stmt[stmt->loop_var_id[i]] = loop_index;
}
new_for->body->insert(std::move(new_statements), 0);
new_for->scratch_opt = stmt->scratch_opt;
fctx.push_back(std::move(new_for));
}
stmt->parent->replace_with(stmt, std::move(fctx.stmts));
throw IRModified();
}
void visit(RangeForStmt *for_stmt) override {
auto old_capturing_loop = capturing_loop;
capturing_loop = for_stmt;
for_stmt->body->accept(this);
capturing_loop = old_capturing_loop;
}
void visit(StructForStmt *for_stmt) override {
auto old_capturing_loop = capturing_loop;
capturing_loop = for_stmt;
for_stmt->body->accept(this);
capturing_loop = old_capturing_loop;
}
void visit(FrontendKernelReturnStmt *stmt) override {
auto expr = stmt->value;
auto fctx = make_flatten_ctx();
expr->flatten(&fctx);
fctx.push_back<KernelReturnStmt>(fctx.back_stmt());
stmt->parent->replace_with(stmt, std::move(fctx.stmts));
throw IRModified();
}
void visit(FrontendEvalStmt *stmt) override {
// expand rhs
auto expr = stmt->expr;
auto fctx = make_flatten_ctx();
expr->flatten(&fctx);
stmt->eval_expr.cast<EvalExpression>()->stmt_ptr = stmt->expr->stmt;
stmt->parent->replace_with(stmt, std::move(fctx.stmts));
throw IRModified();
}
void visit(FrontendAssignStmt *assign) override {
// expand rhs
auto expr = assign->rhs;
auto fctx = make_flatten_ctx();
expr->flatten(&fctx);
if (assign->lhs.is<IdExpression>()) { // local variable
// emit local store stmt
fctx.push_back<LocalStoreStmt>(
assign->parent->lookup_var(assign->lhs.cast<IdExpression>()->id),
expr->stmt);
} else { // global variable
TI_ASSERT(assign->lhs.is<GlobalPtrExpression>());
auto global_ptr = assign->lhs.cast<GlobalPtrExpression>();
global_ptr->flatten(&fctx);
fctx.push_back<GlobalStoreStmt>(fctx.back_stmt(), expr->stmt);
}
fctx.stmts.back()->set_tb(assign->tb);
assign->parent->replace_with(assign, std::move(fctx.stmts));
throw IRModified();
}
void visit(FrontendSNodeOpStmt *stmt) override {
// expand rhs
Stmt *val_stmt = nullptr;
auto fctx = make_flatten_ctx();
if (stmt->val.expr) {
auto expr = stmt->val;
expr->flatten(&fctx);
val_stmt = expr->stmt;
}
std::vector<Stmt *> indices_stmt(stmt->indices.size(), nullptr);
for (int i = 0; i < (int)stmt->indices.size(); i++) {
stmt->indices[i]->flatten(&fctx);
indices_stmt[i] = stmt->indices[i]->stmt;
}
if (stmt->snode->type == SNodeType::dynamic) {
auto ptr = fctx.push_back<GlobalPtrStmt>(stmt->snode, indices_stmt);
fctx.push_back<SNodeOpStmt>(stmt->op_type, stmt->snode, ptr, val_stmt);
} else if (stmt->snode->type == SNodeType::pointer ||
stmt->snode->type == SNodeType::hash ||
stmt->snode->type == SNodeType::dynamic ||
stmt->snode->type == SNodeType::bitmasked) {
TI_ASSERT(SNodeOpStmt::activation_related(stmt->op_type));
fctx.push_back<SNodeOpStmt>(stmt->op_type, stmt->snode, indices_stmt);
} else {
TI_NOT_IMPLEMENTED
}
stmt->parent->replace_with(stmt, std::move(fctx.stmts));
throw IRModified();
}
void visit(FrontendAssertStmt *stmt) override {
// expand rhs
Stmt *val_stmt = nullptr;
auto fctx = make_flatten_ctx();
if (stmt->val.expr) {
auto expr = stmt->val;
expr->flatten(&fctx);
val_stmt = expr->stmt;
}
fctx.push_back<AssertStmt>(stmt->text, val_stmt);
stmt->parent->replace_with(stmt, std::move(fctx.stmts));
throw IRModified();
}
static void run(IRNode *node) {
LowerAST inst(irpass::analysis::detect_fors_with_break(node));
while (true) {
bool modified = false;
try {
node->accept(&inst);
} catch (IRModified) {
modified = true;
}
if (!modified)
break;
}
}
};
namespace irpass {
void lower(IRNode *root) {
TI_AUTO_PROF;
LowerAST::run(root);
}
} // namespace irpass
TLANG_NAMESPACE_END