5309f306109c10bf5e3d32649d1068cc78b14854
[mesa.git] / src / gallium / drivers / llvmpipe / lp_rast.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 <limits.h>
29 #include "util/u_memory.h"
30 #include "util/u_math.h"
31 #include "util/u_rect.h"
32 #include "util/u_surface.h"
33 #include "util/u_pack_color.h"
34 #include "util/u_string.h"
35 #include "util/u_thread.h"
36 #include "util/u_memset.h"
37 #include "util/os_time.h"
38
39 #include "lp_scene_queue.h"
40 #include "lp_context.h"
41 #include "lp_debug.h"
42 #include "lp_fence.h"
43 #include "lp_perf.h"
44 #include "lp_query.h"
45 #include "lp_rast.h"
46 #include "lp_rast_priv.h"
47 #include "gallivm/lp_bld_format.h"
48 #include "gallivm/lp_bld_debug.h"
49 #include "lp_scene.h"
50 #include "lp_tex_sample.h"
51
52
53 #ifdef DEBUG
54 int jit_line = 0;
55 const struct lp_rast_state *jit_state = NULL;
56 const struct lp_rasterizer_task *jit_task = NULL;
57 #endif
58
59 const float lp_sample_pos_4x[4][2] = { { 0.375, 0.125 },
60 { 0.875, 0.375 },
61 { 0.125, 0.625 },
62 { 0.625, 0.875 } };
63
64 /**
65 * Begin rasterizing a scene.
66 * Called once per scene by one thread.
67 */
68 static void
69 lp_rast_begin( struct lp_rasterizer *rast,
70 struct lp_scene *scene )
71 {
72 rast->curr_scene = scene;
73
74 LP_DBG(DEBUG_RAST, "%s\n", __FUNCTION__);
75
76 lp_scene_begin_rasterization( scene );
77 lp_scene_bin_iter_begin( scene );
78 }
79
80
81 static void
82 lp_rast_end( struct lp_rasterizer *rast )
83 {
84 lp_scene_end_rasterization( rast->curr_scene );
85
86 rast->curr_scene = NULL;
87 }
88
89
90 /**
91 * Beginning rasterization of a tile.
92 * \param x window X position of the tile, in pixels
93 * \param y window Y position of the tile, in pixels
94 */
95 static void
96 lp_rast_tile_begin(struct lp_rasterizer_task *task,
97 const struct cmd_bin *bin,
98 int x, int y)
99 {
100 unsigned i;
101 struct lp_scene *scene = task->scene;
102
103 LP_DBG(DEBUG_RAST, "%s %d,%d\n", __FUNCTION__, x, y);
104
105 task->bin = bin;
106 task->x = x * TILE_SIZE;
107 task->y = y * TILE_SIZE;
108 task->width = TILE_SIZE + x * TILE_SIZE > task->scene->fb.width ?
109 task->scene->fb.width - x * TILE_SIZE : TILE_SIZE;
110 task->height = TILE_SIZE + y * TILE_SIZE > task->scene->fb.height ?
111 task->scene->fb.height - y * TILE_SIZE : TILE_SIZE;
112
113 task->thread_data.vis_counter = 0;
114 task->thread_data.ps_invocations = 0;
115
116 for (i = 0; i < task->scene->fb.nr_cbufs; i++) {
117 if (task->scene->fb.cbufs[i]) {
118 task->color_tiles[i] = scene->cbufs[i].map +
119 scene->cbufs[i].stride * task->y +
120 scene->cbufs[i].format_bytes * task->x;
121 }
122 }
123 if (task->scene->fb.zsbuf) {
124 task->depth_tile = scene->zsbuf.map +
125 scene->zsbuf.stride * task->y +
126 scene->zsbuf.format_bytes * task->x;
127 }
128 }
129
130
131 /**
132 * Clear the rasterizer's current color tile.
133 * This is a bin command called during bin processing.
134 * Clear commands always clear all bound layers.
135 */
136 static void
137 lp_rast_clear_color(struct lp_rasterizer_task *task,
138 const union lp_rast_cmd_arg arg)
139 {
140 const struct lp_scene *scene = task->scene;
141 unsigned cbuf = arg.clear_rb->cbuf;
142 union util_color uc;
143 enum pipe_format format;
144
145 /* we never bin clear commands for non-existing buffers */
146 assert(cbuf < scene->fb.nr_cbufs);
147 assert(scene->fb.cbufs[cbuf]);
148
149 format = scene->fb.cbufs[cbuf]->format;
150 uc = arg.clear_rb->color_val;
151
152 /*
153 * this is pretty rough since we have target format (bunch of bytes...) here.
154 * dump it as raw 4 dwords.
155 */
156 LP_DBG(DEBUG_RAST, "%s clear value (target format %d) raw 0x%x,0x%x,0x%x,0x%x\n",
157 __FUNCTION__, format, uc.ui[0], uc.ui[1], uc.ui[2], uc.ui[3]);
158
159
160 util_fill_box(scene->cbufs[cbuf].map,
161 format,
162 scene->cbufs[cbuf].stride,
163 scene->cbufs[cbuf].layer_stride,
164 task->x,
165 task->y,
166 0,
167 task->width,
168 task->height,
169 scene->fb_max_layer + 1,
170 &uc);
171
172 /* this will increase for each rb which probably doesn't mean much */
173 LP_COUNT(nr_color_tile_clear);
174 }
175
176
177 /**
178 * Clear the rasterizer's current z/stencil tile.
179 * This is a bin command called during bin processing.
180 * Clear commands always clear all bound layers.
181 */
182 static void
183 lp_rast_clear_zstencil(struct lp_rasterizer_task *task,
184 const union lp_rast_cmd_arg arg)
185 {
186 const struct lp_scene *scene = task->scene;
187 uint64_t clear_value64 = arg.clear_zstencil.value;
188 uint64_t clear_mask64 = arg.clear_zstencil.mask;
189 uint32_t clear_value = (uint32_t) clear_value64;
190 uint32_t clear_mask = (uint32_t) clear_mask64;
191 const unsigned height = task->height;
192 const unsigned width = task->width;
193 const unsigned dst_stride = scene->zsbuf.stride;
194 uint8_t *dst;
195 unsigned i, j;
196 unsigned block_size;
197
198 LP_DBG(DEBUG_RAST, "%s: value=0x%08x, mask=0x%08x\n",
199 __FUNCTION__, clear_value, clear_mask);
200
201 /*
202 * Clear the area of the depth/depth buffer matching this tile.
203 */
204
205 if (scene->fb.zsbuf) {
206 unsigned layer;
207 uint8_t *dst_layer = task->depth_tile;
208 block_size = util_format_get_blocksize(scene->fb.zsbuf->format);
209
210 clear_value &= clear_mask;
211
212 for (layer = 0; layer <= scene->fb_max_layer; layer++) {
213 dst = dst_layer;
214
215 switch (block_size) {
216 case 1:
217 assert(clear_mask == 0xff);
218 for (i = 0; i < height; i++) {
219 uint8_t *row = (uint8_t *)dst;
220 memset(row, (uint8_t) clear_value, width);
221 dst += dst_stride;
222 }
223 break;
224 case 2:
225 if (clear_mask == 0xffff) {
226 for (i = 0; i < height; i++) {
227 uint16_t *row = (uint16_t *)dst;
228 for (j = 0; j < width; j++)
229 *row++ = (uint16_t) clear_value;
230 dst += dst_stride;
231 }
232 }
233 else {
234 for (i = 0; i < height; i++) {
235 uint16_t *row = (uint16_t *)dst;
236 for (j = 0; j < width; j++) {
237 uint16_t tmp = ~clear_mask & *row;
238 *row++ = clear_value | tmp;
239 }
240 dst += dst_stride;
241 }
242 }
243 break;
244 case 4:
245 if (clear_mask == 0xffffffff) {
246 for (i = 0; i < height; i++) {
247 util_memset32(dst, clear_value, width);
248 dst += dst_stride;
249 }
250 }
251 else {
252 for (i = 0; i < height; i++) {
253 uint32_t *row = (uint32_t *)dst;
254 for (j = 0; j < width; j++) {
255 uint32_t tmp = ~clear_mask & *row;
256 *row++ = clear_value | tmp;
257 }
258 dst += dst_stride;
259 }
260 }
261 break;
262 case 8:
263 clear_value64 &= clear_mask64;
264 if (clear_mask64 == 0xffffffffffULL) {
265 for (i = 0; i < height; i++) {
266 uint64_t *row = (uint64_t *)dst;
267 for (j = 0; j < width; j++)
268 *row++ = clear_value64;
269 dst += dst_stride;
270 }
271 }
272 else {
273 for (i = 0; i < height; i++) {
274 uint64_t *row = (uint64_t *)dst;
275 for (j = 0; j < width; j++) {
276 uint64_t tmp = ~clear_mask64 & *row;
277 *row++ = clear_value64 | tmp;
278 }
279 dst += dst_stride;
280 }
281 }
282 break;
283
284 default:
285 assert(0);
286 break;
287 }
288 dst_layer += scene->zsbuf.layer_stride;
289 }
290 }
291 }
292
293
294
295 /**
296 * Run the shader on all blocks in a tile. This is used when a tile is
297 * completely contained inside a triangle.
298 * This is a bin command called during bin processing.
299 */
300 static void
301 lp_rast_shade_tile(struct lp_rasterizer_task *task,
302 const union lp_rast_cmd_arg arg)
303 {
304 const struct lp_scene *scene = task->scene;
305 const struct lp_rast_shader_inputs *inputs = arg.shade_tile;
306 const struct lp_rast_state *state;
307 struct lp_fragment_shader_variant *variant;
308 const unsigned tile_x = task->x, tile_y = task->y;
309 unsigned x, y;
310
311 if (inputs->disable) {
312 /* This command was partially binned and has been disabled */
313 return;
314 }
315
316 LP_DBG(DEBUG_RAST, "%s\n", __FUNCTION__);
317
318 state = task->state;
319 assert(state);
320 if (!state) {
321 return;
322 }
323 variant = state->variant;
324
325 /* render the whole 64x64 tile in 4x4 chunks */
326 for (y = 0; y < task->height; y += 4){
327 for (x = 0; x < task->width; x += 4) {
328 uint8_t *color[PIPE_MAX_COLOR_BUFS];
329 unsigned stride[PIPE_MAX_COLOR_BUFS];
330 unsigned sample_stride[PIPE_MAX_COLOR_BUFS];
331 uint8_t *depth = NULL;
332 unsigned depth_stride = 0;
333 unsigned depth_sample_stride = 0;
334 unsigned i;
335
336 /* color buffer */
337 for (i = 0; i < scene->fb.nr_cbufs; i++){
338 if (scene->fb.cbufs[i]) {
339 stride[i] = scene->cbufs[i].stride;
340 sample_stride[i] = 0;
341 color[i] = lp_rast_get_color_block_pointer(task, i, tile_x + x,
342 tile_y + y, inputs->layer);
343 }
344 else {
345 stride[i] = 0;
346 sample_stride[i] = 0;
347 color[i] = NULL;
348 }
349 }
350
351 /* depth buffer */
352 if (scene->zsbuf.map) {
353 depth = lp_rast_get_depth_block_pointer(task, tile_x + x,
354 tile_y + y, inputs->layer);
355 depth_stride = scene->zsbuf.stride;
356 }
357
358 /* Propagate non-interpolated raster state. */
359 task->thread_data.raster_state.viewport_index = inputs->viewport_index;
360
361 /* run shader on 4x4 block */
362 BEGIN_JIT_CALL(state, task);
363 variant->jit_function[RAST_WHOLE]( &state->jit_context,
364 tile_x + x, tile_y + y,
365 inputs->frontfacing,
366 GET_A0(inputs),
367 GET_DADX(inputs),
368 GET_DADY(inputs),
369 color,
370 depth,
371 0xffff,
372 &task->thread_data,
373 stride,
374 depth_stride,
375 sample_stride,
376 depth_sample_stride);
377 END_JIT_CALL();
378 }
379 }
380 }
381
382
383 /**
384 * Run the shader on all blocks in a tile. This is used when a tile is
385 * completely contained inside a triangle, and the shader is opaque.
386 * This is a bin command called during bin processing.
387 */
388 static void
389 lp_rast_shade_tile_opaque(struct lp_rasterizer_task *task,
390 const union lp_rast_cmd_arg arg)
391 {
392 LP_DBG(DEBUG_RAST, "%s\n", __FUNCTION__);
393
394 assert(task->state);
395 if (!task->state) {
396 return;
397 }
398
399 lp_rast_shade_tile(task, arg);
400 }
401
402
403 /**
404 * Compute shading for a 4x4 block of pixels inside a triangle.
405 * This is a bin command called during bin processing.
406 * \param x X position of quad in window coords
407 * \param y Y position of quad in window coords
408 */
409 void
410 lp_rast_shade_quads_mask(struct lp_rasterizer_task *task,
411 const struct lp_rast_shader_inputs *inputs,
412 unsigned x, unsigned y,
413 unsigned mask)
414 {
415 const struct lp_rast_state *state = task->state;
416 struct lp_fragment_shader_variant *variant = state->variant;
417 const struct lp_scene *scene = task->scene;
418 uint8_t *color[PIPE_MAX_COLOR_BUFS];
419 unsigned stride[PIPE_MAX_COLOR_BUFS];
420 unsigned sample_stride[PIPE_MAX_COLOR_BUFS];
421 uint8_t *depth = NULL;
422 unsigned depth_stride = 0;
423 unsigned depth_sample_stride = 0;
424 unsigned i;
425
426 assert(state);
427
428 /* Sanity checks */
429 assert(x < scene->tiles_x * TILE_SIZE);
430 assert(y < scene->tiles_y * TILE_SIZE);
431 assert(x % TILE_VECTOR_WIDTH == 0);
432 assert(y % TILE_VECTOR_HEIGHT == 0);
433
434 assert((x % 4) == 0);
435 assert((y % 4) == 0);
436
437 /* color buffer */
438 for (i = 0; i < scene->fb.nr_cbufs; i++) {
439 if (scene->fb.cbufs[i]) {
440 stride[i] = scene->cbufs[i].stride;
441 sample_stride[i] = 0;
442 color[i] = lp_rast_get_color_block_pointer(task, i, x, y,
443 inputs->layer);
444 }
445 else {
446 stride[i] = 0;
447 sample_stride[i] = 0;
448 color[i] = NULL;
449 }
450 }
451
452 /* depth buffer */
453 if (scene->zsbuf.map) {
454 depth_stride = scene->zsbuf.stride;
455 depth = lp_rast_get_depth_block_pointer(task, x, y, inputs->layer);
456 }
457
458 assert(lp_check_alignment(state->jit_context.u8_blend_color, 16));
459
460 /*
461 * The rasterizer may produce fragments outside our
462 * allocated 4x4 blocks hence need to filter them out here.
463 */
464 if ((x % TILE_SIZE) < task->width && (y % TILE_SIZE) < task->height) {
465 /* Propagate non-interpolated raster state. */
466 task->thread_data.raster_state.viewport_index = inputs->viewport_index;
467
468 /* run shader on 4x4 block */
469 BEGIN_JIT_CALL(state, task);
470 variant->jit_function[RAST_EDGE_TEST](&state->jit_context,
471 x, y,
472 inputs->frontfacing,
473 GET_A0(inputs),
474 GET_DADX(inputs),
475 GET_DADY(inputs),
476 color,
477 depth,
478 mask,
479 &task->thread_data,
480 stride,
481 depth_stride,
482 sample_stride,
483 depth_sample_stride);
484 END_JIT_CALL();
485 }
486 }
487
488
489
490 /**
491 * Begin a new occlusion query.
492 * This is a bin command put in all bins.
493 * Called per thread.
494 */
495 static void
496 lp_rast_begin_query(struct lp_rasterizer_task *task,
497 const union lp_rast_cmd_arg arg)
498 {
499 struct llvmpipe_query *pq = arg.query_obj;
500
501 switch (pq->type) {
502 case PIPE_QUERY_OCCLUSION_COUNTER:
503 case PIPE_QUERY_OCCLUSION_PREDICATE:
504 case PIPE_QUERY_OCCLUSION_PREDICATE_CONSERVATIVE:
505 pq->start[task->thread_index] = task->thread_data.vis_counter;
506 break;
507 case PIPE_QUERY_PIPELINE_STATISTICS:
508 pq->start[task->thread_index] = task->thread_data.ps_invocations;
509 break;
510 default:
511 assert(0);
512 break;
513 }
514 }
515
516
517 /**
518 * End the current occlusion query.
519 * This is a bin command put in all bins.
520 * Called per thread.
521 */
522 static void
523 lp_rast_end_query(struct lp_rasterizer_task *task,
524 const union lp_rast_cmd_arg arg)
525 {
526 struct llvmpipe_query *pq = arg.query_obj;
527
528 switch (pq->type) {
529 case PIPE_QUERY_OCCLUSION_COUNTER:
530 case PIPE_QUERY_OCCLUSION_PREDICATE:
531 case PIPE_QUERY_OCCLUSION_PREDICATE_CONSERVATIVE:
532 pq->end[task->thread_index] +=
533 task->thread_data.vis_counter - pq->start[task->thread_index];
534 pq->start[task->thread_index] = 0;
535 break;
536 case PIPE_QUERY_TIMESTAMP:
537 pq->end[task->thread_index] = os_time_get_nano();
538 break;
539 case PIPE_QUERY_PIPELINE_STATISTICS:
540 pq->end[task->thread_index] +=
541 task->thread_data.ps_invocations - pq->start[task->thread_index];
542 pq->start[task->thread_index] = 0;
543 break;
544 default:
545 assert(0);
546 break;
547 }
548 }
549
550
551 void
552 lp_rast_set_state(struct lp_rasterizer_task *task,
553 const union lp_rast_cmd_arg arg)
554 {
555 task->state = arg.state;
556 }
557
558
559
560 /**
561 * Called when we're done writing to a color tile.
562 */
563 static void
564 lp_rast_tile_end(struct lp_rasterizer_task *task)
565 {
566 unsigned i;
567
568 for (i = 0; i < task->scene->num_active_queries; ++i) {
569 lp_rast_end_query(task, lp_rast_arg_query(task->scene->active_queries[i]));
570 }
571
572 /* debug */
573 memset(task->color_tiles, 0, sizeof(task->color_tiles));
574 task->depth_tile = NULL;
575
576 task->bin = NULL;
577 }
578
579 static lp_rast_cmd_func dispatch[LP_RAST_OP_MAX] =
580 {
581 lp_rast_clear_color,
582 lp_rast_clear_zstencil,
583 lp_rast_triangle_1,
584 lp_rast_triangle_2,
585 lp_rast_triangle_3,
586 lp_rast_triangle_4,
587 lp_rast_triangle_5,
588 lp_rast_triangle_6,
589 lp_rast_triangle_7,
590 lp_rast_triangle_8,
591 lp_rast_triangle_3_4,
592 lp_rast_triangle_3_16,
593 lp_rast_triangle_4_16,
594 lp_rast_shade_tile,
595 lp_rast_shade_tile_opaque,
596 lp_rast_begin_query,
597 lp_rast_end_query,
598 lp_rast_set_state,
599 lp_rast_triangle_32_1,
600 lp_rast_triangle_32_2,
601 lp_rast_triangle_32_3,
602 lp_rast_triangle_32_4,
603 lp_rast_triangle_32_5,
604 lp_rast_triangle_32_6,
605 lp_rast_triangle_32_7,
606 lp_rast_triangle_32_8,
607 lp_rast_triangle_32_3_4,
608 lp_rast_triangle_32_3_16,
609 lp_rast_triangle_32_4_16
610 };
611
612
613 static void
614 do_rasterize_bin(struct lp_rasterizer_task *task,
615 const struct cmd_bin *bin,
616 int x, int y)
617 {
618 const struct cmd_block *block;
619 unsigned k;
620
621 if (0)
622 lp_debug_bin(bin, x, y);
623
624 for (block = bin->head; block; block = block->next) {
625 for (k = 0; k < block->count; k++) {
626 dispatch[block->cmd[k]]( task, block->arg[k] );
627 }
628 }
629 }
630
631
632
633 /**
634 * Rasterize commands for a single bin.
635 * \param x, y position of the bin's tile in the framebuffer
636 * Must be called between lp_rast_begin() and lp_rast_end().
637 * Called per thread.
638 */
639 static void
640 rasterize_bin(struct lp_rasterizer_task *task,
641 const struct cmd_bin *bin, int x, int y )
642 {
643 lp_rast_tile_begin( task, bin, x, y );
644
645 do_rasterize_bin(task, bin, x, y);
646
647 lp_rast_tile_end(task);
648
649 #ifdef DEBUG
650 /* Debug/Perf flags:
651 */
652 if (bin->head->count == 1) {
653 if (bin->head->cmd[0] == LP_RAST_OP_SHADE_TILE_OPAQUE)
654 LP_COUNT(nr_pure_shade_opaque_64);
655 else if (bin->head->cmd[0] == LP_RAST_OP_SHADE_TILE)
656 LP_COUNT(nr_pure_shade_64);
657 }
658 #endif
659 }
660
661
662 /* An empty bin is one that just loads the contents of the tile and
663 * stores them again unchanged. This typically happens when bins have
664 * been flushed for some reason in the middle of a frame, or when
665 * incremental updates are being made to a render target.
666 *
667 * Try to avoid doing pointless work in this case.
668 */
669 static boolean
670 is_empty_bin( const struct cmd_bin *bin )
671 {
672 return bin->head == NULL;
673 }
674
675
676 /**
677 * Rasterize/execute all bins within a scene.
678 * Called per thread.
679 */
680 static void
681 rasterize_scene(struct lp_rasterizer_task *task,
682 struct lp_scene *scene)
683 {
684 task->scene = scene;
685
686 /* Clear the cache tags. This should not always be necessary but
687 simpler for now. */
688 #if LP_USE_TEXTURE_CACHE
689 memset(task->thread_data.cache->cache_tags, 0,
690 sizeof(task->thread_data.cache->cache_tags));
691 #if LP_BUILD_FORMAT_CACHE_DEBUG
692 task->thread_data.cache->cache_access_total = 0;
693 task->thread_data.cache->cache_access_miss = 0;
694 #endif
695 #endif
696
697 if (!task->rast->no_rast) {
698 /* loop over scene bins, rasterize each */
699 {
700 struct cmd_bin *bin;
701 int i, j;
702
703 assert(scene);
704 while ((bin = lp_scene_bin_iter_next(scene, &i, &j))) {
705 if (!is_empty_bin( bin ))
706 rasterize_bin(task, bin, i, j);
707 }
708 }
709 }
710
711
712 #if LP_BUILD_FORMAT_CACHE_DEBUG
713 {
714 uint64_t total, miss;
715 total = task->thread_data.cache->cache_access_total;
716 miss = task->thread_data.cache->cache_access_miss;
717 if (total) {
718 debug_printf("thread %d cache access %llu miss %llu hit rate %f\n",
719 task->thread_index, (long long unsigned)total,
720 (long long unsigned)miss,
721 (float)(total - miss)/(float)total);
722 }
723 }
724 #endif
725
726 if (scene->fence) {
727 lp_fence_signal(scene->fence);
728 }
729
730 task->scene = NULL;
731 }
732
733
734 /**
735 * Called by setup module when it has something for us to render.
736 */
737 void
738 lp_rast_queue_scene( struct lp_rasterizer *rast,
739 struct lp_scene *scene)
740 {
741 LP_DBG(DEBUG_SETUP, "%s\n", __FUNCTION__);
742
743 if (rast->num_threads == 0) {
744 /* no threading */
745 unsigned fpstate = util_fpstate_get();
746
747 /* Make sure that denorms are treated like zeros. This is
748 * the behavior required by D3D10. OpenGL doesn't care.
749 */
750 util_fpstate_set_denorms_to_zero(fpstate);
751
752 lp_rast_begin( rast, scene );
753
754 rasterize_scene( &rast->tasks[0], scene );
755
756 lp_rast_end( rast );
757
758 util_fpstate_set(fpstate);
759
760 rast->curr_scene = NULL;
761 }
762 else {
763 /* threaded rendering! */
764 unsigned i;
765
766 lp_scene_enqueue( rast->full_scenes, scene );
767
768 /* signal the threads that there's work to do */
769 for (i = 0; i < rast->num_threads; i++) {
770 pipe_semaphore_signal(&rast->tasks[i].work_ready);
771 }
772 }
773
774 LP_DBG(DEBUG_SETUP, "%s done \n", __FUNCTION__);
775 }
776
777
778 void
779 lp_rast_finish( struct lp_rasterizer *rast )
780 {
781 if (rast->num_threads == 0) {
782 /* nothing to do */
783 }
784 else {
785 int i;
786
787 /* wait for work to complete */
788 for (i = 0; i < rast->num_threads; i++) {
789 pipe_semaphore_wait(&rast->tasks[i].work_done);
790 }
791 }
792 }
793
794
795 /**
796 * This is the thread's main entrypoint.
797 * It's a simple loop:
798 * 1. wait for work
799 * 2. do work
800 * 3. signal that we're done
801 */
802 static int
803 thread_function(void *init_data)
804 {
805 struct lp_rasterizer_task *task = (struct lp_rasterizer_task *) init_data;
806 struct lp_rasterizer *rast = task->rast;
807 boolean debug = false;
808 char thread_name[16];
809 unsigned fpstate;
810
811 snprintf(thread_name, sizeof thread_name, "llvmpipe-%u", task->thread_index);
812 u_thread_setname(thread_name);
813
814 /* Make sure that denorms are treated like zeros. This is
815 * the behavior required by D3D10. OpenGL doesn't care.
816 */
817 fpstate = util_fpstate_get();
818 util_fpstate_set_denorms_to_zero(fpstate);
819
820 while (1) {
821 /* wait for work */
822 if (debug)
823 debug_printf("thread %d waiting for work\n", task->thread_index);
824 pipe_semaphore_wait(&task->work_ready);
825
826 if (rast->exit_flag)
827 break;
828
829 if (task->thread_index == 0) {
830 /* thread[0]:
831 * - get next scene to rasterize
832 * - map the framebuffer surfaces
833 */
834 lp_rast_begin( rast,
835 lp_scene_dequeue( rast->full_scenes, TRUE ) );
836 }
837
838 /* Wait for all threads to get here so that threads[1+] don't
839 * get a null rast->curr_scene pointer.
840 */
841 util_barrier_wait( &rast->barrier );
842
843 /* do work */
844 if (debug)
845 debug_printf("thread %d doing work\n", task->thread_index);
846
847 rasterize_scene(task,
848 rast->curr_scene);
849
850 /* wait for all threads to finish with this scene */
851 util_barrier_wait( &rast->barrier );
852
853 /* XXX: shouldn't be necessary:
854 */
855 if (task->thread_index == 0) {
856 lp_rast_end( rast );
857 }
858
859 /* signal done with work */
860 if (debug)
861 debug_printf("thread %d done working\n", task->thread_index);
862
863 pipe_semaphore_signal(&task->work_done);
864 }
865
866 #ifdef _WIN32
867 pipe_semaphore_signal(&task->work_done);
868 #endif
869
870 return 0;
871 }
872
873
874 /**
875 * Initialize semaphores and spawn the threads.
876 */
877 static void
878 create_rast_threads(struct lp_rasterizer *rast)
879 {
880 unsigned i;
881
882 /* NOTE: if num_threads is zero, we won't use any threads */
883 for (i = 0; i < rast->num_threads; i++) {
884 pipe_semaphore_init(&rast->tasks[i].work_ready, 0);
885 pipe_semaphore_init(&rast->tasks[i].work_done, 0);
886 rast->threads[i] = u_thread_create(thread_function,
887 (void *) &rast->tasks[i]);
888 if (!rast->threads[i]) {
889 rast->num_threads = i; /* previous thread is max */
890 break;
891 }
892 }
893 }
894
895
896
897 /**
898 * Create new lp_rasterizer. If num_threads is zero, don't create any
899 * new threads, do rendering synchronously.
900 * \param num_threads number of rasterizer threads to create
901 */
902 struct lp_rasterizer *
903 lp_rast_create( unsigned num_threads )
904 {
905 struct lp_rasterizer *rast;
906 unsigned i;
907
908 rast = CALLOC_STRUCT(lp_rasterizer);
909 if (!rast) {
910 goto no_rast;
911 }
912
913 rast->full_scenes = lp_scene_queue_create();
914 if (!rast->full_scenes) {
915 goto no_full_scenes;
916 }
917
918 for (i = 0; i < MAX2(1, num_threads); i++) {
919 struct lp_rasterizer_task *task = &rast->tasks[i];
920 task->rast = rast;
921 task->thread_index = i;
922 task->thread_data.cache = align_malloc(sizeof(struct lp_build_format_cache),
923 16);
924 if (!task->thread_data.cache) {
925 goto no_thread_data_cache;
926 }
927 }
928
929 rast->num_threads = num_threads;
930
931 rast->no_rast = debug_get_bool_option("LP_NO_RAST", FALSE);
932
933 create_rast_threads(rast);
934
935 /* for synchronizing rasterization threads */
936 if (rast->num_threads > 0) {
937 util_barrier_init( &rast->barrier, rast->num_threads );
938 }
939
940 memset(lp_dummy_tile, 0, sizeof lp_dummy_tile);
941
942 return rast;
943
944 no_thread_data_cache:
945 for (i = 0; i < MAX2(1, rast->num_threads); i++) {
946 if (rast->tasks[i].thread_data.cache) {
947 align_free(rast->tasks[i].thread_data.cache);
948 }
949 }
950
951 lp_scene_queue_destroy(rast->full_scenes);
952 no_full_scenes:
953 FREE(rast);
954 no_rast:
955 return NULL;
956 }
957
958
959 /* Shutdown:
960 */
961 void lp_rast_destroy( struct lp_rasterizer *rast )
962 {
963 unsigned i;
964
965 /* Set exit_flag and signal each thread's work_ready semaphore.
966 * Each thread will be woken up, notice that the exit_flag is set and
967 * break out of its main loop. The thread will then exit.
968 */
969 rast->exit_flag = TRUE;
970 for (i = 0; i < rast->num_threads; i++) {
971 pipe_semaphore_signal(&rast->tasks[i].work_ready);
972 }
973
974 /* Wait for threads to terminate before cleaning up per-thread data.
975 * We don't actually call pipe_thread_wait to avoid dead lock on Windows
976 * per https://bugs.freedesktop.org/show_bug.cgi?id=76252 */
977 for (i = 0; i < rast->num_threads; i++) {
978 #ifdef _WIN32
979 pipe_semaphore_wait(&rast->tasks[i].work_done);
980 #else
981 thrd_join(rast->threads[i], NULL);
982 #endif
983 }
984
985 /* Clean up per-thread data */
986 for (i = 0; i < rast->num_threads; i++) {
987 pipe_semaphore_destroy(&rast->tasks[i].work_ready);
988 pipe_semaphore_destroy(&rast->tasks[i].work_done);
989 }
990 for (i = 0; i < MAX2(1, rast->num_threads); i++) {
991 align_free(rast->tasks[i].thread_data.cache);
992 }
993
994 /* for synchronizing rasterization threads */
995 if (rast->num_threads > 0) {
996 util_barrier_destroy( &rast->barrier );
997 }
998
999 lp_scene_queue_destroy(rast->full_scenes);
1000
1001 FREE(rast);
1002 }
1003
1004