draw: free vertex info from geometry streams.
[mesa.git] / src / gallium / auxiliary / draw / draw_gs.c
1 /**************************************************************************
2 *
3 * Copyright 2009 VMware, Inc.
4 * All Rights Reserved.
5 *
6 * Permission is hereby granted, free of charge, to any person obtaining a
7 * copy of this software and associated documentation files (the
8 * "Software"), to deal in the Software without restriction, including
9 * without limitation the rights to use, copy, modify, merge, publish,
10 * distribute, sub license, and/or sell copies of the Software, and to
11 * permit persons to whom the Software is furnished to do so, subject to
12 * the following conditions:
13 *
14 * The above copyright notice and this permission notice (including the
15 * next paragraph) shall be included in all copies or substantial portions
16 * 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
20 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
21 * IN NO EVENT SHALL VMWARE AND/OR ITS SUPPLIERS BE LIABLE FOR
22 * ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
23 * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
24 * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
25 *
26 **************************************************************************/
27
28 #include "draw_gs.h"
29
30 #include "draw_private.h"
31 #include "draw_context.h"
32 #ifdef LLVM_AVAILABLE
33 #include "draw_llvm.h"
34 #endif
35
36 #include "tgsi/tgsi_parse.h"
37 #include "tgsi/tgsi_exec.h"
38 #include "nir/nir_to_tgsi_info.h"
39 #include "pipe/p_shader_tokens.h"
40
41 #include "util/u_math.h"
42 #include "util/u_memory.h"
43 #include "util/u_prim.h"
44 #include "util/ralloc.h"
45 /* fixme: move it from here */
46 #define MAX_PRIMITIVES 64
47
48 static inline int
49 draw_gs_get_input_index(int semantic, int index,
50 const struct tgsi_shader_info *input_info)
51 {
52 int i;
53 const ubyte *input_semantic_names = input_info->output_semantic_name;
54 const ubyte *input_semantic_indices = input_info->output_semantic_index;
55 for (i = 0; i < PIPE_MAX_SHADER_OUTPUTS; i++) {
56 if (input_semantic_names[i] == semantic &&
57 input_semantic_indices[i] == index)
58 return i;
59 }
60 return -1;
61 }
62
63 /**
64 * We execute geometry shaders in the SOA mode, so ideally we want to
65 * flush when the number of currently fetched primitives is equal to
66 * the number of elements in the SOA vector. This ensures that the
67 * throughput is optimized for the given vector instruction set.
68 */
69 static inline boolean
70 draw_gs_should_flush(struct draw_geometry_shader *shader)
71 {
72 return (shader->fetched_prim_count == shader->vector_length || shader->num_invocations > 1);
73 }
74
75 /*#define DEBUG_OUTPUTS 1*/
76 static void
77 tgsi_fetch_gs_outputs(struct draw_geometry_shader *shader,
78 unsigned stream,
79 unsigned num_primitives,
80 float (**p_output)[4])
81 {
82 struct tgsi_exec_machine *machine = shader->machine;
83 unsigned prim_idx, j, slot;
84 float (*output)[4];
85
86 output = *p_output;
87
88 /* Unswizzle all output results.
89 */
90
91 for (prim_idx = 0; prim_idx < num_primitives; ++prim_idx) {
92 unsigned num_verts_per_prim = machine->Primitives[stream][prim_idx];
93 unsigned prim_offset = machine->PrimitiveOffsets[stream][prim_idx];
94 shader->stream[stream].primitive_lengths[prim_idx + shader->stream[stream].emitted_primitives] =
95 machine->Primitives[stream][prim_idx];
96 shader->stream[stream].emitted_vertices += num_verts_per_prim;
97
98 for (j = 0; j < num_verts_per_prim; j++) {
99 int idx = prim_offset + j * shader->info.num_outputs;
100 #ifdef DEBUG_OUTPUTS
101 debug_printf("%d/%d) Output vert:\n", stream, idx / shader->info.num_outputs);
102 #endif
103 for (slot = 0; slot < shader->info.num_outputs; slot++) {
104 output[slot][0] = machine->Outputs[idx + slot].xyzw[0].f[0];
105 output[slot][1] = machine->Outputs[idx + slot].xyzw[1].f[0];
106 output[slot][2] = machine->Outputs[idx + slot].xyzw[2].f[0];
107 output[slot][3] = machine->Outputs[idx + slot].xyzw[3].f[0];
108 #ifdef DEBUG_OUTPUTS
109 debug_printf("\t%d: %f %f %f %f\n", slot,
110 output[slot][0],
111 output[slot][1],
112 output[slot][2],
113 output[slot][3]);
114 #endif
115 }
116 output = (float (*)[4])((char *)output + shader->vertex_size);
117 }
118 }
119 *p_output = output;
120 shader->stream[stream].emitted_primitives += num_primitives;
121 }
122
123 /*#define DEBUG_INPUTS 1*/
124 static void tgsi_fetch_gs_input(struct draw_geometry_shader *shader,
125 unsigned *indices,
126 unsigned num_vertices,
127 unsigned prim_idx)
128 {
129 struct tgsi_exec_machine *machine = shader->machine;
130 unsigned slot, i;
131 int vs_slot;
132 unsigned input_vertex_stride = shader->input_vertex_stride;
133 const float (*input_ptr)[4];
134
135 input_ptr = shader->input;
136
137 for (i = 0; i < num_vertices; ++i) {
138 const float (*input)[4];
139 #if DEBUG_INPUTS
140 debug_printf("%d) vertex index = %d (prim idx = %d)\n",
141 i, indices[i], prim_idx);
142 #endif
143 input = (const float (*)[4])(
144 (const char *)input_ptr + (indices[i] * input_vertex_stride));
145 for (slot = 0, vs_slot = 0; slot < shader->info.num_inputs; ++slot) {
146 unsigned idx = i * TGSI_EXEC_MAX_INPUT_ATTRIBS + slot;
147 if (shader->info.input_semantic_name[slot] == TGSI_SEMANTIC_PRIMID) {
148 machine->Inputs[idx].xyzw[0].u[prim_idx] = shader->in_prim_idx;
149 machine->Inputs[idx].xyzw[1].u[prim_idx] = shader->in_prim_idx;
150 machine->Inputs[idx].xyzw[2].u[prim_idx] = shader->in_prim_idx;
151 machine->Inputs[idx].xyzw[3].u[prim_idx] = shader->in_prim_idx;
152 } else {
153 vs_slot = draw_gs_get_input_index(
154 shader->info.input_semantic_name[slot],
155 shader->info.input_semantic_index[slot],
156 shader->input_info);
157 if (vs_slot < 0) {
158 debug_printf("VS/GS signature mismatch!\n");
159 machine->Inputs[idx].xyzw[0].f[prim_idx] = 0;
160 machine->Inputs[idx].xyzw[1].f[prim_idx] = 0;
161 machine->Inputs[idx].xyzw[2].f[prim_idx] = 0;
162 machine->Inputs[idx].xyzw[3].f[prim_idx] = 0;
163 } else {
164 #if DEBUG_INPUTS
165 debug_printf("\tSlot = %d, vs_slot = %d, idx = %d:\n",
166 slot, vs_slot, idx);
167 assert(!util_is_inf_or_nan(input[vs_slot][0]));
168 assert(!util_is_inf_or_nan(input[vs_slot][1]));
169 assert(!util_is_inf_or_nan(input[vs_slot][2]));
170 assert(!util_is_inf_or_nan(input[vs_slot][3]));
171 #endif
172 machine->Inputs[idx].xyzw[0].f[prim_idx] = input[vs_slot][0];
173 machine->Inputs[idx].xyzw[1].f[prim_idx] = input[vs_slot][1];
174 machine->Inputs[idx].xyzw[2].f[prim_idx] = input[vs_slot][2];
175 machine->Inputs[idx].xyzw[3].f[prim_idx] = input[vs_slot][3];
176 #if DEBUG_INPUTS
177 debug_printf("\t\t%f %f %f %f\n",
178 machine->Inputs[idx].xyzw[0].f[prim_idx],
179 machine->Inputs[idx].xyzw[1].f[prim_idx],
180 machine->Inputs[idx].xyzw[2].f[prim_idx],
181 machine->Inputs[idx].xyzw[3].f[prim_idx]);
182 #endif
183 ++vs_slot;
184 }
185 }
186 }
187 }
188 }
189
190 static void tgsi_gs_prepare(struct draw_geometry_shader *shader,
191 const void *constants[PIPE_MAX_CONSTANT_BUFFERS],
192 const unsigned constants_size[PIPE_MAX_CONSTANT_BUFFERS])
193 {
194 struct tgsi_exec_machine *machine = shader->machine;
195 tgsi_exec_set_constant_buffers(machine, PIPE_MAX_CONSTANT_BUFFERS,
196 constants, constants_size);
197 }
198
199 static void tgsi_gs_run(struct draw_geometry_shader *shader,
200 unsigned input_primitives,
201 unsigned *out_prims)
202 {
203 struct tgsi_exec_machine *machine = shader->machine;
204 int i;
205
206 if (shader->info.uses_invocationid) {
207 unsigned i = machine->SysSemanticToIndex[TGSI_SEMANTIC_INVOCATIONID];
208 for (int j = 0; j < TGSI_QUAD_SIZE; j++)
209 machine->SystemValue[i].xyzw[0].i[j] = shader->invocation_id;
210 }
211
212 /* run interpreter */
213 tgsi_exec_machine_run(machine, 0);
214
215 for (i = 0; i < 4; i++) {
216 int prim_i;
217 int prim_c;
218 switch (i) {
219 case 0:
220 prim_i = TGSI_EXEC_TEMP_PRIMITIVE_I;
221 prim_c = TGSI_EXEC_TEMP_PRIMITIVE_C;
222 break;
223 case 1:
224 prim_i = TGSI_EXEC_TEMP_PRIMITIVE_S1_I;
225 prim_c = TGSI_EXEC_TEMP_PRIMITIVE_S1_C;
226 break;
227 case 2:
228 prim_i = TGSI_EXEC_TEMP_PRIMITIVE_S2_I;
229 prim_c = TGSI_EXEC_TEMP_PRIMITIVE_S2_C;
230 break;
231 case 3:
232 prim_i = TGSI_EXEC_TEMP_PRIMITIVE_S3_I;
233 prim_c = TGSI_EXEC_TEMP_PRIMITIVE_S3_C;
234 break;
235 };
236
237 out_prims[i] = machine->Temps[prim_i].xyzw[prim_c].u[0];
238 }
239 }
240
241 #ifdef LLVM_AVAILABLE
242
243 static void
244 llvm_fetch_gs_input(struct draw_geometry_shader *shader,
245 unsigned *indices,
246 unsigned num_vertices,
247 unsigned prim_idx)
248 {
249 unsigned slot, i;
250 int vs_slot;
251 unsigned input_vertex_stride = shader->input_vertex_stride;
252 const float (*input_ptr)[4];
253 float (*input_data)[6][PIPE_MAX_SHADER_INPUTS][TGSI_NUM_CHANNELS][TGSI_NUM_CHANNELS] = &shader->gs_input->data;
254
255 shader->llvm_prim_ids[shader->fetched_prim_count] = shader->in_prim_idx;
256
257 input_ptr = shader->input;
258
259 for (i = 0; i < num_vertices; ++i) {
260 const float (*input)[4];
261 #if DEBUG_INPUTS
262 debug_printf("%d) vertex index = %d (prim idx = %d)\n",
263 i, indices[i], prim_idx);
264 #endif
265 input = (const float (*)[4])(
266 (const char *)input_ptr + (indices[i] * input_vertex_stride));
267 for (slot = 0, vs_slot = 0; slot < shader->info.num_inputs; ++slot) {
268 if (shader->info.input_semantic_name[slot] == TGSI_SEMANTIC_PRIMID) {
269 /* skip. we handle system values through gallivm */
270 /* NOTE: If we hit this case here it's an ordinary input not a sv,
271 * even though it probably should be a sv.
272 * Not sure how to set it up as regular input however if that even,
273 * would make sense so hack around this later in gallivm.
274 */
275 } else {
276 vs_slot = draw_gs_get_input_index(
277 shader->info.input_semantic_name[slot],
278 shader->info.input_semantic_index[slot],
279 shader->input_info);
280 if (vs_slot < 0) {
281 debug_printf("VS/GS signature mismatch!\n");
282 (*input_data)[i][slot][0][prim_idx] = 0;
283 (*input_data)[i][slot][1][prim_idx] = 0;
284 (*input_data)[i][slot][2][prim_idx] = 0;
285 (*input_data)[i][slot][3][prim_idx] = 0;
286 } else {
287 #if DEBUG_INPUTS
288 debug_printf("\tSlot = %d, vs_slot = %d, i = %d:\n",
289 slot, vs_slot, i);
290 assert(!util_is_inf_or_nan(input[vs_slot][0]));
291 assert(!util_is_inf_or_nan(input[vs_slot][1]));
292 assert(!util_is_inf_or_nan(input[vs_slot][2]));
293 assert(!util_is_inf_or_nan(input[vs_slot][3]));
294 #endif
295 (*input_data)[i][slot][0][prim_idx] = input[vs_slot][0];
296 (*input_data)[i][slot][1][prim_idx] = input[vs_slot][1];
297 (*input_data)[i][slot][2][prim_idx] = input[vs_slot][2];
298 (*input_data)[i][slot][3][prim_idx] = input[vs_slot][3];
299 #if DEBUG_INPUTS
300 debug_printf("\t\t%f %f %f %f\n",
301 (*input_data)[i][slot][0][prim_idx],
302 (*input_data)[i][slot][1][prim_idx],
303 (*input_data)[i][slot][2][prim_idx],
304 (*input_data)[i][slot][3][prim_idx]);
305 #endif
306 ++vs_slot;
307 }
308 }
309 }
310 }
311 }
312
313 static void
314 llvm_fetch_gs_outputs(struct draw_geometry_shader *shader,
315 unsigned stream,
316 unsigned num_primitives,
317 float (**p_output)[4])
318 {
319 int total_verts = 0;
320 int vertex_count = 0;
321 int total_prims = 0;
322 int max_prims_per_invocation = 0;
323 char *output_ptr = (char*)shader->gs_output[stream];
324 int i, j, prim_idx;
325 unsigned next_prim_boundary = shader->primitive_boundary;
326
327 for (i = 0; i < shader->vector_length; ++i) {
328 int prims = shader->llvm_emitted_primitives[i + (stream * shader->vector_length)];
329 total_prims += prims;
330 max_prims_per_invocation = MAX2(max_prims_per_invocation, prims);
331 }
332 for (i = 0; i < shader->vector_length; ++i) {
333 total_verts += shader->llvm_emitted_vertices[i + (stream * shader->vector_length)];
334 }
335
336 output_ptr += shader->stream[stream].emitted_vertices * shader->vertex_size;
337 for (i = 0; i < shader->vector_length - 1; ++i) {
338 int current_verts = shader->llvm_emitted_vertices[i + (stream * shader->vector_length)];
339 int next_verts = shader->llvm_emitted_vertices[i + 1 + (stream * shader->vector_length)];
340 #if 0
341 int j;
342 for (j = 0; j < current_verts; ++j) {
343 struct vertex_header *vh = (struct vertex_header *)
344 (output_ptr + shader->vertex_size * (i * next_prim_boundary + j));
345 debug_printf("--- %d) [%f, %f, %f, %f]\n", j + vertex_count,
346 vh->data[0][0], vh->data[0][1], vh->data[0][2], vh->data[0][3]);
347
348 }
349 #endif
350 debug_assert(current_verts <= shader->max_output_vertices);
351 debug_assert(next_verts <= shader->max_output_vertices);
352 if (next_verts) {
353 memmove(output_ptr + (vertex_count + current_verts) * shader->vertex_size,
354 output_ptr + ((i + 1) * next_prim_boundary) * shader->vertex_size,
355 shader->vertex_size * next_verts);
356 }
357 vertex_count += current_verts;
358 }
359
360 #if 0
361 {
362 int i;
363 for (i = 0; i < total_verts; ++i) {
364 struct vertex_header *vh = (struct vertex_header *)(output_ptr + shader->vertex_size * i);
365 debug_printf("%d) Vertex:\n", i);
366 for (j = 0; j < shader->info.num_outputs; ++j) {
367 unsigned *udata = (unsigned*)vh->data[j];
368 debug_printf(" %d) [%f, %f, %f, %f] [%d, %d, %d, %d]\n", j,
369 vh->data[j][0], vh->data[j][1], vh->data[j][2], vh->data[j][3],
370 udata[0], udata[1], udata[2], udata[3]);
371 }
372
373 }
374 }
375 #endif
376
377 prim_idx = 0;
378 for (i = 0; i < shader->vector_length; ++i) {
379 int num_prims = shader->llvm_emitted_primitives[i + (stream * shader->vector_length)];
380 for (j = 0; j < num_prims; ++j) {
381 int prim_length =
382 shader->llvm_prim_lengths[j * shader->num_vertex_streams + stream][i];
383 shader->stream[stream].primitive_lengths[shader->stream[stream].emitted_primitives + prim_idx] =
384 prim_length;
385 ++prim_idx;
386 }
387 }
388
389 shader->stream[stream].emitted_primitives += total_prims;
390 shader->stream[stream].emitted_vertices += total_verts;
391 }
392
393 static void
394 llvm_gs_prepare(struct draw_geometry_shader *shader,
395 const void *constants[PIPE_MAX_CONSTANT_BUFFERS],
396 const unsigned constants_size[PIPE_MAX_CONSTANT_BUFFERS])
397 {
398 }
399
400 static void
401 llvm_gs_run(struct draw_geometry_shader *shader,
402 unsigned input_primitives, unsigned *out_prims)
403 {
404 struct vertex_header *input[PIPE_MAX_VERTEX_STREAMS];
405 for (unsigned i = 0; i < shader->num_vertex_streams; i++) {
406 char *tmp = (char *)shader->gs_output[i];
407 tmp += shader->stream[i].emitted_vertices * shader->vertex_size;
408 input[i] = (struct vertex_header *)tmp;
409 }
410
411 shader->current_variant->jit_func(
412 shader->jit_context, shader->gs_input->data,
413 input,
414 input_primitives,
415 shader->draw->instance_id,
416 shader->llvm_prim_ids,
417 shader->invocation_id);
418
419 for (unsigned i = 0; i < shader->num_vertex_streams; i++) {
420 out_prims[i] = shader->jit_context->emitted_prims[i];
421 }
422 }
423
424 #endif
425
426 static void gs_flush(struct draw_geometry_shader *shader)
427 {
428 unsigned out_prim_count[TGSI_MAX_VERTEX_STREAMS];
429 unsigned i;
430 unsigned input_primitives = shader->fetched_prim_count;
431
432 if (shader->draw->collect_statistics) {
433 shader->draw->statistics.gs_invocations += input_primitives;
434 }
435
436 debug_assert(input_primitives > 0 &&
437 input_primitives <= 4);
438
439 for (unsigned invocation = 0; invocation < shader->num_invocations; invocation++) {
440 shader->invocation_id = invocation;
441 shader->run(shader, input_primitives, out_prim_count);
442 for (i = 0; i < shader->num_vertex_streams; i++) {
443 shader->fetch_outputs(shader, i, out_prim_count[i],
444 &shader->stream[i].tmp_output);
445 }
446 }
447
448 #if 0
449 for (i = 0; i < shader->num_vertex_streams; i++) {
450 debug_printf("stream %d: PRIM emitted prims = %d (verts=%d), cur prim count = %d\n",
451 i,
452 shader->stream[i].emitted_primitives, shader->stream[i].emitted_vertices,
453 out_prim_count[i]);
454 }
455 #endif
456
457 shader->fetched_prim_count = 0;
458 }
459
460 static void gs_point(struct draw_geometry_shader *shader,
461 int idx)
462 {
463 unsigned indices[1];
464
465 indices[0] = idx;
466
467 shader->fetch_inputs(shader, indices, 1,
468 shader->fetched_prim_count);
469 ++shader->in_prim_idx;
470 ++shader->fetched_prim_count;
471
472 if (draw_gs_should_flush(shader))
473 gs_flush(shader);
474 }
475
476 static void gs_line(struct draw_geometry_shader *shader,
477 int i0, int i1)
478 {
479 unsigned indices[2];
480
481 indices[0] = i0;
482 indices[1] = i1;
483
484 shader->fetch_inputs(shader, indices, 2,
485 shader->fetched_prim_count);
486 ++shader->in_prim_idx;
487 ++shader->fetched_prim_count;
488
489 if (draw_gs_should_flush(shader))
490 gs_flush(shader);
491 }
492
493 static void gs_line_adj(struct draw_geometry_shader *shader,
494 int i0, int i1, int i2, int i3)
495 {
496 unsigned indices[4];
497
498 indices[0] = i0;
499 indices[1] = i1;
500 indices[2] = i2;
501 indices[3] = i3;
502
503 shader->fetch_inputs(shader, indices, 4,
504 shader->fetched_prim_count);
505 ++shader->in_prim_idx;
506 ++shader->fetched_prim_count;
507
508 if (draw_gs_should_flush(shader))
509 gs_flush(shader);
510 }
511
512 static void gs_tri(struct draw_geometry_shader *shader,
513 int i0, int i1, int i2)
514 {
515 unsigned indices[3];
516
517 indices[0] = i0;
518 indices[1] = i1;
519 indices[2] = i2;
520
521 shader->fetch_inputs(shader, indices, 3,
522 shader->fetched_prim_count);
523 ++shader->in_prim_idx;
524 ++shader->fetched_prim_count;
525
526 if (draw_gs_should_flush(shader))
527 gs_flush(shader);
528 }
529
530 static void gs_tri_adj(struct draw_geometry_shader *shader,
531 int i0, int i1, int i2,
532 int i3, int i4, int i5)
533 {
534 unsigned indices[6];
535
536 indices[0] = i0;
537 indices[1] = i1;
538 indices[2] = i2;
539 indices[3] = i3;
540 indices[4] = i4;
541 indices[5] = i5;
542
543 shader->fetch_inputs(shader, indices, 6,
544 shader->fetched_prim_count);
545 ++shader->in_prim_idx;
546 ++shader->fetched_prim_count;
547
548 if (draw_gs_should_flush(shader))
549 gs_flush(shader);
550 }
551
552 #define FUNC gs_run
553 #define GET_ELT(idx) (idx)
554 #include "draw_gs_tmp.h"
555
556
557 #define FUNC gs_run_elts
558 #define LOCAL_VARS const ushort *elts = input_prims->elts;
559 #define GET_ELT(idx) (elts[idx])
560 #include "draw_gs_tmp.h"
561
562
563 /**
564 * Execute geometry shader.
565 */
566 int draw_geometry_shader_run(struct draw_geometry_shader *shader,
567 const void *constants[PIPE_MAX_CONSTANT_BUFFERS],
568 const unsigned constants_size[PIPE_MAX_CONSTANT_BUFFERS],
569 const struct draw_vertex_info *input_verts,
570 const struct draw_prim_info *input_prim,
571 const struct tgsi_shader_info *input_info,
572 struct draw_vertex_info *output_verts,
573 struct draw_prim_info *output_prims )
574 {
575 const float (*input)[4] = (const float (*)[4])input_verts->verts->data;
576 unsigned input_stride = input_verts->vertex_size;
577 unsigned num_outputs = draw_total_gs_outputs(shader->draw);
578 unsigned vertex_size = sizeof(struct vertex_header) + num_outputs * 4 * sizeof(float);
579 unsigned num_input_verts = input_prim->linear ?
580 input_verts->count :
581 input_prim->count;
582 unsigned num_in_primitives =
583 align(
584 MAX2(u_decomposed_prims_for_vertices(input_prim->prim,
585 num_input_verts),
586 u_decomposed_prims_for_vertices(shader->input_primitive,
587 num_input_verts)),
588 shader->vector_length);
589 unsigned max_out_prims =
590 u_decomposed_prims_for_vertices(shader->output_primitive,
591 shader->max_output_vertices)
592 * num_in_primitives;
593 /* we allocate exactly one extra vertex per primitive to allow the GS to emit
594 * overflown vertices into some area where they won't harm anyone */
595 unsigned total_verts_per_buffer = shader->primitive_boundary *
596 num_in_primitives;
597 int i;
598 //Assume at least one primitive
599 max_out_prims = MAX2(max_out_prims, 1);
600
601 for (i = 0; i < shader->num_vertex_streams; i++) {
602 /* write all the vertex data into all the streams */
603 output_verts[i].vertex_size = vertex_size;
604 output_verts[i].stride = output_verts[i].vertex_size;
605 output_verts[i].verts =
606 (struct vertex_header *)MALLOC(output_verts[i].vertex_size *
607 total_verts_per_buffer * shader->num_invocations);
608 debug_assert(output_verts[i].verts);
609 }
610
611 #if 0
612 debug_printf("%s count = %d (in prims # = %d, invocs = %d, streams = %d)\n",
613 __FUNCTION__, num_input_verts, num_in_primitives,
614 shader->num_invocations, shader->num_vertex_streams);
615 debug_printf("\tlinear = %d, prim_info->count = %d\n",
616 input_prim->linear, input_prim->count);
617 debug_printf("\tprim pipe = %s, shader in = %s, shader out = %s\n",
618 u_prim_name(input_prim->prim),
619 u_prim_name(shader->input_primitive),
620 u_prim_name(shader->output_primitive));
621 debug_printf("\tmaxv = %d, maxp = %d, primitive_boundary = %d, "
622 "vertex_size = %d, tverts = %d\n",
623 shader->max_output_vertices, max_out_prims,
624 shader->primitive_boundary, output_verts->vertex_size,
625 total_verts_per_buffer);
626 #endif
627
628 for (i = 0; i < shader->num_vertex_streams; i++) {
629 shader->stream[i].emitted_vertices = 0;
630 shader->stream[i].emitted_primitives = 0;
631 FREE(shader->stream[i].primitive_lengths);
632 shader->stream[i].primitive_lengths = MALLOC(max_out_prims * sizeof(unsigned) * shader->num_invocations);
633 shader->stream[i].tmp_output = (float (*)[4])output_verts[i].verts->data;
634 }
635 shader->vertex_size = vertex_size;
636 shader->fetched_prim_count = 0;
637 shader->input_vertex_stride = input_stride;
638 shader->input = input;
639 shader->input_info = input_info;
640
641 #ifdef LLVM_AVAILABLE
642 if (shader->draw->llvm) {
643 for (i = 0; i < shader->num_vertex_streams; i++) {
644 shader->gs_output[i] = output_verts[i].verts;
645 }
646 if (max_out_prims > shader->max_out_prims) {
647 unsigned i;
648 if (shader->llvm_prim_lengths) {
649 for (i = 0; i < shader->num_vertex_streams * shader->max_out_prims; ++i) {
650 align_free(shader->llvm_prim_lengths[i]);
651 }
652 FREE(shader->llvm_prim_lengths);
653 }
654
655 shader->llvm_prim_lengths = MALLOC(shader->num_vertex_streams * max_out_prims * sizeof(unsigned*));
656 for (i = 0; i < shader->num_vertex_streams * max_out_prims; ++i) {
657 int vector_size = shader->vector_length * sizeof(unsigned);
658 shader->llvm_prim_lengths[i] =
659 align_malloc(vector_size, vector_size);
660 }
661
662 shader->max_out_prims = max_out_prims;
663 }
664 shader->jit_context->prim_lengths = shader->llvm_prim_lengths;
665 shader->jit_context->emitted_vertices = shader->llvm_emitted_vertices;
666 shader->jit_context->emitted_prims = shader->llvm_emitted_primitives;
667 }
668 #endif
669
670 shader->prepare(shader, constants, constants_size);
671
672 if (input_prim->linear)
673 gs_run(shader, input_prim, input_verts,
674 output_prims, output_verts);
675 else
676 gs_run_elts(shader, input_prim, input_verts,
677 output_prims, output_verts);
678
679 /* Flush the remaining primitives. Will happen if
680 * num_input_primitives % 4 != 0
681 */
682 if (shader->fetched_prim_count > 0) {
683 gs_flush(shader);
684 }
685 debug_assert(shader->fetched_prim_count == 0);
686
687 /* Update prim_info:
688 */
689 for (i = 0; i < shader->num_vertex_streams; i++) {
690 output_prims[i].linear = TRUE;
691 output_prims[i].elts = NULL;
692 output_prims[i].start = 0;
693 output_prims[i].count = shader->stream[i].emitted_vertices;
694 output_prims[i].prim = shader->output_primitive;
695 output_prims[i].flags = 0x0;
696 output_prims[i].primitive_lengths = shader->stream[i].primitive_lengths;
697 output_prims[i].primitive_count = shader->stream[i].emitted_primitives;
698 output_verts[i].count = shader->stream[i].emitted_vertices;
699
700 if (shader->draw->collect_statistics) {
701 unsigned j;
702 for (j = 0; j < shader->stream[i].emitted_primitives; ++j) {
703 shader->draw->statistics.gs_primitives +=
704 u_decomposed_prims_for_vertices(shader->output_primitive,
705 shader->stream[i].primitive_lengths[j]);
706 }
707 }
708 }
709
710 #if 0
711 debug_printf("GS finished\n");
712 for (i = 0; i < 4; i++)
713 debug_printf("stream %d: prims = %d verts = %d\n", i, output_prims[i].primitive_count, output_verts[i].count);
714 #endif
715
716 return 0;
717 }
718
719 void draw_geometry_shader_prepare(struct draw_geometry_shader *shader,
720 struct draw_context *draw)
721 {
722 boolean use_llvm = draw->llvm != NULL;
723 if (!use_llvm && shader && shader->machine->Tokens != shader->state.tokens) {
724 tgsi_exec_machine_bind_shader(shader->machine,
725 shader->state.tokens,
726 draw->gs.tgsi.sampler,
727 draw->gs.tgsi.image,
728 draw->gs.tgsi.buffer);
729 }
730 }
731
732
733 boolean
734 draw_gs_init( struct draw_context *draw )
735 {
736 if (!draw->llvm) {
737 draw->gs.tgsi.machine = tgsi_exec_machine_create(PIPE_SHADER_GEOMETRY);
738
739 for (unsigned i = 0; i < TGSI_MAX_VERTEX_STREAMS; i++) {
740 draw->gs.tgsi.machine->Primitives[i] = align_malloc(
741 MAX_PRIMITIVES * sizeof(struct tgsi_exec_vector), 16);
742 draw->gs.tgsi.machine->PrimitiveOffsets[i] = align_malloc(
743 MAX_PRIMITIVES * sizeof(struct tgsi_exec_vector), 16);
744 if (!draw->gs.tgsi.machine->Primitives[i] || !draw->gs.tgsi.machine->PrimitiveOffsets[i])
745 return FALSE;
746 memset(draw->gs.tgsi.machine->Primitives[i], 0,
747 MAX_PRIMITIVES * sizeof(struct tgsi_exec_vector));
748 memset(draw->gs.tgsi.machine->PrimitiveOffsets[i], 0,
749 MAX_PRIMITIVES * sizeof(struct tgsi_exec_vector));
750 }
751 }
752
753 return TRUE;
754 }
755
756 void draw_gs_destroy( struct draw_context *draw )
757 {
758 int i;
759 if (draw->gs.tgsi.machine) {
760 for (i = 0; i < TGSI_MAX_VERTEX_STREAMS; i++) {
761 align_free(draw->gs.tgsi.machine->Primitives[i]);
762 align_free(draw->gs.tgsi.machine->PrimitiveOffsets[i]);
763 }
764 tgsi_exec_machine_destroy(draw->gs.tgsi.machine);
765 }
766 }
767
768 struct draw_geometry_shader *
769 draw_create_geometry_shader(struct draw_context *draw,
770 const struct pipe_shader_state *state)
771 {
772 #ifdef LLVM_AVAILABLE
773 boolean use_llvm = draw->llvm != NULL;
774 struct llvm_geometry_shader *llvm_gs = NULL;
775 #endif
776 struct draw_geometry_shader *gs;
777 unsigned i;
778
779 #ifdef LLVM_AVAILABLE
780 if (use_llvm) {
781 llvm_gs = CALLOC_STRUCT(llvm_geometry_shader);
782
783 if (!llvm_gs)
784 return NULL;
785
786 gs = &llvm_gs->base;
787
788 make_empty_list(&llvm_gs->variants);
789 } else
790 #endif
791 {
792 gs = CALLOC_STRUCT(draw_geometry_shader);
793 }
794
795 if (!gs)
796 return NULL;
797
798 gs->draw = draw;
799 gs->state = *state;
800
801 if (state->type == PIPE_SHADER_IR_TGSI) {
802 gs->state.tokens = tgsi_dup_tokens(state->tokens);
803 if (!gs->state.tokens) {
804 FREE(gs);
805 return NULL;
806 }
807
808 tgsi_scan_shader(state->tokens, &gs->info);
809 } else
810 nir_tgsi_scan_shader(state->ir.nir, &gs->info, true);
811
812 /* setup the defaults */
813 gs->max_out_prims = 0;
814
815 #ifdef LLVM_AVAILABLE
816 if (use_llvm) {
817 /* TODO: change the input array to handle the following
818 vector length, instead of the currently hardcoded
819 TGSI_NUM_CHANNELS
820 gs->vector_length = lp_native_vector_width / 32;*/
821 gs->vector_length = TGSI_NUM_CHANNELS;
822 } else
823 #endif
824 {
825 gs->vector_length = 1;
826 }
827
828 gs->input_primitive =
829 gs->info.properties[TGSI_PROPERTY_GS_INPUT_PRIM];
830 gs->output_primitive =
831 gs->info.properties[TGSI_PROPERTY_GS_OUTPUT_PRIM];
832 gs->max_output_vertices =
833 gs->info.properties[TGSI_PROPERTY_GS_MAX_OUTPUT_VERTICES];
834 gs->num_invocations =
835 gs->info.properties[TGSI_PROPERTY_GS_INVOCATIONS];
836 if (!gs->max_output_vertices)
837 gs->max_output_vertices = 32;
838
839 /* Primitive boundary is bigger than max_output_vertices by one, because
840 * the specification says that the geometry shader should exit if the
841 * number of emitted vertices is bigger or equal to max_output_vertices and
842 * we can't do that because we're running in the SoA mode, which means that
843 * our storing routines will keep getting called on channels that have
844 * overflown.
845 * So we need some scratch area where we can keep writing the overflown
846 * vertices without overwriting anything important or crashing.
847 */
848 gs->primitive_boundary = gs->max_output_vertices + 1;
849
850 gs->position_output = -1;
851 for (i = 0; i < gs->info.num_outputs; i++) {
852 if (gs->info.output_semantic_name[i] == TGSI_SEMANTIC_POSITION &&
853 gs->info.output_semantic_index[i] == 0)
854 gs->position_output = i;
855 if (gs->info.output_semantic_name[i] == TGSI_SEMANTIC_VIEWPORT_INDEX)
856 gs->viewport_index_output = i;
857 if (gs->info.output_semantic_name[i] == TGSI_SEMANTIC_CLIPDIST) {
858 debug_assert(gs->info.output_semantic_index[i] <
859 PIPE_MAX_CLIP_OR_CULL_DISTANCE_ELEMENT_COUNT);
860 gs->ccdistance_output[gs->info.output_semantic_index[i]] = i;
861 }
862 }
863
864 gs->machine = draw->gs.tgsi.machine;
865
866 gs->num_vertex_streams = 1;
867 for (i = 0; i < gs->state.stream_output.num_outputs; i++) {
868 if (gs->state.stream_output.output[i].stream >= gs->num_vertex_streams)
869 gs->num_vertex_streams = gs->state.stream_output.output[i].stream + 1;
870 }
871
872 #ifdef LLVM_AVAILABLE
873 if (use_llvm) {
874 int vector_size = gs->vector_length * sizeof(float);
875 gs->gs_input = align_malloc(sizeof(struct draw_gs_inputs), 16);
876 memset(gs->gs_input, 0, sizeof(struct draw_gs_inputs));
877 gs->llvm_prim_lengths = 0;
878
879 gs->llvm_emitted_primitives = align_malloc(vector_size * gs->num_vertex_streams, vector_size);
880 gs->llvm_emitted_vertices = align_malloc(vector_size * gs->num_vertex_streams, vector_size);
881 gs->llvm_prim_ids = align_calloc(vector_size, vector_size);
882
883 gs->fetch_outputs = llvm_fetch_gs_outputs;
884 gs->fetch_inputs = llvm_fetch_gs_input;
885 gs->prepare = llvm_gs_prepare;
886 gs->run = llvm_gs_run;
887
888 gs->jit_context = &draw->llvm->gs_jit_context;
889
890
891 llvm_gs->variant_key_size =
892 draw_gs_llvm_variant_key_size(
893 MAX2(gs->info.file_max[TGSI_FILE_SAMPLER]+1,
894 gs->info.file_max[TGSI_FILE_SAMPLER_VIEW]+1),
895 gs->info.file_max[TGSI_FILE_IMAGE]+1);
896 } else
897 #endif
898 {
899 gs->fetch_outputs = tgsi_fetch_gs_outputs;
900 gs->fetch_inputs = tgsi_fetch_gs_input;
901 gs->prepare = tgsi_gs_prepare;
902 gs->run = tgsi_gs_run;
903 }
904
905 return gs;
906 }
907
908 void draw_bind_geometry_shader(struct draw_context *draw,
909 struct draw_geometry_shader *dgs)
910 {
911 draw_do_flush(draw, DRAW_FLUSH_STATE_CHANGE);
912
913 if (dgs) {
914 draw->gs.geometry_shader = dgs;
915 draw->gs.num_gs_outputs = dgs->info.num_outputs;
916 draw->gs.position_output = dgs->position_output;
917 draw_geometry_shader_prepare(dgs, draw);
918 }
919 else {
920 draw->gs.geometry_shader = NULL;
921 draw->gs.num_gs_outputs = 0;
922 }
923 }
924
925 void draw_delete_geometry_shader(struct draw_context *draw,
926 struct draw_geometry_shader *dgs)
927 {
928 int i;
929 if (!dgs) {
930 return;
931 }
932 #ifdef LLVM_AVAILABLE
933 if (draw->llvm) {
934 struct llvm_geometry_shader *shader = llvm_geometry_shader(dgs);
935 struct draw_gs_llvm_variant_list_item *li;
936
937 li = first_elem(&shader->variants);
938 while(!at_end(&shader->variants, li)) {
939 struct draw_gs_llvm_variant_list_item *next = next_elem(li);
940 draw_gs_llvm_destroy_variant(li->base);
941 li = next;
942 }
943
944 assert(shader->variants_cached == 0);
945
946 if (dgs->llvm_prim_lengths) {
947 unsigned i;
948 for (i = 0; i < dgs->num_vertex_streams * dgs->max_out_prims; ++i) {
949 align_free(dgs->llvm_prim_lengths[i]);
950 }
951 FREE(dgs->llvm_prim_lengths);
952 }
953 align_free(dgs->llvm_emitted_primitives);
954 align_free(dgs->llvm_emitted_vertices);
955 align_free(dgs->llvm_prim_ids);
956
957 align_free(dgs->gs_input);
958 }
959 #endif
960
961 for (i = 0; i < TGSI_MAX_VERTEX_STREAMS; i++)
962 FREE(dgs->stream[i].primitive_lengths);
963
964 if (dgs->state.ir.nir)
965 ralloc_free(dgs->state.ir.nir);
966 FREE((void*) dgs->state.tokens);
967 FREE(dgs);
968 }
969
970
971 #ifdef LLVM_AVAILABLE
972 void draw_gs_set_current_variant(struct draw_geometry_shader *shader,
973 struct draw_gs_llvm_variant *variant)
974 {
975 shader->current_variant = variant;
976 }
977 #endif
978
979 /*
980 * Called at the very begin of the draw call with a new instance
981 * Used to reset state that should persist between primitive restart.
982 */
983 void
984 draw_geometry_shader_new_instance(struct draw_geometry_shader *gs)
985 {
986 if (!gs)
987 return;
988
989 gs->in_prim_idx = 0;
990 }