class
HierarchicalMetadata extends CoherenceMetadata
Instance Constructors
-
new
HierarchicalMetadata()
Value Members
-
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
-
def
##(b: Node): Node
-
final
def
##(): Int
-
def
+(other: Bundle): Bundle
-
def
:=(that: Data): Unit
-
def
<>(src: Node): Unit
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
-
def
===[T <: Data](right: T): Bool
-
def
W0Wtransform(): Unit
-
def
^^(src: Node): Unit
-
val
_id: Int
-
def
_isComplementOf(x: Node): Boolean
-
def
addConsumers(): Unit
-
def
apply(name: String): Data
-
-
-
final
def
asInstanceOf[T0]: T0
-
-
def
assign(src: Node): Unit
-
def
canCSE: Boolean
-
lazy val
chiselName: String
-
var
clock: Clock
-
-
var
cntrIdx: Int
-
-
def
colonEquals(src: Bundle): Unit
-
def
colonEquals[T <: Data](that: Iterable[T]): Unit
-
def
colonEquals(that: Bits): Unit
-
var
comp: proc
-
var
component: Module
-
def
componentOf: Module
-
val
consumers: LinkedHashSet[Node]
-
def
contains(name: String): Boolean
-
def
dblLitValue: Double
-
var
depth: Int
-
var
driveRand: Boolean
-
lazy val
elements: LinkedHashMap[String, Data]
-
lazy val
emitIndex: Int
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(that: Any): Boolean
-
def
equalsForCSE(x: Node): Boolean
-
def
extract(b: Bundle): List[Node]
-
def
extract(widths: Array[Int]): List[UInt]
-
def
finalize(): Unit
-
def
flatten: Array[(String, Bits)]
-
-
def
floLitValue: Float
-
def
forceMatchingWidths: Unit
-
-
def
fromMap(elemmap: Map[String, Data]): HierarchicalMetadata.this.type
-
-
final
def
getClass(): Class[_]
-
def
getLit: Literal
-
def
getNode: Node
-
def
getWidth(): Int
-
def
getWidthW(): Width
-
def
hashCode(): Int
-
def
hashCodeForCSE: Int
-
val
id: String
-
def
illegalAssignment(that: Any): Unit
-
def
infer: Boolean
-
var
inferWidth: (⇒ Node) ⇒ Width
-
def
init(n: String, w: Int, ins: Node*): Node
-
def
init(n: String, widthFunc: (⇒ Node) ⇒ Width, ins: Node*): Node
-
def
initOf(n: String, widthfunc: (⇒ Node) ⇒ Width, ins: Iterable[Node]): Node
-
-
val
inputs: ArrayBuffer[Node]
-
def
isByValue: Boolean
-
def
isDirectionless: Boolean
-
lazy val
isInObject: Boolean
-
lazy val
isInVCD: Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
def
isIo: Boolean
-
def
isIo_=(isIo: Boolean): Unit
-
def
isKnownWidth: Boolean
-
final
def
isLit: Boolean
-
def
isReg: Boolean
-
def
isTopLevelIO: Boolean
-
var
isTypeNode: Boolean
-
def
isUsedByClockHi: Boolean
-
var
isWidthWalked: Boolean
-
val
line: StackTraceElement
-
def
litOf: Literal
-
def
litValue(default: BigInt): BigInt
-
def
matchWidth(w: Width): Node
-
def
maybeFlatten: Seq[Node]
-
var
modified: Boolean
-
var
name: String
-
var
nameHolder: nameable
-
def
nameIt(path: String, isNamingIo: Boolean): Unit
-
var
named: Boolean
-
final
def
ne(arg0: AnyRef): Boolean
-
def
needWidth(): Int
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
-
def
params: Parameters
-
var
parents: LinkedHashSet[Node]
-
def
printTree(writer: PrintStream, depth: Int, indent: String): Unit
-
var
prune: Boolean
-
def
removeTypeNodes(): Unit
-
def
replaceTree(newNode: Node): Unit
-
def
review(): Unit
-
var
sccIndex: Int
-
var
sccLowlink: Int
-
def
setIsTypeNode: Unit
-
def
setName(n: String): Unit
-
def
setWidth(w: Int): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toBits(): UInt
-
def
toBool(): Bool
-
lazy val
toNode: Node
-
def
toString(): String
-
def
usesInClockHi(i: Node): Boolean
-
val
view: Seq[String]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
var
width_: Width
Inherited from Bundle
Inherited from Aggregate
Inherited from Data
Inherited from Node
Inherited from nameable
Inherited from AnyRef
Inherited from Any
HierarchicalMetadata is used in a cache in a multi-level memory hierarchy that is a manager with respect to some inner caches and a client with respect to some outer cache.
This class makes use of two different sets of TileLink parameters, which are applied by contextually mapping uncore.TLId to one of uncore.InnerTLId or uncore.OuterTLId.