code clean

Author: luo-cheng2021

src/plugins/intel_cpu/src/graph.cpp

@@ -45,7 +45,6 @@
 #include "utils/node_dumper.h"
 #include "utils/precision_support.h"
 #include "utils/verbose.h"
-#include "nodes/linux_perf.hpp"
 
 #if (OV_THREAD == OV_THREAD_TBB || OV_THREAD == OV_THREAD_TBB_AUTO)
 #    include <tbb/task.h>
@@ -109,7 +108,6 @@ void Graph::Replicate(const std::shared_ptr<const ov::Model>& model,
     OV_ITT_SCOPE_CHAIN(FIRST_INFERENCE, taskChain, itt::domains::intel_cpu_LT, "Graph::Replicate", "ov::Model");
 
     this->_name = model->get_friendly_name();
-    LinuxPerf::Init();
 
     // Map data object onto producer node
     std::map<std::shared_ptr<ov::Node>, NodePtr> op2node;
@@ -1164,7 +1162,6 @@ VecMemoryDescs Graph::getOutputMemoryDescriptors() const {
 
 void Graph::InferStatic(SyncInferRequest* request, int numaId) {
     for (const auto& node : m_executableGraphNodes) {
-        auto perf1 = LinuxPerf::Profile(node->getTypeStr());
         ExecuteNodeWithCatch(node, request, numaId);
     }
 }
@@ -1440,15 +1437,11 @@ inline void Graph::ExecuteNodeWithCatch(const NodePtr& node, SyncInferRequest* r
 template <typename UpdateStrategy>
 void Graph::InferDynamic(SyncInferRequest* request, int numaId, UpdateStrategy&& update) {
     size_t inferCounter = 0;
-    auto perf = LinuxPerf::Profile(std::string("Graph::InferDynamic_#") + std::to_string(infer_count));
     for (auto stopIndx : m_executableSyncNodesInds) {
-        {
-            auto perf1 = LinuxPerf::Profile("update");
-            update(stopIndx);
-        }
+        update(stopIndx);
+
         for (; inferCounter < stopIndx; ++inferCounter) {
             auto& node = m_executableGraphNodes[inferCounter];
-            auto perf1 = LinuxPerf::Profile(node->getTypeStr()); // + "_" + node->getName());
 
             ExecuteNodeWithCatch(node, request, numaId);
         }
@@ -1494,7 +1487,8 @@ void Graph::Infer(SyncInferRequest* request) {
                         static_cast<int>(status));
     }
 
-    infer_count++;
+    if (infer_count != -1)
+        infer_count++;
 }
 
 void Graph::SortTopologically() {