CheckTable.cc revision 11168 
1/*
2 * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood
3 * Copyright (c) 2009 Advanced Micro Devices, Inc.
4 * All rights reserved.
5 *
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions are
8 * met: redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer;
10 * redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution;
13 * neither the name of the copyright holders nor the names of its
14 * contributors may be used to endorse or promote products derived from
15 * this software without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
18 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
19 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
20 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
21 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
22 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
23 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
27 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 */
29
30#include "base/intmath.hh"
31#include "base/random.hh"
32#include "cpu/testers/rubytest/Check.hh"
33#include "cpu/testers/rubytest/CheckTable.hh"
34#include "debug/RubyTest.hh"
35
36CheckTable::CheckTable(int _num_writers, int _num_readers, RubyTester* _tester)
37    : m_num_writers(_num_writers), m_num_readers(_num_readers),
38      m_tester_ptr(_tester)
39{
40    Addr physical = 0;
41
42    const int size1 = 32;
43    const int size2 = 100;
44
45    // The first set is to get some false sharing
46    physical = 1000;
47    for (int i = 0; i < size1; i++) {
48        // Setup linear addresses
49        addCheck(physical);
50        physical += CHECK_SIZE;
51    }
52
53    // The next two sets are to get some limited false sharing and
54    // cache conflicts
55    physical = 1000;
56    for (int i = 0; i < size2; i++) {
57        // Setup linear addresses
58        addCheck(physical);
59        physical += 256;
60    }
61
62    physical = 1000 + CHECK_SIZE;
63    for (int i = 0; i < size2; i++) {
64        // Setup linear addresses
65        addCheck(physical);
66        physical += 256;
67    }
68}
69
70CheckTable::~CheckTable()
71{
72    int size = m_check_vector.size();
73    for (int i = 0; i < size; i++)
74        delete m_check_vector[i];
75}
76
77void
78CheckTable::addCheck(Addr address)
79{
80    if (floorLog2(CHECK_SIZE) != 0) {
81        if (bitSelect(address, 0, CHECK_SIZE_BITS - 1) != 0) {
82            panic("Check not aligned");
83        }
84    }
85
86    for (int i = 0; i < CHECK_SIZE; i++) {
87        if (m_lookup_map.count(address+i)) {
88            // A mapping for this byte already existed, discard the
89            // entire check
90            return;
91        }
92    }
93
94    Check* check_ptr = new Check(address, 100 + m_check_vector.size(),
95                                 m_num_writers, m_num_readers, m_tester_ptr);
96    for (int i = 0; i < CHECK_SIZE; i++) {
97        // Insert it once per byte
98        m_lookup_map[address + i] = check_ptr;
99    }
100    m_check_vector.push_back(check_ptr);
101}
102
103Check*
104CheckTable::getRandomCheck()
105{
106    assert(m_check_vector.size() > 0);
107    return m_check_vector[random_mt.random<unsigned>(0, m_check_vector.size() - 1)];
108}
109
110Check*
111CheckTable::getCheck(const Addr address)
112{
113    DPRINTF(RubyTest, "Looking for check by address: %s", address);
114
115    auto i = m_lookup_map.find(address);
116
117    if (i == m_lookup_map.end())
118        return NULL;
119
120    Check* check = i->second;
121    assert(check != NULL);
122    return check;
123}
124
125void
126CheckTable::print(std::ostream& out) const
127{
128}
129