| /external/skia/src/core/ |
| SkQuadClipper.cpp | 51 bool SkQuadClipper::clipQuad(const SkPoint srcPts[3], SkPoint dst[3]) {
55 if (srcPts[0].fY > srcPts[2].fY) {
56 dst[0] = srcPts[2];
57 dst[1] = srcPts[1];
58 dst[2] = srcPts[0];
61 memcpy(dst, srcPts, 3 * sizeof(SkPoint));
|
| SkCubicClipper.cpp | 107 bool SkCubicClipper::clipCubic(const SkPoint srcPts[4], SkPoint dst[4]) {
111 if (srcPts[0].fY > srcPts[3].fY) {
112 dst[0] = srcPts[3];
113 dst[1] = srcPts[2];
114 dst[2] = srcPts[1];
115 dst[3] = srcPts[0];
118 memcpy(dst, srcPts, 4 * sizeof(SkPoint));
|
| SkEdgeClipper.h | 41 void clipMonoQuad(const SkPoint srcPts[3], const SkRect& clip);
42 void clipMonoCubic(const SkPoint srcPts[4], const SkRect& clip);
|
| SkQuadClipper.h | 54 void clipMonoQuad(const SkPoint srcPts[3], const SkRect& clip);
55 void clipMonoCubic(const SkPoint srcPts[4], const SkRect& clip);
|
| SkPathRef.cpp | 766 const SkPoint* srcPts = fPts;
770 pts[0] = srcPts[0];
771 srcPts += 1;
774 pts[0] = srcPts[-1];
775 pts[1] = srcPts[0];
776 srcPts += 1;
782 pts[0] = srcPts[-1];
783 pts[1] = srcPts[0];
784 pts[2] = srcPts[1];
785 srcPts += 2
[all...] |
| SkEdgeClipper.cpp | 141 // srcPts[] must be monotonic in X and Y
142 void SkEdgeClipper::clipMonoQuad(const SkPoint srcPts[3], const SkRect& clip) {
144 bool reverse = sort_increasing_Y(pts, srcPts, 3);
216 bool SkEdgeClipper::clipQuad(const SkPoint srcPts[3], const SkRect& clip) {
221 bounds.set(srcPts, 3);
225 int countY = SkChopQuadAtYExtrema(srcPts, monoY);
331 // srcPts[] must be monotonic in X and Y
411 bool SkEdgeClipper::clipCubic(const SkPoint srcPts[4], const SkRect& clip) {
415 const SkRect bounds = compute_cubic_bounds(srcPts);
425 return this->clipLine(srcPts[0], srcPts[3], clip)
[all...] |
| SkPath.cpp | [all...] |
| /external/skqp/src/core/ |
| SkQuadClipper.cpp | 51 bool SkQuadClipper::clipQuad(const SkPoint srcPts[3], SkPoint dst[3]) {
55 if (srcPts[0].fY > srcPts[2].fY) {
56 dst[0] = srcPts[2];
57 dst[1] = srcPts[1];
58 dst[2] = srcPts[0];
61 memcpy(dst, srcPts, 3 * sizeof(SkPoint));
|
| SkCubicClipper.cpp | 107 bool SkCubicClipper::clipCubic(const SkPoint srcPts[4], SkPoint dst[4]) {
111 if (srcPts[0].fY > srcPts[3].fY) {
112 dst[0] = srcPts[3];
113 dst[1] = srcPts[2];
114 dst[2] = srcPts[1];
115 dst[3] = srcPts[0];
118 memcpy(dst, srcPts, 4 * sizeof(SkPoint));
|
| SkEdgeClipper.h | 41 void clipMonoQuad(const SkPoint srcPts[3], const SkRect& clip);
42 void clipMonoCubic(const SkPoint srcPts[4], const SkRect& clip);
|
| SkQuadClipper.h | 54 void clipMonoQuad(const SkPoint srcPts[3], const SkRect& clip);
55 void clipMonoCubic(const SkPoint srcPts[4], const SkRect& clip);
|
| SkPathRef.cpp | 748 const SkPoint* srcPts = fPts;
752 pts[0] = srcPts[0];
753 srcPts += 1;
756 pts[0] = srcPts[-1];
757 pts[1] = srcPts[0];
758 srcPts += 1;
764 pts[0] = srcPts[-1];
765 pts[1] = srcPts[0];
766 pts[2] = srcPts[1];
767 srcPts += 2
[all...] |
| SkEdgeClipper.cpp | 141 // srcPts[] must be monotonic in X and Y
142 void SkEdgeClipper::clipMonoQuad(const SkPoint srcPts[3], const SkRect& clip) {
144 bool reverse = sort_increasing_Y(pts, srcPts, 3);
216 bool SkEdgeClipper::clipQuad(const SkPoint srcPts[3], const SkRect& clip) {
221 bounds.set(srcPts, 3);
225 int countY = SkChopQuadAtYExtrema(srcPts, monoY);
331 // srcPts[] must be monotonic in X and Y
411 bool SkEdgeClipper::clipCubic(const SkPoint srcPts[4], const SkRect& clip) {
415 const SkRect bounds = compute_cubic_bounds(srcPts);
425 return this->clipLine(srcPts[0], srcPts[3], clip)
[all...] |
| SkPath.cpp | [all...] |
| /external/skia/tests/ |
| PathTest.cpp | [all...] |
| /external/skqp/tests/ |
| PathTest.cpp | [all...] |
