parent
1cf6f524ab
commit
51be7b9490
|
@ -33,6 +33,8 @@ SOURCES += \
|
|||
|
||||
HEADERS += \
|
||||
src/HashNode.h \
|
||||
src/MemoryPool.h \
|
||||
src/MemoryPool.tcc \
|
||||
src/boarditem.h \
|
||||
src/client.h \
|
||||
src/config.h \
|
||||
|
|
|
@ -436,6 +436,7 @@
|
|||
<ClInclude Include="src\graphicsconst.h" />
|
||||
<ClInclude Include="src\HashMap.h" />
|
||||
<ClInclude Include="src\HashNode.h" />
|
||||
<ClInclude Include="src\MemoryPool.h" />
|
||||
<ClInclude Include="src\ninechess.h" />
|
||||
<QtMoc Include="src\ninechesswindow.h">
|
||||
<IncludePath Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">.\GeneratedFiles\$(ConfigurationName);.\GeneratedFiles;.;D:\Qt\Qt5.11.0\5.11.0\msvc2017_64\include;debug;\include;D:\Qt\Qt5.11.0\5.11.0\msvc2017_64\mkspecs\win32-msvc;D:\Qt\Qt5.11.0\5.11.0\msvc2017_64\include\QtWidgets;D:\Qt\Qt5.11.0\5.11.0\msvc2017_64\include\QtCore;D:\Qt\Qt5.11.0\5.11.0\msvc2017_64\include\QtGui;D:\Qt\Qt5.11.0\5.11.0\msvc2017_64\include\QtANGLE;D:\Qt\Qt5.11.0\5.11.0\msvc2017_64\include\QtMultimedia;D:\Qt\Qt5.11.0\5.11.0\msvc2017_64\include\QtNetwork;%(AdditionalIncludeDirectories)</IncludePath>
|
||||
|
@ -563,6 +564,7 @@
|
|||
<None Include="Resources\image\background.png" />
|
||||
<None Include="Resources\image\black_piece.png" />
|
||||
<None Include="Resources\image\board.png" />
|
||||
<None Include="src\MemoryPool.tcc" />
|
||||
<QtRcc Include="ninechesswindow.qrc">
|
||||
</QtRcc>
|
||||
<None Include="Resources\image\white_piece.png" />
|
||||
|
|
|
@ -125,6 +125,9 @@
|
|||
<ClInclude Include="src\zobrist.h">
|
||||
<Filter>Model</Filter>
|
||||
</ClInclude>
|
||||
<ClInclude Include="src\MemoryPool.h">
|
||||
<Filter>Model</Filter>
|
||||
</ClInclude>
|
||||
</ItemGroup>
|
||||
<ItemGroup>
|
||||
<CustomBuild Include="debug\moc_predefs.h.cbt">
|
||||
|
@ -260,6 +263,9 @@
|
|||
<None Include="ninechess.pro">
|
||||
<Filter>Project Files</Filter>
|
||||
</None>
|
||||
<None Include="src\MemoryPool.tcc">
|
||||
<Filter>Model</Filter>
|
||||
</None>
|
||||
</ItemGroup>
|
||||
<ItemGroup>
|
||||
<Text Include="..\History.txt">
|
||||
|
|
|
@ -0,0 +1,98 @@
|
|||
/*-
|
||||
* Copyright (c) 2013 Cosku Acay, http://www.coskuacay.com
|
||||
*
|
||||
* Permission is hereby granted, free of charge, to any person obtaining a
|
||||
* copy of this software and associated documentation files (the "Software"),
|
||||
* to deal in the Software without restriction, including without limitation
|
||||
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
|
||||
* and/or sell copies of the Software, and to permit persons to whom the
|
||||
* Software is furnished to do so, subject to the following conditions:
|
||||
*
|
||||
* The above copyright notice and this permission notice shall be included in
|
||||
* all copies or substantial portions of the Software.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
||||
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
||||
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
||||
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
||||
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
||||
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
|
||||
* IN THE SOFTWARE.
|
||||
*/
|
||||
|
||||
#ifndef MEMORY_POOL_H
|
||||
#define MEMORY_POOL_H
|
||||
|
||||
#include <climits>
|
||||
#include <cstddef>
|
||||
|
||||
template <typename T, size_t BlockSize = 4096>
|
||||
class MemoryPool
|
||||
{
|
||||
public:
|
||||
/* Member types */
|
||||
typedef T value_type;
|
||||
typedef T* pointer;
|
||||
typedef T& reference;
|
||||
typedef const T* const_pointer;
|
||||
typedef const T& const_reference;
|
||||
typedef size_t size_type;
|
||||
typedef ptrdiff_t difference_type;
|
||||
typedef std::false_type propagate_on_container_copy_assignment;
|
||||
typedef std::true_type propagate_on_container_move_assignment;
|
||||
typedef std::true_type propagate_on_container_swap;
|
||||
|
||||
template <typename U> struct rebind {
|
||||
typedef MemoryPool<U> other;
|
||||
};
|
||||
|
||||
/* Member functions */
|
||||
MemoryPool() noexcept;
|
||||
MemoryPool(const MemoryPool& memoryPool) noexcept;
|
||||
MemoryPool(MemoryPool&& memoryPool) noexcept;
|
||||
template <class U> MemoryPool(const MemoryPool<U>& memoryPool) noexcept;
|
||||
|
||||
~MemoryPool() noexcept;
|
||||
|
||||
MemoryPool& operator=(const MemoryPool& memoryPool) = delete;
|
||||
MemoryPool& operator=(MemoryPool&& memoryPool) noexcept;
|
||||
|
||||
pointer address(reference x) const noexcept;
|
||||
const_pointer address(const_reference x) const noexcept;
|
||||
|
||||
// Can only allocate one object at a time. n and hint are ignored
|
||||
pointer allocate(size_type n = 1, const_pointer hint = 0);
|
||||
void deallocate(pointer p, size_type n = 1);
|
||||
|
||||
size_type max_size() const noexcept;
|
||||
|
||||
template <class U, class... Args> void construct(U* p, Args&&... args);
|
||||
template <class U> void destroy(U* p);
|
||||
|
||||
template <class... Args> pointer newElement(Args&&... args);
|
||||
void deleteElement(pointer p);
|
||||
|
||||
private:
|
||||
union Slot_ {
|
||||
value_type element;
|
||||
Slot_* next;
|
||||
};
|
||||
|
||||
typedef char* data_pointer_;
|
||||
typedef Slot_ slot_type_;
|
||||
typedef Slot_* slot_pointer_;
|
||||
|
||||
slot_pointer_ currentBlock_;
|
||||
slot_pointer_ currentSlot_;
|
||||
slot_pointer_ lastSlot_;
|
||||
slot_pointer_ freeSlots_;
|
||||
|
||||
size_type padPointer(data_pointer_ p, size_type align) const noexcept;
|
||||
void allocateBlock();
|
||||
|
||||
static_assert(BlockSize >= 2 * sizeof(slot_type_), "BlockSize too small.");
|
||||
};
|
||||
|
||||
#include "MemoryPool.tcc"
|
||||
|
||||
#endif // MEMORY_POOL_H
|
|
@ -0,0 +1,235 @@
|
|||
/*-
|
||||
* Copyright (c) 2013 Cosku Acay, http://www.coskuacay.com
|
||||
*
|
||||
* Permission is hereby granted, free of charge, to any person obtaining a
|
||||
* copy of this software and associated documentation files (the "Software"),
|
||||
* to deal in the Software without restriction, including without limitation
|
||||
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
|
||||
* and/or sell copies of the Software, and to permit persons to whom the
|
||||
* Software is furnished to do so, subject to the following conditions:
|
||||
*
|
||||
* The above copyright notice and this permission notice shall be included in
|
||||
* all copies or substantial portions of the Software.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
||||
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
||||
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
||||
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
||||
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
||||
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
|
||||
* IN THE SOFTWARE.
|
||||
*/
|
||||
|
||||
#ifndef MEMORY_BLOCK_TCC
|
||||
#define MEMORY_BLOCK_TCC
|
||||
|
||||
|
||||
|
||||
template <typename T, size_t BlockSize>
|
||||
inline typename MemoryPool<T, BlockSize>::size_type
|
||||
MemoryPool<T, BlockSize>::padPointer(data_pointer_ p, size_type align)
|
||||
const noexcept
|
||||
{
|
||||
uintptr_t result = reinterpret_cast<uintptr_t>(p);
|
||||
return ((align - result) % align);
|
||||
}
|
||||
|
||||
|
||||
|
||||
template <typename T, size_t BlockSize>
|
||||
MemoryPool<T, BlockSize>::MemoryPool()
|
||||
noexcept
|
||||
{
|
||||
currentBlock_ = nullptr;
|
||||
currentSlot_ = nullptr;
|
||||
lastSlot_ = nullptr;
|
||||
freeSlots_ = nullptr;
|
||||
}
|
||||
|
||||
|
||||
|
||||
template <typename T, size_t BlockSize>
|
||||
MemoryPool<T, BlockSize>::MemoryPool(const MemoryPool& memoryPool)
|
||||
noexcept :
|
||||
MemoryPool()
|
||||
{}
|
||||
|
||||
|
||||
|
||||
template <typename T, size_t BlockSize>
|
||||
MemoryPool<T, BlockSize>::MemoryPool(MemoryPool&& memoryPool)
|
||||
noexcept
|
||||
{
|
||||
currentBlock_ = memoryPool.currentBlock_;
|
||||
memoryPool.currentBlock_ = nullptr;
|
||||
currentSlot_ = memoryPool.currentSlot_;
|
||||
lastSlot_ = memoryPool.lastSlot_;
|
||||
freeSlots_ = memoryPool.freeSlots;
|
||||
}
|
||||
|
||||
|
||||
template <typename T, size_t BlockSize>
|
||||
template<class U>
|
||||
MemoryPool<T, BlockSize>::MemoryPool(const MemoryPool<U>& memoryPool)
|
||||
noexcept :
|
||||
MemoryPool()
|
||||
{}
|
||||
|
||||
|
||||
|
||||
template <typename T, size_t BlockSize>
|
||||
MemoryPool<T, BlockSize>&
|
||||
MemoryPool<T, BlockSize>::operator=(MemoryPool&& memoryPool)
|
||||
noexcept
|
||||
{
|
||||
if (this != &memoryPool)
|
||||
{
|
||||
std::swap(currentBlock_, memoryPool.currentBlock_);
|
||||
currentSlot_ = memoryPool.currentSlot_;
|
||||
lastSlot_ = memoryPool.lastSlot_;
|
||||
freeSlots_ = memoryPool.freeSlots;
|
||||
}
|
||||
return *this;
|
||||
}
|
||||
|
||||
|
||||
|
||||
template <typename T, size_t BlockSize>
|
||||
MemoryPool<T, BlockSize>::~MemoryPool()
|
||||
noexcept
|
||||
{
|
||||
slot_pointer_ curr = currentBlock_;
|
||||
while (curr != nullptr) {
|
||||
slot_pointer_ prev = curr->next;
|
||||
operator delete(reinterpret_cast<void*>(curr));
|
||||
curr = prev;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
|
||||
template <typename T, size_t BlockSize>
|
||||
inline typename MemoryPool<T, BlockSize>::pointer
|
||||
MemoryPool<T, BlockSize>::address(reference x)
|
||||
const noexcept
|
||||
{
|
||||
return &x;
|
||||
}
|
||||
|
||||
|
||||
|
||||
template <typename T, size_t BlockSize>
|
||||
inline typename MemoryPool<T, BlockSize>::const_pointer
|
||||
MemoryPool<T, BlockSize>::address(const_reference x)
|
||||
const noexcept
|
||||
{
|
||||
return &x;
|
||||
}
|
||||
|
||||
|
||||
|
||||
template <typename T, size_t BlockSize>
|
||||
void
|
||||
MemoryPool<T, BlockSize>::allocateBlock()
|
||||
{
|
||||
// Allocate space for the new block and store a pointer to the previous one
|
||||
data_pointer_ newBlock = reinterpret_cast<data_pointer_>
|
||||
(operator new(BlockSize));
|
||||
reinterpret_cast<slot_pointer_>(newBlock)->next = currentBlock_;
|
||||
currentBlock_ = reinterpret_cast<slot_pointer_>(newBlock);
|
||||
// Pad block body to staisfy the alignment requirements for elements
|
||||
data_pointer_ body = newBlock + sizeof(slot_pointer_);
|
||||
size_type bodyPadding = padPointer(body, alignof(slot_type_));
|
||||
currentSlot_ = reinterpret_cast<slot_pointer_>(body + bodyPadding);
|
||||
lastSlot_ = reinterpret_cast<slot_pointer_>
|
||||
(newBlock + BlockSize - sizeof(slot_type_) + 1);
|
||||
}
|
||||
|
||||
|
||||
|
||||
template <typename T, size_t BlockSize>
|
||||
inline typename MemoryPool<T, BlockSize>::pointer
|
||||
MemoryPool<T, BlockSize>::allocate(size_type n, const_pointer hint)
|
||||
{
|
||||
if (freeSlots_ != nullptr) {
|
||||
pointer result = reinterpret_cast<pointer>(freeSlots_);
|
||||
freeSlots_ = freeSlots_->next;
|
||||
return result;
|
||||
}
|
||||
else {
|
||||
if (currentSlot_ >= lastSlot_)
|
||||
allocateBlock();
|
||||
return reinterpret_cast<pointer>(currentSlot_++);
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
|
||||
template <typename T, size_t BlockSize>
|
||||
inline void
|
||||
MemoryPool<T, BlockSize>::deallocate(pointer p, size_type n)
|
||||
{
|
||||
if (p != nullptr) {
|
||||
reinterpret_cast<slot_pointer_>(p)->next = freeSlots_;
|
||||
freeSlots_ = reinterpret_cast<slot_pointer_>(p);
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
|
||||
template <typename T, size_t BlockSize>
|
||||
inline typename MemoryPool<T, BlockSize>::size_type
|
||||
MemoryPool<T, BlockSize>::max_size()
|
||||
const noexcept
|
||||
{
|
||||
size_type maxBlocks = -1 / BlockSize;
|
||||
return (BlockSize - sizeof(data_pointer_)) / sizeof(slot_type_) * maxBlocks;
|
||||
}
|
||||
|
||||
|
||||
|
||||
template <typename T, size_t BlockSize>
|
||||
template <class U, class... Args>
|
||||
inline void
|
||||
MemoryPool<T, BlockSize>::construct(U* p, Args&&... args)
|
||||
{
|
||||
new (p) U (std::forward<Args>(args)...);
|
||||
}
|
||||
|
||||
|
||||
|
||||
template <typename T, size_t BlockSize>
|
||||
template <class U>
|
||||
inline void
|
||||
MemoryPool<T, BlockSize>::destroy(U* p)
|
||||
{
|
||||
p->~U();
|
||||
}
|
||||
|
||||
|
||||
|
||||
template <typename T, size_t BlockSize>
|
||||
template <class... Args>
|
||||
inline typename MemoryPool<T, BlockSize>::pointer
|
||||
MemoryPool<T, BlockSize>::newElement(Args&&... args)
|
||||
{
|
||||
pointer result = allocate();
|
||||
construct<value_type>(result, std::forward<Args>(args)...);
|
||||
return result;
|
||||
}
|
||||
|
||||
|
||||
|
||||
template <typename T, size_t BlockSize>
|
||||
inline void
|
||||
MemoryPool<T, BlockSize>::deleteElement(pointer p)
|
||||
{
|
||||
if (p != nullptr) {
|
||||
p->~value_type();
|
||||
deallocate(p);
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
|
||||
#endif // MEMORY_BLOCK_TCC
|
|
@ -31,6 +31,8 @@
|
|||
|
||||
#define HASH_MAP_ENABLE
|
||||
|
||||
#define MEMORY_POOL
|
||||
|
||||
//#define RAPID_CHESS
|
||||
|
||||
//#define BOOK_LEARNING
|
||||
|
|
|
@ -84,7 +84,11 @@ struct NineChessAi_ab::Node *NineChessAi_ab::addNode(
|
|||
enum NineChess::Player player
|
||||
)
|
||||
{
|
||||
#ifdef MEMORY_POOL
|
||||
Node *newNode = pool.newElement();
|
||||
#else
|
||||
Node *newNode = new Node;
|
||||
#endif
|
||||
|
||||
newNode->parent = parent;
|
||||
newNode->value = value;
|
||||
|
@ -362,7 +366,11 @@ void NineChessAi_ab::deleteTree(Node *node)
|
|||
deleteTree(i);
|
||||
}
|
||||
node->children.clear();
|
||||
delete node;
|
||||
#ifdef MEMORY_POOL
|
||||
pool.deleteElement(node);
|
||||
#else
|
||||
delete(node);
|
||||
#endif
|
||||
}
|
||||
}
|
||||
|
||||
|
|
|
@ -32,6 +32,10 @@
|
|||
#include "ninechess.h"
|
||||
#include "hashMap.h"
|
||||
|
||||
#ifdef MEMORY_POOL
|
||||
#include "MemoryPool.h"
|
||||
#endif
|
||||
|
||||
using namespace std;
|
||||
using namespace CTSL;
|
||||
|
||||
|
@ -99,6 +103,10 @@ public:
|
|||
};
|
||||
#endif
|
||||
|
||||
#ifdef MEMORY_POOL
|
||||
MemoryPool<Node> pool;
|
||||
#endif
|
||||
|
||||
public:
|
||||
NineChessAi_ab();
|
||||
~NineChessAi_ab();
|
||||
|
|
Loading…
Reference in New Issue