blob: 7755cc3b7965b44fcdb72c9259e33a5792f61594 [file] [log] [blame]
Tim Hall79d07d22020-04-27 18:20:16 +01001# Copyright (C) 2020 Arm Limited or its affiliates. All rights reserved.
2#
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
Diego Russoea6111a2020-04-14 18:41:58 +010021
22import numpy as np
23
Louis Verhaardd7911c42020-08-25 13:36:41 +020024from . import fp_math
Louis Verhaardb9fc33c2020-08-13 11:47:36 +020025from . import lut
Diego Russoea6111a2020-04-14 18:41:58 +010026from . import rewrite_graph
Louis Verhaardd7911c42020-08-25 13:36:41 +020027from . import scaling
Diego Russoea6111a2020-04-14 18:41:58 +010028from .data_type import DataType
Tim Halle6ccd872020-11-09 16:46:37 +000029from .debug_database import DebugDatabase
Louis Verhaard7db78962020-05-25 15:05:26 +020030from .errors import UnsupportedFeatureError
Patrik Gustavsson3a269202021-01-21 08:28:55 +010031from .errors import VelaError
Dwight Lidman42fed942020-05-29 09:37:03 +020032from .ethos_u55_regs.ethos_u55_regs import resampling_mode
Louis Verhaard8912c532020-09-30 12:11:49 +020033from .numeric_util import clamp_sigmoid
Louis Verhaarde0ef2732020-06-03 08:56:44 +020034from .numeric_util import full_shape
Louis Verhaardf03bad32020-09-25 08:30:44 +020035from .numeric_util import round_away_zero
Louis Verhaarde8a5a782020-11-02 18:04:27 +010036from .operation import create_activation_function
Diego Russoe8a10452020-04-21 17:39:10 +010037from .operation import NpuBlockType
Louis Verhaardaee5d752020-09-30 09:01:52 +020038from .operation import Op
Diego Russoe8a10452020-04-21 17:39:10 +010039from .operation import Operation
Michael McGeagh16895482020-12-14 15:51:20 +000040from .operation import Padding
Fredrik Svedbergd9c2c422020-12-01 16:33:45 +010041from .operation_util import create_avgpool_nop
patrik.gustavssoneeb85152020-12-21 17:10:40 +000042from .shape4d import Shape4D
Fredrik Svedberga0c36242020-06-03 15:43:31 +020043from .softmax import SoftMax
Tim Hall93582962020-09-09 21:58:15 +010044from .tensor import check_quantized_tens_scaling_equal
Michael McGeaghc5b549b2020-08-07 11:54:28 +010045from .tensor import create_const_tensor
Charles Xu9a03fdf2020-07-02 15:12:40 +020046from .tensor import QuantizationParameters
Diego Russoe8a10452020-04-21 17:39:10 +010047from .tensor import Tensor
Michael McGeagh7a6f8432020-12-02 15:29:22 +000048from .tflite_mapping import optype_to_builtintype
Tim Hall79d07d22020-04-27 18:20:16 +010049
Michael McGeaghf3e3ad72020-12-02 12:39:03 +000050passthrough_nodes = (Op.Identity,)
Tim Hall79d07d22020-04-27 18:20:16 +010051
Michael McGeaghf3e3ad72020-12-02 12:39:03 +000052memory_only_ops = (Op.Reshape,)
Michael McGeagh11b0bdb2020-09-08 11:07:35 +010053
Tim Hall79d07d22020-04-27 18:20:16 +010054
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +020055def remove_passthrough_tensor(tens, arch, nng):
Tim Hall79d07d22020-04-27 18:20:16 +010056 if len(tens.ops) == 1 and tens.ops[0].type in passthrough_nodes:
57 assert len(tens.ops[0].inputs) == 1
58 tens = tens.ops[0].inputs[0]
59 return tens
60
61
Patrik Gustavsson2c2522d2021-01-29 11:51:31 +010062def rewrite_concat_ops(op, arch):
Patrik Gustavsson3a269202021-01-21 08:28:55 +010063 if not op.run_on_npu or not op.type.is_concat_op():
64 return op
Tim Hall79d07d22020-04-27 18:20:16 +010065
Patrik Gustavsson3a269202021-01-21 08:28:55 +010066 axis_4D = 0
67 ofm = op.ofm
68 ofm.ops = []
69 offset = 0
Tim Hall79d07d22020-04-27 18:20:16 +010070
Patrik Gustavsson7bada402021-01-28 15:46:21 +010071 unfuse_activation_function(op)
72
Patrik Gustavsson3a269202021-01-21 08:28:55 +010073 if op.type == Op.Pack:
74 # Pack is also referred to as Stack
75 axis = int(op.attrs["axis"])
76 desired_shape = op.inputs[0].shape[:axis] + [1] + op.inputs[0].shape[axis:]
Tim Hall79d07d22020-04-27 18:20:16 +010077
Patrik Gustavsson3a269202021-01-21 08:28:55 +010078 if axis >= 0:
79 axis_4D = axis + (4 - len(desired_shape))
80 else:
81 axis_4D = axis
82
83 for idx, inp in enumerate(op.inputs):
84 op.ifm_shapes[idx] = Shape4D(desired_shape)
85 if Shape4D(inp.shape) != op.ifm_shapes[idx]:
86 inp.avoid_NHCWB16 = True
87 op.type = Op.PackReshaped
88
89 inputs, axis = op.get_concat_inputs_axis()
90
91 for idx, inp in enumerate(inputs):
92 if op.type != Op.PackReshaped:
93 op.ifm_shapes[idx] = Shape4D(inp.shape)
Patrik Gustavsson3d737172020-12-22 10:40:51 +010094 if axis >= 0:
95 axis_4D = axis + (4 - len(inp.shape))
96 else:
97 axis_4D = axis
Patrik Gustavsson3a269202021-01-21 08:28:55 +010098 new_op = Operation(Op.ConcatSliceWrite, op.name + str(idx))
99 new_op.inputs = [inp]
100 new_op.outputs = [ofm]
101 new_op.attrs["concat_axis"] = axis_4D
102 new_op.attrs["concat_start"] = offset
103 offset += op.ifm_shapes[idx].get_dim(axis_4D)
Tim Hall79d07d22020-04-27 18:20:16 +0100104
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100105 new_op.attrs["concat_end"] = offset
106 new_op.run_on_npu = True
107 ofm.ops.append(new_op)
108 DebugDatabase.add_optimised(op, new_op)
109 new_op.ifm_shapes.append(op.ifm_shapes[idx].clone())
110 new_op.ofm_shapes.append(op.ofm_shapes[0].clone())
111 assert ofm.shape[axis] == offset
Patrik Gustavsson458a2082020-08-13 13:41:05 +0200112
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100113 # If axis corresponds to C-dimension, NHCWB16 can only be used in the output if all the concat_start's are a
114 # multiple of 16. This as, it is only then the address offset for the ofm, for all operations, will be 16 byte
115 # aligned. For other values of axis the address offsets will be 16 byte aligned, as they are all based on c = 0
116 # and those addresses are always 16 byte aligned due to the NHCWB16 format.
117 if axis == -1 or axis == (len(ofm.shape) - 1):
118 for op in ofm.ops:
119 if op.attrs["concat_start"] % 16 != 0:
120 ofm.avoid_NHCWB16 = True
121 break
122 return op
Tim Hall79d07d22020-04-27 18:20:16 +0100123
124
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100125def rewrite_split_ops(tens, arch, nng):
Tim Hall79d07d22020-04-27 18:20:16 +0100126
Patrik Gustavsson224e99b2021-01-14 10:55:43 +0100127 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 +0100128 split_op = tens.ops[0]
129
130 # Not supported so leave it and run on CPU
131 if not split_op.run_on_npu:
132 return tens
133
134 inp, outputs, axis, offset_start, offset_end = split_op.get_split_inputs_axis()
135
136 tens.ops = []
Louis Verhaardaee5d752020-09-30 09:01:52 +0200137 new_op = Operation(Op.SplitSliceRead, split_op.name)
Tim Hall79d07d22020-04-27 18:20:16 +0100138 new_op.inputs = [inp]
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100139 ofm_shape_idx = 0
Tim Hall79d07d22020-04-27 18:20:16 +0100140
141 # For Split the offset cannot be extracted from the tensor so it has to
142 # be calculated from the index of the output tensor
Diego Russoea6111a2020-04-14 18:41:58 +0100143 if axis is not None:
Tim Hall79d07d22020-04-27 18:20:16 +0100144 # Get the start and end of the split
Patrik Gustavsson2349d422020-12-01 16:02:29 +0100145 offset_start = [0] * 4
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100146 axis_4D_list = split_op.attrs.get("split_axis_4D", None) # Present for UnpackReshaped and some StridedSlice
Patrik Gustavsson2349d422020-12-01 16:02:29 +0100147 for idx, out in enumerate(outputs):
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100148 if axis_4D_list is not None:
149 axis_4D = axis_4D_list[idx]
Patrik Gustavsson3d737172020-12-22 10:40:51 +0100150 else:
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100151 split_op.ofm_shapes[idx] = Shape4D(out.shape)
152 if axis >= 0:
153 axis_4D = axis + (4 - len(out.shape))
154 else:
155 axis_4D = axis
156
157 if out == tens:
158 ofm_shape_idx = idx
159 break
patrik.gustavssoneeb85152020-12-21 17:10:40 +0000160
161 offset_start[axis_4D] += split_op.ofm_shapes[idx].get_dim(axis_4D)
Tim Hall79d07d22020-04-27 18:20:16 +0100162
Patrik Gustavssoneebb1c22020-08-18 15:03:04 +0200163 # If start offset is not a multiple of 16 in the C-dimension, NHCWB16 need to be avoided in the input
164 if (offset_start[-1] % 16) != 0:
165 inp.avoid_NHCWB16 = True
Patrik Gustavsson2349d422020-12-01 16:02:29 +0100166 else:
167 offset_start = full_shape(4, offset_start, 0)
Tim Hall79d07d22020-04-27 18:20:16 +0100168
169 new_op.attrs["split_start"] = offset_start
Tim Hall79d07d22020-04-27 18:20:16 +0100170 new_op.run_on_npu = True
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100171 new_op.set_output_tensor(tens)
Patrik Gustavsson224e99b2021-01-14 10:55:43 +0100172 new_op.ifm_shapes.append(Shape4D(inp.shape))
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100173 new_op.ofm_shapes.append(split_op.ofm_shapes[ofm_shape_idx].clone())
Tim Halle6ccd872020-11-09 16:46:37 +0000174 DebugDatabase.add_optimised(split_op, new_op)
Tim Hall79d07d22020-04-27 18:20:16 +0100175
176 return tens
177
178
179def needed_total_padding(input_size, stride, filter_size):
180 out_size = (input_size + stride - 1) // stride
181 needed_input = (out_size - 1) * stride + filter_size
182 total_padding = max(0, needed_input - input_size)
183 return total_padding
184
185
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100186def calc_padding_and_skirt(padding_type, kernel_size, stride, input_shape, explicit_padding):
187 ypad = needed_total_padding(int(input_shape.height), int(stride[1]), int(kernel_size[0]))
188 xpad = needed_total_padding(int(input_shape.width), int(stride[2]), int(kernel_size[1]))
Michael McGeagh16895482020-12-14 15:51:20 +0000189 if padding_type == Padding.SAME:
Tim Hall79d07d22020-04-27 18:20:16 +0100190 left_pad = (xpad + 0) // 2
191 right_pad = (xpad + 1) // 2
192 top_pad = (ypad + 0) // 2
193 bottom_pad = (ypad + 1) // 2
Michael McGeagh16895482020-12-14 15:51:20 +0000194 elif padding_type == Padding.VALID:
Tim Hall79d07d22020-04-27 18:20:16 +0100195 left_pad = 0
196 right_pad = 0
197 top_pad = 0
198 bottom_pad = 0
Louis Verhaardae2d5532020-12-11 17:19:54 +0100199 elif padding_type == Padding.EXPLICIT:
200 # Padding is specified in a PAD operator which has been bypassed.
201 # The top and left padding are taken from the PAD; bottom and right are calculated.
202 top_pad, left_pad, _, _ = explicit_padding
203 bottom_pad = ypad - top_pad
204 right_pad = xpad - left_pad
Tim Hall79d07d22020-04-27 18:20:16 +0100205 else:
Michael McGeagh16895482020-12-14 15:51:20 +0000206 raise UnsupportedFeatureError(f"Unknown padding")
Tim Hall79d07d22020-04-27 18:20:16 +0100207 padding = (top_pad, left_pad, bottom_pad, right_pad)
208 skirt = (top_pad, left_pad, ypad - top_pad, xpad - left_pad)
209 return padding, skirt
210
Tim Hallc30f4952020-06-15 20:47:35 +0100211
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100212def calc_upscaled_padding_and_skirt(padding_type, kernel_size, stride, input_shape, upscaling_factor):
Jacob Bohlin9b64ba02020-07-07 17:15:22 +0200213 kernel_height, kernel_width = kernel_size[0], kernel_size[1]
Michael McGeagh16895482020-12-14 15:51:20 +0000214 if padding_type == Padding.SAME:
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100215 ypad = needed_total_padding(int(input_shape.height) * upscaling_factor, int(stride[1]), int(kernel_height))
216 xpad = needed_total_padding(int(input_shape.width) * upscaling_factor, int(stride[2]), int(kernel_width))
Jacob Bohlind47cc272020-08-24 11:42:14 +0200217 right_pad = max(((xpad + 1) // upscaling_factor) - 1, 0)
218 bottom_pad = max(((ypad + 1) // upscaling_factor) - 1, 0)
Jacob Bohlin9b64ba02020-07-07 17:15:22 +0200219 left_pad = max(kernel_width - 1 - right_pad, 0)
220 top_pad = max(kernel_height - 1 - bottom_pad, 0)
Michael McGeagh16895482020-12-14 15:51:20 +0000221 elif padding_type == Padding.VALID:
Jacob Bohlin9b64ba02020-07-07 17:15:22 +0200222 right_pad = max(kernel_width - 2, 0)
223 bottom_pad = max(kernel_height - 2, 0)
224 left_pad = kernel_width - 1
225 top_pad = kernel_height - 1
Jacob Bohlincf7da102020-05-20 09:03:40 +0200226 else:
Michael McGeagh16895482020-12-14 15:51:20 +0000227 raise UnsupportedFeatureError(f"Unknown padding")
Jacob Bohlincf7da102020-05-20 09:03:40 +0200228 padding = (top_pad, left_pad, bottom_pad, right_pad)
Jacob Bohlin9b64ba02020-07-07 17:15:22 +0200229 skirt = padding
Jacob Bohlincf7da102020-05-20 09:03:40 +0200230 return padding, skirt
231
Tim Hall79d07d22020-04-27 18:20:16 +0100232
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200233def fixup_conv2d_backprop(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200234 if op.type == Op.Conv2DBackpropInput:
Tim Hall79d07d22020-04-27 18:20:16 +0100235 # flip the inputs
236 op.inputs[0], op.inputs[2] = op.inputs[2], op.inputs[0]
patrik.gustavssoneeb85152020-12-21 17:10:40 +0000237 op.set_ifm_ofm_shapes()
Louis Verhaardaee5d752020-09-30 09:01:52 +0200238 op.type = Op.Conv2DBackpropInputSwitchedBias
Louis Verhaard69b84802020-12-16 12:02:28 +0100239 op.ifm.resampling_mode = resampling_mode.TRANSPOSE
Jacob Bohlincf7da102020-05-20 09:03:40 +0200240
241 # Update strides
Tim Hallc30f4952020-06-15 20:47:35 +0100242 op.attrs.update({"stride_w": 1, "stride_h": 1, "strides": (1, 1, 1, 1)})
Tim Hall79d07d22020-04-27 18:20:16 +0100243
244 return op
245
246
Charles Xu9a03fdf2020-07-02 15:12:40 +0200247# Convert the op to an elementwise add
248def convert_resizebilinear_1x1_to_add(op):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200249 op.type = Op.Add
Charles Xu9a03fdf2020-07-02 15:12:40 +0200250 op.name = op.name + "_add"
Charles Xu9a03fdf2020-07-02 15:12:40 +0200251 op.attrs["resizebilinear"] = True
252 # Create an input tensor filled with zeros
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100253 shape = op.ofm_shapes[0].as_list()
Charles Xu9a03fdf2020-07-02 15:12:40 +0200254 tens = Tensor(shape, op.inputs[0].dtype, op.inputs[1].name + "_add")
255 tens.values = np.zeros(shape)
256 tens.quant_values = np.zeros(shape, np.uint8)
257 tens.quantization = QuantizationParameters(0.0, 255.0)
258 tens.quantization.scale_f32 = 1.0
259 tens.quantization.zero_point = 0
260 tens.consumer_list = [op]
261 tens_op = op.inputs[1].ops[0]
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100262 tens_op.set_output_tensor(tens)
Charles Xu9a03fdf2020-07-02 15:12:40 +0200263 # Set the add inputs
264 op.inputs[1] = op.inputs[0]
265 op.inputs[0] = tens
patrik.gustavssoneeb85152020-12-21 17:10:40 +0000266 op.set_ifm_ofm_shapes()
Charles Xu9a03fdf2020-07-02 15:12:40 +0200267
268 return op
269
270
Charles Xu87c13502020-08-06 12:17:26 +0200271# Convert ResizeBilinear to a number of 2x2 pool ops
272def convert_resizebilinear_to_2x2_pool(op):
273 count = 0
274 pre_op = op
275 outputs = op.outputs
276
277 op.attrs.update({"strides": (1, 1, 1, 1), "ksize": (1, 2, 2, 1)})
278 if op.attrs["align_corners"]:
279 shape_modifier = 1
Michael McGeagh16895482020-12-14 15:51:20 +0000280 op.attrs["padding"] = Padding.VALID
Charles Xu87c13502020-08-06 12:17:26 +0200281 else:
282 shape_modifier = 0
Michael McGeagh16895482020-12-14 15:51:20 +0000283 op.attrs["padding"] = Padding.SAME
Charles Xu87c13502020-08-06 12:17:26 +0200284 op.inputs[0].resampling_mode = resampling_mode.NEAREST
285
Patrik Gustavsson2c2522d2021-01-29 11:51:31 +0100286 upscaled_shape = np.array(op.ifm_shapes[0].get_hw_as_list())
287 out_shape = np.array(op.ofm_shapes[0].get_hw_as_list())
Charles Xu87c13502020-08-06 12:17:26 +0200288 if (upscaled_shape == upscaled_shape * 2 - shape_modifier).all():
289 return op
290
291 while (upscaled_shape < out_shape).all():
292 if count == 0:
293 scaled_op = pre_op
294 else:
295 scaled_op = op.clone("_{}".format(count))
296 scaled_op.inputs[0] = pre_op.outputs[0]
297
298 upscaled_shape = upscaled_shape * 2 - shape_modifier
299
300 if (upscaled_shape == out_shape).all():
301 scaled_op.outputs = outputs
302 scaled_op.outputs[0].ops = [scaled_op]
303 else:
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100304 shape = op.ofm_shapes[0].as_list()
305 shape[1:3] = upscaled_shape
Charles Xu87c13502020-08-06 12:17:26 +0200306 out_tens = Tensor(shape, DataType.int16, "{}_{}".format(op.outputs[0].name, count))
307 out_tens.quantization = op.outputs[0].quantization.clone()
308 out_tens.quantization.quant_min = np.iinfo(np.int16).min
309 out_tens.quantization.quant_max = np.iinfo(np.int16).max
310 scaled_op.set_output_tensor(out_tens)
311 pre_op = scaled_op
312 count += 1
313
314 # Setup the scale value
315 if scaled_op.inputs[0].dtype.bits == 8 and scaled_op.outputs[0].dtype.bits == 16:
Fredrik Svedberge82be7c2021-01-18 15:21:03 +0100316 scaled_op.rescale = 128
Charles Xu87c13502020-08-06 12:17:26 +0200317 elif scaled_op.inputs[0].dtype.bits == 16 and scaled_op.outputs[0].dtype.bits == 8:
Fredrik Svedberge82be7c2021-01-18 15:21:03 +0100318 scaled_op.rescale = 1 / 128
319 else:
320 scaled_op.rescale = None
Patrik Gustavssoncc6915c2020-12-22 09:16:50 +0100321 scaled_op.set_ifm_ofm_shapes()
Charles Xu87c13502020-08-06 12:17:26 +0200322
323 return op
324
325
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200326def fixup_resizebilinear(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200327 if op.type == Op.ResizeBilinear and op.run_on_npu:
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100328 if op.ifm_shapes[0] == op.ofm_shapes[0]:
Charles Xu36ffaf32020-08-05 15:40:44 +0200329 # Bypass nop resizebilinear
330 op.inputs = op.inputs[:1]
Louis Verhaardaee5d752020-09-30 09:01:52 +0200331 op.type = Op.Identity
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100332 elif op.ifm_shapes[0].height == 1 and op.ifm_shapes[0].width == 1:
Charles Xu87c13502020-08-06 12:17:26 +0200333 convert_resizebilinear_1x1_to_add(op)
334 else:
335 convert_resizebilinear_to_2x2_pool(op)
Charles Xu9a03fdf2020-07-02 15:12:40 +0200336
337 return op
338
339
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200340def convert_nop_split_to_identity(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200341 if op.type == Op.Split and op.attrs.get("num_splits") == 1:
Dwight Lidmanc3862c22020-09-14 15:22:33 +0200342 # the list comprehension should return a list with a single tensor
343 # if it shouldn't, remove_passthrough_tensor will fail appropriately
344 op.inputs = [i for i in op.inputs if i.shape == op.outputs[0].shape]
Louis Verhaardaee5d752020-09-30 09:01:52 +0200345 op.type = Op.Identity
Dwight Lidmanc3862c22020-09-14 15:22:33 +0200346 return op
347
348
Patrik Gustavsson2c2522d2021-01-29 11:51:31 +0100349def rewrite_fully_connected_input(op, arch, nng):
350 if op.type == Op.FullyConnected:
351 n_in_elems = op.weights.shape[-2]
352 elms = op.ifm.elements()
353 batch_size = elms // n_in_elems
354 assert batch_size * n_in_elems == elms
355
356 if op.ifm.shape != [batch_size, n_in_elems]:
357 op.ifm.avoid_NHCWB16 = True
358
359 op.ifm_shapes[0] = Shape4D([batch_size, 1, 1, n_in_elems])
360 return op
361
362
Diqing Zhong94457b12020-12-09 15:22:40 +0100363def convert_batched_fc_shape(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200364 if op.type == Op.FullyConnected:
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100365 # Check if the first dimension indicates batching
366 if op.ifm_shapes[0].batch > 1:
Patrik Gustavssoncb337042020-09-16 14:55:40 +0200367 batching_split = {4: (2, 2), 8: (2, 4), 16: (4, 4)}
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100368 n = op.ifm_shapes[0].batch
Patrik Gustavssoncb337042020-09-16 14:55:40 +0200369 h, w = batching_split.get(n, (1, n))
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100370 op.ifm_shapes[0] = Shape4D([1, h, w, op.ifm_shapes[0].depth])
Patrik Gustavssoncb337042020-09-16 14:55:40 +0200371
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100372 op.ifm.avoid_NHCWB16 = True
Patrik Gustavssoncb337042020-09-16 14:55:40 +0200373
374 # Reshape Weights to be 4D. IO becomes HWIO
375 weight_tensor = op.inputs[1]
376 weight_tensor.quant_values = np.expand_dims(np.expand_dims(weight_tensor.quant_values, axis=0), axis=0)
377 weight_tensor.set_all_shapes(list(weight_tensor.quant_values.shape))
378
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100379 n = op.ofm_shapes[0].batch
380 h, w = batching_split.get(n, (1, n))
381 op.ofm_shapes[0] = Shape4D([1, h, w, op.ofm_shapes[0].depth])
382 op.ofm.avoid_NHCWB16 = True
Tim Hall79d07d22020-04-27 18:20:16 +0100383 return op
384
385
Patrik Gustavsson7bada402021-01-28 15:46:21 +0100386def unfuse_activation_function(op):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200387 if op.type == Op.ConcatTFLite and op.run_on_npu and op.activation is not None:
Louis Verhaarde8a5a782020-11-02 18:04:27 +0100388 act_op = Operation(op.activation.op_type, op.name + op.activation.op_type.name)
Louis Verhaardaee5d752020-09-30 09:01:52 +0200389 op.activation = None
Fredrik Svedberg0f98b362020-09-29 10:00:39 +0200390 out_tens = op.outputs[0]
391 intermediate_tens = out_tens.clone("_act_intermediate")
392 act_op.set_output_tensor(out_tens)
393 act_op.add_input_tensor(intermediate_tens)
394 op.set_output_tensor(intermediate_tens)
patrik.gustavssoneeb85152020-12-21 17:10:40 +0000395 act_op.set_ifm_ofm_shapes()
Fredrik Svedberg0f98b362020-09-29 10:00:39 +0200396
Louis Verhaard8912c532020-09-30 12:11:49 +0200397
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100398def rewrite_stridedslice_output(op, arch, nng):
399 if not op.run_on_npu or op.type != Op.StridedSlice:
400 return op
401
402 new_axis_mask = op.attrs["new_axis_mask"]
403 shrink_axis_mask = op.attrs["shrink_axis_mask"]
404
405 if shrink_axis_mask == 0 and new_axis_mask == 0:
406 return op
407
408 axis_4D = [0] * len(op.outputs)
409 for idx, out_tens in enumerate(op.outputs):
410 output_shape = list(out_tens.shape)
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100411
Dwight Lidman73320a42020-11-05 10:34:41 +0100412 if shrink_axis_mask != 0:
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100413 n = 0
414 axis = 0
415 while shrink_axis_mask:
416 prev_mask = shrink_axis_mask
417 n += 1
418 shrink_axis_mask &= shrink_axis_mask - 1
419 axis = int(math.log2(prev_mask - shrink_axis_mask))
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100420 output_shape = output_shape[:axis] + [1] + output_shape[axis:]
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100421
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100422 assert len(out_tens.shape) == (len(op.inputs[0].shape) - n)
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100423 op.attrs["shrink_axis_mask"] = 0
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100424 if axis >= 0:
425 axis_4D[idx] = axis + (4 - len(output_shape))
426 else:
427 axis_4D[idx] = axis
428 op.ofm_shapes[idx] = Shape4D(output_shape)
429
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100430 elif new_axis_mask != 0:
431 n = 0
432 axis = 0
433 while new_axis_mask:
434 prev_mask = new_axis_mask
435 n += 1
436 new_axis_mask &= new_axis_mask - 1
437 axis = int(math.log2(prev_mask - new_axis_mask))
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100438 output_shape = output_shape[:axis] + output_shape[(axis + 1) :]
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100439 new_axis_mask >>= 1
440
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100441 assert len(out_tens.shape) == (len(op.inputs[0].shape) + n)
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100442 op.attrs["new_axis_mask"] = 0
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100443 if axis >= 0:
444 axis_4D[idx] = axis + (4 - len(output_shape))
445 else:
446 axis_4D[idx] = axis
447 op.ofm_shapes[idx] = Shape4D(output_shape)
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100448
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100449 if op.ofm_shapes[idx] != Shape4D(out_tens.shape):
450 out_tens.avoid_NHCWB16 = True
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100451
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100452 op.attrs["split_axis_4D"] = axis_4D
453 return op
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100454
455
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100456def rewrite_unpack_output(op, arch, nng):
457 tens = op.outputs[0]
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100458 if op.run_on_npu and op.type == Op.Unpack:
Tim Hall79d07d22020-04-27 18:20:16 +0100459 # Unpack is also referred to as Unstack
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100460 axis = int(op.attrs["axis"])
461 op.type = Op.UnpackReshaped
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100462 desired_output_shape = tens.shape[:axis] + [1] + tens.shape[axis:]
Tim Hall79d07d22020-04-27 18:20:16 +0100463
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100464 if axis >= 0:
465 axis_4D = axis + (4 - len(desired_output_shape))
466 else:
467 axis_4D = axis
Tim Hall79d07d22020-04-27 18:20:16 +0100468
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100469 axis_4D_list = [0] * len(op.outputs)
Tim Hall79d07d22020-04-27 18:20:16 +0100470 for idx, out_tens in enumerate(op.outputs):
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100471 op.ofm_shapes[idx] = Shape4D(desired_output_shape)
472 axis_4D_list[idx] = axis_4D
473 if op.ofm_shapes[idx] != Shape4D(out_tens.shape):
474 out_tens.avoid_NHCWB16 = True
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100475
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100476 op.attrs["split_axis_4D"] = axis_4D_list
477 return op
Tim Hall79d07d22020-04-27 18:20:16 +0100478
479
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200480def add_padding_fields(op, arch, nng):
Jacob Bohlin90033f32020-08-28 15:45:44 +0200481 if op.run_on_npu:
482 if "padding" in op.attrs:
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100483 input_shape = op.ifm_shapes[0]
484 output_shape = op.ofm_shapes[0]
Louis Verhaardaee5d752020-09-30 09:01:52 +0200485 if op.type.is_conv2d_op() or op.type.is_depthwise_conv2d_op():
Jacob Bohlin90033f32020-08-28 15:45:44 +0200486 kernel_size = op.inputs[1].shape[:2]
Louis Verhaardaee5d752020-09-30 09:01:52 +0200487 elif op.type.is_pool_op() or op.type.npu_block_type == NpuBlockType.ReduceSum:
Jacob Bohlin90033f32020-08-28 15:45:44 +0200488 kernel_size = op.attrs["ksize"][1:3]
Jacob Bohlin90033f32020-08-28 15:45:44 +0200489 else:
Michael McGeagh7a6f8432020-12-02 15:29:22 +0000490 raise UnsupportedFeatureError(f"Unknown operation that uses padding: {optype_to_builtintype(op.type)}")
Tim Hall79d07d22020-04-27 18:20:16 +0100491
Louis Verhaardaee5d752020-09-30 09:01:52 +0200492 if op.type == Op.Conv2DBackpropInputSwitchedBias:
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100493 upscaling_factor = output_shape.height // input_shape.height
Jacob Bohlin90033f32020-08-28 15:45:44 +0200494 padding, skirt = calc_upscaled_padding_and_skirt(
495 op.attrs["padding"], kernel_size, op.attrs["strides"], input_shape, upscaling_factor
496 )
497 else:
498 dilation_h, dilation_w = op.get_dilation_h_w()
499 dilated_kernel_size = [dilation_h * (kernel_size[0] - 1) + 1, dilation_w * (kernel_size[1] - 1) + 1]
500 padding, skirt = calc_padding_and_skirt(
Louis Verhaardae2d5532020-12-11 17:19:54 +0100501 op.attrs["padding"],
502 dilated_kernel_size,
503 op.attrs["strides"],
504 input_shape,
505 op.attrs.get("explicit_padding"),
Jacob Bohlin90033f32020-08-28 15:45:44 +0200506 )
Jacob Bohlincf7da102020-05-20 09:03:40 +0200507
Jacob Bohlin90033f32020-08-28 15:45:44 +0200508 op.attrs["explicit_padding"] = padding
509 op.attrs["skirt"] = skirt
Jacob Bohlincf7da102020-05-20 09:03:40 +0200510
Tim Hall79d07d22020-04-27 18:20:16 +0100511 return op
512
513
Tim Hall79d07d22020-04-27 18:20:16 +0100514# Check if the op can be reordered
515def get_prepend_op(op):
516 inp = op.inputs[0]
517 # The op should be reordered between prev_op and prep_op
518 prev_op = inp.ops[-1]
519 prep_op = None
520 while prev_op.type in memory_only_ops and len(prev_op.outputs) == 1 and len(prev_op.outputs[0].consumers()) == 1:
521 prep_op = prev_op
522 inp = prev_op.inputs[0]
523 prev_op = inp.ops[-1]
Diego Russoea6111a2020-04-14 18:41:58 +0100524 if prev_op is not None and len(prev_op.outputs) == 1 and len(prev_op.outputs[0].consumers()) == 1:
Tim Hall79d07d22020-04-27 18:20:16 +0100525 return prep_op
526
527 return None
528
529
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200530def convert_depthwise_to_conv(op, arch, nng):
Tim Hall79d07d22020-04-27 18:20:16 +0100531 # Depthwise is equivalent to a single conv2d if the ifm depth is 1 and
532 # the ofm depth equals the depth multipler.
533 # If those conditions are true, then we can perform a simple
534 # switch of the operator type (and weight order)
535
Louis Verhaardaee5d752020-09-30 09:01:52 +0200536 if op.type == Op.DepthwiseConv2DBias and (op.attrs["depth_multiplier"] != 1):
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100537 ifm_shape = op.ifm_shapes[0]
Tim Hall79d07d22020-04-27 18:20:16 +0100538 weight_tensor = op.inputs[1]
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100539 ofm_shape = op.ofm_shapes[0]
540 if (ifm_shape.depth == 1) and (ofm_shape.depth == op.attrs["depth_multiplier"]):
Tim Hall79d07d22020-04-27 18:20:16 +0100541 # Change op type to Conv2d
Louis Verhaardaee5d752020-09-30 09:01:52 +0200542 op.type = Op.Conv2DBias
Tim Hall79d07d22020-04-27 18:20:16 +0100543 del op.attrs["channel_multiplier"]
544 del op.attrs["depth_multiplier"]
545
546 weight_tensor.quant_values = np.transpose(weight_tensor.quant_values, (0, 1, 3, 2))
Michael McGeagh6a8d4242020-07-28 12:17:59 +0100547 weight_tensor.set_all_shapes(list(weight_tensor.quant_values.shape))
Tim Hall79d07d22020-04-27 18:20:16 +0100548 else:
Louis Verhaard7db78962020-05-25 15:05:26 +0200549 raise UnsupportedFeatureError(
Michael McGeagh7a6f8432020-12-02 15:29:22 +0000550 f"Unsupported 'DEPTHWISE_CONV_2D' with depth_multiplier = {op.attrs['depth_multiplier']},",
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100551 f" ifm channels = {ifm_shape.depth}, ofm channels = {ofm_shape.depth}",
Tim Hall79d07d22020-04-27 18:20:16 +0100552 )
Tim Halle6ccd872020-11-09 16:46:37 +0000553 DebugDatabase.add_optimised(op, op)
Tim Hall79d07d22020-04-27 18:20:16 +0100554 return op
555
556
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200557def reorder_depthwise_weights(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200558 if op.type.is_depthwise_conv2d_op():
Jacob Bohline843d332020-06-23 12:12:56 +0200559 weight_tensor = op.inputs[1]
560 weight_tensor.quant_values = np.transpose(weight_tensor.quant_values, (0, 1, 3, 2))
Michael McGeagh6a8d4242020-07-28 12:17:59 +0100561 weight_tensor.set_all_shapes(list(weight_tensor.quant_values.shape))
Jacob Bohline843d332020-06-23 12:12:56 +0200562 weight_tensor.weight_transpose_depthwise = True
563
564 return op
565
566
Diqing Zhong016b8272020-12-16 16:46:06 +0100567def optimise_strided_conv(op, arch, nng):
568 stride_x, stride_y = op.get_kernel_stride()
569 ifm_tensor, _, weight_tensor, _ = op.get_ifm_ifm2_weights_ofm()
570
571 if (
572 op.type == Op.Conv2DBias
573 and op.op_index == 0
574 and stride_x == 2
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100575 and op.ifm_shapes[0].depth <= 4
576 and op.ifm_shapes[0].width % 2 == 0
Diqing Zhong016b8272020-12-16 16:46:06 +0100577 and weight_tensor is not None
578 and weight_tensor.shape[1] >= 2
579 ):
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100580 ifm_shape = op.ifm_shapes[0]
Diqing Zhong016b8272020-12-16 16:46:06 +0100581 # IFM
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100582 op.ifm_shapes[0] = Shape4D([ifm_shape.batch, ifm_shape.height, ifm_shape.width // 2, ifm_shape.depth * 2])
583 op.ifm.avoid_NHCWB16 = True
Diqing Zhong016b8272020-12-16 16:46:06 +0100584
585 # Weights
586 weight_shape = weight_tensor.shape
587 if weight_shape[1] % 2 != 0:
588 weight_shape[1] = weight_shape[1] + 1
589 padded_array = np.zeros(weight_shape)
590 for i in range(weight_shape[0]):
591 padded_array[i] = np.vstack(
592 [
593 weight_tensor.quant_values[i],
594 np.full((1, weight_shape[2], weight_shape[3]), weight_tensor.quantization.zero_point),
595 ]
596 )
597 weight_tensor.quant_values = padded_array
598 weight_shape[1] //= 2
599 weight_shape[2] *= 2
600 weight_tensor.quant_values = np.reshape(weight_tensor.quant_values, weight_shape)
601 weight_tensor.set_all_shapes(weight_shape)
602 # If multiple copies of the weights are used, we could avoid
603 # them having the same address by changing the value_id
604 weight_tensor.value_id = uuid.uuid4()
605
606 # Strides
607 stride_x = 1
608 op.attrs.update({"stride_w": stride_x, "stride_h": stride_y, "strides": (1, stride_y, stride_x, 1)})
609
Diqing Zhong016b8272020-12-16 16:46:06 +0100610 return op
611
612
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200613def convert_conv_to_fc(op, arch, nng):
Michael McGeagh8d939c02020-07-29 13:11:43 +0100614 # Conv 1x1 can be equivalent to Fully Connected.
615 # By representing certain convs as fully connected layers, Vela can better determine wether or not to use
616 # caching/double buffering for the weights.
617 # (Weights dont need to be reloaded for convs when IFM H and W are 1)
Louis Verhaardaee5d752020-09-30 09:01:52 +0200618 if op.type == Op.Conv2DBias:
patrik.gustavssoneeb85152020-12-21 17:10:40 +0000619 h = op.ifm_shapes[0].height
620 w = op.ifm_shapes[0].width
Michael McGeagh8d939c02020-07-29 13:11:43 +0100621 kh, kw, _, _ = op.inputs[1].shape
622 if h == 1 and w == 1 and kh == 1 and kw == 1:
623 # Overwrite this op as a Fully Connected Op
624 op.name += "_fc"
Louis Verhaardaee5d752020-09-30 09:01:52 +0200625 op.type = Op.FullyConnected
Michael McGeagh8d939c02020-07-29 13:11:43 +0100626 op.attrs = {
Michael McGeagh8d939c02020-07-29 13:11:43 +0100627 "weights_format": 0,
Michael McGeagh8d939c02020-07-29 13:11:43 +0100628 }
629 # Reshape Weights to be 2D. HWIO becomes just IO (as H and W are 1, they can just be dropped)
630 weight_tensor = op.inputs[1]
631 weight_tensor.quant_values = weight_tensor.quant_values.squeeze(axis=(0, 1))
632 weight_tensor.set_all_shapes(list(weight_tensor.quant_values.shape))
Patrik Gustavsson2349d422020-12-01 16:02:29 +0100633
Tim Halle6ccd872020-11-09 16:46:37 +0000634 DebugDatabase.add_optimised(op, op)
Michael McGeagh8d939c02020-07-29 13:11:43 +0100635 return op
636
637
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200638def fixup_relus_with_differing_ifm_ofm_scaling(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200639 if op.run_on_npu and op.type.is_relu_op():
Michael McGeagh8dbf8cf2020-09-08 11:09:48 +0100640 ifm = op.inputs[0]
641 ofm = op.outputs[0]
642 # Relu with differing IFM and OFM scaling cannot be fused with another primary op
643 # and requires its own to be inserted
Tim Hall93582962020-09-09 21:58:15 +0100644 if not check_quantized_tens_scaling_equal(ifm, ofm):
Michael McGeagh8dbf8cf2020-09-08 11:09:48 +0100645 # Override this op with its own primary op (avgpool)
646 relu_fused_op = create_avgpool_nop(op.name + "_avgpool")
647 # And fuse the original activation function to it
Louis Verhaarde8a5a782020-11-02 18:04:27 +0100648 relu_fused_op.activation = create_activation_function(op.type)
Michael McGeagh8dbf8cf2020-09-08 11:09:48 +0100649 # Tidy up and assign the ifm and ofm to the new op
650 ifm.consumer_list.remove(op)
Andreas Nevalainenf3d737e2020-09-25 14:12:43 +0200651
Michael McGeagh8dbf8cf2020-09-08 11:09:48 +0100652 relu_fused_op.add_input_tensor(ifm)
653 relu_fused_op.set_output_tensor(ofm)
patrik.gustavssoneeb85152020-12-21 17:10:40 +0000654 relu_fused_op.set_ifm_ofm_shapes()
Michael McGeagh8dbf8cf2020-09-08 11:09:48 +0100655 op = relu_fused_op
656 return op
657
658
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100659# TODO remove if mem only ops can all be removed
Tim Hall79d07d22020-04-27 18:20:16 +0100660# Reorder activation op if it's after the memory only operations
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200661def fixup_act_reorder(op, arch, nng):
Michael McGeaghf3e3ad72020-12-02 12:39:03 +0000662 if op.type.is_relu_op() or op.type in (Op.Sigmoid, Op.Tanh):
Tim Hall79d07d22020-04-27 18:20:16 +0100663 prep_op = get_prepend_op(op)
Diego Russoea6111a2020-04-14 18:41:58 +0100664 if prep_op is not None:
Tim Hall79d07d22020-04-27 18:20:16 +0100665 act_op = op.clone("_reordered")
Patrik Gustavsson2349d422020-12-01 16:02:29 +0100666 act_op.ifm_shapes = list(op.ifm_shapes)
667 act_op.ofm_shapes = list(op.ofm_shapes)
Patrik Gustavssoncb337042020-09-16 14:55:40 +0200668
669 # There is only one input tensor, overwrite it
670 act_op.set_input_tensor(prep_op.inputs[0], 0)
671
Tim Hall79d07d22020-04-27 18:20:16 +0100672 act_op_out = act_op.inputs[0].clone("_acted")
673 act_op_out.quantization = op.outputs[0].quantization.clone()
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100674 act_op.set_output_tensor(act_op_out)
Patrik Gustavsson3a269202021-01-21 08:28:55 +0100675 act_op.ofm_shapes[0] = act_op.ifm_shapes[0].clone()
676 act_op.ifm_shapes[0] = prep_op.ifm_shapes[0].clone()
Patrik Gustavssoncb337042020-09-16 14:55:40 +0200677
678 # Update the consumer list
679 act_op_out.consumer_list = op.outputs[0].consumer_list.copy()
680 act_op_out.consumer_list.append(prep_op)
681
Tim Hall79d07d22020-04-27 18:20:16 +0100682 prep_op.inputs[0] = act_op_out
683 prep_op.outputs[0].quantization = act_op_out.quantization.clone()
684
685 # Mark the op so that it will be removed as passthrough later on
Louis Verhaardaee5d752020-09-30 09:01:52 +0200686 op.type = Op.Identity
Tim Halle6ccd872020-11-09 16:46:37 +0000687
688 # Record optimisation in debug database
689 DebugDatabase.add_optimised(op, act_op)
690 DebugDatabase.add_optimised(op, op)
Tim Hall79d07d22020-04-27 18:20:16 +0100691 return op
692
Louis Verhaarde0ef2732020-06-03 08:56:44 +0200693
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200694def fixup_elementwise_with_scalars(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200695 if op.type.is_binary_elementwise_op():
Louis Verhaarde0ef2732020-06-03 08:56:44 +0200696 ifm_tensor, ifm2_tensor, _, _ = op.get_ifm_ifm2_weights_ofm()
Charles Xu78792222020-05-13 10:15:26 +0200697 if ifm2_tensor.shape != [] and ifm_tensor.shape != []:
698 diff = len(ifm_tensor.shape) - len(ifm2_tensor.shape)
699 if diff > 0:
700 ifm2_tensor.shape = full_shape(len(ifm_tensor.shape), ifm2_tensor.shape, 1)
701 elif diff < 0:
702 ifm_tensor.shape = full_shape(len(ifm2_tensor.shape), ifm_tensor.shape, 1)
Louis Verhaarde0ef2732020-06-03 08:56:44 +0200703 elif ifm_tensor.shape == [] and ifm_tensor.quant_values is None:
704 # IFM is marked as a scalar, but is a result of an operation; change it to a shape of size 1
705 ifm_tensor.shape = len(ifm2_tensor.shape) * [1]
706 ifm_tensor.storage_shape = ifm_tensor.shape
707 elif ifm2_tensor.shape == [] and ifm2_tensor.quant_values is None:
708 # IFM2 is marked as a scalar, but is a result of an operation; change it to a shape of size 1
709 ifm2_tensor.shape = len(ifm_tensor.shape) * [1]
710 ifm2_tensor.storage_shape = ifm2_tensor.shape
Charles Xu78792222020-05-13 10:15:26 +0200711 return op
Tim Hall79d07d22020-04-27 18:20:16 +0100712
Louis Verhaarde0ef2732020-06-03 08:56:44 +0200713
Tim Hall4e127762020-05-15 16:05:49 +0100714# Set input/output tensor equivalence to the same id for memory operations
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200715def set_tensor_equivalence(op, arch, nng):
Michael McGeagh11b0bdb2020-09-08 11:07:35 +0100716 if op.type in memory_only_ops:
Tim Hall4e127762020-05-15 16:05:49 +0100717 eid = op.outputs[0].equivalence_id
718 for inp in op.inputs:
719 inp.equivalence_id = eid
720 return op
721
722
Patrik Gustavsson2349d422020-12-01 16:02:29 +0100723def set_ifm_ofm_op_shapes(op, arch, nng):
724 if op.run_on_npu and op.type.needs_shapes():
725 if op.ifm_shapes or op.ofm_shapes:
726 # Shapes already set
727 return op
728 op.set_ifm_ofm_shapes()
729 return op
730
731
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200732def convert_softmax(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200733 if op.type == Op.Softmax and op.run_on_npu:
Fredrik Svedberga0c36242020-06-03 15:43:31 +0200734 softmax = SoftMax(op)
735 op = softmax.get_graph()
736 return op
737
738
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200739def convert_mul_max_to_abs_or_lrelu(op, arch, nng):
Diego Russoea6111a2020-04-14 18:41:58 +0100740 r"""Whenever there is a subgraph with this topology:
Tim Hall79d07d22020-04-27 18:20:16 +0100741
742 Input X For X = -1 or X > 0
743 | \ / This subgraph can be replaced with either
744 | Mul an Abs (if X = -1) or a LeakyReLU (if X > 0)
745 | /
746 Max
747 """
748
Louis Verhaardaee5d752020-09-30 09:01:52 +0200749 if op.type == Op.Maximum:
Tim Hall79d07d22020-04-27 18:20:16 +0100750 # finds the Mul input(s) to the Max
Louis Verhaardaee5d752020-09-30 09:01:52 +0200751 muls = [i for i in op.inputs if i.ops[0].type == Op.Mul]
Tim Hall79d07d22020-04-27 18:20:16 +0100752 if len(muls) == 1:
753 mul = muls[0].ops[0]
754 elif len(muls) == 2:
755 # In the case both inputs are Muls, find the one with the same input as the Max
756 mul = [m for m in muls if len(set(op.inputs + m.ops[0].inputs)) == 1][0].ops[0]
757 else:
758 # No Mul inputs
759 return op
760
761 # make sure the Mul doesn't have any other consumers
Louis Verhaardd7911c42020-08-25 13:36:41 +0200762 mul_ofm = mul.outputs[0]
763 if len(mul_ofm.consumers()) != 1:
Tim Hall79d07d22020-04-27 18:20:16 +0100764 return op
Louis Verhaardaee5d752020-09-30 09:01:52 +0200765 # make sure the Mul doesn't have a fused activation function
766 if mul.activation:
Tim Hall79d07d22020-04-27 18:20:16 +0100767 return op
Louis Verhaardaee5d752020-09-30 09:01:52 +0200768 ifm, ofm = op.get_ifm_ofm()
Tim Hall93582962020-09-09 21:58:15 +0100769 if ifm is None or ofm is None:
770 return op
771
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200772 if ifm.dtype not in (DataType.uint8, DataType.int8) or ifm.dtype != ofm.dtype:
773 return op
Tim Hall93582962020-09-09 21:58:15 +0100774 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 +0200775 # rewrite to LeakyRelu currently only makes sense if the quantization is identical
776 return op
Tim Hall79d07d22020-04-27 18:20:16 +0100777
778 # finds the branched input that goes to both the Max and the Mul
779 shared = set(op.inputs) & set(mul.inputs)
780 if len(shared) == 1:
781 shared_in = shared.pop()
782 # find the constant scalar input to the Mul
783 const_tens = (set(mul.inputs) - {shared_in}).pop()
784 # check that it is a scalar
785 if const_tens.shape != []:
786 return op
787 const = const_tens.ops[0]
788 # check that it is a constant
Louis Verhaardaee5d752020-09-30 09:01:52 +0200789 if const.type != Op.Const:
Tim Hall79d07d22020-04-27 18:20:16 +0100790 return op
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200791 # Remove the Mul from the shared input's consumers
792 shared_in.consumer_list.remove(mul)
Tim Hall79d07d22020-04-27 18:20:16 +0100793 else:
794 return op
795
796 val = const.outputs[0].values
797 if val >= 0:
Louis Verhaardaee5d752020-09-30 09:01:52 +0200798 new_op = Op.LeakyRelu
Tim Hall79d07d22020-04-27 18:20:16 +0100799 op.attrs["alpha"] = val
Louis Verhaardd7911c42020-08-25 13:36:41 +0200800 # to produce bit exact results, the alpha is not enough;
801 # save additional scaling info in attr "alpha_scale", to be used as input
802 # to the LUT construction
803 alpha_scalar = const_tens.quant_values - const_tens.quantization.zero_point
804 mul_ifm_scale = np.double(ifm.quantization.scale_f32)
805 mul_ifm2_scale = np.double(const_tens.quantization.scale_f32)
806 mul_ofm_scale = np.double(mul_ofm.quantization.scale_f32)
807 alpha_scale, alpha_shift = scaling.elementwise_mul_scale(mul_ifm_scale, mul_ifm2_scale, mul_ofm_scale)
808 op.attrs["alpha_scaling"] = (alpha_scalar, alpha_scale, alpha_shift)
Tim Hall79d07d22020-04-27 18:20:16 +0100809 elif val == -1:
Louis Verhaardaee5d752020-09-30 09:01:52 +0200810 new_op = Op.Abs
Tim Hall79d07d22020-04-27 18:20:16 +0100811 else:
812 return op
813
Louis Verhaardaee5d752020-09-30 09:01:52 +0200814 op.type = new_op
815 op.name = op.name.replace("Maximum", new_op.name)
816 op.outputs[0].name = op.outputs[0].name.replace("Maximum", new_op.name)
Tim Hall79d07d22020-04-27 18:20:16 +0100817 op.inputs = [shared_in]
Patrik Gustavssonc509d332020-12-22 13:53:52 +0100818 op.set_ifm_ofm_shapes()
Tim Halle6ccd872020-11-09 16:46:37 +0000819
820 # Record optimisation in debug database
821 DebugDatabase.add_optimised(op, op)
822
Tim Hall79d07d22020-04-27 18:20:16 +0100823 return op
824
825
Diqing Zhong189f7482021-01-26 12:12:51 +0100826def convert_hardswish_to_lut(op, arch, nng):
827 if op.type == Op.HardSwish:
828 ifm, ofm = op.get_ifm_ofm()
829 # Generate the LUT
830 ifm_scale = np.double(ifm.quantization.scale_f32)
831 ofm_scale = np.double(ofm.quantization.scale_f32)
832 zp_in = ifm.quantization.zero_point
833 zp_out = ofm.quantization.zero_point
834 ifm_scale_hires = (1 / 128) * ifm_scale
835 relu_multiplier = np.double(3 / 32768)
836 out_scale, out_shift = scaling.quantise_scale(ifm_scale_hires / ofm_scale)
837 relu_scale, relu_shift = scaling.quantise_scale(ifm_scale_hires / relu_multiplier)
838 # Use 16bit scale
839 out_scale_16 = fp_math.downscale_multiplier_int32_to_int16(out_scale)
840 relu_scale_16 = fp_math.downscale_multiplier_int32_to_int16(relu_scale)
841
842 values = []
843 ix = range(256) if ifm.dtype == DataType.uint8 else range(-128, 128)
844 quantized_min = min(ix)
845 quantized_max = max(ix)
846 for x in ix:
847 input_value = x - zp_in
848 input_value_hires = input_value * 128
849 # Compute the input value on essentially the output scale, not shifted yet
850 input_value_preshift = fp_math.saturating_rounding_mul16(input_value_hires, out_scale_16)
851 # Compute the "relu-ish multiplier". This matches the code in TensorFlow Lite Micro kernel
852 relu_value = np.int16(input_value_hires)
853 if relu_shift < 31:
854 relu_value = fp_math.shift_left16(relu_value, 30 - relu_shift)
855
856 relu_value = fp_math.saturating_rounding_mul16(relu_value, relu_scale_16)
857
858 if relu_shift < 31:
859 relu_value = fp_math.shift_left16(relu_value, 1)
860
861 if relu_shift > 31:
862 relu_value = fp_math.rounding_divide_by_pot(relu_value, relu_shift - 31)
863
864 # Rescaled the value into a 16bit fixedpoint relu_value in [-1, 1]
865 # Now convert that to a 16bit fixedpoint value in [0, 1]
866 relu_value = (relu_value + (1 << 15)) >> 1
867 lut_result = fp_math.saturating_mul16(relu_value, input_value_preshift)
868 shift = 31 - out_shift
869 shift = -shift if shift < 0 else 0
870 # Finally apply the output shift
871 lut_result = fp_math.rounding_divide_by_pot(lut_result, shift) + zp_out
872 lut_result = min(quantized_max, max(quantized_min, lut_result))
873 values.append(lut_result)
874 return convert_to_lut(op, values, "hardswish")
875 return op
876
877
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200878def convert_lrelu_to_mul_max(op, arch):
879 # Converts LeakyRelu to Max(alpha * IFM, identity * IFM)
880 # (the opposite of convert_mul_max_to_abs_or_lrelu)
Louis Verhaardaee5d752020-09-30 09:01:52 +0200881 ifm, ofm = op.get_ifm_ofm()
Tim Hall93582962020-09-09 21:58:15 +0100882 if ifm is None or ofm is None:
883 return op
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200884
885 # Add multiplication with alpha
Louis Verhaardaee5d752020-09-30 09:01:52 +0200886 mul_alpha = Operation(Op.Mul, op.name + "_mul_alpha")
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200887 mul_alpha.add_input_tensor(ifm)
888 # Create const tensor containing alpha as scalar
889 alpha = op.attrs["alpha"]
890 quantization = ifm.quantization.clone()
891 quantization.min = 0
892 quantization.max = alpha * (quantization.quant_max - quantization.quant_min)
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200893 quantization.zero_point = 0
Louis Verhaardece4e652021-01-07 13:35:47 +0100894 if np.isinf(1 / np.float32(alpha)):
895 # Handling of alpha near zero
896 quantization.scale_f32 = 1
897 scalar = 0
898 else:
899 quantization.scale_f32 = alpha
900 scalar = 1
901 alpha_tens = create_const_tensor(
902 op.name + "_alpha_scalar", [], ifm.dtype, [scalar], np.int8, quantization=quantization
903 )
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200904 mul_alpha.add_input_tensor(alpha_tens)
905 fm_alpha = ofm.clone(op.name + "_alpha")
906 mul_alpha.set_output_tensor(fm_alpha)
patrik.gustavssoneeb85152020-12-21 17:10:40 +0000907 mul_alpha.set_ifm_ofm_shapes()
Tim Halle6ccd872020-11-09 16:46:37 +0000908 DebugDatabase.add_optimised(op, mul_alpha)
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200909
Tim Hall93582962020-09-09 21:58:15 +0100910 if check_quantized_tens_scaling_equal(ifm, ofm):
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200911 # No identity multiplication is needed
912 fm_id = ifm
913 else:
914 # Add multiplication with identity
Louis Verhaardaee5d752020-09-30 09:01:52 +0200915 mul_identity = Operation(Op.Mul, op.name + "_mul_identity")
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200916 mul_identity.add_input_tensor(ifm)
917 # Create const tensor containing identity as scalar
918 quantization = ifm.quantization.clone()
919 quantization.min = 0
920 quantization.max = quantization.quant_max - quantization.quant_min
921 quantization.scale_f32 = 1
922 quantization.zero_point = 0
923 identity_tens = create_const_tensor(
924 op.name + "_id_scalar", [], ifm.dtype, [1], np.uint8, quantization=quantization
925 )
926 mul_identity.add_input_tensor(identity_tens)
Louis Verhaardece4e652021-01-07 13:35:47 +0100927 # Make sure that fm_id is allocated to a different address than fm_alpha
928 fm_id = ofm.clone(op.name + "_id", set_unique=True)
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200929 mul_identity.set_output_tensor(fm_id)
patrik.gustavssoneeb85152020-12-21 17:10:40 +0000930 mul_identity.set_ifm_ofm_shapes()
Patrik Gustavsson2349d422020-12-01 16:02:29 +0100931 DebugDatabase.add_optimised(op, mul_identity)
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200932
933 # Convert LeakyRelu to Max, add the results of the multiplication(s) as inputs
Louis Verhaardaee5d752020-09-30 09:01:52 +0200934 op.type = Op.Maximum
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200935 op.name = op.name.replace("LeakyRelu", "Maximum")
936 op.inputs = []
937 ifm.consumer_list.remove(op)
938 op.add_input_tensor(fm_alpha)
939 op.add_input_tensor(fm_id)
Patrik Gustavssonc509d332020-12-22 13:53:52 +0100940 op.set_ifm_ofm_shapes()
Tim Halle6ccd872020-11-09 16:46:37 +0000941
942 DebugDatabase.add_optimised(op, op)
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200943 return op
944
945
Louis Verhaard2e186c72020-10-09 10:47:04 +0200946def convert_to_lut(op, lut_values, lut_name):
Louis Verhaardf03bad32020-09-25 08:30:44 +0200947 # Rewrite the operation by Add with scalar 0 + LUT activation
948 ifm = op.inputs[0]
Tim Hall93582962020-09-09 21:58:15 +0100949 if ifm is None:
950 return op
Louis Verhaard58520b92020-08-24 16:45:38 +0200951 assert ifm.dtype.size_in_bytes() == 1
Louis Verhaardaee5d752020-09-30 09:01:52 +0200952 op.type = Op.Add
Louis Verhaard2e186c72020-10-09 10:47:04 +0200953 op.name = op.name + "_lut_" + lut_name
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200954 # Mark as no-op to enable potential fusing optimizations
955 op.attrs["is_nop"] = True
956 # Create an input tensor containing scalar zero
957 quantization = QuantizationParameters(0.0, 255.0)
Louis Verhaardd7911c42020-08-25 13:36:41 +0200958 quantization.scale_f32 = ifm.quantization.scale_f32
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200959 quantization.zero_point = 0
Louis Verhaard2e186c72020-10-09 10:47:04 +0200960 tens = create_const_tensor(op.inputs[0].name + "_scalar0", [], ifm.dtype, [0], np.uint8, quantization=quantization)
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200961 op.add_input_tensor(tens)
patrik.gustavssoneeb85152020-12-21 17:10:40 +0000962 op.ifm_shapes.append(Shape4D(tens.shape))
Patrik Gustavsson2349d422020-12-01 16:02:29 +0100963
Louis Verhaardf03bad32020-09-25 08:30:44 +0200964 # The LUT must be applied without any preceding rescaling (the LUT itself performs the rescale),
965 # so even if the OFM has a different scale than the IFM, the generated OFM scale instructions
966 # should be the same as the IFM
Louis Verhaardaee5d752020-09-30 09:01:52 +0200967 op.forced_output_quantization = ifm.quantization
Louis Verhaard2e186c72020-10-09 10:47:04 +0200968 lut_tensor = lut.create_lut_tensor(op.name + "_values", lut_values, DataType.int8)
Louis Verhaardf03bad32020-09-25 08:30:44 +0200969 op.set_activation_lut(lut_tensor)
Patrik Gustavssonc509d332020-12-22 13:53:52 +0100970 op.set_ifm_ofm_shapes()
Louis Verhaardf03bad32020-09-25 08:30:44 +0200971 return op
972
973
Louis Verhaard2e186c72020-10-09 10:47:04 +0200974def convert_to_lut8(op, fn, fn_name):
Louis Verhaardf03bad32020-09-25 08:30:44 +0200975 # Converts op to a no-op + int8/uint8 LUT which is generated with the given function.
976 # fn is a function(real) -> real
Louis Verhaardaee5d752020-09-30 09:01:52 +0200977 ifm, ofm = op.get_ifm_ofm()
Louis Verhaardf03bad32020-09-25 08:30:44 +0200978 if ifm.dtype not in (DataType.uint8, DataType.int8) or ifm.dtype != ofm.dtype:
979 return op
980 # Generate the LUT
981 ifm_scale = np.double(ifm.quantization.scale_f32)
982 ofm_scale = np.double(ofm.quantization.scale_f32)
983 zp_in = ifm.quantization.zero_point
984 zp_out = ofm.quantization.zero_point
985 values = []
986 ix = range(256) if ifm.dtype == DataType.uint8 else range(-128, 128)
987 quantized_min = min(ix)
988 quantized_max = max(ix)
989 for x in ix:
990 x_real = ifm_scale * (x - zp_in)
991 y_real = fn(x_real)
992 lut_result = round_away_zero(zp_out + y_real / ofm_scale)
993 lut_result = min(quantized_max, max(quantized_min, lut_result))
994 values.append(lut_result)
Louis Verhaard2e186c72020-10-09 10:47:04 +0200995 return convert_to_lut(op, values, fn_name)
Louis Verhaardf03bad32020-09-25 08:30:44 +0200996
997
998def convert_lrelu_to_lut(op, arch):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200999 ifm, ofm = op.get_ifm_ofm()
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001000 # Generate the LUT
Louis Verhaardd7911c42020-08-25 13:36:41 +02001001 alpha = op.attrs["alpha"]
1002 ifm_scale = np.double(ifm.quantization.scale_f32)
1003 ofm_scale = np.double(ofm.quantization.scale_f32)
1004 zp_in = ifm.quantization.zero_point
1005 zp_out = ofm.quantization.zero_point
1006 identity_scale, identity_shift = scaling.elementwise_mul_scale(ifm_scale, 1, ofm_scale)
1007 alpha_scalar = 1
1008 alpha_scale, alpha_shift = scaling.elementwise_mul_scale(ifm_scale, alpha, ofm_scale)
1009 if "alpha_scaling" in op.attrs:
1010 # The LeakyRelu was the result from convert_mul_max_to_abs_or_lrelu
1011 alpha_scalar, alpha_scale, alpha_shift = op.attrs["alpha_scaling"]
1012 values = []
Louis Verhaard58520b92020-08-24 16:45:38 +02001013 ix = range(256) if ifm.dtype == DataType.uint8 else range(-128, 128)
Louis Verhaardd7911c42020-08-25 13:36:41 +02001014 quantized_min = min(ix)
1015 quantized_max = max(ix)
1016 for x in ix:
1017 if x < zp_in:
1018 lut_result = zp_out + fp_math.multiply_by_quantized_multiplier(
1019 alpha_scalar * (x - zp_in), alpha_scale, alpha_shift
1020 )
1021 else:
1022 lut_result = zp_out + fp_math.multiply_by_quantized_multiplier(x - zp_in, identity_scale, identity_shift)
1023 lut_result = min(quantized_max, max(quantized_min, lut_result))
1024 values.append(lut_result)
Louis Verhaard2e186c72020-10-09 10:47:04 +02001025 return convert_to_lut(op, values, "lrelu")
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001026
1027
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +02001028def convert_lrelu(op, arch, nng):
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001029 # Converts LeakyRelu to a LUT based solution if possible, otherwise a mul + max
Louis Verhaardaee5d752020-09-30 09:01:52 +02001030 if op.type != Op.LeakyRelu:
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001031 return op
Louis Verhaardaee5d752020-09-30 09:01:52 +02001032 ifm, ofm = op.get_ifm_ofm()
Tim Hall93582962020-09-09 21:58:15 +01001033 if ifm is None or ofm is None:
1034 return op
Louis Verhaardd7911c42020-08-25 13:36:41 +02001035 if ifm.dtype in (DataType.uint8, DataType.int8) and ifm.dtype == ofm.dtype:
1036 # use LUT for int8/uint8
1037 return convert_lrelu_to_lut(op, arch)
Tim Hall93582962020-09-09 21:58:15 +01001038 if check_quantized_tens_scaling_equal(ifm, ofm) and ifm.dtype == ofm.dtype == DataType.int16:
Louis Verhaardd7911c42020-08-25 13:36:41 +02001039 # use LeakyRelu unmodified for int16 with equal input/output scaling
1040 return op
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001041 return convert_lrelu_to_mul_max(op, arch)
1042
1043
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +02001044def convert_tanh_sigmoid_to_lut(op, arch, nng):
Louis Verhaardf03bad32020-09-25 08:30:44 +02001045 # Converts int8/uint8 Sigmoid and Tanh to a LUT based solution
Louis Verhaardaee5d752020-09-30 09:01:52 +02001046 if op.type == Op.Sigmoid:
Louis Verhaard2e186c72020-10-09 10:47:04 +02001047 return convert_to_lut8(op, clamp_sigmoid, "sigmoid")
Louis Verhaardaee5d752020-09-30 09:01:52 +02001048 elif op.type == Op.Tanh:
Louis Verhaard2e186c72020-10-09 10:47:04 +02001049 return convert_to_lut8(op, math.tanh, "tanh")
Louis Verhaardf03bad32020-09-25 08:30:44 +02001050 return op
1051
1052
Patrik Gustavsson3a269202021-01-21 08:28:55 +01001053def remove_reshapes(op, arch):
1054 if op.run_on_npu and op.type == Op.Reshape:
1055 ofm = op.ofm
1056 ifm = op.ifm
Patrik Gustavssonfa4cb292020-09-10 08:19:36 +02001057
Patrik Gustavsson3a269202021-01-21 08:28:55 +01001058 # Check if quantization is the same in the input and output for the reshape ops
1059 if not check_quantized_tens_scaling_equal(ifm, ofm):
1060 # TODO Both tensors are needed, since quantisation properties currently are linked to Tensors.
1061 # In order to remove this reshape either quantization properties need to be moved to Operator,
1062 # or the reshape need to be replace with a NOP.
1063 return
Patrik Gustavssonfa4cb292020-09-10 08:19:36 +02001064
Patrik Gustavsson3a269202021-01-21 08:28:55 +01001065 # Check if ifm is a sg input
1066 if ifm.ops[0].type in (Op.Placeholder, Op.SubgraphInput, Op.Const):
1067 # put the reshape on CPU
1068 op.run_on_npu = False
1069 return
1070
1071 # Check if Reshape ifm/ofm are network ifm/ofm
1072 ifm_is_sg_ofm = any(ifm_cons is None for ifm_cons in ifm.consumer_list)
1073 ofm_is_sg_ofm = any(ofm_cons is None for ofm_cons in ofm.consumer_list)
1074
1075 if ifm_is_sg_ofm and ofm_is_sg_ofm:
1076 # Both ifm and ofm are sg outputs,add reshape to the ifm and put it on CPU
1077 ifm_cons_list_copy = ifm.consumer_list.copy()
1078 ifm_ops_copy = ifm.ops.copy()
1079 for ifm_cons in ifm_cons_list_copy:
1080 if ifm_cons is None:
1081 # Create a reshape op with ifm as output
1082 name = ifm.name + "_cpu_reshape"
1083 reshape_ifm = ifm.clone()
1084 reshape_op = Operation(Op.Reshape, name)
1085 reshape_op.attrs["new_shape"] = ifm.shape
1086 reshape_op.add_input_tensor(reshape_ifm)
1087 reshape_op.add_input_tensor(create_const_tensor(name + "_shape", [1], DataType.int32, ifm.shape))
1088 reshape_op.set_output_tensor(ifm)
1089 reshape_op.set_ifm_ofm_shapes()
1090 reshape_op.run_on_npu = False
1091 reshape_op.ofm.ops = [reshape_op]
1092 reshape_op.ofm.consumer_list = [None]
1093
1094 # Set reshape_ifm producers
1095 for prev_op in ifm_ops_copy:
1096 prev_op.outputs = [reshape_ifm]
1097 reshape_ifm.ops.append(prev_op)
1098
1099 # Set reshape_ifm consumers
1100 for ifm_cons in ifm_cons_list_copy:
1101 if ifm_cons is not None:
1102 for ifm_idx, cons_ifm in enumerate(ifm_cons.inputs):
1103 if cons_ifm == ifm:
1104 ifm_cons.set_input_tensor(reshape_ifm, ifm_idx)
1105
1106 ifm = reshape_ifm
1107 break
1108 ifm_is_sg_ofm = False
1109
1110 if ofm_is_sg_ofm:
1111 # Bypassed by replacing ifm with ofm
1112 ofm.ops = []
1113 for prev_op in ifm.ops:
1114 prev_op.outputs = [ofm]
1115 ofm.ops.append(prev_op)
1116
1117 # All ifm consumers need to use ofm as input
1118 for ifm_cons in ifm.consumer_list:
1119 for ifm_idx, cons_ifm in enumerate(ifm_cons.inputs):
1120 if cons_ifm == ifm:
1121 ifm_cons.set_input_tensor(ofm, ifm_idx)
1122 if op.ifm_shapes[0] != op.ofm_shapes[0]:
1123 ofm.avoid_NHCWB16 = True
1124 else:
1125 # Bypassed Reshape by replacing ofm with ifm
1126 for cons in ofm.consumer_list:
1127 for ifm_idx, cons_ifm in enumerate(cons.inputs):
1128 if cons_ifm == ofm:
1129 cons.set_input_tensor(ifm, ifm_idx)
1130 if op.ifm_shapes[0] != op.ofm_shapes[0]:
1131 ifm.avoid_NHCWB16 = True
1132
1133
1134def check_reshapes(op, arch):
1135 if op.run_on_npu and op.type == Op.Reshape:
1136 ofm = op.ofm
1137
1138 if check_quantized_tens_scaling_equal(op.ifm, ofm):
1139 # Reshape should have been removed
1140 raise VelaError(f"Reshape op {op} expected to have been removed, still remains")
Patrik Gustavssonfa4cb292020-09-10 08:19:36 +02001141
1142
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +02001143def fuse_activation_function_with_prev(op, arch, nng):
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001144 # if op is a no-op: attempts to move the activation function to the preceding op
Louis Verhaardaee5d752020-09-30 09:01:52 +02001145 if not op.attrs.get("is_nop", False) or op.activation is None:
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001146 return op
Louis Verhaardaee5d752020-09-30 09:01:52 +02001147 ifm, ofm = op.get_ifm_ofm()
Tim Hall93582962020-09-09 21:58:15 +01001148 if ifm is None or ofm is None:
1149 return op
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001150 # finds the input(s) to the operation
1151 prev_op = ifm.ops[0]
1152 # Note: the below checks on prev_op require that a first optimize pass on the full graph has been performed
1153 fuse = (
1154 prev_op.run_on_npu
Louis Verhaardaee5d752020-09-30 09:01:52 +02001155 and prev_op.type.npu_block_type != NpuBlockType.Default
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001156 and len(ifm.ops) == 1
1157 and len(prev_op.outputs[0].consumers()) == 1
Louis Verhaardaee5d752020-09-30 09:01:52 +02001158 and prev_op.activation is None
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001159 )
1160 if op.activation_lut is not None and arch.shram_reserved_unused_banks == 0:
1161 # TODO: if SHRAM LUT space is shared with SHRAM ACC (32, 64 MAC),
1162 # LUT currently only works correctly for elementwise ops
1163 fuse = False
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001164 if not fuse:
1165 return op
1166 # Move the fused activation function + corresponding info to prev_op
Louis Verhaardaee5d752020-09-30 09:01:52 +02001167 prev_op.activation = op.activation
1168 prev_op.forced_output_quantization = op.forced_output_quantization
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001169 if op.activation_lut is not None:
1170 prev_op.set_activation_lut(op.activation_lut)
1171 # Bypass op
Louis Verhaard98a34992020-09-01 10:39:04 +02001172 prev_op.set_output_tensor(ofm)
Tim Halle6ccd872020-11-09 16:46:37 +00001173 DebugDatabase.add_optimised(op, prev_op)
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001174 return op
1175
1176
Louis Verhaardae2d5532020-12-11 17:19:54 +01001177def optimise_pad(op, arch, nng):
1178 """
1179 Converts tens1 -> PAD -> tens2 -> CONV to tens1 -> CONV
1180 if both operations can be run on the NPU.
1181 """
1182 if (
1183 (op.type.is_conv2d_op() or op.type.is_depthwise_conv2d_op())
1184 and op.run_on_npu
1185 and op.attrs["padding"] == Padding.VALID
1186 ):
1187 pad_op = op.ifm.ops[0]
1188 if pad_op.type != Op.Pad or not pad_op.run_on_npu:
1189 return op
1190 # Bypass the PAD operator
1191 op.set_input_tensor(pad_op.ifm, 0)
1192 # Adjust the padding attributes of the convolution operator
1193 op.attrs["padding"] = Padding.EXPLICIT
1194 padding = pad_op.inputs[1].values # 4x2 tensor, first dimension is N, H, W, C
1195 top, left, bottom, right = (padding[1][0], padding[2][0], padding[1][1], padding[2][1])
1196 op.attrs["explicit_padding"] = (top, left, bottom, right)
1197 op.set_ifm_ofm_shapes()
1198 return op
1199
1200
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +02001201def add_attrs_to_resizebilinear(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +02001202 if op.type == Op.ResizeBilinear and op.run_on_npu:
Dwight Lidman42fed942020-05-29 09:37:03 +02001203 input_tensor = op.inputs[0]
Patrik Gustavsson3a269202021-01-21 08:28:55 +01001204 input_shape = op.ifm_shapes[0]
1205 upscaled_height = input_shape.height * 2
1206 upscaled_width = input_shape.width * 2
1207 out_shape = op.ofm_shapes[0]
1208 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 +02001209 # this means the output is supposed to be a x2 upscale,
1210 # so we need to do SAME padding
Michael McGeagh16895482020-12-14 15:51:20 +00001211 op.attrs["padding"] = Padding.SAME
Patrik Gustavsson3a269202021-01-21 08:28:55 +01001212 elif (
1213 op.attrs["align_corners"]
1214 and out_shape.height == (upscaled_height - 1)
1215 and out_shape.width == (upscaled_width - 1)
1216 ):
Dwight Lidman42fed942020-05-29 09:37:03 +02001217 # here we can just run the avg pool without padding and
1218 # produce a (M * 2 - 1, N * 2 - 1) sized output
Michael McGeagh16895482020-12-14 15:51:20 +00001219 op.attrs["padding"] = Padding.VALID
Dwight Lidman42fed942020-05-29 09:37:03 +02001220 else:
Charles Xu9a03fdf2020-07-02 15:12:40 +02001221 return op
Dwight Lidman42fed942020-05-29 09:37:03 +02001222 input_tensor.resampling_mode = resampling_mode.NEAREST
Tim Hallc30f4952020-06-15 20:47:35 +01001223 op.attrs.update({"strides": (1, 1, 1, 1), "ksize": (1, 2, 2, 1)})
Dwight Lidman42fed942020-05-29 09:37:03 +02001224 return op
1225
1226
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +02001227def fixup_bias_tensors(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +02001228 if op.type.needs_bias() and op.bias is None:
Jacob Bohlina41cd4d2020-08-26 18:21:28 +02001229 # Op has no bias, add bias tensor filled with zeros
1230 nr_biases = op.inputs[1].shape[-1]
1231 bias_values = [0] * nr_biases
1232 bias_tensor = create_const_tensor(op.name + "_bias", [nr_biases], DataType.int32, bias_values)
1233 bias_tensor.quant_values = bias_tensor.values
1234 op.set_input_tensor(bias_tensor, -1)
Jacob Bohlin67e0d8f2020-08-20 10:53:02 +02001235
1236 return op
1237
1238
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +02001239def supported_operator_check(op, arch, nng):
Tim Hall79d07d22020-04-27 18:20:16 +01001240 op.run_on_npu = arch.supported_operators.is_operator_supported(op)
1241 return op
1242
1243
Tim Halle6ccd872020-11-09 16:46:37 +00001244def _record_optimised(op, arch):
1245 if op.type != Op.Const:
1246 DebugDatabase.add_optimised(op, op)
1247
1248
Tim Hall79d07d22020-04-27 18:20:16 +01001249def optimise_graph_a(nng, arch, verbose_graph=False):
1250 if verbose_graph:
1251 nng.print_graph()
1252
Patrik Gustavsson2349d422020-12-01 16:02:29 +01001253 pre_process_list = [
1254 supported_operator_check,
1255 set_ifm_ofm_op_shapes,
1256 # TODO: memory-only Op removal
1257 ]
1258
1259 for idx, sg in enumerate(nng.subgraphs):
1260 # rewrite graph pass
1261 nng.subgraphs[idx] = rewrite_graph.rewrite_graph_pre_order(
1262 nng, sg, arch, [], pre_process_list, rewrite_unsupported=False,
1263 )
1264
Patrik Gustavsson3a269202021-01-21 08:28:55 +01001265 # Handle Concat Ops
1266 for idx, sg in enumerate(nng.subgraphs):
1267 # rewrite graph pass
Patrik Gustavsson2c2522d2021-01-29 11:51:31 +01001268 rewrite_graph.visit_graph_post_order(sg.output_tensors, arch, [], [rewrite_concat_ops])
1269 sg.refresh_after_modification()
Patrik Gustavsson3a269202021-01-21 08:28:55 +01001270
1271 # Handle Split Ops
1272 for idx, sg in enumerate(nng.subgraphs):
1273 # rewrite graph pass
1274 nng.subgraphs[idx] = rewrite_graph.rewrite_graph_pre_order(
1275 nng,
1276 sg,
1277 arch,
1278 [],
1279 [rewrite_unpack_output, rewrite_stridedslice_output, convert_nop_split_to_identity],
1280 rewrite_unsupported=False,
1281 )
1282
1283 for idx, sg in enumerate(nng.subgraphs):
1284 # rewrite graph pass
1285 nng.subgraphs[idx] = rewrite_graph.rewrite_graph_pre_order(
1286 nng, sg, arch, [rewrite_split_ops], [], rewrite_unsupported=False,
1287 )
1288
1289 # Removal of reshapes
1290 for sg in nng.subgraphs:
1291 rewrite_graph.visit_graph_post_order(sg.output_tensors, arch, [], [remove_reshapes])
1292 sg.refresh_after_modification()
1293
Tim Hall79d07d22020-04-27 18:20:16 +01001294 op_rewrite_list = [
Tim Hall4e127762020-05-15 16:05:49 +01001295 set_tensor_equivalence,
Tim Hall79d07d22020-04-27 18:20:16 +01001296 convert_depthwise_to_conv,
Michael McGeagh8d939c02020-07-29 13:11:43 +01001297 convert_conv_to_fc,
Fredrik Svedberga0c36242020-06-03 15:43:31 +02001298 convert_softmax,
Diqing Zhong016b8272020-12-16 16:46:06 +01001299 optimise_strided_conv,
Diqing Zhong189f7482021-01-26 12:12:51 +01001300 convert_hardswish_to_lut,
Patrik Gustavsson2c2522d2021-01-29 11:51:31 +01001301 rewrite_fully_connected_input,
Diqing Zhong94457b12020-12-09 15:22:40 +01001302 convert_batched_fc_shape,
Tim Hall79d07d22020-04-27 18:20:16 +01001303 fixup_conv2d_backprop,
Michael McGeagh8dbf8cf2020-09-08 11:09:48 +01001304 fixup_relus_with_differing_ifm_ofm_scaling,
Tim Hall79d07d22020-04-27 18:20:16 +01001305 fixup_act_reorder,
Patrik Gustavsson3a269202021-01-21 08:28:55 +01001306 fixup_elementwise_with_scalars, # TODO Move to early stage?
Jacob Bohline843d332020-06-23 12:12:56 +02001307 reorder_depthwise_weights,
Charles Xu9a03fdf2020-07-02 15:12:40 +02001308 fixup_resizebilinear,
Jacob Bohlina41cd4d2020-08-26 18:21:28 +02001309 fixup_bias_tensors,
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001310 convert_mul_max_to_abs_or_lrelu,
1311 convert_lrelu,
Louis Verhaardf03bad32020-09-25 08:30:44 +02001312 convert_tanh_sigmoid_to_lut,
Tim Hall79d07d22020-04-27 18:20:16 +01001313 ]
1314
1315 for idx, sg in enumerate(nng.subgraphs):
1316 # rewrite graph pass
1317 nng.subgraphs[idx] = rewrite_graph.rewrite_graph_pre_order(
Dwight Lidman73320a42020-11-05 10:34:41 +01001318 nng, sg, arch, [], op_rewrite_list, rewrite_unsupported=False,
Tim Hall79d07d22020-04-27 18:20:16 +01001319 )
1320
1321 for idx, sg in enumerate(nng.subgraphs):
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001322 # remove passthrough tensors and attempt further optimizations
1323 nng.subgraphs[idx] = rewrite_graph.rewrite_graph_pre_order(
Louis Verhaardae2d5532020-12-11 17:19:54 +01001324 nng,
1325 sg,
1326 arch,
1327 [remove_passthrough_tensor],
1328 [fuse_activation_function_with_prev, optimise_pad, add_padding_fields],
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001329 )
Tim Hall79d07d22020-04-27 18:20:16 +01001330
Patrik Gustavsson3a269202021-01-21 08:28:55 +01001331 # Post-optimisation operator debug tracing, and checking that no undesired reshapes are left in the graph
Tim Halle6ccd872020-11-09 16:46:37 +00001332 for sg in nng.subgraphs:
Patrik Gustavsson3a269202021-01-21 08:28:55 +01001333 rewrite_graph.visit_graph_post_order(sg.output_tensors, arch, [], [check_reshapes, _record_optimised])
Tim Hall79d07d22020-04-27 18:20:16 +01001334
1335 if verbose_graph:
1336 nng.print_graph()
1337 return nng