| line |
true |
false |
branch |
|
65
|
111 |
5 |
for ( J=0; J
|
|
68
|
21 |
5 |
for ( J=0; J
|
|
74
|
21 |
5 |
for ( I=0; I
|
|
75
|
111 |
21 |
for ( J=0; J
|
|
76
|
90 |
21 |
if ( I != J ) { |
|
83
|
5 |
0 |
if ( ANORM > 0.0 ) { |
|
88
|
108 |
5 |
while ( THR > ANORMX ) { |
|
94
|
459 |
146 |
for ( L=0; L
|
|
95
|
1294 |
459 |
for ( M=L+1; M
|
|
99
|
1162 |
132 |
if ( fabs(ALM) < THR ) |
|
110
|
46 |
86 |
if (X >= 0.0) |
|
119
|
900 |
132 |
for ( I=0; I
|
|
121
|
768 |
132 |
if ( (I != M) && (I != L) ) { |
|
|
636 |
132 |
if ( (I != M) && (I != L) ) { |
|
122
|
228 |
408 |
IM=(I > M) ? M+IQ : I+MQ; |
|
123
|
437 |
199 |
IL=(I >= L) ? L+IQ : I+LQ; |
|
145
|
38 |
108 |
} while ( IND != 0 ); |
|
152
|
21 |
5 |
for ( J=0; J
|
|
159
|
16 |
5 |
for ( II = 1; II < N; II++) { |
|
163
|
45 |
16 |
for ( J = II; J < N; J++ ) { |
|
164
|
33 |
12 |
if (E[J] >= P) continue; |
|
168
|
5 |
11 |
if (K == I) continue; |
|
171
|
61 |
11 |
for ( J = 0; J < N; J++ ) { |