88 depst::iterator next=it;
93 bool post_dom_all=!(*it)->is_assume();
94 bool post_dom_one=
false;
98 cfg_post_dominatorst::cfgt::entry_mapt::const_iterator e=
106 for(
const auto &edge : m.out)
138 if((w_end!=-1 && w_end <= r_start) ||
139 (r_end!=-1 && w_start >= r_end))
141 else if(w_start >= r_start)
144 (r_end!=-1 && w_end > r_start))
171 for(
const auto &w_range : w_ranges)
174 for(
const auto &wr : w_range.second)
175 for(
const auto &r_range : r_ranges)
178 r_range.first, r_range.second))
206 assert(dep_graph!=
nullptr);
209 if(from->is_function_call())
237 control_deps.clear();
253 out <<
"Control dependencies: ";
254 for(depst::const_iterator
261 out << (*it)->location_number;
268 out <<
"Data dependencies: ";
269 for(depst::const_iterator
276 out << (*it)->location_number;
294 link[
"locationNumber"]=
296 link[
"sourceLocation"]=
json(cd->source_location);
303 link[
"locationNumber"]=
305 link[
"sourceLocation"]=
json(dd->source_location);
318 const node_indext n_from=state_map[from].get_node_id();
319 assert(n_from<size());
320 const node_indext n_to=state_map[to].get_node_id();
326 nodes[n_from].out[n_to].add(kind);
327 nodes[n_to].in[n_from].add(kind);
Field-Sensitive Program Dependence Analysis, Litvak et al., FSE 2010.
static const irep_idt get_function_id(const_targett l)
const reaching_definitions_analysist & reaching_definitions() const
void add_dep(dep_edget::kindt kind, goto_programt::const_targett from, goto_programt::const_targett to)
jsont & push_back(const jsont &json)
instructionst::const_iterator const_targett
void control_dependencies(goto_programt::const_targett from, goto_programt::const_targett to, dependence_grapht &dep_graph)
void goto_rw(goto_programt::const_targett target, const code_assignt &assign, rw_range_sett &rw_set)
jsont output_json(const ai_baset &ai, const namespacet &ns) const override
Outputs the current value of the domain.
void transform(goto_programt::const_targett from, goto_programt::const_targett to, ai_baset &ai, const namespacet &ns) final
const post_dominators_mapt & cfg_post_dominators() const
value_setst & get_value_sets() const
nodet::node_indext node_indext
#define forall_rw_range_set_r_objects(it, rw_set)
void data_dependencies(goto_programt::const_targett from, goto_programt::const_targett to, dependence_grapht &dep_graph, const namespacet &ns)
const V & get(const std::size_t value_index) const
static bool may_be_def_use_pair(const mp_integer &w_start, const mp_integer &w_end, const mp_integer &r_start, const mp_integer &r_end)
bool merge(const dep_graph_domaint &src, goto_programt::const_targett from, goto_programt::const_targett to)
const range_domaint & get_ranges(objectst::const_iterator it) const
json_objectt & make_object()
virtual statet & get_state(goto_programt::const_targett l)
std::map< locationt, rangest > ranges_at_loct
void output(std::ostream &out, const ai_baset &ai, const namespacet &ns) const final
json_objectt json(const source_locationt &location)