• Home
  • Raw
  • Download

Lines Matching refs:minT1

31     double minT1, minT2, maxT1, maxT2;  in intersect()  local
32 if (!bezier_clip(quad2, quad1, minT1, maxT1)) { in intersect()
41 if (maxT1 - minT1 < maxT2 - minT2) { in intersect()
45 split = maxT1 - minT1 > tClipLimit; in intersect()
47 minT1 = 0; in intersect()
51 return chop(minT1, maxT1, minT2, maxT2, split); in intersect()
56 bool intersect(double minT1, double maxT1, double minT2, double maxT2) { in intersect() argument
57 bool t1IsLine = maxT1 - minT1 <= quad1Divisions; in intersect()
60 return intersectAsLine(minT1, maxT1, minT2, maxT2, t1IsLine, t2IsLine); in intersect()
64 sub_divide(quad1, minT1, maxT1, intersections.swapped() ? larger : smaller); in intersect()
74 xy_at_t(quad1, minT1, q1pt.x, q1pt.y); in intersect()
76 smallT = minT1; in intersect()
83 smallT = interp(minT1, maxT1, minT); in intersect()
101 double newMinT1 = interp(minT1, maxT1, minT); in intersect()
102 double newMaxT1 = interp(minT1, maxT1, maxT); in intersect()
103 split = (newMaxT1 - newMinT1 > (maxT1 - minT1) * tClipLimit) << 1; in intersect()
107 splits, newMinT1, newMaxT1, minT1, maxT1, split); in intersect()
109 minT1 = newMinT1; in intersect()
122 return chop(minT1, maxT1, minT2, maxT2, split); in intersect()
125 bool intersectAsLine(double minT1, double maxT1, double minT2, double maxT2, in intersectAsLine() argument
131 SkTSwap(minT1, minT2); in intersectAsLine()
136 if ((earlyExit = coinMaxT1 == minT1)) { in intersectAsLine()
150 xy_at_t(quad1, minT1, line1[0].x, line1[0].y); in intersectAsLine()
163 smallT1 = interp(minT1, maxT1, t1[0]); in intersectAsLine()
165 smallT2 = interp(minT1, maxT1, t1[1]); in intersectAsLine()
169 smallT1 = interp(minT1, maxT1, t1[0]); in intersectAsLine()
190 smallT1 = interp(minT1, maxT1, smallT1); in intersectAsLine()
191 smallT2 = interp(minT1, maxT1, smallT2); in intersectAsLine()
204 smallT1 = interp(minT1, maxT1, smallT1); in intersectAsLine()
213 coinMinT1 = minT1; in intersectAsLine()
221 bool chop(double minT1, double maxT1, double minT2, double maxT2, int split) { in chop() argument
227 double middle1 = (maxT1 + minT1) / 2; in chop()
228 intersect(minT1, middle1, minT2, maxT2); in chop()
232 intersect(minT1, maxT1, minT2, middle2); in chop()
233 intersect(minT1, maxT1, middle2, maxT2); in chop()
240 bool result = intersect(minT1, maxT1, minT2, maxT2); in chop()