CheckTable.cc revision 10348 
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    physical_address_t physical = 0;
41    Address address;
42
43    const int size1 = 32;
44    const int size2 = 100;
45
46    // The first set is to get some false sharing
47    physical = 1000;
48    for (int i = 0; i < size1; i++) {
49        // Setup linear addresses
50        address.setAddress(physical);
51        addCheck(address);
52        physical += CHECK_SIZE;
53    }
54
55    // The next two sets are to get some limited false sharing and
56    // cache conflicts
57    physical = 1000;
58    for (int i = 0; i < size2; i++) {
59        // Setup linear addresses
60        address.setAddress(physical);
61        addCheck(address);
62        physical += 256;
63    }
64
65    physical = 1000 + CHECK_SIZE;
66    for (int i = 0; i < size2; i++) {
67        // Setup linear addresses
68        address.setAddress(physical);
69        addCheck(address);
70        physical += 256;
71    }
72}
73
74CheckTable::~CheckTable()
75{
76    int size = m_check_vector.size();
77    for (int i = 0; i < size; i++)
78        delete m_check_vector[i];
79}
80
81void
82CheckTable::addCheck(const Address& address)
83{
84    if (floorLog2(CHECK_SIZE) != 0) {
85        if (address.bitSelect(0, CHECK_SIZE_BITS - 1) != 0) {
86            panic("Check not aligned");
87        }
88    }
89
90    for (int i = 0; i < CHECK_SIZE; i++) {
91        if (m_lookup_map.count(Address(address.getAddress()+i))) {
92            // A mapping for this byte already existed, discard the
93            // entire check
94            return;
95        }
96    }
97
98    Check* check_ptr = new Check(address, Address(100 + m_check_vector.size()),
99                                 m_num_writers, m_num_readers, m_tester_ptr);
100    for (int i = 0; i < CHECK_SIZE; i++) {
101        // Insert it once per byte
102        m_lookup_map[Address(address.getAddress() + i)] = check_ptr;
103    }
104    m_check_vector.push_back(check_ptr);
105}
106
107Check*
108CheckTable::getRandomCheck()
109{
110    assert(m_check_vector.size() > 0);
111    return m_check_vector[random_mt.random<unsigned>(0, m_check_vector.size() - 1)];
112}
113
114Check*
115CheckTable::getCheck(const Address& address)
116{
117    DPRINTF(RubyTest, "Looking for check by address: %s", address);
118
119    m5::hash_map<Address, Check*>::iterator i = m_lookup_map.find(address);
120
121    if (i == m_lookup_map.end())
122        return NULL;
123
124    Check* check = i->second;
125    assert(check != NULL);
126    return check;
127}
128
129void
130CheckTable::print(std::ostream& out) const
131{
132}
133