Parent: [6ccca6] (diff)

Child: [b323f7] (diff)

Download this file

LongestQFirst.cc    52 lines (45 with data), 1.4 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
//
// 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 "LongestQFirst.h"
Define_Module(LongestQFirst);
void LongestQFirst::processQueues(RMTPort* port, RMTQueueType direction)
{
if (direction == RMTQueue::OUTPUT)
{
if (port->isReady())
{
port->setBusy();
RMTQueue* outQ = port->getLongestQueue(RMTQueue::OUTPUT);
outQ->releasePDU();
}
else
{
port->addWaitingOnOutput();
}
}
else if (direction == RMTQueue::INPUT)
{
if (inputBusy[port] != true)
{
inputBusy[port] = true;
RMTQueue* inQ = port->getLongestQueue(RMTQueue::INPUT);
inQ->releasePDU();
}
else
{
port->addWaitingOnInput();
}
}
}