mirror of
https://github.com/wiidev/usbloadergx.git
synced 2024-11-22 19:29:18 +01:00
9e79c9d99b
* code cleanup
202 lines
4.3 KiB
C++
202 lines
4.3 KiB
C++
|
|
#include "mem2.h"
|
|
#include "mem2alloc.hpp"
|
|
|
|
#include <malloc.h>
|
|
#include <string.h>
|
|
|
|
#define MEM2_PRIORITY_SIZE 2097152 //2MB
|
|
|
|
// Forbid the use of MEM2 through malloc
|
|
u32 MALLOC_MEM2 = 0;
|
|
|
|
static CMEM2Alloc g_mem2gp;
|
|
|
|
static bool g_bigGoesToMem2 = false;
|
|
|
|
extern "C"
|
|
{
|
|
|
|
void MEM2_takeBigOnes( bool b )
|
|
{
|
|
g_bigGoesToMem2 = b;
|
|
}
|
|
|
|
void MEM2_init( unsigned int mem2Size )
|
|
{
|
|
g_mem2gp.init( mem2Size );
|
|
}
|
|
|
|
void MEM2_cleanup( void )
|
|
{
|
|
g_mem2gp.cleanup();
|
|
}
|
|
|
|
void *MEM2_alloc( unsigned int s )
|
|
{
|
|
return g_mem2gp.allocate( s );
|
|
}
|
|
|
|
void MEM2_free( void *p )
|
|
{
|
|
g_mem2gp.release( p );
|
|
}
|
|
|
|
void *MEM2_realloc( void *p, unsigned int s )
|
|
{
|
|
return g_mem2gp.reallocate( p, s );
|
|
}
|
|
|
|
unsigned int MEM2_usableSize( void *p )
|
|
{
|
|
return CMEM2Alloc::usableSize( p );
|
|
}
|
|
|
|
unsigned int MEM2_freesize()
|
|
{
|
|
return g_mem2gp.FreeSize();
|
|
}
|
|
|
|
extern __typeof( malloc ) __real_malloc;
|
|
extern __typeof( calloc ) __real_calloc;
|
|
extern __typeof( realloc ) __real_realloc;
|
|
extern __typeof( memalign ) __real_memalign;
|
|
extern __typeof( free ) __real_free;
|
|
extern __typeof( malloc_usable_size ) __real_malloc_usable_size;
|
|
|
|
void *__wrap_malloc( size_t size )
|
|
{
|
|
void *p;
|
|
if ( g_bigGoesToMem2 && size > MEM2_PRIORITY_SIZE )
|
|
{
|
|
p = MEM2_alloc( size );
|
|
if ( p != 0 )
|
|
{
|
|
return p;
|
|
}
|
|
return __real_malloc( size );
|
|
}
|
|
p = __real_malloc( size );
|
|
if ( p != 0 )
|
|
{
|
|
return p;
|
|
}
|
|
return MEM2_alloc( size );
|
|
}
|
|
|
|
void *__wrap_calloc( size_t n, size_t size )
|
|
{
|
|
void *p;
|
|
if ( g_bigGoesToMem2 && size > MEM2_PRIORITY_SIZE )
|
|
{
|
|
p = MEM2_alloc( n * size );
|
|
if ( p != 0 )
|
|
{
|
|
memset( p, 0, n * size );
|
|
return p;
|
|
}
|
|
return __real_calloc( n, size );
|
|
}
|
|
p = __real_calloc( n, size );
|
|
if ( p != 0 )
|
|
{
|
|
return p;
|
|
}
|
|
p = MEM2_alloc( n * size );
|
|
if ( p != 0 )
|
|
{
|
|
memset( p, 0, n * size );
|
|
}
|
|
return p;
|
|
}
|
|
|
|
void *__wrap_memalign( size_t a, size_t size )
|
|
{
|
|
void *p;
|
|
if ( g_bigGoesToMem2 && size > MEM2_PRIORITY_SIZE )
|
|
{
|
|
if ( a <= 32 && 32 % a == 0 )
|
|
{
|
|
p = MEM2_alloc( size );
|
|
if ( p != 0 )
|
|
{
|
|
return p;
|
|
}
|
|
}
|
|
return __real_memalign( a, size );
|
|
}
|
|
p = __real_memalign( a, size );
|
|
if ( p != 0 || a > 32 || 32 % a != 0 )
|
|
{
|
|
return p;
|
|
}
|
|
|
|
return MEM2_alloc( size );
|
|
}
|
|
|
|
void __wrap_free( void *p )
|
|
{
|
|
if ( !p )
|
|
return;
|
|
|
|
if ( ( ( u32 )p & 0x10000000 ) != 0 )
|
|
{
|
|
MEM2_free( p );
|
|
}
|
|
else
|
|
{
|
|
__real_free( p );
|
|
}
|
|
}
|
|
|
|
void *__wrap_realloc( void *p, size_t size )
|
|
{
|
|
void *n;
|
|
// ptr from mem2
|
|
if ( ( ( u32 )p & 0x10000000 ) != 0 || ( p == 0 && g_bigGoesToMem2 && size > MEM2_PRIORITY_SIZE ) )
|
|
{
|
|
n = MEM2_realloc( p, size );
|
|
if ( n != 0 )
|
|
{
|
|
return n;
|
|
}
|
|
n = __real_malloc( size );
|
|
if ( n == 0 )
|
|
{
|
|
return 0;
|
|
}
|
|
if ( p != 0 )
|
|
{
|
|
memcpy( n, p, MEM2_usableSize( p ) < size ? MEM2_usableSize( p ) : size );
|
|
MEM2_free( p );
|
|
}
|
|
return n;
|
|
}
|
|
// ptr from malloc
|
|
n = __real_realloc( p, size );
|
|
if ( n != 0 )
|
|
{
|
|
return n;
|
|
}
|
|
n = MEM2_alloc( size );
|
|
if ( n == 0 )
|
|
{
|
|
return 0;
|
|
}
|
|
if ( p != 0 )
|
|
{
|
|
memcpy( n, p, __real_malloc_usable_size( p ) < size ? __real_malloc_usable_size( p ) : size );
|
|
__real_free( p );
|
|
}
|
|
return n;
|
|
}
|
|
|
|
size_t __wrap_malloc_usable_size( void *p )
|
|
{
|
|
if ( ( ( u32 )p & 0x10000000 ) != 0 )
|
|
return MEM2_usableSize( p );
|
|
return __real_malloc_usable_size( p );
|
|
}
|
|
|
|
} ///extern "C"
|