/* Copyright 2015 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. ==============================================================================*/ #define EIGEN_USE_THREADS #if defined(__ARM_NEON__) || defined(__ARM_NEON) #define USE_NEON #include #endif #include "third_party/eigen3/unsupported/Eigen/CXX11/Tensor" #include "tensorflow/core/framework/numeric_op.h" #include "tensorflow/core/framework/op_kernel.h" #include "tensorflow/core/framework/register_types.h" #include "tensorflow/core/framework/tensor.h" #include "tensorflow/core/kernels/quantization_utils.h" #ifdef USE_NEON namespace { // Single pass mean and variance. // Shape of `input` is [rows x cols], shape of both `mean` and `variance` // is [cols]. // Note, `mean` and `variance` are of 'i' (not scaled). // The following is a straightforward implementation of the parallel algorithm // described in // https://en.wikipedia.org/wiki/Algorithms_for_calculating_variance#Parallel_algorithm void ColMeanAndVariance(const uint8_t* input, const uint32_t rows, const uint32_t cols, float* mean, float* variance) { // The implementation operates on for 16 columns at a time. // Assumes cols % 16 == 0 for (uint32_t col_offset = 0; col_offset < cols; col_offset += 16) { // Vector registers to track the running sum across the rows. Since there // are 16 columns, we have 4 32x4 registers. uint32x4_t sum[4] = {0}; float nA = 0.0f; // Running average and the second moment. float32x4_t xA[4] = {0.0f}; float32x4_t M2A[4] = {0.0f}; const uint8_t* inp_ptr = input + col_offset; // Go over the rows in chunks of 256. This is so that we can use 16 bit adds // to do the accumulation. for (uint32_t row = 0; row < rows; row += 256) { // Running sum and sum of squares for the 256 rows. uint32x4_t sub_sum[4] = {0}; uint32x4_t sub_sq_sum[4] = {0}; const uint32_t limit = std::min(rows, row + 256); const float nB = limit - row; for (uint32_t subrow = row; subrow < limit; ++subrow) { const uint8x16_t v = vld1q_u8(inp_ptr); inp_ptr += cols; const uint8x8_t v_high = vget_high_u8(v); const uint8x8_t v_low = vget_low_u8(v); const uint16x8_t v_high_u16 = vmovl_u8(v_high); const uint16x8_t v_low_u16 = vmovl_u8(v_low); const uint16x4_t v_high_high = vget_high_u16(v_high_u16); const uint16x4_t v_high_low = vget_low_u16(v_high_u16); const uint16x4_t v_low_high = vget_high_u16(v_low_u16); const uint16x4_t v_low_low = vget_low_u16(v_low_u16); sub_sum[0] = vaddw_u16(sub_sum[0], v_high_high); sub_sum[1] = vaddw_u16(sub_sum[1], v_high_low); sub_sum[2] = vaddw_u16(sub_sum[2], v_low_high); sub_sum[3] = vaddw_u16(sub_sum[3], v_low_low); sub_sq_sum[0] = vmlal_u16(sub_sq_sum[0], v_high_high, v_high_high); sub_sq_sum[1] = vmlal_u16(sub_sq_sum[1], v_high_low, v_high_low); sub_sq_sum[2] = vmlal_u16(sub_sq_sum[2], v_low_high, v_low_high); sub_sq_sum[3] = vmlal_u16(sub_sq_sum[3], v_low_low, v_low_low); } // Update the full running sum and moment from the ones for 256 rows. for (int i = 0; i < 4; ++i) { sum[i] = vaddq_u32(sum[i], sub_sum[i]); const float nX = nA + nB; // xB is the average of up to 256 elements. const float32x4_t xB = vmulq_n_f32(vcvtq_f32_u32(sub_sum[i]), 1.0f / nB); // delta = xB - xA const float32x4_t delta = vsubq_f32(xB, xA[i]); // xA = (nA * xA + nB * xB) / (nA + nB) xA[i] = vmulq_n_f32( vaddq_f32(vmulq_n_f32(xA[i], nA), vmulq_n_f32(xB, nB)), 1.0f / nX); const float32x4_t sub_sum_f32 = vcvtq_f32_u32(sub_sum[i]); const float32x4_t sub_sum_sq = vmulq_f32(sub_sum_f32, sub_sum_f32); // M2B = sum(xB^2) - sum(xB)^2/nB const float32x4_t M2B = vsubq_f32(vcvtq_f32_u32(sub_sq_sum[i]), vmulq_n_f32(sub_sum_sq, 1.0f / nB)); const float32x4_t last_term = vmulq_n_f32(vmulq_f32(delta, delta), nA * nB / nX); // M2A = oldM2A + M2B + delta^2 * nA*nB/nX M2A[i] = vaddq_f32(vaddq_f32(M2A[i], M2B), last_term); } nA += limit; } // Write the final mean and variance for the 16 columns. const float inv_rows = 1.0f / static_cast(rows); vst1q_f32(mean + col_offset, vmulq_n_f32(vcvtq_f32_u32(sum[3]), inv_rows)); vst1q_f32(mean + col_offset + 4, vmulq_n_f32(vcvtq_f32_u32(sum[2]), inv_rows)); vst1q_f32(mean + col_offset + 8, vmulq_n_f32(vcvtq_f32_u32(sum[1]), inv_rows)); vst1q_f32(mean + col_offset + 12, vmulq_n_f32(vcvtq_f32_u32(sum[0]), inv_rows)); vst1q_f32(variance + col_offset, vmulq_n_f32(M2A[3], inv_rows)); vst1q_f32(variance + col_offset + 4, vmulq_n_f32(M2A[2], inv_rows)); vst1q_f32(variance + col_offset + 8, vmulq_n_f32(M2A[1], inv_rows)); vst1q_f32(variance + col_offset + 12, vmulq_n_f32(M2A[0], inv_rows)); } } // Compute min and max of (input - mean) / sqrt(variance + epsilon). // This is done in a separate pass so that the normalized value can be // temporarily computed in floating point precision and not stored anywhere. void MinAndMax(const uint8_t* input, const uint32_t rows, const uint32_t cols, const float* mean_ptr, const float* variance_ptr, float variance_epsilon, float* minimum, float* maximum) { float v_maximum = std::numeric_limits::min(); float v_minimum = std::numeric_limits::max(); const float32x4_t eps = vdupq_n_f32(variance_epsilon); for (uint32_t col_offset = 0; col_offset < cols; col_offset += 16) { const float32x4_t mean[4] = {vld1q_f32(mean_ptr + col_offset), vld1q_f32(mean_ptr + col_offset + 4), vld1q_f32(mean_ptr + col_offset + 8), vld1q_f32(mean_ptr + col_offset + 12)}; const float32x4_t variance[4] = {vld1q_f32(variance_ptr + col_offset), vld1q_f32(variance_ptr + col_offset + 4), vld1q_f32(variance_ptr + col_offset + 8), vld1q_f32(variance_ptr + col_offset + 12)}; const float32x4_t inv_stddev[4] = { vrsqrteq_f32(vaddq_f32(variance[0], eps)), vrsqrteq_f32(vaddq_f32(variance[1], eps)), vrsqrteq_f32(vaddq_f32(variance[2], eps)), vrsqrteq_f32(vaddq_f32(variance[3], eps))}; const uint8_t* inp_ptr = input + col_offset; for (uint32_t row = 0; row < rows; ++row) { const uint8x16_t v = vld1q_u8(inp_ptr); inp_ptr += cols; const uint16x8_t v_high = vmovl_u8(vget_high_u8(v)); const uint16x8_t v_low = vmovl_u8(vget_low_u8(v)); const float32x4_t v_float[4] = { vcvtq_f32_u32(vmovl_u16(vget_high_u16(v_high))), vcvtq_f32_u32(vmovl_u16(vget_low_u16(v_high))), vcvtq_f32_u32(vmovl_u16(vget_high_u16(v_low))), vcvtq_f32_u32(vmovl_u16(vget_low_u16(v_low)))}; for (int i = 0; i < 4; ++i) { const float32x4_t normed = vmulq_f32(vsubq_f32(v_float[i], mean[i]), inv_stddev[i]); const float32x2_t high = vget_high_f32(normed); const float32x2_t low = vget_low_f32(normed); float32x2_t tmp_max = vpmax_f32(low, high); tmp_max = vpmax_f32(tmp_max, tmp_max); v_maximum = std::max(v_maximum, vget_lane_f32(tmp_max, 0)); float32x2_t tmp_min = vpmin_f32(low, high); tmp_min = vpmin_f32(tmp_min, tmp_min); v_minimum = std::min(v_minimum, vget_lane_f32(tmp_min, 0)); } } } *minimum = v_minimum; *maximum = v_maximum; } // Compute (input - mean) / sqrt(variance + epsilon) in floating point, quantize // it in the range (minimum, maximum) and store the result as quint8. void InstanceNorm(const uint8_t* input, const uint32_t rows, const uint32_t cols, const float* mean_ptr, const float* variance_ptr, float variance_epsilon, float minimum, float maximum, uint8_t* output) { const float32x4_t eps = vdupq_n_f32(variance_epsilon); const float32x4_t out_min = vdupq_n_f32(minimum); const float out_scale = 255.0f / (maximum - minimum); for (uint32_t col_offset = 0; col_offset < cols; col_offset += 16) { const float32x4_t mean[4] = {vld1q_f32(mean_ptr + col_offset + 12), vld1q_f32(mean_ptr + col_offset + 8), vld1q_f32(mean_ptr + col_offset + 4), vld1q_f32(mean_ptr + col_offset)}; const float32x4_t variance[4] = {vld1q_f32(variance_ptr + col_offset + 12), vld1q_f32(variance_ptr + col_offset + 8), vld1q_f32(variance_ptr + col_offset + 4), vld1q_f32(variance_ptr + col_offset)}; const float32x4_t inv_stddev[4] = { vrsqrteq_f32(vaddq_f32(variance[0], eps)), vrsqrteq_f32(vaddq_f32(variance[1], eps)), vrsqrteq_f32(vaddq_f32(variance[2], eps)), vrsqrteq_f32(vaddq_f32(variance[3], eps))}; const uint8_t* inp_ptr = input + col_offset; uint8_t* out_ptr = output + col_offset; for (uint32_t row = 0; row < rows; ++row) { const uint8x16_t v = vld1q_u8(inp_ptr); inp_ptr += cols; const uint16x8_t v_high = vmovl_u8(vget_high_u8(v)); const uint16x8_t v_low = vmovl_u8(vget_low_u8(v)); const float32x4_t v_float[4] = { vcvtq_f32_u32(vmovl_u16(vget_high_u16(v_high))), vcvtq_f32_u32(vmovl_u16(vget_low_u16(v_high))), vcvtq_f32_u32(vmovl_u16(vget_high_u16(v_low))), vcvtq_f32_u32(vmovl_u16(vget_low_u16(v_low)))}; uint16x4_t normed_uint16[4]; for (int i = 0; i < 4; ++i) { const float32x4_t normed = vmulq_f32(vsubq_f32(v_float[i], mean[i]), inv_stddev[i]); const int32x4_t normed_int32 = vcvtq_s32_f32(vmulq_n_f32(vsubq_f32(normed, out_min), out_scale)); normed_uint16[i] = vqmovun_s32(normed_int32); } vst1_u8(out_ptr, vqmovn_u16(vcombine_u16(normed_uint16[3], normed_uint16[2]))); vst1_u8(out_ptr + 8, vqmovn_u16(vcombine_u16(normed_uint16[1], normed_uint16[0]))); out_ptr += cols; } } } } // end namespace #endif // USE_NEON namespace tensorflow { typedef Eigen::ThreadPoolDevice CPUDevice; class QuantizedInstanceNorm : public OpKernel { public: explicit QuantizedInstanceNorm(OpKernelConstruction* context) : OpKernel(context) { OP_REQUIRES_OK(context, context->GetAttr("variance_epsilon", &variance_epsilon_)); OP_REQUIRES_OK(context, context->GetAttr("min_separation", &min_separation_)); OP_REQUIRES_OK( context, context->GetAttr("output_range_given", &output_range_given_)); if (output_range_given_) { OP_REQUIRES_OK(context, context->GetAttr("given_y_min", &given_y_min_)); OP_REQUIRES_OK(context, context->GetAttr("given_y_max", &given_y_max_)); OP_REQUIRES(context, given_y_min_ < given_y_max_, errors::InvalidArgument( "given_y_min must be less than given_y_max : ", given_y_min_, " >= ", given_y_max_)); } } void Compute(OpKernelContext* context) override { const Tensor& input = context->input(0); float input_min = context->input(1).flat()(0); float input_max = context->input(2).flat()(0); float input_scale = (input_max - input_min) / 255.0f; OP_REQUIRES(context, input_min < input_max, errors::InvalidArgument( "input_min must be less than input_max : ", input_min, " >= ", input_max)); auto input_tensor = input.tensor(); auto N = input_tensor.dimension(0); auto H = input_tensor.dimension(1); auto W = input_tensor.dimension(2); auto C = input_tensor.dimension(3); Tensor* output = nullptr; OP_REQUIRES_OK(context, context->allocate_output(0, input.shape(), &output)); Tensor* output_min = nullptr; OP_REQUIRES_OK(context, context->allocate_output(1, {}, &output_min)); Tensor* output_max = nullptr; OP_REQUIRES_OK(context, context->allocate_output(2, {}, &output_max)); typedef TTypes::Tensor::Index Index; #if defined(EIGEN_HAS_INDEX_LIST) const Eigen::IndexList, Eigen::type2index<2>> reduction_indices; Eigen::IndexList, Index, Index, Eigen::type2index<1>> broadcast_spec; broadcast_spec.set(1, H); broadcast_spec.set(2, W); Eigen::IndexList, Eigen::type2index<1>, Index> expand_spec; expand_spec.set(0, N); expand_spec.set(3, C); #else const Eigen::array reduction_indices{1, 2}; const Eigen::array broadcast_spec{1, H, W, 1}; const Eigen::array expand_spec{N, 1, 1, C}; #endif Eigen::Tensor float_mean(N, C); Eigen::Tensor float_variance(N, C); #ifdef USE_NEON if (N == 1 && (C % 16 == 0)) { VLOG(2) << "Calling optimized"; ColMeanAndVariance(reinterpret_cast(input_tensor.data()), H * W, C, float_mean.data(), float_variance.data()); float minimum = given_y_min_, maximum = given_y_max_; if (!output_range_given_) { MinAndMax(reinterpret_cast(input_tensor.data()), H * W, C, float_mean.data(), float_variance.data(), variance_epsilon_, &minimum, &maximum); } if (maximum - minimum < min_separation_) { maximum = minimum + min_separation_; } InstanceNorm(reinterpret_cast(input_tensor.data()), H * W, C, float_mean.data(), float_variance.data(), variance_epsilon_, minimum, maximum, reinterpret_cast(output->flat().data())); output_min->scalar()() = minimum; output_max->scalar()() = maximum; } else // NOLINT(readability/braces) #endif { VLOG(2) << "Calling unoptimized"; float_mean = input_tensor.cast().reduce( reduction_indices, Eigen::internal::MeanReducer()); float_variance = (input_scale * ((input_tensor.cast() - float_mean.reshape(expand_spec).broadcast(broadcast_spec)))) .square() .reduce(reduction_indices, Eigen::internal::MeanReducer()); Eigen::Tensor instance_normed = input_scale * (input_tensor.cast() - float_mean.reshape(expand_spec).broadcast(broadcast_spec)) * (float_variance + variance_epsilon_) .rsqrt() .reshape(expand_spec) .broadcast(broadcast_spec); Eigen::Tensor normed_min; Eigen::Tensor normed_max; if (!output_range_given_) { normed_min = instance_normed.minimum(); normed_max = instance_normed.maximum(); } else { normed_min() = given_y_min_; normed_max() = given_y_max_; } if (normed_max() - normed_min() < min_separation_) { normed_max() = normed_min() + min_separation_; } FloatToQuantizedStruct output_f2q(normed_min(), normed_max()); auto instance_normed_quantized = QUANTIZE_WITH_EIGEN(instance_normed, output_f2q, quint8); output->tensor().device( context->template eigen_device()) = instance_normed_quantized; output_min->flat()(0) = normed_min(); output_max->flat()(0) = normed_max(); } } private: float variance_epsilon_; float min_separation_; bool output_range_given_; float given_y_min_; float given_y_max_; }; REGISTER_KERNEL_BUILDER(Name("QuantizedInstanceNorm") .Device(DEVICE_CPU) .TypeConstraint("T"), QuantizedInstanceNorm); } // namespace tensorflow