Lines Matching refs:InEdge
835 struct InEdge {
836 bool operator<(const InEdge& rh) const {
889 void addPartial(SkTArray<InEdge>& edges, int ptStart, int ptEnd,
891 InEdge* edge = edges.push_back_n(1);
905 void addSplit(SkTArray<InEdge>& edges, SkPoint* pts, uint8_t verb,
907 InEdge* edge = edges.push_back_n(1);
933 bool cached(const InEdge* edge) {
1027 void splitInflectionPts(SkTArray<InEdge>& edges) {
1130 const char className[] = "InEdge";
1132 SkDebugf("InEdge %p (edge=%d)\n", this, fID);
1166 SkTDArray<const InEdge*> fCached; // list of edges already intercepted
1182 InEdgeBuilder(const SkPath& path, bool ignoreHorizontal, SkTArray<InEdge>& edges,
1307 InEdge* fCurrentEdge;
1308 SkTArray<InEdge>& fEdges;
1324 void init(const InEdge* edge) {
1362 const InEdge* fEdge;
1461 // in the InEdge, except in the following case. If a pair of edges are
1465 InEdge* writable = const_cast<InEdge*>(fWorkEdge.fEdge);
1586 void init(const InEdge* edge) {
1844 InEdge* edge) {
1861 static void addBottomT(InEdge** currentPtr, InEdge** lastPtr,
1863 InEdge** testPtr = currentPtr - 1;
1868 InEdge* test = *testPtr;
1949 static void addIntersectingTs(InEdge** currentPtr, InEdge** lastPtr) {
1950 InEdge** testPtr = currentPtr - 1;
1955 InEdge* test = *testPtr;
1956 InEdge** nextPtr = testPtr;
1958 InEdge* next = *++nextPtr;
2046 static InEdge** advanceEdges(SkTDArray<ActiveEdge>* activeEdges,
2047 InEdge** currentPtr, InEdge** lastPtr, SkScalar y) {
2048 InEdge** testPtr = currentPtr - 1;
2054 InEdge* test = *testPtr;
2085 const InEdge* test = activePtr->fWorkEdge.fEdge;
2137 static SkScalar findBottom(InEdge** currentPtr,
2138 InEdge** edgeListEnd, SkTDArray<ActiveEdge>* activeEdges, SkScalar y,
2139 bool /*asFill*/, InEdge**& testPtr) {
2140 InEdge* current = *currentPtr;
2144 InEdge* test = *testPtr;
2174 static void makeEdgeList(SkTArray<InEdge>& edges, InEdge& edgeSentinel,
2175 SkTDArray<InEdge*>& edgeList) {
2182 InEdge& edge = edges[index];
2190 QSort<InEdge>(edgeList.begin(), edgeList.end() - 1);
2592 static void dumpEdgeList(const SkTDArray<InEdge*>& edgeList,
2593 const InEdge& edgeSentinel) {
2594 InEdge** debugPtr = edgeList.begin();
2600 static void dumpEdgeList(const SkTDArray<InEdge*>& ,
2601 const InEdge& ) {
2615 SkTArray<InEdge> edges;
2618 SkTDArray<InEdge*> edgeList;
2619 InEdge edgeSentinel;
2625 InEdge** currentPtr = edgeList.begin();
2637 InEdge** lastPtr = currentPtr; // find the edge below the bottom of the first set
2668 SkTArray<InEdge> splits;
2687 InEdge** lastPtr = currentPtr; // find the edge below the bottom of the first set
2699 // OPTIMIZATION: as edges expire, InEdge allocations could be released
