@@ -54,9 +54,6 @@ class abstract_loopst
5454protected:
5555 // target abstract loop number for each function
5656 loop_mapt target_loop_map;
57- // set of all leaf dependency nodes for loop variables
58- // nodeset leaf_nodes;
59- // nodeset update_nodes;
6057 // current function
6158 irep_idt fn;
6259 // map from instruction line # to the set of loops it belongs to
@@ -119,7 +116,7 @@ class abstract_loopst
119116 }
120117
121118 // / Check if a node has self-cycle in data dependency
122- // / Inefficient method, will get updated
119+ // / Inefficient method, should get updated
123120 // / \param target: node location
124121 // / \param dep_graph: dependency graph for the program
125122 bool is_in_cycle (unsigned target, const dependence_grapht &dep_graph)
@@ -273,7 +270,6 @@ void abstract_loopst::update_shrinkability(unsigned loc, irep_idt func)
273270{
274271 for (auto loop_n: insloop_map[loc])
275272 {
276- // irep_idt func = dep_graph[loc].PC->function;
277273 abstract_loopt *loop_info = &(absloop_map[func].find (loop_n)->second );
278274 loop_info->shrinkable = false ;
279275#ifdef DEBUG_ABSTRACT_LOOPS
@@ -328,8 +324,6 @@ void abstract_loopst::check_assertion(unsigned location,
328324 it != data_deps.end (); ++it)
329325 {
330326 add_to_queue (dep_set, dep_queue, (*it)->location_number );
331- // if(is_in_cycle(node, dep_graph))
332- // update_set.insert(node);
333327 if (ctrl_set.find (node) == ctrl_set.end ())
334328 update_set.insert (node);
335329 }
@@ -570,9 +564,6 @@ void abstract_loopst::get_loop_info(
570564 insloop_map[n].insert (last->loop_number );
571565
572566 absloop_map[fn].insert (loopnum_pair (last->loop_number , loop_info));
573- // leaf_nodes.insert(loop_info.var_leaves.begin(), loop_info.var_leaves.end());
574- // update_nodes.insert(loop_info.var_updates.begin(),
575- // loop_info.var_updates.end());
576567}
577568
578569// / Main function for abstraction, has 3 iterations to
0 commit comments