score/src/heapgetinfo.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_information().
0010  */
0011
0012 /*
0013  *  COPYRIGHT (c) 1989-2009.
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 <string.h>
0043
0044 #include <rtems/score/heapimpl.h>
0045
0046 static bool _Heap_Get_information_visitor(
0047   const Heap_Block *block RTEMS_UNUSED,
0048   uintptr_t block_size,
0049   bool block_is_used,
0050   void *visitor_arg
0051 )
0052 {
0053   Heap_Information_block *info_block = visitor_arg;
0054   Heap_Information *info = block_is_used ?
0055     &info_block->Used : &info_block->Free;
0056
0057   ++info->number;
0058   info->total += block_size;
0059   if ( info->largest < block_size )
0060     info->largest = block_size;
0061
0062   return false;
0063 }
0064
0065 void _Heap_Get_information(
0066   Heap_Control            *the_heap,
0067   Heap_Information_block  *the_info
0068 )
0069 {
0070   memset( the_info, 0, sizeof(*the_info) );
0071   _Heap_Protection_free_all_delayed_blocks( the_heap );
0072   _Heap_Iterate( the_heap, _Heap_Get_information_visitor, the_info );
0073   the_info->Stats = the_heap->stats;
0074 }