My Project
|
Base class for constraint nodes. More...
#include <ConstraintAnalysisGraph.h>
Public Member Functions | |
CAGConstraintNode (Kind kind) | |
![]() | |
virtual | ~CAGNode ()=default |
Kind | getKind () const |
int | getNodeId () const |
Unique id of the node within the slice. More... | |
bool | isDirty () const |
Whether the node is dirty, requiring one or more calls to propagate(). More... | |
void | markDirty () |
void | clearDirty () |
const_iterator | begin () const |
Iterator over this node's children (outgoing) nodes. More... | |
const_iterator | end () const |
iterator | begin () |
iterator | end () |
const_iterator | incoming_begin () const |
Iterator over this parents (incoming) nodes. More... | |
const_iterator | incoming_end () const |
iterator | incoming_begin () |
iterator | incoming_end () |
virtual void | propagate (SolverContext &solverContext, const TargetConfiguration &config) |
virtual void | printLabel (raw_ostream &os) const |
Prints the node label, suitable for one-line display. More... | |
template<typename T > | |
void | findChildrenOfKind (SmallVectorImpl< T *> &found) |
void | replaceIncoming (CAGNode *otherNode) |
void | addOutgoing (CAGNode *toNode) |
bool | isOrphan () const |
Whether this node is an orphan (has no incoming or outgoing connections). More... | |
Static Public Member Functions | |
static bool | classof (const CAGNode *n) |
Additional Inherited Members | |
![]() | |
enum | Kind { Kind::Anchor, Kind::OperandAnchor, Kind::ResultAnchor, Kind::LastAnchor = ResultAnchor, Kind::Constraint, Kind::SolveUniformConstraint, Kind::UniformPropagateExplicitScale, Kind::LastConstraint = UniformPropagateExplicitScale } |
using | node_vector = SmallVector< CAGNode *, 1 > |
using | iterator = node_vector::iterator |
using | const_iterator = node_vector::const_iterator |
![]() | |
CAGNode (Kind kind) | |
Base class for constraint nodes.
|
inline |
|
inlinestatic |