| 
    libflame
    12600
    
   
   | 
  
  
  
 
Functions | |
| void | bl1_sconjmr (uplo1_t uplo, int m, int n, float *a, int a_rs, int a_cs) | 
| void | bl1_dconjmr (uplo1_t uplo, int m, int n, double *a, int a_rs, int a_cs) | 
| void | bl1_cconjmr (uplo1_t uplo, int m, int n, scomplex *a, int a_rs, int a_cs) | 
| void | bl1_zconjmr (uplo1_t uplo, int m, int n, dcomplex *a, int a_rs, int a_cs) | 
| void bl1_cconjmr | ( | uplo1_t | uplo, | 
| int | m, | ||
| int | n, | ||
| scomplex * | a, | ||
| int | a_rs, | ||
| int | a_cs | ||
| ) | 
References bl1_is_row_storage(), bl1_is_upper(), bl1_sm1(), bl1_sscal(), and bl1_zero_dim2().
Referenced by bl1_chemm(), bl1_ctrmm(), bl1_ctrsm(), and FLA_Conjugate_r().
{
    float   m1 = bl1_sm1();
    float*  a_conj;
    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;
    // We initialize for column-major.
    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 + 1, n_elem_max );
            a_conj = ( float* )( a + j*lda ) + 1;
    
            bl1_sscal( n_elem,
                       &m1,
                       a_conj, 2*inca );
        }
    }
    else // if ( bl1_is_lower( uplo ) )
    {
        for ( j = 0; j < n_iter; ++j )
        {
            n_elem = bl1_max( 0, n_elem_max - j );
            a_conj = ( float* )( a + j*lda + j*inca ) + 1;
    
            if ( n_elem <= 0 ) break;
            bl1_sscal( n_elem,
                       &m1,
                       a_conj, 2*inca );
        }
    }
}
| void bl1_dconjmr | ( | uplo1_t | uplo, | 
| int | m, | ||
| int | n, | ||
| double * | a, | ||
| int | a_rs, | ||
| int | a_cs | ||
| ) | 
{
    return;
}
| void bl1_sconjmr | ( | uplo1_t | uplo, | 
| int | m, | ||
| int | n, | ||
| float * | a, | ||
| int | a_rs, | ||
| int | a_cs | ||
| ) | 
{
    return;
}
| void bl1_zconjmr | ( | uplo1_t | uplo, | 
| int | m, | ||
| int | n, | ||
| dcomplex * | a, | ||
| int | a_rs, | ||
| int | a_cs | ||
| ) | 
References bl1_dm1(), bl1_dscal(), bl1_is_row_storage(), bl1_is_upper(), and bl1_zero_dim2().
Referenced by bl1_zhemm(), bl1_ztrmm(), bl1_ztrsm(), and FLA_Conjugate_r().
{
    double  m1 = bl1_dm1();
    double* a_conj;
    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;
    // We initialize for column-major.
    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 + 1, n_elem_max );
            a_conj = ( double* )( a + j*lda ) + 1;
    
            bl1_dscal( n_elem,
                       &m1,
                       a_conj, 2*inca );
        }
    }
    else // if ( bl1_is_lower( uplo ) )
    {
        for ( j = 0; j < n_iter; ++j )
        {
            n_elem = bl1_max( 0, n_elem_max - j );
            a_conj = ( double* )( a + j*lda + j*inca ) + 1;
    
            if ( n_elem <= 0 ) break;
            bl1_dscal( n_elem,
                       &m1,
                       a_conj, 2*inca );
        }
    }
}
 1.7.6.1