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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
|
/*
* 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 "CConcreteMemoryPoolDistributor.h"
namespace Konclude {
namespace Scheduler {
CConcreteMemoryPoolDistributor::CConcreteMemoryPoolDistributor(CMemoryPoolProvider* alternateMemoryPoolProvider) {
mAlternateMemoryPoolProvider = alternateMemoryPoolProvider;
mDeleteAlternateMemoryPoolProvider = nullptr;
if (!mAlternateMemoryPoolProvider) {
mDeleteAlternateMemoryPoolProvider = new CNewAllocationMemoryPoolProvider();
mAlternateMemoryPoolProvider = mDeleteAlternateMemoryPoolProvider;
}
mProviderLinker = nullptr;
mAddedProviderLinker = nullptr;
mLastAddedProviderLinker = nullptr;
mTmpStoredMemoryPools = nullptr;
}
CConcreteMemoryPoolDistributor::~CConcreteMemoryPoolDistributor() {
delete mDeleteAlternateMemoryPoolProvider;
}
CDistributionMemoryPoolProvider* CConcreteMemoryPoolDistributor::createDistributionMemoryPoolProvider(CDistributionMemoryPoolReleaser* distributionMemoryReleaser) {
CDistributionMemoryPoolProvider* provider = nullptr;
mCreateProviderSyncLock.lock();
provider = new CDistributionMemoryPoolProvider(mAlternateMemoryPoolProvider,distributionMemoryReleaser);
mAddedProviderLinker = provider->setNext(mAddedProviderLinker);
mCreateProviderSyncLock.unlock();
return provider;
}
CConcreteMemoryPoolDistributor* CConcreteMemoryPoolDistributor::distributeMemoryPools(CMemoryPool* memoryPools) {
CDistributionMemoryPoolProvider* tmpProvLinker = mAddedProviderLinker;
CDistributionMemoryPoolProvider* nextLastAddedProvLinker = tmpProvLinker;
while (tmpProvLinker && tmpProvLinker != mLastAddedProviderLinker) {
CDistributionMemoryPoolProvider* tmpTakeProvLinker = tmpProvLinker;
tmpProvLinker = tmpProvLinker->getNext();
mProviderLinker = tmpTakeProvLinker->setNext(mProviderLinker);
}
mLastAddedProviderLinker = nextLastAddedProvLinker;
tmpProvLinker = mProviderLinker;
while (tmpProvLinker) {
tmpProvLinker->updatedRoundAcquiredMemoryPoolCounts();
tmpProvLinker = tmpProvLinker->getNext();
}
CDistributionMemoryPoolProvider* sortedProviderLinker = nullptr;
tmpProvLinker = mProviderLinker;
while (tmpProvLinker) {
CDistributionMemoryPoolProvider* tmpSortProvLinker = tmpProvLinker;
tmpProvLinker = tmpProvLinker->getNext();
tmpSortProvLinker->clearNext();
if (sortedProviderLinker) {
sortedProviderLinker = sortedProviderLinker->insertNextSorted(tmpSortProvLinker);
} else {
sortedProviderLinker = tmpSortProvLinker;
}
}
if (mTmpStoredMemoryPools) {
memoryPools = mTmpStoredMemoryPools->getLastListLink()->setNextMemoryPool(memoryPools);
mTmpStoredMemoryPools = nullptr;
}
while (memoryPools) {
CMemoryPool* tmpMemoryPool = memoryPools;
memoryPools = memoryPools->getNext();
tmpMemoryPool->clearNext();
if (sortedProviderLinker->checkAppendableDistributedMemoryPools(tmpMemoryPool)) {
sortedProviderLinker->appendDistributedMemoryPools(tmpMemoryPool);
sortedProviderLinker->updateMissingMemoryPoolRatio();
// update sorted list
CDistributionMemoryPoolProvider* nextSortedProviderLinker = sortedProviderLinker->getNext();
if (nextSortedProviderLinker && sortedProviderLinker->getMissingMemoryPoolRatio() > nextSortedProviderLinker->getMissingMemoryPoolRatio()) {
sortedProviderLinker->clearNext();
sortedProviderLinker = nextSortedProviderLinker->insertNextSorted(sortedProviderLinker);
}
} else {
mTmpStoredMemoryPools = tmpMemoryPool->setNextMemoryPool(mTmpStoredMemoryPools);
}
}
mProviderLinker = sortedProviderLinker;
return this;
}
}; // end namespace Scheduler
}; // end namespace Konclude
|
