FameQueueTracker

Instance Constructors

new FameQueueTracker(num_tgt_entries: Int, num_tgt_cycles: Int)

Value Members

final def !=(arg0: Any): Boolean

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

Definition Classes
AnyRef → Any
def <>(src: Module): Unit

Definition Classes
Module
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def addClock(clock: Clock): Unit

Definition Classes
Module
def addDefaultReset: Unit

Definition Classes
Module
def addModule[T <: Module](c: ⇒ T)(implicit p: Parameters = params): T

Definition Classes
Module
def addModule[T <: Module](c: ⇒ T, f: PartialFunction[Any, Any]): T

Definition Classes
Module
def addPin[T <: Data](pin: T, name: String = ""): T

Definition Classes
Module
def addResetPin(reset: Bool): Bool

Definition Classes
Module
def apply(name: String): Data

Definition Classes
Module
val aregs: Vec[UInt]
final def asInstanceOf[T0]: T0

Definition Classes
Any
def assert(cond: Bool, message: String): Unit

Add an assertion in the code generated by a backend.
Add an assertion in the code generated by a backend.

Definition Classes
Module
val asserts: ArrayBuffer[Assert]

Definition Classes
Module
def bfs(visit: (Node) ⇒ Unit): Unit

Definition Classes
Module
val bindings: ArrayBuffer[Binding]

Definition Classes
Module
val children: ArrayBuffer[Module]

Definition Classes
Module
var clock: Clock

Definition Classes
Module
val clocks: ArrayBuffer[Clock]

Definition Classes
Module
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def debug(x: Node): Unit

Insures a backend does not remove a signal because it is unreachable from the outputs.
Insures a backend does not remove a signal because it is unreachable from the outputs.

Definition Classes
Module
val debugs: LinkedHashSet[Node]

Definition Classes
Module
var defaultResetPin: Bool

Definition Classes
Module
var defaultWidth: Int

Definition Classes
Module
def dfs(visit: (Node) ⇒ Unit): Unit

Definition Classes
Module
def emitDec(b: Backend): String

Definition Classes
Module
final def eq(arg0: AnyRef): Boolean

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

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

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def findBinding(m: Node): Option[Binding]

Definition Classes
Module
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def getClassValNames(c: Class[_]): ArrayBuffer[String]

Definition Classes
Module
def getPathName(separator: String = "_"): String

Definition Classes
Module
def getPathName: String

Returns the absolute path to a component instance from toplevel.
Returns the absolute path to a component instance from toplevel.

Definition Classes
Module
def getValNames: ArrayBuffer[String]

Definition Classes
Module
def hasClock: Boolean

Definition Classes
Module
var hasExplicitClock: Boolean

Definition Classes
Module
var hasExplicitReset: Boolean

Definition Classes
Module
def hasReset: Boolean

Definition Classes
Module
def hasWhenCond: Boolean

Definition Classes
Module
val hashCode: Int

Definition Classes
Module → AnyRef → Any
val io: FameQueueTrackerIO

Definition Classes
FameQueueTracker → Module
var ioVal: Data

Definition Classes
Module
def isInput(node: Node): Boolean

Definition Classes
Module
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
object isValName

Definition Classes
Module
def keepInputs(nodes: Seq[Node]): Seq[Node]

Definition Classes
Module
var level: Int

A backend(Backend.scala) might generate multiple module source code from one Module, based on the parameters to instantiate the component instance.
A backend(Backend.scala) might generate multiple module source code from one Module, based on the parameters to instantiate the component instance. Since we do not want to blindly generate one module per instance the backend will keep a cache of each module's implementation source code and discard textual duplicates. By walking the nodes from level zero (leafs) to level N (root), we are guaranteed to generate all Module/modules source text before their first instantiation.

Definition Classes
Module
def markComponent(): Unit

Definition Classes
Module
var moduleName: String

Name of the module this component generates (defaults to class name).
Name of the module this component generates (defaults to class name).

Definition Classes
Module
var name: String

Name of the instance.
Name of the instance.

Definition Classes
Module
var named: Boolean

Definition Classes
Module
val names: HashMap[String, Node]

Definition Classes
Module
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def nextIndex: Int

Definition Classes
Module
val next_reg_val0: UInt
val next_reg_val_last: UInt
val next_tail_pointer: UInt
var nindex: Int

Definition Classes
Module
val nodes: LinkedHashSet[Node]

Definition Classes
Module
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def ownIo(): Unit

Definition Classes
Module
lazy val params: Parameters

Definition Classes
Module
var parent: Module

Definition Classes
Module
var pathParent: Module

Definition Classes
Module
def printf(message: String, args: Node*): Unit

Definition Classes
Module
val printfs: ArrayBuffer[Printf]

Definition Classes
Module
def removeInputs(nodes: Seq[Node]): Seq[Node]

Definition Classes
Module
def reset: Bool

Definition Classes
Module
def reset_=(): Unit

Definition Classes
Module
def reset_=(r: Bool): Unit

Definition Classes
Module
val resets: HashMap[Bool, Bool]

Definition Classes
Module
def stripComponent(s: String): String

Definition Classes
Module
val switchKeys: Stack[Bits]

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

Definition Classes
AnyRef
val tail_pointer: UInt
def toString(): String

Definition Classes
Module → AnyRef → Any
var traversal: Int

Definition Classes
Module
var verilog_parameters: String

Definition Classes
Module
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( ... )
def whenCond: Bool

Definition Classes
Module
val whenConds: Stack[Bool]

Definition Classes
Module
def wires: Array[(String, Bits)]

Definition Classes
Module

Related Doc: package Chisel

class FameQueueTracker extends Module

Instance Constructors

new FameQueueTracker(num_tgt_entries: Int, num_tgt_cycles: Int)

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

def <>(src: Module): Unit

final def ==(arg0: Any): Boolean

def addClock(clock: Clock): Unit

def addDefaultReset: Unit

def addModule[T <: Module](c: ⇒ T)(implicit p: Parameters = params): 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

val aregs: Vec[UInt]

final def asInstanceOf[T0]: T0

def assert(cond: Bool, message: String): Unit

val asserts: ArrayBuffer[Assert]

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

def dfs(visit: (Node) ⇒ Unit): Unit

def emitDec(b: Backend): String

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def finalize(): Unit

def findBinding(m: Node): Option[Binding]

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: FameQueueTrackerIO

var ioVal: Data

def isInput(node: Node): Boolean

final def isInstanceOf[T0]: Boolean

object isValName

def keepInputs(nodes: Seq[Node]): Seq[Node]

var level: Int

def markComponent(): Unit

var moduleName: String

var name: String

var named: Boolean

val names: HashMap[String, Node]

final def ne(arg0: AnyRef): Boolean

def nextIndex: Int

val next_reg_val0: UInt

val next_reg_val_last: UInt

val next_tail_pointer: UInt

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]

def removeInputs(nodes: Seq[Node]): Seq[Node]

def reset: Bool

def reset_=(): Unit

def reset_=(r: Bool): Unit

val resets: HashMap[Bool, Bool]