BitVector

abstract def apply(offset: UInt, bitCount: BitCount): BitVector.this.type

Return a range of bits at offset and of width bitCount

abstract def apply(offset: Int, bitCount: BitCount): BitVector.this.type

Return a range of bits at offset and of width bitCount

abstract def apply(bitId: UInt): Bool

Return the bit at index bitId

abstract def apply(bitId: Int): Bool

Return the bit at index bitId

abstract def asBits: Bits

Cast data to Bits

abstract def assignFromBits(bits: Bits, hi: Int, low: Int): Unit

abstract def assignFromBits(bits: Bits): Unit

abstract def getAllTrue: BitVector.this.type

abstract def getTypeObject: Any

abstract def getZero: BitVector.this.type

Create a data set to 0

abstract def getZeroUnconstrained: BitVector.this.type

abstract def opName: String

abstract def resize(width: BitCount): BitVector

abstract def resize(width: Int): BitVector

Resize the bitVector to width

abstract def rotateLeft(that: Int): T

Left rotation of that bits

abstract def rotateRight(that: Int): T

Right rotation of that bits

abstract def setAll(): Unit

Set all bits

final def !=(arg0: Any): Boolean

def ##(right: Data): Bits

Concatenation between two data

final def ##(): Int

def =/=(that: MaskedLiteral): Bool

BitVector is not equal to MaskedLiteral

final def ==(arg0: Any): Boolean

def ===(that: MaskedLiteral): Bool

Compare a BitVector with a MaskedLiteral (M"110--0")

var _spinalTags: Set[SpinalTag]

def addAttribute(attribute: Attribute): BitVector.this.type

def addAttribute(name: String, value: String): BitVector.this.type

def addAttribute(name: String): BitVector.this.type

def addTag(spinalTag: SpinalTag): BitVector.this.type

def addTags(tags: Iterable[SpinalTag]): BitVector.this.type

var algoIncrementale: Int

var algoInt: Int

def allowDirectionLessIo: BitVector.this.type

def allowOverride: BitVector.this.type

Allow a data to be overrided

def allowPruning(): BitVector.this.type

def allowSimplifyIt(): BitVector.this.type

def allowUnsetRegToAvoidLatch: BitVector.this.type

def andR: Bool

Logical AND of all bits

def apply(range: Range): BitVector.this.type

Return a range of bits

def asBool: Bool

def asBools: Vec[Bool]

Cast the BitVector into a Vector of Bool

def asData: Data

def asDirectionLess(): BitVector.this.type

remove the direction (in,out,inout) to a data

def asInOut(): BitVector.this.type

set a data as inout

def asInput(): BitVector.this.type

Set a data as input

final def asInstanceOf[T0]: T0

def asOutput(): BitVector.this.type

Set a data as output

def assignDontCare(): BitVector.this.type

final def assignFrom(that: AnyRef, target: AnyRef = this): Unit

def assignFromBits(bits: Bits, offset: Int, bitCount: BitCount): Unit

def clearAll(): Unit

Clear all bits

var clockDomain: ClockDomain

def clone(): BitVector.this.type

def component: Component

final def compositAssignFrom(that: AnyRef, target: AnyRef, kind: AnyRef): Unit

var compositeAssign: Assignable

def dirString(): String

def dlcAppend(that: AssignmentStatement): BitVector.this.type

def dlcForeach[T >: AssignmentStatement](func: (T) ⇒ Unit): Unit

def dlcHasOnlyOne: Boolean

var dlcHead: AssignmentStatement

def dlcIsEmpty: Boolean

var dlcLast: AssignmentStatement

def dlcPrepend(that: AssignmentStatement): BitVector.this.type

def dontSimplifyIt(): BitVector.this.type

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def existsTag(cond: (SpinalTag) ⇒ Boolean): Boolean

def filterTag(cond: (SpinalTag) ⇒ Boolean): Iterable[SpinalTag]

def finalize(): Unit

def findTag(cond: (SpinalTag) ⇒ Boolean): Option[SpinalTag]

def flatten: Seq[BaseType]

def flattenForeach(body: (BaseType) ⇒ Unit): Unit

def flattenLocalName: Seq[String]

def flip(): BitVector.this.type

flip the direction of the data

def foreachClockDomain(func: (ClockDomain) ⇒ Unit): Unit

def foreachDrivingExpression(func: (Expression) ⇒ Unit): Unit

def foreachExpression(func: (Expression) ⇒ Unit): Unit

def foreachReflectableNameables(doThat: (Any) ⇒ Unit): Unit

def foreachStatements(func: (AssignmentStatement) ⇒ Unit): Unit

def genIf(cond: Boolean): BitVector.this.type

Generate this if condition is true

def getBitsWidth: Int

Return the width of the data

final def getClass(): Class[_]

def getComponent(): Component

def getComponents(): Seq[Component]

Get current component with all parents

def getDisplayName(): String

def getDrivingReg: BitVector.this.type

def getInstanceCounter: Int

def getName(): String

def getName(default: String): String

def getRealSource: Any

def getRealSourceNoRec: Any

def getRefOwnersChain(): List[Any]

def getRootParent: Data

def getScalaLocationLong: String

def getScalaLocationShort: String

def getScalaTrace(): Throwable

def getSingleDriver: Option[BitVector.this.type]

def getTag[T <: SpinalTag](clazz: Class[T]): Option[T]

def getTags(): Set[SpinalTag]

def getWidth: Int

def getWidthNoInferation: Int

Return the width

def getWidthStringNoInferation: String

val globalData: GlobalData

def hasAssignement: Boolean

def hasInit: Boolean

Does the base type have initial value

def hasOnlyOneStatement: Boolean

def hasTag(spinalTag: SpinalTag): Boolean

def hashCode(): Int

def head: AssignmentStatement

def high: Int

Return the upper bound

final def initFrom(that: AnyRef, target: AnyRef = this): Unit

def insertNext(s: Statement): Unit

def instanceAttributes(language: Language): Iterable[Attribute]

def instanceAttributes: Iterable[Attribute]

def isAnalog: Boolean

def isComb: Boolean

def isDirectionLess: Boolean

def isEmptyOfTag: Boolean

def isInOut: Boolean

def isInput: Boolean

def isInputOrInOut: Boolean

final def isInstanceOf[T0]: Boolean

def isNamed: Boolean

def isOutput: Boolean

def isOutputOrInOut: Boolean

def isReg: Boolean

def isTypeNode: Boolean

Is the baseType a node

def isUnnamed: Boolean

def isUsingResetSignal: Boolean

Is the basetype using reset signal

def isUsingSoftResetSignal: Boolean

Is the basetype using soft reset signal

def isVital: Boolean

Check if the baseType is vital

def keep(): BitVector.this.type

var lastScopeStatement: Statement

def lsb: Bool

Return the least significant bit

def msb: Bool

Return the most significant bit

def mux[T2 <: Data](mappings: (Any, T2)*): T2

def muxList[T2 <: Data](defaultValue: T2, mappings: Seq[(Any, T2)]): T2

def muxList[T2 <: Data](mappings: Seq[(Any, T2)]): T2

final def ne(arg0: AnyRef): Boolean

def newExtract(offset: UInt, size: Int, extract: BitVectorRangedAccessFloating): BitVector.this.type

Extract a range of bits of the BitVector

def newExtract(hi: Int, lo: Int, accessFactory: ⇒ BitVectorRangedAccessFixed): BitVector.this.type

Extract a range of bits of the BitVector

def newExtract(bitId: UInt, extract: BitVectorBitAccessFloating): Bool

Extract a bit of the BitVector

def newExtract(bitId: Int, extract: BitVectorBitAccessFixed): Bool

Extract a bit of the BitVector

var nextScopeStatement: Statement

def noBackendCombMerge: BitVector.this.type

def noCombLoopCheck: BitVector.this.type

def normalizeInputs: Unit

final def notify(): Unit

final def notifyAll(): Unit

def onEachAttributes(doIt: (Attribute) ⇒ Unit): Unit

def orR: Bool

Logical OR of all bits

var parent: Data

var parentScope: ScopeStatement

def pull(): BitVector.this.type

Pull a signal to the top level (use for debugging)

def randBoot(): BitVector.this.type

Usefull for register that doesn't need a reset value in RTL, but need a randome value for simulation (avoid x-propagation)

def range: Range

Return the range

var refOwner: RefOwnerType

def remapDrivingExpressions(func: (Expression) ⇒ Expression): Unit

def remapExpressions(func: (Expression) ⇒ Expression): Unit

def removeAssignments(): BitVector.this.type

Remove all assignements of the base type

def removeStatement(): Unit

def removeStatementFromScope(): Unit

def removeTag(spinalTag: SpinalTag): BitVector.this.type

def removeTags(tags: Iterable[SpinalTag]): BitVector.this.type

def resized: BitVector.this.type

Resized data regarding target

def rootScopeStatement: ScopeStatement

def rotateLeft(that: UInt): T

Left rotation of that Bits

def rotateRight(that: UInt): T

Right rotation of that Bits

def setAllTo(value: Bool): Unit

Set all bits to value

def setAllTo(value: Boolean): Unit

Set all bits to value

def setAsAnalog(): BitVector.this.type

def setAsComb(): BitVector.this.type

Set baseType to Combinatorial

def setAsReg(): BitVector.this.type

Set baseType to reg

def setAsTypeNode(): BitVector.this.type

Set baseType to Node

def setAsVital(): BitVector.this.type

Set the baseType to vital

def setCompositeName(nameable: Nameable, postfix: String, weak: Boolean): BitVector.this.type

def setCompositeName(nameable: Nameable, postfix: String): BitVector.this.type

def setCompositeName(nameable: Nameable, weak: Boolean): BitVector.this.type

def setCompositeName(nameable: Nameable): BitVector.this.type

def setName(name: String, weak: Boolean = false): BitVector.this.type

def setPartialName(name: String, weak: Boolean): BitVector.this.type

def setPartialName(owner: Nameable, name: String, weak: Boolean): BitVector.this.type

def setPartialName(name: String): BitVector.this.type

def setPartialName(owner: Nameable, name: String): BitVector.this.type

def setRefOwner(that: Any): Unit

def setScalaLocated(source: ScalaLocated): BitVector.this.type

def setWeakName(name: String): BitVector.this.type

def setWidth(width: Int): BitVector.this.type

Set the width of the BitVector

def simplifyNode: Expression

def spinalTags: Set[SpinalTag]

def subdivideIn(sliceWidth: BitCount): Vec[T]

Split the BitVector into slice of x bits * @example

val res = myBits.subdiviedIn(3 bits)

def subdivideIn(sliceCount: SlicesCount): Vec[T]

Split the BitVector into x slice

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

def toStringMultiLine(): String

def unsetName(): BitVector.this.type

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

def walkDrivingExpressions(func: (Expression) ⇒ Unit): Unit

def walkExpression(func: (Expression) ⇒ Unit): Unit

def walkParentTreeStatements(func: (TreeStatement) ⇒ Unit): Unit

def walkParentTreeStatementsUntilRootScope(func: (TreeStatement) ⇒ Unit): Unit

def walkRemapDrivingExpressions(func: (Expression) ⇒ Expression): Unit

def walkRemapExpressions(func: (Expression) ⇒ Expression): Unit

def wrapCast[T <: BaseType](result: T, node: Cast): T

def xorR: Bool

Logical XOR of all bits