|
|
/****************************************************************************
|
|
|
**
|
|
|
** Copyright (C) 1992-2008 Trolltech ASA. All rights reserved.
|
|
|
** Copyright (C) 2002-2005 Roberto Raggi <roberto@kdevelop.org>
|
|
|
**
|
|
|
** This file is part of the Qt Script Generator project on Trolltech Labs.
|
|
|
**
|
|
|
** This file may be used under the terms of the GNU General Public
|
|
|
** License version 2.0 as published by the Free Software Foundation
|
|
|
** and appearing in the file LICENSE.GPL included in the packaging of
|
|
|
** this file. Please review the following information to ensure GNU
|
|
|
** General Public Licensing requirements will be met:
|
|
|
** http://www.trolltech.com/products/qt/opensource.html
|
|
|
**
|
|
|
** If you are unsure which license is appropriate for your use, please
|
|
|
** review the following information:
|
|
|
** http://www.trolltech.com/products/qt/licensing.html or contact the
|
|
|
** sales department at sales@trolltech.com.
|
|
|
**
|
|
|
** This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
|
|
|
** WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
|
|
|
**
|
|
|
****************************************************************************/
|
|
|
|
|
|
|
|
|
#ifndef RXX_ALLOCATOR_H
|
|
|
#define RXX_ALLOCATOR_H
|
|
|
|
|
|
#include <cstddef>
|
|
|
#include <cstdlib>
|
|
|
#include <cstring>
|
|
|
#include <memory>
|
|
|
|
|
|
template <class _Tp> class rxx_allocator {
|
|
|
public:
|
|
|
typedef _Tp value_type;
|
|
|
typedef _Tp* pointer;
|
|
|
typedef const _Tp* const_pointer;
|
|
|
typedef _Tp& reference;
|
|
|
typedef const _Tp& const_reference;
|
|
|
typedef std::size_t size_type;
|
|
|
typedef std::ptrdiff_t difference_type;
|
|
|
|
|
|
static const size_type max_block_count = size_type(-1);
|
|
|
static const size_type _S_block_size = 1 << 16; // 64K
|
|
|
|
|
|
rxx_allocator() {
|
|
|
_M_block_index = max_block_count;
|
|
|
_M_current_index = 0;
|
|
|
_M_storage = 0;
|
|
|
_M_current_block = 0;
|
|
|
}
|
|
|
|
|
|
~rxx_allocator() {
|
|
|
for (size_type index = 0; index < _M_block_index + 1; ++index)
|
|
|
delete[] _M_storage[index];
|
|
|
|
|
|
::free(_M_storage);
|
|
|
}
|
|
|
|
|
|
pointer address(reference __val) { return &__val; }
|
|
|
const_pointer address(const_reference __val) const { return &__val; }
|
|
|
|
|
|
pointer allocate(size_type __n, const void* = 0) {
|
|
|
const size_type bytes = __n * sizeof(_Tp);
|
|
|
|
|
|
if (_M_current_block == 0
|
|
|
|| _S_block_size < _M_current_index + bytes)
|
|
|
{
|
|
|
++_M_block_index;
|
|
|
|
|
|
_M_storage = reinterpret_cast<char**>
|
|
|
(::realloc(_M_storage, sizeof(char*) * (1 + _M_block_index)));
|
|
|
|
|
|
_M_current_block = _M_storage[_M_block_index] = reinterpret_cast<char*>
|
|
|
(new char[_S_block_size]);
|
|
|
|
|
|
#if defined(RXX_ALLOCATOR_INIT_0) // ### make it a policy
|
|
|
::memset(_M_current_block, 0, _S_block_size);
|
|
|
#endif
|
|
|
_M_current_index = 0;
|
|
|
}
|
|
|
|
|
|
pointer p = reinterpret_cast<pointer>
|
|
|
(_M_current_block + _M_current_index);
|
|
|
|
|
|
_M_current_index += bytes;
|
|
|
|
|
|
return p;
|
|
|
}
|
|
|
|
|
|
void deallocate(pointer __p, size_type __n) {}
|
|
|
|
|
|
size_type max_size() const { return size_type(-1) / sizeof(_Tp); }
|
|
|
|
|
|
void contruct(pointer __p, const_reference __val) { new (__p) _Tp(__val); }
|
|
|
void destruct(pointer __p) { __p->~_Tp(); }
|
|
|
|
|
|
private:
|
|
|
template <class _Tp1> struct rebind {
|
|
|
typedef rxx_allocator<_Tp1> other;
|
|
|
};
|
|
|
|
|
|
template <class _Tp1> rxx_allocator(const rxx_allocator<_Tp1> &__o) {}
|
|
|
|
|
|
private:
|
|
|
size_type _M_block_index;
|
|
|
size_type _M_current_index;
|
|
|
char *_M_current_block;
|
|
|
char **_M_storage;
|
|
|
};
|
|
|
|
|
|
#endif // RXX_ALLOCATOR_H
|
|
|
|
|
|
// kate: space-indent on; indent-width 2; replace-tabs on;
|
|
|
|
