7bc0e37facc8abf94678c89259cf828a259e9388
3 * Mesa 3-D graphics library
6 * Copyright (C) 1999-2001 Brian Paul All Rights Reserved.
8 * Permission is hereby granted, free of charge, to any person obtaining a
9 * copy of this software and associated documentation files (the "Software"),
10 * to deal in the Software without restriction, including without limitation
11 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
12 * and/or sell copies of the Software, and to permit persons to whom the
13 * Software is furnished to do so, subject to the following conditions:
15 * The above copyright notice and this permission notice shall be included
16 * in all copies or substantial portions of the Software.
18 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
19 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
20 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
21 * BRIAN PAUL BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
22 * AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
23 * CONNECTION WITH THE SOFTWARE OR THE USE OR 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
48 #ifndef RESET_OCCLUSION
49 #define RESET_OCCLUSION
53 #define TEST_PRIM_END(flags) (flags & PRIM_END)
54 #define TEST_PRIM_BEGIN(flags) (flags & PRIM_BEGIN)
55 #define TEST_PRIM_PARITY(flags) (flags & PRIM_PARITY)
62 #ifndef RENDER_TAB_QUALIFIER
63 #define RENDER_TAB_QUALIFIER static
66 static void TAG(render_points
)( GLcontext
*ctx
,
76 RENDER_POINTS( start
, count
);
80 static void TAG(render_lines
)( GLcontext
*ctx
,
91 for (j
=start
+1; j
<count
; j
+=2 ) {
93 RENDER_LINE( ELT(j
-1), ELT(j
) );
99 static void TAG(render_line_strip
)( GLcontext
*ctx
,
111 if (TEST_PRIM_BEGIN(flags
)) {
115 for (j
=start
+1; j
<count
; j
++ )
116 RENDER_LINE( ELT(j
-1), ELT(j
) );
122 static void TAG(render_line_loop
)( GLcontext
*ctx
,
135 if (start
+1 < count
) {
136 if (TEST_PRIM_BEGIN(flags
)) {
138 RENDER_LINE( ELT(start
), ELT(start
+1) );
141 for ( i
= start
+2 ; i
< count
; i
++) {
142 RENDER_LINE( ELT(i
-1), ELT(i
) );
145 if ( TEST_PRIM_END(flags
)) {
146 RENDER_LINE( ELT(count
-1), ELT(start
) );
154 static void TAG(render_triangles
)( GLcontext
*ctx
,
164 if (NEED_EDGEFLAG_SETUP
) {
165 for (j
=start
+2; j
<count
; j
+=3) {
166 /* Leave the edgeflags as supplied by the user.
169 RENDER_TRI( ELT(j
-2), ELT(j
-1), ELT(j
) );
172 for (j
=start
+2; j
<count
; j
+=3) {
173 RENDER_TRI( ELT(j
-2), ELT(j
-1), ELT(j
) );
181 static void TAG(render_tri_strip
)( GLcontext
*ctx
,
190 if (TEST_PRIM_PARITY(flags
))
193 INIT(GL_TRIANGLE_STRIP
);
194 if (NEED_EDGEFLAG_SETUP
) {
195 for (j
=start
+2;j
<count
;j
++,parity
^=1) {
196 GLuint ej2
= ELT(j
-2+parity
);
197 GLuint ej1
= ELT(j
-1-parity
);
199 GLboolean ef2
= EDGEFLAG_GET( ej2
);
200 GLboolean ef1
= EDGEFLAG_GET( ej1
);
201 GLboolean ef
= EDGEFLAG_GET( ej
);
202 if (TEST_PRIM_BEGIN(flags
)) {
205 EDGEFLAG_SET( ej2
, GL_TRUE
);
206 EDGEFLAG_SET( ej1
, GL_TRUE
);
207 EDGEFLAG_SET( ej
, GL_TRUE
);
208 RENDER_TRI( ej2
, ej1
, ej
);
209 EDGEFLAG_SET( ej2
, ef2
);
210 EDGEFLAG_SET( ej1
, ef1
);
211 EDGEFLAG_SET( ej
, ef
);
214 for (j
=start
+2; j
<count
; j
++, parity
^=1) {
215 RENDER_TRI( ELT(j
-2+parity
), ELT(j
-1-parity
), ELT(j
) );
222 static void TAG(render_tri_fan
)( GLcontext
*ctx
,
231 INIT(GL_TRIANGLE_FAN
);
232 if (NEED_EDGEFLAG_SETUP
) {
233 for (j
=start
+2;j
<count
;j
++) {
234 /* For trifans, all edges are boundary.
236 GLuint ejs
= ELT(start
);
237 GLuint ej1
= ELT(j
-1);
239 GLboolean efs
= EDGEFLAG_GET( ejs
);
240 GLboolean ef1
= EDGEFLAG_GET( ej1
);
241 GLboolean ef
= EDGEFLAG_GET( ej
);
242 if (TEST_PRIM_BEGIN(flags
)) {
245 EDGEFLAG_SET( ejs
, GL_TRUE
);
246 EDGEFLAG_SET( ej1
, GL_TRUE
);
247 EDGEFLAG_SET( ej
, GL_TRUE
);
248 RENDER_TRI( ejs
, ej1
, ej
);
249 EDGEFLAG_SET( ejs
, efs
);
250 EDGEFLAG_SET( ej1
, ef1
);
251 EDGEFLAG_SET( ej
, ef
);
254 for (j
=start
+2;j
<count
;j
++) {
255 RENDER_TRI( ELT(start
), ELT(j
-1), ELT(j
) );
263 static void TAG(render_poly
)( GLcontext
*ctx
,
273 if (NEED_EDGEFLAG_SETUP
) {
274 GLboolean efstart
= EDGEFLAG_GET( ELT(start
) );
275 GLboolean efcount
= EDGEFLAG_GET( ELT(count
-1) );
277 /* If the primitive does not begin here, the first edge
280 if (!TEST_PRIM_BEGIN(flags
))
281 EDGEFLAG_SET( ELT(start
), GL_FALSE
);
286 /* If the primitive does not end here, the final edge is
289 if (!TEST_PRIM_END(flags
))
290 EDGEFLAG_SET( ELT(count
-1), GL_FALSE
);
292 /* Draw the first triangles (possibly zero)
295 GLboolean ef
= 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
), ef
);
301 /* Don't render the first edge again:
303 EDGEFLAG_SET( ELT(start
), GL_FALSE
);
305 for (;j
+1<count
;j
++) {
306 GLboolean efj
= EDGEFLAG_GET( ELT(j
) );
307 EDGEFLAG_SET( ELT(j
), GL_FALSE
);
308 RENDER_TRI( ELT(j
-1), ELT(j
), ELT(start
) );
309 EDGEFLAG_SET( ELT(j
), efj
);
313 /* Draw the last or only triangle
316 RENDER_TRI( ELT(j
-1), ELT(j
), ELT(start
) );
318 /* Restore the first and last edgeflags:
320 EDGEFLAG_SET( ELT(count
-1), efcount
);
321 EDGEFLAG_SET( ELT(start
), efstart
);
325 for (j
=start
+2;j
<count
;j
++) {
326 RENDER_TRI( ELT(j
-1), ELT(j
), ELT(start
) );
332 static void TAG(render_quads
)( GLcontext
*ctx
,
342 if (NEED_EDGEFLAG_SETUP
) {
343 for (j
=start
+3; j
<count
; j
+=4) {
344 /* Use user-specified edgeflags for quads.
347 RENDER_QUAD( ELT(j
-3), ELT(j
-2), ELT(j
-1), ELT(j
) );
350 for (j
=start
+3; j
<count
; j
+=4) {
351 RENDER_QUAD( ELT(j
-3), ELT(j
-2), ELT(j
-1), ELT(j
) );
357 static void TAG(render_quad_strip
)( GLcontext
*ctx
,
367 if (NEED_EDGEFLAG_SETUP
) {
368 for (j
=start
+3;j
<count
;j
+=2) {
369 /* All edges are boundary. Set edgeflags to 1, draw the
370 * quad, and restore them to the original values.
372 GLboolean ef3
= EDGEFLAG_GET( ELT(j
-3) );
373 GLboolean ef2
= EDGEFLAG_GET( ELT(j
-2) );
374 GLboolean ef1
= EDGEFLAG_GET( ELT(j
-1) );
375 GLboolean ef
= EDGEFLAG_GET( ELT(j
) );
376 if (TEST_PRIM_BEGIN(flags
)) {
379 EDGEFLAG_SET( ELT(j
-3), GL_TRUE
);
380 EDGEFLAG_SET( ELT(j
-2), GL_TRUE
);
381 EDGEFLAG_SET( ELT(j
-1), GL_TRUE
);
382 EDGEFLAG_SET( ELT(j
), GL_TRUE
);
383 RENDER_QUAD( ELT(j
-1), ELT(j
-3), ELT(j
-2), ELT(j
) );
384 EDGEFLAG_SET( ELT(j
-3), ef3
);
385 EDGEFLAG_SET( ELT(j
-2), ef2
);
386 EDGEFLAG_SET( ELT(j
-1), ef1
);
387 EDGEFLAG_SET( ELT(j
), ef
);
390 for (j
=start
+3;j
<count
;j
+=2) {
391 RENDER_QUAD( ELT(j
-1), ELT(j
-3), ELT(j
-2), ELT(j
) );
397 static void TAG(render_noop
)( GLcontext
*ctx
,
402 (void)(ctx
&& start
&& count
&& flags
);
405 RENDER_TAB_QUALIFIER
void (*TAG(render_tab
)[GL_POLYGON
+2])(GLcontext
*,
412 TAG(render_line_loop
),
413 TAG(render_line_strip
),
414 TAG(render_triangles
),
415 TAG(render_tri_strip
),
418 TAG(render_quad_strip
),
425 #ifndef PRESERVE_VB_DEFS
436 #undef RENDER_TAB_QUALIFIER
443 #undef PRESERVE_VB_DEFS