1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
|
/**************************************************************************
*
* 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.
*
**************************************************************************/
/**
* Private data structures, etc for the draw module.
*/
/**
* Authors:
* Keith Whitwell <keith@tungstengraphics.com>
* Brian Paul
*/
#ifndef DRAW_PRIVATE_H
#define DRAW_PRIVATE_H
#include "pipe/p_state.h"
#include "pipe/p_defines.h"
#include "draw_vertex.h"
/**
* Basic vertex info.
* Carry some useful information around with the vertices in the prim pipe.
*/
struct vertex_header {
unsigned clipmask:12;
unsigned edgeflag:1;
unsigned pad:19;
float clip[4];
float data[][4]; /* Note variable size */
};
#define MAX_VERTEX_SIZE ((2 + FRAG_ATTRIB_MAX) * 4 * sizeof(float))
/**
* Basic info for a point/line/triangle primitive.
*/
struct prim_header {
float det; /**< front/back face determinant */
unsigned reset_line_stipple:1;
unsigned edgeflags:3;
unsigned pad:28;
struct vertex_header *v[3]; /**< 1 to 3 vertex pointers */
};
struct draw_context;
/**
* Base class for all primitive drawing stages.
*/
struct draw_stage
{
struct draw_context *draw; /**< parent context */
struct draw_stage *next; /**< next stage in pipeline */
struct vertex_header **tmp;
unsigned nr_tmps;
void (*begin)( struct draw_stage * );
void (*point)( struct draw_stage *,
struct prim_header * );
void (*line)( struct draw_stage *,
struct prim_header * );
void (*tri)( struct draw_stage *,
struct prim_header * );
void (*end)( struct draw_stage * );
void (*reset_stipple_counter)( struct draw_stage * );
};
#define PRIM_QUEUE_LENGTH 16
#define VCACHE_SIZE 32
#define VCACHE_OVERFLOW 4
#define VS_QUEUE_LENGTH (VCACHE_SIZE + VCACHE_OVERFLOW + 1) /* can never fill up */
/**
* Private context for the drawing module.
*/
struct draw_context
{
/** Drawing/primitive pipeline stages */
struct {
struct draw_stage *first; /**< one of the following */
/* stages (in logical order) */
struct draw_stage *flatshade;
struct draw_stage *clip;
struct draw_stage *cull;
struct draw_stage *twoside;
struct draw_stage *offset;
struct draw_stage *unfilled;
struct draw_stage *setup; /* aka render/rasterize */
} pipeline;
/* pipe state that we need: */
struct pipe_setup_state setup;
struct pipe_viewport_state viewport;
struct pipe_vertex_buffer vertex_buffer[PIPE_ATTRIB_MAX];
struct pipe_vertex_element vertex_element[PIPE_ATTRIB_MAX];
struct pipe_shader_state vertex_shader;
/** The mapped vertex element/index buffer */
const void *mapped_elts;
unsigned eltSize; /**< bytes per index (0, 1, 2 or 4) */
/** The mapped vertex arrays */
const void *mapped_vbuffer[PIPE_ATTRIB_MAX];
/** The mapped constant buffers (for vertex shader) */
const void *mapped_constants;
/* Clip derived state:
*/
float plane[12][4];
unsigned nr_planes;
/** Describes the layout of post-transformation vertices */
struct vertex_info vertex_info;
unsigned nr_vertices;
unsigned prim; /**< current prim type: PIPE_PRIM_x */
unsigned reduced_prim;
struct vertex_header *(*get_vertex)( struct draw_context *draw,
unsigned i );
/* Post-tnl vertex cache:
*/
struct {
unsigned referenced;
unsigned idx[VCACHE_SIZE + VCACHE_OVERFLOW];
struct vertex_header *vertex[VCACHE_SIZE + VCACHE_OVERFLOW];
unsigned overflow;
} vcache;
/* Vertex shader queue:
*/
struct {
struct {
unsigned elt;
struct vertex_header *dest;
} queue[VS_QUEUE_LENGTH];
unsigned queue_nr;
} vs;
/* Prim pipeline queue:
*/
struct {
/* Need to queue up primitives until their vertices have been
* transformed by a vs queue flush.
*/
struct prim_header queue[PRIM_QUEUE_LENGTH];
unsigned queue_nr;
} pq;
};
extern struct draw_stage *draw_unfilled_stage( struct draw_context *context );
extern struct draw_stage *draw_twoside_stage( struct draw_context *context );
extern struct draw_stage *draw_offset_stage( struct draw_context *context );
extern struct draw_stage *draw_clip_stage( struct draw_context *context );
extern struct draw_stage *draw_flatshade_stage( struct draw_context *context );
extern struct draw_stage *draw_cull_stage( struct draw_context *context );
extern void draw_free_tmps( struct draw_stage *stage );
extern void draw_alloc_tmps( struct draw_stage *stage, unsigned nr );
/**
* Get a writeable copy of a vertex.
* \param stage drawing stage info
* \param vert the vertex to copy (source)
* \param idx index into stage's tmp[] array to put the copy (dest)
* \return pointer to the copied vertex
*/
static INLINE struct vertex_header *
dup_vert( struct draw_stage *stage,
const struct vertex_header *vert,
unsigned idx )
{
struct vertex_header *tmp = stage->tmp[idx];
memcpy(tmp, vert, stage->draw->vertex_info.size * sizeof(float) );
return tmp;
}
#endif /* DRAW_PRIVATE_H */
|
