GCC Middle and Back End API Reference
|
#include <feasible-graph.h>
Public Types | |
typedef fg_traits::edge_t | edge_t |
typedef fg_traits::dump_args_t | dump_args_t |
Public Member Functions | |
infeasible_node (const exploded_node *inner_node, unsigned index, std::unique_ptr< rejected_constraint > rc) | |
void | dump_dot (graphviz_out *gv, const dump_args_t &args) const final override |
void | dump_dot_id (pretty_printer *pp) const |
const exploded_node * | get_inner_node () const |
unsigned | get_index () const |
virtual void | dump_dot (graphviz_out *gv, const dump_args_t &args) const=0 |
Data Fields | |
auto_vec< edge_t * > | m_preds |
auto_vec< edge_t * > | m_succs |
Protected Attributes | |
const exploded_node * | m_inner_node |
unsigned | m_index |
Private Attributes | |
std::unique_ptr< rejected_constraint > | m_rc |
Subclass of base_feasible_node for a node that requires following an infeasible edge to reach (and thus terminating this part of the exploration).
|
inherited |
|
inherited |
|
inline |
|
finaloverride |
|
pure virtualinherited |
|
inherited |
|
inlineinherited |
References ana::base_feasible_node::m_index.
|
inlineinherited |
References ana::base_feasible_node::m_inner_node.
Referenced by infinite_recursion_diagnostic::check_valid_fpath_p().
|
protectedinherited |
Referenced by ana::base_feasible_node::get_index().
|
protectedinherited |
Referenced by ana::base_feasible_node::get_inner_node().
|
private |