DATA_FLOW: fix build for linux
This commit is contained in:
@@ -65,21 +65,21 @@ void BackwardDataFlowAnalysis<NodeType>::fit(const std::vector<SAPFOR::BasicBloc
|
|||||||
|
|
||||||
std::reverse(blocks_sorted.begin(), blocks_sorted.end());
|
std::reverse(blocks_sorted.begin(), blocks_sorted.end());
|
||||||
|
|
||||||
nodes.clear();
|
this->nodes.clear();
|
||||||
std::map<SAPFOR::BasicBlock*, NodeType*> node_by_block;
|
std::map<SAPFOR::BasicBlock*, NodeType*> node_by_block;
|
||||||
|
|
||||||
for (auto block : blocks_sorted)
|
for (auto block : blocks_sorted)
|
||||||
{
|
{
|
||||||
NodeType* node = createNode(block);
|
NodeType* node = this->createNode(block);
|
||||||
nodes.push_back(node);
|
this->nodes.push_back(node);
|
||||||
node_by_block[block] = 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++)
|
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());
|
auto back_edges_by_src_it = back_edges_by_src.find(node->getBlock());
|
||||||
if (back_edges_by_src_it != back_edges_by_src.end())
|
if (back_edges_by_src_it != back_edges_by_src.end())
|
||||||
|
|||||||
Reference in New Issue
Block a user