2 Copyright (C) Intel Corp. 2006. All Rights Reserved.
3 Intel funded Tungsten Graphics (http://www.tungstengraphics.com) to
4 develop this 3D driver.
6 Permission is hereby granted, free of charge, to any person obtaining
7 a 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, sublicense, 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
16 portions of the Software.
18 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
19 EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
20 MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
21 IN NO EVENT SHALL THE COPYRIGHT OWNER(S) AND/OR ITS SUPPLIERS BE
22 LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
23 OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
24 WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
26 **********************************************************************/
29 * Keith Whitwell <keith@tungstengraphics.com>
32 #include "main/glheader.h"
33 #include "main/macros.h"
34 #include "main/enums.h"
36 #include "intel_batchbuffer.h"
38 #include "brw_defines.h"
39 #include "brw_context.h"
42 #include "brw_state.h"
47 static void compile_gs_prog( struct brw_context
*brw
,
48 struct brw_gs_prog_key
*key
)
50 struct intel_context
*intel
= &brw
->intel
;
51 struct brw_gs_compile c
;
52 const GLuint
*program
;
55 memset(&c
, 0, sizeof(c
));
58 /* Need to locate the two positions present in vertex + header.
59 * These are currently hardcoded:
61 c
.nr_attrs
= brw_count_bits(c
.key
.attrs
);
64 c
.nr_regs
= (c
.nr_attrs
+ 1) / 2 + 3; /* are vertices packed, or reg-aligned? */
66 c
.nr_regs
= (c
.nr_attrs
+ 1) / 2 + 1; /* are vertices packed, or reg-aligned? */
68 c
.nr_bytes
= c
.nr_regs
* REG_SIZE
;
71 /* Begin the compilation:
73 brw_init_compile(brw
, &c
.func
);
75 c
.func
.single_program_flow
= 1;
77 /* For some reason the thread is spawned with only 4 channels
80 brw_set_mask_control(&c
.func
, BRW_MASK_DISABLE
);
83 /* Note that primitives which don't require a GS program have
84 * already been weeded out by this stage:
86 switch (key
->primitive
) {
88 /* Gen6: VF has already converted into polygon. */
91 brw_gs_quads( &c
, key
);
96 brw_gs_quad_strip( &c
, key
);
99 /* Gen6: LINELOOP is converted to LINESTRIP at the beginning of the 3D pipeline */
105 if (key
->hint_gs_always
)
112 if (key
->hint_gs_always
)
119 if (key
->hint_gs_always
)
131 program
= brw_get_program(&c
.func
, &program_size
);
133 if (unlikely(INTEL_DEBUG
& DEBUG_GS
)) {
137 for (i
= 0; i
< program_size
/ sizeof(struct brw_instruction
); i
++)
138 brw_disasm(stdout
, &((struct brw_instruction
*)program
)[i
],
145 drm_intel_bo_unreference(brw
->gs
.prog_bo
);
146 brw
->gs
.prog_bo
= brw_upload_cache_with_auxdata(&brw
->cache
, BRW_GS_PROG
,
147 &c
.key
, sizeof(c
.key
),
149 program
, program_size
,
155 static const GLenum gs_prim
[GL_POLYGON
+1] = {
168 static void populate_key( struct brw_context
*brw
,
169 struct brw_gs_prog_key
*key
)
171 struct gl_context
*ctx
= &brw
->intel
.ctx
;
172 struct intel_context
*intel
= &brw
->intel
;
175 memset(key
, 0, sizeof(*key
));
177 /* CACHE_NEW_VS_PROG */
178 key
->attrs
= brw
->vs
.prog_data
->outputs_written
;
180 /* BRW_NEW_PRIMITIVE */
181 key
->primitive
= gs_prim
[brw
->primitive
];
183 key
->hint_gs_always
= 0; /* debug code? */
186 key
->pv_first
= (ctx
->Light
.ProvokingVertex
== GL_FIRST_VERTEX_CONVENTION
);
187 if (key
->primitive
== GL_QUADS
&& ctx
->Light
.ShadeModel
!= GL_FLAT
) {
188 /* Provide consistent primitive order with brw_set_prim's
189 * optimization of single quads to trifans.
191 key
->pv_first
= GL_TRUE
;
197 prim_gs_always
= brw
->primitive
== GL_QUADS
||
198 brw
->primitive
== GL_QUAD_STRIP
||
199 brw
->primitive
== GL_LINE_LOOP
;
201 key
->need_gs_prog
= (key
->hint_gs_always
|| prim_gs_always
);
204 /* Calculate interpolants for triangle and line rasterization.
206 static void prepare_gs_prog(struct brw_context
*brw
)
208 struct brw_gs_prog_key key
;
211 populate_key(brw
, &key
);
213 if (brw
->gs
.prog_active
!= key
.need_gs_prog
) {
214 brw
->state
.dirty
.cache
|= CACHE_NEW_GS_PROG
;
215 brw
->gs
.prog_active
= key
.need_gs_prog
;
218 drm_intel_bo_unreference(brw
->gs
.prog_bo
);
219 brw
->gs
.prog_bo
= NULL
;
221 if (brw
->gs
.prog_active
) {
222 brw
->gs
.prog_bo
= brw_search_cache(&brw
->cache
, BRW_GS_PROG
,
226 if (brw
->gs
.prog_bo
== NULL
)
227 compile_gs_prog( brw
, &key
);
232 const struct brw_tracked_state brw_gs_prog
= {
235 .brw
= BRW_NEW_PRIMITIVE
,
236 .cache
= CACHE_NEW_VS_PROG
238 .prepare
= prepare_gs_prog