Home
last modified time | relevance | path

Searched refs:leftE (Results 1 – 4 of 4) sorted by relevance

/external/skia/src/core/
DSkScan_AAAPath.cpp1072 static bool is_smooth_enough(SkAnalyticEdge* leftE, in is_smooth_enough() argument
1079 if (leftE->fLowerY + SK_Fixed1 < riteE->fLowerY) { in is_smooth_enough()
1080 return is_smooth_enough(leftE, currE, stop_y); // Only leftE is changing in is_smooth_enough()
1081 } else if (leftE->fLowerY > riteE->fLowerY + SK_Fixed1) { in is_smooth_enough()
1094 return is_smooth_enough(leftE, currE, stop_y) && is_smooth_enough(riteE, nextCurrE, stop_y); in is_smooth_enough()
1106 SkAnalyticEdge* leftE = (SkAnalyticEdge*)prevHead->fNext; in aaa_walk_convex_edges() local
1107 SkAnalyticEdge* riteE = (SkAnalyticEdge*)leftE->fNext; in aaa_walk_convex_edges()
1110 SkFixed y = std::max(leftE->fUpperY, riteE->fUpperY); in aaa_walk_convex_edges()
1115 while (leftE->fLowerY <= y) { // Due to smooth jump, we may pass multiple short edges in aaa_walk_convex_edges()
1116 if (!leftE->update(y)) { in aaa_walk_convex_edges()
[all …]
DSkScan_Path.cpp225 SkEdge* leftE = prevHead->fNext; in walk_simple_edges() local
226 SkEdge* riteE = leftE->fNext; in walk_simple_edges()
231 int local_top = std::max(leftE->fFirstY, riteE->fFirstY); in walk_simple_edges()
235 SkASSERT(leftE->fFirstY <= stop_y); in walk_simple_edges()
238 int local_bot = std::min(leftE->fLastY, riteE->fLastY); in walk_simple_edges()
242 SkFixed left = leftE->fX; in walk_simple_edges()
243 SkFixed dLeft = leftE->fDX; in walk_simple_edges()
280 leftE->fX = left; in walk_simple_edges()
283 if (!update_edge(leftE, local_bot)) { in walk_simple_edges()
287 leftE = currE; in walk_simple_edges()
[all …]
/external/skqp/src/core/
DSkScan_AAAPath.cpp972 static inline bool isSmoothEnough(SkAnalyticEdge* leftE, SkAnalyticEdge* riteE, in isSmoothEnough() argument
977 if (leftE->fLowerY + SK_Fixed1 < riteE->fLowerY) { in isSmoothEnough()
978 return isSmoothEnough(leftE, currE, stop_y); // Only leftE is changing in isSmoothEnough()
979 } else if (leftE->fLowerY > riteE->fLowerY + SK_Fixed1) { in isSmoothEnough()
993 return isSmoothEnough(leftE, currE, stop_y) && isSmoothEnough(riteE, nextCurrE, stop_y); in isSmoothEnough()
1001 SkAnalyticEdge* leftE = (SkAnalyticEdge*) prevHead->fNext; in aaa_walk_convex_edges() local
1002 SkAnalyticEdge* riteE = (SkAnalyticEdge*) leftE->fNext; in aaa_walk_convex_edges()
1005 SkFixed y = SkTMax(leftE->fUpperY, riteE->fUpperY); in aaa_walk_convex_edges()
1015 while (leftE->fLowerY <= y) { // Due to smooth jump, we may pass multiple short edges in aaa_walk_convex_edges()
1016 if (!leftE->update(y)) { in aaa_walk_convex_edges()
[all …]
DSkScan_Path.cpp226 SkEdge* leftE = prevHead->fNext; in walk_simple_edges() local
227 SkEdge* riteE = leftE->fNext; in walk_simple_edges()
232 int local_top = SkMax32(leftE->fFirstY, riteE->fFirstY); in walk_simple_edges()
236 SkASSERT(leftE->fFirstY <= stop_y); in walk_simple_edges()
239 int local_bot = SkMin32(leftE->fLastY, riteE->fLastY); in walk_simple_edges()
243 SkFixed left = leftE->fX; in walk_simple_edges()
244 SkFixed dLeft = leftE->fDX; in walk_simple_edges()
281 leftE->fX = left; in walk_simple_edges()
284 if (!update_edge(leftE, local_bot)) { in walk_simple_edges()
288 leftE = currE; in walk_simple_edges()
[all …]