mirror of
https://bitbucket.org/smil3y/kde-playground.git
synced 2025-02-24 10:52:52 +00:00
107 lines
2.6 KiB
C++
107 lines
2.6 KiB
C++
/* This file is part of KCachegrind.
|
|
Copyright (C) 2002-2004 Josef Weidendorfer <Josef.Weidendorfer@gmx.de>
|
|
|
|
KCachegrind is free software; you can redistribute it and/or
|
|
modify it under the terms of the GNU General Public
|
|
License as published by the Free Software Foundation, version 2.
|
|
|
|
This program 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
|
|
General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program; see the file COPYING. If not, write to
|
|
the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
|
|
Boston, MA 02110-1301, USA.
|
|
*/
|
|
|
|
#ifndef POOL_H
|
|
#define POOL_H
|
|
|
|
/**
|
|
* Pool objects: containers for many small objects.
|
|
*/
|
|
|
|
struct SpaceChunk;
|
|
|
|
/**
|
|
* FixPool
|
|
*
|
|
* For objects with fixed size and life time
|
|
* ending with that of the pool.
|
|
*/
|
|
class FixPool
|
|
{
|
|
public:
|
|
FixPool();
|
|
~FixPool();
|
|
|
|
/**
|
|
* Take <size> bytes from the pool
|
|
*/
|
|
void* allocate(unsigned int size);
|
|
|
|
/**
|
|
* Reserve space. If you call allocateReservedSpace(realsize)
|
|
* with realSize < reserved size directly after, you
|
|
* will get the same memory area.
|
|
*/
|
|
void* reserve(unsigned int size);
|
|
|
|
/**
|
|
* Before calling this, you have to reserve at least <size> bytes
|
|
* with reserveSpace().
|
|
*/
|
|
bool allocateReserved(unsigned int size);
|
|
|
|
private:
|
|
/* Checks that there is enough space in the last chunk.
|
|
* Returns false if this is not possible.
|
|
*/
|
|
bool ensureSpace(unsigned int);
|
|
|
|
struct SpaceChunk *_first, *_last;
|
|
unsigned int _reservation;
|
|
int _count, _size;
|
|
};
|
|
|
|
/**
|
|
* DynPool
|
|
*
|
|
* For objects which probably need to be resized
|
|
* in the future. Objects also can be deleted to free up space.
|
|
* As objects can also be moved in a defragmentation step,
|
|
* access has to be done via the given pointer object.
|
|
*/
|
|
class DynPool
|
|
{
|
|
public:
|
|
DynPool();
|
|
~DynPool();
|
|
|
|
/**
|
|
* Take <size> bytes from the pool, changing <*ptr>
|
|
* to point to this allocated space.
|
|
* <*ptr> will be changed if the object is moved.
|
|
* Returns false if no space available.
|
|
*/
|
|
bool allocate(char** ptr, unsigned int size);
|
|
|
|
/**
|
|
* To resize, first allocate new space, and free old
|
|
* afterwards.
|
|
*/
|
|
void free(char** ptr);
|
|
|
|
private:
|
|
/* Checks that there is enough space. If not,
|
|
* it compactifies, possibly moving objects.
|
|
*/
|
|
bool ensureSpace(unsigned int);
|
|
|
|
char* _data;
|
|
unsigned int _used, _size;
|
|
};
|
|
|
|
#endif // POOL_H
|