Static Value-Flow Analysis
|
#include <DPItem.h>
Public Member Functions | |
DPItem (NodeID c) | |
Constructor. More... | |
DPItem (const DPItem &dps) | |
Copy constructor. More... | |
DPItem (DPItem &&dps) noexcept | |
Move constructor. More... | |
DPItem & | operator= (DPItem &&rhs) noexcept |
Move operator=. More... | |
virtual | ~DPItem () |
Destructor. More... | |
NodeID | getCurNodeID () const |
void | setCurNodeID (NodeID c) |
bool | operator< (const DPItem &rhs) const |
DPItem & | operator= (const DPItem &rhs) |
Overloading Operator=. More... | |
bool | operator== (const DPItem &rhs) const |
Overloading Operator==. More... | |
bool | operator!= (const DPItem &rhs) const |
Overloading Operator!=. More... | |
void | dump () const |
Static Public Member Functions | |
static void | setMaxBudget (u32_t max) |
set max step budge per query More... | |
static u32_t | getMaxBudget () |
Protected Attributes | |
NodeID | cur |
Static Protected Attributes | |
static u64_t | maximumBudget = ULONG_MAX - 1 |
Dynamic programming item for CFL reachability search This serves as a base class for CFL-reachability formulation by matching parentheses. Extend this class for further sophisticated CFL-reachability items (e.g. field, flow, path)
|
inline |
Constructor.
|
inline |
|
inlinenoexcept |
|
inlinevirtual |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inlinestatic |
set max step budge per query