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;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 */
28
29#ifndef __MEM_RUBY_SLICC_INTERFACE_ABSTRACTCONTROLLER_HH__
30#define __MEM_RUBY_SLICC_INTERFACE_ABSTRACTCONTROLLER_HH__
31
32#include <iostream>
33#include <string>
34
35#include "base/callback.hh"
36#include "mem/protocol/AccessPermission.hh"
37#include "mem/ruby/buffers/MessageBuffer.hh"
38#include "mem/ruby/common/Address.hh"
39#include "mem/ruby/common/Consumer.hh"
40#include "mem/ruby/common/DataBlock.hh"
41#include "mem/ruby/common/Histogram.hh"
42#include "mem/ruby/network/Network.hh"
43#include "mem/ruby/recorder/CacheRecorder.hh"
44#include "mem/ruby/system/MachineID.hh"
45#include "mem/packet.hh"
46#include "params/RubyController.hh"
47#include "sim/clocked_object.hh"
48
49class Network;
50
51class AbstractController : public ClockedObject, public Consumer
52{
53 public:
54 typedef RubyControllerParams Params;
55 AbstractController(const Params *p);
56 void init();
57 const Params *params() const { return (const Params *)_params; }
58
59 const NodeID getVersion() const { return m_version; }
60 void initNetworkPtr(Network* net_ptr) { m_net_ptr = net_ptr; }
61
62 // return instance name
63 const std::string getName() const { return m_name; }
64 void blockOnQueue(Address, MessageBuffer*);
65 void unblock(Address);
66
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;
| 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;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 */
28
29#ifndef __MEM_RUBY_SLICC_INTERFACE_ABSTRACTCONTROLLER_HH__
30#define __MEM_RUBY_SLICC_INTERFACE_ABSTRACTCONTROLLER_HH__
31
32#include <iostream>
33#include <string>
34
35#include "base/callback.hh"
36#include "mem/protocol/AccessPermission.hh"
37#include "mem/ruby/buffers/MessageBuffer.hh"
38#include "mem/ruby/common/Address.hh"
39#include "mem/ruby/common/Consumer.hh"
40#include "mem/ruby/common/DataBlock.hh"
41#include "mem/ruby/common/Histogram.hh"
42#include "mem/ruby/network/Network.hh"
43#include "mem/ruby/recorder/CacheRecorder.hh"
44#include "mem/ruby/system/MachineID.hh"
45#include "mem/packet.hh"
46#include "params/RubyController.hh"
47#include "sim/clocked_object.hh"
48
49class Network;
50
51class AbstractController : public ClockedObject, public Consumer
52{
53 public:
54 typedef RubyControllerParams Params;
55 AbstractController(const Params *p);
56 void init();
57 const Params *params() const { return (const Params *)_params; }
58
59 const NodeID getVersion() const { return m_version; }
60 void initNetworkPtr(Network* net_ptr) { m_net_ptr = net_ptr; }
61
62 // return instance name
63 const std::string getName() const { return m_name; }
64 void blockOnQueue(Address, MessageBuffer*);
65 void unblock(Address);
66
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 clearStats() = 0;
76 virtual void regStats() = 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.
85 virtual bool functionalReadBuffers(PacketPtr&) = 0;
86 //! The return value indicates the number of messages written with the
87 //! data from the packet.
88 virtual uint32_t functionalWriteBuffers(PacketPtr&) = 0;
89
90 //! Function for enqueuing a prefetch request
91 virtual void enqueuePrefetch(const Address&, const RubyRequestType&)
92 { fatal("Prefetches not implemented!");}
93
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; }
| 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.
85 virtual bool functionalReadBuffers(PacketPtr&) = 0;
86 //! The return value indicates the number of messages written with the
87 //! data from the packet.
88 virtual uint32_t functionalWriteBuffers(PacketPtr&) = 0;
89
90 //! Function for enqueuing a prefetch request
91 virtual void enqueuePrefetch(const Address&, const RubyRequestType&)
92 { fatal("Prefetches not implemented!");}
93
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 uint64_t getFullyBusyCycles() const { return m_fully_busy_cycles; }
103 uint64_t getRequestCount() const { return m_request_count; }
104 const std::map<std::string, uint64_t>& getRequestProfileMap() const
105 { return m_requestProfileMap; }
| |
106
| 102
|
107 Histogram& getDelayHist() { return m_delayHistogram; }
108 Histogram& getDelayVCHist(uint32_t index)
109 { return m_delayVCHistogram[index]; }
| 103 Stats::Histogram& getDelayHist() { return m_delayHistogram; }
104 Stats::Histogram& getDelayVCHist(uint32_t index)
105 { return *(m_delayVCHistogram[index]); }
|
110
111 MessageBuffer *getPeerQueue(uint32_t pid)
112 {
113 std::map<uint32_t, MessageBuffer *>::iterator it =
114 peerQueueMap.find(pid);
115 assert(it != peerQueueMap.end());
116 return (*it).second;
117 }
118
119 protected:
120 //! Profiles original cache requests including PUTs
121 void profileRequest(const std::string &request);
122 //! Profiles the delay associated with messages.
123 void profileMsgDelay(uint32_t virtualNetwork, Cycles delay);
124
125 //! Function for connecting peer controllers
126 void connectWithPeer(AbstractController *);
127 virtual void getQueuesFromPeer(AbstractController *)
128 { fatal("getQueuesFromPeer() should be called only if implemented!"); }
129
130 void stallBuffer(MessageBuffer* buf, Address addr);
131 void wakeUpBuffers(Address addr);
132 void wakeUpAllBuffers(Address addr);
133 void wakeUpAllBuffers();
134
135 protected:
136 std::string m_name;
137 NodeID m_version;
138 MachineID m_machineID;
139 NodeID m_clusterID;
140
141 Network* m_net_ptr;
142 bool m_is_blocking;
143 std::map<Address, MessageBuffer*> m_block_map;
144 typedef std::vector<MessageBuffer*> MsgVecType;
145 typedef std::map< Address, MsgVecType* > WaitingBufType;
146 WaitingBufType m_waiting_buffers;
147 unsigned int m_in_ports;
148 unsigned int m_cur_in_port;
149 int m_number_of_TBEs;
150 int m_transitions_per_cycle;
151 int m_buffer_size;
152 Cycles m_recycle_latency;
153
154 //! Map from physical network number to the Message Buffer.
155 std::map<uint32_t, MessageBuffer*> peerQueueMap;
156
157 //! Counter for the number of cycles when the transitions carried out
158 //! were equal to the maximum allowed
| 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 }
114
115 protected:
116 //! Profiles original cache requests including PUTs
117 void profileRequest(const std::string &request);
118 //! Profiles the delay associated with messages.
119 void profileMsgDelay(uint32_t virtualNetwork, Cycles delay);
120
121 //! Function for connecting peer controllers
122 void connectWithPeer(AbstractController *);
123 virtual void getQueuesFromPeer(AbstractController *)
124 { fatal("getQueuesFromPeer() should be called only if implemented!"); }
125
126 void stallBuffer(MessageBuffer* buf, Address addr);
127 void wakeUpBuffers(Address addr);
128 void wakeUpAllBuffers(Address addr);
129 void wakeUpAllBuffers();
130
131 protected:
132 std::string m_name;
133 NodeID m_version;
134 MachineID m_machineID;
135 NodeID m_clusterID;
136
137 Network* m_net_ptr;
138 bool m_is_blocking;
139 std::map<Address, MessageBuffer*> m_block_map;
140 typedef std::vector<MessageBuffer*> MsgVecType;
141 typedef std::map< Address, MsgVecType* > WaitingBufType;
142 WaitingBufType m_waiting_buffers;
143 unsigned int m_in_ports;
144 unsigned int m_cur_in_port;
145 int m_number_of_TBEs;
146 int m_transitions_per_cycle;
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
|
159 uint64_t m_fully_busy_cycles;
| 155 Stats::Scalar m_fully_busy_cycles;
|
160
| 156
|
161 //! Map for couting requests of different types. The controller should
162 //! call requisite function for updating the count.
163 std::map<std::string, uint64_t> m_requestProfileMap;
164 uint64_t m_request_count;
165
| |
166 //! Histogram for profiling delay for the messages this controller
167 //! cares for
| 157 //! Histogram for profiling delay for the messages this controller
158 //! cares for
|
168 Histogram m_delayHistogram;
169 std::vector<Histogram> m_delayVCHistogram;
| 159 Stats::Histogram m_delayHistogram;
160 std::vector<Stats::Histogram *> m_delayVCHistogram;
|
170
171 //! Callback class used for collating statistics from all the
172 //! controller of this type.
173 class StatsCallback : public Callback
174 {
175 private:
176 AbstractController *ctr;
177
178 public:
179 virtual ~StatsCallback() {}
| 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() {}
|
180
181 StatsCallback(AbstractController *_ctr)
182 : ctr(_ctr)
183 {
184 }
185
| 171 StatsCallback(AbstractController *_ctr) : ctr(_ctr) {}
|
186 void process() {ctr->collateStats();}
187 };
188};
189
190#endif // __MEM_RUBY_SLICC_INTERFACE_ABSTRACTCONTROLLER_HH__
| 172 void process() {ctr->collateStats();}
173 };
174};
175
176#endif // __MEM_RUBY_SLICC_INTERFACE_ABSTRACTCONTROLLER_HH__
|