xref: /XiangShan/src/main/scala/xiangshan/backend/rename/BusyTable.scala (revision 80c686d5d1406275cf4b9b3795dc3e82f29bef87)
1/***************************************************************************************
2* Copyright (c) 2020-2021 Institute of Computing Technology, Chinese Academy of Sciences
3* Copyright (c) 2020-2021 Peng Cheng Laboratory
4*
5* XiangShan is licensed under Mulan PSL v2.
6* You can use this software according to the terms and conditions of the Mulan PSL v2.
7* You may obtain a copy of Mulan PSL v2 at:
8*          http://license.coscl.org.cn/MulanPSL2
9*
10* THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OF ANY KIND,
11* EITHER EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO NON-INFRINGEMENT,
12* MERCHANTABILITY OR FIT FOR A PARTICULAR PURPOSE.
13*
14* See the Mulan PSL v2 for more details.
15***************************************************************************************/
16
17package xiangshan.backend.rename
18
19import org.chipsalliance.cde.config.Parameters
20import chisel3._
21import chisel3.util._
22import xiangshan._
23import utils._
24import utility._
25import xiangshan.backend.Bundles._
26import xiangshan.backend.datapath.WbConfig.{IntWB, VfWB, NoWB, PregWB}
27import xiangshan.backend.issue.SchdBlockParams
28import xiangshan.backend.datapath.{DataSource}
29
30class BusyTableReadIO(implicit p: Parameters) extends XSBundle {
31  val req = Input(UInt(PhyRegIdxWidth.W))
32  val resp = Output(Bool())
33  val loadDependency = Vec(LoadPipelineWidth, Output(UInt(3.W)))
34}
35
36class BusyTable(numReadPorts: Int, numWritePorts: Int, numPhyPregs: Int, pregWB: PregWB)(implicit p: Parameters, params: SchdBlockParams) extends XSModule with HasPerfEvents {
37  val io = IO(new Bundle() {
38    // set preg state to busy
39    val allocPregs = Vec(RenameWidth, Flipped(ValidIO(UInt(PhyRegIdxWidth.W))))
40    // set preg state to ready (write back regfile + rob walk)
41    val wbPregs = Vec(numWritePorts, Flipped(ValidIO(UInt(PhyRegIdxWidth.W))))
42    // fast wakeup
43    val wakeUp: MixedVec[ValidIO[IssueQueueIQWakeUpBundle]] = Flipped(params.genIQWakeUpInValidBundle)
44    // cancelFromDatapath
45    val cancel = Vec(backendParams.numExu, Flipped(ValidIO(new CancelSignal)))
46    // cancelFromMem
47    val ldCancel = Vec(backendParams.LdExuCnt, Flipped(new LoadCancelIO))
48    // read preg state
49    val read = Vec(numReadPorts, new BusyTableReadIO)
50  })
51
52  val loadDependency = RegInit(0.U.asTypeOf(Vec(numPhyPregs, Vec(LoadPipelineWidth, UInt(3.W)))))
53  val shiftLoadDependency = Wire(Vec(io.wakeUp.size, Vec(LoadPipelineWidth, UInt(3.W))))
54  val table = RegInit(0.U(numPhyPregs.W))
55  val tableUpdate = Wire(Vec(numPhyPregs, Bool()))
56  val wakeupOHVec = Wire(Vec(numPhyPregs, UInt(io.wakeUp.size.W)))
57
58  def reqVecToMask(rVec: Vec[Valid[UInt]]): UInt = {
59    ParallelOR(rVec.map(v => Mux(v.valid, UIntToOH(v.bits), 0.U)))
60  }
61
62  shiftLoadDependency.zip(io.wakeUp.map(_.bits.loadDependency)).zip(params.wakeUpInExuSources.map(_.name)).foreach {
63    case ((deps, originalDeps), name) => deps.zip(originalDeps).zipWithIndex.foreach {
64      case ((dep, originalDep), deqPortIdx) =>
65        // TODO: getLdExuIdx
66        if (params.backendParam.getLdExuIdx(params.backendParam.allExuParams.find(_.name == name).get) == deqPortIdx)
67          dep := (originalDep << 2).asUInt | 2.U
68        else
69          dep := originalDep << 1
70    }
71  }
72
73  wakeupOHVec.zipWithIndex.foreach{ case (wakeupOH, idx) =>
74    val tmp = pregWB match {
75      case _: IntWB => io.wakeUp.map(x => x.valid && x.bits.rfWen && UIntToOH(x.bits.pdest)(idx) && !LoadShouldCancel(Some(x.bits.loadDependency), io.ldCancel))
76      case _: VfWB => io.wakeUp.map(x => x.valid && (x.bits.fpWen || x.bits.vecWen) && UIntToOH(x.bits.pdest)(idx) && !LoadShouldCancel(Some(x.bits.loadDependency), io.ldCancel))
77    }
78    wakeupOH := (if (io.wakeUp.nonEmpty) VecInit(tmp.toSeq).asUInt else 0.U)
79  }
80  val wbMask = reqVecToMask(io.wbPregs)
81  val allocMask = reqVecToMask(io.allocPregs)
82  val wakeUpMask = VecInit(wakeupOHVec.map(_.orR).toSeq).asUInt
83  val cancelMask = pregWB match {
84    case _: IntWB => io.cancel.map(x => Mux(x.valid && x.bits.rfWen, UIntToOH(x.bits.pdest), 0.U)).fold(0.U)(_ | _)
85    case _: VfWB => io.cancel.map(x => Mux(x.valid && (x.bits.fpWen || x.bits.vecWen), UIntToOH(x.bits.pdest), 0.U)).fold(0.U)(_ | _)
86    case _: NoWB => throw new IllegalArgumentException("NoWB is not permitted")
87  }
88  val ldCancelMask = loadDependency.map(x => LoadShouldCancel(Some(x), io.ldCancel))
89
90  loadDependency.zipWithIndex.foreach{ case (ldDp, idx) =>
91    when(allocMask(idx) || cancelMask(idx) || wbMask(idx) || ldCancelMask(idx)) {
92      ldDp := 0.U.asTypeOf(ldDp)
93    }.elsewhen(wakeUpMask(idx)) {
94      ldDp := (if (io.wakeUp.nonEmpty) Mux1H(wakeupOHVec(idx), shiftLoadDependency) else 0.U.asTypeOf(ldDp))
95    }.otherwise {
96      ldDp := VecInit(ldDp.map(x => x(x.getWidth - 2, 0) << 1))
97    }
98  }
99
100  /*
101  we can ensure that the following conditions are mutually exclusive
102  wakeUp and cancel (same pdest) may arrive at the same cycle
103  for a pdest:
104    rename alloc => wakeUp / cancel => ... => wakeUp / cancel => wakeUp
105  or
106    rename alloc => wbMask  //TODO we still need wbMask because wakeUp signal is partial now
107  the bypass state lasts for a maximum of one cycle, cancel(=> busy) or else(=> regFile)
108   */
109  tableUpdate.zipWithIndex.foreach{ case (update, idx) =>
110    when(allocMask(idx) || cancelMask(idx) || ldCancelMask(idx)) {
111      update := true.B                                    //busy
112    }.elsewhen(wakeUpMask(idx) || wbMask(idx)) {
113      update := false.B                                   //ready
114    }.otherwise {
115      update := table(idx)
116    }
117  }
118
119  io.read.foreach{ case res =>
120    res.resp := !table(res.req)
121    res.loadDependency := loadDependency(res.req)
122  }
123
124  table := tableUpdate.asUInt
125
126  val oddTable = table.asBools.zipWithIndex.filter(_._2 % 2 == 1).map(_._1)
127  val evenTable = table.asBools.zipWithIndex.filter(_._2 % 2 == 0).map(_._1)
128  val busyCount = RegNext(RegNext(PopCount(oddTable)) + RegNext(PopCount(evenTable)))
129
130  XSPerfAccumulate("busy_count", PopCount(table))
131
132  val perfEvents = Seq(
133    ("std_freelist_1_4_valid", busyCount < (numPhyPregs / 4).U                                      ),
134    ("std_freelist_2_4_valid", busyCount > (numPhyPregs / 4).U && busyCount <= (numPhyPregs / 2).U    ),
135    ("std_freelist_3_4_valid", busyCount > (numPhyPregs / 2).U && busyCount <= (numPhyPregs * 3 / 4).U),
136    ("std_freelist_4_4_valid", busyCount > (numPhyPregs * 3 / 4).U                                  )
137  )
138  generatePerfEvent()
139}
140