Lines Matching defs:right

224     if (r > GGLint(c->state.scissor.right)) {
225 r = GGLint(c->state.scissor.right);
289 if (r > GGLint(c->state.scissor.right)) {
290 r = GGLint(c->state.scissor.right);
428 if (r > GGLint(c->state.scissor.right))
429 r = GGLint(c->state.scissor.right);
546 const int32_t maxx = min(bmaxx, c->state.scissor.right);
558 // right-exclusive fill rule, to avoid rare cases
605 // unfortunately requires divisions in the setup phase to get right,
720 Edge* right,
729 if ((left->x > right->x) ||
730 ((left->x == right->x) && (left->x_incr > right->x_incr))) {
731 swap(left, right);
735 int right_x = right->x;
737 const int right_xi = right->x_incr;
739 right->x += right_xi * count;
742 const int xmax = c->state.scissor.right;
778 Edge* right = &edges[1];
780 int32_t y_top = min(left->y_top, right->y_top);
781 int32_t y_bot = max(left->y_bot, right->y_bot);
791 right = &edges[2];
797 int32_t y_mid = min(left->y_bot, right->y_bot);
798 triangle_sweep_edges( left, right, y_top, y_mid, c );
803 ((left->y_bot == y_bot) ? right : left) = other;
807 triangle_sweep_edges( left, right, y_mid, y_bot, c );
959 const int xmax = c->state.scissor.right;
977 // sort the edge list top to bottom, left to right.
988 AAEdge* right = &edges[1];
991 GGLfixed r = right->x;
1001 int32_t y = min(min(left->y_bot, right->y_bot), TRI_FLOOR(yt + TRI_ONE));
1012 // compute xmin and xmax for the right edge
1013 GGLfixed r_min = gglMulAddx(right->x_incr, y - right->y_top, right->x, shift);
1074 // all pixels on the right have cf = 1.0
1119 // subtract the coverage of the right edge
1127 // all pixels on the right have cf = 1.0
1130 const int32_t y_incr = right->y_incr;
1151 if (y == left->y_bot || y == right->y_bot) {
1157 if (y == right->y_bot)
1158 right = &edges[i++];