text
stringlengths 0
2.2M
|
|---|
addControlFlowLoadStores(graph->block());
|
}
|
std::shared_ptr<TypeEnvironment> environment_stack = nullptr;
|
};
|
// Given a graph where 1) outputs have been added to control flow nodes and
|
// 2) loads and stores are represented in the graph, erase the Loads & Stores.
|
struct EraseLoadStores {
|
void eraseBlockLoadStores(Block* block) {
|
pushFrame(block);
|
for (auto it = block->nodes().begin(); it != block->nodes().end();) {
|
auto n = *it;
|
it++;
|
switch (n->kind()) {
|
case prim::Store: {
|
environment_stack->setVar(n->s(attr::name), n->input());
|
n->destroy();
|
} break;
|
case prim::Load: {
|
auto name = n->s(attr::name);
|
auto var = environment_stack->findInAnyFrame(name);
|
TORCH_INTERNAL_ASSERT(
|
var, "Typechecking should ensure the variable name is set");
|
n->output()->replaceAllUsesWith(var);
|
n->destroy();
|
} break;
|
case prim::ComprehensionScope: {
|
// writes within a local variable scope do not leak into
|
// the rest of the graph
|
auto body = n->blocks().at(0);
|
eraseBlockLoadStores(body);
|
// inline the local variable scope into the graph
|
for (auto it_cmpr = body->nodes().begin();
|
it_cmpr != body->nodes().end();) {
|
Node* body_node = *it_cmpr;
|
it_cmpr++;
|
body_node->moveBefore(n);
|
}
|
n->destroy();
|
} break;
|
default: {
|
for (auto b : n->blocks()) {
|
eraseBlockLoadStores(b);
|
}
|
} break;
|
}
|
}
|
popFrame();
|
}
|
void pushFrame(Block* b) {
|
environment_stack =
|
std::make_shared<ValueEnvironment>(b, environment_stack);
|
}
|
std::shared_ptr<ValueEnvironment> popFrame() {
|
auto old_frame = environment_stack;
|
environment_stack = environment_stack->next;
|
return old_frame;
|
}
|
void run(std::shared_ptr<Graph>& graph) {
|
eraseBlockLoadStores(graph->block());
|
}
|
std::shared_ptr<ValueEnvironment> environment_stack = nullptr;
|
};
|
// This pass transforms Breaks & Continues to be LoopContinuations,
|
// of the form LoopContinuations(%loop_continue_condition, *loop_carried_vars)
|
// Break Statements have the condition set to false, and Continue statements
|
// inline the loop condition as the first input.
|
struct LoopContinuations {
|
public:
|
void run(std::shared_ptr<Graph>& graph) {
|
run(graph->block());
|
}
|
private:
|
void addLoopCarriedOutputs(Node* n) {
|
auto g = n->owningGraph();
|
WithInsertPoint insert(n);
|
// NOLINTNEXTLINE(clang-analyzer-core.CallAndMessage)
|
auto continuation = curr_loop_->blocks().at(0)->return_node();
|
for (auto out : continuation->inputs()) {
|
auto load_node = out->node();
|
TORCH_INTERNAL_ASSERT(load_node->kind() == prim::Load);
|
auto new_load =
|
g->insertNode(g->createClone(load_node, [](Value* v) { return v; }));
|
n->addInput(new_load->output());
|
}
|
}
|
void assignExitContinuations(Block* block) {
|
for (auto it = block->nodes().begin(); it != block->nodes().end();) {
|
Node* n = *it;
|
it++;
|
switch (n->kind()) {
|
Subsets and Splits