/*
* Copyright (C) 2013-2015, 2019 by the Konclude Developer Team.
*
* This file is part of the reasoning system Konclude.
* For details and support, see .
*
* 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 .
*
*/
#include "CHashModificationThread.h"
namespace Konclude {
namespace Test {
CHashModificationThread::CHashModificationThread(CQtHash** qtOriginalHashes, cint64 hashesCount, cint64 modificationCountPerStep, bool extendBaseHashes) {
mModificationSteps = 0;
mQtOriginalHashes = qtOriginalHashes;
mQtModifiedHashes = 0;
mMemoryPoolProvider = 0;
mUseModifiedHashes = false;
mHashesCount = hashesCount;
mContextBase = 0;
mMemoryPoolAllocationMan = 0;
mCanceled = false;
mModificationCountPerStep = modificationCountPerStep;
mExtendBaseHashes = extendBaseHashes;
}
CHashModificationThread::CHashModificationThread(CQtManagedRestrictedModificationHash** qtModifiedHashes, cint64 hashesCount, CMemoryPoolProvider* memoryPoolProvider, cint64 modificationCountPerStep, bool extendBaseHashes) {
mModificationSteps = 0;
mQtOriginalHashes = 0;
mQtModifiedHashes = qtModifiedHashes;
mMemoryPoolProvider = memoryPoolProvider;
mUseModifiedHashes = true;
mMemoryPoolAllocationMan = new CMemoryPoolAllocationManager(mMemoryPoolProvider);
mContextBase = new CContextBase(mMemoryPoolAllocationMan);
mHashesCount = hashesCount;
mCanceled = false;
mModificationCountPerStep = modificationCountPerStep;
mExtendBaseHashes = extendBaseHashes;
}
CHashModificationThread::~CHashModificationThread() {
quit();
wait();
delete mMemoryPoolAllocationMan;
delete mContextBase;
}
void CHashModificationThread::startModifications() {
start();
moveToThread(this);
}
void CHashModificationThread::stopModifications() {
mCanceled = true;
}
cint64 CHashModificationThread::getModificationStepsCount() {
return mModificationSteps;
}
void CHashModificationThread::run() {
qint64 modCountPerStep = mModificationCountPerStep;
qint64 maxCacheValue = 100;
while (!mCanceled) {
qint64 modHashIndex = qrand() % mHashesCount;
if (!mUseModifiedHashes) {
CQtHash *baseHash = mQtOriginalHashes[modHashIndex];
CQtHash *modHash = 0;
if (mExtendBaseHashes) {
modHash = new CQtHash(*baseHash);
} else {
modHash = new CQtHash();
}
for (cint64 i = 0; i < modCountPerStep; ++i) {
qint64 modHashKey = qrand() % maxCacheValue;
cint64 modHashValue = modHash->value(modHashKey,0);
modHash->insert(modHashKey,++modHashValue);
}
delete modHash;
++mModificationSteps;
} else {
CQtManagedRestrictedModificationHash *baseHash = mQtModifiedHashes[modHashIndex];
CQtManagedRestrictedModificationHash *modHash = CObjectAllocator >::allocateAndConstruct(mMemoryPoolAllocationMan);
if (mExtendBaseHashes) {
modHash->init(baseHash,mContextBase);
} else {
modHash->init(mContextBase);
}
for (cint64 i = 0; i < modCountPerStep; ++i) {
qint64 modHashKey = qrand() % maxCacheValue;
cint64 modHashValue = modHash->value(modHashKey,0);
modHash->insert(modHashKey,++modHashValue);
modHashValue = modHash->value(modHashKey,0);
}
mMemoryPoolAllocationMan->releaseAllMemory();
++mModificationSteps;
}
}
}
}; // end namespace Test
}; // end namespace Konclude