YourWishes/jerryscript
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Introducing 'try to give memory back' callback for heap allocator to use upon allocation request that can not be satisfied by the allocator.

Browse Source
This commit is contained in:
Ruben Ayrapetyan
2014-12-18 21:20:28 +03:00
parent 8febd2bae8
commit 6bb39bb8ea
14 changed files with 308 additions and 105 deletions
Download Patch File Download Diff File Expand all files Collapse all files
tests/unit/test_heap.c
+89 -47
View File
@@ -23,16 +23,61 @@ extern int printf (__const char *__restrict __format, ...);
extern void *memset (void *__s, int __c, size_t __n);
// Heap size is 32K
const size_t test_heap_size = 32 * 1024;
#define test_heap_size (32 * 1024)
// Iterations count
const uint32_t test_iters = 64 * 1024;
#define test_iters (64 * 1024)
// Subiterations count
const uint32_t test_sub_iters = 32;
#define test_sub_iters 32
// Threshold size of block to allocate
const uint32_t test_threshold_block_size = 8192;
#define test_threshold_block_size 8192
uint8_t *ptrs[test_sub_iters];
size_t sizes[test_sub_iters];
static void
test_heap_give_some_memory_back (mem_try_give_memory_back_severity_t severity)
{
int p;
if (severity == MEM_TRY_GIVE_MEMORY_BACK_SEVERITY_LOW)
{
p = 8;
}
else if (severity == MEM_TRY_GIVE_MEMORY_BACK_SEVERITY_MEDIUM)
{
p = 4;
}
else if (severity == MEM_TRY_GIVE_MEMORY_BACK_SEVERITY_HIGH)
{
p = 2;
}
else
{
JERRY_ASSERT (severity == MEM_TRY_GIVE_MEMORY_BACK_SEVERITY_CRITICAL);
p = 1;
}
for (int i = 0; i < test_sub_iters; i++)
{
if (rand() % p == 0)
{
if (ptrs[i] != NULL)
{
for( size_t k = 0; k < sizes[i]; k++ )
{
JERRY_ASSERT( ptrs[i][k] == 0 );
}
mem_heap_free_block (ptrs[i]);
ptrs[i] = NULL;
}
}
}
} /* test_heap_give_some_memory_back */
int
main( int __unused argc,
@@ -47,58 +92,55 @@ main( int __unused argc,
printf("seed=%d\n", k);
srand((unsigned int) k);
mem_heap_print( true, false, true);
mem_register_a_try_give_memory_back_callback (test_heap_give_some_memory_back);
mem_heap_print (true, false, true);
for ( uint32_t i = 0; i < test_iters; i++ )
{
const uint32_t subiters = test_sub_iters;
uint8_t * ptrs[subiters];
size_t sizes[subiters];
for ( uint32_t j = 0; j < test_sub_iters; j++ )
{
size_t size = (unsigned int) rand() % ( test_threshold_block_size );
ptrs[j] = mem_heap_alloc_block( size, ( rand() % 2 ) ? MEM_HEAP_ALLOC_SHORT_TERM : MEM_HEAP_ALLOC_SHORT_TERM);
sizes[j] = size;
for ( uint32_t j = 0; j < subiters; j++ )
JERRY_ASSERT(size == 0 || ptrs[j] != NULL);
memset(ptrs[j], 0, sizes[j]);
}
// mem_heap_print( true);
for ( uint32_t j = 0; j < test_sub_iters; j++ )
{
if ( ptrs[j] != NULL && (rand () % 2) == 0 )
{
size_t size = (unsigned int) rand() % ( test_threshold_block_size );
ptrs[j] = mem_heap_alloc_block( size, ( rand() % 2 ) ? MEM_HEAP_ALLOC_SHORT_TERM : MEM_HEAP_ALLOC_SHORT_TERM);
sizes[j] = size;
if ( ptrs[j] != NULL )
{
memset(ptrs[j], 0, sizes[j]);
}
// JERRY_ASSERT(ptrs[j] != NULL);
for( size_t k = 0; k < sizes[j]; k++ )
{
JERRY_ASSERT(ptrs[j][k] == 0);
}
size_t new_size = (unsigned int) rand() % ( test_threshold_block_size );
if (mem_heap_try_resize_block (ptrs[j], new_size))
{
sizes[j] = new_size;
memset (ptrs[j], 0, sizes[j]);
}
}
}
// mem_heap_print( true);
for ( uint32_t j = 0; j < subiters; j++ )
for ( uint32_t j = 0; j < test_sub_iters; j++ )
{
if ( ptrs[j] != NULL )
{
if ( ptrs[j] != NULL && (rand () % 2) == 0 )
{
for( size_t k = 0; k < sizes[j]; k++ )
{
JERRY_ASSERT( ptrs[j][k] == 0 );
}
size_t new_size = (unsigned int) rand() % ( test_threshold_block_size );
if (mem_heap_try_resize_block (ptrs[j], new_size))
{
sizes[j] = new_size;
memset (ptrs[j], 0, sizes[j]);
}
}
}
for ( uint32_t j = 0; j < subiters; j++ )
{
if ( ptrs[j] != NULL )
{
for( size_t k = 0; k < sizes[j]; k++ )
{
JERRY_ASSERT( ptrs[j][k] == 0 );
}
mem_heap_free_block( ptrs[j]);
}
for( size_t k = 0; k < sizes[j]; k++ )
{
JERRY_ASSERT( ptrs[j][k] == 0 );
}
mem_heap_free_block (ptrs[j]);
ptrs[j] = NULL;
}
}
}
mem_heap_print( true, false, true);