2021-04-13 17:37:24 +00:00
|
|
|
///////////////////////////////////////////
|
2021-06-07 22:54:05 +00:00
|
|
|
// tlblru.sv
|
2021-04-13 17:37:24 +00:00
|
|
|
//
|
|
|
|
// Written: tfleming@hmc.edu & jtorrey@hmc.edu 16 February 2021
|
|
|
|
// Modified:
|
|
|
|
//
|
|
|
|
// Purpose: Implementation of bit pseudo least-recently-used algorithm for
|
|
|
|
// cache evictions. Outputs the index of the next entry to be written.
|
|
|
|
//
|
|
|
|
// A component of the Wally configurable RISC-V project.
|
|
|
|
//
|
|
|
|
// Copyright (C) 2021 Harvey Mudd College & Oklahoma State University
|
|
|
|
//
|
2022-01-07 12:58:40 +00:00
|
|
|
// 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:
|
2021-04-13 17:37:24 +00:00
|
|
|
//
|
2022-01-07 12:58:40 +00:00
|
|
|
// The above copyright notice and this permission notice shall be included in all copies or
|
|
|
|
// substantial portions of the Software.
|
2021-04-13 17:37:24 +00:00
|
|
|
//
|
2022-01-07 12:58:40 +00:00
|
|
|
// 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.
|
|
|
|
////////////////////////////////////////////////////////////////////////////////////////////////
|
2021-04-13 17:37:24 +00:00
|
|
|
|
2021-07-04 21:52:00 +00:00
|
|
|
module tlblru #(parameter TLB_ENTRIES = 8) (
|
|
|
|
input logic clk, reset,
|
|
|
|
input logic TLBWrite,
|
|
|
|
input logic TLBFlush,
|
2021-07-07 10:32:26 +00:00
|
|
|
input logic [TLB_ENTRIES-1:0] Matches,
|
2021-07-04 21:52:00 +00:00
|
|
|
input logic CAMHit,
|
2021-07-06 14:38:30 +00:00
|
|
|
output logic [TLB_ENTRIES-1:0] WriteEnables
|
2021-04-13 17:37:24 +00:00
|
|
|
);
|
|
|
|
|
2021-07-04 21:52:00 +00:00
|
|
|
logic [TLB_ENTRIES-1:0] RUBits, RUBitsNext, RUBitsAccessed;
|
2021-07-06 14:38:30 +00:00
|
|
|
logic [TLB_ENTRIES-1:0] WriteLines;
|
2021-07-04 21:52:00 +00:00
|
|
|
logic [TLB_ENTRIES-1:0] AccessLines; // One-hot encodings of which line is being accessed
|
|
|
|
logic AllUsed; // High if the next access causes all RU bits to be 1
|
2021-04-13 17:37:24 +00:00
|
|
|
|
|
|
|
// Find the first line not recently used
|
2021-07-23 16:57:58 +00:00
|
|
|
priorityonehot #(TLB_ENTRIES) nru(.a(~RUBits), .y(WriteLines));
|
2021-04-13 17:37:24 +00:00
|
|
|
|
2021-07-04 21:01:22 +00:00
|
|
|
// Track recently used lines, updating on a CAM Hit or TLB write
|
2021-07-06 14:38:30 +00:00
|
|
|
assign WriteEnables = WriteLines & {(TLB_ENTRIES){TLBWrite}};
|
2021-07-07 10:32:26 +00:00
|
|
|
assign AccessLines = TLBWrite ? WriteLines : Matches;
|
2021-07-04 20:33:13 +00:00
|
|
|
assign RUBitsAccessed = AccessLines | RUBits;
|
2021-07-04 21:01:22 +00:00
|
|
|
assign AllUsed = &RUBitsAccessed; // if all recently used, then clear to none
|
|
|
|
assign RUBitsNext = AllUsed ? 0 : RUBitsAccessed;
|
2022-01-07 04:07:04 +00:00
|
|
|
|
|
|
|
// enable must be ORd with TLBFlush to ensure flop fires on a flush. DH 7/8/21
|
2022-01-02 21:47:21 +00:00
|
|
|
flopenrc #(TLB_ENTRIES) lrustate(clk, reset, TLBFlush, (CAMHit | TLBWrite), RUBitsNext, RUBits);
|
2021-04-13 17:37:24 +00:00
|
|
|
endmodule
|