Branch Coverage

lib/PDL/Transform.pd
Criterion Covered Total %
branch 400 2034 19.6


line true false branch
429 922 170 if (slimit < 6.0)
435 2013 2347 for (i=0; i
436 3684 1842 for (j=0; j
442 1421 921 while (RotCount != 0 && SweepCount <= slimit)
1421 0 while (RotCount != 0 && SweepCount <= slimit)
446 1421 1421 for (j=0; j
448 1436 1430 for (k=j+1; k
451 2842 1445 for (i=0; i
457 921 524 if (q >= r)
459 921 0 if (q<=e2*Z[0] || fabs(p)<=tol*q) RotCount--;
922 29 if (q<=e2*Z[0] || fabs(p)<=tol*q) RotCount--;
464 0 30 for (i=0; i
475 345 185 if (p<0) s0 = -s0;
477 2001 509 for (i=0; i
485 10 1421 while (EstColRank>=3 && Z[(EstColRank-1)]<=Z[0]*tol+tol*tol)
19 10 while (EstColRank>=3 && Z[(EstColRank-1)]<=Z[0]*tol+tol*tol)
525 1842 950 for( i=offset=0; i
530 1842 950 for( i=0; i
533 1652 207 char symmetric = !(bot || top);
1430 235 char symmetric = !(bot || top);
536 1654 217 ohi = ((PDL_Double *)map->data) + ( offset + ( top ? 0 : diff ));
537 1640 207 olo = ((PDL_Double *)map->data) + ( offset - ( bot ? 0 : diff ));
539 3689 1866 for( j=0; j
545 2861 847 if(symmetric)
562 1865 921 for (i=0;i
568 1842 950 for(i=0; i
570 3689 1866 for(j=0;j
577 1842 950 for(i=0;i
579 1000 871 if(*aptr < sv_min)
581 932 939 if(*aptr > max_sv )
594 1842 930 for(i=0;i
595 3693 1842 for(j=0;j
598 7368 3684 for(k=0;k
659 0 0 PDL_RETERROR(PDL_err, PDL->make_physical(in));
0 0 PDL_RETERROR(PDL_err, PDL->make_physical(in));
0 5 PDL_RETERROR(PDL_err, PDL->make_physical(in));
5 1 PDL_RETERROR(PDL_err, PDL->make_physical(in));
1 5 PDL_RETERROR(PDL_err, PDL->make_physical(in));
8 1 PDL_RETERROR(PDL_err, PDL->make_physical(in));
0 0 PDL_RETERROR(PDL_err, PDL->make_physical(in));
0 0 PDL_RETERROR(PDL_err, PDL->make_physical(in));
0 0 PDL_RETERROR(PDL_err, PDL->make_physical(in));
0 9 PDL_RETERROR(PDL_err, PDL->make_physical(in));
0 16 PDL_RETERROR(PDL_err, PDL->make_physical(in));
0 9 PDL_RETERROR(PDL_err, PDL->make_physical(in));
660 0 9 PDL_RETERROR(PDL_err, PDL->make_physical(out));
0 8 PDL_RETERROR(PDL_err, PDL->make_physical(out));
0 1 PDL_RETERROR(PDL_err, PDL->make_physical(out));
0 1 PDL_RETERROR(PDL_err, PDL->make_physical(out));
0 6 PDL_RETERROR(PDL_err, PDL->make_physical(out));
0 1 PDL_RETERROR(PDL_err, PDL->make_physical(out));
0 1 PDL_RETERROR(PDL_err, PDL->make_physical(out));
0 2 PDL_RETERROR(PDL_err, PDL->make_physical(out));
0 4 PDL_RETERROR(PDL_err, PDL->make_physical(out));
8 1 PDL_RETERROR(PDL_err, PDL->make_physical(out));
9 27 PDL_RETERROR(PDL_err, PDL->make_physical(out));
10 19 PDL_RETERROR(PDL_err, PDL->make_physical(out));
661 0 29 PDL_RETERROR(PDL_err, PDL->make_physical(map));
24 5 PDL_RETERROR(PDL_err, PDL->make_physical(map));
17 12 PDL_RETERROR(PDL_err, PDL->make_physical(map));
0 12 PDL_RETERROR(PDL_err, PDL->make_physical(map));
12 5 PDL_RETERROR(PDL_err, PDL->make_physical(map));
0 0 PDL_RETERROR(PDL_err, PDL->make_physical(map));
0 12 PDL_RETERROR(PDL_err, PDL->make_physical(map));
0 23 PDL_RETERROR(PDL_err, PDL->make_physical(map));
12 0 PDL_RETERROR(PDL_err, PDL->make_physical(map));
0 12 PDL_RETERROR(PDL_err, PDL->make_physical(map));
0 19 PDL_RETERROR(PDL_err, PDL->make_physical(map));
1 11 PDL_RETERROR(PDL_err, PDL->make_physical(map));
674 0 12 for (i=0;i
0 12 for (i=0;i
0 0 for (i=0;i
0 18 for (i=0;i
0 30 for (i=0;i
24 37 for (i=0;i
24 37 for (i=0;i
0 10 for (i=0;i
10 51 for (i=0;i
0 40 for (i=0;i
0 40 for (i=0;i
0 30 for (i=0;i
678 0 30 for(i=0;i
0 29 for(i=0;i
0 0 for(i=0;i
0 0 for(i=0;i
10 5 for(i=0;i
0 0 for(i=0;i
0 0 for(i=0;i
0 0 for(i=0;i
0 0 for(i=0;i
0 0 for(i=0;i
14 7 for(i=0;i
0 0 for(i=0;i
679 0 0 switch(bstr[i < blen ? i : blen-1 ]) {
0 0 switch(bstr[i < blen ? i : blen-1 ]) {
0 0 switch(bstr[i < blen ? i : blen-1 ]) {
0 0 switch(bstr[i < blen ? i : blen-1 ]) {
8 38 switch(bstr[i < blen ? i : blen-1 ]) {
12 24 switch(bstr[i < blen ? i : blen-1 ]) {
36 0 switch(bstr[i < blen ? i : blen-1 ]) {
36 0 switch(bstr[i < blen ? i : blen-1 ]) {
25 11 switch(bstr[i < blen ? i : blen-1 ]) {
2 34 switch(bstr[i < blen ? i : blen-1 ]) {
13 37 switch(bstr[i < blen ? i : blen-1 ]) {
10 1 switch(bstr[i < blen ? i : blen-1 ]) {
707 1 10 if(big <= 0)
11 0 if(big <= 0)
0 2 if(big <= 0)
5 6 if(big <= 0)
3 8 if(big <= 0)
0 3 if(big <= 0)
0 3 if(big <= 0)
1 2 if(big <= 0)
25 11 if(big <= 0)
0 3 if(big <= 0)
0 8 if(big <= 0)
1 0 if(big <= 0)
711 0 35 if(blur < 0)
1 35 if(blur < 0)
36 0 if(blur < 0)
7 29 if(blur < 0)
36 5 if(blur < 0)
140 4 if(blur < 0)
0 35 if(blur < 0)
1 34 if(blur < 0)
0 11 if(blur < 0)
0 11 if(blur < 0)
36 7 if(blur < 0)
0 0 if(blur < 0)
715 0 0 if(sv_min < 0)
0 0 if(sv_min < 0)
0 0 if(sv_min < 0)
0 0 if(sv_min < 0)
0 5 if(sv_min < 0)
0 0 if(sv_min < 0)
0 0 if(sv_min < 0)
0 0 if(sv_min < 0)
0 2 if(sv_min < 0)
0 0 if(sv_min < 0)
0 8 if(sv_min < 0)
0 2 if(sv_min < 0)
728 2 21 case 'h': // h - lookup-table hanning window
23 0 case 'h': // h - lookup-table hanning window
0 23 case 'h': // h - lookup-table hanning window
0 23 case 'h': // h - lookup-table hanning window
1 21 case 'h': // h - lookup-table hanning window
0 1 case 'h': // h - lookup-table hanning window
0 0 case 'h': // h - lookup-table hanning window
0 0 case 'h': // h - lookup-table hanning window
0 22 case 'h': // h - lookup-table hanning window
0 22 case 'h': // h - lookup-table hanning window
1 27 case 'h': // h - lookup-table hanning window
1 22 case 'h': // h - lookup-table hanning window
730 46 0 int i;
0 0 int i;
0 0 int i;
0 0 int i;
2500 1 int i;
0 0 int i;
0 0 int i;
0 0 int i;
0 0 int i;
0 0 int i;
2500 1 int i;
0 0 int i;
739 0 0 case 'H': // H - rigorous hanning window
0 0 case 'H': // H - rigorous hanning window
0 0 case 'H': // H - rigorous hanning window
0 0 case 'H': // H - rigorous hanning window
2 0 case 'H': // H - rigorous hanning window
0 0 case 'H': // H - rigorous hanning window
0 0 case 'H': // H - rigorous hanning window
0 0 case 'H': // H - rigorous hanning window
0 0 case 'H': // H - rigorous hanning window
0 0 case 'H': // H - rigorous hanning window
6 0 case 'H': // H - rigorous hanning window
0 0 case 'H': // H - rigorous hanning window
745 0 0 method = 'g';
0 0 method = 'g';
0 0 method = 'g';
0 0 method = 'g';
1 1 method = 'g';
0 0 method = 'g';
0 0 method = 'g';
0 0 method = 'g';
0 0 method = 'g';
0 0 method = 'g';
1 0 method = 'g';
0 0 method = 'g';
747 0 0
0 0
0 0
0 0
4000 1
0 0
0 0
0 0
0 0
0 0
4000 1
0 0
771 0 0 /* Start of Real Work */
0 0 /* Start of Real Work */
0 0 /* Start of Real Work */
0 0 /* Start of Real Work */
10 5 /* Start of Real Work */
0 0 /* Start of Real Work */
0 0 /* Start of Real Work */
0 0 /* Start of Real Work */
0 0 /* Start of Real Work */
0 0 /* Start of Real Work */
14 7 /* Start of Real Work */
0 0 /* Start of Real Work */
776 0 0 ovec[i] = 0;
0 0 ovec[i] = 0;
0 0 ovec[i] = 0;
0 0 ovec[i] = 0;
5 5 ovec[i] = 0;
0 0 ovec[i] = 0;
0 0 ovec[i] = 0;
0 0 ovec[i] = 0;
0 0 ovec[i] = 0;
0 0 ovec[i] = 0;
7 7 ovec[i] = 0;
0 0 ovec[i] = 0;
777 0 0
0 0
0 0
0 0
10 5
0 0
0 0
0 0
0 0
0 0
14 7
0 0
810 0 0 #endif
0 0 #endif
0 0 #endif
0 0 #endif
1000 500 #endif
0 0 #endif
0 0 #endif
0 0 #endif
0 0 #endif
0 0 #endif
842 421 #endif
0 0 #endif
817 0 0 {
0 0 {
0 0 {
0 0 {
1000 500 {
0 0 {
0 0 {
0 0 {
0 0 {
0 0 {
842 421 {
0 0 {
823 0 0 }
0 0 }
0 0 }
0 0 }
500 500 }
0 0 }
0 0 }
0 0 }
0 0 }
0 0 }
421 421 }
0 0 }
829 0 0 /* Initialize accumulators */
0 0 /* Initialize accumulators */
0 0 /* Initialize accumulators */
0 0 /* Initialize accumulators */
500 500 /* Initialize accumulators */
0 0 /* Initialize accumulators */
0 0 /* Initialize accumulators */
0 0 /* Initialize accumulators */
0 0 /* Initialize accumulators */
0 0 /* Initialize accumulators */
421 421 /* Initialize accumulators */
0 0 /* Initialize accumulators */
834 0 0
0 0
0 0
0 0
500 500
0 0
0 0
0 0
0 0
0 0
421 421
0 0
851 0 0 *
0 0 *
0 0 *
0 0 *
1000 500 *
0 0 *
0 0 *
0 0 *
0 0 *
0 0 *
842 421 *
0 0 *
853 0 0 * current dim.
0 0 * current dim.
0 0 * current dim.
0 0 * current dim.
0 0 * current dim.
0 0 * current dim.
0 0 * current dim.
0 0 * current dim.
600 400 * current dim.
0 600 * current dim.
0 0 * current dim.
0 0 * current dim.
0 0 * current dim.
0 0 * current dim.
0 0 * current dim.
0 0 * current dim.
0 0 * current dim.
0 0 * current dim.
0 0 * current dim.
0 0 * current dim.
594 248 * current dim.
120 474 * current dim.
0 0 * current dim.
0 0 * current dim.
862 0 0 if(j<0 || j >= in->dims[i]) {
0 0 if(j<0 || j >= in->dims[i]) {
0 0 if(j<0 || j >= in->dims[i]) {
0 0 if(j<0 || j >= in->dims[i]) {
400 0 if(j<0 || j >= in->dims[i]) {
0 0 if(j<0 || j >= in->dims[i]) {
0 0 if(j<0 || j >= in->dims[i]) {
0 0 if(j<0 || j >= in->dims[i]) {
0 0 if(j<0 || j >= in->dims[i]) {
0 0 if(j<0 || j >= in->dims[i]) {
208 60 if(j<0 || j >= in->dims[i]) {
0 0 if(j<0 || j >= in->dims[i]) {
868 0 0 t_vio++;
0 0 t_vio++;
0 0 t_vio++;
0 0 t_vio++;
0 0 t_vio++;
0 0 t_vio++;
0 0 t_vio++;
0 0 t_vio++;
0 0 t_vio++;
0 0 t_vio++;
20 30 t_vio++;
0 0 t_vio++;
874 0 0 j = in->dims[i] - 1;
0 0 j = in->dims[i] - 1;
0 0 j = in->dims[i] - 1;
0 0 j = in->dims[i] - 1;
0 0 j = in->dims[i] - 1;
0 0 j = in->dims[i] - 1;
0 0 j = in->dims[i] - 1;
0 0 j = in->dims[i] - 1;
0 0 j = in->dims[i] - 1;
0 0 j = in->dims[i] - 1;
0 50 j = in->dims[i] - 1;
0 0 j = in->dims[i] - 1;
877 0 0 j %= in->dims[i];
0 0 j %= in->dims[i];
0 0 j %= in->dims[i];
0 0 j %= in->dims[i];
0 0 j %= in->dims[i];
0 0 j %= in->dims[i];
0 0 j %= in->dims[i];
0 0 j %= in->dims[i];
0 0 j %= in->dims[i];
0 0 j %= in->dims[i];
50 0 j %= in->dims[i];
0 0 j %= in->dims[i];
895 0 0 }
0 0 }
0 0 }
0 0 }
1000 500 }
0 0 }
0 0 }
0 0 }
0 0 }
0 0 }
842 421 }
0 0 }
918 0 0 /* we walk through the array using dimincs and the old offset. This saves */
0 0 /* we walk through the array using dimincs and the old offset. This saves */
0 0 /* we walk through the array using dimincs and the old offset. This saves */
0 0 /* we walk through the array using dimincs and the old offset. This saves */
9250 3250 /* we walk through the array using dimincs and the old offset. This saves */
0 0 /* we walk through the array using dimincs and the old offset. This saves */
0 0 /* we walk through the array using dimincs and the old offset. This saves */
0 0 /* we walk through the array using dimincs and the old offset. This saves */
0 0 /* we walk through the array using dimincs and the old offset. This saves */
0 0 /* we walk through the array using dimincs and the old offset. This saves */
7182 4519 /* we walk through the array using dimincs and the old offset. This saves */
0 0 /* we walk through the array using dimincs and the old offset. This saves */
923 0 0 PDL_Double alpha; // weighting coefficient for the current point
0 0 PDL_Double alpha; // weighting coefficient for the current point
0 0 PDL_Double alpha; // weighting coefficient for the current point
0 0 PDL_Double alpha; // weighting coefficient for the current point
18500 9250 PDL_Double alpha; // weighting coefficient for the current point
0 0 PDL_Double alpha; // weighting coefficient for the current point
0 0 PDL_Double alpha; // weighting coefficient for the current point
0 0 PDL_Double alpha; // weighting coefficient for the current point
0 0 PDL_Double alpha; // weighting coefficient for the current point
0 0 PDL_Double alpha; // weighting coefficient for the current point
14364 7182 PDL_Double alpha; // weighting coefficient for the current point
0 0 PDL_Double alpha; // weighting coefficient for the current point
937 0 0 switch(method) {
0 0 switch(method) {
0 0 switch(method) {
0 0 switch(method) {
2645 1850 switch(method) {
0 0 switch(method) {
0 0 switch(method) {
0 0 switch(method) {
0 0 switch(method) {
0 0 switch(method) {
8353 6341 switch(method) {
0 0 switch(method) {
944 0 0 /* weighting calculation, so we do. Using 2500 entries and linear */
0 0 /* weighting calculation, so we do. Using 2500 entries and linear */
0 0 /* weighting calculation, so we do. Using 2500 entries and linear */
0 0 /* weighting calculation, so we do. Using 2500 entries and linear */
5290 2645 /* weighting calculation, so we do. Using 2500 entries and linear */
0 0 /* weighting calculation, so we do. Using 2500 entries and linear */
0 0 /* weighting calculation, so we do. Using 2500 entries and linear */
0 0 /* weighting calculation, so we do. Using 2500 entries and linear */
0 0 /* weighting calculation, so we do. Using 2500 entries and linear */
0 0 /* weighting calculation, so we do. Using 2500 entries and linear */
16706 8353 /* weighting calculation, so we do. Using 2500 entries and linear */
0 0 /* weighting calculation, so we do. Using 2500 entries and linear */
954 0 0 ap = tvec;
0 0 ap = tvec;
0 0 ap = tvec;
0 0 ap = tvec;
2645 0 ap = tvec;
0 0 ap = tvec;
0 0 ap = tvec;
0 0 ap = tvec;
0 0 ap = tvec;
0 0 ap = tvec;
6875 1478 ap = tvec;
0 0 ap = tvec;
955 0 0 /* Get the matrix-multiply element for this dimension */
0 0 /* Get the matrix-multiply element for this dimension */
0 0 /* Get the matrix-multiply element for this dimension */
0 0 /* Get the matrix-multiply element for this dimension */
1517 1128 /* Get the matrix-multiply element for this dimension */
0 0 /* Get the matrix-multiply element for this dimension */
0 0 /* Get the matrix-multiply element for this dimension */
0 0 /* Get the matrix-multiply element for this dimension */
0 0 /* Get the matrix-multiply element for this dimension */
0 0 /* Get the matrix-multiply element for this dimension */
5707 1168 /* Get the matrix-multiply element for this dimension */
0 0 /* Get the matrix-multiply element for this dimension */
961 0 0 /* We scale the filter by the blur parameter -- but if blur is less */
0 0 /* We scale the filter by the blur parameter -- but if blur is less */
0 0 /* We scale the filter by the blur parameter -- but if blur is less */
0 0 /* We scale the filter by the blur parameter -- but if blur is less */
0 1128 /* We scale the filter by the blur parameter -- but if blur is less */
0 0 /* We scale the filter by the blur parameter -- but if blur is less */
0 0 /* We scale the filter by the blur parameter -- but if blur is less */
0 0 /* We scale the filter by the blur parameter -- but if blur is less */
0 0 /* We scale the filter by the blur parameter -- but if blur is less */
0 0 /* We scale the filter by the blur parameter -- but if blur is less */
0 1168 /* We scale the filter by the blur parameter -- but if blur is less */
0 0 /* We scale the filter by the blur parameter -- but if blur is less */
975 0 0 lodex = HANNING_LOOKUP_SIZE;
0 0 lodex = HANNING_LOOKUP_SIZE;
0 0 lodex = HANNING_LOOKUP_SIZE;
0 0 lodex = HANNING_LOOKUP_SIZE;
2645 1850 lodex = HANNING_LOOKUP_SIZE;
0 0 lodex = HANNING_LOOKUP_SIZE;
0 0 lodex = HANNING_LOOKUP_SIZE;
0 0 lodex = HANNING_LOOKUP_SIZE;
0 0 lodex = HANNING_LOOKUP_SIZE;
0 0 lodex = HANNING_LOOKUP_SIZE;
0 0 lodex = HANNING_LOOKUP_SIZE;
0 0 lodex = HANNING_LOOKUP_SIZE;
978 0 0 alpha *= hanning_lookup[hidex]*beta + hanning_lookup[lodex]*(1-beta);
0 0 alpha *= hanning_lookup[hidex]*beta + hanning_lookup[lodex]*(1-beta);
0 0 alpha *= hanning_lookup[hidex]*beta + hanning_lookup[lodex]*(1-beta);
0 0 alpha *= hanning_lookup[hidex]*beta + hanning_lookup[lodex]*(1-beta);
5290 2645 alpha *= hanning_lookup[hidex]*beta + hanning_lookup[lodex]*(1-beta);
0 0 alpha *= hanning_lookup[hidex]*beta + hanning_lookup[lodex]*(1-beta);
0 0 alpha *= hanning_lookup[hidex]*beta + hanning_lookup[lodex]*(1-beta);
0 0 alpha *= hanning_lookup[hidex]*beta + hanning_lookup[lodex]*(1-beta);
0 0 alpha *= hanning_lookup[hidex]*beta + hanning_lookup[lodex]*(1-beta);
0 0 alpha *= hanning_lookup[hidex]*beta + hanning_lookup[lodex]*(1-beta);
0 0 alpha *= hanning_lookup[hidex]*beta + hanning_lookup[lodex]*(1-beta);
0 0 alpha *= hanning_lookup[hidex]*beta + hanning_lookup[lodex]*(1-beta);
981 0 0 } /* end of dimension loop */
0 0 } /* end of dimension loop */
0 0 } /* end of dimension loop */
0 0 } /* end of dimension loop */
1517 1128 } /* end of dimension loop */
0 0 } /* end of dimension loop */
0 0 } /* end of dimension loop */
0 0 } /* end of dimension loop */
0 0 } /* end of dimension loop */
0 0 } /* end of dimension loop */
0 0 } /* end of dimension loop */
0 0 } /* end of dimension loop */
994 0 0 dd = (fabs(dd) - hanning_offset) / blur;
0 0 dd = (fabs(dd) - hanning_offset) / blur;
0 0 dd = (fabs(dd) - hanning_offset) / blur;
0 0 dd = (fabs(dd) - hanning_offset) / blur;
7198 3700 dd = (fabs(dd) - hanning_offset) / blur;
0 0 dd = (fabs(dd) - hanning_offset) / blur;
0 0 dd = (fabs(dd) - hanning_offset) / blur;
0 0 dd = (fabs(dd) - hanning_offset) / blur;
0 0 dd = (fabs(dd) - hanning_offset) / blur;
0 0 dd = (fabs(dd) - hanning_offset) / blur;
1682 841 dd = (fabs(dd) - hanning_offset) / blur;
0 0 dd = (fabs(dd) - hanning_offset) / blur;
997 0 0 i = ndims;
0 0 i = ndims;
0 0 i = ndims;
0 0 i = ndims;
14396 7198 i = ndims;
0 0 i = ndims;
0 0 i = ndims;
0 0 i = ndims;
0 0 i = ndims;
0 0 i = ndims;
3364 1682 i = ndims;
0 0 i = ndims;
1001 0 0 break;
0 0 break;
0 0 break;
0 0 break;
832 6366 break;
0 0 break;
0 0 break;
0 0 break;
0 0 break;
0 0 break;
100 1582 break;
0 0 break;
1006 0 0 PDL_Double sum = 0;
0 0 PDL_Double sum = 0;
0 0 PDL_Double sum = 0;
0 0 PDL_Double sum = 0;
0 0 PDL_Double sum = 0;
0 0 PDL_Double sum = 0;
0 0 PDL_Double sum = 0;
0 0 PDL_Double sum = 0;
0 0 PDL_Double sum = 0;
0 0 PDL_Double sum = 0;
0 0 PDL_Double sum = 0;
0 0 PDL_Double sum = 0;
2868 832 PDL_Double sum = 0;
2868 0 PDL_Double sum = 0;
0 2868 PDL_Double sum = 0;
0 0 PDL_Double sum = 0;
0 0 PDL_Double sum = 0;
0 0 PDL_Double sum = 0;
0 0 PDL_Double sum = 0;
0 0 PDL_Double sum = 0;
0 0 PDL_Double sum = 0;
0 0 PDL_Double sum = 0;
0 0 PDL_Double sum = 0;
0 0 PDL_Double sum = 0;
0 0 PDL_Double sum = 0;
0 0 PDL_Double sum = 0;
0 0 PDL_Double sum = 0;
0 0 PDL_Double sum = 0;
0 0 PDL_Double sum = 0;
0 0 PDL_Double sum = 0;
741 100 PDL_Double sum = 0;
741 0 PDL_Double sum = 0;
0 741 PDL_Double sum = 0;
0 0 PDL_Double sum = 0;
0 0 PDL_Double sum = 0;
0 0 PDL_Double sum = 0;
1026 0 0 lodex = beta;
0 0 lodex = beta;
0 0 lodex = beta;
0 0 lodex = beta;
3348 1850 lodex = beta;
0 0 lodex = beta;
0 0 lodex = beta;
0 0 lodex = beta;
0 0 lodex = beta;
0 0 lodex = beta;
0 0 lodex = beta;
0 0 lodex = beta;
1029 0 0 //do a linear interpolation between the two nearest values
0 0 //do a linear interpolation between the two nearest values
0 0 //do a linear interpolation between the two nearest values
0 0 //do a linear interpolation between the two nearest values
6696 3348 //do a linear interpolation between the two nearest values
0 0 //do a linear interpolation between the two nearest values
0 0 //do a linear interpolation between the two nearest values
0 0 //do a linear interpolation between the two nearest values
0 0 //do a linear interpolation between the two nearest values
0 0 //do a linear interpolation between the two nearest values
0 0 //do a linear interpolation between the two nearest values
0 0 //do a linear interpolation between the two nearest values
1033 0 0 }
0 0 }
0 0 }
0 0 }
892 2456 }
0 0 }
0 0 }
0 0 }
0 0 }
0 0 }
0 0 }
0 0 }
1037 0 0 /* This is the Gaussian rolloff with explicit calculation, preserved */
0 0 /* This is the Gaussian rolloff with explicit calculation, preserved */
0 0 /* This is the Gaussian rolloff with explicit calculation, preserved */
0 0 /* This is the Gaussian rolloff with explicit calculation, preserved */
332 1518 /* This is the Gaussian rolloff with explicit calculation, preserved */
0 0 /* This is the Gaussian rolloff with explicit calculation, preserved */
0 0 /* This is the Gaussian rolloff with explicit calculation, preserved */
0 0 /* This is the Gaussian rolloff with explicit calculation, preserved */
0 0 /* This is the Gaussian rolloff with explicit calculation, preserved */
0 0 /* This is the Gaussian rolloff with explicit calculation, preserved */
0 0 /* This is the Gaussian rolloff with explicit calculation, preserved */
0 0 /* This is the Gaussian rolloff with explicit calculation, preserved */
1052 0 0
0 0
0 0
0 0
9250 9250
0 0
0 0
0 0
0 0
0 0
7182 7182
0 0
1053 0 0 if(sum > GAUSSIAN_MAXVAL)
0 0 if(sum > GAUSSIAN_MAXVAL)
0 0 if(sum > GAUSSIAN_MAXVAL)
0 0 if(sum > GAUSSIAN_MAXVAL)
0 0 if(sum > GAUSSIAN_MAXVAL)
0 0 if(sum > GAUSSIAN_MAXVAL)
0 0 if(sum > GAUSSIAN_MAXVAL)
0 0 if(sum > GAUSSIAN_MAXVAL)
0 9250 if(sum > GAUSSIAN_MAXVAL)
0 0 if(sum > GAUSSIAN_MAXVAL)
0 0 if(sum > GAUSSIAN_MAXVAL)
0 0 if(sum > GAUSSIAN_MAXVAL)
0 0 if(sum > GAUSSIAN_MAXVAL)
0 0 if(sum > GAUSSIAN_MAXVAL)
0 0 if(sum > GAUSSIAN_MAXVAL)
0 0 if(sum > GAUSSIAN_MAXVAL)
0 0 if(sum > GAUSSIAN_MAXVAL)
0 0 if(sum > GAUSSIAN_MAXVAL)
0 0 if(sum > GAUSSIAN_MAXVAL)
0 0 if(sum > GAUSSIAN_MAXVAL)
306 6876 if(sum > GAUSSIAN_MAXVAL)
306 0 if(sum > GAUSSIAN_MAXVAL)
0 0 if(sum > GAUSSIAN_MAXVAL)
0 0 if(sum > GAUSSIAN_MAXVAL)
1066 0 0 $GENERIC() *dat = (($GENERIC() *)(in->data)) + i_off;
0 0 $GENERIC() *dat = (($GENERIC() *)(in->data)) + i_off;
0 0 $GENERIC() *dat = (($GENERIC() *)(in->data)) + i_off;
0 0 $GENERIC() *dat = (($GENERIC() *)(in->data)) + i_off;
0 0 $GENERIC() *dat = (($GENERIC() *)(in->data)) + i_off;
0 0 $GENERIC() *dat = (($GENERIC() *)(in->data)) + i_off;
0 0 $GENERIC() *dat = (($GENERIC() *)(in->data)) + i_off;
0 0 $GENERIC() *dat = (($GENERIC() *)(in->data)) + i_off;
25000 2500 $GENERIC() *dat = (($GENERIC() *)(in->data)) + i_off;
15000 10000 $GENERIC() *dat = (($GENERIC() *)(in->data)) + i_off;
0 0 $GENERIC() *dat = (($GENERIC() *)(in->data)) + i_off;
0 0 $GENERIC() *dat = (($GENERIC() *)(in->data)) + i_off;
0 0 $GENERIC() *dat = (($GENERIC() *)(in->data)) + i_off;
0 0 $GENERIC() *dat = (($GENERIC() *)(in->data)) + i_off;
0 0 $GENERIC() *dat = (($GENERIC() *)(in->data)) + i_off;
0 0 $GENERIC() *dat = (($GENERIC() *)(in->data)) + i_off;
0 0 $GENERIC() *dat = (($GENERIC() *)(in->data)) + i_off;
0 0 $GENERIC() *dat = (($GENERIC() *)(in->data)) + i_off;
0 0 $GENERIC() *dat = (($GENERIC() *)(in->data)) + i_off;
0 0 $GENERIC() *dat = (($GENERIC() *)(in->data)) + i_off;
23402 2203 $GENERIC() *dat = (($GENERIC() *)(in->data)) + i_off;
13904 9498 $GENERIC() *dat = (($GENERIC() *)(in->data)) + i_off;
0 0 $GENERIC() *dat = (($GENERIC() *)(in->data)) + i_off;
0 0 $GENERIC() *dat = (($GENERIC() *)(in->data)) + i_off;
1072 0 0 wgt[i] += alpha;
0 0 wgt[i] += alpha;
0 0 wgt[i] += alpha;
0 0 wgt[i] += alpha;
0 0 wgt[i] += alpha;
0 0 wgt[i] += alpha;
0 0 wgt[i] += alpha;
0 0 wgt[i] += alpha;
14350 650 wgt[i] += alpha;
14350 0 wgt[i] += alpha;
0 0 wgt[i] += alpha;
0 0 wgt[i] += alpha;
0 0 wgt[i] += alpha;
0 0 wgt[i] += alpha;
0 0 wgt[i] += alpha;
0 0 wgt[i] += alpha;
0 0 wgt[i] += alpha;
0 0 wgt[i] += alpha;
0 0 wgt[i] += alpha;
0 0 wgt[i] += alpha;
12626 1278 wgt[i] += alpha;
7651 4975 wgt[i] += alpha;
0 0 wgt[i] += alpha;
0 0 wgt[i] += alpha;
1080 0 0 /* Advance input accumulation loop. */
0 0 /* Advance input accumulation loop. */
0 0 /* Advance input accumulation loop. */
0 0 /* Advance input accumulation loop. */
400 250 /* Advance input accumulation loop. */
0 0 /* Advance input accumulation loop. */
0 0 /* Advance input accumulation loop. */
0 0 /* Advance input accumulation loop. */
0 0 /* Advance input accumulation loop. */
0 0 /* Advance input accumulation loop. */
642 3631 /* Advance input accumulation loop. */
0 0 /* Advance input accumulation loop. */
1082 0 0 carry = 1;
0 0 carry = 1;
0 0 carry = 1;
0 0 carry = 1;
0 250 carry = 1;
0 0 carry = 1;
0 0 carry = 1;
0 0 carry = 1;
0 0 carry = 1;
0 0 carry = 1;
950 2681 carry = 1;
0 0 carry = 1;
1088 0 0 /* Advance the offset into the data array */
0 0 /* Advance the offset into the data array */
0 0 /* Advance the offset into the data array */
0 0 /* Advance the offset into the data array */
0 0 /* Advance the offset into the data array */
0 0 /* Advance the offset into the data array */
0 0 /* Advance the offset into the data array */
0 0 /* Advance the offset into the data array */
0 0 /* Advance the offset into the data array */
0 0 /* Advance the offset into the data array */
100 230 /* Advance the offset into the data array */
0 0 /* Advance the offset into the data array */
1098 0 0 t_vio--;
0 0 t_vio--;
0 0 t_vio--;
0 0 t_vio--;
0 0 t_vio--;
0 0 t_vio--;
0 0 t_vio--;
0 0 t_vio--;
0 0 t_vio--;
0 0 t_vio--;
0 0 t_vio--;
0 0 t_vio--;
0 0 t_vio--;
0 0 t_vio--;
0 0 t_vio--;
0 0 t_vio--;
0 0 t_vio--;
0 0 t_vio--;
0 0 t_vio--;
0 0 t_vio--;
1400 250 t_vio--;
1150 250 t_vio--;
0 0 t_vio--;
0 0 t_vio--;
1099 0 0 else if( j == in->dims[i] )
0 0 else if( j == in->dims[i] )
0 0 else if( j == in->dims[i] )
0 0 else if( j == in->dims[i] )
0 0 else if( j == in->dims[i] )
0 0 else if( j == in->dims[i] )
0 0 else if( j == in->dims[i] )
0 0 else if( j == in->dims[i] )
0 0 else if( j == in->dims[i] )
0 0 else if( j == in->dims[i] )
1000 150 else if( j == in->dims[i] )
0 0 else if( j == in->dims[i] )
1109 0 0 }
0 0 }
0 0 }
0 0 }
12000 3000 }
0 0 }
0 0 }
0 0 }
0 0 }
0 0 }
11280 2624 }
0 0 }
1112 0 0 j += in->dims[i];
0 0 j += in->dims[i];
0 0 j += in->dims[i];
0 0 j += in->dims[i];
2000 12000 j += in->dims[i];
0 0 j += in->dims[i];
0 0 j += in->dims[i];
0 0 j += in->dims[i];
0 0 j += in->dims[i];
0 0 j += in->dims[i];
1782 11280 j += in->dims[i];
0 0 j += in->dims[i];
1119 0 0 i_off += in->dimincs[i];
0 0 i_off += in->dimincs[i];
0 0 i_off += in->dimincs[i];
0 0 i_off += in->dimincs[i];
3000 0 i_off += in->dimincs[i];
0 0 i_off += in->dimincs[i];
0 0 i_off += in->dimincs[i];
0 0 i_off += in->dimincs[i];
0 0 i_off += in->dimincs[i];
0 0 i_off += in->dimincs[i];
2024 600 i_off += in->dimincs[i];
0 0 i_off += in->dimincs[i];
1121 0 0 break;
0 0 break;
0 0 break;
0 0 break;
0 0 break;
0 0 break;
0 0 break;
0 0 break;
3000 0 break;
0 3000 break;
0 0 break;
0 0 break;
0 0 break;
0 0 break;
0 0 break;
0 0 break;
0 0 break;
0 0 break;
0 0 break;
0 0 break;
2024 0 break;
1130 894 break;
0 0 break;
0 0 break;
1125 0 0 /* Now check for carry */
0 0 /* Now check for carry */
0 0 /* Now check for carry */
0 0 /* Now check for carry */
0 0 /* Now check for carry */
0 0 /* Now check for carry */
0 0 /* Now check for carry */
0 0 /* Now check for carry */
2600 400 /* Now check for carry */
0 2600 /* Now check for carry */
0 0 /* Now check for carry */
0 0 /* Now check for carry */
0 0 /* Now check for carry */
0 0 /* Now check for carry */
0 0 /* Now check for carry */
0 0 /* Now check for carry */
0 0 /* Now check for carry */
0 0 /* Now check for carry */
0 0 /* Now check for carry */
0 0 /* Now check for carry */
1382 642 /* Now check for carry */
180 1202 /* Now check for carry */
0 0 /* Now check for carry */
0 0 /* Now check for carry */
1133 0 0
0 0
0 0
0 0
12000 500
0 0
0 0
0 0
0 0
0 0
11280 421
0 0
1142 0 0 if( j < 0 || j >= in->dims[i] )
0 0 if( j < 0 || j >= in->dims[i] )
0 0 if( j < 0 || j >= in->dims[i] )
0 0 if( j < 0 || j >= in->dims[i] )
1000 500 if( j < 0 || j >= in->dims[i] )
0 0 if( j < 0 || j >= in->dims[i] )
0 0 if( j < 0 || j >= in->dims[i] )
0 0 if( j < 0 || j >= in->dims[i] )
0 0 if( j < 0 || j >= in->dims[i] )
0 0 if( j < 0 || j >= in->dims[i] )
842 421 if( j < 0 || j >= in->dims[i] )
0 0 if( j < 0 || j >= in->dims[i] )
1145 0 0 } else {
0 0 } else {
0 0 } else {
0 0 } else {
500 0 } else {
0 0 } else {
0 0 } else {
0 0 } else {
0 0 } else {
0 0 } else {
421 0 } else {
0 0 } else {
1147 0 0 }
0 0 }
0 0 }
0 0 }
500 500 }
0 0 }
0 0 }
0 0 }
0 0 }
0 0 }
421 421 }
0 0 }
1148 0 0 }
0 0 }
0 0 }
0 0 }
0 0 }
0 0 }
0 0 }
0 0 }
500 0 }
500 0 }
0 0 }
0 0 }
0 0 }
0 0 }
0 0 }
0 0 }
0 0 }
0 0 }
0 0 }
0 0 }
326 95 }
326 0 }
0 0 }
0 0 }
1155 0 0 PDL_Double *wg2 = wgt2;
0 0 PDL_Double *wg2 = wgt2;
0 0 PDL_Double *wg2 = wgt2;
0 0 PDL_Double *wg2 = wgt2;
0 0 PDL_Double *wg2 = wgt2;
0 0 PDL_Double *wg2 = wgt2;
0 0 PDL_Double *wg2 = wgt2;
0 0 PDL_Double *wg2 = wgt2;
0 0 PDL_Double *wg2 = wgt2;
0 0 PDL_Double *wg2 = wgt2;
0 0 PDL_Double *wg2 = wgt2;
0 0 PDL_Double *wg2 = wgt2;
1156 0 0 $GENERIC() *dat = out->data;
0 0 $GENERIC() *dat = out->data;
0 0 $GENERIC() *dat = out->data;
0 0 $GENERIC() *dat = out->data;
0 0 $GENERIC() *dat = out->data;
0 0 $GENERIC() *dat = out->data;
0 0 $GENERIC() *dat = out->data;
0 0 $GENERIC() *dat = out->data;
0 0 $GENERIC() *dat = out->data;
0 0 $GENERIC() *dat = out->data;
0 0 $GENERIC() *dat = out->data;
0 0 $GENERIC() *dat = out->data;
0 0 $GENERIC() *dat = out->data;
0 0 $GENERIC() *dat = out->data;
0 0 $GENERIC() *dat = out->data;
0 0 $GENERIC() *dat = out->data;
0 0 $GENERIC() *dat = out->data;
0 0 $GENERIC() *dat = out->data;
0 0 $GENERIC() *dat = out->data;
0 0 $GENERIC() *dat = out->data;
0 0 $GENERIC() *dat = out->data;
0 0 $GENERIC() *dat = out->data;
0 0 $GENERIC() *dat = out->data;
0 0 $GENERIC() *dat = out->data;
1172 0 0 for(i=0; i < out->dims[ndims]; i++) {
0 0 for(i=0; i < out->dims[ndims]; i++) {
0 0 for(i=0; i < out->dims[ndims]; i++) {
0 0 for(i=0; i < out->dims[ndims]; i++) {
0 0 for(i=0; i < out->dims[ndims]; i++) {
0 0 for(i=0; i < out->dims[ndims]; i++) {
0 0 for(i=0; i < out->dims[ndims]; i++) {
0 0 for(i=0; i < out->dims[ndims]; i++) {
0 0 for(i=0; i < out->dims[ndims]; i++) {
0 0 for(i=0; i < out->dims[ndims]; i++) {
0 0 for(i=0; i < out->dims[ndims]; i++) {
0 0 for(i=0; i < out->dims[ndims]; i++) {
1174 0 0 *dat = *(ac++) / *(wg++) * det;
0 0 *dat = *(ac++) / *(wg++) * det;
0 0 *dat = *(ac++) / *(wg++) * det;
0 0 *dat = *(ac++) / *(wg++) * det;
0 0 *dat = *(ac++) / *(wg++) * det;
0 0 *dat = *(ac++) / *(wg++) * det;
0 0 *dat = *(ac++) / *(wg++) * det;
0 0 *dat = *(ac++) / *(wg++) * det;
0 0 *dat = *(ac++) / *(wg++) * det;
0 0 *dat = *(ac++) / *(wg++) * det;
0 0 *dat = *(ac++) / *(wg++) * det;
0 0 *dat = *(ac++) / *(wg++) * det;
1181 0 0 } /* end of for loop */
0 0 } /* end of for loop */
0 0 } /* end of for loop */
0 0 } /* end of for loop */
5 495 } /* end of for loop */
0 0 } /* end of for loop */
0 0 } /* end of for loop */
0 0 } /* end of for loop */
0 0 } /* end of for loop */
0 0 } /* end of for loop */
7 414 } /* end of for loop */
0 0 } /* end of for loop */