Packages

c

tip.analysis

PossiblyUninitializedVarsIDEAnalysis

class PossiblyUninitializedVarsIDEAnalysis extends IDESolver[ADeclaration, TwoElementLattice] with PossiblyUninitializedVarsAnalysisFunctions

Possibly-uninitialized variables analysis using IDE solver.

Linear Supertypes
PossiblyUninitializedVarsAnalysisFunctions, IDESolver[ADeclaration, TwoElementLattice], IDEAnalysis[ADeclaration, TwoElementLattice], FlowSensitiveAnalysis, Analysis[Any], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. PossiblyUninitializedVarsIDEAnalysis
  2. PossiblyUninitializedVarsAnalysisFunctions
  3. IDESolver
  4. IDEAnalysis
  5. FlowSensitiveAnalysis
  6. Analysis
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new PossiblyUninitializedVarsIDEAnalysis(cfg: InterproceduralProgramCfg)(implicit declData: DeclarationData)

Type Members

  1. type DL = Either[ADeclaration, Lambda]
    Definition Classes
    IDEAnalysis
  2. class Phase1 extends WorklistFixpointPropagationFunctions[(CfgNode, Either[D, Lambda], Either[D, Lambda])]

    Phase 1 of the IDE algorithm.

    Phase 1 of the IDE algorithm. The original version of the algorithm uses summary edges from call nodes to after-call nodes instead of callJumpCache and exitJumpCache.

    Definition Classes
    IDESolver
  3. class Phase2 extends FlowSensitiveAnalysis with WorklistFixpointPropagationFunctions[(CfgNode, Either[D, Lambda])]

    Phase 2 of the IDE algorithm.

    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.

    Definition Classes
    IDESolver

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 analyze(): Map[CfgNode, Map[ADeclaration, lattices.TwoElementLattice.Element]]

    Performs the analysis and returns the result.

    Performs the analysis and returns the result.

    Definition Classes
    IDESolver → Analysis
  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. val cfg: InterproceduralProgramCfg
    Definition Classes
    IDESolver → IDEAnalysis
  7. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native() @IntrinsicCandidate()
  8. implicit val declData: DeclarationData
    Definition Classes
    PossiblyUninitializedVarsIDEAnalysis → PossiblyUninitializedVarsAnalysisFunctions
  9. val edgelattice: EdgeFunctionLattice[valuelattice.type]

    The edge lattice.

    The edge lattice.

    Definition Classes
    PossiblyUninitializedVarsAnalysisFunctions → IDEAnalysis
  10. def edgesCallToAfterCall(call: CfgCallNode, aftercall: CfgAfterCallNode)(d: DL): Map[DL, EdgeFunction]

    Edges for call-to-aftercall.

    Edges for call-to-aftercall.

    Definition Classes
    PossiblyUninitializedVarsAnalysisFunctions → IDEAnalysis
  11. def edgesCallToEntry(call: CfgCallNode, entry: CfgFunEntryNode)(d: DL): Map[DL, EdgeFunction]

    Edges for call-to-entry.

    Edges for call-to-entry.

    Definition Classes
    PossiblyUninitializedVarsAnalysisFunctions → IDEAnalysis
  12. def edgesExitToAfterCall(exit: CfgFunExitNode, aftercall: CfgAfterCallNode)(d: DL): Map[DL, EdgeFunction]

    Edges for exit-to-aftercall.

    Edges for exit-to-aftercall.

    Definition Classes
    PossiblyUninitializedVarsAnalysisFunctions → IDEAnalysis
  13. def edgesOther(n: CfgNode)(d: DL): Map[DL, EdgeFunction]

    Edges for other CFG nodes.

    Edges for other CFG nodes.

    Definition Classes
    PossiblyUninitializedVarsAnalysisFunctions → IDEAnalysis
  14. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  15. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  16. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @IntrinsicCandidate()
  17. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @IntrinsicCandidate()
  18. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  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. val stateAfterNode: Boolean
    Definition Classes
    FlowSensitiveAnalysis
  23. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  24. def toString(): String
    Definition Classes
    AnyRef → Any
  25. val valuelattice: TwoElementLattice

    The value lattice.

    The value lattice.

    Definition Classes
    PossiblyUninitializedVarsAnalysisFunctions → IDEAnalysis
  26. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  27. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  28. 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 PossiblyUninitializedVarsAnalysisFunctions

Inherited from IDESolver[ADeclaration, TwoElementLattice]

Inherited from IDEAnalysis[ADeclaration, TwoElementLattice]

Inherited from FlowSensitiveAnalysis

Inherited from Analysis[Any]

Inherited from AnyRef

Inherited from Any

Ungrouped