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
233
234
235
236
|
/**************************************************************************
*
* Copyright 2005 VMware, Inc.
* 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 VMWARE 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.
*
**************************************************************************/
#include <stdio.h>
#include "main/context.h"
#include "main/glheader.h"
#include "main/enums.h"
#include "main/imports.h"
#include "main/dispatch.h"
#include "glapi/glapi.h"
#include "vbo_private.h"
typedef void (*attr_func)(struct gl_context *ctx, GLint index, const GLfloat *);
/* This file makes heavy use of the aliasing of NV vertex attributes
* with the legacy attributes, and also with ARB and Material
* attributes as currently implemented.
*/
static void
VertexAttrib1fvNV(struct gl_context *ctx, GLint index, const GLfloat *v)
{
CALL_VertexAttrib1fvNV(ctx->Exec, (index, v));
}
static void
VertexAttrib2fvNV(struct gl_context *ctx, GLint index, const GLfloat *v)
{
CALL_VertexAttrib2fvNV(ctx->Exec, (index, v));
}
static void
VertexAttrib3fvNV(struct gl_context *ctx, GLint index, const GLfloat *v)
{
CALL_VertexAttrib3fvNV(ctx->Exec, (index, v));
}
static void
VertexAttrib4fvNV(struct gl_context *ctx, GLint index, const GLfloat *v)
{
CALL_VertexAttrib4fvNV(ctx->Exec, (index, v));
}
static attr_func vert_attrfunc[4] = {
VertexAttrib1fvNV,
VertexAttrib2fvNV,
VertexAttrib3fvNV,
VertexAttrib4fvNV
};
struct loopback_attr {
enum vbo_attrib index;
GLuint offset;
attr_func func;
};
/**
* Don't emit ends and begins on wrapped primitives. Don't replay
* wrapped vertices. If we get here, it's probably because the
* precalculated wrapping is wrong.
*/
static void
loopback_prim(struct gl_context *ctx,
const GLubyte *buffer,
const struct _mesa_prim *prim,
GLuint wrap_count,
GLuint stride,
const struct loopback_attr *la, GLuint nr)
{
GLuint start = prim->start;
const GLuint end = start + prim->count;
const GLubyte *data;
if (0)
printf("loopback prim %s(%s,%s) verts %d..%d vsize %d\n",
_mesa_lookup_prim_by_nr(prim->mode),
prim->begin ? "begin" : "..",
prim->end ? "end" : "..",
start, end,
stride);
if (prim->begin) {
CALL_Begin(GET_DISPATCH(), (prim->mode));
}
else {
start += wrap_count;
}
data = buffer + start * stride;
for (GLuint j = start; j < end; j++) {
for (GLuint k = 0; k < nr; k++)
la[k].func(ctx, la[k].index, (const GLfloat *)(data + la[k].offset));
data += stride;
}
if (prim->end) {
CALL_End(GET_DISPATCH(), ());
}
}
/**
* Primitives generated by DrawArrays/DrawElements/Rectf may be
* caught here. If there is no primitive in progress, execute them
* normally, otherwise need to track and discard the generated
* primitives.
*/
static void
loopback_weak_prim(struct gl_context *ctx,
const struct _mesa_prim *prim)
{
/* Use the prim_weak flag to ensure that if this primitive
* wraps, we don't mistake future vertex_lists for part of the
* surrounding primitive.
*
* While this flag is set, we are simply disposing of data
* generated by an operation now known to be a noop.
*/
if (prim->begin)
ctx->Driver.CurrentExecPrimitive |= VBO_SAVE_PRIM_WEAK;
if (prim->end)
ctx->Driver.CurrentExecPrimitive &= ~VBO_SAVE_PRIM_WEAK;
}
static inline void
append_attr(GLuint *nr, struct loopback_attr la[], int i, int shift,
const struct gl_vertex_array_object *vao)
{
la[*nr].index = shift + i;
la[*nr].offset = vao->VertexAttrib[i].RelativeOffset;
la[*nr].func = vert_attrfunc[vao->VertexAttrib[i].Size - 1];
(*nr)++;
}
void
_vbo_loopback_vertex_list(struct gl_context *ctx,
const struct vbo_save_vertex_list* node)
{
struct loopback_attr la[VBO_ATTRIB_MAX];
GLuint nr = 0;
/* All Legacy, NV, ARB and Material attributes are routed through
* the NV attributes entrypoints:
*/
const struct gl_vertex_array_object *vao = node->VAO[VP_MODE_FF];
GLbitfield mask = vao->_Enabled & VERT_BIT_MAT_ALL;
while (mask) {
const int i = u_bit_scan(&mask);
append_attr(&nr, la, i, VBO_MATERIAL_SHIFT, vao);
}
vao = node->VAO[VP_MODE_SHADER];
mask = vao->_Enabled & ~(VERT_BIT_POS | VERT_BIT_GENERIC0);
while (mask) {
const int i = u_bit_scan(&mask);
append_attr(&nr, la, i, 0, vao);
}
/* The last in the list should be the vertex provoking attribute */
if (vao->_Enabled & VERT_BIT_GENERIC0) {
append_attr(&nr, la, VERT_ATTRIB_GENERIC0, 0, vao);
} else if (vao->_Enabled & VERT_BIT_POS) {
append_attr(&nr, la, VERT_ATTRIB_POS, 0, vao);
}
const GLuint wrap_count = node->wrap_count;
const GLuint stride = _vbo_save_get_stride(node);
const GLubyte *buffer = NULL;
if (0 < nr) {
/* Compute the minimal offset into the vertex buffer object */
GLuint offset = ~0u;
for (GLuint i = 0; i < nr; ++i)
offset = MIN2(offset, la[i].offset);
for (GLuint i = 0; i < nr; ++i)
la[i].offset -= offset;
/* Get the mapped base pointer, assert sufficient mapping */
struct gl_buffer_object *bufferobj = vao->BufferBinding[0].BufferObj;
assert(bufferobj && bufferobj->Mappings[MAP_INTERNAL].Pointer);
buffer = bufferobj->Mappings[MAP_INTERNAL].Pointer;
assert(bufferobj->Mappings[MAP_INTERNAL].Offset
<= vao->BufferBinding[0].Offset + offset
+ stride*(_vbo_save_get_min_index(node) + wrap_count));
buffer += vao->BufferBinding[0].Offset + offset
- bufferobj->Mappings[MAP_INTERNAL].Offset;
assert(stride*(_vbo_save_get_vertex_count(node) - wrap_count)
<= bufferobj->Mappings[MAP_INTERNAL].Length);
}
/* Replay the primitives */
const struct _mesa_prim *prims = node->prims;
const GLuint prim_count = node->prim_count;
for (GLuint i = 0; i < prim_count; i++) {
if ((0) && _mesa_inside_begin_end(ctx)) {
loopback_weak_prim(ctx, &prims[i]);
} else {
loopback_prim(ctx, buffer, &prims[i], wrap_count, stride, la, nr);
}
}
}
|
