diff options
author | Georgios Pinitas <georgios.pinitas@arm.com> | 2021-02-22 18:17:43 +0000 |
---|---|---|
committer | Georgios Pinitas <georgios.pinitas@arm.com> | 2021-02-23 10:58:46 +0000 |
commit | b0cd5d8cf6945bed4df62603799d73b5413654a1 (patch) | |
tree | ffe6e7597960f596dd5023450ddab7dea3c8376e /src/runtime/CL/mlgo | |
parent | 27e67f0b2047cfa2f011f9e242e3068d9e106b39 (diff) | |
download | ComputeLibrary-b0cd5d8cf6945bed4df62603799d73b5413654a1.tar.gz |
Use polymorphic_downcast instead of dynamic_cast
Signed-off-by: Georgios Pinitas <georgios.pinitas@arm.com>
Change-Id: Ibd8f629c3f0a2943705ba0f7d65a264948dac4b0
Reviewed-on: https://review.mlplatform.org/c/ml/ComputeLibrary/+/5147
Tested-by: Arm Jenkins <bsgcomp@arm.com>
Reviewed-by: Michele Di Giorgio <michele.digiorgio@arm.com>
Comments-Addressed: Arm Jenkins <bsgcomp@arm.com>
Diffstat (limited to 'src/runtime/CL/mlgo')
-rw-r--r-- | src/runtime/CL/mlgo/HeuristicTree.cpp | 8 |
1 files changed, 5 insertions, 3 deletions
diff --git a/src/runtime/CL/mlgo/HeuristicTree.cpp b/src/runtime/CL/mlgo/HeuristicTree.cpp index 65219998cb..1c75cdc427 100644 --- a/src/runtime/CL/mlgo/HeuristicTree.cpp +++ b/src/runtime/CL/mlgo/HeuristicTree.cpp @@ -24,6 +24,8 @@ #include "src/runtime/CL/mlgo/HeuristicTree.h" #include "arm_compute/core/Log.h" +#include "support/Cast.h" + #include <algorithm> #include <deque> #include <set> @@ -114,7 +116,7 @@ std::pair<bool, T> HeuristicTree::query(GEMMShape shape) const return std::make_pair(false, T{}); } ARM_COMPUTE_ERROR_ON_MSG(cur_node->type() != NodeType::Branch, "Unexpected NodeType"); - auto br_node = dynamic_cast<BranchNode *>(cur_node); + auto br_node = utils::cast::polymorphic_downcast<BranchNode *>(cur_node); if(evaluate(shape, br_node->condition)) { cur_node = _tree.at(br_node->true_node).get(); @@ -126,7 +128,7 @@ std::pair<bool, T> HeuristicTree::query(GEMMShape shape) const ++depth; } ARM_COMPUTE_ERROR_ON_MSG(cur_node->type() != NodeType::Leaf, "Unexpected NodeType"); - auto l_node = dynamic_cast<LeafNode<T> *>(cur_node); + auto l_node = utils::cast::polymorphic_downcast<LeafNode<T> *>(cur_node); return std::make_pair(true, l_node->value); } @@ -202,7 +204,7 @@ bool HeuristicTree::check_if_structurally_correct() const auto cur_node = _tree.at(id).get(); if(cur_node->type() == NodeType::Branch) { - auto br_node = dynamic_cast<BranchNode *>(cur_node); + auto br_node = utils::cast::polymorphic_downcast<BranchNode *>(cur_node); to_visit.push_back(br_node->true_node); to_visit.push_back(br_node->false_node); } |