Go to the source code of this file.
Function/Subroutine Documentation
lapack_logical LAPACKE_stf_nancheck |
( |
int |
matrix_order, |
|
|
char |
transr, |
|
|
char |
uplo, |
|
|
char |
diag, |
|
|
lapack_int |
n, |
|
|
const float * |
a |
|
) |
| |
Definition at line 37 of file lapacke_stf_nancheck.c.
{
}
if( unit ) {
if( lower ) {
n2 = n / 2;
n1 = n - n2;
} else {
n1 = n / 2;
n2 = n - n1;
}
if( n % 2 == 1 ) {
if( ( rowmaj || ntr ) && !( rowmaj && ntr ) ) {
if( lower ) {
n1, &a[0], n )
&a[n1], n )
n2, &a[n], n );
} else {
n1, &a[n2], n )
&a[0], n )
n2, &a[n1], n );
}
} else {
if( lower ) {
n1, &a[0], n1 )
&a[1], n1 )
n2, &a[1], n1 );
} else {
n1, &a[(size_t)n2*n2], n2 )
&a[0], n2 )
n2, &a[(size_t)n1*n2], n2 );
}
}
} else {
k = n / 2;
if( ( rowmaj || ntr ) && !( rowmaj && ntr ) ) {
if( lower ) {
k, &a[1], n+1 )
&a[k+1], n+1 )
k, &a[0], n+1 );
} else {
k, &a[k+1], n+1 )
&a[0], n+1 )
k, &a[k], n+1 );
}
} else {
if( lower ) {
k, &a[k], k )
&a[(size_t)k*(k+1)], k )
k, &a[0], k );
} else {
k, &a[(size_t)k*(k+1)], k )
&a[0], k )
k, &a[(size_t)k*k], k );
}
}
}
} else {
len = n*(n+1)/2;
}
}