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.mem 18 19import chipsalliance.rocketchip.config.Parameters 20import chisel3._ 21import chisel3.util._ 22import utils._ 23import xiangshan._ 24import xiangshan.backend.fu.fpu.FPU 25import xiangshan.backend.rob.RobLsqIO 26import xiangshan.cache._ 27import xiangshan.frontend.FtqPtr 28import xiangshan.ExceptionNO._ 29 30class LqPtr(implicit p: Parameters) extends CircularQueuePtr[LqPtr]( 31 p => p(XSCoreParamsKey).LoadQueueSize 32){ 33} 34 35object LqPtr { 36 def apply(f: Bool, v: UInt)(implicit p: Parameters): LqPtr = { 37 val ptr = Wire(new LqPtr) 38 ptr.flag := f 39 ptr.value := v 40 ptr 41 } 42} 43 44trait HasLoadHelper { this: XSModule => 45 def rdataHelper(uop: MicroOp, rdata: UInt): UInt = { 46 val fpWen = uop.ctrl.fpWen 47 LookupTree(uop.ctrl.fuOpType, List( 48 LSUOpType.lb -> SignExt(rdata(7, 0) , XLEN), 49 LSUOpType.lh -> SignExt(rdata(15, 0), XLEN), 50 /* 51 riscv-spec-20191213: 12.2 NaN Boxing of Narrower Values 52 Any operation that writes a narrower result to an f register must write 53 all 1s to the uppermost FLEN−n bits to yield a legal NaN-boxed value. 54 */ 55 LSUOpType.lw -> Mux(fpWen, FPU.box(rdata, FPU.S), SignExt(rdata(31, 0), XLEN)), 56 LSUOpType.ld -> Mux(fpWen, FPU.box(rdata, FPU.D), SignExt(rdata(63, 0), XLEN)), 57 LSUOpType.lbu -> ZeroExt(rdata(7, 0) , XLEN), 58 LSUOpType.lhu -> ZeroExt(rdata(15, 0), XLEN), 59 LSUOpType.lwu -> ZeroExt(rdata(31, 0), XLEN), 60 )) 61 } 62} 63 64class LqEnqIO(implicit p: Parameters) extends XSBundle { 65 val canAccept = Output(Bool()) 66 val sqCanAccept = Input(Bool()) 67 val needAlloc = Vec(exuParameters.LsExuCnt, Input(Bool())) 68 val req = Vec(exuParameters.LsExuCnt, Flipped(ValidIO(new MicroOp))) 69 val resp = Vec(exuParameters.LsExuCnt, Output(new LqPtr)) 70} 71 72class LqTriggerIO(implicit p: Parameters) extends XSBundle { 73 val hitLoadAddrTriggerHitVec = Input(Vec(3, Bool())) 74 val lqLoadAddrTriggerHitVec = Output(Vec(3, Bool())) 75} 76 77// Load Queue 78class LoadQueue(implicit p: Parameters) extends XSModule 79 with HasDCacheParameters 80 with HasCircularQueuePtrHelper 81 with HasLoadHelper 82 with HasPerfEvents 83{ 84 val io = IO(new Bundle() { 85 val enq = new LqEnqIO 86 val brqRedirect = Flipped(ValidIO(new Redirect)) 87 val loadIn = Vec(LoadPipelineWidth, Flipped(Valid(new LqWriteBundle))) 88 val storeIn = Vec(StorePipelineWidth, Flipped(Valid(new LsPipelineBundle))) 89 val s2_load_data_forwarded = Vec(LoadPipelineWidth, Input(Bool())) 90 val s3_delayed_load_error = Vec(LoadPipelineWidth, Input(Bool())) 91 val s2_dcache_require_replay = Vec(LoadPipelineWidth, Input(Bool())) 92 val s3_replay_from_fetch = Vec(LoadPipelineWidth, Input(Bool())) 93 val ldout = Vec(LoadPipelineWidth, DecoupledIO(new ExuOutput)) // writeback int load 94 val load_s1 = Vec(LoadPipelineWidth, Flipped(new PipeLoadForwardQueryIO)) // TODO: to be renamed 95 val loadViolationQuery = Vec(LoadPipelineWidth, Flipped(new LoadViolationQueryIO)) 96 val rob = Flipped(new RobLsqIO) 97 val rollback = Output(Valid(new Redirect)) // replay now starts from load instead of store 98 val refill = Flipped(ValidIO(new Refill)) 99 val release = Flipped(ValidIO(new Release)) 100 val uncache = new UncacheWordIO 101 val exceptionAddr = new ExceptionAddrIO 102 val lqFull = Output(Bool()) 103 val lqCancelCnt = Output(UInt(log2Up(LoadQueueSize + 1).W)) 104 val trigger = Vec(LoadPipelineWidth, new LqTriggerIO) 105 }) 106 107 println("LoadQueue: size:" + LoadQueueSize) 108 109 val uop = Reg(Vec(LoadQueueSize, new MicroOp)) 110 // val data = Reg(Vec(LoadQueueSize, new LsRobEntry)) 111 val dataModule = Module(new LoadQueueDataWrapper(LoadQueueSize, wbNumRead = LoadPipelineWidth, wbNumWrite = LoadPipelineWidth)) 112 dataModule.io := DontCare 113 val vaddrModule = Module(new SyncDataModuleTemplate(UInt(VAddrBits.W), LoadQueueSize, numRead = LoadPipelineWidth + 1, numWrite = LoadPipelineWidth)) 114 vaddrModule.io := DontCare 115 val vaddrTriggerResultModule = Module(new SyncDataModuleTemplate(Vec(3, Bool()), LoadQueueSize, numRead = LoadPipelineWidth, numWrite = LoadPipelineWidth)) 116 vaddrTriggerResultModule.io := DontCare 117 val allocated = RegInit(VecInit(List.fill(LoadQueueSize)(false.B))) // lq entry has been allocated 118 val datavalid = RegInit(VecInit(List.fill(LoadQueueSize)(false.B))) // data is valid 119 val writebacked = RegInit(VecInit(List.fill(LoadQueueSize)(false.B))) // inst has been writebacked to CDB 120 val released = RegInit(VecInit(List.fill(LoadQueueSize)(false.B))) // load data has been released by dcache 121 val error = RegInit(VecInit(List.fill(LoadQueueSize)(false.B))) // load data has been corrupted 122 val miss = Reg(Vec(LoadQueueSize, Bool())) // load inst missed, waiting for miss queue to accept miss request 123 // val listening = Reg(Vec(LoadQueueSize, Bool())) // waiting for refill result 124 val pending = Reg(Vec(LoadQueueSize, Bool())) // mmio pending: inst is an mmio inst, it will not be executed until it reachs the end of rob 125 val refilling = WireInit(VecInit(List.fill(LoadQueueSize)(false.B))) // inst has been writebacked to CDB 126 127 val debug_mmio = Reg(Vec(LoadQueueSize, Bool())) // mmio: inst is an mmio inst 128 val debug_paddr = Reg(Vec(LoadQueueSize, UInt(PAddrBits.W))) // mmio: inst is an mmio inst 129 130 val enqPtrExt = RegInit(VecInit((0 until io.enq.req.length).map(_.U.asTypeOf(new LqPtr)))) 131 val deqPtrExt = RegInit(0.U.asTypeOf(new LqPtr)) 132 val deqPtrExtNext = Wire(new LqPtr) 133 134 val enqPtr = enqPtrExt(0).value 135 val deqPtr = deqPtrExt.value 136 137 val validCount = distanceBetween(enqPtrExt(0), deqPtrExt) 138 val allowEnqueue = validCount <= (LoadQueueSize - LoadPipelineWidth).U 139 140 val deqMask = UIntToMask(deqPtr, LoadQueueSize) 141 val enqMask = UIntToMask(enqPtr, LoadQueueSize) 142 143 val commitCount = RegNext(io.rob.lcommit) 144 145 val release1cycle = io.release 146 val release2cycle = RegNext(io.release) 147 val release2cycle_dup_lsu = RegNext(io.release) 148 149 /** 150 * Enqueue at dispatch 151 * 152 * Currently, LoadQueue only allows enqueue when #emptyEntries > EnqWidth 153 */ 154 io.enq.canAccept := allowEnqueue 155 156 val canEnqueue = io.enq.req.map(_.valid) 157 val enqCancel = io.enq.req.map(_.bits.robIdx.needFlush(io.brqRedirect)) 158 for (i <- 0 until io.enq.req.length) { 159 val offset = if (i == 0) 0.U else PopCount(io.enq.needAlloc.take(i)) 160 val lqIdx = enqPtrExt(offset) 161 val index = io.enq.req(i).bits.lqIdx.value 162 when (canEnqueue(i) && !enqCancel(i)) { 163 uop(index).robIdx := io.enq.req(i).bits.robIdx 164 allocated(index) := true.B 165 datavalid(index) := false.B 166 writebacked(index) := false.B 167 released(index) := false.B 168 miss(index) := false.B 169 pending(index) := false.B 170 error(index) := false.B 171 XSError(!io.enq.canAccept || !io.enq.sqCanAccept, s"must accept $i\n") 172 XSError(index =/= lqIdx.value, s"must be the same entry $i\n") 173 } 174 io.enq.resp(i) := lqIdx 175 } 176 XSDebug(p"(ready, valid): ${io.enq.canAccept}, ${Binary(Cat(io.enq.req.map(_.valid)))}\n") 177 178 /** 179 * Writeback load from load units 180 * 181 * Most load instructions writeback to regfile at the same time. 182 * However, 183 * (1) For an mmio instruction with exceptions, it writes back to ROB immediately. 184 * (2) For an mmio instruction without exceptions, it does not write back. 185 * The mmio instruction will be sent to lower level when it reaches ROB's head. 186 * After uncache response, it will write back through arbiter with loadUnit. 187 * (3) For cache misses, it is marked miss and sent to dcache later. 188 * After cache refills, it will write back through arbiter with loadUnit. 189 */ 190 for (i <- 0 until LoadPipelineWidth) { 191 dataModule.io.wb.wen(i) := false.B 192 vaddrTriggerResultModule.io.wen(i) := false.B 193 val loadWbIndex = io.loadIn(i).bits.uop.lqIdx.value 194 195 // most lq status need to be updated immediately after load writeback to lq 196 // flag bits in lq needs to be updated accurately 197 when(io.loadIn(i).fire()) { 198 when(io.loadIn(i).bits.miss) { 199 XSInfo(io.loadIn(i).valid, "load miss write to lq idx %d pc 0x%x vaddr %x paddr %x data %x mask %x forwardData %x forwardMask: %x mmio %x\n", 200 io.loadIn(i).bits.uop.lqIdx.asUInt, 201 io.loadIn(i).bits.uop.cf.pc, 202 io.loadIn(i).bits.vaddr, 203 io.loadIn(i).bits.paddr, 204 io.loadIn(i).bits.data, 205 io.loadIn(i).bits.mask, 206 io.loadIn(i).bits.forwardData.asUInt, 207 io.loadIn(i).bits.forwardMask.asUInt, 208 io.loadIn(i).bits.mmio 209 ) 210 }.otherwise { 211 XSInfo(io.loadIn(i).valid, "load hit write to cbd lqidx %d pc 0x%x vaddr %x paddr %x data %x mask %x forwardData %x forwardMask: %x mmio %x\n", 212 io.loadIn(i).bits.uop.lqIdx.asUInt, 213 io.loadIn(i).bits.uop.cf.pc, 214 io.loadIn(i).bits.vaddr, 215 io.loadIn(i).bits.paddr, 216 io.loadIn(i).bits.data, 217 io.loadIn(i).bits.mask, 218 io.loadIn(i).bits.forwardData.asUInt, 219 io.loadIn(i).bits.forwardMask.asUInt, 220 io.loadIn(i).bits.mmio 221 )} 222 if(EnableFastForward){ 223 datavalid(loadWbIndex) := (!io.loadIn(i).bits.miss || io.s2_load_data_forwarded(i)) && 224 !io.loadIn(i).bits.mmio && // mmio data is not valid until we finished uncache access 225 !io.s2_dcache_require_replay(i) // do not writeback if that inst will be resend from rs 226 } else { 227 datavalid(loadWbIndex) := (!io.loadIn(i).bits.miss || io.s2_load_data_forwarded(i)) && 228 !io.loadIn(i).bits.mmio // mmio data is not valid until we finished uncache access 229 } 230 writebacked(loadWbIndex) := !io.loadIn(i).bits.miss && !io.loadIn(i).bits.mmio 231 232 debug_mmio(loadWbIndex) := io.loadIn(i).bits.mmio 233 debug_paddr(loadWbIndex) := io.loadIn(i).bits.paddr 234 235 val dcacheMissed = io.loadIn(i).bits.miss && !io.loadIn(i).bits.mmio 236 if(EnableFastForward){ 237 miss(loadWbIndex) := dcacheMissed && !io.s2_load_data_forwarded(i) && !io.s2_dcache_require_replay(i) 238 } else { 239 miss(loadWbIndex) := dcacheMissed && !io.s2_load_data_forwarded(i) 240 } 241 pending(loadWbIndex) := io.loadIn(i).bits.mmio 242 released(loadWbIndex) := release2cycle.valid && 243 io.loadIn(i).bits.paddr(PAddrBits-1, DCacheLineOffset) === release2cycle.bits.paddr(PAddrBits-1, DCacheLineOffset) || 244 release1cycle.valid && 245 io.loadIn(i).bits.paddr(PAddrBits-1, DCacheLineOffset) === release1cycle.bits.paddr(PAddrBits-1, DCacheLineOffset) 246 } 247 248 // data bit in lq can be updated when load_s2 valid 249 when(io.loadIn(i).bits.writeQueueData){ 250 val loadWbData = Wire(new LQDataEntry) 251 loadWbData.paddr := io.loadIn(i).bits.paddr 252 loadWbData.mask := io.loadIn(i).bits.mask 253 loadWbData.data := io.loadIn(i).bits.forwardData.asUInt // fwd data 254 loadWbData.fwdMask := io.loadIn(i).bits.forwardMask 255 dataModule.io.wbWrite(i, loadWbIndex, loadWbData) 256 dataModule.io.wb.wen(i) := true.B 257 258 // dirty code for load instr 259 uop(loadWbIndex).pdest := io.loadIn(i).bits.uop.pdest 260 uop(loadWbIndex).cf := io.loadIn(i).bits.uop.cf 261 uop(loadWbIndex).ctrl := io.loadIn(i).bits.uop.ctrl 262 uop(loadWbIndex).debugInfo := io.loadIn(i).bits.uop.debugInfo 263 264 vaddrTriggerResultModule.io.waddr(i) := loadWbIndex 265 vaddrTriggerResultModule.io.wdata(i) := io.trigger(i).hitLoadAddrTriggerHitVec 266 267 vaddrTriggerResultModule.io.wen(i) := true.B 268 } 269 270 // vaddrModule write is delayed, as vaddrModule will not be read right after write 271 vaddrModule.io.waddr(i) := RegNext(loadWbIndex) 272 vaddrModule.io.wdata(i) := RegNext(io.loadIn(i).bits.vaddr) 273 vaddrModule.io.wen(i) := RegNext(io.loadIn(i).fire()) 274 } 275 276 when(io.refill.valid) { 277 XSDebug("miss resp: paddr:0x%x data %x\n", io.refill.bits.addr, io.refill.bits.data) 278 } 279 280 // Refill 64 bit in a cycle 281 // Refill data comes back from io.dcache.resp 282 dataModule.io.refill.valid := io.refill.valid 283 dataModule.io.refill.paddr := io.refill.bits.addr 284 dataModule.io.refill.data := io.refill.bits.data 285 286 val s2_dcache_require_replay = WireInit(VecInit((0 until LoadPipelineWidth).map(i =>{ 287 RegNext(io.loadIn(i).fire()) && RegNext(io.s2_dcache_require_replay(i)) 288 }))) 289 dontTouch(s2_dcache_require_replay) 290 291 (0 until LoadQueueSize).map(i => { 292 dataModule.io.refill.refillMask(i) := allocated(i) && miss(i) 293 when(dataModule.io.refill.valid && dataModule.io.refill.refillMask(i) && dataModule.io.refill.matchMask(i)) { 294 datavalid(i) := true.B 295 miss(i) := false.B 296 when(!s2_dcache_require_replay.asUInt.orR){ 297 refilling(i) := true.B 298 } 299 when(io.refill.bits.error) { 300 error(i) := true.B 301 } 302 } 303 }) 304 305 for (i <- 0 until LoadPipelineWidth) { 306 val loadWbIndex = io.loadIn(i).bits.uop.lqIdx.value 307 val lastCycleLoadWbIndex = RegNext(loadWbIndex) 308 // update miss state in load s3 309 if(!EnableFastForward){ 310 // s2_dcache_require_replay will be used to update lq flag 1 cycle after for better timing 311 // 312 // io.s2_dcache_require_replay comes from dcache miss req reject, which is quite slow to generate 313 when(s2_dcache_require_replay(i)) { 314 // do not writeback if that inst will be resend from rs 315 // rob writeback will not be triggered by a refill before inst replay 316 miss(lastCycleLoadWbIndex) := false.B // disable refill listening 317 datavalid(lastCycleLoadWbIndex) := false.B // disable refill listening 318 assert(!datavalid(lastCycleLoadWbIndex)) 319 } 320 } 321 // update load error state in load s3 322 when(RegNext(io.loadIn(i).fire()) && io.s3_delayed_load_error(i)){ 323 uop(lastCycleLoadWbIndex).cf.exceptionVec(loadAccessFault) := true.B 324 } 325 // update inst replay from fetch flag in s3 326 when(RegNext(io.loadIn(i).fire()) && io.s3_replay_from_fetch(i)){ 327 uop(lastCycleLoadWbIndex).ctrl.replayInst := true.B 328 } 329 } 330 331 332 // Writeback up to 2 missed load insts to CDB 333 // 334 // Pick 2 missed load (data refilled), write them back to cdb 335 // 2 refilled load will be selected from even/odd entry, separately 336 337 // Stage 0 338 // Generate writeback indexes 339 340 def getRemBits(input: UInt)(rem: Int): UInt = { 341 VecInit((0 until LoadQueueSize / LoadPipelineWidth).map(i => { input(LoadPipelineWidth * i + rem) })).asUInt 342 } 343 344 val loadWbSel = Wire(Vec(LoadPipelineWidth, UInt(log2Up(LoadQueueSize).W))) // index selected last cycle 345 val loadWbSelV = Wire(Vec(LoadPipelineWidth, Bool())) // index selected in last cycle is valid 346 347 val loadWbSelVec = VecInit((0 until LoadQueueSize).map(i => { 348 // allocated(i) && !writebacked(i) && (datavalid(i) || refilling(i)) 349 allocated(i) && !writebacked(i) && datavalid(i) // query refilling will cause bad timing 350 })).asUInt() // use uint instead vec to reduce verilog lines 351 val remDeqMask = Seq.tabulate(LoadPipelineWidth)(getRemBits(deqMask)(_)) 352 // generate lastCycleSelect mask 353 val remFireMask = Seq.tabulate(LoadPipelineWidth)(rem => getRemBits(UIntToOH(loadWbSel(rem)))(rem)) 354 // generate real select vec 355 def toVec(a: UInt): Vec[Bool] = { 356 VecInit(a.asBools) 357 } 358 val loadRemSelVecFire = Seq.tabulate(LoadPipelineWidth)(rem => getRemBits(loadWbSelVec)(rem) & ~remFireMask(rem)) 359 val loadRemSelVecNotFire = Seq.tabulate(LoadPipelineWidth)(getRemBits(loadWbSelVec)(_)) 360 val loadRemSel = Seq.tabulate(LoadPipelineWidth)(rem => Mux( 361 io.ldout(rem).fire(), 362 getFirstOne(toVec(loadRemSelVecFire(rem)), remDeqMask(rem)), 363 getFirstOne(toVec(loadRemSelVecNotFire(rem)), remDeqMask(rem)) 364 )) 365 366 367 val loadWbSelGen = Wire(Vec(LoadPipelineWidth, UInt(log2Up(LoadQueueSize).W))) 368 val loadWbSelVGen = Wire(Vec(LoadPipelineWidth, Bool())) 369 (0 until LoadPipelineWidth).foreach(index => { 370 loadWbSelGen(index) := ( 371 if (LoadPipelineWidth > 1) Cat(loadRemSel(index), index.U(log2Ceil(LoadPipelineWidth).W)) 372 else loadRemSel(index) 373 ) 374 loadWbSelVGen(index) := Mux(io.ldout(index).fire, loadRemSelVecFire(index).asUInt.orR, loadRemSelVecNotFire(index).asUInt.orR) 375 }) 376 377 (0 until LoadPipelineWidth).map(i => { 378 loadWbSel(i) := RegNext(loadWbSelGen(i)) 379 loadWbSelV(i) := RegNext(loadWbSelVGen(i), init = false.B) 380 when(io.ldout(i).fire()){ 381 // Mark them as writebacked, so they will not be selected in the next cycle 382 writebacked(loadWbSel(i)) := true.B 383 } 384 }) 385 386 // Stage 1 387 // Use indexes generated in cycle 0 to read data 388 // writeback data to cdb 389 (0 until LoadPipelineWidth).map(i => { 390 // data select 391 dataModule.io.wb.raddr(i) := loadWbSelGen(i) 392 val rdata = dataModule.io.wb.rdata(i).data 393 val seluop = uop(loadWbSel(i)) 394 val func = seluop.ctrl.fuOpType 395 val raddr = dataModule.io.wb.rdata(i).paddr 396 val rdataSel = LookupTree(raddr(2, 0), List( 397 "b000".U -> rdata(63, 0), 398 "b001".U -> rdata(63, 8), 399 "b010".U -> rdata(63, 16), 400 "b011".U -> rdata(63, 24), 401 "b100".U -> rdata(63, 32), 402 "b101".U -> rdata(63, 40), 403 "b110".U -> rdata(63, 48), 404 "b111".U -> rdata(63, 56) 405 )) 406 val rdataPartialLoad = rdataHelper(seluop, rdataSel) 407 408 // writeback missed int/fp load 409 // 410 // Int load writeback will finish (if not blocked) in one cycle 411 io.ldout(i).bits.uop := seluop 412 io.ldout(i).bits.uop.lqIdx := loadWbSel(i).asTypeOf(new LqPtr) 413 io.ldout(i).bits.data := rdataPartialLoad 414 io.ldout(i).bits.redirectValid := false.B 415 io.ldout(i).bits.redirect := DontCare 416 io.ldout(i).bits.debug.isMMIO := debug_mmio(loadWbSel(i)) 417 io.ldout(i).bits.debug.isPerfCnt := false.B 418 io.ldout(i).bits.debug.paddr := debug_paddr(loadWbSel(i)) 419 io.ldout(i).bits.debug.vaddr := vaddrModule.io.rdata(i+1) 420 io.ldout(i).bits.fflags := DontCare 421 io.ldout(i).valid := loadWbSelV(i) 422 423 when(io.ldout(i).fire()) { 424 XSInfo("int load miss write to cbd robidx %d lqidx %d pc 0x%x mmio %x\n", 425 io.ldout(i).bits.uop.robIdx.asUInt, 426 io.ldout(i).bits.uop.lqIdx.asUInt, 427 io.ldout(i).bits.uop.cf.pc, 428 debug_mmio(loadWbSel(i)) 429 ) 430 } 431 432 }) 433 434 /** 435 * Load commits 436 * 437 * When load commited, mark it as !allocated and move deqPtrExt forward. 438 */ 439 (0 until CommitWidth).map(i => { 440 when(commitCount > i.U){ 441 allocated((deqPtrExt+i.U).value) := false.B 442 XSError(!allocated((deqPtrExt+i.U).value), s"why commit invalid entry $i?\n") 443 } 444 }) 445 446 def getFirstOne(mask: Vec[Bool], startMask: UInt) = { 447 val length = mask.length 448 val highBits = (0 until length).map(i => mask(i) & ~startMask(i)) 449 val highBitsUint = Cat(highBits.reverse) 450 PriorityEncoder(Mux(highBitsUint.orR(), highBitsUint, mask.asUInt)) 451 } 452 453 def getOldest[T <: XSBundleWithMicroOp](valid: Seq[Bool], bits: Seq[T]): (Seq[Bool], Seq[T]) = { 454 assert(valid.length == bits.length) 455 assert(isPow2(valid.length)) 456 if (valid.length == 1) { 457 (valid, bits) 458 } else if (valid.length == 2) { 459 val res = Seq.fill(2)(Wire(ValidIO(chiselTypeOf(bits(0))))) 460 for (i <- res.indices) { 461 res(i).valid := valid(i) 462 res(i).bits := bits(i) 463 } 464 val oldest = Mux(valid(0) && valid(1), Mux(isAfter(bits(0).uop.robIdx, bits(1).uop.robIdx), res(1), res(0)), Mux(valid(0) && !valid(1), res(0), res(1))) 465 (Seq(oldest.valid), Seq(oldest.bits)) 466 } else { 467 val left = getOldest(valid.take(valid.length / 2), bits.take(valid.length / 2)) 468 val right = getOldest(valid.takeRight(valid.length / 2), bits.takeRight(valid.length / 2)) 469 getOldest(left._1 ++ right._1, left._2 ++ right._2) 470 } 471 } 472 473 def getAfterMask(valid: Seq[Bool], uop: Seq[MicroOp]) = { 474 assert(valid.length == uop.length) 475 val length = valid.length 476 (0 until length).map(i => { 477 (0 until length).map(j => { 478 Mux(valid(i) && valid(j), 479 isAfter(uop(i).robIdx, uop(j).robIdx), 480 Mux(!valid(i), true.B, false.B)) 481 }) 482 }) 483 } 484 485 /** 486 * Store-Load Memory violation detection 487 * 488 * When store writes back, it searches LoadQueue for younger load instructions 489 * with the same load physical address. They loaded wrong data and need re-execution. 490 * 491 * Cycle 0: Store Writeback 492 * Generate match vector for store address with rangeMask(stPtr, enqPtr). 493 * Besides, load instructions in LoadUnit_S1 and S2 are also checked. 494 * Cycle 1: Redirect Generation 495 * There're three possible types of violations, up to 6 possible redirect requests. 496 * Choose the oldest load (part 1). (4 + 2) -> (1 + 2) 497 * Cycle 2: Redirect Fire 498 * Choose the oldest load (part 2). (3 -> 1) 499 * Prepare redirect request according to the detected violation. 500 * Fire redirect request (if valid) 501 */ 502 503 // stage 0: lq l1 wb l1 wb lq 504 // | | | | | | (paddr match) 505 // stage 1: lq l1 wb l1 wb lq 506 // | | | | | | 507 // | |------------| | 508 // | | | 509 // stage 2: lq l1wb lq 510 // | | | 511 // -------------------- 512 // | 513 // rollback req 514 io.load_s1 := DontCare 515 def detectRollback(i: Int) = { 516 val startIndex = io.storeIn(i).bits.uop.lqIdx.value 517 val lqIdxMask = UIntToMask(startIndex, LoadQueueSize) 518 val xorMask = lqIdxMask ^ enqMask 519 val sameFlag = io.storeIn(i).bits.uop.lqIdx.flag === enqPtrExt(0).flag 520 val stToEnqPtrMask = Mux(sameFlag, xorMask, ~xorMask) 521 522 // check if load already in lq needs to be rolledback 523 dataModule.io.violation(i).paddr := io.storeIn(i).bits.paddr 524 dataModule.io.violation(i).mask := io.storeIn(i).bits.mask 525 val addrMaskMatch = RegNext(dataModule.io.violation(i).violationMask) 526 val entryNeedCheck = RegNext(VecInit((0 until LoadQueueSize).map(j => { 527 allocated(j) && stToEnqPtrMask(j) && (datavalid(j) || miss(j)) 528 }))) 529 val lqViolationVec = VecInit((0 until LoadQueueSize).map(j => { 530 addrMaskMatch(j) && entryNeedCheck(j) 531 })) 532 val lqViolation = lqViolationVec.asUInt().orR() 533 val lqViolationIndex = getFirstOne(lqViolationVec, RegNext(lqIdxMask)) 534 val lqViolationUop = uop(lqViolationIndex) 535 // lqViolationUop.lqIdx.flag := deqMask(lqViolationIndex) ^ deqPtrExt.flag 536 // lqViolationUop.lqIdx.value := lqViolationIndex 537 XSDebug(lqViolation, p"${Binary(Cat(lqViolationVec))}, $startIndex, $lqViolationIndex\n") 538 539 // when l/s writeback to rob together, check if rollback is needed 540 val wbViolationVec = RegNext(VecInit((0 until LoadPipelineWidth).map(j => { 541 io.loadIn(j).valid && 542 isAfter(io.loadIn(j).bits.uop.robIdx, io.storeIn(i).bits.uop.robIdx) && 543 io.storeIn(i).bits.paddr(PAddrBits - 1, 3) === io.loadIn(j).bits.paddr(PAddrBits - 1, 3) && 544 (io.storeIn(i).bits.mask & io.loadIn(j).bits.mask).orR 545 }))) 546 val wbViolation = wbViolationVec.asUInt().orR() && RegNext(io.storeIn(i).valid && !io.storeIn(i).bits.miss) 547 val wbViolationUop = getOldest(wbViolationVec, RegNext(VecInit(io.loadIn.map(_.bits))))._2(0).uop 548 XSDebug(wbViolation, p"${Binary(Cat(wbViolationVec))}, $wbViolationUop\n") 549 550 // check if rollback is needed for load in l1 551 val l1ViolationVec = RegNext(VecInit((0 until LoadPipelineWidth).map(j => { 552 io.load_s1(j).valid && // L1 valid 553 isAfter(io.load_s1(j).uop.robIdx, io.storeIn(i).bits.uop.robIdx) && 554 io.storeIn(i).bits.paddr(PAddrBits - 1, 3) === io.load_s1(j).paddr(PAddrBits - 1, 3) && 555 (io.storeIn(i).bits.mask & io.load_s1(j).mask).orR 556 }))) 557 val l1Violation = l1ViolationVec.asUInt().orR() && RegNext(io.storeIn(i).valid && !io.storeIn(i).bits.miss) 558 val load_s1 = Wire(Vec(LoadPipelineWidth, new XSBundleWithMicroOp)) 559 (0 until LoadPipelineWidth).foreach(i => load_s1(i).uop := io.load_s1(i).uop) 560 val l1ViolationUop = getOldest(l1ViolationVec, RegNext(load_s1))._2(0).uop 561 XSDebug(l1Violation, p"${Binary(Cat(l1ViolationVec))}, $l1ViolationUop\n") 562 563 XSDebug( 564 l1Violation, 565 "need rollback (l1 load) pc %x robidx %d target %x\n", 566 io.storeIn(i).bits.uop.cf.pc, io.storeIn(i).bits.uop.robIdx.asUInt, l1ViolationUop.robIdx.asUInt 567 ) 568 XSDebug( 569 lqViolation, 570 "need rollback (ld wb before store) pc %x robidx %d target %x\n", 571 io.storeIn(i).bits.uop.cf.pc, io.storeIn(i).bits.uop.robIdx.asUInt, lqViolationUop.robIdx.asUInt 572 ) 573 XSDebug( 574 wbViolation, 575 "need rollback (ld/st wb together) pc %x robidx %d target %x\n", 576 io.storeIn(i).bits.uop.cf.pc, io.storeIn(i).bits.uop.robIdx.asUInt, wbViolationUop.robIdx.asUInt 577 ) 578 579 ((lqViolation, lqViolationUop), (wbViolation, wbViolationUop), (l1Violation, l1ViolationUop)) 580 } 581 582 def rollbackSel(a: Valid[MicroOpRbExt], b: Valid[MicroOpRbExt]): ValidIO[MicroOpRbExt] = { 583 Mux( 584 a.valid, 585 Mux( 586 b.valid, 587 Mux(isAfter(a.bits.uop.robIdx, b.bits.uop.robIdx), b, a), // a,b both valid, sel oldest 588 a // sel a 589 ), 590 b // sel b 591 ) 592 } 593 val lastCycleRedirect = RegNext(io.brqRedirect) 594 val lastlastCycleRedirect = RegNext(lastCycleRedirect) 595 596 // S2: select rollback (part1) and generate rollback request 597 // rollback check 598 // Wb/L1 rollback seq check is done in s2 599 val rollbackWb = Wire(Vec(StorePipelineWidth, Valid(new MicroOpRbExt))) 600 val rollbackL1 = Wire(Vec(StorePipelineWidth, Valid(new MicroOpRbExt))) 601 val rollbackL1Wb = Wire(Vec(StorePipelineWidth*2, Valid(new MicroOpRbExt))) 602 // Lq rollback seq check is done in s3 (next stage), as getting rollbackLq MicroOp is slow 603 val rollbackLq = Wire(Vec(StorePipelineWidth, Valid(new MicroOpRbExt))) 604 // store ftq index for store set update 605 val stFtqIdxS2 = Wire(Vec(StorePipelineWidth, new FtqPtr)) 606 val stFtqOffsetS2 = Wire(Vec(StorePipelineWidth, UInt(log2Up(PredictWidth).W))) 607 for (i <- 0 until StorePipelineWidth) { 608 val detectedRollback = detectRollback(i) 609 rollbackLq(i).valid := detectedRollback._1._1 && RegNext(io.storeIn(i).valid) 610 rollbackLq(i).bits.uop := detectedRollback._1._2 611 rollbackLq(i).bits.flag := i.U 612 rollbackWb(i).valid := detectedRollback._2._1 && RegNext(io.storeIn(i).valid) 613 rollbackWb(i).bits.uop := detectedRollback._2._2 614 rollbackWb(i).bits.flag := i.U 615 rollbackL1(i).valid := detectedRollback._3._1 && RegNext(io.storeIn(i).valid) 616 rollbackL1(i).bits.uop := detectedRollback._3._2 617 rollbackL1(i).bits.flag := i.U 618 rollbackL1Wb(2*i) := rollbackL1(i) 619 rollbackL1Wb(2*i+1) := rollbackWb(i) 620 stFtqIdxS2(i) := RegNext(io.storeIn(i).bits.uop.cf.ftqPtr) 621 stFtqOffsetS2(i) := RegNext(io.storeIn(i).bits.uop.cf.ftqOffset) 622 } 623 624 val rollbackL1WbSelected = ParallelOperation(rollbackL1Wb, rollbackSel) 625 val rollbackL1WbVReg = RegNext(rollbackL1WbSelected.valid) 626 val rollbackL1WbReg = RegEnable(rollbackL1WbSelected.bits, rollbackL1WbSelected.valid) 627 val rollbackLqVReg = rollbackLq.map(x => RegNext(x.valid)) 628 val rollbackLqReg = rollbackLq.map(x => RegEnable(x.bits, x.valid)) 629 630 // S3: select rollback (part2), generate rollback request, then fire rollback request 631 // Note that we use robIdx - 1.U to flush the load instruction itself. 632 // Thus, here if last cycle's robIdx equals to this cycle's robIdx, it still triggers the redirect. 633 634 val rollbackValidVec = rollbackL1WbVReg +: rollbackLqVReg 635 val rollbackUopExtVec = rollbackL1WbReg +: rollbackLqReg 636 637 // select uop in parallel 638 val mask = getAfterMask(rollbackValidVec, rollbackUopExtVec.map(i => i.uop)) 639 val lqs = getOldest(rollbackLqVReg, rollbackLqReg) 640 val rollbackUopExt = getOldest(lqs._1 :+ rollbackL1WbVReg, lqs._2 :+ rollbackL1WbReg)._2(0) 641 val stFtqIdxS3 = RegNext(stFtqIdxS2) 642 val stFtqOffsetS3 = RegNext(stFtqOffsetS2) 643 val rollbackUop = rollbackUopExt.uop 644 val rollbackStFtqIdx = stFtqIdxS3(rollbackUopExt.flag) 645 val rollbackStFtqOffset = stFtqOffsetS3(rollbackUopExt.flag) 646 647 // check if rollback request is still valid in parallel 648 val rollbackValidVecChecked = Wire(Vec(LoadPipelineWidth + 1, Bool())) 649 for(((v, uop), idx) <- rollbackValidVec.zip(rollbackUopExtVec.map(i => i.uop)).zipWithIndex) { 650 rollbackValidVecChecked(idx) := v && 651 (!lastCycleRedirect.valid || isBefore(uop.robIdx, lastCycleRedirect.bits.robIdx)) && 652 (!lastlastCycleRedirect.valid || isBefore(uop.robIdx, lastlastCycleRedirect.bits.robIdx)) 653 } 654 655 io.rollback.bits.robIdx := rollbackUop.robIdx 656 io.rollback.bits.ftqIdx := rollbackUop.cf.ftqPtr 657 io.rollback.bits.stFtqIdx := rollbackStFtqIdx 658 io.rollback.bits.ftqOffset := rollbackUop.cf.ftqOffset 659 io.rollback.bits.stFtqOffset := rollbackStFtqOffset 660 io.rollback.bits.level := RedirectLevel.flush 661 io.rollback.bits.interrupt := DontCare 662 io.rollback.bits.cfiUpdate := DontCare 663 io.rollback.bits.cfiUpdate.target := rollbackUop.cf.pc 664 io.rollback.bits.debug_runahead_checkpoint_id := rollbackUop.debugInfo.runahead_checkpoint_id 665 // io.rollback.bits.pc := DontCare 666 667 io.rollback.valid := rollbackValidVecChecked.asUInt.orR 668 669 when(io.rollback.valid) { 670 // XSDebug("Mem rollback: pc %x robidx %d\n", io.rollback.bits.cfi, io.rollback.bits.robIdx.asUInt) 671 } 672 673 /** 674 * Load-Load Memory violation detection 675 * 676 * When load arrives load_s1, it searches LoadQueue for younger load instructions 677 * with the same load physical address. If younger load has been released (or observed), 678 * the younger load needs to be re-execed. 679 * 680 * For now, if re-exec it found to be needed in load_s1, we mark the older load as replayInst, 681 * the two loads will be replayed if the older load becomes the head of rob. 682 * 683 * When dcache releases a line, mark all writebacked entrys in load queue with 684 * the same line paddr as released. 685 */ 686 687 // Load-Load Memory violation query 688 val deqRightMask = UIntToMask.rightmask(deqPtr, LoadQueueSize) 689 (0 until LoadPipelineWidth).map(i => { 690 dataModule.io.release_violation(i).paddr := io.loadViolationQuery(i).req.bits.paddr 691 io.loadViolationQuery(i).req.ready := true.B 692 io.loadViolationQuery(i).resp.valid := RegNext(io.loadViolationQuery(i).req.fire()) 693 // Generate real violation mask 694 // Note that we use UIntToMask.rightmask here 695 val startIndex = io.loadViolationQuery(i).req.bits.uop.lqIdx.value 696 val lqIdxMask = UIntToMask(startIndex, LoadQueueSize) 697 val xorMask = lqIdxMask ^ enqMask 698 val sameFlag = io.loadViolationQuery(i).req.bits.uop.lqIdx.flag === enqPtrExt(0).flag 699 val ldToEnqPtrMask = Mux(sameFlag, xorMask, ~xorMask) 700 val ldld_violation_mask_gen_1 = WireInit(VecInit((0 until LoadQueueSize).map(j => { 701 ldToEnqPtrMask(j) && // the load is younger than current load 702 allocated(j) && // entry is valid 703 released(j) && // cacheline is released 704 (datavalid(j) || miss(j)) // paddr is valid 705 }))) 706 val ldld_violation_mask_gen_2 = WireInit(VecInit((0 until LoadQueueSize).map(j => { 707 dataModule.io.release_violation(i).match_mask(j)// addr match 708 // addr match result is slow to generate, we RegNext() it 709 }))) 710 val ldld_violation_mask = RegNext(ldld_violation_mask_gen_1).asUInt & RegNext(ldld_violation_mask_gen_2).asUInt 711 dontTouch(ldld_violation_mask) 712 ldld_violation_mask.suggestName("ldldViolationMask_" + i) 713 io.loadViolationQuery(i).resp.bits.have_violation := ldld_violation_mask.orR 714 }) 715 716 // "released" flag update 717 // 718 // When io.release.valid (release1cycle.valid), it uses the last ld-ld paddr cam port to 719 // update release flag in 1 cycle 720 721 when(release1cycle.valid){ 722 // Take over ld-ld paddr cam port 723 dataModule.io.release_violation.takeRight(1)(0).paddr := release1cycle.bits.paddr 724 io.loadViolationQuery.takeRight(1)(0).req.ready := false.B 725 } 726 727 when(release2cycle.valid){ 728 // If a load comes in that cycle, we can not judge if it has ld-ld violation 729 // We replay that load inst from RS 730 io.loadViolationQuery.map(i => i.req.ready := 731 // use lsu side release2cycle_dup_lsu paddr for better timing 732 !i.req.bits.paddr(PAddrBits-1, DCacheLineOffset) === release2cycle_dup_lsu.bits.paddr(PAddrBits-1, DCacheLineOffset) 733 ) 734 // io.loadViolationQuery.map(i => i.req.ready := false.B) // For better timing 735 } 736 737 (0 until LoadQueueSize).map(i => { 738 when(RegNext(dataModule.io.release_violation.takeRight(1)(0).match_mask(i) && 739 allocated(i) && 740 datavalid(i) && 741 release1cycle.valid 742 )){ 743 // Note: if a load has missed in dcache and is waiting for refill in load queue, 744 // its released flag still needs to be set as true if addr matches. 745 released(i) := true.B 746 } 747 }) 748 749 /** 750 * Memory mapped IO / other uncached operations 751 * 752 * States: 753 * (1) writeback from store units: mark as pending 754 * (2) when they reach ROB's head, they can be sent to uncache channel 755 * (3) response from uncache channel: mark as datavalid 756 * (4) writeback to ROB (and other units): mark as writebacked 757 * (5) ROB commits the instruction: same as normal instructions 758 */ 759 //(2) when they reach ROB's head, they can be sent to uncache channel 760 val lqTailMmioPending = WireInit(pending(deqPtr)) 761 val lqTailAllocated = WireInit(allocated(deqPtr)) 762 val s_idle :: s_req :: s_resp :: s_wait :: Nil = Enum(4) 763 val uncacheState = RegInit(s_idle) 764 switch(uncacheState) { 765 is(s_idle) { 766 when(RegNext(io.rob.pendingld && lqTailMmioPending && lqTailAllocated)) { 767 uncacheState := s_req 768 } 769 } 770 is(s_req) { 771 when(io.uncache.req.fire()) { 772 uncacheState := s_resp 773 } 774 } 775 is(s_resp) { 776 when(io.uncache.resp.fire()) { 777 uncacheState := s_wait 778 } 779 } 780 is(s_wait) { 781 when(RegNext(io.rob.commit)) { 782 uncacheState := s_idle // ready for next mmio 783 } 784 } 785 } 786 io.uncache.req.valid := uncacheState === s_req 787 788 dataModule.io.uncache.raddr := deqPtrExtNext.value 789 790 io.uncache.req.bits.cmd := MemoryOpConstants.M_XRD 791 io.uncache.req.bits.addr := dataModule.io.uncache.rdata.paddr 792 io.uncache.req.bits.data := dataModule.io.uncache.rdata.data 793 io.uncache.req.bits.mask := dataModule.io.uncache.rdata.mask 794 795 io.uncache.req.bits.id := DontCare 796 io.uncache.req.bits.instrtype := DontCare 797 798 io.uncache.resp.ready := true.B 799 800 when (io.uncache.req.fire()) { 801 pending(deqPtr) := false.B 802 803 XSDebug("uncache req: pc %x addr %x data %x op %x mask %x\n", 804 uop(deqPtr).cf.pc, 805 io.uncache.req.bits.addr, 806 io.uncache.req.bits.data, 807 io.uncache.req.bits.cmd, 808 io.uncache.req.bits.mask 809 ) 810 } 811 812 // (3) response from uncache channel: mark as datavalid 813 dataModule.io.uncache.wen := false.B 814 when(io.uncache.resp.fire()){ 815 datavalid(deqPtr) := true.B 816 dataModule.io.uncacheWrite(deqPtr, io.uncache.resp.bits.data(XLEN-1, 0)) 817 dataModule.io.uncache.wen := true.B 818 819 XSDebug("uncache resp: data %x\n", io.refill.bits.data) 820 } 821 822 // Read vaddr for mem exception 823 // no inst will be commited 1 cycle before tval update 824 vaddrModule.io.raddr(0) := (deqPtrExt + commitCount).value 825 io.exceptionAddr.vaddr := vaddrModule.io.rdata(0) 826 827 // Read vaddr for debug 828 (0 until LoadPipelineWidth).map(i => { 829 vaddrModule.io.raddr(i+1) := loadWbSel(i) 830 }) 831 832 (0 until LoadPipelineWidth).map(i => { 833 vaddrTriggerResultModule.io.raddr(i) := loadWbSelGen(i) 834 io.trigger(i).lqLoadAddrTriggerHitVec := Mux( 835 loadWbSelV(i), 836 vaddrTriggerResultModule.io.rdata(i), 837 VecInit(Seq.fill(3)(false.B)) 838 ) 839 }) 840 841 // misprediction recovery / exception redirect 842 // invalidate lq term using robIdx 843 val needCancel = Wire(Vec(LoadQueueSize, Bool())) 844 for (i <- 0 until LoadQueueSize) { 845 needCancel(i) := uop(i).robIdx.needFlush(io.brqRedirect) && allocated(i) 846 when (needCancel(i)) { 847 allocated(i) := false.B 848 } 849 } 850 851 /** 852 * update pointers 853 */ 854 val lastEnqCancel = PopCount(RegNext(VecInit(canEnqueue.zip(enqCancel).map(x => x._1 && x._2)))) 855 val lastCycleCancelCount = PopCount(RegNext(needCancel)) 856 val enqNumber = Mux(io.enq.canAccept && io.enq.sqCanAccept, PopCount(io.enq.req.map(_.valid)), 0.U) 857 when (lastCycleRedirect.valid) { 858 // we recover the pointers in the next cycle after redirect 859 enqPtrExt := VecInit(enqPtrExt.map(_ - (lastCycleCancelCount + lastEnqCancel))) 860 }.otherwise { 861 enqPtrExt := VecInit(enqPtrExt.map(_ + enqNumber)) 862 } 863 864 deqPtrExtNext := deqPtrExt + commitCount 865 deqPtrExt := deqPtrExtNext 866 867 io.lqCancelCnt := RegNext(lastCycleCancelCount + lastEnqCancel) 868 869 /** 870 * misc 871 */ 872 // perf counter 873 QueuePerf(LoadQueueSize, validCount, !allowEnqueue) 874 io.lqFull := !allowEnqueue 875 XSPerfAccumulate("rollback", io.rollback.valid) // rollback redirect generated 876 XSPerfAccumulate("mmioCycle", uncacheState =/= s_idle) // lq is busy dealing with uncache req 877 XSPerfAccumulate("mmioCnt", io.uncache.req.fire()) 878 XSPerfAccumulate("refill", io.refill.valid) 879 XSPerfAccumulate("writeback_success", PopCount(VecInit(io.ldout.map(i => i.fire())))) 880 XSPerfAccumulate("writeback_blocked", PopCount(VecInit(io.ldout.map(i => i.valid && !i.ready)))) 881 XSPerfAccumulate("utilization_miss", PopCount((0 until LoadQueueSize).map(i => allocated(i) && miss(i)))) 882 883 val perfValidCount = RegNext(validCount) 884 885 val perfEvents = Seq( 886 ("rollback ", io.rollback.valid), 887 ("mmioCycle ", uncacheState =/= s_idle), 888 ("mmio_Cnt ", io.uncache.req.fire()), 889 ("refill ", io.refill.valid), 890 ("writeback_success", PopCount(VecInit(io.ldout.map(i => i.fire())))), 891 ("writeback_blocked", PopCount(VecInit(io.ldout.map(i => i.valid && !i.ready)))), 892 ("ltq_1_4_valid ", (perfValidCount < (LoadQueueSize.U/4.U))), 893 ("ltq_2_4_valid ", (perfValidCount > (LoadQueueSize.U/4.U)) & (perfValidCount <= (LoadQueueSize.U/2.U))), 894 ("ltq_3_4_valid ", (perfValidCount > (LoadQueueSize.U/2.U)) & (perfValidCount <= (LoadQueueSize.U*3.U/4.U))), 895 ("ltq_4_4_valid ", (perfValidCount > (LoadQueueSize.U*3.U/4.U))) 896 ) 897 generatePerfEvent() 898 899 // debug info 900 XSDebug("enqPtrExt %d:%d deqPtrExt %d:%d\n", enqPtrExt(0).flag, enqPtr, deqPtrExt.flag, deqPtr) 901 902 def PrintFlag(flag: Bool, name: String): Unit = { 903 when(flag) { 904 XSDebug(false, true.B, name) 905 }.otherwise { 906 XSDebug(false, true.B, " ") 907 } 908 } 909 910 for (i <- 0 until LoadQueueSize) { 911 XSDebug(i + " pc %x pa %x ", uop(i).cf.pc, debug_paddr(i)) 912 PrintFlag(allocated(i), "a") 913 PrintFlag(allocated(i) && datavalid(i), "v") 914 PrintFlag(allocated(i) && writebacked(i), "w") 915 PrintFlag(allocated(i) && miss(i), "m") 916 PrintFlag(allocated(i) && pending(i), "p") 917 XSDebug(false, true.B, "\n") 918 } 919 920} 921