scala.tools.nsc.backend.icode.analysis.ReachingDefinitions

ReachingDefinitionsAnalysis

class ReachingDefinitionsAnalysis extends DataFlowAnalysis[ReachingDefinitions.this.rdefLattice.type]

Source
ReachingDefinitions.scala
Linear Supertypes
DataFlowAnalysis[ReachingDefinitions.this.rdefLattice.type], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. ReachingDefinitionsAnalysis
  2. DataFlowAnalysis
  3. AnyRef
  4. Any
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ReachingDefinitionsAnalysis()

Type Members

  1. type P = BasicBlock

    A type for program points.

    A type for program points.

    Definition Classes
    ReachingDefinitionsAnalysisDataFlowAnalysis

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

    Definition Classes
    AnyRef → Any
  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  6. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  7. def backwardAnalysis(f: (P, Elem) ⇒ Elem): Unit

    .

    ...

    f

    ...

    Definition Classes
    DataFlowAnalysis
  8. def clone(): AnyRef

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  9. val drops: Map[BasicBlock, Int]

  10. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  11. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  12. def finalize(): Unit

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  13. def findDefs(bb: BasicBlock, idx: Int, m: Int): List[(BasicBlock, Int)]

    Return the definitions that produced the topmost 'm' elements on the stack, and that reach the instruction at index 'idx' in basic block 'bb'.

  14. def findDefs(bb: BasicBlock, idx: Int, m: Int, depth: Int): List[(BasicBlock, Int)]

    Return the instructions that produced the 'm' elements on the stack, below given 'depth'.

    Return the instructions that produced the 'm' elements on the stack, below given 'depth'. for instance, findefs(bb, idx, 1, 1) returns the instructions that might have produced the value found below the topmost element of the stack.

  15. def forwardAnalysis(f: (P, Elem) ⇒ Elem): Unit

    Implements forward dataflow analysis: the transfer function is applied when inputs to a Program point change, to obtain the new output value.

    Implements forward dataflow analysis: the transfer function is applied when inputs to a Program point change, to obtain the new output value.

    f

    the transfer function.

    Definition Classes
    DataFlowAnalysis
  16. val gen: Map[BasicBlock, Set[(Local, BasicBlock, Int)]]

  17. def genAndKill(b: BasicBlock): (Set[(Local, BasicBlock, Int)], Set[Local])

  18. final def getClass(): java.lang.Class[_]

    Definition Classes
    AnyRef → Any
  19. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  20. val in: Map[P, Elem]

    Definition Classes
    DataFlowAnalysis
  21. def init(m: IMethod): Unit

  22. def init(f: ⇒ Unit): Unit

    Definition Classes
    DataFlowAnalysis
  23. def interpret(b: BasicBlock, idx: Int, in: Elem): Elem

    Return the reaching definitions corresponding to the point after idx.

  24. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  25. var iterations: Int

    the number of times we iterated before reaching a fixpoint.

    the number of times we iterated before reaching a fixpoint.

    Definition Classes
    DataFlowAnalysis
  26. val kill: Map[BasicBlock, Set[Local]]

  27. val lattice: ReachingDefinitions.this.rdefLattice.type

  28. var method: IMethod

  29. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  30. final def notify(): Unit

    Definition Classes
    AnyRef
  31. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  32. val out: Map[P, Elem]

    Definition Classes
    DataFlowAnalysis
  33. val outStack: Map[BasicBlock, Stack]

  34. def reinit(f: ⇒ Unit): Unit

    Reinitialize, but keep the old solutions.

    Reinitialize, but keep the old solutions. Should be used when reanalyzing the same method, after some code transformation.

    Definition Classes
    DataFlowAnalysis
  35. def run(): Unit

  36. var stat: Boolean

    collect statistics?

    collect statistics?

    Definition Classes
    DataFlowAnalysis
  37. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  38. def toString(): String

    Definition Classes
    ReachingDefinitionsAnalysis → AnyRef → Any
  39. def updateReachingDefinition(b: BasicBlock, idx: Int, rd: Set[(Local, BasicBlock, Int)]): Set[(Local, BasicBlock, Int)]

  40. val visited: HashSet[P]

    Definition Classes
    DataFlowAnalysis
  41. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()
  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()
  44. val worklist: Set[P]

    Definition Classes
    DataFlowAnalysis

Inherited from DataFlowAnalysis[ReachingDefinitions.this.rdefLattice.type]

Inherited from AnyRef

Inherited from Any