/*
* Exercise case in heapresize.c around line 125 when new_block_size
* < min_block_size
*/
void test_case_one(void)
{
uint32_t heap_size;
void *ptr1;
uintptr_t old;
uintptr_t avail;
Heap_Resize_status hc;
puts( "Init - _Heap_Initialize (for test one) - OK" );
heap_size = _Heap_Initialize( &Heap, Memory, sizeof(Memory), 8 );
printf( "Init - Heap size=%" PRIu32 "\n", heap_size );
rtems_test_assert( heap_size );
puts( "Init - _Heap_Allocate - too large size (overflow)- not OK");
ptr1 = _Heap_Allocate( &Heap, UINTPTR_MAX );
rtems_test_assert( !ptr1 );
puts( "Init - _Heap_Allocate_aligned - OK");
ptr1 = _Heap_Allocate_aligned( &Heap, 64, 32 );
rtems_test_assert( ptr1 );
puts( "Init - _Heap_Resize_block - OK");
hc = _Heap_Resize_block( &Heap, ptr1, 4, &old, &avail );
rtems_test_assert( !hc );
}
static void test_heap_cases_1(void)
{
void *p1, *p2, *p3;
uintptr_t u1, u2;
Heap_Resize_status rsc;
/*
* Another odd case. What we are trying to do from Sergei
*
* 32-bit CPU when CPU_ALIGNMENT = 4 (most targets have 8) with the
* code like this:
*/
test_heap_default_init();
p1 = _Heap_Allocate( &TestHeap, 12 );
p2 = _Heap_Allocate( &TestHeap, 32 );
p3 = _Heap_Allocate( &TestHeap, 32 );
test_free( p2 );
p2 = _Heap_Allocate_aligned( &TestHeap, 8, 28 );
test_free( p1 );
test_free( p2 );
test_free( p3 );
/*
* Odd case in resizing a block. Again test case outline per Sergei
*/
test_heap_default_init();
p1 = _Heap_Allocate( &TestHeap, 32 );
p2 = _Heap_Allocate( &TestHeap, 8 );
p3 = _Heap_Allocate( &TestHeap, 32 );
test_free( p2 );
rsc = _Heap_Resize_block( &TestHeap, p1, 41, &u1, &u2 );
/* XXX what should we expect */
test_free( p3 );
test_free( p1 );
/*
* To tackle a special case of resizing a block in order to cover the
* code in heapresizeblock.c
*
* Re-initialise the heap, so that the blocks created from now on
* are contiguous.
*/
test_heap_default_init();
puts( "Heap Initialized" );
p1 = _Heap_Allocate( &TestHeap, 400 );
rtems_test_assert( p1 != NULL );
p2 = _Heap_Allocate( &TestHeap, 496 );
rtems_test_assert( p2 != NULL );
rsc = _Heap_Resize_block( &TestHeap, p1, 256, &u1, &u2 );
rtems_test_assert( rsc == HEAP_RESIZE_SUCCESSFUL );
test_free( p1 );
test_free( p2 );
}
void *_Protected_heap_Allocate_aligned(
Heap_Control *the_heap,
size_t size,
uint32_t alignment
)
{
void *p;
_RTEMS_Lock_allocator();
p = _Heap_Allocate_aligned( the_heap, size, alignment );
_RTEMS_Unlock_allocator();
return p;
}
/*
* Exercise case in heapallocatealigned.c around line 223 when ...
*/
void test_case_three(void)
{
uint32_t heap_size;
void *ptr1;
#if 0
Heap_Resize_status hc;
#endif
int pg, al, alloc, sz;
puts( "Init - _Heap_Allocate_aligned - request impossible - not OK");
#if 0
heap_size =
_Heap_Initialize( &Heap, Memory[32], sizeof(Memory), 1 << 16 );
ptr1 = _Heap_Allocate_aligned( &Heap, 4, 1 << 16 );
ptr1 = _Heap_Allocate_aligned( &Heap, 256, 1 << 16 );
#endif
#if 1
for ( sz=32 ; sz <= 80 ; sz+=4 ) {
for ( pg=2 ; pg < 12 ; pg++ ) {
for ( al=16 ; al >=4 ; al-- ) {
for ( alloc=4 ; alloc < sizeof(Memory)/2 ; alloc+=4 ) {
heap_size =
_Heap_Initialize( &Heap, &Memory[sz], sizeof(Memory)/2, 1 << pg );
if ( heap_size != 0 ) {
do {
ptr1 = _Heap_Allocate_aligned( &Heap, alloc, 1 <<al );
} while ( ptr1 );
}
}
}
}
}
#endif
}
/*
* Exercise case in heapresize.c around line 140 when next_is_used AND
* free_block_size < min_block_size.
*/
void test_case_two(void)
{
uint32_t heap_size;
void *ptr1;
uintptr_t old;
uintptr_t avail;
Heap_Resize_status hc;
puts( "\nInit - _Heap_Initialize (for test two) - OK" );
heap_size = _Heap_Initialize( &Heap, Memory, sizeof(Memory), 8 );
printf( "Init - Heap size=%" PRIu32 "\n", heap_size );
rtems_test_assert( heap_size );
puts( "Init - _Heap_Allocate_aligned - OK");
ptr1 = _Heap_Allocate_aligned( &Heap, 64, 4 );
rtems_test_assert( ptr1 );
puts( "Init - _Heap_Resize_block - OK");
hc = _Heap_Resize_block( &Heap, ptr1, 56, &old, &avail );
rtems_test_assert( !hc );
}
void *_Workspace_Allocate_aligned( size_t size, size_t alignment )
{
return _Heap_Allocate_aligned( &_Workspace_Area, size, alignment );
}
