diff options
| author | Jason Evans <jasone@canonware.com> | 2011-07-31 00:27:02 (GMT) |
|---|---|---|
| committer | Jason Evans <jasone@canonware.com> | 2011-07-31 00:27:02 (GMT) |
| commit | 446c3b22f1299ff4a5549b0b36540bceda6c3beb (patch) | |
| tree | 56e74b11294ca1ced74274bad05f4a153475b558 /src/rtree.c | |
| parent | 5ef7abf6d846720fb3fb8c737861c99b5ad1d862 (diff) | |
| parent | 4c48481e7c8f5e5dce55aa55d725e1a479b01224 (diff) | |
| download | jemalloc-2.2.2.zip jemalloc-2.2.2.tar.gz jemalloc-2.2.2.tar.bz2 | |
Merge branch 'dev'2.2.2
Diffstat (limited to 'src/rtree.c')
| -rw-r--r-- | src/rtree.c | 46 |
1 files changed, 46 insertions, 0 deletions
diff --git a/src/rtree.c b/src/rtree.c new file mode 100644 index 0000000..eb0ff1e --- /dev/null +++ b/src/rtree.c @@ -0,0 +1,46 @@ +#define JEMALLOC_RTREE_C_ +#include "jemalloc/internal/jemalloc_internal.h" + +rtree_t * +rtree_new(unsigned bits) +{ + rtree_t *ret; + unsigned bits_per_level, height, i; + + bits_per_level = ffs(pow2_ceil((RTREE_NODESIZE / sizeof(void *)))) - 1; + height = bits / bits_per_level; + if (height * bits_per_level != bits) + height++; + assert(height * bits_per_level >= bits); + + ret = (rtree_t*)base_alloc(offsetof(rtree_t, level2bits) + + (sizeof(unsigned) * height)); + if (ret == NULL) + return (NULL); + memset(ret, 0, offsetof(rtree_t, level2bits) + (sizeof(unsigned) * + height)); + + if (malloc_mutex_init(&ret->mutex)) { + /* Leak the rtree. */ + return (NULL); + } + ret->height = height; + if (bits_per_level * height > bits) + ret->level2bits[0] = bits % bits_per_level; + else + ret->level2bits[0] = bits_per_level; + for (i = 1; i < height; i++) + ret->level2bits[i] = bits_per_level; + + ret->root = (void**)base_alloc(sizeof(void *) << ret->level2bits[0]); + if (ret->root == NULL) { + /* + * We leak the rtree here, since there's no generic base + * deallocation. + */ + return (NULL); + } + memset(ret->root, 0, sizeof(void *) << ret->level2bits[0]); + + return (ret); +} |
