#include <event_graph.h>
|
| event_grapht (messaget &_message) |
|
event_idt | add_node () |
|
grapht< abstract_eventt >::nodet & | operator[] (event_idt n) |
|
bool | has_po_edge (event_idt i, event_idt j) const |
|
bool | has_com_edge (event_idt i, event_idt j) const |
|
std::size_t | size () const |
|
const wmm_grapht::edgest & | po_in (event_idt n) const |
|
const wmm_grapht::edgest & | po_out (event_idt n) const |
|
const wmm_grapht::edgest & | com_in (event_idt n) const |
|
const wmm_grapht::edgest & | com_out (event_idt n) const |
|
void | add_po_edge (event_idt a, event_idt b) |
|
void | add_po_back_edge (event_idt a, event_idt b) |
|
void | add_com_edge (event_idt a, event_idt b) |
|
void | add_undirected_com_edge (event_idt a, event_idt b) |
|
void | remove_po_edge (event_idt a, event_idt b) |
|
void | remove_com_edge (event_idt a, event_idt b) |
|
void | remove_edge (event_idt a, event_idt b) |
|
void | explore_copy_segment (std::set< event_idt > &explored, event_idt begin, event_idt end) const |
| copies the segment More...
|
|
event_idt | copy_segment (event_idt begin, event_idt end) |
|
bool | is_local (event_idt a) |
|
bool | are_po_ordered (event_idt a, event_idt b) |
|
void | clear () |
|
void | print_graph () |
|
void | print_rec_graph (std::ofstream &file, event_idt node_id, std::set< event_idt > &visited) |
|
void | collect_cycles (std::set< critical_cyclet > &set_of_cycles, memory_modelt model, const std::set< event_idt > &filter) |
|
void | collect_cycles (std::set< critical_cyclet > &set_of_cycles, memory_modelt model) |
|
void | set_parameters_collection (unsigned _max_var=0, unsigned _max_po_trans=0, bool _ignore_arrays=false) |
|
void | collect_pairs () |
|
void | collect_pairs_naive () |
|
Definition at line 34 of file event_graph.h.
◆ event_grapht()
event_grapht::event_grapht |
( |
messaget & |
_message | ) |
|
|
inlineexplicit |
◆ add_com_edge()
◆ add_node()
◆ add_po_back_edge()
◆ add_po_edge()
◆ add_undirected_com_edge()
◆ are_po_ordered()
◆ clear()
void event_grapht::clear |
( |
void |
| ) |
|
|
inline |
◆ collect_cycles() [1/2]
◆ collect_cycles() [2/2]
◆ collect_pairs()
void event_grapht::collect_pairs |
( |
| ) |
|
|
inline |
◆ collect_pairs_naive()
void event_grapht::collect_pairs_naive |
( |
| ) |
|
|
inline |
◆ com_in()
◆ com_out()
◆ copy_segment()
◆ explore_copy_segment()
copies the segment
- Parameters
-
begin | top of the subgraph |
explored | set of segments which have already been explored |
end | bottom of the subgraph |
Definition at line 73 of file event_graph.cpp.
◆ has_com_edge()
◆ has_po_edge()
◆ is_local()
◆ operator[]()
◆ po_in()
◆ po_out()
◆ print_graph()
void event_grapht::print_graph |
( |
| ) |
|
◆ print_rec_graph()
void event_grapht::print_rec_graph |
( |
std::ofstream & |
file, |
|
|
event_idt |
node_id, |
|
|
std::set< event_idt > & |
visited |
|
) |
| |
◆ remove_com_edge()
◆ remove_edge()
◆ remove_po_edge()
◆ set_parameters_collection()
void event_grapht::set_parameters_collection |
( |
unsigned |
_max_var = 0 , |
|
|
unsigned |
_max_po_trans = 0 , |
|
|
bool |
_ignore_arrays = false |
|
) |
| |
|
inline |
◆ size()
std::size_t event_grapht::size |
( |
| ) |
const |
|
inline |
◆ com_graph
◆ duplicated_bodies
◆ filter_thin_air
bool event_grapht::filter_thin_air |
◆ filter_uniproc
bool event_grapht::filter_uniproc |
◆ ignore_arrays
bool event_grapht::ignore_arrays |
|
protected |
◆ loops
◆ map_data_dp
std::map<unsigned, data_dpt> event_grapht::map_data_dp |
◆ max_po_trans
unsigned event_grapht::max_po_trans |
|
protected |
◆ max_var
unsigned event_grapht::max_var |
|
protected |
◆ message
◆ po_graph
◆ po_order
◆ poUrfe_order
std::list<event_idt> event_grapht::poUrfe_order |
The documentation for this class was generated from the following files: