1
0
rocket-chip/rocket/src/main/scala/util.scala

152 lines
4.1 KiB
Scala
Raw Normal View History

package rocket
2011-11-09 23:52:17 +01:00
import Chisel._
2013-06-13 19:31:04 +02:00
import scala.math._
object Util
2011-12-09 09:42:43 +01:00
{
2013-08-12 19:39:11 +02:00
implicit def intToUInt(x: Int): UInt = UInt(x)
implicit def intToBoolean(x: Int): Boolean = if (x != 0) true else false
implicit def booleanToInt(x: Boolean): Int = if (x) 1 else 0
implicit def booleanToBool(x: Boolean): Bits = Bool(x)
implicit def intSeqToUIntSeq(x: Iterable[Int]): Iterable[UInt] = x.map(UInt(_))
2013-08-12 19:39:11 +02:00
implicit def wcToUInt(c: WideCounter): UInt = c.value
}
object AVec
{
2013-08-12 19:39:11 +02:00
def apply[T <: Data](elts: Seq[T]): Vec[T] = Vec(elts)
def apply[T <: Data](elts: Vec[T]): Vec[T] = apply(elts.toSeq)
def apply[T <: Data](elt0: T, elts: T*): Vec[T] = apply(elt0 :: elts.toList)
def tabulate[T <: Data](n: Int)(f: Int => T): Vec[T] =
apply((0 until n).map(i => f(i)))
def tabulate[T <: Data](n1: Int, n2: Int)(f: (Int, Int) => T): Vec[Vec[T]] =
tabulate(n1)(i1 => tabulate(n2)(f(i1, _)))
}
2013-06-13 19:31:04 +02:00
object Str
{
def apply(s: String): Bits = {
var i = BigInt(0)
require(s.forall(validChar _))
for (c <- s)
i = (i << 8) | c
Lit(i, s.length*8){Bits()}
}
def apply(x: Char): Bits = {
require(validChar(x))
Lit(x, 8){Bits()}
}
2013-08-12 19:39:11 +02:00
def apply(x: UInt): Bits = apply(x, 10)
def apply(x: UInt, radix: Int): Bits = {
val rad = UInt(radix)
2013-06-13 19:31:04 +02:00
val w = x.getWidth
require(w > 0)
var q = x
2013-08-24 06:16:28 +02:00
var s = digit(q % rad)
2013-06-13 19:31:04 +02:00
for (i <- 1 until ceil(log(2)/log(radix)*w).toInt) {
q = q / rad
2013-08-24 06:16:28 +02:00
s = Cat(Mux(Bool(radix == 10) && q === UInt(0), Str(' '), digit(q % rad)), s)
2013-06-13 19:31:04 +02:00
}
s
}
2013-08-12 19:39:11 +02:00
def apply(x: SInt): Bits = apply(x, 10)
def apply(x: SInt, radix: Int): Bits = {
val neg = x < SInt(0)
2013-06-15 09:45:53 +02:00
val abs = x.abs
2013-06-13 19:31:04 +02:00
if (radix != 10) {
Cat(Mux(neg, Str('-'), Str(' ')), Str(abs, radix))
} else {
2013-08-12 19:39:11 +02:00
val rad = UInt(radix)
2013-06-13 19:31:04 +02:00
val w = abs.getWidth
require(w > 0)
var q = abs
2013-08-24 06:16:28 +02:00
var s = digit(q % rad)
2013-06-13 19:31:04 +02:00
var needSign = neg
for (i <- 1 until ceil(log(2)/log(radix)*w).toInt) {
q = q / rad
2013-08-12 19:39:11 +02:00
val placeSpace = q === UInt(0)
2013-06-13 19:31:04 +02:00
val space = Mux(needSign, Str('-'), Str(' '))
needSign = needSign && !placeSpace
2013-08-24 06:16:28 +02:00
s = Cat(Mux(placeSpace, space, digit(q % rad)), s)
2013-06-13 19:31:04 +02:00
}
Cat(Mux(needSign, Str('-'), Str(' ')), s)
}
}
2013-08-24 06:16:28 +02:00
private def digit(d: UInt): Bits = Mux(d < UInt(10), Str('0')+d, Str(('a'-10).toChar)+d)(7,0)
2013-06-13 19:31:04 +02:00
private def validChar(x: Char) = x == (x & 0xFF)
}
object Split
{
// is there a better way to do do this?
def apply(x: Bits, n0: Int) = {
val w = checkWidth(x, n0)
(x(w-1,n0), x(n0-1,0))
}
def apply(x: Bits, n1: Int, n0: Int) = {
val w = checkWidth(x, n1, n0)
(x(w-1,n1), x(n1-1,n0), x(n0-1,0))
}
def apply(x: Bits, n2: Int, n1: Int, n0: Int) = {
val w = checkWidth(x, n2, n1, n0)
(x(w-1,n2), x(n2-1,n1), x(n1-1,n0), x(n0-1,0))
}
private def checkWidth(x: Bits, n: Int*) = {
val w = x.getWidth
def decreasing(x: Seq[Int]): Boolean =
if (x.tail.isEmpty) true
else x.head > x.tail.head && decreasing(x.tail)
require(decreasing(w :: n.toList))
w
}
}
// a counter that clock gates most of its MSBs using the LSB carry-out
case class WideCounter(width: Int, inc: Bool = Bool(true))
{
private val isWide = width >= 4
private val smallWidth = if (isWide) log2Up(width) else width
2013-08-16 00:28:15 +02:00
private val small = Reg(init=UInt(0, smallWidth))
2013-08-12 19:39:11 +02:00
private val nextSmall = small + UInt(1, smallWidth+1)
when (inc) { small := nextSmall(smallWidth-1,0) }
private val large = if (isWide) {
2013-08-16 00:28:15 +02:00
val r = Reg(init=UInt(0, width - smallWidth))
2013-08-12 19:39:11 +02:00
when (inc && nextSmall(smallWidth)) { r := r + UInt(1) }
r
} else null
val value = Cat(large, small)
2013-08-12 19:39:11 +02:00
def := (x: UInt) = {
val w = x.getWidth
small := x(w.min(smallWidth)-1,0)
2013-08-12 19:39:11 +02:00
if (isWide) large := (if (w < smallWidth) UInt(0) else x(w.min(width)-1,smallWidth))
}
2011-12-09 09:42:43 +01:00
}
object Random
{
def apply(mod: Int, inc: Bool = Bool(true)): UInt = {
if (isPow2(mod)) {
require(mod <= 65536)
LFSR16(inc)(log2Up(mod)-1,0).toUInt
} else {
val max = 1 << log2Up(mod*8)
val rand_pow2 = apply(max, inc)
var res = UInt(mod-1)
for (i <- mod-1 to 1 by -1)
res = Mux(rand_pow2 < UInt(i*max/mod), UInt(i-1), res)
res
}
}
}