##// END OF EJS Templates
added builtin support for variants etc., this will replace the direct includes in PythonQt...
added builtin support for variants etc., this will replace the direct includes in PythonQt git-svn-id: svn://svn.code.sf.net/p/pythonqt/code/trunk@129 ea8d5007-eb21-0410-b261-ccb3ea6e24a9

File last commit:

r87:0003cc64a7aa
r93:7b53f64eae84
Show More
rxx_allocator.h
132 lines | 3.7 KiB | text/x-c | CLexer
/****************************************************************************
**
** Copyright (C) 2008-2009 Nokia Corporation and/or its subsidiary(-ies).
** All rights reserved.
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the Qt Script Generator project on Qt Labs.
**
** $QT_BEGIN_LICENSE:LGPL$
** No Commercial Usage
** This file contains pre-release code and may not be distributed.
** You may use this file in accordance with the terms and conditions
** contained in the Technology Preview License Agreement accompanying
** this package.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 2.1 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain additional
** rights. These rights are described in the Nokia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** If you have questions regarding the use of this file, please contact
** Nokia at qt-info@nokia.com.
**
**
**
**
**
**
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#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;