/* ****************************************************************************** * * * 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 Yurii Shyrma (iuriish@yahoo.com), created on 14.03.2019 // #include using namespace simdOps; ////////////////////////////////////////////////////////////////////////////// template template void sd::IndexReductionLoops::loopIndexReduce(const X* x, const Nd4jLong* xShapeInfo, Z* z, const Nd4jLong* zShapeInfo, const Nd4jLong* tadShapeInfo, const Nd4jLong* tadOffsets, X* extraParams) { sd::LoopKind::Kind kindOfLoop = sd::LoopKind::deduceKindOfLoopTadXZ(xShapeInfo, zShapeInfo, tadShapeInfo); if(kindOfLoop == sd::LoopKind::SMALLARR2DX) kindOfLoop = sd::LoopKind::EWSNONZERO; const Nd4jLong zLen = shape::length(zShapeInfo); const Nd4jLong tadLen = shape::length(tadShapeInfo); const uint tadEws = shape::elementWiseStride(tadShapeInfo); const uint zEws = shape::elementWiseStride(zShapeInfo); const Nd4jLong* tadShape = shape::shapeOf(const_cast(tadShapeInfo)); const Nd4jLong* tadStride = shape::stride(const_cast(tadShapeInfo)); switch (kindOfLoop) { //*********************************************// case sd::LoopKind::EWS1: { auto func = PRAGMA_THREADS_FOR { for (auto i = start; i < stop; i++) { auto tad = const_cast(x) + tadOffsets[i]; auto indexValue = OpType::startingIndexValue(tad); for (Nd4jLong j = 0; j < tadLen; j++) { functions::indexreduce::IndexValue comp(tad[j], j); indexValue = OpType::update(indexValue, comp, extraParams); } z[i] = (Z) indexValue.index; } }; samediff::Threads::parallel_tad(func, 0, zLen); } break; //*********************************************// case sd::LoopKind::EWSNONZERO: { auto func = PRAGMA_THREADS_FOR { for (auto i = start; i < stop; i++) { auto tad = const_cast(x) + tadOffsets[i]; auto indexValue = OpType::startingIndexValue(tad); for (Nd4jLong j = 0; j < tadLen; j++) { functions::indexreduce::IndexValue comp(tad[j * tadEws], j); indexValue = OpType::update(indexValue, comp, extraParams); } z[i * zEws] = (Z) indexValue.index; } }; samediff::Threads::parallel_tad(func, 0, zLen); } break; //*********************************************// case sd::LoopKind::RANK1: { auto func = PRAGMA_THREADS_FOR { for (auto i = start; i < stop; i++) { auto tad = const_cast(x) + tadOffsets[i]; auto indexValue = OpType::startingIndexValue(tad); for (Nd4jLong i0 = 0; i0 < tadLen; ++i0) { functions::indexreduce::IndexValue comp(tad[i0 * tadStride[0]], i0); indexValue = OpType::update(indexValue, comp, extraParams); } z[i] = (Z) indexValue.index; } }; samediff::Threads::parallel_tad(func, 0, zLen); } break; //*********************************************// case sd::LoopKind::RANK2: { Nd4jLong newStride[2]; shape::updateStrides(2, tadShape, newStride, 'c'); auto func = PRAGMA_THREADS_FOR { for (auto i = start; i < stop; i++) { auto tad = const_cast(x) + tadOffsets[i]; auto indexValue = OpType::startingIndexValue(tad); for (Nd4jLong i0 = 0; i0 < tadShape[0]; ++i0) { for (Nd4jLong i1 = 0; i1 < tadShape[1]; ++i1) { const auto tadOffset = i0 * tadStride[0] + i1 * tadStride[1]; const auto tadIndex = i0 * newStride[0] + i1; functions::indexreduce::IndexValue comp(tad[tadOffset], tadIndex); indexValue = OpType::update(indexValue, comp, extraParams); } } z[i] = (Z) indexValue.index; } }; samediff::Threads::parallel_tad(func, 0, zLen); } break; //*********************************************// case sd::LoopKind::RANK3: { Nd4jLong newStride[3]; shape::updateStrides(3, tadShape, newStride, 'c'); auto func = PRAGMA_THREADS_FOR { for (auto i = start; i < stop; i++) { auto tad = const_cast(x) + tadOffsets[i]; auto indexValue = OpType::startingIndexValue(tad); for (Nd4jLong i0 = 0; i0 < tadShape[0]; ++i0) { for (Nd4jLong i1 = 0; i1 < tadShape[1]; ++i1) { for (Nd4jLong i2 = 0; i2 < tadShape[2]; ++i2) { const auto tadOffset = i0 * tadStride[0] + i1 * tadStride[1] + i2 * tadStride[2]; const auto tadIndex = i0 * newStride[0] + i1 * newStride[1] + i2; functions::indexreduce::IndexValue comp(tad[tadOffset], tadIndex); indexValue = OpType::update(indexValue, comp, extraParams); } } } z[i] = (Z) indexValue.index; } }; samediff::Threads::parallel_tad(func, 0, zLen); } break; //*********************************************// case sd::LoopKind::RANK4: { Nd4jLong newStride[4]; shape::updateStrides(4, tadShape, newStride, 'c'); auto func = PRAGMA_THREADS_FOR { for (auto i = start; i < stop; i++) { auto tad = const_cast(x) + tadOffsets[i]; auto indexValue = OpType::startingIndexValue(tad); for (Nd4jLong i0 = 0; i0 < tadShape[0]; ++i0) { for (Nd4jLong i1 = 0; i1 < tadShape[1]; ++i1) { for (Nd4jLong i2 = 0; i2 < tadShape[2]; ++i2) { for (Nd4jLong i3 = 0; i3 < tadShape[3]; ++i3) { const auto tadOffset = i0 * tadStride[0] + i1 * tadStride[1] + i2 * tadStride[2] + i3 * tadStride[3]; const auto tadIndex = i0 * newStride[0] + i1 * newStride[1] + i2 * newStride[2] + i3; functions::indexreduce::IndexValue comp(tad[tadOffset], tadIndex); indexValue = OpType::update(indexValue, comp, extraParams); } } } } z[i] = (Z) indexValue.index; } }; samediff::Threads::parallel_tad(func, 0, zLen); } break; //*********************************************// case sd::LoopKind::RANK5: { Nd4jLong newStride[5]; shape::updateStrides(5, tadShape, newStride, 'c'); auto func = PRAGMA_THREADS_FOR { for (auto i = start; i < stop; i++) { auto tad = const_cast(x) + tadOffsets[i]; auto indexValue = OpType::startingIndexValue(tad); for (Nd4jLong i0 = 0; i0 < tadShape[0]; ++i0) { for (Nd4jLong i1 = 0; i1 < tadShape[1]; ++i1) { for (Nd4jLong i2 = 0; i2 < tadShape[2]; ++i2) { for (Nd4jLong i3 = 0; i3 < tadShape[3]; ++i3) { for (Nd4jLong i4 = 0; i4 < tadShape[4]; ++i4) { const auto tadOffset = i0 * tadStride[0] + i1 * tadStride[1] + i2 * tadStride[2] + i3 * tadStride[3] + i4 * tadStride[4]; const auto tadIndex = i0 * newStride[0] + i1 * newStride[1] + i2 * newStride[2] + i3 * newStride[3] + i4; functions::indexreduce::IndexValue comp(tad[tadOffset], tadIndex); indexValue = OpType::update(indexValue, comp, extraParams); } } } } } z[i] = (Z) indexValue.index; } }; samediff::Threads::parallel_tad(func, 0, zLen); } break; //*********************************************// case sd::LoopKind::X_EWSNONZERO: { uint castZShapeInfo[MAX_RANK]; const bool canCastZ = sd::DataTypeUtils::castShapeInfo(zShapeInfo, castZShapeInfo); auto func = PRAGMA_THREADS_FOR { for (auto i = start; i < stop; i++) { auto tad = const_cast(x) + tadOffsets[i]; auto indexValue = OpType::startingIndexValue(tad); for (Nd4jLong j = 0; j < tadLen; j++) { functions::indexreduce::IndexValue comp(tad[j * tadEws], j); indexValue = OpType::update(indexValue, comp, extraParams); } auto zOffset = shape::indexOffset(i, zShapeInfo, castZShapeInfo, canCastZ); z[zOffset] = (Z) indexValue.index; } }; samediff::Threads::parallel_tad(func, 0, zLen); } break; //*********************************************// case sd::LoopKind::Z_EWSNONZERO: { uint castTadShapeInfo[MAX_RANK]; const bool canCastTad = sd::DataTypeUtils::castShapeInfo(tadShapeInfo, castTadShapeInfo); auto func = PRAGMA_THREADS_FOR { for (auto i = start; i < stop; i++) { auto tad = const_cast(x) + tadOffsets[i]; auto indexValue = OpType::startingIndexValue(tad); for (Nd4jLong j = 0; j < tadLen; j++) { auto tadOffset = shape::indexOffset(j, tadShapeInfo, castTadShapeInfo, canCastTad); functions::indexreduce::IndexValue comp(tad[tadOffset], j); indexValue = OpType::update(indexValue, comp, extraParams); } z[i * zEws] = (Z) indexValue.index; } }; samediff::Threads::parallel_tad(func, 0, zLen); } break; //*********************************************// default: { uint castTadShapeInfo[MAX_RANK]; uint castZShapeInfo[MAX_RANK]; const bool canCastTad = sd::DataTypeUtils::castShapeInfo(tadShapeInfo, castTadShapeInfo); const bool canCastZ = sd::DataTypeUtils::castShapeInfo(zShapeInfo, castZShapeInfo); auto func = PRAGMA_THREADS_FOR { for (auto i = start; i < stop; i++) { auto tad = const_cast(x) + tadOffsets[i]; auto indexValue = OpType::startingIndexValue(tad); for (Nd4jLong j = 0; j < tadLen; j++) { auto tadOffset = shape::indexOffset(j, tadShapeInfo, castTadShapeInfo, canCastTad); functions::indexreduce::IndexValue comp(tad[tadOffset], j); indexValue = OpType::update(indexValue, comp, extraParams); } auto zOffset = shape::indexOffset(i, zShapeInfo, castZShapeInfo, canCastZ); z[zOffset] = (Z) indexValue.index; } }; samediff::Threads::parallel_tad(func, 0, zLen); } } } template void sd::IndexReductionLoops::wrapIndexReduce(const int opNum, const void* vx, const Nd4jLong* xShapeInfo, void* vz, const Nd4jLong* zShapeInfo, const Nd4jLong* tadShapeInfo, const Nd4jLong* tadOffsets, void* vextraParams) { auto x = reinterpret_cast(vx); auto z = reinterpret_cast(vz); auto extraParams = reinterpret_cast(vextraParams); DISPATCH_BY_OPNUM_TT(loopIndexReduce, PARAMS(x, xShapeInfo, z, zShapeInfo, tadShapeInfo, tadOffsets, extraParams), INDEX_REDUCE_OPS); }