|
|
|
@ -130,15 +130,21 @@ std::map<ir::Node *, std::unordered_set<ir::Node *>> BuildOperationAdjList(
|
|
|
|
|
if (adj_list.find(n) == adj_list.end()) {
|
|
|
|
|
adj_list[n] = std::unordered_set<ir::Node *>();
|
|
|
|
|
}
|
|
|
|
|
std::vector<ir::Node *> nodes;
|
|
|
|
|
for (auto &var : n->inputs) {
|
|
|
|
|
for (auto &adj_n : var->inputs) {
|
|
|
|
|
PADDLE_ENFORCE(adj_n->NodeType() == ir::Node::Type::kOperation);
|
|
|
|
|
VLOG(4) << "adj " << adj_n->Name() << reinterpret_cast<void *>(adj_n)
|
|
|
|
|
<< " -> " << n->Name() << reinterpret_cast<void *>(n)
|
|
|
|
|
<< " via " << var->Name() << reinterpret_cast<void *>(var);
|
|
|
|
|
adj_list[n].insert(adj_n);
|
|
|
|
|
nodes.push_back(adj_n);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
std::sort(nodes.begin(), nodes.end(), [](ir::Node *node1, ir::Node *node2) {
|
|
|
|
|
return node1->id() > node2->id();
|
|
|
|
|
});
|
|
|
|
|
adj_list[n].insert(std::make_move_iterator(nodes.begin()),
|
|
|
|
|
std::make_move_iterator(nodes.end()));
|
|
|
|
|
}
|
|
|
|
|
return adj_list;
|
|
|
|
|
}
|
|
|
|
|