LockingRRArbiter

Instance Constructors

new LockingRRArbiter(gen: T, n: Int, count: Int, needsLock: Option[(T) ⇒ Bool] = scala.None)

Value Members

final def !=(arg0: AnyRef): Boolean

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

Definition Classes
Any
final def ##(): Int

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

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

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

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

Definition Classes
Module
def addClockAndReset: Unit

Definition Classes
Module
def addDefaultReset: Unit

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

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

Definition Classes
Module
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 choose: UInt
val chosen: UInt

Definition Classes
LockingArbiterLike
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 collectNodes(c: Module): Unit

Definition Classes
Module
var containsReg: Boolean

Definition Classes
Module
def containsRegInTree: Boolean

Returns true if this module or any of its children contains at least one register.
Returns true if this module or any of its children contains at least one register.

Definition Classes
Module
def counter(xs: Node*): Unit

Definition Classes
Module
def counter(x: Node): Unit

Definition Classes
Module
val ctrl: Seq[Bool]
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 depthString(depth: Int): String

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

Definition Classes
Module
def elaborate(fake: Int = 0): 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): Binding

Definition Classes
Module
def findCombLoop(): Unit

Definition Classes
Module
def findConsumers(): Unit

Definition Classes
Module
def findGraphDims(): (Int, Int, Int)

Definition Classes
Module
def findOrdering(): Unit

Definition Classes
Module
def findRoots(): ArrayBuffer[Node]

Since we are relying on the out-degree of nodes (i.
Since we are relying on the out-degree of nodes (i.e. consumers.length), this method should only be called after the forward edges have been constructed.

Definition Classes
Module
def forceMatchingWidths: Unit

Definition Classes
Module
def genAllMuxes: Unit

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 getResetPin(reset: Bool): Bool

Definition Classes
Module
def getValNames: ArrayBuffer[String]

Definition Classes
Module
val grant: List[Bool]

Definition Classes
LockingArbiterLike
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
def inferAll(): Int

Definition Classes
Module
def initializeBFS: scala.collection.mutable.Queue[Node]

Definition Classes
Module
def initializeDFS: Stack[Node]

Definition Classes
Module
val io: ArbiterIO[T]

Definition Classes
LockingArbiterLike → Module
var ioVal: Data

Definition Classes
Module
def isInferenceTerminal(m: Node): Boolean

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

Definition Classes
Module
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def isSubclassOf(x: Class[_]): Boolean

Definition Classes
Module
object isValName

Definition Classes
Module
var isWalked: HashSet[Node]

Definition Classes
Module
var isWalking: HashSet[Node]

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

Definition Classes
Module
val last_grant: UInt
var level: Int

A backend(Backend.
A backend(Backend.scala) might generate multiple module source code from one Module, based on the parameters to instanciate 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 guarenteed to generate all Module/modules source text before their first instantiation.

Definition Classes
Module
val lockIdx: UInt

Definition Classes
LockingArbiterLike
val locked: Bool

Definition Classes
LockingArbiterLike
def markComponent(): Unit

Definition Classes
Module
val mods: ArrayBuffer[Node]

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 nexts: scala.collection.mutable.Queue[Node]

Definition Classes
Module
var nindex: Int

Definition Classes
Module
val nodes: ArrayBuffer[Node]

Definition Classes
Module
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
val omods: ArrayBuffer[Node]

Definition Classes
Module
def ownIo(): Unit

Definition Classes
Module
var pName: String

Definition Classes
Module
var parent: Module

Definition Classes
Module
var pathParent: Module

Definition Classes
Module
def postMarkNet(fake: Int = 0): Unit

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

Definition Classes
Module
val printfs: ArrayBuffer[Printf]

Definition Classes
Module
val regs: ArrayBuffer[Reg]

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

Definition Classes
Module
def removeTypeNodes(): Int

All classes inherited from Data are used to add type information and do not represent logic itself.
All classes inherited from Data are used to add type information and do not represent logic itself.

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
val signals: ArrayBuffer[Node]

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
def toString(): String

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

Definition Classes
Module
def traceableNodes: Array[Node]

Definition Classes
Module
var traversal: Int

Definition Classes
Module
def verifyAllMuxes: Unit

Definition Classes
Module
var verilog_parameters: String

Definition Classes
Module
def visitNodes(roots: Array[Node]): Unit

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
var wiresCache: Array[(String, Bits)]

Definition Classes
Module

class LockingRRArbiter[T <: Data] extends LockingArbiterLike[T]

Instance Constructors

new LockingRRArbiter(gen: T, n: Int, count: Int, needsLock: Option[(T) ⇒ Bool] = scala.None)

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 addClockAndReset: Unit

def addDefaultReset: Unit

def addResetPin(reset: Bool): Unit

def apply(name: String): Data

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 choose: UInt

val chosen: UInt

var clock: Clock

val clocks: ArrayBuffer[Clock]

def clone(): AnyRef

def collectNodes(c: Module): Unit

var containsReg: Boolean

def containsRegInTree: Boolean

def counter(xs: Node*): Unit

def counter(x: Node): Unit

val ctrl: Seq[Bool]

def debug(x: Node): Unit

val debugs: LinkedHashSet[Node]

var defaultResetPin: Bool

var defaultWidth: Int

def depthString(depth: Int): String

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

def elaborate(fake: Int = 0): Unit

def emitDec(b: Backend): String

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def finalize(): Unit

def findBinding(m: Node): Binding

def findCombLoop(): Unit

def findConsumers(): Unit

def findGraphDims(): (Int, Int, Int)

def findOrdering(): Unit

def findRoots(): ArrayBuffer[Node]

def forceMatchingWidths: Unit

def genAllMuxes: Unit

final def getClass(): Class[_]

def getClassValNames(c: Class[_]): ArrayBuffer[String]

def getPathName(separator: String = "_"): String

def getPathName: String

def getResetPin(reset: Bool): Bool

def getValNames: ArrayBuffer[String]

val grant: List[Bool]

def hasClock: Boolean

var hasExplicitClock: Boolean

var hasExplicitReset: Boolean

def hasReset: Boolean

def hasWhenCond: Boolean

val hashCode: Int

def inferAll(): Int

def initializeBFS: scala.collection.mutable.Queue[Node]

def initializeDFS: Stack[Node]

val io: ArbiterIO[T]

var ioVal: Data

def isInferenceTerminal(m: Node): Boolean

def isInput(node: Node): Boolean

final def isInstanceOf[T0]: Boolean

def isSubclassOf(x: Class[_]): Boolean

object isValName

var isWalked: HashSet[Node]

var isWalking: HashSet[Node]

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

val last_grant: UInt

var level: Int