blob: e1ff46b023f86f8ccc06e18d96df3b7d8082bb1c [file] [log] [blame]
Laurent Carlier749294b2020-06-01 09:03:17 +01001//
telsoa014fcda012018-03-09 14:13:49 +00002// Copyright © 2017 Arm Ltd. All rights reserved.
David Beckecb56cd2018-09-05 12:52:57 +01003// SPDX-License-Identifier: MIT
telsoa014fcda012018-03-09 14:13:49 +00004//
5#pragma once
6
7#include <array>
Matthew Bentham47bfac42019-03-25 12:30:56 +00008#include <functional>
David Beckdcb751f2018-10-03 11:42:42 +01009#include <memory>
janeil01c4946c72019-11-07 09:32:28 +000010#include <stdint.h>
Jim Flynn44db7c32019-03-22 15:58:39 +000011#include "BackendId.hpp"
12#include "Exceptions.hpp"
Derek Lambertif90c56d2020-01-10 17:14:08 +000013#include "Deprecated.hpp"
telsoa014fcda012018-03-09 14:13:49 +000014
15namespace armnn
16{
17
Matthew Jacksondba634f2019-08-15 15:14:18 +010018constexpr unsigned int MaxNumOfTensorDimensions = 5U;
telsoa014fcda012018-03-09 14:13:49 +000019
Ryan OShea2bbfaa72020-02-12 16:15:27 +000020/// The lowest performance data capture interval we support is 10 miliseconds.
Colm Donelan02705242019-11-14 14:19:07 +000021constexpr unsigned int LOWEST_CAPTURE_PERIOD = 10000u;
22
telsoa014fcda012018-03-09 14:13:49 +000023/// @enum Status enumeration
24/// @var Status::Successful
25/// @var Status::Failure
26enum class Status
27{
28 Success = 0,
29 Failure = 1
30};
31
32enum class DataType
33{
telsoa01c577f2c2018-08-31 09:22:23 +010034 Float16 = 0,
ruoyan0120e984f2018-12-12 18:11:25 +000035 Float32 = 1,
Derek Lambertif90c56d2020-01-10 17:14:08 +000036 QAsymmU8 = 2,
ruoyan0120e984f2018-12-12 18:11:25 +000037 Signed32 = 3,
Nattapat Chaimanowongcd5ac232019-03-19 12:26:36 +000038 Boolean = 4,
Derek Lambertif90c56d2020-01-10 17:14:08 +000039 QSymmS16 = 5,
Derek Lambertid466a542020-01-22 15:37:29 +000040 QuantizedSymm8PerAxis ARMNN_DEPRECATED_ENUM_MSG("Per Axis property inferred by number of scales in TensorInfo") = 6,
Derek Lambertif90c56d2020-01-10 17:14:08 +000041 QSymmS8 = 7,
Ryan OShea9add1202020-02-07 10:06:33 +000042 QAsymmS8 = 8,
Narumol Prangnawaratc3bf6ef2020-02-28 12:45:21 +000043 BFloat16 = 9,
Inki Daed4619e22020-09-10 15:33:54 +090044 Signed64 = 10,
Derek Lambertif90c56d2020-01-10 17:14:08 +000045
Derek Lamberti41e92b02020-01-21 13:43:21 +000046 QuantisedAsymm8 ARMNN_DEPRECATED_ENUM_MSG("Use DataType::QAsymmU8 instead.") = QAsymmU8,
47 QuantisedSymm16 ARMNN_DEPRECATED_ENUM_MSG("Use DataType::QSymmS16 instead.") = QSymmS16
telsoa014fcda012018-03-09 14:13:49 +000048};
49
Derek Lamberti0cff1632018-09-18 16:02:25 +010050enum class DataLayout
51{
52 NCHW = 1,
53 NHWC = 2
54};
55
telsoa014fcda012018-03-09 14:13:49 +000056enum class ActivationFunction
57{
58 Sigmoid = 0,
59 TanH = 1,
60 Linear = 2,
61 ReLu = 3,
Colm Donelan03fbeaf2020-02-26 15:39:23 +000062 BoundedReLu = 4, ///< min(a, max(b, input)) ReLu1 & ReLu6.
telsoa014fcda012018-03-09 14:13:49 +000063 SoftReLu = 5,
64 LeakyReLu = 6,
65 Abs = 7,
66 Sqrt = 8,
David Monahan3b3c3812020-02-25 09:03:29 +000067 Square = 9,
Colm Donelan03fbeaf2020-02-26 15:39:23 +000068 Elu = 10,
69 HardSwish = 11
telsoa014fcda012018-03-09 14:13:49 +000070};
71
Narumol Prangnawarat8d001d42019-09-09 15:01:18 +010072enum class ArgMinMaxFunction
73{
74 Min = 0,
75 Max = 1
76};
77
Aron Virginas-Tar77bfb5e2019-10-16 17:45:38 +010078enum class ComparisonOperation
79{
80 Equal = 0,
81 Greater = 1,
82 GreaterOrEqual = 2,
83 Less = 3,
84 LessOrEqual = 4,
85 NotEqual = 5
86};
87
James Conroyaba90cd2020-11-06 16:28:18 +000088enum class LogicalBinaryOperation
89{
90 LogicalAnd = 0,
91 LogicalOr = 1
92};
93
josh minor4a3c6102020-01-06 16:40:46 -060094enum class UnaryOperation
95{
James Conroyaba90cd2020-11-06 16:28:18 +000096 Abs = 0,
97 Exp = 1,
98 Sqrt = 2,
99 Rsqrt = 3,
100 Neg = 4,
101 LogicalNot = 5
josh minor4a3c6102020-01-06 16:40:46 -0600102};
103
telsoa014fcda012018-03-09 14:13:49 +0000104enum class PoolingAlgorithm
105{
106 Max = 0,
107 Average = 1,
108 L2 = 2
109};
110
Sadik Armagan0c3ea5b2021-02-03 09:29:30 +0000111enum class ReduceOperation
112{
113 Sum = 0,
114 Max = 1,
115 Mean = 2,
116 Min = 3
117};
118
Teresa Charlina9075df2019-06-27 15:41:57 +0100119enum class ResizeMethod
120{
121 Bilinear = 0,
122 NearestNeighbor = 1
123};
124
Teresa Charlin11f6ace2020-06-23 18:30:57 +0100125enum class Dimensionality
126{
127 NotSpecified = 0,
128 Specified = 1,
129 Scalar = 2
130};
131
telsoa014fcda012018-03-09 14:13:49 +0000132///
133/// The padding method modifies the output of pooling layers.
134/// In both supported methods, the values are ignored (they are
telsoa01c577f2c2018-08-31 09:22:23 +0100135/// not even zeroes, which would make a difference for max pooling
telsoa014fcda012018-03-09 14:13:49 +0000136/// a tensor with negative values). The difference between
telsoa01c577f2c2018-08-31 09:22:23 +0100137/// IgnoreValue and Exclude is that the former counts the padding
telsoa014fcda012018-03-09 14:13:49 +0000138/// fields in the divisor of Average and L2 pooling, while
139/// Exclude does not.
140///
141enum class PaddingMethod
142{
telsoa01c577f2c2018-08-31 09:22:23 +0100143 /// The padding fields count, but are ignored
David Beckdcb751f2018-10-03 11:42:42 +0100144 IgnoreValue = 0,
telsoa01c577f2c2018-08-31 09:22:23 +0100145 /// The padding fields don't count and are ignored
David Beckdcb751f2018-10-03 11:42:42 +0100146 Exclude = 1
telsoa014fcda012018-03-09 14:13:49 +0000147};
148
149enum class NormalizationAlgorithmChannel
150{
151 Across = 0,
152 Within = 1
153};
154
155enum class NormalizationAlgorithmMethod
156{
David Beckdcb751f2018-10-03 11:42:42 +0100157 /// Krichevsky 2012: Local Brightness Normalization
158 LocalBrightness = 0,
159 /// Jarret 2009: Local Contrast Normalization
telsoa01c577f2c2018-08-31 09:22:23 +0100160 LocalContrast = 1
telsoa014fcda012018-03-09 14:13:49 +0000161};
162
163enum class OutputShapeRounding
164{
165 Floor = 0,
166 Ceiling = 1
167};
168
Teresa Charlincdc01492020-06-09 18:00:20 +0100169///
170/// The ShapeInferenceMethod modify how the output shapes are treated.
171/// When ValidateOnly is selected, the output shapes are inferred from the input parameters of the layer
172/// and any mismatch is reported.
173/// When InferAndValidate is selected 2 actions must be performed: (1)infer output shape from inputs and (2)validate the
174/// shapes as in ValidateOnly. This option has been added to work with tensors which rank or dimension sizes are not
175/// specified explicitly, however this information can be calculated from the inputs.
176///
177enum class ShapeInferenceMethod
178{
179 /// Validate all output shapes
180 ValidateOnly = 0,
181 /// Infer missing output shapes and validate all output shapes
182 InferAndValidate = 1
183};
184
David Beck9efb57d2018-11-05 13:40:33 +0000185/// Each backend should implement an IBackend.
186class IBackend
187{
188protected:
189 IBackend() {}
190 virtual ~IBackend() {}
191
192public:
193 virtual const BackendId& GetId() const = 0;
194};
195
196using IBackendSharedPtr = std::shared_ptr<IBackend>;
197using IBackendUniquePtr = std::unique_ptr<IBackend, void(*)(IBackend* backend)>;
198
David Beckdcb751f2018-10-03 11:42:42 +0100199/// Device specific knowledge to be passed to the optimizer.
telsoa01c577f2c2018-08-31 09:22:23 +0100200class IDeviceSpec
telsoa014fcda012018-03-09 14:13:49 +0000201{
telsoa01c577f2c2018-08-31 09:22:23 +0100202protected:
Matteo Martincigh9c5d33a2019-02-07 17:52:41 +0000203 IDeviceSpec() {}
204 virtual ~IDeviceSpec() {}
Narumol Prangnawarat87106762019-05-03 15:54:39 +0100205public:
206 virtual const BackendIdSet& GetSupportedBackends() const = 0;
telsoa014fcda012018-03-09 14:13:49 +0000207};
208
209/// Type of identifiers for bindable layers (inputs, outputs).
210using LayerBindingId = int;
211
212class PermutationVector
213{
214public:
215 using ValueType = unsigned int;
216 using SizeType = unsigned int;
217 using ArrayType = std::array<ValueType, MaxNumOfTensorDimensions>;
218 using ConstIterator = typename ArrayType::const_iterator;
219
telsoa01c577f2c2018-08-31 09:22:23 +0100220 /// @param dimMappings - Indicates how to translate tensor elements from a given source into the target destination,
telsoa014fcda012018-03-09 14:13:49 +0000221 /// when source and target potentially have different memory layouts.
222 ///
telsoa01c577f2c2018-08-31 09:22:23 +0100223 /// E.g. For a 4-d tensor laid out in a memory with the format (Batch Element, Height, Width, Channels),
telsoa014fcda012018-03-09 14:13:49 +0000224 /// which is to be passed as an input to ArmNN, each source dimension is mapped to the corresponding
225 /// ArmNN dimension. The Batch dimension remains the same (0 -> 0). The source Height dimension is mapped
226 /// to the location of the ArmNN Height dimension (1 -> 2). Similar arguments are made for the Width and
227 /// Channels (2 -> 3 and 3 -> 1). This will lead to @ref m_DimMappings pointing to the following array:
228 /// [ 0, 2, 3, 1 ].
229 ///
230 /// Note that the mapping should be reversed if considering the case of ArmNN 4-d outputs (Batch Element,
231 /// Channels, Height, Width) being written to a destination with the format mentioned above. We now have
232 /// 0 -> 0, 2 -> 1, 3 -> 2, 1 -> 3, which, when reordered, lead to the following @ref m_DimMappings contents:
233 /// [ 0, 3, 1, 2 ].
234 ///
235 PermutationVector(const ValueType *dimMappings, SizeType numDimMappings);
236
237 PermutationVector(std::initializer_list<ValueType> dimMappings);
238
239 ValueType operator[](SizeType i) const { return m_DimMappings.at(i); }
240
241 SizeType GetSize() const { return m_NumDimMappings; }
242
243 ConstIterator begin() const { return m_DimMappings.begin(); }
244 ConstIterator end() const { return m_DimMappings.end(); }
245
246 bool IsEqual(const PermutationVector& other) const
247 {
Matthew Jacksondba634f2019-08-15 15:14:18 +0100248 if (m_NumDimMappings != other.m_NumDimMappings) return false;
249 for (unsigned int i = 0; i < m_NumDimMappings; ++i)
250 {
251 if (m_DimMappings[i] != other.m_DimMappings[i]) return false;
252 }
253 return true;
telsoa014fcda012018-03-09 14:13:49 +0000254 }
255
256 bool IsInverse(const PermutationVector& other) const
257 {
258 bool isInverse = (GetSize() == other.GetSize());
259 for (SizeType i = 0; isInverse && (i < GetSize()); ++i)
260 {
261 isInverse = (m_DimMappings[other.m_DimMappings[i]] == i);
262 }
263 return isInverse;
264 }
265
266private:
267 ArrayType m_DimMappings;
268 /// Number of valid entries in @ref m_DimMappings
269 SizeType m_NumDimMappings;
270};
271
janeil013fec1ea2019-11-07 09:47:20 +0000272namespace profiling { class ProfilingGuid; }
273
telsoa01c577f2c2018-08-31 09:22:23 +0100274/// Define LayerGuid type.
janeil013fec1ea2019-11-07 09:47:20 +0000275using LayerGuid = profiling::ProfilingGuid;
surmeh01bceff2f2018-03-29 16:29:27 +0100276
Nattapat Chaimanowong6e948202019-03-22 14:01:46 +0000277class ITensorHandle;
278
Nattapat Chaimanowong317cae52019-03-28 10:29:12 +0000279/// Define the type of callback for the Debug layer to call
280/// @param guid - guid of layer connected to the input of the Debug layer
281/// @param slotIndex - index of the output slot connected to the input of the Debug layer
282/// @param tensorHandle - TensorHandle for the input tensor to the Debug layer
283using DebugCallbackFunction = std::function<void(LayerGuid guid, unsigned int slotIndex, ITensorHandle* tensorHandle)>;
Nattapat Chaimanowong6e948202019-03-22 14:01:46 +0000284
janeil01c4946c72019-11-07 09:32:28 +0000285
286namespace profiling
287{
288
Narumol Prangnawaratdbdd1b42019-11-15 17:38:44 +0000289static constexpr uint64_t MIN_STATIC_GUID = 1llu << 63;
290
janeil01c4946c72019-11-07 09:32:28 +0000291class ProfilingGuid
292{
293public:
Sadik Armagan3184c902020-03-18 10:57:30 +0000294 ProfilingGuid() : m_Guid(0) {}
295
janeil01c4946c72019-11-07 09:32:28 +0000296 ProfilingGuid(uint64_t guid) : m_Guid(guid) {}
297
298 operator uint64_t() const { return m_Guid; }
299
300 bool operator==(const ProfilingGuid& other) const
301 {
302 return m_Guid == other.m_Guid;
303 }
304
305 bool operator!=(const ProfilingGuid& other) const
306 {
307 return m_Guid != other.m_Guid;
308 }
309
310 bool operator<(const ProfilingGuid& other) const
311 {
312 return m_Guid < other.m_Guid;
313 }
314
315 bool operator<=(const ProfilingGuid& other) const
316 {
317 return m_Guid <= other.m_Guid;
318 }
319
320 bool operator>(const ProfilingGuid& other) const
321 {
322 return m_Guid > other.m_Guid;
323 }
324
325 bool operator>=(const ProfilingGuid& other) const
326 {
327 return m_Guid >= other.m_Guid;
328 }
329
330protected:
331 uint64_t m_Guid;
332};
333
334/// Strongly typed guids to distinguish between those generated at runtime, and those that are statically defined.
335struct ProfilingDynamicGuid : public ProfilingGuid
336{
337 using ProfilingGuid::ProfilingGuid;
338};
339
340struct ProfilingStaticGuid : public ProfilingGuid
341{
342 using ProfilingGuid::ProfilingGuid;
343};
344
345} // namespace profiling
346
Finn Williamsb454c5c2021-02-09 15:56:23 +0000347/// This list uses X macro technique.
348/// See https://en.wikipedia.org/wiki/X_Macro for more info
349#define LIST_OF_LAYER_TYPE \
350 X(Activation) \
351 X(Addition) \
352 X(ArgMinMax) \
353 X(BatchNormalization) \
354 X(BatchToSpaceNd) \
355 X(Comparison) \
356 X(Concat) \
357 X(Constant) \
358 X(ConvertBf16ToFp32) \
359 X(ConvertFp16ToFp32) \
360 X(ConvertFp32ToBf16) \
361 X(ConvertFp32ToFp16) \
362 X(Convolution2d) \
363 X(Debug) \
364 X(DepthToSpace) \
365 X(DepthwiseConvolution2d) \
366 X(Dequantize) \
367 X(DetectionPostProcess) \
368 X(Division) \
369 X(ElementwiseUnary) \
370 X(FakeQuantization) \
371 X(Fill) \
372 X(Floor) \
373 X(FullyConnected) \
374 X(Gather) \
375 X(Input) \
376 X(InstanceNormalization) \
377 X(L2Normalization) \
378 X(LogicalBinary) \
379 X(LogSoftmax) \
380 X(Lstm) \
381 X(QLstm) \
382 X(Map) \
383 X(Maximum) \
384 X(Mean) \
385 X(MemCopy) \
386 X(MemImport) \
387 X(Merge) \
388 X(Minimum) \
389 X(Multiplication) \
390 X(Normalization) \
391 X(Output) \
392 X(Pad) \
393 X(Permute) \
394 X(Pooling2d) \
395 X(PreCompiled) \
396 X(Prelu) \
397 X(Quantize) \
398 X(QuantizedLstm) \
399 X(Reshape) \
400 X(Rank) \
401 X(Resize) \
402 X(Reduce) \
403 X(Slice) \
404 X(Softmax) \
405 X(SpaceToBatchNd) \
406 X(SpaceToDepth) \
407 X(Splitter) \
408 X(Stack) \
409 X(StandIn) \
410 X(StridedSlice) \
411 X(Subtraction) \
412 X(Switch) \
413 X(Transpose) \
414 X(TransposeConvolution2d) \
415 X(Unmap)
416
417/// When adding a new layer, adapt also the LastLayer enum value in the
418/// enum class LayerType below
419enum class LayerType
420{
421#define X(name) name,
422 LIST_OF_LAYER_TYPE
423#undef X
424 FirstLayer = Activation,
425 LastLayer = Unmap
426};
427
428const char* GetLayerTypeAsCString(LayerType type);
429
David Beck9df2d952018-10-10 15:11:44 +0100430} // namespace armnn
janeil01c4946c72019-11-07 09:32:28 +0000431
432
433namespace std
434{
Ryan OShea2bbfaa72020-02-12 16:15:27 +0000435/// make ProfilingGuid hashable
janeil01c4946c72019-11-07 09:32:28 +0000436template<>
437struct hash<armnn::profiling::ProfilingGuid>
438{
439 std::size_t operator()(armnn::profiling::ProfilingGuid const& guid) const noexcept
440 {
441 return hash<uint64_t>()(uint64_t(guid));
442 }
443};
444
Ryan OShea2bbfaa72020-02-12 16:15:27 +0000445/// make ProfilingDynamicGuid hashable
janeil01c4946c72019-11-07 09:32:28 +0000446template<>
447struct hash<armnn::profiling::ProfilingDynamicGuid>
448{
449 std::size_t operator()(armnn::profiling::ProfilingDynamicGuid const& guid) const noexcept
450 {
451 return hash<uint64_t>()(uint64_t(guid));
452 }
453};
454
Ryan OShea2bbfaa72020-02-12 16:15:27 +0000455/// make ProfilingStaticGuid hashable
janeil01c4946c72019-11-07 09:32:28 +0000456template<>
457struct hash<armnn::profiling::ProfilingStaticGuid>
458{
459 std::size_t operator()(armnn::profiling::ProfilingStaticGuid const& guid) const noexcept
460 {
461 return hash<uint64_t>()(uint64_t(guid));
462 }
463};
janeil013fec1ea2019-11-07 09:47:20 +0000464} // namespace std