Lines Matching refs:T0
342 // We find T0..T3 below to be the dividing points between these five sections.
343 float T0, T1, T2, T3;
351 T0 = T[0];
361 T0 = roots[0].front();
374 // Guarantee that T0..T3 are monotonic.
375 if (T0 > T3) {
378 T0 = T1 = T2 = T3 = (T0 + T3) / 2;
385 // Clamp T1 & T2 inside T0..T3. The only reason this would be necessary is if we have
387 T1 = std::max(T0, std::min(T1, T3));
388 T2 = std::max(T0, std::min(T2, T3));
390 // Next we chop the cubic up at all T0..T3 inside 0..1 and store the resulting segments.
394 &GrCCGeometry::appendCubicApproximation>(p0, p1, p2, p3, T0);
418 &GrCCGeometry::appendCubicApproximation>(p0, ab1, abc1, abcd1, T0/T1);