mirror of
https://github.com/ipxe/ipxe
synced 2025-12-22 13:00:39 +03:00
[linux] Make malloc and linux_umalloc valgrindable
Make the allocators used by malloc and linux_umalloc valgrindable. Include valgrind headers in the codebase to avoid a build dependency on valgrind. Signed-off-by: Piotr Jaroszyński <p.jaroszynski@gmail.com> Modified-by: Michael Brown <mcb30@ipxe.org> Signed-off-by: Michael Brown <mcb30@ipxe.org>
This commit is contained in:
committed by
Michael Brown
parent
3c1bdfd5d9
commit
b604e8a388
@@ -27,6 +27,7 @@ FILE_LICENCE ( GPL2_OR_LATER );
|
||||
#include <ipxe/init.h>
|
||||
#include <ipxe/refcnt.h>
|
||||
#include <ipxe/malloc.h>
|
||||
#include <valgrind/memcheck.h>
|
||||
|
||||
/** @file
|
||||
*
|
||||
@@ -97,6 +98,37 @@ size_t freemem;
|
||||
/** The heap itself */
|
||||
static char heap[HEAP_SIZE] __attribute__ (( aligned ( __alignof__(void *) )));
|
||||
|
||||
/**
|
||||
* Mark all blocks in free list as defined
|
||||
*
|
||||
*/
|
||||
static inline void valgrind_make_blocks_defined ( void ) {
|
||||
struct memory_block *block;
|
||||
|
||||
if ( RUNNING_ON_VALGRIND > 0 ) {
|
||||
VALGRIND_MAKE_MEM_DEFINED ( &free_blocks,
|
||||
sizeof ( free_blocks ) );
|
||||
list_for_each_entry ( block, &free_blocks, list )
|
||||
VALGRIND_MAKE_MEM_DEFINED ( block, sizeof ( *block ) );
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* Mark all blocks in free list as inaccessible
|
||||
*
|
||||
*/
|
||||
static inline void valgrind_make_blocks_noaccess ( void ) {
|
||||
struct memory_block *block;
|
||||
struct memory_block *tmp;
|
||||
|
||||
if ( RUNNING_ON_VALGRIND > 0 ) {
|
||||
list_for_each_entry_safe ( block, tmp, &free_blocks, list )
|
||||
VALGRIND_MAKE_MEM_NOACCESS ( block, sizeof ( *block ) );
|
||||
VALGRIND_MAKE_MEM_NOACCESS ( &free_blocks,
|
||||
sizeof ( free_blocks ) );
|
||||
}
|
||||
}
|
||||
|
||||
/**
|
||||
* Discard some cached data
|
||||
*
|
||||
@@ -131,6 +163,9 @@ void * alloc_memblock ( size_t size, size_t align ) {
|
||||
ssize_t post_size;
|
||||
struct memory_block *pre;
|
||||
struct memory_block *post;
|
||||
struct memory_block *ptr;
|
||||
|
||||
valgrind_make_blocks_defined();
|
||||
|
||||
/* Round up size to multiple of MIN_MEMBLOCK_SIZE and
|
||||
* calculate alignment mask.
|
||||
@@ -163,6 +198,8 @@ void * alloc_memblock ( size_t size, size_t align ) {
|
||||
* the heap).
|
||||
*/
|
||||
if ( (size_t) post_size >= MIN_MEMBLOCK_SIZE ) {
|
||||
VALGRIND_MAKE_MEM_DEFINED ( post,
|
||||
sizeof ( *post ) );
|
||||
post->size = post_size;
|
||||
list_add ( &post->list, &pre->list );
|
||||
}
|
||||
@@ -183,7 +220,8 @@ void * alloc_memblock ( size_t size, size_t align ) {
|
||||
/* Return allocated block */
|
||||
DBG ( "Allocated [%p,%p)\n", block,
|
||||
( ( ( void * ) block ) + size ) );
|
||||
return block;
|
||||
ptr = block;
|
||||
goto done;
|
||||
}
|
||||
}
|
||||
|
||||
@@ -192,9 +230,14 @@ void * alloc_memblock ( size_t size, size_t align ) {
|
||||
/* Nothing available to discard */
|
||||
DBG ( "Failed to allocate %#zx (aligned %#zx)\n",
|
||||
size, align );
|
||||
return NULL;
|
||||
ptr = NULL;
|
||||
goto done;
|
||||
}
|
||||
}
|
||||
|
||||
done:
|
||||
valgrind_make_blocks_noaccess();
|
||||
return ptr;
|
||||
}
|
||||
|
||||
/**
|
||||
@@ -216,11 +259,14 @@ void free_memblock ( void *ptr, size_t size ) {
|
||||
if ( ! ptr )
|
||||
return;
|
||||
|
||||
valgrind_make_blocks_defined();
|
||||
|
||||
/* Round up size to match actual size that alloc_memblock()
|
||||
* would have used.
|
||||
*/
|
||||
size = ( size + MIN_MEMBLOCK_SIZE - 1 ) & ~( MIN_MEMBLOCK_SIZE - 1 );
|
||||
freeing = ptr;
|
||||
VALGRIND_MAKE_MEM_DEFINED ( freeing, sizeof ( *freeing ) );
|
||||
freeing->size = size;
|
||||
DBG ( "Freeing [%p,%p)\n", freeing, ( ( ( void * ) freeing ) + size ));
|
||||
|
||||
@@ -263,6 +309,8 @@ void free_memblock ( void *ptr, size_t size ) {
|
||||
|
||||
/* Update free memory counter */
|
||||
freemem += size;
|
||||
|
||||
valgrind_make_blocks_noaccess();
|
||||
}
|
||||
|
||||
/**
|
||||
@@ -302,8 +350,11 @@ void * realloc ( void *old_ptr, size_t new_size ) {
|
||||
new_block = alloc_memblock ( new_total_size, 1 );
|
||||
if ( ! new_block )
|
||||
return NULL;
|
||||
VALGRIND_MAKE_MEM_UNDEFINED ( new_block, offsetof ( struct autosized_block, data ) );
|
||||
new_block->size = new_total_size;
|
||||
VALGRIND_MAKE_MEM_NOACCESS ( new_block, offsetof ( struct autosized_block, data ) );
|
||||
new_ptr = &new_block->data;
|
||||
VALGRIND_MALLOCLIKE_BLOCK ( new_ptr, new_size, 0, 0 );
|
||||
}
|
||||
|
||||
/* Copy across relevant part of the old data region (if any),
|
||||
@@ -314,12 +365,15 @@ void * realloc ( void *old_ptr, size_t new_size ) {
|
||||
if ( old_ptr && ( old_ptr != NOWHERE ) ) {
|
||||
old_block = container_of ( old_ptr, struct autosized_block,
|
||||
data );
|
||||
VALGRIND_MAKE_MEM_DEFINED ( old_block, offsetof ( struct autosized_block, data ) );
|
||||
old_total_size = old_block->size;
|
||||
old_size = ( old_total_size -
|
||||
offsetof ( struct autosized_block, data ) );
|
||||
memcpy ( new_ptr, old_ptr,
|
||||
( ( old_size < new_size ) ? old_size : new_size ) );
|
||||
free_memblock ( old_block, old_total_size );
|
||||
VALGRIND_MAKE_MEM_NOACCESS ( old_block, offsetof ( struct autosized_block, data ) );
|
||||
VALGRIND_FREELIKE_BLOCK ( old_ptr, 0 );
|
||||
}
|
||||
|
||||
return new_ptr;
|
||||
@@ -395,6 +449,7 @@ void mpopulate ( void *start, size_t len ) {
|
||||
*
|
||||
*/
|
||||
static void init_heap ( void ) {
|
||||
VALGRIND_MAKE_MEM_NOACCESS ( heap, sizeof ( heap ) );
|
||||
mpopulate ( heap, sizeof ( heap ) );
|
||||
}
|
||||
|
||||
|
||||
Reference in New Issue
Block a user