Branch Coverage

lib/PDL/MatrixOps/matrix.c
Criterion Covered Total %
branch 22 118 18.6


line true false branch
64 0 20 if (matrix==NULL)
67 54 20 for(i=0; i
69 0 54 if (matrix[i]==NULL)
87 0 12 if (temp==NULL)
104 0 7 if (temp==NULL)
121 0 0 if (temp==NULL)
124 0 0 for(i=0; i
126 0 0 if (temp[i]==NULL)
145 0 0 if (temp==NULL)
163 24 9 for(i=0; i
164 72 24 for(j=0; j
166 240 72 for(k=0; k
183 8 3 for(i=0; i
184 24 8 for(j=0; j
199 48 18 for(i=0; i
208 0 0 for(i=0; i
256 0 0 for(i=0; i
259 0 0 for(j=0; j
261 0 0 if (s[i]
266 0 0 for(k=0; k<(n-1); k++) {
269 0 0 while (not_finished) {
272 0 0 for(i=k; i
273 0 0 if (temp>=(fabs(a[p[i]][k])/s[p[i]]))
280 0 0 for(i=(k+1); i
283 0 0 for(j=(k+1); j
299 0 0 for(k=0; k<(n-1); k++) /* forward subst */
300 0 0 for(i=(k+1); i
303 0 0 for(i=(n-1); i>=0; i--) { /* back subst */
305 0 0 for(j=(i+1); j
310 0 0 for(i=0; i
344 0 0 for(i=0; i
347 0 0 for(i=0; i
349 0 0 for(j=0; j
354 0 0 } while ((iter<=max_iter) && (norm>=eps));
0 0 } while ((iter<=max_iter) && (norm>=eps));
383 0 0 for(i=0; i
386 0 0 for(j=0; j
394 0 0 for(i=0; i
396 0 0 for(j=0; j
401 0 0 for(i=0; i
403 0 0 } while ((iter<=max_iter) && (norm>=eps));
0 0 } while ((iter<=max_iter) && (norm>=eps));
422 0 0 for(i=0; i
438 0 0 for(i=0; i
440 0 0 for(j=0; j
455 32 12 for(i=0; i
456 96 32 for(j=0; j
471 0 0 for(i=0; i
490 0 0 for(k=0; k
491 0 0 for(j=(k+1); j
493 0 0 for(i=0; i
495 0 0 for(i=0; i
500 0 0 for(k=0; k
502 0 0 for(i=0; i
505 0 0 if (dot==0.0)
507 0 0 for(i=0; i
531 0 0 for(i=0; i
532 0 0 for(j=0; j
536 0 0 for(j=0; j