File size: 2,783 Bytes
be903e2 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 | // Tencent is pleased to support the open source community by making ncnn available.
//
// Copyright (C) 2021 THL A29 Limited, a Tencent company. All rights reserved.
//
// Licensed under the BSD 3-Clause License (the "License"); you may not use this file except
// in compliance with the License. You may obtain a copy of the License at
//
// https://opensource.org/licenses/BSD-3-Clause
//
// 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.
#include "eliminate_noop_slice.h"
#include <limits.h>
#include <algorithm>
#include "pass_level2.h"
namespace pnnx {
void eliminate_noop_slice(Graph& graph)
{
while (1)
{
bool matched = false;
for (size_t i = 0; i < graph.ops.size(); i++)
{
Operator* op = graph.ops[i];
if (op->type != "Tensor.slice")
continue;
if (op->inputs.size() != 1)
continue;
if (!op->inputs[0]->shape.empty() && op->inputs[0]->shape == op->outputs[0]->shape)
{
matched = true;
}
int start = op->params.at("start").i;
int end = op->params.at("end").i;
int step = op->params.at("step").i;
if (start == 0 && end == INT_MAX && step == 1)
{
// delete noop-like slice
matched = true;
}
if (matched)
{
for (auto& x : op->inputs)
{
x->remove_consumer(op);
}
Operand* slice_out = op->outputs[0];
for (auto& x : slice_out->consumers)
{
for (size_t j = 0; j < x->inputs.size(); j++)
{
if (x->inputs[j] == slice_out)
x->inputs[j] = op->inputs[0];
}
op->inputs[0]->consumers.push_back(x);
}
op->inputs[0]->name = slice_out->name;
slice_out->producer = 0;
slice_out->consumers.clear();
graph.operands.erase(std::find(graph.operands.begin(), graph.operands.end(), slice_out));
delete slice_out;
op->inputs.clear();
op->outputs.clear();
graph.ops.erase(graph.ops.begin() + i);
delete op;
break;
}
}
if (!matched)
break;
}
}
} // namespace pnnx
|