| 1372 | } |
| 1373 | |
| 1374 | Maybe<void> RankTaskGraph::ConnectDataEdges(const OpEdge* op_edge, int64_t rank) { |
| 1375 | if (!op_edge->NeedBoxing()) { |
| 1376 | auto* src_task_node = JUST(TryGetRankCompTaskNode(op_edge->src_node(), rank)); |
| 1377 | auto* dst_task_node = JUST(TryGetRankCompTaskNode(op_edge->dst_node(), rank)); |
| 1378 | if (ContainRank(op_edge->src_node(), rank)) { |
| 1379 | CHECK_NOTNULL_OR_RETURN(src_task_node) << "src_task_node should not be nullptr. op_name: " |
| 1380 | << op_edge->src_node()->op().op_name(); |
| 1381 | } |
| 1382 | if (ContainRank(op_edge->dst_node(), rank)) { |
| 1383 | CHECK_NOTNULL_OR_RETURN(dst_task_node) << "dst_task_node should not be nullptr. op_name: " |
| 1384 | << op_edge->dst_node()->op().op_name(); |
| 1385 | } |
| 1386 | if (src_task_node != nullptr && dst_task_node != nullptr) { |
| 1387 | for (const auto& lbi : op_edge->lbis()) { ConnectWithLbi(src_task_node, dst_task_node, lbi); } |
| 1388 | } |
| 1389 | } |
| 1390 | return Maybe<void>::Ok(); |
| 1391 | } |
| 1392 | |
| 1393 | Maybe<void> RankTaskGraph::ConnectCtrlEdges(const OpNode* src, const OpNode* dst, int64_t rank) { |
| 1394 | if ((ContainRank(src, rank) && ContainRank(dst, rank))) { |
nothing calls this directly
no test coverage detected