Packages

c

tip.analysis

CopyConstantPropagationIDEAnalysis

class CopyConstantPropagationIDEAnalysis extends IDESolver[ADeclaration, FlatLattice[Int]] with CopyConstantPropagationAnalysisFunctions

Copy-constant-propagation analysis using IDE solver.

Linear Supertypes
CopyConstantPropagationAnalysisFunctions, IDESolver[ADeclaration, FlatLattice[Int]], IDEAnalysis[ADeclaration, FlatLattice[Int]], FlowSensitiveAnalysis, Analysis[Any], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. CopyConstantPropagationIDEAnalysis
  2. CopyConstantPropagationAnalysisFunctions
  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 CopyConstantPropagationIDEAnalysis(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. def analyze(): Map[CfgNode, Map[ADeclaration, Element]]

    Performs the analysis and returns the result.

    Performs the analysis and returns the result.

    Definition Classes
    IDESolver → Analysis
  2. val cfg: InterproceduralProgramCfg
    Definition Classes
    IDESolver → IDEAnalysis
  3. implicit val declData: DeclarationData
    Definition Classes
    CopyConstantPropagationIDEAnalysis → CopyConstantPropagationAnalysisFunctions
  4. val edgelattice: EdgeFunctionLattice[valuelattice.type]

    The edge lattice.

    The edge lattice.

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

    Edges for call-to-aftercall.

    Edges for call-to-aftercall.

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

    Edges for call-to-entry.

    Edges for call-to-entry.

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

    Edges for exit-to-aftercall.

    Edges for exit-to-aftercall.

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

    Edges for other CFG nodes.

    Edges for other CFG nodes.

    Definition Classes
    CopyConstantPropagationAnalysisFunctions → IDEAnalysis
  9. val stateAfterNode: Boolean
    Definition Classes
    FlowSensitiveAnalysis
  10. val valuelattice: FlatLattice[Int]

    The value lattice.

    The value lattice.

    Definition Classes
    CopyConstantPropagationAnalysisFunctions → IDEAnalysis