Lines Matching refs:Left
145 struct bound left;
161 struct line left, right;
231 miArcFacePtr right, miArcFacePtr left,
234 miArcFacePtr left, miArcFacePtr right);
260 miArcFacePtr left, miArcSpanData *spdata)
270 drawZeroArc(pDraw, pGC, &tarc, l, left, right);
289 right = left;
290 left = temp;
312 return drawArc(&tarc, l, startAngle, endAngle, right, left, spdata);
380 miArcFacePtr left, miArcSpanData * spdata);
640 if (acc->left.valid && boundedLe(K, bounds->left) &&
737 if (acc->left.valid && boundedLe(K, bounds->left) &&
965 /* if nothing left, return */
1154 * y to largest by partitioning the array into a left
1172 double xl = 0.0, xr = 0.0, /* x vals of left and right edges */
1173 ml = 0.0, /* left edge slope */
1182 int left, right, /* indices to first endpoints */
1217 /* add a left edge if we need to */
1222 left = nextleft++;
1229 dy = ptsIn[nextleft].y - ptsIn[left].y;
1231 ml = (ptsIn[nextleft].x - ptsIn[left].x) / dy;
1232 dy = y - (ptsIn[left].y + yFtrans);
1233 xl = (ptsIn[left].x + xFtrans) + ml * max(dy, 0);
1259 * a right edge as well as a left edge.
1353 miArcFaceRec Right, Left;
1368 Left = *pLeft;
1369 translateBounds(&Left, xOrg - xOrgLeft, yOrg - yOrgLeft,
1372 pLeft = &Left;
1661 * Given our coordinate system (with 0,0 in the upper left corner),
2208 * cap the left end of this arc
2430 xArc * tarc, int lw, miArcFacePtr left, miArcFacePtr right)
2509 if (left) {
2510 left->center.x = x1;
2511 left->center.y = y1;
2512 left->clock.x = x1 + lx;
2513 left->clock.y = y1 + ly;
2514 left->counterClock.x = x1 - lx;
2515 left->counterClock.y = y1 - ly;
2660 struct accelerators *acc, miArcFacePtr right, miArcFacePtr left)
2705 if (left) {
2706 left->clock.y = bound->outer.max;
2707 left->clock.x = outerx.max;
2708 left->center.y = bound->ellipse.max;
2709 left->center.x = ellipsex.max;
2710 left->counterClock.y = bound->inner.max;
2711 left->counterClock.x = innerx.max;
2714 bound->left.min = bound->inner.max;
2715 bound->left.max = bound->outer.max;
2722 &acc->left);
2797 struct arc_bound *bound, struct accelerators *acc, int left)
2802 if ((scan_y > 0 && !left) || (scan_y < 0 && left))
2821 struct arc_bound *bound, struct accelerators *acc, int left)
2827 ellipse_y = hookEllipseY(scan_y, bound, acc, left);
2835 if ((left && maxMin > 0) || (!left && maxMin < 0)) {
2837 return def->w + left ? -def->l : def->l;
2845 if (left) {
2846 if (acc->left.valid && boundedLe(scan_y, bound->left)) {
2847 x = intersectLine(scan_y, acc->left);
2861 if (acc->left.valid)
2862 x = intersectLine(scan_y, acc->left);
2893 * intersection with left face
2913 if (acc->left.valid && boundedLe(y + acc->fromIntY, bounds->left)) {
2915 x = intersectLine(y + acc->fromIntY, acc->left);
2947 acc->left.valid && boundedLe(0, bounds->left) && acc->left.b > 0) {
2949 if (acc->left.b < x)
2950 x = acc->left.b;
3261 miArcFacePtr left, miArcSpanData *spdata)
3384 * find left-most point
3443 passLeft = left;
3448 passRight = left;
3458 * so the left end will be the only one holding the data. Copy
3462 *right = *left;
3479 if (left) {
3480 mirrorSppPoint(leftq, &left->counterClock);
3481 mirrorSppPoint(leftq, &left->center);
3482 mirrorSppPoint(leftq, &left->clock);
3486 temp = left->clock;
3487 left->clock = left->counterClock;
3488 left->counterClock = temp;
3500 miArcFacePtr right, miArcFacePtr left, miArcSpanData * spdata)
3510 computeBound(def, &bound, acc, right, left);
3577 if (acc->left.valid && boundedLe(yy, bound.left)) {
3578 xalt = intersectLine(yy, acc->left);