libflame
12600
|
Functions | |
void | bl1_ssetmr (uplo1_t uplo, int m, int n, float *sigma, float *a, int a_rs, int a_cs) |
void | bl1_dsetmr (uplo1_t uplo, int m, int n, double *sigma, double *a, int a_rs, int a_cs) |
void | bl1_csetmr (uplo1_t uplo, int m, int n, scomplex *sigma, scomplex *a, int a_rs, int a_cs) |
void | bl1_zsetmr (uplo1_t uplo, int m, int n, dcomplex *sigma, dcomplex *a, int a_rs, int a_cs) |
void bl1_csetmr | ( | uplo1_t | uplo, |
int | m, | ||
int | n, | ||
scomplex * | sigma, | ||
scomplex * | a, | ||
int | a_rs, | ||
int | a_cs | ||
) |
References bl1_csetv(), bl1_is_row_storage(), bl1_is_upper(), and bl1_zero_dim2().
Referenced by FLA_Setr(), and FLA_Triangularize().
{ scomplex* a_begin; int lda, inca; int n_iter; int n_elem_max; int n_elem; int j; // Return early if possible. if ( bl1_zero_dim2( m, n ) ) return; // Initialize with optimal values for column-major storage. n_iter = n; n_elem_max = m; lda = a_cs; inca = a_rs; // An optimization: if A is row-major, then let's access the matrix by // rows instead of by columns to increase spatial locality. if ( bl1_is_row_storage( a_rs, a_cs ) ) { bl1_swap_ints( n_iter, n_elem_max ); bl1_swap_ints( lda, inca ); bl1_toggle_uplo( uplo ); } if ( bl1_is_upper( uplo ) ) { for ( j = 0; j < n_iter; j++ ) { n_elem = bl1_min( j, n_elem_max ); a_begin = a + j*lda; bl1_csetv( n_elem, sigma, a_begin, inca ); } } else // if ( bl1_is_lower( uplo ) ) { for ( j = 0; j < n_iter; j++ ) { n_elem = bl1_max( 0, n_elem_max - j - 1 ); a_begin = a + j*lda + (j + 1)*inca; bl1_csetv( n_elem, sigma, a_begin, inca ); } } }
void bl1_dsetmr | ( | uplo1_t | uplo, |
int | m, | ||
int | n, | ||
double * | sigma, | ||
double * | a, | ||
int | a_rs, | ||
int | a_cs | ||
) |
References bl1_dsetv(), bl1_is_row_storage(), bl1_is_upper(), and bl1_zero_dim2().
Referenced by FLA_Setr(), and FLA_Triangularize().
{ double* a_begin; int lda, inca; int n_iter; int n_elem_max; int n_elem; int j; // Return early if possible. if ( bl1_zero_dim2( m, n ) ) return; // Initialize with optimal values for column-major storage. n_iter = n; n_elem_max = m; lda = a_cs; inca = a_rs; // An optimization: if A is row-major, then let's access the matrix by // rows instead of by columns to increase spatial locality. if ( bl1_is_row_storage( a_rs, a_cs ) ) { bl1_swap_ints( n_iter, n_elem_max ); bl1_swap_ints( lda, inca ); bl1_toggle_uplo( uplo ); } if ( bl1_is_upper( uplo ) ) { for ( j = 0; j < n_iter; j++ ) { n_elem = bl1_min( j, n_elem_max ); a_begin = a + j*lda; bl1_dsetv( n_elem, sigma, a_begin, inca ); } } else // if ( bl1_is_lower( uplo ) ) { for ( j = 0; j < n_iter; j++ ) { n_elem = bl1_max( 0, n_elem_max - j - 1 ); a_begin = a + j*lda + (j + 1)*inca; bl1_dsetv( n_elem, sigma, a_begin, inca ); } } }
void bl1_ssetmr | ( | uplo1_t | uplo, |
int | m, | ||
int | n, | ||
float * | sigma, | ||
float * | a, | ||
int | a_rs, | ||
int | a_cs | ||
) |
References bl1_is_row_storage(), bl1_is_upper(), bl1_ssetv(), and bl1_zero_dim2().
Referenced by FLA_Setr(), and FLA_Triangularize().
{ float* a_begin; int lda, inca; int n_iter; int n_elem_max; int n_elem; int j; // Return early if possible. if ( bl1_zero_dim2( m, n ) ) return; // Initialize with optimal values for column-major storage. n_iter = n; n_elem_max = m; lda = a_cs; inca = a_rs; // An optimization: if A is row-major, then let's access the matrix by // rows instead of by columns to increase spatial locality. if ( bl1_is_row_storage( a_rs, a_cs ) ) { bl1_swap_ints( n_iter, n_elem_max ); bl1_swap_ints( lda, inca ); bl1_toggle_uplo( uplo ); } if ( bl1_is_upper( uplo ) ) { for ( j = 0; j < n_iter; j++ ) { n_elem = bl1_min( j, n_elem_max ); a_begin = a + j*lda; bl1_ssetv( n_elem, sigma, a_begin, inca ); } } else // if ( bl1_is_lower( uplo ) ) { for ( j = 0; j < n_iter; j++ ) { n_elem = bl1_max( 0, n_elem_max - j - 1 ); a_begin = a + j*lda + (j + 1)*inca; bl1_ssetv( n_elem, sigma, a_begin, inca ); } } }
void bl1_zsetmr | ( | uplo1_t | uplo, |
int | m, | ||
int | n, | ||
dcomplex * | sigma, | ||
dcomplex * | a, | ||
int | a_rs, | ||
int | a_cs | ||
) |
References bl1_is_row_storage(), bl1_is_upper(), bl1_zero_dim2(), and bl1_zsetv().
Referenced by FLA_Setr(), and FLA_Triangularize().
{ dcomplex* a_begin; int lda, inca; int n_iter; int n_elem_max; int n_elem; int j; // Return early if possible. if ( bl1_zero_dim2( m, n ) ) return; // Initialize with optimal values for column-major storage. n_iter = n; n_elem_max = m; lda = a_cs; inca = a_rs; // An optimization: if A is row-major, then let's access the matrix by // rows instead of by columns to increase spatial locality. if ( bl1_is_row_storage( a_rs, a_cs ) ) { bl1_swap_ints( n_iter, n_elem_max ); bl1_swap_ints( lda, inca ); bl1_toggle_uplo( uplo ); } if ( bl1_is_upper( uplo ) ) { for ( j = 0; j < n_iter; j++ ) { n_elem = bl1_min( j, n_elem_max ); a_begin = a + j*lda; bl1_zsetv( n_elem, sigma, a_begin, inca ); } } else // if ( bl1_is_lower( uplo ) ) { for ( j = 0; j < n_iter; j++ ) { n_elem = bl1_max( 0, n_elem_max - j - 1 ); a_begin = a + j*lda + (j + 1)*inca; bl1_zsetv( n_elem, sigma, a_begin, inca ); } } }