LazyVals

this map contains mutable state of transformation: OffsetDefs to be appended to companion object definitions, and number of bits currently used

Create thread-unsafe lazy accessor for not-nullable types equivalent to such code

def methodSymbol() = {
 if (target eq null) {
   target = rhs
   nullable = null
 }
 target
}

Create a threadsafe lazy accessor equivalent to such code

def methodSymbol(): Int = {
 while (true) {
   val flag = LazyVals.get(this, bitmap_offset)
   val state = LazyVals.STATE(flag, <field-id>)

   if (state == <state-3>) {
     return value_0
   } else if (state == <state-0>) {
     if (LazyVals.CAS(this, bitmap_offset, flag, <state-1>, <field-id>)) {
       try {
         val result = <RHS>
         value_0 = result
         nullable = null
         LazyVals.setFlag(this, bitmap_offset, <state-3>, <field-id>)
         return result
       }
       catch {
         case ex =>
           LazyVals.setFlag(this, bitmap_offset, <state-0>, <field-id>)
           throw ex
       }
     }
   } else /* if (state == <state-1> || state == <state-2>) */ {
     LazyVals.wait4Notification(this, bitmap_offset, flag, <field-id>)
   }
 }
}

Create thread-unsafe lazy accessor equivalent to such code

def methodSymbol() = {
 if (!flag) {
   target = rhs
   flag = true
   nullable = null
 }
 target
}

List of names of phases that should have finished processing of tree before this phase starts processing same tree

Desugar a local lazy val x: Int = <RHS> into:

val x$lzy = new scala.runtime.LazyInt()

def x$lzycompute(): Int = x$lzy.synchronized {
  if (x$lzy.initialized()) x$lzy.value()
  else x$lzy.initialize(<RHS>)
    // TODO: Implement Unit-typed lazy val optimization described below
    // for a Unit-typed lazy val, this becomes `{ rhs ; x$lzy.initialize() }`
    // to avoid passing around BoxedUnit
}

def x(): Int = if (x$lzy.initialized()) x$lzy.value() else x$lzycompute()

Make an eager val that would implement synthetic module. Eager val ensures thread safety and has less code generated.

Append offset fields to companion objects

If set, implicit search is enabled

Can this transform change the base types of a type?

Can this transform change the parents of a class?

Check what the phase achieves, to be called at any point after it is finished.

The sequence position of this phase in the given context where 0 is reserved for NoPhase and the first real phase is at position 1. -1 if the phase is not installed in the context.

Output should be checkable by TreeChecker

Is this phase the standard typerphase? True for TyperPhase, but not for other first phases (such as FromTasty or Parser). The predicate is tested in some places that perform checks and corrections. It's different from ctx.isAfterTyper (and cheaper to test).

The last phase during which the transformed denotations are valid

If set, use relaxed typing for all phases in group

List of names of phases that should have finished their processing of all compilation units before this phase starts

Transform tree using all transforms of current group (including this one)

Transform single node using all transforms following the current one in this group

Transform tree using all transforms following the current one in this group

The validity period of the transformed denotations in the given context