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
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
|
/*
* Copyright 2003 Tungsten Graphics, 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
* on 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 THEIR 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.
*
* Authors:
* Keith Whitwell <keithw@tungstengraphics.com>
*/
#include "glheader.h"
#include "context.h"
#include "colormac.h"
#include "pipe/p_compiler.h"
#include "draw_vf.h"
#define DBG 0
static boolean match_fastpath( struct draw_vertex_fetch *vf,
const struct draw_vf_fastpath *fp)
{
unsigned j;
if (vf->attr_count != fp->attr_count)
return FALSE;
for (j = 0; j < vf->attr_count; j++)
if (vf->attr[j].format != fp->attr[j].format ||
vf->attr[j].inputsize != fp->attr[j].size ||
vf->attr[j].vertoffset != fp->attr[j].offset)
return FALSE;
if (fp->match_strides) {
if (vf->vertex_stride != fp->vertex_stride)
return FALSE;
for (j = 0; j < vf->attr_count; j++)
if (vf->attr[j].inputstride != fp->attr[j].stride)
return FALSE;
}
return TRUE;
}
static boolean search_fastpath_emit( struct draw_vertex_fetch *vf )
{
struct draw_vf_fastpath *fp = vf->fastpath;
for ( ; fp ; fp = fp->next) {
if (match_fastpath(vf, fp)) {
vf->emit = fp->func;
return TRUE;
}
}
return FALSE;
}
void draw_vf_register_fastpath( struct draw_vertex_fetch *vf,
boolean match_strides )
{
struct draw_vf_fastpath *fastpath = CALLOC_STRUCT(draw_vf_fastpath);
unsigned i;
fastpath->vertex_stride = vf->vertex_stride;
fastpath->attr_count = vf->attr_count;
fastpath->match_strides = match_strides;
fastpath->func = vf->emit;
fastpath->attr = (struct draw_vf_attr_type *)
_mesa_malloc(vf->attr_count * sizeof(fastpath->attr[0]));
for (i = 0; i < vf->attr_count; i++) {
fastpath->attr[i].format = vf->attr[i].format;
fastpath->attr[i].stride = vf->attr[i].inputstride;
fastpath->attr[i].size = vf->attr[i].inputsize;
fastpath->attr[i].offset = vf->attr[i].vertoffset;
}
fastpath->next = vf->fastpath;
vf->fastpath = fastpath;
}
/***********************************************************************
* Build codegen functions or return generic ones:
*/
static void choose_emit_func( struct draw_vertex_fetch *vf,
unsigned count,
uint8_t *dest)
{
vf->emit = NULL;
/* Does this match an existing (hardwired, codegen or known-bad)
* fastpath?
*/
if (search_fastpath_emit(vf)) {
/* Use this result. If it is null, then it is already known
* that the current state will fail for codegen and there is no
* point trying again.
*/
}
else if (vf->codegen_emit) {
vf->codegen_emit( vf );
}
if (!vf->emit) {
draw_vf_generate_hardwired_emit(vf);
}
/* Otherwise use the generic version:
*/
if (!vf->emit)
vf->emit = draw_vf_generic_emit;
vf->emit( vf, count, dest );
}
/***********************************************************************
* Public entrypoints, mostly dispatch to the above:
*/
unsigned draw_vf_set_vertex_attributes( struct draw_vertex_fetch *vf,
const struct draw_vf_attr_map *map,
unsigned nr,
unsigned vertex_stride )
{
unsigned offset = 0;
unsigned i, j;
assert(nr < DRAW_VF_ATTRIB_MAX);
memset(vf->lookup, 0, sizeof(vf->lookup));
for (j = 0, i = 0; i < nr; i++) {
const unsigned format = map[i].format;
if (format == EMIT_PAD) {
if (DBG)
_mesa_printf("%d: pad %d, offset %d\n", i,
map[i].offset, offset);
offset += map[i].offset;
}
else {
assert(vf->lookup[map[i].attrib] == 0);
vf->lookup[map[i].attrib] = &vf->attr[j];
vf->attr[j].attrib = map[i].attrib;
vf->attr[j].format = format;
vf->attr[j].insert = draw_vf_format_info[format].insert;
vf->attr[j].extract = draw_vf_format_info[format].extract;
vf->attr[j].vertattrsize = draw_vf_format_info[format].attrsize;
vf->attr[j].vertoffset = offset;
if (DBG)
_mesa_printf("%d: %s, offset %d\n", i,
draw_vf_format_info[format].name,
vf->attr[j].vertoffset);
offset += draw_vf_format_info[format].attrsize;
j++;
}
}
vf->attr_count = j;
vf->vertex_stride = vertex_stride ? vertex_stride : offset;
vf->emit = choose_emit_func;
assert(vf->vertex_stride >= offset);
return vf->vertex_stride;
}
void draw_vf_set_vp_matrix( struct draw_vertex_fetch *vf,
const float *viewport )
{
assert(vf->allow_viewport_emits);
/* scale */
vf->vp[0] = viewport[MAT_SX];
vf->vp[1] = viewport[MAT_SY];
vf->vp[2] = viewport[MAT_SZ];
vf->vp[3] = 1.0;
/* translate */
vf->vp[4] = viewport[MAT_TX];
vf->vp[5] = viewport[MAT_TY];
vf->vp[6] = viewport[MAT_TZ];
vf->vp[7] = 0.0;
}
void draw_vf_set_vp_scale_translate( struct draw_vertex_fetch *vf,
const float *scale,
const float *translate )
{
assert(vf->allow_viewport_emits);
vf->vp[0] = scale[0];
vf->vp[1] = scale[1];
vf->vp[2] = scale[2];
vf->vp[3] = scale[3];
vf->vp[4] = translate[0];
vf->vp[5] = translate[1];
vf->vp[6] = translate[2];
vf->vp[7] = translate[3];
}
/* Set attribute pointers, adjusted for start position:
*/
void draw_vf_set_sources( struct draw_vertex_fetch *vf,
GLvector4f * const sources[],
unsigned start )
{
struct draw_vf_attr *a = vf->attr;
unsigned j;
for (j = 0; j < vf->attr_count; j++) {
const GLvector4f *vptr = sources[a[j].attrib];
if ((a[j].inputstride != vptr->stride) ||
(a[j].inputsize != vptr->size))
vf->emit = choose_emit_func;
a[j].inputstride = vptr->stride;
a[j].inputsize = vptr->size;
a[j].do_insert = a[j].insert[vptr->size - 1];
a[j].inputptr = ((uint8_t *)vptr->data) + start * vptr->stride;
}
}
/* Emit count VB vertices to dest.
*/
void draw_vf_emit_vertices( struct draw_vertex_fetch *vf,
unsigned count,
void *dest )
{
vf->emit( vf, count, (uint8_t*) dest );
}
/* Extract a named attribute from a hardware vertex. Will have to
* reverse any viewport transformation, swizzling or other conversions
* which may have been applied.
*
* This is mainly required for on-the-fly vertex translations to
* swrast format.
*/
void draw_vf_get_attr( struct draw_vertex_fetch *vf,
const void *vertex,
GLenum attr,
const float *dflt,
float *dest )
{
const struct draw_vf_attr *a = vf->attr;
const unsigned attr_count = vf->attr_count;
unsigned j;
for (j = 0; j < attr_count; j++) {
if (a[j].attrib == attr) {
a[j].extract( &a[j], dest, (uint8_t *)vertex + a[j].vertoffset );
return;
}
}
/* Else return the value from ctx->Current.
*/
_mesa_memcpy( dest, dflt, 4*sizeof(float));
}
struct draw_vertex_fetch *draw_vf_create( boolean allow_viewport_emits )
{
struct draw_vertex_fetch *vf = CALLOC_STRUCT(draw_vertex_fetch);
unsigned i;
for (i = 0; i < DRAW_VF_ATTRIB_MAX; i++)
vf->attr[i].vf = vf;
vf->allow_viewport_emits = allow_viewport_emits;
switch(CHAN_TYPE) {
case GL_UNSIGNED_BYTE:
vf->chan_scale[0] = 255.0;
vf->chan_scale[1] = 255.0;
vf->chan_scale[2] = 255.0;
vf->chan_scale[3] = 255.0;
break;
case GL_UNSIGNED_SHORT:
vf->chan_scale[0] = 65535.0;
vf->chan_scale[1] = 65535.0;
vf->chan_scale[2] = 65535.0;
vf->chan_scale[3] = 65535.0;
break;
default:
vf->chan_scale[0] = 1.0;
vf->chan_scale[1] = 1.0;
vf->chan_scale[2] = 1.0;
vf->chan_scale[3] = 1.0;
break;
}
vf->identity[0] = 0.0;
vf->identity[1] = 0.0;
vf->identity[2] = 0.0;
vf->identity[3] = 1.0;
vf->codegen_emit = NULL;
#ifdef USE_SSE_ASM
if (!_mesa_getenv("MESA_NO_CODEGEN"))
vf->codegen_emit = draw_vf_generate_sse_emit;
#endif
return vf;
}
void draw_vf_destroy( struct draw_vertex_fetch *vf )
{
struct draw_vf_fastpath *fp, *tmp;
for (fp = vf->fastpath ; fp ; fp = tmp) {
tmp = fp->next;
FREE(fp->attr);
/* KW: At the moment, fp->func is constrained to be allocated by
* _mesa_exec_alloc(), as the hardwired fastpaths in
* t_vertex_generic.c are handled specially. It would be nice
* to unify them, but this probably won't change until this
* module gets another overhaul.
*/
_mesa_exec_free((void *) fp->func);
FREE(fp);
}
vf->fastpath = NULL;
FREE(vf);
}
|