| 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 "CConcreteMemoryPoolDistributor.h" |
| 22 |
|
| 23 |
|
| 24 |
namespace Konclude { |
| 25 |
|
| 26 |
namespace Scheduler { |
| 27 |
|
| 28 |
|
| 29 |
|
| 30 |
CConcreteMemoryPoolDistributor::CConcreteMemoryPoolDistributor(CMemoryPoolProvider* alternateMemoryPoolProvider) { |
| 31 |
mAlternateMemoryPoolProvider = alternateMemoryPoolProvider; |
| 32 |
mDeleteAlternateMemoryPoolProvider = nullptr; |
| 33 |
if (!mAlternateMemoryPoolProvider) { |
| 34 |
mDeleteAlternateMemoryPoolProvider = new CNewAllocationMemoryPoolProvider(); |
| 35 |
mAlternateMemoryPoolProvider = mDeleteAlternateMemoryPoolProvider; |
| 36 |
} |
| 37 |
mProviderLinker = nullptr; |
| 38 |
mAddedProviderLinker = nullptr; |
| 39 |
mLastAddedProviderLinker = nullptr; |
| 40 |
mTmpStoredMemoryPools = nullptr; |
| 41 |
} |
| 42 |
|
| 43 |
CConcreteMemoryPoolDistributor::~CConcreteMemoryPoolDistributor() { |
| 44 |
delete mDeleteAlternateMemoryPoolProvider; |
| 45 |
} |
| 46 |
|
| 47 |
|
| 48 |
CDistributionMemoryPoolProvider* CConcreteMemoryPoolDistributor::createDistributionMemoryPoolProvider(CDistributionMemoryPoolReleaser* distributionMemoryReleaser) { |
| 49 |
CDistributionMemoryPoolProvider* provider = nullptr; |
| 50 |
mCreateProviderSyncLock.lock(); |
| 51 |
provider = new CDistributionMemoryPoolProvider(mAlternateMemoryPoolProvider,distributionMemoryReleaser); |
| 52 |
mAddedProviderLinker = provider->setNext(mAddedProviderLinker); |
| 53 |
mCreateProviderSyncLock.unlock(); |
| 54 |
return provider; |
| 55 |
} |
| 56 |
|
| 57 |
|
| 58 |
CConcreteMemoryPoolDistributor* CConcreteMemoryPoolDistributor::distributeMemoryPools(CMemoryPool* memoryPools) { |
| 59 |
CDistributionMemoryPoolProvider* tmpProvLinker = mAddedProviderLinker; |
| 60 |
CDistributionMemoryPoolProvider* nextLastAddedProvLinker = tmpProvLinker; |
| 61 |
while (tmpProvLinker && tmpProvLinker != mLastAddedProviderLinker) { |
| 62 |
CDistributionMemoryPoolProvider* tmpTakeProvLinker = tmpProvLinker; |
| 63 |
tmpProvLinker = tmpProvLinker->getNext(); |
| 64 |
|
| 65 |
mProviderLinker = tmpTakeProvLinker->setNext(mProviderLinker); |
| 66 |
} |
| 67 |
mLastAddedProviderLinker = nextLastAddedProvLinker; |
| 68 |
|
| 69 |
tmpProvLinker = mProviderLinker; |
| 70 |
while (tmpProvLinker) { |
| 71 |
tmpProvLinker->updatedRoundAcquiredMemoryPoolCounts(); |
| 72 |
tmpProvLinker = tmpProvLinker->getNext(); |
| 73 |
} |
| 74 |
|
| 75 |
CDistributionMemoryPoolProvider* sortedProviderLinker = nullptr; |
| 76 |
|
| 77 |
tmpProvLinker = mProviderLinker; |
| 78 |
while (tmpProvLinker) { |
| 79 |
CDistributionMemoryPoolProvider* tmpSortProvLinker = tmpProvLinker; |
| 80 |
tmpProvLinker = tmpProvLinker->getNext(); |
| 81 |
|
| 82 |
tmpSortProvLinker->clearNext(); |
| 83 |
if (sortedProviderLinker) { |
| 84 |
sortedProviderLinker = sortedProviderLinker->insertNextSorted(tmpSortProvLinker); |
| 85 |
} else { |
| 86 |
sortedProviderLinker = tmpSortProvLinker; |
| 87 |
} |
| 88 |
} |
| 89 |
|
| 90 |
if (mTmpStoredMemoryPools) { |
| 91 |
memoryPools = mTmpStoredMemoryPools->getLastListLink()->setNextMemoryPool(memoryPools); |
| 92 |
mTmpStoredMemoryPools = nullptr; |
| 93 |
} |
| 94 |
|
| 95 |
while (memoryPools) { |
| 96 |
CMemoryPool* tmpMemoryPool = memoryPools; |
| 97 |
memoryPools = memoryPools->getNext(); |
| 98 |
tmpMemoryPool->clearNext(); |
| 99 |
|
| 100 |
if (sortedProviderLinker->checkAppendableDistributedMemoryPools(tmpMemoryPool)) { |
| 101 |
sortedProviderLinker->appendDistributedMemoryPools(tmpMemoryPool); |
| 102 |
sortedProviderLinker->updateMissingMemoryPoolRatio(); |
| 103 |
|
| 104 |
// update sorted list |
| 105 |
CDistributionMemoryPoolProvider* nextSortedProviderLinker = sortedProviderLinker->getNext(); |
| 106 |
if (nextSortedProviderLinker && sortedProviderLinker->getMissingMemoryPoolRatio() > nextSortedProviderLinker->getMissingMemoryPoolRatio()) { |
| 107 |
sortedProviderLinker->clearNext(); |
| 108 |
sortedProviderLinker = nextSortedProviderLinker->insertNextSorted(sortedProviderLinker); |
| 109 |
} |
| 110 |
} else { |
| 111 |
mTmpStoredMemoryPools = tmpMemoryPool->setNextMemoryPool(mTmpStoredMemoryPools); |
| 112 |
} |
| 113 |
} |
| 114 |
mProviderLinker = sortedProviderLinker; |
| 115 |
return this; |
| 116 |
} |
| 117 |
|
| 118 |
|
| 119 |
|
| 120 |
}; // end namespace Scheduler |
| 121 |
|
| 122 |
}; // end namespace Konclude |
| 123 |
|