2010-01-30 05:29:24 +01:00
|
|
|
# Copyright (c) 2006-2007 The Regents of The University of Michigan
|
|
|
|
# Copyright (c) 2009 Advanced Micro Devices, Inc.
|
|
|
|
# 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: Brad Beckmann
|
|
|
|
|
2011-03-28 17:49:36 +02:00
|
|
|
import math
|
2010-01-30 05:29:24 +01:00
|
|
|
import m5
|
|
|
|
from m5.objects import *
|
|
|
|
from m5.defines import buildEnv
|
2012-07-11 07:51:53 +02:00
|
|
|
from Ruby import create_topology
|
2014-11-06 12:42:22 +01:00
|
|
|
from Ruby import send_evicts
|
2010-01-30 05:29:24 +01:00
|
|
|
|
|
|
|
#
|
|
|
|
# Note: the cache latency is only used by the sequencer on fast path hits
|
|
|
|
#
|
|
|
|
class Cache(RubyCache):
|
|
|
|
latency = 3
|
|
|
|
|
2010-08-20 20:44:09 +02:00
|
|
|
def define_options(parser):
|
|
|
|
return
|
|
|
|
|
2014-11-06 12:41:44 +01:00
|
|
|
def create_system(options, full_system, system, dma_ports, ruby_system):
|
2010-01-30 05:29:24 +01:00
|
|
|
|
|
|
|
if buildEnv['PROTOCOL'] != 'MI_example':
|
|
|
|
panic("This script requires the MI_example protocol to be built.")
|
|
|
|
|
|
|
|
cpu_sequencers = []
|
|
|
|
|
|
|
|
#
|
|
|
|
# The ruby network creation expects the list of nodes in the system to be
|
|
|
|
# consistent with the NetDest list. Therefore the l1 controller nodes must be
|
|
|
|
# listed before the directory nodes and directory nodes before dma nodes, etc.
|
|
|
|
#
|
|
|
|
l1_cntrl_nodes = []
|
|
|
|
dir_cntrl_nodes = []
|
|
|
|
dma_cntrl_nodes = []
|
|
|
|
|
|
|
|
#
|
|
|
|
# Must create the individual controllers before the network to ensure the
|
|
|
|
# controller constructors are called before the network constructor
|
|
|
|
#
|
2011-03-25 18:13:50 +01:00
|
|
|
block_size_bits = int(math.log(options.cacheline_size, 2))
|
2011-04-29 02:18:14 +02:00
|
|
|
|
2010-01-30 05:29:24 +01:00
|
|
|
for i in xrange(options.num_cpus):
|
|
|
|
#
|
|
|
|
# First create the Ruby objects associated with this cpu
|
|
|
|
# Only one cache exists for this protocol, so by default use the L1D
|
|
|
|
# config parameters.
|
|
|
|
#
|
|
|
|
cache = Cache(size = options.l1d_size,
|
2011-03-25 18:13:50 +01:00
|
|
|
assoc = options.l1d_assoc,
|
|
|
|
start_index_bit = block_size_bits)
|
2010-01-30 05:29:24 +01:00
|
|
|
|
|
|
|
#
|
|
|
|
# Only one unified L1 cache exists. Can cache instructions and data.
|
|
|
|
#
|
2011-05-23 23:29:23 +02:00
|
|
|
l1_cntrl = L1Cache_Controller(version = i,
|
2011-07-01 02:49:26 +02:00
|
|
|
cacheMemory = cache,
|
2014-11-06 12:42:22 +01:00
|
|
|
send_evictions = send_evicts(options),
|
2013-08-20 18:32:31 +02:00
|
|
|
transitions_per_cycle = options.ports,
|
2014-09-01 23:55:30 +02:00
|
|
|
clk_domain=system.cpu[i].clk_domain,
|
2011-07-01 02:49:26 +02:00
|
|
|
ruby_system = ruby_system)
|
2011-05-23 23:29:23 +02:00
|
|
|
|
2010-03-22 05:22:20 +01:00
|
|
|
cpu_seq = RubySequencer(version = i,
|
|
|
|
icache = cache,
|
2010-01-30 05:29:24 +01:00
|
|
|
dcache = cache,
|
2014-09-01 23:55:30 +02:00
|
|
|
clk_domain=system.cpu[i].clk_domain,
|
2011-07-01 02:49:26 +02:00
|
|
|
ruby_system = ruby_system)
|
2010-01-30 05:29:24 +01:00
|
|
|
|
2011-05-23 23:29:23 +02:00
|
|
|
l1_cntrl.sequencer = cpu_seq
|
2013-01-14 17:05:14 +01:00
|
|
|
exec("ruby_system.l1_cntrl%d = l1_cntrl" % i)
|
2014-03-17 23:40:15 +01:00
|
|
|
|
2010-01-30 05:29:24 +01:00
|
|
|
# Add controllers and sequencers to the appropriate lists
|
|
|
|
cpu_sequencers.append(cpu_seq)
|
|
|
|
l1_cntrl_nodes.append(l1_cntrl)
|
|
|
|
|
2014-09-01 23:55:47 +02:00
|
|
|
# Connect the L1 controllers and the network
|
|
|
|
l1_cntrl.requestFromCache = ruby_system.network.slave
|
|
|
|
l1_cntrl.responseFromCache = ruby_system.network.slave
|
|
|
|
l1_cntrl.forwardToCache = ruby_system.network.master
|
|
|
|
l1_cntrl.responseToCache = ruby_system.network.master
|
|
|
|
|
|
|
|
|
2013-08-19 09:52:27 +02:00
|
|
|
phys_mem_size = sum(map(lambda r: r.size(), system.mem_ranges))
|
2013-06-29 04:36:11 +02:00
|
|
|
assert(phys_mem_size % options.num_dirs == 0)
|
2010-01-30 05:29:24 +01:00
|
|
|
mem_module_size = phys_mem_size / options.num_dirs
|
|
|
|
|
sim: Add the notion of clock domains to all ClockedObjects
This patch adds the notion of source- and derived-clock domains to the
ClockedObjects. As such, all clock information is moved to the clock
domain, and the ClockedObjects are grouped into domains.
The clock domains are either source domains, with a specific clock
period, or derived domains that have a parent domain and a divider
(potentially chained). For piece of logic that runs at a derived clock
(a ratio of the clock its parent is running at) the necessary derived
clock domain is created from its corresponding parent clock
domain. For now, the derived clock domain only supports a divider,
thus ensuring a lower speed compared to its parent. Multiplier
functionality implies a PLL logic that has not been modelled yet
(create a separate clock instead).
The clock domains should be used as a mechanism to provide a
controllable clock source that affects clock for every clocked object
lying beneath it. The clock of the domain can (in a future patch) be
controlled by a handler responsible for dynamic frequency scaling of
the respective clock domains.
All the config scripts have been retro-fitted with clock domains. For
the System a default SrcClockDomain is created. For CPUs that run at a
different speed than the system, there is a seperate clock domain
created. This domain incorporates the CPU and the associated
caches. As before, Ruby runs under its own clock domain.
The clock period of all domains are pre-computed, such that no virtual
functions or multiplications are needed when calling
clockPeriod. Instead, the clock period is pre-computed when any
changes occur. For this to be possible, each clock domain tracks its
children.
2013-06-27 11:49:49 +02:00
|
|
|
# Run each of the ruby memory controllers at a ratio of the frequency of
|
|
|
|
# the ruby system.
|
|
|
|
# clk_divider value is a fix to pass regression.
|
|
|
|
ruby_system.memctrl_clk_domain = DerivedClockDomain(
|
|
|
|
clk_domain=ruby_system.clk_domain,
|
|
|
|
clk_divider=3)
|
|
|
|
|
2010-01-30 05:29:24 +01:00
|
|
|
for i in xrange(options.num_dirs):
|
|
|
|
dir_size = MemorySize('0B')
|
|
|
|
dir_size.value = mem_module_size
|
|
|
|
dir_cntrl = Directory_Controller(version = i,
|
2014-11-06 12:42:21 +01:00
|
|
|
directory = RubyDirectoryMemory(
|
|
|
|
version = i, size = dir_size),
|
2013-08-20 18:32:31 +02:00
|
|
|
transitions_per_cycle = options.ports,
|
2011-07-01 02:49:26 +02:00
|
|
|
ruby_system = ruby_system)
|
2010-01-30 05:29:24 +01:00
|
|
|
|
2013-01-14 17:05:14 +01:00
|
|
|
exec("ruby_system.dir_cntrl%d = dir_cntrl" % i)
|
2010-01-30 05:29:24 +01:00
|
|
|
dir_cntrl_nodes.append(dir_cntrl)
|
|
|
|
|
2014-09-01 23:55:47 +02:00
|
|
|
# Connect the directory controllers and the network
|
|
|
|
dir_cntrl.requestToDir = ruby_system.network.master
|
|
|
|
dir_cntrl.dmaRequestToDir = ruby_system.network.master
|
|
|
|
|
|
|
|
dir_cntrl.responseFromDir = ruby_system.network.slave
|
|
|
|
dir_cntrl.dmaResponseFromDir = ruby_system.network.slave
|
|
|
|
dir_cntrl.forwardFromDir = ruby_system.network.slave
|
|
|
|
|
|
|
|
|
2012-04-05 18:09:19 +02:00
|
|
|
for i, dma_port in enumerate(dma_ports):
|
2010-01-30 05:29:24 +01:00
|
|
|
#
|
|
|
|
# Create the Ruby objects associated with the dma controller
|
|
|
|
#
|
|
|
|
dma_seq = DMASequencer(version = i,
|
2011-07-26 19:20:22 +02:00
|
|
|
ruby_system = ruby_system)
|
2010-01-30 05:29:24 +01:00
|
|
|
|
|
|
|
dma_cntrl = DMA_Controller(version = i,
|
2011-07-26 19:20:22 +02:00
|
|
|
dma_sequencer = dma_seq,
|
2013-08-20 18:32:31 +02:00
|
|
|
transitions_per_cycle = options.ports,
|
2011-07-26 19:20:22 +02:00
|
|
|
ruby_system = ruby_system)
|
2010-01-30 05:29:24 +01:00
|
|
|
|
2013-01-14 17:05:14 +01:00
|
|
|
exec("ruby_system.dma_cntrl%d = dma_cntrl" % i)
|
|
|
|
exec("ruby_system.dma_cntrl%d.dma_sequencer.slave = dma_port" % i)
|
2010-01-30 05:29:24 +01:00
|
|
|
dma_cntrl_nodes.append(dma_cntrl)
|
2011-04-29 02:18:14 +02:00
|
|
|
|
2014-09-01 23:55:47 +02:00
|
|
|
# Connect the directory controllers and the network
|
|
|
|
dma_cntrl.requestToDir = ruby_system.network.master
|
|
|
|
dma_cntrl.responseFromDir = ruby_system.network.slave
|
2010-01-30 05:29:24 +01:00
|
|
|
|
2014-09-01 23:55:47 +02:00
|
|
|
all_cntrls = l1_cntrl_nodes + dir_cntrl_nodes + dma_cntrl_nodes
|
2014-11-06 12:41:44 +01:00
|
|
|
|
|
|
|
# Create the io controller and the sequencer
|
|
|
|
if full_system:
|
|
|
|
io_seq = DMASequencer(version=len(dma_ports), ruby_system=ruby_system)
|
|
|
|
ruby_system._io_port = io_seq
|
|
|
|
io_controller = DMA_Controller(version = len(dma_ports),
|
|
|
|
dma_sequencer = io_seq,
|
|
|
|
ruby_system = ruby_system)
|
|
|
|
ruby_system.io_controller = io_controller
|
|
|
|
|
|
|
|
# Connect the dma controller to the network
|
|
|
|
io_controller.responseFromDir = ruby_system.network.master
|
|
|
|
io_controller.requestToDir = ruby_system.network.slave
|
|
|
|
|
|
|
|
all_cntrls = all_cntrls + [io_controller]
|
|
|
|
|
2014-09-01 23:55:47 +02:00
|
|
|
topology = create_topology(all_cntrls, options)
|
2012-07-11 07:51:53 +02:00
|
|
|
return (cpu_sequencers, dir_cntrl_nodes, topology)
|