1
/**************************************************************************
3
* Copyright 2007 VMware, Inc.
6
* Permission is hereby granted, free of charge, to any person obtaining a
7
* copy of this software and associated documentation files (the
8
* "Software"), to deal in the Software without restriction, including
9
* without limitation the rights to use, copy, modify, merge, publish,
10
* distribute, sub license, and/or sell copies of the Software, and to
11
* permit persons to whom the Software is furnished to do so, subject to
12
* the following conditions:
14
* The above copyright notice and this permission notice (including the
15
* next paragraph) shall be included in all copies or substantial portions
18
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
19
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
20
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
21
* IN NO EVENT SHALL VMWARE AND/OR ITS SUPPLIERS BE LIABLE FOR
22
* ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
23
* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
24
* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
26
**************************************************************************/
29
* \brief Drawing stage for handling glPolygonMode(line/point).
30
* Convert triangles to points or lines as needed.
33
/* Authors: Keith Whitwell <keithw@vmware.com>
36
#include "util/u_memory.h"
37
#include "pipe/p_defines.h"
38
#include "draw_private.h"
39
#include "draw_pipe.h"
43
struct unfilled_stage {
44
struct draw_stage stage;
46
/** [0] = front face, [1] = back face.
47
* legal values: PIPE_POLYGON_MODE_FILL, PIPE_POLYGON_MODE_LINE,
48
* and PIPE_POLYGON_MODE_POINT,
56
static inline struct unfilled_stage *unfilled_stage( struct draw_stage *stage )
58
return (struct unfilled_stage *)stage;
62
inject_front_face_info(struct draw_stage *stage,
63
struct prim_header *header)
65
struct unfilled_stage *unfilled = unfilled_stage(stage);
66
boolean is_front_face = (
67
(stage->draw->rasterizer->front_ccw && header->det < 0.0f) ||
68
(!stage->draw->rasterizer->front_ccw && header->det > 0.0f));
69
int slot = unfilled->face_slot;
72
/* In case the backend doesn't care about it */
77
for (i = 0; i < 3; ++i) {
78
struct vertex_header *v = header->v[i];
79
v->data[slot][0] = is_front_face;
80
v->data[slot][1] = is_front_face;
81
v->data[slot][2] = is_front_face;
82
v->data[slot][3] = is_front_face;
83
v->vertex_id = UNDEFINED_VERTEX_ID;
88
static void point(struct draw_stage *stage,
89
struct prim_header *header,
90
struct vertex_header *v0)
92
struct prim_header tmp;
93
tmp.det = header->det;
96
stage->next->point(stage->next, &tmp);
99
static void line(struct draw_stage *stage,
100
struct prim_header *header,
101
struct vertex_header *v0,
102
struct vertex_header *v1)
104
struct prim_header tmp;
105
tmp.det = header->det;
109
stage->next->line(stage->next, &tmp);
113
static void points(struct draw_stage *stage,
114
struct prim_header *header)
116
struct vertex_header *v0 = header->v[0];
117
struct vertex_header *v1 = header->v[1];
118
struct vertex_header *v2 = header->v[2];
120
inject_front_face_info(stage, header);
122
if ((header->flags & DRAW_PIPE_EDGE_FLAG_0) && v0->edgeflag)
123
point(stage, header, v0);
124
if ((header->flags & DRAW_PIPE_EDGE_FLAG_1) && v1->edgeflag)
125
point(stage, header, v1);
126
if ((header->flags & DRAW_PIPE_EDGE_FLAG_2) && v2->edgeflag)
127
point(stage, header, v2);
131
static void lines(struct draw_stage *stage,
132
struct prim_header *header)
134
struct vertex_header *v0 = header->v[0];
135
struct vertex_header *v1 = header->v[1];
136
struct vertex_header *v2 = header->v[2];
138
if (header->flags & DRAW_PIPE_RESET_STIPPLE)
140
* XXX could revisit this. The only stage which cares is the line
141
* stipple stage. Could just emit correct reset flags here and not
142
* bother about all the calling through reset_stipple_counter
143
* stages. Though technically it is necessary if line stipple is
144
* handled by the driver, but this is not actually hooked up when
145
* using vbuf (vbuf stage reset_stipple_counter does nothing).
147
stage->next->reset_stipple_counter(stage->next);
149
inject_front_face_info(stage, header);
151
if ((header->flags & DRAW_PIPE_EDGE_FLAG_2) && v2->edgeflag)
152
line(stage, header, v2, v0);
153
if ((header->flags & DRAW_PIPE_EDGE_FLAG_0) && v0->edgeflag)
154
line(stage, header, v0, v1);
155
if ((header->flags & DRAW_PIPE_EDGE_FLAG_1) && v1->edgeflag)
156
line(stage, header, v1, v2);
162
print_header_flags(unsigned flags)
164
debug_printf("header->flags = ");
165
if (flags & DRAW_PIPE_RESET_STIPPLE)
166
debug_printf("RESET_STIPPLE ");
167
if (flags & DRAW_PIPE_EDGE_FLAG_0)
168
debug_printf("EDGE_FLAG_0 ");
169
if (flags & DRAW_PIPE_EDGE_FLAG_1)
170
debug_printf("EDGE_FLAG_1 ");
171
if (flags & DRAW_PIPE_EDGE_FLAG_2)
172
debug_printf("EDGE_FLAG_2 ");
179
* Note edgeflags in the vertex struct is not sufficient as we will
180
* need to manipulate them when decomposing primitives.
182
* We currently keep the vertex edgeflag and primitive edgeflag mask
183
* separate until the last possible moment.
185
static void unfilled_tri( struct draw_stage *stage,
186
struct prim_header *header )
188
struct unfilled_stage *unfilled = unfilled_stage(stage);
189
unsigned cw = header->det >= 0.0;
190
unsigned mode = unfilled->mode[cw];
193
print_header_flags(header->flags);
196
case PIPE_POLYGON_MODE_FILL:
197
stage->next->tri( stage->next, header );
199
case PIPE_POLYGON_MODE_LINE:
200
lines( stage, header );
202
case PIPE_POLYGON_MODE_POINT:
203
points( stage, header );
211
static void unfilled_first_tri( struct draw_stage *stage,
212
struct prim_header *header )
214
struct unfilled_stage *unfilled = unfilled_stage(stage);
215
const struct pipe_rasterizer_state *rast = stage->draw->rasterizer;
217
unfilled->mode[0] = rast->front_ccw ? rast->fill_front : rast->fill_back;
218
unfilled->mode[1] = rast->front_ccw ? rast->fill_back : rast->fill_front;
220
stage->tri = unfilled_tri;
221
stage->tri( stage, header );
226
static void unfilled_flush( struct draw_stage *stage,
229
stage->next->flush( stage->next, flags );
231
stage->tri = unfilled_first_tri;
235
static void unfilled_reset_stipple_counter( struct draw_stage *stage )
237
stage->next->reset_stipple_counter( stage->next );
241
static void unfilled_destroy( struct draw_stage *stage )
243
draw_free_temp_verts( stage );
248
* Try to allocate an output slot which we can use
249
* to preserve the front face information.
252
draw_unfilled_prepare_outputs( struct draw_context *draw,
253
struct draw_stage *stage )
255
struct unfilled_stage *unfilled = unfilled_stage(stage);
256
const struct pipe_rasterizer_state *rast = draw ? draw->rasterizer : NULL;
257
boolean is_unfilled = (rast &&
258
(rast->fill_front != PIPE_POLYGON_MODE_FILL ||
259
rast->fill_back != PIPE_POLYGON_MODE_FILL));
260
const struct draw_fragment_shader *fs = draw ? draw->fs.fragment_shader : NULL;
262
if (is_unfilled && fs && fs->info.uses_frontface) {
263
unfilled->face_slot = draw_alloc_extra_vertex_attrib(
264
stage->draw, TGSI_SEMANTIC_FACE, 0);
266
unfilled->face_slot = -1;
272
* Create unfilled triangle stage.
274
struct draw_stage *draw_unfilled_stage( struct draw_context *draw )
276
struct unfilled_stage *unfilled = CALLOC_STRUCT(unfilled_stage);
280
unfilled->stage.draw = draw;
281
unfilled->stage.name = "unfilled";
282
unfilled->stage.next = NULL;
283
unfilled->stage.tmp = NULL;
284
unfilled->stage.point = draw_pipe_passthrough_point;
285
unfilled->stage.line = draw_pipe_passthrough_line;
286
unfilled->stage.tri = unfilled_first_tri;
287
unfilled->stage.flush = unfilled_flush;
288
unfilled->stage.reset_stipple_counter = unfilled_reset_stipple_counter;
289
unfilled->stage.destroy = unfilled_destroy;
291
unfilled->face_slot = -1;
293
if (!draw_alloc_temp_verts( &unfilled->stage, 0 ))
296
return &unfilled->stage;
300
unfilled->stage.destroy( &unfilled->stage );