2012-10-02 09:12:39 +02:00
|
|
|
/****************************************************************************
|
2010-11-11 15:26:08 +01:00
|
|
|
**
|
2016-01-15 14:58:39 +01:00
|
|
|
** Copyright (C) 2016 The Qt Company Ltd.
|
|
|
|
|
** Contact: https://www.qt.io/licensing/
|
2010-11-11 15:26:08 +01:00
|
|
|
**
|
2012-10-02 09:12:39 +02:00
|
|
|
** This file is part of Qt Creator.
|
2010-11-11 15:26:08 +01:00
|
|
|
**
|
2012-10-02 09:12:39 +02:00
|
|
|
** Commercial License Usage
|
|
|
|
|
** Licensees holding valid commercial Qt licenses may use this file in
|
|
|
|
|
** accordance with the commercial license agreement provided with the
|
|
|
|
|
** Software or, alternatively, in accordance with the terms contained in
|
2016-01-15 14:58:39 +01:00
|
|
|
** a written agreement between you and The Qt Company. For licensing terms
|
|
|
|
|
** and conditions see https://www.qt.io/terms-conditions. For further
|
|
|
|
|
** information use the contact form at https://www.qt.io/contact-us.
|
2010-11-11 15:26:08 +01:00
|
|
|
**
|
2016-01-15 14:58:39 +01:00
|
|
|
** GNU General Public License Usage
|
|
|
|
|
** Alternatively, this file may be used under the terms of the GNU
|
|
|
|
|
** General Public License version 3 as published by the Free Software
|
|
|
|
|
** Foundation with exceptions as appearing in the file LICENSE.GPL3-EXCEPT
|
|
|
|
|
** included in the packaging of this file. Please review the following
|
|
|
|
|
** information to ensure the GNU General Public License requirements will
|
|
|
|
|
** be met: https://www.gnu.org/licenses/gpl-3.0.html.
|
2010-12-17 17:14:20 +01:00
|
|
|
**
|
2012-10-02 09:12:39 +02:00
|
|
|
****************************************************************************/
|
2010-11-11 15:26:08 +01:00
|
|
|
|
|
|
|
|
#include "glslmemorypool.h"
|
|
|
|
|
#include <cstring>
|
|
|
|
|
#include <cassert>
|
|
|
|
|
|
|
|
|
|
using namespace GLSL;
|
|
|
|
|
|
|
|
|
|
MemoryPool::MemoryPool()
|
2019-07-31 17:21:41 +02:00
|
|
|
: _blocks(nullptr),
|
2010-11-11 15:26:08 +01:00
|
|
|
_allocatedBlocks(0),
|
|
|
|
|
_blockCount(-1),
|
2019-07-31 17:21:41 +02:00
|
|
|
_ptr(nullptr),
|
|
|
|
|
_end(nullptr)
|
2010-11-11 15:26:08 +01:00
|
|
|
{ }
|
|
|
|
|
|
|
|
|
|
MemoryPool::~MemoryPool()
|
|
|
|
|
{
|
|
|
|
|
if (_blocks) {
|
|
|
|
|
for (int i = 0; i < _allocatedBlocks; ++i) {
|
|
|
|
|
if (char *b = _blocks[i])
|
|
|
|
|
std::free(b);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
std::free(_blocks);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void MemoryPool::reset()
|
|
|
|
|
{
|
|
|
|
|
_blockCount = -1;
|
2019-07-31 17:21:41 +02:00
|
|
|
_ptr = _end = nullptr;
|
2010-11-11 15:26:08 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
void *MemoryPool::allocate_helper(size_t size)
|
|
|
|
|
{
|
|
|
|
|
assert(size < BLOCK_SIZE);
|
|
|
|
|
|
|
|
|
|
if (++_blockCount == _allocatedBlocks) {
|
|
|
|
|
if (! _allocatedBlocks)
|
|
|
|
|
_allocatedBlocks = DEFAULT_BLOCK_COUNT;
|
|
|
|
|
else
|
|
|
|
|
_allocatedBlocks *= 2;
|
|
|
|
|
|
|
|
|
|
_blocks = (char **) realloc(_blocks, sizeof(char *) * _allocatedBlocks);
|
|
|
|
|
|
|
|
|
|
for (int index = _blockCount; index < _allocatedBlocks; ++index)
|
2019-07-31 17:21:41 +02:00
|
|
|
_blocks[index] = nullptr;
|
2010-11-11 15:26:08 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
char *&block = _blocks[_blockCount];
|
|
|
|
|
|
|
|
|
|
if (! block)
|
|
|
|
|
block = (char *) std::malloc(BLOCK_SIZE);
|
|
|
|
|
|
|
|
|
|
_ptr = block;
|
|
|
|
|
_end = _ptr + BLOCK_SIZE;
|
|
|
|
|
|
|
|
|
|
void *addr = _ptr;
|
|
|
|
|
_ptr += size;
|
|
|
|
|
return addr;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
Managed::Managed()
|
|
|
|
|
{ }
|
|
|
|
|
|
|
|
|
|
Managed::~Managed()
|
|
|
|
|
{ }
|
|
|
|
|
|
|
|
|
|
void *Managed::operator new(size_t size, MemoryPool *pool)
|
|
|
|
|
{ return pool->allocate(size); }
|
|
|
|
|
|
|
|
|
|
void Managed::operator delete(void *)
|
|
|
|
|
{ }
|
|
|
|
|
|
|
|
|
|
void Managed::operator delete(void *, MemoryPool *)
|
|
|
|
|
{ }
|
|
|
|
|
|