Remove unneeded ifdef.

[bertos.git] / bertos / struct / heap.c

diff --git a/bertos/struct/heap.c b/bertos/struct/heap.c
index 27f8032567ae8945d70e6482a31a2c0afd90db85..4c00bd7ca0ed1ebd3b24a6048b6b8f26b8112d24 100644 (file)
--- a/bertos/struct/heap.c
+++ b/bertos/struct/heap.c
@@ -32,7 +32,6 @@
  *
  * \brief Heap subsystem (public interface).
  *
- * \version $Id$
  * \author Bernie Innocenti <bernie@codewiz.org>
  */
 
@@ -48,7 +47,7 @@
 /*
  * This function prototype is deprecated, will change in:
  * void heap_init(struct Heap* h, heap_buf_t* memory, size_t size)
- * in the nex BeRTOS release.
+ * in the next BeRTOS release.
  */
 void heap_init(struct Heap* h, void* memory, size_t size)
 {
@@ -56,7 +55,7 @@ void heap_init(struct Heap* h, void* memory, size_t size)
        memset(memory, FREE_FILL_CODE, size);
        #endif
 
-       ASSERT2((((uintptr_t)memory % sizeof(heap_buf_t)) == 0),
+       ASSERT2(((size_t)memory % alignof(heap_buf_t)) == 0,
        "memory buffer is unaligned, please use the HEAP_DEFINE_BUF() macro to declare heap buffers!\n");
 
        /* Initialize heap with a single big chunk */
@@ -127,9 +126,9 @@ void heap_freemem(struct Heap* h, void *mem, size_t size)
        if (!size)
                size = sizeof(MemChunk);
 
-       /* Special case: first chunk in the free list */
+       /* Special cases: first chunk in the free list or memory completely full */
        ASSERT((uint8_t*)mem != (uint8_t*)h->FreeList);
-       if (((uint8_t *)mem) < ((uint8_t *)h->FreeList))
+       if (((uint8_t *)mem) < ((uint8_t *)h->FreeList) || !h->FreeList)
        {
                /* Insert memory block before the current free list head */
                prev = (MemChunk *)mem;
@@ -184,8 +183,30 @@ void heap_freemem(struct Heap* h, void *mem, size_t size)
        }
 }
 
+/**
+ * Returns the number of free bytes in a heap.
+ * \param h the heap to check.
+ *
+ * \note The returned value is the sum of all free memory regions 
+ *       in the heap.
+ *       Those regions are likely to be *not* contiguous,
+ *       so a successive allocation may fail even if the
+ *       requested amount of memory is lower than the current free space.
+ */
+size_t heap_freeSpace(struct Heap *h)
+{
+       size_t free_mem = 0;
+       for (MemChunk *chunk = h->FreeList; chunk; chunk = chunk->next)
+               free_mem += chunk->size;
+
+       return free_mem;
+}
+
 #if CONFIG_HEAP_MALLOC
 
+/**
+ * Standard malloc interface
+ */
 void *heap_malloc(struct Heap* h, size_t size)
 {
        size_t *mem;
@@ -197,6 +218,9 @@ void *heap_malloc(struct Heap* h, size_t size)
        return mem;
 }
 
+/**
+ * Standard calloc interface
+ */
 void *heap_calloc(struct Heap* h, size_t size)
 {
        void *mem;