score/src/heapsizeofuserarea.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_Size_of_alloc_area().
0010  */
0011
0012 /*
0013  *  COPYRIGHT (c) 1989-1999.
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 bool _Heap_Size_of_alloc_area(
0045   Heap_Control *heap,
0046   void *alloc_begin_ptr,
0047   uintptr_t *alloc_size
0048 )
0049 {
0050   uintptr_t const page_size = heap->page_size;
0051   uintptr_t const alloc_begin = (uintptr_t) alloc_begin_ptr;
0052   Heap_Block *block = _Heap_Block_of_alloc_area( alloc_begin, page_size );
0053   Heap_Block *next_block = NULL;
0054   uintptr_t block_size = 0;
0055
0056   if ( !_Heap_Is_block_in_heap( heap, block ) ) {
0057     return false;
0058   }
0059
0060   block_size = _Heap_Block_size( block );
0061   next_block = _Heap_Block_at( block, block_size );
0062
0063   if (
0064     !_Heap_Is_block_in_heap( heap, next_block )
0065       || !_Heap_Is_prev_used( next_block )
0066   ) {
0067     return false;
0068   }
0069
0070   *alloc_size = (uintptr_t) next_block + HEAP_ALLOC_BONUS - alloc_begin;
0071
0072   return true;
0073 }
0074