Packages

c

tip.analysis

AvailableExpAnalysisSimpleSolver

class AvailableExpAnalysisSimpleSolver extends AvailableExpAnalysis with SimpleMapLatticeFixpointSolver[CfgNode] with ForwardDependencies

Available expressions analysis that uses the simple fipoint solver.

Linear Supertypes
ForwardDependencies, SimpleMapLatticeFixpointSolver[CfgNode], MapLatticeSolver[CfgNode], Dependencies[CfgNode], SimpleFixpointSolver, LatticeSolver, AvailableExpAnalysis, FlowSensitiveAnalysis, Analysis[Any], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. AvailableExpAnalysisSimpleSolver
  2. ForwardDependencies
  3. SimpleMapLatticeFixpointSolver
  4. MapLatticeSolver
  5. Dependencies
  6. SimpleFixpointSolver
  7. LatticeSolver
  8. AvailableExpAnalysis
  9. FlowSensitiveAnalysis
  10. Analysis
  11. AnyRef
  12. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new AvailableExpAnalysisSimpleSolver(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. val allExps: Set[UnlabelledNode[AExpr]]
    Definition Classes
    AvailableExpAnalysis
  5. def analyze(): Element

    The basic Kleene fixpoint solver.

    The basic Kleene fixpoint solver.

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

    The function for which the least fixpoint is to be computed.

    The function for which the least fixpoint is to be computed. Applies the sublattice constraint function pointwise to each entry.

    x

    the input lattice element

    returns

    the output lattice element

    Definition Classes
    SimpleMapLatticeFixpointSolver → SimpleFixpointSolver
  12. 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
  13. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @IntrinsicCandidate()
  14. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @IntrinsicCandidate()
  15. 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
  16. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  17. 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
  18. val lattice: MapLattice[CfgNode, ReversePowersetLattice[UnlabelledNode[AExpr]]]
    Definition Classes
    AvailableExpAnalysis
  19. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  20. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  21. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  22. 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
  23. val stateAfterNode: Boolean
    Definition Classes
    FlowSensitiveAnalysis
  24. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  25. def toString(): String
    Definition Classes
    AnyRef → Any
  26. def transfer(n: CfgNode, s: Element): Element
    Definition Classes
    AvailableExpAnalysis
  27. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  28. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  29. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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 SimpleMapLatticeFixpointSolver[CfgNode]

Inherited from MapLatticeSolver[CfgNode]

Inherited from Dependencies[CfgNode]

Inherited from SimpleFixpointSolver

Inherited from LatticeSolver

Inherited from AvailableExpAnalysis

Inherited from FlowSensitiveAnalysis

Inherited from Analysis[Any]

Inherited from AnyRef

Inherited from Any

Ungrouped