| /external/skia/src/core/ |
| H A D | SkEdge.cpp | 53 int winding = 1; local
58 winding = -1;
81 fWinding = SkToS8(winding);
199 int winding = 1; local
204 winding = -1;
229 fWinding = SkToS8(winding);
361 int winding = 1; local
368 winding = -1;
405 fWinding = SkToS8(winding);
|
| /external/skia/src/pathops/ |
| H A D | SkPathOpsOp.cpp | 36 int winding; local
38 const SkOpAngle* angle = AngleWinding(*startPtr, *endPtr, &winding, &sortable);
39 if (winding == SK_MinS32) {
|
| H A D | SkPathOpsCommon.cpp | 16 // find first angle, initialize winding to computed fWindSum
27 int winding = SK_MinS32; local
32 break; // if we get here, there's no winding, loop is unorderable
36 winding = segment->windSum(angle);
37 } while (winding == SK_MinS32);
39 // directly compute the winding in this case for each span
42 winding = SK_MinS32;
53 winding = testWinding;
59 *windingPtr = winding;
98 // find first angle, initialize winding t
99 int winding; local
[all...] |
| H A D | SkPathOpsDebug.cpp | 223 void SkOpSegment::debugShowNewWinding(const char* fun, const SkOpSpan* span, int winding) { argument
232 if (winding == SK_MinS32) {
235 SkDebugf("%d", winding);
246 void SkOpSegment::debugShowNewWinding(const char* fun, const SkOpSpan* span, int winding, argument
255 span->t(), span->debugID(), pt.fX, pt.fY, span->next()->t(), winding, oppWinding);
256 if (winding == SK_MinS32) {
259 SkDebugf("%d", winding);
|
| H A D | SkOpSegment.cpp | 444 // if all angles have a computed winding,
446 // or if adjacent orderable angles have no computed winding,
449 // and one has winding computed, transfer to the other
601 // iterate through the angle, and compute everyone's winding
697 // iterate through the angle, and compute everyone's winding
785 // iterate through the angle, and compute everyone's winding
871 bool SkOpSegment::markAndChaseWinding(SkOpSpanBase* start, SkOpSpanBase* end, int winding, argument
875 bool success = markWinding(spanStart, winding);
880 SkASSERT(spanStart->windSum() == winding);
884 (void) other->markWinding(spanStart, winding);
892 markAndChaseWinding(SkOpSpanBase* start, SkOpSpanBase* end, int winding, int oppWinding, SkOpSpanBase** lastPtr) argument
985 markWinding(SkOpSpan* span, int winding) argument
999 markWinding(SkOpSpan* span, int winding, int oppWinding) argument
1640 int winding = lesser->windSum(); local
[all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| H A D | nv50_ir_driver.h | 142 int8_t winding; /* +1 (clockwise) / -1 (counter-clockwise) */ member in struct:nv50_ir_prog_info::__anon12087::__anon12089
|
| /external/deqp/framework/referencerenderer/ |
| H A D | rrRenderState.hpp | 50 WINDING_CCW = 0, //!< Counter-clockwise winding
51 WINDING_CW, //!< Clockwise winding
69 : winding (WINDING_CCW)
75 Winding winding; member in struct:rr::RasterizationState
|
| /external/skia/src/gpu/ |
| H A D | GrTessellatingPathRenderer.cpp | 234 Edge(Vertex* top, Vertex* bottom, int winding) argument
235 : fWinding(winding)
312 Poly(int winding) argument
313 : fWinding(winding)
458 Poly* new_poly(Poly** head, Vertex* v, int winding, SkChunkAlloc& alloc) { argument
459 Poly* poly = ALLOC_NEW(Poly, (winding), alloc);
621 inline bool apply_fill_type(SkPath::FillType fillType, int winding) { argument
624 return winding != 0;
626 return (winding & 1) != 0;
628 return winding
638 int winding = c.sweep_lt(prev->fPoint, next->fPoint) ? 1 : -1; local
1267 int winding = leftEdge->fLeftPoly ? leftEdge->fLeftPoly->fWinding : 0; local
[all...] |