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 **************************************************************************/
33 #include "api_validate.h"
37 #include "brw_defines.h"
38 #include "brw_context.h"
39 #include "brw_state.h"
40 #include "brw_fallback.h"
42 #include "intel_ioctl.h"
43 #include "intel_batchbuffer.h"
44 #include "intel_buffer_objects.h"
47 #include "vbo/vbo_context.h"
48 #include "swrast/swrast.h"
49 #include "swrast_setup/swrast_setup.h"
51 #define FILE_DEBUG_FLAG DEBUG_BATCH
53 static GLuint hw_prim
[GL_POLYGON
+1] = {
67 static const GLenum reduced_prim
[GL_POLYGON
+1] = {
81 /* When the primitive changes, set a state bit and re-validate. Not
82 * the nicest and would rather deal with this by having all the
83 * programs be immune to the active primitive (ie. cope with all
84 * possibilities). That may not be realistic however.
86 static GLuint
brw_set_prim(struct brw_context
*brw
, GLenum prim
)
88 if (INTEL_DEBUG
& DEBUG_PRIMS
)
89 _mesa_printf("PRIM: %s\n", _mesa_lookup_enum_by_nr(prim
));
91 /* Slight optimization to avoid the GS program when not needed:
93 if (prim
== GL_QUAD_STRIP
&&
94 brw
->attribs
.Light
->ShadeModel
!= GL_FLAT
&&
95 brw
->attribs
.Polygon
->FrontMode
== GL_FILL
&&
96 brw
->attribs
.Polygon
->BackMode
== GL_FILL
)
97 prim
= GL_TRIANGLE_STRIP
;
99 if (prim
!= brw
->primitive
) {
100 brw
->primitive
= prim
;
101 brw
->state
.dirty
.brw
|= BRW_NEW_PRIMITIVE
;
103 if (reduced_prim
[prim
] != brw
->intel
.reduced_primitive
) {
104 brw
->intel
.reduced_primitive
= reduced_prim
[prim
];
105 brw
->state
.dirty
.brw
|= BRW_NEW_REDUCED_PRIMITIVE
;
108 brw_validate_state(brw
);
111 return hw_prim
[prim
];
115 static GLuint
trim(GLenum prim
, GLuint length
)
117 if (prim
== GL_QUAD_STRIP
)
118 return length
> 3 ? (length
- length
% 2) : 0;
119 else if (prim
== GL_QUADS
)
120 return length
- length
% 4;
126 static void brw_emit_prim( struct brw_context
*brw
,
127 const struct _mesa_prim
*prim
)
130 struct brw_3d_primitive prim_packet
;
132 if (INTEL_DEBUG
& DEBUG_PRIMS
)
133 _mesa_printf("PRIM: %s %d %d\n", _mesa_lookup_enum_by_nr(prim
->mode
),
134 prim
->start
, prim
->count
);
136 prim_packet
.header
.opcode
= CMD_3D_PRIM
;
137 prim_packet
.header
.length
= sizeof(prim_packet
)/4 - 2;
138 prim_packet
.header
.pad
= 0;
139 prim_packet
.header
.topology
= brw_set_prim(brw
, prim
->mode
);
140 prim_packet
.header
.indexed
= prim
->indexed
;
142 prim_packet
.verts_per_instance
= trim(prim
->mode
, prim
->count
);
143 prim_packet
.start_vert_location
= prim
->start
;
144 prim_packet
.instance_count
= 1;
145 prim_packet
.start_instance_location
= 0;
146 prim_packet
.base_vert_location
= 0;
148 /* Can't wrap here, since we rely on the validated state. */
149 brw
->no_batch_wrap
= GL_TRUE
;
150 if (prim_packet
.verts_per_instance
) {
151 intel_batchbuffer_data( brw
->intel
.batch
, &prim_packet
,
152 sizeof(prim_packet
), LOOP_CLIPRECTS
);
154 brw
->no_batch_wrap
= GL_FALSE
;
157 static void brw_merge_inputs( struct brw_context
*brw
,
158 const struct gl_client_array
*arrays
[])
160 struct brw_vertex_element
*inputs
= brw
->vb
.inputs
;
161 struct brw_vertex_info old
= brw
->vb
.info
;
164 memset(inputs
, 0, sizeof(*inputs
));
165 memset(&brw
->vb
.info
, 0, sizeof(brw
->vb
.info
));
167 for (i
= 0; i
< VERT_ATTRIB_MAX
; i
++) {
168 brw
->vb
.inputs
[i
].glarray
= arrays
[i
];
170 /* XXX: metaops passes null arrays */
172 if (arrays
[i
]->StrideB
!= 0)
173 brw
->vb
.info
.varying
|= 1 << i
;
175 brw
->vb
.info
.sizes
[i
/16] |= (inputs
[i
].glarray
->Size
- 1) << ((i
%16) * 2);
179 /* Raise statechanges if input sizes and varying have changed:
181 if (memcmp(brw
->vb
.info
.sizes
, old
.sizes
, sizeof(old
.sizes
)) != 0)
182 brw
->state
.dirty
.brw
|= BRW_NEW_INPUT_DIMENSIONS
;
184 if (brw
->vb
.info
.varying
!= old
.varying
)
185 brw
->state
.dirty
.brw
|= BRW_NEW_INPUT_VARYING
;
188 /* XXX: could split the primitive list to fallback only on the
189 * non-conformant primitives.
191 static GLboolean
check_fallbacks( struct brw_context
*brw
,
192 const struct _mesa_prim
*prim
,
197 if (!brw
->intel
.strict_conformance
)
200 if (brw
->attribs
.Polygon
->SmoothFlag
) {
201 for (i
= 0; i
< nr_prims
; i
++)
202 if (reduced_prim
[prim
[i
].mode
] == GL_TRIANGLES
)
206 /* BRW hardware will do AA lines, but they are non-conformant it
207 * seems. TBD whether we keep this fallback:
209 if (brw
->attribs
.Line
->SmoothFlag
) {
210 for (i
= 0; i
< nr_prims
; i
++)
211 if (reduced_prim
[prim
[i
].mode
] == GL_LINES
)
215 /* Stipple -- these fallbacks could be resolved with a little
218 if (brw
->attribs
.Line
->StippleFlag
) {
219 for (i
= 0; i
< nr_prims
; i
++) {
220 /* GS doesn't get enough information to know when to reset
221 * the stipple counter?!?
223 if (prim
[i
].mode
== GL_LINE_LOOP
)
226 if (prim
[i
].mode
== GL_POLYGON
&&
227 (brw
->attribs
.Polygon
->FrontMode
== GL_LINE
||
228 brw
->attribs
.Polygon
->BackMode
== GL_LINE
))
234 if (brw
->attribs
.Point
->SmoothFlag
) {
235 for (i
= 0; i
< nr_prims
; i
++)
236 if (prim
[i
].mode
== GL_POINTS
)
243 /* May fail if out of video memory for texture or vbo upload, or on
244 * fallback conditions.
246 static GLboolean
brw_try_draw_prims( GLcontext
*ctx
,
247 const struct gl_client_array
*arrays
[],
248 const struct _mesa_prim
*prim
,
250 const struct _mesa_index_buffer
*ib
,
254 struct intel_context
*intel
= intel_context(ctx
);
255 struct brw_context
*brw
= brw_context(ctx
);
256 GLboolean retval
= GL_FALSE
;
260 _mesa_update_state( ctx
);
262 brw_validate_textures( brw
);
264 /* Bind all inputs, derive varying and size information:
266 brw_merge_inputs( brw
, arrays
);
269 brw
->state
.dirty
.brw
|= BRW_NEW_INDICES
;
271 brw
->vb
.min_index
= min_index
;
272 brw
->vb
.max_index
= max_index
;
273 brw
->state
.dirty
.brw
|= BRW_NEW_VERTICES
;
274 /* Have to validate state quite late. Will rebuild tnl_program,
275 * which depends on varying information.
277 * Note this is where brw->vs->prog_data.inputs_read is calculated,
278 * so can't access it earlier.
281 LOCK_HARDWARE(intel
);
283 if (brw
->intel
.numClipRects
== 0) {
284 UNLOCK_HARDWARE(intel
);
289 /* Flush the batch if it's approaching full, so that we don't wrap while
290 * we've got validated state that needs to be in the same batch as the
291 * primitives. This fraction is just a guess (minimal full state plus
292 * a primitive is around 512 bytes), and would be better if we had
293 * an upper bound of how much we might emit in a single
294 * brw_try_draw_prims().
296 if (intel
->batch
->ptr
- intel
->batch
->map
> intel
->batch
->size
* 3 / 4
297 /* brw_emit_prim may change the cliprect_mode to LOOP_CLIPRECTS */
298 || intel
->batch
->cliprect_mode
!= LOOP_CLIPRECTS
)
299 intel_batchbuffer_flush(intel
->batch
);
301 /* Set the first primitive early, ahead of validate_state:
303 brw_set_prim(brw
, prim
[0].mode
);
305 /* XXX: Need to separate validate and upload of state.
307 brw_validate_state( brw
);
309 /* Various fallback checks:
311 if (brw
->intel
.Fallback
)
314 if (check_fallbacks( brw
, prim
, nr_prims
))
317 for (i
= 0; i
< nr_prims
; i
++) {
318 brw_emit_prim(brw
, &prim
[i
]);
325 UNLOCK_HARDWARE(intel
);
328 DBG("%s failed\n", __FUNCTION__
);
333 static GLboolean
brw_need_rebase( GLcontext
*ctx
,
334 const struct gl_client_array
*arrays
[],
335 const struct _mesa_index_buffer
*ib
,
342 if (!vbo_all_varyings_in_vbos(arrays
))
348 /* Hmm. This isn't quite what I wanted. BRW can actually
349 * handle the mixed case well enough that we shouldn't need to
350 * rebase. However, it's probably not very common, nor hugely
351 * expensive to do it this way:
353 if (!vbo_all_varyings_in_vbos(arrays
))
361 void brw_draw_prims( GLcontext
*ctx
,
362 const struct gl_client_array
*arrays
[],
363 const struct _mesa_prim
*prim
,
365 const struct _mesa_index_buffer
*ib
,
371 /* Decide if we want to rebase. If so we end up recursing once
372 * only into this function.
374 if (brw_need_rebase( ctx
, arrays
, ib
, min_index
)) {
375 vbo_rebase_prims( ctx
, arrays
,
377 ib
, min_index
, max_index
,
384 /* Make a first attempt at drawing:
386 retval
= brw_try_draw_prims(ctx
, arrays
, prim
, nr_prims
, ib
, min_index
, max_index
);
388 /* Otherwise, we really are out of memory. Pass the drawing
389 * command to the software tnl module and which will in turn call
390 * swrast to do the drawing.
393 _swsetup_Wakeup(ctx
);
394 _tnl_draw_prims(ctx
, arrays
, prim
, nr_prims
, ib
, min_index
, max_index
);
398 void brw_draw_init( struct brw_context
*brw
)
400 GLcontext
*ctx
= &brw
->intel
.ctx
;
401 struct vbo_context
*vbo
= vbo_context(ctx
);
403 /* Register our drawing function:
405 vbo
->draw_prims
= brw_draw_prims
;
408 void brw_draw_destroy( struct brw_context
*brw
)
410 if (brw
->vb
.upload
.bo
!= NULL
) {
411 dri_bo_unreference(brw
->vb
.upload
.bo
);
412 brw
->vb
.upload
.bo
= NULL
;