2022-07-07 23:01:33 +00:00
|
|
|
///////////////////////////////////////////
|
2022-08-29 11:04:05 +00:00
|
|
|
// fdivsqrtfsm.sv
|
2022-07-07 23:01:33 +00:00
|
|
|
//
|
|
|
|
// Written: David_Harris@hmc.edu, me@KatherineParry.com, Cedar Turek
|
|
|
|
// Modified:13 January 2022
|
|
|
|
//
|
|
|
|
// Purpose: Combined Divide and Square Root Floating Point and Integer Unit
|
|
|
|
//
|
|
|
|
// A component of the Wally configurable RISC-V project.
|
|
|
|
//
|
|
|
|
// Copyright (C) 2021 Harvey Mudd College & Oklahoma State University
|
|
|
|
//
|
|
|
|
// MIT LICENSE
|
|
|
|
// Permission is hereby granted, free of charge, to any person obtaining a copy of this
|
|
|
|
// software and associated documentation files (the "Software"), to deal in the Software
|
|
|
|
// without restriction, including without limitation the rights to use, copy, modify, merge,
|
|
|
|
// publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons
|
|
|
|
// to whom the Software is furnished to do so, subject to the following conditions:
|
|
|
|
//
|
|
|
|
// The above copyright notice and this permission notice shall be included 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 WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
|
|
|
|
// PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
|
|
|
|
// BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
|
|
|
|
// TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE
|
|
|
|
// OR OTHER DEALINGS IN THE SOFTWARE.
|
|
|
|
////////////////////////////////////////////////////////////////////////////////////////////////
|
|
|
|
|
|
|
|
`include "wally-config.vh"
|
|
|
|
|
2022-08-29 11:04:05 +00:00
|
|
|
module fdivsqrtfsm(
|
2022-07-07 23:01:33 +00:00
|
|
|
input logic clk,
|
|
|
|
input logic reset,
|
2022-07-22 22:02:04 +00:00
|
|
|
input logic [`DIVb+3:0] NextWSN, NextWCN, WS, WC,
|
2022-07-07 23:01:33 +00:00
|
|
|
input logic XInfE, YInfE,
|
|
|
|
input logic XZeroE, YZeroE,
|
|
|
|
input logic XNaNE, YNaNE,
|
|
|
|
input logic DivStart,
|
2022-07-22 22:02:04 +00:00
|
|
|
input logic XsE,
|
|
|
|
input logic SqrtE,
|
2022-08-20 00:53:45 +00:00
|
|
|
input logic SqrtM,
|
2022-07-15 20:16:59 +00:00
|
|
|
input logic StallE,
|
|
|
|
input logic StallM,
|
2022-08-20 00:53:45 +00:00
|
|
|
input logic [`DIVN-2:0] D, // U0.N-1
|
2022-07-22 22:02:04 +00:00
|
|
|
input logic [`DIVb+3:0] StickyWSA,
|
2022-07-12 01:30:21 +00:00
|
|
|
input logic [`DURLEN-1:0] Dur,
|
2022-08-22 17:16:12 +00:00
|
|
|
input logic [`DIVb:0] LastSM,
|
|
|
|
input logic [`DIVb:0] FirstSM,
|
|
|
|
input logic [`DIVb-1:0] LastC,
|
|
|
|
input logic [`DIVb-1:0] FirstC,
|
|
|
|
input logic [`DIVCOPIES-1:0] qn,
|
2022-07-12 01:30:21 +00:00
|
|
|
output logic [`DURLEN-1:0] EarlyTermShiftE,
|
2022-07-20 02:27:39 +00:00
|
|
|
output logic DivSE,
|
2022-07-07 23:01:33 +00:00
|
|
|
output logic DivDone,
|
2022-07-13 22:01:38 +00:00
|
|
|
output logic NegSticky,
|
2022-07-07 23:01:33 +00:00
|
|
|
output logic DivBusy
|
2022-08-23 17:14:54 +00:00
|
|
|
);
|
2022-07-07 23:01:33 +00:00
|
|
|
|
|
|
|
typedef enum logic [1:0] {IDLE, BUSY, DONE} statetype;
|
|
|
|
statetype state;
|
|
|
|
|
2022-07-12 01:30:21 +00:00
|
|
|
logic [`DURLEN-1:0] step;
|
2022-07-07 23:01:33 +00:00
|
|
|
logic WZero;
|
|
|
|
//logic [$clog2(`DIVLEN/2+3)-1:0] Dur;
|
2022-07-22 22:02:04 +00:00
|
|
|
logic [`DIVb+3:0] W;
|
2022-08-29 11:29:58 +00:00
|
|
|
logic SpecialCase;
|
2022-08-29 20:01:32 +00:00
|
|
|
logic WZeroDelayed, WZeroD; // *** later remove
|
2022-08-29 11:29:58 +00:00
|
|
|
|
2022-07-07 23:01:33 +00:00
|
|
|
//flopen #($clog2(`DIVLEN/2+3)) durflop(clk, DivStart, CalcDur, Dur);
|
|
|
|
assign DivBusy = (state == BUSY);
|
2022-07-15 20:16:59 +00:00
|
|
|
// calculate sticky bit
|
|
|
|
// - there is a chance that a value is subtracted infinitly, resulting in an exact QM result
|
2022-08-23 17:14:54 +00:00
|
|
|
// this is only a problem on radix 2 (and possibly maximally redundant 4) since minimally redundant
|
2022-07-15 20:16:59 +00:00
|
|
|
// radix-4 division can't create a QM that continually adds 0's
|
2022-08-20 00:53:45 +00:00
|
|
|
if (`RADIX == 2) begin
|
2022-08-22 17:16:12 +00:00
|
|
|
logic [`DIVb+3:0] FZero, FSticky;
|
2022-08-23 16:36:20 +00:00
|
|
|
logic [`DIVb+2:0] LastK, FirstK;
|
|
|
|
assign LastK = ({3'b111, LastC} & ~({3'b111, LastC} << 1));
|
|
|
|
assign FirstK = ({3'b111, FirstC<<1} & ~({3'b111, FirstC<<1} << 1));
|
|
|
|
assign FZero = SqrtM ? {LastSM[`DIVb], LastSM, 2'b0} | {LastK,1'b0} : {3'b1,D,{`DIVb-`DIVN+2{1'b0}}};
|
|
|
|
assign FSticky = SqrtM ? {FirstSM[`DIVb], FirstSM, 2'b0} | {FirstK,1'b0} : {3'b1,D,{`DIVb-`DIVN+2{1'b0}}};
|
2022-08-20 00:53:45 +00:00
|
|
|
// *** |... for continual -1 is not efficent fix - also only needed for radix-2
|
2022-08-22 17:16:12 +00:00
|
|
|
assign WZero = ((NextWSN^NextWCN)=={NextWSN[`DIVb+2:0]|NextWCN[`DIVb+2:0], 1'b0})|(((NextWSN+NextWCN+FZero)==0)&qn[`DIVCOPIES-1]);
|
2022-08-29 20:01:32 +00:00
|
|
|
assign DivSE = |W&~((W+FSticky)==0); //***not efficent fix == and need the & qn *** use next cycle
|
2022-08-20 00:53:45 +00:00
|
|
|
end else begin
|
|
|
|
assign WZero = ((NextWSN^NextWCN)=={NextWSN[`DIVb+2:0]|NextWCN[`DIVb+2:0], 1'b0});
|
2022-07-20 02:27:39 +00:00
|
|
|
assign DivSE = |W;
|
2022-08-20 00:53:45 +00:00
|
|
|
end
|
2022-08-29 20:01:32 +00:00
|
|
|
|
|
|
|
if (`RADIX == 2) begin
|
|
|
|
logic [`DIVb+3:0] FZero, FSticky;
|
|
|
|
logic [`DIVb+2:0] LastK, FirstK;
|
|
|
|
assign LastK = ({3'b111, LastC} & ~({3'b111, LastC} << 1));
|
|
|
|
assign FirstK = ({3'b111, FirstC<<1} & ~({3'b111, FirstC<<1} << 1));
|
|
|
|
assign FZero = SqrtM ? {LastSM[`DIVb], LastSM, 2'b0} | {LastK,1'b0} : {3'b1,D,{`DIVb-`DIVN+2{1'b0}}};
|
|
|
|
assign FSticky = SqrtM ? {FirstSM[`DIVb], FirstSM, 2'b0} | {FirstK,1'b0} : {3'b1,D,{`DIVb-`DIVN+2{1'b0}}};
|
|
|
|
// *** |... for continual -1 is not efficent fix - also only needed for radix-2
|
|
|
|
assign WZeroD = ((WS^WC)=={WS[`DIVb+2:0]|WC[`DIVb+2:0], 1'b0})|(((WS+WC+FZero)==0)&qn[`DIVCOPIES-1]);
|
|
|
|
end else begin
|
|
|
|
assign WZeroD = ((WS^WC)=={WS[`DIVb+2:0]|WC[`DIVb+2:0], 1'b0});
|
|
|
|
end
|
|
|
|
|
2022-08-29 19:01:09 +00:00
|
|
|
flopr #(1) WZeroReg(clk, reset | DivStart, WZero, WZeroDelayed);
|
2022-08-29 20:01:32 +00:00
|
|
|
assign DivDone = (state == DONE);
|
|
|
|
// assign DivDone = (state == DONE) | (WZeroDelayed & (state == BUSY));
|
2022-07-07 23:01:33 +00:00
|
|
|
assign W = WC+WS;
|
2022-07-22 22:02:04 +00:00
|
|
|
assign NegSticky = W[`DIVb+3];
|
2022-07-12 01:30:21 +00:00
|
|
|
assign EarlyTermShiftE = step;
|
2022-07-07 23:01:33 +00:00
|
|
|
|
2022-08-29 11:29:58 +00:00
|
|
|
// terminate immediately on special cases
|
|
|
|
assign SpecialCase = XZeroE | (YZeroE&~SqrtE) | XInfE | YInfE | XNaNE | YNaNE | (XsE&SqrtE);
|
|
|
|
|
2022-07-07 23:01:33 +00:00
|
|
|
always_ff @(posedge clk) begin
|
|
|
|
if (reset) begin
|
|
|
|
state <= #1 IDLE;
|
|
|
|
end else if (DivStart&~StallE) begin
|
|
|
|
step <= Dur;
|
2022-08-29 11:29:58 +00:00
|
|
|
if (SpecialCase) state <= #1 DONE;
|
|
|
|
else state <= #1 BUSY;
|
2022-08-29 19:01:09 +00:00
|
|
|
end else if (DivDone) begin
|
|
|
|
if (StallM) state <= #1 DONE;
|
|
|
|
else state <= #1 IDLE;
|
2022-07-07 23:01:33 +00:00
|
|
|
end else if (state == BUSY) begin
|
2022-08-29 20:01:32 +00:00
|
|
|
if (step == 1 | WZero ) begin
|
|
|
|
// if (step == 1 /* | WZero */) begin
|
2022-07-07 23:01:33 +00:00
|
|
|
state <= #1 DONE;
|
|
|
|
end
|
|
|
|
step <= step - 1;
|
|
|
|
end
|
|
|
|
end
|
|
|
|
endmodule
|