Home
last modified time | relevance | path

Searched refs:node_users (Results 1 – 25 of 104) sorted by relevance

12345

/third_party/mindspore/mindspore/ccsrc/frontend/optimizer/
Drecompute.cc91 const auto &node_users = mng->node_users(); in FindCandidateRecomputedNodes() local
92 auto output_set_iter = node_users.find(cnode); in FindCandidateRecomputedNodes()
93 if (output_set_iter == node_users.end()) { in FindCandidateRecomputedNodes()
142 const auto &node_users = mng->node_users(); in GetMaxSubGraph() local
143 auto output_set_iter = node_users.find(current_node); in GetMaxSubGraph()
144 if (output_set_iter == node_users.end()) { in GetMaxSubGraph()
169 const auto &node_users = mng->node_users(); in GetOriginRecomputeAndTargetNodes() local
172 auto output_set_iter = node_users.find(node); in GetOriginRecomputeAndTargetNodes()
173 if (output_set_iter == node_users.end()) { in GetOriginRecomputeAndTargetNodes()
243 const auto &node_users = mng->node_users(); in HasForwardOutput() local
[all …]
Dauto_monad_eliminate.cc187 auto load_users = manager->node_users()[load]; in ReplaceLoadUser()
198 auto &maketuple_users = manager->node_users()[make_tuple]; in ReplaceLoadUser()
268 auto &node_users = mgr->node_users()[update_state]; in ReplaceUpdateStateForLoad() local
270 if (!IsPrimitiveCNode(update_state, prim::kPrimUpdateState) || node_users.size() == kUserSize) { in ReplaceUpdateStateForLoad()
340 auto &node_users = manager->node_users(); in EliminateAutoMonadNode() local
341 auto iter = node_users.find(attach); in EliminateAutoMonadNode()
342 if (iter == node_users.end()) { in EliminateAutoMonadNode()
/third_party/mindspore/mindspore/lite/tools/common/
Dfunc_graph_subgraph.cc130 auto node_users = belong_anf_->manager()->node_users(); in GetOutputCNodes() local
136 auto iter = node_users.find(out_node); in GetOutputCNodes()
137 if (iter == node_users.end()) { in GetOutputCNodes()
155 auto node_users = belong_anf_->manager()->node_users(); in InitSubGraphNode() local
169 auto iter = node_users.find(cur_node); in InitSubGraphNode()
170 if (iter == node_users.end()) { in InitSubGraphNode()
222 auto node_users = belong_anf_->manager()->node_users(); in InitSubGraphInNode() local
228 …if (std::any_of(node->inputs().begin(), node->inputs().end(), [this, &node_users](const auto &inpu… in InitSubGraphInNode()
246 auto output_pair_iter = node_users.find(input); in InitSubGraphInNode()
247 if (output_pair_iter != node_users.end() && output_pair_iter->second.size() > 1) { in InitSubGraphInNode()
[all …]
/third_party/mindspore/tests/ut/cpp/ir/
Dmanager_test.cc215 if (manager->node_users().find(inp) != manager->node_users().end()) { in CheckUsers()
216 auto users = manager->node_users()[inp]; in CheckUsers()
224 if (manager->node_users().find(node) != manager->node_users().end()) { in CheckUsers()
225 auto users = manager->node_users()[node]; in CheckUsers()
387 ASSERT_EQ(4, mng->node_users().size()); in TEST_F()
394 auto &users = mng->node_users(); in TEST_F()
430 ASSERT_EQ(25, mng->node_users().size()); in TEST_F()
649 auto a_users = mgr->node_users()[a]; in TEST_F()
658 a_users = mgr->node_users()[a]; in TEST_F()
669 a_users = mgr->node_users()[a]; in TEST_F()
[all …]
/third_party/mindspore/mindspore/lite/tools/converter/parser/tf/
Dfunctionalize_cond.cc37 auto node_users = manager->node_users()[switch_cnode]; in GetSwitchBranchType() local
38 if (node_users.size() != 1) { // only one output of switch is referenced in cond in GetSwitchBranchType()
42 auto node_user = node_users.front(); in GetSwitchBranchType()
135 auto node_users = manager->node_users()[cnode]; in IdentifySubgraphInput() local
136 for (auto &node_user : node_users) { in IdentifySubgraphInput()
262 auto node_users = manager->node_users()[merge_node_]; in Process() local
263 for (auto &node_user : node_users) { in Process()
Dfunctionalize_while.cc217 auto node_users = manager->node_users()[node]; in UpdateExitNodeUser() local
218 for (auto &node_user : node_users) { in UpdateExitNodeUser()
355 auto node_users = manager->node_users()[cnode]; in IdentifyCondSubgraphInput() local
356 for (auto &node_user : node_users) { in IdentifyCondSubgraphInput()
495 auto node_users = manager->node_users()[cnode]; in IdentifyBodySubgraphInput() local
496 for (auto &node_user : node_users) { in IdentifyBodySubgraphInput()
/third_party/mindspore/mindspore/ccsrc/backend/optimizer/ascend/ir_fusion/
Dlayer_norm_beta_gamma_backprop_fusion.cc30 if (manager->node_users().find(node) == manager->node_users().end()) { in GetOutputCastNodes()
33 for (const auto &node_index : manager->node_users()[node]) { in GetOutputCastNodes()
41 if (manager->node_users().find(output) == manager->node_users().end() || in GetOutputCastNodes()
42 manager->node_users()[output].size() != 1) { in GetOutputCastNodes()
45 AnfNodePtr transitive_output = manager->node_users()[output].begin()->first; in GetOutputCastNodes()
Dsquare_sum_fusion.cc115 if (manager->node_users().find(square_anf) == manager->node_users().end()) { in Process()
120 if (manager->node_users()[square_anf].size() == 1) { in Process()
122 } else if (manager->node_users()[square_anf].size() == kShape2Dim) { in Process()
/third_party/mindspore/mindspore/ccsrc/backend/optimizer/mem_reuse/
Dmem_swap_manager.cc139 auto &node_users = iter->second; in CheckDistanceBetweenKernels() local
140 if (node_users.front() - kernel_exec_info.topo_order_ > distance_threshold_) { in CheckDistanceBetweenKernels()
144 for (size_t i = 1; i < node_users.size(); ++i) { in CheckDistanceBetweenKernels()
145 if (node_users[i] - node_users[i - 1] > distance_threshold_) { in CheckDistanceBetweenKernels()
163 auto &node_users = iter->second; in CheckDistanceBetweenKernelsWithIdx() local
164 if (node_users.front() - kernel_exec_info.topo_order_ > distance_threshold_) { in CheckDistanceBetweenKernelsWithIdx()
165 need_swap_topo_pair_list.emplace_back(kernel_exec_info.topo_order_, node_users.front()); in CheckDistanceBetweenKernelsWithIdx()
168 for (size_t i = 1; i < node_users.size(); ++i) { in CheckDistanceBetweenKernelsWithIdx()
169 if (node_users[i] - node_users[i - 1] > distance_threshold_) { in CheckDistanceBetweenKernelsWithIdx()
170 need_swap_topo_pair_list.emplace_back(node_users[i - 1], node_users[i]); in CheckDistanceBetweenKernelsWithIdx()
[all …]
/third_party/mindspore/mindspore/ccsrc/backend/optimizer/ascend/format_type/
Dremove_internal_output.cc28 auto &node_users = manager->node_users(); in UsedForOutputOnly() local
29 auto iter = node_users.find(node); in UsedForOutputOnly()
30 if (iter == node_users.end()) { in UsedForOutputOnly()
/third_party/mindspore/mindspore/ccsrc/pipeline/jit/static_analysis/
Dorder_enforce.cc99 auto &node_users = manager_->node_users(); in FindUpdateStateUsers() local
100 auto iter = node_users.find(node); in FindUpdateStateUsers()
101 if (iter == node_users.end()) { in FindUpdateStateUsers()
313 auto &node_users = manager_->node_users(); in FindNodeUsers() local
314 auto iter = node_users.find(node); in FindNodeUsers()
315 if (iter == node_users.end()) { in FindNodeUsers()
/third_party/mindspore/mindspore/ccsrc/backend/optimizer/ascend/enhancer/
Dinsert_tensor_move_for_cascade.cc46 auto &node_users = manager->node_users(); in IsPartOutputsOfHcclOp() local
47 auto iter = node_users.find(prev_hccl_op); in IsPartOutputsOfHcclOp()
48 if (iter == node_users.end()) { in IsPartOutputsOfHcclOp()
Dgetnext_tensor_move_elimination.cc53 if (manager->node_users().find(tensor_move_node) == manager->node_users().end()) { in Process()
56 auto next_nodes = manager->node_users()[tensor_move_node]; in Process()
Dinsert_tensor_move_for_hccl_op.cc47 auto &node_users = manager->node_users(); in IsNodeOutPutUsedByOtherRealKernel() local
48 auto iter = node_users.find(input); in IsNodeOutPutUsedByOtherRealKernel()
49 if (iter == node_users.end()) { in IsNodeOutPutUsedByOtherRealKernel()
/third_party/mindspore/mindspore/ccsrc/frontend/optimizer/irpass/
Dmerge_addn.h123 auto &node_users = mng_->node_users(); in is_unique() local
124 if (node_users.find(node) == node_users.end()) { in is_unique()
128 size_t n_use = node_users[node].size(); in is_unique()
Dupdatestate_eliminate.cc59 auto &node_users = mgr->node_users(); in OnlyUsedByOneNode() local
60 auto iter = node_users.find(be_used_node); in OnlyUsedByOneNode()
61 if (iter == node_users.end()) { in OnlyUsedByOneNode()
74 auto &node_users = mgr->node_users(); in OnlyUsedByTwoNode() local
75 auto iter = node_users.find(be_used_node); in OnlyUsedByTwoNode()
76 if (iter == node_users.end()) { in OnlyUsedByTwoNode()
288 auto &node_users = mgr->node_users(); in EliminateUselessNodesForUpdateStates() local
289 auto iter = node_users.find(update_states[0]); in EliminateUselessNodesForUpdateStates()
290 if (iter == node_users.end()) { in EliminateUselessNodesForUpdateStates()
/third_party/mindspore/mindspore/ccsrc/backend/optimizer/pass/
Doptimize_updatestate.cc47 auto &node_users = manager->node_users(); in Process() local
54 auto &users = node_users[attach]; in Process()
Dadd_training_attr.cc38 for (const auto &node_index : manager->node_users()[cnode]) { in CheckOP()
59 if (manager->node_users().find(cnode) == manager->node_users().end()) { in AddAttrTraining()
/third_party/mindspore/mindspore/ccsrc/frontend/parallel/
Dparameter_manager.cc70 auto candidate_set_by_refkey = cnode_func_graph->manager()->node_users()[refkeys[0]]; in FindRefKeyNodeUsers()
87 auto candidate_set_by_para = cnode_func_graph->manager()->node_users()[parameters[0]]; in FindRefKeyNodeUsers()
104 auto candidate_set = node->func_graph()->manager()->node_users()[node]; in FindParameterNodeUsers()
111 auto load_node_users = node->func_graph()->manager()->node_users()[candidate_node]; in FindParameterNodeUsers()
172 auto node_users = manager->node_users()[parameter]; in IsUsedParameter() local
173 if (node_users.empty()) { in IsUsedParameter()
176 for (auto node_user : node_users) { in IsUsedParameter()
286 auto all_upstream_node = root->manager()->node_users()[node]; in RevertSymbolicKeyInstance()
425 auto node_users_map = root->manager()->node_users(); in HandleFullySplitParameters()
439 auto node_users = node_users_map[parameter]; in HandleFullySplitParameters() local
[all …]
/third_party/mindspore/mindspore/ccsrc/frontend/optimizer/ad/
Dprim_bprop_optimizer.cc63 const auto &node_users = manager->node_users(); in AnalysisArgUsingInfo() local
70 AnalysisNodeUsingInfo(node_users, param, &arg_info); in AnalysisArgUsingInfo()
75 void PrimBpropOptGraphLevel2Info::AnalysisNodeUsingInfo(const NodeUsersMap &node_users, in AnalysisNodeUsingInfo() argument
79 auto iter = node_users.find(param); in AnalysisNodeUsingInfo()
80 if (iter == node_users.end()) { in AnalysisNodeUsingInfo()
102 AalysisForTupleGetItem(node_users, param, arg_info, user_node); in AnalysisNodeUsingInfo()
106 void PrimBpropOptGraphLevel2Info::AalysisForTupleGetItem(const NodeUsersMap &node_users, in AalysisForTupleGetItem() argument
139 AnalysisNodeUsingInfo(node_users, cnode, &(arg_info->sub_using_info_[idx])); in AalysisForTupleGetItem()
/third_party/mindspore/mindspore/ccsrc/frontend/parallel/pipeline_transformer/
Dpipeline_transformer.cc155 auto node_user_map = manager_->node_users(); in LabelMicroBatch()
156 auto node_users = node_user_map[virtual_dataset_]; in LabelMicroBatch() local
157 for (auto &node_user : node_users) { in LabelMicroBatch()
159 auto data_users = manager_->node_users()[node_user.first]; in LabelMicroBatch()
214 auto node_users = manager_->node_users()[node]; in Coloring() local
215 for (auto &user_pair : node_users) { in Coloring()
239 auto node_users = manager_->node_users(); in BroadCastColoring() local
245 for (auto &user_pair : node_users[node]) { in BroadCastColoring()
386 auto node_users_map = manager_->node_users(); in GetParameterPair()
387 auto node_users = node_users_map[node]; in GetParameterPair() local
[all …]
/third_party/mindspore/mindspore/lite/tools/optimizer/graph/
Dredundant_op_remove_pass.cc96 auto node_users = manager->node_users()[pre_node]; in ProcessDependencyWithTwoNodes() local
98 std::find_if(node_users.begin(), node_users.end(), in ProcessDependencyWithTwoNodes()
100 if (iter == node_users.end()) { in ProcessDependencyWithTwoNodes()
244 auto node_users = manager->node_users()[anf_node]; in RemoveDropoutOp() local
245 for (auto &node_user : node_users) { in RemoveDropoutOp()
257 if (get_index > 0 && !manager->node_users()[node].empty()) { in RemoveDropoutOp()
Dtranspose_strategy.cc49 auto node_users = manager->node_users()[cnode]; in GetPostNodes() local
50 if (node_users.empty()) { in GetPostNodes()
54 std::transform(node_users.begin(), node_users.end(), std::back_inserter(*out_nodes), in GetPostNodes()
491 auto node_users = manager->node_users()[cnode]; in TransposeInsertDependOnShape() local
492 if (node_users.empty()) { in TransposeInsertDependOnShape()
496 if (!utils::isa<CNodePtr>(node_users.front().first)) { in TransposeInsertDependOnShape()
499 CNodePtr base_node = before ? cnode : node_users.front().first->cast<CNodePtr>(); in TransposeInsertDependOnShape()
501 size_t input_index = before ? index : node_users.front().second; in TransposeInsertDependOnShape()
/third_party/mindspore/mindspore/ccsrc/frontend/parallel/graph_util/
Dpipeline_split_utils.cc166 auto node_users_map = root->manager()->node_users(); in HandleReceiveParam()
181 auto node_users = node_users_map[node]; in HandleReceiveParam() local
182 for (auto &temp_user : node_users) { in HandleReceiveParam()
204 auto node_users_map = root->manager()->node_users(); in AddVirtualAssignAdd()
211 auto node_users = node_users_map[parameter]; in AddVirtualAssignAdd() local
212 for (auto &temp_user : node_users) { in AddVirtualAssignAdd()
414 auto node_users = (*node_users_map)[node]; in BroadCastMicroBatch() local
418 for (auto &node_pair : node_users) { in BroadCastMicroBatch()
429 auto node_users = (*node_user_map)[node]; in BroadCastNeedGrad() local
430 for (auto &node_user : node_users) { in BroadCastNeedGrad()
[all …]
/third_party/mindspore/mindspore/ccsrc/vm/
Dsegment_runner.cc60 auto &node_users = iter->second; in GetOutput() local
61 const bool has_outer_user = std::any_of(std::begin(node_users), std::end(node_users), in GetOutput()
146 auto outputs = GetOutput(lst, mgr->node_users(), eqv_keys); in TransformSegmentToAnfGraph()

12345