scala.tools.nsc.backend.opt.Inliners

Inliner

class Inliner extends AnyRef

Simple inliner.

Source
Inliners.scala
Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. Inliner
  2. AnyRef
  3. Any
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Inliner()

Type Members

  1. class CallerCalleeInfo extends AnyRef

  2. class IMethodInfo extends AnyRef

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. object NonPublicRefs extends Enumeration

  7. def analyzeClass(cls: IClass): Unit

  8. def analyzeMethod(m: IMethod): Unit

    A transformation local to the body of the argument.

    A transformation local to the body of the argument. An linining decision consists in replacing a callsite with the body of the callee. Please notice that, because analyzeMethod() itself may modify a method body, the particular callee bodies that end up being inlined depend on the particular order in which methods are visited (no topological ordering over the call-graph is attempted).

    Making an inlining decision requires type-flow information for both caller and callee. Regarding the caller, such information is needed only for basic blocks containing inlining candidates (and their transitive predecessors). This observation leads to using a custom type-flow analysis (MTFAGrowable) that can be re-inited, i.e. that reuses lattice elements (type-flow information) computed in a previous iteration as starting point for faster convergence in a new iteration.

    The mechanics of inlining are iterative for a given invocation of analyzeMethod(m), thus considering the basic blocks that successful inlining added in a previous iteration:

    (1) before the iterations proper start, so-called preinlining is performed. Those callsites whose (receiver, concreteMethod) are both known statically can be analyzed for inlining before computing a type-flow. Details in preInline()

    (2) the first iteration computes type-flow information for basic blocks containing inlining candidates (and their transitive predecessors), so called relevantBBs. The ensuing analysis of each candidate (performed by analyzeInc()) may result in a CFG isomorphic to that of the callee being inserted where the callsite was (i.e. a CALL_METHOD instruction is replaced with a single-entry single-exit CFG, which we call "successful inlining").

    (3) following iterations have their relevant basic blocks updated to focus on the inlined basic blocks and their successors only. Details in MTFAGrowable.reinit()

  9. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  10. def clearCaches(): Unit

  11. def clone(): AnyRef

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

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

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

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  15. final def getClass(): Class[_]

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

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

    Definition Classes
    Any
  18. def lookupIMethod(meth: Symbol, receiver: Symbol): Option[IMethod]

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

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

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

    Definition Classes
    AnyRef
  22. val recentTFAs: Map[Symbol, (Boolean, MethodTFA)]

  23. def shouldLoadImplFor(sym: Symbol, receiver: Symbol): Boolean

    Should method 'sym' being called in 'receiver' be loaded from disk?

  24. val splicedBlocks: Set[BasicBlock]

  25. val staleIn: Set[BasicBlock]

  26. val staleOut: ListBuffer[BasicBlock]

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

    Definition Classes
    AnyRef
  28. val tfa: MTFAGrowable

  29. def toString(): String

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

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

Inherited from AnyRef

Inherited from Any