class
HellaFlowQueue[T <: Data] extends Module
Instance Constructors
-
new
HellaFlowQueue(entries: Int)(data: ⇒ T)
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
<>(src: Module): Unit
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
def
addClock(clock: Clock): Unit
-
def
addDefaultReset: Unit
-
def
addModule[T <: Module](c: ⇒ T)(implicit p: Parameters): T
-
def
addModule[T <: Module](c: ⇒ T, f: PartialFunction[Any, Any]): T
-
def
addPin[T <: Data](pin: T, name: String): T
-
def
addResetPin(reset: Bool): Bool
-
def
apply(name: String): Data
-
final
def
asInstanceOf[T0]: T0
-
def
assert(cond: Bool, message: String): Unit
-
val
asserts: ArrayBuffer[Assert]
-
val
atLeastTwo: Bool
-
def
bfs(visit: (Node) ⇒ Unit): Unit
-
val
bindings: ArrayBuffer[Binding]
-
val
children: ArrayBuffer[Module]
-
var
clock: Clock
-
val
clocks: ArrayBuffer[Clock]
-
def
clone(): AnyRef
-
def
debug(x: Node): Unit
-
val
debugs: LinkedHashSet[Node]
-
var
defaultResetPin: Bool
-
var
defaultWidth: Int
-
val
deq_done: Bool
-
val
deq_ptr: UInt
-
def
dfs(visit: (Node) ⇒ Unit): Unit
-
val
do_deq: Bool
-
val
do_enq: Bool
-
val
do_flow: Bool
-
def
emitDec(b: Backend): String
-
val
empty: Bool
-
val
enq_ptr: UInt
-
val
entries: Int
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(that: Any): Boolean
-
def
finalize(): Unit
-
def
findBinding(m: Node): Option[Binding]
-
val
full: Bool
-
final
def
getClass(): Class[_]
-
def
getClassValNames(c: Class[_]): ArrayBuffer[String]
-
def
getPathName(separator: String): String
-
def
getPathName: String
-
def
getValNames: ArrayBuffer[String]
-
def
hasClock: Boolean
-
var
hasExplicitClock: Boolean
-
var
hasExplicitReset: Boolean
-
def
hasReset: Boolean
-
def
hasWhenCond: Boolean
-
val
hashCode: Int
-
val
io: QueueIO[T]
-
var
ioVal: Data
-
def
isInput(node: Node): Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
def
keepInputs(nodes: Seq[Node]): Seq[Node]
-
var
level: Int
-
def
markComponent(): Unit
-
val
maybe_full: Bool
-
var
moduleName: String
-
var
name: String
-
var
named: Boolean
-
val
names: HashMap[String, Node]
-
final
def
ne(arg0: AnyRef): Boolean
-
def
nextIndex: Int
-
var
nindex: Int
-
val
nodes: LinkedHashSet[Node]
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
ownIo(): Unit
-
lazy val
params: Parameters
-
var
parent: Module
-
var
pathParent: Module
-
def
printf(message: String, args: Node*): Unit
-
val
printfs: ArrayBuffer[Printf]
-
val
ptr_match: Bool
-
val
ram: Mem[T]
-
val
ram_addr: UInt
-
val
ram_out_valid: Bool
-
def
removeInputs(nodes: Seq[Node]): Seq[Node]
-
def
reset: Bool
-
def
reset_=(): Unit
-
def
reset_=(r: Bool): Unit
-
val
resets: HashMap[Bool, Bool]
-
def
stripComponent(s: String): String
-
val
switchKeys: Stack[Bits]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
var
traversal: Int
-
var
verilog_parameters: String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
whenCond: Bool
-
val
whenConds: Stack[Bool]
-
def
wires: Array[(String, Bits)]
Inherited from Module
Inherited from AnyRef
Inherited from Any
