SeqMem

final def !=(arg0: Any): Boolean

def ##(b: Node): Node

The cat operator to combine two values

0x5 ## 0x3 => 0x53

final def ##(): Int

def ++[B >: T, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

def ++:[B >: T, That](that: Traversable[B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

def ++:[B >: T, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

def +:[B >: T, That](elem: B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

def /:[B](z: B)(op: (B, T) ⇒ B): B

def :+[B >: T, That](elem: B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

def :\[B](z: B)(op: (T, B) ⇒ B): B

def <>(src: Node): Unit

final def ==(arg0: Any): Boolean

def W0Wtransform(): Unit

Eliminate any zero-width wires attached to this node

def ^^(src: Node): Unit

val _id: Int

The unique id of this node

def _isComplementOf(x: Node): Boolean

def addString(b: StringBuilder): StringBuilder

def addString(b: StringBuilder, sep: String): StringBuilder

def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

def aggregate[B](z: ⇒ B)(seqop: (B, T) ⇒ B, combop: (B, B) ⇒ B): B

def andThen[C](k: (T) ⇒ C): PartialFunction[Int, C]

def apply(addr: UInt): T

def apply(addr: Int): T

def applyOrElse[A1 <: Int, B1 >: T](x: A1, default: (A1) ⇒ B1): B1

final def asInstanceOf[T0]: T0

def assign(src: Node): Unit

def assignClock(clk: Clock): Unit

def assignReset(rst: ⇒ Bool): Boolean

def canCSE: Boolean

def canEqual(that: Any): Boolean

lazy val chiselName: String

var clock: Option[Clock]

The clock for this node

def clone(): Mem[T]

def cloneType: Mem[T]

def collect[B, That](pf: PartialFunction[T, B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

def collectFirst[B](pf: PartialFunction[T, B]): Option[B]

def combinations(n: Int): Iterator[IndexedSeq[T]]

def companion: GenericCompanion[IndexedSeq]

def componentOf: Module

Get the module that this node is a part of or the top module if not assigned yet

def compose[A](g: (A) ⇒ Int): (A) ⇒ T

def computePorts: ArrayBuffer[MemSeqRead]

val consumers: LinkedHashSet[Node]

nodes that consume one of my outputs

def contains(x: T)(implicit evidence: <:<[T, Bits]): Bool

def contains[A1 >: T](elem: A1): Boolean

def containsSlice[B](that: GenSeq[B]): Boolean

def convertMaskedWrites: Unit

def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Unit

def copyToArray[B >: T](xs: Array[B]): Unit

def copyToArray[B >: T](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: T](dest: Buffer[B]): Unit

def corresponds[B](that: GenSeq[B])(p: (T, B) ⇒ Boolean): Boolean

def count(p: (T) ⇒ Bool): UInt

def count(p: (T) ⇒ Boolean): Int

val data: Node

def dataType: T

def dblLitValue: Double

Convert the node literal to a Double

def diff[B >: T](that: GenSeq[B]): IndexedSeq[T]

def distinct: IndexedSeq[T]

def doWrite(addr: UInt, condIn: Bool, wdata: Node, wmaskIn: Option[UInt]): Unit

var driveRand: Boolean

def drop(n: Int): IndexedSeq[T]

def dropRight(n: Int): IndexedSeq[T]

def dropWhile(p: (T) ⇒ Boolean): IndexedSeq[T]

def endsWith[B](that: GenSeq[B]): Boolean

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

Compare two nodes

def equalsForCSE(x: Node): Boolean

def exists(p: (T) ⇒ Bool): Bool

def exists(p: (T) ⇒ Boolean): Boolean

def filter(p: (T) ⇒ Boolean): IndexedSeq[T]

def filterNot(p: (T) ⇒ Boolean): IndexedSeq[T]

def finalize(): Unit

def find(p: (T) ⇒ Boolean): Option[T]

def flatMap[B, That](f: (T) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

def flatten[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): IndexedSeq[B]

def floLitValue: Float

Convert the node literal to a Float

def fold[A1 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft[B](z: B)(op: (B, T) ⇒ B): B

def foldRight[B](z: B)(op: (T, B) ⇒ B): B

def forall(p: (T) ⇒ Bool): Bool

def forall(p: (T) ⇒ Boolean): Boolean

def foreach[U](f: (T) ⇒ U): Unit

def genericBuilder[B]: Builder[B, IndexedSeq[B]]

final def getClass(): Class[_]

def getNode: Node

def getWidth(): Int

def groupBy[K](f: (T) ⇒ K): Map[K, IndexedSeq[T]]

def grouped(size: Int): Iterator[IndexedSeq[T]]

def hasDefiniteSize: Boolean

val hashCode: Int

def hashCodeForCSE: Int

def head: T

def headOption: Option[T]

def indexOf[B >: T](elem: B, from: Int): Int

def indexOf[B >: T](elem: B): Int

def indexOfSlice[B >: T](that: GenSeq[B], from: Int): Int

def indexOfSlice[B >: T](that: GenSeq[B]): Int

def indexWhere(p: (T) ⇒ Bool): UInt

def indexWhere(p: (T) ⇒ Boolean, from: Int): Int

def indexWhere(p: (T) ⇒ Boolean): Int

def indices: Range

def infer: Boolean

Called while we're walking the graph inferring the width of nodes.

def init: IndexedSeq[T]

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

Init the node and calculate its width and add inputs to the node

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

Init the node and calculate its width and add inputs to the node

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

Init the node and calculate its width and add inputs to the node

def inits: Iterator[IndexedSeq[T]]

val inputs: ArrayBuffer[Node]

The inputs that this node depends on

def intersect[B >: T](that: GenSeq[B]): IndexedSeq[T]

def isDefinedAt(idx: Int): Boolean

def isEmpty: Boolean

lazy val isInObject: Boolean

lazy val isInVCD: Boolean

def isInline: Boolean

final def isInstanceOf[T0]: Boolean

def isIo: Boolean

def isIo_=(isIo: Boolean): Unit

final def isLit: Boolean

This function determines if a node is a literal, a fixed value

def isTopLevelIO: Boolean

final def isTraversableAgain: Boolean

var isTypeNode: Boolean

def isTypeOnly: Boolean

Chisel3 - type-only nodes (no data - no initialization or assignment) This is used to determine which nodes must be Wire() wrapped, and whether Wire() wrapping of the node is legal or not.

def isUsedByClockHi: Boolean

def isZeroWidth: Boolean

def iterator: Iterator[T]

def last: T

def lastIndexOf[B >: T](elem: B, end: Int): Int

def lastIndexOf[B >: T](elem: B): Int

def lastIndexOfSlice[B >: T](that: GenSeq[B], end: Int): Int

def lastIndexOfSlice[B >: T](that: GenSeq[B]): Int

def lastIndexWhere(p: (T) ⇒ Bool): UInt

def lastIndexWhere(p: (T) ⇒ Boolean, end: Int): Int

def lastIndexWhere(p: (T) ⇒ Boolean): Int

def lastOption: Option[T]

def length: Int

def lengthCompare(len: Int): Int

def lift: (Int) ⇒ Option[T]

val line: StackTraceElement

The trace information for chisel for this node

def litOf: Literal

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

def map[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

def max[B >: T](implicit cmp: Ordering[B]): T

def maxBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

def maybeFlatten: Seq[Node]

Deprecated: Do not use

def min[B >: T](implicit cmp: Ordering[B]): T

def minBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

def mkString: String

def mkString(sep: String): String

def mkString(start: String, sep: String, end: String): String

var modified: Boolean

val n: Int

var name: String

Name of the instance.

var named: Boolean

named is used to indicate that name was set explicitly and should not be overriden

final def ne(arg0: AnyRef): Boolean

def needWidth(): Int

def newBuilder: Builder[T, IndexedSeq[T]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def onlyIndexWhere(p: (T) ⇒ Bool): UInt

def orElse[A1 <: Int, B1 >: T](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

val orderedWrites: Boolean

def padTo[B >: T, That](len: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

def par: ParSeq[T]

def parCombiner: Combiner[T, ParSeq[T]]

def partition(p: (T) ⇒ Boolean): (IndexedSeq[T], IndexedSeq[T])

def patch[B >: T, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

def permutations: Iterator[IndexedSeq[T]]

def ports: ArrayBuffer[_ <: MemAccess]

def prefixLength(p: (T) ⇒ Boolean): Int

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 This method is purely used for debugging

def product[B >: T](implicit num: Numeric[B]): B

var prune: Boolean

def read(addr: UInt, enable: Bool): T

def read(addr: UInt): T

def readAccesses: ArrayBuffer[_ <: MemAccess]

val reads: ArrayBuffer[MemRead]

val readwrites: ArrayBuffer[MemReadWrite]

def reduce[A1 >: T](op: (A1, A1) ⇒ A1): A1

def reduceLeft[B >: T](op: (B, T) ⇒ B): B

def reduceLeftOption[B >: T](op: (B, T) ⇒ B): Option[B]

def reduceOption[A1 >: T](op: (A1, A1) ⇒ A1): Option[A1]

def reduceRight[B >: T](op: (T, B) ⇒ B): B

def reduceRightOption[B >: T](op: (T, B) ⇒ B): Option[B]

def replaceTree(newNode: Node): Unit

Replace the subtree starting from this node with the indicated replacement

def repr: IndexedSeq[T]

def reverse: IndexedSeq[T]

def reverseIterator: Iterator[T]

def reverseMap[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

def reversed: List[T]

def review(): Unit

Review a node for optimization possibilities if its children have been updated

def runWith[U](action: (T) ⇒ U): (Int) ⇒ Boolean

def sameElements[B >: T](that: GenIterable[B]): Boolean

def scan[B >: T, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[IndexedSeq[T], B, That]): That

def scanLeft[B, That](z: B)(op: (B, T) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

def scanRight[B, That](z: B)(op: (T, B) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

def segmentLength(p: (T) ⇒ Boolean, from: Int): Int

def seq: IndexedSeq[T]

val seqRead: Boolean

val seqreads: ArrayBuffer[MemSeqRead]

def setName(n: String): Unit

Set the name of this module to the string 'n'

def setWidth(w: Int): Unit

Force the bit width of a node

def size: Int

def slice(from: Int, until: Int): IndexedSeq[T]

def sliding(size: Int, step: Int): Iterator[IndexedSeq[T]]

def sliding(size: Int): Iterator[IndexedSeq[T]]

def sortBy[B](f: (T) ⇒ B)(implicit ord: Ordering[B]): IndexedSeq[T]

def sortWith(lt: (T, T) ⇒ Boolean): IndexedSeq[T]

def sorted[B >: T](implicit ord: Ordering[B]): IndexedSeq[T]

def span(p: (T) ⇒ Boolean): (IndexedSeq[T], IndexedSeq[T])

def splitAt(n: Int): (IndexedSeq[T], IndexedSeq[T])

def startsWith[B](that: GenSeq[B], offset: Int): Boolean

def startsWith[B](that: GenSeq[B]): Boolean

def stringPrefix: String

def sum[B >: T](implicit num: Numeric[B]): B

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

def tail: IndexedSeq[T]

def tails: Iterator[IndexedSeq[T]]

def take(n: Int): IndexedSeq[T]

def takeRight(n: Int): IndexedSeq[T]

def takeWhile(p: (T) ⇒ Boolean): IndexedSeq[T]

def thisCollection: IndexedSeq[T]

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]

def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]

def toBits(): UInt

def toBuffer[A1 >: T]: Buffer[A1]

def toCollection(repr: IndexedSeq[T]): IndexedSeq[T]

def toIndexedSeq: IndexedSeq[T]

def toIterable: Iterable[T]

def toIterator: Iterator[T]

def toList: List[T]

def toMap[T, U](implicit ev: <:<[T, (T, U)]): Map[T, U]

def toNode: Node

def toSeq: Seq[T]

def toSet[B >: T]: Set[B]

def toStream: Stream[T]

def toString(): String

def toTraversable: Traversable[T]

def toVector: Vector[T]

def transpose[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): IndexedSeq[IndexedSeq[B]]

def union[B >: T, That](that: GenSeq[B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

def unzip[A1, A2](implicit asPair: (T) ⇒ (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])

def unzip3[A1, A2, A3](implicit asTriple: (T) ⇒ (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])

def updated[B >: T, That](index: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

def usesInClockHi(i: Node): Boolean

def view(from: Int, until: Int): SeqView[T, IndexedSeq[T]]

def view: SeqView[T, IndexedSeq[T]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def withFilter(p: (T) ⇒ Boolean): FilterMonadic[T, IndexedSeq[T]]

def write(addr: UInt, data: T, mask: UInt): Unit

def write(addr: UInt, data: T, mask: Vec[Bool])(implicit evidence: <:<[T, Vec[_]]): Unit

def write(addr: UInt, dataIn: T): Unit

def writeAccesses: ArrayBuffer[MemWrite]

val writes: ArrayBuffer[MemWrite]

def zip[A1 >: T, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[IndexedSeq[T], (A1, B), That]): That

def zipAll[B, A1 >: T, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[IndexedSeq[T], (A1, B), That]): That

def zipWithIndex[A1 >: T, That](implicit bf: CanBuildFrom[IndexedSeq[T], (A1, Int), That]): That

def setMemName(name: String): Unit