#include <event_graph.h>
|
| graph_pensieve_explorert (event_grapht &_egraph, unsigned _max_var, unsigned _max_po_trans) |
|
void | set_naive () |
|
void | collect_pairs () |
|
virtual | ~graph_explorert () |
|
| graph_explorert (event_grapht &_egraph, unsigned _max_var, unsigned _max_po_trans) |
|
critical_cyclet | extract_cycle (event_idt vertex, event_idt source, unsigned number_of_cycles) |
| extracts a (whole, unreduced) cycle from the stack. More...
|
|
bool | backtrack (std::set< critical_cyclet > &set_of_cycles, event_idt source, event_idt vertex, bool unsafe_met, event_idt po_trans, bool same_var_pair, bool lwsync_met, bool has_to_be_unsafe, irep_idt var_to_avoid, memory_modelt model) |
| see event_grapht::collect_cycles More...
|
|
void | collect_cycles (std::set< critical_cyclet > &set_of_cycles, memory_modelt model) |
| Tarjan 1972 adapted and modified for events. More...
|
|
Definition at line 363 of file event_graph.h.
◆ graph_pensieve_explorert()
event_grapht::graph_pensieve_explorert::graph_pensieve_explorert |
( |
event_grapht & |
_egraph, |
|
|
unsigned |
_max_var, |
|
|
unsigned |
_max_po_trans |
|
) |
| |
|
inline |
◆ collect_pairs()
void event_grapht::graph_pensieve_explorert::collect_pairs |
( |
| ) |
|
◆ find_second_event()
bool event_grapht::graph_pensieve_explorert::find_second_event |
( |
event_idt |
source | ) |
|
|
protected |
◆ set_naive()
void event_grapht::graph_pensieve_explorert::set_naive |
( |
| ) |
|
|
inline |
◆ naive
bool event_grapht::graph_pensieve_explorert::naive |
|
protected |
◆ visited_nodes
std::set<event_idt> event_grapht::graph_pensieve_explorert::visited_nodes |
|
protected |
The documentation for this class was generated from the following files: