lemoncake

rbtree based memory allocator
git clone git://git.2f30.org/lemoncake.git
Log | Files | Refs | README | LICENSE

commit 0501870b679aadbac95b98b38353a384bb113e84
parent 8937a8fc0c49a6bad7b1f0e031db39db66668441
Author: sin <sin@2f30.org>
Date:   Fri Aug  2 14:33:44 +0100

Remove unused variables/functions

Diffstat:
lemoncake.c | 8++------
1 file changed, 2 insertions(+), 6 deletions(-)
diff --git a/lemoncake.c b/lemoncake.c @@ -51,7 +51,7 @@ at_cmp(struct node *a, struct node *b) return 0; } -static void +__attribute__ ((unused)) static void dump_alloc_tree(void) { struct node *n; @@ -61,7 +61,7 @@ dump_alloc_tree(void) __func__, n->buf, n->siz); } -static void +__attribute__ ((unused)) static void dump_free_tree(void) { struct node *n; @@ -177,7 +177,6 @@ realloc(void *oldp, size_t siz) } newan->buf = mmap_aligned(MINALIGNMENT, siz); if (!newan->buf) { - free_object(newan, sizeof(*newan)); unlock(&rblock); return NULL; } @@ -298,9 +297,6 @@ pvalloc(size_t siz) int posix_memalign(void **memptr, size_t align, size_t siz) { - struct node *an; - void *p; - *memptr = NULL; if (((align - 1) & align)) return EINVAL;