• Home
  • Raw
  • Download

Lines Matching +full:- +full:- +full:input_dims

3 // This source code is licensed under the BSD-style license found in the
16 #include <xnnpack/node-type.h>
38 input_dims = RandomShape(4); in GlobalAveragePooling2DTest()
39 output_dims = {input_dims[0], 1, 1, input_dims[3]}; in GlobalAveragePooling2DTest()
40 input = std::vector<T>(XNN_EXTRA_BYTES / sizeof(T) + NumElements(input_dims)); in GlobalAveragePooling2DTest()
43 batch_size = input_dims[0]; in GlobalAveragePooling2DTest()
44 input_width = input_dims[1] * input_dims[2]; in GlobalAveragePooling2DTest()
45 channels = input_dims[3]; in GlobalAveragePooling2DTest()
69 float output_min = -std::numeric_limits<float>::infinity();
75 std::vector<size_t> input_dims; member in GlobalAveragePooling2DTest
98 … subgraph, xnn_datatype_qint8, 0, 1.0f, input_dims.size(), input_dims.data(), nullptr, in TEST_F()
113 ASSERT_EQ(subgraph->num_nodes, 1); in TEST_F()
114 const struct xnn_node* node = &subgraph->nodes[0]; in TEST_F()
115 ASSERT_EQ(node->type, xnn_node_type_global_average_pooling_2d); in TEST_F()
116 ASSERT_EQ(node->compute_type, xnn_compute_type_qs8); in TEST_F()
117 ASSERT_EQ(node->activation.output_min, output_min); in TEST_F()
118 ASSERT_EQ(node->activation.output_max, output_max); in TEST_F()
119 ASSERT_EQ(node->num_inputs, 1); in TEST_F()
120 ASSERT_EQ(node->inputs[0], input_id); in TEST_F()
121 ASSERT_EQ(node->num_outputs, 1); in TEST_F()
122 ASSERT_EQ(node->outputs[0], output_id); in TEST_F()
123 ASSERT_EQ(node->flags, 0); in TEST_F()
137 … subgraph, xnn_datatype_quint8, 0, 1.0f, input_dims.size(), input_dims.data(), nullptr, in TEST_F()
152 ASSERT_EQ(subgraph->num_nodes, 1); in TEST_F()
153 const struct xnn_node* node = &subgraph->nodes[0]; in TEST_F()
154 ASSERT_EQ(node->type, xnn_node_type_global_average_pooling_2d); in TEST_F()
155 ASSERT_EQ(node->compute_type, xnn_compute_type_qu8); in TEST_F()
156 ASSERT_EQ(node->activation.output_min, output_min); in TEST_F()
157 ASSERT_EQ(node->activation.output_max, output_max); in TEST_F()
158 ASSERT_EQ(node->num_inputs, 1); in TEST_F()
159 ASSERT_EQ(node->inputs[0], input_id); in TEST_F()
160 ASSERT_EQ(node->num_outputs, 1); in TEST_F()
161 ASSERT_EQ(node->outputs[0], output_id); in TEST_F()
162 ASSERT_EQ(node->flags, 0); in TEST_F()
176 … subgraph, xnn_datatype_fp32, input_dims.size(), input_dims.data(), nullptr, in TEST_F()
191 ASSERT_EQ(subgraph->num_nodes, 1); in TEST_F()
192 const struct xnn_node* node = &subgraph->nodes[0]; in TEST_F()
193 ASSERT_EQ(node->type, xnn_node_type_global_average_pooling_2d); in TEST_F()
194 ASSERT_EQ(node->compute_type, xnn_compute_type_fp32); in TEST_F()
195 ASSERT_EQ(node->activation.output_min, output_min); in TEST_F()
196 ASSERT_EQ(node->activation.output_max, output_max); in TEST_F()
197 ASSERT_EQ(node->num_inputs, 1); in TEST_F()
198 ASSERT_EQ(node->inputs[0], input_id); in TEST_F()
199 ASSERT_EQ(node->num_outputs, 1); in TEST_F()
200 ASSERT_EQ(node->outputs[0], output_id); in TEST_F()
201 ASSERT_EQ(node->flags, 0); in TEST_F()
243 …subgraph, xnn_datatype_qint8, input_zero_point, input_scale, input_dims.size(), input_dims.data(),… in TEST_F()
310 …subgraph, xnn_datatype_quint8, input_zero_point, input_scale, input_dims.size(), input_dims.data()… in TEST_F()
375 … subgraph, xnn_datatype_fp32, input_dims.size(), input_dims.data(), nullptr, in TEST_F()