Home
last modified time | relevance | path

Searched refs:vNext (Results 1 – 3 of 3) sorted by relevance

/external/skia/src/core/
DSkConcaveToTriangles.cpp233 vNext = next()->point() - point(); in angleIsConvex() local
235 return SkPoint::CrossProduct(vNext, vPrev) >= 0; in angleIsConvex()
457 SkPoint vPrev, vNext; in classify() local
460 vNext.fX = next()->point().fX - point().fX; in classify()
461 vNext.fY = next()->point().fY - point().fY; in classify()
466 if (vNext.fY > 0) { in classify()
471 } else if (vNext.fY < 0) { in classify()
474 if (SkPoint::CrossProduct(vPrev, vNext) <= 0) { in classify()
483 if (vNext.fX < 0) { in classify()
494 if (vNext.fY < 0) { in classify()
[all …]
/external/skia/third_party/glu/libtess/
Dmesh.c138 GLUhalfEdge *eOrig, GLUvertex *vNext ) in MakeVertex() argument
147 vPrev = vNext->prev; in MakeVertex()
150 vNew->next = vNext; in MakeVertex()
151 vNext->prev = vNew; in MakeVertex()
230 GLUvertex *vPrev, *vNext; in KillVertex() local
241 vNext = vDel->next; in KillVertex()
242 vNext->prev = vPrev; in KillVertex()
243 vPrev->next = vNext; in KillVertex()
712 GLUvertex *v, *vNext; in __gl_meshDeleteMesh() local
720 for( v = mesh->vHead.next; v != &mesh->vHead; v = vNext ) { in __gl_meshDeleteMesh()
[all …]
Dsweep.c1311 GLUvertex *v, *vNext; in __gl_computeInterior() local
1328 vNext = (GLUvertex *)pqMinimum( tess->pq ); /* __gl_pqSortMinimum */ in __gl_computeInterior()
1329 if( vNext == NULL || ! VertEq( vNext, v )) break; in __gl_computeInterior()
1345 vNext = (GLUvertex *)pqExtractMin( tess->pq ); /* __gl_pqSortExtractMin*/ in __gl_computeInterior()
1346 SpliceMergeVertices( tess, v->anEdge, vNext->anEdge ); in __gl_computeInterior()