Node

*Node* defines the root class of the class hierarchy for a [Composite Pattern](http://en.wikipedia.org/wiki/Composite_pattern).

A digital logic graph is encoded as adjacency graph where instances of *Node* describe vertices and *inputs*, *consumers* member fields are used to traverse the directed graph respectively backward (from output to input) and forward (from input to output).

Linear Supertypes

nameable, AnyRef, Any

Known Subclasses

AccessTracker, Aggregate, ArbiterIO, Assert, BinaryOp, Binding, Bits, BitsInObject, Bool, Bundle, Clock, Complex, Data, Dbl, DecoupledIO, DecoupledIOC, Delay, DeqIO, EnqIO, Extract, Fame1WrapperIO, FameDecoupledIO, FameQueueTrackerIO, Fix, Flo, Insert, Literal, Log2, Log2Like, LogicalOp, Mem, MemAccess, MemRead, MemReadWrite, MemSeqRead, MemWrite, Mux, OHToUInt, Op, Printf, PrintfBase, PriorityEncoder, PutativeMemWrite, QueueIO, ROM, ROMData, ROMRead, ReductionOp, Reg, RegIO, RegReset, SFix, SInt, Sprintf, UFix, UInt, UnaryOp, ValidIO, Vec, VecProc, proc

Instance Constructors

new Node()

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def ##(b: Node): Node
final def ##(): Int

Definition Classes
AnyRef → Any
def <>(src: Node): Unit
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def W0Wtransform(): Unit
def ^^(src: Node): Unit
val _id: Int
def _isComplementOf(x: Node): Boolean
def addConsumers(): Unit
final def asInstanceOf[T0]: T0

Definition Classes
Any
def assign(src: Node): Unit
def canCSE: Boolean
lazy val chiselName: String
var clock: Clock
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
var cntrIdx: Int
var component: Module
def componentOf: Module
val consumers: LinkedHashSet[Node]
def dblLitValue: Double
var depth: Int
var driveRand: Boolean
lazy val emitIndex: Int
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(that: Any): Boolean

Definition Classes
Node → AnyRef → Any
def equalsForCSE(x: Node): Boolean
def extract(b: Bundle): List[Node]
def extract(widths: Array[Int]): List[UInt]
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def floLitValue: Float
def forceMatchingWidths: Unit
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def getLit: Literal
def getNode: Node
def getWidth(): Int
def getWidthW(): Width
def hashCode(): Int

Definition Classes
Node → AnyRef → Any
def hashCodeForCSE: Int
def infer: Boolean
var inferWidth: (⇒ Node) ⇒ Width
def init(n: String, w: Int, ins: Node*): Node
def init(n: String, widthFunc: (⇒ Node) ⇒ Width, ins: Node*): Node
def initOf(n: String, widthfunc: (⇒ Node) ⇒ Width, ins: Iterable[Node]): Node
val inputs: ArrayBuffer[Node]
def isByValue: Boolean
lazy val isInObject: Boolean
lazy val isInVCD: Boolean
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def isIo: Boolean
def isIo_=(isIo: Boolean): Unit
def isKnownWidth: Boolean
final def isLit: Boolean
def isReg: Boolean
var isTypeNode: Boolean
def isUsedByClockHi: Boolean
var isWidthWalked: Boolean
val line: StackTraceElement
def litOf: Literal
def litValue(default: BigInt = BigInt(-1)): BigInt
def matchWidth(w: Width): Node
def maybeFlatten: Seq[Node]
var modified: Boolean
var name: String

Definition Classes
nameable
var nameHolder: nameable
def nameIt(path: String, isNamingIo: Boolean): Unit
var named: Boolean

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

Definition Classes
nameable
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def needWidth(): Int
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
var parents: LinkedHashSet[Node]
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.
Prints all members of a node and recursively its inputs up to a certain depth level. This method is purely used for debugging.
var prune: Boolean
def removeTypeNodes(): Unit
def replaceTree(newNode: Node): Unit
def review(): Unit
var sccIndex: Int
var sccLowlink: Int
def setName(n: String): Unit
def setWidth(w: Int): Unit
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toBits(): UInt
def toNode: Node
def toString(): String

Definition Classes
AnyRef → Any
def usesInClockHi(i: Node): Boolean
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
var width_: Width

Related Docs: object Node | package Chisel

abstract class Node extends nameable

Instance Constructors

new Node()

Value Members

final def !=(arg0: Any): Boolean

def ##(b: Node): Node

final def ##(): Int

def <>(src: Node): Unit

final def ==(arg0: Any): Boolean

def W0Wtransform(): Unit

def ^^(src: Node): Unit

val _id: Int

def _isComplementOf(x: Node): Boolean

def addConsumers(): Unit

final def asInstanceOf[T0]: T0

def assign(src: Node): Unit

def canCSE: Boolean

lazy val chiselName: String

var clock: Clock

def clone(): AnyRef

var cntrIdx: Int

var component: Module

def componentOf: Module

val consumers: LinkedHashSet[Node]

def dblLitValue: Double

var depth: Int

var driveRand: Boolean

lazy val emitIndex: Int

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def equalsForCSE(x: Node): Boolean

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

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

def finalize(): Unit

def floLitValue: Float

def forceMatchingWidths: Unit

final def getClass(): Class[_]

def getLit: Literal

def getNode: Node

def getWidth(): Int

def getWidthW(): Width

def hashCode(): Int

def hashCodeForCSE: Int

def infer: Boolean

var inferWidth: (⇒ Node) ⇒ Width

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

def init(n: String, widthFunc: (⇒ Node) ⇒ Width, ins: Node*): Node

def initOf(n: String, widthfunc: (⇒ Node) ⇒ Width, ins: Iterable[Node]): Node

val inputs: ArrayBuffer[Node]

def isByValue: Boolean

lazy val isInObject: Boolean

lazy val isInVCD: Boolean

final def isInstanceOf[T0]: Boolean

def isIo: Boolean

def isIo_=(isIo: Boolean): Unit

def isKnownWidth: Boolean

final def isLit: Boolean

def isReg: Boolean

var isTypeNode: Boolean

def isUsedByClockHi: Boolean

var isWidthWalked: Boolean

val line: StackTraceElement

def litOf: Literal

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

def matchWidth(w: Width): Node

def maybeFlatten: Seq[Node]

var modified: Boolean

var name: String

var nameHolder: nameable

def nameIt(path: String, isNamingIo: Boolean): Unit

var named: Boolean

final def ne(arg0: AnyRef): Boolean

def needWidth(): Int

final def notify(): Unit

final def notifyAll(): Unit

var parents: LinkedHashSet[Node]

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

var prune: Boolean