2
* Mesa 3-D graphics library
4
* Copyright 2007-2008 VMware, Inc.
5
* Copyright (C) 2010 LunarG Inc.
7
* Permission is hereby granted, free of charge, to any person obtaining a
8
* copy of this software and associated documentation files (the "Software"),
9
* to deal in the Software without restriction, including without limitation
10
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
11
* and/or sell copies of the Software, and to permit persons to whom the
12
* Software is furnished to do so, subject to the following conditions:
14
* The above copyright notice and this permission notice shall be included
15
* in all copies or substantial portions of the Software.
17
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
18
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
19
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
20
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
21
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
22
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
23
* DEALINGS IN THE SOFTWARE.
26
#define CONCAT2(name, elt_type) name ## elt_type
27
#define CONCAT(name, elt_type) CONCAT2(name, elt_type)
32
* Fetch all elements in [min_index, max_index] with bias, and use the
33
* (rebased) index buffer as the draw elements.
36
CONCAT(vsplit_primitive_, ELT_TYPE)(struct vsplit_frontend *vsplit,
37
unsigned istart, unsigned icount)
39
struct draw_context *draw = vsplit->draw;
40
const ELT_TYPE *ib = (const ELT_TYPE *) draw->pt.user.elts;
41
const unsigned min_index = draw->pt.user.min_index;
42
const unsigned max_index = draw->pt.user.max_index;
43
const int elt_bias = draw->pt.user.eltBias;
44
unsigned fetch_start, fetch_count;
45
const ushort *draw_elts = NULL;
47
const unsigned start = istart;
48
const unsigned end = istart + icount;
50
/* If the index buffer overflows we'll need to run
51
* through the normal paths */
52
if (end >= draw->pt.user.eltMax ||
56
/* use the ib directly */
57
if (min_index == 0 && sizeof(ib[0]) == sizeof(draw_elts[0])) {
58
if (icount > vsplit->max_vertices)
61
for (i = 0; i < icount; i++) {
62
ELT_TYPE idx = DRAW_GET_IDX(ib, start + i);
63
if (idx < min_index || idx > max_index) {
64
debug_printf("warning: index out of range\n");
67
draw_elts = (const ushort *) (ib + istart);
70
/* have to go through vsplit->draw_elts */
71
if (icount > vsplit->segment_size)
75
/* this is faster only when we fetch less elements than the normal path */
76
if (max_index - min_index > icount - 1)
79
if (elt_bias < 0 && (int) min_index < -elt_bias)
83
for (i = 0; i < draw->pt.nr_vertex_elements; i++) {
84
if (draw->pt.vertex_element[i].instance_divisor)
88
fetch_start = min_index + elt_bias;
89
fetch_count = max_index - min_index + 1;
91
/* Check for overflow in the fetch_start */
92
if (fetch_start < min_index || fetch_start < elt_bias)
97
for (i = 0; i < icount; i++) {
98
ELT_TYPE idx = DRAW_GET_IDX(ib, i + start);
100
if (idx < min_index || idx > max_index) {
101
debug_printf("warning: index out of range\n");
103
vsplit->draw_elts[i] = (ushort) idx;
107
for (i = 0; i < icount; i++) {
108
ELT_TYPE idx = DRAW_GET_IDX(ib, i + start);
110
if (idx < min_index || idx > max_index) {
111
debug_printf("warning: index out of range\n");
113
vsplit->draw_elts[i] = (ushort) (idx - min_index);
117
draw_elts = vsplit->draw_elts;
120
return vsplit->middle->run_linear_elts(vsplit->middle,
121
fetch_start, fetch_count,
122
draw_elts, icount, 0x0);
126
* Use the cache to prepare the fetch and draw elements, and flush.
128
* When spoken is TRUE, ispoken replaces istart; When close is TRUE, iclose is
132
CONCAT(vsplit_segment_cache_, ELT_TYPE)(struct vsplit_frontend *vsplit,
134
unsigned istart, unsigned icount,
135
boolean spoken, unsigned ispoken,
136
boolean close, unsigned iclose)
138
struct draw_context *draw = vsplit->draw;
139
const ELT_TYPE *ib = (const ELT_TYPE *) draw->pt.user.elts;
140
const int ibias = draw->pt.user.eltBias;
143
assert(icount + !!close <= vsplit->segment_size);
145
vsplit_clear_cache(vsplit);
150
ADD_CACHE(vsplit, ib, 0, ispoken, 0);
152
for (i = spoken; i < icount; i++) {
153
ADD_CACHE(vsplit, ib, istart, i, 0);
157
ADD_CACHE(vsplit, ib, 0, iclose, 0);
161
ADD_CACHE(vsplit, ib, 0, ispoken, ibias);
163
for (i = spoken; i < icount; i++)
164
ADD_CACHE(vsplit, ib, istart, i, ibias);
167
ADD_CACHE(vsplit, ib, 0, iclose, ibias);
170
vsplit_flush_cache(vsplit, flags);
174
CONCAT(vsplit_segment_simple_, ELT_TYPE)(struct vsplit_frontend *vsplit,
179
CONCAT(vsplit_segment_cache_, ELT_TYPE)(vsplit,
180
flags, istart, icount, FALSE, 0, FALSE, 0);
184
CONCAT(vsplit_segment_loop_, ELT_TYPE)(struct vsplit_frontend *vsplit,
190
const boolean close_loop = ((flags) == DRAW_SPLIT_BEFORE);
192
CONCAT(vsplit_segment_cache_, ELT_TYPE)(vsplit,
193
flags, istart, icount, FALSE, 0, close_loop, i0);
197
CONCAT(vsplit_segment_fan_, ELT_TYPE)(struct vsplit_frontend *vsplit,
203
const boolean use_spoken = (((flags) & DRAW_SPLIT_BEFORE) != 0);
205
CONCAT(vsplit_segment_cache_, ELT_TYPE)(vsplit,
206
flags, istart, icount, use_spoken, i0, FALSE, 0);
210
struct vsplit_frontend *vsplit = (struct vsplit_frontend *) frontend; \
211
const unsigned prim = vsplit->prim; \
212
const unsigned max_count_simple = vsplit->segment_size; \
213
const unsigned max_count_loop = vsplit->segment_size - 1; \
214
const unsigned max_count_fan = vsplit->segment_size;
216
#define PRIMITIVE(istart, icount) \
217
CONCAT(vsplit_primitive_, ELT_TYPE)(vsplit, istart, icount)
222
vsplit_segment_simple_linear(struct vsplit_frontend *vsplit, unsigned flags,
223
unsigned istart, unsigned icount)
225
assert(icount <= vsplit->max_vertices);
226
vsplit->middle->run_linear(vsplit->middle, istart, icount, flags);
230
vsplit_segment_loop_linear(struct vsplit_frontend *vsplit, unsigned flags,
231
unsigned istart, unsigned icount, unsigned i0)
233
boolean close_loop = (flags == DRAW_SPLIT_BEFORE);
236
assert(icount + !!close_loop <= vsplit->segment_size);
238
/* need to draw the sections of the line loop as line strips */
239
flags |= DRAW_LINE_LOOP_AS_STRIP;
242
for (nr = 0; nr < icount; nr++)
243
vsplit->fetch_elts[nr] = istart + nr;
244
vsplit->fetch_elts[nr++] = i0;
246
vsplit->middle->run(vsplit->middle, vsplit->fetch_elts, nr,
247
vsplit->identity_draw_elts, nr, flags);
250
vsplit->middle->run_linear(vsplit->middle, istart, icount, flags);
255
vsplit_segment_fan_linear(struct vsplit_frontend *vsplit, unsigned flags,
256
unsigned istart, unsigned icount, unsigned i0)
258
boolean use_spoken = ((flags & DRAW_SPLIT_BEFORE) != 0);
261
assert(icount <= vsplit->segment_size);
264
/* replace istart by i0 */
265
vsplit->fetch_elts[nr++] = i0;
266
for (i = 1 ; i < icount; i++)
267
vsplit->fetch_elts[nr++] = istart + i;
269
vsplit->middle->run(vsplit->middle, vsplit->fetch_elts, nr,
270
vsplit->identity_draw_elts, nr, flags);
273
vsplit->middle->run_linear(vsplit->middle, istart, icount, flags);
278
struct vsplit_frontend *vsplit = (struct vsplit_frontend *) frontend; \
279
const unsigned prim = vsplit->prim; \
280
const unsigned max_count_simple = vsplit->max_vertices; \
281
const unsigned max_count_loop = vsplit->segment_size - 1; \
282
const unsigned max_count_fan = vsplit->segment_size;
284
#define PRIMITIVE(istart, icount) FALSE
286
#define ELT_TYPE linear
288
#endif /* ELT_TYPE */
291
struct draw_pt_front_end *frontend, \
295
#define SEGMENT_SIMPLE(flags, istart, icount) \
296
CONCAT(vsplit_segment_simple_, ELT_TYPE)(vsplit, flags, istart, icount)
298
#define SEGMENT_LOOP(flags, istart, icount, i0) \
299
CONCAT(vsplit_segment_loop_, ELT_TYPE)(vsplit, flags, istart, icount, i0)
301
#define SEGMENT_FAN(flags, istart, icount, i0) \
302
CONCAT(vsplit_segment_fan_, ELT_TYPE)(vsplit, flags, istart, icount, i0)
304
#include "draw_split_tmp.h"