Packages

class SynthLazyAccessorsIn extends SynthCheckedAccessorsTreesInClass

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. SynthLazyAccessorsIn
  2. SynthCheckedAccessorsTreesInClass
  3. CheckedAccessorSymbolSynth
  4. AnyRef
  5. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new SynthLazyAccessorsIn(clazz: Global.Symbol)

Value Members

  1. val clazz: Global.Symbol
    Definition Classes
    CheckedAccessorSymbolSynth
  2. def computeBitmapInfos(fields: List[Global.Symbol]): List[Global.Symbol]

    Fill the map from fields to bitmap infos.

    Fill the map from fields to bitmap infos. This is called for all fields in each transformed class (by the fields info transformer), after the fields inherited from traits have been added.

    bitmaps for checkinit fields are not inherited

    Definition Classes
    CheckedAccessorSymbolSynth
  3. def expandLazyClassMember(lazyVar: Global.Symbol, lazyAccessor: Global.Symbol, transformedRhs: Global.Tree): Global.Tree

    The compute method (slow path) looks like:

    The compute method (slow path) looks like:

    def l$compute() = { synchronized(this) { if ((bitmap$n & MASK) == 0) { init // l$ = <rhs> bitmap$n = bimap$n | MASK } } ... this.f1 = null ... this.fn = null l$ }

    bitmap$n is a byte, int or long value acting as a bitmap of initialized values. The kind of the bitmap determines how many bit indicators for lazy vals are stored in it. For Int bitmap it is 32 and then 'n' in the above code is: (offset / 32), the MASK is (1 << (offset % 32)).

    If the class contains only a single lazy val then the bitmap is represented as a Boolean and the condition checking is a simple bool test.

    Private fields used only in this initializer are subsequently set to null.

    For performance reasons the double-checked locking is split into two parts, the first (fast) path checks the bitmap without synchronizing, and if that fails it initializes the lazy val within the synchronization block (slow path).

    This way the inliner should optimize the fast path because the method body is small enough.

  4. def isUnitGetter(sym: Global.Symbol): Boolean
    Definition Classes
    SynthCheckedAccessorsTreesInClass
  5. def mkSetFlag(bitmap: BitmapInfo): Global.Tree

    Return an (untyped) tree of the form 'Clazz.this.bmp = Clazz.this.bmp | mask'.

    Return an (untyped) tree of the form 'Clazz.this.bmp = Clazz.this.bmp | mask'.

    Definition Classes
    SynthCheckedAccessorsTreesInClass
  6. def mkTest(bm: BitmapInfo, equalToZero: Boolean = true): Global.Tree

    Return an (untyped) tree of the form 'clazz.this.bitmapSym & mask (==|!=) 0', the precise comparison operator depending on the value of 'equalToZero'.

    Return an (untyped) tree of the form 'clazz.this.bitmapSym & mask (==|!=) 0', the precise comparison operator depending on the value of 'equalToZero'.

    Definition Classes
    SynthCheckedAccessorsTreesInClass
  7. def newSlowPathSymbol(lzyVal: Global.Symbol): Global.Symbol
    Definition Classes
    CheckedAccessorSymbolSynth
  8. def slowPathFor(lzyVal: Global.Symbol): Global.Symbol
    Definition Classes
    CheckedAccessorSymbolSynth
  9. def thisRef: Global.This
    Definition Classes
    SynthCheckedAccessorsTreesInClass