1/* 2 * Copyright (c) 2009 Mark D. Hill and David A. Wood 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions are 7 * met: redistributions of source code must retain the above copyright 8 * notice, this list of conditions and the following disclaimer; --- 58 unchanged lines hidden (view full) --- 67 virtual MessageBuffer* getMandatoryQueue() const = 0; 68 virtual const std::string toString() const = 0; // returns text version of 69 // controller type 70 virtual AccessPermission getAccessPermission(const Address& addr) = 0; 71 virtual DataBlock& getDataBlock(const Address& addr) = 0; 72 73 virtual void print(std::ostream & out) const = 0; 74 virtual void wakeup() = 0; |
75 virtual void resetStats() = 0; 76 virtual void regStats(); |
77 78 virtual void recordCacheTrace(int cntrl, CacheRecorder* tr) = 0; 79 virtual Sequencer* getSequencer() const = 0; 80 81 //! These functions are used by ruby system to read/write the message 82 //! queues that exist with in the controller. 83 //! The boolean return value indicates if the read was performed 84 //! successfully. --- 9 unchanged lines hidden (view full) --- 94 //! Function for collating statistics from all the controllers of this 95 //! particular type. This function should only be called from the 96 //! version 0 of this controller type. 97 virtual void collateStats() 98 {fatal("collateStats() should be overridden!");} 99 100 public: 101 MachineID getMachineID() const { return m_machineID; } |
102 |
103 Stats::Histogram& getDelayHist() { return m_delayHistogram; } 104 Stats::Histogram& getDelayVCHist(uint32_t index) 105 { return *(m_delayVCHistogram[index]); } |
106 107 MessageBuffer *getPeerQueue(uint32_t pid) 108 { 109 std::map<uint32_t, MessageBuffer *>::iterator it = 110 peerQueueMap.find(pid); 111 assert(it != peerQueueMap.end()); 112 return (*it).second; 113 } --- 33 unchanged lines hidden (view full) --- 147 int m_buffer_size; 148 Cycles m_recycle_latency; 149 150 //! Map from physical network number to the Message Buffer. 151 std::map<uint32_t, MessageBuffer*> peerQueueMap; 152 153 //! Counter for the number of cycles when the transitions carried out 154 //! were equal to the maximum allowed |
155 Stats::Scalar m_fully_busy_cycles; |
156 |
157 //! Histogram for profiling delay for the messages this controller 158 //! cares for |
159 Stats::Histogram m_delayHistogram; 160 std::vector<Stats::Histogram *> m_delayVCHistogram; |
161 162 //! Callback class used for collating statistics from all the 163 //! controller of this type. 164 class StatsCallback : public Callback 165 { 166 private: 167 AbstractController *ctr; 168 169 public: 170 virtual ~StatsCallback() {} |
171 StatsCallback(AbstractController *_ctr) : ctr(_ctr) {} |
172 void process() {ctr->collateStats();} 173 }; 174}; 175 176#endif // __MEM_RUBY_SLICC_INTERFACE_ABSTRACTCONTROLLER_HH__ |