Debian Codegraph @

Source/Scheduler/CTaskReserveArrayQueue.cpp

raw
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 "CTaskReserveArrayQueue.h"
22
23
24 namespace Konclude {
25
26 namespace Scheduler {
27
28
29
30 CTaskReserveArrayQueue::CTaskReserveArrayQueue(cint64 vectorSize) : mTaskVector(vectorSize) {
31 mVectorSize = vectorSize;
32
33 for (cint64 i = 0; i < mVectorSize; ++i) {
34 cint64 ind1 = getIndex(i);
35 cint64 ind2 = getIndex(i+1);
36
37 CTaskReserveArrayQueueItem* item1 = &mTaskVector[ind1];
38 CTaskReserveArrayQueueItem* item2 = &mTaskVector[ind2];
39
40 item1->setNext(item2);
41 }
42
43 mNextItem = 0;
44 mLastItem = 0;
45
46 mConsumerLinker = nullptr;
47 }
48
49
50 bool CTaskReserveArrayQueue::tryAddTasks(CTask*& tasks) {
51 bool taskAdded = false;
52 bool canAddMoreTasks = true;
53 while (tasks && canAddMoreTasks) {
54 if (mLastItem - mNextItem < mVectorSize) {
55 CTask* tmpTask = tasks;
56 tasks = tasks->getNext();
57 tmpTask->clearNext();
58
59 CTaskReserveArrayQueueItem* item = &mTaskVector[getIndex(mLastItem)];
60 if (!item->trySetTask(tmpTask)) {
61 tasks = tmpTask->append(tasks);
62 } else {
63 taskAdded = true;
64 }
65 ++mLastItem;
66 } else {
67 canAddMoreTasks = false;
68 }
69 }
70 return taskAdded;
71 }
72
73
74 cint64 CTaskReserveArrayQueue::getTaskCount() {
75 return mLastItem - mNextItem;
76 }
77
78
79 bool CTaskReserveArrayQueue::tryGetTask(CTask*& task) {
80 task = nullptr;
81 cint64 nextItem = mNextItem;
82 if (nextItem == mLastItem) {
83 return false;
84 }
85 cint64 index = getIndex(nextItem++);
86 CTaskReserveArrayQueueItem* item = &mTaskVector[index];
87 task = item->tryGetTask();
88 mNextItem = nextItem;
89 return task != nullptr;
90 }
91
92
93 CTaskReserveQueueConsumer* CTaskReserveArrayQueue::createTaskReserveQueueConsumer() {
94 CTaskReserveArrayQueueConsumer* consumer = new CTaskReserveArrayQueueConsumer(this);
95 mAddConsumerMutex.lock();
96 mConsumerLinker = consumer->append(mConsumerLinker);
97 mAddConsumerMutex.unlock();
98 return consumer;
99 }
100
101
102 }; // end namespace Scheduler
103
104 }; // end namespace Konclude