IntenseWebs/openvino
3
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

[LPT] Correct a check for whether model is quantized (#12364)

Browse Source 
Look inside subgraph operations, such as TensorIterator, Loop, If, etc
This commit is contained in:
Egor Duplenskii 2022-08-03 18:36:01 +02:00 committed by GitHub
parent 3bd1002c88
commit a89c4cfc3f
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 18 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

26
src/common/low_precision_transformations/src/low_precision.cpp
View File

@ -13,6 +13,8 @@
#include <ngraph/opsets/opset1.hpp> #include <ngraph/opsets/opset1.hpp>
#include <ngraph/opsets/opset4.hpp> #include <ngraph/opsets/opset4.hpp>
#include <ngraph/opsets/opset6.hpp> #include <ngraph/opsets/opset6.hpp>
#include "ngraph/op/util/multi_subgraph_base.hpp"
#include <transformations/utils/utils.hpp> #include <transformations/utils/utils.hpp>
#include <low_precision/lpt_itt.hpp> #include <low_precision/lpt_itt.hpp>
@ -260,31 +262,39 @@ bool ngraph::pass::low_precision::LowPrecision::run_on_model(const std::shared_p
bool ngraph::pass::low_precision::LowPrecision::isFunctionQuantized(const std::shared_ptr<const ngraph::Function>& function) { bool ngraph::pass::low_precision::LowPrecision::isFunctionQuantized(const std::shared_ptr<const ngraph::Function>& function) {
std::set<std::shared_ptr<ngraph::Node>> handledNodes; std::set<std::shared_ptr<ngraph::Node>> handledNodes;
std::deque<std::shared_ptr<ngraph::Node>> nodes; std::deque<std::shared_ptr<ngraph::Node>> nodes;
for (auto result : function->get_results()) { for (const auto result : function->get_results()) {
nodes.push_front(result); nodes.push_front(result);
} }
while (!nodes.empty()) { while (!nodes.empty()) {
auto node = nodes.front(); const auto node = nodes.front();
nodes.pop_front(); nodes.pop_front();
for (size_t i = 0; i < node->inputs().size(); ++i) { for (size_t i = 0; i < node->inputs().size(); ++i) {
auto parent = node->get_input_node_shared_ptr(i); const auto parent = node->get_input_node_shared_ptr(i);
if (handledNodes.find(parent) != handledNodes.end()) { if (handledNodes.find(parent) != handledNodes.end()) {
continue; continue;
} }
const std::shared_ptr<ngraph::opset1::FakeQuantize> fakeQuantize = ov::as_type_ptr<ngraph::opset1::FakeQuantize>(parent); if (const auto fakeQuantize = ov::as_type_ptr<ngraph::opset1::FakeQuantize>(parent)) {
if ((fakeQuantize != nullptr) && if (QuantizationDetails::outputLayoutIsSupported(fakeQuantize, true) &&
QuantizationDetails::outputLayoutIsSupported(fakeQuantize, true) && QuantizationDetails::isSupportedLevel(fakeQuantize->get_levels())) {
QuantizationDetails::isSupportedLevel(fakeQuantize->get_levels())) { return true;
return true; }
} else if (const auto multiSubGraph = ov::as_type_ptr<ngraph::op::util::MultiSubGraphOp>(parent)) {
// Look inside subraph operations, such as TensorIterator, Loop, If, etc
for (int i = 0; i < multiSubGraph->get_internal_subgraphs_size(); i++) {
if (isFunctionQuantized(multiSubGraph->get_function(i))) {
return true;
}
}
} }
nodes.push_front(parent); nodes.push_front(parent);
handledNodes.insert(parent); handledNodes.insert(parent);
} }
} }
return false; return false;
} }