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 * BRIAN PAUL 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 RENDER_LINE( ELT(j
-1), ELT(j
) );
91 static void TAG(render_line_strip
)( struct gl_context
*ctx
,
102 if (TEST_PRIM_BEGIN(flags
)) {
106 for (j
=start
+1; j
<count
; j
++ ) {
107 RENDER_LINE( ELT(j
-1), ELT(j
) );
113 static void TAG(render_line_loop
)( struct gl_context
*ctx
,
125 if (start
+1 < count
) {
126 if (TEST_PRIM_BEGIN(flags
)) {
128 RENDER_LINE( ELT(start
), ELT(start
+1) );
131 for ( i
= start
+2 ; i
< count
; i
++) {
132 RENDER_LINE( ELT(i
-1), ELT(i
) );
135 if ( TEST_PRIM_END(flags
)) {
136 RENDER_LINE( ELT(count
-1), ELT(start
) );
144 static void TAG(render_triangles
)( struct gl_context
*ctx
,
154 if (NEED_EDGEFLAG_SETUP
) {
155 for (j
=start
+2; j
<count
; j
+=3) {
156 /* Leave the edgeflags as supplied by the user.
159 RENDER_TRI( ELT(j
-2), ELT(j
-1), ELT(j
) );
162 for (j
=start
+2; j
<count
; j
+=3) {
163 RENDER_TRI( ELT(j
-2), ELT(j
-1), ELT(j
) );
171 static void TAG(render_tri_strip
)( struct gl_context
*ctx
,
180 INIT(GL_TRIANGLE_STRIP
);
181 if (NEED_EDGEFLAG_SETUP
) {
182 for (j
=start
+2;j
<count
;j
++,parity
^=1) {
184 GLboolean ef2
, ef1
, ef
;
185 ej2
= ELT(j
-2+parity
);
186 ej1
= ELT(j
-1-parity
);
188 ef2
= EDGEFLAG_GET( ej2
);
189 ef1
= EDGEFLAG_GET( ej1
);
190 ef
= EDGEFLAG_GET( ej
);
191 if (TEST_PRIM_BEGIN(flags
)) {
194 EDGEFLAG_SET( ej2
, GL_TRUE
);
195 EDGEFLAG_SET( ej1
, GL_TRUE
);
196 EDGEFLAG_SET( ej
, GL_TRUE
);
197 RENDER_TRI( ej2
, ej1
, ej
);
198 EDGEFLAG_SET( ej2
, ef2
);
199 EDGEFLAG_SET( ej1
, ef1
);
200 EDGEFLAG_SET( ej
, ef
);
203 for (j
=start
+2; j
<count
; j
++, parity
^=1) {
204 RENDER_TRI( ELT(j
-2+parity
), ELT(j
-1-parity
), ELT(j
) );
211 static void TAG(render_tri_fan
)( struct gl_context
*ctx
,
220 INIT(GL_TRIANGLE_FAN
);
221 if (NEED_EDGEFLAG_SETUP
) {
222 for (j
=start
+2;j
<count
;j
++) {
223 /* For trifans, all edges are boundary.
225 GLuint ejs
= ELT(start
);
226 GLuint ej1
= ELT(j
-1);
228 GLboolean efs
= EDGEFLAG_GET( ejs
);
229 GLboolean ef1
= EDGEFLAG_GET( ej1
);
230 GLboolean ef
= EDGEFLAG_GET( ej
);
231 if (TEST_PRIM_BEGIN(flags
)) {
234 EDGEFLAG_SET( ejs
, GL_TRUE
);
235 EDGEFLAG_SET( ej1
, GL_TRUE
);
236 EDGEFLAG_SET( ej
, GL_TRUE
);
237 RENDER_TRI( ejs
, ej1
, ej
);
238 EDGEFLAG_SET( ejs
, efs
);
239 EDGEFLAG_SET( ej1
, ef1
);
240 EDGEFLAG_SET( ej
, ef
);
243 for (j
=start
+2;j
<count
;j
++) {
244 RENDER_TRI( ELT(start
), ELT(j
-1), ELT(j
) );
252 static void TAG(render_poly
)( struct gl_context
*ctx
,
262 if (NEED_EDGEFLAG_SETUP
) {
263 GLboolean efstart
= EDGEFLAG_GET( ELT(start
) );
264 GLboolean efcount
= EDGEFLAG_GET( ELT(count
-1) );
266 /* If the primitive does not begin here, the first edge
269 if (!TEST_PRIM_BEGIN(flags
))
270 EDGEFLAG_SET( ELT(start
), GL_FALSE
);
275 /* If the primitive does not end here, the final edge is
278 if (!TEST_PRIM_END(flags
))
279 EDGEFLAG_SET( ELT(count
-1), GL_FALSE
);
281 /* Draw the first triangles (possibly zero)
284 GLboolean ef
= EDGEFLAG_GET( ELT(j
) );
285 EDGEFLAG_SET( ELT(j
), GL_FALSE
);
286 RENDER_TRI( ELT(j
-1), ELT(j
), ELT(start
) );
287 EDGEFLAG_SET( ELT(j
), ef
);
290 /* Don't render the first edge again:
292 EDGEFLAG_SET( ELT(start
), GL_FALSE
);
294 for (;j
+1<count
;j
++) {
295 GLboolean efj
= EDGEFLAG_GET( ELT(j
) );
296 EDGEFLAG_SET( ELT(j
), GL_FALSE
);
297 RENDER_TRI( ELT(j
-1), ELT(j
), ELT(start
) );
298 EDGEFLAG_SET( ELT(j
), efj
);
302 /* Draw the last or only triangle
305 RENDER_TRI( ELT(j
-1), ELT(j
), ELT(start
) );
307 /* Restore the first and last edgeflags:
309 EDGEFLAG_SET( ELT(count
-1), efcount
);
310 EDGEFLAG_SET( ELT(start
), efstart
);
314 for (j
=start
+2;j
<count
;j
++) {
315 RENDER_TRI( ELT(j
-1), ELT(j
), ELT(start
) );
321 static void TAG(render_quads
)( struct gl_context
*ctx
,
331 if (NEED_EDGEFLAG_SETUP
) {
332 for (j
=start
+3; j
<count
; j
+=4) {
333 /* Use user-specified edgeflags for quads.
336 RENDER_QUAD( ELT(j
-3), ELT(j
-2), ELT(j
-1), ELT(j
) );
339 for (j
=start
+3; j
<count
; j
+=4) {
340 RENDER_QUAD( ELT(j
-3), ELT(j
-2), ELT(j
-1), ELT(j
) );
346 static void TAG(render_quad_strip
)( struct gl_context
*ctx
,
356 if (NEED_EDGEFLAG_SETUP
) {
357 for (j
=start
+3;j
<count
;j
+=2) {
358 /* All edges are boundary. Set edgeflags to 1, draw the
359 * quad, and restore them to the original values.
361 GLboolean ef3
= EDGEFLAG_GET( ELT(j
-3) );
362 GLboolean ef2
= EDGEFLAG_GET( ELT(j
-2) );
363 GLboolean ef1
= EDGEFLAG_GET( ELT(j
-1) );
364 GLboolean ef
= EDGEFLAG_GET( ELT(j
) );
365 if (TEST_PRIM_BEGIN(flags
)) {
368 EDGEFLAG_SET( ELT(j
-3), GL_TRUE
);
369 EDGEFLAG_SET( ELT(j
-2), GL_TRUE
);
370 EDGEFLAG_SET( ELT(j
-1), GL_TRUE
);
371 EDGEFLAG_SET( ELT(j
), GL_TRUE
);
372 RENDER_QUAD( ELT(j
-1), ELT(j
-3), ELT(j
-2), ELT(j
) );
373 EDGEFLAG_SET( ELT(j
-3), ef3
);
374 EDGEFLAG_SET( ELT(j
-2), ef2
);
375 EDGEFLAG_SET( ELT(j
-1), ef1
);
376 EDGEFLAG_SET( ELT(j
), ef
);
379 for (j
=start
+3;j
<count
;j
+=2) {
380 RENDER_QUAD( ELT(j
-1), ELT(j
-3), ELT(j
-2), ELT(j
) );
386 static void TAG(render_noop
)( struct gl_context
*ctx
,
391 (void)(ctx
&& start
&& count
&& flags
);
394 RENDER_TAB_QUALIFIER
void (*TAG(render_tab
)[GL_POLYGON
+2])(struct gl_context
*,
401 TAG(render_line_loop
),
402 TAG(render_line_strip
),
403 TAG(render_triangles
),
404 TAG(render_tri_strip
),
407 TAG(render_quad_strip
),
414 #ifndef PRESERVE_VB_DEFS
425 #undef RENDER_TAB_QUALIFIER
432 #undef PRESERVE_VB_DEFS