blob: 4806001f6b8b4656ef2e8b7d455da72d6a9a6a38 [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
Diego Russoea6111a2020-04-14 18:41:58 +010020
21import numpy as np
22
Louis Verhaardd7911c42020-08-25 13:36:41 +020023from . import fp_math
Louis Verhaardb9fc33c2020-08-13 11:47:36 +020024from . import lut
Diego Russoea6111a2020-04-14 18:41:58 +010025from . import rewrite_graph
Louis Verhaardd7911c42020-08-25 13:36:41 +020026from . import scaling
Diego Russoea6111a2020-04-14 18:41:58 +010027from .data_type import DataType
Tim Halle6ccd872020-11-09 16:46:37 +000028from .debug_database import DebugDatabase
Louis Verhaard7db78962020-05-25 15:05:26 +020029from .errors import UnsupportedFeatureError
Dwight Lidman42fed942020-05-29 09:37:03 +020030from .ethos_u55_regs.ethos_u55_regs import resampling_mode
Louis Verhaard8912c532020-09-30 12:11:49 +020031from .numeric_util import clamp_sigmoid
Louis Verhaarde0ef2732020-06-03 08:56:44 +020032from .numeric_util import full_shape
Louis Verhaardf03bad32020-09-25 08:30:44 +020033from .numeric_util import round_away_zero
Louis Verhaarde8a5a782020-11-02 18:04:27 +010034from .operation import create_activation_function
Diego Russoe8a10452020-04-21 17:39:10 +010035from .operation import NpuBlockType
Louis Verhaardaee5d752020-09-30 09:01:52 +020036from .operation import Op
Diego Russoe8a10452020-04-21 17:39:10 +010037from .operation import Operation
Michael McGeagh16895482020-12-14 15:51:20 +000038from .operation import Padding
Fredrik Svedbergd9c2c422020-12-01 16:33:45 +010039from .operation_util import create_avgpool_nop
Fredrik Svedberga0c36242020-06-03 15:43:31 +020040from .softmax import SoftMax
Tim Hall93582962020-09-09 21:58:15 +010041from .tensor import check_quantized_tens_scaling_equal
Michael McGeaghc5b549b2020-08-07 11:54:28 +010042from .tensor import create_const_tensor
43from .tensor import create_reshape_tensor
Charles Xu9a03fdf2020-07-02 15:12:40 +020044from .tensor import QuantizationParameters
Diego Russoe8a10452020-04-21 17:39:10 +010045from .tensor import Tensor
Michael McGeagh7a6f8432020-12-02 15:29:22 +000046from .tflite_mapping import optype_to_builtintype
Tim Hall79d07d22020-04-27 18:20:16 +010047
Michael McGeaghf3e3ad72020-12-02 12:39:03 +000048passthrough_nodes = (Op.Identity,)
Tim Hall79d07d22020-04-27 18:20:16 +010049
Michael McGeaghf3e3ad72020-12-02 12:39:03 +000050memory_only_ops = (Op.Reshape,)
Michael McGeagh11b0bdb2020-09-08 11:07:35 +010051
Tim Hall79d07d22020-04-27 18:20:16 +010052
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +020053def remove_passthrough_tensor(tens, arch, nng):
Tim Hall79d07d22020-04-27 18:20:16 +010054 if len(tens.ops) == 1 and tens.ops[0].type in passthrough_nodes:
55 assert len(tens.ops[0].inputs) == 1
56 tens = tens.ops[0].inputs[0]
57 return tens
58
59
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +020060def rewrite_concat(tens, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +020061 if len(tens.ops) == 1 and tens.ops[0].type.is_concat_op():
Tim Hall79d07d22020-04-27 18:20:16 +010062 concat_op = tens.ops[0]
63 if tens != concat_op.outputs[0]:
64 return tens # don't attempt to rewrite the min/max outputs of QuantizedConcat
65
66 # Not supported so leave it and run on CPU
67 if not concat_op.run_on_npu:
68 return tens
69
70 inputs, axis = concat_op.get_concat_inputs_axis()
71
72 tens.ops = []
73 offset = 0
74 for idx, inp in enumerate(inputs):
Louis Verhaardaee5d752020-09-30 09:01:52 +020075 new_op = Operation(Op.ConcatSliceWrite, concat_op.name + str(idx))
Tim Hall79d07d22020-04-27 18:20:16 +010076 new_op.inputs = [inp]
77 new_op.outputs = [tens]
78 new_op.attrs["concat_axis"] = axis
79 new_op.attrs["concat_start"] = offset
80 offset += inp.shape[axis]
81 new_op.attrs["concat_end"] = offset
82 new_op.run_on_npu = True
83 tens.ops.append(new_op)
Tim Halle6ccd872020-11-09 16:46:37 +000084 DebugDatabase.add_optimised(concat_op, new_op)
Tim Hall79d07d22020-04-27 18:20:16 +010085 assert tens.shape[axis] == offset
86
Patrik Gustavsson29d568e2020-08-18 10:11:21 +020087 # If axis corresponds to C-dimension, NHCWB16 can only be used in the output if all the concat_start's are a
88 # multiple of 16. This as, it is only then the address offset for the ofm, for all operations, will be 16 byte
89 # aligned. For other values of axis the address offsets will be 16 byte aligned, as they are all based on c = 0
Patrik Gustavsson458a2082020-08-13 13:41:05 +020090 # and those addresses are always 16 byte aligned due to the NHCWB16 format.
Patrik Gustavsson6c97e9a2020-09-23 11:02:18 +020091 if axis == -1 or axis == (len(tens.shape) - 1):
Patrik Gustavsson458a2082020-08-13 13:41:05 +020092 for op in tens.ops:
93 if op.attrs["concat_start"] % 16 != 0:
94 tens.avoid_NHCWB16 = True
95 break
96
Tim Hall79d07d22020-04-27 18:20:16 +010097 return tens
98
99
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200100def rewrite_split(tens, arch, nng):
Tim Hall79d07d22020-04-27 18:20:16 +0100101
Louis Verhaardaee5d752020-09-30 09:01:52 +0200102 if len(tens.ops) == 1 and tens.ops[0].type.is_split_op():
Tim Hall79d07d22020-04-27 18:20:16 +0100103 split_op = tens.ops[0]
104
105 # Not supported so leave it and run on CPU
106 if not split_op.run_on_npu:
107 return tens
108
109 inp, outputs, axis, offset_start, offset_end = split_op.get_split_inputs_axis()
110
111 tens.ops = []
Louis Verhaardaee5d752020-09-30 09:01:52 +0200112 new_op = Operation(Op.SplitSliceRead, split_op.name)
Tim Hall79d07d22020-04-27 18:20:16 +0100113 new_op.inputs = [inp]
Tim Hall79d07d22020-04-27 18:20:16 +0100114
115 # For Split the offset cannot be extracted from the tensor so it has to
116 # be calculated from the index of the output tensor
Diego Russoea6111a2020-04-14 18:41:58 +0100117 if axis is not None:
Tim Hall79d07d22020-04-27 18:20:16 +0100118 # Get the start and end of the split
119 offset_start = [0] * len(tens.shape)
120 offset_end = [0] * len(tens.shape)
121 for out in outputs:
122 if out == tens:
123 break
124 offset_start[axis] += out.shape[axis]
125
Patrik Gustavssoneebb1c22020-08-18 15:03:04 +0200126 # If start offset is not a multiple of 16 in the C-dimension, NHCWB16 need to be avoided in the input
127 if (offset_start[-1] % 16) != 0:
128 inp.avoid_NHCWB16 = True
129
Tim Hall79d07d22020-04-27 18:20:16 +0100130 offset_end[axis] = offset_start[axis] + tens.shape[axis]
131
132 new_op.attrs["split_start"] = offset_start
133 new_op.attrs["split_end"] = offset_end
134 new_op.run_on_npu = True
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100135 new_op.set_output_tensor(tens)
Tim Halle6ccd872020-11-09 16:46:37 +0000136 DebugDatabase.add_optimised(split_op, new_op)
Tim Hall79d07d22020-04-27 18:20:16 +0100137
138 return tens
139
140
141def needed_total_padding(input_size, stride, filter_size):
142 out_size = (input_size + stride - 1) // stride
143 needed_input = (out_size - 1) * stride + filter_size
144 total_padding = max(0, needed_input - input_size)
145 return total_padding
146
147
148def calc_padding_and_skirt(padding_type, kernel_size, stride, input_dims):
149 ypad = needed_total_padding(int(input_dims[1]), int(stride[1]), int(kernel_size[0]))
150 xpad = needed_total_padding(int(input_dims[2]), int(stride[2]), int(kernel_size[1]))
Michael McGeagh16895482020-12-14 15:51:20 +0000151 if padding_type == Padding.SAME:
Tim Hall79d07d22020-04-27 18:20:16 +0100152 left_pad = (xpad + 0) // 2
153 right_pad = (xpad + 1) // 2
154 top_pad = (ypad + 0) // 2
155 bottom_pad = (ypad + 1) // 2
Michael McGeagh16895482020-12-14 15:51:20 +0000156 elif padding_type == Padding.VALID:
Tim Hall79d07d22020-04-27 18:20:16 +0100157 left_pad = 0
158 right_pad = 0
159 top_pad = 0
160 bottom_pad = 0
161 else:
Michael McGeagh16895482020-12-14 15:51:20 +0000162 raise UnsupportedFeatureError(f"Unknown padding")
Tim Hall79d07d22020-04-27 18:20:16 +0100163 padding = (top_pad, left_pad, bottom_pad, right_pad)
164 skirt = (top_pad, left_pad, ypad - top_pad, xpad - left_pad)
165 return padding, skirt
166
Tim Hallc30f4952020-06-15 20:47:35 +0100167
Jacob Bohlin9b64ba02020-07-07 17:15:22 +0200168def calc_upscaled_padding_and_skirt(padding_type, kernel_size, stride, input_dims, upscaling_factor):
169 kernel_height, kernel_width = kernel_size[0], kernel_size[1]
Michael McGeagh16895482020-12-14 15:51:20 +0000170 if padding_type == Padding.SAME:
Jacob Bohlin9b64ba02020-07-07 17:15:22 +0200171 ypad = needed_total_padding(int(input_dims[1]) * upscaling_factor, int(stride[1]), int(kernel_height))
172 xpad = needed_total_padding(int(input_dims[2]) * upscaling_factor, int(stride[2]), int(kernel_width))
Jacob Bohlind47cc272020-08-24 11:42:14 +0200173 right_pad = max(((xpad + 1) // upscaling_factor) - 1, 0)
174 bottom_pad = max(((ypad + 1) // upscaling_factor) - 1, 0)
Jacob Bohlin9b64ba02020-07-07 17:15:22 +0200175 left_pad = max(kernel_width - 1 - right_pad, 0)
176 top_pad = max(kernel_height - 1 - bottom_pad, 0)
Michael McGeagh16895482020-12-14 15:51:20 +0000177 elif padding_type == Padding.VALID:
Jacob Bohlin9b64ba02020-07-07 17:15:22 +0200178 right_pad = max(kernel_width - 2, 0)
179 bottom_pad = max(kernel_height - 2, 0)
180 left_pad = kernel_width - 1
181 top_pad = kernel_height - 1
Jacob Bohlincf7da102020-05-20 09:03:40 +0200182 else:
Michael McGeagh16895482020-12-14 15:51:20 +0000183 raise UnsupportedFeatureError(f"Unknown padding")
Jacob Bohlincf7da102020-05-20 09:03:40 +0200184 padding = (top_pad, left_pad, bottom_pad, right_pad)
Jacob Bohlin9b64ba02020-07-07 17:15:22 +0200185 skirt = padding
Jacob Bohlincf7da102020-05-20 09:03:40 +0200186 return padding, skirt
187
Tim Hall79d07d22020-04-27 18:20:16 +0100188
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200189def fixup_conv2d_backprop(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200190 if op.type == Op.Conv2DBackpropInput:
Tim Hall79d07d22020-04-27 18:20:16 +0100191 # flip the inputs
192 op.inputs[0], op.inputs[2] = op.inputs[2], op.inputs[0]
Louis Verhaardaee5d752020-09-30 09:01:52 +0200193 op.type = Op.Conv2DBackpropInputSwitchedBias
Jacob Bohlincf7da102020-05-20 09:03:40 +0200194
195 # Update strides
Tim Hallc30f4952020-06-15 20:47:35 +0100196 op.attrs.update({"stride_w": 1, "stride_h": 1, "strides": (1, 1, 1, 1)})
Tim Hall79d07d22020-04-27 18:20:16 +0100197
198 return op
199
200
Charles Xu9a03fdf2020-07-02 15:12:40 +0200201# Convert the op to an elementwise add
202def convert_resizebilinear_1x1_to_add(op):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200203 op.type = Op.Add
Charles Xu9a03fdf2020-07-02 15:12:40 +0200204 op.name = op.name + "_add"
Charles Xu9a03fdf2020-07-02 15:12:40 +0200205 op.attrs["resizebilinear"] = True
206 # Create an input tensor filled with zeros
207 shape = op.outputs[0].shape
208 tens = Tensor(shape, op.inputs[0].dtype, op.inputs[1].name + "_add")
209 tens.values = np.zeros(shape)
210 tens.quant_values = np.zeros(shape, np.uint8)
211 tens.quantization = QuantizationParameters(0.0, 255.0)
212 tens.quantization.scale_f32 = 1.0
213 tens.quantization.zero_point = 0
214 tens.consumer_list = [op]
215 tens_op = op.inputs[1].ops[0]
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100216 tens_op.set_output_tensor(tens)
Charles Xu9a03fdf2020-07-02 15:12:40 +0200217 # Set the add inputs
218 op.inputs[1] = op.inputs[0]
219 op.inputs[0] = tens
220
221 return op
222
223
Charles Xu87c13502020-08-06 12:17:26 +0200224# Convert ResizeBilinear to a number of 2x2 pool ops
225def convert_resizebilinear_to_2x2_pool(op):
226 count = 0
227 pre_op = op
228 outputs = op.outputs
229
230 op.attrs.update({"strides": (1, 1, 1, 1), "ksize": (1, 2, 2, 1)})
231 if op.attrs["align_corners"]:
232 shape_modifier = 1
Michael McGeagh16895482020-12-14 15:51:20 +0000233 op.attrs["padding"] = Padding.VALID
Charles Xu87c13502020-08-06 12:17:26 +0200234 else:
235 shape_modifier = 0
Michael McGeagh16895482020-12-14 15:51:20 +0000236 op.attrs["padding"] = Padding.SAME
Charles Xu87c13502020-08-06 12:17:26 +0200237 op.inputs[0].resampling_mode = resampling_mode.NEAREST
238
239 upscaled_shape = np.array(op.inputs[0].shape[1:3])
240 out_shape = np.array(op.outputs[0].shape[1:3])
241 if (upscaled_shape == upscaled_shape * 2 - shape_modifier).all():
242 return op
243
244 while (upscaled_shape < out_shape).all():
245 if count == 0:
246 scaled_op = pre_op
247 else:
248 scaled_op = op.clone("_{}".format(count))
249 scaled_op.inputs[0] = pre_op.outputs[0]
250
251 upscaled_shape = upscaled_shape * 2 - shape_modifier
252
253 if (upscaled_shape == out_shape).all():
254 scaled_op.outputs = outputs
255 scaled_op.outputs[0].ops = [scaled_op]
256 else:
257 shape = outputs[0].shape.copy()
258 shape[1:3] = upscaled_shape[0:2]
259 out_tens = Tensor(shape, DataType.int16, "{}_{}".format(op.outputs[0].name, count))
260 out_tens.quantization = op.outputs[0].quantization.clone()
261 out_tens.quantization.quant_min = np.iinfo(np.int16).min
262 out_tens.quantization.quant_max = np.iinfo(np.int16).max
263 scaled_op.set_output_tensor(out_tens)
264 pre_op = scaled_op
265 count += 1
266
267 # Setup the scale value
268 if scaled_op.inputs[0].dtype.bits == 8 and scaled_op.outputs[0].dtype.bits == 16:
269 scaled_op.attrs["rescale"] = 128
270 elif scaled_op.inputs[0].dtype.bits == 16 and scaled_op.outputs[0].dtype.bits == 8:
271 scaled_op.attrs["rescale"] = 1 / 128
272 elif "rescale" in scaled_op.attrs:
273 del scaled_op.attrs["rescale"]
274
275 return op
276
277
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200278def fixup_resizebilinear(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200279 if op.type == Op.ResizeBilinear and op.run_on_npu:
Charles Xu87c13502020-08-06 12:17:26 +0200280 if op.inputs[0].shape == op.outputs[0].shape:
Charles Xu36ffaf32020-08-05 15:40:44 +0200281 # Bypass nop resizebilinear
282 op.inputs = op.inputs[:1]
Louis Verhaardaee5d752020-09-30 09:01:52 +0200283 op.type = Op.Identity
Charles Xu87c13502020-08-06 12:17:26 +0200284 elif op.inputs[0].shape[1] == 1 and op.inputs[0].shape[2] == 1:
285 convert_resizebilinear_1x1_to_add(op)
286 else:
287 convert_resizebilinear_to_2x2_pool(op)
Charles Xu9a03fdf2020-07-02 15:12:40 +0200288
289 return op
290
291
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200292def convert_nop_split_to_identity(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200293 if op.type == Op.Split and op.attrs.get("num_splits") == 1:
Dwight Lidmanc3862c22020-09-14 15:22:33 +0200294 # the list comprehension should return a list with a single tensor
295 # if it shouldn't, remove_passthrough_tensor will fail appropriately
296 op.inputs = [i for i in op.inputs if i.shape == op.outputs[0].shape]
Louis Verhaardaee5d752020-09-30 09:01:52 +0200297 op.type = Op.Identity
Dwight Lidmanc3862c22020-09-14 15:22:33 +0200298 return op
299
300
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200301def fixup_fully_connected_input(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200302 if op.type == Op.FullyConnected:
Tim Hall79d07d22020-04-27 18:20:16 +0100303 inp = op.inputs[0]
304 weights = op.inputs[1]
305
306 n_in_elems = weights.shape[-2]
307 elms = inp.elements()
308 batch_size = elms // n_in_elems
309 assert batch_size * n_in_elems == elms
310
311 desired_shape = [batch_size, n_in_elems]
312 if inp.shape != desired_shape:
313 # mismatch, insert a reshape to fix this.
Patrik Gustavssoncb337042020-09-16 14:55:40 +0200314 op.set_input_tensor(create_reshape_tensor(inp, desired_shape), 0)
Tim Hall79d07d22020-04-27 18:20:16 +0100315
316 return op
317
318
Diqing Zhong94457b12020-12-09 15:22:40 +0100319def convert_batched_fc_shape(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200320 if op.type == Op.FullyConnected:
Patrik Gustavssoncb337042020-09-16 14:55:40 +0200321 ifm = op.inputs[0]
322 ofm = op.outputs[0]
323 # Check if the FC is 2D and first dimension indicates batching
Tim Hall907cb032020-11-10 19:58:59 +0000324 if len(ifm.shape) == len(ofm.shape) == 2 and ifm.shape[0] > 1:
Patrik Gustavssoncb337042020-09-16 14:55:40 +0200325 n = ifm.shape[0]
326 batching_split = {4: (2, 2), 8: (2, 4), 16: (4, 4)}
327 h, w = batching_split.get(n, (1, n))
328
Patrik Gustavssoncb337042020-09-16 14:55:40 +0200329 prev_op = ifm.ops[0]
330 desired_shape = [1, h, w, ifm.shape[-1]]
Louis Verhaardaee5d752020-09-30 09:01:52 +0200331 if len(ifm.consumer_list) == 1 and prev_op is not None and prev_op.type == Op.Reshape:
Patrik Gustavssoncb337042020-09-16 14:55:40 +0200332 # There is a preceding Reshape
333 # Compare input of prev_op and input of op, to see if prev_op can be removed
334 ifm_prev_op = prev_op.inputs[0]
Tim Hall89567612020-10-27 11:57:57 +0000335 if ifm_prev_op.shape == ifm.shape and check_quantized_tens_scaling_equal(ifm_prev_op, ifm):
Patrik Gustavssoncb337042020-09-16 14:55:40 +0200336 # prev_op can be removed
337 op.set_input_tensor(ifm_prev_op, 0)
338 else:
339 op.inputs[0].set_all_shapes(desired_shape)
340 prev_op.set_input_tensor(
341 create_const_tensor(prev_op.inputs[1].name, [1], DataType.int32, desired_shape), 1
342 )
343 prev_op.attrs["new_shape"] = desired_shape
344 else:
345 # Add reshape op to the input if there is no preceding reshape
346 ifm.consumer_list.remove(op)
347 op.set_input_tensor(create_reshape_tensor(ifm, desired_shape), 0)
348
349 # Reshape Weights to be 4D. IO becomes HWIO
350 weight_tensor = op.inputs[1]
351 weight_tensor.quant_values = np.expand_dims(np.expand_dims(weight_tensor.quant_values, axis=0), axis=0)
352 weight_tensor.set_all_shapes(list(weight_tensor.quant_values.shape))
353
354 desired_shape = [1, h, w, ofm.shape[-1]]
355 if (
356 len(ofm.consumer_list) == 1
357 and ofm.consumer_list[0] is not None
Louis Verhaardaee5d752020-09-30 09:01:52 +0200358 and ofm.consumer_list[0].type == Op.Reshape
Patrik Gustavssoncb337042020-09-16 14:55:40 +0200359 ):
360 # There is a subsequent Reshape
361 # Compare desired shape and output of consumer op, to see if consumer op can be removed
362 ofm_cons_op = ofm.consumer_list[0].outputs[0]
Tim Hall93582962020-09-09 21:58:15 +0100363 if desired_shape == ofm_cons_op.shape and check_quantized_tens_scaling_equal(ofm, ofm_cons_op):
Patrik Gustavssoncb337042020-09-16 14:55:40 +0200364 op.outputs[0] = ofm_cons_op
365 op.outputs[0].ops = [op]
366 else:
367 op.outputs[0].set_all_shapes(desired_shape)
368 else:
Diqing Zhong94457b12020-12-09 15:22:40 +0100369 # Add reshape op to the output
Patrik Gustavssoncb337042020-09-16 14:55:40 +0200370 op.set_output_tensor(create_reshape_tensor(ofm, desired_shape, False))
371 return op
372
373
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200374def fixup_pack_input(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200375 if op.type == Op.Pack:
Tim Hall79d07d22020-04-27 18:20:16 +0100376 # Pack is also referred to as Stack
377 # Requires the rewrite_concat function to be called on the op afterwards
378 axis = int(op.attrs["axis"])
379 desired_shape = op.inputs[0].shape[:axis] + [1] + op.inputs[0].shape[axis:]
380
381 # Construct 1 shape tensor to be used by all inserted reshape ops
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100382 new_shape_tens = create_const_tensor(op.name + "_reshape_shape", [1], DataType.int32, desired_shape)
Tim Hall79d07d22020-04-27 18:20:16 +0100383
384 for idx, inp in enumerate(op.inputs):
Tim Hall79d07d22020-04-27 18:20:16 +0100385 reshape_out = inp.clone("_reshaped")
Michael McGeagh6a8d4242020-07-28 12:17:59 +0100386 reshape_out.set_all_shapes(desired_shape)
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100387
Louis Verhaardaee5d752020-09-30 09:01:52 +0200388 reshape_op = Operation(Op.Reshape, "{}{}_reshape".format(op.name, idx))
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100389 reshape_op.attrs["new_shape"] = desired_shape
390 reshape_op.inputs = [inp, new_shape_tens]
391 reshape_op.set_output_tensor(reshape_out)
Tim Halle6ccd872020-11-09 16:46:37 +0000392 DebugDatabase.add_optimised(op, reshape_op)
Tim Hall79d07d22020-04-27 18:20:16 +0100393
394 op.inputs[idx] = reshape_out
395
Louis Verhaardaee5d752020-09-30 09:01:52 +0200396 op.type = Op.PackReshaped
Tim Hall79d07d22020-04-27 18:20:16 +0100397
398 return op
399
400
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200401def unfuse_activation_function(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200402 if op.type == Op.ConcatTFLite and op.run_on_npu and op.activation is not None:
Louis Verhaarde8a5a782020-11-02 18:04:27 +0100403 act_op = Operation(op.activation.op_type, op.name + op.activation.op_type.name)
Louis Verhaardaee5d752020-09-30 09:01:52 +0200404 op.activation = None
Fredrik Svedberg0f98b362020-09-29 10:00:39 +0200405 out_tens = op.outputs[0]
406 intermediate_tens = out_tens.clone("_act_intermediate")
407 act_op.set_output_tensor(out_tens)
408 act_op.add_input_tensor(intermediate_tens)
409 op.set_output_tensor(intermediate_tens)
410
411 return op
412
Louis Verhaard8912c532020-09-30 12:11:49 +0200413
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100414def fixup_stridedslice_output(tens, arch, nng):
415 op = tens.ops[0]
Dwight Lidman73320a42020-11-05 10:34:41 +0100416 if op.run_on_npu and op.type == Op.StridedSlice:
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100417 reshape_input_shape = tens.shape
418 new_axis_mask = op.attrs["new_axis_mask"]
419 shrink_axis_mask = op.attrs["shrink_axis_mask"]
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100420
Dwight Lidman73320a42020-11-05 10:34:41 +0100421 if shrink_axis_mask != 0:
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100422 n = 0
423 axis = 0
424 while shrink_axis_mask:
425 prev_mask = shrink_axis_mask
426 n += 1
427 shrink_axis_mask &= shrink_axis_mask - 1
428 axis = int(math.log2(prev_mask - shrink_axis_mask))
429 reshape_input_shape = reshape_input_shape[:axis] + [1] + reshape_input_shape[axis:]
430
431 assert len(tens.shape) == (len(op.inputs[0].shape) - n)
432 op.attrs["shrink_axis_mask"] = 0
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100433 elif new_axis_mask != 0:
434 n = 0
435 axis = 0
436 while new_axis_mask:
437 prev_mask = new_axis_mask
438 n += 1
439 new_axis_mask &= new_axis_mask - 1
440 axis = int(math.log2(prev_mask - new_axis_mask))
441 reshape_input_shape = reshape_input_shape[:axis] + reshape_input_shape[(axis + 1) :]
442 new_axis_mask >>= 1
443
444 assert len(tens.shape) == (len(op.inputs[0].shape) + n)
445 op.attrs["new_axis_mask"] = 0
Dwight Lidmandda21af2020-11-11 15:44:57 +0100446 else:
447 # Equal Rank StridedSlice, no need to insert reshape
448 return tens
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100449
450 # Construct 1 shape tensor to be used by all inserted reshape ops
451 new_shape_tens = create_const_tensor(op.name + "_reshape_shape", [1], DataType.int32, tens.shape)
452
453 for idx, out_tens in enumerate(op.outputs):
454 reshape_in = out_tens.clone("_reshaped")
455 reshape_in.set_all_shapes(reshape_input_shape)
456 reshape_in.ops = [op]
457
458 reshape_op = Operation(Op.Reshape, "{}{}_reshape".format(op.name, idx))
459 reshape_op.attrs["new_shape"] = reshape_input_shape
460 reshape_op.inputs = [reshape_in, new_shape_tens]
461 reshape_op.set_output_tensor(out_tens)
462
463 op.outputs[idx] = reshape_in
464
465 return tens
466
467
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200468def fixup_unpack_output(tens, arch, nng):
Tim Hall79d07d22020-04-27 18:20:16 +0100469 op = tens.ops[0]
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100470 if op.run_on_npu and op.type == Op.Unpack:
Tim Hall79d07d22020-04-27 18:20:16 +0100471 # Unpack is also referred to as Unstack
472 # Requires the rewrite_split function to be called on the op afterwards
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100473 axis = int(op.attrs["axis"])
474 op.type = Op.UnpackReshaped
475 reshape_input_shape = tens.shape[:axis] + [1] + tens.shape[axis:]
Tim Hall79d07d22020-04-27 18:20:16 +0100476
477 # Construct 1 shape tensor to be used by all inserted reshape ops
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100478 new_shape_tens = create_const_tensor(op.name + "_reshape_shape", [1], DataType.int32, tens.shape)
Tim Hall79d07d22020-04-27 18:20:16 +0100479
480 for idx, out_tens in enumerate(op.outputs):
Tim Hall79d07d22020-04-27 18:20:16 +0100481 reshape_in = out_tens.clone("_reshaped")
Michael McGeagh6a8d4242020-07-28 12:17:59 +0100482 reshape_in.set_all_shapes(reshape_input_shape)
Tim Hall79d07d22020-04-27 18:20:16 +0100483 reshape_in.ops = [op]
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100484
Louis Verhaardaee5d752020-09-30 09:01:52 +0200485 reshape_op = Operation(Op.Reshape, "{}{}_reshape".format(op.name, idx))
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100486 reshape_op.attrs["new_shape"] = reshape_input_shape
Tim Hall79d07d22020-04-27 18:20:16 +0100487 reshape_op.inputs = [reshape_in, new_shape_tens]
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100488 reshape_op.set_output_tensor(out_tens)
Tim Halle6ccd872020-11-09 16:46:37 +0000489 DebugDatabase.add_optimised(op, reshape_op)
Tim Hall79d07d22020-04-27 18:20:16 +0100490
491 op.outputs[idx] = reshape_in
492
493 return tens
494
495
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200496def add_padding_fields(op, arch, nng):
Jacob Bohlin90033f32020-08-28 15:45:44 +0200497 if op.run_on_npu:
498 if "padding" in op.attrs:
Louis Verhaardaee5d752020-09-30 09:01:52 +0200499 if op.type.is_conv2d_op() or op.type.is_depthwise_conv2d_op():
Jacob Bohlin90033f32020-08-28 15:45:44 +0200500 kernel_size = op.inputs[1].shape[:2]
501 input_shape = op.inputs[0].shape
Louis Verhaardaee5d752020-09-30 09:01:52 +0200502 elif op.type.is_pool_op() or op.type.npu_block_type == NpuBlockType.ReduceSum:
Jacob Bohlin90033f32020-08-28 15:45:44 +0200503 kernel_size = op.attrs["ksize"][1:3]
504 input_shape = op.inputs[0].shape
Jacob Bohlin90033f32020-08-28 15:45:44 +0200505 else:
Michael McGeagh7a6f8432020-12-02 15:29:22 +0000506 raise UnsupportedFeatureError(f"Unknown operation that uses padding: {optype_to_builtintype(op.type)}")
Tim Hall79d07d22020-04-27 18:20:16 +0100507
Louis Verhaardaee5d752020-09-30 09:01:52 +0200508 if op.type == Op.Conv2DBackpropInputSwitchedBias:
Jacob Bohlin90033f32020-08-28 15:45:44 +0200509 upscaling_factor = op.outputs[0].shape[1] // input_shape[1]
510 padding, skirt = calc_upscaled_padding_and_skirt(
511 op.attrs["padding"], kernel_size, op.attrs["strides"], input_shape, upscaling_factor
512 )
513 else:
514 dilation_h, dilation_w = op.get_dilation_h_w()
515 dilated_kernel_size = [dilation_h * (kernel_size[0] - 1) + 1, dilation_w * (kernel_size[1] - 1) + 1]
516 padding, skirt = calc_padding_and_skirt(
517 op.attrs["padding"], dilated_kernel_size, op.attrs["strides"], input_shape
518 )
Jacob Bohlincf7da102020-05-20 09:03:40 +0200519
Jacob Bohlin90033f32020-08-28 15:45:44 +0200520 op.attrs["explicit_padding"] = padding
521 op.attrs["skirt"] = skirt
Jacob Bohlincf7da102020-05-20 09:03:40 +0200522
Tim Hall79d07d22020-04-27 18:20:16 +0100523 return op
524
525
Tim Hall79d07d22020-04-27 18:20:16 +0100526# Check if the op can be reordered
527def get_prepend_op(op):
528 inp = op.inputs[0]
529 # The op should be reordered between prev_op and prep_op
530 prev_op = inp.ops[-1]
531 prep_op = None
532 while prev_op.type in memory_only_ops and len(prev_op.outputs) == 1 and len(prev_op.outputs[0].consumers()) == 1:
533 prep_op = prev_op
534 inp = prev_op.inputs[0]
535 prev_op = inp.ops[-1]
Diego Russoea6111a2020-04-14 18:41:58 +0100536 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 +0100537 return prep_op
538
539 return None
540
541
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200542def convert_depthwise_to_conv(op, arch, nng):
Tim Hall79d07d22020-04-27 18:20:16 +0100543 # Depthwise is equivalent to a single conv2d if the ifm depth is 1 and
544 # the ofm depth equals the depth multipler.
545 # If those conditions are true, then we can perform a simple
546 # switch of the operator type (and weight order)
547
Louis Verhaardaee5d752020-09-30 09:01:52 +0200548 if op.type == Op.DepthwiseConv2DBias and (op.attrs["depth_multiplier"] != 1):
Tim Hall79d07d22020-04-27 18:20:16 +0100549 ifm_tensor = op.inputs[0]
550 weight_tensor = op.inputs[1]
551 ofm_tensor = op.outputs[0]
552 if (ifm_tensor.shape[3] == 1) and (ofm_tensor.shape[3] == op.attrs["depth_multiplier"]):
553 # Change op type to Conv2d
Louis Verhaardaee5d752020-09-30 09:01:52 +0200554 op.type = Op.Conv2DBias
Tim Hall79d07d22020-04-27 18:20:16 +0100555 del op.attrs["channel_multiplier"]
556 del op.attrs["depth_multiplier"]
557
558 weight_tensor.quant_values = np.transpose(weight_tensor.quant_values, (0, 1, 3, 2))
Michael McGeagh6a8d4242020-07-28 12:17:59 +0100559 weight_tensor.set_all_shapes(list(weight_tensor.quant_values.shape))
Tim Hall79d07d22020-04-27 18:20:16 +0100560 else:
Louis Verhaard7db78962020-05-25 15:05:26 +0200561 raise UnsupportedFeatureError(
Michael McGeagh7a6f8432020-12-02 15:29:22 +0000562 f"Unsupported 'DEPTHWISE_CONV_2D' with depth_multiplier = {op.attrs['depth_multiplier']},",
563 f" ifm channels = {ifm_tensor.shape[3]}, ofm channels = {ofm_tensor.shape[3]}",
Tim Hall79d07d22020-04-27 18:20:16 +0100564 )
Tim Halle6ccd872020-11-09 16:46:37 +0000565 DebugDatabase.add_optimised(op, op)
Tim Hall79d07d22020-04-27 18:20:16 +0100566 return op
567
568
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200569def reorder_depthwise_weights(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200570 if op.type.is_depthwise_conv2d_op():
Jacob Bohline843d332020-06-23 12:12:56 +0200571 weight_tensor = op.inputs[1]
572 weight_tensor.quant_values = np.transpose(weight_tensor.quant_values, (0, 1, 3, 2))
Michael McGeagh6a8d4242020-07-28 12:17:59 +0100573 weight_tensor.set_all_shapes(list(weight_tensor.quant_values.shape))
Jacob Bohline843d332020-06-23 12:12:56 +0200574 weight_tensor.weight_transpose_depthwise = True
575
576 return op
577
578
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200579def convert_conv_to_fc(op, arch, nng):
Michael McGeagh8d939c02020-07-29 13:11:43 +0100580 # Conv 1x1 can be equivalent to Fully Connected.
581 # By representing certain convs as fully connected layers, Vela can better determine wether or not to use
582 # caching/double buffering for the weights.
583 # (Weights dont need to be reloaded for convs when IFM H and W are 1)
Louis Verhaardaee5d752020-09-30 09:01:52 +0200584 if op.type == Op.Conv2DBias:
Michael McGeagh8d939c02020-07-29 13:11:43 +0100585 _, h, w, _ = op.inputs[0].shape
586 kh, kw, _, _ = op.inputs[1].shape
587 if h == 1 and w == 1 and kh == 1 and kw == 1:
588 # Overwrite this op as a Fully Connected Op
589 op.name += "_fc"
Louis Verhaardaee5d752020-09-30 09:01:52 +0200590 op.type = Op.FullyConnected
Michael McGeagh8d939c02020-07-29 13:11:43 +0100591 op.attrs = {
Michael McGeagh8d939c02020-07-29 13:11:43 +0100592 "weights_format": 0,
Michael McGeagh8d939c02020-07-29 13:11:43 +0100593 }
594 # Reshape Weights to be 2D. HWIO becomes just IO (as H and W are 1, they can just be dropped)
595 weight_tensor = op.inputs[1]
596 weight_tensor.quant_values = weight_tensor.quant_values.squeeze(axis=(0, 1))
597 weight_tensor.set_all_shapes(list(weight_tensor.quant_values.shape))
598 # The output from a fully connected is expected to be 2D so we need to add a reshape layer to convert it
599 # back to 4D afterwards as the next layer is expecting that shape
600 orig_ofm_tensor = op.outputs[0]
601 # Reshape this ops output to be 2D: {(N*H*W), C} (We know N H and W are all 1 so this becomes {1, C})
602 fc_ofm_tensor = orig_ofm_tensor.clone("_fc")
603 fc_ofm_tensor.set_all_shapes([1, fc_ofm_tensor.shape[-1]])
604 fc_ofm_tensor.ops = [op]
605 # Add a reshape after the new OFM to convert it back to the original 4D shape
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100606 reshape_name = op.name + "_reshape"
607 new_shape_tens = create_const_tensor(reshape_name + "_shape", [1], DataType.int32, orig_ofm_tensor.shape)
Louis Verhaardaee5d752020-09-30 09:01:52 +0200608 reshape_op = Operation(Op.Reshape, reshape_name)
Michael McGeagh8d939c02020-07-29 13:11:43 +0100609 reshape_op.attrs["new_shape"] = orig_ofm_tensor.shape
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100610 reshape_op.inputs = [fc_ofm_tensor, new_shape_tens]
611 reshape_op.set_output_tensor(orig_ofm_tensor)
Michael McGeagh8d939c02020-07-29 13:11:43 +0100612 # Replace this ops OFM to point to the 2D tensor
613 op.outputs[0] = fc_ofm_tensor
Tim Halle6ccd872020-11-09 16:46:37 +0000614 # Record optimisation in debug database
615 DebugDatabase.add_optimised(op, reshape_op)
616 DebugDatabase.add_optimised(op, op)
Michael McGeagh8d939c02020-07-29 13:11:43 +0100617 return op
618
619
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200620def fixup_relus_with_differing_ifm_ofm_scaling(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200621 if op.run_on_npu and op.type.is_relu_op():
Michael McGeagh8dbf8cf2020-09-08 11:09:48 +0100622 ifm = op.inputs[0]
623 ofm = op.outputs[0]
624 # Relu with differing IFM and OFM scaling cannot be fused with another primary op
625 # and requires its own to be inserted
Tim Hall93582962020-09-09 21:58:15 +0100626 if not check_quantized_tens_scaling_equal(ifm, ofm):
Michael McGeagh8dbf8cf2020-09-08 11:09:48 +0100627 # Override this op with its own primary op (avgpool)
628 relu_fused_op = create_avgpool_nop(op.name + "_avgpool")
629 # And fuse the original activation function to it
Louis Verhaarde8a5a782020-11-02 18:04:27 +0100630 relu_fused_op.activation = create_activation_function(op.type)
Michael McGeagh8dbf8cf2020-09-08 11:09:48 +0100631 # Tidy up and assign the ifm and ofm to the new op
632 ifm.consumer_list.remove(op)
Andreas Nevalainenf3d737e2020-09-25 14:12:43 +0200633
634 # if not 4d, reshape ifm/ofm
635 if len(ifm.shape) < 4:
636 ifm_shaped = create_reshape_tensor(ifm, full_shape(4, ifm.shape, 1))
637 ifm = ifm_shaped
638 if len(ofm.shape) < 4:
639 ofm_shaped = create_reshape_tensor(ofm, full_shape(4, ofm.shape, 1), False)
640 ofm = ofm_shaped
641
Michael McGeagh8dbf8cf2020-09-08 11:09:48 +0100642 relu_fused_op.add_input_tensor(ifm)
643 relu_fused_op.set_output_tensor(ofm)
644 op = relu_fused_op
645 return op
646
647
Tim Hall79d07d22020-04-27 18:20:16 +0100648# Reorder activation op if it's after the memory only operations
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200649def fixup_act_reorder(op, arch, nng):
Michael McGeaghf3e3ad72020-12-02 12:39:03 +0000650 if op.type.is_relu_op() or op.type in (Op.Sigmoid, Op.Tanh):
Tim Hall79d07d22020-04-27 18:20:16 +0100651 prep_op = get_prepend_op(op)
Diego Russoea6111a2020-04-14 18:41:58 +0100652 if prep_op is not None:
Tim Hall79d07d22020-04-27 18:20:16 +0100653 act_op = op.clone("_reordered")
Patrik Gustavssoncb337042020-09-16 14:55:40 +0200654
655 # There is only one input tensor, overwrite it
656 act_op.set_input_tensor(prep_op.inputs[0], 0)
657
Tim Hall79d07d22020-04-27 18:20:16 +0100658 act_op_out = act_op.inputs[0].clone("_acted")
659 act_op_out.quantization = op.outputs[0].quantization.clone()
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100660 act_op.set_output_tensor(act_op_out)
Patrik Gustavssoncb337042020-09-16 14:55:40 +0200661
662 # Update the consumer list
663 act_op_out.consumer_list = op.outputs[0].consumer_list.copy()
664 act_op_out.consumer_list.append(prep_op)
665
Tim Hall79d07d22020-04-27 18:20:16 +0100666 prep_op.inputs[0] = act_op_out
667 prep_op.outputs[0].quantization = act_op_out.quantization.clone()
668
669 # Mark the op so that it will be removed as passthrough later on
Louis Verhaardaee5d752020-09-30 09:01:52 +0200670 op.type = Op.Identity
Tim Halle6ccd872020-11-09 16:46:37 +0000671
672 # Record optimisation in debug database
673 DebugDatabase.add_optimised(op, act_op)
674 DebugDatabase.add_optimised(op, op)
Tim Hall79d07d22020-04-27 18:20:16 +0100675 return op
676
Louis Verhaarde0ef2732020-06-03 08:56:44 +0200677
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200678def fixup_elementwise_with_scalars(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200679 if op.type.is_binary_elementwise_op():
Louis Verhaarde0ef2732020-06-03 08:56:44 +0200680 ifm_tensor, ifm2_tensor, _, _ = op.get_ifm_ifm2_weights_ofm()
Charles Xu78792222020-05-13 10:15:26 +0200681 if ifm2_tensor.shape != [] and ifm_tensor.shape != []:
682 diff = len(ifm_tensor.shape) - len(ifm2_tensor.shape)
683 if diff > 0:
684 ifm2_tensor.shape = full_shape(len(ifm_tensor.shape), ifm2_tensor.shape, 1)
685 elif diff < 0:
686 ifm_tensor.shape = full_shape(len(ifm2_tensor.shape), ifm_tensor.shape, 1)
Louis Verhaarde0ef2732020-06-03 08:56:44 +0200687 elif ifm_tensor.shape == [] and ifm_tensor.quant_values is None:
688 # IFM is marked as a scalar, but is a result of an operation; change it to a shape of size 1
689 ifm_tensor.shape = len(ifm2_tensor.shape) * [1]
690 ifm_tensor.storage_shape = ifm_tensor.shape
691 elif ifm2_tensor.shape == [] and ifm2_tensor.quant_values is None:
692 # IFM2 is marked as a scalar, but is a result of an operation; change it to a shape of size 1
693 ifm2_tensor.shape = len(ifm_tensor.shape) * [1]
694 ifm2_tensor.storage_shape = ifm2_tensor.shape
Charles Xu78792222020-05-13 10:15:26 +0200695 return op
Tim Hall79d07d22020-04-27 18:20:16 +0100696
Louis Verhaarde0ef2732020-06-03 08:56:44 +0200697
Tim Hall4e127762020-05-15 16:05:49 +0100698# Set input/output tensor equivalence to the same id for memory operations
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200699def set_tensor_equivalence(op, arch, nng):
Michael McGeagh11b0bdb2020-09-08 11:07:35 +0100700 if op.type in memory_only_ops:
Tim Hall4e127762020-05-15 16:05:49 +0100701 eid = op.outputs[0].equivalence_id
702 for inp in op.inputs:
703 inp.equivalence_id = eid
704 return op
705
706
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200707def convert_softmax(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200708 if op.type == Op.Softmax and op.run_on_npu:
Fredrik Svedberga0c36242020-06-03 15:43:31 +0200709 softmax = SoftMax(op)
710 op = softmax.get_graph()
711 return op
712
713
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200714def convert_mul_max_to_abs_or_lrelu(op, arch, nng):
Diego Russoea6111a2020-04-14 18:41:58 +0100715 r"""Whenever there is a subgraph with this topology:
Tim Hall79d07d22020-04-27 18:20:16 +0100716
717 Input X For X = -1 or X > 0
718 | \ / This subgraph can be replaced with either
719 | Mul an Abs (if X = -1) or a LeakyReLU (if X > 0)
720 | /
721 Max
722 """
723
Louis Verhaardaee5d752020-09-30 09:01:52 +0200724 if op.type == Op.Maximum:
Tim Hall79d07d22020-04-27 18:20:16 +0100725 # finds the Mul input(s) to the Max
Louis Verhaardaee5d752020-09-30 09:01:52 +0200726 muls = [i for i in op.inputs if i.ops[0].type == Op.Mul]
Tim Hall79d07d22020-04-27 18:20:16 +0100727 if len(muls) == 1:
728 mul = muls[0].ops[0]
729 elif len(muls) == 2:
730 # In the case both inputs are Muls, find the one with the same input as the Max
731 mul = [m for m in muls if len(set(op.inputs + m.ops[0].inputs)) == 1][0].ops[0]
732 else:
733 # No Mul inputs
734 return op
735
736 # make sure the Mul doesn't have any other consumers
Louis Verhaardd7911c42020-08-25 13:36:41 +0200737 mul_ofm = mul.outputs[0]
738 if len(mul_ofm.consumers()) != 1:
Tim Hall79d07d22020-04-27 18:20:16 +0100739 return op
Louis Verhaardaee5d752020-09-30 09:01:52 +0200740 # make sure the Mul doesn't have a fused activation function
741 if mul.activation:
Tim Hall79d07d22020-04-27 18:20:16 +0100742 return op
Louis Verhaardaee5d752020-09-30 09:01:52 +0200743 ifm, ofm = op.get_ifm_ofm()
Tim Hall93582962020-09-09 21:58:15 +0100744 if ifm is None or ofm is None:
745 return op
746
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200747 if ifm.dtype not in (DataType.uint8, DataType.int8) or ifm.dtype != ofm.dtype:
748 return op
Tim Hall93582962020-09-09 21:58:15 +0100749 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 +0200750 # rewrite to LeakyRelu currently only makes sense if the quantization is identical
751 return op
Tim Hall79d07d22020-04-27 18:20:16 +0100752
753 # finds the branched input that goes to both the Max and the Mul
754 shared = set(op.inputs) & set(mul.inputs)
755 if len(shared) == 1:
756 shared_in = shared.pop()
757 # find the constant scalar input to the Mul
758 const_tens = (set(mul.inputs) - {shared_in}).pop()
759 # check that it is a scalar
760 if const_tens.shape != []:
761 return op
762 const = const_tens.ops[0]
763 # check that it is a constant
Louis Verhaardaee5d752020-09-30 09:01:52 +0200764 if const.type != Op.Const:
Tim Hall79d07d22020-04-27 18:20:16 +0100765 return op
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200766 # Remove the Mul from the shared input's consumers
767 shared_in.consumer_list.remove(mul)
Tim Hall79d07d22020-04-27 18:20:16 +0100768 else:
769 return op
770
771 val = const.outputs[0].values
772 if val >= 0:
Louis Verhaardaee5d752020-09-30 09:01:52 +0200773 new_op = Op.LeakyRelu
Tim Hall79d07d22020-04-27 18:20:16 +0100774 op.attrs["alpha"] = val
Louis Verhaardd7911c42020-08-25 13:36:41 +0200775 # to produce bit exact results, the alpha is not enough;
776 # save additional scaling info in attr "alpha_scale", to be used as input
777 # to the LUT construction
778 alpha_scalar = const_tens.quant_values - const_tens.quantization.zero_point
779 mul_ifm_scale = np.double(ifm.quantization.scale_f32)
780 mul_ifm2_scale = np.double(const_tens.quantization.scale_f32)
781 mul_ofm_scale = np.double(mul_ofm.quantization.scale_f32)
782 alpha_scale, alpha_shift = scaling.elementwise_mul_scale(mul_ifm_scale, mul_ifm2_scale, mul_ofm_scale)
783 op.attrs["alpha_scaling"] = (alpha_scalar, alpha_scale, alpha_shift)
Tim Hall79d07d22020-04-27 18:20:16 +0100784 elif val == -1:
Louis Verhaardaee5d752020-09-30 09:01:52 +0200785 new_op = Op.Abs
Tim Hall79d07d22020-04-27 18:20:16 +0100786 else:
787 return op
788
Louis Verhaardaee5d752020-09-30 09:01:52 +0200789 op.type = new_op
790 op.name = op.name.replace("Maximum", new_op.name)
791 op.outputs[0].name = op.outputs[0].name.replace("Maximum", new_op.name)
Tim Hall79d07d22020-04-27 18:20:16 +0100792 op.inputs = [shared_in]
Tim Halle6ccd872020-11-09 16:46:37 +0000793
794 # Record optimisation in debug database
795 DebugDatabase.add_optimised(op, op)
796
Tim Hall79d07d22020-04-27 18:20:16 +0100797 return op
798
799
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200800def convert_lrelu_to_mul_max(op, arch):
801 # Converts LeakyRelu to Max(alpha * IFM, identity * IFM)
802 # (the opposite of convert_mul_max_to_abs_or_lrelu)
Louis Verhaardaee5d752020-09-30 09:01:52 +0200803 ifm, ofm = op.get_ifm_ofm()
Tim Hall93582962020-09-09 21:58:15 +0100804 if ifm is None or ofm is None:
805 return op
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200806
807 # Add multiplication with alpha
Louis Verhaardaee5d752020-09-30 09:01:52 +0200808 mul_alpha = Operation(Op.Mul, op.name + "_mul_alpha")
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200809 mul_alpha.add_input_tensor(ifm)
810 # Create const tensor containing alpha as scalar
811 alpha = op.attrs["alpha"]
812 quantization = ifm.quantization.clone()
813 quantization.min = 0
814 quantization.max = alpha * (quantization.quant_max - quantization.quant_min)
815 quantization.scale_f32 = alpha
816 quantization.zero_point = 0
817 alpha_tens = create_const_tensor(op.name + "_alpha_scalar", [], ifm.dtype, [1], np.int8, quantization=quantization)
818 mul_alpha.add_input_tensor(alpha_tens)
819 fm_alpha = ofm.clone(op.name + "_alpha")
820 mul_alpha.set_output_tensor(fm_alpha)
Tim Halle6ccd872020-11-09 16:46:37 +0000821 DebugDatabase.add_optimised(op, mul_alpha)
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200822
Tim Hall93582962020-09-09 21:58:15 +0100823 if check_quantized_tens_scaling_equal(ifm, ofm):
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200824 # No identity multiplication is needed
825 fm_id = ifm
826 else:
827 # Add multiplication with identity
Louis Verhaardaee5d752020-09-30 09:01:52 +0200828 mul_identity = Operation(Op.Mul, op.name + "_mul_identity")
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200829 mul_identity.add_input_tensor(ifm)
830 # Create const tensor containing identity as scalar
831 quantization = ifm.quantization.clone()
832 quantization.min = 0
833 quantization.max = quantization.quant_max - quantization.quant_min
834 quantization.scale_f32 = 1
835 quantization.zero_point = 0
836 identity_tens = create_const_tensor(
837 op.name + "_id_scalar", [], ifm.dtype, [1], np.uint8, quantization=quantization
838 )
839 mul_identity.add_input_tensor(identity_tens)
840 fm_id = ofm.clone(op.name + "_id")
841 mul_identity.set_output_tensor(fm_id)
Tim Halle6ccd872020-11-09 16:46:37 +0000842 DebugDatabase.add_optimised(op, mul_alpha)
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200843
844 # Convert LeakyRelu to Max, add the results of the multiplication(s) as inputs
Louis Verhaardaee5d752020-09-30 09:01:52 +0200845 op.type = Op.Maximum
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200846 op.name = op.name.replace("LeakyRelu", "Maximum")
847 op.inputs = []
848 ifm.consumer_list.remove(op)
849 op.add_input_tensor(fm_alpha)
850 op.add_input_tensor(fm_id)
Tim Halle6ccd872020-11-09 16:46:37 +0000851
852 DebugDatabase.add_optimised(op, op)
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200853 return op
854
855
Louis Verhaard2e186c72020-10-09 10:47:04 +0200856def convert_to_lut(op, lut_values, lut_name):
Louis Verhaardf03bad32020-09-25 08:30:44 +0200857 # Rewrite the operation by Add with scalar 0 + LUT activation
858 ifm = op.inputs[0]
Tim Hall93582962020-09-09 21:58:15 +0100859 if ifm is None:
860 return op
Louis Verhaard58520b92020-08-24 16:45:38 +0200861 assert ifm.dtype.size_in_bytes() == 1
Louis Verhaardaee5d752020-09-30 09:01:52 +0200862 op.type = Op.Add
Louis Verhaard2e186c72020-10-09 10:47:04 +0200863 op.name = op.name + "_lut_" + lut_name
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200864 # Mark as no-op to enable potential fusing optimizations
865 op.attrs["is_nop"] = True
866 # Create an input tensor containing scalar zero
867 quantization = QuantizationParameters(0.0, 255.0)
Louis Verhaardd7911c42020-08-25 13:36:41 +0200868 quantization.scale_f32 = ifm.quantization.scale_f32
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200869 quantization.zero_point = 0
Louis Verhaard2e186c72020-10-09 10:47:04 +0200870 tens = create_const_tensor(op.inputs[0].name + "_scalar0", [], ifm.dtype, [0], np.uint8, quantization=quantization)
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200871 op.add_input_tensor(tens)
Louis Verhaardf03bad32020-09-25 08:30:44 +0200872 # The LUT must be applied without any preceding rescaling (the LUT itself performs the rescale),
873 # so even if the OFM has a different scale than the IFM, the generated OFM scale instructions
874 # should be the same as the IFM
Louis Verhaardaee5d752020-09-30 09:01:52 +0200875 op.forced_output_quantization = ifm.quantization
Louis Verhaard2e186c72020-10-09 10:47:04 +0200876 lut_tensor = lut.create_lut_tensor(op.name + "_values", lut_values, DataType.int8)
Louis Verhaardf03bad32020-09-25 08:30:44 +0200877 op.set_activation_lut(lut_tensor)
878 return op
879
880
Louis Verhaard2e186c72020-10-09 10:47:04 +0200881def convert_to_lut8(op, fn, fn_name):
Louis Verhaardf03bad32020-09-25 08:30:44 +0200882 # Converts op to a no-op + int8/uint8 LUT which is generated with the given function.
883 # fn is a function(real) -> real
Louis Verhaardaee5d752020-09-30 09:01:52 +0200884 ifm, ofm = op.get_ifm_ofm()
Louis Verhaardf03bad32020-09-25 08:30:44 +0200885 if ifm.dtype not in (DataType.uint8, DataType.int8) or ifm.dtype != ofm.dtype:
886 return op
887 # Generate the LUT
888 ifm_scale = np.double(ifm.quantization.scale_f32)
889 ofm_scale = np.double(ofm.quantization.scale_f32)
890 zp_in = ifm.quantization.zero_point
891 zp_out = ofm.quantization.zero_point
892 values = []
893 ix = range(256) if ifm.dtype == DataType.uint8 else range(-128, 128)
894 quantized_min = min(ix)
895 quantized_max = max(ix)
896 for x in ix:
897 x_real = ifm_scale * (x - zp_in)
898 y_real = fn(x_real)
899 lut_result = round_away_zero(zp_out + y_real / ofm_scale)
900 lut_result = min(quantized_max, max(quantized_min, lut_result))
901 values.append(lut_result)
Louis Verhaard2e186c72020-10-09 10:47:04 +0200902 return convert_to_lut(op, values, fn_name)
Louis Verhaardf03bad32020-09-25 08:30:44 +0200903
904
905def convert_lrelu_to_lut(op, arch):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200906 ifm, ofm = op.get_ifm_ofm()
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200907 # Generate the LUT
Louis Verhaardd7911c42020-08-25 13:36:41 +0200908 alpha = op.attrs["alpha"]
909 ifm_scale = np.double(ifm.quantization.scale_f32)
910 ofm_scale = np.double(ofm.quantization.scale_f32)
911 zp_in = ifm.quantization.zero_point
912 zp_out = ofm.quantization.zero_point
913 identity_scale, identity_shift = scaling.elementwise_mul_scale(ifm_scale, 1, ofm_scale)
914 alpha_scalar = 1
915 alpha_scale, alpha_shift = scaling.elementwise_mul_scale(ifm_scale, alpha, ofm_scale)
916 if "alpha_scaling" in op.attrs:
917 # The LeakyRelu was the result from convert_mul_max_to_abs_or_lrelu
918 alpha_scalar, alpha_scale, alpha_shift = op.attrs["alpha_scaling"]
919 values = []
Louis Verhaard58520b92020-08-24 16:45:38 +0200920 ix = range(256) if ifm.dtype == DataType.uint8 else range(-128, 128)
Louis Verhaardd7911c42020-08-25 13:36:41 +0200921 quantized_min = min(ix)
922 quantized_max = max(ix)
923 for x in ix:
924 if x < zp_in:
925 lut_result = zp_out + fp_math.multiply_by_quantized_multiplier(
926 alpha_scalar * (x - zp_in), alpha_scale, alpha_shift
927 )
928 else:
929 lut_result = zp_out + fp_math.multiply_by_quantized_multiplier(x - zp_in, identity_scale, identity_shift)
930 lut_result = min(quantized_max, max(quantized_min, lut_result))
931 values.append(lut_result)
Louis Verhaard2e186c72020-10-09 10:47:04 +0200932 return convert_to_lut(op, values, "lrelu")
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200933
934
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200935def convert_lrelu(op, arch, nng):
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200936 # Converts LeakyRelu to a LUT based solution if possible, otherwise a mul + max
Louis Verhaardaee5d752020-09-30 09:01:52 +0200937 if op.type != Op.LeakyRelu:
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200938 return op
Louis Verhaardaee5d752020-09-30 09:01:52 +0200939 ifm, ofm = op.get_ifm_ofm()
Tim Hall93582962020-09-09 21:58:15 +0100940 if ifm is None or ofm is None:
941 return op
Louis Verhaardd7911c42020-08-25 13:36:41 +0200942 if ifm.dtype in (DataType.uint8, DataType.int8) and ifm.dtype == ofm.dtype:
943 # use LUT for int8/uint8
944 return convert_lrelu_to_lut(op, arch)
Tim Hall93582962020-09-09 21:58:15 +0100945 if check_quantized_tens_scaling_equal(ifm, ofm) and ifm.dtype == ofm.dtype == DataType.int16:
Louis Verhaardd7911c42020-08-25 13:36:41 +0200946 # use LeakyRelu unmodified for int16 with equal input/output scaling
947 return op
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200948 return convert_lrelu_to_mul_max(op, arch)
949
950
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200951def convert_tanh_sigmoid_to_lut(op, arch, nng):
Louis Verhaardf03bad32020-09-25 08:30:44 +0200952 # Converts int8/uint8 Sigmoid and Tanh to a LUT based solution
Louis Verhaardaee5d752020-09-30 09:01:52 +0200953 if op.type == Op.Sigmoid:
Louis Verhaard2e186c72020-10-09 10:47:04 +0200954 return convert_to_lut8(op, clamp_sigmoid, "sigmoid")
Louis Verhaardaee5d752020-09-30 09:01:52 +0200955 elif op.type == Op.Tanh:
Louis Verhaard2e186c72020-10-09 10:47:04 +0200956 return convert_to_lut8(op, math.tanh, "tanh")
Louis Verhaardf03bad32020-09-25 08:30:44 +0200957 return op
958
959
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200960def remove_unwanted_reshapes(op, arch, nng):
Patrik Gustavssonfa4cb292020-09-10 08:19:36 +0200961 # Try to remove reshapes enclosing ElementWise operator with only one non-constant input
Louis Verhaardaee5d752020-09-30 09:01:52 +0200962 if not op.run_on_npu or not op.type.is_elementwise_op():
Patrik Gustavssonfa4cb292020-09-10 08:19:36 +0200963 return op
964
965 # Check if the ElementWise operator only have one non-constant input
Louis Verhaardaee5d752020-09-30 09:01:52 +0200966 non_const_tens = [x for x in op.inputs if x.ops[0].type != Op.Const]
Patrik Gustavssonfa4cb292020-09-10 08:19:36 +0200967 if len(non_const_tens) != 1:
968 return op
969 ifm = non_const_tens[0]
970
971 # Check if operation is enclosed by Reshapes that can be removed
972 ofm = op.outputs[0]
973 prev_op = ifm.ops[0]
974 if (
975 len(ifm.consumer_list) == 1
Louis Verhaardaee5d752020-09-30 09:01:52 +0200976 and prev_op.type == Op.Reshape
Patrik Gustavssonfa4cb292020-09-10 08:19:36 +0200977 and len(ofm.consumer_list) == 1
Louis Verhaardaee5d752020-09-30 09:01:52 +0200978 and ofm.consumer_list[0].type == Op.Reshape
Patrik Gustavssonfa4cb292020-09-10 08:19:36 +0200979 ):
980 # Operation is enclosed by reshapes, check if they can be removed
Louis Verhaardaee5d752020-09-30 09:01:52 +0200981 prev_op_ifm, prev_op_ofm = prev_op.get_ifm_ofm()
Patrik Gustavssonfa4cb292020-09-10 08:19:36 +0200982 cons_op = ofm.consumer_list[0]
983 cons_op_ifm = ofm
984 cons_op_ofm = cons_op.outputs[0]
985 if len(prev_op_ifm.shape) == len(cons_op_ofm.shape):
986 # Check if quantization is the same in the input and output for the reshape ops
Tim Hall93582962020-09-09 21:58:15 +0100987 if check_quantized_tens_scaling_equal(prev_op_ifm, prev_op_ofm) and check_quantized_tens_scaling_equal(
988 cons_op_ifm, cons_op_ofm
989 ):
Patrik Gustavsson7ad862a2020-09-29 14:09:43 +0200990 op.set_input_tensor(prev_op_ifm, 0)
991 op.set_output_tensor(cons_op_ofm)
Patrik Gustavssonfa4cb292020-09-10 08:19:36 +0200992 return op
993
994
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200995def fuse_activation_function_with_prev(op, arch, nng):
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200996 # if op is a no-op: attempts to move the activation function to the preceding op
Louis Verhaardaee5d752020-09-30 09:01:52 +0200997 if not op.attrs.get("is_nop", False) or op.activation is None:
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200998 return op
Louis Verhaardaee5d752020-09-30 09:01:52 +0200999 ifm, ofm = op.get_ifm_ofm()
Tim Hall93582962020-09-09 21:58:15 +01001000 if ifm is None or ofm is None:
1001 return op
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001002 # finds the input(s) to the operation
1003 prev_op = ifm.ops[0]
1004 # Note: the below checks on prev_op require that a first optimize pass on the full graph has been performed
1005 fuse = (
1006 prev_op.run_on_npu
Louis Verhaardaee5d752020-09-30 09:01:52 +02001007 and prev_op.type.npu_block_type != NpuBlockType.Default
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001008 and len(ifm.ops) == 1
1009 and len(prev_op.outputs[0].consumers()) == 1
Louis Verhaardaee5d752020-09-30 09:01:52 +02001010 and prev_op.activation is None
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001011 )
1012 if op.activation_lut is not None and arch.shram_reserved_unused_banks == 0:
1013 # TODO: if SHRAM LUT space is shared with SHRAM ACC (32, 64 MAC),
1014 # LUT currently only works correctly for elementwise ops
1015 fuse = False
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001016 if not fuse:
1017 return op
1018 # Move the fused activation function + corresponding info to prev_op
Louis Verhaardaee5d752020-09-30 09:01:52 +02001019 prev_op.activation = op.activation
1020 prev_op.forced_output_quantization = op.forced_output_quantization
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001021 if op.activation_lut is not None:
1022 prev_op.set_activation_lut(op.activation_lut)
1023 # Bypass op
Louis Verhaard98a34992020-09-01 10:39:04 +02001024 prev_op.set_output_tensor(ofm)
Tim Halle6ccd872020-11-09 16:46:37 +00001025 DebugDatabase.add_optimised(op, prev_op)
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001026 return op
1027
1028
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +02001029def add_attrs_to_resizebilinear(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +02001030 if op.type == Op.ResizeBilinear and op.run_on_npu:
Dwight Lidman42fed942020-05-29 09:37:03 +02001031 input_tensor = op.inputs[0]
1032 upscaled_shape = [input_tensor.shape[1] * 2, input_tensor.shape[2] * 2]
1033 out_shape = op.outputs[0].shape[1:3]
1034 if not op.attrs["align_corners"] and out_shape == upscaled_shape:
1035 # this means the output is supposed to be a x2 upscale,
1036 # so we need to do SAME padding
Michael McGeagh16895482020-12-14 15:51:20 +00001037 op.attrs["padding"] = Padding.SAME
Dwight Lidman42fed942020-05-29 09:37:03 +02001038 elif op.attrs["align_corners"] and out_shape == [upscaled_shape[0] - 1, upscaled_shape[1] - 1]:
1039 # here we can just run the avg pool without padding and
1040 # produce a (M * 2 - 1, N * 2 - 1) sized output
Michael McGeagh16895482020-12-14 15:51:20 +00001041 op.attrs["padding"] = Padding.VALID
Dwight Lidman42fed942020-05-29 09:37:03 +02001042 else:
Charles Xu9a03fdf2020-07-02 15:12:40 +02001043 return op
Dwight Lidman42fed942020-05-29 09:37:03 +02001044 input_tensor.resampling_mode = resampling_mode.NEAREST
Tim Hallc30f4952020-06-15 20:47:35 +01001045 op.attrs.update({"strides": (1, 1, 1, 1), "ksize": (1, 2, 2, 1)})
Dwight Lidman42fed942020-05-29 09:37:03 +02001046 return op
1047
1048
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +02001049def fixup_bias_tensors(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +02001050 if op.type.needs_bias() and op.bias is None:
Jacob Bohlina41cd4d2020-08-26 18:21:28 +02001051 # Op has no bias, add bias tensor filled with zeros
1052 nr_biases = op.inputs[1].shape[-1]
1053 bias_values = [0] * nr_biases
1054 bias_tensor = create_const_tensor(op.name + "_bias", [nr_biases], DataType.int32, bias_values)
1055 bias_tensor.quant_values = bias_tensor.values
1056 op.set_input_tensor(bias_tensor, -1)
Jacob Bohlin67e0d8f2020-08-20 10:53:02 +02001057
1058 return op
1059
1060
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +02001061def supported_operator_check(op, arch, nng):
Tim Hall79d07d22020-04-27 18:20:16 +01001062 op.run_on_npu = arch.supported_operators.is_operator_supported(op)
1063 return op
1064
1065
Tim Halle6ccd872020-11-09 16:46:37 +00001066def _record_optimised(op, arch):
1067 if op.type != Op.Const:
1068 DebugDatabase.add_optimised(op, op)
1069
1070
Tim Hall79d07d22020-04-27 18:20:16 +01001071def optimise_graph_a(nng, arch, verbose_graph=False):
1072 if verbose_graph:
1073 nng.print_graph()
1074
1075 op_rewrite_list = [
Tim Hall4e127762020-05-15 16:05:49 +01001076 set_tensor_equivalence,
Tim Hall79d07d22020-04-27 18:20:16 +01001077 supported_operator_check,
1078 # then do any rewrites of supported operators
1079 convert_depthwise_to_conv,
Michael McGeagh8d939c02020-07-29 13:11:43 +01001080 convert_conv_to_fc,
Fredrik Svedberga0c36242020-06-03 15:43:31 +02001081 convert_softmax,
Tim Hall79d07d22020-04-27 18:20:16 +01001082 fixup_fully_connected_input,
Diqing Zhong94457b12020-12-09 15:22:40 +01001083 convert_batched_fc_shape,
Tim Hall79d07d22020-04-27 18:20:16 +01001084 fixup_pack_input,
Fredrik Svedberg0f98b362020-09-29 10:00:39 +02001085 unfuse_activation_function,
Tim Hall79d07d22020-04-27 18:20:16 +01001086 fixup_conv2d_backprop,
Michael McGeagh8dbf8cf2020-09-08 11:09:48 +01001087 fixup_relus_with_differing_ifm_ofm_scaling,
Tim Hall79d07d22020-04-27 18:20:16 +01001088 fixup_act_reorder,
Charles Xu78792222020-05-13 10:15:26 +02001089 fixup_elementwise_with_scalars,
Jacob Bohline843d332020-06-23 12:12:56 +02001090 reorder_depthwise_weights,
Charles Xu9a03fdf2020-07-02 15:12:40 +02001091 fixup_resizebilinear,
Jacob Bohlina41cd4d2020-08-26 18:21:28 +02001092 fixup_bias_tensors,
Dwight Lidmanc3862c22020-09-14 15:22:33 +02001093 convert_nop_split_to_identity,
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001094 convert_mul_max_to_abs_or_lrelu,
Patrik Gustavssonfa4cb292020-09-10 08:19:36 +02001095 remove_unwanted_reshapes,
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001096 convert_lrelu,
Louis Verhaardf03bad32020-09-25 08:30:44 +02001097 convert_tanh_sigmoid_to_lut,
Tim Hall79d07d22020-04-27 18:20:16 +01001098 ]
1099
1100 for idx, sg in enumerate(nng.subgraphs):
1101 # rewrite graph pass
1102 nng.subgraphs[idx] = rewrite_graph.rewrite_graph_pre_order(
Dwight Lidman73320a42020-11-05 10:34:41 +01001103 nng, sg, arch, [], op_rewrite_list, rewrite_unsupported=False,
Tim Hall79d07d22020-04-27 18:20:16 +01001104 )
1105
1106 for idx, sg in enumerate(nng.subgraphs):
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001107 # remove passthrough tensors and attempt further optimizations
1108 nng.subgraphs[idx] = rewrite_graph.rewrite_graph_pre_order(
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +02001109 nng, sg, arch, [remove_passthrough_tensor], [fuse_activation_function_with_prev, add_padding_fields]
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001110 )
Tim Hall79d07d22020-04-27 18:20:16 +01001111
Tim Halle6ccd872020-11-09 16:46:37 +00001112 # Post-optimisation operator debug tracing
1113 for sg in nng.subgraphs:
1114 rewrite_graph.visit_graph_post_order(sg.output_tensors, arch, [], [_record_optimised])
1115
Tim Hall79d07d22020-04-27 18:20:16 +01001116 if verbose_graph:
1117 nng.print_graph()
1118 return nng
1119
Diego Russoea6111a2020-04-14 18:41:58 +01001120
Tim Hall79d07d22020-04-27 18:20:16 +01001121def optimise_graph_b(nng, arch, verbose_graph=False):
1122 if verbose_graph:
1123 nng.print_graph()
1124
1125 for idx, sg in enumerate(nng.subgraphs):
1126 # combined rewrite graph pass
Dwight Lidmanc6ac1942020-10-02 14:55:45 +02001127 nng.subgraphs[idx] = rewrite_graph.rewrite_graph_pre_order(
Dwight Lidman73320a42020-11-05 10:34:41 +01001128 nng, sg, arch, [fixup_unpack_output, fixup_stridedslice_output, rewrite_concat, rewrite_split], []
Dwight Lidmanc6ac1942020-10-02 14:55:45 +02001129 )
Tim Hall79d07d22020-04-27 18:20:16 +01001130
1131 if verbose_graph:
1132 nng.print_graph()
1133 return nng