Lines Matching refs:ptAtT
123 SkDPoint mid = q2.ptAtT(tMid); in add_intercept()
141 SkDPoint pt2 = q1.ptAtT(rootTs[0][0]); in add_intercept()
163 SkDPoint qPt = q2.ptAtT(t); in is_linear_inner()
164 SkDPoint lPt = testLines[index]->ptAtT(rootTs[1][idx2]); in is_linear_inner()
186 SkDPoint end = q2.ptAtT(t2s); in is_linear_inner()
191 end = q2.ptAtT(t2e); in is_linear_inner()
298 if (calcMask & (1 << 1)) t1[1] = quad1.ptAtT(*t1Seed); in binary_search()
299 if (calcMask & (1 << 4)) t2[1] = quad2.ptAtT(*t2Seed); in binary_search()
308 if (calcMask & (1 << 0)) t1[0] = quad1.ptAtT(*t1Seed - tStep); in binary_search()
309 if (calcMask & (1 << 2)) t1[2] = quad1.ptAtT(*t1Seed + tStep); in binary_search()
310 if (calcMask & (1 << 3)) t2[0] = quad2.ptAtT(*t2Seed - tStep); in binary_search()
311 if (calcMask & (1 << 5)) t2[2] = quad2.ptAtT(*t2Seed + tStep); in binary_search()
446 SkDPoint testPt1 = q1.ptAtT(testT); in intersect()
448 SkDPoint testPt2 = q2.ptAtT(testT); in intersect()
473 pts1[index] = q1.ptAtT(roots1Copy[index]); in intersect()
481 pts2[index] = q2.ptAtT(roots2Copy[index]); in intersect()