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 output_format
= draw_translate_vinfo_format(vinfo
->attrib
[i
].emit
);
133 emit_sz
= draw_translate_vinfo_size(vinfo
->attrib
[i
].emit
);
135 if (vinfo
->attrib
[i
].emit
== EMIT_OMIT
)
138 if (vinfo
->attrib
[i
].emit
== EMIT_1F_PSIZE
) {
139 input_format
= PIPE_FORMAT_R32_FLOAT
;
140 input_buffer
= draw
->pt
.nr_vertex_buffers
;
144 key
.element
[i
].type
= TRANSLATE_ELEMENT_NORMAL
;
145 key
.element
[i
].input_format
= input_format
;
146 key
.element
[i
].input_buffer
= input_buffer
;
147 key
.element
[i
].input_offset
= input_offset
;
148 key
.element
[i
].instance_divisor
= src
->instance_divisor
;
149 key
.element
[i
].output_format
= output_format
;
150 key
.element
[i
].output_offset
= dst_offset
;
152 dst_offset
+= emit_sz
;
155 key
.nr_elements
= vinfo
->num_attribs
;
156 key
.output_stride
= vinfo
->size
* 4;
158 /* Don't bother with caching at this stage:
160 if (!feme
->translate
||
161 translate_key_compare(&feme
->translate
->key
, &key
) != 0)
163 translate_key_sanitize(&key
);
164 feme
->translate
= translate_cache_find(feme
->cache
,
168 feme
->translate
->set_buffer(feme
->translate
,
169 draw
->pt
.nr_vertex_buffers
,
175 feme
->point_size
= draw
->rasterizer
->point_size
;
177 for (i
= 0; i
< draw
->pt
.nr_vertex_buffers
; i
++) {
178 feme
->translate
->set_buffer(feme
->translate
,
180 ((char *)draw
->pt
.user
.vbuffer
[i
] +
181 draw
->pt
.vertex_buffer
[i
].buffer_offset
),
182 draw
->pt
.vertex_buffer
[i
].stride
,
183 draw
->pt
.vertex_buffer
[i
].max_index
);
186 *max_vertices
= (draw
->render
->max_vertex_buffer_bytes
/
189 /* Return an even number of verts.
190 * This prevents "parity" errors when splitting long triangle strips which
191 * can lead to front/back culling mix-ups.
192 * Every other triangle in a strip has an alternate front/back orientation
193 * so splitting at an odd position can cause the orientation of subsequent
194 * triangles to get reversed.
196 *max_vertices
= *max_vertices
& ~1;
203 static void fetch_emit_run( struct draw_pt_middle_end
*middle
,
204 const unsigned *fetch_elts
,
205 unsigned fetch_count
,
206 const ushort
*draw_elts
,
207 unsigned draw_count
)
209 struct fetch_emit_middle_end
*feme
= (struct fetch_emit_middle_end
*)middle
;
210 struct draw_context
*draw
= feme
->draw
;
213 /* XXX: need to flush to get prim_vbuf.c to release its allocation??
215 draw_do_flush( draw
, DRAW_FLUSH_BACKEND
);
217 if (fetch_count
>= UNDEFINED_VERTEX_ID
) {
222 draw
->render
->allocate_vertices( draw
->render
,
223 (ushort
)feme
->translate
->key
.output_stride
,
224 (ushort
)fetch_count
);
226 hw_verts
= draw
->render
->map_vertices( draw
->render
);
233 /* Single routine to fetch vertices and emit HW verts.
235 feme
->translate
->run_elts( feme
->translate
,
243 for (i
= 0; i
< fetch_count
; i
++) {
244 debug_printf("\n\nvertex %d:\n", i
);
245 draw_dump_emitted_vertex( feme
->vinfo
,
246 (const uint8_t *)hw_verts
+ feme
->vinfo
->size
* 4 * i
);
250 draw
->render
->unmap_vertices( draw
->render
,
252 (ushort
)(fetch_count
- 1) );
254 /* XXX: Draw arrays path to avoid re-emitting index list again and
257 draw
->render
->draw_elements( draw
->render
,
261 /* Done -- that was easy, wasn't it:
263 draw
->render
->release_vertices( draw
->render
);
268 static void fetch_emit_run_linear( struct draw_pt_middle_end
*middle
,
272 struct fetch_emit_middle_end
*feme
= (struct fetch_emit_middle_end
*)middle
;
273 struct draw_context
*draw
= feme
->draw
;
276 /* XXX: need to flush to get prim_vbuf.c to release its allocation??
278 draw_do_flush( draw
, DRAW_FLUSH_BACKEND
);
280 if (count
>= UNDEFINED_VERTEX_ID
)
283 if (!draw
->render
->allocate_vertices( draw
->render
,
284 (ushort
)feme
->translate
->key
.output_stride
,
288 hw_verts
= draw
->render
->map_vertices( draw
->render
);
292 /* Single routine to fetch vertices and emit HW verts.
294 feme
->translate
->run( feme
->translate
,
302 for (i
= 0; i
< count
; i
++) {
303 debug_printf("\n\nvertex %d:\n", i
);
304 draw_dump_emitted_vertex( feme
->vinfo
,
305 (const uint8_t *)hw_verts
+ feme
->vinfo
->size
* 4 * i
);
309 draw
->render
->unmap_vertices( draw
->render
, 0, count
- 1 );
311 /* XXX: Draw arrays path to avoid re-emitting index list again and
314 draw
->render
->draw_arrays( draw
->render
, 0, count
);
316 /* Done -- that was easy, wasn't it:
318 draw
->render
->release_vertices( draw
->render
);
327 static boolean
fetch_emit_run_linear_elts( struct draw_pt_middle_end
*middle
,
330 const ushort
*draw_elts
,
331 unsigned draw_count
)
333 struct fetch_emit_middle_end
*feme
= (struct fetch_emit_middle_end
*)middle
;
334 struct draw_context
*draw
= feme
->draw
;
337 /* XXX: need to flush to get prim_vbuf.c to release its allocation??
339 draw_do_flush( draw
, DRAW_FLUSH_BACKEND
);
341 if (count
>= UNDEFINED_VERTEX_ID
)
344 if (!draw
->render
->allocate_vertices( draw
->render
,
345 (ushort
)feme
->translate
->key
.output_stride
,
349 hw_verts
= draw
->render
->map_vertices( draw
->render
);
353 /* Single routine to fetch vertices and emit HW verts.
355 feme
->translate
->run( feme
->translate
,
361 draw
->render
->unmap_vertices( draw
->render
, 0, (ushort
)(count
- 1) );
363 /* XXX: Draw arrays path to avoid re-emitting index list again and
366 draw
->render
->draw_elements( draw
->render
,
370 /* Done -- that was easy, wasn't it:
372 draw
->render
->release_vertices( draw
->render
);
380 static void fetch_emit_finish( struct draw_pt_middle_end
*middle
)
385 static void fetch_emit_destroy( struct draw_pt_middle_end
*middle
)
387 struct fetch_emit_middle_end
*feme
= (struct fetch_emit_middle_end
*)middle
;
390 translate_cache_destroy(feme
->cache
);
396 struct draw_pt_middle_end
*draw_pt_fetch_emit( struct draw_context
*draw
)
398 struct fetch_emit_middle_end
*fetch_emit
= CALLOC_STRUCT( fetch_emit_middle_end
);
399 if (fetch_emit
== NULL
)
402 fetch_emit
->cache
= translate_cache_create();
403 if (!fetch_emit
->cache
) {
408 fetch_emit
->base
.prepare
= fetch_emit_prepare
;
409 fetch_emit
->base
.run
= fetch_emit_run
;
410 fetch_emit
->base
.run_linear
= fetch_emit_run_linear
;
411 fetch_emit
->base
.run_linear_elts
= fetch_emit_run_linear_elts
;
412 fetch_emit
->base
.finish
= fetch_emit_finish
;
413 fetch_emit
->base
.destroy
= fetch_emit_destroy
;
415 fetch_emit
->draw
= draw
;
417 return &fetch_emit
->base
;