diff options
author | Nilay Vaish <nilay@cs.wisc.edu> | 2012-07-12 08:39:18 -0500 |
---|---|---|
committer | Nilay Vaish <nilay@cs.wisc.edu> | 2012-07-12 08:39:18 -0500 |
commit | ce4e9a9a50e9c80a132de881e486a4f9b5561fc0 (patch) | |
tree | 68d8b6ec65084145153c0091fe1b2a976328100b | |
parent | 8c18f6da9ecb38b571e88318a28ac4effbc97b5e (diff) | |
download | gem5-ce4e9a9a50e9c80a132de881e486a4f9b5561fc0.tar.xz |
Ruby: remove some unused stuff from SLICC files
-rw-r--r-- | src/mem/protocol/RubySlicc_Defines.sm | 6 | ||||
-rw-r--r-- | src/mem/protocol/RubySlicc_Exports.sm | 53 | ||||
-rw-r--r-- | src/mem/protocol/RubySlicc_MemControl.sm | 3 | ||||
-rw-r--r-- | src/mem/protocol/RubySlicc_Profiler.sm | 14 | ||||
-rw-r--r-- | src/mem/protocol/RubySlicc_Util.sm | 9 | ||||
-rw-r--r-- | src/mem/ruby/network/Topology.cc | 1 | ||||
-rw-r--r-- | src/mem/ruby/network/simple/SimpleNetwork.cc | 1 | ||||
-rw-r--r-- | src/mem/ruby/slicc_interface/RubyRequest.hh | 2 | ||||
-rw-r--r-- | src/mem/ruby/slicc_interface/RubySlicc_Profiler_interface.hh | 1 | ||||
-rw-r--r-- | src/mem/ruby/slicc_interface/RubySlicc_Util.hh | 48 |
10 files changed, 5 insertions, 133 deletions
diff --git a/src/mem/protocol/RubySlicc_Defines.sm b/src/mem/protocol/RubySlicc_Defines.sm index 9bafebf10..011cb7664 100644 --- a/src/mem/protocol/RubySlicc_Defines.sm +++ b/src/mem/protocol/RubySlicc_Defines.sm @@ -28,7 +28,7 @@ */ // Hack, no node object since base class has them -NodeID id, no_chip_object="yes", no_vector="yes", abstract_chip_ptr="true"; -NodeID version, no_chip_object="yes", no_vector="yes", abstract_chip_ptr="true"; -MachineID machineID, no_chip_object="yes", no_vector="yes", abstract_chip_ptr="true"; +NodeID id; +NodeID version; +MachineID machineID; diff --git a/src/mem/protocol/RubySlicc_Exports.sm b/src/mem/protocol/RubySlicc_Exports.sm index 92739385b..b42f9c3a9 100644 --- a/src/mem/protocol/RubySlicc_Exports.sm +++ b/src/mem/protocol/RubySlicc_Exports.sm @@ -1,6 +1,6 @@ - /* - * Copyright (c) 1999-2005 Mark D. Hill and David A. Wood + * Copyright (c) 1999-2012 Mark D. Hill and David A. Wood + * Copyright (c) 2011 Advanced Micro Devices, Inc. * All rights reserved. * * Redistribution and use in source and binary forms, with or without @@ -307,55 +307,6 @@ enumeration(MaskPredictorTraining, "MaskPredictorTraining_Undefined", desc="..." Both, desc="Both"; } -// Network Topologies -enumeration(TopologyType, desc="...") { - CROSSBAR, desc="One node per chip, single switch crossbar"; - HIERARCHICAL_SWITCH, desc="One node per chip, totally ordered hierarchical tree switched network"; - TORUS_2D, desc="One node per chip, 2D torus"; - PT_TO_PT, desc="One node per chip, Point to Point Network"; - FILE_SPECIFIED, desc="described by the file NETWORK_FILE"; -} - -// DNUCA AllocationStrategy -enumeration(AllocationStrategy, desc="...") { - InMiddle, desc=""; - InInvCorners, desc=""; - InSharedSides, desc=""; - StaticDist, desc=""; - RandomBank, desc=""; - FrequencyBank, desc=""; - FrequencyBlock, desc=""; - LRUBlock, desc=""; -} - -// DNUCA SearchMechanism -enumeration(SearchMechanism, desc="...") { - Perfect, desc=""; - PartialTag, desc=""; - BloomFilter, desc=""; - Random, desc=""; - None, desc=""; -} - -// DNUCA link type -enumeration(LinkType, desc="...") { - RC_1500UM, desc=""; - RC_2500UM, desc=""; - TL_9000UM, desc=""; - TL_11000UM, desc=""; - TL_13000UM, desc=""; - NO_ENERGY, desc=""; - NULL, desc=""; -} - -// transient request type -enumeration(TransientRequestType, desc="...", default="TransientRequestType_Undefined") { - Undefined, desc=""; - OffChip, desc=""; - OnChip, desc=""; - LocalTransient, desc=""; -} - // Request Status enumeration(RequestStatus, desc="...", default="RequestStatus_NULL") { Ready, desc="The sequencer is ready and the request does not alias"; diff --git a/src/mem/protocol/RubySlicc_MemControl.sm b/src/mem/protocol/RubySlicc_MemControl.sm index a51bf09d4..66bb37bca 100644 --- a/src/mem/protocol/RubySlicc_MemControl.sm +++ b/src/mem/protocol/RubySlicc_MemControl.sm @@ -61,7 +61,4 @@ structure(MemoryMsg, desc="...", interface="Message") { PrefetchBit Prefetch, desc="Is this a prefetch request"; bool ReadX, desc="Exclusive"; int Acks, desc="How many acks to expect"; - - } - diff --git a/src/mem/protocol/RubySlicc_Profiler.sm b/src/mem/protocol/RubySlicc_Profiler.sm index 773bf0025..50fe41fe5 100644 --- a/src/mem/protocol/RubySlicc_Profiler.sm +++ b/src/mem/protocol/RubySlicc_Profiler.sm @@ -29,16 +29,9 @@ // Profiler function -void profileStore(NodeID node, bool needCLB); -void profileCacheCLBsize(int size, int numStaleI); -void profileMemoryCLBsize(int size, int numStaleI); - // used by 2level exclusive cache protocols void profile_miss(RubyRequest msg); -// used by non-fast path protocols -void profile_L1Cache_miss(RubyRequest msg, NodeID l1cacheID); - // used by CMP protocols void profile_request(std::string L1CacheStateStr, std::string L2CacheStateStr, std::string directoryStateStr, std::string requestTypeStr); @@ -55,10 +48,3 @@ void profile_average_latency_estimate(int latency); // profile the total message delay of a message across a virtual network void profileMsgDelay(int virtualNetwork, int delayCycles); - -// used by transactional-memory protocols -void profile_transaction(int numStores); -void profile_trans_wb(); -void profileOverflow(Address addr, MachineID mach); - - diff --git a/src/mem/protocol/RubySlicc_Util.sm b/src/mem/protocol/RubySlicc_Util.sm index 92f3f14e8..e5ef7ca8d 100644 --- a/src/mem/protocol/RubySlicc_Util.sm +++ b/src/mem/protocol/RubySlicc_Util.sm @@ -36,22 +36,13 @@ Time get_time(); Time zero_time(); NodeID intToID(int nodenum); int IDToInt(NodeID id); -int addressToInt(Address addr); -bool multicast_retry(); -int numberOfNodes(); -int numberOfL1CachePerChip(); -int getAddThenMod(int addend1, int addend2, int modulus); int time_to_int(Time time); Time getTimeModInt(Time time, int modulus); Time getTimePlusInt(Time addend1, int addend2); Time getTimeMinusTime(Time t1, Time t2); -Time getPreviousDelayedCycles(Time t1, Time t2); void procProfileCoherenceRequest(NodeID node, bool needCLB); void dirProfileCoherenceRequest(NodeID node, bool needCLB); -bool isPerfectProtocol(); -bool L1trainsPrefetcher(); int max_tokens(); -bool distributedPersistentEnabled(); Address setOffset(Address addr, int offset); Address makeLineAddress(Address addr); int addressOffset(Address addr); diff --git a/src/mem/ruby/network/Topology.cc b/src/mem/ruby/network/Topology.cc index b92fba976..540b6bdc0 100644 --- a/src/mem/ruby/network/Topology.cc +++ b/src/mem/ruby/network/Topology.cc @@ -30,7 +30,6 @@ #include "debug/RubyNetwork.hh" #include "mem/protocol/MachineType.hh" -#include "mem/protocol/TopologyType.hh" #include "mem/ruby/common/NetDest.hh" #include "mem/ruby/network/BasicLink.hh" #include "mem/ruby/network/BasicRouter.hh" diff --git a/src/mem/ruby/network/simple/SimpleNetwork.cc b/src/mem/ruby/network/simple/SimpleNetwork.cc index 0eb8887d2..c2bf5c955 100644 --- a/src/mem/ruby/network/simple/SimpleNetwork.cc +++ b/src/mem/ruby/network/simple/SimpleNetwork.cc @@ -31,7 +31,6 @@ #include "base/cast.hh" #include "base/stl_helpers.hh" -#include "mem/protocol/TopologyType.hh" #include "mem/ruby/buffers/MessageBuffer.hh" #include "mem/ruby/common/NetDest.hh" #include "mem/ruby/network/BasicLink.hh" diff --git a/src/mem/ruby/slicc_interface/RubyRequest.hh b/src/mem/ruby/slicc_interface/RubyRequest.hh index 0e7ab039d..870ad1d0e 100644 --- a/src/mem/ruby/slicc_interface/RubyRequest.hh +++ b/src/mem/ruby/slicc_interface/RubyRequest.hh @@ -38,8 +38,6 @@ #include "mem/ruby/common/Address.hh" #include "mem/packet.hh" -typedef void* RubyPortHandle; - class RubyRequest : public Message { public: diff --git a/src/mem/ruby/slicc_interface/RubySlicc_Profiler_interface.hh b/src/mem/ruby/slicc_interface/RubySlicc_Profiler_interface.hh index bed42018b..596b00fbe 100644 --- a/src/mem/ruby/slicc_interface/RubySlicc_Profiler_interface.hh +++ b/src/mem/ruby/slicc_interface/RubySlicc_Profiler_interface.hh @@ -51,7 +51,6 @@ void profile_request(const std::string& L1CacheStateStr, const std::string& directoryStateStr, const std::string& requestTypeStr); void profile_miss(const RubyRequest& msg, NodeID id); -void profile_L1Cache_miss(const RubyRequest& msg, NodeID id); void profile_token_retry(const Address& addr, AccessType type, int count); void profile_filter_action(int action); void profile_persistent_prediction(const Address& addr, AccessType type); diff --git a/src/mem/ruby/slicc_interface/RubySlicc_Util.hh b/src/mem/ruby/slicc_interface/RubySlicc_Util.hh index d535ba7cd..b8fd46dd0 100644 --- a/src/mem/ruby/slicc_interface/RubySlicc_Util.hh +++ b/src/mem/ruby/slicc_interface/RubySlicc_Util.hh @@ -35,37 +35,17 @@ #include <cassert> -#include "mem/protocol/AccessType.hh" -#include "mem/protocol/GenericRequestType.hh" -#include "mem/protocol/MachineType.hh" -#include "mem/protocol/MessageSizeType.hh" -#include "mem/protocol/PrefetchBit.hh" #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" -#include "mem/ruby/system/MachineID.hh" #include "mem/ruby/system/System.hh" -class Set; -class NetDest; - inline int random(int n) { return random() % n; } -inline bool -multicast_retry() -{ - if (RubySystem::getRandomization()) { - return (random() & 0x1); - } else { - return true; - } -} - inline Time get_time() { @@ -92,24 +72,6 @@ IDToInt(NodeID id) return nodenum; } -inline int -addressToInt(Address addr) -{ - return (int)addr.getLineAddress(); -} - -inline bool -long_enough_ago(Time event) -{ - return ((get_time() - event) > 200); -} - -inline int -getAddThenMod(int addend1, int addend2, int modulus) -{ - return (addend1 + addend2) % modulus; -} - inline Time getTimeModInt(Time time, int modulus) { @@ -129,16 +91,6 @@ getTimeMinusTime(Time t1, Time t2) return t1 - t2; } -inline Time -getPreviousDelayedCycles(Time t1, Time t2) -{ - if (RubySystem::getRandomization()) { // when randomizing delayed - return 0; - } else { - return getTimeMinusTime(t1, t2); - } -} - // Return type for time_to_int is "Time" and not "int" so we get a // 64-bit integer inline Time |