Xavi/cvw
1
0
Fork 0
forked from Github_Repos/cvw
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Renamed Funct3ToLSU/fromLSU -> SizeToLSU/FromLSU and simplified size muxing in lsuArb

Browse Source
This commit is contained in:
David Harris 2021-07-04 19:02:56 -04:00
parent 600e7802dd
commit 0aae58abed
1 changed files with 24 additions and 18 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

42
wally-pipelined/src/uncore/plic.sv
View File

@ -164,27 +164,31 @@ module plic (
flopr #(N) intPendingFlop(HCLK,~HRESETn,nextIntPending,intPending); flopr #(N) intPendingFlop(HCLK,~HRESETn,nextIntPending,intPending);
// pending array - indexed by priority_lvl x source_ID // pending array - indexed by priority_lvl x source_ID
genvar i; genvar i, j;
generate generate
for (i=1; i<=N; i=i+1) begin for (j=1; j<=7; j++) begin: pending
// *** make sure that this synthesizes into N decoders, not 7*N 3-bit equality comparators (right?) for (i=1; i<=N; i=i+1) begin: pendingbit
assign pendingArray[7][i] = (intPriority[i]==7) & intEn[i] & intPending[i]; // *** make sure that this synthesizes into N decoders, not 7*N 3-bit equality comparators (right?)
assign pendingArray[6][i] = (intPriority[i]==6) & intEn[i] & intPending[i]; assign pendingArray[j][i] = (intPriority[i]==j) & intEn[i] & intPending[i];
assign pendingArray[5][i] = (intPriority[i]==5) & intEn[i] & intPending[i]; /* assign pendingArray[6][i] = (intPriority[i]==6) & intEn[i] & intPending[i];
assign pendingArray[4][i] = (intPriority[i]==4) & intEn[i] & intPending[i]; assign pendingArray[5][i] = (intPriority[i]==5) & intEn[i] & intPending[i];
assign pendingArray[3][i] = (intPriority[i]==3) & intEn[i] & intPending[i]; assign pendingArray[4][i] = (intPriority[i]==4) & intEn[i] & intPending[i];
assign pendingArray[2][i] = (intPriority[i]==2) & intEn[i] & intPending[i]; assign pendingArray[3][i] = (intPriority[i]==3) & intEn[i] & intPending[i];
assign pendingArray[1][i] = (intPriority[i]==1) & intEn[i] & intPending[i]; assign pendingArray[2][i] = (intPriority[i]==2) & intEn[i] & intPending[i];
assign pendingArray[1][i] = (intPriority[i]==1) & intEn[i] & intPending[i]; */
end
end end
endgenerate endgenerate
// pending array, except grouped by priority // pending array, except grouped by priority
assign pendingPGrouped[7:1] = {|pendingArray[7], /* assign pendingPGrouped[7:1] = {|pendingArray[7],
|pendingArray[6], |pendingArray[6],
|pendingArray[5], |pendingArray[5],
|pendingArray[4], |pendingArray[4],
|pendingArray[3], |pendingArray[3],
|pendingArray[2], |pendingArray[2],
|pendingArray[1]}; |pendingArray[1]}; */
assign pendingPGrouped = pendingArray.or;
// pendingPGrouped, except only topmost priority is active // pendingPGrouped, except only topmost priority is active
assign pendingMaxP[7:1] = {pendingPGrouped[7], assign pendingMaxP[7:1] = {pendingPGrouped[7],
pendingPGrouped[6] & ~|pendingPGrouped[7], pendingPGrouped[6] & ~|pendingPGrouped[7],
@ -202,14 +206,16 @@ module plic (
| ({N{pendingMaxP[2]}} & pendingArray[2]) | ({N{pendingMaxP[2]}} & pendingArray[2])
| ({N{pendingMaxP[1]}} & pendingArray[1]); | ({N{pendingMaxP[1]}} & pendingArray[1]);
// find the lowest ID amongst active interrupts at the highest priority // find the lowest ID amongst active interrupts at the highest priority
integer j; genvar k;
// *** verify that this synthesizes to a reasonable priority encoder and that j doesn't actually exist in hardware // *** verify that this synthesizes to a reasonable priority encoder and that j doesn't actually exist in hardware
always_comb begin generate
intClaim = 6'b0; always_comb begin
for(j=N; j>0; j=j-1) begin intClaim = 6'b0;
if(pendingRequestsAtMaxP[j]) intClaim = j[5:0]; for(k=N; k>0; k=k-1) begin:priorityenc
if(pendingRequestsAtMaxP[k]) intClaim = k;
end
end end
end endgenerate
// create threshold mask // create threshold mask
always_comb begin always_comb begin