/* SPDX-License-Identifier: BSD-2-Clause */
/**
* @file
*
* @ingroup ClassicCache
*/
/*
* Copyright (c) 2014 embedded brains GmbH. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#include <rtems.h>
#include <rtems/malloc.h>
#include <rtems/score/apimutex.h>
#include <rtems/score/heapimpl.h>
#include <rtems/score/sysstate.h>
static Heap_Control cache_coherent_heap_instance;
static Heap_Control *cache_coherent_heap;
void *rtems_cache_coherent_allocate(
size_t size,
uintptr_t alignment,
uintptr_t boundary
)
{
void *ptr;
Heap_Control *heap;
_RTEMS_Lock_allocator();
heap = cache_coherent_heap;
if ( heap == NULL ) {
heap = RTEMS_Malloc_Heap;
}
ptr = _Heap_Allocate_aligned_with_boundary(
heap,
size,
alignment,
boundary
);
_RTEMS_Unlock_allocator();
return ptr;
}
void rtems_cache_coherent_free( void *ptr )
{
Heap_Control *heap;
_RTEMS_Lock_allocator();
heap = cache_coherent_heap;
if ( heap != NULL ) {
if ( _Heap_Free( heap, ptr ) ) {
heap = NULL;
} else {
heap = RTEMS_Malloc_Heap;
}
} else {
heap = RTEMS_Malloc_Heap;
}
if ( heap != NULL ) {
_Heap_Free( heap, ptr );
}
_RTEMS_Unlock_allocator();
}
static void add_area(
void *area_begin,
uintptr_t area_size
)
{
Heap_Control *heap = cache_coherent_heap;
if ( heap == NULL ) {
bool ok;
heap = &cache_coherent_heap_instance;
ok = _Heap_Initialize( heap, area_begin, area_size, 0 );
if ( ok ) {
cache_coherent_heap = heap;
}
} else {
_Heap_Extend( heap, area_begin, area_size, 0 );
}
}
void rtems_cache_coherent_add_area(
void *area_begin,
uintptr_t area_size
)
{
if ( _System_state_Is_up( _System_state_Get()) ) {
_RTEMS_Lock_allocator();
add_area( area_begin, area_size );
_RTEMS_Unlock_allocator();
} else {
add_area( area_begin, area_size );
}
}