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
|
|
|
|
//
|
|
|
|
// 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.
|
|
|
|
///////////////////////////////////////////
|
|
|
|
|
2021-06-07 22:54:05 +00:00
|
|
|
module tlblru #(parameter ENTRY_BITS = 3) (
|
2021-04-13 17:37:24 +00:00
|
|
|
input clk, reset,
|
|
|
|
input TLBWrite,
|
|
|
|
input TLBFlush,
|
|
|
|
input [ENTRY_BITS-1:0] VPNIndex,
|
|
|
|
input CAMHit,
|
|
|
|
output [ENTRY_BITS-1:0] WriteIndex
|
|
|
|
);
|
|
|
|
|
|
|
|
localparam NENTRIES = 2**ENTRY_BITS;
|
|
|
|
|
|
|
|
// Keep a "recently-used" record for each TLB entry. On access, set to 1
|
|
|
|
logic [NENTRIES-1:0] RUBits, RUBitsNext, RUBitsAccessed;
|
|
|
|
|
|
|
|
// One-hot encodings of which line is being accessed
|
|
|
|
logic [NENTRIES-1:0] ReadLineOneHot, WriteLineOneHot, AccessLineOneHot;
|
|
|
|
|
|
|
|
// High if the next access causes all RU bits to be 1
|
|
|
|
logic AllUsed;
|
|
|
|
|
|
|
|
// Convert indices to one-hot encodings
|
2021-06-07 22:54:05 +00:00
|
|
|
decoder #(ENTRY_BITS) readdecoder(VPNIndex, ReadLineOneHot);
|
2021-04-13 17:37:24 +00:00
|
|
|
// *** should output writelineonehot so we don't have to decode WriteIndex outside
|
2021-06-07 22:54:05 +00:00
|
|
|
decoder #(ENTRY_BITS) writedecoder(WriteIndex, WriteLineOneHot);
|
2021-04-13 17:37:24 +00:00
|
|
|
|
|
|
|
// Find the first line not recently used
|
2021-06-07 22:54:05 +00:00
|
|
|
priorityencoder #(ENTRY_BITS) firstnru(~RUBits, WriteIndex);
|
2021-04-13 17:37:24 +00:00
|
|
|
|
|
|
|
// Access either the hit line or written line
|
|
|
|
assign AccessLineOneHot = (TLBWrite) ? WriteLineOneHot : ReadLineOneHot;
|
|
|
|
|
|
|
|
// Raise the bit of the recently accessed line
|
|
|
|
assign RUBitsAccessed = AccessLineOneHot | RUBits;
|
|
|
|
|
|
|
|
// Determine whether we need to reset the RU bits to all zeroes
|
|
|
|
assign AllUsed = &(RUBitsAccessed);
|
|
|
|
assign RUBitsNext = (AllUsed) ? AccessLineOneHot : RUBitsAccessed;
|
|
|
|
|
|
|
|
// Update LRU state on any TLB hit or write
|
2021-06-07 22:54:05 +00:00
|
|
|
flopenrc #(NENTRIES) lrustate(clk, reset, TLBFlush, (CAMHit || TLBWrite),
|
2021-04-13 17:37:24 +00:00
|
|
|
RUBitsNext, RUBits);
|
|
|
|
|
|
|
|
endmodule
|