1 /* $Id: t_vb_rendertmp.h,v 1.6 2001/01/14 06:14:21 keithw Exp $ */
4 * Mesa 3-D graphics library
7 * Copyright (C) 1999 Brian Paul All Rights Reserved.
9 * Permission is hereby granted, free of charge, to any person obtaining a
10 * copy of this software and associated documentation files (the "Software"),
11 * to deal in the Software without restriction, including without limitation
12 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
13 * and/or sell copies of the Software, and to permit persons to whom the
14 * Software is furnished to do so, subject to the following conditions:
16 * The above copyright notice and this permission notice shall be included
17 * in all copies or substantial portions of the Software.
19 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
20 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
21 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
22 * BRIAN PAUL BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
23 * AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
24 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
27 * Keith Whitwell <keithw@valinux.com>
39 #ifndef NEED_EDGEFLAG_SETUP
40 #define NEED_EDGEFLAG_SETUP 0
41 #define EDGEFLAG_GET(a) 0
42 #define EDGEFLAG_SET(a,b) (void)b
49 #ifndef RESET_OCCLUSION
50 #define RESET_OCCLUSION
54 #define TEST_PRIM_END(flags) (flags & PRIM_END)
55 #define TEST_PRIM_BEGIN(flags) (flags & PRIM_BEGIN)
56 #define TEST_PRIM_PARITY(flags) (flags & PRIM_PARITY)
63 #ifndef RENDER_TAB_QUALIFIER
64 #define RENDER_TAB_QUALIFIER static
67 static void TAG(render_points
)( GLcontext
*ctx
,
77 RENDER_POINTS( start
, count
);
81 static void TAG(render_lines
)( GLcontext
*ctx
,
92 for (j
=start
+1; j
<count
; j
+=2 ) {
93 RENDER_LINE( ELT(j
-1), ELT(j
) );
100 static void TAG(render_line_strip
)( GLcontext
*ctx
,
112 for (j
=start
+1; j
<count
; j
++ )
113 RENDER_LINE( ELT(j
-1), ELT(j
) );
115 if (TEST_PRIM_END(flags
))
122 static void TAG(render_line_loop
)( GLcontext
*ctx
,
135 if (start
+1 < count
) {
136 if (TEST_PRIM_BEGIN(flags
)) {
137 RENDER_LINE( ELT(start
), ELT(start
+1) );
140 for ( i
= start
+2 ; i
< count
; i
++) {
141 RENDER_LINE( ELT(i
-1), ELT(i
) );
144 if ( TEST_PRIM_END(flags
)) {
145 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.
168 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 EDGEFLAG_SET( ej2
, GL_TRUE
);
203 EDGEFLAG_SET( ej1
, GL_TRUE
);
204 EDGEFLAG_SET( ej
, GL_TRUE
);
205 RENDER_TRI( ej2
, ej1
, ej
);
206 EDGEFLAG_SET( ej2
, ef2
);
207 EDGEFLAG_SET( ej1
, ef1
);
208 EDGEFLAG_SET( ej
, ef
);
212 for (j
=start
+2; j
<count
; j
++, parity
^=1) {
213 RENDER_TRI( ELT(j
-2+parity
), ELT(j
-1-parity
), ELT(j
) );
220 static void TAG(render_tri_fan
)( GLcontext
*ctx
,
229 INIT(GL_TRIANGLE_FAN
);
230 if (NEED_EDGEFLAG_SETUP
) {
231 for (j
=start
+2;j
<count
;j
++) {
232 /* For trifans, all edges are boundary.
234 GLuint ejs
= ELT(start
);
235 GLuint ej1
= ELT(j
-1);
237 GLboolean efs
= EDGEFLAG_GET( ejs
);
238 GLboolean ef1
= EDGEFLAG_GET( ej1
);
239 GLboolean ef
= EDGEFLAG_GET( ej
);
240 EDGEFLAG_SET( ejs
, GL_TRUE
);
241 EDGEFLAG_SET( ej1
, GL_TRUE
);
242 EDGEFLAG_SET( ej
, GL_TRUE
);
243 RENDER_TRI( ejs
, ej1
, ej
);
244 EDGEFLAG_SET( ejs
, efs
);
245 EDGEFLAG_SET( ej1
, ef1
);
246 EDGEFLAG_SET( ej
, ef
);
250 for (j
=start
+2;j
<count
;j
++) {
251 RENDER_TRI( ELT(start
), ELT(j
-1), ELT(j
) );
259 static void TAG(render_poly
)( GLcontext
*ctx
,
269 if (NEED_EDGEFLAG_SETUP
) {
270 GLboolean efstart
= EDGEFLAG_GET( ELT(start
) );
271 GLboolean efcount
= EDGEFLAG_GET( ELT(count
-1) );
273 /* If the primitive does not begin here, the first edge
276 if (!TEST_PRIM_BEGIN(flags
))
277 EDGEFLAG_SET( ELT(start
), GL_FALSE
);
279 /* If the primitive does not end here, the final edge is
282 if (!TEST_PRIM_END(flags
))
283 EDGEFLAG_SET( ELT(count
-1), GL_FALSE
);
285 /* Draw the first triangles (possibly zero)
288 GLboolean ef
= EDGEFLAG_GET( ELT(j
) );
289 EDGEFLAG_SET( ELT(j
), GL_FALSE
);
290 RENDER_TRI( ELT(j
-1), ELT(j
), ELT(start
) );
291 EDGEFLAG_SET( ELT(j
), ef
);
294 /* Don't render the first edge again:
296 EDGEFLAG_SET( ELT(start
), GL_FALSE
);
298 for (;j
<count
-1;j
++) {
299 GLboolean efj
= EDGEFLAG_GET( ELT(j
) );
300 EDGEFLAG_SET( ELT(j
), GL_FALSE
);
301 RENDER_TRI( ELT(j
-1), ELT(j
), ELT(start
) );
302 EDGEFLAG_SET( ELT(j
), efj
);
306 /* Draw the last or only triangle
309 RENDER_TRI( ELT(j
-1), ELT(j
), ELT(start
) );
311 /* Restore the first and last edgeflags:
313 EDGEFLAG_SET( ELT(count
-1), efcount
);
314 EDGEFLAG_SET( ELT(start
), efstart
);
316 if (TEST_PRIM_END(flags
)) {
321 for (j
=start
+2;j
<count
;j
++) {
322 RENDER_TRI( ELT(j
-1), ELT(j
), ELT(start
) );
328 static void TAG(render_quads
)( GLcontext
*ctx
,
338 if (NEED_EDGEFLAG_SETUP
) {
339 for (j
=start
+3; j
<count
; j
+=4) {
340 /* Use user-specified edgeflags for quads.
342 RENDER_QUAD( ELT(j
-3), ELT(j
-2), ELT(j
-1), ELT(j
) );
346 for (j
=start
+3; j
<count
; j
+=4) {
347 RENDER_QUAD( ELT(j
-3), ELT(j
-2), ELT(j
-1), ELT(j
) );
353 static void TAG(render_quad_strip
)( GLcontext
*ctx
,
363 if (NEED_EDGEFLAG_SETUP
) {
364 for (j
=start
+3;j
<count
;j
+=2) {
365 /* All edges are boundary. Set edgeflags to 1, draw the
366 * quad, and restore them to the original values.
368 GLboolean ef3
= EDGEFLAG_GET( ELT(j
-3) );
369 GLboolean ef2
= EDGEFLAG_GET( ELT(j
-2) );
370 GLboolean ef1
= EDGEFLAG_GET( ELT(j
-1) );
371 GLboolean ef
= EDGEFLAG_GET( ELT(j
) );
372 EDGEFLAG_SET( ELT(j
-3), GL_TRUE
);
373 EDGEFLAG_SET( ELT(j
-2), GL_TRUE
);
374 EDGEFLAG_SET( ELT(j
-1), GL_TRUE
);
375 EDGEFLAG_SET( ELT(j
), GL_TRUE
);
376 RENDER_QUAD( ELT(j
-1), ELT(j
-3), ELT(j
-2), ELT(j
) );
377 EDGEFLAG_SET( ELT(j
-3), ef3
);
378 EDGEFLAG_SET( ELT(j
-2), ef2
);
379 EDGEFLAG_SET( ELT(j
-1), ef1
);
380 EDGEFLAG_SET( ELT(j
), ef
);
384 for (j
=start
+3;j
<count
;j
+=2) {
385 RENDER_QUAD( ELT(j
-1), ELT(j
-3), ELT(j
-2), ELT(j
) );
391 static void TAG(render_noop
)( GLcontext
*ctx
,
396 (void)(ctx
&& start
&& count
&& flags
);
399 RENDER_TAB_QUALIFIER
void (*TAG(render_tab
)[GL_POLYGON
+2])(GLcontext
*,
406 TAG(render_line_loop
),
407 TAG(render_line_strip
),
408 TAG(render_triangles
),
409 TAG(render_tri_strip
),
412 TAG(render_quad_strip
),
419 #ifndef PRESERVE_VB_DEFS
430 #undef RENDER_TAB_QUALIFIER
437 #undef PRESERVE_VB_DEFS