GCC Code Coverage Report


Directory: ./
File: numerics/predicates/det4d.h
Date: 2026-09-27 03:12:47
Exec Total Coverage
Lines: 36 37 97.3%
Functions: 1 1 100.0%
Branches: 11 14 78.6%

Line Branch Exec Source
1 /* Automatically generated code, do not edit */
2 /* Generated from source file: det4d.pck */
3
4 4386 inline int det_4d_filter( const double* p0, const double* p1, const double* p2, const double* p3) {
5 double m12;
6 4386 m12 = ((p1[0] * p0[1]) - (p0[0] * p1[1]));
7 double m13;
8 4386 m13 = ((p2[0] * p0[1]) - (p0[0] * p2[1]));
9 double m14;
10 4386 m14 = ((p3[0] * p0[1]) - (p0[0] * p3[1]));
11 double m23;
12 4386 m23 = ((p2[0] * p1[1]) - (p1[0] * p2[1]));
13 double m24;
14 4386 m24 = ((p3[0] * p1[1]) - (p1[0] * p3[1]));
15 double m34;
16 4386 m34 = ((p3[0] * p2[1]) - (p2[0] * p3[1]));
17 double m123;
18 4386 m123 = (((m23 * p0[2]) - (m13 * p1[2])) + (m12 * p2[2]));
19 double m124;
20 4386 m124 = (((m24 * p0[2]) - (m14 * p1[2])) + (m12 * p3[2]));
21 double m134;
22 4386 m134 = (((m34 * p0[2]) - (m14 * p2[2])) + (m13 * p3[2]));
23 double m234;
24 4386 m234 = (((m34 * p1[2]) - (m24 * p2[2])) + (m23 * p3[2]));
25 double Delta;
26 4386 Delta = ((((m234 * p0[3]) - (m134 * p1[3])) + (m124 * p2[3])) - (m123 * p3[3]));
27 int int_tmp_result;
28 double eps;
29 4386 double max1 = fabs(p0[0]);
30 4386 if( (max1 < fabs(p1[0])) )
31 {
32 max1 = fabs(p1[0]);
33 }
34 4386 if( (max1 < fabs(p2[0])) )
35 {
36 max1 = fabs(p2[0]);
37 }
38 4386 if( (max1 < fabs(p3[0])) )
39 {
40 max1 = fabs(p3[0]);
41 }
42 4386 double max2 = fabs(p0[1]);
43 4386 if( (max2 < fabs(p1[1])) )
44 {
45 max2 = fabs(p1[1]);
46 }
47 4386 if( (max2 < fabs(p2[1])) )
48 {
49 max2 = fabs(p2[1]);
50 }
51 4386 if( (max2 < fabs(p3[1])) )
52 {
53 max2 = fabs(p3[1]);
54 }
55 4386 double max3 = fabs(p0[2]);
56 4386 if( (max3 < fabs(p1[2])) )
57 {
58 max3 = fabs(p1[2]);
59 }
60 4386 if( (max3 < fabs(p2[2])) )
61 {
62 max3 = fabs(p2[2]);
63 }
64 4386 if( (max3 < fabs(p3[2])) )
65 {
66 max3 = fabs(p3[2]);
67 }
68 4386 double max4 = fabs(p0[3]);
69 4386 if( (max4 < fabs(p1[3])) )
70 {
71 max4 = fabs(p1[3]);
72 }
73 4386 if( (max4 < fabs(p2[3])) )
74 {
75 max4 = fabs(p2[3]);
76 }
77 4386 if( (max4 < fabs(p3[3])) )
78 {
79 max4 = fabs(p3[3]);
80 }
81 double lower_bound_1;
82 double upper_bound_1;
83 lower_bound_1 = max1;
84 upper_bound_1 = max1;
85
2/2
✓ Branch 0 taken 2852 times.
✓ Branch 1 taken 1534 times.
4386 if( (max2 < lower_bound_1) )
86 {
87 lower_bound_1 = max2;
88 }
89 else
90 {
91 if( (max2 > upper_bound_1) )
92 {
93 upper_bound_1 = max2;
94 }
95 }
96
2/2
✓ Branch 0 taken 2618 times.
✓ Branch 1 taken 1768 times.
4386 if( (max3 < lower_bound_1) )
97 {
98 lower_bound_1 = max3;
99 }
100 else
101 {
102 if( (max3 > upper_bound_1) )
103 {
104 upper_bound_1 = max3;
105 }
106 }
107
2/2
✓ Branch 0 taken 3397 times.
✓ Branch 1 taken 989 times.
4386 if( (max4 < lower_bound_1) )
108 {
109 lower_bound_1 = max4;
110 }
111 else
112 {
113 if( (max4 > upper_bound_1) )
114 {
115 upper_bound_1 = max4;
116 }
117 }
118
1/2
✓ Branch 0 taken 4386 times.
✗ Branch 1 not taken.
4386 if( (lower_bound_1 < 3.20402459074399025456e-74) )
119 {
120 return FPG_UNCERTAIN_VALUE;
121 }
122 else
123 {
124
1/2
✓ Branch 0 taken 4386 times.
✗ Branch 1 not taken.
4386 if( (upper_bound_1 > 1.44740111546645196071e+76) )
125 {
126 return FPG_UNCERTAIN_VALUE;
127 }
128 4386 eps = (2.11135406605316806158e-14 * (((max1 * max2) * max3) * max4));
129
2/2
✓ Branch 0 taken 4273 times.
✓ Branch 1 taken 113 times.
4386 if( (Delta > eps) )
130 {
131 int_tmp_result = 1;
132 }
133 else
134 {
135
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 4273 times.
4273 if( (Delta < -eps) )
136 {
137 int_tmp_result = -1;
138 }
139 else
140 {
141 ✗ return FPG_UNCERTAIN_VALUE;
142 }
143 }
144 }
145 return int_tmp_result;
146 }
147