Searched refs:fP1 (Results 1 – 10 of 10) sorted by relevance
| /third_party/skia/src/gpu/geometry/ |
| D | GrShape.cpp | 210 fLine.fP1 = p1; in simplifyLine()
214 SkASSERT(fLine.fP1 == p1 && fLine.fP2 == p2); in simplifyLine()
218 if (fLine.fP2.fY < fLine.fP1.fY || in simplifyLine()
219 (fLine.fP2.fY == fLine.fP1.fY && fLine.fP2.fX < fLine.fP1.fX)) { in simplifyLine()
221 swap(fLine.fP1, fLine.fP2); in simplifyLine()
255 this->simplifyLine(fLine.fP1, fLine.fP2, flags); in simplify()
380 SkRect b = SkRect::MakeLTRB(fLine.fP1.fX, fLine.fP1.fY, in bounds()
458 out->moveTo(fLine.fP1); in asPath()
|
| D | GrStyledShape.cpp | 513 pts[0] = fShape.line().fP1; in asLine()
757 if (fShape.line().fP1.fY == fShape.line().fP2.fY) { in simplifyStroke()
758 rect.fLeft = std::min(fShape.line().fP1.fX, fShape.line().fP2.fX); in simplifyStroke()
759 rect.fRight = std::max(fShape.line().fP1.fX, fShape.line().fP2.fX); in simplifyStroke()
760 rect.fTop = rect.fBottom = fShape.line().fP1.fY; in simplifyStroke()
763 } else if (fShape.line().fP1.fX == fShape.line().fP2.fX) { in simplifyStroke()
764 rect.fTop = std::min(fShape.line().fP1.fY, fShape.line().fP2.fY); in simplifyStroke()
765 rect.fBottom = std::max(fShape.line().fP1.fY, fShape.line().fP2.fY); in simplifyStroke()
766 rect.fLeft = rect.fRight = fShape.line().fP1.fX; in simplifyStroke()
|
| D | GrShape.h | 26 SkPoint fP1; member
|
| /third_party/skia/tests/ |
| D | TriangulatingPathRendererTests.cpp | 798 Edge reverse() const { return {fP1, fP0}; } in reverse()
799 SkPoint fP0, fP1; member
809 if (a.fP1.fX != b.fP1.fX) { in operator <()
810 return a.fP1.fX < b.fP1.fX; in operator <()
812 if (a.fP1.fY != b.fP1.fY) { in operator <()
813 return a.fP1.fY < b.fP1.fY; in operator <()
941 shapeName, edge.fP0.fX, edge.fP0.fY, edge.fP1.fX, edge.fP1.fY); in verify_simple_inner_polygons()
954 if (edge.fP0.fX == edge.fP1.fX && !hasSpuriousVert) { in verify_simple_inner_polygons()
958 if (edge.fP0.fY == edge.fP1.fY && !hasSpuriousHorz) { in verify_simple_inner_polygons()
964 shapeName, edge.fP0.fX, edge.fP0.fY, edge.fP1.fX, edge.fP1.fY); in verify_simple_inner_polygons()
|
| D | ResourceAllocatorTest.cpp | 209 ProxyParams fP1; in DEF_GPUTEST_FOR_RENDERING_CONTEXTS() member
234 sk_sp<GrSurfaceProxy> p1 = make_proxy(dContext, test.fP1); in DEF_GPUTEST_FOR_RENDERING_CONTEXTS()
303 sk_sp<GrSurfaceProxy> p1 = make_proxy(dContext, test.fP1); in DEF_GPUTEST_FOR_RENDERING_CONTEXTS()
|
| /third_party/skia/src/core/ |
| D | SkAnalyticEdge.h | 142 SkPoint fP1; member
163 fP1 = pts[1]; in set()
177 fP1 = pts[1]; in set()
197 fP1 = pts[1]; in set()
|
| D | SkRasterPipeline.h | 182 fP1; member
|
| /third_party/skia/src/gpu/tessellate/ |
| D | PatchWriter.h | 171 float2 fP0, fP1, fP2; member
|
| /third_party/skia/src/shaders/gradients/ |
| D | SkTwoPointConicalGradient.cpp | 183 ctx->fP1 = fFocalData.fFocalX; in appendGradientStages()
|
| /third_party/skia/src/opts/ |
| D | SkRasterPipeline_opts.h | 2549 t = t + ctx->fP1; // ctx->fP1 = f in STAGE()
|