cprover
procedure_local_cfg_baset< T, P, I > Class Template Reference

#include <cfg.h>

+ Inheritance diagram for procedure_local_cfg_baset< T, P, I >:
+ Collaboration diagram for procedure_local_cfg_baset< T, P, I >:

Protected Member Functions

virtual void compute_edges_function_call (const goto_functionst &goto_functions, const goto_programt &goto_program, const goto_programt::instructiont &instruction, goto_programt::const_targett next_PC, typename cfg_baset< T, P, I >::entryt &entry)
 
- Protected Member Functions inherited from cfg_baset< T, P, I >
virtual void compute_edges_goto (const goto_programt &goto_program, const goto_programt::instructiont &instruction, goto_programt::const_targett next_PC, entryt &entry)
 
virtual void compute_edges_catch (const goto_programt &goto_program, const goto_programt::instructiont &instruction, goto_programt::const_targett next_PC, entryt &entry)
 
virtual void compute_edges_throw (const goto_programt &goto_program, const goto_programt::instructiont &instruction, goto_programt::const_targett next_PC, entryt &entry)
 
virtual void compute_edges_start_thread (const goto_programt &goto_program, const goto_programt::instructiont &instruction, goto_programt::const_targett next_PC, entryt &entry)
 
virtual void compute_edges_function_call (const goto_functionst &goto_functions, const goto_programt &goto_program, const goto_programt::instructiont &instruction, goto_programt::const_targett next_PC, entryt &entry)
 
void compute_edges (const goto_functionst &goto_functions, const goto_programt &goto_program, I PC)
 
void compute_edges (const goto_functionst &goto_functions, P &goto_program)
 
void compute_edges (const goto_functionst &goto_functions)
 
- Protected Member Functions inherited from grapht< cfg_base_nodet< T, I > >
void shortest_path (node_indext src, node_indext dest, patht &path, bool non_trivial) const
 
std::vector< typename cfg_base_nodet< T, I > ::node_indextdepth_limited_search (std::vector< typename cfg_base_nodet< T, I > ::node_indext > &src, std::size_t limit, std::vector< bool > &visited) const
 Run recursive depth-limited search on the graph, starting from multiple source nodes, to find the nodes reachable within n steps. More...
 
void tarjan (class tarjant &t, node_indext v) const
 

Additional Inherited Members

- Public Types inherited from cfg_baset< T, P, I >
typedef std::size_t entryt
 
- Public Types inherited from grapht< cfg_base_nodet< T, I > >
typedef cfg_base_nodet< T, I > nodet
 
typedef nodet::edgest edgest
 
typedef std::vector< nodetnodest
 
typedef nodet::edget edget
 
typedef nodet::node_indext node_indext
 
typedef std::list< node_indextpatht
 
- Public Member Functions inherited from cfg_baset< T, P, I >
 cfg_baset ()
 
virtual ~cfg_baset ()
 
void operator() (const goto_functionst &goto_functions)
 
void operator() (P &goto_program)
 
get_first_node (P &program) const
 
get_last_node (P &program) const
 
bool nodes_empty (P &program) const
 
- Public Member Functions inherited from grapht< cfg_base_nodet< T, I > >
node_indext add_node (arguments &&... values)
 
void swap (grapht &other)
 
bool has_edge (node_indext i, node_indext j) const
 
const nodetoperator[] (node_indext n) const
 
nodetoperator[] (node_indext n)
 
void resize (node_indext s)
 
std::size_t size () const
 
bool empty () const
 
const edgestin (node_indext n) const
 
const edgestout (node_indext n) const
 
void add_edge (node_indext a, node_indext b)
 
void remove_edge (node_indext a, node_indext b)
 
edgetedge (node_indext a, node_indext b)
 
void add_undirected_edge (node_indext a, node_indext b)
 
void remove_undirected_edge (node_indext a, node_indext b)
 
void remove_in_edges (node_indext n)
 
void remove_out_edges (node_indext n)
 
void remove_edges (node_indext n)
 
void clear ()
 
void shortest_path (node_indext src, node_indext dest, patht &path) const
 
void shortest_loop (node_indext node, patht &path) const
 
void visit_reachable (node_indext src)
 
std::vector< node_indextget_reachable (node_indext src, bool forwards) const
 Run depth-first search on the graph, starting from a single source node. More...
 
std::vector< node_indextget_reachable (const std::vector< node_indext > &src, bool forwards) const
 Run depth-first search on the graph, starting from multiple source nodes. More...
 
void disconnect_unreachable (node_indext src)
 Removes any edges between nodes in a graph that are unreachable from a given start node. More...
 
void disconnect_unreachable (const std::vector< node_indext > &src)
 Removes any edges between nodes in a graph that are unreachable from a vector of start nodes. More...
 
std::vector< typename cfg_base_nodet< T, I > ::node_indextdepth_limited_search (typename cfg_base_nodet< T, I > ::node_indext src, std::size_t limit) const
 Run recursive depth-limited search on the graph, starting from multiple source nodes, to find the nodes reachable within n steps. More...
 
std::vector< typename cfg_base_nodet< T, I > ::node_indextdepth_limited_search (std::vector< typename cfg_base_nodet< T, I > ::node_indext > &src, std::size_t limit) const
 Run recursive depth-limited search on the graph, starting from multiple source nodes, to find the nodes reachable within n steps. More...
 
void make_chordal ()
 Ensure a graph is chordal (contains no 4+-cycles without an edge crossing the cycle) by adding extra edges. More...
 
std::size_t connected_subgraphs (std::vector< node_indext > &subgraph_nr)
 Find connected subgraphs in an undirected graph. More...
 
std::size_t SCCs (std::vector< node_indext > &subgraph_nr) const
 Computes strongly-connected components of a graph and yields a vector expressing a mapping from nodes to components indices. More...
 
bool is_dag () const
 
std::list< node_indexttopsort () const
 Find a topological order of the nodes if graph is DAG, return empty list for non-DAG or empty graph. More...
 
std::vector< node_indextget_successors (const node_indext &n) const
 
void output_dot (std::ostream &out) const
 
void for_each_successor (const node_indext &n, std::function< void(const node_indext &)> f) const
 
- Public Attributes inherited from cfg_baset< T, P, I >
entry_mapt entry_map
 
- Protected Attributes inherited from grapht< cfg_base_nodet< T, I > >
nodest nodes
 

Detailed Description

template<class T, typename P = const goto_programt, typename I = goto_programt::const_targett>
class procedure_local_cfg_baset< T, P, I >

Definition at line 194 of file cfg.h.

Member Function Documentation

◆ compute_edges_function_call()

template<class T, typename P, typename I>
void procedure_local_cfg_baset< T, P, I >::compute_edges_function_call ( const goto_functionst goto_functions,
const goto_programt goto_program,
const goto_programt::instructiont instruction,
goto_programt::const_targett  next_PC,
typename cfg_baset< T, P, I >::entryt entry 
)
protectedvirtual

Definition at line 337 of file cfg.h.


The documentation for this class was generated from the following file: