Searched refs:eHead (Results 1 - 5 of 5) sorted by relevance

/xsrc/external/mit/glu/dist/src/libtess/
H A Dtessmono.c184 for( e = mesh->eHead.next; e != &mesh->eHead; e = eNext ) {
H A Dmesh.c290 e = MakeEdge( &mesh->eHead );
616 e = &mesh->eHead;
659 GLUhalfEdge *e1 = &mesh1->eHead;
662 GLUhalfEdge *e2 = &mesh2->eHead;
727 for( e = mesh->eHead.next; e != &mesh->eHead; e = eNext ) {
746 GLUhalfEdge *eHead = &mesh->eHead; local in function:__gl_meshCheckMesh
781 ePrev = eHead;
782 for( ePrev = eHead ; (
[all...]
H A Dmesh.h78 * The mesh stores pointers to these dummy headers (vHead, fHead, eHead).
82 * one direction. Starting at eHead and following the e->next pointers
166 GLUhalfEdge eHead; /* dummy header for edge list */ member in struct:GLUmesh
H A Drender.c200 GLUhalfEdge *e, *eTail, *eHead; local in function:MaximumStrip
218 eHead = e;
224 newFace.eStart = eHead;
227 * we must start from eHead to guarantee inclusion of eOrig->Lface.
230 newFace.eStart = eHead->Onext;
H A Dsweep.c1213 GLUhalfEdge *eHead = &tess->mesh->eHead; local in function:RemoveDegenerateEdges
1216 for( e = eHead->next; e != eHead; e = eNext ) {

Completed in 6 milliseconds