Home
last modified time | relevance | path

Searched defs:mng (Results 1 – 25 of 46) sorted by relevance

12

/third_party/mindspore/mindspore/ccsrc/backend/optimizer/graph_kernel/
Doptimize_assign.cc77 auto mng = AnfAlgo::GetCNodeFuncGraphPtr(gk_node)->manager(); in HasPathToParamUser() local
95 const FuncGraphManagerPtr &mng) { in KeepExecOrder()
121 auto mng = func_graph->manager(); in UpdateUsersOfGraphKernel() local
162 auto mng = func_graph->manager(); in ReplaceAssignByInplaceAssignInGraphkernel() local
190 auto mng = func_graph->manager(); in RepalceAssignByInplaceAssign() local
206 auto mng = func_graph->manager(); in Run() local
Dupdate_state_formatter.cc83 auto mng = func_graph->manager(); in Run() local
108 auto mng = func_graph->manager(); in Run() local
135 auto mng = func_graph->manager(); in Run() local
157 void ExtendOutputForUpdateState::FindIndexesToUpdateState(const FuncGraphManagerPtr &mng) { in FindIndexesToUpdateState()
244 auto mng = func_graph->manager(); in ProcessIndex() local
283 auto mng = func_graph->manager(); in Run() local
Draise_reduction_precision.cc62 auto mng = reduce_node->func_graph()->manager(); in ReplaceNode() local
83 auto mng = func_graph->manager(); in Process() local
107 auto mng = func_graph->manager(); in Run() local
Deliminate_redundant_output.cc56 bool GetGraphKernelGetitemList(const FuncGraphManagerPtr &mng, const AnfNodePtr &node, AnfNodePtrLi… in GetGraphKernelGetitemList()
126 auto mng = func_graph->manager(); in Run() local
188 auto mng = func_graph->manager(); in Run() local
201 auto mng = func_graph->manager(); in Run() local
269 auto mng = func_graph->manager(); in Run() local
Drewrite_output_shape.cc42 auto mng = func_graph->manager(); in Run() local
102 auto mng = func_graph->manager(); in Run() local
Dshape_ops_splitter.cc53 void SplitNode(const AnfNodePtr &node, const FuncGraphManagerPtr &mng) { in SplitNode()
88 auto mng = func_graph->manager(); in Process() local
111 auto mng = func_graph->manager(); in Run() local
Ddecrease_compute_precision.cc82 auto mng = func_graph->manager(); in InsertCastForGraphKernel() local
129 auto mng = func_graph->manager(); in Process() local
217 auto mng = func_graph->manager(); in IsCastUnAware() local
245 auto mng = func_graph->manager(); in Run() local
Dcast_matmul_fusion.cc50 auto mng = func_graph->manager(); in DoFuse() local
96 auto mng = func_graph->manager(); in Run() local
Dtsa_atomic_add_to_first_tensor.cc90 auto mng = main_graph->manager(); in ProcessTsaFirstNode() local
208 const FuncGraphManagerPtr &mng) { in ProcessTsa()
231 auto mng = kernel_graph->manager(); in Run() local
Dvalue_graph_binder.cc32 auto mng = func_graph->manager(); in Run() local
Duss_atomic_add.cc51 auto mng = kernel_graph->manager(); in Run() local
Ddecrease_transfer_precision.cc89 auto mng = func_graph->manager(); in Run() local
149 auto mng = gk_graph->manager(); in Process_Father() local
239 auto mng = gk_graph->manager(); in Process_Son() local
Dreorder_ops.cc203 …Ops::ReorderTypeInsensitiveCastDown(const FuncGraphPtr &func_graph, const FuncGraphManagerPtr &mng, in ReorderTypeInsensitiveCastDown()
259 …erOps::ReorderCastUpTypeInsensitive(const FuncGraphPtr &func_graph, const FuncGraphManagerPtr &mng, in ReorderCastUpTypeInsensitive()
329 auto mng = GetFuncGraphManager(func_graph); in ReorderCastTypeInsensitive() local
Dadd_atomic_clean.cc448const FuncGraphManagerPtr &mng, in FindOriginCNodeUsers()
505 … const AnfNodePtr &update_state_node, const FuncGraphManagerPtr &mng) { in ProcessOriginCNodeUser()
529 const FuncGraphManagerPtr &mng) { in InsertAtomicClean()
552 const FuncGraphManagerPtr &mng) { in IsExistStructuralObstacle()
571 auto mng = kernel_graph->manager(); in Run() local
Dinsert_pad.cc149 …tPad(const CNodePtr &matmul, const FuncGraphPtr &func_graph, const FuncGraphManagerPtr &mng, bool … in InsertPad()
185 …InsertUnpad(const CNodePtr &matmul, const FuncGraphPtr &func_graph, const FuncGraphManagerPtr &mng, in InsertUnpad()
234 auto mng = func_graph->manager(); in InsertPadUnpad() local
274 auto mng = func_graph->manager(); in Run() local
/third_party/mindspore/mindspore/ccsrc/frontend/optimizer/
Drecompute.cc81 std::vector<CNodePtr> FindCandidateRecomputedNodes(const FuncGraphManagerPtr &mng, in FindCandidateRecomputedNodes()
111 void GetMaxSubGraph(const FuncGraphManagerPtr &mng, std::unordered_set<CNodePtr> *recomputed_nodes,… in GetMaxSubGraph()
162 void GetOriginRecomputeAndTargetNodes(const FuncGraphManagerPtr &mng, in GetOriginRecomputeAndTargetNodes()
241 bool HasForwardOutput(const FuncGraphManagerPtr &mng, const AnfNodePtr &node) { in HasForwardOutput()
253 void GetTupleGetItemOutputNodes(const FuncGraphManagerPtr &mng, const AnfNodePtr &node, in GetTupleGetItemOutputNodes()
278 auto mng = graph->manager(); in SetRecomputedAttr() local
412 auto mng = graph->manager(); in DuplicateRecomputedNodes() local
445 auto mng = graph->manager(); in InsertRecomputedNodes() local
Dgraph_transform.h71 FuncGraphPtr TransformGraphParam(const FuncGraphPtr &fg, const FuncGraphManagerPtr &mng) { in TransformGraphParam()
/third_party/mindspore/tests/ut/cpp/ir/
Dmanager_test.cc344 void TestManager::CheckAnalysisSize(std::shared_ptr<FuncGraphManager> mng) { in CheckAnalysisSize()
353 auto mng = Manage(func_graph); in TEST_F() local
373 auto mng = Manage(func_graph); in TEST_F() local
383 auto mng = Manage(f); in TEST_F() local
424 auto mng = Manage(gfn); in TEST_F() local
488 auto mng = Manage(f); in TEST_F() local
553 auto mng = Manage(fg); in TEST_F() local
575 auto mng = Manage(fg); in TEST_F() local
588 auto mng = Manage(fg1); in TEST_F() local
610 auto mng = Manage(fg); in TEST_F() local
/third_party/mindspore/mindspore/core/ir/
Dfunc_graph.cc311 auto mng = manager_.lock(); in free_variables_total() local
381 auto mng = manager_.lock(); in func_graphs_used_total() local
465 auto mng = manager_.lock(); in parent() local
471 auto mng = manager_.lock(); in children() local
477 auto mng = manager_.lock(); in scope() local
483 auto mng = manager_.lock(); in recursive() local
489 auto mng = manager_.lock(); in recursive_graphs() local
653 auto mng = manager_.lock(); in EraseUnusedNodeInOrder() local
Dgraph_utils_extends.cc166 explicit DeepUsersSearcher(const IncludeFunc &include, const FuncGraphManagerPtr &mng) in DeepUsersSearcher()
202 const FuncGraphManagerPtr &mng) { in DeepUsersSearch()
/third_party/mindspore/mindspore/ccsrc/frontend/optimizer/irpass/
Dcall_graph_tuple_transform.h111 bool TransformBranchNode(AnfNodePtr node, FuncGraphManagerPtr mng, AnfNodePtr *trans_node) { in TransformBranchNode()
183 bool TransformLayerNode(AnfNodePtr node, FuncGraphManagerPtr mng, AnfNodePtr *trans_node) { in TransformLayerNode()
Dinline.h181 auto mng = fg->manager(); in InlineMove() local
223 void ReplaceParams(const FuncGraphManagerPtr &mng, const std::vector<AnfNodePtr> &new_params, in ReplaceParams()
255 auto mng = fg->manager(); in SimplifyAfterParameter() local
Dspecialize_transform.h51 auto mng = func_graph->manager(); in operator() local
Dminmax_grad.h63 auto mng = optimizer->manager(); in operator() local
/third_party/mindspore/tests/ut/cpp/optimizer/
Dcconv_test.cc28 auto mng = Manage(root); in CheckNoFreeVariables() local
50 auto mng = Manage(g); in CheckCconv() local

12