| /third_party/python/Lib/test/ |
| D | test_xml_dom_minicompat.py | 16 node_list = EmptyNodeList()
18 self.assertIsNone(node_list.item(0))
19 self.assertIsNone(node_list.item(-1)) # invalid item
22 node_list[0]
24 node_list[-1]
27 node_list = EmptyNodeList()
29 self.assertEqual(node_list.length, 0)
32 node_list.length = 111
35 node_list = EmptyNodeList() + NodeList()
36 self.assertEqual(node_list, NodeList())
[all …]
|
| /third_party/mesa3d/src/compiler/glsl/tests/ |
| D | list_iterators.cpp | 42 exec_list node_list; member in list_iterators_node_inherite
50 exec_list_make_empty(&node_list); in SetUp()
55 exec_list_push_tail(&node_list, node); in SetUp()
62 exec_list_make_empty(&node_list); in TearDown()
77 foreach_in_list(test_node_inherite, n, &node_list) { in TEST_P()
86 foreach_in_list_reverse(test_node_inherite, n, &node_list) { in TEST_P()
95 foreach_in_list_safe(test_node_inherite, n, &node_list) { in TEST_P()
105 exec_list_validate(&node_list); in TEST_P()
111 foreach_in_list_reverse_safe(test_node_inherite, n, &node_list) { in TEST_P()
121 exec_list_validate(&node_list); in TEST_P()
[all …]
|
| /third_party/mindspore/mindspore/dataset/engine/ |
| D | graphdata.py | 181 def get_edges_from_nodes(self, node_list): argument
199 return self._graph_data.get_edges_from_nodes(node_list).as_array()
202 def get_all_neighbors(self, node_list, neighbor_type, output_format=OutputFormat.NORMAL): argument
319 result_list = self._graph_data.get_all_neighbors(node_list, neighbor_type,
322 offset_table = result_list[:len(node_list)]
323 neighbor_table = result_list[len(node_list):]
328 …def get_sampled_neighbors(self, node_list, neighbor_nums, neighbor_types, strategy=SamplingStrateg… argument
366 … node_list, neighbor_nums, neighbor_types, DE_C_INTER_SAMPLING_STRATEGY[strategy]).as_array()
369 def get_neg_sampled_neighbors(self, node_list, neg_neighbor_num, neg_neighbor_type): argument
394 node_list, neg_neighbor_num, neg_neighbor_type).as_array()
[all …]
|
| /third_party/mindspore/tests/ut/cpp/dataset/ |
| D | gnn_graph_test.cc | 127 std::vector<NodeIdType> node_list; in TEST_F() local
129 node_list.push_back(*itr); in TEST_F()
130 if (node_list.size() >= 10) { in TEST_F()
135 s = graph.GetAllNeighbors(node_list, meta_info.node_type[1], OutputFormat::kNormal, &neighbors); in TEST_F()
168 std::vector<NodeIdType> node_list; in TEST_F() local
170 node_list.push_back(*itr); in TEST_F()
171 if (node_list.size() >= 10) { in TEST_F()
177 s = graph.GetAllNeighbors(node_list, meta_info.node_type[1], OutputFormat::kCoo, &neighbors_coo); in TEST_F()
186 s = graph.GetAllNeighbors(node_list, meta_info.node_type[1], OutputFormat::kCsr, &neighbors_csr); in TEST_F()
229 std::vector<NodeIdType> node_list; in TEST_F() local
[all …]
|
| /third_party/mindspore/mindspore/ccsrc/minddata/dataset/api/python/bindings/dataset/engine/gnn/ |
| D | bindings.cc | 60 … [](gnn::GraphData &g, const std::vector<std::pair<gnn::NodeIdType, gnn::NodeIdType>> &node_list) { in __anonee399bec0102() argument
62 THROW_IF_ERROR(g.GetEdgesFromNodes(node_list, &out)); in __anonee399bec0102()
66 … [](gnn::GraphData &g, const std::vector<gnn::NodeIdType> &node_list, gnn::NodeType neighbor_type, in __anonee399bec0102()
69 THROW_IF_ERROR(g.GetAllNeighbors(node_list, neighbor_type, format, &out)); in __anonee399bec0102()
73 …[](gnn::GraphData &g, std::vector<gnn::NodeIdType> node_list, std::vector<gnn::NodeIdType> neighbo… in __anonee399bec0102()
76 … THROW_IF_ERROR(g.GetSampledNeighbors(node_list, neighbor_nums, neighbor_types, strategy, &out)); in __anonee399bec0102()
80 … [](gnn::GraphData &g, std::vector<gnn::NodeIdType> node_list, gnn::NodeIdType neighbor_num, in __anonee399bec0102() argument
83 … THROW_IF_ERROR(g.GetNegSampledNeighbors(node_list, neighbor_num, neg_neighbor_type, &out)); in __anonee399bec0102()
87 …[](gnn::GraphData &g, std::shared_ptr<Tensor> node_list, std::vector<gnn::FeatureType> feature_typ… in __anonee399bec0102() argument
89 THROW_IF_ERROR(g.GetNodeFeature(node_list, feature_types, &out)); in __anonee399bec0102()
[all …]
|
| /third_party/mindspore/mindspore/profiler/parser/ |
| D | aicpu_data_parser.py | 67 def _get_kernel_result(self, number, node_list, thread_list): argument
70 if len(node_list) == self._ms_kernel_flag:
71 node_type_name = node_list[0].split(':')[-1]
73 elif len(node_list) == self._other_kernel_flag:
74 node_type_name = node_list[0].split(':')[-1].split('/')[-1].split('-')[0]
77 logger.warning("the data format can't support 'node_list':%s", str(node_list))
81 run_start_counter = float(node_list[1].split(':')[-1].split(' ')[1]) / us_unit
82 run_end_counter = float(node_list[run_end_index].split(':')[-1].split(' ')[1]) / us_unit
83 run_start = node_list[1].split(':')[-1].split(' ')[0]
84 run_end = node_list[run_end_index].split(':')[-1].split(' ')[0]
|
| /third_party/mindspore/mindspore/ccsrc/minddata/dataset/engine/gnn/ |
| D | graph_data_service_impl.cc | 197 std::vector<std::pair<NodeIdType, NodeIdType>> node_list; in GetEdgesFromNodes() local
198 node_list.resize(request->node_pair().size()); in GetEdgesFromNodes()
201 …request->node_pair().begin(), request->node_pair().end(), node_list.begin(), [](const auto &node_p… in GetEdgesFromNodes()
208 RETURN_IF_NOT_OK(graph_data_impl_->GetEdgesFromNodes(node_list, &tensor)); in GetEdgesFromNodes()
219 std::vector<NodeIdType> node_list; in GetAllNeighbors() local
220 node_list.resize(request->id().size()); in GetAllNeighbors()
221 std::transform(request->id().begin(), request->id().end(), node_list.begin(), in GetAllNeighbors()
226 …graph_data_impl_->GetAllNeighbors(node_list, static_cast<NodeType>(request->type()[0]), format, &t… in GetAllNeighbors()
238 std::vector<NodeIdType> node_list; in GetSampledNeighbors() local
239 node_list.resize(request->id().size()); in GetSampledNeighbors()
[all …]
|
| D | graph_data_impl.cc | 118 std::vector<std::vector<NodeIdType>> node_list; in GetNodesFromEdges() local
119 node_list.reserve(edge_list.size()); in GetNodesFromEdges()
128 node_list.push_back({nodes.first->id(), nodes.second->id()}); in GetNodesFromEdges()
131 RETURN_IF_NOT_OK(CreateTensorByVector<NodeIdType>(node_list, DataType(DataType::DE_INT32), out)); in GetNodesFromEdges()
135 …s GraphDataImpl::GetEdgesFromNodes(const std::vector<std::pair<NodeIdType, NodeIdType>> &node_list, in GetEdgesFromNodes() argument
137 if (node_list.empty()) { in GetEdgesFromNodes()
142 edge_list.reserve(node_list.size()); in GetEdgesFromNodes()
144 for (const auto &node_id : node_list) { in GetEdgesFromNodes()
159 Status GraphDataImpl::GetAllNeighbors(const std::vector<NodeIdType> &node_list, NodeType neighbor_t… in GetAllNeighbors() argument
161 CHECK_FAIL_RETURN_UNEXPECTED(!node_list.empty(), "Input node_list is empty."); in GetAllNeighbors()
[all …]
|
| D | graph_data.h | 69 virtual Status GetEdgesFromNodes(const std::vector<std::pair<NodeIdType, NodeIdType>> &node_list,
80 virtual Status GetAllNeighbors(const std::vector<NodeIdType> &node_list, NodeType neighbor_type,
90 virtual Status GetSampledNeighbors(const std::vector<NodeIdType> &node_list,
101 …virtual Status GetNegSampledNeighbors(const std::vector<NodeIdType> &node_list, NodeIdType samples…
112 …virtual Status RandomWalk(const std::vector<NodeIdType> &node_list, const std::vector<NodeType> &m…
|
| D | graph_data_client.h | 79 Status GetEdgesFromNodes(const std::vector<std::pair<NodeIdType, NodeIdType>> &node_list,
90 …Status GetAllNeighbors(const std::vector<NodeIdType> &node_list, NodeType neighbor_type, const Out…
100 …Status GetSampledNeighbors(const std::vector<NodeIdType> &node_list, const std::vector<NodeIdType>…
110 Status GetNegSampledNeighbors(const std::vector<NodeIdType> &node_list, NodeIdType samples_num,
121 …Status RandomWalk(const std::vector<NodeIdType> &node_list, const std::vector<NodeType> &meta_path,
|
| /third_party/mesa3d/src/gallium/drivers/lima/ir/gp/ |
| D | reduce_scheduler.c | 140 list_add(&node->list, &block->node_list); in schedule_ready_list()
168 struct list_head node_list; in schedule_block() local
169 list_replace(&block->node_list, &node_list); in schedule_block()
170 list_inithead(&block->node_list); in schedule_block()
173 list_for_each_entry(gpir_node, node, &node_list, list) { in schedule_block()
184 list_for_each_entry_safe(gpir_node, node, &node_list, list) { in schedule_block()
216 list_for_each_entry_rev(gpir_node, node, &block->node_list, list) { in add_false_dependencies()
239 list_for_each_entry_safe(gpir_node, node, &block->node_list, list) { in gpir_reduce_reg_pressure_schedule_prog()
|
| D | optimize.c | 70 if (!list_is_singular(&block->node_list)) in optimize_branches()
73 gpir_node *node = list_first_entry(&block->node_list, gpir_node, list); in optimize_branches()
84 if (list_is_empty(&prev_block->node_list)) in optimize_branches()
89 list_last_entry(&prev_block->node_list, gpir_node, list); in optimize_branches()
120 list_for_each_entry_rev(gpir_node, node, &block->node_list, list) { in optimize_not()
166 list_for_each_entry_safe_rev(gpir_node, node, &block->node_list, list) { in dead_code_eliminate()
183 list_for_each_entry(gpir_node, node, &block->node_list, list) { in dead_code_eliminate()
192 list_for_each_entry_safe(gpir_node, node, &block->node_list, list) { in dead_code_eliminate()
|
| /third_party/mindspore/mindspore/ccsrc/runtime/device/ascend/ |
| D | ascend_launch_kernel.cc | 36 auto node_list = kernel_graph->execution_order(); in KernelSelect() local
37 for (size_t i = 0; i < node_list.size(); ++i) { in KernelSelect()
38 auto status = device::ascend::SelectKernelInfo(node_list[i]); in KernelSelect()
40 …MS_LOG(ERROR) << "Cnode name : " << node_list[i]->fullname_with_scope() << " kernel select failed"; in KernelSelect()
|
| D | kernel_select_graph_kernel.cc | 78 void UpdateKernelInfo(const std::vector<AnfNodePtr> &node_list) { in UpdateKernelInfo() argument
79 for (size_t i = 0; i < node_list.size(); ++i) { in UpdateKernelInfo()
81 auto anf_node = node_list[i]; in UpdateKernelInfo()
305 void UpdateEquivFormat(const std::vector<AnfNodePtr> &node_list, const FuncGraphPtr &func_graph, in UpdateEquivFormat() argument
308 for (size_t i = 0; i < node_list.size(); ++i) { in UpdateEquivFormat()
310 auto anf_node = node_list[i]; in UpdateEquivFormat()
395 void UpdateFormatsAndDtypes(const CNodePtr &kernel_node, const std::vector<AnfNodePtr> &node_list, in UpdateFormatsAndDtypes() argument
426 for (size_t i = 0; i < node_list.size(); ++i) { in UpdateFormatsAndDtypes()
427 auto anf_node = node_list[i]; in UpdateFormatsAndDtypes()
444 SelectKernelInfo(node_list[i]->cast<CNodePtr>(), KernelType::AKG_KERNEL); in UpdateFormatsAndDtypes()
[all …]
|
| /third_party/mindspore/mindspore/ccsrc/backend/optimizer/ascend/buffer_fusion/ |
| D | eltwise_fusion_pass.cc | 57 std::vector<AnfNodePtr> node_list = TopoSort(kernel_graph.get_return()); in MatchSingleFusionPattern() local
58 std::reverse(node_list.begin(), node_list.end()); in MatchSingleFusionPattern()
59 for (auto &node : node_list) { in MatchSingleFusionPattern()
|
| D | multi_output_fusion_pass.cc | 63 std::vector<AnfNodePtr> node_list = TopoSort(kernel_graph.get_return()); in MatchSingleFusionPattern() local
64 std::reverse(node_list.begin(), node_list.end()); in MatchSingleFusionPattern()
65 for (auto &node : node_list) { in MatchSingleFusionPattern()
|
| D | segment_eltwise_fusion_pass.cc | 69 std::vector<AnfNodePtr> node_list = TopoSort(kernel_graph.get_return()); in MatchSingleFusionPattern() local
70 std::reverse(node_list.begin(), node_list.end()); in MatchSingleFusionPattern()
71 for (auto &node : node_list) { in MatchSingleFusionPattern()
|
| D | reduce_eltwise_fusion_pass.cc | 72 std::vector<AnfNodePtr> node_list = TopoSort(kernel_graph.get_return()); in MatchSingleFusionPattern() local
73 std::reverse(node_list.begin(), node_list.end()); in MatchSingleFusionPattern()
74 for (auto &node : node_list) { in MatchSingleFusionPattern()
|
| /third_party/mindspore/tests/ut/cpp/pre_activate/pass/ |
| D | allreduce_fusion_test.cc | 60 auto node_list = TopoSort(func_graph->get_return()); in TEST_F() local
61 for (auto &node : node_list) { in TEST_F()
101 auto node_list = TopoSort(func_graph->get_return()); in TEST_F() local
102 for (auto &node : node_list) { in TEST_F()
142 auto node_list = TopoSort(func_graph->get_return()); in TEST_F() local
144 for (auto &node : node_list) { in TEST_F()
199 auto node_list = TopoSort(func_graph->get_return()); in TEST_F() local
200 for (auto &node : node_list) { in TEST_F()
|
| /third_party/boost/libs/log/src/ |
| D | attribute_set_impl.hpp | 189 > node_list; typedef
225 node_list m_Nodes;
238 node_list::const_iterator it = that.m_Nodes.begin(), end = that.m_Nodes.end(); in implementation()
285 node_list::iterator it; in insert()
318 typedef node_list::node_traits node_traits; in erase()
319 typedef node_list::value_traits value_traits; in erase()
374 typedef node_list::node_traits node_traits; in find_in_bucket()
375 typedef node_list::value_traits value_traits; in find_in_bucket()
|
| /third_party/mesa3d/src/gallium/drivers/lima/ir/pp/ |
| D | nir.c | 206 list_addtail(&node->node.list, &block->node_list); in ppir_emit_alu()
224 list_addtail(&discard->node.list, &block->node_list); in ppir_emit_discard_block()
287 list_addtail(&lnode->node.list, &block->node_list); in ppir_emit_intrinsic()
317 list_addtail(&lnode->node.list, &block->node_list); in ppir_emit_intrinsic()
337 list_addtail(&lnode->node.list, &block->node_list); in ppir_emit_intrinsic()
381 list_addtail(&alu_node->node.list, &block->node_list); in ppir_emit_intrinsic()
387 list_addtail(&node->list, &block->node_list); in ppir_emit_intrinsic()
392 list_addtail(&node->list, &block->node_list); in ppir_emit_intrinsic()
415 list_addtail(&node->node.list, &block->node_list); in ppir_emit_load_const()
430 list_addtail(&node->list, &block->node_list); in ppir_emit_ssa_undef()
[all …]
|
| /third_party/mindspore/tests/ut/python/dataset/ |
| D | test_graphdata_distributed.py | 71 node_list=nodes, neg_neighbor_num=3, neg_neighbor_type=1)
72 nodes_neighbors = self.g.get_sampled_neighbors(node_list=nodes, neighbor_nums=[
74 …neg_nodes_neighbors = self.g.get_sampled_neighbors(node_list=neg_nodes[:, 1:].reshape(-1), neighbo…
77 node_list=nodes_neighbors, feature_types=[2, 3])
79 node_list=neg_nodes_neighbors, feature_types=[2, 3])
|
| D | test_graphdata.py | 187 node_list=nodes, neg_neighbor_num=3, neg_neighbor_type=1)
188 nodes_neighbors = self.g.get_sampled_neighbors(node_list=nodes, neighbor_nums=[
191 node_list=neg_nodes[:, 1:].reshape(-1), neighbor_nums=[2, 2], neighbor_types=[2, 2])
193 node_list=nodes_neighbors, feature_types=[2, 3])
195 node_list=neg_nodes_neighbors, feature_types=[2, 3])
291 features = g.get_node_feature(node_list=nodes, feature_types=[2, 3])
306 edges = g.get_edges_from_nodes(node_list=nodes_pair_list)
|
| /third_party/mindspore/mindspore/ccsrc/runtime/device/gpu/ |
| D | gpu_launch_kernel.cc | 49 auto node_list = kernel_graph->execution_order(); in KernelSelect() local
50 for (size_t i = 0; i < node_list.size(); ++i) { in KernelSelect()
51 device::gpu::SetKernelInfo(node_list[i]); in KernelSelect()
|
| /third_party/mindspore/mindspore/lite/test/ut/tools/converter/registry/ |
| D | pass_registry_test.cc | 101 auto node_list = api::FuncGraph::TopoSort(func_graph->get_return()); in Execute() local
102 for (auto &node : node_list) { in Execute()
169 auto node_list = TopoSort(func_graph->get_return()); in Execute() local
170 for (auto &node : node_list) { in Execute()
210 auto node_list = api::FuncGraph::TopoSort(func_graph_->get_return()); in TEST_F() local
211 for (auto &node : node_list) { in TEST_F()
|