Home
last modified time | relevance | path

Searched refs:quadPts (Results 1 – 10 of 10) sorted by relevance

/external/skia/src/core/
DSkStroke.cpp41 #define STROKER_RESULT(resultType, depth, quadPts, format, ...) \ argument
43 SkDebugf(" " #resultType " t=(%g,%g)\n", quadPts->fStartT, quadPts->fEndT), \
47 #define STROKER_RESULT(resultType, depth, quadPts, format, ...) \ argument
510 void SkPathStroker::init(StrokeType strokeType, SkQuadConstruct* quadPts, SkScalar tStart, in init() argument
514 quadPts->init(tStart, tEnd); in init()
804 SkQuadConstruct quadPts; in conicTo() local
805 this->init(kOuter_StrokeType, &quadPts, 0, 1); in conicTo()
806 (void) this->conicStroke(conic, &quadPts); in conicTo()
807 this->init(kInner_StrokeType, &quadPts, 0, 1); in conicTo()
808 (void) this->conicStroke(conic, &quadPts); in conicTo()
[all …]
DSkEdgeBuilder.cpp207 const SkPoint* quadPts = quadder.computeQuads( in build() local
210 if (clipper.clipQuad(quadPts, clip)) { in build()
213 quadPts += 2; in build()
242 const SkPoint* quadPts = quadder.computeQuads( in build() local
245 handle_quad(this, quadPts); in build()
246 quadPts += 2; in build()
DSkScan_Hairline.cpp395 const SkPoint* quadPts = converter.computeQuads(pts, in hair_path() local
398 int level = compute_quad_level(quadPts); in hair_path()
399 hairquad(quadPts, clip, blitter, level, lineproc); in hair_path()
400 quadPts += 2; in hair_path()
DSkPath.cpp272 SkPoint quadPts[5]; in conservativelyContainsRect() local
273 int count = orig.chopIntoQuadsPOW2(quadPts, 1); in conservativelyContainsRect()
276 if (!check_edge_against_rect(quadPts[0], quadPts[2], rect, direction)) { in conservativelyContainsRect()
279 if (!check_edge_against_rect(quadPts[2], quadPts[4], rect, direction)) { in conservativelyContainsRect()
/external/skia/src/utils/
DSkParsePath.cpp225 const SkPoint* quadPts = quadder.computeQuads(pts, iter.conicWeight(), tol); in ToSVGString() local
227 append_scalars(&stream, 'Q', &quadPts[i*2 + 1].fX, 4); in ToSVGString()
/external/skia/src/gpu/
DGrAAConvexPathRenderer.cpp306 const SkPoint* quadPts = converter.computeQuads(pts, weight, 0.5f); in get_segments() local
308 update_degenerate_test(&degenerateData, quadPts[2*i + 1]); in get_segments()
309 update_degenerate_test(&degenerateData, quadPts[2*i + 2]); in get_segments()
310 add_quad_segment(quadPts + 2*i, segments); in get_segments()
DGrAAHairLinePathRenderer.cpp311 SkPoint* quadPts = choppedPts + i * 2; in gather_lines_and_quads() local
312 m.mapPoints(devPts, quadPts, 3); in gather_lines_and_quads()
328 SkPoint* qPts = persp ? quadPts : devPts; in gather_lines_and_quads()
DGrDefaultPathRenderer.cpp474 const SkPoint* quadPts = converter.computeQuads(pts, weight, 0.25f); in createGeom() local
476 add_quad(&vert, base, quadPts + i*2, srcSpaceTolSqd, srcSpaceTol, in createGeom()
DGrTessellatingPathRenderer.cpp567 const SkPoint* quadPts = converter.computeQuads(pts, weight, toleranceSqd); in path_to_contours() local
569 int pointsLeft = GrPathUtils::quadraticPointCount(quadPts, tolerance); in path_to_contours()
570 prev = generate_quadratic_points(quadPts[0], quadPts[1], quadPts[2], in path_to_contours()
572 quadPts += 2; in path_to_contours()
DGrPathUtils.cpp181 const SkPoint* quadPts = converter.computeQuads(pts, weight, 0.25f); in worstCasePointCount() local
183 pointCount += quadraticPointCount(quadPts + 2*i, tol); in worstCasePointCount()