2009-05-11 19:38:43 +02:00
|
|
|
/*
|
|
|
|
* Copyright (c) 1999-2008 Mark D. Hill and David A. Wood
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions are
|
|
|
|
* met: redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer;
|
|
|
|
* redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution;
|
|
|
|
* neither the name of the copyright holders nor the names of its
|
|
|
|
* contributors may be used to endorse or promote products derived from
|
|
|
|
* this software without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
|
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
2010-03-23 02:43:53 +01:00
|
|
|
#ifndef __MEM_RUBY_SYSTEM_TBETABLE_HH__
|
|
|
|
#define __MEM_RUBY_SYSTEM_TBETABLE_HH__
|
2009-05-11 19:38:43 +02:00
|
|
|
|
2009-05-11 19:38:45 +02:00
|
|
|
#include "mem/gems_common/Map.hh"
|
|
|
|
#include "mem/ruby/common/Address.hh"
|
2010-03-23 02:43:53 +01:00
|
|
|
#include "mem/ruby/common/Global.hh"
|
2009-05-11 19:38:45 +02:00
|
|
|
#include "mem/ruby/profiler/Profiler.hh"
|
|
|
|
#include "mem/ruby/system/System.hh"
|
2009-05-11 19:38:43 +02:00
|
|
|
|
|
|
|
template<class ENTRY>
|
2010-03-23 02:43:53 +01:00
|
|
|
class TBETable
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
2010-03-23 02:43:53 +01:00
|
|
|
public:
|
|
|
|
TBETable(int number_of_TBEs)
|
|
|
|
: m_number_of_TBEs(number_of_TBEs)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
printConfig(ostream& out)
|
|
|
|
{
|
|
|
|
out << "TBEs_per_TBETable: " << m_number_of_TBEs << endl;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool isPresent(const Address& address) const;
|
|
|
|
void allocate(const Address& address);
|
|
|
|
void deallocate(const Address& address);
|
|
|
|
bool
|
|
|
|
areNSlotsAvailable(int n) const
|
|
|
|
{
|
|
|
|
return (m_number_of_TBEs - m_map.size()) >= n;
|
|
|
|
}
|
|
|
|
|
|
|
|
ENTRY& lookup(const Address& address);
|
|
|
|
const ENTRY& lookup(const Address& address) const;
|
|
|
|
|
|
|
|
// Print cache contents
|
|
|
|
void print(ostream& out) const;
|
|
|
|
|
|
|
|
private:
|
|
|
|
// Private copy constructor and assignment operator
|
|
|
|
TBETable(const TBETable& obj);
|
|
|
|
TBETable& operator=(const TBETable& obj);
|
|
|
|
|
|
|
|
// Data Members (m_prefix)
|
|
|
|
Map<Address, ENTRY> m_map;
|
|
|
|
|
|
|
|
private:
|
|
|
|
int m_number_of_TBEs;
|
|
|
|
};
|
2009-07-07 00:49:47 +02:00
|
|
|
|
2009-05-11 19:38:43 +02:00
|
|
|
template<class ENTRY>
|
2010-03-23 02:43:53 +01:00
|
|
|
inline ostream&
|
|
|
|
operator<<(ostream& out, const TBETable<ENTRY>& obj)
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
2010-03-23 02:43:53 +01:00
|
|
|
obj.print(out);
|
|
|
|
out << flush;
|
|
|
|
return out;
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
template<class ENTRY>
|
2010-03-23 02:43:53 +01:00
|
|
|
inline bool
|
|
|
|
TBETable<ENTRY>::isPresent(const Address& address) const
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
2010-03-23 02:43:53 +01:00
|
|
|
assert(address == line_address(address));
|
|
|
|
assert(m_map.size() <= m_number_of_TBEs);
|
|
|
|
return m_map.exist(address);
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
template<class ENTRY>
|
2010-03-23 02:43:53 +01:00
|
|
|
inline void
|
|
|
|
TBETable<ENTRY>::allocate(const Address& address)
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
2010-03-23 02:43:53 +01:00
|
|
|
assert(isPresent(address) == false);
|
|
|
|
assert(m_map.size() < m_number_of_TBEs);
|
|
|
|
m_map.add(address, ENTRY());
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
template<class ENTRY>
|
2010-03-23 02:43:53 +01:00
|
|
|
inline void
|
|
|
|
TBETable<ENTRY>::deallocate(const Address& address)
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
2010-03-23 02:43:53 +01:00
|
|
|
assert(isPresent(address) == true);
|
|
|
|
assert(m_map.size() > 0);
|
|
|
|
m_map.erase(address);
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
// looks an address up in the cache
|
|
|
|
template<class ENTRY>
|
2010-03-23 02:43:53 +01:00
|
|
|
inline ENTRY&
|
|
|
|
TBETable<ENTRY>::lookup(const Address& address)
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
2010-03-23 02:43:53 +01:00
|
|
|
assert(isPresent(address) == true);
|
|
|
|
return m_map.lookup(address);
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
// looks an address up in the cache
|
|
|
|
template<class ENTRY>
|
2010-03-23 02:43:53 +01:00
|
|
|
inline const ENTRY&
|
|
|
|
TBETable<ENTRY>::lookup(const Address& address) const
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
2010-03-23 02:43:53 +01:00
|
|
|
assert(isPresent(address) == true);
|
|
|
|
return m_map.lookup(address);
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
template<class ENTRY>
|
2010-03-23 02:43:53 +01:00
|
|
|
inline void
|
|
|
|
TBETable<ENTRY>::print(ostream& out) const
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2010-03-23 02:43:53 +01:00
|
|
|
#endif // __MEM_RUBY_SYSTEM_TBETABLE_HH__
|