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 OTHER LIABILITY, WHETHER IN
21 * AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
22 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
25 * Keith Whitwell <keith@tungstengraphics.com>
37 #ifndef NEED_EDGEFLAG_SETUP
38 #define NEED_EDGEFLAG_SETUP 0
39 #define EDGEFLAG_GET(a) 0
40 #define EDGEFLAG_SET(a,b) (void)b
48 #define TEST_PRIM_END(prim) (flags & PRIM_END)
49 #define TEST_PRIM_BEGIN(prim) (flags & PRIM_BEGIN)
56 #ifndef RENDER_TAB_QUALIFIER
57 #define RENDER_TAB_QUALIFIER static
60 static void TAG(render_points
)( struct gl_context
*ctx
,
69 RENDER_POINTS( start
, count
);
73 static void TAG(render_lines
)( struct gl_context
*ctx
,
83 for (j
=start
+1; j
<count
; j
+=2 ) {
85 if (ctx
->Light
.ProvokingVertex
== GL_LAST_VERTEX_CONVENTION_EXT
)
86 RENDER_LINE( ELT(j
-1), ELT(j
) );
88 RENDER_LINE( ELT(j
), ELT(j
-1) );
94 static void TAG(render_line_strip
)( struct gl_context
*ctx
,
105 if (TEST_PRIM_BEGIN(flags
)) {
109 for (j
=start
+1; j
<count
; j
++ ) {
110 if (ctx
->Light
.ProvokingVertex
== GL_LAST_VERTEX_CONVENTION_EXT
)
111 RENDER_LINE( ELT(j
-1), ELT(j
) );
113 RENDER_LINE( ELT(j
), ELT(j
-1) );
119 static void TAG(render_line_loop
)( struct gl_context
*ctx
,
131 if (start
+1 < count
) {
132 if (TEST_PRIM_BEGIN(flags
)) {
134 if (ctx
->Light
.ProvokingVertex
== GL_LAST_VERTEX_CONVENTION_EXT
)
135 RENDER_LINE( ELT(start
), ELT(start
+1) );
137 RENDER_LINE( ELT(start
+1), ELT(start
) );
140 for ( i
= start
+2 ; i
< count
; i
++) {
141 if (ctx
->Light
.ProvokingVertex
== GL_LAST_VERTEX_CONVENTION_EXT
)
142 RENDER_LINE( ELT(i
-1), ELT(i
) );
144 RENDER_LINE( ELT(i
), ELT(i
-1) );
147 if ( TEST_PRIM_END(flags
)) {
148 if (ctx
->Light
.ProvokingVertex
== GL_LAST_VERTEX_CONVENTION_EXT
)
149 RENDER_LINE( ELT(count
-1), ELT(start
) );
151 RENDER_LINE( ELT(start
), ELT(count
-1) );
159 static void TAG(render_triangles
)( struct gl_context
*ctx
,
169 if (NEED_EDGEFLAG_SETUP
) {
170 for (j
=start
+2; j
<count
; j
+=3) {
171 /* Leave the edgeflags as supplied by the user.
174 if (ctx
->Light
.ProvokingVertex
== GL_LAST_VERTEX_CONVENTION_EXT
)
175 RENDER_TRI( ELT(j
-2), ELT(j
-1), ELT(j
) );
177 RENDER_TRI( ELT(j
-1), ELT(j
), ELT(j
-2) );
180 for (j
=start
+2; j
<count
; j
+=3) {
181 if (ctx
->Light
.ProvokingVertex
== GL_LAST_VERTEX_CONVENTION_EXT
)
182 RENDER_TRI( ELT(j
-2), ELT(j
-1), ELT(j
) );
184 RENDER_TRI( ELT(j
-1), ELT(j
), ELT(j
-2) );
192 static void TAG(render_tri_strip
)( struct gl_context
*ctx
,
201 INIT(GL_TRIANGLE_STRIP
);
202 if (NEED_EDGEFLAG_SETUP
) {
203 for (j
=start
+2;j
<count
;j
++,parity
^=1) {
205 GLboolean ef2
, ef1
, ef
;
206 if (ctx
->Light
.ProvokingVertex
== GL_LAST_VERTEX_CONVENTION_EXT
) {
207 ej2
= ELT(j
-2+parity
);
208 ej1
= ELT(j
-1-parity
);
212 ej2
= ELT(j
-1+parity
);
216 ef2
= EDGEFLAG_GET( ej2
);
217 ef1
= EDGEFLAG_GET( ej1
);
218 ef
= EDGEFLAG_GET( ej
);
219 if (TEST_PRIM_BEGIN(flags
)) {
222 EDGEFLAG_SET( ej2
, GL_TRUE
);
223 EDGEFLAG_SET( ej1
, GL_TRUE
);
224 EDGEFLAG_SET( ej
, GL_TRUE
);
225 RENDER_TRI( ej2
, ej1
, ej
);
226 EDGEFLAG_SET( ej2
, ef2
);
227 EDGEFLAG_SET( ej1
, ef1
);
228 EDGEFLAG_SET( ej
, ef
);
231 for (j
=start
+2; j
<count
; j
++, parity
^=1) {
232 if (ctx
->Light
.ProvokingVertex
== GL_LAST_VERTEX_CONVENTION_EXT
)
233 RENDER_TRI( ELT(j
-2+parity
), ELT(j
-1-parity
), ELT(j
) );
235 RENDER_TRI( ELT(j
-1+parity
), ELT(j
-parity
), ELT(j
-2) );
242 static void TAG(render_tri_fan
)( struct gl_context
*ctx
,
251 INIT(GL_TRIANGLE_FAN
);
252 if (NEED_EDGEFLAG_SETUP
) {
253 for (j
=start
+2;j
<count
;j
++) {
254 /* For trifans, all edges are boundary.
256 GLuint ejs
= ELT(start
);
257 GLuint ej1
= ELT(j
-1);
259 GLboolean efs
= EDGEFLAG_GET( ejs
);
260 GLboolean ef1
= EDGEFLAG_GET( ej1
);
261 GLboolean ef
= EDGEFLAG_GET( ej
);
262 if (TEST_PRIM_BEGIN(flags
)) {
265 EDGEFLAG_SET( ejs
, GL_TRUE
);
266 EDGEFLAG_SET( ej1
, GL_TRUE
);
267 EDGEFLAG_SET( ej
, GL_TRUE
);
268 if (ctx
->Light
.ProvokingVertex
== GL_LAST_VERTEX_CONVENTION_EXT
)
269 RENDER_TRI( ejs
, ej1
, ej
);
271 RENDER_TRI( ej
, ejs
, ej1
);
272 EDGEFLAG_SET( ejs
, efs
);
273 EDGEFLAG_SET( ej1
, ef1
);
274 EDGEFLAG_SET( ej
, ef
);
277 for (j
=start
+2;j
<count
;j
++) {
278 if (ctx
->Light
.ProvokingVertex
== GL_LAST_VERTEX_CONVENTION_EXT
)
279 RENDER_TRI( ELT(start
), ELT(j
-1), ELT(j
) );
281 RENDER_TRI( ELT(j
), ELT(start
), ELT(j
-1) );
289 static void TAG(render_poly
)( struct gl_context
*ctx
,
299 if (NEED_EDGEFLAG_SETUP
) {
300 GLboolean efstart
= EDGEFLAG_GET( ELT(start
) );
301 GLboolean efcount
= EDGEFLAG_GET( ELT(count
-1) );
303 /* If the primitive does not begin here, the first edge
306 if (!TEST_PRIM_BEGIN(flags
))
307 EDGEFLAG_SET( ELT(start
), GL_FALSE
);
312 /* If the primitive does not end here, the final edge is
315 if (!TEST_PRIM_END(flags
))
316 EDGEFLAG_SET( ELT(count
-1), GL_FALSE
);
318 /* Draw the first triangles (possibly zero)
321 GLboolean ef
= EDGEFLAG_GET( ELT(j
) );
322 EDGEFLAG_SET( ELT(j
), GL_FALSE
);
323 RENDER_TRI( ELT(j
-1), ELT(j
), ELT(start
) );
324 EDGEFLAG_SET( ELT(j
), ef
);
327 /* Don't render the first edge again:
329 EDGEFLAG_SET( ELT(start
), GL_FALSE
);
331 for (;j
+1<count
;j
++) {
332 GLboolean efj
= EDGEFLAG_GET( ELT(j
) );
333 EDGEFLAG_SET( ELT(j
), GL_FALSE
);
334 RENDER_TRI( ELT(j
-1), ELT(j
), ELT(start
) );
335 EDGEFLAG_SET( ELT(j
), efj
);
339 /* Draw the last or only triangle
342 RENDER_TRI( ELT(j
-1), ELT(j
), ELT(start
) );
344 /* Restore the first and last edgeflags:
346 EDGEFLAG_SET( ELT(count
-1), efcount
);
347 EDGEFLAG_SET( ELT(start
), efstart
);
351 for (j
=start
+2;j
<count
;j
++) {
352 RENDER_TRI( ELT(j
-1), ELT(j
), ELT(start
) );
358 static void TAG(render_quads
)( struct gl_context
*ctx
,
368 if (NEED_EDGEFLAG_SETUP
) {
369 for (j
=start
+3; j
<count
; j
+=4) {
370 /* Use user-specified edgeflags for quads.
373 if (ctx
->Light
.ProvokingVertex
== GL_LAST_VERTEX_CONVENTION_EXT
||
374 !ctx
->Const
.QuadsFollowProvokingVertexConvention
)
375 RENDER_QUAD( ELT(j
-3), ELT(j
-2), ELT(j
-1), ELT(j
) );
377 RENDER_QUAD( ELT(j
-2), ELT(j
-1), ELT(j
), ELT(j
-3) );
380 for (j
=start
+3; j
<count
; j
+=4) {
381 if (ctx
->Light
.ProvokingVertex
== GL_LAST_VERTEX_CONVENTION_EXT
||
382 !ctx
->Const
.QuadsFollowProvokingVertexConvention
)
383 RENDER_QUAD( ELT(j
-3), ELT(j
-2), ELT(j
-1), ELT(j
) );
385 RENDER_QUAD( ELT(j
-2), ELT(j
-1), ELT(j
), ELT(j
-3) );
391 static void TAG(render_quad_strip
)( struct gl_context
*ctx
,
401 if (NEED_EDGEFLAG_SETUP
) {
402 for (j
=start
+3;j
<count
;j
+=2) {
403 /* All edges are boundary. Set edgeflags to 1, draw the
404 * quad, and restore them to the original values.
406 GLboolean ef3
= EDGEFLAG_GET( ELT(j
-3) );
407 GLboolean ef2
= EDGEFLAG_GET( ELT(j
-2) );
408 GLboolean ef1
= EDGEFLAG_GET( ELT(j
-1) );
409 GLboolean ef
= EDGEFLAG_GET( ELT(j
) );
410 if (TEST_PRIM_BEGIN(flags
)) {
413 EDGEFLAG_SET( ELT(j
-3), GL_TRUE
);
414 EDGEFLAG_SET( ELT(j
-2), GL_TRUE
);
415 EDGEFLAG_SET( ELT(j
-1), GL_TRUE
);
416 EDGEFLAG_SET( ELT(j
), GL_TRUE
);
417 if (ctx
->Light
.ProvokingVertex
== GL_LAST_VERTEX_CONVENTION_EXT
||
418 !ctx
->Const
.QuadsFollowProvokingVertexConvention
)
419 RENDER_QUAD( ELT(j
-1), ELT(j
-3), ELT(j
-2), ELT(j
) );
421 RENDER_QUAD( ELT(j
-2), ELT(j
), ELT(j
-1), ELT(j
-3) );
422 EDGEFLAG_SET( ELT(j
-3), ef3
);
423 EDGEFLAG_SET( ELT(j
-2), ef2
);
424 EDGEFLAG_SET( ELT(j
-1), ef1
);
425 EDGEFLAG_SET( ELT(j
), ef
);
428 for (j
=start
+3;j
<count
;j
+=2) {
429 if (ctx
->Light
.ProvokingVertex
== GL_LAST_VERTEX_CONVENTION_EXT
||
430 !ctx
->Const
.QuadsFollowProvokingVertexConvention
)
431 RENDER_QUAD( ELT(j
-1), ELT(j
-3), ELT(j
-2), ELT(j
) );
433 RENDER_QUAD( ELT(j
-2), ELT(j
), ELT(j
-1), ELT(j
-3) );
439 static void TAG(render_noop
)( struct gl_context
*ctx
,
444 (void)(ctx
&& start
&& count
&& flags
);
447 RENDER_TAB_QUALIFIER
void (*TAG(render_tab
)[GL_POLYGON
+2])(struct gl_context
*,
454 TAG(render_line_loop
),
455 TAG(render_line_strip
),
456 TAG(render_triangles
),
457 TAG(render_tri_strip
),
460 TAG(render_quad_strip
),
467 #ifndef PRESERVE_VB_DEFS
478 #undef RENDER_TAB_QUALIFIER
485 #undef PRESERVE_VB_DEFS