blob: 2e70d72e5ffb2ad92fa4402d14d0a80ba6d42a2e [file] [log] [blame]
erik.andersson@arm.com42b94ed2021-02-11 14:02:08 +01001# Copyright (C) 2020-2021 Arm Limited or its affiliates. All rights reserved.
Tim Hall79d07d22020-04-27 18:20:16 +01002#
3# SPDX-License-Identifier: Apache-2.0
4#
5# Licensed under the Apache License, Version 2.0 (the License); you may
6# not use this file except in compliance with the License.
7# You may obtain a copy of the License at
8#
9# www.apache.org/licenses/LICENSE-2.0
10#
11# Unless required by applicable law or agreed to in writing, software
12# distributed under the License is distributed on an AS IS BASIS, WITHOUT
13# WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
14# See the License for the specific language governing permissions and
15# limitations under the License.
Tim Hall79d07d22020-04-27 18:20:16 +010016# Description:
17# Internal representation of a Neural Network Tensor.
Patrik Gustavsson6ae0e422020-11-04 12:43:50 +010018import copy
Tim Hall79d07d22020-04-27 18:20:16 +010019import enum
Tim Hall79d07d22020-04-27 18:20:16 +010020import uuid
Jacob Bohlin1a666972020-09-11 10:04:15 +020021from collections import defaultdict
Diqing Zhongf842b692020-12-11 13:07:37 +010022from enum import auto
Louis Verhaard9db529a2020-09-23 10:27:11 +020023from functools import lru_cache
Louis Verhaard6c74c3b2020-12-17 13:54:09 +010024from functools import total_ordering
Louis Verhaard93719a92020-12-08 10:02:31 +010025from typing import Dict
26from typing import List
27from typing import Optional
28from typing import Tuple
29from typing import Union
30from uuid import UUID
Diego Russoea6111a2020-04-14 18:41:58 +010031
32import numpy as np
33
34from . import numeric_util
Tim Hall93582962020-09-09 21:58:15 +010035from .data_type import BaseType
Michael McGeagh5778ffd2020-08-06 17:31:02 +010036from .data_type import DataType
Michael McGeagh528a56d2020-12-16 11:33:21 +000037from .errors import UnsupportedFeatureError
38from .errors import VelaError
Dwight Lidmana9390f72020-05-13 12:00:08 +020039from .ethos_u55_regs.ethos_u55_regs import resampling_mode
Patrik Gustavsson2349d422020-12-01 16:02:29 +010040from .numeric_util import full_shape
Louis Verhaardaee5d752020-09-30 09:01:52 +020041from .operation import Op
Michael McGeagh5778ffd2020-08-06 17:31:02 +010042from .operation import Operation
patrik.gustavssoneeb85152020-12-21 17:10:40 +000043from .shape4d import Shape4D
Louis Verhaard93719a92020-12-08 10:02:31 +010044
45Shape = List
Tim Hall79d07d22020-04-27 18:20:16 +010046
47
Patrik Gustavssoneca2e952020-05-27 09:15:11 +020048class MemType(enum.IntFlag):
49 Unknown = 0
50 Permanent_NPU = 1
51 Permanent_CPU = 2
52 Scratch = 3
53 Scratch_fast = 4
54 Size = Scratch_fast + 1
55
Louis Verhaard93719a92020-12-08 10:02:31 +010056 def display_name(self) -> str:
Patrik Gustavssoneca2e952020-05-27 09:15:11 +020057 return ("Unknown", "Permanent_NPU", "Permanent_CPU", "Scratch", "Scratch_fast", "Size")[self.value]
58
Louis Verhaard93719a92020-12-08 10:02:31 +010059 def identifier_name(self) -> str:
Patrik Gustavssoneca2e952020-05-27 09:15:11 +020060 return ("unknown", "permanent_npu", "permanent_cpu", "scratch", "scratch_fast", "size")[self.value]
61
Louis Verhaard93719a92020-12-08 10:02:31 +010062 @staticmethod
Patrik Gustavssoneca2e952020-05-27 09:15:11 +020063 def all():
64 return (MemType.Permanent_NPU, MemType.Permanent_CPU, MemType.Scratch, MemType.Scratch_fast)
65
66 def __str__(self):
67 return self.name
68
69
Diqing Zhongf842b692020-12-11 13:07:37 +010070class BandwidthDirection(enum.IntEnum):
71 Read = 0
72 Write = auto()
73 Size = auto()
74
75 def display_name(self):
76 return self.name
77
78 def identifier_name(self):
79 return self.name.lower()
80
81 @staticmethod
82 def all():
83 return (BandwidthDirection.Read, BandwidthDirection.Write)
84
85
Tim Hall79d07d22020-04-27 18:20:16 +010086class MemArea(enum.IntFlag):
87 Unknown = 0
88 Sram = 1
89 Dram = 2
90 OnChipFlash = 3
91 OffChipFlash = 4
Louis Verhaard0b8268a2020-08-05 16:11:29 +020092 Shram = 5 # for LUT
93 Size = Shram + 1
Tim Hall79d07d22020-04-27 18:20:16 +010094
Louis Verhaard93719a92020-12-08 10:02:31 +010095 def display_name(self) -> str:
Louis Verhaard0b8268a2020-08-05 16:11:29 +020096 return ("Unknown", "SRAM", "DRAM", "On-chip Flash", "Off-chip Flash", "SHRAM", "Size")[self.value]
Tim Hall79d07d22020-04-27 18:20:16 +010097
Louis Verhaard93719a92020-12-08 10:02:31 +010098 def identifier_name(self) -> str:
Louis Verhaard0b8268a2020-08-05 16:11:29 +020099 return ("unknown", "sram", "dram", "on_chip_flash", "off_chip_flash", "shram", "size")[self.value]
Tim Hall79d07d22020-04-27 18:20:16 +0100100
Louis Verhaard93719a92020-12-08 10:02:31 +0100101 @staticmethod
Tim Hall79d07d22020-04-27 18:20:16 +0100102 def all():
Louis Verhaard0b8268a2020-08-05 16:11:29 +0200103 return (MemArea.Sram, MemArea.Dram, MemArea.OnChipFlash, MemArea.OffChipFlash, MemArea.Shram)
Tim Hall79d07d22020-04-27 18:20:16 +0100104
105 def __str__(self):
106 return self.name
107
108
109class TensorPurpose(enum.IntFlag):
110 Unknown = 0
111 Weights = 1
112 FeatureMap = 2
113 Scratch = 3
Fredrik Svedberge22ba8c2021-01-27 16:53:41 +0100114 ScratchFast = 4
115 LUT = 5
116 FSBias = 6
117 Size = 7
Tim Hall79d07d22020-04-27 18:20:16 +0100118
Louis Verhaard93719a92020-12-08 10:02:31 +0100119 def display_name(self) -> str:
Fredrik Svedberge22ba8c2021-01-27 16:53:41 +0100120 return ("Unknown", "Weights", "FeatureMap", "Scratch", "ScratchFast", "LUT", "FastStorageBias", "Size")[
121 self.value
122 ]
Tim Hall79d07d22020-04-27 18:20:16 +0100123
Louis Verhaard93719a92020-12-08 10:02:31 +0100124 def identifier_name(self) -> str:
Fredrik Svedberge22ba8c2021-01-27 16:53:41 +0100125 return ("unknown", "weights", "feature_map", "scratch", "scratch_fast", "lut", "fast_storage_bias", "size")[
126 self.value
127 ]
Tim Hall79d07d22020-04-27 18:20:16 +0100128
Louis Verhaard93719a92020-12-08 10:02:31 +0100129 @staticmethod
Tim Hall79d07d22020-04-27 18:20:16 +0100130 def all():
Andreas Nevalainen897cc142020-10-28 15:42:08 +0100131 return (TensorPurpose.Weights, TensorPurpose.FeatureMap, TensorPurpose.FSBias)
Tim Hall79d07d22020-04-27 18:20:16 +0100132
133
134class TensorSubPurpose(enum.Enum):
135 Standard = 0
136 DoubleBuffer = 1
137 RollingBufferX = 2
138 RollingBufferY = 3
139 RollingBufferXY = 4
140
Louis Verhaard93719a92020-12-08 10:02:31 +0100141 def display_name(self) -> str:
Tim Hall79d07d22020-04-27 18:20:16 +0100142 return ("Standard", "Double Buffer", "Rolling Buffer X", "Rolling Buffer Y", "Rolling Buffer XY")[self.value]
143
Louis Verhaard93719a92020-12-08 10:02:31 +0100144 def identifier_name(self) -> str:
Tim Hall79d07d22020-04-27 18:20:16 +0100145 return ("standard", "double_buffer", "rolling_buffer_x", "rolling_buffer_y", "rolling_buffer_xy")[self.value]
146
Louis Verhaard93719a92020-12-08 10:02:31 +0100147 @staticmethod
Tim Hall79d07d22020-04-27 18:20:16 +0100148 def all():
149 return (
150 TensorSubPurpose.Standard,
151 TensorSubPurpose.DoubleBuffer,
152 TensorSubPurpose.RollingBufferX,
153 TensorSubPurpose.RollingBufferY,
154 TensorSubPurpose.RollingBufferXY,
155 )
156
157
158class TensorFormat(enum.Flag):
159 Unknown = 0
160 WeightsCompressed = 1
161 NHWC = 2
162 NHCWB16 = 3
163
164 def __str__(self):
165 return self.name
166
167
168class TensorBlockTraversal(enum.Enum):
169 Default = 0
170 DepthWise = 1
171 DepthFirst = 2
172 PartKernelFirst = 3
173
174
Louis Verhaard93719a92020-12-08 10:02:31 +0100175def shape_num_elements(shp: Shape) -> Optional[int]:
Tim Hall79d07d22020-04-27 18:20:16 +0100176 elems = 1
177 if shp is None:
178 return None
179 for d in shp:
180 if d is None:
181 return None
182 elems *= d
183 return elems
184
185
Louis Verhaard93719a92020-12-08 10:02:31 +0100186def shape_fully_defined(shp: Shape) -> bool:
Tim Hall79d07d22020-04-27 18:20:16 +0100187 if shp is None:
188 return False
189 for d in shp:
190 if d is None:
191 return False
192 return True
193
194
Louis Verhaard93719a92020-12-08 10:02:31 +0100195def shape_round_to_quantum(shp: Shape, quantum: Tuple) -> Shape:
Tim Hall79d07d22020-04-27 18:20:16 +0100196 new_shp = list(shp)
197
198 # Traverse backwards using length of shape since there may be more rounding quantums than shape elements
199 for i in range(-1, -len(shp) - 1, -1):
200 if new_shp[i] is not None:
201 new_shp[i] = numeric_util.round_up(new_shp[i], quantum[i])
202 return new_shp
203
204
Louis Verhaard9db529a2020-09-23 10:27:11 +0200205@lru_cache(maxsize=None)
Louis Verhaard93719a92020-12-08 10:02:31 +0100206def create_equivalence_id(key) -> UUID:
Louis Verhaard9db529a2020-09-23 10:27:11 +0200207 # Generates equivalence_id based on the given key.
208 return uuid.uuid4()
209
210
Tim Hall79d07d22020-04-27 18:20:16 +0100211class QuantizationParameters:
212 __slots__ = "min", "max", "num_bits", "narrow_range", "scale_f32", "zero_point", "quant_min", "quant_max"
213
Louis Verhaard93719a92020-12-08 10:02:31 +0100214 def __init__(
215 self,
216 min: Union[float, np.ndarray, None] = None,
217 max: Union[float, np.ndarray, None] = None,
218 num_bits=None,
219 narrow_range=None,
220 ):
Tim Hall79d07d22020-04-27 18:20:16 +0100221 self.min = min
222 self.max = max
223
224 self.num_bits = num_bits
225 self.narrow_range = narrow_range
226
Louis Verhaard93719a92020-12-08 10:02:31 +0100227 self.scale_f32: Union[float, np.ndarray, None] = None
228 self.zero_point: Union[int, np.ndarray, None] = None
229 self.quant_min: Optional[float] = None
230 self.quant_max: Optional[float] = None
Tim Hall79d07d22020-04-27 18:20:16 +0100231
232 def __str__(self):
233 return "<nng.QuantizationParameters min=%s max=%s, num_bits=%s, scale=%s, zero_point=%s>" % (
234 self.min,
235 self.max,
236 self.num_bits,
237 self.scale_f32,
238 self.zero_point,
239 )
240
241 __repr__ = __str__
242
Louis Verhaard93719a92020-12-08 10:02:31 +0100243 def clone(self) -> "QuantizationParameters":
Tim Hall79d07d22020-04-27 18:20:16 +0100244 res = QuantizationParameters()
245 res.min = self.min
246 res.max = self.max
247
248 res.num_bits = self.num_bits
249 res.narrow_range = self.narrow_range
250
251 res.scale_f32 = self.scale_f32
252 res.zero_point = self.zero_point
253 res.quant_min = self.quant_min
254 res.quant_max = self.quant_max
255 return res
256
James Peet7519d502021-07-19 16:47:58 +0100257 def dequantize(self, values) -> np.ndarray:
258 return np.subtract(values, self.zero_point) * self.scale_f32
Tim Hall79d07d22020-04-27 18:20:16 +0100259
Louis Verhaard93719a92020-12-08 10:02:31 +0100260 def is_scaling_equal(self, other: Optional["QuantizationParameters"]) -> bool:
Tim Hall93582962020-09-09 21:58:15 +0100261 # quantisation parameter scaling is not equal if 'other' is None because
262 # it implies that the tensor it belongs to is not quantised. otherwise,
263 # it depends upon whether the scale and zero point are equal
264
Tim Hall89567612020-10-27 11:57:57 +0000265 if not isinstance(other, QuantizationParameters):
Tim Halle3786ac2020-07-28 17:40:50 +0100266 return False
267
268 return self.scale_f32 == other.scale_f32 and self.zero_point == other.zero_point
269
Louis Verhaard93719a92020-12-08 10:02:31 +0100270 def is_valid(self) -> bool:
Tim Hall93582962020-09-09 21:58:15 +0100271 # quantisation parameters are consider valid if they have a scale and zero point
272
273 return None not in (self.scale_f32, self.zero_point)
274
Louis Verhaard93719a92020-12-08 10:02:31 +0100275 def is_per_axis(self) -> bool:
Dwight Lidmanc7187432020-11-16 17:40:46 +0100276 """Returns True if either the scale, zero point, minimum or maximum values are arrays"""
277 for attr in ("scale_f32", "zero_point", "min", "max"):
278 if isinstance(getattr(self, attr), np.ndarray):
279 return True
280 return False
281
Tim Hall79d07d22020-04-27 18:20:16 +0100282
Louis Verhaard93719a92020-12-08 10:02:31 +0100283def create_const_tensor(
284 name: str,
285 shape: Shape,
286 dtype: DataType,
287 values: np.ndarray,
288 value_dtype: np.dtype = None,
289 purpose: TensorPurpose = TensorPurpose.Unknown,
290 quantization: QuantizationParameters = None,
291):
Michael McGeagh5778ffd2020-08-06 17:31:02 +0100292 # Tensor
293 const_tensor = Tensor(shape, dtype, name + "_0")
294 const_tensor.purpose = purpose
295 const_tensor.quantization = quantization
296 const_tensor.values = np.array(values, dtype=value_dtype)
Michael McGeagh5778ffd2020-08-06 17:31:02 +0100297 # Operator
Louis Verhaardaee5d752020-09-30 09:01:52 +0200298 const_op = Operation(Op.Const, name)
Michael McGeagh5778ffd2020-08-06 17:31:02 +0100299 const_op.set_output_tensor(const_tensor)
patrik.gustavssoneeb85152020-12-21 17:10:40 +0000300 const_op.set_ifm_ofm_shapes()
Michael McGeagh5778ffd2020-08-06 17:31:02 +0100301 return const_tensor
302
303
Jacob Bohlin1a666972020-09-11 10:04:15 +0200304# class that keeps track of all tensor addresses in the different memory types
305class TensorAddressMap:
Louis Verhaard93719a92020-12-08 10:02:31 +0100306 address_map: Dict = defaultdict(dict) # dict (tens.equivalence_id -> dict (mem_type -> address))
Jacob Bohlin1a666972020-09-11 10:04:15 +0200307
308 @classmethod
Louis Verhaard93719a92020-12-08 10:02:31 +0100309 def get_address_for_tens(cls, tens_id: UUID, mem_type: MemType) -> int:
Jacob Bohlin1a666972020-09-11 10:04:15 +0200310 return cls.address_map[tens_id].get(mem_type)
311
312 @classmethod
Louis Verhaard93719a92020-12-08 10:02:31 +0100313 def set_address_for_tens(cls, tens_id: UUID, mem_type: MemType, address: int):
Jacob Bohlin1a666972020-09-11 10:04:15 +0200314 # Check previous address if there is one
315 previous_address = cls.address_map[tens_id].get(mem_type)
Louis Verhaard0b9c9a32020-09-15 14:05:38 +0200316 if address is not None and previous_address is not None:
Jacob Bohlin1a666972020-09-11 10:04:15 +0200317 assert previous_address == address, "Two different addresses cannot be assigned to the same tensor."
318
319 # Set tensor's address for memory type
320 cls.address_map[tens_id][mem_type] = address
321
322
Louis Verhaard6c74c3b2020-12-17 13:54:09 +0100323@total_ordering
Tim Hall79d07d22020-04-27 18:20:16 +0100324class Tensor:
325 __slots__ = (
326 "shape",
327 "storage_shape",
328 "bandwidth_shape",
329 "dtype",
330 "name",
Fredrik Svedberg8d0f4892021-02-16 21:59:50 +0100331 "is_variable",
Tim Halld8339a72021-05-27 18:49:40 +0100332 "pre_buffer",
Tim Hall79d07d22020-04-27 18:20:16 +0100333 "ops",
334 "consumer_list",
335 "values",
Tim Hall79d07d22020-04-27 18:20:16 +0100336 "compressed_values",
Tim Hallf7e810a2020-06-25 15:04:31 +0100337 "compressed_values_substream_offsets",
Tim Hall79d07d22020-04-27 18:20:16 +0100338 "mem_area",
Patrik Gustavssoneca2e952020-05-27 09:15:11 +0200339 "mem_type",
Tim Hall79d07d22020-04-27 18:20:16 +0100340 "format",
341 "purpose",
342 "sub_purpose",
343 "alignment",
344 "weight_transpose_depthwise",
345 "storage_compression_scale",
346 "bandwidth_compression_scale",
347 "compression_scale_for_worst_weight_stream",
348 "weight_compression_scales",
349 "weight_compression_config",
Louis Verhaard9db529a2020-09-23 10:27:11 +0200350 "value_id",
Tim Hall79d07d22020-04-27 18:20:16 +0100351 "storage_rounding_quantum",
352 "brick_size",
Tim Hall79d07d22020-04-27 18:20:16 +0100353 "quantization",
354 "weight_compressed_offsets",
355 "element_size_bytes",
Tim Hall79d07d22020-04-27 18:20:16 +0100356 "block_traversal",
Tim Hall79d07d22020-04-27 18:20:16 +0100357 "equivalence_id",
Dwight Lidmana9390f72020-05-13 12:00:08 +0200358 "resampling_mode",
Tim Halld8339a72021-05-27 18:49:40 +0100359 "src_tensor",
Patrik Gustavssonee99bb12021-04-08 09:04:00 +0200360 "needs_linear_format",
Tim Hall79d07d22020-04-27 18:20:16 +0100361 )
362 AllocationQuantum = 16
363
Louis Verhaard93719a92020-12-08 10:02:31 +0100364 def __init__(self, shape: Shape, dtype: DataType, name: str):
Tim Hall79d07d22020-04-27 18:20:16 +0100365 self.shape = shape
366 self.storage_shape = shape
367 self.bandwidth_shape = shape
368 self.dtype = dtype
369 self.name = name
Fredrik Svedberg8d0f4892021-02-16 21:59:50 +0100370 self.is_variable = False
Tim Halld8339a72021-05-27 18:49:40 +0100371 self.pre_buffer = False
Louis Verhaard93719a92020-12-08 10:02:31 +0100372 self.equivalence_id: UUID = uuid.uuid4()
Tim Hall79d07d22020-04-27 18:20:16 +0100373
Louis Verhaard93719a92020-12-08 10:02:31 +0100374 self.ops: List[Operation] = []
375 self.consumer_list: List[Operation] = []
Tim Hall79d07d22020-04-27 18:20:16 +0100376
James Peet7519d502021-07-19 16:47:58 +0100377 self.values: Optional[np.ndarray] = None # elements are of type self.dtype
Louis Verhaard93719a92020-12-08 10:02:31 +0100378 self.compressed_values: Optional[np.ndarray] = None
379 self.compressed_values_substream_offsets: Optional[List] = None
380 self.mem_area: MemArea = MemArea.Unknown
381 self.mem_type: MemType = MemType.Unknown
382 self.format: TensorFormat = TensorFormat.Unknown
383 self.purpose: TensorPurpose = TensorPurpose.Unknown
384 self.sub_purpose: TensorSubPurpose = TensorSubPurpose.Standard
385 self.alignment: int = Tensor.AllocationQuantum
386 self.weight_transpose_depthwise: bool = False
Tim Hall79d07d22020-04-27 18:20:16 +0100387
Louis Verhaard93719a92020-12-08 10:02:31 +0100388 self.storage_compression_scale: float = 1.0
389 self.bandwidth_compression_scale: float = 1.0
390 self.compression_scale_for_worst_weight_stream: float = 1.0
391 self.weight_compression_scales: Optional[np.ndarray] = None
Louis Verhaard9db529a2020-09-23 10:27:11 +0200392 # if two tensors have the same weight_compression_config, then they have the same compressed values
Tim Hall79d07d22020-04-27 18:20:16 +0100393 self.weight_compression_config = None
Louis Verhaard9db529a2020-09-23 10:27:11 +0200394 # if two tensors have the same value_id, then they have the same values
Louis Verhaard93719a92020-12-08 10:02:31 +0100395 self.value_id: UUID = uuid.uuid4()
396 self.weight_compressed_offsets: List = []
397 self.storage_rounding_quantum: Tuple = (1, 1, 1, 1)
398 self.brick_size: Tuple = (1, 1, 1, 1)
399 self.element_size_bytes: int = 0
Tim Hall79d07d22020-04-27 18:20:16 +0100400
401 # quantization parameters
Louis Verhaard93719a92020-12-08 10:02:31 +0100402 self.quantization: Optional[QuantizationParameters] = None
403 self.block_traversal: TensorBlockTraversal = TensorBlockTraversal.Default
404 self.resampling_mode: resampling_mode = resampling_mode.NONE
Tim Hall79d07d22020-04-27 18:20:16 +0100405
Patrik Gustavssonee99bb12021-04-08 09:04:00 +0200406 self.needs_linear_format = True
Patrik Gustavsson458a2082020-08-13 13:41:05 +0200407
Tim Halld8339a72021-05-27 18:49:40 +0100408 # Reference to parent-tensor if this tensor is a clone
409 self.src_tensor = None
410
Jacob Bohlin1a666972020-09-11 10:04:15 +0200411 @property
Louis Verhaard93719a92020-12-08 10:02:31 +0100412 def address(self) -> int:
Jacob Bohlin1a666972020-09-11 10:04:15 +0200413 return TensorAddressMap.get_address_for_tens(self.equivalence_id, self.mem_type)
414
415 @address.setter
Louis Verhaard93719a92020-12-08 10:02:31 +0100416 def address(self, address: int):
Jacob Bohlin1a666972020-09-11 10:04:15 +0200417 TensorAddressMap.set_address_for_tens(self.equivalence_id, self.mem_type, address)
418
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100419 @property
420 def is_standard_fm(self) -> bool:
421 return self.sub_purpose == TensorSubPurpose.Standard and self.purpose == TensorPurpose.FeatureMap
422
Louis Verhaard93719a92020-12-08 10:02:31 +0100423 def element_size(self) -> int:
Tim Hall79d07d22020-04-27 18:20:16 +0100424 if self.element_size_bytes == 0:
425 return self.dtype.size_in_bits() / 8
426 return self.element_size_bytes
427
Patrik Gustavsson6ae0e422020-11-04 12:43:50 +0100428 # Returns a copy, renamed to self.name + suffix
429 # The references to Operators will be empty when returned
430 # Depending on set_unique, the copy is shallow, or deep
431 # For set_unique==True, a new equivalence_id will be set
Louis Verhaard93719a92020-12-08 10:02:31 +0100432 def clone(self, suffix="_clone", set_unique: bool = False) -> "Tensor":
erik.andersson@arm.com42b94ed2021-02-11 14:02:08 +0100433 res = copy.copy(self)
Patrik Gustavsson6ae0e422020-11-04 12:43:50 +0100434 if set_unique:
Patrik Gustavsson6ae0e422020-11-04 12:43:50 +0100435 res.equivalence_id = uuid.uuid4()
erik.andersson@arm.com42b94ed2021-02-11 14:02:08 +0100436 res.storage_shape = list(self.storage_shape)
437 res.bandwidth_shape = list(self.bandwidth_shape)
438 if self.quantization is not None:
439 res.quantization = self.quantization.clone()
Tim Hall79d07d22020-04-27 18:20:16 +0100440
Patrik Gustavsson6ae0e422020-11-04 12:43:50 +0100441 res.name = res.name + suffix
Tim Hall79d07d22020-04-27 18:20:16 +0100442 res.ops = []
443 res.consumer_list = []
Tim Hall79d07d22020-04-27 18:20:16 +0100444
Tim Hall79d07d22020-04-27 18:20:16 +0100445 return res
446
Louis Verhaard93719a92020-12-08 10:02:31 +0100447 def clone_into_fast_storage(self, arch) -> "Tensor":
Tim Hall79d07d22020-04-27 18:20:16 +0100448 res = self.clone(suffix="_fast_storage")
449 res.mem_area = arch.fast_storage_mem_area
Patrik Gustavssoneca2e952020-05-27 09:15:11 +0200450 res.mem_type = MemType.Scratch_fast
Tim Halld8339a72021-05-27 18:49:40 +0100451 res.src_tensor = self
Tim Hall79d07d22020-04-27 18:20:16 +0100452 return res
453
Louis Verhaard93719a92020-12-08 10:02:31 +0100454 def copy_compressed_weight_info(self, src_tens: "Tensor"):
Louis Verhaard3c07c972020-05-07 08:12:58 +0200455 # Copies compressed values + all related weight compression info from the given tensor
Louis Verhaard9db529a2020-09-23 10:27:11 +0200456 self.equivalence_id = src_tens.equivalence_id
Louis Verhaard3c07c972020-05-07 08:12:58 +0200457 self.compressed_values = src_tens.compressed_values
Tim Hallf7e810a2020-06-25 15:04:31 +0100458 self.compressed_values_substream_offsets = src_tens.compressed_values_substream_offsets
Louis Verhaard3c07c972020-05-07 08:12:58 +0200459 self.storage_shape = src_tens.storage_shape
460 self.brick_size = src_tens.brick_size
461 self.weight_compression_scales = src_tens.weight_compression_scales
462 self.weight_compressed_offsets = src_tens.weight_compressed_offsets
463 self.weight_transpose_depthwise = src_tens.weight_transpose_depthwise
464 self.compression_scale_for_worst_weight_stream = src_tens.compression_scale_for_worst_weight_stream
465 self.storage_compression_scale = src_tens.storage_compression_scale
Diqing Zhong7e1d1d12020-10-30 15:10:46 +0100466 self.bandwidth_compression_scale = src_tens.bandwidth_compression_scale
Louis Verhaard3c07c972020-05-07 08:12:58 +0200467 self.block_traversal = src_tens.block_traversal
468 self.weight_compression_config = src_tens.weight_compression_config
Louis Verhaard9db529a2020-09-23 10:27:11 +0200469 self.value_id = src_tens.value_id
Louis Verhaard3c07c972020-05-07 08:12:58 +0200470
Louis Verhaard93719a92020-12-08 10:02:31 +0100471 def set_format(self, fmt: TensorFormat, arch):
Tim Hall79d07d22020-04-27 18:20:16 +0100472 self.format = fmt
473 shape_len = 0
474 try:
475 shape_len = len(self.shape)
476 except TypeError:
477 pass
478
Louis Verhaard0411edb2020-11-16 16:37:11 +0100479 if shape_len > 4:
480 return
Louis Verhaard04bd3e92021-08-19 16:36:32 +0200481 assert not (self.needs_linear_format and fmt == TensorFormat.NHCWB16)
Tim Hall79d07d22020-04-27 18:20:16 +0100482 self.storage_rounding_quantum = arch.storage_rounding_quantums[self.format]
Louis Verhaard93719a92020-12-08 10:02:31 +0100483 self.storage_rounding_quantum = tuple(self.storage_rounding_quantum[-shape_len:])
Tim Hall79d07d22020-04-27 18:20:16 +0100484 self.brick_size = arch.brick_sizes[self.format]
Louis Verhaard93719a92020-12-08 10:02:31 +0100485 self.brick_size = tuple(self.brick_size[-shape_len:])
Tim Hall79d07d22020-04-27 18:20:16 +0100486 if self.shape is None:
487 return
488
489 self.bandwidth_shape = shape_round_to_quantum(self.shape, self.brick_size)
490 self.storage_shape = shape_round_to_quantum(self.shape, self.storage_rounding_quantum)
491
492 if fmt == TensorFormat.WeightsCompressed:
493 compression_ratio = 5 / 8
494 self.storage_compression_scale = compression_ratio
495 self.bandwidth_compression_scale = compression_ratio
496 self.compression_scale_for_worst_weight_stream = compression_ratio
497
Louis Verhaard93719a92020-12-08 10:02:31 +0100498 def storage_elements(self) -> int:
Tim Hall79d07d22020-04-27 18:20:16 +0100499 elems = shape_num_elements(self.storage_shape)
500 if elems is None:
501 return 0
502 return elems
503
Louis Verhaard93719a92020-12-08 10:02:31 +0100504 def elements(self) -> int:
Tim Hall79d07d22020-04-27 18:20:16 +0100505 elems = shape_num_elements(self.shape)
506 if elems is None:
507 return 0
508 return elems
509
Louis Verhaard93719a92020-12-08 10:02:31 +0100510 def has_fully_defined_shape(self) -> bool:
Tim Hall79d07d22020-04-27 18:20:16 +0100511 return shape_fully_defined(self.shape)
512
Louis Verhaard93719a92020-12-08 10:02:31 +0100513 def storage_size(self, scale: float = 1.0) -> int:
Patrik Gustavsson90831bc2020-08-24 16:26:11 +0200514 raw_size = self.storage_elements() * self.element_size() * scale
Tim Hall79d07d22020-04-27 18:20:16 +0100515 if raw_size == 0:
516 raw_size = 1 # force it to take up space
517 rounded_size = numeric_util.round_up(numeric_util.round_up_to_int(raw_size), self.alignment)
518 return rounded_size
519
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100520 def storage_size_for_shape(self, op_storage_shape: Shape) -> int:
521 elems = shape_num_elements(op_storage_shape)
522 elems = elems if elems else 0
523 raw_size = elems * self.element_size()
524 if raw_size == 0:
525 raw_size = 1 # force it to take up space
526 rounded_size = numeric_util.round_up(numeric_util.round_up_to_int(raw_size), self.alignment)
527 return rounded_size
528
Louis Verhaard93719a92020-12-08 10:02:31 +0100529 def storage_shape_for_sub_purpose(
530 self, sub_purpose: TensorSubPurpose, param_a: Optional[int], param_b: Optional[int]
531 ) -> Shape:
Tim Hall79d07d22020-04-27 18:20:16 +0100532 if sub_purpose == TensorSubPurpose.DoubleBuffer:
Jacob Bohline843d332020-06-23 12:12:56 +0200533 shp = list(self.shape)
Tim Hall79d07d22020-04-27 18:20:16 +0100534 assert len(shp) >= 2
Louis Verhaard93719a92020-12-08 10:02:31 +0100535 assert param_a is not None
Tim Hall79d07d22020-04-27 18:20:16 +0100536 shp[-1] = min(shp[-1], param_a * 2)
Tim Hall79d07d22020-04-27 18:20:16 +0100537 else:
Jacob Bohlinfad72042021-08-24 21:51:41 +0200538 shp = full_shape(4, self.storage_shape, 1)
Jacob Bohline843d332020-06-23 12:12:56 +0200539 if sub_purpose == TensorSubPurpose.RollingBufferX:
540 assert len(shp) == 4
Louis Verhaard93719a92020-12-08 10:02:31 +0100541 assert param_a is not None
Jacob Bohline843d332020-06-23 12:12:56 +0200542 shp[0] = 1
543 shp[2] = min(shp[2], param_a)
544 elif sub_purpose == TensorSubPurpose.RollingBufferY:
545 assert len(shp) == 4
Louis Verhaard93719a92020-12-08 10:02:31 +0100546 assert param_a is not None
Jacob Bohline843d332020-06-23 12:12:56 +0200547 shp[0] = 1
548 shp[1] = min(shp[1], param_a)
549 elif sub_purpose == TensorSubPurpose.RollingBufferXY:
550 assert len(shp) == 4
Louis Verhaard93719a92020-12-08 10:02:31 +0100551 assert param_a is not None
552 assert param_b is not None
Jacob Bohline843d332020-06-23 12:12:56 +0200553 shp[0] = 1
554 shp[2] = min(shp[2], param_a)
555 shp[1] = min(shp[1], param_b)
556 elif sub_purpose == TensorSubPurpose.Standard:
557 pass
558 else:
559 assert 0, "did not expect new sub purpose %s" % (sub_purpose,)
560
Tim Hall79d07d22020-04-27 18:20:16 +0100561 return shp
562
Louis Verhaard93719a92020-12-08 10:02:31 +0100563 def set_new_sub_purpose(self, sub_purpose: TensorSubPurpose, param_a=None, param_b=None):
Tim Hall79d07d22020-04-27 18:20:16 +0100564 self.storage_shape = self.storage_shape_for_sub_purpose(sub_purpose, param_a, param_b)
565 self.sub_purpose = sub_purpose
566 if sub_purpose == TensorSubPurpose.DoubleBuffer:
567 self.storage_compression_scale = self.compression_scale_for_worst_weight_stream
568
Louis Verhaard93719a92020-12-08 10:02:31 +0100569 def bandwidth(self) -> float:
Tim Hall79d07d22020-04-27 18:20:16 +0100570 elems = shape_num_elements(self.bandwidth_shape)
571 if elems is None:
572 return 0
573 return elems * self.element_size() * self.bandwidth_compression_scale
574
Louis Verhaard93719a92020-12-08 10:02:31 +0100575 def consumers(self) -> List[Operation]:
Tim Hall79d07d22020-04-27 18:20:16 +0100576 return self.consumer_list
577
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100578 def get_4D_storage_shape_for_shape(self, op_shape4D: Shape4D) -> Shape4D:
579 rounding_quantum = full_shape(4, list(self.storage_rounding_quantum), 1)
580 return Shape4D(shape_round_to_quantum(op_shape4D.as_list(), rounding_quantum))
581
582 def addresses_for_rolling_buffer(self, start_coord: Shape, end_coord: Shape, op_shape4D: Shape4D) -> Tuple:
Tim Hall79d07d22020-04-27 18:20:16 +0100583 # returns ( box_height0, box_height1, box_width, [address_tl, address_tr, address_bl, address_br] )
584
Patrik Gustavsson2349d422020-12-01 16:02:29 +0100585 if self.storage_shape == []:
586 return (
587 1,
588 1,
589 1,
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100590 [self.address_for_coordinate(start_coord, op_shape4D=op_shape4D), None, None, None],
Patrik Gustavsson2349d422020-12-01 16:02:29 +0100591 )
Tim Hall79d07d22020-04-27 18:20:16 +0100592
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100593 if self.is_standard_fm:
594 storage_shape_4D = self.get_4D_storage_shape_for_shape(op_shape4D)
595 else:
596 storage_shape_4D = Shape4D(self.storage_shape)
597
598 crossing_y = numeric_util.round_up(start_coord[1] + 1, storage_shape_4D.height)
599 crossing_x = numeric_util.round_up(start_coord[2] + 1, storage_shape_4D.width)
Tim Hall79d07d22020-04-27 18:20:16 +0100600
601 crossing_y = min(crossing_y, end_coord[1])
602 crossing_x = min(crossing_x, end_coord[2])
603
604 box_height0 = crossing_y - start_coord[1]
605 box_width = crossing_x - start_coord[2]
606
Louis Verhaard93719a92020-12-08 10:02:31 +0100607 addresses: List = [None] * 4
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100608 addresses[0] = self.address_for_coordinate(start_coord, op_shape4D=op_shape4D)
Tim Hall79d07d22020-04-27 18:20:16 +0100609
610 if end_coord[2] > crossing_x:
Patrik Gustavsson2349d422020-12-01 16:02:29 +0100611 addresses[1] = self.address_for_coordinate(
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100612 [start_coord[0], start_coord[1], crossing_x, start_coord[3]], op_shape4D=op_shape4D
Patrik Gustavsson2349d422020-12-01 16:02:29 +0100613 )
Michael McGeagh528a56d2020-12-16 11:33:21 +0000614 raise UnsupportedFeatureError("Striping in vertical direction is not supported")
Tim Hall79d07d22020-04-27 18:20:16 +0100615 if end_coord[1] > crossing_y:
Patrik Gustavsson2349d422020-12-01 16:02:29 +0100616 addresses[2] = self.address_for_coordinate(
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100617 [start_coord[0], crossing_y, start_coord[2], start_coord[3]], op_shape4D=op_shape4D
Patrik Gustavsson2349d422020-12-01 16:02:29 +0100618 )
Tim Hall79d07d22020-04-27 18:20:16 +0100619 if end_coord[1] > crossing_y and end_coord[2] > crossing_x:
Patrik Gustavsson2349d422020-12-01 16:02:29 +0100620 addresses[3] = self.address_for_coordinate(
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100621 [start_coord[0], crossing_y, crossing_x, start_coord[3]], op_shape4D=op_shape4D
Patrik Gustavsson2349d422020-12-01 16:02:29 +0100622 )
Tim Hall79d07d22020-04-27 18:20:16 +0100623
624 return box_height0, box_height0, box_width, addresses
625
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100626 def address_for_coordinate(self, coord: Shape, is_top_box: bool = False, op_shape4D: Shape4D = None) -> int:
627 offset = self.address_offset_for_coordinate(coord, op_shape4D=op_shape4D, is_top_box=is_top_box)
Louis Verhaard93719a92020-12-08 10:02:31 +0100628 assert offset is not None
629 return self.address + offset
Tim Hall79d07d22020-04-27 18:20:16 +0100630
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100631 def get_strides_and_coord(
632 self, coord: Optional[Shape] = None, shape4D: Optional[Shape4D] = None
633 ) -> Tuple[Optional[Shape], Optional[Shape]]:
Tim Hall79d07d22020-04-27 18:20:16 +0100634 if coord is None:
Patrik Gustavsson46408a82021-09-20 10:47:47 +0200635 coord = [0] * min(len(self.storage_shape), 4)
Tim Hall79d07d22020-04-27 18:20:16 +0100636
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100637 if shape4D and self.is_standard_fm:
638 augmented_shape = self.get_4D_storage_shape_for_shape(shape4D).as_list()
639 else:
640 augmented_shape = full_shape(4, self.storage_shape, 1)
641
Tim Hall79d07d22020-04-27 18:20:16 +0100642 augmented_coord = coord
Tim Hall79d07d22020-04-27 18:20:16 +0100643
644 while len(augmented_coord) < 4:
645 augmented_coord = [0] + augmented_coord
646
647 assert len(augmented_coord) == len(augmented_shape)
648
649 if self.format == TensorFormat.NHWC:
650 augmented_shape = [augmented_shape[0], augmented_shape[3]] + augmented_shape[1:3] + [1]
651 augmented_coord = [augmented_coord[0], augmented_coord[3]] + augmented_coord[1:3] + [0]
Tim Hall79d07d22020-04-27 18:20:16 +0100652
653 elif self.format == TensorFormat.NHCWB16:
Patrik Gustavsson2213e902020-05-05 17:49:35 +0200654 channel_divisor = 16
Tim Hall79d07d22020-04-27 18:20:16 +0100655 augmented_shape = augmented_shape[0:4] + [1]
656 augmented_coord = (
657 [augmented_coord[0], augmented_coord[3] // channel_divisor]
658 + augmented_coord[1:3]
659 + [augmented_coord[3] % channel_divisor]
660 )
661
662 if augmented_shape[1] == 0:
663 augmented_shape[1] = 1
664
665 else:
Michael McGeaghf3e3ad72020-12-02 12:39:03 +0000666 assert self.format in (TensorFormat.Unknown, TensorFormat.WeightsCompressed)
Tim Hall79d07d22020-04-27 18:20:16 +0100667 return None, None
668
Louis Verhaard93719a92020-12-08 10:02:31 +0100669 strides: List = [0] * len(augmented_shape)
Tim Hall79d07d22020-04-27 18:20:16 +0100670 stride = self.element_size() * self.storage_compression_scale
671
672 if self.format != TensorFormat.NHCWB16:
Louis Verhaard93719a92020-12-08 10:02:31 +0100673 stride_order = [4, 1, 3, 2, 0]
Tim Hall79d07d22020-04-27 18:20:16 +0100674 for i in stride_order:
675 strides[i] = stride
676 stride *= augmented_shape[i]
677 else:
678 assert len(strides) == 5
Tim Hall79d07d22020-04-27 18:20:16 +0100679 strides[4] = stride
Patrik Gustavsson2213e902020-05-05 17:49:35 +0200680 strides[3] = 16 * stride # STRIDE_X
Tim Hall79d07d22020-04-27 18:20:16 +0100681 strides[1] = strides[3] * augmented_shape[2] # STRIDE_C
Louis Verhaardb2fb2122020-06-04 15:51:24 +0200682 strides[2] = augmented_shape[2] * augmented_shape[3] * stride # STRIDE_Y
Tim Hall79d07d22020-04-27 18:20:16 +0100683 strides[0] = strides[2] * augmented_shape[1] # STRIDE_N
684
685 return strides, augmented_coord
686
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100687 def get_strides(self, shape4D: Optional[Shape4D] = None) -> Shape:
688 strides, _ = self.get_strides_and_coord(shape4D=shape4D)
Louis Verhaard93719a92020-12-08 10:02:31 +0100689 assert strides is not None
Tim Hall79d07d22020-04-27 18:20:16 +0100690 return strides
691
Louis Verhaard93719a92020-12-08 10:02:31 +0100692 def find_npu_op(self) -> Optional[Operation]:
Tim Halld8339a72021-05-27 18:49:40 +0100693 # Returns the NPU operator that uses this tensor
Louis Verhaardb2fb2122020-06-04 15:51:24 +0200694 for op in self.consumers():
Dwight Lidman940fdee2020-08-13 13:11:48 +0200695 if op.run_on_npu:
Louis Verhaardb2fb2122020-06-04 15:51:24 +0200696 return op
Louis Verhaard93719a92020-12-08 10:02:31 +0100697 return None
Louis Verhaardb2fb2122020-06-04 15:51:24 +0200698
Louis Verhaard93719a92020-12-08 10:02:31 +0100699 def compressed_stream_index_from_coord(self, coord: Shape) -> int:
Tim Hall79d07d22020-04-27 18:20:16 +0100700 assert self.format == TensorFormat.WeightsCompressed
Louis Verhaard93719a92020-12-08 10:02:31 +0100701 assert self.compressed_values is not None
Tim Hall79d07d22020-04-27 18:20:16 +0100702 assert len(self.compressed_values) > 0
703 assert len(self.compressed_values) + 1 == len(self.weight_compressed_offsets)
704
705 depth = coord[-1]
706 brick_depth = self.brick_size[-1]
707 # Clamp position at final element index
708 if depth > self.shape[-1]:
709 depth = self.shape[-1]
710
711 # Always round up to next boundary
Michael McGeagh8d3216f2020-08-10 11:35:57 +0100712 index = numeric_util.round_up_divide(depth, brick_depth)
Tim Hall79d07d22020-04-27 18:20:16 +0100713
714 # Check boundaries on all but last weight set (which may be shorter
715 # than the brick we divided it up into)
716 if index < len(self.weight_compressed_offsets) - 1:
717 # There are no half-way points in the weights
718 if (depth % brick_depth) != 0:
Michael McGeagh528a56d2020-12-16 11:33:21 +0000719 raise UnsupportedFeatureError("Offset into weights must be aligned to a brick")
Tim Hall79d07d22020-04-27 18:20:16 +0100720
721 return index
722
Louis Verhaard93719a92020-12-08 10:02:31 +0100723 def size_of_compressed_stream(self, index: int) -> int:
724 assert self.compressed_values is not None
Tim Hall79d07d22020-04-27 18:20:16 +0100725 assert 0 <= index < len(self.compressed_values)
726 return len(self.compressed_values[index])
727
Louis Verhaard93719a92020-12-08 10:02:31 +0100728 def is_last_index_in_compressed_stream(self, index: int) -> bool:
729 assert self.compressed_values is not None
Tim Hall79d07d22020-04-27 18:20:16 +0100730 assert 0 <= index < len(self.compressed_values)
731 return index == len(self.compressed_values) - 1
732
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100733 def address_offset_for_coordinate(
734 self, orig_coord: Shape, op_shape4D: Optional[Shape4D] = None, is_top_box: bool = False
735 ) -> Optional[int]:
Tim Hall79d07d22020-04-27 18:20:16 +0100736 address_offset = 0
Tim Halld8339a72021-05-27 18:49:40 +0100737 assert self.purpose != TensorPurpose.Weights
Tim Hall79d07d22020-04-27 18:20:16 +0100738
739 if self.sub_purpose == TensorSubPurpose.Standard:
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100740 shape = op_shape4D.as_list() if op_shape4D else self.shape
Patrik Gustavsson2349d422020-12-01 16:02:29 +0100741 for idx, c in enumerate(orig_coord):
Tim Hall79d07d22020-04-27 18:20:16 +0100742 if is_top_box:
Patrik Gustavsson2349d422020-12-01 16:02:29 +0100743 assert c > 0 and c <= shape[idx]
Tim Hall79d07d22020-04-27 18:20:16 +0100744 else:
Patrik Gustavsson2349d422020-12-01 16:02:29 +0100745 assert c >= 0 and c < shape[idx]
Tim Halld8339a72021-05-27 18:49:40 +0100746 coord = orig_coord
747 if op_shape4D and self.is_standard_fm:
748 storage_shape = self.get_4D_storage_shape_for_shape(op_shape4D).as_list()
749 storage_size = self.storage_size_for_shape(storage_shape)
Tim Hall79d07d22020-04-27 18:20:16 +0100750 else:
Tim Halld8339a72021-05-27 18:49:40 +0100751 storage_shape = self.storage_shape
752 coord = coord[-len(storage_shape) :]
753 storage_size = self.storage_size()
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100754
Tim Halld8339a72021-05-27 18:49:40 +0100755 if is_top_box:
756 coord = [c - 1 for c in coord]
Tim Hall79d07d22020-04-27 18:20:16 +0100757
Tim Halld8339a72021-05-27 18:49:40 +0100758 # handle wraparound for partial buffers. make sure to do this after subtracting top box:
759 coord = [c % storage_shape[idx] for idx, c in enumerate(coord)]
Tim Hall79d07d22020-04-27 18:20:16 +0100760
Tim Halld8339a72021-05-27 18:49:40 +0100761 strides, augmented_coord = self.get_strides_and_coord(coord, op_shape4D)
762 if strides is None:
763 return None
Tim Hall79d07d22020-04-27 18:20:16 +0100764
Tim Halld8339a72021-05-27 18:49:40 +0100765 if is_top_box:
766 address_offset += 1 * strides[-1] # one element
Tim Hall79d07d22020-04-27 18:20:16 +0100767
Tim Halld8339a72021-05-27 18:49:40 +0100768 address_offset += np.dot(augmented_coord, strides)
Tim Hall79d07d22020-04-27 18:20:16 +0100769
770 assert address_offset >= 0
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100771 assert address_offset <= storage_size
Tim Hall79d07d22020-04-27 18:20:16 +0100772 return address_offset
773
Louis Verhaard93719a92020-12-08 10:02:31 +0100774 def is_allocated_in_tensor_arena(self, scratch_tensor_mem_area: MemArea) -> bool:
Michael McGeaghf3e3ad72020-12-02 12:39:03 +0000775 return (self.mem_area == scratch_tensor_mem_area) and (self.mem_type in (MemType.Scratch, MemType.Scratch_fast))
Patrik Gustavssoneca2e952020-05-27 09:15:11 +0200776
Louis Verhaard93719a92020-12-08 10:02:31 +0100777 def equivalent(self, tens: "Tensor") -> bool:
Louis Verhaard0b8268a2020-08-05 16:11:29 +0200778 return self.equivalence_id == tens.equivalence_id
779
Louis Verhaard93719a92020-12-08 10:02:31 +0100780 def set_all_shapes(self, shape: Shape):
Michael McGeagh6a8d4242020-07-28 12:17:59 +0100781 self.shape = shape
782 self.storage_shape = shape
783 self.bandwidth_shape = shape
784
Louis Verhaard93719a92020-12-08 10:02:31 +0100785 def get_full_shape(self) -> Shape:
Michael McGeagh5778ffd2020-08-06 17:31:02 +0100786 d = len(self.shape)
787 if d in (1, 3):
Patrik Gustavsson2349d422020-12-01 16:02:29 +0100788 return full_shape(4, self.shape, 1)
Michael McGeagh5778ffd2020-08-06 17:31:02 +0100789 elif d == 2:
790 return [self.shape[0], 1, 1, self.shape[1]]
791 else:
Fredrik Svedberg835d8e12020-09-04 09:46:17 +0200792 return self.shape.copy()
Michael McGeagh5778ffd2020-08-06 17:31:02 +0100793
Louis Verhaard93719a92020-12-08 10:02:31 +0100794 def is_quantized(self) -> bool:
Tim Hall93582962020-09-09 21:58:15 +0100795 # a tensor is quantized if it has an integral type and it contains valid quantization params
796
Tim Hall89567612020-10-27 11:57:57 +0000797 if not isinstance(self.quantization, QuantizationParameters):
Tim Hall93582962020-09-09 21:58:15 +0100798 return False
799
Tim Hall89567612020-10-27 11:57:57 +0000800 return (self.dtype.type & BaseType.Int) != 0 and self.quantization.is_valid()
Tim Hall93582962020-09-09 21:58:15 +0100801
James Peet7519d502021-07-19 16:47:58 +0100802 def get_scalar(self):
803 """
804 return: Unquantized or dequantized scalar value
805 rtype: self.dtype (if unquantized) or float (if dequantized)
806 """
807 assert self.values.size == 1, "get_scalar called on non-scalar tensor"
808 if self.is_quantized():
809 return self.quantization.dequantize(self.values).item(0)
810 else:
811 return self.values.item(0)
812
Louis Verhaard6c74c3b2020-12-17 13:54:09 +0100813 def __lt__(self, other: "Tensor") -> bool:
814 return self.equivalence_id < other.equivalence_id
815
Tim Hall79d07d22020-04-27 18:20:16 +0100816 def __str__(self):
817 return "<nng.Tensor '%s' shape=%s dtype=%s>" % (self.name, self.shape, self.dtype)
818
819 __repr__ = __str__
Tim Hall93582962020-09-09 21:58:15 +0100820
Michael McGeagh528a56d2020-12-16 11:33:21 +0000821 def error(self, msg):
822 """
823 Raises a VelaError exception for errors encountered when parsing a Tensor
824
825 :param self: Tensor object that resulted in the error
826 :param msg: str object that contains a description of the specific error encountered
827 """
828
829 def _print_operators(ops):
830 lines = []
831 for idx, op in enumerate(ops):
832 op_type = getattr(op, "type", "Not an Operation")
833 op_id = getattr(op, "op_index", "-")
834 lines.append(f" {idx} = {op_type} ({op_id})")
835 return lines
836
837 lines = [f"Invalid {self.name} tensor. {msg}"]
838
839 lines += [" Driving operators:"]
840 lines += _print_operators(self.ops)
841
842 lines += [" Consuming operators:"]
843 lines += _print_operators(self.consumer_list)
844
845 raise VelaError("\n".join(lines))
846
Tim Hall93582962020-09-09 21:58:15 +0100847
Louis Verhaard93719a92020-12-08 10:02:31 +0100848def check_quantized_tens_scaling_equal(tens_a: Tensor, tens_b: Tensor) -> bool:
Tim Hall93582962020-09-09 21:58:15 +0100849 # checks that the scaling of two quantized tensors are equal
850
Tim Hall89567612020-10-27 11:57:57 +0000851 return tens_a.is_quantized() and tens_b.is_quantized() and tens_a.quantization.is_scaling_equal(tens_b.quantization)