2009-10-08 12:51:46 +01:00
|
|
|
/**************************************************************************
|
|
|
|
*
|
|
|
|
* Copyright 2009 VMware, Inc.
|
|
|
|
* 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 VMWARE 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-12-16 23:02:59 +00:00
|
|
|
#include <limits.h>
|
2009-10-08 12:51:46 +01:00
|
|
|
#include "util/u_memory.h"
|
2009-12-08 01:01:12 +00:00
|
|
|
#include "util/u_math.h"
|
2009-12-08 08:02:49 +00:00
|
|
|
#include "util/u_cpu_detect.h"
|
2009-12-11 18:46:23 +00:00
|
|
|
#include "util/u_surface.h"
|
2009-10-08 12:51:46 +01:00
|
|
|
|
2009-12-13 18:17:25 +00:00
|
|
|
#include "lp_scene_queue.h"
|
2009-12-04 21:11:25 +00:00
|
|
|
#include "lp_debug.h"
|
2009-12-12 00:57:45 +00:00
|
|
|
#include "lp_fence.h"
|
2010-02-08 20:09:18 +00:00
|
|
|
#include "lp_perf.h"
|
2009-10-08 12:51:46 +01:00
|
|
|
#include "lp_rast.h"
|
2009-10-08 17:26:13 +01:00
|
|
|
#include "lp_rast_priv.h"
|
|
|
|
#include "lp_tile_soa.h"
|
2010-02-08 23:05:22 +00:00
|
|
|
#include "gallivm/lp_bld_debug.h"
|
2009-12-13 18:17:25 +00:00
|
|
|
#include "lp_scene.h"
|
2009-10-08 12:51:46 +01:00
|
|
|
|
2009-10-07 22:36:43 +01:00
|
|
|
|
2010-03-02 14:41:35 +00:00
|
|
|
/* Begin rasterizing a scene:
|
2009-11-30 21:02:01 +00:00
|
|
|
*/
|
2009-12-04 22:31:09 +00:00
|
|
|
static boolean
|
|
|
|
lp_rast_begin( struct lp_rasterizer *rast,
|
2010-03-02 14:41:35 +00:00
|
|
|
struct lp_scene *scene )
|
2009-10-09 10:24:19 +01:00
|
|
|
{
|
2010-03-02 14:41:35 +00:00
|
|
|
const struct pipe_framebuffer_state *fb = &scene->fb;
|
|
|
|
boolean write_color = fb->nr_cbufs != 0;
|
|
|
|
boolean write_zstencil = fb->zsbuf != NULL;
|
2010-01-10 17:22:09 +00:00
|
|
|
int i;
|
2009-10-09 14:29:25 +01:00
|
|
|
|
2010-03-02 14:41:35 +00:00
|
|
|
rast->curr_scene = scene;
|
2009-10-09 14:02:39 +01:00
|
|
|
|
2010-03-02 14:41:35 +00:00
|
|
|
LP_DBG(DEBUG_RAST, "%s\n", __FUNCTION__);
|
2009-10-09 14:29:25 +01:00
|
|
|
|
2010-03-02 14:41:35 +00:00
|
|
|
rast->state.nr_cbufs = scene->fb.nr_cbufs;
|
2009-10-09 14:29:25 +01:00
|
|
|
rast->state.write_zstencil = write_zstencil;
|
|
|
|
rast->state.write_color = write_color;
|
2010-01-10 17:22:09 +00:00
|
|
|
|
2010-03-02 14:41:35 +00:00
|
|
|
for (i = 0; i < rast->state.nr_cbufs; i++) {
|
2010-03-13 16:04:06 +00:00
|
|
|
struct pipe_surface *cbuf = scene->fb.cbufs[i];
|
2010-03-02 14:41:35 +00:00
|
|
|
rast->cbuf[i].map = scene->cbuf_map[i];
|
2010-03-13 16:04:06 +00:00
|
|
|
rast->cbuf[i].format = cbuf->texture->format;
|
|
|
|
rast->cbuf[i].width = cbuf->width;
|
|
|
|
rast->cbuf[i].height = cbuf->height;
|
|
|
|
rast->cbuf[i].stride = llvmpipe_texture_stride(cbuf->texture, cbuf->level);
|
2009-10-09 14:29:25 +01:00
|
|
|
}
|
2009-10-09 14:02:39 +01:00
|
|
|
|
2010-03-02 14:41:35 +00:00
|
|
|
if (write_zstencil) {
|
2010-03-13 16:04:06 +00:00
|
|
|
struct pipe_surface *zsbuf = scene->fb.zsbuf;
|
2010-03-02 14:41:35 +00:00
|
|
|
rast->zsbuf.map = scene->zsbuf_map;
|
2010-03-13 16:04:06 +00:00
|
|
|
rast->zsbuf.stride = llvmpipe_texture_stride(zsbuf->texture, zsbuf->level);
|
2010-03-02 14:41:35 +00:00
|
|
|
rast->zsbuf.blocksize =
|
2010-03-13 16:04:06 +00:00
|
|
|
util_format_get_blocksize(zsbuf->texture->format);
|
2009-12-03 18:41:45 +00:00
|
|
|
}
|
|
|
|
|
2010-03-02 14:41:35 +00:00
|
|
|
lp_scene_bin_iter_begin( scene );
|
|
|
|
|
2009-10-09 14:29:25 +01:00
|
|
|
return TRUE;
|
2009-10-08 19:58:28 +01:00
|
|
|
}
|
|
|
|
|
2009-10-09 14:29:25 +01:00
|
|
|
|
2009-12-04 22:31:09 +00:00
|
|
|
static void
|
|
|
|
lp_rast_end( struct lp_rasterizer *rast )
|
2009-10-08 19:58:28 +01:00
|
|
|
{
|
2010-03-02 14:41:35 +00:00
|
|
|
int i;
|
2009-10-09 14:29:25 +01:00
|
|
|
|
2010-03-02 14:41:35 +00:00
|
|
|
lp_scene_reset( rast->curr_scene );
|
2009-10-09 14:29:25 +01:00
|
|
|
|
2010-03-02 14:41:35 +00:00
|
|
|
for (i = 0; i < rast->state.nr_cbufs; i++)
|
|
|
|
rast->cbuf[i].map = NULL;
|
2009-10-09 14:29:25 +01:00
|
|
|
|
2010-03-02 14:41:35 +00:00
|
|
|
rast->zsbuf.map = NULL;
|
|
|
|
rast->curr_scene = NULL;
|
2009-10-07 22:36:43 +01:00
|
|
|
}
|
|
|
|
|
2009-11-30 21:02:01 +00:00
|
|
|
/**
|
|
|
|
* Begining rasterization of a tile.
|
|
|
|
* \param x window X position of the tile, in pixels
|
|
|
|
* \param y window Y position of the tile, in pixels
|
2009-10-07 22:36:43 +01:00
|
|
|
*/
|
2009-12-04 21:47:40 +00:00
|
|
|
static void
|
2010-02-24 20:53:30 +00:00
|
|
|
lp_rast_start_tile(struct lp_rasterizer_task *task,
|
|
|
|
unsigned x, unsigned y)
|
2009-10-07 22:36:43 +01:00
|
|
|
{
|
2009-12-04 21:11:25 +00:00
|
|
|
LP_DBG(DEBUG_RAST, "%s %d,%d\n", __FUNCTION__, x, y);
|
2009-10-09 14:02:39 +01:00
|
|
|
|
2010-02-24 20:53:30 +00:00
|
|
|
task->x = x;
|
|
|
|
task->y = y;
|
2009-10-07 22:36:43 +01:00
|
|
|
}
|
|
|
|
|
2009-11-30 21:02:01 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Clear the rasterizer's current color tile.
|
2009-12-03 21:57:44 +00:00
|
|
|
* This is a bin command called during bin processing.
|
2009-11-30 21:02:01 +00:00
|
|
|
*/
|
2010-02-24 20:53:30 +00:00
|
|
|
void
|
|
|
|
lp_rast_clear_color(struct lp_rasterizer_task *task,
|
|
|
|
const union lp_rast_cmd_arg arg)
|
2009-10-07 22:36:43 +01:00
|
|
|
{
|
2010-02-24 20:53:30 +00:00
|
|
|
struct lp_rasterizer *rast = task->rast;
|
2009-10-09 11:29:01 +01:00
|
|
|
const uint8_t *clear_color = arg.clear_color;
|
2010-02-24 20:53:30 +00:00
|
|
|
uint8_t **color_tile = task->tile.color;
|
2010-01-10 17:22:09 +00:00
|
|
|
unsigned i;
|
|
|
|
|
2009-12-04 21:11:25 +00:00
|
|
|
LP_DBG(DEBUG_RAST, "%s 0x%x,0x%x,0x%x,0x%x\n", __FUNCTION__,
|
2009-10-09 14:07:25 +01:00
|
|
|
clear_color[0],
|
|
|
|
clear_color[1],
|
|
|
|
clear_color[2],
|
|
|
|
clear_color[3]);
|
2009-10-09 14:02:39 +01:00
|
|
|
|
2009-10-08 17:59:44 +01:00
|
|
|
if (clear_color[0] == clear_color[1] &&
|
|
|
|
clear_color[1] == clear_color[2] &&
|
|
|
|
clear_color[2] == clear_color[3]) {
|
2010-01-14 01:54:48 +00:00
|
|
|
/* clear to grayscale value {x, x, x, x} */
|
2010-03-02 14:41:35 +00:00
|
|
|
for (i = 0; i < rast->state.nr_cbufs; i++) {
|
2010-01-10 17:22:09 +00:00
|
|
|
memset(color_tile[i], clear_color[0], TILE_SIZE * TILE_SIZE * 4);
|
|
|
|
}
|
2009-10-08 17:59:44 +01:00
|
|
|
}
|
|
|
|
else {
|
2010-01-14 01:54:48 +00:00
|
|
|
/* Non-gray color.
|
|
|
|
* Note: if the swizzled tile layout changes (see TILE_PIXEL) this code
|
|
|
|
* will need to change. It'll be pretty obvious when clearing no longer
|
|
|
|
* works.
|
|
|
|
*/
|
|
|
|
const unsigned chunk = TILE_SIZE / 4;
|
2010-03-02 14:41:35 +00:00
|
|
|
for (i = 0; i < rast->state.nr_cbufs; i++) {
|
2010-01-14 01:54:48 +00:00
|
|
|
uint8_t *c = color_tile[i];
|
|
|
|
unsigned j;
|
|
|
|
for (j = 0; j < 4 * TILE_SIZE; j++) {
|
|
|
|
memset(c, clear_color[0], chunk);
|
|
|
|
c += chunk;
|
|
|
|
memset(c, clear_color[1], chunk);
|
|
|
|
c += chunk;
|
|
|
|
memset(c, clear_color[2], chunk);
|
|
|
|
c += chunk;
|
|
|
|
memset(c, clear_color[3], chunk);
|
|
|
|
c += chunk;
|
|
|
|
}
|
|
|
|
assert(c - color_tile[i] == TILE_SIZE * TILE_SIZE * 4);
|
|
|
|
}
|
2009-10-08 17:59:44 +01:00
|
|
|
}
|
2010-02-08 20:09:18 +00:00
|
|
|
|
|
|
|
LP_COUNT(nr_color_tile_clear);
|
2009-10-07 22:36:43 +01:00
|
|
|
}
|
|
|
|
|
2009-11-30 21:02:01 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Clear the rasterizer's current z/stencil tile.
|
2009-12-03 21:57:44 +00:00
|
|
|
* This is a bin command called during bin processing.
|
2009-11-30 21:02:01 +00:00
|
|
|
*/
|
2010-02-24 20:53:30 +00:00
|
|
|
void
|
|
|
|
lp_rast_clear_zstencil(struct lp_rasterizer_task *task,
|
|
|
|
const union lp_rast_cmd_arg arg)
|
2009-10-07 22:36:43 +01:00
|
|
|
{
|
2010-02-24 20:53:30 +00:00
|
|
|
struct lp_rasterizer *rast = task->rast;
|
2010-02-10 11:01:26 +00:00
|
|
|
const unsigned tile_x = task->x;
|
|
|
|
const unsigned tile_y = task->y;
|
2010-03-02 14:41:35 +00:00
|
|
|
const unsigned height = TILE_SIZE / TILE_VECTOR_HEIGHT;
|
|
|
|
const unsigned width = TILE_SIZE * TILE_VECTOR_HEIGHT;
|
|
|
|
unsigned block_size = rast->zsbuf.blocksize;
|
2010-02-10 11:01:26 +00:00
|
|
|
uint8_t *dst;
|
2010-03-02 14:41:35 +00:00
|
|
|
unsigned dst_stride = rast->zsbuf.stride * TILE_VECTOR_HEIGHT;
|
2010-02-10 11:01:26 +00:00
|
|
|
unsigned i, j;
|
|
|
|
|
2009-12-04 21:11:25 +00:00
|
|
|
LP_DBG(DEBUG_RAST, "%s 0x%x\n", __FUNCTION__, arg.clear_zstencil);
|
2009-10-09 14:02:39 +01:00
|
|
|
|
2010-03-25 22:04:40 +00:00
|
|
|
/*assert(rast->zsbuf.map);*/
|
2010-03-02 14:41:35 +00:00
|
|
|
if (!rast->zsbuf.map)
|
2010-02-10 11:01:26 +00:00
|
|
|
return;
|
|
|
|
|
|
|
|
LP_DBG(DEBUG_RAST, "%s\n", __FUNCTION__);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Clear the aera of the swizzled depth/depth buffer matching this tile, in
|
|
|
|
* stripes of TILE_VECTOR_HEIGHT x TILE_SIZE at a time.
|
|
|
|
*
|
|
|
|
* The swizzled depth format is such that the depths for
|
|
|
|
* TILE_VECTOR_HEIGHT x TILE_VECTOR_WIDTH pixels have consecutive offsets.
|
|
|
|
*/
|
|
|
|
|
|
|
|
dst = lp_rast_depth_pointer(rast, tile_x, tile_y);
|
|
|
|
|
|
|
|
switch (block_size) {
|
|
|
|
case 1:
|
|
|
|
memset(dst, (uint8_t) arg.clear_zstencil, height * width);
|
|
|
|
break;
|
|
|
|
case 2:
|
|
|
|
for (i = 0; i < height; i++) {
|
|
|
|
uint16_t *row = (uint16_t *)dst;
|
|
|
|
for (j = 0; j < width; j++)
|
|
|
|
*row++ = (uint16_t) arg.clear_zstencil;
|
|
|
|
dst += dst_stride;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case 4:
|
|
|
|
for (i = 0; i < height; i++) {
|
|
|
|
uint32_t *row = (uint32_t *)dst;
|
|
|
|
for (j = 0; j < width; j++)
|
|
|
|
*row++ = arg.clear_zstencil;
|
|
|
|
dst += dst_stride;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
default:
|
2010-03-02 14:41:35 +00:00
|
|
|
assert(0);
|
|
|
|
break;
|
2010-02-10 11:01:26 +00:00
|
|
|
}
|
2009-10-07 22:36:43 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-12-03 21:57:44 +00:00
|
|
|
/**
|
|
|
|
* Load tile color from the framebuffer surface.
|
|
|
|
* This is a bin command called during bin processing.
|
|
|
|
*/
|
2010-02-24 20:53:30 +00:00
|
|
|
void
|
|
|
|
lp_rast_load_color(struct lp_rasterizer_task *task,
|
|
|
|
const union lp_rast_cmd_arg arg)
|
2009-10-07 22:36:43 +01:00
|
|
|
{
|
2010-02-24 20:53:30 +00:00
|
|
|
struct lp_rasterizer *rast = task->rast;
|
|
|
|
const unsigned x = task->x, y = task->y;
|
2010-01-10 17:22:09 +00:00
|
|
|
unsigned i;
|
2009-12-11 22:00:28 +00:00
|
|
|
|
|
|
|
LP_DBG(DEBUG_RAST, "%s at %u, %u\n", __FUNCTION__, x, y);
|
|
|
|
|
2010-03-02 14:41:35 +00:00
|
|
|
for (i = 0; i < rast->state.nr_cbufs; i++) {
|
|
|
|
if (x >= rast->cbuf[i].width || y >= rast->cbuf[i].height)
|
2010-01-10 17:22:09 +00:00
|
|
|
continue;
|
|
|
|
|
2010-03-02 14:41:35 +00:00
|
|
|
lp_tile_read_4ub(rast->cbuf[i].format,
|
2010-01-19 23:58:25 +00:00
|
|
|
task->tile.color[i],
|
2010-03-02 14:41:35 +00:00
|
|
|
rast->cbuf[i].map,
|
|
|
|
rast->cbuf[i].stride,
|
2010-01-10 17:22:09 +00:00
|
|
|
x, y,
|
2010-03-02 14:41:35 +00:00
|
|
|
TILE_SIZE, TILE_SIZE);
|
2010-02-08 20:09:18 +00:00
|
|
|
|
|
|
|
LP_COUNT(nr_color_tile_load);
|
2010-01-10 17:22:09 +00:00
|
|
|
}
|
2009-10-07 22:36:43 +01:00
|
|
|
}
|
|
|
|
|
2009-12-03 21:57:44 +00:00
|
|
|
|
2010-02-24 20:53:30 +00:00
|
|
|
void
|
|
|
|
lp_rast_set_state(struct lp_rasterizer_task *task,
|
|
|
|
const union lp_rast_cmd_arg arg)
|
2009-12-03 21:57:44 +00:00
|
|
|
{
|
2009-12-03 23:05:12 +00:00
|
|
|
const struct lp_rast_state *state = arg.set_state;
|
|
|
|
|
2009-12-04 21:11:25 +00:00
|
|
|
LP_DBG(DEBUG_RAST, "%s %p\n", __FUNCTION__, (void *) state);
|
2009-12-03 21:57:44 +00:00
|
|
|
|
2009-12-04 18:50:40 +00:00
|
|
|
/* just set the current state pointer for this rasterizer */
|
2010-02-24 20:53:30 +00:00
|
|
|
task->current_state = state;
|
2009-12-03 21:57:44 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Run the shader on all blocks in a tile. This is used when a tile is
|
|
|
|
* completely contained inside a triangle.
|
|
|
|
* This is a bin command called during bin processing.
|
|
|
|
*/
|
2010-02-24 20:53:30 +00:00
|
|
|
void
|
|
|
|
lp_rast_shade_tile(struct lp_rasterizer_task *task,
|
|
|
|
const union lp_rast_cmd_arg arg)
|
2009-10-07 22:36:43 +01:00
|
|
|
{
|
2010-02-24 20:53:30 +00:00
|
|
|
struct lp_rasterizer *rast = task->rast;
|
2010-01-19 23:58:25 +00:00
|
|
|
const struct lp_rast_state *state = task->current_state;
|
|
|
|
struct lp_rast_tile *tile = &task->tile;
|
2009-10-09 11:29:01 +01:00
|
|
|
const struct lp_rast_shader_inputs *inputs = arg.shade_tile;
|
2010-02-24 20:53:30 +00:00
|
|
|
const unsigned tile_x = task->x, tile_y = task->y;
|
2009-10-08 19:16:47 +01:00
|
|
|
unsigned x, y;
|
2009-10-07 22:36:43 +01:00
|
|
|
|
2009-12-04 21:11:25 +00:00
|
|
|
LP_DBG(DEBUG_RAST, "%s\n", __FUNCTION__);
|
2009-10-09 14:02:39 +01:00
|
|
|
|
2010-01-15 18:21:16 +00:00
|
|
|
/* render the whole 64x64 tile in 4x4 chunks */
|
|
|
|
for (y = 0; y < TILE_SIZE; y += 4){
|
|
|
|
for (x = 0; x < TILE_SIZE; x += 4) {
|
|
|
|
uint8_t *color[PIPE_MAX_COLOR_BUFS];
|
|
|
|
uint32_t *depth;
|
|
|
|
unsigned block_offset, i;
|
|
|
|
|
|
|
|
/* offset of the 16x16 pixel block within the tile */
|
|
|
|
block_offset = ((y / 4) * (16 * 16) + (x / 4) * 16);
|
|
|
|
|
|
|
|
/* color buffer */
|
2010-03-02 14:41:35 +00:00
|
|
|
for (i = 0; i < rast->state.nr_cbufs; i++)
|
2010-01-15 18:21:16 +00:00
|
|
|
color[i] = tile->color[i] + 4 * block_offset;
|
|
|
|
|
|
|
|
/* depth buffer */
|
2010-02-10 11:01:26 +00:00
|
|
|
depth = lp_rast_depth_pointer(rast, tile_x + x, tile_y + y);
|
2010-01-15 18:21:16 +00:00
|
|
|
|
|
|
|
/* run shader */
|
2010-03-18 18:04:50 +00:00
|
|
|
state->jit_function[RAST_WHOLE]( &state->jit_context,
|
|
|
|
tile_x + x, tile_y + y,
|
2010-03-18 19:02:53 +00:00
|
|
|
inputs->facing,
|
2010-03-18 18:04:50 +00:00
|
|
|
inputs->a0,
|
|
|
|
inputs->dadx,
|
|
|
|
inputs->dady,
|
|
|
|
color,
|
|
|
|
depth,
|
|
|
|
INT_MIN, INT_MIN, INT_MIN,
|
|
|
|
NULL, NULL, NULL );
|
2010-01-15 18:21:16 +00:00
|
|
|
}
|
|
|
|
}
|
2009-10-07 22:36:43 +01:00
|
|
|
}
|
|
|
|
|
2009-10-08 12:44:30 +01:00
|
|
|
|
2009-12-02 22:13:45 +00:00
|
|
|
/**
|
|
|
|
* Compute shading for a 4x4 block of pixels.
|
2009-12-03 21:57:44 +00:00
|
|
|
* This is a bin command called during bin processing.
|
2009-12-02 22:13:45 +00:00
|
|
|
*/
|
2010-02-24 20:30:57 +00:00
|
|
|
void lp_rast_shade_quads( struct lp_rasterizer_task *task,
|
2009-10-08 19:03:14 +01:00
|
|
|
const struct lp_rast_shader_inputs *inputs,
|
|
|
|
unsigned x, unsigned y,
|
2009-12-16 23:02:59 +00:00
|
|
|
int32_t c1, int32_t c2, int32_t c3)
|
2009-10-08 12:44:30 +01:00
|
|
|
{
|
2010-01-19 23:58:25 +00:00
|
|
|
const struct lp_rast_state *state = task->current_state;
|
2010-02-24 20:30:57 +00:00
|
|
|
struct lp_rasterizer *rast = task->rast;
|
2010-01-19 23:58:25 +00:00
|
|
|
struct lp_rast_tile *tile = &task->tile;
|
2010-01-10 17:22:09 +00:00
|
|
|
uint8_t *color[PIPE_MAX_COLOR_BUFS];
|
2009-10-08 19:16:47 +01:00
|
|
|
void *depth;
|
2010-01-10 17:22:09 +00:00
|
|
|
unsigned i;
|
2009-10-20 03:17:17 +01:00
|
|
|
unsigned ix, iy;
|
2009-12-02 22:13:45 +00:00
|
|
|
int block_offset;
|
2009-10-08 12:44:30 +01:00
|
|
|
|
2009-12-04 18:50:40 +00:00
|
|
|
assert(state);
|
|
|
|
|
2009-10-08 12:44:30 +01:00
|
|
|
/* Sanity checks */
|
|
|
|
assert(x % TILE_VECTOR_WIDTH == 0);
|
|
|
|
assert(y % TILE_VECTOR_HEIGHT == 0);
|
|
|
|
|
2009-12-15 22:39:48 +00:00
|
|
|
assert((x % 4) == 0);
|
|
|
|
assert((y % 4) == 0);
|
2009-12-02 22:13:45 +00:00
|
|
|
|
2009-10-09 19:16:36 +01:00
|
|
|
ix = x % TILE_SIZE;
|
|
|
|
iy = y % TILE_SIZE;
|
|
|
|
|
2009-12-02 22:13:45 +00:00
|
|
|
/* offset of the 16x16 pixel block within the tile */
|
2010-01-15 18:21:16 +00:00
|
|
|
block_offset = ((iy / 4) * (16 * 16) + (ix / 4) * 16);
|
2009-12-02 22:13:45 +00:00
|
|
|
|
2009-10-08 12:44:30 +01:00
|
|
|
/* color buffer */
|
2010-03-02 14:41:35 +00:00
|
|
|
for (i = 0; i < rast->state.nr_cbufs; i++)
|
2010-01-10 17:22:09 +00:00
|
|
|
color[i] = tile->color[i] + 4 * block_offset;
|
2009-10-08 12:44:30 +01:00
|
|
|
|
|
|
|
/* depth buffer */
|
2010-02-10 11:01:26 +00:00
|
|
|
depth = lp_rast_depth_pointer(rast, x, y);
|
2009-10-08 12:44:30 +01:00
|
|
|
|
2010-01-10 17:22:09 +00:00
|
|
|
|
|
|
|
assert(lp_check_alignment(tile->color[0], 16));
|
2009-10-09 15:52:18 +01:00
|
|
|
assert(lp_check_alignment(state->jit_context.blend_color, 16));
|
2009-10-08 12:44:30 +01:00
|
|
|
|
2009-12-16 23:02:59 +00:00
|
|
|
assert(lp_check_alignment(inputs->step[0], 16));
|
|
|
|
assert(lp_check_alignment(inputs->step[1], 16));
|
|
|
|
assert(lp_check_alignment(inputs->step[2], 16));
|
|
|
|
|
2009-10-08 12:44:30 +01:00
|
|
|
/* run shader */
|
2010-03-18 18:04:50 +00:00
|
|
|
state->jit_function[RAST_EDGE_TEST]( &state->jit_context,
|
|
|
|
x, y,
|
2010-03-18 19:02:53 +00:00
|
|
|
inputs->facing,
|
2010-03-18 18:04:50 +00:00
|
|
|
inputs->a0,
|
|
|
|
inputs->dadx,
|
|
|
|
inputs->dady,
|
|
|
|
color,
|
|
|
|
depth,
|
|
|
|
c1, c2, c3,
|
|
|
|
inputs->step[0],
|
|
|
|
inputs->step[1],
|
|
|
|
inputs->step[2]);
|
2009-10-08 12:44:30 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-01-18 20:10:10 +00:00
|
|
|
/**
|
|
|
|
* Set top row and left column of the tile's pixels to white. For debugging.
|
|
|
|
*/
|
|
|
|
static void
|
|
|
|
outline_tile(uint8_t *tile)
|
|
|
|
{
|
|
|
|
const uint8_t val = 0xff;
|
|
|
|
unsigned i;
|
|
|
|
|
|
|
|
for (i = 0; i < TILE_SIZE; i++) {
|
|
|
|
TILE_PIXEL(tile, i, 0, 0) = val;
|
|
|
|
TILE_PIXEL(tile, i, 0, 1) = val;
|
|
|
|
TILE_PIXEL(tile, i, 0, 2) = val;
|
|
|
|
TILE_PIXEL(tile, i, 0, 3) = val;
|
|
|
|
|
|
|
|
TILE_PIXEL(tile, 0, i, 0) = val;
|
|
|
|
TILE_PIXEL(tile, 0, i, 1) = val;
|
|
|
|
TILE_PIXEL(tile, 0, i, 2) = val;
|
|
|
|
TILE_PIXEL(tile, 0, i, 3) = val;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Draw grid of gray lines at 16-pixel intervals across the tile to
|
|
|
|
* show the sub-tile boundaries. For debugging.
|
|
|
|
*/
|
|
|
|
static void
|
|
|
|
outline_subtiles(uint8_t *tile)
|
|
|
|
{
|
|
|
|
const uint8_t val = 0x80;
|
|
|
|
const unsigned step = 16;
|
|
|
|
unsigned i, j;
|
|
|
|
|
2010-01-19 16:30:44 +00:00
|
|
|
for (i = 0; i < TILE_SIZE; i += step) {
|
2010-01-18 20:10:10 +00:00
|
|
|
for (j = 0; j < TILE_SIZE; j++) {
|
|
|
|
TILE_PIXEL(tile, i, j, 0) = val;
|
|
|
|
TILE_PIXEL(tile, i, j, 1) = val;
|
|
|
|
TILE_PIXEL(tile, i, j, 2) = val;
|
|
|
|
TILE_PIXEL(tile, i, j, 3) = val;
|
|
|
|
|
|
|
|
TILE_PIXEL(tile, j, i, 0) = val;
|
|
|
|
TILE_PIXEL(tile, j, i, 1) = val;
|
|
|
|
TILE_PIXEL(tile, j, i, 2) = val;
|
|
|
|
TILE_PIXEL(tile, j, i, 3) = val;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
outline_tile(tile);
|
|
|
|
}
|
|
|
|
|
2009-10-08 17:59:44 +01:00
|
|
|
|
|
|
|
|
2009-11-30 21:02:01 +00:00
|
|
|
/**
|
|
|
|
* Write the rasterizer's color tile to the framebuffer.
|
|
|
|
*/
|
2010-02-24 20:53:30 +00:00
|
|
|
static void
|
|
|
|
lp_rast_store_color(struct lp_rasterizer_task *task)
|
2009-10-07 22:36:43 +01:00
|
|
|
{
|
2010-02-24 20:53:30 +00:00
|
|
|
struct lp_rasterizer *rast = task->rast;
|
|
|
|
const unsigned x = task->x, y = task->y;
|
2010-01-10 17:22:09 +00:00
|
|
|
unsigned i;
|
2009-10-09 16:19:00 +01:00
|
|
|
|
2010-03-02 14:41:35 +00:00
|
|
|
for (i = 0; i < rast->state.nr_cbufs; i++) {
|
|
|
|
if (x >= rast->cbuf[i].width)
|
2010-01-10 17:22:09 +00:00
|
|
|
continue;
|
2009-10-09 16:19:00 +01:00
|
|
|
|
2010-03-02 14:41:35 +00:00
|
|
|
if (y >= rast->cbuf[i].height)
|
2010-01-10 17:22:09 +00:00
|
|
|
continue;
|
2009-10-07 22:36:43 +01:00
|
|
|
|
2010-03-02 14:41:35 +00:00
|
|
|
LP_DBG(DEBUG_RAST, "%s [%u] %d,%d\n", __FUNCTION__,
|
|
|
|
task->thread_index, x, y);
|
2010-01-10 17:22:09 +00:00
|
|
|
|
2010-01-18 20:10:10 +00:00
|
|
|
if (LP_DEBUG & DEBUG_SHOW_SUBTILES)
|
2010-01-19 23:58:25 +00:00
|
|
|
outline_subtiles(task->tile.color[i]);
|
2010-01-18 20:10:10 +00:00
|
|
|
else if (LP_DEBUG & DEBUG_SHOW_TILES)
|
2010-01-19 23:58:25 +00:00
|
|
|
outline_tile(task->tile.color[i]);
|
2010-01-18 20:10:10 +00:00
|
|
|
|
2010-03-02 14:41:35 +00:00
|
|
|
lp_tile_write_4ub(rast->cbuf[i].format,
|
2010-01-19 23:58:25 +00:00
|
|
|
task->tile.color[i],
|
2010-03-02 14:41:35 +00:00
|
|
|
rast->cbuf[i].map,
|
|
|
|
rast->cbuf[i].stride,
|
2010-01-10 17:22:09 +00:00
|
|
|
x, y,
|
2010-03-02 14:41:35 +00:00
|
|
|
TILE_SIZE, TILE_SIZE);
|
2010-02-08 20:09:18 +00:00
|
|
|
|
|
|
|
LP_COUNT(nr_color_tile_store);
|
2010-01-10 17:22:09 +00:00
|
|
|
}
|
2009-10-07 22:36:43 +01:00
|
|
|
}
|
|
|
|
|
2009-10-09 10:37:24 +01:00
|
|
|
|
|
|
|
|
2009-12-12 00:57:45 +00:00
|
|
|
/**
|
|
|
|
* Signal on a fence. This is called during bin execution/rasterization.
|
|
|
|
* Called per thread.
|
|
|
|
*/
|
2010-02-24 20:53:30 +00:00
|
|
|
void
|
|
|
|
lp_rast_fence(struct lp_rasterizer_task *task,
|
|
|
|
const union lp_rast_cmd_arg arg)
|
2009-12-12 00:57:45 +00:00
|
|
|
{
|
|
|
|
struct lp_fence *fence = arg.fence;
|
2010-03-25 01:28:41 +00:00
|
|
|
lp_fence_signal(fence);
|
2009-12-12 00:57:45 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-12-11 21:52:42 +00:00
|
|
|
|
|
|
|
|
2009-12-04 21:47:40 +00:00
|
|
|
/**
|
|
|
|
* Rasterize commands for a single bin.
|
2009-12-04 22:31:09 +00:00
|
|
|
* \param x, y position of the bin's tile in the framebuffer
|
2009-12-04 21:47:40 +00:00
|
|
|
* Must be called between lp_rast_begin() and lp_rast_end().
|
2009-12-10 21:56:30 +00:00
|
|
|
* Called per thread.
|
2009-12-04 21:47:40 +00:00
|
|
|
*/
|
2009-12-04 22:31:09 +00:00
|
|
|
static void
|
2010-02-24 20:53:30 +00:00
|
|
|
rasterize_bin(struct lp_rasterizer_task *task,
|
|
|
|
const struct cmd_bin *bin,
|
|
|
|
int x, int y)
|
2009-12-04 21:47:40 +00:00
|
|
|
{
|
|
|
|
const struct cmd_block_list *commands = &bin->commands;
|
|
|
|
struct cmd_block *block;
|
|
|
|
unsigned k;
|
|
|
|
|
2010-03-02 14:41:35 +00:00
|
|
|
lp_rast_start_tile( task, x * TILE_SIZE, y * TILE_SIZE );
|
2009-12-04 21:47:40 +00:00
|
|
|
|
|
|
|
/* simply execute each of the commands in the block list */
|
|
|
|
for (block = commands->head; block; block = block->next) {
|
|
|
|
for (k = 0; k < block->count; k++) {
|
2010-02-24 20:53:30 +00:00
|
|
|
block->cmd[k]( task, block->arg[k] );
|
2009-12-04 21:47:40 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-03-02 14:41:35 +00:00
|
|
|
/* Write the rasterizer's tiles to the framebuffer.
|
|
|
|
*/
|
|
|
|
if (task->rast->state.write_color)
|
|
|
|
lp_rast_store_color(task);
|
|
|
|
|
|
|
|
/* Free data for this bin.
|
|
|
|
*/
|
|
|
|
lp_scene_bin_reset( task->rast->curr_scene, x, y);
|
2009-12-04 21:47:40 +00:00
|
|
|
}
|
|
|
|
|
2010-01-13 20:14:04 +00:00
|
|
|
|
|
|
|
#define RAST(x) { lp_rast_##x, #x }
|
|
|
|
|
|
|
|
static struct {
|
|
|
|
lp_rast_cmd cmd;
|
|
|
|
const char *name;
|
|
|
|
} cmd_names[] =
|
|
|
|
{
|
|
|
|
RAST(load_color),
|
|
|
|
RAST(clear_color),
|
|
|
|
RAST(clear_zstencil),
|
|
|
|
RAST(triangle),
|
|
|
|
RAST(shade_tile),
|
|
|
|
RAST(set_state),
|
|
|
|
RAST(fence),
|
|
|
|
};
|
|
|
|
|
|
|
|
static void
|
|
|
|
debug_bin( const struct cmd_bin *bin )
|
|
|
|
{
|
|
|
|
const struct cmd_block *head = bin->commands.head;
|
|
|
|
int i, j;
|
|
|
|
|
|
|
|
for (i = 0; i < head->count; i++) {
|
|
|
|
debug_printf("%d: ", i);
|
|
|
|
for (j = 0; j < Elements(cmd_names); j++) {
|
|
|
|
if (head->cmd[i] == cmd_names[j].cmd) {
|
|
|
|
debug_printf("%s\n", cmd_names[j].name);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (j == Elements(cmd_names))
|
|
|
|
debug_printf("...other\n");
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
2010-01-13 16:29:39 +00:00
|
|
|
/* An empty bin is one that just loads the contents of the tile and
|
|
|
|
* stores them again unchanged. This typically happens when bins have
|
|
|
|
* been flushed for some reason in the middle of a frame, or when
|
|
|
|
* incremental updates are being made to a render target.
|
|
|
|
*
|
|
|
|
* Try to avoid doing pointless work in this case.
|
|
|
|
*/
|
2010-01-13 14:41:02 +00:00
|
|
|
static boolean
|
2010-01-13 16:29:39 +00:00
|
|
|
is_empty_bin( const struct cmd_bin *bin )
|
2010-01-13 14:41:02 +00:00
|
|
|
{
|
|
|
|
const struct cmd_block *head = bin->commands.head;
|
|
|
|
int i;
|
2010-01-13 20:14:04 +00:00
|
|
|
|
|
|
|
if (0)
|
|
|
|
debug_bin(bin);
|
|
|
|
|
2010-01-13 16:29:39 +00:00
|
|
|
/* We emit at most two load-tile commands at the start of the first
|
2010-01-13 20:14:04 +00:00
|
|
|
* command block. In addition we seem to emit a couple of
|
|
|
|
* set-state commands even in empty bins.
|
|
|
|
*
|
|
|
|
* As a heuristic, if a bin has more than 4 commands, consider it
|
|
|
|
* non-empty.
|
2010-01-13 16:29:39 +00:00
|
|
|
*/
|
2010-01-13 14:41:02 +00:00
|
|
|
if (head->next != NULL ||
|
2010-01-13 20:14:04 +00:00
|
|
|
head->count > 4) {
|
2010-01-13 14:41:02 +00:00
|
|
|
return FALSE;
|
2010-01-13 20:14:04 +00:00
|
|
|
}
|
2010-01-13 14:41:02 +00:00
|
|
|
|
|
|
|
for (i = 0; i < head->count; i++)
|
|
|
|
if (head->cmd[i] != lp_rast_load_color &&
|
2010-01-13 20:14:04 +00:00
|
|
|
head->cmd[i] != lp_rast_set_state) {
|
2010-01-13 14:41:02 +00:00
|
|
|
return FALSE;
|
2010-01-13 20:14:04 +00:00
|
|
|
}
|
2010-01-13 14:41:02 +00:00
|
|
|
|
|
|
|
return TRUE;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-12-04 21:47:40 +00:00
|
|
|
|
2009-12-04 22:31:09 +00:00
|
|
|
/**
|
2009-12-13 18:17:25 +00:00
|
|
|
* Rasterize/execute all bins within a scene.
|
2009-12-10 21:56:30 +00:00
|
|
|
* Called per thread.
|
2009-12-04 22:31:09 +00:00
|
|
|
*/
|
2009-12-08 01:01:12 +00:00
|
|
|
static void
|
2010-02-24 20:53:30 +00:00
|
|
|
rasterize_scene(struct lp_rasterizer_task *task,
|
2010-03-02 14:41:35 +00:00
|
|
|
struct lp_scene *scene)
|
2009-12-08 01:01:12 +00:00
|
|
|
{
|
2009-12-13 18:17:25 +00:00
|
|
|
/* loop over scene bins, rasterize each */
|
2009-12-08 01:01:12 +00:00
|
|
|
#if 0
|
|
|
|
{
|
|
|
|
unsigned i, j;
|
2009-12-13 18:17:25 +00:00
|
|
|
for (i = 0; i < scene->tiles_x; i++) {
|
|
|
|
for (j = 0; j < scene->tiles_y; j++) {
|
2010-02-24 20:53:30 +00:00
|
|
|
struct cmd_bin *bin = lp_scene_get_bin(scene, i, j);
|
2010-03-02 14:41:35 +00:00
|
|
|
rasterize_bin(task, bin, i, j);
|
2009-12-08 01:01:12 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
{
|
|
|
|
struct cmd_bin *bin;
|
|
|
|
int x, y;
|
|
|
|
|
2009-12-13 18:17:25 +00:00
|
|
|
assert(scene);
|
|
|
|
while ((bin = lp_scene_bin_iter_next(scene, &x, &y))) {
|
2010-01-13 16:29:39 +00:00
|
|
|
if (!is_empty_bin( bin ))
|
2010-03-02 14:41:35 +00:00
|
|
|
rasterize_bin(task, bin, x, y);
|
2009-12-08 01:01:12 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
2009-12-11 18:16:48 +00:00
|
|
|
* Called by setup module when it has something for us to render.
|
2009-12-08 01:01:12 +00:00
|
|
|
*/
|
2009-12-04 22:31:09 +00:00
|
|
|
void
|
2010-03-02 14:41:35 +00:00
|
|
|
lp_rast_queue_scene( struct lp_rasterizer *rast,
|
|
|
|
struct lp_scene *scene)
|
2009-12-04 22:31:09 +00:00
|
|
|
{
|
|
|
|
LP_DBG(DEBUG_SETUP, "%s\n", __FUNCTION__);
|
|
|
|
|
2009-12-08 01:01:12 +00:00
|
|
|
if (rast->num_threads == 0) {
|
|
|
|
/* no threading */
|
2009-12-11 21:52:42 +00:00
|
|
|
|
2010-03-02 14:41:35 +00:00
|
|
|
lp_rast_begin( rast, scene );
|
2009-12-11 21:52:42 +00:00
|
|
|
|
2010-03-02 14:41:35 +00:00
|
|
|
rasterize_scene( &rast->tasks[0], scene );
|
2009-12-09 23:02:30 +00:00
|
|
|
|
2010-03-02 14:41:35 +00:00
|
|
|
lp_scene_reset( scene );
|
|
|
|
rast->curr_scene = NULL;
|
2009-12-04 22:31:09 +00:00
|
|
|
}
|
2009-12-08 01:01:12 +00:00
|
|
|
else {
|
|
|
|
/* threaded rendering! */
|
|
|
|
unsigned i;
|
|
|
|
|
2009-12-13 18:17:25 +00:00
|
|
|
lp_scene_enqueue( rast->full_scenes, scene );
|
2009-12-10 21:56:30 +00:00
|
|
|
|
2009-12-08 01:01:12 +00:00
|
|
|
/* signal the threads that there's work to do */
|
|
|
|
for (i = 0; i < rast->num_threads; i++) {
|
|
|
|
pipe_semaphore_signal(&rast->tasks[i].work_ready);
|
|
|
|
}
|
2010-03-02 14:41:35 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
LP_DBG(DEBUG_SETUP, "%s done \n", __FUNCTION__);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void
|
|
|
|
lp_rast_finish( struct lp_rasterizer *rast )
|
|
|
|
{
|
|
|
|
if (rast->num_threads == 0) {
|
|
|
|
/* nothing to do */
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
int i;
|
2009-12-08 01:01:12 +00:00
|
|
|
|
|
|
|
/* wait for work to complete */
|
|
|
|
for (i = 0; i < rast->num_threads; i++) {
|
|
|
|
pipe_semaphore_wait(&rast->tasks[i].work_done);
|
2009-12-07 22:31:50 +00:00
|
|
|
}
|
|
|
|
}
|
2009-12-04 22:31:09 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-12-08 01:01:12 +00:00
|
|
|
/**
|
|
|
|
* This is the thread's main entrypoint.
|
|
|
|
* It's a simple loop:
|
|
|
|
* 1. wait for work
|
|
|
|
* 2. do work
|
|
|
|
* 3. signal that we're done
|
|
|
|
*/
|
2010-02-05 13:48:35 +00:00
|
|
|
static PIPE_THREAD_ROUTINE( thread_func, init_data )
|
2009-12-08 01:01:12 +00:00
|
|
|
{
|
|
|
|
struct lp_rasterizer_task *task = (struct lp_rasterizer_task *) init_data;
|
|
|
|
struct lp_rasterizer *rast = task->rast;
|
2009-12-10 21:56:30 +00:00
|
|
|
boolean debug = false;
|
2009-12-08 01:01:12 +00:00
|
|
|
|
|
|
|
while (1) {
|
|
|
|
/* wait for work */
|
|
|
|
if (debug)
|
|
|
|
debug_printf("thread %d waiting for work\n", task->thread_index);
|
|
|
|
pipe_semaphore_wait(&task->work_ready);
|
|
|
|
|
2010-02-25 00:30:43 +00:00
|
|
|
if (rast->exit_flag)
|
|
|
|
break;
|
|
|
|
|
2009-12-11 21:52:42 +00:00
|
|
|
if (task->thread_index == 0) {
|
|
|
|
/* thread[0]:
|
2009-12-13 18:17:25 +00:00
|
|
|
* - get next scene to rasterize
|
2009-12-11 21:52:42 +00:00
|
|
|
* - map the framebuffer surfaces
|
|
|
|
*/
|
2010-03-02 14:41:35 +00:00
|
|
|
lp_rast_begin( rast,
|
|
|
|
lp_scene_dequeue( rast->full_scenes, TRUE ) );
|
2009-12-11 21:52:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Wait for all threads to get here so that threads[1+] don't
|
2009-12-13 18:17:25 +00:00
|
|
|
* get a null rast->curr_scene pointer.
|
2009-12-11 21:52:42 +00:00
|
|
|
*/
|
|
|
|
pipe_barrier_wait( &rast->barrier );
|
2009-12-10 21:56:30 +00:00
|
|
|
|
2009-12-08 01:01:12 +00:00
|
|
|
/* do work */
|
|
|
|
if (debug)
|
|
|
|
debug_printf("thread %d doing work\n", task->thread_index);
|
2010-03-02 14:41:35 +00:00
|
|
|
|
2010-02-24 20:53:30 +00:00
|
|
|
rasterize_scene(task,
|
2010-03-02 14:41:35 +00:00
|
|
|
rast->curr_scene);
|
2009-12-10 21:56:30 +00:00
|
|
|
|
2009-12-13 18:17:25 +00:00
|
|
|
/* wait for all threads to finish with this scene */
|
2009-12-11 21:52:42 +00:00
|
|
|
pipe_barrier_wait( &rast->barrier );
|
|
|
|
|
2010-03-02 14:41:35 +00:00
|
|
|
/* XXX: shouldn't be necessary:
|
|
|
|
*/
|
2009-12-11 21:52:42 +00:00
|
|
|
if (task->thread_index == 0) {
|
|
|
|
lp_rast_end( rast );
|
|
|
|
}
|
2009-12-08 01:01:12 +00:00
|
|
|
|
|
|
|
/* signal done with work */
|
|
|
|
if (debug)
|
|
|
|
debug_printf("thread %d done working\n", task->thread_index);
|
2010-03-02 14:41:35 +00:00
|
|
|
|
2009-12-08 01:01:12 +00:00
|
|
|
pipe_semaphore_signal(&task->work_done);
|
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Initialize semaphores and spawn the threads.
|
|
|
|
*/
|
|
|
|
static void
|
|
|
|
create_rast_threads(struct lp_rasterizer *rast)
|
|
|
|
{
|
|
|
|
unsigned i;
|
|
|
|
|
2010-02-05 13:56:01 +00:00
|
|
|
#ifdef PIPE_OS_WINDOWS
|
|
|
|
/* Multithreading not supported on windows until conditions and barriers are
|
|
|
|
* properly implemented. */
|
|
|
|
rast->num_threads = 0;
|
2010-03-10 16:34:09 +00:00
|
|
|
#else
|
|
|
|
#ifdef PIPE_OS_EMBEDDED
|
|
|
|
rast->num_threads = 0;
|
2010-02-05 13:56:01 +00:00
|
|
|
#else
|
2009-12-08 08:02:49 +00:00
|
|
|
rast->num_threads = util_cpu_caps.nr_cpus;
|
2010-03-10 16:34:09 +00:00
|
|
|
#endif
|
2009-12-08 08:02:49 +00:00
|
|
|
rast->num_threads = debug_get_num_option("LP_NUM_THREADS", rast->num_threads);
|
2009-12-08 01:01:12 +00:00
|
|
|
rast->num_threads = MIN2(rast->num_threads, MAX_THREADS);
|
2010-02-05 13:56:01 +00:00
|
|
|
#endif
|
2009-12-08 01:01:12 +00:00
|
|
|
|
|
|
|
/* NOTE: if num_threads is zero, we won't use any threads */
|
|
|
|
for (i = 0; i < rast->num_threads; i++) {
|
|
|
|
pipe_semaphore_init(&rast->tasks[i].work_ready, 0);
|
|
|
|
pipe_semaphore_init(&rast->tasks[i].work_done, 0);
|
|
|
|
rast->threads[i] = pipe_thread_create(thread_func,
|
|
|
|
(void *) &rast->tasks[i]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
2009-12-09 21:53:33 +00:00
|
|
|
/**
|
|
|
|
* Create new lp_rasterizer.
|
2009-12-13 18:17:25 +00:00
|
|
|
* \param empty the queue to put empty scenes on after we've finished
|
2009-12-09 21:53:33 +00:00
|
|
|
* processing them.
|
|
|
|
*/
|
|
|
|
struct lp_rasterizer *
|
2010-03-02 14:41:35 +00:00
|
|
|
lp_rast_create( void )
|
2009-12-08 01:01:12 +00:00
|
|
|
{
|
|
|
|
struct lp_rasterizer *rast;
|
2010-01-10 17:22:09 +00:00
|
|
|
unsigned i, cbuf;
|
2009-12-08 01:01:12 +00:00
|
|
|
|
|
|
|
rast = CALLOC_STRUCT(lp_rasterizer);
|
|
|
|
if(!rast)
|
|
|
|
return NULL;
|
|
|
|
|
2009-12-13 18:17:25 +00:00
|
|
|
rast->full_scenes = lp_scene_queue_create();
|
2009-12-09 21:53:33 +00:00
|
|
|
|
2009-12-08 01:01:12 +00:00
|
|
|
for (i = 0; i < Elements(rast->tasks); i++) {
|
2010-01-19 23:58:25 +00:00
|
|
|
struct lp_rasterizer_task *task = &rast->tasks[i];
|
|
|
|
|
2010-01-10 17:22:09 +00:00
|
|
|
for (cbuf = 0; cbuf < PIPE_MAX_COLOR_BUFS; cbuf++ )
|
2010-01-19 23:58:25 +00:00
|
|
|
task->tile.color[cbuf] = align_malloc(TILE_SIZE * TILE_SIZE * 4, 16);
|
2010-01-10 17:22:09 +00:00
|
|
|
|
2010-01-19 23:58:25 +00:00
|
|
|
task->rast = rast;
|
|
|
|
task->thread_index = i;
|
2009-12-08 01:01:12 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
create_rast_threads(rast);
|
|
|
|
|
2009-12-11 21:52:42 +00:00
|
|
|
/* for synchronizing rasterization threads */
|
|
|
|
pipe_barrier_init( &rast->barrier, rast->num_threads );
|
|
|
|
|
2009-12-08 01:01:12 +00:00
|
|
|
return rast;
|
|
|
|
}
|
|
|
|
|
2009-12-04 21:47:40 +00:00
|
|
|
|
2009-10-07 22:36:43 +01:00
|
|
|
/* Shutdown:
|
|
|
|
*/
|
|
|
|
void lp_rast_destroy( struct lp_rasterizer *rast )
|
|
|
|
{
|
2010-01-10 17:22:09 +00:00
|
|
|
unsigned i, cbuf;
|
2009-12-08 00:02:17 +00:00
|
|
|
|
|
|
|
for (i = 0; i < Elements(rast->tasks); i++) {
|
2010-01-10 17:22:09 +00:00
|
|
|
for (cbuf = 0; cbuf < PIPE_MAX_COLOR_BUFS; cbuf++ )
|
|
|
|
align_free(rast->tasks[i].tile.color[cbuf]);
|
2009-12-08 00:02:17 +00:00
|
|
|
}
|
|
|
|
|
2010-02-25 00:30:43 +00:00
|
|
|
/* Set exit_flag and signal each thread's work_ready semaphore.
|
|
|
|
* Each thread will be woken up, notice that the exit_flag is set and
|
|
|
|
* break out of its main loop. The thread will then exit.
|
|
|
|
*/
|
|
|
|
rast->exit_flag = TRUE;
|
|
|
|
for (i = 0; i < rast->num_threads; i++) {
|
|
|
|
pipe_semaphore_signal(&rast->tasks[i].work_ready);
|
|
|
|
}
|
|
|
|
|
2010-03-05 21:24:02 +00:00
|
|
|
/* Wait for threads to terminate before cleaning up per-thread data */
|
|
|
|
for (i = 0; i < rast->num_threads; i++) {
|
|
|
|
pipe_thread_wait(rast->threads[i]);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Clean up per-thread data */
|
2010-02-25 00:30:43 +00:00
|
|
|
for (i = 0; i < rast->num_threads; i++) {
|
|
|
|
pipe_semaphore_destroy(&rast->tasks[i].work_ready);
|
|
|
|
pipe_semaphore_destroy(&rast->tasks[i].work_done);
|
|
|
|
}
|
|
|
|
|
2009-12-11 21:52:42 +00:00
|
|
|
/* for synchronizing rasterization threads */
|
|
|
|
pipe_barrier_destroy( &rast->barrier );
|
|
|
|
|
2009-10-07 22:36:43 +01:00
|
|
|
FREE(rast);
|
|
|
|
}
|
|
|
|
|
2009-12-12 00:45:52 +00:00
|
|
|
|
|
|
|
/** Return number of rasterization threads */
|
|
|
|
unsigned
|
|
|
|
lp_rast_get_num_threads( struct lp_rasterizer *rast )
|
|
|
|
{
|
|
|
|
return rast->num_threads;
|
|
|
|
}
|