2 * Copyright (c) 2012-2013 ARM Limited
5 * The license below extends only to copyright in the software and shall
6 * not be construed as granting a license to any other intellectual
7 * property including but not limited to intellectual property relating
8 * to a hardware implementation of the functionality of the software
9 * licensed hereunder. You may use the software subject to the license
10 * terms below provided that you ensure that this notice is replicated
11 * unmodified and in its entirety in all distributions of the software,
12 * modified or unmodified, in source code or in binary form.
14 * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood
15 * Copyright (c) 2009 Advanced Micro Devices, Inc.
16 * All rights reserved.
18 * Redistribution and use in source and binary forms, with or without
19 * modification, are permitted provided that the following conditions are
20 * met: redistributions of source code must retain the above copyright
21 * notice, this list of conditions and the following disclaimer;
22 * redistributions in binary form must reproduce the above copyright
23 * notice, this list of conditions and the following disclaimer in the
24 * documentation and/or other materials provided with the distribution;
25 * neither the name of the copyright holders nor the names of its
26 * contributors may be used to endorse or promote products derived from
27 * this software without specific prior written permission.
29 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
30 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
31 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
32 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
33 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
34 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
35 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
36 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
37 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
38 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
39 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
42 #include "cpu/testers/rubytest/RubyTester.hh"
44 #include "base/logging.hh"
45 #include "base/trace.hh"
46 #include "cpu/testers/rubytest/Check.hh"
47 #include "debug/RubyTest.hh"
48 #include "mem/ruby/common/SubBlock.hh"
49 #include "sim/sim_exit.hh"
50 #include "sim/system.hh"
52 RubyTester::RubyTester(const Params
*p
)
54 checkStartEvent([this]{ wakeup(); }, "RubyTester tick",
55 false, Event::CPU_Tick_Pri
),
56 _masterId(p
->system
->getMasterId(this)),
57 m_checkTable_ptr(nullptr),
58 m_num_cpus(p
->num_cpus
),
59 m_checks_to_complete(p
->checks_to_complete
),
60 m_deadlock_threshold(p
->deadlock_threshold
),
63 m_wakeup_frequency(p
->wakeup_frequency
),
64 m_check_flush(p
->check_flush
),
65 m_num_inst_only_ports(p
->port_cpuInstPort_connection_count
),
66 m_num_inst_data_ports(p
->port_cpuInstDataPort_connection_count
)
68 m_checks_completed
= 0;
71 // Create the requested inst and data ports and place them on the
72 // appropriate read and write port lists. The reason for the subtle
73 // difference between inst and data ports vs. read and write ports is
74 // from the tester's perspective, it only needs to know whether a port
75 // supports reads (checks) or writes (actions). Meanwhile, the protocol
76 // controllers have data ports (support read and writes) or inst ports
77 // (support only reads).
78 // Note: the inst ports are the lowest elements of the readPort vector,
79 // then the data ports are added to the readPort vector
82 for (int i
= 0; i
< p
->port_cpuInstPort_connection_count
; ++i
) {
83 readPorts
.push_back(new CpuPort(csprintf("%s-instPort%d", name(), i
),
87 for (int i
= 0; i
< p
->port_cpuInstDataPort_connection_count
; ++i
) {
88 CpuPort
*port
= new CpuPort(csprintf("%s-instDataPort%d", name(), i
),
90 readPorts
.push_back(port
);
91 writePorts
.push_back(port
);
94 for (int i
= 0; i
< p
->port_cpuDataPort_connection_count
; ++i
) {
95 CpuPort
*port
= new CpuPort(csprintf("%s-dataPort%d", name(), i
),
97 readPorts
.push_back(port
);
98 writePorts
.push_back(port
);
102 // add the check start event to the event queue
103 schedule(checkStartEvent
, 1);
106 RubyTester::~RubyTester()
108 delete m_checkTable_ptr
;
109 // Only delete the readPorts since the writePorts are just a subset
110 for (int i
= 0; i
< readPorts
.size(); i
++)
117 assert(writePorts
.size() > 0 && readPorts
.size() > 0);
119 m_last_progress_vector
.resize(m_num_cpus
);
120 for (int i
= 0; i
< m_last_progress_vector
.size(); i
++) {
121 m_last_progress_vector
[i
] = Cycles(0);
124 m_num_writers
= writePorts
.size();
125 m_num_readers
= readPorts
.size();
126 assert(m_num_readers
== m_num_cpus
);
128 m_checkTable_ptr
= new CheckTable(m_num_writers
, m_num_readers
, this);
132 RubyTester::getMasterPort(const std::string
&if_name
, PortID idx
)
134 if (if_name
!= "cpuInstPort" && if_name
!= "cpuInstDataPort" &&
135 if_name
!= "cpuDataPort") {
136 // pass it along to our super class
137 return MemObject::getMasterPort(if_name
, idx
);
139 if (if_name
== "cpuInstPort") {
140 if (idx
> m_num_inst_only_ports
) {
141 panic("RubyTester::getMasterPort: unknown inst port %d\n",
145 // inst ports map to the lowest readPort elements
147 return *readPorts
[idx
];
148 } else if (if_name
== "cpuInstDataPort") {
149 if (idx
> m_num_inst_data_ports
) {
150 panic("RubyTester::getMasterPort: unknown inst+data port %d\n",
153 int read_idx
= idx
+ m_num_inst_only_ports
;
155 // inst+data ports map to the next readPort elements
157 return *readPorts
[read_idx
];
159 assert(if_name
== "cpuDataPort");
161 // data only ports map to the final readPort elements
163 if (idx
> (static_cast<int>(readPorts
.size()) -
164 (m_num_inst_only_ports
+ m_num_inst_data_ports
))) {
165 panic("RubyTester::getMasterPort: unknown data port %d\n",
168 int read_idx
= idx
+ m_num_inst_only_ports
+ m_num_inst_data_ports
;
169 return *readPorts
[read_idx
];
171 // Note: currently the Ruby Tester does not support write only ports
172 // but that could easily be added here
177 RubyTester::CpuPort::recvTimingResp(PacketPtr pkt
)
179 // retrieve the subblock and call hitCallback
180 RubyTester::SenderState
* senderState
=
181 safe_cast
<RubyTester::SenderState
*>(pkt
->senderState
);
182 SubBlock
& subblock
= senderState
->subBlock
;
184 tester
->hitCallback(globalIdx
, &subblock
);
186 // Now that the tester has completed, delete the senderState
187 // (includes sublock) and the packet, then return
188 delete pkt
->senderState
;
194 RubyTester::isInstOnlyCpuPort(int idx
)
196 return idx
< m_num_inst_only_ports
;
200 RubyTester::isInstDataCpuPort(int idx
)
202 return ((idx
>= m_num_inst_only_ports
) &&
203 (idx
< (m_num_inst_only_ports
+ m_num_inst_data_ports
)));
207 RubyTester::getReadableCpuPort(int idx
)
209 assert(idx
>= 0 && idx
< readPorts
.size());
211 return readPorts
[idx
];
215 RubyTester::getWritableCpuPort(int idx
)
217 assert(idx
>= 0 && idx
< writePorts
.size());
219 return writePorts
[idx
];
223 RubyTester::hitCallback(NodeID proc
, SubBlock
* data
)
225 // Mark that we made progress
226 m_last_progress_vector
[proc
] = curCycle();
228 DPRINTF(RubyTest
, "completed request for proc: %d", proc
);
229 DPRINTFR(RubyTest
, " addr: 0x%x, size: %d, data: ",
230 data
->getAddress(), data
->getSize());
231 for (int byte
= 0; byte
< data
->getSize(); byte
++) {
232 DPRINTFR(RubyTest
, "%d ", data
->getByte(byte
));
234 DPRINTFR(RubyTest
, "\n");
236 // This tells us our store has 'completed' or for a load gives us
237 // back the data to make the check
238 Check
* check_ptr
= m_checkTable_ptr
->getCheck(data
->getAddress());
239 assert(check_ptr
!= NULL
);
240 check_ptr
->performCallback(proc
, data
, curCycle());
246 if (m_checks_completed
< m_checks_to_complete
) {
247 // Try to perform an action or check
248 Check
* check_ptr
= m_checkTable_ptr
->getRandomCheck();
249 assert(check_ptr
!= NULL
);
250 check_ptr
->initiate();
254 schedule(checkStartEvent
, curTick() + m_wakeup_frequency
);
256 exitSimLoop("Ruby Tester completed");
261 RubyTester::checkForDeadlock()
263 int size
= m_last_progress_vector
.size();
264 Cycles current_time
= curCycle();
265 for (int processor
= 0; processor
< size
; processor
++) {
266 if ((current_time
- m_last_progress_vector
[processor
]) >
267 m_deadlock_threshold
) {
268 panic("Deadlock detected: current_time: %d last_progress_time: %d "
269 "difference: %d processor: %d\n",
270 current_time
, m_last_progress_vector
[processor
],
271 current_time
- m_last_progress_vector
[processor
], processor
);
277 RubyTester::print(std::ostream
& out
) const
279 out
<< "[RubyTester]" << std::endl
;
283 RubyTesterParams::create()
285 return new RubyTester(this);