diff --git a/inference-engine/src/mkldnn_plugin/nodes/mkldnn_split_node.cpp b/inference-engine/src/mkldnn_plugin/nodes/mkldnn_split_node.cpp index 9d063f0e79c6bd..ad7426d1dae45e 100644 --- a/inference-engine/src/mkldnn_plugin/nodes/mkldnn_split_node.cpp +++ b/inference-engine/src/mkldnn_plugin/nodes/mkldnn_split_node.cpp @@ -555,7 +555,6 @@ void MKLDNNSplitNode::initializeDstMemPtrs() { //It's important in case when several edges are connected to one port. //This is a naive implementation, an indexed priority queue or modified treap would be a more elegant solution. std::unordered_map mapDstPtrs; - using pair_t = std::pair; for (size_t i = 0; i < getChildEdges().size(); ++i) { auto outputEdge = this->getChildEdgeAt(i); if (uint8_t* dstData = reinterpret_cast(outputEdge->getMemoryPtr()->GetPtr())) { diff --git a/openvino/conditional_compilation/include/openvino/cc/selective_build.h b/openvino/conditional_compilation/include/openvino/cc/selective_build.h index 96e4cb64e6d7e5..7e41d463dcf067 100644 --- a/openvino/conditional_compilation/include/openvino/cc/selective_build.h +++ b/openvino/conditional_compilation/include/openvino/cc/selective_build.h @@ -167,7 +167,7 @@ bool match(char const *region, Ctx && ctx, T && val, Case && cs) { const bool is_matched = val == cs.value; if (is_matched) { openvino::itt::ScopedTask task( - openvino::itt::handle( + openvino::itt::handle( std::string(region) + "$" + cs.name)); Fn()(std::forward(ctx)); }