Home
last modified time | relevance | path

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

/external/skqp/tests/
DPathOpsSimplifyFailTest.cpp39 const size_t finitePtsCount = sizeof(finitePts) / sizeof(finitePts[0]); variable
44 int f = (int) (index % finitePtsCount); in failOne()
45 int g = (int) ((f + 1) % finitePtsCount); in failOne()
72 int f = (int) (index % finitePtsCount); in dontFailOne()
73 int g = (int) ((f + 1) % finitePtsCount); in dontFailOne()
226 for (int index = 0; index < (int) (13 * nonFinitePtsCount * finitePtsCount); ++index) { in DEF_TEST()
229 for (int index = 0; index < (int) (11 * finitePtsCount); ++index) { in DEF_TEST()
DPathTest.cpp1603 const size_t finitePtsCount = sizeof(finitePts) / sizeof(finitePts[0]); in test_convexity() local
1605 for (int index = 0; index < (int) (13 * nonFinitePtsCount * finitePtsCount); ++index) { in test_convexity()
1607 int f = (int) (index % finitePtsCount); in test_convexity()
1608 int g = (int) ((f + 1) % finitePtsCount); in test_convexity()
1628 for (int index = 0; index < (int) (11 * finitePtsCount); ++index) { in test_convexity()
1629 int f = (int) (index % finitePtsCount); in test_convexity()
1630 int g = (int) ((f + 1) % finitePtsCount); in test_convexity()
/external/skia/tests/
DPathOpsSimplifyFailTest.cpp39 const size_t finitePtsCount = sizeof(finitePts) / sizeof(finitePts[0]); variable
44 int f = (int) (index % finitePtsCount); in failOne()
45 int g = (int) ((f + 1) % finitePtsCount); in failOne()
72 int f = (int) (index % finitePtsCount); in dontFailOne()
73 int g = (int) ((f + 1) % finitePtsCount); in dontFailOne()
226 for (int index = 0; index < (int) (13 * nonFinitePtsCount * finitePtsCount); ++index) { in DEF_TEST()
229 for (int index = 0; index < (int) (11 * finitePtsCount); ++index) { in DEF_TEST()
DPathTest.cpp1603 const size_t finitePtsCount = sizeof(finitePts) / sizeof(finitePts[0]); in test_convexity() local
1605 for (int index = 0; index < (int) (13 * nonFinitePtsCount * finitePtsCount); ++index) { in test_convexity()
1607 int f = (int) (index % finitePtsCount); in test_convexity()
1608 int g = (int) ((f + 1) % finitePtsCount); in test_convexity()
1628 for (int index = 0; index < (int) (11 * finitePtsCount); ++index) { in test_convexity()
1629 int f = (int) (index % finitePtsCount); in test_convexity()
1630 int g = (int) ((f + 1) % finitePtsCount); in test_convexity()