HomeSort by relevance Sort by last modified time
    Searched refs:SkEdge (Results 1 - 5 of 5) sorted by null

  /external/skia/src/core/
SkEdgeBuilder.h 14 struct SkEdge;
28 SkEdge** edgeList() { return (SkEdge**)fEdgeList; }
38 Combine CombineVertical(const SkEdge* edge, SkEdge* last);
40 Combine checkVertical(const SkEdge* edge, SkEdge** edgePtr);
42 bool vertical_line(const SkEdge* edge);
SkScan_Path.cpp 10 #include "SkEdge.h"
24 static void validate_sort(const SkEdge* edge) {
39 static void insert_new_edges(SkEdge* newEdge, int curr_y) {
43 SkEdge* prev = newEdge->fPrev;
48 SkEdge* start = backward_insert_start(prev, newEdge->fX);
51 SkEdge* next = newEdge->fNext;
56 SkEdge* after = start->fNext;
71 static void validate_edges_for_y(const SkEdge* edge, int curr_y) {
95 static void walk_edges(SkEdge* prevHead, SkPath::FillType fillType,
108 SkEdge* currE = prevHead->fNext
    [all...]
SkEdgeBuilder.cpp 9 #include "SkEdge.h"
21 SkEdgeBuilder::Combine SkEdgeBuilder::CombineVertical(const SkEdge* edge, SkEdge* last) {
113 bool SkEdgeBuilder::vertical_line(const SkEdge* edge) {
142 SkEdge* edge = fAlloc.make<SkEdge>();
145 Combine combine = CombineVertical(edge, (SkEdge*)*(fList.end() - 1));
228 SkEdgeBuilder::Combine SkEdgeBuilder::checkVertical(const SkEdge* edge, SkEdge** edgePtr) {
229 return !vertical_line(edge) || edgePtr <= (SkEdge**)fEdgeList ? kNo_Combine
    [all...]
SkEdge.h 19 struct SkEdge {
26 SkEdge* fNext;
27 SkEdge* fPrev;
65 struct SkQuadraticEdge : public SkEdge {
76 struct SkCubicEdge : public SkEdge {
88 int SkEdge::setLine(const SkPoint& p0, const SkPoint& p1, int shift) {
SkEdge.cpp 9 #include "SkEdge.h"
33 int SkEdge::setLine(const SkPoint& p0, const SkPoint& p1, const SkIRect* clip,
90 int SkEdge::updateLine(SkFixed x0, SkFixed y0, SkFixed x1, SkFixed y1)
124 void SkEdge::chopLineWithClip(const SkIRect& clip)

Completed in 505 milliseconds