Debian Codegraph @

Source/Reasoner/Answerer/COptimizedComplexVariableIndividualMappingsMultiHash.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 "COptimizedComplexVariableIndividualMappingsMultiHash.h"
22
23
24 namespace Konclude {
25
26 namespace Reasoner {
27
28 namespace Answerer {
29
30
31 COptimizedComplexVariableIndividualMappingsMultiHash::COptimizedComplexVariableIndividualMappingsMultiHash(cint64 bindingSize, cint64 multiHashPartsCount) : COptimizedComplexVariableIndividualMappings(bindingSize) {
32 mMultiHashPartsCount = multiHashPartsCount;
33 mMultiHashPartArray = new COptimizedComplexVariableIndividualMappingsMultiHashPart*[mMultiHashPartsCount];
34 for (cint64 i = 0; i < mMultiHashPartsCount; ++i) {
35 mMultiHashPartArray[i] = new COptimizedComplexVariableIndividualMappingsMultiHashPart(bindingSize);
36 }
37 mLastBindingCardinalityBatchLinkerUpdateId = 0;
38 mLastContextMemoryIntegratedSize = 0;
39 mContext = nullptr;
40 }
41
42
43 COptimizedComplexVariableIndividualMappingsMultiHash::~COptimizedComplexVariableIndividualMappingsMultiHash() {
44 for (cint64 i = 0; i < mMultiHashPartsCount; ++i) {
45 delete mMultiHashPartArray[i];
46 }
47 delete [] mMultiHashPartArray;
48
49 if (mContext) {
50 CMemoryPool* memPools = mContext->getMemoryPools();
51 CMemoryPool* memPoolsIt = memPools;
52 while (memPoolsIt) {
53 CMemoryPool* tmpMemPool = memPoolsIt;
54 memPoolsIt = memPoolsIt->getNext();
55 delete[] tmpMemPool->getMemoryBlockData();
56 delete tmpMemPool;
57 }
58 delete mContext;
59 mContext = nullptr;
60 }
61 }
62
63
64 COptimizedComplexVariableIndividualMappingsMultiHashPart* COptimizedComplexVariableIndividualMappingsMultiHash::getMultiHashPart(cint64 index) {
65 if (index >= 0 && index <= mMultiHashPartsCount) {
66 return mMultiHashPartArray[index];
67 } else {
68 return nullptr;
69 }
70 }
71
72 cint64 COptimizedComplexVariableIndividualMappingsMultiHash::getMultiHashPartsCount() {
73 return mMultiHashPartsCount;
74 }
75
76
77 COptimizedComplexVariableIndividualMappingsMultiHash* COptimizedComplexVariableIndividualMappingsMultiHash::updateLinkers(COptimizedComplexVariableIndividualMappingsMultiHashPart* multiPart) {
78 COptimizedComplexVariableIndividualBindingsCardinalityLinker* lastAddedBindingsCardinalityLinker = multiPart->getLastBindingsCardinalityLinker();
79 COptimizedComplexVariableIndividualBindingsCardinalityLinker* firstAddedBindingsCardinalityLinker = multiPart->getFirstBindingsCardinalityLinker();
80
81 COptimizedComplexVariableIndividualUpdateCardinalityLinker* lastUpdateCardinalityLinker = multiPart->getLastUpdateCardinalityLinker();
82 COptimizedComplexVariableIndividualUpdateCardinalityLinker* firstUpdateCardinalityLinker = multiPart->getFirstUpdateCardinalityLinker();
83
84
85 COptimizedComplexVariableIndividualBindingsCardinalityBatchLinker* lastAddedBindingsCardinalityBatchLinker = multiPart->getLastAddedBindingsCardinalityBatchLinker();
86 COptimizedComplexVariableIndividualBindingsCardinalityBatchLinker* firstAddedBindingsCardinalityBatchLinker = multiPart->getFirstAddedBindingsCardinalityBatchLinker();
87
88
89
90
91 if (firstAddedBindingsCardinalityBatchLinker && lastAddedBindingsCardinalityBatchLinker) {
92
93
94 if (mLastAddedBindingsCardinalityBatchLinker && mLastAddedBindingsCardinalityBatchLinker->getStartBindingsCardinalityLinker() == mLastAddedBindingsCardinalityLinker
95 && mLastAddedBindingsCardinalityBatchLinker->getLinkerCount() + firstAddedBindingsCardinalityBatchLinker->getLinkerCount() < 100 && mLastBindingCardinalityBatchLinkerUpdateId == mCurrentUpdateId) {
96
97 mLastAddedBindingsCardinalityBatchLinker->addStartBindingsCardLinker(firstAddedBindingsCardinalityBatchLinker->getStartBindingsCardinalityLinker(), firstAddedBindingsCardinalityBatchLinker->getLinkerCount());
98
99 if (firstAddedBindingsCardinalityBatchLinker == lastAddedBindingsCardinalityBatchLinker) {
100 firstAddedBindingsCardinalityBatchLinker = nullptr;
101 } else {
102 firstAddedBindingsCardinalityBatchLinker = firstAddedBindingsCardinalityBatchLinker->getNext();
103 }
104 }
105
106
107 if (firstAddedBindingsCardinalityBatchLinker) {
108 if (!mFirstAddedBindingsCardinalityBatchLinker) {
109 mFirstAddedBindingsCardinalityBatchLinker = firstAddedBindingsCardinalityBatchLinker;
110 } else {
111 mLastAddedBindingsCardinalityBatchLinker->setNext(firstAddedBindingsCardinalityBatchLinker);
112 }
113 mLastAddedBindingsCardinalityBatchLinker = lastAddedBindingsCardinalityBatchLinker;
114 mLastBindingCardinalityBatchLinkerUpdateId = mCurrentUpdateId;
115 }
116 multiPart->clearBindingsCardinalityBatchLinker();
117 }
118
119 if (firstAddedBindingsCardinalityLinker && lastAddedBindingsCardinalityLinker) {
120 firstAddedBindingsCardinalityLinker->append(mLastAddedBindingsCardinalityLinker);
121 mLastAddedBindingsCardinalityLinker = lastAddedBindingsCardinalityLinker;
122 multiPart->clearBindingsCardinalityLinkers();
123 }
124
125 if (firstUpdateCardinalityLinker && lastUpdateCardinalityLinker) {
126 firstUpdateCardinalityLinker->append(mLastUpdateCardinalityLinker);
127 mLastUpdateCardinalityLinker = lastUpdateCardinalityLinker;
128 multiPart->clearUpdateCardinalityLinkers();
129 }
130
131 return this;
132 }
133
134 COptimizedComplexVariableIndividualMappingsMultiHash* COptimizedComplexVariableIndividualMappingsMultiHash::updateBindingCount(COptimizedComplexVariableIndividualMappingsMultiHashPart* multiPart) {
135 mBindingCount -= multiPart->getLastUpdatedBindingCount(true);
136 mBindingCount += multiPart->getBindingCount();
137
138 mBindingsMemoryUsage -= multiPart->getLastMemoryUsageSize(true);
139 mBindingsMemoryUsage += multiPart->getMemorySize();
140
141
142 mMaximumCardinalitySameIndividualsJointlyConsidered = qMax(mMaximumCardinalitySameIndividualsJointlyConsidered, multiPart->getMaximumCardinalitySameIndividualsJointlyConsidered());
143 mMaximumCardinalitySameIndividualsSeparatelyConsidered = qMax(mMaximumCardinalitySameIndividualsSeparatelyConsidered, multiPart->getMaximumCardinalitySameIndividualsSeparatelyConsidered());
144
145 return this;
146 }
147
148
149 COptimizedComplexVariableIndividualMappingsMultiHash* COptimizedComplexVariableIndividualMappingsMultiHash::resetBindingCount() {
150 mBindingCount = 0;
151 return this;
152 }
153
154
155
156 bool COptimizedComplexVariableIndividualMappingsMultiHash::addInsertingBindingsCardinalityLinker(COptimizedComplexVariableIndividualBindingsCardinalityLinker* linker, bool addCardinalitiesIfAlreadyPresent) {
157 COptimizedComplexVariableIndividualBindingsHasher hasher(linker);
158 cint64 partIndex = hasher.getHashValue() % mMultiHashPartsCount;
159 COptimizedComplexVariableIndividualMappingsMultiHashPart* partHasher = mMultiHashPartArray[partIndex];
160
161 bool addedLinker = partHasher->addInsertingBindingsCardinalityLinkerCopy(linker, addCardinalitiesIfAlreadyPresent);
162 if (addedLinker) {
163 mBindingCount++;
164 }
165
166 updateLinkers(partHasher);
167 return addedLinker;
168 }
169
170
171 bool COptimizedComplexVariableIndividualMappingsMultiHash::addBindingsCardinalities(COptimizedComplexVariableIndividualBindings* bindings, COptimizedComplexVariableIndividualBindingsCardinality* addedCardinalites) {
172 COptimizedComplexVariableIndividualBindingsCardinalityLinker tmpLinker(bindings, addedCardinalites);
173 COptimizedComplexVariableIndividualBindingsHasher hasher(&tmpLinker);
174 cint64 partIndex = hasher.getHashValue() % mMultiHashPartsCount;
175 COptimizedComplexVariableIndividualMappingsMultiHashPart* partHasher = mMultiHashPartArray[partIndex];
176
177 bool addedLinker = partHasher->addBindingsCardinalitiesCopy(bindings, addedCardinalites);
178 if (addedLinker) {
179 mBindingCount++;
180 }
181
182 updateLinkers(partHasher);
183 return addedLinker;
184 }
185
186
187
188 COptimizedComplexVariableIndividualBindingsCardinalityLinker* COptimizedComplexVariableIndividualMappingsMultiHash::takeBindingsCardinalityLinker() {
189 COptimizedComplexVariableIndividualBindingsCardinalityLinker* linker = mLastAddedBindingsCardinalityLinker;
190 if (mLastAddedBindingsCardinalityLinker) {
191 mLastAddedBindingsCardinalityLinker = mLastAddedBindingsCardinalityLinker->getNext();
192 }
193 if (linker) {
194 COptimizedComplexVariableIndividualBindingsHasher hasher(linker);
195 cint64 partIndex = hasher.getHashValue() % mMultiHashPartsCount;
196 COptimizedComplexVariableIndividualMappingsMultiHashPart* partHasher = mMultiHashPartArray[partIndex];
197
198 partHasher->removeBindingsCardinalityLinker(linker);
199 mBindingCount--;
200 linker->clearNext();
201 }
202 return linker;
203 }
204
205
206 COptimizedComplexVariableIndividualMappings* COptimizedComplexVariableIndividualMappingsMultiHash::incCurrentUpdateId(cint64 incUpdateCount) {
207 COptimizedComplexVariableIndividualMappings::incCurrentUpdateId(incUpdateCount);
208 for (cint64 i = 0; i < mMultiHashPartsCount; ++i) {
209 mMultiHashPartArray[i]->setCurrentUpdateId(mCurrentUpdateId);
210 }
211 return this;
212 }
213
214
215
216 CMemoryAllocationManager* COptimizedComplexVariableIndividualMappingsMultiHash::getBindingsMemoryAllocationManager() {
217 if (!mContext) {
218 mContext = new CMemoryPoolNewAllocationIncreasingContext(500, 500000, 2);
219 }
220 return mContext->getMemoryAllocationManager();
221 }
222
223
224
225 COptimizedComplexVariableIndividualMappings* COptimizedComplexVariableIndividualMappingsMultiHash::updateBindingsMemoryConsumption() {
226 if (mContext) {
227 cint64 newContextMemoryIntegratedSize = mContext->getMemorySize();
228 if (newContextMemoryIntegratedSize != mLastContextMemoryIntegratedSize) {
229 mBindingsMemoryUsage -= mLastContextMemoryIntegratedSize;
230 mBindingsMemoryUsage += newContextMemoryIntegratedSize;
231 mLastContextMemoryIntegratedSize = newContextMemoryIntegratedSize;
232 }
233 }
234 return this;
235 }
236
237
238
239 COptimizedComplexVariableIndividualMappings* COptimizedComplexVariableIndividualMappingsMultiHash::clearComputedMappings() {
240 if (mContext) {
241 CMemoryPool* memPools = mContext->getMemoryPools();
242 CMemoryPool* memPoolsIt = memPools;
243 while (memPoolsIt) {
244 CMemoryPool* tmpMemPool = memPoolsIt;
245 memPoolsIt = memPoolsIt->getNext();
246 delete[] tmpMemPool->getMemoryBlockData();
247 delete tmpMemPool;
248 }
249 delete mContext;
250 mContext = nullptr;
251 }
252
253 for (cint64 i = 0; i < mMultiHashPartsCount; ++i) {
254 COptimizedComplexVariableIndividualMappingsMultiHashPart*& multiHashPart = mMultiHashPartArray[i];
255 CMemoryPool* memPools = multiHashPart->getMemoryPools();
256 CMemoryPool* memPoolsIt = memPools;
257 while (memPoolsIt) {
258 CMemoryPool* tmpMemPool = memPoolsIt;
259 memPoolsIt = memPoolsIt->getNext();
260 delete[] tmpMemPool->getMemoryBlockData();
261 delete tmpMemPool;
262 }
263 delete multiHashPart;
264 multiHashPart = nullptr;
265 }
266
267 for (cint64 i = 0; i < mMultiHashPartsCount; ++i) {
268 mMultiHashPartArray[i] = new COptimizedComplexVariableIndividualMappingsMultiHashPart(mBindingSize);
269 }
270 return COptimizedComplexVariableIndividualMappings::clearComputedMappings();
271 }
272
273
274 }; // end namespace Answerer
275
276 }; // end namespace Reasoner
277
278 }; // end namespace Konclude