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
|
/*
* Copyright (C) 2013-2015, 2019 by the Konclude Developer Team.
*
* This file is part of the reasoning system Konclude.
* For details and support, see <http://konclude.com/>.
*
* Konclude is free software: you can redistribute it and/or modify
* it under the terms of version 3 of the GNU Lesser General Public
* License (LGPLv3) as published by the Free Software Foundation.
*
* Konclude 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 Konclude. If not, see <http://www.gnu.org/licenses/>.
*
*/
#include "CTaskReserveMultiArrayQueueConsumer.h"
#include "CTaskReserveMultiArrayQueue.h"
namespace Konclude {
namespace Scheduler {
CTaskReserveMultiArrayQueueConsumer::CTaskReserveMultiArrayQueueConsumer(CTaskReserveMultiArrayQueue* arrayQueue) : CLinkerBase<CTaskReserveMultiArrayQueueConsumer*,CTaskReserveMultiArrayQueueConsumer>(this), mArrayQueue(arrayQueue) {
mTakenTask = 0;
mRequestedTask = 0;
mLastQueueLinker = nullptr;
mQueueConsumerLinker = nullptr;
}
CTask* CTaskReserveMultiArrayQueueConsumer::getTask() {
CXLinker<CTaskReserveArrayQueue*>* currentQueueLinker = mArrayQueue->getTaskReserveArrayQueueLinker();
while (currentQueueLinker != mLastQueueLinker) {
CXLinker<CTaskReserveArrayQueueConsumer*>* newConsumerLinker = new CXLinker<CTaskReserveArrayQueueConsumer*>();
CTaskReserveArrayQueue* queue = currentQueueLinker->getData();
CTaskReserveArrayQueueConsumer* queueConsumer = dynamic_cast<CTaskReserveArrayQueueConsumer*>(queue->createTaskReserveQueueConsumer());
newConsumerLinker->initLinker(queueConsumer);
mQueueConsumerLinker = newConsumerLinker->append(mQueueConsumerLinker);
}
CTask* task = nullptr;
for (CXLinker<CTaskReserveArrayQueueConsumer*>* queueConsumerLinkerIt = mQueueConsumerLinker; !task && queueConsumerLinkerIt; queueConsumerLinkerIt = queueConsumerLinkerIt->getNext()) {
CTaskReserveArrayQueueConsumer* queueConsumer = queueConsumerLinkerIt->getData();
task = queueConsumer->getTask();
}
return task;
}
cint64 CTaskReserveMultiArrayQueueConsumer::getTakenTask() {
return mTakenTask;
}
cint64 CTaskReserveMultiArrayQueueConsumer::getRequestedTask() {
return mRequestedTask;
}
}; // end namespace Scheduler
}; // end namespace Konclude
|
