// Copyright (c) 2022 PaddlePaddle 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. #pragma once // CUDA, XPU and HIP use same api #if defined(PADDLE_WITH_CUDA) || defined(PADDLE_WITH_HIP) || \ defined(PADDLE_WITH_XPU_KP) #include #include #include #include #include #ifdef __NVCC__ #include "cub/cub.cuh" #endif #ifdef __HIPCC__ #include namespace cub = hipcub; #endif #ifndef PADDLE_WITH_XPU_KP #include "paddle/fluid/platform/device/gpu/gpu_device_function.h" #include "paddle/fluid/platform/device/gpu/gpu_launch_config.h" #include "paddle/phi/backends/gpu/gpu_context.h" #include "paddle/phi/backends/gpu/gpu_info.h" #endif #include "paddle/phi/api/ext/dispatch.h" #include "paddle/phi/core/dense_tensor.h" #include "paddle/phi/core/enforce.h" #include "paddle/phi/core/utils/array.h" #include "paddle/phi/kernels/cast_kernel.h" #include "paddle/phi/kernels/empty_kernel.h" #include "paddle/phi/kernels/funcs/elementwise_base.h" #include "paddle/phi/kernels/primitive/kernel_primitives.h" #include "paddle/utils/string/string_helper.h" // Reduce split or not, Whether to use ReduceHigherDim #define REDUCE_SPLIT_BOUNDARY 512 #define REDUCE_VEC_SIZE 4 namespace kps = phi::kps; #ifdef PADDLE_WITH_XPU_KP using dim3 = phi::kps::dim3; #endif namespace phi { namespace funcs { namespace details { static inline int GetLastPow2(int n) { n |= (n >> 1); n |= (n >> 2); n |= (n >> 4); n |= (n >> 8); n |= (n >> 16); return std::max(1, n - (n >> 1)); } static inline int64_t AlignUp(int64_t a, int64_t b) { return (a + b - 1) / b; } // get strides of x_dim, reduce_dim and left_dim for reduceLastDim and reduceAny static inline std::vector GetDimStrides(const std::vector& dims, const std::vector& idx) { int n = static_cast(idx.size()); if (n == 0) return std::vector(); std::vector strides(n); strides.back() = 1; for (int i = n - 2; i >= 0; --i) { strides[i] = strides[i + 1] * dims[idx[i + 1]]; } return strides; } #ifndef PADDLE_WITH_XPU_KP // get blockDim for reduceLastDim and reduceAny static inline int GetBlockDim(int block_dim) { return block_dim >= kps::details::kReduceMaxThread ? kps::details::kReduceMaxThread : GetLastPow2(block_dim); } #endif // check reduce rand is valid static inline void CheckReduceRank(int reduce_rank, int rank) { if (rank % 2 == 0) { PADDLE_ENFORCE_EQ(reduce_rank, rank / 2, phi::errors::InvalidArgument( "ReduceOp: invalid reduce rank. When rank = %d, " "reduce_rank must be %d, but got %d.", rank, rank / 2, reduce_rank)); } else { auto lower_rank = (rank - 1) / 2; auto upper_rank = (rank + 1) / 2; PADDLE_ENFORCE_EQ( reduce_rank == lower_rank || reduce_rank == upper_rank, true, phi::errors::InvalidArgument( "ReduceOp: invalid reduce rank. When rank = %d, reduce_rank " "must be %d or %d, but got %d.", rank, lower_rank, upper_rank, reduce_rank)); } } // convert dims from vector to array template static inline phi::Array VectorToArray( const VectorLikeType& vec) { PADDLE_ENFORCE_LE( vec.size(), ElementCount, phi::errors::InvalidArgument("Cub reduce Array: size not match. Received " "vec.size() %d > ElementCount %d.", vec.size(), ElementCount)); size_t n = static_cast(vec.size()); phi::Array ret; for (size_t i = 0; i < n; ++i) { ret[i] = vec[i]; } return ret; } static inline std::vector GetReduceDim(const std::vector& dims, int dim_size, bool reduce_all) { std::vector reduce_dims; if (reduce_all) { reduce_dims.resize(dim_size); int reduce_size = reduce_dims.size(); for (int i = 0; i < reduce_size; ++i) { reduce_dims[i] = i; } } else { for (auto e : dims) { PADDLE_ENFORCE_LT(e, dim_size, phi::errors::InvalidArgument( "ReduceOp: invalid axis, when x_dims is %d, " "axis[i] should less than x_dims, but got %d.", dim_size, e)); reduce_dims.push_back(e >= 0 ? e : e + dim_size); } } return reduce_dims; } } // namespace details constexpr int kMaxRank = phi::DDim::kMaxRank; enum ReduceType { kReduceLastDim = 0x01, // when reduce_dim[0] == x_dim.size() - 1; kReduceHigherDim = 0x02, // ReduceFirstDim or reduceSecondDim kReduceAny = 0x03, // when reduce_dim.size() > 1 }; struct IndexCalculator { IndexCalculator(int dim, const std::vector& cal_dims, const std::vector& cal_strides, const std::vector& full_strides) : dim(dim) { dims = details::VectorToArray(cal_dims); strides = details::VectorToArray(full_strides); reduce_strides = details::VectorToArray(cal_strides); #ifndef PADDLE_WITH_XPU_KP std::vector cal_divmoders; // fast divmod for (auto i : cal_strides) { cal_divmoders.push_back(kps::details::FastDivMod(i)); } divmoders = details::VectorToArray( cal_divmoders); #endif } __device__ inline int operator()(int offset) const { #ifdef PADDLE_WITH_XPU_KP int index = 0; #pragma unroll for (int i = 0; i < kMaxRank; ++i) { if (i == dim) { break; } index += (offset / reduce_strides[i]) * strides[dims[i]]; offset = offset % reduce_strides[i]; } return index; #else int index = 0; #pragma unroll for (int i = 0; i < kMaxRank; ++i) { if (i == dim) { break; } auto divmod = divmoders[i].Divmod(offset); index += (divmod.val[0] * strides[dims[i]]); offset = divmod.val[1]; } return index; #endif } int dim; phi::Array dims; phi::Array strides; phi::Array reduce_strides; #ifndef PADDLE_WITH_XPU_KP phi::Array divmoders; #endif }; template struct ReduceIndexMapping { const kps::DimConfig dim; HOSTDEVICE explicit ReduceIndexMapping(const kps::DimConfig& dims) : dim(dims) {} #ifdef PADDLE_WITH_XPU_KP __device__ __forceinline__ int BlockIdX() { if (ReduceLastDim) { return (cluster_id() / dim.split_num_x % dim.split_num_y); } else { return cluster_id() % dim.split_num_x; } } __device__ __forceinline__ int BlockIdY() { if (ReduceLastDim) { return (cluster_id() % dim.split_num_x); } else { return (cluster_id() / dim.split_num_x % dim.split_num_y); } } __device__ __forceinline__ int BlockDimX() { return dim.deal_size_x; } __device__ __forceinline__ int BlockDimY() { return 1; } __device__ __forceinline__ int GridDimX() { if (ReduceLastDim) { return dim.split_num_y; } else { return dim.split_num_x; } } __device__ __forceinline__ int GridDimY() { if (ReduceLastDim) { return dim.split_num_x; } else { return dim.split_num_y; } } __device__ __forceinline__ int GetLoopSize() { if (ReduceLastDim) { return dim.deal_size_y; } else { return dim.deal_size_x; } } #else __device__ __forceinline__ int BlockIdX() { return blockIdx.x; } __device__ __forceinline__ int BlockIdY() { return blockIdx.y; } __device__ __forceinline__ int BlockDimX() { return blockDim.x; } __device__ __forceinline__ int BlockDimY() { return blockDim.y; } __device__ __forceinline__ int GridDimX() { return gridDim.x; } __device__ __forceinline__ int GridDimY() { return gridDim.y; } __device__ int GetLoopSize() { return 1; } #endif }; // when reduce_type == kReduceLastDim this struct will be used // for higher performance struct OneDimIndexCal { explicit OneDimIndexCal(int num) : stride(num) {} __device__ inline int operator()(int index) const { return index * stride; } int stride; }; // reduce config template struct ReduceConfig { ReduceConfig(const std::vector& origin_reduce_dims, const std::vector& origin_x_dim) : reduce_dims_origin(origin_reduce_dims), x_dim(origin_x_dim) {} // get the parameters of reduceKernel void Run(const KPDevice& dev_ctx) { // step1: update the reduce_dim left_dim and x_dim SetReduceDim(); // step2: get the strides of dim for reduceAny and reduceLastDim SetStrides(); // step3: get the type of reduce SetReduceType(); // step4: set the block and grid for launch kernel SetBlockDim(); #ifndef PADDLE_WITH_XPU_KP // step5: limit the grid to prevent thead overflow paddle::platform::LimitGridDim(dev_ctx, &grid); #endif } // when should_reduce_again is true, we need malloc temp space for temp data void SetOutputData(Ty* y_data, const KPDevice& dev_ctx, phi::DenseTensor* tmp) { if (should_reduce_again) { tmp->Resize(phi::make_ddim( {static_cast(left_num * grid.z * grid.y * sizeof(Ty))})); output_data = dev_ctx.Alloc(tmp); } else { output_data = y_data; } } private: // set reduce_dim, left_dim and update x_dim // eg: x_dim = [2, 4, 6] origin_reduce_dims = [0, 1] // --SetReduceDim--> x_dim = [8,6], reduce_dim = [0], left_dim = [1] void SetReduceDim() { std::set reduce_set; for (auto e : reduce_dims_origin) { auto pos = e >= 0 ? e : e + x_dim.size(); reduce_set.insert(pos); } std::vector reduce_dim_temp(reduce_set.begin(), reduce_set.end()); std::sort(reduce_dim_temp.begin(), reduce_dim_temp.end()); // update reduce_dim and x_dim std::vector x_new_dim; reduce_dim.push_back(reduce_dim_temp[0]); x_new_dim.push_back(x_dim[0]); int idx_reduce = 1; int num = 0; if (reduce_dim_temp.size() > 1) { for (int i = 1; i < x_dim.size(); i++) { if ((idx_reduce < reduce_dim_temp.size()) && (i == reduce_dim_temp[idx_reduce])) { int result = reduce_dim_temp[idx_reduce] - reduce_dim[reduce_dim.size() - 1]; bool is_equal = ((result - num) == 1); if (is_equal) { x_new_dim[x_new_dim.size() - 1] *= x_dim[i]; num++; } else { reduce_dim.push_back(reduce_dim_temp[idx_reduce] - num); x_new_dim.push_back(x_dim[i]); } idx_reduce++; } else { x_new_dim.push_back(x_dim[i]); } } } else { x_new_dim = x_dim; } // update x_dim x_dim = x_new_dim; std::vector().swap(x_new_dim); std::vector reduce_dim_new; int is_reduced = 0; for (auto e : reduce_dim) { is_reduced |= 1 << e; } std::vector().swap(reduce_dim); for (int i = 0; i < x_dim.size(); i++) { if ((i == 0) || (((is_reduced >> i) ^ (is_reduced >> (i - 1))) & 1)) { x_new_dim.push_back(x_dim[i]); if ((is_reduced >> i) & 1) reduce_dim_new.push_back(x_new_dim.size() - 1); } else { x_new_dim[x_new_dim.size() - 1] *= x_dim[i]; } } x_dim = x_new_dim; reduce_dim = reduce_dim_new; int x_rank = static_cast(x_dim.size()); std::set left_set; for (int i = 0; i < x_rank; ++i) { left_set.insert(i); } for (auto e : reduce_dim) { left_set.erase(e); } left_dim.assign(left_set.begin(), left_set.end()); // if the last dim gets involved in reduction reduce_last_dim = (reduce_dim.back() == x_dim.size() - 1); } // set x_strides, reduce_strides, left_strides for reduceLastDim and reduceAny // eg: x_dim = [8, 6], reduce_dim = [0], left_dim = [1] // --SetStrides--> x_strides= [6,1], reduce_strides = [1], // left_strides = [1] void SetStrides() { std::vector idx_dim; for (int i = 0; i < x_dim.size(); i++) { idx_dim.push_back(i); } x_strides = details::GetDimStrides(x_dim, idx_dim); reduce_strides = details::GetDimStrides(x_dim, reduce_dim); left_strides = details::GetDimStrides(x_dim, left_dim); reduce_num = reduce_strides[0] * x_dim[reduce_dim[0]]; left_num = 1; if (left_dim.size()) { left_num = left_strides[0] * x_dim[left_dim[0]]; } } // get the reduceType // eg: x_dim = [8, 6] reduce_dim = [0] --> ReduceHigherDim -->reduceFirstDim // x_dim = [8, 6] reduce_dim = [1] --> reduceLastDim // x_dim = [8] reduce_dim = [0] --> reduceAll // x_dim = [8, 6, 4, 2] reduce_dim = [0, 2] --> reduceAny void SetReduceType() { int rank = x_dim.size(); int reduce_rank = reduce_dim.size(); #ifdef PADDLE_WITH_XPU_KP bool not_higher = x_dim[0] > 1; #else int device_id = paddle::platform::GetCurrentDeviceId(); int max_grid_z = phi::backends::gpu::GetGpuMaxGridDimSize(device_id)[2]; bool not_higher = x_dim[0] >= max_grid_z; #endif if (reduce_last_dim && (reduce_rank == 1)) { #ifdef PADDLE_WITH_XPU_KP reduce_type = static_cast(ReduceType::kReduceAny); #else reduce_type = static_cast(ReduceType::kReduceLastDim); #endif } else if (reduce_rank == 1) { reduce_type = static_cast(ReduceType::kReduceHigherDim); if (rank == 3 && not_higher) { reduce_type = static_cast(ReduceType::kReduceAny); } } else { reduce_type = static_cast(ReduceType::kReduceAny); } } #ifndef PADDLE_WITH_XPU_KP void SetBlockDimForReduceAny(dim3* block_dim, dim3* grid_dim) { constexpr int min_reduce_num_per_thread = 16; constexpr int max_reduce_num_per_thread = 256; constexpr int max_num_threads = kps::details::kReduceMaxThread; // set block size. // 1. If reduce_last_dim == true, all the threads whose threadIdx.y are same // will process the reduction for one output. // The number of output for one block is blockDim.y; // 2. If reduce_last_dim == false, different threadIdx.x will process // different reduction and gets the output separately. If it is // necessary, it should reduce in block y. // The number of output for one block is blockDim.x; int block_x, block_y; int grid_num, reduce_num_per_thread; if (reduce_last_dim) { block_x = details::GetBlockDim(reduce_num); block_y = details::GetBlockDim(left_num); block_dim->x = block_x; block_dim->y = std::min(block_y, static_cast(max_num_threads / block_dim->x)); grid_num = details::AlignUp(left_num, block_dim->y); reduce_num_per_thread = details::AlignUp(reduce_num, block_dim->x); } else { block_x = details::GetBlockDim(left_num); block_y = details::GetBlockDim(reduce_num); block_dim->x = std::min(block_x, 32); block_dim->y = std::min(block_y, static_cast(max_num_threads / block_dim->x)); block_dim->x = std::min(block_x, static_cast(max_num_threads / block_dim->y)); grid_num = details::AlignUp(left_num, block_dim->x); reduce_num_per_thread = details::AlignUp(reduce_num, block_dim->y); } int device_id = paddle::platform::GetCurrentDeviceId(); int max_mp = paddle::platform::GetGPUMultiProcessors(device_id); int max_threads_per_mp = paddle::platform::GetGPUMaxThreadsPerMultiProcessor(device_id); int max_threads = max_threads_per_mp * max_mp; int num_threads = block_dim->x * block_dim->y; int max_num_blocks = max_threads / num_threads; // set grid size. // Whether to set grid.y larger than 1, there are 3 following rules: // 1. The number that each thread process should no less than // min_reduce_num_per_threadbut no more than max_reduce_num_per_thread; // 2. It should maximize the utilization of SM. // So we choose the minimum between input_split_num_1 and input_split_num_3 // to make each thread process as mush data as possible. Meanwhile, // the number cannot be larger than max_reduce_num_per_thread, so we // choose the maximum between the result above and input_split_num_2. int input_split_num_1 = details::AlignUp(reduce_num_per_thread, min_reduce_num_per_thread); int input_split_num_2 = details::AlignUp(reduce_num_per_thread, max_reduce_num_per_thread); int input_split_num_3 = details::AlignUp(max_num_blocks, grid_num); grid_dim->x = grid_num; grid_dim->y = std::max(std::min(input_split_num_1, input_split_num_3), input_split_num_2); // if grid.y > 1, we need launch reduce kernel again. if (grid_dim->y > 1) { should_reduce_again = true; } } // set block and grid for launch kernel // for ReduceHigherDim: if block is enough -> splite reduce_num // else init block(32, 1) grid(block_num, 1) // for others: block(block_num, 1) , grid(left_num, 1) void SetBlockDimForHigher(dim3* block_dim, dim3* grid_dim) { int last_dim_num = x_dim.back(); // update left_num int grid_z = left_num / last_dim_num; left_num = last_dim_num; grid_dim->z = grid_z; int device_id = paddle::platform::GetCurrentDeviceId(); int max_mp = paddle::platform::GetGPUMultiProcessors(device_id); int max_threads_per_mp = paddle::platform::GetGPUMaxThreadsPerMultiProcessor(device_id); int max_threads = max_threads_per_mp * max_mp; // init int num_block = (max_threads / left_num); block_dim->x = details::GetBlockDim(left_num); grid_dim->x = details::AlignUp(left_num, block_dim->x); blocking_size = reduce_num; if (num_block > 1 && reduce_num >= REDUCE_SPLIT_BOUNDARY) { blocking_size = details::GetLastPow2(reduce_num / num_block); if (blocking_size <= 1) { blocking_size = details::GetLastPow2(sqrt(reduce_num)); } else if (blocking_size * 2 < reduce_num) { blocking_size *= 2; } should_reduce_again = true; grid_dim->y = details::AlignUp(reduce_num, blocking_size); } } #endif void SetBlockDim() { // init should_reduce_again = false; dim3 block_dim(1, 1, 1); dim3 grid_dim(left_num, 1, 1); blocking_size = reduce_num; #ifdef PADDLE_WITH_XPU_KP if (reduce_last_dim) { block_dim.x = 64; block_dim.y = reduce_num; grid_dim.x = 1; grid_dim.y = 8; } else { block_dim.x = 64; block_dim.y = left_num; grid_dim.x = 8; grid_dim.y = 1; } #else if (reduce_type == ReduceType::kReduceHigherDim) { SetBlockDimForHigher(&block_dim, &grid_dim); } else { SetBlockDimForReduceAny(&block_dim, &grid_dim); } #endif block = block_dim; grid = grid_dim; } public: std::vector reduce_dims_origin; std::vector reduce_dim; std::vector x_dim; std::vector left_dim; std::vector x_strides; std::vector left_strides; std::vector reduce_strides; int reduce_type; int reduce_num; int left_num; int blocking_size; bool should_reduce_again; bool reduce_last_dim; Ty* output_data; dim3 block; dim3 grid; }; // when reduce_dim.size() == 1 and reduce_dim[0] == x_dim.size() - 1, or // when reduce_dim.size() != 1 and reduce_dim.size() != x_dim.size(), this // function will be used template __global__ void ReduceAnyKernel(const Tx* x, Ty* y, ReduceOp reducer, TransformOp transformer, MPType init, int reduce_num, int left_num, bool reduce_last_dim, const Calculator reduce_index_calculator, const Calculator left_index_calculator, const kps::DimConfig dim, bool is_mean) { int input_idx, left_idx, stride; int block_size = 0; bool need_store = true; int loop_left = 0; int tid = 0; // the last dim gets involved in reduction int store_offset = 0; int stride_left = 0; if (reduce_last_dim) { auto block = ReduceIndexMapping(dim); input_idx = block.BlockIdY() * block.BlockDimX(); left_idx = block.BlockIdX() * block.BlockDimY() + THREAD_ID_Y; stride = block.GridDimY() * block.BlockDimX(); block_size = block.BlockDimX(); need_store = (THREAD_ID_X == 0) && (left_idx < left_num); store_offset = block.BlockIdY() * left_num + left_idx; loop_left = min(block.GetLoopSize(), left_num - left_idx); stride_left = 1; tid = THREAD_ID_X; } else { auto block = ReduceIndexMapping(dim); input_idx = block.BlockIdY() * block.BlockDimY(); left_idx = block.BlockIdX() * block.BlockDimX() + THREAD_ID_X; stride = block.GridDimY() * block.BlockDimY(); block_size = block.BlockDimY(); need_store = (THREAD_ID_Y == 0) && (left_idx < left_num); loop_left = min(block.GetLoopSize(), left_num - left_idx); stride_left = block.BlockDimX() * block.GridDimX(); store_offset = block.BlockIdY() * left_num + left_idx; tid = THREAD_ID_Y; } // calculate the offset, means the addr where each thread really start. // 1. reduce for each thread MPType input_compute[REDUCE_VEC_SIZE]; Tx input_reg[REDUCE_VEC_SIZE]; int input_idx_tmp = input_idx; for (int i = 0; i < loop_left; i += stride_left) { int input_offset = left_index_calculator(left_idx + i); const _ptr_ Tx* input = x + input_offset; MPType reduce_var = init; // load REDUCE_VEC_SIZE data once, and then compute int bound = reduce_num - (REDUCE_VEC_SIZE - 1) * stride; input_idx = input_idx_tmp; for (; input_idx + block_size < bound; input_idx += REDUCE_VEC_SIZE * stride) { kps::ReadDataReduce, false>(&input_reg[0], input, input_idx, reduce_index_calculator, 1, reduce_num, 1, stride, kps::IdentityFunctor(), reduce_last_dim); kps::ElementwiseUnary( &input_compute[0], &input_reg[0], transformer); kps::Reduce( &reduce_var, &input_compute[0], reducer, reduce_last_dim); } kps::Init(&input_compute[0], init); kps::ReadDataReduce(&input_compute[0], input, input_idx, reduce_index_calculator, 1, reduce_num - input_idx, 1, stride, transformer, reduce_last_dim); kps::Reduce( &reduce_var, &input_compute[0], reducer, reduce_last_dim); kps::Reduce( &reduce_var, &reduce_var, reducer, reduce_last_dim); if (is_mean) { reduce_var = reduce_var / static_cast(reduce_num); } Ty result = static_cast(reduce_var); kps::details::WriteData( y + store_offset + i, &result, static_cast(need_store)); } } template __global__ void ReduceHigherDimKernel(const Tx* x, Ty* y, ReduceOp reducer, TransformOp transformer, MPType init, int reduce_num, int left_num, int blocking_size, const kps::DimConfig dim, int mean_div, bool is_mean) { // when reduce_dim.size() == 1 and reduce_dim[0] != x_dim.size() - 1, this // function will be used auto block = ReduceIndexMapping(dim); int idy = block.BlockIdY() * blocking_size; int idx = block.BlockIdX() * block.BlockDimX(); int idz = BLOCK_ID_Z * left_num; int stride = dim.split_num_x * dim.deal_size_x; int size = left_num - dim.rem_x; int loop_size = min(reduce_num - idy, blocking_size); int store_offset = block.BlockIdY() * left_num + idz * block.GridDimY(); int block_offset = idy * left_num + idz * reduce_num; const _ptr_ Tx* input = x + block_offset; Tx reduce_input; for (; idx < size; idx += stride) { MPType reduce_var = init; MPType reduce_compute = init; for (int loop_idx = 0; loop_idx < loop_size; ++loop_idx) { kps::ReadData(&reduce_input, input + loop_idx * left_num + idx, block.BlockDimX(), 1, 1, left_num); kps::ElementwiseUnary( &reduce_compute, &reduce_input, transformer); kps::Reduce( &reduce_var, &reduce_compute, reducer, false); } if (is_mean) { reduce_var = reduce_var / static_cast(mean_div); } Ty result = static_cast(reduce_var); kps::WriteData( y + store_offset + idx, &result, block.BlockDimX()); } if (idx < left_num) { MPType reduce_var = init; MPType reduce_compute = init; for (int loop_idx = 0; loop_idx < loop_size; ++loop_idx) { kps::ReadData(&reduce_input, input + loop_idx * left_num + idx, dim.rem_x, 1, 1, left_num); kps::ElementwiseUnary( &reduce_compute, &reduce_input, transformer); kps::Reduce( &reduce_var, &reduce_compute, reducer, false); } if (is_mean) { reduce_var = reduce_var / static_cast(mean_div); } Ty result = static_cast(reduce_var); kps::WriteData( y + store_offset + idx, &result, dim.rem_x); } } template static void LaunchReduceKernel(const Tx* x_data, Ty* y_data, const ReduceOp& reducer, const TransformOp& transform, MPType init, KPStream stream, ReduceConfig config, bool is_mean = false) { if (config.reduce_type == kReduceLastDim) { int stride_reduce = 1; int stride_left = config.reduce_num; // for higher performance auto reduce_index_calculator = OneDimIndexCal(stride_reduce); auto left_index_calculator = OneDimIndexCal(stride_left); kps::DimConfig dim = kps::DimConfig(config.grid.x, config.grid.y, config.grid.z, config.block.x, config.block.y, 0); dim.SetRem(config.reduce_num % config.block.x, 0, 0); #ifdef PADDLE_WITH_XPU_KP auto grid_num = 8; auto block_num = 64; #else auto grid_num = config.grid; auto block_num = config.block; #endif ReduceAnyKernel <<>>( x_data, config.output_data, reducer, transform, init, config.reduce_num, config.left_num, config.reduce_last_dim, reduce_index_calculator, left_index_calculator, dim, is_mean && (!config.should_reduce_again)); } else { int reduce_rank = config.reduce_strides.size(); int left_rank = config.left_strides.size(); auto reduce_index_calculator = IndexCalculator(reduce_rank, config.reduce_dim, config.reduce_strides, config.x_strides); auto left_index_calculator = IndexCalculator( left_rank, config.left_dim, config.left_strides, config.x_strides); kps::DimConfig dim = kps::DimConfig(config.grid.x, config.grid.y, config.grid.z, config.block.x, config.block.y, 0); dim.SetRem(config.reduce_num % config.block.x, 0, 0); #ifdef PADDLE_WITH_XPU_KP auto grid_num = 8; auto block_num = 64; #else auto grid_num = config.grid; auto block_num = config.block; #endif ReduceAnyKernel <<>>( x_data, config.output_data, reducer, transform, init, config.reduce_num, config.left_num, config.reduce_last_dim, reduce_index_calculator, left_index_calculator, dim, is_mean && (!config.should_reduce_again)); } if (config.should_reduce_again) { dim3 block; dim3 grid; if (config.reduce_last_dim) { block = dim3(32, 1, 1); grid = dim3(details::AlignUp(config.left_num, 32), 1, 1); } else { block = dim3(config.block.x, 1, 1); grid = dim3(config.grid.x, 1, config.grid.z); } auto last_index = OneDimIndexCal(1); auto first_index = OneDimIndexCal(config.left_num); kps::DimConfig dim = kps::DimConfig(grid.x, grid.y, grid.z, block.x, config.grid.y, 0); dim.SetRem(config.left_num % block.x, 0, 0); #ifdef PADDLE_WITH_XPU_KP int grid_size = 8; int block_size = 64; #else auto grid_size = grid; auto block_size = block; #endif ReduceHigherDimKernel> <<>>( config.output_data, y_data, reducer, kps::IdentityFunctor(), init, config.grid.y, config.left_num, config.grid.y, dim, config.reduce_num, is_mean); } } #if !defined(PADDLE_WITH_XPU_KP) template class ReduceOp, typename TransformOp> static typename std::enable_if::value, void>::type CubTensorReduceImpl(const Tx* x_data, Ty* y_data, const TransformOp& transform, int reduce_num, const KPDevice& dev_ctx, KPStream stream) { auto reducer = ReduceOp(); cub::TransformInputIterator trans_x(x_data, transform); size_t temp_storage_bytes = 0; cub::DeviceReduce::Reduce(nullptr, temp_storage_bytes, trans_x, y_data, reduce_num, reducer, reducer.initial(), stream); phi::DenseTensor tmp = phi::Empty( dev_ctx, {static_cast(temp_storage_bytes)}); auto* temp_storage = dev_ctx.Alloc(&tmp); cub::DeviceReduce::Reduce(temp_storage, temp_storage_bytes, trans_x, y_data, reduce_num, reducer, reducer.initial(), stream); } template class ReduceOp, typename TransformOp> static typename std::enable_if::value, void>::type CubTensorReduceImpl(const Tx* x_data, Ty* y_data, const TransformOp& transform, int reduce_num, const KPDevice& dev_ctx, KPStream stream) { PADDLE_THROW(phi::errors::InvalidArgument( "Tx should not be float16 when using cub::DeviceReduce::Reduce().")); } #endif // PADDLE_WITH_XPU_KP template class ReduceOp, typename TransformOp> void ReduceKernel(const KPDevice& dev_ctx, const phi::DenseTensor& x, phi::DenseTensor* y, const TransformOp& transform, const std::vector& origin_reduce_dims, bool is_mean = false) { #ifdef PADDLE_WITH_XPU_KP auto stream = dev_ctx.x_context()->xpu_stream; #else auto stream = dev_ctx.stream(); #endif dev_ctx.Alloc(y); auto x_dim = phi::vectorize(x.dims()); auto config = ReduceConfig(origin_reduce_dims, x_dim); config.Run(dev_ctx); int numel = x.numel(); // after config.run() // SetOutputData for ReduceHigherDim when should_reduce_again is true, // temp_output should be stored temp_data in output_data space or stored in // y_data; phi::DDim tmp_ddim; phi::DenseTensor tmp; auto x_data = x.data(); auto y_data = y->data(); if (config.reduce_num == 1) { std::vector inputs = {&x}; std::vector outputs = {y}; funcs::ElementwiseKernel(dev_ctx, inputs, &outputs, transform); return; } config.SetOutputData(y_data, dev_ctx, &tmp); constexpr bool kIsTxFP16 = std::is_same::value; bool use_cub_reduce = config.reduce_num == numel && !kIsTxFP16; #ifndef PADDLE_WITH_XPU_KP if (use_cub_reduce) { if (is_mean) { using Div = kps::DivideFunctor; CubTensorReduceImpl(x_data, y_data, Div(config.reduce_num), config.reduce_num, dev_ctx, stream); } else { CubTensorReduceImpl( x_data, y_data, transform, config.reduce_num, dev_ctx, stream); } return; } #endif using MPType = typename kps::details::MPTypeTrait::Type; auto reducer = ReduceOp(); // launch ReduceHigherDimKernel // when reduce_dim.size() == 1 and reduce_dim[0] != x_dim.size() - 1, this // function will be used // eg: x_dim = {nz, ny, nx}, nx != 1, axis can be 0 or 1 // if axis = 1 then grid.z = nz, grid.y = ny / block_size, grid.x = nx / // 32 // else grid.z = 1, grid.y = ny / block_size, grid.x = nx /32 if (config.reduce_type == ReduceType::kReduceHigherDim) { kps::DimConfig dim = kps::DimConfig(config.grid.x, config.grid.y, config.grid.z, config.block.x, config.blocking_size, 0); dim.SetRem(config.left_num % config.block.x, config.reduce_num % config.blocking_size, 0); #ifdef PADDLE_WITH_XPU_KP auto grid_num = 8; auto block_num = 64; #else auto grid_num = config.grid; auto block_num = config.block; #endif ReduceHigherDimKernel, TransformOp> <<>>( x_data, config.output_data, reducer, transform, reducer.initial(), config.reduce_num, config.left_num, config.blocking_size, dim, config.reduce_num, is_mean && (!config.should_reduce_again)); if (config.should_reduce_again) { dim3 block = dim3(config.block.x, 1, 1); dim3 grid = dim3(config.grid.x, 1, config.grid.z); kps::DimConfig dim2 = kps::DimConfig(grid.x, grid.y, grid.z, block.x, config.grid.y, 0); dim2.SetRem(config.left_num % config.block.x, 0, 0); #ifdef PADDLE_WITH_XPU_KP int grid_size = 8; int block_size = 64; #else auto grid_size = grid; auto block_size = block; #endif ReduceHigherDimKernel, kps::IdentityFunctor> <<>>( config.output_data, y_data, reducer, kps::IdentityFunctor(config.grid.y), reducer.initial(), config.grid.y, config.left_num, config.grid.y, dim2, config.reduce_num, is_mean); } return; } // when reduce_dim.size() == 1 and reduce_dim[0] == x_dim.size() - 1, or // when reduce_dim.size() != 1 and reduce_dim.size() != x_dim.size(), this // function will be used LaunchReduceKernel, TransformOp>( x_data, y_data, reducer, transform, reducer.initial(), stream, config, is_mean); } } // namespace funcs } // namespace phi #endif