mirror of
https://github.com/amd/blis.git
synced 2026-05-11 17:50:00 +00:00
b65cdc57d9
Details: - Changed all filename and function prefixes from 'bl2' to 'bli'. - Changed the "blis2.h" header filename to "blis.h" and changed all corresponding #include statements accordingly. - Fixed incorrect association for Fran in CREDITS file.
143 lines
4.6 KiB
C
143 lines
4.6 KiB
C
/*
|
|
|
|
BLIS
|
|
An object-based framework for developing high-performance BLAS-like
|
|
libraries.
|
|
|
|
Copyright (C) 2013, The University of Texas
|
|
|
|
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 of The University of Texas 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"
|
|
|
|
blksz_t* bli_blksz_obj_create( dim_t b_s,
|
|
dim_t b_d,
|
|
dim_t b_c,
|
|
dim_t b_z )
|
|
{
|
|
blksz_t* b;
|
|
|
|
b = ( blksz_t* ) bli_malloc( sizeof(blksz_t) );
|
|
|
|
bli_blksz_obj_init( b,
|
|
b_s,
|
|
b_d,
|
|
b_c,
|
|
b_z );
|
|
|
|
return b;
|
|
}
|
|
|
|
void bli_blksz_obj_init( blksz_t* b,
|
|
dim_t b_s,
|
|
dim_t b_d,
|
|
dim_t b_c,
|
|
dim_t b_z )
|
|
{
|
|
b->v[BLIS_BITVAL_FLOAT_TYPE] = b_s;
|
|
b->v[BLIS_BITVAL_DOUBLE_TYPE] = b_d;
|
|
b->v[BLIS_BITVAL_SCOMPLEX_TYPE] = b_c;
|
|
b->v[BLIS_BITVAL_DCOMPLEX_TYPE] = b_z;
|
|
}
|
|
|
|
void bli_blksz_obj_free( blksz_t* b )
|
|
{
|
|
bli_free( b );
|
|
}
|
|
|
|
dim_t bli_blksz_for_type( num_t dt,
|
|
blksz_t* b )
|
|
{
|
|
return b->v[ dt ];
|
|
}
|
|
|
|
dim_t bli_blksz_for_obj( obj_t* obj,
|
|
blksz_t* b )
|
|
{
|
|
return b->v[ bli_obj_datatype( *obj ) ];
|
|
}
|
|
|
|
dim_t bli_determine_blocksize_f( dim_t i,
|
|
dim_t dim,
|
|
obj_t* obj,
|
|
blksz_t* b )
|
|
{
|
|
num_t dt;
|
|
dim_t b_alg;
|
|
|
|
// We assume that this function is being called from an algorithm that
|
|
// is moving "forward" (ie: top to bottom, left to right, top-left
|
|
// to bottom-right).
|
|
|
|
// Extract the execution datatype and use it to query the corresponding
|
|
// blocksize value from the blksz_t object.
|
|
dt = bli_obj_execution_datatype( *obj );
|
|
b_alg = bli_blksz_for_type( dt, b );
|
|
|
|
// If we are moving "forward" (ie: top to bottom, left to right, or
|
|
// top-left to bottom-right), then return b_alg, unless dim - 1 is
|
|
// smaller, in which case we return that remaining value.
|
|
b_alg = bli_min( b_alg, dim - i );
|
|
|
|
return b_alg;
|
|
}
|
|
|
|
dim_t bli_determine_blocksize_b( dim_t i,
|
|
dim_t dim,
|
|
obj_t* obj,
|
|
blksz_t* b )
|
|
{
|
|
num_t dt;
|
|
dim_t b_alg;
|
|
dim_t dim_left;
|
|
|
|
// We assume that this function is being called from an algorithm that
|
|
// is moving "backward" (ie: bottom to top, right to left, bottom-right
|
|
// to top-left).
|
|
|
|
// Extract the execution datatype and use it to query the corresponding
|
|
// blocksize value from the blksz_t object.
|
|
dt = bli_obj_execution_datatype( *obj );
|
|
b_alg = bli_blksz_for_type( dt, b );
|
|
|
|
// If it is the first iteration, AND dim is NOT a multiple of b_alg, then
|
|
// we want to return the edge-case blocksize first to allow the first
|
|
// (and subsequent) iterations' subpartitions to be aligned (provided
|
|
// that the blocksize induces subpartitions and movement along aligned
|
|
// boundaries, which should always be the case).
|
|
// If it is the first iteration but dim IS a multiple of b_alg, then we
|
|
// want to simply return b_alg as it is stored in the blocksize object.
|
|
|
|
dim_left = dim % b_alg;
|
|
|
|
if ( i == 0 && dim_left != 0 )
|
|
b_alg = dim_left;
|
|
|
|
return b_alg;
|
|
}
|
|
|