*/
-#include "mtypes.h"
-#include "macros.h"
-#include "enums.h"
+#include "main/mtypes.h"
+#include "main/macros.h"
+#include "main/enums.h"
#include "vbo_split.h"
const struct split_limits *limits;
-/* GLuint out_maxindex; */
-/* GLuint out_minindex; */
-
struct _mesa_prim dstprim[MAX_PRIM];
GLuint dstprim_nr;
};
GLuint available = align(split->limits->max_verts - csr - 1, 2);
assert(split->limits->max_verts >= csr);
- _mesa_printf("%s: prim %d: %s %d..%d\n", __FUNCTION__,
- i,
- _mesa_lookup_enum_by_nr(prim->mode),
- prim->start, prim->count);
-
- _mesa_printf("a: available %d\n", available);
-
if (prim->count < first)
continue;
available = align(split->limits->max_verts - csr - 1, 2);
}
- _mesa_printf("b: available %d\n", available);
-
if (available >= count) {
struct _mesa_prim *outprim = next_outprim(split);
*outprim = *prim;
csr += prim->count;
available = align(split->limits->max_verts - csr - 1, 2);
}
- else if (0 && split_inplace) {
+ else if (split_inplace) {
GLuint j, nr;
else {
/* Wrapped the primitive:
*/
- _mesa_printf("wrap %d %d\n", nr, first-incr);
-
j += nr - (first - incr);
flush_vertex(split);
csr = 0;
ib.type = GL_UNSIGNED_INT;
ib.obj = split->ctx->Array.NullBufferObj;
ib.ptr = elts;
- ib.rebase = 0; /* ? */
tmpprim = *prim;
tmpprim.indexed = 1;