Parent: [180d2e] (diff)

Child: [569601] (diff)

Download this file

RMTQueue.cc    264 lines (219 with data), 5.6 kB

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
//
// Copyright Š 2014 - 2015 PRISTINE Consortium (http://ict-pristine.eu)
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with this program. If not, see http://www.gnu.org/licenses/.
//
#include "RMTQueue.h"
const char* SIG_STAT_RMTQUEUE_LENGTH = "RMTQueue_Length";
const char* SIG_STAT_RMTQUEUE_DROP = "RMTQueue_Drop";
Define_Module(RMTQueue);
RMTQueue::~RMTQueue()
{
while (!queue.empty())
{
delete queue.front();
queue.pop_front();
}
}
void RMTQueue::finish()
{
size_t pduCount = queue.size();
if (pduCount)
{
EV << "Queue " << getFullPath() << " still contains " << pduCount
<< " unprocessed PDUs!" << endl;
for (iterator it = begin(); it != end(); ++it)
{
cPacket* p = *it;
EV << p->getClassName() << " received at " << p->getArrivalTime() << endl;
}
}
}
void RMTQueue::initialize()
{
outputGate = gate("outputGate");
inputGate = gate("inputGate");
// message retrieval signal handler
sigRMTPDURcvd = registerSignal(SIG_RMT_QueuePDURcvd);
// message pre-departure signal handler
sigRMTPDUPreSend = registerSignal(SIG_RMT_QueuePDUPreSend);
// message departure signal handler
sigRMTPDUSent = registerSignal(SIG_RMT_QueuePDUSent);
// length for vector stats
sigStatRMTQueueLength = registerSignal(SIG_STAT_RMTQUEUE_LENGTH);
maxQLength = getParentModule()->getParentModule()->par("defaultMaxQLength");
thresholdQLength = getParentModule()->getParentModule()->par("defaultThreshQLength");
qTime = simTime();
redrawGUI();
WATCH(thresholdQLength);
WATCH(maxQLength);
WATCH(qTime);
}
std::string RMTQueue::info() const
{
std::ostringstream os;
os << "name: " << this->getFullName()
<< "; type: " << ((this->type == INPUT) ? "input" : "output")
<< "; saturation: " << getLength() << "/" << this->maxQLength;
return os.str();
}
std::ostream& operator <<(std::ostream& os, const RMTQueue& cte)
{
return os << cte.info();
}
void RMTQueue::redrawGUI()
{
if (!ev.isGUI())
{
return;
}
int len = getLength();
cDisplayString& disp = getDisplayString();
// change color to reflect queue saturation
if (len == 0)
{
disp.setTagArg("i", 1, "");
}
else if (len < thresholdQLength)
{
disp.setTagArg("i", 1, "#80FF80");
}
else if (len < maxQLength)
{
disp.setTagArg("i", 1, "#FF8000");
}
else
{
disp.setTagArg("i", 1, "#800000");
}
// print current saturation in numbers
std::ostringstream desc;
desc << " " << len << "/" << maxQLength;
disp.setTagArg("t", 1, "l");
disp.setTagArg("t", 0, desc.str().c_str());
}
void RMTQueue::handleMessage(cMessage* msg)
{
if (dynamic_cast<cPacket*>(msg) != NULL)
{
enqueuePDU((cPacket*)msg);
}
else
{
EV << "handleMessage(): unsupported message type!" << endl;
}
}
void RMTQueue::enqueuePDU(cPacket* pdu)
{
queue.push_back(pdu);
emit(sigRMTPDURcvd, this);
emit(sigStatRMTQueueLength, getLength());
redrawGUI();
}
void RMTQueue::releasePDU(void)
{
Enter_Method("releasePDU()");
if (this->getLength() > 0)
{
emit(sigRMTPDUPreSend, this);
cPacket* pdu = queue.front();
queue.pop_front();
send(pdu, outputGate);
if (getLength() == 0)
{
qTime = simTime();
}
emit(sigRMTPDUSent, this);
emit(sigStatRMTQueueLength, getLength());
bubble("Releasing a PDU...");
redrawGUI();
}
}
cPacket* RMTQueue::dropLast()
{
cPacket* dropped = queue.back();
bubble("Dropping a PDU...");
queue.pop_back();
redrawGUI();
return dropped;
}
void RMTQueue::markCongestionOnLast()
{
cPacket* msg = queue.back();
if (dynamic_cast<PDU*>(msg) != NULL)
{
PDU* pdu = (PDU*) msg;
pdu->setFlags(pdu->getFlags() | 0x01);
}
else
{
EV << "The message isn't a PDU, cannot apply marking!" << endl;
}
}
int RMTQueue::getLength() const
{
return queue.size();
}
int RMTQueue::getMaxLength() const
{
return maxQLength;
}
void RMTQueue::setMaxLength(int val)
{
this->maxQLength = val;
}
int RMTQueue::getThreshLength() const
{
return thresholdQLength;
}
void RMTQueue::setThreshLength(int val)
{
this->thresholdQLength = val;
}
simtime_t RMTQueue::getQTime() const
{
return qTime;
}
RMTQueueType RMTQueue::getType() const
{
return type;
}
void RMTQueue::setType(queueType type)
{
this->type = type;
}
cGate* RMTQueue::getRMTAccessGate() const
{
return rmtAccessGate;
}
void RMTQueue::setRMTAccessGate(cGate* gate)
{
rmtAccessGate = gate;
}
cGate* RMTQueue::getOutputGate() const
{
return outputGate;
}
cGate* RMTQueue::getInputGate() const
{
return inputGate;
}
const cPacket* RMTQueue::getFirstPDU() const
{
return queue.front();
}
const cPacket* RMTQueue::getLastPDU() const
{
return queue.back();
}