![]() |
|
|||
File indexing completed on 2025-05-11 08:24:22
0001 /* SPDX-License-Identifier: BSD-2-Clause */ 0002 0003 /** 0004 * @file 0005 * 0006 * @ingroup RTEMSImplClassic 0007 * 0008 * @brief This source file contains the implementation of 0009 * rtems_workspace_greedy_allocate(), 0010 * rtems_workspace_greedy_allocate_all_except_largest(), and 0011 * rtems_workspace_greedy_free(). 0012 */ 0013 0014 /* 0015 * Copyright (c) 2012 embedded brains GmbH & Co. KG 0016 * 0017 * Redistribution and use in source and binary forms, with or without 0018 * modification, are permitted provided that the following conditions 0019 * are met: 0020 * 1. Redistributions of source code must retain the above copyright 0021 * notice, this list of conditions and the following disclaimer. 0022 * 2. Redistributions in binary form must reproduce the above copyright 0023 * notice, this list of conditions and the following disclaimer in the 0024 * documentation and/or other materials provided with the distribution. 0025 * 0026 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 0027 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 0028 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 0029 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE 0030 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 0031 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 0032 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 0033 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 0034 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 0035 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 0036 * POSSIBILITY OF SUCH DAMAGE. 0037 */ 0038 0039 #ifdef HAVE_CONFIG_H 0040 #include "config.h" 0041 #endif 0042 0043 #include <rtems/rtems/support.h> 0044 #include <rtems/score/apimutex.h> 0045 #include <rtems/score/heapimpl.h> 0046 #include <rtems/score/threaddispatch.h> 0047 #include <rtems/score/wkspace.h> 0048 #include <rtems/malloc.h> 0049 0050 #define SBRK_ALLOC_SIZE (128 * 1024UL * 1024UL) 0051 0052 void *rtems_workspace_greedy_allocate( 0053 const uintptr_t *block_sizes, 0054 size_t block_count 0055 ) 0056 { 0057 Heap_Control *heap = &_Workspace_Area; 0058 void *opaque; 0059 0060 rtems_heap_sbrk_greedy_allocate( heap, SBRK_ALLOC_SIZE ); 0061 0062 _RTEMS_Lock_allocator(); 0063 opaque = _Heap_Greedy_allocate( heap, block_sizes, block_count ); 0064 _RTEMS_Unlock_allocator(); 0065 0066 return opaque; 0067 } 0068 0069 void *rtems_workspace_greedy_allocate_all_except_largest( 0070 uintptr_t *allocatable_size 0071 ) 0072 { 0073 Heap_Control *heap = &_Workspace_Area; 0074 void *opaque; 0075 0076 rtems_heap_sbrk_greedy_allocate( heap, SBRK_ALLOC_SIZE ); 0077 0078 _RTEMS_Lock_allocator(); 0079 opaque = _Heap_Greedy_allocate_all_except_largest( 0080 heap, 0081 allocatable_size 0082 ); 0083 _RTEMS_Unlock_allocator(); 0084 0085 return opaque; 0086 } 0087 0088 void rtems_workspace_greedy_free( void *opaque ) 0089 { 0090 _RTEMS_Lock_allocator(); 0091 _Heap_Greedy_free( &_Workspace_Area, opaque ); 0092 _RTEMS_Unlock_allocator(); 0093 }
[ Source navigation ] | [ Diff markup ] | [ Identifier search ] | [ general search ] |
This page was automatically generated by the 2.3.7 LXR engine. The LXR team |
![]() ![]() |