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 triangles
32 #include "util/u_math.h"
33 #include "util/u_memory.h"
35 #include "lp_setup_context.h"
38 #define NUM_CHANNELS 4
42 * Compute a0 for a constant-valued coefficient (GL_FLAT shading).
44 static void constant_coef( struct lp_setup_context
*setup
,
45 struct lp_rast_triangle
*tri
,
50 tri
->inputs
.a0
[slot
][i
] = value
;
51 tri
->inputs
.dadx
[slot
][i
] = 0.0f
;
52 tri
->inputs
.dady
[slot
][i
] = 0.0f
;
57 * Compute a0, dadx and dady for a linearly interpolated coefficient,
60 static void linear_coef( struct lp_setup_context
*setup
,
61 struct lp_rast_triangle
*tri
,
70 float a1
= v1
[vert_attr
][i
];
71 float a2
= v2
[vert_attr
][i
];
72 float a3
= v3
[vert_attr
][i
];
76 float dadx
= (da12
* tri
->dy31
- tri
->dy12
* da31
) * oneoverarea
;
77 float dady
= (da31
* tri
->dx12
- tri
->dx31
* da12
) * oneoverarea
;
79 tri
->inputs
.dadx
[slot
][i
] = dadx
;
80 tri
->inputs
.dady
[slot
][i
] = dady
;
82 /* calculate a0 as the value which would be sampled for the
83 * fragment at (0,0), taking into account that we want to sample at
84 * pixel centers, in other words (0.5, 0.5).
86 * this is neat but unfortunately not a good way to do things for
87 * triangles with very large values of dadx or dady as it will
88 * result in the subtraction and re-addition from a0 of a very
89 * large number, which means we'll end up loosing a lot of the
90 * fractional bits and precision from a0. the way to fix this is
91 * to define a0 as the sample at a pixel center somewhere near vmin
92 * instead - i'll switch to this later.
94 tri
->inputs
.a0
[slot
][i
] = (a1
-
95 (dadx
* (v1
[0][0] - setup
->pixel_offset
) +
96 dady
* (v1
[0][1] - setup
->pixel_offset
)));
101 * Compute a0, dadx and dady for a perspective-corrected interpolant,
103 * We basically multiply the vertex value by 1/w before computing
104 * the plane coefficients (a0, dadx, dady).
105 * Later, when we compute the value at a particular fragment position we'll
106 * divide the interpolated value by the interpolated W at that fragment.
108 static void perspective_coef( struct lp_setup_context
*setup
,
109 struct lp_rast_triangle
*tri
,
112 const float (*v1
)[4],
113 const float (*v2
)[4],
114 const float (*v3
)[4],
118 /* premultiply by 1/w (v[0][3] is always 1/w):
120 float a1
= v1
[vert_attr
][i
] * v1
[0][3];
121 float a2
= v2
[vert_attr
][i
] * v2
[0][3];
122 float a3
= v3
[vert_attr
][i
] * v3
[0][3];
123 float da12
= a1
- a2
;
124 float da31
= a3
- a1
;
125 float dadx
= (da12
* tri
->dy31
- tri
->dy12
* da31
) * oneoverarea
;
126 float dady
= (da31
* tri
->dx12
- tri
->dx31
* da12
) * oneoverarea
;
128 tri
->inputs
.dadx
[slot
][i
] = dadx
;
129 tri
->inputs
.dady
[slot
][i
] = dady
;
130 tri
->inputs
.a0
[slot
][i
] = (a1
-
131 (dadx
* (v1
[0][0] - setup
->pixel_offset
) +
132 dady
* (v1
[0][1] - setup
->pixel_offset
)));
137 * Special coefficient setup for gl_FragCoord.
138 * X and Y are trivial
139 * Z and W are copied from position_coef which should have already been computed.
140 * We could do a bit less work if we'd examine gl_FragCoord's swizzle mask.
143 setup_fragcoord_coef(struct lp_setup_context
*setup
,
144 struct lp_rast_triangle
*tri
,
147 const float (*v1
)[4],
148 const float (*v2
)[4],
149 const float (*v3
)[4])
152 tri
->inputs
.a0
[slot
][0] = 0.0;
153 tri
->inputs
.dadx
[slot
][0] = 1.0;
154 tri
->inputs
.dady
[slot
][0] = 0.0;
156 tri
->inputs
.a0
[slot
][1] = 0.0;
157 tri
->inputs
.dadx
[slot
][1] = 0.0;
158 tri
->inputs
.dady
[slot
][1] = 1.0;
160 linear_coef(setup
, tri
, oneoverarea
, slot
, v1
, v2
, v3
, 0, 2);
162 linear_coef(setup
, tri
, oneoverarea
, slot
, v1
, v2
, v3
, 0, 3);
167 * Setup the fragment input attribute with the front-facing value.
168 * \param frontface is the triangle front facing?
170 static void setup_facing_coef( struct lp_setup_context
*setup
,
171 struct lp_rast_triangle
*tri
,
175 /* convert TRUE to 1.0 and FALSE to -1.0 */
176 constant_coef( setup
, tri
, slot
, 2.0f
* frontface
- 1.0f
, 0 );
177 constant_coef( setup
, tri
, slot
, 0.0f
, 1 ); /* wasted */
178 constant_coef( setup
, tri
, slot
, 0.0f
, 2 ); /* wasted */
179 constant_coef( setup
, tri
, slot
, 0.0f
, 3 ); /* wasted */
184 * Compute the tri->coef[] array dadx, dady, a0 values.
186 static void setup_tri_coefficients( struct lp_setup_context
*setup
,
187 struct lp_rast_triangle
*tri
,
189 const float (*v1
)[4],
190 const float (*v2
)[4],
191 const float (*v3
)[4],
196 /* The internal position input is in slot zero:
198 setup_fragcoord_coef(setup
, tri
, oneoverarea
, 0, v1
, v2
, v3
);
200 /* setup interpolation for all the remaining attributes:
202 for (slot
= 0; slot
< setup
->fs
.nr_inputs
; slot
++) {
203 unsigned vert_attr
= setup
->fs
.input
[slot
].src_index
;
206 switch (setup
->fs
.input
[slot
].interp
) {
207 case LP_INTERP_CONSTANT
:
208 if (setup
->flatshade_first
) {
209 for (i
= 0; i
< NUM_CHANNELS
; i
++)
210 constant_coef(setup
, tri
, slot
+1, v1
[vert_attr
][i
], i
);
213 for (i
= 0; i
< NUM_CHANNELS
; i
++)
214 constant_coef(setup
, tri
, slot
+1, v3
[vert_attr
][i
], i
);
218 case LP_INTERP_LINEAR
:
219 for (i
= 0; i
< NUM_CHANNELS
; i
++)
220 linear_coef(setup
, tri
, oneoverarea
, slot
+1, v1
, v2
, v3
, vert_attr
, i
);
223 case LP_INTERP_PERSPECTIVE
:
224 for (i
= 0; i
< NUM_CHANNELS
; i
++)
225 perspective_coef(setup
, tri
, oneoverarea
, slot
+1, v1
, v2
, v3
, vert_attr
, i
);
228 case LP_INTERP_POSITION
:
229 /* XXX: fix me - duplicates the values in slot zero.
231 setup_fragcoord_coef(setup
, tri
, oneoverarea
, slot
+1, v1
, v2
, v3
);
234 case LP_INTERP_FACING
:
235 setup_facing_coef(setup
, tri
, slot
+1, frontface
);
246 static INLINE
int subpixel_snap( float a
)
248 return util_iround(FIXED_ONE
* a
- (FIXED_ONE
/ 2));
254 * Alloc space for a new triangle plus the input.a0/dadx/dady arrays
255 * immediately after it.
256 * The memory is allocated from the per-scene pool, not per-tile.
257 * \param tri_size returns number of bytes allocated
258 * \param nr_inputs number of fragment shader inputs
259 * \return pointer to triangle space
261 static INLINE
struct lp_rast_triangle
*
262 alloc_triangle(struct lp_scene
*scene
, unsigned nr_inputs
, unsigned *tri_size
)
264 unsigned input_array_sz
= NUM_CHANNELS
* (nr_inputs
+ 1) * sizeof(float);
265 struct lp_rast_triangle
*tri
;
269 assert(sizeof(*tri
) % 16 == 0);
271 bytes
= sizeof(*tri
) + (3 * input_array_sz
);
273 tri
= lp_scene_alloc_aligned( scene
, bytes
, 16 );
275 inputs
= (char *) (tri
+ 1);
276 tri
->inputs
.a0
= (float (*)[4]) inputs
;
277 tri
->inputs
.dadx
= (float (*)[4]) (inputs
+ input_array_sz
);
278 tri
->inputs
.dady
= (float (*)[4]) (inputs
+ 2 * input_array_sz
);
287 * Print triangle vertex attribs (for debug).
290 print_triangle(struct lp_setup_context
*setup
,
291 const float (*v1
)[4],
292 const float (*v2
)[4],
293 const float (*v3
)[4])
297 debug_printf("llvmpipe triangle\n");
298 for (i
= 0; i
< setup
->fs
.nr_inputs
; i
++) {
299 debug_printf(" v1[%d]: %f %f %f %f\n", i
,
300 v1
[i
][0], v1
[i
][1], v1
[i
][2], v1
[i
][3]);
302 for (i
= 0; i
< setup
->fs
.nr_inputs
; i
++) {
303 debug_printf(" v2[%d]: %f %f %f %f\n", i
,
304 v2
[i
][0], v2
[i
][1], v2
[i
][2], v2
[i
][3]);
306 for (i
= 0; i
< setup
->fs
.nr_inputs
; i
++) {
307 debug_printf(" v3[%d]: %f %f %f %f\n", i
,
308 v3
[i
][0], v3
[i
][1], v3
[i
][2], v3
[i
][3]);
314 * Do basic setup for triangle rasterization and determine which
315 * framebuffer tiles are touched. Put the triangle in the scene's
316 * bins for the tiles which we overlap.
319 do_triangle_ccw(struct lp_setup_context
*setup
,
320 const float (*v1
)[4],
321 const float (*v2
)[4],
322 const float (*v3
)[4],
323 boolean frontfacing
)
325 /* x/y positions in fixed point */
326 const int x1
= subpixel_snap(v1
[0][0] + 0.5 - setup
->pixel_offset
);
327 const int x2
= subpixel_snap(v2
[0][0] + 0.5 - setup
->pixel_offset
);
328 const int x3
= subpixel_snap(v3
[0][0] + 0.5 - setup
->pixel_offset
);
329 const int y1
= subpixel_snap(v1
[0][1] + 0.5 - setup
->pixel_offset
);
330 const int y2
= subpixel_snap(v2
[0][1] + 0.5 - setup
->pixel_offset
);
331 const int y3
= subpixel_snap(v3
[0][1] + 0.5 - setup
->pixel_offset
);
333 struct lp_scene
*scene
= lp_setup_get_current_scene(setup
);
334 struct lp_rast_triangle
*tri
;
337 int minx
, maxx
, miny
, maxy
;
341 print_triangle(setup
, v1
, v2
, v3
);
343 tri
= alloc_triangle(scene
, setup
->fs
.nr_inputs
, &tri_bytes
);
346 tri
->v
[0][0] = v1
[0][0];
347 tri
->v
[1][0] = v2
[0][0];
348 tri
->v
[2][0] = v3
[0][0];
349 tri
->v
[0][1] = v1
[0][1];
350 tri
->v
[1][1] = v2
[0][1];
351 tri
->v
[2][1] = v3
[0][1];
362 area
= (tri
->dx12
* tri
->dy31
- tri
->dx31
* tri
->dy12
);
366 /* Cull non-ccw and zero-sized triangles.
368 * XXX: subject to overflow??
371 lp_scene_putback_data( scene
, tri_bytes
);
372 LP_COUNT(nr_culled_tris
);
376 /* Bounding rectangle (in pixels) */
377 minx
= (MIN3(x1
, x2
, x3
) + (FIXED_ONE
-1)) >> FIXED_ORDER
;
378 maxx
= (MAX3(x1
, x2
, x3
) + (FIXED_ONE
-1)) >> FIXED_ORDER
;
379 miny
= (MIN3(y1
, y2
, y3
) + (FIXED_ONE
-1)) >> FIXED_ORDER
;
380 maxy
= (MAX3(y1
, y2
, y3
) + (FIXED_ONE
-1)) >> FIXED_ORDER
;
382 if (setup
->scissor_test
) {
383 minx
= MAX2(minx
, setup
->scissor
.current
.minx
);
384 maxx
= MIN2(maxx
, setup
->scissor
.current
.maxx
);
385 miny
= MAX2(miny
, setup
->scissor
.current
.miny
);
386 maxy
= MIN2(maxy
, setup
->scissor
.current
.maxy
);
391 lp_scene_putback_data( scene
, tri_bytes
);
392 LP_COUNT(nr_culled_tris
);
398 oneoverarea
= ((float)FIXED_ONE
) / (float)area
;
400 /* Setup parameter interpolants:
402 setup_tri_coefficients( setup
, tri
, oneoverarea
, v1
, v2
, v3
, frontfacing
);
404 tri
->inputs
.facing
= frontfacing
? 1.0F
: -1.0F
;
406 /* half-edge constants, will be interated over the whole render target.
408 tri
->c1
= tri
->dy12
* x1
- tri
->dx12
* y1
;
409 tri
->c2
= tri
->dy23
* x2
- tri
->dx23
* y2
;
410 tri
->c3
= tri
->dy31
* x3
- tri
->dx31
* y3
;
412 /* correct for top-left fill convention:
414 if (tri
->dy12
< 0 || (tri
->dy12
== 0 && tri
->dx12
> 0)) tri
->c1
++;
415 if (tri
->dy23
< 0 || (tri
->dy23
== 0 && tri
->dx23
> 0)) tri
->c2
++;
416 if (tri
->dy31
< 0 || (tri
->dy31
== 0 && tri
->dx31
> 0)) tri
->c3
++;
418 tri
->dy12
*= FIXED_ONE
;
419 tri
->dy23
*= FIXED_ONE
;
420 tri
->dy31
*= FIXED_ONE
;
422 tri
->dx12
*= FIXED_ONE
;
423 tri
->dx23
*= FIXED_ONE
;
424 tri
->dx31
*= FIXED_ONE
;
426 /* find trivial reject offsets for each edge for a single-pixel
427 * sized block. These will be scaled up at each recursive level to
428 * match the active blocksize. Scaling in this way works best if
429 * the blocks are square.
432 if (tri
->dy12
< 0) tri
->eo1
-= tri
->dy12
;
433 if (tri
->dx12
> 0) tri
->eo1
+= tri
->dx12
;
436 if (tri
->dy23
< 0) tri
->eo2
-= tri
->dy23
;
437 if (tri
->dx23
> 0) tri
->eo2
+= tri
->dx23
;
440 if (tri
->dy31
< 0) tri
->eo3
-= tri
->dy31
;
441 if (tri
->dx31
> 0) tri
->eo3
+= tri
->dx31
;
443 /* Calculate trivial accept offsets from the above.
445 tri
->ei1
= tri
->dx12
- tri
->dy12
- tri
->eo1
;
446 tri
->ei2
= tri
->dx23
- tri
->dy23
- tri
->eo2
;
447 tri
->ei3
= tri
->dx31
- tri
->dy31
- tri
->eo3
;
449 /* Fill in the inputs.step[][] arrays.
450 * We've manually unrolled some loops here.
453 const int xstep1
= -tri
->dy12
;
454 const int xstep2
= -tri
->dy23
;
455 const int xstep3
= -tri
->dy31
;
456 const int ystep1
= tri
->dx12
;
457 const int ystep2
= tri
->dx23
;
458 const int ystep3
= tri
->dx31
;
460 #define SETUP_STEP(i, x, y) \
462 tri->inputs.step[0][i] = x * xstep1 + y * ystep1; \
463 tri->inputs.step[1][i] = x * xstep2 + y * ystep2; \
464 tri->inputs.step[2][i] = x * xstep3 + y * ystep3; \
479 SETUP_STEP(10, 0, 3);
480 SETUP_STEP(11, 1, 3);
482 SETUP_STEP(12, 2, 2);
483 SETUP_STEP(13, 3, 2);
484 SETUP_STEP(14, 2, 3);
485 SETUP_STEP(15, 3, 3);
490 * All fields of 'tri' are now set. The remaining code here is
491 * concerned with binning.
494 /* Convert to tile coordinates:
496 minx
= minx
/ TILE_SIZE
;
497 miny
= miny
/ TILE_SIZE
;
498 maxx
= maxx
/ TILE_SIZE
;
499 maxy
= maxy
/ TILE_SIZE
;
502 * Clamp to framebuffer size
504 minx
= MAX2(minx
, 0);
505 miny
= MAX2(miny
, 0);
506 maxx
= MIN2(maxx
, scene
->tiles_x
- 1);
507 maxy
= MIN2(maxy
, scene
->tiles_y
- 1);
509 /* Determine which tile(s) intersect the triangle's bounding box
511 if (miny
== maxy
&& minx
== maxx
)
513 /* Triangle is contained in a single tile:
515 lp_scene_bin_command( scene
, minx
, miny
, lp_rast_triangle
,
516 lp_rast_arg_triangle(tri
) );
521 tri
->dx12
* miny
* TILE_SIZE
-
522 tri
->dy12
* minx
* TILE_SIZE
);
524 tri
->dx23
* miny
* TILE_SIZE
-
525 tri
->dy23
* minx
* TILE_SIZE
);
527 tri
->dx31
* miny
* TILE_SIZE
-
528 tri
->dy31
* minx
* TILE_SIZE
);
530 int ei1
= tri
->ei1
<< TILE_ORDER
;
531 int ei2
= tri
->ei2
<< TILE_ORDER
;
532 int ei3
= tri
->ei3
<< TILE_ORDER
;
534 int eo1
= tri
->eo1
<< TILE_ORDER
;
535 int eo2
= tri
->eo2
<< TILE_ORDER
;
536 int eo3
= tri
->eo3
<< TILE_ORDER
;
538 int xstep1
= -(tri
->dy12
<< TILE_ORDER
);
539 int xstep2
= -(tri
->dy23
<< TILE_ORDER
);
540 int xstep3
= -(tri
->dy31
<< TILE_ORDER
);
542 int ystep1
= tri
->dx12
<< TILE_ORDER
;
543 int ystep2
= tri
->dx23
<< TILE_ORDER
;
544 int ystep3
= tri
->dx31
<< TILE_ORDER
;
548 /* Test tile-sized blocks against the triangle.
549 * Discard blocks fully outside the tri. If the block is fully
550 * contained inside the tri, bin an lp_rast_shade_tile command.
551 * Else, bin a lp_rast_triangle command.
553 for (y
= miny
; y
<= maxy
; y
++)
558 boolean in
= FALSE
; /* are we inside the triangle? */
560 for (x
= minx
; x
<= maxx
; x
++)
567 LP_COUNT(nr_empty_64
);
569 break; /* exiting triangle, all done with this row */
571 else if (cx1
+ ei1
> 0 &&
575 /* triangle covers the whole tile- shade whole tile */
576 LP_COUNT(nr_fully_covered_64
);
578 if(setup
->fs
.current
.opaque
) {
579 lp_scene_bin_reset( scene
, x
, y
);
580 lp_scene_bin_command( scene
, x
, y
,
582 lp_rast_arg_state(setup
->fs
.stored
) );
584 lp_scene_bin_command( scene
, x
, y
,
586 lp_rast_arg_inputs(&tri
->inputs
) );
590 /* rasterizer/shade partial tile */
591 LP_COUNT(nr_partially_covered_64
);
593 lp_scene_bin_command( scene
, x
, y
,
595 lp_rast_arg_triangle(tri
) );
598 /* Iterate cx values across the region:
605 /* Iterate c values down the region:
616 * Draw triangle if it's CW, cull otherwise.
618 static void triangle_cw( struct lp_setup_context
*setup
,
619 const float (*v0
)[4],
620 const float (*v1
)[4],
621 const float (*v2
)[4] )
623 do_triangle_ccw( setup
, v1
, v0
, v2
, !setup
->ccw_is_frontface
);
628 * Draw triangle if it's CCW, cull otherwise.
630 static void triangle_ccw( struct lp_setup_context
*setup
,
631 const float (*v0
)[4],
632 const float (*v1
)[4],
633 const float (*v2
)[4] )
635 do_triangle_ccw( setup
, v0
, v1
, v2
, setup
->ccw_is_frontface
);
641 * Draw triangle whether it's CW or CCW.
643 static void triangle_both( struct lp_setup_context
*setup
,
644 const float (*v0
)[4],
645 const float (*v1
)[4],
646 const float (*v2
)[4] )
648 /* edge vectors e = v0 - v2, f = v1 - v2 */
649 const float ex
= v0
[0][0] - v2
[0][0];
650 const float ey
= v0
[0][1] - v2
[0][1];
651 const float fx
= v1
[0][0] - v2
[0][0];
652 const float fy
= v1
[0][1] - v2
[0][1];
654 /* det = cross(e,f).z */
655 if (ex
* fy
- ey
* fx
< 0.0f
)
656 triangle_ccw( setup
, v0
, v1
, v2
);
658 triangle_cw( setup
, v0
, v1
, v2
);
662 static void triangle_nop( struct lp_setup_context
*setup
,
663 const float (*v0
)[4],
664 const float (*v1
)[4],
665 const float (*v2
)[4] )
671 lp_setup_choose_triangle( struct lp_setup_context
*setup
)
673 switch (setup
->cullmode
) {
674 case PIPE_WINDING_NONE
:
675 setup
->triangle
= triangle_both
;
677 case PIPE_WINDING_CCW
:
678 setup
->triangle
= triangle_cw
;
680 case PIPE_WINDING_CW
:
681 setup
->triangle
= triangle_ccw
;
684 setup
->triangle
= triangle_nop
;