1package xiangshan.mem 2 3import chisel3._ 4import chisel3.util._ 5import freechips.rocketchip.tile.HasFPUParameters 6import utils._ 7import xiangshan._ 8import xiangshan.cache._ 9import xiangshan.cache.{DCacheLineIO, DCacheWordIO, MemoryOpConstants, TlbRequestIO} 10import xiangshan.backend.LSUOpType 11import xiangshan.mem._ 12import xiangshan.backend.roq.RoqLsqIO 13import xiangshan.backend.fu.HasExceptionNO 14 15 16class LqPtr extends CircularQueuePtr(LqPtr.LoadQueueSize) { } 17 18object LqPtr extends HasXSParameter { 19 def apply(f: Bool, v: UInt): LqPtr = { 20 val ptr = Wire(new LqPtr) 21 ptr.flag := f 22 ptr.value := v 23 ptr 24 } 25} 26 27trait HasLoadHelper { this: XSModule => 28 def rdataHelper(uop: MicroOp, rdata: UInt): UInt = { 29 val fpWen = uop.ctrl.fpWen 30 LookupTree(uop.ctrl.fuOpType, List( 31 LSUOpType.lb -> SignExt(rdata(7, 0) , XLEN), 32 LSUOpType.lh -> SignExt(rdata(15, 0), XLEN), 33 LSUOpType.lw -> Mux(fpWen, rdata, SignExt(rdata(31, 0), XLEN)), 34 LSUOpType.ld -> Mux(fpWen, rdata, SignExt(rdata(63, 0), XLEN)), 35 LSUOpType.lbu -> ZeroExt(rdata(7, 0) , XLEN), 36 LSUOpType.lhu -> ZeroExt(rdata(15, 0), XLEN), 37 LSUOpType.lwu -> ZeroExt(rdata(31, 0), XLEN), 38 )) 39 } 40 41 def fpRdataHelper(uop: MicroOp, rdata: UInt): UInt = { 42 LookupTree(uop.ctrl.fuOpType, List( 43 LSUOpType.lw -> recode(rdata(31, 0), S), 44 LSUOpType.ld -> recode(rdata(63, 0), D) 45 )) 46 } 47} 48 49class LqEnqIO extends XSBundle { 50 val canAccept = Output(Bool()) 51 val sqCanAccept = Input(Bool()) 52 val needAlloc = Vec(RenameWidth, Input(Bool())) 53 val req = Vec(RenameWidth, Flipped(ValidIO(new MicroOp))) 54 val resp = Vec(RenameWidth, Output(new LqPtr)) 55} 56 57// Load Queue 58class LoadQueue extends XSModule 59 with HasDCacheParameters 60 with HasCircularQueuePtrHelper 61 with HasLoadHelper 62 with HasExceptionNO 63{ 64 val io = IO(new Bundle() { 65 val enq = new LqEnqIO 66 val brqRedirect = Flipped(ValidIO(new Redirect)) 67 val flush = Input(Bool()) 68 val loadIn = Vec(LoadPipelineWidth, Flipped(Valid(new LsPipelineBundle))) 69 val storeIn = Vec(StorePipelineWidth, Flipped(Valid(new LsPipelineBundle))) 70 val loadDataForwarded = Vec(LoadPipelineWidth, Input(Bool())) 71 val ldout = Vec(2, DecoupledIO(new ExuOutput)) // writeback int load 72 val load_s1 = Vec(LoadPipelineWidth, Flipped(new LoadForwardQueryIO)) 73 val roq = Flipped(new RoqLsqIO) 74 val rollback = Output(Valid(new Redirect)) // replay now starts from load instead of store 75 val dcache = Flipped(ValidIO(new Refill)) 76 val uncache = new DCacheWordIO 77 val exceptionAddr = new ExceptionAddrIO 78 }) 79 80 val uop = Reg(Vec(LoadQueueSize, new MicroOp)) 81 // val data = Reg(Vec(LoadQueueSize, new LsRoqEntry)) 82 val dataModule = Module(new LoadQueueData(LoadQueueSize, wbNumRead = LoadPipelineWidth, wbNumWrite = LoadPipelineWidth)) 83 dataModule.io := DontCare 84 val vaddrModule = Module(new SyncDataModuleTemplate(UInt(VAddrBits.W), LoadQueueSize, numRead = 1, numWrite = LoadPipelineWidth)) 85 vaddrModule.io := DontCare 86 val allocated = RegInit(VecInit(List.fill(LoadQueueSize)(false.B))) // lq entry has been allocated 87 val datavalid = RegInit(VecInit(List.fill(LoadQueueSize)(false.B))) // data is valid 88 val writebacked = RegInit(VecInit(List.fill(LoadQueueSize)(false.B))) // inst has been writebacked to CDB 89 val miss = Reg(Vec(LoadQueueSize, Bool())) // load inst missed, waiting for miss queue to accept miss request 90 // val listening = Reg(Vec(LoadQueueSize, Bool())) // waiting for refill result 91 val pending = Reg(Vec(LoadQueueSize, Bool())) // mmio pending: inst is an mmio inst, it will not be executed until it reachs the end of roq 92 93 val debug_mmio = Reg(Vec(LoadQueueSize, Bool())) // mmio: inst is an mmio inst 94 95 val enqPtrExt = RegInit(VecInit((0 until RenameWidth).map(_.U.asTypeOf(new LqPtr)))) 96 val deqPtrExt = RegInit(0.U.asTypeOf(new LqPtr)) 97 val deqPtrExtNext = Wire(new LqPtr) 98 val allowEnqueue = RegInit(true.B) 99 100 val enqPtr = enqPtrExt(0).value 101 val deqPtr = deqPtrExt.value 102 103 val deqMask = UIntToMask(deqPtr, LoadQueueSize) 104 val enqMask = UIntToMask(enqPtr, LoadQueueSize) 105 106 val commitCount = RegNext(io.roq.lcommit) 107 108 /** 109 * Enqueue at dispatch 110 * 111 * Currently, LoadQueue only allows enqueue when #emptyEntries > RenameWidth(EnqWidth) 112 */ 113 io.enq.canAccept := allowEnqueue 114 115 for (i <- 0 until RenameWidth) { 116 val offset = if (i == 0) 0.U else PopCount(io.enq.needAlloc.take(i)) 117 val lqIdx = enqPtrExt(offset) 118 val index = lqIdx.value 119 when (io.enq.req(i).valid && io.enq.canAccept && io.enq.sqCanAccept && !(io.brqRedirect.valid || io.flush)) { 120 uop(index) := io.enq.req(i).bits 121 allocated(index) := true.B 122 datavalid(index) := false.B 123 writebacked(index) := false.B 124 miss(index) := false.B 125 // listening(index) := false.B 126 pending(index) := false.B 127 } 128 io.enq.resp(i) := lqIdx 129 } 130 XSDebug(p"(ready, valid): ${io.enq.canAccept}, ${Binary(Cat(io.enq.req.map(_.valid)))}\n") 131 132 /** 133 * Writeback load from load units 134 * 135 * Most load instructions writeback to regfile at the same time. 136 * However, 137 * (1) For an mmio instruction with exceptions, it writes back to ROB immediately. 138 * (2) For an mmio instruction without exceptions, it does not write back. 139 * The mmio instruction will be sent to lower level when it reaches ROB's head. 140 * After uncache response, it will write back through arbiter with loadUnit. 141 * (3) For cache misses, it is marked miss and sent to dcache later. 142 * After cache refills, it will write back through arbiter with loadUnit. 143 */ 144 for (i <- 0 until LoadPipelineWidth) { 145 dataModule.io.wb.wen(i) := false.B 146 val loadWbIndex = io.loadIn(i).bits.uop.lqIdx.value 147 when(io.loadIn(i).fire()) { 148 when(io.loadIn(i).bits.miss) { 149 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", 150 io.loadIn(i).bits.uop.lqIdx.asUInt, 151 io.loadIn(i).bits.uop.cf.pc, 152 io.loadIn(i).bits.vaddr, 153 io.loadIn(i).bits.paddr, 154 io.loadIn(i).bits.data, 155 io.loadIn(i).bits.mask, 156 io.loadIn(i).bits.forwardData.asUInt, 157 io.loadIn(i).bits.forwardMask.asUInt, 158 io.loadIn(i).bits.mmio 159 ) 160 }.otherwise { 161 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", 162 io.loadIn(i).bits.uop.lqIdx.asUInt, 163 io.loadIn(i).bits.uop.cf.pc, 164 io.loadIn(i).bits.vaddr, 165 io.loadIn(i).bits.paddr, 166 io.loadIn(i).bits.data, 167 io.loadIn(i).bits.mask, 168 io.loadIn(i).bits.forwardData.asUInt, 169 io.loadIn(i).bits.forwardMask.asUInt, 170 io.loadIn(i).bits.mmio 171 )} 172 datavalid(loadWbIndex) := (!io.loadIn(i).bits.miss || io.loadDataForwarded(i)) && !io.loadIn(i).bits.mmio 173 writebacked(loadWbIndex) := !io.loadIn(i).bits.miss && !io.loadIn(i).bits.mmio 174 175 val loadWbData = Wire(new LQDataEntry) 176 loadWbData.paddr := io.loadIn(i).bits.paddr 177 loadWbData.mask := io.loadIn(i).bits.mask 178 loadWbData.data := io.loadIn(i).bits.forwardData.asUInt // fwd data 179 loadWbData.fwdMask := io.loadIn(i).bits.forwardMask 180 dataModule.io.wbWrite(i, loadWbIndex, loadWbData) 181 dataModule.io.wb.wen(i) := true.B 182 183 184 debug_mmio(loadWbIndex) := io.loadIn(i).bits.mmio 185 186 val dcacheMissed = io.loadIn(i).bits.miss && !io.loadIn(i).bits.mmio 187 miss(loadWbIndex) := dcacheMissed && !io.loadDataForwarded(i) 188 pending(loadWbIndex) := io.loadIn(i).bits.mmio 189 uop(loadWbIndex).debugInfo.issueTime := io.loadIn(i).bits.uop.debugInfo.issueTime 190 } 191 // vaddrModule write is delayed, as vaddrModule will not be read right after write 192 vaddrModule.io.waddr(i) := RegNext(loadWbIndex) 193 vaddrModule.io.wdata(i) := RegNext(io.loadIn(i).bits.vaddr) 194 vaddrModule.io.wen(i) := RegNext(io.loadIn(i).fire()) 195 } 196 197 when(io.dcache.valid) { 198 XSDebug("miss resp: paddr:0x%x data %x\n", io.dcache.bits.addr, io.dcache.bits.data) 199 } 200 201 // Refill 64 bit in a cycle 202 // Refill data comes back from io.dcache.resp 203 dataModule.io.refill.valid := io.dcache.valid 204 dataModule.io.refill.paddr := io.dcache.bits.addr 205 dataModule.io.refill.data := io.dcache.bits.data 206 207 (0 until LoadQueueSize).map(i => { 208 dataModule.io.refill.refillMask(i) := allocated(i) && miss(i) 209 when(dataModule.io.refill.valid && dataModule.io.refill.refillMask(i) && dataModule.io.refill.matchMask(i)) { 210 datavalid(i) := true.B 211 miss(i) := false.B 212 } 213 }) 214 215 // Writeback up to 2 missed load insts to CDB 216 // 217 // Pick 2 missed load (data refilled), write them back to cdb 218 // 2 refilled load will be selected from even/odd entry, separately 219 220 // Stage 0 221 // Generate writeback indexes 222 223 def getEvenBits(input: UInt): UInt = { 224 require(input.getWidth == LoadQueueSize) 225 VecInit((0 until LoadQueueSize/2).map(i => {input(2*i)})).asUInt 226 } 227 def getOddBits(input: UInt): UInt = { 228 require(input.getWidth == LoadQueueSize) 229 VecInit((0 until LoadQueueSize/2).map(i => {input(2*i+1)})).asUInt 230 } 231 232 val loadWbSel = Wire(Vec(LoadPipelineWidth, UInt(log2Up(LoadQueueSize).W))) // index selected last cycle 233 val loadWbSelV = Wire(Vec(LoadPipelineWidth, Bool())) // index selected in last cycle is valid 234 235 val loadWbSelVec = VecInit((0 until LoadQueueSize).map(i => { 236 allocated(i) && !writebacked(i) && datavalid(i) 237 })).asUInt() // use uint instead vec to reduce verilog lines 238 val evenDeqMask = getEvenBits(deqMask) 239 val oddDeqMask = getOddBits(deqMask) 240 // generate lastCycleSelect mask 241 val evenSelectMask = Mux(io.ldout(0).fire(), getEvenBits(UIntToOH(loadWbSel(0))), 0.U) 242 val oddSelectMask = Mux(io.ldout(1).fire(), getOddBits(UIntToOH(loadWbSel(1))), 0.U) 243 // generate real select vec 244 val loadEvenSelVec = getEvenBits(loadWbSelVec) & ~evenSelectMask 245 val loadOddSelVec = getOddBits(loadWbSelVec) & ~oddSelectMask 246 247 def toVec(a: UInt): Vec[Bool] = { 248 VecInit(a.asBools) 249 } 250 251 val loadWbSelGen = Wire(Vec(LoadPipelineWidth, UInt(log2Up(LoadQueueSize).W))) 252 val loadWbSelVGen = Wire(Vec(LoadPipelineWidth, Bool())) 253 loadWbSelGen(0) := Cat(getFirstOne(toVec(loadEvenSelVec), evenDeqMask), 0.U(1.W)) 254 loadWbSelVGen(0):= loadEvenSelVec.asUInt.orR 255 loadWbSelGen(1) := Cat(getFirstOne(toVec(loadOddSelVec), oddDeqMask), 1.U(1.W)) 256 loadWbSelVGen(1) := loadOddSelVec.asUInt.orR 257 258 (0 until LoadPipelineWidth).map(i => { 259 loadWbSel(i) := RegNext(loadWbSelGen(i)) 260 loadWbSelV(i) := RegNext(loadWbSelVGen(i), init = false.B) 261 when(io.ldout(i).fire()){ 262 // Mark them as writebacked, so they will not be selected in the next cycle 263 writebacked(loadWbSel(i)) := true.B 264 } 265 }) 266 267 // Stage 1 268 // Use indexes generated in cycle 0 to read data 269 // writeback data to cdb 270 (0 until LoadPipelineWidth).map(i => { 271 // data select 272 dataModule.io.wb.raddr(i) := loadWbSelGen(i) 273 val rdata = dataModule.io.wb.rdata(i).data 274 val seluop = uop(loadWbSel(i)) 275 val func = seluop.ctrl.fuOpType 276 val raddr = dataModule.io.wb.rdata(i).paddr 277 val rdataSel = LookupTree(raddr(2, 0), List( 278 "b000".U -> rdata(63, 0), 279 "b001".U -> rdata(63, 8), 280 "b010".U -> rdata(63, 16), 281 "b011".U -> rdata(63, 24), 282 "b100".U -> rdata(63, 32), 283 "b101".U -> rdata(63, 40), 284 "b110".U -> rdata(63, 48), 285 "b111".U -> rdata(63, 56) 286 )) 287 val rdataPartialLoad = rdataHelper(seluop, rdataSel) 288 289 // writeback missed int/fp load 290 // 291 // Int load writeback will finish (if not blocked) in one cycle 292 io.ldout(i).bits.uop := seluop 293 io.ldout(i).bits.uop.lqIdx := loadWbSel(i).asTypeOf(new LqPtr) 294 io.ldout(i).bits.data := rdataPartialLoad 295 io.ldout(i).bits.redirectValid := false.B 296 io.ldout(i).bits.redirect := DontCare 297 io.ldout(i).bits.debug.isMMIO := debug_mmio(loadWbSel(i)) 298 io.ldout(i).bits.debug.isPerfCnt := false.B 299 io.ldout(i).bits.fflags := DontCare 300 io.ldout(i).valid := loadWbSelV(i) 301 302 when(io.ldout(i).fire()) { 303 XSInfo("int load miss write to cbd roqidx %d lqidx %d pc 0x%x mmio %x\n", 304 io.ldout(i).bits.uop.roqIdx.asUInt, 305 io.ldout(i).bits.uop.lqIdx.asUInt, 306 io.ldout(i).bits.uop.cf.pc, 307 debug_mmio(loadWbSel(i)) 308 ) 309 } 310 311 }) 312 313 /** 314 * Load commits 315 * 316 * When load commited, mark it as !allocated and move deqPtrExt forward. 317 */ 318 (0 until CommitWidth).map(i => { 319 when(commitCount > i.U){ 320 allocated(deqPtr+i.U) := false.B 321 } 322 }) 323 324 def getFirstOne(mask: Vec[Bool], startMask: UInt) = { 325 val length = mask.length 326 val highBits = (0 until length).map(i => mask(i) & ~startMask(i)) 327 val highBitsUint = Cat(highBits.reverse) 328 PriorityEncoder(Mux(highBitsUint.orR(), highBitsUint, mask.asUInt)) 329 } 330 331 def getOldestInTwo(valid: Seq[Bool], uop: Seq[MicroOp]) = { 332 assert(valid.length == uop.length) 333 assert(valid.length == 2) 334 Mux(valid(0) && valid(1), 335 Mux(isAfter(uop(0).roqIdx, uop(1).roqIdx), uop(1), uop(0)), 336 Mux(valid(0) && !valid(1), uop(0), uop(1))) 337 } 338 339 def getAfterMask(valid: Seq[Bool], uop: Seq[MicroOp]) = { 340 assert(valid.length == uop.length) 341 val length = valid.length 342 (0 until length).map(i => { 343 (0 until length).map(j => { 344 Mux(valid(i) && valid(j), 345 isAfter(uop(i).roqIdx, uop(j).roqIdx), 346 Mux(!valid(i), true.B, false.B)) 347 }) 348 }) 349 } 350 351 /** 352 * Memory violation detection 353 * 354 * When store writes back, it searches LoadQueue for younger load instructions 355 * with the same load physical address. They loaded wrong data and need re-execution. 356 * 357 * Cycle 0: Store Writeback 358 * Generate match vector for store address with rangeMask(stPtr, enqPtr). 359 * Besides, load instructions in LoadUnit_S1 and S2 are also checked. 360 * Cycle 1: Redirect Generation 361 * There're three possible types of violations, up to 6 possible redirect requests. 362 * Choose the oldest load (part 1). (4 + 2) -> (1 + 2) 363 * Cycle 2: Redirect Fire 364 * Choose the oldest load (part 2). (3 -> 1) 365 * Prepare redirect request according to the detected violation. 366 * Fire redirect request (if valid) 367 */ 368 369 // stage 0: lq l1 wb l1 wb lq 370 // | | | | | | (paddr match) 371 // stage 1: lq l1 wb l1 wb lq 372 // | | | | | | 373 // | |------------| | 374 // | | | 375 // stage 2: lq l1wb lq 376 // | | | 377 // -------------------- 378 // | 379 // rollback req 380 io.load_s1 := DontCare 381 def detectRollback(i: Int) = { 382 val startIndex = io.storeIn(i).bits.uop.lqIdx.value 383 val lqIdxMask = UIntToMask(startIndex, LoadQueueSize) 384 val xorMask = lqIdxMask ^ enqMask 385 val sameFlag = io.storeIn(i).bits.uop.lqIdx.flag === enqPtrExt(0).flag 386 val toEnqPtrMask = Mux(sameFlag, xorMask, ~xorMask) 387 388 // check if load already in lq needs to be rolledback 389 dataModule.io.violation(i).paddr := io.storeIn(i).bits.paddr 390 dataModule.io.violation(i).mask := io.storeIn(i).bits.mask 391 val addrMaskMatch = RegNext(dataModule.io.violation(i).violationMask) 392 val entryNeedCheck = RegNext(VecInit((0 until LoadQueueSize).map(j => { 393 allocated(j) && toEnqPtrMask(j) && (datavalid(j) || miss(j)) 394 }))) 395 val lqViolationVec = VecInit((0 until LoadQueueSize).map(j => { 396 addrMaskMatch(j) && entryNeedCheck(j) 397 })) 398 val lqViolation = lqViolationVec.asUInt().orR() 399 val lqViolationIndex = getFirstOne(lqViolationVec, RegNext(lqIdxMask)) 400 val lqViolationUop = uop(lqViolationIndex) 401 // lqViolationUop.lqIdx.flag := deqMask(lqViolationIndex) ^ deqPtrExt.flag 402 // lqViolationUop.lqIdx.value := lqViolationIndex 403 XSDebug(lqViolation, p"${Binary(Cat(lqViolationVec))}, $startIndex, $lqViolationIndex\n") 404 405 // when l/s writeback to roq together, check if rollback is needed 406 val wbViolationVec = RegNext(VecInit((0 until LoadPipelineWidth).map(j => { 407 io.loadIn(j).valid && 408 isAfter(io.loadIn(j).bits.uop.roqIdx, io.storeIn(i).bits.uop.roqIdx) && 409 io.storeIn(i).bits.paddr(PAddrBits - 1, 3) === io.loadIn(j).bits.paddr(PAddrBits - 1, 3) && 410 (io.storeIn(i).bits.mask & io.loadIn(j).bits.mask).orR 411 }))) 412 val wbViolation = wbViolationVec.asUInt().orR() 413 val wbViolationUop = getOldestInTwo(wbViolationVec, RegNext(VecInit(io.loadIn.map(_.bits.uop)))) 414 XSDebug(wbViolation, p"${Binary(Cat(wbViolationVec))}, $wbViolationUop\n") 415 416 // check if rollback is needed for load in l1 417 val l1ViolationVec = RegNext(VecInit((0 until LoadPipelineWidth).map(j => { 418 io.load_s1(j).valid && // L1 valid 419 isAfter(io.load_s1(j).uop.roqIdx, io.storeIn(i).bits.uop.roqIdx) && 420 io.storeIn(i).bits.paddr(PAddrBits - 1, 3) === io.load_s1(j).paddr(PAddrBits - 1, 3) && 421 (io.storeIn(i).bits.mask & io.load_s1(j).mask).orR 422 }))) 423 val l1Violation = l1ViolationVec.asUInt().orR() 424 val l1ViolationUop = getOldestInTwo(l1ViolationVec, RegNext(VecInit(io.load_s1.map(_.uop)))) 425 XSDebug(l1Violation, p"${Binary(Cat(l1ViolationVec))}, $l1ViolationUop\n") 426 427 XSDebug( 428 l1Violation, 429 "need rollback (l4 load) pc %x roqidx %d target %x\n", 430 io.storeIn(i).bits.uop.cf.pc, io.storeIn(i).bits.uop.roqIdx.asUInt, l1ViolationUop.roqIdx.asUInt 431 ) 432 XSDebug( 433 lqViolation, 434 "need rollback (ld wb before store) pc %x roqidx %d target %x\n", 435 io.storeIn(i).bits.uop.cf.pc, io.storeIn(i).bits.uop.roqIdx.asUInt, lqViolationUop.roqIdx.asUInt 436 ) 437 XSDebug( 438 wbViolation, 439 "need rollback (ld/st wb together) pc %x roqidx %d target %x\n", 440 io.storeIn(i).bits.uop.cf.pc, io.storeIn(i).bits.uop.roqIdx.asUInt, wbViolationUop.roqIdx.asUInt 441 ) 442 443 ((lqViolation, lqViolationUop), (wbViolation, wbViolationUop), (l1Violation, l1ViolationUop)) 444 } 445 446 def rollbackSel(a: Valid[MicroOp], b: Valid[MicroOp]): ValidIO[MicroOp] = { 447 Mux( 448 a.valid, 449 Mux( 450 b.valid, 451 Mux(isAfter(a.bits.roqIdx, b.bits.roqIdx), b, a), // a,b both valid, sel oldest 452 a // sel a 453 ), 454 b // sel b 455 ) 456 } 457 val lastCycleRedirect = RegNext(io.brqRedirect) 458 val lastlastCycleRedirect = RegNext(lastCycleRedirect) 459 val lastCycleFlush = RegNext(io.flush) 460 val lastlastCycleFlush = RegNext(lastCycleFlush) 461 462 // S2: select rollback (part1) and generate rollback request 463 // rollback check 464 // Wb/L1 rollback seq check is done in s2 465 val rollbackWb = Wire(Vec(StorePipelineWidth, Valid(new MicroOp))) 466 val rollbackL1 = Wire(Vec(StorePipelineWidth, Valid(new MicroOp))) 467 val rollbackL1Wb = Wire(Vec(StorePipelineWidth*2, Valid(new MicroOp))) 468 // Lq rollback seq check is done in s3 (next stage), as getting rollbackLq MicroOp is slow 469 val rollbackLq = Wire(Vec(StorePipelineWidth, Valid(new MicroOp))) 470 for (i <- 0 until StorePipelineWidth) { 471 val detectedRollback = detectRollback(i) 472 rollbackLq(i).valid := detectedRollback._1._1 && RegNext(io.storeIn(i).valid) 473 rollbackLq(i).bits := detectedRollback._1._2 474 rollbackWb(i).valid := detectedRollback._2._1 && RegNext(io.storeIn(i).valid) 475 rollbackWb(i).bits := detectedRollback._2._2 476 rollbackL1(i).valid := detectedRollback._3._1 && RegNext(io.storeIn(i).valid) 477 rollbackL1(i).bits := detectedRollback._3._2 478 rollbackL1Wb(2*i) := rollbackL1(i) 479 rollbackL1Wb(2*i+1) := rollbackWb(i) 480 } 481 482 val rollbackL1WbSelected = ParallelOperation(rollbackL1Wb, rollbackSel) 483 val rollbackL1WbVReg = RegNext(rollbackL1WbSelected.valid) 484 val rollbackL1WbReg = RegEnable(rollbackL1WbSelected.bits, rollbackL1WbSelected.valid) 485 val rollbackLq0VReg = RegNext(rollbackLq(0).valid) 486 val rollbackLq0Reg = RegEnable(rollbackLq(0).bits, rollbackLq(0).valid) 487 val rollbackLq1VReg = RegNext(rollbackLq(1).valid) 488 val rollbackLq1Reg = RegEnable(rollbackLq(1).bits, rollbackLq(1).valid) 489 490 // S3: select rollback (part2), generate rollback request, then fire rollback request 491 // Note that we use roqIdx - 1.U to flush the load instruction itself. 492 // Thus, here if last cycle's roqIdx equals to this cycle's roqIdx, it still triggers the redirect. 493 494 // FIXME: this is ugly 495 val rollbackValidVec = Seq(rollbackL1WbVReg, rollbackLq0VReg, rollbackLq1VReg) 496 val rollbackUopVec = Seq(rollbackL1WbReg, rollbackLq0Reg, rollbackLq1Reg) 497 498 // select uop in parallel 499 val mask = getAfterMask(rollbackValidVec, rollbackUopVec) 500 val oneAfterZero = mask(1)(0) 501 val rollbackUop = Mux(oneAfterZero && mask(2)(0), 502 rollbackUopVec(0), 503 Mux(!oneAfterZero && mask(2)(1), rollbackUopVec(1), rollbackUopVec(2))) 504 505 // check if rollback request is still valid in parallel 506 val rollbackValidVecChecked = Wire(Vec(3, Bool())) 507 for(((v, uop), idx) <- rollbackValidVec.zip(rollbackUopVec).zipWithIndex) { 508 rollbackValidVecChecked(idx) := v && 509 (!lastCycleRedirect.valid || !isAfter(uop.roqIdx, lastCycleRedirect.bits.roqIdx)) && 510 (!lastlastCycleRedirect.valid || !isAfter(uop.roqIdx, lastlastCycleRedirect.bits.roqIdx)) 511 } 512 513 io.rollback.bits.roqIdx := rollbackUop.roqIdx 514 io.rollback.bits.ftqIdx := rollbackUop.cf.ftqPtr 515 io.rollback.bits.ftqOffset := rollbackUop.cf.ftqOffset 516 io.rollback.bits.level := RedirectLevel.flush 517 io.rollback.bits.interrupt := DontCare 518 io.rollback.bits.cfiUpdate := DontCare 519 io.rollback.bits.cfiUpdate.target := rollbackUop.cf.pc 520 // io.rollback.bits.pc := DontCare 521 522 io.rollback.valid := rollbackValidVecChecked.asUInt.orR && !lastCycleFlush && !lastlastCycleFlush 523 524 when(io.rollback.valid) { 525 // XSDebug("Mem rollback: pc %x roqidx %d\n", io.rollback.bits.cfi, io.rollback.bits.roqIdx.asUInt) 526 } 527 528 /** 529 * Memory mapped IO / other uncached operations 530 * 531 * States: 532 * (1) writeback from store units: mark as pending 533 * (2) when they reach ROB's head, they can be sent to uncache channel 534 * (3) response from uncache channel: mark as datavalid 535 * (4) writeback to ROB (and other units): mark as writebacked 536 * (5) ROB commits the instruction: same as normal instructions 537 */ 538 //(2) when they reach ROB's head, they can be sent to uncache channel 539 val s_idle :: s_req :: s_resp :: s_wait :: Nil = Enum(4) 540 val uncacheState = RegInit(s_idle) 541 switch(uncacheState) { 542 is(s_idle) { 543 when(io.roq.pendingld && pending(deqPtr) && allocated(deqPtr)) { 544 uncacheState := s_req 545 } 546 } 547 is(s_req) { 548 when(io.uncache.req.fire()) { 549 uncacheState := s_resp 550 } 551 } 552 is(s_resp) { 553 when(io.uncache.resp.fire()) { 554 uncacheState := s_wait 555 } 556 } 557 is(s_wait) { 558 when(io.roq.commit) { 559 uncacheState := s_idle // ready for next mmio 560 } 561 } 562 } 563 io.uncache.req.valid := uncacheState === s_req 564 565 dataModule.io.uncache.raddr := deqPtrExtNext.value 566 567 io.uncache.req.bits.cmd := MemoryOpConstants.M_XRD 568 io.uncache.req.bits.addr := dataModule.io.uncache.rdata.paddr 569 io.uncache.req.bits.data := dataModule.io.uncache.rdata.data 570 io.uncache.req.bits.mask := dataModule.io.uncache.rdata.mask 571 572 io.uncache.req.bits.id := DontCare 573 574 io.uncache.resp.ready := true.B 575 576 when (io.uncache.req.fire()) { 577 pending(deqPtr) := false.B 578 579 XSDebug("uncache req: pc %x addr %x data %x op %x mask %x\n", 580 uop(deqPtr).cf.pc, 581 io.uncache.req.bits.addr, 582 io.uncache.req.bits.data, 583 io.uncache.req.bits.cmd, 584 io.uncache.req.bits.mask 585 ) 586 } 587 588 // (3) response from uncache channel: mark as datavalid 589 dataModule.io.uncache.wen := false.B 590 when(io.uncache.resp.fire()){ 591 datavalid(deqPtr) := true.B 592 dataModule.io.uncacheWrite(deqPtr, io.uncache.resp.bits.data(XLEN-1, 0)) 593 dataModule.io.uncache.wen := true.B 594 595 XSDebug("uncache resp: data %x\n", io.dcache.bits.data) 596 } 597 598 // Read vaddr for mem exception 599 vaddrModule.io.raddr(0) := deqPtr + io.roq.lcommit 600 io.exceptionAddr.vaddr := vaddrModule.io.rdata(0) 601 602 // misprediction recovery / exception redirect 603 // invalidate lq term using robIdx 604 val needCancel = Wire(Vec(LoadQueueSize, Bool())) 605 for (i <- 0 until LoadQueueSize) { 606 needCancel(i) := uop(i).roqIdx.needFlush(io.brqRedirect, io.flush) && allocated(i) 607 when (needCancel(i)) { 608 allocated(i) := false.B 609 } 610 } 611 612 /** 613 * update pointers 614 */ 615 val lastCycleCancelCount = PopCount(RegNext(needCancel)) 616 // when io.brqRedirect.valid, we don't allow eneuque even though it may fire. 617 val enqNumber = Mux(io.enq.canAccept && io.enq.sqCanAccept && !(io.brqRedirect.valid || io.flush), PopCount(io.enq.req.map(_.valid)), 0.U) 618 when (lastCycleRedirect.valid || lastCycleFlush) { 619 // we recover the pointers in the next cycle after redirect 620 enqPtrExt := VecInit(enqPtrExt.map(_ - lastCycleCancelCount)) 621 }.otherwise { 622 enqPtrExt := VecInit(enqPtrExt.map(_ + enqNumber)) 623 } 624 625 deqPtrExtNext := deqPtrExt + commitCount 626 deqPtrExt := deqPtrExtNext 627 628 val validCount = distanceBetween(enqPtrExt(0), deqPtrExt) 629 630 allowEnqueue := validCount + enqNumber <= (LoadQueueSize - RenameWidth).U 631 632 // debug info 633 XSDebug("enqPtrExt %d:%d deqPtrExt %d:%d\n", enqPtrExt(0).flag, enqPtr, deqPtrExt.flag, deqPtr) 634 635 def PrintFlag(flag: Bool, name: String): Unit = { 636 when(flag) { 637 XSDebug(false, true.B, name) 638 }.otherwise { 639 XSDebug(false, true.B, " ") 640 } 641 } 642 643 for (i <- 0 until LoadQueueSize) { 644 if (i % 4 == 0) XSDebug("") 645 XSDebug(false, true.B, "%x [%x] ", uop(i).cf.pc, dataModule.io.debug(i).paddr) 646 PrintFlag(allocated(i), "a") 647 PrintFlag(allocated(i) && datavalid(i), "v") 648 PrintFlag(allocated(i) && writebacked(i), "w") 649 PrintFlag(allocated(i) && miss(i), "m") 650 // PrintFlag(allocated(i) && listening(i), "l") 651 PrintFlag(allocated(i) && pending(i), "p") 652 XSDebug(false, true.B, " ") 653 if (i % 4 == 3 || i == LoadQueueSize - 1) XSDebug(false, true.B, "\n") 654 } 655 656} 657