!11667 [MS][LITE]nested loop expand
From: @mengyuanli Reviewed-by: @zhanghaibo5,@hangangqiang Signed-off-by: @hangangqiangpull/11667/MERGE
mindspore-ci-bot
4 years ago
committed by
Gitee
commit
d50bae7a87
@ -0,0 +1,98 @@
|
||||
/**
|
||||
* Copyright 2021 Huawei Technologies Co., Ltd
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* 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 <vector>
|
||||
#include <set>
|
||||
#include <algorithm>
|
||||
#include <memory>
|
||||
#include "tools/converter/legacy_optimizer/graph/nested_loop_expand_pass.h"
|
||||
#include "src/common/log_adapter.h"
|
||||
#include "src/common/utils.h"
|
||||
#include "tools/common/graph_util.h"
|
||||
#include "include/errorcode.h"
|
||||
#include "schema/inner/model_generated.h"
|
||||
|
||||
namespace mindspore {
|
||||
namespace lite {
|
||||
bool NestedLoopExpandPass::IsNestedPartial(const std::unique_ptr<CNodeT> &node) {
|
||||
if (node->primitive->value.type != PrimitiveType_Partial) {
|
||||
return false;
|
||||
}
|
||||
auto subgraph_idx = ((schema::PartialT *)(node->primitive->value.value))->subGraphIndex;
|
||||
auto &this_subgraph = graph_->subGraph.at(subgraph_idx);
|
||||
|
||||
for (auto &node_idx : this_subgraph->nodeIndices) {
|
||||
auto &cnode = graph_->nodes.at(node_idx);
|
||||
if (cnode->primitive->value.type == PrimitiveType_Partial) {
|
||||
return true;
|
||||
}
|
||||
}
|
||||
return false;
|
||||
}
|
||||
|
||||
void NestedLoopExpandPass::ReplacePartialNodeWithSubgraph(const std::unique_ptr<SubGraphT> &main_graph) {
|
||||
bool is_changed = false;
|
||||
for (auto &node_idx : main_graph->nodeIndices) {
|
||||
auto &node = graph_->nodes.at(node_idx);
|
||||
if (!IsNestedPartial(node)) {
|
||||
continue;
|
||||
}
|
||||
is_changed = true;
|
||||
auto subgraph_idx = ((schema::PartialT *)(node->primitive->value.value))->subGraphIndex;
|
||||
auto &this_subgraph = graph_->subGraph.at(subgraph_idx);
|
||||
subgraph_to_drop_.push_back(subgraph_idx);
|
||||
auto partial_pos = std::find(main_graph->nodeIndices.begin(), main_graph->nodeIndices.end(), node_idx);
|
||||
std::vector<uint32_t> tmp;
|
||||
tmp.assign(main_graph->nodeIndices.begin(), partial_pos);
|
||||
tmp.insert(tmp.end(), this_subgraph->nodeIndices.begin(), this_subgraph->nodeIndices.end());
|
||||
tmp.insert(tmp.end(), partial_pos + 1, main_graph->nodeIndices.end());
|
||||
main_graph->nodeIndices.assign(tmp.begin(), tmp.end());
|
||||
}
|
||||
|
||||
if (is_changed) {
|
||||
ReplacePartialNodeWithSubgraph(main_graph);
|
||||
}
|
||||
}
|
||||
|
||||
STATUS NestedLoopExpandPass::Run(schema::MetaGraphT *graph) {
|
||||
graph_ = graph;
|
||||
auto &main_graph = graph_->subGraph[0];
|
||||
|
||||
ReplacePartialNodeWithSubgraph(main_graph);
|
||||
|
||||
for (auto idx : subgraph_to_drop_) {
|
||||
graph_->subGraph.at(idx) = nullptr;
|
||||
}
|
||||
|
||||
for (auto it = graph_->subGraph.begin(); it != graph_->subGraph.end();) {
|
||||
if ((*it) == nullptr) {
|
||||
it = graph_->subGraph.erase(it);
|
||||
} else {
|
||||
it++;
|
||||
}
|
||||
}
|
||||
|
||||
for (auto &node : graph_->nodes) {
|
||||
if (node->primitive->value.type == PrimitiveType_Partial) {
|
||||
((schema::PartialT *)(node->primitive->value.value))->subGraphIndex -= subgraph_to_drop_.size();
|
||||
}
|
||||
}
|
||||
|
||||
return RET_OK;
|
||||
}
|
||||
|
||||
} // namespace lite
|
||||
} // namespace mindspore
|
||||
@ -0,0 +1,47 @@
|
||||
/**
|
||||
* Copyright 2021 Huawei Technologies Co., Ltd
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
#ifndef MINDSPORE_LITE_NESTED_LOOP_EXPAND_PASS_H
|
||||
#define MINDSPORE_LITE_NESTED_LOOP_EXPAND_PASS_H
|
||||
|
||||
#include <vector>
|
||||
#include <utility>
|
||||
#include <set>
|
||||
#include <memory>
|
||||
#include "tools/converter/optimizer.h"
|
||||
|
||||
namespace mindspore {
|
||||
namespace lite {
|
||||
class NestedLoopExpandPass : public GraphPass {
|
||||
public:
|
||||
NestedLoopExpandPass() = default;
|
||||
|
||||
~NestedLoopExpandPass() override = default;
|
||||
|
||||
STATUS Run(schema::MetaGraphT *graph) override;
|
||||
|
||||
private:
|
||||
bool IsNestedPartial(const std::unique_ptr<CNodeT> &node);
|
||||
|
||||
void ReplacePartialNodeWithSubgraph(const std::unique_ptr<SubGraphT> &main_graph);
|
||||
|
||||
schema::MetaGraphT *graph_ = nullptr;
|
||||
|
||||
std::vector<int> subgraph_to_drop_{};
|
||||
};
|
||||
} // namespace lite
|
||||
} // namespace mindspore
|
||||
#endif // MINDSPORE_PREDICT_ISOLATED_NODE_REMOVE_PASS_H
|
||||
Loading…
Reference in new issue