Lines Matching defs:verts
208 // trade off of fill vs cpu time on verts
445 static void set_uv_quad(const SkPoint qpts[3], BezierVertex verts[kQuadNumVertices]) {
448 DevToUV.apply<kQuadNumVertices, sizeof(BezierVertex), sizeof(SkPoint)>(verts);
452 const SkMatrix* toSrc, BezierVertex verts[kQuadNumVertices]) {
476 BezierVertex& a0 = verts[0];
477 BezierVertex& a1 = verts[1];
478 BezierVertex& b0 = verts[2];
479 BezierVertex& c0 = verts[3];
480 BezierVertex& c1 = verts[4];
519 toSrc->mapPointsWithStride(&verts[0].fPos, sizeof(BezierVertex), kQuadNumVertices);
530 static void set_conic_coeffs(const SkPoint p[3], BezierVertex verts[kQuadNumVertices],
537 const SkPoint pnt = verts[i].fPos;
538 verts[i].fConic.fK = pnt.fX * klm[0] + pnt.fY * klm[1] + klm[2];
539 verts[i].fConic.fL = pnt.fX * klm[3] + pnt.fY * klm[4] + klm[5];
540 verts[i].fConic.fM = pnt.fX * klm[6] + pnt.fY * klm[7] + klm[8];
644 // The bounds ought to be tight, but in perspective the below code runs the verts
654 VertexType* verts = reinterpret_cast<VertexType*>(vertices);
657 SkPoint pos = verts[i].fPos;
875 LineVertex* verts = reinterpret_cast<LineVertex*>(
878 if (!verts|| !linesIndexBuffer) {
886 add_line(&lines[2*i], toSrc, this->coverage(), &verts);
916 BezierVertex* verts = reinterpret_cast<BezierVertex*>(vertices);
921 add_quads(&quads[3*i], qSubdivs[i], toDevice, toSrc, &verts);
926 add_conics(&conics[3*i], cWeights[i], toDevice, toSrc, &verts);
941 GrVertices verts;
942 verts.initInstanced(kTriangles_GrPrimitiveType, vertexBuffer, quadsIndexBuffer,
945 batchTarget->draw(verts);
962 GrVertices verts;
963 verts.initInstanced(kTriangles_GrPrimitiveType, vertexBuffer, quadsIndexBuffer,
966 batchTarget->draw(verts);
