1c6d43980SLemover/*************************************************************************************** 2c6d43980SLemover* Copyright (c) 2020-2021 Institute of Computing Technology, Chinese Academy of Sciences 3f320e0f0SYinan Xu* Copyright (c) 2020-2021 Peng Cheng Laboratory 4c6d43980SLemover* 5c6d43980SLemover* XiangShan is licensed under Mulan PSL v2. 6c6d43980SLemover* You can use this software according to the terms and conditions of the Mulan PSL v2. 7c6d43980SLemover* You may obtain a copy of Mulan PSL v2 at: 8c6d43980SLemover* http://license.coscl.org.cn/MulanPSL2 9c6d43980SLemover* 10c6d43980SLemover* THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OF ANY KIND, 11c6d43980SLemover* EITHER EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO NON-INFRINGEMENT, 12c6d43980SLemover* MERCHANTABILITY OR FIT FOR A PARTICULAR PURPOSE. 13c6d43980SLemover* 14c6d43980SLemover* See the Mulan PSL v2 for more details. 15c6d43980SLemover***************************************************************************************/ 16c6d43980SLemover 17cafb3558SLinJiaweipackage xiangshan.backend.fu 18cafb3558SLinJiawei 192225d46eSJiawei Linimport chipsalliance.rocketchip.config.Parameters 20cafb3558SLinJiaweiimport chisel3._ 21cafb3558SLinJiaweiimport chisel3.util._ 22cafb3558SLinJiaweiimport xiangshan._ 23b9fd1892SLinJiaweiimport utils._ 247f1506e3SLinJiaweiimport xiangshan.backend.fu.util.{C22, C32, C53} 25cafb3558SLinJiawei 26cafb3558SLinJiaweiclass MulDivCtrl extends Bundle{ 27cafb3558SLinJiawei val sign = Bool() 28cafb3558SLinJiawei val isW = Bool() 29cafb3558SLinJiawei val isHi = Bool() // return hi bits of result ? 30cafb3558SLinJiawei} 31cafb3558SLinJiawei 322225d46eSJiawei Linclass AbstractMultiplier(len: Int)(implicit p: Parameters) extends FunctionUnit( 33e18c367fSLinJiawei len 348a4dc19aSLinJiawei){ 358a4dc19aSLinJiawei val ctrl = IO(Input(new MulDivCtrl)) 368a4dc19aSLinJiawei} 378a4dc19aSLinJiawei 382225d46eSJiawei Linclass NaiveMultiplier(len: Int, val latency: Int)(implicit p: Parameters) 3952c3f215SLinJiawei extends AbstractMultiplier(len) 40e18c367fSLinJiawei with HasPipelineReg 4112bb47ddSLinJiawei{ 423142d695SLinJiawei 433142d695SLinJiawei val (src1, src2) = (io.in.bits.src(0), io.in.bits.src(1)) 44cafb3558SLinJiawei 453142d695SLinJiawei val mulRes = src1.asSInt() * src2.asSInt() 46cafb3558SLinJiawei 47cafb3558SLinJiawei var dataVec = Seq(mulRes.asUInt()) 48e18c367fSLinJiawei var ctrlVec = Seq(ctrl) 49cafb3558SLinJiawei 50cafb3558SLinJiawei for(i <- 1 to latency){ 51cafb3558SLinJiawei dataVec = dataVec :+ PipelineReg(i)(dataVec(i-1)) 523142d695SLinJiawei ctrlVec = ctrlVec :+ PipelineReg(i)(ctrlVec(i-1)) 53cafb3558SLinJiawei } 54cafb3558SLinJiawei 55cafb3558SLinJiawei val xlen = io.out.bits.data.getWidth 56cafb3558SLinJiawei val res = Mux(ctrlVec.last.isHi, dataVec.last(2*xlen-1, xlen), dataVec.last(xlen-1,0)) 57cafb3558SLinJiawei io.out.bits.data := Mux(ctrlVec.last.isW, SignExt(res(31,0),xlen), res) 58cafb3558SLinJiawei 59e18c367fSLinJiawei XSDebug(p"validVec:${Binary(Cat(validVec))} flushVec:${Binary(Cat(flushVec))}\n") 60cafb3558SLinJiawei} 618a4dc19aSLinJiawei 62*c3d7991bSJiawei Linclass ArrayMulDataModule(len: Int) extends Module { 63e2203130SLinJiawei val io = IO(new Bundle() { 64e2203130SLinJiawei val a, b = Input(UInt(len.W)) 65*c3d7991bSJiawei Lin val regEnables = Input(Vec(2, Bool())) 66e2203130SLinJiawei val result = Output(UInt((2 * len).W)) 67e2203130SLinJiawei }) 68e2203130SLinJiawei val (a, b) = (io.a, io.b) 698a4dc19aSLinJiawei 708a4dc19aSLinJiawei val b_sext, bx2, neg_b, neg_bx2 = Wire(UInt((len+1).W)) 718a4dc19aSLinJiawei b_sext := SignExt(b, len+1) 728a4dc19aSLinJiawei bx2 := b_sext << 1 738a4dc19aSLinJiawei neg_b := (~b_sext).asUInt() 748a4dc19aSLinJiawei neg_bx2 := neg_b << 1 758a4dc19aSLinJiawei 768a4dc19aSLinJiawei val columns: Array[Seq[Bool]] = Array.fill(2*len)(Seq()) 778a4dc19aSLinJiawei 788a4dc19aSLinJiawei var last_x = WireInit(0.U(3.W)) 798a4dc19aSLinJiawei for(i <- Range(0, len, 2)){ 808a4dc19aSLinJiawei val x = if(i==0) Cat(a(1,0), 0.U(1.W)) else if(i+1==len) SignExt(a(i, i-1), 3) else a(i+1, i-1) 818a4dc19aSLinJiawei val pp_temp = MuxLookup(x, 0.U, Seq( 828a4dc19aSLinJiawei 1.U -> b_sext, 838a4dc19aSLinJiawei 2.U -> b_sext, 848a4dc19aSLinJiawei 3.U -> bx2, 858a4dc19aSLinJiawei 4.U -> neg_bx2, 868a4dc19aSLinJiawei 5.U -> neg_b, 878a4dc19aSLinJiawei 6.U -> neg_b 888a4dc19aSLinJiawei )) 898a4dc19aSLinJiawei val s = pp_temp(len) 908a4dc19aSLinJiawei val t = MuxLookup(last_x, 0.U(2.W), Seq( 918a4dc19aSLinJiawei 4.U -> 2.U(2.W), 928a4dc19aSLinJiawei 5.U -> 1.U(2.W), 938a4dc19aSLinJiawei 6.U -> 1.U(2.W) 948a4dc19aSLinJiawei )) 958a4dc19aSLinJiawei last_x = x 968a4dc19aSLinJiawei val (pp, weight) = i match { 978a4dc19aSLinJiawei case 0 => 988a4dc19aSLinJiawei (Cat(~s, s, s, pp_temp), 0) 998a4dc19aSLinJiawei case n if (n==len-1) || (n==len-2) => 1008a4dc19aSLinJiawei (Cat(~s, pp_temp, t), i-2) 1018a4dc19aSLinJiawei case _ => 1028a4dc19aSLinJiawei (Cat(1.U(1.W), ~s, pp_temp, t), i-2) 1038a4dc19aSLinJiawei } 1048a4dc19aSLinJiawei for(j <- columns.indices){ 1058a4dc19aSLinJiawei if(j >= weight && j < (weight + pp.getWidth)){ 1068a4dc19aSLinJiawei columns(j) = columns(j) :+ pp(j-weight) 1078a4dc19aSLinJiawei } 1088a4dc19aSLinJiawei } 1098a4dc19aSLinJiawei } 1108a4dc19aSLinJiawei 1118a4dc19aSLinJiawei def addOneColumn(col: Seq[Bool], cin: Seq[Bool]): (Seq[Bool], Seq[Bool], Seq[Bool]) = { 1128a4dc19aSLinJiawei var sum = Seq[Bool]() 1138a4dc19aSLinJiawei var cout1 = Seq[Bool]() 1148a4dc19aSLinJiawei var cout2 = Seq[Bool]() 1158a4dc19aSLinJiawei col.size match { 1168a4dc19aSLinJiawei case 1 => // do nothing 1178a4dc19aSLinJiawei sum = col ++ cin 1188a4dc19aSLinJiawei case 2 => 1198a4dc19aSLinJiawei val c22 = Module(new C22) 1208a4dc19aSLinJiawei c22.io.in := col 1218a4dc19aSLinJiawei sum = c22.io.out(0).asBool() +: cin 1228a4dc19aSLinJiawei cout2 = Seq(c22.io.out(1).asBool()) 1238a4dc19aSLinJiawei case 3 => 1248a4dc19aSLinJiawei val c32 = Module(new C32) 1258a4dc19aSLinJiawei c32.io.in := col 1268a4dc19aSLinJiawei sum = c32.io.out(0).asBool() +: cin 1278a4dc19aSLinJiawei cout2 = Seq(c32.io.out(1).asBool()) 1288a4dc19aSLinJiawei case 4 => 1298a4dc19aSLinJiawei val c53 = Module(new C53) 1308a4dc19aSLinJiawei for((x, y) <- c53.io.in.take(4) zip col){ 1318a4dc19aSLinJiawei x := y 1328a4dc19aSLinJiawei } 1338a4dc19aSLinJiawei c53.io.in.last := (if(cin.nonEmpty) cin.head else 0.U) 1348a4dc19aSLinJiawei sum = Seq(c53.io.out(0).asBool()) ++ (if(cin.nonEmpty) cin.drop(1) else Nil) 1358a4dc19aSLinJiawei cout1 = Seq(c53.io.out(1).asBool()) 1368a4dc19aSLinJiawei cout2 = Seq(c53.io.out(2).asBool()) 1378a4dc19aSLinJiawei case n => 1388a4dc19aSLinJiawei val cin_1 = if(cin.nonEmpty) Seq(cin.head) else Nil 1398a4dc19aSLinJiawei val cin_2 = if(cin.nonEmpty) cin.drop(1) else Nil 1408a4dc19aSLinJiawei val (s_1, c_1_1, c_1_2) = addOneColumn(col take 4, cin_1) 1418a4dc19aSLinJiawei val (s_2, c_2_1, c_2_2) = addOneColumn(col drop 4, cin_2) 1428a4dc19aSLinJiawei sum = s_1 ++ s_2 1438a4dc19aSLinJiawei cout1 = c_1_1 ++ c_2_1 1448a4dc19aSLinJiawei cout2 = c_1_2 ++ c_2_2 1458a4dc19aSLinJiawei } 1468a4dc19aSLinJiawei (sum, cout1, cout2) 1478a4dc19aSLinJiawei } 1488a4dc19aSLinJiawei 1498a4dc19aSLinJiawei def max(in: Iterable[Int]): Int = in.reduce((a, b) => if(a>b) a else b) 1508a4dc19aSLinJiawei def addAll(cols: Array[Seq[Bool]], depth: Int): (UInt, UInt) = { 1518a4dc19aSLinJiawei if(max(cols.map(_.size)) <= 2){ 1528a4dc19aSLinJiawei val sum = Cat(cols.map(_(0)).reverse) 1538a4dc19aSLinJiawei var k = 0 1548a4dc19aSLinJiawei while(cols(k).size == 1) k = k+1 1558a4dc19aSLinJiawei val carry = Cat(cols.drop(k).map(_(1)).reverse) 1568a4dc19aSLinJiawei (sum, Cat(carry, 0.U(k.W))) 1578a4dc19aSLinJiawei } else { 1588a4dc19aSLinJiawei val columns_next = Array.fill(2*len)(Seq[Bool]()) 1598a4dc19aSLinJiawei var cout1, cout2 = Seq[Bool]() 1608a4dc19aSLinJiawei for( i <- cols.indices){ 1618a4dc19aSLinJiawei val (s, c1, c2) = addOneColumn(cols(i), cout1) 1628a4dc19aSLinJiawei columns_next(i) = s ++ cout2 1638a4dc19aSLinJiawei cout1 = c1 1648a4dc19aSLinJiawei cout2 = c2 1658a4dc19aSLinJiawei } 1668a4dc19aSLinJiawei 167*c3d7991bSJiawei Lin val needReg = depth == 4 1688a4dc19aSLinJiawei val toNextLayer = if(needReg) 169*c3d7991bSJiawei Lin columns_next.map(_.map(x => RegEnable(x, io.regEnables(1)))) 1708a4dc19aSLinJiawei else 1718a4dc19aSLinJiawei columns_next 1728a4dc19aSLinJiawei 1738a4dc19aSLinJiawei addAll(toNextLayer, depth+1) 1748a4dc19aSLinJiawei } 1758a4dc19aSLinJiawei } 1768a4dc19aSLinJiawei 177*c3d7991bSJiawei Lin val columns_reg = columns.map(col => col.map(b => RegEnable(b, io.regEnables(0)))) 178*c3d7991bSJiawei Lin val (sum, carry) = addAll(cols = columns_reg, depth = 0) 179*c3d7991bSJiawei Lin 180e2203130SLinJiawei io.result := sum + carry 181e2203130SLinJiawei} 182e2203130SLinJiawei 183*c3d7991bSJiawei Linclass ArrayMultiplier(len: Int)(implicit p: Parameters) 1842225d46eSJiawei Lin extends AbstractMultiplier(len) with HasPipelineReg { 185e2203130SLinJiawei 186*c3d7991bSJiawei Lin override def latency = 2 187e2203130SLinJiawei 188*c3d7991bSJiawei Lin val mulDataModule = Module(new ArrayMulDataModule(len)) 189e2203130SLinJiawei mulDataModule.io.a := io.in.bits.src(0) 190e2203130SLinJiawei mulDataModule.io.b := io.in.bits.src(1) 191*c3d7991bSJiawei Lin mulDataModule.io.regEnables := VecInit((1 to latency) map (i => regEnable(i))) 192e2203130SLinJiawei val result = mulDataModule.io.result 1938a4dc19aSLinJiawei 1948a4dc19aSLinJiawei var ctrlVec = Seq(ctrl) 1958a4dc19aSLinJiawei for(i <- 1 to latency){ 1968a4dc19aSLinJiawei ctrlVec = ctrlVec :+ PipelineReg(i)(ctrlVec(i-1)) 1978a4dc19aSLinJiawei } 1981d072cd2SLinJiawei val xlen = len - 1 1998a4dc19aSLinJiawei val res = Mux(ctrlVec.last.isHi, result(2*xlen-1, xlen), result(xlen-1,0)) 2008a4dc19aSLinJiawei 2018a4dc19aSLinJiawei io.out.bits.data := Mux(ctrlVec.last.isW, SignExt(res(31,0),xlen), res) 2028a4dc19aSLinJiawei 2038a4dc19aSLinJiawei XSDebug(p"validVec:${Binary(Cat(validVec))} flushVec:${Binary(Cat(flushVec))}\n") 2048a4dc19aSLinJiawei}