/* * The MIT License (MIT) * * Copyright (c) 2015-2022 Advanced Micro Devices, Inc. All rights reserved. * * Permission is hereby granted, free of charge, to any person obtaining a copy * of this software and associated documentation files (the "Software"), to deal * in the Software without restriction, including without limitation the rights * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell * copies of the Software, and to permit persons to whom the Software is * furnished to do so, subject to the following conditions: * * The above copyright notice and this permission notice shall be included in * all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN * THE SOFTWARE. */ #include #include #include #include #include namespace migraphx { inline namespace MIGRAPHX_INLINE_NS { namespace tf { struct parse_squeeze : op_parser { std::vector operators() const { return {{"Squeeze"}}; } instruction_ref parse(const op_desc& /*opd*/, const tf_parser& /*parser*/, tf_parser::node_info info, std::vector args) const { auto input_dims = args[0]->get_shape().lens(); auto axes = info.attributes.at("squeeze_dims").list().i(); std::vector op_axes(axes.begin(), axes.end()); if(op_axes.empty()) // no squeeze_dims provided, remove any dim that equals 1 { for(size_t i = 0; i < input_dims.size(); i++) { if(input_dims.at(i) == 1) { op_axes.push_back(i); } } } return info.add_instruction(make_op("squeeze", {{"axes", op_axes}}), info.make_contiguous(args[0])); } }; } // namespace tf } // namespace MIGRAPHX_INLINE_NS } // namespace migraphx