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