Packages

c

tip.analysis.SignAnalysis.Intraprocedural

WorklistSolverWithReachability

class WorklistSolverWithReachability extends IntraprocValueAnalysisWorklistSolverWithReachability[SignLattice.type]

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. WorklistSolverWithReachability
  2. IntraprocValueAnalysisWorklistSolverWithReachability
  3. ForwardDependencies
  4. WorklistFixpointSolverWithReachability
  5. MapLiftLatticeSolver
  6. WorklistFixpointSolver
  7. ListSetWorklist
  8. Worklist
  9. LiftedValueAnalysisMisc
  10. LiftedValueAnalysis
  11. ValueAnalysisMisc
  12. MapLatticeSolver
  13. Dependencies
  14. LatticeSolver
  15. FlowSensitiveAnalysis
  16. Analysis
  17. AnyRef
  18. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new WorklistSolverWithReachability(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
    ListSetWorklistWorklist
  5. def add(n: CfgNode): Unit

    Adds an item to the worklist.

    Adds an item to the worklist.

    Definition Classes
    ListSetWorklistWorklist
  6. def analyze(): Element

    The analyze function.

    The analyze function.

    Definition Classes
    WorklistFixpointSolverWithReachabilityLatticeSolver
  7. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  8. val cfg: IntraproceduralProgramCfg
    Definition Classes
    LiftedValueAnalysisValueAnalysisMisc
  9. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native() @IntrinsicCandidate()
  10. implicit val declData: DeclarationData
  11. val declaredVars: Set[ADeclaration]

    Set of declared variables, used by statelattice.

    Set of declared variables, used by statelattice.

    Definition Classes
    ValueAnalysisMisc
  12. val domain: Set[CfgNode]
    Definition Classes
    LiftedValueAnalysis
  13. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  14. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  15. def eval(exp: AExpr, env: Element)(implicit declData: DeclarationData): lattices.SignLattice.Element

    Default implementation of eval.

    Default implementation of eval.

    Definition Classes
    ValueAnalysisMisc
  16. val first: Set[CfgNode]

    The worklist is initialized with all function entry nodes.

    The worklist is initialized with all function entry nodes.

    Definition Classes
    LiftedValueAnalysis
  17. def funsub(n: CfgNode, x: Element): Element

    Overrides funsub from tip.solvers.MapLatticeSolver, treating function entry nodes as reachable.

    Overrides funsub from tip.solvers.MapLatticeSolver, treating function entry nodes as reachable.

    n

    the current location in the map domain

    x

    the current lattice element for all locations

    returns

    the output sublattice element

    Definition Classes
    LiftedValueAnalysisMapLatticeSolver
  18. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @IntrinsicCandidate()
  19. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @IntrinsicCandidate()
  20. 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
    ForwardDependenciesDependencies
  21. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  22. 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
  23. val lattice: MapLattice[CfgNode, liftedstatelattice.type]

    The analysis lattice.

    The analysis lattice.

    Definition Classes
    LiftedValueAnalysisMapLatticeSolverLatticeSolver
  24. val liftedstatelattice: LiftLattice[statelattice.type]

    Lifted state lattice, with new bottom element representing "unreachable".

    Lifted state lattice, with new bottom element representing "unreachable".

    Definition Classes
    LiftedValueAnalysis
  25. def localTransfer(n: CfgNode, s: Element): Element

    Transfer function for state lattice elements.

    Transfer function for state lattice elements.

    Definition Classes
    ValueAnalysisMisc
  26. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  27. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  28. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  29. 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
    ForwardDependenciesDependencies
  30. 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
    WorklistFixpointSolverWorklist
  31. 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
    ListSetWorklistWorklist
  32. val stateAfterNode: Boolean
    Definition Classes
    FlowSensitiveAnalysis
  33. val statelattice: MapLattice[ADeclaration, valuelattice.type]

    The lattice of abstract states.

    The lattice of abstract states.

    Definition Classes
    ValueAnalysisMisc
  34. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  35. def toString(): String
    Definition Classes
    AnyRef → Any
  36. def transfer(n: CfgNode, s: Element): Element

    The transfer function.

    The transfer function.

    Definition Classes
    MapLiftLatticeSolverMapLatticeSolver
  37. def transferUnlifted(n: CfgNode, s: Element): Element

    Transfer function for state lattice elements.

    Transfer function for state lattice elements. (Same as localTransfer for basic analyses with lifted state lattice.)

    Definition Classes
    LiftedValueAnalysisMisc
  38. val valuelattice: SignLattice.type

    The lattice of abstract values.

    The lattice of abstract values.

    Definition Classes
    IntraprocValueAnalysisWorklistSolverWithReachabilityValueAnalysisMisc
  39. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  40. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  41. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  42. 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 MapLiftLatticeSolver[CfgNode]

Inherited from ListSetWorklist[CfgNode]

Inherited from Worklist[CfgNode]

Inherited from LiftedValueAnalysisMisc

Inherited from ValueAnalysisMisc

Inherited from MapLatticeSolver[CfgNode]

Inherited from Dependencies[CfgNode]

Inherited from LatticeSolver

Inherited from FlowSensitiveAnalysis

Inherited from Analysis[Any]

Inherited from AnyRef

Inherited from Any

Ungrouped