Scala Compiler2.12.3-1 < Back
 

# Packages

-  package root

  The Scala compiler and reflection APIs.

  The Scala compiler and reflection APIs.

  Definition Classes
    root
-  package scala
  Definition Classes
    root
-  package tools
  Definition Classes
    scala
-  package nsc
  Definition Classes
    tools
-  package backend
  Definition Classes
    nsc
-  package jvm
  Definition Classes
    backend
-  package analysis

  Summary on the ASM analyzer framework --------------------------------------

  Summary on the ASM analyzer framework --------------------------------------

  Value

  - Abstract, needs to be implemented for each analysis.
  - Represents the desired information about local variables and stack values, for example:
    - Is this value known to be null / not null?
    - What are the instructions that could potentially have produced this value?

  Interpreter

  - Abstract, needs to be implemented for each analysis. Sometimes one can subclass an existing interpreter, e.g., SourceInterpreter or BasicInterpreter.
  - Multiple abstract methods that receive an instruction and the instruction's input values, and return a value representing the result of that instruction.
    - Note: due to control flow, the interpreter can be invoked multiple times for the same instruction, until reaching a fixed point.
  - Abstract `merge` function that computes the least upper bound of two values. Used by Frame.merge (see below).

  Frame

  - Can be used directly for many analyses, no subclass required.
  - Every frame has an array of values: one for each local variable and for each stack slot.
    - A `top` index stores the index of the current stack top
    - NOTE: for a size-2 local variable at index i, the local variable at i+1 is set to an empty value. However, for a size-2 value at index i on the stack, the value at i+1 holds the next stack value. IMPORTANT: this is only the case in ASM's analysis framework, not in bytecode. See comment below.
  - Defines the `execute(instruction)` method.
    - executing mutates the state of the frame according to the effect of the instruction
      - pop consumed values from the stack
      - pass them to the interpreter together with the instruction
      - if applicable, push the resulting value on the stack
  - Defines the `merge(otherFrame)` method
    - called by the analyzer when multiple control flow paths lead to an instruction
      - the frame at the branching instruction is merged into the current frame of the instruction (held by the analyzer)
      - mutates the values of the current frame, merges all values using interpreter.merge.

  Analyzer

  - Stores a frame for each instruction
  - `merge` function takes an instruction and a frame, merges the existing frame for that instr (from the frames array) with the new frame passed as argument. if the frame changed, puts the instruction on the work queue (fixpoint).
  - initial frame: initialized for first instr by calling interpreter.new[...]Value for each slot (locals and params), stored in frames[firstInstr] by calling `merge`
  - work queue of instructions (`queue` array, `top` index for next instruction to analyze)
  - analyze(method): simulate control flow. while work queue non-empty:
    - copy the state of `frames[instr]` into a local frame `current`
    - call `current.execute(instr, interpreter)`, mutating the `current` frame
    - if it's a branching instruction
      - for all potential destination instructions
        - merge the destination instruction frame with the `current` frame (this enqueues the destination instr if its frame changed)
      - invoke `newControlFlowEdge` (see below)
  - the analyzer also tracks active exception handlers at each instruction
  - the empty method `newControlFlowEdge` can be overridden to track control flow if required

  MaxLocals and MaxStack ----------------------

  At the JVM level, long and double values occupy two slots, both as local variables and on the stack, as specified in the JVM spec 2.6.2: "At any point in time, an operand stack has an associated depth, where a value of type long or double contributes two units to the depth and a value of any other type contributes one unit."

  For example, a method class A { def f(a: Long, b: Long) = a + b } has MAXSTACK=4 in the classfile. This value is computed by the ClassWriter / MethodWriter when generating the classfile (we always pass COMPUTE_MAXS to the ClassWriter).

  For running an ASM Analyzer, long and double values occupy two local variable slots, but only a single slot on the call stack, as shown by the following snippet:

  import scala.tools.nsc.backend.jvm._ import scala.tools.nsc.backend.jvm.opt.BytecodeUtils._ import scala.collection.convert.decorateAsScala._ import scala.tools.asm.tree.analysis._

  val cn = AsmUtils.readClass("/Users/luc/scala/scala/sandbox/A.class") val m = cn.methods.iterator.asScala.find(_.name == "f").head

  // the value is read from the classfile, so it's 4 println(s"maxLocals: ${m.maxLocals}, maxStack: ${m.maxStack}") // maxLocals: 5, maxStack: 4

  // we can safely set it to 2 for running the analyzer. m.maxStack = 2

  val a = new Analyzer(new BasicInterpreter) a.analyze(cn.name, m) val addInsn = m.instructions.iterator.asScala.find(_.getOpcode == 97).get // LADD Opcode val addFrame = a.frameAt(addInsn, m)

  addFrame.getStackSize // 2: the two long values only take one slot each addFrame.getLocals // 5: this takes one slot, the two long parameters take 2 slots each

  While running the optimizer, we need to make sure that the `maxStack` value of a method is large enough for running an ASM analyzer. We don't need to worry if the value is incorrect in the JVM perspective: the value will be re-computed and overwritten in the ClassWriter.

  Lessons learnt while benchmarking the alias tracking analysis -------------------------------------------------------------

  Profiling

  - Use YourKit for finding hotspots (cpu profiling). when it comes to drilling down into the details of a hotspot, don't pay too much attention to the percentages / time counts.
  - Should also try other profilers.
  - Use timers. When a method showed up as a hotspot, I added a timer around that method, and a second one within the method to measure specific parts. The timers slow things down, but the relative numbers show what parts of a method are slow.

  ASM analyzer insights

  - The time for running an analysis depends on the number of locals and the number of instructions. Reducing the number of locals helps speeding up the analysis: there are less values to merge when merging to frames. See also https://github.com/scala/scala-dev/issues/47
  - The common hot spot of an ASM analysis is Frame.merge, for example in producers / consumers.
  - For nullness analysis the time is spent as follows
    - 20% merging nullness values. this is as expected: for example, the same absolute amount of time is spent in merging BasicValues when running a BasicInterpreter.
    - 50% merging alias sets. i tried to optimize what i could out of this.
    - 20% is spent creating new frames from existing ones, see comment on AliasingFrame.init.
  - The implementation of Frame.merge (the main hot spot) contains a megamorphic callsite to `interpreter.merge`. This can be observed easily by running a test program that either runs a BasicValue analysis only, versus a program that first runs a nullness analysis and then a BasicValue. In an example, the time for the BasicValue analysis goes from 519ms to 1963ms, a 3.8x slowdown.
  - I added counters to the Frame.merge methods for nullness and BasicValue analysis. In the examples I benchmarked, the number of merge invocations was always exactly the same. It would probably be possible to come up with an example where alias set merging forces additional analysis rounds until reaching the fixpoint, but I did not observe such cases.

  To benchmark an analysis, instead of benchmarking analysis while it runs in the compiler backend, one can easily run it from a separate program (or the repl). The bytecode to analyze can simply be parsed from a classfile. See example at the end of this comment.

  Nullness Analysis in Miguel's Optimizer ---------------------------------------

  Miguel implemented alias tracking for nullness analysis differently [1]. Remember that every frame has an array of values. Miguel's idea was to represent aliasing using reference equality in the values array: if two entries in the array point to the same value object, the two entries are aliases in the frame of the given instruction.

  While this idea seems elegant at first sight, Miguel's implementation does not merge frames correctly when it comes to aliasing. Assume in frame 1, values (a, b, c) are aliases, while in frame 2 (a, b) are aliases. When merging the second into the first, we have to make sure that c is removed as an alias of (a, b).

  It would be possible to implement correct alias set merging in Miguel's approach. However, frame merging is the main hot spot of analysis. The computational complexity of implementing alias set merging by traversing the values array and comparing references is too high. The concrete alias set representation that is used in the current implementation (see class AliasingFrame) makes alias set merging more efficient.

  [1] https://github.com/scala-opt/scala/blob/opt/rebase/src/compiler/scala/tools/nsc/backend/bcode/NullnessPropagator.java

  Complexity and scaling of analysis ----------------------------------

  The time complexity of a data flow analysis depends on:

  - The size of the method. The complexity factor is linear (assuming the number of locals and branching instructions remains constant). The main analysis loop runs through all instructions of a method once. Instructions are only re-enqueued if a control flow merge changes the frame at some instruction.
  - The branching instructions. When a second (third, ..) control flow edge arrives at an instruction, the existing frame at the instruction is merged with the one computed on the new branch. If the merge function changes the existing frame, the instruction is enqueued for another analysis. This results in a merge operation for the successors of the instruction.
  - The number of local variables. The hot spot of analysis is frame merging. The merge function iterates through the values in the frame (locals and stack values) and merges them.

  I measured the running time of an analysis for two examples:

  - Keep the number of locals and branching instructions constant, increase the number of instructions. The running time grows linearly with the method size.
  - Increase the size and number of locals in a method. The method size and number of locals grow in the same pace. Here, the running time increase is polynomial. It looks like the complexity is be #instructions * #locals^2 (see below).

  I measured nullness analysis (which tracks aliases) and a SimpleValue analysis. Nullness runs roughly 5x slower (because of alias tracking) at every problem size - this factor doesn't change.

  The numbers below are for nullness. Note that the last column is constant, i.e., the running time is proportional to #ins * #loc^2. Therefore we use this factor when limiting the maximal method size for running an analysis.

  #insns #locals time (ms) time / #ins * #loc2 * 106 1305 156 34 1.07 2610 311 165 0.65 3915 466 490 0.57 5220 621 1200 0.59 6525 776 2220 0.56 7830 931 3830 0.56 9135 1086 6570 0.60 10440 1241 9700 0.60 11745 1396 13800 0.60

  As a second experiment, nullness analysis was run with varying #insns but constant #locals. The last column shows linear complexity with respect to the method size (linearOffset = 2279):

  #insns #locals time (ms) (time + linearOffset) / #insns 5220 621 1090 0.645 6224 621 1690 0.637 7226 621 2280 0.630 8228 621 2870 0.625 9230 621 3530 0.629 10232 621 4130 0.626 11234 621 4770 0.627 12236 621 5520 0.637 13238 621 6170 0.638

  When running a BasicValue analysis, the complexity observation is the same (time is proportional to #ins * #loc^2).

  Measuring analysis execution time ---------------------------------

  See code below.

  Definition Classes
    jvm
-  package opt
  Definition Classes
    jvm
- AsmUtils
- BCodeBodyBuilder
- BCodeHelpers
- BCodeIdiomatic
- BCodeSkelBuilder
- BCodeSyncAndTry
- BTypes
- BTypesFromSymbols
- BackendReporting
- BackendReportingImpl
- BackendStats
- BytecodeWriters
- CoreBTypes
- CoreBTypesProxy
- CoreBTypesProxyGlobalIndependent
- FileConflictException
- GenBCode

c

scala.tools.nsc.backend.jvm

# BCodeSkelBuilder 

###

#### abstract class BCodeSkelBuilder extends BCodeHelpers

Source
  BCodeSkelBuilder.scala

Linear Supertypes
BCodeHelpers, BytecodeWriters, BCodeIdiomatic, SubComponent, AnyRef, Any
Known Subclasses
genBCode, BCodeBodyBuilder, BCodeSyncAndTry, GenBCode
Type Hierarchy
 
Ordering

1. Alphabetic
2. By Inheritance

Inherited

1. BCodeSkelBuilder
2. BCodeHelpers
3. BytecodeWriters
4. BCodeIdiomatic
5. SubComponent
6. AnyRef
7. 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 BCodeSkelBuilder()

### Type Members

1.  abstract class StdPhase extends GlobalPhase

   A standard phase template

   A standard phase template

   Definition Classes
     SubComponent
2.  trait BCAnnotGen extends BCInnerClassGen
   Definition Classes
     BCodeHelpers
3.  trait BCClassGen extends BCInnerClassGen
   Definition Classes
     BCodeHelpers
4.  trait BCForwardersGen extends BCAnnotGen with BCJGenSigGen
   Definition Classes
     BCodeHelpers
5.  trait BCInnerClassGen extends AnyRef
   Definition Classes
     BCodeHelpers
6.  trait BCJGenSigGen extends AnyRef
   Definition Classes
     BCodeHelpers
7.  trait BCPickles extends AnyRef
   Definition Classes
     BCodeHelpers
8.  final class CClassWriter extends ClassWriter
   Definition Classes
     BCodeHelpers
9.  final case class EnclosingMethodEntry (owner: String, name: String, methodDescriptor: String) extends Product with Serializable
   Definition Classes
     BCodeHelpers
10.  trait JAndroidBuilder extends AnyRef
    Definition Classes
      BCodeHelpers
11.  class JBeanInfoBuilder extends BCInnerClassGen
    Definition Classes
      BCodeHelpers
12.  abstract class JCommonBuilder extends BCInnerClassGen with BCAnnotGen with BCForwardersGen with BCPickles
    Definition Classes
      BCodeHelpers
13.  class JMirrorBuilder extends JCommonBuilder
    Definition Classes
      BCodeHelpers
14.  implicit class InsnIterInsnList extends AnyRef
    Definition Classes
      BCodeIdiomatic
15.  implicit class InsnIterMethodNode extends AnyRef
    Definition Classes
      BCodeIdiomatic
16.  abstract class JCodeMethodN extends AnyRef
    Definition Classes
      BCodeIdiomatic
17.  class LabelDefsFinder extends Global.Traverser
    Definition Classes
      BCodeIdiomatic
18.  abstract class PlainSkelBuilder extends BCClassGen with BCAnnotGen with BCInnerClassGen with JAndroidBuilder with BCForwardersGen with BCPickles with BCJGenSigGen
19.  trait AsmpBytecodeWriter extends BytecodeWriter
    Definition Classes
      BytecodeWriters
20.  trait BytecodeWriter extends AnyRef
    Definition Classes
      BytecodeWriters
21.  trait ClassBytecodeWriter extends BytecodeWriter
    Definition Classes
      BytecodeWriters
22.  class DirectToJarfileWriter extends BytecodeWriter
    Definition Classes
      BytecodeWriters
23.  trait DumpBytecodeWriter extends BytecodeWriter
    Definition Classes
      BytecodeWriters

### Abstract Value Members

1.  abstract val global: Global
   Definition Classes
     BytecodeWriters
2.  abstract def newPhase(prev: Phase): Phase

   The phase factory

   The phase factory

   Definition Classes
     SubComponent
3.  abstract val phaseName: String

   The name of the phase

   The name of the phase

   Definition Classes
     SubComponent
4.  abstract val runsAfter: List[String]

   Names of phases that must run before this phase.

   Names of phases that must run before this phase.

   Definition Classes
     SubComponent
5.  abstract val runsRightAfter: Option[String]

   Name of the phase that this phase must follow immediately.

   Name of the phase that this phase must follow immediately.

   Definition Classes
     SubComponent

### Concrete Value Members

1.  object delambdafyInline

   Cache the value of delambdafy == "inline" for each run.

   Cache the value of delambdafy == "inline" for each run. We need to query this value many times, so caching makes sense.

   Definition Classes
     BCodeHelpers
2.  object isJavaEntryPoint
   Definition Classes
     BCodeHelpers
3.  object JCodeMethodN
   Definition Classes
     BCodeIdiomatic
4.  final def !=(arg0: Any): Boolean
   Definition Classes
     AnyRef → Any
5.  final def ##(): Int
   Definition Classes
     AnyRef → Any
6.  def +(other: String): String
   Implicit
     This member is added by an implicit conversion from BCodeSkelBuilder to any2stringadd[BCodeSkelBuilder] performed by method any2stringadd in scala.Predef.
   Definition Classes
     any2stringadd
7.  def ->[B](y: B): (BCodeSkelBuilder, B)
   Implicit
     This member is added by an implicit conversion from BCodeSkelBuilder to ArrowAssoc[BCodeSkelBuilder] performed by method ArrowAssoc in scala.Predef.
   Definition Classes
     ArrowAssoc
   Annotations
     @inline()
8.  final def ==(arg0: Any): Boolean
   Definition Classes
     AnyRef → Any
9.  val EMPTY_BTYPE_ARRAY: Array[BTypesFromSymbols.BType]
   Definition Classes
     BCodeIdiomatic
10.  val EMPTY_INT_ARRAY: Array[Int]
    Definition Classes
      BCodeIdiomatic
11.  val EMPTY_LABEL_ARRAY: Array[Label]
    Definition Classes
      BCodeIdiomatic
12.  val EMPTY_STRING_ARRAY: Array[String]
    Definition Classes
      BCodeIdiomatic
13.  lazy val JavaStringBuilderClassName: InternalName
    Definition Classes
      BCodeIdiomatic
14.  final def addInnerClasses(jclass: ClassVisitor, refedInnerClasses: List[BTypesFromSymbols.ClassBType]): Unit
    Definition Classes
      BCodeHelpers
15.  final def afterOwnPhase[T](op: ⇒ T): T
    Definition Classes
      SubComponent
    Annotations
      @inline()
16.  final def asInstanceOf[T0]: T0
    Definition Classes
      Any
17.  val bTypes: BTypesFromSymbols[global.type]
    Definition Classes
      BCodeIdiomatic
18.  final def beforeOwnPhase[T](op: ⇒ T): T
    Definition Classes
      SubComponent
    Annotations
      @inline()
19.  def classOriginallyNestedInClass(nestedClass: Global.Symbol, enclosingClass: Global.Symbol): Boolean
    Definition Classes
      BCodeHelpers
20.  val classfileVersion: Int
    Definition Classes
      BCodeIdiomatic
21.  def clone(): AnyRef
    Attributes
      protected[java.lang]
    Definition Classes
      AnyRef
    Annotations
      @throws( ... )
22.  final def coercionFrom(code: Int): BTypesFromSymbols.BType
    Definition Classes
      BCodeIdiomatic
23.  final def coercionTo(code: Int): BTypesFromSymbols.BType
    Definition Classes
      BCodeIdiomatic
24.  def completeSilentlyAndCheckErroneous(sym: Global.Symbol): Boolean

    This is a hack to work around scala/bug#9111.

    This is a hack to work around scala/bug#9111. The completer of `methodSym` may report type errors. We cannot change the typer context of the completer at this point and make it silent: the context captured when creating the completer in the namer. However, we can temporarily replace global.reporter (it's a var) to store errors.

    Definition Classes
      BCodeHelpers
25.  def considerAsTopLevelImplementationArtifact(classSym: Global.Symbol): Boolean

    True for classes generated by the Scala compiler that are considered top-level in terms of the InnerClass / EnclosingMethod classfile attributes.

    True for classes generated by the Scala compiler that are considered top-level in terms of the InnerClass / EnclosingMethod classfile attributes. See comment in BTypes.

    Definition Classes
      BCodeHelpers
26.  val emitStackMapFrame: Boolean
    Definition Classes
      BCodeIdiomatic
27.  def enabled: Boolean

    Is this component enabled? Default is true.

    Is this component enabled? Default is true.

    Definition Classes
      SubComponent
28.  def enclosingMethodAttribute(classSym: Global.Symbol, classDesc: (Global.Symbol) ⇒ String, methodDesc: (Global.Symbol) ⇒ String): Option[EnclosingMethodEntry]

    Data for emitting an EnclosingMethod attribute.

    Data for emitting an EnclosingMethod attribute. None if `classSym` is a member class (not an anonymous or local class). See doc in BTypes.

    The class is parameterized by two functions to obtain a bytecode class descriptor for a class symbol, and to obtain a method signature descriptor fro a method symbol. These function depend on the implementation of GenASM / GenBCode, so they need to be passed in.

    Definition Classes
      BCodeHelpers
29.  def ensuring(cond: (BCodeSkelBuilder) ⇒ Boolean, msg: ⇒ Any): BCodeSkelBuilder
    Implicit
      This member is added by an implicit conversion from BCodeSkelBuilder to Ensuring[BCodeSkelBuilder] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
30.  def ensuring(cond: (BCodeSkelBuilder) ⇒ Boolean): BCodeSkelBuilder
    Implicit
      This member is added by an implicit conversion from BCodeSkelBuilder to Ensuring[BCodeSkelBuilder] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
31.  def ensuring(cond: Boolean, msg: ⇒ Any): BCodeSkelBuilder
    Implicit
      This member is added by an implicit conversion from BCodeSkelBuilder to Ensuring[BCodeSkelBuilder] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
32.  def ensuring(cond: Boolean): BCodeSkelBuilder
    Implicit
      This member is added by an implicit conversion from BCodeSkelBuilder to Ensuring[BCodeSkelBuilder] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
33.  final def eq(arg0: AnyRef): Boolean
    Definition Classes
      AnyRef
34.  def equals(arg0: Any): Boolean
    Definition Classes
      AnyRef → Any
35.  val extraProc: Int
    Definition Classes
      BCodeIdiomatic
36.  def factoryNonJarBytecodeWriter(): BytecodeWriter
    Definition Classes
      BytecodeWriters
37.  def fieldSymbols(cls: Global.Symbol): List[Global.Symbol]
    Definition Classes
      BCodeHelpers
38.  def finalize(): Unit
    Attributes
      protected[java.lang]
    Definition Classes
      AnyRef
    Annotations
      @throws( classOf[java.lang.Throwable] )
39.  def formatted(fmtstr: String): String
    Implicit
      This member is added by an implicit conversion from BCodeSkelBuilder to StringFormat[BCodeSkelBuilder] performed by method StringFormat in scala.Predef.
    Definition Classes
      StringFormat
    Annotations
      @inline()
40.  final def getClass(): Class[_]
    Definition Classes
      AnyRef → Any
41.  def getFile(sym: Global.Symbol, clsName: String, suffix: String): AbstractFile
    Definition Classes
      BytecodeWriters
42.  def getFile(base: AbstractFile, clsName: String, suffix: String): AbstractFile

    clsName

      cls.getName

    Definition Classes
      BytecodeWriters
43.  def getFileForClassfile(base: AbstractFile, clsName: String, suffix: String): AbstractFile
    Definition Classes
      BCodeHelpers
44.  def getOutFolder(csym: Global.Symbol, cName: String, cunit: Global.CompilationUnit): AbstractFile
    Definition Classes
      BCodeHelpers
45.  def hashCode(): Int

    SubComponent are added to a HashSet and two phases are the same if they have the same name

    SubComponent are added to a HashSet and two phases are the same if they have the same name

    Definition Classes
      SubComponent → AnyRef → Any
46.  def initBytecodeWriter(entryPoints: List[Global.Symbol]): BytecodeWriter
    Definition Classes
      BCodeHelpers
47.  val initial: Boolean

    True if this phase runs before all other phases.

    True if this phase runs before all other phases. Usually, `parser`.

    Definition Classes
      SubComponent
48.  val internal: Boolean

    True if this phase is not provided by a plug-in.

    True if this phase is not provided by a plug-in.

    Definition Classes
      SubComponent
49.  def isAnonymousOrLocalClass(classSym: Global.Symbol): Boolean

    True if `classSym` is an anonymous class or a local class.

    True if `classSym` is an anonymous class or a local class. I.e., false if `classSym` is a member class. This method is used to decide if we should emit an EnclosingMethod attribute. It is also used to decide whether the "owner" field in the InnerClass attribute should be null.

    Definition Classes
      BCodeHelpers
50.  final def isInstanceOf[T0]: Boolean
    Definition Classes
      Any
51.  def isOriginallyStaticOwner(sym: Global.Symbol): Boolean

    This is basically a re-implementation of sym.isStaticOwner, but using the originalOwner chain.

    This is basically a re-implementation of sym.isStaticOwner, but using the originalOwner chain.

    The problem is that we are interested in a source-level property. Various phases changed the symbol's properties in the meantime, mostly lambdalift modified (destructively) the owner. Therefore, `sym.isStatic` is not what we want. For example, in object T { def f { object U } } the owner of U is T, so UModuleClass.isStatic is true. Phase travel does not help here.

    Definition Classes
      BCodeHelpers
52.  val majorVersion: Int
    Definition Classes
      BCodeIdiomatic
53.  def methodSymbols(cd: Global.ClassDef): List[Global.Symbol]
    Definition Classes
      BCodeHelpers
54.  final def mkArray(xs: List[Label]): Array[Label]
    Definition Classes
      BCodeIdiomatic
55.  final def mkArray(xs: List[String]): Array[String]
    Definition Classes
      BCodeIdiomatic
56.  final def mkArray(xs: List[BTypesFromSymbols.BType]): Array[BTypesFromSymbols.BType]
    Definition Classes
      BCodeIdiomatic
57.  final def mkArrayReverse(xs: List[Int]): Array[Int]
    Definition Classes
      BCodeIdiomatic
58.  final def mkArrayReverse(xs: List[String]): Array[String]
    Definition Classes
      BCodeIdiomatic
59.  final def ne(arg0: AnyRef): Boolean
    Definition Classes
      AnyRef
60.  def needsStaticImplMethod(sym: Global.Symbol): Boolean
    Definition Classes
      BCodeHelpers
61.  def nextEnclosing(sym: Global.Symbol): Global.Symbol

    The next enclosing definition in the source structure.

    The next enclosing definition in the source structure. Includes anonymous function classes under delambdafy:inline, even though they are only generated during UnCurry.

    Definition Classes
      BCodeHelpers
62.  def nextEnclosingClass(sym: Global.Symbol): Global.Symbol
    Definition Classes
      BCodeHelpers
63.  final def notify(): Unit
    Definition Classes
      AnyRef
64.  final def notifyAll(): Unit
    Definition Classes
      AnyRef
65.  def outputDirectory(sym: Global.Symbol): AbstractFile
    Definition Classes
      BytecodeWriters
66.  def ownPhase: Phase

    The phase corresponding to this subcomponent in the current compiler run

    The phase corresponding to this subcomponent in the current compiler run

    Definition Classes
      SubComponent
67.  def phaseNewFlags: Long

    New flags defined by the phase which are not valid before

    New flags defined by the phase which are not valid before

    Definition Classes
      SubComponent
68.  def phaseNextFlags: Long

    New flags defined by the phase which are not valid until immediately after it

    New flags defined by the phase which are not valid until immediately after it

    Definition Classes
      SubComponent
69.  var pickledBytes: Int
    Definition Classes
      BCodeHelpers
70.  val requires: List[String]

    Names of phases required by this component.

    Names of phases required by this component. Default is `Nil`.

    Definition Classes
      SubComponent
71.  val runsBefore: List[String]

    Names of phases that must run after this phase.

    Names of phases that must run after this phase. Default is `Nil`.

    Definition Classes
      SubComponent
72.  def serialVUID(csym: Global.Symbol): Option[Long]
    Definition Classes
      BCodeHelpers
73.  final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
      AnyRef
74.  val terminal: Boolean

    True if this phase runs after all other phases.

    True if this phase runs after all other phases. Usually, `terminal`.

    Definition Classes
      SubComponent
75.  def toString(): String
    Definition Classes
      AnyRef → Any
76.  final def traitSuperAccessorName(sym: Global.Symbol): Global.Name
    Definition Classes
      BCodeHelpers
77.  final def wait(): Unit
    Definition Classes
      AnyRef
    Annotations
      @throws( ... )
78.  final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
      AnyRef
    Annotations
      @throws( ... )
79.  final def wait(arg0: Long): Unit
    Definition Classes
      AnyRef
    Annotations
      @throws( ... )
80.  def →[B](y: B): (BCodeSkelBuilder, B)
    Implicit
      This member is added by an implicit conversion from BCodeSkelBuilder to ArrowAssoc[BCodeSkelBuilder] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
      ArrowAssoc

### Inherited from BCodeHelpers

### Inherited from BytecodeWriters

### Inherited from BCodeIdiomatic

### Inherited from SubComponent

### Inherited from AnyRef

### Inherited from Any

### Inherited by implicit conversion any2stringadd from BCodeSkelBuilder to any2stringadd[BCodeSkelBuilder]

### Inherited by implicit conversion StringFormat from BCodeSkelBuilder to StringFormat[BCodeSkelBuilder]

### Inherited by implicit conversion Ensuring from BCodeSkelBuilder to Ensuring[BCodeSkelBuilder]

### Inherited by implicit conversion ArrowAssoc from BCodeSkelBuilder to ArrowAssoc[BCodeSkelBuilder]

### Ungrouped