blob: 5e00026eba8af75c5f3a7e4a5e6943c797db78d1 [file] [log] [blame]
Laurent Carlier749294b2020-06-01 09:03:17 +01001//
Teresa Charlin50de4fa2021-05-31 18:47:33 +01002// Copyright © 2017 Arm Ltd and Contributors. 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>
janeil01c4946c72019-11-07 09:32:28 +00009#include <stdint.h>
Keith Davise813d672021-04-22 10:10:34 +010010#include <chrono>
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
Keith Davise813d672021-04-22 10:10:34 +010023/// Variable to control expire rate of priority queue
24constexpr unsigned int EXPIRE_RATE = 3U;
25
telsoa014fcda012018-03-09 14:13:49 +000026/// @enum Status enumeration
27/// @var Status::Successful
28/// @var Status::Failure
29enum class Status
30{
31 Success = 0,
32 Failure = 1
33};
34
35enum class DataType
36{
Keith Davise813d672021-04-22 10:10:34 +010037 Float16 = 0,
38 Float32 = 1,
Derek Lambertif90c56d2020-01-10 17:14:08 +000039 QAsymmU8 = 2,
ruoyan0120e984f2018-12-12 18:11:25 +000040 Signed32 = 3,
Keith Davise813d672021-04-22 10:10:34 +010041 Boolean = 4,
Derek Lambertif90c56d2020-01-10 17:14:08 +000042 QSymmS16 = 5,
Derek Lambertid466a542020-01-22 15:37:29 +000043 QuantizedSymm8PerAxis ARMNN_DEPRECATED_ENUM_MSG("Per Axis property inferred by number of scales in TensorInfo") = 6,
Keith Davise813d672021-04-22 10:10:34 +010044 QSymmS8 = 7,
Ryan OShea9add1202020-02-07 10:06:33 +000045 QAsymmS8 = 8,
Narumol Prangnawaratc3bf6ef2020-02-28 12:45:21 +000046 BFloat16 = 9,
Inki Daed4619e22020-09-10 15:33:54 +090047 Signed64 = 10,
Derek Lambertif90c56d2020-01-10 17:14:08 +000048
Derek Lamberti41e92b02020-01-21 13:43:21 +000049 QuantisedAsymm8 ARMNN_DEPRECATED_ENUM_MSG("Use DataType::QAsymmU8 instead.") = QAsymmU8,
50 QuantisedSymm16 ARMNN_DEPRECATED_ENUM_MSG("Use DataType::QSymmS16 instead.") = QSymmS16
telsoa014fcda012018-03-09 14:13:49 +000051};
52
Derek Lamberti0cff1632018-09-18 16:02:25 +010053enum class DataLayout
54{
55 NCHW = 1,
56 NHWC = 2
57};
58
Keith Davis4914d0c2021-08-18 17:14:05 +010059/// Define the behaviour of the internal profiler when outputting network details
60enum class ProfilingDetailsMethod
61{
62 Undefined = 0,
63 DetailsWithEvents = 1,
64 DetailsOnly = 2
65};
66
67
Keith Davise813d672021-04-22 10:10:34 +010068enum class QosExecPriority
69{
70 Low = 0,
71 Medium = 1,
72 High = 2
73};
74
telsoa014fcda012018-03-09 14:13:49 +000075enum class ActivationFunction
76{
77 Sigmoid = 0,
78 TanH = 1,
79 Linear = 2,
80 ReLu = 3,
Colm Donelan03fbeaf2020-02-26 15:39:23 +000081 BoundedReLu = 4, ///< min(a, max(b, input)) ReLu1 & ReLu6.
telsoa014fcda012018-03-09 14:13:49 +000082 SoftReLu = 5,
83 LeakyReLu = 6,
84 Abs = 7,
85 Sqrt = 8,
David Monahan3b3c3812020-02-25 09:03:29 +000086 Square = 9,
Colm Donelan03fbeaf2020-02-26 15:39:23 +000087 Elu = 10,
88 HardSwish = 11
telsoa014fcda012018-03-09 14:13:49 +000089};
90
Narumol Prangnawarat8d001d42019-09-09 15:01:18 +010091enum class ArgMinMaxFunction
92{
93 Min = 0,
94 Max = 1
95};
96
Aron Virginas-Tar77bfb5e2019-10-16 17:45:38 +010097enum class ComparisonOperation
98{
99 Equal = 0,
100 Greater = 1,
101 GreaterOrEqual = 2,
102 Less = 3,
103 LessOrEqual = 4,
104 NotEqual = 5
105};
106
James Conroyaba90cd2020-11-06 16:28:18 +0000107enum class LogicalBinaryOperation
108{
109 LogicalAnd = 0,
110 LogicalOr = 1
111};
112
josh minor4a3c6102020-01-06 16:40:46 -0600113enum class UnaryOperation
114{
James Conroyaba90cd2020-11-06 16:28:18 +0000115 Abs = 0,
116 Exp = 1,
117 Sqrt = 2,
118 Rsqrt = 3,
119 Neg = 4,
Teresa Charlin50de4fa2021-05-31 18:47:33 +0100120 LogicalNot = 5,
121 Log = 6,
122 Sin = 7
josh minor4a3c6102020-01-06 16:40:46 -0600123};
124
telsoa014fcda012018-03-09 14:13:49 +0000125enum class PoolingAlgorithm
126{
127 Max = 0,
128 Average = 1,
129 L2 = 2
130};
131
Sadik Armagan0c3ea5b2021-02-03 09:29:30 +0000132enum class ReduceOperation
133{
134 Sum = 0,
135 Max = 1,
136 Mean = 2,
137 Min = 3
138};
139
Teresa Charlina9075df2019-06-27 15:41:57 +0100140enum class ResizeMethod
141{
142 Bilinear = 0,
143 NearestNeighbor = 1
144};
145
Teresa Charlin11f6ace2020-06-23 18:30:57 +0100146enum class Dimensionality
147{
148 NotSpecified = 0,
149 Specified = 1,
150 Scalar = 2
151};
152
telsoa014fcda012018-03-09 14:13:49 +0000153///
154/// The padding method modifies the output of pooling layers.
155/// In both supported methods, the values are ignored (they are
telsoa01c577f2c2018-08-31 09:22:23 +0100156/// not even zeroes, which would make a difference for max pooling
telsoa014fcda012018-03-09 14:13:49 +0000157/// a tensor with negative values). The difference between
telsoa01c577f2c2018-08-31 09:22:23 +0100158/// IgnoreValue and Exclude is that the former counts the padding
telsoa014fcda012018-03-09 14:13:49 +0000159/// fields in the divisor of Average and L2 pooling, while
160/// Exclude does not.
161///
162enum class PaddingMethod
163{
telsoa01c577f2c2018-08-31 09:22:23 +0100164 /// The padding fields count, but are ignored
David Beckdcb751f2018-10-03 11:42:42 +0100165 IgnoreValue = 0,
telsoa01c577f2c2018-08-31 09:22:23 +0100166 /// The padding fields don't count and are ignored
David Beckdcb751f2018-10-03 11:42:42 +0100167 Exclude = 1
telsoa014fcda012018-03-09 14:13:49 +0000168};
169
170enum class NormalizationAlgorithmChannel
171{
172 Across = 0,
173 Within = 1
174};
175
176enum class NormalizationAlgorithmMethod
177{
David Beckdcb751f2018-10-03 11:42:42 +0100178 /// Krichevsky 2012: Local Brightness Normalization
179 LocalBrightness = 0,
180 /// Jarret 2009: Local Contrast Normalization
telsoa01c577f2c2018-08-31 09:22:23 +0100181 LocalContrast = 1
telsoa014fcda012018-03-09 14:13:49 +0000182};
183
184enum class OutputShapeRounding
185{
186 Floor = 0,
187 Ceiling = 1
188};
189
Teresa Charlincdc01492020-06-09 18:00:20 +0100190///
191/// The ShapeInferenceMethod modify how the output shapes are treated.
192/// When ValidateOnly is selected, the output shapes are inferred from the input parameters of the layer
193/// and any mismatch is reported.
194/// When InferAndValidate is selected 2 actions must be performed: (1)infer output shape from inputs and (2)validate the
195/// shapes as in ValidateOnly. This option has been added to work with tensors which rank or dimension sizes are not
196/// specified explicitly, however this information can be calculated from the inputs.
197///
198enum class ShapeInferenceMethod
199{
200 /// Validate all output shapes
201 ValidateOnly = 0,
202 /// Infer missing output shapes and validate all output shapes
203 InferAndValidate = 1
204};
205
Francis Murtagh73d3e2e2021-04-29 14:23:04 +0100206/// Define the Memory Source to reduce copies
207enum class MemorySource : uint32_t
208{
209 Undefined = 0,
210 Malloc = 1,
211 DmaBuf = 2,
212 DmaBufProtected = 4
213};
214
David Beck9efb57d2018-11-05 13:40:33 +0000215/// Each backend should implement an IBackend.
216class IBackend
217{
218protected:
219 IBackend() {}
220 virtual ~IBackend() {}
221
222public:
223 virtual const BackendId& GetId() const = 0;
224};
225
226using IBackendSharedPtr = std::shared_ptr<IBackend>;
227using IBackendUniquePtr = std::unique_ptr<IBackend, void(*)(IBackend* backend)>;
228
Sadik Armaganf0a6dec2021-03-25 07:46:55 +0000229/// BackendCapability class
230enum class BackendCapability : uint32_t
231{
232 /// Constant weights can be accessed through the descriptors,
233 /// On the other hand, non-const weights can be accessed through inputs.
234 NonConstWeights,
235
Sadik Armaganaede8ca2021-03-31 16:12:13 +0100236 /// Asynchronous Execution.
237 AsyncExecution,
238
Sadik Armaganf0a6dec2021-03-25 07:46:55 +0000239 // add new enum values here
240};
241
David Beckdcb751f2018-10-03 11:42:42 +0100242/// Device specific knowledge to be passed to the optimizer.
telsoa01c577f2c2018-08-31 09:22:23 +0100243class IDeviceSpec
telsoa014fcda012018-03-09 14:13:49 +0000244{
telsoa01c577f2c2018-08-31 09:22:23 +0100245protected:
Matteo Martincigh9c5d33a2019-02-07 17:52:41 +0000246 IDeviceSpec() {}
247 virtual ~IDeviceSpec() {}
Narumol Prangnawarat87106762019-05-03 15:54:39 +0100248public:
249 virtual const BackendIdSet& GetSupportedBackends() const = 0;
telsoa014fcda012018-03-09 14:13:49 +0000250};
251
252/// Type of identifiers for bindable layers (inputs, outputs).
253using LayerBindingId = int;
254
255class PermutationVector
256{
257public:
258 using ValueType = unsigned int;
259 using SizeType = unsigned int;
260 using ArrayType = std::array<ValueType, MaxNumOfTensorDimensions>;
261 using ConstIterator = typename ArrayType::const_iterator;
262
telsoa01c577f2c2018-08-31 09:22:23 +0100263 /// @param dimMappings - Indicates how to translate tensor elements from a given source into the target destination,
telsoa014fcda012018-03-09 14:13:49 +0000264 /// when source and target potentially have different memory layouts.
265 ///
telsoa01c577f2c2018-08-31 09:22:23 +0100266 /// 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 +0000267 /// which is to be passed as an input to ArmNN, each source dimension is mapped to the corresponding
268 /// ArmNN dimension. The Batch dimension remains the same (0 -> 0). The source Height dimension is mapped
269 /// to the location of the ArmNN Height dimension (1 -> 2). Similar arguments are made for the Width and
270 /// Channels (2 -> 3 and 3 -> 1). This will lead to @ref m_DimMappings pointing to the following array:
271 /// [ 0, 2, 3, 1 ].
272 ///
273 /// Note that the mapping should be reversed if considering the case of ArmNN 4-d outputs (Batch Element,
274 /// Channels, Height, Width) being written to a destination with the format mentioned above. We now have
275 /// 0 -> 0, 2 -> 1, 3 -> 2, 1 -> 3, which, when reordered, lead to the following @ref m_DimMappings contents:
276 /// [ 0, 3, 1, 2 ].
277 ///
278 PermutationVector(const ValueType *dimMappings, SizeType numDimMappings);
279
280 PermutationVector(std::initializer_list<ValueType> dimMappings);
281
282 ValueType operator[](SizeType i) const { return m_DimMappings.at(i); }
283
284 SizeType GetSize() const { return m_NumDimMappings; }
285
286 ConstIterator begin() const { return m_DimMappings.begin(); }
Colm Donelan41e764c2021-05-27 16:43:25 +0100287 /**
288 *
289 * @return pointer one past the end of the number of mapping not the length of m_DimMappings.
290 */
291 ConstIterator end() const { return m_DimMappings.begin() + m_NumDimMappings; }
telsoa014fcda012018-03-09 14:13:49 +0000292
293 bool IsEqual(const PermutationVector& other) const
294 {
Matthew Jacksondba634f2019-08-15 15:14:18 +0100295 if (m_NumDimMappings != other.m_NumDimMappings) return false;
296 for (unsigned int i = 0; i < m_NumDimMappings; ++i)
297 {
298 if (m_DimMappings[i] != other.m_DimMappings[i]) return false;
299 }
300 return true;
telsoa014fcda012018-03-09 14:13:49 +0000301 }
302
303 bool IsInverse(const PermutationVector& other) const
304 {
305 bool isInverse = (GetSize() == other.GetSize());
306 for (SizeType i = 0; isInverse && (i < GetSize()); ++i)
307 {
308 isInverse = (m_DimMappings[other.m_DimMappings[i]] == i);
309 }
310 return isInverse;
311 }
312
313private:
314 ArrayType m_DimMappings;
315 /// Number of valid entries in @ref m_DimMappings
316 SizeType m_NumDimMappings;
317};
318
janeil013fec1ea2019-11-07 09:47:20 +0000319namespace profiling { class ProfilingGuid; }
320
telsoa01c577f2c2018-08-31 09:22:23 +0100321/// Define LayerGuid type.
janeil013fec1ea2019-11-07 09:47:20 +0000322using LayerGuid = profiling::ProfilingGuid;
surmeh01bceff2f2018-03-29 16:29:27 +0100323
Nattapat Chaimanowong6e948202019-03-22 14:01:46 +0000324class ITensorHandle;
325
Nattapat Chaimanowong317cae52019-03-28 10:29:12 +0000326/// Define the type of callback for the Debug layer to call
327/// @param guid - guid of layer connected to the input of the Debug layer
328/// @param slotIndex - index of the output slot connected to the input of the Debug layer
329/// @param tensorHandle - TensorHandle for the input tensor to the Debug layer
330using DebugCallbackFunction = std::function<void(LayerGuid guid, unsigned int slotIndex, ITensorHandle* tensorHandle)>;
Nattapat Chaimanowong6e948202019-03-22 14:01:46 +0000331
Keith Davise813d672021-04-22 10:10:34 +0100332/// Define a timer and associated inference ID for recording execution times
333using HighResolutionClock = std::chrono::high_resolution_clock::time_point;
334using InferenceTimingPair = std::pair<HighResolutionClock, HighResolutionClock>;
janeil01c4946c72019-11-07 09:32:28 +0000335
janeil01c4946c72019-11-07 09:32:28 +0000336
Finn Williamsb454c5c2021-02-09 15:56:23 +0000337/// This list uses X macro technique.
338/// See https://en.wikipedia.org/wiki/X_Macro for more info
339#define LIST_OF_LAYER_TYPE \
340 X(Activation) \
341 X(Addition) \
342 X(ArgMinMax) \
343 X(BatchNormalization) \
Keith Davis3ae3f972021-05-21 16:33:48 +0100344 X(BatchToSpaceNd) \
Finn Williamsb454c5c2021-02-09 15:56:23 +0000345 X(Comparison) \
346 X(Concat) \
347 X(Constant) \
348 X(ConvertBf16ToFp32) \
349 X(ConvertFp16ToFp32) \
350 X(ConvertFp32ToBf16) \
351 X(ConvertFp32ToFp16) \
352 X(Convolution2d) \
353 X(Debug) \
354 X(DepthToSpace) \
355 X(DepthwiseConvolution2d) \
356 X(Dequantize) \
357 X(DetectionPostProcess) \
358 X(Division) \
359 X(ElementwiseUnary) \
360 X(FakeQuantization) \
361 X(Fill) \
362 X(Floor) \
363 X(FullyConnected) \
364 X(Gather) \
365 X(Input) \
366 X(InstanceNormalization) \
367 X(L2Normalization) \
368 X(LogicalBinary) \
369 X(LogSoftmax) \
370 X(Lstm) \
371 X(QLstm) \
372 X(Map) \
373 X(Maximum) \
374 X(Mean) \
375 X(MemCopy) \
376 X(MemImport) \
377 X(Merge) \
378 X(Minimum) \
379 X(Multiplication) \
380 X(Normalization) \
381 X(Output) \
382 X(Pad) \
383 X(Permute) \
384 X(Pooling2d) \
385 X(PreCompiled) \
386 X(Prelu) \
387 X(Quantize) \
388 X(QuantizedLstm) \
389 X(Reshape) \
390 X(Rank) \
391 X(Resize) \
392 X(Reduce) \
393 X(Slice) \
394 X(Softmax) \
395 X(SpaceToBatchNd) \
396 X(SpaceToDepth) \
397 X(Splitter) \
398 X(Stack) \
399 X(StandIn) \
400 X(StridedSlice) \
401 X(Subtraction) \
402 X(Switch) \
403 X(Transpose) \
404 X(TransposeConvolution2d) \
mathad01b392e982021-04-07 12:07:30 +0100405 X(Unmap) \
Narumol Prangnawarat8ed39ae2021-07-15 16:16:25 +0100406 X(Cast) \
407 X(Shape) \
408 X(UnidirectionalSequenceLstm) \
409
410// New layers should be added at last to minimize instability.
Keith Davis3ae3f972021-05-21 16:33:48 +0100411
Finn Williamsb454c5c2021-02-09 15:56:23 +0000412/// When adding a new layer, adapt also the LastLayer enum value in the
413/// enum class LayerType below
414enum class LayerType
415{
416#define X(name) name,
417 LIST_OF_LAYER_TYPE
418#undef X
419 FirstLayer = Activation,
Narumol Prangnawarat8ed39ae2021-07-15 16:16:25 +0100420 LastLayer = UnidirectionalSequenceLstm
Finn Williamsb454c5c2021-02-09 15:56:23 +0000421};
422
423const char* GetLayerTypeAsCString(LayerType type);
424
David Beck9df2d952018-10-10 15:11:44 +0100425} // namespace armnn