1 /**************************************************************************
3 * Copyright 2003 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 **************************************************************************/
29 * Render unclipped vertex buffers by emitting vertices directly to
30 * dma buffers. Use strip/fan hardware acceleration where possible.
40 #include "tnl/t_context.h"
41 #include "tnl/t_vertex.h"
43 #include "intel_screen.h"
44 #include "intel_context.h"
45 #include "intel_tris.h"
46 #include "intel_batchbuffer.h"
47 #include "intel_reg.h"
50 * Render unclipped vertex buffers by emitting vertices directly to
51 * dma buffers. Use strip/fan hardware primitives where possible.
52 * Try to simulate missing primitives with indexed vertices.
54 #define HAVE_POINTS 0 /* Has it, but can't use because subpixel has to
55 * be adjusted for points on the INTEL/I845G
58 #define HAVE_LINE_STRIPS 1
59 #define HAVE_TRIANGLES 1
60 #define HAVE_TRI_STRIPS 1
61 #define HAVE_TRI_STRIP_1 0 /* has it, template can't use it yet */
62 #define HAVE_TRI_FANS 1
63 #define HAVE_POLYGONS 1
65 #define HAVE_QUAD_STRIPS 0
69 static GLuint hw_prim
[GL_POLYGON
+1] = {
82 static const GLenum reduced_prim
[GL_POLYGON
+1] = {
95 static const int scale_prim
[GL_POLYGON
+1] = {
96 0, /* fallback case */
103 0, /* fallback case */
104 0, /* fallback case */
109 static void intelDmaPrimitive( intelContextPtr intel
, GLenum prim
)
111 if (0) fprintf(stderr
, "%s %s\n", __FUNCTION__
, _mesa_lookup_enum_by_nr(prim
));
112 INTEL_FIREVERTICES(intel
);
113 intel
->vtbl
.reduced_primitive_state( intel
, reduced_prim
[prim
] );
114 intelStartInlinePrimitive( intel
, hw_prim
[prim
] );
118 #define LOCAL_VARS intelContextPtr intel = INTEL_CONTEXT(ctx)
119 #define INIT( prim ) \
121 intelDmaPrimitive( intel, prim ); \
123 #define FLUSH() INTEL_FIREVERTICES( intel )
125 #define GET_SUBSEQUENT_VB_MAX_VERTS() \
126 (((intel->alloc.size / 2) - 1500) / (intel->vertex_size*4))
127 #define GET_CURRENT_VB_MAX_VERTS() GET_SUBSEQUENT_VB_MAX_VERTS()
129 #define ALLOC_VERTS( nr ) \
130 intelExtendInlinePrimitive( intel, (nr) * intel->vertex_size )
132 #define EMIT_VERTS( ctx, j, nr, buf ) \
133 _tnl_emit_vertices_to_buffer(ctx, j, (j)+(nr), buf )
135 #define TAG(x) intel_##x
136 #include "tnl_dd/t_dd_dmatmp.h"
139 /**********************************************************************/
140 /* Render pipeline stage */
141 /**********************************************************************/
143 /* Heuristic to choose between the two render paths:
145 static GLboolean
choose_render( intelContextPtr intel
,
146 struct vertex_buffer
*VB
)
148 int vertsz
= intel
->vertex_size
;
150 int cost_fallback
= 0;
154 int rprim
= intel
->reduced_primitive
;
157 for (i
= 0 ; i
< VB
->PrimitiveCount
; i
++) {
158 GLuint prim
= VB
->Primitive
[i
].mode
;
159 GLuint length
= VB
->Primitive
[i
].count
;
165 nr_rverts
+= length
* scale_prim
[prim
& PRIM_MODE_MASK
];
167 if (reduced_prim
[prim
& PRIM_MODE_MASK
] != rprim
) {
169 rprim
= reduced_prim
[prim
& PRIM_MODE_MASK
];
173 /* One point for each generated primitive:
175 cost_render
= nr_prims
;
176 cost_fallback
= nr_rprims
;
178 /* One point for every 1024 dwords (4k) of dma:
180 cost_render
+= (vertsz
* i
) / 1024;
181 cost_fallback
+= (vertsz
* nr_rverts
) / 1024;
184 fprintf(stderr
, "cost render: %d fallback: %d\n",
185 cost_render
, cost_fallback
);
187 if (cost_render
> cost_fallback
)
194 static GLboolean
intel_run_render( GLcontext
*ctx
,
195 struct tnl_pipeline_stage
*stage
)
197 intelContextPtr intel
= INTEL_CONTEXT(ctx
);
198 TNLcontext
*tnl
= TNL_CONTEXT(ctx
);
199 struct vertex_buffer
*VB
= &tnl
->vb
;
202 /* Don't handle clipping or indexed vertices.
204 if (intel
->RenderIndex
!= 0 ||
205 !intel_validate_render( ctx
, VB
) ||
206 !choose_render( intel
, VB
)) {
210 tnl
->clipspace
.new_inputs
|= VERT_BIT_POS
;
212 tnl
->Driver
.Render
.Start( ctx
);
214 for (i
= 0 ; i
< VB
->PrimitiveCount
; i
++)
216 GLuint prim
= VB
->Primitive
[i
].mode
;
217 GLuint start
= VB
->Primitive
[i
].start
;
218 GLuint length
= VB
->Primitive
[i
].count
;
223 intel_render_tab_verts
[prim
& PRIM_MODE_MASK
]( ctx
, start
, start
+ length
,
227 tnl
->Driver
.Render
.Finish( ctx
);
229 return GL_FALSE
; /* finished the pipe */
233 static void intel_check_render( GLcontext
*ctx
,
234 struct tnl_pipeline_stage
*stage
)
236 stage
->inputs
= TNL_CONTEXT(ctx
)->render_inputs
;
239 static void dtr( struct tnl_pipeline_stage
*stage
)
245 const struct tnl_pipeline_stage _intel_render_stage
=
248 (_DD_NEW_SEPARATE_SPECULAR
|
251 _NEW_RENDERMODE
), /* re-check (new inputs) */
252 0, /* re-run (always runs) */
253 GL_TRUE
, /* active */
254 0, 0, /* inputs (set in check_render), outputs */
255 0, 0, /* changed_inputs, private */
256 dtr
, /* destructor */
257 intel_check_render
, /* check - initially set to alloc data */
258 intel_run_render
/* run */