1 /**************************************************************************
3 * Copyright 2007 Tungsten Graphics, Inc., Cedar Park, Texas.
6 * Permission is hereby granted, free of charge, to any person obtaining a
7 * copy of this software and associated documentation files (the
8 * "Software"), to deal in the Software without restriction, including
9 * without limitation the rights to use, copy, modify, merge, publish,
10 * distribute, sub license, and/or sell copies of the Software, and to
11 * permit persons to whom the Software is furnished to do so, subject to
12 * the following conditions:
14 * The above copyright notice and this permission notice (including the
15 * next paragraph) shall be included in all copies or substantial portions
18 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
19 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
20 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
21 * IN NO EVENT SHALL TUNGSTEN GRAPHICS AND/OR ITS SUPPLIERS BE LIABLE FOR
22 * ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
23 * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
24 * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
26 **************************************************************************/
29 * Binning code for lines
32 #include "util/u_math.h"
33 #include "util/u_memory.h"
35 #include "lp_setup_context.h"
37 #include "lp_state_fs.h"
38 #include "lp_state_setup.h"
40 #define NUM_CHANNELS 4
54 * Compute a0 for a constant-valued coefficient (GL_FLAT shading).
56 static void constant_coef( struct lp_setup_context
*setup
,
57 struct lp_rast_triangle
*tri
,
62 tri
->inputs
.a0
[slot
][i
] = value
;
63 tri
->inputs
.dadx
[slot
][i
] = 0.0f
;
64 tri
->inputs
.dady
[slot
][i
] = 0.0f
;
69 * Compute a0, dadx and dady for a linearly interpolated coefficient,
72 static void linear_coef( struct lp_setup_context
*setup
,
73 struct lp_rast_triangle
*tri
,
74 struct lp_line_info
*info
,
79 float a1
= info
->v1
[vert_attr
][i
];
80 float a2
= info
->v2
[vert_attr
][i
];
83 float dadx
= da21
* info
->dx
* info
->oneoverarea
;
84 float dady
= da21
* info
->dy
* info
->oneoverarea
;
86 tri
->inputs
.dadx
[slot
][i
] = dadx
;
87 tri
->inputs
.dady
[slot
][i
] = dady
;
89 tri
->inputs
.a0
[slot
][i
] = (a1
-
90 (dadx
* (info
->v1
[0][0] - setup
->pixel_offset
) +
91 dady
* (info
->v1
[0][1] - setup
->pixel_offset
)));
96 * Compute a0, dadx and dady for a perspective-corrected interpolant,
98 * We basically multiply the vertex value by 1/w before computing
99 * the plane coefficients (a0, dadx, dady).
100 * Later, when we compute the value at a particular fragment position we'll
101 * divide the interpolated value by the interpolated W at that fragment.
103 static void perspective_coef( struct lp_setup_context
*setup
,
104 struct lp_rast_triangle
*tri
,
105 struct lp_line_info
*info
,
110 /* premultiply by 1/w (v[0][3] is always 1/w):
112 float a1
= info
->v1
[vert_attr
][i
] * info
->v1
[0][3];
113 float a2
= info
->v2
[vert_attr
][i
] * info
->v2
[0][3];
115 float da21
= a1
- a2
;
116 float dadx
= da21
* info
->dx
* info
->oneoverarea
;
117 float dady
= da21
* info
->dy
* info
->oneoverarea
;
119 tri
->inputs
.dadx
[slot
][i
] = dadx
;
120 tri
->inputs
.dady
[slot
][i
] = dady
;
122 tri
->inputs
.a0
[slot
][i
] = (a1
-
123 (dadx
* (info
->v1
[0][0] - setup
->pixel_offset
) +
124 dady
* (info
->v1
[0][1] - setup
->pixel_offset
)));
128 setup_fragcoord_coef( struct lp_setup_context
*setup
,
129 struct lp_rast_triangle
*tri
,
130 struct lp_line_info
*info
,
135 if (usage_mask
& TGSI_WRITEMASK_X
) {
136 tri
->inputs
.a0
[slot
][0] = 0.0;
137 tri
->inputs
.dadx
[slot
][0] = 1.0;
138 tri
->inputs
.dady
[slot
][0] = 0.0;
142 if (usage_mask
& TGSI_WRITEMASK_Y
) {
143 tri
->inputs
.a0
[slot
][1] = 0.0;
144 tri
->inputs
.dadx
[slot
][1] = 0.0;
145 tri
->inputs
.dady
[slot
][1] = 1.0;
149 if (usage_mask
& TGSI_WRITEMASK_Z
) {
150 linear_coef(setup
, tri
, info
, slot
, 0, 2);
154 if (usage_mask
& TGSI_WRITEMASK_W
) {
155 linear_coef(setup
, tri
, info
, slot
, 0, 3);
160 * Compute the tri->coef[] array dadx, dady, a0 values.
162 static void setup_line_coefficients( struct lp_setup_context
*setup
,
163 struct lp_rast_triangle
*tri
,
164 struct lp_line_info
*info
)
166 const struct lp_setup_variant_key
*key
= &setup
->setup
.variant
->key
;
167 unsigned fragcoord_usage_mask
= TGSI_WRITEMASK_XYZ
;
170 /* setup interpolation for all the remaining attributes:
172 for (slot
= 0; slot
< key
->num_inputs
; slot
++) {
173 unsigned vert_attr
= key
->inputs
[slot
].src_index
;
174 unsigned usage_mask
= key
->inputs
[slot
].usage_mask
;
177 switch (key
->inputs
[slot
].interp
) {
178 case LP_INTERP_CONSTANT
:
179 if (key
->flatshade_first
) {
180 for (i
= 0; i
< NUM_CHANNELS
; i
++)
181 if (usage_mask
& (1 << i
))
182 constant_coef(setup
, tri
, slot
+1, info
->v1
[vert_attr
][i
], i
);
185 for (i
= 0; i
< NUM_CHANNELS
; i
++)
186 if (usage_mask
& (1 << i
))
187 constant_coef(setup
, tri
, slot
+1, info
->v2
[vert_attr
][i
], i
);
191 case LP_INTERP_LINEAR
:
192 for (i
= 0; i
< NUM_CHANNELS
; i
++)
193 if (usage_mask
& (1 << i
))
194 linear_coef(setup
, tri
, info
, slot
+1, vert_attr
, i
);
197 case LP_INTERP_PERSPECTIVE
:
198 for (i
= 0; i
< NUM_CHANNELS
; i
++)
199 if (usage_mask
& (1 << i
))
200 perspective_coef(setup
, tri
, info
, slot
+1, vert_attr
, i
);
201 fragcoord_usage_mask
|= TGSI_WRITEMASK_W
;
204 case LP_INTERP_POSITION
:
206 * The generated pixel interpolators will pick up the coeffs from
207 * slot 0, so all need to ensure that the usage mask is covers all
210 fragcoord_usage_mask
|= usage_mask
;
218 /* The internal position input is in slot zero:
220 setup_fragcoord_coef(setup
, tri
, info
, 0,
221 fragcoord_usage_mask
);
226 static INLINE
int subpixel_snap( float a
)
228 return util_iround(FIXED_ONE
* a
);
233 * Print line vertex attribs (for debug).
236 print_line(struct lp_setup_context
*setup
,
237 const float (*v1
)[4],
238 const float (*v2
)[4])
240 const struct lp_setup_variant_key
*key
= &setup
->setup
.variant
->key
;
243 debug_printf("llvmpipe line\n");
244 for (i
= 0; i
< 1 + key
->num_inputs
; i
++) {
245 debug_printf(" v1[%d]: %f %f %f %f\n", i
,
246 v1
[i
][0], v1
[i
][1], v1
[i
][2], v1
[i
][3]);
248 for (i
= 0; i
< 1 + key
->num_inputs
; i
++) {
249 debug_printf(" v2[%d]: %f %f %f %f\n", i
,
250 v2
[i
][0], v2
[i
][1], v2
[i
][2], v2
[i
][3]);
255 static INLINE boolean
sign(float x
){
260 /* Used on positive floats only:
262 static INLINE
float fracf(float f
)
264 return f
- floorf(f
);
270 try_setup_line( struct lp_setup_context
*setup
,
271 const float (*v1
)[4],
272 const float (*v2
)[4])
274 struct lp_scene
*scene
= setup
->scene
;
275 const struct lp_setup_variant_key
*key
= &setup
->setup
.variant
->key
;
276 struct lp_rast_triangle
*line
;
277 struct lp_line_info info
;
278 float width
= MAX2(1.0, setup
->line_width
);
286 /* linewidth should be interpreted as integer */
287 int fixed_width
= util_iround(width
) * FIXED_ONE
;
291 float x_offset_end
=0;
292 float y_offset_end
=0;
302 boolean will_draw_start
;
303 boolean will_draw_end
;
306 print_line(setup
, v1
, v2
);
308 if (setup
->scissor_test
) {
316 dx
= v1
[0][0] - v2
[0][0];
317 dy
= v1
[0][1] - v2
[0][1];
320 if (fabsf(dx
) >= fabsf(dy
)) {
321 float dydx
= dy
/ dx
;
323 x1diff
= v1
[0][0] - (float) floor(v1
[0][0]) - 0.5;
324 y1diff
= v1
[0][1] - (float) floor(v1
[0][1]) - 0.5;
325 x2diff
= v2
[0][0] - (float) floor(v2
[0][0]) - 0.5;
326 y2diff
= v2
[0][1] - (float) floor(v2
[0][1]) - 0.5;
328 if (y2diff
==-0.5 && dy
<0){
333 * Diamond exit rule test for starting point
335 if (fabsf(x1diff
) + fabsf(y1diff
) < 0.5) {
338 else if (sign(x1diff
) == sign(-dx
)) {
341 else if (sign(-y1diff
) != sign(dy
)) {
345 /* do intersection test */
346 float yintersect
= fracf(v1
[0][1]) + x1diff
* dydx
;
347 draw_start
= (yintersect
< 1.0 && yintersect
> 0.0);
352 * Diamond exit rule test for ending point
354 if (fabsf(x2diff
) + fabsf(y2diff
) < 0.5) {
357 else if (sign(x2diff
) != sign(-dx
)) {
360 else if (sign(-y2diff
) == sign(dy
)) {
364 /* do intersection test */
365 float yintersect
= fracf(v2
[0][1]) + x2diff
* dydx
;
366 draw_end
= (yintersect
< 1.0 && yintersect
> 0.0);
369 /* Are we already drawing start/end?
371 will_draw_start
= sign(-x1diff
) != sign(dx
);
372 will_draw_end
= (sign(x2diff
) == sign(-dx
)) || x2diff
==0;
375 /* if v2 is to the right of v1, swap pointers */
376 const float (*temp
)[4] = v1
;
381 /* Otherwise shift planes appropriately */
382 if (will_draw_start
!= draw_start
) {
383 x_offset_end
= - x1diff
- 0.5;
384 y_offset_end
= x_offset_end
* dydx
;
387 if (will_draw_end
!= draw_end
) {
388 x_offset
= - x2diff
- 0.5;
389 y_offset
= x_offset
* dydx
;
394 /* Otherwise shift planes appropriately */
395 if (will_draw_start
!= draw_start
) {
396 x_offset
= - x1diff
+ 0.5;
397 y_offset
= x_offset
* dydx
;
399 if (will_draw_end
!= draw_end
) {
400 x_offset_end
= - x2diff
+ 0.5;
401 y_offset_end
= x_offset_end
* dydx
;
405 /* x/y positions in fixed point */
406 x
[0] = subpixel_snap(v1
[0][0] + x_offset
- setup
->pixel_offset
);
407 x
[1] = subpixel_snap(v2
[0][0] + x_offset_end
- setup
->pixel_offset
);
408 x
[2] = subpixel_snap(v2
[0][0] + x_offset_end
- setup
->pixel_offset
);
409 x
[3] = subpixel_snap(v1
[0][0] + x_offset
- setup
->pixel_offset
);
411 y
[0] = subpixel_snap(v1
[0][1] + y_offset
- setup
->pixel_offset
) - fixed_width
/2;
412 y
[1] = subpixel_snap(v2
[0][1] + y_offset_end
- setup
->pixel_offset
) - fixed_width
/2;
413 y
[2] = subpixel_snap(v2
[0][1] + y_offset_end
- setup
->pixel_offset
) + fixed_width
/2;
414 y
[3] = subpixel_snap(v1
[0][1] + y_offset
- setup
->pixel_offset
) + fixed_width
/2;
418 const float dxdy
= dx
/ dy
;
421 x1diff
= v1
[0][0] - (float) floor(v1
[0][0]) - 0.5;
422 y1diff
= v1
[0][1] - (float) floor(v1
[0][1]) - 0.5;
423 x2diff
= v2
[0][0] - (float) floor(v2
[0][0]) - 0.5;
424 y2diff
= v2
[0][1] - (float) floor(v2
[0][1]) - 0.5;
426 if (x2diff
==-0.5 && dx
<0) {
431 * Diamond exit rule test for starting point
433 if (fabsf(x1diff
) + fabsf(y1diff
) < 0.5) {
436 else if (sign(-y1diff
) == sign(dy
)) {
439 else if (sign(x1diff
) != sign(-dx
)) {
443 /* do intersection test */
444 float xintersect
= fracf(v1
[0][0]) + y1diff
* dxdy
;
445 draw_start
= (xintersect
< 1.0 && xintersect
> 0.0);
449 * Diamond exit rule test for ending point
451 if (fabsf(x2diff
) + fabsf(y2diff
) < 0.5) {
454 else if (sign(-y2diff
) != sign(dy
) ) {
457 else if (sign(x2diff
) == sign(-dx
) ) {
461 /* do intersection test */
462 float xintersect
= fracf(v2
[0][0]) + y2diff
* dxdy
;
463 draw_end
= (xintersect
< 1.0 && xintersect
> 0.0);
466 /* Are we already drawing start/end?
468 will_draw_start
= sign(y1diff
) == sign(dy
);
469 will_draw_end
= (sign(-y2diff
) == sign(dy
)) || y2diff
==0;
472 /* if v2 is on top of v1, swap pointers */
473 const float (*temp
)[4] = v1
;
479 /* Otherwise shift planes appropriately */
480 if (will_draw_start
!= draw_start
) {
481 y_offset_end
= - y1diff
+ 0.5;
482 x_offset_end
= y_offset_end
* dxdy
;
484 if (will_draw_end
!= draw_end
) {
485 y_offset
= - y2diff
+ 0.5;
486 x_offset
= y_offset
* dxdy
;
490 /* Otherwise shift planes appropriately */
491 if (will_draw_start
!= draw_start
) {
492 y_offset
= - y1diff
- 0.5;
493 x_offset
= y_offset
* dxdy
;
496 if (will_draw_end
!= draw_end
) {
497 y_offset_end
= - y2diff
- 0.5;
498 x_offset_end
= y_offset_end
* dxdy
;
502 /* x/y positions in fixed point */
503 x
[0] = subpixel_snap(v1
[0][0] + x_offset
- setup
->pixel_offset
) - fixed_width
/2;
504 x
[1] = subpixel_snap(v2
[0][0] + x_offset_end
- setup
->pixel_offset
) - fixed_width
/2;
505 x
[2] = subpixel_snap(v2
[0][0] + x_offset_end
- setup
->pixel_offset
) + fixed_width
/2;
506 x
[3] = subpixel_snap(v1
[0][0] + x_offset
- setup
->pixel_offset
) + fixed_width
/2;
508 y
[0] = subpixel_snap(v1
[0][1] + y_offset
- setup
->pixel_offset
);
509 y
[1] = subpixel_snap(v2
[0][1] + y_offset_end
- setup
->pixel_offset
);
510 y
[2] = subpixel_snap(v2
[0][1] + y_offset_end
- setup
->pixel_offset
);
511 y
[3] = subpixel_snap(v1
[0][1] + y_offset
- setup
->pixel_offset
);
519 /* Bounding rectangle (in pixels) */
521 /* Yes this is necessary to accurately calculate bounding boxes
522 * with the two fill-conventions we support. GL (normally) ends
523 * up needing a bottom-left fill convention, which requires
524 * slightly different rounding.
526 int adj
= (setup
->pixel_offset
!= 0) ? 1 : 0;
528 bbox
.x0
= (MIN4(x
[0], x
[1], x
[2], x
[3]) + (FIXED_ONE
-1)) >> FIXED_ORDER
;
529 bbox
.x1
= (MAX4(x
[0], x
[1], x
[2], x
[3]) + (FIXED_ONE
-1)) >> FIXED_ORDER
;
530 bbox
.y0
= (MIN4(y
[0], y
[1], y
[2], y
[3]) + (FIXED_ONE
-1) + adj
) >> FIXED_ORDER
;
531 bbox
.y1
= (MAX4(y
[0], y
[1], y
[2], y
[3]) + (FIXED_ONE
-1) + adj
) >> FIXED_ORDER
;
533 /* Inclusive coordinates:
539 if (bbox
.x1
< bbox
.x0
||
541 if (0) debug_printf("empty bounding box\n");
542 LP_COUNT(nr_culled_tris
);
546 if (!u_rect_test_intersection(&setup
->draw_region
, &bbox
)) {
547 if (0) debug_printf("offscreen\n");
548 LP_COUNT(nr_culled_tris
);
552 u_rect_find_intersection(&setup
->draw_region
, &bbox
);
554 line
= lp_setup_alloc_triangle(scene
,
562 line
->v
[0][0] = v1
[0][0];
563 line
->v
[1][0] = v2
[0][0];
564 line
->v
[0][1] = v1
[0][1];
565 line
->v
[1][1] = v2
[0][1];
568 /* calculate the deltas */
569 line
->plane
[0].dcdy
= x
[0] - x
[1];
570 line
->plane
[1].dcdy
= x
[1] - x
[2];
571 line
->plane
[2].dcdy
= x
[2] - x
[3];
572 line
->plane
[3].dcdy
= x
[3] - x
[0];
574 line
->plane
[0].dcdx
= y
[0] - y
[1];
575 line
->plane
[1].dcdx
= y
[1] - y
[2];
576 line
->plane
[2].dcdx
= y
[2] - y
[3];
577 line
->plane
[3].dcdx
= y
[3] - y
[0];
580 info
.oneoverarea
= 1.0f
/ (dx
* dx
+ dy
* dy
);
586 /* Setup parameter interpolants:
588 setup_line_coefficients( setup
, line
, &info
);
590 line
->inputs
.facing
= 1.0F
;
591 line
->inputs
.state
= setup
->fs
.stored
;
592 line
->inputs
.disable
= FALSE
;
593 line
->inputs
.opaque
= FALSE
;
595 for (i
= 0; i
< 4; i
++) {
596 struct lp_rast_plane
*plane
= &line
->plane
[i
];
598 /* half-edge constants, will be interated over the whole render
601 plane
->c
= plane
->dcdx
* x
[i
] - plane
->dcdy
* y
[i
];
604 /* correct for top-left vs. bottom-left fill convention.
606 * note that we're overloading gl_rasterization_rules to mean
607 * both (0.5,0.5) pixel centers *and* bottom-left filling
610 * GL actually has a top-left filling convention, but GL's
611 * notion of "top" differs from gallium's...
613 * Also, sometimes (in FBO cases) GL will render upside down
614 * to its usual method, in which case it will probably want
615 * to use the opposite, top-left convention.
617 if (plane
->dcdx
< 0) {
618 /* both fill conventions want this - adjust for left edges */
621 else if (plane
->dcdx
== 0) {
622 if (setup
->pixel_offset
== 0) {
623 /* correct for top-left fill convention:
625 if (plane
->dcdy
> 0) plane
->c
++;
628 /* correct for bottom-left fill convention:
630 if (plane
->dcdy
< 0) plane
->c
++;
634 plane
->dcdx
*= FIXED_ONE
;
635 plane
->dcdy
*= FIXED_ONE
;
637 /* find trivial reject offsets for each edge for a single-pixel
638 * sized block. These will be scaled up at each recursive level to
639 * match the active blocksize. Scaling in this way works best if
640 * the blocks are square.
643 if (plane
->dcdx
< 0) plane
->eo
-= plane
->dcdx
;
644 if (plane
->dcdy
> 0) plane
->eo
+= plane
->dcdy
;
646 /* Calculate trivial accept offsets from the above.
648 plane
->ei
= plane
->dcdy
- plane
->dcdx
- plane
->eo
;
653 * When rasterizing scissored tris, use the intersection of the
654 * triangle bounding box and the scissor rect to generate the
657 * This permits us to cut off the triangle "tails" that are present
658 * in the intermediate recursive levels caused when two of the
659 * triangles edges don't diverge quickly enough to trivially reject
660 * exterior blocks from the triangle.
662 * It's not really clear if it's worth worrying about these tails,
663 * but since we generate the planes for each scissored tri, it's
664 * free to trim them in this case.
666 * Note that otherwise, the scissor planes only vary in 'C' value,
667 * and even then only on state-changes. Could alternatively store
668 * these planes elsewhere.
670 if (nr_planes
== 8) {
671 line
->plane
[4].dcdx
= -1;
672 line
->plane
[4].dcdy
= 0;
673 line
->plane
[4].c
= 1-bbox
.x0
;
674 line
->plane
[4].ei
= 0;
675 line
->plane
[4].eo
= 1;
677 line
->plane
[5].dcdx
= 1;
678 line
->plane
[5].dcdy
= 0;
679 line
->plane
[5].c
= bbox
.x1
+1;
680 line
->plane
[5].ei
= -1;
681 line
->plane
[5].eo
= 0;
683 line
->plane
[6].dcdx
= 0;
684 line
->plane
[6].dcdy
= 1;
685 line
->plane
[6].c
= 1-bbox
.y0
;
686 line
->plane
[6].ei
= 0;
687 line
->plane
[6].eo
= 1;
689 line
->plane
[7].dcdx
= 0;
690 line
->plane
[7].dcdy
= -1;
691 line
->plane
[7].c
= bbox
.y1
+1;
692 line
->plane
[7].ei
= -1;
693 line
->plane
[7].eo
= 0;
696 return lp_setup_bin_triangle(setup
, line
, &bbox
, nr_planes
);
700 static void lp_setup_line( struct lp_setup_context
*setup
,
701 const float (*v0
)[4],
702 const float (*v1
)[4] )
704 if (!try_setup_line( setup
, v0
, v1
))
706 lp_setup_flush_and_restart(setup
);
708 if (!try_setup_line( setup
, v0
, v1
))
714 void lp_setup_choose_line( struct lp_setup_context
*setup
)
716 setup
->line
= lp_setup_line
;