URL
https://opencores.org/ocsvn/cryptosorter/cryptosorter/trunk
Subversion Repositories cryptosorter
[/] [cryptosorter/] [trunk/] [memocodeDesignContest2008/] [xup/] [PLBMaster/] [PLBMaster_backupPPC.bsv] - Rev 6
Compare with Previous | Blame | View Log
/*Copyright (c) 2007 MITPermission is hereby granted, free of charge, to any personobtaining a copy of this software and associated documentationfiles (the "Software"), to deal in the Software withoutrestriction, including without limitation the rights to use,copy, modify, merge, publish, distribute, sublicense, and/or sellcopies of the Software, and to permit persons to whom theSoftware is furnished to do so, subject to the followingconditions:The above copyright notice and this permission notice shall beincluded in all copies or substantial portions of the Software.THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIESOF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE ANDNONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHTHOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISINGFROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OROTHER DEALINGS IN THE SOFTWARE.Author: Kermin Fleming*/// Global Importsimport GetPut::*;import FIFO::*;import RegFile::*;import BRAMInitiatorWires::*;import RegFile::*;import FIFOF::*;import BRAM::*;// Project Importsimport Types::*;import Interfaces::*;import Parameters::*;import DebugFlags::*;import BRAMInitiator::*;import PLBMasterWires::*;import StmtFSM::*;(* synthesize *)module mkPLB_backupPPC(BRAMInitiatorWires#(Bit#(14)));RegFile#(Bit#(20), Bit#(32)) matrixA <- mkRegFileFullLoad("matrixA.hex");RegFile#(Bit#(20), Bit#(32)) matrixB <- mkRegFileFullLoad("matrixB.hex");RegFile#(Bit#(20), Bit#(32)) matrixC <- mkRegFileFull();RegFile#(Bit#(20), Bit#(32)) scratch <- mkRegFileFull();RegFile#(Bit#(20), Bit#(32)) golden <- mkRegFileFullLoad("golden.hex");Reg#(Bit#(32)) goldenElementCounter <- mkReg(0);RegFile#(Bit#(16), Bit#(64)) prog <- mkRegFileFullLoad("program.hex");Reg#(Bit#(16)) prog_idx <- mkReg(0);//StateBRAMInitiator#(Bit#(14)) bramInit <- mkBRAMInitiator;let bram = bramInit.bram;//BRAM#(Bit#(14), Bit#(32)) bram <- mkBRAM_Full();FIFOF#(Bit#(32)) outQ <- mkFIFOF();FIFO#(Bit#(32)) inQ <- mkFIFO();FIFO#(Bit#(64)) commandQ <- mkFIFO();Reg#(Bit#(30)) baseAddr <- mkRegU;let minWritePtr = 0;let maxWritePtr = 129*2-1;let minReadPtr = 129*2;let maxReadPtr = 129*4-1;let burstSize = 128;Reg#(Bit#(14)) readPtr <- mkReg(minReadPtr);Reg#(Bit#(14)) writePtr <- mkReg(minWritePtr);let incWritePtr = (writePtr == maxWritePtr) ? minWritePtr : (writePtr + 1);let incReadPtr = (readPtr == maxReadPtr) ? minReadPtr : (readPtr + 1);let ready = True;let debugF = debug(False);Reg#(Bit#(10)) count <- mkReg(0);Reg#(Bit#(32)) value <- mkReg(0);Reg#(Bit#(64)) totalTicks <- mkReg(0);Reg#(Bit#(32)) rowOffset <- mkReg(0); // stored in terms of wordsfunction Action readAddr(addr);case (addr[21:20])2'b00: return (matrixA.sub(addr[19:0]));2'b01: return (matrixB.sub(addr[19:0]));2'b10: return (matrixC.sub(addr[19:0]));2'b11: return (scratch.sub(addr[19:0]));endcaseendfunctionfunction Action writeAddr(addr,val);actioncase (addr[21:20])2'b00: begindebugF($display("PLB: writing to matA %h",addr[19:0]));matrixA.upd(addr[19:0],val);end2'b01: begindebugF($display("PLB: writing to matB %h",addr[19:0]));matrixB.upd(addr[19:0],val);end2'b10: begindebugF($display("PLB: writing to matC %h",addr[19:0]));matrixC.upd(addr[19:0],val);let oldval = matrixC.sub(addr[19:0]);let goldenval = golden.sub(addr[19:0]);if ((goldenval != oldval) && (goldenval == val)) // a new correct valbegingoldenElementCounter <= goldenElementCounter +1;if (truncate(goldenElementCounter) == 16'hFFFF) // time to announce$display("Correct Value Count: %d @ %d", goldenElementCounter+1,totalTicks);if (goldenElementCounter + 1 == (rowOffset * rowOffset))begin$display("PASSED @ %d", totalTicks);$finish;endendend2'b11: begindebugF($display("PLB: writing to scratch %h",addr[19:0]));scratch.upd(addr[19:0],val);endendcaseendactionendfunction///////////////////////////////////////////////////////////// In goes to MEM, Out goes back to FPGA///////////////////////////////////////////////////////////Stmt doReadStmt =seqbram.read_req(readPtr);actionlet v <- bram.read_resp();value <= v;count <= 0;endactionif (value != 0)seqwhile(count < burstSize)seqactionreadPtr <= incReadPtr;count <= count + 1;let v <- bram.read_resp();writeAddr(baseAddr+zeroExtend(count), v);if (count <burstSize)bram.read_req(readPtr+1); //if (count == burstSize)bram.write(readPtr - burstSize, 0); // takeendactionendseqendseqendseq;FSM doRead <- mkFSM(doReadStmt);Stmt doWriteStmt =seqbram.read_req(writePtr);actionlet v <- bram.read_resp();value <= v;count <= 0;endactionif (value == 0)seqwhile(count < burstSize)seqactionwritePtr <= incWritePtr;count <= count + 1;if (count <burstSize)beginlet val = readAddr(baseAddr+zeroExtend(count));bram.write(writePtr+1, val); //endif (count == burstSize)bram.write(writePtr - burstSize, 32'hFFFFFFFF); // takeendactionendseqendseqcommandQ.deq();endseq;FSM doWrite <- mkFSM(doWriteStmt);rule doStuff(doRead.done && doWrite.done);let inst = unpack(truncate(commandQ.first));let mload = translateLoad(inst);let mstore = translateStore(inst);let mrow = translateRowSize(inst);commandQ.deq();if (isJust(mload))beginbaseAddr <= unJust(mload);doRead.start();endelse if (isJust(mstore))beginbaseAddr <= unJust(mstore);doWrite.start();endelse if (isJust(mrow))beginrowOffset <= zeroExtend(unJust(mrow));endendrulerule tick(True);totalTicks <= totalTicks +1;endrulerule doProgRead(prog.sub(prog_idx) != 64'hAAAA_AAAA_AAAA_AAAA);let x = prog.sub(prog_idx);commandQ.enq(x);prog_idx <= prog_idx + 1;endrulereturn (bramInit.bramInitiatorWires);endmodule
