52             fVertexStack.reset(maxStackDepth);  in GrMiddleOutPolygonTriangulator()
57         fVertexStack[0] = {0, {0, 0}};  in GrMiddleOutPolygonTriangulator()
58         fTop = fVertexStack;  in GrMiddleOutPolygonTriangulator()
62         if (pt == fVertexStack[0].fPoint) {  in pushVertex()
89         if (fTop == fVertexStack) {  // The stack only contains one point (the starting point).  in close()
97         const SkPoint& p0 = fVertexStack[0].fPoint;  in close()
99         while (fTop - 1 > fVertexStack) {  in close()
103         SkASSERT(fTop == fVertexStack + 1);  in close()
105         SkASSERT(fVertexStack[0].fVertexIdxDelta == 0);  in close()
106         fTop = fVertexStack;  in close()
115         SkASSERT(fTop == fVertexStack);  // The stack should only contain a starting point now.  in closeAndMove()
158         SkASSERT(fTop < fVertexStack + fStackAllocCount);  in pushVertex()
164         SkASSERT(fTop > fVertexStack);  // We should never pop the starting point.  in popTopTriangle()
173     SkAutoSTMalloc<kStackPreallocCount, StackVertex> fVertexStack;  variable