ConstantPropagation

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

object FoldADD extends FoldCommutativeOp

object FoldAND extends FoldAndSimplifyMatching

object FoldEqual extends FoldAndSimplifyMatching

object FoldNotEqual extends FoldAndSimplifyMatching

object FoldOR extends FoldAndSimplifyMatching

object FoldXOR extends FoldAndSimplifyMatching

object SimplifyDIV extends SimplifyBinaryOp

object SimplifyREM extends SimplifyBinaryOp

object SimplifySUB extends SimplifyBinaryOp

val annotationClasses: Traversable[Class[_]]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def execute(state: CircuitState): CircuitState

Perform the transform, encode renaming with RenameMap, and can delete annotations Called by runTransform.

final def getClass(): Class[_]

def hashCode(): Int

def inputForm: LowForm.type

The firrtl.CircuitForm that this transform requires to operate on

final def isInstanceOf[T0]: Boolean

val logger: Logger

def name: String

A convenience function useful for debugging and error messages

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def optimize(e: Expression, nodeMap: NodeMap): Expression

def optimize(e: Expression): Expression

def outputForm: LowForm.type

The firrtl.CircuitForm that this transform outputs

def prepare(state: CircuitState): CircuitState

final def runTransform(state: CircuitState): CircuitState

Perform the transform and update annotations.

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

def toString(): String

def transform(state: CircuitState): CircuitState

A mathematical transform on some type

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

final def wait(arg0: Long): Unit

final def wait(): Unit

def finalize(): Unit

final def getMyAnnotations(state: CircuitState): Seq[Annotation]

Convenience method to get annotations relevant to this Transform