1/*
2 * Copyright (c) 2013 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 * Author: Derek Hower
29 */
30
31#include "mem/ruby/structures/AbstractReplacementPolicy.hh"
32
| 1/*
2 * Copyright (c) 2013 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 * Author: Derek Hower
29 */
30
31#include "mem/ruby/structures/AbstractReplacementPolicy.hh"
32
|
34
35AbstractReplacementPolicy::AbstractReplacementPolicy(const Params * p)
36 : SimObject(p)
37{
38 m_num_sets = p->size/p->block_size/p->assoc;
39 m_assoc = p->assoc;
40 m_last_ref_ptr = new Tick*[m_num_sets];
41 for (unsigned i = 0; i < m_num_sets; i++){
42 m_last_ref_ptr[i] = new Tick[m_assoc];
43 for (unsigned j = 0; j < m_assoc; j++){
44 m_last_ref_ptr[i][j] = 0;
45 }
46 }
47}
48
49AbstractReplacementPolicy *
50ReplacementPolicyParams::create()
51{
52 fatal("Cannot create an AbstractReplacementPolicy");
53 return NULL;
54}
55
56
57
58AbstractReplacementPolicy::~AbstractReplacementPolicy()
59{
60 if (m_last_ref_ptr != NULL){
61 for (unsigned i = 0; i < m_num_sets; i++){
62 if (m_last_ref_ptr[i] != NULL){
63 delete[] m_last_ref_ptr[i];
64 }
65 }
66 delete[] m_last_ref_ptr;
67 }
68}
69
70Tick
71AbstractReplacementPolicy::getLastAccess(int64_t set, int64_t way)
72{
73 return m_last_ref_ptr[set][way];
74}
| 34
35AbstractReplacementPolicy::AbstractReplacementPolicy(const Params * p)
36 : SimObject(p)
37{
38 m_num_sets = p->size/p->block_size/p->assoc;
39 m_assoc = p->assoc;
40 m_last_ref_ptr = new Tick*[m_num_sets];
41 for (unsigned i = 0; i < m_num_sets; i++){
42 m_last_ref_ptr[i] = new Tick[m_assoc];
43 for (unsigned j = 0; j < m_assoc; j++){
44 m_last_ref_ptr[i][j] = 0;
45 }
46 }
47}
48
49AbstractReplacementPolicy *
50ReplacementPolicyParams::create()
51{
52 fatal("Cannot create an AbstractReplacementPolicy");
53 return NULL;
54}
55
56
57
58AbstractReplacementPolicy::~AbstractReplacementPolicy()
59{
60 if (m_last_ref_ptr != NULL){
61 for (unsigned i = 0; i < m_num_sets; i++){
62 if (m_last_ref_ptr[i] != NULL){
63 delete[] m_last_ref_ptr[i];
64 }
65 }
66 delete[] m_last_ref_ptr;
67 }
68}
69
70Tick
71AbstractReplacementPolicy::getLastAccess(int64_t set, int64_t way)
72{
73 return m_last_ref_ptr[set][way];
74}
|