Debian Codegraph @

Source/Scheduler/CDistributionMemoryPoolProvider.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 "CDistributionMemoryPoolProvider.h"
22
23
24 namespace Konclude {
25
26 namespace Scheduler {
27
28
29
30 CDistributionMemoryPoolProvider::CDistributionMemoryPoolProvider(CMemoryPoolProvider* alternateMemoryPoolProvider, CDistributionMemoryPoolReleaser* distributionMemoryReleaser) : CSortedLinkerBase<CDistributionMemoryPoolProvider*,CDistributionMemoryPoolProvider,CDistributionMemoryPoolProvider>(this,nullptr) {
31 mLastPickedDistributedPoolLinker = nullptr;
32 mDistributedPoolLinker = nullptr;
33 mAvailablePoolLinker = nullptr;
34 mAlternateMemoryPoolProvider = alternateMemoryPoolProvider;
35 mDistributionMemoryReleaser = distributionMemoryReleaser;
36
37 mDistributedPoolCount = 0;
38 mPickedPoolCount = 0;
39 mAvailablePoolCount = 0;
40 mAquiredPoolCount = 0;
41
42 mLastAcquiredPoolCount = 0;
43 mLastAcquiredPoolDiff = 0;
44
45 mLastSavedMissRatio = 0.;
46
47 mLastNewDiffRatio = 0.6;
48 }
49
50 CDistributionMemoryPoolProvider::~CDistributionMemoryPoolProvider() {
51 }
52
53
54 CDistributionMemoryPoolProvider* CDistributionMemoryPoolProvider::updateMissingMemoryPoolRatio() {
55 mLastSavedMissRatio = (double)getMemoryPoolSupplyCount()/(double)mLastAcquiredPoolCount;
56 return this;
57 }
58
59 double CDistributionMemoryPoolProvider::getMissingMemoryPoolRatio() {
60 return mLastSavedMissRatio;
61 }
62
63 cint64 CDistributionMemoryPoolProvider::getMissingMemoryPoolCount() {
64 return mLastAcquiredPoolDiff - getMemoryPoolSupplyCount();
65 }
66
67 cint64 CDistributionMemoryPoolProvider::getMemoryPoolSupplyCount() {
68 return mDistributedPoolCount-mPickedPoolCount+mAvailablePoolCount;
69 }
70
71 CDistributionMemoryPoolProvider* CDistributionMemoryPoolProvider::updatedRoundAcquiredMemoryPoolCounts() {
72 cint64 roundAcquiredPoolDiff = mAquiredPoolCount - mLastAcquiredPoolCount;
73 mLastAcquiredPoolCount = mAquiredPoolCount;
74 mLastAcquiredPoolDiff = roundAcquiredPoolDiff * (1. - mLastNewDiffRatio) + mLastAcquiredPoolDiff * mLastNewDiffRatio;
75 updateMissingMemoryPoolRatio();
76 return this;
77 }
78
79
80 CDistributionMemoryPoolProvider* CDistributionMemoryPoolProvider::appendDistributedMemoryPools(CMemoryPool* memoryPools) {
81 while (memoryPools) {
82 CMemoryPool* tmpMemoryPool = memoryPools;
83 memoryPools = memoryPools->getNext();
84
85 if (mDistributedPoolLinker != tmpMemoryPool) {
86 mDistributedPoolLinker = tmpMemoryPool->setNext(mDistributedPoolLinker);
87 } else {
88 // write access to mLastPickedDistributedPoolLinker is safe only in this case
89 mDistributedPoolLinker = tmpMemoryPool->clearNext();
90 mLastPickedDistributedPoolLinker = nullptr;
91 }
92 ++mDistributedPoolCount;
93 }
94 return this;
95 }
96
97
98 bool CDistributionMemoryPoolProvider::checkAppendableDistributedMemoryPools(CMemoryPool* memoryPools) {
99 CMemoryPool* memoryPoolIt = memoryPools;
100 while (memoryPoolIt) {
101 if (memoryPoolIt == mLastPickedDistributedPoolLinker) {
102 return false;
103 }
104 memoryPoolIt = memoryPoolIt->getNextMemoryPool();
105 }
106 return true;
107 }
108
109
110
111 bool CDistributionMemoryPoolProvider::pickDistributedMemoryPools() {
112 CMemoryPool* tmpMemoryPoolLinker = mDistributedPoolLinker;
113 if (tmpMemoryPoolLinker && mLastPickedDistributedPoolLinker != tmpMemoryPoolLinker) {
114 CMemoryPool* nextTmpMemoryPoolLinker = tmpMemoryPoolLinker;
115 while (nextTmpMemoryPoolLinker && mLastPickedDistributedPoolLinker != nextTmpMemoryPoolLinker) {
116 CMemoryPool* addTmpMemoryPoolLinker = nextTmpMemoryPoolLinker;
117 nextTmpMemoryPoolLinker = nextTmpMemoryPoolLinker->getNext();
118 mAvailablePoolLinker = addTmpMemoryPoolLinker->setNext(mAvailablePoolLinker);
119 ++mPickedPoolCount;
120 ++mAvailablePoolCount;
121 }
122 mLastPickedDistributedPoolLinker = tmpMemoryPoolLinker;
123 return true;
124 }
125 return false;
126 }
127
128
129 CMemoryPool* CDistributionMemoryPoolProvider::acquireMemoryPool(cint64 minPoolSize) {
130 CMemoryPool* tmpMemoryPool = nullptr;
131 ++mAquiredPoolCount;
132 pickDistributedMemoryPools();
133 if (mAvailablePoolLinker) {
134 if (mAvailablePoolLinker->getMemoryBlockSize() > minPoolSize) {
135 tmpMemoryPool = mAvailablePoolLinker;
136 mAvailablePoolLinker = mAvailablePoolLinker->getNext();
137 --mAvailablePoolCount;
138 }
139 }
140 if (!tmpMemoryPool) {
141 tmpMemoryPool = mAlternateMemoryPoolProvider->acquireMemoryPool(minPoolSize);
142 }
143 if (tmpMemoryPool) {
144 tmpMemoryPool->clearNext();
145 }
146 return tmpMemoryPool;
147 }
148
149 CDistributionMemoryPoolProvider* CDistributionMemoryPoolProvider::releaseMemoryPool(CMemoryPool* memoryPool) {
150 if (mDistributionMemoryReleaser) {
151 mDistributionMemoryReleaser->distributeMemoryPools(memoryPool);
152 } else {
153 mAlternateMemoryPoolProvider->releaseMemoryPool(memoryPool);
154 }
155 return this;
156 }
157
158
159 cint64 CDistributionMemoryPoolProvider::getAllocatedReleaseDifferencePoolCount() {
160 return 0;
161 }
162
163 cint64 CDistributionMemoryPoolProvider::getAllocatedReleaseDifferencePoolSize() {
164 return 0;
165 }
166
167
168
169 }; // end namespace Scheduler
170
171 }; // end namespace Konclude
172