1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295
|
/*
BLIS
An object-based framework for developing high-performance BLAS-like
libraries.
Copyright (C) 2014, The University of Texas at Austin
Copyright (C) 2018 - 2019, Advanced Micro Devices, Inc.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are
met:
- Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
- 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.
- Neither the name(s) of the copyright holder(s) nor the names of its
contributors may be used to endorse or promote products derived
from this software without specific prior written permission.
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
HOLDER 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.
*/
#include "blis.h"
//#define BLIS_ENABLE_MEM_TRACING
// -----------------------------------------------------------------------------
// NOTE: These functions are no longer used. Instead, the relevant sections
// of code call bli_fmalloc_align() and pass in the desired malloc()-like
// function, such as BLIS_MALLOC_POOL.
#if 0
void* bli_malloc_pool( size_t size )
{
const malloc_ft malloc_fp = BLIS_MALLOC_POOL;
const size_t align_size = BLIS_POOL_ADDR_ALIGN_SIZE;
#ifdef BLIS_ENABLE_MEM_TRACING
printf( "bli_malloc_pool(): size %ld, align size %ld\n",
( long )size, ( long )align_size );
fflush( stdout );
#endif
return bli_fmalloc_align( malloc_fp, size, align_size );
}
void bli_free_pool( void* p )
{
#ifdef BLIS_ENABLE_MEM_TRACING
printf( "bli_free_pool(): freeing block\n" );
fflush( stdout );
#endif
bli_ffree_align( BLIS_FREE_POOL, p );
}
#endif
// -----------------------------------------------------------------------------
void* bli_malloc_user( size_t size, err_t* r_val )
{
const malloc_ft malloc_fp = BLIS_MALLOC_USER;
const size_t align_size = BLIS_HEAP_ADDR_ALIGN_SIZE;
#ifdef BLIS_ENABLE_MEM_TRACING
printf( "bli_malloc_user(): size %ld, align size %ld\n",
( long )size, ( long )align_size );
fflush( stdout );
#endif
void* p = bli_fmalloc_align( malloc_fp, size, align_size, r_val );
return p;
}
void bli_free_user( void* p )
{
#ifdef BLIS_ENABLE_MEM_TRACING
printf( "bli_free_user(): freeing block\n" );
fflush( stdout );
#endif
bli_ffree_align( BLIS_FREE_USER, p );
}
// -----------------------------------------------------------------------------
void* bli_malloc_intl( size_t size, err_t* r_val )
{
const malloc_ft malloc_fp = BLIS_MALLOC_INTL;
#ifdef BLIS_ENABLE_MEM_TRACING
printf( "bli_malloc_intl(): size %ld\n", ( long )size );
fflush( stdout );
#endif
void* p = bli_fmalloc_noalign( malloc_fp, size, r_val );
return p;
}
void* bli_calloc_intl( size_t size, err_t* r_val )
{
#ifdef BLIS_ENABLE_MEM_TRACING
printf( "bli_calloc_intl(): " );
#endif
void* p = bli_malloc_intl( size, r_val );
if ( bli_is_success( *r_val ) )
memset( p, 0, size );
return p;
}
void bli_free_intl( void* p )
{
#ifdef BLIS_ENABLE_MEM_TRACING
printf( "bli_free_intl(): freeing block\n" );
fflush( stdout );
#endif
bli_ffree_noalign( BLIS_FREE_INTL, p );
}
// -----------------------------------------------------------------------------
void* bli_fmalloc_align
(
malloc_ft f,
size_t size,
size_t align_size,
err_t* r_val
)
{
const size_t ptr_size = sizeof( void* );
size_t align_offset = 0;
void* p_orig;
int8_t* p_byte;
void** p_addr;
// Check parameters.
if ( bli_error_checking_is_enabled() )
bli_fmalloc_align_check( f, size, align_size );
// Return early if zero bytes were requested.
if ( size == 0 ) return NULL;
// Add the alignment size and the size of a pointer to the number
// of bytes to allocate.
size += align_size + ptr_size;
// Call the allocation function.
p_orig = f( size );
// Check the pointer returned by malloc().
if ( bli_error_checking_is_enabled() )
bli_fmalloc_post_check( p_orig );
// The pseudo-return value isn't used yet.
*r_val = BLIS_SUCCESS;
// Advance the pointer by one pointer element.
p_byte = p_orig;
p_byte += ptr_size;
// Compute the offset to the desired alignment.
if ( bli_is_unaligned_to( ( siz_t )p_byte, ( siz_t )align_size ) )
{
align_offset = align_size -
bli_offset_past_alignment( ( siz_t )p_byte,
( siz_t )align_size );
}
// Advance the pointer using the difference between the alignment
// size and the alignment offset.
p_byte += align_offset;
// Compute the address of the pointer element just before the start
// of the aligned address, and store the original address there.
p_addr = ( void** )(p_byte - ptr_size);
*p_addr = p_orig;
// Return the aligned pointer.
return p_byte;
}
void bli_ffree_align
(
free_ft f,
void* p
)
{
const size_t ptr_size = sizeof( void* );
void* p_orig;
int8_t* p_byte;
void** p_addr;
// If the pointer to free is NULL, it was obviously not aligned and
// does not need to be freed.
if ( p == NULL ) return;
// Since the bli_fmalloc_align() function returned the aligned pointer,
// we have to first recover the original pointer before we can free the
// memory.
// Start by casting the pointer to a byte pointer.
p_byte = p;
// Compute the address of the pointer element just before the start
// of the aligned address, and recover the original address.
p_addr = ( void** )( p_byte - ptr_size );
p_orig = *p_addr;
// Free the original pointer.
f( p_orig );
}
// -----------------------------------------------------------------------------
void* bli_fmalloc_noalign
(
malloc_ft f,
size_t size,
err_t* r_val
)
{
void* p = f( size );
// Check the pointer returned by malloc().
if ( bli_error_checking_is_enabled() )
bli_fmalloc_post_check( p );
// The pseudo-return value isn't used yet.
*r_val = BLIS_SUCCESS;
return p;
}
void bli_ffree_noalign
(
free_ft f,
void* p
)
{
f( p );
}
// -----------------------------------------------------------------------------
void bli_fmalloc_align_check
(
malloc_ft f,
size_t size,
size_t align_size
)
{
err_t e_val;
// Check for valid alignment.
e_val = bli_check_alignment_is_power_of_two( align_size );
bli_check_error_code( e_val );
e_val = bli_check_alignment_is_mult_of_ptr_size( align_size );
bli_check_error_code( e_val );
}
void bli_fmalloc_post_check
(
void* p
)
{
err_t e_val;
// Check for valid values from malloc().
e_val = bli_check_valid_malloc_buf( p );
bli_check_error_code( e_val );
}
|