| /third_party/mindspore/mindspore/ccsrc/frontend/parallel/ |
| D | step_auto_parallel.h | 40 Status ConstructCostGraphNodesByUniqueId(const std::vector<AnfNodePtr> &all_nodes, const FuncGraphP…
42 Status ConstructCostGraphNodesByUniqueIdTC(const std::vector<AnfNodePtr> &all_nodes, const FuncGrap…
44 void ConstructCostGraphEdges(const std::vector<AnfNodePtr> &all_nodes);
46 void AugmentCostGraph(const std::vector<AnfNodePtr> &all_nodes);
48 Status ParallelStrategySearch(const std::vector<AnfNodePtr> &all_nodes, const FuncGraphPtr &root);
50 Status ParallelStrategyRecSearch(const std::vector<AnfNodePtr> &all_nodes, const FuncGraphPtr &root…
|
| D | step_parallel.h | 76 bool FindCommunicationOp(const std::vector<AnfNodePtr> &all_nodes);
116 void ExtractInformation(const std::vector<AnfNodePtr> &all_nodes);
128 void ReshapeInit(const std::vector<AnfNodePtr> &all_nodes);
133 void ParallelCommunication(const FuncGraphPtr &root, const std::vector<AnfNodePtr> &all_nodes,
138 void CheckpointStrategy(const std::vector<AnfNodePtr> &all_nodes, const FuncGraphPtr &root);
165 void InsertVirtualOutput(const FuncGraphPtr &root, const std::vector<AnfNodePtr> &all_nodes);
|
| D | step_auto_parallel.cc | 94 std::vector<AnfNodePtr> all_nodes = DeepScopedGraphSearch(ret); in StepAutoParallel() local
101 InsertVirtualOutput(root, all_nodes); in StepAutoParallel()
104 all_nodes = DeepScopedGraphSearch(ret_after); in StepAutoParallel()
106 if (FindCommunicationOp(all_nodes)) { in StepAutoParallel()
112 if (ParallelStrategySearch(all_nodes, root) != SUCCESS) { in StepAutoParallel()
116 if (ParallelStrategyRecSearch(all_nodes, root) != SUCCESS) { in StepAutoParallel()
389 Status ConstructCostGraphNodesByUniqueId(const std::vector<AnfNodePtr> &all_nodes, const FuncGraphP… in ConstructCostGraphNodesByUniqueId() argument
405 for (auto &node : all_nodes) { in ConstructCostGraphNodesByUniqueId()
504 Status ConstructCostGraphNodesByUniqueIdTC(const std::vector<AnfNodePtr> &all_nodes, const FuncGrap… in ConstructCostGraphNodesByUniqueIdTC() argument
519 for (auto &node : all_nodes) { in ConstructCostGraphNodesByUniqueIdTC()
[all …]
|
| D | step_parallel.cc | 494 std::vector<AnfNodePtr> all_nodes = DeepScopedGraphSearch(ret); in HasStrategy() local
496 for (auto &node : all_nodes) { in HasStrategy()
518 bool FindCommunicationOp(const std::vector<AnfNodePtr> &all_nodes) { in FindCommunicationOp() argument
519 for (auto &node : all_nodes) { in FindCommunicationOp()
860 void InsertVirtualOutput(const FuncGraphPtr &root, const std::vector<AnfNodePtr> &all_nodes) { in InsertVirtualOutput() argument
865 for (auto &node : all_nodes) { in InsertVirtualOutput()
1875 void ExtractInformation(const std::vector<AnfNodePtr> &all_nodes) { in ExtractInformation() argument
1883 for (auto &node : all_nodes) { in ExtractInformation()
2184 void ReshapeInit(const std::vector<AnfNodePtr> &all_nodes) { in ReshapeInit() argument
2185 for (auto &node : all_nodes) { in ReshapeInit()
[all …]
|
| D | parameter_manager.h | 41 void CheckParameterSplit(const std::vector<AnfNodePtr> &all_nodes);
42 void HandleSymbolicKeyInstance(const FuncGraphPtr &root, const std::vector<AnfNodePtr> &all_nodes);
|
| D | parameter_manager.cc | 245 void CheckParameterSplit(const std::vector<AnfNodePtr> &all_nodes) { in CheckParameterSplit() argument
246 for (auto &node : all_nodes) { in CheckParameterSplit()
304 void HandleSymbolicKeyInstance(const FuncGraphPtr &root, const std::vector<AnfNodePtr> &all_nodes) { in HandleSymbolicKeyInstance() argument
306 for (auto &node : all_nodes) { in HandleSymbolicKeyInstance()
|
| /third_party/mindspore/tests/ut/cpp/pre_activate/pass/ |
| D | common_subexpression_elimination_test.cc | 65 ASSERT_EQ(manager->all_nodes().size(), 10); in TEST_F()
72 ASSERT_EQ(manager->all_nodes().size(), 8); in TEST_F()
79 ASSERT_EQ(manager->all_nodes().size(), 22); in TEST_F()
81 ASSERT_EQ(manager->all_nodes().size(), 14); in TEST_F()
93 ASSERT_EQ(manager->all_nodes().size(), 10); in TEST_F()
112 ASSERT_EQ(manager->all_nodes().size(), 10); in TEST_F()
120 ASSERT_EQ(manager->all_nodes().size(), 10); in TEST_F()
124 ASSERT_EQ(manager->all_nodes().size(), 8); in TEST_F()
136 ASSERT_EQ(manager->all_nodes().size(), 10); in TEST_F()
162 ASSERT_EQ(manager->all_nodes().size(), 10); in TEST_F()
[all …]
|
| /third_party/boost/libs/asio/tools/ |
| D | handlerviz.pl | 32 my %all_nodes = ();
62 $all_nodes{"$timestamp-$begin"} = $begin;
90 $all_nodes{"$timestamp-$1"} = $1;
112 $all_nodes{"$timestamp-$1"} = $1;
123 $all_nodes{"$timestamp-$id"} = $id;
333 foreach my $name (sort keys %all_nodes)
338 my $end = $all_nodes{$name};
344 $prev = $all_nodes{$name};
|
| /third_party/mesa3d/src/gallium/drivers/r600/sb/ |
| D | sb_shader.cpp | 37 pool(), all_nodes(), src_stats(), opt_stats(), errors(), in shader()
259 all_nodes.push_back(n); in create_node()
265 all_nodes.push_back(n); in create_alu()
272 all_nodes.push_back(n); in create_alu_group()
279 all_nodes.push_back(n); in create_alu_packed()
286 all_nodes.push_back(n); in create_cf()
292 all_nodes.push_back(n); in create_fetch()
300 all_nodes.push_back(n); in create_region()
308 all_nodes.push_back(n); in create_depart()
316 all_nodes.push_back(n); in create_repeat()
[all …]
|
| /third_party/mindspore/tests/ut/cpp/parallel/ |
| D | step_parallel_test.cc | 371 std::vector<AnfNodePtr> all_nodes = DeepScopedGraphSearch(ret); in TEST_F() local
372 ExtractInformation(all_nodes); in TEST_F()
380 std::vector<AnfNodePtr> all_nodes = DeepScopedGraphSearch(ret); in TEST_F() local
381 EXPECT_THROW({ ExtractInformation(all_nodes); }, std::runtime_error); in TEST_F()
389 std::vector<AnfNodePtr> all_nodes = DeepScopedGraphSearch(ret); in TEST_F() local
390 EXPECT_THROW({ ExtractInformation(all_nodes); }, std::runtime_error); in TEST_F()
408 std::vector<AnfNodePtr> all_nodes = DeepScopedGraphSearch(ret); in TEST_F() local
409 ExtractInformation(all_nodes); in TEST_F()
410 for (auto &node : all_nodes) { in TEST_F()
421 AnfNodeSet after_nodes = manager->all_nodes(); in TEST_F()
[all …]
|
| /third_party/mindspore/mindspore/ccsrc/frontend/parallel/graph_util/ |
| D | pipeline_split_utils.h | 35 void HandleReceiveParam(const FuncGraphPtr &root, const std::vector<AnfNodePtr> &all_nodes);
58 void HandleMicroBatch(const std::vector<AnfNodePtr> &all_nodes, const FuncGraphManagerPtr &manager);
63 void LastStageEndNode(const std::vector<AnfNodePtr> &all_nodes, const FuncGraphManagerPtr &manager,
66 void ParameterStartNode(const std::vector<AnfNodePtr> &all_nodes, const FuncGraphManagerPtr &manage…
|
| D | graph_info.cc | 31 std::vector<AnfNodePtr> all_nodes = DeepScopedGraphSearch(ret); in FindPrimtive() local
33 for (auto &node : all_nodes) { in FindPrimtive()
|
| D | pipeline_split_utils.cc | 164 void HandleReceiveParam(const FuncGraphPtr &root, const std::vector<AnfNodePtr> &all_nodes) { in HandleReceiveParam() argument
167 for (auto &node : all_nodes) { in HandleReceiveParam()
481 void LastStageEndNode(const std::vector<AnfNodePtr> &all_nodes, const FuncGraphManagerPtr &manager, in LastStageEndNode() argument
487 for (auto &node : all_nodes) { in LastStageEndNode()
540 void ParameterStartNode(const std::vector<AnfNodePtr> &all_nodes, const FuncGraphManagerPtr &manage… in ParameterStartNode() argument
542 for (auto &node : all_nodes) { in ParameterStartNode()
556 void HandleMicroBatch(const std::vector<AnfNodePtr> &all_nodes, const FuncGraphManagerPtr &manager)… in HandleMicroBatch() argument
558 for (auto &node : all_nodes) { in HandleMicroBatch()
|
| /third_party/mindspore/mindspore/ccsrc/pipeline/jit/ |
| D | validator.cc | 133 AnfNodeSet &all_nodes = mgr->all_nodes(); in Validate() local
134 for (const auto &anf_node : all_nodes) { in Validate()
|
| /third_party/mindspore/mindspore/ccsrc/frontend/optimizer/ |
| D | opt.cc | 198 auto &all_nodes = manager->all_nodes(); in ApplyIRToSubstitutions() local
203 … if (node == nullptr || node->seen_ == seen || !isTraversable(node) || !all_nodes.contains(node)) { in ApplyIRToSubstitutions()
238 auto &all_nodes = manager->all_nodes(); in ApplySubstitutionToIR() local
243 … if (node == nullptr || node->seen_ == seen || !isTraversable(node) || !all_nodes.contains(node)) { in ApplySubstitutionToIR()
|
| D | clean.cc | 394 AnfNodeSet all_node = manager->all_nodes(); in SimplifyDataStructures()
429 for (auto &node : manager->all_nodes()) { in SimplifyDataStructures()
479 auto all_node = manager->all_nodes(); in CleanAfterOptA()
517 for (auto &node : manager->all_nodes()) { in CleanAfterOptA()
625 AnfNodeSet all_node = manager->all_nodes(); in EraseTuple()
|
| /third_party/mindspore/tests/ut/cpp/optimizer/ |
| D | opt_test.cc | 189 ASSERT_EQ(manager1->all_nodes().size(), 9); in TEST_F()
196 ASSERT_EQ(manager1->all_nodes().size(), 8); in TEST_F()
204 ASSERT_EQ(manager2->all_nodes().size(), 16); in TEST_F()
207 ASSERT_EQ(manager2->all_nodes().size(), 12); in TEST_F()
|
| D | clean_test.cc | 98 for (auto node : manager->all_nodes()) { in TEST_F()
121 for (auto node : manager->all_nodes()) { in TEST_F()
209 for (auto node : manager->all_nodes()) { in TEST_F()
221 for (auto node : manager->all_nodes()) { in TEST_F()
|
| /third_party/node/tools/gyp/tools/ |
| D | pretty_vcproj.py | 58 all_nodes = []
60 all_nodes.append((name, value))
62 all_nodes.sort(CmpTuple())
63 for (name, value) in all_nodes:
|
| /third_party/node/deps/npm/node_modules/node-gyp/gyp/tools/ |
| D | pretty_vcproj.py | 55 all_nodes = []
57 all_nodes.append((name, value))
59 all_nodes.sort(CmpTuple())
60 for (name, value) in all_nodes:
|
| /third_party/mindspore/mindspore/ccsrc/frontend/optimizer/irpass/ |
| D | updatestate_eliminate.cc | 713 auto &all_nodes = manager->all_nodes(); in operator ()() local
716 if (node == nullptr || !all_nodes.contains(node)) { in operator ()()
747 auto &all_nodes = manager->all_nodes(); in operator ()() local
750 if (node == nullptr || !all_nodes.contains(node)) { in operator ()()
783 auto &all_nodes = manager->all_nodes(); in operator ()() local
786 if (node == nullptr || !all_nodes.contains(node)) { in operator ()()
|
| D | gradient_eliminate.cc | 136 std::vector<AnfNodePtr> all_nodes = DeepScopedGraphSearch(ret); in GetJPrim() local
137 for (auto &node : all_nodes) { in GetJPrim()
|
| D | branch_culling.h | 106 std::vector<AnfNodePtr> all_nodes = DeepScopedGraphSearch(ret); in operator() local
109 for (auto &node : all_nodes) { in operator()
|
| /third_party/mindspore/tests/ut/cpp/ir/ |
| D | manager_test.cc | 206 for (auto node : manager->all_nodes()) { in CheckUsers()
211 if (!manager->all_nodes().contains(inp)) { in CheckUsers()
229 if (!manager->all_nodes().contains(node2)) { in CheckUsers()
385 ASSERT_EQ(6, mng->all_nodes().size()); in TEST_F()
429 ASSERT_EQ(20, mng->all_nodes().size()); in TEST_F()
492 ASSERT_EQ(20, mng->all_nodes().size()); in TEST_F()
|
| /third_party/mindspore/tests/ut/cpp/pipeline/parse/ |
| D | parser_class_test.cc | 58 for (auto node : manager->all_nodes()) { in TEST_F()
|