From aa3c28847a1d5eabbb901a9a6b9eb4744979388c Mon Sep 17 00:00:00 2001
From: XNPSTER <XNPSTER@yandex.ru>
Date: Sat, 13 Jan 2024 13:41:31 +0300
Subject: [PATCH] DATA_FLOW: fix build for linux

---
 .../_src/CFGraph/DataFlow/backward_data_flow_impl.h    | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

diff --git a/sapfor/experts/Sapfor_2017/_src/CFGraph/DataFlow/backward_data_flow_impl.h b/sapfor/experts/Sapfor_2017/_src/CFGraph/DataFlow/backward_data_flow_impl.h
index e406432..4578e7b 100644
--- a/sapfor/experts/Sapfor_2017/_src/CFGraph/DataFlow/backward_data_flow_impl.h
+++ b/sapfor/experts/Sapfor_2017/_src/CFGraph/DataFlow/backward_data_flow_impl.h
@@ -65,21 +65,21 @@ void BackwardDataFlowAnalysis<NodeType>::fit(const std::vector<SAPFOR::BasicBloc
 
     std::reverse(blocks_sorted.begin(), blocks_sorted.end());
 
-    nodes.clear();
+    this->nodes.clear();
     std::map<SAPFOR::BasicBlock*, NodeType*> node_by_block;
 
     for (auto block : blocks_sorted)
     {
-        NodeType* node = createNode(block);
-        nodes.push_back(node);
+        NodeType* node = this->createNode(block);
+        this->nodes.push_back(node);
         node_by_block[block] = node;
     }
 
-    int nodes_size = nodes.size();
+    int nodes_size = this->nodes.size();
 
     for (int i = 0; i < nodes_size; i++)
     {
-        NodeType* node = nodes[i];
+        NodeType* node = this->nodes[i];
 
         auto back_edges_by_src_it = back_edges_by_src.find(node->getBlock());
         if (back_edges_by_src_it != back_edges_by_src.end())