2007-05-28 04:21:17 +02:00
|
|
|
# Copyright (c) 2005-2007 The Regents of The University of Michigan
|
|
|
|
# All rights reserved.
|
|
|
|
#
|
|
|
|
# Redistribution and use in source and binary forms, with or without
|
|
|
|
# modification, are permitted provided that the following conditions are
|
|
|
|
# met: redistributions of source code must retain the above copyright
|
|
|
|
# notice, this list of conditions and the following disclaimer;
|
|
|
|
# redistributions in binary form must reproduce the above copyright
|
|
|
|
# notice, this list of conditions and the following disclaimer in the
|
|
|
|
# documentation and/or other materials provided with the distribution;
|
|
|
|
# neither the name of the copyright holders nor the names of its
|
|
|
|
# contributors may be used to endorse or promote products derived from
|
|
|
|
# this software without specific prior written permission.
|
|
|
|
#
|
|
|
|
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
|
|
# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
|
|
# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
|
|
# A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
|
|
# OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
|
|
# SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
|
|
# LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
|
|
# DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
|
|
# THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
|
|
# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
#
|
|
|
|
# Authors: Nathan Binkert
|
|
|
|
|
2006-09-05 02:14:07 +02:00
|
|
|
from m5.params import *
|
2006-06-30 22:25:35 +02:00
|
|
|
from MemObject import MemObject
|
2005-01-15 10:12:25 +01:00
|
|
|
|
2005-04-03 03:36:08 +02:00
|
|
|
class Prefetch(Enum): vals = ['none', 'tagged', 'stride', 'ghb']
|
|
|
|
|
2006-06-30 22:25:35 +02:00
|
|
|
class BaseCache(MemObject):
|
2005-02-03 03:13:01 +01:00
|
|
|
type = 'BaseCache'
|
2005-02-03 23:04:54 +01:00
|
|
|
adaptive_compression = Param.Bool(False,
|
2005-01-15 10:12:25 +01:00
|
|
|
"Use an adaptive compression scheme")
|
|
|
|
assoc = Param.Int("associativity")
|
|
|
|
block_size = Param.Int("block size in bytes")
|
2007-05-11 00:24:48 +02:00
|
|
|
latency = Param.Latency("Latency")
|
2005-02-03 23:04:54 +01:00
|
|
|
compressed_bus = Param.Bool(False,
|
2005-01-15 10:12:25 +01:00
|
|
|
"This cache connects to a compressed memory")
|
2005-06-02 03:44:00 +02:00
|
|
|
compression_latency = Param.Latency('0ns',
|
2005-01-15 10:12:25 +01:00
|
|
|
"Latency in cycles of compression algorithm")
|
|
|
|
hash_delay = Param.Int(1, "time in cycles of hash access")
|
2005-02-03 23:04:54 +01:00
|
|
|
lifo = Param.Bool(False,
|
2005-02-01 23:35:01 +01:00
|
|
|
"whether this NIC partition should use LIFO repl. policy")
|
2005-01-15 10:12:25 +01:00
|
|
|
max_miss_count = Param.Counter(0,
|
|
|
|
"number of misses to handle before calling exit")
|
|
|
|
mshrs = Param.Int("number of MSHRs (max outstanding requests)")
|
2005-02-03 23:04:54 +01:00
|
|
|
prioritizeRequests = Param.Bool(False,
|
2005-01-15 10:12:25 +01:00
|
|
|
"always service demand misses first")
|
|
|
|
protocol = Param.CoherenceProtocol(NULL, "coherence protocol to use")
|
|
|
|
repl = Param.Repl(NULL, "replacement policy")
|
2005-03-23 19:25:48 +01:00
|
|
|
size = Param.MemorySize("capacity in bytes")
|
2005-02-03 23:04:54 +01:00
|
|
|
split = Param.Bool(False, "whether or not this cache is split")
|
2005-02-01 23:35:01 +01:00
|
|
|
split_size = Param.Int(0,
|
|
|
|
"How many ways of the cache belong to CPU/LRU partition")
|
2005-02-03 23:04:54 +01:00
|
|
|
store_compressed = Param.Bool(False,
|
2005-01-15 10:12:25 +01:00
|
|
|
"Store compressed data in the cache")
|
|
|
|
subblock_size = Param.Int(0,
|
|
|
|
"Size of subblock in IIC used for compression")
|
|
|
|
tgts_per_mshr = Param.Int("max number of accesses per MSHR")
|
|
|
|
trace_addr = Param.Addr(0, "address to trace")
|
2005-02-03 23:04:54 +01:00
|
|
|
two_queue = Param.Bool(False,
|
2005-02-01 23:35:01 +01:00
|
|
|
"whether the lifo should have two queue replacement")
|
2005-01-15 10:12:25 +01:00
|
|
|
write_buffers = Param.Int(8, "number of write buffers")
|
2005-04-02 02:26:44 +02:00
|
|
|
prefetch_miss = Param.Bool(False,
|
|
|
|
"wheter you are using the hardware prefetcher from Miss stream")
|
|
|
|
prefetch_access = Param.Bool(False,
|
|
|
|
"wheter you are using the hardware prefetcher from Access stream")
|
2005-03-30 22:05:58 +02:00
|
|
|
prefetcher_size = Param.Int(100,
|
|
|
|
"Number of entries in the harware prefetch queue")
|
2005-04-02 02:26:44 +02:00
|
|
|
prefetch_past_page = Param.Bool(False,
|
|
|
|
"Allow prefetches to cross virtual page boundaries")
|
2005-04-03 03:36:08 +02:00
|
|
|
prefetch_serial_squash = Param.Bool(False,
|
|
|
|
"Squash prefetches with a later time on a subsequent miss")
|
|
|
|
prefetch_degree = Param.Int(1,
|
|
|
|
"Degree of the prefetch depth")
|
|
|
|
prefetch_latency = Param.Tick(10,
|
|
|
|
"Latency of the prefetcher")
|
|
|
|
prefetch_policy = Param.Prefetch('none',
|
|
|
|
"Type of prefetcher to use")
|
2005-04-04 22:25:22 +02:00
|
|
|
prefetch_cache_check_push = Param.Bool(True,
|
|
|
|
"Check if in cash on push or pop of prefetch queue")
|
|
|
|
prefetch_use_cpu_id = Param.Bool(True,
|
|
|
|
"Use the CPU ID to seperate calculations of prefetches")
|
2005-04-08 23:19:56 +02:00
|
|
|
prefetch_data_accesses_only = Param.Bool(False,
|
|
|
|
"Only prefetch on data not on instruction accesses")
|
2006-06-30 22:25:35 +02:00
|
|
|
cpu_side = Port("Port on side closer to CPU")
|
|
|
|
mem_side = Port("Port on side closer to MEM")
|