Ruby.py (7557:bd48f4547e77) Ruby.py (7563:406e98960def)
1# Copyright (c) 2006-2007 The Regents of The University of Michigan
2# Copyright (c) 2009 Advanced Micro Devices, Inc.
3# All rights reserved.
4#
5# Redistribution and use in source and binary forms, with or without
6# modification, are permitted provided that the following conditions are
7# met: redistributions of source code must retain the above copyright
8# notice, this list of conditions and the following disclaimer;

--- 13 unchanged lines hidden (view full) ---

22# LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23# DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24# THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27#
28# Authors: Brad Beckmann
29
1# Copyright (c) 2006-2007 The Regents of The University of Michigan
2# Copyright (c) 2009 Advanced Micro Devices, Inc.
3# All rights reserved.
4#
5# Redistribution and use in source and binary forms, with or without
6# modification, are permitted provided that the following conditions are
7# met: redistributions of source code must retain the above copyright
8# notice, this list of conditions and the following disclaimer;

--- 13 unchanged lines hidden (view full) ---

22# LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23# DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24# THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27#
28# Authors: Brad Beckmann
29
30import math
30import m5
31from m5.objects import *
32from m5.defines import buildEnv
33
34def define_options(parser):
35 # ruby network options
36 parser.add_option("--topology", type="string", default="Crossbar",
37 help="check src/mem/ruby/network/topologies for complete set")
38 parser.add_option("--mesh-rows", type="int", default=1,
39 help="the number of rows in the mesh topology")
40 parser.add_option("--garnet-network", type="string", default=none,
41 help="'fixed'|'flexible'")
42
43 # ruby mapping options
44 parser.add_option("--numa-high-bit", type="int", default=none,
31import m5
32from m5.objects import *
33from m5.defines import buildEnv
34
35def define_options(parser):
36 # ruby network options
37 parser.add_option("--topology", type="string", default="Crossbar",
38 help="check src/mem/ruby/network/topologies for complete set")
39 parser.add_option("--mesh-rows", type="int", default=1,
40 help="the number of rows in the mesh topology")
41 parser.add_option("--garnet-network", type="string", default=none,
42 help="'fixed'|'flexible'")
43
44 # ruby mapping options
45 parser.add_option("--numa-high-bit", type="int", default=none,
45 help="high order address bit to use for numa mapping")
46 help="high order address bit to use for numa mapping. " \
47 "0 = highest bit, not specified = lowest bit")
46
47 # ruby sparse memory options
48 parser.add_option("--use-map", action="store_true", default=False)
49 parser.add_option("--map-levels", type="int", default=4)
50
51 # ruby debug cmd line options
52 parser.add_option("--ruby-debug", action="store_true", default=False)
53 parser.add_option("--ruby-debug-cycle", type="int", default=1)

--- 29 unchanged lines hidden (view full) ---

83 if options.garnet_network == "fixed":
84 network = GarnetNetwork_d(topology = net_topology)
85 elif options.garnet_network == "flexible":
86 network = GarnetNetwork(topology = net_topology)
87 else:
88 network = SimpleNetwork(topology = net_topology)
89
90 #
48
49 # ruby sparse memory options
50 parser.add_option("--use-map", action="store_true", default=False)
51 parser.add_option("--map-levels", type="int", default=4)
52
53 # ruby debug cmd line options
54 parser.add_option("--ruby-debug", action="store_true", default=False)
55 parser.add_option("--ruby-debug-cycle", type="int", default=1)

--- 29 unchanged lines hidden (view full) ---

85 if options.garnet_network == "fixed":
86 network = GarnetNetwork_d(topology = net_topology)
87 elif options.garnet_network == "flexible":
88 network = GarnetNetwork(topology = net_topology)
89 else:
90 network = SimpleNetwork(topology = net_topology)
91
92 #
93 # Loop through the directory controlers.
91 # Determine the total memory size of the ruby system and verify it is equal
92 # to physmem. However, if Ruby memory is using sparse memory in SE
93 # mode, then the system should not back-up the memory state with
94 # the Memory Vector and thus the memory size bytes should stay at 0.
94 # Determine the total memory size of the ruby system and verify it is equal
95 # to physmem. However, if Ruby memory is using sparse memory in SE
96 # mode, then the system should not back-up the memory state with
97 # the Memory Vector and thus the memory size bytes should stay at 0.
98 # Also set the numa bits to the appropriate values.
95 #
96 total_mem_size = MemorySize('0B')
99 #
100 total_mem_size = MemorySize('0B')
101
102 dir_bits = int(math.log(options.num_dirs, 2))
103
104 if options.numa_high_bit:
105 numa_bit = options.numa_high_bit
106 else:
107 # if not specified, use the lowest bits above the block offest
108 if options.numa_high_bit == 0:
109 if dir_bits > 0:
110 # add 5 because bits 0-5 are the block offset
111 numa_bit = dir_bits + 5
112 else:
113 numa_bit = 6
114
97 for dir_cntrl in dir_cntrls:
98 total_mem_size.value += dir_cntrl.directory.size.value
115 for dir_cntrl in dir_cntrls:
116 total_mem_size.value += dir_cntrl.directory.size.value
117 dir_cntrl.directory.numa_high_bit = numa_bit
118
99 physmem_size = long(system.physmem.range.second) - \
100 long(system.physmem.range.first) + 1
101 assert(total_mem_size.value == physmem_size)
102
103 ruby_profiler = RubyProfiler(num_of_sequencers = len(cpu_sequencers))
104
105 ruby = RubySystem(clock = options.clock,
106 network = network,
107 profiler = ruby_profiler,
108 tracer = RubyTracer(),
109 debug = RubyDebug(filter_string = 'none',
110 verbosity_string = 'none',
111 protocol_trace = options.ruby_debug,
112 start_time = options.ruby_debug_cycle),
113 mem_size = total_mem_size)
114
115 ruby.cpu_ruby_ports = cpu_sequencers
116
117 return ruby
119 physmem_size = long(system.physmem.range.second) - \
120 long(system.physmem.range.first) + 1
121 assert(total_mem_size.value == physmem_size)
122
123 ruby_profiler = RubyProfiler(num_of_sequencers = len(cpu_sequencers))
124
125 ruby = RubySystem(clock = options.clock,
126 network = network,
127 profiler = ruby_profiler,
128 tracer = RubyTracer(),
129 debug = RubyDebug(filter_string = 'none',
130 verbosity_string = 'none',
131 protocol_trace = options.ruby_debug,
132 start_time = options.ruby_debug_cycle),
133 mem_size = total_mem_size)
134
135 ruby.cpu_ruby_ports = cpu_sequencers
136
137 return ruby