boards/evkmimx8mq/demo_apps/hello_world_tflite/external/tensorflow/lite/kernels/internal/reference/integer_ops/conv.h - mcuxpresso_sdk - Git at Google

 /* Copyright 2019 The TensorFlow Authors. All Rights Reserved.

 Licensed under the Apache License, Version 2.0 (the "License");
 you may not use this file except in compliance with the License.
 You may obtain a copy of the License at

     http://www.apache.org/licenses/LICENSE-2.0

 Unless required by applicable law or agreed to in writing, software
 distributed under the License is distributed on an "AS IS" BASIS,
 WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 See the License for the specific language governing permissions and
 limitations under the License.
 ==============================================================================*/
 #ifndef TENSORFLOW_LITE_KERNELS_INTERNAL_REFERENCE_INTEGER_OPS_CONV_H_
 #define TENSORFLOW_LITE_KERNELS_INTERNAL_REFERENCE_INTEGER_OPS_CONV_H_

 #include "tensorflow/lite/kernels/internal/common.h"

 namespace tflite {
 namespace reference_integer_ops {

 // Fixed-point per-channel-quantization convolution reference kernel.
 inline void ConvPerChannel(
     const ConvParams& params, const int32* output_multiplier,
     const int32* output_shift, const RuntimeShape& input_shape,
     const int8* input_data, const RuntimeShape& filter_shape,
     const int8* filter_data, const RuntimeShape& bias_shape,
     const int32* bias_data, const RuntimeShape& output_shape,
     int8* output_data) {
   // Get parameters.
   const int32 input_offset = params.input_offset;  // r = s(q - Z)
   const int stride_width = params.stride_width;
   const int stride_height = params.stride_height;
   const int dilation_width_factor = params.dilation_width_factor;
   const int dilation_height_factor = params.dilation_height_factor;
   const int pad_width = params.padding_values.width;
   const int pad_height = params.padding_values.height;
   const int32 output_offset = params.output_offset;

   // Set min and max value of the output.
   const int32 output_activation_min = params.quantized_activation_min;
   const int32 output_activation_max = params.quantized_activation_max;

   // Sanity check.
   TFLITE_DCHECK_LE(output_activation_min, output_activation_max);
   TFLITE_DCHECK_EQ(input_shape.DimensionsCount(), 4);
   TFLITE_DCHECK_EQ(filter_shape.DimensionsCount(), 4);
   TFLITE_DCHECK_EQ(output_shape.DimensionsCount(), 4);
   const int batches = MatchingDim(input_shape, 0, output_shape, 0);
   const int input_depth = MatchingDim(input_shape, 3, filter_shape, 3);
   const int output_depth = MatchingDim(filter_shape, 0, output_shape, 3);
   if (bias_data) {
     TFLITE_DCHECK_EQ(bias_shape.FlatSize(), output_depth);
   }

   // Check dimensions of the tensors.
   const int input_height = input_shape.Dims(1);
   const int input_width = input_shape.Dims(2);
   const int filter_height = filter_shape.Dims(1);
   const int filter_width = filter_shape.Dims(2);
   const int output_height = output_shape.Dims(1);
   const int output_width = output_shape.Dims(2);
   for (int batch = 0; batch < batches; ++batch) {
     for (int out_y = 0; out_y < output_height; ++out_y) {
       for (int out_x = 0; out_x < output_width; ++out_x) {
         for (int out_channel = 0; out_channel < output_depth; ++out_channel) {
           const int in_x_origin = (out_x * stride_width) - pad_width;
           const int in_y_origin = (out_y * stride_height) - pad_height;
           int32 acc = 0;
           for (int filter_y = 0; filter_y < filter_height; ++filter_y) {
             for (int filter_x = 0; filter_x < filter_width; ++filter_x) {
               for (int in_channel = 0; in_channel < input_depth; ++in_channel) {
                 const int in_x = in_x_origin + dilation_width_factor * filter_x;
                 const int in_y =
                     in_y_origin + dilation_height_factor * filter_y;
                 // Zero padding by omitting the areas outside the image.
                 const bool is_point_inside_image =
                     (in_x >= 0) && (in_x < input_width) && (in_y >= 0) &&
                     (in_y < input_height);
                 if (is_point_inside_image) {
                   int32 input_val = input_data[Offset(input_shape, batch, in_y,
                                                       in_x, in_channel)];
                   int32 filter_val =
                       filter_data[Offset(filter_shape, out_channel, filter_y,
                                          filter_x, in_channel)];
                   // Accumulate with 32 bits accumulator.
                   // In the nudging process during model quantization, we force
                   // real value of 0.0 be represented by a quantized value. This
                   // guarantees that the input_offset is a int8, even though it
                   // is represented using int32.
                   // int32 += int8 * (int8 - int8) so the highest value we can
                   // get from each accumulation is [-127, 127] * ([-128, 127] -
                   // [-128, 127]), which is [-32512, 32512]. log2(32512)
                   // = 14.98, which means we can accumulate at least 2^16
                   // multiplications without overflow. The accumulator is
                   // applied to a filter so the accumulation logic will hold as
                   // long as the filter size (filter_y * filter_x * in_channel)
                   // does not exceed 2^16, which is the case in all the models
                   // we have seen so far.
                   // TODO(jianlijianli): Add a check to make sure the
                   // accumulator depth is smaller than 2^16.
                   acc += filter_val * (input_val + input_offset);
                 }
               }
             }
           }

           if (bias_data) {
             acc += bias_data[out_channel];
           }
           acc = MultiplyByQuantizedMultiplier(
               acc, output_multiplier[out_channel], output_shift[out_channel]);
           acc += output_offset;
           acc = std::max(acc, output_activation_min);
           acc = std::min(acc, output_activation_max);
           output_data[Offset(output_shape, batch, out_y, out_x, out_channel)] =
               static_cast<int8_t>(acc);
         }
       }
     }
   }
 }

 // Fixed-point per-channel-quantization convolution reference kernel.
 // 16-bit data and 8-bit filter
 inline void ConvPerChannel(
     const ConvParams& params, const int32* output_multiplier,
     const int32* output_shift, const RuntimeShape& input_shape,
     const int16* input_data, const RuntimeShape& filter_shape,
     const int8* filter_data, const RuntimeShape& bias_shape,
     const std::int64_t* bias_data, const RuntimeShape& output_shape,
     int16* output_data) {
   // Get parameters.
   const int stride_width = params.stride_width;
   const int stride_height = params.stride_height;
   const int dilation_width_factor = params.dilation_width_factor;
   const int dilation_height_factor = params.dilation_height_factor;
   const int pad_width = params.padding_values.width;
   const int pad_height = params.padding_values.height;

   // Set min and max value of the output.
   const int32 output_activation_min = params.quantized_activation_min;
   const int32 output_activation_max = params.quantized_activation_max;

   // Sanity check.
   TFLITE_DCHECK_LE(output_activation_min, output_activation_max);
   TFLITE_DCHECK_EQ(input_shape.DimensionsCount(), 4);
   TFLITE_DCHECK_EQ(filter_shape.DimensionsCount(), 4);
   TFLITE_DCHECK_EQ(output_shape.DimensionsCount(), 4);
   const int batches = MatchingDim(input_shape, 0, output_shape, 0);
   const int input_depth = MatchingDim(input_shape, 3, filter_shape, 3);
   const int output_depth = MatchingDim(filter_shape, 0, output_shape, 3);
   if (bias_data) {
     TFLITE_DCHECK_EQ(bias_shape.FlatSize(), output_depth);
   }

   // Check dimensions of the tensors.
   const int input_height = input_shape.Dims(1);
   const int input_width = input_shape.Dims(2);
   const int filter_height = filter_shape.Dims(1);
   const int filter_width = filter_shape.Dims(2);
   const int output_height = output_shape.Dims(1);
   const int output_width = output_shape.Dims(2);
   for (int batch = 0; batch < batches; ++batch) {
     for (int out_y = 0; out_y < output_height; ++out_y) {
       for (int out_x = 0; out_x < output_width; ++out_x) {
         for (int out_channel = 0; out_channel < output_depth; ++out_channel) {
           const int in_x_origin = (out_x * stride_width) - pad_width;
           const int in_y_origin = (out_y * stride_height) - pad_height;
           std::int64_t acc = 0;
           for (int filter_y = 0; filter_y < filter_height; ++filter_y) {
             for (int filter_x = 0; filter_x < filter_width; ++filter_x) {
               for (int in_channel = 0; in_channel < input_depth; ++in_channel) {
                 const int in_x = in_x_origin + dilation_width_factor * filter_x;
                 const int in_y =
                     in_y_origin + dilation_height_factor * filter_y;
                 // Zero padding by omitting the areas outside the image.
                 const bool is_point_inside_image =
                     (in_x >= 0) && (in_x < input_width) && (in_y >= 0) &&
                     (in_y < input_height);
                 if (is_point_inside_image) {
                   int32 input_val = input_data[Offset(input_shape, batch, in_y,
                                                       in_x, in_channel)];
                   int32 filter_val =
                       filter_data[Offset(filter_shape, out_channel, filter_y,
                                          filter_x, in_channel)];
                   // Accumulate with 64 bits accumulator.
                   // int64 += int8 * int16 so the highest value we can
                   // get from each accumulation is [-127, 127] * ([-32768,
                   // 32767] -
                   // [-32768, 32767]), which is [-8322945, 8322945].
                   // log2(8322945) = 22.99.
                   acc += filter_val * input_val;
                 }
               }
             }
           }
           if (bias_data) {
             acc += bias_data[out_channel];
           }
           int32_t scaled_acc = MultiplyByQuantizedMultiplier(
               acc, output_multiplier[out_channel], output_shift[out_channel]);
           scaled_acc = std::max(scaled_acc, output_activation_min);
           scaled_acc = std::min(scaled_acc, output_activation_max);
           output_data[Offset(output_shape, batch, out_y, out_x, out_channel)] =
               static_cast<int16_t>(scaled_acc);
         }
       }
     }
   }
 }

 }  // namespace reference_integer_ops
 }  // namespace tflite

 #endif  // TENSORFLOW_LITE_KERNELS_INTERNAL_REFERENCE_INTEGER_OPS_CONV_H_
	/* Copyright 2019 The TensorFlow Authors. All Rights Reserved.

	Licensed under the Apache License, Version 2.0 (the "License");
	you may not use this file except in compliance with the License.
	You may obtain a copy of the License at

	http://www.apache.org/licenses/LICENSE-2.0

	Unless required by applicable law or agreed to in writing, software
	distributed under the License is distributed on an "AS IS" BASIS,
	WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
	See the License for the specific language governing permissions and
	limitations under the License.
	==============================================================================*/
	#ifndef TENSORFLOW_LITE_KERNELS_INTERNAL_REFERENCE_INTEGER_OPS_CONV_H_
	#define TENSORFLOW_LITE_KERNELS_INTERNAL_REFERENCE_INTEGER_OPS_CONV_H_

	#include "tensorflow/lite/kernels/internal/common.h"

	namespace tflite {
	namespace reference_integer_ops {

	// Fixed-point per-channel-quantization convolution reference kernel.
	inline void ConvPerChannel(
	const ConvParams& params, const int32* output_multiplier,
	const int32* output_shift, const RuntimeShape& input_shape,
	const int8* input_data, const RuntimeShape& filter_shape,
	const int8* filter_data, const RuntimeShape& bias_shape,
	const int32* bias_data, const RuntimeShape& output_shape,
	int8* output_data) {
	// Get parameters.
	const int32 input_offset = params.input_offset; // r = s(q - Z)
	const int stride_width = params.stride_width;
	const int stride_height = params.stride_height;
	const int dilation_width_factor = params.dilation_width_factor;
	const int dilation_height_factor = params.dilation_height_factor;
	const int pad_width = params.padding_values.width;
	const int pad_height = params.padding_values.height;
	const int32 output_offset = params.output_offset;

	// Set min and max value of the output.
	const int32 output_activation_min = params.quantized_activation_min;
	const int32 output_activation_max = params.quantized_activation_max;

	// Sanity check.
	TFLITE_DCHECK_LE(output_activation_min, output_activation_max);
	TFLITE_DCHECK_EQ(input_shape.DimensionsCount(), 4);
	TFLITE_DCHECK_EQ(filter_shape.DimensionsCount(), 4);
	TFLITE_DCHECK_EQ(output_shape.DimensionsCount(), 4);
	const int batches = MatchingDim(input_shape, 0, output_shape, 0);
	const int input_depth = MatchingDim(input_shape, 3, filter_shape, 3);
	const int output_depth = MatchingDim(filter_shape, 0, output_shape, 3);
	if (bias_data) {
	TFLITE_DCHECK_EQ(bias_shape.FlatSize(), output_depth);
	}

	// Check dimensions of the tensors.
	const int input_height = input_shape.Dims(1);
	const int input_width = input_shape.Dims(2);
	const int filter_height = filter_shape.Dims(1);
	const int filter_width = filter_shape.Dims(2);
	const int output_height = output_shape.Dims(1);
	const int output_width = output_shape.Dims(2);
	for (int batch = 0; batch < batches; ++batch) {
	for (int out_y = 0; out_y < output_height; ++out_y) {
	for (int out_x = 0; out_x < output_width; ++out_x) {
	for (int out_channel = 0; out_channel < output_depth; ++out_channel) {
	const int in_x_origin = (out_x * stride_width) - pad_width;
	const int in_y_origin = (out_y * stride_height) - pad_height;
	int32 acc = 0;
	for (int filter_y = 0; filter_y < filter_height; ++filter_y) {
	for (int filter_x = 0; filter_x < filter_width; ++filter_x) {
	for (int in_channel = 0; in_channel < input_depth; ++in_channel) {
	const int in_x = in_x_origin + dilation_width_factor * filter_x;
	const int in_y =
	in_y_origin + dilation_height_factor * filter_y;
	// Zero padding by omitting the areas outside the image.
	const bool is_point_inside_image =
	(in_x >= 0) && (in_x < input_width) && (in_y >= 0) &&
	(in_y < input_height);
	if (is_point_inside_image) {
	int32 input_val = input_data[Offset(input_shape, batch, in_y,
	in_x, in_channel)];
	int32 filter_val =
	filter_data[Offset(filter_shape, out_channel, filter_y,
	filter_x, in_channel)];
	// Accumulate with 32 bits accumulator.
	// In the nudging process during model quantization, we force
	// real value of 0.0 be represented by a quantized value. This
	// guarantees that the input_offset is a int8, even though it
	// is represented using int32.
	// int32 += int8 * (int8 - int8) so the highest value we can
	// get from each accumulation is [-127, 127] * ([-128, 127] -
	// [-128, 127]), which is [-32512, 32512]. log2(32512)
	// = 14.98, which means we can accumulate at least 2^16
	// multiplications without overflow. The accumulator is
	// applied to a filter so the accumulation logic will hold as
	// long as the filter size (filter_y * filter_x * in_channel)
	// does not exceed 2^16, which is the case in all the models
	// we have seen so far.
	// TODO(jianlijianli): Add a check to make sure the
	// accumulator depth is smaller than 2^16.
	acc += filter_val * (input_val + input_offset);
	}
	}
	}
	}

	if (bias_data) {
	acc += bias_data[out_channel];
	}
	acc = MultiplyByQuantizedMultiplier(
	acc, output_multiplier[out_channel], output_shift[out_channel]);
	acc += output_offset;
	acc = std::max(acc, output_activation_min);
	acc = std::min(acc, output_activation_max);
	output_data[Offset(output_shape, batch, out_y, out_x, out_channel)] =
	static_cast<int8_t>(acc);
	}
	}
	}
	}
	}

	// Fixed-point per-channel-quantization convolution reference kernel.
	// 16-bit data and 8-bit filter
	inline void ConvPerChannel(
	const ConvParams& params, const int32* output_multiplier,
	const int32* output_shift, const RuntimeShape& input_shape,
	const int16* input_data, const RuntimeShape& filter_shape,
	const int8* filter_data, const RuntimeShape& bias_shape,
	const std::int64_t* bias_data, const RuntimeShape& output_shape,
	int16* output_data) {
	// Get parameters.
	const int stride_width = params.stride_width;
	const int stride_height = params.stride_height;
	const int dilation_width_factor = params.dilation_width_factor;
	const int dilation_height_factor = params.dilation_height_factor;
	const int pad_width = params.padding_values.width;
	const int pad_height = params.padding_values.height;

	// Set min and max value of the output.
	const int32 output_activation_min = params.quantized_activation_min;
	const int32 output_activation_max = params.quantized_activation_max;

	// Sanity check.
	TFLITE_DCHECK_LE(output_activation_min, output_activation_max);
	TFLITE_DCHECK_EQ(input_shape.DimensionsCount(), 4);
	TFLITE_DCHECK_EQ(filter_shape.DimensionsCount(), 4);
	TFLITE_DCHECK_EQ(output_shape.DimensionsCount(), 4);
	const int batches = MatchingDim(input_shape, 0, output_shape, 0);
	const int input_depth = MatchingDim(input_shape, 3, filter_shape, 3);
	const int output_depth = MatchingDim(filter_shape, 0, output_shape, 3);
	if (bias_data) {
	TFLITE_DCHECK_EQ(bias_shape.FlatSize(), output_depth);
	}

	// Check dimensions of the tensors.
	const int input_height = input_shape.Dims(1);
	const int input_width = input_shape.Dims(2);
	const int filter_height = filter_shape.Dims(1);
	const int filter_width = filter_shape.Dims(2);
	const int output_height = output_shape.Dims(1);
	const int output_width = output_shape.Dims(2);
	for (int batch = 0; batch < batches; ++batch) {
	for (int out_y = 0; out_y < output_height; ++out_y) {
	for (int out_x = 0; out_x < output_width; ++out_x) {
	for (int out_channel = 0; out_channel < output_depth; ++out_channel) {
	const int in_x_origin = (out_x * stride_width) - pad_width;
	const int in_y_origin = (out_y * stride_height) - pad_height;
	std::int64_t acc = 0;
	for (int filter_y = 0; filter_y < filter_height; ++filter_y) {
	for (int filter_x = 0; filter_x < filter_width; ++filter_x) {
	for (int in_channel = 0; in_channel < input_depth; ++in_channel) {
	const int in_x = in_x_origin + dilation_width_factor * filter_x;
	const int in_y =
	in_y_origin + dilation_height_factor * filter_y;
	// Zero padding by omitting the areas outside the image.
	const bool is_point_inside_image =
	(in_x >= 0) && (in_x < input_width) && (in_y >= 0) &&
	(in_y < input_height);
	if (is_point_inside_image) {
	int32 input_val = input_data[Offset(input_shape, batch, in_y,
	in_x, in_channel)];
	int32 filter_val =
	filter_data[Offset(filter_shape, out_channel, filter_y,
	filter_x, in_channel)];
	// Accumulate with 64 bits accumulator.
	// int64 += int8 * int16 so the highest value we can
	// get from each accumulation is [-127, 127] * ([-32768,
	// 32767] -
	// [-32768, 32767]), which is [-8322945, 8322945].
	// log2(8322945) = 22.99.
	acc += filter_val * input_val;
	}
	}
	}
	}
	if (bias_data) {
	acc += bias_data[out_channel];
	}
	int32_t scaled_acc = MultiplyByQuantizedMultiplier(
	acc, output_multiplier[out_channel], output_shift[out_channel]);
	scaled_acc = std::max(scaled_acc, output_activation_min);
	scaled_acc = std::min(scaled_acc, output_activation_max);
	output_data[Offset(output_shape, batch, out_y, out_x, out_channel)] =
	static_cast<int16_t>(scaled_acc);
	}
	}
	}
	}
	}

	} // namespace reference_integer_ops
	} // namespace tflite

	#endif // TENSORFLOW_LITE_KERNELS_INTERNAL_REFERENCE_INTEGER_OPS_CONV_H_