Class/Object

Chisel

ROM

Related Docs: object ROM | package Chisel

Permalink

class ROM[T <: Data] extends Vec[T]

Class defining a ROM Use the ROM object rather than instantiating the ROM directly

Source
ROM.scala
Linear Supertypes
Vec[T], Cloneable, Cloneable, VecLike[T], IndexedSeq[T], IndexedSeqLike[T, IndexedSeq[T]], Seq[T], SeqLike[T, IndexedSeq[T]], GenSeq[T], GenSeqLike[T, IndexedSeq[T]], Iterable[T], IterableLike[T, IndexedSeq[T]], Equals, GenIterable[T], GenIterableLike[T, IndexedSeq[T]], Traversable[T], GenTraversable[T], GenericTraversableTemplate[T, IndexedSeq], TraversableLike[T, IndexedSeq[T]], GenTraversableLike[T, IndexedSeq[T]], Parallelizable[T, ParSeq[T]], TraversableOnce[T], GenTraversableOnce[T], FilterMonadic[T, IndexedSeq[T]], HasNewBuilder[T, IndexedSeq[T] @scala.annotation.unchecked.uncheckedVariance], PartialFunction[Int, T], (Int) ⇒ T, Aggregate, Data, Node, Nameable, AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ROM
  2. Vec
  3. Cloneable
  4. Cloneable
  5. VecLike
  6. IndexedSeq
  7. IndexedSeqLike
  8. Seq
  9. SeqLike
  10. GenSeq
  11. GenSeqLike
  12. Iterable
  13. IterableLike
  14. Equals
  15. GenIterable
  16. GenIterableLike
  17. Traversable
  18. GenTraversable
  19. GenericTraversableTemplate
  20. TraversableLike
  21. GenTraversableLike
  22. Parallelizable
  23. TraversableOnce
  24. GenTraversableOnce
  25. FilterMonadic
  26. HasNewBuilder
  27. PartialFunction
  28. Function1
  29. Aggregate
  30. Data
  31. Node
  32. Nameable
  33. AnyRef
  34. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ROM(elts: SortedMap[Int, T], lengthIn: Option[Int] = None)

    Permalink

    elts

    any number of data elements combined with Integer address

    lengthIn

    optionally force the size of the ROM

Type Members

  1. class Elements extends AbstractIterator[A] with BufferedIterator[A] with Serializable

    Permalink
    Attributes
    protected
    Definition Classes
    IndexedSeqLike
    Annotations
    @SerialVersionUID()
  2. type Self = IndexedSeq[T]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableLike
  3. class WithFilter extends FilterMonadic[A, Repr]

    Permalink
    Definition Classes
    TraversableLike

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. def ##[T <: Data](right: T): ROM.this.type

    Permalink

    Interface required by Cat is an operator to combine data nodes together

    Interface required by Cat is an operator to combine data nodes together

    Definition Classes
    Data
  3. def ##(b: Node): Node

    Permalink

    The cat operator to combine two values

    The cat operator to combine two values

    0x5 ## 0x3 => 0x53
    b

    Node to cat after

    returns

    a new node as the combination of both this node and b

    Definition Classes
    Node
  4. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  5. def ++[B >: T, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  6. def ++:[B >: T, That](that: Traversable[B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

    Permalink
    Definition Classes
    TraversableLike
  7. def ++:[B >: T, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

    Permalink
    Definition Classes
    TraversableLike
  8. def +:[B >: T, That](elem: B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  9. def /:[B](z: B)(op: (B, T) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  10. def :+[B >: T, That](elem: B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  11. def :=[T <: Data](that: Seq[T]): Unit

    Permalink
    Definition Classes
    Vec
  12. def :=(that: Data): Unit

    Permalink
    Definition Classes
    Data
  13. def :\[B](z: B)(op: (T, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  14. def <>(src: Seq[T]): Unit

    Permalink
    Definition Classes
    Vec
  15. def <>(src: Vec[T]): Unit

    Permalink
    Definition Classes
    Vec
  16. def <>(src: Node): Unit

    Permalink
    Definition Classes
    VecNode
  17. def =/=[T <: Data](right: T): Bool

    Permalink
    Definition Classes
    Data
  18. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  19. def ===[T <: Data](right: T): Bool

    Permalink
    Definition Classes
    Data
  20. def W0Wtransform(): Unit

    Permalink

    Eliminate any zero-width wires attached to this node

    Eliminate any zero-width wires attached to this node

    returns

    if the node was modified

    Definition Classes
    Node
  21. def ^^(src: Node): Unit

    Permalink
    Definition Classes
    Node
  22. val _id: Int

    Permalink

    The unique id of this node

    The unique id of this node

    Definition Classes
    Node
  23. def _isComplementOf(x: Node): Boolean

    Permalink
    Definition Classes
    Node
  24. def addString(b: StringBuilder): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce
  25. def addString(b: StringBuilder, sep: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce
  26. def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

    Permalink
    Definition Classes
    TraversableOnce
  27. def aggregate[B](z: ⇒ B)(seqop: (B, T) ⇒ B, combop: (B, B) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  28. def andThen[C](k: (T) ⇒ C): PartialFunction[Int, C]

    Permalink
    Definition Classes
    PartialFunction → Function1
  29. def apply(ind: UInt): T

    Permalink
    Definition Classes
    VecVecLike
  30. def apply(idx: Int): T

    Permalink
    Definition Classes
    Vec → SeqLike → GenSeqLike → Function1
  31. def apply(name: String): Data

    Permalink
    Definition Classes
    Data
  32. def applyOrElse[A1 <: Int, B1 >: T](x: A1, default: (A1) ⇒ B1): B1

    Permalink
    Definition Classes
    PartialFunction
  33. def asDirectionless(): ROM.this.type

    Permalink

    set this node as directionless

    set this node as directionless

    Definition Classes
    VecData
  34. def asInput(): ROM.this.type

    Permalink

    Return this object as an INPUT

    Return this object as an INPUT

    Definition Classes
    VecData
  35. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  36. def asOutput(): ROM.this.type

    Permalink

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

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

    returns

    this instance with its exact type.

    Definition Classes
    VecData
  37. final def asSInt(): SInt

    Permalink
    Definition Classes
    Node
  38. final def asUInt(): UInt

    Permalink
    Definition Classes
    Node
  39. def assign(src: Node): Unit

    Permalink
    Definition Classes
    Node
  40. def canCSE: Boolean

    Permalink
    Definition Classes
    Node
  41. def canEqual(that: Any): Boolean

    Permalink
    Definition Classes
    IterableLike → Equals
  42. lazy val chiselName: String

    Permalink
    Definition Classes
    Node
  43. var clock: Option[Clock]

    Permalink

    The clock for this node

    The clock for this node

    Definition Classes
    Node
  44. def clone(): ROM.this.type

    Permalink
    Definition Classes
    Data → AnyRef
  45. def cloneType(): ROM.this.type

    Permalink
    Definition Classes
    VecData
  46. def collect[B, That](pf: PartialFunction[T, B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  47. def collectFirst[B](pf: PartialFunction[T, B]): Option[B]

    Permalink
    Definition Classes
    TraversableOnce
  48. def colonEquals(that: Bits): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    VecData
  49. def colonEquals[T <: Data](that: Seq[T]): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    VecData
  50. def colonEquals(that: Bundle): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Data
  51. def combinations(n: Int): Iterator[IndexedSeq[T]]

    Permalink
    Definition Classes
    SeqLike
  52. var comp: Option[proc]

    Permalink
    Definition Classes
    Data
  53. def companion: GenericCompanion[IndexedSeq]

    Permalink
    Definition Classes
    IndexedSeq → Seq → GenSeq → Iterable → GenIterable → Traversable → GenTraversable → GenericTraversableTemplate
  54. def componentOf: Module

    Permalink

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

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

    returns

    The module that this node is a part of

    Definition Classes
    Node
  55. def compose[A](g: (A) ⇒ Int): (A) ⇒ T

    Permalink
    Definition Classes
    Function1
    Annotations
    @unspecialized()
  56. val consumers: LinkedHashSet[Node]

    Permalink

    nodes that consume one of my outputs

    nodes that consume one of my outputs

    Definition Classes
    Node
  57. def contains(x: T)(implicit evidence: <:<[T, Bits]): Bool

    Permalink
    Definition Classes
    VecLike
  58. def contains[A1 >: T](elem: A1): Boolean

    Permalink
    Definition Classes
    SeqLike
  59. def containsSlice[B](that: GenSeq[B]): Boolean

    Permalink
    Definition Classes
    SeqLike
  60. def copyToArray[B >: T](xs: Array[B], start: Int, len: Int): Unit

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  61. def copyToArray[B >: T](xs: Array[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  62. def copyToArray[B >: T](xs: Array[B], start: Int): Unit

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  63. def copyToBuffer[B >: T](dest: Buffer[B]): Unit

    Permalink
    Definition Classes
    TraversableOnce
  64. def corresponds[B](that: GenSeq[B])(p: (T, B) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  65. def count(p: (T) ⇒ Bool): UInt

    Permalink
    Definition Classes
    VecLike
  66. def count(p: (T) ⇒ Boolean): Int

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  67. def dblLitValue: Double

    Permalink

    Convert the node literal to a Double

    Convert the node literal to a Double

    Definition Classes
    Node
  68. def diff[B >: T](that: GenSeq[B]): IndexedSeq[T]

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  69. def distinct: IndexedSeq[T]

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  70. var driveRand: Boolean

    Permalink
    Definition Classes
    Node
  71. def drop(n: Int): IndexedSeq[T]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  72. def dropRight(n: Int): IndexedSeq[T]

    Permalink
    Definition Classes
    IterableLike
  73. def dropWhile(p: (T) ⇒ Boolean): IndexedSeq[T]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  74. def endsWith[B](that: GenSeq[B]): Boolean

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  75. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  76. def equals(that: Any): Boolean

    Permalink

    Compare two nodes

    Compare two nodes

    that

    the node to compare with

    Definition Classes
    Vec → GenSeqLike → Equals → Node → AnyRef → Any
  77. def equalsForCSE(x: Node): Boolean

    Permalink
    Definition Classes
    Node
  78. def exists(p: (T) ⇒ Bool): Bool

    Permalink
    Definition Classes
    VecLike
  79. def exists(p: (T) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  80. def filter(p: (T) ⇒ Boolean): IndexedSeq[T]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  81. def filterNot(p: (T) ⇒ Boolean): IndexedSeq[T]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  82. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  83. def find(p: (T) ⇒ Boolean): Option[T]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  84. def flatMap[B, That](f: (T) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  85. def flatten: Array[(String, Bits)]

    Permalink
    Definition Classes
    VecData
  86. def flatten[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): IndexedSeq[B]

    Permalink
    Definition Classes
    GenericTraversableTemplate
  87. def flip(): ROM.this.type

    Permalink

    Change INPUTs to OUTPUTs and visa versa

    Change INPUTs to OUTPUTs and visa versa

    Definition Classes
    VecData
  88. def floLitValue: Float

    Permalink

    Convert the node literal to a Float

    Convert the node literal to a Float

    Definition Classes
    Node
  89. def fold[A1 >: T](z: A1)(op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  90. def foldLeft[B](z: B)(op: (B, T) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  91. def foldRight[B](z: B)(op: (T, B) ⇒ B): B

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  92. def forall(p: (T) ⇒ Bool): Bool

    Permalink
    Definition Classes
    VecLike
  93. def forall(p: (T) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  94. def foreach[U](f: (T) ⇒ U): Unit

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike → TraversableOnce → GenTraversableOnce → FilterMonadic
  95. def fromBits(b: Bits): ROM.this.type

    Permalink
    Definition Classes
    Data
  96. def fromNode(n: Node): ROM.this.type

    Permalink

    Factory method to create and assign a leaf-type instance out of a subclass of *Node* instance which we have lost the concrete 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.

    Definition Classes
    Data
  97. val gen: (Int) ⇒ T

    Permalink
    Definition Classes
    Vec
  98. def genericBuilder[B]: Builder[B, IndexedSeq[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate
  99. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  100. def getNode: Node

    Permalink

    returns

    The root node input

    Definition Classes
    Node
  101. def getWidth(): Int

    Permalink

    returns

    the width or number of bits used by this node

    Definition Classes
    VecAggregateNode
    Exceptions thrown

    ChiselException if the width of the node is unknown

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

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  103. def grouped(size: Int): Iterator[IndexedSeq[T]]

    Permalink
    Definition Classes
    IterableLike
  104. def hasDefiniteSize: Boolean

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  105. val hashCode: Int

    Permalink

    returns

    the unique hashCode for this node

    Definition Classes
    Vec → IndexedSeqLike → GenSeqLike → Node → AnyRef → Any
  106. def hashCodeForCSE: Int

    Permalink
    Definition Classes
    Node
  107. def head: T

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  108. def headOption: Option[T]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  109. def illegalAssignment(that: Any): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    Data
  110. def indexOf[B >: T](elem: B, from: Int): Int

    Permalink
    Definition Classes
    GenSeqLike
  111. def indexOf[B >: T](elem: B): Int

    Permalink
    Definition Classes
    GenSeqLike
  112. def indexOfSlice[B >: T](that: GenSeq[B], from: Int): Int

    Permalink
    Definition Classes
    SeqLike
  113. def indexOfSlice[B >: T](that: GenSeq[B]): Int

    Permalink
    Definition Classes
    SeqLike
  114. def indexWhere(p: (T) ⇒ Bool): UInt

    Permalink
    Definition Classes
    VecLike
  115. def indexWhere(p: (T) ⇒ Boolean, from: Int): Int

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  116. def indexWhere(p: (T) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GenSeqLike
  117. def indices: Range

    Permalink
    Definition Classes
    SeqLike
  118. def infer: Boolean

    Permalink

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

    Called while we're walking the graph inferring the width of nodes. We return true if we should continue to walk the graph, either because there's a node whose width we don't know, or because we updated a node's width.

    Definition Classes
    Node
  119. def init: IndexedSeq[T]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  120. def init(n: String, w: Int, ins: Node*): Node

    Permalink

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

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

    n

    name of node

    w

    the bit width of the node

    ins

    Nodes that are inputs to this node

    Definition Classes
    Node
  121. def init(n: String, widthFunc: (⇒ Node) ⇒ Width, ins: Node*): Node

    Permalink

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

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

    n

    name of node

    widthFunc

    the function to use to calculate the width of the node

    ins

    Nodes that are inputs to this node

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

    Permalink

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

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

    n

    name of node

    widthfunc

    the function to use to calculate the width of the node

    ins

    Nodes that are inputs to this node

    Definition Classes
    Node
  123. def inits: Iterator[IndexedSeq[T]]

    Permalink
    Definition Classes
    TraversableLike
  124. val inputs: ArrayBuffer[Node]

    Permalink

    The inputs that this node depends on

    The inputs that this node depends on

    Definition Classes
    Node
  125. def intersect[B >: T](that: GenSeq[B]): IndexedSeq[T]

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  126. def isDefinedAt(idx: Int): Boolean

    Permalink
    Definition Classes
    GenSeqLike
  127. def isDirectionless: Boolean

    Permalink

    check if this node is neither INPUT or OUTPUT

    check if this node is neither INPUT or OUTPUT

    Definition Classes
    Data
  128. def isEmpty: Boolean

    Permalink
    Definition Classes
    SeqLike → IterableLike → TraversableLike → TraversableOnce → GenTraversableOnce
  129. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  130. def isIo: Boolean

    Permalink

    returns

    this node is an I/O Node for a module

    Definition Classes
    Node
  131. def isIo_=(isIo: Boolean): Unit

    Permalink
    Attributes
    protected[Chisel]
    Definition Classes
    Node
  132. final def isLit: Boolean

    Permalink

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

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

    Definition Classes
    Node
  133. def isTopLevelIO: Boolean

    Permalink

    returns

    is this node I/O for the top level module

    Definition Classes
    Node
  134. final def isTraversableAgain: Boolean

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → GenTraversableOnce
  135. var isTypeNode: Boolean

    Permalink
    Definition Classes
    Node
  136. def isTypeOnly: Boolean

    Permalink

    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.

    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.

    Definition Classes
    VecDataNode
  137. def isUsedByClockHi: Boolean

    Permalink

    returns

    this node is a Register

    Definition Classes
    Node
  138. def isWired: Boolean

    Permalink
    Definition Classes
    AggregateData
  139. def isZeroWidth: Boolean

    Permalink

    returns

    this node has zero-width

    Definition Classes
    Node
  140. def iterator: Iterator[T]

    Permalink
    Definition Classes
    IndexedSeqLike → IterableLike → GenIterableLike
  141. def last: T

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  142. def lastIndexOf[B >: T](elem: B, end: Int): Int

    Permalink
    Definition Classes
    GenSeqLike
  143. def lastIndexOf[B >: T](elem: B): Int

    Permalink
    Definition Classes
    GenSeqLike
  144. def lastIndexOfSlice[B >: T](that: GenSeq[B], end: Int): Int

    Permalink
    Definition Classes
    SeqLike
  145. def lastIndexOfSlice[B >: T](that: GenSeq[B]): Int

    Permalink
    Definition Classes
    SeqLike
  146. def lastIndexWhere(p: (T) ⇒ Bool): UInt

    Permalink
    Definition Classes
    VecLike
  147. def lastIndexWhere(p: (T) ⇒ Boolean, end: Int): Int

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  148. def lastIndexWhere(p: (T) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GenSeqLike
  149. def lastOption: Option[T]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  150. val length: Int

    Permalink
    Definition Classes
    ROMVec → SeqLike → GenSeqLike
  151. def lengthCompare(len: Int): Int

    Permalink
    Definition Classes
    SeqLike
  152. def lift: (Int) ⇒ Option[T]

    Permalink
    Definition Classes
    PartialFunction
  153. val line: StackTraceElement

    Permalink

    The trace information for chisel for this node

    The trace information for chisel for this node

    Definition Classes
    Node
  154. def litOf: Literal

    Permalink

    returns

    the literal value of a node

    Definition Classes
    Node
    Exceptions thrown

    ChiselException if there is no literal value available

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

    Permalink

    returns

    the literal value of the node as a BigInt

    Bool(true).litValue() => BigInt(1)
    Definition Classes
    Node
  156. def map[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike → FilterMonadic
  157. def max[B >: T](implicit cmp: Ordering[B]): T

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  158. def maxBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  159. def maybeFlatten: Seq[Node]

    Permalink

    Deprecated: Do not use

    Deprecated: Do not use

    Definition Classes
    Node
  160. def min[B >: T](implicit cmp: Ordering[B]): T

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  161. def minBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  162. def mkString: String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  163. def mkString(sep: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  164. def mkString(start: String, sep: String, end: String): String

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  165. var modified: Boolean

    Permalink
    Definition Classes
    Node
  166. var name: String

    Permalink

    Name of the instance.

    Name of the instance.

    Definition Classes
    Nameable
  167. def nameIt(path: String, isNamingIo: Boolean): Unit

    Permalink

    name this node

    name this node

    Definition Classes
    VecDataNode
    Note

    use setName in Node rather than this directly

  168. var named: Boolean

    Permalink

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

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

    Definition Classes
    Nameable
  169. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  170. def needWidth(): Int

    Permalink

    returns

    the bitWidth of the node

    Definition Classes
    Node
    Exceptions thrown

    ChiselException if the width is not yet defined

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

    Permalink
    Attributes
    protected[this]
    Definition Classes
    GenericTraversableTemplate → HasNewBuilder
  172. def nonEmpty: Boolean

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  173. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  174. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  175. def onlyIndexWhere(p: (T) ⇒ Bool): UInt

    Permalink
    Definition Classes
    VecLike
  176. def orElse[A1 <: Int, B1 >: T](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]

    Permalink
    Definition Classes
    PartialFunction
  177. def padTo[B >: T, That](len: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  178. def par: ParSeq[T]

    Permalink
    Definition Classes
    Parallelizable
  179. def parCombiner: Combiner[T, ParSeq[T]]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    SeqLike → TraversableLike → Parallelizable
  180. def params: Parameters

    Permalink
    Definition Classes
    Data
  181. def partition(p: (T) ⇒ Boolean): (IndexedSeq[T], IndexedSeq[T])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  182. def patch[B >: T, That](from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  183. def permutations: Iterator[IndexedSeq[T]]

    Permalink
    Definition Classes
    SeqLike
  184. def prefixLength(p: (T) ⇒ Boolean): Int

    Permalink
    Definition Classes
    GenSeqLike
  185. def printTree(writer: PrintStream, depth: Int = 4, indent: String = ""): Unit

    Permalink

    Prints all members of a node and recursively its inputs up to a certain depth level This method is purely used for debugging

    Prints all members of a node and recursively its inputs up to a certain depth level This method is purely used for debugging

    Definition Classes
    Node
  186. def product[B >: T](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  187. var prune: Boolean

    Permalink
    Definition Classes
    Node
  188. def read(addr: UInt): T

    Permalink

    Read data from the ROM at an address

    Read data from the ROM at an address

    Definition Classes
    ROMVecVecLike
  189. val readPorts: HashMap[UInt, T]

    Permalink
    Definition Classes
    Vec
  190. def reduce[A1 >: T](op: (A1, A1) ⇒ A1): A1

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  191. def reduceLeft[B >: T](op: (B, T) ⇒ B): B

    Permalink
    Definition Classes
    TraversableOnce
  192. def reduceLeftOption[B >: T](op: (B, T) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  193. def reduceOption[A1 >: T](op: (A1, A1) ⇒ A1): Option[A1]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  194. def reduceRight[B >: T](op: (T, B) ⇒ B): B

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  195. def reduceRightOption[B >: T](op: (T, B) ⇒ B): Option[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  196. def removeTypeNodes(): Unit

    Permalink
    Definition Classes
    VecNode
  197. def replaceTree(newNode: Node): Unit

    Permalink

    Replace the subtree starting from this node with the indicated replacement

    Replace the subtree starting from this node with the indicated replacement

    newNode

    The node to start tree from

    Definition Classes
    Node
  198. def repr: IndexedSeq[T]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  199. def reverse: IndexedSeq[T]

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  200. def reverseIterator: Iterator[T]

    Permalink
    Definition Classes
    SeqLike
  201. def reverseMap[B, That](f: (T) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  202. def reversed: List[T]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    TraversableOnce
  203. def review(): Unit

    Permalink

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

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

    Definition Classes
    Node
  204. def runWith[U](action: (T) ⇒ U): (Int) ⇒ Boolean

    Permalink
    Definition Classes
    PartialFunction
  205. def sameElements[B >: T](that: GenIterable[B]): Boolean

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  206. def scan[B >: T, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[IndexedSeq[T], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  207. def scanLeft[B, That](z: B)(op: (B, T) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  208. def scanRight[B, That](z: B)(op: (T, B) ⇒ B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.

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

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  210. val self: Vector[T]

    Permalink
    Definition Classes
    ROMVec
  211. def seq: IndexedSeq[T]

    Permalink
    Definition Classes
    IndexedSeq → IndexedSeqLike → Seq → GenSeq → GenSeqLike → Iterable → GenIterable → Traversable → GenTraversable → Parallelizable → TraversableOnce → GenTraversableOnce
  212. def setIsTypeNode: Unit

    Permalink

    make this node a type node

    make this node a type node

    Definition Classes
    VecData
  213. def setIsWired(value: Boolean): Unit

    Permalink
    Definition Classes
    AggregateData
  214. def setName(n: String): Unit

    Permalink

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

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

    Definition Classes
    Nameable
    Example:
    1. my.io.node.setName("MY_IO_NODE")
  215. def setWidth(w: Int): Unit

    Permalink

    Force the bit width of a node

    Force the bit width of a node

    w

    the bit width to force

    Definition Classes
    Node
  216. def size: Int

    Permalink
    Definition Classes
    SeqLike → GenTraversableLike → TraversableOnce → GenTraversableOnce
  217. def slice(from: Int, until: Int): IndexedSeq[T]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  218. def sliding(size: Int, step: Int): Iterator[IndexedSeq[T]]

    Permalink
    Definition Classes
    IterableLike
  219. def sliding(size: Int): Iterator[IndexedSeq[T]]

    Permalink
    Definition Classes
    IterableLike
  220. def sortBy[B](f: (T) ⇒ B)(implicit ord: Ordering[B]): IndexedSeq[T]

    Permalink
    Definition Classes
    SeqLike
  221. def sortWith(lt: (T, T) ⇒ Boolean): IndexedSeq[T]

    Permalink
    Definition Classes
    SeqLike
  222. def sorted[B >: T](implicit ord: Ordering[B]): IndexedSeq[T]

    Permalink
    Definition Classes
    SeqLike
  223. lazy val sortedElements: Array[ArrayBuffer[Data]]

    Permalink
    Definition Classes
    Vec
  224. def span(p: (T) ⇒ Boolean): (IndexedSeq[T], IndexedSeq[T])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  225. def splitAt(n: Int): (IndexedSeq[T], IndexedSeq[T])

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  226. def startsWith[B](that: GenSeq[B], offset: Int): Boolean

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  227. def startsWith[B](that: GenSeq[B]): Boolean

    Permalink
    Definition Classes
    GenSeqLike
  228. def stringPrefix: String

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  229. def sum[B >: T](implicit num: Numeric[B]): B

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  230. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  231. def tail: IndexedSeq[T]

    Permalink
    Definition Classes
    TraversableLike → GenTraversableLike
  232. def tails: Iterator[IndexedSeq[T]]

    Permalink
    Definition Classes
    TraversableLike
  233. def take(n: Int): IndexedSeq[T]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  234. def takeRight(n: Int): IndexedSeq[T]

    Permalink
    Definition Classes
    IterableLike
  235. def takeWhile(p: (T) ⇒ Boolean): IndexedSeq[T]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableLike
  236. def thisCollection: IndexedSeq[T]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  237. def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
  238. def toArray[B >: T](implicit arg0: ClassTag[B]): Array[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  239. def toBits(): UInt

    Permalink

    returns

    This node as a UInt

    Definition Classes
    Node
  240. def toBool(): Bool

    Permalink

    Try to convert this data to a Bool

    Try to convert this data to a Bool

    Definition Classes
    Data
    Exceptions thrown

    ChiselException if the width is not 1

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

    Permalink
    Definition Classes
    IndexedSeqLike → TraversableOnce → GenTraversableOnce
  242. def toCollection(repr: IndexedSeq[T]): IndexedSeq[T]

    Permalink
    Attributes
    protected[this]
    Definition Classes
    IndexedSeqLike → SeqLike → IterableLike → TraversableLike
  243. def toIndexedSeq: IndexedSeq[T]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  244. def toIterable: Iterable[T]

    Permalink
    Definition Classes
    IterableLike → TraversableOnce → GenTraversableOnce
  245. def toIterator: Iterator[T]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  246. def toList: List[T]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  247. def toMap[T, U](implicit ev: <:<[T, (T, U)]): Map[T, U]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  248. lazy val toNode: Node

    Permalink

    returns

    This node

    Definition Classes
    DataNode
  249. def toSInt(): SInt

    Permalink
    Definition Classes
    Node
  250. def toSeq: Seq[T]

    Permalink
    Definition Classes
    SeqLike → GenSeqLike → TraversableOnce → GenTraversableOnce
  251. def toSet[B >: T]: Set[B]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  252. def toStream: Stream[T]

    Permalink
    Definition Classes
    IterableLike → TraversableLike → GenTraversableOnce
  253. def toString(): String

    Permalink
    Definition Classes
    SeqLike → TraversableLike → Any
  254. def toTraversable: Traversable[T]

    Permalink
    Definition Classes
    TraversableLike → TraversableOnce → GenTraversableOnce
    Annotations
    @deprecatedOverriding( ... , "2.11.0" )
  255. def toUInt(): UInt

    Permalink
    Definition Classes
    Node
  256. def toVector: Vector[T]

    Permalink
    Definition Classes
    TraversableOnce → GenTraversableOnce
  257. def transpose[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): IndexedSeq[IndexedSeq[B]]

    Permalink
    Definition Classes
    GenericTraversableTemplate
    Annotations
    @migration
    Migration

    (Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.

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

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  259. def unzip[A1, A2](implicit asPair: (T) ⇒ (A1, A2)): (IndexedSeq[A1], IndexedSeq[A2])

    Permalink
    Definition Classes
    GenericTraversableTemplate
  260. def unzip3[A1, A2, A3](implicit asTriple: (T) ⇒ (A1, A2, A3)): (IndexedSeq[A1], IndexedSeq[A2], IndexedSeq[A3])

    Permalink
    Definition Classes
    GenericTraversableTemplate
  261. def updated[B >: T, That](index: Int, elem: B)(implicit bf: CanBuildFrom[IndexedSeq[T], B, That]): That

    Permalink
    Definition Classes
    SeqLike → GenSeqLike
  262. def usesInClockHi(i: Node): Boolean

    Permalink
    Definition Classes
    Node
  263. def view(from: Int, until: Int): SeqView[T, IndexedSeq[T]]

    Permalink
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  264. def view: SeqView[T, IndexedSeq[T]]

    Permalink
    Definition Classes
    SeqLike → IterableLike → TraversableLike
  265. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  268. def withFilter(p: (T) ⇒ Boolean): FilterMonadic[T, IndexedSeq[T]]

    Permalink
    Definition Classes
    TraversableLike → FilterMonadic
  269. def write(addr: UInt, data: T): Unit

    Permalink

    Illegal, cannot write to Read only memory

    Illegal, cannot write to Read only memory

    Definition Classes
    ROMVecVecLike
  270. def zip[A1 >: T, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[IndexedSeq[T], (A1, B), That]): That

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  271. def zipAll[B, A1 >: T, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[IndexedSeq[T], (A1, B), That]): That

    Permalink
    Definition Classes
    IterableLike → GenIterableLike
  272. def zipWithIndex[A1 >: T, That](implicit bf: CanBuildFrom[IndexedSeq[T], (A1, Int), That]): That

    Permalink
    Definition Classes
    IterableLike → GenIterableLike

Inherited from Vec[T]

Inherited from Cloneable

Inherited from Cloneable

Inherited from VecLike[T]

Inherited from IndexedSeq[T]

Inherited from IndexedSeqLike[T, IndexedSeq[T]]

Inherited from Seq[T]

Inherited from SeqLike[T, IndexedSeq[T]]

Inherited from GenSeq[T]

Inherited from GenSeqLike[T, IndexedSeq[T]]

Inherited from Iterable[T]

Inherited from IterableLike[T, IndexedSeq[T]]

Inherited from Equals

Inherited from GenIterable[T]

Inherited from GenIterableLike[T, IndexedSeq[T]]

Inherited from Traversable[T]

Inherited from GenTraversable[T]

Inherited from GenericTraversableTemplate[T, IndexedSeq]

Inherited from TraversableLike[T, IndexedSeq[T]]

Inherited from GenTraversableLike[T, IndexedSeq[T]]

Inherited from Parallelizable[T, ParSeq[T]]

Inherited from TraversableOnce[T]

Inherited from GenTraversableOnce[T]

Inherited from FilterMonadic[T, IndexedSeq[T]]

Inherited from HasNewBuilder[T, IndexedSeq[T] @scala.annotation.unchecked.uncheckedVariance]

Inherited from PartialFunction[Int, T]

Inherited from (Int) ⇒ T

Inherited from Aggregate

Inherited from Data

Inherited from Node

Inherited from Nameable

Inherited from AnyRef

Inherited from Any

Ungrouped