DeadCode

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

def ->[B](y: B): (DeadCode, B)

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

var accessedLocals: List[Local]

what local variables have been accessed at least once?

def analyzeClass(cls: IClass): Unit

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def collectRDef(m: IMethod): Unit

collect reaching definitions and initial useful instructions for this method.

var defs: Map[(BasicBlock, Int), Set[(Local, BasicBlock, Int)]]

Use-def chain: give the reaching definitions at the beginning of given instruction.

def dieCodeDie(m: IMethod): Unit

val dropOf: Map[(BasicBlock, Int), List[(BasicBlock, Int)]]

Map instructions who have a drop on some control path, to that DROP instruction.

def ensuring(cond: (DeadCode) ⇒ Boolean, msg: ⇒ Any): DeadCode

def ensuring(cond: (DeadCode) ⇒ Boolean): DeadCode

def ensuring(cond: Boolean, msg: ⇒ Any): DeadCode

def ensuring(cond: Boolean): DeadCode

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def formatted(fmtstr: String): String

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def mark(): Unit

Mark useful instructions.

var method: IMethod

the current method.

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val rdef: ReachingDefinitionsAnalysis

val self: Any

val self: Any

def sweep(m: IMethod): Unit

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

def toString(): String

val useful: Map[BasicBlock, BitSet]

what instructions have been marked as useful?

final def wait(): Unit

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

final def wait(arg0: Long): Unit

val worklist: Set[(BasicBlock, Int)]

Useful instructions which have not been scanned yet.

def →[B](y: B): (DeadCode, B)

def x: DeadCode

def x: DeadCode