Instance Constructors
-
new
EnqIO(gen: T)
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
def
##[T <: Data](right: T): EnqIO.this.type
-
-
final
def
##(): Int
-
-
def
+=[T <: Data](other: T): Unit
-
def
-=[T <: Data](other: T): Unit
-
def
:=(src: Bundle): Unit
-
def
:=[T <: Data](src: 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
-
val
_id: Int
-
def
addConsumers(): Unit
-
def
apply(name: String): Data
-
def
asDirectionless(): EnqIO.this.type
-
def
asInput(): EnqIO.this.type
-
final
def
asInstanceOf[T0]: T0
-
def
asOutput(): EnqIO.this.type
-
def
assign(src: Node): Unit
-
def
bitSet(off: UInt, dat: UInt): UInt
-
val
bits: T
-
var
bundledElm: Node
-
def
canCSE: Boolean
-
lazy val
chiselName: String
-
var
clock: Clock
-
def
clone(): EnqIO.this.type
-
var
cntrIdx: Int
-
var
comp: proc
-
var
component: Module
-
def
componentOf: Module
-
val
consumers: ArrayBuffer[Node]
-
def
contains(name: String): Boolean
-
var
counter: Bits
-
def
dblLitValue: Double
-
var
depth: Int
-
var
dir: String
-
var
driveRand: Boolean
-
def
elements: ArrayBuffer[(String, Data)]
-
lazy val
emitIndex: Int
-
def
enq(dat: T): T
-
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
fire(dummy: Int = 0): Bool
-
def
flatten: Array[(String, Bits)]
-
var
flattened: Boolean
-
def
flip(): EnqIO.this.type
-
def
floLitValue: Float
-
def
forceMatchingWidths: Unit
-
def
fromBits(b: Bits): EnqIO.this.type
-
def
fromNode(n: Node): EnqIO.this.type
-
var
genError: Boolean
-
final
def
getClass(): Class[_]
-
-
def
getNode(): Node
-
def
getWidth(): Int
-
def
hashCode(): Int
-
def
hashCodeForCSE: 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: Iterable[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
-
var
isPrintArg: Boolean
-
def
isRamWriteInput(i: Node): Boolean
-
def
isReg: Boolean
-
var
isScanArg: Boolean
-
var
isTypeNode: Boolean
-
def
isUsedByRam: Boolean
-
var
isWidthWalked: Boolean
-
val
line: StackTraceElement
-
-
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
-
-
def
nameIt(path: String, isNamingIo: Boolean): Unit
-
var
named: Boolean
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
var
pName: String
-
def
printTree(writer: PrintStream, depth: Int = 4, indent: String = ""): Unit
-
var
prune: Boolean
-
val
ready: Bool
-
def
removeTypeNodes(): Unit
-
var
sccIndex: Int
-
var
sccLowlink: Int
-
def
setIsTypeNode(): Unit
-
def
setName(n: String): Unit
-
def
setPseudoName(path: String, isNamingIo: Boolean): Unit
-
def
setWidth(w: Int): Unit
-
var
shadow: Bits
-
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]): Unit
-
def
traceableNodes: Array[Node]
-
val
valid: Bool
-
def
view(elts: ArrayBuffer[(String, Data)]): Bundle
-
var
view: Seq[String]
-
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
Inherited from AnyRef
Inherited from Any
