| 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 "CIndividualDelayedBackendInitializationProcessingQueue.h" |
| 22 |
|
| 23 |
|
| 24 |
namespace Konclude { |
| 25 |
|
| 26 |
namespace Reasoner { |
| 27 |
|
| 28 |
namespace Kernel { |
| 29 |
|
| 30 |
namespace Process { |
| 31 |
|
| 32 |
|
| 33 |
CIndividualDelayedBackendInitializationProcessingQueue::CIndividualDelayedBackendInitializationProcessingQueue(CProcessContext* processContext) |
| 34 |
: mProcessContext(processContext) { |
| 35 |
|
| 36 |
mMemMan = mProcessContext->getMemoryAllocationManager(); |
| 37 |
mIndiProDesCount = 0; |
| 38 |
mQueuedIndiNodeLinker = nullptr; |
| 39 |
mLastTakenIndiNodeQueuingLinker = nullptr; |
| 40 |
mIndiNodeQueuingLinkerPointer = nullptr; |
| 41 |
mRootQueue = this; |
| 42 |
} |
| 43 |
|
| 44 |
|
| 45 |
CIndividualDelayedBackendInitializationProcessingQueue* CIndividualDelayedBackendInitializationProcessingQueue::initProcessingQueue(CIndividualDelayedBackendInitializationProcessingQueue* processingQueue) { |
| 46 |
if (processingQueue) { |
| 47 |
mIndiProDesCount = processingQueue->mIndiProDesCount; |
| 48 |
mQueuedIndiNodeLinker = processingQueue->mQueuedIndiNodeLinker; |
| 49 |
mLastTakenIndiNodeQueuingLinker = processingQueue->mLastTakenIndiNodeQueuingLinker; |
| 50 |
mIndiNodeQueuingLinkerPointer = processingQueue->mIndiNodeQueuingLinkerPointer; |
| 51 |
mRootQueue = processingQueue->mRootQueue; |
| 52 |
} else { |
| 53 |
mQueuedIndiNodeLinker = nullptr; |
| 54 |
mIndiProDesCount = 0; |
| 55 |
mLastTakenIndiNodeQueuingLinker = nullptr; |
| 56 |
mIndiNodeQueuingLinkerPointer = nullptr; |
| 57 |
mRootQueue = this; |
| 58 |
} |
| 59 |
|
| 60 |
if (!mIndiNodeQueuingLinkerPointer) { |
| 61 |
mIndiNodeQueuingLinkerPointer = CObjectAllocator< QAtomicPointer<CIndividualRepresentativeBackendCacheConceptSetLabelNodeQueuingLinker> >::allocateAndConstruct(mMemMan); |
| 62 |
mLastIndiNodeQueuingLinker = CObjectAllocator< CIndividualRepresentativeBackendCacheConceptSetLabelNodeQueuingLinker >::allocateAndConstruct(mMemMan); |
| 63 |
mLastTakenIndiNodeQueuingLinker = mLastIndiNodeQueuingLinker; |
| 64 |
mIndiNodeQueuingLinkerPointer->store(mLastIndiNodeQueuingLinker); |
| 65 |
} |
| 66 |
|
| 67 |
return this; |
| 68 |
} |
| 69 |
|
| 70 |
CXLinker<CIndividualProcessNode*>* CIndividualDelayedBackendInitializationProcessingQueue::getProcessIndividualNodeLinker() { |
| 71 |
moveIndividualNodeLinkersToLocalQueue(); |
| 72 |
return mQueuedIndiNodeLinker; |
| 73 |
} |
| 74 |
|
| 75 |
CIndividualProcessNode* CIndividualDelayedBackendInitializationProcessingQueue::takeNextProcessIndividualNode() { |
| 76 |
moveIndividualNodeLinkersToLocalQueue(); |
| 77 |
CIndividualProcessNode* nextIndiNode = nullptr; |
| 78 |
if (mQueuedIndiNodeLinker) { |
| 79 |
--mIndiProDesCount; |
| 80 |
nextIndiNode = mQueuedIndiNodeLinker->getData(); |
| 81 |
mQueuedIndiNodeLinker = mQueuedIndiNodeLinker->getNext(); |
| 82 |
} |
| 83 |
return nextIndiNode; |
| 84 |
} |
| 85 |
|
| 86 |
CIndividualProcessNode* CIndividualDelayedBackendInitializationProcessingQueue::getNextProcessIndividualNode() { |
| 87 |
moveIndividualNodeLinkersToLocalQueue(); |
| 88 |
CIndividualProcessNode* nextIndiNode = nullptr; |
| 89 |
if (mQueuedIndiNodeLinker) { |
| 90 |
nextIndiNode = mQueuedIndiNodeLinker->getData(); |
| 91 |
} |
| 92 |
return nextIndiNode; |
| 93 |
} |
| 94 |
|
| 95 |
|
| 96 |
bool CIndividualDelayedBackendInitializationProcessingQueue::moveIndividualNodeLinkersToLocalQueue() { |
| 97 |
if (mIndiNodeQueuingLinkerPointer && mLastTakenIndiNodeQueuingLinker != *mIndiNodeQueuingLinkerPointer) { |
| 98 |
for (CIndividualRepresentativeBackendCacheConceptSetLabelNodeQueuingLinker* lastTakenIndiNodeLinkerIt = *mIndiNodeQueuingLinkerPointer; lastTakenIndiNodeLinkerIt && lastTakenIndiNodeLinkerIt != mLastTakenIndiNodeQueuingLinker; lastTakenIndiNodeLinkerIt = *lastTakenIndiNodeLinkerIt->getNextIndividualNodeQueuingLinkerPointer()) { |
| 99 |
CIndividualProcessNode* indiNode = lastTakenIndiNodeLinkerIt->getIndividualProcessNode(); |
| 100 |
insertIndiviudalProcessNode(indiNode); |
| 101 |
} |
| 102 |
mLastTakenIndiNodeQueuingLinker = *mIndiNodeQueuingLinkerPointer; |
| 103 |
return true; |
| 104 |
} |
| 105 |
return false; |
| 106 |
} |
| 107 |
|
| 108 |
|
| 109 |
|
| 110 |
bool CIndividualDelayedBackendInitializationProcessingQueue::addIndividualNodeQueuingLinker(CIndividualRepresentativeBackendCacheConceptSetLabelNodeQueuingLinker* indiNodeQueuingLinker) { |
| 111 |
//insertIndiviudalProcessNode(indiNodeQueuingLinker->getIndividualProcessNode()); |
| 112 |
//return true; |
| 113 |
moveIndividualNodeLinkersToLocalQueue(); |
| 114 |
CIndividualRepresentativeBackendCacheConceptSetLabelNodeQueuingLinker* lastIndiNodeLinker = *mIndiNodeQueuingLinkerPointer; |
| 115 |
|
| 116 |
QAtomicPointer<CIndividualRepresentativeBackendCacheConceptSetLabelNodeQueuingLinker>* nextLinkerPointer = indiNodeQueuingLinker->getNextIndividualNodeQueuingLinkerPointer(); |
| 117 |
|
| 118 |
if (nextLinkerPointer->testAndSetOrdered(nullptr, lastIndiNodeLinker)) { |
| 119 |
if (mIndiNodeQueuingLinkerPointer->testAndSetOrdered(lastIndiNodeLinker, indiNodeQueuingLinker)) { |
| 120 |
moveIndividualNodeLinkersToLocalQueue(); |
| 121 |
return true; |
| 122 |
} else { |
| 123 |
nextLinkerPointer->store(nullptr); |
| 124 |
return false; |
| 125 |
} |
| 126 |
} else { |
| 127 |
return false; |
| 128 |
} |
| 129 |
} |
| 130 |
|
| 131 |
|
| 132 |
CIndividualDelayedBackendInitializationProcessingQueue* CIndividualDelayedBackendInitializationProcessingQueue::insertIndiviudalProcessNode(CIndividualProcessNode* indiProNode) { |
| 133 |
CXLinker<CIndividualProcessNode*>* newIndiNodeLinker = CObjectAllocator< CXLinker<CIndividualProcessNode*> >::allocateAndConstruct(mMemMan); |
| 134 |
mQueuedIndiNodeLinker = newIndiNodeLinker->initLinker(indiProNode,mQueuedIndiNodeLinker); |
| 135 |
++mIndiProDesCount; |
| 136 |
return this; |
| 137 |
} |
| 138 |
|
| 139 |
bool CIndividualDelayedBackendInitializationProcessingQueue::isEmpty() { |
| 140 |
moveIndividualNodeLinkersToLocalQueue(); |
| 141 |
return mQueuedIndiNodeLinker == nullptr; |
| 142 |
} |
| 143 |
|
| 144 |
bool CIndividualDelayedBackendInitializationProcessingQueue::isRoot() { |
| 145 |
return mRootQueue == this; |
| 146 |
} |
| 147 |
|
| 148 |
|
| 149 |
|
| 150 |
|
| 151 |
|
| 152 |
}; // end namespace Process |
| 153 |
|
| 154 |
}; // end namespace Kernel |
| 155 |
|
| 156 |
}; // end namespace Reasoner |
| 157 |
|
| 158 |
}; // end namespace Konclude |