Searched refs:currE (Results 1 - 2 of 2) sorted by relevance
| /third_party/skia/src/core/ |
| H A D | SkScan_Path.cpp | 111 SkEdge* currE = prevHead->fNext; in walk_edges() local
114 validate_edges_for_y(currE, curr_y); in walk_edges()
120 while (currE->fFirstY <= curr_y) { in walk_edges()
121 SkASSERT(currE->fLastY >= curr_y); in walk_edges()
123 int x = SkFixedRoundToInt(currE->fX); in walk_edges()
129 w += currE->fWinding; in walk_edges()
139 SkEdge* next = currE->fNext; in walk_edges()
142 if (currE->fLastY == curr_y) { // are we done with this edge? in walk_edges()
143 if (currE->fCurveCount > 0) { in walk_edges()
144 if (((SkQuadraticEdge*)currE) in walk_edges()
227 SkEdge* currE = riteE->fNext; walk_simple_edges() local
[all...] |
| H A D | SkScan_AAAPath.cpp | 1074 SkAnalyticEdge* currE,
1076 if (currE->fUpperY >= SkLeftShift(stop_y, 16)) {
1080 return is_smooth_enough(leftE, currE, stop_y); // Only leftE is changing
1082 return is_smooth_enough(riteE, currE, stop_y); // Only riteE is changing
1086 SkAnalyticEdge* nextCurrE = currE->fNext;
1090 // Ensure that currE is the next left edge and nextCurrE is the next right edge. Swap if not.
1091 if (nextCurrE->fUpperX < currE->fUpperX) {
1092 std::swap(currE, nextCurrE);
1094 return is_smooth_enough(leftE, currE, stop_y) && is_smooth_enough(riteE, nextCurrE, stop_y);
1108 SkAnalyticEdge* currE
[all...] |
Completed in 3 milliseconds