| /external/skia/tests/ |
| InsetConvexPolyTest.cpp | 17 SkScalar winding = v0.cross(v1); local
26 if (winding*perpDot < 0) {
|
| /external/skqp/tests/ |
| InsetConvexPolyTest.cpp | 17 SkScalar winding = v0.cross(v1); local
26 if (winding*perpDot < 0) {
|
| /external/deqp/external/vulkancts/modules/vulkan/tessellation/ |
| vktTessellationPrimitiveDiscardTests.cpp | 57 Winding winding; member in struct:vkt::tessellation::__anon17979::CaseDefinition
325 << getWindingShaderName(caseDef.winding)
631 (Winding)windingNdx,
641 + "_" + getWindingShaderName(caseDef.winding)
|
| vktTessellationInvarianceTests.cpp | 70 inline WindingUsage getWindingUsage (const Winding winding)
72 const WindingUsage usage = winding == WINDING_CCW ? WINDING_USAGE_CCW :
73 winding == WINDING_CW ? WINDING_USAGE_CW : WINDING_USAGE_LAST;
78 std::vector<Winding> getWindingCases (const WindingUsage windingUsage)
80 std::vector<Winding> cases;
154 inline std::string getProgramName (const std::string& baseName, const Winding winding, const bool usePointMode)
157 str << baseName << "_" << getWindingShaderName(winding) << (usePointMode ? "_point_mode" : "");
168 inline std::string getProgramDescription (const Winding winding, const bool usePointMode
470 Winding winding; member in struct:vkt::tessellation::__anon17975::InvariantOuterEdge::CaseDefinition
739 const Winding winding = static_cast<Winding>(windingNdx); local
[all...] |
| /external/skia/src/core/ |
| SkAnalyticEdge.h | 155 int winding = 1; local
160 winding = -1;
182 fWinding = SkToS8(winding);
|
| SkEdge.cpp | 52 int winding = 1; local
57 winding = -1;
80 fWinding = SkToS8(winding);
203 int winding = 1; local
208 winding = -1;
236 fWinding = SkToS8(winding);
376 int winding = 1; local
383 winding = -1;
420 fWinding = SkToS8(winding);
|
| /external/skqp/src/core/ |
| SkAnalyticEdge.h | 155 int winding = 1; local
160 winding = -1;
182 fWinding = SkToS8(winding);
|
| SkEdge.cpp | 52 int winding = 1; local
57 winding = -1;
80 fWinding = SkToS8(winding);
203 int winding = 1; local
208 winding = -1;
236 fWinding = SkToS8(winding);
376 int winding = 1; local
383 winding = -1;
420 fWinding = SkToS8(winding);
|
| /external/skia/src/pathops/ |
| SkPathOpsCommon.cpp | 38 // find first angle, initialize winding to computed fWindSum
49 int winding = SK_MinS32; local
57 break; // if we get here, there's no winding, loop is unorderable
61 winding = segment->windSum(angle);
62 } while (winding == SK_MinS32);
64 // directly compute the winding in this case for each span
67 winding = SK_MinS32;
78 winding = testWinding;
84 *windingPtr = winding;
124 // find first angle, initialize winding to computed wind su
125 int winding; local
[all...] |
| SkPathOpsOp.cpp | 36 int winding; local
38 const SkOpAngle* angle = AngleWinding(*startPtr, *endPtr, &winding, &sortable);
42 if (winding == SK_MinS32) {
|
| SkOpSegment.cpp | 403 // if all angles have a computed winding,
405 // or if adjacent orderable angles have no computed winding,
408 // and one has winding computed, transfer to the other
577 // iterate through the angle, and compute everyone's winding
673 // iterate through the angle, and compute everyone's winding
761 // iterate through the angle, and compute everyone's winding
859 bool SkOpSegment::markAndChaseWinding(SkOpSpanBase* start, SkOpSpanBase* end, int winding,
863 bool success = markWinding(spanStart, winding);
868 // SkASSERT(spanStart->windSum() == winding); // FIXME: is this assert too aggressive?
872 (void) other->markWinding(spanStart, winding);
1677 int winding = lesser->windSum(); local
[all...] |
| /external/skia/src/utils/ |
| SkInsetConvexPolygon.cpp | 148 SkScalar winding = v0.cross(v1); local
157 if (winding*perpDot < 0) {
167 // we should only be making left-hand turns (for cw polygons, we use the winding
184 int winding = get_winding(inputPolygonVerts, inputPolygonSize); local
185 if (0 == winding) {
203 inputPolygonVerts[k])*winding < 0) {
208 winding,
252 int side = winding*compute_side(edgeData[currIndex].fInset.fP0,
255 if (side < 0 && side == winding*compute_side(edgeData[currIndex].fInset.fP0,
|
| /external/skqp/src/pathops/ |
| SkPathOpsCommon.cpp | 38 // find first angle, initialize winding to computed fWindSum
49 int winding = SK_MinS32; local
57 break; // if we get here, there's no winding, loop is unorderable
61 winding = segment->windSum(angle);
62 } while (winding == SK_MinS32);
64 // directly compute the winding in this case for each span
67 winding = SK_MinS32;
78 winding = testWinding;
84 *windingPtr = winding;
124 // find first angle, initialize winding to computed wind su
125 int winding; local
[all...] |
| SkPathOpsOp.cpp | 36 int winding; local
38 const SkOpAngle* angle = AngleWinding(*startPtr, *endPtr, &winding, &sortable);
42 if (winding == SK_MinS32) {
|
| SkOpSegment.cpp | 403 // if all angles have a computed winding,
405 // or if adjacent orderable angles have no computed winding,
408 // and one has winding computed, transfer to the other
577 // iterate through the angle, and compute everyone's winding
673 // iterate through the angle, and compute everyone's winding
761 // iterate through the angle, and compute everyone's winding
859 bool SkOpSegment::markAndChaseWinding(SkOpSpanBase* start, SkOpSpanBase* end, int winding,
863 bool success = markWinding(spanStart, winding);
868 // SkASSERT(spanStart->windSum() == winding); // FIXME: is this assert too aggressive?
872 (void) other->markWinding(spanStart, winding);
1677 int winding = lesser->windSum(); local
[all...] |
| /external/skqp/src/utils/ |
| SkInsetConvexPolygon.cpp | 148 SkScalar winding = v0.cross(v1); local
157 if (winding*perpDot < 0) {
167 // we should only be making left-hand turns (for cw polygons, we use the winding
184 int winding = get_winding(inputPolygonVerts, inputPolygonSize); local
185 if (0 == winding) {
203 inputPolygonVerts[k])*winding < 0) {
208 winding,
252 int side = winding*compute_side(edgeData[currIndex].fInset.fP0,
255 if (side < 0 && side == winding*compute_side(edgeData[currIndex].fInset.fP0,
|
| /external/deqp/framework/referencerenderer/ |
| rrRenderState.hpp | 47 //! Winding mode
48 enum Winding
50 WINDING_CCW = 0, //!< Counter-clockwise winding
51 WINDING_CW, //!< Clockwise winding
78 : winding (WINDING_CCW)
85 Winding winding; member in struct:rr::RasterizationState
|
| /external/mesa3d/src/gallium/drivers/nouveau/codegen/ |
| nv50_ir_driver.h | 131 int8_t winding; /* +1 (clockwise) / -1 (counter-clockwise) */ member in struct:nv50_ir_prog_info::__anon29619::__anon29621
|
| /frameworks/native/opengl/libagl/ |
| primitives.cpp | 830 const GLenum winding = (c->lerp.area() > 0) ? GL_CW : GL_CCW; local
831 const GLenum face = (winding == c->cull.frontFace) ? GL_FRONT : GL_BACK;
[all...] |
| /external/skia/src/gpu/ |
| GrTessellator.cpp | 357 Edge(Vertex* top, Vertex* bottom, int winding, Type type)
358 : fWinding(winding)
519 Poly(Vertex* v, int winding)
521 , fWinding(winding)
679 Poly* new_poly(Poly** head, Vertex* v, int winding, SkArenaAlloc& alloc) {
680 Poly* poly = alloc.make<Poly>(v, winding);
820 inline bool apply_fill_type(SkPath::FillType fillType, int winding) {
823 return winding != 0;
825 return (winding & 1) != 0;
827 return winding == 1
841 int winding = c.sweep_lt(prev->fPoint, next->fPoint) ? 1 : -1; local
1607 int winding = leftEdge->fLeftPoly ? leftEdge->fLeftPoly->fWinding : 0; local
1751 int winding = c.sweep_lt(prev->fPoint, next->fPoint) ? 1 : -1; local
1863 int winding = c.sweep_lt(prev->fPoint, next->fPoint) ? 1 : -1; local
[all...] |
| /external/skqp/src/gpu/ |
| GrTessellator.cpp | 357 Edge(Vertex* top, Vertex* bottom, int winding, Type type)
358 : fWinding(winding)
519 Poly(Vertex* v, int winding)
521 , fWinding(winding)
679 Poly* new_poly(Poly** head, Vertex* v, int winding, SkArenaAlloc& alloc) {
680 Poly* poly = alloc.make<Poly>(v, winding);
820 inline bool apply_fill_type(SkPath::FillType fillType, int winding) {
823 return winding != 0;
825 return (winding & 1) != 0;
827 return winding == 1
841 int winding = c.sweep_lt(prev->fPoint, next->fPoint) ? 1 : -1; local
1607 int winding = leftEdge->fLeftPoly ? leftEdge->fLeftPoly->fWinding : 0; local
1751 int winding = c.sweep_lt(prev->fPoint, next->fPoint) ? 1 : -1; local
1863 int winding = c.sweep_lt(prev->fPoint, next->fPoint) ? 1 : -1; local
[all...] |
