3 * Copyright (c) 1999 Mark D. Hill and David A. Wood
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.
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.
38 #include "mem/ruby/common/Global.hh"
39 #include "mem/ruby/system/System.hh"
40 #include "mem/ruby/system/NodeID.hh"
41 #include "mem/ruby/system/MachineID.hh"
43 const int ADDRESS_WIDTH = 64; // address width in bytes
46 typedef Address PhysAddress;
47 typedef Address VirtAddress;
52 Address() { m_address = 0; }
53 explicit Address(physical_address_t address) { m_address = address; }
55 Address(const Address& obj);
56 Address& operator=(const Address& obj);
63 void setAddress(physical_address_t address) { m_address = address; }
64 physical_address_t getAddress() const {return m_address;}
65 // selects bits inclusive
66 physical_address_t bitSelect(int small, int big) const;
67 physical_address_t maskLowOrderBits(int number) const;
68 physical_address_t maskHighOrderBits(int number) const;
69 physical_address_t shiftLowOrderBits(int number) const;
70 physical_address_t getLineAddress() const
71 { return bitSelect(RubySystem::getBlockSizeBits(), ADDRESS_WIDTH); }
72 physical_address_t getOffset() const
73 { return bitSelect(0, RubySystem::getBlockSizeBits()-1); }
75 void makeLineAddress() { m_address = maskLowOrderBits(RubySystem::getBlockSizeBits()); }
76 // returns the next stride address based on line address
77 void makeNextStrideAddress( int stride) {
78 m_address = maskLowOrderBits(RubySystem::getBlockSizeBits())
79 + RubySystem::getBlockSizeBytes()*stride;
81 int getBankSetNum() const;
82 int getBankSetDist() const;
84 Index memoryModuleIndex() const;
86 void print(ostream& out) const;
87 void output(ostream& out) const;
88 void input(istream& in);
90 void setOffset( int offset ){
91 // first, zero out the offset bits
93 m_address |= (physical_address_t) offset;
99 // Private copy constructor and assignment operator
100 // Address(const Address& obj);
101 // Address& operator=(const Address& obj);
103 // Data Members (m_ prefix)
104 physical_address_t m_address;
108 Address line_address(const Address& addr) { Address temp(addr); temp.makeLineAddress(); return temp; }
110 // Output operator declaration
111 ostream& operator<<(ostream& out, const Address& obj);
112 // comparison operator declaration
113 bool operator==(const Address& obj1, const Address& obj2);
114 bool operator!=(const Address& obj1, const Address& obj2);
115 bool operator<(const Address& obj1, const Address& obj2);
116 /* Address& operator=(const physical_address_t address); */
119 bool operator<(const Address& obj1, const Address& obj2)
121 return obj1.getAddress() < obj2.getAddress();
124 // ******************* Definitions *******************
126 // Output operator definition
128 ostream& operator<<(ostream& out, const Address& obj)
136 bool operator==(const Address& obj1, const Address& obj2)
138 return (obj1.getAddress() == obj2.getAddress());
142 bool operator!=(const Address& obj1, const Address& obj2)
144 return (obj1.getAddress() != obj2.getAddress());
148 physical_address_t Address::bitSelect(int small, int big) const // rips bits inclusive
150 physical_address_t mask;
151 assert(big >= small);
153 if (big >= ADDRESS_WIDTH - 1) {
154 return (m_address >> small);
156 mask = ~((physical_address_t)~0 << (big + 1));
157 // FIXME - this is slow to manipulate a 64-bit number using 32-bits
158 physical_address_t partial = (m_address & mask);
159 return (partial >> small);
164 physical_address_t Address::maskLowOrderBits(int number) const
166 physical_address_t mask;
168 if (number >= ADDRESS_WIDTH - 1) {
171 mask = (physical_address_t)~0 << number;
173 return (m_address & mask);
177 physical_address_t Address::maskHighOrderBits(int number) const
179 physical_address_t mask;
181 if (number >= ADDRESS_WIDTH - 1) {
184 mask = (physical_address_t)~0 >> number;
186 return (m_address & mask);
190 physical_address_t Address::shiftLowOrderBits(int number) const
192 return (m_address >> number);
196 integer_t Address::memoryModuleIndex() const
198 integer_t index = bitSelect(RubySystem::getBlockSizeBits()+RubySystem::getMemorySizeBits(), ADDRESS_WIDTH);
202 // Index indexHighPortion = address.bitSelect(MEMORY_SIZE_BITS-1, PAGE_SIZE_BITS+NUMBER_OF_MEMORY_MODULE_BITS);
203 // Index indexLowPortion = address.bitSelect(DATA_BLOCK_BITS, PAGE_SIZE_BITS-1);
205 //Index index = indexLowPortion | (indexHighPortion << (PAGE_SIZE_BITS - DATA_BLOCK_BITS));
208 Round-robin mapping of addresses, at page size granularity
210 ADDRESS_WIDTH MEMORY_SIZE_BITS PAGE_SIZE_BITS DATA_BLOCK_BITS
213 -----------------------------------------------------------------------
214 | unused |xxxxxxxxxxxxxxx| |xxxxxxxxxxxxxxx| |
215 | |xxxxxxxxxxxxxxx| |xxxxxxxxxxxxxxx| |
216 -----------------------------------------------------------------------
217 indexHighPortion indexLowPortion
219 NUMBER_OF_MEMORY_MODULE_BITS
224 void Address::print(ostream& out) const
226 out << "[" << hex << "0x" << m_address << "," << " line 0x" << maskLowOrderBits(RubySystem::getBlockSizeBits()) << dec << "]" << flush;
230 namespace __gnu_cxx {
231 template <> struct hash<Address>
233 size_t operator()(const Address &s) const { return (size_t) s.getAddress(); }
237 template <> struct equal_to<Address>
239 bool operator()(const Address& s1, const Address& s2) const { return s1 == s2; }