Classes to implement a Kingsley (power-of-two, segregated fits) allocator. More...
#include "segheap.h"
Go to the source code of this file.
Classes | |
class | HL::KingsleyHeap< PerClassHeap, BigHeap > |
Namespaces | |
namespace | Kingsley |
Functions to implement KingsleyHeap. | |
namespace | HL |
A thread-wrapper of childlike simplicity :). | |
Enumerations | |
enum | { Kingsley::NUMBINS = 29 } |
Functions | |
size_t | Kingsley::class2Size (const int i) |
int | Kingsley::size2Class (const size_t sz) |
Variables | |
const int | Kingsley::cl [16] = { 0, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4 } |
A speed optimization: we use this array to quickly return the size class of objects from 8 to 128 bytes. |
Classes to implement a Kingsley (power-of-two, segregated fits) allocator.