[MESA]
[reactos.git] / reactos / dll / opengl / mesa / vbo / vbo_split_copy.c
1
2 /*
3 * Mesa 3-D graphics library
4 * Version: 6.5
5 *
6 * Copyright (C) 1999-2006 Brian Paul All Rights Reserved.
7 *
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:
14 *
15 * The above copyright notice and this permission notice shall be included
16 * in all copies or substantial portions of the Software.
17 *
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.
24 *
25 * Authors:
26 * Keith Whitwell <keith@tungstengraphics.com>
27 */
28
29 /* Split indexed primitives with per-vertex copying.
30 */
31
32 #include "main/glheader.h"
33 #include "main/bufferobj.h"
34 #include "main/imports.h"
35 #include "main/image.h"
36 #include "main/macros.h"
37 #include "main/mtypes.h"
38
39 #include "vbo_attrib.h"
40 #include "vbo_split.h"
41 #include "vbo.h"
42
43
44 #define ELT_TABLE_SIZE 16
45
46 /**
47 * Used for vertex-level splitting of indexed buffers. Note that
48 * non-indexed primitives may be converted to indexed in some cases
49 * (eg loops, fans) in order to use this splitting path.
50 */
51 struct copy_context {
52
53 struct gl_context *ctx;
54 const struct gl_client_array **array;
55 const struct _mesa_prim *prim;
56 GLuint nr_prims;
57 const struct _mesa_index_buffer *ib;
58 vbo_draw_func draw;
59
60 const struct split_limits *limits;
61
62 struct {
63 GLuint attr;
64 GLuint size;
65 const struct gl_client_array *array;
66 const GLubyte *src_ptr;
67
68 struct gl_client_array dstarray;
69
70 } varying[VBO_ATTRIB_MAX];
71 GLuint nr_varying;
72
73 const struct gl_client_array *dstarray_ptr[VBO_ATTRIB_MAX];
74 struct _mesa_index_buffer dstib;
75
76 GLuint *translated_elt_buf;
77 const GLuint *srcelt;
78
79 /** A baby hash table to avoid re-emitting (some) duplicate
80 * vertices when splitting indexed primitives.
81 */
82 struct {
83 GLuint in;
84 GLuint out;
85 } vert_cache[ELT_TABLE_SIZE];
86
87 GLuint vertex_size;
88 GLubyte *dstbuf;
89 GLubyte *dstptr; /**< dstptr == dstbuf + dstelt_max * vertsize */
90 GLuint dstbuf_size; /**< in vertices */
91 GLuint dstbuf_nr; /**< count of emitted vertices, also the largest value
92 * in dstelt. Our MaxIndex.
93 */
94
95 GLuint *dstelt;
96 GLuint dstelt_nr;
97 GLuint dstelt_size;
98
99 #define MAX_PRIM 32
100 struct _mesa_prim dstprim[MAX_PRIM];
101 GLuint dstprim_nr;
102
103 };
104
105
106 static GLuint attr_size( const struct gl_client_array *array )
107 {
108 return array->Size * _mesa_sizeof_type(array->Type);
109 }
110
111
112 /**
113 * Starts returning true slightly before the buffer fills, to ensure
114 * that there is sufficient room for any remaining vertices to finish
115 * off the prim:
116 */
117 static GLboolean
118 check_flush( struct copy_context *copy )
119 {
120 GLenum mode = copy->dstprim[copy->dstprim_nr].mode;
121
122 if (GL_TRIANGLE_STRIP == mode &&
123 copy->dstelt_nr & 1) { /* see bug9962 */
124 return GL_FALSE;
125 }
126
127 if (copy->dstbuf_nr + 4 > copy->dstbuf_size)
128 return GL_TRUE;
129
130 if (copy->dstelt_nr + 4 > copy->dstelt_size)
131 return GL_TRUE;
132
133 return GL_FALSE;
134 }
135
136
137 /**
138 * Dump the parameters/info for a vbo->draw() call.
139 */
140 static void
141 dump_draw_info(struct gl_context *ctx,
142 const struct gl_client_array **arrays,
143 const struct _mesa_prim *prims,
144 GLuint nr_prims,
145 const struct _mesa_index_buffer *ib,
146 GLuint min_index,
147 GLuint max_index)
148 {
149 GLuint i, j;
150
151 printf("VBO Draw:\n");
152 for (i = 0; i < nr_prims; i++) {
153 printf("Prim %u of %u\n", i, nr_prims);
154 printf(" Prim mode 0x%x\n", prims[i].mode);
155 printf(" IB: %p\n", (void*) ib);
156 for (j = 0; j < VBO_ATTRIB_MAX; j++) {
157 printf(" array %d at %p:\n", j, (void*) arrays[j]);
158 printf(" enabled %d, ptr %p, size %d, type 0x%x, stride %d\n",
159 arrays[j]->Enabled, arrays[j]->Ptr,
160 arrays[j]->Size, arrays[j]->Type, arrays[j]->StrideB);
161 if (0) {
162 GLint k = prims[i].start + prims[i].count - 1;
163 GLfloat *last = (GLfloat *) (arrays[j]->Ptr + arrays[j]->Stride * k);
164 printf(" last: %f %f %f\n",
165 last[0], last[1], last[2]);
166 }
167 }
168 }
169 }
170
171
172 static void
173 flush( struct copy_context *copy )
174 {
175 GLuint i;
176
177 /* Set some counters:
178 */
179 copy->dstib.count = copy->dstelt_nr;
180
181 #if 0
182 dump_draw_info(copy->ctx,
183 copy->dstarray_ptr,
184 copy->dstprim,
185 copy->dstprim_nr,
186 &copy->dstib,
187 0,
188 copy->dstbuf_nr);
189 #else
190 (void) dump_draw_info;
191 #endif
192
193 copy->draw( copy->ctx,
194 copy->dstarray_ptr,
195 copy->dstprim,
196 copy->dstprim_nr,
197 &copy->dstib,
198 GL_TRUE,
199 0,
200 copy->dstbuf_nr - 1);
201
202 /* Reset all pointers:
203 */
204 copy->dstprim_nr = 0;
205 copy->dstelt_nr = 0;
206 copy->dstbuf_nr = 0;
207 copy->dstptr = copy->dstbuf;
208
209 /* Clear the vertex cache:
210 */
211 for (i = 0; i < ELT_TABLE_SIZE; i++)
212 copy->vert_cache[i].in = ~0;
213 }
214
215
216 /**
217 * Called at begin of each primitive during replay.
218 */
219 static void
220 begin( struct copy_context *copy, GLenum mode, GLboolean begin_flag )
221 {
222 struct _mesa_prim *prim = &copy->dstprim[copy->dstprim_nr];
223
224 prim->mode = mode;
225 prim->begin = begin_flag;
226 prim->num_instances = 1;
227 }
228
229
230 /**
231 * Use a hashtable to attempt to identify recently-emitted vertices
232 * and avoid re-emitting them.
233 */
234 static GLuint
235 elt(struct copy_context *copy, GLuint elt_idx)
236 {
237 GLuint elt = copy->srcelt[elt_idx];
238 GLuint slot = elt & (ELT_TABLE_SIZE-1);
239
240 /* printf("elt %d\n", elt); */
241
242 /* Look up the incoming element in the vertex cache. Re-emit if
243 * necessary.
244 */
245 if (copy->vert_cache[slot].in != elt) {
246 GLubyte *csr = copy->dstptr;
247 GLuint i;
248
249 /* printf(" --> emit to dstelt %d\n", copy->dstbuf_nr); */
250
251 for (i = 0; i < copy->nr_varying; i++) {
252 const struct gl_client_array *srcarray = copy->varying[i].array;
253 const GLubyte *srcptr = copy->varying[i].src_ptr + elt * srcarray->StrideB;
254
255 memcpy(csr, srcptr, copy->varying[i].size);
256 csr += copy->varying[i].size;
257
258 #ifdef NAN_CHECK
259 if (srcarray->Type == GL_FLOAT) {
260 GLuint k;
261 GLfloat *f = (GLfloat *) srcptr;
262 for (k = 0; k < srcarray->Size; k++) {
263 assert(!IS_INF_OR_NAN(f[k]));
264 assert(f[k] <= 1.0e20 && f[k] >= -1.0e20);
265 }
266 }
267 #endif
268
269 if (0)
270 {
271 const GLuint *f = (const GLuint *)srcptr;
272 GLuint j;
273 printf(" varying %d: ", i);
274 for(j = 0; j < copy->varying[i].size / 4; j++)
275 printf("%x ", f[j]);
276 printf("\n");
277 }
278 }
279
280 copy->vert_cache[slot].in = elt;
281 copy->vert_cache[slot].out = copy->dstbuf_nr++;
282 copy->dstptr += copy->vertex_size;
283
284 assert(csr == copy->dstptr);
285 assert(copy->dstptr == (copy->dstbuf +
286 copy->dstbuf_nr * copy->vertex_size));
287 }
288 /* else */
289 /* printf(" --> reuse vertex\n"); */
290
291 /* printf(" --> emit %d\n", copy->vert_cache[slot].out); */
292 copy->dstelt[copy->dstelt_nr++] = copy->vert_cache[slot].out;
293 return check_flush(copy);
294 }
295
296
297 /**
298 * Called at end of each primitive during replay.
299 */
300 static void
301 end( struct copy_context *copy, GLboolean end_flag )
302 {
303 struct _mesa_prim *prim = &copy->dstprim[copy->dstprim_nr];
304
305 /* printf("end (%d)\n", end_flag); */
306
307 prim->end = end_flag;
308 prim->count = copy->dstelt_nr - prim->start;
309
310 if (++copy->dstprim_nr == MAX_PRIM ||
311 check_flush(copy))
312 flush(copy);
313 }
314
315
316 static void
317 replay_elts( struct copy_context *copy )
318 {
319 GLuint i, j, k;
320 GLboolean split;
321
322 for (i = 0; i < copy->nr_prims; i++) {
323 const struct _mesa_prim *prim = &copy->prim[i];
324 const GLuint start = prim->start;
325 GLuint first, incr;
326
327 switch (prim->mode) {
328
329 case GL_LINE_LOOP:
330 /* Convert to linestrip and emit the final vertex explicitly,
331 * but only in the resultant strip that requires it.
332 */
333 j = 0;
334 while (j != prim->count) {
335 begin(copy, GL_LINE_STRIP, prim->begin && j == 0);
336
337 for (split = GL_FALSE; j != prim->count && !split; j++)
338 split = elt(copy, start + j);
339
340 if (j == prim->count) {
341 /* Done, emit final line. Split doesn't matter as
342 * it is always raised a bit early so we can emit
343 * the last verts if necessary!
344 */
345 if (prim->end)
346 (void)elt(copy, start + 0);
347
348 end(copy, prim->end);
349 }
350 else {
351 /* Wrap
352 */
353 assert(split);
354 end(copy, 0);
355 j--;
356 }
357 }
358 break;
359
360 case GL_TRIANGLE_FAN:
361 case GL_POLYGON:
362 j = 2;
363 while (j != prim->count) {
364 begin(copy, prim->mode, prim->begin && j == 0);
365
366 split = elt(copy, start+0);
367 assert(!split);
368
369 split = elt(copy, start+j-1);
370 assert(!split);
371
372 for (; j != prim->count && !split; j++)
373 split = elt(copy, start+j);
374
375 end(copy, prim->end && j == prim->count);
376
377 if (j != prim->count) {
378 /* Wrapped the primitive, need to repeat some vertices:
379 */
380 j -= 1;
381 }
382 }
383 break;
384
385 default:
386 (void)split_prim_inplace(prim->mode, &first, &incr);
387
388 j = 0;
389 while (j != prim->count) {
390
391 begin(copy, prim->mode, prim->begin && j == 0);
392
393 split = 0;
394 for (k = 0; k < first; k++, j++)
395 split |= elt(copy, start+j);
396
397 assert(!split);
398
399 for (; j != prim->count && !split; )
400 for (k = 0; k < incr; k++, j++)
401 split |= elt(copy, start+j);
402
403 end(copy, prim->end && j == prim->count);
404
405 if (j != prim->count) {
406 /* Wrapped the primitive, need to repeat some vertices:
407 */
408 assert(j > first - incr);
409 j -= (first - incr);
410 }
411 }
412 break;
413 }
414 }
415
416 if (copy->dstprim_nr)
417 flush(copy);
418 }
419
420
421 static void
422 replay_init( struct copy_context *copy )
423 {
424 struct gl_context *ctx = copy->ctx;
425 GLuint i;
426 GLuint offset;
427 const GLvoid *srcptr;
428
429 /* Make a list of varying attributes and their vbo's. Also
430 * calculate vertex size.
431 */
432 copy->vertex_size = 0;
433 for (i = 0; i < VBO_ATTRIB_MAX; i++) {
434 struct gl_buffer_object *vbo = copy->array[i]->BufferObj;
435
436 if (copy->array[i]->StrideB == 0) {
437 copy->dstarray_ptr[i] = copy->array[i];
438 }
439 else {
440 GLuint j = copy->nr_varying++;
441
442 copy->varying[j].attr = i;
443 copy->varying[j].array = copy->array[i];
444 copy->varying[j].size = attr_size(copy->array[i]);
445 copy->vertex_size += attr_size(copy->array[i]);
446
447 if (_mesa_is_bufferobj(vbo) && !_mesa_bufferobj_mapped(vbo))
448 ctx->Driver.MapBufferRange(ctx, 0, vbo->Size, GL_MAP_READ_BIT, vbo);
449
450 copy->varying[j].src_ptr = ADD_POINTERS(vbo->Pointer,
451 copy->array[i]->Ptr);
452
453 copy->dstarray_ptr[i] = &copy->varying[j].dstarray;
454 }
455 }
456
457 /* There must always be an index buffer. Currently require the
458 * caller convert non-indexed prims to indexed. Could alternately
459 * do it internally.
460 */
461 if (_mesa_is_bufferobj(copy->ib->obj) &&
462 !_mesa_bufferobj_mapped(copy->ib->obj))
463 ctx->Driver.MapBufferRange(ctx, 0, copy->ib->obj->Size, GL_MAP_READ_BIT,
464 copy->ib->obj);
465
466 srcptr = (const GLubyte *) ADD_POINTERS(copy->ib->obj->Pointer,
467 copy->ib->ptr);
468
469 switch (copy->ib->type) {
470 case GL_UNSIGNED_BYTE:
471 copy->translated_elt_buf = malloc(sizeof(GLuint) * copy->ib->count);
472 copy->srcelt = copy->translated_elt_buf;
473
474 for (i = 0; i < copy->ib->count; i++)
475 copy->translated_elt_buf[i] = ((const GLubyte *)srcptr)[i];
476 break;
477
478 case GL_UNSIGNED_SHORT:
479 copy->translated_elt_buf = malloc(sizeof(GLuint) * copy->ib->count);
480 copy->srcelt = copy->translated_elt_buf;
481
482 for (i = 0; i < copy->ib->count; i++)
483 copy->translated_elt_buf[i] = ((const GLushort *)srcptr)[i];
484 break;
485
486 case GL_UNSIGNED_INT:
487 copy->translated_elt_buf = NULL;
488 copy->srcelt = (const GLuint *)srcptr;
489 break;
490 }
491
492 /* Figure out the maximum allowed vertex buffer size:
493 */
494 if (copy->vertex_size * copy->limits->max_verts <= copy->limits->max_vb_size) {
495 copy->dstbuf_size = copy->limits->max_verts;
496 }
497 else {
498 copy->dstbuf_size = copy->limits->max_vb_size / copy->vertex_size;
499 }
500
501 /* Allocate an output vertex buffer:
502 *
503 * XXX: This should be a VBO!
504 */
505 copy->dstbuf = malloc(copy->dstbuf_size * copy->vertex_size);
506 copy->dstptr = copy->dstbuf;
507
508 /* Setup new vertex arrays to point into the output buffer:
509 */
510 for (offset = 0, i = 0; i < copy->nr_varying; i++) {
511 const struct gl_client_array *src = copy->varying[i].array;
512 struct gl_client_array *dst = &copy->varying[i].dstarray;
513
514 dst->Size = src->Size;
515 dst->Type = src->Type;
516 dst->Stride = copy->vertex_size;
517 dst->StrideB = copy->vertex_size;
518 dst->Ptr = copy->dstbuf + offset;
519 dst->Enabled = GL_TRUE;
520 dst->Normalized = src->Normalized;
521 dst->Integer = src->Integer;
522 dst->BufferObj = ctx->Shared->NullBufferObj;
523 dst->_ElementSize = src->_ElementSize;
524 dst->_MaxElement = copy->dstbuf_size; /* may be less! */
525
526 offset += copy->varying[i].size;
527 }
528
529 /* Allocate an output element list:
530 */
531 copy->dstelt_size = MIN2(65536,
532 copy->ib->count * 2 + 3);
533 copy->dstelt_size = MIN2(copy->dstelt_size,
534 copy->limits->max_indices);
535 copy->dstelt = malloc(sizeof(GLuint) * copy->dstelt_size);
536 copy->dstelt_nr = 0;
537
538 /* Setup the new index buffer to point to the allocated element
539 * list:
540 */
541 copy->dstib.count = 0; /* duplicates dstelt_nr */
542 copy->dstib.type = GL_UNSIGNED_INT;
543 copy->dstib.obj = ctx->Shared->NullBufferObj;
544 copy->dstib.ptr = copy->dstelt;
545 }
546
547
548 /**
549 * Free up everything allocated during split/replay.
550 */
551 static void
552 replay_finish( struct copy_context *copy )
553 {
554 struct gl_context *ctx = copy->ctx;
555 GLuint i;
556
557 /* Free our vertex and index buffers:
558 */
559 free(copy->translated_elt_buf);
560 free(copy->dstbuf);
561 free(copy->dstelt);
562
563 /* Unmap VBO's
564 */
565 for (i = 0; i < copy->nr_varying; i++) {
566 struct gl_buffer_object *vbo = copy->varying[i].array->BufferObj;
567 if (_mesa_is_bufferobj(vbo) && _mesa_bufferobj_mapped(vbo))
568 ctx->Driver.UnmapBuffer(ctx, vbo);
569 }
570
571 /* Unmap index buffer:
572 */
573 if (_mesa_is_bufferobj(copy->ib->obj) &&
574 _mesa_bufferobj_mapped(copy->ib->obj)) {
575 ctx->Driver.UnmapBuffer(ctx, copy->ib->obj);
576 }
577 }
578
579
580 /**
581 * Split VBO into smaller pieces, draw the pieces.
582 */
583 void vbo_split_copy( struct gl_context *ctx,
584 const struct gl_client_array *arrays[],
585 const struct _mesa_prim *prim,
586 GLuint nr_prims,
587 const struct _mesa_index_buffer *ib,
588 vbo_draw_func draw,
589 const struct split_limits *limits )
590 {
591 struct copy_context copy;
592 GLuint i;
593
594 memset(&copy, 0, sizeof(copy));
595
596 /* Require indexed primitives:
597 */
598 assert(ib);
599
600 copy.ctx = ctx;
601 copy.array = arrays;
602 copy.prim = prim;
603 copy.nr_prims = nr_prims;
604 copy.ib = ib;
605 copy.draw = draw;
606 copy.limits = limits;
607
608 /* Clear the vertex cache:
609 */
610 for (i = 0; i < ELT_TABLE_SIZE; i++)
611 copy.vert_cache[i].in = ~0;
612
613 replay_init(&copy);
614 replay_elts(&copy);
615 replay_finish(&copy);
616 }