Home
last modified time | relevance | path

Searched refs:riteE (Results 1 – 2 of 2) sorted by relevance

/external/skia/src/core/
DSkScan_AAAPath.cpp980 static inline bool isSmoothEnough(SkAnalyticEdge* leftE, SkAnalyticEdge* riteE, in isSmoothEnough() argument
985 if (leftE->fLowerY + SK_Fixed1 < riteE->fLowerY) { in isSmoothEnough()
987 } else if (leftE->fLowerY > riteE->fLowerY + SK_Fixed1) { in isSmoothEnough()
988 return isSmoothEnough(riteE, currE, stop_y); // Only riteE is changing in isSmoothEnough()
999 return isSmoothEnough(leftE, currE, stop_y) && isSmoothEnough(riteE, nextCurrE, stop_y); in isSmoothEnough()
1008 SkAnalyticEdge* riteE = (SkAnalyticEdge*) leftE->fNext; in aaa_walk_convex_edges() local
1009 SkAnalyticEdge* currE = (SkAnalyticEdge*) riteE->fNext; in aaa_walk_convex_edges()
1011 SkFixed y = SkTMax(leftE->fUpperY, riteE->fUpperY); in aaa_walk_convex_edges()
1030 while (riteE->fLowerY <= y) { // Due to smooth jump, we may pass multiple short edges in aaa_walk_convex_edges()
1031 if (update_edge(riteE, y)) { in aaa_walk_convex_edges()
[all …]
DSkScan_Path.cpp214 SkEdge* riteE = leftE->fNext; in walk_convex_edges() local
215 SkEdge* currE = riteE->fNext; in walk_convex_edges()
219 SkASSERT(local_top == riteE->fFirstY); in walk_convex_edges()
223 int local_top = SkMax32(leftE->fFirstY, riteE->fFirstY); in walk_convex_edges()
229 SkASSERT(riteE->fFirstY <= stop_y); in walk_convex_edges()
231 if (leftE->fX > riteE->fX || (leftE->fX == riteE->fX && in walk_convex_edges()
232 leftE->fDX > riteE->fDX)) { in walk_convex_edges()
233 SkTSwap(leftE, riteE); in walk_convex_edges()
236 int local_bot = SkMin32(leftE->fLastY, riteE->fLastY); in walk_convex_edges()
242 SkFixed rite = riteE->fX; in walk_convex_edges()
[all …]