blob: 139675d10875045e90ead971c236876876dd054b [file] [log] [blame]
Moritz Pflanzer3ce3ff42017-07-21 17:41:02 +01001/*
Pablo Tello54e98d92019-02-05 16:16:19 +00002 * Copyright (c) 2017-2019 ARM Limited.
Moritz Pflanzer3ce3ff42017-07-21 17:41:02 +01003 *
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 "DepthConcatenateLayer.h"
25
Moritz Pflanzera09de0c2017-09-01 20:41:12 +010026#include "tests/validation/Helpers.h"
Moritz Pflanzer3ce3ff42017-07-21 17:41:02 +010027
28namespace arm_compute
29{
30namespace test
31{
32namespace validation
33{
34namespace reference
35{
36template <typename T>
Pablo Tello54e98d92019-02-05 16:16:19 +000037SimpleTensor<T> depthconcatenate_layer(const std::vector<SimpleTensor<T>> &srcs, SimpleTensor<T> &dst)
Moritz Pflanzer3ce3ff42017-07-21 17:41:02 +010038{
39 // Create reference
40 std::vector<TensorShape> shapes;
41
42 for(const auto &src : srcs)
43 {
44 shapes.emplace_back(src.shape());
45 }
46
Moritz Pflanzer3ce3ff42017-07-21 17:41:02 +010047 // Compute reference
Georgios Pinitasec96d6c2019-02-20 11:16:57 +000048 int depth_offset = 0;
49 const int width_out = dst.shape().x();
50 const int height_out = dst.shape().y();
51 const int depth_out = dst.shape().z();
52 const int out_stride_z = width_out * height_out;
53 const int batches = dst.shape().total_size_upper(3);
54 auto have_different_quantization_info = [&](const SimpleTensor<T> &tensor)
55 {
56 return tensor.quantization_info() != dst.quantization_info();
57 };
58 if(srcs[0].data_type() == DataType::QASYMM8 && std::any_of(srcs.cbegin(), srcs.cend(), have_different_quantization_info))
Pablo Tello5323de62019-02-11 17:03:15 +000059 {
Pablo Tello54d23762019-02-12 11:09:48 +000060 for(int b = 0; b < batches; ++b)
Pablo Tello5323de62019-02-11 17:03:15 +000061 {
Pablo Tello54d23762019-02-12 11:09:48 +000062 // input tensors can have smaller width and height than the output, so for each output's slice we need to requantize 0 (as this is the value
63 // used in NEFillBorderKernel by NEDepthConcatenateLayer) using the corresponding quantization info for that particular slice/input tensor.
64 int slice = 0;
65 for(const auto &src : srcs)
Pablo Tello5323de62019-02-11 17:03:15 +000066 {
Pablo Tello54d23762019-02-12 11:09:48 +000067 auto ptr_slice = static_cast<T *>(dst(Coordinates(0, 0, slice, b)));
68 const auto num_elems_in_slice((dst.num_elements() / depth_out) * src.shape().z());
69 std::transform(ptr_slice, ptr_slice + num_elems_in_slice, ptr_slice, [src, dst](T t)
70 {
71 return dst.quantization_info().quantize(src.quantization_info().dequantize(0), RoundingPolicy::TO_NEAREST_UP);
72 });
73 slice += src.shape().z();
74 }
Pablo Tello5323de62019-02-11 17:03:15 +000075 }
76 }
77 else
78 {
79 std::fill_n(dst.data(), dst.num_elements(), 0);
80 }
Moritz Pflanzer3ce3ff42017-07-21 17:41:02 +010081
82 for(const auto &src : srcs)
83 {
84 ARM_COMPUTE_ERROR_ON(depth_offset >= depth_out);
85 ARM_COMPUTE_ERROR_ON(batches != static_cast<int>(src.shape().total_size_upper(3)));
86
87 const int width = src.shape().x();
88 const int height = src.shape().y();
89 const int depth = src.shape().z();
90 const int x_diff = (width_out - width) / 2;
91 const int y_diff = (height_out - height) / 2;
92
93 const T *src_ptr = src.data();
94
95 for(int b = 0; b < batches; ++b)
96 {
97 const size_t offset_to_first_element = b * out_stride_z * depth_out + depth_offset * out_stride_z + y_diff * width_out + x_diff;
98
99 for(int d = 0; d < depth; ++d)
100 {
101 for(int r = 0; r < height; ++r)
102 {
Pablo Tello54e98d92019-02-05 16:16:19 +0000103 if(src.data_type() == DataType::QASYMM8 && src.quantization_info() != dst.quantization_info())
104 {
105 std::transform(src_ptr, src_ptr + width, dst.data() + offset_to_first_element + d * out_stride_z + r * width_out, [src, dst](T t)
106 {
107 const float dequantized_input = src.quantization_info().dequantize(t);
108 return dst.quantization_info().quantize(dequantized_input, RoundingPolicy::TO_NEAREST_UP);
109 });
110 src_ptr += width;
111 }
112 else
113 {
114 std::copy(src_ptr, src_ptr + width, dst.data() + offset_to_first_element + d * out_stride_z + r * width_out);
115 src_ptr += width;
116 }
Moritz Pflanzer3ce3ff42017-07-21 17:41:02 +0100117 }
118 }
119 }
120
121 depth_offset += depth;
122 }
123
124 return dst;
125}
126
Pablo Tello54e98d92019-02-05 16:16:19 +0000127template SimpleTensor<uint8_t> depthconcatenate_layer(const std::vector<SimpleTensor<uint8_t>> &srcs, SimpleTensor<uint8_t> &dst);
128template SimpleTensor<float> depthconcatenate_layer(const std::vector<SimpleTensor<float>> &srcs, SimpleTensor<float> &dst);
129template SimpleTensor<half> depthconcatenate_layer(const std::vector<SimpleTensor<half>> &srcs, SimpleTensor<half> &dst);
Moritz Pflanzer3ce3ff42017-07-21 17:41:02 +0100130} // namespace reference
131} // namespace validation
132} // namespace test
133} // namespace arm_compute