28     double minT1, minT2, maxT1, maxT2;  in intersect()  local
32     if (!bezier_clip(cubic1, cubic2, minT2, maxT2)) {  in intersect()
36     if (maxT1 - minT1 < maxT2 - minT2) {  in intersect()
39         maxT2 = 1;  in intersect()
44         split = (maxT2 - minT2 > tClipLimit) << 1;  in intersect()
46     return chop(minT1, maxT1, minT2, maxT2, split);  in intersect()
51 bool intersect(double minT1, double maxT1, double minT2, double maxT2) {  in intersect()  argument
55     sub_divide(cubic2, minT2, maxT2, intersections.swapped() ? smaller : larger);  in intersect()
70                 lineTs.fT[0][0] = interp(minT2, maxT2, lineTs.fT[0][0]);  in intersect()
74                 lineTs.fT[1][0] = interp(minT2, maxT2, lineTs.fT[1][0]);  in intersect()
87                 minT2 = interp(minT2, maxT2, minT);  in intersect()
90                 minT2 = (minT2 + maxT2) / 2;  in intersect()
114         double newMinT2 = interp(minT2, maxT2, minT);  in intersect()
115         double newMaxT2 = interp(minT2, maxT2, maxT);  in intersect()
116         split = newMaxT2 - newMinT2 > (maxT2 - minT2) * tClipLimit;  in intersect()
119                 __FUNCTION__, depth, splits, newMinT2, newMaxT2, minT2, maxT2,  in intersect()
123         maxT2 = newMaxT2;  in intersect()
125     return chop(minT1, maxT1, minT2, maxT2, split);  in intersect()
128 bool chop(double minT1, double maxT1, double minT2, double maxT2, int split) {  in chop()  argument
135             intersect(minT1, middle1, minT2, maxT2);  in chop()
136             intersect(middle1, maxT1, minT2, maxT2);  in chop()
138             double middle2 = (maxT2 + minT2) / 2;  in chop()
140             intersect(minT1, maxT1, middle2, maxT2);  in chop()
147     bool result = intersect(minT1, maxT1, minT2, maxT2);  in chop()