amd/blis
1
0
Fork 0
mirror of https://github.com/amd/blis.git synced 2026-05-21 17:08:17 +00:00
Code Issues Packages Projects Releases Wiki Activity
Files
aedccbc85d491e41711a0c6eb0d246d8700a199a
blis/frame/base/bl2_part.c
Field G. Van Zee 1274e12437 Updated copyright headers from 2012 to 2013.
2013-02-11 14:37:47 -06:00

648 lines
19 KiB
C
Raw Blame History

/*
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 "blis2.h"
// -- Matrix partitioning ------------------------------------------------------
void bl2_acquire_mpart_t2b( subpart_t requested_part,
dim_t i,
dim_t b,
obj_t* obj,
obj_t* sub_obj )
{
dim_t m;
dim_t n;
dim_t m_part = 0;
dim_t n_part = 0;
inc_t offm_inc = 0;
inc_t offn_inc = 0;
doff_t diag_off_inc;
// Call a special function for partitioning packed objects.
if ( bl2_obj_is_packed( *obj ) )
{
bl2_packm_acquire_mpart_t2b( requested_part, i, b, obj, sub_obj );
return;
}
// Check parameters.
if ( bl2_error_checking_is_enabled() )
bl2_acquire_mpart_t2b_check( requested_part, i, b, obj, sub_obj );
// Query the m and n dimensions of the object (accounting for
// transposition, if indicated).
if ( bl2_obj_has_notrans( *obj ) )
{
m = bl2_obj_length( *obj );
n = bl2_obj_width( *obj );
}
else // if ( bl2_obj_has_trans( *obj ) )
{
m = bl2_obj_width( *obj );
n = bl2_obj_length( *obj );
}
// Foolproofing: do not let b exceed what's left of the m dimension at
// row offset i.
if ( b > m - i ) b = m - i;
// Compute offset increments and dimensions based on which
// subpartition is being requested, assuming no transposition.
if ( requested_part == BLIS_SUBPART0 )
{
// A0 (offm,offn) unchanged.
// A0 is i x n.
offm_inc = 0;
offn_inc = 0;
m_part = i;
n_part = n;
}
else if ( requested_part == BLIS_SUBPART1 )
{
// A1 (offm,offn) += (i,0).
// A1 is b x n.
offm_inc = i;
offn_inc = 0;
m_part = b;
n_part = n;
}
else // if ( requested_part == BLIS_SUBPART2 )
{
// A2 (offm,offn) += (i+b,0).
// A2 is (m-i-b) x n.
offm_inc = i + b;
offn_inc = 0;
m_part = m - i - b;
n_part = n;
}
// Compute the diagonal offset based on the m and n offsets.
diag_off_inc = ( doff_t )offm_inc - ( doff_t )offn_inc;
// Begin by copying the info, elem size, buffer, row stride, and column
// stride fields of the parent object. Note that this omits copying view
// information because the new partition will have its own dimensions
// and offsets.
bl2_obj_init_subpart_from( *obj, *sub_obj );
// Modify offsets and dimensions of requested partition based on
// whether it needs to be transposed.
if ( bl2_obj_has_notrans( *obj ) )
{
bl2_obj_set_dims( m_part, n_part, *sub_obj );
bl2_obj_inc_offs( offm_inc, offn_inc, *sub_obj );
bl2_obj_inc_diag_off( diag_off_inc, *sub_obj );
}
else // if ( bl2_obj_has_trans( *obj ) )
{
bl2_obj_set_dims( n_part, m_part, *sub_obj );
bl2_obj_inc_offs( offn_inc, offm_inc, *sub_obj );
bl2_obj_inc_diag_off( -diag_off_inc, *sub_obj );
}
// If the root matrix is not general (ie: has structure defined by the
// diagonal), and the subpartition does not intersect the root matrix's
// diagonal, then set the subpartition structure to "general"; otherwise
// we let the subpartition inherit the storage structure of its immediate
// parent.
if ( !bl2_obj_root_is_general( *sub_obj ) &&
bl2_obj_is_outside_diag( *sub_obj ) )
{
// NOTE: This comment may be out-of-date since we now distinguish
// between uplo properties for the current and root objects...
// Note that we cannot mark the subpartition object as general/dense
// here since it makes sense to preserve the existing uplo information
// a while longer so that the correct kernels are invoked. (Example:
// incremental packing/computing in herk produces subpartitions that
// appear general/dense, but their uplo fields are needed to be either
// lower or upper, to determine which macro-kernel gets called in the
// herk_int() back-end.)
// If the subpartition lies entirely in an "unstored" triangle of the
// root matrix, then we need to tweak the subpartition. If the root
// matrix is Hermitian or symmetric, then we reflect the partition to
// the other side of the diagonal, toggling the transposition bit (and
// conjugation bit if the root matrix is Hermitian). Or, if the root
// matrix is triangular, the subpartition should be marked as zero.
if ( bl2_obj_is_unstored_subpart( *sub_obj ) )
{
if ( bl2_obj_root_is_hermitian( *sub_obj ) )
{
bl2_obj_reflect_about_diag( *sub_obj );
bl2_obj_toggle_conj( *sub_obj );
}
else if ( bl2_obj_root_is_symmetric( *sub_obj ) )
{
bl2_obj_reflect_about_diag( *sub_obj );
}
else if ( bl2_obj_root_is_triangular( *sub_obj ) )
{
bl2_obj_set_uplo( BLIS_ZEROS, *sub_obj );
}
}
}
}
void bl2_acquire_mpart_b2t( subpart_t requested_part,
dim_t i,
dim_t b,
obj_t* obj,
obj_t* sub_obj )
{
dim_t m;
// Query the dimension in the partitioning direction.
m = bl2_obj_length_after_trans( *obj );
// Modify i to account for the fact that we are moving backwards.
i = m - i - b;
bl2_acquire_mpart_t2b( requested_part, i, b, obj, sub_obj );
}
void bl2_acquire_mpart_l2r( subpart_t requested_part,
dim_t j,
dim_t b,
obj_t* obj,
obj_t* sub_obj )
{
dim_t m;
dim_t n;
dim_t m_part = 0;
dim_t n_part = 0;
inc_t offm_inc = 0;
inc_t offn_inc = 0;
doff_t diag_off_inc;
// Call a special function for partitioning packed objects.
if ( bl2_obj_is_packed( *obj ) )
{
bl2_packm_acquire_mpart_l2r( requested_part, j, b, obj, sub_obj );
return;
}
// Check parameters.
if ( bl2_error_checking_is_enabled() )
bl2_acquire_mpart_l2r_check( requested_part, j, b, obj, sub_obj );
// Query the m and n dimensions of the object (accounting for
// transposition, if indicated).
if ( bl2_obj_has_notrans( *obj ) )
{
m = bl2_obj_length( *obj );
n = bl2_obj_width( *obj );
}
else // if ( bl2_obj_has_trans( *obj ) )
{
m = bl2_obj_width( *obj );
n = bl2_obj_length( *obj );
}
// Foolproofing: do not let b exceed what's left of the n dimension at
// column offset j.
if ( b > n - j ) b = n - j;
// Compute offset increments and dimensions based on which
// subpartition is being requested, assuming no transposition.
if ( requested_part == BLIS_SUBPART0 )
{
// A0 (offm,offn) unchanged.
// A0 is m x j.
offm_inc = 0;
offn_inc = 0;
m_part = m;
n_part = j;
}
else if ( requested_part == BLIS_SUBPART1 )
{
// A1 (offm,offn) += (0,j).
// A1 is m x b.
offm_inc = 0;
offn_inc = j;
m_part = m;
n_part = b;
}
else // if ( requested_part == BLIS_SUBPART2 )
{
// A2 (offm,offn) += (0,j+b).
// A2 is m x (n-j-b).
offm_inc = 0;
offn_inc = j + b;
m_part = m;
n_part = n - j - b;
}
// Compute the diagonal offset based on the m and n offsets.
diag_off_inc = ( doff_t )offm_inc - ( doff_t )offn_inc;
// Begin by copying the info, elem size, buffer, row stride, and column
// stride fields of the parent object. Note that this omits copying view
// information because the new partition will have its own dimensions
// and offsets.
bl2_obj_init_subpart_from( *obj, *sub_obj );
// Modify offsets and dimensions of requested partition based on
// whether it needs to be transposed.
if ( bl2_obj_has_notrans( *obj ) )
{
bl2_obj_set_dims( m_part, n_part, *sub_obj );
bl2_obj_inc_offs( offm_inc, offn_inc, *sub_obj );
bl2_obj_inc_diag_off( diag_off_inc, *sub_obj );
}
else // if ( bl2_obj_has_trans( *obj ) )
{
bl2_obj_set_dims( n_part, m_part, *sub_obj );
bl2_obj_inc_offs( offn_inc, offm_inc, *sub_obj );
bl2_obj_inc_diag_off( -diag_off_inc, *sub_obj );
}
// If the root matrix is not general (ie: has structure defined by the
// diagonal), and the subpartition does not intersect the root matrix's
// diagonal, then we might need to modify some of the subpartition's
// properties, depending on its structure type.
if ( !bl2_obj_root_is_general( *sub_obj ) &&
bl2_obj_is_outside_diag( *sub_obj ) )
{
// NOTE: This comment may be out-of-date since we now distinguish
// between uplo properties for the current and root objects...
// Note that we cannot mark the subpartition object as general/dense
// here since it makes sense to preserve the existing uplo information
// a while longer so that the correct kernels are invoked. (Example:
// incremental packing/computing in herk produces subpartitions that
// appear general/dense, but their uplo fields are needed to be either
// lower or upper, to determine which macro-kernel gets called in the
// herk_int() back-end.)
// If the subpartition lies entirely in an "unstored" triangle of the
// root matrix, then we need to tweak the subpartition. If the root
// matrix is Hermitian or symmetric, then we reflect the partition to
// the other side of the diagonal, toggling the transposition bit (and
// conjugation bit if the root matrix is Hermitian). Or, if the root
// matrix is triangular, the subpartition should be marked as zero.
if ( bl2_obj_is_unstored_subpart( *sub_obj ) )
{
if ( bl2_obj_root_is_hermitian( *sub_obj ) )
{
bl2_obj_reflect_about_diag( *sub_obj );
bl2_obj_toggle_conj( *sub_obj );
}
else if ( bl2_obj_root_is_symmetric( *sub_obj ) )
{
bl2_obj_reflect_about_diag( *sub_obj );
}
else if ( bl2_obj_root_is_triangular( *sub_obj ) )
{
bl2_obj_set_uplo( BLIS_ZEROS, *sub_obj );
}
}
}
}
void bl2_acquire_mpart_r2l( subpart_t requested_part,
dim_t j,
dim_t b,
obj_t* obj,
obj_t* sub_obj )
{
dim_t n;
// Query the dimension in the partitioning direction.
n = bl2_obj_width_after_trans( *obj );
// Modify i to account for the fact that we are moving backwards.
j = n - j - b;
bl2_acquire_mpart_l2r( requested_part, j, b, obj, sub_obj );
}
void bl2_acquire_mpart_tl2br( subpart_t requested_part,
dim_t ij,
dim_t b,
obj_t* obj,
obj_t* sub_obj )
{
dim_t m;
dim_t n;
dim_t min_m_n;
dim_t m_part = 0;
dim_t n_part = 0;
inc_t offm_inc = 0;
inc_t offn_inc = 0;
doff_t diag_off_inc;
// Call a special function for partitioning packed objects.
if ( bl2_obj_is_packed( *obj ) )
{
bl2_packm_acquire_mpart_tl2br( requested_part, ij, b, obj, sub_obj );
return;
}
// Check parameters.
if ( bl2_error_checking_is_enabled() )
bl2_acquire_mpart_tl2br_check( requested_part, ij, b, obj, sub_obj );
// Query the m and n dimensions of the object (accounting for
// transposition, if indicated).
if ( bl2_obj_has_notrans( *obj ) )
{
m = bl2_obj_length( *obj );
n = bl2_obj_width( *obj );
}
else // if ( bl2_obj_has_trans( *obj ) )
{
m = bl2_obj_width( *obj );
n = bl2_obj_length( *obj );
}
// Foolproofing: do not let b exceed what's left of min(m,n) at
// row/column offset ij.
min_m_n = bl2_min( m, n );
if ( b > min_m_n - ij ) b = min_m_n - ij;
// Compute offset increments and dimensions based on which
// subpartition is being requested, assuming no transposition.
// Left column of subpartitions
if ( requested_part == BLIS_SUBPART00 )
{
// A00 (offm,offn) unchanged.
// A00 is ij x ij.
offm_inc = 0;
offn_inc = 0;
m_part = ij;
n_part = ij;
}
else if ( requested_part == BLIS_SUBPART10 )
{
// A10 (offm,offn) += (ij,0).
// A10 is b x ij.
offm_inc = ij;
offn_inc = 0;
m_part = b;
n_part = ij;
}
else if ( requested_part == BLIS_SUBPART10B )
{
// A10B (offm,offn) += (ij,0).
// A10B is b x (ij + b).
offm_inc = ij;
offn_inc = 0;
m_part = b;
n_part = ij + b;
}
else if ( requested_part == BLIS_SUBPART20 )
{
// A20 (offm,offn) += (ij+b,0).
// A20 is (m-ij-b) x ij.
offm_inc = ij + b;
offn_inc = 0;
m_part = m - ij - b;
n_part = ij;
}
// Middle column of subpartitions.
else if ( requested_part == BLIS_SUBPART01 )
{
// A01 (offm,offn) += (0,ij).
// A01 is ij x b.
offm_inc = 0;
offn_inc = ij;
m_part = ij;
n_part = b;
}
else if ( requested_part == BLIS_SUBPART11 )
{
// A11 (offm,offn) += (ij,ij).
// A11 is b x b.
offm_inc = ij;
offn_inc = ij;
m_part = b;
n_part = b;
}
else if ( requested_part == BLIS_SUBPART21 )
{
// A21 (offm,offn) += (ij+b,ij).
// A21 is (m-ij-b) x b.
offm_inc = ij + b;
offn_inc = ij;
m_part = m - ij - b;
n_part = b;
}
// Right column of subpartitions.
else if ( requested_part == BLIS_SUBPART02 )
{
// A02 (offm,offn) += (0,ij+b).
// A02 is ij x (n-ij-b).
offm_inc = 0;
offn_inc = ij + b;
m_part = ij;
n_part = n - ij - b;
}
else if ( requested_part == BLIS_SUBPART12 )
{
// A12 (offm,offn) += (ij,ij+b).
// A12 is b x (n-ij-b).
offm_inc = ij;
offn_inc = ij + b;
m_part = b;
n_part = n - ij - b;
}
else if ( requested_part == BLIS_SUBPART12B )
{
// A12B (offm,offn) += (ij,ij).
// A12B is b x (n-ij).
offm_inc = ij;
offn_inc = ij;
m_part = b;
n_part = n - ij;
}
else // if ( requested_part == BLIS_SUBPART22 )
{
// A22 (offm,offn) += (ij+b,ij+b).
// A22 is (m-ij-b) x (n-ij-b).
offm_inc = ij + b;
offn_inc = ij + b;
m_part = m - ij - b;
n_part = n - ij - b;
}
// Compute the diagonal offset based on the m and n offsets.
diag_off_inc = ( doff_t )offm_inc - ( doff_t )offn_inc;
// Begin by copying the info, elem size, buffer, row stride, and column
// stride fields of the parent object. Note that this omits copying view
// information because the new partition will have its own dimensions
// and offsets.
bl2_obj_init_subpart_from( *obj, *sub_obj );
// Modify offsets and dimensions of requested partition based on
// whether it needs to be transposed.
if ( bl2_obj_has_notrans( *obj ) )
{
bl2_obj_set_dims( m_part, n_part, *sub_obj );
bl2_obj_inc_offs( offm_inc, offn_inc, *sub_obj );
bl2_obj_inc_diag_off( diag_off_inc, *sub_obj );
}
else // if ( bl2_obj_has_trans( *obj ) )
{
bl2_obj_set_dims( n_part, m_part, *sub_obj );
bl2_obj_inc_offs( offn_inc, offm_inc, *sub_obj );
bl2_obj_inc_diag_off( -diag_off_inc, *sub_obj );
}
// If the root matrix is not general (ie: has structure defined by the
// diagonal), and the subpartition does not intersect the root matrix's
// diagonal, then set the subpartition structure to "general"; otherwise
// we let the subpartition inherit the storage structure of its immediate
// parent.
if ( !bl2_obj_root_is_general( *sub_obj ) &&
requested_part != BLIS_SUBPART00 &&
requested_part != BLIS_SUBPART11 &&
requested_part != BLIS_SUBPART22 )
{
// NOTE: This comment may be out-of-date since we now distinguish
// between uplo properties for the current and root objects...
// Note that we cannot mark the subpartition object as general/dense
// here since it makes sense to preserve the existing uplo information
// a while longer so that the correct kernels are invoked. (Example:
// incremental packing/computing in herk produces subpartitions that
// appear general/dense, but their uplo fields are needed to be either
// lower or upper, to determine which macro-kernel gets called in the
// herk_int() back-end.)
// If the subpartition lies entirely in an "unstored" triangle of the
// root matrix, then we need to tweak the subpartition. If the root
// matrix is Hermitian or symmetric, then we reflect the partition to
// the other side of the diagonal, toggling the transposition bit (and
// conjugation bit if the root matrix is Hermitian). Or, if the root
// matrix is triangular, the subpartition should be marked as zero.
if ( bl2_obj_is_unstored_subpart( *sub_obj ) )
{
if ( bl2_obj_root_is_hermitian( *sub_obj ) )
{
bl2_obj_reflect_about_diag( *sub_obj );
bl2_obj_toggle_conj( *sub_obj );
}
else if ( bl2_obj_root_is_symmetric( *sub_obj ) )
{
bl2_obj_reflect_about_diag( *sub_obj );
}
else if ( bl2_obj_root_is_triangular( *sub_obj ) )
{
bl2_obj_set_uplo( BLIS_ZEROS, *sub_obj );
}
}
}
}
void bl2_acquire_mpart_br2tl( subpart_t requested_part,
dim_t ij,
dim_t b,
obj_t* obj,
obj_t* sub_obj )
{
// Query the dimension of the object.
dim_t mn = bl2_obj_length( *obj );
// Modify ij to account for the fact that we are moving backwards.
ij = mn - ij - b;
bl2_acquire_mpart_tl2br( requested_part, ij, b, obj, sub_obj );
}
// -- Vector partitioning ------------------------------------------------------
void bl2_acquire_vpart_f2b( subpart_t requested_part,
dim_t i,
dim_t b,
obj_t* obj,
obj_t* sub_obj )
{
if ( bl2_obj_is_col_vector( *obj ) )
bl2_acquire_mpart_t2b( requested_part, i, b, obj, sub_obj );
else // if ( bl2_obj_is_row_vector( *obj ) )
bl2_acquire_mpart_l2r( requested_part, i, b, obj, sub_obj );
}
void bl2_acquire_vpart_b2f( subpart_t requested_part,
dim_t i,
dim_t b,
obj_t* obj,
obj_t* sub_obj )
{
if ( bl2_obj_is_col_vector( *obj ) )
bl2_acquire_mpart_b2t( requested_part, i, b, obj, sub_obj );
else // if ( bl2_obj_is_row_vector( *obj ) )
bl2_acquire_mpart_r2l( requested_part, i, b, obj, sub_obj );
}
Reference in New Issue View Git Blame Copy Permalink