blob: 5570ecfc7993105dfc0eadf2575230f453f26e4c [file] [log] [blame]
Georgios Pinitas7900a9e2018-11-23 11:44:58 +00001/*
Michalis Spyroubcfd09a2019-05-01 13:03:59 +01002 * Copyright (c) 2018-2019 ARM Limited.
Georgios Pinitas7900a9e2018-11-23 11:44:58 +00003 *
4 * SPDX-License-Identifier: MIT
5 *
6 * Permission is hereby granted, free of charge, to any person obtaining a copy
7 * of this software and associated documentation files (the "Software"), to
8 * deal in the Software without restriction, including without limitation the
9 * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
10 * sell copies of the Software, and to permit persons to whom the Software is
11 * furnished to do so, subject to the following conditions:
12 *
13 * The above copyright notice and this permission notice shall be included in all
14 * copies or substantial portions of the Software.
15 *
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
19 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
20 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
21 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
22 * SOFTWARE.
23 */
24#include "arm_compute/core/CL/kernels/CLComparisonKernel.h"
25
26#include "arm_compute/core/CL/CLHelpers.h"
27#include "arm_compute/core/CL/CLValidate.h"
28#include "arm_compute/core/CL/ICLTensor.h"
29
30#include <map>
31
32namespace arm_compute
33{
34namespace
35{
36// Create supported comparisons map
37const std::map<ComparisonOperation, std::string> supported_comparison_ops =
38{
39 { ComparisonOperation::Equal, "EQUAL" },
40 { ComparisonOperation::NotEqual, "NOTEQUAL" },
41 { ComparisonOperation::Greater, "GREATER" },
42 { ComparisonOperation::GreaterEqual, "GREATEREQUAL" },
43 { ComparisonOperation::Less, "LESS" },
44 { ComparisonOperation::LessEqual, "LESSEQUAL" },
45};
46
47int calculate_num_elems_processed_per_iteration(const ITensorInfo &input)
48{
49 return 16 / input.element_size();
50}
51
52Status validate_arguments(const ITensorInfo &input1, const ITensorInfo &input2, const ITensorInfo &output, ComparisonOperation operation)
53{
54 ARM_COMPUTE_RETURN_ERROR_ON_F16_UNSUPPORTED(&input1);
55 ARM_COMPUTE_RETURN_ERROR_ON_DATA_TYPE_CHANNEL_NOT_IN(&input1,
56 1,
57 DataType::U8, DataType::S8, DataType::QASYMM8,
58 DataType::U16, DataType::S16,
59 DataType::U32, DataType::S32,
60 DataType::F16, DataType::F32);
61 ARM_COMPUTE_RETURN_ERROR_ON_MISMATCHING_DATA_TYPES(&input1, &input2);
62 ARM_COMPUTE_RETURN_ERROR_ON(supported_comparison_ops.count(operation) == 0);
63
64 const TensorShape out_shape = TensorShape::broadcast_shape(input1.tensor_shape(), input2.tensor_shape());
65 ARM_COMPUTE_RETURN_ERROR_ON_MSG(out_shape.total_size() == 0, "Inputs are not broadcast compatible");
66
67 // Validate in case of configured output
68 if(output.total_size() > 0)
69 {
70 ARM_COMPUTE_RETURN_ERROR_ON_DATA_TYPE_CHANNEL_NOT_IN(&output, 1, DataType::U8);
71 ARM_COMPUTE_RETURN_ERROR_ON_MSG(detail::have_different_dimensions(out_shape, output.tensor_shape(), 0),
72 "Wrong shape for output");
73 }
74
75 return Status{};
76}
77
78std::pair<Status, Window> validate_and_configure_window(ITensorInfo &input1, ITensorInfo &input2, ITensorInfo &output)
79{
80 const std::pair<TensorShape, ValidRegion> broadcast_pair = ITensorInfo::broadcast_shape_and_valid_region(input1, input2);
81 const TensorShape &out_shape = broadcast_pair.first;
82 const ValidRegion &valid_region = broadcast_pair.second;
83
84 const unsigned int num_elems_processed_per_iteration = calculate_num_elems_processed_per_iteration(input1);
85
86 // Auto initialize output if not initialized
87 auto_init_if_empty(output, out_shape, 1, DataType::U8, QuantizationInfo());
88
89 Window win = calculate_max_window(valid_region, Steps(num_elems_processed_per_iteration));
90 Window win_input1 = win.broadcast_if_dimension_le_one(input1);
91 Window win_input2 = win.broadcast_if_dimension_le_one(input2);
92
93 AccessWindowHorizontal input1_access(&input1, 0, num_elems_processed_per_iteration);
94 AccessWindowHorizontal input2_access(&input2, 0, num_elems_processed_per_iteration);
95 AccessWindowHorizontal output_access(&output, 0, num_elems_processed_per_iteration);
96
97 bool window_changed = update_window_and_padding(win_input1, input1_access)
98 || update_window_and_padding(win_input2, input2_access)
99 || update_window_and_padding(win, output_access);
100
101 output_access.set_valid_region(win, valid_region);
102
103 Status err = (window_changed) ? ARM_COMPUTE_CREATE_ERROR(ErrorCode::RUNTIME_ERROR, "Insufficient Padding!") : Status{};
104 return std::make_pair(err, win);
105}
106} // namespace
107
108CLComparisonKernel::CLComparisonKernel()
109 : _input1(nullptr), _input2(nullptr), _output(nullptr)
110{
111}
112
113void CLComparisonKernel::configure(const ICLTensor *input1, const ICLTensor *input2, ICLTensor *output, ComparisonOperation operation)
114{
115 ARM_COMPUTE_ERROR_ON_NULLPTR(input1, input2, output);
116 ARM_COMPUTE_ERROR_THROW_ON(validate_arguments(*input1->info(), *input2->info(), *output->info(), operation));
117
118 // Configure kernel window
119 auto win_config = validate_and_configure_window(*input1->info(), *input2->info(), *output->info());
120 ARM_COMPUTE_ERROR_THROW_ON(win_config.first);
121
122 _input1 = input1;
123 _input2 = input2;
124 _output = output;
125
126 const std::string &operation_name = supported_comparison_ops.at(operation);
127 std::string kernel_name = "compare_" + lower_string(operation_name);
128
129 // Set kernel build options
130 std::set<std::string> build_opts;
131 build_opts.emplace("-DDATA_TYPE=" + get_cl_type_from_data_type(input1->info()->data_type()));
132 build_opts.emplace("-DVEC_SIZE=" + support::cpp11::to_string(calculate_num_elems_processed_per_iteration(*input1->info())));
133 build_opts.emplace("-DOP=" + operation_name);
134 build_opts.emplace("-DOP_NAME=" + lower_string(operation_name));
135 if(is_data_type_quantized_asymmetric(input1->info()->data_type()))
136 {
Georgios Pinitas4c5469b2019-05-21 13:32:43 +0100137 const UniformQuantizationInfo iq1_info = input1->info()->quantization_info().uniform();
138 const UniformQuantizationInfo iq2_info = input2->info()->quantization_info().uniform();
139
140 build_opts.emplace("-DOFFSET_IN1=" + support::cpp11::to_string(iq1_info.offset));
141 build_opts.emplace("-DOFFSET_IN2=" + support::cpp11::to_string(iq2_info.offset));
142 build_opts.emplace("-DSCALE_IN1=" + float_to_string_with_full_precision(iq1_info.scale));
143 build_opts.emplace("-DSCALE_IN2=" + float_to_string_with_full_precision(iq2_info.scale));
Georgios Pinitas7900a9e2018-11-23 11:44:58 +0000144 kernel_name += "_quantized";
145 }
146
147 // Create kernel
148 _kernel = static_cast<cl::Kernel>(CLKernelLibrary::get().create_kernel(kernel_name, build_opts));
149
150 ICLKernel::configure_internal(win_config.second);
151
152 // Set config_id for enabling LWS tuning
153 _config_id = kernel_name;
154 _config_id += "_";
155 _config_id += lower_string(string_from_data_type(input1->info()->data_type()));
156 _config_id += "_";
157 _config_id += support::cpp11::to_string(output->info()->dimension(0));
158 _config_id += "_";
159 _config_id += support::cpp11::to_string(output->info()->dimension(1));
160 _config_id += lower_string(string_from_data_layout(input1->info()->data_layout()));
161}
162
163Status CLComparisonKernel::validate(const ITensorInfo *input1, const ITensorInfo *input2, const ITensorInfo *output, ComparisonOperation operation)
164{
165 ARM_COMPUTE_RETURN_ERROR_ON_NULLPTR(input1, input2, output);
166
167 ARM_COMPUTE_RETURN_ON_ERROR(validate_arguments(*input1, *input2, *output, operation));
168 ARM_COMPUTE_RETURN_ON_ERROR(validate_and_configure_window(*input1->clone(), *input2->clone(), *output->clone()).first);
169
170 return Status{};
171}
172
173void CLComparisonKernel::run(const Window &window, cl::CommandQueue &queue)
174{
175 ARM_COMPUTE_ERROR_ON_UNCONFIGURED_KERNEL(this);
176 ARM_COMPUTE_ERROR_ON_INVALID_SUBWINDOW(ICLKernel::window(), window);
177
178 const TensorShape &in_shape1 = _input1->info()->tensor_shape();
179 const TensorShape &in_shape2 = _input2->info()->tensor_shape();
180 const TensorShape &out_shape = _output->info()->tensor_shape();
181
182 bool can_collapse = true;
183 const bool is_vector = in_shape1.num_dimensions() == 1 || in_shape2.num_dimensions() == 1;
184 if(std::min(in_shape1.total_size(), in_shape2.total_size()) > 1 && !is_vector)
185 {
186 can_collapse = (std::min(in_shape1.num_dimensions(), in_shape2.num_dimensions()) > Window::DimZ);
187 for(size_t d = Window::DimZ; can_collapse && (d < out_shape.num_dimensions()); d++)
188 {
189 can_collapse = (in_shape1[d] == in_shape2[d]);
190 }
191 }
192
193 bool has_collapsed = false;
194 Window collapsed = can_collapse ? window.collapse_if_possible(ICLKernel::window(), Window::DimZ, &has_collapsed) : window;
195
196 const TensorShape &in_shape1_collapsed = has_collapsed ? in_shape1.collapsed_from(Window::DimZ) : in_shape1;
197 const TensorShape &in_shape2_collapsed = has_collapsed ? in_shape2.collapsed_from(Window::DimZ) : in_shape2;
198
199 Window slice = collapsed.first_slice_window_3D();
200 Window slice_input1 = slice.broadcast_if_dimension_le_one(in_shape1_collapsed);
201 Window slice_input2 = slice.broadcast_if_dimension_le_one(in_shape2_collapsed);
202
203 do
204 {
205 unsigned int idx = 0;
206
207 add_3D_tensor_argument(idx, _input1, slice_input1);
208 add_3D_tensor_argument(idx, _input2, slice_input2);
209 add_3D_tensor_argument(idx, _output, slice);
210
211 enqueue(queue, *this, slice, lws_hint());
212
Michalis Spyrouebdde652019-07-08 11:52:46 +0100213 ARM_COMPUTE_UNUSED(collapsed.slide_window_slice_3D(slice_input1));
214 ARM_COMPUTE_UNUSED(collapsed.slide_window_slice_3D(slice_input2));
Georgios Pinitas7900a9e2018-11-23 11:44:58 +0000215 }
216 while(collapsed.slide_window_slice_3D(slice));
217}
218
219BorderSize CLComparisonKernel::border_size() const
220{
221 const int num_elems_processed_per_iteration = calculate_num_elems_processed_per_iteration(*_input1->info());
222
223 const unsigned int replicateSize = _output->info()->dimension(0) - std::min(_input1->info()->dimension(0), _input2->info()->dimension(0));
224 const unsigned int border = std::min<unsigned int>(num_elems_processed_per_iteration - 1U, replicateSize);
Michalis Spyroubcfd09a2019-05-01 13:03:59 +0100225 return BorderSize{ 0, border, 0, 0 };
Georgios Pinitas7900a9e2018-11-23 11:44:58 +0000226}
227} // namespace arm_compute