Home
last modified time | relevance | path

Searched refs:fPtCount (Results 1 – 4 of 4) sorted by relevance

/external/skqp/tests/
DPathOpsAngleTest.cpp229 const int fPtCount; member
248 for (int idx2 = 0; idx2 < data.fPtCount; ++idx2) { in DEF_TEST()
251 switch (data.fPtCount) { in DEF_TEST()
272 const int fPtCount; member
447 for (int idx2 = 0; idx2 < data.fPtCount; ++idx2) { in DEF_TEST()
450 switch (data.fPtCount) { in DEF_TEST()
/external/skia/tests/
DPathOpsAngleTest.cpp229 const int fPtCount; member
248 for (int idx2 = 0; idx2 < data.fPtCount; ++idx2) { in DEF_TEST()
251 switch (data.fPtCount) { in DEF_TEST()
272 const int fPtCount; member
447 for (int idx2 = 0; idx2 < data.fPtCount; ++idx2) { in DEF_TEST()
450 switch (data.fPtCount) { in DEF_TEST()
/external/skqp/src/core/
DSkPath.cpp2335 : fPtCount(0) in Convexicator()
2363 if (0 == fPtCount) { in addPt()
2365 ++fPtCount; in addPt()
2375 if (++fPtCount == 2) { in addPt()
2378 SkASSERT(fPtCount > 2); in addPt()
2397 if (fPtCount > 2) { in close()
2493 int fPtCount; // non-degenerate points member
/external/skia/src/core/
DSkPath.cpp2335 : fPtCount(0) in Convexicator()
2363 if (0 == fPtCount) { in addPt()
2365 ++fPtCount; in addPt()
2375 if (++fPtCount == 2) { in addPt()
2378 SkASSERT(fPtCount > 2); in addPt()
2397 if (fPtCount > 2) { in close()
2493 int fPtCount; // non-degenerate points member