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-10-12 18:59:15 +01:00
|
|
|
#include "util/u_sse.h"
|
2010-01-21 21:59:01 +00:00
|
|
|
#include "lp_perf.h"
|
|
|
|
#include "lp_setup_context.h"
|
|
|
|
#include "lp_rast.h"
|
2010-05-26 15:11:17 +01:00
|
|
|
#include "lp_state_fs.h"
|
2010-09-05 13:17:43 +01:00
|
|
|
#include "lp_state_setup.h"
|
2013-06-19 22:38:39 +01:00
|
|
|
#include "lp_context.h"
|
2009-10-07 22:36:43 +01:00
|
|
|
|
2013-10-25 03:05:22 +01:00
|
|
|
#include <inttypes.h>
|
|
|
|
|
2009-10-09 10:23:53 +01:00
|
|
|
#define NUM_CHANNELS 4
|
2009-10-07 22:36:43 +01:00
|
|
|
|
2010-10-12 18:59:15 +01:00
|
|
|
#if defined(PIPE_ARCH_SSE)
|
|
|
|
#include <emmintrin.h>
|
|
|
|
#endif
|
2013-10-25 03:05:22 +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)
|
|
|
|
{
|
2013-03-28 23:17:26 +00:00
|
|
|
return a * (1.0f / FIXED_ONE);
|
2010-06-17 21:19:09 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2012-05-14 16:00:06 +01:00
|
|
|
/* Position and area in fixed point coordinates */
|
|
|
|
struct fixed_position {
|
2013-10-25 03:05:22 +01:00
|
|
|
int32_t x[4];
|
|
|
|
int32_t y[4];
|
|
|
|
int64_t area;
|
|
|
|
int32_t dx01;
|
|
|
|
int32_t dy01;
|
|
|
|
int32_t dx20;
|
|
|
|
int32_t dy20;
|
2012-05-14 16:00:06 +01: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
|
2010-09-05 13:17:43 +01:00
|
|
|
* \param num_inputs number of fragment shader inputs
|
2010-01-22 02:04:53 +00:00
|
|
|
* \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);
|
2010-10-15 12:23:22 +01:00
|
|
|
unsigned plane_sz = nr_planes * sizeof(struct lp_rast_plane);
|
2010-01-22 02:04:53 +00:00
|
|
|
struct lp_rast_triangle *tri;
|
|
|
|
|
2010-10-15 12:23:22 +01:00
|
|
|
*tri_size = (sizeof(struct lp_rast_triangle) +
|
|
|
|
3 * input_array_sz +
|
|
|
|
plane_sz);
|
2010-01-22 02:04:53 +00:00
|
|
|
|
2010-10-15 12:23:22 +01:00
|
|
|
tri = lp_scene_alloc_aligned( scene, *tri_size, 16 );
|
2010-10-18 02:48:11 +01:00
|
|
|
if (tri == NULL)
|
|
|
|
return NULL;
|
2010-01-22 02:04:53 +00:00
|
|
|
|
2010-10-18 02:48:11 +01:00
|
|
|
tri->inputs.stride = input_array_sz;
|
2010-01-22 02:04:53 +00:00
|
|
|
|
2010-10-15 12:23:22 +01:00
|
|
|
{
|
|
|
|
char *a = (char *)tri;
|
|
|
|
char *b = (char *)&GET_PLANES(tri)[nr_planes];
|
|
|
|
assert(b - a == *tri_size);
|
2010-05-28 19:49:49 +01:00
|
|
|
}
|
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])
|
|
|
|
{
|
2010-09-05 13:17:43 +01:00
|
|
|
const struct lp_setup_variant_key *key = &setup->setup.variant->key;
|
2010-08-24 19:58:54 +01:00
|
|
|
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]);
|
|
|
|
|
2010-09-05 13:17:43 +01:00
|
|
|
for (i = 0; i < key->num_inputs; i++) {
|
|
|
|
const float *in = v[key->inputs[i].src_index];
|
2010-08-24 19:58:54 +01:00
|
|
|
|
|
|
|
debug_printf(" in[%d] (%s[%d]) %s%s%s%s ",
|
|
|
|
i,
|
2010-09-05 13:17:43 +01:00
|
|
|
name, key->inputs[i].src_index,
|
|
|
|
(key->inputs[i].usage_mask & 0x1) ? "x" : " ",
|
|
|
|
(key->inputs[i].usage_mask & 0x2) ? "y" : " ",
|
|
|
|
(key->inputs[i].usage_mask & 0x4) ? "z" : " ",
|
|
|
|
(key->inputs[i].usage_mask & 0x8) ? "w" : " ");
|
2010-08-24 19:58:54 +01:00
|
|
|
|
|
|
|
for (j = 0; j < 4; j++)
|
2010-09-05 13:17:43 +01:00
|
|
|
if (key->inputs[i].usage_mask & (1<<j))
|
2010-08-24 19:58:54 +01:00
|
|
|
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-09-24 11:18:38 +01:00
|
|
|
#define MAX_PLANES 8
|
2010-09-07 14:02:15 +01:00
|
|
|
static unsigned
|
2010-09-24 11:18:38 +01:00
|
|
|
lp_rast_tri_tab[MAX_PLANES+1] = {
|
2010-09-07 14:02:15 +01:00
|
|
|
0, /* should be impossible */
|
|
|
|
LP_RAST_OP_TRIANGLE_1,
|
|
|
|
LP_RAST_OP_TRIANGLE_2,
|
|
|
|
LP_RAST_OP_TRIANGLE_3,
|
|
|
|
LP_RAST_OP_TRIANGLE_4,
|
|
|
|
LP_RAST_OP_TRIANGLE_5,
|
|
|
|
LP_RAST_OP_TRIANGLE_6,
|
|
|
|
LP_RAST_OP_TRIANGLE_7,
|
|
|
|
LP_RAST_OP_TRIANGLE_8
|
2010-06-17 21:19:09 +01:00
|
|
|
};
|
|
|
|
|
2013-10-25 03:05:22 +01:00
|
|
|
static unsigned
|
|
|
|
lp_rast_32_tri_tab[MAX_PLANES+1] = {
|
|
|
|
0, /* should be impossible */
|
|
|
|
LP_RAST_OP_TRIANGLE_32_1,
|
|
|
|
LP_RAST_OP_TRIANGLE_32_2,
|
|
|
|
LP_RAST_OP_TRIANGLE_32_3,
|
|
|
|
LP_RAST_OP_TRIANGLE_32_4,
|
|
|
|
LP_RAST_OP_TRIANGLE_32_5,
|
|
|
|
LP_RAST_OP_TRIANGLE_32_6,
|
|
|
|
LP_RAST_OP_TRIANGLE_32_7,
|
|
|
|
LP_RAST_OP_TRIANGLE_32_8
|
|
|
|
};
|
|
|
|
|
2010-08-27 17:51:21 +01:00
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* The primitive covers the whole tile- shade whole tile.
|
|
|
|
*
|
|
|
|
* \param tx, ty the tile position in tiles, not pixels
|
|
|
|
*/
|
2010-08-27 17:49:40 +01:00
|
|
|
static boolean
|
2010-08-27 17:51:21 +01:00
|
|
|
lp_setup_whole_tile(struct lp_setup_context *setup,
|
|
|
|
const struct lp_rast_shader_inputs *inputs,
|
|
|
|
int tx, int ty)
|
|
|
|
{
|
|
|
|
struct lp_scene *scene = setup->scene;
|
|
|
|
|
|
|
|
LP_COUNT(nr_fully_covered_64);
|
|
|
|
|
|
|
|
/* if variant is opaque and scissor doesn't effect the tile */
|
2013-06-27 17:54:10 +01:00
|
|
|
if (inputs->opaque) {
|
|
|
|
/* Several things prevent this optimization from working:
|
|
|
|
* - For layered rendering we can't determine if this covers the same layer
|
|
|
|
* as previous rendering (or in case of clears those actually always cover
|
|
|
|
* all layers so optimization is impossible). Need to use fb_max_layer and
|
|
|
|
* not setup->layer_slot to determine this since even if there's currently
|
|
|
|
* no slot assigned previous rendering could have used one.
|
|
|
|
* - If there were any Begin/End query commands in the scene then those
|
|
|
|
* would get removed which would be very wrong. Furthermore, if queries
|
|
|
|
* were just active we also can't do the optimization since to get
|
|
|
|
* accurate query results we unfortunately need to execute the rendering
|
|
|
|
* commands.
|
|
|
|
*/
|
|
|
|
if (!scene->fb.zsbuf && scene->fb_max_layer == 0 && !scene->had_queries) {
|
2010-08-27 17:51:21 +01:00
|
|
|
/*
|
|
|
|
* All previous rendering will be overwritten so reset the bin.
|
|
|
|
*/
|
|
|
|
lp_scene_bin_reset( scene, tx, ty );
|
|
|
|
}
|
|
|
|
|
|
|
|
LP_COUNT(nr_shade_opaque_64);
|
2010-10-14 23:28:10 +01:00
|
|
|
return lp_scene_bin_cmd_with_state( scene, tx, ty,
|
|
|
|
setup->fs.stored,
|
|
|
|
LP_RAST_OP_SHADE_TILE_OPAQUE,
|
|
|
|
lp_rast_arg_inputs(inputs) );
|
2010-08-27 17:51:21 +01:00
|
|
|
} else {
|
|
|
|
LP_COUNT(nr_shade_64);
|
2010-10-14 23:28:10 +01:00
|
|
|
return lp_scene_bin_cmd_with_state( scene, tx, ty,
|
|
|
|
setup->fs.stored,
|
|
|
|
LP_RAST_OP_SHADE_TILE,
|
|
|
|
lp_rast_arg_inputs(inputs) );
|
2010-08-27 17:51:21 +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-08-27 17:49:40 +01:00
|
|
|
static boolean
|
2010-03-13 10:45:52 +00:00
|
|
|
do_triangle_ccw(struct lp_setup_context *setup,
|
2012-05-14 16:00:06 +01:00
|
|
|
struct fixed_position* position,
|
|
|
|
const float (*v0)[4],
|
|
|
|
const float (*v1)[4],
|
|
|
|
const float (*v2)[4],
|
|
|
|
boolean frontfacing )
|
2009-10-07 22:36:43 +01:00
|
|
|
{
|
2010-09-07 14:02:15 +01:00
|
|
|
struct lp_scene *scene = setup->scene;
|
2010-09-05 13:17:43 +01:00
|
|
|
const struct lp_setup_variant_key *key = &setup->setup.variant->key;
|
2010-01-22 02:04:53 +00:00
|
|
|
struct lp_rast_triangle *tri;
|
2010-10-15 12:23:22 +01:00
|
|
|
struct lp_rast_plane *plane;
|
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 nr_planes = 3;
|
2013-05-24 21:28:19 +01:00
|
|
|
unsigned scissor_index = 0;
|
2013-06-07 20:03:40 +01:00
|
|
|
unsigned layer = 0;
|
2010-09-07 14:02:15 +01:00
|
|
|
|
2012-05-14 16:00:06 +01:00
|
|
|
/* Area should always be positive here */
|
|
|
|
assert(position->area > 0);
|
|
|
|
|
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;
|
2013-05-24 21:28:19 +01:00
|
|
|
if (setup->viewport_index_slot > 0) {
|
|
|
|
unsigned *udata = (unsigned*)v0[setup->viewport_index_slot];
|
2013-05-25 06:04:17 +01:00
|
|
|
scissor_index = lp_clamp_scissor_idx(*udata);
|
2013-05-24 21:28:19 +01:00
|
|
|
}
|
2010-06-17 21:19:09 +01:00
|
|
|
}
|
|
|
|
else {
|
|
|
|
nr_planes = 3;
|
|
|
|
}
|
2013-06-07 20:03:40 +01:00
|
|
|
if (setup->layer_slot > 0) {
|
|
|
|
layer = *(unsigned*)v1[setup->layer_slot];
|
|
|
|
layer = MIN2(layer, scene->fb_max_layer);
|
|
|
|
}
|
2010-06-17 21:19:09 +01:00
|
|
|
|
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;
|
|
|
|
|
2012-05-10 17:15:28 +01:00
|
|
|
/* Inclusive x0, exclusive x1 */
|
2012-05-14 16:00:06 +01:00
|
|
|
bbox.x0 = MIN3(position->x[0], position->x[1], position->x[2]) >> FIXED_ORDER;
|
|
|
|
bbox.x1 = (MAX3(position->x[0], position->x[1], position->x[2]) - 1) >> FIXED_ORDER;
|
2010-08-24 20:04:08 +01:00
|
|
|
|
2012-05-10 17:15:28 +01:00
|
|
|
/* Inclusive / exclusive depending upon adj (bottom-left or top-right) */
|
2012-05-14 16:00:06 +01:00
|
|
|
bbox.y0 = (MIN3(position->y[0], position->y[1], position->y[2]) + adj) >> FIXED_ORDER;
|
|
|
|
bbox.y1 = (MAX3(position->y[0], position->y[1], position->y[2]) - 1 + adj) >> FIXED_ORDER;
|
2010-08-24 20:04:08 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
if (bbox.x1 < bbox.x0 ||
|
|
|
|
bbox.y1 < bbox.y0) {
|
|
|
|
if (0) debug_printf("empty bounding box\n");
|
|
|
|
LP_COUNT(nr_culled_tris);
|
2010-09-07 14:02:15 +01:00
|
|
|
return TRUE;
|
2010-08-24 20:04:08 +01:00
|
|
|
}
|
|
|
|
|
2013-05-24 21:28:19 +01:00
|
|
|
if (!u_rect_test_intersection(&setup->draw_regions[scissor_index], &bbox)) {
|
2010-08-24 20:04:08 +01:00
|
|
|
if (0) debug_printf("offscreen\n");
|
|
|
|
LP_COUNT(nr_culled_tris);
|
2010-09-07 14:02:15 +01:00
|
|
|
return TRUE;
|
2010-08-24 20:04:08 +01:00
|
|
|
}
|
|
|
|
|
2010-11-02 14:20:20 +00:00
|
|
|
/* Can safely discard negative regions, but need to keep hold of
|
|
|
|
* information about when the triangle extends past screen
|
|
|
|
* boundaries. See trimmed_box in lp_setup_bin_triangle().
|
|
|
|
*/
|
|
|
|
bbox.x0 = MAX2(bbox.x0, 0);
|
|
|
|
bbox.y0 = MAX2(bbox.y0, 0);
|
2010-06-17 21:19:09 +01:00
|
|
|
|
2010-07-19 15:23:09 +01:00
|
|
|
tri = lp_setup_alloc_triangle(scene,
|
2010-09-05 13:17:43 +01:00
|
|
|
key->num_inputs,
|
2010-07-19 15:23:09 +01:00
|
|
|
nr_planes,
|
|
|
|
&tri_bytes);
|
2010-05-28 19:49:49 +01:00
|
|
|
if (!tri)
|
2010-08-27 17:49:40 +01:00
|
|
|
return FALSE;
|
2009-10-09 15:52:18 +01:00
|
|
|
|
2010-10-15 12:23:22 +01:00
|
|
|
#if 0
|
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-01-21 21:59:01 +00:00
|
|
|
LP_COUNT(nr_tris);
|
|
|
|
|
2009-10-07 22:36:43 +01:00
|
|
|
/* Setup parameter interpolants:
|
|
|
|
*/
|
2010-09-05 13:17:43 +01:00
|
|
|
setup->setup.variant->jit_function( v0,
|
|
|
|
v1,
|
|
|
|
v2,
|
|
|
|
frontfacing,
|
2010-10-18 03:03:42 +01:00
|
|
|
GET_A0(&tri->inputs),
|
|
|
|
GET_DADX(&tri->inputs),
|
2010-10-18 03:23:40 +01:00
|
|
|
GET_DADY(&tri->inputs) );
|
2009-10-07 22:36:43 +01:00
|
|
|
|
2010-10-15 00:12:19 +01:00
|
|
|
tri->inputs.frontfacing = frontfacing;
|
2010-08-27 17:49:40 +01:00
|
|
|
tri->inputs.disable = FALSE;
|
2010-09-07 14:02:15 +01:00
|
|
|
tri->inputs.opaque = setup->fs.current.variant->opaque;
|
2013-06-07 20:03:40 +01:00
|
|
|
tri->inputs.layer = layer;
|
2010-03-18 19:02:53 +00:00
|
|
|
|
2010-09-05 13:17:43 +01:00
|
|
|
if (0)
|
|
|
|
lp_dump_setup_coef(&setup->setup.variant->key,
|
2010-10-18 03:03:42 +01:00
|
|
|
(const float (*)[4])GET_A0(&tri->inputs),
|
|
|
|
(const float (*)[4])GET_DADX(&tri->inputs),
|
|
|
|
(const float (*)[4])GET_DADY(&tri->inputs));
|
|
|
|
|
2010-10-12 18:59:15 +01:00
|
|
|
plane = GET_PLANES(tri);
|
|
|
|
|
|
|
|
#if defined(PIPE_ARCH_SSE)
|
2013-10-25 03:05:22 +01:00
|
|
|
if (setup->fb.width <= MAX_FIXED_LENGTH32 &&
|
|
|
|
setup->fb.height <= MAX_FIXED_LENGTH32 &&
|
|
|
|
(bbox.x1 - bbox.x0) <= MAX_FIXED_LENGTH32 &&
|
|
|
|
(bbox.y1 - bbox.y0) <= MAX_FIXED_LENGTH32) {
|
2010-10-12 18:59:15 +01:00
|
|
|
__m128i vertx, verty;
|
|
|
|
__m128i shufx, shufy;
|
|
|
|
__m128i dcdx, dcdy, c;
|
|
|
|
__m128i unused;
|
|
|
|
__m128i dcdx_neg_mask;
|
|
|
|
__m128i dcdy_neg_mask;
|
|
|
|
__m128i dcdx_zero_mask;
|
|
|
|
__m128i top_left_flag;
|
|
|
|
__m128i c_inc_mask, c_inc;
|
|
|
|
__m128i eo, p0, p1, p2;
|
|
|
|
__m128i zero = _mm_setzero_si128();
|
2013-10-25 03:05:22 +01:00
|
|
|
PIPE_ALIGN_VAR(16) int32_t temp_vec[4];
|
2010-10-12 18:59:15 +01:00
|
|
|
|
2012-05-14 16:00:06 +01:00
|
|
|
vertx = _mm_loadu_si128((__m128i *)position->x); /* vertex x coords */
|
|
|
|
verty = _mm_loadu_si128((__m128i *)position->y); /* vertex y coords */
|
2010-10-12 18:59:15 +01:00
|
|
|
|
|
|
|
shufx = _mm_shuffle_epi32(vertx, _MM_SHUFFLE(3,0,2,1));
|
|
|
|
shufy = _mm_shuffle_epi32(verty, _MM_SHUFFLE(3,0,2,1));
|
|
|
|
|
|
|
|
dcdx = _mm_sub_epi32(verty, shufy);
|
|
|
|
dcdy = _mm_sub_epi32(vertx, shufx);
|
|
|
|
|
|
|
|
dcdx_neg_mask = _mm_srai_epi32(dcdx, 31);
|
|
|
|
dcdx_zero_mask = _mm_cmpeq_epi32(dcdx, zero);
|
|
|
|
dcdy_neg_mask = _mm_srai_epi32(dcdy, 31);
|
|
|
|
|
2013-04-23 19:40:05 +01:00
|
|
|
top_left_flag = _mm_set1_epi32((setup->bottom_edge_rule == 0) ? ~0 : 0);
|
2010-10-12 18:59:15 +01:00
|
|
|
|
|
|
|
c_inc_mask = _mm_or_si128(dcdx_neg_mask,
|
|
|
|
_mm_and_si128(dcdx_zero_mask,
|
|
|
|
_mm_xor_si128(dcdy_neg_mask,
|
|
|
|
top_left_flag)));
|
2009-10-07 22:36:43 +01:00
|
|
|
|
2010-10-12 18:59:15 +01:00
|
|
|
c_inc = _mm_srli_epi32(c_inc_mask, 31);
|
|
|
|
|
|
|
|
c = _mm_sub_epi32(mm_mullo_epi32(dcdx, vertx),
|
|
|
|
mm_mullo_epi32(dcdy, verty));
|
|
|
|
|
|
|
|
c = _mm_add_epi32(c, c_inc);
|
|
|
|
|
|
|
|
/* Scale up to match c:
|
2010-06-17 21:19:09 +01:00
|
|
|
*/
|
2010-10-12 18:59:15 +01:00
|
|
|
dcdx = _mm_slli_epi32(dcdx, FIXED_ORDER);
|
|
|
|
dcdy = _mm_slli_epi32(dcdy, FIXED_ORDER);
|
|
|
|
|
|
|
|
/* Calculate trivial reject values:
|
|
|
|
*/
|
|
|
|
eo = _mm_sub_epi32(_mm_andnot_si128(dcdy_neg_mask, dcdy),
|
|
|
|
_mm_and_si128(dcdx_neg_mask, dcdx));
|
|
|
|
|
|
|
|
/* ei = _mm_sub_epi32(_mm_sub_epi32(dcdy, dcdx), eo); */
|
|
|
|
|
|
|
|
/* Pointless transpose which gets undone immediately in
|
|
|
|
* rasterization:
|
|
|
|
*/
|
|
|
|
transpose4_epi32(&c, &dcdx, &dcdy, &eo,
|
|
|
|
&p0, &p1, &p2, &unused);
|
|
|
|
|
2013-10-25 03:05:22 +01:00
|
|
|
#define STORE_PLANE(plane, vec) do { \
|
|
|
|
_mm_store_si128((__m128i *)&temp_vec, vec); \
|
|
|
|
plane.c = (int64_t)temp_vec[0]; \
|
|
|
|
plane.dcdx = temp_vec[1]; \
|
|
|
|
plane.dcdy = temp_vec[2]; \
|
|
|
|
plane.eo = temp_vec[3]; \
|
|
|
|
} while(0)
|
|
|
|
|
|
|
|
STORE_PLANE(plane[0], p0);
|
|
|
|
STORE_PLANE(plane[1], p1);
|
|
|
|
STORE_PLANE(plane[2], p2);
|
|
|
|
#undef STORE_PLANE
|
|
|
|
} else
|
|
|
|
#endif
|
2010-10-12 18:59:15 +01:00
|
|
|
{
|
|
|
|
int i;
|
2012-05-14 16:00:06 +01:00
|
|
|
plane[0].dcdy = position->dx01;
|
|
|
|
plane[1].dcdy = position->x[1] - position->x[2];
|
|
|
|
plane[2].dcdy = position->dx20;
|
|
|
|
plane[0].dcdx = position->dy01;
|
|
|
|
plane[1].dcdx = position->y[1] - position->y[2];
|
|
|
|
plane[2].dcdx = position->dy20;
|
2010-10-12 18:59:15 +01:00
|
|
|
|
|
|
|
for (i = 0; i < 3; i++) {
|
|
|
|
/* half-edge constants, will be interated over the whole render
|
|
|
|
* target.
|
|
|
|
*/
|
2013-10-25 03:05:22 +01:00
|
|
|
plane[i].c = IMUL64(plane[i].dcdx, position->x[i]) -
|
|
|
|
IMUL64(plane[i].dcdy, position->y[i]);
|
2010-10-12 18:59:15 +01:00
|
|
|
|
2013-04-23 19:40:05 +01:00
|
|
|
/* correct for top-left vs. bottom-left fill convention.
|
2010-10-12 18:59:15 +01:00
|
|
|
*/
|
|
|
|
if (plane[i].dcdx < 0) {
|
|
|
|
/* both fill conventions want this - adjust for left edges */
|
|
|
|
plane[i].c++;
|
2010-06-17 21:19:09 +01:00
|
|
|
}
|
2010-10-12 18:59:15 +01:00
|
|
|
else if (plane[i].dcdx == 0) {
|
2013-04-23 19:40:05 +01:00
|
|
|
if (setup->bottom_edge_rule == 0){
|
2010-10-12 18:59:15 +01:00
|
|
|
/* correct for top-left fill convention:
|
|
|
|
*/
|
|
|
|
if (plane[i].dcdy > 0) plane[i].c++;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
/* correct for bottom-left fill convention:
|
|
|
|
*/
|
|
|
|
if (plane[i].dcdy < 0) plane[i].c++;
|
|
|
|
}
|
2010-06-17 21:19:09 +01:00
|
|
|
}
|
2009-10-07 22:36:43 +01:00
|
|
|
|
2013-10-25 03:05:22 +01:00
|
|
|
/* Scale up to match c:
|
|
|
|
*/
|
|
|
|
assert((plane[i].dcdx << FIXED_ORDER) >> FIXED_ORDER == plane[i].dcdx);
|
|
|
|
assert((plane[i].dcdy << FIXED_ORDER) >> FIXED_ORDER == plane[i].dcdy);
|
|
|
|
plane[i].dcdx <<= FIXED_ORDER;
|
|
|
|
plane[i].dcdy <<= FIXED_ORDER;
|
2009-10-07 22:36:43 +01:00
|
|
|
|
2010-10-12 18:59:15 +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[i].eo = 0;
|
|
|
|
if (plane[i].dcdx < 0) plane[i].eo -= plane[i].dcdx;
|
|
|
|
if (plane[i].dcdy > 0) plane[i].eo += plane[i].dcdy;
|
|
|
|
}
|
|
|
|
}
|
2009-10-07 22:36:43 +01:00
|
|
|
|
2010-10-12 18:59:15 +01:00
|
|
|
if (0) {
|
2013-10-25 03:05:22 +01:00
|
|
|
debug_printf("p0: %"PRIx64"/%08x/%08x/%"PRIx64"\n",
|
2010-10-12 18:59:15 +01:00
|
|
|
plane[0].c,
|
|
|
|
plane[0].dcdx,
|
|
|
|
plane[0].dcdy,
|
|
|
|
plane[0].eo);
|
|
|
|
|
2013-10-25 03:05:22 +01:00
|
|
|
debug_printf("p1: %"PRIx64"/%08x/%08x/%"PRIx64"\n",
|
2010-10-12 18:59:15 +01:00
|
|
|
plane[1].c,
|
|
|
|
plane[1].dcdx,
|
|
|
|
plane[1].dcdy,
|
|
|
|
plane[1].eo);
|
|
|
|
|
2013-10-25 03:05:22 +01:00
|
|
|
debug_printf("p2: %"PRIx64"/%08x/%08x/%"PRIx64"\n",
|
2010-10-12 18:59:15 +01:00
|
|
|
plane[2].c,
|
|
|
|
plane[2].dcdx,
|
|
|
|
plane[2].dcdy,
|
|
|
|
plane[2].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) {
|
2013-05-24 21:28:19 +01:00
|
|
|
const struct u_rect *scissor = &setup->scissors[scissor_index];
|
2010-11-02 14:20:20 +00:00
|
|
|
|
2010-10-15 12:23:22 +01:00
|
|
|
plane[3].dcdx = -1;
|
|
|
|
plane[3].dcdy = 0;
|
2010-11-02 14:20:20 +00:00
|
|
|
plane[3].c = 1-scissor->x0;
|
2010-10-15 12:23:22 +01:00
|
|
|
plane[3].eo = 1;
|
|
|
|
|
|
|
|
plane[4].dcdx = 1;
|
|
|
|
plane[4].dcdy = 0;
|
2010-11-02 14:20:20 +00:00
|
|
|
plane[4].c = scissor->x1+1;
|
2010-10-15 12:23:22 +01:00
|
|
|
plane[4].eo = 0;
|
|
|
|
|
|
|
|
plane[5].dcdx = 0;
|
|
|
|
plane[5].dcdy = 1;
|
2010-11-02 14:20:20 +00:00
|
|
|
plane[5].c = 1-scissor->y0;
|
2010-10-15 12:23:22 +01:00
|
|
|
plane[5].eo = 1;
|
|
|
|
|
|
|
|
plane[6].dcdx = 0;
|
|
|
|
plane[6].dcdy = -1;
|
2010-11-02 14:20:20 +00:00
|
|
|
plane[6].c = scissor->y1+1;
|
2010-10-15 12:23:22 +01:00
|
|
|
plane[6].eo = 0;
|
2010-06-17 21:19:09 +01:00
|
|
|
}
|
|
|
|
|
2013-06-07 20:03:40 +01:00
|
|
|
return lp_setup_bin_triangle(setup, tri, &bbox, nr_planes, scissor_index);
|
2010-08-26 20:09:22 +01:00
|
|
|
}
|
|
|
|
|
2010-09-07 23:10:11 +01:00
|
|
|
/*
|
2010-09-13 12:03:07 +01:00
|
|
|
* Round to nearest less or equal power of two of the input.
|
2010-09-07 23:10:11 +01:00
|
|
|
*
|
2010-09-13 12:03:07 +01:00
|
|
|
* Undefined if no bit set exists, so code should check against 0 first.
|
2010-09-07 23:10:11 +01:00
|
|
|
*/
|
2010-09-13 12:03:07 +01:00
|
|
|
static INLINE uint32_t
|
|
|
|
floor_pot(uint32_t n)
|
2010-09-07 23:10:11 +01:00
|
|
|
{
|
2010-09-13 12:03:07 +01:00
|
|
|
#if defined(PIPE_CC_GCC) && defined(PIPE_ARCH_X86)
|
2010-09-15 16:28:49 +01:00
|
|
|
if (n == 0)
|
|
|
|
return 0;
|
|
|
|
|
2010-09-13 18:57:35 +01:00
|
|
|
__asm__("bsr %1,%0"
|
|
|
|
: "=r" (n)
|
|
|
|
: "rm" (n));
|
2010-09-13 12:03:07 +01:00
|
|
|
return 1 << n;
|
2010-09-07 23:10:11 +01:00
|
|
|
#else
|
2010-09-13 12:03:07 +01:00
|
|
|
n |= (n >> 1);
|
|
|
|
n |= (n >> 2);
|
|
|
|
n |= (n >> 4);
|
|
|
|
n |= (n >> 8);
|
|
|
|
n |= (n >> 16);
|
|
|
|
return n - (n >> 1);
|
2010-09-07 23:10:11 +01:00
|
|
|
#endif
|
2010-09-13 12:03:07 +01:00
|
|
|
}
|
2010-09-07 23:10:11 +01:00
|
|
|
|
2010-08-26 20:09:22 +01:00
|
|
|
|
2010-08-27 17:49:40 +01:00
|
|
|
boolean
|
2010-08-26 20:09:22 +01:00
|
|
|
lp_setup_bin_triangle( struct lp_setup_context *setup,
|
|
|
|
struct lp_rast_triangle *tri,
|
|
|
|
const struct u_rect *bbox,
|
2013-05-24 21:28:19 +01:00
|
|
|
int nr_planes,
|
|
|
|
unsigned scissor_index )
|
2010-08-26 20:09:22 +01:00
|
|
|
{
|
|
|
|
struct lp_scene *scene = setup->scene;
|
2010-11-02 14:20:20 +00:00
|
|
|
struct u_rect trimmed_box = *bbox;
|
2010-08-26 20:09:22 +01:00
|
|
|
int i;
|
2010-09-07 23:10:11 +01:00
|
|
|
/* What is the largest power-of-two boundary this triangle crosses:
|
2009-12-04 00:27:10 +00:00
|
|
|
*/
|
2010-09-13 12:03:07 +01:00
|
|
|
int dx = floor_pot((bbox->x0 ^ bbox->x1) |
|
|
|
|
(bbox->y0 ^ bbox->y1));
|
2009-12-04 00:27:10 +00:00
|
|
|
|
2010-09-07 23:10:11 +01:00
|
|
|
/* The largest dimension of the rasterized area of the triangle
|
2010-09-13 12:03:07 +01:00
|
|
|
* (aligned to a 4x4 grid), rounded down to the nearest power of two:
|
2009-11-30 21:02:01 +00:00
|
|
|
*/
|
2013-10-25 03:05:22 +01:00
|
|
|
int max_sz = ((bbox->x1 - (bbox->x0 & ~3)) |
|
|
|
|
(bbox->y1 - (bbox->y0 & ~3)));
|
|
|
|
int sz = floor_pot(max_sz);
|
|
|
|
boolean use_32bits = max_sz <= MAX_FIXED_LENGTH32;
|
2010-09-07 23:10:11 +01:00
|
|
|
|
2010-11-02 14:20:20 +00:00
|
|
|
/* Now apply scissor, etc to the bounding box. Could do this
|
|
|
|
* earlier, but it confuses the logic for tri-16 and would force
|
|
|
|
* the rasterizer to also respect scissor, etc, just for the rare
|
|
|
|
* cases where a small triangle extends beyond the scissor.
|
|
|
|
*/
|
2013-05-24 21:28:19 +01:00
|
|
|
u_rect_find_intersection(&setup->draw_regions[scissor_index],
|
|
|
|
&trimmed_box);
|
2010-11-02 14:20:20 +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-09-07 23:10:11 +01:00
|
|
|
if (dx < TILE_SIZE)
|
2009-10-07 22:36:43 +01:00
|
|
|
{
|
2010-09-07 23:10:11 +01:00
|
|
|
int ix0 = bbox->x0 / TILE_SIZE;
|
|
|
|
int iy0 = bbox->y0 / TILE_SIZE;
|
2011-10-05 11:31:15 +01:00
|
|
|
unsigned px = bbox->x0 & 63 & ~3;
|
|
|
|
unsigned py = bbox->y0 & 63 & ~3;
|
2010-09-07 23:10:11 +01:00
|
|
|
|
|
|
|
assert(iy0 == bbox->y1 / TILE_SIZE &&
|
|
|
|
ix0 == bbox->x1 / TILE_SIZE);
|
|
|
|
|
2010-09-23 19:56:48 +01:00
|
|
|
if (nr_planes == 3) {
|
|
|
|
if (sz < 4)
|
|
|
|
{
|
|
|
|
/* Triangle is contained in a single 4x4 stamp:
|
|
|
|
*/
|
2011-10-05 11:31:15 +01:00
|
|
|
assert(px + 4 <= TILE_SIZE);
|
|
|
|
assert(py + 4 <= TILE_SIZE);
|
2010-10-14 23:28:10 +01:00
|
|
|
return lp_scene_bin_cmd_with_state( scene, ix0, iy0,
|
|
|
|
setup->fs.stored,
|
2013-10-25 03:05:22 +01:00
|
|
|
use_32bits ?
|
|
|
|
LP_RAST_OP_TRIANGLE_32_3_4 :
|
2010-10-14 23:28:10 +01:00
|
|
|
LP_RAST_OP_TRIANGLE_3_4,
|
2011-10-05 13:27:08 +01:00
|
|
|
lp_rast_arg_triangle_contained(tri, px, py) );
|
2010-09-23 19:56:48 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
if (sz < 16)
|
|
|
|
{
|
|
|
|
/* Triangle is contained in a single 16x16 block:
|
|
|
|
*/
|
2011-10-05 13:27:08 +01:00
|
|
|
|
|
|
|
/*
|
|
|
|
* The 16x16 block is only 4x4 aligned, and can exceed the tile
|
|
|
|
* dimensions if the triangle is 16 pixels in one dimension but 4
|
|
|
|
* in the other. So budge the 16x16 back inside the tile.
|
|
|
|
*/
|
|
|
|
px = MIN2(px, TILE_SIZE - 16);
|
|
|
|
py = MIN2(py, TILE_SIZE - 16);
|
|
|
|
|
2011-10-05 11:31:15 +01:00
|
|
|
assert(px + 16 <= TILE_SIZE);
|
|
|
|
assert(py + 16 <= TILE_SIZE);
|
2011-10-05 13:27:08 +01:00
|
|
|
|
2010-10-14 23:28:10 +01:00
|
|
|
return lp_scene_bin_cmd_with_state( scene, ix0, iy0,
|
|
|
|
setup->fs.stored,
|
2013-10-25 03:05:22 +01:00
|
|
|
use_32bits ?
|
|
|
|
LP_RAST_OP_TRIANGLE_32_3_16 :
|
2010-10-14 23:28:10 +01:00
|
|
|
LP_RAST_OP_TRIANGLE_3_16,
|
2011-10-05 13:27:08 +01:00
|
|
|
lp_rast_arg_triangle_contained(tri, px, py) );
|
2010-09-23 19:56:48 +01:00
|
|
|
}
|
|
|
|
}
|
2010-10-08 17:21:03 +01:00
|
|
|
else if (nr_planes == 4 && sz < 16)
|
|
|
|
{
|
2011-10-05 13:27:08 +01:00
|
|
|
px = MIN2(px, TILE_SIZE - 16);
|
|
|
|
py = MIN2(py, TILE_SIZE - 16);
|
|
|
|
|
2011-10-05 11:31:15 +01:00
|
|
|
assert(px + 16 <= TILE_SIZE);
|
|
|
|
assert(py + 16 <= TILE_SIZE);
|
2011-10-05 13:27:08 +01:00
|
|
|
|
2010-10-14 23:28:10 +01:00
|
|
|
return lp_scene_bin_cmd_with_state(scene, ix0, iy0,
|
|
|
|
setup->fs.stored,
|
2013-10-25 03:05:22 +01:00
|
|
|
use_32bits ?
|
|
|
|
LP_RAST_OP_TRIANGLE_32_4_16 :
|
2010-10-14 23:28:10 +01:00
|
|
|
LP_RAST_OP_TRIANGLE_4_16,
|
2011-10-05 13:27:08 +01:00
|
|
|
lp_rast_arg_triangle_contained(tri, px, py));
|
2010-10-08 17:21:03 +01:00
|
|
|
}
|
2010-09-23 19:56:48 +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
|
|
|
*/
|
2013-10-25 03:05:22 +01:00
|
|
|
return lp_scene_bin_cmd_with_state(
|
|
|
|
scene, ix0, iy0, setup->fs.stored,
|
|
|
|
use_32bits ? lp_rast_32_tri_tab[nr_planes] : 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-10-15 12:23:22 +01:00
|
|
|
struct lp_rast_plane *plane = GET_PLANES(tri);
|
2013-10-25 03:05:22 +01:00
|
|
|
int64_t c[MAX_PLANES];
|
|
|
|
int64_t ei[MAX_PLANES];
|
2010-11-02 14:20:20 +00:00
|
|
|
|
2013-10-25 03:05:22 +01:00
|
|
|
int64_t eo[MAX_PLANES];
|
|
|
|
int64_t xstep[MAX_PLANES];
|
|
|
|
int64_t ystep[MAX_PLANES];
|
2009-10-07 22:36:43 +01:00
|
|
|
int x, y;
|
2010-09-07 23:10:11 +01:00
|
|
|
|
2010-11-02 14:20:20 +00:00
|
|
|
int ix0 = trimmed_box.x0 / TILE_SIZE;
|
|
|
|
int iy0 = trimmed_box.y0 / TILE_SIZE;
|
|
|
|
int ix1 = trimmed_box.x1 / TILE_SIZE;
|
|
|
|
int iy1 = trimmed_box.y1 / TILE_SIZE;
|
2010-06-17 21:19:09 +01:00
|
|
|
|
|
|
|
for (i = 0; i < nr_planes; i++) {
|
2010-10-15 12:23:22 +01:00
|
|
|
c[i] = (plane[i].c +
|
2013-10-25 03:05:22 +01:00
|
|
|
IMUL64(plane[i].dcdy, iy0) * TILE_SIZE -
|
|
|
|
IMUL64(plane[i].dcdx, ix0) * TILE_SIZE);
|
2010-10-15 12:23:22 +01:00
|
|
|
|
2010-10-15 13:04:19 +01:00
|
|
|
ei[i] = (plane[i].dcdy -
|
|
|
|
plane[i].dcdx -
|
|
|
|
plane[i].eo) << TILE_ORDER;
|
|
|
|
|
2010-10-15 12:23:22 +01:00
|
|
|
eo[i] = plane[i].eo << TILE_ORDER;
|
2013-10-25 03:05:22 +01:00
|
|
|
xstep[i] = -(((int64_t)plane[i].dcdx) << TILE_ORDER);
|
|
|
|
ystep[i] = ((int64_t)plane[i].dcdy) << TILE_ORDER;
|
2010-06-17 21:19:09 +01:00
|
|
|
}
|
|
|
|
|
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
|
|
|
{
|
2013-10-25 03:05:22 +01:00
|
|
|
boolean in = FALSE; /* are we inside the triangle? */
|
|
|
|
int64_t cx[MAX_PLANES];
|
2010-06-17 21:19:09 +01:00
|
|
|
|
|
|
|
for (i = 0; i < nr_planes; i++)
|
|
|
|
cx[i] = c[i];
|
2009-10-07 22:36:43 +01:00
|
|
|
|
2013-10-25 03:05:22 +01:00
|
|
|
for (x = ix0; x <= ix1; x++)
|
|
|
|
{
|
2010-06-17 21:19:09 +01:00
|
|
|
int out = 0;
|
|
|
|
int partial = 0;
|
|
|
|
|
|
|
|
for (i = 0; i < nr_planes; i++) {
|
2013-10-25 03:05:22 +01:00
|
|
|
int64_t planeout = cx[i] + eo[i];
|
|
|
|
int64_t planepartial = cx[i] + ei[i] - 1;
|
|
|
|
out |= (planeout >> 63);
|
|
|
|
partial |= (planepartial >> 63) & (1<<i);
|
2010-06-17 21:19:09 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
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) {
|
2013-10-25 03:05:22 +01:00
|
|
|
/* Not trivially accepted by at least one plane -
|
2010-06-17 21:19:09 +01:00
|
|
|
* rasterize/shade partial tile
|
|
|
|
*/
|
|
|
|
int count = util_bitcount(partial);
|
|
|
|
in = TRUE;
|
2010-10-14 23:28:10 +01:00
|
|
|
|
|
|
|
if (!lp_scene_bin_cmd_with_state( scene, x, y,
|
|
|
|
setup->fs.stored,
|
2013-10-25 03:05:22 +01:00
|
|
|
use_32bits ?
|
|
|
|
lp_rast_32_tri_tab[count] :
|
|
|
|
lp_rast_tri_tab[count],
|
2010-10-14 23:28:10 +01:00
|
|
|
lp_rast_arg_triangle(tri, partial) ))
|
2010-08-27 17:49:40 +01:00
|
|
|
goto fail;
|
2010-06-17 21:19:09 +01:00
|
|
|
|
|
|
|
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;
|
2010-08-27 17:49:40 +01:00
|
|
|
if (!lp_setup_whole_tile(setup, &tri->inputs, x, y))
|
|
|
|
goto fail;
|
2010-06-17 21:19:09 +01:00
|
|
|
}
|
2009-10-07 22:36:43 +01:00
|
|
|
|
2013-10-25 03:05:22 +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];
|
2013-10-25 03:05:22 +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-08-27 17:49:40 +01:00
|
|
|
|
|
|
|
return TRUE;
|
|
|
|
|
|
|
|
fail:
|
|
|
|
/* Need to disable any partially binned triangle. This is easier
|
|
|
|
* than trying to locate all the triangle, shade-tile, etc,
|
|
|
|
* commands which may have been binned.
|
|
|
|
*/
|
|
|
|
tri->inputs.disable = TRUE;
|
|
|
|
return FALSE;
|
2009-10-07 22:36:43 +01:00
|
|
|
}
|
|
|
|
|
2010-01-14 01:01:45 +00:00
|
|
|
|
2010-04-17 19:48:26 +01:00
|
|
|
/**
|
2010-10-08 17:06:05 +01:00
|
|
|
* Try to draw the triangle, restart the scene on failure.
|
2010-04-17 19:48:26 +01:00
|
|
|
*/
|
2010-10-08 17:06:05 +01:00
|
|
|
static void retry_triangle_ccw( struct lp_setup_context *setup,
|
2012-05-14 16:00:06 +01:00
|
|
|
struct fixed_position* position,
|
2010-10-08 17:06:05 +01:00
|
|
|
const float (*v0)[4],
|
|
|
|
const float (*v1)[4],
|
|
|
|
const float (*v2)[4],
|
|
|
|
boolean front)
|
2009-10-07 22:36:43 +01:00
|
|
|
{
|
2012-05-14 16:00:06 +01:00
|
|
|
if (!do_triangle_ccw( setup, position, v0, v1, v2, front ))
|
2010-08-27 17:49:40 +01:00
|
|
|
{
|
2010-10-08 17:01:16 +01:00
|
|
|
if (!lp_setup_flush_and_restart(setup))
|
|
|
|
return;
|
2010-08-27 17:49:40 +01:00
|
|
|
|
2012-05-14 16:00:06 +01:00
|
|
|
if (!do_triangle_ccw( setup, position, v0, v1, v2, front ))
|
2010-10-08 17:01:16 +01:00
|
|
|
return;
|
2010-08-27 17:49:40 +01:00
|
|
|
}
|
2009-10-07 22:36:43 +01:00
|
|
|
}
|
|
|
|
|
2012-05-14 16:00:06 +01:00
|
|
|
/**
|
|
|
|
* Calculate fixed position data for a triangle
|
|
|
|
*/
|
|
|
|
static INLINE void
|
|
|
|
calc_fixed_position( struct lp_setup_context *setup,
|
|
|
|
struct fixed_position* position,
|
|
|
|
const float (*v0)[4],
|
|
|
|
const float (*v1)[4],
|
|
|
|
const float (*v2)[4])
|
2010-10-08 17:06:05 +01:00
|
|
|
{
|
2012-05-14 16:00:06 +01:00
|
|
|
position->x[0] = subpixel_snap(v0[0][0] - setup->pixel_offset);
|
|
|
|
position->x[1] = subpixel_snap(v1[0][0] - setup->pixel_offset);
|
|
|
|
position->x[2] = subpixel_snap(v2[0][0] - setup->pixel_offset);
|
|
|
|
position->x[3] = 0;
|
|
|
|
|
|
|
|
position->y[0] = subpixel_snap(v0[0][1] - setup->pixel_offset);
|
|
|
|
position->y[1] = subpixel_snap(v1[0][1] - setup->pixel_offset);
|
|
|
|
position->y[2] = subpixel_snap(v2[0][1] - setup->pixel_offset);
|
|
|
|
position->y[3] = 0;
|
|
|
|
|
|
|
|
position->dx01 = position->x[0] - position->x[1];
|
|
|
|
position->dy01 = position->y[0] - position->y[1];
|
|
|
|
|
|
|
|
position->dx20 = position->x[2] - position->x[0];
|
|
|
|
position->dy20 = position->y[2] - position->y[0];
|
|
|
|
|
2013-10-25 03:05:22 +01:00
|
|
|
position->area = IMUL64(position->dx01, position->dy20) -
|
|
|
|
IMUL64(position->dx20, position->dy01);
|
2012-05-14 16:00:06 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2012-05-17 08:32:31 +01:00
|
|
|
/**
|
|
|
|
* Rotate a triangle, flipping its clockwise direction,
|
|
|
|
* Swaps values for xy[0] and xy[1]
|
|
|
|
*/
|
|
|
|
static INLINE void
|
|
|
|
rotate_fixed_position_01( struct fixed_position* position )
|
|
|
|
{
|
|
|
|
int x, y;
|
|
|
|
|
|
|
|
x = position->x[1];
|
|
|
|
y = position->y[1];
|
|
|
|
position->x[1] = position->x[0];
|
|
|
|
position->y[1] = position->y[0];
|
|
|
|
position->x[0] = x;
|
|
|
|
position->y[0] = y;
|
|
|
|
|
|
|
|
position->dx01 = -position->dx01;
|
|
|
|
position->dy01 = -position->dy01;
|
|
|
|
position->dx20 = position->x[2] - position->x[0];
|
|
|
|
position->dy20 = position->y[2] - position->y[0];
|
|
|
|
|
|
|
|
position->area = -position->area;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2012-05-14 16:00:06 +01:00
|
|
|
/**
|
|
|
|
* Rotate a triangle, flipping its clockwise direction,
|
|
|
|
* Swaps values for xy[1] and xy[2]
|
|
|
|
*/
|
|
|
|
static INLINE void
|
2012-05-17 08:32:31 +01:00
|
|
|
rotate_fixed_position_12( struct fixed_position* position )
|
2012-05-14 16:00:06 +01:00
|
|
|
{
|
|
|
|
int x, y;
|
|
|
|
|
|
|
|
x = position->x[2];
|
|
|
|
y = position->y[2];
|
|
|
|
position->x[2] = position->x[1];
|
|
|
|
position->y[2] = position->y[1];
|
|
|
|
position->x[1] = x;
|
|
|
|
position->y[1] = y;
|
|
|
|
|
|
|
|
x = position->dx01;
|
|
|
|
y = position->dy01;
|
|
|
|
position->dx01 = -position->dx20;
|
|
|
|
position->dy01 = -position->dy20;
|
|
|
|
position->dx20 = -x;
|
|
|
|
position->dy20 = -y;
|
|
|
|
|
|
|
|
position->area = -position->area;
|
2010-10-08 17:06:05 +01:00
|
|
|
}
|
|
|
|
|
2010-01-14 01:01:45 +00:00
|
|
|
|
2013-03-26 04:02:47 +00:00
|
|
|
typedef void (*triangle_func_t)(struct lp_setup_context *setup,
|
|
|
|
const float (*v0)[4],
|
|
|
|
const float (*v1)[4],
|
|
|
|
const float (*v2)[4]);
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Subdivide this triangle by bisecting edge (v0, v1).
|
|
|
|
* \param pv the provoking vertex (must = v0 or v1 or v2)
|
2013-06-19 22:38:39 +01:00
|
|
|
* TODO: should probably think about non-overflowing arithmetic elsewhere.
|
|
|
|
* This will definitely screw with pipeline counters for instance.
|
2013-03-26 04:02:47 +00:00
|
|
|
*/
|
|
|
|
static void
|
|
|
|
subdiv_tri(struct lp_setup_context *setup,
|
|
|
|
const float (*v0)[4],
|
|
|
|
const float (*v1)[4],
|
|
|
|
const float (*v2)[4],
|
|
|
|
const float (*pv)[4],
|
|
|
|
triangle_func_t tri)
|
|
|
|
{
|
|
|
|
unsigned n = setup->fs.current.variant->shader->info.base.num_inputs + 1;
|
|
|
|
const struct lp_shader_input *inputs =
|
|
|
|
setup->fs.current.variant->shader->inputs;
|
2013-09-23 22:29:39 +01:00
|
|
|
PIPE_ALIGN_VAR(LP_MIN_VECTOR_ALIGN) float vmid[PIPE_MAX_ATTRIBS][4];
|
2013-03-26 04:02:47 +00:00
|
|
|
const float (*vm)[4] = (const float (*)[4]) vmid;
|
|
|
|
unsigned i;
|
|
|
|
float w0, w1, wm;
|
|
|
|
boolean flatshade = setup->fs.current.variant->key.flatshade;
|
|
|
|
|
|
|
|
/* find position midpoint (attrib[0] = position) */
|
|
|
|
vmid[0][0] = 0.5f * (v1[0][0] + v0[0][0]);
|
|
|
|
vmid[0][1] = 0.5f * (v1[0][1] + v0[0][1]);
|
|
|
|
vmid[0][2] = 0.5f * (v1[0][2] + v0[0][2]);
|
|
|
|
vmid[0][3] = 0.5f * (v1[0][3] + v0[0][3]);
|
|
|
|
|
|
|
|
w0 = v0[0][3];
|
|
|
|
w1 = v1[0][3];
|
|
|
|
wm = vmid[0][3];
|
|
|
|
|
|
|
|
/* interpolate other attributes */
|
|
|
|
for (i = 1; i < n; i++) {
|
|
|
|
if ((inputs[i - 1].interp == LP_INTERP_COLOR && flatshade) ||
|
|
|
|
inputs[i - 1].interp == LP_INTERP_CONSTANT) {
|
|
|
|
/* copy the provoking vertex's attribute */
|
|
|
|
vmid[i][0] = pv[i][0];
|
|
|
|
vmid[i][1] = pv[i][1];
|
|
|
|
vmid[i][2] = pv[i][2];
|
|
|
|
vmid[i][3] = pv[i][3];
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
/* interpolate with perspective correction (for linear too) */
|
|
|
|
vmid[i][0] = 0.5f * (v1[i][0] * w1 + v0[i][0] * w0) / wm;
|
|
|
|
vmid[i][1] = 0.5f * (v1[i][1] * w1 + v0[i][1] * w0) / wm;
|
|
|
|
vmid[i][2] = 0.5f * (v1[i][2] * w1 + v0[i][2] * w0) / wm;
|
|
|
|
vmid[i][3] = 0.5f * (v1[i][3] * w1 + v0[i][3] * w0) / wm;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* handling flat shading and first vs. last provoking vertex is a
|
|
|
|
* little tricky...
|
|
|
|
*/
|
|
|
|
if (pv == v0) {
|
|
|
|
if (setup->flatshade_first) {
|
|
|
|
/* first vertex must be v0 or vm */
|
|
|
|
tri(setup, v0, vm, v2);
|
|
|
|
tri(setup, vm, v1, v2);
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
/* last vertex must be v0 or vm */
|
|
|
|
tri(setup, vm, v2, v0);
|
|
|
|
tri(setup, v1, v2, vm);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else if (pv == v1) {
|
|
|
|
if (setup->flatshade_first) {
|
|
|
|
tri(setup, vm, v2, v0);
|
|
|
|
tri(setup, v1, v2, vm);
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
tri(setup, v2, v0, vm);
|
|
|
|
tri(setup, v2, vm, v1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
if (setup->flatshade_first) {
|
|
|
|
tri(setup, v2, v0, vm);
|
|
|
|
tri(setup, v2, vm, v1);
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
tri(setup, v0, vm, v2);
|
|
|
|
tri(setup, vm, v1, v2);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Check the lengths of the edges of the triangle. If any edge is too
|
|
|
|
* long, subdivide the longest edge and draw two sub-triangles.
|
|
|
|
* Note: this may be called recursively.
|
|
|
|
* \return TRUE if triangle was subdivided, FALSE otherwise
|
|
|
|
*/
|
|
|
|
static boolean
|
|
|
|
check_subdivide_triangle(struct lp_setup_context *setup,
|
|
|
|
const float (*v0)[4],
|
|
|
|
const float (*v1)[4],
|
|
|
|
const float (*v2)[4],
|
|
|
|
triangle_func_t tri)
|
|
|
|
{
|
2013-09-26 00:38:33 +01:00
|
|
|
const float maxLen = (float) MAX_FIXED_LENGTH; /* longest permissible edge, in pixels */
|
2013-03-26 04:02:47 +00:00
|
|
|
float dx10, dy10, len10;
|
|
|
|
float dx21, dy21, len21;
|
|
|
|
float dx02, dy02, len02;
|
|
|
|
const float (*pv)[4] = setup->flatshade_first ? v0 : v2;
|
|
|
|
|
|
|
|
/* compute lengths of triangle edges, squared */
|
|
|
|
dx10 = v1[0][0] - v0[0][0];
|
|
|
|
dy10 = v1[0][1] - v0[0][1];
|
|
|
|
len10 = dx10 * dx10 + dy10 * dy10;
|
|
|
|
|
|
|
|
dx21 = v2[0][0] - v1[0][0];
|
|
|
|
dy21 = v2[0][1] - v1[0][1];
|
|
|
|
len21 = dx21 * dx21 + dy21 * dy21;
|
|
|
|
|
|
|
|
dx02 = v0[0][0] - v2[0][0];
|
|
|
|
dy02 = v0[0][1] - v2[0][1];
|
|
|
|
len02 = dx02 * dx02 + dy02 * dy02;
|
|
|
|
|
|
|
|
/* Look for longest the edge that's longer than maxLen. If we find
|
|
|
|
* such an edge, split the triangle using the midpoint of that edge.
|
|
|
|
* Note: it's important to split the longest edge, not just any edge
|
|
|
|
* that's longer than maxLen. Otherwise, we can get into a degenerate
|
|
|
|
* situation and recurse indefinitely.
|
|
|
|
*/
|
|
|
|
if (len10 > maxLen * maxLen &&
|
|
|
|
len10 >= len21 &&
|
|
|
|
len10 >= len02) {
|
|
|
|
/* subdivide v0, v1 edge */
|
|
|
|
subdiv_tri(setup, v0, v1, v2, pv, tri);
|
|
|
|
return TRUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (len21 > maxLen * maxLen &&
|
|
|
|
len21 >= len10 &&
|
|
|
|
len21 >= len02) {
|
|
|
|
/* subdivide v1, v2 edge */
|
|
|
|
subdiv_tri(setup, v1, v2, v0, pv, tri);
|
|
|
|
return TRUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (len02 > maxLen * maxLen &&
|
|
|
|
len02 >= len21 &&
|
|
|
|
len02 >= len10) {
|
|
|
|
/* subdivide v2, v0 edge */
|
|
|
|
subdiv_tri(setup, v2, v0, v1, pv, tri);
|
|
|
|
return TRUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-04-17 19:48:26 +01:00
|
|
|
/**
|
2010-10-08 17:01:16 +01:00
|
|
|
* Draw triangle if it's CW, cull otherwise.
|
2010-04-17 19:48:26 +01:00
|
|
|
*/
|
2010-10-08 17:01:16 +01: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] )
|
|
|
|
{
|
2012-05-14 16:00:06 +01:00
|
|
|
struct fixed_position position;
|
2013-03-26 04:02:47 +00:00
|
|
|
|
|
|
|
if (setup->subdivide_large_triangles &&
|
|
|
|
check_subdivide_triangle(setup, v0, v1, v2, triangle_cw))
|
|
|
|
return;
|
|
|
|
|
2012-05-14 16:00:06 +01:00
|
|
|
calc_fixed_position(setup, &position, v0, v1, v2);
|
2010-10-08 17:01:16 +01:00
|
|
|
|
2012-05-14 16:00:06 +01:00
|
|
|
if (position.area < 0) {
|
2012-05-17 08:32:31 +01:00
|
|
|
if (setup->flatshade_first) {
|
|
|
|
rotate_fixed_position_12(&position);
|
|
|
|
retry_triangle_ccw(setup, &position, v0, v2, v1, !setup->ccw_is_frontface);
|
|
|
|
} else {
|
|
|
|
rotate_fixed_position_01(&position);
|
|
|
|
retry_triangle_ccw(setup, &position, v1, v0, v2, !setup->ccw_is_frontface);
|
|
|
|
}
|
2012-05-14 16:00:06 +01:00
|
|
|
}
|
2009-10-07 22:36:43 +01:00
|
|
|
}
|
|
|
|
|
2010-01-14 01:01:45 +00:00
|
|
|
|
2010-10-08 17:06:05 +01:00
|
|
|
static void triangle_ccw( struct lp_setup_context *setup,
|
|
|
|
const float (*v0)[4],
|
|
|
|
const float (*v1)[4],
|
|
|
|
const float (*v2)[4])
|
|
|
|
{
|
2012-05-14 16:00:06 +01:00
|
|
|
struct fixed_position position;
|
2013-03-26 04:02:47 +00:00
|
|
|
|
|
|
|
if (setup->subdivide_large_triangles &&
|
|
|
|
check_subdivide_triangle(setup, v0, v1, v2, triangle_ccw))
|
|
|
|
return;
|
|
|
|
|
2012-05-14 16:00:06 +01:00
|
|
|
calc_fixed_position(setup, &position, v0, v1, v2);
|
2010-10-08 17:06:05 +01:00
|
|
|
|
2012-05-14 16:00:06 +01:00
|
|
|
if (position.area > 0)
|
|
|
|
retry_triangle_ccw(setup, &position, v0, v1, v2, setup->ccw_is_frontface);
|
2010-10-08 17:06:05 +01: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] )
|
|
|
|
{
|
2012-05-14 16:00:06 +01:00
|
|
|
struct fixed_position position;
|
2013-09-19 18:37:03 +01:00
|
|
|
struct llvmpipe_context *lp_context = (struct llvmpipe_context *)setup->pipe;
|
2013-03-26 04:02:47 +00:00
|
|
|
|
|
|
|
if (setup->subdivide_large_triangles &&
|
|
|
|
check_subdivide_triangle(setup, v0, v1, v2, triangle_both))
|
|
|
|
return;
|
|
|
|
|
2013-09-19 18:37:03 +01:00
|
|
|
if (lp_context->active_statistics_queries &&
|
|
|
|
!llvmpipe_rasterization_disabled(lp_context)) {
|
|
|
|
lp_context->pipeline_statistics.c_primitives++;
|
|
|
|
}
|
|
|
|
|
2012-05-14 16:00:06 +01:00
|
|
|
calc_fixed_position(setup, &position, v0, v1, v2);
|
2010-10-08 17:06:05 +01:00
|
|
|
|
2010-11-04 23:52:49 +00:00
|
|
|
if (0) {
|
|
|
|
assert(!util_is_inf_or_nan(v0[0][0]));
|
|
|
|
assert(!util_is_inf_or_nan(v0[0][1]));
|
|
|
|
assert(!util_is_inf_or_nan(v1[0][0]));
|
|
|
|
assert(!util_is_inf_or_nan(v1[0][1]));
|
|
|
|
assert(!util_is_inf_or_nan(v2[0][0]));
|
|
|
|
assert(!util_is_inf_or_nan(v2[0][1]));
|
|
|
|
}
|
|
|
|
|
2012-05-14 16:00:06 +01:00
|
|
|
if (position.area > 0)
|
|
|
|
retry_triangle_ccw( setup, &position, v0, v1, v2, setup->ccw_is_frontface );
|
|
|
|
else if (position.area < 0) {
|
2012-05-17 08:32:31 +01:00
|
|
|
if (setup->flatshade_first) {
|
|
|
|
rotate_fixed_position_12( &position );
|
|
|
|
retry_triangle_ccw( setup, &position, v0, v2, v1, !setup->ccw_is_frontface );
|
|
|
|
} else {
|
|
|
|
rotate_fixed_position_01( &position );
|
|
|
|
retry_triangle_ccw( setup, &position, v1, v0, v2, !setup->ccw_is_frontface );
|
|
|
|
}
|
2012-05-14 16:00:06 +01:00
|
|
|
}
|
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;
|
|
|
|
}
|
|
|
|
}
|