score/src/heapgetfreeinfo.c

0001 /* SPDX-License-Identifier: BSD-2-Clause */
0002
0003 /**
0004  * @file
0005  *
0006  * @ingroup RTEMSScoreHeap
0007  *
0008  * @brief This source file contains the implementation of
0009  *   _Heap_Get_free_information().
0010  */
0011
0012 /*
0013  *  COPYRIGHT (c) 1989-2004.
0014  *  On-Line Applications Research Corporation (OAR).
0015  *
0016  * Redistribution and use in source and binary forms, with or without
0017  * modification, are permitted provided that the following conditions
0018  * are met:
0019  * 1. Redistributions of source code must retain the above copyright
0020  *    notice, this list of conditions and the following disclaimer.
0021  * 2. Redistributions in binary form must reproduce the above copyright
0022  *    notice, this list of conditions and the following disclaimer in the
0023  *    documentation and/or other materials provided with the distribution.
0024  *
0025  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
0026  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
0027  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
0028  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
0029  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
0030  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
0031  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
0032  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
0033  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
0034  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
0035  * POSSIBILITY OF SUCH DAMAGE.
0036  */
0037
0038 #ifdef HAVE_CONFIG_H
0039 #include "config.h"
0040 #endif
0041
0042 #include <rtems/score/heapimpl.h>
0043
0044 void _Heap_Get_free_information(
0045   Heap_Control        *the_heap,
0046   Heap_Information    *info
0047 )
0048 {
0049   Heap_Block *the_block;
0050   Heap_Block *const tail = _Heap_Free_list_tail(the_heap);
0051
0052   info->number = 0;
0053   info->largest = 0;
0054   info->total = 0;
0055
0056   for(the_block = _Heap_Free_list_first(the_heap);
0057       the_block != tail;
0058       the_block = the_block->next)
0059   {
0060     uint32_t const the_size = _Heap_Block_size(the_block);
0061
0062     /* As we always coalesce free blocks, prev block must have been used. */
0063     _HAssert(_Heap_Is_prev_used(the_block));
0064
0065     info->number++;
0066     info->total += the_size;
0067     if ( info->largest < the_size )
0068         info->largest = the_size;
0069   }
0070 }