Description
Expression to be evaluated.
If the expression is a string, then the string is parsed to create a symbolic expression, substituting registers and memory from a supplied semantic state.
If the expression is an expression tree, then the expression is used directly.
Definition at line 71 of file FeasiblePath.h.
#include <Rose/BinaryAnalysis/FeasiblePath.h>
Collaboration diagram for Rose::BinaryAnalysis::FeasiblePath::Expression:
Public Member Functions | |
| Expression (const std::string &parsable) | |
| Expression (const SymbolicExpressionPtr &expr) | |
| void | print (std::ostream &) const |
Public Attributes | |
| AddressIntervalSet | location |
| Location where constraint applies. More... | |
| std::string | parsable |
| String to be parsed as an expression. More... | |
| SymbolicExpressionPtr | expr |
| Symbolic expression. More... | |
Member Data Documentation
| AddressIntervalSet Rose::BinaryAnalysis::FeasiblePath::Expression::location |
Location where constraint applies.
Empty implies end-of-path.
Definition at line 72 of file FeasiblePath.h.
| std::string Rose::BinaryAnalysis::FeasiblePath::Expression::parsable |
String to be parsed as an expression.
Definition at line 73 of file FeasiblePath.h.
| SymbolicExpressionPtr Rose::BinaryAnalysis::FeasiblePath::Expression::expr |
Symbolic expression.
Definition at line 74 of file FeasiblePath.h.
The documentation for this struct was generated from the following file:
