Description
template<class CFG, class State>
class Rose::BinaryAnalysis::DataFlow::PathAlwaysFeasible< CFG, State >
class Rose::BinaryAnalysis::DataFlow::PathAlwaysFeasible< CFG, State >
Trivial path feasibility predicate.
This path feasibility predicate always returns true. This causes the data-flow to be path insensitive and always follow all edges when propagating states along edges.
Definition at line 235 of file DataFlow.h.
#include <Rose/BinaryAnalysis/DataFlow.h>
Inheritance diagram for Rose::BinaryAnalysis::DataFlow::PathAlwaysFeasible< CFG, State >:
Public Member Functions | |
| bool | operator() (const CFG &, const typename CFG::Edge &, const State &, const State &) |
Member Function Documentation
◆ operator()()
template<class CFG , class State >
|
inline |
Definition at line 237 of file DataFlow.h.
The documentation for this class was generated from the following file:
