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
|
/*
* 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 "CConcurrentMemoryAccessTester.h"
namespace Konclude {
namespace Test {
CConcurrentMemoryAccessTester::CConcurrentMemoryAccessTester() {
}
CConcurrentMemoryAccessTester::~CConcurrentMemoryAccessTester() {
}
void CConcurrentMemoryAccessTester::generateTestingStructure(cint64 arraySize, cint64 readWriteRatio, bool atomicOperations, cint64 threadCount) {
mArraySize = arraySize;
mReadWriteRatio = readWriteRatio;
mThreadCount = threadCount;
mAtomicOperations = atomicOperations;
mMemoryPoolProvider = new CNewAllocationMemoryPoolProvider(1024*10-20 /*~ 10 KByte*/);
mMemoryArray = new int[mArraySize];
mSharedWrite = false;
cint64 threadSize = arraySize / mThreadCount;
cint64 nextStart = 0;
if (mSharedWrite) {
threadSize = mThreadCount;
}
for (qint64 i = 0; i < mThreadCount; ++i) {
CMemoryAccessThread *modThread = 0;
modThread = new CMemoryAccessThread(mReadWriteRatio,mMemoryArray,mArraySize,mAtomicOperations,nextStart,nextStart+threadSize,mMemoryPoolProvider);
if (!mSharedWrite) {
nextStart += threadSize;
}
mModThreadList.append(modThread);
}
}
void CConcurrentMemoryAccessTester::startHashModificationTest() {
cForeach (CMemoryAccessThread* modThread, mModThreadList) {
modThread->startModifications();
}
}
void CConcurrentMemoryAccessTester::stopHashModificationTest() {
cForeach (CMemoryAccessThread* modThread, mModThreadList) {
modThread->stopModifications();
}
cForeach (CMemoryAccessThread* modThread, mModThreadList) {
modThread->quit();
}
}
void CConcurrentMemoryAccessTester::destroyTestingStructure() {
cDeleteAll(mModThreadList);
delete mMemoryPoolProvider;
delete [] mMemoryArray;
mModThreadList.clear();
}
cint64 CConcurrentMemoryAccessTester::getModificationStepsCount() {
cint64 totalModStepsCount = 0;
cForeach (CMemoryAccessThread* modThread, mModThreadList) {
totalModStepsCount += modThread->getModificationStepsCount();
}
return totalModStepsCount;
}
}; // end namespace Test
}; // end namespace Konclude
|
