1 /* { dg-do compile } */
2 /* { dg-options "-O -floop-nest-optimize" } */
3
Chv_countBigEntries(int npivot,int pivotsizes[],int countflag,double droptol,int nD)4 int Chv_countBigEntries (int npivot, int pivotsizes[], int countflag,
5 double droptol, int nD)
6 {
7 double absval ;
8 double *entries ;
9 int count;
10 int ii, jj, kinc, kk, kstart, stride ;
11 for ( ii = 0 ; ii < nD ; ii++ )
12 {
13 kk = kstart ;
14 kinc = stride ;
15 for ( jj = 0 ; jj < ii ; jj++ )
16 {
17 absval = __builtin_fabs(entries[kk]) ;
18 if ( absval >= droptol )
19 count++ ;
20 kk += kinc ;
21 kinc -= 2 ;
22 }
23 kstart-- ;
24 }
25 return count;
26 }
27