14     size_t index;  in CubicReduceOrder_Test()  local
47     for (index = firstPointDegeneratesTest; index < pointDegenerates_count; ++index) {  in CubicReduceOrder_Test()
48         const Cubic& cubic = pointDegenerates[index];  in CubicReduceOrder_Test()
52             SkDebugf("[%d] pointDegenerates order=%d\n", (int) index, order);  in CubicReduceOrder_Test()
55     for (index = firstNotPointDegeneratesTest; index < notPointDegenerates_count; ++index) {  in CubicReduceOrder_Test()
56         const Cubic& cubic = notPointDegenerates[index];  in CubicReduceOrder_Test()
60             SkDebugf("[%d] notPointDegenerates order=%d\n", (int) index, order);  in CubicReduceOrder_Test()
63     for (index = firstLinesTest; index < lines_count; ++index) {  in CubicReduceOrder_Test()
64         const Cubic& cubic = lines[index];  in CubicReduceOrder_Test()
68             SkDebugf("[%d] lines order=%d\n", (int) index, order);  in CubicReduceOrder_Test()
71     for (index = firstNotLinesTest; index < notLines_count; ++index) {  in CubicReduceOrder_Test()
72         const Cubic& cubic = notLines[index];  in CubicReduceOrder_Test()
76             SkDebugf("[%d] notLines order=%d\n", (int) index, order);  in CubicReduceOrder_Test()
79     for (index = firstModEpsilonTest; index < modEpsilonLines_count; ++index) {  in CubicReduceOrder_Test()
80         const Cubic& cubic = modEpsilonLines[index];  in CubicReduceOrder_Test()
84             SkDebugf("[%d] line mod by epsilon order=%d\n", (int) index, order);  in CubicReduceOrder_Test()
87     for (index = firstLessEpsilonTest; index < lessEpsilonLines_count; ++index) {  in CubicReduceOrder_Test()
88         const Cubic& cubic = lessEpsilonLines[index];  in CubicReduceOrder_Test()
92             SkDebugf("[%d] line less by epsilon/2 order=%d\n", (int) index, order);  in CubicReduceOrder_Test()
95     for (index = firstNegEpsilonTest; index < negEpsilonLines_count; ++index) {  in CubicReduceOrder_Test()
96         const Cubic& cubic = negEpsilonLines[index];  in CubicReduceOrder_Test()
100             SkDebugf("[%d] line neg by epsilon/2 order=%d\n", (int) index, order);  in CubicReduceOrder_Test()
103     for (index = firstQuadraticLineTest; index < quadraticLines_count; ++index) {  in CubicReduceOrder_Test()
104         const Quadratic& quad = quadraticLines[index];  in CubicReduceOrder_Test()
110             SkDebugf("[%d] line quad order=%d\n", (int) index, order);  in CubicReduceOrder_Test()
113     for (index = firstQuadraticModLineTest; index < quadraticModEpsilonLines_count; ++index) {  in CubicReduceOrder_Test()
114         const Quadratic& quad = quadraticModEpsilonLines[index];  in CubicReduceOrder_Test()
120             SkDebugf("[%d] line mod quad order=%d\n", (int) index, order);  in CubicReduceOrder_Test()
125     for (index = firstComputedLinesTest; index < lines_count; ++index) {  in CubicReduceOrder_Test()
126         const Cubic& cubic = lines[index];  in CubicReduceOrder_Test()
131             SkDebugf("[%d] line computed ends match order=%d\n", (int) index, order);  in CubicReduceOrder_Test()
138                 SkDebugf("[%d] line computed ends order=%d\n", (int) index, order);  in CubicReduceOrder_Test()
149                 SkDebugf("[%d] line computed tight bounds order=%d\n", (int) index, order);  in CubicReduceOrder_Test()