| /external/XNNPACK/test/ |
| D | memory-planner-test.cc | 37 EXPECT_EQ(0, tracker.usage[0].first_node); in TEST()
40 EXPECT_EQ(0, tracker.usage[1].first_node); in TEST()
43 EXPECT_EQ(0, tracker.usage[2].first_node); in TEST()
46 EXPECT_EQ(1, tracker.usage[3].first_node); in TEST()
60 tracker.usage[0].first_node = 1, in TEST()
64 tracker.usage[1].first_node = 0, in TEST()
68 tracker.usage[2].first_node = 1, in TEST()
72 tracker.usage[3].first_node = 0, in TEST()
76 tracker.usage[4].first_node = 1, in TEST()
109 tracker.usage[0].first_node = 0, in TEST()
[all …]
|
| /external/XNNPACK/src/ |
| D | memory-planner.c | 16 assert(a->last_node >= a->first_node); in value_lifecycle_overlap()
17 assert(b->last_node >= b->first_node); in value_lifecycle_overlap()
18 if (a->first_node < b->first_node) { in value_lifecycle_overlap()
19 return a->last_node >= b->first_node; in value_lifecycle_overlap()
21 return b->last_node >= a->first_node; in value_lifecycle_overlap()
43 if (usage[node->inputs[i]].first_node == 0) { in populate_value_lifecycle()
44 usage[node->inputs[i]].first_node = nid; in populate_value_lifecycle()
49 if (usage[node->outputs[i]].first_node == 0) { in populate_value_lifecycle()
50 usage[node->outputs[i]].first_node = nid; in populate_value_lifecycle()
55 const struct xnn_node* first_node = subgraph->nodes; in populate_value_lifecycle() local
[all …]
|
| /external/pytorch/torch/ao/ns/fx/ |
| D | n_shadows_utils.py | 169 first_node = None
176 first_node = n
182 first_node is not None
186 assert mid_node.args[0] is first_node
188 return [last_node, mid_node, first_node]
214 first_node: Node,
230 first_node.name, # ref_node_name
235 get_target_type_str(first_node, model), # ref_node_target_type
251 first_node: Node,
298 cur_node_orig = first_node
[all …]
|
| /external/executorch/backends/xnnpack/_passes/ |
| D | tag_implicit_q_dq_pass.py | 170 for first_node in graph_module.graph.nodes:
171 if (is_dequant(first_node) or is_quant(first_node)) and all(
173 for n in first_node.all_input_nodes
176 self.tag_as_implicit_q_dq(first_node)
179 if not is_dequant(first_node):
182 if len(first_node.users) == 0:
186 for user in first_node.users:
187 if self.is_dynamically_quantized(first_node):
202 self.tag_as_implicit_q_dq(first_node)
|
| /external/tensorflow/tensorflow/lite/delegates/gpu/common/transformations/ |
| D | remove_noop_test.cc | 42 auto first_node = graph.NewNode(); in TEST() local
43 ASSERT_TRUE(graph.AddConsumer(first_node->id, input->id).ok()); in TEST()
52 ASSERT_TRUE(ConnectTwoNodes(&graph, first_node, add_node, &temp).ok()); in TEST()
62 ASSERT_EQ(first_node, graph.nodes()[0]); in TEST()
70 auto first_node = graph.NewNode(); in TEST() local
71 ASSERT_TRUE(graph.AddConsumer(first_node->id, input->id).ok()); in TEST()
82 ASSERT_TRUE(ConnectTwoNodes(&graph, first_node, add_node, &temp).ok()); in TEST()
97 auto first_node = graph.NewNode(); in TEST() local
98 ASSERT_TRUE(graph.AddConsumer(first_node->id, input->id).ok()); in TEST()
109 ASSERT_TRUE(ConnectTwoNodes(&graph, first_node, add_node, &temp).ok()); in TEST()
[all …]
|
| /external/tensorflow/tensorflow/lite/ |
| D | simple_memory_arena.cc | 49 int32_t first_node, int32_t last_node, in Allocate() argument
53 new_alloc->first_node = first_node; in Allocate()
69 if (alloc.last_node < first_node || alloc.first_node > last_node) { in Allocate()
|
| D | arena_planner.cc | 73 if (allocs_[i].first_node > node && allocs_[i].size > 0) { in ResetAllocationsAfter()
190 TfLiteStatus ArenaPlanner::ExecuteAllocations(int first_node, int last_node) { in ExecuteAllocations() argument
198 for (size_t i = first_node; i <= static_cast<size_t>(last_node) && in ExecuteAllocations()
212 TF_LITE_ENSURE_STATUS(CalculateAllocations(first_node, last_node)); in ExecuteAllocations()
270 std::vector<int32_t> ArenaPlanner::CreateTensorAllocationVector(int first_node, in CreateTensorAllocationVector() argument
301 if (alloc_node_[i] >= first_node && alloc_node_[i] <= last_node) { in CreateTensorAllocationVector()
311 TfLiteStatus ArenaPlanner::CalculateAllocations(int first_node, int last_node) { in CalculateAllocations() argument
314 CreateTensorAllocationVector(first_node, last_node); in CalculateAllocations()
|
| D | arena_planner.h | 62 TfLiteStatus ExecuteAllocations(int first_node, int last_node) override;
85 std::vector<int32_t> CreateTensorAllocationVector(int first_node,
90 TfLiteStatus CalculateAllocations(int first_node, int last_node);
|
| D | simple_memory_arena.h | 42 int32_t first_node; member
49 first_node = -1; in reset()
77 int32_t tensor, int32_t first_node, int32_t last_node,
|
| D | simple_planner.cc | 170 TfLiteStatus SimplePlanner::ExecuteAllocations(int first_node, int last_node) { in ExecuteAllocations() argument
175 for (size_t i = first_node; i <= static_cast<size_t>(last_node) && in ExecuteAllocations()
190 if (alloc_node_[i] >= first_node && alloc_node_[i] <= last_node) { in ExecuteAllocations()
|
| D | memory_planner.h | 37 virtual TfLiteStatus ExecuteAllocations(int first_node, int last_node) = 0;
|
| D | simple_memory_arena_debug_dump.cc | 148 alloc_info.tensor, alloc_info.first_node, in DumpArenaInfo()
177 if (node_id >= alloc_info.first_node && node_id <= alloc_info.last_node) { in DumpArenaInfo()
|
| /external/pytorch/torch/csrc/jit/passes/ |
| D | constant_pooling.cpp | 61 auto first_node = node->owningGraph()->block()->nodes().front(); in ConstantPooling() local
62 if (node != first_node) in ConstantPooling()
63 node->moveBefore(first_node); in ConstantPooling()
|
| /external/angle/third_party/spirv-tools/src/source/opt/ |
| D | instruction_list.cpp | 22 Instruction* first_node = list.front().get(); in InsertBefore() local
27 return iterator(first_node); in InsertBefore()
|
| /external/deqp-deps/SPIRV-Tools/source/opt/ |
| D | instruction_list.cpp | 22 Instruction* first_node = list.front().get(); in InsertBefore() local
27 return iterator(first_node); in InsertBefore()
|
| /external/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| D | instruction_list.cpp | 22 Instruction* first_node = list.front().get(); in InsertBefore() local
27 return iterator(first_node); in InsertBefore()
|
| /external/tensorflow/tensorflow/lite/testing/ |
| D | message.cc | 32 explicit MessageStack(Message* first_node) { in MessageStack() argument
33 nodes_.push(first_node); in MessageStack()
|
| /external/tensorflow/tensorflow/lite/testing/nnapi_tflite_zip_tests/ |
| D | message.cc | 34 explicit MessageStack(Message* first_node) { in MessageStack() argument
35 nodes_.push(first_node); in MessageStack()
|
| /external/angle/third_party/spirv-tools/src/source/util/ |
| D | ilist.h | 110 NodeType* first_node = list->sentinel_.next_node_; in MoveBefore() local
113 this->node_->previous_node_->next_node_ = first_node; in MoveBefore()
114 first_node->previous_node_ = this->node_->previous_node_; in MoveBefore()
122 return iterator(first_node); in MoveBefore()
|
| /external/deqp-deps/SPIRV-Tools/source/util/ |
| D | ilist.h | 110 NodeType* first_node = list->sentinel_.next_node_; in MoveBefore() local
113 this->node_->previous_node_->next_node_ = first_node; in MoveBefore()
114 first_node->previous_node_ = this->node_->previous_node_; in MoveBefore()
122 return iterator(first_node); in MoveBefore()
|
| /external/swiftshader/third_party/SPIRV-Tools/source/util/ |
| D | ilist.h | 110 NodeType* first_node = list->sentinel_.next_node_; in MoveBefore() local
113 this->node_->previous_node_->next_node_ = first_node; in MoveBefore()
114 first_node->previous_node_ = this->node_->previous_node_; in MoveBefore()
122 return iterator(first_node); in MoveBefore()
|
| /external/sdv/vsomeip/third_party/boost/property_tree/include/boost/property_tree/detail/ |
| D | xml_parser_read_rapidxml.hpp | 52 for (xml_node<Ch> *child = node->first_node(); in read_xml_node()
128 for (xml_node<Ch> *child = doc.first_node(); in read_xml_internal()
|
| D | rapidxml.hpp | 502 for (xml_node<Ch> *child = source->first_node(); child; child = child->next_sibling()) in clone_node()
920 … xml_node<Ch> *first_node(const Ch *n = 0, std::size_t nsize = 0, bool case_sensitive = true) const in first_node() function in boost::property_tree::detail::rapidxml::xml_node
1063 if (first_node()) in prepend_node()
1084 if (first_node()) in append_node()
1126 BOOST_ASSERT(first_node()); in remove_first_node()
1141 BOOST_ASSERT(first_node()); in remove_last_node()
1158 BOOST_ASSERT(first_node()); in remove_node()
1174 for (xml_node<Ch> *node = first_node(); node; node = node->m_next_sibling) in remove_all_nodes()
|
| /external/XNNPACK/src/xnnpack/ |
| D | memory-planner.h | 22 uint32_t first_node; member
|
| /external/linux-kselftest/tools/testing/selftests/vm/ |
| D | ksm_tests.c | 397 int first_node; in check_ksm_numa_merge() local
416 first_node = get_first_mem_node(); in check_ksm_numa_merge()
417 numa1_map_ptr = numa_alloc_onnode(page_size, first_node); in check_ksm_numa_merge()
418 numa2_map_ptr = numa_alloc_onnode(page_size, get_next_mem_node(first_node)); in check_ksm_numa_merge()
|