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"
34 #include "util/u_rect.h"
35 #include "util/u_sse.h"
37 #include "lp_setup_context.h"
38 #include "lp_setup_coef.h"
40 #include "lp_state_fs.h"
42 #define NUM_CHANNELS 4
44 #if defined(PIPE_ARCH_SSE)
45 #include <emmintrin.h>
49 subpixel_snap(float a
)
51 return util_iround(FIXED_ONE
* a
);
57 return a
* (1.0 / FIXED_ONE
);
67 * Alloc space for a new triangle plus the input.a0/dadx/dady arrays
68 * immediately after it.
69 * The memory is allocated from the per-scene pool, not per-tile.
70 * \param tri_size returns number of bytes allocated
71 * \param nr_inputs number of fragment shader inputs
72 * \return pointer to triangle space
74 struct lp_rast_triangle
*
75 lp_setup_alloc_triangle(struct lp_scene
*scene
,
80 unsigned input_array_sz
= NUM_CHANNELS
* (nr_inputs
+ 1) * sizeof(float);
81 unsigned plane_sz
= nr_planes
* sizeof(struct lp_rast_plane
);
82 struct lp_rast_triangle
*tri
;
84 *tri_size
= (sizeof(struct lp_rast_triangle
) +
88 tri
= lp_scene_alloc_aligned( scene
, *tri_size
, 16 );
92 tri
->inputs
.stride
= input_array_sz
;
95 char *a
= (char *)tri
;
96 char *b
= (char *)&GET_PLANES(tri
)[nr_planes
];
97 assert(b
- a
== *tri_size
);
104 lp_setup_print_vertex(struct lp_setup_context
*setup
,
110 debug_printf(" wpos (%s[0]) xyzw %f %f %f %f\n",
112 v
[0][0], v
[0][1], v
[0][2], v
[0][3]);
114 for (i
= 0; i
< setup
->fs
.nr_inputs
; i
++) {
115 const float *in
= v
[setup
->fs
.input
[i
].src_index
];
117 debug_printf(" in[%d] (%s[%d]) %s%s%s%s ",
119 name
, setup
->fs
.input
[i
].src_index
,
120 (setup
->fs
.input
[i
].usage_mask
& 0x1) ? "x" : " ",
121 (setup
->fs
.input
[i
].usage_mask
& 0x2) ? "y" : " ",
122 (setup
->fs
.input
[i
].usage_mask
& 0x4) ? "z" : " ",
123 (setup
->fs
.input
[i
].usage_mask
& 0x8) ? "w" : " ");
125 for (j
= 0; j
< 4; j
++)
126 if (setup
->fs
.input
[i
].usage_mask
& (1<<j
))
127 debug_printf("%.5f ", in
[j
]);
135 * Print triangle vertex attribs (for debug).
138 lp_setup_print_triangle(struct lp_setup_context
*setup
,
139 const float (*v0
)[4],
140 const float (*v1
)[4],
141 const float (*v2
)[4])
143 debug_printf("triangle\n");
146 const float ex
= v0
[0][0] - v2
[0][0];
147 const float ey
= v0
[0][1] - v2
[0][1];
148 const float fx
= v1
[0][0] - v2
[0][0];
149 const float fy
= v1
[0][1] - v2
[0][1];
151 /* det = cross(e,f).z */
152 const float det
= ex
* fy
- ey
* fx
;
154 debug_printf(" - ccw\n");
156 debug_printf(" - cw\n");
158 debug_printf(" - zero area\n");
161 lp_setup_print_vertex(setup
, "v0", v0
);
162 lp_setup_print_vertex(setup
, "v1", v1
);
163 lp_setup_print_vertex(setup
, "v2", v2
);
169 lp_rast_tri_tab
[MAX_PLANES
+1] = {
170 0, /* should be impossible */
171 LP_RAST_OP_TRIANGLE_1
,
172 LP_RAST_OP_TRIANGLE_2
,
173 LP_RAST_OP_TRIANGLE_3
,
174 LP_RAST_OP_TRIANGLE_4
,
175 LP_RAST_OP_TRIANGLE_5
,
176 LP_RAST_OP_TRIANGLE_6
,
177 LP_RAST_OP_TRIANGLE_7
,
178 LP_RAST_OP_TRIANGLE_8
184 * The primitive covers the whole tile- shade whole tile.
186 * \param tx, ty the tile position in tiles, not pixels
189 lp_setup_whole_tile(struct lp_setup_context
*setup
,
190 const struct lp_rast_shader_inputs
*inputs
,
193 struct lp_scene
*scene
= setup
->scene
;
195 LP_COUNT(nr_fully_covered_64
);
197 /* if variant is opaque and scissor doesn't effect the tile */
198 if (inputs
->opaque
) {
199 if (!scene
->fb
.zsbuf
) {
201 * All previous rendering will be overwritten so reset the bin.
203 lp_scene_bin_reset( scene
, tx
, ty
);
206 LP_COUNT(nr_shade_opaque_64
);
207 return lp_scene_bin_cmd_with_state( scene
, tx
, ty
,
209 LP_RAST_OP_SHADE_TILE_OPAQUE
,
210 lp_rast_arg_inputs(inputs
) );
212 LP_COUNT(nr_shade_64
);
213 return lp_scene_bin_cmd_with_state( scene
, tx
, ty
,
215 LP_RAST_OP_SHADE_TILE
,
216 lp_rast_arg_inputs(inputs
) );
222 * Do basic setup for triangle rasterization and determine which
223 * framebuffer tiles are touched. Put the triangle in the scene's
224 * bins for the tiles which we overlap.
227 do_triangle_ccw(struct lp_setup_context
*setup
,
228 const float (*v0
)[4],
229 const float (*v1
)[4],
230 const float (*v2
)[4],
231 boolean frontfacing
)
233 struct lp_scene
*scene
= setup
->scene
;
234 struct lp_rast_triangle
*tri
;
235 struct lp_rast_plane
*plane
;
243 lp_setup_print_triangle(setup
, v0
, v1
, v2
);
245 if (setup
->scissor_test
) {
252 /* x/y positions in fixed point */
253 x
[0] = subpixel_snap(v0
[0][0] - setup
->pixel_offset
);
254 x
[1] = subpixel_snap(v1
[0][0] - setup
->pixel_offset
);
255 x
[2] = subpixel_snap(v2
[0][0] - setup
->pixel_offset
);
257 y
[0] = subpixel_snap(v0
[0][1] - setup
->pixel_offset
);
258 y
[1] = subpixel_snap(v1
[0][1] - setup
->pixel_offset
);
259 y
[2] = subpixel_snap(v2
[0][1] - setup
->pixel_offset
);
263 /* Bounding rectangle (in pixels) */
265 /* Yes this is necessary to accurately calculate bounding boxes
266 * with the two fill-conventions we support. GL (normally) ends
267 * up needing a bottom-left fill convention, which requires
268 * slightly different rounding.
270 int adj
= (setup
->pixel_offset
!= 0) ? 1 : 0;
272 bbox
.x0
= (MIN3(x
[0], x
[1], x
[2]) + (FIXED_ONE
-1)) >> FIXED_ORDER
;
273 bbox
.x1
= (MAX3(x
[0], x
[1], x
[2]) + (FIXED_ONE
-1)) >> FIXED_ORDER
;
274 bbox
.y0
= (MIN3(y
[0], y
[1], y
[2]) + (FIXED_ONE
-1) + adj
) >> FIXED_ORDER
;
275 bbox
.y1
= (MAX3(y
[0], y
[1], y
[2]) + (FIXED_ONE
-1) + adj
) >> FIXED_ORDER
;
277 /* Inclusive coordinates:
283 if (bbox
.x1
< bbox
.x0
||
285 if (0) debug_printf("empty bounding box\n");
286 LP_COUNT(nr_culled_tris
);
290 if (!u_rect_test_intersection(&setup
->draw_region
, &bbox
)) {
291 if (0) debug_printf("offscreen\n");
292 LP_COUNT(nr_culled_tris
);
296 u_rect_find_intersection(&setup
->draw_region
, &bbox
);
298 tri
= lp_setup_alloc_triangle(scene
,
306 tri
->v
[0][0] = v0
[0][0];
307 tri
->v
[1][0] = v1
[0][0];
308 tri
->v
[2][0] = v2
[0][0];
309 tri
->v
[0][1] = v0
[0][1];
310 tri
->v
[1][1] = v1
[0][1];
311 tri
->v
[2][1] = v2
[0][1];
316 /* Setup parameter interpolants:
318 lp_setup_tri_coef( setup
, &tri
->inputs
, v0
, v1
, v2
, frontfacing
);
320 tri
->inputs
.frontfacing
= frontfacing
;
321 tri
->inputs
.disable
= FALSE
;
322 tri
->inputs
.opaque
= setup
->fs
.current
.variant
->opaque
;
324 plane
= GET_PLANES(tri
);
326 #if defined(PIPE_ARCH_SSE)
328 __m128i vertx
, verty
;
329 __m128i shufx
, shufy
;
330 __m128i dcdx
, dcdy
, c
;
332 __m128i dcdx_neg_mask
;
333 __m128i dcdy_neg_mask
;
334 __m128i dcdx_zero_mask
;
335 __m128i top_left_flag
;
336 __m128i c_inc_mask
, c_inc
;
337 __m128i eo
, p0
, p1
, p2
;
338 __m128i zero
= _mm_setzero_si128();
340 vertx
= _mm_loadu_si128((__m128i
*)x
); /* vertex x coords */
341 verty
= _mm_loadu_si128((__m128i
*)y
); /* vertex y coords */
343 shufx
= _mm_shuffle_epi32(vertx
, _MM_SHUFFLE(3,0,2,1));
344 shufy
= _mm_shuffle_epi32(verty
, _MM_SHUFFLE(3,0,2,1));
346 dcdx
= _mm_sub_epi32(verty
, shufy
);
347 dcdy
= _mm_sub_epi32(vertx
, shufx
);
349 dcdx_neg_mask
= _mm_srai_epi32(dcdx
, 31);
350 dcdx_zero_mask
= _mm_cmpeq_epi32(dcdx
, zero
);
351 dcdy_neg_mask
= _mm_srai_epi32(dcdy
, 31);
353 top_left_flag
= _mm_set1_epi32((setup
->pixel_offset
== 0) ? ~0 : 0);
355 c_inc_mask
= _mm_or_si128(dcdx_neg_mask
,
356 _mm_and_si128(dcdx_zero_mask
,
357 _mm_xor_si128(dcdy_neg_mask
,
360 c_inc
= _mm_srli_epi32(c_inc_mask
, 31);
362 c
= _mm_sub_epi32(mm_mullo_epi32(dcdx
, vertx
),
363 mm_mullo_epi32(dcdy
, verty
));
365 c
= _mm_add_epi32(c
, c_inc
);
367 /* Scale up to match c:
369 dcdx
= _mm_slli_epi32(dcdx
, FIXED_ORDER
);
370 dcdy
= _mm_slli_epi32(dcdy
, FIXED_ORDER
);
372 /* Calculate trivial reject values:
374 eo
= _mm_sub_epi32(_mm_andnot_si128(dcdy_neg_mask
, dcdy
),
375 _mm_and_si128(dcdx_neg_mask
, dcdx
));
377 /* ei = _mm_sub_epi32(_mm_sub_epi32(dcdy, dcdx), eo); */
379 /* Pointless transpose which gets undone immediately in
382 transpose4_epi32(&c
, &dcdx
, &dcdy
, &eo
,
383 &p0
, &p1
, &p2
, &unused
);
385 _mm_store_si128((__m128i
*)&plane
[0], p0
);
386 _mm_store_si128((__m128i
*)&plane
[1], p1
);
387 _mm_store_si128((__m128i
*)&plane
[2], p2
);
392 plane
[0].dcdy
= x
[0] - x
[1];
393 plane
[1].dcdy
= x
[1] - x
[2];
394 plane
[2].dcdy
= x
[2] - x
[0];
395 plane
[0].dcdx
= y
[0] - y
[1];
396 plane
[1].dcdx
= y
[1] - y
[2];
397 plane
[2].dcdx
= y
[2] - y
[0];
399 for (i
= 0; i
< 3; i
++) {
400 /* half-edge constants, will be interated over the whole render
403 plane
[i
].c
= plane
[i
].dcdx
* x
[i
] - plane
[i
].dcdy
* y
[i
];
405 /* correct for top-left vs. bottom-left fill convention.
407 * note that we're overloading gl_rasterization_rules to mean
408 * both (0.5,0.5) pixel centers *and* bottom-left filling
411 * GL actually has a top-left filling convention, but GL's
412 * notion of "top" differs from gallium's...
414 * Also, sometimes (in FBO cases) GL will render upside down
415 * to its usual method, in which case it will probably want
416 * to use the opposite, top-left convention.
418 if (plane
[i
].dcdx
< 0) {
419 /* both fill conventions want this - adjust for left edges */
422 else if (plane
[i
].dcdx
== 0) {
423 if (setup
->pixel_offset
== 0) {
424 /* correct for top-left fill convention:
426 if (plane
[i
].dcdy
> 0) plane
[i
].c
++;
429 /* correct for bottom-left fill convention:
431 if (plane
[i
].dcdy
< 0) plane
[i
].c
++;
435 plane
[i
].dcdx
*= FIXED_ONE
;
436 plane
[i
].dcdy
*= FIXED_ONE
;
438 /* find trivial reject offsets for each edge for a single-pixel
439 * sized block. These will be scaled up at each recursive level to
440 * match the active blocksize. Scaling in this way works best if
441 * the blocks are square.
444 if (plane
[i
].dcdx
< 0) plane
[i
].eo
-= plane
[i
].dcdx
;
445 if (plane
[i
].dcdy
> 0) plane
[i
].eo
+= plane
[i
].dcdy
;
451 debug_printf("p0: %08x/%08x/%08x/%08x\n",
457 debug_printf("p1: %08x/%08x/%08x/%08x\n",
463 debug_printf("p0: %08x/%08x/%08x/%08x\n",
472 * When rasterizing scissored tris, use the intersection of the
473 * triangle bounding box and the scissor rect to generate the
476 * This permits us to cut off the triangle "tails" that are present
477 * in the intermediate recursive levels caused when two of the
478 * triangles edges don't diverge quickly enough to trivially reject
479 * exterior blocks from the triangle.
481 * It's not really clear if it's worth worrying about these tails,
482 * but since we generate the planes for each scissored tri, it's
483 * free to trim them in this case.
485 * Note that otherwise, the scissor planes only vary in 'C' value,
486 * and even then only on state-changes. Could alternatively store
487 * these planes elsewhere.
489 if (nr_planes
== 7) {
492 plane
[3].c
= 1-bbox
.x0
;
497 plane
[4].c
= bbox
.x1
+1;
502 plane
[5].c
= 1-bbox
.y0
;
507 plane
[6].c
= bbox
.y1
+1;
511 return lp_setup_bin_triangle( setup
, tri
, &bbox
, nr_planes
);
515 * Round to nearest less or equal power of two of the input.
517 * Undefined if no bit set exists, so code should check against 0 first.
519 static INLINE
uint32_t
520 floor_pot(uint32_t n
)
522 #if defined(PIPE_CC_GCC) && defined(PIPE_ARCH_X86)
542 lp_setup_bin_triangle( struct lp_setup_context
*setup
,
543 struct lp_rast_triangle
*tri
,
544 const struct u_rect
*bbox
,
547 struct lp_scene
*scene
= setup
->scene
;
550 /* What is the largest power-of-two boundary this triangle crosses:
552 int dx
= floor_pot((bbox
->x0
^ bbox
->x1
) |
553 (bbox
->y0
^ bbox
->y1
));
555 /* The largest dimension of the rasterized area of the triangle
556 * (aligned to a 4x4 grid), rounded down to the nearest power of two:
558 int sz
= floor_pot((bbox
->x1
- (bbox
->x0
& ~3)) |
559 (bbox
->y1
- (bbox
->y0
& ~3)));
561 /* Determine which tile(s) intersect the triangle's bounding box
565 int ix0
= bbox
->x0
/ TILE_SIZE
;
566 int iy0
= bbox
->y0
/ TILE_SIZE
;
567 int px
= bbox
->x0
& 63 & ~3;
568 int py
= bbox
->y0
& 63 & ~3;
569 int mask
= px
| (py
<< 8);
571 assert(iy0
== bbox
->y1
/ TILE_SIZE
&&
572 ix0
== bbox
->x1
/ TILE_SIZE
);
574 if (nr_planes
== 3) {
577 /* Triangle is contained in a single 4x4 stamp:
579 return lp_scene_bin_cmd_with_state( scene
, ix0
, iy0
,
581 LP_RAST_OP_TRIANGLE_3_4
,
582 lp_rast_arg_triangle(tri
, mask
) );
587 /* Triangle is contained in a single 16x16 block:
589 return lp_scene_bin_cmd_with_state( scene
, ix0
, iy0
,
591 LP_RAST_OP_TRIANGLE_3_16
,
592 lp_rast_arg_triangle(tri
, mask
) );
595 else if (nr_planes
== 4 && sz
< 16)
597 return lp_scene_bin_cmd_with_state(scene
, ix0
, iy0
,
599 LP_RAST_OP_TRIANGLE_4_16
,
600 lp_rast_arg_triangle(tri
, mask
) );
604 /* Triangle is contained in a single tile:
606 return lp_scene_bin_cmd_with_state( scene
, ix0
, iy0
, setup
->fs
.stored
,
607 lp_rast_tri_tab
[nr_planes
],
608 lp_rast_arg_triangle(tri
, (1<<nr_planes
)-1) );
612 struct lp_rast_plane
*plane
= GET_PLANES(tri
);
616 int xstep
[MAX_PLANES
];
617 int ystep
[MAX_PLANES
];
620 int ix0
= bbox
->x0
/ TILE_SIZE
;
621 int iy0
= bbox
->y0
/ TILE_SIZE
;
622 int ix1
= bbox
->x1
/ TILE_SIZE
;
623 int iy1
= bbox
->y1
/ TILE_SIZE
;
625 for (i
= 0; i
< nr_planes
; i
++) {
627 plane
[i
].dcdy
* iy0
* TILE_SIZE
-
628 plane
[i
].dcdx
* ix0
* TILE_SIZE
);
630 ei
[i
] = (plane
[i
].dcdy
-
632 plane
[i
].eo
) << TILE_ORDER
;
634 eo
[i
] = plane
[i
].eo
<< TILE_ORDER
;
635 xstep
[i
] = -(plane
[i
].dcdx
<< TILE_ORDER
);
636 ystep
[i
] = plane
[i
].dcdy
<< TILE_ORDER
;
641 /* Test tile-sized blocks against the triangle.
642 * Discard blocks fully outside the tri. If the block is fully
643 * contained inside the tri, bin an lp_rast_shade_tile command.
644 * Else, bin a lp_rast_triangle command.
646 for (y
= iy0
; y
<= iy1
; y
++)
648 boolean in
= FALSE
; /* are we inside the triangle? */
651 for (i
= 0; i
< nr_planes
; i
++)
654 for (x
= ix0
; x
<= ix1
; x
++)
659 for (i
= 0; i
< nr_planes
; i
++) {
660 int planeout
= cx
[i
] + eo
[i
];
661 int planepartial
= cx
[i
] + ei
[i
] - 1;
662 out
|= (planeout
>> 31);
663 partial
|= (planepartial
>> 31) & (1<<i
);
669 break; /* exiting triangle, all done with this row */
670 LP_COUNT(nr_empty_64
);
673 /* Not trivially accepted by at least one plane -
674 * rasterize/shade partial tile
676 int count
= util_bitcount(partial
);
679 if (!lp_scene_bin_cmd_with_state( scene
, x
, y
,
681 lp_rast_tri_tab
[count
],
682 lp_rast_arg_triangle(tri
, partial
) ))
685 LP_COUNT(nr_partially_covered_64
);
688 /* triangle covers the whole tile- shade whole tile */
689 LP_COUNT(nr_fully_covered_64
);
691 if (!lp_setup_whole_tile(setup
, &tri
->inputs
, x
, y
))
695 /* Iterate cx values across the region:
697 for (i
= 0; i
< nr_planes
; i
++)
701 /* Iterate c values down the region:
703 for (i
= 0; i
< nr_planes
; i
++)
711 /* Need to disable any partially binned triangle. This is easier
712 * than trying to locate all the triangle, shade-tile, etc,
713 * commands which may have been binned.
715 tri
->inputs
.disable
= TRUE
;
721 * Try to draw the triangle, restart the scene on failure.
723 static void retry_triangle_ccw( struct lp_setup_context
*setup
,
724 const float (*v0
)[4],
725 const float (*v1
)[4],
726 const float (*v2
)[4],
729 if (!do_triangle_ccw( setup
, v0
, v1
, v2
, front
))
731 if (!lp_setup_flush_and_restart(setup
))
734 if (!do_triangle_ccw( setup
, v0
, v1
, v2
, front
))
740 calc_area(const float (*v0
)[4],
741 const float (*v1
)[4],
742 const float (*v2
)[4])
744 float dx01
= v0
[0][0] - v1
[0][0];
745 float dy01
= v0
[0][1] - v1
[0][1];
746 float dx20
= v2
[0][0] - v0
[0][0];
747 float dy20
= v2
[0][1] - v0
[0][1];
748 return dx01
* dy20
- dx20
* dy01
;
753 * Draw triangle if it's CW, cull otherwise.
755 static void triangle_cw( struct lp_setup_context
*setup
,
756 const float (*v0
)[4],
757 const float (*v1
)[4],
758 const float (*v2
)[4] )
760 float area
= calc_area(v0
, v1
, v2
);
763 retry_triangle_ccw(setup
, v0
, v2
, v1
, !setup
->ccw_is_frontface
);
767 static void triangle_ccw( struct lp_setup_context
*setup
,
768 const float (*v0
)[4],
769 const float (*v1
)[4],
770 const float (*v2
)[4])
772 float area
= calc_area(v0
, v1
, v2
);
775 retry_triangle_ccw(setup
, v0
, v1
, v2
, setup
->ccw_is_frontface
);
779 * Draw triangle whether it's CW or CCW.
781 static void triangle_both( struct lp_setup_context
*setup
,
782 const float (*v0
)[4],
783 const float (*v1
)[4],
784 const float (*v2
)[4] )
786 float area
= calc_area(v0
, v1
, v2
);
789 retry_triangle_ccw( setup
, v0
, v1
, v2
, setup
->ccw_is_frontface
);
790 else if (area
< 0.0f
)
791 retry_triangle_ccw( setup
, v0
, v2
, v1
, !setup
->ccw_is_frontface
);
795 static void triangle_nop( struct lp_setup_context
*setup
,
796 const float (*v0
)[4],
797 const float (*v1
)[4],
798 const float (*v2
)[4] )
804 lp_setup_choose_triangle( struct lp_setup_context
*setup
)
806 switch (setup
->cullmode
) {
808 setup
->triangle
= triangle_both
;
811 setup
->triangle
= setup
->ccw_is_frontface
? triangle_ccw
: triangle_cw
;
813 case PIPE_FACE_FRONT
:
814 setup
->triangle
= setup
->ccw_is_frontface
? triangle_cw
: triangle_ccw
;
817 setup
->triangle
= triangle_nop
;