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
|
/*
* 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 "CTaskReserveMultiArrayQueue.h"
namespace Konclude {
namespace Scheduler {
CTaskReserveMultiArrayQueue::CTaskReserveMultiArrayQueue(CTaskReserveArrayQueue* mainQueue) {
mMainQueue = nullptr;
mQueueLinker = nullptr;
mConsumerLinker = nullptr;
mQueuesCount = 0;
if (!mainQueue) {
mainQueue = new CTaskReserveArrayQueue(10000);
}
addTaskReserveArrayQueue(mainQueue);
}
CTaskReserveMultiArrayQueue* CTaskReserveMultiArrayQueue::addTaskReserveArrayQueue(CTaskReserveArrayQueue* queue) {
CXLinker<CTaskReserveArrayQueue*>* queueLinker = new CXLinker<CTaskReserveArrayQueue*>();
queueLinker->initLinker(queue);
mAddConsumerMutex.lock();
mQueueLinker = queueLinker->append(mQueueLinker);
++mQueuesCount;
mAddConsumerMutex.unlock();
return this;
}
bool CTaskReserveMultiArrayQueue::tryAddTasks(CTask*& tasks) {
bool taskAdded = mMainQueue->tryAddTasks(tasks);
return taskAdded;
}
cint64 CTaskReserveMultiArrayQueue::getTaskCount() {
cint64 taskCount = 0;
for (CXLinker<CTaskReserveArrayQueue*>* queueLinkerIt = mQueueLinker; queueLinkerIt; queueLinkerIt = queueLinkerIt->getNext()) {
CTaskReserveArrayQueue* queue = queueLinkerIt->getData();
taskCount += queue->getTaskCount();
}
return taskCount;
}
bool CTaskReserveMultiArrayQueue::tryGetTask(CTask*& task) {
for (CXLinker<CTaskReserveArrayQueue*>* queueLinkerIt = mQueueLinker; queueLinkerIt; queueLinkerIt = queueLinkerIt->getNext()) {
CTaskReserveArrayQueue* queue = queueLinkerIt->getData();
if (queue->tryGetTask(task)) {
return true;
}
}
return false;
}
CTaskReserveQueueConsumer* CTaskReserveMultiArrayQueue::createTaskReserveQueueConsumer() {
CTaskReserveMultiArrayQueueConsumer* consumer = new CTaskReserveMultiArrayQueueConsumer(this);
mAddConsumerMutex.lock();
mConsumerLinker = consumer->append(mConsumerLinker);
mAddConsumerMutex.unlock();
return consumer;
}
CXLinker<CTaskReserveArrayQueue*>* CTaskReserveMultiArrayQueue::getTaskReserveArrayQueueLinker() {
return mQueueLinker;
}
cint64 CTaskReserveMultiArrayQueue::getTaskReserveArrayQueueCount() {
return mQueuesCount;
}
}; // end namespace Scheduler
}; // end namespace Konclude
|
