| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | /* Automatically generated code, do not edit */ | ||
| 2 | /* Generated from source file: det3d.pck */ | ||
| 3 | |||
| 4 | 145168 | inline int det_3d_filter( const double* p0, const double* p1, const double* p2) { | |
| 5 | double Delta; | ||
| 6 | 145168 | Delta = (((p0[0] * ((p1[1] * p2[2]) - (p1[2] * p2[1]))) - (p1[0] * ((p0[1] * p2[2]) - (p0[2] * p2[1])))) + (p2[0] * ((p0[1] * p1[2]) - (p0[2] * p1[1])))); | |
| 7 | int int_tmp_result; | ||
| 8 | double eps; | ||
| 9 | 145168 | double max1 = fabs(p0[0]); | |
| 10 | 145168 | if( (max1 < fabs(p1[0])) ) | |
| 11 | { | ||
| 12 | max1 = fabs(p1[0]); | ||
| 13 | } | ||
| 14 | 145168 | if( (max1 < fabs(p2[0])) ) | |
| 15 | { | ||
| 16 | max1 = fabs(p2[0]); | ||
| 17 | } | ||
| 18 | 145168 | double max2 = fabs(p0[1]); | |
| 19 | 145168 | if( (max2 < fabs(p0[2])) ) | |
| 20 | { | ||
| 21 | max2 = fabs(p0[2]); | ||
| 22 | } | ||
| 23 | 145168 | if( (max2 < fabs(p1[1])) ) | |
| 24 | { | ||
| 25 | max2 = fabs(p1[1]); | ||
| 26 | } | ||
| 27 | 145168 | if( (max2 < fabs(p1[2])) ) | |
| 28 | { | ||
| 29 | max2 = fabs(p1[2]); | ||
| 30 | } | ||
| 31 | double max3 = fabs(p1[1]); | ||
| 32 | if( (max3 < fabs(p1[2])) ) | ||
| 33 | { | ||
| 34 | max3 = fabs(p1[2]); | ||
| 35 | } | ||
| 36 | 145168 | if( (max3 < fabs(p2[1])) ) | |
| 37 | { | ||
| 38 | max3 = fabs(p2[1]); | ||
| 39 | } | ||
| 40 | 145168 | if( (max3 < fabs(p2[2])) ) | |
| 41 | { | ||
| 42 | max3 = fabs(p2[2]); | ||
| 43 | } | ||
| 44 | double lower_bound_1; | ||
| 45 | double upper_bound_1; | ||
| 46 | lower_bound_1 = max1; | ||
| 47 | upper_bound_1 = max1; | ||
| 48 |
2/2✓ Branch 0 taken 85356 times.
✓ Branch 1 taken 59812 times.
|
145168 | if( (max2 < lower_bound_1) ) |
| 49 | { | ||
| 50 | lower_bound_1 = max2; | ||
| 51 | } | ||
| 52 | else | ||
| 53 | { | ||
| 54 | if( (max2 > upper_bound_1) ) | ||
| 55 | { | ||
| 56 | upper_bound_1 = max2; | ||
| 57 | } | ||
| 58 | } | ||
| 59 |
2/2✓ Branch 0 taken 138440 times.
✓ Branch 1 taken 6728 times.
|
145168 | if( (max3 < lower_bound_1) ) |
| 60 | { | ||
| 61 | lower_bound_1 = max3; | ||
| 62 | } | ||
| 63 | else | ||
| 64 | { | ||
| 65 | if( (max3 > upper_bound_1) ) | ||
| 66 | { | ||
| 67 | upper_bound_1 = max3; | ||
| 68 | } | ||
| 69 | } | ||
| 70 |
2/2✓ Branch 0 taken 144264 times.
✓ Branch 1 taken 904 times.
|
145168 | if( (lower_bound_1 < 1.92663387981871579179e-98) ) |
| 71 | { | ||
| 72 | return FPG_UNCERTAIN_VALUE; | ||
| 73 | } | ||
| 74 | else | ||
| 75 | { | ||
| 76 |
1/2✓ Branch 0 taken 144264 times.
✗ Branch 1 not taken.
|
144264 | if( (upper_bound_1 > 1.11987237108890185662e+102) ) |
| 77 | { | ||
| 78 | return FPG_UNCERTAIN_VALUE; | ||
| 79 | } | ||
| 80 | 144264 | eps = (3.11133555671680765034e-15 * ((max2 * max3) * max1)); | |
| 81 |
1/2✓ Branch 0 taken 144264 times.
✗ Branch 1 not taken.
|
144264 | if( (Delta > eps) ) |
| 82 | { | ||
| 83 | int_tmp_result = 1; | ||
| 84 | } | ||
| 85 | else | ||
| 86 | { | ||
| 87 |
1/2✓ Branch 0 taken 144264 times.
✗ Branch 1 not taken.
|
144264 | if( (Delta < -eps) ) |
| 88 | { | ||
| 89 | int_tmp_result = -1; | ||
| 90 | } | ||
| 91 | else | ||
| 92 | { | ||
| 93 | 144264 | return FPG_UNCERTAIN_VALUE; | |
| 94 | } | ||
| 95 | } | ||
| 96 | } | ||
| 97 | return int_tmp_result; | ||
| 98 | } | ||
| 99 |