/usr/include/kdevelop-pg-qt/kdev-pg-memory-pool.h is in kdevelop-pg-qt 1.0.0-2ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 | /*
This file is part of kdev-pg
Copyright 2005, 2006 Roberto Raggi <roberto@kdevelop.org>
Permission to use, copy, modify, distribute, and sell this software and its
documentation for any purpose is hereby granted without fee, provided that
the above copyright notice appear in all copies and that both that
copyright notice and this permission notice appear in supporting
documentation.
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
KDEVELOP TEAM 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.
*/
//krazy:excludeall=inline
#ifndef KDEV_PG_MEMORY_POOL
#define KDEV_PG_MEMORY_POOL
#include <QtCore/QtGlobal>
#include <string.h>
#include <stdlib.h>
namespace KDevPG
{
class BlockType
{
public:
qint64 blockSize;
BlockType *chain;
char *data;
char *ptr;
char *end;
inline void init(int block_size = 256)
{
blockSize = block_size;
chain = 0;
data = (char*) malloc(blockSize);
ptr = data;
end = data + block_size;
}
inline void init0(int block_size = 256)
{
init(block_size);
memset(data, '\0', block_size);
}
inline void destroy()
{
if (chain) {
chain->destroy();
free(chain);
}
free(data);
}
inline void *allocate(size_t size, BlockType **right_most)
{
if (end < ptr + size) {
// assert( size < block_size );
if (!chain) {
chain = (BlockType*) malloc(sizeof(BlockType));
chain->init0(blockSize << 2);
}
return chain->allocate(size, right_most);
}
char *r = ptr;
ptr += size;
if (right_most)
*right_most = this;
return r;
}
};
class MemoryPool
{
public:
BlockType blk;
BlockType *rightMost;
inline MemoryPool() { blk.init0(); rightMost = &blk; }
inline ~MemoryPool() { blk.destroy(); }
inline void *allocate(size_t size)
{ return rightMost->allocate(size, &rightMost); }
};
}
#endif
|