/************************************************************************** * * Copyright 2007 Tungsten Graphics, Inc., Cedar Park, Texas. * All Rights Reserved. * * Permission is hereby granted, free of charge, to any person obtaining a * copy of this software and associated documentation files (the * "Software"), to deal in the Software without restriction, including * without limitation the rights to use, copy, modify, merge, publish, * distribute, sub license, and/or sell copies of the Software, and to * permit persons to whom the Software is furnished to do so, subject to * the following conditions: * * The above copyright notice and this permission notice (including the * next paragraph) shall be included in all copies or substantial portions * of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. * IN NO EVENT SHALL TUNGSTEN GRAPHICS AND/OR ITS SUPPLIERS BE LIABLE FOR * ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. * **************************************************************************/ /** * \brief Drawing stage for handling glPolygonMode(line/point). * Convert triangles to points or lines as needed. */ /* Authors: Keith Whitwell */ #include "pipe/p_util.h" #include "pipe/p_defines.h" #include "draw_private.h" struct unfilled_stage { struct draw_stage stage; /** [0] = front face, [1] = back face. * legal values: PIPE_POLYGON_MODE_FILL, PIPE_POLYGON_MODE_LINE, * and PIPE_POLYGON_MODE_POINT, */ unsigned mode[2]; }; static INLINE struct unfilled_stage *unfilled_stage( struct draw_stage *stage ) { return (struct unfilled_stage *)stage; } static void unfilled_begin( struct draw_stage *stage ) { struct unfilled_stage *unfilled = unfilled_stage(stage); unfilled->mode[0] = stage->draw->setup.fill_ccw; /* front */ unfilled->mode[1] = stage->draw->setup.fill_cw; /* back */ stage->next->begin( stage->next ); } static void point( struct draw_stage *stage, struct vertex_header *v0 ) { struct prim_header tmp; tmp.v[0] = v0; stage->next->point( stage->next, &tmp ); } static void line( struct draw_stage *stage, struct vertex_header *v0, struct vertex_header *v1 ) { struct prim_header tmp; tmp.v[0] = v0; tmp.v[1] = v1; stage->next->line( stage->next, &tmp ); } static void points( struct draw_stage *stage, struct prim_header *header ) { struct vertex_header *v0 = header->v[0]; struct vertex_header *v1 = header->v[1]; struct vertex_header *v2 = header->v[2]; if (header->edgeflags & 0x1) point( stage, v0 ); if (header->edgeflags & 0x2) point( stage, v1 ); if (header->edgeflags & 0x4) point( stage, v2 ); } static void lines( struct draw_stage *stage, struct prim_header *header ) { struct vertex_header *v0 = header->v[0]; struct vertex_header *v1 = header->v[1]; struct vertex_header *v2 = header->v[2]; #if 0 assert(((header->edgeflags & 0x1) >> 0) == header->v[0]->edgeflag); assert(((header->edgeflags & 0x2) >> 1) == header->v[1]->edgeflag); assert(((header->edgeflags & 0x4) >> 2) == header->v[2]->edgeflag); #endif if (header->edgeflags & 0x1) line( stage, v0, v1 ); if (header->edgeflags & 0x2) line( stage, v1, v2 ); if (header->edgeflags & 0x4) line( stage, v2, v0 ); } /* Unfilled tri: * * Note edgeflags in the vertex struct is not sufficient as we will * need to manipulate them when decomposing primitives??? */ static void unfilled_tri( struct draw_stage *stage, struct prim_header *header ) { struct unfilled_stage *unfilled = unfilled_stage(stage); unsigned mode = unfilled->mode[header->det < 0.0]; switch (mode) { case PIPE_POLYGON_MODE_FILL: stage->next->tri( stage->next, header ); break; case PIPE_POLYGON_MODE_LINE: lines( stage, header ); break; case PIPE_POLYGON_MODE_POINT: points( stage, header ); break; default: abort(); } } static void unfilled_line( struct draw_stage *stage, struct prim_header *header ) { stage->next->line( stage->next, header ); } static void unfilled_point( struct draw_stage *stage, struct prim_header *header ) { stage->next->point( stage->next, header ); } static void unfilled_end( struct draw_stage *stage ) { stage->next->end( stage->next ); } static void unfilled_reset_stipple_counter( struct draw_stage *stage ) { stage->next->reset_stipple_counter( stage->next ); } /** * Create unfilled triangle stage. */ struct draw_stage *draw_unfilled_stage( struct draw_context *draw ) { struct unfilled_stage *unfilled = CALLOC_STRUCT(unfilled_stage); draw_alloc_tmps( &unfilled->stage, 0 ); unfilled->stage.draw = draw; unfilled->stage.next = NULL; unfilled->stage.tmp = NULL; unfilled->stage.begin = unfilled_begin; unfilled->stage.point = unfilled_point; unfilled->stage.line = unfilled_line; unfilled->stage.tri = unfilled_tri; unfilled->stage.end = unfilled_end; unfilled->stage.reset_stipple_counter = unfilled_reset_stipple_counter; return &unfilled->stage; }