Packages

c

tip.analysis

AvailableExpAnalysisWorklistSolver

class AvailableExpAnalysisWorklistSolver extends AvailableExpAnalysis with SimpleWorklistFixpointSolver[CfgNode] with ForwardDependencies

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. AvailableExpAnalysisWorklistSolver
  2. ForwardDependencies
  3. SimpleWorklistFixpointSolver
  4. WorklistFixpointSolver
  5. ListSetWorklist
  6. Worklist
  7. MapLatticeSolver
  8. Dependencies
  9. LatticeSolver
  10. AvailableExpAnalysis
  11. FlowSensitiveAnalysis
  12. Analysis
  13. AnyRef
  14. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new AvailableExpAnalysisWorklistSolver(cfg: IntraproceduralProgramCfg)(implicit declData: DeclarationData)

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]): 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): Unit

    Adds an item to the worklist.

    Adds an item to the worklist.

    Definition Classes
    ListSetWorklist → Worklist
  6. val allExps: Set[UnlabelledNode[AExpr]]
    Definition Classes
    AvailableExpAnalysis
  7. def analyze(): Element

    The analyze function.

    The analyze function.

    Definition Classes
    SimpleWorklistFixpointSolver → LatticeSolver
  8. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  9. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native() @IntrinsicCandidate()
  10. val domain: Set[CfgNode]
    Definition Classes
    AvailableExpAnalysis
  11. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  12. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  13. def funsub(n: CfgNode, x: Element): Element

    The constraint function for individual elements in the map domain.

    The constraint function for individual elements in the map domain. First computes the join of the incoming elements and then applies the transfer function.

    n

    the current location in the map domain

    x

    the current lattice element for all locations

    returns

    the output sublattice element

    Definition Classes
    MapLatticeSolver
  14. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @IntrinsicCandidate()
  15. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @IntrinsicCandidate()
  16. def indep(n: CfgNode): Set[CfgNode]

    Incoming dependencies.

    Incoming dependencies. Used when computing the join from predecessors.

    n

    an element from the worklist

    returns

    the elements that the given element depends on

    Definition Classes
    ForwardDependencies → Dependencies
  17. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  18. def join(n: CfgNode, o: Element): Element

    Computes the least upper bound of the incoming elements.

    Computes the least upper bound of the incoming elements.

    Definition Classes
    MapLatticeSolver
  19. val lattice: MapLattice[CfgNode, ReversePowersetLattice[UnlabelledNode[AExpr]]]
    Definition Classes
    AvailableExpAnalysis
  20. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  21. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  22. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  23. def outdep(n: CfgNode): Set[CfgNode]

    Outgoing dependencies.

    Outgoing dependencies. Used when propagating dataflow to successors.

    n

    an element from the worklist

    returns

    the elements that depend on the given element

    Definition Classes
    ForwardDependencies → Dependencies
  24. def process(n: CfgNode): Unit

    Called by run to process an item from the worklist.

    Called by run to process an item from the worklist.

    Definition Classes
    WorklistFixpointSolver → Worklist
  25. def run(first: Set[CfgNode]): 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
  26. val stateAfterNode: Boolean
    Definition Classes
    FlowSensitiveAnalysis
  27. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  28. def toString(): String
    Definition Classes
    AnyRef → Any
  29. def transfer(n: CfgNode, s: Element): Element
    Definition Classes
    AvailableExpAnalysis
  30. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  31. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  32. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  33. val x: Element

    The current lattice element.

    The current lattice element.

    Definition Classes
    WorklistFixpointSolver

Deprecated Value Members

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

Inherited from ForwardDependencies

Inherited from SimpleWorklistFixpointSolver[CfgNode]

Inherited from WorklistFixpointSolver[CfgNode]

Inherited from ListSetWorklist[CfgNode]

Inherited from Worklist[CfgNode]

Inherited from MapLatticeSolver[CfgNode]

Inherited from Dependencies[CfgNode]

Inherited from LatticeSolver

Inherited from AvailableExpAnalysis

Inherited from FlowSensitiveAnalysis

Inherited from Analysis[Any]

Inherited from AnyRef

Inherited from Any

Ungrouped