1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
|
/**************************************************************************
*
* 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.
*
**************************************************************************/
#include "util/u_memory.h"
#include "lp_state.h"
#include "lp_quad.h"
#include "lp_rast.h"
#include "lp_rast_priv.h"
#include "lp_tile_soa.h"
#include "lp_bld_debug.h"
struct lp_rasterizer *lp_rast_create( void )
{
return CALLOC_STRUCT(lp_rasterizer);
}
void lp_rast_bind_surfaces( struct lp_rasterizer *,
struct pipe_surface *color,
struct pipe_surface *zstencil,
const float *clear_color,
double clear_depth,
unsigned clear_stencil)
{
pipe_surface_reference(&rast->state.color, color);
pipe_surface_reference(&rast->state.depth, depth);
rast->state.clear_color = util_pack_8888(clear_color);
rast->state.clear_depth = clear_depth * 0xffffffff;
rast->state.clear_stencil = clear_stencil;
}
/* Begining of each tile:
*/
void lp_rast_start_tile( struct lp_rasterizer *,
unsigned x,
unsigned y )
{
rast->x = x;
rast->y = y;
}
void lp_rast_clear_color( struct lp_rasterizer *rast )
{
const unsigned clear_color = rast->state.clear_color;
unsigned i, j;
for (i = 0; i < TILESIZE; i++)
for (j = 0; j < TILESIZE; j++)
rast->tile[i][j] = clear_color;
}
void lp_rast_clear_depth( struct lp_rasterizer *rast )
{
const unsigned clear_depth = rast->state.clear_depth;
unsigned i, j;
for (i = 0; i < TILESIZE; i++)
for (j = 0; j < TILESIZE; j++)
rast->tile[i][j] = clear_depth;
}
void lp_rast_clear_stencil( struct lp_rasterizer *rast )
{
const unsigned clear_stencil = rast->state.clear_stencil;
memset(rast->tile.stencil, clear_stencil, sizeof rast->tile.stencil );
}
void lp_rast_load_color( struct lp_rasterizer *rast )
{
/* call u_tile func to load colors from surface */
}
void lp_rast_load_zstencil( struct lp_rasterizer *rast )
{
/* call u_tile func to load depth (and stencil?) from surface */
}
/* Within a tile:
*/
void lp_rast_set_state( struct lp_rasterizer *rast,
const struct lp_rast_state *state )
{
rast->shader_state = state;
lp->quad.first->begin( lp->quad.first );
}
void lp_rast_shade_tile( struct lp_rasterizer *rast,
const struct lp_rast_shader_inputs *inputs )
{
/* Set up the silly quad coef pointers
*/
for (i = 0; i < 4; i++) {
rast->quads[i].posCoef = &inputs->posCoef;
rast->quads[i].coef = inputs->coef;
}
/* Use the existing preference for 8x2 (four quads) shading:
*/
for (i = 0; i < TILESIZE; i += 8) {
for (j = 0; j < TILESIZE; j += 2) {
rast->shader_state.shade( inputs->jc,
rast->x + i,
rast->y + j,
rast->quads, 4 );
}
}
}
void lp_rast_shade_quads( const struct lp_rast_state *state,
struct lp_rast_tile *tile,
struct quad_header **quads,
unsigned nr )
{
struct quad_header *quad = quads[0];
const unsigned x = quad->input.x0;
const unsigned y = quad->input.y0;
uint8_t *color;
uint8_t *depth;
uint32_t ALIGN16_ATTRIB mask[4][NUM_CHANNELS];
unsigned chan_index;
unsigned q;
/* Sanity checks */
assert(nr * QUAD_SIZE == TILE_VECTOR_HEIGHT * TILE_VECTOR_WIDTH);
assert(x % TILE_VECTOR_WIDTH == 0);
assert(y % TILE_VECTOR_HEIGHT == 0);
for (q = 0; q < nr; ++q) {
assert(quads[q]->input.x0 == x + q*2);
assert(quads[q]->input.y0 == y);
}
/* mask */
for (q = 0; q < 4; ++q)
for (chan_index = 0; chan_index < NUM_CHANNELS; ++chan_index)
mask[q][chan_index] = quads[q]->inout.mask & (1 << chan_index) ? ~0 : 0;
/* color buffer */
color = &TILE_PIXEL(tile->color, x, y, 0);
/* depth buffer */
assert((x % 2) == 0);
assert((y % 2) == 0);
depth = (uint8_t *)tile->depth + y*TILE_SIZE*4 + 2*x*4;
/* XXX: This will most likely fail on 32bit x86 without -mstackrealign */
assert(lp_check_alignment(mask, 16));
assert(lp_check_alignment(depth, 16));
assert(lp_check_alignment(color, 16));
assert(lp_check_alignment(state->jc.blend_color, 16));
/* run shader */
state->shader( &state->jc,
x, y,
quad->coef->a0,
quad->coef->dadx,
quad->coef->dady,
&mask[0][0],
color,
depth);
}
/* End of tile:
*/
void lp_rast_store_color( struct lp_rasterizer *rast )
{
/* call u_tile func to store colors to surface */
}
void lp_rast_store_zstencil( struct lp_rasterizer *rast )
{
/* call u_tile func to store depth/stencil to surface */
}
/* Shutdown:
*/
void lp_rast_destroy( struct lp_rasterizer *rast )
{
FREE(rast);
}
|
