c

tip.analysis.ConstantPropagationAnalysis.Interprocedural

WorklistSolverWithReachabilityAndPropagation

class WorklistSolverWithReachabilityAndPropagation extends InterprocValueAnalysisWorklistSolverWithReachabilityAndPropagation[ConstantPropagationLattice.type]

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. WorklistSolverWithReachabilityAndPropagation
  2. InterprocValueAnalysisWorklistSolverWithReachabilityAndPropagation
  3. ForwardDependencies
  4. WorklistFixpointPropagationSolver
  5. WorklistFixpointSolverWithReachability
  6. WorklistFixpointSolver
  7. InterprocValueAnalysisFunctionsWithPropagation
  8. InterprocValueAnalysisMisc
  9. WorklistFixpointPropagationFunctions
  10. ListSetWorklist
  11. Worklist
  12. MapLiftLatticeSolver
  13. LiftedValueAnalysis
  14. ValueAnalysisMisc
  15. MapLatticeSolver
  16. Dependencies
  17. LatticeSolver
  18. FlowSensitiveAnalysis
  19. Analysis
  20. AnyRef
  21. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new WorklistSolverWithReachabilityAndPropagation(cfg: InterproceduralProgramCfg)(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. def analyze(): Element

    The analyze function.

    The analyze function.

    Definition Classes
    WorklistFixpointPropagationSolver → WorklistFixpointPropagationFunctions → WorklistFixpointSolverWithReachability → LatticeSolver
  7. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  8. val cfg: InterproceduralProgramCfg
    Definition Classes
    LiftedValueAnalysis → ValueAnalysisMisc
  9. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native() @IntrinsicCandidate()
  10. implicit val declData: DeclarationData
    Definition Classes
    InterprocValueAnalysisWorklistSolverWithReachabilityAndPropagation → InterprocValueAnalysisMisc → LiftedValueAnalysis → ValueAnalysisMisc
  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.ConstantPropagationLattice.Element

    Default implementation of eval.

    Default implementation of eval.

    Definition Classes
    ValueAnalysisMisc
  16. def evalArgs(formalParams: Seq[ADeclaration], actualParams: Seq[AExpr], state: Element): Element

    Abstract evaluation of function arguments.

    Abstract evaluation of function arguments.

    Definition Classes
    InterprocValueAnalysisMisc
  17. val first: Set[CfgNode]

    Initialize worklist with the program entry point.

    Initialize worklist with the program entry point.

    Definition Classes
    InterprocValueAnalysisWorklistSolverWithReachabilityAndPropagation → WorklistFixpointSolverWithReachability → WorklistFixpointPropagationFunctions → LiftedValueAnalysis
  18. 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
    LiftedValueAnalysis → MapLatticeSolver
  19. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @IntrinsicCandidate()
  20. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @IntrinsicCandidate()
  21. 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
  22. def init: Element

    The initial lattice element at the start locations.

    The initial lattice element at the start locations. Default: lift(bottom).

    Definition Classes
    WorklistFixpointPropagationSolver → WorklistFixpointPropagationFunctions
  23. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  24. 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
  25. val lattice: MapLattice[CfgNode, liftedstatelattice.type]

    The analysis lattice.

    The analysis lattice.

    Definition Classes
    LiftedValueAnalysis → MapLatticeSolver → LatticeSolver
  26. 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
  27. def localTransfer(n: CfgNode, s: Element): Element

    Transfer function for state lattice elements.

    Transfer function for state lattice elements.

    Definition Classes
    ValueAnalysisMisc
  28. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  29. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  30. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @IntrinsicCandidate()
  31. 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
  32. def process(n: CfgNode): Unit

    This method overrides the one from WorklistFixpointSolver.

    This method overrides the one from WorklistFixpointSolver. Called by the worklist solver when a node is visited.

    Definition Classes
    WorklistFixpointPropagationSolver → WorklistFixpointSolver → Worklist
  33. def propagate(y: Element, m: CfgNode): Unit

    Propagates lattice element y to node m.

    Propagates lattice element y to node m.

    Definition Classes
    WorklistFixpointPropagationFunctions
  34. 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
  35. val stateAfterNode: Boolean
    Definition Classes
    FlowSensitiveAnalysis
  36. val statelattice: MapLattice[ADeclaration, valuelattice.type]

    The lattice of abstract states.

    The lattice of abstract states.

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

    The transfer function.

    The transfer function.

    Definition Classes
    MapLiftLatticeSolver → MapLatticeSolver
  40. def transferUnlifted(n: CfgNode, s: Element): Element

    Transfer function for state lattice elements.

    Transfer function for state lattice elements.

    Definition Classes
    InterprocValueAnalysisFunctionsWithPropagation → MapLiftLatticeSolver
  41. val valuelattice: ConstantPropagationLattice.type

    The lattice of abstract values.

    The lattice of abstract values.

    Definition Classes
    InterprocValueAnalysisWorklistSolverWithReachabilityAndPropagation → ValueAnalysisMisc
  42. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  43. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  44. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  45. 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

Ungrouped