3 * Mesa 3-D graphics library
6 * Copyright (C) 1999-2006 Brian Paul All Rights Reserved.
8 * Permission is hereby granted, free of charge, to any person obtaining a
9 * copy of this software and associated documentation files (the "Software"),
10 * to deal in the Software without restriction, including without limitation
11 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
12 * and/or sell copies of the Software, and to permit persons to whom the
13 * Software is furnished to do so, subject to the following conditions:
15 * The above copyright notice and this permission notice shall be included
16 * in all copies or substantial portions of the Software.
18 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
19 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
20 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
21 * BRIAN PAUL BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
22 * AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
23 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
26 * Keith Whitwell <keith@tungstengraphics.com>
29 /* Split indexed primitives with per-vertex copying.
38 #include "vbo_split.h"
42 #define ELT_TABLE_SIZE 16
44 /* Used for vertex-level splitting of indexed buffers. Note that
45 * non-indexed primitives may be converted to indexed in some cases
46 * (eg loops, fans) in order to use this splitting path.
51 const struct gl_client_array
**array
;
52 const struct _mesa_prim
*prim
;
54 const struct _mesa_index_buffer
*ib
;
57 const struct split_limits
*limits
;
62 const struct gl_client_array
*array
;
63 const GLubyte
*src_ptr
;
65 struct gl_client_array dstarray
;
67 } varying
[VERT_ATTRIB_MAX
];
70 const struct gl_client_array
*dstarray_ptr
[VERT_ATTRIB_MAX
];
71 struct _mesa_index_buffer dstib
;
73 GLuint
*translated_elt_buf
;
76 /* A baby hash table to avoid re-emitting (some) duplicate
77 * vertices when splitting indexed primitives.
82 } vert_cache
[ELT_TABLE_SIZE
];
87 GLubyte
*dstptr
; /* dstptr == dstbuf + dstelt_max * vertsize */
88 GLuint dstbuf_size
; /* in vertices */
89 GLuint dstbuf_nr
; /* count of emitted vertices, also the
90 * largest value in dstelt. Our
99 struct _mesa_prim dstprim
[MAX_PRIM
];
105 static GLuint
type_size( GLenum type
)
108 case GL_BYTE
: return sizeof(GLbyte
);
109 case GL_UNSIGNED_BYTE
: return sizeof(GLubyte
);
110 case GL_SHORT
: return sizeof(GLshort
);
111 case GL_UNSIGNED_SHORT
: return sizeof(GLushort
);
112 case GL_INT
: return sizeof(GLint
);
113 case GL_UNSIGNED_INT
: return sizeof(GLuint
);
114 case GL_FLOAT
: return sizeof(GLfloat
);
115 case GL_DOUBLE
: return sizeof(GLdouble
);
120 static GLuint
attr_size( const struct gl_client_array
*array
)
122 return array
->Size
* type_size(array
->Type
);
126 /* Starts returning true slightly before the buffer fills, to ensure
127 * that there is sufficient room for any remaining vertices to finish
130 static GLboolean
check_flush( struct copy_context
*copy
)
132 if (copy
->dstbuf_nr
+ 4 > copy
->dstbuf_size
)
135 if (copy
->dstelt_nr
+ 4 > copy
->dstelt_size
)
141 static void flush( struct copy_context
*copy
)
145 /* Set some counters:
147 copy
->dstib
.count
= copy
->dstelt_nr
;
149 copy
->draw( copy
->ctx
,
157 /* Reset all pointers:
159 copy
->dstprim_nr
= 0;
162 copy
->dstptr
= copy
->dstbuf
;
164 /* Clear the vertex cache:
166 for (i
= 0; i
< ELT_TABLE_SIZE
; i
++)
167 copy
->vert_cache
[i
].in
= ~0;
172 static void begin( struct copy_context
*copy
, GLenum mode
, GLboolean begin_flag
)
174 struct _mesa_prim
*prim
= ©
->dstprim
[copy
->dstprim_nr
];
176 /* _mesa_printf("begin %s (%d)\n", _mesa_lookup_enum_by_nr(mode), begin_flag); */
179 prim
->begin
= begin_flag
;
183 /* Use a hashtable to attempt to identify recently-emitted vertices
184 * and avoid re-emitting them.
186 static GLuint
elt(struct copy_context
*copy
, GLuint elt_idx
)
188 GLuint elt
= copy
->srcelt
[elt_idx
];
189 GLuint slot
= elt
& (ELT_TABLE_SIZE
-1);
191 /* _mesa_printf("elt %d\n", elt); */
193 /* Look up the incoming element in the vertex cache. Re-emit if
196 if (copy
->vert_cache
[slot
].in
!= elt
) {
197 GLubyte
*csr
= copy
->dstptr
;
200 /* _mesa_printf(" --> emit to dstelt %d\n", copy->dstbuf_nr); */
202 for (i
= 0; i
< copy
->nr_varying
; i
++) {
203 const struct gl_client_array
*srcarray
= copy
->varying
[i
].array
;
204 const GLubyte
*srcptr
= copy
->varying
[i
].src_ptr
+ elt
* srcarray
->StrideB
;
206 memcpy(csr
, srcptr
, copy
->varying
[i
].size
);
207 csr
+= copy
->varying
[i
].size
;
211 const GLuint
*f
= (const GLuint
*)srcptr
;
213 _mesa_printf(" varying %d: ", i
);
214 for(j
= 0; j
< copy
->varying
[i
].size
/ 4; j
++)
215 _mesa_printf("%x ", f
[j
]);
221 copy
->vert_cache
[slot
].in
= elt
;
222 copy
->vert_cache
[slot
].out
= copy
->dstbuf_nr
++;
223 copy
->dstptr
+= copy
->vertex_size
;
225 assert(csr
== copy
->dstptr
);
226 assert(copy
->dstptr
== (copy
->dstbuf
+
231 /* _mesa_printf(" --> reuse vertex\n"); */
233 /* _mesa_printf(" --> emit %d\n", copy->vert_cache[slot].out); */
234 copy
->dstelt
[copy
->dstelt_nr
++] = copy
->vert_cache
[slot
].out
;
235 return check_flush(copy
);
238 static void end( struct copy_context
*copy
, GLboolean end_flag
)
240 struct _mesa_prim
*prim
= ©
->dstprim
[copy
->dstprim_nr
];
242 /* _mesa_printf("end (%d)\n", end_flag); */
244 prim
->end
= end_flag
;
245 prim
->count
= copy
->dstelt_nr
- prim
->start
;
247 if (++copy
->dstprim_nr
== MAX_PRIM
||
254 static void replay_elts( struct copy_context
*copy
)
259 for (i
= 0; i
< copy
->nr_prims
; i
++) {
260 const struct _mesa_prim
*prim
= ©
->prim
[i
];
261 const GLuint start
= prim
->start
;
264 switch (prim
->mode
) {
267 /* Convert to linestrip and emit the final vertex explicitly,
268 * but only in the resultant strip that requires it.
271 while (j
!= prim
->count
) {
272 begin(copy
, GL_LINE_STRIP
, prim
->begin
&& j
== 0);
274 for (split
= GL_FALSE
; j
!= prim
->count
&& !split
; j
++)
275 split
= elt(copy
, start
+ j
);
277 if (j
== prim
->count
) {
278 /* Done, emit final line. Split doesn't matter as
279 * it is always raised a bit early so we can emit
280 * the last verts if necessary!
283 (void)elt(copy
, start
+ 0);
285 end(copy
, prim
->end
);
297 case GL_TRIANGLE_FAN
:
300 while (j
!= prim
->count
) {
301 begin(copy
, prim
->mode
, prim
->begin
&& j
== 0);
303 split
= elt(copy
, start
+0);
306 split
= elt(copy
, start
+j
-1);
309 for (; j
!= prim
->count
&& !split
; j
++)
310 split
= elt(copy
, start
+j
);
312 end(copy
, prim
->end
&& j
== prim
->count
);
314 if (j
!= prim
->count
) {
315 /* Wrapped the primitive, need to repeat some vertices:
323 (void)split_prim_inplace(prim
->mode
, &first
, &incr
);
326 while (j
!= prim
->count
) {
328 begin(copy
, prim
->mode
, prim
->begin
&& j
== 0);
331 for (k
= 0; k
< first
; k
++, j
++)
332 split
|= elt(copy
, start
+j
);
336 for (; j
!= prim
->count
&& !split
; )
337 for (k
= 0; k
< incr
; k
++, j
++)
338 split
|= elt(copy
, start
+j
);
340 end(copy
, prim
->end
&& j
== prim
->count
);
342 if (j
!= prim
->count
) {
343 /* Wrapped the primitive, need to repeat some vertices:
345 assert(j
> first
- incr
);
353 if (copy
->dstprim_nr
)
358 static void replay_init( struct copy_context
*copy
)
360 GLcontext
*ctx
= copy
->ctx
;
364 /* Make a list of varying attributes and their vbo's. Also
365 * calculate vertex size.
367 copy
->vertex_size
= 0;
368 for (i
= 0; i
< VERT_ATTRIB_MAX
; i
++) {
369 struct gl_buffer_object
*vbo
= copy
->array
[i
]->BufferObj
;
371 if (copy
->array
[i
]->StrideB
== 0) {
372 copy
->dstarray_ptr
[i
] = copy
->array
[i
];
375 GLuint j
= copy
->nr_varying
++;
377 copy
->varying
[j
].attr
= i
;
378 copy
->varying
[j
].array
= copy
->array
[i
];
379 copy
->varying
[j
].size
= attr_size(copy
->array
[i
]);
380 copy
->vertex_size
+= attr_size(copy
->array
[i
]);
382 if (vbo
->Name
&& !vbo
->Pointer
)
383 ctx
->Driver
.MapBuffer(ctx
,
385 GL_WRITE_ONLY
, /* XXX */
388 copy
->varying
[j
].src_ptr
= ADD_POINTERS(vbo
->Pointer
,
389 copy
->array
[i
]->Ptr
);
391 copy
->dstarray_ptr
[i
] = ©
->varying
[j
].dstarray
;
395 /* There must always be an index buffer. Currently require the
396 * caller convert non-indexed prims to indexed. Could alternately
399 if (copy
->ib
->obj
->Name
&& !copy
->ib
->obj
->Pointer
)
400 ctx
->Driver
.MapBuffer(ctx
,
401 GL_ARRAY_BUFFER_ARB
, /* XXX */
402 GL_WRITE_ONLY
, /* XXX */
405 switch (copy
->ib
->type
) {
406 case GL_UNSIGNED_BYTE
:
407 copy
->translated_elt_buf
= _mesa_malloc(sizeof(GLuint
) * copy
->ib
->count
);
408 copy
->srcelt
= copy
->translated_elt_buf
;
410 for (i
= 0; i
< copy
->ib
->count
; i
++)
411 copy
->translated_elt_buf
[i
] = ((const GLubyte
*)copy
->ib
->ptr
)[i
];
414 case GL_UNSIGNED_SHORT
:
415 copy
->translated_elt_buf
= _mesa_malloc(sizeof(GLuint
) * copy
->ib
->count
);
416 copy
->srcelt
= copy
->translated_elt_buf
;
418 for (i
= 0; i
< copy
->ib
->count
; i
++)
419 copy
->translated_elt_buf
[i
] = ((const GLushort
*)copy
->ib
->ptr
)[i
];
422 case GL_UNSIGNED_INT
:
423 copy
->translated_elt_buf
= NULL
;
424 copy
->srcelt
= (const GLuint
*)ADD_POINTERS(copy
->ib
->obj
->Pointer
,
430 /* Figure out the maximum allowed vertex buffer size:
432 if (copy
->vertex_size
* copy
->limits
->max_verts
<= copy
->limits
->max_vb_size
) {
433 copy
->dstbuf_size
= copy
->limits
->max_verts
;
436 copy
->dstbuf_size
= copy
->limits
->max_vb_size
/ copy
->vertex_size
;
439 /* Allocate an output vertex buffer:
441 * XXX: This should be a VBO!
443 copy
->dstbuf
= _mesa_malloc(copy
->dstbuf_size
*
445 copy
->dstptr
= copy
->dstbuf
;
447 /* Setup new vertex arrays to point into the output buffer:
449 for (offset
= 0, i
= 0; i
< copy
->nr_varying
; i
++) {
450 const struct gl_client_array
*src
= copy
->varying
[i
].array
;
451 struct gl_client_array
*dst
= ©
->varying
[i
].dstarray
;
453 dst
->Size
= src
->Size
;
454 dst
->Type
= src
->Type
;
455 dst
->Stride
= copy
->vertex_size
;
456 dst
->StrideB
= copy
->vertex_size
;
457 dst
->Ptr
= copy
->dstbuf
+ offset
;
458 dst
->Enabled
= GL_TRUE
;
459 dst
->Normalized
= GL_TRUE
;
460 dst
->BufferObj
= ctx
->Array
.NullBufferObj
;
461 dst
->_MaxElement
= copy
->dstbuf_size
; /* may be less! */
463 offset
+= copy
->varying
[i
].size
;
466 /* Allocate an output element list:
468 copy
->dstelt_size
= MIN2(65536,
469 copy
->ib
->count
* 2 + 3);
470 copy
->dstelt_size
= MIN2(copy
->dstelt_size
,
471 copy
->limits
->max_indices
);
472 copy
->dstelt
= _mesa_malloc(sizeof(GLuint
) * copy
->dstelt_size
);
475 /* Setup the new index buffer to point to the allocated element
478 copy
->dstib
.count
= 0; /* duplicates dstelt_nr */
479 copy
->dstib
.type
= GL_UNSIGNED_INT
;
480 copy
->dstib
.obj
= ctx
->Array
.NullBufferObj
;
481 copy
->dstib
.ptr
= copy
->dstelt
;
485 static void replay_finish( struct copy_context
*copy
)
487 GLcontext
*ctx
= copy
->ctx
;
490 /* Free our vertex and index buffers:
492 _mesa_free(copy
->translated_elt_buf
);
493 _mesa_free(copy
->dstbuf
);
494 _mesa_free(copy
->dstelt
);
498 for (i
= 0; i
< copy
->nr_varying
; i
++) {
499 struct gl_buffer_object
*vbo
= copy
->varying
[i
].array
->BufferObj
;
501 if (vbo
->Name
&& vbo
->Pointer
)
502 ctx
->Driver
.UnmapBuffer(ctx
, GL_ARRAY_BUFFER_ARB
, vbo
);
505 /* Unmap index buffer:
507 if (copy
->ib
->obj
->Name
&& copy
->ib
->obj
->Pointer
) {
508 ctx
->Driver
.UnmapBuffer(ctx
,
509 GL_ARRAY_BUFFER_ARB
, /* XXX */
514 void vbo_split_copy( GLcontext
*ctx
,
515 const struct gl_client_array
*arrays
[],
516 const struct _mesa_prim
*prim
,
518 const struct _mesa_index_buffer
*ib
,
520 const struct split_limits
*limits
)
522 struct copy_context copy
;
525 memset(©
, 0, sizeof(copy
));
527 /* Require indexed primitives:
534 copy
.nr_prims
= nr_prims
;
537 copy
.limits
= limits
;
540 /* Clear the vertex cache:
542 for (i
= 0; i
< ELT_TABLE_SIZE
; i
++)
543 copy
.vert_cache
[i
].in
= ~0;
548 replay_finish(©
);