scala.tools.nsc.typechecker.PatMatVirtualiser.CommonSubconditionElimination

Type Members

case class AlternativesTreeMaker(prevBinder: Symbol, altss: List[List[TreeMaker]], pos: Position) extends TreeMaker with Product with Serializable
case class BodyTreeMaker(body: Tree, matchPt: Type) extends TreeMaker with Product with Serializable
abstract class Cond extends AnyRef
abstract class CondTreeMaker extends FunTreeMaker
class EqualityCond extends Cond
case class EqualityTestTreeMaker(prevBinder: Symbol, patTree: Tree, pos: Position) extends CondTreeMaker with Product with Serializable
case class ExtractorTreeMaker(extractor: Tree, extraCond: Option[Tree], nextBinder: Symbol, localSubstitution: Substitution, extractorReturnsBoolean: Boolean) extends FunTreeMaker with Product with Serializable

Make a TreeMaker that will result in an extractor call specified by extractor the next TreeMaker (here, we don't know which it'll be) is chained after this one by flatMap'ing a function with binder nextBinder over our extractor's result the function's body is determined by the next TreeMaker in this function's body, and all the subsequent ones, references to the symbols in from will be replaced by the corresponding tree in to
abstract class FunTreeMaker extends TreeMaker
case class GuardTreeMaker(guardTree: Tree) extends TreeMaker with Product with Serializable
case class ProductExtractorTreeMaker(prevBinder: Symbol, extraCond: Option[Tree], localSubstitution: Substitution) extends TreeMaker with Product with Serializable
class ReusedCondTreeMaker extends TreeMaker
case class ReusingCondTreeMaker(sharedPrefix: List[Test], toReused: (TreeMaker) ⇒ TreeMaker) extends TreeMaker with Product with Serializable
case class SubstOnlyTreeMaker(prevBinder: Symbol, nextBinder: Symbol) extends TreeMaker with Product with Serializable
class Substitution extends AnyRef
case class Test(cond: Cond, treeMaker: TreeMaker) extends Product with Serializable
abstract class TreeMaker extends AnyRef
case class TrivialTreeMaker(tree: Tree) extends TreeMaker with Product with Serializable
class TypeAndEqualityCond extends Cond
case class TypeAndEqualityTestTreeMaker(prevBinder: Symbol, patBinder: Symbol, pt: Type, pos: Position) extends CondTreeMaker with Product with Serializable
class TypeCond extends Cond
case class TypeTestTreeMaker(prevBinder: Symbol, nextBinderTp: Type, pos: Position) extends CondTreeMaker with Product with Serializable

Abstract Value Members

abstract def inMatchMonad(tp: Type): Type

Definition Classes
MatchMonadInterface
abstract def matchMonadSym: Symbol

Attributes
protected
Definition Classes
MatchMonadInterface
abstract def pureType(tp: Type): Type

Definition Classes
MatchMonadInterface
abstract val typer: Typer

Definition Classes
MatchMonadInterface

Concrete Value Members

final def !=(arg0: AnyRef): Boolean

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

Definition Classes
Any
final def ##(): Int

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

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

Definition Classes
Any
object Cond extends AnyRef
object EmptySubstitution extends Substitution
object EqualityCond extends AnyRef
object Havoc extends Cond with Product with Serializable
object ReusedCondTreeMaker extends AnyRef
object Substitution extends AnyRef
object Test extends Serializable
object Top extends Cond with Product with Serializable
object TypeAndEqualityCond extends AnyRef
object TypeCond extends AnyRef
def approximateMatch(root: Symbol, cases: List[List[TreeMaker]]): List[List[Test]]

Definition Classes
TreeMakerApproximation
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws()
def combineCases(scrut: Tree, scrutSym: Symbol, casesRaw: List[List[TreeMaker]], pt: Type, owner: Symbol): Tree

Definition Classes
TreeMakers
def combineCasesNoSubstOnly(scrut: Tree, scrutSym: Symbol, casesNoSubstOnly: List[List[TreeMaker]], pt: Type, owner: Symbol, matchFail: (Tree) ⇒ Tree): Tree

Definition Classes
TreeMakers
def combineExtractors(treeMakers: List[TreeMaker], pt: Type): Tree

Definition Classes
TreeMakers
def doCSE(prevBinder: Symbol, cases: List[List[TreeMaker]], pt: Type): List[List[TreeMaker]]

a flow-sensitive, generalised, common sub-expression elimination reuse knowledge from performed tests the only sub-expressions we consider are the conditions and results of the three tests (type, type&equality, equality) when a sub-expression is share, it is stored in a mutable variable the variable is floated up so that its scope includes all of the program that shares it we generalize sharing to implication, where b reuses a if a => b and priors(a) => priors(b) (the priors of a sub expression form the path through the decision tree)
a flow-sensitive, generalised, common sub-expression elimination reuse knowledge from performed tests the only sub-expressions we consider are the conditions and results of the three tests (type, type&equality, equality) when a sub-expression is share, it is stored in a mutable variable the variable is floated up so that its scope includes all of the program that shares it we generalize sharing to implication, where b reuses a if a => b and priors(a) => priors(b) (the priors of a sub expression form the path through the decision tree)
intended to be generalised to exhaustivity/reachability checking
def emitSwitch(scrut: Tree, scrutSym: Symbol, cases: List[List[TreeMaker]], pt: Type): Option[Tree]

Definition Classes
TreeMakers
def emitTypeSwitch(bindersAndCases: List[(Symbol, List[TreeMaker])], pt: Type): Option[List[CaseDef]]

Definition Classes
TreeMakers
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws()
def fixerUpper(origOwner: Symbol, pos: Position): Traverser

Attributes
protected
Definition Classes
TreeMakers
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def matchMonadResult(tp: Type): Type

Definition Classes
MatchMonadInterface
val matchOwner: Symbol

Definition Classes
MatchMonadInterface
def maybeWithOuterCheck(binder: Symbol, expectedTp: Type)(cond: Tree): Tree

Definition Classes
TreeMakers
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def needsTypeTest(tp: Type, pt: Type): Boolean

Definition Classes
TreeMakers
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def optimizeCases(prevBinder: Symbol, cases: List[List[TreeMaker]], pt: Type): (List[List[TreeMaker]], List[Tree])

Definition Classes
TreeMakers
def propagateSubstitution(treeMakers: List[TreeMaker], initial: Substitution): List[TreeMaker]

Definition Classes
TreeMakers
def removeSubstOnly(makers: List[TreeMaker]): List[TreeMaker]

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

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
final def wait(): Unit

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

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

Definition Classes
AnyRef
Annotations
@throws()

CommonSubconditionElimination

trait CommonSubconditionElimination extends TreeMakerApproximation

Type Members

case class AlternativesTreeMaker(prevBinder: Symbol, altss: List[List[TreeMaker]], pos: Position) extends TreeMaker with Product with Serializable

case class BodyTreeMaker(body: Tree, matchPt: Type) extends TreeMaker with Product with Serializable

abstract class Cond extends AnyRef

abstract class CondTreeMaker extends FunTreeMaker

class EqualityCond extends Cond

case class EqualityTestTreeMaker(prevBinder: Symbol, patTree: Tree, pos: Position) extends CondTreeMaker with Product with Serializable

case class ExtractorTreeMaker(extractor: Tree, extraCond: Option[Tree], nextBinder: Symbol, localSubstitution: Substitution, extractorReturnsBoolean: Boolean) extends FunTreeMaker with Product with Serializable

abstract class FunTreeMaker extends TreeMaker

case class GuardTreeMaker(guardTree: Tree) extends TreeMaker with Product with Serializable

case class ProductExtractorTreeMaker(prevBinder: Symbol, extraCond: Option[Tree], localSubstitution: Substitution) extends TreeMaker with Product with Serializable

class ReusedCondTreeMaker extends TreeMaker

case class ReusingCondTreeMaker(sharedPrefix: List[Test], toReused: (TreeMaker) ⇒ TreeMaker) extends TreeMaker with Product with Serializable

case class SubstOnlyTreeMaker(prevBinder: Symbol, nextBinder: Symbol) extends TreeMaker with Product with Serializable

class Substitution extends AnyRef

case class Test(cond: Cond, treeMaker: TreeMaker) extends Product with Serializable

abstract class TreeMaker extends AnyRef

case class TrivialTreeMaker(tree: Tree) extends TreeMaker with Product with Serializable

class TypeAndEqualityCond extends Cond

case class TypeAndEqualityTestTreeMaker(prevBinder: Symbol, patBinder: Symbol, pt: Type, pos: Position) extends CondTreeMaker with Product with Serializable

class TypeCond extends Cond

case class TypeTestTreeMaker(prevBinder: Symbol, nextBinderTp: Type, pos: Position) extends CondTreeMaker with Product with Serializable

Abstract Value Members

abstract def inMatchMonad(tp: Type): Type

abstract def matchMonadSym: Symbol

abstract def pureType(tp: Type): Type

abstract val typer: Typer

Concrete Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

object Cond extends AnyRef

object EmptySubstitution extends Substitution

object EqualityCond extends AnyRef

object Havoc extends Cond with Product with Serializable

object ReusedCondTreeMaker extends AnyRef

object Substitution extends AnyRef

object Test extends Serializable

object Top extends Cond with Product with Serializable

object TypeAndEqualityCond extends AnyRef

object TypeCond extends AnyRef

def approximateMatch(root: Symbol, cases: List[List[TreeMaker]]): List[List[Test]]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def combineCases(scrut: Tree, scrutSym: Symbol, casesRaw: List[List[TreeMaker]], pt: Type, owner: Symbol): Tree

def combineCasesNoSubstOnly(scrut: Tree, scrutSym: Symbol, casesNoSubstOnly: List[List[TreeMaker]], pt: Type, owner: Symbol, matchFail: (Tree) ⇒ Tree): Tree

def combineExtractors(treeMakers: List[TreeMaker], pt: Type): Tree

def doCSE(prevBinder: Symbol, cases: List[List[TreeMaker]], pt: Type): List[List[TreeMaker]]

def emitSwitch(scrut: Tree, scrutSym: Symbol, cases: List[List[TreeMaker]], pt: Type): Option[Tree]

def emitTypeSwitch(bindersAndCases: List[(Symbol, List[TreeMaker])], pt: Type): Option[List[CaseDef]]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def fixerUpper(origOwner: Symbol, pos: Position): Traverser

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def matchMonadResult(tp: Type): Type

val matchOwner: Symbol

def maybeWithOuterCheck(binder: Symbol, expectedTp: Type)(cond: Tree): Tree

final def ne(arg0: AnyRef): Boolean

def needsTypeTest(tp: Type, pt: Type): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def optimizeCases(prevBinder: Symbol, cases: List[List[TreeMaker]], pt: Type): (List[List[TreeMaker]], List[Tree])

def propagateSubstitution(treeMakers: List[TreeMaker], initial: Substitution): List[TreeMaker]

def removeSubstOnly(makers: List[TreeMaker]): List[TreeMaker]

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from TreeMakerApproximation

Inherited from TreeMakers

Inherited from TypedSubstitution

Inherited from MatchMonadInterface