cprover
dependence_grapht Member List

This is the complete list of members for dependence_grapht, including all inherited members.

add_dep(dep_edget::kindt kind, goto_programt::const_targett from, goto_programt::const_targett to)dependence_grapht
add_edge(node_indext a, node_indext b)grapht< dep_nodet >inline
add_node()grapht< dep_nodet >inline
add_undirected_edge(node_indext a, node_indext b)grapht< dep_nodet >
ai_baset()ai_basetinline
ait()ait< dep_graph_domaint >inline
cfg_post_dominators() constdependence_graphtinline
ait< dep_graph_domaint >::clear() overrideait< dep_graph_domaint >inlinevirtual
grapht< dep_nodet >::clear()grapht< dep_nodet >inline
concurrent_fixedpoint(const goto_functionst &goto_functions, const namespacet &ns)ai_basetprotected
connected_subgraphs(std::vector< node_indext > &subgraph_nr)grapht< dep_nodet >
dependence_grapht(const namespacet &_ns)dependence_graphtinlineexplicit
do_function_call(locationt l_call, locationt l_return, const goto_functionst &goto_functions, const goto_functionst::function_mapt::const_iterator f_it, const exprt::operandst &arguments, const namespacet &ns)ai_basetprotected
do_function_call_rec(locationt l_call, locationt l_return, const exprt &function, const exprt::operandst &arguments, const goto_functionst &goto_functions, const namespacet &ns)ai_basetprotected
edge(node_indext a, node_indext b)grapht< dep_nodet >inline
edgest typedefgrapht< dep_nodet >
edget typedefgrapht< dep_nodet >
empty() constgrapht< dep_nodet >inline
entry_state(const goto_programt &)ai_basetprotected
entry_state(const goto_functionst &)ai_basetprotected
find_state(locationt l) const overrideait< dep_graph_domaint >inlineprotectedvirtual
fixedpoint(const goto_functionst &goto_functions, const namespacet &ns) overrideait< dep_graph_domaint >inlineprotectedvirtual
ai_baset::fixedpoint(const goto_programt &goto_program, const goto_functionst &goto_functions, const namespacet &ns)ai_basetprotected
get_next(working_sett &working_set)ai_basetprotected
get_state(goto_programt::const_targett l)dependence_graphtinlinevirtual
has_edge(node_indext i, node_indext j) constgrapht< dep_nodet >inline
in(node_indext n) constgrapht< dep_nodet >inline
initialize(const goto_functionst &goto_functions)dependence_graphtinlinevirtual
initialize(const goto_programt &goto_program)dependence_graphtinlinevirtual
ait< dep_graph_domaint >::initialize(const goto_functionst::goto_functiont &)ai_basetprotectedvirtual
is_dag() constgrapht< dep_nodet >inline
locationt typedefait< dep_graph_domaint >
make_chordal()grapht< dep_nodet >
make_temporary_state(const statet &s) overrideait< dep_graph_domaint >inlineprotectedvirtual
merge(const statet &src, locationt from, locationt to) overrideait< dep_graph_domaint >inlineprotectedvirtual
node_indext typedefgrapht< dep_nodet >
nodesgrapht< dep_nodet >protected
nodest typedefgrapht< dep_nodet >
nodet typedefgrapht< dep_nodet >
nsdependence_graphtprotected
operator()(const goto_programt &goto_program, const namespacet &ns)ai_basetinline
operator()(const goto_functionst &goto_functions, const namespacet &ns)ai_basetinline
operator()(const goto_modelt &goto_model)ai_basetinline
operator()(const goto_functionst::goto_functiont &goto_function, const namespacet &ns)ai_basetinline
ait< dep_graph_domaint >::operator[](locationt l)ait< dep_graph_domaint >inline
ait< dep_graph_domaint >::operator[](locationt l) constait< dep_graph_domaint >inline
grapht< dep_nodet >::operator[](node_indext n) constgrapht< dep_nodet >inline
grapht< dep_nodet >::operator[](node_indext n)grapht< dep_nodet >inline
out(node_indext n) constgrapht< dep_nodet >inline
output(const namespacet &ns, const goto_functionst &goto_functions, std::ostream &out) constai_basetvirtual
output(const goto_modelt &goto_model, std::ostream &out) constai_basetinline
output(const namespacet &ns, const goto_programt &goto_program, std::ostream &out) constai_basetinline
output(const namespacet &ns, const goto_functionst::goto_functiont &goto_function, std::ostream &out) constai_basetinline
output(const namespacet &ns, const goto_programt &goto_program, const irep_idt &identifier, std::ostream &out) constai_basetprotectedvirtual
output_dot(std::ostream &out) constgrapht< dep_nodet >
output_dot_node(std::ostream &out, node_indext n) constgrapht< dep_nodet >
output_json(const namespacet &ns, const goto_functionst &goto_functions) constai_basetvirtual
output_json(const goto_modelt &goto_model) constai_basetinline
output_json(const namespacet &ns, const goto_programt &goto_program) constai_basetinline
output_json(const namespacet &ns, const goto_functionst::goto_functiont &goto_function) constai_basetinline
output_json(const namespacet &ns, const goto_programt &goto_program, const irep_idt &identifier) constai_basetprotectedvirtual
output_xml(const namespacet &ns, const goto_functionst &goto_functions) constai_basetvirtual
output_xml(const goto_modelt &goto_model) constai_basetinline
output_xml(const namespacet &ns, const goto_programt &goto_program) constai_basetinline
output_xml(const namespacet &ns, const goto_functionst::goto_functiont &goto_function) constai_basetinline
output_xml(const namespacet &ns, const goto_programt &goto_program, const irep_idt &identifier) constai_basetprotectedvirtual
patht typedefgrapht< dep_nodet >
post_dominatorsdependence_graphtprotected
post_dominators_mapt typedefdependence_grapht
put_in_working_set(working_sett &working_set, locationt l)ai_basetinlineprotected
rddependence_graphtprotected
reaching_definitions() constdependence_graphtinline
recursion_setai_basetprotected
recursion_sett typedefai_basetprotected
remove_edge(node_indext a, node_indext b)grapht< dep_nodet >inline
remove_edges(node_indext n)grapht< dep_nodet >inline
remove_in_edges(node_indext n)grapht< dep_nodet >
remove_out_edges(node_indext n)grapht< dep_nodet >
remove_undirected_edge(node_indext a, node_indext b)grapht< dep_nodet >
resize(node_indext s)grapht< dep_nodet >inline
SCCs(std::vector< node_indext > &subgraph_nr)grapht< dep_nodet >
sequential_fixedpoint(const goto_functionst &goto_functions, const namespacet &ns)ai_basetprotected
shortest_loop(node_indext node, patht &path) constgrapht< dep_nodet >inline
shortest_path(node_indext src, node_indext dest, patht &path) constgrapht< dep_nodet >inline
shortest_path(node_indext src, node_indext dest, patht &path, bool non_trivial) constgrapht< dep_nodet >protected
size() constgrapht< dep_nodet >inline
state_mapait< dep_graph_domaint >protected
state_mapt typedefait< dep_graph_domaint >protected
statet typedefai_baset
swap(grapht &other)grapht< dep_nodet >inline
tarjan(class tarjant &t, node_indext v)grapht< dep_nodet >protected
topsort() constgrapht< dep_nodet >
visit(locationt l, working_sett &working_set, const goto_programt &goto_program, const goto_functionst &goto_functions, const namespacet &ns)ai_basetprotected
visit_reachable(node_indext src)grapht< dep_nodet >
working_sett typedefai_basetprotected
~ai_baset()ai_basetinlinevirtual