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
|
/*
* 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 "CMemoryAccessThread.h"
namespace Konclude {
namespace Test {
CMemoryAccessThread::CMemoryAccessThread(cint64 readWriteRatio, int* accessArray, cint64 arraySize, bool atomicOperations, cint64 minWriteIndex, cint64 maxWriteIndex, CMemoryPoolProvider* memoryPoolProvider) {
mModificationSteps = 0;
mContextBase = 0;
mMemoryPoolAllocationMan = 0;
mCanceled = false;
mMemoryAccessArray = accessArray;
mReadWriteRatio = readWriteRatio;
mArraySize = arraySize;
mMemoryPoolProvider = memoryPoolProvider;
mMemoryPoolAllocationMan = new CMemoryPoolAllocationManager(mMemoryPoolProvider);
mContextBase = new CContextBase(mMemoryPoolAllocationMan);
mAtomicIncrements = atomicOperations;
mLocalWriteStep = 3;
mLocalWrite = true;
mMinWriteIndex = minWriteIndex;
mMaxWriteIndex = maxWriteIndex;
mLocalWriteIndex = mMinWriteIndex;
}
CMemoryAccessThread::~CMemoryAccessThread() {
quit();
wait();
delete mContextBase;
delete mMemoryPoolAllocationMan;
}
void CMemoryAccessThread::startModifications() {
start();
moveToThread(this);
}
void CMemoryAccessThread::stopModifications() {
mCanceled = true;
}
cint64 CMemoryAccessThread::getModificationStepsCount() {
return mModificationSteps;
}
void CMemoryAccessThread::run() {
while (!mCanceled) {
int newValue = 0;
for (cint64 i = 0; i < mReadWriteRatio; ++i) {
qint64 arrayIndex = qrand() % mArraySize;
int arrayValue = mMemoryAccessArray[arrayIndex];
newValue += arrayValue;
}
qint64 arrayIndex = 0;
if (!mLocalWrite) {
arrayIndex = qrand() % (mArraySize-100);
} else {
mLocalWriteIndex += mLocalWriteStep;
if (mLocalWriteIndex >= mMaxWriteIndex) {
mLocalWriteIndex = mMinWriteIndex;
}
arrayIndex = mLocalWriteIndex;
}
if (mAtomicIncrements) {
QAtomicInt* atomicInt = (QAtomicInt*)&(mMemoryAccessArray[arrayIndex]);
atomicInt->fetchAndAddOrdered(newValue);
} else {
mMemoryAccessArray[arrayIndex] += newValue;
}
++mModificationSteps;
}
}
}; // end namespace Test
}; // end namespace Konclude
|
