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.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* $Id$
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef COMPONENTMAPPINGFNS_H
|
|
|
|
#define COMPONENTMAPPINGFNS_H
|
|
|
|
|
2009-05-11 19:38:45 +02:00
|
|
|
#include "mem/ruby/common/Global.hh"
|
|
|
|
#include "mem/ruby/config/RubyConfig.hh"
|
|
|
|
#include "mem/ruby/system/NodeID.hh"
|
|
|
|
#include "mem/ruby/system/MachineID.hh"
|
|
|
|
#include "mem/ruby/common/Address.hh"
|
|
|
|
#include "mem/ruby/common/Set.hh"
|
|
|
|
#include "mem/ruby/common/NetDest.hh"
|
|
|
|
#include "mem/protocol/GenericMachineType.hh"
|
2009-07-07 00:49:47 +02:00
|
|
|
#include "mem/ruby/system/DirectoryMemory.hh"
|
2009-05-11 19:38:43 +02:00
|
|
|
|
|
|
|
#ifdef MACHINETYPE_L1Cache
|
|
|
|
#define MACHINETYPE_L1CACHE_ENUM MachineType_L1Cache
|
|
|
|
#else
|
|
|
|
#define MACHINETYPE_L1CACHE_ENUM MachineType_NUM
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifdef MACHINETYPE_L2Cache
|
|
|
|
#define MACHINETYPE_L2CACHE_ENUM MachineType_L2Cache
|
|
|
|
#else
|
|
|
|
#define MACHINETYPE_L2CACHE_ENUM MachineType_NUM
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifdef MACHINETYPE_L3Cache
|
|
|
|
#define MACHINETYPE_L3CACHE_ENUM MachineType_L3Cache
|
|
|
|
#else
|
|
|
|
#define MACHINETYPE_L3CACHE_ENUM MachineType_NUM
|
|
|
|
#endif
|
|
|
|
|
2009-07-07 00:49:47 +02:00
|
|
|
/*
|
2009-05-11 19:38:43 +02:00
|
|
|
#ifdef MACHINETYPE_PersistentArbiter
|
|
|
|
#define MACHINETYPE_PERSISTENTARBITER_ENUM MachineType_PersistentArbiter
|
|
|
|
#else
|
|
|
|
#define MACHINETYPE_PERSISTENTARBITER_ENUM MachineType_NUM
|
|
|
|
#endif
|
2009-07-07 00:49:47 +02:00
|
|
|
*/
|
|
|
|
/*
|
|
|
|
inline MachineID map_Address_to_L2Cache(const Address & addr)
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
2009-07-07 00:49:47 +02:00
|
|
|
int L2bank = 0;
|
|
|
|
MachineID mach = {MACHINETYPE_L2CACHE_ENUM, 0};
|
|
|
|
L2bank = addr.bitSelect(RubySystem::getBlockSizeBits(),
|
|
|
|
RubySystem::getBlockSizeBits() + RubyConfig::getNumberOfCachesPerLevel(2)-1);
|
|
|
|
mach.num = L2bank;
|
|
|
|
return mach;
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
// input parameter is the base ruby node of the L1 cache
|
|
|
|
// returns a value between 0 and total_L2_Caches_within_the_system
|
|
|
|
inline
|
|
|
|
MachineID map_L1CacheMachId_to_L2Cache(const Address& addr, MachineID L1CacheMachId)
|
|
|
|
{
|
2009-07-07 00:49:47 +02:00
|
|
|
return map_Address_to_L2Cache(addr);
|
|
|
|
|
2009-05-11 19:38:43 +02:00
|
|
|
int L2bank = 0;
|
|
|
|
MachineID mach = {MACHINETYPE_L2CACHE_ENUM, 0};
|
|
|
|
|
|
|
|
if (RubyConfig::L2CachePerChipBits() > 0) {
|
2009-07-07 00:49:47 +02:00
|
|
|
if (RubyConfig::getMAP_L2BANKS_TO_LOWEST_BITS()) {
|
|
|
|
L2bank = addr.bitSelect(RubySystem::getBlockSizeBits(),
|
|
|
|
RubySystem::getBlockSizeBits()+RubyConfig::L2CachePerChipBits()-1);
|
2009-05-11 19:38:43 +02:00
|
|
|
} else {
|
2009-07-07 00:49:47 +02:00
|
|
|
L2bank = addr.bitSelect(RubySystem::getBlockSizeBits()+RubyConfig::getL2_CACHE_NUM_SETS_BITS(),
|
|
|
|
RubySystem::getBlockSizeBits()+RubyConfig::getL2_CACHE_NUM_SETS_BITS()+RubyConfig::L2CachePerChipBits()-1);
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
assert(L2bank < RubyConfig::numberOfL2CachePerChip());
|
|
|
|
assert(L2bank >= 0);
|
|
|
|
|
|
|
|
mach.num = RubyConfig::L1CacheNumToL2Base(L1CacheMachId.num)*RubyConfig::numberOfL2CachePerChip() // base #
|
|
|
|
+ L2bank; // bank #
|
|
|
|
assert(mach.num < RubyConfig::numberOfL2Cache());
|
|
|
|
return mach;
|
2009-07-07 00:49:47 +02:00
|
|
|
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
|
|
|
|
2009-07-07 00:49:47 +02:00
|
|
|
|
2009-05-11 19:38:43 +02:00
|
|
|
// used to determine the correct L2 bank
|
|
|
|
// input parameter is the base ruby node of the L2 cache
|
|
|
|
// returns a value between 0 and total_L2_Caches_within_the_system
|
2009-07-07 00:49:47 +02:00
|
|
|
|
2009-05-11 19:38:43 +02:00
|
|
|
inline
|
|
|
|
MachineID map_L2ChipId_to_L2Cache(const Address& addr, NodeID L2ChipId)
|
|
|
|
{
|
2009-07-07 00:49:47 +02:00
|
|
|
return map_Address_to_L2Cache(addr);
|
|
|
|
|
2009-05-11 19:38:43 +02:00
|
|
|
assert(L2ChipId < RubyConfig::numberOfChips());
|
|
|
|
|
|
|
|
int L2bank = 0;
|
|
|
|
MachineID mach = {MACHINETYPE_L2CACHE_ENUM, 0};
|
2009-07-07 00:49:47 +02:00
|
|
|
L2bank = addr.bitSelect(RubySystem::getBlockSizeBits(),
|
|
|
|
RubySystem::getBlockSizeBits() + RubyConfig::numberOfCachesPerLevel(2)-1);
|
|
|
|
mach.num = L2bank;
|
|
|
|
return mach
|
2009-05-11 19:38:43 +02:00
|
|
|
|
|
|
|
}
|
2009-07-07 00:49:47 +02:00
|
|
|
*/
|
|
|
|
|
2009-05-11 19:38:43 +02:00
|
|
|
|
|
|
|
// used to determine the home directory
|
|
|
|
// returns a value between 0 and total_directories_within_the_system
|
|
|
|
inline
|
|
|
|
NodeID map_Address_to_DirectoryNode(const Address& addr)
|
|
|
|
{
|
2009-07-07 00:49:47 +02:00
|
|
|
return DirectoryMemory::mapAddressToDirectoryVersion(addr);
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
// used to determine the home directory
|
|
|
|
// returns a value between 0 and total_directories_within_the_system
|
|
|
|
inline
|
|
|
|
MachineID map_Address_to_Directory(const Address &addr)
|
|
|
|
{
|
|
|
|
MachineID mach = {MachineType_Directory, map_Address_to_DirectoryNode(addr)};
|
|
|
|
return mach;
|
|
|
|
}
|
|
|
|
|
|
|
|
inline
|
2009-07-07 00:49:47 +02:00
|
|
|
MachineID map_Address_to_DMA(const Address & addr)
|
2009-05-11 19:38:43 +02:00
|
|
|
{
|
2009-07-07 00:49:47 +02:00
|
|
|
MachineID dma = {MachineType_DMA, 0};
|
|
|
|
return dma;
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
|
|
|
|
2009-07-07 00:49:47 +02:00
|
|
|
/*
|
2009-05-11 19:38:43 +02:00
|
|
|
inline
|
|
|
|
NetDest getOtherLocalL1IDs(MachineID L1)
|
|
|
|
{
|
|
|
|
int start = (L1.num / RubyConfig::numberOfProcsPerChip()) * RubyConfig::numberOfProcsPerChip();
|
|
|
|
NetDest ret;
|
|
|
|
|
|
|
|
assert(MACHINETYPE_L1CACHE_ENUM != MachineType_NUM);
|
|
|
|
|
|
|
|
for (int i = start; i < (start + RubyConfig::numberOfProcsPerChip()); i++) {
|
|
|
|
if (i != L1.num) {
|
|
|
|
MachineID mach = { MACHINETYPE_L1CACHE_ENUM, i };
|
|
|
|
ret.add( mach );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
2009-07-07 00:49:47 +02:00
|
|
|
*/
|
2009-05-11 19:38:43 +02:00
|
|
|
|
|
|
|
extern inline NodeID machineIDToNodeID(MachineID machID)
|
|
|
|
{
|
|
|
|
// return machID.num%RubyConfig::numberOfChips();
|
|
|
|
return machID.num;
|
|
|
|
}
|
|
|
|
|
|
|
|
extern inline MachineType machineIDToMachineType(MachineID machID)
|
|
|
|
{
|
|
|
|
return machID.type;
|
|
|
|
}
|
|
|
|
|
|
|
|
extern inline NodeID L1CacheMachIDToProcessorNum(MachineID machID)
|
|
|
|
{
|
|
|
|
assert(machID.type == MachineType_L1Cache);
|
|
|
|
return machID.num;
|
|
|
|
}
|
2009-07-07 00:49:47 +02:00
|
|
|
/*
|
2009-05-11 19:38:43 +02:00
|
|
|
extern inline NodeID L2CacheMachIDToChipID(MachineID machID)
|
|
|
|
{
|
|
|
|
assert(machID.type == MACHINETYPE_L2CACHE_ENUM);
|
2009-07-07 00:49:47 +02:00
|
|
|
int L2bank = machID.num;
|
|
|
|
int banks_seen = 0;
|
|
|
|
for (int i=0;i<RubyConfig::getNumberOfChips();i++) {
|
|
|
|
for (int j=0;j<RubyConfig::getNumberOfCachesPerLevelPerChip(2,i);j++) {
|
|
|
|
if (banks_seen == L2bank)
|
|
|
|
return i;
|
|
|
|
banks_seen++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
assert(0);
|
2009-05-11 19:38:43 +02:00
|
|
|
}
|
2009-07-07 00:49:47 +02:00
|
|
|
*/
|
2009-05-11 19:38:43 +02:00
|
|
|
extern inline MachineID getL1MachineID(NodeID L1RubyNode)
|
|
|
|
{
|
|
|
|
MachineID mach = {MACHINETYPE_L1CACHE_ENUM, L1RubyNode};
|
|
|
|
return mach;
|
|
|
|
}
|
|
|
|
|
|
|
|
extern inline GenericMachineType ConvertMachToGenericMach(MachineType machType) {
|
|
|
|
if (machType == MACHINETYPE_L1CACHE_ENUM) {
|
|
|
|
return GenericMachineType_L1Cache;
|
|
|
|
} else if (machType == MACHINETYPE_L2CACHE_ENUM) {
|
|
|
|
return GenericMachineType_L2Cache;
|
|
|
|
} else if (machType == MACHINETYPE_L3CACHE_ENUM) {
|
|
|
|
return GenericMachineType_L3Cache;
|
|
|
|
} else if (machType == MachineType_Directory) {
|
|
|
|
return GenericMachineType_Directory;
|
|
|
|
} else {
|
|
|
|
ERROR_MSG("cannot convert to a GenericMachineType");
|
|
|
|
return GenericMachineType_NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
#endif // COMPONENTMAPPINGFNS_H
|