| 1 |
/* |
| 2 |
* Copyright (C) 2013-2015, 2019 by the Konclude Developer Team. |
| 3 |
* |
| 4 |
* This file is part of the reasoning system Konclude. |
| 5 |
* For details and support, see <http://konclude.com/>. |
| 6 |
* |
| 7 |
* Konclude is free software: you can redistribute it and/or modify |
| 8 |
* it under the terms of version 3 of the GNU Lesser General Public |
| 9 |
* License (LGPLv3) as published by the Free Software Foundation. |
| 10 |
* |
| 11 |
* Konclude is distributed in the hope that it will be useful, |
| 12 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 13 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 14 |
* GNU (Lesser) General Public License for more details. |
| 15 |
* |
| 16 |
* You should have received a copy of the GNU (Lesser) General Public |
| 17 |
* License along with Konclude. If not, see <http://www.gnu.org/licenses/>. |
| 18 |
* |
| 19 |
*/ |
| 20 |
|
| 21 |
#include "CTaskReserveMultiArrayQueueConsumer.h" |
| 22 |
#include "CTaskReserveMultiArrayQueue.h" |
| 23 |
|
| 24 |
|
| 25 |
namespace Konclude { |
| 26 |
|
| 27 |
namespace Scheduler { |
| 28 |
|
| 29 |
|
| 30 |
|
| 31 |
CTaskReserveMultiArrayQueueConsumer::CTaskReserveMultiArrayQueueConsumer(CTaskReserveMultiArrayQueue* arrayQueue) : CLinkerBase<CTaskReserveMultiArrayQueueConsumer*,CTaskReserveMultiArrayQueueConsumer>(this), mArrayQueue(arrayQueue) { |
| 32 |
mTakenTask = 0; |
| 33 |
mRequestedTask = 0; |
| 34 |
mLastQueueLinker = nullptr; |
| 35 |
mQueueConsumerLinker = nullptr; |
| 36 |
} |
| 37 |
|
| 38 |
CTask* CTaskReserveMultiArrayQueueConsumer::getTask() { |
| 39 |
|
| 40 |
CXLinker<CTaskReserveArrayQueue*>* currentQueueLinker = mArrayQueue->getTaskReserveArrayQueueLinker(); |
| 41 |
while (currentQueueLinker != mLastQueueLinker) { |
| 42 |
CXLinker<CTaskReserveArrayQueueConsumer*>* newConsumerLinker = new CXLinker<CTaskReserveArrayQueueConsumer*>(); |
| 43 |
CTaskReserveArrayQueue* queue = currentQueueLinker->getData(); |
| 44 |
CTaskReserveArrayQueueConsumer* queueConsumer = dynamic_cast<CTaskReserveArrayQueueConsumer*>(queue->createTaskReserveQueueConsumer()); |
| 45 |
newConsumerLinker->initLinker(queueConsumer); |
| 46 |
|
| 47 |
mQueueConsumerLinker = newConsumerLinker->append(mQueueConsumerLinker); |
| 48 |
} |
| 49 |
CTask* task = nullptr; |
| 50 |
|
| 51 |
for (CXLinker<CTaskReserveArrayQueueConsumer*>* queueConsumerLinkerIt = mQueueConsumerLinker; !task && queueConsumerLinkerIt; queueConsumerLinkerIt = queueConsumerLinkerIt->getNext()) { |
| 52 |
CTaskReserveArrayQueueConsumer* queueConsumer = queueConsumerLinkerIt->getData(); |
| 53 |
task = queueConsumer->getTask(); |
| 54 |
} |
| 55 |
return task; |
| 56 |
} |
| 57 |
|
| 58 |
|
| 59 |
cint64 CTaskReserveMultiArrayQueueConsumer::getTakenTask() { |
| 60 |
return mTakenTask; |
| 61 |
} |
| 62 |
|
| 63 |
cint64 CTaskReserveMultiArrayQueueConsumer::getRequestedTask() { |
| 64 |
return mRequestedTask; |
| 65 |
} |
| 66 |
|
| 67 |
|
| 68 |
|
| 69 |
}; // end namespace Scheduler |
| 70 |
|
| 71 |
}; // end namespace Konclude |