1 /**************************************************************************
3 * Copyright 2007 Tungsten Graphics, Inc., Cedar Park, Texas.
6 * Permission is hereby granted, free of charge, to any person obtaining a
7 * copy of this software and associated documentation files (the
8 * "Software"), to deal in the Software without restriction, including
9 * without limitation the rights to use, copy, modify, merge, publish,
10 * distribute, sub license, and/or sell copies of the Software, and to
11 * permit persons to whom the Software is furnished to do so, subject to
12 * the following conditions:
14 * The above copyright notice and this permission notice (including the
15 * next paragraph) shall be included in all copies or substantial portions
18 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
19 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
20 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
21 * IN NO EVENT SHALL TUNGSTEN GRAPHICS AND/OR ITS SUPPLIERS BE LIABLE FOR
22 * ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
23 * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
24 * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
26 **************************************************************************/
30 * Keith Whitwell <keith@tungstengraphics.com>
33 #include "util/u_memory.h"
34 #include "draw/draw_context.h"
35 #include "draw/draw_private.h"
36 #include "draw/draw_vbuf.h"
37 #include "draw/draw_vertex.h"
38 #include "draw/draw_pt.h"
39 #include "translate/translate.h"
40 #include "translate/translate_cache.h"
42 /* The simplest 'middle end' in the new vertex code.
44 * The responsibilities of a middle end are to:
45 * - perform vertex fetch using
46 * - draw vertex element/buffer state
47 * - a list of fetch indices we received as an input
48 * - run the vertex shader
50 * - clip coord calculation
51 * - viewport transformation
52 * - if necessary, run the primitive pipeline, passing it:
53 * - a linear array of vertex_header vertices constructed here
54 * - a set of draw indices we received as an input
55 * - otherwise, drive the hw backend,
56 * - allocate space for hardware format vertices
57 * - translate the vertex-shader output vertices to hw format
58 * - calling the backend draw functions.
60 * For convenience, we provide a helper function to drive the hardware
61 * backend given similar inputs to those required to run the pipeline.
63 * In the case of passthrough mode, many of these actions are disabled
64 * or noops, so we end up doing:
66 * - perform vertex fetch
67 * - drive the hw backend
69 * IE, basically just vertex fetch to post-vs-format vertices,
70 * followed by a call to the backend helper function.
74 struct fetch_emit_middle_end
{
75 struct draw_pt_middle_end base
;
76 struct draw_context
*draw
;
78 struct translate
*translate
;
79 const struct vertex_info
*vinfo
;
81 /* Cache point size somewhere it's address won't change:
85 struct translate_cache
*cache
;
91 static void fetch_emit_prepare( struct draw_pt_middle_end
*middle
,
94 unsigned *max_vertices
)
96 struct fetch_emit_middle_end
*feme
= (struct fetch_emit_middle_end
*)middle
;
97 struct draw_context
*draw
= feme
->draw
;
98 const struct vertex_info
*vinfo
;
99 unsigned i
, dst_offset
;
101 struct translate_key key
;
104 ok
= draw
->render
->set_primitive( draw
->render
,
111 /* Must do this after set_primitive() above:
113 vinfo
= feme
->vinfo
= draw
->render
->get_vertex_info(draw
->render
);
117 /* Transform from API vertices to HW vertices, skipping the
118 * pipeline_vertex intermediate step.
121 memset(&key
, 0, sizeof(key
));
123 for (i
= 0; i
< vinfo
->num_attribs
; i
++) {
124 const struct pipe_vertex_element
*src
= &draw
->pt
.vertex_element
[vinfo
->attrib
[i
].src_index
];
126 unsigned emit_sz
= 0;
127 unsigned input_format
= src
->src_format
;
128 unsigned input_buffer
= src
->vertex_buffer_index
;
129 unsigned input_offset
= src
->src_offset
;
130 unsigned output_format
;
132 switch (vinfo
->attrib
[i
].emit
) {
134 output_format
= PIPE_FORMAT_R32G32B32A32_FLOAT
;
135 emit_sz
= 4 * sizeof(float);
138 output_format
= PIPE_FORMAT_R32G32B32_FLOAT
;
139 emit_sz
= 3 * sizeof(float);
142 output_format
= PIPE_FORMAT_R32G32_FLOAT
;
143 emit_sz
= 2 * sizeof(float);
146 output_format
= PIPE_FORMAT_R32_FLOAT
;
147 emit_sz
= 1 * sizeof(float);
150 input_format
= PIPE_FORMAT_R32_FLOAT
;
151 input_buffer
= draw
->pt
.nr_vertex_buffers
;
153 output_format
= PIPE_FORMAT_R32_FLOAT
;
154 emit_sz
= 1 * sizeof(float);
158 output_format
= PIPE_FORMAT_NONE
;
163 key
.element
[i
].input_format
= input_format
;
164 key
.element
[i
].input_buffer
= input_buffer
;
165 key
.element
[i
].input_offset
= input_offset
;
166 key
.element
[i
].output_format
= output_format
;
167 key
.element
[i
].output_offset
= dst_offset
;
169 dst_offset
+= emit_sz
;
172 key
.nr_elements
= vinfo
->num_attribs
;
173 key
.output_stride
= vinfo
->size
* 4;
175 /* Don't bother with caching at this stage:
177 if (!feme
->translate
||
178 translate_key_compare(&feme
->translate
->key
, &key
) != 0)
180 translate_key_sanitize(&key
);
181 feme
->translate
= translate_cache_find(feme
->cache
,
185 feme
->translate
->set_buffer(feme
->translate
,
186 draw
->pt
.nr_vertex_buffers
,
191 feme
->point_size
= draw
->rasterizer
->point_size
;
193 for (i
= 0; i
< draw
->pt
.nr_vertex_buffers
; i
++) {
194 feme
->translate
->set_buffer(feme
->translate
,
196 ((char *)draw
->pt
.user
.vbuffer
[i
] +
197 draw
->pt
.vertex_buffer
[i
].buffer_offset
),
198 draw
->pt
.vertex_buffer
[i
].pitch
);
201 *max_vertices
= (draw
->render
->max_vertex_buffer_bytes
/
204 /* Return an even number of verts.
205 * This prevents "parity" errors when splitting long triangle strips which
206 * can lead to front/back culling mix-ups.
207 * Every other triangle in a strip has an alternate front/back orientation
208 * so splitting at an odd position can cause the orientation of subsequent
209 * triangles to get reversed.
211 *max_vertices
= *max_vertices
& ~1;
218 static void fetch_emit_run( struct draw_pt_middle_end
*middle
,
219 const unsigned *fetch_elts
,
220 unsigned fetch_count
,
221 const ushort
*draw_elts
,
222 unsigned draw_count
)
224 struct fetch_emit_middle_end
*feme
= (struct fetch_emit_middle_end
*)middle
;
225 struct draw_context
*draw
= feme
->draw
;
228 /* XXX: need to flush to get prim_vbuf.c to release its allocation??
230 draw_do_flush( draw
, DRAW_FLUSH_BACKEND
);
232 if (fetch_count
>= UNDEFINED_VERTEX_ID
) {
237 hw_verts
= draw
->render
->allocate_vertices( draw
->render
,
238 (ushort
)feme
->translate
->key
.output_stride
,
239 (ushort
)fetch_count
);
246 /* Single routine to fetch vertices and emit HW verts.
248 feme
->translate
->run_elts( feme
->translate
,
255 for (i
= 0; i
< fetch_count
; i
++) {
256 debug_printf("\n\nvertex %d:\n", i
);
257 draw_dump_emitted_vertex( feme
->vinfo
,
258 (const uint8_t *)hw_verts
+ feme
->vinfo
->size
* 4 * i
);
262 /* XXX: Draw arrays path to avoid re-emitting index list again and
265 draw
->render
->draw( draw
->render
,
269 /* Done -- that was easy, wasn't it:
271 draw
->render
->release_vertices( draw
->render
,
273 feme
->translate
->key
.output_stride
,
279 static void fetch_emit_run_linear( struct draw_pt_middle_end
*middle
,
283 struct fetch_emit_middle_end
*feme
= (struct fetch_emit_middle_end
*)middle
;
284 struct draw_context
*draw
= feme
->draw
;
287 /* XXX: need to flush to get prim_vbuf.c to release its allocation??
289 draw_do_flush( draw
, DRAW_FLUSH_BACKEND
);
291 if (count
>= UNDEFINED_VERTEX_ID
) {
296 hw_verts
= draw
->render
->allocate_vertices( draw
->render
,
297 (ushort
)feme
->translate
->key
.output_stride
,
304 /* Single routine to fetch vertices and emit HW verts.
306 feme
->translate
->run( feme
->translate
,
313 for (i
= 0; i
< count
; i
++) {
314 debug_printf("\n\nvertex %d:\n", i
);
315 draw_dump_emitted_vertex( feme
->vinfo
,
316 (const uint8_t *)hw_verts
+ feme
->vinfo
->size
* 4 * i
);
320 /* XXX: Draw arrays path to avoid re-emitting index list again and
323 draw
->render
->draw_arrays( draw
->render
,
327 /* Done -- that was easy, wasn't it:
329 draw
->render
->release_vertices( draw
->render
,
331 feme
->translate
->key
.output_stride
,
337 static boolean
fetch_emit_run_linear_elts( struct draw_pt_middle_end
*middle
,
340 const ushort
*draw_elts
,
341 unsigned draw_count
)
343 struct fetch_emit_middle_end
*feme
= (struct fetch_emit_middle_end
*)middle
;
344 struct draw_context
*draw
= feme
->draw
;
347 /* XXX: need to flush to get prim_vbuf.c to release its allocation??
349 draw_do_flush( draw
, DRAW_FLUSH_BACKEND
);
351 if (count
>= UNDEFINED_VERTEX_ID
)
354 hw_verts
= draw
->render
->allocate_vertices( draw
->render
,
355 (ushort
)feme
->translate
->key
.output_stride
,
360 /* Single routine to fetch vertices and emit HW verts.
362 feme
->translate
->run( feme
->translate
,
367 /* XXX: Draw arrays path to avoid re-emitting index list again and
370 draw
->render
->draw( draw
->render
,
374 /* Done -- that was easy, wasn't it:
376 draw
->render
->release_vertices( draw
->render
,
378 feme
->translate
->key
.output_stride
,
387 static void fetch_emit_finish( struct draw_pt_middle_end
*middle
)
392 static void fetch_emit_destroy( struct draw_pt_middle_end
*middle
)
394 struct fetch_emit_middle_end
*feme
= (struct fetch_emit_middle_end
*)middle
;
397 translate_cache_destroy(feme
->cache
);
403 struct draw_pt_middle_end
*draw_pt_fetch_emit( struct draw_context
*draw
)
405 struct fetch_emit_middle_end
*fetch_emit
= CALLOC_STRUCT( fetch_emit_middle_end
);
406 if (fetch_emit
== NULL
)
409 fetch_emit
->cache
= translate_cache_create();
410 if (!fetch_emit
->cache
) {
415 fetch_emit
->base
.prepare
= fetch_emit_prepare
;
416 fetch_emit
->base
.run
= fetch_emit_run
;
417 fetch_emit
->base
.run_linear
= fetch_emit_run_linear
;
418 fetch_emit
->base
.run_linear_elts
= fetch_emit_run_linear_elts
;
419 fetch_emit
->base
.finish
= fetch_emit_finish
;
420 fetch_emit
->base
.destroy
= fetch_emit_destroy
;
422 fetch_emit
->draw
= draw
;
424 return &fetch_emit
->base
;