gem5/src/mem/ruby/slicc_interface/RubySlicc_Util.hh

186 lines
4.3 KiB
C++
Raw Normal View History

/*
* 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
* These are the functions that exported to slicc from ruby.
*/
2010-03-23 02:43:53 +01:00
#ifndef __MEM_RUBY_SLICC_INTERFACE_RUBYSLICCUTIL_HH__
#define __MEM_RUBY_SLICC_INTERFACE_RUBYSLICCUTIL_HH__
#include <cassert>
2010-03-23 02:43:53 +01:00
#include "mem/protocol/AccessType.hh"
#include "mem/protocol/CacheMsg.hh"
#include "mem/protocol/CacheRequestType.hh"
#include "mem/protocol/Directory_State.hh"
2010-03-23 02:43:53 +01:00
#include "mem/protocol/GenericRequestType.hh"
#include "mem/protocol/L1Cache_State.hh"
2010-03-23 02:43:53 +01:00
#include "mem/protocol/MachineType.hh"
#include "mem/protocol/MessageSizeType.hh"
#include "mem/protocol/PrefetchBit.hh"
2010-03-23 02:43:53 +01:00
#include "mem/ruby/common/Address.hh"
#include "mem/ruby/common/Global.hh"
#include "mem/ruby/network/Network.hh"
#include "mem/ruby/slicc_interface/RubySlicc_ComponentMapping.hh"
2010-03-23 02:43:53 +01:00
#include "mem/ruby/system/MachineID.hh"
#include "mem/ruby/system/NodeID.hh"
#include "mem/ruby/system/System.hh"
class Set;
class NetDest;
2010-03-23 02:43:53 +01:00
inline int
random(int n)
{
return random() % n;
}
2010-03-23 02:43:53 +01:00
inline bool
multicast_retry()
{
2010-03-23 02:43:53 +01:00
if (RubySystem::getRandomization()) {
return (random() & 0x1);
} else {
return true;
}
}
2010-03-23 02:43:53 +01:00
inline int
cache_state_to_int(L1Cache_State state)
{
2010-03-23 02:43:53 +01:00
return state;
}
2010-03-23 02:43:53 +01:00
inline Time
get_time()
{
2010-03-23 02:43:53 +01:00
return g_eventQueue_ptr->getTime();
}
2010-03-23 02:43:53 +01:00
inline Time
zero_time()
{
2010-03-23 02:43:53 +01:00
return 0;
}
2010-03-23 02:43:53 +01:00
inline NodeID
intToID(int nodenum)
{
2010-03-23 02:43:53 +01:00
NodeID id = nodenum;
return id;
}
2010-03-23 02:43:53 +01:00
inline int
IDToInt(NodeID id)
{
2010-03-23 02:43:53 +01:00
int nodenum = id;
return nodenum;
}
2010-03-23 02:43:53 +01:00
inline int
addressToInt(Address addr)
{
2010-03-23 02:43:53 +01:00
return (int)addr.getLineAddress();
}
2010-03-23 02:43:53 +01:00
inline bool
long_enough_ago(Time event)
{
2010-03-23 02:43:53 +01:00
return ((get_time() - event) > 200);
}
2010-03-23 02:43:53 +01:00
inline int
getAddThenMod(int addend1, int addend2, int modulus)
{
2010-03-23 02:43:53 +01:00
return (addend1 + addend2) % modulus;
}
2010-03-23 02:43:53 +01:00
inline Time
getTimeModInt(Time time, int modulus)
{
2010-03-23 02:43:53 +01:00
return time % modulus;
}
2010-03-23 02:43:53 +01:00
inline Time
getTimePlusInt(Time addend1, int addend2)
{
2010-03-23 02:43:53 +01:00
return (Time) addend1 + addend2;
}
2010-03-23 02:43:53 +01:00
inline Time
getTimeMinusTime(Time t1, Time t2)
{
assert(t1 >= t2);
2010-03-23 02:43:53 +01:00
return t1 - t2;
}
2010-03-23 02:43:53 +01:00
inline Time
getPreviousDelayedCycles(Time t1, Time t2)
{
2010-03-23 02:43:53 +01:00
if (RubySystem::getRandomization()) { // when randomizing delayed
return 0;
} else {
return getTimeMinusTime(t1, t2);
}
}
2010-03-23 02:43:53 +01:00
// Return type for time_to_int is "Time" and not "int" so we get a
// 64-bit integer
inline Time
time_to_int(Time time)
{
2010-03-23 02:43:53 +01:00
return time;
}
// Appends an offset to an address
2010-03-23 02:43:53 +01:00
inline Address
setOffset(Address addr, int offset)
{
2010-03-23 02:43:53 +01:00
Address result = addr;
result.setOffset(offset);
return result;
}
// Makes an address into a line address
2010-03-23 02:43:53 +01:00
inline Address
makeLineAddress(Address addr)
{
2010-03-23 02:43:53 +01:00
Address result = addr;
result.makeLineAddress();
return result;
}
2010-03-23 02:43:53 +01:00
inline int
addressOffset(Address addr)
{
2010-03-23 02:43:53 +01:00
return addr.getOffset();
}
2010-03-23 02:43:53 +01:00
#endif // __MEM_RUBY_SLICC_INTERFACE_RUBYSLICCUTIL_HH__