Lines Matching refs:bound
118 struct bound {
141 struct bound ellipse;
142 struct bound inner;
143 struct bound outer;
144 struct bound right;
145 struct bound left;
2659 struct arc_bound *bound,
2665 struct bound innerx, outerx;
2666 struct bound ellipsex;
2668 bound->ellipse.min = Dsin(def->a0) * def->h;
2669 bound->ellipse.max = Dsin(def->a1) * def->h;
2671 ellipsex.min = bound->ellipse.min;
2675 ellipsex.max = bound->ellipse.max;
2678 bound->outer.min = outerYfromXY(ellipsex.min, bound->ellipse.min, def, acc);
2679 bound->outer.max = outerYfromXY(ellipsex.max, bound->ellipse.max, def, acc);
2680 bound->inner.min = innerYfromXY(ellipsex.min, bound->ellipse.min, def, acc);
2681 bound->inner.max = innerYfromXY(ellipsex.max, bound->ellipse.max, def, acc);
2683 outerx.min = outerXfromXY(ellipsex.min, bound->ellipse.min, def, acc);
2684 outerx.max = outerXfromXY(ellipsex.max, bound->ellipse.max, def, acc);
2685 innerx.min = innerXfromXY(ellipsex.min, bound->ellipse.min, def, acc);
2686 innerx.max = innerXfromXY(ellipsex.max, bound->ellipse.max, def, acc);
2697 right->counterClock.y = bound->outer.min;
2699 right->center.y = bound->ellipse.min;
2701 right->clock.y = bound->inner.min;
2706 left->clock.y = bound->outer.max;
2708 left->center.y = bound->ellipse.max;
2710 left->counterClock.y = bound->inner.max;
2714 bound->left.min = bound->inner.max;
2715 bound->left.max = bound->outer.max;
2716 bound->right.min = bound->inner.min;
2717 bound->right.max = bound->outer.min;
2719 computeLine(innerx.min, bound->inner.min, outerx.min, bound->outer.min,
2721 computeLine(innerx.max, bound->inner.max, outerx.max, bound->outer.max,
2724 if (bound->inner.min > bound->inner.max) {
2725 t = bound->inner.min;
2726 bound->inner.min = bound->inner.max;
2727 bound->inner.max = t;
2730 if (tail_y > bound->ellipse.max)
2731 tail_y = bound->ellipse.max;
2732 else if (tail_y < bound->ellipse.min)
2733 tail_y = bound->ellipse.min;
2735 if (bound->inner.min > innerTaily)
2736 bound->inner.min = innerTaily;
2737 if (bound->inner.max < innerTaily)
2738 bound->inner.max = innerTaily;
2739 bound->inneri.min = ICEIL(bound->inner.min - acc->fromIntY);
2740 bound->inneri.max = floor(bound->inner.max - acc->fromIntY);
2741 bound->outeri.min = ICEIL(bound->outer.min - acc->fromIntY);
2742 bound->outeri.max = floor(bound->outer.max - acc->fromIntY);
2797 struct arc_bound *bound, struct accelerators *acc, int left)
2803 return bound->ellipse.min;
2804 return bound->ellipse.max;
2821 struct arc_bound *bound, struct accelerators *acc, int left)
2827 ellipse_y = hookEllipseY(scan_y, bound, acc, left);
2828 if (boundedLe(ellipse_y, bound->ellipse)) {
2846 if (acc->left.valid && boundedLe(scan_y, bound->left)) {
2857 if (acc->right.valid && boundedLe(scan_y, bound->right)) {
3502 struct arc_bound bound;
3510 computeBound(def, &bound, acc, right, left);
3511 yy = bound.inner.min;
3512 if (bound.outer.min < yy)
3513 yy = bound.outer.min;
3515 yy = bound.inner.max;
3516 if (bound.outer.max > yy)
3517 yy = bound.outer.max;
3532 def, &bound, acc, mask);
3534 tailSpan(y, -span->rw, -span->rx, def, &bound, acc, mask);
3543 arcSpan(y, 0, 0, 0, 1, def, &bound, acc, mask & 0xc);
3550 def, &bound, acc, mask);
3560 def, &bound, acc, n);
3562 tailSpan(y, -span->rw, -span->rx, def, &bound, acc, n);
3566 def, &bound, acc, n);
3576 x = tailX(yy, def, &bound, acc);
3577 if (acc->left.valid && boundedLe(yy, bound.left)) {
3582 if (acc->right.valid && boundedLe(yy, bound.right)) {
3590 ICEIL(acc->fromIntX + x), 0, def, &bound, acc, mask);