e8c8d2af71
Fundamental new features: * Added tile package: This package is intended to hold components re-usable across different types of tile. Will be the future location of TL2-RoCC accelerators and new diplomatic versions of intra-tile interfaces. * Adopted [ModuleName]Params convention: Code base was very inconsistent about what to name case classes that provide parameters to modules. Settled on calling them [ModuleName]Params to distinguish them from config.Parameters and config.Config. So far applied mostly only to case classes defined within rocket and tile. * Defined RocketTileParams: A nested case class containing case classes for all the components of a tile (L1 caches and core). Allows all such parameters to vary per-tile. * Defined RocketCoreParams: All the parameters that can be varied per-core. * Defined L1CacheParams: A trait defining the parameters common to L1 caches, made concrete in different derived case classes. * Defined RocketTilesKey: A sequence of RocketTileParams, one for every tile to be created. * Provided HeterogeneousDualCoreConfig: An example of making a heterogeneous chip with two cores, one big and one little. * Changes to legacy code: ReplacementPolicy moved to package util. L1Metadata moved to package tile. Legacy L2 cache agent removed because it can no longer share the metadata array implementation with the L1. Legacy GroundTests on life support. Additional changes that got rolled in along the way: * rocket: Fix critical path through BTB for I$ index bits > pgIdxBits * coreplex: tiles connected via :=* * groundtest: updated to use TileParams * tilelink: cache cork requirements are relaxed to allow more cacheless masters
115 lines
3.4 KiB
Scala
115 lines
3.4 KiB
Scala
// See LICENSE.Berkeley for license details.
|
|
// See LICENSE.SiFive for license details.
|
|
|
|
package rocket
|
|
|
|
import Chisel._
|
|
import config._
|
|
import util.{ParameterizedBundle, DecoupledHelper}
|
|
|
|
class HellaCacheArbiter(n: Int)(implicit p: Parameters) extends Module
|
|
{
|
|
val io = new Bundle {
|
|
val requestor = Vec(n, new HellaCacheIO).flip
|
|
val mem = new HellaCacheIO
|
|
}
|
|
|
|
if (n == 1) {
|
|
io.mem <> io.requestor.head
|
|
} else {
|
|
val s1_id = Reg(UInt())
|
|
val s2_id = Reg(next=s1_id)
|
|
|
|
io.mem.invalidate_lr := io.requestor.map(_.invalidate_lr).reduce(_||_)
|
|
io.mem.req.valid := io.requestor.map(_.req.valid).reduce(_||_)
|
|
io.requestor(0).req.ready := io.mem.req.ready
|
|
for (i <- 1 until n)
|
|
io.requestor(i).req.ready := io.requestor(i-1).req.ready && !io.requestor(i-1).req.valid
|
|
|
|
for (i <- n-1 to 0 by -1) {
|
|
val req = io.requestor(i).req
|
|
def connect_s0() = {
|
|
io.mem.req.bits.cmd := req.bits.cmd
|
|
io.mem.req.bits.typ := req.bits.typ
|
|
io.mem.req.bits.addr := req.bits.addr
|
|
io.mem.req.bits.phys := req.bits.phys
|
|
io.mem.req.bits.tag := Cat(req.bits.tag, UInt(i, log2Up(n)))
|
|
s1_id := UInt(i)
|
|
}
|
|
def connect_s1() = {
|
|
io.mem.s1_kill := io.requestor(i).s1_kill
|
|
io.mem.s1_data := io.requestor(i).s1_data
|
|
}
|
|
|
|
if (i == n-1) {
|
|
connect_s0()
|
|
connect_s1()
|
|
} else {
|
|
when (req.valid) { connect_s0() }
|
|
when (s1_id === UInt(i)) { connect_s1() }
|
|
}
|
|
}
|
|
|
|
for (i <- 0 until n) {
|
|
val resp = io.requestor(i).resp
|
|
val tag_hit = io.mem.resp.bits.tag(log2Up(n)-1,0) === UInt(i)
|
|
resp.valid := io.mem.resp.valid && tag_hit
|
|
io.requestor(i).xcpt := io.mem.xcpt
|
|
io.requestor(i).ordered := io.mem.ordered
|
|
io.requestor(i).s2_nack := io.mem.s2_nack && s2_id === UInt(i)
|
|
resp.bits := io.mem.resp.bits
|
|
resp.bits.tag := io.mem.resp.bits.tag >> log2Up(n)
|
|
|
|
io.requestor(i).replay_next := io.mem.replay_next
|
|
}
|
|
}
|
|
}
|
|
|
|
class InOrderArbiter[T <: Data, U <: Data](reqTyp: T, respTyp: U, n: Int)
|
|
(implicit p: Parameters) extends Module {
|
|
val io = new Bundle {
|
|
val in_req = Vec(n, Decoupled(reqTyp)).flip
|
|
val in_resp = Vec(n, Decoupled(respTyp))
|
|
val out_req = Decoupled(reqTyp)
|
|
val out_resp = Decoupled(respTyp).flip
|
|
}
|
|
|
|
if (n > 1) {
|
|
val route_q = Module(new Queue(UInt(width = log2Up(n)), 2))
|
|
val req_arb = Module(new RRArbiter(reqTyp, n))
|
|
req_arb.io.in <> io.in_req
|
|
|
|
val req_helper = DecoupledHelper(
|
|
req_arb.io.out.valid,
|
|
route_q.io.enq.ready,
|
|
io.out_req.ready)
|
|
|
|
io.out_req.bits := req_arb.io.out.bits
|
|
io.out_req.valid := req_helper.fire(io.out_req.ready)
|
|
|
|
route_q.io.enq.bits := req_arb.io.chosen
|
|
route_q.io.enq.valid := req_helper.fire(route_q.io.enq.ready)
|
|
|
|
req_arb.io.out.ready := req_helper.fire(req_arb.io.out.valid)
|
|
|
|
val resp_sel = route_q.io.deq.bits
|
|
val resp_ready = io.in_resp(resp_sel).ready
|
|
val resp_helper = DecoupledHelper(
|
|
resp_ready,
|
|
route_q.io.deq.valid,
|
|
io.out_resp.valid)
|
|
|
|
val resp_valid = resp_helper.fire(resp_ready)
|
|
for (i <- 0 until n) {
|
|
io.in_resp(i).bits := io.out_resp.bits
|
|
io.in_resp(i).valid := resp_valid && resp_sel === UInt(i)
|
|
}
|
|
|
|
route_q.io.deq.ready := resp_helper.fire(route_q.io.deq.valid)
|
|
io.out_resp.ready := resp_helper.fire(io.out_resp.valid)
|
|
} else {
|
|
io.out_req <> io.in_req.head
|
|
io.in_resp.head <> io.out_resp
|
|
}
|
|
}
|