24     int index, minX, maxX, minY, maxY;
26     for (index = 1; index < 4; ++index) {
27         if (cubic[minX].fX > cubic[index].fX) {
28             minX = index;
30         if (cubic[minY].fY > cubic[index].fY) {
31             minY = index;
33         if (cubic[maxX].fX < cubic[index].fX) {
34             maxX = index;
36         if (cubic[maxY].fY < cubic[index].fY) {
37             maxY = index;
62     size_t index;  in DEF_TEST()  local
107     for (index = firstPointDegeneratesTest; index < pointDegenerates_count; ++index) {  in DEF_TEST()
108         const SkDCubic& cubic = pointDegenerates[index];  in DEF_TEST()
112             SkDebugf("[%d] pointDegenerates order=%d\n", static_cast<int>(index), order);  in DEF_TEST()
116     for (index = firstNotPointDegeneratesTest; index < notPointDegenerates_count; ++index) {  in DEF_TEST()
117         const SkDCubic& cubic = notPointDegenerates[index];  in DEF_TEST()
121             SkDebugf("[%d] notPointDegenerates order=%d\n", static_cast<int>(index), order);  in DEF_TEST()
126     for (index = firstLinesTest; index < lines_count; ++index) {  in DEF_TEST()
127         const SkDCubic& cubic = lines[index];  in DEF_TEST()
131             SkDebugf("[%d] lines order=%d\n", static_cast<int>(index), order);  in DEF_TEST()
135     for (index = firstNotLinesTest; index < notLines_count; ++index) {  in DEF_TEST()
136         const SkDCubic& cubic = notLines[index];  in DEF_TEST()
140             SkDebugf("[%d] notLines order=%d\n", static_cast<int>(index), order);  in DEF_TEST()
144     for (index = firstModEpsilonTest; index < modEpsilonLines_count; ++index) {  in DEF_TEST()
145         const SkDCubic& cubic = modEpsilonLines[index];  in DEF_TEST()
149             SkDebugf("[%d] line mod by epsilon order=%d\n", static_cast<int>(index), order);  in DEF_TEST()
153     for (index = firstLessEpsilonTest; index < lessEpsilonLines_count; ++index) {  in DEF_TEST()
154         const SkDCubic& cubic = lessEpsilonLines[index];  in DEF_TEST()
158             SkDebugf("[%d] line less by epsilon/2 order=%d\n", static_cast<int>(index), order);  in DEF_TEST()
163     for (index = firstNegEpsilonTest; index < negEpsilonLines_count; ++index) {  in DEF_TEST()
164         const SkDCubic& cubic = negEpsilonLines[index];  in DEF_TEST()
168             SkDebugf("[%d] line neg by epsilon/2 order=%d\n", static_cast<int>(index), order);  in DEF_TEST()
172     for (index = firstQuadraticPointTest; index < quadraticPoints_count; ++index) {  in DEF_TEST()
173         const SkDQuad& quad = quadraticPoints[index];  in DEF_TEST()
178             SkDebugf("[%d] point quad order=%d\n", static_cast<int>(index), order);  in DEF_TEST()
182     for (index = firstQuadraticLineTest; index < quadraticLines_count; ++index) {  in DEF_TEST()
183         const SkDQuad& quad = quadraticLines[index];  in DEF_TEST()
188             SkDebugf("[%d] line quad order=%d\n", static_cast<int>(index), order);  in DEF_TEST()
192     for (index = firstQuadraticModLineTest; index < quadraticModEpsilonLines_count; ++index) {  in DEF_TEST()
193         const SkDQuad& quad = quadraticModEpsilonLines[index];  in DEF_TEST()
198             SkDebugf("[%d] line mod quad order=%d\n", static_cast<int>(index), order);  in DEF_TEST()
205     for (index = firstComputedLinesTest; index < lines_count; ++index) {  in DEF_TEST()
206         const SkDCubic& cubic = lines[index];  in DEF_TEST()
212             SkDebugf("[%d] line computed ends match order=%d\n", static_cast<int>(index), order);  in DEF_TEST()
220                 SkDebugf("[%d] line computed ends order=%d\n", static_cast<int>(index), order);  in DEF_TEST()
236 …            SkDebugf("[%d] line computed tight bounds order=%d\n", static_cast<int>(index), order);  in DEF_TEST()