Home
last modified time | relevance | path

Searched defs:cnode2 (Results 1 – 6 of 6) sorted by relevance

/third_party/mindspore/mindspore-src/source/mindspore/ccsrc/frontend/parallel/pass/
Doverlap_gradmatmul_and_gradallreduce.cc136 …x_nodes.begin(), input_matmul_dx_nodes.end(), [&](const CNodePtr &cnode1, const CNodePtr &cnode2) { in OverLapGradMatMul()
228 [&](const CNodePtr &cnode1, const CNodePtr &cnode2) { in ExtractBackwardNodes()
238 …l_list->begin(), backward_matmul_list->end(), [&](const CNodePtr &cnode1, const CNodePtr &cnode2) { in ExtractBackwardNodes()
Dlabel_micro_interleaved_index.cc201 std::sort(pipeline_end_list.begin(), pipeline_end_list.end(), [](auto cnode1, auto cnode2) { in LabelMicroInterleavedIndexPipelineStage()
Doverlap_recompute_and_grad_model_parallel.cc576 [&](const CNodePtr &cnode1, const CNodePtr &cnode2) { in OverlapRecomputeAndGradModelParallel()
/third_party/mindspore/mindspore-src/source/tests/ut/cpp/ir/
Danf_test.cc193 auto cnode2 = fg->NewCNode(inputs); in TEST_F() local
/third_party/mindspore/mindspore-src/source/mindspore/ccsrc/plugin/device/ascend/optimizer/enhancer/
Dinsert_depend_for_grad_comm.cc228 …td::sort(candidate_nodes.begin(), candidate_nodes.end(), [&node_list](auto &cnode1, auto &cnode2) { in RelyNode()
/third_party/mindspore/mindspore-src/source/mindspore/ccsrc/frontend/parallel/graph_util/
Dpipeline_split_utils.cc617 bool SliceSort(const CNodePtr &cnode1, const CNodePtr &cnode2) { in SliceSort()
633 auto cnode2 = node2->cast<CNodePtr>(); in CompFunc() local