1package xiangshan.backend.issue 2 3import org.chipsalliance.cde.config.Parameters 4import chisel3._ 5import chisel3.util._ 6import freechips.rocketchip.diplomacy.{LazyModule, LazyModuleImp} 7import utility.{GTimer, HasCircularQueuePtrHelper, SelectOne} 8import utils._ 9import xiangshan._ 10import xiangshan.backend.Bundles._ 11import xiangshan.backend.decode.{ImmUnion, Imm_LUI_LOAD} 12import xiangshan.backend.datapath.DataConfig._ 13import xiangshan.backend.datapath.DataSource 14import xiangshan.backend.fu.{FuConfig, FuType} 15import xiangshan.mem.{MemWaitUpdateReq, SqPtr, LqPtr} 16import xiangshan.backend.rob.RobPtr 17import xiangshan.backend.datapath.NewPipelineConnect 18 19class IssueQueue(params: IssueBlockParams)(implicit p: Parameters) extends LazyModule with HasXSParameter { 20 override def shouldBeInlined: Boolean = false 21 22 implicit val iqParams = params 23 lazy val module: IssueQueueImp = iqParams.schdType match { 24 case IntScheduler() => new IssueQueueIntImp(this) 25 case VfScheduler() => new IssueQueueVfImp(this) 26 case MemScheduler() => 27 if (iqParams.StdCnt == 0 && !iqParams.isVecMemIQ) new IssueQueueMemAddrImp(this) 28 else if (iqParams.isVecMemIQ) new IssueQueueVecMemImp(this) 29 else new IssueQueueIntImp(this) 30 case _ => null 31 } 32} 33 34class IssueQueueStatusBundle(numEnq: Int, numEntries: Int) extends Bundle { 35 val empty = Output(Bool()) 36 val full = Output(Bool()) 37 val validCnt = Output(UInt(log2Ceil(numEntries).W)) 38 val leftVec = Output(Vec(numEnq + 1, Bool())) 39} 40 41class IssueQueueDeqRespBundle(implicit p:Parameters, params: IssueBlockParams) extends EntryDeqRespBundle 42 43class IssueQueueIO()(implicit p: Parameters, params: IssueBlockParams) extends XSBundle { 44 // Inputs 45 val flush = Flipped(ValidIO(new Redirect)) 46 val enq = Vec(params.numEnq, Flipped(DecoupledIO(new DynInst))) 47 48 val og0Resp = Vec(params.numDeq, Flipped(ValidIO(new IssueQueueDeqRespBundle))) 49 val og1Resp = Vec(params.numDeq, Flipped(ValidIO(new IssueQueueDeqRespBundle))) 50 val finalIssueResp = OptionWrapper(params.LdExuCnt > 0, Vec(params.LdExuCnt, Flipped(ValidIO(new IssueQueueDeqRespBundle)))) 51 val memAddrIssueResp = OptionWrapper(params.LdExuCnt > 0, Vec(params.LdExuCnt, Flipped(ValidIO(new IssueQueueDeqRespBundle)))) 52 val wbBusyTableRead = Input(params.genWbFuBusyTableReadBundle()) 53 val wbBusyTableWrite = Output(params.genWbFuBusyTableWriteBundle()) 54 val wakeupFromWB: MixedVec[ValidIO[IssueQueueWBWakeUpBundle]] = Flipped(params.genWBWakeUpSinkValidBundle) 55 val wakeupFromIQ: MixedVec[ValidIO[IssueQueueIQWakeUpBundle]] = Flipped(params.genIQWakeUpSinkValidBundle) 56 val og0Cancel = Input(ExuOH(backendParams.numExu)) 57 val og1Cancel = Input(ExuOH(backendParams.numExu)) 58 val ldCancel = Vec(backendParams.LduCnt + backendParams.HyuCnt, Flipped(new LoadCancelIO)) 59 val finalBlock = Vec(params.numExu, Input(Bool())) 60 61 // Outputs 62 val wakeupToIQ: MixedVec[ValidIO[IssueQueueIQWakeUpBundle]] = params.genIQWakeUpSourceValidBundle 63 val status = Output(new IssueQueueStatusBundle(params.numEnq, params.numEntries)) 64 // val statusNext = Output(new IssueQueueStatusBundle(params.numEnq)) 65 66 val deqDelay: MixedVec[DecoupledIO[IssueQueueIssueBundle]] = params.genIssueDecoupledBundle// = deq.cloneType 67 def allWakeUp = wakeupFromWB ++ wakeupFromIQ 68} 69 70class IssueQueueImp(override val wrapper: IssueQueue)(implicit p: Parameters, val params: IssueBlockParams) 71 extends LazyModuleImp(wrapper) 72 with HasXSParameter { 73 74 println(s"[IssueQueueImp] ${params.getIQName} wakeupFromWB(${io.wakeupFromWB.size}), " + 75 s"wakeup exu in(${params.wakeUpInExuSources.size}): ${params.wakeUpInExuSources.map(_.name).mkString("{",",","}")}, " + 76 s"wakeup exu out(${params.wakeUpOutExuSources.size}): ${params.wakeUpOutExuSources.map(_.name).mkString("{",",","}")}, " + 77 s"numEntries: ${params.numEntries}, numRegSrc: ${params.numRegSrc}") 78 79 require(params.numExu <= 2, "IssueQueue has not supported more than 2 deq ports") 80 val deqFuCfgs : Seq[Seq[FuConfig]] = params.exuBlockParams.map(_.fuConfigs) 81 val allDeqFuCfgs : Seq[FuConfig] = params.exuBlockParams.flatMap(_.fuConfigs) 82 val fuCfgsCnt : Map[FuConfig, Int] = allDeqFuCfgs.groupBy(x => x).map { case (cfg, cfgSeq) => (cfg, cfgSeq.length) } 83 val commonFuCfgs : Seq[FuConfig] = fuCfgsCnt.filter(_._2 > 1).keys.toSeq 84 val fuLatencyMaps : Seq[Map[FuType.OHType, Int]] = params.exuBlockParams.map(x => x.fuLatencyMap) 85 86 println(s"[IssueQueueImp] ${params.getIQName} fuLatencyMaps: ${fuLatencyMaps}") 87 println(s"[IssueQueueImp] ${params.getIQName} commonFuCfgs: ${commonFuCfgs.map(_.name)}") 88 lazy val io = IO(new IssueQueueIO()) 89 // Modules 90 91 val entries = Module(new Entries) 92 val fuBusyTableWrite = params.exuBlockParams.map { case x => OptionWrapper(x.latencyValMax > 0, Module(new FuBusyTableWrite(x.fuLatencyMap))) } 93 val fuBusyTableRead = params.exuBlockParams.map { case x => OptionWrapper(x.latencyValMax > 0, Module(new FuBusyTableRead(x.fuLatencyMap))) } 94 val intWbBusyTableWrite = params.exuBlockParams.map { case x => OptionWrapper(x.intLatencyCertain, Module(new FuBusyTableWrite(x.intFuLatencyMap))) } 95 val intWbBusyTableRead = params.exuBlockParams.map { case x => OptionWrapper(x.intLatencyCertain, Module(new FuBusyTableRead(x.intFuLatencyMap))) } 96 val vfWbBusyTableWrite = params.exuBlockParams.map { case x => OptionWrapper(x.vfLatencyCertain, Module(new FuBusyTableWrite(x.vfFuLatencyMap))) } 97 val vfWbBusyTableRead = params.exuBlockParams.map { case x => OptionWrapper(x.vfLatencyCertain, Module(new FuBusyTableRead(x.vfFuLatencyMap))) } 98 99 class WakeupQueueFlush extends Bundle { 100 val redirect = ValidIO(new Redirect) 101 val ldCancel = Vec(backendParams.LduCnt + backendParams.HyuCnt, new LoadCancelIO) 102 val og0Fail = Output(Bool()) 103 val og1Fail = Output(Bool()) 104 val finalFail = Output(Bool()) 105 } 106 107 private def flushFunc(exuInput: ExuInput, flush: WakeupQueueFlush, stage: Int): Bool = { 108 val redirectFlush = exuInput.robIdx.needFlush(flush.redirect) 109 val loadDependencyFlush = LoadShouldCancel(exuInput.loadDependency, flush.ldCancel) 110 val ogFailFlush = stage match { 111 case 1 => flush.og0Fail 112 case 2 => flush.og1Fail 113 case 3 => flush.finalFail 114 case _ => false.B 115 } 116 redirectFlush || loadDependencyFlush || ogFailFlush 117 } 118 119 private def modificationFunc(exuInput: ExuInput): ExuInput = { 120 val newExuInput = WireDefault(exuInput) 121 newExuInput.loadDependency match { 122 case Some(deps) => deps.zip(exuInput.loadDependency.get).foreach(x => x._1 := x._2 << 1) 123 case None => 124 } 125 newExuInput 126 } 127 128 val wakeUpQueues: Seq[Option[MultiWakeupQueue[ExuInput, WakeupQueueFlush]]] = params.exuBlockParams.map { x => OptionWrapper(x.isIQWakeUpSource, Module( 129 new MultiWakeupQueue(new ExuInput(x), new WakeupQueueFlush, x.fuLatancySet, flushFunc, modificationFunc) 130 ))} 131 val deqBeforeDly = Wire(params.genIssueDecoupledBundle) 132 133 val intWbBusyTableIn = io.wbBusyTableRead.map(_.intWbBusyTable) 134 val vfWbBusyTableIn = io.wbBusyTableRead.map(_.vfWbBusyTable) 135 val intWbBusyTableOut = io.wbBusyTableWrite.map(_.intWbBusyTable) 136 val vfWbBusyTableOut = io.wbBusyTableWrite.map(_.vfWbBusyTable) 137 val intDeqRespSetOut = io.wbBusyTableWrite.map(_.intDeqRespSet) 138 val vfDeqRespSetOut = io.wbBusyTableWrite.map(_.vfDeqRespSet) 139 val fuBusyTableMask = Wire(Vec(params.numDeq, UInt(params.numEntries.W))) 140 val intWbBusyTableMask = Wire(Vec(params.numDeq, UInt(params.numEntries.W))) 141 val vfWbBusyTableMask = Wire(Vec(params.numDeq, UInt(params.numEntries.W))) 142 val s0_enqValidVec = io.enq.map(_.valid) 143 val s0_enqSelValidVec = Wire(Vec(params.numEnq, Bool())) 144 val s0_enqNotFlush = !io.flush.valid 145 val s0_enqBits = WireInit(VecInit(io.enq.map(_.bits))) 146 val s0_doEnqSelValidVec = s0_enqSelValidVec.map(_ && s0_enqNotFlush) //enqValid && notFlush && enqReady 147 148 149 val finalDeqSelValidVec = Wire(Vec(params.numDeq, Bool())) 150 val finalDeqSelOHVec = Wire(Vec(params.numDeq, UInt(params.numEntries.W))) 151 152 val validVec = VecInit(entries.io.valid.asBools) 153 val canIssueVec = VecInit(entries.io.canIssue.asBools) 154 val clearVec = VecInit(entries.io.clear.asBools) 155 val deqFirstIssueVec = VecInit(entries.io.deq.map(_.isFirstIssue)) 156 157 val dataSources: Vec[Vec[DataSource]] = entries.io.dataSources 158 val finalDataSources: Vec[Vec[DataSource]] = VecInit(finalDeqSelOHVec.map(oh => Mux1H(oh, dataSources))) 159 // (entryIdx)(srcIdx)(exuIdx) 160 val wakeUpL1ExuOH: Option[Vec[Vec[UInt]]] = entries.io.srcWakeUpL1ExuOH 161 val srcTimer: Option[Vec[Vec[UInt]]] = entries.io.srcTimer 162 163 // (deqIdx)(srcIdx)(exuIdx) 164 val finalWakeUpL1ExuOH: Option[Vec[Vec[UInt]]] = wakeUpL1ExuOH.map(x => VecInit(finalDeqSelOHVec.map(oh => Mux1H(oh, x)))) 165 val finalSrcTimer = srcTimer.map(x => VecInit(finalDeqSelOHVec.map(oh => Mux1H(oh, x)))) 166 167 val fuTypeVec = Wire(Vec(params.numEntries, FuType())) 168 val transEntryDeqVec = Wire(Vec(params.numEnq, ValidIO(new EntryBundle))) 169 val deqEntryVec = Wire(Vec(params.numDeq, ValidIO(new EntryBundle))) 170 val transSelVec = Wire(Vec(params.numEnq, UInt((params.numEntries-params.numEnq).W))) 171 val canIssueMergeAllBusy = Wire(Vec(params.numDeq, UInt(params.numEntries.W))) 172 val deqCanIssue = Wire(Vec(params.numDeq, UInt(params.numEntries.W))) 173 174 val enqEntryOldestSel = Wire(Vec(params.numDeq, ValidIO(UInt(params.numEnq.W)))) 175 val othersEntryOldestSel = Wire(Vec(params.numDeq, ValidIO(UInt((params.numEntries - params.numEnq).W)))) 176 val deqSelValidVec = Wire(Vec(params.numDeq, Bool())) 177 val deqSelOHVec = Wire(Vec(params.numDeq, UInt(params.numEntries.W))) 178 val cancelDeqVec = Wire(Vec(params.numDeq, Bool())) 179 180 val subDeqSelValidVec = OptionWrapper(params.deqFuSame, Wire(Vec(params.numDeq, Bool()))) 181 val subDeqSelOHVec = OptionWrapper(params.deqFuSame, Wire(Vec(params.numDeq, UInt(params.numEntries.W)))) 182 val subDeqRequest = OptionWrapper(params.deqFuSame, Wire(UInt(params.numEntries.W))) 183 184 /** 185 * Connection of [[entries]] 186 */ 187 entries.io match { case entriesIO: EntriesIO => 188 entriesIO.flush <> io.flush 189 entriesIO.wakeUpFromWB := io.wakeupFromWB 190 entriesIO.wakeUpFromIQ := io.wakeupFromIQ 191 entriesIO.og0Cancel := io.og0Cancel 192 entriesIO.og1Cancel := io.og1Cancel 193 entriesIO.ldCancel := io.ldCancel 194 entriesIO.enq.zipWithIndex.foreach { case (enq: ValidIO[EntryBundle], i) => 195 enq.valid := s0_doEnqSelValidVec(i) 196 val numLsrc = s0_enqBits(i).srcType.size.min(enq.bits.status.srcType.size) 197 for (j <- 0 until numLsrc) { 198 enq.bits.status.srcState(j) := s0_enqBits(i).srcState(j) 199 enq.bits.status.psrc(j) := s0_enqBits(i).psrc(j) 200 enq.bits.status.srcType(j) := s0_enqBits(i).srcType(j) 201 enq.bits.status.dataSources(j).value := DataSource.reg 202 enq.bits.payload.debugInfo.enqRsTime := GTimer() 203 } 204 enq.bits.status.fuType := s0_enqBits(i).fuType 205 enq.bits.status.robIdx := s0_enqBits(i).robIdx 206 enq.bits.status.uopIdx.foreach(_ := s0_enqBits(i).uopIdx) 207 enq.bits.status.issueTimer := "b10".U 208 enq.bits.status.deqPortIdx := 0.U 209 enq.bits.status.issued := false.B 210 enq.bits.status.firstIssue := false.B 211 enq.bits.status.blocked := false.B 212 213 if (params.hasIQWakeUp) { 214 enq.bits.status.srcWakeUpL1ExuOH.get := 0.U.asTypeOf(enq.bits.status.srcWakeUpL1ExuOH.get) 215 enq.bits.status.srcTimer.get := 0.U.asTypeOf(enq.bits.status.srcTimer.get) 216 enq.bits.status.srcLoadDependency.get := 0.U.asTypeOf(enq.bits.status.srcLoadDependency.get) 217 } 218 enq.bits.imm := s0_enqBits(i).imm 219 enq.bits.payload := s0_enqBits(i) 220 } 221 entriesIO.deq.zipWithIndex.foreach { case (deq, i) => 222 deq.enqEntryOldestSel := enqEntryOldestSel(i) 223 deq.othersEntryOldestSel := othersEntryOldestSel(i) 224 deq.subDeqRequest.foreach(_ := subDeqRequest.get) 225 deq.subDeqSelOH.foreach(_ := subDeqSelOHVec.get(i)) 226 deq.deqReady := deqBeforeDly(i).ready 227 deq.deqSelOH.valid := deqSelValidVec(i) 228 deq.deqSelOH.bits := deqSelOHVec(i) 229 } 230 entriesIO.og0Resp.zipWithIndex.foreach { case (og0Resp, i) => 231 og0Resp.valid := io.og0Resp(i).valid 232 og0Resp.bits.robIdx := io.og0Resp(i).bits.robIdx 233 og0Resp.bits.uopIdx := io.og0Resp(i).bits.uopIdx 234 og0Resp.bits.dataInvalidSqIdx := io.og0Resp(i).bits.dataInvalidSqIdx 235 og0Resp.bits.respType := io.og0Resp(i).bits.respType 236 og0Resp.bits.rfWen := io.og0Resp(i).bits.rfWen 237 og0Resp.bits.fuType := io.og0Resp(i).bits.fuType 238 } 239 entriesIO.og1Resp.zipWithIndex.foreach { case (og1Resp, i) => 240 og1Resp.valid := io.og1Resp(i).valid 241 og1Resp.bits.robIdx := io.og1Resp(i).bits.robIdx 242 og1Resp.bits.uopIdx := io.og1Resp(i).bits.uopIdx 243 og1Resp.bits.dataInvalidSqIdx := io.og1Resp(i).bits.dataInvalidSqIdx 244 og1Resp.bits.respType := io.og1Resp(i).bits.respType 245 og1Resp.bits.rfWen := io.og1Resp(i).bits.rfWen 246 og1Resp.bits.fuType := io.og1Resp(i).bits.fuType 247 } 248 entriesIO.finalIssueResp.foreach(_.zipWithIndex.foreach { case (finalIssueResp, i) => 249 finalIssueResp := io.finalIssueResp.get(i) 250 }) 251 entriesIO.memAddrIssueResp.foreach(_.zipWithIndex.foreach { case (memAddrIssueResp, i) => 252 memAddrIssueResp := io.memAddrIssueResp.get(i) 253 }) 254 transEntryDeqVec := entriesIO.transEntryDeqVec 255 deqEntryVec := entriesIO.deq.map(_.deqEntry) 256 fuTypeVec := entriesIO.fuType 257 cancelDeqVec := entriesIO.cancelDeqVec 258 transSelVec := entriesIO.transSelVec 259 } 260 261 262 s0_enqSelValidVec := s0_enqValidVec.zip(io.enq).map{ case (enqValid, enq) => enqValid && enq.ready} 263 264 protected val commonAccept: UInt = Cat(fuTypeVec.map(fuType => 265 FuType.FuTypeOrR(fuType, commonFuCfgs.map(_.fuType)) 266 ).reverse) 267 268 // if deq port can accept the uop 269 protected val canAcceptVec: Seq[UInt] = deqFuCfgs.map { fuCfgs: Seq[FuConfig] => 270 Cat(fuTypeVec.map(fuType => 271 FuType.FuTypeOrR(fuType, fuCfgs.map(_.fuType)) 272 ).reverse) 273 } 274 275 protected val deqCanAcceptVec: Seq[IndexedSeq[Bool]] = deqFuCfgs.map { fuCfgs: Seq[FuConfig] => 276 fuTypeVec.map(fuType => 277 FuType.FuTypeOrR(fuType, fuCfgs.map(_.fuType))) 278 } 279 280 canIssueMergeAllBusy.zipWithIndex.foreach { case (merge, i) => 281 val mergeFuBusy = { 282 if (fuBusyTableWrite(i).nonEmpty) canIssueVec.asUInt & (~fuBusyTableMask(i)) 283 else canIssueVec.asUInt 284 } 285 val mergeIntWbBusy = { 286 if (intWbBusyTableRead(i).nonEmpty) mergeFuBusy & (~intWbBusyTableMask(i)) 287 else mergeFuBusy 288 } 289 val mergeVfWbBusy = { 290 if (vfWbBusyTableRead(i).nonEmpty) mergeIntWbBusy & (~vfWbBusyTableMask(i)) 291 else mergeIntWbBusy 292 } 293 merge := mergeVfWbBusy 294 } 295 296 deqCanIssue.zipWithIndex.foreach { case (req, i) => 297 req := canIssueMergeAllBusy(i) & VecInit(deqCanAcceptVec(i)).asUInt 298 } 299 300 if (params.numDeq == 2) { 301 require(params.deqFuSame || params.deqFuDiff, "The 2 deq ports need to be identical or completely different") 302 } 303 304 if (params.numDeq == 2 && params.deqFuSame) { 305 enqEntryOldestSel := DontCare 306 307 othersEntryOldestSel(0) := AgeDetector(numEntries = params.numEntries - params.numEnq, 308 enq = VecInit(transEntryDeqVec.zip(transSelVec).map{ case (transEntry, transSel) => Fill(params.numEntries-params.numEnq, transEntry.valid) & transSel }), 309 canIssue = canIssueVec.asUInt(params.numEntries-1, params.numEnq) 310 ) 311 othersEntryOldestSel(1) := DontCare 312 313 subDeqRequest.get := canIssueVec.asUInt & ~Cat(othersEntryOldestSel(0).bits, 0.U((params.numEnq).W)) 314 315 val subDeqPolicy = Module(new DeqPolicy()) 316 subDeqPolicy.io.request := subDeqRequest.get 317 subDeqSelValidVec.get := subDeqPolicy.io.deqSelOHVec.map(oh => oh.valid) 318 subDeqSelOHVec.get := subDeqPolicy.io.deqSelOHVec.map(oh => oh.bits) 319 320 deqSelValidVec(0) := othersEntryOldestSel(0).valid || subDeqSelValidVec.get(1) 321 deqSelValidVec(1) := subDeqSelValidVec.get(0) 322 deqSelOHVec(0) := Mux(othersEntryOldestSel(0).valid, 323 Cat(othersEntryOldestSel(0).bits, 0.U((params.numEnq).W)), 324 subDeqSelOHVec.get(1)) & canIssueMergeAllBusy(0) 325 deqSelOHVec(1) := subDeqSelOHVec.get(0) & canIssueMergeAllBusy(1) 326 327 finalDeqSelValidVec.zip(finalDeqSelOHVec).zip(deqSelValidVec).zip(deqSelOHVec).zipWithIndex.foreach { case ((((selValid, selOH), deqValid), deqOH), i) => 328 selValid := deqValid && deqOH.orR && deqBeforeDly(i).ready 329 selOH := deqOH 330 } 331 } 332 else { 333 enqEntryOldestSel := NewAgeDetector(numEntries = params.numEnq, 334 enq = VecInit(s0_doEnqSelValidVec), 335 canIssue = VecInit(deqCanIssue.map(_(params.numEnq-1, 0))) 336 ) 337 338 othersEntryOldestSel := AgeDetector(numEntries = params.numEntries - params.numEnq, 339 enq = VecInit(transEntryDeqVec.zip(transSelVec).map{ case (transEntry, transSel) => Fill(params.numEntries-params.numEnq, transEntry.valid) & transSel }), 340 canIssue = VecInit(deqCanIssue.map(_(params.numEntries-1, params.numEnq))) 341 ) 342 343 deqSelValidVec.zip(deqSelOHVec).zipWithIndex.foreach { case ((selValid, selOH), i) => 344 if (params.exuBlockParams(i).fuConfigs.contains(FuConfig.FakeHystaCfg)) { 345 selValid := false.B 346 selOH := 0.U.asTypeOf(selOH) 347 } else { 348 selValid := othersEntryOldestSel(i).valid || enqEntryOldestSel(i).valid 349 selOH := Cat(othersEntryOldestSel(i).bits, Fill(params.numEnq, enqEntryOldestSel(i).valid && !othersEntryOldestSel(i).valid) & enqEntryOldestSel(i).bits) 350 } 351 } 352 353 finalDeqSelValidVec.zip(finalDeqSelOHVec).zip(deqSelValidVec).zip(deqSelOHVec).zipWithIndex.foreach { case ((((selValid, selOH), deqValid), deqOH), i) => 354 selValid := deqValid && deqBeforeDly(i).ready 355 selOH := deqOH 356 } 357 } 358 359 val toBusyTableDeqResp = Wire(Vec(params.numDeq, ValidIO(new IssueQueueDeqRespBundle))) 360 361 toBusyTableDeqResp.zipWithIndex.foreach { case (deqResp, i) => 362 deqResp.valid := finalDeqSelValidVec(i) 363 deqResp.bits.respType := RSFeedbackType.issueSuccess 364 deqResp.bits.robIdx := DontCare 365 deqResp.bits.dataInvalidSqIdx := DontCare 366 deqResp.bits.rfWen := DontCare 367 deqResp.bits.fuType := deqBeforeDly(i).bits.common.fuType 368 deqResp.bits.uopIdx := DontCare 369 } 370 371 //fuBusyTable 372 fuBusyTableWrite.zip(fuBusyTableRead).zipWithIndex.foreach { case ((busyTableWrite: Option[FuBusyTableWrite], busyTableRead: Option[FuBusyTableRead]), i) => 373 if(busyTableWrite.nonEmpty) { 374 val btwr = busyTableWrite.get 375 val btrd = busyTableRead.get 376 btwr.io.in.deqResp := toBusyTableDeqResp(i) 377 btwr.io.in.og0Resp := io.og0Resp(i) 378 btwr.io.in.og1Resp := io.og1Resp(i) 379 btrd.io.in.fuBusyTable := btwr.io.out.fuBusyTable 380 btrd.io.in.fuTypeRegVec := fuTypeVec 381 fuBusyTableMask(i) := btrd.io.out.fuBusyTableMask 382 } 383 else { 384 fuBusyTableMask(i) := 0.U(params.numEntries.W) 385 } 386 } 387 388 //wbfuBusyTable write 389 intWbBusyTableWrite.zip(intWbBusyTableOut).zip(intDeqRespSetOut).zipWithIndex.foreach { case (((busyTableWrite: Option[FuBusyTableWrite], busyTable: Option[UInt]), deqResp), i) => 390 if(busyTableWrite.nonEmpty) { 391 val btwr = busyTableWrite.get 392 val bt = busyTable.get 393 val dq = deqResp.get 394 btwr.io.in.deqResp := toBusyTableDeqResp(i) 395 btwr.io.in.og0Resp := io.og0Resp(i) 396 btwr.io.in.og1Resp := io.og1Resp(i) 397 bt := btwr.io.out.fuBusyTable 398 dq := btwr.io.out.deqRespSet 399 } 400 } 401 402 vfWbBusyTableWrite.zip(vfWbBusyTableOut).zip(vfDeqRespSetOut).zipWithIndex.foreach { case (((busyTableWrite: Option[FuBusyTableWrite], busyTable: Option[UInt]), deqResp), i) => 403 if (busyTableWrite.nonEmpty) { 404 val btwr = busyTableWrite.get 405 val bt = busyTable.get 406 val dq = deqResp.get 407 btwr.io.in.deqResp := toBusyTableDeqResp(i) 408 btwr.io.in.og0Resp := io.og0Resp(i) 409 btwr.io.in.og1Resp := io.og1Resp(i) 410 bt := btwr.io.out.fuBusyTable 411 dq := btwr.io.out.deqRespSet 412 } 413 } 414 415 //wbfuBusyTable read 416 intWbBusyTableRead.zip(intWbBusyTableIn).zipWithIndex.foreach { case ((busyTableRead: Option[FuBusyTableRead], busyTable: Option[UInt]), i) => 417 if(busyTableRead.nonEmpty) { 418 val btrd = busyTableRead.get 419 val bt = busyTable.get 420 btrd.io.in.fuBusyTable := bt 421 btrd.io.in.fuTypeRegVec := fuTypeVec 422 intWbBusyTableMask(i) := btrd.io.out.fuBusyTableMask 423 } 424 else { 425 intWbBusyTableMask(i) := 0.U(params.numEntries.W) 426 } 427 } 428 vfWbBusyTableRead.zip(vfWbBusyTableIn).zipWithIndex.foreach { case ((busyTableRead: Option[FuBusyTableRead], busyTable: Option[UInt]), i) => 429 if (busyTableRead.nonEmpty) { 430 val btrd = busyTableRead.get 431 val bt = busyTable.get 432 btrd.io.in.fuBusyTable := bt 433 btrd.io.in.fuTypeRegVec := fuTypeVec 434 vfWbBusyTableMask(i) := btrd.io.out.fuBusyTableMask 435 } 436 else { 437 vfWbBusyTableMask(i) := 0.U(params.numEntries.W) 438 } 439 } 440 441 wakeUpQueues.zipWithIndex.foreach { case (wakeUpQueueOption, i) => 442 val og0RespEach = io.og0Resp(i) 443 val og1RespEach = io.og1Resp(i) 444 wakeUpQueueOption.foreach { 445 wakeUpQueue => 446 val flush = Wire(new WakeupQueueFlush) 447 flush.redirect := io.flush 448 flush.ldCancel := io.ldCancel 449 flush.og0Fail := io.og0Resp(i).valid && RSFeedbackType.isBlocked(io.og0Resp(i).bits.respType) 450 flush.og1Fail := io.og1Resp(i).valid && RSFeedbackType.isBlocked(io.og1Resp(i).bits.respType) 451 flush.finalFail := io.finalBlock(i) 452 wakeUpQueue.io.flush := flush 453 wakeUpQueue.io.enq.valid := deqBeforeDly(i).fire && { 454 deqBeforeDly(i).bits.common.rfWen.getOrElse(false.B) && deqBeforeDly(i).bits.common.pdest =/= 0.U || 455 deqBeforeDly(i).bits.common.fpWen.getOrElse(false.B) || 456 deqBeforeDly(i).bits.common.vecWen.getOrElse(false.B) 457 } 458 wakeUpQueue.io.enq.bits.uop := deqBeforeDly(i).bits.common 459 wakeUpQueue.io.enq.bits.lat := getDeqLat(i, deqBeforeDly(i).bits.common.fuType) 460 wakeUpQueue.io.og0IssueFail := flush.og0Fail 461 wakeUpQueue.io.og1IssueFail := flush.og1Fail 462 } 463 } 464 465 deqBeforeDly.zipWithIndex.foreach { case (deq, i) => 466 deq.valid := finalDeqSelValidVec(i) && !cancelDeqVec(i) 467 deq.bits.addrOH := finalDeqSelOHVec(i) 468 deq.bits.common.isFirstIssue := deqFirstIssueVec(i) 469 deq.bits.common.iqIdx := OHToUInt(finalDeqSelOHVec(i)) 470 deq.bits.common.fuType := deqEntryVec(i).bits.payload.fuType 471 deq.bits.common.fuOpType := deqEntryVec(i).bits.payload.fuOpType 472 deq.bits.common.rfWen.foreach(_ := deqEntryVec(i).bits.payload.rfWen) 473 deq.bits.common.fpWen.foreach(_ := deqEntryVec(i).bits.payload.fpWen) 474 deq.bits.common.vecWen.foreach(_ := deqEntryVec(i).bits.payload.vecWen) 475 deq.bits.common.flushPipe.foreach(_ := deqEntryVec(i).bits.payload.flushPipe) 476 deq.bits.common.pdest := deqEntryVec(i).bits.payload.pdest 477 deq.bits.common.robIdx := deqEntryVec(i).bits.payload.robIdx 478 deq.bits.common.dataSources.zip(finalDataSources(i)).zipWithIndex.foreach { 479 case ((sink, source), srcIdx) => 480 sink.value := Mux( 481 SrcType.isXp(deqEntryVec(i).bits.payload.srcType(srcIdx)) && deqEntryVec(i).bits.payload.psrc(srcIdx) === 0.U, 482 DataSource.none, 483 source.value 484 ) 485 } 486 deq.bits.common.l1ExuOH.foreach(_ := finalWakeUpL1ExuOH.get(i)) 487 deq.bits.common.srcTimer.foreach(_ := finalSrcTimer.get(i)) 488 deq.bits.common.loadDependency.foreach(_ := deqEntryVec(i).bits.status.mergedLoadDependency.get) 489 deq.bits.common.deqLdExuIdx.foreach(_ := params.backendParam.getLdExuIdx(deq.bits.exuParams).U) 490 deq.bits.common.src := DontCare 491 deq.bits.common.preDecode.foreach(_ := deqEntryVec(i).bits.payload.preDecodeInfo) 492 493 deq.bits.rf.zip(deqEntryVec(i).bits.payload.psrc).foreach { case (rf, psrc) => 494 rf.foreach(_.addr := psrc) // psrc in payload array can be pregIdx of IntRegFile or VfRegFile 495 } 496 deq.bits.rf.zip(deqEntryVec(i).bits.payload.srcType).foreach { case (rf, srcType) => 497 rf.foreach(_.srcType := srcType) // psrc in payload array can be pregIdx of IntRegFile or VfRegFile 498 } 499 deq.bits.srcType.zip(deqEntryVec(i).bits.payload.srcType).foreach { case (sink, source) => 500 sink := source 501 } 502 deq.bits.immType := deqEntryVec(i).bits.payload.selImm 503 504 if (params.inIntSchd && params.AluCnt > 0) { 505 // dirty code for lui+addi(w) fusion 506 val isLuiAddiFusion = deqEntryVec(i).bits.payload.isLUI32 507 val luiImm = Cat(deqEntryVec(i).bits.payload.lsrc(1), deqEntryVec(i).bits.payload.lsrc(0), deqEntryVec(i).bits.imm(ImmUnion.maxLen - 1, 0)) 508 deq.bits.common.imm := Mux(isLuiAddiFusion, ImmUnion.LUI32.toImm32(luiImm), deqEntryVec(i).bits.imm) 509 } 510 else if (params.inMemSchd && params.LduCnt > 0) { 511 // dirty code for fused_lui_load 512 val isLuiLoadFusion = SrcType.isNotReg(deqEntryVec(i).bits.payload.srcType(0)) && FuType.isLoad(deqEntryVec(i).bits.payload.fuType) 513 deq.bits.common.imm := Mux(isLuiLoadFusion, Imm_LUI_LOAD().getLuiImm(deqEntryVec(i).bits.payload), deqEntryVec(i).bits.imm) 514 } 515 else { 516 deq.bits.common.imm := deqEntryVec(i).bits.imm 517 } 518 519 deq.bits.common.perfDebugInfo := deqEntryVec(i).bits.payload.debugInfo 520 deq.bits.common.perfDebugInfo.selectTime := GTimer() 521 deq.bits.common.perfDebugInfo.issueTime := GTimer() + 1.U 522 } 523 524 private val deqShift = WireDefault(deqBeforeDly) 525 deqShift.zip(deqBeforeDly).foreach { 526 case (shifted, original) => 527 original.ready := shifted.ready // this will not cause combinational loop 528 shifted.bits.common.loadDependency.foreach( 529 _ := original.bits.common.loadDependency.get.map(_ << 1) 530 ) 531 } 532 io.deqDelay.zip(deqShift).foreach { case (deqDly, deq) => 533 NewPipelineConnect( 534 deq, deqDly, deqDly.valid, 535 false.B, 536 Option("Scheduler2DataPathPipe") 537 ) 538 } 539 if(backendParams.debugEn) { 540 dontTouch(io.deqDelay) 541 } 542 io.wakeupToIQ.zipWithIndex.foreach { case (wakeup, i) => 543 if (wakeUpQueues(i).nonEmpty && finalWakeUpL1ExuOH.nonEmpty) { 544 wakeup.valid := wakeUpQueues(i).get.io.deq.valid 545 wakeup.bits.fromExuInput(wakeUpQueues(i).get.io.deq.bits, finalWakeUpL1ExuOH.get(i)) 546 wakeup.bits.loadDependency := wakeUpQueues(i).get.io.deq.bits.loadDependency.getOrElse(0.U.asTypeOf(wakeup.bits.loadDependency)) 547 } else if (wakeUpQueues(i).nonEmpty) { 548 wakeup.valid := wakeUpQueues(i).get.io.deq.valid 549 wakeup.bits.fromExuInput(wakeUpQueues(i).get.io.deq.bits) 550 wakeup.bits.loadDependency := wakeUpQueues(i).get.io.deq.bits.loadDependency.getOrElse(0.U.asTypeOf(wakeup.bits.loadDependency)) 551 } else { 552 wakeup.valid := false.B 553 wakeup.bits := 0.U.asTypeOf(wakeup.bits) 554 } 555 } 556 557 // Todo: better counter implementation 558 private val enqHasValid = validVec.take(params.numEnq).reduce(_ | _) 559 private val enqEntryValidCnt = PopCount(validVec.take(params.numEnq)) 560 private val othersValidCnt = PopCount(validVec.drop(params.numEnq)) 561 io.status.leftVec(0) := validVec.drop(params.numEnq).reduce(_ & _) 562 for (i <- 0 until params.numEnq) { 563 io.status.leftVec(i + 1) := othersValidCnt === (params.numEntries - params.numEnq - (i + 1)).U 564 } 565 private val othersLeftOneCaseVec = Wire(Vec(params.numEntries - params.numEnq, UInt((params.numEntries - params.numEnq).W))) 566 othersLeftOneCaseVec.zipWithIndex.foreach { case (leftone, i) => 567 leftone := ~(1.U((params.numEntries - params.numEnq).W) << i) 568 } 569 private val othersLeftOne = othersLeftOneCaseVec.map(_ === VecInit(validVec.drop(params.numEnq)).asUInt).reduce(_ | _) 570 private val othersCanotIn = othersLeftOne || validVec.drop(params.numEnq).reduce(_ & _) 571 572 io.enq.foreach(_.ready := !othersCanotIn || !enqHasValid) 573 io.status.empty := !Cat(validVec).orR 574 io.status.full := othersCanotIn 575 io.status.validCnt := PopCount(validVec) 576 577 protected def getDeqLat(deqPortIdx: Int, fuType: UInt) : UInt = { 578 Mux1H(fuLatencyMaps(deqPortIdx) map { case (k, v) => (fuType(k.id), v.U) }) 579 } 580 581 // issue perf counter 582 // enq count 583 XSPerfAccumulate("enq_valid_cnt", PopCount(io.enq.map(_.fire))) 584 XSPerfAccumulate("enq_fire_cnt", PopCount(io.enq.map(_.fire))) 585 // valid count 586 XSPerfHistogram("enq_entry_valid_cnt", enqEntryValidCnt, true.B, 0, params.numEnq + 1) 587 XSPerfHistogram("other_entry_valid_cnt", othersValidCnt, true.B, 0, params.numEntries - params.numEnq + 1) 588 XSPerfHistogram("valid_cnt", PopCount(validVec), true.B, 0, params.numEntries + 1) 589 // only split when more than 1 func type 590 if (params.getFuCfgs.size > 0) { 591 for (t <- FuType.functionNameMap.keys) { 592 val fuName = FuType.functionNameMap(t) 593 if (params.getFuCfgs.map(_.fuType == t).reduce(_ | _)) { 594 XSPerfHistogram(s"valid_cnt_hist_futype_${fuName}", PopCount(validVec.zip(fuTypeVec).map { case (v, fu) => v && fu === t.U }), true.B, 0, params.numEntries, 1) 595 } 596 } 597 } 598 // ready instr count 599 private val readyEntriesCnt = PopCount(validVec.zip(canIssueVec).map(x => x._1 && x._2)) 600 XSPerfHistogram("ready_cnt", readyEntriesCnt, true.B, 0, params.numEntries + 1) 601 // only split when more than 1 func type 602 if (params.getFuCfgs.size > 0) { 603 for (t <- FuType.functionNameMap.keys) { 604 val fuName = FuType.functionNameMap(t) 605 if (params.getFuCfgs.map(_.fuType == t).reduce(_ | _)) { 606 XSPerfHistogram(s"ready_cnt_hist_futype_${fuName}", PopCount(validVec.zip(canIssueVec).zip(fuTypeVec).map { case ((v, c), fu) => v && c && fu === t.U }), true.B, 0, params.numEntries, 1) 607 } 608 } 609 } 610 611 // deq instr count 612 XSPerfAccumulate("issue_instr_pre_count", PopCount(deqBeforeDly.map(_.valid))) 613 XSPerfHistogram("issue_instr_pre_count_hist", PopCount(deqBeforeDly.map(_.valid)), true.B, 0, params.numDeq + 1, 1) 614 XSPerfAccumulate("issue_instr_count", PopCount(io.deqDelay.map(_.valid))) 615 XSPerfHistogram("issue_instr_count_hist", PopCount(io.deqDelay.map(_.valid)), true.B, 0, params.numDeq + 1, 1) 616 617 // deq instr data source count 618 XSPerfAccumulate("issue_datasource_reg", deqBeforeDly.map{ deq => 619 PopCount(deq.bits.common.dataSources.zipWithIndex.map{ case (ds, j) => deq.valid && ds.value === DataSource.reg && !SrcType.isNotReg(deq.bits.srcType(j)) }) 620 }.reduce(_ +& _)) 621 XSPerfAccumulate("issue_datasource_bypass", deqBeforeDly.map{ deq => 622 PopCount(deq.bits.common.dataSources.zipWithIndex.map{ case (ds, j) => deq.valid && ds.value === DataSource.bypass && !SrcType.isNotReg(deq.bits.srcType(j)) }) 623 }.reduce(_ +& _)) 624 XSPerfAccumulate("issue_datasource_forward", deqBeforeDly.map{ deq => 625 PopCount(deq.bits.common.dataSources.zipWithIndex.map{ case (ds, j) => deq.valid && ds.value === DataSource.forward && !SrcType.isNotReg(deq.bits.srcType(j)) }) 626 }.reduce(_ +& _)) 627 XSPerfAccumulate("issue_datasource_noreg", deqBeforeDly.map{ deq => 628 PopCount(deq.bits.common.dataSources.zipWithIndex.map{ case (ds, j) => deq.valid && SrcType.isNotReg(deq.bits.srcType(j)) }) 629 }.reduce(_ +& _)) 630 631 XSPerfHistogram("issue_datasource_reg_hist", deqBeforeDly.map{ deq => 632 PopCount(deq.bits.common.dataSources.zipWithIndex.map{ case (ds, j) => deq.valid && ds.value === DataSource.reg && !SrcType.isNotReg(deq.bits.srcType(j)) }) 633 }.reduce(_ +& _), true.B, 0, params.numDeq * params.numRegSrc + 1, 1) 634 XSPerfHistogram("issue_datasource_bypass_hist", deqBeforeDly.map{ deq => 635 PopCount(deq.bits.common.dataSources.zipWithIndex.map{ case (ds, j) => deq.valid && ds.value === DataSource.bypass && !SrcType.isNotReg(deq.bits.srcType(j)) }) 636 }.reduce(_ +& _), true.B, 0, params.numDeq * params.numRegSrc + 1, 1) 637 XSPerfHistogram("issue_datasource_forward_hist", deqBeforeDly.map{ deq => 638 PopCount(deq.bits.common.dataSources.zipWithIndex.map{ case (ds, j) => deq.valid && ds.value === DataSource.forward && !SrcType.isNotReg(deq.bits.srcType(j)) }) 639 }.reduce(_ +& _), true.B, 0, params.numDeq * params.numRegSrc + 1, 1) 640 XSPerfHistogram("issue_datasource_noreg_hist", deqBeforeDly.map{ deq => 641 PopCount(deq.bits.common.dataSources.zipWithIndex.map{ case (ds, j) => deq.valid && SrcType.isNotReg(deq.bits.srcType(j)) }) 642 }.reduce(_ +& _), true.B, 0, params.numDeq * params.numRegSrc + 1, 1) 643 644 // deq instr data source count for each futype 645 for (t <- FuType.functionNameMap.keys) { 646 val fuName = FuType.functionNameMap(t) 647 if (params.getFuCfgs.map(_.fuType == t).reduce(_ | _)) { 648 XSPerfAccumulate(s"issue_datasource_reg_futype_${fuName}", deqBeforeDly.map{ deq => 649 PopCount(deq.bits.common.dataSources.zipWithIndex.map{ case (ds, j) => deq.valid && ds.value === DataSource.reg && !SrcType.isNotReg(deq.bits.srcType(j)) && deq.bits.common.fuType === t.U }) 650 }.reduce(_ +& _)) 651 XSPerfAccumulate(s"issue_datasource_bypass_futype_${fuName}", deqBeforeDly.map{ deq => 652 PopCount(deq.bits.common.dataSources.zipWithIndex.map{ case (ds, j) => deq.valid && ds.value === DataSource.bypass && !SrcType.isNotReg(deq.bits.srcType(j)) && deq.bits.common.fuType === t.U }) 653 }.reduce(_ +& _)) 654 XSPerfAccumulate(s"issue_datasource_forward_futype_${fuName}", deqBeforeDly.map{ deq => 655 PopCount(deq.bits.common.dataSources.zipWithIndex.map{ case (ds, j) => deq.valid && ds.value === DataSource.forward && !SrcType.isNotReg(deq.bits.srcType(j)) && deq.bits.common.fuType === t.U }) 656 }.reduce(_ +& _)) 657 XSPerfAccumulate(s"issue_datasource_noreg_futype_${fuName}", deqBeforeDly.map{ deq => 658 PopCount(deq.bits.common.dataSources.zipWithIndex.map{ case (ds, j) => deq.valid && SrcType.isNotReg(deq.bits.srcType(j)) && deq.bits.common.fuType === t.U }) 659 }.reduce(_ +& _)) 660 661 XSPerfHistogram(s"issue_datasource_reg_hist_futype_${fuName}", deqBeforeDly.map{ deq => 662 PopCount(deq.bits.common.dataSources.zipWithIndex.map{ case (ds, j) => deq.valid && ds.value === DataSource.reg && !SrcType.isNotReg(deq.bits.srcType(j)) && deq.bits.common.fuType === t.U }) 663 }.reduce(_ +& _), true.B, 0, params.numDeq * params.numRegSrc + 1, 1) 664 XSPerfHistogram(s"issue_datasource_bypass_hist_futype_${fuName}", deqBeforeDly.map{ deq => 665 PopCount(deq.bits.common.dataSources.zipWithIndex.map{ case (ds, j) => deq.valid && ds.value === DataSource.bypass && !SrcType.isNotReg(deq.bits.srcType(j)) && deq.bits.common.fuType === t.U }) 666 }.reduce(_ +& _), true.B, 0, params.numDeq * params.numRegSrc + 1, 1) 667 XSPerfHistogram(s"issue_datasource_forward_hist_futype_${fuName}", deqBeforeDly.map{ deq => 668 PopCount(deq.bits.common.dataSources.zipWithIndex.map{ case (ds, j) => deq.valid && ds.value === DataSource.forward && !SrcType.isNotReg(deq.bits.srcType(j)) && deq.bits.common.fuType === t.U }) 669 }.reduce(_ +& _), true.B, 0, params.numDeq * params.numRegSrc + 1, 1) 670 XSPerfHistogram(s"issue_datasource_noreg_hist_futype_${fuName}", deqBeforeDly.map{ deq => 671 PopCount(deq.bits.common.dataSources.zipWithIndex.map{ case (ds, j) => deq.valid && SrcType.isNotReg(deq.bits.srcType(j)) && deq.bits.common.fuType === t.U }) 672 }.reduce(_ +& _), true.B, 0, params.numDeq * params.numRegSrc + 1, 1) 673 } 674 } 675 676 // cancel instr count 677 if (params.hasIQWakeUp) { 678 val cancelVec: Vec[Bool] = entries.io.cancel.get 679 XSPerfAccumulate("cancel_instr_count", PopCount(validVec.zip(cancelVec).map(x => x._1 & x._2))) 680 XSPerfHistogram("cancel_instr_hist", PopCount(validVec.zip(cancelVec).map(x => x._1 & x._2)), true.B, 0, params.numEntries, 1) 681 for (t <- FuType.functionNameMap.keys) { 682 val fuName = FuType.functionNameMap(t) 683 if (params.getFuCfgs.map(_.fuType == t).reduce(_ | _)) { 684 XSPerfAccumulate(s"cancel_instr_count_futype_${fuName}", PopCount(validVec.zip(cancelVec).zip(fuTypeVec).map{ case ((x, y), fu) => x & y & fu === t.U })) 685 XSPerfHistogram(s"cancel_instr_hist_futype_${fuName}", PopCount(validVec.zip(cancelVec).zip(fuTypeVec).map{ case ((x, y), fu) => x & y & fu === t.U }), true.B, 0, params.numEntries, 1) 686 } 687 } 688 } 689} 690 691class IssueQueueJumpBundle extends Bundle { 692 val pc = UInt(VAddrData().dataWidth.W) 693} 694 695class IssueQueueLoadBundle(implicit p: Parameters) extends XSBundle { 696 val fastMatch = UInt(backendParams.LduCnt.W) 697 val fastImm = UInt(12.W) 698} 699 700class IssueQueueIntIO()(implicit p: Parameters, params: IssueBlockParams) extends IssueQueueIO 701 702class IssueQueueIntImp(override val wrapper: IssueQueue)(implicit p: Parameters, iqParams: IssueBlockParams) 703 extends IssueQueueImp(wrapper) 704{ 705 io.suggestName("none") 706 override lazy val io = IO(new IssueQueueIntIO).suggestName("io") 707 708 if(params.needPc) { 709 entries.io.enq.zipWithIndex.foreach { case (entriesEnq, i) => 710 entriesEnq.bits.status.pc.foreach(_ := io.enq(i).bits.pc) 711 } 712 } 713 714 deqBeforeDly.zipWithIndex.foreach{ case (deq, i) => { 715 deq.bits.common.pc.foreach(_ := deqEntryVec(i).bits.status.pc.get) 716 deq.bits.common.preDecode.foreach(_ := deqEntryVec(i).bits.payload.preDecodeInfo) 717 deq.bits.common.ftqIdx.foreach(_ := deqEntryVec(i).bits.payload.ftqPtr) 718 deq.bits.common.ftqOffset.foreach(_ := deqEntryVec(i).bits.payload.ftqOffset) 719 deq.bits.common.predictInfo.foreach(x => { 720 x.target := DontCare 721 x.taken := deqEntryVec(i).bits.payload.pred_taken 722 }) 723 // for std 724 deq.bits.common.sqIdx.foreach(_ := deqEntryVec(i).bits.payload.sqIdx) 725 // for i2f 726 deq.bits.common.fpu.foreach(_ := deqEntryVec(i).bits.payload.fpu) 727 }} 728} 729 730class IssueQueueVfImp(override val wrapper: IssueQueue)(implicit p: Parameters, iqParams: IssueBlockParams) 731 extends IssueQueueImp(wrapper) 732{ 733 s0_enqBits.foreach{ x => 734 x.srcType(3) := SrcType.vp // v0: mask src 735 x.srcType(4) := SrcType.vp // vl&vtype 736 } 737 deqBeforeDly.zipWithIndex.foreach{ case (deq, i) => { 738 deq.bits.common.fpu.foreach(_ := deqEntryVec(i).bits.payload.fpu) 739 deq.bits.common.vpu.foreach(_ := deqEntryVec(i).bits.payload.vpu) 740 deq.bits.common.vpu.foreach(_.vuopIdx := deqEntryVec(i).bits.payload.uopIdx) 741 deq.bits.common.vpu.foreach(_.lastUop := deqEntryVec(i).bits.payload.lastUop) 742 }} 743} 744 745class IssueQueueMemBundle(implicit p: Parameters, params: IssueBlockParams) extends Bundle { 746 val feedbackIO = Flipped(Vec(params.numDeq, new MemRSFeedbackIO)) 747 val checkWait = new Bundle { 748 val stIssuePtr = Input(new SqPtr) 749 val memWaitUpdateReq = Flipped(new MemWaitUpdateReq) 750 } 751 val loadFastMatch = Output(Vec(params.LduCnt, new IssueQueueLoadBundle)) 752 753 // vector 754 val sqDeqPtr = OptionWrapper(params.isVecMemIQ, Input(new SqPtr)) 755 val lqDeqPtr = OptionWrapper(params.isVecMemIQ, Input(new LqPtr)) 756} 757 758class IssueQueueMemIO(implicit p: Parameters, params: IssueBlockParams) extends IssueQueueIO { 759 val memIO = Some(new IssueQueueMemBundle) 760} 761 762class IssueQueueMemAddrImp(override val wrapper: IssueQueue)(implicit p: Parameters, params: IssueBlockParams) 763 extends IssueQueueImp(wrapper) with HasCircularQueuePtrHelper { 764 765 require(params.StdCnt == 0 && (params.LduCnt + params.StaCnt + params.HyuCnt + params.VlduCnt) > 0, "IssueQueueMemAddrImp can only be instance of MemAddr IQ, " + 766 s"StdCnt: ${params.StdCnt}, LduCnt: ${params.LduCnt}, StaCnt: ${params.StaCnt}, HyuCnt: ${params.HyuCnt}") 767 println(s"[IssueQueueMemAddrImp] StdCnt: ${params.StdCnt}, LduCnt: ${params.LduCnt}, StaCnt: ${params.StaCnt}, HyuCnt: ${params.HyuCnt}") 768 769 io.suggestName("none") 770 override lazy val io = IO(new IssueQueueMemIO).suggestName("io") 771 private val memIO = io.memIO.get 772 773 memIO.loadFastMatch := 0.U.asTypeOf(memIO.loadFastMatch) // TODO: is still needed? 774 775 for (i <- io.enq.indices) { 776 val blockNotReleased = isAfter(io.enq(i).bits.sqIdx, memIO.checkWait.stIssuePtr) 777 val storeAddrWaitForIsIssuing = VecInit((0 until StorePipelineWidth).map(i => { 778 memIO.checkWait.memWaitUpdateReq.robIdx(i).valid && 779 memIO.checkWait.memWaitUpdateReq.robIdx(i).bits.value === io.enq(i).bits.waitForRobIdx.value 780 })).asUInt.orR && !io.enq(i).bits.loadWaitStrict // is waiting for store addr ready 781 s0_enqBits(i).loadWaitBit := io.enq(i).bits.loadWaitBit && !storeAddrWaitForIsIssuing && blockNotReleased 782 // when have vpu 783 if (params.VlduCnt > 0 || params.VstuCnt > 0) { 784 s0_enqBits(i).srcType(3) := SrcType.vp // v0: mask src 785 s0_enqBits(i).srcType(4) := SrcType.vp // vl&vtype 786 } 787 } 788 789 for (i <- entries.io.enq.indices) { 790 entries.io.enq(i).bits.status match { case enqData => 791 enqData.blocked := false.B // s0_enqBits(i).loadWaitBit 792 enqData.mem.get.strictWait := s0_enqBits(i).loadWaitStrict 793 enqData.mem.get.waitForStd := false.B 794 enqData.mem.get.waitForRobIdx := s0_enqBits(i).waitForRobIdx 795 enqData.mem.get.waitForSqIdx := 0.U.asTypeOf(enqData.mem.get.waitForSqIdx) // generated by sq, will be updated later 796 enqData.mem.get.sqIdx := s0_enqBits(i).sqIdx 797 } 798 799 entries.io.fromMem.get.slowResp.zipWithIndex.foreach { case (slowResp, i) => 800 slowResp.valid := memIO.feedbackIO(i).feedbackSlow.valid 801 slowResp.bits.robIdx := memIO.feedbackIO(i).feedbackSlow.bits.robIdx 802 slowResp.bits.uopIdx := DontCare 803 slowResp.bits.respType := Mux(memIO.feedbackIO(i).feedbackSlow.bits.hit, RSFeedbackType.fuIdle, RSFeedbackType.feedbackInvalid) 804 slowResp.bits.dataInvalidSqIdx := memIO.feedbackIO(i).feedbackSlow.bits.dataInvalidSqIdx 805 slowResp.bits.rfWen := DontCare 806 slowResp.bits.fuType := DontCare 807 } 808 809 entries.io.fromMem.get.fastResp.zipWithIndex.foreach { case (fastResp, i) => 810 fastResp.valid := memIO.feedbackIO(i).feedbackFast.valid 811 fastResp.bits.robIdx := memIO.feedbackIO(i).feedbackFast.bits.robIdx 812 fastResp.bits.uopIdx := DontCare 813 fastResp.bits.respType := Mux(memIO.feedbackIO(i).feedbackFast.bits.hit, RSFeedbackType.fuIdle, memIO.feedbackIO(i).feedbackFast.bits.sourceType) 814 fastResp.bits.dataInvalidSqIdx := 0.U.asTypeOf(fastResp.bits.dataInvalidSqIdx) 815 fastResp.bits.rfWen := DontCare 816 fastResp.bits.fuType := DontCare 817 } 818 819 entries.io.fromMem.get.memWaitUpdateReq := memIO.checkWait.memWaitUpdateReq 820 entries.io.fromMem.get.stIssuePtr := memIO.checkWait.stIssuePtr 821 } 822 823 deqBeforeDly.zipWithIndex.foreach { case (deq, i) => 824 deq.bits.common.loadWaitBit.foreach(_ := deqEntryVec(i).bits.payload.loadWaitBit) 825 deq.bits.common.waitForRobIdx.foreach(_ := deqEntryVec(i).bits.payload.waitForRobIdx) 826 deq.bits.common.storeSetHit.foreach(_ := deqEntryVec(i).bits.payload.storeSetHit) 827 deq.bits.common.loadWaitStrict.foreach(_ := deqEntryVec(i).bits.payload.loadWaitStrict) 828 deq.bits.common.ssid.foreach(_ := deqEntryVec(i).bits.payload.ssid) 829 deq.bits.common.sqIdx.get := deqEntryVec(i).bits.payload.sqIdx 830 deq.bits.common.lqIdx.get := deqEntryVec(i).bits.payload.lqIdx 831 deq.bits.common.ftqIdx.foreach(_ := deqEntryVec(i).bits.payload.ftqPtr) 832 deq.bits.common.ftqOffset.foreach(_ := deqEntryVec(i).bits.payload.ftqOffset) 833 // when have vpu 834 if (params.VlduCnt > 0 || params.VstuCnt > 0) { 835 deq.bits.common.vpu.foreach(_ := deqEntryVec(i).bits.payload.vpu) 836 deq.bits.common.vpu.foreach(_.vuopIdx := deqEntryVec(i).bits.payload.uopIdx) 837 } 838 } 839} 840 841class IssueQueueVecMemImp(override val wrapper: IssueQueue)(implicit p: Parameters, params: IssueBlockParams) 842 extends IssueQueueImp(wrapper) with HasCircularQueuePtrHelper { 843 844 require((params.VstdCnt + params.VlduCnt + params.VstaCnt) > 0, "IssueQueueVecMemImp can only be instance of VecMem IQ") 845 846 io.suggestName("none") 847 override lazy val io = IO(new IssueQueueMemIO).suggestName("io") 848 private val memIO = io.memIO.get 849 850 def selectOldUop(robIdx: Seq[RobPtr], uopIdx: Seq[UInt], valid: Seq[Bool]): Vec[Bool] = { 851 val compareVec = (0 until robIdx.length).map(i => (0 until i).map(j => isAfter(robIdx(j), robIdx(i)) || (robIdx(j).value === robIdx(i).value && uopIdx(i) < uopIdx(j)))) 852 val resultOnehot = VecInit((0 until robIdx.length).map(i => Cat((0 until robIdx.length).map(j => 853 (if (j < i) !valid(j) || compareVec(i)(j) 854 else if (j == i) valid(i) 855 else !valid(j) || !compareVec(j)(i)) 856 )).andR)) 857 resultOnehot 858 } 859 860 val robIdxVec = entries.io.robIdx.get 861 val uopIdxVec = entries.io.uopIdx.get 862 val allEntryOldestOH = selectOldUop(robIdxVec, uopIdxVec, validVec) 863 864 finalDeqSelValidVec.head := (allEntryOldestOH.asUInt & canIssueVec.asUInt).orR 865 finalDeqSelOHVec.head := allEntryOldestOH.asUInt & canIssueVec.asUInt 866 867 if (params.isVecMemAddrIQ) { 868 s0_enqBits.foreach{ x => 869 x.srcType(3) := SrcType.vp // v0: mask src 870 x.srcType(4) := SrcType.vp // vl&vtype 871 } 872 873 for (i <- io.enq.indices) { 874 s0_enqBits(i).loadWaitBit := false.B 875 } 876 877 for (i <- entries.io.enq.indices) { 878 entries.io.enq(i).bits.status match { case enqData => 879 enqData.blocked := false.B // s0_enqBits(i).loadWaitBit 880 enqData.mem.get.strictWait := s0_enqBits(i).loadWaitStrict 881 enqData.mem.get.waitForStd := false.B 882 enqData.mem.get.waitForRobIdx := s0_enqBits(i).waitForRobIdx 883 enqData.mem.get.waitForSqIdx := 0.U.asTypeOf(enqData.mem.get.waitForSqIdx) // generated by sq, will be updated later 884 enqData.mem.get.sqIdx := s0_enqBits(i).sqIdx 885 } 886 887 entries.io.fromMem.get.slowResp.zipWithIndex.foreach { case (slowResp, i) => 888 slowResp.valid := memIO.feedbackIO(i).feedbackSlow.valid 889 slowResp.bits.robIdx := memIO.feedbackIO(i).feedbackSlow.bits.robIdx 890 slowResp.bits.uopIdx := DontCare 891 slowResp.bits.respType := Mux(memIO.feedbackIO(i).feedbackSlow.bits.hit, RSFeedbackType.fuIdle, RSFeedbackType.feedbackInvalid) 892 slowResp.bits.dataInvalidSqIdx := memIO.feedbackIO(i).feedbackSlow.bits.dataInvalidSqIdx 893 slowResp.bits.rfWen := DontCare 894 slowResp.bits.fuType := DontCare 895 } 896 897 entries.io.fromMem.get.fastResp.zipWithIndex.foreach { case (fastResp, i) => 898 fastResp.valid := memIO.feedbackIO(i).feedbackFast.valid 899 fastResp.bits.robIdx := memIO.feedbackIO(i).feedbackFast.bits.robIdx 900 fastResp.bits.uopIdx := DontCare 901 fastResp.bits.respType := memIO.feedbackIO(i).feedbackFast.bits.sourceType 902 fastResp.bits.dataInvalidSqIdx := 0.U.asTypeOf(fastResp.bits.dataInvalidSqIdx) 903 fastResp.bits.rfWen := DontCare 904 fastResp.bits.fuType := DontCare 905 } 906 907 entries.io.fromMem.get.memWaitUpdateReq := memIO.checkWait.memWaitUpdateReq 908 entries.io.fromMem.get.stIssuePtr := memIO.checkWait.stIssuePtr 909 } 910 } 911 912 for (i <- entries.io.enq.indices) { 913 entries.io.enq(i).bits.status match { case enqData => 914 enqData.vecMem.get.sqIdx := s0_enqBits(i).sqIdx 915 enqData.vecMem.get.lqIdx := s0_enqBits(i).lqIdx 916 } 917 } 918 919 entries.io.fromLsq.get.sqDeqPtr := memIO.sqDeqPtr.get 920 entries.io.fromLsq.get.lqDeqPtr := memIO.lqDeqPtr.get 921 922 deqBeforeDly.zipWithIndex.foreach { case (deq, i) => 923 deq.bits.common.sqIdx.foreach(_ := deqEntryVec(i).bits.payload.sqIdx) 924 deq.bits.common.lqIdx.foreach(_ := deqEntryVec(i).bits.payload.lqIdx) 925 if (params.isVecLdAddrIQ) { 926 deq.bits.common.ftqIdx.get := deqEntryVec(i).bits.payload.ftqPtr 927 deq.bits.common.ftqOffset.get := deqEntryVec(i).bits.payload.ftqOffset 928 } 929 deq.bits.common.fpu.foreach(_ := deqEntryVec(i).bits.payload.fpu) 930 deq.bits.common.vpu.foreach(_ := deqEntryVec(i).bits.payload.vpu) 931 deq.bits.common.vpu.foreach(_.vuopIdx := deqEntryVec(i).bits.payload.uopIdx) 932 deq.bits.common.vpu.foreach(_.lastUop := deqEntryVec(i).bits.payload.lastUop) 933 } 934} 935