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
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
|
/**************************************************************************
*
* 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.
*
**************************************************************************/
/**
* The rast code is concerned with rasterization of command bins.
* Each screen tile has a bin associated with it. To render the
* scene we iterate over the tile bins and execute the commands
* in each bin.
* We'll do that with multiple threads...
*/
#ifndef LP_RAST_H
#define LP_RAST_H
#include "pipe/p_compiler.h"
#include "lp_jit.h"
struct lp_rasterizer;
struct lp_scene;
struct lp_fence;
struct cmd_bin;
/** For sub-pixel positioning */
#define FIXED_ORDER 4
#define FIXED_ONE (1<<FIXED_ORDER)
struct lp_rasterizer_task;
/**
* Rasterization state.
* Objects of this type are put into the shared data bin and pointed
* to by commands in the per-tile bins.
*/
struct lp_rast_state {
/* State for the shader. This also contains state which feeds into
* the fragment shader, such as blend color and alpha ref value.
*/
struct lp_jit_context jit_context;
/* The shader itself. Probably we also need to pass a pointer to
* the tile color/z/stencil data somehow
*/
struct lp_fragment_shader_variant *variant;
};
/**
* Coefficients necessary to run the shader at a given location.
* First coefficient is position.
* These pointers point into the bin data buffer.
*/
struct lp_rast_shader_inputs {
unsigned frontfacing:1; /** True for front-facing */
unsigned disable:1; /** Partially binned, disable this command */
unsigned opaque:1; /** Is opaque */
unsigned pad0:29; /* wasted space */
unsigned stride; /* how much to advance data between a0, dadx, dady */
unsigned pad2; /* wasted space */
unsigned pad3; /* wasted space */
/* followed by a0, dadx, dady and planes[] */
};
/* Note: the order of these values is important as they are loaded by
* sse code in rasterization:
*/
struct lp_rast_plane {
/* edge function values at minx,miny ?? */
int c;
int dcdx;
int dcdy;
/* one-pixel sized trivial reject offsets for each plane */
int eo;
};
/**
* Rasterization information for a triangle known to be in this bin,
* plus inputs to run the shader:
* These fields are tile- and bin-independent.
* Objects of this type are put into the lp_setup_context::data buffer.
*/
struct lp_rast_triangle {
#ifdef DEBUG
float v[3][2];
float pad0;
float pad1;
#endif
/* inputs for the shader */
struct lp_rast_shader_inputs inputs;
/* planes are also allocated here */
};
#define GET_A0(inputs) ((float (*)[4])((inputs)+1))
#define GET_DADX(inputs) ((float (*)[4])((char *)((inputs) + 1) + (inputs)->stride))
#define GET_DADY(inputs) ((float (*)[4])((char *)((inputs) + 1) + 2 * (inputs)->stride))
#define GET_PLANES(tri) ((struct lp_rast_plane *)((char *)(&(tri)->inputs + 1) + 3 * (tri)->inputs.stride))
struct lp_rasterizer *
lp_rast_create( unsigned num_threads );
void
lp_rast_destroy( struct lp_rasterizer * );
unsigned
lp_rast_get_num_threads( struct lp_rasterizer * );
void
lp_rast_queue_scene( struct lp_rasterizer *rast,
struct lp_scene *scene );
void
lp_rast_finish( struct lp_rasterizer *rast );
union lp_rast_cmd_arg {
const struct lp_rast_shader_inputs *shade_tile;
struct {
const struct lp_rast_triangle *tri;
unsigned plane_mask;
} triangle;
const struct lp_rast_state *set_state;
uint8_t clear_color[4];
struct {
uint32_t value;
uint32_t mask;
} clear_zstencil;
const struct lp_rast_state *state;
struct lp_fence *fence;
struct llvmpipe_query *query_obj;
};
/* Cast wrappers. Hopefully these compile to noops!
*/
static INLINE union lp_rast_cmd_arg
lp_rast_arg_inputs( const struct lp_rast_shader_inputs *shade_tile )
{
union lp_rast_cmd_arg arg;
arg.shade_tile = shade_tile;
return arg;
}
static INLINE union lp_rast_cmd_arg
lp_rast_arg_triangle( const struct lp_rast_triangle *triangle,
unsigned plane_mask)
{
union lp_rast_cmd_arg arg;
arg.triangle.tri = triangle;
arg.triangle.plane_mask = plane_mask;
return arg;
}
static INLINE union lp_rast_cmd_arg
lp_rast_arg_state( const struct lp_rast_state *state )
{
union lp_rast_cmd_arg arg;
arg.set_state = state;
return arg;
}
static INLINE union lp_rast_cmd_arg
lp_rast_arg_fence( struct lp_fence *fence )
{
union lp_rast_cmd_arg arg;
arg.fence = fence;
return arg;
}
static INLINE union lp_rast_cmd_arg
lp_rast_arg_clearzs( unsigned value, unsigned mask )
{
union lp_rast_cmd_arg arg;
arg.clear_zstencil.value = value;
arg.clear_zstencil.mask = mask;
return arg;
}
static INLINE union lp_rast_cmd_arg
lp_rast_arg_query( struct llvmpipe_query *pq )
{
union lp_rast_cmd_arg arg;
arg.query_obj = pq;
return arg;
}
static INLINE union lp_rast_cmd_arg
lp_rast_arg_null( void )
{
union lp_rast_cmd_arg arg;
arg.set_state = NULL;
return arg;
}
/**
* Binnable Commands.
* These get put into bins by the setup code and are called when
* the bins are executed.
*/
#define LP_RAST_OP_CLEAR_COLOR 0x0
#define LP_RAST_OP_CLEAR_ZSTENCIL 0x1
#define LP_RAST_OP_TRIANGLE_1 0x2
#define LP_RAST_OP_TRIANGLE_2 0x3
#define LP_RAST_OP_TRIANGLE_3 0x4
#define LP_RAST_OP_TRIANGLE_4 0x5
#define LP_RAST_OP_TRIANGLE_5 0x6
#define LP_RAST_OP_TRIANGLE_6 0x7
#define LP_RAST_OP_TRIANGLE_7 0x8
#define LP_RAST_OP_TRIANGLE_8 0x9
#define LP_RAST_OP_TRIANGLE_3_4 0xa
#define LP_RAST_OP_TRIANGLE_3_16 0xb
#define LP_RAST_OP_TRIANGLE_4_16 0xc
#define LP_RAST_OP_SHADE_TILE 0xd
#define LP_RAST_OP_SHADE_TILE_OPAQUE 0xe
#define LP_RAST_OP_BEGIN_QUERY 0xf
#define LP_RAST_OP_END_QUERY 0x10
#define LP_RAST_OP_SET_STATE 0x11
#define LP_RAST_OP_MAX 0x12
#define LP_RAST_OP_MASK 0xff
void
lp_debug_bins( struct lp_scene *scene );
void
lp_debug_draw_bins_by_cmd_length( struct lp_scene *scene );
void
lp_debug_draw_bins_by_coverage( struct lp_scene *scene );
#endif
|