Data

abstract def asDirectionless(): Data.this.type

abstract def asOutput(): Data.this.type

Sets the direction (*dir*) of instances derived from Bits to OUTPUT or recursively sets members of Bundle/Vec to OUTPUT.

abstract def fromNode(n: Node): Data.this.type

Factory method to create and assign a leaf-type instance out of a subclass of *Node* instance which we have lost the concrete type.

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

def ##[T <: Data](right: T): Data.this.type

def ##(b: Node): Node

final def ##(): Int

def :=[T <: Data](data: T): Unit

def <>(src: Node): Unit

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def ===[T <: Data](right: T): Bool

def ^^(src: Node): Unit

def addConsumers(): Unit

def apply(name: String): Data

def asInput(): Data.this.type

final def asInstanceOf[T0]: T0

def assign(src: Node): Unit

def bitSet(off: UInt, dat: UInt): UInt

def clearlyEquals(x: Node): Boolean

var clock: Clock

def clone(): Data.this.type

var comp: proc

var component: Module

def componentOf: Module

val consumers: ArrayBuffer[Node]

var depth: Int

var driveRand: Boolean

def emitIndex(): Int

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def extract(b: Bundle): List[Node]

def extract(widths: Array[Int]): List[UInt]

def finalize(): Unit

def flatten: Array[(String, Bits)]

var flattened: Boolean

def flip(): Data.this.type

def forceMatchingWidths: Unit

def fromBits(b: Bits): Data.this.type

var genError: Boolean

final def getClass(): Class[_]

def getLit: Literal

def getNode(): Node

def getWidth(): Int

def hashCode(): Int

var index: Int

def infer: Boolean

var inferCount: Int

var inferWidth: (Node) ⇒ Int

def init(n: String, w: Int, ins: Node*): Node

def init(n: String, width: (Node) ⇒ Int, ins: Node*): Node

def initOf(n: String, width: (Node) ⇒ Int, ins: List[Node]): Node

val inputs: ArrayBuffer[Node]

def isByValue: Boolean

var isClkInput: Boolean

def isDirectionless: Boolean

var isFixedWidth: Boolean

def isInObject: Boolean

def isInVCD: Boolean

final def isInstanceOf[T0]: Boolean

def isIo: Boolean

def isIo_=(isIo: Boolean): Unit

def isLit: Boolean

def isMemOutput: Boolean

var isPrintArg: Boolean

def isRamWriteInput(i: Node): Boolean

def isReg: Boolean

var isScanArg: Boolean

var isSigned: Boolean

var isTypeNode: Boolean

def isUsedByRam: Boolean

var isWidthWalked: Boolean

var line: StackTraceElement

def litOf: Literal

def litValue(default: BigInt = BigInt(-1)): BigInt

def matchWidth(w: Int): Node

def maxNum: BigInt

def maybeFlatten: Seq[Node]

def minNum: BigInt

var name: String

var nameHolder: nameable

def nameIt(path: String): Unit

var named: Boolean

_named_ is used to indicates name was set explicitely and should not be overriden by a _nameIt_ generator.

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def printTree(writer: PrintStream, depth: Int = 4, indent: String = ""): Unit

Prints all members of a node and recursively its inputs up to a certain depth level.

var prune: Boolean

def removeTypeNodes(): Unit

var sccIndex: Int

var sccLowlink: Int

def setIsClkInput: Unit

def setIsSigned: Unit

def setIsTypeNode: Unit

def setName(n: String): Unit

def setWidth(w: Int): Unit

def signed: Data.this.type

var stack: Array[StackTraceElement]

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

def terminate(): Unit

def toBits(): UInt

def toBool(): Bool

def toNode: Node

def toString(): String

def traceNode(c: Module, stack: Stack[() ⇒ Any]): Any

def traceableNodes: Array[Node]

def value: BigInt

final def wait(): Unit

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

final def wait(arg0: Long): Unit

var walked: Boolean

def width: Int

var width_: Int

def width_=(w: Int): Unit

Sets the width of a Node.