未验证 提交 3f12dd8f 编写于 作者: J Juncheng 提交者: GitHub

Remove useless logical2sorted_in/out_box (#4152)

上级 92fe76f8
......@@ -93,8 +93,6 @@ class LogicalNode : public Node<LogicalNode, LogicalEdge> {
(const LogicalNode* src_logical, const LogicalNode* dst_logical, \
const std::vector<CompTaskNode*>& sorted_src_comp_tasks, \
const std::vector<CompTaskNode*>& sorted_dst_comp_tasks, \
HashMap<const LogicalNode*, std::vector<TaskNode*>>* logical2sorted_in_box, \
HashMap<const LogicalNode*, std::vector<TaskNode*>>* logical2sorted_out_box, \
std::function<TaskNode**(CompTaskNode * src, int64_t machine_id, int32_t mem_zone_id)> \
MutBufTask, \
std::function<int64_t(const TaskNode*)> AllocateCpuThrdIdEvenly)
......
......@@ -228,8 +228,6 @@ TaskGraph::TaskGraph(std::unique_ptr<const LogicalGraph>&& logical_gph) {
builders.emplace_back(new NaiveB2PSubTskGphBuilder());
sub_tsk_gph_builder_.reset(new ChainSubTskGphBuilder(builders));
HashMap<const LogicalNode*, std::vector<CompTaskNode*>> logical2sorted_comp_tasks;
HashMap<const LogicalNode*, std::vector<TaskNode*>> logical2sorted_in_box;
HashMap<const LogicalNode*, std::vector<TaskNode*>> logical2sorted_out_box;
HashMap<CompTaskNode*, HashMap<int64_t, std::vector<TaskNode*>>> buf_task;
auto MutBufTask = [&](CompTaskNode* task_node, int64_t machine_id, int32_t mem_zone_id) {
auto& buf_vec = buf_task[task_node][machine_id];
......@@ -265,8 +263,8 @@ TaskGraph::TaskGraph(std::unique_ptr<const LogicalGraph>&& logical_gph) {
GetMthdForBldSubTskGph(logical_edge->src_node(), logical_edge->dst_node());
(this->*method)(logical_edge->src_node(), logical_edge->dst_node(),
logical2sorted_comp_tasks.at(logical_edge->src_node()),
logical2sorted_comp_tasks.at(logical_edge->dst_node()), &logical2sorted_in_box,
&logical2sorted_out_box, MutBufTask, AllocateCpuThrdIdEvenly);
logical2sorted_comp_tasks.at(logical_edge->dst_node()), MutBufTask,
AllocateCpuThrdIdEvenly);
SetAreaIdForNewNodes(logical_edge->src_node(), logical_edge->dst_node());
});
logical_gph_->ForEachNecessaryCtrlEdge(
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册