| 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 "CTaskReserveMultiArrayQueue.h" |
| 22 |
|
| 23 |
|
| 24 |
namespace Konclude { |
| 25 |
|
| 26 |
namespace Scheduler { |
| 27 |
|
| 28 |
|
| 29 |
|
| 30 |
CTaskReserveMultiArrayQueue::CTaskReserveMultiArrayQueue(CTaskReserveArrayQueue* mainQueue) { |
| 31 |
mMainQueue = nullptr; |
| 32 |
mQueueLinker = nullptr; |
| 33 |
mConsumerLinker = nullptr; |
| 34 |
mQueuesCount = 0; |
| 35 |
if (!mainQueue) { |
| 36 |
mainQueue = new CTaskReserveArrayQueue(10000); |
| 37 |
} |
| 38 |
addTaskReserveArrayQueue(mainQueue); |
| 39 |
} |
| 40 |
|
| 41 |
|
| 42 |
CTaskReserveMultiArrayQueue* CTaskReserveMultiArrayQueue::addTaskReserveArrayQueue(CTaskReserveArrayQueue* queue) { |
| 43 |
CXLinker<CTaskReserveArrayQueue*>* queueLinker = new CXLinker<CTaskReserveArrayQueue*>(); |
| 44 |
queueLinker->initLinker(queue); |
| 45 |
mAddConsumerMutex.lock(); |
| 46 |
mQueueLinker = queueLinker->append(mQueueLinker); |
| 47 |
++mQueuesCount; |
| 48 |
mAddConsumerMutex.unlock(); |
| 49 |
return this; |
| 50 |
} |
| 51 |
|
| 52 |
|
| 53 |
bool CTaskReserveMultiArrayQueue::tryAddTasks(CTask*& tasks) { |
| 54 |
bool taskAdded = mMainQueue->tryAddTasks(tasks); |
| 55 |
return taskAdded; |
| 56 |
} |
| 57 |
|
| 58 |
|
| 59 |
cint64 CTaskReserveMultiArrayQueue::getTaskCount() { |
| 60 |
cint64 taskCount = 0; |
| 61 |
for (CXLinker<CTaskReserveArrayQueue*>* queueLinkerIt = mQueueLinker; queueLinkerIt; queueLinkerIt = queueLinkerIt->getNext()) { |
| 62 |
CTaskReserveArrayQueue* queue = queueLinkerIt->getData(); |
| 63 |
taskCount += queue->getTaskCount(); |
| 64 |
} |
| 65 |
return taskCount; |
| 66 |
} |
| 67 |
|
| 68 |
|
| 69 |
bool CTaskReserveMultiArrayQueue::tryGetTask(CTask*& task) { |
| 70 |
for (CXLinker<CTaskReserveArrayQueue*>* queueLinkerIt = mQueueLinker; queueLinkerIt; queueLinkerIt = queueLinkerIt->getNext()) { |
| 71 |
CTaskReserveArrayQueue* queue = queueLinkerIt->getData(); |
| 72 |
if (queue->tryGetTask(task)) { |
| 73 |
return true; |
| 74 |
} |
| 75 |
} |
| 76 |
return false; |
| 77 |
} |
| 78 |
|
| 79 |
|
| 80 |
CTaskReserveQueueConsumer* CTaskReserveMultiArrayQueue::createTaskReserveQueueConsumer() { |
| 81 |
CTaskReserveMultiArrayQueueConsumer* consumer = new CTaskReserveMultiArrayQueueConsumer(this); |
| 82 |
mAddConsumerMutex.lock(); |
| 83 |
mConsumerLinker = consumer->append(mConsumerLinker); |
| 84 |
mAddConsumerMutex.unlock(); |
| 85 |
return consumer; |
| 86 |
} |
| 87 |
|
| 88 |
CXLinker<CTaskReserveArrayQueue*>* CTaskReserveMultiArrayQueue::getTaskReserveArrayQueueLinker() { |
| 89 |
return mQueueLinker; |
| 90 |
} |
| 91 |
|
| 92 |
|
| 93 |
cint64 CTaskReserveMultiArrayQueue::getTaskReserveArrayQueueCount() { |
| 94 |
return mQueuesCount; |
| 95 |
} |
| 96 |
|
| 97 |
|
| 98 |
}; // end namespace Scheduler |
| 99 |
|
| 100 |
}; // end namespace Konclude |