FakeVMap (B2R2)

FakeVMap Type

Namespace: B2R2.MiddleEnd.ControlFlowGraph
Assembly: B2R2.MiddleEnd.ControlFlowGraph.dll
Abbreviation For: Dictionary<(ProgramPoint * ProgramPoint), SSAVertex>
Base Type: obj
All Interfaces: IDictionary<(ProgramPoint * ProgramPoint), SSAVertex> , ICollection<KeyValuePair<(ProgramPoint * ProgramPoint), SSAVertex>> , IReadOnlyDictionary<(ProgramPoint * ProgramPoint), SSAVertex> , IReadOnlyCollection<KeyValuePair<(ProgramPoint * ProgramPoint), SSAVertex>> , IEnumerable<KeyValuePair<(ProgramPoint * ProgramPoint), SSAVertex>> , IDictionary , ICollection , IEnumerable , IDeserializationCallback , ISerializable

This is a mapping from an edge to a dummy vertex (for external function calls). We first separately create dummy vertices even if they are associated with the same node (address) in order to compute dominance relationships without introducing incorrect paths or cycles. For convenience, we will always consider as a key "a return edge" from a fake vertex to a fall-through vertex.

Instance members

Instance member	Description
`this.Comparer` Full Usage: `this.Comparer` Returns: `IEqualityComparer<ProgramPoint * ProgramPoint>`	Returns: `IEqualityComparer<ProgramPoint * ProgramPoint>`
`this.Count` Full Usage: `this.Count` Returns: `int` Modifiers: abstract	Returns: `int`
`this.[arg1]` Full Usage: `this.[arg1]` Returns: `ProgramPoint * ProgramPoint` Modifiers: abstract	Returns: `ProgramPoint * ProgramPoint`
`this.Keys` Full Usage: `this.Keys` Returns: `KeyCollection<(ProgramPoint * ProgramPoint), SSAVertex>`	Returns: `KeyCollection<(ProgramPoint * ProgramPoint), SSAVertex>`
`this.Values` Full Usage: `this.Values` Returns: `ValueCollection<(ProgramPoint * ProgramPoint), SSAVertex>`	Returns: `ValueCollection<(ProgramPoint * ProgramPoint), SSAVertex>`