#include <event_graph.h>
|
iterator | begin () |
|
const_iterator | begin () const |
|
const_iterator | cbegin () const |
|
iterator | end () |
|
const_iterator | end () const |
|
const_iterator | cend () const |
|
template<typename T > |
void | push_front (T &&t) |
|
template<typename T > |
void | push_back (T &&t) |
|
value_type & | front () |
|
const value_type & | front () const |
|
value_type & | back () |
|
const value_type & | back () const |
|
size_t | size () const |
|
| critical_cyclet (event_grapht &_egraph, unsigned _id) |
|
void | operator() (const critical_cyclet &cyc) |
|
bool | is_cycle () |
|
void | hide_internals (critical_cyclet &reduced) const |
|
bool | is_unsafe (memory_modelt model, bool fast=false) |
| checks whether there is at least one pair which is unsafe (takes fences and dependencies into account), and adds the unsafe pairs in the set
|
|
bool | is_unsafe_fast (memory_modelt model) |
|
void | compute_unsafe_pairs (memory_modelt model) |
|
bool | is_unsafe_asm (memory_modelt model, bool fast=false) |
| same as is_unsafe, but with ASM fences
|
|
bool | is_not_uniproc (memory_modelt model) const |
|
bool | is_not_thin_air () const |
|
std::string | print () const |
|
std::string | print_events () const |
|
std::string | print_name (memory_modelt model) const |
|
std::string | print_name (memory_modelt model, bool hide_internals) const |
|
std::string | print_unsafes () const |
|
std::string | print_output () const |
|
std::string | print_all (memory_modelt model, std::map< std::string, std::string > &map_id2var, std::map< std::string, std::string > &map_var2id, bool hide_internals) const |
|
void | print_dot (std::ostream &str, unsigned colour, memory_modelt model) const |
|
bool | operator< (const critical_cyclet &other) const |
|
Definition at line 38 of file event_graph.h.
◆ const_iterator
◆ data_typet
◆ iterator
◆ value_type
◆ critical_cyclet()
◆ back() [1/2]
value_type & event_grapht::critical_cyclet::back |
( |
| ) |
|
|
inline |
◆ back() [2/2]
◆ begin() [1/2]
iterator event_grapht::critical_cyclet::begin |
( |
| ) |
|
|
inline |
◆ begin() [2/2]
◆ cbegin()
◆ cend()
◆ check_AC()
◆ check_BC()
◆ compute_unsafe_pairs()
◆ end() [1/2]
iterator event_grapht::critical_cyclet::end |
( |
| ) |
|
|
inline |
◆ end() [2/2]
◆ front() [1/2]
value_type & event_grapht::critical_cyclet::front |
( |
| ) |
|
|
inline |
◆ front() [2/2]
◆ hide_internals()
◆ is_cycle()
bool event_grapht::critical_cyclet::is_cycle |
( |
| ) |
|
|
inline |
◆ is_not_thin_air()
bool event_grapht::critical_cyclet::is_not_thin_air |
( |
| ) |
const |
◆ is_not_uniproc() [1/2]
bool event_grapht::critical_cyclet::is_not_uniproc |
( |
| ) |
const |
|
private |
◆ is_not_uniproc() [2/2]
◆ is_not_weak_uniproc()
bool event_grapht::critical_cyclet::is_not_weak_uniproc |
( |
| ) |
const |
|
private |
◆ is_unsafe()
checks whether there is at least one pair which is unsafe (takes fences and dependencies into account), and adds the unsafe pairs in the set
Definition at line 281 of file event_graph.cpp.
◆ is_unsafe_asm()
◆ is_unsafe_fast()
◆ operator()()
◆ operator<()
◆ print()
std::string event_grapht::critical_cyclet::print |
( |
| ) |
const |
◆ print_all()
std::string event_grapht::critical_cyclet::print_all |
( |
memory_modelt |
model, |
|
|
std::map< std::string, std::string > & |
map_id2var, |
|
|
std::map< std::string, std::string > & |
map_var2id, |
|
|
bool |
hide_internals |
|
) |
| const |
◆ print_detail()
std::string event_grapht::critical_cyclet::print_detail |
( |
const critical_cyclet & |
reduced, |
|
|
std::map< std::string, std::string > & |
map_id2var, |
|
|
std::map< std::string, std::string > & |
map_var2id |
|
) |
| const |
|
private |
◆ print_dot()
◆ print_events()
std::string event_grapht::critical_cyclet::print_events |
( |
| ) |
const |
◆ print_name() [1/3]
◆ print_name() [2/3]
std::string event_grapht::critical_cyclet::print_name |
( |
memory_modelt |
model | ) |
const |
|
inline |
◆ print_name() [3/3]
std::string event_grapht::critical_cyclet::print_name |
( |
memory_modelt |
model, |
|
|
bool |
hide_internals |
|
) |
| const |
|
inline |
◆ print_output()
std::string event_grapht::critical_cyclet::print_output |
( |
| ) |
const |
◆ print_unsafes()
std::string event_grapht::critical_cyclet::print_unsafes |
( |
| ) |
const |
◆ push_back()
void event_grapht::critical_cyclet::push_back |
( |
T && |
t | ) |
|
|
inline |
◆ push_front()
void event_grapht::critical_cyclet::push_front |
( |
T && |
t | ) |
|
|
inline |
◆ size()
size_t event_grapht::critical_cyclet::size |
( |
| ) |
const |
|
inline |
◆ data
◆ egraph
◆ has_user_defined_fence
bool event_grapht::critical_cyclet::has_user_defined_fence |
◆ id
unsigned event_grapht::critical_cyclet::id |
◆ unsafe_pairs
std::set<delayt> event_grapht::critical_cyclet::unsafe_pairs |
The documentation for this class was generated from the following files: