Lines Matching refs:quadT
149 double quadT = rootVals[index];
150 double lineT = findLineT(quadT);
152 if (pinTs(&quadT, &lineT, &pt, kPointUninitialized)) {
153 fIntersections->insert(quadT, lineT, pt);
178 double quadT = rootVals[index];
179 SkDPoint pt = fQuad.ptAtT(quadT);
181 if (pinTs(&quadT, &lineT, &pt, kPointInitialized)) {
182 fIntersections->insert(quadT, lineT, pt);
209 double quadT = rootVals[index];
210 SkDPoint pt = fQuad.ptAtT(quadT);
212 if (pinTs(&quadT, &lineT, &pt, kPointInitialized)) {
213 fIntersections->insert(quadT, lineT, pt);
230 double quadT = (double) (qIndex >> 1);
231 fIntersections->insert(quadT, lineT, fQuad[qIndex]);
237 double quadT = (double) (qIndex >> 1);
238 if (fIntersections->hasT(quadT)) {
245 fIntersections->insert(quadT, lineT, fQuad[qIndex]);
256 double quadT = (double) (qIndex >> 1);
257 fIntersections->insert(quadT, lineT, fQuad[qIndex]);
263 double quadT = (double) (qIndex >> 1);
264 if (fIntersections->hasT(quadT)) {
271 fIntersections->insert(quadT, lineT, fQuad[qIndex]);
282 double quadT = (double) (qIndex >> 1);
283 fIntersections->insert(quadT, lineT, fQuad[qIndex]);
289 double quadT = (double) (qIndex >> 1);
290 if (fIntersections->hasT(quadT)) {
297 fIntersections->insert(quadT, lineT, fQuad[qIndex]);
312 bool pinTs(double* quadT, double* lineT, SkDPoint* pt, PinTPoint ptSet) {
319 double qT = *quadT = SkPinT(*quadT);
339 *quadT = 0;
342 *quadT = 1;
