1/*************************************************************************************** 2* Copyright (c) 2020-2021 Institute of Computing Technology, Chinese Academy of Sciences 3* Copyright (c) 2020-2021 Peng Cheng Laboratory 4* 5* XiangShan is licensed under Mulan PSL v2. 6* You can use this software according to the terms and conditions of the Mulan PSL v2. 7* You may obtain a copy of Mulan PSL v2 at: 8* http://license.coscl.org.cn/MulanPSL2 9* 10* THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OF ANY KIND, 11* EITHER EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO NON-INFRINGEMENT, 12* MERCHANTABILITY OR FIT FOR A PARTICULAR PURPOSE. 13* 14* See the Mulan PSL v2 for more details. 15***************************************************************************************/ 16 17package xiangshan.backend.issue 18 19import chipsalliance.rocketchip.config.Parameters 20import chisel3._ 21import chisel3.util._ 22import xiangshan._ 23import utils._ 24 25class WakeupQueue(number: Int)(implicit p: Parameters) extends XSModule { 26 val io = IO(new Bundle { 27 val in = Flipped(ValidIO(new MicroOp)) 28 val out = ValidIO(new MicroOp) 29 val redirect = Flipped(ValidIO(new Redirect)) 30 }) 31 if (number < 0) { 32 io.out.valid := false.B 33 io.out.bits := DontCare 34 } else if(number == 0) { 35 io.in <> io.out 36 io.out.valid := io.in.valid 37 // NOTE: no delay bypass don't care redirect 38 } else { 39 val queue = Seq.fill(number)(RegInit(0.U.asTypeOf(new Bundle{ 40 val valid = Bool() 41 val bits = new MicroOp 42 }))) 43 queue(0).valid := io.in.valid && !io.in.bits.robIdx.needFlush(io.redirect) 44 queue(0).bits := io.in.bits 45 (0 until (number-1)).map{i => 46 queue(i+1) := queue(i) 47 queue(i+1).valid := queue(i).valid && !queue(i).bits.robIdx.needFlush(io.redirect) 48 } 49 io.out.valid := queue(number-1).valid 50 io.out.bits := queue(number-1).bits 51 for (i <- 0 until number) { 52 XSDebug(queue(i).valid, p"BPQue(${i.U}): pc:${Hexadecimal(queue(i).bits.cf.pc)} robIdx:${queue(i).bits.robIdx}" + 53 p" pdest:${queue(i).bits.pdest} rfWen:${queue(i).bits.ctrl.rfWen} fpWen${queue(i).bits.ctrl.fpWen}\n") 54 } 55 } 56} 57