State<'Lattice> Type
Represents a state used in LowUIR-based sparse dataflow analysis.
Constructors
| Constructor |
Description
|
|
Instance members
| Instance member |
Description
|
|
Binary handle associated with this state.
|
Full Usage:
this.ClearPendingVertices
|
Clear the pending vertices. |
|
Mapping from a variable def to its uses.
|
|
Dequeue the vertex for removal. When there is no vertex to remove, it returns `false`.
|
|
Sub-state for the user's domain.
|
|
Evaluate the given expression at the given program point in the stack-pointer domain in order to retrieve a concrete stack pointer value if exists.
|
|
|
|
Return the array of StmtInfos of the given vertex.
|
|
Return the terminator statment of the given vertex in an SSA form.
|
|
|
|
Mark the given vertex as pending, which means that the vertex needs to be processed.
|
|
Mark the given vertex as removal, which means that the vertex needs to be removed.
|
|
Currently pending vertices for processing.
|
Full Usage:
this.PerVertexIncomingDefs
Returns: Dictionary<IVertex<LowUIRBasicBlock>, Map<VarKind, VarPoint>>
|
Mapping from a CFG vertex to its incoming definitions.
|
Full Usage:
this.PerVertexOutgoingDefs
Returns: Dictionary<IVertex<LowUIRBasicBlock>, Map<VarKind, VarPoint>>
|
Mapping from a CFG vertex to its outgoing definitions.
|
|
Mapping from a CFG vertex to its phi information.
|
Full Usage:
this.Reset
|
Reset this state. |
|
Mapping from a SSA variable to its corresponding variable point.
|
|
Scheme used for this data flow analysis.
|
|
Mapping from a program point to `StmtOfBBL`, which is a pair of a Low-UIR statement and its corresponding vertex that contains the statement.
|
|
|
|
Mapping from a variable use to its definition.
|
B2R2