Queue

Instance Constructors

new Queue(gen: T, entries: Int, pipe: Boolean = false, flow: Boolean = false)(implicit compileOptions: CompileOptions)

gen
The type of data to queue
entries
The max number of entries in the queue
pipe
True if a single entry queue can run at full throughput (like a pipeline). The ready signals are combinationally coupled.
flow
True if the inputs can be consumed on the same cycle (the inputs "flow" through the queue immediately). The valid signals are coupled.

Value Members

final def !=(arg0: Any): Boolean

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

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def IO[T <: Data](iodef: T): T

Attributes
protected
Definition Classes
BaseModule
def _bindIoInPlace(iodef: Data): Unit

Attributes
protected
Definition Classes
BaseModule
var _closed: Boolean

Attributes
protected
Definition Classes
BaseModule
def _compatAutoWrapPorts(): Unit

Definition Classes
BaseModule
def _compatIoPortBound(): Boolean

Attributes
protected
Definition Classes
LegacyModule
final def asInstanceOf[T0]: T0

Definition Classes
Any
def circuitName: String

Attributes
protected
Definition Classes
HasId
final val clock: Clock

Definition Classes
MultiIOModule
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
val compileOptions: CompileOptions

Definition Classes
RawModule
def computeName(defaultPrefix: Option[String], defaultSeed: Option[String]): Option[String]

Definition Classes
HasId
val deq_ptr: Counter
def desiredName: String

Definition Classes
BaseModule
val do_deq: Bool
val do_enq: Bool
val empty: Bool
val enq_ptr: Counter
val entries: Int

The max number of entries in the queue
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
HasId → AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
val flow: Boolean

True if the inputs can be consumed on the same cycle (the inputs "flow" through the queue immediately).
True if the inputs can be consumed on the same cycle (the inputs "flow" through the queue immediately). The valid signals are coupled.
val full: Bool
val gen: T

The type of data to queue
val genType: T
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def getCommands: Seq[Command]

Attributes
protected
Definition Classes
RawModule
def getIds: Seq[HasId]

Attributes
protected
Definition Classes
BaseModule
def getModulePorts: Seq[Data]

Attributes
protected[chisel3]
Definition Classes
BaseModule
lazy val getPorts: Seq[Port]

Definition Classes
RawModule
def hasSeed: Boolean

Definition Classes
HasId
def hashCode(): Int

Definition Classes
HasId → AnyRef → Any
def instanceName: String

Definition Classes
BaseModule → HasId → InstanceId
val io: QueueIO[T]

Definition Classes
Queue → LegacyModule
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
val maybe_full: Bool
final lazy val name: String

Definition Classes
BaseModule
def nameIds(rootClass: Class[_]): HashMap[HasId, String]

Attributes
protected
Definition Classes
BaseModule
val namingContext$macro$10: NamingContextInterface
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
var override_clock: Option[Clock]

Attributes
protected
Definition Classes
LegacyModule
var override_reset: Option[Bool]

Attributes
protected
Definition Classes
LegacyModule
def parentModName: String

Definition Classes
HasId → InstanceId
def parentPathName: String

Definition Classes
HasId → InstanceId
def pathName: String

Definition Classes
HasId → InstanceId
val pipe: Boolean

True if a single entry queue can run at full throughput (like a pipeline).
True if a single entry queue can run at full throughput (like a pipeline). The ready signals are combinationally coupled.
def portsContains(elem: Data): Boolean

Attributes
protected
Definition Classes
BaseModule
def portsSize: Int

Attributes
protected
Definition Classes
BaseModule
val ptr_diff: UInt
val ptr_match: Bool
val ram: Mem[T]
final val reset: Reset

Definition Classes
MultiIOModule
def suggestName(seed: ⇒ String): Queue.this.type

Definition Classes
HasId
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
final def toAbsoluteTarget: IsModule

Definition Classes
BaseModule → InstanceId
final def toNamed: ModuleName

Definition Classes
BaseModule → InstanceId
def toString(): String

Definition Classes
AnyRef → Any
final def toTarget: ModuleTarget

Definition Classes
BaseModule → InstanceId
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( ... )

Related Docs: object Queue | package util

class Queue[T <: Data] extends Module

Instance Constructors

new Queue(gen: T, entries: Int, pipe: Boolean = false, flow: Boolean = false)(implicit compileOptions: CompileOptions)

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def IO[T <: Data](iodef: T): T

def _bindIoInPlace(iodef: Data): Unit

var _closed: Boolean

def _compatAutoWrapPorts(): Unit

def _compatIoPortBound(): Boolean

final def asInstanceOf[T0]: T0

def circuitName: String

final val clock: Clock

def clone(): AnyRef

val compileOptions: CompileOptions

def computeName(defaultPrefix: Option[String], defaultSeed: Option[String]): Option[String]

val deq_ptr: Counter

def desiredName: String

val do_deq: Bool

val do_enq: Bool

val empty: Bool

val enq_ptr: Counter

val entries: Int

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def finalize(): Unit

val flow: Boolean

val full: Bool

val gen: T

val genType: T

final def getClass(): Class[_]

def getCommands: Seq[Command]

def getIds: Seq[HasId]

def getModulePorts: Seq[Data]

lazy val getPorts: Seq[Port]

def hasSeed: Boolean

def hashCode(): Int

def instanceName: String

val io: QueueIO[T]

final def isInstanceOf[T0]: Boolean

val maybe_full: Bool

final lazy val name: String

def nameIds(rootClass: Class[_]): HashMap[HasId, String]

val namingContext$macro$10: NamingContextInterface

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

var override_clock: Option[Clock]

var override_reset: Option[Bool]

def parentModName: String

def parentPathName: String

def pathName: String

val pipe: Boolean

def portsContains(elem: Data): Boolean

def portsSize: Int

val ptr_diff: UInt

val ptr_match: Bool

val ram: Mem[T]

final val reset: Reset

def suggestName(seed: ⇒ String): Queue.this.type

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

final def toAbsoluteTarget: IsModule

final def toNamed: ModuleName

def toString(): String

final def toTarget: ModuleTarget

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from LegacyModule

Inherited from MultiIOModule

Inherited from RawModule

Inherited from BaseModule

Inherited from HasId

Inherited from internal.InstanceId

Inherited from AnyRef

Inherited from Any