blob: 730463023e3112d70cd144974be4046b9b536e0f [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
Michael McGeagh8dbf8cf2020-09-08 11:09:48 +010034from .operation import create_avgpool_nop
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
Fredrik Svedberga0c36242020-06-03 15:43:31 +020038from .softmax import SoftMax
Tim Hall93582962020-09-09 21:58:15 +010039from .tensor import check_quantized_tens_scaling_equal
Michael McGeaghc5b549b2020-08-07 11:54:28 +010040from .tensor import create_const_tensor
41from .tensor import create_reshape_tensor
Charles Xu9a03fdf2020-07-02 15:12:40 +020042from .tensor import QuantizationParameters
Diego Russoe8a10452020-04-21 17:39:10 +010043from .tensor import Tensor
Tim Hall79d07d22020-04-27 18:20:16 +010044
Louis Verhaardaee5d752020-09-30 09:01:52 +020045passthrough_nodes = set((Op.Identity,))
Tim Hall79d07d22020-04-27 18:20:16 +010046
Louis Verhaardaee5d752020-09-30 09:01:52 +020047memory_only_ops = set((Op.Reshape,))
Michael McGeagh11b0bdb2020-09-08 11:07:35 +010048
Tim Hall79d07d22020-04-27 18:20:16 +010049
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +020050def remove_passthrough_tensor(tens, arch, nng):
Tim Hall79d07d22020-04-27 18:20:16 +010051 if len(tens.ops) == 1 and tens.ops[0].type in passthrough_nodes:
52 assert len(tens.ops[0].inputs) == 1
53 tens = tens.ops[0].inputs[0]
54 return tens
55
56
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +020057def rewrite_concat(tens, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +020058 if len(tens.ops) == 1 and tens.ops[0].type.is_concat_op():
Tim Hall79d07d22020-04-27 18:20:16 +010059 concat_op = tens.ops[0]
60 if tens != concat_op.outputs[0]:
61 return tens # don't attempt to rewrite the min/max outputs of QuantizedConcat
62
63 # Not supported so leave it and run on CPU
64 if not concat_op.run_on_npu:
65 return tens
66
67 inputs, axis = concat_op.get_concat_inputs_axis()
68
69 tens.ops = []
70 offset = 0
71 for idx, inp in enumerate(inputs):
Louis Verhaardaee5d752020-09-30 09:01:52 +020072 new_op = Operation(Op.ConcatSliceWrite, concat_op.name + str(idx))
Tim Hall79d07d22020-04-27 18:20:16 +010073 new_op.inputs = [inp]
74 new_op.outputs = [tens]
75 new_op.attrs["concat_axis"] = axis
76 new_op.attrs["concat_start"] = offset
77 offset += inp.shape[axis]
78 new_op.attrs["concat_end"] = offset
79 new_op.run_on_npu = True
80 tens.ops.append(new_op)
Tim Halle6ccd872020-11-09 16:46:37 +000081 DebugDatabase.add_optimised(concat_op, new_op)
Tim Hall79d07d22020-04-27 18:20:16 +010082 assert tens.shape[axis] == offset
83
Patrik Gustavsson29d568e2020-08-18 10:11:21 +020084 # If axis corresponds to C-dimension, NHCWB16 can only be used in the output if all the concat_start's are a
85 # multiple of 16. This as, it is only then the address offset for the ofm, for all operations, will be 16 byte
86 # 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 +020087 # and those addresses are always 16 byte aligned due to the NHCWB16 format.
Patrik Gustavsson6c97e9a2020-09-23 11:02:18 +020088 if axis == -1 or axis == (len(tens.shape) - 1):
Patrik Gustavsson458a2082020-08-13 13:41:05 +020089 for op in tens.ops:
90 if op.attrs["concat_start"] % 16 != 0:
91 tens.avoid_NHCWB16 = True
92 break
93
Tim Hall79d07d22020-04-27 18:20:16 +010094 return tens
95
96
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +020097def rewrite_split(tens, arch, nng):
Tim Hall79d07d22020-04-27 18:20:16 +010098
Louis Verhaardaee5d752020-09-30 09:01:52 +020099 if len(tens.ops) == 1 and tens.ops[0].type.is_split_op():
Tim Hall79d07d22020-04-27 18:20:16 +0100100 split_op = tens.ops[0]
101
102 # Not supported so leave it and run on CPU
103 if not split_op.run_on_npu:
104 return tens
105
106 inp, outputs, axis, offset_start, offset_end = split_op.get_split_inputs_axis()
107
108 tens.ops = []
Louis Verhaardaee5d752020-09-30 09:01:52 +0200109 new_op = Operation(Op.SplitSliceRead, split_op.name)
Tim Hall79d07d22020-04-27 18:20:16 +0100110 new_op.inputs = [inp]
Tim Hall79d07d22020-04-27 18:20:16 +0100111
112 # For Split the offset cannot be extracted from the tensor so it has to
113 # be calculated from the index of the output tensor
Diego Russoea6111a2020-04-14 18:41:58 +0100114 if axis is not None:
Tim Hall79d07d22020-04-27 18:20:16 +0100115 # Get the start and end of the split
116 offset_start = [0] * len(tens.shape)
117 offset_end = [0] * len(tens.shape)
118 for out in outputs:
119 if out == tens:
120 break
121 offset_start[axis] += out.shape[axis]
122
Patrik Gustavssoneebb1c22020-08-18 15:03:04 +0200123 # If start offset is not a multiple of 16 in the C-dimension, NHCWB16 need to be avoided in the input
124 if (offset_start[-1] % 16) != 0:
125 inp.avoid_NHCWB16 = True
126
Tim Hall79d07d22020-04-27 18:20:16 +0100127 offset_end[axis] = offset_start[axis] + tens.shape[axis]
128
129 new_op.attrs["split_start"] = offset_start
130 new_op.attrs["split_end"] = offset_end
131 new_op.run_on_npu = True
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100132 new_op.set_output_tensor(tens)
Tim Halle6ccd872020-11-09 16:46:37 +0000133 DebugDatabase.add_optimised(split_op, new_op)
Tim Hall79d07d22020-04-27 18:20:16 +0100134
135 return tens
136
137
138def needed_total_padding(input_size, stride, filter_size):
139 out_size = (input_size + stride - 1) // stride
140 needed_input = (out_size - 1) * stride + filter_size
141 total_padding = max(0, needed_input - input_size)
142 return total_padding
143
144
145def calc_padding_and_skirt(padding_type, kernel_size, stride, input_dims):
146 ypad = needed_total_padding(int(input_dims[1]), int(stride[1]), int(kernel_size[0]))
147 xpad = needed_total_padding(int(input_dims[2]), int(stride[2]), int(kernel_size[1]))
148 if padding_type == b"SAME":
149 left_pad = (xpad + 0) // 2
150 right_pad = (xpad + 1) // 2
151 top_pad = (ypad + 0) // 2
152 bottom_pad = (ypad + 1) // 2
153 elif padding_type == b"VALID":
154 left_pad = 0
155 right_pad = 0
156 top_pad = 0
157 bottom_pad = 0
158 else:
Louis Verhaard7db78962020-05-25 15:05:26 +0200159 raise UnsupportedFeatureError("Unknown padding {}".format(str(padding_type)))
Tim Hall79d07d22020-04-27 18:20:16 +0100160 padding = (top_pad, left_pad, bottom_pad, right_pad)
161 skirt = (top_pad, left_pad, ypad - top_pad, xpad - left_pad)
162 return padding, skirt
163
Tim Hallc30f4952020-06-15 20:47:35 +0100164
Jacob Bohlin9b64ba02020-07-07 17:15:22 +0200165def calc_upscaled_padding_and_skirt(padding_type, kernel_size, stride, input_dims, upscaling_factor):
166 kernel_height, kernel_width = kernel_size[0], kernel_size[1]
Jacob Bohlincf7da102020-05-20 09:03:40 +0200167 if padding_type == b"SAME":
Jacob Bohlin9b64ba02020-07-07 17:15:22 +0200168 ypad = needed_total_padding(int(input_dims[1]) * upscaling_factor, int(stride[1]), int(kernel_height))
169 xpad = needed_total_padding(int(input_dims[2]) * upscaling_factor, int(stride[2]), int(kernel_width))
170
Jacob Bohlind47cc272020-08-24 11:42:14 +0200171 right_pad = max(((xpad + 1) // upscaling_factor) - 1, 0)
172 bottom_pad = max(((ypad + 1) // upscaling_factor) - 1, 0)
Jacob Bohlin9b64ba02020-07-07 17:15:22 +0200173 left_pad = max(kernel_width - 1 - right_pad, 0)
174 top_pad = max(kernel_height - 1 - bottom_pad, 0)
175
Jacob Bohlincf7da102020-05-20 09:03:40 +0200176 elif padding_type == b"VALID":
Jacob Bohlin9b64ba02020-07-07 17:15:22 +0200177 right_pad = max(kernel_width - 2, 0)
178 bottom_pad = max(kernel_height - 2, 0)
179 left_pad = kernel_width - 1
180 top_pad = kernel_height - 1
Jacob Bohlincf7da102020-05-20 09:03:40 +0200181 else:
182 assert 0, "Unknown padding"
183
184 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
233 op.attrs["padding"] = b"VALID"
234 else:
235 shape_modifier = 0
236 op.attrs["padding"] = b"SAME"
237 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
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200319def convert_batched_fc_to_conv(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
324 if len(ifm.shape) == len(ofm.shape) == 2 and ifm.shape[0] != 1:
325 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
329 # Convert to convolution
330 op.name += "_conv"
Louis Verhaardaee5d752020-09-30 09:01:52 +0200331 op.type = Op.Conv2DBias
Patrik Gustavssoncb337042020-09-16 14:55:40 +0200332 op.attrs = {
333 "dilation": (1, 1, 1, 1),
334 "dilation_h_factor": 1,
335 "dilation_w_factor": 1,
Patrik Gustavssoncb337042020-09-16 14:55:40 +0200336 "padding": b"SAME",
337 "stride_h": 1,
338 "stride_w": 1,
339 "strides": (1, 1, 1, 1),
340 }
341
342 prev_op = ifm.ops[0]
343 desired_shape = [1, h, w, ifm.shape[-1]]
Louis Verhaardaee5d752020-09-30 09:01:52 +0200344 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 +0200345 # There is a preceding Reshape
346 # Compare input of prev_op and input of op, to see if prev_op can be removed
347 ifm_prev_op = prev_op.inputs[0]
Tim Hall93582962020-09-09 21:58:15 +0100348 if ifm_prev_op.shape == ifm.shape and check_quantized_tens_scaling_equal(ifm_prev_op, ifm.quantization):
Patrik Gustavssoncb337042020-09-16 14:55:40 +0200349 # prev_op can be removed
350 op.set_input_tensor(ifm_prev_op, 0)
351 else:
352 op.inputs[0].set_all_shapes(desired_shape)
353 prev_op.set_input_tensor(
354 create_const_tensor(prev_op.inputs[1].name, [1], DataType.int32, desired_shape), 1
355 )
356 prev_op.attrs["new_shape"] = desired_shape
357 else:
358 # Add reshape op to the input if there is no preceding reshape
359 ifm.consumer_list.remove(op)
360 op.set_input_tensor(create_reshape_tensor(ifm, desired_shape), 0)
361
362 # Reshape Weights to be 4D. IO becomes HWIO
363 weight_tensor = op.inputs[1]
364 weight_tensor.quant_values = np.expand_dims(np.expand_dims(weight_tensor.quant_values, axis=0), axis=0)
365 weight_tensor.set_all_shapes(list(weight_tensor.quant_values.shape))
366
367 desired_shape = [1, h, w, ofm.shape[-1]]
368 if (
369 len(ofm.consumer_list) == 1
370 and ofm.consumer_list[0] is not None
Louis Verhaardaee5d752020-09-30 09:01:52 +0200371 and ofm.consumer_list[0].type == Op.Reshape
Patrik Gustavssoncb337042020-09-16 14:55:40 +0200372 ):
373 # There is a subsequent Reshape
374 # Compare desired shape and output of consumer op, to see if consumer op can be removed
375 ofm_cons_op = ofm.consumer_list[0].outputs[0]
Tim Hall93582962020-09-09 21:58:15 +0100376 if desired_shape == ofm_cons_op.shape and check_quantized_tens_scaling_equal(ofm, ofm_cons_op):
Patrik Gustavssoncb337042020-09-16 14:55:40 +0200377 op.outputs[0] = ofm_cons_op
378 op.outputs[0].ops = [op]
379 else:
380 op.outputs[0].set_all_shapes(desired_shape)
381 else:
382 # Add rehape op to the output
383 op.set_output_tensor(create_reshape_tensor(ofm, desired_shape, False))
384 return op
385
386
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200387def fixup_pack_input(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200388 if op.type == Op.Pack:
Tim Hall79d07d22020-04-27 18:20:16 +0100389 # Pack is also referred to as Stack
390 # Requires the rewrite_concat function to be called on the op afterwards
391 axis = int(op.attrs["axis"])
392 desired_shape = op.inputs[0].shape[:axis] + [1] + op.inputs[0].shape[axis:]
393
394 # Construct 1 shape tensor to be used by all inserted reshape ops
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100395 new_shape_tens = create_const_tensor(op.name + "_reshape_shape", [1], DataType.int32, desired_shape)
Tim Hall79d07d22020-04-27 18:20:16 +0100396
397 for idx, inp in enumerate(op.inputs):
Tim Hall79d07d22020-04-27 18:20:16 +0100398 reshape_out = inp.clone("_reshaped")
Michael McGeagh6a8d4242020-07-28 12:17:59 +0100399 reshape_out.set_all_shapes(desired_shape)
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100400
Louis Verhaardaee5d752020-09-30 09:01:52 +0200401 reshape_op = Operation(Op.Reshape, "{}{}_reshape".format(op.name, idx))
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100402 reshape_op.attrs["new_shape"] = desired_shape
403 reshape_op.inputs = [inp, new_shape_tens]
404 reshape_op.set_output_tensor(reshape_out)
Tim Halle6ccd872020-11-09 16:46:37 +0000405 DebugDatabase.add_optimised(op, reshape_op)
Tim Hall79d07d22020-04-27 18:20:16 +0100406
407 op.inputs[idx] = reshape_out
408
Louis Verhaardaee5d752020-09-30 09:01:52 +0200409 op.type = Op.PackReshaped
Tim Hall79d07d22020-04-27 18:20:16 +0100410
411 return op
412
413
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200414def unfuse_activation_function(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200415 if op.type == Op.ConcatTFLite and op.run_on_npu and op.activation is not None:
416 act_op = Operation(op.activation, op.name + op.activation.name)
417 op.activation = None
Fredrik Svedberg0f98b362020-09-29 10:00:39 +0200418 out_tens = op.outputs[0]
419 intermediate_tens = out_tens.clone("_act_intermediate")
420 act_op.set_output_tensor(out_tens)
421 act_op.add_input_tensor(intermediate_tens)
422 op.set_output_tensor(intermediate_tens)
423
424 return op
425
Louis Verhaard8912c532020-09-30 12:11:49 +0200426
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100427def fixup_stridedslice_output(tens, arch, nng):
428 op = tens.ops[0]
Dwight Lidman73320a42020-11-05 10:34:41 +0100429 if op.run_on_npu and op.type == Op.StridedSlice:
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100430 reshape_input_shape = tens.shape
431 new_axis_mask = op.attrs["new_axis_mask"]
432 shrink_axis_mask = op.attrs["shrink_axis_mask"]
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100433
Dwight Lidman73320a42020-11-05 10:34:41 +0100434 if shrink_axis_mask != 0:
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100435 n = 0
436 axis = 0
437 while shrink_axis_mask:
438 prev_mask = shrink_axis_mask
439 n += 1
440 shrink_axis_mask &= shrink_axis_mask - 1
441 axis = int(math.log2(prev_mask - shrink_axis_mask))
442 reshape_input_shape = reshape_input_shape[:axis] + [1] + reshape_input_shape[axis:]
443
444 assert len(tens.shape) == (len(op.inputs[0].shape) - n)
445 op.attrs["shrink_axis_mask"] = 0
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100446 elif new_axis_mask != 0:
447 n = 0
448 axis = 0
449 while new_axis_mask:
450 prev_mask = new_axis_mask
451 n += 1
452 new_axis_mask &= new_axis_mask - 1
453 axis = int(math.log2(prev_mask - new_axis_mask))
454 reshape_input_shape = reshape_input_shape[:axis] + reshape_input_shape[(axis + 1) :]
455 new_axis_mask >>= 1
456
457 assert len(tens.shape) == (len(op.inputs[0].shape) + n)
458 op.attrs["new_axis_mask"] = 0
459
460 # Construct 1 shape tensor to be used by all inserted reshape ops
461 new_shape_tens = create_const_tensor(op.name + "_reshape_shape", [1], DataType.int32, tens.shape)
462
463 for idx, out_tens in enumerate(op.outputs):
464 reshape_in = out_tens.clone("_reshaped")
465 reshape_in.set_all_shapes(reshape_input_shape)
466 reshape_in.ops = [op]
467
468 reshape_op = Operation(Op.Reshape, "{}{}_reshape".format(op.name, idx))
469 reshape_op.attrs["new_shape"] = reshape_input_shape
470 reshape_op.inputs = [reshape_in, new_shape_tens]
471 reshape_op.set_output_tensor(out_tens)
472
473 op.outputs[idx] = reshape_in
474
475 return tens
476
477
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200478def fixup_unpack_output(tens, arch, nng):
Tim Hall79d07d22020-04-27 18:20:16 +0100479 op = tens.ops[0]
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100480 if op.run_on_npu and op.type == Op.Unpack:
Tim Hall79d07d22020-04-27 18:20:16 +0100481 # Unpack is also referred to as Unstack
482 # Requires the rewrite_split function to be called on the op afterwards
Diqing Zhongc7c0b1b2020-10-26 11:45:25 +0100483 axis = int(op.attrs["axis"])
484 op.type = Op.UnpackReshaped
485 reshape_input_shape = tens.shape[:axis] + [1] + tens.shape[axis:]
Tim Hall79d07d22020-04-27 18:20:16 +0100486
487 # Construct 1 shape tensor to be used by all inserted reshape ops
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100488 new_shape_tens = create_const_tensor(op.name + "_reshape_shape", [1], DataType.int32, tens.shape)
Tim Hall79d07d22020-04-27 18:20:16 +0100489
490 for idx, out_tens in enumerate(op.outputs):
Tim Hall79d07d22020-04-27 18:20:16 +0100491 reshape_in = out_tens.clone("_reshaped")
Michael McGeagh6a8d4242020-07-28 12:17:59 +0100492 reshape_in.set_all_shapes(reshape_input_shape)
Tim Hall79d07d22020-04-27 18:20:16 +0100493 reshape_in.ops = [op]
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100494
Louis Verhaardaee5d752020-09-30 09:01:52 +0200495 reshape_op = Operation(Op.Reshape, "{}{}_reshape".format(op.name, idx))
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100496 reshape_op.attrs["new_shape"] = reshape_input_shape
Tim Hall79d07d22020-04-27 18:20:16 +0100497 reshape_op.inputs = [reshape_in, new_shape_tens]
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100498 reshape_op.set_output_tensor(out_tens)
Tim Halle6ccd872020-11-09 16:46:37 +0000499 DebugDatabase.add_optimised(op, reshape_op)
Tim Hall79d07d22020-04-27 18:20:16 +0100500
501 op.outputs[idx] = reshape_in
502
503 return tens
504
505
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200506def add_padding_fields(op, arch, nng):
Jacob Bohlin90033f32020-08-28 15:45:44 +0200507 if op.run_on_npu:
508 if "padding" in op.attrs:
Louis Verhaardaee5d752020-09-30 09:01:52 +0200509 if op.type.is_conv2d_op() or op.type.is_depthwise_conv2d_op():
Jacob Bohlin90033f32020-08-28 15:45:44 +0200510 kernel_size = op.inputs[1].shape[:2]
511 input_shape = op.inputs[0].shape
Louis Verhaardaee5d752020-09-30 09:01:52 +0200512 elif op.type.is_pool_op() or op.type.npu_block_type == NpuBlockType.ReduceSum:
Jacob Bohlin90033f32020-08-28 15:45:44 +0200513 kernel_size = op.attrs["ksize"][1:3]
514 input_shape = op.inputs[0].shape
Jacob Bohlin90033f32020-08-28 15:45:44 +0200515 else:
516 raise UnsupportedFeatureError("Unknown operation that uses padding: {}".format(op.type))
Tim Hall79d07d22020-04-27 18:20:16 +0100517
Louis Verhaardaee5d752020-09-30 09:01:52 +0200518 if op.type == Op.Conv2DBackpropInputSwitchedBias:
Jacob Bohlin90033f32020-08-28 15:45:44 +0200519 upscaling_factor = op.outputs[0].shape[1] // input_shape[1]
520 padding, skirt = calc_upscaled_padding_and_skirt(
521 op.attrs["padding"], kernel_size, op.attrs["strides"], input_shape, upscaling_factor
522 )
523 else:
524 dilation_h, dilation_w = op.get_dilation_h_w()
525 dilated_kernel_size = [dilation_h * (kernel_size[0] - 1) + 1, dilation_w * (kernel_size[1] - 1) + 1]
526 padding, skirt = calc_padding_and_skirt(
527 op.attrs["padding"], dilated_kernel_size, op.attrs["strides"], input_shape
528 )
Jacob Bohlincf7da102020-05-20 09:03:40 +0200529
Jacob Bohlin90033f32020-08-28 15:45:44 +0200530 op.attrs["explicit_padding"] = padding
531 op.attrs["skirt"] = skirt
Jacob Bohlincf7da102020-05-20 09:03:40 +0200532
Tim Hall79d07d22020-04-27 18:20:16 +0100533 return op
534
535
Tim Hall79d07d22020-04-27 18:20:16 +0100536# Check if the op can be reordered
537def get_prepend_op(op):
538 inp = op.inputs[0]
539 # The op should be reordered between prev_op and prep_op
540 prev_op = inp.ops[-1]
541 prep_op = None
542 while prev_op.type in memory_only_ops and len(prev_op.outputs) == 1 and len(prev_op.outputs[0].consumers()) == 1:
543 prep_op = prev_op
544 inp = prev_op.inputs[0]
545 prev_op = inp.ops[-1]
Diego Russoea6111a2020-04-14 18:41:58 +0100546 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 +0100547 return prep_op
548
549 return None
550
551
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200552def convert_depthwise_to_conv(op, arch, nng):
Tim Hall79d07d22020-04-27 18:20:16 +0100553 # Depthwise is equivalent to a single conv2d if the ifm depth is 1 and
554 # the ofm depth equals the depth multipler.
555 # If those conditions are true, then we can perform a simple
556 # switch of the operator type (and weight order)
557
Louis Verhaardaee5d752020-09-30 09:01:52 +0200558 if op.type == Op.DepthwiseConv2DBias and (op.attrs["depth_multiplier"] != 1):
Tim Hall79d07d22020-04-27 18:20:16 +0100559 ifm_tensor = op.inputs[0]
560 weight_tensor = op.inputs[1]
561 ofm_tensor = op.outputs[0]
562 if (ifm_tensor.shape[3] == 1) and (ofm_tensor.shape[3] == op.attrs["depth_multiplier"]):
563 # Change op type to Conv2d
Louis Verhaardaee5d752020-09-30 09:01:52 +0200564 op.type = Op.Conv2DBias
Tim Hall79d07d22020-04-27 18:20:16 +0100565 del op.attrs["channel_multiplier"]
566 del op.attrs["depth_multiplier"]
567
568 weight_tensor.quant_values = np.transpose(weight_tensor.quant_values, (0, 1, 3, 2))
Michael McGeagh6a8d4242020-07-28 12:17:59 +0100569 weight_tensor.set_all_shapes(list(weight_tensor.quant_values.shape))
Tim Hall79d07d22020-04-27 18:20:16 +0100570 else:
Louis Verhaard7db78962020-05-25 15:05:26 +0200571 raise UnsupportedFeatureError(
572 "Unsupported DepthwiseConv2d with depth_multiplier = {}, ifm channels = {}, ofm channels = {}".format(
Tim Hall79d07d22020-04-27 18:20:16 +0100573 op.attrs["depth_multiplier"], ifm_tensor.shape[3], ofm_tensor.shape[3]
574 )
575 )
Tim Halle6ccd872020-11-09 16:46:37 +0000576 DebugDatabase.add_optimised(op, op)
Tim Hall79d07d22020-04-27 18:20:16 +0100577 return op
578
579
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200580def reorder_depthwise_weights(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200581 if op.type.is_depthwise_conv2d_op():
Jacob Bohline843d332020-06-23 12:12:56 +0200582 weight_tensor = op.inputs[1]
583 weight_tensor.quant_values = np.transpose(weight_tensor.quant_values, (0, 1, 3, 2))
Michael McGeagh6a8d4242020-07-28 12:17:59 +0100584 weight_tensor.set_all_shapes(list(weight_tensor.quant_values.shape))
Jacob Bohline843d332020-06-23 12:12:56 +0200585 weight_tensor.weight_transpose_depthwise = True
586
587 return op
588
589
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200590def convert_conv_to_fc(op, arch, nng):
Michael McGeagh8d939c02020-07-29 13:11:43 +0100591 # Conv 1x1 can be equivalent to Fully Connected.
592 # By representing certain convs as fully connected layers, Vela can better determine wether or not to use
593 # caching/double buffering for the weights.
594 # (Weights dont need to be reloaded for convs when IFM H and W are 1)
Louis Verhaardaee5d752020-09-30 09:01:52 +0200595 if op.type == Op.Conv2DBias:
Michael McGeagh8d939c02020-07-29 13:11:43 +0100596 _, h, w, _ = op.inputs[0].shape
597 kh, kw, _, _ = op.inputs[1].shape
598 if h == 1 and w == 1 and kh == 1 and kw == 1:
599 # Overwrite this op as a Fully Connected Op
600 op.name += "_fc"
Louis Verhaardaee5d752020-09-30 09:01:52 +0200601 op.type = Op.FullyConnected
Michael McGeagh8d939c02020-07-29 13:11:43 +0100602 op.attrs = {
Michael McGeagh8d939c02020-07-29 13:11:43 +0100603 "weights_format": 0,
Michael McGeagh8d939c02020-07-29 13:11:43 +0100604 }
605 # Reshape Weights to be 2D. HWIO becomes just IO (as H and W are 1, they can just be dropped)
606 weight_tensor = op.inputs[1]
607 weight_tensor.quant_values = weight_tensor.quant_values.squeeze(axis=(0, 1))
608 weight_tensor.set_all_shapes(list(weight_tensor.quant_values.shape))
609 # The output from a fully connected is expected to be 2D so we need to add a reshape layer to convert it
610 # back to 4D afterwards as the next layer is expecting that shape
611 orig_ofm_tensor = op.outputs[0]
612 # 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})
613 fc_ofm_tensor = orig_ofm_tensor.clone("_fc")
614 fc_ofm_tensor.set_all_shapes([1, fc_ofm_tensor.shape[-1]])
615 fc_ofm_tensor.ops = [op]
616 # Add a reshape after the new OFM to convert it back to the original 4D shape
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100617 reshape_name = op.name + "_reshape"
618 new_shape_tens = create_const_tensor(reshape_name + "_shape", [1], DataType.int32, orig_ofm_tensor.shape)
Louis Verhaardaee5d752020-09-30 09:01:52 +0200619 reshape_op = Operation(Op.Reshape, reshape_name)
Michael McGeagh8d939c02020-07-29 13:11:43 +0100620 reshape_op.attrs["new_shape"] = orig_ofm_tensor.shape
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100621 reshape_op.inputs = [fc_ofm_tensor, new_shape_tens]
622 reshape_op.set_output_tensor(orig_ofm_tensor)
Michael McGeagh8d939c02020-07-29 13:11:43 +0100623 # Replace this ops OFM to point to the 2D tensor
624 op.outputs[0] = fc_ofm_tensor
Tim Halle6ccd872020-11-09 16:46:37 +0000625 # Record optimisation in debug database
626 DebugDatabase.add_optimised(op, reshape_op)
627 DebugDatabase.add_optimised(op, op)
Michael McGeagh8d939c02020-07-29 13:11:43 +0100628 return op
629
630
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200631def fixup_relus_with_differing_ifm_ofm_scaling(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200632 if op.run_on_npu and op.type.is_relu_op():
Michael McGeagh8dbf8cf2020-09-08 11:09:48 +0100633 ifm = op.inputs[0]
634 ofm = op.outputs[0]
635 # Relu with differing IFM and OFM scaling cannot be fused with another primary op
636 # and requires its own to be inserted
Tim Hall93582962020-09-09 21:58:15 +0100637 if not check_quantized_tens_scaling_equal(ifm, ofm):
Michael McGeagh8dbf8cf2020-09-08 11:09:48 +0100638 # Override this op with its own primary op (avgpool)
639 relu_fused_op = create_avgpool_nop(op.name + "_avgpool")
640 # And fuse the original activation function to it
Louis Verhaardaee5d752020-09-30 09:01:52 +0200641 relu_fused_op.activation = op.type
Michael McGeagh8dbf8cf2020-09-08 11:09:48 +0100642 # Tidy up and assign the ifm and ofm to the new op
643 ifm.consumer_list.remove(op)
Andreas Nevalainenf3d737e2020-09-25 14:12:43 +0200644
645 # if not 4d, reshape ifm/ofm
646 if len(ifm.shape) < 4:
647 ifm_shaped = create_reshape_tensor(ifm, full_shape(4, ifm.shape, 1))
648 ifm = ifm_shaped
649 if len(ofm.shape) < 4:
650 ofm_shaped = create_reshape_tensor(ofm, full_shape(4, ofm.shape, 1), False)
651 ofm = ofm_shaped
652
Michael McGeagh8dbf8cf2020-09-08 11:09:48 +0100653 relu_fused_op.add_input_tensor(ifm)
654 relu_fused_op.set_output_tensor(ofm)
655 op = relu_fused_op
656 return op
657
658
Tim Hall79d07d22020-04-27 18:20:16 +0100659# Reorder activation op if it's after the memory only operations
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200660def fixup_act_reorder(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200661 if op.type.is_relu_op() or op in set((Op.Sigmoid, Op.Tanh)):
Tim Hall79d07d22020-04-27 18:20:16 +0100662 prep_op = get_prepend_op(op)
Diego Russoea6111a2020-04-14 18:41:58 +0100663 if prep_op is not None:
Tim Hall79d07d22020-04-27 18:20:16 +0100664 act_op = op.clone("_reordered")
Patrik Gustavssoncb337042020-09-16 14:55:40 +0200665
666 # There is only one input tensor, overwrite it
667 act_op.set_input_tensor(prep_op.inputs[0], 0)
668
Tim Hall79d07d22020-04-27 18:20:16 +0100669 act_op_out = act_op.inputs[0].clone("_acted")
670 act_op_out.quantization = op.outputs[0].quantization.clone()
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100671 act_op.set_output_tensor(act_op_out)
Patrik Gustavssoncb337042020-09-16 14:55:40 +0200672
673 # Update the consumer list
674 act_op_out.consumer_list = op.outputs[0].consumer_list.copy()
675 act_op_out.consumer_list.append(prep_op)
676
Tim Hall79d07d22020-04-27 18:20:16 +0100677 prep_op.inputs[0] = act_op_out
678 prep_op.outputs[0].quantization = act_op_out.quantization.clone()
679
680 # Mark the op so that it will be removed as passthrough later on
Louis Verhaardaee5d752020-09-30 09:01:52 +0200681 op.type = Op.Identity
Tim Halle6ccd872020-11-09 16:46:37 +0000682
683 # Record optimisation in debug database
684 DebugDatabase.add_optimised(op, act_op)
685 DebugDatabase.add_optimised(op, op)
Tim Hall79d07d22020-04-27 18:20:16 +0100686 return op
687
Louis Verhaarde0ef2732020-06-03 08:56:44 +0200688
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200689def fixup_elementwise_with_scalars(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200690 if op.type.is_binary_elementwise_op():
Louis Verhaarde0ef2732020-06-03 08:56:44 +0200691 ifm_tensor, ifm2_tensor, _, _ = op.get_ifm_ifm2_weights_ofm()
Charles Xu78792222020-05-13 10:15:26 +0200692 if ifm2_tensor.shape != [] and ifm_tensor.shape != []:
693 diff = len(ifm_tensor.shape) - len(ifm2_tensor.shape)
694 if diff > 0:
695 ifm2_tensor.shape = full_shape(len(ifm_tensor.shape), ifm2_tensor.shape, 1)
696 elif diff < 0:
697 ifm_tensor.shape = full_shape(len(ifm2_tensor.shape), ifm_tensor.shape, 1)
Louis Verhaarde0ef2732020-06-03 08:56:44 +0200698 elif ifm_tensor.shape == [] and ifm_tensor.quant_values is None:
699 # IFM is marked as a scalar, but is a result of an operation; change it to a shape of size 1
700 ifm_tensor.shape = len(ifm2_tensor.shape) * [1]
701 ifm_tensor.storage_shape = ifm_tensor.shape
702 elif ifm2_tensor.shape == [] and ifm2_tensor.quant_values is None:
703 # IFM2 is marked as a scalar, but is a result of an operation; change it to a shape of size 1
704 ifm2_tensor.shape = len(ifm_tensor.shape) * [1]
705 ifm2_tensor.storage_shape = ifm2_tensor.shape
Charles Xu78792222020-05-13 10:15:26 +0200706 return op
Tim Hall79d07d22020-04-27 18:20:16 +0100707
Louis Verhaarde0ef2732020-06-03 08:56:44 +0200708
Tim Hall4e127762020-05-15 16:05:49 +0100709# Set input/output tensor equivalence to the same id for memory operations
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200710def set_tensor_equivalence(op, arch, nng):
Michael McGeagh11b0bdb2020-09-08 11:07:35 +0100711 if op.type in memory_only_ops:
Tim Hall4e127762020-05-15 16:05:49 +0100712 eid = op.outputs[0].equivalence_id
713 for inp in op.inputs:
714 inp.equivalence_id = eid
715 return op
716
717
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200718def convert_softmax(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200719 if op.type == Op.Softmax and op.run_on_npu:
Fredrik Svedberga0c36242020-06-03 15:43:31 +0200720 softmax = SoftMax(op)
721 op = softmax.get_graph()
722 return op
723
724
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200725def convert_mul_max_to_abs_or_lrelu(op, arch, nng):
Diego Russoea6111a2020-04-14 18:41:58 +0100726 r"""Whenever there is a subgraph with this topology:
Tim Hall79d07d22020-04-27 18:20:16 +0100727
728 Input X For X = -1 or X > 0
729 | \ / This subgraph can be replaced with either
730 | Mul an Abs (if X = -1) or a LeakyReLU (if X > 0)
731 | /
732 Max
733 """
734
Louis Verhaardaee5d752020-09-30 09:01:52 +0200735 if op.type == Op.Maximum:
Tim Hall79d07d22020-04-27 18:20:16 +0100736 # finds the Mul input(s) to the Max
Louis Verhaardaee5d752020-09-30 09:01:52 +0200737 muls = [i for i in op.inputs if i.ops[0].type == Op.Mul]
Tim Hall79d07d22020-04-27 18:20:16 +0100738 if len(muls) == 1:
739 mul = muls[0].ops[0]
740 elif len(muls) == 2:
741 # In the case both inputs are Muls, find the one with the same input as the Max
742 mul = [m for m in muls if len(set(op.inputs + m.ops[0].inputs)) == 1][0].ops[0]
743 else:
744 # No Mul inputs
745 return op
746
747 # make sure the Mul doesn't have any other consumers
Louis Verhaardd7911c42020-08-25 13:36:41 +0200748 mul_ofm = mul.outputs[0]
749 if len(mul_ofm.consumers()) != 1:
Tim Hall79d07d22020-04-27 18:20:16 +0100750 return op
Louis Verhaardaee5d752020-09-30 09:01:52 +0200751 # make sure the Mul doesn't have a fused activation function
752 if mul.activation:
Tim Hall79d07d22020-04-27 18:20:16 +0100753 return op
Louis Verhaardaee5d752020-09-30 09:01:52 +0200754 ifm, ofm = op.get_ifm_ofm()
Tim Hall93582962020-09-09 21:58:15 +0100755 if ifm is None or ofm is None:
756 return op
757
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200758 if ifm.dtype not in (DataType.uint8, DataType.int8) or ifm.dtype != ofm.dtype:
759 return op
Tim Hall93582962020-09-09 21:58:15 +0100760 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 +0200761 # rewrite to LeakyRelu currently only makes sense if the quantization is identical
762 return op
Tim Hall79d07d22020-04-27 18:20:16 +0100763
764 # finds the branched input that goes to both the Max and the Mul
765 shared = set(op.inputs) & set(mul.inputs)
766 if len(shared) == 1:
767 shared_in = shared.pop()
768 # find the constant scalar input to the Mul
769 const_tens = (set(mul.inputs) - {shared_in}).pop()
770 # check that it is a scalar
771 if const_tens.shape != []:
772 return op
773 const = const_tens.ops[0]
774 # check that it is a constant
Louis Verhaardaee5d752020-09-30 09:01:52 +0200775 if const.type != Op.Const:
Tim Hall79d07d22020-04-27 18:20:16 +0100776 return op
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200777 # Remove the Mul from the shared input's consumers
778 shared_in.consumer_list.remove(mul)
Tim Hall79d07d22020-04-27 18:20:16 +0100779 else:
780 return op
781
782 val = const.outputs[0].values
783 if val >= 0:
Louis Verhaardaee5d752020-09-30 09:01:52 +0200784 new_op = Op.LeakyRelu
Tim Hall79d07d22020-04-27 18:20:16 +0100785 op.attrs["alpha"] = val
Louis Verhaardd7911c42020-08-25 13:36:41 +0200786 # to produce bit exact results, the alpha is not enough;
787 # save additional scaling info in attr "alpha_scale", to be used as input
788 # to the LUT construction
789 alpha_scalar = const_tens.quant_values - const_tens.quantization.zero_point
790 mul_ifm_scale = np.double(ifm.quantization.scale_f32)
791 mul_ifm2_scale = np.double(const_tens.quantization.scale_f32)
792 mul_ofm_scale = np.double(mul_ofm.quantization.scale_f32)
793 alpha_scale, alpha_shift = scaling.elementwise_mul_scale(mul_ifm_scale, mul_ifm2_scale, mul_ofm_scale)
794 op.attrs["alpha_scaling"] = (alpha_scalar, alpha_scale, alpha_shift)
Tim Hall79d07d22020-04-27 18:20:16 +0100795 elif val == -1:
Louis Verhaardaee5d752020-09-30 09:01:52 +0200796 new_op = Op.Abs
Tim Hall79d07d22020-04-27 18:20:16 +0100797 else:
798 return op
799
Louis Verhaardaee5d752020-09-30 09:01:52 +0200800 op.type = new_op
801 op.name = op.name.replace("Maximum", new_op.name)
802 op.outputs[0].name = op.outputs[0].name.replace("Maximum", new_op.name)
Tim Hall79d07d22020-04-27 18:20:16 +0100803 op.inputs = [shared_in]
Tim Halle6ccd872020-11-09 16:46:37 +0000804
805 # Record optimisation in debug database
806 DebugDatabase.add_optimised(op, op)
807
Tim Hall79d07d22020-04-27 18:20:16 +0100808 return op
809
810
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200811def convert_lrelu_to_mul_max(op, arch):
812 # Converts LeakyRelu to Max(alpha * IFM, identity * IFM)
813 # (the opposite of convert_mul_max_to_abs_or_lrelu)
Louis Verhaardaee5d752020-09-30 09:01:52 +0200814 ifm, ofm = op.get_ifm_ofm()
Tim Hall93582962020-09-09 21:58:15 +0100815 if ifm is None or ofm is None:
816 return op
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200817
818 # Add multiplication with alpha
Louis Verhaardaee5d752020-09-30 09:01:52 +0200819 mul_alpha = Operation(Op.Mul, op.name + "_mul_alpha")
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200820 mul_alpha.add_input_tensor(ifm)
821 # Create const tensor containing alpha as scalar
822 alpha = op.attrs["alpha"]
823 quantization = ifm.quantization.clone()
824 quantization.min = 0
825 quantization.max = alpha * (quantization.quant_max - quantization.quant_min)
826 quantization.scale_f32 = alpha
827 quantization.zero_point = 0
828 alpha_tens = create_const_tensor(op.name + "_alpha_scalar", [], ifm.dtype, [1], np.int8, quantization=quantization)
829 mul_alpha.add_input_tensor(alpha_tens)
830 fm_alpha = ofm.clone(op.name + "_alpha")
831 mul_alpha.set_output_tensor(fm_alpha)
Tim Halle6ccd872020-11-09 16:46:37 +0000832 DebugDatabase.add_optimised(op, mul_alpha)
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200833
Tim Hall93582962020-09-09 21:58:15 +0100834 if check_quantized_tens_scaling_equal(ifm, ofm):
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200835 # No identity multiplication is needed
836 fm_id = ifm
837 else:
838 # Add multiplication with identity
Louis Verhaardaee5d752020-09-30 09:01:52 +0200839 mul_identity = Operation(Op.Mul, op.name + "_mul_identity")
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200840 mul_identity.add_input_tensor(ifm)
841 # Create const tensor containing identity as scalar
842 quantization = ifm.quantization.clone()
843 quantization.min = 0
844 quantization.max = quantization.quant_max - quantization.quant_min
845 quantization.scale_f32 = 1
846 quantization.zero_point = 0
847 identity_tens = create_const_tensor(
848 op.name + "_id_scalar", [], ifm.dtype, [1], np.uint8, quantization=quantization
849 )
850 mul_identity.add_input_tensor(identity_tens)
851 fm_id = ofm.clone(op.name + "_id")
852 mul_identity.set_output_tensor(fm_id)
Tim Halle6ccd872020-11-09 16:46:37 +0000853 DebugDatabase.add_optimised(op, mul_alpha)
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200854
855 # Convert LeakyRelu to Max, add the results of the multiplication(s) as inputs
Louis Verhaardaee5d752020-09-30 09:01:52 +0200856 op.type = Op.Maximum
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200857 op.name = op.name.replace("LeakyRelu", "Maximum")
858 op.inputs = []
859 ifm.consumer_list.remove(op)
860 op.add_input_tensor(fm_alpha)
861 op.add_input_tensor(fm_id)
Tim Halle6ccd872020-11-09 16:46:37 +0000862
863 DebugDatabase.add_optimised(op, op)
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200864 return op
865
866
Louis Verhaard2e186c72020-10-09 10:47:04 +0200867def convert_to_lut(op, lut_values, lut_name):
Louis Verhaardf03bad32020-09-25 08:30:44 +0200868 # Rewrite the operation by Add with scalar 0 + LUT activation
869 ifm = op.inputs[0]
Tim Hall93582962020-09-09 21:58:15 +0100870 if ifm is None:
871 return op
Louis Verhaard58520b92020-08-24 16:45:38 +0200872 assert ifm.dtype.size_in_bytes() == 1
Louis Verhaardaee5d752020-09-30 09:01:52 +0200873 op.type = Op.Add
Louis Verhaard2e186c72020-10-09 10:47:04 +0200874 op.name = op.name + "_lut_" + lut_name
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200875 # Mark as no-op to enable potential fusing optimizations
876 op.attrs["is_nop"] = True
877 # Create an input tensor containing scalar zero
878 quantization = QuantizationParameters(0.0, 255.0)
Louis Verhaardd7911c42020-08-25 13:36:41 +0200879 quantization.scale_f32 = ifm.quantization.scale_f32
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200880 quantization.zero_point = 0
Louis Verhaard2e186c72020-10-09 10:47:04 +0200881 tens = create_const_tensor(op.inputs[0].name + "_scalar0", [], ifm.dtype, [0], np.uint8, quantization=quantization)
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200882 op.add_input_tensor(tens)
Louis Verhaardf03bad32020-09-25 08:30:44 +0200883 # The LUT must be applied without any preceding rescaling (the LUT itself performs the rescale),
884 # so even if the OFM has a different scale than the IFM, the generated OFM scale instructions
885 # should be the same as the IFM
Louis Verhaardaee5d752020-09-30 09:01:52 +0200886 op.forced_output_quantization = ifm.quantization
Louis Verhaard2e186c72020-10-09 10:47:04 +0200887 lut_tensor = lut.create_lut_tensor(op.name + "_values", lut_values, DataType.int8)
Louis Verhaardf03bad32020-09-25 08:30:44 +0200888 op.set_activation_lut(lut_tensor)
889 return op
890
891
Louis Verhaard2e186c72020-10-09 10:47:04 +0200892def convert_to_lut8(op, fn, fn_name):
Louis Verhaardf03bad32020-09-25 08:30:44 +0200893 # Converts op to a no-op + int8/uint8 LUT which is generated with the given function.
894 # fn is a function(real) -> real
Louis Verhaardaee5d752020-09-30 09:01:52 +0200895 ifm, ofm = op.get_ifm_ofm()
Louis Verhaardf03bad32020-09-25 08:30:44 +0200896 if ifm.dtype not in (DataType.uint8, DataType.int8) or ifm.dtype != ofm.dtype:
897 return op
898 # Generate the LUT
899 ifm_scale = np.double(ifm.quantization.scale_f32)
900 ofm_scale = np.double(ofm.quantization.scale_f32)
901 zp_in = ifm.quantization.zero_point
902 zp_out = ofm.quantization.zero_point
903 values = []
904 ix = range(256) if ifm.dtype == DataType.uint8 else range(-128, 128)
905 quantized_min = min(ix)
906 quantized_max = max(ix)
907 for x in ix:
908 x_real = ifm_scale * (x - zp_in)
909 y_real = fn(x_real)
910 lut_result = round_away_zero(zp_out + y_real / ofm_scale)
911 lut_result = min(quantized_max, max(quantized_min, lut_result))
912 values.append(lut_result)
Louis Verhaard2e186c72020-10-09 10:47:04 +0200913 return convert_to_lut(op, values, fn_name)
Louis Verhaardf03bad32020-09-25 08:30:44 +0200914
915
916def convert_lrelu_to_lut(op, arch):
Louis Verhaardaee5d752020-09-30 09:01:52 +0200917 ifm, ofm = op.get_ifm_ofm()
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200918 # Generate the LUT
Louis Verhaardd7911c42020-08-25 13:36:41 +0200919 alpha = op.attrs["alpha"]
920 ifm_scale = np.double(ifm.quantization.scale_f32)
921 ofm_scale = np.double(ofm.quantization.scale_f32)
922 zp_in = ifm.quantization.zero_point
923 zp_out = ofm.quantization.zero_point
924 identity_scale, identity_shift = scaling.elementwise_mul_scale(ifm_scale, 1, ofm_scale)
925 alpha_scalar = 1
926 alpha_scale, alpha_shift = scaling.elementwise_mul_scale(ifm_scale, alpha, ofm_scale)
927 if "alpha_scaling" in op.attrs:
928 # The LeakyRelu was the result from convert_mul_max_to_abs_or_lrelu
929 alpha_scalar, alpha_scale, alpha_shift = op.attrs["alpha_scaling"]
930 values = []
Louis Verhaard58520b92020-08-24 16:45:38 +0200931 ix = range(256) if ifm.dtype == DataType.uint8 else range(-128, 128)
Louis Verhaardd7911c42020-08-25 13:36:41 +0200932 quantized_min = min(ix)
933 quantized_max = max(ix)
934 for x in ix:
935 if x < zp_in:
936 lut_result = zp_out + fp_math.multiply_by_quantized_multiplier(
937 alpha_scalar * (x - zp_in), alpha_scale, alpha_shift
938 )
939 else:
940 lut_result = zp_out + fp_math.multiply_by_quantized_multiplier(x - zp_in, identity_scale, identity_shift)
941 lut_result = min(quantized_max, max(quantized_min, lut_result))
942 values.append(lut_result)
Louis Verhaard2e186c72020-10-09 10:47:04 +0200943 return convert_to_lut(op, values, "lrelu")
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200944
945
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200946def convert_lrelu(op, arch, nng):
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200947 # Converts LeakyRelu to a LUT based solution if possible, otherwise a mul + max
Louis Verhaardaee5d752020-09-30 09:01:52 +0200948 if op.type != Op.LeakyRelu:
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200949 return op
Louis Verhaardaee5d752020-09-30 09:01:52 +0200950 ifm, ofm = op.get_ifm_ofm()
Tim Hall93582962020-09-09 21:58:15 +0100951 if ifm is None or ofm is None:
952 return op
Louis Verhaardd7911c42020-08-25 13:36:41 +0200953 if ifm.dtype in (DataType.uint8, DataType.int8) and ifm.dtype == ofm.dtype:
954 # use LUT for int8/uint8
955 return convert_lrelu_to_lut(op, arch)
Tim Hall93582962020-09-09 21:58:15 +0100956 if check_quantized_tens_scaling_equal(ifm, ofm) and ifm.dtype == ofm.dtype == DataType.int16:
Louis Verhaardd7911c42020-08-25 13:36:41 +0200957 # use LeakyRelu unmodified for int16 with equal input/output scaling
958 return op
Louis Verhaardb9fc33c2020-08-13 11:47:36 +0200959 return convert_lrelu_to_mul_max(op, arch)
960
961
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200962def convert_tanh_sigmoid_to_lut(op, arch, nng):
Louis Verhaardf03bad32020-09-25 08:30:44 +0200963 # Converts int8/uint8 Sigmoid and Tanh to a LUT based solution
Louis Verhaardaee5d752020-09-30 09:01:52 +0200964 if op.type == Op.Sigmoid:
Louis Verhaard2e186c72020-10-09 10:47:04 +0200965 return convert_to_lut8(op, clamp_sigmoid, "sigmoid")
Louis Verhaardaee5d752020-09-30 09:01:52 +0200966 elif op.type == Op.Tanh:
Louis Verhaard2e186c72020-10-09 10:47:04 +0200967 return convert_to_lut8(op, math.tanh, "tanh")
Louis Verhaardf03bad32020-09-25 08:30:44 +0200968 return op
969
970
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +0200971def remove_unwanted_reshapes(op, arch, nng):
Patrik Gustavssonfa4cb292020-09-10 08:19:36 +0200972 # Try to remove reshapes enclosing ElementWise operator with only one non-constant input
Louis Verhaardaee5d752020-09-30 09:01:52 +0200973 if not op.run_on_npu or not op.type.is_elementwise_op():
Patrik Gustavssonfa4cb292020-09-10 08:19:36 +0200974 return op
975
976 # Check if the ElementWise operator only have one non-constant input
Louis Verhaardaee5d752020-09-30 09:01:52 +0200977 non_const_tens = [x for x in op.inputs if x.ops[0].type != Op.Const]
Patrik Gustavssonfa4cb292020-09-10 08:19:36 +0200978 if len(non_const_tens) != 1:
979 return op
980 ifm = non_const_tens[0]
981
982 # Check if operation is enclosed by Reshapes that can be removed
983 ofm = op.outputs[0]
984 prev_op = ifm.ops[0]
985 if (
986 len(ifm.consumer_list) == 1
Louis Verhaardaee5d752020-09-30 09:01:52 +0200987 and prev_op.type == Op.Reshape
Patrik Gustavssonfa4cb292020-09-10 08:19:36 +0200988 and len(ofm.consumer_list) == 1
Louis Verhaardaee5d752020-09-30 09:01:52 +0200989 and ofm.consumer_list[0].type == Op.Reshape
Patrik Gustavssonfa4cb292020-09-10 08:19:36 +0200990 ):
991 # Operation is enclosed by reshapes, check if they can be removed
Louis Verhaardaee5d752020-09-30 09:01:52 +0200992 prev_op_ifm, prev_op_ofm = prev_op.get_ifm_ofm()
Patrik Gustavssonfa4cb292020-09-10 08:19:36 +0200993 cons_op = ofm.consumer_list[0]
994 cons_op_ifm = ofm
995 cons_op_ofm = cons_op.outputs[0]
996 if len(prev_op_ifm.shape) == len(cons_op_ofm.shape):
997 # Check if quantization is the same in the input and output for the reshape ops
Tim Hall93582962020-09-09 21:58:15 +0100998 if check_quantized_tens_scaling_equal(prev_op_ifm, prev_op_ofm) and check_quantized_tens_scaling_equal(
999 cons_op_ifm, cons_op_ofm
1000 ):
Patrik Gustavsson7ad862a2020-09-29 14:09:43 +02001001 op.set_input_tensor(prev_op_ifm, 0)
1002 op.set_output_tensor(cons_op_ofm)
Patrik Gustavssonfa4cb292020-09-10 08:19:36 +02001003 return op
1004
1005
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +02001006def fuse_activation_function_with_prev(op, arch, nng):
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001007 # if op is a no-op: attempts to move the activation function to the preceding op
Louis Verhaardaee5d752020-09-30 09:01:52 +02001008 if not op.attrs.get("is_nop", False) or op.activation is None:
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001009 return op
Louis Verhaardaee5d752020-09-30 09:01:52 +02001010 ifm, ofm = op.get_ifm_ofm()
Tim Hall93582962020-09-09 21:58:15 +01001011 if ifm is None or ofm is None:
1012 return op
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001013 # finds the input(s) to the operation
1014 prev_op = ifm.ops[0]
1015 # Note: the below checks on prev_op require that a first optimize pass on the full graph has been performed
1016 fuse = (
1017 prev_op.run_on_npu
Louis Verhaardaee5d752020-09-30 09:01:52 +02001018 and prev_op.type.npu_block_type != NpuBlockType.Default
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001019 and len(ifm.ops) == 1
1020 and len(prev_op.outputs[0].consumers()) == 1
Louis Verhaardaee5d752020-09-30 09:01:52 +02001021 and prev_op.activation is None
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001022 )
1023 if op.activation_lut is not None and arch.shram_reserved_unused_banks == 0:
1024 # TODO: if SHRAM LUT space is shared with SHRAM ACC (32, 64 MAC),
1025 # LUT currently only works correctly for elementwise ops
1026 fuse = False
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001027 if not fuse:
1028 return op
1029 # Move the fused activation function + corresponding info to prev_op
Louis Verhaardaee5d752020-09-30 09:01:52 +02001030 prev_op.activation = op.activation
1031 prev_op.forced_output_quantization = op.forced_output_quantization
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001032 if op.activation_lut is not None:
1033 prev_op.set_activation_lut(op.activation_lut)
1034 # Bypass op
Louis Verhaard98a34992020-09-01 10:39:04 +02001035 prev_op.set_output_tensor(ofm)
Tim Halle6ccd872020-11-09 16:46:37 +00001036 DebugDatabase.add_optimised(op, prev_op)
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001037 return op
1038
1039
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +02001040def add_attrs_to_resizebilinear(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +02001041 if op.type == Op.ResizeBilinear and op.run_on_npu:
Dwight Lidman42fed942020-05-29 09:37:03 +02001042 input_tensor = op.inputs[0]
1043 upscaled_shape = [input_tensor.shape[1] * 2, input_tensor.shape[2] * 2]
1044 out_shape = op.outputs[0].shape[1:3]
1045 if not op.attrs["align_corners"] and out_shape == upscaled_shape:
1046 # this means the output is supposed to be a x2 upscale,
1047 # so we need to do SAME padding
1048 op.attrs["padding"] = b"SAME"
1049 elif op.attrs["align_corners"] and out_shape == [upscaled_shape[0] - 1, upscaled_shape[1] - 1]:
1050 # here we can just run the avg pool without padding and
1051 # produce a (M * 2 - 1, N * 2 - 1) sized output
1052 op.attrs["padding"] = b"VALID"
1053 else:
Charles Xu9a03fdf2020-07-02 15:12:40 +02001054 return op
Dwight Lidman42fed942020-05-29 09:37:03 +02001055 input_tensor.resampling_mode = resampling_mode.NEAREST
Tim Hallc30f4952020-06-15 20:47:35 +01001056 op.attrs.update({"strides": (1, 1, 1, 1), "ksize": (1, 2, 2, 1)})
Dwight Lidman42fed942020-05-29 09:37:03 +02001057 return op
1058
1059
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +02001060def fixup_bias_tensors(op, arch, nng):
Louis Verhaardaee5d752020-09-30 09:01:52 +02001061 if op.type.needs_bias() and op.bias is None:
Jacob Bohlina41cd4d2020-08-26 18:21:28 +02001062 # Op has no bias, add bias tensor filled with zeros
1063 nr_biases = op.inputs[1].shape[-1]
1064 bias_values = [0] * nr_biases
1065 bias_tensor = create_const_tensor(op.name + "_bias", [nr_biases], DataType.int32, bias_values)
1066 bias_tensor.quant_values = bias_tensor.values
1067 op.set_input_tensor(bias_tensor, -1)
Jacob Bohlin67e0d8f2020-08-20 10:53:02 +02001068
1069 return op
1070
1071
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +02001072def supported_operator_check(op, arch, nng):
Tim Hall79d07d22020-04-27 18:20:16 +01001073 op.run_on_npu = arch.supported_operators.is_operator_supported(op)
1074 return op
1075
1076
Tim Halle6ccd872020-11-09 16:46:37 +00001077def _record_optimised(op, arch):
1078 if op.type != Op.Const:
1079 DebugDatabase.add_optimised(op, op)
1080
1081
Tim Hall79d07d22020-04-27 18:20:16 +01001082def optimise_graph_a(nng, arch, verbose_graph=False):
1083 if verbose_graph:
1084 nng.print_graph()
1085
1086 op_rewrite_list = [
Tim Hall4e127762020-05-15 16:05:49 +01001087 set_tensor_equivalence,
Tim Hall79d07d22020-04-27 18:20:16 +01001088 supported_operator_check,
1089 # then do any rewrites of supported operators
1090 convert_depthwise_to_conv,
Michael McGeagh8d939c02020-07-29 13:11:43 +01001091 convert_conv_to_fc,
Fredrik Svedberga0c36242020-06-03 15:43:31 +02001092 convert_softmax,
Tim Hall79d07d22020-04-27 18:20:16 +01001093 fixup_fully_connected_input,
Patrik Gustavssoncb337042020-09-16 14:55:40 +02001094 convert_batched_fc_to_conv,
Tim Hall79d07d22020-04-27 18:20:16 +01001095 fixup_pack_input,
Fredrik Svedberg0f98b362020-09-29 10:00:39 +02001096 unfuse_activation_function,
Tim Hall79d07d22020-04-27 18:20:16 +01001097 fixup_conv2d_backprop,
Michael McGeagh8dbf8cf2020-09-08 11:09:48 +01001098 fixup_relus_with_differing_ifm_ofm_scaling,
Tim Hall79d07d22020-04-27 18:20:16 +01001099 fixup_act_reorder,
Charles Xu78792222020-05-13 10:15:26 +02001100 fixup_elementwise_with_scalars,
Jacob Bohline843d332020-06-23 12:12:56 +02001101 reorder_depthwise_weights,
Charles Xu9a03fdf2020-07-02 15:12:40 +02001102 fixup_resizebilinear,
Jacob Bohlina41cd4d2020-08-26 18:21:28 +02001103 fixup_bias_tensors,
Dwight Lidmanc3862c22020-09-14 15:22:33 +02001104 convert_nop_split_to_identity,
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001105 convert_mul_max_to_abs_or_lrelu,
Patrik Gustavssonfa4cb292020-09-10 08:19:36 +02001106 remove_unwanted_reshapes,
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001107 convert_lrelu,
Louis Verhaardf03bad32020-09-25 08:30:44 +02001108 convert_tanh_sigmoid_to_lut,
Tim Hall79d07d22020-04-27 18:20:16 +01001109 ]
1110
1111 for idx, sg in enumerate(nng.subgraphs):
1112 # rewrite graph pass
1113 nng.subgraphs[idx] = rewrite_graph.rewrite_graph_pre_order(
Dwight Lidman73320a42020-11-05 10:34:41 +01001114 nng, sg, arch, [], op_rewrite_list, rewrite_unsupported=False,
Tim Hall79d07d22020-04-27 18:20:16 +01001115 )
1116
1117 for idx, sg in enumerate(nng.subgraphs):
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001118 # remove passthrough tensors and attempt further optimizations
1119 nng.subgraphs[idx] = rewrite_graph.rewrite_graph_pre_order(
Patrik Gustavsson3010d9b2020-10-01 08:22:10 +02001120 nng, sg, arch, [remove_passthrough_tensor], [fuse_activation_function_with_prev, add_padding_fields]
Louis Verhaardb9fc33c2020-08-13 11:47:36 +02001121 )
Tim Hall79d07d22020-04-27 18:20:16 +01001122
Tim Halle6ccd872020-11-09 16:46:37 +00001123 # Post-optimisation operator debug tracing
1124 for sg in nng.subgraphs:
1125 rewrite_graph.visit_graph_post_order(sg.output_tensors, arch, [], [_record_optimised])
1126
Tim Hall79d07d22020-04-27 18:20:16 +01001127 if verbose_graph:
1128 nng.print_graph()
1129 return nng
1130
Diego Russoea6111a2020-04-14 18:41:58 +01001131
Tim Hall79d07d22020-04-27 18:20:16 +01001132def optimise_graph_b(nng, arch, verbose_graph=False):
1133 if verbose_graph:
1134 nng.print_graph()
1135
1136 for idx, sg in enumerate(nng.subgraphs):
1137 # combined rewrite graph pass
Dwight Lidmanc6ac1942020-10-02 14:55:45 +02001138 nng.subgraphs[idx] = rewrite_graph.rewrite_graph_pre_order(
Dwight Lidman73320a42020-11-05 10:34:41 +01001139 nng, sg, arch, [fixup_unpack_output, fixup_stridedslice_output, rewrite_concat, rewrite_split], []
Dwight Lidmanc6ac1942020-10-02 14:55:45 +02001140 )
Tim Hall79d07d22020-04-27 18:20:16 +01001141
1142 if verbose_graph:
1143 nng.print_graph()
1144 return nng