17 static int coincident_line(const SkDQuad& quad, SkDQuad& reduction) {  in coincident_line()  argument
18     reduction[0] = reduction[1] = quad[0];  in coincident_line()
26 static int vertical_line(const SkDQuad& quad, SkDQuad& reduction) {  in vertical_line()  argument
27     reduction[0] = quad[0];  in vertical_line()
28     reduction[1] = quad[2];  in vertical_line()
32 static int horizontal_line(const SkDQuad& quad, SkDQuad& reduction) {  in horizontal_line()  argument
33     reduction[0] = quad[0];  in horizontal_line()
34     reduction[1] = quad[2];  in horizontal_line()
38 static int check_linear(const SkDQuad& quad,  in check_linear()  argument
40     if (!quad.isLinear(0, 2)) {  in check_linear()
44     reduction[0] = quad[0];  in check_linear()
45     reduction[1] = quad[2];  in check_linear()
55 int SkReduceOrder::reduce(const SkDQuad& quad) {  in reduce()  argument
61         if (quad[minX].fX > quad[index].fX) {  in reduce()
64         if (quad[minY].fY > quad[index].fY) {  in reduce()
67         if (quad[maxX].fX < quad[index].fX) {  in reduce()
70         if (quad[maxY].fY < quad[index].fY) {  in reduce()
75         if (AlmostEqualUlps(quad[index].fX, quad[minX].fX)) {  in reduce()
78         if (AlmostEqualUlps(quad[index].fY, quad[minY].fY)) {  in reduce()
85         return coincident_line(quad, fQuad);  in reduce()
88         return vertical_line(quad, fQuad);  in reduce()
91         return horizontal_line(quad, fQuad);  in reduce()
93     int result = check_linear(quad, minX, maxX, minY, maxY, fQuad);  in reduce()
97     fQuad = quad;  in reduce()
247     SkDQuad quad;  in Quad()  local
248     quad.set(a);  in Quad()
250     int order = reducer.reduce(quad);  in Quad()