28 static const SkPoint finitePts[] = {  variable
38 const size_t finitePtsCount = sizeof(finitePts) / sizeof(finitePts[0]);
48         case 2: path.quadTo(nonFinitePts[i], finitePts[f]); break;  in failOne()
49         case 3: path.quadTo(finitePts[f], nonFinitePts[i]); break;  in failOne()
50         case 4: path.cubicTo(nonFinitePts[i], finitePts[f], finitePts[f]); break;  in failOne()
51         case 5: path.cubicTo(finitePts[f], nonFinitePts[i], finitePts[f]); break;  in failOne()
52         case 6: path.cubicTo(finitePts[f], finitePts[f], nonFinitePts[i]); break;  in failOne()
53         case 7: path.cubicTo(nonFinitePts[i], nonFinitePts[i], finitePts[f]); break;  in failOne()
54         case 8: path.cubicTo(nonFinitePts[i], finitePts[f], nonFinitePts[i]); break;  in failOne()
55         case 9: path.cubicTo(finitePts[f], nonFinitePts[i], nonFinitePts[i]); break;  in failOne()
57         case 11: path.cubicTo(nonFinitePts[i], finitePts[f], finitePts[g]); break;  in failOne()
74         case 0: path.lineTo(finitePts[f]); break;  in dontFailOne()
75         case 1: path.quadTo(finitePts[f], finitePts[f]); break;  in dontFailOne()
76         case 2: path.quadTo(finitePts[f], finitePts[g]); break;  in dontFailOne()
77         case 3: path.quadTo(finitePts[g], finitePts[f]); break;  in dontFailOne()
78         case 4: path.cubicTo(finitePts[f], finitePts[f], finitePts[f]); break;  in dontFailOne()
79         case 5: path.cubicTo(finitePts[f], finitePts[f], finitePts[g]); break;  in dontFailOne()
80         case 6: path.cubicTo(finitePts[f], finitePts[g], finitePts[f]); break;  in dontFailOne()
81         case 7: path.cubicTo(finitePts[f], finitePts[g], finitePts[g]); break;  in dontFailOne()
82         case 8: path.cubicTo(finitePts[g], finitePts[f], finitePts[f]); break;  in dontFailOne()
83         case 9: path.cubicTo(finitePts[g], finitePts[f], finitePts[g]); break;  in dontFailOne()
84         case 10: path.moveTo(finitePts[f]); break;  in dontFailOne()