shared/start/stackalloc.c

0001 /* SPDX-License-Identifier: BSD-2-Clause */
0002
0003 /**
0004  * @file
0005  *
0006  * @ingroup bsp_stack
0007  *
0008  * @brief Stack initialization, allocation and free functions.
0009  */
0010
0011 /*
0012  * Copyright (C) 2009, 2013 embedded brains GmbH & Co. KG
0013  *
0014  * Redistribution and use in source and binary forms, with or without
0015  * modification, are permitted provided that the following conditions
0016  * are met:
0017  * 1. Redistributions of source code must retain the above copyright
0018  *    notice, this list of conditions and the following disclaimer.
0019  * 2. Redistributions in binary form must reproduce the above copyright
0020  *    notice, this list of conditions and the following disclaimer in the
0021  *    documentation and/or other materials provided with the distribution.
0022  *
0023  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
0024  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
0025  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
0026  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
0027  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
0028  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
0029  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
0030  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
0031  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
0032  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
0033  * POSSIBILITY OF SUCH DAMAGE.
0034  */
0035
0036 #include <bsp/stackalloc.h>
0037
0038 #include <rtems.h>
0039 #include <rtems/score/heapimpl.h>
0040 #include <rtems/score/wkspace.h>
0041
0042 #include <bsp/linker-symbols.h>
0043
0044 static Heap_Control bsp_stack_heap;
0045
0046 void bsp_stack_allocate_init(size_t stack_space_size)
0047 {
0048   _Heap_Initialize(
0049     &bsp_stack_heap,
0050     bsp_section_stack_begin,
0051     (uintptr_t) bsp_section_stack_size,
0052     CPU_STACK_ALIGNMENT
0053   );
0054 }
0055
0056 void *bsp_stack_allocate(size_t size)
0057 {
0058   void *stack = NULL;
0059
0060   if (bsp_stack_heap.area_begin != 0) {
0061     stack = _Heap_Allocate(&bsp_stack_heap, size);
0062   }
0063
0064   if (stack == NULL) {
0065     stack = _Workspace_Allocate(size);
0066   }
0067
0068   return stack;
0069 }
0070
0071 void bsp_stack_free(void *stack)
0072 {
0073   bool ok = _Heap_Free(&bsp_stack_heap, stack);
0074
0075   if (!ok) {
0076     _Workspace_Free(stack);
0077   }
0078 }