Home
last modified time | relevance | path

Searched refs:nextV (Results 1 - 3 of 3) sorted by relevance

/third_party/skia/gm/
H A Dwacky_yuv_formats.cpp289 SkVector nextV; in create_splat() local
291 nextV = outerStep.mapVector(curV.fX, curV.fY); in create_splat()
295 SkPoint nextTop = SkPoint::Make(o.fX + outerRadius * nextV.fX, in create_splat()
296 o.fY + outerRadius * nextV.fY); in create_splat()
299 add_arc(&p, top, curV, nextTop, nextV, circles, true); in create_splat()
301 nextV = innerStep.mapVector(curV.fX, curV.fY); in create_splat()
305 SkPoint nextBot = SkPoint::Make(o.fX + innerRadius * nextV.fX, in create_splat()
306 o.fY + innerRadius * nextV.fY); in create_splat()
309 add_arc(&p, bot, curV, nextBot, nextV, nullptr, false); in create_splat()
312 curV = nextV; in create_splat()
[all...]
/third_party/skia/src/gpu/geometry/
H A DGrTriangulator.cpp992 Vertex* nextV = prevV ? prevV->fNext : mesh->fHead; in makeSortedVertex() local
993 while (nextV && c.sweep_lt(nextV->fPoint, p)) { in makeSortedVertex()
994 prevV = nextV; in makeSortedVertex()
995 nextV = nextV->fNext; in makeSortedVertex()
1000 } else if (nextV && coincident(nextV->fPoint, p)) { in makeSortedVertex()
1001 v = nextV; in makeSortedVertex()
1007 } else if (!nextV) { in makeSortedVertex()
[all...]
H A DGrAATriangulator.cpp444 Vertex* nextV = e->fWinding > 0 ? e->fBottom : e->fTop; in strokeBoundary() local
467 Line nextTangent(nextV->fPoint, in strokeBoundary()
468 nextV->fPoint + SkVector::Make(outer.fA, outer.fB)); in strokeBoundary()
484 Line nextTangent(nextV->fPoint, in strokeBoundary()
485 nextV->fPoint + SkVector::Make(inner.fA, inner.fB)); in strokeBoundary()

Completed in 6 milliseconds