Home
last modified time | relevance | path

Searched refs:SkOpSegment (Results 1 – 25 of 31) sorted by relevance

12

/external/skia/src/pathops/
DSkOpSegment.cpp41 bool SkOpSegment::activeAngle(int index, int* done, SkTArray<SkOpAngle, true>* angles) { in activeAngle()
68 bool SkOpSegment::activeAngleOther(int index, int* done, SkTArray<SkOpAngle, true>* angles) { in activeAngleOther()
70 SkOpSegment* other = span->fOther; in activeAngleOther()
75 bool SkOpSegment::activeAngleInner(int index, int* done, SkTArray<SkOpAngle, true>* angles) { in activeAngleInner()
110 SkPoint SkOpSegment::activeLeftTop(bool onlySortable, int* firstT) const { in activeLeftTop()
156 bool SkOpSegment::activeOp(int index, int endIndex, int xorMiMask, int xorSuMask, SkPathOp op) { in activeOp()
167 bool SkOpSegment::activeOp(int xorMiMask, int xorSuMask, int index, int endIndex, SkPathOp op, in activeOp()
195 bool SkOpSegment::activeWinding(int index, int endIndex) { in activeWinding()
201 bool SkOpSegment::activeWinding(int index, int endIndex, int* maxWinding, int* sumWinding) { in activeWinding()
209 void SkOpSegment::addAngle(SkTArray<SkOpAngle, true>* anglesPtr, int start, int end) const { in addAngle()
[all …]
DSkOpSegment.h19 class SkOpSegment {
21 SkOpSegment() { in SkOpSegment() function
27 bool operator<(const SkOpSegment& rh) const {
134 const SkOpSegment* other(int index) const { in other()
243 int addSelfT(SkOpSegment* other, const SkPoint& pt, double newT);
244 int addT(SkOpSegment* other, const SkPoint& pt, double newT);
245 void addTCancel(const SkPoint& startPt, const SkPoint& endPt, SkOpSegment* other);
247 SkOpSegment* other);
248 void addTPair(double t, SkOpSegment* other, double otherT, bool borrowWind, const SkPoint& pt);
257 bool findCoincidentMatch(const SkOpSpan* span, const SkOpSegment* other, int oStart, int oEnd,
[all …]
DSkOpContour.h98 SkOpSegment* segment = &fSegments[sIndex]; in checkEnds()
143 const SkOpSegment& segment = fSegments.back(); in end()
159 SkOpSegment* nonVerticalSegment(int* start, int* end);
171 SkTArray<SkOpSegment>& segments() { in segments()
217 void topSortableSegment(const SkPoint& topLeft, SkPoint* bestXY, SkOpSegment** topStart);
218 SkOpSegment* undoneSegment(int* start, int* end);
221 SkOpSegment& segment = fSegments[index]; in updateSegment()
227 SkTArray<SkOpSegment>& debugSegments() { in debugSegments()
250 SkTArray<SkOpSegment> fSegments;
251 SkTArray<SkOpSegment*, true> fSortedSegments;
DSkOpAngle.h14 class SkOpSegment; variable
51 void set(const SkOpSegment* segment, int start, int end);
57 SkOpSegment* segment() const { in segment()
58 return const_cast<SkOpSegment*>(fSegment); in segment()
97 const SkOpSegment* fSegment;
DSkOpContour.cpp36 SkOpSegment* SkOpContour::nonVerticalSegment(int* start, int* end) { in nonVerticalSegment()
40 SkOpSegment* testSegment = fSortedSegments[sortedIndex]; in nonVerticalSegment()
61 SkOpSegment& thisOne = fSegments[thisIndex]; in addCoincidentPoints()
64 SkOpSegment& other = otherContour->fSegments[otherIndex]; in addCoincidentPoints()
188 SkOpSegment& thisOne = fSegments[thisIndex]; in joinCoincidence()
191 SkOpSegment& other = otherContour->fSegments[otherIndex]; in joinCoincidence()
233 SkOpSegment& thisOne = fSegments[thisIndex]; in calcCommonCoincidentWinding()
239 SkOpSegment& other = otherContour->fSegments[otherIndex]; in calcCommonCoincidentWinding()
286 SkTQSort<SkOpSegment>(fSortedSegments.begin(), fSortedSegments.end() - 1); in sortSegments()
301 SkOpSegment** topStart) { in topSortableSegment()
[all …]
DSkPathOpsCommon.cpp13 static int contourRangeCheckY(const SkTArray<SkOpContour*, true>& contourList, SkOpSegment** curren… in contourRangeCheckY()
19 const SkOpSegment* current = *currentPtr; in contourRangeCheckY()
24 SkOpSegment* bestSeg = NULL; in contourRangeCheckY()
39 SkOpSegment* testSeg = &contour->segments()[test]; in contourRangeCheckY()
101 SkOpSegment* FindUndone(SkTArray<SkOpContour*, true>& contourList, int* start, int* end) { in FindUndone()
103 SkOpSegment* result; in FindUndone()
114 SkOpSegment* FindChase(SkTDArray<SkOpSpan*>& chase, int& tIndex, int& endIndex) { in FindChase()
119 SkOpSegment* segment = backPtr.fOther; in FindChase()
138 bool sortable = SkOpSegment::SortAngles(angles, &sorted, in FindChase()
139 SkOpSegment::kMayBeUnordered_SortAngleKind); in FindChase()
[all …]
DSkPathOpsCommon.h18 SkOpSegment* FindChase(SkTDArray<SkOpSpan*>& chase, int& tIndex, int& endIndex);
19 SkOpSegment* FindSortableTop(const SkTArray<SkOpContour*, true>& , SkOpAngle::IncludeType ,
22 SkOpSegment* FindUndone(SkTArray<SkOpContour*, true>& contourList, int* start, int* end);
DSkPathOpsOp.cpp16 static SkOpSegment* findChaseOp(SkTDArray<SkOpSpan*>& chase, int& nextStart, int& nextEnd) { in findChaseOp()
21 SkOpSegment* segment = backPtr.fOther; in findChaseOp()
40 bool sortable = SkOpSegment::SortAngles(angles, &sorted, in findChaseOp()
41 SkOpSegment::kMayBeUnordered_SortAngleKind); in findChaseOp()
75 SkOpSegment* first = NULL; in findChaseOp()
147 SkOpSegment* current = FindSortableTop(contourList, SkOpAngle::kBinarySingle, &firstContour, in bridgeOp()
174 SkOpSegment* next = current->findNextOp(&chaseArray, &nextStart, &nextEnd, in bridgeOp()
DSkOpSpan.h12 class SkOpSegment; variable
15 SkOpSegment* fOther;
DSkPathOpsSimplify.cpp20 SkOpSegment* current = FindSortableTop(contourList, SkOpAngle::kUnaryWinding, &firstContour, in bridgeWinding()
47 SkOpSegment* next = current->findNextWinding(&chaseArray, &nextStart, &nextEnd, in bridgeWinding()
98 SkOpSegment* current; in bridgeXor()
112 SkOpSegment* next = current->findNextXor(&nextStart, &nextEnd, &unsortable); in bridgeXor()
DSkIntersectionHelper.h81 const SkOpSegment& segment = fContour->segments()[fIndex]; in isPartial()
101 const SkOpSegment& segment = fContour->segments()[fIndex]; in segmentType()
/external/chromium_org/third_party/skia/src/pathops/
DSkOpSegment.cpp41 bool SkOpSegment::activeAngle(int index, int* done, SkTArray<SkOpAngle, true>* angles) { in activeAngle()
68 bool SkOpSegment::activeAngleOther(int index, int* done, SkTArray<SkOpAngle, true>* angles) { in activeAngleOther()
70 SkOpSegment* other = span->fOther; in activeAngleOther()
75 bool SkOpSegment::activeAngleInner(int index, int* done, SkTArray<SkOpAngle, true>* angles) { in activeAngleInner()
110 SkPoint SkOpSegment::activeLeftTop(bool onlySortable, int* firstT) const { in activeLeftTop()
156 bool SkOpSegment::activeOp(int index, int endIndex, int xorMiMask, int xorSuMask, SkPathOp op) { in activeOp()
167 bool SkOpSegment::activeOp(int xorMiMask, int xorSuMask, int index, int endIndex, SkPathOp op, in activeOp()
195 bool SkOpSegment::activeWinding(int index, int endIndex) { in activeWinding()
201 bool SkOpSegment::activeWinding(int index, int endIndex, int* maxWinding, int* sumWinding) { in activeWinding()
209 void SkOpSegment::addAngle(SkTArray<SkOpAngle, true>* anglesPtr, int start, int end) const { in addAngle()
[all …]
DSkOpSegment.h19 class SkOpSegment {
21 SkOpSegment() { in SkOpSegment() function
27 bool operator<(const SkOpSegment& rh) const {
134 const SkOpSegment* other(int index) const { in other()
243 int addSelfT(SkOpSegment* other, const SkPoint& pt, double newT);
244 int addT(SkOpSegment* other, const SkPoint& pt, double newT);
245 void addTCancel(const SkPoint& startPt, const SkPoint& endPt, SkOpSegment* other);
247 SkOpSegment* other);
248 void addTPair(double t, SkOpSegment* other, double otherT, bool borrowWind, const SkPoint& pt);
257 bool findCoincidentMatch(const SkOpSpan* span, const SkOpSegment* other, int oStart, int oEnd,
[all …]
DSkOpContour.h98 SkOpSegment* segment = &fSegments[sIndex]; in checkEnds()
143 const SkOpSegment& segment = fSegments.back(); in end()
159 SkOpSegment* nonVerticalSegment(int* start, int* end);
171 SkTArray<SkOpSegment>& segments() { in segments()
217 void topSortableSegment(const SkPoint& topLeft, SkPoint* bestXY, SkOpSegment** topStart);
218 SkOpSegment* undoneSegment(int* start, int* end);
221 SkOpSegment& segment = fSegments[index]; in updateSegment()
227 SkTArray<SkOpSegment>& debugSegments() { in debugSegments()
250 SkTArray<SkOpSegment> fSegments;
251 SkTArray<SkOpSegment*, true> fSortedSegments;
DSkOpAngle.h14 class SkOpSegment; variable
51 void set(const SkOpSegment* segment, int start, int end);
57 SkOpSegment* segment() const { in segment()
58 return const_cast<SkOpSegment*>(fSegment); in segment()
97 const SkOpSegment* fSegment;
DSkOpContour.cpp36 SkOpSegment* SkOpContour::nonVerticalSegment(int* start, int* end) { in nonVerticalSegment()
40 SkOpSegment* testSegment = fSortedSegments[sortedIndex]; in nonVerticalSegment()
61 SkOpSegment& thisOne = fSegments[thisIndex]; in addCoincidentPoints()
64 SkOpSegment& other = otherContour->fSegments[otherIndex]; in addCoincidentPoints()
188 SkOpSegment& thisOne = fSegments[thisIndex]; in joinCoincidence()
191 SkOpSegment& other = otherContour->fSegments[otherIndex]; in joinCoincidence()
233 SkOpSegment& thisOne = fSegments[thisIndex]; in calcCommonCoincidentWinding()
239 SkOpSegment& other = otherContour->fSegments[otherIndex]; in calcCommonCoincidentWinding()
286 SkTQSort<SkOpSegment>(fSortedSegments.begin(), fSortedSegments.end() - 1); in sortSegments()
301 SkOpSegment** topStart) { in topSortableSegment()
[all …]
DSkPathOpsCommon.cpp13 static int contourRangeCheckY(const SkTArray<SkOpContour*, true>& contourList, SkOpSegment** curren… in contourRangeCheckY()
19 const SkOpSegment* current = *currentPtr; in contourRangeCheckY()
24 SkOpSegment* bestSeg = NULL; in contourRangeCheckY()
39 SkOpSegment* testSeg = &contour->segments()[test]; in contourRangeCheckY()
101 SkOpSegment* FindUndone(SkTArray<SkOpContour*, true>& contourList, int* start, int* end) { in FindUndone()
103 SkOpSegment* result; in FindUndone()
114 SkOpSegment* FindChase(SkTDArray<SkOpSpan*>& chase, int& tIndex, int& endIndex) { in FindChase()
119 SkOpSegment* segment = backPtr.fOther; in FindChase()
138 bool sortable = SkOpSegment::SortAngles(angles, &sorted, in FindChase()
139 SkOpSegment::kMayBeUnordered_SortAngleKind); in FindChase()
[all …]
DSkPathOpsCommon.h18 SkOpSegment* FindChase(SkTDArray<SkOpSpan*>& chase, int& tIndex, int& endIndex);
19 SkOpSegment* FindSortableTop(const SkTArray<SkOpContour*, true>& , SkOpAngle::IncludeType ,
22 SkOpSegment* FindUndone(SkTArray<SkOpContour*, true>& contourList, int* start, int* end);
DSkPathOpsOp.cpp16 static SkOpSegment* findChaseOp(SkTDArray<SkOpSpan*>& chase, int& nextStart, int& nextEnd) { in findChaseOp()
21 SkOpSegment* segment = backPtr.fOther; in findChaseOp()
40 bool sortable = SkOpSegment::SortAngles(angles, &sorted, in findChaseOp()
41 SkOpSegment::kMayBeUnordered_SortAngleKind); in findChaseOp()
75 SkOpSegment* first = NULL; in findChaseOp()
147 SkOpSegment* current = FindSortableTop(contourList, SkOpAngle::kBinarySingle, &firstContour, in bridgeOp()
174 SkOpSegment* next = current->findNextOp(&chaseArray, &nextStart, &nextEnd, in bridgeOp()
DSkOpSpan.h12 class SkOpSegment; variable
15 SkOpSegment* fOther;
DSkPathOpsSimplify.cpp20 SkOpSegment* current = FindSortableTop(contourList, SkOpAngle::kUnaryWinding, &firstContour, in bridgeWinding()
47 SkOpSegment* next = current->findNextWinding(&chaseArray, &nextStart, &nextEnd, in bridgeWinding()
98 SkOpSegment* current; in bridgeXor()
112 SkOpSegment* next = current->findNextXor(&nextStart, &nextEnd, &unsortable); in bridgeXor()
DSkIntersectionHelper.h81 const SkOpSegment& segment = fContour->segments()[fIndex]; in isPartial()
101 const SkOpSegment& segment = fContour->segments()[fIndex]; in segmentType()
/external/skia/gyp/
Dpathops.gypi20 '../src/pathops/SkOpSegment.cpp',
44 '../src/pathops/SkOpSegment.h',
/external/chromium_org/third_party/skia/gyp/
Dpathops.gypi20 '../src/pathops/SkOpSegment.cpp',
44 '../src/pathops/SkOpSegment.h',
/external/skia/tests/
DPathOpsAngleTest.cpp242 SkOpSegment* seg, int* ts, const SkPoint& startPt) { in setup()
318 SkTArray<SkOpSegment> segs; in testOne()
322 SkOpSegment& seg = segs.push_back(); in testOne()

12