File size: 1,758 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 | // Tencent is pleased to support the open source community by making ncnn available.
//
// Copyright (C) 2023 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 "flatten_input.h"
namespace pnnx {
void flatten_input(std::shared_ptr<torch::jit::Graph>& graph)
{
while (1)
{
bool matched = false;
for (torch::jit::Node* n : graph->nodes())
{
if (n->kind() != c10::prim::TupleUnpack && n->kind() != c10::prim::ListUnpack)
continue;
for (size_t i = 1; i < graph->inputs().size(); i++)
{
if (n->input(0) == graph->inputs()[i])
{
matched = true;
for (size_t j = 0; j < n->outputs().size(); j++)
{
torch::jit::Value* v2 = graph->insertInput(i + 1 + j);
n->output(j)->replaceAllUsesWith(v2);
}
n->destroy();
graph->eraseInput(i);
break;
}
}
if (matched)
break;
}
if (!matched)
break;
}
}
} // namespace pnnx
|