libflame revision_anchor
|
Functions | |
void | bli_srandm (int m, int n, float *a, int a_rs, int a_cs) |
void | bli_drandm (int m, int n, double *a, int a_rs, int a_cs) |
void | bli_crandm (int m, int n, scomplex *a, int a_rs, int a_cs) |
void | bli_zrandm (int m, int n, dcomplex *a, int a_rs, int a_cs) |
void bli_crandm | ( | int | m, |
int | n, | ||
scomplex * | a, | ||
int | a_rs, | ||
int | a_cs | ||
) |
References bli_crandv(), bli_is_row_storage(), and bli_zero_dim2().
Referenced by FLA_Random_matrix().
{ scomplex* a_begin; int inca, lda; int n_iter; int n_elem; int j; // Return early if possible. if ( bli_zero_dim2( m, n ) ) return; // Initialize with optimal values for column-major storage. inca = a_rs; lda = a_cs; n_iter = n; n_elem = m; // An optimization: if A is row-major, then let's access the matrix by // rows instead of by columns for increased spatial locality. if ( bli_is_row_storage( a_rs, a_cs ) ) { bli_swap_ints( n_iter, n_elem ); bli_swap_ints( lda, inca ); } for ( j = 0; j < n_iter; j++ ) { a_begin = a + j*lda; bli_crandv( n_elem, a_begin, inca ); } }
void bli_drandm | ( | int | m, |
int | n, | ||
double * | a, | ||
int | a_rs, | ||
int | a_cs | ||
) |
References bli_drandv(), bli_is_row_storage(), and bli_zero_dim2().
Referenced by FLA_Random_matrix().
{ double* a_begin; int inca, lda; int n_iter; int n_elem; int j; // Return early if possible. if ( bli_zero_dim2( m, n ) ) return; // Initialize with optimal values for column-major storage. inca = a_rs; lda = a_cs; n_iter = n; n_elem = m; // An optimization: if A is row-major, then let's access the matrix by // rows instead of by columns for increased spatial locality. if ( bli_is_row_storage( a_rs, a_cs ) ) { bli_swap_ints( n_iter, n_elem ); bli_swap_ints( lda, inca ); } for ( j = 0; j < n_iter; j++ ) { a_begin = a + j*lda; bli_drandv( n_elem, a_begin, inca ); } }
void bli_srandm | ( | int | m, |
int | n, | ||
float * | a, | ||
int | a_rs, | ||
int | a_cs | ||
) |
References bli_is_row_storage(), bli_srandv(), and bli_zero_dim2().
Referenced by FLA_Random_matrix().
{ float* a_begin; int inca, lda; int n_iter; int n_elem; int j; // Return early if possible. if ( bli_zero_dim2( m, n ) ) return; // Initialize with optimal values for column-major storage. inca = a_rs; lda = a_cs; n_iter = n; n_elem = m; // An optimization: if A is row-major, then let's access the matrix by // rows instead of by columns for increased spatial locality. if ( bli_is_row_storage( a_rs, a_cs ) ) { bli_swap_ints( n_iter, n_elem ); bli_swap_ints( lda, inca ); } for ( j = 0; j < n_iter; j++ ) { a_begin = a + j*lda; bli_srandv( n_elem, a_begin, inca ); } }
void bli_zrandm | ( | int | m, |
int | n, | ||
dcomplex * | a, | ||
int | a_rs, | ||
int | a_cs | ||
) |
References bli_is_row_storage(), bli_zero_dim2(), and bli_zrandv().
Referenced by FLA_Random_matrix().
{ dcomplex* a_begin; int inca, lda; int n_iter; int n_elem; int j; // Return early if possible. if ( bli_zero_dim2( m, n ) ) return; // Initialize with optimal values for column-major storage. inca = a_rs; lda = a_cs; n_iter = n; n_elem = m; // An optimization: if A is row-major, then let's access the matrix by // rows instead of by columns for increased spatial locality. if ( bli_is_row_storage( a_rs, a_cs ) ) { bli_swap_ints( n_iter, n_elem ); bli_swap_ints( lda, inca ); } for ( j = 0; j < n_iter; j++ ) { a_begin = a + j*lda; bli_zrandv( n_elem, a_begin, inca ); } }