/* ****************************************************************************** * * * This program and the accompanying materials are made available under the * terms of the Apache License, Version 2.0 which is available at * https://www.apache.org/licenses/LICENSE-2.0. * * See the NOTICE file distributed with this work for additional * information regarding copyright ownership. * 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. * * SPDX-License-Identifier: Apache-2.0 ******************************************************************************/ // // @author raver119@gmail.com // #include ////////////////////////////////////////////////////////////////////////// template __global__ void execOesTadKernelKey(void *vx, Nd4jLong const* xShapeInfo, void *vy, Nd4jLong const* yShapeInfo, int *dimension, int dimensionLength, Nd4jLong const* tadShapeInfo, Nd4jLong const* tadOffsets, bool descending) { auto x = static_cast(vx); auto y = static_cast(vy); __shared__ int xLength; __shared__ int xTadLength; __shared__ int numTads; if (threadIdx.x == 0) { xLength = shape::length(xShapeInfo); xTadLength = shape::length(tadShapeInfo); numTads = xLength / xTadLength; } __syncthreads(); for (int r = blockIdx.x; r < numTads; r += gridDim.x) { auto dx = x + tadOffsets[r]; auto dy = y + tadOffsets[r]; // this is general loop, we go uncached int iterations = xTadLength; for (int i = 0; i < iterations; i++) { if (i % 2 == 0) { for (int tid = threadIdx.x; tid < xTadLength; tid += blockDim.x) { auto top = 2 * tid + 1; if (top < xTadLength) { auto t0 = shape::getIndexOffset(top - 1, tadShapeInfo); auto t1 = shape::getIndexOffset(top, tadShapeInfo); if (!descending == (dx[t0] > dx[t1])) { X dt0 = dx[t0]; dx[t0] = dx[t1]; dx[t1] = dt0; Y dy0 = dy[t0]; dy[t0] = dy[t1]; dy[t1] = dy0; } } } } else { for (int tid = threadIdx.x; tid < xTadLength; tid += blockDim.x) { auto top = 2 * tid + 2; if (top < xTadLength) { auto t0 = shape::getIndexOffset(top - 1, tadShapeInfo); auto t1 = shape::getIndexOffset(top, tadShapeInfo); if (!descending == (dx[t0] > dx[t1])) { X dt0 = dx[t0]; dx[t0] = dx[t1]; dx[t1] = dt0; Y dy0 = dy[t0]; dy[t0] = dy[t1]; dy[t1] = dy0; } } } } __syncthreads(); } } } ////////////////////////////////////////////////////////////////////////// template __global__ void execOesTadKernel(void *vx, Nd4jLong const* xShapeInfo, int *dimension, int dimensionLength, Nd4jLong const* tadShapeInfo, Nd4jLong const* tadOffsets, bool descending) { auto x = static_cast(vx); const int sharedSize = 32768; __shared__ int xLength; __shared__ int xTadLength; __shared__ int numTads; __shared__ T *shmem; __shared__ bool cached; if (threadIdx.x == 0) { xLength = shape::length(xShapeInfo); xTadLength = shape::length(tadShapeInfo); numTads = xLength / xTadLength; extern __shared__ unsigned char shrd[]; shmem = (T *) shrd; cached = xTadLength <= (sharedSize / sizeof(T)); } __syncthreads(); for (int r = blockIdx.x; r < numTads; r += gridDim.x) { auto dx = x + tadOffsets[r]; // this is general loop, we go uncached int iterations = xTadLength; if (cached) { for (int tid = threadIdx.x; tid < xTadLength; tid += blockDim.x) { auto t0 = shape::getIndexOffset(tid, tadShapeInfo); shmem[tid] = dx[t0]; } __syncthreads(); dx = shmem; } for (int i = 0; i < iterations; i++) { if (i % 2 == 0) { for (int tid = threadIdx.x; tid < xTadLength; tid += blockDim.x) { auto top = 2 * tid + 1; if (top < xTadLength) { auto t0 = cached ? top - 1 : shape::getIndexOffset(top - 1, tadShapeInfo); auto t1 = cached ? top : shape::getIndexOffset(top, tadShapeInfo); if (!descending == (dx[t0] > dx[t1])) { T dt0 = dx[t0]; dx[t0] = dx[t1]; dx[t1] = dt0; } } } } else { for (int tid = threadIdx.x; tid < xTadLength; tid += blockDim.x) { auto top = 2 * tid + 2; if (top < xTadLength) { auto t0 = cached ? top - 1 : shape::getIndexOffset(top - 1, tadShapeInfo); auto t1 = cached ? top : shape::getIndexOffset(top, tadShapeInfo); if (!descending == (dx[t0] > dx[t1])) { T dt0 = dx[t0]; dx[t0] = dx[t1]; dx[t1] = dt0; } } } } __syncthreads(); } if (cached) { dx = x + tadOffsets[r]; for (int tid = threadIdx.x; tid < xTadLength; tid += blockDim.x) { auto t0 = shape::getIndexOffset(tid, tadShapeInfo); dx[t0] = shmem[tid]; } } } } ////////////////////////////////////////////////////////////////////////// template __host__ void oesTadGeneric(dim3 &launchDims, cudaStream_t *stream, void *vx, Nd4jLong const* xShapeInfo, int *dimension, int dimensionLength, Nd4jLong const* tadShapeInfo, Nd4jLong const* tadOffsets, bool descending) { execOesTadKernel<<>>(vx, xShapeInfo, dimension, dimensionLength, tadShapeInfo, tadOffsets, descending); } template __host__ void oesTadGenericKey(dim3 &launchDims, cudaStream_t *stream, void *vx, Nd4jLong const* xShapeInfo, void *vy, Nd4jLong const* yShapeInfo, int *dimension, int dimensionLength, Nd4jLong const* tadShapeInfo, Nd4jLong const* tadOffsets, bool descending) { execOesTadKernelKey<<>>(vx, xShapeInfo, vy, yShapeInfo, dimension, dimensionLength, tadShapeInfo, tadOffsets, descending); } BUILD_SINGLE_TEMPLATE(template void ND4J_EXPORT oesTadGeneric, (dim3 &launchDims, cudaStream_t *stream, void *vx, Nd4jLong const* xShapeInfo, int *dimension, int dimensionLength, Nd4jLong const* tadShapeInfo, Nd4jLong const* tadOffsets, bool descending), LIBND4J_TYPES); BUILD_DOUBLE_TEMPLATE(template void ND4J_EXPORT oesTadGenericKey, (dim3 &launchDims, cudaStream_t *stream, void *vx, Nd4jLong const* xShapeInfo, void *vy, Nd4jLong const* yShapeInfo, int *dimension, int dimensionLength, Nd4jLong const* tadShapeInfo, Nd4jLong const* tadOffsets, bool descending), LIBND4J_TYPES, LIBND4J_TYPES);