1/*
2 * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood
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
| 1/*
2 * Copyright (c) 1999-2008 Mark D. Hill and David A. Wood
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
|
29#include "mem/ruby/common/Address.hh"
30#include "mem/ruby/system/System.hh"
31
32physical_address_t
33Address::getLineAddress() const
34{
35 return bitSelect(RubySystem::getBlockSizeBits(), ADDRESS_WIDTH);
36}
37
38physical_address_t
39Address::getOffset() const
40{
41 return bitSelect(0, RubySystem::getBlockSizeBits() - 1);
42}
43
44void
45Address::makeLineAddress()
46{
47 m_address = maskLowOrderBits(RubySystem::getBlockSizeBits());
48}
49
50// returns the next stride address based on line address
51void
52Address::makeNextStrideAddress(int stride)
53{
54 m_address = maskLowOrderBits(RubySystem::getBlockSizeBits())
55 + RubySystem::getBlockSizeBytes()*stride;
56}
57
58Index
59Address::memoryModuleIndex() const
60{
61 Index index =
62 bitSelect(RubySystem::getBlockSizeBits() +
63 RubySystem::getMemorySizeBits(), ADDRESS_WIDTH);
64 assert (index >= 0);
65 return index;
66
67 // Index indexHighPortion =
68 // address.bitSelect(MEMORY_SIZE_BITS - 1,
69 // PAGE_SIZE_BITS + NUMBER_OF_MEMORY_MODULE_BITS);
70 // Index indexLowPortion =
71 // address.bitSelect(DATA_BLOCK_BITS, PAGE_SIZE_BITS - 1);
72 //
73 // Index index = indexLowPortion |
74 // (indexHighPortion << (PAGE_SIZE_BITS - DATA_BLOCK_BITS));
75
76 /*
77 Round-robin mapping of addresses, at page size granularity
78
79ADDRESS_WIDTH MEMORY_SIZE_BITS PAGE_SIZE_BITS DATA_BLOCK_BITS
80 | | | |
81 \ / \ / \ / \ / 0
82 -----------------------------------------------------------------------
83 | unused |xxxxxxxxxxxxxxx| |xxxxxxxxxxxxxxx| |
84 | |xxxxxxxxxxxxxxx| |xxxxxxxxxxxxxxx| |
85 -----------------------------------------------------------------------
86 indexHighPortion indexLowPortion
87 <------->
88 NUMBER_OF_MEMORY_MODULE_BITS
89 */
90}
91
92void
93Address::print(std::ostream& out) const
94{
95 using namespace std;
96 out << "[" << hex << "0x" << m_address << "," << " line 0x"
97 << maskLowOrderBits(RubySystem::getBlockSizeBits()) << dec << "]"
98 << flush;
99}
100
101void
102Address::output(std::ostream& out) const
103{
104 // Note: this outputs addresses in the form "ffff", not "0xffff".
105 // This code should always be able to write out addresses in a
106 // format that can be read in by the below input() method. Please
107 // don't change this without talking to Milo first.
108 out << std::hex << m_address << std::dec;
109}
110
111void
112Address::input(std::istream& in)
113{
114 // Note: this only works with addresses in the form "ffff", not
115 // "0xffff". This code should always be able to read in addresses
116 // written out by the above output() method. Please don't change
117 // this without talking to Milo first.
118 in >> std::hex >> m_address >> std::dec;
119}
120
121Address::Address(const Address& obj)
122{
123 m_address = obj.m_address;
124}
125
126Address&
127Address::operator=(const Address& obj)
128{
129 if (this == &obj) {
130 // assert(false);
131 } else {
132 m_address = obj.m_address;
133 }
134 return *this;
135}
136
| 31#include "mem/ruby/common/Address.hh"
32#include "mem/ruby/system/System.hh"
33
34physical_address_t
35Address::getLineAddress() const
36{
37 return bitSelect(RubySystem::getBlockSizeBits(), ADDRESS_WIDTH);
38}
39
40physical_address_t
41Address::getOffset() const
42{
43 return bitSelect(0, RubySystem::getBlockSizeBits() - 1);
44}
45
46void
47Address::makeLineAddress()
48{
49 m_address = maskLowOrderBits(RubySystem::getBlockSizeBits());
50}
51
52// returns the next stride address based on line address
53void
54Address::makeNextStrideAddress(int stride)
55{
56 m_address = maskLowOrderBits(RubySystem::getBlockSizeBits())
57 + RubySystem::getBlockSizeBytes()*stride;
58}
59
60Index
61Address::memoryModuleIndex() const
62{
63 Index index =
64 bitSelect(RubySystem::getBlockSizeBits() +
65 RubySystem::getMemorySizeBits(), ADDRESS_WIDTH);
66 assert (index >= 0);
67 return index;
68
69 // Index indexHighPortion =
70 // address.bitSelect(MEMORY_SIZE_BITS - 1,
71 // PAGE_SIZE_BITS + NUMBER_OF_MEMORY_MODULE_BITS);
72 // Index indexLowPortion =
73 // address.bitSelect(DATA_BLOCK_BITS, PAGE_SIZE_BITS - 1);
74 //
75 // Index index = indexLowPortion |
76 // (indexHighPortion << (PAGE_SIZE_BITS - DATA_BLOCK_BITS));
77
78 /*
79 Round-robin mapping of addresses, at page size granularity
80
81ADDRESS_WIDTH MEMORY_SIZE_BITS PAGE_SIZE_BITS DATA_BLOCK_BITS
82 | | | |
83 \ / \ / \ / \ / 0
84 -----------------------------------------------------------------------
85 | unused |xxxxxxxxxxxxxxx| |xxxxxxxxxxxxxxx| |
86 | |xxxxxxxxxxxxxxx| |xxxxxxxxxxxxxxx| |
87 -----------------------------------------------------------------------
88 indexHighPortion indexLowPortion
89 <------->
90 NUMBER_OF_MEMORY_MODULE_BITS
91 */
92}
93
94void
95Address::print(std::ostream& out) const
96{
97 using namespace std;
98 out << "[" << hex << "0x" << m_address << "," << " line 0x"
99 << maskLowOrderBits(RubySystem::getBlockSizeBits()) << dec << "]"
100 << flush;
101}
102
103void
104Address::output(std::ostream& out) const
105{
106 // Note: this outputs addresses in the form "ffff", not "0xffff".
107 // This code should always be able to write out addresses in a
108 // format that can be read in by the below input() method. Please
109 // don't change this without talking to Milo first.
110 out << std::hex << m_address << std::dec;
111}
112
113void
114Address::input(std::istream& in)
115{
116 // Note: this only works with addresses in the form "ffff", not
117 // "0xffff". This code should always be able to read in addresses
118 // written out by the above output() method. Please don't change
119 // this without talking to Milo first.
120 in >> std::hex >> m_address >> std::dec;
121}
122
123Address::Address(const Address& obj)
124{
125 m_address = obj.m_address;
126}
127
128Address&
129Address::operator=(const Address& obj)
130{
131 if (this == &obj) {
132 // assert(false);
133 } else {
134 m_address = obj.m_address;
135 }
136 return *this;
137}
138
|