28     double minT1, minT2, maxT1, maxT2;  in intersect()  local
29     if (!bezier_clip(cubic2, cubic1, minT1, maxT1)) {  in intersect()
36     if (maxT1 - minT1 < maxT2 - minT2) {  in intersect()
40         split = maxT1 - minT1 > tClipLimit;  in intersect()
42         minT1 = 0;  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
54     sub_divide(cubic1, minT1, maxT1, intersections.swapped() ? larger : smaller);  in intersect()
71                 lineTs.fT[1][0] = interp(minT1, maxT1, lineTs.fT[1][0]);  in intersect()
73                 lineTs.fT[0][0] = interp(minT1, maxT1, lineTs.fT[0][0]);  in intersect()
86                 minT1 = (minT1 + maxT1) / 2;  in intersect()
89                 minT1 = interp(minT1, maxT1, minT);  in intersect()
93             xy_at_t(cubic1, minT1, pt.x, pt.y);  in intersect()
94             intersections.insert(minT1, minT2, pt);  in intersect()
102         double newMinT1 = interp(minT1, maxT1, minT);  in intersect()
103         double newMaxT1 = interp(minT1, maxT1, maxT);  in intersect()
104         split = (newMaxT1 - newMinT1 > (maxT1 - minT1) * tClipLimit) << 1;  in intersect()
108                 __FUNCTION__, depth, splits, newMinT1, newMaxT1, minT1, maxT1,  in intersect()
111         minT1 = newMinT1;  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
134             double middle1 = (maxT1 + minT1) / 2;  in chop()
135             intersect(minT1, middle1, minT2, maxT2);  in chop()
139             intersect(minT1, maxT1, minT2, middle2);  in chop()
140             intersect(minT1, maxT1, middle2, maxT2);  in chop()
147     bool result = intersect(minT1, maxT1, minT2, maxT2);  in chop()