Searched refs:nextleft (Results 1 - 4 of 4) sorted by relevance
| /xsrc/external/mit/xorg-server.old/dist/mi/ |
| H A D | mifpolycon.c | 103 nextleft, local in function:miFillSppPoly 133 nextleft = nextright = imin; 135 y = ICEIL(ptsIn[nextleft].y + yFtrans); 143 if ((y > (ptsIn[nextleft].y + yFtrans) || 144 ISEQUAL(y, ptsIn[nextleft].y + yFtrans)) && 145 Marked[nextleft] != 1) 147 Marked[nextleft]++; 148 left = nextleft++; 151 if (nextleft >= count) 152 nextleft [all...] |
| H A D | mipolycon.c | 92 int nextleft, nextright; /* indices to second endpoints */ local in function:miFillConvexPoly 117 nextleft = nextright = imin; 118 y = ptsIn[nextleft].y; 127 if (ptsIn[nextleft].y == y) { 128 left = nextleft; 134 nextleft++; 135 if (nextleft >= count) 136 nextleft = 0; 142 BRESINITPGON(ptsIn[nextleft].y-ptsIn[left].y, 143 ptsIn[left].x,ptsIn[nextleft] [all...] |
| /xsrc/external/mit/xorg-server/dist/mi/ |
| H A D | mipoly.c | 399 int nextleft, nextright; /* indices to second endpoints */ local in function:miFillConvexPoly 423 nextleft = nextright = imin; 424 y = ptsIn[nextleft].y; 433 if (ptsIn[nextleft].y == y) { 434 left = nextleft; 440 nextleft++; 441 if (nextleft >= count) 442 nextleft = 0; 448 BRESINITPGON(ptsIn[nextleft].y - ptsIn[left].y, 449 ptsIn[left].x, ptsIn[nextleft] [all...] |
| H A D | miarc.c | 1183 nextleft, nextright; /* indices to second endpoints */ local in function:miFillSppPoly 1209 nextleft = nextright = imin; 1211 y = ICEIL(ptsIn[nextleft].y + yFtrans); 1218 if ((y > (ptsIn[nextleft].y + yFtrans) || 1219 ISEQUAL(y, ptsIn[nextleft].y + yFtrans)) && 1220 Marked[nextleft] != 1) { 1221 Marked[nextleft]++; 1222 left = nextleft++; 1225 if (nextleft >= count) 1226 nextleft [all...] |
Completed in 7 milliseconds