diff options
author | cvs2git <rtems-devel@rtems.org> | 2005-05-03 22:18:33 +0000 |
---|---|---|
committer | cvs2git <rtems-devel@rtems.org> | 2005-05-03 22:18:33 +0000 |
commit | d2565cefae15b9cfd12fbed14a7df3048797ed8d (patch) | |
tree | 8e7b1b946472d1ecb7f08e987a97f458130c1dd6 /cpukit/score | |
parent | 2005-04-28 Jennifer Averett <jennifer.averett@oarcorp.com> (diff) | |
download | rtems-d2565cefae15b9cfd12fbed14a7df3048797ed8d.tar.bz2 |
This commit was manufactured by cvs2svn to create branch 'rtems-4-6-branch'.
Cherrypick from master 2005-05-03 22:18:32 UTC Joel Sherrill <joel.sherrill@OARcorp.com> '2005-05-03 Joel Sherrill <joel@OARcorp.com>':
cpukit/rtems/src/regiongetfreeinfo.c
cpukit/score/src/heapgetfreeinfo.c
Diffstat (limited to 'cpukit/score')
-rw-r--r-- | cpukit/score/src/heapgetfreeinfo.c | 63 |
1 files changed, 63 insertions, 0 deletions
diff --git a/cpukit/score/src/heapgetfreeinfo.c b/cpukit/score/src/heapgetfreeinfo.c new file mode 100644 index 0000000000..b53931414b --- /dev/null +++ b/cpukit/score/src/heapgetfreeinfo.c @@ -0,0 +1,63 @@ +/* + * Heap Handler + * + * COPYRIGHT (c) 1989-2004. + * On-Line Applications Research Corporation (OAR). + * + * The license and distribution terms for this file may be + * found in the file LICENSE in this distribution or at + * http://www.rtems.com/license/LICENSE. + * + * $Id$ + */ + +#if HAVE_CONFIG_H +#include "config.h" +#endif + +#include <rtems/system.h> +#include <rtems/score/sysstate.h> +#include <rtems/score/heap.h> + +/*PAGE + * + * _Heap_Get_free_information + * + * This heap routine returns information about the free blocks + * in the specified heap. + * + * Input parameters: + * the_heap - pointer to heap header. + * info - pointer to the free block information. + * + * Output parameters: + * returns - free block information filled in. + */ + +void _Heap_Get_free_information( + Heap_Control *the_heap, + Heap_Information *info +) +{ + Heap_Block *the_block; + Heap_Block *const tail = _Heap_Tail(the_heap); + + info->number = 0; + info->largest = 0; + info->total = 0; + + for(the_block = _Heap_First(the_heap); + the_block != tail; + the_block = the_block->next) + { + uint32_t const the_size = _Heap_Block_size(the_block); + + /* As we always coalesce free blocks, prev block must have been used. */ + _HAssert(_Heap_Is_prev_used(the_block)); + + info->number++; + info->total += the_size; + if ( info->largest < the_size ) + info->largest = the_size; + } +} |