27 cfg_nodet():node_required(
false)
32#ifdef DEBUG_FULL_SLICERT
40 typedef std::vector<cfgt::entryt> dep_node_to_cfgt;
41 typedef std::stack<cfgt::entryt> queuet;
43 inline void add_to_queue(
45 const cfgt::entryt &entry,
48#ifdef DEBUG_FULL_SLICERT
49 cfg[entry].required_by.insert(reason->location_number);
69 for(
const auto &entry :
cfg.entries())
77 else if((instruction->is_goto() && instruction->guard.is_true()) ||
78 instruction->is_throw())
80 else if(instruction->is_decl())
82 const auto &s=instruction->decl_symbol();
85 else if(instruction->is_dead())
87 const auto &s=instruction->dead_symbol();
102 for(
auto &
gf_entry : goto_functions.function_map)
104 if(
gf_entry.second.body_available())
109 if(!
i_it->is_end_function() &&
112#ifdef DEBUG_FULL_SLICERT
115 std::string
c=
"ins:"+std::to_string(
i_it->location_number);
117 for(std::set<unsigned>::const_iterator
118 req_it=node.required_by.begin();
119 req_it!=node.required_by.end();
122 if(
req_it!=node.required_by.begin())
126 i_it->source_location.set_column(
c);
127 i_it->source_location.set_comment(
c);
149 for(
unsigned i=0; i<
dep_graph.size(); ++i)
155 while(!queue.empty())
157 while(!queue.empty())
164 if(node.node_required)
168 node.node_required=
true;
187 const cfgt::nodet &node,
195 for(dependence_grapht::edgest::const_iterator
241 map<goto_programt::const_targett, unsigned, goto_programt::target_less_than>
243 typedef std::map<irep_idt, goto_program_change_impactt>
300 old_goto_functions(
model_old.goto_functions),
302 new_goto_functions(
model_new.goto_functions),
305 old_dep_graph(ns_old, message_handler),
306 new_dep_graph(ns_new, message_handler)
326 goto_functionst::function_mapt::const_iterator
old_fit =
328 goto_functionst::function_mapt::const_iterator
new_fit =
364 for(
const auto &d :
diff)
430 for(dependence_grapht::edgest::const_iterator it =
d_node.out.begin();
431 it !=
d_node.out.end(); ++it)
463 for(dependence_grapht::edgest::const_iterator it =
d_node.in.begin();
464 it !=
d_node.in.end(); ++it)
496 goto_functionst::function_mapt::const_iterator>
505 old_funcs.insert(std::make_pair(it->first, it));
511 new_funcs.insert(std::make_pair(it->first, it));
515 for(function_mapt::const_iterator
itn=
new_funcs.begin();
530 goto_functions_change_impactt::const_iterator
oc_it=
532 for(goto_functions_change_impactt::const_iterator
576 goto_functionst::function_mapt::const_iterator
f_it =
582 std::cout <<
"/** " << function_id <<
" **/\n";
586 goto_program_change_impactt::const_iterator
c_entry=
624 goto_functionst::function_mapt::const_iterator
o_f_it =
629 goto_functionst::function_mapt::const_iterator
f_it =
635 std::cout <<
"/** " << function_id <<
" **/\n";
641 goto_program_change_impactt::const_iterator
o_c_entry=
644 ?
static_cast<unsigned>(
SAME)
655 goto_program_change_impactt::const_iterator
c_entry=
687 "expected kind of flag");
697 "expected kind of flag");
709 goto_program_change_impactt::const_iterator
o_c_entry=
712 ?
static_cast<unsigned>(
SAME)
745 const irep_idt &file = target->source_location().get_file();
746 const irep_idt &line = target->source_location().get_line();
748 std::cout << prefix <<
" " <<
id2string(file)
754 target->
output(std::cout);
void change_impact(const goto_modelt &model_old, const goto_modelt &model_new, impact_modet impact_mode, bool compact_output, message_handlert &message_handler)
Data and control-dependencies of syntactic diff.
virtual void output(const namespacet &ns, const irep_idt &function_id, const goto_programt &goto_program, std::ostream &out) const
Output the abstract states for a single function.
ait supplies three of the four components needed: an abstract interpreter (in this case handling func...
base_grapht::node_indext entryt
nodet & get_node(const goto_programt::const_targett &program_point)
Get the CFG graph node relating to program_point.
entryt get_node_index(const goto_programt::const_targett &program_point) const
Get the graph node index for program_point.
goto_functions_change_impactt old_change_impact
unified_difft unified_diff
std::map< goto_programt::const_targett, unsigned, goto_programt::target_less_than > goto_program_change_impactt
void change_impact(const irep_idt &function_id)
change_impactt(const goto_modelt &model_old, const goto_modelt &model_new, impact_modet impact_mode, bool compact_output, message_handlert &message_handler)
void output_instruction(char prefix, const goto_programt &goto_program, const namespacet &ns, goto_programt::const_targett &target) const
dependence_grapht new_dep_graph
void propogate_dep_back(const irep_idt &function_id, const dependence_grapht::nodet &d_node, const dependence_grapht &dep_graph, goto_functions_change_impactt &change_impact, bool del)
std::map< irep_idt, goto_program_change_impactt > goto_functions_change_impactt
const goto_functionst & old_goto_functions
goto_functions_change_impactt new_change_impact
void output_change_impact(const irep_idt &function_id, const goto_program_change_impactt &c_i, const goto_functionst &goto_functions, const namespacet &ns) const
dependence_grapht old_dep_graph
void propogate_dep_forward(const irep_idt &function_id, const dependence_grapht::nodet &d_node, const dependence_grapht &dep_graph, goto_functions_change_impactt &change_impact, bool del)
const goto_functionst & new_goto_functions
dstringt has one field, an unsigned integer no which is an index into a static table of strings.
void add_function_calls(const cfgt::nodet &node, queuet &queue, const goto_functionst &goto_functions)
std::list< cfgt::entryt > jumpst
void add_to_queue(queuet &queue, const cfgt::entryt &entry, goto_programt::const_targett reason)
std::unordered_map< irep_idt, queuet > decl_deadt
void add_dependencies(const cfgt::nodet &node, queuet &queue, const dependence_grapht &dep_graph, const dep_node_to_cfgt &dep_node_to_cfg)
void fixedpoint(goto_functionst &goto_functions, queuet &queue, jumpst &jumps, decl_deadt &decl_dead, const dependence_grapht &dep_graph)
void add_decl_dead(const cfgt::nodet &node, queuet &queue, decl_deadt &decl_dead)
void operator()(goto_functionst &goto_functions, const namespacet &ns, const slicing_criteriont &criterion, message_handlert &message_handler)
std::stack< cfgt::entryt > queuet
void add_jumps(queuet &queue, jumpst &jumps, const dependence_grapht::post_dominators_mapt &post_dominators)
A collection of goto functions.
function_mapt function_map
A generic container class for the GOTO intermediate representation of one function.
instructionst::const_iterator const_targett
A namespacet is essentially one or two symbol tables bound together, to allow for symbol lookups in t...
std::list< std::pair< goto_programt::const_targett, differencet > > goto_program_difft
goto_program_difft get_diff(const irep_idt &function) const
Field-Sensitive Program Dependence Analysis, Litvak et al., FSE 2010.
static bool implicit(goto_programt::const_targett target)
#define forall_goto_program_instructions(it, program)
#define Forall_goto_program_instructions(it, program)
const std::string & id2string(const irep_idt &d)
void remove_skip(goto_programt &goto_program, goto_programt::targett begin, goto_programt::targett end)
remove unnecessary skip statements
#define CHECK_RETURN(CONDITION)
#define UNREACHABLE
This should be used to mark dead code.
#define DATA_INVARIANT(CONDITION, REASON)
This condition should be used to document that assumptions that are made on goto_functions,...
#define INVARIANT(CONDITION, REASON)
This macro uses the wrapper function 'invariant_violated_string'.
Unified diff (using LCSS) of goto functions.