/* ****************************************************************************** * * * 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 // @author Yurii Shyrma (iuriish@yahoo.com) // #include #if NOT_EXCLUDED(OP_unstack) #include #include namespace sd { namespace ops { CUSTOM_OP_IMPL(unstack, 1, -1, false, 0, 1) { auto input = INPUT_VARIABLE(0); if (input->isEmpty()) return Status::OK; auto dim = INT_ARG(0); if (dim < 0) dim += input->rankOf(); REQUIRE_TRUE(dim < input->rankOf(), 0, "Unstack dimension should be lower then rank of input %i, but got dimension=%i !", input->rankOf(), dim); REQUIRE_TRUE(dim >= 0, 0, "Unstack dimension should be non-negative value, but got %i !", dim); std::vector outArrs(input->sizeAt(dim)); for (size_t i = 0; i < outArrs.size(); ++i) outArrs[i] = OUTPUT_VARIABLE(i); helpers::unstack(block.launchContext(), *input, outArrs, dim); return Status::OK; } DECLARE_SYN(unpack, unstack); DECLARE_SHAPE_FN(unstack) { auto inShapeInfo = inputShape->at(0); auto dim = INT_ARG(0); const LongType numTads = block.numI() > 1 ? I_ARG(1) : shape::shapeOf(inShapeInfo)[dim]; if (dim < 0) dim += shape::rank(inShapeInfo); if(!shape::isEmptyConst(inShapeInfo)) { REQUIRE_TRUE(dim < inShapeInfo[0], 0, "UNSTACK op: dimension should be lower then rank of input %i, but got dimension=%i !", inShapeInfo[0], dim); REQUIRE_TRUE(dim >= 0, 0, "UNSTACK op: dimension should be non-negative value, but got %i !", dim); } if (ArrayOptions::arrayType(inShapeInfo) == EMPTY) { std::vector outShape; for (LongType i = 0; i < shape::rank(inShapeInfo); ++i) if (i != dim) outShape.push_back(shape::shapeOf(inShapeInfo)[i]); auto result = SHAPELIST(); for (LongType i = 0; i < numTads; ++i) result->push_back(ConstantShapeHelper::getInstance().emptyShapeInfoWithShape(ArrayOptions::dataType(inShapeInfo),outShape)); if(numTads < 1) { result->push_back(ConstantShapeHelper::getInstance().emptyShapeInfoWithShape(ArrayOptions::dataType(inShapeInfo),outShape)); } return result; } std::vector dimVec = {dim}; std::vector *dims = ShapeUtils::evalDimsToExclude(inShapeInfo[0], 1,dimVec.data()); if (dims->size() == 0 && shape::rank(inShapeInfo) == 1) { // split vector into lengthOf scalars auto result = SHAPELIST(); for (LongType e = 0; e < numTads; e++) result->push_back(ConstantShapeHelper::getInstance().scalarShapeInfo(ArrayOptions::dataType(inShapeInfo))); delete dims; return result; } std::vector subArrShape(shape::rank(inShapeInfo) - 1); for (LongType j = 0, i = 0; i < shape::rank(inShapeInfo); i++) if (i != dim) subArrShape[j++] = shape::shapeOf(inShapeInfo)[i]; // remove leading and trailing 1 if (inShapeInfo[0] == 2 && subArrShape.size() == 2) { if (subArrShape[0] == 1) subArrShape.erase(subArrShape.begin()); else if (subArrShape[1] == 1) subArrShape.erase(subArrShape.end()); } auto result = SHAPELIST(); for (int e = 0; e < numTads; e++) { auto newShape = ConstantShapeHelper::getInstance().createShapeInfo(ArrayOptions::dataType(inShapeInfo), shape::order(inShapeInfo), subArrShape); result->push_back(newShape); } return result; } DECLARE_TYPES(unstack) { getOpDescriptor()->setAllowedInputTypes({ALL_FLOATS, ALL_INTS})->setSameMode(true); } } // namespace ops } // namespace sd #endif