class
Fame1Wrapper extends Module
Instance Constructors
-
new
Fame1Wrapper(f: ⇒ Module)
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
-
val
DebugIOs: HashMap[String, Data]
-
-
val
RegIOs: HashMap[String, DecoupledIO[Bits]]
-
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
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
-
def
debug(x: Node): Unit
-
var
debug_counter: Int
-
val
debugs: LinkedHashSet[Node]
-
var
decoupled_counter: Int
-
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
findCombLoop(): Unit
-
def
findConsumers(): Unit
-
def
findGraphDims(): (Int, Int, Int)
-
def
findOrdering(): Unit
-
def
findRoots(): ArrayBuffer[Node]
-
var
fire_tgt_clk: Bool
-
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]
-
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]
-
-
var
ioVal: Data
-
def
isInferenceTerminal(m: Node): Boolean
-
def
isInput(node: Node): Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
-
var
isWalked: HashSet[Node]
-
var
isWalking: HashSet[Node]
-
def
keepInputs(nodes: Seq[Node]): Seq[Node]
-
var
level: Int
-
def
markComponent(): Unit
-
val
mods: ArrayBuffer[Node]
-
var
moduleName: String
-
var
name: String
-
var
named: Boolean
-
val
names: HashMap[String, Node]
-
final
def
ne(arg0: AnyRef): Boolean
-
def
nextIndex: Int
-
val
nexts: scala.collection.mutable.Queue[Node]
-
var
nindex: Int
-
val
nodes: ArrayBuffer[Node]
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
var
num_debug_io: Int
-
var
num_decoupled_io: Int
-
var
num_reg_io: Int
-
val
omods: ArrayBuffer[Node]
-
val
originalModule: Module
-
def
ownIo(): Unit
-
var
pName: String
-
-
var
pathParent: Module
-
def
postMarkNet(fake: Int = 0): Unit
-
def
printf(message: String, args: Node*): Unit
-
val
printfs: ArrayBuffer[Printf]
-
var
reg_counter: Int
-
val
regs: ArrayBuffer[Reg]
-
def
removeInputs(nodes: Seq[Node]): Seq[Node]
-
def
removeTypeNodes(): Int
-
def
reset: Bool
-
def
reset_=(): Unit
-
def
reset_=(r: Bool): Unit
-
val
resets: HashMap[Bool, Bool]
-
val
signals: LinkedHashSet[Node]
-
def
stripComponent(s: String): String
-
val
switchKeys: Stack[Bits]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
traceNodes(): Unit
-
def
traceableNodes: Array[Node]
-
def
transform(isTop: Boolean, module: Module, parent: Module): Unit
-
var
traversal: Int
-
def
verifyAllMuxes: Unit
-
var
verilog_parameters: String
-
def
visitNodes(roots: Array[Node]): Unit
-
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)]
-
var
wiresCache: Array[(String, Bits)]
Inherited from AnyRef
Inherited from Any