Home | History | Annotate | Download | only in mi

Lines Matching refs:Left

143 	struct bound	left;
159 	struct line	left, right;
219 		    miArcFacePtr left);
221 			miArcFacePtr left, miArcFacePtr right);
251     miArcFacePtr	left)
261     	drawZeroArc (pDraw, pGC, &tarc, l, left, right);
280 	right = left;
281 	left = temp;
302     drawArc (&tarc, l, startAngle, endAngle, right, left);
380 			 miArcFacePtr left, miArcSpanData *spdata);
671 	    if (acc->left.valid && boundedLe(K, bounds->left) &&
774 	if (acc->left.valid && boundedLe(K, bounds->left) &&
1019 	    /* if nothing left, return */
1222 	miArcFaceRec	Right, Left;
1237 	Left = *pLeft;
1238 	translateBounds (&Left, xOrg - xOrgLeft, yOrg - yOrgLeft,
1241 	pLeft = &Left;
1535      * Given our coordinate system (with 0,0 in the upper left corner), 
2105 			 * cap the left end of this arc
2338     miArcFacePtr	left,
2425 	if (left)
2427 	    left->center.x = x1;
2428 	    left->center.y = y1;
2429 	    left->clock.x = x1 + lx;
2430 	    left->clock.y = y1 + ly;
2431 	    left->counterClock.x = x1 - lx;
2432 	    left->counterClock.y = y1 - ly;
2608 	miArcFacePtr		left)
2653 	if (left) {
2654 		left->clock.y = bound->outer.max;
2655 		left->clock.x = outerx.max;
2656 		left->center.y = bound->ellipse.max;
2657 		left->center.x = ellipsex.max;
2658 		left->counterClock.y = bound->inner.max;
2659 		left->counterClock.x = innerx.max;
2662 	bound->left.min = bound->inner.max;
2663 	bound->left.max = bound->outer.max;
2670 		     &acc->left);
2748 	int			left)
2753 		if ( (scan_y > 0 && !left) || (scan_y < 0 && left) )
2775 	int			left)
2781 		ellipse_y = hookEllipseY (scan_y, bound, acc, left);
2789 			if ((left && maxMin > 0) || (!left && maxMin < 0)) {
2791 					return def->w + left ? -def->l : def->l;
2799 	if (left) {
2800 		if (acc->left.valid && boundedLe (scan_y, bound->left)) {
2801 			x = intersectLine (scan_y, acc->left);
2812 			if (acc->left.valid)
2813 				x = intersectLine (scan_y, acc->left);
2846 	     * intersection with left face
2867 	    if (acc->left.valid &&
2868 		boundedLe (y + acc->fromIntY, bounds->left))
2871 		x = intersectLine (y + acc->fromIntY, acc->left);
2910 	acc->left.valid && boundedLe (0, bounds->left) &&
2911 	acc->left.b > 0)
2914 	if (acc->left.b < x)
2915 	    x = acc->left.b;
3246 	miArcFacePtr	left)	/* save end line points */
3369 		 * find left-most point
3428 				passLeft = left;
3433 				passRight = left;
3443 	 * so the left end will be the only one holding the data.  Copy
3447 		*right = *left;
3464 	if (left) {
3465 		mirrorSppPoint (leftq,  &left->counterClock);
3466 		mirrorSppPoint (leftq,  &left->center);
3467 		mirrorSppPoint (leftq,  &left->clock);
3471 			temp = left->clock;
3472 			left->clock = left->counterClock;
3473 			left->counterClock = temp;
3487 	miArcFacePtr		left,
3498 	computeBound (def, &bound, acc, right, left);
3569 		if (acc->left.valid && boundedLe (yy, bound.left)) {
3570 		    xalt = intersectLine (yy, acc->left);