ef49ba9ab6f50f0457febe12e83ab047ff39f80f
[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
35 #include "os/os_time.h"
36
37 #include "lp_scene_queue.h"
38 #include "lp_debug.h"
39 #include "lp_fence.h"
40 #include "lp_perf.h"
41 #include "lp_query.h"
42 #include "lp_rast.h"
43 #include "lp_rast_priv.h"
44 #include "gallivm/lp_bld_debug.h"
45 #include "lp_scene.h"
46 #include "lp_tex_sample.h"
47
48
49 #ifdef DEBUG
50 int jit_line = 0;
51 const struct lp_rast_state *jit_state = NULL;
52 const struct lp_rasterizer_task *jit_task = NULL;
53 #endif
54
55
56 /**
57 * Begin rasterizing a scene.
58 * Called once per scene by one thread.
59 */
60 static void
61 lp_rast_begin( struct lp_rasterizer *rast,
62 struct lp_scene *scene )
63 {
64
65 rast->curr_scene = scene;
66
67 LP_DBG(DEBUG_RAST, "%s\n", __FUNCTION__);
68
69 lp_scene_begin_rasterization( scene );
70 lp_scene_bin_iter_begin( scene );
71 }
72
73
74 static void
75 lp_rast_end( struct lp_rasterizer *rast )
76 {
77 lp_scene_end_rasterization( rast->curr_scene );
78
79 rast->curr_scene = NULL;
80 }
81
82
83 /**
84 * Begining rasterization of a tile.
85 * \param x window X position of the tile, in pixels
86 * \param y window Y position of the tile, in pixels
87 */
88 static void
89 lp_rast_tile_begin(struct lp_rasterizer_task *task,
90 const struct cmd_bin *bin)
91 {
92 const struct lp_scene *scene = task->scene;
93 enum lp_texture_usage usage;
94
95 LP_DBG(DEBUG_RAST, "%s %d,%d\n", __FUNCTION__, bin->x, bin->y);
96
97 task->bin = bin;
98 task->x = bin->x * TILE_SIZE;
99 task->y = bin->y * TILE_SIZE;
100
101 /* reset pointers to color tile(s) */
102 memset(task->color_tiles, 0, sizeof(task->color_tiles));
103
104 /* get pointer to depth/stencil tile */
105 {
106 struct pipe_surface *zsbuf = task->scene->fb.zsbuf;
107 if (zsbuf) {
108 struct llvmpipe_resource *lpt = llvmpipe_resource(zsbuf->texture);
109
110 if (scene->has_depthstencil_clear)
111 usage = LP_TEX_USAGE_WRITE_ALL;
112 else
113 usage = LP_TEX_USAGE_READ_WRITE;
114
115 /* "prime" the tile: convert data from linear to tiled if necessary
116 * and update the tile's layout info.
117 */
118 (void) llvmpipe_get_texture_tile(lpt,
119 zsbuf->u.tex.first_layer,
120 zsbuf->u.tex.level,
121 usage,
122 task->x,
123 task->y);
124 /* Get actual pointer to the tile data. Note that depth/stencil
125 * data is tiled differently than color data.
126 */
127 task->depth_tile = lp_rast_get_depth_block_pointer(task,
128 task->x,
129 task->y);
130
131 assert(task->depth_tile);
132 }
133 else {
134 task->depth_tile = NULL;
135 }
136 }
137 }
138
139
140 /**
141 * Clear the rasterizer's current color tile.
142 * This is a bin command called during bin processing.
143 */
144 static void
145 lp_rast_clear_color(struct lp_rasterizer_task *task,
146 const union lp_rast_cmd_arg arg)
147 {
148 const struct lp_scene *scene = task->scene;
149
150 if (scene->fb.nr_cbufs) {
151 unsigned i;
152 union util_color uc;
153
154 if (util_format_is_pure_integer(scene->fb.cbufs[0]->format)) {
155 /*
156 * We expect int/uint clear values here, though some APIs
157 * might disagree (but in any case util_pack_color()
158 * couldn't handle it)...
159 */
160 LP_DBG(DEBUG_RAST, "%s pure int 0x%x,0x%x,0x%x,0x%x\n", __FUNCTION__,
161 arg.clear_color.ui[0],
162 arg.clear_color.ui[1],
163 arg.clear_color.ui[2],
164 arg.clear_color.ui[3]);
165
166 for (i = 0; i < scene->fb.nr_cbufs; i++) {
167 enum pipe_format format = scene->fb.cbufs[i]->format;
168
169 if (util_format_is_pure_sint(format)) {
170 util_format_write_4i(format, arg.clear_color.i, 0, &uc, 0, 0, 0, 1, 1);
171 }
172 else {
173 assert(util_format_is_pure_uint(format));
174 util_format_write_4ui(format, arg.clear_color.ui, 0, &uc, 0, 0, 0, 1, 1);
175 }
176
177 util_fill_rect(scene->cbufs[i].map,
178 scene->fb.cbufs[i]->format,
179 scene->cbufs[i].stride,
180 task->x,
181 task->y,
182 TILE_SIZE,
183 TILE_SIZE,
184 &uc);
185 }
186 }
187 else {
188 uint8_t clear_color[4];
189
190 for (i = 0; i < 4; ++i) {
191 clear_color[i] = float_to_ubyte(arg.clear_color.f[i]);
192 }
193
194 LP_DBG(DEBUG_RAST, "%s 0x%x,0x%x,0x%x,0x%x\n", __FUNCTION__,
195 clear_color[0],
196 clear_color[1],
197 clear_color[2],
198 clear_color[3]);
199
200 for (i = 0; i < scene->fb.nr_cbufs; i++) {
201
202 util_pack_color(arg.clear_color.f,
203 scene->fb.cbufs[i]->format, &uc);
204
205 util_fill_rect(scene->cbufs[i].map,
206 scene->fb.cbufs[i]->format,
207 scene->cbufs[i].stride,
208 task->x,
209 task->y,
210 TILE_SIZE,
211 TILE_SIZE,
212 &uc);
213 }
214 }
215 }
216
217 LP_COUNT(nr_color_tile_clear);
218 }
219
220
221
222
223
224
225 /**
226 * Clear the rasterizer's current z/stencil tile.
227 * This is a bin command called during bin processing.
228 */
229 static void
230 lp_rast_clear_zstencil(struct lp_rasterizer_task *task,
231 const union lp_rast_cmd_arg arg)
232 {
233 const struct lp_scene *scene = task->scene;
234 uint32_t clear_value = arg.clear_zstencil.value;
235 uint32_t clear_mask = arg.clear_zstencil.mask;
236 const unsigned height = TILE_SIZE / TILE_VECTOR_HEIGHT;
237 const unsigned width = TILE_SIZE * TILE_VECTOR_HEIGHT;
238 const unsigned block_size = scene->zsbuf.blocksize;
239 const unsigned dst_stride = scene->zsbuf.stride * TILE_VECTOR_HEIGHT;
240 uint8_t *dst;
241 unsigned i, j;
242
243 LP_DBG(DEBUG_RAST, "%s: value=0x%08x, mask=0x%08x\n",
244 __FUNCTION__, clear_value, clear_mask);
245
246 /*
247 * Clear the area of the swizzled depth/depth buffer matching this tile, in
248 * stripes of TILE_VECTOR_HEIGHT x TILE_SIZE at a time.
249 *
250 * The swizzled depth format is such that the depths for
251 * TILE_VECTOR_HEIGHT x TILE_VECTOR_WIDTH pixels have consecutive offsets.
252 */
253
254 dst = task->depth_tile;
255
256 clear_value &= clear_mask;
257
258 switch (block_size) {
259 case 1:
260 assert(clear_mask == 0xff);
261 memset(dst, (uint8_t) clear_value, height * width);
262 break;
263 case 2:
264 if (clear_mask == 0xffff) {
265 for (i = 0; i < height; i++) {
266 uint16_t *row = (uint16_t *)dst;
267 for (j = 0; j < width; j++)
268 *row++ = (uint16_t) clear_value;
269 dst += dst_stride;
270 }
271 }
272 else {
273 for (i = 0; i < height; i++) {
274 uint16_t *row = (uint16_t *)dst;
275 for (j = 0; j < width; j++) {
276 uint16_t tmp = ~clear_mask & *row;
277 *row++ = clear_value | tmp;
278 }
279 dst += dst_stride;
280 }
281 }
282 break;
283 case 4:
284 if (clear_mask == 0xffffffff) {
285 for (i = 0; i < height; i++) {
286 uint32_t *row = (uint32_t *)dst;
287 for (j = 0; j < width; j++)
288 *row++ = clear_value;
289 dst += dst_stride;
290 }
291 }
292 else {
293 for (i = 0; i < height; i++) {
294 uint32_t *row = (uint32_t *)dst;
295 for (j = 0; j < width; j++) {
296 uint32_t tmp = ~clear_mask & *row;
297 *row++ = clear_value | tmp;
298 }
299 dst += dst_stride;
300 }
301 }
302 break;
303 default:
304 assert(0);
305 break;
306 }
307 }
308
309
310
311 /**
312 * Run the shader on all blocks in a tile. This is used when a tile is
313 * completely contained inside a triangle.
314 * This is a bin command called during bin processing.
315 */
316 static void
317 lp_rast_shade_tile(struct lp_rasterizer_task *task,
318 const union lp_rast_cmd_arg arg)
319 {
320 const struct lp_scene *scene = task->scene;
321 const struct lp_rast_shader_inputs *inputs = arg.shade_tile;
322 const struct lp_rast_state *state;
323 struct lp_fragment_shader_variant *variant;
324 const unsigned tile_x = task->x, tile_y = task->y;
325 unsigned x, y;
326
327 if (inputs->disable) {
328 /* This command was partially binned and has been disabled */
329 return;
330 }
331
332 LP_DBG(DEBUG_RAST, "%s\n", __FUNCTION__);
333
334 state = task->state;
335 assert(state);
336 if (!state) {
337 return;
338 }
339 variant = state->variant;
340
341 /* render the whole 64x64 tile in 4x4 chunks */
342 for (y = 0; y < TILE_SIZE; y += 4){
343 for (x = 0; x < TILE_SIZE; x += 4) {
344 uint8_t *color[PIPE_MAX_COLOR_BUFS];
345 unsigned stride[PIPE_MAX_COLOR_BUFS];
346 uint32_t *depth;
347 unsigned i;
348
349 /* color buffer */
350 for (i = 0; i < scene->fb.nr_cbufs; i++){
351 stride[i] = scene->cbufs[i].stride;
352
353 color[i] = lp_rast_get_unswizzled_color_block_pointer(task, i, tile_x + x, tile_y + y);
354 }
355
356 /* depth buffer */
357 depth = lp_rast_get_depth_block_pointer(task, tile_x + x, tile_y + y);
358
359 /* run shader on 4x4 block */
360 BEGIN_JIT_CALL(state, task);
361 variant->jit_function[RAST_WHOLE]( &state->jit_context,
362 tile_x + x, tile_y + y,
363 inputs->frontfacing,
364 GET_A0(inputs),
365 GET_DADX(inputs),
366 GET_DADY(inputs),
367 color,
368 depth,
369 0xffff,
370 &task->thread_data,
371 stride);
372 END_JIT_CALL();
373 }
374 }
375 }
376
377
378 /**
379 * Run the shader on all blocks in a tile. This is used when a tile is
380 * completely contained inside a triangle, and the shader is opaque.
381 * This is a bin command called during bin processing.
382 */
383 static void
384 lp_rast_shade_tile_opaque(struct lp_rasterizer_task *task,
385 const union lp_rast_cmd_arg arg)
386 {
387 LP_DBG(DEBUG_RAST, "%s\n", __FUNCTION__);
388
389 assert(task->state);
390 if (!task->state) {
391 return;
392 }
393
394 lp_rast_shade_tile(task, arg);
395 }
396
397
398 /**
399 * Compute shading for a 4x4 block of pixels inside a triangle.
400 * This is a bin command called during bin processing.
401 * \param x X position of quad in window coords
402 * \param y Y position of quad in window coords
403 */
404 void
405 lp_rast_shade_quads_mask(struct lp_rasterizer_task *task,
406 const struct lp_rast_shader_inputs *inputs,
407 unsigned x, unsigned y,
408 unsigned mask)
409 {
410 const struct lp_rast_state *state = task->state;
411 struct lp_fragment_shader_variant *variant = state->variant;
412 const struct lp_scene *scene = task->scene;
413 uint8_t *color[PIPE_MAX_COLOR_BUFS];
414 unsigned stride[PIPE_MAX_COLOR_BUFS];
415 void *depth;
416 unsigned i;
417
418 assert(state);
419
420 /* Sanity checks */
421 assert(x < scene->tiles_x * TILE_SIZE);
422 assert(y < scene->tiles_y * TILE_SIZE);
423 assert(x % TILE_VECTOR_WIDTH == 0);
424 assert(y % TILE_VECTOR_HEIGHT == 0);
425
426 assert((x % 4) == 0);
427 assert((y % 4) == 0);
428
429 /* color buffer */
430 for (i = 0; i < scene->fb.nr_cbufs; i++) {
431 stride[i] = scene->cbufs[i].stride;
432
433 color[i] = lp_rast_get_unswizzled_color_block_pointer(task, i, x, y);
434 }
435
436 /* depth buffer */
437 depth = lp_rast_get_depth_block_pointer(task, x, y);
438
439
440 assert(lp_check_alignment(state->jit_context.u8_blend_color, 16));
441
442 /* run shader on 4x4 block */
443 BEGIN_JIT_CALL(state, task);
444 variant->jit_function[RAST_EDGE_TEST](&state->jit_context,
445 x, y,
446 inputs->frontfacing,
447 GET_A0(inputs),
448 GET_DADX(inputs),
449 GET_DADY(inputs),
450 color,
451 depth,
452 mask,
453 &task->thread_data,
454 stride);
455 END_JIT_CALL();
456 }
457
458
459
460 /**
461 * Begin a new occlusion query.
462 * This is a bin command put in all bins.
463 * Called per thread.
464 */
465 static void
466 lp_rast_begin_query(struct lp_rasterizer_task *task,
467 const union lp_rast_cmd_arg arg)
468 {
469 struct llvmpipe_query *pq = arg.query_obj;
470
471 assert(task->query[pq->type] == NULL);
472
473 switch (pq->type) {
474 case PIPE_QUERY_OCCLUSION_COUNTER:
475 task->thread_data.vis_counter = 0;
476 break;
477 case PIPE_QUERY_PRIMITIVES_GENERATED:
478 case PIPE_QUERY_PRIMITIVES_EMITTED:
479 case PIPE_QUERY_SO_STATISTICS:
480 case PIPE_QUERY_PIPELINE_STATISTICS:
481 case PIPE_QUERY_SO_OVERFLOW_PREDICATE:
482 break;
483 default:
484 assert(0);
485 break;
486 }
487
488 task->query[pq->type] = pq;
489 }
490
491
492 /**
493 * End the current occlusion query.
494 * This is a bin command put in all bins.
495 * Called per thread.
496 */
497 static void
498 lp_rast_end_query(struct lp_rasterizer_task *task,
499 const union lp_rast_cmd_arg arg)
500 {
501 struct llvmpipe_query *pq = arg.query_obj;
502 assert(task->query[pq->type] == pq || pq->type == PIPE_QUERY_TIMESTAMP);
503
504 switch (pq->type) {
505 case PIPE_QUERY_OCCLUSION_COUNTER:
506 pq->count[task->thread_index] += task->thread_data.vis_counter;
507 break;
508 case PIPE_QUERY_TIMESTAMP:
509 pq->count[task->thread_index] = os_time_get_nano();
510 break;
511 case PIPE_QUERY_PRIMITIVES_GENERATED:
512 case PIPE_QUERY_PRIMITIVES_EMITTED:
513 case PIPE_QUERY_SO_STATISTICS:
514 case PIPE_QUERY_PIPELINE_STATISTICS:
515 case PIPE_QUERY_SO_OVERFLOW_PREDICATE:
516 break;
517 default:
518 assert(0);
519 break;
520 }
521
522 if (task->query[pq->type] == pq) {
523 task->query[pq->type] = NULL;
524 }
525 }
526
527
528 void
529 lp_rast_set_state(struct lp_rasterizer_task *task,
530 const union lp_rast_cmd_arg arg)
531 {
532 task->state = arg.state;
533 }
534
535
536
537 /**
538 * Called when we're done writing to a color tile.
539 */
540 static void
541 lp_rast_tile_end(struct lp_rasterizer_task *task)
542 {
543 unsigned i;
544
545 for (i = 0; i < PIPE_QUERY_TYPES; ++i) {
546 if (task->query[i]) {
547 lp_rast_end_query(task, lp_rast_arg_query(task->query[i]));
548 }
549 }
550
551 /* debug */
552 memset(task->color_tiles, 0, sizeof(task->color_tiles));
553 task->depth_tile = NULL;
554
555 task->bin = NULL;
556 }
557
558 static lp_rast_cmd_func dispatch[LP_RAST_OP_MAX] =
559 {
560 lp_rast_clear_color,
561 lp_rast_clear_zstencil,
562 lp_rast_triangle_1,
563 lp_rast_triangle_2,
564 lp_rast_triangle_3,
565 lp_rast_triangle_4,
566 lp_rast_triangle_5,
567 lp_rast_triangle_6,
568 lp_rast_triangle_7,
569 lp_rast_triangle_8,
570 lp_rast_triangle_3_4,
571 lp_rast_triangle_3_16,
572 lp_rast_triangle_4_16,
573 lp_rast_shade_tile,
574 lp_rast_shade_tile_opaque,
575 lp_rast_begin_query,
576 lp_rast_end_query,
577 lp_rast_set_state,
578 };
579
580
581 static void
582 do_rasterize_bin(struct lp_rasterizer_task *task,
583 const struct cmd_bin *bin)
584 {
585 const struct cmd_block *block;
586 unsigned k;
587
588 if (0)
589 lp_debug_bin(bin);
590
591 for (block = bin->head; block; block = block->next) {
592 for (k = 0; k < block->count; k++) {
593 dispatch[block->cmd[k]]( task, block->arg[k] );
594 }
595 }
596 }
597
598
599
600 /**
601 * Rasterize commands for a single bin.
602 * \param x, y position of the bin's tile in the framebuffer
603 * Must be called between lp_rast_begin() and lp_rast_end().
604 * Called per thread.
605 */
606 static void
607 rasterize_bin(struct lp_rasterizer_task *task,
608 const struct cmd_bin *bin )
609 {
610 lp_rast_tile_begin( task, bin );
611
612 do_rasterize_bin(task, bin);
613
614 lp_rast_tile_end(task);
615
616
617 /* Debug/Perf flags:
618 */
619 if (bin->head->count == 1) {
620 if (bin->head->cmd[0] == LP_RAST_OP_SHADE_TILE_OPAQUE)
621 LP_COUNT(nr_pure_shade_opaque_64);
622 else if (bin->head->cmd[0] == LP_RAST_OP_SHADE_TILE)
623 LP_COUNT(nr_pure_shade_64);
624 }
625 }
626
627
628 /* An empty bin is one that just loads the contents of the tile and
629 * stores them again unchanged. This typically happens when bins have
630 * been flushed for some reason in the middle of a frame, or when
631 * incremental updates are being made to a render target.
632 *
633 * Try to avoid doing pointless work in this case.
634 */
635 static boolean
636 is_empty_bin( const struct cmd_bin *bin )
637 {
638 return bin->head == NULL;
639 }
640
641
642 /**
643 * Rasterize/execute all bins within a scene.
644 * Called per thread.
645 */
646 static void
647 rasterize_scene(struct lp_rasterizer_task *task,
648 struct lp_scene *scene)
649 {
650 task->scene = scene;
651
652 if (!task->rast->no_rast && !scene->discard) {
653 /* loop over scene bins, rasterize each */
654 #if 0
655 {
656 unsigned i, j;
657 for (i = 0; i < scene->tiles_x; i++) {
658 for (j = 0; j < scene->tiles_y; j++) {
659 struct cmd_bin *bin = lp_scene_get_bin(scene, i, j);
660 rasterize_bin(task, bin, i, j);
661 }
662 }
663 }
664 #else
665 {
666 struct cmd_bin *bin;
667
668 assert(scene);
669 while ((bin = lp_scene_bin_iter_next(scene))) {
670 if (!is_empty_bin( bin ))
671 rasterize_bin(task, bin);
672 }
673 }
674 #endif
675 }
676
677
678 if (scene->fence) {
679 lp_fence_signal(scene->fence);
680 }
681
682 task->scene = NULL;
683 }
684
685
686 /**
687 * Called by setup module when it has something for us to render.
688 */
689 void
690 lp_rast_queue_scene( struct lp_rasterizer *rast,
691 struct lp_scene *scene)
692 {
693 LP_DBG(DEBUG_SETUP, "%s\n", __FUNCTION__);
694
695 if (rast->num_threads == 0) {
696 /* no threading */
697
698 lp_rast_begin( rast, scene );
699
700 rasterize_scene( &rast->tasks[0], scene );
701
702 lp_rast_end( rast );
703
704 rast->curr_scene = NULL;
705 }
706 else {
707 /* threaded rendering! */
708 unsigned i;
709
710 lp_scene_enqueue( rast->full_scenes, scene );
711
712 /* signal the threads that there's work to do */
713 for (i = 0; i < rast->num_threads; i++) {
714 pipe_semaphore_signal(&rast->tasks[i].work_ready);
715 }
716 }
717
718 LP_DBG(DEBUG_SETUP, "%s done \n", __FUNCTION__);
719 }
720
721
722 void
723 lp_rast_finish( struct lp_rasterizer *rast )
724 {
725 if (rast->num_threads == 0) {
726 /* nothing to do */
727 }
728 else {
729 int i;
730
731 /* wait for work to complete */
732 for (i = 0; i < rast->num_threads; i++) {
733 pipe_semaphore_wait(&rast->tasks[i].work_done);
734 }
735 }
736 }
737
738
739 /**
740 * This is the thread's main entrypoint.
741 * It's a simple loop:
742 * 1. wait for work
743 * 2. do work
744 * 3. signal that we're done
745 */
746 static PIPE_THREAD_ROUTINE( thread_function, init_data )
747 {
748 struct lp_rasterizer_task *task = (struct lp_rasterizer_task *) init_data;
749 struct lp_rasterizer *rast = task->rast;
750 boolean debug = false;
751
752 while (1) {
753 /* wait for work */
754 if (debug)
755 debug_printf("thread %d waiting for work\n", task->thread_index);
756 pipe_semaphore_wait(&task->work_ready);
757
758 if (rast->exit_flag)
759 break;
760
761 if (task->thread_index == 0) {
762 /* thread[0]:
763 * - get next scene to rasterize
764 * - map the framebuffer surfaces
765 */
766 lp_rast_begin( rast,
767 lp_scene_dequeue( rast->full_scenes, TRUE ) );
768 }
769
770 /* Wait for all threads to get here so that threads[1+] don't
771 * get a null rast->curr_scene pointer.
772 */
773 pipe_barrier_wait( &rast->barrier );
774
775 /* do work */
776 if (debug)
777 debug_printf("thread %d doing work\n", task->thread_index);
778
779 rasterize_scene(task,
780 rast->curr_scene);
781
782 /* wait for all threads to finish with this scene */
783 pipe_barrier_wait( &rast->barrier );
784
785 /* XXX: shouldn't be necessary:
786 */
787 if (task->thread_index == 0) {
788 lp_rast_end( rast );
789 }
790
791 /* signal done with work */
792 if (debug)
793 debug_printf("thread %d done working\n", task->thread_index);
794
795 pipe_semaphore_signal(&task->work_done);
796 }
797
798 return NULL;
799 }
800
801
802 /**
803 * Initialize semaphores and spawn the threads.
804 */
805 static void
806 create_rast_threads(struct lp_rasterizer *rast)
807 {
808 unsigned i;
809
810 /* NOTE: if num_threads is zero, we won't use any threads */
811 for (i = 0; i < rast->num_threads; i++) {
812 pipe_semaphore_init(&rast->tasks[i].work_ready, 0);
813 pipe_semaphore_init(&rast->tasks[i].work_done, 0);
814 rast->threads[i] = pipe_thread_create(thread_function,
815 (void *) &rast->tasks[i]);
816 }
817 }
818
819
820
821 /**
822 * Create new lp_rasterizer. If num_threads is zero, don't create any
823 * new threads, do rendering synchronously.
824 * \param num_threads number of rasterizer threads to create
825 */
826 struct lp_rasterizer *
827 lp_rast_create( unsigned num_threads )
828 {
829 struct lp_rasterizer *rast;
830 unsigned i;
831
832 rast = CALLOC_STRUCT(lp_rasterizer);
833 if (!rast) {
834 goto no_rast;
835 }
836
837 rast->full_scenes = lp_scene_queue_create();
838 if (!rast->full_scenes) {
839 goto no_full_scenes;
840 }
841
842 for (i = 0; i < Elements(rast->tasks); i++) {
843 struct lp_rasterizer_task *task = &rast->tasks[i];
844 task->rast = rast;
845 task->thread_index = i;
846 }
847
848 rast->num_threads = num_threads;
849
850 rast->no_rast = debug_get_bool_option("LP_NO_RAST", FALSE);
851
852 create_rast_threads(rast);
853
854 /* for synchronizing rasterization threads */
855 pipe_barrier_init( &rast->barrier, rast->num_threads );
856
857 memset(lp_dummy_tile, 0, sizeof lp_dummy_tile);
858
859 return rast;
860
861 no_full_scenes:
862 FREE(rast);
863 no_rast:
864 return NULL;
865 }
866
867
868 /* Shutdown:
869 */
870 void lp_rast_destroy( struct lp_rasterizer *rast )
871 {
872 unsigned i;
873
874 /* Set exit_flag and signal each thread's work_ready semaphore.
875 * Each thread will be woken up, notice that the exit_flag is set and
876 * break out of its main loop. The thread will then exit.
877 */
878 rast->exit_flag = TRUE;
879 for (i = 0; i < rast->num_threads; i++) {
880 pipe_semaphore_signal(&rast->tasks[i].work_ready);
881 }
882
883 /* Wait for threads to terminate before cleaning up per-thread data */
884 for (i = 0; i < rast->num_threads; i++) {
885 pipe_thread_wait(rast->threads[i]);
886 }
887
888 /* Clean up per-thread data */
889 for (i = 0; i < rast->num_threads; i++) {
890 pipe_semaphore_destroy(&rast->tasks[i].work_ready);
891 pipe_semaphore_destroy(&rast->tasks[i].work_done);
892 }
893
894 /* for synchronizing rasterization threads */
895 pipe_barrier_destroy( &rast->barrier );
896
897 lp_scene_queue_destroy(rast->full_scenes);
898
899 FREE(rast);
900 }
901
902
903 /** Return number of rasterization threads */
904 unsigned
905 lp_rast_get_num_threads( struct lp_rasterizer *rast )
906 {
907 return rast->num_threads;
908 }
909
910