/external/chromium_org/third_party/skia/src/pathops/ |
SkOpSpan.h | 16 SkPoint fPt; // computed when the curves are intersected
|
SkPathOpsSpan.h | 16 SkPoint fPt; // computed when the curves are intersected
|
SkIntersections.cpp | 77 fPt[index] = pt; 82 if (pt.roughlyEqual(fPt[index])) { 93 memmove(&fPt[index + 1], &fPt[index], sizeof(fPt[0]) * remaining); 99 fPt[index] = pt; 139 || startPt.approximatelyEqual(fPt[index]) 140 || endPt.approximatelyEqual(fPt[index]))) { 153 memmove(&fPt[index], &fPt[index + 1], sizeof(fPt[0]) * remaining) [all...] |
SkIntersections.h | 23 sk_bzero(fPt, sizeof(fPt)); 40 memcpy(fPt, i.fPt, sizeof(fPt)); 133 return fPt[index]; 246 SkDPoint fPt[9];
|
SkDLineIntersection.cpp | 30 fPt[0] = line.ptAtT(fT[0][0]); 32 fPt[1] = line.ptAtT(fT[0][1]);
|
SkDCubicIntersection.cpp | 462 fPt[1] = fPt[last]; 507 fPt[1] = fPt[last];
|
SkOpSegment.cpp | 270 fTs[tIndexStart].fPt); 279 addTPair(fTs[tIndex].fT, other, other->fTs[oIndexStart].fT, false, fTs[tIndex].fPt); 316 SkPoint ptStart = fTs[tIndex].fPt; 331 ptStart = fTs[tIndex].fPt; 457 span->fPt = pt; [all...] |
SkDQuadIntersection.cpp | 449 insertCoincident(copyI[0][0], copyI[1][0], copyI.fPt[0]); 451 insertCoincident(copyI[0][last], copyI[1][last], copyI.fPt[last]);
|
SkDCubicLineIntersection.cpp | 324 fPt[index] = cubic.ptAtT(fT[0][index]);
|
SkDQuadLineIntersection.cpp | 399 fPt[index] = quad.ptAtT(fT[0][index]);
|
SkOpSegment.h | 219 return span->fPt;
|
/external/skia/src/pathops/ |
SkOpSpan.h | 16 SkPoint fPt; // computed when the curves are intersected
|
SkPathOpsSpan.h | 16 SkPoint fPt; // computed when the curves are intersected
|
SkIntersections.cpp | 77 fPt[index] = pt; 82 if (pt.roughlyEqual(fPt[index])) { 93 memmove(&fPt[index + 1], &fPt[index], sizeof(fPt[0]) * remaining); 99 fPt[index] = pt; 139 || startPt.approximatelyEqual(fPt[index]) 140 || endPt.approximatelyEqual(fPt[index]))) { 153 memmove(&fPt[index], &fPt[index + 1], sizeof(fPt[0]) * remaining) [all...] |
SkIntersections.h | 23 sk_bzero(fPt, sizeof(fPt)); 40 memcpy(fPt, i.fPt, sizeof(fPt)); 133 return fPt[index]; 246 SkDPoint fPt[9];
|
SkDLineIntersection.cpp | 30 fPt[0] = line.ptAtT(fT[0][0]); 32 fPt[1] = line.ptAtT(fT[0][1]);
|
SkDCubicIntersection.cpp | 462 fPt[1] = fPt[last]; 507 fPt[1] = fPt[last];
|
SkOpSegment.cpp | 270 fTs[tIndexStart].fPt); 279 addTPair(fTs[tIndex].fT, other, other->fTs[oIndexStart].fT, false, fTs[tIndex].fPt); 316 SkPoint ptStart = fTs[tIndex].fPt; 331 ptStart = fTs[tIndex].fPt; 457 span->fPt = pt; [all...] |
SkDQuadIntersection.cpp | 449 insertCoincident(copyI[0][0], copyI[1][0], copyI.fPt[0]); 451 insertCoincident(copyI[0][last], copyI[1][last], copyI.fPt[last]);
|
SkDCubicLineIntersection.cpp | 324 fPt[index] = cubic.ptAtT(fT[0][index]);
|
SkDQuadLineIntersection.cpp | 399 fPt[index] = quad.ptAtT(fT[0][index]);
|
SkOpSegment.h | 219 return span->fPt;
|