Instance Constructors
-
new
Probe()
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
def
##[T <: Data](right: T): Probe.this.type
-
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
-
val
addr_block: UInt
-
val
amoAluOperandBits: Int
-
def
apply(name: String): Data
-
def
asDirectionless(): Probe.this.type
-
def
asInput(): Probe.this.type
-
final
def
asInstanceOf[T0]: T0
-
def
asOutput(): Probe.this.type
-
def
assign(src: Node): Unit
-
def
canCSE: Boolean
-
lazy val
chiselName: String
-
var
clock: Clock
-
def
clone(): Probe.this.type
-
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
-
def
conflicts(addr: UInt): Bool
-
-
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
flip(): Probe.this.type
-
def
floLitValue: Float
-
def
forceMatchingWidths: Unit
-
def
fromBits(b: Bits): Probe.this.type
-
def
fromMap(elemmap: Map[String, Data]): Probe.this.type
-
def
fromNode(n: Node): Probe.this.type
-
final
def
getClass(): Class[_]
-
def
getLit: Literal
-
def
getNode: Node
-
def
getWidth(): Int
-
def
getWidthW(): Width
-
def
hasData(dummy: Int = 0): Bool
-
def
hasMultibeatData(dummy: Int = 0): Bool
-
def
hashCode(): Int
-
def
hashCodeForCSE: Int
-
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
is(t: UInt): Bool
-
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
-
val
p_type: UInt
-
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
-
val
tlAcquireTypeBits: Int
-
val
tlAcquireUnionBits: Int
-
val
tlBeatAddrBits: Int
-
val
tlBlockAddrBits: Int
-
val
tlByteAddrBits: Int
-
val
tlClientIdBits: Int
-
val
tlClientXactIdBits: Int
-
-
val
tlDataBeats: Int
-
val
tlDataBits: Int
-
val
tlDataBytes: Int
-
val
tlGrantTypeBits: Int
-
val
tlManagerIdBits: Int
-
val
tlManagerXactIdBits: Int
-
val
tlMaxClientXacts: Int
-
val
tlMaxClientsPerPort: Int
-
val
tlMaxManagerXacts: Int
-
val
tlMemoryOpcodeBits: Int
-
val
tlMemoryOperandSizeBits: Int
-
val
tlNCachelessClients: Int
-
val
tlNCachingClients: Int
-
val
tlNClients: Int
-
val
tlNManagers: Int
-
val
tlNetworkDoesNotInterleaveBeats: Boolean
-
val
tlNetworkPreservesPointToPointOrdering: Boolean
-
val
tlWriteMaskBits: Int
-
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 UsesParameters
Inherited from Bundle
Inherited from Aggregate
Inherited from Data
Inherited from Node
Inherited from nameable
Inherited from AnyRef
Inherited from Any
The Probe channel is used to force clients to release data or cede permissions on a cache block. Clients respond to Probes with uncore.Release messages. The available types of Probes are customized by a particular uncore.CoherencePolicy.