blob: 56932dbe01787c6ab44b4a969fde399d5e0a7d53 [file] [log] [blame]
Louis Verhaardebf4af62021-01-27 15:57:57 +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# Early optimisation of the network graph, using the rewrite_graph module to do the traversal of the graph. These are
18# split into two parts optimise_graph_a and optimise_graph_b.
Tim Hall79d07d22020-04-27 18:20:16 +010019import math
Diqing Zhong016b8272020-12-16 16:46:06 +010020import uuid
Louis Verhaardebf4af62021-01-27 15:57:57 +010021from typing import Tuple
Diego Russoea6111a2020-04-14 18:41:58 +010022
23import numpy as np
24
Louis Verhaardd7911c42020-08-25 13:36:41 +020025from . import fp_math
Louis Verhaardb9fc33c2020-08-13 11:47:36 +020026from . import lut
Diego Russoea6111a2020-04-14 18:41:58 +010027from . import rewrite_graph
Louis Verhaardd7911c42020-08-25 13:36:41 +020028from . import scaling
Louis Verhaard1a92f782021-02-09 16:08:26 +010029from .api import NpuRoundingMode
Diego Russoea6111a2020-04-14 18:41:58 +010030from .data_type import DataType
Tim Halle6ccd872020-11-09 16:46:37 +000031from .debug_database import DebugDatabase
Louis Verhaard7db78962020-05-25 15:05:26 +020032from .errors import UnsupportedFeatureError
Patrik Gustavsson3a269202021-01-21 08:28:55 +010033from .errors import VelaError
Dwight Lidman42fed942020-05-29 09:37:03 +020034from .ethos_u55_regs.ethos_u55_regs import resampling_mode
Louis Verhaard8912c532020-09-30 12:11:49 +020035from .numeric_util import clamp_sigmoid
Louis Verhaarde0ef2732020-06-03 08:56:44 +020036from .numeric_util import full_shape
Louis Verhaardf03bad32020-09-25 08:30:44 +020037from .numeric_util import round_away_zero
Louis Verhaarde8a5a782020-11-02 18:04:27 +010038from .operation import create_activation_function
Diego Russoe8a10452020-04-21 17:39:10 +010039from .operation import NpuBlockType
Louis Verhaardaee5d752020-09-30 09:01:52 +020040from .operation import Op
Diego Russoe8a10452020-04-21 17:39:10 +010041from .operation import Operation
Michael McGeagh16895482020-12-14 15:51:20 +000042from .operation import Padding
Fredrik Svedbergd9c2c422020-12-01 16:33:45 +010043from .operation_util import create_avgpool_nop
Louis Verhaardc822d622021-03-11 14:59:06 +010044from .operation_util import get_pad_values_from_input
patrik.gustavssoneeb85152020-12-21 17:10:40 +000045from .shape4d import Shape4D
Fredrik Svedberga0c36242020-06-03 15:43:31 +020046from .softmax import SoftMax
Tim Hall93582962020-09-09 21:58:15 +010047from .tensor import check_quantized_tens_scaling_equal
Michael McGeaghc5b549b2020-08-07 11:54:28 +010048from .tensor import create_const_tensor
Louis Verhaardc822d622021-03-11 14:59:06 +010049from .tensor import create_equivalence_id
Charles Xu9a03fdf2020-07-02 15:12:40 +020050from .tensor import QuantizationParameters
Diego Russoe8a10452020-04-21 17:39:10 +010051from .tensor import Tensor
Louis Verhaard1a92f782021-02-09 16:08:26 +010052from .tensor import TensorPurpose
Michael McGeagh7a6f8432020-12-02 15:29:22 +000053from .tflite_mapping import optype_to_builtintype
Tim Hall79d07d22020-04-27 18:20:16 +010054
Michael McGeaghf3e3ad72020-12-02 12:39:03 +000055passthrough_nodes = (Op.Identity,)
Tim Hall79d07d22020-04-27 18:20:16 +010056
Michael McGeaghf3e3ad72020-12-02 12:39:03 +000057memory_only_ops = (Op.Reshape,)
Michael McGeagh11b0bdb2020-09-08 11:07:35 +010058
Tim Hall79d07d22020-04-27 18:20:16 +010059
Louis Verhaardc822d622021-03-11 14:59:06 +010060def create_avg_pool_for_concat(concat_op, name, ifm, ifm_shape: Shape4D, write_offset: Shape4D):
61 """Creates an average pool for the given concat op/input feature map"""
62 ofm = concat_op.ofm
63 avgpool_op = create_avgpool_nop(name)
64 avgpool_op.inputs = [ifm]
65 avgpool_op.outputs = [ofm]
66
67 avgpool_op.write_offset = write_offset
68 avgpool_op.write_shape = ifm_shape
69 ofm.ops.append(avgpool_op)
70 DebugDatabase.add_optimised(concat_op, avgpool_op)
71 avgpool_op.ifm_shapes.append(ifm_shape)
72 avgpool_op.ofm_shapes.append(concat_op.ofm_shapes[0])
73 avgpool_op.memory_function = Op.ConcatSliceWrite
74 return avgpool_op
75
76
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +020077def remove_passthrough_tensor(tens, arch, nng):
Tim Hall79d07d22020-04-27 18:20:16 +010078 if len(tens.ops) == 1 and tens.ops[0].type in passthrough_nodes:
79 assert len(tens.ops[0].inputs) == 1
80 tens = tens.ops[0].inputs[0]
81 return tens
82
83
Patrik Gustavsson2c2522d2021-01-29 11:51:31 +010084def rewrite_concat_ops(op, arch):
Patrik Gustavsson3a269202021-01-21 08:28:55 +010085 if not op.run_on_npu or not op.type.is_concat_op():
Louis Verhaardc822d622021-03-11 14:59:06 +010086 return
Tim Hall79d07d22020-04-27 18:20:16 +010087
Patrik Gustavsson3a269202021-01-21 08:28:55 +010088 axis_4D = 0
89 ofm = op.ofm
90 ofm.ops = []
91 offset = 0
Tim Hall79d07d22020-04-27 18:20:16 +010092
Patrik Gustavsson7bada402021-01-28 15:46:21 +010093 unfuse_activation_function(op)
94
Patrik Gustavsson3a269202021-01-21 08:28:55 +010095 if op.type == Op.Pack:
96 # Pack is also referred to as Stack
97 axis = int(op.attrs["axis"])
98 desired_shape = op.inputs[0].shape[:axis] + [1] + op.inputs[0].shape[axis:]
Tim Hall79d07d22020-04-27 18:20:16 +010099
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100100 if axis >= 0:
101 axis_4D = axis + (4 - len(desired_shape))
102 else:
103 axis_4D = axis
104
105 for idx, inp in enumerate(op.inputs):
106 op.ifm_shapes[idx] = Shape4D(desired_shape)
107 if Shape4D(inp.shape) != op.ifm_shapes[idx]:
108 inp.avoid_NHCWB16 = True
109 op.type = Op.PackReshaped
110
111 inputs, axis = op.get_concat_inputs_axis()
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100112 for idx, inp in enumerate(inputs):
113 if op.type != Op.PackReshaped:
114 op.ifm_shapes[idx] = Shape4D(inp.shape)
Patrik Gustavsson3d737172020-12-22 10:40:51 +0100115 if axis >= 0:
116 axis_4D = axis + (4 - len(inp.shape))
117 else:
118 axis_4D = axis
Louis Verhaardc822d622021-03-11 14:59:06 +0100119 write_offset = [0, 0, 0, 0]
120 write_offset[axis_4D] = offset
121 concat_end = offset + op.ifm_shapes[idx][axis_4D]
122 create_avg_pool_for_concat(
123 op, op.name + str(idx) + "_avgpool", inp, op.ifm_shapes[idx], Shape4D.from_list(write_offset)
124 )
125 offset = concat_end
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100126 assert ofm.shape[axis] == offset
Patrik Gustavsson458a2082020-08-13 13:41:05 +0200127
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100128 # If axis corresponds to C-dimension, NHCWB16 can only be used in the output if all the concat_start's are a
129 # multiple of 16. This as, it is only then the address offset for the ofm, for all operations, will be 16 byte
130 # aligned. For other values of axis the address offsets will be 16 byte aligned, as they are all based on c = 0
131 # and those addresses are always 16 byte aligned due to the NHCWB16 format.
132 if axis == -1 or axis == (len(ofm.shape) - 1):
Louis Verhaardc822d622021-03-11 14:59:06 +0100133 ofm.avoid_NHCWB16 = any(op2.write_offset.depth % 16 != 0 for op2 in ofm.ops if op2.write_offset is not None)
Tim Hall79d07d22020-04-27 18:20:16 +0100134
135
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100136def rewrite_split_ops(tens, arch, nng):
Tim Hall79d07d22020-04-27 18:20:16 +0100137
Patrik Gustavsson224e99b2021-01-14 10:55:43 +0100138 if len(tens.ops) == 1 and tens.ops[0].type.is_split_op() and tens.ops[0].type != Op.Unpack:
Tim Hall79d07d22020-04-27 18:20:16 +0100139 split_op = tens.ops[0]
140
141 # Not supported so leave it and run on CPU
142 if not split_op.run_on_npu:
143 return tens
144
145 inp, outputs, axis, offset_start, offset_end = split_op.get_split_inputs_axis()
146
147 tens.ops = []
Louis Verhaardaee5d752020-09-30 09:01:52 +0200148 new_op = Operation(Op.SplitSliceRead, split_op.name)
Tim Hall79d07d22020-04-27 18:20:16 +0100149 new_op.inputs = [inp]
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100150 ofm_shape_idx = 0
Tim Hall79d07d22020-04-27 18:20:16 +0100151
152 # For Split the offset cannot be extracted from the tensor so it has to
153 # be calculated from the index of the output tensor
Diego Russoea6111a2020-04-14 18:41:58 +0100154 if axis is not None:
Tim Hall79d07d22020-04-27 18:20:16 +0100155 # Get the start and end of the split
Patrik Gustavsson2349d422020-12-01 16:02:29 +0100156 offset_start = [0] * 4
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100157 axis_4D_list = split_op.attrs.get("split_axis_4D", None) # Present for UnpackReshaped and some StridedSlice
Patrik Gustavsson2349d422020-12-01 16:02:29 +0100158 for idx, out in enumerate(outputs):
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100159 if axis_4D_list is not None:
160 axis_4D = axis_4D_list[idx]
Patrik Gustavsson3d737172020-12-22 10:40:51 +0100161 else:
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100162 split_op.ofm_shapes[idx] = Shape4D(out.shape)
163 if axis >= 0:
164 axis_4D = axis + (4 - len(out.shape))
165 else:
166 axis_4D = axis
167
168 if out == tens:
169 ofm_shape_idx = idx
170 break
patrik.gustavssoneeb85152020-12-21 17:10:40 +0000171
Tim Hall73e843f2021-02-04 22:47:46 +0000172 offset_start[axis_4D] += split_op.ofm_shapes[idx][axis_4D]
Tim Hall79d07d22020-04-27 18:20:16 +0100173
Patrik Gustavssoneebb1c22020-08-18 15:03:04 +0200174 # If start offset is not a multiple of 16 in the C-dimension, NHCWB16 need to be avoided in the input
175 if (offset_start[-1] % 16) != 0:
176 inp.avoid_NHCWB16 = True
Tim Hall79d07d22020-04-27 18:20:16 +0100177
Patrik Gustavssone3b1b912021-02-09 15:38:46 +0100178 new_op.read_offsets[0] = Shape4D.from_list(offset_start, 0)
Tim Hall79d07d22020-04-27 18:20:16 +0100179 new_op.run_on_npu = True
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100180 new_op.set_output_tensor(tens)
Patrik Gustavsson224e99b2021-01-14 10:55:43 +0100181 new_op.ifm_shapes.append(Shape4D(inp.shape))
Tim Hall73e843f2021-02-04 22:47:46 +0000182 new_op.ofm_shapes.append(split_op.ofm_shapes[ofm_shape_idx])
Tim Halle6ccd872020-11-09 16:46:37 +0000183 DebugDatabase.add_optimised(split_op, new_op)
Tim Hall79d07d22020-04-27 18:20:16 +0100184
185 return tens
186
187
Patrik Gustavssone3b1b912021-02-09 15:38:46 +0100188def remove_SplitSliceRead(op, arch):
189
190 if op.type == Op.SplitSliceRead:
191 # Check if it is possible to put the SplitSliceRead on the tensor consumer, or if an avgpool need to be inserted
192 if (
193 len(op.ofm.consumer_list) == 1
194 and op.ofm.consumer_list[0] is not None
195 and op.ofm.consumer_list[0].run_on_npu
196 and op.ofm.consumer_list[0].type != Op.Reshape
197 and op.ofm_shapes[0] == Shape4D.from_list(op.ofm.shape)
198 ):
199 # SplitSliceRead can be performed by tensor consumer
200 cons_op = op.ofm.consumer_list[0]
201 if cons_op.ifm == op.ofm:
202 cons_op.read_offsets[0] = op.read_offsets[0]
203 cons_op.set_input_tensor(op.ifm, cons_op.type.info.indices.ifms[0])
204 cons_op.ifm_shapes[0] = op.ifm_shapes[0]
205 elif cons_op.type.is_binary_elementwise_op() and cons_op.ifm2 == op.ofm:
206 cons_op.read_offsets[1] = op.read_offsets[0]
207 cons_op.set_input_tensor(op.ifm, cons_op.type.info.indices.ifms[1])
208 cons_op.ifm_shapes[1] = op.ifm_shapes[0]
209
210 op.ofm.consumer_list.remove(cons_op)
211 op.ofm.ops = []
212 op.ifm.consumer_list.remove(op)
213 else:
214 avgpool_op = create_avgpool_nop(op.name + "_avgpool")
215 avgpool_op.add_input_tensor(op.ifm)
216 avgpool_op.outputs = [op.ofm]
217 op.ofm.ops.remove(op)
218 op.ofm.ops.append(avgpool_op)
219 avgpool_op.ifm_shapes.append(op.ifm_shapes[0])
220 avgpool_op.ofm_shapes.append(op.ofm_shapes[0])
221 avgpool_op.read_offsets[0] = op.read_offsets[0]
222
223 op.ifm.consumer_list.remove(op)
224 DebugDatabase.add_optimised(op, avgpool_op)
225
226
Patrik Gustavsson138d47f2021-02-08 10:13:48 +0100227def insert_copy_op_after_tens(tens):
228 tens_cons_list_copy = tens.consumer_list.copy()
229
230 # Create a avg_pool nop op with ifm as input
231 copy_tens = tens.clone()
232 copy_op = create_avgpool_nop(tens.name + "_avgpool")
233 copy_op.add_input_tensor(tens)
234 copy_op.set_output_tensor(copy_tens)
235 copy_op.set_ifm_ofm_shapes()
236 copy_op.run_on_npu = True
237
238 # Set copy_ifm consumers
239 for tens_cons in tens_cons_list_copy:
240 if tens_cons is not None:
241 for ifm_idx, cons_inp in enumerate(tens_cons.inputs):
242 if cons_inp == tens:
243 tens_cons.set_input_tensor(copy_tens, ifm_idx)
244
245 DebugDatabase.add_optimised(tens.ops[0], copy_op)
246
247
248def fix_sg_input_output(op, arch, nng):
249 if not op.run_on_npu or op.type != Op.Reshape:
250 return op
251
Patrik Gustavssone3b1b912021-02-09 15:38:46 +0100252 # For the Reshape operators we want to remove, tensors are removed.
Patrik Gustavsson138d47f2021-02-08 10:13:48 +0100253 # But in order to to do this, they cannot be outputs of the sg,
254 # this need to be fixed prior to the removal.
255 # Solution is to add a avgpool NOP, to maintain the original tensor.
256
257 # Check if operator ifm/ofm are sg ifm/ofm
258 ifm_is_sg_ifm = op.ifm.ops[0].type in (Op.Placeholder, Op.SubgraphInput, Op.Const)
259 ifm_is_sg_ofm = any(ifm_cons is None for ifm_cons in op.ifm.consumer_list)
260 ofm_is_sg_ofm = any(ofm_cons is None for ofm_cons in op.ofm.consumer_list)
261
262 if op.type == Op.Reshape and (ifm_is_sg_ofm or ifm_is_sg_ifm) and ofm_is_sg_ofm:
263 # Both ifm and ofm are sg outputs, only ifm need a copy, in order to remove the Reshape
264 insert_copy_op_after_tens(op.ifm)
265
266 return op
267
268
Tim Hall79d07d22020-04-27 18:20:16 +0100269def needed_total_padding(input_size, stride, filter_size):
270 out_size = (input_size + stride - 1) // stride
271 needed_input = (out_size - 1) * stride + filter_size
272 total_padding = max(0, needed_input - input_size)
273 return total_padding
274
275
Louis Verhaardebf4af62021-01-27 15:57:57 +0100276def calc_explicit_padding(input_size, stride, filter_size, pad_before, pad_after) -> Tuple[int, int]:
277 """
278 Based on explicit padding provided in a PAD operation, returns the corresponding hardware padding
279 that provides equivalent results.
280 """
281 total_padding = needed_total_padding(input_size, stride, filter_size)
282 # The top/left padding can be taken as is from the PAD
283 output_pad_before = pad_before
284 # The bottom/right padding might need downward adjustment depending on stride/input size
285 output_pad_after = pad_after
286 while output_pad_after > 0 and output_pad_after % stride != (total_padding - pad_before) % stride:
287 output_pad_after -= 1
288 return output_pad_before, output_pad_after
289
290
291def calc_padding_and_skirt(padding_type, kernel, input_shape, explicit_padding):
292 k_w, k_h = kernel.dilated_wh()
293 s_x, s_y = kernel.stride
294 ypad = needed_total_padding(int(input_shape.height), int(s_y), int(k_h))
295 xpad = needed_total_padding(int(input_shape.width), int(s_x), int(k_w))
Michael McGeagh16895482020-12-14 15:51:20 +0000296 if padding_type == Padding.SAME:
Tim Hall79d07d22020-04-27 18:20:16 +0100297 left_pad = (xpad + 0) // 2
298 right_pad = (xpad + 1) // 2
299 top_pad = (ypad + 0) // 2
300 bottom_pad = (ypad + 1) // 2
Michael McGeagh16895482020-12-14 15:51:20 +0000301 elif padding_type == Padding.VALID:
Tim Hall79d07d22020-04-27 18:20:16 +0100302 left_pad = 0
303 right_pad = 0
304 top_pad = 0
305 bottom_pad = 0
Louis Verhaardae2d5532020-12-11 17:19:54 +0100306 elif padding_type == Padding.EXPLICIT:
307 # Padding is specified in a PAD operator which has been bypassed.
Louis Verhaardebf4af62021-01-27 15:57:57 +0100308 top, left, bottom, right = explicit_padding
309 top_pad, bottom_pad = calc_explicit_padding(int(input_shape.height), int(s_y), int(k_h), int(top), int(bottom))
310 left_pad, right_pad = calc_explicit_padding(int(input_shape.width), int(s_x), int(k_w), int(left), int(right))
Tim Hall79d07d22020-04-27 18:20:16 +0100311 else:
Michael McGeagh16895482020-12-14 15:51:20 +0000312 raise UnsupportedFeatureError(f"Unknown padding")
Tim Hall79d07d22020-04-27 18:20:16 +0100313 padding = (top_pad, left_pad, bottom_pad, right_pad)
314 skirt = (top_pad, left_pad, ypad - top_pad, xpad - left_pad)
315 return padding, skirt
316
Tim Hallc30f4952020-06-15 20:47:35 +0100317
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100318def calc_upscaled_padding_and_skirt(padding_type, kernel_size, stride, input_shape, upscaling_factor):
Jacob Bohlin9b64ba02020-07-07 17:15:22 +0200319 kernel_height, kernel_width = kernel_size[0], kernel_size[1]
Michael McGeagh16895482020-12-14 15:51:20 +0000320 if padding_type == Padding.SAME:
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100321 ypad = needed_total_padding(int(input_shape.height) * upscaling_factor, int(stride[1]), int(kernel_height))
322 xpad = needed_total_padding(int(input_shape.width) * upscaling_factor, int(stride[2]), int(kernel_width))
Jacob Bohlind47cc272020-08-24 11:42:14 +0200323 right_pad = max(((xpad + 1) // upscaling_factor) - 1, 0)
324 bottom_pad = max(((ypad + 1) // upscaling_factor) - 1, 0)
Jacob Bohlin9b64ba02020-07-07 17:15:22 +0200325 left_pad = max(kernel_width - 1 - right_pad, 0)
326 top_pad = max(kernel_height - 1 - bottom_pad, 0)
Michael McGeagh16895482020-12-14 15:51:20 +0000327 elif padding_type == Padding.VALID:
Jacob Bohlin9b64ba02020-07-07 17:15:22 +0200328 right_pad = max(kernel_width - 2, 0)
329 bottom_pad = max(kernel_height - 2, 0)
330 left_pad = kernel_width - 1
331 top_pad = kernel_height - 1
Jacob Bohlincf7da102020-05-20 09:03:40 +0200332 else:
Michael McGeagh16895482020-12-14 15:51:20 +0000333 raise UnsupportedFeatureError(f"Unknown padding")
Jacob Bohlincf7da102020-05-20 09:03:40 +0200334 padding = (top_pad, left_pad, bottom_pad, right_pad)
Jacob Bohlin9b64ba02020-07-07 17:15:22 +0200335 skirt = padding
Jacob Bohlincf7da102020-05-20 09:03:40 +0200336 return padding, skirt
337
Tim Hall79d07d22020-04-27 18:20:16 +0100338
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200339def fixup_conv2d_backprop(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200340 if op.type == Op.Conv2DBackpropInput:
Tim Hall79d07d22020-04-27 18:20:16 +0100341 # flip the inputs
342 op.inputs[0], op.inputs[2] = op.inputs[2], op.inputs[0]
Louis Verhaardaee5d752020-09-30 09:01:52 +0200343 op.type = Op.Conv2DBackpropInputSwitchedBias
Louis Verhaard69b84802020-12-16 12:02:28 +0100344 op.ifm.resampling_mode = resampling_mode.TRANSPOSE
Jacob Bohlincf7da102020-05-20 09:03:40 +0200345
346 # Update strides
Tim Hallc30f4952020-06-15 20:47:35 +0100347 op.attrs.update({"stride_w": 1, "stride_h": 1, "strides": (1, 1, 1, 1)})
Tim Hall79d07d22020-04-27 18:20:16 +0100348
349 return op
350
351
Charles Xu9a03fdf2020-07-02 15:12:40 +0200352# Convert the op to an elementwise add
353def convert_resizebilinear_1x1_to_add(op):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200354 op.type = Op.Add
Charles Xu9a03fdf2020-07-02 15:12:40 +0200355 op.name = op.name + "_add"
Charles Xu9a03fdf2020-07-02 15:12:40 +0200356 op.attrs["resizebilinear"] = True
357 # Create an input tensor filled with zeros
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100358 shape = op.ofm_shapes[0].as_list()
Charles Xu9a03fdf2020-07-02 15:12:40 +0200359 tens = Tensor(shape, op.inputs[0].dtype, op.inputs[1].name + "_add")
360 tens.values = np.zeros(shape)
361 tens.quant_values = np.zeros(shape, np.uint8)
362 tens.quantization = QuantizationParameters(0.0, 255.0)
363 tens.quantization.scale_f32 = 1.0
364 tens.quantization.zero_point = 0
365 tens.consumer_list = [op]
366 tens_op = op.inputs[1].ops[0]
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100367 tens_op.set_output_tensor(tens)
Charles Xu9a03fdf2020-07-02 15:12:40 +0200368 # Set the add inputs
369 op.inputs[1] = op.inputs[0]
370 op.inputs[0] = tens
patrik.gustavssoneeb85152020-12-21 17:10:40 +0000371 op.set_ifm_ofm_shapes()
Charles Xu9a03fdf2020-07-02 15:12:40 +0200372
373 return op
374
375
Charles Xu87c13502020-08-06 12:17:26 +0200376# Convert ResizeBilinear to a number of 2x2 pool ops
377def convert_resizebilinear_to_2x2_pool(op):
378 count = 0
379 pre_op = op
380 outputs = op.outputs
381
382 op.attrs.update({"strides": (1, 1, 1, 1), "ksize": (1, 2, 2, 1)})
383 if op.attrs["align_corners"]:
384 shape_modifier = 1
Michael McGeagh16895482020-12-14 15:51:20 +0000385 op.attrs["padding"] = Padding.VALID
Charles Xu87c13502020-08-06 12:17:26 +0200386 else:
387 shape_modifier = 0
Michael McGeagh16895482020-12-14 15:51:20 +0000388 op.attrs["padding"] = Padding.SAME
Charles Xu87c13502020-08-06 12:17:26 +0200389 op.inputs[0].resampling_mode = resampling_mode.NEAREST
390
Patrik Gustavsson2c2522d2021-01-29 11:51:31 +0100391 upscaled_shape = np.array(op.ifm_shapes[0].get_hw_as_list())
392 out_shape = np.array(op.ofm_shapes[0].get_hw_as_list())
Charles Xu87c13502020-08-06 12:17:26 +0200393 if (upscaled_shape == upscaled_shape * 2 - shape_modifier).all():
394 return op
395
396 while (upscaled_shape < out_shape).all():
397 if count == 0:
398 scaled_op = pre_op
399 else:
400 scaled_op = op.clone("_{}".format(count))
401 scaled_op.inputs[0] = pre_op.outputs[0]
402
403 upscaled_shape = upscaled_shape * 2 - shape_modifier
404
405 if (upscaled_shape == out_shape).all():
406 scaled_op.outputs = outputs
407 scaled_op.outputs[0].ops = [scaled_op]
408 else:
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100409 shape = op.ofm_shapes[0].as_list()
410 shape[1:3] = upscaled_shape
Charles Xu87c13502020-08-06 12:17:26 +0200411 out_tens = Tensor(shape, DataType.int16, "{}_{}".format(op.outputs[0].name, count))
412 out_tens.quantization = op.outputs[0].quantization.clone()
413 out_tens.quantization.quant_min = np.iinfo(np.int16).min
414 out_tens.quantization.quant_max = np.iinfo(np.int16).max
415 scaled_op.set_output_tensor(out_tens)
416 pre_op = scaled_op
417 count += 1
418
419 # Setup the scale value
420 if scaled_op.inputs[0].dtype.bits == 8 and scaled_op.outputs[0].dtype.bits == 16:
Fredrik Svedberge82be7c2021-01-18 15:21:03 +0100421 scaled_op.rescale = 128
Charles Xu87c13502020-08-06 12:17:26 +0200422 elif scaled_op.inputs[0].dtype.bits == 16 and scaled_op.outputs[0].dtype.bits == 8:
Fredrik Svedberge82be7c2021-01-18 15:21:03 +0100423 scaled_op.rescale = 1 / 128
424 else:
425 scaled_op.rescale = None
Patrik Gustavssoncc6915c2020-12-22 09:16:50 +0100426 scaled_op.set_ifm_ofm_shapes()
Charles Xu87c13502020-08-06 12:17:26 +0200427
428 return op
429
430
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200431def fixup_resizebilinear(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200432 if op.type == Op.ResizeBilinear and op.run_on_npu:
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100433 if op.ifm_shapes[0] == op.ofm_shapes[0]:
Charles Xu36ffaf32020-08-05 15:40:44 +0200434 # Bypass nop resizebilinear
435 op.inputs = op.inputs[:1]
Louis Verhaardaee5d752020-09-30 09:01:52 +0200436 op.type = Op.Identity
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100437 elif op.ifm_shapes[0].height == 1 and op.ifm_shapes[0].width == 1:
Charles Xu87c13502020-08-06 12:17:26 +0200438 convert_resizebilinear_1x1_to_add(op)
439 else:
440 convert_resizebilinear_to_2x2_pool(op)
Charles Xu9a03fdf2020-07-02 15:12:40 +0200441
442 return op
443
444
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200445def convert_nop_split_to_identity(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200446 if op.type == Op.Split and op.attrs.get("num_splits") == 1:
Dwight Lidmanc3862c22020-09-14 15:22:33 +0200447 # the list comprehension should return a list with a single tensor
448 # if it shouldn't, remove_passthrough_tensor will fail appropriately
449 op.inputs = [i for i in op.inputs if i.shape == op.outputs[0].shape]
Louis Verhaardaee5d752020-09-30 09:01:52 +0200450 op.type = Op.Identity
Dwight Lidmanc3862c22020-09-14 15:22:33 +0200451 return op
452
453
Patrik Gustavsson2c2522d2021-01-29 11:51:31 +0100454def rewrite_fully_connected_input(op, arch, nng):
455 if op.type == Op.FullyConnected:
456 n_in_elems = op.weights.shape[-2]
457 elms = op.ifm.elements()
458 batch_size = elms // n_in_elems
459 assert batch_size * n_in_elems == elms
460
Patrik Gustavsson2c2522d2021-01-29 11:51:31 +0100461 op.ifm_shapes[0] = Shape4D([batch_size, 1, 1, n_in_elems])
Patrik Gustavssonda2b0032021-02-04 16:28:29 +0100462 if Shape4D(op.ifm.shape) != op.ifm_shapes[0]:
463 op.ifm.avoid_NHCWB16 = True
Patrik Gustavsson2c2522d2021-01-29 11:51:31 +0100464 return op
465
466
Diqing Zhong94457b12020-12-09 15:22:40 +0100467def convert_batched_fc_shape(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200468 if op.type == Op.FullyConnected:
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100469 # Check if the first dimension indicates batching
470 if op.ifm_shapes[0].batch > 1:
Patrik Gustavssoncb337042020-09-16 14:55:40 +0200471 batching_split = {4: (2, 2), 8: (2, 4), 16: (4, 4)}
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100472 n = op.ifm_shapes[0].batch
Patrik Gustavssoncb337042020-09-16 14:55:40 +0200473 h, w = batching_split.get(n, (1, n))
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100474 op.ifm_shapes[0] = Shape4D([1, h, w, op.ifm_shapes[0].depth])
Patrik Gustavssoncb337042020-09-16 14:55:40 +0200475
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100476 op.ifm.avoid_NHCWB16 = True
Patrik Gustavssoncb337042020-09-16 14:55:40 +0200477
478 # Reshape Weights to be 4D. IO becomes HWIO
479 weight_tensor = op.inputs[1]
480 weight_tensor.quant_values = np.expand_dims(np.expand_dims(weight_tensor.quant_values, axis=0), axis=0)
481 weight_tensor.set_all_shapes(list(weight_tensor.quant_values.shape))
482
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100483 n = op.ofm_shapes[0].batch
484 h, w = batching_split.get(n, (1, n))
485 op.ofm_shapes[0] = Shape4D([1, h, w, op.ofm_shapes[0].depth])
486 op.ofm.avoid_NHCWB16 = True
Tim Hall79d07d22020-04-27 18:20:16 +0100487 return op
488
489
Patrik Gustavsson7bada402021-01-28 15:46:21 +0100490def unfuse_activation_function(op):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200491 if op.type == Op.ConcatTFLite and op.run_on_npu and op.activation is not None:
Louis Verhaarde8a5a782020-11-02 18:04:27 +0100492 act_op = Operation(op.activation.op_type, op.name + op.activation.op_type.name)
Louis Verhaardaee5d752020-09-30 09:01:52 +0200493 op.activation = None
Fredrik Svedberg0f98b362020-09-29 10:00:39 +0200494 out_tens = op.outputs[0]
495 intermediate_tens = out_tens.clone("_act_intermediate")
496 act_op.set_output_tensor(out_tens)
497 act_op.add_input_tensor(intermediate_tens)
498 op.set_output_tensor(intermediate_tens)
patrik.gustavssoneeb85152020-12-21 17:10:40 +0000499 act_op.set_ifm_ofm_shapes()
Fredrik Svedberg0f98b362020-09-29 10:00:39 +0200500
Louis Verhaard8912c532020-09-30 12:11:49 +0200501
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100502def rewrite_stridedslice_output(op, arch, nng):
503 if not op.run_on_npu or op.type != Op.StridedSlice:
504 return op
505
506 new_axis_mask = op.attrs["new_axis_mask"]
507 shrink_axis_mask = op.attrs["shrink_axis_mask"]
508
509 if shrink_axis_mask == 0 and new_axis_mask == 0:
510 return op
511
512 axis_4D = [0] * len(op.outputs)
513 for idx, out_tens in enumerate(op.outputs):
514 output_shape = list(out_tens.shape)
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100515
Dwight Lidman73320a42020-11-05 10:34:41 +0100516 if shrink_axis_mask != 0:
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100517 n = 0
518 axis = 0
519 while shrink_axis_mask:
520 prev_mask = shrink_axis_mask
521 n += 1
522 shrink_axis_mask &= shrink_axis_mask - 1
523 axis = int(math.log2(prev_mask - shrink_axis_mask))
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100524 output_shape = output_shape[:axis] + [1] + output_shape[axis:]
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100525
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100526 assert len(out_tens.shape) == (len(op.inputs[0].shape) - n)
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100527 op.attrs["shrink_axis_mask"] = 0
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100528 if axis >= 0:
529 axis_4D[idx] = axis + (4 - len(output_shape))
530 else:
531 axis_4D[idx] = axis
532 op.ofm_shapes[idx] = Shape4D(output_shape)
533
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100534 elif new_axis_mask != 0:
535 n = 0
536 axis = 0
537 while new_axis_mask:
538 prev_mask = new_axis_mask
539 n += 1
540 new_axis_mask &= new_axis_mask - 1
541 axis = int(math.log2(prev_mask - new_axis_mask))
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100542 output_shape = output_shape[:axis] + output_shape[(axis + 1) :]
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100543 new_axis_mask >>= 1
544
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100545 assert len(out_tens.shape) == (len(op.inputs[0].shape) + n)
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100546 op.attrs["new_axis_mask"] = 0
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100547 if axis >= 0:
548 axis_4D[idx] = axis + (4 - len(output_shape))
549 else:
550 axis_4D[idx] = axis
551 op.ofm_shapes[idx] = Shape4D(output_shape)
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100552
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100553 if op.ofm_shapes[idx] != Shape4D(out_tens.shape):
554 out_tens.avoid_NHCWB16 = True
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100555
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100556 op.attrs["split_axis_4D"] = axis_4D
557 return op
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100558
559
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100560def rewrite_unpack_output(op, arch, nng):
561 tens = op.outputs[0]
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100562 if op.run_on_npu and op.type == Op.Unpack:
Tim Hall79d07d22020-04-27 18:20:16 +0100563 # Unpack is also referred to as Unstack
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100564 axis = int(op.attrs["axis"])
565 op.type = Op.UnpackReshaped
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100566 desired_output_shape = tens.shape[:axis] + [1] + tens.shape[axis:]
Tim Hall79d07d22020-04-27 18:20:16 +0100567
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100568 if axis >= 0:
569 axis_4D = axis + (4 - len(desired_output_shape))
570 else:
571 axis_4D = axis
Tim Hall79d07d22020-04-27 18:20:16 +0100572
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100573 axis_4D_list = [0] * len(op.outputs)
Tim Hall79d07d22020-04-27 18:20:16 +0100574 for idx, out_tens in enumerate(op.outputs):
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100575 op.ofm_shapes[idx] = Shape4D(desired_output_shape)
576 axis_4D_list[idx] = axis_4D
577 if op.ofm_shapes[idx] != Shape4D(out_tens.shape):
578 out_tens.avoid_NHCWB16 = True
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100579
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100580 op.attrs["split_axis_4D"] = axis_4D_list
581 return op
Tim Hall79d07d22020-04-27 18:20:16 +0100582
583
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200584def add_padding_fields(op, arch, nng):
Jacob Bohlin90033f32020-08-28 15:45:44 +0200585 if op.run_on_npu:
586 if "padding" in op.attrs:
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100587 input_shape = op.ifm_shapes[0]
588 output_shape = op.ofm_shapes[0]
Louis Verhaardaee5d752020-09-30 09:01:52 +0200589 if op.type.is_conv2d_op() or op.type.is_depthwise_conv2d_op():
Jacob Bohlin90033f32020-08-28 15:45:44 +0200590 kernel_size = op.inputs[1].shape[:2]
Louis Verhaardaee5d752020-09-30 09:01:52 +0200591 elif op.type.is_pool_op() or op.type.npu_block_type == NpuBlockType.ReduceSum:
Jacob Bohlin90033f32020-08-28 15:45:44 +0200592 kernel_size = op.attrs["ksize"][1:3]
Jacob Bohlin90033f32020-08-28 15:45:44 +0200593 else:
Michael McGeagh7a6f8432020-12-02 15:29:22 +0000594 raise UnsupportedFeatureError(f"Unknown operation that uses padding: {optype_to_builtintype(op.type)}")
Tim Hall79d07d22020-04-27 18:20:16 +0100595
Louis Verhaardaee5d752020-09-30 09:01:52 +0200596 if op.type == Op.Conv2DBackpropInputSwitchedBias:
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100597 upscaling_factor = output_shape.height // input_shape.height
Jacob Bohlin90033f32020-08-28 15:45:44 +0200598 padding, skirt = calc_upscaled_padding_and_skirt(
599 op.attrs["padding"], kernel_size, op.attrs["strides"], input_shape, upscaling_factor
600 )
601 else:
Jacob Bohlin90033f32020-08-28 15:45:44 +0200602 padding, skirt = calc_padding_and_skirt(
Louis Verhaardebf4af62021-01-27 15:57:57 +0100603 op.attrs["padding"], op.kernel, input_shape, op.attrs.get("explicit_padding"),
Jacob Bohlin90033f32020-08-28 15:45:44 +0200604 )
Jacob Bohlincf7da102020-05-20 09:03:40 +0200605
Jacob Bohlin90033f32020-08-28 15:45:44 +0200606 op.attrs["explicit_padding"] = padding
607 op.attrs["skirt"] = skirt
Jacob Bohlincf7da102020-05-20 09:03:40 +0200608
Tim Hall79d07d22020-04-27 18:20:16 +0100609 return op
610
611
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200612def convert_depthwise_to_conv(op, arch, nng):
Tim Hall79d07d22020-04-27 18:20:16 +0100613 # Depthwise is equivalent to a single conv2d if the ifm depth is 1 and
614 # the ofm depth equals the depth multipler.
615 # If those conditions are true, then we can perform a simple
616 # switch of the operator type (and weight order)
617
Louis Verhaardaee5d752020-09-30 09:01:52 +0200618 if op.type == Op.DepthwiseConv2DBias and (op.attrs["depth_multiplier"] != 1):
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100619 ifm_shape = op.ifm_shapes[0]
Tim Hall79d07d22020-04-27 18:20:16 +0100620 weight_tensor = op.inputs[1]
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100621 ofm_shape = op.ofm_shapes[0]
622 if (ifm_shape.depth == 1) and (ofm_shape.depth == op.attrs["depth_multiplier"]):
Tim Hall79d07d22020-04-27 18:20:16 +0100623 # Change op type to Conv2d
Louis Verhaardaee5d752020-09-30 09:01:52 +0200624 op.type = Op.Conv2DBias
Tim Hall79d07d22020-04-27 18:20:16 +0100625 del op.attrs["channel_multiplier"]
626 del op.attrs["depth_multiplier"]
627
628 weight_tensor.quant_values = np.transpose(weight_tensor.quant_values, (0, 1, 3, 2))
Michael McGeagh6a8d4242020-07-28 12:17:59 +0100629 weight_tensor.set_all_shapes(list(weight_tensor.quant_values.shape))
Tim Hall79d07d22020-04-27 18:20:16 +0100630 else:
Louis Verhaard7db78962020-05-25 15:05:26 +0200631 raise UnsupportedFeatureError(
Michael McGeagh7a6f8432020-12-02 15:29:22 +0000632 f"Unsupported 'DEPTHWISE_CONV_2D' with depth_multiplier = {op.attrs['depth_multiplier']},",
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100633 f" ifm channels = {ifm_shape.depth}, ofm channels = {ofm_shape.depth}",
Tim Hall79d07d22020-04-27 18:20:16 +0100634 )
Tim Halle6ccd872020-11-09 16:46:37 +0000635 DebugDatabase.add_optimised(op, op)
Tim Hall79d07d22020-04-27 18:20:16 +0100636 return op
637
638
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200639def reorder_depthwise_weights(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200640 if op.type.is_depthwise_conv2d_op():
Jacob Bohline843d332020-06-23 12:12:56 +0200641 weight_tensor = op.inputs[1]
642 weight_tensor.quant_values = np.transpose(weight_tensor.quant_values, (0, 1, 3, 2))
Michael McGeagh6a8d4242020-07-28 12:17:59 +0100643 weight_tensor.set_all_shapes(list(weight_tensor.quant_values.shape))
Jacob Bohline843d332020-06-23 12:12:56 +0200644 weight_tensor.weight_transpose_depthwise = True
645
646 return op
647
648
Diqing Zhong016b8272020-12-16 16:46:06 +0100649def optimise_strided_conv(op, arch, nng):
650 stride_x, stride_y = op.get_kernel_stride()
651 ifm_tensor, _, weight_tensor, _ = op.get_ifm_ifm2_weights_ofm()
652
653 if (
654 op.type == Op.Conv2DBias
655 and op.op_index == 0
656 and stride_x == 2
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100657 and op.ifm_shapes[0].depth <= 4
658 and op.ifm_shapes[0].width % 2 == 0
Diqing Zhong016b8272020-12-16 16:46:06 +0100659 and weight_tensor is not None
660 and weight_tensor.shape[1] >= 2
661 ):
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100662 ifm_shape = op.ifm_shapes[0]
Diqing Zhong016b8272020-12-16 16:46:06 +0100663 # IFM
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100664 op.ifm_shapes[0] = Shape4D([ifm_shape.batch, ifm_shape.height, ifm_shape.width // 2, ifm_shape.depth * 2])
665 op.ifm.avoid_NHCWB16 = True
Diqing Zhong016b8272020-12-16 16:46:06 +0100666
667 # Weights
668 weight_shape = weight_tensor.shape
669 if weight_shape[1] % 2 != 0:
670 weight_shape[1] = weight_shape[1] + 1
671 padded_array = np.zeros(weight_shape)
672 for i in range(weight_shape[0]):
673 padded_array[i] = np.vstack(
674 [
675 weight_tensor.quant_values[i],
676 np.full((1, weight_shape[2], weight_shape[3]), weight_tensor.quantization.zero_point),
677 ]
678 )
679 weight_tensor.quant_values = padded_array
680 weight_shape[1] //= 2
681 weight_shape[2] *= 2
682 weight_tensor.quant_values = np.reshape(weight_tensor.quant_values, weight_shape)
683 weight_tensor.set_all_shapes(weight_shape)
684 # If multiple copies of the weights are used, we could avoid
685 # them having the same address by changing the value_id
686 weight_tensor.value_id = uuid.uuid4()
687
688 # Strides
689 stride_x = 1
690 op.attrs.update({"stride_w": stride_x, "stride_h": stride_y, "strides": (1, stride_y, stride_x, 1)})
691
Diqing Zhong016b8272020-12-16 16:46:06 +0100692 return op
693
694
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200695def convert_conv_to_fc(op, arch, nng):
Michael McGeagh8d939c02020-07-29 13:11:43 +0100696 # Conv 1x1 can be equivalent to Fully Connected.
697 # By representing certain convs as fully connected layers, Vela can better determine wether or not to use
698 # caching/double buffering for the weights.
699 # (Weights dont need to be reloaded for convs when IFM H and W are 1)
Louis Verhaardaee5d752020-09-30 09:01:52 +0200700 if op.type == Op.Conv2DBias:
patrik.gustavssoneeb85152020-12-21 17:10:40 +0000701 h = op.ifm_shapes[0].height
702 w = op.ifm_shapes[0].width
Michael McGeagh8d939c02020-07-29 13:11:43 +0100703 kh, kw, _, _ = op.inputs[1].shape
704 if h == 1 and w == 1 and kh == 1 and kw == 1:
705 # Overwrite this op as a Fully Connected Op
706 op.name += "_fc"
Louis Verhaardaee5d752020-09-30 09:01:52 +0200707 op.type = Op.FullyConnected
Michael McGeagh8d939c02020-07-29 13:11:43 +0100708 op.attrs = {
Michael McGeagh8d939c02020-07-29 13:11:43 +0100709 "weights_format": 0,
Michael McGeagh8d939c02020-07-29 13:11:43 +0100710 }
711 # Reshape Weights to be 2D. HWIO becomes just IO (as H and W are 1, they can just be dropped)
712 weight_tensor = op.inputs[1]
713 weight_tensor.quant_values = weight_tensor.quant_values.squeeze(axis=(0, 1))
714 weight_tensor.set_all_shapes(list(weight_tensor.quant_values.shape))
Patrik Gustavsson2349d422020-12-01 16:02:29 +0100715
Tim Halle6ccd872020-11-09 16:46:37 +0000716 DebugDatabase.add_optimised(op, op)
Michael McGeagh8d939c02020-07-29 13:11:43 +0100717 return op
718
719
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200720def fixup_relus_with_differing_ifm_ofm_scaling(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200721 if op.run_on_npu and op.type.is_relu_op():
Michael McGeagh8dbf8cf2020-09-08 11:09:48 +0100722 ifm = op.inputs[0]
723 ofm = op.outputs[0]
724 # Relu with differing IFM and OFM scaling cannot be fused with another primary op
725 # and requires its own to be inserted
Tim Hall93582962020-09-09 21:58:15 +0100726 if not check_quantized_tens_scaling_equal(ifm, ofm):
Michael McGeagh8dbf8cf2020-09-08 11:09:48 +0100727 # Override this op with its own primary op (avgpool)
728 relu_fused_op = create_avgpool_nop(op.name + "_avgpool")
729 # And fuse the original activation function to it
Louis Verhaarde8a5a782020-11-02 18:04:27 +0100730 relu_fused_op.activation = create_activation_function(op.type)
Michael McGeagh8dbf8cf2020-09-08 11:09:48 +0100731 # Tidy up and assign the ifm and ofm to the new op
732 ifm.consumer_list.remove(op)
Andreas Nevalainenf3d737e2020-09-25 14:12:43 +0200733
Michael McGeagh8dbf8cf2020-09-08 11:09:48 +0100734 relu_fused_op.add_input_tensor(ifm)
735 relu_fused_op.set_output_tensor(ofm)
patrik.gustavssoneeb85152020-12-21 17:10:40 +0000736 relu_fused_op.set_ifm_ofm_shapes()
Michael McGeagh8dbf8cf2020-09-08 11:09:48 +0100737 op = relu_fused_op
738 return op
739
740
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200741def fixup_elementwise_with_scalars(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200742 if op.type.is_binary_elementwise_op():
Louis Verhaarde0ef2732020-06-03 08:56:44 +0200743 ifm_tensor, ifm2_tensor, _, _ = op.get_ifm_ifm2_weights_ofm()
Charles Xu78792222020-05-13 10:15:26 +0200744 if ifm2_tensor.shape != [] and ifm_tensor.shape != []:
745 diff = len(ifm_tensor.shape) - len(ifm2_tensor.shape)
746 if diff > 0:
747 ifm2_tensor.shape = full_shape(len(ifm_tensor.shape), ifm2_tensor.shape, 1)
748 elif diff < 0:
749 ifm_tensor.shape = full_shape(len(ifm2_tensor.shape), ifm_tensor.shape, 1)
Louis Verhaarde0ef2732020-06-03 08:56:44 +0200750 elif ifm_tensor.shape == [] and ifm_tensor.quant_values is None:
751 # IFM is marked as a scalar, but is a result of an operation; change it to a shape of size 1
752 ifm_tensor.shape = len(ifm2_tensor.shape) * [1]
753 ifm_tensor.storage_shape = ifm_tensor.shape
754 elif ifm2_tensor.shape == [] and ifm2_tensor.quant_values is None:
755 # IFM2 is marked as a scalar, but is a result of an operation; change it to a shape of size 1
756 ifm2_tensor.shape = len(ifm_tensor.shape) * [1]
757 ifm2_tensor.storage_shape = ifm2_tensor.shape
Charles Xu78792222020-05-13 10:15:26 +0200758 return op
Tim Hall79d07d22020-04-27 18:20:16 +0100759
Louis Verhaarde0ef2732020-06-03 08:56:44 +0200760
Tim Hall4e127762020-05-15 16:05:49 +0100761# Set input/output tensor equivalence to the same id for memory operations
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200762def set_tensor_equivalence(op, arch, nng):
Michael McGeagh11b0bdb2020-09-08 11:07:35 +0100763 if op.type in memory_only_ops:
Tim Hall4e127762020-05-15 16:05:49 +0100764 eid = op.outputs[0].equivalence_id
765 for inp in op.inputs:
766 inp.equivalence_id = eid
767 return op
768
769
Patrik Gustavsson2349d422020-12-01 16:02:29 +0100770def set_ifm_ofm_op_shapes(op, arch, nng):
771 if op.run_on_npu and op.type.needs_shapes():
772 if op.ifm_shapes or op.ofm_shapes:
773 # Shapes already set
774 return op
775 op.set_ifm_ofm_shapes()
776 return op
777
778
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200779def convert_softmax(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200780 if op.type == Op.Softmax and op.run_on_npu:
Fredrik Svedberga0c36242020-06-03 15:43:31 +0200781 softmax = SoftMax(op)
782 op = softmax.get_graph()
783 return op
784
785
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200786def convert_mul_max_to_abs_or_lrelu(op, arch, nng):
Diego Russoea6111a2020-04-14 18:41:58 +0100787 r"""Whenever there is a subgraph with this topology:
Tim Hall79d07d22020-04-27 18:20:16 +0100788
789 Input X For X = -1 or X > 0
790 | \ / This subgraph can be replaced with either
791 | Mul an Abs (if X = -1) or a LeakyReLU (if X > 0)
792 | /
793 Max
794 """
795
Louis Verhaardaee5d752020-09-30 09:01:52 +0200796 if op.type == Op.Maximum:
Tim Hall79d07d22020-04-27 18:20:16 +0100797 # finds the Mul input(s) to the Max
Louis Verhaardaee5d752020-09-30 09:01:52 +0200798 muls = [i for i in op.inputs if i.ops[0].type == Op.Mul]
Tim Hall79d07d22020-04-27 18:20:16 +0100799 if len(muls) == 1:
800 mul = muls[0].ops[0]
801 elif len(muls) == 2:
802 # In the case both inputs are Muls, find the one with the same input as the Max
803 mul = [m for m in muls if len(set(op.inputs + m.ops[0].inputs)) == 1][0].ops[0]
804 else:
805 # No Mul inputs
806 return op
807
808 # make sure the Mul doesn't have any other consumers
Louis Verhaardd7911c42020-08-25 13:36:41 +0200809 mul_ofm = mul.outputs[0]
810 if len(mul_ofm.consumers()) != 1:
Tim Hall79d07d22020-04-27 18:20:16 +0100811 return op
Louis Verhaardaee5d752020-09-30 09:01:52 +0200812 # make sure the Mul doesn't have a fused activation function
813 if mul.activation:
Tim Hall79d07d22020-04-27 18:20:16 +0100814 return op
Louis Verhaardaee5d752020-09-30 09:01:52 +0200815 ifm, ofm = op.get_ifm_ofm()
Tim Hall93582962020-09-09 21:58:15 +0100816 if ifm is None or ofm is None:
817 return op
818
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200819 if ifm.dtype not in (DataType.uint8, DataType.int8) or ifm.dtype != ofm.dtype:
820 return op
Tim Hall93582962020-09-09 21:58:15 +0100821 if not check_quantized_tens_scaling_equal(ifm, ofm) or not check_quantized_tens_scaling_equal(ifm, mul_ofm):
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200822 # rewrite to LeakyRelu currently only makes sense if the quantization is identical
823 return op
Tim Hall79d07d22020-04-27 18:20:16 +0100824
825 # finds the branched input that goes to both the Max and the Mul
826 shared = set(op.inputs) & set(mul.inputs)
827 if len(shared) == 1:
828 shared_in = shared.pop()
829 # find the constant scalar input to the Mul
830 const_tens = (set(mul.inputs) - {shared_in}).pop()
831 # check that it is a scalar
832 if const_tens.shape != []:
833 return op
834 const = const_tens.ops[0]
835 # check that it is a constant
Louis Verhaardaee5d752020-09-30 09:01:52 +0200836 if const.type != Op.Const:
Tim Hall79d07d22020-04-27 18:20:16 +0100837 return op
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200838 # Remove the Mul from the shared input's consumers
839 shared_in.consumer_list.remove(mul)
Tim Hall79d07d22020-04-27 18:20:16 +0100840 else:
841 return op
842
843 val = const.outputs[0].values
844 if val >= 0:
Louis Verhaardaee5d752020-09-30 09:01:52 +0200845 new_op = Op.LeakyRelu
Tim Hall79d07d22020-04-27 18:20:16 +0100846 op.attrs["alpha"] = val
Louis Verhaardd7911c42020-08-25 13:36:41 +0200847 # to produce bit exact results, the alpha is not enough;
848 # save additional scaling info in attr "alpha_scale", to be used as input
849 # to the LUT construction
850 alpha_scalar = const_tens.quant_values - const_tens.quantization.zero_point
851 mul_ifm_scale = np.double(ifm.quantization.scale_f32)
852 mul_ifm2_scale = np.double(const_tens.quantization.scale_f32)
853 mul_ofm_scale = np.double(mul_ofm.quantization.scale_f32)
854 alpha_scale, alpha_shift = scaling.elementwise_mul_scale(mul_ifm_scale, mul_ifm2_scale, mul_ofm_scale)
855 op.attrs["alpha_scaling"] = (alpha_scalar, alpha_scale, alpha_shift)
Tim Hall79d07d22020-04-27 18:20:16 +0100856 elif val == -1:
Louis Verhaardaee5d752020-09-30 09:01:52 +0200857 new_op = Op.Abs
Tim Hall79d07d22020-04-27 18:20:16 +0100858 else:
859 return op
860
Louis Verhaardaee5d752020-09-30 09:01:52 +0200861 op.type = new_op
862 op.name = op.name.replace("Maximum", new_op.name)
863 op.outputs[0].name = op.outputs[0].name.replace("Maximum", new_op.name)
Tim Hall79d07d22020-04-27 18:20:16 +0100864 op.inputs = [shared_in]
Patrik Gustavssonc509d332020-12-22 13:53:52 +0100865 op.set_ifm_ofm_shapes()
Tim Halle6ccd872020-11-09 16:46:37 +0000866
867 # Record optimisation in debug database
868 DebugDatabase.add_optimised(op, op)
869
Tim Hall79d07d22020-04-27 18:20:16 +0100870 return op
871
872
Diqing Zhong189f7482021-01-26 12:12:51 +0100873def convert_hardswish_to_lut(op, arch, nng):
874 if op.type == Op.HardSwish:
875 ifm, ofm = op.get_ifm_ofm()
876 # Generate the LUT
877 ifm_scale = np.double(ifm.quantization.scale_f32)
878 ofm_scale = np.double(ofm.quantization.scale_f32)
879 zp_in = ifm.quantization.zero_point
880 zp_out = ofm.quantization.zero_point
881 ifm_scale_hires = (1 / 128) * ifm_scale
882 relu_multiplier = np.double(3 / 32768)
883 out_scale, out_shift = scaling.quantise_scale(ifm_scale_hires / ofm_scale)
884 relu_scale, relu_shift = scaling.quantise_scale(ifm_scale_hires / relu_multiplier)
885 # Use 16bit scale
886 out_scale_16 = fp_math.downscale_multiplier_int32_to_int16(out_scale)
887 relu_scale_16 = fp_math.downscale_multiplier_int32_to_int16(relu_scale)
888
889 values = []
890 ix = range(256) if ifm.dtype == DataType.uint8 else range(-128, 128)
891 quantized_min = min(ix)
892 quantized_max = max(ix)
893 for x in ix:
894 input_value = x - zp_in
895 input_value_hires = input_value * 128
896 # Compute the input value on essentially the output scale, not shifted yet
897 input_value_preshift = fp_math.saturating_rounding_mul16(input_value_hires, out_scale_16)
898 # Compute the "relu-ish multiplier". This matches the code in TensorFlow Lite Micro kernel
899 relu_value = np.int16(input_value_hires)
900 if relu_shift < 31:
901 relu_value = fp_math.shift_left16(relu_value, 30 - relu_shift)
902
903 relu_value = fp_math.saturating_rounding_mul16(relu_value, relu_scale_16)
904
905 if relu_shift < 31:
906 relu_value = fp_math.shift_left16(relu_value, 1)
907
908 if relu_shift > 31:
909 relu_value = fp_math.rounding_divide_by_pot(relu_value, relu_shift - 31)
910
911 # Rescaled the value into a 16bit fixedpoint relu_value in [-1, 1]
912 # Now convert that to a 16bit fixedpoint value in [0, 1]
913 relu_value = (relu_value + (1 << 15)) >> 1
914 lut_result = fp_math.saturating_mul16(relu_value, input_value_preshift)
915 shift = 31 - out_shift
916 shift = -shift if shift < 0 else 0
917 # Finally apply the output shift
918 lut_result = fp_math.rounding_divide_by_pot(lut_result, shift) + zp_out
919 lut_result = min(quantized_max, max(quantized_min, lut_result))
920 values.append(lut_result)
921 return convert_to_lut(op, values, "hardswish")
922 return op
923
924
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200925def convert_lrelu_to_mul_max(op, arch):
926 # Converts LeakyRelu to Max(alpha * IFM, identity * IFM)
927 # (the opposite of convert_mul_max_to_abs_or_lrelu)
Louis Verhaardaee5d752020-09-30 09:01:52 +0200928 ifm, ofm = op.get_ifm_ofm()
Tim Hall93582962020-09-09 21:58:15 +0100929 if ifm is None or ofm is None:
930 return op
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200931
932 # Add multiplication with alpha
Louis Verhaardaee5d752020-09-30 09:01:52 +0200933 mul_alpha = Operation(Op.Mul, op.name + "_mul_alpha")
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200934 mul_alpha.add_input_tensor(ifm)
935 # Create const tensor containing alpha as scalar
936 alpha = op.attrs["alpha"]
937 quantization = ifm.quantization.clone()
938 quantization.min = 0
939 quantization.max = alpha * (quantization.quant_max - quantization.quant_min)
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200940 quantization.zero_point = 0
Louis Verhaardece4e652021-01-07 13:35:47 +0100941 if np.isinf(1 / np.float32(alpha)):
942 # Handling of alpha near zero
943 quantization.scale_f32 = 1
944 scalar = 0
945 else:
946 quantization.scale_f32 = alpha
erik.andersson@arm.com8ba07922021-03-10 08:39:23 +0100947 scalar = alpha
Louis Verhaardece4e652021-01-07 13:35:47 +0100948 alpha_tens = create_const_tensor(
erik.andersson@arm.com8ba07922021-03-10 08:39:23 +0100949 op.name + "_alpha_scalar", [], ifm.dtype, [scalar], np.float32, quantization=quantization
Louis Verhaardece4e652021-01-07 13:35:47 +0100950 )
erik.andersson@arm.com8ba07922021-03-10 08:39:23 +0100951 alpha_tens.quant_values = np.array([1])
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200952 mul_alpha.add_input_tensor(alpha_tens)
erik.andersson@arm.com8ba07922021-03-10 08:39:23 +0100953 fm_alpha = ofm.clone(op.name + "_alpha", set_unique=True)
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200954 mul_alpha.set_output_tensor(fm_alpha)
patrik.gustavssoneeb85152020-12-21 17:10:40 +0000955 mul_alpha.set_ifm_ofm_shapes()
Tim Halle6ccd872020-11-09 16:46:37 +0000956 DebugDatabase.add_optimised(op, mul_alpha)
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200957
Tim Hall93582962020-09-09 21:58:15 +0100958 if check_quantized_tens_scaling_equal(ifm, ofm):
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200959 # No identity multiplication is needed
960 fm_id = ifm
961 else:
962 # Add multiplication with identity
Louis Verhaardaee5d752020-09-30 09:01:52 +0200963 mul_identity = Operation(Op.Mul, op.name + "_mul_identity")
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200964 mul_identity.add_input_tensor(ifm)
965 # Create const tensor containing identity as scalar
966 quantization = ifm.quantization.clone()
967 quantization.min = 0
968 quantization.max = quantization.quant_max - quantization.quant_min
969 quantization.scale_f32 = 1
970 quantization.zero_point = 0
971 identity_tens = create_const_tensor(
972 op.name + "_id_scalar", [], ifm.dtype, [1], np.uint8, quantization=quantization
973 )
974 mul_identity.add_input_tensor(identity_tens)
Louis Verhaardece4e652021-01-07 13:35:47 +0100975 # Make sure that fm_id is allocated to a different address than fm_alpha
976 fm_id = ofm.clone(op.name + "_id", set_unique=True)
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200977 mul_identity.set_output_tensor(fm_id)
patrik.gustavssoneeb85152020-12-21 17:10:40 +0000978 mul_identity.set_ifm_ofm_shapes()
Patrik Gustavsson2349d422020-12-01 16:02:29 +0100979 DebugDatabase.add_optimised(op, mul_identity)
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200980
981 # Convert LeakyRelu to Max, add the results of the multiplication(s) as inputs
Louis Verhaardaee5d752020-09-30 09:01:52 +0200982 op.type = Op.Maximum
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200983 op.name = op.name.replace("LeakyRelu", "Maximum")
984 op.inputs = []
985 ifm.consumer_list.remove(op)
986 op.add_input_tensor(fm_alpha)
987 op.add_input_tensor(fm_id)
Patrik Gustavssonc509d332020-12-22 13:53:52 +0100988 op.set_ifm_ofm_shapes()
Tim Halle6ccd872020-11-09 16:46:37 +0000989
990 DebugDatabase.add_optimised(op, op)
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200991 return op
992
993
Louis Verhaard2e186c72020-10-09 10:47:04 +0200994def convert_to_lut(op, lut_values, lut_name):
Louis Verhaardf03bad32020-09-25 08:30:44 +0200995 # Rewrite the operation by Add with scalar 0 + LUT activation
996 ifm = op.inputs[0]
Tim Hall93582962020-09-09 21:58:15 +0100997 if ifm is None:
998 return op
Louis Verhaard58520b92020-08-24 16:45:38 +0200999 assert ifm.dtype.size_in_bytes() == 1
Louis Verhaardaee5d752020-09-30 09:01:52 +02001000 op.type = Op.Add
Louis Verhaard2e186c72020-10-09 10:47:04 +02001001 op.name = op.name + "_lut_" + lut_name
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001002 # Mark as no-op to enable potential fusing optimizations
1003 op.attrs["is_nop"] = True
1004 # Create an input tensor containing scalar zero
1005 quantization = QuantizationParameters(0.0, 255.0)
Louis Verhaardd7911c42020-08-25 13:36:41 +02001006 quantization.scale_f32 = ifm.quantization.scale_f32
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001007 quantization.zero_point = 0
Louis Verhaard2e186c72020-10-09 10:47:04 +02001008 tens = create_const_tensor(op.inputs[0].name + "_scalar0", [], ifm.dtype, [0], np.uint8, quantization=quantization)
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001009 op.add_input_tensor(tens)
patrik.gustavssoneeb85152020-12-21 17:10:40 +00001010 op.ifm_shapes.append(Shape4D(tens.shape))
Patrik Gustavsson2349d422020-12-01 16:02:29 +01001011
Louis Verhaardf03bad32020-09-25 08:30:44 +02001012 # The LUT must be applied without any preceding rescaling (the LUT itself performs the rescale),
1013 # so even if the OFM has a different scale than the IFM, the generated OFM scale instructions
1014 # should be the same as the IFM
Louis Verhaardaee5d752020-09-30 09:01:52 +02001015 op.forced_output_quantization = ifm.quantization
Louis Verhaard2e186c72020-10-09 10:47:04 +02001016 lut_tensor = lut.create_lut_tensor(op.name + "_values", lut_values, DataType.int8)
Louis Verhaardf03bad32020-09-25 08:30:44 +02001017 op.set_activation_lut(lut_tensor)
Patrik Gustavssonc509d332020-12-22 13:53:52 +01001018 op.set_ifm_ofm_shapes()
Louis Verhaardf03bad32020-09-25 08:30:44 +02001019 return op
1020
1021
Louis Verhaard2e186c72020-10-09 10:47:04 +02001022def convert_to_lut8(op, fn, fn_name):
Louis Verhaardf03bad32020-09-25 08:30:44 +02001023 # Converts op to a no-op + int8/uint8 LUT which is generated with the given function.
1024 # fn is a function(real) -> real
Louis Verhaardaee5d752020-09-30 09:01:52 +02001025 ifm, ofm = op.get_ifm_ofm()
Louis Verhaardf03bad32020-09-25 08:30:44 +02001026 if ifm.dtype not in (DataType.uint8, DataType.int8) or ifm.dtype != ofm.dtype:
1027 return op
1028 # Generate the LUT
1029 ifm_scale = np.double(ifm.quantization.scale_f32)
1030 ofm_scale = np.double(ofm.quantization.scale_f32)
1031 zp_in = ifm.quantization.zero_point
1032 zp_out = ofm.quantization.zero_point
1033 values = []
1034 ix = range(256) if ifm.dtype == DataType.uint8 else range(-128, 128)
1035 quantized_min = min(ix)
1036 quantized_max = max(ix)
1037 for x in ix:
1038 x_real = ifm_scale * (x - zp_in)
1039 y_real = fn(x_real)
1040 lut_result = round_away_zero(zp_out + y_real / ofm_scale)
1041 lut_result = min(quantized_max, max(quantized_min, lut_result))
1042 values.append(lut_result)
Louis Verhaard2e186c72020-10-09 10:47:04 +02001043 return convert_to_lut(op, values, fn_name)
Louis Verhaardf03bad32020-09-25 08:30:44 +02001044
1045
1046def convert_lrelu_to_lut(op, arch):
Louis Verhaardaee5d752020-09-30 09:01:52 +02001047 ifm, ofm = op.get_ifm_ofm()
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001048 # Generate the LUT
Louis Verhaardd7911c42020-08-25 13:36:41 +02001049 alpha = op.attrs["alpha"]
1050 ifm_scale = np.double(ifm.quantization.scale_f32)
1051 ofm_scale = np.double(ofm.quantization.scale_f32)
1052 zp_in = ifm.quantization.zero_point
1053 zp_out = ofm.quantization.zero_point
1054 identity_scale, identity_shift = scaling.elementwise_mul_scale(ifm_scale, 1, ofm_scale)
1055 alpha_scalar = 1
1056 alpha_scale, alpha_shift = scaling.elementwise_mul_scale(ifm_scale, alpha, ofm_scale)
1057 if "alpha_scaling" in op.attrs:
1058 # The LeakyRelu was the result from convert_mul_max_to_abs_or_lrelu
1059 alpha_scalar, alpha_scale, alpha_shift = op.attrs["alpha_scaling"]
1060 values = []
Louis Verhaard58520b92020-08-24 16:45:38 +02001061 ix = range(256) if ifm.dtype == DataType.uint8 else range(-128, 128)
Louis Verhaardd7911c42020-08-25 13:36:41 +02001062 quantized_min = min(ix)
1063 quantized_max = max(ix)
1064 for x in ix:
1065 if x < zp_in:
1066 lut_result = zp_out + fp_math.multiply_by_quantized_multiplier(
1067 alpha_scalar * (x - zp_in), alpha_scale, alpha_shift
1068 )
1069 else:
1070 lut_result = zp_out + fp_math.multiply_by_quantized_multiplier(x - zp_in, identity_scale, identity_shift)
1071 lut_result = min(quantized_max, max(quantized_min, lut_result))
1072 values.append(lut_result)
Louis Verhaard2e186c72020-10-09 10:47:04 +02001073 return convert_to_lut(op, values, "lrelu")
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001074
1075
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +02001076def convert_lrelu(op, arch, nng):
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001077 # Converts LeakyRelu to a LUT based solution if possible, otherwise a mul + max
Louis Verhaardaee5d752020-09-30 09:01:52 +02001078 if op.type != Op.LeakyRelu:
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001079 return op
Louis Verhaardaee5d752020-09-30 09:01:52 +02001080 ifm, ofm = op.get_ifm_ofm()
Tim Hall93582962020-09-09 21:58:15 +01001081 if ifm is None or ofm is None:
1082 return op
Louis Verhaardd7911c42020-08-25 13:36:41 +02001083 if ifm.dtype in (DataType.uint8, DataType.int8) and ifm.dtype == ofm.dtype:
1084 # use LUT for int8/uint8
1085 return convert_lrelu_to_lut(op, arch)
Tim Hall93582962020-09-09 21:58:15 +01001086 if check_quantized_tens_scaling_equal(ifm, ofm) and ifm.dtype == ofm.dtype == DataType.int16:
Louis Verhaardd7911c42020-08-25 13:36:41 +02001087 # use LeakyRelu unmodified for int16 with equal input/output scaling
1088 return op
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001089 return convert_lrelu_to_mul_max(op, arch)
1090
1091
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +02001092def convert_tanh_sigmoid_to_lut(op, arch, nng):
Louis Verhaardf03bad32020-09-25 08:30:44 +02001093 # Converts int8/uint8 Sigmoid and Tanh to a LUT based solution
Louis Verhaardaee5d752020-09-30 09:01:52 +02001094 if op.type == Op.Sigmoid:
Louis Verhaard2e186c72020-10-09 10:47:04 +02001095 return convert_to_lut8(op, clamp_sigmoid, "sigmoid")
Louis Verhaardaee5d752020-09-30 09:01:52 +02001096 elif op.type == Op.Tanh:
Louis Verhaard2e186c72020-10-09 10:47:04 +02001097 return convert_to_lut8(op, math.tanh, "tanh")
Louis Verhaardf03bad32020-09-25 08:30:44 +02001098 return op
1099
1100
Patrik Gustavsson3a269202021-01-21 08:28:55 +01001101def remove_reshapes(op, arch):
1102 if op.run_on_npu and op.type == Op.Reshape:
1103 ofm = op.ofm
1104 ifm = op.ifm
Patrik Gustavssonfa4cb292020-09-10 08:19:36 +02001105
Patrik Gustavsson3a269202021-01-21 08:28:55 +01001106 # Check if quantization is the same in the input and output for the reshape ops
1107 if not check_quantized_tens_scaling_equal(ifm, ofm):
1108 # TODO Both tensors are needed, since quantisation properties currently are linked to Tensors.
1109 # In order to remove this reshape either quantization properties need to be moved to Operator,
1110 # or the reshape need to be replace with a NOP.
1111 return
Patrik Gustavssonfa4cb292020-09-10 08:19:36 +02001112
Patrik Gustavsson3a269202021-01-21 08:28:55 +01001113 # Check if Reshape ifm/ofm are network ifm/ofm
Patrik Gustavsson138d47f2021-02-08 10:13:48 +01001114 ifm_is_sg_ifm = ifm.ops[0].type in (Op.Placeholder, Op.SubgraphInput, Op.Const)
Patrik Gustavsson3a269202021-01-21 08:28:55 +01001115 ifm_is_sg_ofm = any(ifm_cons is None for ifm_cons in ifm.consumer_list)
1116 ofm_is_sg_ofm = any(ofm_cons is None for ofm_cons in ofm.consumer_list)
Patrik Gustavsson138d47f2021-02-08 10:13:48 +01001117 # This case should be handled prior to this function
1118 assert not ((ifm_is_sg_ifm or ifm_is_sg_ofm) and ofm_is_sg_ofm)
Patrik Gustavsson3a269202021-01-21 08:28:55 +01001119
1120 if ofm_is_sg_ofm:
1121 # Bypassed by replacing ifm with ofm
1122 ofm.ops = []
1123 for prev_op in ifm.ops:
1124 prev_op.outputs = [ofm]
1125 ofm.ops.append(prev_op)
1126
1127 # All ifm consumers need to use ofm as input
1128 for ifm_cons in ifm.consumer_list:
1129 for ifm_idx, cons_ifm in enumerate(ifm_cons.inputs):
1130 if cons_ifm == ifm:
1131 ifm_cons.set_input_tensor(ofm, ifm_idx)
1132 if op.ifm_shapes[0] != op.ofm_shapes[0]:
1133 ofm.avoid_NHCWB16 = True
1134 else:
1135 # Bypassed Reshape by replacing ofm with ifm
1136 for cons in ofm.consumer_list:
1137 for ifm_idx, cons_ifm in enumerate(cons.inputs):
1138 if cons_ifm == ofm:
1139 cons.set_input_tensor(ifm, ifm_idx)
1140 if op.ifm_shapes[0] != op.ofm_shapes[0]:
1141 ifm.avoid_NHCWB16 = True
1142
1143
1144def check_reshapes(op, arch):
1145 if op.run_on_npu and op.type == Op.Reshape:
1146 ofm = op.ofm
1147
1148 if check_quantized_tens_scaling_equal(op.ifm, ofm):
1149 # Reshape should have been removed
1150 raise VelaError(f"Reshape op {op} expected to have been removed, still remains")
Patrik Gustavssonfa4cb292020-09-10 08:19:36 +02001151
1152
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +02001153def fuse_activation_function_with_prev(op, arch, nng):
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001154 # if op is a no-op: attempts to move the activation function to the preceding op
Louis Verhaardaee5d752020-09-30 09:01:52 +02001155 if not op.attrs.get("is_nop", False) or op.activation is None:
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001156 return op
Louis Verhaardaee5d752020-09-30 09:01:52 +02001157 ifm, ofm = op.get_ifm_ofm()
Tim Hall93582962020-09-09 21:58:15 +01001158 if ifm is None or ofm is None:
1159 return op
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001160 # finds the input(s) to the operation
1161 prev_op = ifm.ops[0]
1162 # Note: the below checks on prev_op require that a first optimize pass on the full graph has been performed
1163 fuse = (
1164 prev_op.run_on_npu
Louis Verhaardaee5d752020-09-30 09:01:52 +02001165 and prev_op.type.npu_block_type != NpuBlockType.Default
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001166 and len(ifm.ops) == 1
1167 and len(prev_op.outputs[0].consumers()) == 1
Louis Verhaardaee5d752020-09-30 09:01:52 +02001168 and prev_op.activation is None
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001169 )
1170 if op.activation_lut is not None and arch.shram_reserved_unused_banks == 0:
1171 # TODO: if SHRAM LUT space is shared with SHRAM ACC (32, 64 MAC),
1172 # LUT currently only works correctly for elementwise ops
1173 fuse = False
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001174 if not fuse:
1175 return op
1176 # Move the fused activation function + corresponding info to prev_op
Louis Verhaardaee5d752020-09-30 09:01:52 +02001177 prev_op.activation = op.activation
1178 prev_op.forced_output_quantization = op.forced_output_quantization
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001179 if op.activation_lut is not None:
1180 prev_op.set_activation_lut(op.activation_lut)
1181 # Bypass op
Louis Verhaard98a34992020-09-01 10:39:04 +02001182 prev_op.set_output_tensor(ofm)
Tim Halle6ccd872020-11-09 16:46:37 +00001183 DebugDatabase.add_optimised(op, prev_op)
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001184 return op
1185
1186
Louis Verhaardc822d622021-03-11 14:59:06 +01001187def _leading_pad_ok(leading_pad, stride, kernel_size):
1188 # If kernel size // 2 > stride, then (left, top) padding must be a multiple of stride,
1189 # otherwise replacing PAD by hardware padding would iterate the wrong IFM rows/columns
1190 max_size = kernel_size // 2
1191 return leading_pad == max_size or max_size <= stride or leading_pad % stride == 0
1192
1193
1194def replace_pad_by_hw_pad(op: Operation, arch, nng):
Louis Verhaardae2d5532020-12-11 17:19:54 +01001195 """
Louis Verhaardc822d622021-03-11 14:59:06 +01001196 Tries to completely remove a PAD operator by using hardware padding.
1197 E.g. a PAD operation that pads 1, followed by a CONV with VALID padding and kernel size 3
1198 is rewritten such that the PAD is removed, and the CONV uses SAME padding.
Louis Verhaardae2d5532020-12-11 17:19:54 +01001199 Converts tens1 -> PAD -> tens2 -> CONV to tens1 -> CONV
1200 if both operations can be run on the NPU.
Louis Verhaardc822d622021-03-11 14:59:06 +01001201 This is the most efficient way to implement PAD, but cannot be done for all pad sizes.
Louis Verhaardae2d5532020-12-11 17:19:54 +01001202 """
1203 if (
Louis Verhaardc822d622021-03-11 14:59:06 +01001204 (op.type.is_conv2d_op() or op.type.is_depthwise_conv2d_op() or op.type.is_avgpool_op())
Louis Verhaardae2d5532020-12-11 17:19:54 +01001205 and op.run_on_npu
1206 and op.attrs["padding"] == Padding.VALID
1207 ):
1208 pad_op = op.ifm.ops[0]
1209 if pad_op.type != Op.Pad or not pad_op.run_on_npu:
1210 return op
Louis Verhaardc822d622021-03-11 14:59:06 +01001211 if pad_op.ifm.dtype != pad_op.ofm.dtype or not check_quantized_tens_scaling_equal(pad_op.ofm, pad_op.ifm):
1212 return op
1213 top, left, bottom, right = get_pad_values_from_input(pad_op.inputs[1].values)
1214 k = op.kernel
1215 k_w, k_h = k.dilated_wh()
1216
1217 # Check if the PAD operator can be replaced by hardware padding
1218 if left > k_w // 2 or right > k_w // 2 or top > k_h // 2 or bottom > k_h // 2:
1219 # Too much padding, it would require hardware padding to actually insert zeros
1220 return op
1221 if not _leading_pad_ok(top, k.stride.y, k_h) or not _leading_pad_ok(left, k.stride.x, k_w):
1222 return op
1223
Louis Verhaard1a92f782021-02-09 16:08:26 +01001224 if op.type.is_avgpool_op():
Louis Verhaardc822d622021-03-11 14:59:06 +01001225 # For average pool, hardware padding can only be used if padding is 0 or kernel size / 2
1226 for pad, k_size in (
1227 (left, k_w),
1228 (right, k_w),
1229 (top, k_h),
1230 (bottom, k_h),
1231 ):
1232 if pad not in (0, k_size // 2):
1233 return op
Louis Verhaard1a92f782021-02-09 16:08:26 +01001234 # Average pool is converted to depthwise, because NPU average pool + same padding
1235 # has a special implementation that is different from PAD followed by average pool with
1236 # valid padding.
1237 k_w, k_h = op.kernel.width, op.kernel.height
1238 ifm = op.ifm
1239 # Remember other inputs
1240 other_inputs = op.inputs[1:]
1241 # Create a weight tensor, all weights are set to 1/(kernel width * kernel height)
1242 quantization = QuantizationParameters(0.0, 255.0)
1243 quantization.scale_f32 = 1.0 / (k_w * k_h)
1244 quantization.zero_point = 0
1245 shape = [k_h, k_w, 1, op.ofm.shape[-1]]
1246 weights = np.full(shape, 1)
1247
1248 weight_tens = create_const_tensor(
1249 op.name + "_weights",
1250 shape,
1251 op.ifm.dtype,
1252 weights,
1253 np.uint8,
1254 purpose=TensorPurpose.Weights,
1255 quantization=quantization,
1256 )
1257 weight_tens.quant_values = weights
1258 op.type = Op.DepthwiseConv2DBias
1259 op.inputs = []
1260 op.add_input_tensor(ifm)
1261 op.add_input_tensor(weight_tens)
1262 # Add bias tensor, all biases set to 0
1263 op.inputs.append(None)
1264 fixup_bias_tensors(op, arch, nng)
1265 # Add other inputs
1266 op.inputs.extend(other_inputs)
1267 op.rounding_mode = NpuRoundingMode.NATURAL
1268
Louis Verhaardae2d5532020-12-11 17:19:54 +01001269 # Bypass the PAD operator
1270 op.set_input_tensor(pad_op.ifm, 0)
1271 # Adjust the padding attributes of the convolution operator
1272 op.attrs["padding"] = Padding.EXPLICIT
Louis Verhaardae2d5532020-12-11 17:19:54 +01001273 op.attrs["explicit_padding"] = (top, left, bottom, right)
1274 op.set_ifm_ofm_shapes()
1275 return op
1276
1277
Louis Verhaardc822d622021-03-11 14:59:06 +01001278def convert_pad(op: Operation, arch, nng):
1279 """
1280 Rewrites PAD operator to an average pool that copies the IFM to the OFM
1281 + up to 4 average pool operators that fill the OFM with zeros at the borders.
1282 This is done as fall-back for the PAD operators that remain after replace_pad_by_hw_pad
1283 """
1284 if op.type != Op.Pad or not op.run_on_npu:
1285 return op
1286 top, left, bottom, right = get_pad_values_from_input(op.inputs[1].values)
1287
1288 ifm = op.ifm
1289 assert ifm is not None
1290 ifm_shape = Shape4D(ifm.shape)
1291 ofm = op.ofm
1292 assert ofm is not None
1293 ofm.ops = []
1294 ofm_shape = op.ofm_shapes[0]
1295
1296 # Average pool op that copies IFM to the right place inside the OFM
1297 shp0 = Shape4D(0, 0, 0, 0)
1298 shp_top = shp0.with_height(top)
1299 avgpool_op = create_avg_pool_for_concat(op, op.name + "_main", ifm, ifm_shape, shp_top.with_width(left))
1300 avgpool_op.activation = op.activation
1301 quant = ofm.quantization
1302 pad_value = quant.zero_point
1303 # Add operations that fill the borders of the OFM
1304 if top > 0:
1305 shape = Shape4D(1, top, ofm_shape.width, ofm_shape.depth)
1306 zero_tens = create_const_tensor(
1307 op.name + "_top", shape.as_list(), ofm.dtype, shape.elements() * [pad_value], np.uint8, quantization=quant
1308 )
1309 # If top/bottom or left/right are equal, the const tensors can be allocated to the same address
1310 zero_tens.equivalence_id = create_equivalence_id(tuple(zero_tens.values))
1311 create_avg_pool_for_concat(op, op.name + "_top", zero_tens, shape, shp0)
1312 if bottom > 0:
1313 shape = Shape4D(1, bottom, ofm_shape.width, ofm_shape.depth)
1314 zero_tens = create_const_tensor(
1315 op.name + "_bottom",
1316 shape.as_list(),
1317 ofm.dtype,
1318 shape.elements() * [pad_value],
1319 np.uint8,
1320 quantization=quant,
1321 )
1322 zero_tens.equivalence_id = create_equivalence_id(tuple(zero_tens.values))
1323 create_avg_pool_for_concat(
1324 op, op.name + "_bottom", zero_tens, shape, shp0.with_height(ofm_shape.height - bottom)
1325 )
1326 if left > 0:
1327 shape = Shape4D(1, ifm_shape.height, left, ofm_shape.depth)
1328 zero_tens = create_const_tensor(
1329 op.name + "_left", shape.as_list(), ofm.dtype, shape.elements() * [pad_value], np.uint8, quantization=quant
1330 )
1331 zero_tens.equivalence_id = create_equivalence_id(tuple(zero_tens.values))
1332 create_avg_pool_for_concat(op, op.name + "_left", zero_tens, shape, shp_top)
1333 if right > 0:
1334 shape = Shape4D(1, ifm_shape.height, right, ofm_shape.depth)
1335 zero_tens = create_const_tensor(
1336 op.name + "_right", shape.as_list(), ofm.dtype, shape.elements() * [pad_value], np.uint8, quantization=quant
1337 )
1338 zero_tens.equivalence_id = create_equivalence_id(tuple(zero_tens.values))
1339 create_avg_pool_for_concat(
1340 op, op.name + "_right", zero_tens, shape, shp_top.with_width(ofm_shape.width - right)
1341 )
1342 ofm.avoid_NHCWB16 = True
1343 op.type = Op.ConcatTFLite
1344 return avgpool_op
1345
1346
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +02001347def add_attrs_to_resizebilinear(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +02001348 if op.type == Op.ResizeBilinear and op.run_on_npu:
Dwight Lidman42fed942020-05-29 09:37:03 +02001349 input_tensor = op.inputs[0]
Patrik Gustavsson3a269202021-01-21 08:28:55 +01001350 input_shape = op.ifm_shapes[0]
1351 upscaled_height = input_shape.height * 2
1352 upscaled_width = input_shape.width * 2
1353 out_shape = op.ofm_shapes[0]
1354 if not op.attrs["align_corners"] and out_shape.height == upscaled_height and out_shape.width == upscaled_width:
Dwight Lidman42fed942020-05-29 09:37:03 +02001355 # this means the output is supposed to be a x2 upscale,
1356 # so we need to do SAME padding
Michael McGeagh16895482020-12-14 15:51:20 +00001357 op.attrs["padding"] = Padding.SAME
Patrik Gustavsson3a269202021-01-21 08:28:55 +01001358 elif (
1359 op.attrs["align_corners"]
1360 and out_shape.height == (upscaled_height - 1)
1361 and out_shape.width == (upscaled_width - 1)
1362 ):
Dwight Lidman42fed942020-05-29 09:37:03 +02001363 # here we can just run the avg pool without padding and
1364 # produce a (M * 2 - 1, N * 2 - 1) sized output
Michael McGeagh16895482020-12-14 15:51:20 +00001365 op.attrs["padding"] = Padding.VALID
Dwight Lidman42fed942020-05-29 09:37:03 +02001366 else:
Charles Xu9a03fdf2020-07-02 15:12:40 +02001367 return op
Dwight Lidman42fed942020-05-29 09:37:03 +02001368 input_tensor.resampling_mode = resampling_mode.NEAREST
Tim Hallc30f4952020-06-15 20:47:35 +01001369 op.attrs.update({"strides": (1, 1, 1, 1), "ksize": (1, 2, 2, 1)})
Dwight Lidman42fed942020-05-29 09:37:03 +02001370 return op
1371
1372
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +02001373def fixup_bias_tensors(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +02001374 if op.type.needs_bias() and op.bias is None:
Jacob Bohlina41cd4d2020-08-26 18:21:28 +02001375 # Op has no bias, add bias tensor filled with zeros
1376 nr_biases = op.inputs[1].shape[-1]
1377 bias_values = [0] * nr_biases
1378 bias_tensor = create_const_tensor(op.name + "_bias", [nr_biases], DataType.int32, bias_values)
1379 bias_tensor.quant_values = bias_tensor.values
Louis Verhaard1a92f782021-02-09 16:08:26 +01001380 op.set_input_tensor(bias_tensor, op.type.info.indices.biases[0])
Jacob Bohlin67e0d8f2020-08-20 10:53:02 +02001381
1382 return op
1383
1384
Dwight Lidman95b279f2021-03-26 10:53:28 +01001385def convert_mean_to_depthwise_conv_or_avgpool(op, arch, nng):
Dwight Lidman4f728c02020-12-17 15:14:45 +01001386 if op.type == Op.Mean and op.run_on_npu:
1387 keep_dims = op.attrs.get("keep_dims", False)
1388 inp, axis = op.inputs
1389 shape = inp.shape
1390 dims = len(shape)
1391
1392 # Height and width axes have different index depending on dimensions
1393 if axis.shape == []: # single axis
1394 axis = int(axis.values)
1395 if dims in (2, 3):
1396 if axis == 0:
1397 h, w = shape[axis], 1
1398 else:
1399 h, w = 1, shape[axis]
1400 else:
1401 if axis == 1:
1402 h, w = shape[axis], 1
1403 else:
1404 h, w = 1, shape[axis]
1405 else: # multiple axes
1406 axis = sorted(axis.values)
1407 h, w = [shape[i] for i in axis]
1408
1409 # Set necessary depthwise attributes
1410 op.attrs.update(
1411 {
1412 "padding": Padding.VALID,
1413 "stride_h": 1,
1414 "stride_w": 1,
1415 "strides": (1, 1, 1, 1),
1416 "depth_multiplier": 1,
1417 "channel_multiplier": 1,
1418 "dilation_h_factor": 1,
1419 "dilation_w_factor": 1,
1420 "dilation": (1, 1, 1, 1),
1421 }
1422 )
1423 # Change op type
1424 op.type = Op.DepthwiseConv2DBias
1425 # Set IFM/OFM shapes after changing op type
1426 op.set_ifm_ofm_shapes()
1427
Dwight Lidman9b379182021-03-15 19:06:10 +01001428 weight_scale, bias = 1, None
Dwight Lidman4f728c02020-12-17 15:14:45 +01001429 ofmq, ifmq = op.ofm.quantization, inp.quantization
1430 # Set rounding mode, scaling and zero point based on which reference implementation to match
1431 if len(shape) == 4 and axis == [1, 2] and keep_dims:
1432 if inp.dtype == DataType.uint8:
1433 # This attribute means a different scaling calculation is used in order to match reference
1434 op.low_precision_scaling = True
1435 weight_scale = h * w
Dwight Lidman9bb1e2e2021-03-18 14:51:42 +01001436 # Set zero points to 0 as they will be adjusted for with bias term
Dwight Lidman4f728c02020-12-17 15:14:45 +01001437 foq = ofmq.clone()
Dwight Lidman9bb1e2e2021-03-18 14:51:42 +01001438 foq.zero_point = 0
Dwight Lidman4f728c02020-12-17 15:14:45 +01001439 fiq = ifmq.clone()
1440 fiq.zero_point = 0
1441 op.forced_input_quantization = fiq
Dwight Lidman9bb1e2e2021-03-18 14:51:42 +01001442 bias_term = ofmq.zero_point - int(ifmq.zero_point * ifmq.scale_f32 / ofmq.scale_f32)
1443 # If the bias term is outside uint8 range, we need an Add op to apply it.
1444 if bias_term < 0 or bias_term > 255:
1445 intermediate = op.ofm.clone(suffix="_intermediate", set_unique=True)
1446 # Bias term has higher bitness (i32) than input/output (u8).
1447 # 16 bits is enough since the bias is added/subtracted from a u8 value,
1448 # the bias can only effectively assume values in the range [-255, 255].
1449 intermediate.dtype = DataType.int16
1450 intermediate.quantization.zero_point = 0
1451 add_op = Operation(Op.Add, op.name + "_bias")
1452 add_op.forced_output_quantization = foq
1453 add_op.add_input_tensor(intermediate)
1454 quant = QuantizationParameters()
1455 quant.zero_point = 0
1456 bias_term_tens = create_const_tensor(
1457 op.name + "_bias",
1458 [1, 1, 1, 1],
1459 DataType.int16,
1460 [bias_term],
1461 np.int16,
1462 quantization=quant,
1463 quant_value_dtype=np.int16,
1464 )
1465 add_op.add_input_tensor(bias_term_tens)
1466 add_op.set_output_tensor(op.ofm)
1467 add_op.set_ifm_ofm_shapes()
1468 add_op.activation = op.activation
1469 op.activation = None
1470 op.set_output_tensor(intermediate)
1471 op.set_ifm_ofm_shapes()
1472 # If not, we can just do it with the OFM zero point.
1473 else:
1474 foq.zero_point = bias_term
1475 op.forced_output_quantization = foq
Dwight Lidman4f728c02020-12-17 15:14:45 +01001476 else:
1477 assert inp.dtype == DataType.int8
1478 # Use a depthwise to calculate the sum,
1479 # followed by a multiplication with 1/N to get the MEAN
Dwight Lidman4f728c02020-12-17 15:14:45 +01001480 weight_scale = 1
1481 intermediate = op.ofm.clone(suffix="_intermediate", set_unique=True)
1482 intermediate.dtype = DataType.int16
1483 mul_op = Operation(Op.Mul, op.name + "_mul")
1484 mul_op.add_input_tensor(intermediate)
1485 # Create scalar containing 1/N
1486 quant = QuantizationParameters()
1487 quant.zero_point = 0
1488 # The reference rounds negative numbers downwards, e.g. -1.5 is rounded to -2,
1489 # while rounding mode NATURAL would round this to -1.
1490 # This can only occur if N is even, and can be emulated by
1491 # multiplying with a number that is slightly smaller than 1/N.
1492 # It must be so small that other roundings are not affected;
1493 # the calculated value is based on worst case,
1494 # which is sum 256 * N (the maximum sum that can occur with int8)
1495 n = int(h * w)
1496 eps = 1 / (256 * (n + 1)) if n % 2 == 0 else 0
1497 quant.scale_f32 = 1 / (n - eps)
1498 scalar = create_const_tensor(
1499 op.name + "_scalar", [1, 1, 1, 1], DataType.uint8, [1], np.uint8, quantization=quant
1500 )
1501 mul_op.add_input_tensor(scalar)
1502 mul_op.set_output_tensor(op.ofm)
1503 mul_op.set_ifm_ofm_shapes()
1504 mul_op.rounding_mode = NpuRoundingMode.NATURAL
1505 mul_op.activation = op.activation
1506 op.activation = None
1507 op.set_output_tensor(intermediate)
1508 op.set_ifm_ofm_shapes()
1509 elif ifmq.zero_point == ofmq.zero_point and ifmq.scale_f32 == ofmq.scale_f32:
Dwight Lidman95b279f2021-03-26 10:53:28 +01001510 # Here we can just use a simple AvgPool with truncating rounding,
1511 # as we're emulating simple integer division.
Dwight Lidman4f728c02020-12-17 15:14:45 +01001512 op.rounding_mode = NpuRoundingMode.TRUNCATE
Dwight Lidman95b279f2021-03-26 10:53:28 +01001513 op.type = Op.AvgPool
1514 op.attrs.update({"ksize": (1, h, w, 1), "filter_height": h, "filter_width": w})
Dwight Lidman4f728c02020-12-17 15:14:45 +01001515 else:
Dwight Lidman9b379182021-03-15 19:06:10 +01001516 op.rounding_mode = NpuRoundingMode.NATURAL
1517 weight_scale = 1 / (h * w)
1518 # Input zero point is adjusted after mean calculation, so we emulate that with a bias
1519 bias = -ifmq.zero_point * h * w
1520 fiq = ifmq.clone()
1521 fiq.zero_point = 0
1522 op.forced_input_quantization = fiq
Dwight Lidman4f728c02020-12-17 15:14:45 +01001523
1524 # Change dimensions to 4
1525 if dims < 4:
1526 shape = [1] + shape
1527 if dims == 2:
1528 shape += [1]
1529
1530 # If height is greater than max kernel height, reshape to from HxW to 1x(HxW)
1531 if h > 64:
1532 shape = [shape[0], 1, h * w, shape[3]]
1533 op.ifm_shapes[0] = Shape4D(shape)
1534 inp.avoid_NHCWB16 = True
Dwight Lidman95b279f2021-03-26 10:53:28 +01001535 if h > 256 and op.type == Op.AvgPool:
1536 op.attrs.update({"ksize": (1, 1, h * w, 1), "filter_height": 1, "filter_width": h * w})
1537
1538 # If the AvgPool version is used, we don't need to do anything else
1539 if op.type == Op.AvgPool:
1540 return op
Dwight Lidman4f728c02020-12-17 15:14:45 +01001541
Dwight Lidman4f728c02020-12-17 15:14:45 +01001542 # Make unit weight tensor quantization
Dwight Lidman9b379182021-03-15 19:06:10 +01001543 weight_quant = ifmq.clone()
Dwight Lidman4f728c02020-12-17 15:14:45 +01001544 weight_quant.min = 0
1545 weight_quant.max = 255
1546 weight_quant.scale_f32 = weight_scale
1547 weight_quant.zero_point = 0
1548
1549 # Set weight shape to [H,W,C,B]
1550 weight_shape = shape[1:4] + [shape[0]]
1551 # Add unit weight tensor
1552 op.set_input_tensor(
1553 create_const_tensor(
1554 "weights",
1555 weight_shape,
1556 inp.dtype,
1557 np.ones(weight_shape),
1558 value_dtype=np.uint8,
1559 quantization=weight_quant,
1560 ),
1561 1,
1562 )
Dwight Lidman9b379182021-03-15 19:06:10 +01001563 op.weights.quant_values = np.reshape(op.inputs[1].quant_values, weight_shape)
1564
Dwight Lidman95b279f2021-03-26 10:53:28 +01001565 # Add None bias tensor
1566 op.inputs.append(None)
Dwight Lidman9b379182021-03-15 19:06:10 +01001567 # Add bias tensor
1568 if bias:
1569 bias_shape = [shape[-1]]
1570 op.set_input_tensor(
1571 create_const_tensor(
1572 "bias",
1573 bias_shape,
1574 inp.dtype,
1575 np.ones(bias_shape) * bias,
1576 value_dtype=np.int32,
1577 quant_value_dtype=np.int32,
1578 quantization=None,
1579 ),
1580 2,
1581 )
Dwight Lidman4f728c02020-12-17 15:14:45 +01001582
1583 return op
1584
1585
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +02001586def supported_operator_check(op, arch, nng):
Tim Hall79d07d22020-04-27 18:20:16 +01001587 op.run_on_npu = arch.supported_operators.is_operator_supported(op)
1588 return op
1589
1590
Tim Halle6ccd872020-11-09 16:46:37 +00001591def _record_optimised(op, arch):
1592 if op.type != Op.Const:
1593 DebugDatabase.add_optimised(op, op)
1594
1595
Tim Hall79d07d22020-04-27 18:20:16 +01001596def optimise_graph_a(nng, arch, verbose_graph=False):
1597 if verbose_graph:
1598 nng.print_graph()
1599
Patrik Gustavsson2349d422020-12-01 16:02:29 +01001600 pre_process_list = [
1601 supported_operator_check,
1602 set_ifm_ofm_op_shapes,
1603 # TODO: memory-only Op removal
1604 ]
1605
1606 for idx, sg in enumerate(nng.subgraphs):
1607 # rewrite graph pass
1608 nng.subgraphs[idx] = rewrite_graph.rewrite_graph_pre_order(
1609 nng, sg, arch, [], pre_process_list, rewrite_unsupported=False,
1610 )
1611
Patrik Gustavsson3a269202021-01-21 08:28:55 +01001612 # Handle Concat Ops
1613 for idx, sg in enumerate(nng.subgraphs):
1614 # rewrite graph pass
Patrik Gustavsson2c2522d2021-01-29 11:51:31 +01001615 rewrite_graph.visit_graph_post_order(sg.output_tensors, arch, [], [rewrite_concat_ops])
1616 sg.refresh_after_modification()
Patrik Gustavsson3a269202021-01-21 08:28:55 +01001617
1618 # Handle Split Ops
1619 for idx, sg in enumerate(nng.subgraphs):
1620 # rewrite graph pass
1621 nng.subgraphs[idx] = rewrite_graph.rewrite_graph_pre_order(
1622 nng,
1623 sg,
1624 arch,
1625 [],
1626 [rewrite_unpack_output, rewrite_stridedslice_output, convert_nop_split_to_identity],
1627 rewrite_unsupported=False,
1628 )
1629
1630 for idx, sg in enumerate(nng.subgraphs):
1631 # rewrite graph pass
1632 nng.subgraphs[idx] = rewrite_graph.rewrite_graph_pre_order(
1633 nng, sg, arch, [rewrite_split_ops], [], rewrite_unsupported=False,
1634 )
1635
Patrik Gustavsson138d47f2021-02-08 10:13:48 +01001636 # Handle sg input output
1637 for idx, sg in enumerate(nng.subgraphs):
1638 nng.subgraphs[idx] = rewrite_graph.rewrite_graph_pre_order(
1639 nng, sg, arch, [], [fix_sg_input_output], rewrite_unsupported=False,
1640 )
1641
Patrik Gustavsson3a269202021-01-21 08:28:55 +01001642 # Removal of reshapes
1643 for sg in nng.subgraphs:
1644 rewrite_graph.visit_graph_post_order(sg.output_tensors, arch, [], [remove_reshapes])
1645 sg.refresh_after_modification()
1646
Tim Hall79d07d22020-04-27 18:20:16 +01001647 op_rewrite_list = [
Tim Hall4e127762020-05-15 16:05:49 +01001648 set_tensor_equivalence,
Dwight Lidman95b279f2021-03-26 10:53:28 +01001649 convert_mean_to_depthwise_conv_or_avgpool,
Tim Hall79d07d22020-04-27 18:20:16 +01001650 convert_depthwise_to_conv,
Michael McGeagh8d939c02020-07-29 13:11:43 +01001651 convert_conv_to_fc,
Fredrik Svedberga0c36242020-06-03 15:43:31 +02001652 convert_softmax,
Diqing Zhong016b8272020-12-16 16:46:06 +01001653 optimise_strided_conv,
Diqing Zhong189f7482021-01-26 12:12:51 +01001654 convert_hardswish_to_lut,
Patrik Gustavsson2c2522d2021-01-29 11:51:31 +01001655 rewrite_fully_connected_input,
Diqing Zhong94457b12020-12-09 15:22:40 +01001656 convert_batched_fc_shape,
Tim Hall79d07d22020-04-27 18:20:16 +01001657 fixup_conv2d_backprop,
Michael McGeagh8dbf8cf2020-09-08 11:09:48 +01001658 fixup_relus_with_differing_ifm_ofm_scaling,
Patrik Gustavsson3a269202021-01-21 08:28:55 +01001659 fixup_elementwise_with_scalars, # TODO Move to early stage?
Jacob Bohline843d332020-06-23 12:12:56 +02001660 reorder_depthwise_weights,
Charles Xu9a03fdf2020-07-02 15:12:40 +02001661 fixup_resizebilinear,
Jacob Bohlina41cd4d2020-08-26 18:21:28 +02001662 fixup_bias_tensors,
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001663 convert_mul_max_to_abs_or_lrelu,
1664 convert_lrelu,
Louis Verhaardf03bad32020-09-25 08:30:44 +02001665 convert_tanh_sigmoid_to_lut,
Louis Verhaardc822d622021-03-11 14:59:06 +01001666 replace_pad_by_hw_pad,
Tim Hall79d07d22020-04-27 18:20:16 +01001667 ]
1668
1669 for idx, sg in enumerate(nng.subgraphs):
1670 # rewrite graph pass
1671 nng.subgraphs[idx] = rewrite_graph.rewrite_graph_pre_order(
Dwight Lidman73320a42020-11-05 10:34:41 +01001672 nng, sg, arch, [], op_rewrite_list, rewrite_unsupported=False,
Tim Hall79d07d22020-04-27 18:20:16 +01001673 )
1674
1675 for idx, sg in enumerate(nng.subgraphs):
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001676 # remove passthrough tensors and attempt further optimizations
1677 nng.subgraphs[idx] = rewrite_graph.rewrite_graph_pre_order(
Louis Verhaardae2d5532020-12-11 17:19:54 +01001678 nng,
1679 sg,
1680 arch,
1681 [remove_passthrough_tensor],
Louis Verhaardc822d622021-03-11 14:59:06 +01001682 [fuse_activation_function_with_prev, convert_pad, add_padding_fields],
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001683 )
Tim Hall79d07d22020-04-27 18:20:16 +01001684
Patrik Gustavssone3b1b912021-02-09 15:38:46 +01001685 # Removal of SplitSliceRead, need to be done after optimisation has been performed,
1686 # since ifm/ofm_shapes are of importance to this function
1687 for sg in nng.subgraphs:
1688 rewrite_graph.visit_graph_post_order(sg.output_tensors, arch, [], [remove_SplitSliceRead])
1689 sg.refresh_after_modification()
1690
Patrik Gustavsson3a269202021-01-21 08:28:55 +01001691 # Post-optimisation operator debug tracing, and checking that no undesired reshapes are left in the graph
Tim Halle6ccd872020-11-09 16:46:37 +00001692 for sg in nng.subgraphs:
Patrik Gustavsson3a269202021-01-21 08:28:55 +01001693 rewrite_graph.visit_graph_post_order(sg.output_tensors, arch, [], [check_reshapes, _record_optimised])
Tim Hall79d07d22020-04-27 18:20:16 +01001694
1695 if verbose_graph:
1696 nng.print_graph()
1697 return nng