2009-10-07 22:36:43 +01:00
|
|
|
/**************************************************************************
|
|
|
|
*
|
|
|
|
* Copyright 2007 Tungsten Graphics, Inc., Cedar Park, Texas.
|
|
|
|
* All Rights Reserved.
|
|
|
|
*
|
|
|
|
* Permission is hereby granted, free of charge, to any person obtaining a
|
|
|
|
* copy of this software and associated documentation files (the
|
|
|
|
* "Software"), to deal in the Software without restriction, including
|
|
|
|
* without limitation the rights to use, copy, modify, merge, publish,
|
|
|
|
* distribute, sub license, and/or sell copies of the Software, and to
|
|
|
|
* permit persons to whom the Software is furnished to do so, subject to
|
|
|
|
* the following conditions:
|
|
|
|
*
|
|
|
|
* The above copyright notice and this permission notice (including the
|
|
|
|
* next paragraph) shall be included in all copies or substantial portions
|
|
|
|
* of the Software.
|
|
|
|
*
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
|
|
|
|
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
|
|
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
|
|
|
|
* IN NO EVENT SHALL TUNGSTEN GRAPHICS AND/OR ITS SUPPLIERS BE LIABLE FOR
|
|
|
|
* ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
|
|
|
|
* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
|
|
|
|
* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
|
|
|
*
|
|
|
|
**************************************************************************/
|
|
|
|
|
|
|
|
/*
|
2009-10-08 12:15:12 +01:00
|
|
|
* Binning code for triangles
|
2009-10-07 22:36:43 +01:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include "util/u_math.h"
|
|
|
|
#include "util/u_memory.h"
|
2010-08-24 20:04:08 +01:00
|
|
|
#include "util/u_rect.h"
|
2010-01-21 21:59:01 +00:00
|
|
|
#include "lp_perf.h"
|
|
|
|
#include "lp_setup_context.h"
|
2010-08-22 10:57:12 +01:00
|
|
|
#include "lp_setup_coef.h"
|
2010-01-21 21:59:01 +00:00
|
|
|
#include "lp_rast.h"
|
2010-05-26 15:11:17 +01:00
|
|
|
#include "lp_state_fs.h"
|
2009-10-07 22:36:43 +01:00
|
|
|
|
2009-10-09 10:23:53 +01:00
|
|
|
#define NUM_CHANNELS 4
|
2009-10-07 22:36:43 +01:00
|
|
|
|
2010-06-17 21:19:09 +01:00
|
|
|
|
|
|
|
|
|
|
|
static INLINE int
|
|
|
|
subpixel_snap(float a)
|
|
|
|
{
|
|
|
|
return util_iround(FIXED_ONE * a);
|
|
|
|
}
|
|
|
|
|
|
|
|
static INLINE float
|
|
|
|
fixed_to_float(int a)
|
|
|
|
{
|
|
|
|
return a * (1.0 / FIXED_ONE);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-01-14 01:01:45 +00:00
|
|
|
|
2009-10-07 22:36:43 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
2010-01-22 02:04:53 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Alloc space for a new triangle plus the input.a0/dadx/dady arrays
|
|
|
|
* immediately after it.
|
|
|
|
* The memory is allocated from the per-scene pool, not per-tile.
|
|
|
|
* \param tri_size returns number of bytes allocated
|
|
|
|
* \param nr_inputs number of fragment shader inputs
|
|
|
|
* \return pointer to triangle space
|
|
|
|
*/
|
2010-07-19 15:23:09 +01:00
|
|
|
struct lp_rast_triangle *
|
|
|
|
lp_setup_alloc_triangle(struct lp_scene *scene,
|
|
|
|
unsigned nr_inputs,
|
|
|
|
unsigned nr_planes,
|
|
|
|
unsigned *tri_size)
|
2010-01-22 02:04:53 +00:00
|
|
|
{
|
|
|
|
unsigned input_array_sz = NUM_CHANNELS * (nr_inputs + 1) * sizeof(float);
|
|
|
|
struct lp_rast_triangle *tri;
|
2010-06-17 21:19:09 +01:00
|
|
|
unsigned tri_bytes, bytes;
|
2010-01-22 02:04:53 +00:00
|
|
|
char *inputs;
|
|
|
|
|
2010-06-17 21:19:09 +01:00
|
|
|
tri_bytes = align(Offset(struct lp_rast_triangle, plane[nr_planes]), 16);
|
|
|
|
bytes = tri_bytes + (3 * input_array_sz);
|
2010-01-22 02:04:53 +00:00
|
|
|
|
|
|
|
tri = lp_scene_alloc_aligned( scene, bytes, 16 );
|
|
|
|
|
2010-05-28 19:49:49 +01:00
|
|
|
if (tri) {
|
2010-06-17 21:19:09 +01:00
|
|
|
inputs = ((char *)tri) + tri_bytes;
|
2010-05-28 19:49:49 +01:00
|
|
|
tri->inputs.a0 = (float (*)[4]) inputs;
|
|
|
|
tri->inputs.dadx = (float (*)[4]) (inputs + input_array_sz);
|
|
|
|
tri->inputs.dady = (float (*)[4]) (inputs + 2 * input_array_sz);
|
2010-01-22 02:04:53 +00:00
|
|
|
|
2010-05-28 19:49:49 +01:00
|
|
|
*tri_size = bytes;
|
|
|
|
}
|
2010-01-22 02:04:53 +00:00
|
|
|
|
|
|
|
return tri;
|
|
|
|
}
|
|
|
|
|
2010-08-24 19:58:54 +01:00
|
|
|
void
|
|
|
|
lp_setup_print_vertex(struct lp_setup_context *setup,
|
|
|
|
const char *name,
|
|
|
|
const float (*v)[4])
|
|
|
|
{
|
|
|
|
int i, j;
|
|
|
|
|
|
|
|
debug_printf(" wpos (%s[0]) xyzw %f %f %f %f\n",
|
|
|
|
name,
|
|
|
|
v[0][0], v[0][1], v[0][2], v[0][3]);
|
|
|
|
|
|
|
|
for (i = 0; i < setup->fs.nr_inputs; i++) {
|
|
|
|
const float *in = v[setup->fs.input[i].src_index];
|
|
|
|
|
|
|
|
debug_printf(" in[%d] (%s[%d]) %s%s%s%s ",
|
|
|
|
i,
|
|
|
|
name, setup->fs.input[i].src_index,
|
|
|
|
(setup->fs.input[i].usage_mask & 0x1) ? "x" : " ",
|
|
|
|
(setup->fs.input[i].usage_mask & 0x2) ? "y" : " ",
|
|
|
|
(setup->fs.input[i].usage_mask & 0x4) ? "z" : " ",
|
|
|
|
(setup->fs.input[i].usage_mask & 0x8) ? "w" : " ");
|
|
|
|
|
|
|
|
for (j = 0; j < 4; j++)
|
|
|
|
if (setup->fs.input[i].usage_mask & (1<<j))
|
|
|
|
debug_printf("%.5f ", in[j]);
|
|
|
|
|
|
|
|
debug_printf("\n");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-01-22 02:04:53 +00:00
|
|
|
|
2010-04-15 23:24:31 +01:00
|
|
|
/**
|
|
|
|
* Print triangle vertex attribs (for debug).
|
|
|
|
*/
|
2010-08-24 19:58:54 +01:00
|
|
|
void
|
|
|
|
lp_setup_print_triangle(struct lp_setup_context *setup,
|
|
|
|
const float (*v0)[4],
|
|
|
|
const float (*v1)[4],
|
|
|
|
const float (*v2)[4])
|
2010-04-15 23:24:31 +01:00
|
|
|
{
|
2010-08-24 19:58:54 +01:00
|
|
|
debug_printf("triangle\n");
|
|
|
|
|
|
|
|
{
|
|
|
|
const float ex = v0[0][0] - v2[0][0];
|
|
|
|
const float ey = v0[0][1] - v2[0][1];
|
|
|
|
const float fx = v1[0][0] - v2[0][0];
|
|
|
|
const float fy = v1[0][1] - v2[0][1];
|
|
|
|
|
|
|
|
/* det = cross(e,f).z */
|
|
|
|
const float det = ex * fy - ey * fx;
|
|
|
|
if (det < 0.0f)
|
|
|
|
debug_printf(" - ccw\n");
|
|
|
|
else if (det > 0.0f)
|
|
|
|
debug_printf(" - cw\n");
|
|
|
|
else
|
|
|
|
debug_printf(" - zero area\n");
|
2010-04-15 23:24:31 +01:00
|
|
|
}
|
2010-08-24 19:58:54 +01:00
|
|
|
|
|
|
|
lp_setup_print_vertex(setup, "v0", v0);
|
|
|
|
lp_setup_print_vertex(setup, "v1", v1);
|
|
|
|
lp_setup_print_vertex(setup, "v2", v2);
|
2010-04-15 23:24:31 +01:00
|
|
|
}
|
|
|
|
|
2010-01-22 02:04:53 +00:00
|
|
|
|
2010-07-19 15:23:09 +01:00
|
|
|
lp_rast_cmd lp_rast_tri_tab[9] = {
|
2010-06-17 21:19:09 +01:00
|
|
|
NULL, /* should be impossible */
|
|
|
|
lp_rast_triangle_1,
|
|
|
|
lp_rast_triangle_2,
|
|
|
|
lp_rast_triangle_3,
|
|
|
|
lp_rast_triangle_4,
|
|
|
|
lp_rast_triangle_5,
|
|
|
|
lp_rast_triangle_6,
|
2010-07-19 15:23:09 +01:00
|
|
|
lp_rast_triangle_7,
|
|
|
|
lp_rast_triangle_8
|
2010-06-17 21:19:09 +01:00
|
|
|
};
|
|
|
|
|
2009-11-30 21:02:01 +00:00
|
|
|
/**
|
|
|
|
* Do basic setup for triangle rasterization and determine which
|
2009-12-13 18:17:25 +00:00
|
|
|
* framebuffer tiles are touched. Put the triangle in the scene's
|
|
|
|
* bins for the tiles which we overlap.
|
2009-11-30 21:02:01 +00:00
|
|
|
*/
|
2010-06-17 21:19:09 +01:00
|
|
|
static void
|
2010-03-13 10:45:52 +00:00
|
|
|
do_triangle_ccw(struct lp_setup_context *setup,
|
2010-08-22 10:57:12 +01:00
|
|
|
const float (*v0)[4],
|
2009-10-07 22:36:43 +01:00
|
|
|
const float (*v1)[4],
|
|
|
|
const float (*v2)[4],
|
|
|
|
boolean frontfacing )
|
|
|
|
{
|
2009-12-13 18:17:25 +00:00
|
|
|
struct lp_scene *scene = lp_setup_get_current_scene(setup);
|
2010-01-22 02:04:53 +00:00
|
|
|
struct lp_rast_triangle *tri;
|
2010-08-22 10:57:12 +01:00
|
|
|
int x[3];
|
|
|
|
int y[3];
|
|
|
|
float dy01, dy20;
|
|
|
|
float dx01, dx20;
|
|
|
|
float oneoverarea;
|
|
|
|
struct lp_tri_info info;
|
2010-01-22 00:31:43 +00:00
|
|
|
int area;
|
2010-08-24 20:04:08 +01:00
|
|
|
struct u_rect bbox;
|
2010-01-22 02:04:53 +00:00
|
|
|
unsigned tri_bytes;
|
2010-06-17 21:19:09 +01:00
|
|
|
int i;
|
|
|
|
int nr_planes = 3;
|
|
|
|
|
2010-04-15 23:24:31 +01:00
|
|
|
if (0)
|
2010-08-22 10:57:12 +01:00
|
|
|
lp_setup_print_triangle(setup, v0, v1, v2);
|
2010-04-15 23:24:31 +01:00
|
|
|
|
2010-06-17 21:19:09 +01:00
|
|
|
if (setup->scissor_test) {
|
|
|
|
nr_planes = 7;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
nr_planes = 3;
|
|
|
|
}
|
|
|
|
|
2010-08-24 20:04:08 +01:00
|
|
|
/* x/y positions in fixed point */
|
2010-08-22 10:57:12 +01:00
|
|
|
x[0] = subpixel_snap(v0[0][0] - setup->pixel_offset);
|
|
|
|
x[1] = subpixel_snap(v1[0][0] - setup->pixel_offset);
|
|
|
|
x[2] = subpixel_snap(v2[0][0] - setup->pixel_offset);
|
|
|
|
y[0] = subpixel_snap(v0[0][1] - setup->pixel_offset);
|
|
|
|
y[1] = subpixel_snap(v1[0][1] - setup->pixel_offset);
|
|
|
|
y[2] = subpixel_snap(v2[0][1] - setup->pixel_offset);
|
2010-08-24 20:04:08 +01:00
|
|
|
|
|
|
|
|
|
|
|
/* Bounding rectangle (in pixels) */
|
|
|
|
{
|
|
|
|
/* Yes this is necessary to accurately calculate bounding boxes
|
|
|
|
* with the two fill-conventions we support. GL (normally) ends
|
|
|
|
* up needing a bottom-left fill convention, which requires
|
|
|
|
* slightly different rounding.
|
|
|
|
*/
|
|
|
|
int adj = (setup->pixel_offset != 0) ? 1 : 0;
|
|
|
|
|
2010-08-22 10:57:12 +01:00
|
|
|
bbox.x0 = (MIN3(x[0], x[1], x[2]) + (FIXED_ONE-1)) >> FIXED_ORDER;
|
|
|
|
bbox.x1 = (MAX3(x[0], x[1], x[2]) + (FIXED_ONE-1)) >> FIXED_ORDER;
|
|
|
|
bbox.y0 = (MIN3(y[0], y[1], y[2]) + (FIXED_ONE-1) + adj) >> FIXED_ORDER;
|
|
|
|
bbox.y1 = (MAX3(y[0], y[1], y[2]) + (FIXED_ONE-1) + adj) >> FIXED_ORDER;
|
2010-08-24 20:04:08 +01:00
|
|
|
|
|
|
|
/* Inclusive coordinates:
|
|
|
|
*/
|
|
|
|
bbox.x1--;
|
|
|
|
bbox.y1--;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (bbox.x1 < bbox.x0 ||
|
|
|
|
bbox.y1 < bbox.y0) {
|
|
|
|
if (0) debug_printf("empty bounding box\n");
|
|
|
|
LP_COUNT(nr_culled_tris);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!u_rect_test_intersection(&setup->draw_region, &bbox)) {
|
|
|
|
if (0) debug_printf("offscreen\n");
|
|
|
|
LP_COUNT(nr_culled_tris);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
u_rect_find_intersection(&setup->draw_region, &bbox);
|
2010-06-17 21:19:09 +01:00
|
|
|
|
2010-07-19 15:23:09 +01:00
|
|
|
tri = lp_setup_alloc_triangle(scene,
|
|
|
|
setup->fs.nr_inputs,
|
|
|
|
nr_planes,
|
|
|
|
&tri_bytes);
|
2010-05-28 19:49:49 +01:00
|
|
|
if (!tri)
|
|
|
|
return;
|
2009-10-09 15:52:18 +01:00
|
|
|
|
2010-03-03 19:55:31 +00:00
|
|
|
#ifdef DEBUG
|
2010-08-22 10:57:12 +01:00
|
|
|
tri->v[0][0] = v0[0][0];
|
|
|
|
tri->v[1][0] = v1[0][0];
|
|
|
|
tri->v[2][0] = v2[0][0];
|
|
|
|
tri->v[0][1] = v0[0][1];
|
|
|
|
tri->v[1][1] = v1[0][1];
|
|
|
|
tri->v[2][1] = v2[0][1];
|
2010-03-03 19:55:31 +00:00
|
|
|
#endif
|
|
|
|
|
2010-08-22 10:57:12 +01:00
|
|
|
tri->plane[0].dcdy = x[0] - x[1];
|
|
|
|
tri->plane[1].dcdy = x[1] - x[2];
|
|
|
|
tri->plane[2].dcdy = x[2] - x[0];
|
2009-10-07 22:36:43 +01:00
|
|
|
|
2010-08-22 10:57:12 +01:00
|
|
|
tri->plane[0].dcdx = y[0] - y[1];
|
|
|
|
tri->plane[1].dcdx = y[1] - y[2];
|
|
|
|
tri->plane[2].dcdx = y[2] - y[0];
|
2009-10-07 22:36:43 +01:00
|
|
|
|
2010-06-17 21:19:09 +01:00
|
|
|
area = (tri->plane[0].dcdy * tri->plane[2].dcdx -
|
|
|
|
tri->plane[2].dcdy * tri->plane[0].dcdx);
|
2009-10-07 22:36:43 +01:00
|
|
|
|
2010-01-21 21:59:01 +00:00
|
|
|
LP_COUNT(nr_tris);
|
|
|
|
|
2009-10-19 12:24:18 +01:00
|
|
|
/* Cull non-ccw and zero-sized triangles.
|
|
|
|
*
|
|
|
|
* XXX: subject to overflow??
|
2009-10-07 22:36:43 +01:00
|
|
|
*/
|
2010-01-22 00:31:43 +00:00
|
|
|
if (area <= 0) {
|
2010-01-22 02:04:53 +00:00
|
|
|
lp_scene_putback_data( scene, tri_bytes );
|
2010-01-21 21:59:01 +00:00
|
|
|
LP_COUNT(nr_culled_tris);
|
2009-10-07 22:36:43 +01:00
|
|
|
return;
|
2009-10-19 12:24:18 +01:00
|
|
|
}
|
2009-10-07 22:36:43 +01:00
|
|
|
|
|
|
|
|
2009-10-19 12:24:18 +01:00
|
|
|
/*
|
2009-10-07 22:36:43 +01:00
|
|
|
*/
|
2010-08-22 10:57:12 +01:00
|
|
|
dx01 = v0[0][0] - v1[0][0];
|
|
|
|
dy01 = v0[0][1] - v1[0][1];
|
|
|
|
dx20 = v2[0][0] - v0[0][0];
|
|
|
|
dy20 = v2[0][1] - v0[0][1];
|
|
|
|
oneoverarea = 1.0f / (dx01 * dy20 - dx20 * dy01);
|
|
|
|
|
|
|
|
info.v0 = v0;
|
|
|
|
info.v1 = v1;
|
|
|
|
info.v2 = v2;
|
2010-06-17 21:19:09 +01:00
|
|
|
info.frontfacing = frontfacing;
|
2010-08-22 10:57:12 +01:00
|
|
|
info.x0_center = v0[0][0] - setup->pixel_offset;
|
|
|
|
info.y0_center = v0[0][1] - setup->pixel_offset;
|
|
|
|
info.dx01_ooa = dx01 * oneoverarea;
|
|
|
|
info.dx20_ooa = dx20 * oneoverarea;
|
|
|
|
info.dy01_ooa = dy01 * oneoverarea;
|
|
|
|
info.dy20_ooa = dy20 * oneoverarea;
|
2009-10-07 22:36:43 +01:00
|
|
|
|
|
|
|
/* Setup parameter interpolants:
|
|
|
|
*/
|
2010-08-22 10:57:12 +01:00
|
|
|
lp_setup_tri_coef( setup, &tri->inputs, &info );
|
2009-10-07 22:36:43 +01:00
|
|
|
|
2010-03-18 19:02:53 +00:00
|
|
|
tri->inputs.facing = frontfacing ? 1.0F : -1.0F;
|
2010-07-10 16:40:34 +01:00
|
|
|
tri->inputs.state = setup->fs.stored;
|
2010-03-18 19:02:53 +00:00
|
|
|
|
2009-10-07 22:36:43 +01:00
|
|
|
|
2010-06-17 21:19:09 +01:00
|
|
|
|
|
|
|
for (i = 0; i < 3; i++) {
|
|
|
|
struct lp_rast_plane *plane = &tri->plane[i];
|
2009-10-07 22:36:43 +01:00
|
|
|
|
2010-06-17 21:19:09 +01:00
|
|
|
/* half-edge constants, will be interated over the whole render
|
|
|
|
* target.
|
|
|
|
*/
|
2010-08-22 10:57:12 +01:00
|
|
|
plane->c = plane->dcdx * x[i] - plane->dcdy * y[i];
|
2010-06-17 21:19:09 +01:00
|
|
|
|
|
|
|
/* correct for top-left vs. bottom-left fill convention.
|
|
|
|
*
|
|
|
|
* note that we're overloading gl_rasterization_rules to mean
|
|
|
|
* both (0.5,0.5) pixel centers *and* bottom-left filling
|
|
|
|
* convention.
|
|
|
|
*
|
|
|
|
* GL actually has a top-left filling convention, but GL's
|
|
|
|
* notion of "top" differs from gallium's...
|
|
|
|
*
|
|
|
|
* Also, sometimes (in FBO cases) GL will render upside down
|
|
|
|
* to its usual method, in which case it will probably want
|
|
|
|
* to use the opposite, top-left convention.
|
|
|
|
*/
|
|
|
|
if (plane->dcdx < 0) {
|
|
|
|
/* both fill conventions want this - adjust for left edges */
|
|
|
|
plane->c++;
|
|
|
|
}
|
|
|
|
else if (plane->dcdx == 0) {
|
|
|
|
if (setup->pixel_offset == 0) {
|
|
|
|
/* correct for top-left fill convention:
|
|
|
|
*/
|
|
|
|
if (plane->dcdy > 0) plane->c++;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
/* correct for bottom-left fill convention:
|
|
|
|
*/
|
|
|
|
if (plane->dcdy < 0) plane->c++;
|
|
|
|
}
|
|
|
|
}
|
2009-10-07 22:36:43 +01:00
|
|
|
|
2010-06-17 21:19:09 +01:00
|
|
|
plane->dcdx *= FIXED_ONE;
|
|
|
|
plane->dcdy *= FIXED_ONE;
|
2009-10-07 22:36:43 +01:00
|
|
|
|
2010-06-17 21:19:09 +01:00
|
|
|
/* find trivial reject offsets for each edge for a single-pixel
|
|
|
|
* sized block. These will be scaled up at each recursive level to
|
|
|
|
* match the active blocksize. Scaling in this way works best if
|
|
|
|
* the blocks are square.
|
|
|
|
*/
|
|
|
|
plane->eo = 0;
|
|
|
|
if (plane->dcdx < 0) plane->eo -= plane->dcdx;
|
|
|
|
if (plane->dcdy > 0) plane->eo += plane->dcdy;
|
2009-10-07 22:36:43 +01:00
|
|
|
|
2010-06-17 21:19:09 +01:00
|
|
|
/* Calculate trivial accept offsets from the above.
|
|
|
|
*/
|
|
|
|
plane->ei = plane->dcdy - plane->dcdx - plane->eo;
|
2009-10-20 02:46:00 +01:00
|
|
|
}
|
|
|
|
|
2010-06-17 21:19:09 +01:00
|
|
|
|
|
|
|
/*
|
|
|
|
* When rasterizing scissored tris, use the intersection of the
|
|
|
|
* triangle bounding box and the scissor rect to generate the
|
|
|
|
* scissor planes.
|
|
|
|
*
|
|
|
|
* This permits us to cut off the triangle "tails" that are present
|
|
|
|
* in the intermediate recursive levels caused when two of the
|
|
|
|
* triangles edges don't diverge quickly enough to trivially reject
|
|
|
|
* exterior blocks from the triangle.
|
|
|
|
*
|
|
|
|
* It's not really clear if it's worth worrying about these tails,
|
|
|
|
* but since we generate the planes for each scissored tri, it's
|
|
|
|
* free to trim them in this case.
|
|
|
|
*
|
|
|
|
* Note that otherwise, the scissor planes only vary in 'C' value,
|
|
|
|
* and even then only on state-changes. Could alternatively store
|
|
|
|
* these planes elsewhere.
|
|
|
|
*/
|
|
|
|
if (nr_planes == 7) {
|
|
|
|
tri->plane[3].dcdx = -1;
|
|
|
|
tri->plane[3].dcdy = 0;
|
2010-08-24 20:04:08 +01:00
|
|
|
tri->plane[3].c = 1-bbox.x0;
|
2010-06-17 21:19:09 +01:00
|
|
|
tri->plane[3].ei = 0;
|
|
|
|
tri->plane[3].eo = 1;
|
|
|
|
|
|
|
|
tri->plane[4].dcdx = 1;
|
|
|
|
tri->plane[4].dcdy = 0;
|
2010-08-24 20:04:08 +01:00
|
|
|
tri->plane[4].c = bbox.x1+1;
|
2010-06-17 21:19:09 +01:00
|
|
|
tri->plane[4].ei = -1;
|
|
|
|
tri->plane[4].eo = 0;
|
|
|
|
|
|
|
|
tri->plane[5].dcdx = 0;
|
|
|
|
tri->plane[5].dcdy = 1;
|
2010-08-24 20:04:08 +01:00
|
|
|
tri->plane[5].c = 1-bbox.y0;
|
2010-06-17 21:19:09 +01:00
|
|
|
tri->plane[5].ei = 0;
|
|
|
|
tri->plane[5].eo = 1;
|
|
|
|
|
|
|
|
tri->plane[6].dcdx = 0;
|
|
|
|
tri->plane[6].dcdy = -1;
|
2010-08-24 20:04:08 +01:00
|
|
|
tri->plane[6].c = bbox.y1+1;
|
2010-06-17 21:19:09 +01:00
|
|
|
tri->plane[6].ei = -1;
|
|
|
|
tri->plane[6].eo = 0;
|
|
|
|
}
|
|
|
|
|
2010-08-26 20:09:22 +01:00
|
|
|
lp_setup_bin_triangle( setup, tri, &bbox, nr_planes );
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
lp_setup_bin_triangle( struct lp_setup_context *setup,
|
|
|
|
struct lp_rast_triangle *tri,
|
|
|
|
const struct u_rect *bbox,
|
|
|
|
int nr_planes )
|
|
|
|
{
|
|
|
|
struct lp_scene *scene = setup->scene;
|
|
|
|
struct lp_fragment_shader_variant *variant = setup->fs.current.variant;
|
|
|
|
int ix0, ix1, iy0, iy1;
|
|
|
|
int i;
|
2010-06-17 21:19:09 +01:00
|
|
|
|
2009-12-04 00:27:10 +00:00
|
|
|
/*
|
|
|
|
* All fields of 'tri' are now set. The remaining code here is
|
|
|
|
* concerned with binning.
|
|
|
|
*/
|
|
|
|
|
2010-06-17 21:19:09 +01:00
|
|
|
/* Convert to tile coordinates, and inclusive ranges:
|
2009-11-30 21:02:01 +00:00
|
|
|
*/
|
2010-08-15 22:58:26 +01:00
|
|
|
if (nr_planes == 3) {
|
2010-08-26 20:09:22 +01:00
|
|
|
int ix0 = bbox->x0 / 16;
|
|
|
|
int iy0 = bbox->y0 / 16;
|
|
|
|
int ix1 = bbox->x1 / 16;
|
|
|
|
int iy1 = bbox->y1 / 16;
|
2010-08-15 22:58:26 +01:00
|
|
|
|
|
|
|
if (iy0 == iy1 && ix0 == ix1)
|
|
|
|
{
|
|
|
|
|
|
|
|
/* Triangle is contained in a single 16x16 block:
|
|
|
|
*/
|
|
|
|
int mask = (ix0 & 3) | ((iy0 & 3) << 4);
|
|
|
|
|
|
|
|
lp_scene_bin_command( scene, ix0/4, iy0/4,
|
|
|
|
lp_rast_triangle_3_16,
|
|
|
|
lp_rast_arg_triangle(tri, mask) );
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-08-26 20:09:22 +01:00
|
|
|
ix0 = bbox->x0 / TILE_SIZE;
|
|
|
|
iy0 = bbox->y0 / TILE_SIZE;
|
|
|
|
ix1 = bbox->x1 / TILE_SIZE;
|
|
|
|
iy1 = bbox->y1 / TILE_SIZE;
|
2009-10-20 10:11:52 +01:00
|
|
|
|
2010-02-11 10:58:46 +00:00
|
|
|
/*
|
|
|
|
* Clamp to framebuffer size
|
2010-01-13 00:08:07 +00:00
|
|
|
*/
|
2010-06-17 21:19:09 +01:00
|
|
|
assert(ix0 == MAX2(ix0, 0));
|
|
|
|
assert(iy0 == MAX2(iy0, 0));
|
|
|
|
assert(ix1 == MIN2(ix1, scene->tiles_x - 1));
|
|
|
|
assert(iy1 == MIN2(iy1, scene->tiles_y - 1));
|
2010-01-13 00:08:07 +00:00
|
|
|
|
2009-11-30 21:02:01 +00:00
|
|
|
/* Determine which tile(s) intersect the triangle's bounding box
|
2009-10-09 16:05:26 +01:00
|
|
|
*/
|
2010-06-17 21:19:09 +01:00
|
|
|
if (iy0 == iy1 && ix0 == ix1)
|
2009-10-07 22:36:43 +01:00
|
|
|
{
|
2009-10-08 12:15:12 +01:00
|
|
|
/* Triangle is contained in a single tile:
|
2009-10-07 22:36:43 +01:00
|
|
|
*/
|
2010-06-17 21:19:09 +01:00
|
|
|
lp_scene_bin_command( scene, ix0, iy0,
|
|
|
|
lp_rast_tri_tab[nr_planes],
|
|
|
|
lp_rast_arg_triangle(tri, (1<<nr_planes)-1) );
|
2009-10-07 22:36:43 +01:00
|
|
|
}
|
2010-06-17 21:19:09 +01:00
|
|
|
else
|
2009-10-07 22:36:43 +01:00
|
|
|
{
|
2010-06-17 21:19:09 +01:00
|
|
|
int c[7];
|
|
|
|
int ei[7];
|
|
|
|
int eo[7];
|
|
|
|
int xstep[7];
|
|
|
|
int ystep[7];
|
2009-10-07 22:36:43 +01:00
|
|
|
int x, y;
|
2010-06-17 21:19:09 +01:00
|
|
|
|
|
|
|
for (i = 0; i < nr_planes; i++) {
|
|
|
|
c[i] = (tri->plane[i].c +
|
|
|
|
tri->plane[i].dcdy * iy0 * TILE_SIZE -
|
|
|
|
tri->plane[i].dcdx * ix0 * TILE_SIZE);
|
|
|
|
|
|
|
|
ei[i] = tri->plane[i].ei << TILE_ORDER;
|
|
|
|
eo[i] = tri->plane[i].eo << TILE_ORDER;
|
|
|
|
xstep[i] = -(tri->plane[i].dcdx << TILE_ORDER);
|
|
|
|
ystep[i] = tri->plane[i].dcdy << TILE_ORDER;
|
|
|
|
}
|
|
|
|
|
2009-10-07 22:36:43 +01:00
|
|
|
|
|
|
|
|
2010-01-19 16:30:13 +00:00
|
|
|
/* Test tile-sized blocks against the triangle.
|
|
|
|
* Discard blocks fully outside the tri. If the block is fully
|
|
|
|
* contained inside the tri, bin an lp_rast_shade_tile command.
|
|
|
|
* Else, bin a lp_rast_triangle command.
|
2009-10-07 22:36:43 +01:00
|
|
|
*/
|
2010-06-17 21:19:09 +01:00
|
|
|
for (y = iy0; y <= iy1; y++)
|
2009-10-07 22:36:43 +01:00
|
|
|
{
|
2010-01-15 18:25:13 +00:00
|
|
|
boolean in = FALSE; /* are we inside the triangle? */
|
2010-06-17 21:19:09 +01:00
|
|
|
int cx[7];
|
|
|
|
|
|
|
|
for (i = 0; i < nr_planes; i++)
|
|
|
|
cx[i] = c[i];
|
2009-10-07 22:36:43 +01:00
|
|
|
|
2010-06-17 21:19:09 +01:00
|
|
|
for (x = ix0; x <= ix1; x++)
|
2009-10-07 22:36:43 +01:00
|
|
|
{
|
2010-06-17 21:19:09 +01:00
|
|
|
int out = 0;
|
|
|
|
int partial = 0;
|
|
|
|
|
|
|
|
for (i = 0; i < nr_planes; i++) {
|
|
|
|
int planeout = cx[i] + eo[i];
|
|
|
|
int planepartial = cx[i] + ei[i] - 1;
|
|
|
|
out |= (planeout >> 31);
|
|
|
|
partial |= (planepartial >> 31) & (1<<i);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (out) {
|
|
|
|
/* do nothing */
|
|
|
|
if (in)
|
|
|
|
break; /* exiting triangle, all done with this row */
|
2010-01-21 21:59:01 +00:00
|
|
|
LP_COUNT(nr_empty_64);
|
2010-06-17 21:19:09 +01:00
|
|
|
}
|
|
|
|
else if (partial) {
|
|
|
|
/* Not trivially accepted by at least one plane -
|
|
|
|
* rasterize/shade partial tile
|
|
|
|
*/
|
|
|
|
int count = util_bitcount(partial);
|
|
|
|
in = TRUE;
|
|
|
|
lp_scene_bin_command( scene, x, y,
|
|
|
|
lp_rast_tri_tab[count],
|
|
|
|
lp_rast_arg_triangle(tri, partial) );
|
|
|
|
|
|
|
|
LP_COUNT(nr_partially_covered_64);
|
|
|
|
}
|
|
|
|
else {
|
2009-11-30 21:02:01 +00:00
|
|
|
/* triangle covers the whole tile- shade whole tile */
|
2010-01-21 21:59:01 +00:00
|
|
|
LP_COUNT(nr_fully_covered_64);
|
2010-06-17 21:19:09 +01:00
|
|
|
in = TRUE;
|
|
|
|
if (variant->opaque &&
|
2010-06-24 20:57:21 +01:00
|
|
|
!setup->fb.zsbuf) {
|
2010-01-13 21:51:47 +00:00
|
|
|
lp_scene_bin_reset( scene, x, y );
|
|
|
|
}
|
2009-12-13 18:17:25 +00:00
|
|
|
lp_scene_bin_command( scene, x, y,
|
|
|
|
lp_rast_shade_tile,
|
|
|
|
lp_rast_arg_inputs(&tri->inputs) );
|
2010-06-17 21:19:09 +01:00
|
|
|
}
|
2009-10-07 22:36:43 +01:00
|
|
|
|
|
|
|
/* Iterate cx values across the region:
|
|
|
|
*/
|
2010-06-17 21:19:09 +01:00
|
|
|
for (i = 0; i < nr_planes; i++)
|
|
|
|
cx[i] += xstep[i];
|
2009-10-07 22:36:43 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Iterate c values down the region:
|
|
|
|
*/
|
2010-06-17 21:19:09 +01:00
|
|
|
for (i = 0; i < nr_planes; i++)
|
|
|
|
c[i] += ystep[i];
|
2009-10-07 22:36:43 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-01-14 01:01:45 +00:00
|
|
|
|
2010-04-17 19:48:26 +01:00
|
|
|
/**
|
|
|
|
* Draw triangle if it's CW, cull otherwise.
|
|
|
|
*/
|
2010-03-13 10:45:52 +00:00
|
|
|
static void triangle_cw( struct lp_setup_context *setup,
|
2009-10-07 22:36:43 +01:00
|
|
|
const float (*v0)[4],
|
|
|
|
const float (*v1)[4],
|
|
|
|
const float (*v2)[4] )
|
|
|
|
{
|
2009-10-08 12:15:12 +01:00
|
|
|
do_triangle_ccw( setup, v1, v0, v2, !setup->ccw_is_frontface );
|
2009-10-07 22:36:43 +01:00
|
|
|
}
|
|
|
|
|
2010-01-14 01:01:45 +00:00
|
|
|
|
2010-04-17 19:48:26 +01:00
|
|
|
/**
|
|
|
|
* Draw triangle if it's CCW, cull otherwise.
|
|
|
|
*/
|
2010-03-13 10:45:52 +00:00
|
|
|
static void triangle_ccw( struct lp_setup_context *setup,
|
2009-10-07 22:36:43 +01:00
|
|
|
const float (*v0)[4],
|
|
|
|
const float (*v1)[4],
|
|
|
|
const float (*v2)[4] )
|
|
|
|
{
|
2009-10-08 12:15:12 +01:00
|
|
|
do_triangle_ccw( setup, v0, v1, v2, setup->ccw_is_frontface );
|
2009-10-07 22:36:43 +01:00
|
|
|
}
|
|
|
|
|
2010-01-14 01:01:45 +00:00
|
|
|
|
2010-04-17 19:48:26 +01:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Draw triangle whether it's CW or CCW.
|
|
|
|
*/
|
2010-03-13 10:45:52 +00:00
|
|
|
static void triangle_both( struct lp_setup_context *setup,
|
2009-10-07 22:36:43 +01:00
|
|
|
const float (*v0)[4],
|
|
|
|
const float (*v1)[4],
|
|
|
|
const float (*v2)[4] )
|
|
|
|
{
|
|
|
|
/* edge vectors e = v0 - v2, f = v1 - v2 */
|
|
|
|
const float ex = v0[0][0] - v2[0][0];
|
|
|
|
const float ey = v0[0][1] - v2[0][1];
|
|
|
|
const float fx = v1[0][0] - v2[0][0];
|
|
|
|
const float fy = v1[0][1] - v2[0][1];
|
|
|
|
|
|
|
|
/* det = cross(e,f).z */
|
2010-08-20 16:18:23 +01:00
|
|
|
const float det = ex * fy - ey * fx;
|
|
|
|
if (det < 0.0f)
|
2009-10-08 12:15:12 +01:00
|
|
|
triangle_ccw( setup, v0, v1, v2 );
|
2010-08-20 16:18:23 +01:00
|
|
|
else if (det > 0.0f)
|
2009-10-08 12:15:12 +01:00
|
|
|
triangle_cw( setup, v0, v1, v2 );
|
2009-10-07 22:36:43 +01:00
|
|
|
}
|
|
|
|
|
2010-01-14 01:01:45 +00:00
|
|
|
|
2010-03-13 10:45:52 +00:00
|
|
|
static void triangle_nop( struct lp_setup_context *setup,
|
2009-10-07 22:36:43 +01:00
|
|
|
const float (*v0)[4],
|
|
|
|
const float (*v1)[4],
|
|
|
|
const float (*v2)[4] )
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-10-09 10:44:07 +01:00
|
|
|
void
|
2010-03-13 10:45:52 +00:00
|
|
|
lp_setup_choose_triangle( struct lp_setup_context *setup )
|
2009-10-09 10:44:07 +01:00
|
|
|
{
|
2009-10-09 11:29:01 +01:00
|
|
|
switch (setup->cullmode) {
|
2010-05-14 13:04:42 +01:00
|
|
|
case PIPE_FACE_NONE:
|
2009-10-08 12:15:12 +01:00
|
|
|
setup->triangle = triangle_both;
|
2009-10-07 22:36:43 +01:00
|
|
|
break;
|
2010-05-17 18:43:43 +01:00
|
|
|
case PIPE_FACE_BACK:
|
2010-05-14 13:04:42 +01:00
|
|
|
setup->triangle = setup->ccw_is_frontface ? triangle_ccw : triangle_cw;
|
2009-10-07 22:36:43 +01:00
|
|
|
break;
|
2010-05-17 18:43:43 +01:00
|
|
|
case PIPE_FACE_FRONT:
|
2010-05-14 13:04:42 +01:00
|
|
|
setup->triangle = setup->ccw_is_frontface ? triangle_cw : triangle_ccw;
|
2009-10-07 22:36:43 +01:00
|
|
|
break;
|
|
|
|
default:
|
2009-10-08 12:15:12 +01:00
|
|
|
setup->triangle = triangle_nop;
|
2009-10-07 22:36:43 +01:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|