/* ****************************************************************************** * * * 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 #include #include namespace sd { namespace ops { namespace helpers { template static void prefix_(scalar::Ops op, const void* vx, sd::LongType const* xShapeInfo, void* vz, sd::LongType const* zShapeInfo, bool exclusive, bool reverse) { const auto x = reinterpret_cast(vx); auto z = reinterpret_cast(vz); auto length = shape::length(xShapeInfo); T prevSum = op == scalar::Add ? (T)0 : (T)1; T sum = prevSum; LongType xCoords[SD_MAX_RANK]; LongType zCoords[SD_MAX_RANK]; LongType xOffset; LongType zOffset; sd::LongType xRank = shape::rank(xShapeInfo); sd::LongType zRank = shape::rank(zShapeInfo); sd::LongType *xShape = shape::shapeOf(xShapeInfo); sd::LongType *xStride = shape::stride(xShapeInfo); sd::LongType *zShape = shape::shapeOf(zShapeInfo); sd::LongType *zStride = shape::stride(zShapeInfo); if (reverse) { for (sd::LongType e = length - 1; e >= 0; --e) { INDEX2COORDS(e, xRank, xShape, xCoords); COORDS2INDEX(xRank, xStride, xCoords, xOffset); INDEX2COORDS(e, zRank, zShape, zCoords); COORDS2INDEX(zRank, zStride, zCoords, zOffset); sum = op == scalar::Add ? simdOps::Add::op(sum, x[xOffset]) : simdOps::Multiply::op(sum, x[xOffset]); if (!exclusive) prevSum = sum; z[zOffset] = prevSum; prevSum = sum; } } else { for (sd::LongType e = 0; e < length; e++) { INDEX2COORDS(e, xRank, xShape, xCoords); COORDS2INDEX(xRank, xStride, xCoords, xOffset); INDEX2COORDS(e, zRank, zShape, zCoords); COORDS2INDEX(zRank, zStride, zCoords, zOffset); sum = op == scalar::Add ? simdOps::Add::op(sum, x[xOffset]) : simdOps::Multiply::op(sum, x[xOffset]); if (!exclusive) prevSum = sum; z[zOffset] = prevSum; prevSum = sum; } } } template static void prefix_(scalar::Ops op, NDArray* x, NDArray* z, const std::vector& dims, bool exclusive, bool reverse) { auto xTads = x->allTensorsAlongDimension(dims); auto zTads = z->allTensorsAlongDimension(dims); auto t = xTads.size(); for (int e = 0; e < t; e++) { auto tx = xTads.at(e); auto tz = zTads.at(e); prefix_(op, tx->buffer(), tx->shapeInfo(), tz->buffer(), tz->shapeInfo(), exclusive, reverse); } }; template static void prefix_(scalar::Ops op, NDArray* x, NDArray* z, bool exclusive, bool reverse) { prefix_(op, x->buffer(), x->shapeInfo(), z->buffer(), z->shapeInfo(), exclusive, reverse); }; void prefix(sd::LaunchContext* context, scalar::Ops op, NDArray* x, NDArray* z, bool exclusive, bool reverse) { BUILD_SINGLE_SELECTOR(x->dataType(), prefix_, (op, x, z, exclusive, reverse), SD_NUMERIC_TYPES); } void prefix(sd::LaunchContext* context, scalar::Ops op, NDArray* x, NDArray* z, const std::vector& dims, bool exclusive, bool reverse) { BUILD_SINGLE_SELECTOR(x->dataType(), prefix_, (op, x, z, dims, exclusive, reverse), SD_NUMERIC_TYPES); } BUILD_SINGLE_TEMPLATE( void prefix_, (scalar::Ops op, const void* vx, sd::LongType const* xShapeInfo, void* vz, sd::LongType const* zShapeInfo, bool exclusive, bool reverse), SD_NUMERIC_TYPES); BUILD_SINGLE_TEMPLATE( void prefix_, (scalar::Ops op, NDArray* x, NDArray* z, const std::vector& dims, bool exclusive, bool reverse), SD_NUMERIC_TYPES); BUILD_SINGLE_TEMPLATE( void prefix_, (scalar::Ops op, NDArray* x, NDArray* z, bool exclusive, bool reverse), SD_NUMERIC_TYPES); } // namespace helpers } // namespace ops } // namespace sd