File size: 2,828 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 | // 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_tuple_pair.h"
#include <algorithm>
#include "pass_level2.h"
namespace pnnx {
void eliminate_tuple_pair(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 != "prim::TupleConstruct")
continue;
if (op->outputs[0]->consumers.size() != 1)
continue;
Operator* op2 = op->outputs[0]->consumers[0];
if (op2->type != "prim::TupleUnpack")
continue;
if (op->inputs.size() != op2->outputs.size())
continue;
matched = true;
const size_t count = op->inputs.size();
for (size_t j = 0; j < count; j++)
{
op->inputs[j]->remove_consumer(op);
for (auto& x : op2->outputs[j]->consumers)
{
op->inputs[j]->consumers.push_back(x);
for (size_t k = 0; k < x->inputs.size(); k++)
{
if (x->inputs[k] == op2->outputs[j])
x->inputs[k] = op->inputs[j];
}
}
op2->outputs[j]->producer = 0;
op2->outputs[j]->consumers.clear();
graph.operands.erase(std::find(graph.operands.begin(), graph.operands.end(), op2->outputs[j]));
delete op2->outputs[j];
}
graph.operands.erase(std::find(graph.operands.begin(), graph.operands.end(), op->outputs[0]));
delete op->outputs[0];
op->inputs.clear();
op->outputs.clear();
op2->inputs.clear();
op2->outputs.clear();
graph.ops.erase(std::find(graph.ops.begin(), graph.ops.end(), op));
delete op;
graph.ops.erase(std::find(graph.ops.begin(), graph.ops.end(), op2));
delete op2;
break;
}
if (!matched)
break;
}
}
} // namespace pnnx
|