Parent: [180d2e] (diff)

Child: [569601] (diff)

Download this file

RMTPort.h    236 lines (197 with data), 5.9 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
//
// 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/.
//
#ifndef __RINA_RMTPORT_H_
#define __RINA_RMTPORT_H_
#include <omnetpp.h>
#include <algorithm>
#include "RINASignals.h"
#include "Flow.h"
#include "CDAPMessage_m.h"
#include "RMTQueue.h"
#include "QueueIDGenBase.h"
class RMTPort : public cSimpleModule
{
/* tight coupling for management purposes */
friend class RA;
friend class RMT;
friend class RMTModuleAllocator;
public:
/**
* Returns the port state (ready to send out data/busy).
*
* @return port state
*/
bool isOutputReady();
/**
* Returns the port state (ready to receive data/busy).
*
* @return port state
*/
bool isInputReady();
/**
* Marks the port as blocked for sending (e.g. when (N-1)-EFCPI isn't keeping up).
*/
void blockOutput();
/**
* Unmarks the port as blocked for sending (e.g. when (N-1)-EFCPI is keeping up again).
*/
void unblockOutput();
/**
* Marks the port as blocked for reading (e.g. when other (N-1)-ports aren't keeping up).
*/
void blockInput();
/**
* Unmarks the port as blocked for reading (e.g. when other (N-1)-ports are keeping up again).
*/
void unblockInput();
/**
* Returns input block status.
*/
bool hasBlockedInput() { return blockedInput; };
/*
* Returns the input drain speed of this port.
*/
long getInputRate();
/*
* Sets the input drain speed of this port.
*/
void setInputRate(long pdusPerSecond);
/**
* Returns the (N-1)-flow this port is assigned to.
*
* @return (N-1)-flow object
*/
const Flow* getFlow() const;
/**
* Returns the port's management queue.
* Note: this will go away soon when we start dedicating entire (N-1)-flows
* for management purposes
*
* @param type direction of data
* @return management queue
*/
RMTQueue* getManagementQueue(RMTQueueType type) const;
/**
* Returns the first queue available on this port.
* Note: this excludes the temporary management queues
*
* @param type direction of data
* @return queue
*/
RMTQueue* getFirstQueue(RMTQueueType type) const;
/**
* Returns the longest queue attached to this port.
*
* @param type direction of data
* @return queue
*/
RMTQueue* getLongestQueue(RMTQueueType type) const;
/**
* Returns the queue that matches given ID.
*
* @param type direction of data
* @param queueId queue ID
* @return queue
*/
RMTQueue* getQueueById(RMTQueueType type, const char* queueId) const;
/**
* Returns a list of available input queues.
*
* @return set of queues
*/
const RMTQueues& getInputQueues() const;
/**
* Returns a list of available output queues.
*
* @return set of queues
*/
const RMTQueues& getOutputQueues() const;
/**
* Returns number of PDUs waiting to be read.
*
* @param direction of transfer (read/serve)
* @return PDUs count accross queues
*/
unsigned long getWaiting(RMTQueueType direction);
protected:
virtual void initialize();
virtual void handleMessage(cMessage* msg);
/**
* Increments number of waiting PDUs.
*
* @param direction of transfer (read/serve)
*/
void addWaiting(RMTQueueType direction);
/**
* Decrements number of waiting PDUs.
*
* @param direction of transfer (read/serve)
* @return PDUs count accross queues
*/
void substractWaiting(RMTQueueType direction);
private:
bool inputReady;
bool outputReady;
bool blockedInput;
bool blockedOutput;
unsigned long waitingOnInput;
unsigned long waitingOnOutput;
long inputReadRate;
double postReadDelay;
std::string dstAppAddr;
Flow* flow;
QueueIDGenBase* queueIdGen;
std::set<cGate*> northInputGates;
cGate* southInputGate;
cGate* southOutputGate;
cChannel* outputChannel;
RMTQueues outputQueues;
RMTQueues inputQueues;
/**
* Marks the port as ready to receive data.
*/
void setOutputReady();
/**
* Marks the port as busy (e.g. when sending data through it).
*/
void setOutputBusy();
/**
* Marks the port as ready to receive data.
*/
void setInputReady();
/**
* Marks the port as busy (e.g. when sending data through it).
*/
void setInputBusy();
void postInitialize();
void setFlow(Flow* flow);
void registerInputQueue(RMTQueue* queue);
void registerOutputQueue(RMTQueue* queue);
void unregisterInputQueue(RMTQueue* queue);
void unregisterOutputQueue(RMTQueue* queue);
cGate* getSouthInputGate() const;
cGate* getSouthOutputGate() const;
void scheduleNextRead();
void scheduleNextWrite();
void redrawGUI(bool redrawParent = false);
simsignal_t sigRMTPortReadyForRead;
simsignal_t sigRMTPortReadyToWrite;
simsignal_t sigStatRMTPortUp;
simsignal_t sigStatRMTPortDown;
};
typedef std::vector<RMTPort*> RMTPorts;
#endif