Ruby.py (7809:9d94b886c61b) Ruby.py (7832:de7601e6e19d)
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;
9# redistributions in binary form must reproduce the above copyright
10# notice, this list of conditions and the following disclaimer in the
11# documentation and/or other materials provided with the distribution;
12# neither the name of the copyright holders nor the names of its
13# contributors may be used to endorse or promote products derived from
14# this software without specific prior written permission.
15#
16# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19# A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20# OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21# SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
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
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,
46 help="high order address bit to use for numa mapping. " \
47 "0 = highest bit, not specified = lowest bit")
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
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;
9# redistributions in binary form must reproduce the above copyright
10# notice, this list of conditions and the following disclaimer in the
11# documentation and/or other materials provided with the distribution;
12# neither the name of the copyright holders nor the names of its
13# contributors may be used to endorse or promote products derived from
14# this software without specific prior written permission.
15#
16# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19# A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20# OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21# SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
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
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,
46 help="high order address bit to use for numa mapping. " \
47 "0 = highest bit, not specified = lowest bit")
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)
56
57 parser.add_option("--recycle-latency", type="int", default=10,
58 help="Recycle latency for ruby controller input buffers")
59
60 parser.add_option("--random_seed", type="int", default=1234,
61 help="Used for seeding the random number generator")
62
63 protocol = buildEnv['PROTOCOL']
64 exec "import %s" % protocol
65 eval("%s.define_options(parser)" % protocol)
66
67def create_system(options, system, piobus = None, dma_devices = []):
68
69 protocol = buildEnv['PROTOCOL']
70 exec "import %s" % protocol
71 try:
72 (cpu_sequencers, dir_cntrls, all_cntrls) = \
73 eval("%s.create_system(options, system, piobus, dma_devices)" \
74 % protocol)
75 except:
76 print "Error: could not create sytem for ruby protocol %s" % protocol
77 raise
78
79 #
80 # Important: the topology must be created before the network and after the
81 # controllers.
82 #
83 exec "import %s" % options.topology
84 try:
85 net_topology = eval("%s.makeTopology(all_cntrls, options)" \
86 % options.topology)
87 except:
88 print "Error: could not create topology %s" % options.topology
89 raise
90
91 if options.garnet_network == "fixed":
92 network = GarnetNetwork_d(topology = net_topology)
93 elif options.garnet_network == "flexible":
94 network = GarnetNetwork(topology = net_topology)
95 else:
96 network = SimpleNetwork(topology = net_topology)
97
98 #
99 # Loop through the directory controlers.
100 # Determine the total memory size of the ruby system and verify it is equal
101 # to physmem. However, if Ruby memory is using sparse memory in SE
102 # mode, then the system should not back-up the memory state with
103 # the Memory Vector and thus the memory size bytes should stay at 0.
104 # Also set the numa bits to the appropriate values.
105 #
106 total_mem_size = MemorySize('0B')
107
108 dir_bits = int(math.log(options.num_dirs, 2))
109
110 if options.numa_high_bit:
111 numa_bit = options.numa_high_bit
112 else:
113 # if not specified, use the lowest bits above the block offest
114 if dir_bits > 0:
115 # add 5 because bits 0-5 are the block offset
116 numa_bit = dir_bits + 5
117 else:
118 numa_bit = 6
119
120 for dir_cntrl in dir_cntrls:
121 total_mem_size.value += dir_cntrl.directory.size.value
122 dir_cntrl.directory.numa_high_bit = numa_bit
123
124 physmem_size = long(system.physmem.range.second) - \
125 long(system.physmem.range.first) + 1
126 assert(total_mem_size.value == physmem_size)
127
128 ruby_profiler = RubyProfiler(num_of_sequencers = len(cpu_sequencers))
129
130 ruby = RubySystem(clock = options.clock,
131 network = network,
132 profiler = ruby_profiler,
133 tracer = RubyTracer(),
53 parser.add_option("--recycle-latency", type="int", default=10,
54 help="Recycle latency for ruby controller input buffers")
55
56 parser.add_option("--random_seed", type="int", default=1234,
57 help="Used for seeding the random number generator")
58
59 protocol = buildEnv['PROTOCOL']
60 exec "import %s" % protocol
61 eval("%s.define_options(parser)" % protocol)
62
63def create_system(options, system, piobus = None, dma_devices = []):
64
65 protocol = buildEnv['PROTOCOL']
66 exec "import %s" % protocol
67 try:
68 (cpu_sequencers, dir_cntrls, all_cntrls) = \
69 eval("%s.create_system(options, system, piobus, dma_devices)" \
70 % protocol)
71 except:
72 print "Error: could not create sytem for ruby protocol %s" % protocol
73 raise
74
75 #
76 # Important: the topology must be created before the network and after the
77 # controllers.
78 #
79 exec "import %s" % options.topology
80 try:
81 net_topology = eval("%s.makeTopology(all_cntrls, options)" \
82 % options.topology)
83 except:
84 print "Error: could not create topology %s" % options.topology
85 raise
86
87 if options.garnet_network == "fixed":
88 network = GarnetNetwork_d(topology = net_topology)
89 elif options.garnet_network == "flexible":
90 network = GarnetNetwork(topology = net_topology)
91 else:
92 network = SimpleNetwork(topology = net_topology)
93
94 #
95 # Loop through the directory controlers.
96 # Determine the total memory size of the ruby system and verify it is equal
97 # to physmem. However, if Ruby memory is using sparse memory in SE
98 # mode, then the system should not back-up the memory state with
99 # the Memory Vector and thus the memory size bytes should stay at 0.
100 # Also set the numa bits to the appropriate values.
101 #
102 total_mem_size = MemorySize('0B')
103
104 dir_bits = int(math.log(options.num_dirs, 2))
105
106 if options.numa_high_bit:
107 numa_bit = options.numa_high_bit
108 else:
109 # if not specified, use the lowest bits above the block offest
110 if dir_bits > 0:
111 # add 5 because bits 0-5 are the block offset
112 numa_bit = dir_bits + 5
113 else:
114 numa_bit = 6
115
116 for dir_cntrl in dir_cntrls:
117 total_mem_size.value += dir_cntrl.directory.size.value
118 dir_cntrl.directory.numa_high_bit = numa_bit
119
120 physmem_size = long(system.physmem.range.second) - \
121 long(system.physmem.range.first) + 1
122 assert(total_mem_size.value == physmem_size)
123
124 ruby_profiler = RubyProfiler(num_of_sequencers = len(cpu_sequencers))
125
126 ruby = RubySystem(clock = options.clock,
127 network = network,
128 profiler = ruby_profiler,
129 tracer = RubyTracer(),
134 debug = RubyDebug(filter_string = 'none',
135 verbosity_string = 'none',
136 protocol_trace = options.ruby_debug,
137 start_time = options.ruby_debug_cycle),
138 mem_size = total_mem_size)
139
140 ruby.cpu_ruby_ports = cpu_sequencers
141 ruby.random_seed = options.random_seed
142
143 return ruby
130 mem_size = total_mem_size)
131
132 ruby.cpu_ruby_ports = cpu_sequencers
133 ruby.random_seed = options.random_seed
134
135 return ruby