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

  /external/skia/src/core/
SkEdge.h 21 struct SkEdge {
28 SkEdge* fNext;
29 SkEdge* fPrev;
67 struct SkQuadraticEdge : public SkEdge {
78 struct SkCubicEdge : public SkEdge {
90 int SkEdge::setLine(const SkPoint& p0, const SkPoint& p1, int shift) {
SkEdgeBuilder.h 12 #include "SkEdge.h"
57 SkEdge** edgeList() { return (SkEdge**)fEdgeList; }
60 Combine combineVertical(const SkEdge* edge, SkEdge* last);
SkScan_Path.cpp 9 #include "SkEdge.h"
29 static void validate_sort(const SkEdge* edge) {
44 static void insert_new_edges(SkEdge* newEdge, int curr_y) {
48 SkEdge* prev = newEdge->fPrev;
53 SkEdge* start = backward_insert_start(prev, newEdge->fX);
56 SkEdge* next = newEdge->fNext;
61 SkEdge* after = start->fNext;
76 static void validate_edges_for_y(const SkEdge* edge, int curr_y) {
100 static void walk_edges(SkEdge* prevHead, SkPath::FillType fillType,
112 SkEdge* currE = prevHead->fNext
    [all...]
SkEdgeBuilder.cpp 9 #include "SkEdge.h"
19 SkEdgeBuilder::Combine SkBasicEdgeBuilder::combineVertical(const SkEdge* edge, SkEdge* last) {
120 SkEdge* edge = fAlloc.make<SkEdge>();
123 ? this->combineVertical(edge, (SkEdge*)fList.top())
197 auto edge = (SkEdge*) arg_edge;
198 auto edgePtr = (SkEdge**)arg_edgePtr;
201 return is_vertical(edge) && edgePtr > (SkEdge**)fEdgeList
243 *size = sizeof(SkEdge);
    [all...]
SkEdge.cpp 8 #include "SkEdge.h"
36 int SkEdge::setLine(const SkPoint& p0, const SkPoint& p1, const SkIRect* clip,
94 int SkEdge::updateLine(SkFixed x0, SkFixed y0, SkFixed x1, SkFixed y1)
128 void SkEdge::chopLineWithClip(const SkIRect& clip)
  /external/skqp/src/core/
SkEdge.h 21 struct SkEdge {
28 SkEdge* fNext;
29 SkEdge* fPrev;
67 struct SkQuadraticEdge : public SkEdge {
78 struct SkCubicEdge : public SkEdge {
90 int SkEdge::setLine(const SkPoint& p0, const SkPoint& p1, int shift) {
SkEdgeBuilder.h 12 #include "SkEdge.h"
57 SkEdge** edgeList() { return (SkEdge**)fEdgeList; }
60 Combine combineVertical(const SkEdge* edge, SkEdge* last);
SkScan_Path.cpp 9 #include "SkEdge.h"
29 static void validate_sort(const SkEdge* edge) {
44 static void insert_new_edges(SkEdge* newEdge, int curr_y) {
48 SkEdge* prev = newEdge->fPrev;
53 SkEdge* start = backward_insert_start(prev, newEdge->fX);
56 SkEdge* next = newEdge->fNext;
61 SkEdge* after = start->fNext;
76 static void validate_edges_for_y(const SkEdge* edge, int curr_y) {
100 static void walk_edges(SkEdge* prevHead, SkPath::FillType fillType,
112 SkEdge* currE = prevHead->fNext
    [all...]
SkEdgeBuilder.cpp 9 #include "SkEdge.h"
19 SkEdgeBuilder::Combine SkBasicEdgeBuilder::combineVertical(const SkEdge* edge, SkEdge* last) {
120 SkEdge* edge = fAlloc.make<SkEdge>();
123 ? this->combineVertical(edge, (SkEdge*)fList.top())
197 auto edge = (SkEdge*) arg_edge;
198 auto edgePtr = (SkEdge**)arg_edgePtr;
201 return is_vertical(edge) && edgePtr > (SkEdge**)fEdgeList
243 *size = sizeof(SkEdge);
    [all...]
SkEdge.cpp 8 #include "SkEdge.h"
36 int SkEdge::setLine(const SkPoint& p0, const SkPoint& p1, const SkIRect* clip,
94 int SkEdge::updateLine(SkFixed x0, SkFixed y0, SkFixed x1, SkFixed y1)
128 void SkEdge::chopLineWithClip(const SkIRect& clip)

Completed in 6757 milliseconds