Searched refs:current_time (Results 1 - 10 of 10) sorted by relevance

/gem5/src/mem/ruby/structures/
H A DWireBuffer.cc73 WireBuffer::enqueue(MsgPtr message, Tick current_time, Tick delta) argument
76 Tick arrival_time = current_time + delta;
77 assert(arrival_time > current_time);
91 WireBuffer::dequeue(Tick current_time) argument
93 assert(isReady(current_time));
108 WireBuffer::recycle(Tick current_time, Tick recycle_latency) argument
114 assert(isReady(current_time));
118 Tick future_time = current_time + recycle_latency;
129 WireBuffer::isReady(Tick current_time) argument
132 (m_message_queue.front()->getLastEnqueueTime() <= current_time));
[all...]
H A DWireBuffer.hh75 void enqueue(MsgPtr message, Tick current_time, Tick delta);
76 void dequeue(Tick current_time);
78 void recycle(Tick current_time, Tick recycle_latency);
79 bool isReady(Tick current_time);
81 bool areNSlotsAvailable(int n, Tick current_time) { return true; }; argument
H A DTBETable.hh50 areNSlotsAvailable(int n, Tick current_time) const
/gem5/src/mem/ruby/network/
H A DMessageBuffer.cc80 MessageBuffer::areNSlotsAvailable(unsigned int n, Tick current_time) argument
95 if (m_time_last_time_pop < current_time) {
100 if (m_time_last_time_enqueue < current_time) {
150 MessageBuffer::enqueue(MsgPtr message, Tick current_time, Tick delta) argument
153 if (m_time_last_time_enqueue < current_time) {
155 m_time_last_time_enqueue = current_time;
170 arrival_time = current_time + delta;
174 if (m_last_arrival_time < current_time) {
175 m_last_arrival_time = current_time;
179 arrival_time = current_time
226 dequeue(Tick current_time, bool decrement_messages) argument
290 recycle(Tick current_time, Tick recycle_latency) argument
326 reanalyzeMessages(Addr addr, Tick current_time) argument
344 reanalyzeAllMessages(Tick current_time) argument
364 stallMessage(Addr addr, Tick current_time) argument
[all...]
H A DMessageBuffer.hh61 void reanalyzeMessages(Addr addr, Tick current_time);
62 void reanalyzeAllMessages(Tick current_time);
63 void stallMessage(Addr addr, Tick current_time);
66 bool isReady(Tick current_time) const;
69 delayHead(Tick current_time, Tick delta) argument
75 enqueue(m, current_time, delta);
106 Tick dequeue(Tick current_time, bool decrement_messages = true);
111 void recycle(Tick current_time, Tick recycle_latency);
/gem5/src/mem/ruby/network/simple/
H A DThrottle.cc100 Tick current_time = m_switch->clockEdge(); local
102 while (bw_remaining > 0 && (in->isReady(current_time) ||
104 out->areNSlotsAvailable(1, current_time)) {
107 if (m_units_remaining[vnet] == 0 && in->isReady(current_time)) {
120 in->dequeue(current_time);
121 out->enqueue(msg_ptr, current_time,
135 if (bw_remaining > 0 && (in->isReady(current_time) ||
137 !out->areNSlotsAvailable(1, current_time)) {
H A DPerfectSwitch.cc148 Tick current_time = m_switch->clockEdge(); local
150 while (buffer->isReady(current_time)) {
181 out_queue_length += m_out[out][v]->getSize(current_time);
225 if (!m_out[outgoing][vnet]->areNSlotsAvailable(1, current_time))
256 buffer->dequeue(current_time);
278 m_out[outgoing][vnet]->enqueue(msg_ptr, current_time,
/gem5/src/cpu/testers/rubytest/
H A DRubyTester.cc264 Cycles current_time = curCycle(); local
266 if ((current_time - m_last_progress_vector[processor]) >
268 panic("Deadlock detected: current_time: %d last_progress_time: %d "
270 current_time, m_last_progress_vector[processor],
271 current_time - m_last_progress_vector[processor], processor);
/gem5/src/mem/ruby/system/
H A DSequencer.cc85 Cycles current_time = curCycle(); local
94 if (current_time - request->issue_time < m_deadlock_threshold)
101 current_time * clockPeriod(), request->issue_time * clockPeriod(),
102 (current_time * clockPeriod()) - (request->issue_time * clockPeriod()));
109 if (current_time - request->issue_time < m_deadlock_threshold)
116 current_time * clockPeriod(), request->issue_time * clockPeriod(),
117 (current_time * clockPeriod()) - (request->issue_time * clockPeriod()));
H A DGPUCoalescer.cc158 Cycles current_time = curCycle(); local
167 if (current_time - request->issue_time < m_deadlock_threshold)
174 current_time * clockPeriod(), request->issue_time * clockPeriod(),
175 (current_time - request->issue_time)*clockPeriod());
182 if (current_time - request->issue_time < m_deadlock_threshold)
189 current_time * clockPeriod(), request->issue_time * clockPeriod(),
190 (current_time - request->issue_time) * clockPeriod());

Completed in 18 milliseconds