2 * Mesa 3-D graphics library
5 * Copyright (C) 1999-2005 Brian Paul All Rights Reserved.
7 * Permission is hereby granted, free of charge, to any person obtaining a
8 * copy of this software and associated documentation files (the "Software"),
9 * to deal in the Software without restriction, including without limitation
10 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
11 * and/or sell copies of the Software, and to permit persons to whom the
12 * Software is furnished to do so, subject to the following conditions:
14 * The above copyright notice and this permission notice shall be included
15 * in all copies or substantial portions of the Software.
17 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
18 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
19 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
20 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR
21 * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
22 * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
23 * OTHER DEALINGS IN THE SOFTWARE.
26 * Keith Whitwell <keith@tungstengraphics.com>
38 #ifndef NEED_EDGEFLAG_SETUP
39 #define NEED_EDGEFLAG_SETUP 0
40 #define EDGEFLAG_GET(a) 0
41 #define EDGEFLAG_SET(a,b) (void)b
49 #define TEST_PRIM_END(prim) (flags & PRIM_END)
50 #define TEST_PRIM_BEGIN(prim) (flags & PRIM_BEGIN)
57 #ifndef RENDER_TAB_QUALIFIER
58 #define RENDER_TAB_QUALIFIER static
61 static void TAG(render_points
)( struct gl_context
*ctx
,
70 RENDER_POINTS( start
, count
);
74 static void TAG(render_lines
)( struct gl_context
*ctx
,
84 for (j
=start
+1; j
<count
; j
+=2 ) {
86 if (ctx
->Light
.ProvokingVertex
== GL_LAST_VERTEX_CONVENTION_EXT
)
87 RENDER_LINE( ELT(j
-1), ELT(j
) );
89 RENDER_LINE( ELT(j
), ELT(j
-1) );
95 static void TAG(render_line_strip
)( struct gl_context
*ctx
,
106 if (TEST_PRIM_BEGIN(flags
)) {
110 for (j
=start
+1; j
<count
; j
++ ) {
111 if (ctx
->Light
.ProvokingVertex
== GL_LAST_VERTEX_CONVENTION_EXT
)
112 RENDER_LINE( ELT(j
-1), ELT(j
) );
114 RENDER_LINE( ELT(j
), ELT(j
-1) );
120 static void TAG(render_line_loop
)( struct gl_context
*ctx
,
132 if (start
+1 < count
) {
133 if (TEST_PRIM_BEGIN(flags
)) {
135 if (ctx
->Light
.ProvokingVertex
== GL_LAST_VERTEX_CONVENTION_EXT
)
136 RENDER_LINE( ELT(start
), ELT(start
+1) );
138 RENDER_LINE( ELT(start
+1), ELT(start
) );
141 for ( i
= start
+2 ; i
< count
; i
++) {
142 if (ctx
->Light
.ProvokingVertex
== GL_LAST_VERTEX_CONVENTION_EXT
)
143 RENDER_LINE( ELT(i
-1), ELT(i
) );
145 RENDER_LINE( ELT(i
), ELT(i
-1) );
148 if ( TEST_PRIM_END(flags
)) {
149 if (ctx
->Light
.ProvokingVertex
== GL_LAST_VERTEX_CONVENTION_EXT
)
150 RENDER_LINE( ELT(count
-1), ELT(start
) );
152 RENDER_LINE( ELT(start
), ELT(count
-1) );
160 static void TAG(render_triangles
)( struct gl_context
*ctx
,
170 if (NEED_EDGEFLAG_SETUP
) {
171 for (j
=start
+2; j
<count
; j
+=3) {
172 /* Leave the edgeflags as supplied by the user.
175 if (ctx
->Light
.ProvokingVertex
== GL_LAST_VERTEX_CONVENTION_EXT
)
176 RENDER_TRI( ELT(j
-2), ELT(j
-1), ELT(j
) );
178 RENDER_TRI( ELT(j
-1), ELT(j
), ELT(j
-2) );
181 for (j
=start
+2; j
<count
; j
+=3) {
182 if (ctx
->Light
.ProvokingVertex
== GL_LAST_VERTEX_CONVENTION_EXT
)
183 RENDER_TRI( ELT(j
-2), ELT(j
-1), ELT(j
) );
185 RENDER_TRI( ELT(j
-1), ELT(j
), ELT(j
-2) );
193 static void TAG(render_tri_strip
)( struct gl_context
*ctx
,
202 INIT(GL_TRIANGLE_STRIP
);
203 if (NEED_EDGEFLAG_SETUP
) {
204 for (j
=start
+2;j
<count
;j
++,parity
^=1) {
206 GLboolean ef2
, ef1
, ef
;
207 if (ctx
->Light
.ProvokingVertex
== GL_LAST_VERTEX_CONVENTION_EXT
) {
208 ej2
= ELT(j
-2+parity
);
209 ej1
= ELT(j
-1-parity
);
213 ej2
= ELT(j
-1+parity
);
217 ef2
= EDGEFLAG_GET( ej2
);
218 ef1
= EDGEFLAG_GET( ej1
);
219 ef
= EDGEFLAG_GET( ej
);
220 if (TEST_PRIM_BEGIN(flags
)) {
223 EDGEFLAG_SET( ej2
, GL_TRUE
);
224 EDGEFLAG_SET( ej1
, GL_TRUE
);
225 EDGEFLAG_SET( ej
, GL_TRUE
);
226 RENDER_TRI( ej2
, ej1
, ej
);
227 EDGEFLAG_SET( ej2
, ef2
);
228 EDGEFLAG_SET( ej1
, ef1
);
229 EDGEFLAG_SET( ej
, ef
);
232 for (j
=start
+2; j
<count
; j
++, parity
^=1) {
233 if (ctx
->Light
.ProvokingVertex
== GL_LAST_VERTEX_CONVENTION_EXT
)
234 RENDER_TRI( ELT(j
-2+parity
), ELT(j
-1-parity
), ELT(j
) );
236 RENDER_TRI( ELT(j
-1+parity
), ELT(j
-parity
), ELT(j
-2) );
243 static void TAG(render_tri_fan
)( struct gl_context
*ctx
,
252 INIT(GL_TRIANGLE_FAN
);
253 if (NEED_EDGEFLAG_SETUP
) {
254 for (j
=start
+2;j
<count
;j
++) {
255 /* For trifans, all edges are boundary.
257 GLuint ejs
= ELT(start
);
258 GLuint ej1
= ELT(j
-1);
260 GLboolean efs
= EDGEFLAG_GET( ejs
);
261 GLboolean ef1
= EDGEFLAG_GET( ej1
);
262 GLboolean ef
= EDGEFLAG_GET( ej
);
263 if (TEST_PRIM_BEGIN(flags
)) {
266 EDGEFLAG_SET( ejs
, GL_TRUE
);
267 EDGEFLAG_SET( ej1
, GL_TRUE
);
268 EDGEFLAG_SET( ej
, GL_TRUE
);
269 if (ctx
->Light
.ProvokingVertex
== GL_LAST_VERTEX_CONVENTION_EXT
)
270 RENDER_TRI( ejs
, ej1
, ej
);
272 RENDER_TRI( ej
, ejs
, ej1
);
273 EDGEFLAG_SET( ejs
, efs
);
274 EDGEFLAG_SET( ej1
, ef1
);
275 EDGEFLAG_SET( ej
, ef
);
278 for (j
=start
+2;j
<count
;j
++) {
279 if (ctx
->Light
.ProvokingVertex
== GL_LAST_VERTEX_CONVENTION_EXT
)
280 RENDER_TRI( ELT(start
), ELT(j
-1), ELT(j
) );
282 RENDER_TRI( ELT(j
), ELT(start
), ELT(j
-1) );
290 static void TAG(render_poly
)( struct gl_context
*ctx
,
300 if (NEED_EDGEFLAG_SETUP
) {
301 GLboolean efstart
= EDGEFLAG_GET( ELT(start
) );
302 GLboolean efcount
= EDGEFLAG_GET( ELT(count
-1) );
304 /* If the primitive does not begin here, the first edge
307 if (!TEST_PRIM_BEGIN(flags
))
308 EDGEFLAG_SET( ELT(start
), GL_FALSE
);
313 /* If the primitive does not end here, the final edge is
316 if (!TEST_PRIM_END(flags
))
317 EDGEFLAG_SET( ELT(count
-1), GL_FALSE
);
319 /* Draw the first triangles (possibly zero)
322 GLboolean ef
= EDGEFLAG_GET( ELT(j
) );
323 EDGEFLAG_SET( ELT(j
), GL_FALSE
);
324 RENDER_TRI( ELT(j
-1), ELT(j
), ELT(start
) );
325 EDGEFLAG_SET( ELT(j
), ef
);
328 /* Don't render the first edge again:
330 EDGEFLAG_SET( ELT(start
), GL_FALSE
);
332 for (;j
+1<count
;j
++) {
333 GLboolean efj
= EDGEFLAG_GET( ELT(j
) );
334 EDGEFLAG_SET( ELT(j
), GL_FALSE
);
335 RENDER_TRI( ELT(j
-1), ELT(j
), ELT(start
) );
336 EDGEFLAG_SET( ELT(j
), efj
);
340 /* Draw the last or only triangle
343 RENDER_TRI( ELT(j
-1), ELT(j
), ELT(start
) );
345 /* Restore the first and last edgeflags:
347 EDGEFLAG_SET( ELT(count
-1), efcount
);
348 EDGEFLAG_SET( ELT(start
), efstart
);
352 for (j
=start
+2;j
<count
;j
++) {
353 RENDER_TRI( ELT(j
-1), ELT(j
), ELT(start
) );
359 static void TAG(render_quads
)( struct gl_context
*ctx
,
369 if (NEED_EDGEFLAG_SETUP
) {
370 for (j
=start
+3; j
<count
; j
+=4) {
371 /* Use user-specified edgeflags for quads.
374 if (ctx
->Light
.ProvokingVertex
== GL_LAST_VERTEX_CONVENTION_EXT
||
375 !ctx
->Const
.QuadsFollowProvokingVertexConvention
)
376 RENDER_QUAD( ELT(j
-3), ELT(j
-2), ELT(j
-1), ELT(j
) );
378 RENDER_QUAD( ELT(j
-2), ELT(j
-1), ELT(j
), ELT(j
-3) );
381 for (j
=start
+3; j
<count
; j
+=4) {
382 if (ctx
->Light
.ProvokingVertex
== GL_LAST_VERTEX_CONVENTION_EXT
||
383 !ctx
->Const
.QuadsFollowProvokingVertexConvention
)
384 RENDER_QUAD( ELT(j
-3), ELT(j
-2), ELT(j
-1), ELT(j
) );
386 RENDER_QUAD( ELT(j
-2), ELT(j
-1), ELT(j
), ELT(j
-3) );
392 static void TAG(render_quad_strip
)( struct gl_context
*ctx
,
402 if (NEED_EDGEFLAG_SETUP
) {
403 for (j
=start
+3;j
<count
;j
+=2) {
404 /* All edges are boundary. Set edgeflags to 1, draw the
405 * quad, and restore them to the original values.
407 GLboolean ef3
= EDGEFLAG_GET( ELT(j
-3) );
408 GLboolean ef2
= EDGEFLAG_GET( ELT(j
-2) );
409 GLboolean ef1
= EDGEFLAG_GET( ELT(j
-1) );
410 GLboolean ef
= EDGEFLAG_GET( ELT(j
) );
411 if (TEST_PRIM_BEGIN(flags
)) {
414 EDGEFLAG_SET( ELT(j
-3), GL_TRUE
);
415 EDGEFLAG_SET( ELT(j
-2), GL_TRUE
);
416 EDGEFLAG_SET( ELT(j
-1), GL_TRUE
);
417 EDGEFLAG_SET( ELT(j
), GL_TRUE
);
418 if (ctx
->Light
.ProvokingVertex
== GL_LAST_VERTEX_CONVENTION_EXT
||
419 !ctx
->Const
.QuadsFollowProvokingVertexConvention
)
420 RENDER_QUAD( ELT(j
-1), ELT(j
-3), ELT(j
-2), ELT(j
) );
422 RENDER_QUAD( ELT(j
-2), ELT(j
), ELT(j
-1), ELT(j
-3) );
423 EDGEFLAG_SET( ELT(j
-3), ef3
);
424 EDGEFLAG_SET( ELT(j
-2), ef2
);
425 EDGEFLAG_SET( ELT(j
-1), ef1
);
426 EDGEFLAG_SET( ELT(j
), ef
);
429 for (j
=start
+3;j
<count
;j
+=2) {
430 if (ctx
->Light
.ProvokingVertex
== GL_LAST_VERTEX_CONVENTION_EXT
||
431 !ctx
->Const
.QuadsFollowProvokingVertexConvention
)
432 RENDER_QUAD( ELT(j
-1), ELT(j
-3), ELT(j
-2), ELT(j
) );
434 RENDER_QUAD( ELT(j
-2), ELT(j
), ELT(j
-1), ELT(j
-3) );
440 static void TAG(render_noop
)( struct gl_context
*ctx
,
445 (void)(ctx
&& start
&& count
&& flags
);
448 RENDER_TAB_QUALIFIER
void (*TAG(render_tab
)[GL_POLYGON
+2])(struct gl_context
*,
455 TAG(render_line_loop
),
456 TAG(render_line_strip
),
457 TAG(render_triangles
),
458 TAG(render_tri_strip
),
461 TAG(render_quad_strip
),
468 #ifndef PRESERVE_VB_DEFS
479 #undef RENDER_TAB_QUALIFIER
486 #undef PRESERVE_VB_DEFS