2119     for (size_t testIndex = 0; testIndex < testCount; ++testIndex) {  in test_isRect()  local
2121         path.moveTo(tests[testIndex].fPoints[0].fX, tests[testIndex].fPoints[0].fY);  in test_isRect()
2122         for (index = 1; index < tests[testIndex].fPointCount; ++index) {  in test_isRect()
2123             path.lineTo(tests[testIndex].fPoints[index].fX, tests[testIndex].fPoints[index].fY);  in test_isRect()
2125         if (tests[testIndex].fClose) {  in test_isRect()
2128         REPORTER_ASSERT(reporter, tests[testIndex].fIsRect == path.isRect(nullptr));  in test_isRect()
2130         if (tests[testIndex].fIsRect) {  in test_isRect()
2134             int pointCount = tests[testIndex].fPointCount - (d2 == tests[testIndex].fPoints);  in test_isRect()
2135             expected.setBounds(tests[testIndex].fPoints, pointCount);  in test_isRect()
2140             REPORTER_ASSERT(reporter, isClosed == tests[testIndex].fClose);  in test_isRect()
2425         for (size_t testIndex = 0; testIndex < testCount; ++testIndex) {  in test_isNestedFillRects()  local
2430             path.moveTo(tests[testIndex].fPoints[0].fX, tests[testIndex].fPoints[0].fY);  in test_isNestedFillRects()
2431             for (index = 1; index < tests[testIndex].fPointCount; ++index) {  in test_isNestedFillRects()
2432                 path.lineTo(tests[testIndex].fPoints[index].fX, tests[testIndex].fPoints[index].fY);  in test_isNestedFillRects()
2434             if (tests[testIndex].fClose) {  in test_isNestedFillRects()
2441 …                   tests[testIndex].fIsNestedRect == SkPathPriv::IsNestedFillRects(path, nullptr));  in test_isNestedFillRects()
2442             if (tests[testIndex].fIsNestedRect) {  in test_isNestedFillRects()
2447                 testBounds.setBounds(tests[testIndex].fPoints, tests[testIndex].fPointCount);  in test_isNestedFillRects()
2455                 expectedDirs[1] = tests[testIndex].fDirection;  in test_isNestedFillRects()