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

  /external/skia/src/gpu/
GrTessellator.h 39 int fWinding;
GrTessellator.cpp 358 : fWinding(winding)
380 int fWinding; // 1 == edge goes downward; -1 = edge goes upward.
521 , fWinding(winding)
662 int fWinding;
837 return poly && apply_fill_type(fillType, poly->fWinding);
    [all...]
  /external/skqp/src/gpu/
GrTessellator.h 39 int fWinding;
GrTessellator.cpp 358 : fWinding(winding)
380 int fWinding; // 1 == edge goes downward; -1 = edge goes upward.
521 , fWinding(winding)
662 int fWinding;
837 return poly && apply_fill_type(fillType, poly->fWinding);
    [all...]
  /external/skia/src/core/
SkAnalyticEdge.cpp 20 SkASSERT(fWinding == 1 || fWinding == -1);
28 fWinding = -fWinding;
86 fWinding = fQEdge.fWinding;
178 fWinding = fCEdge.fWinding;
SkEdgeBuilder.cpp 25 if (edge->fWinding == last->fWinding) {
46 last->fWinding = edge->fWinding;
56 last->fWinding = edge->fWinding;
72 if (edge->fWinding == last->fWinding) {
96 last->fWinding = edge->fWinding;
    [all...]
SkEdge.h 36 int8_t fWinding; // 1 or -1
51 SkDebugf("edge: firstY:%d lastY:%d x:%g dx:%g w:%d\n", fFirstY, fLastY, SkFixedToFloat(fX), SkFixedToFloat(fDX), fWinding);
60 SkASSERT(SkAbs32(fWinding) == 1);
130 fWinding = SkToS8(winding);
SkAnalyticEdge.h 44 int8_t fWinding; // 1 or -1
90 SkFixedToFloat(fDX), fWinding);
99 SkASSERT(SkAbs32(fWinding) == 1);
182 fWinding = SkToS8(winding);
SkEdge.cpp 80 fWinding = SkToS8(winding);
92 SkASSERT(fWinding == 1 || fWinding == -1);
236 fWinding = SkToS8(winding);
420 fWinding = SkToS8(winding);
SkScan_DAAPath.cpp 78 // Let's see if multiplying sign is faster than multiplying edge->fWinding.
80 int sign = edge->fWinding == 1 ? 1 : -1;
234 originalWinding = currE->fWinding;
241 originalWinding = static_cast<SkAnalyticQuadraticEdge*>(currE)->fQEdge.fWinding;
249 originalWinding = static_cast<SkAnalyticCubicEdge*>(currE)->fCEdge.fWinding;
313 // Intended assignment to fWinding to restore the maybe-negated winding (during updateLine)
314 } while ((currE->fWinding = originalWinding) && currE->update(currE->fLowerY, sortY));
SkScan_Path.cpp 123 w += currE->fWinding;
SkScan_AAAPath.cpp     [all...]
  /external/skqp/src/core/
SkAnalyticEdge.cpp 20 SkASSERT(fWinding == 1 || fWinding == -1);
28 fWinding = -fWinding;
86 fWinding = fQEdge.fWinding;
178 fWinding = fCEdge.fWinding;
SkEdgeBuilder.cpp 25 if (edge->fWinding == last->fWinding) {
46 last->fWinding = edge->fWinding;
56 last->fWinding = edge->fWinding;
72 if (edge->fWinding == last->fWinding) {
96 last->fWinding = edge->fWinding;
    [all...]
SkEdge.h 36 int8_t fWinding; // 1 or -1
51 SkDebugf("edge: firstY:%d lastY:%d x:%g dx:%g w:%d\n", fFirstY, fLastY, SkFixedToFloat(fX), SkFixedToFloat(fDX), fWinding);
60 SkASSERT(SkAbs32(fWinding) == 1);
130 fWinding = SkToS8(winding);
SkAnalyticEdge.h 44 int8_t fWinding; // 1 or -1
90 SkFixedToFloat(fDX), fWinding);
99 SkASSERT(SkAbs32(fWinding) == 1);
182 fWinding = SkToS8(winding);
SkEdge.cpp 80 fWinding = SkToS8(winding);
92 SkASSERT(fWinding == 1 || fWinding == -1);
236 fWinding = SkToS8(winding);
420 fWinding = SkToS8(winding);
SkScan_DAAPath.cpp 78 // Let's see if multiplying sign is faster than multiplying edge->fWinding.
80 int sign = edge->fWinding == 1 ? 1 : -1;
234 originalWinding = currE->fWinding;
241 originalWinding = static_cast<SkAnalyticQuadraticEdge*>(currE)->fQEdge.fWinding;
249 originalWinding = static_cast<SkAnalyticCubicEdge*>(currE)->fCEdge.fWinding;
313 // Intended assignment to fWinding to restore the maybe-negated winding (during updateLine)
314 } while ((currE->fWinding = originalWinding) && currE->update(currE->fLowerY, sortY));
SkScan_Path.cpp 122 w += currE->fWinding;
SkScan_AAAPath.cpp     [all...]
  /external/skia/src/gpu/ccpr/
GrCCPathParser.cpp 220 int tessWinding = vertices[i].fWinding;
221 SkASSERT(tessWinding == vertices[i + 1].fWinding);
222 SkASSERT(tessWinding == vertices[i + 2].fWinding);
331 if (1 == abs(vertices[i].fWinding)) {
338 -static_cast<float>(vertices[i].fWinding));

Completed in 302 milliseconds