HomeSort by relevance Sort by last modified time
    Searched refs:fEdgeList (Results 1 - 4 of 4) sorted by null

  /external/skia/src/core/
SkEdgeBuilder.h 27 // In general mode we allocate pointers in fList and fEdgeList points to its head.
28 // In polygon mode we preallocated edges contiguously in fAlloc and fEdgeList points there.
29 void** fEdgeList = nullptr;
57 SkEdge** edgeList() { return (SkEdge**)fEdgeList; }
78 SkAnalyticEdge** analyticEdgeList() { return (SkAnalyticEdge**)fEdgeList; }
97 SkBezier** bezierList() { return (SkBezier**)fEdgeList; }
SkEdgeBuilder.cpp 201 return is_vertical(edge) && edgePtr > (SkEdge**)fEdgeList
213 return is_vertical(edge) && edgePtr > (SkAnalyticEdge**)fEdgeList
278 fEdgeList = (void**)edgePtr;
333 SkASSERT((size_t)(edgePtr - (char**)fEdgeList) <= maxEdgeCount);
334 return SkToInt(edgePtr - (char**)fEdgeList);
456 fEdgeList = fList.begin();
  /external/skqp/src/core/
SkEdgeBuilder.h 27 // In general mode we allocate pointers in fList and fEdgeList points to its head.
28 // In polygon mode we preallocated edges contiguously in fAlloc and fEdgeList points there.
29 void** fEdgeList = nullptr;
57 SkEdge** edgeList() { return (SkEdge**)fEdgeList; }
78 SkAnalyticEdge** analyticEdgeList() { return (SkAnalyticEdge**)fEdgeList; }
97 SkBezier** bezierList() { return (SkBezier**)fEdgeList; }
SkEdgeBuilder.cpp 201 return is_vertical(edge) && edgePtr > (SkEdge**)fEdgeList
213 return is_vertical(edge) && edgePtr > (SkAnalyticEdge**)fEdgeList
278 fEdgeList = (void**)edgePtr;
333 SkASSERT((size_t)(edgePtr - (char**)fEdgeList) <= maxEdgeCount);
334 return SkToInt(edgePtr - (char**)fEdgeList);
456 fEdgeList = fList.begin();

Completed in 110 milliseconds