Packages

class Phase2 extends FlowSensitiveAnalysis with WorklistFixpointPropagationFunctions[(CfgNode, Either[D, Lambda])]

Phase 2 of the IDE algorithm. Performs a forward dataflow analysis using the decomposed lattice and the micro-transformers. The original RHS version of IDE uses jump functions for all nodes, not only at exits, but the analysis result and complexity is the same.

Linear Supertypes
WorklistFixpointPropagationFunctions[(CfgNode, Either[D, Lambda])], ListSetWorklist[(CfgNode, Either[D, Lambda])], Worklist[(CfgNode, Either[D, Lambda])], FlowSensitiveAnalysis, Analysis[Any], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Phase2
  2. WorklistFixpointPropagationFunctions
  3. ListSetWorklist
  4. Worklist
  5. FlowSensitiveAnalysis
  6. Analysis
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Phase2(cfg: InterproceduralProgramCfg, phase1: Phase1)

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def add(ns: Set[(CfgNode, Either[D, Lambda])]): Unit

    Adds a set of items to the worklist.

    Adds a set of items to the worklist.

    Definition Classes
    ListSetWorklist → Worklist
  5. def add(n: (CfgNode, Either[D, Lambda])): Unit

    Adds an item to the worklist.

    Adds an item to the worklist.

    Definition Classes
    ListSetWorklist → Worklist
  6. def analyze(): Element
    Definition Classes
    WorklistFixpointPropagationFunctions
  7. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  8. val cfg: InterproceduralProgramCfg
  9. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native() @IntrinsicCandidate()
  10. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  11. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  12. val first: Set[(CfgNode, IDESolver.DL)]

    The start locations.

    The start locations.

    Definition Classes
    Phase2 → WorklistFixpointPropagationFunctions
  13. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @IntrinsicCandidate()
  14. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @IntrinsicCandidate()
  15. val init: L.Element

    The initial lattice element at the start locations.

    The initial lattice element at the start locations.

    Definition Classes
    Phase2 → WorklistFixpointPropagationFunctions
  16. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  17. val lattice: MapLattice[(CfgNode, IDESolver.DL), IDESolver.valuelattice.type]

    The analysis lattice.

    The analysis lattice.

    Definition Classes
    Phase2 → WorklistFixpointPropagationFunctions
  18. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  19. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  20. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  21. val phase1: Phase1
  22. def process(nd: (CfgNode, IDESolver.DL)): Unit

    Called by run to process an item from the worklist.

    Called by run to process an item from the worklist.

    Definition Classes
    Phase2 → Worklist
  23. def propagate(y: L.Element, m: (CfgNode, Either[D, Lambda])): Unit

    Propagates lattice element y to node m.

    Propagates lattice element y to node m.

    Definition Classes
    WorklistFixpointPropagationFunctions
  24. def restructure(y: Element): Element

    Restructures the analysis output to match restructuredlattice.

  25. val restructuredlattice: MapLattice[CfgNode, MapLattice[D, IDESolver.valuelattice.type]]
  26. def run(first: Set[(CfgNode, Either[D, Lambda])]): Unit

    Iterates until there is no more work to do.

    Iterates until there is no more work to do.

    first

    the initial contents of the worklist

    Definition Classes
    ListSetWorklist → Worklist
  27. val stateAfterNode: Boolean
    Definition Classes
    FlowSensitiveAnalysis
  28. lazy val summaries: Map[AFunDeclaration, Map[IDESolver.DL, Map[IDESolver.DL, EdgeFunction]]]

    Function summaries from phase 1.

    Function summaries from phase 1. Built when first invoked.

  29. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  30. def toString(): String
    Definition Classes
    AnyRef → Any
  31. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  32. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  33. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  34. var x: Element

    The current lattice element.

    The current lattice element.

    Definition Classes
    Phase2 → WorklistFixpointPropagationFunctions

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] ) @Deprecated
    Deprecated

Inherited from WorklistFixpointPropagationFunctions[(CfgNode, Either[D, Lambda])]

Inherited from ListSetWorklist[(CfgNode, Either[D, Lambda])]

Inherited from Worklist[(CfgNode, Either[D, Lambda])]

Inherited from FlowSensitiveAnalysis

Inherited from Analysis[Any]

Inherited from AnyRef

Inherited from Any

Ungrouped