| /external/skia/src/core/ |
| D | SkScan_AAAPath.cpp | 1004 static bool operator<(const SkAnalyticEdge& a, const SkAnalyticEdge& b) { in operator <()
1021 static SkAnalyticEdge* sort_edges(SkAnalyticEdge* list[], int count, SkAnalyticEdge** last) { in sort_edges()
1034 static void validate_sort(const SkAnalyticEdge* edge) { in validate_sort()
1043 edge = (SkAnalyticEdge*)edge->fNext; in validate_sort()
1051 static bool is_smooth_enough(SkAnalyticEdge* thisEdge, SkAnalyticEdge* nextEdge, int stop_y) { in is_smooth_enough()
1072 static bool is_smooth_enough(SkAnalyticEdge* leftE, in is_smooth_enough()
1073 SkAnalyticEdge* riteE, in is_smooth_enough()
1074 SkAnalyticEdge* currE, in is_smooth_enough()
1086 SkAnalyticEdge* nextCurrE = currE->fNext; in is_smooth_enough()
1097 static void aaa_walk_convex_edges(SkAnalyticEdge* prevHead, in aaa_walk_convex_edges()
[all …]
|
| D | SkAnalyticEdge.h | 16 struct SkAnalyticEdge { struct
24 SkAnalyticEdge* fNext; argument
25 SkAnalyticEdge* fPrev; argument
29 SkAnalyticEdge* fRiteE; argument
107 struct SkAnalyticQuadraticEdge : public SkAnalyticEdge { argument
125 struct SkAnalyticCubicEdge : public SkAnalyticEdge {
|
| D | SkEdgeBuilder.h | 76 SkAnalyticEdge** analyticEdgeList() { return (SkAnalyticEdge**)fEdgeList; } in analyticEdgeList()
79 Combine combineVertical(const SkAnalyticEdge* edge, SkAnalyticEdge* last);
|
| D | SkEdgeBuilder.cpp | 60 SkEdgeBuilder::Combine SkAnalyticEdgeBuilder::combineVertical(const SkAnalyticEdge* edge, in combineVertical()
61 SkAnalyticEdge* last) { in combineVertical()
134 SkAnalyticEdge* edge = fAlloc.make<SkAnalyticEdge>(); in addLine()
138 ? this->combineVertical(edge, (SkAnalyticEdge*)fList.top()) in addLine()
190 auto edge = (SkAnalyticEdge*) arg_edge; in addPolyLine()
191 auto edgePtr = (SkAnalyticEdge**)arg_edgePtr; in addPolyLine()
194 return is_vertical(edge) && edgePtr > (SkAnalyticEdge**)fEdgeList in addPolyLine()
216 *size = sizeof(SkAnalyticEdge); in allocEdges()
217 return (char*)fAlloc.makeArrayDefault<SkAnalyticEdge>(n); in allocEdges()
|
| D | SkAnalyticEdge.cpp | 227 bool SkAnalyticEdge::setLine(const SkPoint& p0, const SkPoint& p1) { in setLine()
283 bool SkAnalyticEdge::updateLine(SkFixed x0, SkFixed y0, SkFixed x1, SkFixed y1, SkFixed slope) { in updateLine()
327 bool SkAnalyticEdge::update(SkFixed last_y, bool sortY) { in update()
|
| /external/skqp/src/core/ |
| D | SkScan_AAAPath.cpp | 901 static bool operator<(const SkAnalyticEdge& a, const SkAnalyticEdge& b) { in operator <()
918 static SkAnalyticEdge* sort_edges(SkAnalyticEdge* list[], int count, SkAnalyticEdge** last) { in sort_edges()
932 static void validate_sort(const SkAnalyticEdge* edge) { in validate_sort()
940 edge = (SkAnalyticEdge*)edge->fNext; in validate_sort()
950 static inline bool isSmoothEnough(SkAnalyticEdge* thisEdge, SkAnalyticEdge* nextEdge, int stop_y) { in isSmoothEnough()
972 static inline bool isSmoothEnough(SkAnalyticEdge* leftE, SkAnalyticEdge* riteE, in isSmoothEnough()
973 SkAnalyticEdge* currE, int stop_y) { in isSmoothEnough()
984 SkAnalyticEdge* nextCurrE = currE->fNext; in isSmoothEnough()
996 static inline void aaa_walk_convex_edges(SkAnalyticEdge* prevHead, in aaa_walk_convex_edges()
999 validate_sort((SkAnalyticEdge*)prevHead->fNext); in aaa_walk_convex_edges()
[all …]
|
| D | SkAnalyticEdge.h | 16 struct SkAnalyticEdge { struct
24 SkAnalyticEdge* fNext; argument
25 SkAnalyticEdge* fPrev; argument
29 SkAnalyticEdge* fRiteE; argument
107 struct SkAnalyticQuadraticEdge : public SkAnalyticEdge { argument
125 struct SkAnalyticCubicEdge : public SkAnalyticEdge {
|
| D | SkEdgeBuilder.h | 78 SkAnalyticEdge** analyticEdgeList() { return (SkAnalyticEdge**)fEdgeList; } in analyticEdgeList()
81 Combine combineVertical(const SkAnalyticEdge* edge, SkAnalyticEdge* last);
|
| D | SkEdgeBuilder.cpp | 60 SkEdgeBuilder::Combine SkAnalyticEdgeBuilder::combineVertical(const SkAnalyticEdge* edge, in combineVertical()
61 SkAnalyticEdge* last) { in combineVertical()
134 SkAnalyticEdge* edge = fAlloc.make<SkAnalyticEdge>(); in addLine()
138 ? this->combineVertical(edge, (SkAnalyticEdge*)fList.top()) in addLine()
209 auto edge = (SkAnalyticEdge*) arg_edge; in addPolyLine()
210 auto edgePtr = (SkAnalyticEdge**)arg_edgePtr; in addPolyLine()
213 return is_vertical(edge) && edgePtr > (SkAnalyticEdge**)fEdgeList in addPolyLine()
247 *size = sizeof(SkAnalyticEdge); in allocEdges()
248 return (char*)fAlloc.makeArrayDefault<SkAnalyticEdge>(n); in allocEdges()
|
| D | SkScan_DAAPath.cpp | 81 static inline void add_coverage_delta_segment(int y, SkFixed rowHeight, const SkAnalyticEdge* edge, in add_coverage_delta_segment()
190 SkAnalyticEdge l, r; in gen_alpha_deltas()
231 SkASSERT(sizeof(SkAnalyticQuadraticEdge) >= sizeof(SkAnalyticEdge)); in gen_alpha_deltas()
235 SkAnalyticEdge* currE = &storage; in gen_alpha_deltas()
|
| D | SkAnalyticEdge.cpp | 227 bool SkAnalyticEdge::setLine(const SkPoint& p0, const SkPoint& p1) { in setLine()
283 bool SkAnalyticEdge::updateLine(SkFixed x0, SkFixed y0, SkFixed x1, SkFixed y1, SkFixed slope) { in updateLine()
327 bool SkAnalyticEdge::update(SkFixed last_y, bool sortY) { in update()
|
| /external/skia/gn/ |
| D | core.gni | 110 "$_src/core/SkAnalyticEdge.cpp",
|
| /external/skqp/gn/ |
| D | core.gni | 111 "$_src/core/SkAnalyticEdge.cpp",
|
| /external/skqp/ |
| D | BUILD.gn | 1094 "src/core/SkAnalyticEdge.cpp",
|
| D | Android.bp | 597 "src/core/SkAnalyticEdge.cpp",
|
| /external/skia/ |
| D | Android.bp | 194 "src/core/SkAnalyticEdge.cpp",
965 "src/core/SkAnalyticEdge.cpp",
|
| D | BUILD.gn | 1485 "src/core/SkAnalyticEdge.cpp",
|