cprover
Loading...
Searching...
No Matches
procedure_local_concurrent_cfg_baset< T, P, I > Class Template Reference

#include <cfg.h>

Inheritance diagram for procedure_local_concurrent_cfg_baset< T, P, I >:
Collaboration diagram for procedure_local_concurrent_cfg_baset< T, P, I >:

Additional Inherited Members

Public Types inherited from cfg_baset< T, const goto_programt, goto_programt::const_targett >
typedef base_grapht::node_indext entryt
typedef base_grapht::nodet nodet
Public Types inherited from grapht< cfg_base_nodet< T, goto_programt::const_targett > >
typedef cfg_base_nodet< T, goto_programt::const_targettnodet
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, const goto_programt, goto_programt::const_targett >
 cfg_baset ()
virtual ~cfg_baset ()
void operator() (const goto_functionst &goto_functions)
entryt get_node_index (const goto_programt::const_targett &program_point) const
 Get the graph node index for program_point.
nodetget_node (const goto_programt::const_targett &program_point)
 Get the CFG graph node relating to program_point.
const entry_mapt & entries () const
 Get a map from program points to their corresponding node indices.
Public Member Functions inherited from grapht< cfg_base_nodet< T, goto_programt::const_targett > >
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
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.
void disconnect_unreachable (node_indext src)
 Removes any edges between nodes in a graph that are unreachable from a given start node.
std::vector< typename cfg_base_nodet< T, goto_programt::const_targett >::node_indextdepth_limited_search (typename cfg_base_nodet< T, goto_programt::const_targett >::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.
void make_chordal ()
 Ensure a graph is chordal (contains no 4+-cycles without an edge crossing the cycle) by adding extra edges.
std::size_t connected_subgraphs (std::vector< node_indext > &subgraph_nr)
 Find connected subgraphs in an undirected graph.
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.
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.
std::vector< node_indextget_predecessors (const node_indext &n) const
std::vector< node_indextget_successors (const node_indext &n) const
void output_dot (std::ostream &out) const
void for_each_predecessor (const node_indext &n, std::function< void(const node_indext &)> f) const
void for_each_successor (const node_indext &n, std::function< void(const node_indext &)> f) const
Static Public Member Functions inherited from cfg_baset< T, const goto_programt, goto_programt::const_targett >
static goto_programt::const_targett get_first_node (const goto_programt &program)
static goto_programt::const_targett get_last_node (const goto_programt &program)
static bool nodes_empty (const goto_programt &program)
Public Attributes inherited from cfg_baset< T, const goto_programt, goto_programt::const_targett >
entry_mapt entry_map
Protected Member Functions inherited from concurrent_cfg_baset< T, const goto_programt, goto_programt::const_targett >
virtual void compute_edges_start_thread (const goto_programt &goto_program, const goto_programt::instructiont &instruction, goto_programt::const_targett next_PC, typename cfg_baset< T, const goto_programt, goto_programt::const_targett >::entryt &entry)
Protected Member Functions inherited from cfg_baset< T, const goto_programt, goto_programt::const_targett >
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, goto_programt::const_targett PC)
Protected Member Functions inherited from grapht< cfg_base_nodet< T, goto_programt::const_targett > >
void tarjan (class tarjant &t, node_indext v) const
Protected Member Functions inherited from procedure_local_cfg_baset< T, const goto_programt, goto_programt::const_targett >
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, const goto_programt, goto_programt::const_targett >::entryt &entry)
Protected Attributes inherited from grapht< cfg_base_nodet< T, goto_programt::const_targett > >
nodest nodes

Detailed Description

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

Definition at line 308 of file cfg.h.


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