Lines Matching defs:left

216     if (l < GGLint(c->state.scissor.left)) {
217 xstart += TRI_FROM_INT(c->state.scissor.left-l);
218 l = GGLint(c->state.scissor.left);
281 if (l < GGLint(c->state.scissor.left)) {
282 xstart += TRI_FROM_INT(c->state.scissor.left-l);
283 l = GGLint(c->state.scissor.left);
424 if (l < GGLint(c->state.scissor.left))
425 l = GGLint(c->state.scissor.left);
544 const int32_t minx = max(bminx, c->state.scissor.left);
719 triangle_sweep_edges( Edge* left,
729 if ((left->x > right->x) ||
730 ((left->x == right->x) && (left->x_incr > right->x_incr))) {
731 swap(left, right);
734 int left_x = left->x;
736 const int left_xi = left->x_incr;
738 left->x += left_xi * count;
741 const int xmin = c->state.scissor.left;
777 Edge* left = &edges[0];
780 int32_t y_top = min(left->y_top, right->y_top);
781 int32_t y_bot = max(left->y_bot, right->y_bot);
788 left = &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 );
958 const int xmin = c->state.scissor.left;
977 // sort the edge list top to bottom, left to right.
987 AAEdge* left = &edges[0];
989 int32_t yt = left->y_top;
990 GGLfixed l = left->x;
1001 int32_t y = min(min(left->y_bot, right->y_bot), TRI_FLOOR(yt + TRI_ONE));
1005 // compute xmin and xmax for the left edge
1006 GGLfixed l_min = gglMulAddx(left->x_incr, y - left->y_top, left->x, shift);
1088 const int32_t y_incr = left->y_incr;
1151 if (y == left->y_bot || y == right->y_bot) {
1155 if (y == left->y_bot)
1156 left = &edges[i++];