/external/chromium_org/third_party/skia/src/pathops/ |
SkOpSpan.h | 16 SkPoint fPt; // computed when the curves are intersected
|
SkIntersections.cpp | 84 fPt[index] = pt; 89 if (pt.roughlyEqual(fPt[index])) { 105 memmove(&fPt[index + 1], &fPt[index], sizeof(fPt[0]) * remaining); 112 fPt[index] = pt; 160 || startPt.approximatelyEqual(fPt[index]) 161 || endPt.approximatelyEqual(fPt[index]))) { 174 memmove(&fPt[index], &fPt[index + 1], sizeof(fPt[0]) * remaining) [all...] |
SkIntersections.h | 23 sk_bzero(fPt, sizeof(fPt)); 41 memcpy(fPt, i.fPt, sizeof(fPt)); 144 return fPt[index]; 272 SkDPoint fPt[9]; // FIXME: since scans store points as SkPoint, this should also
|
SkOpSegment.cpp | 223 } while (startPt != fTs[tIndex].fPt && tIndex < tCount); 227 } while (endPt != other->fTs[oIndex].fPt && oIndex < oCount); 231 nextPt = &fTs[++tIndex].fPt; 237 oNextPt = &other->fTs[++oIndex].fPt; 258 fTs[tIndexStart].fPt); 267 addTPair(fTs[tIndex].fT, other, other->fTs[oIndexStart].fT, false, fTs[tIndex].fPt); 301 } while (startPt != fTs[tIndex].fPt); 304 } while (startPt != other->fTs[oIndex].fPt); 312 workPt = &fTs[++tIndex].fPt; 315 workPt = &other->fTs[++oIndex].fPt; [all...] |
SkDLineIntersection.cpp | 59 fPt[0] = line.ptAtT(fT[0][0]); 61 fPt[1] = line.ptAtT(fT[0][1]); 231 fPt[0].fX = xIntercept; 232 fPt[0].fY = y; 319 fPt[0].fX = x; 320 fPt[0].fY = yIntercept;
|
SkDCubicIntersection.cpp | 271 fPt[1] = fPt[last]; 532 if (!pt.approximatelyEqual(fPt[exIdx])) { 538 if (!pt.approximatelyEqual(fPt[exIdx])) { 550 if (!pt.approximatelyEqual(fPt[cpIdx])) { 556 if (!pt.approximatelyEqual(fPt[cpIdx])) { 604 fPt[1] = fPt[last];
|
SkPathOpsDebug.cpp | 106 SkDPoint::dump(fPt);
|
SkDQuadIntersection.cpp | 455 insertCoincident(copyI[0][0], copyI[1][0], copyI.fPt[0]); 457 insertCoincident(copyI[0][last], copyI[1][last], copyI.fPt[last]);
|
SkOpSegment.h | 221 return span->fPt; 332 SkPoint fPt;
|
SkDCubicLineIntersection.cpp | 355 fPt[index] = cubic.ptAtT(fT[0][index]);
|
SkDQuadLineIntersection.cpp | 410 fPt[index] = quad.ptAtT(fT[0][index]);
|
/external/skia/src/pathops/ |
SkOpSpan.h | 16 SkPoint fPt; // computed when the curves are intersected
|
SkIntersections.cpp | 84 fPt[index] = pt; 89 if (pt.roughlyEqual(fPt[index])) { 105 memmove(&fPt[index + 1], &fPt[index], sizeof(fPt[0]) * remaining); 112 fPt[index] = pt; 160 || startPt.approximatelyEqual(fPt[index]) 161 || endPt.approximatelyEqual(fPt[index]))) { 174 memmove(&fPt[index], &fPt[index + 1], sizeof(fPt[0]) * remaining) [all...] |
SkIntersections.h | 23 sk_bzero(fPt, sizeof(fPt)); 41 memcpy(fPt, i.fPt, sizeof(fPt)); 144 return fPt[index]; 272 SkDPoint fPt[9]; // FIXME: since scans store points as SkPoint, this should also
|
SkOpSegment.cpp | 223 } while (startPt != fTs[tIndex].fPt && tIndex < tCount); 227 } while (endPt != other->fTs[oIndex].fPt && oIndex < oCount); 231 nextPt = &fTs[++tIndex].fPt; 237 oNextPt = &other->fTs[++oIndex].fPt; 258 fTs[tIndexStart].fPt); 267 addTPair(fTs[tIndex].fT, other, other->fTs[oIndexStart].fT, false, fTs[tIndex].fPt); 301 } while (startPt != fTs[tIndex].fPt); 304 } while (startPt != other->fTs[oIndex].fPt); 312 workPt = &fTs[++tIndex].fPt; 315 workPt = &other->fTs[++oIndex].fPt; [all...] |
SkDLineIntersection.cpp | 59 fPt[0] = line.ptAtT(fT[0][0]); 61 fPt[1] = line.ptAtT(fT[0][1]); 231 fPt[0].fX = xIntercept; 232 fPt[0].fY = y; 319 fPt[0].fX = x; 320 fPt[0].fY = yIntercept;
|
SkDCubicIntersection.cpp | 271 fPt[1] = fPt[last]; 532 if (!pt.approximatelyEqual(fPt[exIdx])) { 538 if (!pt.approximatelyEqual(fPt[exIdx])) { 550 if (!pt.approximatelyEqual(fPt[cpIdx])) { 556 if (!pt.approximatelyEqual(fPt[cpIdx])) { 604 fPt[1] = fPt[last];
|
SkPathOpsDebug.cpp | 106 SkDPoint::dump(fPt);
|
SkDQuadIntersection.cpp | 455 insertCoincident(copyI[0][0], copyI[1][0], copyI.fPt[0]); 457 insertCoincident(copyI[0][last], copyI[1][last], copyI.fPt[last]);
|
SkOpSegment.h | 221 return span->fPt; 332 SkPoint fPt;
|
SkDCubicLineIntersection.cpp | 355 fPt[index] = cubic.ptAtT(fT[0][index]);
|
SkDQuadLineIntersection.cpp | 410 fPt[index] = quad.ptAtT(fT[0][index]);
|