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 /* Gen6: VF has already converted into polygon, and LINELOOP is
56 * converted to LINESTRIP at the beginning of the 3D pipeline.
61 memset(&c
, 0, sizeof(c
));
64 /* Need to locate the two positions present in vertex + header.
65 * These are currently hardcoded:
67 c
.nr_attrs
= brw_count_bits(c
.key
.attrs
);
70 c
.nr_regs
= (c
.nr_attrs
+ 1) / 2 + 3; /* are vertices packed, or reg-aligned? */
72 c
.nr_regs
= (c
.nr_attrs
+ 1) / 2 + 1; /* are vertices packed, or reg-aligned? */
74 c
.nr_bytes
= c
.nr_regs
* REG_SIZE
;
77 /* Begin the compilation:
79 brw_init_compile(brw
, &c
.func
);
81 c
.func
.single_program_flow
= 1;
83 /* For some reason the thread is spawned with only 4 channels
86 brw_set_mask_control(&c
.func
, BRW_MASK_DISABLE
);
89 /* Note that primitives which don't require a GS program have
90 * already been weeded out by this stage:
93 switch (key
->primitive
) {
95 brw_gs_quads( &c
, key
);
98 brw_gs_quad_strip( &c
, key
);
109 program
= brw_get_program(&c
.func
, &program_size
);
111 if (unlikely(INTEL_DEBUG
& DEBUG_GS
)) {
115 for (i
= 0; i
< program_size
/ sizeof(struct brw_instruction
); i
++)
116 brw_disasm(stdout
, &((struct brw_instruction
*)program
)[i
],
123 drm_intel_bo_unreference(brw
->gs
.prog_bo
);
124 brw
->gs
.prog_bo
= brw_upload_cache(&brw
->cache
, BRW_GS_PROG
,
125 &c
.key
, sizeof(c
.key
),
126 program
, program_size
,
127 &c
.prog_data
, sizeof(c
.prog_data
),
131 static const GLenum gs_prim
[GL_POLYGON
+1] = {
144 static void populate_key( struct brw_context
*brw
,
145 struct brw_gs_prog_key
*key
)
147 struct gl_context
*ctx
= &brw
->intel
.ctx
;
148 struct intel_context
*intel
= &brw
->intel
;
150 memset(key
, 0, sizeof(*key
));
152 /* CACHE_NEW_VS_PROG */
153 key
->attrs
= brw
->vs
.prog_data
->outputs_written
;
155 /* BRW_NEW_PRIMITIVE */
156 key
->primitive
= gs_prim
[brw
->primitive
];
159 key
->pv_first
= (ctx
->Light
.ProvokingVertex
== GL_FIRST_VERTEX_CONVENTION
);
160 if (key
->primitive
== GL_QUADS
&& ctx
->Light
.ShadeModel
!= GL_FLAT
) {
161 /* Provide consistent primitive order with brw_set_prim's
162 * optimization of single quads to trifans.
164 key
->pv_first
= GL_TRUE
;
167 key
->need_gs_prog
= (intel
->gen
== 6)
169 : (brw
->primitive
== GL_QUADS
||
170 brw
->primitive
== GL_QUAD_STRIP
||
171 brw
->primitive
== GL_LINE_LOOP
);
174 /* Calculate interpolants for triangle and line rasterization.
176 static void prepare_gs_prog(struct brw_context
*brw
)
178 struct brw_gs_prog_key key
;
181 populate_key(brw
, &key
);
183 if (brw
->gs
.prog_active
!= key
.need_gs_prog
) {
184 brw
->state
.dirty
.cache
|= CACHE_NEW_GS_PROG
;
185 brw
->gs
.prog_active
= key
.need_gs_prog
;
188 drm_intel_bo_unreference(brw
->gs
.prog_bo
);
189 brw
->gs
.prog_bo
= NULL
;
191 if (brw
->gs
.prog_active
) {
192 brw
->gs
.prog_bo
= brw_search_cache(&brw
->cache
, BRW_GS_PROG
,
195 if (brw
->gs
.prog_bo
== NULL
)
196 compile_gs_prog( brw
, &key
);
201 const struct brw_tracked_state brw_gs_prog
= {
204 .brw
= BRW_NEW_PRIMITIVE
,
205 .cache
= CACHE_NEW_VS_PROG
207 .prepare
= prepare_gs_prog