scala.tools.nsc.backend.icode.analysis.CopyPropagation.CopyAnalysis

Ordering

Alphabetic
By inheritance

Inherited

Hide All
Show all

CopyAnalysis
DataFlowAnalysis
AnyRef
Any

Visibility

Public
All

Instance Constructors

new CopyAnalysis ()

Type Members

type P = BasicBlock

A type for program points.
A type for program points.

Definition Classes
CopyAnalysis → DataFlowAnalysis

Value Members

def != (arg0: AnyRef): Boolean

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

Attributes
final
Definition Classes
Any
def ## (): Int

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

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

Attributes
final
Definition Classes
Any
def asInstanceOf [T0] : T0

Attributes
final
Definition Classes
Any
def backwardAnalysis (f: (P, Elem) ⇒ Elem): Unit

.
...
f
...

Definition Classes
DataFlowAnalysis
def blockTransfer (b: BasicBlock, in: Elem): Elem
def cleanReferencesTo (s: State, target: Location): Unit

Remove all references to this local variable from both stack and bindings.
Remove all references to this local variable from both stack and bindings. It is called when a new assignment destroys previous copy-relations.

Attributes
final
def clone (): AnyRef

Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws()
def eq (arg0: AnyRef): Boolean

Attributes
final
Definition Classes
AnyRef
def equals (arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize (): Unit

Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws()
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
def getClass (): java.lang.Class[_]

Attributes
final
Definition Classes
AnyRef → Any
def hashCode (): Int

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

Definition Classes
DataFlowAnalysis
def init (m: IMethod): Unit
def init (f: ⇒ Unit): Unit

Definition Classes
DataFlowAnalysis
def interpret (in: Elem, i: Instruction): Elem

Abstract interpretation for one instruction.
def invalidateRecords (state: State): Unit

Drop everything known about mutable record fields.
Drop everything known about mutable record fields.
A simple escape analysis would help here. Some of the records we track never leak to other methods, therefore they can not be changed. We should not drop their bindings in this case. A closure object would be such an example. Some complications:
- outer pointers. An closure escapes as an outer pointer to another nested closure.
Attributes
final
def isInstanceOf [T0] : Boolean

Attributes
final
Definition Classes
Any
def isPureMethod (m: Symbol): Boolean

Is symbol m a pure method?
Is symbol m a pure method?
m
...
returns
...

Attributes
final
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
val lattice : CopyPropagation.this.copyLattice.type

Definition Classes
CopyAnalysis → DataFlowAnalysis
var method : IMethod
def ne (arg0: AnyRef): Boolean

Attributes
final
Definition Classes
AnyRef
def notify (): Unit

Attributes
final
Definition Classes
AnyRef
def notifyAll (): Unit

Attributes
final
Definition Classes
AnyRef
val out : Map[P, Elem]

Definition Classes
DataFlowAnalysis
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
def run (): Unit

Definition Classes
CopyAnalysis → DataFlowAnalysis
def simulateCall (state: State, method: Symbol, static: Boolean): State

Update the state s after the call to method.
Update the state s after the call to method. The stack elements are dropped and replaced by the result of the call. If the method is impure, all bindings to record fields are cleared.
state
...
method
...
static
...
returns
...

Attributes
final
var stat : Boolean

collect statistics?
collect statistics?

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

Attributes
final
Definition Classes
AnyRef
def toString (): String

Attributes
final
Definition Classes
CopyAnalysis → AnyRef → Any
val visited : HashSet[P]

Definition Classes
DataFlowAnalysis
def wait (): Unit

Attributes
final
Definition Classes
AnyRef
Annotations
@throws()
def wait (arg0: Long, arg1: Int): Unit

Attributes
final
Definition Classes
AnyRef
Annotations
@throws()
def wait (arg0: Long): Unit

Attributes
final
Definition Classes
AnyRef
Annotations
@throws()
val worklist : Set[P]

Definition Classes
DataFlowAnalysis

CopyAnalysis

class CopyAnalysis extends DataFlowAnalysis[CopyPropagation.this.copyLattice.type]

Instance Constructors

new CopyAnalysis ()

Type Members

type P = BasicBlock

Value Members

def != (arg0: AnyRef): Boolean

def != (arg0: Any): Boolean

def ## (): Int

def == (arg0: AnyRef): Boolean

def == (arg0: Any): Boolean

def asInstanceOf [T0] : T0

def backwardAnalysis (f: (P, Elem) ⇒ Elem): Unit

def blockTransfer (b: BasicBlock, in: Elem): Elem

def cleanReferencesTo (s: State, target: Location): Unit

def clone (): AnyRef

def eq (arg0: AnyRef): Boolean

def equals (arg0: Any): Boolean

def finalize (): Unit

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

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

def hashCode (): Int

val in : Map[P, Elem]

def init (m: IMethod): Unit

def init (f: ⇒ Unit): Unit

def interpret (in: Elem, i: Instruction): Elem

def invalidateRecords (state: State): Unit

def isInstanceOf [T0] : Boolean

def isPureMethod (m: Symbol): Boolean

var iterations : Int

val lattice : CopyPropagation.this.copyLattice.type

var method : IMethod

def ne (arg0: AnyRef): Boolean

def notify (): Unit

def notifyAll (): Unit

val out : Map[P, Elem]

def reinit (f: ⇒ Unit): Unit

def run (): Unit

def simulateCall (state: State, method: Symbol, static: Boolean): State

var stat : Boolean

def synchronized [T0] (arg0: ⇒ T0): T0

def toString (): String

val visited : HashSet[P]

def wait (): Unit

def wait (arg0: Long, arg1: Int): Unit

def wait (arg0: Long): Unit

val worklist : Set[P]

Inherited from DataFlowAnalysis[CopyPropagation.this.copyLattice.type]

Inherited from AnyRef

Inherited from Any