PandA-2024.02
|
Structure holding the information about an edge into the graph. More...
#include <state_transition_graph.hpp>
Public Types | |
enum | StateTransitionType { ST_EDGE_NORMAL = 1 << 0, ST_EDGE_FEEDBACK = 1 << 1, ST_EDGE_EPP = 1 << 2 } |
Types associated with the edges of the graph. More... | |
Public Member Functions | |
TransitionInfo (OpGraphConstRef g) | |
void | print (std::ostream &os, const int detail_level) const |
Print the information associated with the edge of the graph. More... | |
bool | get_has_default () const |
transition_type | get_type () const |
const CustomOrderedSet< vertex > & | get_operations () const |
vertex | get_operation () const |
const CustomOrderedSet< unsigned > & | get_labels () const |
vertex | get_ref_state () const |
void | set_epp_increment (size_t n) |
size_t | get_epp_increment () const |
Public Member Functions inherited from EdgeInfo | |
EdgeInfo ()=default | |
Constructor. More... | |
virtual | ~EdgeInfo ()=default |
Destructor. More... | |
Private Attributes | |
OpGraphConstRef | op_function_graph |
pointer to graph storing information about operations More... | |
transition_type | t {DONTCARE_COND} |
CustomOrderedSet< vertex > | ops |
bool | has_default {false} |
CustomOrderedSet< unsigned > | labels |
vertex | ref_state {NULL_VERTEX} |
size_t | epp_increment {0} |
the edge increment computed by Efficient Path Profiling More... | |
bool | epp_incrementValid {false} |
Friends | |
class | StateTransitionGraph_constructor |
Structure holding the information about an edge into the graph.
It specialize generic edge_info The property associated with edge is the control condition
Definition at line 180 of file state_transition_graph.hpp.
Types associated with the edges of the graph.
Enumerator | |
---|---|
ST_EDGE_NORMAL | Normal edge. |
ST_EDGE_FEEDBACK | Feedback edge. |
ST_EDGE_EPP | Artificial edge for computation of Efficient Path Profiling edge increments. |
Definition at line 228 of file state_transition_graph.hpp.
|
inlineexplicit |
Definition at line 196 of file state_transition_graph.hpp.
|
inline |
Definition at line 243 of file state_transition_graph.hpp.
|
inline |
Definition at line 208 of file state_transition_graph.hpp.
|
inline |
Definition at line 221 of file state_transition_graph.hpp.
vertex TransitionInfo::get_operation | ( | ) | const |
Definition at line 339 of file state_transition_graph.cpp.
References THROW_ASSERT.
|
inline |
Definition at line 216 of file state_transition_graph.hpp.
vertex TransitionInfo::get_ref_state | ( | ) | const |
Definition at line 345 of file state_transition_graph.cpp.
References ALL_FINISHED, NOT_ALL_FINISHED, NULL_VERTEX, and THROW_ASSERT.
|
inline |
Definition at line 212 of file state_transition_graph.hpp.
void TransitionInfo::print | ( | std::ostream & | os, |
const int | detail_level | ||
) | const |
Print the information associated with the edge of the graph.
os | is the output stream. |
Definition at line 231 of file state_transition_graph.cpp.
References ALL_FINISHED, CASE_COND, DONTCARE_COND, FALSE_COND, GET_NAME, NOT_ALL_FINISHED, BehavioralHelper::PrintNode(), THROW_ERROR, and TRUE_COND.
|
inline |
Definition at line 238 of file state_transition_graph.hpp.
|
friend |
Definition at line 200 of file state_transition_graph.hpp.
|
private |
the edge increment computed by Efficient Path Profiling
Definition at line 192 of file state_transition_graph.hpp.
Definition at line 193 of file state_transition_graph.hpp.
Definition at line 188 of file state_transition_graph.hpp.
|
private |
Definition at line 189 of file state_transition_graph.hpp.
|
private |
pointer to graph storing information about operations
Definition at line 184 of file state_transition_graph.hpp.
|
private |
Definition at line 187 of file state_transition_graph.hpp.
|
private |
Definition at line 190 of file state_transition_graph.hpp.
|
private |
Definition at line 186 of file state_transition_graph.hpp.