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
|
|
|
# Copyright (c) 2012-2013 ARM Limited
|
2013-02-15 23:40:08 +01:00
|
|
|
# All rights reserved
|
|
|
|
#
|
|
|
|
# The license below extends only to copyright in the software and shall
|
|
|
|
# not be construed as granting a license to any other intellectual
|
|
|
|
# property including but not limited to intellectual property relating
|
|
|
|
# to a hardware implementation of the functionality of the software
|
|
|
|
# licensed hereunder. You may use the software subject to the license
|
|
|
|
# terms below provided that you ensure that this notice is replicated
|
|
|
|
# unmodified and in its entirety in all distributions of the software,
|
|
|
|
# modified or unmodified, in source code or in binary form.
|
|
|
|
#
|
2008-02-14 22:13:50 +01:00
|
|
|
# Copyright (c) 2006-2008 The Regents of The University of Michigan
|
2010-08-17 14:49:05 +02:00
|
|
|
# Copyright (c) 2010 Advanced Micro Devices, Inc.
|
2006-10-27 22:32:26 +02:00
|
|
|
# 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: Lisa Hsu
|
|
|
|
|
2013-01-08 14:54:12 +01:00
|
|
|
import sys
|
2006-10-27 22:32:26 +02:00
|
|
|
from os import getcwd
|
2006-11-08 20:01:23 +01:00
|
|
|
from os.path import join as joinpath
|
2009-09-23 00:24:16 +02:00
|
|
|
|
2013-02-15 23:40:08 +01:00
|
|
|
import CpuConfig
|
2013-04-22 19:20:33 +02:00
|
|
|
import MemConfig
|
2013-02-15 23:40:08 +01:00
|
|
|
|
2006-10-27 22:32:26 +02:00
|
|
|
import m5
|
2009-09-23 00:24:16 +02:00
|
|
|
from m5.defines import buildEnv
|
2006-10-27 22:32:26 +02:00
|
|
|
from m5.objects import *
|
2009-09-23 00:24:16 +02:00
|
|
|
from m5.util import *
|
|
|
|
|
|
|
|
addToPath('../common')
|
2006-10-27 22:32:26 +02:00
|
|
|
|
2012-08-07 01:14:31 +02:00
|
|
|
def getCPUClass(cpu_type):
|
2013-02-15 23:40:08 +01:00
|
|
|
"""Returns the required cpu class and the mode of operation."""
|
|
|
|
cls = CpuConfig.get(cpu_type)
|
|
|
|
return cls, cls.memory_mode()
|
2012-08-07 01:14:31 +02:00
|
|
|
|
2006-11-02 01:25:09 +01:00
|
|
|
def setCPUClass(options):
|
2012-08-07 01:14:31 +02:00
|
|
|
"""Returns two cpu classes and the initial mode of operation.
|
2006-11-02 01:25:09 +01:00
|
|
|
|
2012-08-07 01:14:31 +02:00
|
|
|
Restoring from a checkpoint or fast forwarding through a benchmark
|
|
|
|
can be done using one type of cpu, and then the actual
|
|
|
|
simulation can be carried out using another type. This function
|
|
|
|
returns these two types of cpus and the initial mode of operation
|
|
|
|
depending on the options provided.
|
|
|
|
"""
|
|
|
|
|
|
|
|
TmpClass, test_mem_mode = getCPUClass(options.cpu_type)
|
2006-11-02 01:25:09 +01:00
|
|
|
CPUClass = None
|
2013-02-15 23:40:08 +01:00
|
|
|
if TmpClass.require_caches() and \
|
|
|
|
not options.caches and not options.ruby:
|
|
|
|
fatal("%s must be used with caches" % options.cpu_type)
|
2012-01-11 20:50:18 +01:00
|
|
|
|
2012-08-07 01:14:31 +02:00
|
|
|
if options.checkpoint_restore != None:
|
|
|
|
if options.restore_with_cpu != options.cpu_type:
|
2006-11-02 01:25:09 +01:00
|
|
|
CPUClass = TmpClass
|
2012-08-07 01:14:31 +02:00
|
|
|
TmpClass, test_mem_mode = getCPUClass(options.restore_with_cpu)
|
|
|
|
elif options.fast_forward:
|
|
|
|
CPUClass = TmpClass
|
|
|
|
TmpClass = AtomicSimpleCPU
|
|
|
|
test_mem_mode = 'atomic'
|
2006-11-02 01:25:09 +01:00
|
|
|
|
|
|
|
return (TmpClass, test_mem_mode, CPUClass)
|
|
|
|
|
2013-04-22 19:20:33 +02:00
|
|
|
def setMemClass(options):
|
|
|
|
"""Returns a memory controller class."""
|
|
|
|
|
|
|
|
return MemConfig.get(options.mem_type)
|
|
|
|
|
2012-03-28 01:23:21 +02:00
|
|
|
def setWorkCountOptions(system, options):
|
|
|
|
if options.work_item_id != None:
|
|
|
|
system.work_item_id = options.work_item_id
|
2014-04-10 20:43:33 +02:00
|
|
|
if options.num_work_ids != None:
|
|
|
|
system.num_work_ids = options.num_work_ids
|
2012-03-28 01:23:21 +02:00
|
|
|
if options.work_begin_cpu_id_exit != None:
|
|
|
|
system.work_begin_cpu_id_exit = options.work_begin_cpu_id_exit
|
|
|
|
if options.work_end_exit_count != None:
|
|
|
|
system.work_end_exit_count = options.work_end_exit_count
|
|
|
|
if options.work_end_checkpoint_count != None:
|
|
|
|
system.work_end_ckpt_count = options.work_end_checkpoint_count
|
|
|
|
if options.work_begin_exit_count != None:
|
|
|
|
system.work_begin_exit_count = options.work_begin_exit_count
|
|
|
|
if options.work_begin_checkpoint_count != None:
|
|
|
|
system.work_begin_ckpt_count = options.work_begin_checkpoint_count
|
|
|
|
if options.work_cpus_checkpoint_count != None:
|
|
|
|
system.work_cpus_ckpt_count = options.work_cpus_checkpoint_count
|
2006-11-02 01:25:09 +01:00
|
|
|
|
2013-07-18 21:46:54 +02:00
|
|
|
def findCptDir(options, cptdir, testsys):
|
2012-08-07 01:14:32 +02:00
|
|
|
"""Figures out the directory from which the checkpointed state is read.
|
|
|
|
|
|
|
|
There are two different ways in which the directories holding checkpoints
|
|
|
|
can be named --
|
|
|
|
1. cpt.<benchmark name>.<instruction count when the checkpoint was taken>
|
|
|
|
2. cpt.<some number, usually the tick value when the checkpoint was taken>
|
|
|
|
|
|
|
|
This function parses through the options to figure out which one of the
|
|
|
|
above should be used for selecting the checkpoint, and then figures out
|
|
|
|
the appropriate directory.
|
|
|
|
"""
|
|
|
|
|
|
|
|
from os.path import isdir, exists
|
|
|
|
from os import listdir
|
|
|
|
import re
|
|
|
|
|
|
|
|
if not isdir(cptdir):
|
|
|
|
fatal("checkpoint dir %s does not exist!", cptdir)
|
|
|
|
|
2013-09-11 22:34:21 +02:00
|
|
|
cpt_starttick = 0
|
2012-08-07 01:14:32 +02:00
|
|
|
if options.at_instruction or options.simpoint:
|
|
|
|
inst = options.checkpoint_restore
|
|
|
|
if options.simpoint:
|
|
|
|
# assume workload 0 has the simpoint
|
|
|
|
if testsys.cpu[0].workload[0].simpoint == 0:
|
|
|
|
fatal('Unable to find simpoint')
|
|
|
|
inst += int(testsys.cpu[0].workload[0].simpoint)
|
|
|
|
|
|
|
|
checkpoint_dir = joinpath(cptdir, "cpt.%s.%s" % (options.bench, inst))
|
|
|
|
if not exists(checkpoint_dir):
|
|
|
|
fatal("Unable to find checkpoint directory %s", checkpoint_dir)
|
2014-12-23 15:31:17 +01:00
|
|
|
|
|
|
|
elif options.restore_simpoint_checkpoint:
|
|
|
|
# Restore from SimPoint checkpoints
|
|
|
|
# Assumes that the checkpoint dir names are formatted as follows:
|
|
|
|
dirs = listdir(cptdir)
|
|
|
|
expr = re.compile('cpt\.simpoint_(\d+)_inst_(\d+)' +
|
|
|
|
'_weight_([\d\.e\-]+)_interval_(\d+)_warmup_(\d+)')
|
|
|
|
cpts = []
|
|
|
|
for dir in dirs:
|
|
|
|
match = expr.match(dir)
|
|
|
|
if match:
|
|
|
|
cpts.append(dir)
|
|
|
|
cpts.sort()
|
|
|
|
|
|
|
|
cpt_num = options.checkpoint_restore
|
|
|
|
if cpt_num > len(cpts):
|
|
|
|
fatal('Checkpoint %d not found', cpt_num)
|
|
|
|
checkpoint_dir = joinpath(cptdir, cpts[cpt_num - 1])
|
|
|
|
match = expr.match(cpts[cpt_num - 1])
|
|
|
|
if match:
|
|
|
|
index = int(match.group(1))
|
|
|
|
start_inst = int(match.group(2))
|
|
|
|
weight_inst = float(match.group(3))
|
|
|
|
interval_length = int(match.group(4))
|
|
|
|
warmup_length = int(match.group(5))
|
|
|
|
print "Resuming from", checkpoint_dir
|
|
|
|
simpoint_start_insts = []
|
|
|
|
simpoint_start_insts.append(warmup_length)
|
|
|
|
simpoint_start_insts.append(warmup_length + interval_length)
|
|
|
|
testsys.cpu[0].simpoint_start_insts = simpoint_start_insts
|
|
|
|
if testsys.switch_cpus != None:
|
|
|
|
testsys.switch_cpus[0].simpoint_start_insts = simpoint_start_insts
|
|
|
|
|
|
|
|
print "Resuming from SimPoint",
|
|
|
|
print "#%d, start_inst:%d, weight:%f, interval:%d, warmup:%d" % \
|
|
|
|
(index, start_inst, weight_inst, interval_length, warmup_length)
|
|
|
|
|
2012-08-07 01:14:32 +02:00
|
|
|
else:
|
|
|
|
dirs = listdir(cptdir)
|
2014-12-23 15:31:17 +01:00
|
|
|
expr = re.compile('cpt\.([0-9]+)')
|
2012-08-07 01:14:32 +02:00
|
|
|
cpts = []
|
|
|
|
for dir in dirs:
|
|
|
|
match = expr.match(dir)
|
|
|
|
if match:
|
|
|
|
cpts.append(match.group(1))
|
|
|
|
|
|
|
|
cpts.sort(lambda a,b: cmp(long(a), long(b)))
|
|
|
|
|
|
|
|
cpt_num = options.checkpoint_restore
|
|
|
|
if cpt_num > len(cpts):
|
|
|
|
fatal('Checkpoint %d not found', cpt_num)
|
|
|
|
|
2013-07-18 21:46:54 +02:00
|
|
|
cpt_starttick = int(cpts[cpt_num - 1])
|
2012-08-07 01:14:32 +02:00
|
|
|
checkpoint_dir = joinpath(cptdir, "cpt.%s" % cpts[cpt_num - 1])
|
|
|
|
|
2013-07-18 21:46:54 +02:00
|
|
|
return cpt_starttick, checkpoint_dir
|
2012-08-07 01:14:32 +02:00
|
|
|
|
2012-09-11 20:14:51 +02:00
|
|
|
def scriptCheckpoints(options, maxtick, cptdir):
|
2012-08-07 01:14:32 +02:00
|
|
|
if options.at_instruction or options.simpoint:
|
|
|
|
checkpoint_inst = int(options.take_checkpoints)
|
|
|
|
|
|
|
|
# maintain correct offset if we restored from some instruction
|
|
|
|
if options.checkpoint_restore != None:
|
|
|
|
checkpoint_inst += options.checkpoint_restore
|
|
|
|
|
|
|
|
print "Creating checkpoint at inst:%d" % (checkpoint_inst)
|
|
|
|
exit_event = m5.simulate()
|
|
|
|
exit_cause = exit_event.getCause()
|
|
|
|
print "exit cause = %s" % exit_cause
|
|
|
|
|
|
|
|
# skip checkpoint instructions should they exist
|
|
|
|
while exit_cause == "checkpoint":
|
|
|
|
exit_event = m5.simulate()
|
|
|
|
exit_cause = exit_event.getCause()
|
|
|
|
|
|
|
|
if exit_cause == "a thread reached the max instruction count":
|
|
|
|
m5.checkpoint(joinpath(cptdir, "cpt.%s.%d" % \
|
|
|
|
(options.bench, checkpoint_inst)))
|
|
|
|
print "Checkpoint written."
|
|
|
|
|
|
|
|
else:
|
|
|
|
when, period = options.take_checkpoints.split(",", 1)
|
|
|
|
when = int(when)
|
|
|
|
period = int(period)
|
2012-08-21 11:48:52 +02:00
|
|
|
num_checkpoints = 0
|
2012-08-07 01:14:32 +02:00
|
|
|
|
2013-04-09 23:25:30 +02:00
|
|
|
exit_event = m5.simulate(when - m5.curTick())
|
2012-08-07 01:14:32 +02:00
|
|
|
exit_cause = exit_event.getCause()
|
|
|
|
while exit_cause == "checkpoint":
|
|
|
|
exit_event = m5.simulate(when - m5.curTick())
|
|
|
|
exit_cause = exit_event.getCause()
|
|
|
|
|
|
|
|
if exit_cause == "simulate() limit reached":
|
|
|
|
m5.checkpoint(joinpath(cptdir, "cpt.%d"))
|
|
|
|
num_checkpoints += 1
|
|
|
|
|
|
|
|
sim_ticks = when
|
|
|
|
max_checkpoints = options.max_checkpoints
|
|
|
|
|
|
|
|
while num_checkpoints < max_checkpoints and \
|
|
|
|
exit_cause == "simulate() limit reached":
|
|
|
|
if (sim_ticks + period) > maxtick:
|
|
|
|
exit_event = m5.simulate(maxtick - sim_ticks)
|
|
|
|
exit_cause = exit_event.getCause()
|
|
|
|
break
|
|
|
|
else:
|
|
|
|
exit_event = m5.simulate(period)
|
|
|
|
exit_cause = exit_event.getCause()
|
|
|
|
sim_ticks += period
|
|
|
|
while exit_event.getCause() == "checkpoint":
|
|
|
|
exit_event = m5.simulate(sim_ticks - m5.curTick())
|
|
|
|
if exit_event.getCause() == "simulate() limit reached":
|
|
|
|
m5.checkpoint(joinpath(cptdir, "cpt.%d"))
|
|
|
|
num_checkpoints += 1
|
|
|
|
|
2013-03-22 23:31:24 +01:00
|
|
|
return exit_event
|
2012-08-07 01:14:32 +02:00
|
|
|
|
|
|
|
def benchCheckpoints(options, maxtick, cptdir):
|
2013-04-09 23:25:30 +02:00
|
|
|
exit_event = m5.simulate(maxtick - m5.curTick())
|
2012-08-07 01:14:32 +02:00
|
|
|
exit_cause = exit_event.getCause()
|
|
|
|
|
|
|
|
num_checkpoints = 0
|
|
|
|
max_checkpoints = options.max_checkpoints
|
|
|
|
|
|
|
|
while exit_cause == "checkpoint":
|
|
|
|
m5.checkpoint(joinpath(cptdir, "cpt.%d"))
|
|
|
|
num_checkpoints += 1
|
|
|
|
if num_checkpoints == max_checkpoints:
|
|
|
|
exit_cause = "maximum %d checkpoints dropped" % max_checkpoints
|
|
|
|
break
|
|
|
|
|
|
|
|
exit_event = m5.simulate(maxtick - m5.curTick())
|
|
|
|
exit_cause = exit_event.getCause()
|
|
|
|
|
2013-01-08 23:12:22 +01:00
|
|
|
return exit_event
|
2012-08-07 01:14:32 +02:00
|
|
|
|
2014-12-23 15:31:17 +01:00
|
|
|
# Set up environment for taking SimPoint checkpoints
|
|
|
|
# Expecting SimPoint files generated by SimPoint 3.2
|
|
|
|
def parseSimpointAnalysisFile(options, testsys):
|
|
|
|
import re
|
|
|
|
|
|
|
|
simpoint_filename, weight_filename, interval_length, warmup_length = \
|
|
|
|
options.take_simpoint_checkpoints.split(",", 3)
|
|
|
|
print "simpoint analysis file:", simpoint_filename
|
|
|
|
print "simpoint weight file:", weight_filename
|
|
|
|
print "interval length:", interval_length
|
|
|
|
print "warmup length:", warmup_length
|
|
|
|
|
|
|
|
interval_length = int(interval_length)
|
|
|
|
warmup_length = int(warmup_length)
|
|
|
|
|
|
|
|
# Simpoint analysis output starts interval counts with 0.
|
|
|
|
simpoints = []
|
|
|
|
simpoint_start_insts = []
|
|
|
|
|
|
|
|
# Read in SimPoint analysis files
|
|
|
|
simpoint_file = open(simpoint_filename)
|
|
|
|
weight_file = open(weight_filename)
|
|
|
|
while True:
|
|
|
|
line = simpoint_file.readline()
|
|
|
|
if not line:
|
|
|
|
break
|
|
|
|
m = re.match("(\d+)\s+(\d+)", line)
|
|
|
|
if m:
|
|
|
|
interval = int(m.group(1))
|
|
|
|
else:
|
|
|
|
fatal('unrecognized line in simpoint file!')
|
|
|
|
|
|
|
|
line = weight_file.readline()
|
|
|
|
if not line:
|
|
|
|
fatal('not enough lines in simpoint weight file!')
|
|
|
|
m = re.match("([0-9\.e\-]+)\s+(\d+)", line)
|
|
|
|
if m:
|
|
|
|
weight = float(m.group(1))
|
|
|
|
else:
|
|
|
|
fatal('unrecognized line in simpoint weight file!')
|
|
|
|
|
|
|
|
if (interval * interval_length - warmup_length > 0):
|
|
|
|
starting_inst_count = \
|
|
|
|
interval * interval_length - warmup_length
|
|
|
|
actual_warmup_length = warmup_length
|
|
|
|
else:
|
|
|
|
# Not enough room for proper warmup
|
|
|
|
# Just starting from the beginning
|
|
|
|
starting_inst_count = 0
|
|
|
|
actual_warmup_length = interval * interval_length
|
|
|
|
|
|
|
|
simpoints.append((interval, weight, starting_inst_count,
|
|
|
|
actual_warmup_length))
|
|
|
|
|
|
|
|
# Sort SimPoints by starting inst count
|
|
|
|
simpoints.sort(key=lambda obj: obj[2])
|
|
|
|
for s in simpoints:
|
|
|
|
interval, weight, starting_inst_count, actual_warmup_length = s
|
|
|
|
print str(interval), str(weight), starting_inst_count, \
|
|
|
|
actual_warmup_length
|
|
|
|
simpoint_start_insts.append(starting_inst_count)
|
|
|
|
|
|
|
|
print "Total # of simpoints:", len(simpoints)
|
|
|
|
testsys.cpu[0].simpoint_start_insts = simpoint_start_insts
|
|
|
|
|
|
|
|
return (simpoints, interval_length)
|
|
|
|
|
|
|
|
def takeSimpointCheckpoints(simpoints, interval_length, cptdir):
|
|
|
|
num_checkpoints = 0
|
|
|
|
index = 0
|
|
|
|
last_chkpnt_inst_count = -1
|
|
|
|
for simpoint in simpoints:
|
|
|
|
interval, weight, starting_inst_count, actual_warmup_length = simpoint
|
|
|
|
if starting_inst_count == last_chkpnt_inst_count:
|
|
|
|
# checkpoint starting point same as last time
|
|
|
|
# (when warmup period longer than starting point)
|
|
|
|
exit_cause = "simpoint starting point found"
|
|
|
|
code = 0
|
|
|
|
else:
|
|
|
|
exit_event = m5.simulate()
|
|
|
|
|
|
|
|
# skip checkpoint instructions should they exist
|
|
|
|
while exit_event.getCause() == "checkpoint":
|
|
|
|
print "Found 'checkpoint' exit event...ignoring..."
|
|
|
|
exit_event = m5.simulate()
|
|
|
|
|
|
|
|
exit_cause = exit_event.getCause()
|
|
|
|
code = exit_event.getCode()
|
|
|
|
|
|
|
|
if exit_cause == "simpoint starting point found":
|
|
|
|
m5.checkpoint(joinpath(cptdir,
|
|
|
|
"cpt.simpoint_%02d_inst_%d_weight_%f_interval_%d_warmup_%d"
|
|
|
|
% (index, starting_inst_count, weight, interval_length,
|
|
|
|
actual_warmup_length)))
|
|
|
|
print "Checkpoint #%d written. start inst:%d weight:%f" % \
|
|
|
|
(num_checkpoints, starting_inst_count, weight)
|
|
|
|
num_checkpoints += 1
|
|
|
|
last_chkpnt_inst_count = starting_inst_count
|
|
|
|
else:
|
|
|
|
break
|
|
|
|
index += 1
|
|
|
|
|
|
|
|
print 'Exiting @ tick %i because %s' % (m5.curTick(), exit_cause)
|
|
|
|
print "%d checkpoints taken" % num_checkpoints
|
|
|
|
sys.exit(code)
|
|
|
|
|
|
|
|
def restoreSimpointCheckpoint():
|
|
|
|
exit_event = m5.simulate()
|
|
|
|
exit_cause = exit_event.getCause()
|
|
|
|
|
|
|
|
if exit_cause == "simpoint starting point found":
|
|
|
|
print "Warmed up! Dumping and resetting stats!"
|
|
|
|
m5.stats.dump()
|
|
|
|
m5.stats.reset()
|
|
|
|
|
|
|
|
exit_event = m5.simulate()
|
|
|
|
exit_cause = exit_event.getCause()
|
|
|
|
|
|
|
|
if exit_cause == "simpoint starting point found":
|
|
|
|
print "Done running SimPoint!"
|
|
|
|
sys.exit(exit_event.getCode())
|
|
|
|
|
|
|
|
print 'Exiting @ tick %i because %s' % (m5.curTick(), exit_cause)
|
|
|
|
sys.exit(exit_event.getCode())
|
|
|
|
|
2012-08-15 16:38:07 +02:00
|
|
|
def repeatSwitch(testsys, repeat_switch_cpu_list, maxtick, switch_freq):
|
|
|
|
print "starting switch loop"
|
|
|
|
while True:
|
|
|
|
exit_event = m5.simulate(switch_freq)
|
|
|
|
exit_cause = exit_event.getCause()
|
|
|
|
|
|
|
|
if exit_cause != "simulate() limit reached":
|
2013-01-08 23:12:22 +01:00
|
|
|
return exit_event
|
2012-08-15 16:38:07 +02:00
|
|
|
|
2013-02-15 23:40:08 +01:00
|
|
|
m5.switchCpus(testsys, repeat_switch_cpu_list)
|
2012-08-15 16:38:07 +02:00
|
|
|
|
|
|
|
tmp_cpu_list = []
|
|
|
|
for old_cpu, new_cpu in repeat_switch_cpu_list:
|
|
|
|
tmp_cpu_list.append((new_cpu, old_cpu))
|
|
|
|
repeat_switch_cpu_list = tmp_cpu_list
|
|
|
|
|
|
|
|
if (maxtick - m5.curTick()) <= switch_freq:
|
|
|
|
exit_event = m5.simulate(maxtick - m5.curTick())
|
2013-01-08 23:12:22 +01:00
|
|
|
return exit_event
|
2012-08-15 16:38:07 +02:00
|
|
|
|
2006-11-02 01:25:09 +01:00
|
|
|
def run(options, root, testsys, cpu_class):
|
2006-10-27 22:32:26 +02:00
|
|
|
if options.checkpoint_dir:
|
|
|
|
cptdir = options.checkpoint_dir
|
2007-11-03 19:41:00 +01:00
|
|
|
elif m5.options.outdir:
|
|
|
|
cptdir = m5.options.outdir
|
2006-10-27 22:32:26 +02:00
|
|
|
else:
|
|
|
|
cptdir = getcwd()
|
|
|
|
|
2008-02-29 07:23:18 +01:00
|
|
|
if options.fast_forward and options.checkpoint_restore != None:
|
2009-09-23 00:24:16 +02:00
|
|
|
fatal("Can't specify both --fast-forward and --checkpoint-restore")
|
2008-02-29 07:23:18 +01:00
|
|
|
|
2008-02-29 07:49:36 +01:00
|
|
|
if options.standard_switch and not options.caches:
|
2009-09-23 00:24:16 +02:00
|
|
|
fatal("Must specify --caches when using --standard-switch")
|
2008-02-29 07:23:18 +01:00
|
|
|
|
2012-08-15 16:38:07 +02:00
|
|
|
if options.standard_switch and options.repeat_switch:
|
|
|
|
fatal("Can't specify both --standard-switch and --repeat-switch")
|
|
|
|
|
|
|
|
if options.repeat_switch and options.take_checkpoints:
|
|
|
|
fatal("Can't specify both --repeat-switch and --take-checkpoints")
|
|
|
|
|
2006-10-27 22:32:26 +02:00
|
|
|
np = options.num_cpus
|
2006-11-02 01:25:09 +01:00
|
|
|
switch_cpus = None
|
|
|
|
|
2011-05-23 20:36:22 +02:00
|
|
|
if options.prog_interval:
|
2009-05-05 08:39:05 +02:00
|
|
|
for i in xrange(np):
|
2011-05-20 20:49:06 +02:00
|
|
|
testsys.cpu[i].progress_interval = options.prog_interval
|
2009-05-05 08:39:05 +02:00
|
|
|
|
2009-09-16 15:45:30 +02:00
|
|
|
if options.maxinsts:
|
|
|
|
for i in xrange(np):
|
|
|
|
testsys.cpu[i].max_insts_any_thread = options.maxinsts
|
|
|
|
|
2006-11-02 01:25:09 +01:00
|
|
|
if cpu_class:
|
2013-01-07 19:05:45 +01:00
|
|
|
switch_cpus = [cpu_class(switched_out=True, cpu_id=(i))
|
2006-11-02 01:25:09 +01:00
|
|
|
for i in xrange(np)]
|
|
|
|
|
|
|
|
for i in xrange(np):
|
2008-02-27 06:35:09 +01:00
|
|
|
if options.fast_forward:
|
2008-02-29 02:39:01 +01:00
|
|
|
testsys.cpu[i].max_insts_any_thread = int(options.fast_forward)
|
2006-11-02 01:25:09 +01:00
|
|
|
switch_cpus[i].system = testsys
|
2012-01-28 16:24:50 +01:00
|
|
|
switch_cpus[i].workload = testsys.cpu[i].workload
|
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
|
|
|
switch_cpus[i].clk_domain = testsys.cpu[i].clk_domain
|
2015-04-14 18:01:10 +02:00
|
|
|
switch_cpus[i].progress_interval = testsys.cpu[i].progress_interval
|
2008-02-29 02:39:01 +01:00
|
|
|
# simulation period
|
2011-05-20 20:49:06 +02:00
|
|
|
if options.maxinsts:
|
|
|
|
switch_cpus[i].max_insts_any_thread = options.maxinsts
|
2012-03-09 15:59:27 +01:00
|
|
|
# Add checker cpu if selected
|
|
|
|
if options.checker:
|
|
|
|
switch_cpus[i].addCheckerCpu()
|
2006-11-02 01:25:09 +01:00
|
|
|
|
2007-12-18 07:52:57 +01:00
|
|
|
testsys.switch_cpus = switch_cpus
|
2006-11-02 01:25:09 +01:00
|
|
|
switch_cpu_list = [(testsys.cpu[i], switch_cpus[i]) for i in xrange(np)]
|
2006-10-27 22:32:26 +02:00
|
|
|
|
2012-08-15 16:38:07 +02:00
|
|
|
if options.repeat_switch:
|
2013-02-15 23:40:08 +01:00
|
|
|
switch_class = getCPUClass(options.cpu_type)[0]
|
|
|
|
if switch_class.require_caches() and \
|
|
|
|
not options.caches:
|
|
|
|
print "%s: Must be used with caches" % str(switch_class)
|
2011-04-04 18:42:31 +02:00
|
|
|
sys.exit(1)
|
2013-02-15 23:40:08 +01:00
|
|
|
if not switch_class.support_take_over():
|
|
|
|
print "%s: CPU switching not supported" % str(switch_class)
|
|
|
|
sys.exit(1)
|
|
|
|
|
|
|
|
repeat_switch_cpus = [switch_class(switched_out=True, \
|
|
|
|
cpu_id=(i)) for i in xrange(np)]
|
2011-04-04 18:42:31 +02:00
|
|
|
|
2012-08-15 16:38:07 +02:00
|
|
|
for i in xrange(np):
|
|
|
|
repeat_switch_cpus[i].system = testsys
|
|
|
|
repeat_switch_cpus[i].workload = testsys.cpu[i].workload
|
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
|
|
|
repeat_switch_cpus[i].clk_domain = testsys.cpu[i].clk_domain
|
2012-08-15 16:38:07 +02:00
|
|
|
|
|
|
|
if options.maxinsts:
|
|
|
|
repeat_switch_cpus[i].max_insts_any_thread = options.maxinsts
|
|
|
|
|
|
|
|
if options.checker:
|
|
|
|
repeat_switch_cpus[i].addCheckerCpu()
|
|
|
|
|
|
|
|
testsys.repeat_switch_cpus = repeat_switch_cpus
|
|
|
|
|
|
|
|
if cpu_class:
|
|
|
|
repeat_switch_cpu_list = [(switch_cpus[i], repeat_switch_cpus[i])
|
|
|
|
for i in xrange(np)]
|
|
|
|
else:
|
|
|
|
repeat_switch_cpu_list = [(testsys.cpu[i], repeat_switch_cpus[i])
|
|
|
|
for i in xrange(np)]
|
|
|
|
|
|
|
|
if options.standard_switch:
|
2013-01-07 19:05:45 +01:00
|
|
|
switch_cpus = [TimingSimpleCPU(switched_out=True, cpu_id=(i))
|
2006-10-27 22:32:26 +02:00
|
|
|
for i in xrange(np)]
|
2013-01-07 19:05:45 +01:00
|
|
|
switch_cpus_1 = [DerivO3CPU(switched_out=True, cpu_id=(i))
|
2006-10-27 22:32:26 +02:00
|
|
|
for i in xrange(np)]
|
2006-11-01 17:40:49 +01:00
|
|
|
|
2006-10-27 22:32:26 +02:00
|
|
|
for i in xrange(np):
|
|
|
|
switch_cpus[i].system = testsys
|
2006-11-01 17:40:49 +01:00
|
|
|
switch_cpus_1[i].system = testsys
|
2012-01-28 16:24:50 +01:00
|
|
|
switch_cpus[i].workload = testsys.cpu[i].workload
|
|
|
|
switch_cpus_1[i].workload = testsys.cpu[i].workload
|
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
|
|
|
switch_cpus[i].clk_domain = testsys.cpu[i].clk_domain
|
|
|
|
switch_cpus_1[i].clk_domain = testsys.cpu[i].clk_domain
|
2006-11-01 17:49:39 +01:00
|
|
|
|
2008-02-27 06:35:09 +01:00
|
|
|
# if restoring, make atomic cpu simulate only a few instructions
|
2008-02-29 02:39:01 +01:00
|
|
|
if options.checkpoint_restore != None:
|
2008-02-27 06:35:09 +01:00
|
|
|
testsys.cpu[i].max_insts_any_thread = 1
|
|
|
|
# Fast forward to specified location if we are not restoring
|
|
|
|
elif options.fast_forward:
|
2008-02-29 02:39:01 +01:00
|
|
|
testsys.cpu[i].max_insts_any_thread = int(options.fast_forward)
|
2008-02-27 06:35:09 +01:00
|
|
|
# Fast forward to a simpoint (warning: time consuming)
|
|
|
|
elif options.simpoint:
|
2008-03-16 03:20:09 +01:00
|
|
|
if testsys.cpu[i].workload[0].simpoint == 0:
|
2009-09-23 00:24:16 +02:00
|
|
|
fatal('simpoint not found')
|
2008-02-27 06:35:09 +01:00
|
|
|
testsys.cpu[i].max_insts_any_thread = \
|
|
|
|
testsys.cpu[i].workload[0].simpoint
|
|
|
|
# No distance specified, just switch
|
|
|
|
else:
|
|
|
|
testsys.cpu[i].max_insts_any_thread = 1
|
|
|
|
|
|
|
|
# warmup period
|
|
|
|
if options.warmup_insts:
|
|
|
|
switch_cpus[i].max_insts_any_thread = options.warmup_insts
|
|
|
|
|
|
|
|
# simulation period
|
2011-05-20 20:49:06 +02:00
|
|
|
if options.maxinsts:
|
|
|
|
switch_cpus_1[i].max_insts_any_thread = options.maxinsts
|
2008-02-22 23:48:10 +01:00
|
|
|
|
2012-03-09 15:59:27 +01:00
|
|
|
# attach the checker cpu if selected
|
|
|
|
if options.checker:
|
|
|
|
switch_cpus[i].addCheckerCpu()
|
|
|
|
switch_cpus_1[i].addCheckerCpu()
|
|
|
|
|
2011-04-04 18:42:31 +02:00
|
|
|
testsys.switch_cpus = switch_cpus
|
|
|
|
testsys.switch_cpus_1 = switch_cpus_1
|
|
|
|
switch_cpu_list = [(testsys.cpu[i], switch_cpus[i]) for i in xrange(np)]
|
|
|
|
switch_cpu_list1 = [(switch_cpus[i], switch_cpus_1[i]) for i in xrange(np)]
|
2006-10-27 22:32:26 +02:00
|
|
|
|
2008-02-27 06:35:09 +01:00
|
|
|
# set the checkpoint in the cpu before m5.instantiate is called
|
2008-02-29 02:39:01 +01:00
|
|
|
if options.take_checkpoints != None and \
|
2008-02-27 06:35:09 +01:00
|
|
|
(options.simpoint or options.at_instruction):
|
|
|
|
offset = int(options.take_checkpoints)
|
|
|
|
# Set an instruction break point
|
|
|
|
if options.simpoint:
|
|
|
|
for i in xrange(np):
|
2008-03-16 03:20:09 +01:00
|
|
|
if testsys.cpu[i].workload[0].simpoint == 0:
|
2009-09-23 00:24:16 +02:00
|
|
|
fatal('no simpoint for testsys.cpu[%d].workload[0]', i)
|
2008-02-29 02:39:01 +01:00
|
|
|
checkpoint_inst = int(testsys.cpu[i].workload[0].simpoint) + offset
|
2008-02-27 06:35:09 +01:00
|
|
|
testsys.cpu[i].max_insts_any_thread = checkpoint_inst
|
|
|
|
# used for output below
|
|
|
|
options.take_checkpoints = checkpoint_inst
|
|
|
|
else:
|
|
|
|
options.take_checkpoints = offset
|
|
|
|
# Set all test cpus with the right number of instructions
|
|
|
|
# for the upcoming simulation
|
|
|
|
for i in xrange(np):
|
|
|
|
testsys.cpu[i].max_insts_any_thread = offset
|
|
|
|
|
2014-12-23 15:31:17 +01:00
|
|
|
if options.take_simpoint_checkpoints != None:
|
|
|
|
simpoints, interval_length = parseSimpointAnalysisFile(options, testsys)
|
|
|
|
|
2010-08-17 14:17:06 +02:00
|
|
|
checkpoint_dir = None
|
2013-07-18 21:46:54 +02:00
|
|
|
if options.checkpoint_restore:
|
|
|
|
cpt_starttick, checkpoint_dir = findCptDir(options, cptdir, testsys)
|
2010-08-17 14:17:06 +02:00
|
|
|
m5.instantiate(checkpoint_dir)
|
2006-10-27 22:32:26 +02:00
|
|
|
|
2015-03-23 11:57:38 +01:00
|
|
|
# Initialization is complete. If we're not in control of simulation
|
|
|
|
# (that is, if we're a slave simulator acting as a component in another
|
|
|
|
# 'master' simulator) then we're done here. The other simulator will
|
|
|
|
# call simulate() directly. --initialize-only is used to indicate this.
|
|
|
|
if options.initialize_only:
|
|
|
|
return
|
|
|
|
|
2013-07-18 21:46:54 +02:00
|
|
|
# Handle the max tick settings now that tick frequency was resolved
|
|
|
|
# during system instantiation
|
|
|
|
# NOTE: the maxtick variable here is in absolute ticks, so it must
|
|
|
|
# include any simulated ticks before a checkpoint
|
|
|
|
explicit_maxticks = 0
|
|
|
|
maxtick_from_abs = m5.MaxTick
|
|
|
|
maxtick_from_rel = m5.MaxTick
|
|
|
|
maxtick_from_maxtime = m5.MaxTick
|
|
|
|
if options.abs_max_tick:
|
|
|
|
maxtick_from_abs = options.abs_max_tick
|
|
|
|
explicit_maxticks += 1
|
|
|
|
if options.rel_max_tick:
|
|
|
|
maxtick_from_rel = options.rel_max_tick
|
|
|
|
if options.checkpoint_restore:
|
|
|
|
# NOTE: this may need to be updated if checkpoints ever store
|
|
|
|
# the ticks per simulated second
|
|
|
|
maxtick_from_rel += cpt_starttick
|
2013-09-11 22:34:21 +02:00
|
|
|
if options.at_instruction or options.simpoint:
|
|
|
|
warn("Relative max tick specified with --at-instruction or" \
|
|
|
|
" --simpoint\n These options don't specify the " \
|
|
|
|
"checkpoint start tick, so assuming\n you mean " \
|
|
|
|
"absolute max tick")
|
2013-07-18 21:46:54 +02:00
|
|
|
explicit_maxticks += 1
|
|
|
|
if options.maxtime:
|
|
|
|
maxtick_from_maxtime = m5.ticks.fromSeconds(options.maxtime)
|
|
|
|
explicit_maxticks += 1
|
|
|
|
if explicit_maxticks > 1:
|
|
|
|
warn("Specified multiple of --abs-max-tick, --rel-max-tick, --maxtime."\
|
|
|
|
" Using least")
|
|
|
|
maxtick = min([maxtick_from_abs, maxtick_from_rel, maxtick_from_maxtime])
|
|
|
|
|
|
|
|
if options.checkpoint_restore != None and maxtick < cpt_starttick:
|
|
|
|
fatal("Bad maxtick (%d) specified: " \
|
|
|
|
"Checkpoint starts starts from tick: %d", maxtick, cpt_starttick)
|
|
|
|
|
2006-11-02 01:25:09 +01:00
|
|
|
if options.standard_switch or cpu_class:
|
2008-02-27 06:35:09 +01:00
|
|
|
if options.standard_switch:
|
|
|
|
print "Switch at instruction count:%s" % \
|
|
|
|
str(testsys.cpu[0].max_insts_any_thread)
|
|
|
|
exit_event = m5.simulate()
|
|
|
|
elif cpu_class and options.fast_forward:
|
|
|
|
print "Switch at instruction count:%s" % \
|
|
|
|
str(testsys.cpu[0].max_insts_any_thread)
|
|
|
|
exit_event = m5.simulate()
|
|
|
|
else:
|
|
|
|
print "Switch at curTick count:%s" % str(10000)
|
|
|
|
exit_event = m5.simulate(10000)
|
2010-11-18 05:16:19 +01:00
|
|
|
print "Switched CPUS @ tick %s" % (m5.curTick())
|
2006-10-27 22:32:26 +02:00
|
|
|
|
2013-02-15 23:40:08 +01:00
|
|
|
m5.switchCpus(testsys, switch_cpu_list)
|
2006-10-27 22:32:26 +02:00
|
|
|
|
2006-11-02 01:25:09 +01:00
|
|
|
if options.standard_switch:
|
2008-02-27 06:35:09 +01:00
|
|
|
print "Switch at instruction count:%d" % \
|
|
|
|
(testsys.switch_cpus[0].max_insts_any_thread)
|
|
|
|
|
|
|
|
#warmup instruction count may have already been set
|
|
|
|
if options.warmup_insts:
|
2008-02-22 23:48:10 +01:00
|
|
|
exit_event = m5.simulate()
|
2008-02-27 06:35:09 +01:00
|
|
|
else:
|
2012-08-15 16:38:07 +02:00
|
|
|
exit_event = m5.simulate(options.standard_switch)
|
2010-11-18 05:16:19 +01:00
|
|
|
print "Switching CPUS @ tick %s" % (m5.curTick())
|
2008-02-27 06:35:09 +01:00
|
|
|
print "Simulation ends instruction count:%d" % \
|
|
|
|
(testsys.switch_cpus_1[0].max_insts_any_thread)
|
2013-02-15 23:40:08 +01:00
|
|
|
m5.switchCpus(testsys, switch_cpu_list1)
|
2006-10-27 22:32:26 +02:00
|
|
|
|
2010-07-06 06:39:38 +02:00
|
|
|
# If we're taking and restoring checkpoints, use checkpoint_dir
|
|
|
|
# option only for finding the checkpoints to restore from. This
|
|
|
|
# lets us test checkpointing by restoring from one set of
|
|
|
|
# checkpoints, generating a second set, and then comparing them.
|
2014-12-23 15:31:17 +01:00
|
|
|
if (options.take_checkpoints or options.take_simpoint_checkpoints) \
|
|
|
|
and options.checkpoint_restore:
|
|
|
|
|
2010-07-06 06:39:38 +02:00
|
|
|
if m5.options.outdir:
|
|
|
|
cptdir = m5.options.outdir
|
|
|
|
else:
|
|
|
|
cptdir = getcwd()
|
|
|
|
|
2008-02-29 02:39:01 +01:00
|
|
|
if options.take_checkpoints != None :
|
2012-08-07 01:14:32 +02:00
|
|
|
# Checkpoints being taken via the command line at <when> and at
|
|
|
|
# subsequent periods of <period>. Checkpoint instructions
|
|
|
|
# received from the benchmark running are ignored and skipped in
|
|
|
|
# favor of command line checkpoint instructions.
|
2013-03-22 23:31:24 +01:00
|
|
|
exit_event = scriptCheckpoints(options, maxtick, cptdir)
|
2014-12-23 15:31:17 +01:00
|
|
|
|
|
|
|
# Take SimPoint checkpoints
|
|
|
|
elif options.take_simpoint_checkpoints != None:
|
|
|
|
takeSimpointCheckpoints(simpoints, interval_length, cptdir)
|
|
|
|
|
|
|
|
# Restore from SimPoint checkpoints
|
|
|
|
elif options.restore_simpoint_checkpoint != None:
|
|
|
|
restoreSimpointCheckpoint()
|
|
|
|
|
2012-08-07 01:14:32 +02:00
|
|
|
else:
|
2012-08-15 16:38:07 +02:00
|
|
|
if options.fast_forward:
|
|
|
|
m5.stats.reset()
|
|
|
|
print "**** REAL SIMULATION ****"
|
|
|
|
|
2012-08-07 01:14:32 +02:00
|
|
|
# If checkpoints are being taken, then the checkpoint instruction
|
|
|
|
# will occur in the benchmark code it self.
|
2012-08-15 16:38:07 +02:00
|
|
|
if options.repeat_switch and maxtick > options.repeat_switch:
|
2013-01-08 23:12:22 +01:00
|
|
|
exit_event = repeatSwitch(testsys, repeat_switch_cpu_list,
|
2012-08-15 16:38:07 +02:00
|
|
|
maxtick, options.repeat_switch)
|
|
|
|
else:
|
2013-01-08 23:12:22 +01:00
|
|
|
exit_event = benchCheckpoints(options, maxtick, cptdir)
|
2006-10-27 22:32:26 +02:00
|
|
|
|
2013-01-08 23:12:22 +01:00
|
|
|
print 'Exiting @ tick %i because %s' % (m5.curTick(), exit_event.getCause())
|
2009-11-18 22:55:58 +01:00
|
|
|
if options.checkpoint_at_end:
|
2010-08-17 14:06:22 +02:00
|
|
|
m5.checkpoint(joinpath(cptdir, "cpt.%d"))
|
2013-01-08 14:54:12 +01:00
|
|
|
|
2013-02-10 13:23:54 +01:00
|
|
|
if not m5.options.interactive:
|
|
|
|
sys.exit(exit_event.getCode())
|