blob: 26ee73c2d4e6ca4c99ae049d6cceadbfa79422d3 [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
23from . import rewrite_graph
Diego Russoea6111a2020-04-14 18:41:58 +010024from .data_type import DataType
Louis Verhaard7db78962020-05-25 15:05:26 +020025from .errors import UnsupportedFeatureError
Dwight Lidman42fed942020-05-29 09:37:03 +020026from .ethos_u55_regs.ethos_u55_regs import resampling_mode
Louis Verhaarde0ef2732020-06-03 08:56:44 +020027from .numeric_util import full_shape
Diego Russoe8a10452020-04-21 17:39:10 +010028from .operation import NpuBlockType
29from .operation import Operation
Fredrik Svedberga0c36242020-06-03 15:43:31 +020030from .softmax import SoftMax
Michael McGeaghc5b549b2020-08-07 11:54:28 +010031from .tensor import create_const_tensor
32from .tensor import create_reshape_tensor
Charles Xu9a03fdf2020-07-02 15:12:40 +020033from .tensor import QuantizationParameters
Diego Russoe8a10452020-04-21 17:39:10 +010034from .tensor import Tensor
Tim Hall79d07d22020-04-27 18:20:16 +010035
36passthrough_nodes = set(("Identity",))
37
38
39def remove_passthrough_tensor(tens, arch):
40 if len(tens.ops) == 1 and tens.ops[0].type in passthrough_nodes:
41 assert len(tens.ops[0].inputs) == 1
42 tens = tens.ops[0].inputs[0]
43 return tens
44
45
46def rewrite_concat(tens, arch):
47 if len(tens.ops) == 1 and tens.ops[0].is_concat_op():
48 concat_op = tens.ops[0]
49 if tens != concat_op.outputs[0]:
50 return tens # don't attempt to rewrite the min/max outputs of QuantizedConcat
51
52 # Not supported so leave it and run on CPU
53 if not concat_op.run_on_npu:
54 return tens
55
56 inputs, axis = concat_op.get_concat_inputs_axis()
57
58 tens.ops = []
59 offset = 0
60 for idx, inp in enumerate(inputs):
61 new_op = Operation("ConcatSliceWrite", concat_op.name + str(idx))
62 new_op.inputs = [inp]
63 new_op.outputs = [tens]
64 new_op.attrs["concat_axis"] = axis
65 new_op.attrs["concat_start"] = offset
66 offset += inp.shape[axis]
67 new_op.attrs["concat_end"] = offset
68 new_op.run_on_npu = True
69 tens.ops.append(new_op)
70 assert tens.shape[axis] == offset
71
Patrik Gustavsson29d568e2020-08-18 10:11:21 +020072 # If axis corresponds to C-dimension, NHCWB16 can only be used in the output if all the concat_start's are a
73 # multiple of 16. This as, it is only then the address offset for the ofm, for all operations, will be 16 byte
74 # 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 +020075 # and those addresses are always 16 byte aligned due to the NHCWB16 format.
Patrik Gustavsson29d568e2020-08-18 10:11:21 +020076 if axis == (len(tens.shape) - 1):
Patrik Gustavsson458a2082020-08-13 13:41:05 +020077 for op in tens.ops:
78 if op.attrs["concat_start"] % 16 != 0:
79 tens.avoid_NHCWB16 = True
80 break
81
Tim Hall79d07d22020-04-27 18:20:16 +010082 return tens
83
84
85def rewrite_split(tens, arch):
86
87 if len(tens.ops) == 1 and tens.ops[0].is_split_op():
88 split_op = tens.ops[0]
89
90 # Not supported so leave it and run on CPU
91 if not split_op.run_on_npu:
92 return tens
93
94 inp, outputs, axis, offset_start, offset_end = split_op.get_split_inputs_axis()
95
96 tens.ops = []
97 new_op = Operation("SplitSliceRead", split_op.name)
98 new_op.inputs = [inp]
Tim Hall79d07d22020-04-27 18:20:16 +010099
100 # For Split the offset cannot be extracted from the tensor so it has to
101 # be calculated from the index of the output tensor
Diego Russoea6111a2020-04-14 18:41:58 +0100102 if axis is not None:
Tim Hall79d07d22020-04-27 18:20:16 +0100103 # Get the start and end of the split
104 offset_start = [0] * len(tens.shape)
105 offset_end = [0] * len(tens.shape)
106 for out in outputs:
107 if out == tens:
108 break
109 offset_start[axis] += out.shape[axis]
110
Patrik Gustavssoneebb1c22020-08-18 15:03:04 +0200111 # If start offset is not a multiple of 16 in the C-dimension, NHCWB16 need to be avoided in the input
112 if (offset_start[-1] % 16) != 0:
113 inp.avoid_NHCWB16 = True
114
Tim Hall79d07d22020-04-27 18:20:16 +0100115 offset_end[axis] = offset_start[axis] + tens.shape[axis]
116
117 new_op.attrs["split_start"] = offset_start
118 new_op.attrs["split_end"] = offset_end
119 new_op.run_on_npu = True
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100120 new_op.set_output_tensor(tens)
Tim Hall79d07d22020-04-27 18:20:16 +0100121
122 return tens
123
124
125def needed_total_padding(input_size, stride, filter_size):
126 out_size = (input_size + stride - 1) // stride
127 needed_input = (out_size - 1) * stride + filter_size
128 total_padding = max(0, needed_input - input_size)
129 return total_padding
130
131
132def calc_padding_and_skirt(padding_type, kernel_size, stride, input_dims):
133 ypad = needed_total_padding(int(input_dims[1]), int(stride[1]), int(kernel_size[0]))
134 xpad = needed_total_padding(int(input_dims[2]), int(stride[2]), int(kernel_size[1]))
135 if padding_type == b"SAME":
136 left_pad = (xpad + 0) // 2
137 right_pad = (xpad + 1) // 2
138 top_pad = (ypad + 0) // 2
139 bottom_pad = (ypad + 1) // 2
140 elif padding_type == b"VALID":
141 left_pad = 0
142 right_pad = 0
143 top_pad = 0
144 bottom_pad = 0
145 else:
Louis Verhaard7db78962020-05-25 15:05:26 +0200146 raise UnsupportedFeatureError("Unknown padding {}".format(str(padding_type)))
Tim Hall79d07d22020-04-27 18:20:16 +0100147 padding = (top_pad, left_pad, bottom_pad, right_pad)
148 skirt = (top_pad, left_pad, ypad - top_pad, xpad - left_pad)
149 return padding, skirt
150
Tim Hallc30f4952020-06-15 20:47:35 +0100151
Jacob Bohlin9b64ba02020-07-07 17:15:22 +0200152def calc_upscaled_padding_and_skirt(padding_type, kernel_size, stride, input_dims, upscaling_factor):
153 kernel_height, kernel_width = kernel_size[0], kernel_size[1]
Jacob Bohlincf7da102020-05-20 09:03:40 +0200154 if padding_type == b"SAME":
Jacob Bohlin9b64ba02020-07-07 17:15:22 +0200155 ypad = needed_total_padding(int(input_dims[1]) * upscaling_factor, int(stride[1]), int(kernel_height))
156 xpad = needed_total_padding(int(input_dims[2]) * upscaling_factor, int(stride[2]), int(kernel_width))
157
158 right_pad = ((xpad + 1) // upscaling_factor) - 1
159 bottom_pad = ((ypad + 1) // upscaling_factor) - 1
160 left_pad = max(kernel_width - 1 - right_pad, 0)
161 top_pad = max(kernel_height - 1 - bottom_pad, 0)
162
Jacob Bohlincf7da102020-05-20 09:03:40 +0200163 elif padding_type == b"VALID":
Jacob Bohlin9b64ba02020-07-07 17:15:22 +0200164 right_pad = max(kernel_width - 2, 0)
165 bottom_pad = max(kernel_height - 2, 0)
166 left_pad = kernel_width - 1
167 top_pad = kernel_height - 1
Jacob Bohlincf7da102020-05-20 09:03:40 +0200168 else:
169 assert 0, "Unknown padding"
170
171 padding = (top_pad, left_pad, bottom_pad, right_pad)
Jacob Bohlin9b64ba02020-07-07 17:15:22 +0200172 skirt = padding
Jacob Bohlincf7da102020-05-20 09:03:40 +0200173 return padding, skirt
174
Tim Hall79d07d22020-04-27 18:20:16 +0100175
176def fixup_conv2d_backprop(op, arch):
177 if op.type == "Conv2DBackpropInput":
178 # flip the inputs
179 op.inputs[0], op.inputs[2] = op.inputs[2], op.inputs[0]
Jacob Bohlincf7da102020-05-20 09:03:40 +0200180 op.type = "Conv2DBackpropInputSwitchedBias"
181 weight_shape = op.inputs[1].shape
182 weight_sets = weight_shape[3]
183
184 if len(op.inputs) < 4:
185 # Add bias/scale tensor filled with zeros
Jacob Bohlincf7da102020-05-20 09:03:40 +0200186 scale_tens = Tensor([weight_sets], DataType.int32, op.name + "_bias_tens")
187 scale_tens.values = [0] * weight_sets
188 scale_tens.quant_values = [0] * weight_sets
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100189 scale_op = Operation("Const", op.name + "_bias")
190 scale_op.set_output_tensor(scale_tens)
191 op.add_input_tensor(scale_tens)
Jacob Bohlincf7da102020-05-20 09:03:40 +0200192
193 # Update strides
Tim Hallc30f4952020-06-15 20:47:35 +0100194 op.attrs.update({"stride_w": 1, "stride_h": 1, "strides": (1, 1, 1, 1)})
Tim Hall79d07d22020-04-27 18:20:16 +0100195
196 return op
197
198
Charles Xu9a03fdf2020-07-02 15:12:40 +0200199# Convert the op to an elementwise add
200def convert_resizebilinear_1x1_to_add(op):
201 op.type = "AddAct"
202 op.name = op.name + "_add"
203 op.attrs.update({"npu_block_type": NpuBlockType.ElementWise})
204 op.attrs["resizebilinear"] = True
205 # Create an input tensor filled with zeros
206 shape = op.outputs[0].shape
207 tens = Tensor(shape, op.inputs[0].dtype, op.inputs[1].name + "_add")
208 tens.values = np.zeros(shape)
209 tens.quant_values = np.zeros(shape, np.uint8)
210 tens.quantization = QuantizationParameters(0.0, 255.0)
211 tens.quantization.scale_f32 = 1.0
212 tens.quantization.zero_point = 0
213 tens.consumer_list = [op]
214 tens_op = op.inputs[1].ops[0]
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100215 tens_op.set_output_tensor(tens)
Charles Xu9a03fdf2020-07-02 15:12:40 +0200216 # Set the add inputs
217 op.inputs[1] = op.inputs[0]
218 op.inputs[0] = tens
219
220 return op
221
222
223def fixup_resizebilinear(op, arch):
224 if op.type == "ResizeBilinear":
225 if op.inputs[0].shape[1] == 1 and op.inputs[0].shape[2] == 1:
226 convert_resizebilinear_1x1_to_add(op)
Charles Xu36ffaf32020-08-05 15:40:44 +0200227 elif op.inputs[0].shape == op.outputs[0].shape:
228 # Bypass nop resizebilinear
229 op.inputs = op.inputs[:1]
230 op.type = "Identity"
Charles Xu9a03fdf2020-07-02 15:12:40 +0200231
232 return op
233
234
Tim Hall79d07d22020-04-27 18:20:16 +0100235def fixup_fully_connected_input(op, arch):
236 if op.type == "FullyConnectedAct":
237 inp = op.inputs[0]
238 weights = op.inputs[1]
239
240 n_in_elems = weights.shape[-2]
241 elms = inp.elements()
242 batch_size = elms // n_in_elems
243 assert batch_size * n_in_elems == elms
244
245 desired_shape = [batch_size, n_in_elems]
246 if inp.shape != desired_shape:
247 # mismatch, insert a reshape to fix this.
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100248 op.inputs[0] = create_reshape_tensor(inp, desired_shape)
Tim Hall79d07d22020-04-27 18:20:16 +0100249
250 return op
251
252
253def fixup_pack_input(op, arch):
254 if op.type == "Pack":
255 # Pack is also referred to as Stack
256 # Requires the rewrite_concat function to be called on the op afterwards
257 axis = int(op.attrs["axis"])
258 desired_shape = op.inputs[0].shape[:axis] + [1] + op.inputs[0].shape[axis:]
259
260 # Construct 1 shape tensor to be used by all inserted reshape ops
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100261 new_shape_tens = create_const_tensor(op.name + "_reshape_shape", [1], DataType.int32, desired_shape)
Tim Hall79d07d22020-04-27 18:20:16 +0100262
263 for idx, inp in enumerate(op.inputs):
Tim Hall79d07d22020-04-27 18:20:16 +0100264 reshape_out = inp.clone("_reshaped")
Michael McGeagh6a8d4242020-07-28 12:17:59 +0100265 reshape_out.set_all_shapes(desired_shape)
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100266
267 reshape_op = Operation("Reshape", "{}{}_reshape".format(op.name, idx))
268 reshape_op.attrs["new_shape"] = desired_shape
269 reshape_op.inputs = [inp, new_shape_tens]
270 reshape_op.set_output_tensor(reshape_out)
Tim Hall79d07d22020-04-27 18:20:16 +0100271
272 op.inputs[idx] = reshape_out
273
274 op.type = "PackReshaped"
275
276 return op
277
278
279def fixup_unpack_output(tens, arch):
280 op = tens.ops[0]
281 if op.type in set(("Unpack", "StridedSlice")):
282 # Unpack is also referred to as Unstack
283 # Requires the rewrite_split function to be called on the op afterwards
Patrik Gustavssoncf728902020-04-30 08:57:23 +0200284
285 reshape_input_shape = tens.shape
Tim Hall79d07d22020-04-27 18:20:16 +0100286 if op.type == "StridedSlice":
Patrik Gustavssoncf728902020-04-30 08:57:23 +0200287 new_axis_mask = op.attrs["new_axis_mask"]
Tim Hall79d07d22020-04-27 18:20:16 +0100288 shrink_axis_mask = op.attrs["shrink_axis_mask"]
Louis Verhaard7db78962020-05-25 15:05:26 +0200289 ellipsis_mask = op.attrs["ellipsis_mask"]
Patrik Gustavssoncf728902020-04-30 08:57:23 +0200290
291 if (new_axis_mask != 0 and shrink_axis_mask != 0) or ellipsis_mask != 0:
292 # Not supported, will be put on CPU
293 return tens
294 if shrink_axis_mask == 0 and new_axis_mask == 0:
Tim Hall79d07d22020-04-27 18:20:16 +0100295 # Equal Rank StridedSlice, no need to insert reshape
296 return tens
Patrik Gustavssoncf728902020-04-30 08:57:23 +0200297 elif shrink_axis_mask != 0:
298 n = 0
299 axis = 0
300 while shrink_axis_mask:
301 prev_mask = shrink_axis_mask
302 n += 1
303 shrink_axis_mask &= shrink_axis_mask - 1
304 axis = int(math.log2(prev_mask - shrink_axis_mask))
305 reshape_input_shape = reshape_input_shape[:axis] + [1] + reshape_input_shape[axis:]
Tim Hall79d07d22020-04-27 18:20:16 +0100306
Patrik Gustavssoncf728902020-04-30 08:57:23 +0200307 assert len(tens.shape) == (len(op.inputs[0].shape) - n)
308 op.attrs["shrink_axis_mask"] = 0
Tim Hall79d07d22020-04-27 18:20:16 +0100309
Patrik Gustavssoncf728902020-04-30 08:57:23 +0200310 elif new_axis_mask != 0:
311 n = 0
312 axis = 0
313 while new_axis_mask:
314 prev_mask = new_axis_mask
315 n += 1
316 new_axis_mask &= new_axis_mask - 1
317 axis = int(math.log2(prev_mask - new_axis_mask))
Louis Verhaard7db78962020-05-25 15:05:26 +0200318 reshape_input_shape = reshape_input_shape[:axis] + reshape_input_shape[(axis + 1) :]
Patrik Gustavssoncf728902020-04-30 08:57:23 +0200319 new_axis_mask >>= 1
320
321 assert len(tens.shape) == (len(op.inputs[0].shape) + n)
322 op.attrs["new_axis_mask"] = 0
Tim Hall79d07d22020-04-27 18:20:16 +0100323 else:
324 axis = int(op.attrs["axis"])
325 op.type = "UnpackReshaped"
Patrik Gustavssoncf728902020-04-30 08:57:23 +0200326 reshape_input_shape = tens.shape[:axis] + [1] + tens.shape[axis:]
Tim Hall79d07d22020-04-27 18:20:16 +0100327
328 # Construct 1 shape tensor to be used by all inserted reshape ops
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100329 new_shape_tens = create_const_tensor(op.name + "_reshape_shape", [1], DataType.int32, tens.shape)
Tim Hall79d07d22020-04-27 18:20:16 +0100330
331 for idx, out_tens in enumerate(op.outputs):
Tim Hall79d07d22020-04-27 18:20:16 +0100332 reshape_in = out_tens.clone("_reshaped")
Michael McGeagh6a8d4242020-07-28 12:17:59 +0100333 reshape_in.set_all_shapes(reshape_input_shape)
Tim Hall79d07d22020-04-27 18:20:16 +0100334 reshape_in.ops = [op]
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100335
336 reshape_op = Operation("Reshape", "{}{}_reshape".format(op.name, idx))
337 reshape_op.attrs["new_shape"] = reshape_input_shape
Tim Hall79d07d22020-04-27 18:20:16 +0100338 reshape_op.inputs = [reshape_in, new_shape_tens]
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100339 reshape_op.set_output_tensor(out_tens)
Tim Hall79d07d22020-04-27 18:20:16 +0100340
341 op.outputs[idx] = reshape_in
342
343 return tens
344
345
346def add_padding_fields(op, arch):
347 if "padding" in op.attrs:
348 if "Conv" in op.type:
349 kernel_size = op.inputs[1].shape[:2]
350 input_shape = op.inputs[0].shape
Fredrik Svedberga0c36242020-06-03 15:43:31 +0200351 elif "Pool" in op.type or op.type in ("ResizeBilinear", "ReduceSum"):
Tim Hall79d07d22020-04-27 18:20:16 +0100352 kernel_size = op.attrs["ksize"][1:3]
353 input_shape = op.inputs[0].shape
354 elif op.type == "ExtractImagePatches":
355 kernel_size = op.attrs["ksizes"][1:3]
356 input_shape = op.inputs[0].shape
357 else:
Louis Verhaard7db78962020-05-25 15:05:26 +0200358 raise UnsupportedFeatureError("Unknown operation that uses padding: {}".format(op.type))
Tim Hall79d07d22020-04-27 18:20:16 +0100359
Jacob Bohlincf7da102020-05-20 09:03:40 +0200360 if op.type == "Conv2DBackpropInputSwitchedBias":
Jacob Bohlin9b64ba02020-07-07 17:15:22 +0200361 upscaling_factor = op.outputs[0].shape[1] // input_shape[1]
Tim Hallc30f4952020-06-15 20:47:35 +0100362 padding, skirt = calc_upscaled_padding_and_skirt(
Jacob Bohlin9b64ba02020-07-07 17:15:22 +0200363 op.attrs["padding"], kernel_size, op.attrs["strides"], input_shape, upscaling_factor
Tim Hallc30f4952020-06-15 20:47:35 +0100364 )
Jacob Bohlincf7da102020-05-20 09:03:40 +0200365 else:
366 dilation_h, dilation_w = op.get_dilation_h_w()
367 dilated_kernel_size = [dilation_h * (kernel_size[0] - 1) + 1, dilation_w * (kernel_size[1] - 1) + 1]
Tim Hallc30f4952020-06-15 20:47:35 +0100368 padding, skirt = calc_padding_and_skirt(
369 op.attrs["padding"], dilated_kernel_size, op.attrs["strides"], input_shape
370 )
Jacob Bohlincf7da102020-05-20 09:03:40 +0200371
Tim Hall79d07d22020-04-27 18:20:16 +0100372 op.attrs["explicit_padding"] = padding
373 op.attrs["skirt"] = skirt
Jacob Bohlincf7da102020-05-20 09:03:40 +0200374
Tim Hall79d07d22020-04-27 18:20:16 +0100375 return op
376
377
Jacob Bohlincf7da102020-05-20 09:03:40 +0200378conv_op = set(("Conv2D", "QuantizedConv2D", "Conv2DBackpropInputSwitchedBias", "Conv2DBiasAct"))
Tim Hall79d07d22020-04-27 18:20:16 +0100379fc_op = set(
380 (
381 "MatMul",
382 "QuantizedMatMul",
383 "BlockLSTM",
384 "RnnAct",
385 "UnidirectionalSequenceRnnAct",
386 "BidirectionalSequenceRnnAct",
387 "LstmAct",
388 "UnidirectionalSequenceLstmAct",
389 "BidirectionalSequenceLstmAct",
390 "FullyConnectedAct",
391 )
392)
393depthwise_op = set(("DepthwiseConv2dNative", "DepthwiseConv2dBiasAct",))
Louis Verhaard7db78962020-05-25 15:05:26 +0200394pool_op = set(
Fredrik Svedberga0c36242020-06-03 15:43:31 +0200395 ("AvgPool", "MaxPool", "QuantizedAvgPool", "QuantizedMaxPool", "AvgPoolAct", "MaxPoolAct", "ResizeBilinear")
Louis Verhaard7db78962020-05-25 15:05:26 +0200396)
Fredrik Svedberga0c36242020-06-03 15:43:31 +0200397reduce_sum_ops = set(("ReduceSum",))
398elementwise_op = set(("AddAct", "MulAct", "SubAct", "Maximum", "Minimum", "LeakyRelu", "Abs", "CLZ", "SHL", "SHR"))
Charles Xu78792222020-05-13 10:15:26 +0200399binary_elementwise_op = set(("AddAct", "MulAct", "SubAct", "Maximum", "Minimum"))
Tim Hall79d07d22020-04-27 18:20:16 +0100400activation_ops = set(("Relu", "Relu6", "ReluN1To1", "Sigmoid", "Tanh"))
401memory_only_ops = set(("Reshape",))
402
Diego Russoea6111a2020-04-14 18:41:58 +0100403
Tim Hall79d07d22020-04-27 18:20:16 +0100404# Check if the op can be reordered
405def get_prepend_op(op):
406 inp = op.inputs[0]
407 # The op should be reordered between prev_op and prep_op
408 prev_op = inp.ops[-1]
409 prep_op = None
410 while prev_op.type in memory_only_ops and len(prev_op.outputs) == 1 and len(prev_op.outputs[0].consumers()) == 1:
411 prep_op = prev_op
412 inp = prev_op.inputs[0]
413 prev_op = inp.ops[-1]
Diego Russoea6111a2020-04-14 18:41:58 +0100414 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 +0100415 return prep_op
416
417 return None
418
419
420def mark_npu_block_type(op, arch):
421 npu_block_type = NpuBlockType.Default
422 if op.type in conv_op:
423 npu_block_type = NpuBlockType.ConvolutionMxN
424 elif op.type in fc_op:
425 npu_block_type = NpuBlockType.VectorProduct
426 elif op.type in depthwise_op:
427 npu_block_type = NpuBlockType.ConvolutionDepthWise
428 elif op.type in pool_op:
429 npu_block_type = NpuBlockType.Pooling
430 elif op.type in elementwise_op:
431 npu_block_type = NpuBlockType.ElementWise
Fredrik Svedberga0c36242020-06-03 15:43:31 +0200432 elif op.type in reduce_sum_ops:
433 npu_block_type = NpuBlockType.ReduceSum
Tim Hall79d07d22020-04-27 18:20:16 +0100434
435 op.attrs["npu_block_type"] = npu_block_type
436 return op
437
438
439def convert_depthwise_to_conv(op, arch):
440 # Depthwise is equivalent to a single conv2d if the ifm depth is 1 and
441 # the ofm depth equals the depth multipler.
442 # If those conditions are true, then we can perform a simple
443 # switch of the operator type (and weight order)
444
445 if ("DepthwiseConv2d" in op.type) and (op.attrs["depth_multiplier"] != 1):
446 ifm_tensor = op.inputs[0]
447 weight_tensor = op.inputs[1]
448 ofm_tensor = op.outputs[0]
449 if (ifm_tensor.shape[3] == 1) and (ofm_tensor.shape[3] == op.attrs["depth_multiplier"]):
450 # Change op type to Conv2d
451 op.type = op.type.replace("DepthwiseConv2d", "Conv2D")
452 del op.attrs["channel_multiplier"]
453 del op.attrs["depth_multiplier"]
454
455 weight_tensor.quant_values = np.transpose(weight_tensor.quant_values, (0, 1, 3, 2))
Michael McGeagh6a8d4242020-07-28 12:17:59 +0100456 weight_tensor.set_all_shapes(list(weight_tensor.quant_values.shape))
Tim Hall79d07d22020-04-27 18:20:16 +0100457 else:
Louis Verhaard7db78962020-05-25 15:05:26 +0200458 raise UnsupportedFeatureError(
459 "Unsupported DepthwiseConv2d with depth_multiplier = {}, ifm channels = {}, ofm channels = {}".format(
Tim Hall79d07d22020-04-27 18:20:16 +0100460 op.attrs["depth_multiplier"], ifm_tensor.shape[3], ofm_tensor.shape[3]
461 )
462 )
Tim Hall79d07d22020-04-27 18:20:16 +0100463 return op
464
465
Jacob Bohline843d332020-06-23 12:12:56 +0200466def reorder_depthwise_weights(op, arch):
467 if "DepthwiseConv2d" in op.type:
468 weight_tensor = op.inputs[1]
469 weight_tensor.quant_values = np.transpose(weight_tensor.quant_values, (0, 1, 3, 2))
Michael McGeagh6a8d4242020-07-28 12:17:59 +0100470 weight_tensor.set_all_shapes(list(weight_tensor.quant_values.shape))
Jacob Bohline843d332020-06-23 12:12:56 +0200471 weight_tensor.weight_transpose_depthwise = True
472
473 return op
474
475
Michael McGeagh8d939c02020-07-29 13:11:43 +0100476def convert_conv_to_fc(op, arch):
477 # Conv 1x1 can be equivalent to Fully Connected.
478 # By representing certain convs as fully connected layers, Vela can better determine wether or not to use
479 # caching/double buffering for the weights.
480 # (Weights dont need to be reloaded for convs when IFM H and W are 1)
481 if op.type == "Conv2DBiasAct":
482 _, h, w, _ = op.inputs[0].shape
483 kh, kw, _, _ = op.inputs[1].shape
484 if h == 1 and w == 1 and kh == 1 and kw == 1:
485 # Overwrite this op as a Fully Connected Op
486 op.name += "_fc"
487 op.type = "FullyConnectedAct"
488 faf = op.attrs.get("fused_activation_function", None)
489 op.attrs = {
490 "fused_activation_function": faf,
491 "weights_format": 0,
492 "npu_block_type": NpuBlockType.VectorProduct,
493 }
494 # Reshape Weights to be 2D. HWIO becomes just IO (as H and W are 1, they can just be dropped)
495 weight_tensor = op.inputs[1]
496 weight_tensor.quant_values = weight_tensor.quant_values.squeeze(axis=(0, 1))
497 weight_tensor.set_all_shapes(list(weight_tensor.quant_values.shape))
498 # The output from a fully connected is expected to be 2D so we need to add a reshape layer to convert it
499 # back to 4D afterwards as the next layer is expecting that shape
500 orig_ofm_tensor = op.outputs[0]
501 # 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})
502 fc_ofm_tensor = orig_ofm_tensor.clone("_fc")
503 fc_ofm_tensor.set_all_shapes([1, fc_ofm_tensor.shape[-1]])
504 fc_ofm_tensor.ops = [op]
505 # Add a reshape after the new OFM to convert it back to the original 4D shape
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100506 reshape_name = op.name + "_reshape"
507 new_shape_tens = create_const_tensor(reshape_name + "_shape", [1], DataType.int32, orig_ofm_tensor.shape)
Michael McGeagh8d939c02020-07-29 13:11:43 +0100508 reshape_op = Operation("Reshape", reshape_name)
Michael McGeagh8d939c02020-07-29 13:11:43 +0100509 reshape_op.attrs["new_shape"] = orig_ofm_tensor.shape
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100510 reshape_op.inputs = [fc_ofm_tensor, new_shape_tens]
511 reshape_op.set_output_tensor(orig_ofm_tensor)
Michael McGeagh8d939c02020-07-29 13:11:43 +0100512 # Replace this ops OFM to point to the 2D tensor
513 op.outputs[0] = fc_ofm_tensor
514 return op
515
516
Tim Hall79d07d22020-04-27 18:20:16 +0100517# Reorder activation op if it's after the memory only operations
518def fixup_act_reorder(op, arch):
519 if op.type in activation_ops:
520 prep_op = get_prepend_op(op)
Diego Russoea6111a2020-04-14 18:41:58 +0100521 if prep_op is not None:
Tim Hall79d07d22020-04-27 18:20:16 +0100522 act_op = op.clone("_reordered")
523 act_op.inputs = [prep_op.inputs[0]]
524 act_op_out = act_op.inputs[0].clone("_acted")
525 act_op_out.quantization = op.outputs[0].quantization.clone()
Michael McGeaghc5b549b2020-08-07 11:54:28 +0100526 act_op.set_output_tensor(act_op_out)
Tim Hall79d07d22020-04-27 18:20:16 +0100527 prep_op.inputs[0] = act_op_out
528 prep_op.outputs[0].quantization = act_op_out.quantization.clone()
529
530 # Mark the op so that it will be removed as passthrough later on
531 op.type = "Identity"
532 return op
533
Louis Verhaarde0ef2732020-06-03 08:56:44 +0200534
Charles Xu78792222020-05-13 10:15:26 +0200535def fixup_elementwise_with_scalars(op, arch):
536 if op.type in binary_elementwise_op:
Louis Verhaarde0ef2732020-06-03 08:56:44 +0200537 ifm_tensor, ifm2_tensor, _, _ = op.get_ifm_ifm2_weights_ofm()
Charles Xu78792222020-05-13 10:15:26 +0200538 if ifm2_tensor.shape != [] and ifm_tensor.shape != []:
539 diff = len(ifm_tensor.shape) - len(ifm2_tensor.shape)
540 if diff > 0:
541 ifm2_tensor.shape = full_shape(len(ifm_tensor.shape), ifm2_tensor.shape, 1)
542 elif diff < 0:
543 ifm_tensor.shape = full_shape(len(ifm2_tensor.shape), ifm_tensor.shape, 1)
Louis Verhaarde0ef2732020-06-03 08:56:44 +0200544 elif ifm_tensor.shape == [] and ifm_tensor.quant_values is None:
545 # IFM is marked as a scalar, but is a result of an operation; change it to a shape of size 1
546 ifm_tensor.shape = len(ifm2_tensor.shape) * [1]
547 ifm_tensor.storage_shape = ifm_tensor.shape
548 elif ifm2_tensor.shape == [] and ifm2_tensor.quant_values is None:
549 # IFM2 is marked as a scalar, but is a result of an operation; change it to a shape of size 1
550 ifm2_tensor.shape = len(ifm_tensor.shape) * [1]
551 ifm2_tensor.storage_shape = ifm2_tensor.shape
Charles Xu78792222020-05-13 10:15:26 +0200552 return op
Tim Hall79d07d22020-04-27 18:20:16 +0100553
Louis Verhaarde0ef2732020-06-03 08:56:44 +0200554
Tim Hall4e127762020-05-15 16:05:49 +0100555# Set input/output tensor equivalence to the same id for memory operations
556def set_tensor_equivalence(op, arch):
557 if op.type == "Reshape":
558 eid = op.outputs[0].equivalence_id
559 for inp in op.inputs:
560 inp.equivalence_id = eid
561 return op
562
563
Fredrik Svedberga0c36242020-06-03 15:43:31 +0200564def convert_softmax(op, arch):
565 if op.type == "Softmax" and op.run_on_npu:
566 softmax = SoftMax(op)
567 op = softmax.get_graph()
568 return op
569
570
Tim Hall79d07d22020-04-27 18:20:16 +0100571def convert_mul_max_to_abs_or_lrelu(op, arch):
Diego Russoea6111a2020-04-14 18:41:58 +0100572 r"""Whenever there is a subgraph with this topology:
Tim Hall79d07d22020-04-27 18:20:16 +0100573
574 Input X For X = -1 or X > 0
575 | \ / This subgraph can be replaced with either
576 | Mul an Abs (if X = -1) or a LeakyReLU (if X > 0)
577 | /
578 Max
579 """
580
581 if op.type == "Maximum":
582 # finds the Mul input(s) to the Max
583 muls = [i for i in op.inputs if i.ops[0].type == "MulAct"]
584 if len(muls) == 1:
585 mul = muls[0].ops[0]
586 elif len(muls) == 2:
587 # In the case both inputs are Muls, find the one with the same input as the Max
588 mul = [m for m in muls if len(set(op.inputs + m.ops[0].inputs)) == 1][0].ops[0]
589 else:
590 # No Mul inputs
591 return op
592
593 # make sure the Mul doesn't have any other consumers
594 if len(mul.outputs[0].consumers()) != 1:
595 return op
596 # make sure the Mul doesn't have a faf
597 if mul.attrs["fused_activation_function"]:
598 return op
599
600 # finds the branched input that goes to both the Max and the Mul
601 shared = set(op.inputs) & set(mul.inputs)
602 if len(shared) == 1:
603 shared_in = shared.pop()
604 # find the constant scalar input to the Mul
605 const_tens = (set(mul.inputs) - {shared_in}).pop()
606 # check that it is a scalar
607 if const_tens.shape != []:
608 return op
609 const = const_tens.ops[0]
610 # check that it is a constant
611 if const.type != "Const":
612 return op
613 else:
614 return op
615
616 val = const.outputs[0].values
617 if val >= 0:
618 new_op = "LeakyRelu"
619 op.attrs["alpha"] = val
620 elif val == -1:
621 new_op = "Abs"
622 else:
623 return op
624
625 op.type = op.type.replace("Maximum", new_op)
626 op.name = op.name.replace("Maximum", new_op)
627 op.outputs[0].name = op.outputs[0].name.replace("Maximum", new_op)
628 op.inputs = [shared_in]
629 return op
630
631
Dwight Lidman42fed942020-05-29 09:37:03 +0200632def add_attrs_to_resizebilinear(op, arch):
Tim Hallc30f4952020-06-15 20:47:35 +0100633 if op.type == "ResizeBilinear" and op.run_on_npu:
Dwight Lidman42fed942020-05-29 09:37:03 +0200634 input_tensor = op.inputs[0]
635 upscaled_shape = [input_tensor.shape[1] * 2, input_tensor.shape[2] * 2]
636 out_shape = op.outputs[0].shape[1:3]
637 if not op.attrs["align_corners"] and out_shape == upscaled_shape:
638 # this means the output is supposed to be a x2 upscale,
639 # so we need to do SAME padding
640 op.attrs["padding"] = b"SAME"
641 elif op.attrs["align_corners"] and out_shape == [upscaled_shape[0] - 1, upscaled_shape[1] - 1]:
642 # here we can just run the avg pool without padding and
643 # produce a (M * 2 - 1, N * 2 - 1) sized output
644 op.attrs["padding"] = b"VALID"
645 else:
Charles Xu9a03fdf2020-07-02 15:12:40 +0200646 return op
Dwight Lidman42fed942020-05-29 09:37:03 +0200647 input_tensor.resampling_mode = resampling_mode.NEAREST
Tim Hallc30f4952020-06-15 20:47:35 +0100648 op.attrs.update({"strides": (1, 1, 1, 1), "ksize": (1, 2, 2, 1)})
Dwight Lidman42fed942020-05-29 09:37:03 +0200649 return op
650
651
Tim Hall79d07d22020-04-27 18:20:16 +0100652def supported_operator_check(op, arch):
653 op.run_on_npu = arch.supported_operators.is_operator_supported(op)
654 return op
655
656
657def optimise_graph_a(nng, arch, verbose_graph=False):
658 if verbose_graph:
659 nng.print_graph()
660
661 op_rewrite_list = [
662 # mark block type and check if the operations are supported
663 mark_npu_block_type,
Tim Hall4e127762020-05-15 16:05:49 +0100664 set_tensor_equivalence,
Tim Hall79d07d22020-04-27 18:20:16 +0100665 supported_operator_check,
666 # then do any rewrites of supported operators
667 convert_depthwise_to_conv,
Michael McGeagh8d939c02020-07-29 13:11:43 +0100668 convert_conv_to_fc,
Fredrik Svedberga0c36242020-06-03 15:43:31 +0200669 convert_softmax,
Tim Hall79d07d22020-04-27 18:20:16 +0100670 fixup_fully_connected_input,
671 fixup_pack_input,
672 fixup_conv2d_backprop,
673 fixup_act_reorder,
Dwight Lidman42fed942020-05-29 09:37:03 +0200674 add_attrs_to_resizebilinear,
Tim Hall79d07d22020-04-27 18:20:16 +0100675 add_padding_fields,
676 mark_npu_block_type,
Charles Xu78792222020-05-13 10:15:26 +0200677 fixup_elementwise_with_scalars,
Jacob Bohline843d332020-06-23 12:12:56 +0200678 reorder_depthwise_weights,
Charles Xu9a03fdf2020-07-02 15:12:40 +0200679 fixup_resizebilinear,
Tim Hall79d07d22020-04-27 18:20:16 +0100680 # convert_mul_max_to_abs_or_lrelu # TODO: enable optimisation once quantisation issues are resolved
681 ]
682
683 for idx, sg in enumerate(nng.subgraphs):
684 # rewrite graph pass
685 nng.subgraphs[idx] = rewrite_graph.rewrite_graph_pre_order(
Diego Russoea6111a2020-04-14 18:41:58 +0100686 sg, arch, [fixup_unpack_output], op_rewrite_list, rewrite_unsupported=False
Tim Hall79d07d22020-04-27 18:20:16 +0100687 )
688
689 for idx, sg in enumerate(nng.subgraphs):
690 # remove passthrough tensors
Diego Russoea6111a2020-04-14 18:41:58 +0100691 nng.subgraphs[idx] = rewrite_graph.rewrite_graph_pre_order(sg, arch, [remove_passthrough_tensor], [])
Tim Hall79d07d22020-04-27 18:20:16 +0100692
693 if verbose_graph:
694 nng.print_graph()
695 return nng
696
Diego Russoea6111a2020-04-14 18:41:58 +0100697
Tim Hall79d07d22020-04-27 18:20:16 +0100698def optimise_graph_b(nng, arch, verbose_graph=False):
699 if verbose_graph:
700 nng.print_graph()
701
702 for idx, sg in enumerate(nng.subgraphs):
703 # combined rewrite graph pass
Diego Russoea6111a2020-04-14 18:41:58 +0100704 nng.subgraphs[idx] = rewrite_graph.rewrite_graph_pre_order(sg, arch, [rewrite_concat, rewrite_split], [])
Tim Hall79d07d22020-04-27 18:20:16 +0100705
706 if verbose_graph:
707 nng.print_graph()
708 return nng